1 | /* Measure __strcpy_chk functions. |
2 | Copyright (C) 2013-2022 Free Software Foundation, Inc. |
3 | This file is part of the GNU C Library. |
4 | |
5 | The GNU C Library is free software; you can redistribute it and/or |
6 | modify it under the terms of the GNU Lesser General Public |
7 | License as published by the Free Software Foundation; either |
8 | version 2.1 of the License, or (at your option) any later version. |
9 | |
10 | The GNU C Library is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 | Lesser General Public License for more details. |
14 | |
15 | You should have received a copy of the GNU Lesser General Public |
16 | License along with the GNU C Library; if not, see |
17 | <https://www.gnu.org/licenses/>. */ |
18 | |
19 | #ifndef STRCPY_RESULT |
20 | # define STRCPY_RESULT(dst, len) dst |
21 | # define TEST_MAIN |
22 | # define TEST_NAME "strcpy_chk" |
23 | # include "bench-string.h" |
24 | |
25 | /* This test case implicitly tests the availability of the __chk_fail |
26 | symbol, which is part of the public ABI and may be used |
27 | externally. */ |
28 | extern void __attribute__ ((noreturn)) __chk_fail (void); |
29 | char *simple_strcpy_chk (char *, const char *, size_t); |
30 | extern char *normal_strcpy (char *, const char *, size_t) |
31 | __asm ("strcpy" ); |
32 | extern char *__strcpy_chk (char *, const char *, size_t); |
33 | |
34 | IMPL (simple_strcpy_chk, 0) |
35 | IMPL (normal_strcpy, 1) |
36 | IMPL (__strcpy_chk, 2) |
37 | |
38 | char * |
39 | simple_strcpy_chk (char *dst, const char *src, size_t len) |
40 | { |
41 | char *ret = dst; |
42 | if (! len) |
43 | __chk_fail (); |
44 | while ((*dst++ = *src++) != '\0') |
45 | if (--len == 0) |
46 | __chk_fail (); |
47 | return ret; |
48 | } |
49 | #endif |
50 | |
51 | #include <fcntl.h> |
52 | #include <paths.h> |
53 | #include <setjmp.h> |
54 | #include <signal.h> |
55 | |
56 | #include <support/support.h> |
57 | |
58 | volatile int chk_fail_ok; |
59 | jmp_buf chk_fail_buf; |
60 | |
61 | static void |
62 | handler (int sig) |
63 | { |
64 | if (chk_fail_ok) |
65 | { |
66 | chk_fail_ok = 0; |
67 | longjmp (env: chk_fail_buf, val: 1); |
68 | } |
69 | else |
70 | _exit (127); |
71 | } |
72 | |
73 | typedef char *(*proto_t) (char *, const char *, size_t); |
74 | |
75 | static void |
76 | do_one_test (impl_t *impl, char *dst, const char *src, |
77 | size_t len, size_t dlen) |
78 | { |
79 | char *res; |
80 | size_t i, iters = INNER_LOOP_ITERS8; |
81 | timing_t start, stop, cur; |
82 | |
83 | if (dlen <= len) |
84 | { |
85 | if (impl->test == 1) |
86 | return; |
87 | |
88 | chk_fail_ok = 1; |
89 | if (setjmp (chk_fail_buf) == 0) |
90 | { |
91 | res = CALL (impl, dst, src, dlen); |
92 | printf (format: "*** Function %s (%zd; %zd) did not __chk_fail\n" , |
93 | impl->name, len, dlen); |
94 | chk_fail_ok = 0; |
95 | ret = 1; |
96 | } |
97 | return; |
98 | } |
99 | else |
100 | res = CALL (impl, dst, src, dlen); |
101 | |
102 | if (res != STRCPY_RESULT (dst, len)) |
103 | { |
104 | printf (format: "Wrong result in function %s %p %p\n" , impl->name, |
105 | res, STRCPY_RESULT (dst, len)); |
106 | ret = 1; |
107 | return; |
108 | } |
109 | |
110 | if (strcmp (dst, src) != 0) |
111 | { |
112 | printf (format: "Wrong result in function %s dst \"%s\" src \"%s\"\n" , |
113 | impl->name, dst, src); |
114 | ret = 1; |
115 | return; |
116 | } |
117 | |
118 | TIMING_NOW (start); |
119 | for (i = 0; i < iters; ++i) |
120 | { |
121 | CALL (impl, dst, src, dlen); |
122 | } |
123 | TIMING_NOW (stop); |
124 | |
125 | TIMING_DIFF (cur, start, stop); |
126 | |
127 | TIMING_PRINT_MEAN ((double) cur, (double) iters); |
128 | } |
129 | |
130 | static void |
131 | do_test (size_t align1, size_t align2, size_t len, size_t dlen, int max_char) |
132 | { |
133 | size_t i; |
134 | char *s1, *s2; |
135 | |
136 | align1 &= 7; |
137 | if (align1 + len >= page_size) |
138 | return; |
139 | |
140 | align2 &= 7; |
141 | if (align2 + len >= page_size) |
142 | return; |
143 | |
144 | s1 = (char *) buf1 + align1; |
145 | s2 = (char *) buf2 + align2; |
146 | |
147 | for (i = 0; i < len; i++) |
148 | s1[i] = 32 + 23 * i % (max_char - 32); |
149 | s1[len] = 0; |
150 | |
151 | if (dlen > len) |
152 | printf (format: "Length %4zd, alignment %2zd/%2zd:" , len, align1, align2); |
153 | |
154 | FOR_EACH_IMPL (impl, 0) |
155 | do_one_test (impl, dst: s2, src: s1, len, dlen); |
156 | |
157 | if (dlen > len) |
158 | putchar (c: '\n'); |
159 | } |
160 | |
161 | static int |
162 | test_main (void) |
163 | { |
164 | size_t i; |
165 | |
166 | set_fortify_handler (handler); |
167 | |
168 | test_init (); |
169 | |
170 | printf (format: "%23s" , "" ); |
171 | FOR_EACH_IMPL (impl, 0) |
172 | printf (format: "\t%s" , impl->name); |
173 | putchar (c: '\n'); |
174 | |
175 | for (i = 0; i < 16; ++i) |
176 | { |
177 | do_test (align1: 0, align2: 0, len: i, dlen: i + 1, max_char: 127); |
178 | do_test (align1: 0, align2: 0, len: i, dlen: i + 1, max_char: 255); |
179 | do_test (align1: 0, align2: i, len: i, dlen: i + 1, max_char: 127); |
180 | do_test (align1: i, align2: 0, len: i, dlen: i + 1, max_char: 255); |
181 | } |
182 | |
183 | for (i = 1; i < 8; ++i) |
184 | { |
185 | do_test (align1: 0, align2: 0, len: 8 << i, dlen: (8 << i) + 1, max_char: 127); |
186 | do_test (align1: 8 - i, align2: 2 * i, len: (8 << i), dlen: (8 << i) + 1, max_char: 127); |
187 | } |
188 | |
189 | for (i = 1; i < 8; ++i) |
190 | { |
191 | do_test (align1: i, align2: 2 * i, len: (8 << i), dlen: (8 << i) + 1, max_char: 127); |
192 | do_test (align1: 2 * i, align2: i, len: (8 << i), dlen: (8 << i) + 1, max_char: 255); |
193 | do_test (align1: i, align2: i, len: (8 << i), dlen: (8 << i) + 1, max_char: 127); |
194 | do_test (align1: i, align2: i, len: (8 << i), dlen: (8 << i) + 1, max_char: 255); |
195 | } |
196 | |
197 | for (i = 0; i < 16; ++i) |
198 | { |
199 | do_test (align1: 0, align2: 0, len: i, dlen: i + 256, max_char: 127); |
200 | do_test (align1: 0, align2: 0, len: i, dlen: i + 256, max_char: 255); |
201 | do_test (align1: 0, align2: i, len: i, dlen: i + 256, max_char: 127); |
202 | do_test (align1: i, align2: 0, len: i, dlen: i + 256, max_char: 255); |
203 | } |
204 | |
205 | for (i = 1; i < 8; ++i) |
206 | { |
207 | do_test (align1: 0, align2: 0, len: 8 << i, dlen: (8 << i) + 256, max_char: 127); |
208 | do_test (align1: 8 - i, align2: 2 * i, len: (8 << i), dlen: (8 << i) + 256, max_char: 127); |
209 | } |
210 | |
211 | for (i = 1; i < 8; ++i) |
212 | { |
213 | do_test (align1: i, align2: 2 * i, len: (8 << i), dlen: (8 << i) + 256, max_char: 127); |
214 | do_test (align1: 2 * i, align2: i, len: (8 << i), dlen: (8 << i) + 256, max_char: 255); |
215 | do_test (align1: i, align2: i, len: (8 << i), dlen: (8 << i) + 256, max_char: 127); |
216 | do_test (align1: i, align2: i, len: (8 << i), dlen: (8 << i) + 256, max_char: 255); |
217 | } |
218 | |
219 | for (i = 0; i < 16; ++i) |
220 | { |
221 | do_test (align1: 0, align2: 0, len: i, dlen: i, max_char: 127); |
222 | do_test (align1: 0, align2: 0, len: i, dlen: i + 2, max_char: 255); |
223 | do_test (align1: 0, align2: i, len: i, dlen: i + 3, max_char: 127); |
224 | do_test (align1: i, align2: 0, len: i, dlen: i + 4, max_char: 255); |
225 | } |
226 | |
227 | for (i = 1; i < 8; ++i) |
228 | { |
229 | do_test (align1: 0, align2: 0, len: 8 << i, dlen: (8 << i) - 15, max_char: 127); |
230 | do_test (align1: 8 - i, align2: 2 * i, len: (8 << i), dlen: (8 << i) + 5, max_char: 127); |
231 | } |
232 | |
233 | for (i = 1; i < 8; ++i) |
234 | { |
235 | do_test (align1: i, align2: 2 * i, len: (8 << i), dlen: (8 << i) + i, max_char: 127); |
236 | do_test (align1: 2 * i, align2: i, len: (8 << i), dlen: (8 << i) + (i - 1), max_char: 255); |
237 | do_test (align1: i, align2: i, len: (8 << i), dlen: (8 << i) + i + 2, max_char: 127); |
238 | do_test (align1: i, align2: i, len: (8 << i), dlen: (8 << i) + i + 3, max_char: 255); |
239 | } |
240 | |
241 | return 0; |
242 | } |
243 | |
244 | #include <support/test-driver.c> |
245 | |