Make-lang.in, [...]: Find runtime source in libgnat/

2017-09-08  Nicolas Roche  <roche@adacore.com>

	* gcc-interface/Make-lang.in, gcc-interface/Makefile.in: Find runtime
	source in libgnat/
	* a-lfztio.ads, g-timsta.ads, g-sercom-linux.adb, s-osprim-solaris.adb,
	a-inteio.ads, s-stchop-rtems.adb, s-casuti.adb, s-pack39.adb,
	i-vxwork-x86.ads, a-strbou.adb, a-stzmap.adb, s-assert.adb,
	a-sfecin.ads, a-cohama.adb, s-casuti.ads, a-suenco.adb, s-pack39.ads,
	a-stzmap.ads, a-strbou.ads, s-stalib.adb, s-trasym.adb, g-comver.adb,
	s-assert.ads, s-vector.ads, g-cgi.adb, a-cohama.ads, s-wchcnv.adb,
	a-titest.adb, s-pack48.adb, a-suenco.ads, a-strunb.adb, s-stalib.ads,
	s-trasym.ads, a-nudira.adb, g-comver.ads, a-nuflra.adb, g-cgi.ads,
	a-chacon.adb, s-wchcnv.ads, a-excach.adb, s-pack48.ads, a-titest.ads,
	a-strunb.ads, s-dwalin.adb, a-nudira.ads, a-chtgbo.adb, s-resfil.adb,
	a-scteio.ads, a-nuflra.ads, g-soliop-mingw.ads, s-pack57.adb,
	a-chacon.ads, s-bytswa.ads, s-pooloc.adb, g-os_lib.adb, s-dwalin.ads,
	a-szuzha.adb, s-resfil.ads, a-chtgbo.ads, s-spsufi.adb, s-pack57.ads,
	s-pooloc.ads, g-os_lib.ads, a-stfiha.ads, a-lcteio.ads, a-wtcoau.adb,
	a-szuzha.ads, s-mmosin-unix.adb, a-stmaco.ads, s-spsufi.ads,
	s-stchop-limit.ads, a-wtcoau.ads, a-exctra.adb, s-mmosin-unix.ads,
	s-sequio.adb, s-conca2.adb, g-table.adb, s-imglli.adb,
	a-numaux-x86.adb, a-strsea.adb, s-wchstw.adb, a-clrefi.adb,
	a-wwboio.adb, a-exctra.ads, s-sequio.ads, s-conca2.ads, a-wwunio.ads,
	system-linux-hppa.ads, g-table.ads, s-dimkio.ads, s-imglli.ads,
	a-cofove.adb, a-numaux-x86.ads, s-wchstw.ads, a-strsea.ads,
	a-clrefi.ads, a-wwboio.ads, s-stratt-xdr.adb, s-crc32.adb,
	s-excmac-arm.adb, g-busora.adb, a-cofove.ads, s-osprim-unix.adb,
	g-io.adb, s-pack49.adb, s-crc32.ads, s-excmac-arm.ads, a-fzteio.ads,
	g-busora.ads, s-stausa.adb, system-linux-mips.ads, sequenio.ads,
	g-exctra.adb, g-rewdat.adb, a-cgaaso.adb, g-io.ads, s-pack49.ads,
	a-wtflau.adb, a-undesu.adb, s-stausa.ads, a-ztenau.adb, g-enutst.ads,
	calendar.ads, s-pack58.adb, g-rewdat.ads, g-exctra.ads, s-ststop.adb,
	a-cgaaso.ads, a-strfix.adb, a-comlin.adb, a-strunb-shared.adb,
	a-wtflau.ads, a-undesu.ads, a-cbhase.adb, a-ztenau.ads, s-os_lib.adb,
	a-coorse.adb, a-chlat1.ads, s-pack58.ads, s-ststop.ads, a-strfix.ads,
	a-comlin.ads, a-strunb-shared.ads, a-nscefu.ads, s-valboo.adb,
	directio.ads, a-chtgke.adb, a-cbhase.ads, a-wtinau.adb,
	system-linux-alpha.ads, s-os_lib.ads, a-coorse.ads,
	system-linux-s390.ads, s-imgwiu.adb, a-chtgop.adb, s-valboo.ads,
	a-chtgke.ads, a-tienio.adb, s-conca3.adb, a-wtinau.ads,
	system-darwin-ppc.ads, i-c.adb, s-expllu.adb, g-expect.adb,
	g-sha256.ads, s-vallld.adb, s-imgwiu.ads, a-chtgop.ads, a-strmap.adb,
	a-tienio.ads, s-conca3.ads, s-imgint.adb, i-c.ads, s-expllu.ads,
	s-osprim-darwin.adb, a-cogeso.adb, g-expect.ads, a-iwteio.ads,
	s-vallld.ads, a-coinho-shared.adb, g-shsh64.adb, a-strmap.ads,
	g-comlin.adb, a-excpol.adb, s-imgint.ads, a-ztdeau.adb, a-cogeso.ads,
	a-coinho-shared.ads, g-shsh64.ads, g-comlin.ads, a-stzsup.adb,
	a-rbtgbk.adb, a-wtmoau.adb, a-ztdeau.ads, s-exnlli.adb, g-tty.adb,
	g-heasor.adb, g-socthi-dummy.adb, s-llflex.ads, a-zchara.ads,
	a-stzsup.ads, a-ztcstr.adb, a-rbtgbk.ads, a-sfwtio.ads, a-wtmoau.ads,
	a-sulcin.adb, s-exnlli.ads, system-freebsd.ads, a-stunha.adb,
	a-charac.ads, g-tty.ads, g-heasor.ads, s-exctra.adb,
	g-socthi-dummy.ads, a-coboho.adb, a-ztcstr.ads, a-tideio.adb,
	a-sulcin.ads, a-wrstfi.adb, g-alleve.adb, s-pack59.adb, a-ngrear.adb,
	a-stboha.adb, a-stunau-shared.adb, a-stunha.ads, a-lfwtio.ads,
	s-fileio.adb, s-exctra.ads, a-coboho.ads, a-ioexce.ads, a-tideio.ads,
	a-ngrear.ads, a-wrstfi.ads, s-pack59.ads, g-alleve.ads, a-stboha.ads,
	s-poosiz.adb, g-traceb.adb, g-rannum.adb, machcode.ads, s-purexc.ads,
	s-fileio.ads, a-cfinve.adb, a-crbtgk.adb, system-solaris-x86.ads,
	s-poosiz.ads, g-rannum.ads, g-traceb.ads, a-except.adb, s-conca4.adb,
	a-stream.adb, a-cfinve.ads, a-crbtgk.ads, s-wchwts.adb,
	system-mingw.ads, a-except.ads, s-conca4.ads, a-chzla9.ads,
	s-valenu.adb, s-soflin.adb, a-stream.ads, a-cgarso.adb, s-valllu.adb,
	g-crc32.adb, s-wchwts.ads, s-fatflt.ads, s-imguns.adb, s-strcom.adb,
	g-decstr.adb, s-valenu.ads, s-soflin.ads, a-cgarso.ads, a-cwila1.ads,
	s-valllu.ads, g-crc32.ads, s-imguns.ads, g-spipat.adb, s-valwch.adb,
	s-strcom.ads, g-decstr.ads, text_io.ads, g-debuti.adb, s-stchop.adb,
	g-spipat.ads, s-valwch.ads, a-string.ads, s-exnint.adb, g-awk.adb,
	g-tasloc.adb, s-wwdenu.adb, s-boustr.adb, a-zchuni.adb, s-stchop.ads,
	g-debuti.ads, s-stopoo.adb, system-dragonfly-x86_64.ads,
	system-linux-x86.ads, s-exnint.ads, g-awk.ads, a-stzhas.adb,
	g-tasloc.ads, s-wwdenu.ads, g-debpoo.adb, g-except.ads,
	g-sse.ads, s-boustr.ads, a-zchuni.ads, s-bitops.adb, s-wwdwch.adb,
	s-stopoo.ads, a-catizo.adb, a-stzhas.ads, a-nlcefu.ads, g-debpoo.ads,
	i-vxwoio.adb, s-bitops.ads, g-io-put-vxworks.adb, s-wwdwch.ads,
	g-sehamd.adb, a-ssicst.adb, a-catizo.ads, s-mmap.adb, g-string.adb,
	s-traceb.adb, a-swunau.adb, s-rannum.adb, a-ticoau.adb, i-vxwoio.ads,
	g-sehamd.ads, a-stwiun.adb, a-ssicst.ads, s-conca5.adb, a-ssitio.ads,
	s-mmap.ads, a-zttest.adb, g-string.ads, g-sercom.adb, a-cdlili.adb,
	a-swunau.ads, s-traceb.ads, s-rannum.ads, a-ticoau.ads, system-aix.ads,
	a-cforma.adb, a-stwiun.ads, s-conca5.ads, s-carsi8.adb, a-zttest.ads,
	g-sercom.ads, a-cdlili.ads, a-cihama.adb, g-sptain.ads, a-cforma.ads,
	s-maccod.ads, s-carsi8.ads, a-strsup.adb, g-sha1.adb, a-cihama.ads,
	g-stseme.adb, s-traent.adb, s-valcha.adb, g-curexc.ads, a-strsup.ads,
	g-sha1.ads, a-sflcin.ads, s-traent.ads, s-pack10.adb, s-valcha.ads,
	a-coteio.ads, s-tasloc.adb, g-utf_32.adb, a-suteio.adb, s-except.adb,
	a-direct.adb, g-stsifd-sockets.adb, a-numaux-vxworks.ads, s-winext.ads,
	s-pack10.ads, a-ztexio.adb, a-tiflau.adb, system-vxworks-arm.ads,
	s-tasloc.ads, a-suteio.ads, g-utf_32.ads, s-except.ads,
	a-direct.ads, a-swbwha.adb, g-hesorg.adb, s-wwdcha.adb, a-wtedit.adb,
	a-ztexio.ads, a-wtcoio.adb, a-tiflau.ads, a-ssizti.ads, s-casi32.adb,
	a-swbwha.ads, s-veboop.adb, g-hesorg.ads, s-parame-rtems.adb,
	s-wwdcha.ads, a-wtedit.ads, a-stuten.adb, a-coinve.adb, a-wtcoio.ads,
	s-casi32.ads, s-string.adb, a-tiinau.adb, a-cusyqu.adb, s-conca6.adb,
	s-veboop.ads, a-cgcaso.adb, a-numaux-darwin.adb, a-envvar.adb,
	a-stuten.ads, s-secsta.adb, a-coinve.ads, s-string.ads, a-cusyqu.ads,
	a-tiinau.ads, s-osprim-vxworks.adb, s-conca6.ads, g-spchge.adb,
	s-parint.adb, a-cuprqu.adb, a-cgcaso.ads, a-numaux-darwin.ads,
	a-envvar.ads, s-secsta.ads, g-spchge.ads, s-parint.ads, a-cuprqu.ads,
	a-swuwti.adb, a-flteio.ads, a-sbhcin.adb, a-coprnu.adb, g-u3spch.adb,
	s-atocou.adb, g-ctrl_c.adb, a-swuwti.ads, a-calend.adb, a-sbhcin.ads,
	a-coprnu.ads, g-dirope.adb, g-sha512.ads, g-u3spch.ads, s-atocou.ads,
	g-ctrl_c.ads, a-timoau.adb, a-witeio.adb, s-pack11.adb, a-strhas.adb,
	a-wtflio.adb, g-spitbo.adb, a-calend.ads, a-ztenio.adb, g-dirope.ads,
	a-slcain.adb, g-sechas.adb, a-timoau.ads, a-witeio.ads, s-pack11.ads,
	s-shasto.adb, s-traceb-mastop.adb, a-ciorse.adb, s-utf_32.adb,
	a-strhas.ads, a-wtflio.ads, g-spitbo.ads, a-ztenio.ads, a-slcain.ads,
	g-sechas.ads, s-gearop.adb, a-siztio.ads, s-pack20.adb, s-shasto.ads,
	a-ciorse.ads, s-utf_32.ads, s-crtl.ads, a-wtinio.adb, s-elaall.adb,
	s-explli.adb, s-chepoo.ads, s-gearop.ads, a-einuoc.adb, s-pack20.ads,
	system-linux-ia64.ads, a-swunau-shared.adb, a-wtinio.ads, g-alvety.ads,
	a-liztio.ads, g-calend.adb, s-conca7.adb, s-elaall.ads, s-explli.ads,
	a-einuoc.ads, s-widboo.adb, s-imgdec.adb, a-cbhama.adb, g-calend.ads,
	s-conca7.ads, a-llitio.ads, i-cexten.ads, a-coorma.adb, s-widboo.ads,
	s-diflio.adb, g-souinf.ads, s-imgdec.ads, g-strhas.ads, a-cbhama.ads,
	g-shshco.adb, a-ztdeio.adb, s-gloloc.adb, a-coorma.ads, g-wispch.adb,
	s-pack03.adb, g-eacodu.adb, s-casi16.adb, s-diflio.ads, a-colien.adb,
	g-shshco.ads, a-wtmoio.adb, a-rbtgbo.adb, a-ztdeio.ads,
	system-rtems.ads, s-gloloc.ads, a-csquin.ads, a-cofuse.adb,
	g-wispch.ads, s-pack03.ads, s-casi16.ads, s-io.adb, a-colien.ads,
	g-alveop.adb, gnat.ads, s-diinio.adb, a-cfdlli.adb, g-pehage.adb,
	a-wtmoio.ads, a-stwiha.adb, a-locale.adb, a-tirsfi.adb, a-nscoty.ads,
	a-rbtgbo.ads, s-pack12.adb, a-cofuse.ads, a-sfteio.ads, s-io.ads,
	g-alveop.ads, a-cfdlli.ads, s-diinio.ads, a-stwiha.ads, g-pehage.ads,
	a-locale.ads, a-tirsfi.ads, s-pack12.ads, s-valuti.adb, g-cppexc.adb,
	system-vxworks-ppc.ads, g-memdum.adb, a-lfteio.ads, s-pack21.adb,
	s-unstyp.ads, s-valuti.ads, g-cppexc.ads, system-hpux-ia64.ads,
	g-memdum.ads, g-soccon.ads, g-altive.ads, a-crbtgo.adb, s-pack21.ads,
	a-llizti.ads, a-numaux-libc-x86.ads, s-expint.adb, s-conca8.adb,
	a-crbtgo.ads, s-pack30.adb, s-vallli.adb, s-geveop.adb, s-expint.ads,
	a-direio.adb, s-conca8.ads, a-widcha.ads, s-pack30.ads, s-vallli.ads,
	s-strhas.adb, s-geveop.ads, g-md5.adb, a-direio.ads, a-numaux.ads,
	s-ransee.adb, a-szbzha.adb, i-cobol.adb, g-busorg.adb, s-strhas.ads,
	g-md5.ads, s-widenu.adb, s-ransee.ads, s-widllu.adb, a-szbzha.ads,
	a-ststio.adb, i-cobol.ads, g-busorg.ads, g-regpat.adb, s-widenu.ads,
	a-secain.adb, s-widllu.ads, s-pack13.adb, g-encstr.adb, a-ztcoau.adb,
	a-ststio.ads, s-widwch.adb, g-regpat.ads, s-atacco.adb, a-cborse.adb,
	a-secain.ads, s-pack13.ads, g-encstr.ads, a-ztcoau.ads, s-widwch.ads,
	g-io_aux.adb, s-atacco.ads, a-ncelfu.ads, interfac.ads, a-cborse.ads,
	g-regexp.adb, s-pack22.adb, a-szuzti.adb, g-io_aux.ads, s-caun32.adb,
	a-nselfu.ads, g-regexp.ads, s-pack22.ads, a-ticoio.adb, a-szuzti.ads,
	g-diopit.adb, s-caun32.ads, s-conca9.adb, a-tags.adb, a-swmwco.ads,
	a-sbecin.adb, s-pack31.adb, s-expuns.adb, a-ticoio.ads, s-valint.adb,
	s-conca9.ads, g-diopit.ads, a-tags.ads, a-nllcef.ads, a-izteio.ads,
	a-sbecin.ads, s-expuns.ads, s-pack31.ads, g-dyntab.adb, s-powtab.ads,
	s-flocon-none.adb, s-valint.ads, a-ssiwti.ads, s-mmosin-mingw.adb,
	s-pack40.adb, s-pack05.adb, a-ztflau.adb, g-dyntab.ads,
	a-szuzti-shared.adb, g-alvevi.ads, a-stwise.adb, s-mmosin-mingw.ads,
	s-pack40.ads, a-diocst.adb, a-ztflau.ads, s-pack05.ads, a-nlcoty.ads,
	a-contai.ads, a-stwisu.adb, g-byorma.adb, a-siwtio.ads, a-stwise.ads,
	s-regpat.adb, g-mbdira.adb, s-pack14.adb, a-diocst.ads, g-flocon.ads,
	g-mbflra.adb, a-ztinau.adb, s-dim.ads, s-mantis.adb, a-stwisu.ads,
	g-byorma.ads, s-atopri.adb, g-wistsp.ads, a-uncdea.ads, s-widcha.adb,
	a-caldel.adb, s-regpat.ads, g-mbdira.ads, a-tiflio.adb, s-pack14.ads,
	s-parame.adb, a-liwtio.ads, s-memory.adb, g-mbflra.ads, a-ztinau.ads,
	a-wtgeau.adb, s-direio.adb, s-mantis.ads, s-atopri.ads, s-widcha.ads,
	a-caldel.ads, s-pack23.adb, a-unccon.ads, a-tiflio.ads, s-parame.ads,
	a-llftio.ads, s-memory.ads, s-regexp.adb, a-wtgeau.ads, a-exexda.adb,
	s-direio.ads, s-pack23.ads, g-stheme.adb, a-tiinio.adb, g-sestin.ads,
	s-regexp.ads, a-wtfiio.adb, a-comutr.adb, a-exexpr.adb, a-tiinio.ads,
	a-ztmoau.adb, a-cohata.ads, a-wtfiio.ads, s-imgrea.adb, ada.ads,
	a-szunau-shared.adb, a-comutr.ads, s-valuns.adb, a-ztmoau.ads,
	system-linux-arm.ads, s-osprim-x32.adb, s-pack41.adb, s-pack06.adb,
	s-imgrea.ads, s-valuns.ads, s-finroo.adb, s-caun16.adb, s-pooglo.adb,
	a-zrstfi.adb, a-suenst.adb, s-pack41.ads, g-binenv.adb, s-pack06.ads,
	a-calari.adb, a-nlcoar.ads, s-finroo.ads, a-timoio.adb, s-caun16.ads,
	s-flocon.adb, a-suenst.ads, a-zrstfi.ads, s-pooglo.ads, s-wchcon.adb,
	s-traceb-hpux.adb, s-pack50.adb, i-fortra.adb, s-pack15.adb,
	a-ngcefu.adb, g-sptavs.ads, g-binenv.ads, s-wchjis.adb, a-calari.ads,
	a-timoio.ads, a-decima.adb, s-flocon.ads, s-wchcon.ads, a-llfzti.ads,
	i-fortra.ads, s-pack50.ads, s-pack15.ads, a-ngcefu.ads, a-cfhase.adb,
	s-wchjis.ads, g-soliop.ads, a-decima.ads, a-chlat9.ads, s-pack24.adb,
	a-nlelfu.ads, a-cfhase.ads, g-locfil.adb, s-atocou-builtin.adb,
	s-memcop.ads, a-szunau.adb, s-pack24.ads, s-imgllb.adb, s-auxdec.adb,
	g-locfil.ads, s-pack33.adb, a-szunau.ads, s-parame-vxworks.adb,
	s-imgllb.ads, a-ciorma.adb, s-auxdec.ads, a-cobove.adb, s-dsaser.ads,
	a-elchha.adb, s-pack33.ads, a-cofuve.adb, s-parame-vxworks.ads,
	a-ciorma.ads, system-darwin-x86.ads, s-multip.adb, a-stwiun-shared.adb,
	a-wichun.adb, a-cobove.ads, s-imgbiu.adb, s-tsmona-mingw.adb,
	a-coormu.adb, a-siocst.adb, s-win32.ads, a-elchha.ads, s-pack42.adb,
	s-pack07.adb, a-cofuve.ads, system-hpux.ads, a-teioed.adb,
	a-convec.adb, g-speche.adb, s-multip.ads, a-stwiun-shared.ads,
	a-wichun.ads, s-imgbiu.ads, a-numeri.ads, a-siocst.ads, a-coormu.ads,
	a-lliwti.ads, s-pack42.ads, s-pack07.ads, a-teioed.ads, a-convec.ads,
	g-speche.ads, g-socthi.adb, a-nucoty.ads, a-szmzco.ads, s-pack51.adb,
	s-osprim-mingw.adb, s-casi64.adb, g-strspl.ads, g-socthi.ads,
	g-socket-dummy.adb, s-pack51.ads, s-dimmks.ads, s-casi64.ads,
	a-wtenau.adb, s-stchop-vxworks.adb, s-pack60.adb,
	system-solaris-sparc.ads, s-pack25.adb, g-socket-dummy.ads,
	a-exstat.adb, a-cofuma.adb, s-tsmona-linux.adb, a-wtenau.ads,
	s-pack60.ads, s-pack25.ads, i-cstrea.adb, a-cofuma.ads, g-exptty.adb,
	a-chzla1.ads, s-pack34.adb, i-cstrea.ads, s-excdeb.adb, a-iteint.ads,
	g-exptty.ads, i-pacdec.adb, s-pack34.ads, s-rident.ads, s-sopco3.adb,
	i-vxwork.ads, s-excdeb.ads, system-linux-ppc.ads, a-swuwti-shared.adb,
	s-widlli.adb, s-pack43.adb, i-pacdec.ads, a-cwila9.ads, s-sopco3.ads,
	a-fwteio.ads, s-widlli.ads, s-pack43.ads, a-suhcin.adb, a-wtdeau.adb,
	g-allein.ads, a-suezst.adb, a-dirval-mingw.adb, g-zspche.adb,
	s-bignum.adb, a-ztedit.adb, g-regist.adb, a-nllefu.ads, a-ztcoio.adb,
	s-pack52.adb, a-llctio.ads, a-nucoar.ads, s-pack17.adb, a-suhcin.ads,
	a-wtdeau.ads, a-suezst.ads, a-dirval.adb, g-zspche.ads, g-regist.ads,
	a-ztedit.ads, s-bignum.ads, a-wtcstr.adb, system.ads, s-pack52.ads,
	a-ztcoio.ads, s-pack17.ads, s-imgboo.adb, a-rbtgso.adb, a-dirval.ads,
	a-cohase.adb, s-pack61.adb, a-wtcstr.ads, s-pack26.adb, s-osprim.ads,
	a-tigeau.adb, s-imgboo.ads, a-nuelfu.ads, a-swfwha.ads, s-commun.adb,
	g-socthi-vxworks.adb, a-rbtgso.ads, a-cohase.ads, g-zstspl.ads,
	s-pack61.ads, s-pack26.ads, a-intnam-dragonfly.ads, s-imglld.adb,
	a-tigeau.ads, s-commun.ads, g-socthi-vxworks.ads, a-cborma.adb,
	a-stwifi.adb, g-moreex.adb, s-pack35.adb, s-imglld.ads, s-valdec.adb,
	a-tifiio.adb, a-cborma.ads, g-moreex.ads, a-stwifi.ads, s-pack35.ads,
	s-sopco4.adb, g-sha224.ads, g-socket.adb, a-intnam-rtems.ads,
	s-finmas.adb, s-valdec.ads, s-addima.adb, a-finali.adb, a-tifiio.ads,
	s-rpc.adb, a-ztflio.adb, s-pack44.adb, s-pack09.adb, a-sblcin.adb,
	s-sopco4.ads, a-textio.adb, g-socket.ads, g-sptabo.ads, s-finmas.ads,
	g-shsh32.adb, s-addima.ads, a-finali.ads, s-mmauni-long.ads, s-rpc.ads,
	a-ztflio.ads, system-djgpp.ads, s-stache.adb, s-pack44.ads,
	s-pack09.ads, a-sblcin.ads, a-textio.ads, a-cidlli.adb, g-shsh32.ads,
	a-chtgbk.adb, a-tiocst.adb, s-pack53.adb, s-pack18.adb, s-stache.ads,
	a-zchhan.adb, s-fatlfl.ads, a-ztinio.adb, s-strops.adb, a-siteio.ads,
	a-cidlli.ads, a-chtgbk.ads, g-ssvety.ads, a-tiocst.ads, s-pack53.ads,
	s-parame-hpux.ads, s-pack18.ads, a-zchhan.ads, s-strops.ads,
	a-ztinio.ads, a-wichha.adb, a-stwima.adb, a-nlrear.ads, a-liteio.ads,
	s-pack62.adb, s-pack27.adb, s-fore.adb, s-vercon.adb, a-wichha.ads,
	a-stwima.ads, s-pack62.ads, system-linux-sparc.ads, s-pack27.ads,
	g-dynhta.adb, s-fore.ads, s-vercon.ads, a-cofuba.adb, a-cimutr.adb,
	i-cpoint.adb, s-imgenu.adb, a-stwibo.adb, s-pack36.adb, i-cstrin.adb,
	s-imgllu.adb, a-suteio-shared.adb, g-excact.adb, s-stoele.adb,
	s-addope.adb, g-dynhta.ads, a-cofuba.ads, a-ztmoio.adb, a-llfwti.ads,
	a-cimutr.ads, i-cpoint.ads, s-imgenu.ads, a-stwibo.ads, a-wttest.adb,
	s-pack36.ads, a-tgdico.ads, s-sopco5.adb, s-scaval.adb, i-cstrin.ads,
	s-imgllu.ads, g-excact.ads, s-stoele.ads, g-deutst.ads, s-addope.ads,
	s-imgwch.adb, g-sha384.ads, a-ztmoio.ads, s-pack45.adb, a-wttest.ads,
	s-sopco5.ads, s-excmac-gcc.adb, s-scaval.ads, a-storio.adb,
	a-coinho.adb, a-btgbso.adb, s-imgwch.ads, s-carun8.adb, memtrack.adb,
	s-pack45.ads, a-sfhcin.ads, s-excmac-gcc.ads, a-storio.ads,
	a-coinho.ads, a-btgbso.ads, s-stratt.adb, s-carun8.ads, a-shcain.adb,
	s-pack54.adb, s-pack19.adb, a-colire.adb, a-tigeli.adb, s-caun64.adb,
	s-stratt.ads, s-fatgen.adb, a-shcain.ads, a-stzunb-shared.adb,
	s-pack54.ads, s-pack19.ads, a-colire.ads, a-calcon.adb, s-caun64.ads,
	s-fatgen.ads, s-pack63.adb, g-arrspl.adb, a-stzunb-shared.ads,
	s-pack28.adb, a-nllrar.ads, a-zzboio.adb, a-zzunio.ads, a-stunau.adb,
	a-calcon.ads, g-cgideb.adb, s-objrea.adb, s-mastop.adb, a-tienau.adb,
	g-altcon.adb, g-arrspl.ads, s-pack63.ads, s-restri.adb, s-pack28.ads,
	a-zzboio.ads, a-stunau.ads, g-cgideb.ads, g-htable.adb, g-sothco.adb,
	s-objrea.ads, g-soliop-solaris.ads, s-mastop.ads, a-tienau.ads,
	system-linux-m68k.ads, g-altcon.ads, s-dmotpr.ads, s-memory-mingw.adb,
	g-cgicoo.adb, s-pack37.adb, s-restri.ads, s-fatllf.ads, s-expmod.adb,
	a-swuwha.adb, a-exextr.adb, a-cfhama.adb, s-gloloc-mingw.adb,
	a-tiboio.adb, g-forstr.adb, g-sothco.ads, a-stzbou.adb, a-nllcty.ads,
	a-suecin.adb, g-htable.ads, s-exctab.adb, a-tiunio.ads, g-cgicoo.ads,
	s-osprim-posix.adb, s-pack37.ads, a-ciormu.adb, s-atocou-x86.adb,
	a-swuwha.ads, s-expmod.ads, a-cfhama.ads, s-ficobl.ads, a-ngcoty.adb,
	g-forstr.ads, a-tiboio.ads, a-calfor.adb, a-stzbou.ads, a-suecin.ads,
	a-conhel.adb, a-crbltr.ads, s-exctab.ads, a-dhfina.ads, s-imgcha.adb,
	s-pack46.adb, a-ciormu.ads, system-linux-sh4.ads, a-chahan.adb,
	a-ngcoty.ads, a-stzunb.adb, a-szfzha.ads, a-calfor.ads, a-cbdlli.adb,
	a-conhel.ads, s-imgcha.ads, s-pack46.ads, a-assert.adb, a-chahan.ads,
	a-stzunb.ads, a-crdlli.adb, s-pack55.adb, a-cbdlli.ads, a-tideau.adb,
	a-assert.ads, ioexcept.ads, s-boarop.ads, g-hesora.adb, a-crdlli.ads,
	s-pack55.ads, a-tideau.ads, g-bubsor.adb, a-wtenio.adb, a-cbsyqu.adb,
	g-hesora.ads, s-pack29.adb, a-nurear.ads, g-catiio.adb, s-stposu.adb,
	g-bubsor.ads, a-wtenio.ads, a-cbsyqu.ads, a-suewst.adb,
	system-vxworks-x86.ads, s-pack29.ads, a-cbmutr.adb, a-cbprqu.adb,
	s-imenne.adb, g-sothco-dummy.adb, g-casuti.adb, g-catiio.ads,
	s-stposu.ads, a-stzsea.adb, s-pack38.adb, a-suewst.ads, s-imgllw.adb,
	a-cbprqu.ads, a-cbmutr.ads, s-imenne.ads, g-sothco-dummy.ads,
	g-casuti.ads, s-htable.adb, s-fatsfl.ads, g-trasym.adb, unchconv.ads,
	a-stzsea.ads, s-arit64.adb, s-pack38.ads, a-nllcar.ads, s-valrea.adb,
	s-imgllw.ads, s-htable.ads, a-sequio.adb, g-trasym.ads, a-ngcoar.adb,
	s-exnllf.adb, s-pack47.adb, s-arit64.ads, g-sercom-mingw.adb,
	s-valrea.ads, g-socthi-mingw.adb, g-bytswa.adb, g-sehash.adb,
	unchdeal.ads, a-sequio.ads, a-ngcoar.ads, s-exnllf.ads, a-wtdeio.adb,
	s-pack47.ads, g-socthi-mingw.ads, a-excpol-abort.adb, a-ztgeau.adb,
	g-bytswa.ads, g-sehash.ads, s-pack56.adb, a-wtdeio.ads, a-ngelfu.adb,
	a-ztgeau.ads, a-cforse.adb, s-filatt.ads, a-stzfix.adb, a-cihase.adb,
	s-pack56.ads, a-sfztio.ads, a-ngelfu.ads, s-trasym-dwarf.adb,
	a-cforse.ads, a-ztfiio.adb, g-timsta.adb, a-stzfix.ads, a-cihase.ads,
	a-ztfiio.ads, system-darwin-arm.ads: Move non-tasking runtime sources
	to libgnat subdirectory.

