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=1.1 required=5.0 tests=BAYES_20,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!uwvax!uwmacc!uwmcsd1!ig!jade!ucbvax!MITRE-BEDFORD.ARPA!sdl
From: sdl@MITRE-BEDFORD.ARPA (Litvintchouk)
Newsgroups: comp.lang.ada
Subject: info wanted on optimization of generic instantiations
Message-ID: <8711222016.AA25603@mitre-bedford.ARPA>
Date: Sun, 22-Nov-87 15:16:31 EST
Article-I.D.: mitre-be.8711222016.AA25603
Posted: Sun Nov 22 15:16:31 1987
Date-Received: Thu, 26-Nov-87 01:52:45 EST
Sender: usenet@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
List-Id: <comp.lang.ada>


I am interested in finding out what the current state of the art is in
compiler optimization techniques for Ada generic instantiations.  For
instance, I would like to know if there are any Ada compilers, either
available or under development, that implement object code sharing
among instantiations of a generic unit that has generic formal
subprogram parameters.  (Particularly if the generic formal subprogram
has a parameter that is of a generic formal private type.)  Also, how
much code can be shared between an instantiation that supplies a
matching actual procedure, and another instantiation that supplies a
task entry call as the matching actual parameter?

Please reply directly to me; I'll repost a summary of any interesting
replies to the net.  Thanx for your help!


Steven Litvintchouk
MITRE Corporation
Burlington Road
Bedford, MA  01730
(617)271-7753

ARPA:  sdl@mitre-bedford.arpa
UUCP:  ...{cbosgd,decvax,genrad,ll-xn,philabs,security,utzoo}!linus!sdl

	"Those who will be able to conquer software will be able to
	 conquer the world."  -- Tadahiro Sekimoto, president, NEC Corp.n