summaryrefslogtreecommitdiffstats
path: root/mdk-stage1/slang/slmemcpy.c
diff options
context:
space:
mode:
authorMystery Man <unknown@mandriva.org>2002-08-22 15:26:01 +0000
committerMystery Man <unknown@mandriva.org>2002-08-22 15:26:01 +0000
commitadd076e220fdffdeb6de5ae9a9efb6c7e3e0303e (patch)
tree956c3d91d4b8cfc7851ad7e02301fe5e6db1aa66 /mdk-stage1/slang/slmemcpy.c
parent76761ff24d3358147c214490defbab4910201d73 (diff)
downloaddrakx-backup-do-not-use-add076e220fdffdeb6de5ae9a9efb6c7e3e0303e.tar
drakx-backup-do-not-use-add076e220fdffdeb6de5ae9a9efb6c7e3e0303e.tar.gz
drakx-backup-do-not-use-add076e220fdffdeb6de5ae9a9efb6c7e3e0303e.tar.bz2
drakx-backup-do-not-use-add076e220fdffdeb6de5ae9a9efb6c7e3e0303e.tar.xz
drakx-backup-do-not-use-add076e220fdffdeb6de5ae9a9efb6c7e3e0303e.zip
This commit was manufactured by cvs2svn to create tag 'V1_1_9_16mdk'.V1_1_9_16mdk
Diffstat (limited to 'mdk-stage1/slang/slmemcpy.c')
-rw-r--r--mdk-stage1/slang/slmemcpy.c49
1 files changed, 0 insertions, 49 deletions
diff --git a/mdk-stage1/slang/slmemcpy.c b/mdk-stage1/slang/slmemcpy.c
deleted file mode 100644
index e8665e4c6..000000000
--- a/mdk-stage1/slang/slmemcpy.c
+++ /dev/null
@@ -1,49 +0,0 @@
-/* Copyright (c) 1992, 1999, 2001 John E. Davis
- * This file is part of the S-Lang library.
- *
- * You may distribute under the terms of either the GNU General Public
- * License or the Perl Artistic License.
- */
-
-/* These routines are fast memcpy, memset routines. When available, I
- use system rouines. For msdos, I use inline assembly. */
-
-/* The current versions only work in the forward direction only!! */
-
-#include "slinclud.h"
-
-#include "slang.h"
-#include "_slang.h"
-
-char *SLmemcpy(char *s1, char *s2, int n)
-{
-#if defined(__BORLANDC__) && defined(__MSDOS__)
- asm mov ax, ds
- asm mov bx, si
- asm mov dx, di
- asm mov cx, n
- asm les di, s1
- asm lds si, s2
- asm cld
- asm rep movsb
- asm mov ds, ax
- asm mov si, bx
- asm mov di, dx
- return(s1);
-
-#else
- register char *smax, *s = s1;
- int n2;
-
- n2 = n % 4;
- smax = s + (n - 4);
- while (s <= smax)
- {
- *s = *s2; *(s + 1) = *(s2 + 1); *(s + 2) = *(s2 + 2); *(s + 3) = *(s2 + 3);
- s += 4;
- s2 += 4;
- }
- while (n2--) *s++ = *s2++;
- return(s1);
-#endif
-}