adlint 1.0.0

data/share/demo/bad_indent/bad_indent.c

@@ -0,0 +1,50 @@
+typedef enum { R = 1, G, B } color_t;
+
+color_t c;
+
+int main(int argc, char *argv[])
+{
+    if (argc < 2)
+    exit(1);
+
+for (int i = 0; i < argc; ++i)
+puts(argv[i]);
+
+    while (1)
+        puts("hello world\n");
+
+    if (c == 3)
+        for (int i = 0; i < argc; ++i)
+            puts(argv[i]);
+
+    if (argc < 3)
+        exit(1);
+    else
+            do
+        puts("hoge\n");
+            while (rand());
+
+    if (argc < 4)
+        exit(1);
+    else if (rand()) {
+            puts("hogehoge\n");
+    }
+    else
+        if (rand())
+                puts("hogehogehoge\n");
+
+    switch (c) {
+    case R:
+        puts("kldfaj;\n");
+        puts("kldfaj;\n");
+    break;
+    case G:
+    case B:
+        puts("kldfaj;\n");
+    puts("kldfaj;\n");
+    default:
+puts("kldfaj;\n");
+    }
+
+    return 0;
+}

data/share/demo/bad_init/bad_init.c

@@ -0,0 +1,49 @@
+struct Foo {
+    int i;
+    int j;
+};
+
+union Bar {
+    int i;
+    long j;
+};
+
+static void foo(void)
+{
+    const struct Foo foo1 = { 1, 2 };
+    const struct Foo foo2 = 1;
+
+    const union Bar bar1 = { 1 };
+    const union Bar bar2 = 1;
+}
+
+struct Baz {
+    int i;
+    int a[3];
+};
+
+struct Qux {
+    int i;
+    union Bar u;
+};
+
+static void bar(void)
+{
+    const struct Foo foo1[2] = { { 1, 2 }, { 3, 4 } };
+    const struct Foo foo2[2] = { 1, 2, 3, 4 };
+
+    const union Bar bar1 = { 1 };
+    const union Bar bar2 = bar1;
+    const union Bar bar3 = foo1[0];
+
+    const struct Baz baz1 = { 1, { 2, 3 } };
+    const struct Baz baz2 = { 1, 2, 3 };
+    const struct Baz baz3 = baz1;
+    const struct Baz baz4 = foo1[0];
+
+    const struct Qux qux1 = { 1, { 2 } };
+    const struct Qux qux2 = { 1, 2 };
+
+    const int a1[2][2] = { { 1, 2 }, { 3, 4 } };
+    const int a2[2][2] = { 1, 2, 3, 4 };
+}

data/share/demo/bad_macro/bad_macro.c

@@ -0,0 +1,97 @@
+#define FUNC1(x, y) x + y
+#define FUNC2(x) (x * x)
+#define FUNC3(x, y) x##y
+#define FUNC4(x) #x
+
+#define MANY_PARAMS1(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z,aa,bb,cc,dd,ee)  1
+
+#define MANY_PARAMS2(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z,aa,bb,cc,dd,ee,ff)  1
+
+int main(void)
+{
+    const int i = FUNC1(1, 2);
+    const int j = FUNC2(2);
+    const int k = FUNC3(1, 2);
+    const char * const str = FUNC4(foo);
+
+    const int l = MANY_PARAMS1(1,1,1,1,1,1,1,1,1,1,
+                               1,1,1,1,1,1,1,1,1,1,
+                               1,1,1,1,1,1,1,1,1,1,
+                               1);
+
+    return MANY_PARAMS2(1,1,1,1,1,1,1,1,1,1,
+                        1,1,1,1,1,1,1,1,1,1,
+                        1,1,1,1,1,1,1,1,1,1,
+                        1,1);
+}
+
+static int foo(void)
+{
+#define FOO (1)
+    const int i = FOO;
+#undef FOO
+    return i;
+}
+
+#define MACRO1 { 0, 1, i }
+
+#define MACRO2(x) { 0, x, x + 1 }
+
+#define MACRO3(a, n) {                      \
+    int j;                                  \
+    for (j = 0; j < n; j++) {               \
+        a[j] = j;                           \
+    }                                       \
+}
+
+#define MACRO4(foo)                         \
+    do {                                    \
+        foo(0);                             \
+    } while (0)
+
+#define MACRO5 static const
+
+#define MACRO6 if (hoge) perror("hoge");
+
+#define MACRO7 {                            \
+    for (int i = 0; i < 10; i++) {          \
+        puts("hello world\n");              \
+    }                                       \
+}
+
+static void bar(int i)
+{
+    int a1[] = MACRO1;
+    int a2[] = MACRO2(3);
+
+    MACRO3;
+
+    if (i == 0)
+        MACRO4(bar);
+
+    {
+        MACRO5 int hoge;
+        MACRO6
+    }
+
+    MACRO7;
+}
+
+#define ADD +
+#define SUB -
+#define MUL *
+#define DIV /
+#define MOD %
+
+#define WHILE while
+#define DO do
+#define FOR for
+#define IF if
+#define ELSE else
+#define SWITCH switch
+#define CASE case
+#define DEFAULT default
+#define GOTO goto
+#define RETURN return
+#define BREAK break
+#define CONTINUE continue

