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
|
/*
bug3565757.c
*/
#include <testfwk.h>
#pragma std_c99
#pragma disable_warning 85
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
typedef uint_least16_t edge_index_t;
struct edge_t
{
uint_fast8_t u[2];
uint_fast8_t v[2];
edge_index_t prev;
edge_index_t next;
bool in_stix;
};
#ifndef __SDCC_pdk14 // Lack of memory
struct edge_t edges[4];
void init_edges(void)
{
}
void get_edge(struct edge_t *const e, const edge_index_t e_i)
{
}
void set_edge(const edge_index_t e_i, const struct edge_t *const e)
{
memcpy(edges + e_i, e, sizeof(struct edge_t));
}
const uint_fast8_t vertices[4][2] = {{7, 188}, {248, 188}, {248, 9}, {7, 9}};
struct edge_t edge_cache;
void init_geometry(void)
{
edge_index_t i;
init_edges();
for(i = 0; i < 4; i++)
{
get_edge(&edge_cache, i);
edge_cache.u[0] = vertices[(i + 0) % 4][0];
edge_cache.u[1] = vertices[(i + 0) % 4][1];
edge_cache.v[0] = vertices[(i + 1) % 4][0];
edge_cache.v[1] = vertices[(i + 1) % 4][1];
edge_cache.prev = (i + 3) % 4;
edge_cache.next = (i + 1) % 4;
set_edge(i, &edge_cache);
}
}
#endif
void testBug(void)
{
#ifndef __SDCC_pdk14 // Lack of memory
init_geometry();
ASSERT(edges[0].prev = 3);
ASSERT(edges[3].prev = 2);
#endif
}
|
