1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 -- This package contains routines involved in the frontend addition and
27 -- verification of SCIL nodes.
29 with Atree
; use Atree
;
30 with Types
; use Types
;
34 -- Here would be a good place to document what SCIL is all about ???
36 procedure Adjust_SCIL_Node
(Old_Node
: Node_Id
; New_Node
: Node_Id
);
37 -- Searches for a SCIL dispatching node associated with Old_Node. If found
38 -- then update its SCIL_Related_Node field to reference New_Node.
40 function Check_SCIL_Node
(N
: Node_Id
) return Traverse_Result
;
41 -- Process a single node during the tree traversal. Done to verify that
42 -- SCIL nodes decoration fulfill the requirements of the SCIL backend.
44 procedure Check_SCIL_Nodes
is new Traverse_Proc
(Check_SCIL_Node
);
45 -- The traversal procedure itself
47 function Find_SCIL_Node
(Node
: Node_Id
) return Node_Id
;
48 -- Searches for a SCIL dispatching node associated with Node. If not found
51 function First_Non_SCIL_Node
(L
: List_Id
) return Node_Id
;
52 -- Returns the first non-SCIL node of list L
54 function Next_Non_SCIL_Node
(N
: Node_Id
) return Node_Id
;
55 -- N must be a member of a list. Returns the next non SCIL node in the list
56 -- containing N, or Empty if this is the last non SCIL node in the list.