mirror of
https://github.com/mstorsjo/llvm-mingw
synced 2026-06-21 14:01:00 +00:00
65 lines
1.9 KiB
C
65 lines
1.9 KiB
C
/*
|
|
* Copyright (c) 2018 Martin Storsjo
|
|
*
|
|
* This file is part of llvm-mingw.
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <setjmp.h>
|
|
#include <stdlib.h>
|
|
#include <math.h>
|
|
|
|
jmp_buf jmp;
|
|
|
|
int fibonacci(int val) {
|
|
char buf[100];
|
|
if (val <= 1) {
|
|
longjmp(jmp, 1);
|
|
return val;
|
|
}
|
|
snprintf(buf, sizeof(buf), "fibonacci(%d)", val);
|
|
printf("%s\n", buf);
|
|
return fibonacci(val - 1) + fibonacci(val - 2);
|
|
}
|
|
|
|
double check_d, check_cos;
|
|
|
|
int main(int argc, char* argv[]) {
|
|
int val = 10, ret;
|
|
double val2 = 3.14;
|
|
if (argc > 1)
|
|
val = atoi(argv[1]);
|
|
if (argc > 2)
|
|
val2 = atof(argv[2]);
|
|
double d = sin(val2);
|
|
printf("d = %f\n", d);
|
|
printf("cos = %f\n", cos(val2));
|
|
printf("size = %d, %p\n", (int) sizeof(jmp), jmp);
|
|
check_d = d;
|
|
check_cos = cos(val2);
|
|
if ((ret = setjmp(jmp)) != 0) {
|
|
printf("setjmp returned %d\n", ret);
|
|
printf("d = %f\n", d);
|
|
printf("cos = %f\n", cos(val2));
|
|
if (d != check_d || cos(val2) != check_cos) {
|
|
printf("local variables were clobbered\n");
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
printf("fibonacci(%d) = %d\n", val, fibonacci(val));
|
|
return 1;
|
|
}
|