1*59faaf83Smatt/* $NetBSD: memmove.S,v 1.1 2014/09/03 19:34:25 matt Exp $ */ 2*59faaf83Smatt 3*59faaf83Smatt/* stropt/memmove.S, pl_string_common, pl_linux 10/11/04 11:45:37 4*59faaf83Smatt * ========================================================================== 5*59faaf83Smatt * Optimized memmove implementation for IBM PowerPC 405/440. 6*59faaf83Smatt * 7*59faaf83Smatt * Copyright (c) 2003, IBM Corporation 8*59faaf83Smatt * All rights reserved. 9*59faaf83Smatt * 10*59faaf83Smatt * Redistribution and use in source and binary forms, with or 11*59faaf83Smatt * without modification, are permitted provided that the following 12*59faaf83Smatt * conditions are met: 13*59faaf83Smatt * 14*59faaf83Smatt * * Redistributions of source code must retain the above 15*59faaf83Smatt * copyright notice, this list of conditions and the following 16*59faaf83Smatt * disclaimer. 17*59faaf83Smatt * * Redistributions in binary form must reproduce the above 18*59faaf83Smatt * copyright notice, this list of conditions and the following 19*59faaf83Smatt * disclaimer in the documentation and/or other materials 20*59faaf83Smatt * provided with the distribution. 21*59faaf83Smatt * * Neither the name of IBM nor the names of its contributors 22*59faaf83Smatt * may be used to endorse or promote products derived from this 23*59faaf83Smatt * software without specific prior written permission. 24*59faaf83Smatt * 25*59faaf83Smatt * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 26*59faaf83Smatt * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, 27*59faaf83Smatt * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 28*59faaf83Smatt * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 29*59faaf83Smatt * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS 30*59faaf83Smatt * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, 31*59faaf83Smatt * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 32*59faaf83Smatt * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 33*59faaf83Smatt * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY 34*59faaf83Smatt * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 35*59faaf83Smatt * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE 36*59faaf83Smatt * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 37*59faaf83Smatt * 38*59faaf83Smatt * ========================================================================== 39*59faaf83Smatt * 40*59faaf83Smatt * Function: Move memory area (handles overlapping regions) 41*59faaf83Smatt * 42*59faaf83Smatt * void *memmove(void * dest, const void * src, int n) 43*59faaf83Smatt * 44*59faaf83Smatt * Input: r3 - destination address 45*59faaf83Smatt * r4 - source address 46*59faaf83Smatt * r5 - byte count 47*59faaf83Smatt * Output: r11 - destination address 48*59faaf83Smatt * 49*59faaf83Smatt * ========================================================================== 50*59faaf83Smatt */ 51*59faaf83Smatt 52*59faaf83Smatt#include <machine/asm.h> 53*59faaf83Smatt 54*59faaf83Smatt#ifdef _BCOPY 55*59faaf83Smatt/* bcopy = memcpy/memmove with arguments reversed. */ 56*59faaf83Smatt/* LINTSTUB: Func: void bcopy(void *, void *, size_t) */ 57*59faaf83SmattENTRY(bcopy) 58*59faaf83Smatt l.or r6, r3, r0 /* swap src/dst */ 59*59faaf83Smatt l.or r3, r4, r0 60*59faaf83Smatt l.or r4, r6, r0 61*59faaf83Smatt#else 62*59faaf83Smatt/* LINTSTUB: Func: void *memmove(void *, const void *, size_t) */ 63*59faaf83SmattENTRY(memmove) 64*59faaf83Smatt#endif 65*59faaf83Smatt 66*59faaf83Smatt l.or r11, r3, r0 /* Save dst (return value) */ 67*59faaf83Smatt 68*59faaf83Smatt l.sfges r4, r3 /* Branch to reverse if */ 69*59faaf83Smatt l.bnf .Lreverse /* src < dest. Don't want to */ 70*59faaf83Smatt /* overwrite end of src with */ 71*59faaf83Smatt /* start of dest */ 72*59faaf83Smatt 73*59faaf83Smatt l.addi r4, r4, -4 /* Back up src and dst pointers */ 74*59faaf83Smatt l.addi r3, r3, -4 /* due to auto-update of 'load' */ 75*59faaf83Smatt 76*59faaf83Smatt l.srli r13, r5, 2 /* How many words in total cnt */ 77*59faaf83Smatt l.sfeqi r13, 0 78*59faaf83Smatt l.bf .Llast1 /* Handle byte by byte if < 4 */ 79*59faaf83Smatt /* bytes total */ 80*59faaf83Smatt l.lwz r7, 4(r4) /* Preload first word */ 81*59faaf83Smatt l.addi r4, r4, 4 82*59faaf83Smatt 83*59faaf83Smatt l.j .Lg1 84*59faaf83Smatt l.nop 85*59faaf83Smatt 86*59faaf83Smatt.Lg0: /* Main loop */ 87*59faaf83Smatt 88*59faaf83Smatt l.lwz r7, 4(r4) /* Load a new word */ 89*59faaf83Smatt l.sw 4(r3), r6 /* Store previous word */ 90*59faaf83Smatt l.addi r4, r4, 4 /* advance */ 91*59faaf83Smatt l.addi r3, r3, 4 /* advance */ 92*59faaf83Smatt 93*59faaf83Smatt.Lg1: 94*59faaf83Smatt 95*59faaf83Smatt l.addi r13, r13, -1 96*59faaf83Smatt l.sfeqi r13, 0 97*59faaf83Smatt l.bf .Llast /* Dec cnt, and branch if just */ 98*59faaf83Smatt l.nop 99*59faaf83Smatt /* one word to store */ 100*59faaf83Smatt l.lwz r6, 4(r4) /* Load another word */ 101*59faaf83Smatt l.sw 4(r3), r7 /* Store previous word */ 102*59faaf83Smatt l.addi r4, r4, 4 /* advance to next word */ 103*59faaf83Smatt l.addi r3, r3, 4 /* advance to next word */ 104*59faaf83Smatt l.addi r13, r13, -1 /* Decrement count */ 105*59faaf83Smatt l.sfeqi r13, 0 /* last word? */ 106*59faaf83Smatt l.bnf .Lg0 /* no, loop, more words */ 107*59faaf83Smatt l.nop 108*59faaf83Smatt 109*59faaf83Smatt l.or r7, r6, r0 /* If word count -> 0, then... */ 110*59faaf83Smatt 111*59faaf83Smatt.Llast: 112*59faaf83Smatt 113*59faaf83Smatt l.sw 4(r3), r7 /* ... store last word */ 114*59faaf83Smatt l.addi r3, r3, 4 115*59faaf83Smatt 116*59faaf83Smatt.Llast1: /* Byte-by-byte copy */ 117*59faaf83Smatt 118*59faaf83Smatt l.andi r5, r5, 3 /* get remaining byte count */ 119*59faaf83Smatt l.sfeqi r5, 0 /* is it 0? */ 120*59faaf83Smatt l.bf .Ldone /* yes, we're done */ 121*59faaf83Smatt l.nop /* -- delay slot -- */ 122*59faaf83Smatt 123*59faaf83Smatt l.lbz r6, 4(r4) /* 1st byte: update addr by 4 */ 124*59faaf83Smatt l.sb 4(r3), r6 /* since we pre-adjusted by 4 */ 125*59faaf83Smatt l.addi r4, r4, 4 /* advance to next word */ 126*59faaf83Smatt l.addi r3, r3, 4 /* advance to next word */ 127*59faaf83Smatt l.addi r5, r5, -1 /* decrement count */ 128*59faaf83Smatt l.sfeqi r5, 0 /* is it 0? */ 129*59faaf83Smatt l.bf .Ldone /* yes, we're done */ 130*59faaf83Smatt l.nop /* -- delay slot -- */ 131*59faaf83Smatt 132*59faaf83Smatt.Llast2: 133*59faaf83Smatt 134*59faaf83Smatt l.lbz r6, 1(r4) /* But handle the rest by */ 135*59faaf83Smatt l.sb 1(r3), r6 /* updating addr by 1 */ 136*59faaf83Smatt l.addi r4, r4, 1 /* advance to next word */ 137*59faaf83Smatt l.addi r3, r3, 1 /* advance to next word */ 138*59faaf83Smatt l.addi r5, r5, -1 /* decrement count */ 139*59faaf83Smatt l.sfeqi r5, 0 /* is it 0? */ 140*59faaf83Smatt l.bnf .Llast2 /* yes, we're done */ 141*59faaf83Smatt l.nop /* -- delay slot -- */ 142*59faaf83Smatt.Ldone: 143*59faaf83Smatt l.jr lr /* return */ 144*59faaf83Smatt l.nop /* -- delay slot -- */ 145*59faaf83Smatt 146*59faaf83Smatt /* We're here since src < dest. Don't want to overwrite end of */ 147*59faaf83Smatt /* src with start of dest */ 148*59faaf83Smatt 149*59faaf83Smatt.Lreverse: 150*59faaf83Smatt 151*59faaf83Smatt l.add r4, r4, r5 /* Work from end to beginning */ 152*59faaf83Smatt l.add r3, r3, r5 /* so add count to string ptrs */ 153*59faaf83Smatt l.srli r13, r5, 2 /* Words in total count */ 154*59faaf83Smatt l.sfeqi r13, 0 155*59faaf83Smatt l.bf .Lrlast1 /* Handle byte by byte if < 4 */ 156*59faaf83Smatt /* bytes total */ 157*59faaf83Smatt l.nop 158*59faaf83Smatt 159*59faaf83Smatt l.lwz r7, -4(r4) /* Preload first word */ 160*59faaf83Smatt l.addi r4, r4, -4 /* update pointer */ 161*59faaf83Smatt 162*59faaf83Smatt l.j .Lrg1 163*59faaf83Smatt 164*59faaf83Smatt.Lrg0: /* Main loop */ 165*59faaf83Smatt 166*59faaf83Smatt l.lwz r7, -4(r4) /* Load a new word */ 167*59faaf83Smatt l.sw -4(r3), r6 /* Store previous word */ 168*59faaf83Smatt l.addi r4, r4, -4 169*59faaf83Smatt l.addi r3, r3, -4 170*59faaf83Smatt 171*59faaf83Smatt.Lrg1: 172*59faaf83Smatt 173*59faaf83Smatt l.addi r13, r13, -1 /* decrement count */ 174*59faaf83Smatt l.sfeqi r13, 0 /* just one pending word left? */ 175*59faaf83Smatt l.bf .Lrlast /* yes, deal with it */ 176*59faaf83Smatt 177*59faaf83Smatt l.lwz r6, -4(r4) /* Load another word */ 178*59faaf83Smatt l.sw -4(r3), r7 /* Store previous word */ 179*59faaf83Smatt l.addi r4, r4, -4 180*59faaf83Smatt l.addi r3, r3, -4 181*59faaf83Smatt 182*59faaf83Smatt l.addi r13, r13, -1 /* decrement count */ 183*59faaf83Smatt l.sfeqi r13, 0 /* just one pending word left? */ 184*59faaf83Smatt l.bnf .Lrg0 /* no, loop again more words */ 185*59faaf83Smatt l.nop 186*59faaf83Smatt 187*59faaf83Smatt l.or r7, r6, r0 /* If word count -> 0, then... */ 188*59faaf83Smatt 189*59faaf83Smatt.Lrlast: 190*59faaf83Smatt 191*59faaf83Smatt l.sw -4(r3), r7 /* ... store last word */ 192*59faaf83Smatt l.addi r3, r3, -4 /* update pointer */ 193*59faaf83Smatt 194*59faaf83Smatt.Lrlast1: /* Byte-by-byte copy */ 195*59faaf83Smatt 196*59faaf83Smatt l.andi r5, r5, 3 197*59faaf83Smatt l.sfeqi r5, 0 198*59faaf83Smatt l.bf .Lrdone 199*59faaf83Smatt 200*59faaf83Smatt.Lrlast2: 201*59faaf83Smatt 202*59faaf83Smatt l.lbz r6, -1(r4) /* Handle the rest, byte by */ 203*59faaf83Smatt l.sb -1(r3), r6 /* byte */ 204*59faaf83Smatt l.addi r4, r4, -1 205*59faaf83Smatt l.addi r3, r3, -1 206*59faaf83Smatt l.addi r5, r5, -1 /* decrement count */ 207*59faaf83Smatt l.sfeqi r5, 0 /* is it 0? */ 208*59faaf83Smatt l.bnf .Lrlast2 /* no, loop again */ 209*59faaf83Smatt l.nop 210*59faaf83Smatt.Lrdone: 211*59faaf83Smatt l.jr lr 212*59faaf83Smatt l.nop 213*59faaf83Smatt 214*59faaf83Smatt#ifdef _BCOPY 215*59faaf83SmattEND(bcopy) 216*59faaf83Smatt#else 217*59faaf83SmattEND(memmove) 218*59faaf83Smatt#endif 219