1 /***************************************************************************
2 * Copyright (C) 2005 by Dominic Rath *
3 * Dominic.Rath@gmx.de *
5 * Copyright (C) 2007,2008 Øyvind Harboe *
6 * oyvind.harboe@zylin.com *
8 * Copyright (C) 2009 SoftPLC Corporation *
12 * Copyright (C) 2009 Zachary T Welch *
13 * zw@superlucidity.net *
15 * This program is free software; you can redistribute it and/or modify *
16 * it under the terms of the GNU General Public License as published by *
17 * the Free Software Foundation; either version 2 of the License, or *
18 * (at your option) any later version. *
20 * This program is distributed in the hope that it will be useful, *
21 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
22 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
23 * GNU General Public License for more details. *
25 * You should have received a copy of the GNU General Public License *
26 * along with this program; if not, write to the *
27 * Free Software Foundation, Inc., *
28 * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
29 ***************************************************************************/
35 #include "interface.h"
38 * @see tap_set_state() and tap_get_state() accessors.
39 * Actual name is not important since accessors hide it.
41 static tap_state_t state_follower
= TAP_RESET
;
43 void tap_set_state_impl(tap_state_t new_state
)
45 /* this is the state we think the TAPs are in now, was cur_state */
46 state_follower
= new_state
;
49 tap_state_t
tap_get_state()
51 return state_follower
;
55 * @see tap_set_end_state() and tap_get_end_state() accessors.
56 * Actual name is not important because accessors hide it.
58 static tap_state_t end_state_follower
= TAP_RESET
;
60 void tap_set_end_state(tap_state_t new_end_state
)
62 /* this is the state we think the TAPs will be in at completion of the
63 current TAP operation, was end_state
65 end_state_follower
= new_end_state
;
68 tap_state_t
tap_get_end_state()
70 return end_state_follower
;
74 int tap_move_ndx(tap_state_t astate
)
76 /* given a stable state, return the index into the tms_seqs[]
77 * array within tap_get_tms_path()
84 case TAP_RESET
: ndx
= 0; break;
85 case TAP_IDLE
: ndx
= 1; break;
86 case TAP_DRSHIFT
: ndx
= 2; break;
87 case TAP_DRPAUSE
: ndx
= 3; break;
88 case TAP_IRSHIFT
: ndx
= 4; break;
89 case TAP_IRPAUSE
: ndx
= 5; break;
91 LOG_ERROR("FATAL: unstable state \"%s\" in tap_move_ndx()",
92 tap_state_name(astate
));
100 /* tap_move[i][j]: tap movement command to go from state i to state j
101 * encodings of i and j are what tap_move_ndx() reports.
103 * DRSHIFT->DRSHIFT and IRSHIFT->IRSHIFT have to be caught in interface specific code
112 * These macros allow us to specify TMS state transitions by bits rather than hex bytes.
113 * Read the bits from LSBit first to MSBit last (right-to-left).
115 #define HEX__(n) 0x##n##LU
118 (((x) & 0x0000000FLU)?(1 << 0):0) \
119 +(((x) & 0x000000F0LU)?(1 << 1):0) \
120 +(((x) & 0x00000F00LU)?(1 << 2):0) \
121 +(((x) & 0x0000F000LU)?(1 << 3):0) \
122 +(((x) & 0x000F0000LU)?(1 << 4):0) \
123 +(((x) & 0x00F00000LU)?(1 << 5):0) \
124 +(((x) & 0x0F000000LU)?(1 << 6):0) \
125 +(((x) & 0xF0000000LU)?(1 << 7):0)
127 #define B8(bits,count) { ((uint8_t)B8__(HEX__(bits))), (count) }
129 static const struct tms_sequences old_tms_seqs
[6][6] = /* [from_state_ndx][to_state_ndx] */
131 /* value clocked to TMS to move from one of six stable states to another.
132 * N.B. OOCD clocks TMS from LSB first, so read these right-to-left.
133 * N.B. Reset only needs to be 0b11111, but in JLink an even byte of 1's is more stable.
134 * These extra ones cause no TAP state problem, because we go into reset and stay in reset.
138 /* RESET IDLE DRSHIFT DRPAUSE IRSHIFT IRPAUSE */ /* from state: */
139 { B8(1111111,7), B8(0000000,7), B8(0010111,7), B8(0001010,7), B8(0011011,7), B8(0010110,7) }, /* RESET */
140 { B8(1111111,7), B8(0000000,7), B8(0100101,7), B8(0000101,7), B8(0101011,7), B8(0001011,7) }, /* IDLE */
141 { B8(1111111,7), B8(0110001,7), B8(0000000,7), B8(0000001,7), B8(0001111,7), B8(0101111,7) }, /* DRSHIFT */
142 { B8(1111111,7), B8(0110000,7), B8(0100000,7), B8(0010111,7), B8(0011110,7), B8(0101111,7) }, /* DRPAUSE */
143 { B8(1111111,7), B8(0110001,7), B8(0000111,7), B8(0010111,7), B8(0000000,7), B8(0000001,7) }, /* IRSHIFT */
144 { B8(1111111,7), B8(0110000,7), B8(0011100,7), B8(0010111,7), B8(0011110,7), B8(0101111,7) }, /* IRPAUSE */
149 static const struct tms_sequences short_tms_seqs
[6][6] = /* [from_state_ndx][to_state_ndx] */
151 /* this is the table submitted by Jeff Williams on 3/30/2009 with this comment:
153 OK, I added Peter's version of the state table, and it works OK for
154 me on MC1322x. I've recreated the jlink portion of patch with this
155 new state table. His changes to my state table are pretty minor in
156 terms of total transitions, but Peter feels that his version fixes
157 some long-standing problems.
160 I added the bit count into the table, reduced RESET column to 7 bits from 8.
163 state specific comments:
164 ------------------------
165 *->RESET tried the 5 bit reset and it gave me problems, 7 bits seems to
166 work better on ARM9 with ft2232 driver. (Dick)
168 RESET->DRSHIFT add 1 extra clock cycles in the RESET state before advancing.
169 needed on ARM9 with ft2232 driver. (Dick)
170 (For a total of *THREE* extra clocks in RESET; NOP.)
172 RESET->IRSHIFT add 1 extra clock cycles in the RESET state before advancing.
173 needed on ARM9 with ft2232 driver. (Dick)
174 (For a total of *TWO* extra clocks in RESET; NOP.)
176 RESET->* always adds one or more clocks in the target state,
177 which should be NOPS; except shift states which (as
178 noted above) add those clocks in RESET.
180 The X-to-X transitions always add clocks; from *SHIFT, they go
181 via IDLE and thus *DO HAVE SIDE EFFECTS* (capture and update).
185 /* RESET IDLE DRSHIFT DRPAUSE IRSHIFT IRPAUSE */ /* from state: */
186 { B8(1111111,7), B8(0000000,7), B8(0010111,7), B8(0001010,7), B8(0011011,7), B8(0010110,7) }, /* RESET */
187 { B8(1111111,7), B8(0000000,7), B8(001,3), B8(0101,4), B8(0011,4), B8(01011,5) }, /* IDLE */
188 { B8(1111111,7), B8(011,3), B8(00111,5), B8(01,2), B8(001111,6), B8(0101111,7) }, /* DRSHIFT */
189 { B8(1111111,7), B8(011,3), B8(01,2), B8(0,1), B8(001111,6), B8(0101111,7) }, /* DRPAUSE */
190 { B8(1111111,7), B8(011,3), B8(00111,5), B8(010111,6), B8(001111,6), B8(01,2) }, /* IRSHIFT */
191 { B8(1111111,7), B8(011,3), B8(00111,5), B8(010111,6), B8(01,2), B8(0,1)} /* IRPAUSE */
195 typedef const struct tms_sequences tms_table
[6][6];
197 static tms_table
*tms_seqs
=&short_tms_seqs
;
199 int tap_get_tms_path(tap_state_t from
, tap_state_t to
)
201 return (*tms_seqs
)[tap_move_ndx(from
)][tap_move_ndx(to
)].bits
;
205 int tap_get_tms_path_len(tap_state_t from
, tap_state_t to
)
207 return (*tms_seqs
)[tap_move_ndx(from
)][tap_move_ndx(to
)].bit_count
;
211 bool tap_is_state_stable(tap_state_t astate
)
215 /* A switch () is used because it is symbol dependent
216 (not value dependent like an array), and can also check bounds.
235 tap_state_t
tap_state_transition(tap_state_t cur_state
, bool tms
)
237 tap_state_t new_state
;
239 /* A switch is used because it is symbol dependent and not value dependent
240 like an array. Also it can check for out of range conditions.
248 new_state
= cur_state
;
253 new_state
= TAP_DRSELECT
;
256 new_state
= TAP_IRSELECT
;
260 new_state
= TAP_DREXIT1
;
264 new_state
= TAP_DRUPDATE
;
267 new_state
= TAP_DREXIT2
;
270 new_state
= TAP_RESET
;
274 new_state
= TAP_IREXIT1
;
278 new_state
= TAP_IRUPDATE
;
281 new_state
= TAP_IREXIT2
;
284 LOG_ERROR("fatal: invalid argument cur_state=%d", cur_state
);
297 new_state
= TAP_IDLE
;
300 new_state
= TAP_DRCAPTURE
;
305 new_state
= TAP_DRSHIFT
;
309 new_state
= TAP_DRPAUSE
;
312 new_state
= TAP_IRCAPTURE
;
317 new_state
= TAP_IRSHIFT
;
321 new_state
= TAP_IRPAUSE
;
324 LOG_ERROR("fatal: invalid argument cur_state=%d", cur_state
);
334 /* NOTE: do not change these state names. They're documented,
335 * and we rely on them to match SVF input (except for "RUN/IDLE").
337 static const struct name_mapping
{
338 enum tap_state symbol
;
340 } tap_name_mapping
[] = {
341 { TAP_RESET
, "RESET", },
342 { TAP_IDLE
, "RUN/IDLE", },
343 { TAP_DRSELECT
, "DRSELECT", },
344 { TAP_DRCAPTURE
,"DRCAPTURE", },
345 { TAP_DRSHIFT
, "DRSHIFT", },
346 { TAP_DREXIT1
, "DREXIT1", },
347 { TAP_DRPAUSE
, "DRPAUSE", },
348 { TAP_DREXIT2
, "DREXIT2", },
349 { TAP_DRUPDATE
, "DRUPDATE", },
350 { TAP_IRSELECT
, "IRSELECT", },
351 { TAP_IRCAPTURE
,"IRCAPTURE", },
352 { TAP_IRSHIFT
, "IRSHIFT", },
353 { TAP_IREXIT1
, "IREXIT1", },
354 { TAP_IRPAUSE
, "IRPAUSE", },
355 { TAP_IREXIT2
, "IREXIT2", },
356 { TAP_IRUPDATE
, "IRUPDATE", },
358 /* only for input: accept standard SVF name */
359 { TAP_IDLE
, "IDLE", },
362 const char *tap_state_name(tap_state_t state
)
366 for (i
= 0; i
< ARRAY_SIZE(tap_name_mapping
); i
++) {
367 if (tap_name_mapping
[i
].symbol
== state
)
368 return tap_name_mapping
[i
].name
;
373 tap_state_t
tap_state_by_name(const char *name
)
377 for (i
= 0; i
< ARRAY_SIZE(tap_name_mapping
); i
++) {
378 /* be nice to the human */
379 if (strcasecmp(name
, tap_name_mapping
[i
].name
) == 0)
380 return tap_name_mapping
[i
].symbol
;
386 #ifdef _DEBUG_JTAG_IO_
388 #define JTAG_DEBUG_STATE_APPEND(buf, len, bit) \
389 do { buf[len] = bit ? '1' : '0'; } while (0)
390 #define JTAG_DEBUG_STATE_PRINT(a, b, astr, bstr) \
391 DEBUG_JTAG_IO("TAP/SM: %9s -> %5s\tTMS: %s\tTDI: %s", \
392 tap_state_name(a), tap_state_name(b), astr, bstr)
394 tap_state_t
jtag_debug_state_machine(const void *tms_buf
, const void *tdi_buf
,
395 unsigned tap_bits
, tap_state_t next_state
)
397 const uint8_t *tms_buffer
;
398 const uint8_t *tdi_buffer
;
403 unsigned tap_out_bits
;
407 tap_state_t last_state
;
409 // set startstate (and possibly last, if tap_bits == 0)
410 last_state
= next_state
;
411 DEBUG_JTAG_IO("TAP/SM: START state: %s", tap_state_name(next_state
));
413 tms_buffer
= (const uint8_t *)tms_buf
;
414 tdi_buffer
= (const uint8_t *)tdi_buf
;
416 tap_bytes
= DIV_ROUND_UP(tap_bits
, 8);
417 DEBUG_JTAG_IO("TAP/SM: TMS bits: %u (bytes: %u)", tap_bits
, tap_bytes
);
420 for (cur_byte
= 0; cur_byte
< tap_bytes
; cur_byte
++)
422 for (cur_bit
= 0; cur_bit
< 8; cur_bit
++)
424 // make sure we do not run off the end of the buffers
425 unsigned tap_bit
= cur_byte
* 8 + cur_bit
;
426 if (tap_bit
== tap_bits
)
429 // check and save TMS bit
430 tap_bit
= !!(tms_buffer
[cur_byte
] & (1 << cur_bit
));
431 JTAG_DEBUG_STATE_APPEND(tms_str
, tap_out_bits
, tap_bit
);
433 // use TMS bit to find the next TAP state
434 next_state
= tap_state_transition(last_state
, tap_bit
);
436 // check and store TDI bit
437 tap_bit
= !!(tdi_buffer
[cur_byte
] & (1 << cur_bit
));
438 JTAG_DEBUG_STATE_APPEND(tdi_str
, tap_out_bits
, tap_bit
);
440 // increment TAP bits
443 // Only show TDO bits on state transitions, or
444 // after some number of bits in the same state.
445 if ((next_state
== last_state
) && (tap_out_bits
< 32))
448 // terminate strings and display state transition
449 tms_str
[tap_out_bits
] = tdi_str
[tap_out_bits
] = 0;
450 JTAG_DEBUG_STATE_PRINT(last_state
, next_state
, tms_str
, tdi_str
);
453 last_state
= next_state
;
460 // terminate strings and display state transition
461 tms_str
[tap_out_bits
] = tdi_str
[tap_out_bits
] = 0;
462 JTAG_DEBUG_STATE_PRINT(last_state
, next_state
, tms_str
, tdi_str
);
465 DEBUG_JTAG_IO("TAP/SM: FINAL state: %s", tap_state_name(next_state
));
469 #endif // _DEBUG_JTAG_IO_
471 void tap_use_new_tms_table(bool use_new
)
473 tms_seqs
= use_new
? &short_tms_seqs
: &old_tms_seqs
;
475 bool tap_uses_new_tms_table(void)
477 return tms_seqs
== &short_tms_seqs
;