diff options
Diffstat (limited to 'gcc-4.3.1/gcc/ada/exp_tss.adb')
-rw-r--r-- | gcc-4.3.1/gcc/ada/exp_tss.adb | 414 |
1 files changed, 414 insertions, 0 deletions
diff --git a/gcc-4.3.1/gcc/ada/exp_tss.adb b/gcc-4.3.1/gcc/ada/exp_tss.adb new file mode 100644 index 000000000..e3a7c292c --- /dev/null +++ b/gcc-4.3.1/gcc/ada/exp_tss.adb @@ -0,0 +1,414 @@ +------------------------------------------------------------------------------ +-- -- +-- GNAT COMPILER COMPONENTS -- +-- -- +-- E X P _ T S S -- +-- -- +-- B o d y -- +-- -- +-- Copyright (C) 1992-2007, 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. 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 COPYING3. If not, go to -- +-- http://www.gnu.org/licenses for a complete copy of the license. -- +-- -- +-- 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 Elists; use Elists; +with Exp_Util; use Exp_Util; +with Lib; use Lib; +with Sem_Util; use Sem_Util; +with Sinfo; use Sinfo; + +package body Exp_Tss is + + -------------------- + -- Base_Init_Proc -- + -------------------- + + function Base_Init_Proc (Typ : Entity_Id) return Entity_Id is + Full_Type : E; + Proc : Entity_Id; + + begin + pragma Assert (Is_Type (Typ)); + + if Is_Private_Type (Typ) then + Full_Type := Underlying_Type (Base_Type (Typ)); + else + Full_Type := Typ; + end if; + + if No (Full_Type) then + return Empty; + elsif Is_Concurrent_Type (Full_Type) + and then Present (Corresponding_Record_Type (Base_Type (Full_Type))) + then + return Init_Proc (Corresponding_Record_Type (Base_Type (Full_Type))); + + else + Proc := Init_Proc (Base_Type (Full_Type)); + + if No (Proc) + and then Is_Composite_Type (Full_Type) + and then Is_Derived_Type (Full_Type) + then + return Init_Proc (Root_Type (Full_Type)); + else + return Proc; + end if; + end if; + end Base_Init_Proc; + + -------------- + -- Copy_TSS -- + -------------- + + -- Note: internally this routine is also used to initially set up + -- a TSS entry for a new type (case of being called from Set_TSS) + + procedure Copy_TSS (TSS : Entity_Id; Typ : Entity_Id) is + FN : Node_Id; + + begin + Ensure_Freeze_Node (Typ); + FN := Freeze_Node (Typ); + + if No (TSS_Elist (FN)) then + Set_TSS_Elist (FN, New_Elmt_List); + end if; + + -- We prepend here, so that a second call overrides the first, it + -- is not clear that this is required, but it seems reasonable. + + Prepend_Elmt (TSS, TSS_Elist (FN)); + end Copy_TSS; + + ------------------------ + -- Find_Inherited_TSS -- + ------------------------ + + function Find_Inherited_TSS + (Typ : Entity_Id; + Nam : TSS_Name_Type) return Entity_Id + is + Btyp : Entity_Id := Typ; + Proc : Entity_Id; + + begin + loop + Btyp := Base_Type (Btyp); + Proc := TSS (Btyp, Nam); + + exit when Present (Proc) + or else not Is_Derived_Type (Btyp); + + -- If Typ is a derived type, it may inherit attributes from some + -- ancestor. + + Btyp := Etype (Btyp); + end loop; + + if No (Proc) then + + -- If nothing else, use the TSS of the root type + + Proc := TSS (Base_Type (Underlying_Type (Typ)), Nam); + end if; + + return Proc; + end Find_Inherited_TSS; + + ----------------------- + -- Get_TSS_Name_Type -- + ----------------------- + + function Get_TSS_Name (E : Entity_Id) return TSS_Name_Type is + C1 : Character; + C2 : Character; + Nm : TSS_Name_Type; + + begin + Get_Last_Two_Chars (Chars (E), C1, C2); + + if C1 in 'A' .. 'Z' and then C2 in 'A' .. 'Z' then + Nm := (C1, C2); + + for J in TSS_Names'Range loop + if Nm = TSS_Names (J) then + return Nm; + end if; + end loop; + end if; + + return TSS_Null; + end Get_TSS_Name; + + --------------------------------- + -- Has_Non_Null_Base_Init_Proc -- + --------------------------------- + + function Has_Non_Null_Base_Init_Proc (Typ : Entity_Id) return Boolean is + BIP : constant Entity_Id := Base_Init_Proc (Typ); + + begin + return Present (BIP) and then not Is_Null_Init_Proc (BIP); + end Has_Non_Null_Base_Init_Proc; + + --------------- + -- Init_Proc -- + --------------- + + function Init_Proc (Typ : Entity_Id) return Entity_Id is + FN : constant Node_Id := Freeze_Node (Typ); + Elmt : Elmt_Id; + + begin + if No (FN) then + return Empty; + + elsif No (TSS_Elist (FN)) then + return Empty; + + else + Elmt := First_Elmt (TSS_Elist (FN)); + while Present (Elmt) loop + if Is_Init_Proc (Node (Elmt)) then + return Node (Elmt); + end if; + + Next_Elmt (Elmt); + end loop; + end if; + + return Empty; + end Init_Proc; + + ------------------ + -- Is_Init_Proc -- + ------------------ + + function Is_Init_Proc (E : Entity_Id) return Boolean is + C1 : Character; + C2 : Character; + begin + Get_Last_Two_Chars (Chars (E), C1, C2); + return C1 = TSS_Init_Proc (1) and then C2 = TSS_Init_Proc (2); + end Is_Init_Proc; + + ------------ + -- Is_TSS -- + ------------ + + function Is_TSS (E : Entity_Id; Nam : TSS_Name_Type) return Boolean is + C1 : Character; + C2 : Character; + begin + Get_Last_Two_Chars (Chars (E), C1, C2); + return C1 = Nam (1) and then C2 = Nam (2); + end Is_TSS; + + function Is_TSS (N : Name_Id; Nam : TSS_Name_Type) return Boolean is + C1 : Character; + C2 : Character; + begin + Get_Last_Two_Chars (N, C1, C2); + return C1 = Nam (1) and then C2 = Nam (2); + end Is_TSS; + + ------------------------- + -- Make_Init_Proc_Name -- + ------------------------- + + function Make_Init_Proc_Name (Typ : Entity_Id) return Name_Id is + begin + return Make_TSS_Name (Typ, TSS_Init_Proc); + end Make_Init_Proc_Name; + + ------------------- + -- Make_TSS_Name -- + ------------------- + + function Make_TSS_Name + (Typ : Entity_Id; + Nam : TSS_Name_Type) return Name_Id + is + begin + Get_Name_String (Chars (Typ)); + Add_Char_To_Name_Buffer (Nam (1)); + Add_Char_To_Name_Buffer (Nam (2)); + return Name_Find; + end Make_TSS_Name; + + ------------------------- + -- Make_TSS_Name_Local -- + ------------------------- + + function Make_TSS_Name_Local + (Typ : Entity_Id; + Nam : TSS_Name_Type) return Name_Id + is + begin + Get_Name_String (Chars (Typ)); + Add_Char_To_Name_Buffer ('_'); + Add_Nat_To_Name_Buffer (Increment_Serial_Number); + Add_Char_To_Name_Buffer (Nam (1)); + Add_Char_To_Name_Buffer (Nam (2)); + return Name_Find; + end Make_TSS_Name_Local; + + -------------- + -- Same_TSS -- + -------------- + + function Same_TSS (E1, E2 : Entity_Id) return Boolean is + E1C1 : Character; + E1C2 : Character; + E2C1 : Character; + E2C2 : Character; + + begin + Get_Last_Two_Chars (Chars (E1), E1C1, E1C2); + Get_Last_Two_Chars (Chars (E2), E2C1, E2C2); + + return + E1C1 = E2C1 + and then + E1C2 = E2C2 + and then + E1C1 in 'A' .. 'Z' + and then + E1C2 in 'A' .. 'Z'; + end Same_TSS; + + ------------------- + -- Set_Init_Proc -- + ------------------- + + procedure Set_Init_Proc (Typ : Entity_Id; Init : Entity_Id) is + begin + Set_TSS (Typ, Init); + end Set_Init_Proc; + + ------------- + -- Set_TSS -- + ------------- + + procedure Set_TSS (Typ : Entity_Id; TSS : Entity_Id) is + Subprog_Body : constant Node_Id := Unit_Declaration_Node (TSS); + + begin + -- Case of insertion location is in unit defining the type + + if In_Same_Code_Unit (Typ, TSS) then + Append_Freeze_Action (Typ, Subprog_Body); + + -- Otherwise, we are using an already existing TSS in another unit + + else + null; + end if; + + Copy_TSS (TSS, Typ); + end Set_TSS; + + --------- + -- TSS -- + --------- + + function TSS (Typ : Entity_Id; Nam : TSS_Name_Type) return Entity_Id is + FN : constant Node_Id := Freeze_Node (Typ); + Elmt : Elmt_Id; + Subp : Entity_Id; + + begin + if No (FN) then + return Empty; + + elsif No (TSS_Elist (FN)) then + return Empty; + + else + Elmt := First_Elmt (TSS_Elist (FN)); + while Present (Elmt) loop + if Is_TSS (Node (Elmt), Nam) then + Subp := Node (Elmt); + + -- For stream subprograms, the TSS entity may be a renaming- + -- as-body of an already generated entity. Use that one rather + -- the one introduced by the renaming, which is an artifact of + -- current stream handling. + + if Nkind (Parent (Parent (Subp))) = + N_Subprogram_Renaming_Declaration + and then + Present (Corresponding_Spec (Parent (Parent (Subp)))) + then + return Corresponding_Spec (Parent (Parent (Subp))); + else + return Subp; + end if; + + else + Next_Elmt (Elmt); + end if; + end loop; + end if; + + return Empty; + end TSS; + + function TSS (Typ : Entity_Id; Nam : Name_Id) return Entity_Id is + FN : constant Node_Id := Freeze_Node (Typ); + Elmt : Elmt_Id; + Subp : Entity_Id; + + begin + if No (FN) then + return Empty; + + elsif No (TSS_Elist (FN)) then + return Empty; + + else + Elmt := First_Elmt (TSS_Elist (FN)); + while Present (Elmt) loop + if Chars (Node (Elmt)) = Nam then + Subp := Node (Elmt); + + -- For stream subprograms, the TSS entity may be a renaming- + -- as-body of an already generated entity. Use that one rather + -- the one introduced by the renaming, which is an artifact of + -- current stream handling. + + if Nkind (Parent (Parent (Subp))) = + N_Subprogram_Renaming_Declaration + and then + Present (Corresponding_Spec (Parent (Parent (Subp)))) + then + return Corresponding_Spec (Parent (Parent (Subp))); + else + return Subp; + end if; + + else + Next_Elmt (Elmt); + end if; + end loop; + end if; + + return Empty; + end TSS; + +end Exp_Tss; |