b0f26df5db
* adadecode.c (ostrcpy): New function. (__gnat_decode): Use ostrcpy of strcpy. (has_prefix): Set first parameter a const. (has_suffix): Set first parameter a const. Update copyright notice. Fix source name in header. Removes a trailing space. PR ada/12014. * exp_disp.adb: Remove the test against being in No_Run_Time_Mode before generating a call to Register_Tag. It is redundant with the test against the availability of the function Register_Tag. * g-catiio.adb: (Month_Name): Correct spelling of February * make.adb: (Mains): New package (Initialize): Call Mains.Delete (Gnatmake): Check that each main on the command line is a source of a project file and, if there are several mains, each of them is a source of the same project file. (Gnatmake): When a foreign language is specified in attribute Languages, no main is specified on the command line and attribute Mains is not empty, only build the Ada main. If there is no Ada main, just compile the Ada sources and their closure. (Gnatmake): If a main is specified on the command line with directory information, check that the source exists and, if it does, that the path is the actual path of a source of a project. * prj-env.adb: (File_Name_Of_Library_Unit_Body): New Boolean parameter Full_Path. When Full_Path is True, return the full path instead of the simple file name. (Project_Of): New function * prj-env.ads: (File_Name_Of_Library_Unit_Body): New Boolean parameter Full_Path, defaulted to False. (Project_Of): New function * Makefile.generic: Ensure objects of main project are always checked and rebuilt if needed. Set CC to gcc by default. Prepare new handling of link by creating a global archive (not activated yet). * adadecode.h, atree.h, elists.h, nlists.h, raise.h, stringt.h: Update copyright notice. Remove trailing blanks. Fix source name in header. * sem_ch12.adb: Minor reformatting * sem_ch3.adb: Minor reformatting (including new function return style throughout) * sem_ch3.ads: Minor reformatting (including new function return style throughout) * Make-lang.in: Makefile automatically updated From-SVN: r72893
132 lines
4.4 KiB
C
132 lines
4.4 KiB
C
/****************************************************************************
|
|
* *
|
|
* GNAT COMPILER COMPONENTS *
|
|
* *
|
|
* N L I S T S *
|
|
* *
|
|
* C Header File *
|
|
* *
|
|
* Copyright (C) 1992-2003, 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, 59 Temple Place - Suite 330, Boston, *
|
|
* MA 02111-1307, USA. *
|
|
* *
|
|
* GNAT was originally developed by the GNAT team at New York University. *
|
|
* Extensive contributions were provided by Ada Core Technologies Inc. *
|
|
* *
|
|
****************************************************************************/
|
|
|
|
/* This is the C header corresponding to the Ada package specification for
|
|
Nlists. It also contains the implementations of inlined functions from the
|
|
the package body for Nlists. It was generated manually from nlists.ads and
|
|
nlists.adb and must be kept synchronized with changes in these files.
|
|
|
|
Note that only routines for reading the tree are included, since the
|
|
tree transformer is not supposed to modify the tree in any way. */
|
|
|
|
/* The following is the structure used for the list headers table */
|
|
|
|
struct List_Header
|
|
{
|
|
Node_Id first;
|
|
Node_Id last;
|
|
Node_Id parent;
|
|
};
|
|
|
|
/* The list headers are stored in an array. The pointer to this array is
|
|
passed as a parameter to gigi and stored in the global variable
|
|
List_Headers_Ptr. */
|
|
|
|
extern struct List_Header *List_Headers_Ptr;
|
|
|
|
/* The previous and next links for lists are held in two arrays, Next_Node and
|
|
Prev_Node. The pointers to these arrays are passed as parameters to gigi
|
|
and stored in the global variables Prev_Node_Ptr and Next_Node_Ptr. */
|
|
|
|
extern Node_Id *Next_Node_Ptr;
|
|
extern Node_Id *Prev_Node_Ptr;
|
|
|
|
/* Node List Access Functions */
|
|
|
|
static Node_Id First (List_Id);
|
|
|
|
INLINE Node_Id
|
|
First (List_Id List)
|
|
{
|
|
return List_Headers_Ptr[List - First_List_Id].first;
|
|
}
|
|
|
|
#define First_Non_Pragma nlists__first_non_pragma
|
|
extern Node_Id First_Non_Pragma (Node_Id);
|
|
|
|
static Node_Id Last (List_Id);
|
|
|
|
INLINE Node_Id
|
|
Last (List_Id List)
|
|
{
|
|
return List_Headers_Ptr[List - First_List_Id].last;
|
|
}
|
|
|
|
#define First_Non_Pragma nlists__first_non_pragma
|
|
extern Node_Id First_Non_Pragma (List_Id);
|
|
|
|
static Node_Id Next (Node_Id);
|
|
|
|
INLINE Node_Id
|
|
Next (Node_Id Node)
|
|
{
|
|
return Next_Node_Ptr[Node - First_Node_Id];
|
|
}
|
|
|
|
#define Next_Non_Pragma nlists__next_non_pragma
|
|
extern Node_Id Next_Non_Pragma (List_Id);
|
|
|
|
static Node_Id Prev (Node_Id);
|
|
|
|
INLINE Node_Id
|
|
Prev (Node_Id Node)
|
|
{
|
|
return Prev_Node_Ptr[Node - First_Node_Id];
|
|
}
|
|
|
|
|
|
#define Prev_Non_Pragma nlists__prev_non_pragma
|
|
extern Node_Id Prev_Non_Pragma (Node_Id);
|
|
|
|
static Boolean Is_Empty_List (List_Id);
|
|
static Boolean Is_Non_Empty_List (List_Id);
|
|
static Boolean Is_List_Member (Node_Id);
|
|
static List_Id List_Containing (Node_Id);
|
|
|
|
INLINE Boolean
|
|
Is_Empty_List (List_Id Id)
|
|
{
|
|
return (First (Id) == Empty);
|
|
}
|
|
|
|
INLINE Boolean
|
|
Is_Non_Empty_List (List_Id Id)
|
|
{
|
|
return (Present (Id) && First (Id) != Empty);
|
|
}
|
|
|
|
INLINE Boolean
|
|
Is_List_Member (Node_Id Node)
|
|
{
|
|
return Nodes_Ptr[Node - First_Node_Id].U.K.in_list;
|
|
}
|
|
|
|
INLINE List_Id
|
|
List_Containing (Node_Id Node)
|
|
{
|
|
return Nodes_Ptr[Node - First_Node_Id].V.NX.link;
|
|
}
|