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.
 
 
 
 
 
 

1462 lines
36 KiB

  1. /***************************************************************************
  2. * Copyright (C) 2009 by Simon Qian *
  3. * SimonQian@SimonQian.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 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. /* The specification for SVF is available here:
  21. * http://www.asset-intertech.com/support/svf.pdf
  22. * Below, this document is refered to as the "SVF spec".
  23. *
  24. * The specification for XSVF is available here:
  25. * http://www.xilinx.com/support/documentation/application_notes/xapp503.pdf
  26. * Below, this document is refered to as the "XSVF spec".
  27. */
  28. #ifdef HAVE_CONFIG_H
  29. #include "config.h"
  30. #endif
  31. #include "svf.h"
  32. #include "jtag.h"
  33. #include "time_support.h"
  34. // SVF command
  35. typedef enum
  36. {
  37. ENDDR,
  38. ENDIR,
  39. FREQUENCY,
  40. HDR,
  41. HIR,
  42. PIO,
  43. PIOMAP,
  44. RUNTEST,
  45. SDR,
  46. SIR,
  47. STATE,
  48. TDR,
  49. TIR,
  50. TRST,
  51. }svf_command_t;
  52. const char *svf_command_name[14] =
  53. {
  54. "ENDDR",
  55. "ENDIR",
  56. "FREQUENCY",
  57. "HDR",
  58. "HIR",
  59. "PIO",
  60. "PIOMAP",
  61. "RUNTEST",
  62. "SDR",
  63. "SIR",
  64. "STATE",
  65. "TDR",
  66. "TIR",
  67. "TRST"
  68. };
  69. typedef enum
  70. {
  71. TRST_ON,
  72. TRST_OFF,
  73. TRST_Z,
  74. TRST_ABSENT
  75. }trst_mode_t;
  76. const char *svf_trst_mode_name[4] =
  77. {
  78. "ON",
  79. "OFF",
  80. "Z",
  81. "ABSENT"
  82. };
  83. typedef struct
  84. {
  85. tap_state_t from;
  86. tap_state_t to;
  87. uint32_t num_of_moves;
  88. tap_state_t paths[8];
  89. }svf_statemove_t;
  90. svf_statemove_t svf_statemoves[] =
  91. {
  92. // from to num_of_moves, paths[8]
  93. // {TAP_RESET, TAP_RESET, 1, {TAP_RESET}},
  94. {TAP_RESET, TAP_IDLE, 2, {TAP_RESET, TAP_IDLE}},
  95. {TAP_RESET, TAP_DRPAUSE, 6, {TAP_RESET, TAP_IDLE, TAP_DRSELECT, TAP_DRCAPTURE, TAP_DREXIT1, TAP_DRPAUSE}},
  96. {TAP_RESET, TAP_IRPAUSE, 7, {TAP_RESET, TAP_IDLE, TAP_DRSELECT, TAP_IRSELECT, TAP_IRCAPTURE, TAP_IREXIT1, TAP_IRPAUSE}},
  97. // {TAP_IDLE, TAP_RESET, 4, {TAP_IDLE, TAP_DRSELECT, TAP_IRSELECT, TAP_RESET}},
  98. {TAP_IDLE, TAP_IDLE, 1, {TAP_IDLE}},
  99. {TAP_IDLE, TAP_DRPAUSE, 5, {TAP_IDLE, TAP_DRSELECT, TAP_DRCAPTURE, TAP_DREXIT1, TAP_DRPAUSE}},
  100. {TAP_IDLE, TAP_IRPAUSE, 6, {TAP_IDLE, TAP_DRSELECT, TAP_IRSELECT, TAP_IRCAPTURE, TAP_IREXIT1, TAP_IRPAUSE}},
  101. // {TAP_DRPAUSE, TAP_RESET, 6, {TAP_DRPAUSE, TAP_DREXIT2, TAP_DRUPDATE, TAP_DRSELECT, TAP_IRSELECT, TAP_RESET}},
  102. {TAP_DRPAUSE, TAP_IDLE, 4, {TAP_DRPAUSE, TAP_DREXIT2, TAP_DRUPDATE, TAP_IDLE}},
  103. {TAP_DRPAUSE, TAP_DRPAUSE, 7, {TAP_DRPAUSE, TAP_DREXIT2, TAP_DRUPDATE, TAP_DRSELECT, TAP_DRCAPTURE, TAP_DREXIT1, TAP_DRPAUSE}},
  104. {TAP_DRPAUSE, TAP_IRPAUSE, 8, {TAP_DRPAUSE, TAP_DREXIT2, TAP_DRUPDATE, TAP_DRSELECT, TAP_IRSELECT, TAP_IRCAPTURE, TAP_IREXIT1, TAP_IRPAUSE}},
  105. // {TAP_IRPAUSE, TAP_RESET, 6, {TAP_IRPAUSE, TAP_IREXIT2, TAP_IRUPDATE, TAP_DRSELECT, TAP_IRSELECT, TAP_RESET}},
  106. {TAP_IRPAUSE, TAP_IDLE, 4, {TAP_IRPAUSE, TAP_IREXIT2, TAP_IRUPDATE, TAP_IDLE}},
  107. {TAP_IRPAUSE, TAP_DRPAUSE, 7, {TAP_IRPAUSE, TAP_IREXIT2, TAP_IRUPDATE, TAP_DRSELECT, TAP_DRCAPTURE, TAP_DREXIT1, TAP_DRPAUSE}},
  108. {TAP_IRPAUSE, TAP_IRPAUSE, 8, {TAP_IRPAUSE, TAP_IREXIT2, TAP_IRUPDATE, TAP_DRSELECT, TAP_IRSELECT, TAP_IRCAPTURE, TAP_IREXIT1, TAP_IRPAUSE}}
  109. };
  110. char *svf_tap_state_name[TAP_NUM_STATES];
  111. #define XXR_TDI (1 << 0)
  112. #define XXR_TDO (1 << 1)
  113. #define XXR_MASK (1 << 2)
  114. #define XXR_SMASK (1 << 3)
  115. typedef struct
  116. {
  117. int len;
  118. int data_mask;
  119. uint8_t *tdi;
  120. uint8_t *tdo;
  121. uint8_t *mask;
  122. uint8_t *smask;
  123. }svf_xxr_para_t;
  124. typedef struct
  125. {
  126. float frequency;
  127. tap_state_t ir_end_state;
  128. tap_state_t dr_end_state;
  129. tap_state_t runtest_run_state;
  130. tap_state_t runtest_end_state;
  131. trst_mode_t trst_mode;
  132. svf_xxr_para_t hir_para;
  133. svf_xxr_para_t hdr_para;
  134. svf_xxr_para_t tir_para;
  135. svf_xxr_para_t tdr_para;
  136. svf_xxr_para_t sir_para;
  137. svf_xxr_para_t sdr_para;
  138. }svf_para_t;
  139. svf_para_t svf_para;
  140. const svf_para_t svf_para_init =
  141. {
  142. // frequency, ir_end_state, dr_end_state, runtest_run_state, runtest_end_state, trst_mode
  143. 0, TAP_IDLE, TAP_IDLE, TAP_IDLE, TAP_IDLE, TRST_Z,
  144. // hir_para
  145. // {len, data_mask, tdi, tdo, mask, smask},
  146. {0, 0, NULL, NULL, NULL, NULL},
  147. // hdr_para
  148. // {len, data_mask, tdi, tdo, mask, smask},
  149. {0, 0, NULL, NULL, NULL, NULL},
  150. // tir_para
  151. // {len, data_mask, tdi, tdo, mask, smask},
  152. {0, 0, NULL, NULL, NULL, NULL},
  153. // tdr_para
  154. // {len, data_mask, tdi, tdo, mask, smask},
  155. {0, 0, NULL, NULL, NULL, NULL},
  156. // sir_para
  157. // {len, data_mask, tdi, tdo, mask, smask},
  158. {0, 0, NULL, NULL, NULL, NULL},
  159. // sdr_para
  160. // {len, data_mask, tdi, tdo, mask, smask},
  161. {0, 0, NULL, NULL, NULL, NULL},
  162. };
  163. typedef struct
  164. {
  165. int line_num; // used to record line number of the check operation
  166. // so more information could be printed
  167. int enabled; // check is enabled or not
  168. int buffer_offset; // buffer_offset to buffers
  169. int bit_len; // bit length to check
  170. }svf_check_tdo_para_t;
  171. #define SVF_CHECK_TDO_PARA_SIZE 1024
  172. static svf_check_tdo_para_t *svf_check_tdo_para = NULL;
  173. static int svf_check_tdo_para_index = 0;
  174. #define dimof(a) (sizeof(a) / sizeof((a)[0]))
  175. static int svf_read_command_from_file(int fd);
  176. static int svf_check_tdo(void);
  177. static int svf_add_check_para(uint8_t enabled, int buffer_offset, int bit_len);
  178. static int svf_run_command(struct command_context_s *cmd_ctx, char *cmd_str);
  179. static int handle_svf_command(struct command_context_s *cmd_ctx, char *cmd, char **args, int argc);
  180. static int svf_fd = 0;
  181. static char *svf_command_buffer = NULL;
  182. static int svf_command_buffer_size = 0;
  183. static int svf_line_number = 1;
  184. static jtag_tap_t *tap = NULL;
  185. #define SVF_MAX_BUFFER_SIZE_TO_COMMIT (4 * 1024)
  186. static uint8_t *svf_tdi_buffer = NULL, *svf_tdo_buffer = NULL, *svf_mask_buffer = NULL;
  187. static int svf_buffer_index = 0, svf_buffer_size = 0;
  188. static int svf_quiet = 0;
  189. int svf_register_commands(struct command_context_s *cmd_ctx)
  190. {
  191. register_command(cmd_ctx, NULL, "svf", handle_svf_command,
  192. COMMAND_EXEC, "run svf <file>");
  193. return ERROR_OK;
  194. }
  195. void svf_free_xxd_para(svf_xxr_para_t *para)
  196. {
  197. if (NULL != para)
  198. {
  199. if (para->tdi != NULL)
  200. {
  201. free(para->tdi);
  202. para->tdi = NULL;
  203. }
  204. if (para->tdo != NULL)
  205. {
  206. free(para->tdo);
  207. para->tdo = NULL;
  208. }
  209. if (para->mask != NULL)
  210. {
  211. free(para->mask);
  212. para->mask = NULL;
  213. }
  214. if (para->smask != NULL)
  215. {
  216. free(para->smask);
  217. para->smask = NULL;
  218. }
  219. }
  220. }
  221. unsigned svf_get_mask_u32(int bitlen)
  222. {
  223. uint32_t bitmask;
  224. if (bitlen < 0)
  225. {
  226. bitmask = 0;
  227. }
  228. else if (bitlen >= 32)
  229. {
  230. bitmask = 0xFFFFFFFF;
  231. }
  232. else
  233. {
  234. bitmask = (1 << bitlen) - 1;
  235. }
  236. return bitmask;
  237. }
  238. static const char* tap_state_svf_name(tap_state_t state)
  239. {
  240. const char* ret;
  241. switch (state)
  242. {
  243. case TAP_RESET: ret = "RESET"; break;
  244. case TAP_IDLE: ret = "IDLE"; break;
  245. case TAP_DRSELECT: ret = "DRSELECT"; break;
  246. case TAP_DRCAPTURE: ret = "DRCAPTURE"; break;
  247. case TAP_DRSHIFT: ret = "DRSHIFT"; break;
  248. case TAP_DREXIT1: ret = "DREXIT1"; break;
  249. case TAP_DRPAUSE: ret = "DRPAUSE"; break;
  250. case TAP_DREXIT2: ret = "DREXIT2"; break;
  251. case TAP_DRUPDATE: ret = "DRUPDATE"; break;
  252. case TAP_IRSELECT: ret = "IRSELECT"; break;
  253. case TAP_IRCAPTURE: ret = "IRCAPTURE"; break;
  254. case TAP_IRSHIFT: ret = "IRSHIFT"; break;
  255. case TAP_IREXIT1: ret = "IREXIT1"; break;
  256. case TAP_IRPAUSE: ret = "IRPAUSE"; break;
  257. case TAP_IREXIT2: ret = "IREXIT2"; break;
  258. case TAP_IRUPDATE: ret = "IRUPDATE"; break;
  259. default: ret = "???"; break;
  260. }
  261. return ret;
  262. }
  263. static int svf_add_statemove(tap_state_t state_to)
  264. {
  265. tap_state_t state_from = cmd_queue_cur_state;
  266. uint8_t index;
  267. for (index = 0; index < dimof(svf_statemoves); index++)
  268. {
  269. if ((svf_statemoves[index].from == state_from)
  270. && (svf_statemoves[index].to == state_to))
  271. {
  272. if (TAP_RESET == state_from)
  273. {
  274. jtag_add_tlr();
  275. if (svf_statemoves[index].num_of_moves > 1)
  276. {
  277. jtag_add_pathmove(svf_statemoves[index].num_of_moves - 1, svf_statemoves[index].paths + 1);
  278. }
  279. }
  280. else
  281. {
  282. if (svf_statemoves[index].num_of_moves > 0)
  283. {
  284. jtag_add_pathmove(svf_statemoves[index].num_of_moves, svf_statemoves[index].paths);
  285. }
  286. }
  287. return ERROR_OK;
  288. }
  289. }
  290. LOG_ERROR("can not move to %s", tap_state_svf_name(state_to));
  291. return ERROR_FAIL;
  292. }
  293. static int handle_svf_command(struct command_context_s *cmd_ctx, char *cmd, char **args, int argc)
  294. {
  295. #define SVF_NUM_OF_OPTIONS 1
  296. int command_num = 0, i;
  297. int ret = ERROR_OK;
  298. long long time_ago;
  299. if ((argc < 1) || (argc > (1 + SVF_NUM_OF_OPTIONS)))
  300. {
  301. command_print(cmd_ctx, "usage: svf <file> [quiet]");
  302. return ERROR_FAIL;
  303. }
  304. // parse variant
  305. svf_quiet = 0;
  306. for (i = 1; i < argc; i++)
  307. {
  308. if (!strcmp(args[i], "quiet"))
  309. {
  310. svf_quiet = 1;
  311. }
  312. else
  313. {
  314. LOG_ERROR("unknown variant for svf: %s", args[i]);
  315. // no need to free anything now
  316. return ERROR_FAIL;
  317. }
  318. }
  319. if ((svf_fd = open(args[0], O_RDONLY)) < 0)
  320. {
  321. command_print(cmd_ctx, "file \"%s\" not found", args[0]);
  322. // no need to free anything now
  323. return ERROR_FAIL;
  324. }
  325. LOG_USER("svf processing file: \"%s\"", args[0]);
  326. // get time
  327. time_ago = timeval_ms();
  328. // init
  329. svf_line_number = 1;
  330. svf_command_buffer_size = 0;
  331. svf_check_tdo_para_index = 0;
  332. svf_check_tdo_para = malloc(sizeof(svf_check_tdo_para_t) * SVF_CHECK_TDO_PARA_SIZE);
  333. if (NULL == svf_check_tdo_para)
  334. {
  335. LOG_ERROR("not enough memory");
  336. ret = ERROR_FAIL;
  337. goto free_all;
  338. }
  339. svf_buffer_index = 0;
  340. // double the buffer size
  341. // in case current command cannot be commited, and next command is a bit scan command
  342. // here is 32K bits for this big scan command, it should be enough
  343. // buffer will be reallocated if buffer size is not enough
  344. svf_tdi_buffer = (uint8_t *)malloc(2 * SVF_MAX_BUFFER_SIZE_TO_COMMIT);
  345. if (NULL == svf_tdi_buffer)
  346. {
  347. LOG_ERROR("not enough memory");
  348. ret = ERROR_FAIL;
  349. goto free_all;
  350. }
  351. svf_tdo_buffer = (uint8_t *)malloc(2 * SVF_MAX_BUFFER_SIZE_TO_COMMIT);
  352. if (NULL == svf_tdo_buffer)
  353. {
  354. LOG_ERROR("not enough memory");
  355. ret = ERROR_FAIL;
  356. goto free_all;
  357. }
  358. svf_mask_buffer = (uint8_t *)malloc(2 * SVF_MAX_BUFFER_SIZE_TO_COMMIT);
  359. if (NULL == svf_mask_buffer)
  360. {
  361. LOG_ERROR("not enough memory");
  362. ret = ERROR_FAIL;
  363. goto free_all;
  364. }
  365. svf_buffer_size = 2 * SVF_MAX_BUFFER_SIZE_TO_COMMIT;
  366. memcpy(&svf_para, &svf_para_init, sizeof(svf_para));
  367. for (i = 0; i < (int)dimof(svf_tap_state_name); i++)
  368. {
  369. svf_tap_state_name[i] = (char *)tap_state_svf_name(i);
  370. }
  371. // TAP_RESET
  372. jtag_add_tlr();
  373. while (ERROR_OK == svf_read_command_from_file(svf_fd))
  374. {
  375. if (ERROR_OK != svf_run_command(cmd_ctx, svf_command_buffer))
  376. {
  377. LOG_ERROR("fail to run command at line %d", svf_line_number);
  378. ret = ERROR_FAIL;
  379. break;
  380. }
  381. command_num++;
  382. }
  383. if (ERROR_OK != jtag_execute_queue())
  384. {
  385. ret = ERROR_FAIL;
  386. }
  387. else if (ERROR_OK != svf_check_tdo())
  388. {
  389. ret = ERROR_FAIL;
  390. }
  391. // print time
  392. command_print(cmd_ctx, "%lld ms used", timeval_ms() - time_ago);
  393. free_all:
  394. close(svf_fd);
  395. svf_fd = 0;
  396. // free buffers
  397. if (svf_command_buffer)
  398. {
  399. free(svf_command_buffer);
  400. svf_command_buffer = NULL;
  401. svf_command_buffer_size = 0;
  402. }
  403. if (svf_check_tdo_para)
  404. {
  405. free(svf_check_tdo_para);
  406. svf_check_tdo_para = NULL;
  407. svf_check_tdo_para_index = 0;
  408. }
  409. if (svf_tdi_buffer)
  410. {
  411. free(svf_tdi_buffer);
  412. svf_tdi_buffer = NULL;
  413. }
  414. if (svf_tdo_buffer)
  415. {
  416. free(svf_tdo_buffer);
  417. svf_tdo_buffer = NULL;
  418. }
  419. if (svf_mask_buffer)
  420. {
  421. free(svf_mask_buffer);
  422. svf_mask_buffer = NULL;
  423. }
  424. svf_buffer_index = 0;
  425. svf_buffer_size = 0;
  426. svf_free_xxd_para(&svf_para.hdr_para);
  427. svf_free_xxd_para(&svf_para.hir_para);
  428. svf_free_xxd_para(&svf_para.tdr_para);
  429. svf_free_xxd_para(&svf_para.tir_para);
  430. svf_free_xxd_para(&svf_para.sdr_para);
  431. svf_free_xxd_para(&svf_para.sir_para);
  432. if (ERROR_OK == ret)
  433. {
  434. command_print(cmd_ctx, "svf file programmed successfully for %d commands", command_num);
  435. }
  436. else
  437. {
  438. command_print(cmd_ctx, "svf file programmed failed");
  439. }
  440. return ret;
  441. }
  442. #define SVFP_CMD_INC_CNT 1024
  443. static int svf_read_command_from_file(int fd)
  444. {
  445. char ch, *tmp_buffer = NULL;
  446. int cmd_pos = 0, cmd_ok = 0, slash = 0, comment = 0;
  447. while (!cmd_ok && (read(fd, &ch, 1) > 0))
  448. {
  449. switch (ch)
  450. {
  451. case '!':
  452. slash = 0;
  453. comment = 1;
  454. break;
  455. case '/':
  456. if (++slash == 2)
  457. {
  458. comment = 1;
  459. }
  460. break;
  461. case ';':
  462. slash = 0;
  463. if (!comment)
  464. {
  465. cmd_ok = 1;
  466. }
  467. break;
  468. case '\n':
  469. svf_line_number++;
  470. case '\r':
  471. slash = 0;
  472. comment = 0;
  473. break;
  474. default:
  475. if (!comment)
  476. {
  477. if (cmd_pos >= svf_command_buffer_size - 1)
  478. {
  479. tmp_buffer = (char*)malloc(svf_command_buffer_size + SVFP_CMD_INC_CNT); // 1 more byte for '\0'
  480. if (NULL == tmp_buffer)
  481. {
  482. LOG_ERROR("not enough memory");
  483. return ERROR_FAIL;
  484. }
  485. if (svf_command_buffer_size > 0)
  486. {
  487. memcpy(tmp_buffer, svf_command_buffer, svf_command_buffer_size);
  488. }
  489. if (svf_command_buffer != NULL)
  490. {
  491. free(svf_command_buffer);
  492. }
  493. svf_command_buffer = tmp_buffer;
  494. svf_command_buffer_size += SVFP_CMD_INC_CNT;
  495. tmp_buffer = NULL;
  496. }
  497. svf_command_buffer[cmd_pos++] = (char)toupper(ch);
  498. }
  499. break;
  500. }
  501. }
  502. if (cmd_ok)
  503. {
  504. svf_command_buffer[cmd_pos] = '\0';
  505. return ERROR_OK;
  506. }
  507. else
  508. {
  509. return ERROR_FAIL;
  510. }
  511. }
  512. static int svf_parse_cmd_string(char *str, int len, char **argus, int *num_of_argu)
  513. {
  514. int pos = 0, num = 0, space_found = 1;
  515. while (pos < len)
  516. {
  517. switch (str[pos])
  518. {
  519. case '\n':
  520. case '\r':
  521. case '!':
  522. case '/':
  523. LOG_ERROR("fail to parse svf command");
  524. return ERROR_FAIL;
  525. break;
  526. case ' ':
  527. space_found = 1;
  528. str[pos] = '\0';
  529. break;
  530. default:
  531. if (space_found)
  532. {
  533. argus[num++] = &str[pos];
  534. space_found = 0;
  535. }
  536. break;
  537. }
  538. pos++;
  539. }
  540. *num_of_argu = num;
  541. return ERROR_OK;
  542. }
  543. static int svf_tap_state_is_stable(tap_state_t state)
  544. {
  545. return ((TAP_RESET == state) || (TAP_IDLE == state) || (TAP_DRPAUSE == state) || (TAP_IRPAUSE == state));
  546. }
  547. static int svf_tap_state_is_valid(tap_state_t state)
  548. {
  549. return state >= 0 && state < TAP_NUM_STATES;
  550. }
  551. static int svf_find_string_in_array(char *str, char **strs, int num_of_element)
  552. {
  553. int i;
  554. for (i = 0; i < num_of_element; i++)
  555. {
  556. if (!strcmp(str, strs[i]))
  557. {
  558. return i;
  559. }
  560. }
  561. return 0xFF;
  562. }
  563. static int svf_adjust_array_length(uint8_t **arr, int orig_bit_len, int new_bit_len)
  564. {
  565. int new_byte_len = (new_bit_len + 7) >> 3;
  566. if ((NULL == *arr) || (((orig_bit_len + 7) >> 3) < ((new_bit_len + 7) >> 3)))
  567. {
  568. if (*arr != NULL)
  569. {
  570. free(*arr);
  571. *arr = NULL;
  572. }
  573. *arr = (uint8_t*)malloc(new_byte_len);
  574. if (NULL == *arr)
  575. {
  576. LOG_ERROR("not enough memory");
  577. return ERROR_FAIL;
  578. }
  579. memset(*arr, 0, new_byte_len);
  580. }
  581. return ERROR_OK;
  582. }
  583. static int svf_copy_hexstring_to_binary(char *str, uint8_t **bin, int orig_bit_len, int bit_len)
  584. {
  585. int i, str_len = strlen(str), str_hbyte_len = (bit_len + 3) >> 2;
  586. uint8_t ch = 0;
  587. if (ERROR_OK != svf_adjust_array_length(bin, orig_bit_len, bit_len))
  588. {
  589. LOG_ERROR("fail to adjust length of array");
  590. return ERROR_FAIL;
  591. }
  592. for (i = 0; i < str_hbyte_len; i++)
  593. {
  594. ch = 0;
  595. while (str_len > 0)
  596. {
  597. ch = str[--str_len];
  598. if (!isblank(ch))
  599. {
  600. if ((ch >= '0') && (ch <= '9'))
  601. {
  602. ch = ch - '0';
  603. break;
  604. }
  605. else if ((ch >= 'A') && (ch <= 'F'))
  606. {
  607. ch = ch - 'A' + 10;
  608. break;
  609. }
  610. else
  611. {
  612. LOG_ERROR("invalid hex string");
  613. return ERROR_FAIL;
  614. }
  615. }
  616. ch = 0;
  617. }
  618. // write bin
  619. if (i % 2)
  620. {
  621. // MSB
  622. (*bin)[i / 2] |= ch << 4;
  623. }
  624. else
  625. {
  626. // LSB
  627. (*bin)[i / 2] = 0;
  628. (*bin)[i / 2] |= ch;
  629. }
  630. }
  631. // check valid
  632. if (str_len > 0 || (ch & ~((1 << (4 - (bit_len % 4))) - 1)) != 0)
  633. {
  634. LOG_ERROR("value execede length");
  635. return ERROR_FAIL;
  636. }
  637. return ERROR_OK;
  638. }
  639. static int svf_check_tdo(void)
  640. {
  641. int i, len, index;
  642. for (i = 0; i < svf_check_tdo_para_index; i++)
  643. {
  644. index = svf_check_tdo_para[i].buffer_offset;
  645. len = svf_check_tdo_para[i].bit_len;
  646. if ((svf_check_tdo_para[i].enabled)
  647. && buf_cmp_mask(&svf_tdi_buffer[index], &svf_tdo_buffer[index], &svf_mask_buffer[index], len))
  648. {
  649. unsigned bitmask;
  650. unsigned received, expected, tapmask;
  651. bitmask = svf_get_mask_u32(svf_check_tdo_para[i].bit_len);
  652. memcpy(&received, svf_tdi_buffer + index, sizeof(unsigned));
  653. memcpy(&expected, svf_tdo_buffer + index, sizeof(unsigned));
  654. memcpy(&tapmask, svf_mask_buffer + index, sizeof(unsigned));
  655. LOG_ERROR("tdo check error at line %d",
  656. svf_check_tdo_para[i].line_num);
  657. LOG_ERROR("read = 0x%X, want = 0x%X, mask = 0x%X",
  658. received & bitmask,
  659. expected & bitmask,
  660. tapmask & bitmask);
  661. return ERROR_FAIL;
  662. }
  663. }
  664. svf_check_tdo_para_index = 0;
  665. return ERROR_OK;
  666. }
  667. static int svf_add_check_para(uint8_t enabled, int buffer_offset, int bit_len)
  668. {
  669. if (svf_check_tdo_para_index >= SVF_CHECK_TDO_PARA_SIZE)
  670. {
  671. LOG_ERROR("toooooo many operation undone");
  672. return ERROR_FAIL;
  673. }
  674. svf_check_tdo_para[svf_check_tdo_para_index].line_num = svf_line_number;
  675. svf_check_tdo_para[svf_check_tdo_para_index].bit_len = bit_len;
  676. svf_check_tdo_para[svf_check_tdo_para_index].enabled = enabled;
  677. svf_check_tdo_para[svf_check_tdo_para_index].buffer_offset = buffer_offset;
  678. svf_check_tdo_para_index++;
  679. return ERROR_OK;
  680. }
  681. static int svf_execute_tap(void)
  682. {
  683. if (ERROR_OK != jtag_execute_queue())
  684. {
  685. return ERROR_FAIL;
  686. }
  687. else if (ERROR_OK != svf_check_tdo())
  688. {
  689. return ERROR_FAIL;
  690. }
  691. svf_buffer_index = 0;
  692. return ERROR_OK;
  693. }
  694. static int svf_run_command(struct command_context_s *cmd_ctx, char *cmd_str)
  695. {
  696. char *argus[256], command;
  697. int num_of_argu = 0, i;
  698. // tmp variable
  699. int i_tmp;
  700. // for RUNTEST
  701. int run_count;
  702. float min_time, max_time;
  703. // for XXR
  704. svf_xxr_para_t *xxr_para_tmp;
  705. uint8_t **pbuffer_tmp;
  706. scan_field_t field;
  707. // for STATE
  708. tap_state_t *path = NULL, state;
  709. if (!svf_quiet)
  710. {
  711. LOG_USER("%s", svf_command_buffer);
  712. }
  713. if (ERROR_OK != svf_parse_cmd_string(cmd_str, strlen(cmd_str), argus, &num_of_argu))
  714. {
  715. return ERROR_FAIL;
  716. }
  717. command = svf_find_string_in_array(argus[0], (char **)svf_command_name, dimof(svf_command_name));
  718. switch (command)
  719. {
  720. case ENDDR:
  721. case ENDIR:
  722. if (num_of_argu != 2)
  723. {
  724. LOG_ERROR("invalid parameter of %s", argus[0]);
  725. return ERROR_FAIL;
  726. }
  727. i_tmp = svf_find_string_in_array(argus[1], (char **)svf_tap_state_name, dimof(svf_tap_state_name));
  728. if (svf_tap_state_is_stable(i_tmp))
  729. {
  730. if (command == ENDIR)
  731. {
  732. svf_para.ir_end_state = i_tmp;
  733. LOG_DEBUG("\tir_end_state = %s", svf_tap_state_name[svf_para.ir_end_state]);
  734. }
  735. else
  736. {
  737. svf_para.dr_end_state = i_tmp;
  738. LOG_DEBUG("\tdr_end_state = %s", svf_tap_state_name[svf_para.dr_end_state]);
  739. }
  740. }
  741. else
  742. {
  743. LOG_ERROR("%s is not valid state", argus[1]);
  744. return ERROR_FAIL;
  745. }
  746. break;
  747. case FREQUENCY:
  748. if ((num_of_argu != 1) && (num_of_argu != 3))
  749. {
  750. LOG_ERROR("invalid parameter of %s", argus[0]);
  751. return ERROR_FAIL;
  752. }
  753. if (1 == num_of_argu)
  754. {
  755. // TODO: set jtag speed to full speed
  756. svf_para.frequency = 0;
  757. }
  758. else
  759. {
  760. if (strcmp(argus[2], "HZ"))
  761. {
  762. LOG_ERROR("HZ not found in FREQUENCY command");
  763. return ERROR_FAIL;
  764. }
  765. if (ERROR_OK != svf_execute_tap())
  766. {
  767. return ERROR_FAIL;
  768. }
  769. svf_para.frequency = atof(argus[1]);
  770. // TODO: set jtag speed to
  771. if (svf_para.frequency > 0)
  772. {
  773. command_run_linef(cmd_ctx, "jtag_khz %d", (int)svf_para.frequency / 1000);
  774. LOG_DEBUG("\tfrequency = %f", svf_para.frequency);
  775. }
  776. }
  777. break;
  778. case HDR:
  779. xxr_para_tmp = &svf_para.hdr_para;
  780. goto XXR_common;
  781. case HIR:
  782. xxr_para_tmp = &svf_para.hir_para;
  783. goto XXR_common;
  784. case TDR:
  785. xxr_para_tmp = &svf_para.tdr_para;
  786. goto XXR_common;
  787. case TIR:
  788. xxr_para_tmp = &svf_para.tir_para;
  789. goto XXR_common;
  790. case SDR:
  791. xxr_para_tmp = &svf_para.sdr_para;
  792. goto XXR_common;
  793. case SIR:
  794. xxr_para_tmp = &svf_para.sir_para;
  795. goto XXR_common;
  796. XXR_common:
  797. // XXR length [TDI (tdi)] [TDO (tdo)][MASK (mask)] [SMASK (smask)]
  798. if ((num_of_argu > 10) || (num_of_argu % 2))
  799. {
  800. LOG_ERROR("invalid parameter of %s", argus[0]);
  801. return ERROR_FAIL;
  802. }
  803. i_tmp = xxr_para_tmp->len;
  804. xxr_para_tmp->len = atoi(argus[1]);
  805. LOG_DEBUG("\tlength = %d", xxr_para_tmp->len);
  806. xxr_para_tmp->data_mask = 0;
  807. for (i = 2; i < num_of_argu; i += 2)
  808. {
  809. if ((strlen(argus[i + 1]) < 3) || (argus[i + 1][0] != '(') || (argus[i + 1][strlen(argus[i + 1]) - 1] != ')'))
  810. {
  811. LOG_ERROR("data section error");
  812. return ERROR_FAIL;
  813. }
  814. argus[i + 1][strlen(argus[i + 1]) - 1] = '\0';
  815. // TDI, TDO, MASK, SMASK
  816. if (!strcmp(argus[i], "TDI"))
  817. {
  818. // TDI
  819. pbuffer_tmp = &xxr_para_tmp->tdi;
  820. xxr_para_tmp->data_mask |= XXR_TDI;
  821. }
  822. else if (!strcmp(argus[i], "TDO"))
  823. {
  824. // TDO
  825. pbuffer_tmp = &xxr_para_tmp->tdo;
  826. xxr_para_tmp->data_mask |= XXR_TDO;
  827. }
  828. else if (!strcmp(argus[i], "MASK"))
  829. {
  830. // MASK
  831. pbuffer_tmp = &xxr_para_tmp->mask;
  832. xxr_para_tmp->data_mask |= XXR_MASK;
  833. }
  834. else if (!strcmp(argus[i], "SMASK"))
  835. {
  836. // SMASK
  837. pbuffer_tmp = &xxr_para_tmp->smask;
  838. xxr_para_tmp->data_mask |= XXR_SMASK;
  839. }
  840. else
  841. {
  842. LOG_ERROR("unknow parameter: %s", argus[i]);
  843. return ERROR_FAIL;
  844. }
  845. if (ERROR_OK != svf_copy_hexstring_to_binary(&argus[i + 1][1], pbuffer_tmp, i_tmp, xxr_para_tmp->len))
  846. {
  847. LOG_ERROR("fail to parse hex value");
  848. return ERROR_FAIL;
  849. }
  850. LOG_DEBUG("\t%s = 0x%X", argus[i], (**(int**)pbuffer_tmp) & svf_get_mask_u32(xxr_para_tmp->len));
  851. }
  852. // If a command changes the length of the last scan of the same type and the MASK parameter is absent,
  853. // the mask pattern used is all cares
  854. if (!(xxr_para_tmp->data_mask & XXR_MASK) && (i_tmp != xxr_para_tmp->len))
  855. {
  856. // MASK not defined and length changed
  857. if (ERROR_OK != svf_adjust_array_length(&xxr_para_tmp->mask, i_tmp, xxr_para_tmp->len))
  858. {
  859. LOG_ERROR("fail to adjust length of array");
  860. return ERROR_FAIL;
  861. }
  862. buf_set_ones(xxr_para_tmp->mask, xxr_para_tmp->len);
  863. }
  864. // If TDO is absent, no comparison is needed, set the mask to 0
  865. if (!(xxr_para_tmp->data_mask & XXR_TDO))
  866. {
  867. if (NULL == xxr_para_tmp->tdo)
  868. {
  869. if (ERROR_OK != svf_adjust_array_length(&xxr_para_tmp->tdo, i_tmp, xxr_para_tmp->len))
  870. {
  871. LOG_ERROR("fail to adjust length of array");
  872. return ERROR_FAIL;
  873. }
  874. }
  875. if (NULL == xxr_para_tmp->mask)
  876. {
  877. if (ERROR_OK != svf_adjust_array_length(&xxr_para_tmp->mask, i_tmp, xxr_para_tmp->len))
  878. {
  879. LOG_ERROR("fail to adjust length of array");
  880. return ERROR_FAIL;
  881. }
  882. }
  883. memset(xxr_para_tmp->mask, 0, (xxr_para_tmp->len + 7) >> 3);
  884. }
  885. // do scan if necessary
  886. if (SDR == command)
  887. {
  888. // check buffer size first, reallocate if necessary
  889. i = svf_para.hdr_para.len + svf_para.sdr_para.len + svf_para.tdr_para.len;
  890. if ((svf_buffer_size - svf_buffer_index) < ((i + 7) >> 3))
  891. {
  892. #if 1
  893. // simply print error message
  894. LOG_ERROR("buffer is not enough, report to author");
  895. return ERROR_FAIL;
  896. #else
  897. uint8_t *buffer_tmp;
  898. // reallocate buffer
  899. buffer_tmp = (uint8_t *)malloc(svf_buffer_index + ((i + 7) >> 3));
  900. if (NULL == buffer_tmp)
  901. {
  902. LOG_ERROR("not enough memory");
  903. return ERROR_FAIL;
  904. }
  905. memcpy(buffer_tmp, svf_tdi_buffer, svf_buffer_index);
  906. // svf_tdi_buffer isn't NULL here
  907. free(svf_tdi_buffer);
  908. svf_tdi_buffer = buffer_tmp;
  909. buffer_tmp = (uint8_t *)malloc(svf_buffer_index + ((i + 7) >> 3));
  910. if (NULL == buffer_tmp)
  911. {
  912. LOG_ERROR("not enough memory");
  913. return ERROR_FAIL;
  914. }
  915. memcpy(buffer_tmp, svf_tdo_buffer, svf_buffer_index);
  916. // svf_tdo_buffer isn't NULL here
  917. free(svf_tdo_buffer);
  918. svf_tdo_buffer = buffer_tmp;
  919. buffer_tmp = (uint8_t *)malloc(svf_buffer_index + ((i + 7) >> 3));
  920. if (NULL == buffer_tmp)
  921. {
  922. LOG_ERROR("not enough memory");
  923. return ERROR_FAIL;
  924. }
  925. memcpy(buffer_tmp, svf_mask_buffer, svf_buffer_index);
  926. // svf_mask_buffer isn't NULL here
  927. free(svf_mask_buffer);
  928. svf_mask_buffer = buffer_tmp;
  929. buffer_tmp = NULL;
  930. svf_buffer_size = svf_buffer_index + ((i + 7) >> 3);
  931. #endif
  932. }
  933. // assemble dr data
  934. i = 0;
  935. buf_set_buf(svf_para.hdr_para.tdi, 0, &svf_tdi_buffer[svf_buffer_index], i, svf_para.hdr_para.len);
  936. i += svf_para.hdr_para.len;
  937. buf_set_buf(svf_para.sdr_para.tdi, 0, &svf_tdi_buffer[svf_buffer_index], i, svf_para.sdr_para.len);
  938. i += svf_para.sdr_para.len;
  939. buf_set_buf(svf_para.tdr_para.tdi, 0, &svf_tdi_buffer[svf_buffer_index], i, svf_para.tdr_para.len);
  940. i += svf_para.tdr_para.len;
  941. // add check data
  942. if (svf_para.sdr_para.data_mask & XXR_TDO)
  943. {
  944. // assemble dr mask data
  945. i = 0;
  946. buf_set_buf(svf_para.hdr_para.mask, 0, &svf_mask_buffer[svf_buffer_index], i, svf_para.hdr_para.len);
  947. i += svf_para.hdr_para.len;
  948. buf_set_buf(svf_para.sdr_para.mask, 0, &svf_mask_buffer[svf_buffer_index], i, svf_para.sdr_para.len);
  949. i += svf_para.sdr_para.len;
  950. buf_set_buf(svf_para.tdr_para.mask, 0, &svf_mask_buffer[svf_buffer_index], i, svf_para.tdr_para.len);
  951. i += svf_para.tdr_para.len;
  952. // assemble dr check data
  953. i = 0;
  954. buf_set_buf(svf_para.hdr_para.tdo, 0, &svf_tdo_buffer[svf_buffer_index], i, svf_para.hdr_para.len);
  955. i += svf_para.hdr_para.len;
  956. buf_set_buf(svf_para.sdr_para.tdo, 0, &svf_tdo_buffer[svf_buffer_index], i, svf_para.sdr_para.len);
  957. i += svf_para.sdr_para.len;
  958. buf_set_buf(svf_para.tdr_para.tdo, 0, &svf_tdo_buffer[svf_buffer_index], i, svf_para.tdr_para.len);
  959. i += svf_para.tdr_para.len;
  960. svf_add_check_para(1, svf_buffer_index, i);
  961. }
  962. else
  963. {
  964. svf_add_check_para(0, svf_buffer_index, i);
  965. }
  966. field.tap = tap;
  967. field.num_bits = i;
  968. field.out_value = &svf_tdi_buffer[svf_buffer_index];
  969. field.in_value = &svf_tdi_buffer[svf_buffer_index];
  970. jtag_add_plain_dr_scan(1, &field, svf_para.dr_end_state);
  971. svf_buffer_index += (i + 7) >> 3;
  972. }
  973. else if (SIR == command)
  974. {
  975. // check buffer size first, reallocate if necessary
  976. i = svf_para.hir_para.len + svf_para.sir_para.len + svf_para.tir_para.len;
  977. if ((svf_buffer_size - svf_buffer_index) < ((i + 7) >> 3))
  978. {
  979. #if 1
  980. // simply print error message
  981. LOG_ERROR("buffer is not enough, report to author");
  982. return ERROR_FAIL;
  983. #else
  984. uint8_t *buffer_tmp;
  985. // reallocate buffer
  986. buffer_tmp = (uint8_t *)malloc(svf_buffer_index + ((i + 7) >> 3));
  987. if (NULL == buffer_tmp)
  988. {
  989. LOG_ERROR("not enough memory");
  990. return ERROR_FAIL;
  991. }
  992. memcpy(buffer_tmp, svf_tdi_buffer, svf_buffer_index);
  993. // svf_tdi_buffer isn't NULL here
  994. free(svf_tdi_buffer);
  995. svf_tdi_buffer = buffer_tmp;
  996. buffer_tmp = (uint8_t *)malloc(svf_buffer_index + ((i + 7) >> 3));
  997. if (NULL == buffer_tmp)
  998. {
  999. LOG_ERROR("not enough memory");
  1000. return ERROR_FAIL;
  1001. }
  1002. memcpy(buffer_tmp, svf_tdo_buffer, svf_buffer_index);
  1003. // svf_tdo_buffer isn't NULL here
  1004. free(svf_tdo_buffer);
  1005. svf_tdo_buffer = buffer_tmp;
  1006. buffer_tmp = (uint8_t *)malloc(svf_buffer_index + ((i + 7) >> 3));
  1007. if (NULL == buffer_tmp)
  1008. {
  1009. LOG_ERROR("not enough memory");
  1010. return ERROR_FAIL;
  1011. }
  1012. memcpy(buffer_tmp, svf_mask_buffer, svf_buffer_index);
  1013. // svf_mask_buffer isn't NULL here
  1014. free(svf_mask_buffer);
  1015. svf_mask_buffer = buffer_tmp;
  1016. buffer_tmp = NULL;
  1017. svf_buffer_size = svf_buffer_index + ((i + 7) >> 3);
  1018. #endif
  1019. }
  1020. // assemble ir data
  1021. i = 0;
  1022. buf_set_buf(svf_para.hir_para.tdi, 0, &svf_tdi_buffer[svf_buffer_index], i, svf_para.hir_para.len);
  1023. i += svf_para.hir_para.len;
  1024. buf_set_buf(svf_para.sir_para.tdi, 0, &svf_tdi_buffer[svf_buffer_index], i, svf_para.sir_para.len);
  1025. i += svf_para.sir_para.len;
  1026. buf_set_buf(svf_para.tir_para.tdi, 0, &svf_tdi_buffer[svf_buffer_index], i, svf_para.tir_para.len);
  1027. i += svf_para.tir_para.len;
  1028. // add check data
  1029. if (svf_para.sir_para.data_mask & XXR_TDO)
  1030. {
  1031. // assemble dr mask data
  1032. i = 0;
  1033. buf_set_buf(svf_para.hir_para.mask, 0, &svf_mask_buffer[svf_buffer_index], i, svf_para.hir_para.len);
  1034. i += svf_para.hir_para.len;
  1035. buf_set_buf(svf_para.sir_para.mask, 0, &svf_mask_buffer[svf_buffer_index], i, svf_para.sir_para.len);
  1036. i += svf_para.sir_para.len;
  1037. buf_set_buf(svf_para.tir_para.mask, 0, &svf_mask_buffer[svf_buffer_index], i, svf_para.tir_para.len);
  1038. i += svf_para.tir_para.len;
  1039. // assemble dr check data
  1040. i = 0;
  1041. buf_set_buf(svf_para.hir_para.tdo, 0, &svf_tdo_buffer[svf_buffer_index], i, svf_para.hir_para.len);
  1042. i += svf_para.hir_para.len;
  1043. buf_set_buf(svf_para.sir_para.tdo, 0, &svf_tdo_buffer[svf_buffer_index], i, svf_para.sir_para.len);
  1044. i += svf_para.sir_para.len;
  1045. buf_set_buf(svf_para.tir_para.tdo, 0, &svf_tdo_buffer[svf_buffer_index], i, svf_para.tir_para.len);
  1046. i += svf_para.tir_para.len;
  1047. svf_add_check_para(1, svf_buffer_index, i);
  1048. }
  1049. else
  1050. {
  1051. svf_add_check_para(0, svf_buffer_index, i);
  1052. }
  1053. field.tap = tap;
  1054. field.num_bits = i;
  1055. field.out_value = &svf_tdi_buffer[svf_buffer_index];
  1056. field.in_value = &svf_tdi_buffer[svf_buffer_index];
  1057. jtag_add_plain_ir_scan(1, &field, svf_para.ir_end_state);
  1058. svf_buffer_index += (i + 7) >> 3;
  1059. }
  1060. break;
  1061. case PIO:
  1062. case PIOMAP:
  1063. LOG_ERROR("PIO and PIOMAP are not supported");
  1064. return ERROR_FAIL;
  1065. break;
  1066. case RUNTEST:
  1067. // RUNTEST [run_state] run_count run_clk [min_time SEC [MAXIMUM max_time SEC]] [ENDSTATE end_state]
  1068. // RUNTEST [run_state] min_time SEC [MAXIMUM max_time SEC] [ENDSTATE end_state]
  1069. if ((num_of_argu < 3) && (num_of_argu > 11))
  1070. {
  1071. LOG_ERROR("invalid parameter of %s", argus[0]);
  1072. return ERROR_FAIL;
  1073. }
  1074. // init
  1075. run_count = 0;
  1076. min_time = 0;
  1077. max_time = 0;
  1078. i = 1;
  1079. // run_state
  1080. i_tmp = svf_find_string_in_array(argus[i], (char **)svf_tap_state_name, dimof(svf_tap_state_name));
  1081. if (svf_tap_state_is_valid(i_tmp))
  1082. {
  1083. if (svf_tap_state_is_stable(i_tmp))
  1084. {
  1085. svf_para.runtest_run_state = i_tmp;
  1086. // When a run_state is specified, the new run_state becomes the default end_state
  1087. svf_para.runtest_end_state = i_tmp;
  1088. LOG_DEBUG("\trun_state = %s", svf_tap_state_name[svf_para.runtest_run_state]);
  1089. i++;
  1090. }
  1091. else
  1092. {
  1093. LOG_ERROR("%s is not valid state", svf_tap_state_name[i_tmp]);
  1094. return ERROR_FAIL;
  1095. }
  1096. }
  1097. // run_count run_clk
  1098. if (((i + 2) <= num_of_argu) && strcmp(argus[i + 1], "SEC"))
  1099. {
  1100. if (!strcmp(argus[i + 1], "TCK"))
  1101. {
  1102. // clock source is TCK
  1103. run_count = atoi(argus[i]);
  1104. LOG_DEBUG("\trun_count@TCK = %d", run_count);
  1105. }
  1106. else
  1107. {
  1108. LOG_ERROR("%s not supported for clock", argus[i + 1]);
  1109. return ERROR_FAIL;
  1110. }
  1111. i += 2;
  1112. }
  1113. // min_time SEC
  1114. if (((i + 2) <= num_of_argu) && !strcmp(argus[i + 1], "SEC"))
  1115. {
  1116. min_time = atof(argus[i]);
  1117. LOG_DEBUG("\tmin_time = %fs", min_time);
  1118. i += 2;
  1119. }
  1120. // MAXIMUM max_time SEC
  1121. if (((i + 3) <= num_of_argu) && !strcmp(argus[i], "MAXIMUM") && !strcmp(argus[i + 2], "SEC"))
  1122. {
  1123. max_time = atof(argus[i + 1]);
  1124. LOG_DEBUG("\tmax_time = %fs", max_time);
  1125. i += 3;
  1126. }
  1127. // ENDSTATE end_state
  1128. if (((i + 2) <= num_of_argu) && !strcmp(argus[i], "ENDSTATE"))
  1129. {
  1130. i_tmp = svf_find_string_in_array(argus[i + 1], (char **)svf_tap_state_name, dimof(svf_tap_state_name));
  1131. if (svf_tap_state_is_stable(i_tmp))
  1132. {
  1133. svf_para.runtest_end_state = i_tmp;
  1134. LOG_DEBUG("\tend_state = %s", svf_tap_state_name[svf_para.runtest_end_state]);
  1135. }
  1136. else
  1137. {
  1138. LOG_ERROR("%s is not valid state", svf_tap_state_name[i_tmp]);
  1139. return ERROR_FAIL;
  1140. }
  1141. i += 2;
  1142. }
  1143. // calculate run_count
  1144. if ((0 == run_count) && (min_time > 0))
  1145. {
  1146. run_count = min_time * svf_para.frequency;
  1147. }
  1148. // all parameter should be parsed
  1149. if (i == num_of_argu)
  1150. {
  1151. if (run_count > 0)
  1152. {
  1153. // run_state and end_state is checked to be stable state
  1154. // TODO: do runtest
  1155. #if 1
  1156. // enter into run_state if necessary
  1157. if (cmd_queue_cur_state != svf_para.runtest_run_state)
  1158. {
  1159. svf_add_statemove(svf_para.runtest_run_state);
  1160. }
  1161. // call jtag_add_clocks
  1162. jtag_add_clocks(run_count);
  1163. // move to end_state if necessary
  1164. if (svf_para.runtest_end_state != svf_para.runtest_run_state)
  1165. {
  1166. svf_add_statemove(svf_para.runtest_end_state);
  1167. }
  1168. #else
  1169. if (svf_para.runtest_run_state != TAP_IDLE)
  1170. {
  1171. // RUNTEST can only executed in TAP_IDLE
  1172. LOG_ERROR("cannot runtest in %s state", svf_tap_state_name[svf_para.runtest_run_state]);
  1173. return ERROR_FAIL;
  1174. }
  1175. jtag_add_runtest(run_count, svf_para.runtest_end_state);
  1176. #endif
  1177. }
  1178. }
  1179. else
  1180. {
  1181. LOG_ERROR("fail to parse parameter of RUNTEST, %d out of %d is parsed", i, num_of_argu);
  1182. return ERROR_FAIL;
  1183. }
  1184. break;
  1185. case STATE:
  1186. // STATE [pathstate1 [pathstate2 ...[pathstaten]]] stable_state
  1187. if (num_of_argu < 2)
  1188. {
  1189. LOG_ERROR("invalid parameter of %s", argus[0]);
  1190. return ERROR_FAIL;
  1191. }
  1192. if (num_of_argu > 2)
  1193. {
  1194. // STATE pathstate1 ... stable_state
  1195. path = (tap_state_t *)malloc((num_of_argu - 1) * sizeof(tap_state_t));
  1196. if (NULL == path)
  1197. {
  1198. LOG_ERROR("not enough memory");
  1199. return ERROR_FAIL;
  1200. }
  1201. num_of_argu--; // num of path
  1202. i_tmp = 1; // path is from patameter 1
  1203. for (i = 0; i < num_of_argu; i++)
  1204. {
  1205. path[i] = svf_find_string_in_array(argus[i_tmp++], (char **)svf_tap_state_name, dimof(svf_tap_state_name));
  1206. if (!svf_tap_state_is_valid(path[i]))
  1207. {
  1208. LOG_ERROR("%s is not valid state", svf_tap_state_name[path[i]]);
  1209. free(path);
  1210. return ERROR_FAIL;
  1211. }
  1212. if (TAP_RESET == path[i])
  1213. {
  1214. if (i > 0)
  1215. {
  1216. jtag_add_pathmove(i, path);
  1217. }
  1218. jtag_add_tlr();
  1219. num_of_argu -= i + 1;
  1220. i = -1;
  1221. }
  1222. }
  1223. if (num_of_argu > 0)
  1224. {
  1225. // execute last path if necessary
  1226. if (svf_tap_state_is_stable(path[num_of_argu - 1]))
  1227. {
  1228. // last state MUST be stable state
  1229. // TODO: call path_move
  1230. jtag_add_pathmove(num_of_argu, path);
  1231. LOG_DEBUG("\tmove to %s by path_move", svf_tap_state_name[path[num_of_argu - 1]]);
  1232. }
  1233. else
  1234. {
  1235. LOG_ERROR("%s is not valid state", svf_tap_state_name[path[num_of_argu - 1]]);
  1236. free(path);
  1237. return ERROR_FAIL;
  1238. }
  1239. }
  1240. // no need to keep this memory, in jtag_add_pathmove, path will be duplicated
  1241. if (NULL != path)
  1242. {
  1243. free(path);
  1244. path = NULL;
  1245. }
  1246. }
  1247. else
  1248. {
  1249. // STATE stable_state
  1250. state = svf_find_string_in_array(argus[1], (char **)svf_tap_state_name, dimof(svf_tap_state_name));
  1251. if (svf_tap_state_is_stable(state))
  1252. {
  1253. // TODO: move to state
  1254. svf_add_statemove(state);
  1255. LOG_DEBUG("\tmove to %s by svf_add_statemove", svf_tap_state_name[state]);
  1256. }
  1257. else
  1258. {
  1259. LOG_ERROR("%s is not valid state", svf_tap_state_name[state]);
  1260. return ERROR_FAIL;
  1261. }
  1262. }
  1263. break;
  1264. case TRST:
  1265. // TRST trst_mode
  1266. if (num_of_argu != 2)
  1267. {
  1268. LOG_ERROR("invalid parameter of %s", argus[0]);
  1269. return ERROR_FAIL;
  1270. }
  1271. if (svf_para.trst_mode != TRST_ABSENT)
  1272. {
  1273. if (ERROR_OK != svf_execute_tap())
  1274. {
  1275. return ERROR_FAIL;
  1276. }
  1277. i_tmp = svf_find_string_in_array(argus[1], (char **)svf_trst_mode_name, dimof(svf_trst_mode_name));
  1278. switch (i_tmp)
  1279. {
  1280. case TRST_ON:
  1281. jtag_add_reset(1, 0);
  1282. break;
  1283. case TRST_Z:
  1284. case TRST_OFF:
  1285. jtag_add_reset(0, 0);
  1286. break;
  1287. case TRST_ABSENT:
  1288. break;
  1289. default:
  1290. LOG_ERROR("unknown TRST mode: %s", argus[1]);
  1291. return ERROR_FAIL;
  1292. }
  1293. svf_para.trst_mode = i_tmp;
  1294. LOG_DEBUG("\ttrst_mode = %s", svf_trst_mode_name[svf_para.trst_mode]);
  1295. }
  1296. else
  1297. {
  1298. LOG_ERROR("can not accpet TRST command if trst_mode is ABSENT");
  1299. return ERROR_FAIL;
  1300. }
  1301. break;
  1302. default:
  1303. LOG_ERROR("invalid svf command: %s", argus[0]);
  1304. return ERROR_FAIL;
  1305. break;
  1306. }
  1307. if (debug_level >= LOG_LVL_DEBUG)
  1308. {
  1309. // for convenient debugging, execute tap if possible
  1310. if ((svf_buffer_index > 0) && \
  1311. (((command != STATE) && (command != RUNTEST)) || \
  1312. ((command == STATE) && (num_of_argu == 2))))
  1313. {
  1314. if (ERROR_OK != svf_execute_tap())
  1315. {
  1316. return ERROR_FAIL;
  1317. }
  1318. // output debug info
  1319. if ((SIR == command) || (SDR == command))
  1320. {
  1321. int read_value;
  1322. memcpy(&read_value, svf_tdi_buffer, sizeof(int));
  1323. // in debug mode, data is from index 0
  1324. int read_mask = svf_get_mask_u32(svf_check_tdo_para[0].bit_len);
  1325. LOG_DEBUG("\tTDO read = 0x%X", read_value & read_mask);
  1326. }
  1327. }
  1328. }
  1329. else
  1330. {
  1331. // for fast executing, execute tap if necessary
  1332. // half of the buffer is for the next command
  1333. if (((svf_buffer_index >= SVF_MAX_BUFFER_SIZE_TO_COMMIT) || (svf_check_tdo_para_index >= SVF_CHECK_TDO_PARA_SIZE / 2)) && \
  1334. (((command != STATE) && (command != RUNTEST)) || \
  1335. ((command == STATE) && (num_of_argu == 2))))
  1336. {
  1337. return svf_execute_tap();
  1338. }
  1339. }
  1340. return ERROR_OK;
  1341. }