2007-06-03 21:20:06 +00:00
|
|
|
/* _memcopy.c -- subroutines for memory copy functions.
|
2017-01-01 00:14:16 +00:00
|
|
|
Copyright (C) 1991-2017 Free Software Foundation, Inc.
|
2007-06-03 21:20:06 +00:00
|
|
|
This file is part of the GNU C Library.
|
|
|
|
Contributed by Torbjorn Granlund (tege@sics.se).
|
|
|
|
Updated for POWER6 by Steven Munroe (sjmunroe@us.ibm.com).
|
|
|
|
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU Lesser General Public
|
|
|
|
License as published by the Free Software Foundation; either
|
|
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
The GNU C Library 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
|
|
|
|
Lesser General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
2012-02-09 23:18:22 +00:00
|
|
|
License along with the GNU C Library; if not, see
|
|
|
|
<http://www.gnu.org/licenses/>. */
|
2007-06-03 21:20:06 +00:00
|
|
|
|
|
|
|
/* BE VERY CAREFUL IF YOU CHANGE THIS CODE...! */
|
|
|
|
|
|
|
|
#include <stddef.h>
|
|
|
|
#include <memcopy.h>
|
|
|
|
|
|
|
|
/* _wordcopy_fwd_aligned -- Copy block beginning at SRCP to
|
|
|
|
block beginning at DSTP with LEN `op_t' words (not LEN bytes!).
|
|
|
|
Both SRCP and DSTP should be aligned for memory operations on `op_t's. */
|
|
|
|
|
2013-10-14 14:59:59 +00:00
|
|
|
#ifndef WORDCOPY_FWD_ALIGNED
|
|
|
|
# define WORDCOPY_FWD_ALIGNED _wordcopy_fwd_aligned
|
|
|
|
#endif
|
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
void
|
2013-10-14 14:59:59 +00:00
|
|
|
WORDCOPY_FWD_ALIGNED (long int dstp, long int srcp, size_t len)
|
2007-06-03 21:20:06 +00:00
|
|
|
{
|
|
|
|
op_t a0, a1;
|
|
|
|
|
|
|
|
if (len & 1)
|
|
|
|
{
|
|
|
|
((op_t *) dstp)[0] = ((op_t *) srcp)[0];
|
2013-06-05 20:44:03 +00:00
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
if (len == 1)
|
|
|
|
return;
|
|
|
|
srcp += OPSIZ;
|
|
|
|
dstp += OPSIZ;
|
|
|
|
len -= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
do
|
|
|
|
{
|
|
|
|
a0 = ((op_t *) srcp)[0];
|
|
|
|
a1 = ((op_t *) srcp)[1];
|
|
|
|
((op_t *) dstp)[0] = a0;
|
|
|
|
((op_t *) dstp)[1] = a1;
|
|
|
|
|
|
|
|
srcp += 2 * OPSIZ;
|
|
|
|
dstp += 2 * OPSIZ;
|
|
|
|
len -= 2;
|
|
|
|
}
|
|
|
|
while (len != 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* _wordcopy_fwd_dest_aligned -- Copy block beginning at SRCP to
|
|
|
|
block beginning at DSTP with LEN `op_t' words (not LEN bytes!).
|
|
|
|
DSTP should be aligned for memory operations on `op_t's, but SRCP must
|
|
|
|
*not* be aligned. */
|
|
|
|
|
2012-04-18 19:52:25 +00:00
|
|
|
#define fwd_align_merge(align) \
|
|
|
|
do \
|
|
|
|
{ \
|
|
|
|
a1 = ((op_t *) srcp)[1]; \
|
|
|
|
a2 = ((op_t *) srcp)[2]; \
|
2013-10-14 14:59:59 +00:00
|
|
|
((op_t *) dstp)[0] = MERGE (a0, align*8, a1, (__WORDSIZE-align*8)); \
|
|
|
|
((op_t *) dstp)[1] = MERGE (a1, align*8, a2, (__WORDSIZE-align*8)); \
|
2012-04-18 19:52:25 +00:00
|
|
|
a0 = a2; \
|
|
|
|
srcp += 2 * OPSIZ; \
|
|
|
|
dstp += 2 * OPSIZ; \
|
|
|
|
len -= 2; \
|
|
|
|
} \
|
|
|
|
while (len != 0)
|
|
|
|
|
2013-10-14 14:59:59 +00:00
|
|
|
#ifndef WORDCOPY_FWD_DEST_ALIGNED
|
|
|
|
# define WORDCOPY_FWD_DEST_ALIGNED _wordcopy_fwd_dest_aligned
|
|
|
|
#endif
|
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
void
|
2013-10-14 14:59:59 +00:00
|
|
|
WORDCOPY_FWD_DEST_ALIGNED (long int dstp, long int srcp, size_t len)
|
2007-06-03 21:20:06 +00:00
|
|
|
{
|
|
|
|
op_t a0, a1, a2;
|
|
|
|
int sh_1, sh_2;
|
|
|
|
int align;
|
|
|
|
|
|
|
|
/* Calculate how to shift a word read at the memory operation
|
|
|
|
aligned srcp to make it aligned for copy. */
|
|
|
|
|
|
|
|
align = srcp % OPSIZ;
|
|
|
|
sh_1 = 8 * (srcp % OPSIZ);
|
|
|
|
sh_2 = 8 * OPSIZ - sh_1;
|
|
|
|
|
|
|
|
/* Make SRCP aligned by rounding it down to the beginning of the `op_t'
|
|
|
|
it points in the middle of. */
|
|
|
|
srcp &= -OPSIZ;
|
|
|
|
a0 = ((op_t *) srcp)[0];
|
|
|
|
|
|
|
|
if (len & 1)
|
|
|
|
{
|
|
|
|
a1 = ((op_t *) srcp)[1];
|
|
|
|
((op_t *) dstp)[0] = MERGE (a0, sh_1, a1, sh_2);
|
2013-06-05 20:44:03 +00:00
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
if (len == 1)
|
|
|
|
return;
|
2013-06-05 20:44:03 +00:00
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
a0 = a1;
|
|
|
|
srcp += OPSIZ;
|
|
|
|
dstp += OPSIZ;
|
|
|
|
len -= 1;
|
|
|
|
}
|
|
|
|
|
2012-04-18 20:34:23 +00:00
|
|
|
fwd_align_merge (align);
|
2007-06-03 21:20:06 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/* _wordcopy_bwd_aligned -- Copy block finishing right before
|
|
|
|
SRCP to block finishing right before DSTP with LEN `op_t' words
|
|
|
|
(not LEN bytes!). Both SRCP and DSTP should be aligned for memory
|
|
|
|
operations on `op_t's. */
|
|
|
|
|
2013-10-14 14:59:59 +00:00
|
|
|
#ifndef WORDCOPY_BWD_ALIGNED
|
|
|
|
# define WORDCOPY_BWD_ALIGNED _wordcopy_bwd_aligned
|
|
|
|
#endif
|
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
void
|
2013-10-14 14:59:59 +00:00
|
|
|
WORDCOPY_BWD_ALIGNED (long int dstp, long int srcp, size_t len)
|
2007-06-03 21:20:06 +00:00
|
|
|
{
|
|
|
|
op_t a0, a1;
|
|
|
|
|
|
|
|
if (len & 1)
|
|
|
|
{
|
|
|
|
srcp -= OPSIZ;
|
|
|
|
dstp -= OPSIZ;
|
|
|
|
((op_t *) dstp)[0] = ((op_t *) srcp)[0];
|
2013-06-05 20:44:03 +00:00
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
if (len == 1)
|
|
|
|
return;
|
|
|
|
len -= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
do
|
|
|
|
{
|
|
|
|
srcp -= 2 * OPSIZ;
|
|
|
|
dstp -= 2 * OPSIZ;
|
|
|
|
|
|
|
|
a1 = ((op_t *) srcp)[1];
|
|
|
|
a0 = ((op_t *) srcp)[0];
|
|
|
|
((op_t *) dstp)[1] = a1;
|
|
|
|
((op_t *) dstp)[0] = a0;
|
|
|
|
|
|
|
|
len -= 2;
|
|
|
|
}
|
|
|
|
while (len != 0);
|
|
|
|
}
|
|
|
|
|
2012-04-18 19:52:25 +00:00
|
|
|
#define bwd_align_merge(align) \
|
|
|
|
do \
|
|
|
|
{ \
|
|
|
|
srcp -= 2 * OPSIZ; \
|
|
|
|
dstp -= 2 * OPSIZ; \
|
|
|
|
a1 = ((op_t *) srcp)[1]; \
|
|
|
|
a0 = ((op_t *) srcp)[0]; \
|
2013-10-14 14:59:59 +00:00
|
|
|
((op_t *) dstp)[1] = MERGE (a1, align*8, a2, (__WORDSIZE-align*8)); \
|
|
|
|
((op_t *) dstp)[0] = MERGE (a0, align*8, a1, (__WORDSIZE-align*8)); \
|
2012-04-18 19:52:25 +00:00
|
|
|
a2 = a0; \
|
|
|
|
len -= 2; \
|
|
|
|
} \
|
|
|
|
while (len != 0)
|
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
/* _wordcopy_bwd_dest_aligned -- Copy block finishing right
|
|
|
|
before SRCP to block finishing right before DSTP with LEN `op_t'
|
|
|
|
words (not LEN bytes!). DSTP should be aligned for memory
|
|
|
|
operations on `op_t', but SRCP must *not* be aligned. */
|
|
|
|
|
2013-10-14 14:59:59 +00:00
|
|
|
#ifndef WORDCOPY_BWD_DEST_ALIGNED
|
|
|
|
# define WORDCOPY_BWD_DEST_ALIGNED _wordcopy_bwd_dest_aligned
|
|
|
|
#endif
|
|
|
|
|
2007-06-03 21:20:06 +00:00
|
|
|
void
|
2013-10-14 14:59:59 +00:00
|
|
|
WORDCOPY_BWD_DEST_ALIGNED (long int dstp, long int srcp, size_t len)
|
2007-06-03 21:20:06 +00:00
|
|
|
{
|
|
|
|
op_t a0, a1, a2;
|
|
|
|
int sh_1, sh_2;
|
|
|
|
int align;
|
|
|
|
|
|
|
|
/* Calculate how to shift a word read at the memory operation
|
|
|
|
aligned srcp to make it aligned for copy. */
|
|
|
|
|
|
|
|
align = srcp % OPSIZ;
|
|
|
|
sh_1 = 8 * (srcp % OPSIZ);
|
|
|
|
sh_2 = 8 * OPSIZ - sh_1;
|
|
|
|
|
|
|
|
/* Make srcp aligned by rounding it down to the beginning of the op_t
|
|
|
|
it points in the middle of. */
|
|
|
|
srcp &= -OPSIZ;
|
|
|
|
a2 = ((op_t *) srcp)[0];
|
|
|
|
|
|
|
|
if (len & 1)
|
|
|
|
{
|
|
|
|
srcp -= OPSIZ;
|
|
|
|
dstp -= OPSIZ;
|
|
|
|
a1 = ((op_t *) srcp)[0];
|
|
|
|
((op_t *) dstp)[0] = MERGE (a1, sh_1, a2, sh_2);
|
|
|
|
|
|
|
|
if (len == 1)
|
|
|
|
return;
|
|
|
|
|
|
|
|
a2 = a1;
|
|
|
|
len -= 1;
|
|
|
|
}
|
|
|
|
|
2012-04-18 20:34:23 +00:00
|
|
|
bwd_align_merge (align);
|
2007-06-03 21:20:06 +00:00
|
|
|
}
|