| 1 |
15 |
csantifort |
/*****************************************************************
|
| 2 |
|
|
// //
|
| 3 |
|
|
// Amber 2 Core Instruction Test //
|
| 4 |
|
|
// //
|
| 5 |
|
|
// This file is part of the Amber project //
|
| 6 |
|
|
// http://www.opencores.org/project,amber //
|
| 7 |
|
|
// //
|
| 8 |
|
|
// Description //
|
| 9 |
|
|
// Generates as dense a stream of writes as possible to check //
|
| 10 |
|
|
// that the memory subsystem can cope with this worst case. //
|
| 11 |
|
|
// //
|
| 12 |
|
|
// Author(s): //
|
| 13 |
|
|
// - Conor Santifort, csantifort.amber@gmail.com //
|
| 14 |
|
|
// //
|
| 15 |
|
|
//////////////////////////////////////////////////////////////////
|
| 16 |
|
|
// //
|
| 17 |
|
|
// Copyright (C) 2010 Authors and OPENCORES.ORG //
|
| 18 |
|
|
// //
|
| 19 |
|
|
// This source file may be used and distributed without //
|
| 20 |
|
|
// restriction provided that this copyright statement is not //
|
| 21 |
|
|
// removed from the file and that any derivative work contains //
|
| 22 |
|
|
// the original copyright notice and the associated disclaimer. //
|
| 23 |
|
|
// //
|
| 24 |
|
|
// This source file is free software; you can redistribute it //
|
| 25 |
|
|
// and/or modify it under the terms of the GNU Lesser General //
|
| 26 |
|
|
// Public License as published by the Free Software Foundation; //
|
| 27 |
|
|
// either version 2.1 of the License, or (at your option) any //
|
| 28 |
|
|
// later version. //
|
| 29 |
|
|
// //
|
| 30 |
|
|
// This source is distributed in the hope that it will be //
|
| 31 |
|
|
// useful, but WITHOUT ANY WARRANTY; without even the implied //
|
| 32 |
|
|
// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR //
|
| 33 |
|
|
// PURPOSE. See the GNU Lesser General Public License for more //
|
| 34 |
|
|
// details. //
|
| 35 |
|
|
// //
|
| 36 |
|
|
// You should have received a copy of the GNU Lesser General //
|
| 37 |
|
|
// Public License along with this source; if not, download it //
|
| 38 |
|
|
// from http://www.opencores.org/lgpl.shtml //
|
| 39 |
|
|
// //
|
| 40 |
|
|
*****************************************************************/
|
| 41 |
|
|
|
| 42 |
|
|
#include "amber_registers.h"
|
| 43 |
|
|
|
| 44 |
|
|
.section .text
|
| 45 |
|
|
.globl main
|
| 46 |
|
|
main:
|
| 47 |
|
|
@ ---------------------
|
| 48 |
|
|
@ Enable the cache
|
| 49 |
|
|
@ ---------------------
|
| 50 |
|
|
@ The instruction space is cached and the data space is not.
|
| 51 |
|
|
@ So when the written data is read back, it comes from
|
| 52 |
|
|
@ main memory and not the dcache.
|
| 53 |
|
|
mov r0, #0x1
|
| 54 |
|
|
mcr 15, 0, r0, cr3, cr0, 0 @ cacheable area
|
| 55 |
|
|
mov r0, #1
|
| 56 |
|
|
mcr 15, 0, r0, cr2, cr0, 0 @ cache enable
|
| 57 |
|
|
|
| 58 |
|
|
mov r14, #3
|
| 59 |
|
|
|
| 60 |
|
|
loop: mov r0, #0x1000000
|
| 61 |
|
|
add r1, r14, #0x1
|
| 62 |
|
|
add r2, r14, #0x2
|
| 63 |
|
|
add r3, r14, #0x3
|
| 64 |
|
|
add r4, r14, #0x4
|
| 65 |
|
|
add r5, r14, #0x5
|
| 66 |
|
|
add r6, r14, #0x6
|
| 67 |
|
|
add r7, r14, #0x7
|
| 68 |
|
|
add r8, r14, #0x8
|
| 69 |
|
|
|
| 70 |
|
|
@ ---------------------
|
| 71 |
|
|
@ write 1024 bytes
|
| 72 |
|
|
stm r0!, {r1-r8}
|
| 73 |
|
|
stm r0!, {r1-r8}
|
| 74 |
|
|
stm r0!, {r1-r8}
|
| 75 |
|
|
stm r0!, {r1-r8}
|
| 76 |
|
|
stm r0!, {r1-r8}
|
| 77 |
|
|
stm r0!, {r1-r8}
|
| 78 |
|
|
stm r0!, {r1-r8}
|
| 79 |
|
|
stm r0!, {r1-r8}
|
| 80 |
|
|
stm r0!, {r1-r8}
|
| 81 |
|
|
stm r0!, {r1-r8}
|
| 82 |
|
|
stm r0!, {r1-r8}
|
| 83 |
|
|
stm r0!, {r1-r8}
|
| 84 |
|
|
stm r0!, {r1-r8}
|
| 85 |
|
|
stm r0!, {r1-r8}
|
| 86 |
|
|
stm r0!, {r1-r8}
|
| 87 |
|
|
stm r0!, {r1-r8}
|
| 88 |
|
|
stm r0!, {r1-r8}
|
| 89 |
|
|
stm r0!, {r1-r8}
|
| 90 |
|
|
stm r0!, {r1-r8}
|
| 91 |
|
|
stm r0!, {r1-r8}
|
| 92 |
|
|
stm r0!, {r1-r8}
|
| 93 |
|
|
stm r0!, {r1-r8}
|
| 94 |
|
|
stm r0!, {r1-r8}
|
| 95 |
|
|
stm r0!, {r1-r8}
|
| 96 |
|
|
stm r0!, {r1-r8}
|
| 97 |
|
|
stm r0!, {r1-r8}
|
| 98 |
|
|
stm r0!, {r1-r8}
|
| 99 |
|
|
stm r0!, {r1-r8}
|
| 100 |
|
|
stm r0!, {r1-r8}
|
| 101 |
|
|
stm r0!, {r1-r8}
|
| 102 |
|
|
stm r0!, {r1-r8}
|
| 103 |
|
|
stm r0!, {r1-r8}
|
| 104 |
|
|
|
| 105 |
|
|
@ Read back and check
|
| 106 |
|
|
mov r0, #0x1000000
|
| 107 |
|
|
mov r13, #320
|
| 108 |
|
|
1: mov r9, r14
|
| 109 |
|
|
2: add r9, r9, #1
|
| 110 |
|
|
ldr r12, [r0], #4
|
| 111 |
|
|
cmp r12, r9
|
| 112 |
|
|
addne r10, r9, r13
|
| 113 |
|
|
bne testfail
|
| 114 |
|
|
add r10, r14, #8
|
| 115 |
|
|
cmp r9, r10
|
| 116 |
|
|
bne 2b
|
| 117 |
|
|
|
| 118 |
|
|
subs r13, r13, #10
|
| 119 |
|
|
bne 1b
|
| 120 |
|
|
|
| 121 |
|
|
subs r14, r14, #1
|
| 122 |
|
|
bne loop
|
| 123 |
|
|
|
| 124 |
|
|
b testpass
|
| 125 |
|
|
|
| 126 |
|
|
testfail:
|
| 127 |
|
|
ldr r11, AdrTestStatus
|
| 128 |
|
|
str r10, [r11]
|
| 129 |
|
|
b testfail
|
| 130 |
|
|
|
| 131 |
|
|
testpass:
|
| 132 |
|
|
ldr r11, AdrTestStatus
|
| 133 |
|
|
mov r10, #17
|
| 134 |
|
|
str r10, [r11]
|
| 135 |
|
|
b testpass
|
| 136 |
|
|
|
| 137 |
|
|
|
| 138 |
|
|
/* Write 17 to this address to generate a Test Passed message */
|
| 139 |
|
|
AdrTestStatus: .word ADR_AMBER_TEST_STATUS
|
| 140 |
|
|
Data1: .word Data2
|
| 141 |
|
|
Data2: .word 0xff
|
| 142 |
|
|
|
| 143 |
|
|
/* ========================================================================= */
|
| 144 |
|
|
/* ========================================================================= */
|
| 145 |
|
|
|
