313 lines
6.9 KiB
C
313 lines
6.9 KiB
C
/* $NetBSD: startprog.c,v 1.3 1999/09/23 08:30:59 takemura Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 1999 Shin Takemura.
|
|
* All rights reserved.
|
|
*
|
|
* This software is part of the PocketBSD.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the PocketBSD project
|
|
* and its contributors.
|
|
* 4. Neither the name of the project nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
*/
|
|
#include <pbsdboot.h>
|
|
|
|
extern void asm_code();
|
|
extern void asm_code_end();
|
|
|
|
#if 0
|
|
static void clear_screen()
|
|
{
|
|
unsigned char* mem;
|
|
|
|
/*
|
|
* clear screen
|
|
*/
|
|
mem = (unsigned char*)VirtualAlloc(
|
|
0,
|
|
0x4b00,
|
|
MEM_RESERVE,
|
|
PAGE_NOACCESS);
|
|
VirtualCopy(
|
|
(LPVOID)mem,
|
|
(LPVOID)(0xaa000000 >> 8),
|
|
0x4b00,
|
|
// PAGE_READWRITE | PAGE_NOCACHE | PAGE_PHYSICAL);
|
|
PAGE_READWRITE | PAGE_PHYSICAL);
|
|
memset(mem, 0, 0x4b00);
|
|
VirtualFree(mem, 0, MEM_RELEASE);
|
|
}
|
|
|
|
static void flush_data()
|
|
{
|
|
unsigned char* mem;
|
|
mem = (unsigned char*)malloc(0x4000);
|
|
memset(mem, 0, 0x4000);
|
|
free(mem);
|
|
}
|
|
#endif
|
|
|
|
int
|
|
startprog(caddr_t map)
|
|
{
|
|
int i;
|
|
unsigned char *mem;
|
|
unsigned long jump_instruction, phys_mem;
|
|
unsigned char *codep = (unsigned char*)asm_code;
|
|
int code_len = (unsigned char*)asm_code_end - codep;
|
|
|
|
#if 0
|
|
clear_screen();
|
|
//flush_data();
|
|
#endif
|
|
|
|
/*
|
|
* allocate physical memory
|
|
*/
|
|
if ((mem = (unsigned char*)vmem_alloc()) == NULL) {
|
|
debug_printf(TEXT("can't allocate final page.\n"));
|
|
msg_printf(MSG_ERROR, whoami, TEXT("can't allocate root page.\n"));
|
|
return (-1);
|
|
}
|
|
|
|
/*
|
|
* copy startup program code
|
|
*/
|
|
for (i = 0; i < code_len; i++) {
|
|
mem[i] = *codep++;
|
|
}
|
|
|
|
/*
|
|
* set map address
|
|
*/
|
|
*(unsigned short*)&mem[0] = (unsigned short)(((long)map) >> 16);
|
|
*(unsigned short*)&mem[4] = (unsigned short)map;
|
|
|
|
/*
|
|
* construct start instruction
|
|
*/
|
|
phys_mem = (unsigned long)vtophysaddr(mem);
|
|
jump_instruction = (0x08000000 | ((phys_mem >> 2) & 0x03ffffff));
|
|
|
|
/*
|
|
* map interrupt vector
|
|
*/
|
|
mem = (unsigned char*)VirtualAlloc(
|
|
0,
|
|
0x400,
|
|
MEM_RESERVE,
|
|
PAGE_NOACCESS);
|
|
VirtualCopy(
|
|
(LPVOID)mem,
|
|
(LPVOID)(0x80000000 >> 8),
|
|
0x400,
|
|
PAGE_READWRITE | PAGE_NOCACHE | PAGE_PHYSICAL);
|
|
|
|
/*
|
|
* GO !
|
|
*/
|
|
*(unsigned long*)&mem[0x0] = jump_instruction;
|
|
|
|
return (0); /* not reachable */
|
|
}
|
|
|
|
void
|
|
asm_code_holder()
|
|
{
|
|
/*
|
|
* void
|
|
* startprog(register struct map_s *map)
|
|
* {
|
|
* register unsigned char *addr;
|
|
* register unsigned char *p;
|
|
* register int i;
|
|
*
|
|
* addr = map->base;
|
|
* i = 0;
|
|
* while (p = map->leaf[i / map->leafsize][i % map->leafsize]) {
|
|
* register unsigned char *pe = p + map->pagesize;
|
|
* while (p < pe) {
|
|
* *addr++ = *p++;
|
|
* }
|
|
* i++;
|
|
* }
|
|
* }
|
|
*
|
|
* register assignment:
|
|
* struct map_s *map a0
|
|
* unsigned char *addr a1
|
|
* unsigned char *p a2
|
|
* unsigned char *pe a3
|
|
* int i t0
|
|
*
|
|
* struct map_s {
|
|
* caddr_t entry; +0
|
|
* caddr_t base; +4
|
|
* int pagesize; +8
|
|
* int leafsize; +12
|
|
* int nleaves; +16
|
|
* caddr_t arg0; +20
|
|
|
|
* caddr_t arg1; +24
|
|
|
|
* caddr_t arg2; +28
|
|
|
|
* caddr_t arg3; +32
|
|
|
|
* caddr_t *leaf[32]; +36
|
|
*
|
|
*/
|
|
__asm(
|
|
" .set noreorder; "
|
|
" .globl asm_code;"
|
|
"asm_code:"
|
|
" lui a0, 0x0000; "
|
|
" ori a0, 0x0000; "
|
|
|
|
/* addr = map->base; */
|
|
"lw a1, 4(a0);"
|
|
|
|
/* i = 0; */
|
|
"ori t0, zero, 0;"
|
|
|
|
" loop_start:"
|
|
|
|
/* while (p = map->leaf[i / map->leafsize][i % map->leafsize]) { */
|
|
/* t1 = map->leafsize */
|
|
"lw t1, 12(a0);"
|
|
|
|
/* lo = i / map->leafsize, hi = i % map->leafsize */
|
|
"addu t3, zero, t0;"
|
|
"div t3, t1;"
|
|
/* t2 = map->leaf */
|
|
"addiu t2, a0, 36;"
|
|
/* t3 = i / map->leafsize */
|
|
"nop;"
|
|
"mflo t3;"
|
|
/* t2 = map->leaf[i / map->leafsize] */
|
|
"sll t3, t3, 2;"
|
|
"addu t2, t2, t3;"
|
|
"lw t2, 0(t2);"
|
|
/* t3 = i % map->leafsize */
|
|
"mfhi t3;"
|
|
|
|
/* p = map->leaf[i / map->leafsize][i % map->leafsize] */
|
|
"sll t3, t3, 2;"
|
|
"addu t2, t2, t3;"
|
|
"lw a2, 0(t2);"
|
|
|
|
/* if (p == NULL) { */
|
|
/* break; */
|
|
/* } */
|
|
"beq a2, zero, loop_end;"
|
|
"nop;"
|
|
|
|
/* register unsigned char *pe = p + map->pagesize; */
|
|
"lw t1, 8(a0);"
|
|
"add a3, a2, t1;"
|
|
|
|
/* while (p < pe) { */
|
|
"loop_start2:"
|
|
"sltu t1, a2, a3;"
|
|
"beq zero,t1,loop_end2;"
|
|
"nop;"
|
|
|
|
/* *addr++ = *p++; */
|
|
"lw t1, 0(a2);"
|
|
"sw t1, 0(a1);"
|
|
"addi a2, a2, 4;"
|
|
"addi a1, a1, 4;"
|
|
|
|
/* } */
|
|
"beq zero, zero, loop_start2;"
|
|
"nop;"
|
|
|
|
/* i++; */
|
|
"loop_end2:"
|
|
"addi t0, t0, 1;"
|
|
"beq zero, zero, loop_start;"
|
|
"nop;"
|
|
|
|
" loop_end:"
|
|
);
|
|
|
|
/*
|
|
* flush instruction cache
|
|
*/
|
|
__asm(
|
|
" li t0, 0x80000000;"
|
|
" addu t1, t0, 1024*128;"
|
|
" subu t1, t1, 128;"
|
|
"1:"
|
|
" cache 0, 0(t0);"
|
|
" cache 0, 16(t0);"
|
|
" cache 0, 32(t0);"
|
|
" cache 0, 48(t0);"
|
|
" cache 0, 64(t0);"
|
|
" cache 0, 80(t0);"
|
|
" cache 0, 96(t0);"
|
|
" cache 0, 112(t0);"
|
|
" bne t0, t1, 1b;"
|
|
" addu t0, t0, 128;"
|
|
);
|
|
|
|
/*
|
|
* flush data cache
|
|
*/
|
|
__asm(
|
|
" li t0, 0x80000000;"
|
|
" addu t1, t0, 1024*128;"
|
|
" subu t1, t1, 128;"
|
|
"1:"
|
|
" cache 1, 0(t0);"
|
|
" cache 1, 16(t0);"
|
|
" cache 1, 32(t0);"
|
|
" cache 1, 48(t0);"
|
|
" cache 1, 64(t0);"
|
|
" cache 1, 80(t0);"
|
|
" cache 1, 96(t0);"
|
|
" cache 1, 112(t0);"
|
|
" bne t0, t1, 1b;"
|
|
" addu t0, t0, 128;"
|
|
);
|
|
|
|
__asm(
|
|
" lw t0, 0(a0);" /* entry addr */
|
|
" lw a1, 24(a0);" /* arg1 */
|
|
" lw a2, 28(a0);" /* arg2 */
|
|
" lw a3, 32(a0);" /* arg3 */
|
|
" lw a0, 20(a0);" /* arg0 */
|
|
" jr t0;"
|
|
" nop;"
|
|
|
|
" .globl asm_code_end;"
|
|
"asm_code_end: nop;"
|
|
" .set reorder; "
|
|
);
|
|
}
|