adlint 1.0.0

data/share/demo/Makefile

@@ -0,0 +1,110 @@
+DIRS = \
+ambig_operator \
+arg_points_unset \
+array_range \
+bad_bitfields \
+bad_brace \
+bad_charset \
+bad_comment \
+bad_const \
+bad_conv \
+bad_indent \
+bad_init \
+bad_macro \
+bitwise_expr \
+call_by_value \
+cross_ref \
+dangling_else \
+dead_code \
+deep_nest \
+dense_switch \
+direct_recur \
+div_by_zero \
+dos_source \
+funptr_cast \
+goto_stmt \
+id_hiding \
+ill_defined \
+implicit_int \
+implicit_conv \
+incomplete_type \
+indirect_recur \
+intro_demo \
+invalid_call \
+kandr_fundef \
+line_comment \
+local_decl \
+logical_trick \
+long_sym \
+loop_var \
+malloc_or_die \
+may_be_null \
+may_be_null_arith \
+may_be_unset \
+mmapped_io \
+multi_break \
+multi_decl \
+multi_def \
+multi_typedef \
+must_be_false \
+must_be_null \
+must_be_null_arith \
+must_be_true \
+no_eof_nl \
+no_void_arg \
+null_stmt \
+octal_const \
+output_by_param \
+overflow \
+press_release \
+retn_lvar_addr \
+shift_expr \
+should_be_typedef \
+static_paths \
+static_vars \
+tag_hiding \
+tricky_incdec \
+undefined_macro \
+uninit_vars \
+union_type \
+unmatch_decl \
+unmatch_paren_macro \
+unreachable \
+useless_exp_funs \
+useless_exp_vars \
+useless_expr \
+useless_funs \
+useless_header \
+useless_vars \
+va_funcall \
+various_fundef \
+wchar_wstring \
+wrap_around
+
+.PHONY: adlintize
+adlintize:
+	@for i in $(DIRS); do (\
+	    cd $$i; \
+	    if [ ! -d adlint ]; then \
+	        adlintize -o adlint; \
+	    fi \
+	) done
+
+.PHONY: all
+all : adlintize
+	@for i in $(DIRS); do (\
+	    cd $$i/adlint; \
+	    make all 2>/dev/null; \
+	) done
+
+.PHONY: verbose-all
+verbose-all : adlintize
+	@for i in $(DIRS); do (\
+	    cd $$i/adlint; \
+	    make verbose-all; \
+	) done
+
+.PHONY: clean
+clean :
+	@-for i in $(DIRS); do ( cd $$i/adlint && make clean; ) done
+	@for i in $(DIRS); do ( rm -rf $$i/adlint; ) done

data/share/demo/ambig_operator/ambig_operator.c

