mes/scaffold/tests/60-math.c
Jan Nieuwenhuizen 25047c7606
test: Remove 30-test.i indirection.
* include/30-test.i: Remove.
* scaffold/tests/30-strlen.c: Remove 30-test.i indirection.
* scaffold/tests/31-eputs.c: Likewise.
* scaffold/tests/32-compare.c: Likewise.
* scaffold/tests/33-and-or.c: Likewise.
* scaffold/tests/34-pre-post.c: Likewise.
* scaffold/tests/35-compare-char.c: Likewise.
* scaffold/tests/36-compare-arithmetic.c: Likewise.
* scaffold/tests/37-compare-assign.c: Likewise.
* scaffold/tests/38-compare-call.c: Likewise.
* scaffold/tests/40-if-else.c: Likewise.
* scaffold/tests/41-?.c: Likewise.
* scaffold/tests/42-goto-label.c: Likewise.
* scaffold/tests/43-for-do-while.c: Likewise.
* scaffold/tests/44-switch.c: Likewise.
* scaffold/tests/45-void-call.c: Likewise.
* scaffold/tests/46-function-static.c: Likewise.
* scaffold/tests/50-assert.c: Likewise.
* scaffold/tests/51-strcmp.c: Likewise.
* scaffold/tests/52-itoa.c: Likewise.
* scaffold/tests/53-strcpy.c: Likewise.
* scaffold/tests/60-math.c: Likewise.
* scaffold/tests/63-struct-cell.c: Likewise.
* scaffold/tests/64-make-cell.c: Likewise.
* scaffold/tests/65-read.c: Likewise.
* scaffold/tests/66-local-char-array.c: Likewise.
* scaffold/tests/70-printf.c: Likewise.
* scaffold/tests/71-struct-array.c: Likewise.
* scaffold/tests/72-typedef-struct-def.c: Likewise.
* scaffold/tests/73-union.c: Likewise.
* scaffold/tests/74-multi-line-string.c: Likewise.
* scaffold/tests/75-struct-union.c: Likewise.
* scaffold/tests/76-pointer-arithmetic.c: Likewise.
* scaffold/tests/77-pointer-assign.c: Likewise.
* scaffold/tests/78-union-struct.c: Likewise.
* scaffold/tests/79-int-array.c: Likewise.
* scaffold/tests/7a-struct-char-array.c: Likewise.
* scaffold/tests/7b-struct-int-array.c: Likewise.
* scaffold/tests/7c-dynarray.c: Likewise.
* scaffold/tests/7d-cast-char.c: Likewise.
* scaffold/tests/7e-struct-array-access.c: Likewise.
* scaffold/tests/7f-struct-pointer-arithmetic.c: Likewise.
* scaffold/tests/7g-struct-byte-word-field.c: Likewise.
* scaffold/tests/7h-struct-assign.c: Likewise.
* scaffold/tests/7i-struct-struct.c: Likewise.
* scaffold/tests/7j-strtoull.c: Likewise.
* scaffold/tests/7k-for-each-elem.c: Likewise.
* scaffold/tests/7l-struct-any-size-array.c: Likewise.
* scaffold/tests/7m-struct-char-array-assign.c: Likewise.
* scaffold/tests/7n-struct-struct-array.c: Likewise.
* scaffold/tests/80-setjmp.c: Likewise.
* scaffold/tests/81-qsort.c: Likewise.
* scaffold/tests/86-strncpy.c: Likewise.
* scaffold/tests/87-sscanf.c: Likewise.
2018-08-15 18:01:14 +02:00

177 lines
3.1 KiB
C

/* -*-comment-start: "//";comment-end:""-*-
* GNU Mes --- Maxwell Equations of Software
* Copyright © 2017 Jan (janneke) Nieuwenhuizen <janneke@gnu.org>
*
* This file is part of GNU Mes.
*
* GNU Mes is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or (at
* your option) any later version.
*
* GNU Mes is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Mes. If not, see <http://www.gnu.org/licenses/>.
*/
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <libmes.h>
int
add (int a, int b)
{
return a + b;
}
int
inc (int i)
{
return i + 1;
}
int
main ()
{
int i;
puts ("\n");
puts ("t: 0 < 0\n");
if (0 < 0) return 1;
puts ("t: 2 < 1\n");
if (2 < 1) return 2;
puts ("t: -1 < -2\n");
if (-1 < -2) return 3;
puts ("t: 0 < -1\n");
if (0 < -1) return 4;
puts ("t: 0 > 0\n");
if (0 > 0) return 5;
puts ("t: 1 > 2\n");
if (1 > 2) return 6;
puts ("t: -2 > -1\n");
if (-2 > -1) return 7;
puts ("t: -1 > 0\n");
if (-1 > 0) return 9;
puts ("t: 1 == inc (0)\n");
if (1 == inc (0)) goto ok0;
return 10;
ok0:
puts ("t: 0 < inc (0)\n");
if (0 < inc (0)) goto ok1;
return 11;
ok1:
puts ("t: inc (0) + 2 != 3\n");
if (inc (0) + inc (1) != 3) return 12;
puts ("t: 4/2=");
i = 4 / 2;
if (i!=2) return 13;
i += 48;
putchar (i);
puts ("\n");
puts ("t: 3*4=\n");
i = 3 * 4;
if (i!=12) return 14;
puts ("t: i /= 4\n");
i /= 4;
if (i!=3) return 15;
puts ("t: i *= 4\n");
i *= 4;
if (i!=12) return 16;
puts ("t: 1 << 3\n");
if (1 << 3 != 8) return 1 << 3;
puts ("t: 3 << 4\n");
if (3 << 4 != 48) return 3 << 4;
puts ("t: 48 >> 3\n");
if (48 >> 4 != 3) return 48 >> 4;
puts ("t: 10 >> 1\n");
if (10 >> 1 != 5) return 10 >> 1;
puts ("t: 1 | 4\n");
if ((1 | 4) != 5) return 1 | 4;
i = -3;
puts ("t: -i\n");
if (-i != 3) return 22;
puts ("t: -1 + 2\n");
if (-1 + 2 != 1) return 23;
puts ("t: 1 & 3\n");
if ((1 & 3) != 1) return 24;
puts ("t: ~0\n");
if (~0 != -1) return 25;
puts ("t: 1 | 3\n");
if ((1 | 2) != 3) return 26;
puts ("t: ^ 1 \n");
if ((1 ^ 3) != 2) return 27;
puts ("t: 3 == 3\n");
if ((3 == 3) != 1) return 28;
puts ("t: 3 != 3\n");
if ((3 != 3) != 0) return 29;
puts ("t: 011 == 15\n");
if (011 != 9) return 30;
puts ("t: 0b11 == 3\n");
if (0b11 != 3) return 31;
puts ("t: 0x11 == 3\n");
if (0x11 != 17) return 32;
puts ("t: i = INT_MAX\n");
i = INT_MAX;
if (strcmp ("2147483647", itoa (i)))
return 33;
puts ("t: i = 2147483646\n");
i = 2147483646;
puts ("t: i++\n");
i++;
puts ("t: i = INT_MIN\n");
i = INT_MIN;
if (strcmp ("-2147483648", itoa (i)))
return 34;
puts ("t: i = -2147483647\n");
i = -2147483647;
puts ("t: i--\n");
i--;
return 0;
}