d2397817f1
We've got a handy dandy macro already for calculating the number of elements in an array, so use it. Signed-off-by: Mike Frysinger <vapier@gentoo.org>
173 lines
3.5 KiB
C
173 lines
3.5 KiB
C
/*
|
|
* (C) Copyright 2002
|
|
* Wolfgang Denk, DENX Software Engineering, wd@denx.de.
|
|
*
|
|
* See file CREDITS for list of people who contributed to this
|
|
* project.
|
|
*
|
|
* 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
|
|
*/
|
|
|
|
#include <common.h>
|
|
|
|
/*
|
|
* CPU test
|
|
* Binary instructions instr rD,rA
|
|
*
|
|
* Logic instructions: neg
|
|
* Arithmetic instructions: addme, addze, subfme, subfze
|
|
|
|
* The test contains a pre-built table of instructions, operands and
|
|
* expected results. For each table entry, the test will cyclically use
|
|
* different sets of operand registers and result registers.
|
|
*/
|
|
|
|
#include <post.h>
|
|
#include "cpu_asm.h"
|
|
|
|
#if CONFIG_POST & CONFIG_SYS_POST_CPU
|
|
|
|
extern void cpu_post_exec_21 (ulong *code, ulong *cr, ulong *res, ulong op1);
|
|
extern ulong cpu_post_makecr (long v);
|
|
|
|
static struct cpu_post_two_s
|
|
{
|
|
ulong cmd;
|
|
ulong op;
|
|
ulong res;
|
|
} cpu_post_two_table[] =
|
|
{
|
|
{
|
|
OP_NEG,
|
|
3,
|
|
-3
|
|
},
|
|
{
|
|
OP_NEG,
|
|
5,
|
|
-5
|
|
},
|
|
{
|
|
OP_ADDME,
|
|
6,
|
|
5
|
|
},
|
|
{
|
|
OP_ADDZE,
|
|
5,
|
|
5
|
|
},
|
|
{
|
|
OP_SUBFME,
|
|
6,
|
|
~6 - 1
|
|
},
|
|
{
|
|
OP_SUBFZE,
|
|
5,
|
|
~5
|
|
},
|
|
};
|
|
static unsigned int cpu_post_two_size = ARRAY_SIZE(cpu_post_two_table);
|
|
|
|
int cpu_post_test_two (void)
|
|
{
|
|
int ret = 0;
|
|
unsigned int i, reg;
|
|
int flag = disable_interrupts();
|
|
|
|
for (i = 0; i < cpu_post_two_size && ret == 0; i++)
|
|
{
|
|
struct cpu_post_two_s *test = cpu_post_two_table + i;
|
|
|
|
for (reg = 0; reg < 32 && ret == 0; reg++)
|
|
{
|
|
unsigned int reg0 = (reg + 0) % 32;
|
|
unsigned int reg1 = (reg + 1) % 32;
|
|
unsigned int stk = reg < 16 ? 31 : 15;
|
|
unsigned long code[] =
|
|
{
|
|
ASM_STW(stk, 1, -4),
|
|
ASM_ADDI(stk, 1, -16),
|
|
ASM_STW(3, stk, 8),
|
|
ASM_STW(reg0, stk, 4),
|
|
ASM_STW(reg1, stk, 0),
|
|
ASM_LWZ(reg0, stk, 8),
|
|
ASM_11(test->cmd, reg1, reg0),
|
|
ASM_STW(reg1, stk, 8),
|
|
ASM_LWZ(reg1, stk, 0),
|
|
ASM_LWZ(reg0, stk, 4),
|
|
ASM_LWZ(3, stk, 8),
|
|
ASM_ADDI(1, stk, 16),
|
|
ASM_LWZ(stk, 1, -4),
|
|
ASM_BLR,
|
|
};
|
|
unsigned long codecr[] =
|
|
{
|
|
ASM_STW(stk, 1, -4),
|
|
ASM_ADDI(stk, 1, -16),
|
|
ASM_STW(3, stk, 8),
|
|
ASM_STW(reg0, stk, 4),
|
|
ASM_STW(reg1, stk, 0),
|
|
ASM_LWZ(reg0, stk, 8),
|
|
ASM_11(test->cmd, reg1, reg0) | BIT_C,
|
|
ASM_STW(reg1, stk, 8),
|
|
ASM_LWZ(reg1, stk, 0),
|
|
ASM_LWZ(reg0, stk, 4),
|
|
ASM_LWZ(3, stk, 8),
|
|
ASM_ADDI(1, stk, 16),
|
|
ASM_LWZ(stk, 1, -4),
|
|
ASM_BLR,
|
|
};
|
|
ulong res;
|
|
ulong cr;
|
|
|
|
if (ret == 0)
|
|
{
|
|
cr = 0;
|
|
cpu_post_exec_21 (code, & cr, & res, test->op);
|
|
|
|
ret = res == test->res && cr == 0 ? 0 : -1;
|
|
|
|
if (ret != 0)
|
|
{
|
|
post_log ("Error at two test %d !\n", i);
|
|
}
|
|
}
|
|
|
|
if (ret == 0)
|
|
{
|
|
cpu_post_exec_21 (codecr, & cr, & res, test->op);
|
|
|
|
ret = res == test->res &&
|
|
(cr & 0xe0000000) == cpu_post_makecr (res) ? 0 : -1;
|
|
|
|
if (ret != 0)
|
|
{
|
|
post_log ("Error at two test %d !\n", i);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (flag)
|
|
enable_interrupts();
|
|
|
|
return ret;
|
|
}
|
|
|
|
#endif
|