@@ -0,0 +1,289 @@
+extern int foo(int);
+
+void bar1(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int k = 3;
+    const int * const p = &i;
+    int r;
+
+    r = i + j % k;
+    r = i % j % k;
+    r = i % j * k;
+    r = i * j % k;
+
+    r = foo(i + j % k);
+    r = foo(i + j % foo(i + j % k));
+
+    r = i << j >> k;
+    r = i < j > k;
+    r = i == j != k;
+
+    r = i + j * k;
+    r = i / j - k;
+
+    r = i ? j : k;
+    r = -i ? j : k;
+    r = i ? -j : k;
+
+    r = i > j ? j : k;
+    r = i + j ? j : k;
+    r = i ? j + k : k;
+    r = i ? j : j + k;
+
+    r = i + j >> k;
+    r = i < j + k;
+    r = i & j != k;
+
+    i && -j;
+
+    r = i && ~j;
+    r = !i || j;
+    r = *p || j;
+    r = i && (unsigned int) j;
+
+    r = i && j && k;
+    r = i || j || k;
+    r = i || j && i;
+    r = i > j && k;
+    r = i && j != k;
+
+    r = i ? j : k ? i : j;
+    r = i ? j ? k : j : i;
+
+    r = i <= j <= k;
+    r = i == j == k;
+    r = i << j << k;
+}
+
+void bar2(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int k = 3;
+    const int * const p = &i;
+    int r;
+
+    r = i + (j % k);
+    r = (i % j) % k;
+    r = (i % j) * k;
+    r = (i * j) % k;
+
+    r = foo(i + (j % k));
+    r = foo(i + (j % foo(i + (j % k))));
+
+    r = (i << j) >> k;
+    r = (i < j) > k;
+    r = (i == j) != k;
+
+    r = i + (j * k);
+    r = (i / j) - k;
+
+    r = (i > j) ? j : k;
+    r = (i + j) ? j : k;
+    r = i ? (j + k) : k;
+    r = i ? j : (j + k);
+
+    r = (i + j) >> k;
+    r = i < (j + k);
+    r = i & (j != k);
+
+    r = i && (~j);
+    r = (!i) || j;
+    r = (*p) || j;
+    r = i && ((unsigned int) j);
+
+    r = (i || j) && i;
+    r = (i > j) && k;
+    r = i && (j != k);
+
+    r = i ? j : (k ? i : j);
+    r = i ? (j ? k : j) : i;
+
+    r = (i <= j) <= k;
+    r = (i == j) == k;
+    r = (i << j) << k;
+}
+
+void baz1(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int k = 3;
+    const int * const p = &i;
+
+    { const int r = i + j % k; }
+    { const int r = i % j % k; }
+    { const int r = i % j * k; }
+    { const int r = i * j % k; }
+
+    { const int r = foo(i + j % k); }
+    { const int r = foo(i + j % foo(i + j % k)); }
+
+    { const int r = i << j >> k; }
+    { const int r = i < j > k; }
+    { const int r = i == j != k; }
+
+    { const int r = i + j * k; }
+    { const int r = i / j - k; }
+
+    { const int r = i ? j : k; }
+    { const int r = -i ? j : k; }
+    { const int r = i ? -j : k; }
+
+    { const int r = i > j ? j : k; }
+    { const int r = i + j ? j : k; }
+    { const int r = i ? j + k : k; }
+    { const int r = i ? j : j + k; }
+
+    { const int r = i + j >> k; }
+    { const int r = i < j + k; }
+    { const int r = i & j != k; }
+
+    { const int r = i && ~j; }
+    { const int r = !i || j; }
+    { const int r = *p || j; }
+    { const int r = i && (unsigned int) j; }
+
+    { const int r = i && j && k; }
+    { const int r = i || j || k; }
+    { const int r = i || j && i; }
+    { const int r = i > j && k; }
+    { const int r = i && j != k; }
+
+    { const int r = i ? j : k ? i : j; }
+    { const int r = i ? j ? k : j : i; }
+
+    { const int r = i <= j <= k; }
+    { const int r = i == j == k; }
+    { const int r = i << j << k; }
+}
+
+void baz2(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int k = 3;
+    const int * const p = &i;
+
+    { const int r = i + (j % k); }
+    { const int r = (i % j) % k; }
+    { const int r = (i % j) * k; }
+    { const int r = (i * j) % k; }
+
+    { const int r = foo(i + (j % k)); }
+    { const int r = foo(i + (j % foo(i + (j % k)))); }
+
+    { const int r = (i << j) >> k; }
+    { const int r = (i < j) > k; }
+    { const int r = (i == j) != k; }
+
+    { const int r = i + (j * k); }
+    { const int r = (i / j) - k; }
+
+    { const int r = (i > j) ? j : k; }
+    { const int r = (i + j) ? j : k; }
+    { const int r = i ? (j + k) : k; }
+    { const int r = i ? j : (j + k); }
+
+    { const int r = (i + j) >> k; }
+    { const int r = i < (j + k); }
+    { const int r = i & (j != k); }
+
+    { const int r = i && (~j); }
+    { const int r = (!i) || j; }
+    { const int r = (*p) || j; }
+    { const int r = i && ((unsigned int) j); }
+
+    { const int r = (i || j) && i; }
+    { const int r = (i > j) && k; }
+    { const int r = i && (j != k); }
+
+    { const int r = i ? j : (k ? i : j); }
+    { const int r = i ? (j ? k : j) : i; }
+
+    { const int r = (i <= j) <= k; }
+    { const int r = (i == j) == k; }
+    { const int r = (i << j) << k; }
+}
+
+void qux1(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int a[5] = {0};
+    const struct { int m; } s = {0}, * const p = &s;
+    int r;
+
+    r = a[i] && j;
+    r = foo(i) || j;
+    r = p->m && i;
+    r = s.m || i;
+}
+
+void qux2(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int a[5] = {0};
+    const struct { int m; } s = {0}, * const p = &s;
+    int r;
+
+    r = (a[i]) && j;
+    r = (foo(i)) || j;
+    r = (p->m) && i;
+    r = (s.m) || i;
+}
+
+void quux1(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int a[5] = {0};
+    const struct { int m; } s = {0}, * const p = &s;
+
+    { const int r = a[i] && j; }
+    { const int r = foo(i) || j; }
+    { const int r = p->m && i; }
+    { const int r = s.m || i; }
+}
+
+void quux2(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int a[5] = {0};
+    const struct { int m; } s = {0}, * const p = &s;
+
+    { const int r = (a[i]) && j; }
+    { const int r = (foo(i)) || j; }
+    { const int r = (p->m) && i; }
+    { const int r = (s.m) || i; }
+}
+
+void foobar1(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int k = 3;
+    int r;
+
+    r = i * j / k;
+    r = i / j * k;
+    r = i + j - k;
+    r = i - j + k;
+}
+
+void foobar2(void)
+{
+    const int i = 1;
+    const int j = 2;
+    const int k = 3;
+    int r;
+
+    r = (i * j) / k;
+    r = (i / j) * k;
+    r = (i + j) - k;
+    r = (i - j) + k;
+}

