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
|
extern void exit (int);
extern void abort (void);
typedef unsigned int u_int32_t;
typedef unsigned char u_int8_t;
typedef int int32_t;
typedef enum {
TXNLIST_DELETE,
TXNLIST_LSN,
TXNLIST_TXNID,
TXNLIST_PGNO
} db_txnlist_type;
struct __db_lsn; typedef struct __db_lsn DB_LSN;
struct __db_lsn {
u_int32_t file;
u_int32_t offset;
};
struct __db_txnlist; typedef struct __db_txnlist DB_TXNLIST;
struct __db_txnlist {
db_txnlist_type type;
struct { struct __db_txnlist *le_next; struct __db_txnlist **le_prev; } links;
union {
struct {
u_int32_t txnid;
int32_t generation;
int32_t aborted;
} t;
struct {
u_int32_t flags;
int32_t fileid;
u_int32_t count;
char *fname;
} d;
struct {
int32_t ntxns;
int32_t maxn;
DB_LSN *lsn_array;
} l;
struct {
int32_t nentries;
int32_t maxentry;
char *fname;
int32_t fileid;
void *pgno_array;
u_int8_t uid[20];
} p;
} u;
};
int log_compare (const DB_LSN *a, const DB_LSN *b)
{
return 1;
}
int
__db_txnlist_lsnadd(int val, DB_TXNLIST *elp, DB_LSN *lsnp, u_int32_t flags)
{
int i;
for (i = 0; i < (!(flags & (0x1)) ? 1 : elp->u.l.ntxns); i++)
{
int __j;
DB_LSN __tmp;
val++;
for (__j = 0; __j < elp->u.l.ntxns - 1; __j++)
if (log_compare(&elp->u.l.lsn_array[__j], &elp->u.l.lsn_array[__j + 1]) < 0)
{
__tmp = elp->u.l.lsn_array[__j];
elp->u.l.lsn_array[__j] = elp->u.l.lsn_array[__j + 1];
elp->u.l.lsn_array[__j + 1] = __tmp;
}
}
*lsnp = elp->u.l.lsn_array[0];
return val;
}
#ifndef STACK_SIZE
#define VLEN 1235
#else
#define VLEN (STACK_SIZE/10)
#endif
int main (void)
{
DB_TXNLIST el;
DB_LSN lsn, lsn_a[VLEN];
el.u.l.ntxns = VLEN-1;
el.u.l.lsn_array = lsn_a;
if (__db_txnlist_lsnadd (0, &el, &lsn, 0) != 1)
abort ();
if (__db_txnlist_lsnadd (0, &el, &lsn, 1) != VLEN-1)
abort ();
exit (0);
}
|
