/usr/share/ada/adainclude/ahven/ahven-results.adb is in libahven4-dev 2.4+repack-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 | --
-- Copyright (c) 2007-2009 Tero Koskinen <tero.koskinen@iki.fi>
--
-- Permission to use, copy, modify, and distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
--
with Ada.Unchecked_Deallocation;
package body Ahven.Results is
use Ahven.Results.Result_List;
use Ahven.Results.Result_Info_List;
-- Bunch of setters and getters.
-- The implementation is straightforward.
procedure Set_Test_Name (Info : in out Result_Info;
Name : Bounded_String) is
begin
Info.Test_Name := Name;
end Set_Test_Name;
procedure Set_Routine_Name (Info : in out Result_Info;
Name : Bounded_String) is
begin
Info.Routine_Name := Name;
end Set_Routine_Name;
procedure Set_Message (Info : in out Result_Info;
Message : Bounded_String) is
begin
Info.Message := Message;
end Set_Message;
procedure Set_Test_Name (Info : in out Result_Info; Name : String) is
begin
Set_Test_Name (Info, To_Bounded_String (Name));
end Set_Test_Name;
procedure Set_Routine_Name (Info : in out Result_Info; Name : String) is
begin
Set_Routine_Name (Info, To_Bounded_String (Name));
end Set_Routine_Name;
procedure Set_Message (Info : in out Result_Info; Message : String) is
begin
Set_Message (Info, To_Bounded_String (Message));
end Set_Message;
procedure Set_Long_Message (Info : in out Result_Info;
Message : Bounded_String) is
begin
Set_Long_Message (Info, To_String (Message));
end Set_Long_Message;
procedure Set_Long_Message
(Info : in out Result_Info;
Message : Long_AStrings.Bounded_String) is
begin
Info.Long_Message := Message;
end Set_Long_Message;
procedure Set_Long_Message (Info : in out Result_Info; Message : String) is
begin
Set_Long_Message (Info, Long_AStrings.To_Bounded_String (Message));
end Set_Long_Message;
procedure Set_Execution_Time (Info : in out Result_Info;
Elapsed_Time : Duration) is
begin
Info.Execution_Time := Elapsed_Time;
end Set_Execution_Time;
procedure Set_Output_File (Info : in out Result_Info;
Filename : Bounded_String) is
begin
Info.Output_File := Filename;
end Set_Output_File;
procedure Set_Output_File (Info : in out Result_Info;
Filename : String) is
begin
Set_Output_File (Info, To_Bounded_String (Filename));
end Set_Output_File;
function Get_Test_Name (Info : Result_Info) return String is
begin
return To_String (Info.Test_Name);
end Get_Test_Name;
function Get_Routine_Name (Info : Result_Info) return String is
begin
return To_String (Info.Routine_Name);
end Get_Routine_Name;
function Get_Message (Info : Result_Info) return String is
begin
return To_String (Info.Message);
end Get_Message;
function Get_Long_Message (Info : Result_Info) return String is
begin
return Long_AStrings.To_String (Info.Long_Message);
end Get_Long_Message;
function Get_Execution_Time (Info : Result_Info) return Duration is
begin
return Info.Execution_Time;
end Get_Execution_Time;
function Get_Output_File (Info : Result_Info) return Bounded_String is
begin
return Info.Output_File;
end Get_Output_File;
procedure Add_Child (Collection : in out Result_Collection;
Child : Result_Collection_Access) is
begin
Append (Collection.Children, (Ptr => Child));
end Add_Child;
procedure Add_Error (Collection : in out Result_Collection;
Info : Result_Info) is
begin
Append (Collection.Errors, Info);
end Add_Error;
procedure Add_Skipped (Collection : in out Result_Collection;
Info : Result_Info) is
begin
Append (Collection.Skips, Info);
end Add_Skipped;
procedure Add_Failure (Collection : in out Result_Collection;
Info : Result_Info) is
begin
Append (Collection.Failures, Info);
end Add_Failure;
procedure Add_Pass (Collection : in out Result_Collection;
Info : Result_Info) is
begin
Append (Collection.Passes, Info);
end Add_Pass;
-- When Result_Collection is released, it recursively releases
-- its all children.
procedure Release (Collection : in out Result_Collection) is
procedure Free is
new Ada.Unchecked_Deallocation (Object => Result_Collection,
Name => Result_Collection_Access);
Position : Result_List.Cursor := First (Collection.Children);
Ptr : Result_Collection_Access := null;
begin
loop
exit when not Is_Valid (Position);
Ptr := Data (Position).Ptr;
Release (Ptr.all);
Free (Ptr);
Position := Next (Position);
end loop;
Clear (Collection.Children);
-- No need to call Free for these three since
-- they are stored as plain objects instead of pointers.
Clear (Collection.Errors);
Clear (Collection.Failures);
Clear (Collection.Passes);
end Release;
procedure Set_Name (Collection : in out Result_Collection;
Name : Bounded_String) is
begin
Collection.Test_Name := Name;
end Set_Name;
procedure Set_Parent (Collection : in out Result_Collection;
Parent : Result_Collection_Access) is
begin
Collection.Parent := Parent;
end Set_Parent;
function Test_Count (Collection : Result_Collection) return Natural is
Count : Natural := Result_Info_List.Length (Collection.Errors) +
Result_Info_List.Length (Collection.Failures) +
Result_Info_List.Length (Collection.Skips) +
Result_Info_List.Length (Collection.Passes);
Position : Result_List.Cursor := First (Collection.Children);
begin
loop
exit when not Is_Valid (Position);
Count := Count + Test_Count (Data (Position).Ptr.all);
Position := Next (Position);
end loop;
return Count;
end Test_Count;
function Direct_Test_Count (Collection : Result_Collection)
return Natural
is
begin
return Length (Collection.Errors) +
Length (Collection.Failures) +
Length (Collection.Passes);
end Direct_Test_Count;
function Pass_Count (Collection : Result_Collection) return Natural is
Count : Natural := Length (Collection.Passes);
Position : Result_List.Cursor := First (Collection.Children);
begin
loop
exit when not Is_Valid (Position);
Count := Count + Pass_Count (Data (Position).Ptr.all);
Position := Next (Position);
end loop;
return Count;
end Pass_Count;
function Error_Count (Collection : Result_Collection) return Natural is
Count : Natural := Length (Collection.Errors);
Position : Result_List.Cursor := First (Collection.Children);
begin
loop
exit when not Is_Valid (Position);
Count := Count + Error_Count (Data (Position).Ptr.all);
Position := Next (Position);
end loop;
return Count;
end Error_Count;
function Failure_Count (Collection : Result_Collection) return Natural is
Count : Natural := Length (Collection.Failures);
Position : Result_List.Cursor := First (Collection.Children);
begin
loop
exit when not Is_Valid (Position);
Count := Count + Failure_Count (Data (Position).Ptr.all);
Position := Next (Position);
end loop;
return Count;
end Failure_Count;
function Skipped_Count (Collection : Result_Collection) return Natural is
Count : Natural := Length (Collection.Skips);
Position : Result_List.Cursor := First (Collection.Children);
begin
loop
exit when not Is_Valid (Position);
Count := Count + Skipped_Count (Data (Position).Ptr.all);
Position := Next (Position);
end loop;
return Count;
end Skipped_Count;
function Get_Test_Name (Collection : Result_Collection)
return Bounded_String is
begin
return Collection.Test_Name;
end Get_Test_Name;
function Get_Parent (Collection : Result_Collection)
return Result_Collection_Access is
begin
return Collection.Parent;
end Get_Parent;
function Get_Execution_Time (Collection : Result_Collection)
return Duration
is
Position : Result_Info_List.Cursor;
Total_Time : Duration := 0.0;
Child_Position : Result_List.Cursor;
begin
Position := First (Collection.Passes);
Pass_Loop:
loop
exit Pass_Loop when not Is_Valid (Position);
Total_Time := Total_Time + Get_Execution_Time (Data (Position));
Position := Next (Position);
end loop Pass_Loop;
Position := First (Collection.Failures);
Failure_Loop:
loop
exit Failure_Loop when not Is_Valid (Position);
Total_Time := Total_Time + Get_Execution_Time (Data (Position));
Position := Next (Position);
end loop Failure_Loop;
Position := First (Collection.Errors);
Error_Loop:
loop
exit Error_Loop when not Is_Valid (Position);
Total_Time := Total_Time + Get_Execution_Time (Data (Position));
Position := Next (Position);
end loop Error_Loop;
Child_Loop:
loop
exit Child_Loop when not Result_List.Is_Valid (Child_Position);
Total_Time := Total_Time +
Get_Execution_Time
(Result_List.Data (Child_Position).Ptr.all);
Child_Position := Result_List.Next (Child_Position);
end loop Child_Loop;
return Total_Time;
end Get_Execution_Time;
function First_Pass (Collection : Result_Collection)
return Result_Info_Cursor is
begin
return First (Collection.Passes);
end First_Pass;
function First_Failure (Collection : Result_Collection)
return Result_Info_Cursor is
begin
return First (Collection.Failures);
end First_Failure;
function First_Skipped (Collection : Result_Collection)
return Result_Info_Cursor is
begin
return First (Collection.Skips);
end First_Skipped;
function First_Error (Collection : Result_Collection)
return Result_Info_Cursor is
begin
return First (Collection.Errors);
end First_Error;
function Next (Position : Result_Info_Cursor) return Result_Info_Cursor is
begin
return Result_Info_Cursor
(Result_Info_List.Next (Result_Info_List.Cursor (Position)));
end Next;
function Data (Position : Result_Info_Cursor) return Result_Info is
begin
return Result_Info_List.Data (Result_Info_List.Cursor (Position));
end Data;
function Is_Valid (Position : Result_Info_Cursor) return Boolean is
begin
return Result_Info_List.Is_Valid (Result_Info_List.Cursor (Position));
end Is_Valid;
function First_Child (Collection : in Result_Collection)
return Result_Collection_Cursor is
begin
return First (Collection.Children);
end First_Child;
function Next (Position : Result_Collection_Cursor)
return Result_Collection_Cursor is
begin
return Result_Collection_Cursor
(Result_List.Next (Result_List.Cursor (Position)));
end Next;
function Is_Valid (Position : Result_Collection_Cursor) return Boolean is
begin
return Result_List.Is_Valid (Result_List.Cursor (Position));
end Is_Valid;
function Data (Position : Result_Collection_Cursor)
return Result_Collection_Access is
begin
return Result_List.Data (Result_List.Cursor (Position)).Ptr;
end Data;
function Child_Depth (Collection : Result_Collection) return Natural
is
function Child_Depth_Impl (Coll : Result_Collection;
Level : Natural) return Natural;
function Child_Depth_Impl (Coll : Result_Collection;
Level : Natural)
return Natural
is
Max : Natural := 0;
Current : Natural := 0;
Position : Result_List.Cursor := Result_List.First (Coll.Children);
begin
loop
exit when not Is_Valid (Position);
Current := Child_Depth_Impl (Data (Position).Ptr.all, Level + 1);
if Max < Current then
Max := Current;
end if;
Position := Result_List.Next (Position);
end loop;
return Level + Max;
end Child_Depth_Impl;
begin
return Child_Depth_Impl (Collection, 0);
end Child_Depth;
end Ahven.Results;
|