Unified · Split
| @@ -1,6 +1,6 @@ | ||
| 1 | 1 | f(2 * (y+1)) + f(2 * (f(2 * (z[0])))) % f(2 * (0)) + t(1); |
| 2 | −f(2 * (2 +(3,4)-0,1)) | f(2 * (~ 5)) & f(2 * (0,1))^m(0,1); | |
| 2 | +f(2 * (2+(3,4)-0,1)) | f(2 * (~ 5)) & f(2 * (0,1))^m(0,1); | |
| 3 | 3 | |
| 4 | 4 | char c[2][6] = { "hello", "" }; |
| 5 | 5 | f(2 * (y+1)) + f(2 * (f(2 * (z[0])))) % f(2 * (0)) + t(1); |
| 6 | −f(2 * (2 +(3,4)-0,1)) | f(2 * (~ 5)) & f(2 * (0,1))^m(0,1); | |
| 6 | +f(2 * (2+(3,4)-0,1)) | f(2 * (~ 5)) & f(2 * (0,1))^m(0,1); | |
| @@ -1,11 +1,13 @@ | ||
| 1 | −extern int printf(const char *format, ...); | |
| 2 | −#define P ++ | |
| 3 | −#define n(x) x | |
| 1 | +#define W Z | |
| 2 | +#define Z(X) W(X,2) | |
| 3 | +#define Y(X) Z(X) | |
| 4 | +#define X Y | |
| 5 | +return X(X(1)); | |
| 4 | 6 | |
| 5 | −int main(void) | |
| 6 | −{ | |
| 7 | − int a = 0, b = -1; | |
| 8 | − int i1 = a P+P b; | |
| 9 | − printf("i1 = %d\n", i1); | |
| 10 | − return n(0x1e)n(-1); | |
| 11 | −} | |
| 7 | +#define P Q | |
| 8 | +#define Q(n) P(n,2) | |
| 9 | +return P(1); | |
| 10 | + | |
| 11 | +#define A (B * B) | |
| 12 | +#define B (A + A) | |
| 13 | +return A + B; | |
| @@ -1,8 +1,3 @@ | ||
| 1 | −extern int printf(const char *format, ...); | |
| 2 | −int main(void) | |
| 3 | −{ | |
| 4 | − int a = 0, b = -1; | |
| 5 | − int i1 = a +++ ++ b; | |
| 6 | − printf("i1 = %d\n", i1); | |
| 7 | − return 0x1e -1; | |
| 8 | −} | |
| 1 | +return Z(Z(1,2),2); | |
| 2 | +return Q(1,2); | |
| 3 | +return ((A + A) * (A + A)) + ((B * B) + (B * B)); | |
| @@ -1,26 +0,0 @@ | ||
| 1 | −#define Y(x) Z(x) | |
| 2 | −#define X Y | |
| 3 | −X(1) | |
| 4 | −X(X(1)) | |
| 5 | −X(X(X(X(X(1))))) | |
| 6 | − | |
| 7 | −#define A B | |
| 8 | −#define B A | |
| 9 | −return A + B; | |
| 10 | − | |
| 11 | −#undef A | |
| 12 | −#undef B | |
| 13 | − | |
| 14 | −#define A B+1 | |
| 15 | −#define B A | |
| 16 | −return A + B; | |
| 17 | − | |
| 18 | −#define A1 B1+1 | |
| 19 | −#define B1 C1+2 | |
| 20 | −#define C1 A1+3 | |
| 21 | −return A1 + B1; | |
| 22 | − | |
| 23 | −#define i() x | |
| 24 | −#define n() 1 | |
| 25 | −i()i()n()n()i() | |
| 26 | −i()+i()-n()+n()- | |
| @@ -1,26 +0,0 @@ | ||
| 1 | − | |
| 2 | − | |
| 3 | −Z(1) | |
| 4 | −Z(Z(1)) | |
| 5 | −Z(Z(Z(Z(Z(1))))) | |
| 6 | − | |
| 7 | − | |
| 8 | − | |
| 9 | −return A + B; | |
| 10 | − | |
| 11 | − | |
| 12 | − | |
| 13 | − | |
| 14 | − | |
| 15 | − | |
| 16 | −return A+1 + B+1; | |
| 17 | − | |
| 18 | − | |
| 19 | − | |
| 20 | − | |
| 21 | −return A1+3 +2 +1 + B1+1 +3 +2; | |
| 22 | − | |
| 23 | − | |
| 24 | − | |
| 25 | −x x 1 1 x | |
| 26 | −x+x-1 +1 - | |
| @@ -3,6 +3,7 @@ · 2 unmodified lines | ||
| 3 | 3 | # |
| 4 | 4 | |
| 5 | 5 | TCC = ../../tcc |
| 6 | + | |
| 6 | 7 | TESTS = $(patsubst %.c,%.test,$(wildcard *.c)) |
| 7 | 8 | TESTS += $(patsubst %.S,%.test,$(wildcard *.S)) |
| 8 | 9 | |
| @@ -35,8 +36,8 @@ DIFF_OPTS = -Nu -b -B -I "^\#" · 26 unmodified lines | ||
| 35 | 36 | clean: |
| 36 | 37 | rm -vf *.output |
| 37 | 38 | |
| 38 | −02.test : DIFF_OPTS += -w | |
| 39 | −15.test : DIFF_OPTS += -w | |
| 39 | +# 02.test : DIFF_OPTS += -w | |
| 40 | +# 15.test : DIFF_OPTS += -w | |
| 40 | 41 | |
| 41 | 42 | # diff options: |
| 42 | 43 | # -b ighore space changes |