From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,2ea02452876a15e1 X-Google-Attributes: gid103376,public X-Google-Thread: 1108a1,c52c30d32b866eae X-Google-Attributes: gid1108a1,public X-Google-Thread: fac41,c52c30d32b866eae X-Google-Attributes: gidfac41,public From: ncohen@watson.ibm.com (Norman H. Cohen) Subject: Re: Real OO Date: 1996/04/09 Message-ID: <4ke84h$iiv@watnews1.watson.ibm.com>#1/1 X-Deja-AN: 146576172 distribution: world references: <65lDeVZF3RB@herold.franken.de> <4kbl7r$1i8@gaia.ns.utk.edu> organization: IBM T.J. Watson Research Center reply-to: ncohen@watson.ibm.com newsgroups: comp.lang.eiffel,comp.lang.ada,comp.object Date: 1996-04-09T00:00:00+00:00 List-Id: In article <4kbl7r$1i8@gaia.ns.utk.edu>, mbk@caffeine.engr.utk.edu (Matt Kennel) writes: |> My experience with Sather numerical classes is that the cost of indirect |> calls is not the actual indirection, but the lost opportunities for |> inlining. Plus the opportunities that arise from cross-procedural analysis, for compilers that perform such analysis for statically bound subprograms. (But remember, in counting the cost of the actual indirection, to count machine cycles rather than instruction path length. Indirect function calls can cause expensive I-cache misses on some architectures.) -- Norman H. Cohen ncohen@watson.ibm.com