kencc: clarify warning for unused assignments
This commit is contained in:
parent
21075859e4
commit
1a09421f7d
9 changed files with 15 additions and 15 deletions
|
@ -359,7 +359,7 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set an not used: %B\n", bit);
|
print("set an not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
|
|
|
@ -359,9 +359,9 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set an not used: %B\n", bit);
|
print("assignment not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
}
|
}
|
||||||
for(z=0; z<BITS; z++)
|
for(z=0; z<BITS; z++)
|
||||||
|
|
|
@ -329,9 +329,9 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set and not used: %B\n", bit);
|
print("assignment not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
}
|
}
|
||||||
for(z=0; z<BITS; z++)
|
for(z=0; z<BITS; z++)
|
||||||
|
|
|
@ -520,9 +520,9 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set and not used: %B\n", bit);
|
print("assignment not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
}
|
}
|
||||||
for(z=0; z<BITS; z++)
|
for(z=0; z<BITS; z++)
|
||||||
|
|
|
@ -324,9 +324,9 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set and not used: %B\n", bit);
|
print("assignment not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
}
|
}
|
||||||
for(z=0; z<BITS; z++)
|
for(z=0; z<BITS; z++)
|
||||||
|
|
|
@ -451,9 +451,9 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set and not used: %B\n", bit);
|
print("assignment not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
}
|
}
|
||||||
for(z=0; z<BITS; z++)
|
for(z=0; z<BITS; z++)
|
||||||
|
|
|
@ -307,7 +307,7 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set an not used: %B\n", bit);
|
print("set an not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
|
|
|
@ -317,7 +317,7 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set an not used: %B\n", bit);
|
print("set an not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
|
|
|
@ -319,9 +319,9 @@ loop2:
|
||||||
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
~(r->refahead.b[z] | r->calahead.b[z] | addrs.b[z]);
|
||||||
if(bany(&bit)) {
|
if(bany(&bit)) {
|
||||||
nearln = r->prog->lineno;
|
nearln = r->prog->lineno;
|
||||||
warn(Z, "set and not used: %B", bit);
|
warn(Z, "assignment not used: %B", bit);
|
||||||
if(debug['R'])
|
if(debug['R'])
|
||||||
print("set and not used: %B\n", bit);
|
print("assignment not used: %B\n", bit);
|
||||||
excise(r);
|
excise(r);
|
||||||
}
|
}
|
||||||
for(z=0; z<BITS; z++)
|
for(z=0; z<BITS; z++)
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue