2008-07-26 05:32:11 -05:00
|
|
|
/***************************************************************************
|
|
|
|
* Copyright (C) 2008 by Spencer Oliver *
|
|
|
|
* spen@spen-soft.co.uk *
|
|
|
|
* *
|
|
|
|
* Copyright (C) 2008 by David T.L. Wong *
|
|
|
|
* *
|
2009-12-16 05:23:52 -06:00
|
|
|
* Copyright (C) 2009 by David N. Claffey <dnclaffey@gmail.com> *
|
|
|
|
* *
|
2011-07-07 10:41:20 -05:00
|
|
|
* Copyright (C) 2011 by Drasko DRASKOVIC *
|
|
|
|
* drasko.draskovic@gmail.com *
|
|
|
|
* *
|
2008-07-26 05:32:11 -05:00
|
|
|
* 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. *
|
|
|
|
***************************************************************************/
|
2009-04-21 06:35:58 -05:00
|
|
|
|
|
|
|
/*
|
2012-02-05 06:03:04 -06:00
|
|
|
* This version has optimized assembly routines for 32 bit operations:
|
|
|
|
* - read word
|
|
|
|
* - write word
|
|
|
|
* - write array of words
|
|
|
|
*
|
|
|
|
* One thing to be aware of is that the MIPS32 cpu will execute the
|
|
|
|
* instruction after a branch instruction (one delay slot).
|
|
|
|
*
|
|
|
|
* For example:
|
|
|
|
* LW $2, ($5 +10)
|
|
|
|
* B foo
|
|
|
|
* LW $1, ($2 +100)
|
|
|
|
*
|
|
|
|
* The LW $1, ($2 +100) instruction is also executed. If this is
|
|
|
|
* not wanted a NOP can be inserted:
|
|
|
|
*
|
|
|
|
* LW $2, ($5 +10)
|
|
|
|
* B foo
|
|
|
|
* NOP
|
|
|
|
* LW $1, ($2 +100)
|
|
|
|
*
|
|
|
|
* or the code can be changed to:
|
|
|
|
*
|
|
|
|
* B foo
|
|
|
|
* LW $2, ($5 +10)
|
|
|
|
* LW $1, ($2 +100)
|
|
|
|
*
|
|
|
|
* The original code contained NOPs. I have removed these and moved
|
|
|
|
* the branches.
|
|
|
|
*
|
|
|
|
* I also moved the PRACC_STACK to 0xFF204000. This allows
|
|
|
|
* the use of 16 bits offsets to get pointers to the input
|
|
|
|
* and output area relative to the stack. Note that the stack
|
|
|
|
* isn't really a stack (the stack pointer is not 'moving')
|
|
|
|
* but a FIFO simulated in software.
|
|
|
|
*
|
|
|
|
* These changes result in a 35% speed increase when programming an
|
|
|
|
* external flash.
|
|
|
|
*
|
|
|
|
* More improvement could be gained if the registers do no need
|
|
|
|
* to be preserved but in that case the routines should be aware
|
|
|
|
* OpenOCD is used as a flash programmer or as a debug tool.
|
|
|
|
*
|
|
|
|
* Nico Coesel
|
|
|
|
*/
|
2009-04-21 06:35:58 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
#include "config.h"
|
|
|
|
#endif
|
|
|
|
|
2011-04-04 08:24:59 -05:00
|
|
|
#include <helper/time_support.h>
|
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
#include "mips32.h"
|
|
|
|
#include "mips32_pracc.h"
|
|
|
|
|
2013-03-03 06:08:42 -06:00
|
|
|
#define PRACC_FETCH 0
|
|
|
|
#define PRACC_STORE 1
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
struct mips32_pracc_context {
|
2009-06-18 02:09:35 -05:00
|
|
|
uint32_t *local_iparam;
|
2008-07-26 05:32:11 -05:00
|
|
|
int num_iparam;
|
2009-06-18 02:09:35 -05:00
|
|
|
uint32_t *local_oparam;
|
2008-07-26 05:32:11 -05:00
|
|
|
int num_oparam;
|
2009-11-22 13:18:26 -06:00
|
|
|
const uint32_t *code;
|
2008-07-26 05:32:11 -05:00
|
|
|
int code_len;
|
2009-06-18 02:09:35 -05:00
|
|
|
uint32_t stack[32];
|
2008-07-26 05:32:11 -05:00
|
|
|
int stack_offset;
|
2009-11-13 10:43:36 -06:00
|
|
|
struct mips_ejtag *ejtag_info;
|
2009-11-13 11:48:18 -06:00
|
|
|
};
|
2008-07-26 05:32:11 -05:00
|
|
|
|
2011-07-07 10:59:13 -05:00
|
|
|
static int mips32_pracc_sync_cache(struct mips_ejtag *ejtag_info,
|
|
|
|
uint32_t start_addr, uint32_t end_addr);
|
|
|
|
static int mips32_pracc_clean_invalidate_cache(struct mips_ejtag *ejtag_info,
|
2012-02-05 06:03:04 -06:00
|
|
|
uint32_t start_addr, uint32_t end_addr);
|
2011-07-07 10:59:13 -05:00
|
|
|
|
2009-11-13 10:43:36 -06:00
|
|
|
static int wait_for_pracc_rw(struct mips_ejtag *ejtag_info, uint32_t *ctrl)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2009-06-18 02:09:35 -05:00
|
|
|
uint32_t ejtag_ctrl;
|
2011-04-04 08:24:59 -05:00
|
|
|
long long then = timeval_ms();
|
|
|
|
int timeout;
|
2011-07-05 10:37:05 -05:00
|
|
|
int retval;
|
2011-04-04 08:24:59 -05:00
|
|
|
|
|
|
|
/* wait for the PrAcc to become "1" */
|
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_CONTROL);
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
while (1) {
|
2012-08-05 04:18:27 -05:00
|
|
|
ejtag_ctrl = ejtag_info->ejtag_ctrl;
|
2011-04-04 08:24:59 -05:00
|
|
|
retval = mips_ejtag_drscan_32(ejtag_info, &ejtag_ctrl);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
if (ejtag_ctrl & EJTAG_CTRL_PRACC)
|
|
|
|
break;
|
2011-04-04 08:24:59 -05:00
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
timeout = timeval_ms() - then;
|
|
|
|
if (timeout > 1000) {
|
2011-04-04 08:24:59 -05:00
|
|
|
LOG_DEBUG("DEBUGMODULE: No memory access in progress!");
|
|
|
|
return ERROR_JTAG_DEVICE_ERROR;
|
|
|
|
}
|
2008-07-26 05:32:11 -05:00
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
*ctrl = ejtag_ctrl;
|
|
|
|
return ERROR_OK;
|
|
|
|
}
|
|
|
|
|
2009-11-13 11:48:18 -06:00
|
|
|
static int mips32_pracc_exec_read(struct mips32_pracc_context *ctx, uint32_t address)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2009-11-13 10:43:36 -06:00
|
|
|
struct mips_ejtag *ejtag_info = ctx->ejtag_info;
|
2008-07-26 05:32:11 -05:00
|
|
|
int offset;
|
2009-06-18 02:09:35 -05:00
|
|
|
uint32_t ejtag_ctrl, data;
|
2008-07-26 05:32:11 -05:00
|
|
|
|
|
|
|
if ((address >= MIPS32_PRACC_PARAM_IN)
|
2012-06-07 09:44:34 -05:00
|
|
|
&& (address < MIPS32_PRACC_PARAM_IN + ctx->num_iparam * 4)) {
|
2008-07-26 05:32:11 -05:00
|
|
|
offset = (address - MIPS32_PRACC_PARAM_IN) / 4;
|
|
|
|
data = ctx->local_iparam[offset];
|
2012-02-05 06:03:04 -06:00
|
|
|
} else if ((address >= MIPS32_PRACC_PARAM_OUT)
|
2012-06-07 09:44:34 -05:00
|
|
|
&& (address < MIPS32_PRACC_PARAM_OUT + ctx->num_oparam * 4)) {
|
2008-07-26 05:32:11 -05:00
|
|
|
offset = (address - MIPS32_PRACC_PARAM_OUT) / 4;
|
|
|
|
data = ctx->local_oparam[offset];
|
2012-02-05 06:03:04 -06:00
|
|
|
} else if ((address >= MIPS32_PRACC_TEXT)
|
2012-06-07 09:44:34 -05:00
|
|
|
&& (address < MIPS32_PRACC_TEXT + ctx->code_len * 4)) {
|
2008-07-26 05:32:11 -05:00
|
|
|
offset = (address - MIPS32_PRACC_TEXT) / 4;
|
|
|
|
data = ctx->code[offset];
|
2012-02-05 06:03:04 -06:00
|
|
|
} else if (address == MIPS32_PRACC_STACK) {
|
2012-06-07 09:44:34 -05:00
|
|
|
if (ctx->stack_offset <= 0) {
|
|
|
|
LOG_ERROR("Error: Pracc stack out of bounds");
|
|
|
|
return ERROR_JTAG_DEVICE_ERROR;
|
|
|
|
}
|
2008-07-26 05:32:11 -05:00
|
|
|
/* save to our debug stack */
|
|
|
|
data = ctx->stack[--ctx->stack_offset];
|
2012-02-05 06:03:04 -06:00
|
|
|
} else {
|
2008-07-26 05:32:11 -05:00
|
|
|
/* TODO: send JMP 0xFF200000 instruction. Hopefully processor jump back
|
|
|
|
* to start of debug vector */
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2009-12-21 10:33:03 -06:00
|
|
|
LOG_ERROR("Error reading unexpected address 0x%8.8" PRIx32 "", address);
|
2008-07-26 05:32:11 -05:00
|
|
|
return ERROR_JTAG_DEVICE_ERROR;
|
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
/* Send the data out */
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ctx->ejtag_info, EJTAG_INST_DATA);
|
2011-04-04 08:33:04 -05:00
|
|
|
mips_ejtag_drscan_32_out(ctx->ejtag_info, data);
|
2008-07-26 05:32:11 -05:00
|
|
|
|
|
|
|
/* Clear the access pending bit (let the processor eat!) */
|
2008-10-14 01:21:17 -05:00
|
|
|
ejtag_ctrl = ejtag_info->ejtag_ctrl & ~EJTAG_CTRL_PRACC;
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ctx->ejtag_info, EJTAG_INST_CONTROL);
|
2011-04-04 08:33:04 -05:00
|
|
|
mips_ejtag_drscan_32_out(ctx->ejtag_info, ejtag_ctrl);
|
2009-04-21 06:35:58 -05:00
|
|
|
|
2011-03-31 16:07:55 -05:00
|
|
|
return jtag_execute_queue();
|
2008-07-26 05:32:11 -05:00
|
|
|
}
|
|
|
|
|
2009-11-13 11:48:18 -06:00
|
|
|
static int mips32_pracc_exec_write(struct mips32_pracc_context *ctx, uint32_t address)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2012-02-05 06:03:04 -06:00
|
|
|
uint32_t ejtag_ctrl, data;
|
2008-07-26 05:32:11 -05:00
|
|
|
int offset;
|
2009-11-13 10:43:36 -06:00
|
|
|
struct mips_ejtag *ejtag_info = ctx->ejtag_info;
|
2011-04-04 08:24:59 -05:00
|
|
|
int retval;
|
2009-04-21 06:35:58 -05:00
|
|
|
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ctx->ejtag_info, EJTAG_INST_DATA);
|
2011-04-04 08:24:59 -05:00
|
|
|
retval = mips_ejtag_drscan_32(ctx->ejtag_info, &data);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
/* Clear access pending bit */
|
2008-10-14 01:21:17 -05:00
|
|
|
ejtag_ctrl = ejtag_info->ejtag_ctrl & ~EJTAG_CTRL_PRACC;
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ctx->ejtag_info, EJTAG_INST_CONTROL);
|
2011-04-04 08:33:04 -05:00
|
|
|
mips_ejtag_drscan_32_out(ctx->ejtag_info, ejtag_ctrl);
|
2009-04-21 06:35:58 -05:00
|
|
|
|
2011-04-01 05:32:41 -05:00
|
|
|
retval = jtag_execute_queue();
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-11-11 11:06:57 -06:00
|
|
|
if ((address >= MIPS32_PRACC_PARAM_OUT)
|
2012-06-07 09:44:34 -05:00
|
|
|
&& (address < MIPS32_PRACC_PARAM_OUT + ctx->num_oparam * 4)) {
|
2008-07-26 05:32:11 -05:00
|
|
|
offset = (address - MIPS32_PRACC_PARAM_OUT) / 4;
|
|
|
|
ctx->local_oparam[offset] = data;
|
2012-02-05 06:03:04 -06:00
|
|
|
} else if (address == MIPS32_PRACC_STACK) {
|
2012-06-07 09:44:34 -05:00
|
|
|
if (ctx->stack_offset >= 32) {
|
|
|
|
LOG_ERROR("Error: Pracc stack out of bounds");
|
|
|
|
return ERROR_JTAG_DEVICE_ERROR;
|
|
|
|
}
|
2008-07-26 05:32:11 -05:00
|
|
|
/* save data onto our stack */
|
|
|
|
ctx->stack[ctx->stack_offset++] = data;
|
2012-02-05 06:03:04 -06:00
|
|
|
} else {
|
2009-12-21 10:33:03 -06:00
|
|
|
LOG_ERROR("Error writing unexpected address 0x%8.8" PRIx32 "", address);
|
2008-07-26 05:32:11 -05:00
|
|
|
return ERROR_JTAG_DEVICE_ERROR;
|
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
return ERROR_OK;
|
|
|
|
}
|
|
|
|
|
2010-01-13 04:12:34 -06:00
|
|
|
int mips32_pracc_exec(struct mips_ejtag *ejtag_info, int code_len, const uint32_t *code,
|
|
|
|
int num_param_in, uint32_t *param_in, int num_param_out, uint32_t *param_out, int cycle)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2009-06-18 02:09:35 -05:00
|
|
|
uint32_t ejtag_ctrl;
|
2012-06-07 09:44:34 -05:00
|
|
|
uint32_t address;
|
2009-11-13 11:48:18 -06:00
|
|
|
struct mips32_pracc_context ctx;
|
2008-07-26 05:32:11 -05:00
|
|
|
int retval;
|
|
|
|
int pass = 0;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
ctx.local_iparam = param_in;
|
|
|
|
ctx.local_oparam = param_out;
|
|
|
|
ctx.num_iparam = num_param_in;
|
|
|
|
ctx.num_oparam = num_param_out;
|
|
|
|
ctx.code = code;
|
|
|
|
ctx.code_len = code_len;
|
|
|
|
ctx.ejtag_info = ejtag_info;
|
|
|
|
ctx.stack_offset = 0;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
while (1) {
|
|
|
|
retval = wait_for_pracc_rw(ejtag_info, &ejtag_ctrl);
|
|
|
|
if (retval != ERROR_OK)
|
2008-07-26 05:32:11 -05:00
|
|
|
return retval;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-06-07 09:44:34 -05:00
|
|
|
address = 0;
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_ADDRESS);
|
2011-04-04 08:24:59 -05:00
|
|
|
retval = mips_ejtag_drscan_32(ejtag_info, &address);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
2009-04-21 06:35:58 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
/* Check for read or write */
|
2012-02-05 06:03:04 -06:00
|
|
|
if (ejtag_ctrl & EJTAG_CTRL_PRNW) {
|
|
|
|
retval = mips32_pracc_exec_write(&ctx, address);
|
|
|
|
if (retval != ERROR_OK)
|
2008-07-26 05:32:11 -05:00
|
|
|
return retval;
|
2012-02-05 06:03:04 -06:00
|
|
|
} else {
|
2008-07-26 05:32:11 -05:00
|
|
|
/* Check to see if its reading at the debug vector. The first pass through
|
|
|
|
* the module is always read at the vector, so the first one we allow. When
|
|
|
|
* the second read from the vector occurs we are done and just exit. */
|
|
|
|
if ((address == MIPS32_PRACC_TEXT) && (pass++))
|
|
|
|
break;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
retval = mips32_pracc_exec_read(&ctx, address);
|
|
|
|
if (retval != ERROR_OK)
|
2008-07-26 05:32:11 -05:00
|
|
|
return retval;
|
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
if (cycle == 0)
|
|
|
|
break;
|
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
/* stack sanity check */
|
|
|
|
if (ctx.stack_offset != 0)
|
|
|
|
LOG_DEBUG("Pracc Stack not zero");
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2008-07-26 05:32:11 -05:00
|
|
|
return ERROR_OK;
|
|
|
|
}
|
|
|
|
|
2013-03-03 06:08:42 -06:00
|
|
|
inline void pracc_queue_init(struct pracc_queue_info *ctx)
|
|
|
|
{
|
|
|
|
ctx->retval = ERROR_OK;
|
|
|
|
ctx->code_count = 0;
|
|
|
|
ctx->store_count = 0;
|
|
|
|
|
|
|
|
ctx->pracc_list = malloc(2 * ctx->max_code * sizeof(uint32_t));
|
|
|
|
if (ctx->pracc_list == NULL) {
|
|
|
|
LOG_ERROR("Out of memory");
|
|
|
|
ctx->retval = ERROR_FAIL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void pracc_add(struct pracc_queue_info *ctx, uint32_t addr, uint32_t instr)
|
|
|
|
{
|
|
|
|
ctx->pracc_list[ctx->max_code + ctx->code_count] = addr;
|
|
|
|
ctx->pracc_list[ctx->code_count++] = instr;
|
|
|
|
if (addr)
|
|
|
|
ctx->store_count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void pracc_queue_free(struct pracc_queue_info *ctx)
|
|
|
|
{
|
|
|
|
if (ctx->code_count > ctx->max_code) /* Only for internal check, will be erased */
|
|
|
|
LOG_ERROR("Internal error, code count: %d > max code: %d", ctx->code_count, ctx->max_code);
|
|
|
|
if (ctx->pracc_list != NULL)
|
|
|
|
free(ctx->pracc_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
int mips32_pracc_queue_exec(struct mips_ejtag *ejtag_info, struct pracc_queue_info *ctx, uint32_t *buf)
|
|
|
|
{
|
|
|
|
if (ejtag_info->mode == 0)
|
|
|
|
return mips32_pracc_exec(ejtag_info, ctx->code_count, ctx->pracc_list, 0, NULL,
|
|
|
|
ctx->store_count, buf, ctx->code_count - 1);
|
|
|
|
|
|
|
|
union scan_in {
|
|
|
|
uint8_t scan_96[12];
|
|
|
|
struct {
|
|
|
|
uint8_t ctrl[4];
|
|
|
|
uint8_t data[4];
|
|
|
|
uint8_t addr[4];
|
|
|
|
} scan_32;
|
|
|
|
|
|
|
|
} *scan_in = malloc(sizeof(union scan_in) * (ctx->code_count + ctx->store_count));
|
|
|
|
if (scan_in == NULL) {
|
|
|
|
LOG_ERROR("Out of memory");
|
|
|
|
return ERROR_FAIL;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned num_clocks =
|
|
|
|
((uint64_t)(ejtag_info->scan_delay) * jtag_get_speed_khz() + 500000) / 1000000;
|
|
|
|
|
|
|
|
uint32_t ejtag_ctrl = ejtag_info->ejtag_ctrl & ~EJTAG_CTRL_PRACC;
|
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_ALL);
|
|
|
|
|
|
|
|
int scan_count = 0;
|
|
|
|
for (int i = 0; i != 2 * ctx->code_count; i++) {
|
|
|
|
uint32_t data = 0;
|
|
|
|
if (i & 1u) { /* Check store address from previous instruction, if not the first */
|
|
|
|
if (i < 2 || 0 == ctx->pracc_list[ctx->max_code + (i / 2) - 1])
|
|
|
|
continue;
|
|
|
|
} else
|
|
|
|
data = ctx->pracc_list[i / 2];
|
|
|
|
|
|
|
|
jtag_add_clocks(num_clocks);
|
|
|
|
mips_ejtag_add_scan_96(ejtag_info, ejtag_ctrl, data, scan_in[scan_count++].scan_96);
|
|
|
|
}
|
|
|
|
|
|
|
|
int retval = jtag_execute_queue(); /* execute queued scans */
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
goto exit;
|
|
|
|
|
|
|
|
uint32_t fetch_addr = MIPS32_PRACC_TEXT; /* start address */
|
|
|
|
scan_count = 0;
|
|
|
|
for (int i = 0; i != 2 * ctx->code_count; i++) { /* verify every pracc access */
|
|
|
|
uint32_t store_addr = 0;
|
|
|
|
if (i & 1u) { /* Read store addres from previous instruction, if not the first */
|
|
|
|
store_addr = ctx->pracc_list[ctx->max_code + (i / 2) - 1];
|
|
|
|
if (i < 2 || 0 == store_addr)
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
ejtag_ctrl = buf_get_u32(scan_in[scan_count].scan_32.ctrl, 0, 32);
|
|
|
|
if (!(ejtag_ctrl & EJTAG_CTRL_PRACC)) {
|
|
|
|
LOG_ERROR("Error: access not pending count: %d", scan_count);
|
|
|
|
retval = ERROR_FAIL;
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t addr = buf_get_u32(scan_in[scan_count].scan_32.addr, 0, 32);
|
|
|
|
|
|
|
|
if (store_addr != 0) {
|
|
|
|
if (!(ejtag_ctrl & EJTAG_CTRL_PRNW)) {
|
|
|
|
LOG_ERROR("Not a store/write access, count: %d", scan_count);
|
|
|
|
retval = ERROR_FAIL;
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
if (addr != store_addr) {
|
|
|
|
LOG_ERROR("Store address mismatch, read: %x expected: %x count: %d",
|
|
|
|
addr, store_addr, scan_count);
|
|
|
|
retval = ERROR_FAIL;
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
int buf_index = (addr - MIPS32_PRACC_PARAM_OUT) / 4;
|
|
|
|
buf[buf_index] = buf_get_u32(scan_in[scan_count].scan_32.data, 0, 32);
|
|
|
|
|
|
|
|
} else {
|
|
|
|
if (ejtag_ctrl & EJTAG_CTRL_PRNW) {
|
|
|
|
LOG_ERROR("Not a fetch/read access, count: %d", scan_count);
|
|
|
|
retval = ERROR_FAIL;
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
if (addr != fetch_addr) {
|
|
|
|
LOG_ERROR("Fetch addr mismatch, read: %x expected: %x count: %d", addr, fetch_addr, scan_count);
|
|
|
|
retval = ERROR_FAIL;
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
fetch_addr += 4;
|
|
|
|
}
|
|
|
|
scan_count++;
|
|
|
|
}
|
|
|
|
exit:
|
|
|
|
free(scan_in);
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
int mips32_pracc_read_u32(struct mips_ejtag *ejtag_info, uint32_t addr, uint32_t *buf)
|
2012-11-02 10:08:31 -05:00
|
|
|
{
|
2013-03-03 06:08:42 -06:00
|
|
|
struct pracc_queue_info ctx = {.max_code = 9};
|
|
|
|
pracc_queue_init(&ctx);
|
|
|
|
if (ctx.retval != ERROR_OK)
|
|
|
|
goto exit;
|
|
|
|
|
|
|
|
pracc_add(&ctx, 0, MIPS32_MTC0(15, 31, 0)); /* move $15 to COP0 DeSave */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(15, PRACC_UPPER_BASE_ADDR)); /* $15 = MIPS32_PRACC_BASE_ADDR */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(8, UPPER16((addr + 0x8000)))); /* load $8 with modified upper address */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LW(8, LOWER16(addr), 8)); /* lw $8, LOWER16(addr)($8) */
|
|
|
|
pracc_add(&ctx, MIPS32_PRACC_PARAM_OUT,
|
|
|
|
MIPS32_SW(8, PRACC_OUT_OFFSET, 15)); /* sw $8,PRACC_OUT_OFFSET($15) */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(8, UPPER16(ejtag_info->reg8))); /* restore upper 16 of $8 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_ORI(8, 8, LOWER16(ejtag_info->reg8))); /* restore lower 16 of $8 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_B(NEG16(ctx.code_count + 1))); /* jump to start */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_MFC0(15, 31, 0)); /* move COP0 DeSave to $15 */
|
|
|
|
|
|
|
|
ctx.retval = mips32_pracc_queue_exec(ejtag_info, &ctx, buf);
|
|
|
|
exit:
|
|
|
|
pracc_queue_free(&ctx);
|
|
|
|
return ctx.retval;
|
2012-11-02 10:08:31 -05:00
|
|
|
}
|
|
|
|
|
2009-11-13 10:43:36 -06:00
|
|
|
int mips32_pracc_read_mem(struct mips_ejtag *ejtag_info, uint32_t addr, int size, int count, void *buf)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2012-11-02 04:14:58 -05:00
|
|
|
if (count == 1 && size == 4)
|
|
|
|
return mips32_pracc_read_u32(ejtag_info, addr, (uint32_t *)buf);
|
|
|
|
|
|
|
|
uint32_t *data = NULL;
|
2013-03-03 13:11:38 -06:00
|
|
|
struct pracc_queue_info ctx = {.max_code = 256 * 3 + 9 + 1}; /* alloc memory for the worst case */
|
|
|
|
pracc_queue_init(&ctx);
|
|
|
|
if (ctx.retval != ERROR_OK)
|
2012-11-02 04:14:58 -05:00
|
|
|
goto exit;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-11-02 04:14:58 -05:00
|
|
|
if (size != 4) {
|
|
|
|
data = malloc(256 * sizeof(uint32_t));
|
|
|
|
if (data == NULL) {
|
|
|
|
LOG_ERROR("Out of memory");
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
}
|
2008-07-26 05:32:11 -05:00
|
|
|
|
2012-11-02 04:14:58 -05:00
|
|
|
uint32_t *buf32 = buf;
|
|
|
|
uint16_t *buf16 = buf;
|
|
|
|
uint8_t *buf8 = buf;
|
|
|
|
|
|
|
|
while (count) {
|
2013-03-03 13:11:38 -06:00
|
|
|
ctx.code_count = 0;
|
|
|
|
ctx.store_count = 0;
|
|
|
|
int this_round_count = (count > 256) ? 256 : count;
|
|
|
|
uint32_t last_upper_base_addr = UPPER16((addr + 0x8000));
|
|
|
|
|
|
|
|
pracc_add(&ctx, 0, MIPS32_MTC0(15, 31, 0)); /* save $15 in DeSave */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(15, PRACC_UPPER_BASE_ADDR)); /* $15 = MIPS32_PRACC_BASE_ADDR */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(9, last_upper_base_addr)); /* load the upper memory address in $9 */
|
|
|
|
|
|
|
|
for (int i = 0; i != this_round_count; i++) { /* Main code loop */
|
|
|
|
uint32_t upper_base_addr = UPPER16((addr + 0x8000));
|
|
|
|
if (last_upper_base_addr != upper_base_addr) { /* if needed, change upper address in $9 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(9, upper_base_addr));
|
2012-11-02 04:14:58 -05:00
|
|
|
last_upper_base_addr = upper_base_addr;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (size == 4)
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_LW(8, LOWER16(addr), 9)); /* load from memory to $8 */
|
2012-11-02 04:14:58 -05:00
|
|
|
else if (size == 2)
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_LHU(8, LOWER16(addr), 9));
|
2012-11-02 04:14:58 -05:00
|
|
|
else
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_LBU(8, LOWER16(addr), 9));
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, MIPS32_PRACC_PARAM_OUT + i * 4,
|
|
|
|
MIPS32_SW(8, PRACC_OUT_OFFSET + i * 4, 15)); /* store $8 at param out */
|
2012-11-02 04:14:58 -05:00
|
|
|
addr += size;
|
|
|
|
}
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(8, UPPER16(ejtag_info->reg8))); /* restore upper 16 bits of reg 8 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_ORI(8, 8, LOWER16(ejtag_info->reg8))); /* restore lower 16 bits of reg 8 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(9, UPPER16(ejtag_info->reg9))); /* restore upper 16 bits of reg 9 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_ORI(9, 9, LOWER16(ejtag_info->reg9))); /* restore lower 16 bits of reg 9 */
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_B(NEG16(ctx.code_count + 1))); /* jump to start */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_MFC0(15, 31, 0)); /* restore $15 from DeSave */
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-11-02 04:14:58 -05:00
|
|
|
if (size == 4) {
|
2013-03-03 13:11:38 -06:00
|
|
|
ctx.retval = mips32_pracc_queue_exec(ejtag_info, &ctx, buf32);
|
|
|
|
if (ctx.retval != ERROR_OK)
|
2012-11-02 04:14:58 -05:00
|
|
|
goto exit;
|
|
|
|
buf32 += this_round_count;
|
|
|
|
} else {
|
2013-03-03 13:11:38 -06:00
|
|
|
ctx.retval = mips32_pracc_queue_exec(ejtag_info, &ctx, data);
|
|
|
|
if (ctx.retval != ERROR_OK)
|
2012-11-02 04:14:58 -05:00
|
|
|
goto exit;
|
2013-03-03 13:11:38 -06:00
|
|
|
|
2012-11-02 04:14:58 -05:00
|
|
|
uint32_t *data_p = data;
|
2013-03-03 13:11:38 -06:00
|
|
|
for (int i = 0; i != this_round_count; i++) {
|
2012-11-02 04:14:58 -05:00
|
|
|
if (size == 2)
|
|
|
|
*buf16++ = *data_p++;
|
|
|
|
else
|
|
|
|
*buf8++ = *data_p++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
count -= this_round_count;
|
2008-07-26 05:32:11 -05:00
|
|
|
}
|
2012-11-02 04:14:58 -05:00
|
|
|
exit:
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_queue_free(&ctx);
|
|
|
|
if (data != NULL)
|
2012-11-02 04:14:58 -05:00
|
|
|
free(data);
|
2013-03-03 13:11:38 -06:00
|
|
|
return ctx.retval;
|
2008-07-26 05:32:11 -05:00
|
|
|
}
|
|
|
|
|
2011-07-07 10:41:20 -05:00
|
|
|
int mips32_cp0_read(struct mips_ejtag *ejtag_info, uint32_t *val, uint32_t cp0_reg, uint32_t cp0_sel)
|
|
|
|
{
|
2013-03-03 13:11:38 -06:00
|
|
|
struct pracc_queue_info ctx = {.max_code = 8};
|
|
|
|
pracc_queue_init(&ctx);
|
|
|
|
if (ctx.retval != ERROR_OK)
|
|
|
|
goto exit;
|
2011-07-07 10:41:20 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_MTC0(15, 31, 0)); /* move $15 to COP0 DeSave */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(15, PRACC_UPPER_BASE_ADDR)); /* $15 = MIPS32_PRACC_BASE_ADDR */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_MFC0(8, 0, 0) | (cp0_reg << 11) | cp0_sel); /* move COP0 [cp0_reg select] to $8 */
|
|
|
|
pracc_add(&ctx, MIPS32_PRACC_PARAM_OUT,
|
|
|
|
MIPS32_SW(8, PRACC_OUT_OFFSET, 15)); /* store $8 to pracc_out */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_MFC0(15, 31, 0)); /* move COP0 DeSave to $15 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(8, UPPER16(ejtag_info->reg8))); /* restore upper 16 bits of $8 */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_B(NEG16(ctx.code_count + 1))); /* jump to start */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_ORI(8, 8, LOWER16(ejtag_info->reg8))); /* restore lower 16 bits of $8 */
|
2011-07-07 10:41:20 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
ctx.retval = mips32_pracc_queue_exec(ejtag_info, &ctx, val);
|
|
|
|
exit:
|
|
|
|
pracc_queue_free(&ctx);
|
|
|
|
return ctx.retval;
|
2011-07-07 10:41:20 -05:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Note that our input parametes cp0_reg and cp0_sel
|
|
|
|
* are numbers (not gprs) which make part of mfc0 instruction opcode.
|
|
|
|
*
|
|
|
|
* These are not fix, but can be different for each mips32_cp0_read() function call,
|
|
|
|
* and that is why we must insert them directly into opcode,
|
|
|
|
* i.e. we can not pass it on EJTAG microprogram stack (via param_in),
|
|
|
|
* and put them into the gprs later from MIPS32_PRACC_STACK
|
|
|
|
* because mfc0 do not use gpr as a parameter for the cp0_reg and select part,
|
|
|
|
* but plain (immediate) number.
|
|
|
|
*
|
|
|
|
* MIPS32_MTC0 is implemented via MIPS32_R_INST macro.
|
|
|
|
* In order to insert our parameters, we must change rd and funct fields.
|
2013-03-03 13:11:38 -06:00
|
|
|
*
|
|
|
|
* code[2] |= (cp0_reg << 11) | cp0_sel; change rd and funct of MIPS32_R_INST macro
|
|
|
|
**/
|
2011-07-07 10:41:20 -05:00
|
|
|
}
|
|
|
|
|
2012-11-01 14:55:28 -05:00
|
|
|
int mips32_cp0_write(struct mips_ejtag *ejtag_info, uint32_t val, uint32_t cp0_reg, uint32_t cp0_sel)
|
2011-07-07 10:41:20 -05:00
|
|
|
{
|
|
|
|
uint32_t code[] = {
|
|
|
|
/* start: */
|
2012-11-01 14:55:28 -05:00
|
|
|
MIPS32_MTC0(15, 31, 0), /* move $15 to COP0 DeSave */
|
|
|
|
MIPS32_LUI(15, UPPER16(val)), /* Load val to $15 */
|
|
|
|
MIPS32_ORI(15, 15, LOWER16(val)),
|
2011-07-07 10:41:20 -05:00
|
|
|
|
2012-11-01 14:55:28 -05:00
|
|
|
/* 3 */ MIPS32_MTC0(15, 0, 0), /* move $15 to COP0 [cp0_reg select] */
|
2011-07-07 10:41:20 -05:00
|
|
|
|
2012-11-01 14:55:28 -05:00
|
|
|
MIPS32_B(NEG16(5)), /* b start */
|
|
|
|
MIPS32_MFC0(15, 31, 0), /* move COP0 DeSave to $15 */
|
2011-07-07 10:41:20 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Note that MIPS32_MTC0 macro is implemented via MIPS32_R_INST macro.
|
|
|
|
* In order to insert our parameters, we must change rd and funct fields.
|
|
|
|
*/
|
2012-11-01 14:55:28 -05:00
|
|
|
code[3] |= (cp0_reg << 11) | cp0_sel; /* change rd and funct fields of MIPS32_R_INST macro */
|
2011-07-07 10:41:20 -05:00
|
|
|
|
2012-11-01 14:55:28 -05:00
|
|
|
return mips32_pracc_exec(ejtag_info, ARRAY_SIZE(code), code, 0, NULL, 0, NULL, 1);
|
2011-07-07 10:41:20 -05:00
|
|
|
}
|
|
|
|
|
2011-07-07 10:59:13 -05:00
|
|
|
/**
|
|
|
|
* \b mips32_pracc_sync_cache
|
|
|
|
*
|
|
|
|
* Synchronize Caches to Make Instruction Writes Effective
|
|
|
|
* (ref. doc. MIPS32 Architecture For Programmers Volume II: The MIPS32 Instruction Set,
|
|
|
|
* Document Number: MD00086, Revision 2.00, June 9, 2003)
|
|
|
|
*
|
|
|
|
* When the instruction stream is written, the SYNCI instruction should be used
|
|
|
|
* in conjunction with other instructions to make the newly-written instructions effective.
|
|
|
|
*
|
|
|
|
* Explanation :
|
|
|
|
* A program that loads another program into memory is actually writing the D- side cache.
|
|
|
|
* The instructions it has loaded can't be executed until they reach the I-cache.
|
|
|
|
*
|
|
|
|
* After the instructions have been written, the loader should arrange
|
|
|
|
* to write back any containing D-cache line and invalidate any locations
|
|
|
|
* already in the I-cache.
|
|
|
|
*
|
|
|
|
* You can do that with cache instructions, but those instructions are only available in kernel mode,
|
|
|
|
* and a loader writing instructions for the use of its own process need not be privileged software.
|
|
|
|
*
|
|
|
|
* In the latest MIPS32/64 CPUs, MIPS provides the synci instruction,
|
|
|
|
* which does the whole job for a cache-line-sized chunk of the memory you just loaded:
|
|
|
|
* That is, it arranges a D-cache write-back and an I-cache invalidate.
|
|
|
|
*
|
|
|
|
* To employ synci at user level, you need to know the size of a cache line,
|
|
|
|
* and that can be obtained with a rdhwr SYNCI_Step
|
|
|
|
* from one of the standard “hardware registers”.
|
|
|
|
*/
|
|
|
|
static int mips32_pracc_sync_cache(struct mips_ejtag *ejtag_info,
|
2012-02-05 06:03:04 -06:00
|
|
|
uint32_t start_addr, uint32_t end_addr)
|
2011-07-07 10:59:13 -05:00
|
|
|
{
|
|
|
|
static const uint32_t code[] = {
|
|
|
|
/* start: */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_MTC0(15, 31, 0), /* move $15 to COP0 DeSave */
|
|
|
|
MIPS32_LUI(15, UPPER16(MIPS32_PRACC_STACK)), /* $15 = MIPS32_PRACC_STACK */
|
|
|
|
MIPS32_ORI(15, 15, LOWER16(MIPS32_PRACC_STACK)),
|
|
|
|
MIPS32_SW(8, 0, 15), /* sw $8,($15) */
|
|
|
|
MIPS32_SW(9, 0, 15), /* sw $9,($15) */
|
|
|
|
MIPS32_SW(10, 0, 15), /* sw $10,($15) */
|
|
|
|
MIPS32_SW(11, 0, 15), /* sw $11,($15) */
|
|
|
|
|
|
|
|
MIPS32_LUI(8, UPPER16(MIPS32_PRACC_PARAM_IN)), /* $8 = MIPS32_PRACC_PARAM_IN */
|
|
|
|
MIPS32_ORI(8, 8, LOWER16(MIPS32_PRACC_PARAM_IN)),
|
|
|
|
MIPS32_LW(9, 0, 8), /* Load write start_addr to $9 */
|
|
|
|
MIPS32_LW(10, 4, 8), /* Load write end_addr to $10 */
|
2011-07-07 10:59:13 -05:00
|
|
|
|
|
|
|
MIPS32_RDHWR(11, MIPS32_SYNCI_STEP), /* $11 = MIPS32_SYNCI_STEP */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_BEQ(11, 0, 6), /* beq $11, $0, end */
|
2011-07-07 10:59:13 -05:00
|
|
|
MIPS32_NOP,
|
|
|
|
/* synci_loop : */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_SYNCI(0, 9), /* synci 0($9) */
|
|
|
|
MIPS32_SLTU(8, 10, 9), /* sltu $8, $10, $9 # $8 = $10 < $9 ? 1 : 0 */
|
|
|
|
MIPS32_BNE(8, 0, NEG16(3)), /* bne $8, $0, synci_loop */
|
2011-07-07 10:59:13 -05:00
|
|
|
MIPS32_ADDU(9, 9, 11), /* $9 += MIPS32_SYNCI_STEP */
|
|
|
|
MIPS32_SYNC,
|
|
|
|
/* end: */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_LW(11, 0, 15), /* lw $11,($15) */
|
|
|
|
MIPS32_LW(10, 0, 15), /* lw $10,($15) */
|
|
|
|
MIPS32_LW(9, 0, 15), /* lw $9,($15) */
|
|
|
|
MIPS32_LW(8, 0, 15), /* lw $8,($15) */
|
2011-07-07 10:59:13 -05:00
|
|
|
MIPS32_B(NEG16(24)), /* b start */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_MFC0(15, 31, 0), /* move COP0 DeSave to $15 */
|
2011-07-07 10:59:13 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
/* TODO remove array */
|
|
|
|
uint32_t *param_in = malloc(2 * sizeof(uint32_t));
|
|
|
|
int retval;
|
|
|
|
param_in[0] = start_addr;
|
|
|
|
param_in[1] = end_addr;
|
|
|
|
|
|
|
|
retval = mips32_pracc_exec(ejtag_info, ARRAY_SIZE(code), code, 2, param_in, 0, NULL, 1);
|
|
|
|
|
|
|
|
free(param_in);
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \b mips32_pracc_clean_invalidate_cache
|
|
|
|
*
|
|
|
|
* Writeback D$ and Invalidate I$
|
|
|
|
* so that the instructions written can be visible to CPU
|
|
|
|
*/
|
|
|
|
static int mips32_pracc_clean_invalidate_cache(struct mips_ejtag *ejtag_info,
|
|
|
|
uint32_t start_addr, uint32_t end_addr)
|
|
|
|
{
|
|
|
|
static const uint32_t code[] = {
|
|
|
|
/* start: */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_MTC0(15, 31, 0), /* move $15 to COP0 DeSave */
|
|
|
|
MIPS32_LUI(15, UPPER16(MIPS32_PRACC_STACK)), /* $15 = MIPS32_PRACC_STACK */
|
|
|
|
MIPS32_ORI(15, 15, LOWER16(MIPS32_PRACC_STACK)),
|
|
|
|
MIPS32_SW(8, 0, 15), /* sw $8,($15) */
|
|
|
|
MIPS32_SW(9, 0, 15), /* sw $9,($15) */
|
|
|
|
MIPS32_SW(10, 0, 15), /* sw $10,($15) */
|
|
|
|
MIPS32_SW(11, 0, 15), /* sw $11,($15) */
|
|
|
|
|
|
|
|
MIPS32_LUI(8, UPPER16(MIPS32_PRACC_PARAM_IN)), /* $8 = MIPS32_PRACC_PARAM_IN */
|
|
|
|
MIPS32_ORI(8, 8, LOWER16(MIPS32_PRACC_PARAM_IN)),
|
|
|
|
MIPS32_LW(9, 0, 8), /* Load write start_addr to $9 */
|
|
|
|
MIPS32_LW(10, 4, 8), /* Load write end_addr to $10 */
|
|
|
|
MIPS32_LW(11, 8, 8), /* Load write clsiz to $11 */
|
2011-07-07 10:59:13 -05:00
|
|
|
|
|
|
|
/* cache_loop: */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_SLTU(8, 10, 9), /* sltu $8, $10, $9 : $8 <- $10 < $9 ? */
|
|
|
|
MIPS32_BGTZ(8, 6), /* bgtz $8, end */
|
2011-07-07 10:59:13 -05:00
|
|
|
MIPS32_NOP,
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_CACHE(MIPS32_CACHE_D_HIT_WRITEBACK, 0, 9), /* cache Hit_Writeback_D, 0($9) */
|
|
|
|
MIPS32_CACHE(MIPS32_CACHE_I_HIT_INVALIDATE, 0, 9), /* cache Hit_Invalidate_I, 0($9) */
|
2011-07-07 10:59:13 -05:00
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_ADDU(9, 9, 11), /* $9 += $11 */
|
2011-07-07 10:59:13 -05:00
|
|
|
|
|
|
|
MIPS32_B(NEG16(7)), /* b cache_loop */
|
|
|
|
MIPS32_NOP,
|
|
|
|
/* end: */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_LW(11, 0, 15), /* lw $11,($15) */
|
|
|
|
MIPS32_LW(10, 0, 15), /* lw $10,($15) */
|
|
|
|
MIPS32_LW(9, 0, 15), /* lw $9,($15) */
|
|
|
|
MIPS32_LW(8, 0, 15), /* lw $8,($15) */
|
2011-07-07 10:59:13 -05:00
|
|
|
MIPS32_B(NEG16(25)), /* b start */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_MFC0(15, 31, 0), /* move COP0 DeSave to $15 */
|
2011-07-07 10:59:13 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Find cache line size in bytes
|
|
|
|
*/
|
|
|
|
uint32_t conf;
|
|
|
|
uint32_t dl, clsiz;
|
|
|
|
|
|
|
|
mips32_cp0_read(ejtag_info, &conf, 16, 1);
|
|
|
|
dl = (conf & MIPS32_CONFIG1_DL_MASK) >> MIPS32_CONFIG1_DL_SHIFT;
|
|
|
|
|
|
|
|
/* dl encoding : dl=1 => 4 bytes, dl=2 => 8 bytes, etc... */
|
|
|
|
clsiz = 0x2 << dl;
|
|
|
|
|
|
|
|
/* TODO remove array */
|
|
|
|
uint32_t *param_in = malloc(3 * sizeof(uint32_t));
|
|
|
|
int retval;
|
|
|
|
param_in[0] = start_addr;
|
|
|
|
param_in[1] = end_addr;
|
|
|
|
param_in[2] = clsiz;
|
|
|
|
|
|
|
|
retval = mips32_pracc_exec(ejtag_info, ARRAY_SIZE(code), code, 3, param_in, 0, NULL, 1);
|
|
|
|
|
|
|
|
free(param_in);
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
2012-11-02 10:08:31 -05:00
|
|
|
static int mips32_pracc_write_mem_generic(struct mips_ejtag *ejtag_info, uint32_t addr, int size, int count, void *buf)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2012-11-02 10:08:31 -05:00
|
|
|
uint32_t *code;
|
|
|
|
code = malloc((128 * 3 + 9) * sizeof(uint32_t)); /* alloc memory for the worst case */
|
|
|
|
if (code == NULL) {
|
|
|
|
LOG_ERROR("Out of memory");
|
|
|
|
return ERROR_FAIL;
|
|
|
|
}
|
2011-07-07 10:59:13 -05:00
|
|
|
|
2012-11-02 10:08:31 -05:00
|
|
|
uint32_t *buf32 = buf;
|
|
|
|
uint16_t *buf16 = buf;
|
|
|
|
uint8_t *buf8 = buf;
|
|
|
|
|
|
|
|
int i;
|
|
|
|
int retval = ERROR_FAIL;
|
|
|
|
uint32_t *code_p;
|
|
|
|
uint32_t upper_base_addr, last_upper_base_addr;
|
|
|
|
int this_round_count;
|
|
|
|
int code_len;
|
|
|
|
|
|
|
|
while (count) {
|
|
|
|
this_round_count = (count > 128) ? 128 : count;
|
|
|
|
last_upper_base_addr = UPPER16((addr + 0x8000));
|
|
|
|
code_p = code;
|
|
|
|
|
|
|
|
*code_p++ = MIPS32_MTC0(15, 31, 0); /* save $15 in DeSave */
|
2013-02-24 10:05:28 -06:00
|
|
|
*code_p++ = MIPS32_LUI(15, last_upper_base_addr); /* load $15 with memory base address */
|
|
|
|
code_len = 2;
|
2012-11-02 10:08:31 -05:00
|
|
|
|
|
|
|
for (i = 0; i != this_round_count; i++) {
|
|
|
|
upper_base_addr = UPPER16((addr + 0x8000));
|
|
|
|
if (last_upper_base_addr != upper_base_addr) {
|
|
|
|
*code_p++ = MIPS32_LUI(15, upper_base_addr); /* if needed, change upper address in $15*/
|
|
|
|
code_len++;
|
|
|
|
last_upper_base_addr = upper_base_addr;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (size == 4) { /* for word write check if one half word is 0 and load it accordingly */
|
|
|
|
if (LOWER16(*buf32) == 0) {
|
|
|
|
*code_p++ = MIPS32_LUI(8, UPPER16(*buf32)); /* load only upper value */
|
|
|
|
code_len++;
|
|
|
|
} else if (UPPER16(*buf32) == 0) {
|
|
|
|
*code_p++ = MIPS32_ORI(8, 0, LOWER16(*buf32)); /* load only lower value */
|
|
|
|
code_len++;
|
|
|
|
} else {
|
|
|
|
*code_p++ = MIPS32_LUI(8, UPPER16(*buf32)); /* load upper and lower */
|
|
|
|
*code_p++ = MIPS32_ORI(8, 8, LOWER16(*buf32));
|
|
|
|
code_len += 2;
|
|
|
|
}
|
|
|
|
*code_p++ = MIPS32_SW(8, LOWER16(addr), 15); /* store word to memory */
|
|
|
|
code_len++;
|
|
|
|
buf32++;
|
|
|
|
|
|
|
|
} else if (size == 2) {
|
|
|
|
*code_p++ = MIPS32_ORI(8, 0, *buf16); /* load lower value */
|
|
|
|
*code_p++ = MIPS32_SH(8, LOWER16(addr), 15); /* store half word to memory */
|
|
|
|
code_len += 2;
|
|
|
|
buf16++;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
*code_p++ = MIPS32_ORI(8, 0, *buf8); /* load lower value */
|
|
|
|
*code_p++ = MIPS32_SB(8, LOWER16(addr), 15); /* store byte to memory */
|
|
|
|
code_len += 2;
|
|
|
|
buf8++;
|
|
|
|
}
|
|
|
|
|
|
|
|
addr += size;
|
|
|
|
}
|
|
|
|
|
2013-02-24 10:05:28 -06:00
|
|
|
*code_p++ = MIPS32_LUI(8, UPPER16(ejtag_info->reg8)), /* restore upper 16 bits of reg 8 */
|
|
|
|
*code_p++ = MIPS32_ORI(8, 8, LOWER16(ejtag_info->reg8)), /* restore lower 16 bits of reg 8 */
|
2012-11-02 10:08:31 -05:00
|
|
|
|
|
|
|
code_len += 4;
|
|
|
|
*code_p++ = MIPS32_B(NEG16(code_len - 1)); /* jump to start */
|
|
|
|
*code_p = MIPS32_MFC0(15, 31, 0); /* restore $15 from DeSave */
|
|
|
|
|
|
|
|
retval = mips32_pracc_exec(ejtag_info, code_len, code, 0, NULL, 0, NULL, 1);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
goto exit;
|
|
|
|
|
|
|
|
count -= this_round_count;
|
2008-07-26 05:32:11 -05:00
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-11-02 10:08:31 -05:00
|
|
|
exit:
|
|
|
|
free(code);
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
int mips32_pracc_write_mem(struct mips_ejtag *ejtag_info, uint32_t addr, int size, int count, void *buf)
|
|
|
|
{
|
|
|
|
int retval = mips32_pracc_write_mem_generic(ejtag_info, addr, size, count, buf);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
|
|
|
|
2011-07-07 10:59:13 -05:00
|
|
|
/**
|
|
|
|
* If we are in the cachable regoion and cache is activated,
|
|
|
|
* we must clean D$ + invalidate I$ after we did the write,
|
|
|
|
* so that changes do not continue to live only in D$, but to be
|
|
|
|
* replicated in I$ also (maybe we wrote the istructions)
|
|
|
|
*/
|
|
|
|
uint32_t conf = 0;
|
|
|
|
int cached = 0;
|
|
|
|
|
2012-05-09 10:21:19 -05:00
|
|
|
if ((KSEGX(addr) == KSEG1) || ((addr >= 0xff200000) && (addr <= 0xff3fffff)))
|
|
|
|
return retval; /*Nothing to do*/
|
|
|
|
|
2011-07-07 10:59:13 -05:00
|
|
|
mips32_cp0_read(ejtag_info, &conf, 16, 0);
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
switch (KSEGX(addr)) {
|
2011-07-07 10:59:13 -05:00
|
|
|
case KUSEG:
|
|
|
|
cached = (conf & MIPS32_CONFIG0_KU_MASK) >> MIPS32_CONFIG0_KU_SHIFT;
|
|
|
|
break;
|
2012-02-05 06:03:04 -06:00
|
|
|
case KSEG0:
|
2011-07-07 10:59:13 -05:00
|
|
|
cached = (conf & MIPS32_CONFIG0_K0_MASK) >> MIPS32_CONFIG0_K0_SHIFT;
|
|
|
|
break;
|
|
|
|
case KSEG2:
|
|
|
|
case KSEG3:
|
|
|
|
cached = (conf & MIPS32_CONFIG0_K23_MASK) >> MIPS32_CONFIG0_K23_SHIFT;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/* what ? */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Check cachablitiy bits coherency algorithm -
|
|
|
|
* is the region cacheable or uncached.
|
|
|
|
* If cacheable we have to synchronize the cache
|
|
|
|
*/
|
2012-02-05 06:03:04 -06:00
|
|
|
if (cached == 0x3) {
|
2011-07-07 10:59:13 -05:00
|
|
|
uint32_t start_addr, end_addr;
|
|
|
|
uint32_t rel;
|
|
|
|
|
|
|
|
start_addr = addr;
|
|
|
|
end_addr = addr + count * size;
|
|
|
|
|
|
|
|
/** select cache synchronisation mechanism based on Architecture Release */
|
|
|
|
rel = (conf & MIPS32_CONFIG0_AR_MASK) >> MIPS32_CONFIG0_AR_SHIFT;
|
2012-02-05 06:03:04 -06:00
|
|
|
switch (rel) {
|
|
|
|
case MIPS32_ARCH_REL1:
|
2011-07-07 10:59:13 -05:00
|
|
|
/* MIPS32/64 Release 1 - we must use cache instruction */
|
|
|
|
mips32_pracc_clean_invalidate_cache(ejtag_info, start_addr, end_addr);
|
|
|
|
break;
|
2012-02-05 06:03:04 -06:00
|
|
|
case MIPS32_ARCH_REL2:
|
2011-07-07 10:59:13 -05:00
|
|
|
/* MIPS32/64 Release 2 - we can use synci instruction */
|
|
|
|
mips32_pracc_sync_cache(ejtag_info, start_addr, end_addr);
|
|
|
|
break;
|
2012-02-05 06:03:04 -06:00
|
|
|
default:
|
2011-07-07 10:59:13 -05:00
|
|
|
/* what ? */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return retval;
|
2008-07-26 05:32:11 -05:00
|
|
|
}
|
|
|
|
|
2009-11-13 10:43:36 -06:00
|
|
|
int mips32_pracc_write_regs(struct mips_ejtag *ejtag_info, uint32_t *regs)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2012-11-03 05:29:46 -05:00
|
|
|
static const uint32_t cp0_write_code[] = {
|
|
|
|
MIPS32_MTC0(1, 12, 0), /* move $1 to status */
|
|
|
|
MIPS32_MTLO(1), /* move $1 to lo */
|
|
|
|
MIPS32_MTHI(1), /* move $1 to hi */
|
|
|
|
MIPS32_MTC0(1, 8, 0), /* move $1 to badvaddr */
|
|
|
|
MIPS32_MTC0(1, 13, 0), /* move $1 to cause*/
|
|
|
|
MIPS32_MTC0(1, 24, 0), /* move $1 to depc (pc) */
|
2008-07-26 05:32:11 -05:00
|
|
|
};
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-11-03 05:29:46 -05:00
|
|
|
uint32_t *code;
|
|
|
|
code = malloc((37 * 2 + 6 + 1) * sizeof(uint32_t)); /* alloc memory for the worst case */
|
|
|
|
if (code == NULL) {
|
|
|
|
LOG_ERROR("Out of memory");
|
|
|
|
return ERROR_FAIL;
|
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-11-03 05:29:46 -05:00
|
|
|
uint32_t *code_p = code;
|
|
|
|
int code_len = 0;
|
|
|
|
/* load registers 2 to 31 with lui an ori instructions, check if same instructions can be saved */
|
|
|
|
for (int i = 2; i < 32; i++) {
|
|
|
|
if (LOWER16((regs[i])) == 0) {
|
|
|
|
*code_p++ = MIPS32_LUI(i, UPPER16((regs[i]))); /* if lower half word is 0, lui instruction only */
|
|
|
|
code_len++;
|
|
|
|
} else if (UPPER16((regs[i])) == 0) {
|
|
|
|
*code_p++ = MIPS32_ORI(i, 0, LOWER16((regs[i]))); /* if upper half word is 0, ori with $0 only*/
|
|
|
|
code_len++;
|
|
|
|
} else {
|
|
|
|
*code_p++ = MIPS32_LUI(i, UPPER16((regs[i]))); /* default, load with lui and ori instructions */
|
|
|
|
*code_p++ = MIPS32_ORI(i, i, LOWER16((regs[i])));
|
|
|
|
code_len += 2;
|
|
|
|
}
|
|
|
|
}
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2012-11-03 05:29:46 -05:00
|
|
|
for (int i = 0; i != 6; i++) {
|
|
|
|
*code_p++ = MIPS32_LUI(1, UPPER16((regs[i + 32]))); /* load CPO value in $1, with lui and ori */
|
|
|
|
*code_p++ = MIPS32_ORI(1, 1, LOWER16((regs[i + 32])));
|
|
|
|
*code_p++ = cp0_write_code[i]; /* write value from $1 to CPO register */
|
|
|
|
code_len += 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
*code_p++ = MIPS32_LUI(1, UPPER16((regs[1]))); /* load upper half word in $1 */
|
|
|
|
code_len += 3;
|
|
|
|
*code_p++ = MIPS32_B(NEG16(code_len - 1)), /* b start */
|
|
|
|
*code_p = MIPS32_ORI(1, 1, LOWER16((regs[1]))); /* load lower half word in $1 */
|
|
|
|
|
|
|
|
int retval = mips32_pracc_exec(ejtag_info, code_len, code, 0, NULL, 0, NULL, 1);
|
|
|
|
free(code);
|
2013-02-24 10:05:28 -06:00
|
|
|
|
|
|
|
ejtag_info->reg8 = regs[8];
|
|
|
|
ejtag_info->reg9 = regs[9];
|
2008-07-26 05:32:11 -05:00
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
2009-11-13 10:43:36 -06:00
|
|
|
int mips32_pracc_read_regs(struct mips_ejtag *ejtag_info, uint32_t *regs)
|
2008-07-26 05:32:11 -05:00
|
|
|
{
|
2012-11-03 06:39:27 -05:00
|
|
|
static int cp0_read_code[] = {
|
2013-03-03 13:11:38 -06:00
|
|
|
MIPS32_MFC0(8, 12, 0), /* move status to $8 */
|
|
|
|
MIPS32_MFLO(8), /* move lo to $8 */
|
|
|
|
MIPS32_MFHI(8), /* move hi to $8 */
|
|
|
|
MIPS32_MFC0(8, 8, 0), /* move badvaddr to $8 */
|
|
|
|
MIPS32_MFC0(8, 13, 0), /* move cause to $8 */
|
|
|
|
MIPS32_MFC0(8, 24, 0), /* move depc (pc) to $8 */
|
2008-07-26 05:32:11 -05:00
|
|
|
};
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
struct pracc_queue_info ctx = {.max_code = 48};
|
|
|
|
pracc_queue_init(&ctx);
|
|
|
|
if (ctx.retval != ERROR_OK)
|
|
|
|
goto exit;
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_MTC0(1, 31, 0)); /* move $1 to COP0 DeSave */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_LUI(1, PRACC_UPPER_BASE_ADDR)); /* $1 = MIP32_PRACC_BASE_ADDR */
|
2009-06-23 17:49:23 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
for (int i = 2; i != 32; i++) /* store GPR's 2 to 31 */
|
|
|
|
pracc_add(&ctx, MIPS32_PRACC_PARAM_OUT + (i * 4),
|
|
|
|
MIPS32_SW(i, PRACC_OUT_OFFSET + (i * 4), 1));
|
2012-11-03 06:39:27 -05:00
|
|
|
|
|
|
|
for (int i = 0; i != 6; i++) {
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, cp0_read_code[i]); /* load COP0 needed registers to $8 */
|
|
|
|
pracc_add(&ctx, MIPS32_PRACC_PARAM_OUT + (i + 32) * 4, /* store $8 at PARAM OUT */
|
|
|
|
MIPS32_SW(8, PRACC_OUT_OFFSET + (i + 32) * 4, 1));
|
2012-11-03 06:39:27 -05:00
|
|
|
}
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_MFC0(8, 31, 0)); /* move DeSave to $8, reg1 value */
|
|
|
|
pracc_add(&ctx, MIPS32_PRACC_PARAM_OUT + 4, /* store reg1 value from $8 to param out */
|
|
|
|
MIPS32_SW(8, PRACC_OUT_OFFSET + 4, 1));
|
2012-11-03 06:39:27 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
pracc_add(&ctx, 0, MIPS32_B(NEG16(ctx.code_count + 1))); /* jump to start */
|
|
|
|
pracc_add(&ctx, 0, MIPS32_MFC0(1, 31, 0)); /* move COP0 DeSave to $1, restore reg1 */
|
2012-11-03 06:39:27 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
if (ejtag_info->mode == 0)
|
|
|
|
ctx.store_count++; /* Needed by legacy code, due to offset from reg0 */
|
2012-11-03 06:39:27 -05:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
ctx.retval = mips32_pracc_queue_exec(ejtag_info, &ctx, regs);
|
2013-02-24 10:05:28 -06:00
|
|
|
|
2013-03-03 13:11:38 -06:00
|
|
|
ejtag_info->reg8 = regs[8]; /* reg8 is saved but not restored, next called function should restore it */
|
2013-02-24 10:05:28 -06:00
|
|
|
ejtag_info->reg9 = regs[9];
|
2013-03-03 13:11:38 -06:00
|
|
|
exit:
|
|
|
|
pracc_queue_free(&ctx);
|
|
|
|
return ctx.retval;
|
2008-07-26 05:32:11 -05:00
|
|
|
}
|
2009-12-16 05:23:52 -06:00
|
|
|
|
|
|
|
/* fastdata upload/download requires an initialized working area
|
|
|
|
* to load the download code; it should not be called otherwise
|
|
|
|
* fetch order from the fastdata area
|
|
|
|
* 1. start addr
|
|
|
|
* 2. end addr
|
|
|
|
* 3. data ...
|
|
|
|
*/
|
|
|
|
int mips32_pracc_fastdata_xfer(struct mips_ejtag *ejtag_info, struct working_area *source,
|
2012-02-05 06:03:04 -06:00
|
|
|
int write_t, uint32_t addr, int count, uint32_t *buf)
|
2009-12-16 05:23:52 -06:00
|
|
|
{
|
|
|
|
uint32_t handler_code[] = {
|
|
|
|
/* caution when editing, table is modified below */
|
|
|
|
/* r15 points to the start of this code */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_SW(8, MIPS32_FASTDATA_HANDLER_SIZE - 4, 15),
|
|
|
|
MIPS32_SW(9, MIPS32_FASTDATA_HANDLER_SIZE - 8, 15),
|
|
|
|
MIPS32_SW(10, MIPS32_FASTDATA_HANDLER_SIZE - 12, 15),
|
|
|
|
MIPS32_SW(11, MIPS32_FASTDATA_HANDLER_SIZE - 16, 15),
|
2009-12-16 05:23:52 -06:00
|
|
|
/* start of fastdata area in t0 */
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_LUI(8, UPPER16(MIPS32_PRACC_FASTDATA_AREA)),
|
|
|
|
MIPS32_ORI(8, 8, LOWER16(MIPS32_PRACC_FASTDATA_AREA)),
|
|
|
|
MIPS32_LW(9, 0, 8), /* start addr in t1 */
|
|
|
|
MIPS32_LW(10, 0, 8), /* end addr to t2 */
|
2009-12-16 05:23:52 -06:00
|
|
|
/* loop: */
|
2012-02-05 06:03:04 -06:00
|
|
|
/* 8 */ MIPS32_LW(11, 0, 0), /* lw t3,[t8 | r9] */
|
|
|
|
/* 9 */ MIPS32_SW(11, 0, 0), /* sw t3,[r9 | r8] */
|
|
|
|
MIPS32_BNE(10, 9, NEG16(3)), /* bne $t2,t1,loop */
|
|
|
|
MIPS32_ADDI(9, 9, 4), /* addi t1,t1,4 */
|
|
|
|
|
|
|
|
MIPS32_LW(8, MIPS32_FASTDATA_HANDLER_SIZE - 4, 15),
|
|
|
|
MIPS32_LW(9, MIPS32_FASTDATA_HANDLER_SIZE - 8, 15),
|
|
|
|
MIPS32_LW(10, MIPS32_FASTDATA_HANDLER_SIZE - 12, 15),
|
|
|
|
MIPS32_LW(11, MIPS32_FASTDATA_HANDLER_SIZE - 16, 15),
|
|
|
|
|
|
|
|
MIPS32_LUI(15, UPPER16(MIPS32_PRACC_TEXT)),
|
|
|
|
MIPS32_ORI(15, 15, LOWER16(MIPS32_PRACC_TEXT)),
|
|
|
|
MIPS32_JR(15), /* jr start */
|
|
|
|
MIPS32_MFC0(15, 31, 0), /* move COP0 DeSave to $15 */
|
2009-12-16 05:23:52 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
uint32_t jmp_code[] = {
|
2012-02-05 06:03:04 -06:00
|
|
|
MIPS32_MTC0(15, 31, 0), /* move $15 to COP0 DeSave */
|
|
|
|
/* 1 */ MIPS32_LUI(15, 0), /* addr of working area added below */
|
|
|
|
/* 2 */ MIPS32_ORI(15, 15, 0), /* addr of working area added below */
|
2009-12-16 05:23:52 -06:00
|
|
|
MIPS32_JR(15), /* jump to ram program */
|
|
|
|
MIPS32_NOP,
|
|
|
|
};
|
|
|
|
|
|
|
|
int retval, i;
|
|
|
|
uint32_t val, ejtag_ctrl, address;
|
|
|
|
|
|
|
|
if (source->size < MIPS32_FASTDATA_HANDLER_SIZE)
|
|
|
|
return ERROR_TARGET_RESOURCE_NOT_AVAILABLE;
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
if (write_t) {
|
|
|
|
handler_code[8] = MIPS32_LW(11, 0, 8); /* load data from probe at fastdata area */
|
|
|
|
handler_code[9] = MIPS32_SW(11, 0, 9); /* store data to RAM @ r9 */
|
|
|
|
} else {
|
|
|
|
handler_code[8] = MIPS32_LW(11, 0, 9); /* load data from RAM @ r9 */
|
|
|
|
handler_code[9] = MIPS32_SW(11, 0, 8); /* store data to probe at fastdata area */
|
2009-12-16 05:23:52 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
/* write program into RAM */
|
2012-02-05 06:03:04 -06:00
|
|
|
if (write_t != ejtag_info->fast_access_save) {
|
2012-11-02 10:08:31 -05:00
|
|
|
mips32_pracc_write_mem_generic(ejtag_info, source->address, 4, ARRAY_SIZE(handler_code), handler_code);
|
2011-01-04 06:29:49 -06:00
|
|
|
/* save previous operation to speed to any consecutive read/writes */
|
|
|
|
ejtag_info->fast_access_save = write_t;
|
|
|
|
}
|
2009-12-16 05:23:52 -06:00
|
|
|
|
2010-03-08 16:54:18 -06:00
|
|
|
LOG_DEBUG("%s using 0x%.8" PRIx32 " for write handler", __func__, source->address);
|
2009-12-16 05:23:52 -06:00
|
|
|
|
|
|
|
jmp_code[1] |= UPPER16(source->address);
|
|
|
|
jmp_code[2] |= LOWER16(source->address);
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
for (i = 0; i < (int) ARRAY_SIZE(jmp_code); i++) {
|
|
|
|
retval = wait_for_pracc_rw(ejtag_info, &ejtag_ctrl);
|
|
|
|
if (retval != ERROR_OK)
|
2009-12-16 05:23:52 -06:00
|
|
|
return retval;
|
|
|
|
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_DATA);
|
2011-04-04 08:33:04 -05:00
|
|
|
mips_ejtag_drscan_32_out(ejtag_info, jmp_code[i]);
|
2009-12-16 05:23:52 -06:00
|
|
|
|
|
|
|
/* Clear the access pending bit (let the processor eat!) */
|
|
|
|
ejtag_ctrl = ejtag_info->ejtag_ctrl & ~EJTAG_CTRL_PRACC;
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_CONTROL);
|
2011-04-04 08:33:04 -05:00
|
|
|
mips_ejtag_drscan_32_out(ejtag_info, ejtag_ctrl);
|
2009-12-16 05:23:52 -06:00
|
|
|
}
|
|
|
|
|
2013-02-23 15:53:35 -06:00
|
|
|
/* wait PrAcc pending bit for FASTDATA write */
|
2012-02-05 06:03:04 -06:00
|
|
|
retval = wait_for_pracc_rw(ejtag_info, &ejtag_ctrl);
|
|
|
|
if (retval != ERROR_OK)
|
2009-12-16 05:23:52 -06:00
|
|
|
return retval;
|
|
|
|
|
|
|
|
/* next fetch to dmseg should be in FASTDATA_AREA, check */
|
|
|
|
address = 0;
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_ADDRESS);
|
2011-04-04 08:24:59 -05:00
|
|
|
retval = mips_ejtag_drscan_32(ejtag_info, &address);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
2009-12-16 05:23:52 -06:00
|
|
|
|
|
|
|
if (address != MIPS32_PRACC_FASTDATA_AREA)
|
|
|
|
return ERROR_FAIL;
|
|
|
|
|
|
|
|
/* Send the load start address */
|
|
|
|
val = addr;
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_FASTDATA);
|
2009-12-16 05:23:52 -06:00
|
|
|
mips_ejtag_fastdata_scan(ejtag_info, 1, &val);
|
|
|
|
|
2013-02-23 15:53:35 -06:00
|
|
|
retval = wait_for_pracc_rw(ejtag_info, &ejtag_ctrl);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
|
|
|
|
2009-12-16 05:23:52 -06:00
|
|
|
/* Send the load end address */
|
|
|
|
val = addr + (count - 1) * 4;
|
2013-02-23 15:53:35 -06:00
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_FASTDATA);
|
2009-12-16 05:23:52 -06:00
|
|
|
mips_ejtag_fastdata_scan(ejtag_info, 1, &val);
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
for (i = 0; i < count; i++) {
|
|
|
|
retval = mips_ejtag_fastdata_scan(ejtag_info, write_t, buf++);
|
|
|
|
if (retval != ERROR_OK)
|
2009-12-16 05:23:52 -06:00
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
retval = jtag_execute_queue();
|
|
|
|
if (retval != ERROR_OK) {
|
2009-12-16 05:23:52 -06:00
|
|
|
LOG_ERROR("fastdata load failed");
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
2012-02-05 06:03:04 -06:00
|
|
|
retval = wait_for_pracc_rw(ejtag_info, &ejtag_ctrl);
|
|
|
|
if (retval != ERROR_OK)
|
2009-12-16 05:23:52 -06:00
|
|
|
return retval;
|
|
|
|
|
|
|
|
address = 0;
|
2010-03-17 12:24:22 -05:00
|
|
|
mips_ejtag_set_instr(ejtag_info, EJTAG_INST_ADDRESS);
|
2011-04-04 08:24:59 -05:00
|
|
|
retval = mips_ejtag_drscan_32(ejtag_info, &address);
|
|
|
|
if (retval != ERROR_OK)
|
|
|
|
return retval;
|
2009-12-16 05:23:52 -06:00
|
|
|
|
|
|
|
if (address != MIPS32_PRACC_TEXT)
|
2010-03-08 16:54:18 -06:00
|
|
|
LOG_ERROR("mini program did not return to start");
|
2009-12-16 05:23:52 -06:00
|
|
|
|
|
|
|
return retval;
|
|
|
|
}
|