From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 28814 invoked by alias); 10 Jun 2004 17:25:16 -0000 Mailing-List: contact gdb-help@sources.redhat.com; run by ezmlm Precedence: bulk List-Subscribe: List-Archive: List-Post: List-Help: , Sender: gdb-owner@sources.redhat.com Received: (qmail 28594 invoked from network); 10 Jun 2004 17:24:57 -0000 Received: from unknown (HELO cuddles.cambridge.redhat.com) (81.96.64.123) by sourceware.org with SMTP; 10 Jun 2004 17:24:57 -0000 Received: from redhat.com (localhost.localdomain [127.0.0.1]) by cuddles.cambridge.redhat.com (8.12.8/8.12.8) with ESMTP id i5AHMCVL023127; Thu, 10 Jun 2004 18:22:22 +0100 Received: (from aph@localhost) by redhat.com (8.12.8/8.12.8/Submit) id i5AHMBlD023121; Thu, 10 Jun 2004 18:22:11 +0100 From: Andrew Haley MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16584.39107.573533.932939@cuddles.cambridge.redhat.com> Date: Thu, 10 Jun 2004 17:25:00 -0000 To: Ian Lance Taylor Cc: tromey@redhat.com, Daniel Jacobowitz , java@gcc.gnu.org, gdb@sources.redhat.com Subject: Re: Binary Compatibility: debug info for compiled Java programs In-Reply-To: References: <16582.65277.81118.189889@cuddles.cambridge.redhat.com> <20040609130859.GA7514@nevyn.them.org> <16583.3516.604885.805420@cuddles.cambridge.redhat.com> <20040609132951.GA8017@nevyn.them.org> <16583.4773.74100.735457@cuddles.cambridge.redhat.com> <20040609221710.GA16922@nevyn.them.org> <87ise0bc8y.fsf@fleche.redhat.com> <20040610163718.GA24803@nevyn.them.org> <874qpjbcju.fsf@fleche.redhat.com> <16584.37526.974458.647364@cuddles.cambridge.redhat.com> X-SW-Source: 2004-06/txt/msg00102.txt.bz2 Ian Lance Taylor writes: > Andrew Haley writes: > > > > By the way, Tom and Andrew, I meant to ask, but I forgot: would it > > > make sense to build the numeric otables and atables for the common > > > case, and then recompute only when required? > > > > That's possibly true, but you'd somehow have to discover that > > something had changed, and I'm not sure how you'd do that without > > doing the lookups. > > It seems to me that you could hash the relevant information for each > relevant class and store it in the defining class and in the loaded > class. When you load the binary, check the hashes, and recompute if > they differ. That's worth thinking about. Say you have a reference to foo.bar and a hash for foo. You compute the hash for foo and see that it hasn't changed, so you don't have to recompute the offset of foo.bar. That's cool, but hashing is no easier than recomputing the offset. So, it's only a win if you have a lot of references to members of foo. This might be a big win if you can show that none of your ancestors have changed, so you don't need to recompute the offsets of any of your own members. What you could perhaps do is have two versions of a method, and only use the BC version if the classes it depends on have changed. That would be quicker, but maybe more effort than is really warranted. It might be useful for escape analysis, though: you might be able to prove that an object doesn't escape as long as the lasses it depends on haven't changed. > > > I have to think that the common case is pretty darn common--I'm > > > sure people don't spend all their time loading classes into > > > different hierarchies. > > > > What is very common is for people to distribute Java binaries without > > specifying the exact versions of the classes they depend on. So, it's > > normal for the run-time library environment of a Java program to be > > different from the compile-time environment. The whole idea of binary > > compatibility is to make this possible. > > On the other hand, at during compile/edit/debug, the compile-time and > run-time environment should be similar. Yes, that's true. Andrew.