From 705d5fdd89aaf258a625e115d9bb7e3ea56c37f2 Mon Sep 17 00:00:00 2001 From: Jonas Maebe Date: Thu, 15 Jul 2004 20:59:58 +0000 Subject: [PATCH] * fixed complexity function so it doesn't always return infinity when a load node is encountered --- compiler/nutils.pas | 12 +++++++----- 1 file changed, 7 insertions(+), 5 deletions(-) diff --git a/compiler/nutils.pas b/compiler/nutils.pas index 7716a078cb..d1c4853b85 100644 --- a/compiler/nutils.pas +++ b/compiler/nutils.pas @@ -454,10 +454,8 @@ implementation else inc(result,5); if (result >= NODE_COMPLEXITY_INF) then - begin - result := NODE_COMPLEXITY_INF; - exit; - end; + result := NODE_COMPLEXITY_INF; + exit; end; subscriptn: p := tunarynode(p).left; @@ -495,7 +493,11 @@ end. { $Log$ - Revision 1.16 2004-07-15 19:55:40 jonas + Revision 1.17 2004-07-15 20:59:58 jonas + * fixed complexity function so it doesn't always return infinity when a + load node is encountered + + Revision 1.16 2004/07/15 19:55:40 jonas + (incomplete) node_complexity function to assess the complexity of a tree + support for inlining value and const parameters at the node level