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

* do not limit the number of interfaces per class, resolves #40268

Browse Source
This commit is contained in:
florian 2024-04-20 22:05:18 +02:00
parent 9ee1821622
commit 902c93f3c3
2 changed files with 1280 additions and 35 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

58
compiler/nobj.pas
View File

@ -668,17 +668,10 @@ implementation
weight: longint;
compintf: longint;
end;
{ Max 1000 interface in the class header interfaces it's enough imho }
tcompintfs = array[0..1000] of tcompintfentry;
pcompintfs = ^tcompintfs;
tequals = array[0..1000] of longint;
pequals = ^tequals;
timpls = array[0..1000] of longint;
pimpls = ^timpls;
var
aequals: pequals;
compats: pcompintfs;
impls: pimpls;
aequals: array of longint;
compats: array of tcompintfentry;
impls: array of longint;
ImplIntfCount,
w,i,j,k: longint;
ImplIntfI,
@ -687,14 +680,12 @@ implementation
cji: boolean;
begin
ImplIntfCount:=_class.ImplementedInterfaces.count;
if ImplIntfCount>=High(tequals) then
Internalerror(200006135);
getmem(compats,sizeof(tcompintfentry)*ImplIntfCount);
getmem(aequals,sizeof(longint)*ImplIntfCount);
getmem(impls,sizeof(longint)*ImplIntfCount);
filldword(compats^,(sizeof(tcompintfentry) div sizeof(dword))*ImplIntfCount,dword(-1));
filldword(aequals^,ImplIntfCount,dword(-1));
filldword(impls^,ImplIntfCount,dword(-1));
SetLength(compats,ImplIntfCount);
SetLength(aequals,ImplIntfCount);
SetLength(impls,ImplIntfCount);
filldword(compats[0],(sizeof(tcompintfentry) div sizeof(dword))*ImplIntfCount,dword(-1));
filldword(aequals[0],ImplIntfCount,dword(-1));
filldword(impls[0],ImplIntfCount,dword(-1));
{ ismergepossible is a containing relation
meaning of ismergepossible(a,b,w) =
if implementorfunction map of a is contained implementorfunction map of b
@ -712,32 +703,32 @@ implementation
if cij and cji then { i equal j }
begin
{ get minimum index of equal }
if aequals^[j]=-1 then
aequals^[j]:=i;
if aequals[j]=-1 then
aequals[j]:=i;
end
else if cij then
begin
{ get minimum index of maximum weight }
if compats^[i].weight<w then
if compats[i].weight<w then
begin
compats^[i].weight:=w;
compats^[i].compintf:=j;
compats[i].weight:=w;
compats[i].compintf:=j;
end;
end
else if cji then
begin
{ get minimum index of maximum weight }
if (compats^[j].weight<w) then
if (compats[j].weight<w) then
begin
compats^[j].weight:=w;
compats^[j].compintf:=i;
compats[j].weight:=w;
compats[j].compintf:=i;
end;
end;
end;
end;
{ Reset, no replacements by default }
for i:=0 to ImplIntfCount-1 do
impls^[i]:=i;
impls[i]:=i;
{ Replace vtbls when equal or compat, repeat
until there are no replacements possible anymore. This is
needed for the cases like:
@ -748,10 +739,10 @@ implementation
k:=0;
for i:=0 to ImplIntfCount-1 do
begin
if compats^[impls^[i]].compintf<>-1 then
impls^[i]:=compats^[impls^[i]].compintf
else if aequals^[impls^[i]]<>-1 then
impls^[i]:=aequals^[impls^[i]]
if compats[impls[i]].compintf<>-1 then
impls[i]:=compats[impls[i]].compintf
else if aequals[impls[i]]<>-1 then
impls[i]:=aequals[impls[i]]
else
inc(k);
end;
@ -760,11 +751,8 @@ implementation
for i:=0 to ImplIntfCount-1 do
begin
ImplIntfI:=TImplementedInterface(_class.ImplementedInterfaces[i]);
ImplIntfI.VtblImplIntf:=TImplementedInterface(_class.ImplementedInterfaces[impls^[i]]);
ImplIntfI.VtblImplIntf:=TImplementedInterface(_class.ImplementedInterfaces[impls[i]]);
end;
freemem(compats);
freemem(aequals);
freemem(impls);
end;

1257
tests/webtbs/tw40258.pp Normal file
View File

File diff suppressed because it is too large Load Diff