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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
#include <stdarg.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include "panic.h"
/* adapted from <http://www.strudel.org.uk/itoa/> */
char* itoa(int val, int base)
{
static char buf[32] = {0};
int neg = 0;
if(val < 0)
{
val = -val;
neg = 1;
}
int i = 30;
do
{
buf[i] = "0123456789abcdef"[val % base];
--i;
val /= base;
}
while(val && i);
if(neg)
{
buf[i] = '-';
}
return &buf[i+(neg?0:1)];
}
#define RAND_A1 12
#define RAND_A2 25
#define RAND_A3 27
#define RAND_C1 4101842887655102017LL
#define RAND_C2 2685821657736338717LL
static uint64_t rand_state = RAND_C1;
uint64_t rand64(void)
{
/* Marsaglia's Xorshift generator combined with a LCRNG */
rand_state ^= rand_state >> RAND_A1;
rand_state ^= rand_state << RAND_A2;
rand_state ^= rand_state >> RAND_A3;
return rand_state * RAND_C2;
}
static uint64_t rand_temp;
static int bytes_left = 0;
unsigned int rand(void)
{
if(bytes_left < 4)
{
rand_temp = rand64();
bytes_left = 8;
}
unsigned int ret = rand_temp & 0xFFFFFFFF;
rand_temp >>= 32;
bytes_left -= 4;
return ret;
}
void srand(uint64_t seed)
{
if(seed == RAND_C1)
seed = RAND_C1 + 1;
rand_state = RAND_C1 ^ seed;
}
int abs(int val)
{
return (val<0?-val:val);
}
void *malloc(size_t sz)
{
return kmalloc(sz);
static uint8_t mallocbuf[1024*1024*16];
static uint8_t *next_ptr = mallocbuf;
static int bytes_left = sizeof(mallocbuf);
bytes_left -= sz;
if(bytes_left < 0)
return NULL;
else
{
void *ret = next_ptr;
next_ptr += sz;
return ret;
}
}
static inline int snputs(char *buf, int idx, int sz, const char *str)
{
while(idx < sz && *str)
{
buf[idx++] = *str++;
}
return idx;
}
static char hex_table[16] = { '0', '1', '2', '3', '4', '5', '6', '7',
'8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
static inline int snprint_hex(char *buf, int idx, int sz, unsigned int n)
{
unsigned mask = 0xF0000000;
unsigned shift = 28;
while(mask && idx < sz)
{
buf[idx++] = hex_table[(n & mask) >> shift];
mask >>= 4;
shift -= 4;
}
return idx;
}
int snprintf(char *buf, int sz, const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
int i = 0;
/* leave room for the null! */
sz--;
while(*fmt && i < sz)
{
char ch = *fmt++;
switch(ch)
{
case '%':
{
switch(*fmt++)
{
case 'c':
buf[i++] = va_arg(ap, int);
break;
case 's':
i = snputs(buf, i, sz, va_arg(ap, const char*));
break;
case 'x':
i = snprint_hex(buf, i, sz, va_arg(ap, unsigned));
break;
case 'd':
i = snputs(buf, i, sz, itoa(va_arg(ap, unsigned), 10));
break;
default:
i = snputs(buf, i, sz, "snprintf: unknown format\n");
break;
}
break;
}
default:
buf[i++] = ch;
break;
}
}
buf[i] = '\0';
va_end(ap);
return 0;
}
void assert_fail(const char *func, const char *file, int line)
{
printf("\nAssertion failed in function %s in file %s, line %d\n", func, file, line);
panic("assertion failed!\n");
}
|
