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

* more precise estimation of subscript node complexity

Browse Source 
git-svn-id: trunk@43314 -
This commit is contained in:
florian 2019-10-27 12:40:08 +00:00
parent 421b06affe
commit 31e5b2d9a4
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
compiler/nutils.pas
View File

@ -790,7 +790,9 @@ implementation
if is_implicit_pointer_object_type(tunarynode(p).left.resultdef) or if is_implicit_pointer_object_type(tunarynode(p).left.resultdef) or
is_bitpacked_access(p) then is_bitpacked_access(p) then
inc(result,2) inc(result,2)
else if tstoreddef(p.resultdef).is_intregable then { non-packed, int. regable records cause no extra
overhead no overhead if the fields are aligned to register boundaries }
else if tstoreddef(p.resultdef).is_intregable and (tsubscriptnode(p).vs.fieldoffset mod sizeof(aint)<>0) then
inc(result,1); inc(result,1);
if (result = NODE_COMPLEXITY_INF) then if (result = NODE_COMPLEXITY_INF) then
exit; exit;