1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/*
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright © 2024, Synopsys Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#define __STDC_WANT_LIB_EXT1__ 1
#include <string.h>
#include <stdbool.h>
#include "string_private.h"
__errno_t
strcpy_s(char * __restrict s1, rsize_t s1max, const char * __restrict s2)
{
const char *msg = "";
bool write_null = true;
if (s1 == NULL) {
msg = "strcpy_s: dest is NULL";
write_null = false;
goto handle_error;
}
if ((s1max == 0) || (CHECK_RSIZE(s1max))) {
msg = "strcpy_s: dest buffer size is 0 or exceeds RSIZE_MAX";
write_null = false;
goto handle_error;
}
if (s2 == NULL) {
msg = "strcpy_s: source is NULL";
goto handle_error;
}
/* It is a constraint violation if s1max is not large enough to contain
* s2: no truncation permitted.
* It is also a constraint violation if the string pointed to by s2
* overlaps s1 in any way.
* The C11 Rationale says we are permitted to proceed with the copy and
* detect dest buffer overrun and overlapping memory blocks as a byproduct
* of performing the copy operation. This is to avoid calling strlen on
* s2 to detect these violations prior to attempting the copy.
*/
const char *overlap_point;
bool check_s1_for_overlap;
char *s1cp = s1;
const char *s2cp = s2;
if (s1 < s2) {
// if we ever reach s2 when storing to s1 we have overlap
overlap_point = s2;
check_s1_for_overlap = true;
} else {
// if we ever reach s1 when reading from s2 we have overlap
overlap_point = s1;
check_s1_for_overlap = false;
}
unsigned written = 0;
char c = '.';
while (written < s1max) {
if (check_s1_for_overlap) {
if (s1cp == overlap_point) {
msg = "strcpy_s: overlapping copy";
goto handle_error;
}
} else if (s2cp == overlap_point) {
msg = "strcpy_s: overlapping copy";
goto handle_error;
}
c = *s2cp++;
*s1cp++ = c;
written++;
if (c == '\0') {
break;
}
}
if (c != '\0') {
msg = "strcpy_s: dest buffer size insufficent to copy string";
goto handle_error;
}
// Normal return path
return 0;
handle_error:
if (write_null && s1 != NULL) {
*s1 = '\0';
}
if (__cur_handler != NULL) {
__cur_handler(msg, NULL, -1);
}
return -1;
}
|