data/share/demo/arg_points_unset/arg_points_unset.c

@@ -0,0 +1,37 @@
+extern int printf(const char *, ...);
+extern int rand(void);
+
+static void foo(const int *p) { }
+
+static void bar(char *str, const long *p)
+{
+    printf(str, *p);
+}
+
+static void baz(void)
+{
+    int i;
+
+    for (int j = 0; j < rand(); ++j) {
+        i = 0;
+    }
+
+    foo(&i);
+}
+
+int main(void)
+{
+    int i;
+    long l;
+
+    foo(&i);
+    bar("%l", &l);
+
+    if (rand() == 0) {
+        i = 1;
+    }
+
+    foo(&i);
+
+    return i;
+}

data/share/demo/array_range/array_range.c

@@ -0,0 +1,62 @@
+static int foo(const int i)
+{
+    int array[10] = { 0 };
+    int j;
+
+    j = array[5];
+    j = array[10];
+
+    if (i < 5) {
+        j = array[i];
+    }
+
+    if (i > 5) {
+        j = array[i];
+    }
+
+    if (i < 0) {
+        j = array[i];
+    }
+
+    if (i > 9) {
+        j = array[i];
+    }
+
+    j = array[i];
+
+
+    for (j = 0; j < 10; j++) {
+        array[j] = 0;
+        array[j + 1] = 0;
+        if (j == 10) {
+            break;
+        }
+        if (j < 0) {
+            break;
+        }
+    }
+
+    for (j = 9; j >= 0; j--) {
+        array[j] = 0;
+        array[j - 1] = 0;
+        if (j < 0) {
+            break;
+        }
+        if (j > 9) {
+            break;
+        }
+    }
+
+    for (j = 0; j != 10; j++) {
+        array[j] = 0;
+        array[j + 1] = 0;
+        if (j == 10) {
+            break;
+        }
+        if (j < 0) {
+            break;
+        }
+    }
+
+    return j;
+}

data/share/demo/bad_bitfields/bad_bitfields.c

@@ -0,0 +1,74 @@
+struct foo {
+    signed int b1:1;
+    signed int   :1;
+    int b2:1;
+    int   :1;
+};
+
+struct bar {
+    int a:5;
+    unsigned int b:4;
+    signed int c:3;
+    int d:4;
+    struct baz {
+        int a:5;
+        unsigned int b:4;
+        signed int c:3;
+        int d:4;
+    } baz;
+};
+
+enum color { R = 0, G, B };
+
+struct hoge {
+    signed int a:3;
+    unsigned int b:4;
+    unsigned char c:6;
+    unsigned short d:5;
+    enum color e:2;
+};
+
+#define NBITS 3
+enum { FOUR = 4 };
+
+struct hage {
+    unsigned int a:1;
+    unsigned int b:2;
+    unsigned int c:NBITS;
+    unsigned int d:FOUR;
+    struct hage *p;
+};
+
+void foo()
+{
+    struct foo f;
+    f.b1 = 0;
+    f.b1 = -1;
+    f.b1 = 1;
+}
+
+void bar()
+{
+    const struct foo f;
+    const int i = sizeof(f.b1);
+}
+
+void baz()
+{
+    const int i = { 0 };
+    const int a1[] = { { 0, 0, 0 } };
+    const int a2[][3] = { { 0, 0, 0 } };
+    const struct bar b1 = { 0, 0, 0, 0, { 0, 0, 0, 0 } };
+    const struct bar b2 = { { 0, 0, 0, 0, { 0, 0, 0, 0 } } };
+    const struct bar b3[] = { { 0, 0, 0, 0, { 0, 0, 0, 0 } } };
+
+    const int a3[4] = { 0 };
+    const int a4[4] = { 1, 2, 3, 4 };
+    const int a5[4] = { 1, 2, 3 };
+    const int aa1[3][3] = { { 0 }, { 1, 2, 3 }, { 4, 5, 6 } };
+    const int aa2[3][3] = { { 1 }, { 1, 2, 3 }, { 4, 5, 6 } };
+    const int aa3[3][3] = { { 0, 1 }, { 1, 2, 3 }, { 4, 5, 6 } };
+    const int aa4[3][3] = { { 0 + 1, 2 }, { 1, 2, 3 }, { 4, 5, 6 } };
+    const int aa5[3][3] = { { 1, 2, 3 } };
+    const int aa6[3][3] = { { { 0 } }, { 1, 2, 3 }, { 4, 5, 6 } };
+}

