-/***************************************************************************
- * Copyright (C) 2007 by Pavel Chromy *
- * chromy@asix.cz *
- * *
- * This program is free software; you can redistribute it and/or modify *
- * it under the terms of the GNU General Public License as published by *
- * the Free Software Foundation; either version 2 of the License, or *
- * (at your option) any later version. *
- * *
- * This program is distributed in the hope that it will be useful, *
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
- * GNU General Public License for more details. *
- * *
- * You should have received a copy of the GNU General Public License *
- * along with this program; if not, write to the *
- * Free Software Foundation, Inc., *
- * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
- ***************************************************************************/
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "bitq.h"
-
-/* project specific includes */
-#include "log.h"
-#include "types.h"
-#include "jtag.h"
-#include "configuration.h"
-
-/* system includes */
-#include <string.h>
-#include <stdlib.h>
-#include <unistd.h>
-
-#include <sys/time.h>
-#include <time.h>
-
-
-bitq_interface_t *bitq_interface; /* low level bit queue interface */
-
-bitq_state_t bitq_in_state; /* state of input queue */
-
-u8 *bitq_in_buffer; /* buffer dynamically reallocated as needed */
-unsigned long bitq_in_bufsize=32; /* min. buffer size */
-
-
-/*
- * input queue processing does not use jtag_read_buffer() to avoid unnecessary overhead
- * also the buffer for incomming data is reallocated only if necessary
- * no parameters, makes use of stored state information
- */
-void bitq_in_proc(void)
-{
- /* static information preserved between calls to increase performance */
- static u8 *in_buff; /* pointer to buffer for scanned data */
- static int in_idx; /* index of byte being scanned */
- static u8 in_mask; /* mask of next bit to be scanned */
-
- scan_field_t *field;
- int tdo;
-
- int result;
-
- /* loop through the queue */
- while (bitq_in_state.cmd) {
- /* only JTAG_SCAN command may return data */
- if (bitq_in_state.cmd->type==JTAG_SCAN) {
- /* loop through the fields */
- while (bitq_in_state.field_idx<bitq_in_state.cmd->cmd.scan->num_fields) {
-
- field=&bitq_in_state.cmd->cmd.scan->fields[bitq_in_state.field_idx];
- if (field->in_check_value || field->in_value || field->in_handler) {
-
- if (bitq_in_state.bit_pos==0) {
- /* initialize field scanning */
- in_mask=0x01;
- in_idx=0;
- if (field->in_value) in_buff=field->in_value;
- else {
- /* buffer reallocation needed? */
- if (field->num_bits>bitq_in_bufsize*8) {
- /* buffer previously allocated? */
- if (bitq_in_buffer!=NULL) {
- /* free it */
- free(bitq_in_buffer);
- bitq_in_buffer=NULL;
- }
- /* double the buffer size until it fits */
- while (field->num_bits>bitq_in_bufsize*8) bitq_in_bufsize*=2;
- }
- /* if necessary, allocate buffer and check for malloc error */
- if (bitq_in_buffer==NULL && (bitq_in_buffer=malloc(bitq_in_bufsize))==NULL) {
- ERROR("malloc error");
- exit(-1);
- }
- in_buff=(void *)bitq_in_buffer;
- }
- }
-
- /* field scanning */
- while (bitq_in_state.bit_pos<field->num_bits) {
- if ((tdo=bitq_interface->in())<0) {
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("bitq in EOF");
-#endif
- return;
- }
- if (in_mask==0x01) in_buff[in_idx]=0;
- if (tdo) in_buff[in_idx]|=in_mask;
- if (in_mask==0x80) {
- in_mask=0x01;
- in_idx++;
- }
- else in_mask<<=1;
- bitq_in_state.bit_pos++;
- }
-
- if (field->in_check_value) {
- /* match scanned in value */
- for (in_idx=0; in_idx*8<field->num_bits; in_idx++) {
- if (field->in_check_mask) in_mask=field->in_check_mask[in_idx];
- else in_mask=0xff;
- if (field->num_bits-in_idx*8<8) in_mask>>=8-(field->num_bits-in_idx*8);
- if (field->in_check_value[in_idx]&in_mask!=in_buff[in_idx]&in_mask) {
- char *captured_char = buf_to_str(in_buff, (field->num_bits > 64) ? 64 : field->num_bits, 16);
- char *in_check_value_char = buf_to_str(field->in_check_value, (field->num_bits > 64) ? 64 : field->num_bits, 16);
- char *in_check_mask_char = buf_to_str(field->in_check_mask, (field->num_bits > 64) ? 64 : field->num_bits, 16);
- /* TODO: error reporting */
- WARNING("value captured during scan didn't pass the requested check: captured: 0x%s check_value: 0x%s check_mask: 0x%s", captured_char, in_check_value_char, in_check_mask_char);
- bitq_in_state.status=ERROR_JTAG_QUEUE_FAILED;
- free(captured_char);
- free(in_check_value_char);
- free(in_check_mask_char);
- break; /* leave the comparison loop upon first mismatch */
- }
- }
- }
-
- if (field->in_handler && bitq_in_state.status==ERROR_OK) {
- bitq_in_state.status=(*field->in_handler)(in_buff, field->in_handler_priv);
- }
-
- }
-
- bitq_in_state.field_idx++; /* advance to next field */
- bitq_in_state.bit_pos=0; /* start next field from the first bit */
- }
-
- }
- bitq_in_state.cmd=bitq_in_state.cmd->next; /* advance to next command */
- bitq_in_state.field_idx=0; /* preselect first field */
- }
-}
-
-
-
-void bitq_io(int tms, int tdi, int tdo_req)
-{
- bitq_interface->out(tms, tdi, tdo_req);
- /* check and process the input queue */
- if (bitq_interface->in_rdy()) bitq_in_proc();
-}
-
-
-void bitq_end_state(enum tap_state state)
-{
- if (state==-1) return;
- if (tap_move_map[state]==-1) {
- ERROR("BUG: %i is not a valid end state", state);
- exit(-1);
- }
- end_state = state;
-}
-
-
-void bitq_state_move(enum tap_state new_state)
-{
- int i=0;
- u8 tms_scan;
-
- if (tap_move_map[cur_state]==-1 || tap_move_map[new_state]==-1) {
- ERROR("TAP move from or to unstable state");
- exit(-1);
- }
-
- tms_scan=TAP_MOVE(cur_state, new_state);
-
- for (i=0; i<7; i++) {
- bitq_io(tms_scan&1, 0, 0);
- tms_scan>>=1;
- }
-
- cur_state = new_state;
-}
-
-
-void bitq_path_move(pathmove_command_t *cmd)
-{
- int i;
-
- for (i=0; i<=cmd->num_states; i++) {
- if (tap_transitions[cur_state].low == cmd->path[i]) bitq_io(0, 0, 0);
- else if (tap_transitions[cur_state].high == cmd->path[i]) bitq_io(1, 0, 0);
- else {
- ERROR("BUG: %s -> %s isn't a valid TAP transition", tap_state_strings[cur_state], tap_state_strings[cmd->path[i]]);
- exit(-1);
- }
-
- cur_state = cmd->path[i];
- }
-
- end_state = cur_state;
-}
-
-
-void bitq_runtest(int num_cycles)
-{
- int i;
-
- /* only do a state_move when we're not already in RTI */
- if (cur_state != TAP_RTI) bitq_state_move(TAP_RTI);
-
- /* execute num_cycles */
- for (i = 0; i < num_cycles; i++)
- bitq_io(0, 0, 0);
-
- /* finish in end_state */
- if (cur_state != end_state) bitq_state_move(end_state);
-}
-
-
-void bitq_scan_field(scan_field_t *field, int pause)
-{
- int bit_cnt;
- int tdo_req;
-
- u8 *out_ptr;
- u8 out_mask;
-
- if (field->in_check_value || field->in_value || field->in_handler) tdo_req=1;
- else tdo_req=0;
-
- if (field->out_value==NULL) {
- /* just send zeros and request data from TDO */
- for (bit_cnt=field->num_bits; bit_cnt>1; bit_cnt--)
- bitq_io(0, 0, tdo_req);
- bitq_io(pause, 0, tdo_req);
- }
- else {
- /* send data, and optionally request TDO */
- out_mask=0x01;
- out_ptr=field->out_value;
- for (bit_cnt=field->num_bits; bit_cnt>1; bit_cnt--) {
- bitq_io(0, ((*out_ptr)&out_mask)!=0, tdo_req);
- if (out_mask==0x80) {
- out_mask=0x01;
- out_ptr++;
- }
- else out_mask<<=1;
- }
- bitq_io(pause, ((*out_ptr)&out_mask)!=0, tdo_req);
- }
-
- if (pause) {
- bitq_io(0,0,0);
- if (cur_state==TAP_SI) cur_state=TAP_PI;
- else if (cur_state==TAP_SD) cur_state=TAP_PD;
- }
-}
-
-
-void bitq_scan(scan_command_t *cmd)
-{
- int i;
-
- if (cmd->ir_scan) bitq_state_move(TAP_SI);
- else bitq_state_move(TAP_SD);
-
- for (i=0; i < cmd->num_fields-1; i++)
- bitq_scan_field(&cmd->fields[i], 0);
- bitq_scan_field(&cmd->fields[i], 1);
-}
-
-
-int bitq_execute_queue(void)
-{
- jtag_command_t *cmd = jtag_command_queue; /* currently processed command */
-
- bitq_in_state.cmd = jtag_command_queue;
- bitq_in_state.field_idx = 0;
- bitq_in_state.bit_pos = 0;
- bitq_in_state.status = ERROR_OK;
-
- while (cmd) {
-
- switch (cmd->type) {
-
- case JTAG_END_STATE:
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("end_state: %i", cmd->cmd.end_state->end_state);
-#endif
- bitq_end_state(cmd->cmd.end_state->end_state);
- break;
-
- case JTAG_RESET:
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("reset trst: %i srst %i", cmd->cmd.reset->trst, cmd->cmd.reset->srst);
-#endif
- bitq_interface->reset(cmd->cmd.reset->trst, cmd->cmd.reset->srst);
- if (bitq_interface->in_rdy()) bitq_in_proc();
- break;
-
- case JTAG_RUNTEST:
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("runtest %i cycles, end in %i", cmd->cmd.runtest->num_cycles, cmd->cmd.runtest->end_state);
-#endif
- bitq_end_state(cmd->cmd.runtest->end_state);
- bitq_runtest(cmd->cmd.runtest->num_cycles);
- break;
-
- case JTAG_STATEMOVE:
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("statemove end in %i", cmd->cmd.statemove->end_state);
-#endif
- bitq_end_state(cmd->cmd.statemove->end_state);
- bitq_state_move(end_state); /* uncoditional TAP move */
- break;
-
- case JTAG_PATHMOVE:
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("pathmove: %i states, end in %i", cmd->cmd.pathmove->num_states, cmd->cmd.pathmove->path[cmd->cmd.pathmove->num_states - 1]);
-#endif
- bitq_path_move(cmd->cmd.pathmove);
- break;
-
- case JTAG_SCAN:
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("scan end in %i", cmd->cmd.scan->end_state);
- if (cmd->cmd.scan->ir_scan) DEBUG("scan ir");
- else DEBUG("scan dr");
-#endif
- bitq_end_state(cmd->cmd.scan->end_state);
- bitq_scan(cmd->cmd.scan);
- if (cur_state != end_state) bitq_state_move(end_state);
- break;
-
- case JTAG_SLEEP:
-#ifdef _DEBUG_JTAG_IO_
- DEBUG("sleep %i", cmd->cmd.sleep->us);
-#endif
- bitq_interface->sleep(cmd->cmd.sleep->us);
- if (bitq_interface->in_rdy()) bitq_in_proc();
- break;
-
- default:
- ERROR("BUG: unknown JTAG command type encountered");
- exit(-1);
- }
-
- cmd = cmd->next;
- }
-
- bitq_interface->flush();
- bitq_in_proc();
-
- if (bitq_in_state.cmd) {
- ERROR("missing data from bitq interface");
- return ERROR_JTAG_QUEUE_FAILED;
- }
- if (bitq_interface->in()>=0) {
- ERROR("extra data from bitq interface");
- return ERROR_JTAG_QUEUE_FAILED;
- }
-
- return bitq_in_state.status;
-}
-
-
-void bitq_cleanup(void)
-{
- if (bitq_in_buffer!=NULL)
- {
- free(bitq_in_buffer);
- bitq_in_buffer=NULL;
- }
-}
+/***************************************************************************\r
+ * Copyright (C) 2007 by Pavel Chromy *\r
+ * chromy@asix.cz *\r
+ * *\r
+ * This program is free software; you can redistribute it and/or modify *\r
+ * it under the terms of the GNU General Public License as published by *\r
+ * the Free Software Foundation; either version 2 of the License, or *\r
+ * (at your option) any later version. *\r
+ * *\r
+ * This program is distributed in the hope that it will be useful, *\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\r
+ * GNU General Public License for more details. *\r
+ * *\r
+ * You should have received a copy of the GNU General Public License *\r
+ * along with this program; if not, write to the *\r
+ * Free Software Foundation, Inc., *\r
+ * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *\r
+ ***************************************************************************/\r
+#ifdef HAVE_CONFIG_H\r
+#include "config.h"\r
+#endif\r
+\r
+#include "bitq.h"\r
+\r
+/* project specific includes */\r
+#include "log.h"\r
+#include "types.h"\r
+#include "jtag.h"\r
+#include "configuration.h"\r
+\r
+/* system includes */\r
+#include <string.h>\r
+#include <stdlib.h>\r
+#include <unistd.h>\r
+\r
+#include <sys/time.h>\r
+#include <time.h>\r
+\r
+\r
+bitq_interface_t *bitq_interface; /* low level bit queue interface */\r
+\r
+bitq_state_t bitq_in_state; /* state of input queue */\r
+\r
+u8 *bitq_in_buffer; /* buffer dynamically reallocated as needed */\r
+unsigned long bitq_in_bufsize=32; /* min. buffer size */\r
+\r
+\r
+/*\r
+ * input queue processing does not use jtag_read_buffer() to avoid unnecessary overhead\r
+ * also the buffer for incomming data is reallocated only if necessary\r
+ * no parameters, makes use of stored state information\r
+ */\r
+void bitq_in_proc(void)\r
+{\r
+ /* static information preserved between calls to increase performance */\r
+ static u8 *in_buff; /* pointer to buffer for scanned data */\r
+ static int in_idx; /* index of byte being scanned */\r
+ static u8 in_mask; /* mask of next bit to be scanned */\r
+\r
+ scan_field_t *field;\r
+ int tdo;\r
+\r
+ /* loop through the queue */\r
+ while (bitq_in_state.cmd) {\r
+ /* only JTAG_SCAN command may return data */\r
+ if (bitq_in_state.cmd->type==JTAG_SCAN) {\r
+ /* loop through the fields */\r
+ while (bitq_in_state.field_idx<bitq_in_state.cmd->cmd.scan->num_fields) {\r
+\r
+ field=&bitq_in_state.cmd->cmd.scan->fields[bitq_in_state.field_idx];\r
+ if ( field->in_value || field->in_handler) {\r
+\r
+ if (bitq_in_state.bit_pos==0) {\r
+ /* initialize field scanning */\r
+ in_mask=0x01;\r
+ in_idx=0;\r
+ if (field->in_value) in_buff=field->in_value;\r
+ else {\r
+ /* buffer reallocation needed? */\r
+ if (field->num_bits>bitq_in_bufsize*8) {\r
+ /* buffer previously allocated? */\r
+ if (bitq_in_buffer!=NULL) {\r
+ /* free it */\r
+ free(bitq_in_buffer);\r
+ bitq_in_buffer=NULL;\r
+ }\r
+ /* double the buffer size until it fits */\r
+ while (field->num_bits>bitq_in_bufsize*8) bitq_in_bufsize*=2;\r
+ }\r
+ /* if necessary, allocate buffer and check for malloc error */\r
+ if (bitq_in_buffer==NULL && (bitq_in_buffer=malloc(bitq_in_bufsize))==NULL) {\r
+ ERROR("malloc error");\r
+ exit(-1);\r
+ }\r
+ in_buff=(void *)bitq_in_buffer;\r
+ }\r
+ }\r
+\r
+ /* field scanning */\r
+ while (bitq_in_state.bit_pos<field->num_bits) {\r
+ if ((tdo=bitq_interface->in())<0) {\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("bitq in EOF");\r
+#endif\r
+ return;\r
+ }\r
+ if (in_mask==0x01) in_buff[in_idx]=0;\r
+ if (tdo) in_buff[in_idx]|=in_mask;\r
+ if (in_mask==0x80) {\r
+ in_mask=0x01;\r
+ in_idx++;\r
+ }\r
+ else in_mask<<=1;\r
+ bitq_in_state.bit_pos++;\r
+ }\r
+\r
+\r
+ if (field->in_handler && bitq_in_state.status==ERROR_OK) {\r
+ bitq_in_state.status=(*field->in_handler)(in_buff, field->in_handler_priv, field);\r
+ }\r
+\r
+ }\r
+\r
+ bitq_in_state.field_idx++; /* advance to next field */\r
+ bitq_in_state.bit_pos=0; /* start next field from the first bit */\r
+ }\r
+\r
+ }\r
+ bitq_in_state.cmd=bitq_in_state.cmd->next; /* advance to next command */\r
+ bitq_in_state.field_idx=0; /* preselect first field */\r
+ }\r
+}\r
+\r
+\r
+\r
+void bitq_io(int tms, int tdi, int tdo_req)\r
+{\r
+ bitq_interface->out(tms, tdi, tdo_req);\r
+ /* check and process the input queue */\r
+ if (bitq_interface->in_rdy()) bitq_in_proc();\r
+}\r
+\r
+\r
+void bitq_end_state(enum tap_state state)\r
+{\r
+ if (state==-1) return;\r
+ if (tap_move_map[state]==-1) {\r
+ ERROR("BUG: %i is not a valid end state", state);\r
+ exit(-1);\r
+ }\r
+ end_state = state;\r
+}\r
+\r
+\r
+void bitq_state_move(enum tap_state new_state)\r
+{\r
+ int i=0;\r
+ u8 tms_scan;\r
+\r
+ if (tap_move_map[cur_state]==-1 || tap_move_map[new_state]==-1) {\r
+ ERROR("TAP move from or to unstable state");\r
+ exit(-1);\r
+ }\r
+\r
+ tms_scan=TAP_MOVE(cur_state, new_state);\r
+\r
+ for (i=0; i<7; i++) {\r
+ bitq_io(tms_scan&1, 0, 0);\r
+ tms_scan>>=1;\r
+ }\r
+\r
+ cur_state = new_state;\r
+}\r
+\r
+\r
+void bitq_path_move(pathmove_command_t *cmd)\r
+{\r
+ int i;\r
+\r
+ for (i=0; i<=cmd->num_states; i++) {\r
+ if (tap_transitions[cur_state].low == cmd->path[i]) bitq_io(0, 0, 0);\r
+ else if (tap_transitions[cur_state].high == cmd->path[i]) bitq_io(1, 0, 0);\r
+ else {\r
+ ERROR("BUG: %s -> %s isn't a valid TAP transition", tap_state_strings[cur_state], tap_state_strings[cmd->path[i]]);\r
+ exit(-1);\r
+ }\r
+\r
+ cur_state = cmd->path[i];\r
+ }\r
+\r
+ end_state = cur_state;\r
+}\r
+\r
+\r
+void bitq_runtest(int num_cycles)\r
+{\r
+ int i;\r
+\r
+ /* only do a state_move when we're not already in RTI */\r
+ if (cur_state != TAP_RTI) bitq_state_move(TAP_RTI);\r
+\r
+ /* execute num_cycles */\r
+ for (i = 0; i < num_cycles; i++)\r
+ bitq_io(0, 0, 0);\r
+\r
+ /* finish in end_state */\r
+ if (cur_state != end_state) bitq_state_move(end_state);\r
+}\r
+\r
+\r
+void bitq_scan_field(scan_field_t *field, int pause)\r
+{\r
+ int bit_cnt;\r
+ int tdo_req;\r
+\r
+ u8 *out_ptr;\r
+ u8 out_mask;\r
+\r
+ if ( field->in_value || field->in_handler) tdo_req=1;\r
+ else tdo_req=0;\r
+\r
+ if (field->out_value==NULL) {\r
+ /* just send zeros and request data from TDO */\r
+ for (bit_cnt=field->num_bits; bit_cnt>1; bit_cnt--)\r
+ bitq_io(0, 0, tdo_req);\r
+ bitq_io(pause, 0, tdo_req);\r
+ }\r
+ else {\r
+ /* send data, and optionally request TDO */\r
+ out_mask=0x01;\r
+ out_ptr=field->out_value;\r
+ for (bit_cnt=field->num_bits; bit_cnt>1; bit_cnt--) {\r
+ bitq_io(0, ((*out_ptr)&out_mask)!=0, tdo_req);\r
+ if (out_mask==0x80) {\r
+ out_mask=0x01;\r
+ out_ptr++;\r
+ }\r
+ else out_mask<<=1;\r
+ }\r
+ bitq_io(pause, ((*out_ptr)&out_mask)!=0, tdo_req);\r
+ }\r
+\r
+ if (pause) {\r
+ bitq_io(0,0,0);\r
+ if (cur_state==TAP_SI) cur_state=TAP_PI;\r
+ else if (cur_state==TAP_SD) cur_state=TAP_PD;\r
+ }\r
+}\r
+\r
+\r
+void bitq_scan(scan_command_t *cmd)\r
+{\r
+ int i;\r
+\r
+ if (cmd->ir_scan) bitq_state_move(TAP_SI);\r
+ else bitq_state_move(TAP_SD);\r
+\r
+ for (i=0; i < cmd->num_fields-1; i++)\r
+ bitq_scan_field(&cmd->fields[i], 0);\r
+ bitq_scan_field(&cmd->fields[i], 1);\r
+}\r
+\r
+\r
+int bitq_execute_queue(void)\r
+{\r
+ jtag_command_t *cmd = jtag_command_queue; /* currently processed command */\r
+\r
+ bitq_in_state.cmd = jtag_command_queue;\r
+ bitq_in_state.field_idx = 0;\r
+ bitq_in_state.bit_pos = 0;\r
+ bitq_in_state.status = ERROR_OK;\r
+\r
+ while (cmd) {\r
+\r
+ switch (cmd->type) {\r
+\r
+ case JTAG_END_STATE:\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("end_state: %i", cmd->cmd.end_state->end_state);\r
+#endif\r
+ bitq_end_state(cmd->cmd.end_state->end_state);\r
+ break;\r
+\r
+ case JTAG_RESET:\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("reset trst: %i srst %i", cmd->cmd.reset->trst, cmd->cmd.reset->srst);\r
+#endif\r
+ bitq_interface->reset(cmd->cmd.reset->trst, cmd->cmd.reset->srst);\r
+ if (bitq_interface->in_rdy()) bitq_in_proc();\r
+ break;\r
+\r
+ case JTAG_RUNTEST:\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("runtest %i cycles, end in %i", cmd->cmd.runtest->num_cycles, cmd->cmd.runtest->end_state);\r
+#endif\r
+ bitq_end_state(cmd->cmd.runtest->end_state);\r
+ bitq_runtest(cmd->cmd.runtest->num_cycles);\r
+ break;\r
+\r
+ case JTAG_STATEMOVE:\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("statemove end in %i", cmd->cmd.statemove->end_state);\r
+#endif\r
+ bitq_end_state(cmd->cmd.statemove->end_state);\r
+ bitq_state_move(end_state); /* uncoditional TAP move */\r
+ break;\r
+\r
+ case JTAG_PATHMOVE:\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("pathmove: %i states, end in %i", cmd->cmd.pathmove->num_states, cmd->cmd.pathmove->path[cmd->cmd.pathmove->num_states - 1]);\r
+#endif\r
+ bitq_path_move(cmd->cmd.pathmove);\r
+ break;\r
+\r
+ case JTAG_SCAN:\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("scan end in %i", cmd->cmd.scan->end_state);\r
+ if (cmd->cmd.scan->ir_scan) DEBUG("scan ir");\r
+ else DEBUG("scan dr");\r
+#endif\r
+ bitq_end_state(cmd->cmd.scan->end_state);\r
+ bitq_scan(cmd->cmd.scan);\r
+ if (cur_state != end_state) bitq_state_move(end_state);\r
+ break;\r
+\r
+ case JTAG_SLEEP:\r
+#ifdef _DEBUG_JTAG_IO_\r
+ DEBUG("sleep %i", cmd->cmd.sleep->us);\r
+#endif\r
+ bitq_interface->sleep(cmd->cmd.sleep->us);\r
+ if (bitq_interface->in_rdy()) bitq_in_proc();\r
+ break;\r
+\r
+ default:\r
+ ERROR("BUG: unknown JTAG command type encountered");\r
+ exit(-1);\r
+ }\r
+\r
+ cmd = cmd->next;\r
+ }\r
+\r
+ bitq_interface->flush();\r
+ bitq_in_proc();\r
+\r
+ if (bitq_in_state.cmd) {\r
+ ERROR("missing data from bitq interface");\r
+ return ERROR_JTAG_QUEUE_FAILED;\r
+ }\r
+ if (bitq_interface->in()>=0) {\r
+ ERROR("extra data from bitq interface");\r
+ return ERROR_JTAG_QUEUE_FAILED;\r
+ }\r
+\r
+ return bitq_in_state.status;\r
+}\r
+\r
+\r
+void bitq_cleanup(void)\r
+{\r
+ if (bitq_in_buffer!=NULL)\r
+ {\r
+ free(bitq_in_buffer);\r
+ bitq_in_buffer=NULL;\r
+ }\r
+}\r
projects / openocd / blobdiff