paweld/fpc
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/fpc/source.git synced 2025-08-16 17:59:25 +02:00
Code Issues Packages Projects Releases Wiki Activity

* some improvements to node complexity calculations

Browse Source
This commit is contained in:
Jonas Maebe 2004-08-04 08:35:59 +00:00
parent c67f1c7107
commit c5ec202cd1
1 changed files with 30 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
compiler/nutils.pas
View File

@ -447,6 +447,11 @@ implementation
while true do while true do
begin begin
case p.nodetype of case p.nodetype of
temprefn:
begin
result := 1;
exit;
end;
loadn: loadn:
begin begin
if not(vo_is_thread_var in tvarsym(tloadnode(p).symtableentry).varoptions) then if not(vo_is_thread_var in tvarsym(tloadnode(p).symtableentry).varoptions) then
@ -457,16 +462,20 @@ implementation
result := NODE_COMPLEXITY_INF; result := NODE_COMPLEXITY_INF;
exit; exit;
end; end;
subscriptn: subscriptn,
blockn:
p := tunarynode(p).left; p := tunarynode(p).left;
derefn: derefn,
{ may be more complex in some cases }
typeconvn:
begin begin
inc(result); inc(result);
if (result = NODE_COMPLEXITY_INF) then if (result = NODE_COMPLEXITY_INF) then
exit; exit;
p := tunarynode(p).left; p := tunarynode(p).left;
end; end;
vecn: vecn,
statementn:
begin begin
inc(result,node_complexity(tbinarynode(p).left)); inc(result,node_complexity(tbinarynode(p).left));
if (result >= NODE_COMPLEXITY_INF) then if (result >= NODE_COMPLEXITY_INF) then
@ -476,6 +485,20 @@ implementation
end; end;
p := tbinarynode(p).right; p := tbinarynode(p).right;
end; end;
{ better: make muln/divn/modn more expensive }
addn,subn,orn,andn,xorn,muln,divn,modn,symdifn,
assignn:
begin
inc(result,node_complexity(tbinarynode(p).left)+1);
if (result >= NODE_COMPLEXITY_INF) then
begin
result := NODE_COMPLEXITY_INF;
exit;
end;
p := tbinarynode(p).right;
end;
tempcreaten,
tempdeleten,
ordconstn, ordconstn,
pointerconstn: pointerconstn:
exit; exit;
@ -493,7 +516,10 @@ end.
{ {
$Log$ $Log$
Revision 1.17 2004-07-15 20:59:58 jonas Revision 1.18 2004-08-04 08:35:59 jonas
* some improvements to node complexity calculations
Revision 1.17 2004/07/15 20:59:58 jonas
* fixed complexity function so it doesn't always return infinity when a * fixed complexity function so it doesn't always return infinity when a
load node is encountered load node is encountered