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, 1933 insertions, 0 deletions

diff --git a/gcc/ada/libgnat/a-stwisu.adb b/gcc/ada/libgnat/a-stwisu.adb
new file mode 100644
index 0000000..b093476
--- /dev/null
+++ b/gcc/ada/libgnat/a-stwisu.adb
@@ -0,0 +1,1933 @@
+------------------------------------------------------------------------------
+--                                                                          --
+--                         GNAT RUN-TIME COMPONENTS                         --
+--                                                                          --
+--        A D A . S T R I N G S . W I D E _ S U P E R B O U N D E D         --
+--                                                                          --
+--                                 B o d y                                  --
+--                                                                          --
+--          Copyright (C) 2003-2017, Free Software Foundation, Inc.         --
+--                                                                          --
+-- 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/>.                                          --
+--                                                                          --
+-- GNAT was originally developed  by the GNAT team at  New York University. --
+-- Extensive contributions were provided by Ada Core Technologies Inc.      --
+--                                                                          --
+------------------------------------------------------------------------------
+
+with Ada.Strings.Wide_Maps;   use Ada.Strings.Wide_Maps;
+with Ada.Strings.Wide_Search;
+
+package body Ada.Strings.Wide_Superbounded is
+
+   ------------
+   -- Concat --
+   ------------
+
+   function Concat
+     (Left  : Super_String;
+      Right : Super_String) return Super_String
+   is
+   begin
+      return Result : Super_String (Left.Max_Length) do
+         declare
+            Llen : constant Natural := Left.Current_Length;
+            Rlen : constant Natural := Right.Current_Length;
+            Nlen : constant Natural := Llen + Rlen;
+
+         begin
+            if Nlen > Left.Max_Length then
+               raise Ada.Strings.Length_Error;
+            else
+               Result.Current_Length := Nlen;
+               Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+               Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen);
+            end if;
+         end;
+      end return;
+   end Concat;
+
+   function Concat
+     (Left  : Super_String;
+      Right : Wide_String) return Super_String
+   is
+   begin
+      return Result : Super_String (Left.Max_Length) do
+         declare
+            Llen : constant Natural := Left.Current_Length;
+            Nlen : constant Natural := Llen + Right'Length;
+
+         begin
+            if Nlen > Left.Max_Length then
+               raise Ada.Strings.Length_Error;
+            else
+               Result.Current_Length := Nlen;
+               Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+               Result.Data (Llen + 1 .. Nlen) := Right;
+            end if;
+         end;
+      end return;
+   end Concat;
+
+   function Concat
+     (Left  : Wide_String;
+      Right : Super_String) return Super_String
+   is
+   begin
+      return Result : Super_String (Right.Max_Length) do
+         declare
+            Llen : constant Natural := Left'Length;
+            Rlen : constant Natural := Right.Current_Length;
+            Nlen : constant Natural := Llen + Rlen;
+
+         begin
+            if Nlen > Right.Max_Length then
+               raise Ada.Strings.Length_Error;
+            else
+               Result.Current_Length := Nlen;
+               Result.Data (1 .. Llen) := Left;
+               Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen);
+            end if;
+         end;
+      end return;
+   end Concat;
+
+   function Concat
+     (Left  : Super_String;
+      Right : Wide_Character) return Super_String
+   is
+   begin
+      return Result : Super_String (Left.Max_Length) do
+         declare
+            Llen : constant Natural := Left.Current_Length;
+
+         begin
+            if Llen = Left.Max_Length then
+               raise Ada.Strings.Length_Error;
+            else
+               Result.Current_Length := Llen + 1;
+               Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+               Result.Data (Result.Current_Length) := Right;
+            end if;
+         end;
+      end return;
+   end Concat;
+
+   function Concat
+     (Left  : Wide_Character;
+      Right : Super_String) return Super_String
+   is
+   begin
+      return Result : Super_String (Right.Max_Length) do
+         declare
+            Rlen : constant Natural := Right.Current_Length;
+
+         begin
+            if Rlen = Right.Max_Length then
+               raise Ada.Strings.Length_Error;
+            else
+               Result.Current_Length := Rlen + 1;
+               Result.Data (1) := Left;
+               Result.Data (2 .. Result.Current_Length) :=
+                 Right.Data (1 .. Rlen);
+            end if;
+         end;
+      end return;
+   end Concat;
+
+   -----------
+   -- Equal --
+   -----------
+
+   function "="
+     (Left  : Super_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left.Current_Length = Right.Current_Length
+        and then Left.Data (1 .. Left.Current_Length) =
+                   Right.Data (1 .. Right.Current_Length);
+   end "=";
+
+   function Equal
+     (Left  : Super_String;
+      Right : Wide_String) return Boolean
+   is
+   begin
+      return Left.Current_Length = Right'Length
+        and then Left.Data (1 .. Left.Current_Length) = Right;
+   end Equal;
+
+   function Equal
+     (Left  : Wide_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left'Length = Right.Current_Length
+        and then Left = Right.Data (1 .. Right.Current_Length);
+   end Equal;
+
+   -------------
+   -- Greater --
+   -------------
+
+   function Greater
+     (Left  : Super_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) >
+               Right.Data (1 .. Right.Current_Length);
+   end Greater;
+
+   function Greater
+     (Left  : Super_String;
+      Right : Wide_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) > Right;
+   end Greater;
+
+   function Greater
+     (Left  : Wide_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left > Right.Data (1 .. Right.Current_Length);
+   end Greater;
+
+   ----------------------
+   -- Greater_Or_Equal --
+   ----------------------
+
+   function Greater_Or_Equal
+     (Left  : Super_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) >=
+               Right.Data (1 .. Right.Current_Length);
+   end Greater_Or_Equal;
+
+   function Greater_Or_Equal
+     (Left  : Super_String;
+      Right : Wide_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) >= Right;
+   end Greater_Or_Equal;
+
+   function Greater_Or_Equal
+     (Left  : Wide_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left >= Right.Data (1 .. Right.Current_Length);
+   end Greater_Or_Equal;
+
+   ----------
+   -- Less --
+   ----------
+
+   function Less
+     (Left  : Super_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) <
+               Right.Data (1 .. Right.Current_Length);
+   end Less;
+
+   function Less
+     (Left  : Super_String;
+      Right : Wide_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) < Right;
+   end Less;
+
+   function Less
+     (Left  : Wide_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left < Right.Data (1 .. Right.Current_Length);
+   end Less;
+
+   -------------------
+   -- Less_Or_Equal --
+   -------------------
+
+   function Less_Or_Equal
+     (Left  : Super_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) <=
+               Right.Data (1 .. Right.Current_Length);
+   end Less_Or_Equal;
+
+   function Less_Or_Equal
+     (Left  : Super_String;
+      Right : Wide_String) return Boolean
+   is
+   begin
+      return Left.Data (1 .. Left.Current_Length) <= Right;
+   end Less_Or_Equal;
+
+   function Less_Or_Equal
+     (Left  : Wide_String;
+      Right : Super_String) return Boolean
+   is
+   begin
+      return Left <= Right.Data (1 .. Right.Current_Length);
+   end Less_Or_Equal;
+
+   ----------------------
+   -- Set_Super_String --
+   ----------------------
+
+   procedure Set_Super_String
+     (Target : out Super_String;
+      Source : Wide_String;
+      Drop   : Truncation := Error)
+   is
+      Slen       : constant Natural := Source'Length;
+      Max_Length : constant Positive := Target.Max_Length;
+
+   begin
+      if Slen <= Max_Length then
+         Target.Current_Length := Slen;
+         Target.Data (1 .. Slen) := Source;
+
+      else
+         case Drop is
+            when Strings.Right =>
+               Target.Current_Length := Max_Length;
+               Target.Data (1 .. Max_Length) :=
+                 Source (Source'First .. Source'First - 1 + Max_Length);
+
+            when Strings.Left =>
+               Target.Current_Length := Max_Length;
+               Target.Data (1 .. Max_Length) :=
+                 Source (Source'Last - (Max_Length - 1) .. Source'Last);
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+   end Set_Super_String;
+
+   ------------------
+   -- Super_Append --
+   ------------------
+
+   --  Case of Super_String and Super_String
+
+   function Super_Append
+     (Left  : Super_String;
+      Right : Super_String;
+      Drop  : Strings.Truncation  := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Left.Max_Length;
+      Result : Super_String (Max_Length);
+      Llen   : constant Natural := Left.Current_Length;
+      Rlen   : constant Natural := Right.Current_Length;
+      Nlen   : constant Natural := Llen + Rlen;
+
+   begin
+      if Nlen <= Max_Length then
+         Result.Current_Length := Nlen;
+         Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+         Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen);
+
+      else
+         Result.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               if Llen >= Max_Length then -- only case is Llen = Max_Length
+                  Result.Data := Left.Data;
+
+               else
+                  Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+                  Result.Data (Llen + 1 .. Max_Length) :=
+                    Right.Data (1 .. Max_Length - Llen);
+               end if;
+
+            when Strings.Left =>
+               if Rlen >= Max_Length then -- only case is Rlen = Max_Length
+                  Result.Data := Right.Data;
+
+               else
+                  Result.Data (1 .. Max_Length - Rlen) :=
+                    Left.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
+                  Result.Data (Max_Length - Rlen + 1 .. Max_Length) :=
+                    Right.Data (1 .. Rlen);
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end Super_Append;
+
+   procedure Super_Append
+     (Source   : in out Super_String;
+      New_Item : Super_String;
+      Drop     : Truncation  := Error)
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Llen       : constant Natural := Source.Current_Length;
+      Rlen       : constant Natural := New_Item.Current_Length;
+      Nlen       : constant Natural := Llen + Rlen;
+
+   begin
+      if Nlen <= Max_Length then
+         Source.Current_Length := Nlen;
+         Source.Data (Llen + 1 .. Nlen) := New_Item.Data (1 .. Rlen);
+
+      else
+         Source.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               if Llen < Max_Length then
+                  Source.Data (Llen + 1 .. Max_Length) :=
+                    New_Item.Data (1 .. Max_Length - Llen);
+               end if;
+
+            when Strings.Left =>
+               if Rlen >= Max_Length then -- only case is Rlen = Max_Length
+                  Source.Data := New_Item.Data;
+
+               else
+                  Source.Data (1 .. Max_Length - Rlen) :=
+                    Source.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
+                  Source.Data (Max_Length - Rlen + 1 .. Max_Length) :=
+                    New_Item.Data (1 .. Rlen);
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+   end Super_Append;
+
+   --  Case of Super_String and Wide_String
+
+   function Super_Append
+     (Left  : Super_String;
+      Right : Wide_String;
+      Drop  : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Left.Max_Length;
+      Result : Super_String (Max_Length);
+      Llen   : constant Natural := Left.Current_Length;
+      Rlen   : constant Natural := Right'Length;
+      Nlen   : constant Natural := Llen + Rlen;
+
+   begin
+      if Nlen <= Max_Length then
+         Result.Current_Length := Nlen;
+         Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+         Result.Data (Llen + 1 .. Nlen) := Right;
+
+      else
+         Result.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               if Llen >= Max_Length then -- only case is Llen = Max_Length
+                  Result.Data := Left.Data;
+
+               else
+                  Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+                  Result.Data (Llen + 1 .. Max_Length) :=
+                    Right (Right'First .. Right'First - 1 +
+                             Max_Length - Llen);
+
+               end if;
+
+            when Strings.Left =>
+               if Rlen >= Max_Length then
+                  Result.Data (1 .. Max_Length) :=
+                    Right (Right'Last - (Max_Length - 1) .. Right'Last);
+
+               else
+                  Result.Data (1 .. Max_Length - Rlen) :=
+                    Left.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
+                  Result.Data (Max_Length - Rlen + 1 .. Max_Length) :=
+                    Right;
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end Super_Append;
+
+   procedure Super_Append
+     (Source   : in out Super_String;
+      New_Item : Wide_String;
+      Drop     : Truncation  := Error)
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Llen   : constant Natural := Source.Current_Length;
+      Rlen   : constant Natural := New_Item'Length;
+      Nlen   : constant Natural := Llen + Rlen;
+
+   begin
+      if Nlen <= Max_Length then
+         Source.Current_Length := Nlen;
+         Source.Data (Llen + 1 .. Nlen) := New_Item;
+
+      else
+         Source.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               if Llen < Max_Length then
+                  Source.Data (Llen + 1 .. Max_Length) :=
+                    New_Item (New_Item'First ..
+                                New_Item'First - 1 + Max_Length - Llen);
+               end if;
+
+            when Strings.Left =>
+               if Rlen >= Max_Length then
+                  Source.Data (1 .. Max_Length) :=
+                    New_Item (New_Item'Last - (Max_Length - 1) ..
+                                New_Item'Last);
+
+               else
+                  Source.Data (1 .. Max_Length - Rlen) :=
+                    Source.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
+                  Source.Data (Max_Length - Rlen + 1 .. Max_Length) :=
+                    New_Item;
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+   end Super_Append;
+
+   --  Case of Wide_String and Super_String
+
+   function Super_Append
+     (Left  : Wide_String;
+      Right : Super_String;
+      Drop  : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Right.Max_Length;
+      Result     : Super_String (Max_Length);
+      Llen       : constant Natural := Left'Length;
+      Rlen       : constant Natural := Right.Current_Length;
+      Nlen       : constant Natural := Llen + Rlen;
+
+   begin
+      if Nlen <= Max_Length then
+         Result.Current_Length := Nlen;
+         Result.Data (1 .. Llen) := Left;
+         Result.Data (Llen + 1 .. Llen + Rlen) := Right.Data (1 .. Rlen);
+
+      else
+         Result.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               if Llen >= Max_Length then
+                  Result.Data (1 .. Max_Length) :=
+                    Left (Left'First .. Left'First + (Max_Length - 1));
+
+               else
+                  Result.Data (1 .. Llen) := Left;
+                  Result.Data (Llen + 1 .. Max_Length) :=
+                    Right.Data (1 .. Max_Length - Llen);
+               end if;
+
+            when Strings.Left =>
+               if Rlen >= Max_Length then
+                  Result.Data (1 .. Max_Length) :=
+                    Right.Data (Rlen - (Max_Length - 1) .. Rlen);
+
+               else
+                  Result.Data (1 .. Max_Length - Rlen) :=
+                    Left (Left'Last - (Max_Length - Rlen - 1) .. Left'Last);
+                  Result.Data (Max_Length - Rlen + 1 .. Max_Length) :=
+                    Right.Data (1 .. Rlen);
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end Super_Append;
+
+   --  Case of Super_String and Wide_Character
+
+   function Super_Append
+     (Left  : Super_String;
+      Right : Wide_Character;
+      Drop  : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Left.Max_Length;
+      Result     : Super_String (Max_Length);
+      Llen       : constant Natural := Left.Current_Length;
+
+   begin
+      if Llen  < Max_Length then
+         Result.Current_Length := Llen + 1;
+         Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
+         Result.Data (Llen + 1) := Right;
+         return Result;
+
+      else
+         case Drop is
+            when Strings.Right =>
+               return Left;
+
+            when Strings.Left =>
+               Result.Current_Length := Max_Length;
+               Result.Data (1 .. Max_Length - 1) :=
+                 Left.Data (2 .. Max_Length);
+               Result.Data (Max_Length) := Right;
+               return Result;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+   end Super_Append;
+
+   procedure Super_Append
+     (Source   : in out Super_String;
+      New_Item : Wide_Character;
+      Drop     : Truncation  := Error)
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Llen       : constant Natural  := Source.Current_Length;
+
+   begin
+      if Llen  < Max_Length then
+         Source.Current_Length := Llen + 1;
+         Source.Data (Llen + 1) := New_Item;
+
+      else
+         Source.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               null;
+
+            when Strings.Left =>
+               Source.Data (1 .. Max_Length - 1) :=
+                 Source.Data (2 .. Max_Length);
+               Source.Data (Max_Length) := New_Item;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+   end Super_Append;
+
+   --  Case of Wide_Character and Super_String
+
+   function Super_Append
+     (Left  : Wide_Character;
+      Right : Super_String;
+      Drop  : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Right.Max_Length;
+      Result : Super_String (Max_Length);
+      Rlen   : constant Natural := Right.Current_Length;
+
+   begin
+      if Rlen < Max_Length then
+         Result.Current_Length := Rlen + 1;
+         Result.Data (1) := Left;
+         Result.Data (2 .. Rlen + 1) := Right.Data (1 .. Rlen);
+         return Result;
+
+      else
+         case Drop is
+            when Strings.Right =>
+               Result.Current_Length := Max_Length;
+               Result.Data (1) := Left;
+               Result.Data (2 .. Max_Length) :=
+                 Right.Data (1 .. Max_Length - 1);
+               return Result;
+
+            when Strings.Left =>
+               return Right;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+   end Super_Append;
+
+   -----------------
+   -- Super_Count --
+   -----------------
+
+   function Super_Count
+     (Source  : Super_String;
+      Pattern : Wide_String;
+      Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
+      return Natural
+   is
+   begin
+      return
+        Wide_Search.Count
+          (Source.Data (1 .. Source.Current_Length), Pattern, Mapping);
+   end Super_Count;
+
+   function Super_Count
+     (Source  : Super_String;
+      Pattern : Wide_String;
+      Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
+   is
+   begin
+      return
+        Wide_Search.Count
+          (Source.Data (1 .. Source.Current_Length), Pattern, Mapping);
+   end Super_Count;
+
+   function Super_Count
+     (Source : Super_String;
+      Set    : Wide_Maps.Wide_Character_Set) return Natural
+   is
+   begin
+      return Wide_Search.Count (Source.Data (1 .. Source.Current_Length), Set);
+   end Super_Count;
+
+   ------------------
+   -- Super_Delete --
+   ------------------
+
+   function Super_Delete
+     (Source  : Super_String;
+      From    : Positive;
+      Through : Natural) return Super_String
+   is
+      Result     : Super_String (Source.Max_Length);
+      Slen       : constant Natural := Source.Current_Length;
+      Num_Delete : constant Integer := Through - From + 1;
+
+   begin
+      if Num_Delete <= 0 then
+         return Source;
+
+      elsif From > Slen + 1 then
+         raise Ada.Strings.Index_Error;
+
+      elsif Through >= Slen then
+         Result.Current_Length := From - 1;
+         Result.Data (1 .. From - 1) := Source.Data (1 .. From - 1);
+         return Result;
+
+      else
+         Result.Current_Length := Slen - Num_Delete;
+         Result.Data (1 .. From - 1) := Source.Data (1 .. From - 1);
+         Result.Data (From .. Result.Current_Length) :=
+           Source.Data (Through + 1 .. Slen);
+         return Result;
+      end if;
+   end Super_Delete;
+
+   procedure Super_Delete
+     (Source  : in out Super_String;
+      From    : Positive;
+      Through : Natural)
+   is
+      Slen       : constant Natural := Source.Current_Length;
+      Num_Delete : constant Integer := Through - From + 1;
+
+   begin
+      if Num_Delete <= 0 then
+         return;
+
+      elsif From > Slen + 1 then
+         raise Ada.Strings.Index_Error;
+
+      elsif Through >= Slen then
+         Source.Current_Length := From - 1;
+
+      else
+         Source.Current_Length := Slen - Num_Delete;
+         Source.Data (From .. Source.Current_Length) :=
+           Source.Data (Through + 1 .. Slen);
+      end if;
+   end Super_Delete;
+
+   -------------------
+   -- Super_Element --
+   -------------------
+
+   function Super_Element
+     (Source : Super_String;
+      Index  : Positive) return Wide_Character
+   is
+   begin
+      if Index <= Source.Current_Length then
+         return Source.Data (Index);
+      else
+         raise Strings.Index_Error;
+      end if;
+   end Super_Element;
+
+   ----------------------
+   -- Super_Find_Token --
+   ----------------------
+
+   procedure Super_Find_Token
+     (Source : Super_String;
+      Set    : Wide_Maps.Wide_Character_Set;
+      From   : Positive;
+      Test   : Strings.Membership;
+      First  : out Positive;
+      Last   : out Natural)
+   is
+   begin
+      Wide_Search.Find_Token
+        (Source.Data (From .. Source.Current_Length), Set, Test, First, Last);
+   end Super_Find_Token;
+
+   procedure Super_Find_Token
+     (Source : Super_String;
+      Set    : Wide_Maps.Wide_Character_Set;
+      Test   : Strings.Membership;
+      First  : out Positive;
+      Last   : out Natural)
+   is
+   begin
+      Wide_Search.Find_Token
+        (Source.Data (1 .. Source.Current_Length), Set, Test, First, Last);
+   end Super_Find_Token;
+
+   ----------------
+   -- Super_Head --
+   ----------------
+
+   function Super_Head
+     (Source : Super_String;
+      Count  : Natural;
+      Pad    : Wide_Character := Wide_Space;
+      Drop   : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Result     : Super_String (Max_Length);
+      Slen       : constant Natural := Source.Current_Length;
+      Npad       : constant Integer := Count - Slen;
+
+   begin
+      if Npad <= 0 then
+         Result.Current_Length := Count;
+         Result.Data (1 .. Count) := Source.Data (1 .. Count);
+
+      elsif Count <= Max_Length then
+         Result.Current_Length := Count;
+         Result.Data (1 .. Slen) := Source.Data (1 .. Slen);
+         Result.Data (Slen + 1 .. Count) := (others => Pad);
+
+      else
+         Result.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               Result.Data (1 .. Slen) := Source.Data (1 .. Slen);
+               Result.Data (Slen + 1 .. Max_Length) := (others => Pad);
+
+            when Strings.Left =>
+               if Npad >= Max_Length then
+                  Result.Data := (others => Pad);
+
+               else
+                  Result.Data (1 .. Max_Length - Npad) :=
+                    Source.Data (Count - Max_Length + 1 .. Slen);
+                  Result.Data (Max_Length - Npad + 1 .. Max_Length) :=
+                    (others => Pad);
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end Super_Head;
+
+   procedure Super_Head
+     (Source : in out Super_String;
+      Count  : Natural;
+      Pad    : Wide_Character := Wide_Space;
+      Drop   : Truncation := Error)
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Slen       : constant Natural  := Source.Current_Length;
+      Npad       : constant Integer  := Count - Slen;
+      Temp       : Wide_String (1 .. Max_Length);
+
+   begin
+      if Npad <= 0 then
+         Source.Current_Length := Count;
+
+      elsif Count <= Max_Length then
+         Source.Current_Length := Count;
+         Source.Data (Slen + 1 .. Count) := (others => Pad);
+
+      else
+         Source.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               Source.Data (Slen + 1 .. Max_Length) := (others => Pad);
+
+            when Strings.Left =>
+               if Npad > Max_Length then
+                  Source.Data := (others => Pad);
+
+               else
+                  Temp := Source.Data;
+                  Source.Data (1 .. Max_Length - Npad) :=
+                    Temp (Count - Max_Length + 1 .. Slen);
+
+                  for J in Max_Length - Npad + 1 .. Max_Length loop
+                     Source.Data (J) := Pad;
+                  end loop;
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+   end Super_Head;
+
+   -----------------
+   -- Super_Index --
+   -----------------
+
+   function Super_Index
+     (Source  : Super_String;
+      Pattern : Wide_String;
+      Going   : Strings.Direction := Strings.Forward;
+      Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
+      return Natural
+   is
+   begin
+      return Wide_Search.Index
+        (Source.Data (1 .. Source.Current_Length), Pattern, Going, Mapping);
+   end Super_Index;
+
+   function Super_Index
+     (Source  : Super_String;
+      Pattern : Wide_String;
+      Going   : Direction := Forward;
+      Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
+   is
+   begin
+      return Wide_Search.Index
+        (Source.Data (1 .. Source.Current_Length), Pattern, Going, Mapping);
+   end Super_Index;
+
+   function Super_Index
+     (Source : Super_String;
+      Set    : Wide_Maps.Wide_Character_Set;
+      Test   : Strings.Membership := Strings.Inside;
+      Going  : Strings.Direction  := Strings.Forward) return Natural
+   is
+   begin
+      return Wide_Search.Index
+        (Source.Data (1 .. Source.Current_Length), Set, Test, Going);
+   end Super_Index;
+
+   function Super_Index
+     (Source  : Super_String;
+      Pattern : Wide_String;
+      From    : Positive;
+      Going   : Direction := Forward;
+      Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
+      return Natural
+   is
+   begin
+      return Wide_Search.Index
+        (Source.Data (1 .. Source.Current_Length),
+         Pattern, From, Going, Mapping);
+   end Super_Index;
+
+   function Super_Index
+     (Source  : Super_String;
+      Pattern : Wide_String;
+      From    : Positive;
+      Going   : Direction := Forward;
+      Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
+   is
+   begin
+      return Wide_Search.Index
+        (Source.Data (1 .. Source.Current_Length),
+         Pattern, From, Going, Mapping);
+   end Super_Index;
+
+   function Super_Index
+     (Source : Super_String;
+      Set    : Wide_Maps.Wide_Character_Set;
+      From   : Positive;
+      Test   : Membership := Inside;
+      Going  : Direction := Forward) return Natural
+   is
+   begin
+      return Wide_Search.Index
+        (Source.Data (1 .. Source.Current_Length), Set, From, Test, Going);
+   end Super_Index;
+
+   ---------------------------
+   -- Super_Index_Non_Blank --
+   ---------------------------
+
+   function Super_Index_Non_Blank
+     (Source : Super_String;
+      Going  : Strings.Direction := Strings.Forward) return Natural
+   is
+   begin
+      return
+        Wide_Search.Index_Non_Blank
+          (Source.Data (1 .. Source.Current_Length), Going);
+   end Super_Index_Non_Blank;
+
+   function Super_Index_Non_Blank
+     (Source : Super_String;
+      From   : Positive;
+      Going  : Direction := Forward) return Natural
+   is
+   begin
+      return
+        Wide_Search.Index_Non_Blank
+          (Source.Data (1 .. Source.Current_Length), From, Going);
+   end Super_Index_Non_Blank;
+
+   ------------------
+   -- Super_Insert --
+   ------------------
+
+   function Super_Insert
+     (Source   : Super_String;
+      Before   : Positive;
+      New_Item : Wide_String;
+      Drop     : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Result     : Super_String (Max_Length);
+      Slen       : constant Natural := Source.Current_Length;
+      Nlen       : constant Natural := New_Item'Length;
+      Tlen       : constant Natural := Slen + Nlen;
+      Blen       : constant Natural := Before - 1;
+      Alen       : constant Integer := Slen - Blen;
+      Droplen    : constant Integer := Tlen - Max_Length;
+
+      --  Tlen is the length of the total string before possible truncation.
+      --  Blen, Alen are the lengths of the before and after pieces of the
+      --  source string.
+
+   begin
+      if Alen < 0 then
+         raise Ada.Strings.Index_Error;
+
+      elsif Droplen <= 0 then
+         Result.Current_Length := Tlen;
+         Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
+         Result.Data (Before .. Before + Nlen - 1) := New_Item;
+         Result.Data (Before + Nlen .. Tlen) :=
+           Source.Data (Before .. Slen);
+
+      else
+         Result.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
+
+               if Droplen > Alen then
+                  Result.Data (Before .. Max_Length) :=
+                    New_Item (New_Item'First
+                                .. New_Item'First + Max_Length - Before);
+               else
+                  Result.Data (Before .. Before + Nlen - 1) := New_Item;
+                  Result.Data (Before + Nlen .. Max_Length) :=
+                    Source.Data (Before .. Slen - Droplen);
+               end if;
+
+            when Strings.Left =>
+               Result.Data (Max_Length - (Alen - 1) .. Max_Length) :=
+                 Source.Data (Before .. Slen);
+
+               if Droplen >= Blen then
+                  Result.Data (1 .. Max_Length - Alen) :=
+                    New_Item (New_Item'Last - (Max_Length - Alen) + 1
+                                .. New_Item'Last);
+               else
+                  Result.Data
+                    (Blen - Droplen + 1 .. Max_Length - Alen) :=
+                    New_Item;
+                  Result.Data (1 .. Blen - Droplen) :=
+                    Source.Data (Droplen + 1 .. Blen);
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end Super_Insert;
+
+   procedure Super_Insert
+     (Source   : in out Super_String;
+      Before   : Positive;
+      New_Item : Wide_String;
+      Drop     : Strings.Truncation := Strings.Error)
+   is
+   begin
+      --  We do a double copy here because this is one of the situations
+      --  in which we move data to the right, and at least at the moment,
+      --  GNAT is not handling such cases correctly ???
+
+      Source := Super_Insert (Source, Before, New_Item, Drop);
+   end Super_Insert;
+
+   ------------------
+   -- Super_Length --
+   ------------------
+
+   function Super_Length (Source : Super_String) return Natural is
+   begin
+      return Source.Current_Length;
+   end Super_Length;
+
+   ---------------------
+   -- Super_Overwrite --
+   ---------------------
+
+   function Super_Overwrite
+     (Source   : Super_String;
+      Position : Positive;
+      New_Item : Wide_String;
+      Drop     : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Result     : Super_String (Max_Length);
+      Endpos     : constant Natural  := Position + New_Item'Length - 1;
+      Slen       : constant Natural  := Source.Current_Length;
+      Droplen    : Natural;
+
+   begin
+      if Position > Slen + 1 then
+         raise Ada.Strings.Index_Error;
+
+      elsif New_Item'Length = 0 then
+         return Source;
+
+      elsif Endpos <= Slen then
+         Result.Current_Length := Source.Current_Length;
+         Result.Data (1 .. Slen) := Source.Data (1 .. Slen);
+         Result.Data (Position .. Endpos) := New_Item;
+         return Result;
+
+      elsif Endpos <= Max_Length then
+         Result.Current_Length := Endpos;
+         Result.Data (1 .. Position - 1) := Source.Data (1 .. Position - 1);
+         Result.Data (Position .. Endpos) := New_Item;
+         return Result;
+
+      else
+         Result.Current_Length := Max_Length;
+         Droplen := Endpos - Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               Result.Data (1 .. Position - 1) :=
+                 Source.Data (1 .. Position - 1);
+
+               Result.Data (Position .. Max_Length) :=
+                 New_Item (New_Item'First .. New_Item'Last - Droplen);
+               return Result;
+
+            when Strings.Left =>
+               if New_Item'Length >= Max_Length then
+                  Result.Data (1 .. Max_Length) :=
+                    New_Item (New_Item'Last - Max_Length + 1 ..
+                                New_Item'Last);
+                  return Result;
+
+               else
+                  Result.Data (1 .. Max_Length - New_Item'Length) :=
+                    Source.Data (Droplen + 1 .. Position - 1);
+                  Result.Data
+                    (Max_Length - New_Item'Length + 1 .. Max_Length) :=
+                    New_Item;
+                  return Result;
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+   end Super_Overwrite;
+
+   procedure Super_Overwrite
+     (Source    : in out Super_String;
+      Position  : Positive;
+      New_Item  : Wide_String;
+      Drop      : Strings.Truncation := Strings.Error)
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Endpos     : constant Positive := Position + New_Item'Length - 1;
+      Slen       : constant Natural  := Source.Current_Length;
+      Droplen    : Natural;
+
+   begin
+      if Position > Slen + 1 then
+         raise Ada.Strings.Index_Error;
+
+      elsif Endpos <= Slen then
+         Source.Data (Position .. Endpos) := New_Item;
+
+      elsif Endpos <= Max_Length then
+         Source.Data (Position .. Endpos) := New_Item;
+         Source.Current_Length := Endpos;
+
+      else
+         Source.Current_Length := Max_Length;
+         Droplen := Endpos - Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               Source.Data (Position .. Max_Length) :=
+                 New_Item (New_Item'First .. New_Item'Last - Droplen);
+
+            when Strings.Left =>
+               if New_Item'Length > Max_Length then
+                  Source.Data (1 .. Max_Length) :=
+                    New_Item (New_Item'Last - Max_Length + 1 ..
+                                New_Item'Last);
+
+               else
+                  Source.Data (1 .. Max_Length - New_Item'Length) :=
+                    Source.Data (Droplen + 1 .. Position - 1);
+
+                  Source.Data
+                    (Max_Length - New_Item'Length + 1 .. Max_Length) :=
+                    New_Item;
+               end if;
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+   end Super_Overwrite;
+
+   ---------------------------
+   -- Super_Replace_Element --
+   ---------------------------
+
+   procedure Super_Replace_Element
+     (Source : in out Super_String;
+      Index  : Positive;
+      By     : Wide_Character)
+   is
+   begin
+      if Index <= Source.Current_Length then
+         Source.Data (Index) := By;
+      else
+         raise Ada.Strings.Index_Error;
+      end if;
+   end Super_Replace_Element;
+
+   -------------------------
+   -- Super_Replace_Slice --
+   -------------------------
+
+   function Super_Replace_Slice
+     (Source : Super_String;
+      Low    : Positive;
+      High   : Natural;
+      By     : Wide_String;
+      Drop   : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Slen       : constant Natural  := Source.Current_Length;
+
+   begin
+      if Low > Slen + 1 then
+         raise Strings.Index_Error;
+
+      elsif High < Low then
+         return Super_Insert (Source, Low, By, Drop);
+
+      else
+         declare
+            Blen    : constant Natural := Natural'Max (0, Low - 1);
+            Alen    : constant Natural := Natural'Max (0, Slen - High);
+            Tlen    : constant Natural := Blen + By'Length + Alen;
+            Droplen : constant Integer := Tlen - Max_Length;
+            Result  : Super_String (Max_Length);
+
+            --  Tlen is the total length of the result string before any
+            --  truncation. Blen and Alen are the lengths of the pieces
+            --  of the original string that end up in the result string
+            --  before and after the replaced slice.
+
+         begin
+            if Droplen <= 0 then
+               Result.Current_Length := Tlen;
+               Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
+               Result.Data (Low .. Low + By'Length - 1) := By;
+               Result.Data (Low + By'Length .. Tlen) :=
+                 Source.Data (High + 1 .. Slen);
+
+            else
+               Result.Current_Length := Max_Length;
+
+               case Drop is
+                  when Strings.Right =>
+                     Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
+
+                     if Droplen > Alen then
+                        Result.Data (Low .. Max_Length) :=
+                          By (By'First .. By'First + Max_Length - Low);
+                     else
+                        Result.Data (Low .. Low + By'Length - 1) := By;
+                        Result.Data (Low + By'Length .. Max_Length) :=
+                          Source.Data (High + 1 .. Slen - Droplen);
+                     end if;
+
+                  when Strings.Left =>
+                     Result.Data (Max_Length - (Alen - 1) .. Max_Length) :=
+                       Source.Data (High + 1 .. Slen);
+
+                     if Droplen >= Blen then
+                        Result.Data (1 .. Max_Length - Alen) :=
+                          By (By'Last - (Max_Length - Alen) + 1 .. By'Last);
+                     else
+                        Result.Data
+                          (Blen - Droplen + 1 .. Max_Length - Alen) := By;
+                        Result.Data (1 .. Blen - Droplen) :=
+                          Source.Data (Droplen + 1 .. Blen);
+                     end if;
+
+                  when Strings.Error =>
+                     raise Ada.Strings.Length_Error;
+               end case;
+            end if;
+
+            return Result;
+         end;
+      end if;
+   end Super_Replace_Slice;
+
+   procedure Super_Replace_Slice
+     (Source   : in out Super_String;
+      Low      : Positive;
+      High     : Natural;
+      By       : Wide_String;
+      Drop     : Strings.Truncation := Strings.Error)
+   is
+   begin
+      --  We do a double copy here because this is one of the situations
+      --  in which we move data to the right, and at least at the moment,
+      --  GNAT is not handling such cases correctly ???
+
+      Source := Super_Replace_Slice (Source, Low, High, By, Drop);
+   end Super_Replace_Slice;
+
+   ---------------------
+   -- Super_Replicate --
+   ---------------------
+
+   function Super_Replicate
+     (Count      : Natural;
+      Item       : Wide_Character;
+      Drop       : Truncation := Error;
+      Max_Length : Positive) return Super_String
+   is
+      Result : Super_String (Max_Length);
+
+   begin
+      if Count <= Max_Length then
+         Result.Current_Length := Count;
+
+      elsif Drop = Strings.Error then
+         raise Ada.Strings.Length_Error;
+
+      else
+         Result.Current_Length := Max_Length;
+      end if;
+
+      Result.Data (1 .. Result.Current_Length) := (others => Item);
+      return Result;
+   end Super_Replicate;
+
+   function Super_Replicate
+     (Count      : Natural;
+      Item       : Wide_String;
+      Drop       : Truncation := Error;
+      Max_Length : Positive) return Super_String
+   is
+      Length : constant Integer := Count * Item'Length;
+      Result : Super_String (Max_Length);
+      Indx   : Positive;
+
+   begin
+      if Length <= Max_Length then
+         Result.Current_Length := Length;
+
+         if Length > 0 then
+            Indx := 1;
+
+            for J in 1 .. Count loop
+               Result.Data (Indx .. Indx + Item'Length - 1) := Item;
+               Indx := Indx + Item'Length;
+            end loop;
+         end if;
+
+      else
+         Result.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               Indx := 1;
+
+               while Indx + Item'Length <= Max_Length + 1 loop
+                  Result.Data (Indx .. Indx + Item'Length - 1) := Item;
+                  Indx := Indx + Item'Length;
+               end loop;
+
+               Result.Data (Indx .. Max_Length) :=
+                 Item (Item'First .. Item'First + Max_Length - Indx);
+
+            when Strings.Left =>
+               Indx := Max_Length;
+
+               while Indx - Item'Length >= 1 loop
+                  Result.Data (Indx - (Item'Length - 1) .. Indx) := Item;
+                  Indx := Indx - Item'Length;
+               end loop;
+
+               Result.Data (1 .. Indx) :=
+                 Item (Item'Last - Indx + 1 .. Item'Last);
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end Super_Replicate;
+
+   function Super_Replicate
+     (Count : Natural;
+      Item  : Super_String;
+      Drop  : Strings.Truncation := Strings.Error) return Super_String
+   is
+   begin
+      return
+        Super_Replicate
+          (Count,
+           Item.Data (1 .. Item.Current_Length),
+           Drop,
+           Item.Max_Length);
+   end Super_Replicate;
+
+   -----------------
+   -- Super_Slice --
+   -----------------
+
+   function Super_Slice
+     (Source : Super_String;
+      Low    : Positive;
+      High   : Natural) return Wide_String
+   is
+   begin
+      --  Note: test of High > Length is in accordance with AI95-00128
+
+      return R : Wide_String (Low .. High) do
+         if Low > Source.Current_Length + 1
+           or else High > Source.Current_Length
+         then
+            raise Index_Error;
+         end if;
+
+         R := Source.Data (Low .. High);
+      end return;
+   end Super_Slice;
+
+   function Super_Slice
+     (Source : Super_String;
+      Low    : Positive;
+      High   : Natural) return Super_String
+   is
+   begin
+      return Result : Super_String (Source.Max_Length) do
+         if Low > Source.Current_Length + 1
+           or else High > Source.Current_Length
+         then
+            raise Index_Error;
+         end if;
+
+         Result.Current_Length := High - Low + 1;
+         Result.Data (1 .. Result.Current_Length) := Source.Data (Low .. High);
+      end return;
+   end Super_Slice;
+
+   procedure Super_Slice
+     (Source : Super_String;
+      Target : out Super_String;
+      Low    : Positive;
+      High   : Natural)
+   is
+   begin
+      if Low > Source.Current_Length + 1
+        or else High > Source.Current_Length
+      then
+         raise Index_Error;
+      else
+         Target.Current_Length := High - Low + 1;
+         Target.Data (1 .. Target.Current_Length) := Source.Data (Low .. High);
+      end if;
+   end Super_Slice;
+
+   ----------------
+   -- Super_Tail --
+   ----------------
+
+   function Super_Tail
+     (Source : Super_String;
+      Count  : Natural;
+      Pad    : Wide_Character := Wide_Space;
+      Drop   : Strings.Truncation := Strings.Error) return Super_String
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Result     : Super_String (Max_Length);
+      Slen       : constant Natural := Source.Current_Length;
+      Npad       : constant Integer := Count - Slen;
+
+   begin
+      if Npad <= 0 then
+         Result.Current_Length := Count;
+         Result.Data (1 .. Count) :=
+           Source.Data (Slen - (Count - 1) .. Slen);
+
+      elsif Count <= Max_Length then
+         Result.Current_Length := Count;
+         Result.Data (1 .. Npad) := (others => Pad);
+         Result.Data (Npad + 1 .. Count) := Source.Data (1 .. Slen);
+
+      else
+         Result.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               if Npad >= Max_Length then
+                  Result.Data := (others => Pad);
+
+               else
+                  Result.Data (1 .. Npad) := (others => Pad);
+                  Result.Data (Npad + 1 .. Max_Length) :=
+                    Source.Data (1 .. Max_Length - Npad);
+               end if;
+
+            when Strings.Left =>
+               Result.Data (1 .. Max_Length - Slen) := (others => Pad);
+               Result.Data (Max_Length - Slen + 1 .. Max_Length) :=
+                 Source.Data (1 .. Slen);
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end Super_Tail;
+
+   procedure Super_Tail
+     (Source : in out Super_String;
+      Count  : Natural;
+      Pad    : Wide_Character := Wide_Space;
+      Drop   : Truncation := Error)
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Slen       : constant Natural  := Source.Current_Length;
+      Npad       : constant Integer  := Count - Slen;
+
+      Temp : constant Wide_String (1 .. Max_Length) := Source.Data;
+
+   begin
+      if Npad <= 0 then
+         Source.Current_Length := Count;
+         Source.Data (1 .. Count) :=
+           Temp (Slen - (Count - 1) .. Slen);
+
+      elsif Count <= Max_Length then
+         Source.Current_Length := Count;
+         Source.Data (1 .. Npad) := (others => Pad);
+         Source.Data (Npad + 1 .. Count) := Temp (1 .. Slen);
+
+      else
+         Source.Current_Length := Max_Length;
+
+         case Drop is
+            when Strings.Right =>
+               if Npad >= Max_Length then
+                  Source.Data := (others => Pad);
+
+               else
+                  Source.Data (1 .. Npad) := (others => Pad);
+                  Source.Data (Npad + 1 .. Max_Length) :=
+                    Temp (1 .. Max_Length - Npad);
+               end if;
+
+            when Strings.Left =>
+               for J in 1 .. Max_Length - Slen loop
+                  Source.Data (J) := Pad;
+               end loop;
+
+               Source.Data (Max_Length - Slen + 1 .. Max_Length) :=
+                 Temp (1 .. Slen);
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+   end Super_Tail;
+
+   ---------------------
+   -- Super_To_String --
+   ---------------------
+
+   function Super_To_String (Source : Super_String) return Wide_String is
+   begin
+      return R : Wide_String (1 .. Source.Current_Length) do
+         R := Source.Data (1 .. Source.Current_Length);
+      end return;
+   end Super_To_String;
+
+   ---------------------
+   -- Super_Translate --
+   ---------------------
+
+   function Super_Translate
+     (Source  : Super_String;
+      Mapping : Wide_Maps.Wide_Character_Mapping) return Super_String
+   is
+      Result : Super_String (Source.Max_Length);
+
+   begin
+      Result.Current_Length := Source.Current_Length;
+
+      for J in 1 .. Source.Current_Length loop
+         Result.Data (J) := Value (Mapping, Source.Data (J));
+      end loop;
+
+      return Result;
+   end Super_Translate;
+
+   procedure Super_Translate
+     (Source  : in out Super_String;
+      Mapping : Wide_Maps.Wide_Character_Mapping)
+   is
+   begin
+      for J in 1 .. Source.Current_Length loop
+         Source.Data (J) := Value (Mapping, Source.Data (J));
+      end loop;
+   end Super_Translate;
+
+   function Super_Translate
+     (Source  : Super_String;
+      Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Super_String
+   is
+      Result : Super_String (Source.Max_Length);
+
+   begin
+      Result.Current_Length := Source.Current_Length;
+
+      for J in 1 .. Source.Current_Length loop
+         Result.Data (J) := Mapping.all (Source.Data (J));
+      end loop;
+
+      return Result;
+   end Super_Translate;
+
+   procedure Super_Translate
+     (Source  : in out Super_String;
+      Mapping : Wide_Maps.Wide_Character_Mapping_Function)
+   is
+   begin
+      for J in 1 .. Source.Current_Length loop
+         Source.Data (J) := Mapping.all (Source.Data (J));
+      end loop;
+   end Super_Translate;
+
+   ----------------
+   -- Super_Trim --
+   ----------------
+
+   function Super_Trim
+     (Source : Super_String;
+      Side   : Trim_End) return Super_String
+   is
+      Result : Super_String (Source.Max_Length);
+      Last   : Natural := Source.Current_Length;
+      First  : Positive := 1;
+
+   begin
+      if Side = Left or else Side = Both then
+         while First <= Last and then Source.Data (First) = ' ' loop
+            First := First + 1;
+         end loop;
+      end if;
+
+      if Side = Right or else Side = Both then
+         while Last >= First and then Source.Data (Last) = ' ' loop
+            Last := Last - 1;
+         end loop;
+      end if;
+
+      Result.Current_Length := Last - First + 1;
+      Result.Data (1 .. Result.Current_Length) := Source.Data (First .. Last);
+      return Result;
+   end Super_Trim;
+
+   procedure Super_Trim
+     (Source : in out Super_String;
+      Side   : Trim_End)
+   is
+      Max_Length : constant Positive := Source.Max_Length;
+      Last       : Natural           := Source.Current_Length;
+      First      : Positive          := 1;
+      Temp       : Wide_String (1 .. Max_Length);
+
+   begin
+      Temp (1 .. Last) := Source.Data (1 .. Last);
+
+      if Side = Left or else Side = Both then
+         while First <= Last and then Temp (First) = ' ' loop
+            First := First + 1;
+         end loop;
+      end if;
+
+      if Side = Right or else Side = Both then
+         while Last >= First and then Temp (Last) = ' ' loop
+            Last := Last - 1;
+         end loop;
+      end if;
+
+      Source.Data := (others => Wide_NUL);
+      Source.Current_Length := Last - First + 1;
+      Source.Data (1 .. Source.Current_Length) := Temp (First .. Last);
+   end Super_Trim;
+
+   function Super_Trim
+     (Source : Super_String;
+      Left   : Wide_Maps.Wide_Character_Set;
+      Right  : Wide_Maps.Wide_Character_Set) return Super_String
+   is
+      Result : Super_String (Source.Max_Length);
+
+   begin
+      for First in 1 .. Source.Current_Length loop
+         if not Is_In (Source.Data (First), Left) then
+            for Last in reverse First .. Source.Current_Length loop
+               if not Is_In (Source.Data (Last), Right) then
+                  Result.Current_Length := Last - First + 1;
+                  Result.Data (1 .. Result.Current_Length) :=
+                    Source.Data (First .. Last);
+                  return Result;
+               end if;
+            end loop;
+         end if;
+      end loop;
+
+      Result.Current_Length := 0;
+      return Result;
+   end Super_Trim;
+
+   procedure Super_Trim
+     (Source : in out Super_String;
+      Left   : Wide_Maps.Wide_Character_Set;
+      Right  : Wide_Maps.Wide_Character_Set)
+   is
+   begin
+      for First in 1 .. Source.Current_Length loop
+         if not Is_In (Source.Data (First), Left) then
+            for Last in reverse First .. Source.Current_Length loop
+               if not Is_In (Source.Data (Last), Right) then
+                  if First = 1 then
+                     Source.Current_Length := Last;
+                     return;
+                  else
+                     Source.Current_Length := Last - First + 1;
+                     Source.Data (1 .. Source.Current_Length) :=
+                       Source.Data (First .. Last);
+
+                     for J in Source.Current_Length + 1 ..
+                                Source.Max_Length
+                     loop
+                        Source.Data (J) := Wide_NUL;
+                     end loop;
+
+                     return;
+                  end if;
+               end if;
+            end loop;
+
+            Source.Current_Length := 0;
+            return;
+         end if;
+      end loop;
+
+      Source.Current_Length := 0;
+   end Super_Trim;
+
+   -----------
+   -- Times --
+   -----------
+
+   function Times
+     (Left       : Natural;
+      Right      : Wide_Character;
+      Max_Length : Positive) return Super_String
+   is
+      Result : Super_String (Max_Length);
+
+   begin
+      if Left > Max_Length then
+         raise Ada.Strings.Length_Error;
+
+      else
+         Result.Current_Length := Left;
+
+         for J in 1 .. Left loop
+            Result.Data (J) := Right;
+         end loop;
+      end if;
+
+      return Result;
+   end Times;
+
+   function Times
+     (Left       : Natural;
+      Right      : Wide_String;
+      Max_Length : Positive) return Super_String
+   is
+      Result : Super_String (Max_Length);
+      Pos    : Positive         := 1;
+      Rlen   : constant Natural := Right'Length;
+      Nlen   : constant Natural := Left * Rlen;
+
+   begin
+      if Nlen > Max_Length then
+         raise Ada.Strings.Index_Error;
+
+      else
+         Result.Current_Length := Nlen;
+
+         if Nlen > 0 then
+            for J in 1 .. Left loop
+               Result.Data (Pos .. Pos + Rlen - 1) := Right;
+               Pos := Pos + Rlen;
+            end loop;
+         end if;
+      end if;
+
+      return Result;
+   end Times;
+
+   function Times
+     (Left  : Natural;
+      Right : Super_String) return Super_String
+   is
+      Result : Super_String (Right.Max_Length);
+      Pos    : Positive := 1;
+      Rlen   : constant Natural := Right.Current_Length;
+      Nlen   : constant Natural := Left * Rlen;
+
+   begin
+      if Nlen > Right.Max_Length then
+         raise Ada.Strings.Length_Error;
+
+      else
+         Result.Current_Length := Nlen;
+
+         if Nlen > 0 then
+            for J in 1 .. Left loop
+               Result.Data (Pos .. Pos + Rlen - 1) :=
+                 Right.Data (1 .. Rlen);
+               Pos := Pos + Rlen;
+            end loop;
+         end if;
+      end if;
+
+      return Result;
+   end Times;
+
+   ---------------------
+   -- To_Super_String --
+   ---------------------
+
+   function To_Super_String
+     (Source     : Wide_String;
+      Max_Length : Natural;
+      Drop       : Truncation := Error) return Super_String
+   is
+      Result : Super_String (Max_Length);
+      Slen   : constant Natural := Source'Length;
+
+   begin
+      if Slen <= Max_Length then
+         Result.Current_Length := Slen;
+         Result.Data (1 .. Slen) := Source;
+
+      else
+         case Drop is
+            when Strings.Right =>
+               Result.Current_Length := Max_Length;
+               Result.Data (1 .. Max_Length) :=
+                 Source (Source'First .. Source'First - 1 + Max_Length);
+
+            when Strings.Left =>
+               Result.Current_Length := Max_Length;
+               Result.Data (1 .. Max_Length) :=
+                 Source (Source'Last - (Max_Length - 1) .. Source'Last);
+
+            when Strings.Error =>
+               raise Ada.Strings.Length_Error;
+         end case;
+      end if;
+
+      return Result;
+   end To_Super_String;
+
+end Ada.Strings.Wide_Superbounded;