titaniumtown/os161-assignments
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

clang-format

Browse Source
This commit is contained in:
Simon Gardling
2024-09-10 13:03:02 -04:00
parent 53c617d779
commit d66450e427
381 changed files with 28864 additions and 34170 deletions
Download Patch File Download Diff File Expand all files Collapse all files

261
userland/testbin/bigfork/bigfork.c
View File

@@ -54,186 +54,145 @@
*/
#define DIM 64
static int m1[DIM*DIM], m2[DIM*DIM], m3[DIM*DIM], m4[DIM*DIM];
static int m1[DIM * DIM], m2[DIM * DIM], m3[DIM * DIM], m4[DIM * DIM];
static const int right[BRANCHES] = {
536763422,
478946723,
375722852,
369910585,
328220902,
62977821,
536763422, 478946723, 375722852, 369910585, 328220902, 62977821,
};
static unsigned failures;
static
void
init(void)
{
unsigned i, j;
static void init(void) {
unsigned i, j;
srandom(73771);
for (i=0; i<DIM; i++) {
for (j=0; j<DIM; j++) {
m1[i*DIM+j] = random() % 11 - 5;
}
}
srandom(73771);
for (i = 0; i < DIM; i++) {
for (j = 0; j < DIM; j++) {
m1[i * DIM + j] = random() % 11 - 5;
}
}
}
static
void
add(int *x, const int *a, const int *b)
{
unsigned i, j;
static void add(int *x, const int *a, const int *b) {
unsigned i, j;
for (i=0; i<DIM; i++) {
for (j=0; j<DIM; j++) {
x[i*DIM+j] = a[i*DIM+j] + b[i*DIM+j];
}
}
for (i = 0; i < DIM; i++) {
for (j = 0; j < DIM; j++) {
x[i * DIM + j] = a[i * DIM + j] + b[i * DIM + j];
}
}
}
static
void
mul(int *x, const int *a, const int *b)
{
unsigned i, j, k;
static void mul(int *x, const int *a, const int *b) {
unsigned i, j, k;
for (i=0; i<DIM; i++) {
for (j=0; j<DIM; j++) {
x[i*DIM+j] = 0;
for (k=0; k<DIM; k++) {
x[i*DIM+j] += a[i*DIM+k] * b[k*DIM+j];
}
}
}
for (i = 0; i < DIM; i++) {
for (j = 0; j < DIM; j++) {
x[i * DIM + j] = 0;
for (k = 0; k < DIM; k++) {
x[i * DIM + j] += a[i * DIM + k] * b[k * DIM + j];
}
}
}
}
static
void
scale(int *x, const int *a, int b)
{
unsigned i, j;
static void scale(int *x, const int *a, int b) {
unsigned i, j;
for (i=0; i<DIM; i++) {
for (j=0; j<DIM; j++) {
x[i*DIM+j] = a[i*DIM+j] / b;
}
}
for (i = 0; i < DIM; i++) {
for (j = 0; j < DIM; j++) {
x[i * DIM + j] = a[i * DIM + j] / b;
}
}
}
static
void
grind(void)
{
/*
* compute: m2 = m1*m1, m3 = m2+m1, m4 = m3*m3, m1 = m4 / 2
*/
mul(m2, m1, m1);
add(m3, m2, m1);
mul(m4, m3, m3);
scale(m1, m4, 2);
static void grind(void) {
/*
* compute: m2 = m1*m1, m3 = m2+m1, m4 = m3*m3, m1 = m4 / 2
*/
mul(m2, m1, m1);
add(m3, m2, m1);
mul(m4, m3, m3);
scale(m1, m4, 2);
}
static
int
trace(void)
{
unsigned i;
int val = 0;
static int trace(void) {
unsigned i;
int val = 0;
for (i=0; i<DIM; i++) {
val += m1[i*DIM+i];
}
while (val < 0) {
val += 0x20000000;
}
return val % 0x20000000;
for (i = 0; i < DIM; i++) {
val += m1[i * DIM + i];
}
while (val < 0) {
val += 0x20000000;
}
return val % 0x20000000;
}
static
pid_t
dofork(void)
{
pid_t pid;
static pid_t dofork(void) {
pid_t pid;
pid = fork();
if (pid < 0) {
warn("fork");
}
return pid;
pid = fork();
if (pid < 0) {
warn("fork");
}
return pid;
}
static
void
dowait(pid_t pid)
{
int status;
static void dowait(pid_t pid) {
int status;
if (pid == -1) {
failures++;
return;
}
if (pid == 0) {
exit(failures);
}
else {
if (waitpid(pid, &status, 0) < 0) {
warn("waitpid(%d)", pid);
}
else if (WIFSIGNALED(status)) {
warnx("pid %d: signal %d", pid, WTERMSIG(status));
}
else if (WEXITSTATUS(status) > 0) {
failures += WEXITSTATUS(status);
}
}
if (pid == -1) {
failures++;
return;
}
if (pid == 0) {
exit(failures);
} else {
if (waitpid(pid, &status, 0) < 0) {
warn("waitpid(%d)", pid);
} else if (WIFSIGNALED(status)) {
warnx("pid %d: signal %d", pid, WTERMSIG(status));
} else if (WEXITSTATUS(status) > 0) {
failures += WEXITSTATUS(status);
}
}
}
static
void
dotest(void)
{
unsigned i, me;
pid_t pids[BRANCHES];
int t;
char msg[128];
static void dotest(void) {
unsigned i, me;
pid_t pids[BRANCHES];
int t;
char msg[128];
me = 0;
for (i=0; i<BRANCHES; i++) {
pids[i] = dofork();
if (pids[i] == 0) {
me += 1U<<i;
}
grind();
t = trace();
if (t == right[i]) {
snprintf(msg, sizeof(msg),
"Stage %u #%u done: %d\n", i, me, trace());
}
else {
snprintf(msg, sizeof(msg),
"Stage %u #%u FAILED: got %d, expected %d\n",
i, me, t, right[i]);
failures++;
}
(void)write(STDOUT_FILENO, msg, strlen(msg));
}
me = 0;
for (i = 0; i < BRANCHES; i++) {
pids[i] = dofork();
if (pids[i] == 0) {
me += 1U << i;
}
grind();
t = trace();
if (t == right[i]) {
snprintf(msg, sizeof(msg), "Stage %u #%u done: %d\n", i, me, trace());
} else {
snprintf(msg, sizeof(msg), "Stage %u #%u FAILED: got %d, expected %d\n",
i, me, t, right[i]);
failures++;
}
(void)write(STDOUT_FILENO, msg, strlen(msg));
}
for (i=BRANCHES; i-- > 0; ) {
dowait(pids[i]);
}
if (failures > 0) {
printf("%u failures.\n", failures);
}
else {
printf("Done.\n");
}
for (i = BRANCHES; i-- > 0;) {
dowait(pids[i]);
}
if (failures > 0) {
printf("%u failures.\n", failures);
} else {
printf("Done.\n");
}
}
int
main(void)
{
init();
dotest();
return 0;
int main(void) {
init();
dotest();
return 0;
}