86numaux.adb, [...]: Fix spelling errors.
* 86numaux.adb, a-tigeau.ads, a-wtgeau.ads, decl.c, exp_ch6.adb, exp_ch9.adb, exp_util.adb, fname-sf.ads, freeze.ads, g-awk.adb, g-comlin.ads, g-dirope.adb, g-dyntab.ads, g-socket.ads, g-table.ads, g-traceb.ads, gnat-style.texi, gnatchop.adb, init.c, layout.adb, layout.ads, mdllfile.ads, mlib-fil.ads, osint.ads, s-fatgen.adb, s-imgrea.adb, s-taprop.ads, s-tasdeb.ads, sem_aggr.adb, sem_attr.adb, sem_case.ads, sem_ch13.adb, sem_ch3.adb, sem_elab.adb, sem_maps.ads, sem_res.adb, sem_util.ads, sinfo.ads, sinput.ads, table.adb, table.ads, types.ads, urealp.adb: Fix spelling errors. From-SVN: r46581
This commit is contained in:
Joseph Myers
Joseph Myers
parent
f63d1bf775
commit
638e383e25
|
|
@ -7,7 +7,7 @@
|
|||
-- B o d y --
|
||||
-- (Machine Version for x86) --
|
||||
-- --
|
||||
-- $Revision: 1.15 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1998-2000 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -49,7 +49,7 @@ package body Ada.Numerics.Aux is
|
|||
for FPU_Stack_Pointer'Size use 3;
|
||||
|
||||
type FPU_Status_Word is record
|
||||
B : Boolean; -- FPU Busy (for 8087 compatability only)
|
||||
B : Boolean; -- FPU Busy (for 8087 compatibility only)
|
||||
ES : Boolean; -- Error Summary Status
|
||||
SF : Boolean; -- Stack Fault
|
||||
|
||||
|
|
|
|||
|
|
@ -1,3 +1,16 @@
|
|||
2001-10-28 Joseph S. Myers <jsm28@cam.ac.uk>
|
||||
|
||||
* 86numaux.adb, a-tigeau.ads, a-wtgeau.ads, decl.c, exp_ch6.adb,
|
||||
exp_ch9.adb, exp_util.adb, fname-sf.ads, freeze.ads, g-awk.adb,
|
||||
g-comlin.ads, g-dirope.adb, g-dyntab.ads, g-socket.ads,
|
||||
g-table.ads, g-traceb.ads, gnat-style.texi, gnatchop.adb, init.c,
|
||||
layout.adb, layout.ads, mdllfile.ads, mlib-fil.ads, osint.ads,
|
||||
s-fatgen.adb, s-imgrea.adb, s-taprop.ads, s-tasdeb.ads,
|
||||
sem_aggr.adb, sem_attr.adb, sem_case.ads, sem_ch13.adb,
|
||||
sem_ch3.adb, sem_elab.adb, sem_maps.ads, sem_res.adb,
|
||||
sem_util.ads, sinfo.ads, sinput.ads, table.adb, table.ads,
|
||||
types.ads, urealp.adb: Fix spelling errors.
|
||||
|
||||
2001-10-27 Laurent Guerby <guerby@acm.org>
|
||||
|
||||
* trans.c (gigi): Fix non determinism leading to bootstrap
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.13 $ --
|
||||
-- $Revision: 1.1 $ --
|
||||
-- --
|
||||
-- Copyright (C) 1992-1997 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -68,7 +68,7 @@ private package Ada.Text_IO.Generic_Aux is
|
|||
procedure Check_On_One_Line (File : File_Type; Length : Integer);
|
||||
-- Check to see if item of length Integer characters can fit on
|
||||
-- current line. Call New_Line if not, first checking that the
|
||||
-- line length can accomodate Length characters, raise Layout_Error
|
||||
-- line length can accommodate Length characters, raise Layout_Error
|
||||
-- if item is too large for a single line.
|
||||
|
||||
function Getc (File : File_Type) return Integer;
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.3 $ --
|
||||
-- $Revision: 1.1 $ --
|
||||
-- --
|
||||
-- Copyright (C) 1992-1997 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -74,7 +74,7 @@ package Ada.Wide_Text_IO.Generic_Aux is
|
|||
procedure Check_On_One_Line (File : File_Type; Length : Integer);
|
||||
-- Check to see if item of length Integer characters can fit on
|
||||
-- current line. Call New_Line if not, first checking that the
|
||||
-- line length can accomodate Length characters, raise Layout_Error
|
||||
-- line length can accommodate Length characters, raise Layout_Error
|
||||
-- if item is too large for a single line.
|
||||
|
||||
function Is_Blank (C : Character) return Boolean;
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
* *
|
||||
* C Implementation File *
|
||||
* *
|
||||
* $Revision$
|
||||
* $Revision: 1.5 $
|
||||
* *
|
||||
* Copyright (C) 1992-2001, Free Software Foundation, Inc. *
|
||||
* *
|
||||
|
|
@ -3395,7 +3395,7 @@ gnat_to_gnu_entity (gnat_entity, gnu_expr, definition)
|
|||
returns_by_ref,
|
||||
Function_Returns_With_DSP (gnat_entity));
|
||||
|
||||
/* ??? For now, don't consider nested fuctions pure. */
|
||||
/* ??? For now, don't consider nested functions pure. */
|
||||
if (! global_bindings_p ())
|
||||
pure_flag = 0;
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.343 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -887,7 +887,7 @@ package body Exp_Ch6 is
|
|||
-- Deal with access types where the actual subtpe and the
|
||||
-- formal subtype are not the same, requiring a check.
|
||||
|
||||
-- It is neccessary to exclude tagged types because of "downward
|
||||
-- It is necessary to exclude tagged types because of "downward
|
||||
-- conversion" errors and a strange assertion error in namet
|
||||
-- from gnatf in bug 1215-001 ???
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.438 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -8534,7 +8534,7 @@ package body Exp_Ch9 is
|
|||
|
||||
procedure Traverse is new Traverse_Proc;
|
||||
|
||||
-- Start of processsing for Update_Prival_Subtypes
|
||||
-- Start of processing for Update_Prival_Subtypes
|
||||
|
||||
begin
|
||||
Traverse (N);
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision$
|
||||
-- $Revision: 1.2 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -1072,12 +1072,12 @@ package body Exp_Util is
|
|||
-- Val : T := Expr;
|
||||
--
|
||||
-- <elsif Expr is an entity_name>
|
||||
-- Val : T (contraints taken from Expr) := Expr;
|
||||
-- Val : T (constraints taken from Expr) := Expr;
|
||||
--
|
||||
-- <else>
|
||||
-- type Axxx is access all T;
|
||||
-- Rval : Axxx := Expr'ref;
|
||||
-- Val : T (contraints taken from Rval) := Rval.all;
|
||||
-- Val : T (constraints taken from Rval) := Rval.all;
|
||||
|
||||
-- ??? note: when the Expression is allocated in the secondary stack
|
||||
-- we could use it directly instead of copying it by declaring
|
||||
|
|
|
|||
|
|
@ -39,7 +39,7 @@
|
|||
-- from tools that do not want to include the compiler front end.
|
||||
|
||||
-- Note that this unit does depend on several of the compiler front-end
|
||||
-- sources, including osint. If it is necesary to scan source file name
|
||||
-- sources, including osint. If it is necessary to scan source file name
|
||||
-- pragmas with less dependence on such sources, look at unit SFN_Scan.
|
||||
|
||||
package Fname.SF is
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.14 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2000, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -102,7 +102,7 @@ package Freeze is
|
|||
-- These have a delayed freeze. Gigi will generate code to evaluate
|
||||
-- the initialization expression if present and store it in a temp.
|
||||
-- The actual object is created at the point of the freeze, and if
|
||||
-- neccessary initialized by copying the value of this temporary.
|
||||
-- necessary initialized by copying the value of this temporary.
|
||||
|
||||
-- Formal Parameters
|
||||
--
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.10 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 2000-2001 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -662,7 +662,7 @@ package body GNAT.AWK is
|
|||
Results : Boolean := False;
|
||||
|
||||
begin
|
||||
-- Iterate throught the filters table, if pattern match call action.
|
||||
-- Iterate through the filters table, if pattern match call action.
|
||||
|
||||
for F in 1 .. Pattern_Action_Table.Last (Filters) loop
|
||||
if Patterns.Match (Filters.Table (F).Pattern.all, Session) then
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.24 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1999-2001 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -227,7 +227,7 @@ package GNAT.Command_Line is
|
|||
-- Returns parameter associated with the last switch returned by Getopt.
|
||||
-- If no parameter was associated with the last switch, or no previous
|
||||
-- call has been made to Get_Argument, raises Invalid_Parameter.
|
||||
-- If the last switch was associated with an optionnal argument and this
|
||||
-- If the last switch was associated with an optional argument and this
|
||||
-- argument was not found on the command line, Parameter returns an empty
|
||||
-- string
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision$
|
||||
-- $Revision: 1.2 $
|
||||
-- --
|
||||
-- Copyright (C) 1998-2001 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -228,7 +228,7 @@ package body GNAT.Directory_Operations is
|
|||
|
||||
procedure Var (K : in out Positive);
|
||||
-- Translate variable name starting at position K with the associated
|
||||
-- environement value.
|
||||
-- environment value.
|
||||
|
||||
procedure Free is
|
||||
new Unchecked_Deallocation (String, OS_Lib.String_Access);
|
||||
|
|
@ -304,7 +304,7 @@ package body GNAT.Directory_Operations is
|
|||
|
||||
if Path (E) = '}' then
|
||||
|
||||
-- OK found, translate with environement value
|
||||
-- OK found, translate with environment value
|
||||
|
||||
declare
|
||||
Env : OS_Lib.String_Access :=
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.11 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 2000-2001 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -142,7 +142,7 @@ package GNAT.Dynamic_Tables is
|
|||
procedure Set_Last (T : in out Instance; New_Val : Table_Index_Type);
|
||||
pragma Inline (Set_Last);
|
||||
-- This procedure sets Last to the indicated value. If necessary the
|
||||
-- table is reallocated to accomodate the new value (i.e. on return
|
||||
-- table is reallocated to accommodate the new value (i.e. on return
|
||||
-- the allocated table has an upper bound of at least Last). If
|
||||
-- Set_Last reduces the size of the table, then logically entries are
|
||||
-- removed from the table. If Set_Last increases the size of the
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.22 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 2001 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -48,7 +48,7 @@ package GNAT.Sockets is
|
|||
-- Sockets are designed to provide a consistent communication
|
||||
-- facility between applications. This package provides an
|
||||
-- Ada-like interface similar to the one proposed as part of the
|
||||
-- BSD socket layer. This is a system independant thick binding.
|
||||
-- BSD socket layer. This is a system independent thick binding.
|
||||
-- Here is a typical example of what you can do.
|
||||
|
||||
-- with GNAT.Sockets; use GNAT.Sockets;
|
||||
|
|
@ -771,7 +771,7 @@ package GNAT.Sockets is
|
|||
-- Return True if Socket is present in Item
|
||||
|
||||
-- C select() waits for a number of file descriptors to change
|
||||
-- status. Usually, three independant sets of descriptors are
|
||||
-- status. Usually, three independent sets of descriptors are
|
||||
-- watched (read, write and exception). A timeout gives an upper
|
||||
-- bound on the amount of time elapsed before select returns.
|
||||
-- This function blocks until an event occurs. On some platforms,
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.12 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1998-2001 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -148,7 +148,7 @@ pragma Elaborate_Body (Table);
|
|||
procedure Set_Last (New_Val : Table_Index_Type);
|
||||
pragma Inline (Set_Last);
|
||||
-- This procedure sets Last to the indicated value. If necessary the
|
||||
-- table is reallocated to accomodate the new value (i.e. on return
|
||||
-- table is reallocated to accommodate the new value (i.e. on return
|
||||
-- the allocated table has an upper bound of at least Last). If Set_Last
|
||||
-- reduces the size of the table, then logically entries are removed
|
||||
-- from the table. If Set_Last increases the size of the table, then
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.11 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1999-2000 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -45,7 +45,7 @@
|
|||
|
||||
-- To analyze the code locations later using addr2line or gdb, the necessary
|
||||
-- units must be compiled with the debugging switch -g in the usual manner.
|
||||
-- Note that it is not necesary to compile with -g to use Call_Chain. In
|
||||
-- Note that it is not necessary to compile with -g to use Call_Chain. In
|
||||
-- other words, the following sequence of steps can be used:
|
||||
|
||||
-- Compile without -g
|
||||
|
|
|
|||
|
|
@ -366,7 +366,7 @@ a follows:
|
|||
|
||||
@noindent
|
||||
The "elsif", "else" and "end if" always line up with the "if" keyword. The
|
||||
prefered location for splitting the line is before "and" or "or". The
|
||||
preferred location for splitting the line is before "and" or "or". The
|
||||
continuation of a condition is indented with two spaces or as many as needed
|
||||
to make nesting clear.
|
||||
As exception, if conditions are closely related either of the following is
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.44 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1998-2001 Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -596,7 +596,7 @@ procedure Gnatchop is
|
|||
|
||||
-- Call Gnat on the source filename argument with special options
|
||||
-- to generate offset information. If this special compilation completes
|
||||
-- succesfully then we can do the actual gnatchop operation.
|
||||
-- successfully then we can do the actual gnatchop operation.
|
||||
|
||||
Spawn (Gnat_Cmd.all, Gnat_Args.all & Chop_Name, Success);
|
||||
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@
|
|||
* *
|
||||
* I N I T *
|
||||
* *
|
||||
* $Revision$
|
||||
* $Revision: 1.2 $
|
||||
* *
|
||||
* C Implementation File *
|
||||
* *
|
||||
|
|
@ -344,7 +344,7 @@ __gnat_error_handler (sig, sip, context)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* See if the page before the faulting page is accessable. Do that
|
||||
/* See if the page before the faulting page is accessible. Do that
|
||||
by trying to access it. We'd like to simply try to access
|
||||
4096 + the faulting address, but it's not guaranteed to be
|
||||
the actual address, just to be on the same page. */
|
||||
|
|
@ -703,7 +703,7 @@ __gnat_error_handler (info)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* See if the page before the faulting page is accessable. Do that
|
||||
/* See if the page before the faulting page is accessible. Do that
|
||||
by trying to access it. */
|
||||
recurse++;
|
||||
* ((volatile char *) (info->ExceptionRecord->ExceptionInformation[1]
|
||||
|
|
@ -1126,7 +1126,7 @@ __gnat_error_handler (sig, sip)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* See if the page before the faulting page is accessable. Do that
|
||||
/* See if the page before the faulting page is accessible. Do that
|
||||
by trying to access it. We'd like to simply try to access
|
||||
4096 + the faulting address, but it's not guaranteed to be
|
||||
the actual address, just to be on the same page. */
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.33 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -2042,7 +2042,7 @@ package body Layout is
|
|||
|
||||
-- For access types, set size/alignment. This is system address
|
||||
-- size, except for fat pointers (unconstrained array access types),
|
||||
-- where the size is two times the address size, to accomodate the
|
||||
-- where the size is two times the address size, to accommodate the
|
||||
-- two pointers that are required for a fat pointer (data and
|
||||
-- template). Note that E_Access_Protected_Subprogram_Type is not
|
||||
-- an access type for this purpose since it is not a pointer but is
|
||||
|
|
@ -2072,7 +2072,7 @@ package body Layout is
|
|||
|
||||
-- For other access types, we use either address size, or, if
|
||||
-- a fat pointer is used (pointer-to-unconstrained array case),
|
||||
-- twice the address size to accomodate a fat pointer.
|
||||
-- twice the address size to accommodate a fat pointer.
|
||||
|
||||
else
|
||||
declare
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.3 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 2000-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -64,7 +64,7 @@ package Layout is
|
|||
|
||||
procedure Set_Discrete_RM_Size (Def_Id : Entity_Id);
|
||||
-- Set proper RM_Size for discrete size, this is normally the minimum
|
||||
-- number of bits to accomodate the range given, except in the case
|
||||
-- number of bits to accommodate the range given, except in the case
|
||||
-- where the subtype statically matches the first subtype, in which
|
||||
-- case the size must be copied from the first subtype. For generic
|
||||
-- types, the RM_Size is simply set to zero. This routine also sets
|
||||
|
|
|
|||
|
|
@ -34,7 +34,7 @@ package MDLL.Files is
|
|||
|
||||
function Get_Ext (Filename : in String)
|
||||
return String;
|
||||
-- return filename's extention.
|
||||
-- return filename's extension.
|
||||
|
||||
function Is_Ali (Filename : in String)
|
||||
return Boolean;
|
||||
|
|
@ -47,6 +47,6 @@ package MDLL.Files is
|
|||
function Ext_To (Filename : in String;
|
||||
New_Ext : in String := No_Ext)
|
||||
return String;
|
||||
-- return Filename with the extention change to New_Ext.
|
||||
-- return Filename with the extension change to New_Ext.
|
||||
|
||||
end MDLL.Files;
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.2 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 2001, Ada Core Technologies, Inc. --
|
||||
-- --
|
||||
|
|
@ -34,10 +34,10 @@ package MLib.Fil is
|
|||
(Filename : String;
|
||||
New_Ext : String := "")
|
||||
return String;
|
||||
-- Return Filename with the extention change to New_Ext.
|
||||
-- Return Filename with the extension change to New_Ext.
|
||||
|
||||
function Get_Ext (Filename : in String) return String;
|
||||
-- Return extention of filename.
|
||||
-- Return extension of filename.
|
||||
|
||||
function Is_Archive (Filename : String) return Boolean;
|
||||
-- Test if filename is an archive
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.108 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -113,7 +113,7 @@ package Osint is
|
|||
--
|
||||
-- Initialize may terminate execution if the parameters are invalid or some
|
||||
-- other fatal error is encountered. The interface is set up to
|
||||
-- accomodate scanning a series of files (e.g. as the result of
|
||||
-- accommodate scanning a series of files (e.g. as the result of
|
||||
-- wild card references in DOS, or an expanded list of source files
|
||||
-- in Unix). Of course it is perfectly possible to ignore this in
|
||||
-- the implementation and provide for opening only one file.
|
||||
|
|
@ -425,7 +425,7 @@ package Osint is
|
|||
-- 3. The information could be written to a separate file, whose name is
|
||||
-- related to the name of the source file by a fixed convention.
|
||||
|
||||
-- Which of these three methods is chosen depends on the contraints of the
|
||||
-- Which of these three methods is chosen depends on the constraints of the
|
||||
-- host operating system. The interface described here is independent of
|
||||
-- which of these approaches is used.
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.19 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -174,7 +174,7 @@ package body System.Fat_Gen is
|
|||
|
||||
-- More useful would be defining Expo to be T'Machine_Emin - 1 or
|
||||
-- T'Machine_Emin - T'Machine_Mantissa, which would preserve
|
||||
-- monotonicity of the exponent fuction ???
|
||||
-- monotonicity of the exponent function ???
|
||||
|
||||
-- Check for infinities, transfinites, whatnot.
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.45 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -158,7 +158,7 @@ package body System.Img_Real is
|
|||
|
||||
Digs : String (1 .. 2 * Field_Max + 16);
|
||||
-- Array used to hold digits of converted integer value. This is a
|
||||
-- large enough buffer to accomodate ludicrous values of Fore and Aft.
|
||||
-- large enough buffer to accommodate ludicrous values of Fore and Aft.
|
||||
|
||||
Ndigs : Natural;
|
||||
-- Number of digits stored in Digs (and also subscript of last digit)
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.40 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -453,7 +453,7 @@ package System.Task_Primitives.Operations is
|
|||
-- Suspend a specific task when the underlying thread library provides
|
||||
-- such functionality, unless the thread associated with T is
|
||||
-- Thread_Self.
|
||||
-- Such functionnality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Such functionality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Return True is the operation is successful
|
||||
|
||||
function Resume_Task
|
||||
|
|
@ -462,7 +462,7 @@ package System.Task_Primitives.Operations is
|
|||
-- Resume a specific task when the underlying thread library provides
|
||||
-- such functionality, unless the thread associated with T is
|
||||
-- Thread_Self.
|
||||
-- Such functionnality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Such functionality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Return True is the operation is successful
|
||||
|
||||
procedure Lock_All_Tasks_List;
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.16 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1997-1998, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -117,14 +117,14 @@ package System.Tasking.Debug is
|
|||
-- Suspend all the tasks except the one whose associated thread is
|
||||
-- Thread_Self by traversing All_Tasks_Lists and calling
|
||||
-- System.Task_Primitives.Operations.Suspend_Task
|
||||
-- Such functionnality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Such functionality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Warning: for efficiency purposes, there is no locking.
|
||||
|
||||
procedure Resume_All_Tasks (Thread_Self : OS_Interface.Thread_Id);
|
||||
-- Resume all the tasks except the one whose associated thread is
|
||||
-- Thread_Self by traversing All_Tasks_Lists and calling
|
||||
-- System.Task_Primitives.Operations.Continue_Task
|
||||
-- Such functionnality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Such functionality is needed by gdb on some targets (e.g VxWorks)
|
||||
-- Warning: for efficiency purposes, there is no locking.
|
||||
|
||||
end System.Tasking.Debug;
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.232 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -2011,7 +2011,7 @@ package body Sem_Aggr is
|
|||
|
||||
procedure Resolve_Aggr_Expr (Expr : Node_Id; Component : Node_Id);
|
||||
-- Analyzes and resolves expression Expr against the Etype of the
|
||||
-- Component. This routine also applies all appropiate checks to Expr.
|
||||
-- Component. This routine also applies all appropriate checks to Expr.
|
||||
-- It finally saves a Expr in the newly created association list that
|
||||
-- will be attached to the final record aggregate. Note that if the
|
||||
-- Parent pointer of Expr is not set then Expr was produced with a
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.552 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -5457,7 +5457,7 @@ package body Sem_Attr is
|
|||
|
||||
when Attribute_Small =>
|
||||
|
||||
-- The floating-point case is present only for Ada 83 compatability.
|
||||
-- The floating-point case is present only for Ada 83 compatibility.
|
||||
-- Note that strictly this is an illegal addition, since we are
|
||||
-- extending an Ada 95 defined attribute, but we anticipate an
|
||||
-- ARG ruling that will permit this.
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.5 $ --
|
||||
-- $Revision: 1.1 $ --
|
||||
-- --
|
||||
-- Copyright (C) 1996 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -28,7 +28,7 @@
|
|||
|
||||
with Types; use Types;
|
||||
|
||||
-- Package containing all the routines to proces a list of discrete choices.
|
||||
-- Package containing all the routines to process a list of discrete choices.
|
||||
-- Such lists can occur in 3 different constructs: case statements, array
|
||||
-- aggregates and record variants. We have factorized what used to be 3 very
|
||||
-- similar sets of routines here. If you didn't figure it out already Choi
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.390 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -3049,8 +3049,8 @@ package body Sem_Ch13 is
|
|||
S := 1;
|
||||
B := Uint_1;
|
||||
|
||||
-- S = size, B = 2 ** (size - 1) (can accomodate -B .. +(B - 1))
|
||||
-- Note that we accomodate the case where the bounds cross. This
|
||||
-- S = size, B = 2 ** (size - 1) (can accommodate -B .. +(B - 1))
|
||||
-- Note that we accommodate the case where the bounds cross. This
|
||||
-- can happen either because of the way the bounds are declared
|
||||
-- or because of the algorithm in Freeze_Fixed_Point_Type.
|
||||
|
||||
|
|
@ -3075,7 +3075,7 @@ package body Sem_Ch13 is
|
|||
Hi := Lo;
|
||||
end if;
|
||||
|
||||
-- S = size, (can accomodate 0 .. (2**size - 1))
|
||||
-- S = size, (can accommodate 0 .. (2**size - 1))
|
||||
|
||||
S := 0;
|
||||
while Hi >= Uint_2 ** S loop
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision$
|
||||
-- $Revision: 1.2 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -5259,7 +5259,7 @@ package body Sem_Ch3 is
|
|||
|
||||
-- The following is only useful for the benefit of generic
|
||||
-- instances but it does not interfere with other
|
||||
-- processsing for the non-generic case so we do it in all
|
||||
-- processing for the non-generic case so we do it in all
|
||||
-- cases (for generics this statement is executed when
|
||||
-- processing the generic definition, see comment at the
|
||||
-- begining of this if statement).
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision$
|
||||
-- $Revision: 1.3 $
|
||||
-- --
|
||||
-- Copyright (C) 1997-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -1035,7 +1035,7 @@ package body Sem_Elab is
|
|||
|
||||
-- If none of those cases holds, but Dynamic_Elaboration_Checks mode
|
||||
-- is set, then we will do the check, but only in the inter-unit case
|
||||
-- (this is to accomodate unguarded elaboration calls from other units
|
||||
-- (this is to accommodate unguarded elaboration calls from other units
|
||||
-- in which this same mode is set). We don't want warnings in this case,
|
||||
-- it would generate warnings having nothing to do with elaboration.
|
||||
|
||||
|
|
@ -1164,7 +1164,7 @@ package body Sem_Elab is
|
|||
|
||||
-- If none of those cases holds, but Dynamic_Elaboration_Checks mode
|
||||
-- is set, then we will do the check, but only in the inter-unit case
|
||||
-- (this is to accomodate unguarded elaboration calls from other units
|
||||
-- (this is to accommodate unguarded elaboration calls from other units
|
||||
-- in which this same mode is set). We inhibit warnings in this case,
|
||||
-- since this instantiation is not occurring in elaboration code.
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.4 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1996-1999 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -98,7 +98,7 @@ private
|
|||
-- maps have a fixed size and never need to be reallocated. Furthermore,
|
||||
-- the headers of the hash table of a dynamically allocated map can be
|
||||
-- chosen according to the total number of entries in the map, to
|
||||
-- accomodate efficiently generic units of different sizes (Unchecked_
|
||||
-- accommodate efficiently generic units of different sizes (Unchecked_
|
||||
-- Conversion vs. Generic_Elementary_Functions, for example). So in
|
||||
-- fact both components of a map have fixed size, and can be allocated
|
||||
-- using the standard table mechanism. A Maps_Table holds records that
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision$
|
||||
-- $Revision: 1.4 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -787,7 +787,7 @@ package body Sem_Res is
|
|||
type Kind_Test is access function (E : Entity_Id) return Boolean;
|
||||
|
||||
function Is_Definite_Access_Type (E : Entity_Id) return Boolean;
|
||||
-- Determine whether E is an acess type declared by an access decla-
|
||||
-- Determine whether E is an access type declared by an access decla-
|
||||
-- ration, and not an (anonymous) allocator type.
|
||||
|
||||
function Operand_Type_In_Scope (S : Entity_Id) return Boolean;
|
||||
|
|
@ -5008,7 +5008,7 @@ package body Sem_Res is
|
|||
|
||||
-- If we are taking the reference of a volatile entity, then treat
|
||||
-- it as a potential modification of this entity. This is much too
|
||||
-- conservative, but is neccessary because remove side effects can
|
||||
-- conservative, but is necessary because remove side effects can
|
||||
-- result in transformations of normal assignments into reference
|
||||
-- sequences that otherwise fail to notice the modification.
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.225 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -591,7 +591,7 @@ package Sem_Util is
|
|||
-- Determines if T1 and T2 represent exactly the same type. Two types
|
||||
-- are the same if they are identical, or if one is an unconstrained
|
||||
-- subtype of the other, or they are both common subtypes of the same
|
||||
-- type with identical contraints. The result returned is conservative.
|
||||
-- type with identical constraints. The result returned is conservative.
|
||||
-- It is True if the types are known to be the same, but a result of
|
||||
-- False is indecisive (e.g. the compiler may not be able to tell that
|
||||
-- two constraints are identical).
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.2 $
|
||||
-- $Revision: 1.3 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -6208,7 +6208,7 @@ package Sinfo is
|
|||
-- to unchecked conversion, and these are most conveniently performed
|
||||
-- in the specialized back-end.
|
||||
|
||||
-- To accomodate this requirement, for such back ends, the following
|
||||
-- To accommodate this requirement, for such back ends, the following
|
||||
-- special node is generated recording an unchecked conversion that
|
||||
-- needs to be validated. The back end should post an appropriate
|
||||
-- error message if the unchecked conversion is invalid or warrants
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision$
|
||||
-- $Revision: 1.2 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -619,7 +619,7 @@ private
|
|||
(S : in out Source_File_Record;
|
||||
New_Max : Nat);
|
||||
-- Allocate or reallocate the lines table for the given source file so
|
||||
-- that it can accomodate at least New_Max lines. Also allocates or
|
||||
-- that it can accommodate at least New_Max lines. Also allocates or
|
||||
-- reallocates logical lines table if source ref pragmas are present.
|
||||
|
||||
procedure Add_Line_Tables_Entry
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.44 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -306,7 +306,7 @@ package body Table is
|
|||
-- Tree_Read --
|
||||
---------------
|
||||
|
||||
-- Note: we allocate only the space required to accomodate the data
|
||||
-- Note: we allocate only the space required to accommodate the data
|
||||
-- actually written, which means that a Tree_Write/Tree_Read sequence
|
||||
-- does an implicit Release.
|
||||
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision: 1.38 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -155,7 +155,7 @@ pragma Elaborate_Body (Table);
|
|||
procedure Set_Last (New_Val : Table_Index_Type);
|
||||
pragma Inline (Set_Last);
|
||||
-- This procedure sets Last to the indicated value. If necessary the
|
||||
-- table is reallocated to accomodate the new value (i.e. on return
|
||||
-- table is reallocated to accommodate the new value (i.e. on return
|
||||
-- the allocated table has an upper bound of at least Last). If Set_Last
|
||||
-- reduces the size of the table, then logically entries are removed
|
||||
-- from the table. If Set_Last increases the size of the table, then
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- S p e c --
|
||||
-- --
|
||||
-- $Revision$
|
||||
-- $Revision: 1.2 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -199,7 +199,7 @@ pragma Preelaborate (Types);
|
|||
-- character in the source buffer. As noted above, diffferent source
|
||||
-- buffers have different ranges, so it is possible to tell from a
|
||||
-- Source_Ptr value which source it refers to. Note that negative numbers
|
||||
-- are allowed to accomodate the following special values.
|
||||
-- are allowed to accommodate the following special values.
|
||||
|
||||
No_Location : constant Source_Ptr := -1;
|
||||
-- Value used to indicate no source position set in a node
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@
|
|||
-- --
|
||||
-- B o d y --
|
||||
-- --
|
||||
-- $Revision: 1.60 $
|
||||
-- $Revision: 1.1 $
|
||||
-- --
|
||||
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
|
||||
-- --
|
||||
|
|
@ -162,7 +162,7 @@ package body Urealp is
|
|||
|
||||
-- For based numbers, just subtract the decimal exponent from the
|
||||
-- high estimate of the number of digits in the numerator and add
|
||||
-- one to accomodate possible round off errors for non-decimal
|
||||
-- one to accommodate possible round off errors for non-decimal
|
||||
-- bases. For example:
|
||||
|
||||
-- 1_500_000 / 10**4 = 1.50E-2
|
||||
|
|
@ -202,7 +202,7 @@ package body Urealp is
|
|||
|
||||
-- For based numbers, just subtract the decimal exponent from the
|
||||
-- low estimate of the number of digits in the numerator and subtract
|
||||
-- one to accomodate possible round off errors for non-decimal
|
||||
-- one to accommodate possible round off errors for non-decimal
|
||||
-- bases. For example:
|
||||
|
||||
-- 1_500_000 / 10**4 = 1.50E-2
|
||||
|
|
@ -988,7 +988,7 @@ package body Urealp is
|
|||
return UR_Is_Negative (Left);
|
||||
|
||||
-- If we fall through, full gruesome test is required. This happens
|
||||
-- if the numbers are close together, or in some wierd (/=10) base.
|
||||
-- if the numbers are close together, or in some weird (/=10) base.
|
||||
|
||||
else
|
||||
declare
|
||||
|
|
|
|||
Loading…
Reference in New Issue