Skip to content

Fixed a Bug of SonarQube #366

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Apr 12, 2024
Merged

Fixed a Bug of SonarQube #366

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
0eb26b2
Fixed Java code generated by cobj
kio-watanabe Apr 11, 2024
3ceb09d
Fixed codegen.c
kio-watanabe Apr 11, 2024
d53b60e
Fixed codegen.c
kio-watanabe Apr 11, 2024
57bf748
Fixed codegen.c
kio-watanabe Apr 11, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 8 additions & 3 deletions cobj/codegen.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2696,14 +2696,19 @@ static void joutput_search_all(cb_tree table, cb_tree stmt, cb_tree cond,

p = cb_field(table);
idx = CB_VALUE(p->index_list);

/* Header */
joutput_indent("{");
joutput_line("int ret;");
joutput_line("int head = %d - 1;", p->occurs_min);
joutput_line("int head = %d;", p->occurs_min - 1);
joutput_prefix();
joutput("int tail = ");
joutput_occurs(p);
joutput(" + 1;\n");
if (p->occurs_depending) {
joutput_integer(p->occurs_depending);
joutput(" + 1;\n");
} else {
joutput("%d;\n", p->occurs_max + 1);
}

/* Start loop */
joutput_line("for (;;)");
Expand Down