paweld/fpc
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/fpc/source.git synced 2025-07-14 14:26:04 +02:00
Code Issues Packages Projects Releases Wiki Activity

* rewrote add_to_movelist, it now uses a field to store the number

Browse Source 
of allocated entries. Also made it using less hardcoded values
This commit is contained in:
peter 2004-03-14 22:50:04 +00:00
parent a627c15298
commit 3a5717c1b7
1 changed files with 35 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
compiler/rgobj.pas
View File

@ -122,9 +122,15 @@ unit rgobj;
property bitmap[x,y:tsuperregister]:boolean read getbitmap write setbitmap;default; property bitmap[x,y:tsuperregister]:boolean read getbitmap write setbitmap;default;
end; end;
Tmovelistheader=record
count,
maxcount,
sorted_until : cardinal;
end;
Tmovelist=record Tmovelist=record
count,sorted_until:cardinal; header : Tmovelistheader;
data:array[0..$ffff] of Tlinkedlistitem; data : array[tsuperregister] of Tlinkedlistitem;
end; end;
Pmovelist=^Tmovelist; Pmovelist=^Tmovelist;
@ -322,14 +328,14 @@ implementation
begin begin
with ml^ do with ml^ do
begin begin
if count<2 then if header.count<2 then
exit; exit;
p:=1; p:=1;
while 2*p<count do while 2*p<header.count do
p:=2*p; p:=2*p;
while p<>0 do while p<>0 do
begin begin
for h:=p to count-1 do for h:=p to header.count-1 do
begin begin
i:=h; i:=h;
t:=data[i]; t:=data[i];
@ -343,7 +349,7 @@ implementation
end; end;
p:=p shr 1; p:=p shr 1;
end; end;
sorted_until:=count-1; header.sorted_until:=header.count-1;
end; end;
end; end;
@ -698,26 +704,26 @@ implementation
{$endif EXTDEBUG} {$endif EXTDEBUG}
procedure trgobj.add_to_movelist(u:Tsuperregister;data:Tlinkedlistitem); procedure trgobj.add_to_movelist(u:Tsuperregister;data:Tlinkedlistitem);
var cursize:cardinal;
begin begin
with reginfo[u] do with reginfo[u] do
begin begin
if movelist=nil then if movelist=nil then
begin begin
getmem(movelist,64); getmem(movelist,sizeof(tmovelistheader)+60*sizeof(pointer));
movelist^.count:=0; movelist^.header.maxcount:=60;
movelist^.sorted_until:=0; movelist^.header.count:=0;
movelist^.header.sorted_until:=0;
end end
else else
begin begin
cursize:=memsize(movelist); if movelist^.header.count>=movelist^.header.maxcount then
if (4*(movelist^.count+2)=cursize) then begin
reallocmem(movelist,cursize*2); movelist^.header.maxcount:=movelist^.header.maxcount*2;
reallocmem(movelist,sizeof(tmovelistheader)+movelist^.header.maxcount*sizeof(pointer));
end;
end; end;
movelist^.data[movelist^.count]:=data; movelist^.data[movelist^.header.count]:=data;
inc(movelist^.count); inc(movelist^.header.count);
end; end;
end; end;
@ -773,7 +779,7 @@ implementation
with reginfo[n] do with reginfo[n] do
if movelist<>nil then if movelist<>nil then
with movelist^ do with movelist^ do
for i:=0 to count-1 do for i:=0 to header.count-1 do
if Tmoveins(data[i]).moveset in [ms_worklist_moves,ms_active_moves] then if Tmoveins(data[i]).moveset in [ms_worklist_moves,ms_active_moves] then
begin begin
move_related:=true; move_related:=true;
@ -872,7 +878,7 @@ implementation
begin begin
with reginfo[n] do with reginfo[n] do
if movelist<>nil then if movelist<>nil then
for i:=0 to movelist^.count-1 do for i:=0 to movelist^.header.count-1 do
begin begin
m:=movelist^.data[i]; m:=movelist^.data[i];
if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then
@ -1084,17 +1090,17 @@ implementation
number of items is less than 8 times the numer of unsorted items, number of items is less than 8 times the numer of unsorted items,
we'll sort the list.} we'll sort the list.}
with reginfo[u].movelist^ do with reginfo[u].movelist^ do
if count<8*(count-sorted_until) then if header.count<8*(header.count-header.sorted_until) then
sort_movelist(reginfo[u].movelist); sort_movelist(reginfo[u].movelist);
if assigned(reginfo[v].movelist) then if assigned(reginfo[v].movelist) then
begin begin
for n:=0 to reginfo[v].movelist^.count-1 do for n:=0 to reginfo[v].movelist^.header.count-1 do
begin begin
{Binary search the sorted part of the list.} {Binary search the sorted part of the list.}
searched:=reginfo[v].movelist^.data[n]; searched:=reginfo[v].movelist^.data[n];
p:=0; p:=0;
q:=reginfo[u].movelist^.sorted_until; q:=reginfo[u].movelist^.header.sorted_until;
i:=0; i:=0;
if q<>0 then if q<>0 then
repeat repeat
@ -1108,7 +1114,7 @@ implementation
if searched<>data[i] then if searched<>data[i] then
begin begin
{Linear search the unsorted part of the list.} {Linear search the unsorted part of the list.}
for i:=sorted_until+1 to count-1 do for i:=header.sorted_until+1 to header.count-1 do
if searched=data[i] then if searched=data[i] then
goto l1; goto l1;
{Not found -> add} {Not found -> add}
@ -1212,7 +1218,7 @@ implementation
begin begin
if reginfo[u].movelist<>nil then if reginfo[u].movelist<>nil then
for i:=0 to reginfo[u].movelist^.count-1 do for i:=0 to reginfo[u].movelist^.header.count-1 do
begin begin
m:=reginfo[u].movelist^.data[i]; m:=reginfo[u].movelist^.data[i];
if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then
@ -2015,7 +2021,11 @@ implementation
end. end.
{ {
$Log$ $Log$
Revision 1.123 2004-03-14 20:06:17 peter Revision 1.124 2004-03-14 22:50:04 peter
* rewrote add_to_movelist, it now uses a field to store the number
of allocated entries. Also made it using less hardcoded values
Revision 1.123 2004/03/14 20:06:17 peter
* check if movelist is valid * check if movelist is valid
Revision 1.122 2004/02/12 15:54:03 peter Revision 1.122 2004/02/12 15:54:03 peter