Home | History | Annotate | Line # | Download | only in arm32
bcopy_page.S revision 1.3
      1  1.3  thorpej /*	$NetBSD: bcopy_page.S,v 1.3 2002/08/07 16:21:29 thorpej Exp $	*/
      2  1.1     matt 
      3  1.1     matt /*
      4  1.1     matt  * Copyright (c) 1995 Scott Stevens
      5  1.1     matt  * All rights reserved.
      6  1.1     matt  *
      7  1.1     matt  * Redistribution and use in source and binary forms, with or without
      8  1.1     matt  * modification, are permitted provided that the following conditions
      9  1.1     matt  * are met:
     10  1.1     matt  * 1. Redistributions of source code must retain the above copyright
     11  1.1     matt  *    notice, this list of conditions and the following disclaimer.
     12  1.1     matt  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1     matt  *    notice, this list of conditions and the following disclaimer in the
     14  1.1     matt  *    documentation and/or other materials provided with the distribution.
     15  1.1     matt  * 3. All advertising materials mentioning features or use of this software
     16  1.1     matt  *    must display the following acknowledgement:
     17  1.1     matt  *	This product includes software developed by Scott Stevens.
     18  1.1     matt  * 4. The name of the author may not be used to endorse or promote products
     19  1.1     matt  *    derived from this software without specific prior written permission.
     20  1.1     matt  *
     21  1.1     matt  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     22  1.1     matt  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     23  1.1     matt  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     24  1.1     matt  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     25  1.1     matt  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     26  1.1     matt  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     27  1.1     matt  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     28  1.1     matt  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     29  1.1     matt  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     30  1.1     matt  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     31  1.1     matt  *
     32  1.1     matt  * RiscBSD kernel project
     33  1.1     matt  *
     34  1.1     matt  * bcopy_page.S
     35  1.1     matt  *
     36  1.1     matt  * page optimised bcopy and bzero routines
     37  1.1     matt  *
     38  1.1     matt  * Created      : 08/04/95
     39  1.1     matt  */
     40  1.1     matt 
     41  1.1     matt #include <machine/param.h>
     42  1.1     matt #include <machine/asm.h>
     43  1.1     matt 
     44  1.2    chris /* #define BIG_LOOPS */
     45  1.2    chris 
     46  1.1     matt /*
     47  1.1     matt  * bcopy_page(src, dest)
     48  1.1     matt  *
     49  1.1     matt  * Optimised copy page routine.
     50  1.1     matt  *
     51  1.1     matt  * On entry:
     52  1.1     matt  *   r0 - src address
     53  1.1     matt  *   r1 - dest address
     54  1.1     matt  *
     55  1.1     matt  * Requires:
     56  1.2    chris  *   number of bytes per page (NBPG) is a multiple of 512 (BIG_LOOPS), 128
     57  1.2    chris  *   otherwise.
     58  1.1     matt  */
     59  1.1     matt 
     60  1.3  thorpej #define	CHUNK_SIZE	32
     61  1.3  thorpej 
     62  1.3  thorpej #ifdef __XSCALE__
     63  1.3  thorpej 	/* Conveniently, the chunk size is the XScale cache line size. */
     64  1.3  thorpej #define	PREFETCH_FIRST_CHUNK	pld	[r0]
     65  1.3  thorpej #define	PREFETCH_NEXT_CHUNK	pld	[r0, #(CHUNK_SIZE)]
     66  1.3  thorpej #else
     67  1.3  thorpej #define	PREFETCH_FIRST_CHUNK	/* nothing */
     68  1.3  thorpej #define	PREFETCH_NEXT_CHUNK	/* nothing */
     69  1.3  thorpej #endif
     70  1.3  thorpej 
     71  1.3  thorpej #ifndef COPY_CHUNK
     72  1.3  thorpej #define	COPY_CHUNK \
     73  1.3  thorpej 	PREFETCH_NEXT_CHUNK ; \
     74  1.3  thorpej 	ldmia	r0!, {r3-r8,ip,lr} ; \
     75  1.3  thorpej 	stmia	r1!, {r3-r8,ip,lr}
     76  1.3  thorpej #endif /* ! COPY_CHUNK */
     77  1.3  thorpej 
     78  1.3  thorpej #ifndef SAVE_REGS
     79  1.3  thorpej #define	SAVE_REGS	stmfd	sp!, {r4-r8, lr}
     80  1.3  thorpej #define	RESTORE_REGS	ldmfd	sp!, {r4-r8, pc}
     81  1.3  thorpej #endif
     82  1.3  thorpej 
     83  1.1     matt ENTRY(bcopy_page)
     84  1.3  thorpej 	PREFETCH_FIRST_CHUNK
     85  1.3  thorpej 	SAVE_REGS
     86  1.2    chris #ifdef BIG_LOOPS
     87  1.1     matt 	mov	r2, #(NBPG >> 9)
     88  1.2    chris #else
     89  1.2    chris 	mov	r2, #(NBPG >> 7)
     90  1.2    chris #endif
     91  1.1     matt 
     92  1.1     matt Lloopcopy:
     93  1.3  thorpej 	COPY_CHUNK
     94  1.3  thorpej 	COPY_CHUNK
     95  1.3  thorpej 	COPY_CHUNK
     96  1.3  thorpej 	COPY_CHUNK
     97  1.2    chris 
     98  1.2    chris #ifdef BIG_LOOPS
     99  1.2    chris 	/* There is little point making the loop any larger; unless we are
    100  1.2    chris 	   running with the cache off, the load/store overheads will
    101  1.2    chris 	   completely dominate this loop.  */
    102  1.3  thorpej 	COPY_CHUNK
    103  1.3  thorpej 	COPY_CHUNK
    104  1.3  thorpej 	COPY_CHUNK
    105  1.3  thorpej 	COPY_CHUNK
    106  1.3  thorpej 
    107  1.3  thorpej 	COPY_CHUNK
    108  1.3  thorpej 	COPY_CHUNK
    109  1.3  thorpej 	COPY_CHUNK
    110  1.3  thorpej 	COPY_CHUNK
    111  1.3  thorpej 
    112  1.3  thorpej 	COPY_CHUNK
    113  1.3  thorpej 	COPY_CHUNK
    114  1.3  thorpej 	COPY_CHUNK
    115  1.3  thorpej 	COPY_CHUNK
    116  1.2    chris #endif
    117  1.1     matt 	subs	r2, r2, #1
    118  1.1     matt 	bne	Lloopcopy
    119  1.1     matt 
    120  1.3  thorpej 	RESTORE_REGS		/* ...and return. */
    121  1.1     matt 
    122  1.1     matt /*
    123  1.1     matt  * bzero_page(dest)
    124  1.1     matt  *
    125  1.1     matt  * Optimised zero page routine.
    126  1.1     matt  *
    127  1.1     matt  * On entry:
    128  1.1     matt  *   r0 - dest address
    129  1.1     matt  *
    130  1.1     matt  * Requires:
    131  1.2    chris  *   number of bytes per page (NBPG) is a multiple of 512 (BIG_LOOPS), 128
    132  1.2    chris  *   otherwise
    133  1.1     matt  */
    134  1.1     matt 
    135  1.1     matt ENTRY(bzero_page)
    136  1.2    chris 	stmfd	sp!, {r4-r8, lr}
    137  1.2    chris #ifdef BIG_LOOPS
    138  1.1     matt 	mov	r2, #(NBPG >> 9)
    139  1.2    chris #else
    140  1.2    chris 	mov	r2, #(NBPG >> 7)
    141  1.2    chris #endif
    142  1.1     matt 	mov	r3, #0
    143  1.1     matt 	mov	r4, #0
    144  1.1     matt 	mov	r5, #0
    145  1.1     matt 	mov	r6, #0
    146  1.1     matt 	mov	r7, #0
    147  1.1     matt 	mov	r8, #0
    148  1.2    chris 	mov	ip, #0
    149  1.2    chris 	mov	lr, #0
    150  1.1     matt 
    151  1.1     matt Lloopzero:
    152  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    153  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    154  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    155  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    156  1.2    chris 
    157  1.2    chris #ifdef BIG_LOOPS
    158  1.2    chris 	/* There is little point making the loop any larger; unless we are
    159  1.2    chris 	   running with the cache off, the load/store overheads will
    160  1.2    chris 	   completely dominate this loop.  */
    161  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    162  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    163  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    164  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    165  1.2    chris 
    166  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    167  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    168  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    169  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    170  1.2    chris 
    171  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    172  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    173  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    174  1.2    chris 	stmia	r0!, {r3-r8,ip,lr}
    175  1.2    chris 
    176  1.2    chris #endif
    177  1.1     matt 
    178  1.1     matt 	subs	r2, r2, #1
    179  1.1     matt 	bne	Lloopzero
    180  1.1     matt 
    181  1.2    chris 	ldmfd	sp!, {r4-r8, pc}
    182