|
|
1.1 root 1: .\" Copyright (c) 1990 The Regents of the University of California.
2: .\" All rights reserved.
3: .\"
4: .\" This code is derived from software contributed to Berkeley by
5: .\" Chris Torek.
6: .\"
7: .\" Redistribution and use in source and binary forms are permitted provided
8: .\" that: (1) source distributions retain this entire copyright notice and
9: .\" comment, and (2) distributions including binaries display the following
10: .\" acknowledgement: ``This product includes software developed by the
11: .\" University of California, Berkeley and its contributors'' in the
12: .\" documentation or other materials provided with the distribution and in
13: .\" all advertising materials mentioning features or use of this software.
14: .\" Neither the name of the University nor the names of its contributors may
15: .\" be used to endorse or promote products derived from this software without
16: .\" specific prior written permission.
17: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
18: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
19: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
20: .\"
21: .\" @(#)memcpy.3 5.2 (Berkeley) 6/24/90
22: .\"
23: .TH MEMCPY 3 "June 24, 1990"
24: .UC 7
25: .SH NAME
26: memcpy \- copy byte string
27: .SH SYNOPSIS
28: .nf
29: .ft B
30: #include <string.h>
31:
32: void *
33: memcpy(void *dst, const void *src, size_t len);
34: .ft R
35: .fi
36: .SH DESCRIPTION
37: .B Memcpy
38: copies
39: .I len
40: bytes from string
41: .I src
42: to string
43: .I dst
44: and returns the original value of
45: .IR dst .
46: .SH SEE ALSO
47: bcopy(3), memccpy(3), memmove(3), strcpy(3)
48: .SH STANDARDS
49: .IR Memcpy
50: conforms to ANSI X3.159-1989 (``ANSI C'').
51: .SH BUGS
52: In this implementation
53: .B memcpy
54: is implemented using
55: .IR bcopy (3),
56: and therefore the strings may overlap.
57: On other systems, copying overlapping strings may produce surprises.
58: A simpler solution is to not use
59: .IR memcpy .
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.