From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 25955 invoked by alias); 2 Apr 2003 14:56:42 -0000 Mailing-List: contact gcc-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-owner@gcc.gnu.org Received: (qmail 25947 invoked from network); 2 Apr 2003 14:56:41 -0000 Received: from unknown (HELO vlsi1.ultra.nyu.edu) (128.122.140.213) by sources.redhat.com with SMTP; 2 Apr 2003 14:56:41 -0000 Received: by vlsi1.ultra.nyu.edu (4.1/1.34) id AA20627; Wed, 2 Apr 03 10:00:15 EST Date: Wed, 02 Apr 2003 15:36:00 -0000 From: kenner@vlsi1.ultra.nyu.edu (Richard Kenner) Message-Id: <10304021500.AA20627@vlsi1.ultra.nyu.edu> To: Ulrich.Weigand@de.ibm.com Subject: Re: RFA: Ada variable-sized objects, bit_size_type == TImode, and divti3 Cc: gcc@gcc.gnu.org X-SW-Source: 2003-04/txt/msg00079.txt.bz2 I still don't quite understand under what circumstances you would in fact need to perform TImode computations at run time (that cannot be optimized away at compile time). Do you have an example? Somewhat contrived, but try: procedure foo (x : integer) is type r1(d: integer) is record f1: string (1..d); f2: integer; end record; rr1: r1 (x); rr2: r1 (x * 2); begin if rr1'size > rr2'size then raise program_error; end if; end foo; This has *some* TImode computations, but not many.