projects / thirdparty / gcc.git / blame
| Commit | Line | Data |
|---|---|---|
| d06b3b1d JM |
1 | ------------------------------------------------------------------------------ |
| 2 | -- -- | |
| 3 | -- GNAT COMPILER COMPONENTS -- | |
| 4 | -- -- | |
| 5 | -- S E M _ S C I L -- | |
| 6 | -- -- | |
| 7665e4bd | 7 | -- S p e c -- |
| d06b3b1d | 8 | -- -- |
| 4b490c1e | 9 | -- Copyright (C) 2009-2020, Free Software Foundation, Inc. -- |
| d06b3b1d JM |
10 | -- -- |
| 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. -- | |
| 20 | -- -- | |
| 21 | -- GNAT was originally developed by the GNAT team at New York University. -- | |
| 22 | -- Extensive contributions were provided by Ada Core Technologies Inc. -- | |
| 23 | -- -- | |
| 24 | ------------------------------------------------------------------------------ | |
| 25 | ||
| 26 | -- This package contains routines involved in the frontend addition and | |
| 27 | -- verification of SCIL nodes. | |
| 28 | ||
| 29 | with Atree; use Atree; | |
| 30 | with Types; use Types; | |
| 31 | ||
| 32 | package Sem_SCIL is | |
| 33 | ||
| b16ffa33 AC |
34 | -- SCIL (Statically Checkable Intermediate Language) is produced by the |
| 35 | -- CodePeer back end (aka gnat2scil). For some constructs (tagged type | |
| 36 | -- declarations, dispatching calls, classwide membership tests), the | |
| 37 | -- CodePeer back end needs to locate certain nodes in the tree. To allow | |
| 38 | -- CodePeer to do this without introducing unwanted dependencies on the | |
| 39 | -- details of the FE's expansion strategies, SCIL_Nodes are generated. | |
| 40 | ||
| 41 | -- For example, a dispatching call in the Ada source will, if CodePeer mode | |
| 42 | -- is enabled, result in the FE's generation of an N_Scil_Dispatching_Call | |
| 43 | -- node decorated with semantic attributes which identify the call itself, | |
| 44 | -- the primitive operation being called, the tagged type to which the | |
| 45 | -- operation belongs, and the controlling tag value of the call. If the FE | |
| 46 | -- implements some new expansion strategy for dispatching calls but this | |
| 47 | -- interface is preserved, the CodePeer back end should be unaffected. | |
| d06b3b1d | 48 | |
| d06b3b1d JM |
49 | function Check_SCIL_Node (N : Node_Id) return Traverse_Result; |
| 50 | -- Process a single node during the tree traversal. Done to verify that | |
| 51 | -- SCIL nodes decoration fulfill the requirements of the SCIL backend. | |
| 52 | ||
| 53 | procedure Check_SCIL_Nodes is new Traverse_Proc (Check_SCIL_Node); | |
| 54 | -- The traversal procedure itself | |
| 55 | ||
| d06b3b1d JM |
56 | function First_Non_SCIL_Node (L : List_Id) return Node_Id; |
| 57 | -- Returns the first non-SCIL node of list L | |
| 58 | ||
| 59 | function Next_Non_SCIL_Node (N : Node_Id) return Node_Id; | |
| 60 | -- N must be a member of a list. Returns the next non SCIL node in the list | |
| 61 | -- containing N, or Empty if this is the last non SCIL node in the list. | |
| 62 | ||
| 63 | end Sem_SCIL; |