Remove some unused variables.
This commit is contained in:
Stephen Heumann
parent
3b6f73c277
commit
cc36e9929f
4
DAG.pas
4
DAG.pas
|
|
@ -488,9 +488,6 @@ var
|
|||
{ parameters: }
|
||||
{ op - tree to check }
|
||||
|
||||
var
|
||||
result: boolean; {temp result}
|
||||
|
||||
begin {SideEffects}
|
||||
if op = nil then begin
|
||||
if volatile then
|
||||
|
|
@ -520,7 +517,6 @@ var
|
|||
{ newOpcode - opcode to use if the jump sense is reversed }
|
||||
|
||||
var
|
||||
done: boolean; {optimization done test}
|
||||
topcode: pcodes; {temp opcode}
|
||||
|
||||
begin {JumpOptimizations}
|
||||
|
|
|
|||
21
Gen.pas
21
Gen.pas
|
|
@ -704,9 +704,6 @@ var
|
|||
{ See if the intermediate code is simple; i.e., can be }
|
||||
{ reached by direct page or absolute addressing. }
|
||||
|
||||
var
|
||||
load: icptr; {left opcode}
|
||||
|
||||
begin {Simple}
|
||||
Simple := false;
|
||||
if icode^.opcode = pc_ldc then
|
||||
|
|
@ -2592,7 +2589,6 @@ procedure GenIilIliIdlIld (op: icptr);
|
|||
{ Generate code for a pc_iil, pc_ili, pc_idl or pc_ild }
|
||||
|
||||
var
|
||||
i: integer; {index variable}
|
||||
lab1: integer; {label}
|
||||
lSkipLoad: boolean; {copy of skipLoad}
|
||||
opcode: pcodes; {op^.opcode}
|
||||
|
|
@ -6460,7 +6456,6 @@ procedure GenTree {op: icptr};
|
|||
|
||||
var
|
||||
lab1,lab2: integer; {label}
|
||||
nd: icptr; {temp node pointer}
|
||||
opc: pcodes; {operation code}
|
||||
|
||||
|
||||
|
|
@ -7265,9 +7260,6 @@ procedure GenTree {op: icptr};
|
|||
|
||||
{ Generate code for a pc_stk }
|
||||
|
||||
var
|
||||
lab1: integer; {branch point}
|
||||
|
||||
begin {GenStk}
|
||||
if op^.left^.opcode = pc_psh then begin
|
||||
if (op^.left^.right^.opcode = pc_ldc) and
|
||||
|
|
@ -7390,7 +7382,6 @@ procedure GenTree {op: icptr};
|
|||
|
||||
var
|
||||
lLong: longType; {used to reserve gLong}
|
||||
tp: baseTypeEnum; {operand type}
|
||||
|
||||
begin {GenTl1}
|
||||
if op^.r in [2,4] then begin
|
||||
|
|
@ -7408,14 +7399,10 @@ procedure GenTree {op: icptr};
|
|||
else
|
||||
GenNative(m_sta_long, longAbs, 0, @'~TOOLERROR', 0);
|
||||
if op^.r in [2,4] then begin
|
||||
if op^.r = 2 then begin
|
||||
GenImplied(m_pla);
|
||||
tp := cgWord;
|
||||
end {if}
|
||||
else begin
|
||||
if op^.r = 2 then
|
||||
GenImplied(m_pla)
|
||||
else
|
||||
gLong.where := onStack;
|
||||
tp := cgLong;
|
||||
end; {else}
|
||||
end; {if}
|
||||
end; {GenTl1}
|
||||
|
||||
|
|
@ -7453,7 +7440,7 @@ procedure GenTree {op: icptr};
|
|||
{ Generate code for a pc_xjp }
|
||||
|
||||
var
|
||||
lab1,lab2: integer;
|
||||
lab1: integer;
|
||||
q: integer;
|
||||
|
||||
begin {GenXjp}
|
||||
|
|
|
|||
|
|
@ -312,7 +312,7 @@ procedure UpDate (lab: integer; labelValue: longint);
|
|||
{ labelValue - displacement in seg where label is located }
|
||||
|
||||
var
|
||||
next,temp: labelptr; {work pointers}
|
||||
next: labelptr; {work pointer}
|
||||
|
||||
begin {UpDate}
|
||||
if labeltab[lab].defined then
|
||||
|
|
@ -334,7 +334,6 @@ else begin
|
|||
Out2(long(labelvalue).lsw);
|
||||
Out2(long(labelvalue).msw);
|
||||
blkcnt := blkcnt-4;
|
||||
temp := next;
|
||||
next := next^.next;
|
||||
end; {while}
|
||||
segdisp := blkcnt;
|
||||
|
|
|
|||
|
|
@ -692,7 +692,6 @@ var
|
|||
var
|
||||
errorFound: boolean; {did we find an error?}
|
||||
forLoop, continueLab, breakLab: integer; {branch points}
|
||||
lType: typePtr; {type of "left" expression}
|
||||
parencount: integer; {number of unmatched '(' chars}
|
||||
stPtr: statementPtr; {work pointer}
|
||||
tl,tk: tokenStackPtr; {for forming expression list}
|
||||
|
|
@ -770,7 +769,6 @@ var
|
|||
|
||||
var
|
||||
lab: integer; {branch label}
|
||||
lType: typePtr; {type of "left" expression}
|
||||
stPtr: statementPtr; {work pointer}
|
||||
|
||||
begin {IfStatement}
|
||||
|
|
@ -831,7 +829,6 @@ var
|
|||
{ handle a return statement }
|
||||
|
||||
var
|
||||
id: identPtr; {structure id}
|
||||
size: longint; {size of the struct/union}
|
||||
|
||||
|
||||
|
|
@ -968,7 +965,6 @@ var
|
|||
{ handle a while statement }
|
||||
|
||||
var
|
||||
lType: typePtr; {type of "left" expression}
|
||||
stPtr: statementPtr; {work pointer}
|
||||
top, endl: integer; {branch points}
|
||||
|
||||
|
|
@ -1049,7 +1045,6 @@ procedure EndDoStatement;
|
|||
{ finish off a do statement }
|
||||
|
||||
var
|
||||
lType: typePtr; {type of "left" expression}
|
||||
stPtr: statementPtr; {work pointer}
|
||||
|
||||
begin {EndDoStatement}
|
||||
|
|
|
|||
|
|
@ -1582,7 +1582,6 @@ var
|
|||
cp: longstringPtr; {pointer to work string}
|
||||
i: integer; {loop variable}
|
||||
len,len1: integer; {length of strings}
|
||||
lt: tokenType; {local copy of token}
|
||||
elementType: typePtr; {string element type}
|
||||
|
||||
begin {MergeStrings}
|
||||
|
|
|
|||
|
|
@ -511,8 +511,6 @@ label 1;
|
|||
var
|
||||
el1,el2: longint; {array sizes}
|
||||
kind1,kind2: typeKind; {temp variables (for speed)}
|
||||
p1, p2: parameterPtr; {for tracing parameter lists}
|
||||
pt1,pt2: typePtr; {pointer types}
|
||||
|
||||
begin {CompTypes}
|
||||
CompTypes := false; {assume the types are not compatible}
|
||||
|
|
@ -1141,7 +1139,6 @@ var
|
|||
i: integer; {loop variable}
|
||||
iHandle: ^identPtr; {pointer to start of hash bucket}
|
||||
iPtr: identPtr; {pointer to the current symbol}
|
||||
match: boolean; {for comparing substrings}
|
||||
name: stringPtr; {name to search for}
|
||||
np: stringPtr; {for searching for static variables}
|
||||
sPtr: symbolTablePtr; {^ to current symbol table}
|
||||
|
|
|
|||
Loading…
Reference in New Issue