FreeChainXenon/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

a-stwisu.adb, [...] (Super_Slice): Fix slice index.

Browse source 
* a-stwisu.adb, a-strsup.adb, a-stzsup.adb (Super_Slice): Fix slice
	index.

	* a-stwima.adb (To_Set): Add extra check when N = 0.

	* g-regpat.adb: (Match_Simple_Operator): Avoid possible overflow.

From-SVN: r111033
This commit is contained in:
Arnaud Charlet 2006-02-15 10:32:25 +01:00
parent 68e2ea2757
commit ee45a6dda7
4 changed files with 17 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
gcc/ada/a-strsup.adb
View file

@ -6,7 +6,7 @@
-- --
-- B o d y --
-- --
-- Copyright (C) 2003-2005, Free Software Foundation, Inc. --
-- Copyright (C) 2003-2006, 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- --
@ -1471,7 +1471,7 @@ package body Ada.Strings.Superbounded is
raise Index_Error;
else
Result.Current_Length := High - Low + 1;
Result.Data (1 .. Source.Current_Length) := Source.Data (Low .. High);
Result.Data (1 .. Result.Current_Length) := Source.Data (Low .. High);
end if;
return Result;
@ -1490,7 +1490,7 @@ package body Ada.Strings.Superbounded is
raise Index_Error;
else
Target.Current_Length := High - Low + 1;
Target.Data (1 .. Source.Current_Length) := Source.Data (Low .. High);
Target.Data (1 .. Target.Current_Length) := Source.Data (Low .. High);
end if;
end Super_Slice;

6
gcc/ada/a-stwisu.adb
View file

@ -6,7 +6,7 @@
-- --
-- B o d y --
-- --
-- Copyright (C) 2003-2005, Free Software Foundation, Inc. --
-- Copyright (C) 2003-2006, 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- --
@ -1474,7 +1474,7 @@ package body Ada.Strings.Wide_Superbounded is
raise Index_Error;
else
Result.Current_Length := High - Low + 1;
Result.Data (1 .. Source.Current_Length) := Source.Data (Low .. High);
Result.Data (1 .. Result.Current_Length) := Source.Data (Low .. High);
end if;
return Result;
@ -1493,7 +1493,7 @@ package body Ada.Strings.Wide_Superbounded is
raise Index_Error;
else
Target.Current_Length := High - Low + 1;
Target.Data (1 .. Source.Current_Length) := Source.Data (Low .. High);
Target.Data (1 .. Target.Current_Length) := Source.Data (Low .. High);
end if;
end Super_Slice;

6
gcc/ada/a-stzsup.adb
View file

@ -6,7 +6,7 @@
-- --
-- B o d y --
-- --
-- Copyright (C) 2003-2005, Free Software Foundation, Inc. --
-- Copyright (C) 2003-2006, 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- --
@ -1481,7 +1481,7 @@ package body Ada.Strings.Wide_Wide_Superbounded is
raise Index_Error;
else
Result.Current_Length := High - Low + 1;
Result.Data (1 .. Source.Current_Length) := Source.Data (Low .. High);
Result.Data (1 .. Result.Current_Length) := Source.Data (Low .. High);
end if;
return Result;
@ -1500,7 +1500,7 @@ package body Ada.Strings.Wide_Wide_Superbounded is
raise Index_Error;
else
Target.Current_Length := High - Low + 1;
Target.Data (1 .. Source.Current_Length) := Source.Data (Low .. High);
Target.Data (1 .. Target.Current_Length) := Source.Data (Low .. High);
end if;
end Super_Slice;

14
gcc/ada/g-regpat.adb
View file

@ -7,7 +7,7 @@
-- B o d y --
-- --
-- Copyright (C) 1986 by University of Toronto. --
-- Copyright (C) 1999-2005, AdaCore --
-- Copyright (C) 1999-2006, AdaCore --
-- --
-- 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- --
@ -2878,12 +2878,14 @@ package body GNAT.Regpat is
if Next_Char_Known then
-- Last position to check
Last_Pos := Input_Pos + Max;
if Last_Pos > Last_In_Data
or else Max = Natural'Last
then
if Max = Natural'Last then
Last_Pos := Last_In_Data;
else
Last_Pos := Input_Pos + Max;
if Last_Pos > Last_In_Data then
Last_Pos := Last_In_Data;
end if;
end if;
-- Look for the first possible opportunity