content
stringlengths 23
1.05M
|
|---|
-- SPDX-License-Identifier: MIT
--
-- Copyright (c) 1999 - 2018 Gautier de Montmollin
-- SWITZERLAND
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-- THE SOFTWARE.
with Ada.IO_Exceptions;
with DCF.Unzip.Decompress;
with DCF.Zip.Headers;
package body DCF.Unzip.Streams is
overriding procedure Write
(Stream : in out Stream_Writer;
Item : in Ada.Streams.Stream_Element_Array) is
begin
if Stream.Target /= null then
Stream.Target.all.Set_Index (Stream.Index);
Stream.Target.all.Write (Item);
Stream.Index := Stream.Index + Item'Length;
end if;
end Write;
procedure Unzip_File
(Zip_Stream : in out DCF.Streams.Root_Zipstream_Type'Class;
Header_Index : in DCF.Streams.Zs_Index_Type;
Out_Stream_Ptr : P_Stream;
Hint_Comp_Size : in File_Size_Type; -- Added 2007 for .ODS files
Hint_Crc_32 : in Unsigned_32; -- Added 2012 for decryption
Cat_Uncomp_Size : in File_Size_Type;
Verify_Integrity : in Boolean)
is
Work_Index : DCF.Streams.Zs_Index_Type := Header_Index;
Local_Header : Zip.Headers.Local_File_Header;
Data_Descriptor_After_Data : Boolean;
Encrypted : Boolean;
Method : Pkzip_Method;
use Zip;
begin
begin
DCF.Streams.Set_Index (Zip_Stream, Header_Index);
Zip.Headers.Read_And_Check (Zip_Stream, Local_Header);
exception
when Zip.Headers.Bad_Local_Header =>
raise Zip.Archive_Corrupted with "Bad local header";
when others =>
raise Zip.Archive_Corrupted;
end;
Method := Method_From_Code (Local_Header.Zip_Type);
-- Calculate offset of data
Work_Index :=
Work_Index +
DCF.Streams.Zs_Size_Type
(Local_Header.Filename_Length +
Local_Header.Extra_Field_Length +
Zip.Headers.Local_Header_Length);
Data_Descriptor_After_Data :=
(Local_Header.Bit_Flag and Zip.Headers.Descriptor_Flag_Bit) /= 0;
if Data_Descriptor_After_Data then
-- Sizes and CRC are stored after the data
-- We set size to avoid getting a sudden Zip_EOF !
if Method = Store and then Hint_Comp_Size = File_Size_Type'Last then
-- For Stored (Method 0) data we need a correct "compressed" size.
-- If the hint is the bogus fallback value, it is better to trust
-- the local header, since this size is known in advance. Case found
-- in Microsoft's OneDrive cloud storage (in 2018). Zip files,
-- created by the server for downloading more than one file, are
-- using the "Store" format and a postfixed Data Descriptor for
-- writing the CRC value.
null; -- Do not overwrite the compressed size in that case
else
Local_Header.Dd.Compressed_Size := Hint_Comp_Size;
end if;
Local_Header.Dd.Crc_32 := Hint_Crc_32;
Local_Header.Dd.Uncompressed_Size := Cat_Uncomp_Size;
else
-- Sizes and CRC are before the data
if Cat_Uncomp_Size /= Local_Header.Dd.Uncompressed_Size then
raise Uncompressed_Size_Error;
end if;
end if;
Encrypted := (Local_Header.Bit_Flag and Zip.Headers.Encryption_Flag_Bit) /= 0;
if Encrypted then
raise Constraint_Error with "Encryption is not supported";
end if;
begin
DCF.Streams.Set_Index (Zip_Stream, Work_Index); -- eventually skips the file name
exception
when others =>
raise Zip.Archive_Corrupted with
"End of stream reached (location: between local header and archived data)";
end;
-- Unzip correct type
Unzip.Decompress.Decompress_Data
(Zip_File => Zip_Stream,
Format => Method,
Output_Stream_Access => Out_Stream_Ptr,
Data_Descriptor_After_Data => Data_Descriptor_After_Data,
Hint => Local_Header,
Verify_Integrity => Verify_Integrity);
exception
when Ada.IO_Exceptions.End_Error =>
raise Zip.Archive_Corrupted with "End of stream reached";
end Unzip_File;
procedure Extract
(Destination : in out Ada.Streams.Root_Stream_Type'Class;
Archive_Info : in Zip.Zip_Info; -- Archive's Zip_info
File : in Zip.Archived_File;
Verify_Integrity : in Boolean) is
begin
Unzip_File
(Zip_Stream => Archive_Info.Stream.all,
Header_Index => File.File_Index,
Out_Stream_Ptr => Destination'Unchecked_Access,
Hint_Comp_Size => File.Compressed_Size,
Hint_Crc_32 => File.CRC_32,
Cat_Uncomp_Size => File.Uncompressed_Size,
Verify_Integrity => Verify_Integrity);
end Extract;
end DCF.Unzip.Streams;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.CMOF;
with AMF.Internals.Tables.CMOF_Attributes;
with AMF.Internals.Tables.CMOF_String_Data_00;
with AMF.Internals.Tables.CMOF_String_Data_01;
with AMF.Internals.Tables.CMOF_String_Data_02;
package body AMF.Internals.Tables.CMOF_Metamodel.Properties is
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Initialize_1;
Initialize_2;
Initialize_3;
Initialize_4;
Initialize_5;
Initialize_6;
Initialize_7;
Initialize_8;
Initialize_9;
Initialize_10;
Initialize_11;
Initialize_12;
Initialize_13;
Initialize_14;
Initialize_15;
Initialize_16;
Initialize_17;
Initialize_18;
Initialize_19;
Initialize_20;
Initialize_21;
Initialize_22;
Initialize_23;
Initialize_24;
Initialize_25;
Initialize_26;
Initialize_27;
Initialize_28;
Initialize_29;
Initialize_30;
Initialize_31;
Initialize_32;
Initialize_33;
Initialize_34;
Initialize_35;
Initialize_36;
Initialize_37;
Initialize_38;
Initialize_39;
Initialize_40;
Initialize_41;
Initialize_42;
Initialize_43;
Initialize_44;
Initialize_45;
Initialize_46;
Initialize_47;
Initialize_48;
Initialize_49;
Initialize_50;
Initialize_51;
Initialize_52;
Initialize_53;
Initialize_54;
Initialize_55;
Initialize_56;
Initialize_57;
Initialize_58;
Initialize_59;
Initialize_60;
Initialize_61;
Initialize_62;
Initialize_63;
Initialize_64;
Initialize_65;
Initialize_66;
Initialize_67;
Initialize_68;
Initialize_69;
Initialize_70;
Initialize_71;
Initialize_72;
Initialize_73;
Initialize_74;
Initialize_75;
Initialize_76;
Initialize_77;
Initialize_78;
Initialize_79;
Initialize_80;
Initialize_81;
Initialize_82;
Initialize_83;
Initialize_84;
Initialize_85;
Initialize_86;
Initialize_87;
Initialize_88;
Initialize_89;
Initialize_90;
Initialize_91;
Initialize_92;
Initialize_93;
Initialize_94;
Initialize_95;
Initialize_96;
Initialize_97;
Initialize_98;
Initialize_99;
Initialize_100;
Initialize_101;
Initialize_102;
Initialize_103;
Initialize_104;
Initialize_105;
Initialize_106;
Initialize_107;
Initialize_108;
Initialize_109;
Initialize_110;
Initialize_111;
Initialize_112;
Initialize_113;
Initialize_114;
Initialize_115;
Initialize_116;
Initialize_117;
Initialize_118;
Initialize_119;
Initialize_120;
Initialize_121;
Initialize_122;
Initialize_123;
Initialize_124;
Initialize_125;
Initialize_126;
Initialize_127;
Initialize_128;
Initialize_129;
Initialize_130;
Initialize_131;
Initialize_132;
Initialize_133;
Initialize_134;
Initialize_135;
Initialize_136;
Initialize_137;
Initialize_138;
Initialize_139;
Initialize_140;
Initialize_141;
Initialize_142;
Initialize_143;
Initialize_144;
Initialize_145;
Initialize_146;
Initialize_147;
Initialize_148;
Initialize_149;
Initialize_150;
Initialize_151;
Initialize_152;
Initialize_153;
Initialize_154;
Initialize_155;
Initialize_156;
Initialize_157;
Initialize_158;
Initialize_159;
Initialize_160;
Initialize_161;
Initialize_162;
Initialize_163;
Initialize_164;
Initialize_165;
Initialize_166;
Initialize_167;
Initialize_168;
Initialize_169;
Initialize_170;
Initialize_171;
Initialize_172;
Initialize_173;
Initialize_174;
Initialize_175;
Initialize_176;
Initialize_177;
Initialize_178;
Initialize_179;
Initialize_180;
Initialize_181;
Initialize_182;
Initialize_183;
Initialize_184;
Initialize_185;
Initialize_186;
Initialize_187;
Initialize_188;
Initialize_189;
Initialize_190;
Initialize_191;
Initialize_192;
Initialize_193;
Initialize_194;
Initialize_195;
Initialize_196;
Initialize_197;
Initialize_198;
Initialize_199;
Initialize_200;
Initialize_201;
Initialize_202;
Initialize_203;
Initialize_204;
Initialize_205;
Initialize_206;
Initialize_207;
Initialize_208;
Initialize_209;
Initialize_210;
Initialize_211;
Initialize_212;
Initialize_213;
Initialize_214;
Initialize_215;
Initialize_216;
Initialize_217;
Initialize_218;
Initialize_219;
Initialize_220;
Initialize_221;
Initialize_222;
Initialize_223;
Initialize_224;
Initialize_225;
Initialize_226;
Initialize_227;
Initialize_228;
Initialize_229;
Initialize_230;
Initialize_231;
Initialize_232;
Initialize_233;
Initialize_234;
Initialize_235;
Initialize_236;
Initialize_237;
Initialize_238;
Initialize_239;
Initialize_240;
Initialize_241;
Initialize_242;
Initialize_243;
Initialize_244;
Initialize_245;
Initialize_246;
Initialize_247;
Initialize_248;
Initialize_249;
Initialize_250;
Initialize_251;
Initialize_252;
Initialize_253;
Initialize_254;
Initialize_255;
Initialize_256;
Initialize_257;
Initialize_258;
Initialize_259;
Initialize_260;
Initialize_261;
Initialize_262;
Initialize_263;
Initialize_264;
Initialize_265;
Initialize_266;
Initialize_267;
Initialize_268;
Initialize_269;
Initialize_270;
Initialize_271;
Initialize_272;
Initialize_273;
Initialize_274;
Initialize_275;
Initialize_276;
Initialize_277;
Initialize_278;
Initialize_279;
Initialize_280;
Initialize_281;
Initialize_282;
Initialize_283;
Initialize_284;
Initialize_285;
Initialize_286;
Initialize_287;
Initialize_288;
Initialize_289;
Initialize_290;
Initialize_291;
Initialize_292;
Initialize_293;
Initialize_294;
Initialize_295;
Initialize_296;
Initialize_297;
Initialize_298;
Initialize_299;
Initialize_300;
Initialize_301;
Initialize_302;
Initialize_303;
Initialize_304;
Initialize_305;
Initialize_306;
Initialize_307;
Initialize_308;
Initialize_309;
Initialize_310;
Initialize_311;
Initialize_312;
Initialize_313;
Initialize_314;
Initialize_315;
Initialize_316;
Initialize_317;
Initialize_318;
Initialize_319;
Initialize_320;
Initialize_321;
Initialize_322;
Initialize_323;
Initialize_324;
Initialize_325;
Initialize_326;
Initialize_327;
Initialize_328;
Initialize_329;
Initialize_330;
Initialize_331;
Initialize_332;
Initialize_333;
Initialize_334;
Initialize_335;
Initialize_336;
Initialize_337;
Initialize_338;
Initialize_339;
Initialize_340;
Initialize_341;
Initialize_342;
Initialize_343;
Initialize_344;
Initialize_345;
Initialize_346;
Initialize_347;
Initialize_348;
Initialize_349;
Initialize_350;
Initialize_351;
Initialize_352;
Initialize_353;
Initialize_354;
Initialize_355;
Initialize_356;
Initialize_357;
Initialize_358;
Initialize_359;
Initialize_360;
Initialize_361;
Initialize_362;
Initialize_363;
Initialize_364;
Initialize_365;
Initialize_366;
Initialize_367;
Initialize_368;
Initialize_369;
Initialize_370;
Initialize_371;
Initialize_372;
Initialize_373;
Initialize_374;
Initialize_375;
Initialize_376;
Initialize_377;
Initialize_378;
Initialize_379;
Initialize_380;
Initialize_381;
Initialize_382;
Initialize_383;
Initialize_384;
Initialize_385;
Initialize_386;
Initialize_387;
Initialize_388;
Initialize_389;
Initialize_390;
Initialize_391;
Initialize_392;
Initialize_393;
Initialize_394;
Initialize_395;
Initialize_396;
Initialize_397;
Initialize_398;
Initialize_399;
Initialize_400;
Initialize_401;
Initialize_402;
Initialize_403;
Initialize_404;
Initialize_405;
Initialize_406;
Initialize_407;
Initialize_408;
Initialize_409;
Initialize_410;
Initialize_411;
Initialize_412;
Initialize_413;
Initialize_414;
Initialize_415;
Initialize_416;
Initialize_417;
Initialize_418;
Initialize_419;
Initialize_420;
Initialize_421;
Initialize_422;
Initialize_423;
Initialize_424;
Initialize_425;
Initialize_426;
Initialize_427;
Initialize_428;
Initialize_429;
Initialize_430;
Initialize_431;
Initialize_432;
Initialize_433;
Initialize_434;
Initialize_435;
Initialize_436;
Initialize_437;
Initialize_438;
Initialize_439;
Initialize_440;
Initialize_441;
Initialize_442;
Initialize_443;
Initialize_444;
Initialize_445;
Initialize_446;
Initialize_447;
Initialize_448;
Initialize_449;
Initialize_450;
Initialize_451;
Initialize_452;
Initialize_453;
Initialize_454;
Initialize_455;
Initialize_456;
Initialize_457;
Initialize_458;
Initialize_459;
Initialize_460;
Initialize_461;
Initialize_462;
Initialize_463;
Initialize_464;
Initialize_465;
Initialize_466;
Initialize_467;
Initialize_468;
Initialize_469;
Initialize_470;
Initialize_471;
Initialize_472;
Initialize_473;
Initialize_474;
Initialize_475;
Initialize_476;
Initialize_477;
Initialize_478;
Initialize_479;
Initialize_480;
Initialize_481;
Initialize_482;
Initialize_483;
Initialize_484;
Initialize_485;
Initialize_486;
Initialize_487;
Initialize_488;
Initialize_489;
Initialize_490;
Initialize_491;
Initialize_492;
Initialize_493;
Initialize_494;
Initialize_495;
Initialize_496;
Initialize_497;
Initialize_498;
Initialize_499;
Initialize_500;
Initialize_501;
Initialize_502;
Initialize_503;
Initialize_504;
Initialize_505;
Initialize_506;
Initialize_507;
Initialize_508;
Initialize_509;
Initialize_510;
Initialize_511;
Initialize_512;
Initialize_513;
Initialize_514;
Initialize_515;
Initialize_516;
Initialize_517;
Initialize_518;
Initialize_519;
Initialize_520;
Initialize_521;
Initialize_522;
Initialize_523;
Initialize_524;
Initialize_525;
Initialize_526;
Initialize_527;
Initialize_528;
Initialize_529;
Initialize_530;
Initialize_531;
Initialize_532;
Initialize_533;
Initialize_534;
Initialize_535;
Initialize_536;
Initialize_537;
Initialize_538;
Initialize_539;
Initialize_540;
Initialize_541;
Initialize_542;
Initialize_543;
Initialize_544;
Initialize_545;
Initialize_546;
Initialize_547;
Initialize_548;
Initialize_549;
Initialize_550;
Initialize_551;
Initialize_552;
Initialize_553;
Initialize_554;
Initialize_555;
Initialize_556;
Initialize_557;
Initialize_558;
Initialize_559;
Initialize_560;
Initialize_561;
Initialize_562;
Initialize_563;
Initialize_564;
Initialize_565;
Initialize_566;
Initialize_567;
Initialize_568;
Initialize_569;
Initialize_570;
Initialize_571;
Initialize_572;
Initialize_573;
Initialize_574;
Initialize_575;
Initialize_576;
Initialize_577;
Initialize_578;
Initialize_579;
Initialize_580;
Initialize_581;
Initialize_582;
Initialize_583;
Initialize_584;
Initialize_585;
Initialize_586;
Initialize_587;
Initialize_588;
Initialize_589;
Initialize_590;
Initialize_591;
Initialize_592;
Initialize_593;
Initialize_594;
Initialize_595;
Initialize_596;
Initialize_597;
Initialize_598;
Initialize_599;
Initialize_600;
Initialize_601;
Initialize_602;
Initialize_603;
Initialize_604;
Initialize_605;
Initialize_606;
Initialize_607;
Initialize_608;
Initialize_609;
Initialize_610;
Initialize_611;
Initialize_612;
Initialize_613;
Initialize_614;
Initialize_615;
Initialize_616;
Initialize_617;
Initialize_618;
Initialize_619;
Initialize_620;
Initialize_621;
Initialize_622;
Initialize_623;
Initialize_624;
Initialize_625;
Initialize_626;
Initialize_627;
Initialize_628;
Initialize_629;
Initialize_630;
Initialize_631;
Initialize_632;
Initialize_633;
Initialize_634;
Initialize_635;
Initialize_636;
Initialize_637;
Initialize_638;
Initialize_639;
Initialize_640;
Initialize_641;
Initialize_642;
Initialize_643;
Initialize_644;
Initialize_645;
Initialize_646;
Initialize_647;
Initialize_648;
Initialize_649;
Initialize_650;
Initialize_651;
Initialize_652;
Initialize_653;
Initialize_654;
Initialize_655;
Initialize_656;
Initialize_657;
Initialize_658;
Initialize_659;
Initialize_660;
Initialize_661;
Initialize_662;
Initialize_663;
Initialize_664;
Initialize_665;
Initialize_666;
Initialize_667;
Initialize_668;
Initialize_669;
Initialize_670;
Initialize_671;
Initialize_672;
Initialize_673;
Initialize_674;
Initialize_675;
Initialize_676;
Initialize_677;
Initialize_678;
Initialize_679;
Initialize_680;
Initialize_681;
Initialize_682;
Initialize_683;
Initialize_684;
Initialize_685;
Initialize_686;
Initialize_687;
Initialize_688;
Initialize_689;
Initialize_690;
Initialize_691;
Initialize_692;
Initialize_693;
Initialize_694;
Initialize_695;
Initialize_696;
Initialize_697;
Initialize_698;
Initialize_699;
Initialize_700;
Initialize_701;
Initialize_702;
Initialize_703;
Initialize_704;
Initialize_705;
Initialize_706;
Initialize_707;
Initialize_708;
Initialize_709;
Initialize_710;
Initialize_711;
Initialize_712;
Initialize_713;
Initialize_714;
Initialize_715;
Initialize_716;
Initialize_717;
Initialize_718;
Initialize_719;
Initialize_720;
Initialize_721;
Initialize_722;
Initialize_723;
Initialize_724;
Initialize_725;
Initialize_726;
Initialize_727;
Initialize_728;
Initialize_729;
Initialize_730;
Initialize_731;
Initialize_732;
Initialize_733;
Initialize_734;
Initialize_735;
Initialize_736;
Initialize_737;
Initialize_738;
Initialize_739;
Initialize_740;
Initialize_741;
Initialize_742;
Initialize_743;
Initialize_744;
Initialize_745;
Initialize_746;
Initialize_747;
Initialize_748;
Initialize_749;
Initialize_750;
Initialize_751;
Initialize_752;
Initialize_753;
Initialize_754;
Initialize_755;
Initialize_756;
Initialize_757;
Initialize_758;
Initialize_759;
Initialize_760;
Initialize_761;
Initialize_762;
Initialize_763;
Initialize_764;
Initialize_765;
Initialize_766;
Initialize_767;
Initialize_768;
Initialize_769;
Initialize_770;
Initialize_771;
Initialize_772;
Initialize_773;
Initialize_774;
Initialize_775;
Initialize_776;
Initialize_777;
Initialize_778;
Initialize_779;
Initialize_780;
Initialize_781;
Initialize_782;
Initialize_783;
Initialize_784;
Initialize_785;
Initialize_786;
Initialize_787;
Initialize_788;
Initialize_789;
Initialize_790;
Initialize_791;
Initialize_792;
Initialize_793;
Initialize_794;
Initialize_795;
Initialize_796;
Initialize_797;
Initialize_798;
Initialize_799;
Initialize_800;
end Initialize;
------------------
-- Initialize_1 --
------------------
procedure Initialize_1 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 1,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0068'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 1, (Is_Empty => True));
end Initialize_1;
------------------
-- Initialize_2 --
------------------
procedure Initialize_2 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 2, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 2,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0022'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 2, (Is_Empty => True));
end Initialize_2;
------------------
-- Initialize_3 --
------------------
procedure Initialize_3 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 3,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 3, (Is_Empty => True));
end Initialize_3;
------------------
-- Initialize_4 --
------------------
procedure Initialize_4 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 4, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 4,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0137'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 4, (Is_Empty => True));
end Initialize_4;
------------------
-- Initialize_5 --
------------------
procedure Initialize_5 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 5,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 5, (Is_Empty => True));
end Initialize_5;
------------------
-- Initialize_6 --
------------------
procedure Initialize_6 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 6,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 6, (Is_Empty => True));
end Initialize_6;
------------------
-- Initialize_7 --
------------------
procedure Initialize_7 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 7,
AMF.Internals.Tables.CMOF_String_Data_01.MS_012E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 7, (Is_Empty => True));
end Initialize_7;
------------------
-- Initialize_8 --
------------------
procedure Initialize_8 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 8, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 8,
AMF.Internals.Tables.CMOF_String_Data_01.MS_012C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 8, (Is_Empty => True));
end Initialize_8;
------------------
-- Initialize_9 --
------------------
procedure Initialize_9 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 9, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 9,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 9, (Is_Empty => True));
end Initialize_9;
-------------------
-- Initialize_10 --
-------------------
procedure Initialize_10 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 10,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01FE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 10, (Is_Empty => True));
end Initialize_10;
-------------------
-- Initialize_11 --
-------------------
procedure Initialize_11 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 11,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0020'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 11, (Is_Empty => True));
end Initialize_11;
-------------------
-- Initialize_12 --
-------------------
procedure Initialize_12 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 12,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0062'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 12, (Is_Empty => True));
end Initialize_12;
-------------------
-- Initialize_13 --
-------------------
procedure Initialize_13 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 13,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0198'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 13, (Is_Empty => True));
end Initialize_13;
-------------------
-- Initialize_14 --
-------------------
procedure Initialize_14 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 14, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 14,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 14, (Is_Empty => True));
end Initialize_14;
-------------------
-- Initialize_15 --
-------------------
procedure Initialize_15 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 15, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 15,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0152'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 15, (Is_Empty => True));
end Initialize_15;
-------------------
-- Initialize_16 --
-------------------
procedure Initialize_16 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 16, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 16,
AMF.Internals.Tables.CMOF_String_Data_01.MS_015B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 16, (Is_Empty => True));
end Initialize_16;
-------------------
-- Initialize_17 --
-------------------
procedure Initialize_17 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 17, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 17,
AMF.Internals.Tables.CMOF_String_Data_01.MS_018A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 17, (Is_Empty => True));
end Initialize_17;
-------------------
-- Initialize_18 --
-------------------
procedure Initialize_18 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 18,
AMF.Internals.Tables.CMOF_String_Data_01.MS_019C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 18, (Is_Empty => True));
end Initialize_18;
-------------------
-- Initialize_19 --
-------------------
procedure Initialize_19 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 19,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0074'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 19, (Is_Empty => True));
end Initialize_19;
-------------------
-- Initialize_20 --
-------------------
procedure Initialize_20 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 20,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01AA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 20, (Is_Empty => True));
end Initialize_20;
-------------------
-- Initialize_21 --
-------------------
procedure Initialize_21 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 21,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0051'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 21, (Is_Empty => True));
end Initialize_21;
-------------------
-- Initialize_22 --
-------------------
procedure Initialize_22 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 22,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01DC'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 22, (Is_Empty => True));
end Initialize_22;
-------------------
-- Initialize_23 --
-------------------
procedure Initialize_23 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 23, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 23,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0135'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 23, (Is_Empty => True));
end Initialize_23;
-------------------
-- Initialize_24 --
-------------------
procedure Initialize_24 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 24,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 24, (Is_Empty => True));
end Initialize_24;
-------------------
-- Initialize_25 --
-------------------
procedure Initialize_25 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 25,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0179'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 25, (Is_Empty => True));
end Initialize_25;
-------------------
-- Initialize_26 --
-------------------
procedure Initialize_26 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 26,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0076'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 26, (Is_Empty => True));
end Initialize_26;
-------------------
-- Initialize_27 --
-------------------
procedure Initialize_27 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 27, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 27,
AMF.Internals.Tables.CMOF_String_Data_01.MS_018B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 27, (Is_Empty => True));
end Initialize_27;
-------------------
-- Initialize_28 --
-------------------
procedure Initialize_28 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 28, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 28,
AMF.Internals.Tables.CMOF_String_Data_00.MS_002B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 28, (Is_Empty => True));
end Initialize_28;
-------------------
-- Initialize_29 --
-------------------
procedure Initialize_29 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 29, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 29,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0185'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 29, (Is_Empty => True));
end Initialize_29;
-------------------
-- Initialize_30 --
-------------------
procedure Initialize_30 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 30,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 30, (Is_Empty => True));
end Initialize_30;
-------------------
-- Initialize_31 --
-------------------
procedure Initialize_31 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 31, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 31,
AMF.Internals.Tables.CMOF_String_Data_00.MS_004B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 31, (Is_Empty => True));
end Initialize_31;
-------------------
-- Initialize_32 --
-------------------
procedure Initialize_32 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 32, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 32,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0158'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 32, (Is_Empty => True));
end Initialize_32;
-------------------
-- Initialize_33 --
-------------------
procedure Initialize_33 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 33, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 33,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 33, (Is_Empty => True));
end Initialize_33;
-------------------
-- Initialize_34 --
-------------------
procedure Initialize_34 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 34, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 34, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 34,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 34, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 34, (Is_Empty => True));
end Initialize_34;
-------------------
-- Initialize_35 --
-------------------
procedure Initialize_35 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 35, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 35, (False, 2));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 35,
AMF.Internals.Tables.CMOF_String_Data_00.MS_006B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 35, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 35, (Is_Empty => True));
end Initialize_35;
-------------------
-- Initialize_36 --
-------------------
procedure Initialize_36 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 36, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 36,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0056'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 36, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 36, (Is_Empty => True));
end Initialize_36;
-------------------
-- Initialize_37 --
-------------------
procedure Initialize_37 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 37, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 37, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 37, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 37,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0172'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 37, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 37, (Is_Empty => True));
end Initialize_37;
-------------------
-- Initialize_38 --
-------------------
procedure Initialize_38 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 38, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 38, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 38, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 38,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 38, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 38, (Is_Empty => True));
end Initialize_38;
-------------------
-- Initialize_39 --
-------------------
procedure Initialize_39 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 39, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 39,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 39, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 39, (Is_Empty => True));
end Initialize_39;
-------------------
-- Initialize_40 --
-------------------
procedure Initialize_40 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 40, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 40, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 40, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 40,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0052'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 40, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 40, (Is_Empty => True));
end Initialize_40;
-------------------
-- Initialize_41 --
-------------------
procedure Initialize_41 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 41, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 41, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 41, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 41,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 41, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 41, (Is_Empty => True));
end Initialize_41;
-------------------
-- Initialize_42 --
-------------------
procedure Initialize_42 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 42, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 42,
AMF.Internals.Tables.CMOF_String_Data_01.MS_017A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 42, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 42, (Is_Empty => True));
end Initialize_42;
-------------------
-- Initialize_43 --
-------------------
procedure Initialize_43 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 43, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 43, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 43, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 43, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 43,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0138'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 43, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 43, (Is_Empty => True));
end Initialize_43;
-------------------
-- Initialize_44 --
-------------------
procedure Initialize_44 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 44, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 44, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 44, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 44, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 44,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 44, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 44, (Is_Empty => True));
end Initialize_44;
-------------------
-- Initialize_45 --
-------------------
procedure Initialize_45 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 45, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 45,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0095'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 45, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 45, (Is_Empty => True));
end Initialize_45;
-------------------
-- Initialize_46 --
-------------------
procedure Initialize_46 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 46, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 46, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 46, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 46,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 46, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 46, (Is_Empty => True));
end Initialize_46;
-------------------
-- Initialize_47 --
-------------------
procedure Initialize_47 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 47, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 47,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0170'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 47, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 47, (Is_Empty => True));
end Initialize_47;
-------------------
-- Initialize_48 --
-------------------
procedure Initialize_48 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 48, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 48, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 48,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00FC'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 48, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 48, (Is_Empty => True));
end Initialize_48;
-------------------
-- Initialize_49 --
-------------------
procedure Initialize_49 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 49, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 49, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 49, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 49,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0052'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 49, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 49, (Is_Empty => True));
end Initialize_49;
-------------------
-- Initialize_50 --
-------------------
procedure Initialize_50 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 50, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 50, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 50, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 50,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 50, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 50, (Is_Empty => True));
end Initialize_50;
-------------------
-- Initialize_51 --
-------------------
procedure Initialize_51 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 51, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 51, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 51, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 51,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01AF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 51, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 51, (Is_Empty => True));
end Initialize_51;
-------------------
-- Initialize_52 --
-------------------
procedure Initialize_52 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 52, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 52, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 52, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 52,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 52, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 52, (Is_Empty => True));
end Initialize_52;
-------------------
-- Initialize_53 --
-------------------
procedure Initialize_53 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 53, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 53, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 53,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 53, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 53, (Is_Empty => True));
end Initialize_53;
-------------------
-- Initialize_54 --
-------------------
procedure Initialize_54 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 54, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 54, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 54, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 54, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 54, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 54,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 54, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 54, (Is_Empty => True));
end Initialize_54;
-------------------
-- Initialize_55 --
-------------------
procedure Initialize_55 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 55, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 55, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 55, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 55,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 55, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 55, (Is_Empty => True));
end Initialize_55;
-------------------
-- Initialize_56 --
-------------------
procedure Initialize_56 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 56, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 56, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 56, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 56,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0194'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 56, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 56, (Is_Empty => True));
end Initialize_56;
-------------------
-- Initialize_57 --
-------------------
procedure Initialize_57 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 57, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 57, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 57, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 57, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 57,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01BA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 57, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 57, (Is_Empty => True));
end Initialize_57;
-------------------
-- Initialize_58 --
-------------------
procedure Initialize_58 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 58, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 58, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 58,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 58, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 58, (Is_Empty => True));
end Initialize_58;
-------------------
-- Initialize_59 --
-------------------
procedure Initialize_59 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 59, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 59, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 59, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 59,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 59, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 59, (Is_Empty => True));
end Initialize_59;
-------------------
-- Initialize_60 --
-------------------
procedure Initialize_60 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 60, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 60, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 60, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 60, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 60,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 60, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 60, (Is_Empty => True));
end Initialize_60;
-------------------
-- Initialize_61 --
-------------------
procedure Initialize_61 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 61, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 61, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 61, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 61, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 61, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 61,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0148'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 61, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 61, (Is_Empty => True));
end Initialize_61;
-------------------
-- Initialize_62 --
-------------------
procedure Initialize_62 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 62, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 62, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 62,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0147'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 62, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 62, (Is_Empty => True));
end Initialize_62;
-------------------
-- Initialize_63 --
-------------------
procedure Initialize_63 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 63, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 63, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 63,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0169'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 63, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 63, (Is_Empty => True));
end Initialize_63;
-------------------
-- Initialize_64 --
-------------------
procedure Initialize_64 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 64, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 64, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 64, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 64,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 64, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 64, (Is_Empty => True));
end Initialize_64;
-------------------
-- Initialize_65 --
-------------------
procedure Initialize_65 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 65, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 65, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 65,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01FA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 65, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 65, (Is_Empty => True));
end Initialize_65;
-------------------
-- Initialize_66 --
-------------------
procedure Initialize_66 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 66, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 66, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 66,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 66, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 66, (Is_Empty => True));
end Initialize_66;
-------------------
-- Initialize_67 --
-------------------
procedure Initialize_67 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 67, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 67,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 67, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 67, (Is_Empty => True));
end Initialize_67;
-------------------
-- Initialize_68 --
-------------------
procedure Initialize_68 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 68, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 68,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01AD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 68, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 68, (Is_Empty => True));
end Initialize_68;
-------------------
-- Initialize_69 --
-------------------
procedure Initialize_69 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 69, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 69, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 69, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 69,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0163'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 69, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 69, (Is_Empty => True));
end Initialize_69;
-------------------
-- Initialize_70 --
-------------------
procedure Initialize_70 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 70, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 70, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 70, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 70,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0041'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 70, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 70, (Is_Empty => True));
end Initialize_70;
-------------------
-- Initialize_71 --
-------------------
procedure Initialize_71 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 71, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 71, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 71,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 71, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 71, (Is_Empty => True));
end Initialize_71;
-------------------
-- Initialize_72 --
-------------------
procedure Initialize_72 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 72, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 72, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 72,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 72, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 72, (Is_Empty => True));
end Initialize_72;
-------------------
-- Initialize_73 --
-------------------
procedure Initialize_73 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 73, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 73,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0164'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 73, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 73, (Is_Empty => True));
end Initialize_73;
-------------------
-- Initialize_74 --
-------------------
procedure Initialize_74 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 74, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 74,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 74, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 74, (Is_Empty => True));
end Initialize_74;
-------------------
-- Initialize_75 --
-------------------
procedure Initialize_75 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 75, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 75, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 75, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 75, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 75,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01DE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 75, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 75, (Is_Empty => True));
end Initialize_75;
-------------------
-- Initialize_76 --
-------------------
procedure Initialize_76 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 76, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 76, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 76, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 76, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 76,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 76, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 76, (Is_Empty => True));
end Initialize_76;
-------------------
-- Initialize_77 --
-------------------
procedure Initialize_77 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 77, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 77, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 77, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 77,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0048'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 77, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 77, (Is_Empty => True));
end Initialize_77;
-------------------
-- Initialize_78 --
-------------------
procedure Initialize_78 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 78, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 78,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0104'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 78, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 78, (Is_Empty => True));
end Initialize_78;
-------------------
-- Initialize_79 --
-------------------
procedure Initialize_79 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 79,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 79,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 79, (Is_Empty => True));
end Initialize_79;
-------------------
-- Initialize_80 --
-------------------
procedure Initialize_80 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 80,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 80,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 80, (Is_Empty => True));
end Initialize_80;
-------------------
-- Initialize_81 --
-------------------
procedure Initialize_81 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 81,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 81,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 81, (Is_Empty => True));
end Initialize_81;
-------------------
-- Initialize_82 --
-------------------
procedure Initialize_82 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 82, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 82,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0142'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 82, (Is_Empty => True));
end Initialize_82;
-------------------
-- Initialize_83 --
-------------------
procedure Initialize_83 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 83, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 83,
AMF.Internals.Tables.CMOF_String_Data_00.MS_006D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 83, (Is_Empty => True));
end Initialize_83;
-------------------
-- Initialize_84 --
-------------------
procedure Initialize_84 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 84, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 84,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00FB'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 84, (Is_Empty => True));
end Initialize_84;
-------------------
-- Initialize_85 --
-------------------
procedure Initialize_85 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 85, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 85, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 85, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 85, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 85,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0154'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 85, (Is_Empty => True));
end Initialize_85;
-------------------
-- Initialize_86 --
-------------------
procedure Initialize_86 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 86, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 86,
AMF.Internals.Tables.CMOF_String_Data_01.MS_012B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 86, (Is_Empty => True));
end Initialize_86;
-------------------
-- Initialize_87 --
-------------------
procedure Initialize_87 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 87,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00FE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 87, (Is_Empty => True));
end Initialize_87;
-------------------
-- Initialize_88 --
-------------------
procedure Initialize_88 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 88,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00FD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 88, (Is_Empty => True));
end Initialize_88;
-------------------
-- Initialize_89 --
-------------------
procedure Initialize_89 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 89,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 89,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 89, (Is_Empty => True));
end Initialize_89;
-------------------
-- Initialize_90 --
-------------------
procedure Initialize_90 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 90, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 90,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00DE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 90, (Is_Empty => True));
end Initialize_90;
-------------------
-- Initialize_91 --
-------------------
procedure Initialize_91 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 91,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 91,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0113'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 91, (Is_Empty => True));
end Initialize_91;
-------------------
-- Initialize_92 --
-------------------
procedure Initialize_92 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 92,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 92,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0178'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 92, (Is_Empty => True));
end Initialize_92;
-------------------
-- Initialize_93 --
-------------------
procedure Initialize_93 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 93,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0159'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 93, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 93,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 93, (Is_Empty => True));
end Initialize_93;
-------------------
-- Initialize_94 --
-------------------
procedure Initialize_94 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 94,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0159'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 94, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 94,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 94, (Is_Empty => True));
end Initialize_94;
-------------------
-- Initialize_95 --
-------------------
procedure Initialize_95 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 95, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 95,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 95, (Is_Empty => True));
end Initialize_95;
-------------------
-- Initialize_96 --
-------------------
procedure Initialize_96 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 96, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived_Union (Base + 96, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 96, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 96, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 96,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 96, (Is_Empty => True));
end Initialize_96;
-------------------
-- Initialize_97 --
-------------------
procedure Initialize_97 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 97, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Read_Only (Base + 97, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 97, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 97,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0000'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 97, (Is_Empty => True));
end Initialize_97;
-------------------
-- Initialize_98 --
-------------------
procedure Initialize_98 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 98, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 98,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 98, (Is_Empty => True));
end Initialize_98;
-------------------
-- Initialize_99 --
-------------------
procedure Initialize_99 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 99, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 99, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Unique (Base + 99, False);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 99, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 99,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0142'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 99, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 99, (Is_Empty => True));
end Initialize_99;
--------------------
-- Initialize_100 --
--------------------
procedure Initialize_100 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 100, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 100, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 100, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 100,
AMF.Internals.Tables.CMOF_String_Data_01.MS_019E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 100, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 100, (Is_Empty => True));
end Initialize_100;
--------------------
-- Initialize_101 --
--------------------
procedure Initialize_101 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 101, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 101, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 101,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0077'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 101, (Is_Empty => True));
end Initialize_101;
--------------------
-- Initialize_102 --
--------------------
procedure Initialize_102 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 102, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 102,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0029'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 102, (Is_Empty => True));
end Initialize_102;
--------------------
-- Initialize_103 --
--------------------
procedure Initialize_103 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 103, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 103,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 103, (Is_Empty => True));
end Initialize_103;
--------------------
-- Initialize_104 --
--------------------
procedure Initialize_104 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 104,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 104, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 104,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0113'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 104, (Is_Empty => True));
end Initialize_104;
--------------------
-- Initialize_105 --
--------------------
procedure Initialize_105 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 105,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 105,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0021'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 105, (Is_Empty => True));
end Initialize_105;
--------------------
-- Initialize_106 --
--------------------
procedure Initialize_106 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 106,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 106, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 106,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0178'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 106, (Is_Empty => True));
end Initialize_106;
--------------------
-- Initialize_107 --
--------------------
procedure Initialize_107 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 107,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0159'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 107, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 107, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 107,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 107, (Is_Empty => True));
end Initialize_107;
--------------------
-- Initialize_108 --
--------------------
procedure Initialize_108 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 108, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 108, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 108,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0196'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 108, (Is_Empty => True));
end Initialize_108;
--------------------
-- Initialize_109 --
--------------------
procedure Initialize_109 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 109,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0159'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 109, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 109, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 109,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 109, (Is_Empty => True));
end Initialize_109;
--------------------
-- Initialize_110 --
--------------------
procedure Initialize_110 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 110, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 110,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 110, (Is_Empty => True));
end Initialize_110;
--------------------
-- Initialize_111 --
--------------------
procedure Initialize_111 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 111, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 111,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 111, (Is_Empty => True));
end Initialize_111;
--------------------
-- Initialize_112 --
--------------------
procedure Initialize_112 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 112,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0049'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 112, (Is_Empty => True));
end Initialize_112;
--------------------
-- Initialize_113 --
--------------------
procedure Initialize_113 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 113,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00FD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 113, (Is_Empty => True));
end Initialize_113;
--------------------
-- Initialize_114 --
--------------------
procedure Initialize_114 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 114,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 114,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 114, (Is_Empty => True));
end Initialize_114;
--------------------
-- Initialize_115 --
--------------------
procedure Initialize_115 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 115,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 115, (Is_Empty => True));
end Initialize_115;
--------------------
-- Initialize_116 --
--------------------
procedure Initialize_116 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 116,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0117'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 116, (Is_Empty => True));
end Initialize_116;
--------------------
-- Initialize_117 --
--------------------
procedure Initialize_117 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 117, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 117,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 117, (Is_Empty => True));
end Initialize_117;
--------------------
-- Initialize_118 --
--------------------
procedure Initialize_118 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 118,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 118,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 118, (Is_Empty => True));
end Initialize_118;
--------------------
-- Initialize_119 --
--------------------
procedure Initialize_119 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 119, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 119,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0054'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 119, (Is_Empty => True));
end Initialize_119;
--------------------
-- Initialize_120 --
--------------------
procedure Initialize_120 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 120, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 120,
AMF.Internals.Tables.CMOF_String_Data_02.MS_0200'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 120, (Is_Empty => True));
end Initialize_120;
--------------------
-- Initialize_121 --
--------------------
procedure Initialize_121 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 121, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 121,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0029'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 121, (Is_Empty => True));
end Initialize_121;
--------------------
-- Initialize_122 --
--------------------
procedure Initialize_122 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 122, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 122,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 122, (Is_Empty => True));
end Initialize_122;
--------------------
-- Initialize_123 --
--------------------
procedure Initialize_123 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 123, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 123,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 123, (Is_Empty => True));
end Initialize_123;
--------------------
-- Initialize_124 --
--------------------
procedure Initialize_124 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 124,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 124,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0111'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 124, (Is_Empty => True));
end Initialize_124;
--------------------
-- Initialize_125 --
--------------------
procedure Initialize_125 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 125,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 125,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 125, (Is_Empty => True));
end Initialize_125;
--------------------
-- Initialize_126 --
--------------------
procedure Initialize_126 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 126,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 126,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0105'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 126, (Is_Empty => True));
end Initialize_126;
--------------------
-- Initialize_127 --
--------------------
procedure Initialize_127 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 127,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 127,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0060'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 127, (Is_Empty => True));
end Initialize_127;
--------------------
-- Initialize_128 --
--------------------
procedure Initialize_128 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Derived (Base + 128, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 128, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 128,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 128, (Is_Empty => True));
end Initialize_128;
--------------------
-- Initialize_129 --
--------------------
procedure Initialize_129 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 129, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 129,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0174'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 129, (Is_Empty => True));
end Initialize_129;
--------------------
-- Initialize_130 --
--------------------
procedure Initialize_130 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 130,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 130,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 130, (Is_Empty => True));
end Initialize_130;
--------------------
-- Initialize_131 --
--------------------
procedure Initialize_131 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 131,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 131, (Is_Empty => True));
end Initialize_131;
--------------------
-- Initialize_132 --
--------------------
procedure Initialize_132 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 132, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 132,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0050'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 132, (Is_Empty => True));
end Initialize_132;
--------------------
-- Initialize_133 --
--------------------
procedure Initialize_133 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 133,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0150'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 133, (Is_Empty => True));
end Initialize_133;
--------------------
-- Initialize_134 --
--------------------
procedure Initialize_134 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 134, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 134,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 134, (Is_Empty => True));
end Initialize_134;
--------------------
-- Initialize_135 --
--------------------
procedure Initialize_135 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 135, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 135,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0196'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 135, (Is_Empty => True));
end Initialize_135;
--------------------
-- Initialize_136 --
--------------------
procedure Initialize_136 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 136,
AMF.Internals.Tables.CMOF_String_Data_01.MS_017F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 136, (Is_Empty => True));
end Initialize_136;
--------------------
-- Initialize_137 --
--------------------
procedure Initialize_137 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 137,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 137, (Is_Empty => True));
end Initialize_137;
--------------------
-- Initialize_138 --
--------------------
procedure Initialize_138 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 138,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 138, (Is_Empty => True));
end Initialize_138;
--------------------
-- Initialize_139 --
--------------------
procedure Initialize_139 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 139,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0197'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 139, (Is_Empty => True));
end Initialize_139;
--------------------
-- Initialize_140 --
--------------------
procedure Initialize_140 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 140,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00CE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 140, (Is_Empty => True));
end Initialize_140;
--------------------
-- Initialize_141 --
--------------------
procedure Initialize_141 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 141,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 141, (Is_Empty => True));
end Initialize_141;
--------------------
-- Initialize_142 --
--------------------
procedure Initialize_142 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 142,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0059'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 142, (Is_Empty => True));
end Initialize_142;
--------------------
-- Initialize_143 --
--------------------
procedure Initialize_143 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 143,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0072'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 143, (Is_Empty => True));
end Initialize_143;
--------------------
-- Initialize_144 --
--------------------
procedure Initialize_144 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 144,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 144, (Is_Empty => True));
end Initialize_144;
--------------------
-- Initialize_145 --
--------------------
procedure Initialize_145 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 145,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 145, (Is_Empty => True));
end Initialize_145;
--------------------
-- Initialize_146 --
--------------------
procedure Initialize_146 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 146,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 146, (Is_Empty => True));
end Initialize_146;
--------------------
-- Initialize_147 --
--------------------
procedure Initialize_147 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 147,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0175'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 147, (Is_Empty => True));
end Initialize_147;
--------------------
-- Initialize_148 --
--------------------
procedure Initialize_148 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 148,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0144'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 148, (Is_Empty => True));
end Initialize_148;
--------------------
-- Initialize_149 --
--------------------
procedure Initialize_149 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 149,
AMF.Internals.Tables.CMOF_String_Data_00.MS_007D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 149, (Is_Empty => True));
end Initialize_149;
--------------------
-- Initialize_150 --
--------------------
procedure Initialize_150 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 150,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 150, (Is_Empty => True));
end Initialize_150;
--------------------
-- Initialize_151 --
--------------------
procedure Initialize_151 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 151,
AMF.Internals.Tables.CMOF_String_Data_01.MS_018F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 151, (Is_Empty => True));
end Initialize_151;
--------------------
-- Initialize_152 --
--------------------
procedure Initialize_152 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 152,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 152, (Is_Empty => True));
end Initialize_152;
--------------------
-- Initialize_153 --
--------------------
procedure Initialize_153 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 153,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01FD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 153, (Is_Empty => True));
end Initialize_153;
--------------------
-- Initialize_154 --
--------------------
procedure Initialize_154 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 154,
AMF.Internals.Tables.CMOF_String_Data_01.MS_015A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 154, (Is_Empty => True));
end Initialize_154;
--------------------
-- Initialize_155 --
--------------------
procedure Initialize_155 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 155,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 155, (Is_Empty => True));
end Initialize_155;
--------------------
-- Initialize_156 --
--------------------
procedure Initialize_156 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 156,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00DA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 156, (Is_Empty => True));
end Initialize_156;
--------------------
-- Initialize_157 --
--------------------
procedure Initialize_157 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 157,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0108'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 157, (Is_Empty => True));
end Initialize_157;
--------------------
-- Initialize_158 --
--------------------
procedure Initialize_158 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 158,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0006'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 158, (Is_Empty => True));
end Initialize_158;
--------------------
-- Initialize_159 --
--------------------
procedure Initialize_159 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 159,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 159, (Is_Empty => True));
end Initialize_159;
--------------------
-- Initialize_160 --
--------------------
procedure Initialize_160 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 160,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 160, (Is_Empty => True));
end Initialize_160;
--------------------
-- Initialize_161 --
--------------------
procedure Initialize_161 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 161,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 161, (Is_Empty => True));
end Initialize_161;
--------------------
-- Initialize_162 --
--------------------
procedure Initialize_162 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 162,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 162, (Is_Empty => True));
end Initialize_162;
--------------------
-- Initialize_163 --
--------------------
procedure Initialize_163 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 163,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 163, (Is_Empty => True));
end Initialize_163;
--------------------
-- Initialize_164 --
--------------------
procedure Initialize_164 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 164,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0061'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 164, (Is_Empty => True));
end Initialize_164;
--------------------
-- Initialize_165 --
--------------------
procedure Initialize_165 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 165,
AMF.Internals.Tables.CMOF_String_Data_00.MS_002C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 165, (Is_Empty => True));
end Initialize_165;
--------------------
-- Initialize_166 --
--------------------
procedure Initialize_166 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 166,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 166, (Is_Empty => True));
end Initialize_166;
--------------------
-- Initialize_167 --
--------------------
procedure Initialize_167 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 167,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0055'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 167, (Is_Empty => True));
end Initialize_167;
--------------------
-- Initialize_168 --
--------------------
procedure Initialize_168 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 168,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0106'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 168, (Is_Empty => True));
end Initialize_168;
--------------------
-- Initialize_169 --
--------------------
procedure Initialize_169 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 169,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0033'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 169, (Is_Empty => True));
end Initialize_169;
--------------------
-- Initialize_170 --
--------------------
procedure Initialize_170 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 170,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00ED'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 170, (Is_Empty => True));
end Initialize_170;
--------------------
-- Initialize_171 --
--------------------
procedure Initialize_171 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 171,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0003'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 171, (Is_Empty => True));
end Initialize_171;
--------------------
-- Initialize_172 --
--------------------
procedure Initialize_172 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 172,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0161'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 172, (Is_Empty => True));
end Initialize_172;
--------------------
-- Initialize_173 --
--------------------
procedure Initialize_173 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 173,
AMF.Internals.Tables.CMOF_String_Data_00.MS_002F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 173, (Is_Empty => True));
end Initialize_173;
--------------------
-- Initialize_174 --
--------------------
procedure Initialize_174 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 174,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01DB'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 174, (Is_Empty => True));
end Initialize_174;
--------------------
-- Initialize_175 --
--------------------
procedure Initialize_175 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 175,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 175, (Is_Empty => True));
end Initialize_175;
--------------------
-- Initialize_176 --
--------------------
procedure Initialize_176 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 176,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00BE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 176, (Is_Empty => True));
end Initialize_176;
--------------------
-- Initialize_177 --
--------------------
procedure Initialize_177 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 177,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CB'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 177, (Is_Empty => True));
end Initialize_177;
--------------------
-- Initialize_178 --
--------------------
procedure Initialize_178 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 178,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0065'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 178, (Is_Empty => True));
end Initialize_178;
--------------------
-- Initialize_179 --
--------------------
procedure Initialize_179 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 179,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00FA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 179, (Is_Empty => True));
end Initialize_179;
--------------------
-- Initialize_180 --
--------------------
procedure Initialize_180 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 180,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0034'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 180, (Is_Empty => True));
end Initialize_180;
--------------------
-- Initialize_181 --
--------------------
procedure Initialize_181 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 181,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 181, (Is_Empty => True));
end Initialize_181;
--------------------
-- Initialize_182 --
--------------------
procedure Initialize_182 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 182,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0008'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 182, (Is_Empty => True));
end Initialize_182;
--------------------
-- Initialize_183 --
--------------------
procedure Initialize_183 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 183,
AMF.Internals.Tables.CMOF_String_Data_00.MS_005F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 183, (Is_Empty => True));
end Initialize_183;
--------------------
-- Initialize_184 --
--------------------
procedure Initialize_184 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 184,
AMF.Internals.Tables.CMOF_String_Data_00.MS_007B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 184, (Is_Empty => True));
end Initialize_184;
--------------------
-- Initialize_185 --
--------------------
procedure Initialize_185 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 185,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0130'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 185, (Is_Empty => True));
end Initialize_185;
--------------------
-- Initialize_186 --
--------------------
procedure Initialize_186 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 186,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0182'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 186, (Is_Empty => True));
end Initialize_186;
--------------------
-- Initialize_187 --
--------------------
procedure Initialize_187 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 187,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0035'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 187, (Is_Empty => True));
end Initialize_187;
--------------------
-- Initialize_188 --
--------------------
procedure Initialize_188 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 188,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00BA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 188, (Is_Empty => True));
end Initialize_188;
--------------------
-- Initialize_189 --
--------------------
procedure Initialize_189 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 189,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Uri
(Base + 189,
AMF.Internals.Tables.CMOF_String_Data_00.MS_006F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 189, (Is_Empty => True));
end Initialize_189;
--------------------
-- Initialize_190 --
--------------------
procedure Initialize_190 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 190,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0173'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 190, (Is_Empty => True));
end Initialize_190;
--------------------
-- Initialize_191 --
--------------------
procedure Initialize_191 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 191,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014D'Access);
end Initialize_191;
--------------------
-- Initialize_192 --
--------------------
procedure Initialize_192 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 192,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0165'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 192, (Is_Empty => True));
end Initialize_192;
--------------------
-- Initialize_193 --
--------------------
procedure Initialize_193 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 193,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008C'Access);
end Initialize_193;
--------------------
-- Initialize_194 --
--------------------
procedure Initialize_194 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 194,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0040'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 194, (Is_Empty => True));
end Initialize_194;
--------------------
-- Initialize_195 --
--------------------
procedure Initialize_195 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 195,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00CC'Access);
end Initialize_195;
--------------------
-- Initialize_196 --
--------------------
procedure Initialize_196 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 196,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 196, (Is_Empty => True));
end Initialize_196;
--------------------
-- Initialize_197 --
--------------------
procedure Initialize_197 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 197,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0116'Access);
end Initialize_197;
--------------------
-- Initialize_198 --
--------------------
procedure Initialize_198 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 198,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009A'Access);
end Initialize_198;
--------------------
-- Initialize_199 --
--------------------
procedure Initialize_199 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 199,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 199, (Is_Empty => True));
end Initialize_199;
--------------------
-- Initialize_200 --
--------------------
procedure Initialize_200 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 200,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0188'Access);
end Initialize_200;
--------------------
-- Initialize_201 --
--------------------
procedure Initialize_201 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 201, (Is_Empty => True));
end Initialize_201;
--------------------
-- Initialize_202 --
--------------------
procedure Initialize_202 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 202,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0100'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 202, (Is_Empty => True));
end Initialize_202;
--------------------
-- Initialize_203 --
--------------------
procedure Initialize_203 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 203,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D6'Access);
end Initialize_203;
--------------------
-- Initialize_204 --
--------------------
procedure Initialize_204 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 204, (Is_Empty => True));
end Initialize_204;
--------------------
-- Initialize_205 --
--------------------
procedure Initialize_205 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 205,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EC'Access);
end Initialize_205;
--------------------
-- Initialize_206 --
--------------------
procedure Initialize_206 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 206,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0131'Access);
end Initialize_206;
--------------------
-- Initialize_207 --
--------------------
procedure Initialize_207 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 207,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0018'Access);
end Initialize_207;
--------------------
-- Initialize_208 --
--------------------
procedure Initialize_208 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 208,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003A'Access);
end Initialize_208;
--------------------
-- Initialize_209 --
--------------------
procedure Initialize_209 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 209,
AMF.Internals.Tables.CMOF_String_Data_01.MS_013A'Access);
end Initialize_209;
--------------------
-- Initialize_210 --
--------------------
procedure Initialize_210 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 210, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 210,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 210, (Is_Empty => True));
end Initialize_210;
--------------------
-- Initialize_211 --
--------------------
procedure Initialize_211 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 211,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F8'Access);
end Initialize_211;
--------------------
-- Initialize_212 --
--------------------
procedure Initialize_212 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 212,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 212, (Is_Empty => True));
end Initialize_212;
--------------------
-- Initialize_213 --
--------------------
procedure Initialize_213 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 213, (Is_Empty => True));
end Initialize_213;
--------------------
-- Initialize_214 --
--------------------
procedure Initialize_214 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 214, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 214, (Is_Empty => True));
end Initialize_214;
--------------------
-- Initialize_215 --
--------------------
procedure Initialize_215 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 215, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 215,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0112'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 215, (Is_Empty => True));
end Initialize_215;
--------------------
-- Initialize_216 --
--------------------
procedure Initialize_216 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 216, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 216,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00DC'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 216, (Is_Empty => True));
end Initialize_216;
--------------------
-- Initialize_217 --
--------------------
procedure Initialize_217 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 217,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0070'Access);
end Initialize_217;
--------------------
-- Initialize_218 --
--------------------
procedure Initialize_218 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 218,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 218, (Is_Empty => True));
end Initialize_218;
--------------------
-- Initialize_219 --
--------------------
procedure Initialize_219 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 219, (Is_Empty => True));
end Initialize_219;
--------------------
-- Initialize_220 --
--------------------
procedure Initialize_220 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 220, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 220, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 220, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 220, (Is_Empty => True));
end Initialize_220;
--------------------
-- Initialize_221 --
--------------------
procedure Initialize_221 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 221, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 221,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0095'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 221, (Is_Empty => True));
end Initialize_221;
--------------------
-- Initialize_222 --
--------------------
procedure Initialize_222 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 222,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0005'Access);
end Initialize_222;
--------------------
-- Initialize_223 --
--------------------
procedure Initialize_223 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 223,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 223, (Is_Empty => True));
end Initialize_223;
--------------------
-- Initialize_224 --
--------------------
procedure Initialize_224 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 224, (Is_Empty => True));
end Initialize_224;
--------------------
-- Initialize_225 --
--------------------
procedure Initialize_225 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 225, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 225, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 225, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 225, (Is_Empty => True));
end Initialize_225;
--------------------
-- Initialize_226 --
--------------------
procedure Initialize_226 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 226, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 226,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 226, (Is_Empty => True));
end Initialize_226;
--------------------
-- Initialize_227 --
--------------------
procedure Initialize_227 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 227,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D6'Access);
end Initialize_227;
--------------------
-- Initialize_228 --
--------------------
procedure Initialize_228 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 228,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 228, (Is_Empty => True));
end Initialize_228;
--------------------
-- Initialize_229 --
--------------------
procedure Initialize_229 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 229, (Is_Empty => True));
end Initialize_229;
--------------------
-- Initialize_230 --
--------------------
procedure Initialize_230 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 230, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 230, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 230, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 230, (Is_Empty => True));
end Initialize_230;
--------------------
-- Initialize_231 --
--------------------
procedure Initialize_231 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 231, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 231,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 231, (Is_Empty => True));
end Initialize_231;
--------------------
-- Initialize_232 --
--------------------
procedure Initialize_232 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 232,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01AB'Access);
end Initialize_232;
--------------------
-- Initialize_233 --
--------------------
procedure Initialize_233 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 233,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 233, (Is_Empty => True));
end Initialize_233;
--------------------
-- Initialize_234 --
--------------------
procedure Initialize_234 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 234, (Is_Empty => True));
end Initialize_234;
--------------------
-- Initialize_235 --
--------------------
procedure Initialize_235 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 235, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 235, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 235, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 235, (Is_Empty => True));
end Initialize_235;
--------------------
-- Initialize_236 --
--------------------
procedure Initialize_236 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 236, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 236,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0176'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 236, (Is_Empty => True));
end Initialize_236;
--------------------
-- Initialize_237 --
--------------------
procedure Initialize_237 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 237,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0089'Access);
end Initialize_237;
--------------------
-- Initialize_238 --
--------------------
procedure Initialize_238 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 238,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 238, (Is_Empty => True));
end Initialize_238;
--------------------
-- Initialize_239 --
--------------------
procedure Initialize_239 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 239, (Is_Empty => True));
end Initialize_239;
--------------------
-- Initialize_240 --
--------------------
procedure Initialize_240 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 240, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 240, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 240, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 240, (Is_Empty => True));
end Initialize_240;
--------------------
-- Initialize_241 --
--------------------
procedure Initialize_241 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 241, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 241,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0090'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 241, (Is_Empty => True));
end Initialize_241;
--------------------
-- Initialize_242 --
--------------------
procedure Initialize_242 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 242,
AMF.Internals.Tables.CMOF_String_Data_00.MS_007C'Access);
end Initialize_242;
--------------------
-- Initialize_243 --
--------------------
procedure Initialize_243 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 243, (Is_Empty => True));
end Initialize_243;
--------------------
-- Initialize_244 --
--------------------
procedure Initialize_244 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 244, (Is_Empty => True));
end Initialize_244;
--------------------
-- Initialize_245 --
--------------------
procedure Initialize_245 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 245,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 245, (Is_Empty => True));
end Initialize_245;
--------------------
-- Initialize_246 --
--------------------
procedure Initialize_246 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 246, (Is_Empty => True));
end Initialize_246;
--------------------
-- Initialize_247 --
--------------------
procedure Initialize_247 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 247, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 247, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 247, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 247, (Is_Empty => True));
end Initialize_247;
--------------------
-- Initialize_248 --
--------------------
procedure Initialize_248 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 248, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 248,
AMF.Internals.Tables.CMOF_String_Data_01.MS_011D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 248, (Is_Empty => True));
end Initialize_248;
--------------------
-- Initialize_249 --
--------------------
procedure Initialize_249 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 249, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 249,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0093'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 249, (Is_Empty => True));
end Initialize_249;
--------------------
-- Initialize_250 --
--------------------
procedure Initialize_250 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 250,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0160'Access);
end Initialize_250;
--------------------
-- Initialize_251 --
--------------------
procedure Initialize_251 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 251, (Is_Empty => True));
end Initialize_251;
--------------------
-- Initialize_252 --
--------------------
procedure Initialize_252 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 252, (Is_Empty => True));
end Initialize_252;
--------------------
-- Initialize_253 --
--------------------
procedure Initialize_253 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 253,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 253, (Is_Empty => True));
end Initialize_253;
--------------------
-- Initialize_254 --
--------------------
procedure Initialize_254 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 254, (Is_Empty => True));
end Initialize_254;
--------------------
-- Initialize_255 --
--------------------
procedure Initialize_255 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 255, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 255, (Is_Empty => True));
end Initialize_255;
--------------------
-- Initialize_256 --
--------------------
procedure Initialize_256 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 256, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 256,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 256, (Is_Empty => True));
end Initialize_256;
--------------------
-- Initialize_257 --
--------------------
procedure Initialize_257 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 257, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 257,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 257, (Is_Empty => True));
end Initialize_257;
--------------------
-- Initialize_258 --
--------------------
procedure Initialize_258 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 258,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016E'Access);
end Initialize_258;
--------------------
-- Initialize_259 --
--------------------
procedure Initialize_259 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 259,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 259, (Is_Empty => True));
end Initialize_259;
--------------------
-- Initialize_260 --
--------------------
procedure Initialize_260 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 260, (Is_Empty => True));
end Initialize_260;
--------------------
-- Initialize_261 --
--------------------
procedure Initialize_261 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 261, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 261, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 261, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 261, (Is_Empty => True));
end Initialize_261;
--------------------
-- Initialize_262 --
--------------------
procedure Initialize_262 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 262, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 262, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 262,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 262, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 262, (Is_Empty => True));
end Initialize_262;
--------------------
-- Initialize_263 --
--------------------
procedure Initialize_263 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 263, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 263,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0140'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 263, (Is_Empty => True));
end Initialize_263;
--------------------
-- Initialize_264 --
--------------------
procedure Initialize_264 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 264,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0181'Access);
end Initialize_264;
--------------------
-- Initialize_265 --
--------------------
procedure Initialize_265 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 265,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 265, (Is_Empty => True));
end Initialize_265;
--------------------
-- Initialize_266 --
--------------------
procedure Initialize_266 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 266, (Is_Empty => True));
end Initialize_266;
--------------------
-- Initialize_267 --
--------------------
procedure Initialize_267 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 267, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 267, (Is_Empty => True));
end Initialize_267;
--------------------
-- Initialize_268 --
--------------------
procedure Initialize_268 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 268, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 268,
AMF.Internals.Tables.CMOF_String_Data_01.MS_011D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 268, (Is_Empty => True));
end Initialize_268;
--------------------
-- Initialize_269 --
--------------------
procedure Initialize_269 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 269,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0139'Access);
end Initialize_269;
--------------------
-- Initialize_270 --
--------------------
procedure Initialize_270 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 270,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0141'Access);
end Initialize_270;
--------------------
-- Initialize_271 --
--------------------
procedure Initialize_271 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 271,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008B'Access);
end Initialize_271;
--------------------
-- Initialize_272 --
--------------------
procedure Initialize_272 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 272,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D9'Access);
end Initialize_272;
--------------------
-- Initialize_273 --
--------------------
procedure Initialize_273 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 273,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 273, (Is_Empty => True));
end Initialize_273;
--------------------
-- Initialize_274 --
--------------------
procedure Initialize_274 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 274,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C8'Access);
end Initialize_274;
--------------------
-- Initialize_275 --
--------------------
procedure Initialize_275 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 275, (Is_Empty => True));
end Initialize_275;
--------------------
-- Initialize_276 --
--------------------
procedure Initialize_276 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 276,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0083'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 276, (Is_Empty => True));
end Initialize_276;
--------------------
-- Initialize_277 --
--------------------
procedure Initialize_277 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 277,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B3'Access);
end Initialize_277;
--------------------
-- Initialize_278 --
--------------------
procedure Initialize_278 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 278, (Is_Empty => True));
end Initialize_278;
--------------------
-- Initialize_279 --
--------------------
procedure Initialize_279 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 279,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0153'Access);
end Initialize_279;
--------------------
-- Initialize_280 --
--------------------
procedure Initialize_280 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 280,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0038'Access);
end Initialize_280;
--------------------
-- Initialize_281 --
--------------------
procedure Initialize_281 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 281,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01BB'Access);
end Initialize_281;
--------------------
-- Initialize_282 --
--------------------
procedure Initialize_282 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 282, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 282,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0058'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 282, (Is_Empty => True));
end Initialize_282;
--------------------
-- Initialize_283 --
--------------------
procedure Initialize_283 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 283,
AMF.Internals.Tables.CMOF_String_Data_00.MS_007A'Access);
end Initialize_283;
--------------------
-- Initialize_284 --
--------------------
procedure Initialize_284 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 284,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 284, (Is_Empty => True));
end Initialize_284;
--------------------
-- Initialize_285 --
--------------------
procedure Initialize_285 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 285, (Is_Empty => True));
end Initialize_285;
--------------------
-- Initialize_286 --
--------------------
procedure Initialize_286 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 286, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 286, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 286, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 286, (Is_Empty => True));
end Initialize_286;
--------------------
-- Initialize_287 --
--------------------
procedure Initialize_287 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 287, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 287,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 287, (Is_Empty => True));
end Initialize_287;
--------------------
-- Initialize_288 --
--------------------
procedure Initialize_288 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 288,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0013'Access);
end Initialize_288;
--------------------
-- Initialize_289 --
--------------------
procedure Initialize_289 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 289,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 289, (Is_Empty => True));
end Initialize_289;
--------------------
-- Initialize_290 --
--------------------
procedure Initialize_290 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 290, (Is_Empty => True));
end Initialize_290;
--------------------
-- Initialize_291 --
--------------------
procedure Initialize_291 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 291, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 291, (Is_Empty => True));
end Initialize_291;
--------------------
-- Initialize_292 --
--------------------
procedure Initialize_292 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 292,
AMF.Internals.Tables.CMOF_String_Data_01.MS_019F'Access);
end Initialize_292;
--------------------
-- Initialize_293 --
--------------------
procedure Initialize_293 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 293,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00AD'Access);
end Initialize_293;
--------------------
-- Initialize_294 --
--------------------
procedure Initialize_294 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 294,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0109'Access);
end Initialize_294;
--------------------
-- Initialize_295 --
--------------------
procedure Initialize_295 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 295,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0115'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 295, (Is_Empty => True));
end Initialize_295;
--------------------
-- Initialize_296 --
--------------------
procedure Initialize_296 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 296,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001C'Access);
end Initialize_296;
--------------------
-- Initialize_297 --
--------------------
procedure Initialize_297 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 297, (Is_Empty => True));
end Initialize_297;
--------------------
-- Initialize_298 --
--------------------
procedure Initialize_298 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 298,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0042'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 298, (Is_Empty => True));
end Initialize_298;
--------------------
-- Initialize_299 --
--------------------
procedure Initialize_299 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 299,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D7'Access);
end Initialize_299;
--------------------
-- Initialize_300 --
--------------------
procedure Initialize_300 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 300, (Is_Empty => True));
end Initialize_300;
--------------------
-- Initialize_301 --
--------------------
procedure Initialize_301 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 301,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0124'Access);
end Initialize_301;
--------------------
-- Initialize_302 --
--------------------
procedure Initialize_302 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 302,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E9'Access);
end Initialize_302;
--------------------
-- Initialize_303 --
--------------------
procedure Initialize_303 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 303,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003E'Access);
end Initialize_303;
--------------------
-- Initialize_304 --
--------------------
procedure Initialize_304 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 304,
AMF.Internals.Tables.CMOF_String_Data_01.MS_017D'Access);
end Initialize_304;
--------------------
-- Initialize_305 --
--------------------
procedure Initialize_305 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 305, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 305,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0101'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 305, (Is_Empty => True));
end Initialize_305;
--------------------
-- Initialize_306 --
--------------------
procedure Initialize_306 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 306,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0011'Access);
end Initialize_306;
--------------------
-- Initialize_307 --
--------------------
procedure Initialize_307 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 307, (Is_Empty => True));
end Initialize_307;
--------------------
-- Initialize_308 --
--------------------
procedure Initialize_308 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 308, (Is_Empty => True));
end Initialize_308;
--------------------
-- Initialize_309 --
--------------------
procedure Initialize_309 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 309,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 309, (Is_Empty => True));
end Initialize_309;
--------------------
-- Initialize_310 --
--------------------
procedure Initialize_310 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 310, (Is_Empty => True));
end Initialize_310;
--------------------
-- Initialize_311 --
--------------------
procedure Initialize_311 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 311, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 311, (Is_Empty => True));
end Initialize_311;
--------------------
-- Initialize_312 --
--------------------
procedure Initialize_312 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 312, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 312,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0002'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 312, (Is_Empty => True));
end Initialize_312;
--------------------
-- Initialize_313 --
--------------------
procedure Initialize_313 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 313,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F1'Access);
end Initialize_313;
--------------------
-- Initialize_314 --
--------------------
procedure Initialize_314 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 314, (Is_Empty => True));
end Initialize_314;
--------------------
-- Initialize_315 --
--------------------
procedure Initialize_315 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 315, (Is_Empty => True));
end Initialize_315;
--------------------
-- Initialize_316 --
--------------------
procedure Initialize_316 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 316,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 316, (Is_Empty => True));
end Initialize_316;
--------------------
-- Initialize_317 --
--------------------
procedure Initialize_317 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 317, (Is_Empty => True));
end Initialize_317;
--------------------
-- Initialize_318 --
--------------------
procedure Initialize_318 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 318, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 318, (Is_Empty => True));
end Initialize_318;
--------------------
-- Initialize_319 --
--------------------
procedure Initialize_319 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 319, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 319,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 319, (Is_Empty => True));
end Initialize_319;
--------------------
-- Initialize_320 --
--------------------
procedure Initialize_320 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 320, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 320,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0126'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 320, (Is_Empty => True));
end Initialize_320;
--------------------
-- Initialize_321 --
--------------------
procedure Initialize_321 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 321,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0156'Access);
end Initialize_321;
--------------------
-- Initialize_322 --
--------------------
procedure Initialize_322 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 322, (Is_Empty => True));
end Initialize_322;
--------------------
-- Initialize_323 --
--------------------
procedure Initialize_323 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 323, (Is_Empty => True));
end Initialize_323;
--------------------
-- Initialize_324 --
--------------------
procedure Initialize_324 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 324,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 324, (Is_Empty => True));
end Initialize_324;
--------------------
-- Initialize_325 --
--------------------
procedure Initialize_325 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 325, (Is_Empty => True));
end Initialize_325;
--------------------
-- Initialize_326 --
--------------------
procedure Initialize_326 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 326, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 326, (Is_Empty => True));
end Initialize_326;
--------------------
-- Initialize_327 --
--------------------
procedure Initialize_327 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 327, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 327,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 327, (Is_Empty => True));
end Initialize_327;
--------------------
-- Initialize_328 --
--------------------
procedure Initialize_328 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 328, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 328,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 328, (Is_Empty => True));
end Initialize_328;
--------------------
-- Initialize_329 --
--------------------
procedure Initialize_329 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 329,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00BF'Access);
end Initialize_329;
--------------------
-- Initialize_330 --
--------------------
procedure Initialize_330 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 330,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 330, (Is_Empty => True));
end Initialize_330;
--------------------
-- Initialize_331 --
--------------------
procedure Initialize_331 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 331, (Is_Empty => True));
end Initialize_331;
--------------------
-- Initialize_332 --
--------------------
procedure Initialize_332 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 332, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 332, (Is_Empty => True));
end Initialize_332;
--------------------
-- Initialize_333 --
--------------------
procedure Initialize_333 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 333, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 333,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0136'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 333, (Is_Empty => True));
end Initialize_333;
--------------------
-- Initialize_334 --
--------------------
procedure Initialize_334 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 334,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00BC'Access);
end Initialize_334;
--------------------
-- Initialize_335 --
--------------------
procedure Initialize_335 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 335,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 335, (Is_Empty => True));
end Initialize_335;
--------------------
-- Initialize_336 --
--------------------
procedure Initialize_336 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 336, (Is_Empty => True));
end Initialize_336;
--------------------
-- Initialize_337 --
--------------------
procedure Initialize_337 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 337, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 337, (Is_Empty => True));
end Initialize_337;
--------------------
-- Initialize_338 --
--------------------
procedure Initialize_338 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 338,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0129'Access);
end Initialize_338;
--------------------
-- Initialize_339 --
--------------------
procedure Initialize_339 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 339,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0189'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 339, (Is_Empty => True));
end Initialize_339;
--------------------
-- Initialize_340 --
--------------------
procedure Initialize_340 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 340,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014A'Access);
end Initialize_340;
--------------------
-- Initialize_341 --
--------------------
procedure Initialize_341 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 341, (Is_Empty => True));
end Initialize_341;
--------------------
-- Initialize_342 --
--------------------
procedure Initialize_342 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 342,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0103'Access);
end Initialize_342;
--------------------
-- Initialize_343 --
--------------------
procedure Initialize_343 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 343,
AMF.Internals.Tables.CMOF_String_Data_01.MS_013D'Access);
end Initialize_343;
--------------------
-- Initialize_344 --
--------------------
procedure Initialize_344 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 344,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F6'Access);
end Initialize_344;
--------------------
-- Initialize_345 --
--------------------
procedure Initialize_345 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 345,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F0'Access);
end Initialize_345;
--------------------
-- Initialize_346 --
--------------------
procedure Initialize_346 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 346,
AMF.Internals.Tables.CMOF_String_Data_01.MS_017E'Access);
end Initialize_346;
--------------------
-- Initialize_347 --
--------------------
procedure Initialize_347 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 347, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 347,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 347, (Is_Empty => True));
end Initialize_347;
--------------------
-- Initialize_348 --
--------------------
procedure Initialize_348 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 348,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B0'Access);
end Initialize_348;
--------------------
-- Initialize_349 --
--------------------
procedure Initialize_349 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 349,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 349, (Is_Empty => True));
end Initialize_349;
--------------------
-- Initialize_350 --
--------------------
procedure Initialize_350 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 350, (Is_Empty => True));
end Initialize_350;
--------------------
-- Initialize_351 --
--------------------
procedure Initialize_351 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 351, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 351, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 351, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 351, (Is_Empty => True));
end Initialize_351;
--------------------
-- Initialize_352 --
--------------------
procedure Initialize_352 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 352, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 352,
AMF.Internals.Tables.CMOF_String_Data_01.MS_015C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 352, (Is_Empty => True));
end Initialize_352;
--------------------
-- Initialize_353 --
--------------------
procedure Initialize_353 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 353,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E5'Access);
end Initialize_353;
--------------------
-- Initialize_354 --
--------------------
procedure Initialize_354 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 354,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 354, (Is_Empty => True));
end Initialize_354;
--------------------
-- Initialize_355 --
--------------------
procedure Initialize_355 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 355, (Is_Empty => True));
end Initialize_355;
--------------------
-- Initialize_356 --
--------------------
procedure Initialize_356 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 356, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 356, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 356, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 356, (Is_Empty => True));
end Initialize_356;
--------------------
-- Initialize_357 --
--------------------
procedure Initialize_357 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 357, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 357,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0104'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 357, (Is_Empty => True));
end Initialize_357;
--------------------
-- Initialize_358 --
--------------------
procedure Initialize_358 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 358, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 358,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0167'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 358, (Is_Empty => True));
end Initialize_358;
--------------------
-- Initialize_359 --
--------------------
procedure Initialize_359 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 359,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0096'Access);
end Initialize_359;
--------------------
-- Initialize_360 --
--------------------
procedure Initialize_360 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 360,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 360, (Is_Empty => True));
end Initialize_360;
--------------------
-- Initialize_361 --
--------------------
procedure Initialize_361 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 361, (Is_Empty => True));
end Initialize_361;
--------------------
-- Initialize_362 --
--------------------
procedure Initialize_362 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 362, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 362, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 362, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 362, (Is_Empty => True));
end Initialize_362;
--------------------
-- Initialize_363 --
--------------------
procedure Initialize_363 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 363, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 363, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 363,
AMF.Internals.Tables.CMOF_String_Data_01.MS_012A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 363, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 363, (Is_Empty => True));
end Initialize_363;
--------------------
-- Initialize_364 --
--------------------
procedure Initialize_364 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 364, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 364,
AMF.Internals.Tables.CMOF_String_Data_01.MS_011F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 364, (Is_Empty => True));
end Initialize_364;
--------------------
-- Initialize_365 --
--------------------
procedure Initialize_365 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 365,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E1'Access);
end Initialize_365;
--------------------
-- Initialize_366 --
--------------------
procedure Initialize_366 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 366,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 366, (Is_Empty => True));
end Initialize_366;
--------------------
-- Initialize_367 --
--------------------
procedure Initialize_367 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 367, (Is_Empty => True));
end Initialize_367;
--------------------
-- Initialize_368 --
--------------------
procedure Initialize_368 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 368, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 368, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 368, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 368, (Is_Empty => True));
end Initialize_368;
--------------------
-- Initialize_369 --
--------------------
procedure Initialize_369 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 369, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 369, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 369,
AMF.Internals.Tables.CMOF_String_Data_01.MS_012A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 369, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 369, (Is_Empty => True));
end Initialize_369;
--------------------
-- Initialize_370 --
--------------------
procedure Initialize_370 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 370, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 370,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 370, (Is_Empty => True));
end Initialize_370;
--------------------
-- Initialize_371 --
--------------------
procedure Initialize_371 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 371,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A2'Access);
end Initialize_371;
--------------------
-- Initialize_372 --
--------------------
procedure Initialize_372 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 372,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 372, (Is_Empty => True));
end Initialize_372;
--------------------
-- Initialize_373 --
--------------------
procedure Initialize_373 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 373, (Is_Empty => True));
end Initialize_373;
--------------------
-- Initialize_374 --
--------------------
procedure Initialize_374 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 374, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 374, (Is_Empty => True));
end Initialize_374;
--------------------
-- Initialize_375 --
--------------------
procedure Initialize_375 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 375,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0057'Access);
end Initialize_375;
--------------------
-- Initialize_376 --
--------------------
procedure Initialize_376 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 376,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0151'Access);
end Initialize_376;
--------------------
-- Initialize_377 --
--------------------
procedure Initialize_377 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 377,
AMF.Internals.Tables.CMOF_String_Data_00.MS_005B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 377, (Is_Empty => True));
end Initialize_377;
--------------------
-- Initialize_378 --
--------------------
procedure Initialize_378 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 378,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010D'Access);
end Initialize_378;
--------------------
-- Initialize_379 --
--------------------
procedure Initialize_379 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 379, (Is_Empty => True));
end Initialize_379;
--------------------
-- Initialize_380 --
--------------------
procedure Initialize_380 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 380,
AMF.Internals.Tables.CMOF_String_Data_00.MS_007E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 380, (Is_Empty => True));
end Initialize_380;
--------------------
-- Initialize_381 --
--------------------
procedure Initialize_381 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 381,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B9'Access);
end Initialize_381;
--------------------
-- Initialize_382 --
--------------------
procedure Initialize_382 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 382, (Is_Empty => True));
end Initialize_382;
--------------------
-- Initialize_383 --
--------------------
procedure Initialize_383 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 383,
AMF.Internals.Tables.CMOF_String_Data_01.MS_015E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 383, (Is_Empty => True));
end Initialize_383;
--------------------
-- Initialize_384 --
--------------------
procedure Initialize_384 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 384,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D4'Access);
end Initialize_384;
--------------------
-- Initialize_385 --
--------------------
procedure Initialize_385 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 385, (Is_Empty => True));
end Initialize_385;
--------------------
-- Initialize_386 --
--------------------
procedure Initialize_386 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 386,
AMF.Internals.Tables.CMOF_String_Data_00.MS_005A'Access);
end Initialize_386;
--------------------
-- Initialize_387 --
--------------------
procedure Initialize_387 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 387,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0118'Access);
end Initialize_387;
--------------------
-- Initialize_388 --
--------------------
procedure Initialize_388 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 388,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0134'Access);
end Initialize_388;
--------------------
-- Initialize_389 --
--------------------
procedure Initialize_389 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 389, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 389,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 389, (Is_Empty => True));
end Initialize_389;
--------------------
-- Initialize_390 --
--------------------
procedure Initialize_390 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 390,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C3'Access);
end Initialize_390;
--------------------
-- Initialize_391 --
--------------------
procedure Initialize_391 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 391,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 391, (Is_Empty => True));
end Initialize_391;
--------------------
-- Initialize_392 --
--------------------
procedure Initialize_392 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 392, (Is_Empty => True));
end Initialize_392;
--------------------
-- Initialize_393 --
--------------------
procedure Initialize_393 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 393, (Is_Empty => True));
end Initialize_393;
--------------------
-- Initialize_394 --
--------------------
procedure Initialize_394 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 394, (Is_Empty => True));
end Initialize_394;
--------------------
-- Initialize_395 --
--------------------
procedure Initialize_395 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 395, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 395, (Is_Empty => True));
end Initialize_395;
--------------------
-- Initialize_396 --
--------------------
procedure Initialize_396 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 396, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 396,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 396, (Is_Empty => True));
end Initialize_396;
--------------------
-- Initialize_397 --
--------------------
procedure Initialize_397 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 397, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 397,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01BD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 397, (Is_Empty => True));
end Initialize_397;
--------------------
-- Initialize_398 --
--------------------
procedure Initialize_398 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 398,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B8'Access);
end Initialize_398;
--------------------
-- Initialize_399 --
--------------------
procedure Initialize_399 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 399,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 399, (Is_Empty => True));
end Initialize_399;
--------------------
-- Initialize_400 --
--------------------
procedure Initialize_400 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 400, (Is_Empty => True));
end Initialize_400;
--------------------
-- Initialize_401 --
--------------------
procedure Initialize_401 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 401, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 401, (Is_Empty => True));
end Initialize_401;
--------------------
-- Initialize_402 --
--------------------
procedure Initialize_402 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 402, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 402,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0099'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 402, (Is_Empty => True));
end Initialize_402;
--------------------
-- Initialize_403 --
--------------------
procedure Initialize_403 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 403,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C2'Access);
end Initialize_403;
--------------------
-- Initialize_404 --
--------------------
procedure Initialize_404 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 404,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0066'Access);
end Initialize_404;
--------------------
-- Initialize_405 --
--------------------
procedure Initialize_405 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 405,
AMF.Internals.Tables.CMOF_String_Data_01.MS_012F'Access);
end Initialize_405;
--------------------
-- Initialize_406 --
--------------------
procedure Initialize_406 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 406,
AMF.Internals.Tables.CMOF_String_Data_01.MS_018E'Access);
end Initialize_406;
--------------------
-- Initialize_407 --
--------------------
procedure Initialize_407 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 407,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008E'Access);
end Initialize_407;
--------------------
-- Initialize_408 --
--------------------
procedure Initialize_408 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 408,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0078'Access);
end Initialize_408;
--------------------
-- Initialize_409 --
--------------------
procedure Initialize_409 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 409, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 409,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 409, (Is_Empty => True));
end Initialize_409;
--------------------
-- Initialize_410 --
--------------------
procedure Initialize_410 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 410,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C3'Access);
end Initialize_410;
--------------------
-- Initialize_411 --
--------------------
procedure Initialize_411 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 411,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 411, (Is_Empty => True));
end Initialize_411;
--------------------
-- Initialize_412 --
--------------------
procedure Initialize_412 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 412, (Is_Empty => True));
end Initialize_412;
--------------------
-- Initialize_413 --
--------------------
procedure Initialize_413 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 413, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 413, (Is_Empty => True));
end Initialize_413;
--------------------
-- Initialize_414 --
--------------------
procedure Initialize_414 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 414, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 414,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0145'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 414, (Is_Empty => True));
end Initialize_414;
--------------------
-- Initialize_415 --
--------------------
procedure Initialize_415 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 415,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0064'Access);
end Initialize_415;
--------------------
-- Initialize_416 --
--------------------
procedure Initialize_416 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 416,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 416, (Is_Empty => True));
end Initialize_416;
--------------------
-- Initialize_417 --
--------------------
procedure Initialize_417 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 417, (Is_Empty => True));
end Initialize_417;
--------------------
-- Initialize_418 --
--------------------
procedure Initialize_418 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 418, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 418, (Is_Empty => True));
end Initialize_418;
--------------------
-- Initialize_419 --
--------------------
procedure Initialize_419 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 419, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 419,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0092'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 419, (Is_Empty => True));
end Initialize_419;
--------------------
-- Initialize_420 --
--------------------
procedure Initialize_420 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 420,
AMF.Internals.Tables.CMOF_String_Data_01.MS_013E'Access);
end Initialize_420;
--------------------
-- Initialize_421 --
--------------------
procedure Initialize_421 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 421,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 421, (Is_Empty => True));
end Initialize_421;
--------------------
-- Initialize_422 --
--------------------
procedure Initialize_422 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 422, (Is_Empty => True));
end Initialize_422;
--------------------
-- Initialize_423 --
--------------------
procedure Initialize_423 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 423, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 423, (Is_Empty => True));
end Initialize_423;
--------------------
-- Initialize_424 --
--------------------
procedure Initialize_424 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 424, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 424,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 424, (Is_Empty => True));
end Initialize_424;
--------------------
-- Initialize_425 --
--------------------
procedure Initialize_425 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 425,
AMF.Internals.Tables.CMOF_String_Data_00.MS_005D'Access);
end Initialize_425;
--------------------
-- Initialize_426 --
--------------------
procedure Initialize_426 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 426,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 426, (Is_Empty => True));
end Initialize_426;
--------------------
-- Initialize_427 --
--------------------
procedure Initialize_427 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 427, (Is_Empty => True));
end Initialize_427;
--------------------
-- Initialize_428 --
--------------------
procedure Initialize_428 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 428, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 428, (Is_Empty => True));
end Initialize_428;
--------------------
-- Initialize_429 --
--------------------
procedure Initialize_429 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 429, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 429,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0030'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 429, (Is_Empty => True));
end Initialize_429;
--------------------
-- Initialize_430 --
--------------------
procedure Initialize_430 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 430,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0043'Access);
end Initialize_430;
--------------------
-- Initialize_431 --
--------------------
procedure Initialize_431 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 431,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 431, (Is_Empty => True));
end Initialize_431;
--------------------
-- Initialize_432 --
--------------------
procedure Initialize_432 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 432, (Is_Empty => True));
end Initialize_432;
--------------------
-- Initialize_433 --
--------------------
procedure Initialize_433 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 433, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 433, (Is_Empty => True));
end Initialize_433;
--------------------
-- Initialize_434 --
--------------------
procedure Initialize_434 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 434, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 434,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0184'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 434, (Is_Empty => True));
end Initialize_434;
--------------------
-- Initialize_435 --
--------------------
procedure Initialize_435 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 435,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0094'Access);
end Initialize_435;
--------------------
-- Initialize_436 --
--------------------
procedure Initialize_436 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 436,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 436, (Is_Empty => True));
end Initialize_436;
--------------------
-- Initialize_437 --
--------------------
procedure Initialize_437 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 437, (Is_Empty => True));
end Initialize_437;
--------------------
-- Initialize_438 --
--------------------
procedure Initialize_438 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 438, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 438, (Is_Empty => True));
end Initialize_438;
--------------------
-- Initialize_439 --
--------------------
procedure Initialize_439 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 439,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0046'Access);
end Initialize_439;
--------------------
-- Initialize_440 --
--------------------
procedure Initialize_440 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 440,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0004'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 440, (Is_Empty => True));
end Initialize_440;
--------------------
-- Initialize_441 --
--------------------
procedure Initialize_441 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 441,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B7'Access);
end Initialize_441;
--------------------
-- Initialize_442 --
--------------------
procedure Initialize_442 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 442, (Is_Empty => True));
end Initialize_442;
--------------------
-- Initialize_443 --
--------------------
procedure Initialize_443 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 443,
AMF.Internals.Tables.CMOF_String_Data_00.MS_002E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 443, (Is_Empty => True));
end Initialize_443;
--------------------
-- Initialize_444 --
--------------------
procedure Initialize_444 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 444,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01BF'Access);
end Initialize_444;
--------------------
-- Initialize_445 --
--------------------
procedure Initialize_445 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 445, (Is_Empty => True));
end Initialize_445;
--------------------
-- Initialize_446 --
--------------------
procedure Initialize_446 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 446,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0017'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 446, (Is_Empty => True));
end Initialize_446;
--------------------
-- Initialize_447 --
--------------------
procedure Initialize_447 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 447,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C7'Access);
end Initialize_447;
--------------------
-- Initialize_448 --
--------------------
procedure Initialize_448 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 448, (Is_Empty => True));
end Initialize_448;
--------------------
-- Initialize_449 --
--------------------
procedure Initialize_449 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 449,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 449, (Is_Empty => True));
end Initialize_449;
--------------------
-- Initialize_450 --
--------------------
procedure Initialize_450 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 450,
AMF.Internals.Tables.CMOF_String_Data_01.MS_019A'Access);
end Initialize_450;
--------------------
-- Initialize_451 --
--------------------
procedure Initialize_451 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 451, (Is_Empty => True));
end Initialize_451;
--------------------
-- Initialize_452 --
--------------------
procedure Initialize_452 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 452,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001D'Access);
end Initialize_452;
--------------------
-- Initialize_453 --
--------------------
procedure Initialize_453 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 453,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0133'Access);
end Initialize_453;
--------------------
-- Initialize_454 --
--------------------
procedure Initialize_454 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 454,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00EA'Access);
end Initialize_454;
--------------------
-- Initialize_455 --
--------------------
procedure Initialize_455 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 455,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F2'Access);
end Initialize_455;
--------------------
-- Initialize_456 --
--------------------
procedure Initialize_456 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 456,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016F'Access);
end Initialize_456;
--------------------
-- Initialize_457 --
--------------------
procedure Initialize_457 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 457, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 457,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 457, (Is_Empty => True));
end Initialize_457;
--------------------
-- Initialize_458 --
--------------------
procedure Initialize_458 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 458,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0193'Access);
end Initialize_458;
--------------------
-- Initialize_459 --
--------------------
procedure Initialize_459 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 459,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 459, (Is_Empty => True));
end Initialize_459;
--------------------
-- Initialize_460 --
--------------------
procedure Initialize_460 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 460, (Is_Empty => True));
end Initialize_460;
--------------------
-- Initialize_461 --
--------------------
procedure Initialize_461 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 461, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 461, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 461, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 461, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 461, (Is_Empty => True));
end Initialize_461;
--------------------
-- Initialize_462 --
--------------------
procedure Initialize_462 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 462,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01AE'Access);
end Initialize_462;
--------------------
-- Initialize_463 --
--------------------
procedure Initialize_463 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 463,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0044'Access);
end Initialize_463;
--------------------
-- Initialize_464 --
--------------------
procedure Initialize_464 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 464,
AMF.Internals.Tables.CMOF_String_Data_01.MS_019B'Access);
end Initialize_464;
--------------------
-- Initialize_465 --
--------------------
procedure Initialize_465 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 465,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01DA'Access);
end Initialize_465;
--------------------
-- Initialize_466 --
--------------------
procedure Initialize_466 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 466,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0073'Access);
end Initialize_466;
--------------------
-- Initialize_467 --
--------------------
procedure Initialize_467 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 467, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 467,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 467, (Is_Empty => True));
end Initialize_467;
--------------------
-- Initialize_468 --
--------------------
procedure Initialize_468 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 468,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016E'Access);
end Initialize_468;
--------------------
-- Initialize_469 --
--------------------
procedure Initialize_469 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 469,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 469, (Is_Empty => True));
end Initialize_469;
--------------------
-- Initialize_470 --
--------------------
procedure Initialize_470 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 470, (Is_Empty => True));
end Initialize_470;
--------------------
-- Initialize_471 --
--------------------
procedure Initialize_471 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 471, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 471, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 471, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 471, (Is_Empty => True));
end Initialize_471;
--------------------
-- Initialize_472 --
--------------------
procedure Initialize_472 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 472, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 472, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 472,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 472, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 472, (Is_Empty => True));
end Initialize_472;
--------------------
-- Initialize_473 --
--------------------
procedure Initialize_473 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 473,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0069'Access);
end Initialize_473;
--------------------
-- Initialize_474 --
--------------------
procedure Initialize_474 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 474,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0128'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 474, (Is_Empty => True));
end Initialize_474;
--------------------
-- Initialize_475 --
--------------------
procedure Initialize_475 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 475,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0146'Access);
end Initialize_475;
--------------------
-- Initialize_476 --
--------------------
procedure Initialize_476 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 476, (Is_Empty => True));
end Initialize_476;
--------------------
-- Initialize_477 --
--------------------
procedure Initialize_477 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 477,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 477, (Is_Empty => True));
end Initialize_477;
--------------------
-- Initialize_478 --
--------------------
procedure Initialize_478 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 478,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0025'Access);
end Initialize_478;
--------------------
-- Initialize_479 --
--------------------
procedure Initialize_479 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 479, (Is_Empty => True));
end Initialize_479;
--------------------
-- Initialize_480 --
--------------------
procedure Initialize_480 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 480,
AMF.Internals.Tables.CMOF_String_Data_00.MS_006E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 480, (Is_Empty => True));
end Initialize_480;
--------------------
-- Initialize_481 --
--------------------
procedure Initialize_481 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 481,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00EF'Access);
end Initialize_481;
--------------------
-- Initialize_482 --
--------------------
procedure Initialize_482 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 482, (Is_Empty => True));
end Initialize_482;
--------------------
-- Initialize_483 --
--------------------
procedure Initialize_483 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 483,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00EC'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 483, (Is_Empty => True));
end Initialize_483;
--------------------
-- Initialize_484 --
--------------------
procedure Initialize_484 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 484,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0023'Access);
end Initialize_484;
--------------------
-- Initialize_485 --
--------------------
procedure Initialize_485 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 485, (Is_Empty => True));
end Initialize_485;
--------------------
-- Initialize_486 --
--------------------
procedure Initialize_486 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 486,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00AC'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 486, (Is_Empty => True));
end Initialize_486;
--------------------
-- Initialize_487 --
--------------------
procedure Initialize_487 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 487,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01AC'Access);
end Initialize_487;
--------------------
-- Initialize_488 --
--------------------
procedure Initialize_488 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 488, (Is_Empty => True));
end Initialize_488;
--------------------
-- Initialize_489 --
--------------------
procedure Initialize_489 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 489,
AMF.Internals.Tables.CMOF_String_Data_00.MS_006C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 489, (Is_Empty => True));
end Initialize_489;
--------------------
-- Initialize_490 --
--------------------
procedure Initialize_490 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 490,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0125'Access);
end Initialize_490;
--------------------
-- Initialize_491 --
--------------------
procedure Initialize_491 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 491, (Is_Empty => True));
end Initialize_491;
--------------------
-- Initialize_492 --
--------------------
procedure Initialize_492 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 492,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 492, (Is_Empty => True));
end Initialize_492;
--------------------
-- Initialize_493 --
--------------------
procedure Initialize_493 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 493,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0091'Access);
end Initialize_493;
--------------------
-- Initialize_494 --
--------------------
procedure Initialize_494 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 494, (Is_Empty => True));
end Initialize_494;
--------------------
-- Initialize_495 --
--------------------
procedure Initialize_495 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 495,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0157'Access);
end Initialize_495;
--------------------
-- Initialize_496 --
--------------------
procedure Initialize_496 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 496,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000C'Access);
end Initialize_496;
--------------------
-- Initialize_497 --
--------------------
procedure Initialize_497 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 497,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00DD'Access);
end Initialize_497;
--------------------
-- Initialize_498 --
--------------------
procedure Initialize_498 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 498,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B2'Access);
end Initialize_498;
--------------------
-- Initialize_499 --
--------------------
procedure Initialize_499 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 499,
AMF.Internals.Tables.CMOF_String_Data_00.MS_005C'Access);
end Initialize_499;
--------------------
-- Initialize_500 --
--------------------
procedure Initialize_500 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 500,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F2'Access);
end Initialize_500;
--------------------
-- Initialize_501 --
--------------------
procedure Initialize_501 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 501,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01EB'Access);
end Initialize_501;
--------------------
-- Initialize_502 --
--------------------
procedure Initialize_502 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 502,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B0'Access);
end Initialize_502;
--------------------
-- Initialize_503 --
--------------------
procedure Initialize_503 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 503,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0186'Access);
end Initialize_503;
--------------------
-- Initialize_504 --
--------------------
procedure Initialize_504 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 504,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F0'Access);
end Initialize_504;
--------------------
-- Initialize_505 --
--------------------
procedure Initialize_505 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 505,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C9'Access);
end Initialize_505;
--------------------
-- Initialize_506 --
--------------------
procedure Initialize_506 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 506,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E2'Access);
end Initialize_506;
--------------------
-- Initialize_507 --
--------------------
procedure Initialize_507 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 507, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 507,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 507, (Is_Empty => True));
end Initialize_507;
--------------------
-- Initialize_508 --
--------------------
procedure Initialize_508 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 508,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0014'Access);
end Initialize_508;
--------------------
-- Initialize_509 --
--------------------
procedure Initialize_509 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 509,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 509, (Is_Empty => True));
end Initialize_509;
--------------------
-- Initialize_510 --
--------------------
procedure Initialize_510 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 510, (Is_Empty => True));
end Initialize_510;
--------------------
-- Initialize_511 --
--------------------
procedure Initialize_511 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 511, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 511, (Is_Empty => True));
end Initialize_511;
--------------------
-- Initialize_512 --
--------------------
procedure Initialize_512 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 512, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 512,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 512, (Is_Empty => True));
end Initialize_512;
--------------------
-- Initialize_513 --
--------------------
procedure Initialize_513 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 513,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0119'Access);
end Initialize_513;
--------------------
-- Initialize_514 --
--------------------
procedure Initialize_514 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 514, (Is_Empty => True));
end Initialize_514;
--------------------
-- Initialize_515 --
--------------------
procedure Initialize_515 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 515, (Is_Empty => True));
end Initialize_515;
--------------------
-- Initialize_516 --
--------------------
procedure Initialize_516 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 516,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 516, (Is_Empty => True));
end Initialize_516;
--------------------
-- Initialize_517 --
--------------------
procedure Initialize_517 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 517, (Is_Empty => True));
end Initialize_517;
--------------------
-- Initialize_518 --
--------------------
procedure Initialize_518 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 518, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 518, (Is_Empty => True));
end Initialize_518;
--------------------
-- Initialize_519 --
--------------------
procedure Initialize_519 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 519, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 519,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 519, (Is_Empty => True));
end Initialize_519;
--------------------
-- Initialize_520 --
--------------------
procedure Initialize_520 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 520, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 520,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 520, (Is_Empty => True));
end Initialize_520;
--------------------
-- Initialize_521 --
--------------------
procedure Initialize_521 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 521,
AMF.Internals.Tables.CMOF_String_Data_01.MS_015D'Access);
end Initialize_521;
--------------------
-- Initialize_522 --
--------------------
procedure Initialize_522 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 522,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 522, (Is_Empty => True));
end Initialize_522;
--------------------
-- Initialize_523 --
--------------------
procedure Initialize_523 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 523, (Is_Empty => True));
end Initialize_523;
--------------------
-- Initialize_524 --
--------------------
procedure Initialize_524 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 524, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 524, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 524, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 524, (Is_Empty => True));
end Initialize_524;
--------------------
-- Initialize_525 --
--------------------
procedure Initialize_525 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 525, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 525,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0123'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 525, (Is_Empty => True));
end Initialize_525;
--------------------
-- Initialize_526 --
--------------------
procedure Initialize_526 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 526,
AMF.Internals.Tables.CMOF_String_Data_00.MS_004E'Access);
end Initialize_526;
--------------------
-- Initialize_527 --
--------------------
procedure Initialize_527 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 527,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 527, (Is_Empty => True));
end Initialize_527;
--------------------
-- Initialize_528 --
--------------------
procedure Initialize_528 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 528, (Is_Empty => True));
end Initialize_528;
--------------------
-- Initialize_529 --
--------------------
procedure Initialize_529 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 529, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 529, (Is_Empty => True));
end Initialize_529;
--------------------
-- Initialize_530 --
--------------------
procedure Initialize_530 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 530, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 530,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0143'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 530, (Is_Empty => True));
end Initialize_530;
--------------------
-- Initialize_531 --
--------------------
procedure Initialize_531 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 531,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0107'Access);
end Initialize_531;
--------------------
-- Initialize_532 --
--------------------
procedure Initialize_532 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 532,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 532, (Is_Empty => True));
end Initialize_532;
--------------------
-- Initialize_533 --
--------------------
procedure Initialize_533 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 533, (Is_Empty => True));
end Initialize_533;
--------------------
-- Initialize_534 --
--------------------
procedure Initialize_534 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 534, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 534, (Is_Empty => True));
end Initialize_534;
--------------------
-- Initialize_535 --
--------------------
procedure Initialize_535 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 535, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 535,
AMF.Internals.Tables.CMOF_String_Data_00.MS_004C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 535, (Is_Empty => True));
end Initialize_535;
--------------------
-- Initialize_536 --
--------------------
procedure Initialize_536 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 536,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003D'Access);
end Initialize_536;
--------------------
-- Initialize_537 --
--------------------
procedure Initialize_537 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 537,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0016'Access);
end Initialize_537;
--------------------
-- Initialize_538 --
--------------------
procedure Initialize_538 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 538,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0039'Access);
end Initialize_538;
--------------------
-- Initialize_539 --
--------------------
procedure Initialize_539 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 539, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 539,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 539, (Is_Empty => True));
end Initialize_539;
--------------------
-- Initialize_540 --
--------------------
procedure Initialize_540 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 540,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016E'Access);
end Initialize_540;
--------------------
-- Initialize_541 --
--------------------
procedure Initialize_541 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 541,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 541, (Is_Empty => True));
end Initialize_541;
--------------------
-- Initialize_542 --
--------------------
procedure Initialize_542 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 542, (Is_Empty => True));
end Initialize_542;
--------------------
-- Initialize_543 --
--------------------
procedure Initialize_543 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 543, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 543, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 543, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 543, (Is_Empty => True));
end Initialize_543;
--------------------
-- Initialize_544 --
--------------------
procedure Initialize_544 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 544, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 544, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 544,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 544, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 544, (Is_Empty => True));
end Initialize_544;
--------------------
-- Initialize_545 --
--------------------
procedure Initialize_545 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 545,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01C9'Access);
end Initialize_545;
--------------------
-- Initialize_546 --
--------------------
procedure Initialize_546 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 546,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0086'Access);
end Initialize_546;
--------------------
-- Initialize_547 --
--------------------
procedure Initialize_547 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 547,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F7'Access);
end Initialize_547;
--------------------
-- Initialize_548 --
--------------------
procedure Initialize_548 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 548,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0191'Access);
end Initialize_548;
--------------------
-- Initialize_549 --
--------------------
procedure Initialize_549 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 549,
AMF.Internals.Tables.CMOF_String_Data_00.MS_004F'Access);
end Initialize_549;
--------------------
-- Initialize_550 --
--------------------
procedure Initialize_550 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 550,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0080'Access);
end Initialize_550;
--------------------
-- Initialize_551 --
--------------------
procedure Initialize_551 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 551,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00CB'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 551, (Is_Empty => True));
end Initialize_551;
--------------------
-- Initialize_552 --
--------------------
procedure Initialize_552 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 552,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0127'Access);
end Initialize_552;
--------------------
-- Initialize_553 --
--------------------
procedure Initialize_553 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 553, (Is_Empty => True));
end Initialize_553;
--------------------
-- Initialize_554 --
--------------------
procedure Initialize_554 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 554,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 554, (Is_Empty => True));
end Initialize_554;
--------------------
-- Initialize_555 --
--------------------
procedure Initialize_555 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 555,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01ED'Access);
end Initialize_555;
--------------------
-- Initialize_556 --
--------------------
procedure Initialize_556 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 556, (Is_Empty => True));
end Initialize_556;
--------------------
-- Initialize_557 --
--------------------
procedure Initialize_557 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 557,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0063'Access);
end Initialize_557;
--------------------
-- Initialize_558 --
--------------------
procedure Initialize_558 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 558,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00FF'Access);
end Initialize_558;
--------------------
-- Initialize_559 --
--------------------
procedure Initialize_559 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 559,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E7'Access);
end Initialize_559;
--------------------
-- Initialize_560 --
--------------------
procedure Initialize_560 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 560,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 560, (Is_Empty => True));
end Initialize_560;
--------------------
-- Initialize_561 --
--------------------
procedure Initialize_561 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 561,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003F'Access);
end Initialize_561;
--------------------
-- Initialize_562 --
--------------------
procedure Initialize_562 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 562, (Is_Empty => True));
end Initialize_562;
--------------------
-- Initialize_563 --
--------------------
procedure Initialize_563 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 563,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0155'Access);
end Initialize_563;
--------------------
-- Initialize_564 --
--------------------
procedure Initialize_564 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 564,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01FC'Access);
end Initialize_564;
--------------------
-- Initialize_565 --
--------------------
procedure Initialize_565 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 565,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CE'Access);
end Initialize_565;
--------------------
-- Initialize_566 --
--------------------
procedure Initialize_566 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 566,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B6'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 566, (Is_Empty => True));
end Initialize_566;
--------------------
-- Initialize_567 --
--------------------
procedure Initialize_567 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 567,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F4'Access);
end Initialize_567;
--------------------
-- Initialize_568 --
--------------------
procedure Initialize_568 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 568, (Is_Empty => True));
end Initialize_568;
--------------------
-- Initialize_569 --
--------------------
procedure Initialize_569 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 569,
AMF.Internals.Tables.CMOF_String_Data_01.MS_018D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 569, (Is_Empty => True));
end Initialize_569;
--------------------
-- Initialize_570 --
--------------------
procedure Initialize_570 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 570,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0031'Access);
end Initialize_570;
--------------------
-- Initialize_571 --
--------------------
procedure Initialize_571 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 571, (Is_Empty => True));
end Initialize_571;
--------------------
-- Initialize_572 --
--------------------
procedure Initialize_572 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 572,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0036'Access);
end Initialize_572;
--------------------
-- Initialize_573 --
--------------------
procedure Initialize_573 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 573,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008E'Access);
end Initialize_573;
--------------------
-- Initialize_574 --
--------------------
procedure Initialize_574 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 574,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008E'Access);
end Initialize_574;
--------------------
-- Initialize_575 --
--------------------
procedure Initialize_575 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 575,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008E'Access);
end Initialize_575;
--------------------
-- Initialize_576 --
--------------------
procedure Initialize_576 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 576,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008E'Access);
end Initialize_576;
--------------------
-- Initialize_577 --
--------------------
procedure Initialize_577 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 577,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0037'Access);
end Initialize_577;
--------------------
-- Initialize_578 --
--------------------
procedure Initialize_578 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 578,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001F'Access);
end Initialize_578;
--------------------
-- Initialize_579 --
--------------------
procedure Initialize_579 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 579,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0081'Access);
end Initialize_579;
--------------------
-- Initialize_580 --
--------------------
procedure Initialize_580 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 580,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0053'Access);
end Initialize_580;
--------------------
-- Initialize_581 --
--------------------
procedure Initialize_581 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 581,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008E'Access);
end Initialize_581;
--------------------
-- Initialize_582 --
--------------------
procedure Initialize_582 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 582,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F5'Access);
end Initialize_582;
--------------------
-- Initialize_583 --
--------------------
procedure Initialize_583 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 583, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 583,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0113'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 583, (Is_Empty => True));
end Initialize_583;
--------------------
-- Initialize_584 --
--------------------
procedure Initialize_584 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 584,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0012'Access);
end Initialize_584;
--------------------
-- Initialize_585 --
--------------------
procedure Initialize_585 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 585,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 585, (Is_Empty => True));
end Initialize_585;
--------------------
-- Initialize_586 --
--------------------
procedure Initialize_586 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 586, (Is_Empty => True));
end Initialize_586;
--------------------
-- Initialize_587 --
--------------------
procedure Initialize_587 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 587, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 587, (Is_Empty => True));
end Initialize_587;
--------------------
-- Initialize_588 --
--------------------
procedure Initialize_588 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 588, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 588,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0178'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 588, (Is_Empty => True));
end Initialize_588;
--------------------
-- Initialize_589 --
--------------------
procedure Initialize_589 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 589,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A9'Access);
end Initialize_589;
--------------------
-- Initialize_590 --
--------------------
procedure Initialize_590 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 590,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 590, (Is_Empty => True));
end Initialize_590;
--------------------
-- Initialize_591 --
--------------------
procedure Initialize_591 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 591, (Is_Empty => True));
end Initialize_591;
--------------------
-- Initialize_592 --
--------------------
procedure Initialize_592 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 592, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 592, (Is_Empty => True));
end Initialize_592;
--------------------
-- Initialize_593 --
--------------------
procedure Initialize_593 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 593, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 593,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 593, (Is_Empty => True));
end Initialize_593;
--------------------
-- Initialize_594 --
--------------------
procedure Initialize_594 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 594,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D1'Access);
end Initialize_594;
--------------------
-- Initialize_595 --
--------------------
procedure Initialize_595 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 595,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 595, (Is_Empty => True));
end Initialize_595;
--------------------
-- Initialize_596 --
--------------------
procedure Initialize_596 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 596, (Is_Empty => True));
end Initialize_596;
--------------------
-- Initialize_597 --
--------------------
procedure Initialize_597 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 597, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 597, (Is_Empty => True));
end Initialize_597;
--------------------
-- Initialize_598 --
--------------------
procedure Initialize_598 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 598, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 598,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 598, (Is_Empty => True));
end Initialize_598;
--------------------
-- Initialize_599 --
--------------------
procedure Initialize_599 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 599,
AMF.Internals.Tables.CMOF_String_Data_01.MS_015F'Access);
end Initialize_599;
--------------------
-- Initialize_600 --
--------------------
procedure Initialize_600 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 600,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 600, (Is_Empty => True));
end Initialize_600;
--------------------
-- Initialize_601 --
--------------------
procedure Initialize_601 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 601, (Is_Empty => True));
end Initialize_601;
--------------------
-- Initialize_602 --
--------------------
procedure Initialize_602 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 602, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 602, (Is_Empty => True));
end Initialize_602;
--------------------
-- Initialize_603 --
--------------------
procedure Initialize_603 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 603, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 603,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0196'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 603, (Is_Empty => True));
end Initialize_603;
--------------------
-- Initialize_604 --
--------------------
procedure Initialize_604 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 604,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E0'Access);
end Initialize_604;
--------------------
-- Initialize_605 --
--------------------
procedure Initialize_605 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 605,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 605, (Is_Empty => True));
end Initialize_605;
--------------------
-- Initialize_606 --
--------------------
procedure Initialize_606 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 606, (Is_Empty => True));
end Initialize_606;
--------------------
-- Initialize_607 --
--------------------
procedure Initialize_607 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 607, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 607, (Is_Empty => True));
end Initialize_607;
--------------------
-- Initialize_608 --
--------------------
procedure Initialize_608 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 608, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 608,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 608, (Is_Empty => True));
end Initialize_608;
--------------------
-- Initialize_609 --
--------------------
procedure Initialize_609 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 609,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D2'Access);
end Initialize_609;
--------------------
-- Initialize_610 --
--------------------
procedure Initialize_610 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 610, (Is_Empty => True));
end Initialize_610;
--------------------
-- Initialize_611 --
--------------------
procedure Initialize_611 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 611, (Is_Empty => True));
end Initialize_611;
--------------------
-- Initialize_612 --
--------------------
procedure Initialize_612 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 612,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 612, (Is_Empty => True));
end Initialize_612;
--------------------
-- Initialize_613 --
--------------------
procedure Initialize_613 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 613, (Is_Empty => True));
end Initialize_613;
--------------------
-- Initialize_614 --
--------------------
procedure Initialize_614 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 614, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 614, (Is_Empty => True));
end Initialize_614;
--------------------
-- Initialize_615 --
--------------------
procedure Initialize_615 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 615, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 615,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 615, (Is_Empty => True));
end Initialize_615;
--------------------
-- Initialize_616 --
--------------------
procedure Initialize_616 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 616, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 616,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 616, (Is_Empty => True));
end Initialize_616;
--------------------
-- Initialize_617 --
--------------------
procedure Initialize_617 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 617,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 617, (Is_Empty => True));
end Initialize_617;
--------------------
-- Initialize_618 --
--------------------
procedure Initialize_618 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 618, (Is_Empty => True));
end Initialize_618;
--------------------
-- Initialize_619 --
--------------------
procedure Initialize_619 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 619, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 619, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 619, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 619, (Is_Empty => True));
end Initialize_619;
--------------------
-- Initialize_620 --
--------------------
procedure Initialize_620 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 620,
AMF.Internals.Tables.CMOF_String_Data_01.MS_017B'Access);
end Initialize_620;
--------------------
-- Initialize_621 --
--------------------
procedure Initialize_621 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 621,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00BB'Access);
end Initialize_621;
--------------------
-- Initialize_622 --
--------------------
procedure Initialize_622 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 622,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0026'Access);
end Initialize_622;
--------------------
-- Initialize_623 --
--------------------
procedure Initialize_623 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 623,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0097'Access);
end Initialize_623;
--------------------
-- Initialize_624 --
--------------------
procedure Initialize_624 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 624,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B1'Access);
end Initialize_624;
--------------------
-- Initialize_625 --
--------------------
procedure Initialize_625 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 625,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F5'Access);
end Initialize_625;
--------------------
-- Initialize_626 --
--------------------
procedure Initialize_626 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 626,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E4'Access);
end Initialize_626;
--------------------
-- Initialize_627 --
--------------------
procedure Initialize_627 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 627, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 627,
AMF.Internals.Tables.CMOF_String_Data_00.MS_002A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 627, (Is_Empty => True));
end Initialize_627;
--------------------
-- Initialize_628 --
--------------------
procedure Initialize_628 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 628,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0024'Access);
end Initialize_628;
--------------------
-- Initialize_629 --
--------------------
procedure Initialize_629 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 629,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 629, (Is_Empty => True));
end Initialize_629;
--------------------
-- Initialize_630 --
--------------------
procedure Initialize_630 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 630, (Is_Empty => True));
end Initialize_630;
--------------------
-- Initialize_631 --
--------------------
procedure Initialize_631 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 631, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 631, (Is_Empty => True));
end Initialize_631;
--------------------
-- Initialize_632 --
--------------------
procedure Initialize_632 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 632, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 632,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 632, (Is_Empty => True));
end Initialize_632;
--------------------
-- Initialize_633 --
--------------------
procedure Initialize_633 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 633, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 633,
AMF.Internals.Tables.CMOF_String_Data_00.MS_004D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 633, (Is_Empty => True));
end Initialize_633;
--------------------
-- Initialize_634 --
--------------------
procedure Initialize_634 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 634,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00AF'Access);
end Initialize_634;
--------------------
-- Initialize_635 --
--------------------
procedure Initialize_635 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 635,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0045'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 635, (Is_Empty => True));
end Initialize_635;
--------------------
-- Initialize_636 --
--------------------
procedure Initialize_636 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 636,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00DB'Access);
end Initialize_636;
--------------------
-- Initialize_637 --
--------------------
procedure Initialize_637 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 637, (Is_Empty => True));
end Initialize_637;
--------------------
-- Initialize_638 --
--------------------
procedure Initialize_638 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 638,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 638, (Is_Empty => True));
end Initialize_638;
--------------------
-- Initialize_639 --
--------------------
procedure Initialize_639 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 639,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A6'Access);
end Initialize_639;
--------------------
-- Initialize_640 --
--------------------
procedure Initialize_640 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 640, (Is_Empty => True));
end Initialize_640;
--------------------
-- Initialize_641 --
--------------------
procedure Initialize_641 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 641,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D1'Access);
end Initialize_641;
--------------------
-- Initialize_642 --
--------------------
procedure Initialize_642 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 642,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00CA'Access);
end Initialize_642;
--------------------
-- Initialize_643 --
--------------------
procedure Initialize_643 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 643,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0007'Access);
end Initialize_643;
--------------------
-- Initialize_644 --
--------------------
procedure Initialize_644 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 644,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01B1'Access);
end Initialize_644;
--------------------
-- Initialize_645 --
--------------------
procedure Initialize_645 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 645, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 645,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 645, (Is_Empty => True));
end Initialize_645;
--------------------
-- Initialize_646 --
--------------------
procedure Initialize_646 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 646,
AMF.Internals.Tables.CMOF_String_Data_01.MS_018C'Access);
end Initialize_646;
--------------------
-- Initialize_647 --
--------------------
procedure Initialize_647 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 647,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 647, (Is_Empty => True));
end Initialize_647;
--------------------
-- Initialize_648 --
--------------------
procedure Initialize_648 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 648, (Is_Empty => True));
end Initialize_648;
--------------------
-- Initialize_649 --
--------------------
procedure Initialize_649 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 649, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 649, (Is_Empty => True));
end Initialize_649;
--------------------
-- Initialize_650 --
--------------------
procedure Initialize_650 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 650,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0132'Access);
end Initialize_650;
--------------------
-- Initialize_651 --
--------------------
procedure Initialize_651 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 651,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00A8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 651, (Is_Empty => True));
end Initialize_651;
--------------------
-- Initialize_652 --
--------------------
procedure Initialize_652 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 652,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0177'Access);
end Initialize_652;
--------------------
-- Initialize_653 --
--------------------
procedure Initialize_653 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 653, (Is_Empty => True));
end Initialize_653;
--------------------
-- Initialize_654 --
--------------------
procedure Initialize_654 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 654,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E1'Access);
end Initialize_654;
--------------------
-- Initialize_655 --
--------------------
procedure Initialize_655 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 655,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D4'Access);
end Initialize_655;
--------------------
-- Initialize_656 --
--------------------
procedure Initialize_656 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 656,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E5'Access);
end Initialize_656;
--------------------
-- Initialize_657 --
--------------------
procedure Initialize_657 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 657,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0183'Access);
end Initialize_657;
--------------------
-- Initialize_658 --
--------------------
procedure Initialize_658 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 658,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00AB'Access);
end Initialize_658;
--------------------
-- Initialize_659 --
--------------------
procedure Initialize_659 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 659,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0171'Access);
end Initialize_659;
--------------------
-- Initialize_660 --
--------------------
procedure Initialize_660 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 660, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 660,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 660, (Is_Empty => True));
end Initialize_660;
--------------------
-- Initialize_661 --
--------------------
procedure Initialize_661 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 661,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0047'Access);
end Initialize_661;
--------------------
-- Initialize_662 --
--------------------
procedure Initialize_662 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 662,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 662, (Is_Empty => True));
end Initialize_662;
--------------------
-- Initialize_663 --
--------------------
procedure Initialize_663 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 663, (Is_Empty => True));
end Initialize_663;
--------------------
-- Initialize_664 --
--------------------
procedure Initialize_664 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 664, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 664, (Is_Empty => True));
end Initialize_664;
--------------------
-- Initialize_665 --
--------------------
procedure Initialize_665 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 665, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 665,
AMF.Internals.Tables.CMOF_String_Data_01.MS_011B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 665, (Is_Empty => True));
end Initialize_665;
--------------------
-- Initialize_666 --
--------------------
procedure Initialize_666 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 666,
AMF.Internals.Tables.CMOF_String_Data_01.MS_013C'Access);
end Initialize_666;
--------------------
-- Initialize_667 --
--------------------
procedure Initialize_667 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 667,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 667, (Is_Empty => True));
end Initialize_667;
--------------------
-- Initialize_668 --
--------------------
procedure Initialize_668 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 668, (Is_Empty => True));
end Initialize_668;
--------------------
-- Initialize_669 --
--------------------
procedure Initialize_669 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 669, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 669, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 669, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 669, (Is_Empty => True));
end Initialize_669;
--------------------
-- Initialize_670 --
--------------------
procedure Initialize_670 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 670, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 670,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 670, (Is_Empty => True));
end Initialize_670;
--------------------
-- Initialize_671 --
--------------------
procedure Initialize_671 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 671,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01F4'Access);
end Initialize_671;
--------------------
-- Initialize_672 --
--------------------
procedure Initialize_672 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 672, (Is_Empty => True));
end Initialize_672;
--------------------
-- Initialize_673 --
--------------------
procedure Initialize_673 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 673, (Is_Empty => True));
end Initialize_673;
--------------------
-- Initialize_674 --
--------------------
procedure Initialize_674 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 674,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 674, (Is_Empty => True));
end Initialize_674;
--------------------
-- Initialize_675 --
--------------------
procedure Initialize_675 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 675, (Is_Empty => True));
end Initialize_675;
--------------------
-- Initialize_676 --
--------------------
procedure Initialize_676 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 676, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 676, (Is_Empty => True));
end Initialize_676;
--------------------
-- Initialize_677 --
--------------------
procedure Initialize_677 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 677, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 677,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 677, (Is_Empty => True));
end Initialize_677;
--------------------
-- Initialize_678 --
--------------------
procedure Initialize_678 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 678,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A4'Access);
end Initialize_678;
--------------------
-- Initialize_679 --
--------------------
procedure Initialize_679 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 679,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01BC'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 679, (Is_Empty => True));
end Initialize_679;
--------------------
-- Initialize_680 --
--------------------
procedure Initialize_680 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 680,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0190'Access);
end Initialize_680;
--------------------
-- Initialize_681 --
--------------------
procedure Initialize_681 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 681, (Is_Empty => True));
end Initialize_681;
--------------------
-- Initialize_682 --
--------------------
procedure Initialize_682 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 682,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A9'Access);
end Initialize_682;
--------------------
-- Initialize_683 --
--------------------
procedure Initialize_683 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 683,
AMF.Internals.Tables.CMOF_String_Data_01.MS_012D'Access);
end Initialize_683;
--------------------
-- Initialize_684 --
--------------------
procedure Initialize_684 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 684,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00EB'Access);
end Initialize_684;
--------------------
-- Initialize_685 --
--------------------
procedure Initialize_685 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 685,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00AE'Access);
end Initialize_685;
--------------------
-- Initialize_686 --
--------------------
procedure Initialize_686 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 686,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C0'Access);
end Initialize_686;
--------------------
-- Initialize_687 --
--------------------
procedure Initialize_687 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 687,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01DD'Access);
end Initialize_687;
--------------------
-- Initialize_688 --
--------------------
procedure Initialize_688 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 688,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01A8'Access);
end Initialize_688;
--------------------
-- Initialize_689 --
--------------------
procedure Initialize_689 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 689,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0121'Access);
end Initialize_689;
--------------------
-- Initialize_690 --
--------------------
procedure Initialize_690 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 690, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 690,
AMF.Internals.Tables.CMOF_String_Data_01.MS_014B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 690, (Is_Empty => True));
end Initialize_690;
--------------------
-- Initialize_691 --
--------------------
procedure Initialize_691 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 691,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009D'Access);
end Initialize_691;
--------------------
-- Initialize_692 --
--------------------
procedure Initialize_692 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 692,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 692, (Is_Empty => True));
end Initialize_692;
--------------------
-- Initialize_693 --
--------------------
procedure Initialize_693 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 693, (Is_Empty => True));
end Initialize_693;
--------------------
-- Initialize_694 --
--------------------
procedure Initialize_694 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 694, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 694, (Is_Empty => True));
end Initialize_694;
--------------------
-- Initialize_695 --
--------------------
procedure Initialize_695 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 695, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 695,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0112'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 695, (Is_Empty => True));
end Initialize_695;
--------------------
-- Initialize_696 --
--------------------
procedure Initialize_696 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 696,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0079'Access);
end Initialize_696;
--------------------
-- Initialize_697 --
--------------------
procedure Initialize_697 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 697,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0122'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 697, (Is_Empty => True));
end Initialize_697;
--------------------
-- Initialize_698 --
--------------------
procedure Initialize_698 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 698,
AMF.Internals.Tables.CMOF_String_Data_01.MS_011A'Access);
end Initialize_698;
--------------------
-- Initialize_699 --
--------------------
procedure Initialize_699 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 699, (Is_Empty => True));
end Initialize_699;
--------------------
-- Initialize_700 --
--------------------
procedure Initialize_700 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 700,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 700, (Is_Empty => True));
end Initialize_700;
--------------------
-- Initialize_701 --
--------------------
procedure Initialize_701 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 701,
AMF.Internals.Tables.CMOF_String_Data_00.MS_007F'Access);
end Initialize_701;
--------------------
-- Initialize_702 --
--------------------
procedure Initialize_702 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 702, (Is_Empty => True));
end Initialize_702;
--------------------
-- Initialize_703 --
--------------------
procedure Initialize_703 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 703,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01D0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 703, (Is_Empty => True));
end Initialize_703;
--------------------
-- Initialize_704 --
--------------------
procedure Initialize_704 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 704,
AMF.Internals.Tables.CMOF_String_Data_01.MS_011E'Access);
end Initialize_704;
--------------------
-- Initialize_705 --
--------------------
procedure Initialize_705 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 705, (Is_Empty => True));
end Initialize_705;
--------------------
-- Initialize_706 --
--------------------
procedure Initialize_706 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 706,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0199'Access);
end Initialize_706;
--------------------
-- Initialize_707 --
--------------------
procedure Initialize_707 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 707,
AMF.Internals.Tables.CMOF_String_Data_00.MS_005E'Access);
end Initialize_707;
--------------------
-- Initialize_708 --
--------------------
procedure Initialize_708 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 708,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0195'Access);
end Initialize_708;
--------------------
-- Initialize_709 --
--------------------
procedure Initialize_709 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 709,
AMF.Internals.Tables.CMOF_String_Data_01.MS_017C'Access);
end Initialize_709;
--------------------
-- Initialize_710 --
--------------------
procedure Initialize_710 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 710, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 710,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01FB'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 710, (Is_Empty => True));
end Initialize_710;
--------------------
-- Initialize_711 --
--------------------
procedure Initialize_711 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 711,
AMF.Internals.Tables.CMOF_String_Data_00.MS_004A'Access);
end Initialize_711;
--------------------
-- Initialize_712 --
--------------------
procedure Initialize_712 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 712,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 712, (Is_Empty => True));
end Initialize_712;
--------------------
-- Initialize_713 --
--------------------
procedure Initialize_713 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 713, (Is_Empty => True));
end Initialize_713;
--------------------
-- Initialize_714 --
--------------------
procedure Initialize_714 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 714, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 714, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 714, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 714, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 714, (Is_Empty => True));
end Initialize_714;
--------------------
-- Initialize_715 --
--------------------
procedure Initialize_715 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 715, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 715,
AMF.Internals.Tables.CMOF_String_Data_00.MS_002A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 715, (Is_Empty => True));
end Initialize_715;
--------------------
-- Initialize_716 --
--------------------
procedure Initialize_716 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 716,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CC'Access);
end Initialize_716;
--------------------
-- Initialize_717 --
--------------------
procedure Initialize_717 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 717,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 717, (Is_Empty => True));
end Initialize_717;
--------------------
-- Initialize_718 --
--------------------
procedure Initialize_718 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 718, (Is_Empty => True));
end Initialize_718;
--------------------
-- Initialize_719 --
--------------------
procedure Initialize_719 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 719, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 719, (Is_Empty => True));
end Initialize_719;
--------------------
-- Initialize_720 --
--------------------
procedure Initialize_720 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 720, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 720,
AMF.Internals.Tables.CMOF_String_Data_00.MS_001E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 720, (Is_Empty => True));
end Initialize_720;
--------------------
-- Initialize_721 --
--------------------
procedure Initialize_721 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 721, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 721,
AMF.Internals.Tables.CMOF_String_Data_00.MS_004D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 721, (Is_Empty => True));
end Initialize_721;
--------------------
-- Initialize_722 --
--------------------
procedure Initialize_722 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 722, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 722,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0084'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 722, (Is_Empty => True));
end Initialize_722;
--------------------
-- Initialize_723 --
--------------------
procedure Initialize_723 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 723,
AMF.Internals.Tables.CMOF_String_Data_00.MS_006A'Access);
end Initialize_723;
--------------------
-- Initialize_724 --
--------------------
procedure Initialize_724 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 724,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 724, (Is_Empty => True));
end Initialize_724;
--------------------
-- Initialize_725 --
--------------------
procedure Initialize_725 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 725, (Is_Empty => True));
end Initialize_725;
--------------------
-- Initialize_726 --
--------------------
procedure Initialize_726 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 726, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 726, (Is_Empty => True));
end Initialize_726;
--------------------
-- Initialize_727 --
--------------------
procedure Initialize_727 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 727, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 727,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0000'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 727, (Is_Empty => True));
end Initialize_727;
--------------------
-- Initialize_728 --
--------------------
procedure Initialize_728 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 728,
AMF.Internals.Tables.CMOF_String_Data_00.MS_007F'Access);
end Initialize_728;
--------------------
-- Initialize_729 --
--------------------
procedure Initialize_729 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 729,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 729, (Is_Empty => True));
end Initialize_729;
--------------------
-- Initialize_730 --
--------------------
procedure Initialize_730 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 730, (Is_Empty => True));
end Initialize_730;
--------------------
-- Initialize_731 --
--------------------
procedure Initialize_731 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 731, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 731, (Is_Empty => True));
end Initialize_731;
--------------------
-- Initialize_732 --
--------------------
procedure Initialize_732 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 732,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0120'Access);
end Initialize_732;
--------------------
-- Initialize_733 --
--------------------
procedure Initialize_733 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 733,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010C'Access);
end Initialize_733;
--------------------
-- Initialize_734 --
--------------------
procedure Initialize_734 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 734,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0027'Access);
end Initialize_734;
--------------------
-- Initialize_735 --
--------------------
procedure Initialize_735 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 735,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01DF'Access);
end Initialize_735;
--------------------
-- Initialize_736 --
--------------------
procedure Initialize_736 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 736,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0087'Access);
end Initialize_736;
--------------------
-- Initialize_737 --
--------------------
procedure Initialize_737 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 737,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0015'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 737, (Is_Empty => True));
end Initialize_737;
--------------------
-- Initialize_738 --
--------------------
procedure Initialize_738 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 738,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0149'Access);
end Initialize_738;
--------------------
-- Initialize_739 --
--------------------
procedure Initialize_739 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 739,
AMF.Internals.Tables.CMOF_String_Data_00.MS_000B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 739, (Is_Empty => True));
end Initialize_739;
--------------------
-- Initialize_740 --
--------------------
procedure Initialize_740 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 740,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0019'Access);
end Initialize_740;
--------------------
-- Initialize_741 --
--------------------
procedure Initialize_741 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 741,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00DF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 741, (Is_Empty => True));
end Initialize_741;
--------------------
-- Initialize_742 --
--------------------
procedure Initialize_742 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 742,
AMF.Internals.Tables.CMOF_String_Data_00.MS_009C'Access);
end Initialize_742;
--------------------
-- Initialize_743 --
--------------------
procedure Initialize_743 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 743,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00C5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 743, (Is_Empty => True));
end Initialize_743;
--------------------
-- Initialize_744 --
--------------------
procedure Initialize_744 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 744,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00EE'Access);
end Initialize_744;
--------------------
-- Initialize_745 --
--------------------
procedure Initialize_745 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 745,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01BE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 745, (Is_Empty => True));
end Initialize_745;
--------------------
-- Initialize_746 --
--------------------
procedure Initialize_746 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 746,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0098'Access);
end Initialize_746;
--------------------
-- Initialize_747 --
--------------------
procedure Initialize_747 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 747,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0192'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 747, (Is_Empty => True));
end Initialize_747;
--------------------
-- Initialize_748 --
--------------------
procedure Initialize_748 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 748,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E7'Access);
end Initialize_748;
--------------------
-- Initialize_749 --
--------------------
procedure Initialize_749 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Query (Base + 749, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 749,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00AA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 749, (Is_Empty => True));
end Initialize_749;
--------------------
-- Initialize_750 --
--------------------
procedure Initialize_750 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 750,
AMF.Internals.Tables.CMOF_String_Data_00.MS_002D'Access);
end Initialize_750;
--------------------
-- Initialize_751 --
--------------------
procedure Initialize_751 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 751,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 751, (Is_Empty => True));
end Initialize_751;
--------------------
-- Initialize_752 --
--------------------
procedure Initialize_752 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 752, (Is_Empty => True));
end Initialize_752;
--------------------
-- Initialize_753 --
--------------------
procedure Initialize_753 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 753, AMF.CMOF.Return_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 753, (Is_Empty => True));
end Initialize_753;
--------------------
-- Initialize_754 --
--------------------
procedure Initialize_754 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Direction (Base + 754, AMF.CMOF.In_Parameter);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 754, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 754,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00CF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 754, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 754, (Is_Empty => True));
end Initialize_754;
--------------------
-- Initialize_755 --
--------------------
procedure Initialize_755 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 755,
AMF.Internals.Tables.CMOF_String_Data_00.MS_003B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 755, (Is_Empty => True));
end Initialize_755;
--------------------
-- Initialize_756 --
--------------------
procedure Initialize_756 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 756,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0028'Access);
end Initialize_756;
--------------------
-- Initialize_757 --
--------------------
procedure Initialize_757 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 757,
AMF.Internals.Tables.CMOF_String_Data_01.MS_013F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 757, (Is_Empty => True));
end Initialize_757;
--------------------
-- Initialize_758 --
--------------------
procedure Initialize_758 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 758,
AMF.Internals.Tables.CMOF_String_Data_00.MS_008D'Access);
end Initialize_758;
--------------------
-- Initialize_759 --
--------------------
procedure Initialize_759 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 759,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0114'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 759, (Is_Empty => True));
end Initialize_759;
--------------------
-- Initialize_760 --
--------------------
procedure Initialize_760 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 760,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0071'Access);
end Initialize_760;
--------------------
-- Initialize_761 --
--------------------
procedure Initialize_761 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 761,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00F8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 761, (Is_Empty => True));
end Initialize_761;
--------------------
-- Initialize_762 --
--------------------
procedure Initialize_762 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 762,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0166'Access);
end Initialize_762;
--------------------
-- Initialize_763 --
--------------------
procedure Initialize_763 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 763, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 763,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01CD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 763, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 763, (Is_Empty => True));
end Initialize_763;
--------------------
-- Initialize_764 --
--------------------
procedure Initialize_764 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 764, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 764,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 764, (Is_Empty => True));
end Initialize_764;
--------------------
-- Initialize_765 --
--------------------
procedure Initialize_765 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 765, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 765,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0075'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 765, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 765, (Is_Empty => True));
end Initialize_765;
--------------------
-- Initialize_766 --
--------------------
procedure Initialize_766 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 766, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 766,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0075'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 766, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 766, (Is_Empty => True));
end Initialize_766;
--------------------
-- Initialize_767 --
--------------------
procedure Initialize_767 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 767, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 767,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0075'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 767, (Is_Empty => True));
end Initialize_767;
--------------------
-- Initialize_768 --
--------------------
procedure Initialize_768 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 768, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 768,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0029'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 768, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 768, (Is_Empty => True));
end Initialize_768;
--------------------
-- Initialize_769 --
--------------------
procedure Initialize_769 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 769, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 769,
AMF.Internals.Tables.CMOF_String_Data_02.MS_0200'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 769, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 769, (Is_Empty => True));
end Initialize_769;
--------------------
-- Initialize_770 --
--------------------
procedure Initialize_770 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 770, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 770,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0054'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 770, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 770, (Is_Empty => True));
end Initialize_770;
--------------------
-- Initialize_771 --
--------------------
procedure Initialize_771 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 771, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 771,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0054'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 771, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 771, (Is_Empty => True));
end Initialize_771;
--------------------
-- Initialize_772 --
--------------------
procedure Initialize_772 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 772, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 772,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00BD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 772, (Is_Empty => True));
end Initialize_772;
--------------------
-- Initialize_773 --
--------------------
procedure Initialize_773 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 773, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 773,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00CD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 773, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 773, (Is_Empty => True));
end Initialize_773;
--------------------
-- Initialize_774 --
--------------------
procedure Initialize_774 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 774, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 774,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 774, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 774, (Is_Empty => True));
end Initialize_774;
--------------------
-- Initialize_775 --
--------------------
procedure Initialize_775 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 775, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 775,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0169'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 775, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 775, (Is_Empty => True));
end Initialize_775;
--------------------
-- Initialize_776 --
--------------------
procedure Initialize_776 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 776, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 776,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00D0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 776, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 776, (Is_Empty => True));
end Initialize_776;
--------------------
-- Initialize_777 --
--------------------
procedure Initialize_777 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 777, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 777,
AMF.Internals.Tables.CMOF_String_Data_01.MS_013B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 777, (Is_Empty => True));
end Initialize_777;
--------------------
-- Initialize_778 --
--------------------
procedure Initialize_778 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 778, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 778,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0054'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 778, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 778, (Is_Empty => True));
end Initialize_778;
--------------------
-- Initialize_779 --
--------------------
procedure Initialize_779 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 779, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 779,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00B3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 779, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 779, (Is_Empty => True));
end Initialize_779;
--------------------
-- Initialize_780 --
--------------------
procedure Initialize_780 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 780, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 780,
AMF.Internals.Tables.CMOF_String_Data_01.MS_016D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 780, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 780, (Is_Empty => True));
end Initialize_780;
--------------------
-- Initialize_781 --
--------------------
procedure Initialize_781 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 781, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 781,
AMF.Internals.Tables.CMOF_String_Data_00.MS_00E4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 781, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 781, (Is_Empty => True));
end Initialize_781;
--------------------
-- Initialize_782 --
--------------------
procedure Initialize_782 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 782, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 782,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0001'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 782, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 782, (Is_Empty => True));
end Initialize_782;
--------------------
-- Initialize_783 --
--------------------
procedure Initialize_783 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 783, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 783,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0001'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 783, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 783, (Is_Empty => True));
end Initialize_783;
--------------------
-- Initialize_784 --
--------------------
procedure Initialize_784 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 784, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 784,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0102'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 784, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 784, (Is_Empty => True));
end Initialize_784;
--------------------
-- Initialize_785 --
--------------------
procedure Initialize_785 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 785, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 785,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0102'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 785, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 785, (Is_Empty => True));
end Initialize_785;
--------------------
-- Initialize_786 --
--------------------
procedure Initialize_786 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 786, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 786,
AMF.Internals.Tables.CMOF_String_Data_01.MS_019D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 786, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 786, (Is_Empty => True));
end Initialize_786;
--------------------
-- Initialize_787 --
--------------------
procedure Initialize_787 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 787, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 787,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0009'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 787, (Is_Empty => True));
end Initialize_787;
--------------------
-- Initialize_788 --
--------------------
procedure Initialize_788 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 788, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 788,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 788, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 788, (Is_Empty => True));
end Initialize_788;
--------------------
-- Initialize_789 --
--------------------
procedure Initialize_789 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 789, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 789,
AMF.Internals.Tables.CMOF_String_Data_01.MS_01E8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 789, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 789, (Is_Empty => True));
end Initialize_789;
--------------------
-- Initialize_790 --
--------------------
procedure Initialize_790 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 790, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 790,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0082'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 790, (Is_Empty => True));
end Initialize_790;
--------------------
-- Initialize_791 --
--------------------
procedure Initialize_791 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 791, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 791,
AMF.Internals.Tables.CMOF_String_Data_02.MS_0200'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 791, (Is_Empty => True));
end Initialize_791;
--------------------
-- Initialize_792 --
--------------------
procedure Initialize_792 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 792, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 792,
AMF.Internals.Tables.CMOF_String_Data_01.MS_011C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 792, (Is_Empty => True));
end Initialize_792;
--------------------
-- Initialize_793 --
--------------------
procedure Initialize_793 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 793, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 793,
AMF.Internals.Tables.CMOF_String_Data_01.MS_010F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 793, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 793, (Is_Empty => True));
end Initialize_793;
--------------------
-- Initialize_794 --
--------------------
procedure Initialize_794 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 794, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 794,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0180'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 794, (Is_Empty => True));
end Initialize_794;
--------------------
-- Initialize_795 --
--------------------
procedure Initialize_795 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 795, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 795,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0168'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 795, (Is_Empty => True));
end Initialize_795;
--------------------
-- Initialize_796 --
--------------------
procedure Initialize_796 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 796, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 796,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0187'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 796, (Is_Empty => True));
end Initialize_796;
--------------------
-- Initialize_797 --
--------------------
procedure Initialize_797 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 797,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0032'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 797, (Is_Empty => True));
end Initialize_797;
--------------------
-- Initialize_798 --
--------------------
procedure Initialize_798 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 798, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 798, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 798,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0088'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 798, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 798, (Is_Empty => True));
end Initialize_798;
--------------------
-- Initialize_799 --
--------------------
procedure Initialize_799 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 799,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0110'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Value
(Base + 799,
AMF.Internals.Tables.CMOF_String_Data_01.MS_0162'Access);
end Initialize_799;
--------------------
-- Initialize_800 --
--------------------
procedure Initialize_800 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 800,
AMF.Internals.Tables.CMOF_String_Data_00.MS_0010'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Value
(Base + 800,
AMF.Internals.Tables.CMOF_String_Data_00.MS_006F'Access);
end Initialize_800;
end AMF.Internals.Tables.CMOF_Metamodel.Properties;
|
-----------------------------------------------------------------------
-- multipro -- Points out multiprocessor issues when incrementing counters
-- Copyright (C) 2010, 2011 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Log;
with Util.Log.Loggers;
with Util.Concurrent.Counters;
with Util.Measures;
with Ada.Text_IO;
procedure Multipro is
use Util.Log;
use Util.Concurrent.Counters;
Log : constant Loggers.Logger := Loggers.Create ("multipro");
-- Target counter value we would like.
Max_Counter : constant Integer := 10_000_000;
-- Max number of tasks for executing the concurrent increment.
Max_Tasks : constant Integer := 16;
-- Performance measurement.
Perf : Util.Measures.Measure_Set;
T : Util.Measures.Stamp;
begin
for Task_Count in 1 .. Max_Tasks loop
declare
-- Each task will increment the counter by the following amount.
Increment_By_Task : constant Integer := Max_Counter / Task_Count;
-- Counter not protected for concurrency access.
Unsafe : Integer := 0;
-- Counter protected by concurrent accesses.
Counter : Util.Concurrent.Counters.Counter;
begin
declare
-- A task that increments the shared counter <b>Unsafe</b> and <b>Counter</b> by
-- the specified amount.
task type Worker is
entry Start (Count : in Natural);
end Worker;
task body Worker is
Cnt : Natural;
begin
accept Start (Count : in Natural) do
Cnt := Count;
end Start;
-- Increment the two counters as many times as necessary.
for I in 1 .. Cnt loop
Util.Concurrent.Counters.Increment (Counter);
Unsafe := Unsafe + 1;
end loop;
end Worker;
type Worker_Array is array (1 .. Task_Count) of Worker;
Tasks : Worker_Array;
begin
Log.Info ("Starting " & Integer'Image (Task_Count) & " tasks");
for I in Tasks'Range loop
Tasks (I).Start (Increment_By_Task);
end loop;
-- Leaving the Worker task scope means we are waiting for our tasks to finish.
end;
Util.Measures.Report (Measures => Perf,
S => T,
Title => "Increment counter with "
& Integer'Image (Task_Count) & " tasks");
-- Unsafe will be equal to Counter if Task_Count = 1 or if the host is mono-processor.
-- On dual/quad core, the Unsafe value becomes random and gets lower each time
-- the number of tasks increases.
Log.Info ("Expected value at the end : "
& Integer'Image (Increment_By_Task * Task_Count));
Log.Info ("Counter value at the end : " & Integer'Image (Value (Counter)));
Log.Info ("Unprotected counter at the end : " & Integer'Image (Unsafe));
end;
end loop;
-- Dump the result
Util.Measures.Write (Perf, "Multipro", Ada.Text_IO.Standard_Output);
end Multipro;
|
with STM32_SVD; use STM32_SVD;
with STM32_SVD.GPIO;
with STM32_SVD.USB;
with STM32GD.USB; use STM32GD.USB;
with Ada.Interrupts.Names;
with System;
package body STM32GD.USB.Endpoint is
procedure Init is
begin
end Init;
end STM32GD.USB.Endpoint;
|
with BB_Pico_Bsp.STMPE811;
with BB_Pico_Bsp.SPI;
with BB_Pico_Bsp.LCD;
with RP.Device;
with RP.GPIO;
with Pico;
package body BB_Pico_Bsp.Touch is
Touch_CS : RP.GPIO.GPIO_Point renames Pico.GP7;
Device : BB_Pico_Bsp.STMPE811.STMPE811_Device
(Port => BB_Pico_Bsp.SPI.Port,
Chip_Select => Touch_CS'Access,
Time => RP.Device.Timer'Access);
--------------------------
-- Get_All_Touch_Points --
--------------------------
function Get_All_Touch_Points return HAL.Touch_Panel.TP_State is
begin
LCD.Wait_For_DMA;
BB_Pico_Bsp.SPI.Go_Slow;
declare
Result : constant HAL.Touch_Panel.TP_State :=
Device.Get_All_Touch_Points;
begin
BB_Pico_Bsp.SPI.Go_Fast;
return Result;
end;
end Get_All_Touch_Points;
begin
Touch_CS.Configure (RP.GPIO.Output, RP.GPIO.Pull_Up);
Touch_CS.Set;
LCD.Wait_For_DMA;
RP.Device.Timer.Delay_Milliseconds (1);
BB_Pico_Bsp.SPI.Go_Slow;
if not Device.Initialize then
raise Program_Error;
end if;
Device.Set_Bounds (Width => BB_Pico_Bsp.LCD.Height,
Height => BB_Pico_Bsp.LCD.Width,
Swap => HAL.Touch_Panel.Swap_XY);
BB_Pico_Bsp.SPI.Go_Fast;
end BB_Pico_Bsp.Touch;
|
------------------------------------------------------------------------------
-- Copyright (c) 2014-2017, Natacha Porté --
-- --
-- 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. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- IMPLEMENTATION NOTE: --
-- In case of synchronized callbacks (same Origin and Period), there is a --
-- collision on the internal map key. Since it is not expected to happen --
-- often, a simple but not-so-efficient solution is used: --
-- When a collision is encountered, the callback is replaced by an --
-- Event_List callback seeded with the existing callback and the new one. --
-- When removing a callback, if it's not found directly, and second linear --
-- is performed, looking for Event_List objects and removing it from them. --
------------------------------------------------------------------------------
package body Natools.Cron is
function Create_Event_List
(Ref_1, Ref_2 : Callback_Refs.Reference)
return Callback_Refs.Reference;
-- Create an Event_List object containing Ref_1 and Ref_2,
-- and return a reference to it.
------------------------
-- Helper Subprograms --
------------------------
function "<" (Left, Right : Periodic_Time) return Boolean is
use type Ada.Calendar.Time;
begin
return Left.Origin < Right.Origin
or else (Left.Origin = Right.Origin
and then Left.Period < Right.Period);
end "<";
function Create_Event_List
(Ref_1, Ref_2 : Callback_Refs.Reference)
return Callback_Refs.Reference
is
function Create return Callback'Class;
function Create return Callback'Class is
Result : Event_List;
begin
Result.Append (Ref_1);
Result.Append (Ref_2);
return Result;
end Create;
begin
return Callback_Refs.Create (Create'Access);
end Create_Event_List;
----------------------
-- Public Interface --
----------------------
function Create
(Time : in Periodic_Time;
Callback : in Cron.Callback'Class)
return Cron_Entry is
begin
return Result : Cron_Entry do
Result.Set (Time, Callback);
end return;
end Create;
function Create
(Origin : in Ada.Calendar.Time;
Callback : in Cron.Callback'Class)
return Cron_Entry is
begin
return Result : Cron_Entry do
Result.Set (Origin, Callback);
end return;
end Create;
function Create
(Period : in Duration;
Callback : in Cron.Callback'Class)
return Cron_Entry is
begin
return Result : Cron_Entry do
Result.Set (Period, Callback);
end return;
end Create;
procedure Set
(Self : in out Cron_Entry;
Time : in Periodic_Time;
Callback : in Cron.Callback'Class)
is
function Create return Cron.Callback'Class;
function Create return Cron.Callback'Class is
begin
return Callback;
end Create;
begin
Self.Reset;
Self.Callback.Replace (Create'Access);
Database.Insert (Time, Self.Callback);
end Set;
procedure Set
(Self : in out Cron_Entry;
Origin : in Ada.Calendar.Time;
Callback : in Cron.Callback'Class) is
begin
Set (Self, (Origin, 0.0), Callback);
end Set;
procedure Set
(Self : in out Cron_Entry;
Period : in Duration;
Callback : in Cron.Callback'Class) is
begin
Set (Self, (Ada.Calendar.Clock, Period), Callback);
end Set;
overriding procedure Finalize (Object : in out Cron_Entry) is
begin
if not Object.Callback.Is_Empty then
Object.Reset;
end if;
end Finalize;
procedure Reset (Self : in out Cron_Entry) is
begin
if not Self.Callback.Is_Empty then
Database.Remove (Self.Callback);
Self.Callback.Reset;
end if;
end Reset;
------------------------
-- Protected Database --
------------------------
protected body Database is
procedure Insert
(Time : in Periodic_Time;
Callback : in Callback_Refs.Reference)
is
use type Ada.Calendar.Time;
Now : constant Ada.Calendar.Time := Ada.Calendar.Clock;
Actual_Time : Periodic_Time := Time;
begin
if Actual_Time.Period > 0.0 then
while Actual_Time.Origin < Now loop
Actual_Time.Origin := Actual_Time.Origin + Actual_Time.Period;
end loop;
end if;
if Map.Is_Empty then
if Global_Worker /= null and then Global_Worker.all'Terminated then
Unchecked_Free (Global_Worker);
end if;
if Global_Worker = null then
Global_Worker := new Worker;
end if;
else
if Actual_Time < Map.First_Key then
First_Changed := True;
end if;
end if;
declare
Position : Entry_Maps.Cursor;
Inserted : Boolean;
Previous : Callback_Refs.Reference;
begin
Map.Insert (Actual_Time, Callback, Position, Inserted);
if not Inserted then
Previous := Entry_Maps.Element (Position);
if Previous.Query.Data.all in Event_List then
if Callback.Query.Data.all in Event_List then
for I of Event_List (Callback.Query.Data.all).List loop
Append (Event_List (Previous.Update.Data.all), I);
end loop;
else
Append
(Event_List (Previous.Update.Data.all),
Callback);
end if;
elsif Callback.Query.Data.all in Event_List then
Prepend (Event_List (Callback.Update.Data.all), Previous);
Map.Replace_Element (Position, Callback);
else
Map.Replace_Element
(Position,
Create_Event_List (Previous, Callback));
end if;
end if;
end;
end Insert;
procedure Remove (Callback : in Callback_Refs.Reference) is
use type Callback_Refs.Reference;
Cursor : Entry_Maps.Cursor := Map.First;
Is_First : Boolean := True;
begin
while Entry_Maps.Has_Element (Cursor) loop
if Entry_Maps.Element (Cursor) = Callback then
Map.Delete (Cursor);
if Is_First then
First_Changed := True;
end if;
return;
end if;
Entry_Maps.Next (Cursor);
Is_First := False;
end loop;
Is_First := True;
Cursor := Map.First;
while Entry_Maps.Has_Element (Cursor) loop
if Entry_Maps.Element (Cursor).Update.Data.all in Event_List then
declare
Mutator : constant Callback_Refs.Mutator
:= Entry_Maps.Element (Cursor).Update;
List : Event_List renames Event_List (Mutator.Data.all);
Removed : Boolean;
begin
List.Remove (Callback, Removed);
if Removed then
if List.Is_Empty then
Map.Delete (Cursor);
if Is_First then
First_Changed := True;
end if;
end if;
return;
end if;
end;
end if;
Entry_Maps.Next (Cursor);
Is_First := False;
end loop;
end Remove;
procedure Update (Callback : in Callback_Refs.Reference) is
use type Callback_Refs.Reference;
Cursor : Entry_Maps.Cursor := Map.First;
begin
Search :
while Entry_Maps.Has_Element (Cursor) loop
if Entry_Maps.Element (Cursor) = Callback then
declare
Old_Time : constant Periodic_Time := Entry_Maps.Key (Cursor);
begin
Map.Delete (Cursor);
if Old_Time.Period > 0.0 then
Insert (Old_Time, Callback);
end if;
end;
exit Search;
end if;
Entry_Maps.Next (Cursor);
end loop Search;
end Update;
procedure Get_First
(Time : out Periodic_Time;
Callback : out Callback_Refs.Reference)
is
Cursor : constant Entry_Maps.Cursor := Map.First;
begin
if Entry_Maps.Has_Element (Cursor) then
Time := Entry_Maps.Key (Cursor);
Callback := Entry_Maps.Element (Cursor);
else
Callback := Callback_Refs.Null_Reference;
end if;
First_Changed := False;
end Get_First;
procedure Get_Event_List
(Source : in Event_List;
List : out Event_Lists.List) is
begin
List := Source.List;
end Get_Event_List;
entry Update_Notification when First_Changed is
begin
null;
end Update_Notification;
end Database;
-----------------
-- Worker Task --
-----------------
task body Worker is
Time : Periodic_Time;
Callback : Callback_Refs.Reference;
Waiting : Boolean;
begin
Main :
loop
Waiting := True;
Wait_Loop :
while Waiting loop
Database.Get_First (Time, Callback);
exit Main when Callback.Is_Empty;
select
Database.Update_Notification;
or
delay until Time.Origin;
Waiting := False;
end select;
end loop Wait_Loop;
Callback.Update.Data.Run;
Database.Update (Callback);
end loop Main;
end Worker;
----------------
-- Event List --
----------------
overriding procedure Run (Self : in out Event_List) is
Local_List : Event_Lists.List;
begin
Database.Get_Event_List (Self, Local_List);
for Ref of Local_List loop
Ref.Update.Data.Run;
end loop;
end Run;
procedure Append
(Self : in out Event_List;
Ref : in Callback_Refs.Reference) is
begin
Self.List.Append (Ref);
end Append;
procedure Prepend
(Self : in out Event_List;
Ref : in Callback_Refs.Reference) is
begin
Self.List.Prepend (Ref);
end Prepend;
procedure Remove
(Self : in out Event_List;
Ref : in Callback_Refs.Reference;
Removed : out Boolean)
is
use type Callback_Refs.Reference;
Cursor : Event_Lists.Cursor := Self.List.First;
begin
Removed := False;
while Event_Lists.Has_Element (Cursor) loop
if Event_Lists.Element (Cursor) = Ref then
Self.List.Delete (Cursor);
Removed := True;
return;
end if;
Event_Lists.Next (Cursor);
end loop;
end Remove;
function Is_Empty (Self : Event_List) return Boolean is
begin
return Self.List.Is_Empty;
end Is_Empty;
end Natools.Cron;
|
-- { dg-do compile }
-- { dg-options "-gnat2012" }
function Recursive_Call (File : String; Status : out Boolean) return Boolean is
begin
if File /= "/dev/null" then
return Recursive_Call ("/dev/null", Status);
end if;
return False;
end;
|
-- { dg-do compile }
with Ada.Finalization; use Ada.Finalization;
procedure finalized is
type Rec is new Controlled with null record;
Obj : access Rec := new Rec'(Controlled with null record);
begin
null;
end;
|
-- Simple file opener and writer.
-- João Villaça - ICMC/USP - March, 2019.
WITH Ada.Sequential_IO;
PROCEDURE TEST1 is
PACKAGE Seq_Float_IO is new Ada.Sequential_IO (Element_Type => float);
blank, container : Seq_Float_IO.File_Type;
str : CONSTANT String := "stream_init.dat";
ord : CONSTANT String := "ordinate.mif";
BEGIN
PROCEDURE Open_Data(File : in out Seq_Float_IO.File_Type; Name : in String) is
BEGIN
Seq_Float_IO.Open (
File => File,
Mode => Seq_Float_IO.Append_File,
Name => str );
EXCEPTION
WHEN Seq_Float_IO.Name_Error =>
Seq_Float_IO.Create (
File => File,
Mode => Seq_Float_IO.Out_File,
Name => str);
END;
END Open_Data;
x : CONSTANT float := 2.0;
BEGIN -- bloco principal do programa
Open_Data(File => blank, Name => str);
Seq_Float_IO.Write(File => blank, Item => x);
Seq_Float_IO.Close(File => blank);
Open_Data(File => container, Name => ord);
Seq_Float_IO.Write(File => container, Item => x);
Seq_Float_IO.Close(File => container);
END TEST1;
|
with
openGL.Program,
openGL.Tasks,
openGL.Errors,
GL.lean,
GL.Pointers,
interfaces.C.Strings;
package body openGL.Variable.uniform
is
use GL.lean,
Interfaces;
---------
-- Forge
--
procedure define (Self : in out Item; Program : access openGL.Program.item'Class;
Name : in String)
is
use GL.Pointers, C;
the_Name : C.Strings.chars_ptr := C.Strings.new_String (Name);
begin
Tasks.check;
Self.gl_Variable := glGetUniformLocation (Program.gl_Program,
to_GLchar_access (the_Name));
Errors.log;
C.Strings.free (the_Name);
if Self.gl_Variable = -1
then
raise openGL.Error with "Unable to get location for uniform named '" & Name & "'";
end if;
end define;
overriding
procedure destroy (Self : in out Item)
is
begin
null;
end destroy;
-----------
-- Actuals
--
-- bool
--
procedure Value_is (Self : in bool; Now : in Boolean)
is
begin
Tasks.check;
glUniform1i (Self.gl_Variable,
Boolean'Pos (Now));
Errors.log;
end Value_is;
-- int
--
procedure Value_is (Self : in int; Now : in Integer)
is
begin
Tasks.check;
glUniform1i (Self.gl_Variable,
gl.GLint (Now));
Errors.log;
end Value_is;
-- float
--
procedure Value_is (Self : in float; Now : in Real)
is
begin
Tasks.check;
glUniform1fv (Self.gl_Variable,
1,
Now'Address);
Errors.log;
end Value_is;
-- vec3
--
procedure Value_is (Self : in vec3; Now : in Vector_3)
is
begin
Tasks.check;
glUniform3fv (Self.gl_Variable,
1,
Now (1)'Address);
Errors.log;
end Value_is;
-- vec4
--
procedure Value_is (Self : in vec4; Now : in Vector_4)
is
begin
Tasks.check;
glUniform4fv (Self.gl_Variable,
1,
Now (1)'Address);
Errors.log;
end Value_is;
-- mat3
--
procedure Value_is (Self : in mat3; Now : in Matrix_3x3)
is
begin
Tasks.check;
glUniformMatrix3fv (Self.gl_Variable,
1,
gl.GL_FALSE,
Now (1, 1)'Address);
Errors.log;
end Value_is;
-- mat4
--
procedure Value_is (Self : in mat4; Now : in Matrix_4x4)
is
begin
Tasks.check;
glUniformMatrix4fv (Self.gl_Variable,
1,
gl.GL_FALSE,
Now (1, 1)'Address);
Errors.log;
end Value_is;
end openGL.Variable.uniform;
|
with Ada.Text_IO;
with file_crypter;
with byte_package;
with Ada.Command_Line;
with System.os_lib;
with Ada.Exceptions;
procedure vibecrypt is
in_file : byte_package.byte_io.File_Type;
out_file : byte_package.byte_io.File_Type;
mode : file_crypter.mode;
password : file_crypter.key_s;
procedure help is
begin
Ada.text_io.put_line(
"Vibecrypt is very simple tool to encrypt/decrypt your file." & ASCII.FF & ASCII.CR &
"Written in Ada. Uses Raiden cypher (http://raiden-cipher.sourceforge.net/)" & ASCII.FF & ASCII.CR &
"Help:" & ASCII.FF & ASCII.CR &
" vibecrypter -h" & ASCII.FF & ASCII.CR &
"Usage:" & ASCII.FF & ASCII.CR &
" vibecrypt key -e|-d in_file out_file [-r]" & ASCII.FF & ASCII.CR &
" key: length from 6 to 16 characters." & ASCII.FF & ASCII.CR &
" if length < 16 - will be supplemented with underscores ('_')." & ASCII.FF & ASCII.CR &
" if length > 16 - will be truncated to 16 characters" & ASCII.FF & ASCII.CR &
" -e: encryption" & ASCII.FF & ASCII.CR &
" -d: decryption" & ASCII.FF & ASCII.CR &
" -r: rewrite file" & ASCII.FF & ASCII.CR &
"Example:" & ASCII.FF & ASCII.CR &
" vibecrypt " & '"' & "0123456789abcdef" & '"' & "-e test_m.txt test_c.txt -r" & ASCII.FF & ASCII.CR &
"The key can contain one of the characters:" & ASCII.FF & ASCII.CR &
" ' ', '!', '" & '"' & "', '#', '$', '%', '&'," & ASCII.FF & ASCII.CR &
" ''', '(', ')', '*', '+', ',', '-', '.', '/', '0'," & ASCII.FF & ASCII.CR &
" '1', '2', '3', '4', '5', '6', '7', '8', '9', ':'," & ASCII.FF & ASCII.CR &
" ';', '<', '=', '>', '?', '@', 'A', 'B', 'C', 'D'," & ASCII.FF & ASCII.CR &
" 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N'," & ASCII.FF & ASCII.CR &
" 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X'," & ASCII.FF & ASCII.CR &
" 'Y', 'Z', '[', '\', ']', '^', '_', '`', 'a', 'b'," & ASCII.FF & ASCII.CR &
" 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l'," & ASCII.FF & ASCII.CR &
" 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v'," & ASCII.FF & ASCII.CR &
" 'w', 'x', 'y', 'z', '{', '|', '}', '~'");
end help;
begin
if Ada.Command_Line.Argument_Count = 1 and Ada.Command_Line.Argument(1) = "-h" then
help;
system.os_lib.os_exit(0);
elsif Ada.Command_Line.Argument_Count not in 4..5 then
Ada.text_io.put_line("see format");
system.os_lib.os_exit(0);
end if;
if Ada.Command_Line.Argument(1)'length < 6 then
Ada.text_io.put_line("Minimum key length - 6");
system.os_lib.os_exit(0);
elsif Ada.Command_Line.Argument(1)'length >= 16 then
password := Ada.Command_Line.Argument(1)(1..16);
else
password(1..Ada.Command_Line.Argument(1)'length) := Ada.Command_Line.Argument(1);
for i in (Ada.Command_Line.Argument(1)'length + 1)..16 loop
password(i) := character'val(character'pos(' ') + i);
end loop;
end if;
for i in 1..16 loop
if password(i) not in ' '..'~' then
Ada.text_io.put_line("The key contains an invalid character");
system.os_lib.os_exit(0);
end if;
end loop;
file_crypter.init_key(password);
if Ada.Command_Line.Argument(2) = "-e" then
mode := file_crypter.mode'(file_crypter.encrypt);
elsif Ada.Command_Line.Argument(2) = "-d" then
mode := file_crypter.mode'(file_crypter.decrypt);
else
Ada.text_io.put_line("The first argument must be -e or -d");
system.os_lib.os_exit(0);
end if;
if not system.os_lib.Is_Regular_File(Ada.Command_Line.Argument(3)) then
Ada.text_io.put_line(Ada.Command_Line.Argument(3) & " is not a regular file");
system.os_lib.os_exit(0);
else
byte_package.byte_io.open(in_file, byte_package.byte_io.In_File, Ada.Command_Line.Argument(3), "");
end if;
if Ada.Command_Line.Argument_Count = 5 then
if Ada.Command_Line.Argument(5) /= "-r" then
Ada.text_io.put_line("The fifth argument can be only -r");
system.os_lib.os_exit(0);
end if;
if not system.os_lib.Is_Writable_File(Ada.Command_Line.Argument(4)) then
Ada.text_io.put_line(Ada.Command_Line.Argument(4) & " is not a writable file");
system.os_lib.os_exit(0);
end if;
byte_package.byte_io.open(out_file, byte_package.byte_io.Out_File, Ada.Command_Line.Argument(4), "");
else
if system.os_lib.Is_Regular_File(Ada.Command_Line.Argument(4)) then
Ada.text_io.put_line(Ada.Command_Line.Argument(4) & " already exists. Use -r to overwrite");
system.os_lib.os_exit(0);
end if;
byte_package.byte_io.create(out_file, byte_package.byte_io.Out_File, Ada.Command_Line.Argument(4), "");
end if;
file_crypter.file_crypt(in_file, out_file, mode);
byte_package.byte_io.close(in_file);
byte_package.byte_io.close(out_file);
exception
when Error: others =>
Ada.Text_IO.Put_Line("Error: " & Ada.Exceptions.Exception_Message(Error));
end vibecrypt;
|
-- Copyright 2015 Steven Stewart-Gallus
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-- implied. See the License for the specific language governing
-- permissions and limitations under the License.
with Interfaces.C.Strings;
with System;
with Libc.Sys.Types;
with Libc.Time;
with Libc.Time.GNU;
package Libc.Signal.GNU with
Spark_Mode => Off is
pragma Preelaborate;
-- unsupported macro: si_pid _sifields._kill.si_pid
-- unsupported macro: si_uid _sifields._kill.si_uid
-- unsupported macro: si_timerid _sifields._timer.si_tid
-- unsupported macro: si_overrun _sifields._timer.si_overrun
-- unsupported macro: si_status _sifields._sigchld.si_status
-- unsupported macro: si_utime _sifields._sigchld.si_utime
-- unsupported macro: si_stime _sifields._sigchld.si_stime
-- unsupported macro: si_value _sifields._rt.si_sigval
-- unsupported macro: si_int _sifields._rt.si_sigval.sival_int
-- unsupported macro: si_ptr _sifields._rt.si_sigval.sival_ptr
-- unsupported macro: si_addr _sifields._sigfault.si_addr
-- unsupported macro: si_addr_lsb _sifields._sigfault.si_addr_lsb
-- unsupported macro: si_band _sifields._sigpoll.si_band
-- unsupported macro: si_fd _sifields._sigpoll.si_fd
-- unsupported macro: si_call_addr _sifields._sigsys._call_addr
-- unsupported macro: si_syscall _sifields._sigsys._syscall
-- unsupported macro: si_arch _sifields._sigsys._arch
-- unsupported macro: SI_ASYNCNL SI_ASYNCNL
-- unsupported macro: SI_TKILL SI_TKILL
-- unsupported macro: SI_SIGIO SI_SIGIO
-- unsupported macro: SI_ASYNCIO SI_ASYNCIO
-- unsupported macro: SI_MESGQ SI_MESGQ
-- unsupported macro: SI_TIMER SI_TIMER
-- unsupported macro: SI_QUEUE SI_QUEUE
-- unsupported macro: SI_USER SI_USER
-- unsupported macro: SI_KERNEL SI_KERNEL
-- unsupported macro: ILL_ILLOPC ILL_ILLOPC
-- unsupported macro: ILL_ILLOPN ILL_ILLOPN
-- unsupported macro: ILL_ILLADR ILL_ILLADR
-- unsupported macro: ILL_ILLTRP ILL_ILLTRP
-- unsupported macro: ILL_PRVOPC ILL_PRVOPC
-- unsupported macro: ILL_PRVREG ILL_PRVREG
-- unsupported macro: ILL_COPROC ILL_COPROC
-- unsupported macro: ILL_BADSTK ILL_BADSTK
-- unsupported macro: FPE_INTDIV FPE_INTDIV
-- unsupported macro: FPE_INTOVF FPE_INTOVF
-- unsupported macro: FPE_FLTDIV FPE_FLTDIV
-- unsupported macro: FPE_FLTOVF FPE_FLTOVF
-- unsupported macro: FPE_FLTUND FPE_FLTUND
-- unsupported macro: FPE_FLTRES FPE_FLTRES
-- unsupported macro: FPE_FLTINV FPE_FLTINV
-- unsupported macro: FPE_FLTSUB FPE_FLTSUB
-- unsupported macro: SEGV_MAPERR SEGV_MAPERR
-- unsupported macro: SEGV_ACCERR SEGV_ACCERR
-- unsupported macro: BUS_ADRALN BUS_ADRALN
-- unsupported macro: BUS_ADRERR BUS_ADRERR
-- unsupported macro: BUS_OBJERR BUS_OBJERR
-- unsupported macro: BUS_MCEERR_AR BUS_MCEERR_AR
-- unsupported macro: BUS_MCEERR_AO BUS_MCEERR_AO
-- unsupported macro: TRAP_BRKPT TRAP_BRKPT
-- unsupported macro: TRAP_TRACE TRAP_TRACE
-- unsupported macro: CLD_EXITED CLD_EXITED
-- unsupported macro: CLD_KILLED CLD_KILLED
-- unsupported macro: CLD_DUMPED CLD_DUMPED
-- unsupported macro: CLD_TRAPPED CLD_TRAPPED
-- unsupported macro: CLD_STOPPED CLD_STOPPED
-- unsupported macro: CLD_CONTINUED CLD_CONTINUED
-- unsupported macro: POLL_IN POLL_IN
-- unsupported macro: POLL_OUT POLL_OUT
-- unsupported macro: POLL_MSG POLL_MSG
-- unsupported macro: POLL_ERR POLL_ERR
-- unsupported macro: POLL_PRI POLL_PRI
-- unsupported macro: POLL_HUP POLL_HUP
-- unsupported macro: sigev_notify_function _sigev_un._sigev_thread._function
-- unsupported macro: sigev_notify_attributes _sigev_un._sigev_thread._attribute
-- unsupported macro: SIGEV_SIGNAL SIGEV_SIGNAL
-- unsupported macro: SIGEV_NONE SIGEV_NONE
-- unsupported macro: SIGEV_THREAD SIGEV_THREAD
-- unsupported macro: SIGEV_THREAD_ID SIGEV_THREAD_ID
type sigval (discr : unsigned := 0) is record
case discr is
when 0 =>
sival_int : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:34
when others =>
sival_ptr : System
.Address; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:35
end case;
end record;
pragma Convention (C_Pass_By_Copy, sigval);
pragma Unchecked_Union
(sigval); -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:32
subtype sigval_t is sigval;
type uu_sigset_t_uu_val_array is array (0 .. 15) of aliased unsigned_long;
type sigset_t is record
uu_val : aliased uu_sigset_t_uu_val_array; -- /usr/include/x86_64-linux-gnu/bits/sigset.h:29
end record;
pragma Convention
(C_Pass_By_Copy,
sigset_t); -- /usr/include/x86_64-linux-gnu/bits/sigset.h:30
type siginfo_t_u_pad_array is array (0 .. 27) of aliased int;
type anon_14;
type anon_15 is record
si_pid : aliased Libc.Sys.Types
.pid_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:76
si_uid : aliased Libc.Sys.Types
.uid_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:77
end record;
pragma Convention (C_Pass_By_Copy, anon_15);
type anon_16 is record
si_tid : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:83
si_overrun : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:84
si_sigval : sigval_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:85
end record;
pragma Convention (C_Pass_By_Copy, anon_16);
type anon_17 is record
si_pid : aliased Libc.Sys.Types
.pid_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:91
si_uid : aliased Libc.Sys.Types
.uid_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:92
si_sigval : sigval_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:93
end record;
pragma Convention (C_Pass_By_Copy, anon_17);
type anon_18 is record
si_pid : aliased Libc.Sys.Types
.pid_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:99
si_uid : aliased Libc.Sys.Types
.uid_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:100
si_status : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:101
si_utime : aliased Libc.Time
.clock_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:102
si_stime : aliased Libc.Time
.clock_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:103
end record;
pragma Convention (C_Pass_By_Copy, anon_18);
type anon_19 is record
si_addr : System
.Address; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:109
si_addr_lsb : aliased short; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:110
end record;
pragma Convention (C_Pass_By_Copy, anon_19);
type anon_20 is record
si_band : aliased long; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:116
si_fd : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:117
end record;
pragma Convention (C_Pass_By_Copy, anon_20);
type anon_21 is record
u_call_addr : System
.Address; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:123
u_syscall : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:124
u_arch : aliased unsigned; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:125
end record;
pragma Convention (C_Pass_By_Copy, anon_21);
type anon_14 (discr : unsigned := 0) is record
case discr is
when 0 =>
u_pad : aliased siginfo_t_u_pad_array; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:71
when 1 =>
u_kill : aliased anon_15; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:78
when 2 =>
u_timer : aliased anon_16; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:86
when 3 =>
u_rt : aliased anon_17; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:94
when 4 =>
u_sigchld : aliased anon_18; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:104
when 5 =>
u_sigfault : aliased anon_19; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:111
when 6 =>
u_sigpoll : aliased anon_20; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:118
when others =>
u_sigsys : aliased anon_21; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:126
end case;
end record;
pragma Convention (C_Pass_By_Copy, anon_14);
pragma Unchecked_Union (anon_14);
type siginfo_t is record
si_signo : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:64
si_errno : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:65
si_code : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:67
u_sifields : anon_14; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:127
end record;
pragma Convention
(C_Pass_By_Copy,
siginfo_t); -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:128
-- skipped anonymous struct anon_13
-- type sigevent_u_pad_array is array (0 .. 11) of aliased int;
-- type anon_30;
-- type anon_31 is record
-- u_function : access procedure (arg1 : sigval_t); -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:323
-- u_attribute : access Libc.Pthread.pthread_attr_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:324
-- end record;
-- pragma Convention (C_Pass_By_Copy, anon_31);
-- type anon_30 (discr : unsigned := 0) is record
-- case discr is
-- when 0 =>
-- u_pad : aliased sigevent_u_pad_array; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:315
-- when 1 =>
-- u_tid : aliased Libc.Sys.Types.pid_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:319
-- when others =>
-- u_sigev_thread : aliased anon_31; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:325
-- end case;
-- end record;
-- pragma Convention (C_Pass_By_Copy, anon_30);
-- pragma Unchecked_Union (anon_30);
-- type sigevent is record
-- sigev_value : sigval_t; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:309
-- sigev_signo : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:310
-- sigev_notify : aliased int; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:311
-- u_sigev_un : anon_30; -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:326
-- end record;
-- pragma Convention (C_Pass_By_Copy, sigevent); -- /usr/include/x86_64-linux-gnu/bits/siginfo.h:307
-- subtype sigevent_t is sigevent;
-- unsupported macro: sa_handler __sigaction_handler.sa_handler
-- unsupported macro: sa_sigaction __sigaction_handler.sa_sigaction
-- unsupported macro: SA_NOCLDSTOP 1
-- unsupported macro: SA_NOCLDWAIT 2
-- unsupported macro: SA_SIGINFO 4
-- unsupported macro: SA_ONSTACK 0x08000000
-- unsupported macro: SA_RESTART 0x10000000
-- unsupported macro: SA_NODEFER 0x40000000
-- unsupported macro: SA_RESETHAND 0x80000000
-- unsupported macro: SA_INTERRUPT 0x20000000
-- unsupported macro: SA_NOMASK SA_NODEFER
-- unsupported macro: SA_ONESHOT SA_RESETHAND
-- unsupported macro: SA_STACK SA_ONSTACK
-- unsupported macro: SIG_BLOCK 0
-- unsupported macro: SIG_UNBLOCK 1
-- unsupported macro: SIG_SETMASK 2
type anon_13 (discr : unsigned := 0) is record
case discr is
when others =>
sa_sigaction : access procedure
(arg1 : int;
arg2 : access int;
arg3 : System
.Address); -- /usr/include/x86_64-linux-gnu/bits/sigaction.h:33
end case;
end record;
pragma Convention (C_Pass_By_Copy, anon_13);
pragma Unchecked_Union (anon_13);
type sigaction is record
uu_sigaction_handler : anon_13; -- /usr/include/x86_64-linux-gnu/bits/sigaction.h:35
sa_mask : aliased sigset_t; -- /usr/include/x86_64-linux-gnu/bits/sigaction.h:43
sa_flags : aliased int; -- /usr/include/x86_64-linux-gnu/bits/sigaction.h:46
sa_restorer : access procedure; -- /usr/include/x86_64-linux-gnu/bits/sigaction.h:49
end record;
pragma Convention
(C_Pass_By_Copy,
sigaction); -- /usr/include/x86_64-linux-gnu/bits/sigaction.h:24
-- unsupported macro: FP_XSTATE_MAGIC1 0x46505853U
-- unsupported macro: FP_XSTATE_MAGIC2 0x46505845U
-- unsupported macro: FP_XSTATE_MAGIC2_SIZE sizeof(FP_XSTATE_MAGIC2)
type u_fpx_sw_bytes is record
null;
end record;
pragma Convention
(C_Pass_By_Copy,
u_fpx_sw_bytes); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:29
type u_fpreg_significand_array is array (0 .. 3) of aliased unsigned_short;
type u_fpreg is record
significand : aliased u_fpreg_significand_array; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:40
exponent : aliased unsigned_short; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:41
end record;
pragma Convention
(C_Pass_By_Copy,
u_fpreg); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:38
type u_fpxreg_significand_array is array (0 .. 3) of aliased unsigned_short;
type u_fpxreg_padding_array is array (0 .. 2) of aliased unsigned_short;
type u_fpxreg is record
significand : aliased u_fpxreg_significand_array; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:46
exponent : aliased unsigned_short; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:47
padding : aliased u_fpxreg_padding_array; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:48
end record;
pragma Convention
(C_Pass_By_Copy,
u_fpxreg); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:44
type u_xmmreg is record
null;
end record;
pragma Convention
(C_Pass_By_Copy,
u_xmmreg); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:51
type u_fpstate_u_st_array is array (0 .. 7) of aliased u_fpxreg;
type u_fpstate_u_xmm_array is array (0 .. 15) of aliased u_xmmreg;
type u_fpstate is record
u_st : aliased u_fpstate_u_st_array; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:132
u_xmm : aliased u_fpstate_u_xmm_array; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:133
end record;
pragma Convention
(C_Pass_By_Copy,
u_fpstate); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:121
type anon_0 (discr : unsigned := 0) is record
case discr is
when others =>
fpstate : access u_fpstate; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:167
end case;
end record;
pragma Convention (C_Pass_By_Copy, anon_0);
pragma Unchecked_Union (anon_0);
type sigcontext is record
cs : aliased unsigned_short; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:157
gs : aliased unsigned_short; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:158
fs : aliased unsigned_short; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:159
uu_pad0 : aliased unsigned_short; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:160
field_5 : aliased anon_0;
end record;
pragma Convention
(C_Pass_By_Copy,
sigcontext); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:137
type u_xsave_hdr is record
null;
end record;
pragma Convention
(C_Pass_By_Copy,
u_xsave_hdr); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:175
type u_ymmh_state is record
null;
end record;
pragma Convention
(C_Pass_By_Copy,
u_ymmh_state); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:182
type u_xstate is record
fpstate : aliased u_fpstate; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:189
xstate_hdr : aliased u_xsave_hdr; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:190
ymmh : aliased u_ymmh_state; -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:191
end record;
pragma Convention
(C_Pass_By_Copy,
u_xstate); -- /usr/include/x86_64-linux-gnu/bits/sigcontext.h:187
-- arg-macro: procedure sigmask (sig)
-- __sigmask(sig)
-- unsupported macro: NSIG _NSIG
-- unsupported macro: sv_onstack sv_flags
-- unsupported macro: SV_ONSTACK (1 << 0)
-- unsupported macro: SV_INTERRUPT (1 << 1)
-- unsupported macro: SV_RESETHAND (1 << 2)
-- unsupported macro: SS_ONSTACK SS_ONSTACK
-- unsupported macro: SS_DISABLE SS_DISABLE
-- unsupported macro: MINSIGSTKSZ 2048
-- unsupported macro: SIGSTKSZ 8192
type sigstack is record
ss_sp : System
.Address; -- /usr/include/x86_64-linux-gnu/bits/sigstack.h:27
ss_onstack : aliased int; -- /usr/include/x86_64-linux-gnu/bits/sigstack.h:28
end record;
pragma Convention
(C_Pass_By_Copy,
sigstack); -- /usr/include/x86_64-linux-gnu/bits/sigstack.h:25
type sigaltstack is record
ss_sp : System
.Address; -- /usr/include/x86_64-linux-gnu/bits/sigstack.h:51
ss_flags : aliased int; -- /usr/include/x86_64-linux-gnu/bits/sigstack.h:52
end record;
pragma Convention
(C_Pass_By_Copy,
sigaltstack); -- /usr/include/x86_64-linux-gnu/bits/sigstack.h:49
subtype stack_t is sigaltstack;
function sysv_signal
(sig : int;
handler : sighandler_t) return sighandler_t; -- /usr/include/signal.h:93
pragma Import (C, sysv_signal, "sysv_signal");
function bsd_signal
(sig : int;
handler : sighandler_t)
return sighandler_t; -- /usr/include/signal.h:119
pragma Import (C, bsd_signal, "bsd_signal");
function kill
(pid : Libc.Sys.Types.pid_t;
sig : int) return int; -- /usr/include/signal.h:127
pragma Import (C, kill, "kill");
function killpg
(pgrp : Libc.Sys.Types.pid_t;
sig : int) return int; -- /usr/include/signal.h:134
pragma Import (C, killpg, "killpg");
function ssignal
(sig : int;
handler : sighandler_t)
return sighandler_t; -- /usr/include/signal.h:144
pragma Import (C, ssignal, "ssignal");
function gsignal (sig : int) return int; -- /usr/include/signal.h:146
pragma Import (C, gsignal, "gsignal");
procedure psignal
(sig : int;
s : Interfaces.C.Strings.chars_ptr); -- /usr/include/signal.h:151
pragma Import (C, psignal, "psignal");
procedure psiginfo
(pinfo : access constant siginfo_t;
s : Interfaces.C.Strings.chars_ptr); -- /usr/include/signal.h:156
pragma Import (C, psiginfo, "psiginfo");
function sigpause (sig : int) return int; -- /usr/include/signal.h:171
pragma Import (C, sigpause, "__xpg_sigpause");
function sigblock (mask : int) return int; -- /usr/include/signal.h:189
pragma Import (C, sigblock, "sigblock");
function sigsetmask (mask : int) return int; -- /usr/include/signal.h:192
pragma Import (C, sigsetmask, "sigsetmask");
function siggetmask return int; -- /usr/include/signal.h:195
pragma Import (C, siggetmask, "siggetmask");
subtype sig_t is sighandler_t; -- /usr/include/signal.h:209
function sigemptyset
(set : access sigset_t) return int; -- /usr/include/signal.h:215
pragma Import (C, sigemptyset, "sigemptyset");
function sigfillset
(set : access sigset_t) return int; -- /usr/include/signal.h:218
pragma Import (C, sigfillset, "sigfillset");
function sigaddset
(set : access sigset_t;
signo : int) return int; -- /usr/include/signal.h:221
pragma Import (C, sigaddset, "sigaddset");
function sigdelset
(set : access sigset_t;
signo : int) return int; -- /usr/include/signal.h:224
pragma Import (C, sigdelset, "sigdelset");
function sigismember
(set : System.Address;
signo : int) return int; -- /usr/include/signal.h:227
pragma Import (C, sigismember, "sigismember");
function sigisemptyset
(set : System.Address) return int; -- /usr/include/signal.h:232
pragma Import (C, sigisemptyset, "sigisemptyset");
function sigandset
(set : access sigset_t;
left : System.Address;
right : System.Address) return int; -- /usr/include/signal.h:235
pragma Import (C, sigandset, "sigandset");
function sigorset
(set : access sigset_t;
left : System.Address;
right : System.Address) return int; -- /usr/include/signal.h:239
pragma Import (C, sigorset, "sigorset");
function sigprocmask
(how : int;
set : System.Address;
oset : access sigset_t) return int; -- /usr/include/signal.h:248
pragma Import (C, sigprocmask, "sigprocmask");
function sigsuspend
(set : System.Address) return int; -- /usr/include/signal.h:256
pragma Import (C, sigsuspend, "sigsuspend");
function f_sigaction
(sig : int;
act : access constant sigaction;
oact : access sigaction) return int; -- /usr/include/signal.h:259
pragma Import (C, f_sigaction, "sigaction");
function sigpending
(set : access sigset_t) return int; -- /usr/include/signal.h:263
pragma Import (C, sigpending, "sigpending");
function sigwait
(set : System.Address;
sig : access int) return int; -- /usr/include/signal.h:270
pragma Import (C, sigwait, "sigwait");
function sigwaitinfo
(set : System.Address;
info : access siginfo_t) return int; -- /usr/include/signal.h:278
pragma Import (C, sigwaitinfo, "sigwaitinfo");
function sigtimedwait
(set : System.Address;
info : access siginfo_t;
timeout : access constant Libc.Time.GNU.timespec)
return int; -- /usr/include/signal.h:286
pragma Import (C, sigtimedwait, "sigtimedwait");
function sigqueue
(pid : Libc.Sys.Types.pid_t;
sig : int;
val : sigval) return int; -- /usr/include/signal.h:293
pragma Import (C, sigqueue, "sigqueue");
sys_siglist : aliased array
(0 .. 64) of Interfaces.C.Strings.chars_ptr; -- /usr/include/signal.h:304
pragma Import (C, sys_siglist, "sys_siglist");
type sigvec is record
sv_handler : sighandler_t; -- /usr/include/signal.h:309
sv_mask : aliased int; -- /usr/include/signal.h:310
sv_flags : aliased int; -- /usr/include/signal.h:312
end record;
pragma Convention (C_Pass_By_Copy, sigvec); -- /usr/include/signal.h:307
function f_sigvec
(sig : int;
vec : access constant sigvec;
ovec : access sigvec) return int; -- /usr/include/signal.h:327
pragma Import (C, f_sigvec, "f_sigvec");
function sigreturn
(scp : access sigcontext) return int; -- /usr/include/signal.h:335
pragma Import (C, sigreturn, "sigreturn");
function siginterrupt
(sig : int;
interrupt : int) return int; -- /usr/include/signal.h:347
pragma Import (C, siginterrupt, "siginterrupt");
function f_sigstack
(ss : access sigstack;
oss : access sigstack) return int; -- /usr/include/signal.h:358
pragma Import (C, f_sigstack, "sigstack");
function f_sigaltstack
(ss : access constant sigaltstack;
oss : access sigaltstack) return int; -- /usr/include/signal.h:363
pragma Import (C, f_sigaltstack, "sigaltstack");
function sighold (sig : int) return int; -- /usr/include/signal.h:372
pragma Import (C, sighold, "sighold");
function sigrelse (sig : int) return int; -- /usr/include/signal.h:375
pragma Import (C, sigrelse, "sigrelse");
function sigignore (sig : int) return int; -- /usr/include/signal.h:378
pragma Import (C, sigignore, "sigignore");
function sigset
(sig : int;
disp : sighandler_t) return sighandler_t; -- /usr/include/signal.h:381
pragma Import (C, sigset, "sigset");
end Libc.Signal.GNU;
|
--
-- Copyright (C) 2019, AdaCore
--
-- This spec has been automatically generated from ATSAMV71Q21.svd
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
-- Microchip ATSAMV71Q21 Microcontroller
package Interfaces.SAM is
pragma Preelaborate;
pragma No_Elaboration_Code_All;
---------------
-- Base type --
---------------
type UInt32 is new Interfaces.Unsigned_32;
type UInt16 is new Interfaces.Unsigned_16;
type Byte is new Interfaces.Unsigned_8;
type Bit is mod 2**1
with Size => 1;
type UInt2 is mod 2**2
with Size => 2;
type UInt3 is mod 2**3
with Size => 3;
type UInt4 is mod 2**4
with Size => 4;
type UInt5 is mod 2**5
with Size => 5;
type UInt6 is mod 2**6
with Size => 6;
type UInt7 is mod 2**7
with Size => 7;
type UInt9 is mod 2**9
with Size => 9;
type UInt10 is mod 2**10
with Size => 10;
type UInt11 is mod 2**11
with Size => 11;
type UInt12 is mod 2**12
with Size => 12;
type UInt13 is mod 2**13
with Size => 13;
type UInt14 is mod 2**14
with Size => 14;
type UInt15 is mod 2**15
with Size => 15;
type UInt17 is mod 2**17
with Size => 17;
type UInt18 is mod 2**18
with Size => 18;
type UInt19 is mod 2**19
with Size => 19;
type UInt20 is mod 2**20
with Size => 20;
type UInt21 is mod 2**21
with Size => 21;
type UInt22 is mod 2**22
with Size => 22;
type UInt23 is mod 2**23
with Size => 23;
type UInt24 is mod 2**24
with Size => 24;
type UInt25 is mod 2**25
with Size => 25;
type UInt26 is mod 2**26
with Size => 26;
type UInt27 is mod 2**27
with Size => 27;
type UInt28 is mod 2**28
with Size => 28;
type UInt29 is mod 2**29
with Size => 29;
type UInt30 is mod 2**30
with Size => 30;
type UInt31 is mod 2**31
with Size => 31;
--------------------
-- Base addresses --
--------------------
ACC_Base : constant System.Address :=
System'To_Address (16#40044000#);
AES_Base : constant System.Address :=
System'To_Address (16#4006C000#);
AFEC0_Base : constant System.Address :=
System'To_Address (16#4003C000#);
AFEC1_Base : constant System.Address :=
System'To_Address (16#40064000#);
CHIPID_Base : constant System.Address :=
System'To_Address (16#400E0940#);
DACC_Base : constant System.Address :=
System'To_Address (16#40040000#);
EFC_Base : constant System.Address :=
System'To_Address (16#400E0C00#);
GMAC_Base : constant System.Address :=
System'To_Address (16#40050000#);
GPBR_Base : constant System.Address :=
System'To_Address (16#400E1890#);
HSMCI_Base : constant System.Address :=
System'To_Address (16#40000000#);
ICM_Base : constant System.Address :=
System'To_Address (16#40048000#);
ISI_Base : constant System.Address :=
System'To_Address (16#4004C000#);
MATRIX_Base : constant System.Address :=
System'To_Address (16#40088000#);
MCAN0_Base : constant System.Address :=
System'To_Address (16#40030000#);
MCAN1_Base : constant System.Address :=
System'To_Address (16#40034000#);
MLB_Base : constant System.Address :=
System'To_Address (16#40068000#);
PIOA_Base : constant System.Address :=
System'To_Address (16#400E0E00#);
PIOB_Base : constant System.Address :=
System'To_Address (16#400E1000#);
PIOC_Base : constant System.Address :=
System'To_Address (16#400E1200#);
PIOD_Base : constant System.Address :=
System'To_Address (16#400E1400#);
PIOE_Base : constant System.Address :=
System'To_Address (16#400E1600#);
PMC_Base : constant System.Address :=
System'To_Address (16#400E0600#);
PWM0_Base : constant System.Address :=
System'To_Address (16#40020000#);
PWM1_Base : constant System.Address :=
System'To_Address (16#4005C000#);
QSPI_Base : constant System.Address :=
System'To_Address (16#4007C000#);
RSTC_Base : constant System.Address :=
System'To_Address (16#400E1800#);
RSWDT_Base : constant System.Address :=
System'To_Address (16#400E1900#);
RTC_Base : constant System.Address :=
System'To_Address (16#400E1860#);
RTT_Base : constant System.Address :=
System'To_Address (16#400E1830#);
SDRAMC_Base : constant System.Address :=
System'To_Address (16#40084000#);
SMC_Base : constant System.Address :=
System'To_Address (16#40080000#);
SPI0_Base : constant System.Address :=
System'To_Address (16#40008000#);
SPI1_Base : constant System.Address :=
System'To_Address (16#40058000#);
SSC_Base : constant System.Address :=
System'To_Address (16#40004000#);
SUPC_Base : constant System.Address :=
System'To_Address (16#400E1810#);
TC0_Base : constant System.Address :=
System'To_Address (16#4000C000#);
TC1_Base : constant System.Address :=
System'To_Address (16#40010000#);
TC2_Base : constant System.Address :=
System'To_Address (16#40014000#);
TC3_Base : constant System.Address :=
System'To_Address (16#40054000#);
TRNG_Base : constant System.Address :=
System'To_Address (16#40070000#);
TWIHS0_Base : constant System.Address :=
System'To_Address (16#40018000#);
TWIHS1_Base : constant System.Address :=
System'To_Address (16#4001C000#);
TWIHS2_Base : constant System.Address :=
System'To_Address (16#40060000#);
UART0_Base : constant System.Address :=
System'To_Address (16#400E0800#);
UART1_Base : constant System.Address :=
System'To_Address (16#400E0A00#);
UART2_Base : constant System.Address :=
System'To_Address (16#400E1A00#);
UART3_Base : constant System.Address :=
System'To_Address (16#400E1C00#);
UART4_Base : constant System.Address :=
System'To_Address (16#400E1E00#);
USART0_Base : constant System.Address :=
System'To_Address (16#40024000#);
USART1_Base : constant System.Address :=
System'To_Address (16#40028000#);
USART2_Base : constant System.Address :=
System'To_Address (16#4002C000#);
USBHS_Base : constant System.Address :=
System'To_Address (16#40038000#);
UTMI_Base : constant System.Address :=
System'To_Address (16#400E0400#);
WDT_Base : constant System.Address :=
System'To_Address (16#400E1850#);
XDMAC_Base : constant System.Address :=
System'To_Address (16#40078000#);
LOCKBIT_Base : constant System.Address :=
System'To_Address (16#0#);
SystemControl_Base : constant System.Address :=
System'To_Address (16#E000E000#);
SysTick_Base : constant System.Address :=
System'To_Address (16#E000E010#);
NVIC_Base : constant System.Address :=
System'To_Address (16#E000E100#);
MPU_Base : constant System.Address :=
System'To_Address (16#E000ED90#);
FPU_Base : constant System.Address :=
System'To_Address (16#E000EF34#);
end Interfaces.SAM;
|
------------------------------------------------------------------------------
-- Copyright (c) 2014, Natacha Porté --
-- --
-- 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. --
------------------------------------------------------------------------------
package body Natools.S_Expressions.File_Readers is
package Stream_IO renames Ada.Streams.Stream_IO;
overriding procedure Finalize (Object : in out Autoclose) is
begin
if Stream_IO.Is_Open (Object.File) then
Stream_IO.Close (Object.File);
end if;
end Finalize;
-------------------------
-- S-Expression Reader --
-------------------------
function Reader (Name : String) return S_Reader is
begin
return Object : S_Reader do
Stream_IO.Open (Object.Holder.File, Stream_IO.In_File, Name);
Object.Next;
end return;
end Reader;
procedure Set_Filename (Object : in out S_Reader; Name : in String) is
begin
if Stream_IO.Is_Open (Object.Holder.File) then
Stream_IO.Close (Object.Holder.File);
end if;
Stream_IO.Open (Object.Holder.File, Stream_IO.In_File, Name);
Object.Rewind;
end Set_Filename;
procedure Rewind (Object : in out S_Reader) is
begin
Stream_IO.Set_Index (Object.Holder.File, 1);
Object.Reset;
Object.Next;
end Rewind;
overriding procedure Read_More
(Object : in out S_Reader;
Buffer : out Atom_Buffers.Atom_Buffer)
is
Data : Ada.Streams.Stream_Element_Array (0 .. 127);
Last : Ada.Streams.Stream_Element_Offset;
begin
Stream_IO.Read (Object.Holder.File, Data, Last);
if Last in Data'Range then
Buffer.Append (Data (Data'First .. Last));
end if;
end Read_More;
-----------------
-- Atom Reader --
-----------------
function Reader (Name : String) return Atom_Reader is
begin
return Object : Atom_Reader do
Stream_IO.Open (Object.File, Stream_IO.In_File, Name);
end return;
end Reader;
procedure Set_Filename (Object : in out Atom_Reader; Name : in String) is
begin
if Stream_IO.Is_Open (Object.File) then
Stream_IO.Close (Object.File);
end if;
Stream_IO.Open (Object.File, Stream_IO.In_File, Name);
end Set_Filename;
function Length (Object : Atom_Reader) return Count is
begin
return Count (Stream_IO.Size (Object.File));
end Length;
function Read (Object : Atom_Reader) return Atom is
Result : Atom (1 .. Object.Length);
Last : Count;
begin
Stream_IO.Set_Index (Object.File, 1);
Stream_IO.Read (Object.File, Result, Last);
pragma Assert (Last = Result'Last);
return Result;
end Read;
function Read (Object : Atom_Reader) return Atom_Refs.Reference is
Length : constant Count := Object.Length;
Result : constant Atom_Refs.Reference
:= Atom_Refs.Create (new Atom (1 .. Length));
Last : Count;
begin
Stream_IO.Set_Index (Object.File, 1);
Stream_IO.Read (Object.File, Result.Update.Data.all, Last);
pragma Assert (Last = Length);
return Result;
end Read;
procedure Read
(Object : in Atom_Reader;
Data : out Atom;
Length : out Count) is
begin
Stream_IO.Set_Index (Object.File, 1);
Stream_IO.Read (Object.File, Data, Length);
Length := Object.Length;
end Read;
procedure Read
(Object : in Atom_Reader;
Buffer : out Atom_Buffers.Atom_Buffer;
Block_Size : in Count := 1024)
is
Block : Atom (1 .. Block_Size);
Last : Count;
begin
Buffer.Soft_Reset;
Stream_IO.Set_Index (Object.File, 1);
loop
Stream_IO.Read (Object.File, Block, Last);
exit when Last not in Block'Range;
Buffer.Append (Block (Block'First .. Last));
end loop;
end Read;
procedure Query
(Object : in Atom_Reader;
Process : not null access procedure (Data : in Atom))
is
Buffer : Atom_Access := null;
Last : Count;
begin
Buffer := new Atom (1 .. Object.Length);
Stream_IO.Set_Index (Object.File, 1);
Stream_IO.Read (Object.File, Buffer.all, Last);
pragma Assert (Last = Buffer'Last);
Process (Buffer.all);
Unchecked_Deallocation (Buffer);
exception
when others =>
Unchecked_Deallocation (Buffer);
raise;
end Query;
procedure Block_Query
(Object : in Atom_Reader;
Block_Size : in Count;
Process : not null access procedure (Block : in Atom))
is
Block : Atom (1 .. Block_Size);
Last : Count;
begin
Stream_IO.Set_Index (Object.File, 1);
loop
Stream_IO.Read (Object.File, Block, Last);
exit when Last not in Block'Range;
Process.all (Block (Block'First .. Last));
end loop;
end Block_Query;
overriding procedure Finalize (Object : in out Atom_Reader) is
begin
if Stream_IO.Is_Open (Object.File) then
Stream_IO.Close (Object.File);
end if;
end Finalize;
end Natools.S_Expressions.File_Readers;
|
-- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../../License.txt
package AdaBase.Interfaces is
pragma Pure;
end AdaBase.Interfaces;
|
------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2013, 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- --
-- ware Foundation; either version 2, 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, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Ethernet driver
with Clkdrv;
with System; use System;
with System.Storage_Elements;
with Netcfg; use Netcfg;
with Netutils; use Netutils;
with System.Machine_Code; use System.Machine_Code;
with Dumps; use Dumps;
with Ada.Text_IO; use Ada.Text_IO;
-- with Netproto;
package body Ethdrv is
FEC_EIR : Unsigned_32;
for FEC_EIR'Address use System'To_Address (16#fff4_c004#);
pragma Import (Ada, FEC_EIR);
pragma Volatile (FEC_EIR);
EIR_RXF : constant := 16#0200_0000#;
EIR_RXB : constant := 16#0100_0000#;
FEC_RDAR : Unsigned_32;
for FEC_RDAR'Address use System'To_Address (16#fff4_c010#);
pragma Import (Ada, FEC_RDAR);
pragma Volatile (FEC_RDAR);
FEC_TDAR : Unsigned_32;
for FEC_TDAR'Address use System'To_Address (16#fff4_c014#);
pragma Import (Ada, FEC_TDAR);
pragma Volatile (FEC_TDAR);
FEC_ECR : Unsigned_32;
for FEC_ECR'Address use System'To_Address (16#fff4_c024#);
pragma Import (Ada, FEC_ECR);
pragma Volatile (FEC_ECR);
FEC_MMFR : Unsigned_32;
for FEC_MMFR'Address use System'To_Address (16#fff4_c040#);
pragma Import (Ada, FEC_MMFR);
pragma Volatile (FEC_MMFR);
FEC_MSCR : Unsigned_32;
for FEC_MSCR'Address use System'To_Address (16#fff4_c044#);
pragma Import (Ada, FEC_MSCR);
pragma Volatile (FEC_MSCR);
FEC_RCR : Unsigned_32;
for FEC_RCR'Address use System'To_Address (16#fff4_c084#);
pragma Import (Ada, FEC_RCR);
pragma Volatile (FEC_RCR);
FEC_TCR : Unsigned_32;
for FEC_TCR'Address use System'To_Address (16#fff4_c0c4#);
pragma Import (Ada, FEC_TCR);
pragma Volatile (FEC_TCR);
FEC_PALR : Unsigned_32;
for FEC_PALR'Address use System'To_Address (16#fff4_c0e4#);
pragma Import (Ada, FEC_PALR);
pragma Volatile (FEC_PALR);
FEC_PAUR : Unsigned_32;
for FEC_PAUR'Address use System'To_Address (16#fff4_c0e8#);
pragma Import (Ada, FEC_PAUR);
pragma Volatile (FEC_PAUR);
FEC_OPD : Unsigned_32;
for FEC_OPD'Address use System'To_Address (16#fff4_c0ec#);
pragma Import (Ada, FEC_OPD);
pragma Volatile (FEC_OPD);
FEC_IAUR : Unsigned_32;
for FEC_IAUR'Address use System'To_Address (16#fff4_c118#);
pragma Import (Ada, FEC_IAUR);
pragma Volatile (FEC_IAUR);
FEC_IALR : Unsigned_32;
for FEC_IALR'Address use System'To_Address (16#fff4_c11c#);
pragma Import (Ada, FEC_IALR);
pragma Volatile (FEC_IALR);
FEC_GAUR : Unsigned_32;
for FEC_GAUR'Address use System'To_Address (16#fff4_c120#);
pragma Import (Ada, FEC_GAUR);
pragma Volatile (FEC_GAUR);
FEC_GALR : Unsigned_32;
for FEC_GALR'Address use System'To_Address (16#fff4_c124#);
pragma Import (Ada, FEC_GALR);
pragma Volatile (FEC_GALR);
FEC_TFWR : Unsigned_32;
for FEC_TFWR'Address use System'To_Address (16#fff4_c144#);
pragma Import (Ada, FEC_TFWR);
pragma Volatile (FEC_TFWR);
FEC_ERDSR : Address;
for FEC_ERDSR'Address use System'To_Address (16#fff4_c180#);
pragma Import (Ada, FEC_ERDSR);
pragma Volatile (FEC_ERDSR);
FEC_ETDSR : Address;
for FEC_ETDSR'Address use System'To_Address (16#fff4_c184#);
pragma Import (Ada, FEC_ETDSR);
pragma Volatile (FEC_ETDSR);
FEC_EMRBR : Unsigned_32;
for FEC_EMRBR'Address use System'To_Address (16#fff4_c188#);
pragma Import (Ada, FEC_EMRBR);
pragma Volatile (FEC_EMRBR);
SIU_PCR : array (0 .. 230) of Unsigned_16;
for SIU_PCR'Address use System'To_Address (16#c3f9_0040#);
pragma Import (Ada, SIU_PCR);
pragma Volatile (SIU_PCR);
EBI_MCR : Unsigned_32;
for EBI_MCR'Address use System'To_Address (16#c3f8_4000#);
pragma Import (Ada, EBI_MCR);
pragma Volatile (EBI_MCR);
type TRxbd_Type is record
Flags : Unsigned_16;
Len : Unsigned_16;
Buffer : Address;
end record;
pragma Warnings (Off, "* not referenced");
Flag_E : constant := 2#1000_0000_0000_0000#;
Flag_R : constant := 2#1000_0000_0000_0000#;
Flag_RO1 : constant := 2#0100_0000_0000_0000#;
Flag_TO1 : constant := 2#0100_0000_0000_0000#;
Flag_W : constant := 2#0010_0000_0000_0000#;
Flag_RO2 : constant := 2#0001_0000_0000_0000#;
Flag_TO2 : constant := 2#0001_0000_0000_0000#;
Flag_L : constant := 2#0000_1000_0000_0000#;
Flag_TC : constant := 2#0000_0100_0000_0000#;
Flag_ABC : constant := 2#0000_0010_0000_0000#;
Flag_M : constant := 2#0000_0001_0000_0000#;
Flag_BC : constant := 2#0000_0000_1000_0000#;
Flag_MC : constant := 2#0000_0000_0100_0000#;
Flag_LG : constant := 2#0000_0000_0010_0000#;
Flag_NO : constant := 2#0000_0000_0001_0000#;
Flag_CR : constant := 2#0000_0000_0000_0100#;
Flag_OV : constant := 2#0000_0000_0000_0010#;
Flag_TR : constant := 2#0000_0000_0000_0001#;
pragma Warnings (On, "* not referenced");
subtype Rxbd_Range is Natural range 0 .. 7;
type TRxbd_Array is array (Natural range <>) of TRxbd_Type;
Rxdesc : TRxbd_Array (Rxbd_Range);
for Rxdesc'Alignment use 32;
pragma Volatile (Rxdesc);
type Netbuf_Array is array (Rxbd_Range) of Netbuf (0 .. 511);
Rxbuf : Netbuf_Array;
for Rxbuf'Alignment use 32;
Rxdesc_Num : Rxbd_Range := 0;
subtype Txbd_Range is Natural range 0 .. 3;
Txdesc : TRxbd_Array (Txbd_Range);
for Txdesc'Alignment use 32;
pragma Volatile (Txdesc);
Txdesc_Num : Txbd_Range := 0;
procedure Cache_Flush (Addr : Address) is
begin
Asm ("dcbf 0,%0",
Inputs => Address'Asm_Input ("r", Addr),
Volatile => True);
end Cache_Flush;
procedure Flush_Packet is
use System.Storage_Elements;
Addr : Address := Packet (0)'Address;
begin
while Addr <= Packet (Packet'Last)'Address loop
Cache_Flush (Addr);
Addr := Addr + 32;
end loop;
end Flush_Packet;
procedure Flush_Rxbuf (N : Rxbd_Range) is
use System.Storage_Elements;
Addr : Address := Rxbuf (N)'Address;
begin
while Addr <= Rxbuf (N)(Rxbuf (N)'Last)'Address loop
Cache_Flush (Addr);
Addr := Addr + 32;
end loop;
end Flush_Rxbuf;
procedure Cache_Disable is
Val : Unsigned_32;
begin
-- Flush
for Cset in 0 .. 127 loop
for Cway in 0 .. 7 loop
Val := Unsigned_32 (Cway * 16#1_000000# + Cset * 16#2_0# + 16#2#);
Asm ("mtspr 1016, %0",
Inputs => Unsigned_32'Asm_Input ("r", Val),
Volatile => True);
end loop;
end loop;
-- Disable
Asm ("msync; isync; mtspr 1010, %0",
Inputs => Unsigned_32'Asm_Input ("r", 0), Volatile => True);
end Cache_Disable;
procedure Eth_Init is
begin
Cache_Disable;
-- Reset the chip
FEC_ECR := 1;
while (FEC_ECR and 3) /= 0 loop
null;
end loop;
SIU_PCR (44) := 2#10_01_11_00_00_00#; -- TX_CLK
SIU_PCR (45) := 2#10_01_11_00_00_00#; -- CRS
SIU_PCR (46) := 2#10_01_11_00_00_00#; -- TX_ER
SIU_PCR (47) := 2#10_01_11_00_00_00#; -- RX_CLK
SIU_PCR (48) := 2#10_01_11_00_00_00#; -- TXD0
SIU_PCR (49) := 2#10_01_11_00_00_00#; -- RX_ER
SIU_PCR (50) := 2#10_01_11_00_00_00#; -- RXD0
SIU_PCR (51) := 2#10_01_11_00_00_00#; -- TXD3
SIU_PCR (52) := 2#10_01_11_00_00_00#; -- COL
SIU_PCR (53) := 2#10_01_11_00_00_00#; -- RX_DV
SIU_PCR (54) := 2#10_01_11_00_00_00#; -- TX_EN
SIU_PCR (55) := 2#10_01_11_00_00_00#; -- TXD2
SIU_PCR (56) := 2#10_01_11_00_00_00#; -- TXD1
SIU_PCR (57) := 2#10_01_11_00_00_00#; -- RXD1
SIU_PCR (58) := 2#10_01_11_00_00_00#; -- RXD2
SIU_PCR (59) := 2#10_01_11_00_00_00#; -- RXD3
-- Enable FEC_MDC and FEC_MDIO
SIU_PCR (72) := 2#10_11_11_00_00_00#; -- MDC
SIU_PCR (73) := 2#10_11_11_00_00_00#; -- MDIO
EBI_MCR := 16#01#; -- Disable, 16 bits
-- Clear events
FEC_EIR := 16#ffff_ffff#;
-- Set fifo level
FEC_TFWR := 3;
-- Individual address
FEC_PALR := Shift_Left (Unsigned_32 (My_Eth_Addr (1)), 24)
or Shift_Left (Unsigned_32 (My_Eth_Addr (2)), 16)
or Shift_Left (Unsigned_32 (My_Eth_Addr (3)), 8)
or Shift_Left (Unsigned_32 (My_Eth_Addr (4)), 0);
FEC_PAUR := Shift_Left (Unsigned_32 (My_Eth_Addr (5)), 24)
or Shift_Left (Unsigned_32 (My_Eth_Addr (6)), 16);
-- Multicast addresses hash bits
FEC_GAUR := 0;
FEC_GALR := 0;
-- Individual addresses hash bits
FEC_IAUR := 0;
FEC_IALR := 0;
--
FEC_OPD := 100;
FEC_RCR := 1518 * 16#1_0000# + 2#100#; -- MII
FEC_TCR := 2#100#; -- FDEN
FEC_MSCR := 13 * 2#10#; -- 2.5Mhz at 132Mhz
-- FEC_FRSR :=
FEC_EMRBR := Rxbuf (0)'Length;
FEC_ERDSR := Rxdesc'Address;
FEC_ETDSR := Txdesc'Address;
for I in Rxdesc'Range loop
Rxdesc (I) := (Flag_E, 0, Rxbuf (I)'Address);
if I = Rxdesc'Last then
Rxdesc (I).Flags := Flag_E or Flag_W;
end if;
Cache_Flush (Rxdesc (I)'Address);
Flush_Rxbuf (I);
end loop;
Rxdesc_Num := 0;
for I in Txdesc'Range loop
Txdesc (I) := (0, 0, Packet'Address);
if I = Txdesc'Last then
Txdesc (I).Flags := Flag_W;
end if;
Cache_Flush (Txdesc (I)'Address);
end loop;
Txdesc_Num := 0;
FEC_ECR := 2;
FEC_RDAR := 16#01_00_00_00#;
if False then
for I in 0 .. 7 loop
FEC_MMFR := 2#01_10_00001_00000_10_0000000000000000#
+ Unsigned_32 (I * 16#4_0000#);
while (FEC_EIR and 16#80_0000#) = 0 loop
null;
end loop;
FEC_EIR := 16#80_0000#;
Put_Line
("Reg" & Image1 (Unsigned_32 (I)) & ": " & Image8 (FEC_MMFR));
end loop;
end if;
end Eth_Init;
procedure Eth_Rcv_Wait (Maxtime : Unsigned_32 := 16#ffffffff#) is
Chunk_Len : Natural;
Flags : Unsigned_16;
Prev_Eir, Eir : Unsigned_32;
begin
loop
if False then
Put ("eth rcv: wait ");
Put_Hex (Unsigned_8 (Rxdesc_Num));
New_Line;
end if;
-- Wait until the current descriptor is available
FEC_EIR := EIR_RXF or EIR_RXB;
Prev_Eir := 0;
loop
exit when (Rxdesc (Rxdesc_Num).Flags and Flag_E) = 0;
Cache_Flush (Rxdesc (Rxdesc_Num)'Address);
-- FEC_RDAR := 16#01_00_00_00#;
loop
if Clkdrv.Get_Clock > Maxtime then
Packet_Len := 0;
return;
end if;
Eir := FEC_EIR;
exit when (Eir and EIR_RXF) /= 0;
if False and then Eir /= Prev_Eir then
Put ("EIR: ");
Put_Hex (Eir);
New_Line;
Prev_Eir := Eir;
end if;
end loop;
end loop;
-- Copy chunks
Packet_Off := 0;
loop
Flags := Rxdesc (Rxdesc_Num).Flags;
if False then
Put ("Flags: ");
Put_Hex (Flags);
Put (" len: ");
Put_Hex (Rxdesc (Rxdesc_Num).Len);
New_Line;
end if;
-- Copy chunk
Chunk_Len := Natural (Rxdesc (Rxdesc_Num).Len);
if (Flags and Flag_L) /= 0 then
-- The length of the last buffer is the length of the frame,
-- not just the length of the last buffer (15.5.1.2)
Chunk_Len := Chunk_Len - Packet_Off;
end if;
Packet (Packet_Off .. Packet_Off + Chunk_Len - 1) :=
Rxbuf (Rxdesc_Num)(0 .. Chunk_Len - 1);
Packet_Off := Packet_Off + Chunk_Len;
Flush_Rxbuf (Rxdesc_Num);
-- Check flags
Rxdesc (Rxdesc_Num).Flags := (Flags and Flag_W) or Flag_E;
Cache_Flush (Rxdesc (Rxdesc_Num)'Address);
Rxdesc_Num := (Rxdesc_Num + 1) rem Rxdesc'Length;
exit when (Flags and Flag_L) /= 0;
-- Wait until the next descriptor is available
loop
exit when (Rxdesc (Rxdesc_Num).Flags and Flag_E) = 0;
Cache_Flush (Rxdesc (Rxdesc_Num)'Address);
end loop;
end loop;
-- Discard invalid packets
exit when (Flags and (Flag_CR + Flag_OV + Flag_TR)) = 0;
Put ("err rxdesc: ");
Put_Hex (Flags);
New_Line;
end loop;
Packet_Len := Packet_Off - 4; -- Remove CRC
Packet_Off := 0;
end Eth_Rcv_Wait;
procedure Eth_Send_Init is
begin
Packet_Off := 0;
end Eth_Send_Init;
procedure Eth_Send_Packet is
begin
-- Put_Line ("Sending");
-- Netproto.Dump_Pkt;
Flush_Packet;
Txdesc (Txdesc_Num).Len := Unsigned_16 (Packet_Len);
Txdesc (Txdesc_Num).Flags := (Txdesc (Txdesc_Num).Flags and Flag_W)
or Flag_R + Flag_L + Flag_TC;
Cache_Flush (Txdesc (Txdesc_Num)'Address);
Txdesc_Num := (Txdesc_Num + 1) rem Txdesc'Length;
FEC_TDAR := 16#01_00_00_00#;
while (FEC_EIR and 16#800_0000#) = 0 loop
null;
end loop;
FEC_EIR := 16#0c00_0000#;
end Eth_Send_Packet;
end Ethdrv;
|
-----------------------------------------------------------------------
-- util-systems-dlls-tests -- Unit tests for shared libraries
-- Copyright (C) 2013, 2017, 2019 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Test_Caller;
package body Util.Systems.DLLs.Tests is
use Util.Tests;
use type System.Address;
procedure Load_Library (T : in out Test;
Lib : out Handle);
package Caller is new Util.Test_Caller (Test, "Systems.Dlls");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test Util.Systems.Dlls.Load",
Test_Load'Access);
Caller.Add_Test (Suite, "Test Util.Systems.Dlls.Get_Symbol",
Test_Get_Symbol'Access);
end Add_Tests;
procedure Load_Library (T : in out Test;
Lib : out Handle) is
Lib1 : Handle;
Lib2 : Handle;
Lib3 : Handle;
Lib4 : Handle;
Lib5 : Handle;
begin
begin
Lib1 := Util.Systems.DLLs.Load ("libcrypto.so");
T.Assert (Lib1 /= Null_Handle, "Load operation returned null");
Lib := Lib1;
exception
when Load_Error =>
Lib1 := Null_Handle;
end;
begin
Lib2 := Util.Systems.DLLs.Load ("libcrypto.dylib");
T.Assert (Lib2 /= Null_Handle, "Load operation returned null");
Lib := Lib2;
exception
when Load_Error =>
Lib2 := Null_Handle;
end;
begin
Lib3 := Util.Systems.DLLs.Load ("zlib1.dll");
T.Assert (Lib3 /= Null_Handle, "Load operation returned null");
Lib := Lib3;
exception
when Load_Error =>
Lib3 := Null_Handle;
end;
begin
Lib4 := Util.Systems.DLLs.Load ("libz.so");
T.Assert (Lib4 /= Null_Handle, "Load operation returned null");
Lib := Lib4;
exception
when Load_Error =>
Lib4 := Null_Handle;
end;
begin
Lib5 := Util.Systems.DLLs.Load ("libgmp.so");
T.Assert (Lib5 /= Null_Handle, "Load operation returned null");
Lib := Lib5;
exception
when Load_Error =>
Lib5 := Null_Handle;
end;
T.Assert (Lib1 /= Null_Handle or Lib2 /= Null_Handle or Lib3 /= Null_Handle
or Lib4 /= Null_Handle or Lib5 /= Null_Handle,
"At least one Load operation should have succeeded");
end Load_Library;
-- ------------------------------
-- Test the loading a shared library.
-- ------------------------------
procedure Test_Load (T : in out Test) is
Lib : Handle;
begin
Load_Library (T, Lib);
begin
Lib := Util.Systems.DLLs.Load ("some-invalid-library");
T.Fail ("Load must raise an exception");
exception
when Load_Error =>
null;
end;
end Test_Load;
-- ------------------------------
-- Test getting a shared library symbol.
-- ------------------------------
procedure Test_Get_Symbol (T : in out Test) is
Lib : Handle;
Sym : System.Address := System.Null_Address;
begin
Load_Library (T, Lib);
T.Assert (Lib /= Null_Handle, "Load operation returned null");
begin
Sym := Util.Systems.DLLs.Get_Symbol (Lib, "EVP_sha1");
T.Assert (Sym /= System.Null_Address, "Get_Symbol returned null");
exception
when Not_Found =>
null;
end;
begin
Sym := Util.Systems.DLLs.Get_Symbol (Lib, "compress");
T.Assert (Sym /= System.Null_Address, "Get_Symbol returned null");
exception
when Not_Found =>
null;
end;
begin
Sym := Util.Systems.DLLs.Get_Symbol (Lib, "__gmpf_cmp");
T.Assert (Sym /= System.Null_Address, "Get_Symbol returned null");
exception
when Not_Found =>
null;
end;
-- We must have found one of the two symbols
T.Assert (Sym /= System.Null_Address, "Get_Symbol returned null");
begin
Sym := Util.Systems.DLLs.Get_Symbol (Lib, "some-invalid-symbol");
T.Fail ("The Get_Symbol operation must raise an exception");
exception
when Not_Found =>
null;
end;
end Test_Get_Symbol;
end Util.Systems.DLLs.Tests;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Call_Method is
package My_Class is ... -- see above
package body My_Class is ... -- see above
package Other_Class is ... -- see above
package body Other_Class is ... -- see above
Ob1: My_Class.Object; -- our "root" type
Ob2: Other_Class.Object; -- a type derived from the "root" type
begin
My_Class.Static;
Ob1.Primitive;
Ob2.Primitive;
Ob1.Dynamic;
Ob2.Dynamic;
end Call_Method;
|
with Ada.Directories; use Ada.Directories;
with Ada.Text_IO; use Ada.Text_IO;
procedure Test_File_Size is
begin
Put_Line (File_Size'Image (Size ("input.txt")) & " bytes");
Put_Line (File_Size'Image (Size ("/input.txt")) & " bytes");
end Test_File_Size;
|
-- Copyright (c) 2015-2019 Marcel Schneider
-- for details see License.txt
with Tokens; use Tokens;
with TokenValue; use TokenValue;
with Position; use Position;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
package Lexer_Base is
type Object is tagged private;
procedure OpenFile (O : in out Object;
File_Name : String);
function ReadToken (O : Object) return TokenValue.Object;
private
type Object is tagged record
Line : Natural;
Column : Natural;
StartLine : Natural;
StartColumns : Natural;
Last : Token;
NumberPunctuation : Unbounded_String := To_Unbounded_String (".-+abcdefx");
HexNumberPunctuation : Unbounded_String := To_Unbounded_String ("abcdef");
File_Name : Unbounded_String;
end record;
function ReadWhiteSpace return TokenValue.Object;
function ReadString return TokenValue.Object;
function ReadLineComment return TokenValue.Object;
function ReadBlockComment return TokenValue.Object;
function ReadRegEx return TokenValue.Object;
function ReadOperator return TokenValue.Object;
function ReadNumber return TokenValue.Object;
function IsPunctuationUsed (C : Character) return Boolean;
function SetNumberPunctuation (C : Character;
IsHexNumber : Boolean) return Boolean;
function ReadIdentifier return TokenValue.Object;
function IsName (C : Character) return Boolean;
function IsOperator (C : Character) return Boolean;
function IsDigit (C : Character) return Boolean;
function IsPunctuation (C : Character) return Boolean;
function Peek return Character;
function Advance return Character;
function CreateToken (TokenId : Token;
Literal : Unbounded_String;
Message : Unbounded_String) return TokenValue.Object;
function CreatePosition return Position.Object;
end Lexer_Base;
|
-------------------------------------------------------------------------------
-- Copyright (c) 2019, Daniel King
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
-- * Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * The name of the copyright holder may not be used to endorse or promote
-- Products derived from this software without specific prior written
-- permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
-- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
package body Keccak.Generic_Parallel_Sponge
is
--------------
-- Lemmas --
--------------
pragma Warnings (Off, "postcondition does not check the outcome");
procedure Lemma_Remaining_Mod_Rate_Preserve
(Offset, Remaining, Length : in Natural;
Rate : in Positive)
with Global => null,
Ghost,
Pre => (Offset <= Length
and then Remaining <= Length
and then Length - Remaining = Offset
and then Remaining < Rate
and then Offset mod Rate = 0),
Post => ((Remaining mod Rate = 0) = (Length mod Rate = 0));
procedure Lemma_Offset_Mod_Rate_Preserve
(Offset : in Natural;
Rate : in Positive)
with Global => null,
Ghost,
Pre => (Offset <= Natural'Last - Rate
and Offset mod Rate = 0),
Post => (Offset + Rate) mod Rate = 0;
pragma Warnings (On, "postcondition does not check the outcome");
procedure Lemma_Remaining_Mod_Rate_Preserve
(Offset, Remaining, Length : in Natural;
Rate : in Positive)
is
begin
pragma Assert (Offset + Remaining = Length);
pragma Assert (Remaining mod Rate = Length mod Rate);
end Lemma_Remaining_Mod_Rate_Preserve;
procedure Lemma_Offset_Mod_Rate_Preserve
(Offset : in Natural;
Rate : in Positive)
is
begin
pragma Assert ((Offset + Rate) mod Rate = 0);
end Lemma_Offset_Mod_Rate_Preserve;
-------------------
-- Add_Padding --
-------------------
procedure Add_Padding (Ctx : in out Context)
with Global => null,
Pre => State_Of (Ctx) = Absorbing,
Post => State_Of (Ctx) = Squeezing;
------------
-- Init --
------------
procedure Init (Ctx : out Context)
is
begin
Ctx.Rate := (State_Size - Ctx.Capacity) / 8;
Ctx.State := Absorbing;
Init (Ctx.Permutation_State);
pragma Assert (State_Of (Ctx) = Absorbing);
end Init;
-----------------------------
-- Absorb_Bytes_Separate --
-----------------------------
procedure Absorb_Bytes_Separate (Ctx : in out Context;
Data : in Types.Byte_Array)
is
Block_Size : constant Natural := Data'Length / Num_Parallel_Instances;
Rate_Bytes : constant Rate_Bytes_Number := Ctx.Rate;
Buffer_Size : constant Natural := Rate_Bytes * Num_Parallel_Instances;
Remaining : Natural := Block_Size;
Offset : Natural := 0;
Pos : Types.Index_Number;
Buf_First : Types.Index_Number;
Buf_Last : Types.Index_Number;
Buffer : Types.Byte_Array (0 .. Buffer_Size - 1) := (others => 0);
begin
while Remaining >= Ctx.Rate loop
pragma Loop_Invariant (Offset + Remaining = Block_Size);
pragma Loop_Invariant (Offset mod Ctx.Rate = 0);
pragma Loop_Invariant (Offset <= Block_Size);
XOR_Bits_Into_State_Separate
(S => Ctx.Permutation_State,
Data => Data,
Data_Offset => Offset,
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
Lemma_Offset_Mod_Rate_Preserve (Offset, Ctx.Rate);
Offset := Offset + Ctx.Rate;
Remaining := Remaining - Ctx.Rate;
end loop;
pragma Assert (Remaining < Ctx.Rate);
pragma Assert (Offset mod Ctx.Rate = 0);
pragma Assert (Offset + Remaining = Block_Size);
Lemma_Remaining_Mod_Rate_Preserve (Offset, Remaining, Block_Size, Ctx.Rate);
if Remaining > 0 then
pragma Assert (Remaining mod Ctx.Rate /= 0);
pragma Assert (Block_Size mod Ctx.Rate /= 0);
Ctx.State := Squeezing;
-- Apply the padding rule to the final chunk of data.
for I in 0 .. Num_Parallel_Instances - 1 loop
Pos := Data'First + (I * Block_Size) + Offset;
Buf_First := (Ctx.Rate * I);
Buf_Last := (Ctx.Rate * I) + (Remaining - 1);
Buffer (Buf_First .. Buf_Last) := Data (Pos .. Pos + (Remaining - 1));
pragma Assert (Buf_First + (Ctx.Rate - 1) in Buffer'Range);
Pad (Block => Buffer (Buf_First .. Buf_First + (Ctx.Rate - 1)),
Num_Used_Bits => Remaining * 8,
Max_Bit_Length => Ctx.Rate * 8);
end loop;
XOR_Bits_Into_State_Separate
(S => Ctx.Permutation_State,
Data => Buffer,
Data_Offset => 0,
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
else
-- Help prove contract case.
pragma Assert ((Data'Length / Num_Parallel_Instances) mod (Rate_Of (Ctx) / 8) = 0);
end if;
end Absorb_Bytes_Separate;
------------------------
-- Absorb_Bytes_All --
------------------------
procedure Absorb_Bytes_All (Ctx : in out Context;
Data : in Types.Byte_Array)
is
Rate_Bytes : constant Positive := Ctx.Rate;
Offset : Natural := 0;
Remaining : Natural := Data'Length;
Pos : Types.Index_Number;
Buffer : Types.Byte_Array (0 .. Rate_Bytes - 1);
begin
while Remaining >= Ctx.Rate loop
pragma Loop_Invariant (Offset + Remaining = Data'Length);
pragma Loop_Invariant (Offset mod Ctx.Rate = 0);
pragma Loop_Invariant (Offset <= Data'Length);
Pos := Data'First + Offset;
XOR_Bits_Into_State_All
(S => Ctx.Permutation_State,
Data => Data (Pos .. Pos + Ctx.Rate - 1),
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
Lemma_Offset_Mod_Rate_Preserve (Offset, Ctx.Rate);
Offset := Offset + Ctx.Rate;
Remaining := Remaining - Ctx.Rate;
end loop;
pragma Assert (Remaining < Ctx.Rate);
pragma Assert (Offset mod Ctx.Rate = 0);
pragma Assert (Offset + Remaining = Data'Length);
if Remaining > 0 then
pragma Assert (Remaining mod Ctx.Rate /= 0);
pragma Assert (Data'Length mod Ctx.Rate /= 0);
Ctx.State := Squeezing;
Buffer := (others => 0);
Buffer (0 .. Remaining - 1) := Data (Data'First + Offset .. Data'Last);
Pad (Block => Buffer,
Num_Used_Bits => Remaining * 8,
Max_Bit_Length => Ctx.Rate * 8);
XOR_Bits_Into_State_All
(S => Ctx.Permutation_State,
Data => Buffer,
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
end if;
end Absorb_Bytes_All;
------------------------------------
-- Absorb_Bytes_All_With_Suffix --
------------------------------------
procedure Absorb_Bytes_All_With_Suffix
(Ctx : in out Context;
Data : in Types.Byte_Array;
Suffix : in Types.Byte;
Suffix_Len : in Natural)
is
Rate_Bytes : constant Positive := Ctx.Rate;
Offset : Natural;
Remaining : Natural;
Num_Full_Blocks : Natural;
Length : Natural;
Buffer : Types.Byte_Array (0 .. Rate_Bytes - 1) := (others => 0);
begin
Num_Full_Blocks := Data'Length / Ctx.Rate;
-- Process full blocks of data, if available.
if Num_Full_Blocks > 0 then
Length := Num_Full_Blocks * Ctx.Rate;
Absorb_Bytes_All
(Ctx => Ctx,
Data => Data (Data'First .. Data'First + Length - 1));
Offset := Length;
Remaining := Data'Length - Length;
else
Offset := 0;
Remaining := Data'Length;
end if;
Ctx.State := Squeezing;
if Remaining > 0 then
-- Append suffix + padding to remaining bytes
Buffer (0 .. Remaining - 1) := Data (Data'First + Offset .. Data'Last);
Buffer (Remaining) := Suffix;
Pad (Block => Buffer,
Num_Used_Bits => (Remaining * 8) + Suffix_Len,
Max_Bit_Length => Ctx.Rate * 8);
else
-- No remaining data, just process suffix + padding
Buffer (0) := Suffix;
Pad (Block => Buffer,
Num_Used_Bits => Suffix_Len,
Max_Bit_Length => Ctx.Rate * 8);
end if;
XOR_Bits_Into_State_All
(S => Ctx.Permutation_State,
Data => Buffer,
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
end Absorb_Bytes_All_With_Suffix;
-----------------------------------------
-- Absorb_Bytes_Separate_With_Suffix --
-----------------------------------------
procedure Absorb_Bytes_Separate_With_Suffix
(Ctx : in out Context;
Data : in Types.Byte_Array;
Suffix : in Types.Byte;
Suffix_Len : in Natural)
is
Block_Size : constant Natural := Data'Length / Num_Parallel_Instances;
Rate_Bytes : constant Rate_Bytes_Number := Ctx.Rate;
Buffer_Size : constant Natural := Rate_Bytes * Num_Parallel_Instances;
Remaining : Natural := Block_Size;
Offset : Natural := 0;
Pos : Types.Index_Number;
Buf_First : Types.Index_Number;
Buf_Last : Types.Index_Number;
Buffer : Types.Byte_Array (0 .. Buffer_Size - 1) := (others => 0);
begin
Ctx.State := Squeezing;
while Remaining >= Ctx.Rate loop
pragma Loop_Invariant (Offset + Remaining = Block_Size);
pragma Loop_Invariant (Offset mod Ctx.Rate = 0);
pragma Loop_Invariant (Offset <= Block_Size);
XOR_Bits_Into_State_Separate
(S => Ctx.Permutation_State,
Data => Data,
Data_Offset => Offset,
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
Lemma_Offset_Mod_Rate_Preserve (Offset, Ctx.Rate);
Remaining := Remaining - Ctx.Rate;
Offset := Offset + Ctx.Rate;
end loop;
if Remaining > 0 then
-- Apply the padding rule to the final chunk of data + suffix.
for I in 0 .. Num_Parallel_Instances - 1 loop
Pos := Data'First + (I * Block_Size) + Offset;
Buf_First := (Ctx.Rate * I);
Buf_Last := (Ctx.Rate * I) + (Remaining - 1);
Buffer (Buf_First .. Buf_Last) := Data (Pos .. Pos + (Remaining - 1));
Buffer (Buf_Last + 1) := Suffix;
Pad (Block => Buffer (Buf_First .. Buf_First + (Ctx.Rate - 1)),
Num_Used_Bits => (Remaining * 8) + Suffix_Len,
Max_Bit_Length => Ctx.Rate * 8);
end loop;
else
-- Apply the padding rule to the suffix only.
Buffer := (0 => Suffix,
others => 0);
Pad (Block => Buffer (0 .. Ctx.Rate - 1),
Num_Used_Bits => Suffix_Len,
Max_Bit_Length => Ctx.Rate * 8);
-- Replicate the padding for each parallel instance.
for I in 1 .. Num_Parallel_Instances - 1 loop
Buffer (I * Ctx.Rate .. I * Ctx.Rate + Ctx.Rate - 1) :=
Buffer (0 .. Ctx.Rate - 1);
end loop;
end if;
XOR_Bits_Into_State_Separate
(S => Ctx.Permutation_State,
Data => Buffer,
Data_Offset => 0,
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
end Absorb_Bytes_Separate_With_Suffix;
-------------------
-- Add_Padding --
-------------------
procedure Add_Padding (Ctx : in out Context)
is
Rate_Bytes : constant Rate_Bytes_Number := Ctx.Rate;
Buffer : Types.Byte_Array (0 .. (Rate_Bytes * Num_Parallel_Instances) - 1);
begin
Buffer := (others => 0);
Pad (Block => Buffer (0 .. Ctx.Rate - 1),
Num_Used_Bits => 0,
Max_Bit_Length => Ctx.Rate * 8);
-- Replicate the padding for each parallel instance.
for I in 1 .. Num_Parallel_Instances - 1 loop
Buffer (I * Ctx.Rate .. I * Ctx.Rate + Ctx.Rate - 1) :=
Buffer (0 .. Ctx.Rate - 1);
end loop;
XOR_Bits_Into_State_Separate
(S => Ctx.Permutation_State,
Data => Buffer,
Data_Offset => 0,
Bit_Len => Ctx.Rate * 8);
Permute_All (Ctx.Permutation_State);
Ctx.State := Squeezing;
pragma Assert (State_Of (Ctx) = Squeezing);
end Add_Padding;
------------------------------
-- Squeeze_Bytes_Separate --
------------------------------
procedure Squeeze_Bytes_Separate (Ctx : in out Context;
Data : out Types.Byte_Array)
is
Block_Size : constant Natural := Data'Length / Num_Parallel_Instances;
Remaining : Natural := Block_Size;
Offset : Natural := 0;
begin
-- If we're coming straight from the absorbing phase then we need to
-- apply the padding rule before proceeding to the squeezing phase,
if Ctx.State = Absorbing then
Add_Padding (Ctx);
end if;
while Remaining >= Ctx.Rate loop
pragma Loop_Invariant (Offset + Remaining = Block_Size);
pragma Loop_Invariant (Offset mod Ctx.Rate = 0);
pragma Loop_Invariant (Offset <= Block_Size);
Extract_Bytes
(S => Ctx.Permutation_State,
Data => Data,
Data_Offset => Offset,
Byte_Len => Ctx.Rate);
pragma Annotate
(GNATprove, False_Positive,
"""Data"" is not initialized",
"The array will be wholly initialized at the end of this procedure");
Permute_All (Ctx.Permutation_State);
Lemma_Offset_Mod_Rate_Preserve (Offset, Ctx.Rate);
Remaining := Remaining - Ctx.Rate;
Offset := Offset + Ctx.Rate;
end loop;
pragma Assert (Remaining < Ctx.Rate);
pragma Assert (Offset mod Ctx.Rate = 0);
pragma Assert (Offset + Remaining = Block_Size);
Lemma_Remaining_Mod_Rate_Preserve (Offset, Remaining, Block_Size, Ctx.Rate);
if Remaining > 0 then
pragma Assert (Remaining mod Ctx.Rate /= 0);
pragma Assert (Block_Size mod Ctx.Rate /= 0);
Ctx.State := Finished;
Extract_Bytes
(S => Ctx.Permutation_State,
Data => Data,
Data_Offset => Offset,
Byte_Len => Remaining);
pragma Annotate
(GNATprove, False_Positive,
"""Data"" might not be initialized",
"The array will be wholly initialized at the end of this procedure");
end if;
end Squeeze_Bytes_Separate;
end Keccak.Generic_Parallel_Sponge;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes is
-----------------------
-- Enclosing_Element --
-----------------------
overriding function Enclosing_Element
(Self : Node) return Program.Elements.Element_Access
is
begin
return Self.Enclosing_Element;
end Enclosing_Element;
------------------------
-- Is_Abort_Statement --
------------------------
overriding function Is_Abort_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Abort_Statement_Element;
-------------------------
-- Is_Accept_Statement --
-------------------------
overriding function Is_Accept_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Accept_Statement_Element;
--------------------
-- Is_Access_Type --
--------------------
overriding function Is_Access_Type_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Access_Type_Element;
------------------
-- Is_Allocator --
------------------
overriding function Is_Allocator_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Allocator_Element;
------------------------------------
-- Is_Anonymous_Access_Definition --
------------------------------------
overriding function Is_Anonymous_Access_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Anonymous_Access_Definition_Element;
-----------------------------------
-- Is_Anonymous_Access_To_Object --
-----------------------------------
overriding function Is_Anonymous_Access_To_Object_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Anonymous_Access_To_Object_Element;
--------------------------------------
-- Is_Anonymous_Access_To_Procedure --
--------------------------------------
overriding function Is_Anonymous_Access_To_Procedure_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Anonymous_Access_To_Procedure_Element;
-------------------------------------
-- Is_Anonymous_Access_To_Function --
-------------------------------------
overriding function Is_Anonymous_Access_To_Function_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Anonymous_Access_To_Function_Element;
------------------------
-- Is_Array_Aggregate --
------------------------
overriding function Is_Array_Aggregate_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Array_Aggregate_Element;
------------------------------------
-- Is_Array_Component_Association --
------------------------------------
overriding function Is_Array_Component_Association_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Array_Component_Association_Element;
-----------------------------
-- Is_Aspect_Specification --
-----------------------------
overriding function Is_Aspect_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Aspect_Specification_Element;
-----------------------------
-- Is_Assignment_Statement --
-----------------------------
overriding function Is_Assignment_Statement_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Assignment_Statement_Element;
--------------------
-- Is_Association --
--------------------
overriding function Is_Association_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Association_Element;
------------------
-- Is_At_Clause --
------------------
overriding function Is_At_Clause_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_At_Clause_Element;
------------------------------------
-- Is_Attribute_Definition_Clause --
------------------------------------
overriding function Is_Attribute_Definition_Clause_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Attribute_Definition_Clause_Element;
----------------------------
-- Is_Attribute_Reference --
----------------------------
overriding function Is_Attribute_Reference_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Attribute_Reference_Element;
------------------------
-- Is_Block_Statement --
------------------------
overriding function Is_Block_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Block_Statement_Element;
-----------------------
-- Is_Call_Statement --
-----------------------
overriding function Is_Call_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Call_Statement_Element;
------------------------
-- Is_Case_Expression --
------------------------
overriding function Is_Case_Expression_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Case_Expression_Element;
-----------------------------
-- Is_Case_Expression_Path --
-----------------------------
overriding function Is_Case_Expression_Path_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Case_Expression_Path_Element;
------------------
-- Is_Case_Path --
------------------
overriding function Is_Case_Path_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Case_Path_Element;
-----------------------
-- Is_Case_Statement --
-----------------------
overriding function Is_Case_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Case_Statement_Element;
--------------------------
-- Is_Character_Literal --
--------------------------
overriding function Is_Character_Literal_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Character_Literal_Element;
---------------------------------------
-- Is_Choice_Parameter_Specification --
---------------------------------------
overriding function Is_Choice_Parameter_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Choice_Parameter_Specification_Element;
---------------
-- Is_Clause --
---------------
overriding function Is_Clause_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Clause_Element;
-----------------------
-- Is_Code_Statement --
-----------------------
overriding function Is_Code_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Code_Statement_Element;
-------------------------
-- Is_Component_Clause --
-------------------------
overriding function Is_Component_Clause_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Component_Clause_Element;
------------------------------
-- Is_Component_Declaration --
------------------------------
overriding function Is_Component_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Component_Declaration_Element;
-----------------------------
-- Is_Component_Definition --
-----------------------------
overriding function Is_Component_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Component_Definition_Element;
-------------------------------
-- Is_Constrained_Array_Type --
-------------------------------
overriding function Is_Constrained_Array_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Constrained_Array_Type_Element;
-------------------
-- Is_Constraint --
-------------------
overriding function Is_Constraint_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Constraint_Element;
---------------------------------
-- Is_Decimal_Fixed_Point_Type --
---------------------------------
overriding function Is_Decimal_Fixed_Point_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Decimal_Fixed_Point_Type_Element;
--------------------
-- Is_Declaration --
--------------------
overriding function Is_Declaration_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Declaration_Element;
-----------------------------------
-- Is_Defining_Character_Literal --
-----------------------------------
overriding function Is_Defining_Character_Literal_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Defining_Character_Literal_Element;
-------------------------------
-- Is_Defining_Expanded_Name --
-------------------------------
overriding function Is_Defining_Expanded_Name_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Defining_Expanded_Name_Element;
----------------------------
-- Is_Defining_Identifier --
----------------------------
overriding function Is_Defining_Identifier_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Defining_Identifier_Element;
----------------------
-- Is_Defining_Name --
----------------------
overriding function Is_Defining_Name_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Defining_Name_Element;
---------------------------------
-- Is_Defining_Operator_Symbol --
---------------------------------
overriding function Is_Defining_Operator_Symbol_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Defining_Operator_Symbol_Element;
-------------------
-- Is_Definition --
-------------------
overriding function Is_Definition_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Definition_Element;
------------------------
-- Is_Delay_Statement --
------------------------
overriding function Is_Delay_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Delay_Statement_Element;
-------------------------
-- Is_Delta_Constraint --
-------------------------
overriding function Is_Delta_Constraint_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Delta_Constraint_Element;
---------------------------------
-- Is_Derived_Record_Extension --
---------------------------------
overriding function Is_Derived_Record_Extension_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Derived_Record_Extension_Element;
---------------------
-- Is_Derived_Type --
---------------------
overriding function Is_Derived_Type_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Derived_Type_Element;
--------------------------
-- Is_Digits_Constraint --
--------------------------
overriding function Is_Digits_Constraint_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Digits_Constraint_Element;
-----------------------
-- Is_Discrete_Range --
-----------------------
overriding function Is_Discrete_Range_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Discrete_Range_Element;
-------------------------------------------
-- Is_Discrete_Range_Attribute_Reference --
-------------------------------------------
overriding function Is_Discrete_Range_Attribute_Reference_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Discrete_Range_Attribute_Reference_Element;
-----------------------------------------
-- Is_Discrete_Simple_Expression_Range --
-----------------------------------------
overriding function Is_Discrete_Simple_Expression_Range_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Discrete_Simple_Expression_Range_Element;
------------------------------------
-- Is_Discrete_Subtype_Indication --
------------------------------------
overriding function Is_Discrete_Subtype_Indication_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Discrete_Subtype_Indication_Element;
---------------------------------
-- Is_Discriminant_Association --
---------------------------------
overriding function Is_Discriminant_Association_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Discriminant_Association_Element;
--------------------------------
-- Is_Discriminant_Constraint --
--------------------------------
overriding function Is_Discriminant_Constraint_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Discriminant_Constraint_Element;
-----------------------------------
-- Is_Discriminant_Specification --
-----------------------------------
overriding function Is_Discriminant_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Discriminant_Specification_Element;
---------------------------------------
-- Is_Element_Iterator_Specification --
---------------------------------------
overriding function Is_Element_Iterator_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Element_Iterator_Specification_Element;
------------------------------
-- Is_Elsif_Expression_Path --
------------------------------
overriding function Is_Elsif_Expression_Path_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Elsif_Expression_Path_Element;
-------------------
-- Is_Elsif_Path --
-------------------
overriding function Is_Elsif_Path_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Elsif_Path_Element;
-------------------------------
-- Is_Entry_Body_Declaration --
-------------------------------
overriding function Is_Entry_Body_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Entry_Body_Declaration_Element;
--------------------------
-- Is_Entry_Declaration --
--------------------------
overriding function Is_Entry_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Entry_Declaration_Element;
----------------------------------
-- Is_Entry_Index_Specification --
----------------------------------
overriding function Is_Entry_Index_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Entry_Index_Specification_Element;
------------------------------------------
-- Is_Enumeration_Literal_Specification --
------------------------------------------
overriding function Is_Enumeration_Literal_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Enumeration_Literal_Specification_Element;
------------------------------------------
-- Is_Enumeration_Representation_Clause --
------------------------------------------
overriding function Is_Enumeration_Representation_Clause_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Enumeration_Representation_Clause_Element;
-------------------------
-- Is_Enumeration_Type --
-------------------------
overriding function Is_Enumeration_Type_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Enumeration_Type_Element;
------------------------------
-- Is_Exception_Declaration --
------------------------------
overriding function Is_Exception_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Exception_Declaration_Element;
--------------------------
-- Is_Exception_Handler --
--------------------------
overriding function Is_Exception_Handler_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Exception_Handler_Element;
---------------------------------------
-- Is_Exception_Renaming_Declaration --
---------------------------------------
overriding function Is_Exception_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Exception_Renaming_Declaration_Element;
-----------------------
-- Is_Exit_Statement --
-----------------------
overriding function Is_Exit_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Exit_Statement_Element;
-----------------------------
-- Is_Explicit_Dereference --
-----------------------------
overriding function Is_Explicit_Dereference_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Explicit_Dereference_Element;
-------------------
-- Is_Expression --
-------------------
overriding function Is_Expression_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Expression_Element;
----------------------------------
-- Is_Extended_Return_Statement --
----------------------------------
overriding function Is_Extended_Return_Statement_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Extended_Return_Statement_Element;
----------------------------
-- Is_Extension_Aggregate --
----------------------------
overriding function Is_Extension_Aggregate_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Extension_Aggregate_Element;
----------------------------
-- Is_Floating_Point_Type --
----------------------------
overriding function Is_Floating_Point_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Floating_Point_Type_Element;
---------------------------
-- Is_For_Loop_Statement --
---------------------------
overriding function Is_For_Loop_Statement_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_For_Loop_Statement_Element;
---------------------------
-- Is_Formal_Access_Type --
---------------------------
overriding function Is_Formal_Access_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Access_Type_Element;
--------------------------------------
-- Is_Formal_Constrained_Array_Type --
--------------------------------------
overriding function Is_Formal_Constrained_Array_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Constrained_Array_Type_Element;
----------------------------------------------
-- Is_Formal_Decimal_Fixed_Point_Definition --
----------------------------------------------
overriding function Is_Formal_Decimal_Fixed_Point_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Decimal_Fixed_Point_Definition_Element;
---------------------------------------
-- Is_Formal_Derived_Type_Definition --
---------------------------------------
overriding function Is_Formal_Derived_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Derived_Type_Definition_Element;
----------------------------------------
-- Is_Formal_Discrete_Type_Definition --
----------------------------------------
overriding function Is_Formal_Discrete_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Discrete_Type_Definition_Element;
-----------------------------------------
-- Is_Formal_Floating_Point_Definition --
-----------------------------------------
overriding function Is_Formal_Floating_Point_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Floating_Point_Definition_Element;
------------------------------------
-- Is_Formal_Function_Declaration --
------------------------------------
overriding function Is_Formal_Function_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Function_Declaration_Element;
---------------------------------------
-- Is_Formal_Modular_Type_Definition --
---------------------------------------
overriding function Is_Formal_Modular_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Modular_Type_Definition_Element;
----------------------------------
-- Is_Formal_Object_Access_Type --
----------------------------------
overriding function Is_Formal_Object_Access_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Object_Access_Type_Element;
-------------------------------------
-- Is_Formal_Procedure_Access_Type --
-------------------------------------
overriding function Is_Formal_Procedure_Access_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Procedure_Access_Type_Element;
------------------------------------
-- Is_Formal_Function_Access_Type --
------------------------------------
overriding function Is_Formal_Function_Access_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Function_Access_Type_Element;
------------------------------
-- Is_Formal_Interface_Type --
------------------------------
overriding function Is_Formal_Interface_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Interface_Type_Element;
----------------------------------
-- Is_Formal_Object_Declaration --
----------------------------------
overriding function Is_Formal_Object_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Object_Declaration_Element;
-----------------------------------------------
-- Is_Formal_Ordinary_Fixed_Point_Definition --
-----------------------------------------------
overriding function Is_Formal_Ordinary_Fixed_Point_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Ordinary_Fixed_Point_Definition_Element;
-----------------------------------
-- Is_Formal_Package_Association --
-----------------------------------
overriding function Is_Formal_Package_Association_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Package_Association_Element;
-----------------------------------
-- Is_Formal_Package_Declaration --
-----------------------------------
overriding function Is_Formal_Package_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Package_Declaration_Element;
---------------------------------------
-- Is_Formal_Private_Type_Definition --
---------------------------------------
overriding function Is_Formal_Private_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Private_Type_Definition_Element;
-------------------------------------
-- Is_Formal_Procedure_Declaration --
-------------------------------------
overriding function Is_Formal_Procedure_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Procedure_Declaration_Element;
----------------------------------------------
-- Is_Formal_Signed_Integer_Type_Definition --
----------------------------------------------
overriding function Is_Formal_Signed_Integer_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Signed_Integer_Type_Definition_Element;
--------------------------------
-- Is_Formal_Type_Declaration --
--------------------------------
overriding function Is_Formal_Type_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Type_Declaration_Element;
-------------------------------
-- Is_Formal_Type_Definition --
-------------------------------
overriding function Is_Formal_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Type_Definition_Element;
----------------------------------------
-- Is_Formal_Unconstrained_Array_Type --
----------------------------------------
overriding function Is_Formal_Unconstrained_Array_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Formal_Unconstrained_Array_Type_Element;
-----------------------------
-- Is_Function_Access_Type --
-----------------------------
overriding function Is_Function_Access_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Function_Access_Type_Element;
----------------------------------
-- Is_Function_Body_Declaration --
----------------------------------
overriding function Is_Function_Body_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Function_Body_Declaration_Element;
---------------------------
-- Is_Function_Body_Stub --
---------------------------
overriding function Is_Function_Body_Stub_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Function_Body_Stub_Element;
----------------------
-- Is_Function_Call --
----------------------
overriding function Is_Function_Call_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Function_Call_Element;
-----------------------------
-- Is_Function_Declaration --
-----------------------------
overriding function Is_Function_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Function_Declaration_Element;
-------------------------------
-- Is_Function_Instantiation --
-------------------------------
overriding function Is_Function_Instantiation_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Function_Instantiation_Element;
--------------------------------------
-- Is_Function_Renaming_Declaration --
--------------------------------------
overriding function Is_Function_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Function_Renaming_Declaration_Element;
-------------------------------------------
-- Is_Generalized_Iterator_Specification --
-------------------------------------------
overriding function Is_Generalized_Iterator_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Generalized_Iterator_Specification_Element;
-------------------------------------
-- Is_Generic_Function_Declaration --
-------------------------------------
overriding function Is_Generic_Function_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Generic_Function_Declaration_Element;
----------------------------------------------
-- Is_Generic_Function_Renaming_Declaration --
----------------------------------------------
overriding function Is_Generic_Function_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Generic_Function_Renaming_Declaration_Element;
------------------------------------
-- Is_Generic_Package_Declaration --
------------------------------------
overriding function Is_Generic_Package_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Generic_Package_Declaration_Element;
---------------------------------------------
-- Is_Generic_Package_Renaming_Declaration --
---------------------------------------------
overriding function Is_Generic_Package_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Generic_Package_Renaming_Declaration_Element;
--------------------------------------
-- Is_Generic_Procedure_Declaration --
--------------------------------------
overriding function Is_Generic_Procedure_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Generic_Procedure_Declaration_Element;
-----------------------------------------------
-- Is_Generic_Procedure_Renaming_Declaration --
-----------------------------------------------
overriding function Is_Generic_Procedure_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Generic_Procedure_Renaming_Declaration_Element;
-----------------------
-- Is_Goto_Statement --
-----------------------
overriding function Is_Goto_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Goto_Statement_Element;
-------------------
-- Is_Identifier --
-------------------
overriding function Is_Identifier_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Identifier_Element;
----------------------
-- Is_If_Expression --
----------------------
overriding function Is_If_Expression_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_If_Expression_Element;
---------------------
-- Is_If_Statement --
---------------------
overriding function Is_If_Statement_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_If_Statement_Element;
-----------------------------------
-- Is_Incomplete_Type_Definition --
-----------------------------------
overriding function Is_Incomplete_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Incomplete_Type_Definition_Element;
-------------------------
-- Is_Index_Constraint --
-------------------------
overriding function Is_Index_Constraint_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Index_Constraint_Element;
--------------------------
-- Is_Indexed_Component --
--------------------------
overriding function Is_Indexed_Component_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Indexed_Component_Element;
-----------------------
-- Is_Infix_Operator --
-----------------------
overriding function Is_Infix_Operator_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Infix_Operator_Element;
-----------------------
-- Is_Interface_Type --
-----------------------
overriding function Is_Interface_Type_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Interface_Type_Element;
--------------------------------
-- Is_Known_Discriminant_Part --
--------------------------------
overriding function Is_Known_Discriminant_Part_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Known_Discriminant_Part_Element;
-------------------------------------
-- Is_Loop_Parameter_Specification --
-------------------------------------
overriding function Is_Loop_Parameter_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Loop_Parameter_Specification_Element;
-----------------------
-- Is_Loop_Statement --
-----------------------
overriding function Is_Loop_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Loop_Statement_Element;
------------------------
-- Is_Membership_Test --
------------------------
overriding function Is_Membership_Test_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Membership_Test_Element;
---------------------
-- Is_Modular_Type --
---------------------
overriding function Is_Modular_Type_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Modular_Type_Element;
-----------------------
-- Is_Null_Component --
-----------------------
overriding function Is_Null_Component_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Null_Component_Element;
---------------------
-- Is_Null_Literal --
---------------------
overriding function Is_Null_Literal_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Null_Literal_Element;
-----------------------
-- Is_Null_Statement --
-----------------------
overriding function Is_Null_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Null_Statement_Element;
---------------------------
-- Is_Number_Declaration --
---------------------------
overriding function Is_Number_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Number_Declaration_Element;
------------------------
-- Is_Numeric_Literal --
------------------------
overriding function Is_Numeric_Literal_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Numeric_Literal_Element;
---------------------------
-- Is_Object_Access_Type --
---------------------------
overriding function Is_Object_Access_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Object_Access_Type_Element;
---------------------------
-- Is_Object_Declaration --
---------------------------
overriding function Is_Object_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Object_Declaration_Element;
------------------------------------
-- Is_Object_Renaming_Declaration --
------------------------------------
overriding function Is_Object_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Object_Renaming_Declaration_Element;
------------------------
-- Is_Operator_Symbol --
------------------------
overriding function Is_Operator_Symbol_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Operator_Symbol_Element;
----------------------------------
-- Is_Ordinary_Fixed_Point_Type --
----------------------------------
overriding function Is_Ordinary_Fixed_Point_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Ordinary_Fixed_Point_Type_Element;
----------------------
-- Is_Others_Choice --
----------------------
overriding function Is_Others_Choice_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Others_Choice_Element;
---------------------------------
-- Is_Package_Body_Declaration --
---------------------------------
overriding function Is_Package_Body_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Package_Body_Declaration_Element;
--------------------------
-- Is_Package_Body_Stub --
--------------------------
overriding function Is_Package_Body_Stub_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Package_Body_Stub_Element;
----------------------------
-- Is_Package_Declaration --
----------------------------
overriding function Is_Package_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Package_Declaration_Element;
------------------------------
-- Is_Package_Instantiation --
------------------------------
overriding function Is_Package_Instantiation_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Package_Instantiation_Element;
-------------------------------------
-- Is_Package_Renaming_Declaration --
-------------------------------------
overriding function Is_Package_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Package_Renaming_Declaration_Element;
------------------------------
-- Is_Parameter_Association --
------------------------------
overriding function Is_Parameter_Association_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Parameter_Association_Element;
--------------------------------
-- Is_Parameter_Specification --
--------------------------------
overriding function Is_Parameter_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Parameter_Specification_Element;
---------------------------------
-- Is_Parenthesized_Expression --
---------------------------------
overriding function Is_Parenthesized_Expression_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Parenthesized_Expression_Element;
-------------------------
-- Is_Part_Of_Implicit --
-------------------------
overriding function Is_Part_Of_Implicit (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Part_Of_Implicit;
--------------------------
-- Is_Part_Of_Inherited --
--------------------------
overriding function Is_Part_Of_Inherited (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Part_Of_Inherited;
-------------------------
-- Is_Part_Of_Instance --
-------------------------
overriding function Is_Part_Of_Instance (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Part_Of_Instance;
-------------
-- Is_Path --
-------------
overriding function Is_Path_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Path_Element;
---------------
-- Is_Pragma --
---------------
overriding function Is_Pragma_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Pragma_Element;
-------------------------------------
-- Is_Private_Extension_Definition --
-------------------------------------
overriding function Is_Private_Extension_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Private_Extension_Definition_Element;
--------------------------------
-- Is_Private_Type_Definition --
--------------------------------
overriding function Is_Private_Type_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Private_Type_Definition_Element;
------------------------------
-- Is_Procedure_Access_Type --
------------------------------
overriding function Is_Procedure_Access_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Procedure_Access_Type_Element;
-----------------------------------
-- Is_Procedure_Body_Declaration --
-----------------------------------
overriding function Is_Procedure_Body_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Procedure_Body_Declaration_Element;
----------------------------
-- Is_Procedure_Body_Stub --
----------------------------
overriding function Is_Procedure_Body_Stub_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Procedure_Body_Stub_Element;
------------------------------
-- Is_Procedure_Declaration --
------------------------------
overriding function Is_Procedure_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Procedure_Declaration_Element;
--------------------------------
-- Is_Procedure_Instantiation --
--------------------------------
overriding function Is_Procedure_Instantiation_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Procedure_Instantiation_Element;
---------------------------------------
-- Is_Procedure_Renaming_Declaration --
---------------------------------------
overriding function Is_Procedure_Renaming_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Procedure_Renaming_Declaration_Element;
-----------------------------------
-- Is_Protected_Body_Declaration --
-----------------------------------
overriding function Is_Protected_Body_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Protected_Body_Declaration_Element;
----------------------------
-- Is_Protected_Body_Stub --
----------------------------
overriding function Is_Protected_Body_Stub_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Protected_Body_Stub_Element;
-----------------------------
-- Is_Protected_Definition --
-----------------------------
overriding function Is_Protected_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Protected_Definition_Element;
-----------------------------------
-- Is_Protected_Type_Declaration --
-----------------------------------
overriding function Is_Protected_Type_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Protected_Type_Declaration_Element;
-----------------------------
-- Is_Qualified_Expression --
-----------------------------
overriding function Is_Qualified_Expression_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Qualified_Expression_Element;
------------------------------
-- Is_Quantified_Expression --
------------------------------
overriding function Is_Quantified_Expression_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Quantified_Expression_Element;
-------------------------
-- Is_Raise_Expression --
-------------------------
overriding function Is_Raise_Expression_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Raise_Expression_Element;
------------------------
-- Is_Raise_Statement --
------------------------
overriding function Is_Raise_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Raise_Statement_Element;
----------------------------------
-- Is_Range_Attribute_Reference --
----------------------------------
overriding function Is_Range_Attribute_Reference_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Range_Attribute_Reference_Element;
---------------------------------
-- Is_Real_Range_Specification --
---------------------------------
overriding function Is_Real_Range_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Real_Range_Specification_Element;
-------------------------
-- Is_Record_Aggregate --
-------------------------
overriding function Is_Record_Aggregate_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Record_Aggregate_Element;
-------------------------------------
-- Is_Record_Component_Association --
-------------------------------------
overriding function Is_Record_Component_Association_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Record_Component_Association_Element;
--------------------------
-- Is_Record_Definition --
--------------------------
overriding function Is_Record_Definition_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Record_Definition_Element;
-------------------------------------
-- Is_Record_Representation_Clause --
-------------------------------------
overriding function Is_Record_Representation_Clause_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Record_Representation_Clause_Element;
--------------------
-- Is_Record_Type --
--------------------
overriding function Is_Record_Type_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Record_Type_Element;
------------------------------
-- Is_Representation_Clause --
------------------------------
overriding function Is_Representation_Clause_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Representation_Clause_Element;
--------------------------
-- Is_Requeue_Statement --
--------------------------
overriding function Is_Requeue_Statement_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Requeue_Statement_Element;
------------------------------------
-- Is_Return_Object_Specification --
------------------------------------
overriding function Is_Return_Object_Specification_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Return_Object_Specification_Element;
------------------
-- Is_Root_Type --
------------------
overriding function Is_Root_Type_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Root_Type_Element;
--------------------
-- Is_Select_Path --
--------------------
overriding function Is_Select_Path_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Select_Path_Element;
-------------------------
-- Is_Select_Statement --
-------------------------
overriding function Is_Select_Statement_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Select_Statement_Element;
---------------------------
-- Is_Selected_Component --
---------------------------
overriding function Is_Selected_Component_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Selected_Component_Element;
--------------------------------
-- Is_Short_Circuit_Operation --
--------------------------------
overriding function Is_Short_Circuit_Operation_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Short_Circuit_Operation_Element;
----------------------------
-- Is_Signed_Integer_Type --
----------------------------
overriding function Is_Signed_Integer_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Signed_Integer_Type_Element;
--------------------------------
-- Is_Simple_Expression_Range --
--------------------------------
overriding function Is_Simple_Expression_Range_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Simple_Expression_Range_Element;
--------------------------------
-- Is_Simple_Return_Statement --
--------------------------------
overriding function Is_Simple_Return_Statement_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Simple_Return_Statement_Element;
-------------------------------------
-- Is_Single_Protected_Declaration --
-------------------------------------
overriding function Is_Single_Protected_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Single_Protected_Declaration_Element;
--------------------------------
-- Is_Single_Task_Declaration --
--------------------------------
overriding function Is_Single_Task_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Single_Task_Declaration_Element;
--------------
-- Is_Slice --
--------------
overriding function Is_Slice_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Slice_Element;
------------------
-- Is_Statement --
------------------
overriding function Is_Statement_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Statement_Element;
-----------------------
-- Is_String_Literal --
-----------------------
overriding function Is_String_Literal_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_String_Literal_Element;
----------------------------
-- Is_Subtype_Declaration --
----------------------------
overriding function Is_Subtype_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Subtype_Declaration_Element;
---------------------------
-- Is_Subtype_Indication --
---------------------------
overriding function Is_Subtype_Indication_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Subtype_Indication_Element;
------------------------------
-- Is_Task_Body_Declaration --
------------------------------
overriding function Is_Task_Body_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Task_Body_Declaration_Element;
-----------------------
-- Is_Task_Body_Stub --
-----------------------
overriding function Is_Task_Body_Stub_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Task_Body_Stub_Element;
------------------------
-- Is_Task_Definition --
------------------------
overriding function Is_Task_Definition_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Task_Definition_Element;
------------------------------
-- Is_Task_Type_Declaration --
------------------------------
overriding function Is_Task_Type_Declaration_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Task_Type_Declaration_Element;
----------------------------------------
-- Is_Terminate_Alternative_Statement --
----------------------------------------
overriding function Is_Terminate_Alternative_Statement_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Terminate_Alternative_Statement_Element;
------------------------
-- Is_Type_Conversion --
------------------------
overriding function Is_Type_Conversion_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Type_Conversion_Element;
-------------------------
-- Is_Type_Declaration --
-------------------------
overriding function Is_Type_Declaration_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Type_Declaration_Element;
------------------------
-- Is_Type_Definition --
------------------------
overriding function Is_Type_Definition_Element (Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Type_Definition_Element;
---------------------------------
-- Is_Unconstrained_Array_Type --
---------------------------------
overriding function Is_Unconstrained_Array_Type_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Unconstrained_Array_Type_Element;
----------------------------------
-- Is_Unknown_Discriminant_Part --
----------------------------------
overriding function Is_Unknown_Discriminant_Part_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_Unknown_Discriminant_Part_Element;
-------------------
-- Is_Use_Clause --
-------------------
overriding function Is_Use_Clause_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Use_Clause_Element;
----------------
-- Is_Variant --
----------------
overriding function Is_Variant_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Variant_Element;
---------------------
-- Is_Variant_Part --
---------------------
overriding function Is_Variant_Part_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_Variant_Part_Element;
-----------------------------
-- Is_While_Loop_Statement --
-----------------------------
overriding function Is_While_Loop_Statement_Element
(Self : Node) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end Is_While_Loop_Statement_Element;
--------------------
-- Is_With_Clause --
--------------------
overriding function Is_With_Clause_Element (Self : Node) return Boolean is
pragma Unreferenced (Self);
begin
return False;
end Is_With_Clause_Element;
---------------------------
-- Set_Enclosing_Element --
---------------------------
procedure Set_Enclosing_Element
(Self : access Program.Elements.Element'Class;
Value : access Program.Elements.Element'Class)
is
begin
if Self.all in Node'Class then
Node'Class (Self.all).Enclosing_Element := Value;
end if;
end Set_Enclosing_Element;
end Program.Nodes;
|
-- Copyright (c) 2021 Devin Hill
-- zlib License -- see LICENSE for details.
procedure Sprites
with Linker_Section => ".iwram", No_Inline;
pragma Machine_Attribute (Sprites, "target", "arm");
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . E X C E P T I O N _ A C T I O N S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2002-2005, 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- --
-- 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, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides support for callbacks on exceptions
-- These callbacks are called immediately when either a specific exception,
-- or any exception, is raised, before any other actions taken by raise, in
-- particular before any unwinding of the stack occcurs.
-- Callbacks for specific exceptions are registered through calls to
-- Register_Id_Action. Here is an example of code that uses this package to
-- automatically core dump when the exception Constraint_Error is raised.
-- Register_Id_Action (Constraint_Error'Identity, Core_Dump'Access);
-- Subprograms are also provided to list the currently registered exceptions,
-- or to convert from a string to an exception id.
-- This package can easily be extended, for instance to provide a callback
-- whenever an exception matching a regular expression is raised. The idea
-- is to register a global action, called whenever any exception is raised.
-- Dispatching can then be done directly in this global action callback.
with Ada.Exceptions; use Ada.Exceptions;
package GNAT.Exception_Actions is
type Exception_Action is access
procedure (Occurence : Exception_Occurrence);
-- General callback type whenever an exception is raised. The callback
-- procedure must not propagate an exception (execution of the program
-- is erroneous if such an exception is propagated).
procedure Register_Global_Action (Action : Exception_Action);
-- Action will be called whenever an exception is raised. Only one such
-- action can be registered at any given time, and registering a new action
-- will override any previous action that might have been registered.
--
-- Action is called before the exception is propagated to user's code.
-- If Action is null, this will in effect cancel all exception actions.
procedure Register_Id_Action
(Id : Exception_Id;
Action : Exception_Action);
-- Action will be called whenever an exception of type Id is raised. Only
-- one such action can be registered for each exception id, and registering
-- a new action will override any previous action registered for this
-- Exception_Id. Program_Error is raised if Id is Null_Id.
function Name_To_Id (Name : String) return Exception_Id;
-- Convert an exception name to an exception id. Null_Id is returned
-- if no such exception exists. Name must be an all upper-case string,
-- or the exception will not be found. The exception name must be fully
-- qualified (but not including Standard). It is not possible to convert
-- an exception that is declared within an unlabeled block.
--
-- Note: All non-predefined exceptions will return Null_Id for programs
-- compiled with pragma Restriction (No_Exception_Registration)
function Registered_Exceptions_Count return Natural;
-- Return the number of exceptions that have been registered so far.
-- Exceptions declared locally will not appear in this list until their
-- block has been executed at least once.
--
-- Note: The count includes only predefined exceptions for programs
-- compiled with pragma Restrictions (No_Exception_Registration).
type Exception_Id_Array is array (Natural range <>) of Exception_Id;
procedure Get_Registered_Exceptions
(List : out Exception_Id_Array;
Last : out Integer);
-- Return the list of registered exceptions.
-- Last is the index in List of the last exception returned.
--
-- An exception is registered the first time the block containing its
-- declaration is elaborated. Exceptions defined at library-level are
-- therefore immediately visible, whereas exceptions declared in local
-- blocks will not be visible until the block is executed at least once.
--
-- Note: The list contains only the predefined exceptions if the program
-- is compiled with pragma Restrictions (No_Exception_Registration);
procedure Core_Dump (Occurrence : Exception_Occurrence);
-- Dump memory (called a core dump in some systems), and abort execution
-- of the application.
end GNAT.Exception_Actions;
|
-- { dg-do run }
-- { dg-options "-gnatws" }
pragma Locking_Policy (Ceiling_Locking);
with test_prio_p;use test_prio_p;
with text_io; use text_io;
procedure Test_Prio is
task Tsk is
pragma Priority (10);
end Tsk;
task body Tsk is
begin
Sema2.Seize;
Sema1.Seize;
Put_Line ("error");
exception
when Program_Error => null; -- OK
end;
begin
null;
end;
|
-- { dg-do compile }
package body Frame_Overflow is
function -- { dg-error "too large" }
Set_In (Bitmap : Bitmap_T; Bitpos : Bitpos_Range_T) return Bitmap_T
is
Result: Bitmap_T := Bitmap;
begin
Result.Bits (Bitpos) := True;
return Result;
end;
function -- { dg-error "too large" }
Negate (Bitmap : Bitmap_T) return Bitmap_T
is
Result: Bitmap_T;
begin
for E in Bitpos_Range_T loop
Result.Bits (E) := not Bitmap.Bits (E);
end loop;
return Result;
end;
end Frame_Overflow;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Containers.Generic_Array_Sort;
with Ada.Containers.Indefinite_Vectors;
procedure Danagrams is
package StringVector is new Ada.Containers.Indefinite_Vectors
(Positive, String);
procedure StrSort is new Ada.Containers.Generic_Array_Sort
(Index_Type => Positive,
Element_Type => Character,
Array_Type => String);
function Derange (s1 : String; s2 : String) return Boolean is begin
for i in s1'Range loop
if (s1 (i) = s2 (i)) then return False; end if;
end loop;
return True;
end Derange;
File : File_Type;
len, foundlen : Positive := 1;
Vect, SVect : StringVector.Vector;
index, p1, p2 : StringVector.Extended_Index := 0;
begin
Open (File, In_File, "unixdict.txt");
while not End_Of_File (File) loop
declare str : String := Get_Line (File);
begin
len := str'Length;
if len > foundlen then
Vect.Append (str);
StrSort (str);
index := 0;
loop -- Loop through anagrams by index in vector of sorted strings
index := SVect.Find_Index (str, index + 1);
exit when index = StringVector.No_Index;
if Derange (Vect.Last_Element, Vect.Element (index)) then
p1 := Vect.Last_Index; p2 := index;
foundlen := len;
end if;
end loop;
SVect.Append (str);
end if;
end;
end loop;
Close (File);
Put_Line (Vect.Element (p1) & " " & Vect.Element (p2));
end Danagrams;
|
-- MURMUR3
--
-- taken from http://commons.ada.cx/Deterministic_Hashing
-- source at http://pastebin.com/ZhgRacMr
--
-- Baldrick on #ada provided an implementation of Murmur3.
-- Generic_Murmur3 is the core logic, the rest are convenience functions.
--
-- license: asked on #ada (Baldrick, 2014-04-07): public domain
with Ada.Containers;
with System.Storage_Elements;
package Hashing is
pragma Pure;
-- Provides a set of easy to use, efficient and well-behaved hash functions.
-- These are not cryptographic (secure) hashes, they are designed for use in
-- hash tables and such like. It is easy to add support for more types (just
-- ask).
-- Storage --
function Hash
(S : System.Storage_Elements.Storage_Array;
Seed : Ada.Containers.Hash_Type)
return Ada.Containers.Hash_Type with Inline;
function Hash (S : System.Storage_Elements.Storage_Array)
return Ada.Containers.Hash_Type is (Hash (S, 0));
-- Discrete types (includes integers) --
generic
type T is (<>);
function Discrete_Hash (
Value : T;
Seed : Ada.Containers.Hash_Type
) return Ada.Containers.Hash_Type with Inline;
-- Pointer types --
function Hash
(A : System.Address;
Seed : Ada.Containers.Hash_Type)
return Ada.Containers.Hash_Type with Inline, Pure_Function;
-- Yes, this is really pure in spite of using System.Address (GNAT disables
-- pureness of functions using System.Address by default because users often
-- turn the address into a pointer and do impure things with it).
function Hash (A : System.Address) return Ada.Containers.Hash_Type
is (Hash (A, 0));
generic
type Any_Type (<>) is limited private;
function Anonymous_Pointer_Hash (
Pointer : access constant Any_Type;
Seed : Ada.Containers.Hash_Type
) return Ada.Containers.Hash_Type with Inline;
generic
type Any_Type (<>) is limited private;
type Any_Access is access all Any_Type;
function All_Pointer_Hash (
Pointer : Any_Access;
Seed : Ada.Containers.Hash_Type
) return Ada.Containers.Hash_Type with Inline;
generic
type Any_Type (<>) is limited private;
type Any_Access is access constant Any_Type;
function Constant_Pointer_Hash (
Pointer : Any_Access;
Seed : Ada.Containers.Hash_Type
) return Ada.Containers.Hash_Type with Inline;
generic
type Any_Type (<>) is limited private;
type Any_Access is access Any_Type;
function Pointer_Hash (
Pointer : Any_Access;
Seed : Ada.Containers.Hash_Type
) return Ada.Containers.Hash_Type with Inline;
end Hashing;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2017, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Matreshka.Internals.Unicode.Ucd;
separate (UAFLEX.Scanners)
package body Tables is
subtype First_Stage_Index is
Matreshka.Internals.Unicode.Ucd.First_Stage_Index;
subtype Second_Stage_Index is
Matreshka.Internals.Unicode.Ucd.Second_Stage_Index;
type Second_Stage_Array is array (Second_Stage_Index) of Character_Class;
type Second_Stage_Array_Access is
not null access constant Second_Stage_Array;
type First_Stage_Array is
array (First_Stage_Index) of Second_Stage_Array_Access;
S_0 : aliased constant Second_Stage_Array :=
(17, 17, 17, 17, 17, 17, 17, 17,
17, 19, 3, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
1, 17, 14, 17, 17, 4, 17, 17,
17, 17, 17, 17, 17, 2, 17, 17,
6, 6, 6, 6, 6, 6, 6, 6,
6, 6, 17, 17, 17, 17, 17, 17,
17, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 5, 12, 12, 12, 12,
7, 12, 12, 13, 16, 18, 17, 6,
17, 10, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 11, 5, 8, 12, 12, 12,
7, 12, 12, 9, 17, 15, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17);
S_1 : aliased constant Second_Stage_Array :=
(17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17);
S_2 : aliased constant Second_Stage_Array :=
(0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0);
First : constant First_Stage_Array :=
(S_0'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_2'Access, S_2'Access, S_2'Access, S_2'Access,
S_2'Access, S_2'Access, S_2'Access, S_2'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access,
S_1'Access, S_1'Access, S_1'Access, S_1'Access);
Switch_Table : constant array (State range 0 .. 72,
Character_Class range 0 .. 19) of State :=
(0 =>
(1 | 19 => 28, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 => 29, 3 => 73, others => 84),
28 =>
(1 | 19 => 28, others => 84),
29 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 => 29, others => 84),
1 =>
(1 | 19 => 2, 2 => 3, 4 => 4, 5 | 7 | 8 | 10 | 11 | 12 => 30, 3 => 74
, others => 84),
2 =>
(1 | 19 => 2, 2 => 3, 3 => 74, others => 84),
3 =>
(2 => 6, others => 84),
4 =>
(5 => 31, 7 => 75, 4 => 5, others => 84),
30 =>
(5 | 6 | 7 | 8 | 10 | 11 | 12 => 30, others => 84),
31 =>
(8 => 7, others => 84),
5 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 => 5, 3 => 76, others => 84),
6 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 => 6, 3 => 77, others => 84),
7 =>
(10 => 8, others => 84),
8 =>
(11 => 9, others => 84),
9 =>
(8 => 31, others => 84),
10 =>
(9 => 11, 1 | 19 => 32, 3 => 78, others => 84),
11 =>
(1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 16 | 17 |
18 | 19 => 11, 14 => 12, 15 => 79, others => 84),
32 =>
(1 | 19 => 32, 3 => 78, others => 84),
12 =>
(1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 |
17 | 18 | 19 => 12, 14 => 11, others => 84),
13 =>
(3 => 80, 5 | 7 | 8 | 10 | 11 | 12 => 33, 1 | 19 => 34, others => 84
),
33 =>
(5 | 6 | 7 | 8 | 10 | 11 | 12 => 33, others => 84),
34 =>
(1 | 19 => 34, others => 84),
14 =>
(1 | 19 => 15, 2 => 35, 13 => 36, 14 => 37, 16 => 38, 4 => 39, 3 =>
81, 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 15 | 17 | 18 => 40
, others => 84),
15 =>
(1 | 19 => 15, 2 => 16, 3 => 81, others => 84),
35 =>
(2 => 61, 13 => 36, 14 => 37, 16 => 38, 4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 15 | 17 | 18 => 40, others => 84),
36 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 36, 14 =>
47, 18 => 40, 1 | 19 => 21, 16 => 53, others => 84),
37 =>
(13 => 47, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 14 | 15 | 17 |
18 => 37, 16 => 48, 1 | 19 => 19, others => 84),
38 =>
(13 => 36, 14 => 37, 16 => 45, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 15 | 17 | 18 => 40, others => 84),
39 =>
(13 => 36, 14 => 37, 16 => 38, 4 => 41, 2 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 15 | 17 | 18 => 40, others => 84),
40 =>
(13 => 36, 14 => 37, 16 => 38, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 15 | 17 | 18 => 40, others => 84),
16 =>
(2 => 17, others => 84),
17 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 => 17, 3 => 82, others => 84),
41 =>
(13 => 42, 14 => 43, 16 => 44, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 15 | 17 | 18 => 41, 1 | 19 => 18, 3 => 83, others => 84),
42 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 42, 14 =>
49, 18 => 41, 1 | 19 => 22, 16 => 54, 3 => 83, others => 84),
43 =>
(13 => 49, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 14 | 15 | 17 |
18 => 43, 16 => 50, 1 | 19 => 20, 3 => 83, others => 84),
44 =>
(13 => 42, 14 => 43, 16 => 46, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 15 | 17 | 18 => 41, 1 | 19 => 18, 3 => 83, others => 84),
18 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 => 18, 3 => 83, others => 84),
45 =>
(13 => 36, 14 => 37, 16 => 45, 1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 15 | 17 | 18 => 40, others => 84),
46 =>
(13 => 42, 14 => 43, 16 => 46, 1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 15 | 17 | 18 => 41, 19 => 18, 3 => 83, others => 84),
47 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 => 47
, 18 => 37, 1 | 19 => 23, 16 => 55, others => 84),
48 =>
(13 => 47, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 14 | 15 | 17 |
18 => 37, 16 => 51, 1 | 19 => 19, others => 84),
19 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 | 17 |
18 | 19 => 19, 14 => 40, others => 84),
49 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 => 49
, 18 => 43, 1 | 19 => 24, 16 => 56, 3 => 83, others => 84),
50 =>
(13 => 49, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 14 | 15 | 17 |
18 => 43, 16 => 52, 1 | 19 => 20, 3 => 83, others => 84),
20 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 | 17 |
18 | 19 => 20, 14 => 41, 3 => 83, others => 84),
51 =>
(13 => 47, 1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 14 | 15 |
17 | 18 => 37, 16 => 51, 19 => 19, others => 84),
52 =>
(13 => 49, 1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 14 | 15 |
17 | 18 => 43, 16 => 52, 19 => 20, 3 => 83, others => 84),
21 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 19 => 21, 18 => 40, others => 84),
53 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 36, 14 =>
47, 18 => 40, 1 | 19 => 21, 16 => 57, others => 84),
22 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 19 => 22, 18 => 41, 3 => 83, others => 84),
54 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 42, 14 =>
49, 18 => 41, 1 | 19 => 22, 16 => 58, 3 => 83, others => 84),
23 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 | 17 |
19 => 23, 18 => 37, 14 => 36, others => 84),
55 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 => 47
, 18 => 37, 1 | 19 => 23, 16 => 59, others => 84),
24 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 | 17 |
19 => 24, 18 => 43, 14 => 42, 3 => 83, others => 84),
56 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 => 49
, 18 => 43, 1 | 19 => 24, 16 => 60, 3 => 83, others => 84),
57 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 36,
14 => 47, 18 => 40, 16 => 57, 19 => 21, others => 84),
58 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 42,
14 => 49, 18 => 41, 16 => 58, 19 => 22, 3 => 83, others => 84),
59 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 =>
47, 18 => 37, 16 => 59, 19 => 23, others => 84),
60 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 =>
49, 18 => 43, 16 => 60, 19 => 24, 3 => 83, others => 84),
61 =>
(13 => 62, 3 => 82, 1 | 19 => 17, 14 => 63, 16 => 64, 2 | 4 | 5 | 6
| 7 | 8 | 9 | 10 | 11 | 12 | 15 | 17 | 18 => 61, others => 84),
62 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 62, 3 =>
82, 1 | 19 => 26, 14 => 66, 18 => 61, 16 => 69, others => 84),
63 =>
(13 => 66, 3 => 82, 1 | 19 => 25, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 14 | 15 | 17 | 18 => 63, 16 => 67, others => 84),
64 =>
(13 => 62, 3 => 82, 1 | 19 => 17, 14 => 63, 16 => 65, 2 | 4 | 5 | 6
| 7 | 8 | 9 | 10 | 11 | 12 | 15 | 17 | 18 => 61, others => 84),
65 =>
(13 => 62, 3 => 82, 1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
15 | 17 | 18 => 61, 14 => 63, 16 => 65, 19 => 17, others => 84),
66 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 => 66
, 3 => 82, 1 | 19 => 27, 18 => 63, 16 => 70, others => 84),
25 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 | 17 |
18 | 19 => 25, 3 => 82, 14 => 61, others => 84),
67 =>
(13 => 66, 3 => 82, 1 | 19 => 25, 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 14 | 15 | 17 | 18 => 63, 16 => 68, others => 84),
68 =>
(13 => 66, 3 => 82, 1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
14 | 15 | 17 | 18 => 63, 16 => 68, 19 => 25, others => 84),
26 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 19 => 26, 3 => 82, 18 => 61, others => 84),
69 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 62, 3 =>
82, 1 | 19 => 26, 14 => 66, 18 => 61, 16 => 71, others => 84),
27 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 16 | 17 |
19 => 27, 3 => 82, 18 => 63, 14 => 62, others => 84),
70 =>
(2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 => 66
, 3 => 82, 1 | 19 => 27, 18 => 63, 16 => 72, others => 84),
71 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 15 | 17 => 62,
3 => 82, 14 => 66, 18 => 61, 16 => 71, 19 => 26, others => 84),
72 =>
(1 | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 17 =>
66, 3 => 82, 18 => 63, 16 => 72, 19 => 27, others => 84));
Rule_Table : constant array (State range 28 .. 83) of Rule_Index :=
(28 => 7, 29 => 8, 73 => 9, 30 => 4, 74 => 6, 31 => 2,
75 => 3, 76 => 5, 77 => 1, 32 => 18, 78 => 19, 79 => 17,
80 => 10, 33 => 11, 34 => 12, 35 => 14, 36 => 14, 37 => 14,
38 => 14, 39 => 14, 81 => 15, 40 => 14, 82 => 13, 41 => 14,
42 => 14, 43 => 14, 44 => 14, 83 => 16, 45 => 14, 46 => 14,
47 => 14, 48 => 14, 49 => 14, 50 => 14, 51 => 14, 52 => 14,
53 => 14, 54 => 14, 55 => 14, 56 => 14, 57 => 14, 58 => 14,
59 => 14, 60 => 14, 61 => 14, 62 => 14, 63 => 14, 64 => 14,
65 => 14, 66 => 14, 67 => 14, 68 => 14, 69 => 14, 70 => 14,
71 => 14, 72 => 14);
function Rule (S : State) return Rule_Index is
begin
return Rule_Table (S);
end Rule;
function Switch (S : State; Class : Character_Class) return State is
begin
return Switch_Table (S, Class);
end Switch;
function To_Class (Value : Matreshka.Internals.Unicode.Code_Point)
return Character_Class
is
function Element is new Matreshka.Internals.Unicode.Ucd.Generic_Element
(Character_Class, Second_Stage_Array,
Second_Stage_Array_Access, First_Stage_Array);
begin
return Element (First, Value);
end To_Class;
end Tables;
|
------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- Command Line Interface --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020-2021, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Calendar;
with Ada.Containers;
with Ada.Characters.Latin_1;
with Ada.Characters.Conversions;
with Ada.Strings.Fixed;
with CLI; use CLI;
with CLI.Widgets.Spinners;
with CLI.Widgets.Progress_Bars;
with Workers;
with Workers.Reporting;
with Registrar.Registration;
with Registrar.Queries;
with Registrar.Subsystems;
with Registrar.Library_Units;
with Registrar.Source_Files;
with Registrar.Implementation_Hashing;
with Repositories;
with Repositories.Cache;
with Progress;
with Unit_Names;
with User_Queries;
with User_Notices;
with Scheduling;
package body UI_Primitives is
------------------
-- Print_Banner --
------------------
procedure Print_Banner is
subtype Banner_Line is String (1 .. 60);
type Banner_Unit is array (Positive range <>) of Banner_Line;
Banner: constant Banner_Unit(1 .. 4)
:= (1 => " ,==== == == ====. ,==== Ada User Repository Annex ",
2 => ".==|==..==|==..==|==..==|==. Reference Implementation ",
3 => ":-----::--|--::----.::-----: Version 0.1 ",
4 => "|__|__||.___,||__|._||__|__| (C) 2020-2021 ANNEXI-STRAYLINE");
Banner_Color_Map: constant Banner_Unit(1 .. 4)
:= (1 => "511111551151155111115511111555555555555555555555555555555555",
2 => "622622662262266226226622622666666666666666666666666666666666",
3 => "733333773373377333337733333777777777777777777777777777777777",
4 => "844844884444488448448844844888888888888888888888888888888888");
type Style_Set is array (1 .. 8) of Text_Style;
Styles: Style_Set := (1 => Blue_FG + Bold,
2 => Blue_FG + Bold,
3 => Blue_FG + Bold,
4 => Magenta_FG,
5 => White_FG,
6 => White_FG,
7 => White_FG,
8 => White_FG);
function Map_To_Style (C: in Character) return Text_Style is
(case C is
when '1' => Styles(1),
when '2' => Styles(2),
when '3' => Styles(3),
when '4' => Styles(4),
when '5' => Styles(5),
when '6' => Styles(6),
when '7' => Styles(7),
when others => Styles(8));
Run_Start: Positive;
Run_End : Positive;
Run_Sample: Character;
begin
Clear_Line;
for L in Banner'Range loop
declare
Logo: Banner_Line renames Banner(L);
Map : Banner_Line renames Banner_Color_Map(L);
begin
Run_Start := Map'First;
while Run_Start <= Map'Last loop
Run_Sample := Map(Run_Start);
for I in Run_Start .. Map'Last loop
exit when Map(I) /= Run_Sample;
Run_End := I;
end loop;
Put (Message => Logo(Run_Start .. Run_End),
Style => Map_To_Style (Run_Sample));
Run_Start := Run_End + 1;
end loop;
end;
New_Line;
end loop;
New_Line;
end Print_Banner;
----------------
-- Print_Help --
----------------
procedure Print_Help is
begin
Put_Line (Message => "Usage: aura [command] [options]");
New_Line;
Put_Line ("If no command is specified, the command defaults to ""checkout""");
New_Line;
Put_Line (Message => "Available Commands", Style => Bold);
New_Line;
Put_Line (Message => "help", Style => Underline);
New_Line;
Put_Line (Message => "Display this message");
New_Line;
Put_Line (Message => "clean", Style => Underline);
New_Line;
Put_Line ("Removes all previous compilation objects, as well as all");
Put_Line ("previous run data, including the build option history");
New_Line;
Put_Line ("This DOES NOT remove any compiled executables or libraries,");
Put_Line ("however invoking aura build/library after aura clean will");
Put_Line ("force their recompilation");
New_Line;
Put (Message => "checkout", Style => Underline);
Put_Line (Message => " [subsystem name] [[subsystem name] [...]]",
Style => Bold);
New_Line;
Put_Line ("Attempts to identify and check-out all required subsystems, ");
Put_Line ("and also inducts those directly specified (including their ");
Put_Line ("dependencies), but does not execute compilation.");
New_Line;
Put (Message => "compile", Style => Underline);
Put_Line (Message => " [-no-pic] [-debug] [-assertions] "
& "[-optimize-1/2/3/size/debug]",
Style => Bold);
New_Line;
Put_Line ("-no-pic Explicitly disable PIC compilation");
Put_Line ("-debug Enable debugging information. It is recommended");
Put_Line (" that -optimize-debug also be used");
Put_Line ("-assertions Force all assertions on for all Ada units");
Put_Line ("-optimize Enable an optimization level. If not specified,");
Put_Line (" no optimization is applied.");
Put_Line (" -1/2/3: Optimization levels of increasing ");
Put_Line (" optimization.");
Put_Line (" -size : Optimize for size");
Put_Line (" -debug: Optimize for debugging");
New_Line;
Put_Line ("The selected compile options are presistent. Subsequent");
Put_Line ("invocations of aura compile with no other options causes");
Put_Line ("the same options of the previous run to be used.");
New_Line;
Put_Line ("If no options were stored (after aura clean, or a new project,");
Put_Line ("then the default options (no options) is used - which is to");
Put_Line ("ouput unoptimized position-independent without debug info.");
New_Line;
Put (Message => "build/run", Style => Underline);
Put_Line (Message =>" [main unit] [-no-pie] [-static-rt/-static] [-debug]"
& " [-assertions]",
Style => Bold);
Put_Line (Message => " [-optimize-1/2/3/size/debug]",
Style => Bold);
New_Line;
Put_Line ("Invokes checkout, then compile. If compilation succeeds, an");
Put_Line ("executable is generated. If the command is run, and the");
Put_Line ("build succeeds, the generated executable is executed.");
New_Line;
Put_Line ("The configuration invocation attempts to create a dynamically");
Put_Line ("linked, position-independent executable (ASLR-capable).");
New_Line;
Put_Line ("-no-pie Disables explicit pic compiler options during");
Put_Line (" compilation and pie linker options during");
Put_Line (" linking - implies the -no-pic compile option");
Put_Line ("-static-rt Attempts to statically link the Ada runtime");
Put_Line (" (and libgcc for GNAT) specifically");
Put_Line ("-static Attempts to force the executable to be fully");
Put_Line (" statically linked (including libc, pthreads,");
Put_Line (" etc.) Only use this option if you know what");
Put_Line (" you are doing. This option implies -no-pic");
Put_Line (" and -static-rt");
New_Line;
Put_Line ("All other parameters are passed to compile. Like compile,");
Put_Line ("these options are persistent between runs.");
New_Line;
Put_Line ("If a main unit is not given, the resulting executable");
Put_Line ("elaborates all root units on execution.");
New_Line;
Put_Line ("If a static executable is built, the required libraries for");
Put_Line ("linking must be at a path specified by the environment variable");
Put_Line ("LIBRARY_PATH, and must have the format ""library_name.a"".");
New_Line;
Put_Line ("The executable generated takes the name of the main unit, if");
Put_Line ("specified. If no main unit is specified, the executable takes ");
Put_Line ("the name of aura.out");
New_Line;
Put (Message => "library", Style => Underline);
Put_Line (Message => " [-no-pie] [-static-rt/-static] [-debug] "
& "[-optimize-1/2/3/size/debug]",
Style => Bold);
Put_Line (Message => " library_name.a/so/dylib/dll",
Style => Bold);
New_Line;
Put_Line ("[-optimize-1/2/3/size/debug] library_name.a/so/dylib/dll");
New_Line;
Put_Line ("Used to generate a stand-alone library that may be included in");
Put_Line ("other non-ada programs.");
New_Line;
Put_Line ("To create Ada-specific shared libraries, see the systemize command");
New_Line;
Put_Line ("Library Invokes fetch then compile. Before linking or archiving the");
Put_Line ("specified library");
New_Line;
Put_Line ("The created library does not have a main subprogram, but will have");
Put_Line ("symbols for C-exported adainit and adafinal C-convention subprograms.");
Put_Line ("These subprograms must be invoked before and after using the library,");
Put_Line ("Respectively");
New_Line;
Put_Line ("NOTE: Using multiple aura-built libraries in a single executable is not");
Put_Line ("possible due to the initialization/finalization subprograms. However a");
Put_Line ("feature to allow specific naming of those subprograms may be added in the");
Put_Line ("future.");
New_Line;
Put_Line ("The library type (static vs dynamic) is determined by the extension");
New_Line;
Put_Line ("If a static library (archive) is built, the required libraries for");
Put_Line ("linking must be either in the project root, or else must");
Put_Line ("be at a path specified by the environment variable");
Put_Line ("LIBRARY_PATH, and must have the format ""library_name.a"".");
New_Line;
Put_Line ("For static libraries (archives), -static is implied. This, in-");
Put_Line ("effect causes a static Ada runtime to be included in the archive");
New_Line;
Put_Line ("Additionally, when building static libraries, all Linker_Options");
Put_Line ("pragmas, together with required libraries will be output into a");
Put_Line ("separate file ""library_name.linkopt"". These options should be passed");
Put_Line ("to the linker or linker driver when using the static library");
New_Line;
Put_Line ("For dynamic libraries, if -static or -static-rt is NOT given, the");
Put_Line ("resulting library will have dynamic dependencies on the shared Ada");
Put_Line ("runtime. Care should be taken when using partition-specific pragmas");
Put_Line ("accross multiple such libraries, as they will have global effects");
Put_Line ("due to a single Ada runtime being shared amongst them.");
New_Line;
Put_Line ("Using -static or -static-rt when building a shared library will cause");
Put_Line ("the resulting library to contian it's own instance of the Ada runtime");
New_Line;
New_Line;
Put_Line ("If the "".so"" extension is given for library_name, then");
Put_Line ("even if ""-static"" is given, the produced library will be");
Put_Line ("a dynamic library.");
New_Line;
Put_Line ("The initialization (elaboration) and finalization are");
Put_Line ("registered with the linker for shared (default) or");
Put_Line ("-static-rt libraries. If -static is used, the adainit and");
Put_Line ("adafinal must be called by the user of the library");
New_Line;
Put_Line ("Options -static/-static-rt have no effect if buidling an");
Put_Line ("archive library");
New_Line;
New_Line;
Put (Message => "systemize", Style => Underline);
Put_Line (Message => " [-repo-add/show] [-debug] [-optmize-1/2/3/size/debug]",
Style => Bold);
Put_Line (Message => " destination_path",
Style => Bold);
New_Line;
Put_Line ("Systemize builds separate shared libraries for each AURA");
Put_Line ("subsystem, and then installs them into a read-only pre-");
Put_Line ("formatted ""System"" AURA Repository at destination_path");
New_Line;
Put_Line ("-repo-add A repository that points to the newly created");
Put_Line (" System Repository is added to the project");
New_Line;
Put_Line ("-repo-show The content needed to create a Repository Spec");
Put_Line (" for the newly created System Repository is output.");
Put_Line (" This is the default.");
New_Line;
Put_Line (Message => "General Options", Style => Underline);
Put_Line ("-v When common errors occur, output extra information");
Put_Line ("-q When common errors occur, output minimum information");
Put_Line ("-y Answer all queries automatically with the default response");
New_Line;
end Print_Help;
-------------
-- Put_Tag --
-------------
procedure Put_Tag (Tag: Tag_Type) is
Tag_Styles: constant array (Tag_Type) of Text_Style
:= (EXEC => Black_BG + Cyan_FG + Bold,
OK => Green_FG + Bold,
FAIL => Red_BG + White_FG,
WARN => Yellow_BG + Black_FG,
QUERY => Magenta_BG + White_FG,
INFO => Blue_BG + White_FG);
subtype Tag_String is String (1 .. 6);
Term_Tags: constant array (Tag_Type) of Tag_String
:= (EXEC => " EXEC ",
OK => " OK ",
FAIL => " FAIL ",
WARN => " WARN ",
QUERY => " QURY ",
INFO => " INFO ");
Pipe_Tags: constant array (Tag_Type) of Tag_String
:= (EXEC => "[EXEC]",
OK => "[OKAY]",
FAIL => "[FAIL]",
WARN => "[WARN]",
QUERY => "[QURY]",
INFO => "[INFO]");
begin
if Output_Is_Terminal then
Put (Message => Term_Tags (Tag), Style => Tag_Styles (Tag));
else
Put (Pipe_Tags(Tag));
end if;
end Put_Tag;
-------------------
-- Put_Empty_Tag --
-------------------
procedure Put_Empty_Tag is
begin
Put (String'(1 .. 6 => ' '));
end Put_Empty_Tag;
-----------------
-- Put_Divider --
-----------------
procedure Put_Divider is
begin
Put_Line (String'(1 .. Terminal_Width => '-'));
end Put_Divider;
------------------
-- Query_Driver --
------------------
procedure Query_Driver (Prompt : in String;
Default : in String;
Response: out String;
Last : out Natural)
is
use Ada.Characters.Latin_1;
begin
Clear_Line;
Put_Query_Tag;
Put (' ' & Prompt);
if Auto_Queries then
Put (Default);
Response := Default;
Last := Default'Last;
else
Get_Line (Item => Response,
Last => Last);
end if;
end;
------------------
-- Dump_Reports --
------------------
procedure Dump_Reports is
use Workers, Workers.Reporting;
R: Work_Report;
begin
for I in 1 .. Available_Reports loop
R := Retrieve_Report;
Put_Line ("-- Worker Report" & Count_Type'Image (I)
& " (" & Report_Kind'Image (R.Kind) & ')'
& " --");
Put_Line (To_String (R.Work_Order_Information));
if R.Kind = Error then
CLI.New_Line;
Put_Line (To_String (R.Exception_Information));
end if;
if Length (R.Worker_Note) > 0 then
CLI.New_Line;
Put_Line ("Worker Note: " & To_String (R.Worker_Note));
end if;
CLI.New_Line;
end loop;
end Dump_Reports;
-----------------------
-- Dump_Repositories --
-----------------------
procedure Dump_Repositories is
use Repositories;
All_Repos: constant Repository_Vectors.Vector
:= Extract_All;
I: Repository_Index := 1;
begin
New_Line;
Put_Line ("Repositories");
for Repo of All_Repos loop
New_Line;
Put_Line ("Repository" & Repository_Index'Image (I));
Put_Line (" Format : "
& Repository_Format'Image (Repo.Format));
Put_Line (" Location : " & UBS.To_String (Repo.Location));
Put_Line (" Snapshot : " & UBS.To_String (Repo.Snapshot));
Put_Line (" Cache_State : "
& Repository_Cache_State'Image (Repo.Cache_State));
Put_Line (" Cache_Path : " & UBS.To_String (Repo.Cache_Path));
if Repo.Format = Git then
Put_Line (" Tracking_Branch: "
& UBS.To_String (Repo.Tracking_Branch));
end if;
I := I + 1;
end loop;
end Dump_Repositories;
---------------------
-- Dump_Subsystems --
---------------------
procedure Dump_Subsystems is
use Ada.Containers;
use Registrar.Queries;
use Registrar.Subsystems;
use Registrar.Source_Files;
use Unit_Names;
Subsystems: Subsystem_Sets.Set := All_Subsystems;
begin
for SS of Subsystems loop
New_Line;
Put_Line (SS.Name.To_UTF8_String);
Put_Line (" AURA : " & Boolean'Image (SS.AURA));
Put_Line (" State : " & Subsystem_State'Image (SS.State));
if SS.State = Available and then SS.AURA then
Put_Line ("--- Config ---");
Put_Line (" External_Libraries:");
for Item of SS.Configuration.External_Libraries loop
Put (" " & Ada.Characters.Conversions
.To_String (WWU.To_Wide_Wide_String (Item.Name)));
Put_Line (" => " & UBS.To_String (Item.Value));
end loop;
Put_Line (" Ada_Compiler_Opts");
for Item of SS.Configuration.Ada_Compiler_Opts loop
Put (" " & Ada.Characters.Conversions
.To_String (WWU.To_Wide_Wide_String (Item.Name)));
Put_Line (" => " & UBS.To_String (Item.Value));
end loop;
Put_Line (" C_Compiler_Opts");
for Item of SS.Configuration.C_Compiler_Opts loop
Put (" " & Ada.Characters.Conversions
.To_String (WWU.To_Wide_Wide_String (Item.Name)));
Put_Line (" => " & UBS.To_String (Item.Value));
end loop;
Put_Line (" C_Definitions");
for Item of SS.Configuration.C_Definitions loop
Put (" " & Ada.Characters.Conversions
.To_String (WWU.To_Wide_Wide_String (Item.Name)));
Put_Line (" => " & UBS.To_String (Item.Value));
end loop;
Put_Line (" Codepaths");
for Item of SS.Configuration.Codepaths loop
Put (" " & Ada.Characters.Conversions
.To_String (WWU.To_Wide_Wide_String (Item.Name)));
Put_Line (" => " & UBS.To_String (Item.Value));
end loop;
Put_Line (" Information");
for Item of SS.Configuration.Information loop
Put (" " & Ada.Characters.Conversions
.To_String (WWU.To_Wide_Wide_String (Item.Name)));
Put_Line (" => " & UBS.To_String (Item.Value));
end loop;
end if;
end loop;
end Dump_Subsystems;
------------------------
-- Dump_Library_Units --
------------------------
procedure Dump_Library_Units is
use Ada.Containers;
use Registrar.Queries;
use Registrar.Library_Units;
use Registrar.Source_Files;
use Unit_Names;
Units: Library_Unit_Sets.Set := All_Library_Units;
begin
for Unit of Units loop
New_Line;
Put_Line (Unit.Name.To_UTF8_String);
Put_Line (" Subsystem : " & Unit.Name.Subsystem_Name.To_UTF8_String);
Put_Line (" State : " & Library_Unit_State'Image (Unit.State));
Put_Line (" Kind : " & Library_Unit_Kind'Image (Unit.Kind));
Put_Line (" Have Spec? : " & Boolean'Image (Unit.Spec_File /= null));
Put_Line (" Have Body? : " & Boolean'Image (Unit.Body_File /= null));
Put_Line (" Subunits : " & Count_Type'Image (Unit.Subunit_Bodies.Length));
Put_Line (" Spec Hash : " & Unit.Specification_Hash.To_String);
Put_Line (" Impl Hash : " & Unit.Implementation_Hash.To_String);
Put_Line (" Spec_File : " & (if Unit.Spec_File /= null then Unit.Spec_File.Hash.To_String
else ""));
Put_Line (" Body_File : " & (if Unit.Body_File /= null then Unit.Body_File.Hash.To_String
else ""));
end loop;
end Dump_Library_Units;
--
-- Trackers
--
Process_Title_Style: constant Text_Style := Blue_FG + Bold;
Progress_Bar_Template: constant CLI.Widgets.Progress_Bars.Progress_Bar
:= (Delimited => True,
Width => 10,
Fill_Char => ' ',
Fill_Style => White_BG,
Empty_Char => ' ',
Empty_Style => Neutral,
others => <>);
---------------------------
-- Internal_Prep_Tracker --
---------------------------
procedure Internal_Prep_Tracker
(Process_Title: in String;
Bar : in out CLI.Widgets.Progress_Bars.Progress_Bar;
Spinner_Only : in Boolean)
is
use CLI.Widgets.Progress_Bars;
begin
Clear_Line;
Put_Exec_Tag;
Put (' ');
Put (Message => Process_Title, Style => Process_Title_Style);
Put (' ');
if not Spinner_Only then
Render (Bar);
end if;
end Internal_Prep_Tracker;
------------------
-- Prep_Tracker --
------------------
procedure Prep_Tracker (Process_Title: in String;
Spinner_Only : in Boolean := False) is
use CLI.Widgets.Progress_Bars;
Zeroed_Bar: Progress_Bar := Progress_Bar_Template;
begin
if not Output_Is_Terminal then return; end if;
Internal_Prep_Tracker (Process_Title => Process_Title,
Bar => Zeroed_Bar,
Spinner_Only => Spinner_Only);
end Prep_Tracker;
------------------
-- Wait_Tracker --
------------------
procedure Wait_Tracker (Process_Title : in String;
Tracker : in out Progress.Progress_Tracker;
Failures : out Boolean;
Timedout : out Boolean;
Spinner_Only : in Boolean := False;
Process_Timeout: in Duration := 60.0)
is
use CLI.Widgets.Progress_Bars;
use CLI.Widgets.Spinners;
use type Ada.Calendar.Time;
use type Ada.Containers.Count_Type;
function Trim (Source: in String;
Side: in Ada.Strings.Trim_End := Ada.Strings.Both)
return String
renames Ada.Strings.Fixed.Trim;
Successful_Items_Style: Text_Style renames Neutral;
Failed_Items_Style : Text_Style renames Red_FG;
Total_Items_Style : Text_Style renames Neutral;
Timeout_Label_Style : constant Text_Style := Yellow_BG + Black_FG;
Bar : Progress_Bar := Progress_Bar_Template;
Spin : Spinner;
After_Bar: Positive;
Is_Term : constant Boolean := Output_Is_Terminal;
Deadline: constant Ada.Calendar.Time
:= Ada.Calendar.Clock + Process_Timeout;
Total_Items : Natural;
Completed_Items: Natural;
Failed_Items : Natural;
procedure Get_Totals is
begin
Total_Items := Tracker.Total_Items;
Completed_Items := Tracker.Completed_Items;
Failed_Items := Tracker.Failed_Items;
end Get_Totals;
procedure Prep_Output is
begin
Internal_Prep_Tracker (Process_Title, Bar, Spinner_Only);
Put (' ');
Render (Spin);
Put (' ');
After_Bar := Current_Column;
end Prep_Output;
procedure Term_Update is
begin
Get_Totals;
if not Spinner_Only then
Bar.Percent := Percentage (Tracker.Percent_Complete);
if not Failures and then Failed_Items > 0 then
Failures := True;
Set_Column (1);
Put_Fail_Tag;
end if;
Update (Bar);
Set_Column (After_Bar);
Clear_To_End;
Put (Message => Trim (Natural'Image (Completed_Items)),
Style => Successful_Items_Style);
if Failures then
Put (Message => " (+" & Trim (Natural'Image (Failed_Items))
& " Failed)",
Style => Failed_Items_Style);
end if;
Put (" of ");
Put (Message => Trim (Natural'Image (Total_Items)),
Style => Total_Items_Style);
Put (" work orders.");
if Timedout then
Put (Message => " * TIMEOUT *",
Style => Timeout_Label_Style);
end if;
end if;
Update (Spin);
end Term_Update;
begin
Failures := False;
Timedout := False;
if Is_Term then
Prep_Output;
null;
else
New_Line;
Put_Exec_Tag;
Put (' ' & Process_Title & " ...");
end if;
if Is_Term then
loop
Term_Update;
exit when Tracker.Is_Complete;
if Ada.Calendar.Clock > Deadline then
Set_Column (1);
Put_Fail_Tag;
Timedout := True;
Term_Update;
return;
else
select
Tracker.Wait_Complete;
or
delay Progress_Poll_Rate;
end select;
end if;
while User_Notices.Available_Notices > 0 loop
declare
use User_Notices;
Notice: constant Notice_Lines := Retrieve_Notice;
begin
Clear_Line;
Put_Info_Tag;
Put (' ');
for Line of Notice loop
Put_Line (UBS.To_String (Line));
Put (" ");
end loop;
end;
Clear_Line;
Prep_Output;
end loop;
if User_Queries.Query_Manager.Query_Pending then
Clear_Line;
User_Queries.Query_Manager.Take_Query (Query_Driver'Access);
Prep_Output;
end if;
end loop;
else
select
Tracker.Wait_Complete;
or
delay Process_Timeout;
Timedout := True;
end select;
Get_Totals;
Failures := (Failed_Items > 0);
New_Line;
if Timedout then
Put_Fail_Tag;
Put (" * TIMEOUT *");
elsif Failures then
Put_Fail_Tag;
else
Put_OK_Tag;
end if;
Put (Natural'Image (Completed_Items));
if Failures then
Put (" (+" & Trim (Natural'Image (Failed_Items)) & " Failed)");
end if;
Put_Line (" of"
& Natural'Image (Total_Items)
& " work orders completed.");
end if;
end Wait_Tracker;
---------------------------
-- Wait_Tracker_Or_Abort --
---------------------------
procedure Wait_Tracker_Or_Abort
(Process_Title : in String;
Tracker : in out Progress.Progress_Tracker;
Spinner_Only : in Boolean := False;
Process_Timeout: in Duration := 20.0)
is
Failures, Timedout: Boolean := False;
begin
Wait_Tracker (Process_Title => Process_Title,
Tracker => Tracker,
Failures => Failures,
Timedout => Timedout,
Process_Timeout => Process_Timeout);
if Failures or else Timedout then
New_Line;
raise Scheduling.Process_Failed;
end if;
end Wait_Tracker_Or_Abort;
--------------
-- Put_Info --
--------------
procedure Put_Info (Message: String) is
begin
case Output_Is_Terminal is
when True => Put (Message);
when False => Put_Line (Message);
end case;
end;
end UI_Primitives;
|
with C3GA;
with Multivectors;
with Multivector_Analyze; use Multivector_Analyze;
package Multivector_Analyze_C3GA is
-- procedure Analyze (Analysis : in out MV_Analysis;
function Analyze (MV : Multivectors.Multivector;
Probe : Multivectors.Normalized_Point := C3GA.no;
Flags : Flag_Type := (Flag_Invalid, false);
Epsilon : float := Default_Epsilon) return MV_Analysis;
Analyze_C3GA_Exception : Exception;
end Multivector_Analyze_C3GA;
|
with
ada.Containers.Vectors,
interfaces.C.Pointers;
package impact.d3.Containers
--
-- Provides various common containers.
--
is
-- Integer
--
package integer_Vectors is new ada.Containers.Vectors (Positive, Integer);
subtype integer_Vector is integer_Vectors.Vector;
type integer_Vector_view is access all integer_Vector;
-- C.Unsigned
--
type Unsigneds is array (Positive range <>) of aliased Interfaces.C.Unsigned;
use type Interfaces.C.Unsigned;
package Unsigned_Vectors is new ada.Containers.Vectors (Positive, Interfaces.C.Unsigned);
subtype Unsigned_Vector is Unsigned_Vectors.Vector;
-- Interfaces.Unsigned_32;
--
use type Interfaces.Unsigned_32;
package unsigned_32_Vectors is new ada.Containers.Vectors (Positive, Interfaces.Unsigned_32);
subtype unsigned_32_Vector is unsigned_32_Vectors.Vector;
-- Real
--
package real_Vectors is new ada.Containers.Vectors (Positive, math.Real);
subtype real_Vector is real_Vectors.Vector;
type real_Vector_view is access all real_Vector;
-- Real Pointers
--
package real_Pointers is new interfaces.C.Pointers (Natural, math.Real, Real_array, math.Real'First);
subtype real_Pointer is Real_Pointers.Pointer;
-- Vector_3
--
use type math.Vector_3;
package vector_3_Vectors is new ada.Containers.Vectors (Positive, math.Vector_3);
subtype vector_3_Vector is vector_3_Vectors.Vector;
-- Any Views
--
type Any_view is access all Any'Class;
end impact.d3.Containers;
|
--------------------------------------------------------------------------------
-- --
-- Copyright (C) 2004, RISC OS Ada Library (RASCAL) developers. --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU Lesser General Public --
-- License as published by the Free Software Foundation; either --
-- version 2.1 of the License, or (at your option) any later version. --
-- --
-- This library is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Lesser General Public License for more details. --
-- --
-- You should have received a copy of the GNU Lesser General Public --
-- License along with this library; if not, write to the Free Software --
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA --
-- --
--------------------------------------------------------------------------------
-- $Author$
-- $Date$
-- $Revision$
with System; use System;
with Kernel; use Kernel;
with Interfaces.C; use Interfaces.C;
with Ada.Strings.Unbounded;
with Reporter;
with RASCAL.Utility; use RASCAL.Utility;
with RASCAL.Memory; use RASCAL.Memory;
with RASCAL.WimpWindow; use RASCAL.WimpWindow;
package body RASCAL.ToolboxWindow is
Toolbox_ObjectMiscOp : constant := 16#44EC6#;
Window_GetPointerInfo : constant := 16#82883#;
Window_Wimp_To_Toolbox : constant := 16#82884#;
Window_ExtractGadgetInfo : constant := 16#828BE#;
--
function Gadget_Get_BufferSize (Object : in Object_ID;
Component : in Component_ID) return Integer is
Icon : Icon_Handle_Type;
Window : Wimp_Handle_Type;
Buffer_Size: Integer;
Index : Integer := 1;
begin
case Get_Type (Object,Component) is
when WritableField_Base => Index := 1;
when DisplayField_Base => Index := 1;
when ActionButton_Base => Index := 1;
when OptionButton_Base => Index := 1;
when LabelledBox_Base => Index := 1;
when Label_Base => Index := 1;
when RadioButton_Base => Index := 2;
when others => Index := -1;
end case;
if Index = -1 then
return -1;
end if;
Icon := ToolboxWindow.Gadget_Get_Icon_List(Object,Component)(Index);
Window := ToolboxWindow.Get_Wimp_Handle (Object);
Buffer_Size := Memory.GetWord(WimpWindow.Get_WindowInfo(Window).Icon_Block(Integer(Icon)).Icon_Data'Address,8-4);
return Buffer_Size;
end Gadget_Get_BufferSize;
--
procedure Gadget_SetValue (Window : in Object_ID;
Component : in Component_ID;
Value : in String;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Value_0 : UString := U(Value & ASCII.NUL);
Buffer_Size : Integer := (Gadget_Get_BufferSize(Window,Component))-1;
Method : Integer;
begin
if Buffer_Size > -1 then
if Value'Length > Buffer_Size then
Value_0 := Ada.Strings.Unbounded.Head(Value_0,Buffer_Size);
Ada.Strings.Unbounded.Append(Value_0,ASCII.NUL);
end if;
case Get_Type (Window,Component) is
when WritableField_Base => Method := 512;
when DisplayField_Base => Method := 448;
when ActionButton_Base => Method := 80;
when OptionButton_Base => Method := 192;
when RadioButton_Base => Method := 384;
when others => Method := -1;
end case;
if Method /= -1 then
Register.R(0) := Int (Unsigned_to_Int(Flags));
Register.R(1) := Int (Window);
Register.R(2) := Int (Method);
Register.R(3) := Int (Component);
Register.R(4) := Adr_To_Int (S(Value_0)'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_SetValue: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end if;
end if;
end Gadget_SetValue;
--
function Gadget_GetBBox (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Toolbox_BBox_Type is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Buffer : Toolbox_BBox_Type;
begin
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := int(Window);
Register.R(2) := 72;
Register.R(3) := int(Component);
Register.R(4) := Adr_To_Int(Buffer'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_GetBBox: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return Buffer;
end Gadget_GetBBox;
--
function Gadget_GetFlags (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return integer is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 64;
Register.R(3) := Int(Component);
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_GetFlags: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return integer(Register.R(0));
end Gadget_GetFlags;
--
function Get_Type (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Gadget_ID_Type is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 70;
Register.R(3) := Int(Component);
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Type: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return Gadget_ID_Type(Register.R(0));
end Get_Type;
--
function Gadget_Get_Help (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return String is
Register : aliased Kernel.swi_regs;
Buffer_Size : integer := 0;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 67;
Register.R(3) := Int(Component);
Register.R(4) := 0;
Register.R(5) := 0;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_Get_Help: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Buffer_Size := Integer(Register.R(5));
declare
Buffer : String(1..Buffer_Size);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 67;
Register.R(3) := Int(Component);
Register.R(4) := Adr_To_Int(Buffer'Address);
Register.R(5) := Int(Buffer_Size);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_Get_Help: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return MemoryToString(Buffer'Address);
end;
end Gadget_Get_Help;
--
function Get_Icon_List (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Icon_List_Type is
Register : aliased Kernel.swi_regs;
Buffer_Size : integer := 0;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 68;
Register.R(3) := Int(Component);
Register.R(4) := 0;
Register.R(5) := 0;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Icon_List: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Buffer_Size := Integer(Register.R(5));
if Buffer_Size mod 4 > 0 then
Buffer_Size := Buffer_Size / 4 + 1;
else
Buffer_Size := Buffer_Size / 4;
end if;
declare
Buffer : Icon_List_Type(1..Buffer_Size);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 68;
Register.R(3) := Int(Component);
Register.R(4) := Adr_To_Int(Buffer'Address);
Register.R(5) := Int(Buffer_Size);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Icon_List: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return Buffer;
end;
end Get_Icon_List;
--
procedure Gadget_SetFlags (Window : in Object_ID;
Component : in Component_ID;
New_Flags : in System.Unsigned_Types.Unsigned;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 65;
Register.R(3) := Int(Component);
Register.R(4) := Int(Utility.Unsigned_To_Int(New_Flags));
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /=null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_SetFlags: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Gadget_SetFlags;
--
procedure Gadget_Fade (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Flag : System.Unsigned_Types.Unsigned := 16#80000000#;
begin
Gadget_SetFlags(Window,Component,Flag);
end Gadget_Fade;
--
procedure Gadget_UnFade (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Flag : System.Unsigned_Types.Unsigned := 16#0#;
begin
Gadget_SetFlags(Window,Component,Flag);
end Gadget_UnFade;
--
procedure Set_Focus (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 68;
Register.R(3) := Int(Component);
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Focus: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Focus;
--
procedure Gadget_Set_Help (Window : in Object_ID;
Component : in Component_ID;
Help : in String;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Help_0 : String := Help & Character'Val(0);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 66;
Register.R(3) := Int(Component);
Register.R(4) := Adr_To_Int(Help_0'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_SetHelp: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Gadget_Set_Help;
--
procedure Move_Gadget (Window : in Object_ID;
Component : in Component_ID;
BBox : in Toolbox_BBox_Type;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 71;
Register.R(3) := Int(Component);
Register.R(4) := Adr_To_Int(BBox'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Move_Gadget: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Move_Gadget;
--
-- Window Methods
procedure Extract_GadgetInfo (Template : in Address;
Gadget : in Component_ID;
Block : out Address;
BlockSize: out Integer;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Adr_To_Int(Template);
Register.R(2) := int(Gadget);
Error := Kernel.Swi (Window_ExtractGadgetInfo, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Extract_GadgetInfo " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Block := Int_To_Adr(Register.R(0));
BlockSize := Integer (Register.R(1));
end Extract_GadgetInfo;
--
function Enumerate_Gadgets (Window : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Gadget_List_Type is
Register : aliased Kernel.swi_regs;
Buffer_Size : integer := 0;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := -1;
Register.R(3) := 0;
Register.R(4) := 0;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Enumerate_Gadget(1): " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Buffer_Size := integer(Register.R(4));
if Buffer_Size mod 4 > 0 then
Buffer_Size := Buffer_Size / 4 + 1;
else
Buffer_Size := Buffer_Size / 4;
end if;
if Buffer_Size = -1 then
raise No_Toolbox_Window;
end if;
declare
Buffer : Gadget_List_Type(1..Buffer_Size);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := -1;
Register.R(3) := Adr_To_Int(Buffer'Address);
Register.R(4) := Int(Buffer_Size);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Enumerate_Gadget(2): " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
if integer(Register.R(2)) /= 0 then
raise Enumeration_Buffer_Overrun;
end if;
return Buffer;
end;
end Enumerate_Gadgets;
--
function Gadget_Get_Icon_List (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Icon_List_Type is
Register : aliased Kernel.swi_regs;
Buffer_Size : integer := 0;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 68;
Register.R(3) := Int(Component);
Register.R(4) := 0;
Register.R(5) := 0;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_Get_Icon_List: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Buffer_Size := integer(Register.R(5));
if Buffer_Size mod 4 > 0 then
Buffer_Size := Buffer_Size / 4 + 1;
else
Buffer_Size := Buffer_Size / 4;
end if;
declare
Buffer : Icon_List_Type(1..Buffer_Size);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 68;
Register.R(3) := Int(Component);
Register.R(4) := Adr_To_Int(Buffer'Address);
Register.R(5) := Int(Buffer_Size);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Gadget_Get_Icon_List: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
if integer(Register.R(4)) = -1 then
raise No_Toolbox_Window;
end if;
return Buffer;
end;
end Gadget_Get_Icon_List;
--
procedure Add_Gadget (Window : in Object_ID;
Gadget : in Gadget_Type;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 1;
Register.R(3) := Adr_To_Int(Gadget'Address);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Add_Gadget: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Add_Gadget;
--
procedure Add_Gadget (Window : in Object_ID;
Gadget : in Address;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 1;
Register.R(3) := Adr_To_Int(Gadget);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Add_Gadget (2): " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Add_Gadget;
--
procedure Remove_Gadget (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 2;
Register.R(3) := Int(Component);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Remove_Gadget: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Remove_Gadget;
--
procedure Set_Menu (Window : in Object_ID;
Menu : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 3;
Register.R(3) := Int(Menu);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Menu: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Menu;
--
function Get_Menu (Window : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Object_ID is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 4;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Menu: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return Object_ID(Register.R(0));
end Get_Menu;
--
procedure Set_Pointer (Window : in Object_ID;
Sprite : in string;
X_Spot : in integer;
Y_Spot : in integer;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Sprite_0 : String := Sprite & ASCII.NUL;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 5;
Register.R(3) := Adr_To_Int(Sprite_0'Address);
Register.R(4) := Int(X_Spot);
Register.R(5) := Int(Y_Spot);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Pointer: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Pointer;
--
function Get_Pointer (Window : in Object_ID;
X_Spot : in integer;
Y_Spot : in integer;
Flags : in System.Unsigned_Types.Unsigned := 0) return String is
Register : aliased Kernel.swi_regs;
Buffer_Size : integer := 0;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 6;
Register.R(3) := 0;
Register.R(4) := 0;
Register.R(5) := Int(X_Spot);
Register.R(6) := Int(Y_Spot);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Pointer: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Buffer_Size := Integer(Register.R(4));
declare
Buffer : String(1..Buffer_Size);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 6;
Register.R(3) := Adr_To_Int(Buffer'Address);
Register.R(4) := Int(Buffer_Size);
Register.R(5) := Int(X_Spot);
Register.R(6) := Int(Y_Spot);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Pointer: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return MemoryToString(Buffer'Address);
end;
end Get_Pointer;
--
procedure Set_Help (Window : in Object_ID;
Help : in String;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Help_0 : String := Help & ASCII.NUL;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 7;
Register.R(3) := Adr_To_Int(Help_0'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Help: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Help;
--
function Get_Help (Window : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return String is
Register : aliased Kernel.swi_regs;
Buffer_Size : integer := 0;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 8;
Register.R(3) := 0;
Register.R(4) := 0;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Help: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Buffer_Size := Integer(Register.R(4));
declare
Buffer : String(1..Buffer_Size);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 8;
Register.R(3) := Adr_To_Int(Buffer'Address);
Register.R(4) := Int(Buffer_Size);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Help: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return MemoryToString(Buffer'Address);
end;
end Get_Help;
--
procedure Set_Title (Window : in Object_ID;
Title : in String;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Title_0 : String := Title & ASCII.NUL;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 11;
Register.R(3) := Adr_To_Int(Title_0'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,register'Access,register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Title: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Title;
--
function Get_Title (Window : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return String is
Register : aliased Kernel.swi_regs;
Buffer_Size : integer := 0;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 12;
Register.R(3) := 0;
Register.R(4) := 0;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Title: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Buffer_Size := Integer(Register.R(4));
declare
Buffer : String(1..Buffer_Size);
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 12;
Register.R(3) := Adr_To_Int(Buffer'Address);
Register.R(4) := Int(Buffer_Size);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Title: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return MemoryToString(Buffer'Address);
end;
end Get_Title;
--
procedure Set_Default_Focus (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 13;
Register.R(3) := Int(Component);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Default_Focus: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Default_Focus;
--
function Get_Default_Focus (Window : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Component_ID is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 14;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Default_Focus: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return Component_ID(Register.R(0));
end Get_Default_Focus;
--
procedure Set_Extent (Window : in Object_ID;
BBox : in Toolbox_BBox_Type;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 15;
Register.R(3) := Adr_To_Int(BBox'Address);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Extent: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Extent;
--
function Get_Extent (Window : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Toolbox_BBox_Type is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
BBox : Toolbox_BBox_Type;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 16;
Register.R(3) := Adr_To_Int(BBox'Address);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Extent: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return BBox;
end Get_Extent;
--
procedure Force_Redraw (Window : in Object_ID;
BBox : in Toolbox_BBox_Type;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := 17;
Register.R(3) := Adr_To_Int(BBox'Address);
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Force_Redraw: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Force_Redraw;
--
procedure Set_Toolbars (Window : in Object_ID;
Toolbar: in Object_ID;
Bar_Type: in Toolbox_Toolbar_Type) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(3) := 0;
Register.R(4) := 0;
Register.R(5) := 0;
Register.R(6) := 0;
case Bar_Type is
when Internal_Bottom_Left => Register.R(0) := 1;
Register.R(3) := Int(Toolbar);
when Internal_Top_Left => Register.R(0) := 2;
Register.R(4) := Int(Toolbar);
when External_Bottom_Left => Register.R(0) := 4;
Register.R(5) := Int(Toolbar);
when External_Top_Left => Register.R(0) := 8;
Register.R(6) := Int(Toolbar);
end case;
Register.R(1) := Int(Window);
Register.R(2) := 18;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Set_Toolbars: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Toolbars;
--
function Get_Toolbars (Window : in Object_ID;
Bar_Type: in Toolbox_Toolbar_Type) return Object_ID is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
case Bar_Type is
when Internal_Bottom_Left => Register.R(0) := 1;
when Internal_Top_Left => Register.R(0) := 2;
when External_Bottom_Left => Register.R(0) := 4;
when External_Top_Left => Register.R(0) := 8;
end case;
Register.R(1) := Int(Window);
Register.R(2) := 19;
Error := Kernel.Swi (Toolbox_ObjectMiscOp, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Toolbars: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
case Bar_Type is
when Internal_Bottom_Left => return Object_ID(Register.R(0));
when Internal_Top_Left => return Object_ID(Register.R(1));
when External_Bottom_Left => return Object_ID(Register.R(2));
when External_Top_Left => return Object_ID(Register.R(3));
end case;
end Get_Toolbars;
--
function Is_Open (Window : in Object_ID) return Boolean is
WinID : Wimp_Handle_Type := Get_Wimp_Handle (Window);
begin
return WimpWindow.Is_Open (WinID);
end Is_Open;
--
function Get_Pointer_Info(Flags: in System.Unsigned_Types.Unsigned := 0) return Toolbox_Pointer_Info_Type is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Info : Toolbox_Pointer_Info_Type;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Error := Kernel.Swi (Window_GetPointerInfo, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Get_Pointer_Info: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Info.X_Pos := integer(Register.R(0));
Info.Y_Pos := integer(Register.R(1));
Info.Buttons := integer(Register.R(2));
return Info;
end Get_Pointer_Info;
--
procedure Get_WindowPosition (Window : in Object_ID;
X_Pos : out Integer;
Y_Pos : out Integer) is
WinID : Wimp_Handle_Type := Get_Wimp_Handle (Window);
begin
WimpWindow.Get_WindowPosition(WinID,X_Pos,Y_Pos);
end Get_WindowPosition;
--
function Get_Wimp_Handle (Window : in Object_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) return Wimp_Handle_Type is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := int(Window);
Register.R(2) := 0;
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("Toolbox.Get_Wimp_Handle: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return Wimp_Handle_Type(Register.R(0));
end Get_Wimp_Handle;
--
procedure Wimp_To_Toolbox (Window : in Wimp_Handle_Type;
Icon : in Icon_Handle_Type;
Object : out Object_ID;
Component : out Component_ID;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
begin
Register.R(0) := Int(Unsigned_to_Int(Flags));
Register.R(1) := Int(Window);
Register.R(2) := Int(Icon);
Error := Kernel.Swi (Window_Wimp_To_Toolbox, Register'Access, Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWindow.Wimp_To_Toolbox: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
Object := Object_ID(Register.R(0));
Component := Component_ID(Register.R(1));
end Wimp_To_Toolbox;
--
end RASCAL.ToolboxWindow;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . E N U M E R A T I O N _ A U X --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, 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 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. --
-- --
-- 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 Ada.Text_IO.Generic_Aux; use Ada.Text_IO.Generic_Aux;
with Ada.Characters.Handling; use Ada.Characters.Handling;
-- Note: this package does not yet deal properly with wide characters ???
package body Ada.Text_IO.Enumeration_Aux is
------------------
-- Get_Enum_Lit --
------------------
procedure Get_Enum_Lit
(File : File_Type;
Buf : out String;
Buflen : out Natural)
is
ch : Integer;
C : Character;
begin
Buflen := 0;
Load_Skip (File);
ch := Getc (File);
C := Character'Val (ch);
-- Character literal case. If the initial character is a quote, then
-- we read as far as we can without backup (see ACVC test CE3905L)
if C = ''' then
Store_Char (File, ch, Buf, Buflen);
ch := Getc (File);
if ch in 16#20# .. 16#7E# or else ch >= 16#80# then
Store_Char (File, ch, Buf, Buflen);
ch := Getc (File);
if ch = Character'Pos (''') then
Store_Char (File, ch, Buf, Buflen);
else
Ungetc (ch, File);
end if;
else
Ungetc (ch, File);
end if;
-- Similarly for identifiers, read as far as we can, in particular,
-- do read a trailing underscore (again see ACVC test CE3905L to
-- understand why we do this, although it seems somewhat peculiar).
else
-- Identifier must start with a letter
if not Is_Letter (C) then
Ungetc (ch, File);
return;
end if;
-- If we do have a letter, loop through the characters quitting on
-- the first non-identifier character (note that this includes the
-- cases of hitting a line mark or page mark).
loop
C := Character'Val (ch);
Store_Char (File, Character'Pos (To_Upper (C)), Buf, Buflen);
ch := Getc (File);
exit when ch = EOF_Char;
C := Character'Val (ch);
exit when not Is_Letter (C)
and then not Is_Digit (C)
and then C /= '_';
exit when C = '_'
and then Buf (Buflen) = '_';
end loop;
Ungetc (ch, File);
end if;
end Get_Enum_Lit;
---------
-- Put --
---------
procedure Put
(File : File_Type;
Item : String;
Width : Field;
Set : Type_Set)
is
Actual_Width : constant Count := Count'Max (Count (Width), Item'Length);
begin
-- Deal with limited line length of output file
if Line_Length (File) /= 0 then
-- If actual width exceeds line length, raise Layout_Error
if Actual_Width > Line_Length (File) then
raise Layout_Error;
end if;
-- If full width cannot fit on current line move to new line
if Actual_Width + (Col (File) - 1) > Line_Length (File) then
New_Line (File);
end if;
end if;
-- Output in lower case if necessary
if Set = Lower_Case and then Item (Item'First) /= ''' then
declare
Iteml : String (Item'First .. Item'Last);
begin
for J in Item'Range loop
Iteml (J) := To_Lower (Item (J));
end loop;
Put_Item (File, Iteml);
end;
-- Otherwise output in upper case
else
Put_Item (File, Item);
end if;
-- Fill out item with spaces to width
for J in 1 .. Actual_Width - Item'Length loop
Put (File, ' ');
end loop;
end Put;
----------
-- Puts --
----------
procedure Puts
(To : out String;
Item : String;
Set : Type_Set)
is
Ptr : Natural;
begin
if Item'Length > To'Length then
raise Layout_Error;
else
Ptr := To'First;
for J in Item'Range loop
if Set = Lower_Case and then Item (Item'First) /= ''' then
To (Ptr) := To_Lower (Item (J));
else
To (Ptr) := Item (J);
end if;
Ptr := Ptr + 1;
end loop;
while Ptr <= To'Last loop
To (Ptr) := ' ';
Ptr := Ptr + 1;
end loop;
end if;
end Puts;
-------------------
-- Scan_Enum_Lit --
-------------------
procedure Scan_Enum_Lit
(From : String;
Start : out Natural;
Stop : out Natural)
is
C : Character;
-- Processing for Scan_Enum_Lit
begin
String_Skip (From, Start);
-- Character literal case. If the initial character is a quote, then
-- we read as far as we can without backup (see ACVC test CE3905L
-- which is for the analogous case for reading from a file).
if From (Start) = ''' then
Stop := Start;
if Stop = From'Last then
raise Data_Error;
else
Stop := Stop + 1;
end if;
if From (Stop) in ' ' .. '~'
or else From (Stop) >= Character'Val (16#80#)
then
if Stop = From'Last then
raise Data_Error;
else
Stop := Stop + 1;
if From (Stop) = ''' then
return;
end if;
end if;
end if;
raise Data_Error;
-- Similarly for identifiers, read as far as we can, in particular,
-- do read a trailing underscore (again see ACVC test CE3905L to
-- understand why we do this, although it seems somewhat peculiar).
else
-- Identifier must start with a letter
if not Is_Letter (From (Start)) then
raise Data_Error;
end if;
-- If we do have a letter, loop through the characters quitting on
-- the first non-identifier character (note that this includes the
-- cases of hitting a line mark or page mark).
Stop := Start;
while Stop < From'Last loop
C := From (Stop + 1);
exit when not Is_Letter (C)
and then not Is_Digit (C)
and then C /= '_';
exit when C = '_'
and then From (Stop) = '_';
Stop := Stop + 1;
end loop;
end if;
end Scan_Enum_Lit;
end Ada.Text_IO.Enumeration_Aux;
|
-- This package has been generated automatically by GNATtest.
-- Do not edit any part of it, see GNATtest documentation for more details.
-- begin read only
with Gnattest_Generated;
package Tk.TtkWidget.Test_Data.Tests is
type Test is new GNATtest_Generated.GNATtest_Standard.Tk.TtkWidget.Test_Data
.Test with
null record;
procedure Test_Option_Image_a3facf_ddcb4f(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:253:4:Option_Image:Test_Option_Image_Compound_Type
procedure Test_Option_Image_5ac754_8ca289(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:259:4:Option_Image:Test_Option_Image_Distabled_State_Type
procedure Test_Option_Image_a0749a_9522a2(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:265:4:Option_Image:Test_Option_Image_Image_Option
procedure Test_Option_Image_fac0b4_5f511f(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:270:4:Option_Image:Test_Option_Image_Padding_Data
procedure Test_Option_Value_5bd68b_a92add(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:293:4:Option_Value:Test_Option_Value_Compound_Type
procedure Test_Option_Value_e44442_1318d9(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:298:4:Option_Value:Test_Option_Value_Disabled_State_Type
procedure Test_Option_Value_7d1d95_d2d94b(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:303:4:Option_Value:Test_Option_Value_Ttk_Image_Option
procedure Test_Option_Value_08ea7f_956d9f(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:308:4:Option_Value:Test_Option_Value_Padding_Data
procedure Test_In_State_46b68b_db2848(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:333:4:In_State:Test_Ttk_Widget_In_State
procedure Test_In_State_318f72_d83e8c(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:358:4:In_State:Test_Ttk_Widget_In_State2
procedure Test_Set_State_86b648_15a1a7(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:383:4:Set_State:Test_Ttk_Widget_State
procedure Test_Get_States_734267_5a6282(Gnattest_T: in out Test);
-- tk-ttkwidget.ads:407:4:Get_States:Test_Ttk_Widget_State2
end Tk.TtkWidget.Test_Data.Tests;
-- end read only
|
with Ada.Directories; use Ada.Directories;
...
Rename ("input.txt", "output.txt");
Rename ("docs", "mydocs");
Rename ("/input.txt", "/output.txt");
Rename ("/docs", "/mydocs");
|
------------------------------------------------------------------------------
-- Copyright (c) 2013, Natacha Porté --
-- --
-- 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. --
------------------------------------------------------------------------------
package body Natools.Accumulators.Tests is
package NT renames Natools.Tests;
procedure Check_Emptiness
(Report : in out NT.Reporter'Class;
Accumulator : in out String_Accumulator'Class;
Test_Name : in String);
-- Add an item to Report, success being emptiness of Accumulator
procedure Check_Contents
(Report : in out NT.Reporter'Class;
Accumulator : in out String_Accumulator'Class;
Test_Name : in String;
Reference : in String);
-- Add an item to Report, success being Accumulator matching Reference
procedure Check_Contents
(Report : in out NT.Reporter'Class;
Accumulator : in out String_Accumulator'Class;
Test_Name : in String;
Reference : in String)
is
S : constant String := Accumulator.To_String;
L : constant Natural := Accumulator.Length;
begin
if S'Length /= L then
NT.Item (Report, Test_Name, NT.Fail);
NT.Info
(Report,
"Inconsistent length" & Natural'Image (L)
& " for string """ & S & '"');
elsif S /= Reference then
NT.Item (Report, Test_Name, NT.Fail);
NT.Info (Report, "Accumulated """ & S & '"');
NT.Info (Report, "Reference """ & Reference & '"');
else
NT.Item (Report, Test_Name, NT.Success);
end if;
end Check_Contents;
procedure Check_Emptiness
(Report : in out NT.Reporter'Class;
Accumulator : in out String_Accumulator'Class;
Test_Name : in String)
is
L : constant Natural := Accumulator.Length;
S : constant String := Accumulator.To_String;
begin
if L /= 0 or S /= "" then
NT.Item (Report, Test_Name, NT.Fail);
NT.Info (Report, "Accumulator.Length is" & Natural'Image (L));
NT.Info (Report, "Accumulator.To_String is """ & S & '"');
else
NT.Item (Report, Test_Name, NT.Success);
end if;
end Check_Emptiness;
procedure Test
(Report : in out Natools.Tests.Reporter'Class;
Accumulator : in out String_Accumulator'Class)
is
Part_1 : constant String
:= "The quick brown fox jumps over the lazy dog.";
Part_2 : constant String
:= "Lorem ipsum dolor sit amet, consectetur adipisicing elit.";
L_1 : constant Natural := 10;
L_2 : constant Natural := 7;
begin
declare
Name : constant String := "Soft_Reset";
begin
Accumulator.Soft_Reset;
Check_Emptiness (Report, Accumulator, Name);
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "String append";
begin
Accumulator.Append (Part_1);
Check_Contents (Report, Accumulator, Name, Part_1);
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Character accumulation";
begin
for I in Part_2'Range loop
Accumulator.Append (String'(1 => Part_2 (I)));
end loop;
Check_Contents (Report, Accumulator, Name, Part_1 & Part_2);
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Tail extraction";
OK : Boolean := True;
begin
declare
T : constant String := Accumulator.Tail (L_1);
begin
if T'Length /= L_1 then
NT.Item (Report, Name, NT.Fail);
NT.Info (Report,
"Wrong tail length" & Natural'Image (T'Length)
& ", expected" & Natural'Image (L_1));
OK := False;
elsif T /= Part_2 (Part_2'Last - L_1 + 1 .. Part_2'Last) then
NT.Item (Report, Name, NT.Fail);
NT.Info (Report, "Incorrect tail """ & T & '"');
NT.Info (Report, "Expected """
& Part_2 (Part_2'Last - L_1 + 1 .. Part_2'Last) & '"');
OK := False;
end if;
end;
if OK then
Check_Contents (Report, Accumulator, Name, Part_1 & Part_2);
end if;
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Unappend";
begin
Accumulator.Unappend (Part_2 (Part_2'Last - L_2 + 1 .. Part_2'Last));
Check_Contents (Report, Accumulator, Name,
Part_1 & Part_2 (Part_2'First .. Part_2'Last - L_2));
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "No-op Unappend";
begin
Accumulator.Unappend (Part_1);
Check_Contents (Report, Accumulator, Name,
Part_1 & Part_2 (Part_2'First .. Part_2'Last - L_2));
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "In-place To_String";
Target : String (1 .. Part_1'Length + Part_2'Length)
:= (others => '*');
begin
Accumulator.To_String (Target);
Target (Part_1'Length + Part_2'Length - L_2 + 1 .. Target'Last)
:= Part_2 (Part_2'Last - L_2 + 1 .. Part_2'Last);
if Target /= Part_1 & Part_2 then
NT.Item (Report, Name, NT.Fail);
NT.Info (Report, "Found """ & Target & '"');
NT.Info (Report, "Expected """ & Target & '"');
else
Check_Contents (Report, Accumulator, Name,
Part_1 & Part_2 (Part_2'First .. Part_2'Last - L_2));
end if;
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Hard_Reset";
begin
Accumulator.Hard_Reset;
Check_Emptiness (Report, Accumulator, Name);
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
end Test;
end Natools.Accumulators.Tests;
|
--------------------------------------------------------------------------------
-- Fichier : arbre_binaire.adb
-- Auteur : MOUDDENE Hamza & CAZES Noa
-- Objectif : Implantation du module Arbre_Binaire.
-- Créé : Dimanche Nov 25 2019
--------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
package body Arbre_Binaire is
----------------------------------Constuctor--------------------------------
-- Initialiser Tree. Tree est vide.
procedure Initialize (Tree: out T_BT) is
begin
Tree := Null;
end Initialize;
-----------------------------------Getters----------------------------------
-- Obtenir à l'DATA de la racine de Tree.
function Get_Data (Tree : in T_BT) return T_DATA is
begin
return Tree.all.Data;
end Get_DATA;
-- Obtenir à le sous arbre gauche de Tree.
function Get_Left (Tree : in T_BT) return T_BT is
begin
return Tree.all.Left;
end Get_Left;
-- Obtenir à le sous arbre droit de Tree.
function Get_Right (Tree : in T_BT) return T_BT is
begin
return Tree.all.Right;
end Get_Right;
-----------------------------------Setters----------------------------------
-- Modifier l'DATA de la racine de Tree.
procedure Set_Data (Tree : in T_BT; Data : in T_DATA) is
begin
Tree.all.Data := Data;
end Set_DATA;
-- Modifier le sous arbre gauche de Tree.
procedure Set_Left (Tree, Left : in T_BT) is
begin
Tree.all.Left := Left;
end Set_Left;
-- Modifier le sous arbre droit de Tree.
procedure Set_Right (Tree, Right : in T_BT) is
begin
Tree.all.Right := Right;
end Set_Right;
----------------------------------------------------------------------------
-- Libérer la mémoire.
procedure Free is
new Ada.Unchecked_Deallocation (Object => T_Node, Name => T_BT);
-- Est-ce qu'un Tree est vDATAe ?
function Is_Empty (Tree : T_BT) return Boolean is
begin
return (Tree = Null);
end Is_Empty;
-- Obtenir le nombre d'éléments d'un Tree.
function Height (Tree : in T_BT) return Integer is
begin
if Is_Empty (Tree) then
return 0;
else
return 1 + Height (Tree.all.Left) + Height (Tree.all.Right);
end if;
end Height;
-- Vérifier qu'un DATA passé en paramètre est dans l'arbre.
function Is_Present (Tree : in T_BT; DATA : in T_DATA) return Boolean is
begin
if (Is_Empty (Tree)) then
return False;
elsif (Get_DATA (Tree) = DATA) then
return True;
else
return Is_Present (Get_Left (Tree), DATA) or Is_Present (Get_Right (Tree), DATA);
end if;
end Is_Present;
-- Obtenir la profondeur d'un Tree.
function Depth (Tree : in T_BT) return Integer is
-- Nom : max
-- Sémantique : Obtenir le max de deux entiers.
-- Paramètres :
-- a -- L'élement qu'on va comparer avec b.
-- b -- L'élement qu'on va comparer avec a.
function max (a, b : in Integer) return Integer is
begin
if (a > b) then
return a;
else
return b;
end if;
end max;
begin
if (Is_Empty (Tree)) then
return 0;
else
return 1 + max (depth (Get_Left (Tree)), depth (Get_Right (Tree)));
end if;
end Depth;
-- Créer un arbre avec un seul noeud.
procedure Create_Node (Node : out T_BT; DATA : T_DATA) is
begin
Node := New T_Node'(DATA, Null, Null);
end Create_Node;
-- Insérer un DATA associé à un nouveau noeud dans Tree.
procedure Insert (Tree : in out T_BT ; DATA : T_DATA) is
begin
if (Is_Empty(Tree)) then
Create_Node (Tree, DATA);
elsif (Tree.all.DATA = DATA) then
raise PRESENT_DATA_EXCEPTION;
elsif (gt (Tree.all.DATA, DATA)) then -- Tree.all. DATA > DATA
Insert(Tree.all.Left, DATA);
elsif (gt (DATA, Tree.all.DATA)) then
Insert(Tree.all.Right, DATA);
end if;
end Insert;
-- Supprimer tous les éléments d'un Tree.
procedure Destruct (Tree : in out T_BT) is
begin
if Is_Empty (Tree) then
Null;
else
Destruct (Tree.all.Left);
Destruct (Tree.all.Right);
Free (Tree);
end if;
end Destruct;
-- Afficher un Tree dans l'ordre croissant des DATAs.
procedure Display (Tree : in T_BT) is
begin
if (not Is_Empty (Tree)) then
Display (Tree.all.Left);
Display_DATA (Tree.all.DATA);
Display (Tree.all.Right);
end if;
end Display;
end Arbre_Binaire;
|
with BRAM;
with Device; use Device;
with CACTI;
package body Memory.SPM is
MIN_WORD_COUNT : constant := 64;
function Create_SPM(mem : access Memory_Type'Class;
size : Natural;
latency : Time_Type := 1) return SPM_Pointer is
result : constant SPM_Pointer := new SPM_Type;
begin
Set_Memory(result.all, mem);
result.size := size;
result.latency := latency;
return result;
end Create_SPM;
function Random_SPM(next : access Memory_Type'Class;
generator : Distribution_Type;
max_cost : Cost_Type)
return Memory_Pointer is
result : SPM_Pointer := new SPM_Type;
begin
Set_Memory(result.all, next);
result.size := Get_Word_Size(next.all) * MIN_WORD_COUNT;
for i in 1 .. Random(generator) mod 16 loop
result.size := result.size * 2;
if Get_Cost(result.all) > max_cost then
result.size := result.size / 2;
exit;
end if;
exit when Get_Cost(result.all) >= max_cost;
end loop;
if Get_Cost(result.all) > max_cost then
Set_Memory(result.all, null);
Destroy(Memory_Pointer(result));
return Memory_Pointer(next);
else
declare
cost : constant Cost_Type := Get_Cost(result.all);
begin
loop
result.size := result.size * 2;
exit when Get_Cost(result.all) /= cost;
end loop;
result.size := result.size / 2;
end;
if Get_Device = ASIC then
result.latency := CACTI.Get_Time(result.all);
else
result.latency := 2;
end if;
return Memory_Pointer(result);
end if;
end Random_SPM;
function Clone(mem : SPM_Type) return Memory_Pointer is
result : constant SPM_Pointer := new SPM_Type'(mem);
begin
return Memory_Pointer(result);
end Clone;
procedure Permute(mem : in out SPM_Type;
generator : in Distribution_Type;
max_cost : in Cost_Type) is
wsize : constant Natural := Get_Word_Size(mem);
cost : constant Cost_Type := Get_Cost(mem);
size : constant Natural := mem.size;
action : Natural := Random(generator) mod 2;
begin
for i in 1 .. 2 loop
if action = 0 then -- Increase size.
loop
mem.size := mem.size * 2;
exit when Get_Cost(mem) /= cost;
end loop;
exit when Get_Cost(mem) <= max_cost;
mem.size := size;
elsif mem.size > wsize * MIN_WORD_COUNT then -- Decrease size.
loop
mem.size := mem.size / 2;
exit when Get_Cost(mem) /= cost;
end loop;
exit when mem.size > wsize;
mem.size := size;
end if;
action := (action + 1) mod 2;
end loop;
-- Use up as much of this block ram as possible.
declare
new_cost : constant Cost_Type := Get_Cost(mem);
begin
loop
mem.size := mem.size * 2;
exit when Get_Cost(mem) /= new_cost;
end loop;
mem.size := mem.size / 2;
end;
if Get_Device = ASIC then
mem.latency := CACTI.Get_Time(mem);
else
mem.latency := 2;
end if;
end Permute;
procedure Read(mem : in out SPM_Type;
address : in Address_Type;
size : in Positive) is
begin
if address >= Address_Type(mem.size) then
Read(Container_Type(mem), address, size);
elsif address + Address_Type(size) > Address_Type(mem.size) then
declare
naddr : constant Address_Type := Address_Type(mem.size);
last : constant Address_Type := address + Address_Type(size);
nsize : constant Positive := Positive(last - naddr);
begin
Read(Container_Type(mem), naddr, nsize);
end;
else
Advance(mem, mem.latency);
end if;
end Read;
procedure Write(mem : in out SPM_Type;
address : in Address_Type;
size : in Positive) is
begin
if address >= Address_Type(mem.size) then
Write(Container_Type(mem), address, size);
elsif address + Address_Type(size) > Address_Type(mem.size) then
declare
naddr : constant Address_Type := Address_Type(mem.size);
nsize : constant Positive := Positive(naddr - address);
begin
Write(Container_Type(mem), naddr, nsize);
end;
else
Advance(mem, mem.latency);
end if;
end Write;
function To_String(mem : SPM_Type) return Unbounded_String is
result : Unbounded_String;
begin
Append(result, "(spm ");
Append(result, "(size" & Natural'Image(mem.size) & ")");
Append(result, "(latency" & Time_Type'Image(mem.latency) & ")");
Append(result, "(memory ");
Append(result, To_String(Container_Type(mem)));
Append(result, ")");
Append(result, ")");
return result;
end To_String;
function Get_Cost(mem : SPM_Type) return Cost_Type is
wsize : constant Positive := Get_Word_Size(mem);
width : constant Natural := wsize * 8;
depth : constant Natural := mem.size / wsize;
result : Cost_Type := 0;
begin
if Get_Device = ASIC then
result := CACTI.Get_Area(mem);
else
result := Cost_Type(BRAM.Get_Count(width, depth));
end if;
result := result + Get_Cost(Container_Type(mem));
return result;
end Get_Cost;
function Get_Path_Length(mem : SPM_Type) return Natural is
asize : constant Natural := Get_Address_Bits;
begin
return asize + Get_Path_Length(Container_Type(mem));
end Get_Path_Length;
procedure Generate(mem : in SPM_Type;
sigs : in out Unbounded_String;
code : in out Unbounded_String) is
other : constant Memory_Pointer := Get_Memory(mem);
word_bits : constant Natural := 8 * Get_Word_Size(mem);
name : constant String := "m" & To_String(Get_ID(mem));
oname : constant String := "m" & To_String(Get_ID(other.all));
size : constant Natural := (8 * mem.size) / word_bits;
begin
Generate(other.all, sigs, code);
Declare_Signals(sigs, name, word_bits);
Line(code, name & "_inst : entity work.spm");
Line(code, " generic map (");
Line(code, " ADDR_WIDTH => ADDR_WIDTH,");
Line(code, " WORD_WIDTH => " & To_String(word_bits) & ",");
Line(code, " SIZE_BITS => " & To_String(Log2(size) - 1));
Line(code, " )");
Line(code, " port map (");
Line(code, " clk => clk,");
Line(code, " rst => rst,");
Line(code, " addr => " & name & "_addr,");
Line(code, " din => " & name & "_din,");
Line(code, " dout => " & name & "_dout,");
Line(code, " re => " & name & "_re,");
Line(code, " we => " & name & "_we,");
Line(code, " mask => " & name & "_mask,");
Line(code, " ready => " & name & "_ready,");
Line(code, " maddr => " & oname & "_addr,");
Line(code, " min => " & oname & "_dout,");
Line(code, " mout => " & oname & "_din,");
Line(code, " mre => " & oname & "_re,");
Line(code, " mwe => " & oname & "_we,");
Line(code, " mmask => " & oname & "_mask,");
Line(code, " mready => " & oname & "_ready");
Line(code, " );");
end Generate;
function Get_Size(mem : SPM_Type) return Natural is
begin
return mem.size;
end Get_Size;
end Memory.SPM;
|
with AUnit;
with AUnit.Test_Fixtures;
package Array_Utils.Test_Cases is
type Test_Case is new AUnit.Test_Fixtures.Test_Fixture with null record;
procedure Test_Linear_Search_Element_Found_First_Entry (T : in out Test_Case);
procedure Test_Linear_Search_Element_Found_Last_Entry (T : in out Test_Case);
procedure Test_Linear_Search_Element_Found_Middle_Entry (T : in out Test_Case);
procedure Test_Linear_Search_Element_Not_Found (T : in out Test_Case);
-- TODO: Add unit tests for Binary_Search
end Array_Utils.Test_Cases;
|
with Ada.Unchecked_Deallocation;
with Device; use Device;
package body Benchmark is
procedure Set_Memory(benchmark : in out Benchmark_Type'Class;
mem : in Memory_Pointer) is
begin
benchmark.max_addr
:= (Address_Type(2) ** Get_Address_Bits) - 1;
benchmark.mem := mem;
end Set_Memory;
procedure Reset(benchmark : in out Benchmark_Type'Class;
context : in Natural) is
begin
Random.Reset(benchmark.generator, benchmark.seed);
Reset(benchmark.mem.all, context);
benchmark.data.all.Clear;
end Reset;
procedure Set_Argument(benchmark : in out Benchmark_Type;
arg : in String) is
value : constant String := Extract_Argument(arg);
begin
if Check_Argument(arg, "spacing") then
benchmark.spacing := Time_Type'Value(value);
elsif Check_Argument(arg, "seed") then
benchmark.seed := Integer'Value(value);
else
raise Invalid_Argument;
end if;
exception
when others =>
raise Invalid_Argument;
end Set_Argument;
function Check_Argument(arg : String;
name : String) return Boolean is
full_name : constant String := name & "=";
len : constant Natural := full_name'Length;
begin
if len < arg'Length then
return arg(arg'First .. arg'First + len - 1) = full_name;
else
return False;
end if;
end Check_Argument;
function Extract_Argument(arg : String) return String is
begin
for i in arg'First .. arg'Last loop
if arg(i) = '=' then
return arg(i + 1 .. arg'Last);
end if;
end loop;
return "";
end Extract_Argument;
function Get_Random(benchmark : Benchmark_Type'Class) return Natural is
begin
return Random.Random(benchmark.generator);
end Get_Random;
function Read_Value(benchmark : Benchmark_Type'Class;
address : Natural) return Integer is
begin
Read(benchmark, Address_Type(address * 4), 4);
Idle(benchmark, benchmark.spacing);
return benchmark.data.Element(address);
end Read_Value;
procedure Write_Value(benchmark : in Benchmark_Type'Class;
address : in Natural;
value : in Integer) is
begin
Write(benchmark, Address_Type(address * 4), 4);
Idle(benchmark, benchmark.spacing);
if Count_Type(address) >= benchmark.data.Length then
benchmark.data.Set_Length(Count_Type(address + 1));
end if;
benchmark.data.Replace_Element(address, value);
end Write_Value;
procedure Read(benchmark : in Benchmark_Type'Class;
address : in Address_Type;
size : in Positive) is
begin
if address + Address_Type(size) > benchmark.max_addr then
raise Invalid_Address;
end if;
Read(benchmark.mem.all, address, size);
end Read;
procedure Write(benchmark : in Benchmark_Type'Class;
address : in Address_Type;
size : in Positive) is
begin
if address + Address_Type(size) > benchmark.max_addr then
raise Invalid_Address;
end if;
Write(benchmark.mem.all, address, size);
end Write;
procedure Idle(benchmark : in Benchmark_Type'Class;
cycles : in Time_Type) is
begin
if cycles > 0 then
Idle(benchmark.mem.all, cycles);
end if;
end Idle;
procedure Free is
new Ada.Unchecked_Deallocation(Benchmark_Type'Class, Benchmark_Pointer);
procedure Free is
new Ada.Unchecked_Deallocation(Data_Vectors.Vector, Data_Pointer);
procedure Initialize(benchmark : in out Benchmark_Type) is
begin
benchmark.data := new Data_Vectors.Vector;
end Initialize;
procedure Finalize(benchmark : in out Benchmark_Type) is
begin
Free(benchmark.data);
end Finalize;
procedure Destroy(benchmark : in out Benchmark_Pointer) is
begin
Free(benchmark);
end Destroy;
end Benchmark;
|
with Ada.Text_IO; use Ada.Text_IO;
with Libadalang.Analysis; use Libadalang.Analysis;
with Libadalang.Common; use Libadalang.Common;
with Rejuvenation; use Rejuvenation;
with Rejuvenation.Factory; use Rejuvenation.Factory;
with Rejuvenation.Finder; use Rejuvenation.Finder;
with Rejuvenation.Navigation; use Rejuvenation.Navigation;
package body Examples.Navigation is
procedure Demo_Navigate_Node (Unit : Analysis_Unit);
procedure Demo (File_Name : String) is
Unit : constant Analysis_Unit := Open_File (File_Name);
begin
Put_Line ("=== Examples of Navigation =======");
New_Line;
Put_Line ("--- Example to navigate between nodes -------");
New_Line;
Demo_Navigate_Node (Unit);
New_Line;
end Demo;
procedure Demo_Navigate_Node (Unit : Analysis_Unit) is
Results_Node : constant Node_List.Vector :=
Find (Unit.Root, Ada_Call_Expr);
begin
for Node of Results_Node loop
declare
ObjNode : constant Ada_Node :=
Get_Ancestor_Of_Type (Node, Ada_Call_Stmt);
begin
if ObjNode /= No_Ada_Node then
Put_Line
("Call_Expr " & Node.Image & " inside Call_Stmt " &
ObjNode.Image);
end if;
end;
end loop;
end Demo_Navigate_Node;
end Examples.Navigation;
|
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
procedure Test_List_Index is
Not_In : exception;
type List is array (Positive range <>) of Unbounded_String;
function Index (Haystack : List; Needle : String) return Positive is
begin
for Index in Haystack'Range loop
if Haystack (Index) = Needle then
return Index;
end if;
end loop;
raise Not_In;
end Index;
-- Functions to create lists
function "+" (X, Y : String) return List is
begin
return (1 => To_Unbounded_String (X), 2 => To_Unbounded_String (Y));
end "+";
function "+" (X : List; Y : String) return List is
begin
return X & (1 => To_Unbounded_String (Y));
end "+";
Haystack : List := "Zig"+"Zag"+"Wally"+"Ronald"+"Bush"+"Krusty"+"Charlie"+"Bush"+"Bozo";
procedure Check (Needle : String) is
begin
Put (Needle);
Put_Line ("at" & Positive'Image (Index (Haystack, Needle)));
exception
when Not_In => Put_Line (" is not in");
end Check;
begin
Check ("Washington");
Check ("Bush");
end Test_List_Index;
|
------------------------------------------------------------------------------
-- --
-- Hardware Abstraction Layer for STM32 Targets --
-- --
-- Copyright (C) 2014, 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 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. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This file provides definitions for the STM32F4 (ARM Cortex M4F
-- from ST Microelectronics) Inter-Integrated Circuit (I2C) facility.
package STM32F4.I2C is
type I2C_Port is limited private;
type I2C_Device_Mode is
(I2C_Mode,
SMBusDevice_Mode,
SMBusHost_Mode);
for I2C_Device_Mode use
(I2C_Mode => 16#0000#,
SMBusDevice_Mode => 16#0002#,
SMBusHost_Mode => 16#000A#);
type I2C_Duty_Cycle is
(DutyCycle_16_9,
DutyCycle_2);
for I2C_Duty_Cycle use
(DutyCycle_16_9 => 16#4000#,
DutyCycle_2 => 16#BFFF#);
type I2C_Acknowledgement is (Ack_Disable, Ack_Enable);
for I2C_Acknowledgement use
(Ack_Enable => 16#0400#,
Ack_Disable => 16#0000#);
type I2C_Direction is (Transmitter, Receiver);
type I2C_Acknowledge_Address is
(AcknowledgedAddress_7bit,
AcknowledgedAddress_10bit);
for I2C_Acknowledge_Address use
(AcknowledgedAddress_7bit => 16#4000#,
AcknowledgedAddress_10bit => 16#C000#);
procedure Configure
(Port : in out I2C_Port;
Clock_Speed : Word;
Mode : I2C_Device_Mode;
Duty_Cycle : I2C_Duty_Cycle;
Own_Address : Half_Word;
Ack : I2C_Acknowledgement;
Ack_Address : I2C_Acknowledge_Address)
with Post => Port_Enabled (Port);
type I2C_State is (Enabled, Disabled);
procedure Set_State (Port : in out I2C_Port; State : I2C_State);
function Port_Enabled (Port : I2C_Port) return Boolean;
procedure Generate_Start (Port : in out I2C_Port; State : I2C_State);
procedure Generate_Stop (Port : in out I2C_Port; State : I2C_State);
procedure Send_7Bit_Address
(Port : in out I2C_Port;
Address : Byte;
Direction : I2C_Direction);
procedure Send_Data (Port : in out I2C_Port; Data : Byte);
function Read_Data (Port : I2C_Port) return Byte;
type I2C_Status_Flag is
(Start_Bit,
Address_Sent,
Byte_Transfer_Finished,
Address_Sent_10bit,
Stop_Detection,
Rx_Data_Register_Not_Empty,
Tx_Data_Register_Empty,
Bus_Error,
Arbitration_Lost,
Ack_Failure,
Overrun, -- also for underrun
Packet_Error,
Timeout,
SMB_Alert,
Master_Slave_Mode,
Busy,
Transmitter_Receiver_Mode,
General_Call,
SMB_Default,
SMB_Host,
Dual_Flag);
function Status (Port : I2C_Port; Flag : I2C_Status_Flag) return Boolean;
subtype Clearable_I2C_Status_Flag is
I2C_Status_Flag range Bus_Error .. SMB_Alert;
procedure Clear_Status
(Port : in out I2C_Port;
Target : Clearable_I2C_Status_Flag);
procedure Clear_Address_Sent_Status (Port : in out I2C_Port);
procedure Clear_Stop_Detection_Status (Port : in out I2C_Port);
procedure Wait_For_State
(Port : I2C_Port;
Queried : I2C_Status_Flag;
State : I2C_State;
Time_Out : Natural := 1_000_000); -- milliseconds
I2C_Timeout : exception;
-- Raised by Wait_For_Flag
procedure Set_Ack_Config (Port : in out I2C_Port; State : I2C_State);
type I2C_Nack_Position is (Next, Current);
procedure Set_Nack_Config (Port : in out I2C_Port; Pos : I2C_Nack_Position);
procedure Start
(Port : in out I2C_Port;
Address : Byte;
Direction : I2C_Direction);
function Read_Ack (Port : in out I2C_Port) return Byte;
function Read_Nack (Port : in out I2C_Port) return Byte;
procedure Write (Port : in out I2C_Port; Data : Byte);
procedure Stop (Port : in out I2C_Port);
type I2C_Interrupt is
(Error_Interrupt,
Event_Interrupt,
Buffer_Interrupt);
for I2C_Interrupt use
(Error_Interrupt => 16#0100#,
Event_Interrupt => 16#0200#,
Buffer_Interrupt => 16#0400#);
procedure Enable_Interrupt
(Port : in out I2C_Port;
Source : I2C_Interrupt)
with Post => Enabled (Port, Source);
procedure Disable_Interrupt
(Port : in out I2C_Port;
Source : I2C_Interrupt)
with Post => not Enabled (Port, Source);
function Enabled
(Port : in out I2C_Port;
Source : I2C_Interrupt)
return Boolean;
private
type I2C_Port is record
CR1 : Half_Word;
Reserved1 : Half_Word;
CR2 : Half_Word;
Reserved2 : Half_Word;
OAR1 : Half_Word;
Reserved3 : Half_Word;
OAR2 : Half_Word;
Reserved4 : Half_Word;
DR : Half_Word;
Reserved5 : Half_Word;
SR1 : Half_Word;
Reserved6 : Half_Word;
SR2 : Half_Word;
Reserved7 : Half_Word;
CCR : Half_Word;
Reserved8 : Half_Word;
TRISE : Half_Word;
Reserved9 : Half_Word;
FLTR : Half_Word;
Reserved0 : Half_Word;
end record
with Volatile, Size => 20 * 16;
for I2C_Port use record
CR1 at 0 range 0 .. 15;
Reserved1 at 2 range 0 .. 15;
CR2 at 4 range 0 .. 15;
Reserved2 at 6 range 0 .. 15;
OAR1 at 8 range 0 .. 15;
Reserved3 at 10 range 0 .. 15;
OAR2 at 12 range 0 .. 15;
Reserved4 at 14 range 0 .. 15;
DR at 16 range 0 .. 15;
Reserved5 at 18 range 0 .. 15;
SR1 at 20 range 0 .. 15;
Reserved6 at 22 range 0 .. 15;
SR2 at 24 range 0 .. 15;
Reserved7 at 26 range 0 .. 15;
CCR at 28 range 0 .. 15;
Reserved8 at 30 range 0 .. 15;
TRISE at 32 range 0 .. 15;
Reserved9 at 34 range 0 .. 15;
FLTR at 36 range 0 .. 15;
Reserved0 at 38 range 0 .. 15;
end record;
CR1_PE : constant := 16#0001#; -- Peripheral Enable
CR1_SMBUS : constant := 16#0002#; -- SMBus Mode
CR1_SMBTYPE : constant := 16#0008#; -- SMBus Type
CR1_ENARP : constant := 16#0010#; -- ARP Enable
CR1_ENPEC : constant := 16#0020#; -- PEC Enable
CR1_ENGC : constant := 16#0040#; -- General Call Enable
CR1_NOSTRETCH : constant := 16#0080#; -- Clock Stretching Disable (Slave mode)
CR1_START : constant := 16#0100#; -- Start Generation
CR1_STOP : constant := 16#0200#; -- Stop Generation
CR1_ACK : constant := 16#0400#; -- Acknowledge Enable
CR1_POS : constant := 16#0800#; -- Acknowledge/PEC Position (for data reception)
CR1_PEC : constant := 16#1000#; -- Packet Error Checking
CR1_ALERT : constant := 16#2000#; -- SMBus Alert
CR1_SWRST : constant := 16#8000#; -- Software Reset
CR1_Clear_Mask : constant := 16#FBF5#;
CR2_FREQ : constant := 16#003F#; -- Peripheral Clock Frequency bits
CCR_CCR : constant := 16#0FFF#; -- Clock Control Register
CCR_FS : constant := 16#8000#; -- Master Mode Selection fast/std
I2C_OAR1_ADD0 : constant := 16#0001#;
I2C_OAR1_ADD1 : constant := 16#0002#;
I2C_OAR1_ADD2 : constant := 16#0004#;
I2C_OAR1_ADD3 : constant := 16#0008#;
I2C_OAR1_ADD4 : constant := 16#0010#;
I2C_OAR1_ADD5 : constant := 16#0020#;
I2C_OAR1_ADD6 : constant := 16#0040#;
I2C_OAR1_ADD7 : constant := 16#0080#;
I2C_OAR1_ADD8 : constant := 16#0100#;
I2C_OAR1_ADD9 : constant := 16#0200#;
I2C_Direction_Transmitter : constant := 16#00#;
I2C_Direction_Receiver : constant := 16#01#;
end STM32F4.I2C;
|
-- MIT License
--
-- Copyright (c) 2021 Glen Cornell <glen.m.cornell@gmail.com>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
-- To be merged with gnat.sockets.os_constants...
-- from /usr/inlude/linux/can.h
-- from /usr/inlude/linux/can/raw.h
-- from /usr/inlude/bits/socket_type.h
package Sockets.Os_Constants is
pragma Pure;
-- special address description flags for the CAN_ID
CAN_EFF_FLAG : constant := 16#80000000#; -- EFF/SFF is set in the MSB
CAN_RTR_FLAG : constant := 16#40000000#; -- remote transmission request
CAN_ERR_FLAG : constant := 16#20000000#; -- error message frame
-- valid bits in CAN ID for frame formats
CAN_SFF_MASK : constant := 16#000007FF#; -- standard frame format (SFF)
CAN_EFF_MASK : constant := 16#1FFFFFFF#; -- extended frame format (EFF)
CAN_ERR_MASK : constant := 16#1FFFFFFF#; -- omit EFF, RTR, ERR flags
CAN_INV_FILTER : constant := 16#20000000#; -- to be set in can_filter.can_id
CAN_RAW_FILTER_MAX : constant := 512; -- maximum number of can_filter set via setsockopt()
-----------------------
-- protocol families --
-----------------------
SOCK_RAW : constant := 3; -- Raw protocol interface.
-- particular protocols of the protocol family PF_CAN
CAN_RAW : constant := 1; -- RAW sockets
CAN_BCM : constant := 2; -- Broadcast Manager
CAN_TP16 : constant := 3; -- VAG Transport Protocol v1.6
CAN_TP20 : constant := 4; -- VAG Transport Protocol v2.0
CAN_MCNET : constant := 5; -- Bosch MCNet
CAN_ISOTP : constant := 6; -- ISO 15765-2 Transport Protocol
CAN_NPROTO : constant := 7;
-- Protocol families.
PF_CAN : constant := 29; -- Controller Area Network.
-- Address families.
AF_CAN : constant := PF_CAN;
--------------------
-- Socket options --
--------------------
SOL_CAN_BASE : constant := 100;
SOL_CAN_RAW : constant := SOL_CAN_BASE + CAN_RAW;
CAN_RAW_FILTER : constant := 1; -- set 0 .. n can_filter(s)
CAN_RAW_ERR_FILTER : constant := 2; -- set filter for error frames
CAN_RAW_LOOPBACK : constant := 3; -- local loopback (default:on)
CAN_RAW_RECV_OWN_MSGS : constant := 4; -- receive my own msgs (default:off)
CAN_RAW_FD_FRAMES : constant := 5; -- allow CAN FD frames (default:off)
CAN_RAW_JOIN_FILTERS : constant := 6; -- all filters must match to trigger
end Sockets.Os_Constants;
|
with
xml.Reader,
ada.Text_IO;
package body XML
is
------------------
--- Attribute type
--
function Name (Self : in Attribute_t) return String
is
begin
return to_String (Self.Name);
end Name;
function Value (Self : in Attribute_t) return String
is
begin
return to_String (Self.Value);
end Value;
----------------
--- Element type
--
function to_XML (Filename : in String) return Element
is
use xml.Reader, xml.element_Vectors,
ada.Text_IO;
the_Root : aliased Element;
Line_Max : constant := 800_000;
Depth : Natural := 0;
the_XML_File : File_Type;
the_Parser : xml.reader.Parser;
Done : Boolean;
Buffer : String (1 .. Line_Max);
Buffer_Length : Natural;
element_Stack : element_Vector;
function current_Element return Element_view
is
begin
return element_Stack.last_Element;
end current_Element;
procedure Starter (Name: in unbounded_String;
Atts: in Attributes_view)
is
new_Element : constant Element_view := new Element' (name => Name,
attributes => new Attributes_t' (Atts.all),
data => <>,
parent => current_Element,
children => <>);
begin
current_Element.add_Child (new_Element);
element_Stack .append (new_Element);
end Starter;
procedure Ender (Name: in unbounded_String)
is
pragma Unreferenced (Name);
begin
element_Stack.delete_Last;
end Ender;
procedure data_Handler (Data: in unbounded_String)
is
begin
append (current_Element.Data, "" & Data);
end data_Handler;
begin
append (element_Stack, the_Root'unchecked_Access);
open (the_XML_File, In_File, Filename);
the_Parser := Create_Parser;
set_Element_Handler (the_Parser, Starter 'unrestricted_Access,
Ender 'unrestricted_Access);
set_Character_Data_Handler (the_Parser, data_Handler'unrestricted_Access);
loop
Get_Line (the_XML_File, Buffer, Buffer_Length);
Done := End_Of_File (the_XML_File);
Parse (the_Parser, Buffer (1 .. Buffer_Length), Done);
exit when Done;
end loop;
close (the_XML_File);
return the_Root;
end to_XML;
function Name (Self : in Element) return String
is
begin
return to_String (Self.Name);
end Name;
function Data (Self : in Element) return String
is
begin
return to_String (Self.Data);
end Data;
function Children (Self : in Element) return Elements
is
the_Children : Elements (1 .. Integer (Self.children.Length));
begin
for Each in the_Children'Range
loop
the_Children (Each) := Self.Children.Element (Each);
end loop;
return the_Children;
end Children;
function Children (Self : in Element; Named : in String) return Elements
is
the_Children : Elements (1 .. Integer (Self.children.Length));
Count : Natural := 0;
begin
for Each in the_Children'Range
loop
if Self.Children.Element (Each).Name = Named
then
Count := Count + 1;
the_Children (Count) := Self.Children.Element (Each);
end if;
end loop;
return the_Children (1 .. Count);
end Children;
procedure add_Child (Self : in out Element; the_Child : access Element)
is
begin
Self.Children.append (the_Child.all'Access);
end add_Child;
function Child (Self : in Element; Named : in String) return access Element
is
use element_Vectors;
Cursor : element_Vectors.Cursor := Self.children.First;
begin
while has_Element (Cursor)
loop
if element_Vectors.Element (Cursor).Name = Named
then
return element_Vectors.Element (Cursor);
end if;
next (Cursor);
end loop;
return null;
end Child;
function Attributes (Self : in Element) return Attributes_t
is
begin
return Self.Attributes.all;
end Attributes;
function Attribute (Self : in Element; Named : in String) return access Attribute_t'Class
is
begin
for Each in Self.Attributes'Range
loop
if Self.Attributes (Each).Name = Named
then
return Self.Attributes (Each)'Access;
end if;
end loop;
return null;
end Attribute;
function Parent (Self : in Element) return access Element
is
begin
return Self.Parent;
end Parent;
end XML;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- B I N D O . B U I L D E R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2019-2020, 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 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 COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Binderr; use Binderr;
with Butil; use Butil;
with Debug; use Debug;
with Opt; use Opt;
with Output; use Output;
with Types; use Types;
with Bindo.Units; use Bindo.Units;
with Bindo.Validators;
use Bindo.Validators;
use Bindo.Validators.Invocation_Graph_Validators;
use Bindo.Validators.Library_Graph_Validators;
with Bindo.Writers;
use Bindo.Writers;
use Bindo.Writers.Phase_Writers;
with GNAT; use GNAT;
with GNAT.Dynamic_HTables; use GNAT.Dynamic_HTables;
package body Bindo.Builders is
-------------------------------
-- Invocation_Graph_Builders --
-------------------------------
package body Invocation_Graph_Builders is
-----------------
-- Global data --
-----------------
Inv_Graph : Invocation_Graph := Invocation_Graphs.Nil;
Lib_Graph : Library_Graph := Library_Graphs.Nil;
-----------------------
-- Local subprograms --
-----------------------
procedure Create_Edge (IR_Id : Invocation_Relation_Id);
pragma Inline (Create_Edge);
-- Create a new edge for invocation relation IR_Id in invocation graph
-- Inv_Graph.
procedure Create_Edges (U_Id : Unit_Id);
pragma Inline (Create_Edges);
-- Create new edges for all invocation relations of unit U_Id
procedure Create_Vertex
(IC_Id : Invocation_Construct_Id;
Vertex : Library_Graph_Vertex_Id);
pragma Inline (Create_Vertex);
-- Create a new vertex for invocation construct IC_Id in invocation
-- graph Inv_Graph. The vertex is linked to vertex Vertex of library
-- graph Lib_Graph.
procedure Create_Vertices (U_Id : Unit_Id);
pragma Inline (Create_Vertices);
-- Create new vertices for all invocation constructs of unit U_Id in
-- invocation graph Inv_Graph.
function Declaration_Placement_Vertex
(Vertex : Library_Graph_Vertex_Id;
Placement : Declaration_Placement_Kind)
return Library_Graph_Vertex_Id;
pragma Inline (Declaration_Placement_Vertex);
-- Obtain the spec or body of vertex Vertex depending on the requested
-- placement in Placement.
----------------------------
-- Build_Invocation_Graph --
----------------------------
function Build_Invocation_Graph
(Lib_G : Library_Graph) return Invocation_Graph
is
begin
pragma Assert (Present (Lib_G));
Start_Phase (Invocation_Graph_Construction);
-- Prepare the global data
Inv_Graph :=
Create
(Initial_Vertices => Number_Of_Elaborable_Units,
Initial_Edges => Number_Of_Elaborable_Units,
Lib_Graph => Lib_G);
Lib_Graph := Lib_G;
For_Each_Elaborable_Unit (Create_Vertices'Access);
For_Each_Elaborable_Unit (Create_Edges'Access);
Validate_Invocation_Graph (Inv_Graph);
End_Phase (Invocation_Graph_Construction);
return Inv_Graph;
end Build_Invocation_Graph;
-----------------
-- Create_Edge --
-----------------
procedure Create_Edge (IR_Id : Invocation_Relation_Id) is
pragma Assert (Present (Inv_Graph));
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (IR_Id));
Invoker_Sig : constant Invocation_Signature_Id := Invoker (IR_Id);
Target_Sig : constant Invocation_Signature_Id := Target (IR_Id);
pragma Assert (Present (Invoker_Sig));
pragma Assert (Present (Target_Sig));
begin
-- Nothing to do when the target denotes an invocation construct that
-- resides in a unit which will never be elaborated.
if not Needs_Elaboration (Target_Sig) then
return;
end if;
Add_Edge
(G => Inv_Graph,
Source => Corresponding_Vertex (Inv_Graph, Invoker_Sig),
Target => Corresponding_Vertex (Inv_Graph, Target_Sig),
IR_Id => IR_Id);
end Create_Edge;
------------------
-- Create_Edges --
------------------
procedure Create_Edges (U_Id : Unit_Id) is
pragma Assert (Present (Inv_Graph));
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (U_Id));
U_Rec : Unit_Record renames ALI.Units.Table (U_Id);
begin
for IR_Id in U_Rec.First_Invocation_Relation ..
U_Rec.Last_Invocation_Relation
loop
Create_Edge (IR_Id);
end loop;
end Create_Edges;
-------------------
-- Create_Vertex --
-------------------
procedure Create_Vertex
(IC_Id : Invocation_Construct_Id;
Vertex : Library_Graph_Vertex_Id)
is
begin
pragma Assert (Present (Inv_Graph));
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (IC_Id));
pragma Assert (Present (Vertex));
Add_Vertex
(G => Inv_Graph,
IC_Id => IC_Id,
Body_Vertex =>
Declaration_Placement_Vertex
(Vertex => Vertex,
Placement => Body_Placement (IC_Id)),
Spec_Vertex =>
Declaration_Placement_Vertex
(Vertex => Vertex,
Placement => Spec_Placement (IC_Id)));
end Create_Vertex;
---------------------
-- Create_Vertices --
---------------------
procedure Create_Vertices (U_Id : Unit_Id) is
pragma Assert (Present (Inv_Graph));
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (U_Id));
U_Rec : Unit_Record renames ALI.Units.Table (U_Id);
Vertex : constant Library_Graph_Vertex_Id :=
Corresponding_Vertex (Lib_Graph, U_Id);
begin
for IC_Id in U_Rec.First_Invocation_Construct ..
U_Rec.Last_Invocation_Construct
loop
Create_Vertex (IC_Id, Vertex);
end loop;
end Create_Vertices;
----------------------------------
-- Declaration_Placement_Vertex --
----------------------------------
function Declaration_Placement_Vertex
(Vertex : Library_Graph_Vertex_Id;
Placement : Declaration_Placement_Kind)
return Library_Graph_Vertex_Id
is
begin
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (Vertex));
if Placement = In_Body then
return Proper_Body (Lib_Graph, Vertex);
else
pragma Assert (Placement = In_Spec);
return Proper_Spec (Lib_Graph, Vertex);
end if;
end Declaration_Placement_Vertex;
end Invocation_Graph_Builders;
----------------------------
-- Library_Graph_Builders --
----------------------------
package body Library_Graph_Builders is
---------------------
-- Data structures --
---------------------
procedure Destroy_Line_Number (Line : in out Logical_Line_Number);
pragma Inline (Destroy_Line_Number);
-- Destroy line number Line
function Hash_Unit (U_Id : Unit_Id) return Bucket_Range_Type;
pragma Inline (Hash_Unit);
-- Obtain the hash value of key U_Id
package Unit_Line_Tables is new Dynamic_Hash_Tables
(Key_Type => Unit_Id,
Value_Type => Logical_Line_Number,
No_Value => No_Line_Number,
Expansion_Threshold => 1.5,
Expansion_Factor => 2,
Compression_Threshold => 0.3,
Compression_Factor => 2,
"=" => "=",
Destroy_Value => Destroy_Line_Number,
Hash => Hash_Unit);
-----------------
-- Global data --
-----------------
Lib_Graph : Library_Graph := Library_Graphs.Nil;
Unit_To_Line : Unit_Line_Tables.Dynamic_Hash_Table :=
Unit_Line_Tables.Nil;
-- The map of unit name -> line number, used to detect duplicate unit
-- names in the forced-elaboration-order file and report errors.
-----------------------
-- Local subprograms --
-----------------------
procedure Add_Unit
(U_Id : Unit_Id;
Line : Logical_Line_Number);
pragma Inline (Add_Unit);
-- Create a relationship between unit U_Id and its declaration line in
-- map Unit_To_Line.
procedure Create_Forced_Edge
(Pred : Unit_Id;
Succ : Unit_Id);
pragma Inline (Create_Forced_Edge);
-- Create a new forced edge between predecessor unit Pred and successor
-- unit Succ.
procedure Create_Forced_Edges;
pragma Inline (Create_Forced_Edges);
-- Inspect the contents of the forced-elaboration-order file, and create
-- specialized edges for each valid pair of units listed within.
procedure Create_Spec_And_Body_Edge (U_Id : Unit_Id);
pragma Inline (Create_Spec_And_Body_Edge);
-- Establish a link between the spec and body of unit U_Id. In certain
-- cases this may result in a new edge which is added to library graph
-- Lib_Graph.
procedure Create_Vertex (U_Id : Unit_Id);
pragma Inline (Create_Vertex);
-- Create a new vertex for unit U_Id in library graph Lib_Graph
procedure Create_With_Edge
(W_Id : With_Id;
Succ : Library_Graph_Vertex_Id);
pragma Inline (Create_With_Edge);
-- Create a new edge for with W_Id where the predecessor is the library
-- graph vertex of the withed unit, and the successor is Succ. The edge
-- is added to library graph Lib_Graph.
procedure Create_With_Edges (U_Id : Unit_Id);
pragma Inline (Create_With_Edges);
-- Establish links between unit U_Id and its predecessor units. The new
-- edges are added to library graph Lib_Graph.
procedure Create_With_Edges
(U_Id : Unit_Id;
Succ : Library_Graph_Vertex_Id);
pragma Inline (Create_With_Edges);
-- Create new edges for all withs of unit U_Id where the predecessor is
-- some withed unit, and the successor is Succ. The edges are added to
-- library graph Lib_Graph.
procedure Duplicate_Unit_Error
(U_Id : Unit_Id;
Nam : Unit_Name_Type;
Line : Logical_Line_Number);
pragma Inline (Duplicate_Unit_Error);
-- Emit an error concerning the duplication of unit U_Id with name Nam
-- that is redeclared in the forced-elaboration-order file at line Line.
procedure Internal_Unit_Info (Nam : Unit_Name_Type);
pragma Inline (Internal_Unit_Info);
-- Emit an information message concerning the omission of an internal
-- unit with name Nam from the creation of forced edges.
function Is_Duplicate_Unit (U_Id : Unit_Id) return Boolean;
pragma Inline (Is_Duplicate_Unit);
-- Determine whether unit U_Id is already recorded in map Unit_To_Line
function Is_Significant_With (W_Id : With_Id) return Boolean;
pragma Inline (Is_Significant_With);
-- Determine whether with W_Id plays a significant role in elaboration
procedure Missing_Unit_Info (Nam : Unit_Name_Type);
pragma Inline (Missing_Unit_Info);
-- Emit an information message concerning the omission of an undefined
-- unit found in the forced-elaboration-order file.
--------------
-- Add_Unit --
--------------
procedure Add_Unit
(U_Id : Unit_Id;
Line : Logical_Line_Number)
is
begin
pragma Assert (Present (U_Id));
Unit_Line_Tables.Put (Unit_To_Line, U_Id, Line);
end Add_Unit;
-------------------------
-- Build_Library_Graph --
-------------------------
function Build_Library_Graph return Library_Graph is
begin
Start_Phase (Library_Graph_Construction);
-- Prepare the global data
Lib_Graph :=
Create
(Initial_Vertices => Number_Of_Elaborable_Units,
Initial_Edges => Number_Of_Elaborable_Units);
For_Each_Elaborable_Unit (Create_Vertex'Access);
For_Each_Elaborable_Unit (Create_Spec_And_Body_Edge'Access);
For_Each_Elaborable_Unit (Create_With_Edges'Access);
Create_Forced_Edges;
Validate_Library_Graph (Lib_Graph);
End_Phase (Library_Graph_Construction);
return Lib_Graph;
end Build_Library_Graph;
------------------------
-- Create_Forced_Edge --
------------------------
procedure Create_Forced_Edge
(Pred : Unit_Id;
Succ : Unit_Id)
is
pragma Assert (Present (Pred));
pragma Assert (Present (Succ));
Pred_Vertex : constant Library_Graph_Vertex_Id :=
Corresponding_Vertex (Lib_Graph, Pred);
Succ_Vertex : constant Library_Graph_Vertex_Id :=
Corresponding_Vertex (Lib_Graph, Succ);
begin
Write_Unit_Name (Name (Pred));
Write_Str (" <-- ");
Write_Unit_Name (Name (Succ));
Write_Eol;
Add_Edge
(G => Lib_Graph,
Pred => Pred_Vertex,
Succ => Succ_Vertex,
Kind => Forced_Edge,
Activates_Task => False);
end Create_Forced_Edge;
-------------------------
-- Create_Forced_Edges --
-------------------------
procedure Create_Forced_Edges is
Current_Unit : Unit_Id;
Iter : Forced_Units_Iterator;
Previous_Unit : Unit_Id;
Unit_Line : Logical_Line_Number;
Unit_Name : Unit_Name_Type;
begin
Previous_Unit := No_Unit_Id;
Unit_To_Line := Unit_Line_Tables.Create (20);
-- Inspect the contents of the forced-elaboration-order file supplied
-- to the binder using switch -f, and diagnose each unit accordingly.
Iter := Iterate_Forced_Units;
while Has_Next (Iter) loop
Next (Iter, Unit_Name, Unit_Line);
Current_Unit := Corresponding_Unit (Unit_Name);
if not Present (Current_Unit) then
Missing_Unit_Info (Unit_Name);
elsif Is_Internal_Unit (Current_Unit) then
Internal_Unit_Info (Unit_Name);
elsif Is_Duplicate_Unit (Current_Unit) then
Duplicate_Unit_Error (Current_Unit, Unit_Name, Unit_Line);
-- Otherwise the unit is a valid candidate for a vertex. Create a
-- forced edge between each pair of units.
else
Add_Unit (Current_Unit, Unit_Line);
if Present (Previous_Unit) then
Create_Forced_Edge
(Pred => Previous_Unit,
Succ => Current_Unit);
end if;
Previous_Unit := Current_Unit;
end if;
end loop;
Unit_Line_Tables.Destroy (Unit_To_Line);
end Create_Forced_Edges;
-------------------------------
-- Create_Spec_And_Body_Edge --
-------------------------------
procedure Create_Spec_And_Body_Edge (U_Id : Unit_Id) is
Extra_Vertex : Library_Graph_Vertex_Id;
Vertex : Library_Graph_Vertex_Id;
begin
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (U_Id));
Vertex := Corresponding_Vertex (Lib_Graph, U_Id);
-- The unit denotes a body that completes a previous spec. Link the
-- spec and body. Add an edge between the predecessor spec and the
-- successor body.
if Is_Body_With_Spec (Lib_Graph, Vertex) then
Extra_Vertex :=
Corresponding_Vertex (Lib_Graph, Corresponding_Spec (U_Id));
Set_Corresponding_Item (Lib_Graph, Vertex, Extra_Vertex);
Add_Edge
(G => Lib_Graph,
Pred => Extra_Vertex,
Succ => Vertex,
Kind => Spec_Before_Body_Edge,
Activates_Task => False);
-- The unit denotes a spec with a completing body. Link the spec and
-- body.
elsif Is_Spec_With_Body (Lib_Graph, Vertex) then
Extra_Vertex :=
Corresponding_Vertex (Lib_Graph, Corresponding_Body (U_Id));
Set_Corresponding_Item (Lib_Graph, Vertex, Extra_Vertex);
end if;
end Create_Spec_And_Body_Edge;
-------------------
-- Create_Vertex --
-------------------
procedure Create_Vertex (U_Id : Unit_Id) is
begin
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (U_Id));
Add_Vertex
(G => Lib_Graph,
U_Id => U_Id);
end Create_Vertex;
----------------------
-- Create_With_Edge --
----------------------
procedure Create_With_Edge
(W_Id : With_Id;
Succ : Library_Graph_Vertex_Id)
is
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (W_Id));
pragma Assert (Present (Succ));
Withed_Rec : With_Record renames Withs.Table (W_Id);
Withed_U_Id : constant Unit_Id :=
Corresponding_Unit (Withed_Rec.Uname);
Kind : Library_Graph_Edge_Kind;
Withed_Vertex : Library_Graph_Vertex_Id;
begin
-- Nothing to do when the withed unit does not need to be elaborated.
-- This prevents spurious dependencies that can never be satisfied.
if not Needs_Elaboration (Withed_U_Id) then
return;
end if;
Withed_Vertex := Corresponding_Vertex (Lib_Graph, Withed_U_Id);
-- The with comes with pragma Elaborate. Treat the edge as a with
-- edge when switch -d_e (ignore the effects of pragma Elaborate)
-- is in effect.
if Withed_Rec.Elaborate
and then not Debug_Flag_Underscore_E
then
Kind := Elaborate_Edge;
-- The withed unit is a spec with a completing body. Add an edge
-- between the body of the withed predecessor and the withing
-- successor.
if Is_Spec_With_Body (Lib_Graph, Withed_Vertex) then
Add_Edge
(G => Lib_Graph,
Pred =>
Corresponding_Vertex
(Lib_Graph, Corresponding_Body (Withed_U_Id)),
Succ => Succ,
Kind => Kind,
Activates_Task => False);
end if;
-- The with comes with pragma Elaborate_All. Treat the edge as a with
-- edge when switch -d_a (ignore the effects of pragma Elaborate_All)
-- is in effect.
elsif Withed_Rec.Elaborate_All
and then not Debug_Flag_Underscore_A
then
Kind := Elaborate_All_Edge;
-- Otherwise this is a regular with
else
Kind := With_Edge;
end if;
-- Add an edge between the withed predecessor unit and the withing
-- successor.
Add_Edge
(G => Lib_Graph,
Pred => Withed_Vertex,
Succ => Succ,
Kind => Kind,
Activates_Task => False);
end Create_With_Edge;
-----------------------
-- Create_With_Edges --
-----------------------
procedure Create_With_Edges (U_Id : Unit_Id) is
begin
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (U_Id));
Create_With_Edges
(U_Id => U_Id,
Succ => Corresponding_Vertex (Lib_Graph, U_Id));
end Create_With_Edges;
-----------------------
-- Create_With_Edges --
-----------------------
procedure Create_With_Edges
(U_Id : Unit_Id;
Succ : Library_Graph_Vertex_Id)
is
pragma Assert (Present (Lib_Graph));
pragma Assert (Present (U_Id));
pragma Assert (Present (Succ));
U_Rec : Unit_Record renames ALI.Units.Table (U_Id);
begin
for W_Id in U_Rec.First_With .. U_Rec.Last_With loop
if Is_Significant_With (W_Id) then
Create_With_Edge (W_Id, Succ);
end if;
end loop;
end Create_With_Edges;
------------------
-- Destroy_Unit --
------------------
procedure Destroy_Line_Number (Line : in out Logical_Line_Number) is
pragma Unreferenced (Line);
begin
null;
end Destroy_Line_Number;
--------------------------
-- Duplicate_Unit_Error --
--------------------------
procedure Duplicate_Unit_Error
(U_Id : Unit_Id;
Nam : Unit_Name_Type;
Line : Logical_Line_Number)
is
pragma Assert (Present (U_Id));
pragma Assert (Present (Nam));
Prev_Line : constant Logical_Line_Number :=
Unit_Line_Tables.Get (Unit_To_Line, U_Id);
begin
Error_Msg_Nat_1 := Nat (Line);
Error_Msg_Nat_2 := Nat (Prev_Line);
Error_Msg_Unit_1 := Nam;
Error_Msg
(Force_Elab_Order_File.all
& ":#: duplicate unit name $ from line #");
end Duplicate_Unit_Error;
---------------
-- Hash_Unit --
---------------
function Hash_Unit (U_Id : Unit_Id) return Bucket_Range_Type is
begin
pragma Assert (Present (U_Id));
return Bucket_Range_Type (U_Id);
end Hash_Unit;
------------------------
-- Internal_Unit_Info --
------------------------
procedure Internal_Unit_Info (Nam : Unit_Name_Type) is
begin
pragma Assert (Present (Nam));
Write_Line
("""" & Get_Name_String (Nam) & """: predefined unit ignored");
end Internal_Unit_Info;
-----------------------
-- Is_Duplicate_Unit --
-----------------------
function Is_Duplicate_Unit (U_Id : Unit_Id) return Boolean is
begin
pragma Assert (Present (U_Id));
return Unit_Line_Tables.Contains (Unit_To_Line, U_Id);
end Is_Duplicate_Unit;
-------------------------
-- Is_Significant_With --
-------------------------
function Is_Significant_With (W_Id : With_Id) return Boolean is
pragma Assert (Present (W_Id));
Withed_Rec : With_Record renames Withs.Table (W_Id);
Withed_U_Id : constant Unit_Id :=
Corresponding_Unit (Withed_Rec.Uname);
begin
-- Nothing to do for a unit which does not exist any more
if not Present (Withed_U_Id) then
return False;
-- Nothing to do for a limited with
elsif Withed_Rec.Limited_With then
return False;
-- Nothing to do when the unit does not need to be elaborated
elsif not Needs_Elaboration (Withed_U_Id) then
return False;
end if;
return True;
end Is_Significant_With;
-----------------------
-- Missing_Unit_Info --
-----------------------
procedure Missing_Unit_Info (Nam : Unit_Name_Type) is
begin
pragma Assert (Present (Nam));
Write_Line
("""" & Get_Name_String (Nam) & """: not present; ignored");
end Missing_Unit_Info;
end Library_Graph_Builders;
end Bindo.Builders;
|
package Garden_Pkg is
subtype Position is Positive range 1..10;
function GetRandPos return Position;
function GetField(pos : Position) return Boolean;
procedure SprayField(pos : Position);
procedure SprayAbsorbed;
private
type Fields is array(Integer range <>) of Boolean;
Garden : Fields(1..10) := (1..10 => false);
end Garden_Pkg;
|
with Ada.Text_IO;
procedure Hello is
package IO renames Ada.Text_IO;
begin
for I in Integer range 1 .. 10 loop
bar();
end loop;
end Hello;
|
-----------------------------------------------------------------------
-- awa-events-queues-fifos -- Fifo event queues (memory based)
-- Copyright (C) 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Concurrent.Fifos;
with Util.Beans.Basic;
with EL.Beans;
with EL.Contexts;
private package AWA.Events.Queues.Fifos is
type Fifo_Queue (Name_Length : Natural) is limited new Queue
and Util.Beans.Basic.Bean with private;
type Fifo_Queue_Access is access all Fifo_Queue'Class;
-- Get the queue name.
overriding
function Get_Name (From : in Fifo_Queue) return String;
-- Get the model queue reference object.
-- Returns a null object if the queue is not persistent.
overriding
function Get_Queue (From : in Fifo_Queue) return AWA.Events.Models.Queue_Ref;
-- Queue the event.
overriding
procedure Enqueue (Into : in out Fifo_Queue;
Event : in AWA.Events.Module_Event'Class);
-- Dequeue an event and process it with the <b>Process</b> procedure.
overriding
procedure Dequeue (From : in out Fifo_Queue;
Process : access procedure (Event : in Module_Event'Class));
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
overriding
function Get_Value (From : in Fifo_Queue;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
-- If the name cannot be found, the method should raise the No_Value
-- exception.
overriding
procedure Set_Value (From : in out Fifo_Queue;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Release the queue storage.
overriding
procedure Finalize (From : in out Fifo_Queue);
-- Create the queue associated with the given name and configure it by using
-- the configuration properties.
function Create_Queue (Name : in String;
Props : in EL.Beans.Param_Vectors.Vector;
Context : in EL.Contexts.ELContext'Class) return Queue_Access;
private
package Fifo_Protected_Queue is
new Util.Concurrent.Fifos (Module_Event_Access, 100, True);
type Fifo_Queue (Name_Length : Natural) is limited new Queue
and Util.Beans.Basic.Bean with record
Fifo : Fifo_Protected_Queue.Fifo;
Name : String (1 .. Name_Length);
end record;
end AWA.Events.Queues.Fifos;
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
package interrupts_hpp is
type Interrupt is
(VBLANK,
LCD_STATUS,
TIMER,
SERIAL,
JOYPAD);
pragma Convention (C, Interrupt); -- ./interrupts.hpp:3
end interrupts_hpp;
|
with Type_Lib; use Type_Lib;
package Shared_Data is
protected type Sensor_Reading is
procedure Set (Meassured_Value : in Float);
entry Get (Value : out Float);
private
Updated : Boolean := False;
Current_Value : Float;
end Sensor_Reading;
protected type Actuator_Write is
procedure Set (Calculated_Value : in RPM; Motor : in Motor_Direction);
entry Get (Value : out RPM; Motor : out Motor_Direction);
private
Updated : Boolean := False;
Current_Value : RPM;
Current_Motor : Motor_Direction;
end Actuator_Write;
end Shared_Data;
|
package body GNAT.Calendar.Time_IO is
function Image (Date : Ada.Calendar.Time; Picture : Picture_String)
return String is
begin
raise Program_Error; -- unimplemented
return Image (Date, Picture);
end Image;
function Value (Date : String) return Ada.Calendar.Time is
begin
raise Program_Error; -- unimplemented
return Value (Date);
end Value;
end GNAT.Calendar.Time_IO;
|
package Opt6 is
type String_Access is access all String;
type String_List is array (Positive range <>) of String_Access;
type String_List_Access is access all String_List;
type Command_Line_Iterator is record
Params : String_List_Access;
Current : Natural;
end record;
function Current_Parameter (Iter : Command_Line_Iterator) return String;
end Opt6;
|
pragma SPARK_Mode;
with Types; use Types;
-- @summary
-- Types used in the line finder algorithm
package Line_Finder_Types is
-- States detected by the IR sensors
-- @value Lost no line found. Start panicking
-- @value Online one line is found somewhere under the middle set of
-- sensors
-- @value BranchRight we found a branch going to the right of the robot
-- @value BranchLeft we found a branch going to the left of the robot
-- @value Fork we found a fork in the line. Pick it up!
-- @value Perp we came to a perpendicular intersection.
-- @value Unknown this is a state where we have lots of noise. Ignore
type LineState is
(Lost, Online, BranchRight, BranchLeft, Fork, Perp, Unknown)
with Size => 8;
-- The orientation of the robot in relation to the line
-- @value Left the line is under the left side of the robot
-- @value Center the line is under the center of the robot
-- @value Right the line is under the right side of the robot
type BotOrientation is
(Left, Center, Right);
-- When we can't find the line we should do larger circles to refind it.
-- This is the type that we can use to tell the motors how to circle
subtype OfflineCounterType is Integer range
2 * Motor_Speed'First .. 2 * Motor_Speed'Last;
-- We can make decisions based on a simple scheme or complex
-- @value Simple simple decision matrix. Best when we are Lost
-- @value Complex complex decision matrix. Best when we know whats going on
type DecisionType is
(Simple, Complex);
-- The data structure holding information about the robot and its current
-- situation
-- @field LineHistory the last computer state
-- @field OrientationHistory the last computed BotOrientation
-- @field SensorValueHistory the last sensor value detected
-- @field ErrorHistory the last computed error from the robot centered
-- @field OfflineCounter How the motors should circle when lost
-- @field LostCounter How long its been since we saw the line
-- @field Decision type of decisions matrix to use
-- @field LineDetect the value computed from the value we read from the
-- sensors
-- @field Sensor_Values the actual values we read from the sensors
type RobotState is record
LineHistory : LineState := Online;
OrientationHistory : BotOrientation := Center;
SensorValueHistory : Integer := 0;
ErrorHistory : Robot_Position := 0;
OfflineCounter : OfflineCounterType := 0;
LostCounter : Natural := 0;
Decision : DecisionType := Complex;
LineDetect : Byte := 0;
Sensor_Values : Sensor_Array := (others => 0);
end record;
-- FOR DEBUG! Maps states to strings
LineStateStr : array (LineState) of String (1 .. 2) :=
(Lost => "Lo",
Online => "On",
BranchRight => "BR",
BranchLeft => "BL",
Fork => "Fo",
Perp => "Pe",
Unknown => "Uk");
-- This is the lookup table we use to convert SensorValues to detected
-- states.
LineStateLookup : constant array (0 .. 2 ** Num_Sensors - 1) of LineState :=
(2#00_000_000# => Lost,
2#00_000_001# => Online,
2#00_000_010# => Online,
2#00_000_011# => Online,
2#00_000_100# => Online,
2#00_000_101# => Fork,
2#00_000_110# => Online,
2#00_000_111# => BranchLeft,
2#00_001_000# => Online,
2#00_001_001# => Fork,
2#00_001_010# => Fork,
2#00_001_011# => Fork,
2#00_001_100# => Online,
2#00_001_101# => Fork,
2#00_001_110# => Online,
2#00_001_111# => BranchLeft,
2#00_010_000# => Online,
2#00_010_001# => Fork,
2#00_010_010# => Fork,
2#00_010_011# => Fork,
2#00_010_100# => Fork,
2#00_010_101# => Unknown,
2#00_010_110# => Fork,
2#00_010_111# => Fork,
2#00_011_000# => Online,
2#00_011_001# => Fork,
2#00_011_010# => Fork,
2#00_011_011# => Fork,
2#00_011_100# => Online,
2#00_011_101# => Fork,
2#00_011_110# => Online,
2#00_011_111# => BranchLeft,
2#00_100_000# => Online,
2#00_100_001# => Fork,
2#00_100_010# => Fork,
2#00_100_011# => Fork,
2#00_100_100# => Fork,
2#00_100_101# => Unknown,
2#00_100_110# => Fork,
2#00_100_111# => Fork,
2#00_101_000# => Fork,
2#00_101_001# => Unknown,
2#00_101_010# => Unknown,
2#00_101_011# => Unknown,
2#00_101_100# => Fork,
2#00_101_101# => Unknown,
2#00_101_110# => Fork,
2#00_101_111# => Fork,
2#00_110_000# => Online,
2#00_110_001# => Fork,
2#00_110_010# => Fork,
2#00_110_011# => Fork,
2#00_110_100# => Fork,
2#00_110_101# => Unknown,
2#00_110_110# => Fork,
2#00_110_111# => Fork,
2#00_111_000# => BranchRight,
2#00_111_001# => Fork,
2#00_111_010# => Fork,
2#00_111_011# => Fork,
2#00_111_100# => BranchRight,
2#00_111_101# => Unknown,
2#00_111_110# => BranchRight,
2#00_111_111# => Perp);
end Line_Finder_Types;
|
------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- Command Line Interface --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020-2021, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Streams.Stream_IO;
with Ada.Containers.Synchronized_Queue_Interfaces;
with Ada.Containers.Unbounded_Synchronized_Queues;
with Repositories;
with Registrar.Last_Run;
with Registrar.Queries;
with Registrar.Subsystems;
with Registrar.Source_Files;
with Registrar.Registration;
with Workers, Workers.Reporting;
with Unit_Names, Unit_Names.Sets;
package body Build is
use type Registrar.Library_Units.Library_Unit_Kind;
use type Registrar.Source_Files.Source_File_Access;
New_Line: Character renames Workers.Reporting.New_Line;
--
-- Utilities
--
----------------------
-- Object_File_Name --
----------------------
function Object_File_Name (Unit: Registrar.Library_Units.Library_Unit)
return String
is
use Ada.Directories;
use Repositories;
use Registrar.Subsystems;
Unit_Simple_Name: constant String
:= (if Unit.Body_File /= null then
Simple_Name (Unit.Body_File.Full_Name)
else
Simple_Name (Unit.Spec_File.Full_Name));
Subsys: constant Subsystem
:= Registrar.Queries.Lookup_Subsystem (Unit.Name.Subsystem_Name);
begin
if Subsys.AURA
and then Extract_Repository (Subsys.Source_Repository).Format = System
then
declare
Subsys_Name: constant String := Subsys.Name.To_UTF8_String;
begin
return Current_Directory & '/' & Subsys_Name & '/'
& Subsys_Name & ".so";
end;
else
return Build_Root & '/' & Base_Name (Unit_Simple_Name) & ".o";
end if;
end Object_File_Name;
-------------------
-- ALI_File_Name --
-------------------
function ALI_File_Name (Unit: Registrar.Library_Units.Library_Unit)
return String
is
use Ada.Directories;
begin
return Build_Root
& '/' & Base_Name (Simple_Name (Object_File_Name (Unit))) & ".ali";
end ALI_File_Name;
--
-- Build_Configuration
--
Last_Config_Store: constant String
:= Ada.Directories.Current_Directory & "/.aura/last_build.dat";
----------------------------
-- Load_Last_Build_Config --
----------------------------
procedure Load_Last_Build_Config (Configuration: out Build_Configuration)
is
use Ada.Streams.Stream_IO;
Config_File: File_Type;
begin
Open (File => Config_File,
Mode => In_File,
Name => Last_Config_Store);
Build_Configuration'Read (Stream (Config_File), Configuration);
Close (Config_File);
exception
when others => null;
end Load_Last_Build_Config;
------------------------
-- Store_Build_Config --
------------------------
procedure Store_Build_Config (Current_Config: Build_Configuration) is
use Ada.Streams.Stream_IO;
Config_File: File_Type;
begin
if not Ada.Directories.Exists (".aura") then
Ada.Directories.Create_Directory (".aura");
end if;
if not Ada.Directories.Exists (Last_Config_Store) then
Create (File => Config_File,
Mode => Out_File,
Name => Last_Config_Store);
else
Open (File => Config_File,
Mode => Out_File,
Name => Last_Config_Store);
end if;
Build_Configuration'Write (Stream (Config_File), Current_Config);
Close (Config_File);
end Store_Build_Config;
--
-- Preparation
--
----------------
-- Init_Paths --
----------------
procedure Init_Paths is
use Ada.Directories;
begin
if Registrar.Last_Run.All_Library_Units.Is_Empty
and then Exists (Build_Root)
then
Delete_Tree (Build_Root);
Create_Path (Build_Output_Root);
Create_Path (Build_Root);
elsif not Exists (Build_Root)
or else not Exists (Build_Output_Root)
then
Create_Path (Build_Output_Root);
end if;
end Init_Paths;
-------------------------------
-- Hash_Compilation_Products --
-------------------------------
package Hash_Compilation_Orders is
type Hash_Compilation_Order is new Workers.Work_Order with
record
Target: Registrar.Library_Units.Library_Unit;
end record;
-- The Hash_Compilation_Order does not generate any further orders.
-- This ensures Direct_Hash_Compilatoion to execute an order directly
-- without needing to deal with trackers
overriding function Image (Order: Hash_Compilation_Order) return String;
overriding procedure Execute (Order: in out Hash_Compilation_Order);
end Hash_Compilation_Orders;
package body Hash_Compilation_Orders is separate;
--------------------------------------------------
procedure Hash_Compilation_Products is
use Registrar.Library_Units;
Order: Hash_Compilation_Orders.Hash_Compilation_Order;
Selected_Units: Registrar.Library_Units.Library_Unit_Sets.Set;
All_Units: constant Registrar.Library_Units.Library_Unit_Sets.Set
:= Registrar.Queries.Entered_Library_Units;
begin
Order.Tracker := Compilation_Hash_Progress'Access;
-- Find our selected units for hashing. These are everything except
-- Subunit kinds
for Unit of All_Units loop
pragma Assert (Unit.Kind /= Unknown);
-- Compiled units also need to be rehashed
if Unit.State in Available | Compiled
and then Unit.Kind /= Subunit
then
Selected_Units.Include (Unit);
end if;
end loop;
Order.Tracker.Increase_Total_Items_By (Natural (Selected_Units.Length));
-- Dispatch
for Unit of Selected_Units loop
Order.Target := Unit;
Workers.Enqueue_Order (Order);
end loop;
end Hash_Compilation_Products;
--------------------------------------
-- Direct_Hash_Compilation_Products --
--------------------------------------
procedure Direct_Hash_Compilation_Products
(Unit: in Registrar.Library_Units.Library_Unit)
is
Direct_Order: Hash_Compilation_Orders.Hash_Compilation_Order
:= (Tracker => null,
Target => Unit);
begin
Direct_Order.Execute;
end Direct_Hash_Compilation_Products;
----------------------------
-- Compute_Recompilations --
----------------------------
package Recompilation_Check_Orders is
protected type Recompilation_Set is
procedure Enter_Subset
(Entry_Subset: in out Unit_Names.Sets.Set);
-- Enters any items that are in Entry_Subset but not in the
-- Recompilation_Set. Items that are already exist in the
-- Recompilation_Set are deleted from the Entry_Subset.
--
-- The principal of operation is that a Recompilation_Check_Order
-- gets the reverse dependency set for it's target unit, and then
-- submits that set to Enter_Subset. On return, Entry_Subset
-- will contain only the units that the order should then
-- generate additional orders for.
--
-- The approach eliminates cyclic recursion.
function Retrieve return Unit_Names.Sets.Set;
-- Returns the entire Recompilation_Set
private
Master: Unit_Names.Sets.Set;
Ret_Guard: Boolean := False;
end Recompilation_Set;
type Recompilation_Set_Access is access Recompilation_Set;
-------------------------------
-- Recompilation_Check_Order --
-------------------------------
-- Recompilation_Check_Orders take a Target unit name, and recursively
-- submits additional orders for each dependent unit if it is determined
-- that the Target library unit requires recompilation.
--
-- How the order determines if the Target unit requires recompilation
-- depends on the Mode component.
--
-- At the end of the process, the Phase_Trigger takes the generated
-- set of unit names and marks all corresponding units in
-- All_Library_Units as "Available" so that they will be recompiled
-- in the compilation phase
type Processing_Mode is
(Test,
-- The designated library unit needs to be checked. This means
-- checking the compilation hash, specification hash, and
-- implementation hash against the Last_Run set.
--
-- This mode is only set from the original dispatch
-- (Build.Compute_Recompilations)
Set);
-- The designated unit name must be entered into the Recompilation
-- Set, along with reverse dependencies, recursively.
--
-- This mode is always set for any recursively dispatched order.
type Recompilation_Check_Order is new Workers.Work_Order with
record
Target : Unit_Names.Unit_Name;
Mode : Processing_Mode;
Recomp_Set: Recompilation_Set_Access;
end record;
overriding function Image (Order: Recompilation_Check_Order)
return String;
overriding procedure Execute (Order: in out Recompilation_Check_Order);
overriding procedure Phase_Trigger
(Order: in out Recompilation_Check_Order);
end Recompilation_Check_Orders;
package body Recompilation_Check_Orders is separate;
--------------------------------------------------
procedure Compute_Recompilations (Configuration: Build_Configuration) is
use Registrar.Library_Units;
use Recompilation_Check_Orders;
package LU_Keyed_Ops renames
Registrar.Library_Units.Library_Unit_Sets_Keyed_Operations;
procedure Set_Available (Unit: in out Library_Unit) is
begin
Unit.State := Available;
end Set_Available;
Last_Config: Build_Configuration;
All_Units: Library_Unit_Sets.Set
:= Registrar.Queries.Entered_Library_Units;
Target_Set: Unit_Names.Sets.Set;
Order: Recompilation_Check_Order;
Beacon_OK: Boolean;
begin
Compute_Recompilations_Completion.Approach (Beacon_OK);
if not Beacon_OK then return; end if;
Load_Last_Build_Config (Configuration => Last_Config);
if Registrar.Last_Run.All_Library_Units.Is_Empty
or else Last_Config /= Configuration
then
-- All units must be recompiled. The actual Compile process will
-- ensure any residual objects are deleted
for C in All_Units.Iterate loop
declare
use Repositories;
use Registrar.Subsystems;
USS: constant Subsystem
:= Registrar.Queries.Lookup_Subsystem
(All_Units(C).Name.Subsystem_Name);
begin
if not (USS.AURA and then
Extract_Repository(USS.Source_Repository).Format
= System)
then
LU_Keyed_Ops.Update_Element_Preserving_Key
(Container => All_Units,
Position => C,
Process => Set_Available'Access);
end if;
end;
end loop;
Registrar.Registration.Update_Library_Unit_Subset (All_Units);
Compute_Recompilations_Completion.Leave;
return;
end if;
-- Only re-evaluate Compiled items, since the purpose here is to select
-- which "Compiled" units need to be pushed back to "Available" so that
-- they will be compiled.
for Unit of All_Units loop
if Unit.Kind in Package_Unit | Subprogram_Unit | External_Unit
and then Unit.State = Compiled
then
Target_Set.Insert (Unit.Name);
end if;
end loop;
Order.Tracker := Compute_Recompilations_Progress'Access;
Order.Mode := Test;
Order.Recomp_Set := new Recompilation_Set;
Order.Tracker.Increase_Total_Items_By (Natural (Target_Set.Length));
for Name of Target_Set loop
Order.Target := Name;
Workers.Enqueue_Order (Order);
end loop;
end Compute_Recompilations;
end Build;
|
with STM32_SVD.I2C;
with STM32_SVD; use STM32_SVD;
package STM32GD.I2C is
pragma Preelaborate;
I2C_1 : STM32_SVD.I2C.I2C_Peripheral renames STM32_SVD.I2C.I2C1_Periph;
I2C_2 : STM32_SVD.I2C.I2C_Peripheral renames STM32_SVD.I2C.I2C2_Periph;
end STM32GD.I2C;
|
--
-- Standard Ada packages
--
with Ada.Text_IO;
with Ada.Integer_Text_IO;
with Ada.Float_Text_IO;
--
-- Other packages
--
with BBS.BBB.i2c;
with BBS.BBB.i2c.PCA9685;
with BBS.BBB.i2c.BME280;
with BBS.units;
with WeatherCommon;
procedure test is
port : BBS.BBB.i2c.i2c_interface := BBS.BBB.i2c.i2c_new;
servo : BBS.BBB.i2c.PCA9685.PS9685_ptr := BBS.BBB.i2c.PCA9685.i2c_new;
sensor : BBS.BBB.i2c.BME280.BME280_ptr := BBS.BBB.i2c.BME280.i2c_new;
selection : integer;
error : integer;
channel : integer;
time_on : integer;
time_off : integer;
int_value : integer;
press : BBS.units.press_p;
temp : BBS.units.temp_c;
hum : float;
begin
Ada.Text_IO.Put_Line("Test and calibration program");
Ada.Text_IO.Put_Line("Configuring the i2c interface");
port.configure("/dev/i2c-1");
servo.configure(port, BBS.BBB.i2c.PCA9685.addr_0, error);
sensor.configure(port, BBS.BBB.i2c.BME280.addr, error);
for channel in BBS.BBB.i2c.PCA9685.channel loop
servo.set_servo_range(channel, WeatherCommon.servo_min,
WeatherCommon.servo_max);
end loop;
loop
Ada.Text_IO.Put_Line("Options are:");
Ada.Text_IO.Put_Line(" 0 - Exit");
Ada.Text_IO.Put_Line(" 1 - All off");
Ada.Text_IO.Put_Line(" 2 - All on");
Ada.Text_IO.Put_Line(" 3 - Set channel");
Ada.Text_IO.Put_Line(" 4 - Sleep on");
Ada.Text_IO.Put_Line(" 5 - Sleep off");
Ada.Text_IO.Put_Line(" 6 - Dump sensor");
Ada.Text_IO.Put_Line(" 7 - Set temperature servo");
Ada.Text_IO.Put_Line(" 8 - Set pressure servo");
Ada.Text_IO.Put_Line(" 9 - Set humidity servo");
Ada.Text_IO.Put_Line(" 10 - Process data flow");
Ada.Text_IO.Put("Select option: ");
Ada.Integer_Text_IO.Get(selection);
exit when selection = 0;
case selection is
when 1 =>
servo.set_full_off(BBS.BBB.i2c.PCA9685.ALL_CHAN, error);
when 2 =>
servo.set_full_on(BBS.BBB.i2c.PCA9685.ALL_CHAN, error);
when 3 =>
Ada.Text_IO.Put("Enter channel number: ");
Ada.Integer_Text_IO.Get(channel);
Ada.Text_IO.Put("Enter time on: ");
Ada.Integer_Text_IO.Get(time_on);
Ada.Text_IO.Put("Enter time off: ");
Ada.Integer_Text_IO.Get(time_off);
servo.set(BBS.BBB.i2c.PCA9685.channel(channel),
BBS.BBB.uint12(time_on), BBS.BBB.uint12(time_off), error);
when 4 =>
servo.sleep(true, error);
when 5 =>
servo.sleep(false, error);
when 6 =>
sensor.start_conversion(error);
loop
exit when sensor.data_ready(error);
end loop;
sensor.read_data(error);
temp := sensor.get_temp;
press := sensor.get_press;
hum := sensor.get_hum;
Ada.Text_IO.Put("Temperature: ");
Ada.Integer_Text_IO.Put(sensor.get_temp, width => 12, base => 16);
Ada.Text_IO.Put_Line(" (" & float'Image(float(temp)) & ")");
Ada.Text_IO.Put("Temperature: ");
Ada.Float_Text_IO.Put(float(temp), fore => 3, aft => 2, exp => 0);
Ada.Text_IO.Put_Line("C");
Ada.Text_IO.Put("Pressure: ");
Ada.Integer_Text_IO.Put(sensor.get_press, width => 12, base => 16);
Ada.Text_IO.Put_Line(" (" & float'Image(float(press)) & ")");
Ada.Text_IO.Put("Pressure: ");
Ada.Float_Text_IO.Put(float(press), fore => 6, aft => 2, exp => 0);
Ada.Text_IO.Put_Line("Pa");
Ada.Text_IO.Put("Humidity: ");
Ada.Integer_Text_IO.Put(sensor.get_hum, width => 12, base => 16);
Ada.Text_IO.Put_Line(" (" & float'Image(hum) & ")");
Ada.Text_IO.Put("Humidity: ");
Ada.Float_Text_IO.Put(float(hum), fore => 3, aft => 2, exp => 0);
Ada.Text_IO.Put_Line("%");
when 7 =>
Ada.Text_IO.Put("Enter temperature: ");
Ada.Integer_Text_IO.Get(int_value);
WeatherCommon.show_temp(servo, BBS.units.temp_c(int_value));
when 8 =>
Ada.Text_IO.Put("Enter pressure: ");
Ada.Integer_Text_IO.Get(int_value);
WeatherCommon.show_press(servo, BBS.units.press_p(int_value));
when 9 =>
Ada.Text_IO.Put("Enter humidity: ");
Ada.Integer_Text_IO.Get(int_value);
WeatherCommon.show_hum(servo, float(int_value));
when 10 =>
sensor.start_conversion(error);
loop
exit when sensor.data_ready(error);
end loop;
sensor.read_data(error);
temp := sensor.get_temp;
press := sensor.get_press;
hum := sensor.get_hum;
Ada.Text_IO.Put("Temperature: ");
Ada.Float_Text_IO.Put(float(temp), fore => 3, aft => 2, exp => 0);
Ada.Text_IO.Put_Line("C");
Ada.Text_IO.Put("Pressure: ");
Ada.Float_Text_IO.Put(float(press), fore => 6, aft => 2, exp => 0);
Ada.Text_IO.Put_Line("Pa");
Ada.Text_IO.Put("Humidity: ");
Ada.Float_Text_IO.Put(float(hum), fore => 3, aft => 2, exp => 0);
Ada.Text_IO.Put_Line("%");
WeatherCommon.show_temp(servo, temp);
WeatherCommon.show_press(servo, press);
WeatherCommon.show_hum(servo, hum);
when others =>
Ada.Text_IO.Put_Line("Unknown option, try again");
end case;
end loop;
Ada.Text_IO.Put_Line("Good-bye.");
end;
|
-- Project: MART - Modular Airborne Real-Time Testbed
-- System: Emergency Recovery System
-- Authors: Markus Neumair (Original C-Code)
-- Emanuel Regnath (emanuel.regnath@tum.de) (Ada Port)
--
-- Module Description:
-- Driver for the IMU MPU6000
--
with HIL; use HIL;
private package MPU6000.Register with SPARK_Mode is
type Address_Type is new HIL.Byte;
-- MPU6000 register adresses and other defines
MPU6000_REV_C4_ES : constant := 16#14#;
MPU6000_REV_C5_ES : constant := 16#15#;
MPU6000_REV_D6_ES : constant := 16#16#;
MPU6000_REV_D7_ES : constant := 16#17#;
MPU6000_REV_D8_ES : constant := 16#18#;
MPU6000_REV_C4 : constant := 16#54#;
MPU6000_REV_C5 : constant := 16#55#;
MPU6000_REV_D6 : constant := 16#56#;
MPU6000_REV_D7 : constant := 16#57#;
MPU6000_REV_D8 : constant := 16#58#;
MPU6000_REV_D9 : constant := 16#59#;
-- MPU6000_RA_ST_X_GYRO : constant := 16#00#;
-- MPU6000_RA_ST_Y_GYRO : constant := 16#01#;
-- MPU6000_RA_ST_Z_GYRO : constant := 16#02#;
MPU6000_RA_SELF_TEST_X : constant := 16#0D#;
MPU6000_RA_SELF_TEST_Y : constant := 16#0E#;
MPU6000_RA_SELF_TEST_Z : constant := 16#0F#;
MPU6000_RA_SELF_TEST_A : constant := 16#10#;
-- MPU6000_RA_XG_OFFS_USRH : constant := 16#13#;
-- MPU6000_RA_XG_OFFS_USRL : constant := 16#14#;
-- MPU6000_RA_YG_OFFS_USRH : constant := 16#15#;
-- MPU6000_RA_YG_OFFS_USRL : constant := 16#16#;
-- MPU6000_RA_ZG_OFFS_USRH : constant := 16#17#;
-- MPU6000_RA_ZG_OFFS_USRL : constant := 16#18#;
MPU6000_RA_SMPLRT_DIV : constant := 16#19#;
MPU6000_RA_CONFIG : constant := 16#1A#;
MPU6000_RA_GYRO_CONFIG : constant := 16#1B#;
MPU6000_RA_ACCEL_CONFIG : constant := 16#1C#;
-- MPU6000_RA_ACCEL_CONFIG_2 : constant := 16#1D#;
-- MPU6000_RA_LP_ACCEL_ODR : constant := 16#1E#;
MPU6000_RA_WOM_THR : constant := 16#1F#;
MPU6000_RA_FIFO_EN : constant := 16#23#;
MPU6000_RA_I2C_MST_CTRL : constant := 16#24#;
MPU6000_RA_I2C_SLV0_ADDR : constant := 16#25#;
MPU6000_RA_I2C_SLV0_REG : constant := 16#26#;
MPU6000_RA_I2C_SLV0_CTRL : constant := 16#27#;
MPU6000_RA_I2C_SLV1_ADDR : constant := 16#28#;
MPU6000_RA_I2C_SLV1_REG : constant := 16#29#;
MPU6000_RA_I2C_SLV1_CTRL : constant := 16#2A#;
MPU6000_RA_I2C_SLV2_ADDR : constant := 16#2B#;
MPU6000_RA_I2C_SLV2_REG : constant := 16#2C#;
MPU6000_RA_I2C_SLV2_CTRL : constant := 16#2D#;
MPU6000_RA_I2C_SLV3_ADDR : constant := 16#2E#;
MPU6000_RA_I2C_SLV3_REG : constant := 16#2F#;
MPU6000_RA_I2C_SLV3_CTRL : constant := 16#30#;
MPU6000_RA_I2C_SLV4_ADDR : constant := 16#31#;
MPU6000_RA_I2C_SLV4_REG : constant := 16#32#;
MPU6000_RA_I2C_SLV4_DO : constant := 16#33#;
MPU6000_RA_I2C_SLV4_CTRL : constant := 16#34#;
MPU6000_RA_I2C_SLV4_DI : constant := 16#35#;
MPU6000_RA_I2C_MST_STATUS : constant := 16#36#;
MPU6000_RA_INT_PIN_CFG : constant := 16#37#;
MPU6000_RA_INT_ENABLE : constant := 16#38#;
-- MPU6000_RA_DMP_INT_STATUS : constant := 16#39#;
MPU6000_RA_INT_STATUS : constant := 16#3A#;
MPU6000_RA_ACCEL_XOUT_H : constant := 16#3B#;
MPU6000_RA_ACCEL_XOUT_L : constant := 16#3C#;
MPU6000_RA_ACCEL_YOUT_H : constant := 16#3D#;
MPU6000_RA_ACCEL_YOUT_L : constant := 16#3E#;
MPU6000_RA_ACCEL_ZOUT_H : constant := 16#3F#;
MPU6000_RA_ACCEL_ZOUT_L : constant := 16#40#;
MPU6000_RA_TEMP_OUT_H : constant := 16#41#;
MPU6000_RA_TEMP_OUT_L : constant := 16#42#;
MPU6000_RA_GYRO_XOUT_H : constant := 16#43#;
MPU6000_RA_GYRO_XOUT_L : constant := 16#44#;
MPU6000_RA_GYRO_YOUT_H : constant := 16#45#;
MPU6000_RA_GYRO_YOUT_L : constant := 16#46#;
MPU6000_RA_GYRO_ZOUT_H : constant := 16#47#;
MPU6000_RA_GYRO_ZOUT_L : constant := 16#48#;
MPU6000_RA_EXT_SENS_DATA_00 : constant := 16#49#;
MPU6000_RA_EXT_SENS_DATA_01 : constant := 16#4A#;
MPU6000_RA_EXT_SENS_DATA_02 : constant := 16#4B#;
MPU6000_RA_EXT_SENS_DATA_03 : constant := 16#4C#;
MPU6000_RA_EXT_SENS_DATA_04 : constant := 16#4D#;
MPU6000_RA_EXT_SENS_DATA_05 : constant := 16#4E#;
MPU6000_RA_EXT_SENS_DATA_06 : constant := 16#4F#;
MPU6000_RA_EXT_SENS_DATA_07 : constant := 16#50#;
MPU6000_RA_EXT_SENS_DATA_08 : constant := 16#51#;
MPU6000_RA_EXT_SENS_DATA_09 : constant := 16#52#;
MPU6000_RA_EXT_SENS_DATA_10 : constant := 16#53#;
MPU6000_RA_EXT_SENS_DATA_11 : constant := 16#54#;
MPU6000_RA_EXT_SENS_DATA_12 : constant := 16#55#;
MPU6000_RA_EXT_SENS_DATA_13 : constant := 16#56#;
MPU6000_RA_EXT_SENS_DATA_14 : constant := 16#57#;
MPU6000_RA_EXT_SENS_DATA_15 : constant := 16#58#;
MPU6000_RA_EXT_SENS_DATA_16 : constant := 16#59#;
MPU6000_RA_EXT_SENS_DATA_17 : constant := 16#5A#;
MPU6000_RA_EXT_SENS_DATA_18 : constant := 16#5B#;
MPU6000_RA_EXT_SENS_DATA_19 : constant := 16#5C#;
MPU6000_RA_EXT_SENS_DATA_20 : constant := 16#5D#;
MPU6000_RA_EXT_SENS_DATA_21 : constant := 16#5E#;
MPU6000_RA_EXT_SENS_DATA_22 : constant := 16#5F#;
MPU6000_RA_EXT_SENS_DATA_23 : constant := 16#60#;
MPU6000_RA_MOT_DETECT_STATUS : constant := 16#61#;
MPU6000_RA_I2C_SLV0_DO : constant := 16#63#;
MPU6000_RA_I2C_SLV1_DO : constant := 16#64#;
MPU6000_RA_I2C_SLV2_DO : constant := 16#65#;
MPU6000_RA_I2C_SLV3_DO : constant := 16#66#;
MPU6000_RA_I2C_MST_DELAY_CTRL : constant := 16#67#;
MPU6000_RA_SIGNAL_PATH_RESET : constant := 16#68#;
MPU6000_RA_MOT_DETECT_CTRL : constant := 16#69#;
MPU6000_RA_USER_CTRL : constant := 16#6A#;
MPU6000_RA_PWR_MGMT_1 : constant := 16#6B#;
MPU6000_RA_PWR_MGMT_2 : constant := 16#6C#;
-- MPU6000_RA_BANK_SEL : constant := 16#6D#;
-- MPU6000_RA_MEM_START_ADDR : constant := 16#6E#;
-- MPU6000_RA_MEM_R_W : constant := 16#6F#;
-- MPU6000_RA_DMP_CFG_1 : constant := 16#70#;
-- MPU6000_RA_DMP_CFG_2 : constant := 16#71#;
MPU6000_RA_FIFO_COUNTH : constant := 16#72#;
MPU6000_RA_FIFO_COUNTL : constant := 16#73#;
MPU6000_RA_FIFO_R_W : constant := 16#74#;
MPU6000_RA_WHO_AM_I : constant := 16#75#;
MPU6000_RA_XA_OFFSET_H : constant := 16#77#;
MPU6000_RA_XA_OFFSET_L : constant := 16#78#;
MPU6000_RA_YA_OFFSET_H : constant := 16#7A#;
MPU6000_RA_YA_OFFSET_L : constant := 16#7B#;
MPU6000_RA_ZA_OFFSET_H : constant := 16#7D#;
MPU6000_RA_ZA_OFFSET_L : constant := 16#7E#;
MPU6000_TC_PWR_MODE_BIT : constant := 7;
MPU6000_TC_OFFSET_BIT : constant := 6;
MPU6000_TC_OFFSET_LENGTH : constant := 6;
MPU6000_TC_OTP_BNK_VLD_BIT : constant := 0;
MPU6000_VDDIO_LEVEL_VLOGIC : constant := 0;
MPU6000_VDDIO_LEVEL_VDD : constant := 1;
MPU6000_CFG_EXT_SYNC_SET_BIT : constant := 5;
MPU6000_CFG_EXT_SYNC_SET_LENGTH : constant := 3;
MPU6000_CFG_DLPF_CFG_BIT : constant := 2;
MPU6000_CFG_DLPF_CFG_LENGTH : constant := 3;
MPU6000_EXT_SYNC_DISABLED : constant := 16#0#;
MPU6000_EXT_SYNC_TEMP_OUT_L : constant := 16#1#;
MPU6000_EXT_SYNC_GYRO_XOUT_L : constant := 16#2#;
MPU6000_EXT_SYNC_GYRO_YOUT_L : constant := 16#3#;
MPU6000_EXT_SYNC_GYRO_ZOUT_L : constant := 16#4#;
MPU6000_EXT_SYNC_ACCEL_XOUT_L : constant := 16#5#;
MPU6000_EXT_SYNC_ACCEL_YOUT_L : constant := 16#6#;
MPU6000_EXT_SYNC_ACCEL_ZOUT_L : constant := 16#7#;
MPU6000_GCONFIG_XG_ST_BIT : constant := 7;
MPU6000_GCONFIG_YG_ST_BIT : constant := 6;
MPU6000_GCONFIG_ZG_ST_BIT : constant := 5;
MPU6000_GCONFIG_FS_SEL_BIT : constant := 4;
MPU6000_GCONFIG_FS_SEL_LENGTH : constant := 2;
MPU6000_ACONFIG_XA_ST_BIT : constant := 7;
MPU6000_ACONFIG_YA_ST_BIT : constant := 6;
MPU6000_ACONFIG_ZA_ST_BIT : constant := 5;
MPU6000_ACONFIG_AFS_SEL_BIT : constant := 4;
MPU6000_ACONFIG_AFS_SEL_LENGTH : constant := 2;
MPU6000_ACONFIG_ACCEL_HPF_BIT : constant := 2;
MPU6000_ACONFIG_ACCEL_HPF_LENGTH : constant := 3;
MPU6000_DHPF_RESET : constant := 16#00#;
MPU6000_DHPF_5 : constant := 16#01#;
MPU6000_DHPF_2P5 : constant := 16#02#;
MPU6000_DHPF_1P25 : constant := 16#03#;
MPU6000_DHPF_0P63 : constant := 16#04#;
MPU6000_DHPF_HOLD : constant := 16#07#;
MPU6000_TEMP_FIFO_EN_BIT : constant := 7;
MPU6000_XG_FIFO_EN_BIT : constant := 6;
MPU6000_YG_FIFO_EN_BIT : constant := 5;
MPU6000_ZG_FIFO_EN_BIT : constant := 4;
MPU6000_ACCEL_FIFO_EN_BIT : constant := 3;
MPU6000_SLV2_FIFO_EN_BIT : constant := 2;
MPU6000_SLV1_FIFO_EN_BIT : constant := 1;
MPU6000_SLV0_FIFO_EN_BIT : constant := 0;
MPU6000_MULT_MST_EN_BIT : constant := 7;
MPU6000_WAIT_FOR_ES_BIT : constant := 6;
MPU6000_SLV_3_FIFO_EN_BIT : constant := 5;
MPU6000_I2C_MST_P_NSR_BIT : constant := 4;
MPU6000_I2C_MST_CLK_BIT : constant := 3;
MPU6000_I2C_MST_CLK_LENGTH : constant := 4;
MPU6000_CLOCK_DIV_348 : constant := 16#0#;
MPU6000_CLOCK_DIV_333 : constant := 16#1#;
MPU6000_CLOCK_DIV_320 : constant := 16#2#;
MPU6000_CLOCK_DIV_308 : constant := 16#3#;
MPU6000_CLOCK_DIV_296 : constant := 16#4#;
MPU6000_CLOCK_DIV_286 : constant := 16#5#;
MPU6000_CLOCK_DIV_276 : constant := 16#6#;
MPU6000_CLOCK_DIV_267 : constant := 16#7#;
MPU6000_CLOCK_DIV_258 : constant := 16#8#;
MPU6000_CLOCK_DIV_500 : constant := 16#9#;
MPU6000_CLOCK_DIV_471 : constant := 16#A#;
MPU6000_CLOCK_DIV_444 : constant := 16#B#;
MPU6000_CLOCK_DIV_421 : constant := 16#C#;
MPU6000_CLOCK_DIV_400 : constant := 16#D#;
MPU6000_CLOCK_DIV_381 : constant := 16#E#;
MPU6000_CLOCK_DIV_364 : constant := 16#F#;
MPU6000_I2C_SLV_RW_BIT : constant := 7;
MPU6000_I2C_SLV_ADDR_BIT : constant := 6;
MPU6000_I2C_SLV_ADDR_LENGTH : constant := 7;
MPU6000_I2C_SLV_EN_BIT : constant := 7;
MPU6000_I2C_SLV_BYTE_SW_BIT : constant := 6;
MPU6000_I2C_SLV_REG_DIS_BIT : constant := 5;
MPU6000_I2C_SLV_GRP_BIT : constant := 4;
MPU6000_I2C_SLV_LEN_BIT : constant := 3;
MPU6000_I2C_SLV_LEN_LENGTH : constant := 4;
MPU6000_I2C_SLV4_RW_BIT : constant := 7;
MPU6000_I2C_SLV4_ADDR_BIT : constant := 6;
MPU6000_I2C_SLV4_ADDR_LENGTH : constant := 7;
MPU6000_I2C_SLV4_EN_BIT : constant := 7;
MPU6000_I2C_SLV4_INT_EN_BIT : constant := 6;
MPU6000_I2C_SLV4_REG_DIS_BIT : constant := 5;
MPU6000_I2C_SLV4_MST_DLY_BIT : constant := 4;
MPU6000_I2C_SLV4_MST_DLY_LENGTH : constant := 5;
MPU6000_MST_PASS_THROUGH_BIT : constant := 7;
MPU6000_MST_I2C_SLV4_DONE_BIT : constant := 6;
MPU6000_MST_I2C_LOST_ARB_BIT : constant := 5;
MPU6000_MST_I2C_SLV4_NACK_BIT : constant := 4;
MPU6000_MST_I2C_SLV3_NACK_BIT : constant := 3;
MPU6000_MST_I2C_SLV2_NACK_BIT : constant := 2;
MPU6000_MST_I2C_SLV1_NACK_BIT : constant := 1;
MPU6000_MST_I2C_SLV0_NACK_BIT : constant := 0;
MPU6000_INTCFG_INT_LEVEL_BIT : constant := 7;
MPU6000_INTCFG_INT_OPEN_BIT : constant := 6;
MPU6000_INTCFG_LATCH_INT_EN_BIT : constant := 5;
MPU6000_INTCFG_INT_RD_CLEAR_BIT : constant := 4;
MPU6000_INTCFG_FSYNC_INT_LEVEL_BIT : constant := 3;
MPU6000_INTCFG_FSYNC_INT_EN_BIT : constant := 2;
MPU6000_INTCFG_I2C_BYPASS_EN_BIT : constant := 1;
MPU6000_INTCFG_CLKOUT_EN_BIT : constant := 0;
MPU6000_INTMODE_ACTIVEHIGH : constant := 16#00#;
MPU6000_INTMODE_ACTIVELOW : constant := 16#01#;
MPU6000_INTDRV_PUSHPULL : constant := 16#00#;
MPU6000_INTDRV_OPENDRAIN : constant := 16#01#;
MPU6000_INTLATCH_50USPULSE : constant := 16#00#;
MPU6000_INTLATCH_WAITCLEAR : constant := 16#01#;
MPU6000_INTCLEAR_STATUSREAD : constant := 16#00#;
MPU6000_INTCLEAR_ANYREAD : constant := 16#01#;
MPU6000_INTERRUPT_FF_BIT : constant := 7;
MPU6000_INTERRUPT_MOT_BIT : constant := 6;
MPU6000_INTERRUPT_ZMOT_BIT : constant := 5;
MPU6000_INTERRUPT_FIFO_OFLOW_BIT : constant := 4;
MPU6000_INTERRUPT_I2C_MST_INT_BIT : constant := 3;
MPU6000_INTERRUPT_PLL_RDY_INT_BIT : constant := 2;
MPU6000_INTERRUPT_DMP_INT_BIT : constant := 1;
MPU6000_INTERRUPT_DATA_RDY_BIT : constant := 0;
MPU6000_DMPINT_5_BIT : constant := 5;
MPU6000_DMPINT_4_BIT : constant := 4;
MPU6000_DMPINT_3_BIT : constant := 3;
MPU6000_DMPINT_2_BIT : constant := 2;
MPU6000_DMPINT_1_BIT : constant := 1;
MPU6000_DMPINT_0_BIT : constant := 0;
MPU6000_MOTION_MOT_XNEG_BIT : constant := 7;
MPU6000_MOTION_MOT_XPOS_BIT : constant := 6;
MPU6000_MOTION_MOT_YNEG_BIT : constant := 5;
MPU6000_MOTION_MOT_YPOS_BIT : constant := 4;
MPU6000_MOTION_MOT_ZNEG_BIT : constant := 3;
MPU6000_MOTION_MOT_ZPOS_BIT : constant := 2;
MPU6000_MOTION_MOT_ZRMOT_BIT : constant := 0;
MPU6000_DELAYCTRL_DELAY_ES_SHADOW_BIT : constant := 7;
MPU6000_DELAYCTRL_I2C_SLV4_DLY_EN_BIT : constant := 4;
MPU6000_DELAYCTRL_I2C_SLV3_DLY_EN_BIT : constant := 3;
MPU6000_DELAYCTRL_I2C_SLV2_DLY_EN_BIT : constant := 2;
MPU6000_DELAYCTRL_I2C_SLV1_DLY_EN_BIT : constant := 1;
MPU6000_DELAYCTRL_I2C_SLV0_DLY_EN_BIT : constant := 0;
MPU6000_PATHRESET_GYRO_RESET_BIT : constant := 2;
MPU6000_PATHRESET_ACCEL_RESET_BIT : constant := 1;
MPU6000_PATHRESET_TEMP_RESET_BIT : constant := 0;
MPU6000_DETECT_ACCEL_ON_DELAY_BIT : constant := 5;
MPU6000_DETECT_ACCEL_ON_DELAY_LENGTH : constant := 2;
MPU6000_DETECT_FF_COUNT_BIT : constant := 3;
MPU6000_DETECT_FF_COUNT_LENGTH : constant := 2;
MPU6000_DETECT_MOT_COUNT_BIT : constant := 1;
MPU6000_DETECT_MOT_COUNT_LENGTH : constant := 2;
MPU6000_DETECT_DECREMENT_RESET : constant := 16#0#;
MPU6000_DETECT_DECREMENT_1 : constant := 16#1#;
MPU6000_DETECT_DECREMENT_2 : constant := 16#2#;
MPU6000_DETECT_DECREMENT_4 : constant := 16#3#;
MPU6000_USERCTRL_DMP_EN_BIT : constant := 7;
MPU6000_USERCTRL_FIFO_EN_BIT : constant := 6;
MPU6000_USERCTRL_I2C_MST_EN_BIT : constant := 5;
MPU6000_USERCTRL_I2C_IF_DIS_BIT : constant := 4;
MPU6000_USERCTRL_DMP_RESET_BIT : constant := 3;
MPU6000_USERCTRL_FIFO_RESET_BIT : constant := 2;
MPU6000_USERCTRL_I2C_MST_RESET_BIT : constant := 1;
MPU6000_USERCTRL_SIG_COND_RESET_BIT : constant := 0;
MPU6000_PWR1_DEVICE_RESET_BIT : constant := 7;
MPU6000_PWR1_SLEEP_BIT : constant := 6;
MPU6000_PWR1_CYCLE_BIT : constant := 5;
MPU6000_PWR1_TEMP_DIS_BIT : constant := 3;
MPU6000_PWR1_CLKSEL_BIT : constant := 2;
MPU6000_PWR1_CLKSEL_LENGTH : constant := 3;
MPU6000_CLOCK_INTERNAL : constant := 16#00#;
MPU6000_CLOCK_PLL_XGYRO : constant := 16#01#;
MPU6000_CLOCK_PLL_YGYRO : constant := 16#02#;
MPU6000_CLOCK_PLL_ZGYRO : constant := 16#03#;
MPU6000_CLOCK_PLL_EXT32K : constant := 16#04#;
MPU6000_CLOCK_PLL_EXT19M : constant := 16#05#;
MPU6000_CLOCK_KEEP_RESET : constant := 16#07#;
MPU6000_PWR2_LP_WAKE_CTRL_BIT : constant := 7;
MPU6000_PWR2_LP_WAKE_CTRL_LENGTH : constant := 2;
MPU6000_PWR2_STBY_XA_BIT : constant := 5;
MPU6000_PWR2_STBY_YA_BIT : constant := 4;
MPU6000_PWR2_STBY_ZA_BIT : constant := 3;
MPU6000_PWR2_STBY_XG_BIT : constant := 2;
MPU6000_PWR2_STBY_YG_BIT : constant := 1;
MPU6000_PWR2_STBY_ZG_BIT : constant := 0;
MPU6000_WAKE_FREQ_1P25 : constant := 16#0#;
MPU6000_WAKE_FREQ_2P5 : constant := 16#1#;
MPU6000_WAKE_FREQ_5 : constant := 16#2#;
MPU6000_WAKE_FREQ_10 : constant := 16#3#;
MPU6000_BANKSEL_PRFTCH_EN_BIT : constant := 6;
MPU6000_BANKSEL_CFG_USER_BANK_BIT : constant := 5;
MPU6000_BANKSEL_MEM_SEL_BIT : constant := 4;
MPU6000_BANKSEL_MEM_SEL_LENGTH : constant := 5;
MPU6000_WHO_AM_I_BIT : constant := 6;
MPU6000_WHO_AM_I_LENGTH : constant := 6;
MPU6000_DMP_MEMORY_BANKS : constant := 8;
MPU6000_DMP_MEMORY_BANK_SIZE : constant := 256;
MPU6000_DMP_MEMORY_CHUNK_SIZE : constant := 16;
MPU6000_ST_GYRO_LOW : constant := (-14.0);
MPU6000_ST_GYRO_HIGH : constant := 14.0;
MPU6000_ST_ACCEL_LOW : constant := (-14.0);
MPU6000_ST_ACCEL_HIGH : constant := 14.0;
MPU6000_ST_TB : constant Unsigned_16_Array (1 .. 256)
:= (
2620, 2646, 2672, 2699, 2726, 2753, 2781, 2808,
2837, 2865, 2894, 2923, 2952, 2981, 3011, 3041,
3072, 3102, 3133, 3165, 3196, 3228, 3261, 3293,
3326, 3359, 3393, 3427, 3461, 3496, 3531, 3566,
3602, 3638, 3674, 3711, 3748, 3786, 3823, 3862,
3900, 3939, 3979, 4019, 4059, 4099, 4140, 4182,
4224, 4266, 4308, 4352, 4395, 4439, 4483, 4528,
4574, 4619, 4665, 4712, 4759, 4807, 4855, 4903,
4953, 5002, 5052, 5103, 5154, 5205, 5257, 5310,
5363, 5417, 5471, 5525, 5581, 5636, 5693, 5750,
5807, 5865, 5924, 5983, 6043, 6104, 6165, 6226,
6289, 6351, 6415, 6479, 6544, 6609, 6675, 6742,
6810, 6878, 6946, 7016, 7086, 7157, 7229, 7301,
7374, 7448, 7522, 7597, 7673, 7750, 7828, 7906,
7985, 8065, 8145, 8227, 8309, 8392, 8476, 8561,
8647, 8733, 8820, 8909, 8998, 9088, 9178, 9270,
9363, 9457, 9551, 9647, 9743, 9841, 9939, 10038,
10139, 10240, 10343, 10446, 10550, 10656, 10763, 10870,
10979, 11089, 11200, 11312, 11425, 11539, 11654, 11771,
11889, 12008, 12128, 12249, 12371, 12495, 12620, 12746,
12874, 13002, 13132, 13264, 13396, 13530, 13666, 13802,
13940, 14080, 14221, 14363, 14506, 14652, 14798, 14946,
15096, 15247, 15399, 15553, 15709, 15866, 16024, 16184,
16346, 16510, 16675, 16842, 17010, 17180, 17352, 17526,
17701, 17878, 18057, 18237, 18420, 18604, 18790, 18978,
19167, 19359, 19553, 19748, 19946, 20145, 20347, 20550,
20756, 20963, 21173, 21385, 21598, 21814, 22033, 22253,
22475, 22700, 22927, 23156, 23388, 23622, 23858, 24097,
24338, 24581, 24827, 25075, 25326, 25579, 25835, 26093,
26354, 26618, 26884, 27153, 27424, 27699, 27976, 28255,
28538, 28823, 29112, 29403, 29697, 29994, 30294, 30597,
30903, 31212, 31524, 31839, 32157, 32479, 32804, 33132
);
end MPU6000.Register;
|
with Opt28_Pkg; use Opt28_Pkg;
package body Opt28 is
function Full_Filename (Filename : String) return String is
Path : constant String := "PATH";
Posix_Path : constant Posix_String := To_Posix (Path);
begin
declare
M : constant Posix_String := Value_Of (Posix_Path);
N : constant Posix_String (1 .. M'Length) := M;
Var : constant String := To_String (Str => N);
Start_Pos : Natural := 1;
End_Pos : Natural := 1;
begin
while Start_Pos <= Var'Length loop
End_Pos := Position (Var (Start_Pos .. Var'Length));
if Is_File (To_Posix (Var (Start_Pos .. End_Pos - 1) & Filename)) then
return Var (Start_Pos .. End_Pos - 1) & Filename;
else
Start_Pos := End_Pos + 1;
end if;
end loop;
end;
return "";
end;
end Opt28;
|
-- Copyright (C) 2019 Thierry Rascle <thierr26@free.fr>
-- MIT license. Please refer to the LICENSE file.
package body Apsepp_Test_Suite is
----------------------------------------------------------------------------
overriding
function Child_Array (Obj : Apsepp_T_S) return Test_Node_Array
is (Test_Node_Class_E_T_C'Access,
Test_Reporter_Class_Struct_Builder_E_T_C'Access,
Scope_Bound_Locks_T_C'Access,
Shared_Instance_T_C'Access,
Scope_Debug_T_C'Access);
----------------------------------------------------------------------------
end Apsepp_Test_Suite;
|
with Ada.Calendar; use Ada.Calendar;
package Opt7 is
type time_t is (Absolute_Time, Delta_Time);
procedure Parse (Str : String;
Time_Type : out time_t;
Abs_Time : out Time;
Delt_Time : out Duration);
end Opt7;
|
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
-- 6 package Asis.Implementation
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
with Asis.Errors;
package Asis.Implementation is
pragma Preelaborate;
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
-- Asis.Implementation provides queries to initialize, finalize, and query the
-- error status of the ASIS Implementation.
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
-- 6.1 function ASIS_Version
-------------------------------------------------------------------------------
function ASIS_Version return Wide_String;
-------------------------------------------------------------------------------
-- 6.2 function ASIS_Implementor
-------------------------------------------------------------------------------
function ASIS_Implementor return Wide_String;
-------------------------------------------------------------------------------
-- 6.3 function ASIS_Implementor_Version
-------------------------------------------------------------------------------
function ASIS_Implementor_Version return Wide_String;
-------------------------------------------------------------------------------
-- 6.4 function ASIS_Implementor_Information
-------------------------------------------------------------------------------
function ASIS_Implementor_Information return Wide_String;
-------------------------------------------------------------------------------
-- Returns values which identify:
--
-- ASIS_Version the version of the ASIS interface, e.g., "2.1"
-- ASIS_Implementor the name of the implementor, e.g., "Ada Inc."
-- ASIS_Implementor_Version the implementation's version, e.g., "5.2a"
-- ASIS_Implementor_Information implementation information, e.g., "Copyright."
--
-------------------------------------------------------------------------------
-- 6.5 function Is_Initialized
-------------------------------------------------------------------------------
function Is_Initialized return Boolean;
-------------------------------------------------------------------------------
-- Returns True if ASIS is currently initialized.
--
-------------------------------------------------------------------------------
-- 6.6 procedure Initialize
-------------------------------------------------------------------------------
procedure Initialize (Parameters : in Wide_String := "");
-------------------------------------------------------------------------------
-- Parameters - Specifies implementation specific parameters.
--
-- Performs any necessary initialization activities. This shall be invoked
-- at least once before any other ASIS services are used. Parameter values
-- are implementation dependent. The call is ignored if ASIS is already
-- initialized. All ASIS queries and services are ready for use once this
-- call completes.
--
-- Raises ASIS_Failed if ASIS failed to initialize or if the Parameters
-- argument is invalid. Status is Environment_Error or Parameter_Error.
--
-- |AN Application Note:
-- |AN
-- |AN The ASIS implementation may be Initialized and Finalized any number of
-- |AN times during the operation of an ASIS program. However, all existing
-- |AN Context, Compilation_Unit and Element values become invalid when
-- |AN ASIS Is_Finalized. Subsequent calls to ASIS queries or services using
-- |AN such invalid Compilation_Unit or Element values will cause
-- |AN ASIS_Inappropriate_Context to be raised.
--
-------------------------------------------------------------------------------
-- 6.7 function Is_Finalized
-------------------------------------------------------------------------------
function Is_Finalized return Boolean;
-------------------------------------------------------------------------------
-- Returns True if ASIS is currently finalized or if ASIS has never been
-- initialized.
--
-------------------------------------------------------------------------------
-- 6.8 procedure Finalize
-------------------------------------------------------------------------------
procedure Finalize (Parameters : in Wide_String := "");
-------------------------------------------------------------------------------
-- Parameters - Specifies any implementation required parameter values.
--
-- Performs any necessary ASIS termination activities. This should be invoked
-- once following the last use of other ASIS queries. Parameter values are
-- implementation dependent. The call is ignored if ASIS is already
-- finalized. Subsequent calls to ASIS Environment, Compilation_Unit, and
-- Element queries, are erroneous while the environment Is_Finalized.
--
-- Raises ASIS_Failed if the ASIS implementation failed to finalize. Status
-- is likely to be Internal_Error and will not be Not_An_Error.
--
-------------------------------------------------------------------------------
-- Whenever an error condition is detected, and any ASIS exception is raised,
-- an Asis.Errors.Error_Kinds value and a Diagnosis string is stored. These
-- values can be retrieved by the Status and Diagnosis functions. The
-- Diagnosis function will retrieve the diagnostic message describing
-- the error.
--
-- Error information always refers to the most recently recorded error.
--
-- Note that Diagnosis values are implementation dependent and may vary
-- greatly among ASIS implementations.
--
-------------------------------------------------------------------------------
-- 6.9 function Status
-------------------------------------------------------------------------------
function Status return Asis.Errors.Error_Kinds;
-------------------------------------------------------------------------------
-- Returns the Error_Kinds value for the most recent error.
--
-------------------------------------------------------------------------------
-- 6.10 function Diagnosis
-------------------------------------------------------------------------------
function Diagnosis return Wide_String;
-------------------------------------------------------------------------------
-- Returns a string value describing the most recent error.
--
-- Will typically return a null string if Status = Not_An_Error.
--
-------------------------------------------------------------------------------
-- 6.11 procedure Set_Status
-------------------------------------------------------------------------------
procedure Set_Status
(Status : in Asis.Errors.Error_Kinds := Asis.Errors.Not_An_Error;
Diagnosis : in Wide_String := "");
-------------------------------------------------------------------------------
-- Status - Specifies the new status to be recorded
-- Diagnosis - Specifies the new diagnosis to be recorded
--
-- Sets (clears, if the defaults are used) the Status and Diagnosis
-- information. Future calls to Status will return this Status (Not_An_Error)
-- and this Diagnosis (a null string).
--
-- Raises ASIS_Failed, with a Status of Internal_Error and a Diagnosis of
-- a null string, if the Status parameter is Not_An_Error and the Diagnosis
-- parameter is not a null string.
--
-------------------------------------------------------------------------------
end Asis.Implementation;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
-- { dg-do run }
with Init12; use Init12;
with Text_IO; use Text_IO;
with Dump;
procedure Q12 is
A1 : Arr1 := My_A1;
A11 : Arr11 := My_A11;
A2 : Arr2 := My_A2;
A22 : Arr22 := My_A22;
begin
Put ("A1 :");
Dump (A1'Address, Arr1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A1 : 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" }
Put ("A11 :");
Dump (A11'Address, Arr11'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A11 : 12 00 ab 00 34 00 cd 00 12 00 ab 00 34 00 cd 00.*\n" }
Put ("A2 :");
Dump (A2'Address, Arr2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A2 : 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n" }
Put ("A22 :");
Dump (A22'Address, Arr22'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "A22 : 00 ab 00 12 00 cd 00 34 00 ab 00 12 00 cd 00 34.*\n" }
if A1(1) /= A11(1,1) then
raise Program_Error;
end if;
if A2(1) /= A22(1,1) then
raise Program_Error;
end if;
end;
|
procedure Show_Type_Invariant;
-- package Prout is
-- procedure Yolo (A : int; B : int);
-- end Prout;
|
-----------------------------------------------------------------------
-- awa-wikis-writers-html -- Wiki HTML writer
-- Copyright (C) 2011, 2012, 2013, 2015 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Wide_Wide_Unbounded;
with AWA.Wikis.Documents;
with ASF.Contexts.Writer;
package AWA.Wikis.Writers.Html is
use Ada.Strings.Wide_Wide_Unbounded;
-- ------------------------------
-- Wiki to HTML writer
-- ------------------------------
type Html_Writer is new AWA.Wikis.Documents.Document_Reader with private;
-- Set the output writer.
procedure Set_Writer (Document : in out Html_Writer;
Writer : in ASF.Contexts.Writer.Response_Writer_Access);
-- Add a section header in the document.
overriding
procedure Add_Header (Document : in out Html_Writer;
Header : in Unbounded_Wide_Wide_String;
Level : in Positive);
-- Add a line break (<br>).
overriding
procedure Add_Line_Break (Document : in out Html_Writer);
-- Add a paragraph (<p>). Close the previous paragraph if any.
-- The paragraph must be closed at the next paragraph or next header.
overriding
procedure Add_Paragraph (Document : in out Html_Writer);
-- Add a blockquote (<blockquote>). The level indicates the blockquote nested level.
-- The blockquote must be closed at the next header.
overriding
procedure Add_Blockquote (Document : in out Html_Writer;
Level : in Natural);
-- Add a list item (<li>). Close the previous paragraph and list item if any.
-- The list item will be closed at the next list item, next paragraph or next header.
overriding
procedure Add_List_Item (Document : in out Html_Writer;
Level : in Positive;
Ordered : in Boolean);
-- Add an horizontal rule (<hr>).
overriding
procedure Add_Horizontal_Rule (Document : in out Html_Writer);
-- Add a link.
overriding
procedure Add_Link (Document : in out Html_Writer;
Name : in Unbounded_Wide_Wide_String;
Link : in Unbounded_Wide_Wide_String;
Language : in Unbounded_Wide_Wide_String;
Title : in Unbounded_Wide_Wide_String);
-- Add an image.
overriding
procedure Add_Image (Document : in out Html_Writer;
Link : in Unbounded_Wide_Wide_String;
Alt : in Unbounded_Wide_Wide_String;
Position : in Unbounded_Wide_Wide_String;
Description : in Unbounded_Wide_Wide_String);
-- Add a quote.
overriding
procedure Add_Quote (Document : in out Html_Writer;
Quote : in Unbounded_Wide_Wide_String;
Link : in Unbounded_Wide_Wide_String;
Language : in Unbounded_Wide_Wide_String);
-- Add a text block with the given format.
overriding
procedure Add_Text (Document : in out Html_Writer;
Text : in Unbounded_Wide_Wide_String;
Format : in AWA.Wikis.Documents.Format_Map);
-- Add a text block that is pre-formatted.
procedure Add_Preformatted (Document : in out Html_Writer;
Text : in Unbounded_Wide_Wide_String;
Format : in Unbounded_Wide_Wide_String);
-- Finish the document after complete wiki text has been parsed.
overriding
procedure Finish (Document : in out Html_Writer);
private
procedure Close_Paragraph (Document : in out Html_Writer);
procedure Open_Paragraph (Document : in out Html_Writer);
type List_Style_Array is array (1 .. 32) of Boolean;
type Html_Writer is new AWA.Wikis.Documents.Document_Reader with record
Writer : ASF.Contexts.Writer.Response_Writer_Access := null;
Format : AWA.Wikis.Documents.Format_Map := (others => False);
Has_Paragraph : Boolean := False;
Need_Paragraph : Boolean := False;
Current_Level : Natural := 0;
List_Styles : List_Style_Array := (others => False);
Has_Item : Boolean := False;
Quote_Level : Natural := 0;
end record;
end AWA.Wikis.Writers.Html;
|
with Lumen.Binary;
package body Mandelbrot is
function Create_Image (Width, Height : Natural) return Lumen.Image.Descriptor is
use type Lumen.Binary.Byte;
Result : Lumen.Image.Descriptor;
X0, Y0 : Float;
X, Y, Xtemp : Float;
Iteration : Float;
Max_Iteration : constant Float := 1000.0;
Color : Lumen.Binary.Byte;
begin
Result.Width := Width;
Result.Height := Height;
Result.Complete := True;
Result.Values := new Lumen.Image.Pixel_Matrix (1 .. Width, 1 .. Height);
for Screen_X in 1 .. Width loop
for Screen_Y in 1 .. Height loop
X0 := -2.5 + (3.5 / Float (Width) * Float (Screen_X));
Y0 := -1.0 + (2.0 / Float (Height) * Float (Screen_Y));
X := 0.0;
Y := 0.0;
Iteration := 0.0;
while X * X + Y * Y <= 4.0 and then Iteration < Max_Iteration loop
Xtemp := X * X - Y * Y + X0;
Y := 2.0 * X * Y + Y0;
X := Xtemp;
Iteration := Iteration + 1.0;
end loop;
if Iteration = Max_Iteration then
Color := 255;
else
Color := 0;
end if;
Result.Values (Screen_X, Screen_Y) := (R => Color, G => Color, B => Color, A => 0);
end loop;
end loop;
return Result;
end Create_Image;
end Mandelbrot;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <denkpadje@gmail.com>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Ada.Unchecked_Conversion;
with Ada.Unchecked_Deallocation;
with GL.API;
with GL.Types;
package body GL.Fences is
overriding procedure Initialize (Object : in out Fence) is
begin
Object.Reference := new Sync_Object_Reference'(Sync_ID => 0,
Reference_Count => 1,
Status => Unset);
end Initialize;
overriding procedure Adjust (Object : in out Fence) is
begin
if Object.Reference /= null then
Object.Reference.Reference_Count := Object.Reference.Reference_Count + 1;
end if;
end Adjust;
overriding procedure Finalize (Object : in out Fence) is
use type Low_Level.Sync;
procedure Free is new Ada.Unchecked_Deallocation
(Object => Sync_Object_Reference, Name => Sync_Object_Reference_Access);
begin
if Object.Reference /= null then
Object.Reference.Reference_Count := Object.Reference.Reference_Count - 1;
if Object.Reference.Reference_Count = 0 then
if Object.Reference.Sync_ID /= 0 then
Fence'Class (Object).Delete;
end if;
Free (Object.Reference);
end if;
end if;
end Finalize;
procedure Set_Fence (Object : in out Fence) is
GPU_Commands_Complete : constant Low_Level.Enum := 16#9117#;
begin
if Object.Initialized then
Object.Delete;
end if;
Object.Reference.Sync_ID := API.Fence_Sync.Ref (GPU_Commands_Complete, 0);
Object.Reference.Status := (if Object.Initialized then Set else Unset);
end Set_Fence;
procedure Delete (Object : in out Fence) is
begin
API.Delete_Sync.Ref (Object.Reference.Sync_ID);
Object.Reference.Sync_ID := 0;
Object.Reference.Status := Unset;
end Delete;
function Initialized (Object : Fence) return Boolean is
use type Low_Level.Sync;
begin
return Object.Reference.Sync_ID /= 0;
end Initialized;
function Status (Object : Fence) return Signaled_Status is
(Object.Reference.Status);
function Signaled (Object : Fence) return Boolean is
use GL.Types;
Sync_Status : constant := 16#9114#;
type Signaled_Type is (Unsignaled, Signaled);
for Signaled_Type use
(Unsignaled => 16#9118#,
Signaled => 16#9119#);
for Signaled_Type'Size use Low_Level.Enum'Size;
function Convert is new Ada.Unchecked_Conversion
(Source => Int, Target => Signaled_Type);
begin
if Object.Status = Signaled then
return True;
end if;
declare
Value : constant Int_Array := API.Get_Sync.Ref
(Object.Reference.Sync_ID, Sync_Status, 1);
begin
return Convert (Value (1)) = Signaled;
end;
end Signaled;
function Client_Wait (Object : Fence; Timeout : Duration) return Wait_Status is
use GL.Types;
Flush_Commands_Bit : constant := 16#0000_0001#;
Timeout_Nanoseconds : constant UInt64 := UInt64 (Timeout * 1e9);
Result : Wait_Status;
begin
Result := API.Client_Wait_Sync.Ref
(Object.Reference.Sync_ID, Flush_Commands_Bit, Timeout_Nanoseconds);
if Result in Already_Signaled | Condition_Satisfied then
Object.Reference.Status := Signaled;
end if;
return Result;
end Client_Wait;
procedure Server_Wait (Object : Fence) is
Timeout_Ignored : constant := 16#FFF_FFFFF_FFFF_FFFF#;
begin
-- Flush the pipeline to ensure that the fence has been sent to the GPU
API.Flush.Ref.all;
API.Wait_Sync.Ref (Object.Reference.Sync_ID, 0, Timeout_Ignored);
end Server_Wait;
overriding
function "=" (Left, Right : Fence) return Boolean is
(Left.Reference = Right.Reference);
end GL.Fences;
|
-----------------------------------------------------------------------
-- AWA.Counters.Models -- AWA.Counters.Models
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-body.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 2017 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Util.Beans.Objects.Time;
with ASF.Events.Faces.Actions;
package body AWA.Counters.Models is
use type ADO.Objects.Object_Record_Access;
use type ADO.Objects.Object_Ref;
use type ADO.Objects.Object_Record;
pragma Warnings (Off, "formal parameter * is not referenced");
function Counter_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => COUNTER_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Counter_Key;
function Counter_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => COUNTER_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Counter_Key;
function "=" (Left, Right : Counter_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Counter_Ref'Class;
Impl : out Counter_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Counter_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Counter_Ref) is
Impl : Counter_Access;
begin
Impl := new Counter_Impl;
Impl.Object_Id := ADO.NO_IDENTIFIER;
Impl.Date := ADO.DEFAULT_TIME;
Impl.Counter := 0;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Counter
-- ----------------------------------------
procedure Set_Object_Id (Object : in out Counter_Ref;
Value : in ADO.Identifier) is
Impl : Counter_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Identifier (Impl.all, 1, Impl.Object_Id, Value);
end Set_Object_Id;
function Get_Object_Id (Object : in Counter_Ref)
return ADO.Identifier is
Impl : constant Counter_Access
:= Counter_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Object_Id;
end Get_Object_Id;
procedure Set_Date (Object : in out Counter_Ref;
Value : in Ada.Calendar.Time) is
Impl : Counter_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 2, Impl.Date, Value);
end Set_Date;
function Get_Date (Object : in Counter_Ref)
return Ada.Calendar.Time is
Impl : constant Counter_Access
:= Counter_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Date;
end Get_Date;
procedure Set_Counter (Object : in out Counter_Ref;
Value : in Integer) is
Impl : Counter_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 3, Impl.Counter, Value);
end Set_Counter;
function Get_Counter (Object : in Counter_Ref)
return Integer is
Impl : constant Counter_Access
:= Counter_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Counter;
end Get_Counter;
procedure Set_Definition_Id (Object : in out Counter_Ref;
Value : in ADO.Identifier) is
Impl : Counter_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 4, Value);
end Set_Definition_Id;
function Get_Definition_Id (Object : in Counter_Ref)
return ADO.Identifier is
Impl : constant Counter_Access
:= Counter_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Definition_Id;
-- Copy of the object.
procedure Copy (Object : in Counter_Ref;
Into : in out Counter_Ref) is
Result : Counter_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Counter_Access
:= Counter_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Counter_Access
:= new Counter_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Object_Id := Impl.Object_Id;
Copy.Date := Impl.Date;
Copy.Counter := Impl.Counter;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Counter_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Counter_Access := new Counter_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Counter_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Counter_Access := new Counter_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("definition_id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Counter_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Counter_Access := new Counter_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("definition_id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Counter_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Counter_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Counter_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Counter_Impl) is
type Counter_Impl_Ptr is access all Counter_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Counter_Impl, Counter_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Counter_Impl_Ptr := Counter_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Counter_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, COUNTER_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Counter_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("definition_id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Counter_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (COUNTER_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_1_NAME, -- object_id
Value => Object.Object_Id);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (2) then
Stmt.Save_Field (Name => COL_1_1_NAME, -- date
Value => Object.Date);
Object.Clear_Modified (2);
end if;
if Object.Is_Modified (3) then
Stmt.Save_Field (Name => COL_2_1_NAME, -- counter
Value => Object.Counter);
Object.Clear_Modified (3);
end if;
if Object.Is_Modified (4) then
Stmt.Save_Field (Name => COL_3_1_NAME, -- definition_id
Value => Object.Get_Key);
Object.Clear_Modified (4);
end if;
if Stmt.Has_Save_Fields then
Stmt.Set_Filter (Filter => "definition_id = ? AND object_id = ? AND date = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Add_Param (Value => Object.Object_Id);
Stmt.Add_Param (Value => Object.Date);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Counter_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (COUNTER_DEF'Access);
Result : Integer;
begin
Query.Save_Field (Name => COL_0_1_NAME, -- object_id
Value => Object.Object_Id);
Query.Save_Field (Name => COL_1_1_NAME, -- date
Value => Object.Date);
Query.Save_Field (Name => COL_2_1_NAME, -- counter
Value => Object.Counter);
Query.Save_Field (Name => COL_3_1_NAME, -- definition_id
Value => Object.Get_Key);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Counter_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (COUNTER_DEF'Access);
begin
Stmt.Set_Filter (Filter => "definition_id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Counter_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : ADO.Objects.Object_Record_Access;
Impl : access Counter_Impl;
begin
if From.Is_Null then
return Util.Beans.Objects.Null_Object;
end if;
Obj := From.Get_Load_Object;
Impl := Counter_Impl (Obj.all)'Access;
if Name = "object_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Object_Id));
elsif Name = "date" then
return Util.Beans.Objects.Time.To_Object (Impl.Date);
elsif Name = "counter" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Counter));
elsif Name = "definition_id" then
return ADO.Objects.To_Object (Impl.Get_Key);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Counter_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
begin
Object.Object_Id := Stmt.Get_Identifier (0);
Object.Date := Stmt.Get_Time (1);
Object.Counter := Stmt.Get_Integer (2);
Object.Set_Key_Value (Stmt.Get_Identifier (3));
ADO.Objects.Set_Created (Object);
end Load;
function Counter_Definition_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => COUNTER_DEFINITION_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Counter_Definition_Key;
function Counter_Definition_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => COUNTER_DEFINITION_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Counter_Definition_Key;
function "=" (Left, Right : Counter_Definition_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Counter_Definition_Ref'Class;
Impl : out Counter_Definition_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Counter_Definition_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Counter_Definition_Ref) is
Impl : Counter_Definition_Access;
begin
Impl := new Counter_Definition_Impl;
Impl.Entity_Type.Is_Null := True;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Counter_Definition
-- ----------------------------------------
procedure Set_Name (Object : in out Counter_Definition_Ref;
Value : in String) is
Impl : Counter_Definition_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_String (Impl.all, 1, Impl.Name, Value);
end Set_Name;
procedure Set_Name (Object : in out Counter_Definition_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String) is
Impl : Counter_Definition_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Unbounded_String (Impl.all, 1, Impl.Name, Value);
end Set_Name;
function Get_Name (Object : in Counter_Definition_Ref)
return String is
begin
return Ada.Strings.Unbounded.To_String (Object.Get_Name);
end Get_Name;
function Get_Name (Object : in Counter_Definition_Ref)
return Ada.Strings.Unbounded.Unbounded_String is
Impl : constant Counter_Definition_Access
:= Counter_Definition_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Name;
end Get_Name;
procedure Set_Id (Object : in out Counter_Definition_Ref;
Value : in ADO.Identifier) is
Impl : Counter_Definition_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 2, Value);
end Set_Id;
function Get_Id (Object : in Counter_Definition_Ref)
return ADO.Identifier is
Impl : constant Counter_Definition_Access
:= Counter_Definition_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Id;
procedure Set_Entity_Type (Object : in out Counter_Definition_Ref;
Value : in ADO.Nullable_Entity_Type) is
Impl : Counter_Definition_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Entity_Type (Impl.all, 3, Impl.Entity_Type, Value);
end Set_Entity_Type;
function Get_Entity_Type (Object : in Counter_Definition_Ref)
return ADO.Nullable_Entity_Type is
Impl : constant Counter_Definition_Access
:= Counter_Definition_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Entity_Type;
end Get_Entity_Type;
-- Copy of the object.
procedure Copy (Object : in Counter_Definition_Ref;
Into : in out Counter_Definition_Ref) is
Result : Counter_Definition_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Counter_Definition_Access
:= Counter_Definition_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Counter_Definition_Access
:= new Counter_Definition_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Name := Impl.Name;
Copy.Entity_Type := Impl.Entity_Type;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Counter_Definition_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Counter_Definition_Access := new Counter_Definition_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Counter_Definition_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Counter_Definition_Access := new Counter_Definition_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Counter_Definition_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Counter_Definition_Access := new Counter_Definition_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Counter_Definition_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Counter_Definition_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Counter_Definition_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Counter_Definition_Impl) is
type Counter_Definition_Impl_Ptr is access all Counter_Definition_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Counter_Definition_Impl, Counter_Definition_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Counter_Definition_Impl_Ptr := Counter_Definition_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Counter_Definition_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, COUNTER_DEFINITION_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Counter_Definition_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Counter_Definition_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (COUNTER_DEFINITION_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_2_NAME, -- name
Value => Object.Name);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (2) then
Stmt.Save_Field (Name => COL_1_2_NAME, -- id
Value => Object.Get_Key);
Object.Clear_Modified (2);
end if;
if Object.Is_Modified (3) then
Stmt.Save_Field (Name => COL_2_2_NAME, -- entity_type
Value => Object.Entity_Type);
Object.Clear_Modified (3);
end if;
if Stmt.Has_Save_Fields then
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Counter_Definition_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (COUNTER_DEFINITION_DEF'Access);
Result : Integer;
begin
Query.Save_Field (Name => COL_0_2_NAME, -- name
Value => Object.Name);
Session.Allocate (Id => Object);
Query.Save_Field (Name => COL_1_2_NAME, -- id
Value => Object.Get_Key);
Query.Save_Field (Name => COL_2_2_NAME, -- entity_type
Value => Object.Entity_Type);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Counter_Definition_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (COUNTER_DEFINITION_DEF'Access);
begin
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Counter_Definition_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : ADO.Objects.Object_Record_Access;
Impl : access Counter_Definition_Impl;
begin
if From.Is_Null then
return Util.Beans.Objects.Null_Object;
end if;
Obj := From.Get_Load_Object;
Impl := Counter_Definition_Impl (Obj.all)'Access;
if Name = "name" then
return Util.Beans.Objects.To_Object (Impl.Name);
elsif Name = "id" then
return ADO.Objects.To_Object (Impl.Get_Key);
elsif Name = "entity_type" then
if Impl.Entity_Type.Is_Null then
return Util.Beans.Objects.Null_Object;
else
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Entity_Type.Value));
end if;
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Counter_Definition_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
begin
Object.Name := Stmt.Get_Unbounded_String (0);
Object.Set_Key_Value (Stmt.Get_Identifier (1));
Object.Entity_Type := Stmt.Get_Nullable_Entity_Type (2);
ADO.Objects.Set_Created (Object);
end Load;
function Visit_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => VISIT_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Visit_Key;
function Visit_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => VISIT_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Visit_Key;
function "=" (Left, Right : Visit_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Visit_Ref'Class;
Impl : out Visit_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Visit_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Visit_Ref) is
Impl : Visit_Access;
begin
Impl := new Visit_Impl;
Impl.Object_Id := ADO.NO_IDENTIFIER;
Impl.Counter := 0;
Impl.Date := ADO.DEFAULT_TIME;
Impl.User := ADO.NO_IDENTIFIER;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Visit
-- ----------------------------------------
procedure Set_Object_Id (Object : in out Visit_Ref;
Value : in ADO.Identifier) is
Impl : Visit_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Identifier (Impl.all, 1, Impl.Object_Id, Value);
end Set_Object_Id;
function Get_Object_Id (Object : in Visit_Ref)
return ADO.Identifier is
Impl : constant Visit_Access
:= Visit_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Object_Id;
end Get_Object_Id;
procedure Set_Counter (Object : in out Visit_Ref;
Value : in Integer) is
Impl : Visit_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 2, Impl.Counter, Value);
end Set_Counter;
function Get_Counter (Object : in Visit_Ref)
return Integer is
Impl : constant Visit_Access
:= Visit_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Counter;
end Get_Counter;
procedure Set_Date (Object : in out Visit_Ref;
Value : in Ada.Calendar.Time) is
Impl : Visit_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 3, Impl.Date, Value);
end Set_Date;
function Get_Date (Object : in Visit_Ref)
return Ada.Calendar.Time is
Impl : constant Visit_Access
:= Visit_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Date;
end Get_Date;
procedure Set_User (Object : in out Visit_Ref;
Value : in ADO.Identifier) is
Impl : Visit_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Identifier (Impl.all, 4, Impl.User, Value);
end Set_User;
function Get_User (Object : in Visit_Ref)
return ADO.Identifier is
Impl : constant Visit_Access
:= Visit_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.User;
end Get_User;
procedure Set_Definition_Id (Object : in out Visit_Ref;
Value : in ADO.Identifier) is
Impl : Visit_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 5, Value);
end Set_Definition_Id;
function Get_Definition_Id (Object : in Visit_Ref)
return ADO.Identifier is
Impl : constant Visit_Access
:= Visit_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Definition_Id;
-- Copy of the object.
procedure Copy (Object : in Visit_Ref;
Into : in out Visit_Ref) is
Result : Visit_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Visit_Access
:= Visit_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Visit_Access
:= new Visit_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Object_Id := Impl.Object_Id;
Copy.Counter := Impl.Counter;
Copy.Date := Impl.Date;
Copy.User := Impl.User;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Visit_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Visit_Access := new Visit_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Visit_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Visit_Access := new Visit_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("definition_id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Visit_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Visit_Access := new Visit_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("definition_id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Visit_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Visit_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Visit_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Visit_Impl) is
type Visit_Impl_Ptr is access all Visit_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Visit_Impl, Visit_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Visit_Impl_Ptr := Visit_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Visit_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, VISIT_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Visit_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("definition_id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Visit_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (VISIT_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_3_NAME, -- object_id
Value => Object.Object_Id);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (2) then
Stmt.Save_Field (Name => COL_1_3_NAME, -- counter
Value => Object.Counter);
Object.Clear_Modified (2);
end if;
if Object.Is_Modified (3) then
Stmt.Save_Field (Name => COL_2_3_NAME, -- date
Value => Object.Date);
Object.Clear_Modified (3);
end if;
if Object.Is_Modified (4) then
Stmt.Save_Field (Name => COL_3_3_NAME, -- user
Value => Object.User);
Object.Clear_Modified (4);
end if;
if Object.Is_Modified (5) then
Stmt.Save_Field (Name => COL_4_3_NAME, -- definition_id
Value => Object.Get_Key);
Object.Clear_Modified (5);
end if;
if Stmt.Has_Save_Fields then
Stmt.Set_Filter (Filter => "definition_id = ? AND object_id = ? AND user = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Add_Param (Value => Object.Object_Id);
Stmt.Add_Param (Value => Object.User);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Visit_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (VISIT_DEF'Access);
Result : Integer;
begin
Query.Save_Field (Name => COL_0_3_NAME, -- object_id
Value => Object.Object_Id);
Query.Save_Field (Name => COL_1_3_NAME, -- counter
Value => Object.Counter);
Query.Save_Field (Name => COL_2_3_NAME, -- date
Value => Object.Date);
Query.Save_Field (Name => COL_3_3_NAME, -- user
Value => Object.User);
Query.Save_Field (Name => COL_4_3_NAME, -- definition_id
Value => Object.Get_Key);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Visit_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (VISIT_DEF'Access);
begin
Stmt.Set_Filter (Filter => "definition_id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Visit_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : ADO.Objects.Object_Record_Access;
Impl : access Visit_Impl;
begin
if From.Is_Null then
return Util.Beans.Objects.Null_Object;
end if;
Obj := From.Get_Load_Object;
Impl := Visit_Impl (Obj.all)'Access;
if Name = "object_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Object_Id));
elsif Name = "counter" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Counter));
elsif Name = "date" then
return Util.Beans.Objects.Time.To_Object (Impl.Date);
elsif Name = "user" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.User));
elsif Name = "definition_id" then
return ADO.Objects.To_Object (Impl.Get_Key);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
procedure List (Object : in out Visit_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, VISIT_DEF'Access);
begin
Stmt.Execute;
Visit_Vectors.Clear (Object);
while Stmt.Has_Elements loop
declare
Item : Visit_Ref;
Impl : constant Visit_Access := new Visit_Impl;
begin
Impl.Load (Stmt, Session);
ADO.Objects.Set_Object (Item, Impl.all'Access);
Object.Append (Item);
end;
Stmt.Next;
end loop;
end List;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Visit_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
begin
Object.Object_Id := Stmt.Get_Identifier (0);
Object.Counter := Stmt.Get_Integer (1);
Object.Date := Stmt.Get_Time (2);
Object.User := Stmt.Get_Identifier (3);
Object.Set_Key_Value (Stmt.Get_Identifier (4));
ADO.Objects.Set_Created (Object);
end Load;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Stat_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "date" then
return Util.Beans.Objects.Time.To_Object (From.Date);
elsif Name = "count" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Count));
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Stat_Info;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "date" then
Item.Date := Util.Beans.Objects.Time.To_Time (Value);
elsif Name = "count" then
Item.Count := Util.Beans.Objects.To_Integer (Value);
end if;
end Set_Value;
-- --------------------
-- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>.
-- --------------------
procedure List (Object : in out Stat_Info_List_Bean'Class;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class) is
begin
List (Object.List, Session, Context);
end List;
-- --------------------
-- The month statistics.
-- --------------------
procedure List (Object : in out Stat_Info_Vector;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class) is
procedure Read (Into : in out Stat_Info);
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Context);
Pos : Natural := 0;
procedure Read (Into : in out Stat_Info) is
begin
Into.Date := Stmt.Get_Time (0);
Into.Count := Stmt.Get_Natural (1);
end Read;
begin
Stmt.Execute;
Stat_Info_Vectors.Clear (Object);
while Stmt.Has_Elements loop
Object.Insert_Space (Before => Pos);
Object.Update_Element (Index => Pos, Process => Read'Access);
Pos := Pos + 1;
Stmt.Next;
end loop;
end List;
procedure Op_Load (Bean : in out Stat_List_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Load (Bean : in out Stat_List_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Stat_List_Bean'Class (Bean).Load (Outcome);
end Op_Load;
package Binding_Stat_List_Bean_1 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Stat_List_Bean,
Method => Op_Load,
Name => "load");
Binding_Stat_List_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Binding_Stat_List_Bean_1.Proxy'Access
);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression.
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Stat_List_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Stat_List_Bean_Array'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Stat_List_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "entity_type" then
return Util.Beans.Objects.To_Object (From.Entity_Type);
elsif Name = "first_date" then
return Util.Beans.Objects.To_Object (From.First_Date);
elsif Name = "last_date" then
return Util.Beans.Objects.To_Object (From.Last_Date);
elsif Name = "entity_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Entity_Id));
elsif Name = "counter_name" then
return Util.Beans.Objects.To_Object (From.Counter_Name);
elsif Name = "query_name" then
return Util.Beans.Objects.To_Object (From.Query_Name);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Stat_List_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "entity_type" then
Item.Entity_Type := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "first_date" then
Item.First_Date := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "last_date" then
Item.Last_Date := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "entity_id" then
Item.Entity_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value));
elsif Name = "counter_name" then
Item.Counter_Name := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "query_name" then
Item.Query_Name := Util.Beans.Objects.To_Unbounded_String (Value);
end if;
end Set_Value;
end AWA.Counters.Models;
|
with
JSA.Tests.Intermediate_Backups;
package body JSA.Tests is
function Suite return Ahven.Framework.Test_Suite is
use Ahven.Framework;
Intermediate_Backup_Test : JSA.Tests.Intermediate_Backups.Test;
begin
return Suite : Test_Suite := Create_Suite ("JSA") do
Add_Static_Test (Suite, Intermediate_Backup_Test);
end return;
end Suite;
end JSA.Tests;
|
------------------------------------------------------------------------------
-- --
-- Internet Protocol Suite Package --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This package contains the os-specific layout of the "addrinfo" (netdb.h)
-- structure
-- This is the "BSD" version, where ai_addr follows ai_canonname.
-- This applies to FreeBSD, NetBSD and Solaris (Illumos)
--
-- Note that this format is still technicalls POSIX complient, since
-- POSIX does not actually specify the ordering of the members of
-- struct addrinfo. The naming here is really to reflect the (probably)
-- historial reasons for these two different orderings
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with System.Storage_Elements;
with INET.Internal.OS_Constants;
private package INET.IP.OS_Address_Info is
subtype socklen_t is Internal.OS_Constants.socklen_t;
Null_Chars_Ptr: Strings.chars_ptr renames Strings.Null_Ptr;
type Void_Pointer is access System.Storage_Elements.Storage_Element with
Storage_Size => 0, Convention => C;
type struct_addrinfo;
type addrinfo_ptr is access struct_addrinfo with
Storage_Size => 0, Convention => C;
-- struct addrinfo - getaddrinfo(3) (POSIX) <netdb.h>
type struct_addrinfo is
record
ai_flags : int := 0;
ai_family : int := 0;
ai_socktype : int := 0;
ai_protocol : int := 0;
ai_addrlen : socklen_t := 0;
ai_canonname: Strings.chars_ptr := Null_Chars_Ptr;
ai_addr : Void_Pointer := null;
ai_next : addrinfo_ptr := null;
end record
with Convention => C;
end INET.IP.OS_Address_Info;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure TicTac is
task Count is
entry Start;
entry Stop;
entry Reset;
end Count;
task body Count is
Counter : Natural := 0;
Is_Counting : Boolean := FALSE;
begin
loop
select
when Is_Counting =>
accept Stop do
Is_Counting := FALSE;
end Stop;
-- accept Start do
-- Put_Line ("What?");
-- end Start;
or
when not Is_Counting =>
accept Start do
Is_Counting := TRUE;
end Start;
or
accept Reset do
Put_Line ("RESET");
Counter := 0;
end Reset;
else
if Is_Counting then
Put_Line (Integer'Image (Counter) & ", counting...");
delay 1.0;
Counter := Counter + 1;
end if;
end select;
end loop;
end Count;
begin
Count.Start;
delay 5.5;
Put_Line ("5.5!");
delay 1.5;
Count.Stop;
Put_Line ("Stop");
delay 3.0;
Count.Start;
Put_Line ("Start");
delay 2.5;
Count.Reset;
delay 1.5;
Put_Line ("Start again while counting...?");
Count.Start; -- hang here!
-- never reached
Put_Line ("Restarted?");
delay 3.0;
Put_Line ("End of Main");
end TicTac;
|
-- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Strings.Wide_Wide_Maps;
package Ada.Strings.Wide_Wide_Fixed is
pragma Preelaborate (Wide_Wide_Fixed);
-- "Copy" procedure for strings of possibly different lengths
procedure Move (Source : in Wide_Wide_String;
Target : out Wide_Wide_String;
Drop : in Truncation := Error;
Justify : in Alignment := Left;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
-- Search subprograms
function Index (Source : in Wide_Wide_String;
Pattern : in Wide_Wide_String;
From : in Positive;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping
:= Wide_Wide_Maps.Identity)
return Natural;
function Index
(Source : in Wide_Wide_String;
Pattern : in Wide_Wide_String;
From : in Positive;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Index (Source : in Wide_Wide_String;
Pattern : in Wide_Wide_String;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping
:= Wide_Wide_Maps.Identity)
return Natural;
function Index
(Source : in Wide_Wide_String;
Pattern : in Wide_Wide_String;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Index (Source : in Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set;
From : in Positive;
Test : in Membership := Inside;
Going : in Direction := Forward)
return Natural;
function Index (Source : in Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : in Membership := Inside;
Going : in Direction := Forward)
return Natural;
function Index_Non_Blank (Source : in Wide_Wide_String;
From : in Positive;
Going : in Direction := Forward)
return Natural;
function Index_Non_Blank (Source : in Wide_Wide_String;
Going : in Direction := Forward)
return Natural;
function Count (Source : in Wide_Wide_String;
Pattern : in Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping
:= Wide_Wide_Maps.Identity)
return Natural;
function Count
(Source : in Wide_Wide_String;
Pattern : in Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Count (Source : in Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set)
return Natural;
procedure Find_Token (Source : in Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : in Membership;
First : out Positive;
Last : out Natural);
-- Wide_Wide_String translation subprograms
function Translate
(Source : in Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping)
return Wide_Wide_String;
procedure Translate
(Source : in out Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping);
function Translate
(Source : in Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Wide_Wide_String;
procedure Translate
(Source : in out Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function);
-- Wide_Wide_String transformation subprograms
function Replace_Slice (Source : in Wide_Wide_String;
Low : in Positive;
High : in Natural;
By : in Wide_Wide_String)
return Wide_Wide_String;
procedure Replace_Slice (Source : in out Wide_Wide_String;
Low : in Positive;
High : in Natural;
By : in Wide_Wide_String;
Drop : in Truncation := Error;
Justify : in Alignment := Left;
Pad : in Wide_Wide_Character
:= Wide_Wide_Space);
function Insert (Source : in Wide_Wide_String;
Before : in Positive;
New_Item : in Wide_Wide_String)
return Wide_Wide_String;
procedure Insert (Source : in out Wide_Wide_String;
Before : in Positive;
New_Item : in Wide_Wide_String;
Drop : in Truncation := Error);
function Overwrite (Source : in Wide_Wide_String;
Position : in Positive;
New_Item : in Wide_Wide_String)
return Wide_Wide_String;
procedure Overwrite (Source : in out Wide_Wide_String;
Position : in Positive;
New_Item : in Wide_Wide_String;
Drop : in Truncation := Right);
function Delete (Source : in Wide_Wide_String;
From : in Positive;
Through : in Natural)
return Wide_Wide_String;
procedure Delete (Source : in out Wide_Wide_String;
From : in Positive;
Through : in Natural;
Justify : in Alignment := Left;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
-- Wide_Wide_String selector subprograms
function Trim (Source : in Wide_Wide_String;
Side : in Trim_End)
return Wide_Wide_String;
procedure Trim (Source : in out Wide_Wide_String;
Side : in Trim_End;
Justify : in Alignment := Left;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
function Trim (Source : in Wide_Wide_String;
Left : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : in Wide_Wide_Maps.Wide_Wide_Character_Set)
return Wide_Wide_String;
procedure Trim (Source : in out Wide_Wide_String;
Left : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Justify : in Alignment := Strings.Left;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
function Head (Source : in Wide_Wide_String;
Count : in Natural;
Pad : in Wide_Wide_Character := Wide_Wide_Space)
return Wide_Wide_String;
procedure Head (Source : in out Wide_Wide_String;
Count : in Natural;
Justify : in Alignment := Left;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
function Tail (Source : in Wide_Wide_String;
Count : in Natural;
Pad : in Wide_Wide_Character := Wide_Wide_Space)
return Wide_Wide_String;
procedure Tail (Source : in out Wide_Wide_String;
Count : in Natural;
Justify : in Alignment := Left;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
-- Wide_Wide_String constructor functions
function "*" (Left : in Natural;
Right : in Wide_Wide_Character) return Wide_Wide_String;
function "*" (Left : in Natural;
Right : in Wide_Wide_String) return Wide_Wide_String;
end Ada.Strings.Wide_Wide_Fixed;
|
-- SPDX-License-Identifier: MIT
--
-- Copyright (c) 2000 - 2018 Gautier de Montmollin
-- SWITZERLAND
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-- THE SOFTWARE.
-- Zip.Headers
-- -----------
--
-- This package provides:
--
-- * Definition of PKZIP information structures (cf appnote.txt)
-- * Reading a header from a data stream (Read_and_check)
-- * Copying a header from a buffer (Copy_and_check)
-- * Writing a header to a data stream (Write)
--
-- Some quick explanations about the Zip file structure - GdM 2001, 2012
--
-- The zip archive containing N entries can be roughly seen as
-- a data stream with the following structure:
--
-- 1) {local header, then compressed data} - that, N times
-- 2) central directory, with a summary of each of the N entries
-- 3) end-of-central-directory, with a summary of the central directory
--
-- Since N is not necessarily known before or during the phase 1,
-- the central directory's size is also potentially unknown.
-- Then obvious place for the central directory is *after* the data,
-- it is why it appears on phase 2.
--
-- An advantage of that structure is that the .ZIP archive can be later
-- appended to an .exe, for self-extracting purposes, or to other
-- kind of files.
--
-- So, the most general infos are at the end, and we crawl back
-- for more precise infos:
--
-- 1) end-of-central-directory
-- 2) central directory
-- 3) zipped data entries
with DCF.Streams;
use DCF.Streams;
package DCF.Zip.Headers is
pragma Preelaborate;
------------------------------------------------------------------------
-- PKZIP data descriptor, put after streamed compressed data - PK78 --
------------------------------------------------------------------------
type Data_Descriptor is record
-- PK78 -- 1.. 4
Crc_32 : Unsigned_32; -- 5.. 8
Compressed_Size : Unsigned_32;
Uncompressed_Size : Unsigned_32;
end record;
Data_Descriptor_Length : constant := 16;
-- This header needs to be read in continuation of
-- the compressed data -> access to a buffer
procedure Copy_And_Check
(Buffer : in Ada.Streams.Stream_Element_Array;
Descriptor : out Data_Descriptor);
procedure Read_And_Check
(Stream : in out Root_Zipstream_Type'Class;
Descriptor : out Data_Descriptor);
Bad_Data_Descriptor : exception;
procedure Write
(Stream : in out Root_Zipstream_Type'Class;
Descriptor : in Data_Descriptor);
-----------------------------------------------------------------------
-- PKZIP local file header, in front of every file in archive - PK34 --
-----------------------------------------------------------------------
-- Appnote: 4.4.4 general purpose bit flag: (2 bytes)
--
-- Bit 0: If set, indicates that the file is encrypted.
Encryption_Flag_Bit : constant := 2**0;
-- Bit 3: If set, indicates data is followed by a data descriptor
-- See 4.3.9 of appnote
Descriptor_Flag_Bit : constant := 2**3;
-- Bit 11: Language encoding flag (EFS). If this bit is set, the filename and
-- comment fields for this file MUST be encoded using UTF-8.
Language_Encoding_Flag_Bit : constant := 2**11;
type Local_File_Header is record
-- PK34 -- 1.. 4
Needed_Extract_Version : Unsigned_16; -- 5.. 6
Bit_Flag : Unsigned_16; -- Appnote: 4.4.4 general purpose bit flag
Zip_Type : Unsigned_16;
File_Timedate : Time;
Dd : Data_Descriptor;
Filename_Length : Unsigned_16;
Extra_Field_Length : Unsigned_16;
end record;
Local_Header_Length : constant := 30;
procedure Read_And_Check
(Stream : in out Root_Zipstream_Type'Class;
Header : out Local_File_Header);
Bad_Local_Header : exception;
procedure Write
(Stream : in out Root_Zipstream_Type'Class;
Header : in Local_File_Header);
-------------------------------------------------------
-- PKZIP file header, as in central directory - PK12 --
-------------------------------------------------------
-- NB: a central header contains a local header in the middle
type Central_File_Header is record
-- PK12 -- 1 .. 4
Made_By_Version : Unsigned_16; -- 5 .. 6
Short_Info : Local_File_Header; -- 7 .. 32
Comment_Length : Unsigned_16; -- 33 .. 34
Disk_Number_Start : Unsigned_16;
Internal_Attributes : Unsigned_16; -- Internal properties of data
External_Attributes : Unsigned_32; -- First byte if MS-DOS: see below
Local_Header_Offset : Unsigned_32;
end record;
-- MS-DOS external attributes:
--
-- Bit 0 Read-Only
-- Bit 1 Hidden
-- Bit 2 System
-- Bit 3 Volume Label
-- Bit 4 Directory
-- Bit 5 Archive
Central_Header_Length : constant := 46;
procedure Read_And_Check
(Stream : in out Root_Zipstream_Type'Class;
Header : out Central_File_Header);
function Valid_Version (Header : Local_File_Header) return Boolean is
(Header.Needed_Extract_Version <= 45);
function Valid_Bitflag (Header : Local_File_Header) return Boolean is
((Header.Bit_Flag and 2#1111_0111_1111_0001#) = 0);
Bad_Central_Header : exception;
procedure Write (Stream : in out Root_Zipstream_Type'Class; Header : in Central_File_Header);
---------------------------------------------
-- PKZIP end-of-central-directory - PK56 --
---------------------------------------------
type End_Of_Central_Dir is record
-- PK56 -- 1 .. 4
Disknum : Unsigned_16; -- 5 .. 6
Disknum_With_Start : Unsigned_16;
Disk_Total_Entries : Unsigned_16;
Total_Entries : Unsigned_16;
Central_Dir_Size : Unsigned_32;
Central_Dir_Offset : Unsigned_32;
Main_Comment_Length : Unsigned_16;
-- The Zip archive may be appended to another file (for instance an
-- executable for self-extracting purposes) of size N.
-- Then, all offsets need to be shifted by N.
-- N=0 if the Zip archive is on its own.
-- The real offset of the end-of-central-dir
-- will be N + central_dir_size + central_dir_offset.
-- This way, we have an unique chance to determine N when reading the
-- end-of-central-dir. N is stored in the field hereafter:
Offset_Shifting : Zs_Size_Type; -- NB: type is at least 32 bits.
end record;
End_Of_Central_Dir_Length : constant := 22;
-- The End-of-Central-Dir header is followed by a comment of
-- unkown size and hence needs to be searched in special ways (see Load).
-- Copy_and_check and Read_and_check assume a buffer or a stream
-- pointing to the End-of-Central-Dir signature
procedure Copy_And_Check
(Buffer : in Ada.Streams.Stream_Element_Array;
The_End : out End_Of_Central_Dir);
procedure Read_And_Check
(Stream : in out Root_Zipstream_Type'Class;
The_End : out End_Of_Central_Dir);
Bad_End : exception;
-- A bit more elaborated variant: find the End-of-Central-Dir and load it
procedure Load
(Stream : in out Root_Zipstream_Type'Class;
The_End : out End_Of_Central_Dir);
procedure Write
(Stream : in out Root_Zipstream_Type'Class;
The_End : in End_Of_Central_Dir);
end DCF.Zip.Headers;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Nodes.Generic_Vectors;
with Program.Elements.Parameter_Associations;
package Program.Nodes.Parameter_Association_Vectors is new
Program.Nodes.Generic_Vectors
(Program.Elements.Parameter_Associations.Parameter_Association_Vector);
pragma Preelaborate (Program.Nodes.Parameter_Association_Vectors);
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Float_Text_IO; use Ada.Float_Text_IO;
with Sf.Config; use Sf.Config;
with Sf.System.Sleep; use Sf.System.Sleep;
with Sf.Audio.Types; use Sf.Audio.Types;
with Sf.Audio.Music; use Sf.Audio.Music;
with Sf.Audio.SoundStatus; use Sf.Audio.SoundStatus;
procedure Main is
Music : sfMusic_Ptr;
Duration : Float;
ChCount : sfUint32;
SampRate : sfUint32;
begin
Music := sfMusic_CreateFromFile ("music.ogg");
if Music = null then
Put_Line ("Music file not found!");
return;
end if;
sfMusic_SetLoop (Music, sfFalse);
sfMusic_SetPitch (Music, 1.0);
sfMusic_SetVolume (Music, 100.0);
Duration := sfMusic_GetDuration (Music);
ChCount := sfMusic_GetChannelsCount (Music);
SampRate := sfMusic_GetSampleRate (Music);
Put ("Duration : ");
Put (Duration, 0, 3, 0);
Put (" seconds");
New_Line;
Put ("Channels count : ");
Put (Integer (ChCount), 0);
Put (" channels");
New_Line;
Put ("Sample rate : ");
Put (Integer (SampRate), 0);
Put (" channels/second");
New_Line;
sfMusic_Play (Music);
while sfMusic_GetStatus (Music) = sfPlaying loop
sfSleep (0.001);
end loop;
sfMusic_Destroy (Music);
end Main;
|
------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (gh+spat@heisenbug.eu)
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
------------------------------------------------------------------------------
pragma License (Unrestricted);
------------------------------------------------------------------------------
--
-- SPARK Proof Analysis Tool
--
-- S.P.A.T. - Command line parser
--
------------------------------------------------------------------------------
with GNATCOLL.Opt_Parse;
with SPAT.Spark_Info;
package SPAT.Command_Line is
-- Report filter mode.
-- Show all, show failed only, show unproved, show unjustified.
-- Later ones imply earlier ones.
type Report_Mode is (All_Proofs, Failed, Unproved, Unjustified, None);
Parser : GNATCOLL.Opt_Parse.Argument_Parser :=
GNATCOLL.Opt_Parse.Create_Argument_Parser
(Help => "Parses .spark files and outputs information about them.",
Command_Name => "run_spat");
-- Before using the below functions you should have called Parser.Parse and
-- evaluated its return status.
---------------------------------------------------------------------------
-- Convert
---------------------------------------------------------------------------
function Convert
(Value : in String) return SPAT.Spark_Info.Sorting_Criterion;
---------------------------------------------------------------------------
-- Convert
---------------------------------------------------------------------------
function Convert (Value : in String) return Report_Mode;
---------------------------------------------------------------------------
-- Convert
---------------------------------------------------------------------------
function Convert (Value : in String) return SPAT.Spark_Info.Sorting_Criterion
is
(if Value = "a" then SPAT.Spark_Info.Name
elsif Value = "t" then SPAT.Spark_Info.Time
else (raise GNATCOLL.Opt_Parse.Opt_Parse_Error with
"unknown parameter """ & Value & """"));
---------------------------------------------------------------------------
-- Convert
---------------------------------------------------------------------------
function Convert (Value : in String) return Report_Mode is
(if Value in "all" | "a" then All_Proofs
elsif Value in "failed" | "f" then Failed
elsif Value in "unproved" | "u" then Unproved
elsif Value in "unjustified" | "j" then Unjustified
else (raise GNATCOLL.Opt_Parse.Opt_Parse_Error with
"unknown parameter """ & Value & """"));
-- Command line options (in order of importance/mode).
-- Project file (mandatory).
package Project is new
GNATCOLL.Opt_Parse.Parse_Option
(Parser => Parser,
Short => "-P",
Long => "--project",
Help => "PROJECT = GNAT project file (.gpr) (mandatory!)",
Arg_Type => SPAT.Subject_Name,
Default_Val => SPAT.Null_Name,
Convert => SPAT.To_Name);
-- Summary mode.
package Summary is new
GNATCOLL.Opt_Parse.Parse_Flag (Parser => Parser,
Short => "-s",
Long => "--summary",
Help => "List summary (per file)");
-- Report mode.
package Report is new
-- Any of the list modes.
GNATCOLL.Opt_Parse.Parse_Option
(Parser => Parser,
Short => "-r",
Long => "--report-mode",
Help => "Report output (REPORT-MODE: a = all, f = failed, u = unproved, j = unjustified)",
Arg_Type => Report_Mode,
Convert => Convert,
Default_Val => None);
-- Valid for summary and list mode.
package Sort_By is new
GNATCOLL.Opt_Parse.Parse_Option
(Parser => Parser,
Short => "-c",
Long => "--sort-by",
Help => "Sort output (SORT-BY: a = alphabetical, t = by time)",
Arg_Type => SPAT.Spark_Info.Sorting_Criterion,
Convert => Convert,
Default_Val => SPAT.Spark_Info.None);
package Details is new
GNATCOLL.Opt_Parse.Parse_Flag (Parser => Parser,
Short => "-d",
Long => "--details",
Help => "Show details for entities (list mode)");
package Version is new
GNATCOLL.Opt_Parse.Parse_Flag
(Parser => Parser,
Short => "-V",
Long => "--version",
Help => "Show version information and exit");
end SPAT.Command_Line;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Slim.Message_Visiters;
with Ada.Numerics.Elementary_Functions;
package body Slim.Messages.audg is
List : constant Field_Description_Array :=
((Uint_32_Field, 1), -- old_left
(Uint_32_Field, 1), -- old_right
(Uint_8_Field, 1), -- Digital volume control 0/1
(Uint_8_Field, 1), -- Preamp (byte 255-0)
(Uint_32_Field, 1), -- new_left is 16.16 fixed point
(Uint_32_Field, 1), -- new_right is 16.16 fixed point
(Uint_32_Field, 1)); -- sequence
----------
-- Read --
----------
overriding function Read
(Data : not null access
League.Stream_Element_Vectors.Stream_Element_Vector)
return Audg_Message is
begin
return Result : Audg_Message do
Read_Fields (Result, List, Data.all);
end return;
end Read;
----------------
-- Set_Volume --
----------------
not overriding procedure Set_Volume
(Self : in out Audg_Message;
Value : Volume)
is
use Ada.Numerics.Elementary_Functions;
use type Interfaces.Unsigned_32;
Old_Gain : constant Interfaces.Unsigned_32 :=
Interfaces.Unsigned_32 (Value) * 128 / 100;
dB : constant Float range -50.0 .. 0.0 :=
50.0 / 101.0 * Float (Value - 100);
Mult : constant Float := 10.0 ** (dB / 20.0);
New_Gain : constant Interfaces.Unsigned_32 :=
(if dB >= -30.0 then
Interfaces.Unsigned_32 (Mult * 256.0) * 256
else
Interfaces.Unsigned_32 (Mult * 65536.0));
begin
Self.Data_32 := (Old_Gain, Old_Gain, New_Gain, New_Gain, 0);
Self.Data_8 := (1, 255);
end Set_Volume;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access Audg_Message;
Visiter : in out Slim.Message_Visiters.Visiter'Class) is
begin
Visiter.audg (Self);
end Visit;
-----------
-- Write --
-----------
overriding procedure Write
(Self : Audg_Message;
Tag : out Message_Tag;
Data : out League.Stream_Element_Vectors.Stream_Element_Vector) is
begin
Tag := "audg";
Write_Fields (Self, List, Data);
end Write;
end Slim.Messages.audg;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package body Partitions is
type Partition_Entry_Block_Mapping (Kind : Boolean := True) is record
case Kind is
when True => Data : Block (1 .. 16);
when False => P_Entry : Partition_Entry;
end case;
end record with Pack, Unchecked_Union, Size => 16 * 8;
procedure Read_Entry_In_MBR (MBR : Block;
Index : Integer;
P_Entry : out Partition_Entry)
with Pre => Index <= 3;
function Number_Of_Logical_Partitions (Disk : not null Any_Block_Driver;
EBR_Address : Logical_Block_Address)
return Natural;
function Get_Logical_Partition_Entry (Disk : not null Any_Block_Driver;
EBR_Address : Logical_Block_Address;
Entry_Number : Positive;
Entry_Cnt : in out Natural;
P_Entry : out Partition_Entry)
return Status_Code;
-----------------------
-- Read_Entry_In_MBR --
-----------------------
procedure Read_Entry_In_MBR (MBR : Block;
Index : Integer;
P_Entry : out Partition_Entry)
is
Entry_Block_Conv : Partition_Entry_Block_Mapping;
First : constant Integer := MBR'First + 446 + Index * 16;
Last : constant Integer := First + 15;
begin
if MBR'Length /= 512 then
P_Entry.Status := 16#FF#;
end if;
Entry_Block_Conv.Data := MBR (First .. Last);
P_Entry := Entry_Block_Conv.P_Entry;
end Read_Entry_In_MBR;
----------------------------------
-- Number_Of_Logical_Partitions --
----------------------------------
function Number_Of_Logical_Partitions (Disk : not null Any_Block_Driver;
EBR_Address : Logical_Block_Address)
return Natural
is
EBR : Block (0 .. 511);
Entry_Cnt : Natural := 0;
Address : Logical_Block_Address := EBR_Address;
P_Entry : Partition_Entry;
begin
loop
if not Disk.Read (UInt64 (Address), EBR) or else EBR (510 .. 511) /= (16#55#, 16#AA#) then
return Entry_Cnt;
end if;
Read_Entry_In_MBR (EBR, 0, P_Entry);
if Is_Valid (P_Entry) then
Entry_Cnt := Entry_Cnt + 1;
end if;
Read_Entry_In_MBR (EBR, 1, P_Entry);
exit when P_Entry.First_Sector_LBA = 0;
Address := EBR_Address + P_Entry.First_Sector_LBA;
end loop;
return Entry_Cnt;
end Number_Of_Logical_Partitions;
---------------------------------
-- Get_Logical_Partition_Entry --
---------------------------------
function Get_Logical_Partition_Entry (Disk : not null Any_Block_Driver;
EBR_Address : Logical_Block_Address;
Entry_Number : Positive;
Entry_Cnt : in out Natural;
P_Entry : out Partition_Entry)
return Status_Code
is
EBR : Block (0 .. 511);
Address : Logical_Block_Address := EBR_Address;
begin
loop
if not Disk.Read (UInt64 (Address), EBR) or else EBR (510 .. 511) /= (16#55#, 16#AA#) then
return Invalid_Parition;
end if;
Read_Entry_In_MBR (EBR, 0, P_Entry);
if Is_Valid (P_Entry) then
Entry_Cnt := Entry_Cnt + 1;
if Entry_Cnt = Entry_Number then
return Status_Ok;
end if;
end if;
Read_Entry_In_MBR (EBR, 1, P_Entry);
exit when P_Entry.First_Sector_LBA = 0;
Address := EBR_Address + P_Entry.First_Sector_LBA;
end loop;
return Invalid_Parition;
end Get_Logical_Partition_Entry;
-------------------------
-- Get_Partition_Entry --
-------------------------
function Get_Partition_Entry (Disk : not null Any_Block_Driver;
Entry_Number : Positive;
P_Entry : out Partition_Entry)
return Status_Code
is
MBR : Block (0 .. 511);
Entry_Cnt : Natural := 0;
EBR_Address : Logical_Block_Address;
begin
if not Disk.Read (0, MBR) then
return Disk_Error;
end if;
if MBR (510 .. 511) /= (16#55#, 16#AA#) then
return Disk_Error;
end if;
for P_Index in 0 .. 3 loop
Read_Entry_In_MBR (MBR, P_Index, P_Entry);
if Is_Valid (P_Entry) then
Entry_Cnt := Entry_Cnt + 1;
-- Is is the entry we are looking for?
if Entry_Cnt = Entry_Number then
return Status_Ok;
elsif P_Entry.Kind = Extended_Parition then
EBR_Address := P_Entry.First_Sector_LBA;
-- Look in the list of logical partitions
if Get_Logical_Partition_Entry (Disk,
EBR_Address,
Entry_Number,
Entry_Cnt,
P_Entry) = Status_Ok
then
return Status_Ok;
end if;
end if;
end if;
end loop;
return Invalid_Parition;
end Get_Partition_Entry;
--------------------------
-- Number_Of_Partitions --
--------------------------
function Number_Of_Partitions (Disk : Any_Block_Driver) return Natural is
MBR : Block (0 .. 511);
Entry_Cnt : Natural := 0;
P_Entry : Partition_Entry;
begin
if not Disk.Read (0, MBR) then
return 0;
end if;
if MBR (510 .. 511) /= (16#55#, 16#AA#) then
return 0;
end if;
for P_Index in 0 .. 3 loop
Read_Entry_In_MBR (MBR, P_Index, P_Entry);
if Is_Valid (P_Entry) then
Entry_Cnt := Entry_Cnt + 1;
end if;
if P_Entry.Kind = Extended_Parition then
Entry_Cnt := Entry_Cnt +
Number_Of_Logical_Partitions (Disk, P_Entry.First_Sector_LBA);
end if;
end loop;
return Entry_Cnt;
end Number_Of_Partitions;
end Partitions;
|
--
-- Copyright 2018 The wookey project team <wookey@ssi.gouv.fr>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with system;
package soc.rng
with spark_mode => on
is
-----------------------------------
-- RNG control register (RNG_CR) --
-----------------------------------
type t_RNG_CR is record
reserved_0_1 : bits_2;
RNGEN : boolean;
IE : boolean;
end record
with volatile_full_access, size => 32;
for t_RNG_CR use record
reserved_0_1 at 0 range 0 .. 1;
RNGEN at 0 range 2 .. 2; -- RNG is enabled
IE at 0 range 3 .. 3; -- RNG Interrupt is enabled
end record;
----------------------------------
-- RNG status register (RNG_SR) --
----------------------------------
type t_RNG_SR is record
DRDY : boolean; -- Data ready
CECS : boolean; -- Clock error current status
SECS : boolean; -- Seed error current status
reserved_3_4 : bits_2;
CEIS : boolean; -- Clock error interrupt status
SEIS : boolean; -- Seed error interrupt status
end record
with volatile_full_access, size => 32;
for t_RNG_SR use record
DRDY at 0 range 0 .. 0;
CECS at 0 range 1 .. 1;
SECS at 0 range 2 .. 2;
reserved_3_4 at 0 range 3 .. 4;
CEIS at 0 range 5 .. 5;
SEIS at 0 range 6 .. 6;
end record;
--------------------------------
-- RNG data register (RNG_DR) --
--------------------------------
type t_RNG_DR is record
RNDATA : unsigned_32; -- Random data
end record
with volatile_full_access, size => 32;
--------------------
-- RNG peripheral --
--------------------
type t_RNG_peripheral is record
CR : t_RNG_CR;
SR : t_RNG_SR;
DR : t_RNG_DR;
end record
with volatile;
for t_RNG_peripheral use record
CR at 16#00# range 0 .. 31;
SR at 16#04# range 0 .. 31;
DR at 16#08# range 0 .. 31;
end record;
RNG : t_RNG_peripheral
with
import,
volatile,
address => system'to_address(16#5006_0800#);
procedure init
(success : out boolean);
procedure random
(rand : out unsigned_32;
success : out boolean);
end soc.rng;
|
with openGL.Model,
physics.Model,
gel.Sprite,
gel.Joint,
gel.human_Types,
openGL,
openGL.Program;
limited
with gel.World;
private
with collada.Library.visual_scenes;
package gel.Human
--
-- Provides access to and control of a 'make_human' produced model.
--
is
type Item is tagged limited private;
type View is access all Item'Class;
type Views is array (math.Index range <>) of View;
procedure define (Self : in out Item; World : access gel.World.item'Class;
Model : access openGL.Model.item'Class;
physics_Model : access physics.Model.item'Class;
Mass : in math.Real := 0.0;
is_Kinematic : in Boolean := False);
type bone_Sprites is array (human_types.bone_Id) of gel.Sprite.view;
procedure use_Model (Named : in String);
package Forge is
function new_Human (World : access gel.World.item'Class;
-- Space : in gel.Sprite.physics_Space_view;
Model : access openGL.Model .item'Class;
physics_Model : access physics.Model.item'Class;
Mass : in math.Real := 0.0;
is_Kinematic : in Boolean := False) return Human.view;
function new_Human (bone_Sprites : in human.bone_Sprites;
controller_Joints : in human_types.controller_Joints;
Model : access openGL.Model.item'Class) return Human.view;
end Forge;
procedure destroy (Self : in out Item);
procedure free (Self : in out View);
type motion_Mode is (Physics, Animation);
procedure motion_Mode_is (Self : in out Item; Now : in motion_Mode);
function base_Sprite (Self : in Item'Class) return gel.Sprite.view;
function Sprite (Self : in Item'Class; for_Bone : in human_types.bone_Id) return gel.Sprite.view;
procedure controller_Joints_are (Self : in out Item'Class; Now : in human_types.controller_Joints);
function controller_Joints (Self : in Item'Class) return human_types.controller_Joints;
procedure evolve (Self : in out Item'Class);
--- Animation
--
type scene_joint_Id is (Armature,
MasterFloor,
Root,
Hips,
UpLeg_L, LoLeg_L, Foot_L, Toe_L,
UpLeg_R, LoLeg_R, Foot_R, Toe_R,
Spine1, Spine2, Spine3,
Neck, Head, Jaw,
TongueBase, TongueMid, TongueTip,
Eye_R, Eye_L,
UpLid_R, LoLid_R,
UpLid_L, LoLid_L,
Clavicle_L, UpArm_L, LoArm_L, Hand_L,
Wrist_1_L,
Palm_2_L, Finger_2_1_L, Finger_2_2_L, Finger_2_3_L,
Palm_3_L, Finger_3_1_L, Finger_3_2_L, Finger_3_3_L,
Wrist_2_L,
Palm_4_L, Finger_4_1_L, Finger_4_2_L, Finger_4_3_L,
Palm_5_L, Finger_5_1_L, Finger_5_2_L, Finger_5_3_L,
Palm_1_L, Finger_1_1_L, Finger_1_2_L, Finger_1_3_L,
Clavicle_R, UpArm_R, LoArm_R, Hand_R,
Wrist_1_R,
Palm_2_R, Finger_2_1_R, Finger_2_2_R, Finger_2_3_R,
Palm_3_R, Finger_3_1_R, Finger_3_2_R, Finger_3_3_R,
Wrist_2_R,
Palm_4_R, Finger_4_1_R, Finger_4_2_R, Finger_4_3_R,
Palm_5_R, Finger_5_1_R, Finger_5_2_R, Finger_5_3_R,
Palm_1_R, Finger_1_1_R, Finger_1_2_R, Finger_1_3_R,
Wrist_L, Wrist_R,
Ankle_L, Ankle_R);
type axis_Kind is (x_Axis, y_Axis, z_Axis);
procedure set_rotation_Angle (Self : in out Item'Class; for_Joint : in scene_joint_Id;
Axis : in Axis_Kind;
To : in math.Real);
procedure set_x_rotation_Angle (Self : in out Item'Class; for_Joint : in scene_joint_Id;
To : in math.Real);
procedure set_y_rotation_Angle (Self : in out Item'Class; for_Joint : in scene_joint_Id;
To : in math.Real);
procedure set_z_rotation_Angle (Self : in out Item'Class; for_Joint : in scene_joint_Id;
To : in math.Real);
procedure set_Location (Self : in out Item'Class; for_Joint : in scene_joint_Id;
To : in math.Vector_3);
procedure update_all_global_Transforms (Self : in out Item'Class);
--- animation
--
procedure animate (Self : in out Item; world_Age : in Duration);
procedure reset_Animation (Self : in out Item);
type joint_Transforms is array (gel.human_Types.controller_joint_Id) of opengl.Matrix_4x4;
type skin_program_Parameters is new opengl.Program.Parameters with
record
bone_Transforms : human.joint_Transforms := (others => opengl.math.Identity_4x4);
end record;
overriding
procedure enable (Self : in out skin_program_Parameters);
private
use human_Types;
type Joints is array (controller_joint_Id) of gel.Joint.view;
type scene_Joint is
record
Node : collada.Library.visual_scenes.Node_view;
Transform : math.Matrix_4x4;
end record;
type scene_Joints is array (scene_joint_Id) of scene_Joint;
-- type joint_Transforms is array (controller_joint_Id) of opengl.Matrix_4x4;
--
-- type skin_program_Parameters is new opengl.Program.Parameters with
-- record
-- bone_Transforms : human.joint_Transforms := (others => opengl.math.Identity_4x4);
-- end record;
--
-- overriding
-- procedure enable (Self : in out skin_program_Parameters);
--- Animation
--
type channel_Id is (root_loc, root_x, root_y, root_z,
-- hips_x, hips_y, hips_z,
spine_1_x, spine_1_y, spine_1_z,
spine_2_x, spine_2_y, spine_2_z,
spine_3_x, spine_3_y, spine_3_z,
neck_x, neck_y, neck_z,
head_x, head_y, head_z,
l_clavicle_x, l_clavicle_y, l_clavicle_z,
l_uparm_x, l_uparm_y, l_uparm_z,
l_loarm_x, l_loarm_y, l_loarm_z,
l_hand_x, l_hand_y, l_hand_z,
l_wrist_loc, l_wrist_x, l_wrist_y, l_wrist_z,
r_clavicle_x, r_clavicle_y, r_clavicle_z,
r_uparm_x, r_uparm_y, r_uparm_z,
r_loarm_x, r_loarm_y, r_loarm_z,
r_hand_x, r_hand_y, r_hand_z,
r_wrist_loc, r_wrist_x, r_wrist_y, r_wrist_z,
l_upleg_x, l_upleg_y, l_upleg_z,
l_loleg_x, l_loleg_y, l_loleg_z,
l_foot_x, l_foot_y, l_foot_z,
r_upleg_x, r_upleg_y, r_upleg_z,
r_loleg_x, r_loleg_y, r_loleg_z,
r_foot_x, r_foot_y, r_foot_z
);
type animation_Channel is
record
Target : access collada.Library.visual_scenes.Transform;
Times : access collada.float_Array;
Cursor : math.Index := 0;
Angles : access collada.float_Array;
initial_Angle : math.Real;
current_Angle : math.Real := 0.0;
interp_Delta : math.Real := 0.0;
initial_Site : math.Vector_3;
current_Site : math.Vector_3;
site_interp_Delta : math.Vector_3;
end record;
type animation_Channels is array (channel_Id) of animation_Channel;
--- Human item
--
type Item is tagged limited
record
Mode : human.motion_Mode := Physics;
Space : gel.Sprite.physics_Space_view;
bone_Sprites : human.bone_Sprites;
Joints : human.Joints;
controller_Joints : human_types.controller_Joints;
scene_Joints : human.scene_Joints;
root_Joint : collada.Library.visual_scenes.Node_view;
Model : access openGL.Model.item'class;
program_Parameters : aliased skin_program_Parameters;
Channels : animation_Channels;
start_Time : Duration := 0.0;
Graphics_enabled : Boolean := False;
end record;
procedure enable_Graphics (Self : in out Item);
end gel.Human;
|
-------------------------------------------------------------------------------
-- Copyright (c) 2016 Daniel King
--
-- Permission is hereby granted, free of charge, to any person obtaining a
-- copy of this software and associated documentation files (the "Software"),
-- to deal in the Software without restriction, including without limitation
-- the rights to use, copy, modify, merge, publish, distribute, sublicense,
-- and/or sell copies of the Software, and to permit persons to whom the
-- Software is furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
-------------------------------------------------------------------------------
package DW1000.Ranging.Single_Sided
with SPARK_Mode => On
is
function Compute_Distance
(Tag_Tx_Poll_Timestamp : in Fine_System_Time;
Anchor_Rx_Poll_Timestamp : in Fine_System_Time;
Anchor_Tx_Resp_Timestamp : in Fine_System_Time;
Tag_Rx_Resp_Timestamp : in Fine_System_Time) return Biased_Distance
with Global => null;
-- Compute the distance based on a single-sided ranging exchange.
--
-- The distance measurement calculated by this function contains a bias
-- which can be removed to obtain a more accurate distance measurement.
-- The @Remove_Ranging_Bias@ function can be used to remove the bias.
--
-- @param Tag_Tx_Poll_Timestamp The timestamp of the Tag's local clock when
-- the Tag sent the poll message to the anchor.
--
-- @param Anchor_Rx_Poll_Timestamp The timestamp of the Anchor's local
-- clock when it received the poll message from the Tag.
--
-- @param Anchor_Tx_Poll_Timestamp The timstamp of the Anchor's local clock
-- when it sent the response message back to the Tag.
--
-- @param Tag_Rx_Resp_Timestamp The timestamp of the Tag's local clock when
-- it received the response from the Anchor.
--
-- @return The measured distance between the tag and anchor. This
-- measurement contains a bias which must be removed to obtain a more
-- accurate measurement.
function Compute_Distance
(Tag_Tx_Poll_Timestamp : in Fine_System_Time;
Anchor_Rx_Poll_Timestamp : in Fine_System_Time;
Anchor_Tx_Resp_Timestamp : in Fine_System_Time;
Tag_Rx_Resp_Timestamp : in Fine_System_Time;
Channel : in DW1000.Driver.Channel_Number;
PRF : in DW1000.Driver.PRF_Type) return Meters
with Global => null;
-- Compute the distance based on a single-sided ranging exchange, and
-- automatically remove ranging bias.
--
-- The distance measurement calculated by this function contains a bias
-- which can be removed to obtain a more accurate distance measurement.
-- The @Remove_Ranging_Bias@ function can be used to remove the bias.
--
-- @param Tag_Tx_Poll_Timestamp The timestamp of the Tag's local clock when
-- the Tag sent the poll message to the anchor.
--
-- @param Anchor_Rx_Poll_Timestamp The timestamp of the Anchor's local
-- clock when it received the poll message from the Tag.
--
-- @param Anchor_Tx_Poll_Timestamp The timstamp of the Anchor's local clock
-- when it sent the response message back to the Tag.
--
-- @param Tag_Rx_Resp_Timestamp The timestamp of the Tag's local clock when
-- it received the response from the Anchor.
--
-- @param Channel The UWB channel on which the ranging exchange took place.
--
-- @param PRF The PRF that was used for the ranging exchange.
--
-- @return The measured distance between the tag and anchor.
end DW1000.Ranging.Single_Sided;
|
-----------------------------------------------------------------------
-- util-properties-json -- read json files into properties
-- Copyright (C) 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Serialize.IO.JSON;
with Util.Stacks;
with Util.Beans.Objects;
package body Util.Properties.JSON is
type Natural_Access is access all Natural;
package Length_Stack is new Util.Stacks (Element_Type => Natural,
Element_Type_Access => Natural_Access);
type Parser is new Util.Serialize.IO.JSON.Parser with record
Base_Name : Ada.Strings.Unbounded.Unbounded_String;
Lengths : Length_Stack.Stack;
Separator : Ada.Strings.Unbounded.Unbounded_String;
Separator_Length : Natural;
end record;
-- Start a new object associated with the given name. This is called when
-- the '{' is reached. The reader must be updated so that the next
-- <b>Set_Member</b> procedure will associate the name/value pair on the
-- new object.
overriding
procedure Start_Object (Handler : in out Parser;
Name : in String);
-- Finish an object associated with the given name. The reader must be
-- updated to be associated with the previous object.
overriding
procedure Finish_Object (Handler : in out Parser;
Name : in String);
-- -----------------------
-- Start a new object associated with the given name. This is called when
-- the '{' is reached. The reader must be updated so that the next
-- <b>Set_Member</b> procedure will associate the name/value pair on the
-- new object.
-- -----------------------
overriding
procedure Start_Object (Handler : in out Parser;
Name : in String) is
begin
if Name'Length > 0 then
Ada.Strings.Unbounded.Append (Handler.Base_Name, Name);
Ada.Strings.Unbounded.Append (Handler.Base_Name, Handler.Separator);
Length_Stack.Push (Handler.Lengths);
Length_Stack.Current (Handler.Lengths).all := Name'Length + Handler.Separator_Length;
end if;
end Start_Object;
-- -----------------------
-- Finish an object associated with the given name. The reader must be
-- updated to be associated with the previous object.
-- -----------------------
overriding
procedure Finish_Object (Handler : in out Parser;
Name : in String) is
Len : constant Natural := Ada.Strings.Unbounded.Length (Handler.Base_Name);
begin
if Name'Length > 0 then
Ada.Strings.Unbounded.Delete (Handler.Base_Name,
Len - Name'Length - Handler.Separator_Length + 1, Len);
end if;
end Finish_Object;
-- -----------------------
-- Parse the JSON content and put the flattened content in the property manager.
-- -----------------------
procedure Parse_JSON (Manager : in out Util.Properties.Manager'Class;
Content : in String;
Flatten_Separator : in String := ".") is
type Local_Parser is new Parser with record
Manager : access Util.Properties.Manager'Class;
end record;
-- Set the name/value pair on the current object. For each active mapping,
-- find whether a rule matches our name and execute it.
overriding
procedure Set_Member (Handler : in out Local_Parser;
Name : in String;
Value : in Util.Beans.Objects.Object;
Attribute : in Boolean := False);
-- -----------------------
-- Set the name/value pair on the current object. For each active mapping,
-- find whether a rule matches our name and execute it.
-- -----------------------
overriding
procedure Set_Member (Handler : in out Local_Parser;
Name : in String;
Value : in Util.Beans.Objects.Object;
Attribute : in Boolean := False) is
pragma Unreferenced (Attribute);
begin
Handler.Manager.Set (Ada.Strings.Unbounded.To_String (Handler.Base_Name) & Name,
Util.Beans.Objects.To_String (Value));
end Set_Member;
P : Local_Parser;
begin
P.Separator := Ada.Strings.Unbounded.To_Unbounded_String (Flatten_Separator);
P.Separator_Length := Flatten_Separator'Length;
P.Manager := Manager'Access;
P.Parse_String (Content);
if P.Has_Error then
raise Util.Serialize.IO.Parse_Error;
end if;
end Parse_JSON;
-- -----------------------
-- Read the JSON file into the property manager.
-- The JSON content is flatten into Flatten the JSON content and add the properties.
-- -----------------------
procedure Read_JSON (Manager : in out Util.Properties.Manager'Class;
Path : in String;
Flatten_Separator : in String := ".") is
type Local_Parser is new Parser with record
Manager : access Util.Properties.Manager'Class;
end record;
-- Set the name/value pair on the current object. For each active mapping,
-- find whether a rule matches our name and execute it.
overriding
procedure Set_Member (Handler : in out Local_Parser;
Name : in String;
Value : in Util.Beans.Objects.Object;
Attribute : in Boolean := False);
-- -----------------------
-- Set the name/value pair on the current object. For each active mapping,
-- find whether a rule matches our name and execute it.
-- -----------------------
overriding
procedure Set_Member (Handler : in out Local_Parser;
Name : in String;
Value : in Util.Beans.Objects.Object;
Attribute : in Boolean := False) is
pragma Unreferenced (Attribute);
begin
Handler.Manager.Set (Ada.Strings.Unbounded.To_String (Handler.Base_Name) & Name,
Util.Beans.Objects.To_String (Value));
end Set_Member;
P : Local_Parser;
begin
P.Manager := Manager'Access;
P.Separator := Ada.Strings.Unbounded.To_Unbounded_String (Flatten_Separator);
P.Separator_Length := Flatten_Separator'Length;
P.Parse (Path);
if P.Has_Error then
raise Util.Serialize.IO.Parse_Error;
end if;
end Read_JSON;
end Util.Properties.JSON;
|
package Oriented is
type Object is tagged limited private;
type Object_Access is access Object;
procedure Initialize (Ob : in out Object; P_Id : in Positive);
function Get_Item_Id (Ob : in Object) return Positive;
function NewObj return Object_Access;
procedure Free (Obj : in out Object_Access);
private
subtype Counter_Type is Integer range 2 .. 99;
type Id_Type is
record
Serial : Positive := 1;
Subpart : Positive := 1;
end record;
type Object is tagged limited
record
Counter : Counter_Type := 2;
Id : Id_Type;
end record;
end Oriented;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A T R E E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, 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 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. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram ordering check for this package
-- WARNING: There is a C version of this package. Any changes to this source
-- file must be properly reflected in the file atree.h which is a C header
-- file containing equivalent definitions for use by gigi.
with Aspects; use Aspects;
with Debug; use Debug;
with Nlists; use Nlists;
with Opt; use Opt;
with Output; use Output;
with Sinput; use Sinput;
with Tree_IO; use Tree_IO;
with GNAT.Heap_Sort_G;
package body Atree is
Locked : Boolean := False;
-- Compiling with assertions enabled, node contents modifications are
-- permitted only when this switch is set to False; compiling without
-- assertions this lock has no effect.
Reporting_Proc : Report_Proc := null;
-- Record argument to last call to Set_Reporting_Proc
---------------
-- Debugging --
---------------
-- Suppose you find that node 12345 is messed up. You might want to find
-- the code that created that node. There are two ways to do this:
-- One way is to set a conditional breakpoint on New_Node_Debugging_Output
-- (nickname "nnd"):
-- break nnd if n = 12345
-- and run gnat1 again from the beginning.
-- The other way is to set a breakpoint near the beginning (e.g. on
-- gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
-- ww := 12345
-- and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
-- Either way, gnat1 will stop when node 12345 is created
-- The second method is much faster
-- Similarly, rr and rrd allow breaking on rewriting of a given node
ww : Node_Id'Base := Node_Id'First - 1;
pragma Export (Ada, ww); -- trick the optimizer
Watch_Node : Node_Id'Base renames ww;
-- Node to "watch"; that is, whenever a node is created, we check if it
-- is equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
-- presumably set a breakpoint on New_Node_Breakpoint. Note that the
-- initial value of Node_Id'First - 1 ensures that by default, no node
-- will be equal to Watch_Node.
procedure nn;
pragma Export (Ada, nn);
procedure New_Node_Breakpoint renames nn;
-- This doesn't do anything interesting; it's just for setting breakpoint
-- on as explained above.
procedure nnd (N : Node_Id);
pragma Export (Ada, nnd);
procedure New_Node_Debugging_Output (N : Node_Id) renames nnd;
-- For debugging. If debugging is turned on, New_Node and New_Entity call
-- this. If debug flag N is turned on, this prints out the new node.
--
-- If Node = Watch_Node, this prints out the new node and calls
-- New_Node_Breakpoint. Otherwise, does nothing.
procedure rr;
pragma Export (Ada, rr);
procedure Rewrite_Breakpoint renames rr;
-- This doesn't do anything interesting; it's just for setting breakpoint
-- on as explained above.
procedure rrd (Old_Node, New_Node : Node_Id);
pragma Export (Ada, rrd);
procedure Rewrite_Debugging_Output
(Old_Node, New_Node : Node_Id) renames rrd;
-- For debugging. If debugging is turned on, Rewrite calls this. If debug
-- flag N is turned on, this prints out the new node.
--
-- If Old_Node = Watch_Node, this prints out the old and new nodes and
-- calls Rewrite_Breakpoint. Otherwise, does nothing.
procedure Node_Debug_Output (Op : String; N : Node_Id);
-- Common code for nnd and rrd, writes Op followed by information about N
procedure Print_Statistics;
pragma Export (Ada, Print_Statistics);
-- Print various statistics on the tables maintained by the package
-----------------------------
-- Local Objects and Types --
-----------------------------
Node_Count : Nat;
-- Count allocated nodes for Num_Nodes function
use Unchecked_Access;
-- We are allowed to see these from within our own body
use Atree_Private_Part;
-- We are also allowed to see our private data structures
-- Functions used to store Entity_Kind value in Nkind field
-- The following declarations are used to store flags 65-72 in the
-- Nkind field of the third component of an extended (entity) node.
type Flag_Byte is record
Flag65 : Boolean;
Flag66 : Boolean;
Flag67 : Boolean;
Flag68 : Boolean;
Flag69 : Boolean;
Flag70 : Boolean;
Flag71 : Boolean;
Flag72 : Boolean;
end record;
pragma Pack (Flag_Byte);
for Flag_Byte'Size use 8;
type Flag_Byte_Ptr is access all Flag_Byte;
type Node_Kind_Ptr is access all Node_Kind;
function To_Flag_Byte is new
Unchecked_Conversion (Node_Kind, Flag_Byte);
function To_Flag_Byte_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
-- The following declarations are used to store flags 239-246 in the
-- Nkind field of the fourth component of an extended (entity) node.
type Flag_Byte2 is record
Flag239 : Boolean;
Flag240 : Boolean;
Flag241 : Boolean;
Flag242 : Boolean;
Flag243 : Boolean;
Flag244 : Boolean;
Flag245 : Boolean;
Flag246 : Boolean;
end record;
pragma Pack (Flag_Byte2);
for Flag_Byte2'Size use 8;
type Flag_Byte2_Ptr is access all Flag_Byte2;
function To_Flag_Byte2 is new
Unchecked_Conversion (Node_Kind, Flag_Byte2);
function To_Flag_Byte2_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte2_Ptr);
-- The following declarations are used to store flags 247-254 in the
-- Nkind field of the fifth component of an extended (entity) node.
type Flag_Byte3 is record
Flag247 : Boolean;
Flag248 : Boolean;
Flag249 : Boolean;
Flag250 : Boolean;
Flag251 : Boolean;
Flag252 : Boolean;
Flag253 : Boolean;
Flag254 : Boolean;
end record;
pragma Pack (Flag_Byte3);
for Flag_Byte3'Size use 8;
type Flag_Byte3_Ptr is access all Flag_Byte3;
function To_Flag_Byte3 is new
Unchecked_Conversion (Node_Kind, Flag_Byte3);
function To_Flag_Byte3_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte3_Ptr);
-- The following declarations are used to store flags 310-317 in the
-- Nkind field of the sixth component of an extended (entity) node.
type Flag_Byte4 is record
Flag310 : Boolean;
Flag311 : Boolean;
Flag312 : Boolean;
Flag313 : Boolean;
Flag314 : Boolean;
Flag315 : Boolean;
Flag316 : Boolean;
Flag317 : Boolean;
end record;
pragma Pack (Flag_Byte4);
for Flag_Byte4'Size use 8;
type Flag_Byte4_Ptr is access all Flag_Byte4;
function To_Flag_Byte4 is new
Unchecked_Conversion (Node_Kind, Flag_Byte4);
function To_Flag_Byte4_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte4_Ptr);
-- The following declarations are used to store flags 73-96 and the
-- Convention field in the Field12 field of the third component of an
-- extended (Entity) node.
type Flag_Word is record
Flag73 : Boolean;
Flag74 : Boolean;
Flag75 : Boolean;
Flag76 : Boolean;
Flag77 : Boolean;
Flag78 : Boolean;
Flag79 : Boolean;
Flag80 : Boolean;
Flag81 : Boolean;
Flag82 : Boolean;
Flag83 : Boolean;
Flag84 : Boolean;
Flag85 : Boolean;
Flag86 : Boolean;
Flag87 : Boolean;
Flag88 : Boolean;
Flag89 : Boolean;
Flag90 : Boolean;
Flag91 : Boolean;
Flag92 : Boolean;
Flag93 : Boolean;
Flag94 : Boolean;
Flag95 : Boolean;
Flag96 : Boolean;
Convention : Convention_Id;
end record;
pragma Pack (Flag_Word);
for Flag_Word'Size use 32;
for Flag_Word'Alignment use 4;
type Flag_Word_Ptr is access all Flag_Word;
type Union_Id_Ptr is access all Union_Id;
function To_Flag_Word is new
Unchecked_Conversion (Union_Id, Flag_Word);
function To_Flag_Word_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
-- The following declarations are used to store flags 97-128 in the
-- Field12 field of the fourth component of an extended (entity) node.
type Flag_Word2 is record
Flag97 : Boolean;
Flag98 : Boolean;
Flag99 : Boolean;
Flag100 : Boolean;
Flag101 : Boolean;
Flag102 : Boolean;
Flag103 : Boolean;
Flag104 : Boolean;
Flag105 : Boolean;
Flag106 : Boolean;
Flag107 : Boolean;
Flag108 : Boolean;
Flag109 : Boolean;
Flag110 : Boolean;
Flag111 : Boolean;
Flag112 : Boolean;
Flag113 : Boolean;
Flag114 : Boolean;
Flag115 : Boolean;
Flag116 : Boolean;
Flag117 : Boolean;
Flag118 : Boolean;
Flag119 : Boolean;
Flag120 : Boolean;
Flag121 : Boolean;
Flag122 : Boolean;
Flag123 : Boolean;
Flag124 : Boolean;
Flag125 : Boolean;
Flag126 : Boolean;
Flag127 : Boolean;
Flag128 : Boolean;
end record;
pragma Pack (Flag_Word2);
for Flag_Word2'Size use 32;
for Flag_Word2'Alignment use 4;
type Flag_Word2_Ptr is access all Flag_Word2;
function To_Flag_Word2 is new
Unchecked_Conversion (Union_Id, Flag_Word2);
function To_Flag_Word2_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
-- The following declarations are used to store flags 152-183 in the
-- Field11 field of the fourth component of an extended (entity) node.
type Flag_Word3 is record
Flag152 : Boolean;
Flag153 : Boolean;
Flag154 : Boolean;
Flag155 : Boolean;
Flag156 : Boolean;
Flag157 : Boolean;
Flag158 : Boolean;
Flag159 : Boolean;
Flag160 : Boolean;
Flag161 : Boolean;
Flag162 : Boolean;
Flag163 : Boolean;
Flag164 : Boolean;
Flag165 : Boolean;
Flag166 : Boolean;
Flag167 : Boolean;
Flag168 : Boolean;
Flag169 : Boolean;
Flag170 : Boolean;
Flag171 : Boolean;
Flag172 : Boolean;
Flag173 : Boolean;
Flag174 : Boolean;
Flag175 : Boolean;
Flag176 : Boolean;
Flag177 : Boolean;
Flag178 : Boolean;
Flag179 : Boolean;
Flag180 : Boolean;
Flag181 : Boolean;
Flag182 : Boolean;
Flag183 : Boolean;
end record;
pragma Pack (Flag_Word3);
for Flag_Word3'Size use 32;
for Flag_Word3'Alignment use 4;
type Flag_Word3_Ptr is access all Flag_Word3;
function To_Flag_Word3 is new
Unchecked_Conversion (Union_Id, Flag_Word3);
function To_Flag_Word3_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
-- The following declarations are used to store flags 184-215 in the
-- Field12 field of the fifth component of an extended (entity) node.
type Flag_Word4 is record
Flag184 : Boolean;
Flag185 : Boolean;
Flag186 : Boolean;
Flag187 : Boolean;
Flag188 : Boolean;
Flag189 : Boolean;
Flag190 : Boolean;
Flag191 : Boolean;
Flag192 : Boolean;
Flag193 : Boolean;
Flag194 : Boolean;
Flag195 : Boolean;
Flag196 : Boolean;
Flag197 : Boolean;
Flag198 : Boolean;
Flag199 : Boolean;
Flag200 : Boolean;
Flag201 : Boolean;
Flag202 : Boolean;
Flag203 : Boolean;
Flag204 : Boolean;
Flag205 : Boolean;
Flag206 : Boolean;
Flag207 : Boolean;
Flag208 : Boolean;
Flag209 : Boolean;
Flag210 : Boolean;
Flag211 : Boolean;
Flag212 : Boolean;
Flag213 : Boolean;
Flag214 : Boolean;
Flag215 : Boolean;
end record;
pragma Pack (Flag_Word4);
for Flag_Word4'Size use 32;
for Flag_Word4'Alignment use 4;
type Flag_Word4_Ptr is access all Flag_Word4;
function To_Flag_Word4 is new
Unchecked_Conversion (Union_Id, Flag_Word4);
function To_Flag_Word4_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
-- The following declarations are used to store flags 255-286 in the
-- Field12 field of the sixth component of an extended (entity) node.
type Flag_Word5 is record
Flag255 : Boolean;
Flag256 : Boolean;
Flag257 : Boolean;
Flag258 : Boolean;
Flag259 : Boolean;
Flag260 : Boolean;
Flag261 : Boolean;
Flag262 : Boolean;
Flag263 : Boolean;
Flag264 : Boolean;
Flag265 : Boolean;
Flag266 : Boolean;
Flag267 : Boolean;
Flag268 : Boolean;
Flag269 : Boolean;
Flag270 : Boolean;
Flag271 : Boolean;
Flag272 : Boolean;
Flag273 : Boolean;
Flag274 : Boolean;
Flag275 : Boolean;
Flag276 : Boolean;
Flag277 : Boolean;
Flag278 : Boolean;
Flag279 : Boolean;
Flag280 : Boolean;
Flag281 : Boolean;
Flag282 : Boolean;
Flag283 : Boolean;
Flag284 : Boolean;
Flag285 : Boolean;
Flag286 : Boolean;
end record;
pragma Pack (Flag_Word5);
for Flag_Word5'Size use 32;
for Flag_Word5'Alignment use 4;
type Flag_Word5_Ptr is access all Flag_Word5;
function To_Flag_Word5 is new
Unchecked_Conversion (Union_Id, Flag_Word5);
function To_Flag_Word5_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word5_Ptr);
--------------------------------------------------
-- Implementation of Tree Substitution Routines --
--------------------------------------------------
-- A separate table keeps track of the mapping between rewritten nodes
-- and their corresponding original tree nodes. Rewrite makes an entry
-- in this table for use by Original_Node. By default, if no call is
-- Rewrite, the entry in this table points to the original unwritten node.
-- Note: eventually, this should be a field in the Node directly, but
-- for now we do not want to disturb the efficiency of a power of 2
-- for the node size
package Orig_Nodes is new Table.Table (
Table_Component_Type => Node_Id,
Table_Index_Type => Node_Id'Base,
Table_Low_Bound => First_Node_Id,
Table_Initial => Alloc.Orig_Nodes_Initial,
Table_Increment => Alloc.Orig_Nodes_Increment,
Release_Threshold => Alloc.Orig_Nodes_Release_Threshold,
Table_Name => "Orig_Nodes");
--------------------------
-- Paren_Count Handling --
--------------------------
-- As noted in the spec, the paren count in a sub-expression node has
-- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
-- and we use an auxiliary serially scanned table to record the actual
-- count. A serial search is fine, only pathological programs will use
-- entries in this table. Normal programs won't use it at all.
type Paren_Count_Entry is record
Nod : Node_Id;
-- The node to which this count applies
Count : Nat range 3 .. Nat'Last;
-- The count of parentheses, which will be in the indicated range
end record;
package Paren_Counts is new Table.Table (
Table_Component_Type => Paren_Count_Entry,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => 10,
Table_Increment => 200,
Table_Name => "Paren_Counts");
-----------------------
-- Local Subprograms --
-----------------------
function Allocate_Initialize_Node
(Src : Node_Id;
With_Extension : Boolean) return Node_Id;
-- Allocate a new node or node extension. If Src is not empty, the
-- information for the newly-allocated node is copied from it.
procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id);
-- Fix up parent pointers for the syntactic children of Fix_Node after a
-- copy, setting them to Fix_Node when they pointed to Ref_Node.
procedure Mark_New_Ghost_Node (N : Node_Or_Entity_Id);
-- Mark arbitrary node or entity N as Ghost when it is created within a
-- Ghost region.
------------------------------
-- Allocate_Initialize_Node --
------------------------------
function Allocate_Initialize_Node
(Src : Node_Id;
With_Extension : Boolean) return Node_Id
is
New_Id : Node_Id;
begin
if Present (Src)
and then not Has_Extension (Src)
and then With_Extension
and then Src = Nodes.Last
then
New_Id := Src;
-- We are allocating a new node, or extending a node other than
-- Nodes.Last.
else
if Present (Src) then
Nodes.Append (Nodes.Table (Src));
Flags.Append (Flags.Table (Src));
else
Nodes.Append (Default_Node);
Flags.Append (Default_Flags);
end if;
New_Id := Nodes.Last;
Orig_Nodes.Append (New_Id);
Node_Count := Node_Count + 1;
end if;
-- Clear Check_Actuals to False
Set_Check_Actuals (New_Id, False);
-- Specifically copy Paren_Count to deal with creating new table entry
-- if the parentheses count is at the maximum possible value already.
if Present (Src) and then Nkind (Src) in N_Subexpr then
Set_Paren_Count (New_Id, Paren_Count (Src));
end if;
-- Set extension nodes if required
if With_Extension then
if Present (Src) and then Has_Extension (Src) then
for J in 1 .. Num_Extension_Nodes loop
Nodes.Append (Nodes.Table (Src + J));
Flags.Append (Flags.Table (Src + J));
end loop;
else
for J in 1 .. Num_Extension_Nodes loop
Nodes.Append (Default_Node_Extension);
Flags.Append (Default_Flags);
end loop;
end if;
end if;
Orig_Nodes.Set_Last (Nodes.Last);
Allocate_List_Tables (Nodes.Last);
-- Invoke the reporting procedure (if available)
if Reporting_Proc /= null then
Reporting_Proc.all (Target => New_Id, Source => Src);
end if;
return New_Id;
end Allocate_Initialize_Node;
--------------
-- Analyzed --
--------------
function Analyzed (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Analyzed;
end Analyzed;
--------------------------
-- Basic_Set_Convention --
--------------------------
procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id) is
begin
pragma Assert (Nkind (E) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
end Basic_Set_Convention;
-------------------
-- Check_Actuals --
-------------------
function Check_Actuals (N : Node_Id) return Boolean is
begin
return Flags.Table (N).Check_Actuals;
end Check_Actuals;
--------------------------
-- Check_Error_Detected --
--------------------------
procedure Check_Error_Detected is
begin
-- An anomaly has been detected which is assumed to be a consequence of
-- a previous serious error or configurable run time violation. Raise
-- an exception if no such error has been detected.
if Serious_Errors_Detected = 0
and then Configurable_Run_Time_Violations = 0
then
raise Program_Error;
end if;
end Check_Error_Detected;
-----------------
-- Change_Node --
-----------------
procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
Save_Sloc : constant Source_Ptr := Sloc (N);
Save_In_List : constant Boolean := Nodes.Table (N).In_List;
Save_Link : constant Union_Id := Nodes.Table (N).Link;
Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
Par_Count : Nat := 0;
begin
if Nkind (N) in N_Subexpr then
Par_Count := Paren_Count (N);
end if;
Nodes.Table (N) := Default_Node;
Nodes.Table (N).Sloc := Save_Sloc;
Nodes.Table (N).In_List := Save_In_List;
Nodes.Table (N).Link := Save_Link;
Nodes.Table (N).Comes_From_Source := Save_CFS;
Nodes.Table (N).Nkind := New_Node_Kind;
Nodes.Table (N).Error_Posted := Save_Posted;
Flags.Table (N) := Default_Flags;
if New_Node_Kind in N_Subexpr then
Set_Paren_Count (N, Par_Count);
end if;
end Change_Node;
-----------------------
-- Comes_From_Source --
-----------------------
function Comes_From_Source (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Comes_From_Source;
end Comes_From_Source;
----------------
-- Convention --
----------------
function Convention (E : Entity_Id) return Convention_Id is
begin
pragma Assert (Nkind (E) in N_Entity);
return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
end Convention;
---------------
-- Copy_Node --
---------------
procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
begin
Nodes.Table (Destination) := Nodes.Table (Source);
Nodes.Table (Destination).In_List := Save_In_List;
Nodes.Table (Destination).Link := Save_Link;
Flags.Table (Destination) := Flags.Table (Source);
-- Specifically set Paren_Count to make sure auxiliary table entry
-- gets correctly made if the parentheses count is at the max value.
if Nkind (Destination) in N_Subexpr then
Set_Paren_Count (Destination, Paren_Count (Source));
end if;
-- Deal with copying extension nodes if present. No need to copy flags
-- table entries, since they are always zero for extending components.
if Has_Extension (Source) then
pragma Assert (Has_Extension (Destination));
for J in 1 .. Num_Extension_Nodes loop
Nodes.Table (Destination + J) := Nodes.Table (Source + J);
end loop;
else
pragma Assert (not Has_Extension (Source));
null;
end if;
end Copy_Node;
------------------------
-- Copy_Separate_List --
------------------------
function Copy_Separate_List (Source : List_Id) return List_Id is
Result : constant List_Id := New_List;
Nod : Node_Id;
begin
Nod := First (Source);
while Present (Nod) loop
Append (Copy_Separate_Tree (Nod), Result);
Next (Nod);
end loop;
return Result;
end Copy_Separate_List;
------------------------
-- Copy_Separate_Tree --
------------------------
function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
New_Id : Node_Id;
function Copy_Entity (E : Entity_Id) return Entity_Id;
-- Copy Entity, copying only the Ekind and Chars fields
function Copy_List (List : List_Id) return List_Id;
-- Copy list
function Possible_Copy (Field : Union_Id) return Union_Id;
-- Given a field, returns a copy of the node or list if its parent is
-- the current source node, and otherwise returns the input.
-----------------
-- Copy_Entity --
-----------------
function Copy_Entity (E : Entity_Id) return Entity_Id is
New_Ent : Entity_Id;
begin
-- Build appropriate node
case N_Entity (Nkind (E)) is
when N_Defining_Identifier =>
New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
when N_Defining_Character_Literal =>
New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
when N_Defining_Operator_Symbol =>
New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
end case;
Set_Chars (New_Ent, Chars (E));
-- Set_Comes_From_Source (New_Ent, Comes_From_Source (E));
return New_Ent;
end Copy_Entity;
---------------
-- Copy_List --
---------------
function Copy_List (List : List_Id) return List_Id is
NL : List_Id;
E : Node_Id;
begin
if List = No_List then
return No_List;
else
NL := New_List;
E := First (List);
while Present (E) loop
if Has_Extension (E) then
Append (Copy_Entity (E), NL);
else
Append (Copy_Separate_Tree (E), NL);
end if;
Next (E);
end loop;
return NL;
end if;
end Copy_List;
-------------------
-- Possible_Copy --
-------------------
function Possible_Copy (Field : Union_Id) return Union_Id is
New_N : Union_Id;
begin
if Field in Node_Range then
New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
if Parent (Node_Id (Field)) = Source then
Set_Parent (Node_Id (New_N), New_Id);
end if;
return New_N;
elsif Field in List_Range then
New_N := Union_Id (Copy_List (List_Id (Field)));
if Parent (List_Id (Field)) = Source then
Set_Parent (List_Id (New_N), New_Id);
end if;
return New_N;
else
return Field;
end if;
end Possible_Copy;
-- Start of processing for Copy_Separate_Tree
begin
if Source <= Empty_Or_Error then
return Source;
elsif Has_Extension (Source) then
return Copy_Entity (Source);
else
New_Id := New_Copy (Source);
-- Recursively copy descendants
Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
-- Explicitly copy the aspect specifications as those do not reside
-- in a node field.
if Permits_Aspect_Specifications (Source)
and then Has_Aspects (Source)
then
Set_Aspect_Specifications
(New_Id, Copy_List (Aspect_Specifications (Source)));
end if;
-- Set Entity field to Empty to ensure that no entity references
-- are shared between the two, if the source is already analyzed.
if Nkind (New_Id) in N_Has_Entity
or else Nkind (New_Id) = N_Freeze_Entity
then
Set_Entity (New_Id, Empty);
end if;
-- Reset all Etype fields and Analyzed flags, because input tree may
-- have been fully or partially analyzed.
if Nkind (New_Id) in N_Has_Etype then
Set_Etype (New_Id, Empty);
end if;
Set_Analyzed (New_Id, False);
-- Rather special case, if we have an expanded name, then change
-- it back into a selected component, so that the tree looks the
-- way it did coming out of the parser. This will change back
-- when we analyze the selected component node.
if Nkind (New_Id) = N_Expanded_Name then
-- The following code is a bit kludgy. It would be cleaner to
-- Add an entry Change_Expanded_Name_To_Selected_Component to
-- Sinfo.CN, but that's an earthquake, because it has the wrong
-- license, and Atree is used outside the compiler, e.g. in the
-- binder and in ASIS, so we don't want to add that dependency.
-- Consequently we have no choice but to hold our noses and do
-- the change manually. At least we are Atree, so this odd use
-- of Atree.Unchecked_Access is at least all in the family.
-- Change the node type
Atree.Unchecked_Access.Set_Nkind (New_Id, N_Selected_Component);
-- Clear the Chars field which is not present in a selected
-- component node, so we don't want a junk value around.
Set_Node1 (New_Id, Empty);
end if;
-- All done, return copied node
return New_Id;
end if;
end Copy_Separate_Tree;
-----------
-- Ekind --
-----------
function Ekind (E : Entity_Id) return Entity_Kind is
begin
pragma Assert (Nkind (E) in N_Entity);
return N_To_E (Nodes.Table (E + 1).Nkind);
end Ekind;
--------------
-- Ekind_In --
--------------
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6 or else
T = V7;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6 or else
T = V7 or else
T = V8;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind;
V9 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6 or else
T = V7 or else
T = V8 or else
T = V9;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind;
V9 : Entity_Kind;
V10 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6 or else
T = V7 or else
T = V8 or else
T = V9 or else
T = V10;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind;
V9 : Entity_Kind;
V10 : Entity_Kind;
V11 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6 or else
T = V7 or else
T = V8 or else
T = V9 or else
T = V10 or else
T = V11;
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6, V7);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6, V7, V8);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind;
V9 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6, V7, V8, V9);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind;
V9 : Entity_Kind;
V10 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6, V7, V8, V9, V10);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind;
V9 : Entity_Kind;
V10 : Entity_Kind;
V11 : Entity_Kind) return Boolean
is
begin
return
Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6, V7, V8, V9, V10, V11);
end Ekind_In;
------------------------
-- Set_Reporting_Proc --
------------------------
procedure Set_Reporting_Proc (P : Report_Proc) is
begin
pragma Assert (Reporting_Proc = null);
Reporting_Proc := P;
end Set_Reporting_Proc;
------------------
-- Error_Posted --
------------------
function Error_Posted (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Error_Posted;
end Error_Posted;
-----------------------
-- Exchange_Entities --
-----------------------
procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
Temp_Ent : Node_Record;
Temp_Flg : Flags_Byte;
begin
pragma Assert (True
and then Has_Extension (E1)
and then Has_Extension (E2)
and then not Nodes.Table (E1).In_List
and then not Nodes.Table (E2).In_List);
-- Exchange the contents of the two entities
for J in 0 .. Num_Extension_Nodes loop
Temp_Ent := Nodes.Table (E1 + J);
Nodes.Table (E1 + J) := Nodes.Table (E2 + J);
Nodes.Table (E2 + J) := Temp_Ent;
end loop;
-- Exchange flag bytes for first component. No need to do the exchange
-- for the other components, since the flag bytes are always zero.
Temp_Flg := Flags.Table (E1);
Flags.Table (E1) := Flags.Table (E2);
Flags.Table (E2) := Temp_Flg;
-- That exchange exchanged the parent pointers as well, which is what
-- we want, but we need to patch up the defining identifier pointers
-- in the parent nodes (the child pointers) to match this switch
-- unless for Implicit types entities which have no parent, in which
-- case we don't do anything otherwise we won't be able to revert back
-- to the original situation.
-- Shouldn't this use Is_Itype instead of the Parent test
if Present (Parent (E1)) and then Present (Parent (E2)) then
Set_Defining_Identifier (Parent (E1), E1);
Set_Defining_Identifier (Parent (E2), E2);
end if;
end Exchange_Entities;
-----------------
-- Extend_Node --
-----------------
function Extend_Node (Node : Node_Id) return Entity_Id is
Result : Entity_Id;
procedure Debug_Extend_Node;
pragma Inline (Debug_Extend_Node);
-- Debug routine for debug flag N
-----------------------
-- Debug_Extend_Node --
-----------------------
procedure Debug_Extend_Node is
begin
if Debug_Flag_N then
Write_Str ("Extend node ");
Write_Int (Int (Node));
if Result = Node then
Write_Str (" in place");
else
Write_Str (" copied to ");
Write_Int (Int (Result));
end if;
-- Write_Eol;
end if;
end Debug_Extend_Node;
-- Start of processing for Extend_Node
begin
pragma Assert (not (Has_Extension (Node)));
Result := Allocate_Initialize_Node (Node, With_Extension => True);
pragma Debug (Debug_Extend_Node);
return Result;
end Extend_Node;
-----------------
-- Fix_Parents --
-----------------
procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id) is
procedure Fix_Parent (Field : Union_Id);
-- Fix up one parent pointer. Field is checked to see if it points to
-- a node, list, or element list that has a parent that points to
-- Ref_Node. If so, the parent is reset to point to Fix_Node.
----------------
-- Fix_Parent --
----------------
procedure Fix_Parent (Field : Union_Id) is
begin
-- Fix parent of node that is referenced by Field. Note that we must
-- exclude the case where the node is a member of a list, because in
-- this case the parent is the parent of the list.
if Field in Node_Range
and then Present (Node_Id (Field))
and then not Nodes.Table (Node_Id (Field)).In_List
and then Parent (Node_Id (Field)) = Ref_Node
then
Set_Parent (Node_Id (Field), Fix_Node);
-- Fix parent of list that is referenced by Field
elsif Field in List_Range
and then Present (List_Id (Field))
and then Parent (List_Id (Field)) = Ref_Node
then
Set_Parent (List_Id (Field), Fix_Node);
end if;
end Fix_Parent;
-- Start of processing for Fix_Parents
begin
Fix_Parent (Field1 (Fix_Node));
Fix_Parent (Field2 (Fix_Node));
Fix_Parent (Field3 (Fix_Node));
Fix_Parent (Field4 (Fix_Node));
Fix_Parent (Field5 (Fix_Node));
end Fix_Parents;
-------------------
-- Flags_Address --
-------------------
function Flags_Address return System.Address is
begin
return Flags.Table (First_Node_Id)'Address;
end Flags_Address;
-----------------------------------
-- Get_Comes_From_Source_Default --
-----------------------------------
function Get_Comes_From_Source_Default return Boolean is
begin
return Default_Node.Comes_From_Source;
end Get_Comes_From_Source_Default;
-----------------
-- Has_Aspects --
-----------------
function Has_Aspects (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Has_Aspects;
end Has_Aspects;
-------------------
-- Has_Extension --
-------------------
function Has_Extension (N : Node_Id) return Boolean is
begin
return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
end Has_Extension;
----------------
-- Initialize --
----------------
procedure Initialize is
Dummy : Node_Id;
pragma Warnings (Off, Dummy);
begin
Node_Count := 0;
Atree_Private_Part.Nodes.Init;
Atree_Private_Part.Flags.Init;
Orig_Nodes.Init;
Paren_Counts.Init;
-- Allocate Empty node
Dummy := New_Node (N_Empty, No_Location);
Set_Name1 (Empty, No_Name);
-- Allocate Error node, and set Error_Posted, since we certainly
-- only generate an Error node if we do post some kind of error.
Dummy := New_Node (N_Error, No_Location);
Set_Name1 (Error, Error_Name);
Set_Error_Posted (Error, True);
end Initialize;
---------------------------
-- Is_Ignored_Ghost_Node --
---------------------------
function Is_Ignored_Ghost_Node (N : Node_Id) return Boolean is
begin
return Flags.Table (N).Is_Ignored_Ghost_Node;
end Is_Ignored_Ghost_Node;
--------------------------
-- Is_Rewrite_Insertion --
--------------------------
function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
begin
return Nodes.Table (Node).Rewrite_Ins;
end Is_Rewrite_Insertion;
-----------------------------
-- Is_Rewrite_Substitution --
-----------------------------
function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
begin
return Orig_Nodes.Table (Node) /= Node;
end Is_Rewrite_Substitution;
------------------
-- Last_Node_Id --
------------------
function Last_Node_Id return Node_Id is
begin
return Nodes.Last;
end Last_Node_Id;
----------
-- Lock --
----------
procedure Lock is
begin
Nodes.Locked := True;
Flags.Locked := True;
Orig_Nodes.Locked := True;
Nodes.Release;
Flags.Release;
Orig_Nodes.Release;
end Lock;
----------------
-- Lock_Nodes --
----------------
procedure Lock_Nodes is
begin
pragma Assert (not Locked);
Locked := True;
end Lock_Nodes;
-------------------------
-- Mark_New_Ghost_Node --
-------------------------
procedure Mark_New_Ghost_Node (N : Node_Or_Entity_Id) is
begin
-- The Ghost node is created within a Ghost region
if Ghost_Mode = Check then
if Nkind (N) in N_Entity then
Set_Is_Checked_Ghost_Entity (N);
end if;
elsif Ghost_Mode = Ignore then
if Nkind (N) in N_Entity then
Set_Is_Ignored_Ghost_Entity (N);
end if;
Set_Is_Ignored_Ghost_Node (N);
end if;
end Mark_New_Ghost_Node;
----------------------------
-- Mark_Rewrite_Insertion --
----------------------------
procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
begin
Nodes.Table (New_Node).Rewrite_Ins := True;
end Mark_Rewrite_Insertion;
--------------
-- New_Copy --
--------------
function New_Copy (Source : Node_Id) return Node_Id is
New_Id : Node_Id := Source;
begin
if Source > Empty_Or_Error then
New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
Nodes.Table (New_Id).Link := Empty_List_Or_Node;
Nodes.Table (New_Id).In_List := False;
-- If the original is marked as a rewrite insertion, then unmark the
-- copy, since we inserted the original, not the copy.
Nodes.Table (New_Id).Rewrite_Ins := False;
pragma Debug (New_Node_Debugging_Output (New_Id));
-- Clear Is_Overloaded since we cannot have semantic interpretations
-- of this new node.
if Nkind (Source) in N_Subexpr then
Set_Is_Overloaded (New_Id, False);
end if;
-- Always clear Has_Aspects, the caller must take care of copying
-- aspects if this is required for the particular situation.
Set_Has_Aspects (New_Id, False);
-- Mark the copy as Ghost depending on the current Ghost region
Mark_New_Ghost_Node (New_Id);
end if;
return New_Id;
end New_Copy;
----------------
-- New_Entity --
----------------
function New_Entity
(New_Node_Kind : Node_Kind;
New_Sloc : Source_Ptr) return Entity_Id
is
Ent : Entity_Id;
begin
pragma Assert (New_Node_Kind in N_Entity);
Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
-- If this is a node with a real location and we are generating
-- source nodes, then reset Current_Error_Node. This is useful
-- if we bomb during parsing to get a error location for the bomb.
if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
Current_Error_Node := Ent;
end if;
Nodes.Table (Ent).Nkind := New_Node_Kind;
Nodes.Table (Ent).Sloc := New_Sloc;
pragma Debug (New_Node_Debugging_Output (Ent));
-- Mark the new entity as Ghost depending on the current Ghost region
Mark_New_Ghost_Node (Ent);
return Ent;
end New_Entity;
--------------
-- New_Node --
--------------
function New_Node
(New_Node_Kind : Node_Kind;
New_Sloc : Source_Ptr) return Node_Id
is
Nod : Node_Id;
begin
pragma Assert (New_Node_Kind not in N_Entity);
Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
Nodes.Table (Nod).Nkind := New_Node_Kind;
Nodes.Table (Nod).Sloc := New_Sloc;
pragma Debug (New_Node_Debugging_Output (Nod));
-- If this is a node with a real location and we are generating source
-- nodes, then reset Current_Error_Node. This is useful if we bomb
-- during parsing to get an error location for the bomb.
if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
Current_Error_Node := Nod;
end if;
-- Mark the new node as Ghost depending on the current Ghost region
Mark_New_Ghost_Node (Nod);
return Nod;
end New_Node;
-------------------------
-- New_Node_Breakpoint --
-------------------------
procedure nn is
begin
Write_Str ("Watched node ");
Write_Int (Int (Watch_Node));
Write_Str (" created");
Write_Eol;
end nn;
-------------------------------
-- New_Node_Debugging_Output --
-------------------------------
procedure nnd (N : Node_Id) is
Node_Is_Watched : constant Boolean := N = Watch_Node;
begin
if Debug_Flag_N or else Node_Is_Watched then
Node_Debug_Output ("Allocate", N);
if Node_Is_Watched then
New_Node_Breakpoint;
end if;
end if;
end nnd;
-----------
-- Nkind --
-----------
function Nkind (N : Node_Id) return Node_Kind is
begin
return Nodes.Table (N).Nkind;
end Nkind;
--------------
-- Nkind_In --
--------------
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind;
V7 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind;
V7 : Node_Kind;
V8 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind;
V7 : Node_Kind;
V8 : Node_Kind;
V9 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8, V9);
end Nkind_In;
--------
-- No --
--------
function No (N : Node_Id) return Boolean is
begin
return N = Empty;
end No;
-----------------------
-- Node_Debug_Output --
-----------------------
procedure Node_Debug_Output (Op : String; N : Node_Id) is
begin
Write_Str (Op);
if Nkind (N) in N_Entity then
Write_Str (" entity");
else
Write_Str (" node");
end if;
Write_Str (" Id = ");
Write_Int (Int (N));
Write_Str (" ");
Write_Location (Sloc (N));
Write_Str (" ");
Write_Str (Node_Kind'Image (Nkind (N)));
Write_Eol;
end Node_Debug_Output;
-------------------
-- Nodes_Address --
-------------------
function Nodes_Address return System.Address is
begin
return Nodes.Table (First_Node_Id)'Address;
end Nodes_Address;
---------------
-- Num_Nodes --
---------------
function Num_Nodes return Nat is
begin
return Node_Count;
end Num_Nodes;
-------------------
-- Original_Node --
-------------------
function Original_Node (Node : Node_Id) return Node_Id is
begin
return Orig_Nodes.Table (Node);
end Original_Node;
-----------------
-- Paren_Count --
-----------------
function Paren_Count (N : Node_Id) return Nat is
C : Nat := 0;
begin
pragma Assert (N <= Nodes.Last);
if Nodes.Table (N).Pflag1 then
C := C + 1;
end if;
if Nodes.Table (N).Pflag2 then
C := C + 2;
end if;
-- Value of 0,1,2 returned as is
if C <= 2 then
return C;
-- Value of 3 means we search the table, and we must find an entry
else
for J in Paren_Counts.First .. Paren_Counts.Last loop
if N = Paren_Counts.Table (J).Nod then
return Paren_Counts.Table (J).Count;
end if;
end loop;
raise Program_Error;
end if;
end Paren_Count;
------------
-- Parent --
------------
function Parent (N : Node_Id) return Node_Id is
begin
if Is_List_Member (N) then
return Parent (List_Containing (N));
else
return Node_Id (Nodes.Table (N).Link);
end if;
end Parent;
-------------
-- Present --
-------------
function Present (N : Node_Id) return Boolean is
begin
return N /= Empty;
end Present;
--------------------------------
-- Preserve_Comes_From_Source --
--------------------------------
procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
begin
Nodes.Table (NewN).Comes_From_Source :=
Nodes.Table (OldN).Comes_From_Source;
end Preserve_Comes_From_Source;
----------------------
-- Print_Statistics --
----------------------
procedure Print_Statistics is
N_Count : constant Natural := Natural (Nodes.Last - First_Node_Id + 1);
E_Count : Natural := 0;
begin
Write_Str ("Number of entities: ");
Write_Eol;
declare
function CP_Lt (Op1, Op2 : Natural) return Boolean;
-- Compare routine for Sort
procedure CP_Move (From : Natural; To : Natural);
-- Move routine for Sort
Kind_Count : array (Node_Kind) of Natural := (others => 0);
-- Array of occurrence count per node kind
Kind_Max : constant Natural := Node_Kind'Pos (N_Unused_At_End) - 1;
-- The index of the largest (interesting) node kind
Ranking : array (0 .. Kind_Max) of Node_Kind;
-- Ranking array for node kinds (index 0 is used for the temporary)
package Sorting is new GNAT.Heap_Sort_G (CP_Move, CP_Lt);
function CP_Lt (Op1, Op2 : Natural) return Boolean is
begin
return Kind_Count (Ranking (Op2)) < Kind_Count (Ranking (Op1));
end CP_Lt;
procedure CP_Move (From : Natural; To : Natural) is
begin
Ranking (To) := Ranking (From);
end CP_Move;
begin
-- Count the number of occurrences of each node kind
for I in First_Node_Id .. Nodes.Last loop
declare
Nkind : constant Node_Kind := Nodes.Table (I).Nkind;
begin
if not Nodes.Table (I).Is_Extension then
Kind_Count (Nkind) := Kind_Count (Nkind) + 1;
end if;
end;
end loop;
-- Sort the node kinds by number of occurrences
for N in 1 .. Kind_Max loop
Ranking (N) := Node_Kind'Val (N);
end loop;
Sorting.Sort (Kind_Max);
-- Print the list in descending order
for N in 1 .. Kind_Max loop
declare
Count : constant Natural := Kind_Count (Ranking (N));
begin
if Count > 0 then
Write_Str (" ");
Write_Str (Node_Kind'Image (Ranking (N)));
Write_Str (": ");
Write_Int (Int (Count));
Write_Eol;
E_Count := E_Count + Count;
end if;
end;
end loop;
end;
Write_Str ("Total number of entities: ");
Write_Int (Int (E_Count));
Write_Eol;
Write_Str ("Maximum number of nodes per entity: ");
Write_Int (Int (Num_Extension_Nodes + 1));
Write_Eol;
Write_Str ("Number of allocated nodes: ");
Write_Int (Int (N_Count));
Write_Eol;
Write_Str ("Ratio allocated nodes/entities: ");
Write_Int (Int (Long_Long_Integer (N_Count) * 100 /
Long_Long_Integer (E_Count)));
Write_Str ("/100");
Write_Eol;
Write_Str ("Size of a node in bytes: ");
Write_Int (Int (Node_Record'Size) / Storage_Unit);
Write_Eol;
Write_Str ("Memory consumption in bytes: ");
Write_Int (Int (Long_Long_Integer (N_Count) *
(Node_Record'Size / Storage_Unit)));
Write_Eol;
end Print_Statistics;
-------------------
-- Relocate_Node --
-------------------
function Relocate_Node (Source : Node_Id) return Node_Id is
New_Node : Node_Id;
begin
if No (Source) then
return Empty;
end if;
New_Node := New_Copy (Source);
Fix_Parents (Ref_Node => Source, Fix_Node => New_Node);
-- We now set the parent of the new node to be the same as the parent of
-- the source. Almost always this parent will be replaced by a new value
-- when the relocated node is reattached to the tree, but by doing it
-- now, we ensure that this node is not even temporarily disconnected
-- from the tree. Note that this does not happen free, because in the
-- list case, the parent does not get set.
Set_Parent (New_Node, Parent (Source));
-- If the node being relocated was a rewriting of some original node,
-- then the relocated node has the same original node.
if Orig_Nodes.Table (Source) /= Source then
Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
end if;
return New_Node;
end Relocate_Node;
-------------
-- Replace --
-------------
procedure Replace (Old_Node, New_Node : Node_Id) is
Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
Old_HasA : constant Boolean := Nodes.Table (Old_Node).Has_Aspects;
Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
begin
pragma Assert
(not Has_Extension (Old_Node)
and not Has_Extension (New_Node)
and not Nodes.Table (New_Node).In_List);
-- Do copy, preserving link and in list status and required flags
Copy_Node (Source => New_Node, Destination => Old_Node);
Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
Nodes.Table (Old_Node).Error_Posted := Old_Post;
Nodes.Table (Old_Node).Has_Aspects := Old_HasA;
-- Fix parents of substituted node, since it has changed identity
Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
-- Since we are doing a replace, we assume that the original node
-- is intended to become the new replaced node. The call would be
-- to Rewrite if there were an intention to save the original node.
Orig_Nodes.Table (Old_Node) := Old_Node;
-- Invoke the reporting procedure (if available)
if Reporting_Proc /= null then
Reporting_Proc.all (Target => Old_Node, Source => New_Node);
end if;
end Replace;
-------------
-- Rewrite --
-------------
procedure Rewrite (Old_Node, New_Node : Node_Id) is
Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
-- This field is always preserved in the new node
Old_Has_Aspects : constant Boolean := Nodes.Table (Old_Node).Has_Aspects;
-- This field is always preserved in the new node
Old_Paren_Count : Nat;
Old_Must_Not_Freeze : Boolean;
-- These fields are preserved in the new node only if the new node
-- and the old node are both subexpression nodes.
-- Note: it is a violation of abstraction levels for Must_Not_Freeze
-- to be referenced like this. ???
Sav_Node : Node_Id;
begin
pragma Assert
(not Has_Extension (Old_Node)
and not Has_Extension (New_Node)
and not Nodes.Table (New_Node).In_List);
pragma Debug (Rewrite_Debugging_Output (Old_Node, New_Node));
if Nkind (Old_Node) in N_Subexpr then
Old_Paren_Count := Paren_Count (Old_Node);
Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
else
Old_Paren_Count := 0;
Old_Must_Not_Freeze := False;
end if;
-- Allocate a new node, to be used to preserve the original contents
-- of the Old_Node, for possible later retrival by Original_Node and
-- make an entry in the Orig_Nodes table. This is only done if we have
-- not already rewritten the node, as indicated by an Orig_Nodes entry
-- that does not reference the Old_Node.
if Orig_Nodes.Table (Old_Node) = Old_Node then
Sav_Node := New_Copy (Old_Node);
Orig_Nodes.Table (Sav_Node) := Sav_Node;
Orig_Nodes.Table (Old_Node) := Sav_Node;
-- Both the old and new copies of the node will share the same list
-- of aspect specifications if aspect specifications are present.
if Old_Has_Aspects then
Set_Aspect_Specifications
(Sav_Node, Aspect_Specifications (Old_Node));
end if;
end if;
-- Copy substitute node into place, preserving old fields as required
Copy_Node (Source => New_Node, Destination => Old_Node);
Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
Nodes.Table (Old_Node).Has_Aspects := Old_Has_Aspects;
if Nkind (New_Node) in N_Subexpr then
Set_Paren_Count (Old_Node, Old_Paren_Count);
Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
end if;
Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
-- Invoke the reporting procedure (if available)
if Reporting_Proc /= null then
Reporting_Proc.all (Target => Old_Node, Source => New_Node);
end if;
end Rewrite;
-------------------------
-- Rewrite_Breakpoint --
-------------------------
procedure rr is
begin
Write_Str ("Watched node ");
Write_Int (Int (Watch_Node));
Write_Str (" rewritten");
Write_Eol;
end rr;
------------------------------
-- Rewrite_Debugging_Output --
------------------------------
procedure rrd (Old_Node, New_Node : Node_Id) is
Node_Is_Watched : constant Boolean := Old_Node = Watch_Node;
begin
if Debug_Flag_N or else Node_Is_Watched then
Node_Debug_Output ("Rewrite", Old_Node);
Node_Debug_Output ("into", New_Node);
if Node_Is_Watched then
Rewrite_Breakpoint;
end if;
end if;
end rrd;
------------------
-- Set_Analyzed --
------------------
procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Analyzed := Val;
end Set_Analyzed;
-----------------------
-- Set_Check_Actuals --
-----------------------
procedure Set_Check_Actuals (N : Node_Id; Val : Boolean := True) is
begin
pragma Assert (not Locked);
Flags.Table (N).Check_Actuals := Val;
end Set_Check_Actuals;
---------------------------
-- Set_Comes_From_Source --
---------------------------
procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Comes_From_Source := Val;
end Set_Comes_From_Source;
-----------------------------------
-- Set_Comes_From_Source_Default --
-----------------------------------
procedure Set_Comes_From_Source_Default (Default : Boolean) is
begin
Default_Node.Comes_From_Source := Default;
end Set_Comes_From_Source_Default;
---------------
-- Set_Ekind --
---------------
procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (E) in N_Entity);
Nodes.Table (E + 1).Nkind := E_To_N (Val);
end Set_Ekind;
----------------------
-- Set_Error_Posted --
----------------------
procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Error_Posted := Val;
end Set_Error_Posted;
---------------------
-- Set_Has_Aspects --
---------------------
procedure Set_Has_Aspects (N : Node_Id; Val : Boolean := True) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Has_Aspects := Val;
end Set_Has_Aspects;
-------------------------------
-- Set_Is_Ignored_Ghost_Node --
-------------------------------
procedure Set_Is_Ignored_Ghost_Node (N : Node_Id; Val : Boolean := True) is
begin
pragma Assert (not Locked);
Flags.Table (N).Is_Ignored_Ghost_Node := Val;
end Set_Is_Ignored_Ghost_Node;
-----------------------
-- Set_Original_Node --
-----------------------
procedure Set_Original_Node (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
Orig_Nodes.Table (N) := Val;
end Set_Original_Node;
---------------------
-- Set_Paren_Count --
---------------------
procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Subexpr);
-- Value of 0,1,2 stored as is
if Val <= 2 then
Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
Nodes.Table (N).Pflag2 := (Val = 2);
-- Value of 3 or greater stores 3 in node and makes table entry
else
Nodes.Table (N).Pflag1 := True;
Nodes.Table (N).Pflag2 := True;
for J in Paren_Counts.First .. Paren_Counts.Last loop
if N = Paren_Counts.Table (J).Nod then
Paren_Counts.Table (J).Count := Val;
return;
end if;
end loop;
Paren_Counts.Append ((Nod => N, Count => Val));
end if;
end Set_Paren_Count;
----------------
-- Set_Parent --
----------------
procedure Set_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (not Nodes.Table (N).In_List);
Nodes.Table (N).Link := Union_Id (Val);
end Set_Parent;
--------------
-- Set_Sloc --
--------------
procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Sloc := Val;
end Set_Sloc;
----------
-- Sloc --
----------
function Sloc (N : Node_Id) return Source_Ptr is
begin
return Nodes.Table (N).Sloc;
end Sloc;
-------------------
-- Traverse_Func --
-------------------
function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
function Traverse_Field
(Nod : Node_Id;
Fld : Union_Id;
FN : Field_Num) return Traverse_Final_Result;
-- Fld is one of the fields of Nod. If the field points to syntactic
-- node or list, then this node or list is traversed, and the result is
-- the result of this traversal. Otherwise a value of True is returned
-- with no processing. FN is the number of the field (1 .. 5).
--------------------
-- Traverse_Field --
--------------------
function Traverse_Field
(Nod : Node_Id;
Fld : Union_Id;
FN : Field_Num) return Traverse_Final_Result
is
begin
if Fld = Union_Id (Empty) then
return OK;
-- Descendant is a node
elsif Fld in Node_Range then
-- Traverse descendant that is syntactic subtree node
if Is_Syntactic_Field (Nkind (Nod), FN) then
return Traverse_Func (Node_Id (Fld));
-- Node that is not a syntactic subtree
else
return OK;
end if;
-- Descendant is a list
elsif Fld in List_Range then
-- Traverse descendant that is a syntactic subtree list
if Is_Syntactic_Field (Nkind (Nod), FN) then
declare
Elmt : Node_Id := First (List_Id (Fld));
begin
while Present (Elmt) loop
if Traverse_Func (Elmt) = Abandon then
return Abandon;
else
Next (Elmt);
end if;
end loop;
return OK;
end;
-- List that is not a syntactic subtree
else
return OK;
end if;
-- Field was not a node or a list
else
return OK;
end if;
end Traverse_Field;
Cur_Node : Node_Id := Node;
-- Start of processing for Traverse_Func
begin
-- We walk Field2 last, and if it is a node, we eliminate the tail
-- recursion by jumping back to this label. This is because Field2 is
-- where the Left_Opnd field of N_Op_Concat is stored, and in practice
-- concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
-- trick prevents us from running out of memory in that case. We don't
-- bother eliminating the tail recursion if Field2 is a list.
<<Tail_Recurse>>
case Process (Cur_Node) is
when Abandon =>
return Abandon;
when Skip =>
return OK;
when OK =>
null;
when OK_Orig =>
Cur_Node := Original_Node (Cur_Node);
end case;
if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
or else -- skip Field2 here
Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
or else
Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
or else
Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
then
return Abandon;
end if;
if Field2 (Cur_Node) not in Node_Range then
return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
elsif Is_Syntactic_Field (Nkind (Cur_Node), 2)
and then Field2 (Cur_Node) /= Empty_List_Or_Node
then
-- Here is the tail recursion step, we reset Cur_Node and jump back
-- to the start of the procedure, which has the same semantic effect
-- as a call.
Cur_Node := Node_Id (Field2 (Cur_Node));
goto Tail_Recurse;
end if;
return OK;
end Traverse_Func;
-------------------
-- Traverse_Proc --
-------------------
procedure Traverse_Proc (Node : Node_Id) is
function Traverse is new Traverse_Func (Process);
Discard : Traverse_Final_Result;
pragma Warnings (Off, Discard);
begin
Discard := Traverse (Node);
end Traverse_Proc;
---------------
-- Tree_Read --
---------------
procedure Tree_Read is
begin
Tree_Read_Int (Node_Count);
Nodes.Tree_Read;
Flags.Tree_Read;
Orig_Nodes.Tree_Read;
Paren_Counts.Tree_Read;
end Tree_Read;
----------------
-- Tree_Write --
----------------
procedure Tree_Write is
begin
Tree_Write_Int (Node_Count);
Nodes.Tree_Write;
Flags.Tree_Write;
Orig_Nodes.Tree_Write;
Paren_Counts.Tree_Write;
end Tree_Write;
------------------------------
-- Unchecked Access Package --
------------------------------
package body Unchecked_Access is
function Field1 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field1;
end Field1;
function Field2 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field2;
end Field2;
function Field3 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field3;
end Field3;
function Field4 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field4;
end Field4;
function Field5 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field5;
end Field5;
function Field6 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field6;
end Field6;
function Field7 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field7;
end Field7;
function Field8 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field8;
end Field8;
function Field9 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field9;
end Field9;
function Field10 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field10;
end Field10;
function Field11 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field11;
end Field11;
function Field12 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field12;
end Field12;
function Field13 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field6;
end Field13;
function Field14 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field7;
end Field14;
function Field15 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field8;
end Field15;
function Field16 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field9;
end Field16;
function Field17 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field10;
end Field17;
function Field18 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field11;
end Field18;
function Field19 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field6;
end Field19;
function Field20 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field7;
end Field20;
function Field21 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field8;
end Field21;
function Field22 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field9;
end Field22;
function Field23 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field10;
end Field23;
function Field24 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field6;
end Field24;
function Field25 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field7;
end Field25;
function Field26 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field8;
end Field26;
function Field27 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field9;
end Field27;
function Field28 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field10;
end Field28;
function Field29 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field11;
end Field29;
function Field30 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field6;
end Field30;
function Field31 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field7;
end Field31;
function Field32 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field8;
end Field32;
function Field33 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field9;
end Field33;
function Field34 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field10;
end Field34;
function Field35 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field11;
end Field35;
function Field36 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 6).Field6;
end Field36;
function Field37 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 6).Field7;
end Field37;
function Field38 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 6).Field8;
end Field38;
function Field39 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 6).Field9;
end Field39;
function Field40 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 6).Field10;
end Field40;
function Field41 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 6).Field11;
end Field41;
function Node1 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field1);
end Node1;
function Node2 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field2);
end Node2;
function Node3 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field3);
end Node3;
function Node4 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field4);
end Node4;
function Node5 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field5);
end Node5;
function Node6 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field6);
end Node6;
function Node7 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field7);
end Node7;
function Node8 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field8);
end Node8;
function Node9 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field9);
end Node9;
function Node10 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field10);
end Node10;
function Node11 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field11);
end Node11;
function Node12 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field12);
end Node12;
function Node13 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field6);
end Node13;
function Node14 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field7);
end Node14;
function Node15 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field8);
end Node15;
function Node16 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field9);
end Node16;
function Node17 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field10);
end Node17;
function Node18 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field11);
end Node18;
function Node19 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field6);
end Node19;
function Node20 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field7);
end Node20;
function Node21 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field8);
end Node21;
function Node22 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field9);
end Node22;
function Node23 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field10);
end Node23;
function Node24 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field6);
end Node24;
function Node25 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field7);
end Node25;
function Node26 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field8);
end Node26;
function Node27 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field9);
end Node27;
function Node28 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field10);
end Node28;
function Node29 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field11);
end Node29;
function Node30 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field6);
end Node30;
function Node31 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field7);
end Node31;
function Node32 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field8);
end Node32;
function Node33 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field9);
end Node33;
function Node34 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field10);
end Node34;
function Node35 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field11);
end Node35;
function Node36 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 6).Field6);
end Node36;
function Node37 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 6).Field7);
end Node37;
function Node38 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 6).Field8);
end Node38;
function Node39 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 6).Field9);
end Node39;
function Node40 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 6).Field10);
end Node40;
function Node41 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 6).Field11);
end Node41;
function List1 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field1);
end List1;
function List2 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field2);
end List2;
function List3 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field3);
end List3;
function List4 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field4);
end List4;
function List5 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field5);
end List5;
function List10 (N : Node_Id) return List_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return List_Id (Nodes.Table (N + 1).Field10);
end List10;
function List14 (N : Node_Id) return List_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return List_Id (Nodes.Table (N + 2).Field7);
end List14;
function List25 (N : Node_Id) return List_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return List_Id (Nodes.Table (N + 4).Field7);
end List25;
function List38 (N : Node_Id) return List_Id is
begin
return List_Id (Nodes.Table (N + 6).Field8);
end List38;
function List39 (N : Node_Id) return List_Id is
begin
return List_Id (Nodes.Table (N + 6).Field9);
end List39;
function Elist1 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field1;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist1;
function Elist2 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field2;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist2;
function Elist3 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field3;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist3;
function Elist4 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field4;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist4;
function Elist5 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field5;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist5;
function Elist8 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 1).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist8;
function Elist9 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 1).Field9;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist9;
function Elist10 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 1).Field10;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist10;
function Elist11 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 1).Field11;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist11;
function Elist13 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field6;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist13;
function Elist15 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist15;
function Elist16 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field9;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist16;
function Elist18 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field11;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist18;
function Elist21 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 3).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist21;
function Elist23 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 3).Field10;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist23;
function Elist24 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 4).Field6;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist24;
function Elist25 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 4).Field7;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist25;
function Elist26 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 4).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist26;
function Elist29 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 4).Field11;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist29;
function Elist36 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 6).Field6;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist36;
function Name1 (N : Node_Id) return Name_Id is
begin
pragma Assert (N <= Nodes.Last);
return Name_Id (Nodes.Table (N).Field1);
end Name1;
function Name2 (N : Node_Id) return Name_Id is
begin
pragma Assert (N <= Nodes.Last);
return Name_Id (Nodes.Table (N).Field2);
end Name2;
function Str3 (N : Node_Id) return String_Id is
begin
pragma Assert (N <= Nodes.Last);
return String_Id (Nodes.Table (N).Field3);
end Str3;
function Uint2 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field2;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint2;
function Uint3 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field3;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint3;
function Uint4 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field4;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint4;
function Uint5 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field5;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint5;
function Uint8 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field8;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint8;
function Uint9 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field9;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint9;
function Uint10 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field10;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint10;
function Uint11 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field11;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint11;
function Uint12 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field12;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint12;
function Uint13 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field6;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint13;
function Uint14 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field7;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint14;
function Uint15 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field8;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint15;
function Uint16 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field9;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint16;
function Uint17 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field10;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint17;
function Uint22 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 3).Field9;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint22;
function Uint24 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 4).Field6;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint24;
function Ureal3 (N : Node_Id) return Ureal is
begin
pragma Assert (N <= Nodes.Last);
return From_Union (Nodes.Table (N).Field3);
end Ureal3;
function Ureal18 (N : Node_Id) return Ureal is
begin
pragma Assert (Nkind (N) in N_Entity);
return From_Union (Nodes.Table (N + 2).Field11);
end Ureal18;
function Ureal21 (N : Node_Id) return Ureal is
begin
pragma Assert (Nkind (N) in N_Entity);
return From_Union (Nodes.Table (N + 3).Field8);
end Ureal21;
function Flag0 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag0;
end Flag0;
function Flag1 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag1;
end Flag1;
function Flag2 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag2;
end Flag2;
function Flag3 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag3;
end Flag3;
function Flag4 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag4;
end Flag4;
function Flag5 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag5;
end Flag5;
function Flag6 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag6;
end Flag6;
function Flag7 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag7;
end Flag7;
function Flag8 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag8;
end Flag8;
function Flag9 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag9;
end Flag9;
function Flag10 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag10;
end Flag10;
function Flag11 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag11;
end Flag11;
function Flag12 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag12;
end Flag12;
function Flag13 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag13;
end Flag13;
function Flag14 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag14;
end Flag14;
function Flag15 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag15;
end Flag15;
function Flag16 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag16;
end Flag16;
function Flag17 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag17;
end Flag17;
function Flag18 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag18;
end Flag18;
function Flag19 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).In_List;
end Flag19;
function Flag20 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Has_Aspects;
end Flag20;
function Flag21 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Rewrite_Ins;
end Flag21;
function Flag22 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Analyzed;
end Flag22;
function Flag23 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Comes_From_Source;
end Flag23;
function Flag24 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Error_Posted;
end Flag24;
function Flag25 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag4;
end Flag25;
function Flag26 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag5;
end Flag26;
function Flag27 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag6;
end Flag27;
function Flag28 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag7;
end Flag28;
function Flag29 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag8;
end Flag29;
function Flag30 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag9;
end Flag30;
function Flag31 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag10;
end Flag31;
function Flag32 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag11;
end Flag32;
function Flag33 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag12;
end Flag33;
function Flag34 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag13;
end Flag34;
function Flag35 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag14;
end Flag35;
function Flag36 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag15;
end Flag36;
function Flag37 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag16;
end Flag37;
function Flag38 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag17;
end Flag38;
function Flag39 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag18;
end Flag39;
function Flag40 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).In_List;
end Flag40;
function Flag41 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Has_Aspects;
end Flag41;
function Flag42 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Rewrite_Ins;
end Flag42;
function Flag43 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Analyzed;
end Flag43;
function Flag44 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Comes_From_Source;
end Flag44;
function Flag45 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Error_Posted;
end Flag45;
function Flag46 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag4;
end Flag46;
function Flag47 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag5;
end Flag47;
function Flag48 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag6;
end Flag48;
function Flag49 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag7;
end Flag49;
function Flag50 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag8;
end Flag50;
function Flag51 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag9;
end Flag51;
function Flag52 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag10;
end Flag52;
function Flag53 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag11;
end Flag53;
function Flag54 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag12;
end Flag54;
function Flag55 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag13;
end Flag55;
function Flag56 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag14;
end Flag56;
function Flag57 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag15;
end Flag57;
function Flag58 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag16;
end Flag58;
function Flag59 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag17;
end Flag59;
function Flag60 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag18;
end Flag60;
function Flag61 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Pflag1;
end Flag61;
function Flag62 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Pflag2;
end Flag62;
function Flag63 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Pflag1;
end Flag63;
function Flag64 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Pflag2;
end Flag64;
function Flag65 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
end Flag65;
function Flag66 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
end Flag66;
function Flag67 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
end Flag67;
function Flag68 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
end Flag68;
function Flag69 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
end Flag69;
function Flag70 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
end Flag70;
function Flag71 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
end Flag71;
function Flag72 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
end Flag72;
function Flag73 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
end Flag73;
function Flag74 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
end Flag74;
function Flag75 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
end Flag75;
function Flag76 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
end Flag76;
function Flag77 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
end Flag77;
function Flag78 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
end Flag78;
function Flag79 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
end Flag79;
function Flag80 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
end Flag80;
function Flag81 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
end Flag81;
function Flag82 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
end Flag82;
function Flag83 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
end Flag83;
function Flag84 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
end Flag84;
function Flag85 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
end Flag85;
function Flag86 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
end Flag86;
function Flag87 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
end Flag87;
function Flag88 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
end Flag88;
function Flag89 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
end Flag89;
function Flag90 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
end Flag90;
function Flag91 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
end Flag91;
function Flag92 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
end Flag92;
function Flag93 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
end Flag93;
function Flag94 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
end Flag94;
function Flag95 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
end Flag95;
function Flag96 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
end Flag96;
function Flag97 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
end Flag97;
function Flag98 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
end Flag98;
function Flag99 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
end Flag99;
function Flag100 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
end Flag100;
function Flag101 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
end Flag101;
function Flag102 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
end Flag102;
function Flag103 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
end Flag103;
function Flag104 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
end Flag104;
function Flag105 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
end Flag105;
function Flag106 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
end Flag106;
function Flag107 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
end Flag107;
function Flag108 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
end Flag108;
function Flag109 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
end Flag109;
function Flag110 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
end Flag110;
function Flag111 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
end Flag111;
function Flag112 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
end Flag112;
function Flag113 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
end Flag113;
function Flag114 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
end Flag114;
function Flag115 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
end Flag115;
function Flag116 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
end Flag116;
function Flag117 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
end Flag117;
function Flag118 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
end Flag118;
function Flag119 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
end Flag119;
function Flag120 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
end Flag120;
function Flag121 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
end Flag121;
function Flag122 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
end Flag122;
function Flag123 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
end Flag123;
function Flag124 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
end Flag124;
function Flag125 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
end Flag125;
function Flag126 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
end Flag126;
function Flag127 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
end Flag127;
function Flag128 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
end Flag128;
function Flag129 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).In_List;
end Flag129;
function Flag130 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Has_Aspects;
end Flag130;
function Flag131 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Rewrite_Ins;
end Flag131;
function Flag132 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Analyzed;
end Flag132;
function Flag133 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Comes_From_Source;
end Flag133;
function Flag134 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Error_Posted;
end Flag134;
function Flag135 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag4;
end Flag135;
function Flag136 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag5;
end Flag136;
function Flag137 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag6;
end Flag137;
function Flag138 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag7;
end Flag138;
function Flag139 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag8;
end Flag139;
function Flag140 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag9;
end Flag140;
function Flag141 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag10;
end Flag141;
function Flag142 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag11;
end Flag142;
function Flag143 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag12;
end Flag143;
function Flag144 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag13;
end Flag144;
function Flag145 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag14;
end Flag145;
function Flag146 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag15;
end Flag146;
function Flag147 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag16;
end Flag147;
function Flag148 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag17;
end Flag148;
function Flag149 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag18;
end Flag149;
function Flag150 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Pflag1;
end Flag150;
function Flag151 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Pflag2;
end Flag151;
function Flag152 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
end Flag152;
function Flag153 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
end Flag153;
function Flag154 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
end Flag154;
function Flag155 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
end Flag155;
function Flag156 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
end Flag156;
function Flag157 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
end Flag157;
function Flag158 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
end Flag158;
function Flag159 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
end Flag159;
function Flag160 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
end Flag160;
function Flag161 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
end Flag161;
function Flag162 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
end Flag162;
function Flag163 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
end Flag163;
function Flag164 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
end Flag164;
function Flag165 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
end Flag165;
function Flag166 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
end Flag166;
function Flag167 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
end Flag167;
function Flag168 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
end Flag168;
function Flag169 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
end Flag169;
function Flag170 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
end Flag170;
function Flag171 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
end Flag171;
function Flag172 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
end Flag172;
function Flag173 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
end Flag173;
function Flag174 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
end Flag174;
function Flag175 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
end Flag175;
function Flag176 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
end Flag176;
function Flag177 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
end Flag177;
function Flag178 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
end Flag178;
function Flag179 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
end Flag179;
function Flag180 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
end Flag180;
function Flag181 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
end Flag181;
function Flag182 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
end Flag182;
function Flag183 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
end Flag183;
function Flag184 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag184;
end Flag184;
function Flag185 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag185;
end Flag185;
function Flag186 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag186;
end Flag186;
function Flag187 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag187;
end Flag187;
function Flag188 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag188;
end Flag188;
function Flag189 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag189;
end Flag189;
function Flag190 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag190;
end Flag190;
function Flag191 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag191;
end Flag191;
function Flag192 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag192;
end Flag192;
function Flag193 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag193;
end Flag193;
function Flag194 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag194;
end Flag194;
function Flag195 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag195;
end Flag195;
function Flag196 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag196;
end Flag196;
function Flag197 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag197;
end Flag197;
function Flag198 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag198;
end Flag198;
function Flag199 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag199;
end Flag199;
function Flag200 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag200;
end Flag200;
function Flag201 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag201;
end Flag201;
function Flag202 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag202;
end Flag202;
function Flag203 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag203;
end Flag203;
function Flag204 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag204;
end Flag204;
function Flag205 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag205;
end Flag205;
function Flag206 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag206;
end Flag206;
function Flag207 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag207;
end Flag207;
function Flag208 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag208;
end Flag208;
function Flag209 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag209;
end Flag209;
function Flag210 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag210;
end Flag210;
function Flag211 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag211;
end Flag211;
function Flag212 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag212;
end Flag212;
function Flag213 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag213;
end Flag213;
function Flag214 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag214;
end Flag214;
function Flag215 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag215;
end Flag215;
function Flag216 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).In_List;
end Flag216;
function Flag217 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Has_Aspects;
end Flag217;
function Flag218 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Rewrite_Ins;
end Flag218;
function Flag219 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Analyzed;
end Flag219;
function Flag220 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Comes_From_Source;
end Flag220;
function Flag221 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Error_Posted;
end Flag221;
function Flag222 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag4;
end Flag222;
function Flag223 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag5;
end Flag223;
function Flag224 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag6;
end Flag224;
function Flag225 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag7;
end Flag225;
function Flag226 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag8;
end Flag226;
function Flag227 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag9;
end Flag227;
function Flag228 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag10;
end Flag228;
function Flag229 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag11;
end Flag229;
function Flag230 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag12;
end Flag230;
function Flag231 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag13;
end Flag231;
function Flag232 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag14;
end Flag232;
function Flag233 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag15;
end Flag233;
function Flag234 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag16;
end Flag234;
function Flag235 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag17;
end Flag235;
function Flag236 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag18;
end Flag236;
function Flag237 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Pflag1;
end Flag237;
function Flag238 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Pflag2;
end Flag238;
function Flag239 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag239;
end Flag239;
function Flag240 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag240;
end Flag240;
function Flag241 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag241;
end Flag241;
function Flag242 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag242;
end Flag242;
function Flag243 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag243;
end Flag243;
function Flag244 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag244;
end Flag244;
function Flag245 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag245;
end Flag245;
function Flag246 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag246;
end Flag246;
function Flag247 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag247;
end Flag247;
function Flag248 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag248;
end Flag248;
function Flag249 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag249;
end Flag249;
function Flag250 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag250;
end Flag250;
function Flag251 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag251;
end Flag251;
function Flag252 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag252;
end Flag252;
function Flag253 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag253;
end Flag253;
function Flag254 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag254;
end Flag254;
function Flag255 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag255;
end Flag255;
function Flag256 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag256;
end Flag256;
function Flag257 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag257;
end Flag257;
function Flag258 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag258;
end Flag258;
function Flag259 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag259;
end Flag259;
function Flag260 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag260;
end Flag260;
function Flag261 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag261;
end Flag261;
function Flag262 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag262;
end Flag262;
function Flag263 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag263;
end Flag263;
function Flag264 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag264;
end Flag264;
function Flag265 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag265;
end Flag265;
function Flag266 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag266;
end Flag266;
function Flag267 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag267;
end Flag267;
function Flag268 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag268;
end Flag268;
function Flag269 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag269;
end Flag269;
function Flag270 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag270;
end Flag270;
function Flag271 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag271;
end Flag271;
function Flag272 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag272;
end Flag272;
function Flag273 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag273;
end Flag273;
function Flag274 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag274;
end Flag274;
function Flag275 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag275;
end Flag275;
function Flag276 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag276;
end Flag276;
function Flag277 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag277;
end Flag277;
function Flag278 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag278;
end Flag278;
function Flag279 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag279;
end Flag279;
function Flag280 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag280;
end Flag280;
function Flag281 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag281;
end Flag281;
function Flag282 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag282;
end Flag282;
function Flag283 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag283;
end Flag283;
function Flag284 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag284;
end Flag284;
function Flag285 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag285;
end Flag285;
function Flag286 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag286;
end Flag286;
function Flag287 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).In_List;
end Flag287;
function Flag288 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Has_Aspects;
end Flag288;
function Flag289 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Rewrite_Ins;
end Flag289;
function Flag290 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Analyzed;
end Flag290;
function Flag291 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Comes_From_Source;
end Flag291;
function Flag292 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Error_Posted;
end Flag292;
function Flag293 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag4;
end Flag293;
function Flag294 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag5;
end Flag294;
function Flag295 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag6;
end Flag295;
function Flag296 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag7;
end Flag296;
function Flag297 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag8;
end Flag297;
function Flag298 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag9;
end Flag298;
function Flag299 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag10;
end Flag299;
function Flag300 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag11;
end Flag300;
function Flag301 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag12;
end Flag301;
function Flag302 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag13;
end Flag302;
function Flag303 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag14;
end Flag303;
function Flag304 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag15;
end Flag304;
function Flag305 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag16;
end Flag305;
function Flag306 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag17;
end Flag306;
function Flag307 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag18;
end Flag307;
function Flag308 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Pflag1;
end Flag308;
function Flag309 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Pflag2;
end Flag309;
function Flag310 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag310;
end Flag310;
function Flag311 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag311;
end Flag311;
function Flag312 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag312;
end Flag312;
function Flag313 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag313;
end Flag313;
function Flag314 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag314;
end Flag314;
function Flag315 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag315;
end Flag315;
function Flag316 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag316;
end Flag316;
function Flag317 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag317;
end Flag317;
procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Nkind := Val;
end Set_Nkind;
procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Val;
end Set_Field1;
procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Val;
end Set_Field2;
procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Val;
end Set_Field3;
procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := Val;
end Set_Field4;
procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := Val;
end Set_Field5;
procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field6 := Val;
end Set_Field6;
procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field7 := Val;
end Set_Field7;
procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := Val;
end Set_Field8;
procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := Val;
end Set_Field9;
procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Val;
end Set_Field10;
procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field11 := Val;
end Set_Field11;
procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field12 := Val;
end Set_Field12;
procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := Val;
end Set_Field13;
procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := Val;
end Set_Field14;
procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := Val;
end Set_Field15;
procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := Val;
end Set_Field16;
procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field10 := Val;
end Set_Field17;
procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := Val;
end Set_Field18;
procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field6 := Val;
end Set_Field19;
procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field7 := Val;
end Set_Field20;
procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := Val;
end Set_Field21;
procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field9 := Val;
end Set_Field22;
procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field10 := Val;
end Set_Field23;
procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field6 := Val;
end Set_Field24;
procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Val;
end Set_Field25;
procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field8 := Val;
end Set_Field26;
procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field9 := Val;
end Set_Field27;
procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field10 := Val;
end Set_Field28;
procedure Set_Field29 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field11 := Val;
end Set_Field29;
procedure Set_Field30 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field6 := Val;
end Set_Field30;
procedure Set_Field31 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field7 := Val;
end Set_Field31;
procedure Set_Field32 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field8 := Val;
end Set_Field32;
procedure Set_Field33 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field9 := Val;
end Set_Field33;
procedure Set_Field34 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field10 := Val;
end Set_Field34;
procedure Set_Field35 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field11 := Val;
end Set_Field35;
procedure Set_Field36 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field6 := Val;
end Set_Field36;
procedure Set_Field37 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field7 := Val;
end Set_Field37;
procedure Set_Field38 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field8 := Val;
end Set_Field38;
procedure Set_Field39 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field9 := Val;
end Set_Field39;
procedure Set_Field40 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field10 := Val;
end Set_Field40;
procedure Set_Field41 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field11 := Val;
end Set_Field41;
procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_Node1;
procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_Node2;
procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_Node3;
procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := Union_Id (Val);
end Set_Node4;
procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := Union_Id (Val);
end Set_Node5;
procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field6 := Union_Id (Val);
end Set_Node6;
procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field7 := Union_Id (Val);
end Set_Node7;
procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := Union_Id (Val);
end Set_Node8;
procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := Union_Id (Val);
end Set_Node9;
procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Union_Id (Val);
end Set_Node10;
procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field11 := Union_Id (Val);
end Set_Node11;
procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field12 := Union_Id (Val);
end Set_Node12;
procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := Union_Id (Val);
end Set_Node13;
procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := Union_Id (Val);
end Set_Node14;
procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := Union_Id (Val);
end Set_Node15;
procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := Union_Id (Val);
end Set_Node16;
procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field10 := Union_Id (Val);
end Set_Node17;
procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := Union_Id (Val);
end Set_Node18;
procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field6 := Union_Id (Val);
end Set_Node19;
procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field7 := Union_Id (Val);
end Set_Node20;
procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := Union_Id (Val);
end Set_Node21;
procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field9 := Union_Id (Val);
end Set_Node22;
procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field10 := Union_Id (Val);
end Set_Node23;
procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field6 := Union_Id (Val);
end Set_Node24;
procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Union_Id (Val);
end Set_Node25;
procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field8 := Union_Id (Val);
end Set_Node26;
procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field9 := Union_Id (Val);
end Set_Node27;
procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field10 := Union_Id (Val);
end Set_Node28;
procedure Set_Node29 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field11 := Union_Id (Val);
end Set_Node29;
procedure Set_Node30 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field6 := Union_Id (Val);
end Set_Node30;
procedure Set_Node31 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field7 := Union_Id (Val);
end Set_Node31;
procedure Set_Node32 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field8 := Union_Id (Val);
end Set_Node32;
procedure Set_Node33 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field9 := Union_Id (Val);
end Set_Node33;
procedure Set_Node34 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field10 := Union_Id (Val);
end Set_Node34;
procedure Set_Node35 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field11 := Union_Id (Val);
end Set_Node35;
procedure Set_Node36 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field6 := Union_Id (Val);
end Set_Node36;
procedure Set_Node37 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field7 := Union_Id (Val);
end Set_Node37;
procedure Set_Node38 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field8 := Union_Id (Val);
end Set_Node38;
procedure Set_Node39 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field9 := Union_Id (Val);
end Set_Node39;
procedure Set_Node40 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field10 := Union_Id (Val);
end Set_Node40;
procedure Set_Node41 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field11 := Union_Id (Val);
end Set_Node41;
procedure Set_List1 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_List1;
procedure Set_List2 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_List2;
procedure Set_List3 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_List3;
procedure Set_List4 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := Union_Id (Val);
end Set_List4;
procedure Set_List5 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := Union_Id (Val);
end Set_List5;
procedure Set_List10 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Union_Id (Val);
end Set_List10;
procedure Set_List14 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := Union_Id (Val);
end Set_List14;
procedure Set_List25 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Union_Id (Val);
end Set_List25;
procedure Set_List38 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field8 := Union_Id (Val);
end Set_List38;
procedure Set_List39 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field9 := Union_Id (Val);
end Set_List39;
procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_Elist1;
procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_Elist2;
procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_Elist3;
procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Field4 := Union_Id (Val);
end Set_Elist4;
procedure Set_Elist5 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
Nodes.Table (N).Field5 := Union_Id (Val);
end Set_Elist5;
procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := Union_Id (Val);
end Set_Elist8;
procedure Set_Elist9 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := Union_Id (Val);
end Set_Elist9;
procedure Set_Elist10 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Union_Id (Val);
end Set_Elist10;
procedure Set_Elist11 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field11 := Union_Id (Val);
end Set_Elist11;
procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := Union_Id (Val);
end Set_Elist13;
procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := Union_Id (Val);
end Set_Elist15;
procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := Union_Id (Val);
end Set_Elist16;
procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := Union_Id (Val);
end Set_Elist18;
procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := Union_Id (Val);
end Set_Elist21;
procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field10 := Union_Id (Val);
end Set_Elist23;
procedure Set_Elist24 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field6 := Union_Id (Val);
end Set_Elist24;
procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Union_Id (Val);
end Set_Elist25;
procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field8 := Union_Id (Val);
end Set_Elist26;
procedure Set_Elist29 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field11 := Union_Id (Val);
end Set_Elist29;
procedure Set_Elist36 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 6).Field6 := Union_Id (Val);
end Set_Elist36;
procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_Name1;
procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_Name2;
procedure Set_Str3 (N : Node_Id; Val : String_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_Str3;
procedure Set_Uint2 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := To_Union (Val);
end Set_Uint2;
procedure Set_Uint3 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := To_Union (Val);
end Set_Uint3;
procedure Set_Uint4 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := To_Union (Val);
end Set_Uint4;
procedure Set_Uint5 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := To_Union (Val);
end Set_Uint5;
procedure Set_Uint8 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := To_Union (Val);
end Set_Uint8;
procedure Set_Uint9 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := To_Union (Val);
end Set_Uint9;
procedure Set_Uint10 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := To_Union (Val);
end Set_Uint10;
procedure Set_Uint11 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field11 := To_Union (Val);
end Set_Uint11;
procedure Set_Uint12 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field12 := To_Union (Val);
end Set_Uint12;
procedure Set_Uint13 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := To_Union (Val);
end Set_Uint13;
procedure Set_Uint14 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := To_Union (Val);
end Set_Uint14;
procedure Set_Uint15 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := To_Union (Val);
end Set_Uint15;
procedure Set_Uint16 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := To_Union (Val);
end Set_Uint16;
procedure Set_Uint17 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field10 := To_Union (Val);
end Set_Uint17;
procedure Set_Uint22 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field9 := To_Union (Val);
end Set_Uint22;
procedure Set_Uint24 (N : Node_Id; Val : Uint) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field6 := To_Union (Val);
end Set_Uint24;
procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := To_Union (Val);
end Set_Ureal3;
procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := To_Union (Val);
end Set_Ureal18;
procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := To_Union (Val);
end Set_Ureal21;
procedure Set_Flag0 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag0 := Val;
end Set_Flag0;
procedure Set_Flag1 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag1 := Val;
end Set_Flag1;
procedure Set_Flag2 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag2 := Val;
end Set_Flag2;
procedure Set_Flag3 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag3 := Val;
end Set_Flag3;
procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag4 := Val;
end Set_Flag4;
procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag5 := Val;
end Set_Flag5;
procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag6 := Val;
end Set_Flag6;
procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag7 := Val;
end Set_Flag7;
procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag8 := Val;
end Set_Flag8;
procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag9 := Val;
end Set_Flag9;
procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag10 := Val;
end Set_Flag10;
procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag11 := Val;
end Set_Flag11;
procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag12 := Val;
end Set_Flag12;
procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag13 := Val;
end Set_Flag13;
procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag14 := Val;
end Set_Flag14;
procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag15 := Val;
end Set_Flag15;
procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag16 := Val;
end Set_Flag16;
procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag17 := Val;
end Set_Flag17;
procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag18 := Val;
end Set_Flag18;
procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).In_List := Val;
end Set_Flag19;
procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Has_Aspects := Val;
end Set_Flag20;
procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Rewrite_Ins := Val;
end Set_Flag21;
procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Analyzed := Val;
end Set_Flag22;
procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Comes_From_Source := Val;
end Set_Flag23;
procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Error_Posted := Val;
end Set_Flag24;
procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag4 := Val;
end Set_Flag25;
procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag5 := Val;
end Set_Flag26;
procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag6 := Val;
end Set_Flag27;
procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag7 := Val;
end Set_Flag28;
procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag8 := Val;
end Set_Flag29;
procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag9 := Val;
end Set_Flag30;
procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag10 := Val;
end Set_Flag31;
procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag11 := Val;
end Set_Flag32;
procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag12 := Val;
end Set_Flag33;
procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag13 := Val;
end Set_Flag34;
procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag14 := Val;
end Set_Flag35;
procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag15 := Val;
end Set_Flag36;
procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag16 := Val;
end Set_Flag37;
procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag17 := Val;
end Set_Flag38;
procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag18 := Val;
end Set_Flag39;
procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).In_List := Val;
end Set_Flag40;
procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Has_Aspects := Val;
end Set_Flag41;
procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Rewrite_Ins := Val;
end Set_Flag42;
procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Analyzed := Val;
end Set_Flag43;
procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Comes_From_Source := Val;
end Set_Flag44;
procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Error_Posted := Val;
end Set_Flag45;
procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag4 := Val;
end Set_Flag46;
procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag5 := Val;
end Set_Flag47;
procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag6 := Val;
end Set_Flag48;
procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag7 := Val;
end Set_Flag49;
procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag8 := Val;
end Set_Flag50;
procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag9 := Val;
end Set_Flag51;
procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag10 := Val;
end Set_Flag52;
procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag11 := Val;
end Set_Flag53;
procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag12 := Val;
end Set_Flag54;
procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag13 := Val;
end Set_Flag55;
procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag14 := Val;
end Set_Flag56;
procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag15 := Val;
end Set_Flag57;
procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag16 := Val;
end Set_Flag58;
procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag17 := Val;
end Set_Flag59;
procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag18 := Val;
end Set_Flag60;
procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Pflag1 := Val;
end Set_Flag61;
procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Pflag2 := Val;
end Set_Flag62;
procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Pflag1 := Val;
end Set_Flag63;
procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Pflag2 := Val;
end Set_Flag64;
procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
end Set_Flag65;
procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
end Set_Flag66;
procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
end Set_Flag67;
procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
end Set_Flag68;
procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
end Set_Flag69;
procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
end Set_Flag70;
procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
end Set_Flag71;
procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
end Set_Flag72;
procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
end Set_Flag73;
procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
end Set_Flag74;
procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
end Set_Flag75;
procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
end Set_Flag76;
procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
end Set_Flag77;
procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
end Set_Flag78;
procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
end Set_Flag79;
procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
end Set_Flag80;
procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
end Set_Flag81;
procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
end Set_Flag82;
procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
end Set_Flag83;
procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
end Set_Flag84;
procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
end Set_Flag85;
procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
end Set_Flag86;
procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
end Set_Flag87;
procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
end Set_Flag88;
procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
end Set_Flag89;
procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
end Set_Flag90;
procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
end Set_Flag91;
procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
end Set_Flag92;
procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
end Set_Flag93;
procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
end Set_Flag94;
procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
end Set_Flag95;
procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
end Set_Flag96;
procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
end Set_Flag97;
procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
end Set_Flag98;
procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
end Set_Flag99;
procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
end Set_Flag100;
procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
end Set_Flag101;
procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
end Set_Flag102;
procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
end Set_Flag103;
procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
end Set_Flag104;
procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
end Set_Flag105;
procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
end Set_Flag106;
procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
end Set_Flag107;
procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
end Set_Flag108;
procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
end Set_Flag109;
procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
end Set_Flag110;
procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
end Set_Flag111;
procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
end Set_Flag112;
procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
end Set_Flag113;
procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
end Set_Flag114;
procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
end Set_Flag115;
procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
end Set_Flag116;
procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
end Set_Flag117;
procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
end Set_Flag118;
procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
end Set_Flag119;
procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
end Set_Flag120;
procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
end Set_Flag121;
procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
end Set_Flag122;
procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
end Set_Flag123;
procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
end Set_Flag124;
procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
end Set_Flag125;
procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
end Set_Flag126;
procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
end Set_Flag127;
procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
end Set_Flag128;
procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).In_List := Val;
end Set_Flag129;
procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Has_Aspects := Val;
end Set_Flag130;
procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Rewrite_Ins := Val;
end Set_Flag131;
procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Analyzed := Val;
end Set_Flag132;
procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Comes_From_Source := Val;
end Set_Flag133;
procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Error_Posted := Val;
end Set_Flag134;
procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag4 := Val;
end Set_Flag135;
procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag5 := Val;
end Set_Flag136;
procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag6 := Val;
end Set_Flag137;
procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag7 := Val;
end Set_Flag138;
procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag8 := Val;
end Set_Flag139;
procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag9 := Val;
end Set_Flag140;
procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag10 := Val;
end Set_Flag141;
procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag11 := Val;
end Set_Flag142;
procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag12 := Val;
end Set_Flag143;
procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag13 := Val;
end Set_Flag144;
procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag14 := Val;
end Set_Flag145;
procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag15 := Val;
end Set_Flag146;
procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag16 := Val;
end Set_Flag147;
procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag17 := Val;
end Set_Flag148;
procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag18 := Val;
end Set_Flag149;
procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Pflag1 := Val;
end Set_Flag150;
procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Pflag2 := Val;
end Set_Flag151;
procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
end Set_Flag152;
procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
end Set_Flag153;
procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
end Set_Flag154;
procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
end Set_Flag155;
procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
end Set_Flag156;
procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
end Set_Flag157;
procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
end Set_Flag158;
procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
end Set_Flag159;
procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
end Set_Flag160;
procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
end Set_Flag161;
procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
end Set_Flag162;
procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
end Set_Flag163;
procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
end Set_Flag164;
procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
end Set_Flag165;
procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
end Set_Flag166;
procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
end Set_Flag167;
procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
end Set_Flag168;
procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
end Set_Flag169;
procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
end Set_Flag170;
procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
end Set_Flag171;
procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
end Set_Flag172;
procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
end Set_Flag173;
procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
end Set_Flag174;
procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
end Set_Flag175;
procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
end Set_Flag176;
procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
end Set_Flag177;
procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
end Set_Flag178;
procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
end Set_Flag179;
procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
end Set_Flag180;
procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
end Set_Flag181;
procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
end Set_Flag182;
procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
end Set_Flag183;
procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag184 := Val;
end Set_Flag184;
procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag185 := Val;
end Set_Flag185;
procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag186 := Val;
end Set_Flag186;
procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag187 := Val;
end Set_Flag187;
procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag188 := Val;
end Set_Flag188;
procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag189 := Val;
end Set_Flag189;
procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag190 := Val;
end Set_Flag190;
procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag191 := Val;
end Set_Flag191;
procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag192 := Val;
end Set_Flag192;
procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag193 := Val;
end Set_Flag193;
procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag194 := Val;
end Set_Flag194;
procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag195 := Val;
end Set_Flag195;
procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag196 := Val;
end Set_Flag196;
procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag197 := Val;
end Set_Flag197;
procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag198 := Val;
end Set_Flag198;
procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag199 := Val;
end Set_Flag199;
procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag200 := Val;
end Set_Flag200;
procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag201 := Val;
end Set_Flag201;
procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag202 := Val;
end Set_Flag202;
procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag203 := Val;
end Set_Flag203;
procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag204 := Val;
end Set_Flag204;
procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag205 := Val;
end Set_Flag205;
procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag206 := Val;
end Set_Flag206;
procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag207 := Val;
end Set_Flag207;
procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag208 := Val;
end Set_Flag208;
procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag209 := Val;
end Set_Flag209;
procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag210 := Val;
end Set_Flag210;
procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag211 := Val;
end Set_Flag211;
procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag212 := Val;
end Set_Flag212;
procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag213 := Val;
end Set_Flag213;
procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag214 := Val;
end Set_Flag214;
procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag215 := Val;
end Set_Flag215;
procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).In_List := Val;
end Set_Flag216;
procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Has_Aspects := Val;
end Set_Flag217;
procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Rewrite_Ins := Val;
end Set_Flag218;
procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Analyzed := Val;
end Set_Flag219;
procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Comes_From_Source := Val;
end Set_Flag220;
procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Error_Posted := Val;
end Set_Flag221;
procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag4 := Val;
end Set_Flag222;
procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag5 := Val;
end Set_Flag223;
procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag6 := Val;
end Set_Flag224;
procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag7 := Val;
end Set_Flag225;
procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag8 := Val;
end Set_Flag226;
procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag9 := Val;
end Set_Flag227;
procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag10 := Val;
end Set_Flag228;
procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag11 := Val;
end Set_Flag229;
procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag12 := Val;
end Set_Flag230;
procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag13 := Val;
end Set_Flag231;
procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag14 := Val;
end Set_Flag232;
procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag15 := Val;
end Set_Flag233;
procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag16 := Val;
end Set_Flag234;
procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag17 := Val;
end Set_Flag235;
procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag18 := Val;
end Set_Flag236;
procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Pflag1 := Val;
end Set_Flag237;
procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Pflag2 := Val;
end Set_Flag238;
procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag239 := Val;
end Set_Flag239;
procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag240 := Val;
end Set_Flag240;
procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag241 := Val;
end Set_Flag241;
procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag242 := Val;
end Set_Flag242;
procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag243 := Val;
end Set_Flag243;
procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag244 := Val;
end Set_Flag244;
procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag245 := Val;
end Set_Flag245;
procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag246 := Val;
end Set_Flag246;
procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag247 := Val;
end Set_Flag247;
procedure Set_Flag248 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag248 := Val;
end Set_Flag248;
procedure Set_Flag249 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag249 := Val;
end Set_Flag249;
procedure Set_Flag250 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag250 := Val;
end Set_Flag250;
procedure Set_Flag251 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag251 := Val;
end Set_Flag251;
procedure Set_Flag252 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag252 := Val;
end Set_Flag252;
procedure Set_Flag253 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag253 := Val;
end Set_Flag253;
procedure Set_Flag254 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag254 := Val;
end Set_Flag254;
procedure Set_Flag255 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag255 := Val;
end Set_Flag255;
procedure Set_Flag256 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag256 := Val;
end Set_Flag256;
procedure Set_Flag257 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag257 := Val;
end Set_Flag257;
procedure Set_Flag258 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag258 := Val;
end Set_Flag258;
procedure Set_Flag259 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag259 := Val;
end Set_Flag259;
procedure Set_Flag260 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag260 := Val;
end Set_Flag260;
procedure Set_Flag261 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag261 := Val;
end Set_Flag261;
procedure Set_Flag262 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag262 := Val;
end Set_Flag262;
procedure Set_Flag263 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag263 := Val;
end Set_Flag263;
procedure Set_Flag264 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag264 := Val;
end Set_Flag264;
procedure Set_Flag265 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag265 := Val;
end Set_Flag265;
procedure Set_Flag266 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag266 := Val;
end Set_Flag266;
procedure Set_Flag267 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag267 := Val;
end Set_Flag267;
procedure Set_Flag268 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag268 := Val;
end Set_Flag268;
procedure Set_Flag269 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag269 := Val;
end Set_Flag269;
procedure Set_Flag270 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag270 := Val;
end Set_Flag270;
procedure Set_Flag271 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag271 := Val;
end Set_Flag271;
procedure Set_Flag272 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag272 := Val;
end Set_Flag272;
procedure Set_Flag273 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag273 := Val;
end Set_Flag273;
procedure Set_Flag274 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag274 := Val;
end Set_Flag274;
procedure Set_Flag275 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag275 := Val;
end Set_Flag275;
procedure Set_Flag276 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag276 := Val;
end Set_Flag276;
procedure Set_Flag277 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag277 := Val;
end Set_Flag277;
procedure Set_Flag278 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag278 := Val;
end Set_Flag278;
procedure Set_Flag279 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag279 := Val;
end Set_Flag279;
procedure Set_Flag280 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag280 := Val;
end Set_Flag280;
procedure Set_Flag281 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag281 := Val;
end Set_Flag281;
procedure Set_Flag282 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag282 := Val;
end Set_Flag282;
procedure Set_Flag283 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag283 := Val;
end Set_Flag283;
procedure Set_Flag284 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag284 := Val;
end Set_Flag284;
procedure Set_Flag285 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag285 := Val;
end Set_Flag285;
procedure Set_Flag286 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag286 := Val;
end Set_Flag286;
procedure Set_Flag287 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).In_List := Val;
end Set_Flag287;
procedure Set_Flag288 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Has_Aspects := Val;
end Set_Flag288;
procedure Set_Flag289 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Rewrite_Ins := Val;
end Set_Flag289;
procedure Set_Flag290 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Analyzed := Val;
end Set_Flag290;
procedure Set_Flag291 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Comes_From_Source := Val;
end Set_Flag291;
procedure Set_Flag292 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Error_Posted := Val;
end Set_Flag292;
procedure Set_Flag293 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag4 := Val;
end Set_Flag293;
procedure Set_Flag294 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag5 := Val;
end Set_Flag294;
procedure Set_Flag295 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag6 := Val;
end Set_Flag295;
procedure Set_Flag296 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag7 := Val;
end Set_Flag296;
procedure Set_Flag297 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag8 := Val;
end Set_Flag297;
procedure Set_Flag298 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag9 := Val;
end Set_Flag298;
procedure Set_Flag299 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag10 := Val;
end Set_Flag299;
procedure Set_Flag300 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag11 := Val;
end Set_Flag300;
procedure Set_Flag301 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag12 := Val;
end Set_Flag301;
procedure Set_Flag302 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag13 := Val;
end Set_Flag302;
procedure Set_Flag303 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag14 := Val;
end Set_Flag303;
procedure Set_Flag304 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag15 := Val;
end Set_Flag304;
procedure Set_Flag305 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag16 := Val;
end Set_Flag305;
procedure Set_Flag306 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag17 := Val;
end Set_Flag306;
procedure Set_Flag307 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag18 := Val;
end Set_Flag307;
procedure Set_Flag308 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Pflag1 := Val;
end Set_Flag308;
procedure Set_Flag309 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Pflag2 := Val;
end Set_Flag309;
procedure Set_Flag310 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag310 := Val;
end Set_Flag310;
procedure Set_Flag311 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag311 := Val;
end Set_Flag311;
procedure Set_Flag312 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag312 := Val;
end Set_Flag312;
procedure Set_Flag313 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag313 := Val;
end Set_Flag313;
procedure Set_Flag314 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag314 := Val;
end Set_Flag314;
procedure Set_Flag315 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag315 := Val;
end Set_Flag315;
procedure Set_Flag316 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag316 := Val;
end Set_Flag316;
procedure Set_Flag317 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (not Locked);
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag317 := Val;
end Set_Flag317;
procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node1 (N, Val);
end Set_Node1_With_Parent;
procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node2 (N, Val);
end Set_Node2_With_Parent;
procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node3 (N, Val);
end Set_Node3_With_Parent;
procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node4 (N, Val);
end Set_Node4_With_Parent;
procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node5 (N, Val);
end Set_Node5_With_Parent;
procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List1 (N, Val);
end Set_List1_With_Parent;
procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List2 (N, Val);
end Set_List2_With_Parent;
procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List3 (N, Val);
end Set_List3_With_Parent;
procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List4 (N, Val);
end Set_List4_With_Parent;
procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (not Locked);
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List5 (N, Val);
end Set_List5_With_Parent;
end Unchecked_Access;
------------
-- Unlock --
------------
procedure Unlock is
begin
Nodes.Locked := False;
Flags.Locked := False;
Orig_Nodes.Locked := False;
end Unlock;
------------------
-- Unlock_Nodes --
------------------
procedure Unlock_Nodes is
begin
pragma Assert (Locked);
Locked := False;
end Unlock_Nodes;
end Atree;
|
with Ada.Unchecked_Deallocation;
with Ada.Assertions; use Ada.Assertions;
with Device; use Device;
with BRAM;
with CACTI;
with Random_Enum;
package body Memory.Cache is
MIN_LINE_COUNT : constant := 16;
procedure Free is
new Ada.Unchecked_Deallocation(Cache_Data, Cache_Data_Pointer);
function Create_Cache(mem : access Memory_Type'Class;
line_count : Positive := 1;
line_size : Positive := 8;
associativity : Positive := 1;
latency : Time_Type := 1;
policy : Policy_Type := LRU;
write_back : Boolean := True)
return Cache_Pointer is
result : constant Cache_Pointer := new Cache_Type;
begin
Set_Memory(result.all, mem);
result.line_size := line_size;
result.line_count := line_count;
result.associativity := associativity;
result.latency := latency;
result.policy := policy;
result.write_back := write_back;
result.data.Set_Length(Count_Type(result.line_count));
for i in 0 .. result.line_count - 1 loop
result.data.Replace_Element(i, new Cache_Data);
end loop;
return result;
end Create_Cache;
function Random_Policy is new Random_Enum(Policy_Type);
function Random_Boolean is new Random_Enum(Boolean);
-- Set the latency based on associativity.
procedure Update_Latency(mem : in out Cache_Type'Class) is
begin
if Get_Device = ASIC then
mem.latency := CACTI.Get_Time(mem);
else
case mem.policy is
when PLRU =>
mem.latency := 3 + Time_Type(mem.associativity) / 8;
when others =>
mem.latency := 3 + Time_Type(mem.associativity) / 4;
end case;
end if;
end Update_Latency;
function Random_Cache(next : access Memory_Type'Class;
generator : Distribution_Type;
max_cost : Cost_Type)
return Memory_Pointer is
result : Cache_Pointer := new Cache_Type;
begin
-- Start with everything set to the minimum.
Set_Memory(result.all, next);
result.line_size := Get_Word_Size(next.all);
result.line_count := MIN_LINE_COUNT;
result.associativity := 1;
result.policy := LRU;
result.write_back := True;
-- If even the minimum cache is too costly, return null.
if Get_Cost(result.all) > max_cost then
Set_Memory(result.all, null);
Destroy(Memory_Pointer(result));
return Memory_Pointer(next);
end if;
-- Randomly increase parameters, reverting them if we exceed the cost.
loop
-- Line size.
declare
line_size : constant Positive := result.line_size;
begin
if Random_Boolean(Random(generator)) then
result.line_size := line_size * 2;
if Get_Cost(result.all) > max_cost then
result.line_size := line_size;
exit;
end if;
end if;
end;
-- Line count.
declare
line_count : constant Positive := result.line_count;
begin
if Random_Boolean(Random(generator)) then
result.line_count := 2 * line_count;
if Get_Cost(result.all) > max_cost then
result.line_count := line_count;
exit;
end if;
end if;
end;
-- Associativity.
declare
associativity : constant Positive := result.associativity;
begin
if Random_Boolean(Random(generator)) then
result.associativity := result.associativity * 2;
if result.associativity > result.line_count or else
Get_Cost(result.all) > max_cost then
result.associativity := associativity;
exit;
end if;
end if;
end;
-- Policy.
declare
policy : constant Policy_Type := result.policy;
begin
result.policy := Random_Policy(Random(generator));
if Get_Cost(result.all) > max_cost then
result.policy := policy;
exit;
end if;
end;
-- Type.
declare
write_back : constant Boolean := result.write_back;
begin
result.write_back := Random_Boolean(Random(generator));
if Get_Cost(result.all) > max_cost then
result.write_back := write_back;
exit;
end if;
end;
end loop;
Update_Latency(result.all);
result.data.Set_Length(Count_Type(result.line_count));
for i in 0 .. result.line_count - 1 loop
result.data.Replace_Element(i, new Cache_Data);
end loop;
return Memory_Pointer(result);
end Random_Cache;
function Clone(mem : Cache_Type) return Memory_Pointer is
result : constant Cache_Pointer := new Cache_Type'(mem);
begin
return Memory_Pointer(result);
end Clone;
procedure Permute(mem : in out Cache_Type;
generator : in Distribution_Type;
max_cost : in Cost_Type) is
param_count : constant Natural := 8;
param : Natural := Random(generator) mod param_count;
line_size : constant Positive := mem.line_size;
line_count : constant Positive := mem.line_count;
associativity : constant Positive := mem.associativity;
policy : constant Policy_Type := mem.policy;
write_back : constant Boolean := mem.write_back;
begin
-- Loop until we either change a parameter or we are unable to
-- change any parameter.
for i in 1 .. param_count loop
case param is
when 0 => -- Increase line size
mem.line_size := line_size * 2;
exit when Get_Cost(mem) <= max_cost;
mem.line_size := line_size;
when 1 => -- Decrease line size
if line_size > Get_Word_Size(Get_Memory(mem).all) then
mem.line_size := line_size / 2;
exit when Get_Cost(mem) <= max_cost;
mem.line_size := line_size;
end if;
when 2 => -- Increase line count
mem.line_count := line_count * 2;
exit when Get_Cost(mem) <= max_cost;
mem.line_count := line_count;
when 3 => -- Decrease line count
if line_count > MIN_LINE_COUNT and
line_count > associativity then
mem.line_count := line_count / 2;
exit when Get_Cost(mem) <= max_cost;
mem.line_count := line_count;
end if;
when 4 => -- Increase associativity
if associativity < line_count then
mem.associativity := associativity * 2;
exit when Get_Cost(mem) <= max_cost;
mem.associativity := associativity;
end if;
when 5 => -- Decrease associativity
if associativity > 1 then
mem.associativity := associativity / 2;
exit when Get_Cost(mem) <= max_cost;
mem.associativity := associativity;
end if;
when 6 => -- Change policy
mem.policy := Random_Policy(Random(generator));
exit when Get_Cost(mem) <= max_cost;
mem.policy := policy;
when others => -- Change type
mem.write_back := Random_Boolean(Random(generator));
exit when Get_Cost(mem) <= max_cost;
mem.write_back := write_back;
end case;
param := (param + 1) mod param_count;
end loop;
Update_Latency(mem);
for i in mem.line_count .. mem.data.Last_Index loop
declare
dp : Cache_Data_Pointer := mem.data.Element(i);
begin
Free(dp);
end;
end loop;
mem.data.Set_Length(Count_Type(mem.line_count));
for i in line_count .. mem.line_count - 1 loop
mem.data.Replace_Element(i, new Cache_Data);
end loop;
Assert(Get_Cost(mem) <= max_cost, "Invalid cache permutation");
end Permute;
procedure Get_Data(mem : in out Cache_Type;
address : in Address_Type;
size : in Positive;
is_read : in Boolean) is
data : Cache_Data_Pointer;
mask : constant Address_Type := Address_Type(mem.line_size - 1);
tag : constant Address_Type := address and not mask;
set_count : constant Natural := mem.line_count / mem.associativity;
line_size : constant Address_Type := Address_Type(mem.line_size);
word_addr : constant Address_Type := address / line_size;
first : constant Natural :=
Natural(word_addr mod Address_Type(set_count));
line : Natural;
to_replace : Natural := 0;
age : Long_Integer;
age_sum : Natural;
begin
Advance(mem, mem.latency);
-- Update the age of all items in this set.
age_sum := 0;
for i in 0 .. mem.associativity - 1 loop
line := first + i * set_count;
data := mem.data.Element(line);
if mem.policy = PLRU then
age_sum := age_sum + Natural(data.age);
else
data.age := data.age + 1;
Assert(data.age > 0, "invalid age");
end if;
end loop;
-- First check if this address is already in the cache.
-- Here we also keep track of the line to be replaced.
if mem.policy = MRU then
age := Long_Integer'Last;
else
age := Long_Integer'First;
end if;
for i in 0 .. mem.associativity - 1 loop
line := first + i * set_count;
data := mem.data.Element(line);
if tag = data.address then -- Cache hit.
if mem.policy = PLRU then
-- Reset ages to 0 if we marked all of them.
if age_sum + 1 = mem.associativity then
for j in 0 .. mem.associativity - 1 loop
declare
temp : Cache_Data_Pointer;
begin
temp := mem.data.Element(first + j * set_count);
temp.age := 0;
end;
end loop;
end if;
-- Make this age most recently used.
data.age := 1;
elsif mem.policy /= FIFO then
-- Other policies reset the age to 0.
data.age := 0;
end if;
if is_read or mem.write_back then
data.dirty := data.dirty or not is_read;
else
Write(Container_Type(mem), tag, mem.line_size);
end if;
return;
elsif mem.policy = MRU then
if data.age < age then
to_replace := line;
age := data.age;
end if;
elsif mem.policy = PLRU then
if data.age = 0 then
to_replace := line;
age := data.age;
end if;
else
if data.age > age then
to_replace := line;
age := data.age;
end if;
end if;
end loop;
-- If we got here, the item is not in the cache.
if is_read or mem.write_back then
-- Look up the line to replace.
data := mem.data.Element(to_replace);
-- Evict the oldest entry.
-- On write-through caches, the dirty flag will never be set.
if data.dirty then
Write(Container_Type(mem), data.address, mem.line_size);
data.dirty := False;
end if;
data.address := tag;
data.dirty := not is_read;
-- Update the age.
if mem.policy = PLRU then
if age_sum + 1 = mem.associativity then
for j in 0 .. mem.associativity - 1 loop
declare
temp : Cache_Data_Pointer;
begin
temp := mem.data.Element(first + j * set_count);
temp.age := 0;
end;
end loop;
end if;
data.age := 1;
else
data.age := 0;
end if;
-- Read the new entry.
-- We skip this if this was a write that wrote the entire line.
if is_read or size /= mem.line_size then
Read(Container_Type(mem), tag, mem.line_size);
end if;
else
-- A write on a write-through cache, forward the write.
Write(Container_Type(mem), address, size);
end if;
end Get_Data;
procedure Reset(mem : in out Cache_Type;
context : in Natural) is
data : Cache_Data_Pointer;
begin
Reset(Container_Type(mem), context);
for i in 0 .. mem.line_count - 1 loop
data := mem.data.Element(i);
data.address := Address_Type'Last;
data.age := 0;
data.dirty := False;
end loop;
end Reset;
procedure Read(mem : in out Cache_Type;
address : in Address_Type;
size : in Positive) is
extra : constant Natural := size / mem.line_size;
abits : constant Positive := Get_Address_Bits;
mask : constant Address_Type := Address_Type(2) ** abits - 1;
temp : Address_Type := address;
begin
for i in 1 .. extra loop
Get_Data(mem, temp, mem.line_size, True);
temp := (temp + Address_Type(mem.line_size)) and mask;
end loop;
if size > extra * mem.line_size then
Get_Data(mem, temp, size - extra * mem.line_size, True);
end if;
end Read;
procedure Write(mem : in out Cache_Type;
address : in Address_Type;
size : in Positive) is
extra : constant Natural := size / mem.line_size;
abits : constant Positive := Get_Address_Bits;
mask : constant Address_Type := Address_Type(2) ** abits - 1;
temp : Address_Type := address;
begin
for i in 1 .. extra loop
Get_Data(mem, temp, mem.line_size, False);
temp := (temp + Address_Type(mem.line_size)) and mask;
end loop;
if size > extra * mem.line_size then
Get_Data(mem, temp, size - extra * mem.line_size, False);
end if;
end Write;
function To_String(mem : Cache_Type) return Unbounded_String is
result : Unbounded_String;
begin
Append(result, "(cache ");
Append(result, "(line_size" & Positive'Image(mem.line_size) & ")");
Append(result, "(line_count" & Positive'Image(mem.line_count) & ")");
Append(result, "(associativity" &
Positive'Image(mem.associativity) & ")");
Append(result, "(latency" & Time_Type'Image(mem.latency) & ")");
if mem.associativity > 1 then
Append(result, "(policy ");
case mem.policy is
when LRU => Append(result, "lru");
when MRU => Append(result, "mru");
when FIFO => Append(result, "fifo");
when PLRU => Append(result, "plru");
end case;
Append(result, ")");
end if;
if mem.write_back then
Append(result, "(write_back true)");
else
Append(result, "(write_back false)");
end if;
Append(result, "(memory ");
Append(result, To_String(Container_Type(mem)));
Append(result, "))");
return result;
end To_String;
function Get_Cost(mem : Cache_Type) return Cost_Type is
-- Bits per line for storing data.
lines : constant Natural := mem.line_count;
lsize : constant Natural := mem.line_size;
line_bits : constant Natural := lsize * 8;
-- Bits to store a tag.
addr_bits : constant Positive := Get_Address_Bits;
wsize : constant Positive := Get_Word_Size(mem);
index_bits : constant Natural := Log2(lines - 1);
line_words : constant Natural := (lsize + wsize - 1) / wsize;
ls_bits : constant Natural := Log2(line_words - 1);
tag_bits : constant Natural := addr_bits - index_bits - ls_bits;
-- Bits to store the age.
assoc : constant Positive := mem.associativity;
-- Bits used for storing valid and dirty.
valid_bits : constant Natural := 1;
dirty_bits : constant Natural := 1;
-- Bits per way. This is the width of the memory.
width : Natural := valid_bits + line_bits + tag_bits;
result : Cost_Type;
begin
-- Use CACTI to determine the cost for ASICs.
if Get_Device = ASIC then
result := Get_Cost(Container_Type(mem));
result := result + CACTI.Get_Area(mem);
return result;
end if;
-- Determine the number of age bits.
if assoc > 1 then
case mem.policy is
when PLRU =>
width := width + 1;
when others =>
width := width + Log2(assoc - 1);
end case;
end if;
-- If this cache is a write-back cache, we need to track a dirty
-- bit for each cache line.
if mem.write_back then
width := width + dirty_bits;
end if;
-- The memory must be wide enough to allow access to each way.
width := width * assoc;
-- Given the width and depth of the cache, determine the number
-- of BRAMs required.
result := Cost_Type(BRAM.Get_Count(width, lines / assoc));
-- Add the cost of the contained memory.
result := result + Get_Cost(Container_Type(mem));
return result;
end Get_Cost;
procedure Generate(mem : in Cache_Type;
sigs : in out Unbounded_String;
code : in out Unbounded_String) is
other : constant Memory_Pointer := Get_Memory(mem);
word_bits: constant Natural := 8 * Get_Word_Size(mem);
name : constant String := "m" & To_String(Get_ID(mem));
oname : constant String := "m" & To_String(Get_ID(other.all));
lsize : constant Positive := 8 * mem.line_size / word_bits;
lcount : constant Positive := mem.line_count;
assoc : constant Natural := mem.associativity;
begin
Generate(other.all, sigs, code);
Declare_Signals(sigs, name, word_bits);
Line(code, name & "_inst : entity work.cache");
Line(code, " generic map (");
Line(code, " ADDR_WIDTH => ADDR_WIDTH,");
Line(code, " WORD_WIDTH => " & To_String(word_bits) & ",");
Line(code, " LINE_SIZE_BITS => " &
To_String(Log2(lsize - 1)) & ",");
Line(code, " LINE_COUNT_BITS => " &
To_String(Log2(lcount / assoc - 1)) & ",");
Line(code, " ASSOC_BITS => " &
To_String(Log2(assoc - 1)) & ",");
case mem.policy is
when LRU =>
Line(code, " REPLACEMENT => 0,");
when MRU =>
Line(code, " REPLACEMENT => 1,");
when FIFO =>
Line(code, " REPLACEMENT => 2,");
when PLRU =>
Line(code, " REPLACEMENT => 3,");
end case;
if mem.write_back then
Line(code, " WRITE_POLICY => 0");
else
Line(code, " WRITE_POLICY => 1");
end if;
Line(code, " )");
Line(code, " port map (");
Line(code, " clk => clk,");
Line(code, " rst => rst,");
Line(code, " addr => " & name & "_addr,");
Line(code, " din => " & name & "_din,");
Line(code, " dout => " & name & "_dout,");
Line(code, " re => " & name & "_re,");
Line(code, " we => " & name & "_we,");
Line(code, " mask => " & name & "_mask,");
Line(code, " ready => " & name & "_ready,");
Line(code, " maddr => " & oname & "_addr,");
Line(code, " min => " & oname & "_dout,");
Line(code, " mout => " & oname & "_din,");
Line(code, " mre => " & oname & "_re,");
Line(code, " mwe => " & oname & "_we,");
Line(code, " mmask => " & oname & "_mask,");
Line(code, " mready => " & oname & "_ready");
Line(code, " );");
end Generate;
procedure Adjust(mem : in out Cache_Type) is
ptr : Cache_Data_Pointer;
begin
Adjust(Container_Type(mem));
for i in mem.data.First_Index .. mem.data.Last_Index loop
ptr := new Cache_Data'(mem.data.Element(i).all);
mem.data.Replace_Element(i, ptr);
end loop;
end Adjust;
procedure Finalize(mem : in out Cache_Type) is
begin
Finalize(Container_Type(mem));
for i in mem.data.First_Index .. mem.data.Last_Index loop
declare
ptr : Cache_Data_Pointer := mem.data.Element(i);
begin
Free(ptr);
end;
end loop;
end Finalize;
function Get_Line_Size(mem : Cache_Type) return Positive is
begin
return mem.line_size;
end Get_Line_Size;
function Get_Line_Count(mem : Cache_Type) return Positive is
begin
return mem.line_count;
end Get_Line_Count;
function Get_Associativity(mem : Cache_Type) return Positive is
begin
return mem.associativity;
end Get_Associativity;
function Get_Policy(mem : Cache_Type) return Policy_Type is
begin
return mem.policy;
end Get_Policy;
end Memory.Cache;
|
with
System;
package body lace.Strings.Search
is
use Ada.Strings.Maps,
System;
-----------------------
-- Local Subprograms --
-----------------------
function Belongs
(Element : Character;
Set : Maps.Character_Set;
Test : Membership) return Boolean;
pragma Inline (Belongs);
-- Determines if the given element is in (Test = Inside) or not in
-- (Test = Outside) the given character set.
-------------
-- Belongs --
-------------
function Belongs
(Element : Character;
Set : Maps.Character_Set;
Test : Membership) return Boolean
is
begin
if Test = Inside then
return Is_In (Element, Set);
else
return not Is_In (Element, Set);
end if;
end Belongs;
-----------
-- Count --
-----------
function Count
(Source : String;
Pattern : String;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
PL1 : constant Integer := Pattern'Length - 1;
Num : Natural;
Ind : Natural;
Cur : Natural;
begin
if Pattern = "" then
raise Pattern_Error;
end if;
Num := 0;
Ind := Source'First;
-- Unmapped case
if Mapping'Address = Maps.Identity'Address then
while Ind <= Source'Last - PL1 loop
if Pattern = Source (Ind .. Ind + PL1) then
Num := Num + 1;
Ind := Ind + Pattern'Length;
else
Ind := Ind + 1;
end if;
end loop;
-- Mapped case
else
while Ind <= Source'Last - PL1 loop
Cur := Ind;
for K in Pattern'Range loop
if Pattern (K) /= Value (Mapping, Source (Cur)) then
Ind := Ind + 1;
goto Cont;
else
Cur := Cur + 1;
end if;
end loop;
Num := Num + 1;
Ind := Ind + Pattern'Length;
<<Cont>>
null;
end loop;
end if;
-- Return result
return Num;
end Count;
function Count
(Source : String;
Pattern : String;
Mapping : Maps.Character_Mapping_Function) return Natural
is
PL1 : constant Integer := Pattern'Length - 1;
Num : Natural;
Ind : Natural;
Cur : Natural;
begin
if Pattern = "" then
raise Pattern_Error;
end if;
-- Check for null pointer in case checks are off
if Mapping = null then
raise Constraint_Error;
end if;
Num := 0;
Ind := Source'First;
while Ind <= Source'Last - PL1 loop
Cur := Ind;
for K in Pattern'Range loop
if Pattern (K) /= Mapping (Source (Cur)) then
Ind := Ind + 1;
goto Cont;
else
Cur := Cur + 1;
end if;
end loop;
Num := Num + 1;
Ind := Ind + Pattern'Length;
<<Cont>>
null;
end loop;
return Num;
end Count;
function Count
(Source : String;
Set : Maps.Character_Set) return Natural
is
N : Natural := 0;
begin
for J in Source'Range loop
if Is_In (Source (J), Set) then
N := N + 1;
end if;
end loop;
return N;
end Count;
----------------
-- Find_Token --
----------------
procedure Find_Token
(Source : String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural)
is
begin
for J in From .. Source'Last loop
if Belongs (Source (J), Set, Test) then
First := J;
for K in J + 1 .. Source'Last loop
if not Belongs (Source (K), Set, Test) then
Last := K - 1;
return;
end if;
end loop;
-- Here if J indexes first char of token, and all chars after J
-- are in the token.
Last := Source'Last;
return;
end if;
end loop;
-- Here if no token found
First := From;
Last := 0;
end Find_Token;
procedure Find_Token
(Source : String;
Set : Maps.Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural)
is
begin
for J in Source'Range loop
if Belongs (Source (J), Set, Test) then
First := J;
for K in J + 1 .. Source'Last loop
if not Belongs (Source (K), Set, Test) then
Last := K - 1;
return;
end if;
end loop;
-- Here if J indexes first char of token, and all chars after J
-- are in the token.
Last := Source'Last;
return;
end if;
end loop;
-- Here if no token found
First := Source'First;
Last := 0;
end Find_Token;
-----------
-- Index --
-----------
function Index
(Source : String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
PL1 : constant Integer := Pattern'Length - 1;
Cur : Natural;
Ind : Integer;
-- Index for start of match check. This can be negative if the pattern
-- length is greater than the string length, which is why this variable
-- is Integer instead of Natural. In this case, the search loops do not
-- execute at all, so this Ind value is never used.
begin
if Pattern = "" then
raise Pattern_Error;
end if;
-- Forwards case
if Going = Forward then
Ind := Source'First;
-- Unmapped forward case
if Mapping'Address = Maps.Identity'Address then
for J in 1 .. Source'Length - PL1 loop
if Pattern = Source (Ind .. Ind + PL1) then
return Ind;
else
Ind := Ind + 1;
end if;
end loop;
-- Mapped forward case
else
for J in 1 .. Source'Length - PL1 loop
Cur := Ind;
for K in Pattern'Range loop
if Pattern (K) /= Value (Mapping, Source (Cur)) then
goto Cont1;
else
Cur := Cur + 1;
end if;
end loop;
return Ind;
<<Cont1>>
Ind := Ind + 1;
end loop;
end if;
-- Backwards case
else
-- Unmapped backward case
Ind := Source'Last - PL1;
if Mapping'Address = Maps.Identity'Address then
for J in reverse 1 .. Source'Length - PL1 loop
if Pattern = Source (Ind .. Ind + PL1) then
return Ind;
else
Ind := Ind - 1;
end if;
end loop;
-- Mapped backward case
else
for J in reverse 1 .. Source'Length - PL1 loop
Cur := Ind;
for K in Pattern'Range loop
if Pattern (K) /= Value (Mapping, Source (Cur)) then
goto Cont2;
else
Cur := Cur + 1;
end if;
end loop;
return Ind;
<<Cont2>>
Ind := Ind - 1;
end loop;
end if;
end if;
-- Fall through if no match found. Note that the loops are skipped
-- completely in the case of the pattern being longer than the source.
return 0;
end Index;
function Index
(Source : String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
is
PL1 : constant Integer := Pattern'Length - 1;
Ind : Natural;
Cur : Natural;
begin
if Pattern = "" then
raise Pattern_Error;
end if;
-- Check for null pointer in case checks are off
if Mapping = null then
raise Constraint_Error;
end if;
-- If Pattern longer than Source it can't be found
if Pattern'Length > Source'Length then
return 0;
end if;
-- Forwards case
if Going = Forward then
Ind := Source'First;
for J in 1 .. Source'Length - PL1 loop
Cur := Ind;
for K in Pattern'Range loop
if Pattern (K) /= Mapping.all (Source (Cur)) then
goto Cont1;
else
Cur := Cur + 1;
end if;
end loop;
return Ind;
<<Cont1>>
Ind := Ind + 1;
end loop;
-- Backwards case
else
Ind := Source'Last - PL1;
for J in reverse 1 .. Source'Length - PL1 loop
Cur := Ind;
for K in Pattern'Range loop
if Pattern (K) /= Mapping.all (Source (Cur)) then
goto Cont2;
else
Cur := Cur + 1;
end if;
end loop;
return Ind;
<<Cont2>>
Ind := Ind - 1;
end loop;
end if;
-- Fall through if no match found. Note that the loops are skipped
-- completely in the case of the pattern being longer than the source.
return 0;
end Index;
function Index
(Source : String;
Set : Maps.Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
is
begin
-- Forwards case
if Going = Forward then
for J in Source'Range loop
if Belongs (Source (J), Set, Test) then
return J;
end if;
end loop;
-- Backwards case
else
for J in reverse Source'Range loop
if Belongs (Source (J), Set, Test) then
return J;
end if;
end loop;
end if;
-- Fall through if no match
return 0;
end Index;
function Index
(Source : String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
is
begin
if Going = Forward then
if From < Source'First then
raise Index_Error;
end if;
return
Index (Source (From .. Source'Last), Pattern, Forward, Mapping);
else
if From > Source'Last then
raise Index_Error;
end if;
return
Index (Source (Source'First .. From), Pattern, Backward, Mapping);
end if;
end Index;
function Index
(Source : String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
is
begin
if Going = Forward then
if From < Source'First then
raise Index_Error;
end if;
return Index
(Source (From .. Source'Last), Pattern, Forward, Mapping);
else
if From > Source'Last then
raise Index_Error;
end if;
return Index
(Source (Source'First .. From), Pattern, Backward, Mapping);
end if;
end Index;
function Index
(Source : String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
is
begin
if Going = Forward then
if From < Source'First then
raise Index_Error;
end if;
return
Index (Source (From .. Source'Last), Set, Test, Forward);
else
if From > Source'Last then
raise Index_Error;
end if;
return
Index (Source (Source'First .. From), Set, Test, Backward);
end if;
end Index;
---------------------
-- Index_Non_Blank --
---------------------
function Index_Non_Blank
(Source : String;
Going : Direction := Forward) return Natural
is
begin
if Going = Forward then
for J in Source'Range loop
if Source (J) /= ' ' then
return J;
end if;
end loop;
else -- Going = Backward
for J in reverse Source'Range loop
if Source (J) /= ' ' then
return J;
end if;
end loop;
end if;
-- Fall through if no match
return 0;
end Index_Non_Blank;
function Index_Non_Blank
(Source : String;
From : Positive;
Going : Direction := Forward) return Natural
is
begin
if Going = Forward then
if From < Source'First then
raise Index_Error;
end if;
return
Index_Non_Blank (Source (From .. Source'Last), Forward);
else
if From > Source'Last then
raise Index_Error;
end if;
return
Index_Non_Blank (Source (Source'First .. From), Backward);
end if;
end Index_Non_Blank;
end lace.Strings.Search;
|
-- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with Ada.Numerics.Discrete_Random;
with GNAT.String_Split;
with PortScan.Buildcycle.Pkgsrc;
with PortScan.Buildcycle.Ports;
with Replicant.Platform;
with Signals;
with Unix;
package body PortScan.Ops is
package GSS renames GNAT.String_Split;
package CYC renames PortScan.Buildcycle;
package FPC renames PortScan.Buildcycle.Ports;
package NPS renames PortScan.Buildcycle.Pkgsrc;
package REP renames Replicant;
package SIG renames Signals;
--------------------------
-- initialize_display --
--------------------------
procedure initialize_display (num_builders : builders) is
begin
if PM.configuration.avec_ncurses then
curses_support := DPY.launch_monitor (num_builders);
end if;
end initialize_display;
-------------------------
-- parallel_bulk_run --
-------------------------
procedure parallel_bulk_run (num_builders : builders; logs : dim_handlers)
is
subtype cycle_count is Natural range 1 .. 9;
subtype refresh_count is Natural range 1 .. 4;
subtype www_count is Natural range 1 .. 3;
subtype alert_count is Natural range 1 .. 200;
instructions : dim_instruction := (others => port_match_failed);
builder_states : dim_builder_state := (others => idle);
cntcycle : cycle_count := cycle_count'First;
cntrefresh : refresh_count := refresh_count'First;
cntalert : alert_count := alert_count'First;
cntwww : www_count := www_count'First;
run_complete : Boolean := False;
available : Positive := Integer (num_builders);
target : port_id;
all_idle : Boolean;
cntskip : Natural;
sumdata : DPY.summary_rec;
task type build (builder : builders);
task body build
is
type Rand_Draw is range 1 .. 20;
package Rand20 is new Ada.Numerics.Discrete_Random (Rand_Draw);
seed : Rand20.Generator;
build_result : Boolean;
opts : REP.slave_options;
begin
if builder <= num_builders then
if not curses_support then
TIO.Put_Line (CYC.elapsed_now & " => [" &
JT.zeropad (Integer (builder), 2) &
"] Builder launched");
end if;
loop
exit when builder_states (builder) = shutdown;
if builder_states (builder) = tasked then
builder_states (builder) := busy;
opts.need_procfs :=
all_ports (instructions (builder)).use_procfs;
opts.need_linprocfs :=
all_ports (instructions (builder)).use_linprocfs;
REP.launch_slave (id => builder, opts => opts);
case software_framework is
when ports_collection =>
build_result :=
FPC.build_package (builder, instructions (builder));
when pkgsrc =>
if not REP.Platform.standalone_pkg8_install (builder)
then
build_result := False;
else
build_result := NPS.build_package
(builder, instructions (builder));
end if;
end case;
REP.destroy_slave (id => builder, opts => opts);
if build_result then
builder_states (builder) := done_success;
else
builder_states (builder) := done_failure;
end if;
else
-- idle or done-(failure|success), just wait a bit
delay 0.1;
end if;
end loop;
if not curses_support then
TIO.Put_Line (CYC.elapsed_now & " => [" &
JT.zeropad (Integer (builder), 2) &
"] Shutting down");
end if;
end if;
end build;
builder_01 : build (builder => 1);
builder_02 : build (builder => 2);
builder_03 : build (builder => 3);
builder_04 : build (builder => 4);
builder_05 : build (builder => 5);
builder_06 : build (builder => 6);
builder_07 : build (builder => 7);
builder_08 : build (builder => 8);
builder_09 : build (builder => 9);
builder_10 : build (builder => 10);
builder_11 : build (builder => 11);
builder_12 : build (builder => 12);
builder_13 : build (builder => 13);
builder_14 : build (builder => 14);
builder_15 : build (builder => 15);
builder_16 : build (builder => 16);
builder_17 : build (builder => 17);
builder_18 : build (builder => 18);
builder_19 : build (builder => 19);
builder_20 : build (builder => 20);
builder_21 : build (builder => 21);
builder_22 : build (builder => 22);
builder_23 : build (builder => 23);
builder_24 : build (builder => 24);
builder_25 : build (builder => 25);
builder_26 : build (builder => 26);
builder_27 : build (builder => 27);
builder_28 : build (builder => 28);
builder_29 : build (builder => 29);
builder_30 : build (builder => 30);
builder_31 : build (builder => 31);
builder_32 : build (builder => 32);
builder_33 : build (builder => 33);
builder_34 : build (builder => 34);
builder_35 : build (builder => 35);
builder_36 : build (builder => 36);
builder_37 : build (builder => 37);
builder_38 : build (builder => 38);
builder_39 : build (builder => 39);
builder_40 : build (builder => 40);
builder_41 : build (builder => 41);
builder_42 : build (builder => 42);
builder_43 : build (builder => 43);
builder_44 : build (builder => 44);
builder_45 : build (builder => 45);
builder_46 : build (builder => 46);
builder_47 : build (builder => 47);
builder_48 : build (builder => 48);
builder_49 : build (builder => 49);
builder_50 : build (builder => 50);
builder_51 : build (builder => 51);
builder_52 : build (builder => 52);
builder_53 : build (builder => 53);
builder_54 : build (builder => 54);
builder_55 : build (builder => 55);
builder_56 : build (builder => 56);
builder_57 : build (builder => 57);
builder_58 : build (builder => 58);
builder_59 : build (builder => 59);
builder_60 : build (builder => 60);
builder_61 : build (builder => 61);
builder_62 : build (builder => 62);
builder_63 : build (builder => 63);
builder_64 : build (builder => 64);
-- Expansion of cpu_range from 32 to 64 means 128 possible builders
builder_65 : build (builder => 65);
builder_66 : build (builder => 66);
builder_67 : build (builder => 67);
builder_68 : build (builder => 68);
builder_69 : build (builder => 69);
builder_70 : build (builder => 70);
builder_71 : build (builder => 71);
builder_72 : build (builder => 72);
builder_73 : build (builder => 73);
builder_74 : build (builder => 74);
builder_75 : build (builder => 75);
builder_76 : build (builder => 76);
builder_77 : build (builder => 77);
builder_78 : build (builder => 78);
builder_79 : build (builder => 79);
builder_80 : build (builder => 80);
builder_81 : build (builder => 81);
builder_82 : build (builder => 82);
builder_83 : build (builder => 83);
builder_84 : build (builder => 84);
builder_85 : build (builder => 85);
builder_86 : build (builder => 86);
builder_87 : build (builder => 87);
builder_88 : build (builder => 88);
builder_89 : build (builder => 89);
builder_90 : build (builder => 90);
builder_91 : build (builder => 91);
builder_92 : build (builder => 92);
builder_93 : build (builder => 93);
builder_94 : build (builder => 94);
builder_95 : build (builder => 95);
builder_96 : build (builder => 96);
builder_97 : build (builder => 97);
builder_98 : build (builder => 98);
builder_99 : build (builder => 99);
builder_100 : build (builder => 100);
builder_101 : build (builder => 101);
builder_102 : build (builder => 102);
builder_103 : build (builder => 103);
builder_104 : build (builder => 104);
builder_105 : build (builder => 105);
builder_106 : build (builder => 106);
builder_107 : build (builder => 107);
builder_108 : build (builder => 108);
builder_109 : build (builder => 109);
builder_110 : build (builder => 110);
builder_111 : build (builder => 111);
builder_112 : build (builder => 112);
builder_113 : build (builder => 113);
builder_114 : build (builder => 114);
builder_115 : build (builder => 115);
builder_116 : build (builder => 116);
builder_117 : build (builder => 117);
builder_118 : build (builder => 118);
builder_119 : build (builder => 119);
builder_120 : build (builder => 120);
builder_121 : build (builder => 121);
builder_122 : build (builder => 122);
builder_123 : build (builder => 123);
builder_124 : build (builder => 124);
builder_125 : build (builder => 125);
builder_126 : build (builder => 126);
builder_127 : build (builder => 127);
builder_128 : build (builder => 128);
begin
loop
all_idle := True;
for slave in 1 .. num_builders loop
declare
begin
case builder_states (slave) is
when busy | tasked =>
all_idle := False;
when shutdown =>
null;
when idle =>
if run_complete then
builder_states (slave) := shutdown;
else
target := top_buildable_port;
if target = port_match_failed then
if SIG.graceful_shutdown_requested or else
nothing_left (num_builders)
then
run_complete := True;
builder_states (slave) := shutdown;
DPY.insert_history (assemble_HR (slave, 0,
DPY.action_shutdown));
else
if shutdown_recommended (available) then
builder_states (slave) := shutdown;
DPY.insert_history (assemble_HR (slave, 0,
DPY.action_shutdown));
available := available - 1;
end if;
end if;
else
lock_package (target);
instructions (slave) := target;
builder_states (slave) := tasked;
TIO.Put_Line (logs (total), CYC.elapsed_now & " [" &
JT.zeropad (Integer (slave), 2) & "] => " &
port_name (instructions (slave)));
if not curses_support then
TIO.Put_Line (CYC.elapsed_now & " => [" &
JT.zeropad (Integer (slave), 2) &
"] Kickoff " &
port_name (instructions (slave)));
end if;
end if;
end if;
when done_success | done_failure =>
all_idle := False;
if builder_states (slave) = done_success then
if curses_support then
DPY.insert_history
(assemble_HR (slave, instructions (slave),
DPY.action_success));
else
TIO.Put_Line (CYC.elapsed_now & " => [" &
JT.zeropad (Integer (slave), 2) &
"] " & CYC.elapsed_build (slave) &
" Success " &
port_name (instructions (slave)));
end if;
record_history_built (elapsed => CYC.elapsed_now,
slave_id => slave,
origin => port_name (instructions (slave)),
duration => CYC.elapsed_build (slave));
run_package_hook (pkg_success, instructions (slave));
cascade_successful_build (instructions (slave));
bld_counter (success) := bld_counter (success) + 1;
TIO.Put_Line (logs (success), CYC.elapsed_now & " " &
port_name (instructions (slave)));
TIO.Put_Line (logs (total), CYC.elapsed_now & " " &
port_name (instructions (slave)) &
" success");
else
TIO.Put_Line (logs (total), CYC.elapsed_now & " " &
port_name (instructions (slave)) &
" FAILED!");
cascade_failed_build (instructions (slave), cntskip, logs);
bld_counter (skipped) := bld_counter (skipped) + cntskip;
bld_counter (failure) := bld_counter (failure) + 1;
TIO.Put_Line (logs (total), CYC.elapsed_now & " " &
port_name (instructions (slave)) &
" failure skips:" & JT.int2str (cntskip));
TIO.Put_Line (logs (failure), CYC.elapsed_now & " " &
port_name (instructions (slave)) &
" (skipped" & cntskip'Img & ")");
if curses_support then
DPY.insert_history
(assemble_HR (slave, instructions (slave),
DPY.action_failure));
else
TIO.Put_Line (CYC.elapsed_now & " => [" &
JT.zeropad (Integer (slave), 2) &
"] " & CYC.elapsed_build (slave) &
" Failure " &
port_name (instructions (slave)));
end if;
case software_framework is
when ports_collection =>
record_history_failed
(elapsed => CYC.elapsed_now,
slave_id => slave,
origin => port_name (instructions (slave)),
duration => CYC.elapsed_build (slave),
die_phase => FPC.last_build_phase (slave),
skips => cntskip);
when pkgsrc =>
record_history_failed
(elapsed => CYC.elapsed_now,
slave_id => slave,
origin => port_name (instructions (slave)),
duration => CYC.elapsed_build (slave),
die_phase => NPS.last_build_phase (slave),
skips => cntskip);
end case;
run_package_hook (pkg_failure, instructions (slave));
end if;
instructions (slave) := port_match_failed;
if run_complete then
builder_states (slave) := shutdown;
DPY.insert_history (assemble_HR (slave, 0,
DPY.action_shutdown));
else
builder_states (slave) := idle;
end if;
end case;
exception
when earthquake : others => TIO.Put_Line
(logs (total), CYC.elapsed_now & " UNHANDLED EXCEPTION: " &
EX.Exception_Information (earthquake));
end;
end loop;
exit when run_complete and all_idle;
if cntcycle = cycle_count'Last then
cntcycle := cycle_count'First;
TIO.Flush (logs (success));
TIO.Flush (logs (failure));
TIO.Flush (logs (skipped));
TIO.Flush (logs (total));
if curses_support then
if cntrefresh = refresh_count'Last then
cntrefresh := refresh_count'First;
DPY.set_full_redraw_next_update;
else
cntrefresh := cntrefresh + 1;
end if;
sumdata.Initially := bld_counter (total);
sumdata.Built := bld_counter (success);
sumdata.Failed := bld_counter (failure);
sumdata.Ignored := bld_counter (ignored);
sumdata.Skipped := bld_counter (skipped);
sumdata.elapsed := CYC.elapsed_now;
sumdata.swap := get_swap_status;
sumdata.load := REP.Platform.get_instant_load;
sumdata.pkg_hour := hourly_build_rate;
sumdata.impulse := impulse_rate;
DPY.summarize (sumdata);
for b in builders'First .. num_builders loop
case software_framework is
when ports_collection =>
if builder_states (b) = shutdown then
DPY.update_builder (FPC.builder_status (b, True, False));
elsif builder_states (b) = idle then
DPY.update_builder (FPC.builder_status (b, False, True));
else
CYC.set_log_lines (b);
DPY.update_builder (FPC.builder_status (b));
end if;
when pkgsrc =>
if builder_states (b) = shutdown then
DPY.update_builder (NPS.builder_status (b, True, False));
elsif builder_states (b) = idle then
DPY.update_builder (NPS.builder_status (b, False, True));
else
CYC.set_log_lines (b);
DPY.update_builder (NPS.builder_status (b));
end if;
end case;
end loop;
DPY.refresh_builder_window;
DPY.refresh_history_window;
else
-- text mode support, periodic status reports
if cntalert = alert_count'Last then
cntalert := alert_count'First;
declare
Remaining : constant Integer := bld_counter (total) -
bld_counter (success) - bld_counter (failure) -
bld_counter (ignored) - bld_counter (skipped);
begin
TIO.Put_Line (CYC.elapsed_now & " => " &
" Left:" & Remaining'Img &
" Succ:" & bld_counter (success)'Img &
" Fail:" & bld_counter (failure)'Img &
" Skip:" & bld_counter (skipped)'Img &
" Ign:" & bld_counter (ignored)'Img);
end;
else
cntalert := cntalert + 1;
end if;
-- Update log lines every 4 seconds for the watchdog
if cntrefresh = refresh_count'Last then
cntrefresh := refresh_count'First;
for b in builders'First .. num_builders loop
if builder_states (b) /= shutdown and then
builder_states (b) /= idle
then
CYC.set_log_lines (b);
end if;
end loop;
else
cntrefresh := cntrefresh + 1;
end if;
end if;
-- Generate latest history file every 3 seconds.
-- With a poll period of 6 seconds, we need twice that frequency to avoid aliasing
-- Note that in text mode, the logs are updated every 4 seconds, so in this mode
-- the log lines will often be identical for a cycle.
if cntwww = www_count'Last then
cntwww := www_count'First;
write_history_json;
write_summary_json (active => True,
states => builder_states,
num_builders => num_builders,
num_history_files => history.segment);
else
cntwww := cntwww + 1;
end if;
else
cntcycle := cntcycle + 1;
end if;
delay 0.10;
end loop;
if PM.configuration.avec_ncurses and then curses_support
then
DPY.terminate_monitor;
end if;
write_history_json;
write_summary_json (active => False,
states => builder_states,
num_builders => num_builders,
num_history_files => history.segment);
run_hook (run_end, "PORTS_BUILT=" & JT.int2str (bld_counter (success)) &
" PORTS_FAILED=" & JT.int2str (bld_counter (failure)) &
" PORTS_IGNORED=" & JT.int2str (bld_counter (ignored)) &
" PORTS_SKIPPED=" & JT.int2str (bld_counter (skipped)));
end parallel_bulk_run;
--------------------
-- lock_package --
--------------------
procedure lock_package (id : port_id) is
begin
if id /= port_match_failed then
all_ports (id).work_locked := True;
end if;
end lock_package;
----------------------------
-- cascade_failed_build --
----------------------------
procedure cascade_failed_build (id : port_id; numskipped : out Natural;
logs : dim_handlers)
is
purged : PortScan.port_id;
culprit : constant String := port_name (id);
begin
numskipped := 0;
loop
purged := skip_next_reverse_dependency (id);
exit when purged = port_match_failed;
if skip_verified (purged) then
numskipped := numskipped + 1;
TIO.Put_Line (logs (total), " Skipped: " &
port_name (purged));
TIO.Put_Line (logs (skipped),
port_name (purged) & " by " & culprit);
DPY.insert_history (assemble_HR (1, purged, DPY.action_skipped));
record_history_skipped (elapsed => CYC.elapsed_now,
origin => port_name (purged),
reason => culprit);
run_package_hook (pkg_skipped, purged);
end if;
end loop;
unlist_port (id);
end cascade_failed_build;
--------------------------------
-- cascade_successful_build --
--------------------------------
procedure cascade_successful_build (id : port_id)
is
procedure cycle (cursor : block_crate.Cursor);
procedure cycle (cursor : block_crate.Cursor)
is
target : constant port_index := block_crate.Element (cursor);
begin
if all_ports (target).blocked_by.Contains (Key => id) then
all_ports (target).blocked_by.Delete (Key => id);
else
raise seek_failure
with port_name (target) & " was expected to be blocked by " &
port_name (id);
end if;
end cycle;
begin
all_ports (id).blocks.Iterate (cycle'Access);
delete_rank (id);
end cascade_successful_build;
--------------------------
-- top_buildable_port --
--------------------------
function top_buildable_port return port_id
is
list_len : constant Integer := Integer (rank_queue.Length);
cursor : ranking_crate.Cursor;
QR : queue_record;
result : port_id := port_match_failed;
begin
if list_len = 0 then
return result;
end if;
cursor := rank_queue.First;
for k in 1 .. list_len loop
QR := ranking_crate.Element (Position => cursor);
if not all_ports (QR.ap_index).work_locked and then
all_ports (QR.ap_index).blocked_by.Is_Empty
then
result := QR.ap_index;
exit;
end if;
cursor := ranking_crate.Next (Position => cursor);
end loop;
if SIG.graceful_shutdown_requested then
return port_match_failed;
end if;
return result;
end top_buildable_port;
----------------------------
-- shutdown_recommended --
----------------------------
function shutdown_recommended (active_builders : Positive) return Boolean
is
list_len : constant Natural := Integer (rank_queue.Length);
list_max : constant Positive := 2 * active_builders;
num_wait : Natural := 0;
cursor : ranking_crate.Cursor;
QR : queue_record;
begin
if list_len = 0 or else list_len >= list_max then
return False;
end if;
cursor := rank_queue.First;
for k in 1 .. list_len loop
QR := ranking_crate.Element (Position => cursor);
if not all_ports (QR.ap_index).work_locked then
num_wait := num_wait + 1;
if num_wait >= active_builders then
return False;
end if;
end if;
cursor := ranking_crate.Next (Position => cursor);
end loop;
return True;
end shutdown_recommended;
--------------------
-- nothing_left --
--------------------
function nothing_left (num_builders : builders) return Boolean
is
list_len : constant Integer := Integer (rank_queue.Length);
begin
return list_len = 0;
end nothing_left;
------------------
-- rank_arrow --
------------------
function rank_arrow (id : port_id) return ranking_crate.Cursor
is
rscore : constant port_index := all_ports (id).reverse_score;
seek_target : constant queue_record := (ap_index => id,
reverse_score => rscore);
begin
return rank_queue.Find (seek_target);
end rank_arrow;
-------------------
-- delete_rank --
-------------------
procedure delete_rank (id : port_id)
is
rank_cursor : ranking_crate.Cursor := rank_arrow (id);
use type ranking_crate.Cursor;
begin
if rank_cursor /= ranking_crate.No_Element then
rank_queue.Delete (Position => rank_cursor);
end if;
end delete_rank;
--------------------
-- still_ranked --
--------------------
function still_ranked (id : port_id) return Boolean
is
rank_cursor : ranking_crate.Cursor := rank_arrow (id);
use type ranking_crate.Cursor;
begin
return rank_cursor /= ranking_crate.No_Element;
end still_ranked;
------------------------
-- integrity_intact --
------------------------
function integrity_intact return Boolean
is
procedure check_dep (cursor : block_crate.Cursor);
procedure check_rank (cursor : ranking_crate.Cursor);
intact : Boolean := True;
procedure check_dep (cursor : block_crate.Cursor)
is
did : constant port_index := block_crate.Element (cursor);
begin
if not still_ranked (did) then
intact := False;
end if;
end check_dep;
procedure check_rank (cursor : ranking_crate.Cursor)
is
QR : constant queue_record := ranking_crate.Element (cursor);
begin
if intact then
all_ports (QR.ap_index).blocked_by.Iterate (check_dep'Access);
end if;
end check_rank;
begin
rank_queue.Iterate (check_rank'Access);
return intact;
end integrity_intact;
---------------------
-- skip_verified --
---------------------
function skip_verified (id : port_id) return Boolean is
begin
if id = port_match_failed then
return False;
end if;
return not all_ports (id).unlist_failed;
end skip_verified;
--------------------
-- queue_length --
--------------------
function queue_length return Integer is
begin
return Integer (rank_queue.Length);
end queue_length;
-------------------
-- unlist_port --
-------------------
procedure unlist_port (id : port_id) is
begin
if id = port_match_failed then
return;
end if;
if still_ranked (id) then
delete_rank (id);
else
-- don't raise exception. Since we don't prune all_reverse as
-- we go, there's no guarantee the reverse dependency hasn't already
-- been removed (e.g. when it is a common reverse dep)
all_ports (id).unlist_failed := True;
end if;
end unlist_port;
------------------------------------
-- skip_next_reverse_dependency --
------------------------------------
function skip_next_reverse_dependency (pinnacle : port_id) return port_id
is
rev_cursor : block_crate.Cursor;
next_dep : port_index;
begin
if all_ports (pinnacle).all_reverse.Is_Empty then
return port_match_failed;
end if;
rev_cursor := all_ports (pinnacle).all_reverse.First;
next_dep := block_crate.Element (rev_cursor);
unlist_port (id => next_dep);
all_ports (pinnacle).all_reverse.Delete (rev_cursor);
return next_dep;
end skip_next_reverse_dependency;
---------------------
-- ignore_reason --
---------------------
function ignore_reason (id : port_id) return String is
begin
if id = port_match_failed or else
id > last_port
then
return "Invalid port ID";
end if;
return JT.USS (all_ports (id).ignore_reason);
end ignore_reason;
-------------------------
-- next_ignored_port --
-------------------------
function next_ignored_port return port_id
is
list_len : constant Integer := Integer (rank_queue.Length);
cursor : ranking_crate.Cursor;
QR : queue_record;
result : port_id := port_match_failed;
begin
if list_len = 0 then
return result;
end if;
cursor := rank_queue.First;
for k in 1 .. list_len loop
QR := ranking_crate.Element (Position => cursor);
if all_ports (QR.ap_index).ignored then
result := QR.ap_index;
DPY.insert_history (assemble_HR (1, QR.ap_index,
DPY.action_ignored));
run_package_hook (pkg_ignored, QR.ap_index);
exit;
end if;
cursor := ranking_crate.Next (Position => cursor);
end loop;
return result;
end next_ignored_port;
-----------------
-- port_name --
-----------------
function port_name (id : port_id) return String is
begin
if id = port_match_failed or else
id > last_port
then
return "Invalid port ID";
end if;
return get_catport (all_ports (id));
end port_name;
-----------------------
-- get_swap_status --
-----------------------
function get_swap_status return Float
is
type memtype is mod 2**64;
command : String := REP.Platform.swapinfo_command;
status : Integer;
comres : JT.Text;
blocks_total : memtype := 0;
blocks_used : memtype := 0;
begin
comres := Unix.piped_command (command, status);
if status /= 0 then
return 200.0; -- [ERROR] Signal to set swap display to "N/A"
end if;
-- Throw first line away, e.g "Device 1K-blocks Used Avail ..."
-- Distinguishes platforms though:
-- Net/Free/Dragon start with "Device"
-- Linux starts with "NAME"
-- Solaris starts with "swapfile"
-- On FreeBSD (DragonFly too?), when multiple swap used, ignore line starting "Total"
declare
command_result : String := JT.USS (comres);
markers : JT.Line_Markers;
line_present : Boolean;
begin
JT.initialize_markers (command_result, markers);
-- Throw first line away (valid for all platforms
line_present := JT.next_line_present (command_result, markers);
if line_present then
declare
line : String := JT.extract_line (command_result, markers);
begin
null;
end;
else
return 200.0; -- [ERROR] Signal to set swap display to "N/A"
end if;
loop
exit when not JT.next_line_present (command_result, markers);
declare
line : constant String :=
JT.strip_excessive_spaces (JT.extract_line (command_result, markers));
begin
if JT.specific_field (line, 1) /= "Total" then
blocks_total := blocks_total + memtype'Value (JT.specific_field (line, 2));
blocks_used := blocks_used + memtype'Value (JT.specific_field (line, 3));
end if;
exception
when Constraint_Error =>
return 200.0; -- [ERROR] Signal to set swap display to "N/A"
end;
end loop;
end;
if blocks_total = 0 then
return 200.0; -- Signal to set swap display to "N/A"
else
return 100.0 * Float (blocks_used) / Float (blocks_total);
end if;
end get_swap_status;
-------------------------
-- hourly_build_rate --
-------------------------
function hourly_build_rate return Natural
is
pkg_that_count : constant Natural := bld_counter (success) +
bld_counter (failure);
begin
return CYC.get_packages_per_hour (pkg_that_count, start_time);
end hourly_build_rate;
--------------------
-- impulse_rate --
--------------------
function impulse_rate return Natural
is
pkg_that_count : constant Natural := bld_counter (success) +
bld_counter (failure);
pkg_diff : Natural;
result : Natural;
begin
if impulse_counter = impulse_range'Last then
impulse_counter := impulse_range'First;
else
impulse_counter := impulse_counter + 1;
end if;
if impulse_data (impulse_counter).virgin then
impulse_data (impulse_counter).hack := CAL.Clock;
impulse_data (impulse_counter).packages := pkg_that_count;
impulse_data (impulse_counter).virgin := False;
return CYC.get_packages_per_hour (pkg_that_count, start_time);
end if;
pkg_diff := pkg_that_count - impulse_data (impulse_counter).packages;
result := CYC.get_packages_per_hour
(packages_done => pkg_diff,
from_when => impulse_data (impulse_counter).hack);
impulse_data (impulse_counter).hack := CAL.Clock;
impulse_data (impulse_counter).packages := pkg_that_count;
return result;
exception
when others => return 0;
end impulse_rate;
-------------------
-- assemble_HR --
-------------------
function assemble_HR (slave : builders; pid : port_id;
action : DPY.history_action)
return DPY.history_rec
is
HR : DPY.history_rec;
HOLast : constant Natural := DPY.history_origin'Last;
catport : String := port_name (pid);
hyphens : constant DPY.history_elapsed := "--:--:--";
begin
HR.id := slave;
HR.slavid := JT.zeropad (Integer (slave), 2);
HR.established := True;
HR.action := action;
HR.origin := (others => ' ');
HR.run_elapsed := CYC.elapsed_now;
if action = DPY.action_shutdown then
HR.pkg_elapsed := hyphens;
else
if action = DPY.action_skipped or else
action = DPY.action_ignored
then
HR.pkg_elapsed := hyphens;
else
HR.pkg_elapsed := CYC.elapsed_build (slave);
end if;
if catport'Last > HOLast then
HR.origin (1 .. HOLast - 1) := catport (1 .. HOLast - 1);
HR.origin (HOLast) := LAT.Asterisk;
else
HR.origin (1 .. catport'Last) := catport;
end if;
end if;
return HR;
end assemble_HR;
------------------------
-- initialize_hooks --
------------------------
procedure initialize_hooks is
begin
for hook in hook_type'Range loop
declare
script : constant String := JT.USS (hook_location (hook));
begin
active_hook (hook) := AD.Exists (script) and then
REP.Platform.file_is_executable (script);
end;
end loop;
end initialize_hooks;
----------------------
-- run_start_hook --
----------------------
procedure run_start_hook is
begin
run_hook (run_start, "PORTS_QUEUED=" & JT.int2str (queue_length) & " ");
end run_start_hook;
----------------
-- run_hook --
----------------
procedure run_hook (hook : hook_type; envvar_list : String)
is
function nvpair (name : String; value : JT.Text) return String;
function nvpair (name : String; value : JT.Text) return String is
begin
return name & LAT.Equals_Sign & LAT.Quotation &
JT.USS (value) & LAT.Quotation & LAT.Space;
end nvpair;
common_env : constant String :=
nvpair ("PROFILE", PM.configuration.profile) &
nvpair ("DIR_PACKAGES", PM.configuration.dir_packages) &
nvpair ("DIR_REPOSITORY", PM.configuration.dir_repository) &
nvpair ("DIR_PORTS", PM.configuration.dir_portsdir) &
nvpair ("DIR_OPTIONS", PM.configuration.dir_options) &
nvpair ("DIR_DISTFILES", PM.configuration.dir_distfiles) &
nvpair ("DIR_LOGS", PM.configuration.dir_logs) &
nvpair ("DIR_BUILDBASE", PM.configuration.dir_buildbase);
-- The follow command works on every platform
command : constant String := "/usr/bin/env -i " & common_env &
envvar_list & " " & JT.USS (hook_location (hook));
begin
if not active_hook (hook) then
return;
end if;
if Unix.external_command (command) then
null;
end if;
end run_hook;
------------------------
-- run_package_hook --
------------------------
procedure run_package_hook (hook : hook_type; id : port_id)
is
pn : constant String := port_name (id);
tail : String := " ORIGIN=" & JT.part_1 (pn, "@") &
" FLAVOR=" & JT.part_2 (pn, "@") &
" PKGNAME=" & package_name (id) & " ";
begin
case hook is
when pkg_success => run_hook (hook, "RESULT=success" & tail);
when pkg_failure => run_hook (hook, "RESULT=failure" & tail);
when pkg_ignored => run_hook (hook, "RESULT=ignored" & tail);
when pkg_skipped => run_hook (hook, "RESULT=skipped" & tail);
when others => null;
end case;
end run_package_hook;
----------------------------
-- run_hook_after_build --
----------------------------
procedure run_hook_after_build (built : Boolean; id : port_id) is
begin
if built then
run_package_hook (pkg_success, id);
else
run_package_hook (pkg_failure, id);
end if;
end run_hook_after_build;
--------------------
-- package_name --
--------------------
function package_name (id : port_id) return String is
begin
if id = port_match_failed or else
id > last_port
then
return "Invalid port ID";
end if;
declare
fullname : constant String := JT.USS (all_ports (id).package_name);
begin
return fullname (1 .. fullname'Length - 4);
end;
end package_name;
-----------------------------
-- initialize_web_report --
-----------------------------
procedure initialize_web_report (num_builders : builders) is
idle_slaves : constant dim_builder_state := (others => idle);
reportdir : constant String := JT.USS (PM.configuration.dir_logs) & "/Report";
sharedir : constant String := host_localbase & "/share/synth";
begin
AD.Create_Path (reportdir);
AD.Copy_File (sharedir & "/synth.png", reportdir & "/synth.png");
AD.Copy_File (sharedir & "/favicon.png", reportdir & "/favicon.png");
AD.Copy_File (sharedir & "/progress.js", reportdir & "/progress.js");
AD.Copy_File (sharedir & "/progress.css", reportdir & "/progress.css");
AD.Copy_File (sharedir & "/progress.html", reportdir & "/index.html");
write_summary_json (active => True,
states => idle_slaves,
num_builders => num_builders,
num_history_files => 0);
end initialize_web_report;
-----------------------------------------
-- delete_existing_web_history_files --
-----------------------------------------
procedure delete_existing_web_history_files
is
search : AD.Search_Type;
dirent : AD.Directory_Entry_Type;
pattern : constant String := "*_history.json";
filter : constant AD.Filter_Type := (AD.Ordinary_File => True, others => False);
reportdir : constant String := JT.USS (PM.configuration.dir_logs) & "/Report";
begin
if not AD.Exists (reportdir) then
return;
end if;
AD.Start_Search (Search => search,
Directory => reportdir,
Pattern => pattern,
Filter => filter);
while AD.More_Entries (search) loop
AD.Get_Next_Entry (search, dirent);
AD.Delete_File (reportdir & "/" & AD.Simple_Name (dirent));
end loop;
exception
when AD.Name_Error => null;
end delete_existing_web_history_files;
-----------------------
-- nv (2 versions) --
-----------------------
function nv (name, value : String) return String is
begin
return ASCII.Quotation & name & ASCII.Quotation & ASCII.Colon &
ASCII.Quotation & value & ASCII.Quotation;
end nv;
function nv (name : String; value : Integer) return String is
begin
return ASCII.Quotation & name & ASCII.Quotation & ASCII.Colon & JT.int2str (value);
end nv;
--------------------------
-- write_summary_json --
--------------------------
procedure write_summary_json
(active : Boolean;
states : dim_builder_state;
num_builders : builders;
num_history_files : Natural)
is
function TF (value : Boolean) return Natural;
function TF (value : Boolean) return Natural is
begin
if value then
return 1;
else
return 0;
end if;
end TF;
jsonfile : TIO.File_Type;
filename : constant String := JT.USS (PM.configuration.dir_logs) & "/Report/summary.json";
leftover : constant Integer := bld_counter (total) - bld_counter (success) -
bld_counter (failure) - bld_counter (ignored) - bld_counter (skipped);
slave : DPY.builder_rec;
begin
-- Try to defend malicious symlink: https://en.wikipedia.org/wiki/Symlink_race
if AD.Exists (filename) then
AD.Delete_File (filename);
end if;
TIO.Create (File => jsonfile,
Mode => TIO.Out_File,
Name => filename);
TIO.Put (jsonfile, "{" & ASCII.LF &
" " & nv ("profile", JT.USS (PM.configuration.profile)) & ASCII.LF);
TIO.Put
(jsonfile,
" ," & nv ("kickoff", timestamp (start_time, True)) & ASCII.LF &
" ," & nv ("kfiles", num_history_files) & ASCII.LF &
" ," & nv ("active", TF (active)) & ASCII.LF &
" ," & ASCII.Quotation & "stats" & ASCII.Quotation & ASCII.Colon & "{" & ASCII.LF);
TIO.Put
(jsonfile,
" " & nv ("queued", bld_counter (total)) & ASCII.LF &
" ," & nv ("built", bld_counter (success)) & ASCII.LF &
" ," & nv ("failed", bld_counter (failure)) & ASCII.LF &
" ," & nv ("ignored", bld_counter (ignored)) & ASCII.LF &
" ," & nv ("skipped", bld_counter (skipped)) & ASCII.LF &
" ," & nv ("remains", leftover) & ASCII.LF &
" ," & nv ("elapsed", CYC.elapsed_now) & ASCII.LF &
" ," & nv ("pkghour", hourly_build_rate) & ASCII.LF &
" ," & nv ("impulse", impulse_rate) & ASCII.LF &
" ," & nv ("swapinfo", DPY.fmtpc (get_swap_status, True)) & ASCII.LF &
" ," & nv ("load", DPY.fmtload (REP.Platform.get_instant_load)) & ASCII.LF &
" }" & ASCII.LF &
" ," & ASCII.Quotation & "builders" & ASCII.Quotation & ASCII.Colon & "[" & ASCII.LF);
for b in builders'First .. num_builders loop
case software_framework is
when ports_collection =>
if states (b) = shutdown then
slave := FPC.builder_status (b, True, False);
elsif states (b) = idle then
slave := FPC.builder_status (b, False, True);
else
slave := FPC.builder_status (b);
end if;
when pkgsrc =>
if states (b) = shutdown then
slave := NPS.builder_status (b, True, False);
elsif states (b) = idle then
slave := NPS.builder_status (b, False, True);
else
slave := NPS.builder_status (b);
end if;
end case;
if b = builders'First then
TIO.Put (jsonfile, " {" & ASCII.LF);
else
TIO.Put (jsonfile, " ,{" & ASCII.LF);
end if;
TIO.Put
(jsonfile,
" " & nv ("ID", slave.slavid) & ASCII.LF &
" ," & nv ("elapsed", JT.trim (slave.Elapsed)) & ASCII.LF &
" ," & nv ("phase", JT.trim (slave.phase)) & ASCII.LF &
" ," & nv ("origin", JT.trim (slave.origin)) & ASCII.LF &
" ," & nv ("lines", JT.trim (slave.LLines)) & ASCII.LF &
" }" & ASCII.LF);
end loop;
TIO.Put (jsonfile, " ]" & ASCII.LF & "}" & ASCII.LF);
TIO.Close (jsonfile);
exception
when others =>
if TIO.Is_Open (jsonfile) then
TIO.Close (jsonfile);
end if;
end write_summary_json;
----------------------------
-- write_history_json --
----------------------------
procedure write_history_json
is
jsonfile : TIO.File_Type;
filename : constant String := JT.USS (PM.configuration.dir_logs) &
"/Report/" & JT.zeropad (history.segment, 2) & "_history.json";
begin
if history.segment_count = 0 then
return;
end if;
if history.last_written = history.last_index then
return;
end if;
TIO.Create (File => jsonfile,
Mode => TIO.Out_File,
Name => filename);
TIO.Put (jsonfile, history.content (1 .. history.last_index));
TIO.Put (jsonfile, "]");
TIO.Close (jsonfile);
history.last_written := history.last_index;
exception
when others =>
if TIO.Is_Open (jsonfile) then
TIO.Close (jsonfile);
end if;
end write_history_json;
----------------------------
-- assimulate_substring --
----------------------------
procedure assimulate_substring
(history : in out progress_history;
substring : String)
is
first : constant Positive := history.last_index + 1;
last : constant Positive := history.last_index + substring'Length;
begin
-- silently fail (this shouldn't be practically possible)
if last < kfile_content'Last then
history.content (first .. last) := substring;
end if;
history.last_index := last;
end assimulate_substring;
----------------------------
-- record_history_built --
----------------------------
procedure handle_first_history_entry is
begin
if history.segment_count = 1 then
assimulate_substring (history, "[" & ASCII.LF & " {" & ASCII.LF);
else
assimulate_substring (history, " ,{" & ASCII.LF);
end if;
end handle_first_history_entry;
----------------------------
-- record_history_built --
----------------------------
procedure record_history_built
(elapsed : String;
slave_id : builders;
origin : String;
duration : String)
is
ID : constant String := JT.zeropad (Integer (slave_id), 2);
begin
history.log_entry := history.log_entry + 1;
history.segment_count := history.segment_count + 1;
handle_first_history_entry;
assimulate_substring (history, " " & nv ("entry", history.log_entry) & ASCII.LF);
assimulate_substring (history, " ," & nv ("elapsed", elapsed) & ASCII.LF);
assimulate_substring (history, " ," & nv ("ID", ID) & ASCII.LF);
assimulate_substring (history, " ," & nv ("result", "built") & ASCII.LF);
assimulate_substring (history, " ," & nv ("origin", origin) & ASCII.LF);
assimulate_substring (history, " ," & nv ("info", "") & ASCII.LF);
assimulate_substring (history, " ," & nv ("duration", duration) & ASCII.LF);
assimulate_substring (history, " }" & ASCII.LF);
check_history_segment_capacity;
end record_history_built;
-----------------------------
-- record_history_failed --
-----------------------------
procedure record_history_failed
(elapsed : String;
slave_id : builders;
origin : String;
duration : String;
die_phase : String;
skips : Natural)
is
info : constant String := die_phase & ":" & JT.int2str (skips);
ID : constant String := JT.zeropad (Integer (slave_id), 2);
begin
history.log_entry := history.log_entry + 1;
history.segment_count := history.segment_count + 1;
handle_first_history_entry;
assimulate_substring (history, " " & nv ("entry", history.log_entry) & ASCII.LF);
assimulate_substring (history, " ," & nv ("elapsed", elapsed) & ASCII.LF);
assimulate_substring (history, " ," & nv ("ID", ID) & ASCII.LF);
assimulate_substring (history, " ," & nv ("result", "failed") & ASCII.LF);
assimulate_substring (history, " ," & nv ("origin", origin) & ASCII.LF);
assimulate_substring (history, " ," & nv ("info", info) & ASCII.LF);
assimulate_substring (history, " ," & nv ("duration", duration) & ASCII.LF);
assimulate_substring (history, " }" & ASCII.LF);
check_history_segment_capacity;
end record_history_failed;
------------------------------
-- record_history_ignored --
------------------------------
procedure record_history_ignored
(elapsed : String;
origin : String;
reason : String;
skips : Natural)
is
cleantxt : constant String := JT.strip_control (reason);
info : constant String :=
JT.replace_char
(JT.replace_char (cleantxt, ASCII.Quotation, " "), ASCII.Back_Slash, "\")
& ":|:" & JT.int2str (skips);
begin
history.log_entry := history.log_entry + 1;
history.segment_count := history.segment_count + 1;
handle_first_history_entry;
assimulate_substring (history, " " & nv ("entry", history.log_entry) & ASCII.LF);
assimulate_substring (history, " ," & nv ("elapsed", elapsed) & ASCII.LF);
assimulate_substring (history, " ," & nv ("ID", "--") & ASCII.LF);
assimulate_substring (history, " ," & nv ("result", "ignored") & ASCII.LF);
assimulate_substring (history, " ," & nv ("origin", origin) & ASCII.LF);
assimulate_substring (history, " ," & nv ("info", info) & ASCII.LF);
assimulate_substring (history, " ," & nv ("duration", "--:--:--") & ASCII.LF);
assimulate_substring (history, " }" & ASCII.LF);
check_history_segment_capacity;
end record_history_ignored;
------------------------------
-- record_history_skipped --
------------------------------
procedure record_history_skipped
(elapsed : String;
origin : String;
reason : String)
is
begin
history.log_entry := history.log_entry + 1;
history.segment_count := history.segment_count + 1;
handle_first_history_entry;
assimulate_substring (history, " " & nv ("entry", history.log_entry) & ASCII.LF);
assimulate_substring (history, " ," & nv ("elapsed", elapsed) & ASCII.LF);
assimulate_substring (history, " ," & nv ("ID", "--") & ASCII.LF);
assimulate_substring (history, " ," & nv ("result", "skipped") & ASCII.LF);
assimulate_substring (history, " ," & nv ("origin", origin) & ASCII.LF);
assimulate_substring (history, " ," & nv ("info", reason) & ASCII.LF);
assimulate_substring (history, " ," & nv ("duration", "--:--:--") & ASCII.LF);
assimulate_substring (history, " }" & ASCII.LF);
check_history_segment_capacity;
end record_history_skipped;
--------------------------------------
-- check_history_segment_capacity --
--------------------------------------
procedure check_history_segment_capacity is
begin
if history.segment_count = 1 then
history.segment := history.segment + 1;
return;
end if;
if history.segment_count < kfile_units_limit then
return;
end if;
write_history_json;
history.last_index := 0;
history.last_written := 0;
history.segment_count := 0;
end check_history_segment_capacity;
end PortScan.Ops;
|
with Ada.Text_IO, Ada.Integer_Text_IO;
use Ada;
procedure add_function is
function add(a, b : Integer) return Integer is
begin
return a + b;
end add;
result : Integer;
begin
result := add(3, 5);
Integer_Text_IO.put(result);
end add_function;
|
with Interfaces;
private with Interfaces.C;
private with System;
package SocketCAN is
-- Ada binding for the SocketCAN driver included in Linux Kernel > 2.6.25.
-- https://www.kernel.org/doc/Documentation/networking/can.txt
--
-- Note: This binding is incomplete!
-- Interfaces CAN_RAW socket with CAN 2.0A standard frame format.
-- The other protocols (and FD) should be easy to add though.
--
-- Adding e.g. a virtual CAN interface (vcan):
-- $ sudo modprobe vcan
-- $ sudo ip link add dev vcan0 type vcan
-- $ sudo ip link set up vcan0
type Socket_Type is private;
type Protocol_Type is
(RAW, -- RAW sockets
BCM, -- Broadcast Manager
TP16, -- VAG Transport Protocol v1.6
TP20, -- VAG Transport Protocol v2.0
MCNET, -- Bosch MCNet
ISOTP, -- ISO 15765-2 Transport Protocol
J1939, -- SAE J1939
NPROTO);
Is_Implemented : constant array (Protocol_Type) of Boolean :=
(RAW => True,
BCM | TP16 | TP20 | MCNET | ISOTP | J1939 | NPROTO => False);
type Frame_Id_Type is mod 2**11;
subtype Dlc_Type is Natural range 0 .. 8;
subtype Frame_Data_Type is Interfaces.Unsigned_8;
type Frame_Data is array (0 .. 7) of Frame_Data_Type;
type Can_Frame is record
Can_Id : Frame_Id_Type;
Rtr : Boolean;
Dlc : Dlc_Type;
Data : Frame_Data;
end record;
SocketCAN_Error : exception;
function Create_Socket (Protocol : Protocol_Type := RAW) return Socket_Type
with Pre => Is_Implemented (Protocol);
procedure Bind_Socket
(Socket : in Socket_Type;
Name : in String := "can0");
procedure Close_Socket
(Socket : in Socket_Type);
procedure Send_Socket
(Socket : in Socket_Type;
Frame : in Can_Frame);
procedure Receive_Socket_Blocking
(Socket : in Socket_Type;
Frame : out Can_Frame);
function Is_Frame_Pending
(Socket : Socket_Type)
return Boolean;
private
type Socket_Type is new Integer;
package C renames Interfaces.C;
function C_Name_To_Index (Name : C.char_array) return C.int;
pragma Import (C, C_Name_To_Index, "if_nametoindex");
function C_Write
(S : C.int;
Msg : System.Address;
Len : C.int) return C.int;
pragma Import (C, C_Write, "write");
function C_Read
(S : C.int;
Msg : System.Address;
Len : C.int) return C.int;
pragma Import (C, C_Read, "read");
type Poll_Fd is record
Fd : C.int;
Events : C.short;
Revents : C.short;
end record;
pragma Convention (C, Poll_Fd);
subtype Nfds is C.unsigned_long;
function C_Poll
(Fds : System.Address;
N_Fds : Nfds;
Timeout : C.int) return C.int;
pragma Import (C, C_Poll, "poll");
end SocketCAN;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.HASH_TABLES.GENERIC_KEYS --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2020, 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 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. --
-- --
-- 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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
package body Ada.Containers.Hash_Tables.Generic_Keys is
pragma Warnings (Off, "variable ""Busy*"" is not referenced");
pragma Warnings (Off, "variable ""Lock*"" is not referenced");
-- See comment in Ada.Containers.Helpers
-----------------------------
-- Checked_Equivalent_Keys --
-----------------------------
function Checked_Equivalent_Keys
(HT : aliased in out Hash_Table_Type;
Key : Key_Type;
Node : Node_Access) return Boolean
is
Lock : With_Lock (HT.TC'Unrestricted_Access);
begin
return Equivalent_Keys (Key, Node);
end Checked_Equivalent_Keys;
-------------------
-- Checked_Index --
-------------------
function Checked_Index
(HT : aliased in out Hash_Table_Type;
Key : Key_Type) return Hash_Type
is
Lock : With_Lock (HT.TC'Unrestricted_Access);
begin
return Hash (Key) mod HT.Buckets'Length;
end Checked_Index;
--------------------------
-- Delete_Key_Sans_Free --
--------------------------
procedure Delete_Key_Sans_Free
(HT : in out Hash_Table_Type;
Key : Key_Type;
X : out Node_Access)
is
Indx : Hash_Type;
Prev : Node_Access;
begin
if HT.Length = 0 then
X := null;
return;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
TC_Check (HT.TC);
Indx := Checked_Index (HT, Key);
X := HT.Buckets (Indx);
if X = null then
return;
end if;
if Checked_Equivalent_Keys (HT, Key, X) then
HT.Buckets (Indx) := Next (X);
HT.Length := HT.Length - 1;
return;
end if;
loop
Prev := X;
X := Next (Prev);
if X = null then
return;
end if;
if Checked_Equivalent_Keys (HT, Key, X) then
Set_Next (Node => Prev, Next => Next (X));
HT.Length := HT.Length - 1;
return;
end if;
end loop;
end Delete_Key_Sans_Free;
----------
-- Find --
----------
function Find
(HT : aliased in out Hash_Table_Type;
Key : Key_Type) return Node_Access
is
Indx : Hash_Type;
Node : Node_Access;
begin
if HT.Length = 0 then
return null;
end if;
Indx := Checked_Index (HT, Key);
Node := HT.Buckets (Indx);
while Node /= null loop
if Checked_Equivalent_Keys (HT, Key, Node) then
return Node;
end if;
Node := Next (Node);
end loop;
return null;
end Find;
--------------------------------
-- Generic_Conditional_Insert --
--------------------------------
procedure Generic_Conditional_Insert
(HT : in out Hash_Table_Type;
Key : Key_Type;
Node : out Node_Access;
Inserted : out Boolean)
is
Indx : Hash_Type;
begin
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
TC_Check (HT.TC);
Indx := Checked_Index (HT, Key);
Node := HT.Buckets (Indx);
if Node = null then
if Checks and then HT.Length = Count_Type'Last then
raise Constraint_Error;
end if;
Node := New_Node (Next => null);
Inserted := True;
HT.Buckets (Indx) := Node;
HT.Length := HT.Length + 1;
return;
end if;
loop
if Checked_Equivalent_Keys (HT, Key, Node) then
Inserted := False;
return;
end if;
Node := Next (Node);
exit when Node = null;
end loop;
if Checks and then HT.Length = Count_Type'Last then
raise Constraint_Error;
end if;
Node := New_Node (Next => HT.Buckets (Indx));
Inserted := True;
HT.Buckets (Indx) := Node;
HT.Length := HT.Length + 1;
end Generic_Conditional_Insert;
-----------------------------
-- Generic_Replace_Element --
-----------------------------
procedure Generic_Replace_Element
(HT : in out Hash_Table_Type;
Node : Node_Access;
Key : Key_Type)
is
pragma Assert (HT.Length > 0);
pragma Assert (Node /= null);
Old_Indx : Hash_Type;
New_Indx : constant Hash_Type := Checked_Index (HT, Key);
New_Bucket : Node_Access renames HT.Buckets (New_Indx);
N, M : Node_Access;
begin
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (HT.TC'Unrestricted_Access);
begin
Old_Indx := Hash (Node) mod HT.Buckets'Length;
end;
if Checked_Equivalent_Keys (HT, Key, Node) then
TE_Check (HT.TC);
-- We can change a node's key to Key (that's what Assign is for), but
-- only if Key is not already in the hash table. (In a unique-key
-- hash table as this one a key is mapped to exactly one node only.)
-- The exception is when Key is mapped to Node, in which case the
-- change is allowed.
Assign (Node, Key);
return;
end if;
-- Key is not equivalent to Node, so we now have to determine if it's
-- equivalent to some other node in the hash table. This is the case
-- irrespective of whether Key is in the same or a different bucket from
-- Node.
N := New_Bucket;
while N /= null loop
if Checks and then Checked_Equivalent_Keys (HT, Key, N) then
pragma Assert (N /= Node);
raise Program_Error with
"attempt to replace existing element";
end if;
N := Next (N);
end loop;
-- We have determined that Key is not already in the hash table, so
-- the change is tentatively allowed. We now perform the standard
-- checks to determine whether the hash table is locked (because you
-- cannot change an element while it's in use by Query_Element or
-- Update_Element), or if the container is busy (because moving a
-- node to a different bucket would interfere with iteration).
if Old_Indx = New_Indx then
-- The node is already in the bucket implied by Key. In this case
-- we merely change its value without moving it.
TE_Check (HT.TC);
Assign (Node, Key);
return;
end if;
-- The node is a bucket different from the bucket implied by Key
TC_Check (HT.TC);
-- Do the assignment first, before moving the node, so that if Assign
-- propagates an exception, then the hash table will not have been
-- modified (except for any possible side-effect Assign had on Node).
Assign (Node, Key);
-- Now we can safely remove the node from its current bucket
N := HT.Buckets (Old_Indx);
pragma Assert (N /= null);
if N = Node then
HT.Buckets (Old_Indx) := Next (Node);
else
pragma Assert (HT.Length > 1);
loop
M := Next (N);
pragma Assert (M /= null);
if M = Node then
Set_Next (Node => N, Next => Next (Node));
exit;
end if;
N := M;
end loop;
end if;
-- Now we link the node into its new bucket (corresponding to Key)
Set_Next (Node => Node, Next => New_Bucket);
New_Bucket := Node;
end Generic_Replace_Element;
-----------
-- Index --
-----------
function Index
(HT : Hash_Table_Type;
Key : Key_Type) return Hash_Type
is
begin
return Hash (Key) mod HT.Buckets'Length;
end Index;
end Ada.Containers.Hash_Tables.Generic_Keys;
|
-- Standard Ada library specification
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
package Ada.Locales is
pragma Preelaborate(Locales);
pragma Remote_Types(Locales);
type Language_Code is new String (1 .. 3)
with Dynamic_Predicate =>
(for all E of Language_Code => E in 'a' .. 'z');
type Country_Code is new String (1 .. 2)
with Dynamic_Predicate =>
(for all E of Country_Code => E in 'A' .. 'Z');
Language_Unknown : constant Language_Code := "und";
Country_Unknown : constant Country_Code := "ZZ";
function Language return Language_Code;
function Country return Country_Code;
end Ada.Locales;
|
-------------------------------------------------------------------------------
-- --
-- Copyright (C) 2020-2030, per.s.sandberg@bahnhof.se --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files --
-- (the "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, sublicense, and / or sell copies of the Software, and to --
-- permit persons to whom the Software is furnished to do so, subject to --
-- the following conditions : --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, --
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL --
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR --
-- OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, --
-- ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR --
-- OTHER DEALINGS IN THE SOFTWARE. --
-------------------------------------------------------------------------------
-- --
------------------------------------------------------------------------------
with Ada.IO_Exceptions;
with GNAT.Memory_Dump;
with System.Memory;
package body ZMQ.Utilities.Memory_Streams is
use Ada.Streams;
overriding
procedure Dump
(This : in Memory_Stream;
Full_Buffer : in Boolean := False;
Outf : in Text_IO.File_Access := Text_IO.Standard_Output) is
pragma Unreferenced (Outf);
Buffer : Large_Buffer_Access renames This.Buffer.As_Pointer;
begin
if Full_Buffer then
GNAT.Memory_Dump.Dump
(Buffer.all (Buffer.all'First)'Address,
Integer (This.Buffer_Length));
else
GNAT.Memory_Dump.Dump
(Buffer.all (Buffer.all'First)'Address,
Integer (This.Cursor) - 1);
end if;
end Dump;
overriding function Eof (This : in Memory_Stream) return Boolean is
begin
return This.Cursor > This.Buffer_Length;
end Eof;
-----------------
-- Get_Address --
-----------------
overriding
function Get_Address (This : in Memory_Stream) return System.Address is
begin
return This.Buffer.As_Address;
end Get_Address;
----------------
-- Get_Length --
----------------
overriding function Get_Length (This : in Memory_Stream)
return Ada.Streams.Stream_Element_Count is
begin
return This.Buffer_Length;
end Get_Length;
overriding procedure Seek (This : in out Memory_Stream;
Pos : in Ada.Streams.Stream_Element_Offset) is
begin
This.Cursor := This.Cursor + Pos;
end Seek;
overriding function Pos (This : in Memory_Stream)
return Ada.Streams.Stream_Element_Offset is
begin
return This.Cursor;
end Pos;
-----------------
-- Set_Address --
-----------------
overriding
procedure Set_Address
(This : in out Memory_Stream; To : in System.Address) is
begin
This.Buffer.As_Address := To;
end Set_Address;
----------------
-- Set_Length --
----------------
overriding
procedure Set_Length (This : in out Memory_Stream;
To : in Ada.Streams.Stream_Element_Count) is
begin
This.Buffer_Length := To;
This.Reset;
end Set_Length;
----------
-- Read --
----------
overriding
procedure Read
(This : in out Memory_Stream;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
First : Stream_Element_Offset;
LLast : Stream_Element_Offset;
begin
First := This.Cursor;
LLast := This.Cursor + Item'Length - 1;
if LLast > This.Buffer_Length then
raise Ada.IO_Exceptions.End_Error;
end if;
Item := This.Buffer.As_Pointer.all (First .. LLast);
This.Cursor := LLast + 1;
Last := Item'Last;
end Read;
-----------
-- Write --
-----------
overriding
procedure Write
(This : in out Memory_Stream;
Item : in Stream_Element_Array)
is
First : Stream_Element_Offset;
Last : Stream_Element_Offset;
begin
First := This.Cursor;
Last := This.Cursor + Item'Length - 1;
if Last > This.Buffer_Length then
raise Ada.IO_Exceptions.Device_Error;
end if;
This.Cursor := Last + 1;
This.Buffer.As_Pointer.all (First .. Last) := Item;
end Write;
overriding
procedure Reset (This : in out Memory_Stream) is
begin
This.Cursor := This.Buffer.As_Pointer.all'First;
end Reset;
procedure Read
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : out Memory_Stream) is
begin
raise Program_Error with
"Its not possible to read into a memory stream using 'read";
end Read;
procedure Write
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : in Memory_Stream) is
begin
Ada.Streams.Stream_Element_Array'Write
(This,
Item.Buffer.As_Pointer.all
(Item.Buffer.As_Pointer.all'First .. Item.Cursor));
end Write;
procedure Read
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : out Dynamic_Memory_Stream) is
begin
Read (This, Memory_Stream (Item));
end Read;
procedure Write
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : in Dynamic_Memory_Stream) is
begin
Write (This, Memory_Stream (Item));
end Write;
procedure Write
(This : in out Dynamic_Memory_Stream;
Item : in Ada.Streams.Stream_Element_Array) is
begin
if This.Cursor + Item'Length > This.Buffer_Length then
This.Expand (This.Cursor + Item'Length);
end if;
Memory_Stream (This).Write (Item);
end Write;
procedure Expand
(This : in out Dynamic_Memory_Stream;
To_Size : Ada.Streams.Stream_Element_Offset) is
New_Size : System.Memory.size_t := 0;
use System.Memory;
begin
while New_Size < size_t (To_Size) loop
case This.Strategy is
when As_Needed =>
New_Size := size_t (To_Size);
when Multiply_By_Two =>
New_Size := size_t (2 * This.Buffer_Length);
when Add_Initial_Size =>
New_Size := size_t (This.Buffer_Length + This.Initial_Size);
end case;
end loop;
This.Buffer.As_Address := System.Memory.Realloc
(This.Buffer.As_Address, New_Size);
This.Buffer_Length := Streams.Stream_Element_Count (New_Size);
end Expand;
procedure Initialize (This : in out Dynamic_Memory_Stream) is
use System.Memory;
begin
This.Buffer.As_Address :=
System.Memory.Alloc (size_t (This.Initial_Size));
This.Buffer_Length := This.Initial_Size;
end Initialize;
procedure Finalize (This : in out Dynamic_Memory_Stream) is
begin
System.Memory.Free (This.Buffer.As_Address);
end Finalize;
procedure Initialize (This : in out Controler) is
begin
This.Controled.Initialize;
end Initialize;
procedure Finalize (This : in out Controler) is
begin
This.Controled.Finalize;
end Finalize;
end ZMQ.Utilities.Memory_Streams;
|
for I in reverse 0..10 loop
Put_Line(Integer'Image(I));
end loop;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Float_Text_IO; use Ada.Float_Text_IO;
with Ada.Unchecked_Deallocation;
package body Vecteurs_Creux is
procedure Free is
new Ada.Unchecked_Deallocation (T_Cellule, T_Vecteur_Creux);
procedure Initialiser (V : out T_Vecteur_Creux) is
begin
V := Null;
end Initialiser;
procedure Detruire (V: in out T_Vecteur_Creux) is
T: T_Vecteur_Creux;
begin
while V /= Null loop
T := V.all.Suivant;
Free(V);
V := T;
end loop;
end Detruire;
function Est_Nul (V : in T_Vecteur_Creux) return Boolean is
begin
return V = Null;
end Est_Nul;
function Composante_Recursif (V : in T_Vecteur_Creux ; Indice : in Integer) return Float is
begin
if Est_Nul(V) then
return 0.0;
else
if Indice = V.all.Indice then
return V.all.Valeur;
else
return Composante_Recursif(V.all.Suivant, Indice);
end if;
end if;
end Composante_Recursif;
function Composante_Iteratif (V : in T_Vecteur_Creux ; Indice : in Integer) return Float is
Current: T_Vecteur_Creux;
begin
Current := V;
while Not Est_Nul(Current) and then Current.all.Indice <= Indice loop
if Current.all.Indice = Indice then
return Current.all.Valeur;
else
Current := Current.all.Suivant;
end if;
end loop;
return 0.0;
end Composante_Iteratif;
procedure Modifier (V : in out T_Vecteur_Creux ;
Indice : in Integer ;
Valeur : in Float ) is
Temp: T_Vecteur_Creux;
begin
if Valeur = 0.0 then
-- Chercher la cellule d'indice Indice et la supprimer;
if not Est_Nul(V) then
if V.all.Indice = Indice then
Temp := V;
V := V.all.Suivant;
Free(Temp);
elsif V.all.Indice < Indice then
Modifier(V.all.Suivant, Indice, Valeur);
end if;
end if;
elsif Est_Nul(V) then
V := new T_Cellule;
V.all.Indice := Indice;
V.all.Valeur := Valeur;
else
if V.all.Indice < Indice then
if Est_Nul(V.all.Suivant) then
Temp := new T_Cellule;
Temp.all.Indice := Indice;
Temp.all.Valeur := Valeur;
V.all.Suivant := Temp;
else
Modifier(V.all.Suivant, Indice, Valeur);
end if;
elsif V.all.Indice = Indice then
V.all.Valeur := Valeur;
else
Temp := new T_Cellule;
Temp.all.Indice := V.all.Indice;
Temp.all.Valeur := V.all.Valeur;
Temp.all.Suivant := V.all.Suivant;
V.all.Indice := Indice;
V.all.Valeur := Valeur;
V.all.Suivant := Temp;
end if;
end if;
end Modifier;
function Sont_Egaux_Recursif (V1, V2 : in T_Vecteur_Creux) return Boolean is
begin
if Est_Nul(V1) and Est_Nul(V2) then
return True;
elsif not Est_Nul(V1) and then not Est_Nul(V2) then
return Sont_Egaux_Recursif(V1.all.Suivant, V2.all.Suivant);
end if;
return False;
end Sont_Egaux_Recursif;
function Sont_Egaux_Iteratif (V1, V2 : in T_Vecteur_Creux) return Boolean is
Temp1: T_Vecteur_Creux;
Temp2: T_Vecteur_Creux;
begin
Temp1 := V1;
Temp2 := V2;
while not Est_Nul(Temp1) and then not Est_Nul(Temp2) loop
if not (Temp1.all.Indice = Temp2.all.Indice and Temp1.all.Valeur = Temp2.all.Valeur) then
Temp1 := Null;
else
Temp1 := Temp1.all.Suivant;
Temp2 := Temp2.all.Suivant;
end if;
end loop;
return Est_Nul(Temp1) and Est_Nul(Temp2);
end Sont_Egaux_Iteratif;
procedure Additionner (V1 : in out T_Vecteur_Creux; V2 : in T_Vecteur_Creux) is
Temp1: T_Vecteur_Creux;
Temp2: T_Vecteur_Creux;
Precedent: T_Vecteur_Creux;
begin
Temp1 := V1;
Temp2 := V2;
while not Est_Nul(Temp1) and not Est_Nul(Temp2) loop
if Temp1.all.Indice < Temp2.all.Indice then
Precedent := Temp1;
Temp1 := Temp1.all.Suivant;
elsif Temp1.all.Indice = Temp2.all.Indice then
if Temp1.all.Valeur + Temp2.all.Valeur = 0.0 then
-- Enlever la cellule de cet indice
Modifier(Temp1, Temp1.all.Indice, 0.0);
if not Est_Nul(Precedent) then
Precedent.all.Suivant := Temp1;
else
V1 := V1.all.Suivant;
end if;
else
Temp1.all.Valeur := Temp1.all.Valeur + Temp2.all.Valeur;
Precedent := Temp1;
Temp1 := Temp1.all.Suivant;
end if;
Temp2 := Temp2.all.Suivant;
else
Modifier(Temp1, Temp2.all.Indice, Temp2.all.Valeur); -- O(1) !
Temp2 := Temp2.all.Suivant;
end if;
end loop;
while not Est_Nul(Temp2) loop
if Est_Nul(V1) then
V1 := new T_Cellule;
V1.all.Indice := Temp2.all.Indice;
V1.all.Valeur := Temp2.all.Valeur;
Precedent := V1;
Temp2 := Temp2.Suivant;
else
Modifier(Precedent, Temp2.all.Indice, Temp2.all.Valeur); -- O(1) !
Precedent := Precedent.all.Suivant;
Temp2 := Temp2.all.Suivant;
end if;
end loop;
end Additionner;
function Norme2 (V : in T_Vecteur_Creux) return Float is
Somme: Float;
Cellule: T_Vecteur_Creux;
begin
Cellule := V;
Somme := 0.0;
while not Est_Nul(Cellule) loop
Somme := Somme + Cellule.all.Valeur * Cellule.all.Valeur;
Cellule := Cellule.all.Suivant;
end loop;
return Somme;
end Norme2;
Function Produit_Scalaire (V1, V2: in T_Vecteur_Creux) return Float is
Temp1: T_Vecteur_Creux;
Temp2: T_Vecteur_Creux;
Produit: Float;
begin
Temp1 := V1;
Temp2 := V2;
Produit := 0.0;
while not (Est_Nul(Temp1) or Est_Nul(Temp2)) loop
if Temp1.all.Indice < Temp2.all.Indice then
Temp1 := Temp1.all.Suivant;
elsif Temp1.all.Indice > Temp2.all.Indice then
Temp2 := Temp2.all.Suivant;
else
Produit := Produit + Temp1.all.Valeur * Temp2.all.Valeur;
Temp1 := Temp1.all.Suivant;
Temp2 := Temp2.all.Suivant;
end if;
end loop;
return Produit;
end Produit_Scalaire;
procedure Afficher (V : T_Vecteur_Creux) is
begin
if V = Null then
Put ("--E");
else
-- Afficher la composante V.all
Put ("-->[ ");
Put (V.all.Indice, 0);
Put (" | ");
Put (V.all.Valeur, Fore => 0, Aft => 1, Exp => 0);
Put (" ]");
-- Afficher les autres composantes
Afficher (V.all.Suivant);
end if;
end Afficher;
function Nombre_Composantes_Non_Nulles (V: in T_Vecteur_Creux) return Integer is
begin
if V = Null then
return 0;
else
return 1 + Nombre_Composantes_Non_Nulles (V.all.Suivant);
end if;
end Nombre_Composantes_Non_Nulles;
end Vecteurs_Creux;
|
with Ada_Containers_Indefinite_Holders; --use the real deal where present...
with Ada.Finalization;
with Executor_Service;
generic
type Item(<>) is private;
package Futures is
type Object(<>) is limited
new Executor_Service.Callable with private;
type Callback_Function is access function return Item;
function Create
(Callback : Callback_Function)
return Object;
Execution_Exception : exception;
function Get
(Self : in out Object)
return Item;
function Promise
(Self : in out Object)
return Executor_Service.Callable_Ptr;
private
-- to support indefinite types, for example String,
-- especially since entries must return values as out parameters
package Items is
new Ada_Containers_Indefinite_Holders(Item);
protected type Future_Data is
procedure Put_Promise(Value : in Item);
procedure Timed_Out;
entry Wait_For_Promise(Value : out Items.Holder; Timed_Out : out Boolean);
private
Value : Items.Holder;
Is_Timed_Out : Boolean := False;
end Future_Data;
type Object is limited
new Executor_Service.Callable with
record
Callback : Callback_Function;
Future_Value : Future_Data;
end record;
overriding
procedure Call(Self : in out Object);
end Futures;
|
pragma Warnings (Off);
pragma Style_Checks (Off);
with GL, GLOBE_3D.Math;
-- with Ada.Text_IO; use Ada.Text_IO;
-- with Ada.Strings.Fixed; use Ada.Strings, Ada.Strings.Fixed;
package body Sierpinski is
-----------------
-- Create_Cube --
-----------------
procedure Create_Cube (
object : in out GLOBE_3D.p_Object_3D;
scale : GLOBE_3D.Real;
centre : GLOBE_3D.Point_3D;
texture : Cubic_Face_texture;
tiled : Boolean;
fractal_level : Natural
)
is
use GL, GLOBE_3D, GLOBE_3D.Math;
side : constant Integer := 3**fractal_level;
-- We put a layer of empty cubes all around the main one.
subtype Extended_side_range is Integer range -1 .. side;
subtype Side_range is Extended_side_range range 0 .. side - 1;
subtype Comparison_side_range is Extended_side_range range 0 .. side;
filled : array (Extended_side_range,
Extended_side_range,
Extended_side_range
) of Boolean :=
(others => (others => (others => False)));
procedure Fill (x0, y0, z0 : Natural; level : Natural) is
l1 : Natural;
o : Natural;
begin
if level=0 then
filled (x0, y0, z0) := True;
else
l1 := level - 1;
o := 3 ** l1;
for x in 0 .. 2 loop
for y in 0 .. 2 loop
if not (x=1 and y=1) then
for z in 0 .. 2 loop
if not ((x=1 and z=1) or (y=1 and z=1)) then
Fill (x0 + x*o, y0 + y*o, z0 + z*o, l1);
end if;
end loop;
end if;
end loop;
end loop;
end if;
end Fill;
scale_2 : constant Real := scale / Real (side);
offset : constant Real := 0.5 * Real (side);
type Ipoint_3D is array (1 .. 3) of Extended_side_range;
procedure Trans (i : Ipoint_3D; p : out Point_3D) is
begin
p := scale_2 * (Real (i (1)) - offset, Real (i (2)) - offset, Real (i (3)) - offset);
end Trans;
point : p_Point_3D_array :=
new Point_3D_array (1 .. ((1 + 3**fractal_level)**3));
face : p_Face_array :=
new Face_array (1 .. 6* (3**fractal_level)**3);
face_proto : Face_type; -- takes defaults values
po, fa : Natural := 0;
type Ipoint_2D is array (1 .. 2) of Natural;
tex_scale : constant Real := 1.0 / Real (side);
-- the following is to optimize the search of existing points:
type Index_stack is array (1 .. 27*6) of Natural;
touching : array (Extended_side_range,
Extended_side_range,
Extended_side_range
) of Index_stack :=
(others => (others => (others => (others => 0))));
procedure Register (i, j, k : Integer; idx : Positive) is
begin
if i > Extended_side_range'Last or
j > Extended_side_range'Last or
k > Extended_side_range'Last then
return;
end if;
for s in Index_stack'Range loop
if touching (i, j, k) (s) = idx then -- already in stack
return;
elsif touching (i, j, k) (s) = 0 then
touching (i, j, k) (s) := idx;
return;
end if;
end loop;
raise Program_Error; -- cannot have more points in stack
end Register;
procedure Do_Face (
cube_id,
iP1, iP2, iP3, iP4 : Ipoint_3D;
it1, it2, it3, it4 : Ipoint_2D
)
is
P : array (1 .. 4) of Point_3D;
vtx : GLOBE_3D.Natural_Index_array (1 .. 4);
idx : Natural;
begin
Trans (iP1, P (1));
Trans (iP2, P (2));
Trans (iP3, P (3));
Trans (iP4, P (4));
for pt in P'Range loop
vtx (pt) := 0;
for op in Index_stack'Range loop
idx := touching (cube_id (1), cube_id (2), cube_id (3)) (op);
if idx = 0 then
-- no more point in stack
exit;
elsif Almost_zero (Norm2 (P (pt) - point (idx))) then
-- exists already
vtx (pt) := idx;
exit;
end if;
end loop;
if idx = 0 then
-- create new point
po := po + 1;
point (po) := P (pt);
vtx (pt) := po;
-- add point index to cube's stack
for i in - 1 .. 1 loop
for j in - 1 .. 1 loop
for k in - 1 .. 1 loop
Register (cube_id (1) + i, cube_id (2) + j, cube_id (3) + k, po);
end loop;
end loop;
end loop;
end if;
end loop;
face_proto.P := vtx;
if not tiled then
face_proto.texture_edge_map :=
((tex_scale * Real (it1 (1)), tex_scale * Real (it1 (2))),
(tex_scale * Real (it2 (1)), tex_scale * Real (it2 (2))),
(tex_scale * Real (it3 (1)), tex_scale * Real (it3 (2))),
(tex_scale * Real (it4 (1)), tex_scale * Real (it4 (2))));
end if;
fa := fa + 1;
face (fa) := face_proto;
end Do_Face;
generic
with function Pm (p : Ipoint_3D) return Ipoint_3D; -- permutation
front, back : Cubic_Face_count;
procedure Pave;
procedure Pave is
begin
for i in Side_range loop
for j in Side_range loop
for k in Comparison_side_range loop
-- filled components don't need to be permuted (symmetric)
if filled (i, j, k) = not filled (i, j, k - 1) then
-- There is a face to display
if filled (i, j, k) then
-- * full - empty
face_proto.texture := texture (front);
Do_Face (
Pm ((i, j, k)),
Pm ((i, j, k)), Pm ((i, j + 1, k)), Pm ((i + 1, j + 1, k)), Pm ((i + 1, j, k)),
(i, j), (i, j + 1), (i + 1, j + 1), (i + 1, j)
);
else
-- * empty - full
face_proto.texture := texture (back);
Do_Face (
Pm ((i, j, k)),
Pm ((i + 1, j, k)), Pm ((i + 1, j + 1, k)), Pm ((i, j + 1, k)), Pm ((i, j, k)),
(i + 1, j), (i + 1, j + 1), (i, j + 1), (i, j)
);
end if;
end if;
end loop;
end loop;
end loop;
end Pave;
function Id (p : Ipoint_3D) return Ipoint_3D is
begin
return p;
end Id;
function Pm1 (p : Ipoint_3D) return Ipoint_3D is
begin
return (p (3), p (1), p (2));
end Pm1;
function Pm2 (p : Ipoint_3D) return Ipoint_3D is
begin
return (p (2), p (3), p (1));
end Pm2;
procedure Pave_z is new Pave (Id, 5, 6);
procedure Pave_y is new Pave (Pm1, 1, 3);
procedure Pave_x is new Pave (Pm2, 2, 4);
begin
Fill (0, 0, 0, fractal_level);
-- -- Test : display 1st layer .. .
-- for x in filled'Range (1) loop
-- for y in filled'Range (2) loop
-- if filled (x, y, 0) then
-- Put ('x');
-- else
-- Put (' ');
-- end if;
-- end loop;
-- New_Line;
-- end loop;
face_proto.skin := material_texture;
face_proto.whole_texture := tiled;
face_proto.repeat_U := 1;
face_proto.repeat_V := 1;
Pave_x;
Pave_y;
Pave_z;
object := new Object_3D (po, fa);
object.point := point (1 .. po);
object.face := face (1 .. fa);
object.centre := centre;
Set_name (object.all,
"Sierpinski cube - sponge, fractal level" &
Integer'Image (fractal_level)
);
Dispose (point);
Dispose (face);
end Create_Cube;
end Sierpinski;
|
with
AdaM.Comment,
AdaM.raw_Source,
AdaM.a_Type.enumeration_type,
Glib,
Glib.Error,
Glib.Object,
Gtk.Builder,
Gtk.Handlers,
Pango.Font;
with Ada.Text_IO; use Ada.Text_IO;
package body aIDE.Palette.of_source_entities
is
use Glib,
Glib.Error,
Glib.Object,
Gtk.Builder,
Gtk.Button,
Gtk.Window;
-- Events
--
procedure on_raw_source_Button_clicked (the_Button : access Gtk_Button_Record'Class;
Self : in aIDE.Palette.of_source_entities.view)
is
pragma Unreferenced (the_Button);
new_Source : constant AdaM.raw_Source.view := AdaM.raw_Source.new_Source;
begin
Self.Target.append (new_Source.all'Access);
Self.Top.Hide;
Self.Invoked_by.freshen;
end on_raw_source_Button_clicked;
procedure on_comment_Button_clicked (the_Button : access Gtk_Button_Record'Class;
Self : in aIDE.Palette.of_source_entities.view)
is
pragma Unreferenced (the_Button);
new_Comment : constant AdaM.Comment.view := AdaM.Comment.new_Comment;
begin
Self.Target.append (new_Comment.all'Access);
Self.Top.Hide;
Self.Invoked_by.freshen;
end on_comment_Button_clicked;
procedure on_enumeration_type_Button_clicked (the_Button : access Gtk_Button_Record'Class;
Self : in aIDE.Palette.of_source_entities.view)
is
pragma Unreferenced (the_Button);
new_Enumeration : constant AdaM.a_Type.enumeration_type.view := AdaM.a_Type.enumeration_type.new_Type ("");
begin
Self.Target.append (new_Enumeration.all'Access);
Self.Top.Hide;
Self.Invoked_by.freshen;
end on_enumeration_type_Button_clicked;
package Button_Callbacks is new Gtk.Handlers.User_Callback (Gtk_Button_Record,
aIDE.Palette.of_source_entities.view);
-- Forge
--
function to_source_entities_Palette return View
is
Self : constant Palette.of_source_entities.view := new Palette.of_source_entities.item;
the_Builder : Gtk_Builder;
Error : aliased GError;
Result : Guint;
pragma Unreferenced (Result);
begin
gtk_New (the_Builder);
Result := the_Builder.add_from_File ("glade/source_entity_options.glade", Error'Access);
if Error /= null
then
Put_Line ("Error: 'adam.Palette.of_source_Entities' ~ " & Get_Message (Error));
Error_Free (Error);
end if;
Self.Top := gtk_Window (the_Builder.get_Object ("top_Window"));
Self.new_type_Frame := gtk_Frame (the_Builder.get_Object ("new_type_Frame"));
Self.raw_source_Button := gtk_Button (the_Builder.get_Object ("raw_source_Button"));
Self.comment_Button := gtk_Button (the_Builder.get_Object ("comment_Button"));
Self.enumeration_type_Button := gtk_Button (the_Builder.get_Object ("new_enumeration_Button"));
Self.close_Button := gtk_Button (the_Builder.get_Object ("close_Button"));
Button_Callbacks.connect (Self.raw_source_Button,
"clicked",
on_raw_source_Button_clicked'Access,
Self);
Button_Callbacks.connect (Self.comment_Button,
"clicked",
on_comment_Button_clicked'Access,
Self);
Button_Callbacks.connect (Self.enumeration_type_Button,
"clicked",
on_enumeration_type_Button_clicked'Access,
Self);
Self.Top.modify_Font (Font_Desc => Pango.Font.From_String ("Courier 10"));
Self.freshen;
return Self;
end to_source_entities_Palette;
-- Attributes
--
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget
is
begin
return gtk.Widget.Gtk_Widget (Self.Top);
end top_Widget;
procedure show (Self : in out Item; Invoked_by : in aIDE.Editor.view;
-- Target : in AdaM.Source.Entities_view;
Target : in AdaM.Entity.Entities_view;
Allowed : in Filter)
is
begin
Self.Invoked_by := Invoked_by;
Self.Target := Target;
case Allowed
is
when declare_Region =>
Self.new_type_Frame.show;
when begin_Region =>
Self.new_type_Frame.hide;
end case;
Self.Top.show;
end show;
procedure freshen (Self : in out Item)
is
begin
null;
end freshen;
end aIDE.Palette.of_source_entities;
|
with Ada.Containers; use Ada.Containers;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
with AUnit.Assertions; use AUnit.Assertions;
with GNAT.Source_Info; use GNAT.Source_Info;
with Langkit_Support.Text; use Langkit_Support.Text;
with Libadalang.Analysis; use Libadalang.Analysis;
with Libadalang.Common; use Libadalang.Common;
with Rejuvenation; use Rejuvenation;
with Rejuvenation.Finder; use Rejuvenation.Finder;
with Rejuvenation.Match_Patterns; use Rejuvenation.Match_Patterns;
with Rejuvenation.Patterns; use Rejuvenation.Patterns;
with Rejuvenation.Text_Rewrites; use Rejuvenation.Text_Rewrites;
with Rejuvenation.Simple_Factory; use Rejuvenation.Simple_Factory;
with Default_Value; use Default_Value;
with Mismatch; use Mismatch;
with Prefix_Notation; use Prefix_Notation;
package body Test_Examples is
procedure Test_Mismatch (T : in out Test_Case'Class);
procedure Test_Mismatch (T : in out Test_Case'Class) is
pragma Unreferenced (T);
begin
Assert (Condition => 7 = Sum (3, 4), Message => "Sum failed");
end Test_Mismatch;
procedure Test_Prefix_Notation (T : in out Test_Case'Class);
procedure Test_Prefix_Notation (T : in out Test_Case'Class) is
pragma Unreferenced (T);
My_Var : My_Type;
begin
My_Var.Operator_Zero;
Prefix_Notation.Operator_Zero (My_Var);
Assert
(Condition => True, Message => "Prefix notation identical failed");
end Test_Prefix_Notation;
procedure Test_Default_Value (T : in out Test_Case'Class);
procedure Test_Default_Value (T : in out Test_Case'Class) is
pragma Unreferenced (T);
begin
Assert
(Condition => My_Function (1) = My_Function (1, 2),
Message => "Default function failed");
end Test_Default_Value;
procedure Test_String (T : in out Test_Case'Class);
procedure Test_String (T : in out Test_Case'Class) is
pragma Unreferenced (T);
-- compiler reports on all conditions
-- 'warning: condition is always True' when using
-- Expected : constant String := "AB";
Expected : String (1 .. 2);
begin
Expected := "AB";
Assert (Condition => Expected = ('A', 'B'), Message => "Array");
Assert
(Condition => Expected = String'('A', 'B'), Message => "String Array");
Assert (Condition => Expected = (1 => 'A', 2 => 'B'), Message => "Map");
Assert
(Condition => Expected = String'(1 => 'A', 2 => 'B'),
Message => "String Map");
Assert
(Condition => Expected = (2 => 'B', 1 => 'A'), Message => "Map swap");
Assert
(Condition => Expected = String'(2 => 'B', 1 => 'A'),
Message => "String Map swap");
Assert (Condition => Expected = 'A' & 'B', Message => "Concat");
Assert
(Condition => Expected = ('A' & 'B'), Message => "Bracketed Concat");
Assert
(Condition => Expected = "" & 'A' & 'B', Message => "Empty Concat");
Assert
(Condition => Expected = ("" & 'A' & 'B'),
Message => "Bracketed Empty Concat");
end Test_String;
procedure Test_LibAdaLang_Stmt (T : in out Test_Case'Class);
procedure Test_LibAdaLang_Stmt (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Stmt : constant String := "x := 42;";
Unit : constant Analysis_Unit := Analyze_Fragment (Stmt, Stmt_Rule);
begin
Put_Line (Stmt);
Unit.Root.Print;
end Test_LibAdaLang_Stmt;
procedure Test_LibAdaLang_Decl (T : in out Test_Case'Class);
procedure Test_LibAdaLang_Decl (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Decl : constant String :=
"procedure My_Procedure (x,y: Integer; z: String := ""test"");";
Unit : constant Analysis_Unit := Analyze_Fragment (Decl, Subp_Decl_Rule);
begin
Put_Line (Decl);
Unit.Root.Print;
end Test_LibAdaLang_Decl;
procedure Test_Assignment_By_If (T : in out Test_Case'Class);
procedure Test_Assignment_By_If (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Decl : constant String :=
"if condition then variable := True; else variable := False; end if;";
Unit : constant Analysis_Unit := Analyze_Fragment (Decl, If_Stmt_Rule);
begin
Put_Line (Decl);
Unit.Root.Print;
end Test_Assignment_By_If;
procedure Test_If_Not (T : in out Test_Case'Class);
procedure Test_If_Not (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Decl : constant String :=
"if not condition then handle_not_condition; " &
"else handle_not_not_condition; end if;";
Unit : constant Analysis_Unit := Analyze_Fragment (Decl, If_Stmt_Rule);
begin
Put_Line (Decl);
Unit.Root.Print;
end Test_If_Not;
procedure Test_LibAdaLang_Visitor (T : in out Test_Case'Class);
procedure Test_LibAdaLang_Visitor (T : in out Test_Case'Class) is
pragma Unreferenced (T);
function Process_Node (Node : Ada_Node'Class) return Visit_Status;
function Process_Node (Node : Ada_Node'Class) return Visit_Status is
begin
case Node.Kind is
when Ada_Decl_Block =>
Put_Line ("Skipping Declaration Block");
return Over;
when Ada_Object_Decl =>
declare
OD : constant Object_Decl := Node.As_Object_Decl;
begin
Put_Line
(Image (OD.Full_Sloc_Image) &
"Found Object Decl for Id(s) " & Image (OD.F_Ids.Text));
end;
return Into;
when others =>
return Into;
end case;
end Process_Node;
Unit : constant Analysis_Unit :=
Analyze_File ("src/" & GNAT.Source_Info.File);
begin
Put_Line ("Begin - " & Enclosing_Entity);
Unit.Root.Traverse (Process_Node'Access);
Put_Line ("Done - " & Enclosing_Entity);
end Test_LibAdaLang_Visitor;
function Inside_Decl_Block (Node : Ada_Node'Class) return Boolean;
function Inside_Decl_Block (Node : Ada_Node'Class) return Boolean is
Running_Node : Ada_Node := Node.As_Ada_Node;
begin
while not Running_Node.Is_Null
and then Running_Node.Kind /= Ada_Decl_Block
loop
Running_Node := Running_Node.Parent;
end loop;
return not Running_Node.Is_Null;
end Inside_Decl_Block;
procedure Test_Rejuvenation_Find (T : in out Test_Case'Class);
procedure Test_Rejuvenation_Find (T : in out Test_Case'Class) is
pragma Unreferenced (T);
function Valid_Node (Node : Ada_Node'Class) return Boolean;
function Valid_Node (Node : Ada_Node'Class) return Boolean is
begin
if Node.Kind = Ada_Object_Decl then
return not Inside_Decl_Block (Node);
else
return False;
end if;
end Valid_Node;
Unit : constant Analysis_Unit :=
Analyze_File ("src/" & GNAT.Source_Info.File);
Found_Nodes : constant Node_List.Vector :=
Find (Unit.Root, Valid_Node'Access);
begin
Put_Line ("Begin - " & Enclosing_Entity);
for Found_Node of Found_Nodes loop
declare
OD : constant Object_Decl := Found_Node.As_Object_Decl;
begin
Put_Line
(Image (OD.Full_Sloc_Image) & "Found Object Decl for Id(s) " &
Image (OD.F_Ids.Text));
end;
end loop;
Put_Line ("Done - " & Enclosing_Entity);
end Test_Rejuvenation_Find;
procedure Test_Rejuvenation_Match_Pattern (T : in out Test_Case'Class);
procedure Test_Rejuvenation_Match_Pattern (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Pattern_ObjectDecl_Type_AdaNode_DefaultExpr_Present : constant Pattern :=
Make_Pattern
("$M_vars : Ada_Node := $S_default_expr;", Object_Decl_Rule);
Unit : constant Analysis_Unit :=
Analyze_File ("src/" & GNAT.Source_Info.File);
Found_Matches : constant Match_Pattern_List.Vector :=
Find_Full
(Unit.Root, Pattern_ObjectDecl_Type_AdaNode_DefaultExpr_Present);
begin
Put_Line ("Begin - " & Enclosing_Entity);
for Found_Match of Found_Matches loop
declare
OD : constant Object_Decl :=
Found_Match.Get_Nodes.First_Element.As_Object_Decl;
DefaultExpr : constant String :=
Found_Match.Get_Single_As_Raw_Signature ("$S_default_expr");
Var_Nodes : constant Node_List.Vector :=
Found_Match.Get_Multiple_As_Nodes ("$M_vars");
Vars_String : Unbounded_String;
begin
for Var_Node of Var_Nodes loop
Vars_String := Vars_String & Image (Var_Node.Text) & " ";
end loop;
Put_Line
(Image (OD.Full_Sloc_Image) & "Found Object Decl for Id(s) " &
To_String (Vars_String) & ": Ada_Node := " & DefaultExpr);
end;
end loop;
Put_Line ("Done - " & Enclosing_Entity);
end Test_Rejuvenation_Match_Pattern;
procedure Test_Text_Rewrite (T : in out Test_Case'Class);
procedure Test_Text_Rewrite (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Func_Begin : constant String :=
"function Example (a, b : Integer) return Integer is " & "begin " &
" return ";
Argument : constant String := "a+b";
Func_End : constant String := "; " & "end Example; ";
Func_Body : constant String :=
Func_Begin & "Square (" & Argument & ")" & Func_End;
Unit : constant Analysis_Unit :=
Analyze_Fragment (Func_Body, Subp_Body_Rule);
Arg_Key : constant String := "$S_arg";
Pattern_Square_Call : constant Pattern :=
Make_Pattern ("Square (" & Arg_Key & ")", Expr_Rule);
Found_Matches : constant Match_Pattern_List.Vector :=
Find_Full (Unit.Root, Pattern_Square_Call);
TR : Text_Rewrite_Unit := Make_Text_Rewrite_Unit (Unit);
begin
Put_Line ("Begin - " & Enclosing_Entity);
Assert
(Condition => Found_Matches.Length = 1,
Message => "One match expected, got " & Found_Matches.Length'Image);
for Found_Match of Found_Matches loop
declare
Node : constant Ada_Node := Found_Match.Get_Nodes.First_Element;
Arg : constant String :=
Found_Match.Get_Single_As_Raw_Signature (Arg_Key);
begin
TR.Replace (Node, "Exponent (Base => " & Arg & ", Power => 2)");
end;
end loop;
Assert
(Condition => TR.HasReplacements, Message => "Replacements expected");
Assert
(Actual => TR.ApplyToString,
Expected =>
Func_Begin & "Exponent (Base => " & Argument & ", Power => 2)" &
Func_End,
Message => "Rewrite not as expected");
Put_Line ("Done - " & Enclosing_Entity);
end Test_Text_Rewrite;
procedure Test_Units (T : in out Test_Case'Class);
procedure Test_Units (T : in out Test_Case'Class) is
pragma Unreferenced (T);
begin
declare
Unit : constant Analysis_Unit :=
Analyze_File_In_Project
("../src/ParentPackage-ChildPackage.adb",
"../workshop.gpr");
CU : constant Compilation_Unit := Unit.Root.As_Compilation_Unit;
begin
Assert
(Condition => CU.P_Unit_Kind = Unit_Body,
Message => "*.adb is unexpectedly not a Unit_Body");
Put_Line ("Withed");
for WU of CU.P_Withed_Units loop
Put_Line (" " & Image (WU.P_Decl.P_Defining_Name.Text));
end loop;
Assert
(Condition => CU.P_Withed_Units'Length = 1,
Message =>
"Length of Withed Units is unexpectedly not 1 but " &
CU.P_Withed_Units'Length'Image);
Put_Line ("Imported");
for IU of CU.P_Imported_Units loop
Put_Line (" " & Image (IU.P_Decl.P_Defining_Name.Text));
end loop;
Assert
(Condition => CU.P_Imported_Units'Length = 2,
Message =>
"Length of Imported Units is unexpectedly not 2 but " &
CU.P_Imported_Units'Length'Image);
Put_Line ("Dependencies");
for UD of CU.P_Unit_Dependencies loop
Put_Line (" " & Image (UD.P_Decl.P_Defining_Name.Text));
end loop;
Assert
(Condition => CU.P_Unit_Dependencies'Length = 16,
Message =>
"Length of Unit Dependencies is unexpectedly not 16 but " &
CU.P_Unit_Dependencies'Length'Image);
end;
declare
Unit : constant Analysis_Unit :=
Analyze_File_In_Project
("../src/ParentPackage-ChildPackage.ads",
"../workshop.gpr");
CU : constant Compilation_Unit := Unit.Root.As_Compilation_Unit;
begin
Assert
(Condition => CU.P_Unit_Kind = Unit_Specification,
Message => "*.ads is unexpectedly not a Unit_Specification");
Put_Line ("Withed");
for WU of CU.P_Withed_Units loop
Put_Line (" " & Image (WU.P_Decl.P_Defining_Name.Text));
end loop;
Assert
(Condition => CU.P_Withed_Units'Length = 1,
Message =>
"Length of Withed Units is unexpectedly not 1 but " &
CU.P_Withed_Units'Length'Image);
Put_Line ("Imported");
for IU of CU.P_Imported_Units loop
Put_Line (" " & Image (IU.P_Decl.P_Defining_Name.Text));
end loop;
Assert
(Condition => CU.P_Imported_Units'Length = 2,
Message =>
"Length of Imported Units is unexpectedly not 2 but " &
CU.P_Imported_Units'Length'Image);
Put_Line ("Dependencies");
for UD of CU.P_Unit_Dependencies loop
Put_Line (" " & Image (UD.P_Decl.P_Defining_Name.Text));
end loop;
Assert
(Condition => CU.P_Unit_Dependencies'Length = 14,
Message =>
"Length of Unit Dependencies is unexpectedly not 14 but " &
CU.P_Unit_Dependencies'Length'Image);
end;
end Test_Units;
-- Test plumbing
overriding function Name (T : Example_Test_Case) return AUnit.Message_String
is
pragma Unreferenced (T);
begin
return AUnit.Format ("Workshop Examples");
end Name;
overriding procedure Register_Tests (T : in out Example_Test_Case) is
begin
Registration.Register_Routine (T, Test_Mismatch'Access, "Mismatch");
Registration.Register_Routine
(T, Test_Prefix_Notation'Access, "Prefix Notation");
Registration.Register_Routine
(T, Test_Default_Value'Access, "Default Value");
Registration.Register_Routine
(T, Test_String'Access, "String representations");
Registration.Register_Routine
(T, Test_LibAdaLang_Stmt'Access, "LibAdaLang Stmt");
Registration.Register_Routine
(T, Test_LibAdaLang_Decl'Access, "LibAdaLang Decl");
Registration.Register_Routine
(T, Test_Assignment_By_If'Access, "Assignment by If Statement");
Registration.Register_Routine
(T, Test_If_Not'Access,
"If with not condition - readability issue: double negation");
Registration.Register_Routine
(T, Test_LibAdaLang_Visitor'Access,
"LibAdaLang Visitor for Non-local Declarations");
Registration.Register_Routine
(T, Test_Rejuvenation_Find'Access,
"Rejuvenation Find for Non-local Declarations");
Registration.Register_Routine
(T, Test_Rejuvenation_Match_Pattern'Access,
"Rejuvenation Match Pattern for Object Declarations " &
"with type Ada_Node and a default expression");
Registration.Register_Routine
(T, Test_Text_Rewrite'Access, "Rejuvenation Text Rewrite ");
Registration.Register_Routine
(T, Test_Units'Access, "Units - withed / imported");
end Register_Tests;
end Test_Examples;
|
with
FLTK.Widgets.Inputs,
FLTK.Widgets.Menus.Menu_Buttons;
package FLTK.Widgets.Groups.Input_Choices is
type Input_Choice is new Group with private;
type Input_Choice_Reference (Data : not null access Input_Choice'Class) is
limited null record with Implicit_Dereference => Data;
package Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Input_Choice;
end Forge;
function Input
(This : in out Input_Choice)
return FLTK.Widgets.Inputs.Input_Reference;
function Menu_Button
(This : in out Input_Choice)
return FLTK.Widgets.Menus.Menu_Buttons.Menu_Button_Reference;
procedure Clear
(This : in out Input_Choice);
function Has_Changed
(This : in Input_Choice)
return Boolean;
procedure Clear_Changed
(This : in out Input_Choice);
procedure Set_Changed
(This : in out Input_Choice;
To : in Boolean);
function Get_Down_Box
(This : in Input_Choice)
return Box_Kind;
procedure Set_Down_Box
(This : in out Input_Choice;
To : in Box_Kind);
function Get_Text_Color
(This : in Input_Choice)
return Color;
procedure Set_Text_Color
(This : in out Input_Choice;
To : in Color);
function Get_Text_Font
(This : in Input_Choice)
return Font_Kind;
procedure Set_Text_Font
(This : in out Input_Choice;
To : in Font_Kind);
function Get_Text_Size
(This : in Input_Choice)
return Font_Size;
procedure Set_Text_Size
(This : in out Input_Choice;
To : in Font_Size);
function Get_Input
(This : in Input_Choice)
return String;
procedure Set_Input
(This : in out Input_Choice;
To : in String);
procedure Set_Item
(This : in out Input_Choice;
Num : in Integer);
procedure Draw
(This : in out Input_Choice);
function Handle
(This : in out Input_Choice;
Event : in Event_Kind)
return Event_Outcome;
private
package INP renames FLTK.Widgets.Inputs;
package MB renames FLTK.Widgets.Menus.Menu_Buttons;
type Input_Access is access INP.Input;
type Menu_Button_Access is access MB.Menu_Button;
type Input_Choice is new Group with record
My_Input : Input_Access;
My_Menu_Button : Menu_Button_Access;
end record;
overriding procedure Finalize
(This : in out Input_Choice);
pragma Inline (Input);
pragma Inline (Menu_Button);
pragma Inline (Has_Changed);
pragma Inline (Clear_Changed);
pragma Inline (Get_Down_Box);
pragma Inline (Set_Down_Box);
pragma Inline (Get_Text_Color);
pragma Inline (Set_Text_Color);
pragma Inline (Get_Text_Font);
pragma Inline (Set_Text_Font);
pragma Inline (Get_Text_Size);
pragma Inline (Set_Text_Size);
pragma Inline (Get_Input);
pragma Inline (Set_Input);
pragma Inline (Set_Item);
pragma Inline (Draw);
pragma Inline (Handle);
end FLTK.Widgets.Groups.Input_Choices;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.