-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2004 Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2009, 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- --
+-- ware Foundation; either version 3, 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. --
+-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
--- As a special exception, if other files instantiate generics from this --
--- unit, or you link this unit with other files to produce an executable, --
--- this unit does not by itself cause the resulting executable to be --
--- covered by the GNU General Public License. This exception does not --
--- however invalidate any other reasons why the executable file might be --
--- covered by the GNU Public License. --
+-- As a special exception under Section 7 of GPL version 3, you are granted --
+-- additional permissions described in the GCC Runtime Library Exception, --
+-- version 3.1, as published by the Free Software Foundation. --
+-- --
+-- You should have received a copy of the GNU General Public License and --
+-- a copy of the GCC Runtime Library Exception along with this program; --
+-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
+-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
with System; use System;
with System.Storage_Elements; use System.Storage_Elements;
-with Unchecked_Conversion;
+with Ada.Unchecked_Conversion;
package body Interfaces.C.Strings is
- -- Note that the type chars_ptr has a pragma No_Strict_Aliasing in
- -- the spec, to prevent any assumptions about aliasing for values
- -- of this type, since arbitrary addresses can be converted, and it
- -- is quite likely that this type will in fact be used for aliasing
- -- values of other types.
+ -- Note that the type chars_ptr has a pragma No_Strict_Aliasing in the
+ -- spec, to prevent any assumptions about aliasing for values of this type,
+ -- since arbitrary addresses can be converted, and it is quite likely that
+ -- this type will in fact be used for aliasing values of other types.
function To_chars_ptr is
- new Unchecked_Conversion (Address, chars_ptr);
+ new Ada.Unchecked_Conversion (Address, chars_ptr);
function To_Address is
- new Unchecked_Conversion (chars_ptr, Address);
+ new Ada.Unchecked_Conversion (chars_ptr, Address);
-----------------------
-- Local Subprograms --
Pointer : chars_ptr;
begin
- -- Get index of position of null. If Index > Chars'last,
+ -- Get index of position of null. If Index > Chars'Last,
-- nul is absent and must be added explicitly.
Index := Position_Of_Nul (Into => Chars);
Pointer := Memory_Alloc ((Index - Chars'First + 1));
- -- If nul is present, transfer string up to and including it.
+ -- If nul is present, transfer string up to and including nul
if Index <= Chars'Last then
Update (Item => Pointer,
Offset => 0,
Chars => Chars,
Check => False);
- Poke (nul, into => Pointer + size_t'(Chars'Length));
+ Poke (nul, Into => Pointer + size_t'(Chars'Length));
end if;
return Pointer;
Result : char_array (0 .. Length);
begin
- -- As per AI-00177, this is equivalent to
- -- To_Ada (Value (Item, Length) & nul);
+ -- As per AI-00177, this is equivalent to:
+
+ -- To_Ada (Value (Item, Length) & nul);
if Item = Null_Ptr then
raise Dereference_Error;
OSDN Git Service
