diff options
| author | Robert Dewar <dewar@adacore.com> | 2007-12-13 11:22:06 +0100 |
|---|---|---|
| committer | Arnaud Charlet <charlet@gcc.gnu.org> | 2007-12-13 11:22:06 +0100 |
| commit | ac4d64074400613b205bba2e6d21272b4c648bc5 (patch) | |
| tree | c68ed79f7c2a4dc0ccf8b7d714f6a24bc37734fb /gcc/ada/nlists.adb | |
| parent | f8755021cc57dcd4514ef53a8d8cb5fe4059d1c8 (diff) | |
| download | gcc-ac4d64074400613b205bba2e6d21272b4c648bc5.zip gcc-ac4d64074400613b205bba2e6d21272b4c648bc5.tar.gz gcc-ac4d64074400613b205bba2e6d21272b4c648bc5.tar.bz2 | |
atree.adb (Flag231..Flag247): New functions
2007-12-06 Robert Dewar <dewar@adacore.com>
* atree.adb (Flag231..Flag247): New functions
(Set_Flag231..Set_Flag247): New procedures
(Basic_Set_Convention): Rename Set_Convention to be
Basic_Set_Convention
(Nkind_In): New functions
Remove Atree.Delete_Tree/Delete_Node and Nlist.Delete_List
* exp_ch6.adb (Expand_Call): Use new flag Has_Pragma_Inline_Always
instead
of obsolete function Is_Always_Inlined
(Register_Predefined_DT_Entry): Initialize slots of the second
secondary dispatch table.
Remove Atree.Delete_Tree/Delete_Node and Nlist.Delete_List
(Expand_N_Function_Call): Remove special provision for stack checking.
* exp_util.ads, exp_util.adb (Is_Predefined_Dispatching_Operation):
Include _Disp_Requeue in the list of predefined operations.
(Find_Interface_ADT): Modified to fulfill the new specification.
Remove Atree.Delete_Tree/Delete_Node and Nlist.Delete_List
* par-ch4.adb, nlists.ads, nlists.adb:
Remove Atree.Delete_Tree/Delete_Node and Nlist.Delete_List
* sinfo.ads, sinfo.adb: (Nkind_In): New functions
Fix location of flag for unrecognized pragma message
* sem_ch7.adb: Use Nkind_In
From-SVN: r130820
Diffstat (limited to 'gcc/ada/nlists.adb')
| -rw-r--r-- | gcc/ada/nlists.adb | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/gcc/ada/nlists.adb b/gcc/ada/nlists.adb index 0745f38..b75226e 100644 --- a/gcc/ada/nlists.adb +++ b/gcc/ada/nlists.adb @@ -279,22 +279,6 @@ package body Nlists is Append (Node, To); end Append_To; - ----------------- - -- Delete_List -- - ----------------- - - procedure Delete_List (L : List_Id) is - N : Node_Id; - - begin - while Is_Non_Empty_List (L) loop - N := Remove_Head (L); - Delete_Tree (N); - end loop; - - -- Should recycle list header??? - end Delete_List; - ----------- -- First -- ----------- @@ -315,7 +299,6 @@ package body Nlists is function First_Non_Pragma (List : List_Id) return Node_Id is N : constant Node_Id := First (List); - begin if Nkind (N) /= N_Pragma and then @@ -649,7 +632,6 @@ package body Nlists is function Last_Non_Pragma (List : List_Id) return Node_Id is N : constant Node_Id := Last (List); - begin if Nkind (N) /= N_Pragma then return N; |