From-SVN: r251902

1 files changed, 0 insertions, 595 deletions

diff --git a/gcc/ada/a-cihase.ads b/gcc/ada/a-cihase.ads
deleted file mode 100644
index 2eae9d2..0000000
--- a/gcc/ada/a-cihase.ads
+++ /dev/null
@@ -1,595 +0,0 @@
-------------------------------------------------------------------------------
---                                                                          --
---                         GNAT LIBRARY COMPONENTS                          --
---                                                                          --
---                  ADA.CONTAINERS.INDEFINITE_HASHED_SETS                   --
---                                                                          --
---                                 S p e c                                  --
---                                                                          --
---          Copyright (C) 2004-2015, Free Software Foundation, Inc.         --
---                                                                          --
--- This specification is derived from the Ada Reference Manual for use with --
--- GNAT. The copyright notice above, and the license provisions that follow --
--- apply solely to the  contents of the part following the private keyword. --
---                                                                          --
--- GNAT is free software;  you can  redistribute it  and/or modify it under --
--- terms of the  GNU General Public License as published  by the Free Soft- --
--- ware  Foundation;  either version 3,  or (at your option) any later ver- --
--- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
--- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
--- or FITNESS FOR A PARTICULAR PURPOSE.                                     --
---                                                                          --
--- As a special exception under Section 7 of GPL version 3, you are granted --
--- additional permissions described in the GCC Runtime Library Exception,   --
--- version 3.1, as published by the Free Software Foundation.               --
---                                                                          --
--- You should have received a copy of the GNU General Public License and    --
--- a copy of the GCC Runtime Library Exception along with this program;     --
--- see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see    --
--- <http://www.gnu.org/licenses/>.                                          --
---                                                                          --
--- This unit was originally developed by Matthew J Heaney.                  --
-------------------------------------------------------------------------------
-
-with Ada.Iterator_Interfaces;
-
-private with Ada.Containers.Hash_Tables;
-with Ada.Containers.Helpers;
-private with Ada.Streams;
-private with Ada.Finalization;
-
-generic
-   type Element_Type (<>) is private;
-
-   with function Hash (Element : Element_Type) return Hash_Type;
-
-   with function Equivalent_Elements (Left, Right : Element_Type)
-                                     return Boolean;
-
-   with function "=" (Left, Right : Element_Type) return Boolean is <>;
-
-package Ada.Containers.Indefinite_Hashed_Sets is
-   pragma Annotate (CodePeer, Skip_Analysis);
-   pragma Preelaborate;
-   pragma Remote_Types;
-
-   type Set is tagged private
-     with Constant_Indexing => Constant_Reference,
-          Default_Iterator  => Iterate,
-          Iterator_Element  => Element_Type;
-
-   pragma Preelaborable_Initialization (Set);
-
-   type Cursor is private;
-   pragma Preelaborable_Initialization (Cursor);
-
-   Empty_Set : constant Set;
-   --  Set objects declared without an initialization expression are
-   --  initialized to the value Empty_Set.
-
-   No_Element : constant Cursor;
-   --  Cursor objects declared without an initialization expression are
-   --  initialized to the value No_Element.
-
-   function Has_Element (Position : Cursor) return Boolean;
-   --  Equivalent to Position /= No_Element
-
-   package Set_Iterator_Interfaces is new
-     Ada.Iterator_Interfaces (Cursor, Has_Element);
-
-   function "=" (Left, Right : Set) return Boolean;
-   --  For each element in Left, set equality attempts to find the equal
-   --  element in Right; if a search fails, then set equality immediately
-   --  returns False. The search works by calling Hash to find the bucket in
-   --  the Right set that corresponds to the Left element. If the bucket is
-   --  non-empty, the search calls the generic formal element equality operator
-   --  to compare the element (in Left) to the element of each node in the
-   --  bucket (in Right); the search terminates when a matching node in the
-   --  bucket is found, or the nodes in the bucket are exhausted. (Note that
-   --  element equality is called here, not Equivalent_Elements. Set equality
-   --  is the only operation in which element equality is used. Compare set
-   --  equality to Equivalent_Sets, which does call Equivalent_Elements.)
-
-   function Equivalent_Sets (Left, Right : Set) return Boolean;
-   --  Similar to set equality, with the difference that the element in Left is
-   --  compared to the elements in Right using the generic formal
-   --  Equivalent_Elements operation instead of element equality.
-
-   function To_Set (New_Item : Element_Type) return Set;
-   --  Constructs a singleton set comprising New_Element. To_Set calls Hash to
-   --  determine the bucket for New_Item.
-
-   function Capacity (Container : Set) return Count_Type;
-   --  Returns the current capacity of the set. Capacity is the maximum length
-   --  before which rehashing in guaranteed not to occur.
-
-   procedure Reserve_Capacity (Container : in out Set; Capacity : Count_Type);
-   --  Adjusts the current capacity, by allocating a new buckets array. If the
-   --  requested capacity is less than the current capacity, then the capacity
-   --  is contracted (to a value not less than the current length). If the
-   --  requested capacity is greater than the current capacity, then the
-   --  capacity is expanded (to a value not less than what is requested). In
-   --  either case, the nodes are rehashed from the old buckets array onto the
-   --  new buckets array (Hash is called once for each existing element in
-   --  order to compute the new index), and then the old buckets array is
-   --  deallocated.
-
-   function Length (Container : Set) return Count_Type;
-   --  Returns the number of items in the set
-
-   function Is_Empty (Container : Set) return Boolean;
-   --  Equivalent to Length (Container) = 0
-
-   procedure Clear (Container : in out Set);
-   --  Removes all of the items from the set
-
-   function Element (Position : Cursor) return Element_Type;
-   --  Returns the element of the node designated by the cursor
-
-   procedure Replace_Element
-     (Container : in out Set;
-      Position  : Cursor;
-      New_Item  : Element_Type);
-   --  If New_Item is equivalent (as determined by calling Equivalent_Elements)
-   --  to the element of the node designated by Position, then New_Element is
-   --  assigned to that element. Otherwise, it calls Hash to determine the
-   --  bucket for New_Item. If the bucket is not empty, then it calls
-   --  Equivalent_Elements for each node in that bucket to determine whether
-   --  New_Item is equivalent to an element in that bucket. If
-   --  Equivalent_Elements returns True then Program_Error is raised (because
-   --  an element may appear only once in the set); otherwise, New_Item is
-   --  assigned to the node designated by Position, and the node is moved to
-   --  its new bucket.
-
-   procedure Query_Element
-     (Position : Cursor;
-      Process  : not null access procedure (Element : Element_Type));
-   --  Calls Process with the element (having only a constant view) of the node
-   --  designated by the cursor.
-
-   type Constant_Reference_Type
-     (Element : not null access constant Element_Type) is private
-        with Implicit_Dereference => Element;
-
-   function Constant_Reference
-     (Container : aliased Set;
-      Position  : Cursor) return Constant_Reference_Type;
-   pragma Inline (Constant_Reference);
-
-   procedure Assign (Target : in out Set; Source : Set);
-
-   function Copy (Source : Set; Capacity : Count_Type := 0) return Set;
-
-   procedure Move (Target : in out Set; Source : in out Set);
-   --  Clears Target (if it's not empty), and then moves (not copies) the
-   --  buckets array and nodes from Source to Target.
-
-   procedure Insert
-     (Container : in out Set;
-      New_Item  : Element_Type;
-      Position  : out Cursor;
-      Inserted  : out Boolean);
-   --  Conditionally inserts New_Item into the set. If New_Item is already in
-   --  the set, then Inserted returns False and Position designates the node
-   --  containing the existing element (which is not modified). If New_Item is
-   --  not already in the set, then Inserted returns True and Position
-   --  designates the newly-inserted node containing New_Item. The search for
-   --  an existing element works as follows. Hash is called to determine
-   --  New_Item's bucket; if the bucket is non-empty, then Equivalent_Elements
-   --  is called to compare New_Item to the element of each node in that
-   --  bucket. If the bucket is empty, or there were no equivalent elements in
-   --  the bucket, the search "fails" and the New_Item is inserted in the set
-   --  (and Inserted returns True); otherwise, the search "succeeds" (and
-   --  Inserted returns False).
-
-   procedure Insert  (Container : in out Set; New_Item : Element_Type);
-   --  Attempts to insert New_Item into the set, performing the usual insertion
-   --  search (which involves calling both Hash and Equivalent_Elements); if
-   --  the search succeeds (New_Item is equivalent to an element already in the
-   --  set, and so was not inserted), then this operation raises
-   --  Constraint_Error. (This version of Insert is similar to Replace, but
-   --  having the opposite exception behavior. It is intended for use when you
-   --  want to assert that the item is not already in the set.)
-
-   procedure Include (Container : in out Set; New_Item : Element_Type);
-   --  Attempts to insert New_Item into the set. If an element equivalent to
-   --  New_Item is already in the set (the insertion search succeeded, and
-   --  hence New_Item was not inserted), then the value of New_Item is assigned
-   --  to the existing element. (This insertion operation only raises an
-   --  exception if cursor tampering occurs. It is intended for use when you
-   --  want to insert the item in the set, and you don't care whether an
-   --  equivalent element is already present.)
-
-   procedure Replace (Container : in out Set; New_Item : Element_Type);
-   --  Searches for New_Item in the set; if the search fails (because an
-   --  equivalent element was not in the set), then it raises
-   --  Constraint_Error. Otherwise, the existing element is assigned the value
-   --  New_Item. (This is similar to Insert, but with the opposite exception
-   --  behavior. It is intended for use when you want to assert that the item
-   --  is already in the set.)
-
-   procedure Exclude (Container : in out Set; Item : Element_Type);
-   --  Searches for Item in the set, and if found, removes its node from the
-   --  set and then deallocates it. The search works as follows. The operation
-   --  calls Hash to determine the item's bucket; if the bucket is not empty,
-   --  it calls Equivalent_Elements to compare Item to the element of each node
-   --  in the bucket. (This is the deletion analog of Include. It is intended
-   --  for use when you want to remove the item from the set, but don't care
-   --  whether the item is already in the set.)
-
-   procedure Delete  (Container : in out Set; Item : Element_Type);
-   --  Searches for Item in the set (which involves calling both Hash and
-   --  Equivalent_Elements). If the search fails, then the operation raises
-   --  Constraint_Error. Otherwise it removes the node from the set and then
-   --  deallocates it. (This is the deletion analog of non-conditional
-   --  Insert. It is intended for use when you want to assert that the item is
-   --  already in the set.)
-
-   procedure Delete (Container : in out Set; Position  : in out Cursor);
-   --  Removes the node designated by Position from the set, and then
-   --  deallocates the node. The operation calls Hash to determine the bucket,
-   --  and then compares Position to each node in the bucket until there's a
-   --  match (it does not call Equivalent_Elements).
-
-   procedure Union (Target : in out Set; Source : Set);
-   --  The operation first calls Reserve_Capacity if the current capacity is
-   --  less than the sum of the lengths of Source and Target. It then iterates
-   --  over the Source set, and conditionally inserts each element into Target.
-
-   function Union (Left, Right : Set) return Set;
-   --  The operation first copies the Left set to the result, and then iterates
-   --  over the Right set to conditionally insert each element into the result.
-
-   function "or" (Left, Right : Set) return Set renames Union;
-
-   procedure Intersection (Target : in out Set; Source : Set);
-   --  Iterates over the Target set (calling First and Next), calling Find to
-   --  determine whether the element is in Source. If an equivalent element is
-   --  not found in Source, the element is deleted from Target.
-
-   function Intersection (Left, Right : Set) return Set;
-   --  Iterates over the Left set, calling Find to determine whether the
-   --  element is in Right. If an equivalent element is found, it is inserted
-   --  into the result set.
-
-   function "and" (Left, Right : Set) return Set renames Intersection;
-
-   procedure Difference (Target : in out Set; Source : Set);
-   --  Iterates over the Source (calling First and Next), calling Find to
-   --  determine whether the element is in Target. If an equivalent element is
-   --  found, it is deleted from Target.
-
-   function Difference (Left, Right : Set) return Set;
-   --  Iterates over the Left set, calling Find to determine whether the
-   --  element is in the Right set. If an equivalent element is not found, the
-   --  element is inserted into the result set.
-
-   function "-" (Left, Right : Set) return Set renames Difference;
-
-   procedure Symmetric_Difference (Target : in out Set; Source : Set);
-   --  The operation first calls Reserve_Capacity if the current capacity is
-   --  less than the sum of the lengths of Source and Target. It then iterates
-   --  over the Source set, searching for the element in Target (calling Hash
-   --  and Equivalent_Elements). If an equivalent element is found, it is
-   --  removed from Target; otherwise it is inserted into Target.
-
-   function Symmetric_Difference (Left, Right : Set) return Set;
-   --  The operation first iterates over the Left set. It calls Find to
-   --  determine whether the element is in the Right set. If no equivalent
-   --  element is found, the element from Left is inserted into the result. The
-   --  operation then iterates over the Right set, to determine whether the
-   --  element is in the Left set. If no equivalent element is found, the Right
-   --  element is inserted into the result.
-
-   function "xor" (Left, Right : Set) return Set
-     renames Symmetric_Difference;
-
-   function Overlap (Left, Right : Set) return Boolean;
-   --  Iterates over the Left set (calling First and Next), calling Find to
-   --  determine whether the element is in the Right set. If an equivalent
-   --  element is found, the operation immediately returns True. The operation
-   --  returns False if the iteration over Left terminates without finding any
-   --  equivalent element in Right.
-
-   function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
-   --  Iterates over Subset (calling First and Next), calling Find to determine
-   --  whether the element is in Of_Set. If no equivalent element is found in
-   --  Of_Set, the operation immediately returns False. The operation returns
-   --  True if the iteration over Subset terminates without finding an element
-   --  not in Of_Set (that is, every element in Subset is equivalent to an
-   --  element in Of_Set).
-
-   function First (Container : Set) return Cursor;
-   --  Returns a cursor that designates the first non-empty bucket, by
-   --  searching from the beginning of the buckets array.
-
-   function Next (Position : Cursor) return Cursor;
-   --  Returns a cursor that designates the node that follows the current one
-   --  designated by Position. If Position designates the last node in its
-   --  bucket, the operation calls Hash to compute the index of this bucket,
-   --  and searches the buckets array for the first non-empty bucket, starting
-   --  from that index; otherwise, it simply follows the link to the next node
-   --  in the same bucket.
-
-   procedure Next (Position : in out Cursor);
-   --  Equivalent to Position := Next (Position)
-
-   function Find (Container : Set; Item : Element_Type) return Cursor;
-   --  Searches for Item in the set. Find calls Hash to determine the item's
-   --  bucket; if the bucket is not empty, it calls Equivalent_Elements to
-   --  compare Item to each element in the bucket. If the search succeeds, Find
-   --  returns a cursor designating the node containing the equivalent element;
-   --  otherwise, it returns No_Element.
-
-   function Contains (Container : Set; Item : Element_Type) return Boolean;
-   --  Equivalent to Find (Container, Item) /= No_Element
-
-   function Equivalent_Elements (Left, Right : Cursor) return Boolean;
-   --  Returns the result of calling Equivalent_Elements with the elements of
-   --  the nodes designated by cursors Left and Right.
-
-   function Equivalent_Elements
-     (Left  : Cursor;
-      Right : Element_Type) return Boolean;
-   --  Returns the result of calling Equivalent_Elements with element of the
-   --  node designated by Left and element Right.
-
-   function Equivalent_Elements
-     (Left  : Element_Type;
-      Right : Cursor) return Boolean;
-   --  Returns the result of calling Equivalent_Elements with element Left and
-   --  the element of the node designated by Right.
-
-   procedure Iterate
-     (Container : Set;
-      Process   : not null access procedure (Position : Cursor));
-   --  Calls Process for each node in the set
-
-   function Iterate (Container : Set)
-     return Set_Iterator_Interfaces.Forward_Iterator'Class;
-
-   generic
-      type Key_Type (<>) is private;
-
-      with function Key (Element : Element_Type) return Key_Type;
-
-      with function Hash (Key : Key_Type) return Hash_Type;
-
-      with function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
-
-   package Generic_Keys is
-
-      function Key (Position : Cursor) return Key_Type;
-      --  Applies generic formal operation Key to the element of the node
-      --  designated by Position.
-
-      function Element (Container : Set; Key : Key_Type) return Element_Type;
-      --  Searches (as per the key-based Find) for the node containing Key, and
-      --  returns the associated element.
-
-      procedure Replace
-        (Container : in out Set;
-         Key       : Key_Type;
-         New_Item  : Element_Type);
-      --  Searches (as per the key-based Find) for the node containing Key, and
-      --  then replaces the element of that node (as per the element-based
-      --  Replace_Element).
-
-      procedure Exclude (Container : in out Set; Key : Key_Type);
-      --  Searches for Key in the set, and if found, removes its node from the
-      --  set and then deallocates it. The search works by first calling Hash
-      --  (on Key) to determine the bucket; if the bucket is not empty, it
-      --  calls Equivalent_Keys to compare parameter Key to the value of
-      --  generic formal operation Key applied to element of each node in the
-      --  bucket.
-
-      procedure Delete (Container : in out Set; Key : Key_Type);
-      --  Deletes the node containing Key as per Exclude, with the difference
-      --  that Constraint_Error is raised if Key is not found.
-
-      function Find (Container : Set; Key : Key_Type) return Cursor;
-      --  Searches for the node containing Key, and returns a cursor
-      --  designating the node. The search works by first calling Hash (on Key)
-      --  to determine the bucket. If the bucket is not empty, the search
-      --  compares Key to the element of each node in the bucket, and returns
-      --  the matching node. The comparison itself works by applying the
-      --  generic formal Key operation to the element of the node, and then
-      --  calling generic formal operation Equivalent_Keys.
-
-      function Contains (Container : Set; Key : Key_Type) return Boolean;
-      --  Equivalent to Find (Container, Key) /= No_Element
-
-      procedure Update_Element_Preserving_Key
-        (Container : in out Set;
-         Position  : Cursor;
-         Process   : not null access
-                       procedure (Element : in out Element_Type));
-      --  Calls Process with the element of the node designated by Position,
-      --  but with the restriction that the key-value of the element is not
-      --  modified. The operation first makes a copy of the value returned by
-      --  applying generic formal operation Key on the element of the node, and
-      --  then calls Process with the element. The operation verifies that the
-      --  key-part has not been modified by calling generic formal operation
-      --  Equivalent_Keys to compare the saved key-value to the value returned
-      --  by applying generic formal operation Key to the post-Process value of
-      --  element. If the key values compare equal then the operation
-      --  completes. Otherwise, the node is removed from the map and
-      --  Program_Error is raised.
-
-      type Reference_Type (Element : not null access Element_Type) is private
-        with Implicit_Dereference => Element;
-
-      function Reference_Preserving_Key
-        (Container : aliased in out Set;
-         Position  : Cursor) return Reference_Type;
-
-      function Constant_Reference
-        (Container : aliased Set;
-         Key       : Key_Type) return Constant_Reference_Type;
-
-      function Reference_Preserving_Key
-        (Container : aliased in out Set;
-         Key       : Key_Type) return Reference_Type;
-
-   private
-      type Set_Access is access all Set;
-      for Set_Access'Storage_Size use 0;
-
-      package Impl is new Helpers.Generic_Implementation;
-
-      type Reference_Control_Type is
-        new Impl.Reference_Control_Type with
-      record
-         Container : Set_Access;
-         Index     : Hash_Type;
-         Old_Pos   : Cursor;
-         Old_Hash  : Hash_Type;
-      end record;
-
-      overriding procedure Finalize (Control : in out Reference_Control_Type);
-      pragma Inline (Finalize);
-
-      type Reference_Type (Element : not null access Element_Type) is record
-         Control : Reference_Control_Type :=
-           raise Program_Error with "uninitialized reference";
-         --  The RM says, "The default initialization of an object of
-         --  type Constant_Reference_Type or Reference_Type propagates
-         --  Program_Error."
-      end record;
-
-      use Ada.Streams;
-
-      procedure Read
-        (Stream : not null access Root_Stream_Type'Class;
-         Item   : out Reference_Type);
-
-      for Reference_Type'Read use Read;
-
-      procedure Write
-        (Stream : not null access Root_Stream_Type'Class;
-         Item   : Reference_Type);
-
-      for Reference_Type'Write use Write;
-   end Generic_Keys;
-
-private
-   pragma Inline (Next);
-
-   type Node_Type;
-   type Node_Access is access Node_Type;
-
-   type Element_Access is access all Element_Type;
-
-   type Node_Type is limited record
-      Element : Element_Access;
-      Next    : Node_Access;
-   end record;
-
-   package HT_Types is
-     new Hash_Tables.Generic_Hash_Table_Types (Node_Type, Node_Access);
-
-   type Set is new Ada.Finalization.Controlled with record
-      HT : HT_Types.Hash_Table_Type;
-   end record;
-
-   overriding procedure Adjust (Container : in out Set);
-
-   overriding procedure Finalize (Container : in out Set);
-
-   use HT_Types, HT_Types.Implementation;
-   use Ada.Finalization;
-   use Ada.Streams;
-
-   procedure Write
-     (Stream    : not null access Root_Stream_Type'Class;
-      Container : Set);
-
-   for Set'Write use Write;
-
-   procedure Read
-     (Stream    : not null access Root_Stream_Type'Class;
-      Container : out Set);
-
-   for Set'Read use Read;
-
-   type Set_Access is access all Set;
-   for Set_Access'Storage_Size use 0;
-
-   type Cursor is record
-      Container : Set_Access;
-      Node      : Node_Access;
-   end record;
-
-   procedure Write
-     (Stream : not null access Root_Stream_Type'Class;
-      Item   : Cursor);
-
-   for Cursor'Write use Write;
-
-   procedure Read
-     (Stream : not null access Root_Stream_Type'Class;
-      Item   : out Cursor);
-
-   for Cursor'Read use Read;
-
-   subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-   --  It is necessary to rename this here, so that the compiler can find it
-
-   type Constant_Reference_Type
-     (Element : not null access constant Element_Type) is
-      record
-         Control : Reference_Control_Type :=
-           raise Program_Error with "uninitialized reference";
-         --  The RM says, "The default initialization of an object of
-         --  type Constant_Reference_Type or Reference_Type propagates
-         --  Program_Error."
-      end record;
-
-   procedure Read
-     (Stream : not null access Root_Stream_Type'Class;
-      Item   : out Constant_Reference_Type);
-
-   for Constant_Reference_Type'Read use Read;
-
-   procedure Write
-     (Stream : not null access Root_Stream_Type'Class;
-      Item   : Constant_Reference_Type);
-
-   for Constant_Reference_Type'Write use Write;
-
-   --  Three operations are used to optimize in the expansion of "for ... of"
-   --  loops: the Next(Cursor) procedure in the visible part, and the following
-   --  Pseudo_Reference and Get_Element_Access functions. See Sem_Ch5 for
-   --  details.
-
-   function Pseudo_Reference
-     (Container : aliased Set'Class) return Reference_Control_Type;
-   pragma Inline (Pseudo_Reference);
-   --  Creates an object of type Reference_Control_Type pointing to the
-   --  container, and increments the Lock. Finalization of this object will
-   --  decrement the Lock.
-
-   function Get_Element_Access
-     (Position : Cursor) return not null Element_Access;
-   --  Returns a pointer to the element designated by Position.
-
-   Empty_Set : constant Set := (Controlled with others => <>);
-
-   No_Element : constant Cursor := (Container => null, Node => null);
-
-   type Iterator is new Limited_Controlled and
-     Set_Iterator_Interfaces.Forward_Iterator with
-   record
-      Container : Set_Access;
-   end record
-     with Disable_Controlled => not T_Check;
-
-   overriding procedure Finalize (Object : in out Iterator);
-
-   overriding function First (Object : Iterator) return Cursor;
-
-   overriding function Next
-     (Object   : Iterator;
-      Position : Cursor) return Cursor;
-
-end Ada.Containers.Indefinite_Hashed_Sets;