data/share/demo/bad_brace/bad_brace.c

@@ -0,0 +1,19 @@
+int main(int argc, char *argv[])
+{
+    if (argc < 2)
+    {
+        return 1;
+    }
+
+    if (argc > 2)
+     {
+         return 2;
+     }
+
+    if (argc == 2)
+    {
+        return 3;
+     }
+
+    return 0;
+}

data/share/demo/bad_charset/bad_charset.c

@@ -0,0 +1,22 @@
+#include <abcde$.h>
+#include "abcde$.h"
+
+#define FOO '@'
+#define BAR abc$1
+#define BAZ abc$2
+
+/* 日本語 */
+/* ￡ */
+/* $ */
+int main(void)
+{
+    const unsigned char ch = '@';
+    const char * const str1 = "foo@bar";
+    const char * const str2 = "foo bar";
+    const char * const str3 = "foo`bar";
+
+    return 0;
+}
+/* 日本語 */
+/* ￡ */
+/* $ */

data/share/demo/bad_comment/bad_comment.c

@@ -0,0 +1,3 @@
+/* outer comment /* inner comment */
+
+// C++ style line comment

data/share/demo/bad_const/bad_const.c

@@ -0,0 +1,19 @@
+#define MESG "hello world\n"
+#define CHAR 'C'
+#define SIZE (10)
+
+extern void foo(void)
+{
+    const unsigned int ui = 0x80000000;
+    const long l = 2147483648;
+    const int i = 50;
+    const char * const str = "hoge";
+    const char ch = 'A';
+    const int a1[3];
+    const int a2[3 + 1];
+    const int a3[SIZE];
+    const int a4[SIZE + 1];
+
+    puts(MESG);
+    printf("%c\n", CHAR);
+}

data/share/demo/bad_conv/bad_conv.c

@@ -0,0 +1,48 @@
+extern int printf(const char *, ...);
+extern int scanf(const char *, ...);
+
+int main(void)
+{
+    int i = 0;
+    int ii = 1;
+
+    printf();
+
+    printf("%509d\n", i);
+    printf("%510d\n", i);
+
+    printf("%3d %5t\n", i, ii);
+
+    printf("%3ld %xd\n", i);
+    printf("%3to %fo\n", i, ii, 0);
+    printf("%3tu %fu\n");
+    printf("%3tx %fx\n", i, ii);
+    printf("%3tX %fX\n", i, ii);
+    printf("%3lf %Lf\n", i, ii);
+    printf("%3le %Le\n", i, ii);
+    printf("%3lE %LE\n", i, ii);
+    printf("%3lg %Lg\n", i, ii);
+    printf("%3lG %LG\n", i, ii);
+    printf("%lc %Lc\n", i, ii);
+    printf("%%lc % %Z\n", i, ii);
+    printf("%ls %Ls\n", i, ii);
+    printf("%ln %Ln\n", i, ii);
+    printf("%p %lp\n", i, ii);
+    printf("%#x %#\n", i, ii);
+
+    scanf("%3d %5t\n", &i, &ii);
+
+    scanf("%3ld %xd\n", &i, &ii);
+    scanf("%3to %fo\n", i, &ii);
+    scanf("%3tu %fu\n", &i, ii);
+    scanf("%3tx %fx\n", &i, &ii);
+    scanf("%3tf %lf\n", &i, &ii);
+    scanf("%3lls %fs\n", &i, &ii);
+    scanf("%3p %lp\n", &i, &ii);
+    scanf("%%lc % %Z\n", &i, &ii);
+    scanf("%l[a-z] %ll[a-z]\n", &i, &ii);
+    scanf("%3llc %fc\n", &i, &ii);
+    scanf("%3llz %c\n", &i, &ii);
+
+    return 0;
+}