mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-24 17:29:33 +08:00
9de61fcb9b
2005-11-14 Robert Dewar <dewar@adacore.com> * a-secain.adb, a-slcain.adb, a-shcain.adb, a-chtgke.ads, a-chtgke.adb, a-stwiha.adb, a-strhas.adb, a-chzla1.ads, a-chzla9.ads, a-stzbou.adb, a-stzbou.ads, a-stzfix.adb, a-stzhas.adb, a-stzmap.adb, a-stzmap.ads, a-stzsea.adb, a-stzsea.ads, a-stzsup.adb, a-stzsup.ads, a-stzunb.adb, a-stzunb.ads, a-szuzha.adb, a-szuzha.ads, a-szuzti.adb, a-szuzti.ads, a-ztcoau.adb, a-ztcoau.ads, a-ztcoio.adb, a-ztcstr.adb, a-ztcstr.ads, a-ztdeau.adb, a-ztdeau.ads, a-ztdeio.adb, a-ztdeio.ads, a-ztedit.adb, a-ztedit.ads, a-ztenau.ads, a-ztenio.adb, a-ztenio.ads, a-ztexio.adb, a-ztexio.ads, a-ztfiio.adb, a-ztfiio.ads, a-ztflau.adb, a-ztflau.ads, a-ztflio.adb, a-ztflio.ads, a-ztgeau.adb, a-ztgeau.ads, a-ztinau.adb, a-ztinau.ads, a-ztinio.adb, a-ztmoau.ads, a-ztmoio.adb, a-ztmoio.ads, a-zttest.adb, g-enblsp-vms-alpha.adb, g-enblsp-vms-alpha.adb, g-enblsp-vms-ia64.adb, g-enblsp-vms-ia64.adb, system-linux-hppa.ads, a-chacon.adb, a-chacon.ads, a-wichun.adb, a-wichun.ads, a-zchuni.adb, a-zchuni.ads, g-trasym-vms-alpha.adb, g-trasym-vms-ia64.adb, system-hpux-ia64.ads, g-soccon-unixware.ads, g-soliop-unixware.ads, g-soccon-interix.ads, g-soliop-solaris.ads, g-eacodu-vms.adb, g-expect-vms.adb, g-socthi-vms.adb, g-soliop-mingw.ads, a-intnam-unixware.ads, a-intnam-lynxos.ads, a-intnam-tru64.ads, a-intnam-aix.ads, a-intnam-linux.ads, a-intnam-linux.ads, a-intnam-dummy.ads, a-numaux-libc-x86.ads, a-intnam-interix.ads, a-intnam-solaris.ads, a-calend-vms.adb, a-calend-vms.ads, a-intnam-vms.ads, a-calend-mingw.adb, a-intnam-mingw.ads, a-intnam-vxworks.ads, a-numaux-vxworks.ads, system-unixware.ads, system-linux-ia64.ads, a-intnam-freebsd.ads, system-freebsd-x86.ads, system-lynxos-ppc.ads, system-linux-x86_64.ads, a-stunha.adb, a-cgaaso.ads, a-cgaaso.adb, a-chtgop.adb, a-cgcaso.adb, a-cgarso.adb, a-cohata.ads, a-crbtgk.adb, a-crbltr.ads, a-coprnu.adb, a-rbtgso.adb, a-intnam-darwin.ads, system-darwin-ppc.ads, gprmake.adb, makegpr.ads, system-tru64.ads, system-aix.ads, system-solaris-x86.ads, system-irix-o32.ads, s-interr-sigaction.adb, system-irix-n32.ads, s-parame-mingw.adb, system-hpux.ads, s-traceb-hpux.adb, system-linux-x86.ads, s-inmaop-dummy.adb, system-os2.ads, system-interix.ads, system-solaris-sparc.ads, system-solaris-sparcv9.ads, s-inmaop-vms.adb, s-mastop-vms.adb, expander.adb, expander.ads, s-gloloc-mingw.adb, system-mingw.ads, system-vms-zcx.ads, s-osinte-fsu.adb, s-traceb-mastop.adb, a-exextr.adb, a-exstat.adb, a-filico.ads, a-finali.ads, a-interr.ads, a-intsig.adb, a-intsig.ads, a-except.ads, a-numaux-x86.ads, a-astaco.adb, a-calend.adb, a-calend.ads, a-chahan.adb, a-chahan.ads, a-chlat9.ads, a-colien.adb, a-colien.ads, a-colire.adb, a-colire.ads, a-comlin.adb, a-comlin.ads, a-cwila1.ads, a-cwila9.ads, a-elchha.adb, a-decima.adb, a-decima.ads, a-diocst.ads, a-direio.adb, a-direio.ads, a-excach.adb, a-excach.adb, a-exctra.ads, ali-util.adb, a-ngcefu.adb, a-ngcoty.adb, a-ngcoty.ads, a-nudira.adb, a-nudira.ads, a-nuflra.adb, a-numaux.ads, a-reatim.ads, a-sequio.adb, a-sequio.ads, a-siocst.ads, a-ssicst.ads, a-stmaco.ads, a-storio.adb, a-strbou.adb, a-strbou.ads, a-stream.ads, a-strfix.adb, a-strmap.adb, a-strmap.ads, a-strsea.adb, a-strsea.ads, a-strsup.adb, a-strsup.ads, a-strunb.adb, a-strunb.ads, a-stwibo.adb, a-stwibo.ads, a-stwifi.adb, a-stwima.adb, a-stwima.ads, a-stwise.adb, a-stwise.ads, a-stwisu.adb, a-stwisu.ads, a-stwiun.adb, a-stwiun.ads, a-suteio.adb, a-suteio.ads, a-swmwco.ads, a-swuwti.adb, a-swuwti.ads, a-sytaco.adb, a-sytaco.ads, a-tasatt.adb, a-taside.adb, a-taside.ads, a-teioed.adb, a-textio.adb, a-textio.ads, a-ticoau.adb, a-ticoau.ads, a-ticoio.adb, a-tideau.adb, a-tideio.adb, a-tienau.adb, a-tienio.adb, a-tifiio.adb, a-tiflio.adb, a-tigeau.adb, a-tigeau.ads, a-tiinau.adb, a-tiinio.adb, a-timoau.adb, a-timoio.adb, a-timoio.ads, a-tiocst.ads, a-titest.adb, atree.adb, a-witeio.adb, a-witeio.ads, a-wtcoau.adb, a-wtcoau.ads, a-wtcoio.adb, a-wtcstr.ads, a-wtdeau.adb, a-wtdeio.adb, a-wtedit.adb, a-wtedit.ads, a-wtenau.adb, a-wtenio.adb, a-wtfiio.adb, a-wtflio.adb, a-wtgeau.adb, a-wtinau.adb, a-wtinio.adb, a-wtmoau.adb, a-wtmoio.adb, a-wttest.adb, back_end.adb, bindgen.adb, butil.adb, butil.ads, checks.ads, cio.c, comperr.adb, csets.ads, cstand.adb, debug.ads, elists.ads, errno.c, errout.adb, errout.ads, erroutc.adb, erroutc.ads, errutil.adb, errutil.ads, errutil.ads, err_vars.ads, eval_fat.adb, exp_ch11.adb, exp_ch11.ads, exp_ch2.adb, exp_ch7.ads, exp_imgv.ads, exp_pakd.adb, exp_prag.adb, exp_prag.ads, exp_tss.adb, exp_tss.ads, exp_vfpt.ads, fe.h, fmap.adb, freeze.ads, frontend.adb, frontend.ads, g-arrspl.adb, g-arrspl.ads, g-awk.adb, g-awk.ads, g-boumai.ads, g-calend.adb, g-calend.ads, g-catiio.adb, g-comlin.adb, g-comlin.ads, g-comlin.ads, g-comlin.ads, g-comver.adb, g-crc32.adb, g-crc32.ads, g-ctrl_c.ads, g-curexc.ads, g-debpoo.ads, g-debuti.adb, g-diopit.adb, g-diopit.ads, g-dirope.adb, g-dirope.ads, g-dyntab.adb, g-dyntab.ads, g-excact.adb, g-excact.ads, g-except.ads, g-exctra.adb, g-exctra.ads, g-expect.ads, g-flocon.ads, g-hesorg.ads, g-io.adb, g-locfil.ads, g-md5.adb, g-md5.ads, g-md5.ads, g-moreex.adb, g-signal.ads, g-signal.adb, gnatbind.ads, gnatchop.adb, gnatcmd.adb, gnatfind.adb, gnatlbr.adb, gnatmake.ads, gnatmem.adb, gnatprep.adb, gnatprep.ads, gnatsym.adb, gnatxref.adb, g-os_lib.adb, g-os_lib.ads, g-pehage.adb, g-pehage.ads, gprep.ads, g-regexp.adb, g-regexp.ads, g-regist.adb, g-regist.ads, g-regpat.ads, g-semaph.adb, g-socthi.adb, g-soliop.ads, g-spipat.adb, g-spipat.ads, g-sptabo.ads, g-sptain.ads, g-sptavs.ads, g-string.ads, g-tasloc.adb, g-tasloc.ads, g-trasym.adb, g-trasym.ads, i-fortra.adb, i-fortra.ads, inline.adb, layout.adb, live.adb, make.ads, makeutl.ads, makeutl.adb, mdll-fil.adb, mdll-fil.ads, mdll-utl.ads, memroot.ads, memtrack.adb, mlib.ads, mlib-fil.adb, mlib-fil.ads, mlib-prj.ads, mlib-utl.adb, mlib-utl.ads, nlists.adb, nlists.ads, osint.adb, osint.ads, osint-c.adb, osint-l.adb, osint-l.ads, osint-m.ads, output.adb, par.adb, par.adb, par.ads, par-ch11.adb, par-ch12.adb, par-ch2.adb, par-ch4.adb, par-ch5.adb, par-ch6.adb, par-ch9.adb, par-endh.adb, par-labl.adb, par-load.adb, par-tchk.adb, prep.adb, prepcomp.adb, prepcomp.ads, prj-attr.ads, prj-com.ads, prj-dect.adb, prj-dect.ads, prj-env.ads, prj-err.ads, prj-ext.ads, prj-makr.adb, prj-makr.ads, prj-nmsc.ads, prj-pars.adb, prj-pars.ads, prj-part.ads, prj-pp.ads, prj-proc.ads, prj-strt.adb, prj-strt.ads, prj-tree.adb, prj-util.adb, prj-util.ads, rtsfind.adb, sem.adb, sem.ads, sem_case.adb, sem_case.ads, sem_ch11.adb, sem_ch4.adb, sem_ch6.ads, sem_ch7.ads, sem_dist.ads, sem_elab.ads, sem_elim.ads, sem_eval.ads, sem_intr.ads, sem_maps.adb, sem_maps.ads, sem_maps.ads, sem_res.ads, sem_type.ads, sfn_scan.adb, sfn_scan.ads, s-imgwch.ads, s-imgwiu.adb, s-imgwiu.ads, s-inmaop.ads, sinput.adb, sinput.ads, s-pack03.adb, s-pack03.ads, s-pack05.adb, s-pack05.ads, s-pack06.adb, s-pack06.ads, s-pack07.adb, s-pack07.ads, s-pack09.adb, s-pack09.ads, s-pack10.adb, s-pack10.ads, s-pack11.adb, s-pack11.ads, s-pack12.adb, s-pack12.ads, s-pack13.adb, s-pack13.ads, s-pack14.adb, s-pack14.ads, s-pack15.adb, s-pack15.ads, s-pack17.adb, s-pack17.ads, s-pack18.adb, s-pack18.ads, s-pack19.adb, s-pack19.ads, s-pack20.adb, s-pack20.ads, s-pack21.adb, s-pack21.ads, s-pack22.adb, s-pack22.ads, s-pack23.adb, s-pack23.ads, s-pack24.adb, s-pack24.ads, s-pack25.adb, s-pack25.ads, s-pack26.adb, s-pack26.ads, s-pack27.adb, s-pack27.ads, s-pack28.adb, s-pack28.ads, s-pack29.adb, s-pack29.ads, s-pack30.adb, s-pack30.ads, s-pack31.adb, s-pack31.ads, s-pack33.adb, s-pack33.ads, s-pack34.adb, s-pack34.ads, s-pack35.adb, s-pack35.ads, s-pack36.adb, s-pack36.ads, s-pack37.adb, s-pack37.ads, s-pack38.adb, s-pack38.ads, s-pack39.adb, s-pack39.ads, s-pack40.adb, s-pack40.ads, s-pack41.adb, s-pack41.ads, s-pack42.adb, s-pack42.ads, s-pack43.adb, s-pack43.ads, s-pack44.adb, s-pack44.ads, s-pack45.adb, s-pack45.ads, s-pack46.adb, s-pack46.ads, s-pack47.adb, s-pack47.ads, s-pack48.adb, s-pack48.ads, s-pack49.adb, s-pack49.ads, s-pack50.adb, s-pack50.ads, s-pack51.adb, s-pack51.ads, s-pack52.adb, s-pack52.ads, s-pack53.adb, s-pack53.ads, s-pack54.adb, s-pack54.ads, s-pack55.adb, s-pack55.ads, s-pack56.adb, s-pack56.ads, s-pack57.adb, s-pack57.ads, s-pack58.adb, s-pack58.ads, s-pack59.adb, s-pack59.ads, s-pack60.adb, s-pack60.adb, s-pack60.ads, s-pack61.adb, s-pack61.ads, s-pack62.adb, s-pack62.ads, s-pack63.adb, s-pack63.ads, s-parint.adb, s-parint.adb, s-parint.ads, sprint.ads, s-purexc.ads, s-restri.ads, s-restri.adb, s-scaval.adb, s-scaval.ads, s-secsta.adb, s-secsta.ads, s-sequio.adb, s-sequio.ads, stand.ads, s-tasuti.adb, s-traceb.adb, s-traceb.ads, stringt.adb, stringt.ads, styleg.ads, s-valboo.adb, s-valboo.ads, s-valcha.adb, s-valcha.ads, s-valdec.adb, s-valdec.ads, s-valint.adb, s-valint.ads, s-valint.ads, s-vallld.adb, s-vallld.ads, s-vallli.adb, s-vallli.ads, s-valllu.adb, s-valllu.ads, s-valrea.adb, s-valrea.ads, s-valuns.adb, s-valuns.ads, s-valuti.adb, s-valuti.ads, s-valwch.ads, s-veboop.adb, s-veboop.ads, s-vercon.adb, s-vercon.ads, s-wchcnv.adb, s-wchcnv.ads, s-wchcon.ads, s-wchjis.adb, s-wchjis.ads, s-wchstw.adb, s-wchstw.adb, s-wchstw.ads, s-wchwts.adb, s-wchwts.ads, s-widboo.adb, s-widboo.ads, s-widcha.adb, s-widcha.ads, s-widenu.adb, s-widenu.ads, s-widlli.adb, s-widlli.ads, s-widllu.adb, s-widllu.ads, s-widwch.adb, s-widwch.ads, s-wwdcha.adb, s-wwdcha.ads, s-wwdenu.adb, s-wwdenu.ads, symbols.adb, symbols.ads, table.ads, targparm.adb, targparm.ads, tb-alvms.c, tb-alvxw.c, tbuild.adb, tree_io.ads, treepr.adb, treeprs.adt, ttypef.ads, ttypes.ads, types.adb, uintp.adb, uintp.ads, uname.ads, urealp.ads, usage.ads, validsw.ads, vxaddr2line.adb, widechar.adb, widechar.ads, xeinfo.adb, xnmake.adb, xref_lib.ads, xr_tabls.adb, xr_tabls.ads, xsinfo.adb, xtreeprs.adb, xsnames.adb, vms_conv.ads, vms_conv.adb, a-dirval.ads, a-dirval.adb, a-dirval-mingw.adb, a-direct.ads, a-direct.adb, indepsw.ads, prj-attr-pm.ads, system-linux-ppc.ads, a-numaux-darwin.ads, a-numaux-darwin.adb, a-swuwha.ads, a-stunha.ads: Minor reformatting From-SVN: r107016
375 lines
12 KiB
Ada
375 lines
12 KiB
Ada
------------------------------------------------------------------------------
|
|
-- --
|
|
-- GNAT COMPILER COMPONENTS --
|
|
-- --
|
|
-- S E M _ M A P S --
|
|
-- --
|
|
-- B o d y --
|
|
-- --
|
|
-- Copyright (C) 1996-2005, 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 2, 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. See the GNU General Public License --
|
|
-- for more details. You should have received a copy of the GNU General --
|
|
-- Public License distributed with GNAT; see file COPYING. If not, write --
|
|
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
|
|
-- Boston, MA 02110-1301, USA. --
|
|
-- --
|
|
-- GNAT was originally developed by the GNAT team at New York University. --
|
|
-- Extensive contributions were provided by Ada Core Technologies Inc. --
|
|
-- --
|
|
------------------------------------------------------------------------------
|
|
|
|
with Atree; use Atree;
|
|
with Einfo; use Einfo;
|
|
with Namet; use Namet;
|
|
with Output; use Output;
|
|
with Sinfo; use Sinfo;
|
|
with Uintp; use Uintp;
|
|
|
|
package body Sem_Maps is
|
|
|
|
-----------------------
|
|
-- Local Subprograms --
|
|
-----------------------
|
|
|
|
function Find_Assoc (M : Map; E : Entity_Id) return Assoc_Index;
|
|
-- Standard hash table search. M is the map to be searched, E is the
|
|
-- entity to be searched for, and Assoc_Index is the resulting
|
|
-- association, or is set to No_Assoc if there is no association.
|
|
|
|
function Find_Header_Size (N : Int) return Header_Index;
|
|
-- Find largest power of two smaller than the number of entries in
|
|
-- the table. This load factor of 2 may be adjusted later if needed.
|
|
|
|
procedure Write_Map (E : Entity_Id);
|
|
pragma Warnings (Off, Write_Map);
|
|
-- For debugging purposes
|
|
|
|
---------------------
|
|
-- Add_Association --
|
|
---------------------
|
|
|
|
procedure Add_Association
|
|
(M : in out Map;
|
|
O_Id : Entity_Id;
|
|
N_Id : Entity_Id;
|
|
Kind : Scope_Kind := S_Local)
|
|
is
|
|
Info : constant Map_Info := Maps_Table.Table (M);
|
|
Offh : constant Header_Index := Info.Header_Offset;
|
|
Offs : constant Header_Index := Info.Header_Num;
|
|
J : constant Header_Index := Header_Index (O_Id) mod Offs;
|
|
K : constant Assoc_Index := Info.Assoc_Next;
|
|
|
|
begin
|
|
Associations_Table.Table (K) := (O_Id, N_Id, Kind, No_Assoc);
|
|
Maps_Table.Table (M).Assoc_Next := K + 1;
|
|
|
|
if Headers_Table.Table (Offh + J) /= No_Assoc then
|
|
|
|
-- Place new association at head of chain
|
|
|
|
Associations_Table.Table (K).Next := Headers_Table.Table (Offh + J);
|
|
end if;
|
|
|
|
Headers_Table.Table (Offh + J) := K;
|
|
end Add_Association;
|
|
|
|
------------------------
|
|
-- Build_Instance_Map --
|
|
------------------------
|
|
|
|
function Build_Instance_Map (M : Map) return Map is
|
|
Info : constant Map_Info := Maps_Table.Table (M);
|
|
Res : constant Map := New_Map (Int (Info.Assoc_Num));
|
|
Offh1 : constant Header_Index := Info.Header_Offset;
|
|
Offa1 : constant Assoc_Index := Info.Assoc_Offset;
|
|
Offh2 : constant Header_Index := Maps_Table.Table (Res).Header_Offset;
|
|
Offa2 : constant Assoc_Index := Maps_Table.Table (Res).Assoc_Offset;
|
|
A : Assoc;
|
|
A_Index : Assoc_Index;
|
|
|
|
begin
|
|
for J in 0 .. Info.Header_Num - 1 loop
|
|
A_Index := Headers_Table.Table (Offh1 + J);
|
|
|
|
if A_Index /= No_Assoc then
|
|
Headers_Table.Table (Offh2 + J) := A_Index + (Offa2 - Offa1);
|
|
end if;
|
|
end loop;
|
|
|
|
for J in 0 .. Info.Assoc_Num - 1 loop
|
|
A := Associations_Table.Table (Offa1 + J);
|
|
|
|
-- For local entities that come from source, create the
|
|
-- corresponding local entities in the instance. Entities that
|
|
-- do not come from source are etypes, and new ones will be
|
|
-- generated when analyzing the instance.
|
|
|
|
if No (A.New_Id)
|
|
and then A.Kind = S_Local
|
|
and then Comes_From_Source (A.Old_Id)
|
|
then
|
|
A.New_Id := New_Copy (A.Old_Id);
|
|
A.New_Id := New_Entity (Nkind (A.Old_Id), Sloc (A.Old_Id));
|
|
Set_Chars (A.New_Id, Chars (A.Old_Id));
|
|
end if;
|
|
|
|
if A.Next /= No_Assoc then
|
|
A.Next := A.Next + (Offa2 - Offa1);
|
|
end if;
|
|
|
|
Associations_Table.Table (Offa2 + J) := A;
|
|
end loop;
|
|
|
|
Maps_Table.Table (Res).Assoc_Next := Associations_Table.Last;
|
|
return Res;
|
|
end Build_Instance_Map;
|
|
|
|
-------------
|
|
-- Compose --
|
|
-------------
|
|
|
|
function Compose (Orig_Map : Map; New_Map : Map) return Map is
|
|
Res : constant Map := Copy (Orig_Map);
|
|
Off : constant Assoc_Index := Maps_Table.Table (Res).Assoc_Offset;
|
|
A : Assoc;
|
|
K : Assoc_Index;
|
|
|
|
begin
|
|
-- Iterate over the contents of Orig_Map, looking for entities
|
|
-- that are further mapped under New_Map.
|
|
|
|
for J in 0 .. Maps_Table.Table (Res).Assoc_Num - 1 loop
|
|
A := Associations_Table.Table (Off + J);
|
|
K := Find_Assoc (New_Map, A.New_Id);
|
|
|
|
if K /= No_Assoc then
|
|
Associations_Table.Table (Off + J).New_Id
|
|
:= Associations_Table.Table (K).New_Id;
|
|
end if;
|
|
end loop;
|
|
|
|
return Res;
|
|
end Compose;
|
|
|
|
----------
|
|
-- Copy --
|
|
----------
|
|
|
|
function Copy (M : Map) return Map is
|
|
Info : constant Map_Info := Maps_Table.Table (M);
|
|
Res : constant Map := New_Map (Int (Info.Assoc_Num));
|
|
Offh1 : constant Header_Index := Info.Header_Offset;
|
|
Offa1 : constant Assoc_Index := Info.Assoc_Offset;
|
|
Offh2 : constant Header_Index := Maps_Table.Table (Res).Header_Offset;
|
|
Offa2 : constant Assoc_Index := Maps_Table.Table (Res).Assoc_Offset;
|
|
A : Assoc;
|
|
A_Index : Assoc_Index;
|
|
|
|
begin
|
|
for J in 0 .. Info.Header_Num - 1 loop
|
|
A_Index := Headers_Table.Table (Offh1 + J) + (Offa2 - Offa1);
|
|
|
|
if A_Index /= No_Assoc then
|
|
Headers_Table.Table (Offh2 + J) := A_Index + (Offa2 - Offa1);
|
|
end if;
|
|
end loop;
|
|
|
|
for J in 0 .. Info.Assoc_Num - 1 loop
|
|
A := Associations_Table.Table (Offa1 + J);
|
|
A.Next := A.Next + (Offa2 - Offa1);
|
|
Associations_Table.Table (Offa2 + J) := A;
|
|
end loop;
|
|
|
|
Maps_Table.Table (Res).Assoc_Next := Associations_Table.Last;
|
|
return Res;
|
|
end Copy;
|
|
|
|
----------------
|
|
-- Find_Assoc --
|
|
----------------
|
|
|
|
function Find_Assoc (M : Map; E : Entity_Id) return Assoc_Index is
|
|
Offh : constant Header_Index := Maps_Table.Table (M).Header_Offset;
|
|
Offs : constant Header_Index := Maps_Table.Table (M).Header_Num;
|
|
J : constant Header_Index := Header_Index (E) mod Offs;
|
|
A : Assoc;
|
|
A_Index : Assoc_Index;
|
|
|
|
begin
|
|
A_Index := Headers_Table.Table (Offh + J);
|
|
|
|
if A_Index = No_Assoc then
|
|
return A_Index;
|
|
|
|
else
|
|
A := Associations_Table.Table (A_Index);
|
|
|
|
while Present (A.Old_Id) loop
|
|
|
|
if A.Old_Id = E then
|
|
return A_Index;
|
|
|
|
elsif A.Next = No_Assoc then
|
|
return No_Assoc;
|
|
|
|
else
|
|
A_Index := A.Next;
|
|
A := Associations_Table.Table (A.Next);
|
|
end if;
|
|
end loop;
|
|
|
|
return No_Assoc;
|
|
end if;
|
|
end Find_Assoc;
|
|
|
|
----------------------
|
|
-- Find_Header_Size --
|
|
----------------------
|
|
|
|
function Find_Header_Size (N : Int) return Header_Index is
|
|
Siz : Header_Index;
|
|
|
|
begin
|
|
Siz := 2;
|
|
while 2 * Siz < Header_Index (N) loop
|
|
Siz := 2 * Siz;
|
|
end loop;
|
|
|
|
return Siz;
|
|
end Find_Header_Size;
|
|
|
|
------------
|
|
-- Lookup --
|
|
------------
|
|
|
|
function Lookup (M : Map; E : Entity_Id) return Entity_Id is
|
|
Offh : constant Header_Index := Maps_Table.Table (M).Header_Offset;
|
|
Offs : constant Header_Index := Maps_Table.Table (M).Header_Num;
|
|
J : constant Header_Index := Header_Index (E) mod Offs;
|
|
A : Assoc;
|
|
|
|
begin
|
|
if Headers_Table.Table (Offh + J) = No_Assoc then
|
|
return Empty;
|
|
|
|
else
|
|
A := Associations_Table.Table (Headers_Table.Table (Offh + J));
|
|
|
|
while Present (A.Old_Id) loop
|
|
|
|
if A.Old_Id = E then
|
|
return A.New_Id;
|
|
|
|
elsif A.Next = No_Assoc then
|
|
return Empty;
|
|
|
|
else
|
|
A := Associations_Table.Table (A.Next);
|
|
end if;
|
|
end loop;
|
|
|
|
return Empty;
|
|
end if;
|
|
end Lookup;
|
|
|
|
-------------
|
|
-- New_Map --
|
|
-------------
|
|
|
|
function New_Map (Num_Assoc : Int) return Map is
|
|
Header_Size : constant Header_Index := Find_Header_Size (Num_Assoc);
|
|
Res : Map_Info;
|
|
|
|
begin
|
|
-- Allocate the tables for the new map at the current end of the
|
|
-- global tables.
|
|
|
|
Associations_Table.Increment_Last;
|
|
Headers_Table.Increment_Last;
|
|
Maps_Table.Increment_Last;
|
|
|
|
Res.Header_Offset := Headers_Table.Last;
|
|
Res.Header_Num := Header_Size;
|
|
Res.Assoc_Offset := Associations_Table.Last;
|
|
Res.Assoc_Next := Associations_Table.Last;
|
|
Res.Assoc_Num := Assoc_Index (Num_Assoc);
|
|
|
|
Headers_Table.Set_Last (Headers_Table.Last + Header_Size);
|
|
Associations_Table.Set_Last
|
|
(Associations_Table.Last + Assoc_Index (Num_Assoc));
|
|
Maps_Table.Table (Maps_Table.Last) := Res;
|
|
|
|
for J in 1 .. Header_Size loop
|
|
Headers_Table.Table (Headers_Table.Last - J) := No_Assoc;
|
|
end loop;
|
|
|
|
return Maps_Table.Last;
|
|
end New_Map;
|
|
|
|
------------------------
|
|
-- Update_Association --
|
|
------------------------
|
|
|
|
procedure Update_Association
|
|
(M : in out Map;
|
|
O_Id : Entity_Id;
|
|
N_Id : Entity_Id;
|
|
Kind : Scope_Kind := S_Local)
|
|
is
|
|
J : constant Assoc_Index := Find_Assoc (M, O_Id);
|
|
|
|
begin
|
|
Associations_Table.Table (J).New_Id := N_Id;
|
|
Associations_Table.Table (J).Kind := Kind;
|
|
end Update_Association;
|
|
|
|
---------------
|
|
-- Write_Map --
|
|
---------------
|
|
|
|
procedure Write_Map (E : Entity_Id) is
|
|
M : constant Map := Map (UI_To_Int (Renaming_Map (E)));
|
|
Info : constant Map_Info := Maps_Table.Table (M);
|
|
Offh : constant Header_Index := Info.Header_Offset;
|
|
Offa : constant Assoc_Index := Info.Assoc_Offset;
|
|
A : Assoc;
|
|
|
|
begin
|
|
Write_Str ("Size : ");
|
|
Write_Int (Int (Info.Assoc_Num));
|
|
Write_Eol;
|
|
|
|
Write_Str ("Headers");
|
|
Write_Eol;
|
|
|
|
for J in 0 .. Info.Header_Num - 1 loop
|
|
Write_Int (Int (Offh + J));
|
|
Write_Str (" : ");
|
|
Write_Int (Int (Headers_Table.Table (Offh + J)));
|
|
Write_Eol;
|
|
end loop;
|
|
|
|
for J in 0 .. Info.Assoc_Num - 1 loop
|
|
A := Associations_Table.Table (Offa + J);
|
|
Write_Int (Int (Offa + J));
|
|
Write_Str (" : ");
|
|
Write_Name (Chars (A.Old_Id));
|
|
Write_Str (" ");
|
|
Write_Int (Int (A.Old_Id));
|
|
Write_Str (" ==> ");
|
|
Write_Int (Int (A.New_Id));
|
|
Write_Str (" next = ");
|
|
Write_Int (Int (A.Next));
|
|
Write_Eol;
|
|
end loop;
|
|
end Write_Map;
|
|
|
|
end Sem_Maps;
|