data/share/demo/bitwise_expr/bitwise_expr.c

@@ -0,0 +1,19 @@
+static void foo(const int i1, const int i2,
+        const unsigned char uc1, const unsigned char uc2)
+{
+    int i;
+
+    i = (int) (uc1 & uc2);
+    i = (int) (uc1 | uc2);
+    i = (int) (uc1 ^ uc2);
+    i = (int) ~uc1;
+    i = (int) (uc1 << 1);
+    i = (int) (uc1 >> 1);
+
+    i = i1 & i2;
+    i = i1 | i2;
+    i = i1 ^ i2;
+    i = ~i1;
+    i = i1 << i2;
+    i = i1 >> i2;
+}

data/share/demo/call_by_value/call_by_value.c

@@ -0,0 +1,26 @@
+struct Point {
+    int x;
+    int y;
+};
+
+typedef struct {
+    int r;
+    int g;
+    int b;
+} Color;
+
+extern void foo(struct Point);
+extern void bar(int, struct Point);
+extern void baz(int, Color, int);
+
+int main(void)
+{
+    struct Point point = { 1, 2 };
+    Color color = { 0, 1, 2 };
+
+    foo(point);
+    bar(0, point);
+    baz(0, color, 1);
+
+    return 0;
+}

data/share/demo/cross_ref/cross_ref.c

@@ -0,0 +1,21 @@
+extern int g;
+
+void foo(void)
+{
+    int * const p = &g;
+    *p = 0;
+}
+
+typedef struct {
+    int i;
+} type;
+
+type buf[3];
+type *p = &buf[1];
+
+void bar(void)
+{
+    type t = *p;
+    (*p).i = 1;
+    p->i += p->i;
+}

data/share/demo/dangling_else/dangling_else.c

@@ -0,0 +1,20 @@
+static void foo(const int i, const int j)
+{
+    if (i < 0)
+        if (j > 0) {
+            return 0;
+        }
+    else {
+        return 1;
+    }
+
+    if (i > 0)
+        if (j < 0) {
+            return 2;
+        }
+        else {
+            return 3;
+        }
+
+    return 4;
+}

data/share/demo/dead_code/dead_code.c

@@ -0,0 +1,237 @@
+extern void exit(int);
+extern int rand(void);
+
+static int foo(const int i, int);
+static int bar(const int i, int j);
+static int baz(const int, int);
+static int baz(const int j, int i);
+
+static int foo(const int i, int)
+{
+    if (i == 0) {
+        return 0;
+    }
+    else if (i == 1) {
+        exit(1);
+    }
+    else {
+        return 2;
+    }
+    return rand();
+}
+
+static int bar(const int i, int j)
+{
+    if (i < 0) {
+        unsigned short j = foo(1);
+        if (j < i) {
+            abort();
+        }
+        if (i == 0) {
+            abort();
+        }
+        exit(1);
+    }
+    else {
+        if (i == -2) {
+            abort();
+        }
+    }
+    /* i >= 0 */
+
+    if (i < 2) {
+        j = 3 / i;  /* i == 0..1 */
+    }
+
+    if (i < 1) {
+        j = 3 / i;  /* i == 0 */
+        return j;
+    }
+
+    return 3 / i; /* i == 1 */
+}
+
+static int baz(const int i, int j)
+{
+    if (i < 0) {
+        unsigned short j = foo(1, 2, 3);
+        if (j < i) {
+            abort();
+        }
+        if (i == 0) {
+            abort();
+        }
+        exit(1);
+    }
+    else {
+        if (i == -2) {
+            abort();
+        }
+    }
+    /* i >= 0 */
+
+    if (i < -3) {
+        abort();
+    }
+
+    if (i != 0) {
+        i = 1;
+    }
+    else {
+        return 0;
+    }
+    /* i == 1 */
+
+    if (i < 2) {
+        j = 3 / i;
+    }
+
+    if (i < 1) {
+        j = 3 / i;
+        return j;
+    }
+
+    return 3 / i;
+}
+
+static int qux(void)
+{
+    int i = foo(0);
+    int j;
+
+    if (i < 0) {
+        unsigned short j = foo(1);
+        if (j < i) {
+            abort();
+        }
+        if (i == 0) {
+            abort();
+        }
+        exit(1);
+    }
+    else {
+        if (i == -2) {
+            abort();
+        }
+    }
+    /* i >= 0 */
+
+    if (i == 0) {
+        i = 1;
+    }
+    else if (i == 1) {
+        i = 2;
+    }
+    /* i >= 1 */
+
+    if (i < 2) {
+        j = 3 / i;
+    }
+
+    if (i < 1) {
+        j = 3 / i;
+        return j;
+    }
+
+    return 3 / i;
+}
+
+static int foobar(void)
+{
+    int i;
+
+    if (1) {
+        i = foo(0);
+    }
+
+    if (0) {
+        return i;
+    }
+
+    if (1) {
+        i = foo(0);
+    }
+    else {
+        __adlint__eval("puts 'NOTREACHED'");
+        return 0;
+    }
+
+    if (0) {
+        __adlint__eval("puts 'NOTREACHED'");
+        return 0;
+    }
+    else {
+        i = foo(0);
+    }
+
+    do {
+        i = 0;
+    } while(0);
+
+    switch (i) {
+    case 0:
+        for (;;) {
+            i = 0;
+        }
+        break;
+    default:
+        i = 1;
+    }
+
+    return 3 / i;
+}
+
+int (*p)(const int j, int i) = &foo;
+
+int main(void)
+{
+    int i = foo(0);
+    int j;
+    int (*p)(const int x, int y) = bar;
+
+    p = baz;
+
+    if (i < 0) {
+        return 0;
+    }
+
+    if (i != 0) {
+        i = 1;
+    }
+    else {
+        return 0;
+    }
+    /* i == 1 */
+
+    if (i < 2) {
+        j = 3 / i;
+    }
+
+    if (i < 1) {
+        return 3 / i;
+    }
+
+    i = foo(0);
+
+    switch (i) {
+    case 0:
+        return 1;
+    case 1:
+        return 2;
+    case 2:
+    case 3:
+        return 3;
+    default:
+        return 4;
+        break;
+    }
+
+    if (i == 4) {
+        return 5;
+    }
+    else {
+        return 6;
+    }
+
+    return 0;
+}

