1 ------------------------------------------------------------------------------
3 -- GNAT RUN-TIME COMPONENTS --
5 -- A D A . C A L E N D A R --
9 -- Copyright (C) 1992-2000 Free Software Foundation, Inc. --
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 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
32 ------------------------------------------------------------------------------
34 -- This is the Alpha/VMS version.
36 with System.Aux_DEC; use System.Aux_DEC;
38 package body Ada.Calendar is
40 ------------------------------
41 -- Use of Pragma Unsuppress --
42 ------------------------------
44 -- This implementation of Calendar takes advantage of the permission in
45 -- Ada 95 of using arithmetic overflow checks to check for out of bounds
46 -- time values. This means that we must catch the constraint error that
47 -- results from arithmetic overflow, so we use pragma Unsuppress to make
48 -- sure that overflow is enabled, using software overflow checking if
49 -- necessary. That way, compiling Calendar with options to suppress this
50 -- checking will not affect its correctness.
52 ------------------------
53 -- Local Declarations --
54 ------------------------
56 Ada_Year_Min : constant := 1901;
57 Ada_Year_Max : constant := 2099;
59 -- Some basic constants used throughout
61 function To_Relative_Time (D : Duration) return Time;
63 function To_Relative_Time (D : Duration) return Time is
65 return Time (Long_Integer'Integer_Value (D) / 100);
72 function "+" (Left : Time; Right : Duration) return Time is
73 pragma Unsuppress (Overflow_Check);
75 return (Left + To_Relative_Time (Right));
78 when Constraint_Error =>
82 function "+" (Left : Duration; Right : Time) return Time is
83 pragma Unsuppress (Overflow_Check);
85 return (To_Relative_Time (Left) + Right);
88 when Constraint_Error =>
96 function "-" (Left : Time; Right : Duration) return Time is
97 pragma Unsuppress (Overflow_Check);
99 return Left - To_Relative_Time (Right);
102 when Constraint_Error =>
106 function "-" (Left : Time; Right : Time) return Duration is
107 pragma Unsuppress (Overflow_Check);
109 return Duration'Fixed_Value
110 ((Long_Integer (Left) - Long_Integer (Right)) * 100);
113 when Constraint_Error =>
121 function "<" (Left, Right : Time) return Boolean is
123 return Long_Integer (Left) < Long_Integer (Right);
130 function "<=" (Left, Right : Time) return Boolean is
132 return Long_Integer (Left) <= Long_Integer (Right);
139 function ">" (Left, Right : Time) return Boolean is
141 return Long_Integer (Left) > Long_Integer (Right);
148 function ">=" (Left, Right : Time) return Boolean is
150 return Long_Integer (Left) >= Long_Integer (Right);
157 -- The Ada.Calendar.Clock function gets the time.
158 -- Note that on other targets a soft-link is used to get a different clock
159 -- depending whether tasking is used or not. On VMS this isn't needed
160 -- since all clock calls end up using SYS$GETTIM, so call the
161 -- OS_Primitives version for efficiency.
163 function Clock return Time is
165 return Time (OSP.OS_Clock);
172 function Day (Date : Time) return Day_Number is
179 Split (Date, DY, DM, DD, DS);
187 function Month (Date : Time) return Month_Number is
194 Split (Date, DY, DM, DD, DS);
202 function Seconds (Date : Time) return Day_Duration is
209 Split (Date, DY, DM, DD, DS);
219 Year : out Year_Number;
220 Month : out Month_Number;
221 Day : out Day_Number;
222 Seconds : out Day_Duration)
225 Status : out Unsigned_Longword;
226 Timbuf : out Unsigned_Word_Array;
229 pragma Interface (External, Numtim);
231 pragma Import_Valued_Procedure (Numtim, "SYS$NUMTIM",
232 (Unsigned_Longword, Unsigned_Word_Array, Time),
233 (Value, Reference, Reference));
235 Status : Unsigned_Longword;
236 Timbuf : Unsigned_Word_Array (1 .. 7);
239 Numtim (Status, Timbuf, Date);
242 or else Timbuf (1) not in Ada_Year_Min .. Ada_Year_Max
248 := Day_Duration (Timbuf (6) + 60 * (Timbuf (5) + 60 * Timbuf (4)))
249 + Day_Duration (Timbuf (7)) / 100.0;
250 Day := Integer (Timbuf (3));
251 Month := Integer (Timbuf (2));
252 Year := Integer (Timbuf (1));
261 Month : Month_Number;
263 Seconds : Day_Duration := 0.0)
267 procedure Cvt_Vectim (
268 Status : out Unsigned_Longword;
269 Input_Time : in Unsigned_Word_Array;
270 Resultant_Time : out Time);
272 pragma Interface (External, Cvt_Vectim);
274 pragma Import_Valued_Procedure (Cvt_Vectim, "LIB$CVT_VECTIM",
275 (Unsigned_Longword, Unsigned_Word_Array, Time),
276 (Value, Reference, Reference));
278 Status : Unsigned_Longword;
279 Timbuf : Unsigned_Word_Array (1 .. 7);
282 Day_Hack : Boolean := False;
284 -- The following checks are redundant with respect to the constraint
285 -- error checks that should normally be made on parameters, but we
286 -- decide to raise Constraint_Error in any case if bad values come
287 -- in (as a result of checks being off in the caller, or for other
288 -- erroneous or bounded error cases).
291 or else not Month 'Valid
292 or else not Day 'Valid
293 or else not Seconds'Valid
295 raise Constraint_Error;
298 -- Truncate seconds value by subtracting 0.5 and rounding,
299 -- but be careful with 0.0 since that will give -1.0 unless
300 -- it is treated specially.
302 if Seconds > 0.0 then
303 Int_Secs := Integer (Seconds - 0.5);
305 Int_Secs := Integer (Seconds);
308 -- Cvt_Vectim barfs on the largest Day_Duration, so trick it by
309 -- setting it to zero and then adding the difference after conversion.
311 if Int_Secs = 86_400 then
316 Timbuf (7) := Unsigned_Word
317 (100.0 * Duration (Seconds - Day_Duration (Int_Secs)));
318 -- Cvt_Vectim accurate only to within .01 seconds
321 -- Similar hack needed for 86399 and 100/100ths, since that gets
322 -- treated as 86400 (largest Day_Duration). This can happen because
323 -- Duration has more accuracy than VMS system time conversion calls
326 if Int_Secs = 86_399 and then Timbuf (7) = 100 then
332 Timbuf (6) := Unsigned_Word (Int_Secs mod 60);
333 Timbuf (5) := Unsigned_Word ((Int_Secs / 60) mod 60);
334 Timbuf (4) := Unsigned_Word (Int_Secs / 3600);
335 Timbuf (3) := Unsigned_Word (Day);
336 Timbuf (2) := Unsigned_Word (Month);
337 Timbuf (1) := Unsigned_Word (Year);
339 Cvt_Vectim (Status, Timbuf, Date);
341 if Status mod 2 /= 1 then
346 Date := Date + 10_000_000 * 86_400;
357 function Year (Date : Time) return Year_Number is
364 Split (Date, DY, DM, DD, DS);