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
|
// Derived from test case from the memory model study group of SC22 WG14
// For this test, behaviour is defined in the PNVI-ae-udi memory model.
/*
Original test copyright (c) 2012-2016 David Chisnall, Kayvan Memarian, and Peter Sewell.
Permission to use, copy, modify, and/or distribute this software for
any purpose with or without fee is hereby granted, provided that the
above copyright notice and this permission notice appear in all
copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
PERFORMANCE OF THIS SOFTWARE.
*/
// Adapted for SDCC by Philipp Klaus Krause in 2020.
#include <testfwk.h>
#pragma disable_warning 127
#include <stdint.h>
#include <limits.h>
int x=1;
void
testMM(void)
{
int *p = &x;
uintptr_t i = (uintptr_t)p;
int uintptr_t_width = sizeof(uintptr_t) * CHAR_BIT;
uintptr_t bit, j;
int k;
j=0;
for (k=0; k<uintptr_t_width; k++) {
bit = (i & (((uintptr_t)1) << k)) >> k;
if (bit == 1)
j = j | ((uintptr_t)1 << k);
else
j = j;
}
int *q = (int *)j;
*q = 11; // is this free of undefined behaviour?
ASSERT (*p == *q);
}
|