data/share/demo/deep_nest/deep_nest.c

@@ -0,0 +1,57 @@
+int main(void)
+{
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) { /*10*/
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) { /*15*/
+    }}}}}}}}}}}}}}}
+
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) { /*10*/
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) {
+    if (1) { /*15*/
+    if (1) {
+    }}}}}}}}}}}}}}}}
+
+    if (1)
+    if (1)
+    if (1)
+    if (1)
+    if (1)
+    if (1)
+    if (1)
+    if (1)
+    if (1)
+    if (1) /*10*/
+    if (1)
+    if (1)
+    if (1)
+    if (1)
+    if (1)/*15*/
+    if (1)
+        ;
+
+    return 0;
+}

data/share/demo/dense_switch/dense_switch.c

@@ -0,0 +1,62 @@
+int main(void)
+{
+    const int i = rand();
+    int j;
+
+    switch (i) {
+    case 0:
+        j = 3 / i;
+    case 1:
+        j = 3 / i;
+        if (i == 0)
+            case 3: j = 3 / i;
+        if (i == 0 || i == 1) {
+            case 2: j = 3 / i;
+        }
+        else {
+            __adlint__inspect(i);
+            j = 3 / i;
+        }
+        switch (i) {
+        default:
+            j = 3 / i;
+            break;
+        case 0:
+            j = 3 / i;
+        case 1:
+            j = 3 / i;
+        }
+        break;
+    default:
+        j = 3 / i;
+    }
+
+    switch (i) {
+    case 0:
+        if (i < j) {
+            break;
+        }
+        while (i > j) {
+            break;
+        }
+        j += i;
+        break;
+    default:
+        switch (i) {
+        default:
+            j = 3 / i;
+            break;
+        case 1:
+            if (i < j) {
+                break;
+            }
+            if (i < j + 1) {
+                break;
+            }
+            j += i;
+            break;
+        }
+    }
+
+    return j;
+}

data/share/demo/direct_recur/direct_recur.c

@@ -0,0 +1,15 @@
+static int fact(const int n)
+{
+    return (n == 1) ? 1 : (n * fact(n - 1));
+}
+
+extern int printf();
+
+int main(void)
+{
+    const int i = fact(5);
+
+    printf("%d", i);
+
+    return 0;
+}

data/share/demo/div_by_zero/div_by_zero.c

@@ -0,0 +1,35 @@
+extern int rand(void);
+
+int foo(void)
+{
+    const int i = rand();
+
+    return 3 / i; /* div by 0 when rand() returns 0 */
+}
+
+int bar(const int n)
+{
+    int c;
+    int i = 1;
+
+    for (c = 0; c < n; ++c) {
+        i = c;
+    }
+
+    i = 3 / i; /* div by zero when 1 is passed as parameter n */
+
+    for (c = 0; c < n; ++c) {
+        if (c % 2 == 0) {
+            i = 0;
+        }
+    }
+
+    i = 3 / i; /* div by zero when 1 is passed as parameter n */
+
+    if (i == 0) {
+        return 0;
+    }
+    else {
+        return 3 / i; /* i must not be 0 in this path */
+    }
+}

data/share/demo/dos_source/dos_source.c

@@ -0,0 +1,7 @@
+extern int puts(const char *);
+
+int main(void)
+{
+    puts("hello world.\n");
+    return 0;
+}