CombinedText stringlengths 4 3.42M |
|---|
generic
type Element_Type is digits <>;
type Index_Type is (<>);
type Array_Type is array(Index_Type range <>) of Element_Type;
package Shell_Sort is
procedure Sort(Item : in out Array_Type);
end Shell_Sort;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_tex_enviv_cookie_t is
-- Item
--
type Item is record
sequence : aliased Interfaces.C.unsigned;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_tex_enviv_cookie_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_tex_enviv_cookie_t.Item,
Element_Array => xcb.xcb_glx_get_tex_enviv_cookie_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_tex_enviv_cookie_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_tex_enviv_cookie_t.Pointer,
Element_Array => xcb.xcb_glx_get_tex_enviv_cookie_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_tex_enviv_cookie_t;
|
-- TITLE main body
-- AUTHOR: John Self (UCI)
-- DESCRIPTION driver routines for aflex. Calls drivers for all
-- high level routines from other packages.
-- $Header: /co/ua/self/arcadia/aflex/ada/src/RCS/mainB.a,v 1.23 90/10/15 20:00:28 self Exp Locker: self $
--***************************************************************************
-- This file is subject to the Arcadia License Agreement.
--
-- (see notice in aflex.a)
--
--***************************************************************************
with MISC_DEFS, MISC, COMMAND_LINE_INTERFACE, DFA, ECS, GEN, TEXT_IO, PARSER;
with MAIN_BODY, TSTRING, PARSE_TOKENS, SKELETON_MANAGER, EXTERNAL_FILE_MANAGER;
with EXTERNAL_FILE_MANAGER, INT_IO; use MISC_DEFS, COMMAND_LINE_INTERFACE,
TSTRING, EXTERNAL_FILE_MANAGER;
package body MAIN_BODY is
OUTFILE_CREATED : BOOLEAN := FALSE;
AFLEX_VERSION : STRING(1 .. 4) := "1.4a";
STARTTIME, ENDTIME : VSTRING;
-- aflexend - terminate aflex
--
-- note
-- This routine does not return.
procedure AFLEXEND(STATUS : in INTEGER) is
use TEXT_IO;
TBLSIZ : INTEGER;
begin
TERMINATION_STATUS := STATUS;
-- we'll return this value of the OS.
if (IS_OPEN(SKELFILE)) then
CLOSE(SKELFILE);
end if;
if (IS_OPEN(TEMP_ACTION_FILE)) then
DELETE(TEMP_ACTION_FILE);
end if;
if (IS_OPEN(DEF_FILE)) then
DELETE(DEF_FILE);
end if;
if (BACKTRACK_REPORT) then
if (NUM_BACKTRACKING = 0) then
TEXT_IO.PUT_LINE(BACKTRACK_FILE, "No backtracking.");
else
if (FULLTBL) then
INT_IO.PUT(BACKTRACK_FILE, NUM_BACKTRACKING, 0);
TEXT_IO.PUT_LINE(BACKTRACK_FILE,
" backtracking (non-accepting) states.");
else
TEXT_IO.PUT_LINE(BACKTRACK_FILE, "Compressed tables always backtrack."
);
end if;
end if;
CLOSE(BACKTRACK_FILE);
end if;
if (PRINTSTATS) then
ENDTIME := MISC.AFLEX_GETTIME;
TEXT_IO.PUT_LINE(STANDARD_ERROR, "aflex version " & AFLEX_VERSION &
" usage statistics:");
TSTRING.PUT_LINE(STANDARD_ERROR, " started at " & STARTTIME &
", finished at " & ENDTIME);
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, LASTNFA, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MNS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " NFA states");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, LASTDFA, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MAX_DFAS, 0);
TEXT_IO.PUT(STANDARD_ERROR, " DFA states (");
INT_IO.PUT(STANDARD_ERROR, TOTNST, 0);
TEXT_IO.PUT(STANDARD_ERROR, " words)");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUM_RULES - 1, 0);
-- - 1 for def. rule
TEXT_IO.PUT_LINE(STANDARD_ERROR, " rules");
if (NUM_BACKTRACKING = 0) then
TEXT_IO.PUT_LINE(STANDARD_ERROR, " No backtracking");
else
if (FULLTBL) then
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUM_BACKTRACKING, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR,
" backtracking (non-accepting) states");
else
TEXT_IO.PUT_LINE(STANDARD_ERROR, " compressed tables always backtrack"
);
end if;
end if;
if (BOL_NEEDED) then
TEXT_IO.PUT_LINE(STANDARD_ERROR, " Beginning-of-line patterns used");
end if;
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, LASTSC, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MAX_SCS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " start conditions");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMEPS, 0);
TEXT_IO.PUT(STANDARD_ERROR, " epsilon states, ");
INT_IO.PUT(STANDARD_ERROR, EPS2, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " double epsilon states");
if (LASTCCL = 0) then
TEXT_IO.PUT_LINE(STANDARD_ERROR, " no character classes");
else
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, LASTCCL, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MAXCCLS, 0);
TEXT_IO.PUT(STANDARD_ERROR, " character classes needed ");
INT_IO.PUT(STANDARD_ERROR, CCLMAP(LASTCCL) + CCLLEN(LASTCCL), 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MAX_CCL_TBL_SIZE, 0);
TEXT_IO.PUT(STANDARD_ERROR, " words of storage, ");
INT_IO.PUT(STANDARD_ERROR, CCLREUSE, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, "reused");
end if;
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMSNPAIRS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " state/nextstate pairs created");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMUNIQ, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, NUMDUP, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " unique/duplicate transitions");
if (FULLTBL) then
TBLSIZ := LASTDFA*NUMECS;
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, TBLSIZ, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " table entries");
else
TBLSIZ := 2*(LASTDFA + NUMTEMPS) + 2*TBLEND;
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, LASTDFA + NUMTEMPS, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MAX_DFAS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " base-def entries created");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, TBLEND, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MAX_XPAIRS, 0);
TEXT_IO.PUT(STANDARD_ERROR, " (peak ");
INT_IO.PUT(STANDARD_ERROR, PEAKPAIRS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, ") nxt-chk entries created");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMTEMPS*NUMMECS, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CURRENT_MAX_TEMPLATE_XPAIRS, 0);
TEXT_IO.PUT(STANDARD_ERROR, " (peak ");
INT_IO.PUT(STANDARD_ERROR, NUMTEMPS*NUMECS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, ") template nxt-chk entries created");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMMT, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " empty table entries");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMPROTS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " protos created");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMTEMPS, 0);
TEXT_IO.PUT(STANDARD_ERROR, " templates created, ");
INT_IO.PUT(STANDARD_ERROR, TMPUSES, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, "uses");
end if;
if (USEECS) then
TBLSIZ := TBLSIZ + CSIZE;
TEXT_IO.PUT_LINE(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMECS, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CSIZE, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " equivalence classes created");
end if;
if (USEMECS) then
TBLSIZ := TBLSIZ + NUMECS;
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUMMECS, 0);
TEXT_IO.PUT(STANDARD_ERROR, '/');
INT_IO.PUT(STANDARD_ERROR, CSIZE, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " meta-equivalence classes created");
end if;
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, HSHCOL, 0);
TEXT_IO.PUT(STANDARD_ERROR, " (");
INT_IO.PUT(STANDARD_ERROR, HSHSAVE, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " saved) hash collisions, ");
INT_IO.PUT(STANDARD_ERROR, DFAEQL, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " DFAs equal");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, NUM_REALLOCS, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " sets of reallocations needed");
TEXT_IO.PUT(STANDARD_ERROR, " ");
INT_IO.PUT(STANDARD_ERROR, TBLSIZ, 0);
TEXT_IO.PUT_LINE(STANDARD_ERROR, " total table entries needed");
end if;
if (STATUS /= 0) then
raise AFLEX_TERMINATE;
end if;
end AFLEXEND;
-- aflexinit - initialize aflex
procedure AFLEXINIT is
use TEXT_IO, TSTRING;
SAWCMPFLAG, USE_STDOUT : BOOLEAN;
OUTPUT_FILE : FILE_TYPE;
INPUT_FILE : FILE_TYPE;
I : INTEGER;
ARG_CNT : INTEGER;
FLAG_POS : INTEGER;
ARG : VSTRING;
SKELNAME : VSTRING;
SKELNAME_USED : BOOLEAN := FALSE;
begin
PRINTSTATS := FALSE;
SYNTAXERROR := FALSE;
TRACE := FALSE;
SPPRDFLT := FALSE;
INTERACTIVE := FALSE;
CASEINS := FALSE;
BACKTRACK_REPORT := FALSE;
PERFORMANCE_REPORT := FALSE;
DDEBUG := FALSE;
FULLTBL := FALSE;
CONTINUED_ACTION := FALSE;
GEN_LINE_DIRS := TRUE;
USEMECS := TRUE;
USEECS := TRUE;
SAWCMPFLAG := FALSE;
USE_STDOUT := FALSE;
-- read flags
COMMAND_LINE_INTERFACE.INITIALIZE_COMMAND_LINE;
-- load up argv
EXTERNAL_FILE_MANAGER.INITIALIZE_FILES;
-- do external files setup
-- loop through the list of arguments
ARG_CNT := 1;
while (ARG_CNT <= ARGC - 1) loop
if ((CHAR(ARGV(ARG_CNT), 1) /= '-') or (LEN(ARGV(ARG_CNT)) < 2)) then
exit;
end if;
-- loop through the flags in this argument.
ARG := ARGV(ARG_CNT);
FLAG_POS := 2;
while (FLAG_POS <= LEN(ARG)) loop
case CHAR(ARG, FLAG_POS) is
when 'b' =>
BACKTRACK_REPORT := TRUE;
when 'd' =>
DDEBUG := TRUE;
when 'f' =>
USEECS := FALSE;
USEMECS := FALSE;
FULLTBL := TRUE;
when 'I' =>
INTERACTIVE := TRUE;
when 'i' =>
CASEINS := TRUE;
when 'L' =>
GEN_LINE_DIRS := FALSE;
when 'p' =>
PERFORMANCE_REPORT := TRUE;
when 'S' =>
if (FLAG_POS /= 2) then
MISC.AFLEXERROR("-S flag must be given separately");
end if;
SKELNAME := SLICE(ARG, FLAG_POS + 1, LEN(ARG));
SKELNAME_USED := TRUE;
goto GET_NEXT_ARG;
when 's' =>
SPPRDFLT := TRUE;
when 't' =>
USE_STDOUT := TRUE;
when 'T' =>
TRACE := TRUE;
when 'v' =>
PRINTSTATS := TRUE;
-- UMASS CODES :
-- Added an flag to indicate whether or not the aflex generated
-- codes will be used by Ayacc extension.
when 'E' =>
Ayacc_Extension_Flag := TRUE;
-- END OF UMASS CODES.
when others =>
MISC.AFLEXERROR("unknown flag " & CHAR(ARG, FLAG_POS));
end case;
FLAG_POS := FLAG_POS + 1;
end loop;
<<GET_NEXT_ARG>> ARG_CNT := ARG_CNT + 1;
-- go on to next argument from list.
end loop;
if (FULLTBL and USEMECS) then
MISC.AFLEXERROR("full table and -cm don't make sense together");
end if;
if (FULLTBL and INTERACTIVE) then
MISC.AFLEXERROR("full table and -I are (currently) incompatible");
end if;
if (ARG_CNT < ARGC) then
begin
if (ARG_CNT - ARGC > 1) then
MISC.AFLEXERROR("extraneous argument(s) given");
end if;
-- Tell aflex where to read input from.
INFILENAME := ARGV(ARG_CNT);
OPEN(INPUT_FILE, IN_FILE, STR(ARGV(ARG_CNT)));
SET_INPUT(INPUT_FILE);
exception
when NAME_ERROR =>
MISC.AFLEXFATAL("can't open " & INFILENAME);
end;
end if;
if (not USE_STDOUT) then
EXTERNAL_FILE_MANAGER.GET_SCANNER_FILE(OUTPUT_FILE);
OUTFILE_CREATED := TRUE;
end if;
if (BACKTRACK_REPORT) then
EXTERNAL_FILE_MANAGER.GET_BACKTRACK_FILE(BACKTRACK_FILE);
end if;
LASTCCL := 0;
LASTSC := 0;
--initialize the statistics
STARTTIME := MISC.AFLEX_GETTIME;
begin
-- open the skeleton file
if (SKELNAME_USED) then
OPEN(SKELFILE, IN_FILE, STR(SKELNAME));
SKELETON_MANAGER.SET_EXTERNAL_SKELETON;
end if;
exception
when USE_ERROR | NAME_ERROR =>
MISC.AFLEXFATAL("couldn't open skeleton file " & SKELNAME);
end;
-- without a third argument create make an anonymous temp file.
begin
CREATE(TEMP_ACTION_FILE, OUT_FILE);
CREATE(DEF_FILE, OUT_FILE);
exception
when USE_ERROR | NAME_ERROR =>
MISC.AFLEXFATAL("can't create temporary file");
end;
LASTDFA := 0;
LASTNFA := 0;
NUM_RULES := 0;
NUMAS := 0;
NUMSNPAIRS := 0;
TMPUSES := 0;
NUMECS := 0;
NUMEPS := 0;
EPS2 := 0;
NUM_REALLOCS := 0;
HSHCOL := 0;
DFAEQL := 0;
TOTNST := 0;
NUMUNIQ := 0;
NUMDUP := 0;
HSHSAVE := 0;
EOFSEEN := FALSE;
DATAPOS := 0;
DATALINE := 0;
NUM_BACKTRACKING := 0;
ONESP := 0;
NUMPROTS := 0;
VARIABLE_TRAILING_CONTEXT_RULES := FALSE;
BOL_NEEDED := FALSE;
LINENUM := 1;
SECTNUM := 1;
FIRSTPROT := NIL;
-- used in mkprot() so that the first proto goes in slot 1
-- of the proto queue
LASTPROT := 1;
if (USEECS) then
-- set up doubly-linked equivalence classes
ECGROUP(1) := NIL;
for CNT in 2 .. CSIZE loop
ECGROUP(CNT) := CNT - 1;
NEXTECM(CNT - 1) := CNT;
end loop;
NEXTECM(CSIZE) := NIL;
else
-- put everything in its own equivalence class
for CNT in 1 .. CSIZE loop
ECGROUP(CNT) := CNT;
NEXTECM(CNT) := BAD_SUBSCRIPT; -- to catch errors
end loop;
end if;
SET_UP_INITIAL_ALLOCATIONS;
end AFLEXINIT;
-- readin - read in the rules section of the input file(s)
procedure READIN is
begin
SKELETON_MANAGER.SKELOUT;
TEXT_IO.PUT("with " & TSTRING.STR(MISC.BASENAME) & "_dfa" & "; ");
TEXT_IO.PUT_LINE("use " & TSTRING.STR(MISC.BASENAME) & "_dfa" & "; ");
TEXT_IO.PUT("with " & TSTRING.STR(MISC.BASENAME) & "_io" & "; ");
TEXT_IO.PUT_LINE("use " & TSTRING.STR(MISC.BASENAME) & "_io" & "; ");
MISC.LINE_DIRECTIVE_OUT;
PARSER.YYPARSE;
if (USEECS) then
ECS.CRE8ECS(NEXTECM, ECGROUP, CSIZE, NUMECS);
ECS.CCL2ECL;
else
NUMECS := CSIZE;
end if;
exception
when PARSE_TOKENS.SYNTAX_ERROR =>
MISC.AFLEXERROR("fatal parse error at line " & INTEGER'IMAGE(LINENUM));
MAIN_BODY.AFLEXEND(1);
end READIN;
-- set_up_initial_allocations - allocate memory for internal tables
procedure SET_UP_INITIAL_ALLOCATIONS is
begin
CURRENT_MNS := INITIAL_MNS;
FIRSTST := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
LASTST := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
FINALST := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
TRANSCHAR := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
TRANS1 := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
TRANS2 := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
ACCPTNUM := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
ASSOC_RULE := ALLOCATE_INTEGER_ARRAY(CURRENT_MNS);
STATE_TYPE := ALLOCATE_STATE_ENUM_ARRAY(CURRENT_MNS);
CURRENT_MAX_RULES := INITIAL_MAX_RULES;
RULE_TYPE := ALLOCATE_RULE_ENUM_ARRAY(CURRENT_MAX_RULES);
RULE_LINENUM := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_RULES);
CURRENT_MAX_SCS := INITIAL_MAX_SCS;
SCSET := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_SCS);
SCBOL := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_SCS);
SCXCLU := ALLOCATE_BOOLEAN_ARRAY(CURRENT_MAX_SCS);
SCEOF := ALLOCATE_BOOLEAN_ARRAY(CURRENT_MAX_SCS);
SCNAME := ALLOCATE_VSTRING_ARRAY(CURRENT_MAX_SCS);
ACTVSC := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_SCS);
CURRENT_MAXCCLS := INITIAL_MAX_CCLS;
CCLMAP := ALLOCATE_INTEGER_ARRAY(CURRENT_MAXCCLS);
CCLLEN := ALLOCATE_INTEGER_ARRAY(CURRENT_MAXCCLS);
CCLNG := ALLOCATE_INTEGER_ARRAY(CURRENT_MAXCCLS);
CURRENT_MAX_CCL_TBL_SIZE := INITIAL_MAX_CCL_TBL_SIZE;
CCLTBL := ALLOCATE_CHARACTER_ARRAY(CURRENT_MAX_CCL_TBL_SIZE);
CURRENT_MAX_DFA_SIZE := INITIAL_MAX_DFA_SIZE;
CURRENT_MAX_XPAIRS := INITIAL_MAX_XPAIRS;
NXT := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_XPAIRS);
CHK := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_XPAIRS);
CURRENT_MAX_TEMPLATE_XPAIRS := INITIAL_MAX_TEMPLATE_XPAIRS;
TNXT := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_TEMPLATE_XPAIRS);
CURRENT_MAX_DFAS := INITIAL_MAX_DFAS;
BASE := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_DFAS);
DEF := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_DFAS);
DFASIZ := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_DFAS);
ACCSIZ := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_DFAS);
DHASH := ALLOCATE_INTEGER_ARRAY(CURRENT_MAX_DFAS);
DSS := ALLOCATE_INT_PTR_ARRAY(CURRENT_MAX_DFAS);
DFAACC := ALLOCATE_DFAACC_UNION(CURRENT_MAX_DFAS);
end SET_UP_INITIAL_ALLOCATIONS;
end MAIN_BODY;
|
with Entities; use Entities;
with Rectangles;
with Worlds;
with Materials;
with Vectors2D; use Vectors2D;
with Renderer; use Renderer;
with DemoLogic; use DemoLogic;
with Utils; use Utils;
package body AdaPhysics2DDemo is
procedure Start(This : in out Menu)
is
SCeiling, SFloor, SRight, SLeft : EntityClassAcc;
EAir, EWater : EntityClassAcc;
W1 : Worlds.World;
VecZero : constant Vec2D := (0.0, 0.0);
Vec1, Vec2 : Vec2D;
MaxEnt : constant Natural := 32; -- max ents + envs. 0 = unlimited
fps : constant Float := 30.0;
dt : constant Float := 1.0 / fps;
cd : constant Integer := 10; -- * dt | cooldown
Cue : VisualCue;
-- if true, the world will no longer update
Frozen : Boolean := False;
Cooldown : Integer := 0;
Tick : Integer := 0;
begin
-- Clears the calling menu
This.Free;
-- Ceiling
Vec1 := Vec2D'(x => 10.0, y => 0.0);
Vec2 := Vec2D'(x => 220.0, y => 10.0);
SCeiling := Rectangles.Create(Vec1, VecZero, VecZero, Vec2, Materials.STATIC);
-- Floor
Vec1 := Vec2D'(x => 0.0, y => 310.0);
Vec2 := Vec2D'(x => 240.0, y => 10.0);
SFloor := Rectangles.Create(Vec1, VecZero, VecZero, Vec2, Materials.STATIC);
-- Right wall
Vec1 := Vec2D'(x => 230.0, y => 0.0);
Vec2 := Vec2D'(x => 10.0, y => 310.0);
SRight := Rectangles.Create(Vec1, VecZero, VecZero, Vec2, Materials.STATIC);
-- Left wall
Vec1 := Vec2D'(x => 0.0, y => 0.0);
Vec2 := Vec2D'(x => 10.0, y => 310.0);
SLeft := Rectangles.Create(Vec1, VecZero, VecZero, Vec2, Materials.STATIC);
-- Top vacuum env
Vec1 := Vec2D'(x => 10.0, y => 10.0);
Vec2 := Vec2D'(x => 220.0, y => 250.0);
EAir := Rectangles.Create(Vec1, VecZero, VecZero, Vec2, Materials.AIR);
-- Bottom water env
Vec1 := Vec2D'(x => 10.0, y => 250.0);
Vec2 := Vec2D'(x => 220.0, y => 60.0);
EWater := Rectangles.Create(Vec1, VecZero, VecZero, Vec2, Materials.WATER);
W1.Init(dt, MaxEnt);
W1.SetInvalidChecker(InvalidEnt'Access);
W1.SetMaxSpeed((500.0, 500.0));
W1.AddEnvironment(EAir);
W1.AddEnvironment(EWater);
W1.AddEntity(SCeiling);
W1.AddEntity(SFloor);
W1.AddEntity(SRight);
W1.AddEntity(SLeft);
Clear(True);
loop
if Cooldown > 0 then
Cooldown := Cooldown - 1;
end if;
if not Frozen then
Tick := Tick + 1;
-- update the world for one tick (dt)
W1.Step(Worlds.Step_Normal);
end if;
-- clear buffer for next render
Clear(False);
-- gets the user inputs and updates the world accordingly
if Inputs(W1, Frozen, Cooldown, Cue) then
Cooldown := cd; -- reset cooldown
end if;
-- Exit when the menu quit was selected
exit when Cue.X < 0;
-- renders
Render(W1, Cue);
end loop;
W1.Free;
end Start;
end AdaPhysics2DDemo;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-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$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.UML.Connectors;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Interactions;
with AMF.UML.Message_Ends;
with AMF.UML.Messages;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Packages.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Value_Specifications.Collections;
with AMF.Visitors;
package AMF.Internals.UML_Messages is
type UML_Message_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Messages.UML_Message with null record;
overriding function Get_Argument
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Value_Specifications.Collections.Ordered_Set_Of_UML_Value_Specification;
-- Getter of Message::argument.
--
-- The arguments of the Message
overriding function Get_Connector
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Connectors.UML_Connector_Access;
-- Getter of Message::connector.
--
-- The Connector on which this Message is sent.
overriding procedure Set_Connector
(Self : not null access UML_Message_Proxy;
To : AMF.UML.Connectors.UML_Connector_Access);
-- Setter of Message::connector.
--
-- The Connector on which this Message is sent.
overriding function Get_Interaction
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Interactions.UML_Interaction_Access;
-- Getter of Message::interaction.
--
-- The enclosing Interaction owning the Message
overriding procedure Set_Interaction
(Self : not null access UML_Message_Proxy;
To : AMF.UML.Interactions.UML_Interaction_Access);
-- Setter of Message::interaction.
--
-- The enclosing Interaction owning the Message
overriding function Get_Message_Kind
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.UML_Message_Kind;
-- Getter of Message::messageKind.
--
-- The derived kind of the Message (complete, lost, found or unknown)
overriding function Get_Message_Sort
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.UML_Message_Sort;
-- Getter of Message::messageSort.
--
-- The sort of communication reflected by the Message
overriding procedure Set_Message_Sort
(Self : not null access UML_Message_Proxy;
To : AMF.UML.UML_Message_Sort);
-- Setter of Message::messageSort.
--
-- The sort of communication reflected by the Message
overriding function Get_Receive_Event
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Message_Ends.UML_Message_End_Access;
-- Getter of Message::receiveEvent.
--
-- References the Receiving of the Message
overriding procedure Set_Receive_Event
(Self : not null access UML_Message_Proxy;
To : AMF.UML.Message_Ends.UML_Message_End_Access);
-- Setter of Message::receiveEvent.
--
-- References the Receiving of the Message
overriding function Get_Send_Event
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Message_Ends.UML_Message_End_Access;
-- Getter of Message::sendEvent.
--
-- References the Sending of the Message.
overriding procedure Set_Send_Event
(Self : not null access UML_Message_Proxy;
To : AMF.UML.Message_Ends.UML_Message_End_Access);
-- Setter of Message::sendEvent.
--
-- References the Sending of the Message.
overriding function Get_Signature
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Named_Elements.UML_Named_Element_Access;
-- Getter of Message::signature.
--
-- The signature of the Message is the specification of its content. It
-- refers either an Operation or a Signal.
overriding procedure Set_Signature
(Self : not null access UML_Message_Proxy;
To : AMF.UML.Named_Elements.UML_Named_Element_Access);
-- Setter of Message::signature.
--
-- The signature of the Message is the specification of its content. It
-- refers either an Operation or a Signal.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Message_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Message_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Message_Kind
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.UML_Message_Kind;
-- Operation Message::messageKind.
--
-- Missing derivation for Message::/messageKind : MessageKind
overriding function All_Owning_Packages
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Message_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Message_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding procedure Enter_Element
(Self : not null access constant UML_Message_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Message_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Message_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Messages;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Program is
begin
Ada.Text_IO.Put("HelloWorld");
end Program; |
package body Meassure_Velocity is
procedure Retrieve_Velocity (Velocity_Z : out Float) is
begin
--if Imu.Gyro.Read.Available() not true then
-- raise Gyro_Not_Available ;
--end if;
--Imu.gyro.read(data);
--z_gyro = gyro.data(z_angle);
--return z_gyro;
Z_Coordinate := 2.0;
Velocity_Z := Z_Coordinate;
end Retrieve_Velocity;
end Meassure_Velocity;
|
-----------------------------------------------------------------------
-- util-commands-parsers.gnat_parser -- GNAT command line parser for command drivers
-- Copyright (C) 2018, 2019, 2021 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 GNAT.OS_Lib;
package body Util.Commands.Parsers.GNAT_Parser is
function To_OS_Lib_Argument_List (Args : in Argument_List'Class)
return GNAT.OS_Lib.Argument_List_Access;
function To_OS_Lib_Argument_List (Args : in Argument_List'Class)
return GNAT.OS_Lib.Argument_List_Access is
Count : constant Natural := Args.Get_Count;
New_Arg : GNAT.OS_Lib.Argument_List (1 .. Count);
begin
for I in 1 .. Count loop
New_Arg (I) := new String '(Args.Get_Argument (I));
end loop;
return new GNAT.OS_Lib.Argument_List '(New_Arg);
end To_OS_Lib_Argument_List;
-- ------------------------------
-- Get all the remaining arguments from the GNAT command line parse.
-- ------------------------------
procedure Get_Arguments (List : in out Dynamic_Argument_List;
Command : in String;
Parser : in GC.Opt_Parser := GC.Command_Line_Parser) is
begin
List.Name := Ada.Strings.Unbounded.To_Unbounded_String (Command);
loop
declare
S : constant String := GC.Get_Argument (Parser => Parser);
begin
exit when S'Length = 0;
List.List.Append (S);
end;
end loop;
end Get_Arguments;
procedure Execute (Config : in out Config_Type;
Args : in Util.Commands.Argument_List'Class;
Process : not null access
procedure (Cmd_Args : in Commands.Argument_List'Class)) is
use type GC.Command_Line_Configuration;
Empty : Config_Type;
begin
if Config /= Empty then
declare
Parser : GC.Opt_Parser;
Cmd_Args : Dynamic_Argument_List;
Params : GNAT.OS_Lib.Argument_List_Access
:= To_OS_Lib_Argument_List (Args);
begin
GC.Initialize_Option_Scan (Parser, Params);
GC.Getopt (Config => Config, Parser => Parser);
Get_Arguments (Cmd_Args, Args.Get_Command_Name, Parser);
Process (Cmd_Args);
GC.Free (Config);
GNAT.OS_Lib.Free (Params);
exception
when others =>
GNAT.OS_Lib.Free (Params);
GC.Free (Config);
raise;
end;
else
Process (Args);
end if;
end Execute;
procedure Usage (Name : in String;
Config : in out Config_Type) is
Opts : constant String := GC.Get_Switches (Config);
begin
if Opts'Length > 0 then
GC.Set_Usage (Config, Usage => Name & " [switches] [arguments]");
GC.Display_Help (Config);
end if;
end Usage;
end Util.Commands.Parsers.GNAT_Parser;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P A R . P R A G --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 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, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Generally the parser checks the basic syntax of pragmas, but does not
-- do specialized syntax checks for individual pragmas, these are deferred
-- to semantic analysis time (see unit Sem_Prag). There are some pragmas
-- which require recognition and either partial or complete processing
-- during parsing, and this unit performs this required processing.
with Fname.UF; use Fname.UF;
with Osint; use Osint;
with Stringt; use Stringt;
with Stylesw; use Stylesw;
with Uintp; use Uintp;
with Uname; use Uname;
separate (Par)
function Prag (Pragma_Node : Node_Id; Semi : Source_Ptr) return Node_Id is
Pragma_Name : constant Name_Id := Chars (Pragma_Node);
Pragma_Sloc : constant Source_Ptr := Sloc (Pragma_Node);
Arg_Count : Nat;
Arg_Node : Node_Id;
-----------------------
-- Local Subprograms --
-----------------------
function Arg1 return Node_Id;
function Arg2 return Node_Id;
function Arg3 return Node_Id;
function Arg4 return Node_Id;
-- Obtain specified Pragma_Argument_Association. It is allowable to call
-- the routine for the argument one past the last present argument, but
-- that is the only case in which a non-present argument can be referenced.
procedure Check_Arg_Count (Required : Int);
-- Check argument count for pragma = Required.
-- If not give error and raise Error_Resync.
procedure Check_Arg_Is_String_Literal (Arg : Node_Id);
-- Check the expression of the specified argument to make sure that it
-- is a string literal. If not give error and raise Error_Resync.
procedure Check_Arg_Is_On_Or_Off (Arg : Node_Id);
-- Check the expression of the specified argument to make sure that it
-- is an identifier which is either ON or OFF, and if not, then issue
-- an error message and raise Error_Resync.
procedure Check_No_Identifier (Arg : Node_Id);
-- Checks that the given argument does not have an identifier. If an
-- identifier is present, then an error message is issued, and
-- Error_Resync is raised.
procedure Check_Optional_Identifier (Arg : Node_Id; Id : Name_Id);
-- Checks if the given argument has an identifier, and if so, requires
-- it to match the given identifier name. If there is a non-matching
-- identifier, then an error message is given and Error_Resync raised.
procedure Check_Required_Identifier (Arg : Node_Id; Id : Name_Id);
-- Same as Check_Optional_Identifier, except that the name is required
-- to be present and to match the given Id value.
----------
-- Arg1 --
----------
function Arg1 return Node_Id is
begin
return First (Pragma_Argument_Associations (Pragma_Node));
end Arg1;
----------
-- Arg2 --
----------
function Arg2 return Node_Id is
begin
return Next (Arg1);
end Arg2;
----------
-- Arg3 --
----------
function Arg3 return Node_Id is
begin
return Next (Arg2);
end Arg3;
----------
-- Arg4 --
----------
function Arg4 return Node_Id is
begin
return Next (Arg3);
end Arg4;
---------------------
-- Check_Arg_Count --
---------------------
procedure Check_Arg_Count (Required : Int) is
begin
if Arg_Count /= Required then
Error_Msg ("wrong number of arguments for pragma%", Pragma_Sloc);
raise Error_Resync;
end if;
end Check_Arg_Count;
----------------------------
-- Check_Arg_Is_On_Or_Off --
----------------------------
procedure Check_Arg_Is_On_Or_Off (Arg : Node_Id) is
Argx : constant Node_Id := Expression (Arg);
begin
if Nkind (Expression (Arg)) /= N_Identifier
or else (Chars (Argx) /= Name_On
and then
Chars (Argx) /= Name_Off)
then
Error_Msg_Name_2 := Name_On;
Error_Msg_Name_3 := Name_Off;
Error_Msg
("argument for pragma% must be% or%", Sloc (Argx));
raise Error_Resync;
end if;
end Check_Arg_Is_On_Or_Off;
---------------------------------
-- Check_Arg_Is_String_Literal --
---------------------------------
procedure Check_Arg_Is_String_Literal (Arg : Node_Id) is
begin
if Nkind (Expression (Arg)) /= N_String_Literal then
Error_Msg
("argument for pragma% must be string literal",
Sloc (Expression (Arg)));
raise Error_Resync;
end if;
end Check_Arg_Is_String_Literal;
-------------------------
-- Check_No_Identifier --
-------------------------
procedure Check_No_Identifier (Arg : Node_Id) is
begin
if Chars (Arg) /= No_Name then
Error_Msg_N ("pragma% does not permit named arguments", Arg);
raise Error_Resync;
end if;
end Check_No_Identifier;
-------------------------------
-- Check_Optional_Identifier --
-------------------------------
procedure Check_Optional_Identifier (Arg : Node_Id; Id : Name_Id) is
begin
if Present (Arg) and then Chars (Arg) /= No_Name then
if Chars (Arg) /= Id then
Error_Msg_Name_2 := Id;
Error_Msg_N ("pragma% argument expects identifier%", Arg);
end if;
end if;
end Check_Optional_Identifier;
-------------------------------
-- Check_Required_Identifier --
-------------------------------
procedure Check_Required_Identifier (Arg : Node_Id; Id : Name_Id) is
begin
if Chars (Arg) /= Id then
Error_Msg_Name_2 := Id;
Error_Msg_N ("pragma% argument must have identifier%", Arg);
end if;
end Check_Required_Identifier;
----------
-- Prag --
----------
begin
Error_Msg_Name_1 := Pragma_Name;
-- Count number of arguments. This loop also checks if any of the arguments
-- are Error, indicating a syntax error as they were parsed. If so, we
-- simply return, because we get into trouble with cascaded errors if we
-- try to perform our error checks on junk arguments.
Arg_Count := 0;
if Present (Pragma_Argument_Associations (Pragma_Node)) then
Arg_Node := Arg1;
while Arg_Node /= Empty loop
Arg_Count := Arg_Count + 1;
if Expression (Arg_Node) = Error then
return Error;
end if;
Next (Arg_Node);
end loop;
end if;
-- Remaining processing is pragma dependent
case Get_Pragma_Id (Pragma_Name) is
------------
-- Ada_83 --
------------
-- This pragma must be processed at parse time, since we want to set
-- the Ada 83 and Ada 95 switches properly at parse time to recognize
-- Ada 83 syntax or Ada 95 syntax as appropriate.
when Pragma_Ada_83 =>
Ada_83 := True;
Ada_95 := False;
------------
-- Ada_95 --
------------
-- This pragma must be processed at parse time, since we want to set
-- the Ada 83 and Ada_95 switches properly at parse time to recognize
-- Ada 83 syntax or Ada 95 syntax as appropriate.
when Pragma_Ada_95 =>
Ada_83 := False;
Ada_95 := True;
-----------
-- Debug --
-----------
-- pragma Debug (PROCEDURE_CALL_STATEMENT);
-- This has to be processed by the parser because of the very peculiar
-- form of the second parameter, which is syntactically from a formal
-- point of view a function call (since it must be an expression), but
-- semantically we treat it as a procedure call (which has exactly the
-- same syntactic form, so that's why we can get away with this!)
when Pragma_Debug =>
Check_Arg_Count (1);
Check_No_Identifier (Arg1);
declare
Expr : constant Node_Id := New_Copy (Expression (Arg1));
begin
if Nkind (Expr) /= N_Indexed_Component
and then Nkind (Expr) /= N_Function_Call
and then Nkind (Expr) /= N_Identifier
and then Nkind (Expr) /= N_Selected_Component
then
Error_Msg
("argument of pragma% is not procedure call", Sloc (Expr));
raise Error_Resync;
else
Set_Debug_Statement
(Pragma_Node, P_Statement_Name (Expr));
end if;
end;
-------------------------------
-- Extensions_Allowed (GNAT) --
-------------------------------
-- pragma Extensions_Allowed (Off | On)
-- The processing for pragma Extensions_Allowed must be done at
-- parse time, since extensions mode may affect what is accepted.
when Pragma_Extensions_Allowed =>
Check_Arg_Count (1);
Check_No_Identifier (Arg1);
Check_Arg_Is_On_Or_Off (Arg1);
Opt.Extensions_Allowed := (Chars (Expression (Arg1)) = Name_On);
----------------
-- List (2.8) --
----------------
-- pragma List (Off | On)
-- The processing for pragma List must be done at parse time,
-- since a listing can be generated in parse only mode.
when Pragma_List =>
Check_Arg_Count (1);
Check_No_Identifier (Arg1);
Check_Arg_Is_On_Or_Off (Arg1);
-- We unconditionally make a List_On entry for the pragma, so that
-- in the List (Off) case, the pragma will print even in a region
-- of code with listing turned off (this is required!)
List_Pragmas.Increment_Last;
List_Pragmas.Table (List_Pragmas.Last) :=
(Ptyp => List_On, Ploc => Sloc (Pragma_Node));
-- Now generate the list off entry for pragma List (Off)
if Chars (Expression (Arg1)) = Name_Off then
List_Pragmas.Increment_Last;
List_Pragmas.Table (List_Pragmas.Last) :=
(Ptyp => List_Off, Ploc => Semi);
end if;
----------------
-- Page (2.8) --
----------------
-- pragma Page;
-- Processing for this pragma must be done at parse time, since a
-- listing can be generated in parse only mode with semantics off.
when Pragma_Page =>
Check_Arg_Count (0);
List_Pragmas.Increment_Last;
List_Pragmas.Table (List_Pragmas.Last) := (Page, Semi);
-----------------------------
-- Source_File_Name (GNAT) --
-----------------------------
-- There are five forms of this pragma:
-- pragma Source_File_Name (
-- [UNIT_NAME =>] unit_NAME,
-- BODY_FILE_NAME => STRING_LITERAL);
-- pragma Source_File_Name (
-- [UNIT_NAME =>] unit_NAME,
-- SPEC_FILE_NAME => STRING_LITERAL);
-- pragma Source_File_Name (
-- BODY_FILE_NAME => STRING_LITERAL
-- [, DOT_REPLACEMENT => STRING_LITERAL]
-- [, CASING => CASING_SPEC]);
-- pragma Source_File_Name (
-- SPEC_FILE_NAME => STRING_LITERAL
-- [, DOT_REPLACEMENT => STRING_LITERAL]
-- [, CASING => CASING_SPEC]);
-- pragma Source_File_Name (
-- SUBUNIT_FILE_NAME => STRING_LITERAL
-- [, DOT_REPLACEMENT => STRING_LITERAL]
-- [, CASING => CASING_SPEC]);
-- CASING_SPEC ::= Uppercase | Lowercase | Mixedcase
-- Note: we process this during parsing, since we need to have the
-- source file names set well before the semantic analysis starts,
-- since we load the spec and with'ed packages before analysis.
when Pragma_Source_File_Name => Source_File_Name : declare
Unam : Unit_Name_Type;
Expr1 : Node_Id;
Pat : String_Ptr;
Typ : Character;
Dot : String_Ptr;
Cas : Casing_Type;
Nast : Nat;
function Get_Fname (Arg : Node_Id) return Name_Id;
-- Process file name from unit name form of pragma
function Get_String_Argument (Arg : Node_Id) return String_Ptr;
-- Process string literal value from argument
procedure Process_Casing (Arg : Node_Id);
-- Process Casing argument of pattern form of pragma
procedure Process_Dot_Replacement (Arg : Node_Id);
-- Process Dot_Replacement argument of patterm form of pragma
---------------
-- Get_Fname --
---------------
function Get_Fname (Arg : Node_Id) return Name_Id is
begin
String_To_Name_Buffer (Strval (Expression (Arg)));
for J in 1 .. Name_Len loop
if Is_Directory_Separator (Name_Buffer (J)) then
Error_Msg
("directory separator character not allowed",
Sloc (Expression (Arg)) + Source_Ptr (J));
end if;
end loop;
return Name_Find;
end Get_Fname;
-------------------------
-- Get_String_Argument --
-------------------------
function Get_String_Argument (Arg : Node_Id) return String_Ptr is
Str : String_Id;
begin
if Nkind (Expression (Arg)) /= N_String_Literal
and then
Nkind (Expression (Arg)) /= N_Operator_Symbol
then
Error_Msg_N
("argument for pragma% must be string literal", Arg);
raise Error_Resync;
end if;
Str := Strval (Expression (Arg));
-- Check string has no wide chars
for J in 1 .. String_Length (Str) loop
if Get_String_Char (Str, J) > 255 then
Error_Msg
("wide character not allowed in pattern for pragma%",
Sloc (Expression (Arg2)) + Text_Ptr (J) - 1);
end if;
end loop;
-- Acquire string
String_To_Name_Buffer (Str);
return new String'(Name_Buffer (1 .. Name_Len));
end Get_String_Argument;
--------------------
-- Process_Casing --
--------------------
procedure Process_Casing (Arg : Node_Id) is
Expr : constant Node_Id := Expression (Arg);
begin
Check_Required_Identifier (Arg, Name_Casing);
if Nkind (Expr) = N_Identifier then
if Chars (Expr) = Name_Lowercase then
Cas := All_Lower_Case;
return;
elsif Chars (Expr) = Name_Uppercase then
Cas := All_Upper_Case;
return;
elsif Chars (Expr) = Name_Mixedcase then
Cas := Mixed_Case;
return;
end if;
end if;
Error_Msg_N
("Casing argument for pragma% must be " &
"one of Mixedcase, Lowercase, Uppercase",
Arg);
end Process_Casing;
-----------------------------
-- Process_Dot_Replacement --
-----------------------------
procedure Process_Dot_Replacement (Arg : Node_Id) is
begin
Check_Required_Identifier (Arg, Name_Dot_Replacement);
Dot := Get_String_Argument (Arg);
end Process_Dot_Replacement;
-- Start of processing for Source_File_Name pragma
begin
-- We permit from 1 to 3 arguments
if Arg_Count not in 1 .. 3 then
Check_Arg_Count (1);
end if;
Expr1 := Expression (Arg1);
-- If first argument is identifier or selected component, then
-- we have the specific file case of the Source_File_Name pragma,
-- and the first argument is a unit name.
if Nkind (Expr1) = N_Identifier
or else
(Nkind (Expr1) = N_Selected_Component
and then
Nkind (Selector_Name (Expr1)) = N_Identifier)
then
Check_Arg_Count (2);
Check_Optional_Identifier (Arg1, Name_Unit_Name);
Unam := Get_Unit_Name (Expr1);
Check_Arg_Is_String_Literal (Arg2);
if Chars (Arg2) = Name_Spec_File_Name then
Set_File_Name (Get_Spec_Name (Unam), Get_Fname (Arg2));
elsif Chars (Arg2) = Name_Body_File_Name then
Set_File_Name (Unam, Get_Fname (Arg2));
else
Error_Msg_N ("pragma% argument has incorrect identifier", Arg2);
return Pragma_Node;
end if;
-- If the first argument is not an identifier, then we must have
-- the pattern form of the pragma, and the first argument must be
-- the pattern string with an appropriate name.
else
if Chars (Arg1) = Name_Spec_File_Name then
Typ := 's';
elsif Chars (Arg1) = Name_Body_File_Name then
Typ := 'b';
elsif Chars (Arg1) = Name_Subunit_File_Name then
Typ := 'u';
elsif Chars (Arg1) = Name_Unit_Name then
Error_Msg_N
("Unit_Name parameter for pragma% must be an identifier",
Arg1);
raise Error_Resync;
else
Error_Msg_N ("pragma% argument has incorrect identifier", Arg1);
raise Error_Resync;
end if;
Pat := Get_String_Argument (Arg1);
-- Check pattern has exactly one asterisk
Nast := 0;
for J in Pat'Range loop
if Pat (J) = '*' then
Nast := Nast + 1;
end if;
end loop;
if Nast /= 1 then
Error_Msg_N
("file name pattern must have exactly one * character",
Arg2);
return Pragma_Node;
end if;
-- Set defaults for Casing and Dot_Separator parameters
Cas := All_Lower_Case;
Dot := new String'(".");
-- Process second and third arguments if present
if Arg_Count > 1 then
if Chars (Arg2) = Name_Casing then
Process_Casing (Arg2);
if Arg_Count = 3 then
Process_Dot_Replacement (Arg3);
end if;
else
Process_Dot_Replacement (Arg2);
if Arg_Count = 3 then
Process_Casing (Arg3);
end if;
end if;
end if;
Set_File_Name_Pattern (Pat, Typ, Dot, Cas);
end if;
end Source_File_Name;
-----------------------------
-- Source_Reference (GNAT) --
-----------------------------
-- pragma Source_Reference
-- (INTEGER_LITERAL [, STRING_LITERAL] );
-- Processing for this pragma must be done at parse time, since error
-- messages needing the proper line numbers can be generated in parse
-- only mode with semantic checking turned off, and indeed we usually
-- turn off semantic checking anyway if any parse errors are found.
when Pragma_Source_Reference => Source_Reference : declare
Fname : Name_Id;
begin
if Arg_Count /= 1 then
Check_Arg_Count (2);
Check_No_Identifier (Arg2);
end if;
-- Check that this is first line of file. We skip this test if
-- we are in syntax check only mode, since we may be dealing with
-- multiple compilation units.
if Get_Physical_Line_Number (Pragma_Sloc) /= 1
and then Num_SRef_Pragmas (Current_Source_File) = 0
and then Operating_Mode /= Check_Syntax
then
Error_Msg
("first % pragma must be first line of file", Pragma_Sloc);
raise Error_Resync;
end if;
Check_No_Identifier (Arg1);
if Arg_Count = 1 then
if Num_SRef_Pragmas (Current_Source_File) = 0 then
Error_Msg
("file name required for first % pragma in file",
Pragma_Sloc);
raise Error_Resync;
else
Fname := No_Name;
end if;
-- File name present
else
Check_Arg_Is_String_Literal (Arg2);
String_To_Name_Buffer (Strval (Expression (Arg2)));
Fname := Name_Find;
if Num_SRef_Pragmas (Current_Source_File) > 0 then
if Fname /= Full_Ref_Name (Current_Source_File) then
Error_Msg
("file name must be same in all % pragmas", Pragma_Sloc);
raise Error_Resync;
end if;
end if;
end if;
if Nkind (Expression (Arg1)) /= N_Integer_Literal then
Error_Msg
("argument for pragma% must be integer literal",
Sloc (Expression (Arg1)));
raise Error_Resync;
-- OK, this source reference pragma is effective, however, we
-- ignore it if it is not in the first unit in the multiple unit
-- case. This is because the only purpose in this case is to
-- provide source pragmas for subsequent use by gnatchop.
else
if Num_Library_Units = 1 then
Register_Source_Ref_Pragma
(Fname,
Strip_Directory (Fname),
UI_To_Int (Intval (Expression (Arg1))),
Get_Physical_Line_Number (Pragma_Sloc) + 1);
end if;
end if;
end Source_Reference;
-------------------------
-- Style_Checks (GNAT) --
-------------------------
-- pragma Style_Checks (On | Off | ALL_CHECKS | STRING_LITERAL);
-- This is processed by the parser since some of the style
-- checks take place during source scanning and parsing.
when Pragma_Style_Checks => Style_Checks : declare
A : Node_Id;
S : String_Id;
C : Char_Code;
OK : Boolean := True;
begin
-- Two argument case is only for semantics
if Arg_Count = 2 then
null;
else
Check_Arg_Count (1);
Check_No_Identifier (Arg1);
A := Expression (Arg1);
if Nkind (A) = N_String_Literal then
S := Strval (A);
declare
Slen : Natural := Natural (String_Length (S));
Options : String (1 .. Slen);
J : Natural;
Ptr : Natural;
begin
J := 1;
loop
C := Get_String_Char (S, Int (J));
if not In_Character_Range (C) then
OK := False;
Ptr := J;
exit;
else
Options (J) := Get_Character (C);
end if;
if J = Slen then
Set_Style_Check_Options (Options, OK, Ptr);
exit;
else
J := J + 1;
end if;
end loop;
if not OK then
Error_Msg
("invalid style check option",
Sloc (Expression (Arg1)) + Source_Ptr (Ptr));
raise Error_Resync;
end if;
end;
elsif Nkind (A) /= N_Identifier then
OK := False;
elsif Chars (A) = Name_All_Checks then
Stylesw.Set_Default_Style_Check_Options;
elsif Chars (A) = Name_On then
Style_Check := True;
elsif Chars (A) = Name_Off then
Style_Check := False;
else
OK := False;
end if;
if not OK then
Error_Msg ("incorrect argument for pragma%", Sloc (A));
raise Error_Resync;
end if;
end if;
end Style_Checks;
---------------------
-- Warnings (GNAT) --
---------------------
-- pragma Warnings (On | Off, [LOCAL_NAME])
-- The one argument case is processed by the parser, since it may
-- control parser warnings as well as semantic warnings, and in any
-- case we want to be absolutely sure that the range in the warnings
-- table is set well before any semantic analysis is performed.
when Pragma_Warnings =>
if Arg_Count = 1 then
Check_No_Identifier (Arg1);
Check_Arg_Is_On_Or_Off (Arg1);
if Chars (Expression (Arg1)) = Name_On then
Set_Warnings_Mode_On (Pragma_Sloc);
else
Set_Warnings_Mode_Off (Pragma_Sloc);
end if;
end if;
-----------------------
-- All Other Pragmas --
-----------------------
-- For all other pragmas, checking and processing is handled
-- entirely in Sem_Prag, and no further checking is done by Par.
when Pragma_Abort_Defer |
Pragma_AST_Entry |
Pragma_All_Calls_Remote |
Pragma_Annotate |
Pragma_Assert |
Pragma_Asynchronous |
Pragma_Atomic |
Pragma_Atomic_Components |
Pragma_Attach_Handler |
Pragma_CPP_Class |
Pragma_CPP_Constructor |
Pragma_CPP_Virtual |
Pragma_CPP_Vtable |
Pragma_C_Pass_By_Copy |
Pragma_Comment |
Pragma_Common_Object |
Pragma_Complex_Representation |
Pragma_Component_Alignment |
Pragma_Controlled |
Pragma_Convention |
Pragma_Discard_Names |
Pragma_Eliminate |
Pragma_Elaborate |
Pragma_Elaborate_All |
Pragma_Elaborate_Body |
Pragma_Elaboration_Checks |
Pragma_Export |
Pragma_Export_Exception |
Pragma_Export_Function |
Pragma_Export_Object |
Pragma_Export_Procedure |
Pragma_Export_Valued_Procedure |
Pragma_Extend_System |
Pragma_External |
Pragma_External_Name_Casing |
Pragma_Finalize_Storage_Only |
Pragma_Float_Representation |
Pragma_Ident |
Pragma_Import |
Pragma_Import_Exception |
Pragma_Import_Function |
Pragma_Import_Object |
Pragma_Import_Procedure |
Pragma_Import_Valued_Procedure |
Pragma_Initialize_Scalars |
Pragma_Inline |
Pragma_Inline_Always |
Pragma_Inline_Generic |
Pragma_Inspection_Point |
Pragma_Interface |
Pragma_Interface_Name |
Pragma_Interrupt_Handler |
Pragma_Interrupt_Priority |
Pragma_Java_Constructor |
Pragma_Java_Interface |
Pragma_License |
Pragma_Link_With |
Pragma_Linker_Alias |
Pragma_Linker_Options |
Pragma_Linker_Section |
Pragma_Locking_Policy |
Pragma_Long_Float |
Pragma_Machine_Attribute |
Pragma_Main |
Pragma_Main_Storage |
Pragma_Memory_Size |
Pragma_No_Return |
Pragma_No_Run_Time |
Pragma_Normalize_Scalars |
Pragma_Optimize |
Pragma_Pack |
Pragma_Passive |
Pragma_Polling |
Pragma_Preelaborate |
Pragma_Priority |
Pragma_Propagate_Exceptions |
Pragma_Psect_Object |
Pragma_Pure |
Pragma_Pure_Function |
Pragma_Queuing_Policy |
Pragma_Remote_Call_Interface |
Pragma_Remote_Types |
Pragma_Restrictions |
Pragma_Restricted_Run_Time |
Pragma_Ravenscar |
Pragma_Reviewable |
Pragma_Share_Generic |
Pragma_Shared |
Pragma_Shared_Passive |
Pragma_Storage_Size |
Pragma_Storage_Unit |
Pragma_Stream_Convert |
Pragma_Subtitle |
Pragma_Suppress |
Pragma_Suppress_All |
Pragma_Suppress_Debug_Info |
Pragma_Suppress_Initialization |
Pragma_System_Name |
Pragma_Task_Dispatching_Policy |
Pragma_Task_Info |
Pragma_Task_Name |
Pragma_Task_Storage |
Pragma_Time_Slice |
Pragma_Title |
Pragma_Unchecked_Union |
Pragma_Unimplemented_Unit |
Pragma_Unreserve_All_Interrupts |
Pragma_Unsuppress |
Pragma_Use_VADS_Size |
Pragma_Volatile |
Pragma_Volatile_Components |
Pragma_Weak_External |
Pragma_Validity_Checks =>
null;
end case;
return Pragma_Node;
--------------------
-- Error Handling --
--------------------
exception
when Error_Resync =>
return Error;
end Prag;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2010, AdaCore --
-- --
-- GNARL 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. GNARL 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 GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, 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. --
-- --
------------------------------------------------------------------------------
with Gdbstub_Io; use Gdbstub_Io;
with Gdbstub.CPU;
with Interfaces; use Interfaces;
package body Gdbstub is
Flag_Debug : constant Boolean := False;
Exit_Stub_Loop : Boolean;
procedure Debug_Put (C : Character);
procedure Debug_Put (Msg : String);
procedure Debug_Newline;
procedure Debug_Put_Line (Msg : String);
-- Output on the debug port.
procedure Put_Line (Msg : String);
pragma Unreferenced (Put_Line);
-- Output on the serial port.
function To_Hex (C : Character) return Unsigned_8;
-- Convert a character to its value.
-- Invalid characters return 16#ff#.
procedure Read_Data (Start : Address;
Len : Storage_Count;
Success : in out Boolean);
-- Append data to the current packet.
procedure Write_Data (Start : Address;
Len : Storage_Count;
Success : in out Boolean);
procedure Handle_Packet;
procedure Handle_Query_Packet;
procedure Handle_Breakpoint_Packet;
procedure Handle_Cont_Packet;
procedure Handle_Step_Packet;
procedure Handle_Mem_Read_Packet;
procedure Handle_Mem_Write_Packet;
procedure Handle_Mem_Write_Binary_Packet;
procedure Handle_All_Regs_Read_Packet;
procedure Handle_All_Regs_Write_Packet;
procedure Handle_Reg_Write_Packet;
-- Handle incoming packet.
procedure Reply_Status;
procedure Reply_Ok;
procedure Reply_Error (Err : Unsigned_8);
-- Create a reply packet.
procedure Append_Hex (V : Unsigned_8; Success : in out Boolean);
-- Append a byte (in hex) to the current packet.
procedure Send_Packet;
-- Send the current packet.
procedure Get_Packet;
function Check_Packet_Checksum return Boolean;
function Get_Packet_Body return Boolean;
procedure Wait_Packet_Start;
-- Packet input procedures.
procedure Check_Hex_Digit (Success : in out Boolean);
-- Check that the next character in the packet is an hex-digit character.
-- Set Success to false in case of error.
procedure Extract_Byte (Res : out Unsigned_8; Success : in out Boolean);
procedure Extract_Address (Res : out Address; Success : in out Boolean);
procedure Extract_Char (C : Character; Success : in out Boolean);
procedure Extract_Len (Res : out Storage_Count; Success : in out Boolean);
-- Extract a field from the current packet. Set success to false in case
-- of error. Update Packet_Idx.
function Is_EOP return Boolean;
procedure Check_EOP (Success : in out Boolean);
-- Check for end of packet.
procedure Debug_Put (C : Character) is
begin
Write_Debug (C);
end Debug_Put;
procedure Debug_Put (Msg : String) is
begin
for I in Msg'Range loop
Debug_Put (Msg (I));
end loop;
end Debug_Put;
procedure Debug_Newline is
begin
Write_Debug (ASCII.CR);
Write_Debug (ASCII.LF);
end Debug_Newline;
procedure Debug_Put_Line (Msg : String) is
begin
Debug_Put (Msg);
Debug_Newline;
end Debug_Put_Line;
procedure Put_Line (Msg : String) is
begin
for I in Msg'Range loop
Write_Byte (Msg (I));
end loop;
Write_Byte (ASCII.CR);
Write_Byte (ASCII.LF);
end Put_Line;
Packet : String (1 .. 1024);
-- Current packet.
Packet_Len : Natural;
-- Length of Packet.
Packet_Idx : Natural;
-- Current index while parsing the packet.
Packet_Checksum : Unsigned_8;
To_Char : constant array (Unsigned_8 range 0 .. 15) of Character :=
"0123456789ABCDEF";
function To_Hex (C : Character) return Unsigned_8 is
begin
case C is
when '0' .. '9' =>
return Character'Pos (C) - Character'Pos ('0');
when 'a' .. 'f' =>
return Character'Pos (C) - Character'Pos ('a') + 10;
when 'A' .. 'F' =>
return Character'Pos (C) - Character'Pos ('a') + 10;
when others =>
return 255;
end case;
end To_Hex;
procedure Wait_Packet_Start is
C : Character;
begin
-- Wait for the start character.
loop
C := Read_Byte;
exit when C = '$';
end loop;
end Wait_Packet_Start;
function Get_Packet_Body return Boolean is
C : Character;
begin
loop
Packet_Len := 0;
Packet_Checksum := 0;
loop
if Packet_Len = Packet'Last then
if Flag_Debug then
Debug_Put_Line ("Packet too long");
return False;
end if;
end if;
C := Read_Byte;
exit when C = '$';
if C = '#' then
return True;
end if;
Packet_Checksum := Packet_Checksum + Character'Pos (C);
Packet_Len := Packet_Len + 1;
Packet (Packet_Len) := C;
end loop;
if Flag_Debug then
Debug_Put_Line ("start in the middle");
end if;
end loop;
end Get_Packet_Body;
function Check_Packet_Checksum return Boolean is
C : Character;
V : array (1 .. 2) of Unsigned_8;
begin
for I in V'Range loop
C := Read_Byte;
V (I) := To_Hex (C);
if V (I) > 15 then
return False;
end if;
end loop;
return V (1) * 16 + V (2) = Packet_Checksum;
end Check_Packet_Checksum;
procedure Get_Packet is
-- Wait for the sequence $<data>#<checksum>
begin
loop
Wait_Packet_Start;
if Get_Packet_Body then
if not Check_Packet_Checksum then
-- NAK
Write_Byte ('-');
Debug_Put_Line ("Bad checksum");
else
-- ACK
Write_Byte ('+');
return;
end if;
end if;
end loop;
end Get_Packet;
Last_Signal : Unsigned_8;
procedure Append_Hex (V : Unsigned_8; Success : in out Boolean) is
begin
if not Success then
return;
end if;
if Packet_Len + 2 > Packet'Last then
Success := False;
return;
end if;
Packet (Packet_Len + 1) := To_Char (V / 16);
Packet (Packet_Len + 2) := To_Char (V mod 16);
Packet_Len := Packet_Len + 2;
end Append_Hex;
procedure Reply_Status is
Succ : Boolean := True;
begin
Packet (1) := 'S';
Packet_Len := 1;
Append_Hex (Last_Signal, Succ);
pragma Assert (Succ);
end Reply_Status;
procedure Reply_Error (Err : Unsigned_8) is
Succ : Boolean := True;
begin
Packet (1) := 'E';
Packet_Len := 1;
Append_Hex (Err, Succ);
pragma Assert (Succ);
end Reply_Error;
procedure Reply_Ok is
begin
Packet (1) := 'O';
Packet (2) := 'K';
Packet_Len := 2;
end Reply_Ok;
procedure Read_Data (Start : Address;
Len : Storage_Count;
Success : in out Boolean) is
begin
for Off in 0 .. Len - 1 loop
exit when not Success;
declare
B : Unsigned_8;
for B'Address use Start + Off;
begin
Append_Hex (B, Success);
end;
end loop;
end Read_Data;
procedure Write_Data (Start : Address;
Len : Storage_Count;
Success : in out Boolean) is
begin
for Off in 0 .. Len - 1 loop
exit when not Success;
declare
B : Unsigned_8;
for B'Address use Start + Off;
begin
Extract_Byte (B, Success);
end;
end loop;
end Write_Data;
-- Handle 'q' packets.
procedure Handle_Query_Packet is
begin
if Flag_Debug then
Debug_Put ("query packet: ");
Debug_Put_Line (Packet (1 .. Packet_Len));
end if;
if Packet_Len >= 10 and then Packet (1 .. 10) = "qSupported" then
-- No extra features supported.
Packet_Len := 0;
elsif Packet_Len = 2 and then Packet (1 .. 2) = "qC" then
-- Current thread.
Packet (3) := '0';
Packet_Len := 3;
elsif Packet_Len = 9 and then Packet (1 .. 9) = "qSymbol::" then
-- We don't query symbols.
Reply_Ok;
else
-- Ignored.
Debug_Put ("ignored query packet: ");
Debug_Put_Line (Packet (1 .. Packet_Len));
Packet_Len := 0;
end if;
end Handle_Query_Packet;
-- Handle 'z'/'Z' packets.
procedure Handle_Breakpoint_Packet is
begin
if Flag_Debug then
Debug_Put ("breakpoint packet: ");
Debug_Put_Line (Packet (1 .. Packet_Len));
end if;
if True then
-- Ignored.
Debug_Put ("ignored break packet: ");
Debug_Put_Line (Packet (1 .. Packet_Len));
Packet_Len := 0;
end if;
end Handle_Breakpoint_Packet;
procedure Check_Hex_Digit (Success : in out Boolean) is
begin
if not Success then
return;
end if;
if Packet_Idx > Packet_Len then
Success := False;
return;
end if;
if To_Hex (Packet (Packet_Idx)) > 15 then
Success := False;
return;
end if;
end Check_Hex_Digit;
procedure Extract_Byte (Res : out Unsigned_8; Success : in out Boolean) is
Vh, Vl : Unsigned_8;
begin
Res := 0;
if not Success then
return;
end if;
if Packet_Idx + 1 > Packet_Len then
Success := False;
return;
end if;
Vh := To_Hex (Packet (Packet_Idx + 0));
Vl := To_Hex (Packet (Packet_Idx + 1));
Packet_Idx := Packet_Idx + 2;
if Vh > 15 or else Vl > 15 then
Success := False;
return;
end if;
Res := Vh * 16 + Vl;
end Extract_Byte;
procedure Extract_Address (Res : out Address; Success : in out Boolean) is
V : Unsigned_8;
Resint : Integer_Address;
begin
Check_Hex_Digit (Success);
if not Success then
return;
end if;
V := To_Hex (Packet (Packet_Idx));
Resint := 0;
loop
Resint := Resint * 16 + Integer_Address (V);
Packet_Idx := Packet_Idx + 1;
exit when Packet_Idx > Packet_Len;
V := To_Hex (Packet (Packet_Idx));
exit when V > 15;
end loop;
Res := To_Address (Resint);
end Extract_Address;
procedure Extract_Char (C : Character; Success : in out Boolean) is
begin
if not Success then
return;
end if;
if Packet_Idx > Packet_Len then
Success := False;
return;
end if;
if Packet (Packet_Idx) /= C then
Success := False;
return;
end if;
Packet_Idx := Packet_Idx + 1;
end Extract_Char;
procedure Extract_Len (Res : out Storage_Count; Success : in out Boolean) is
V : Unsigned_8;
Resint : Storage_Count;
begin
Check_Hex_Digit (Success);
if not Success then
Res := 0;
return;
end if;
V := To_Hex (Packet (Packet_Idx));
Resint := 0;
loop
Resint := Resint * 16 + Storage_Count (V);
Packet_Idx := Packet_Idx + 1;
exit when Packet_Idx > Packet_Len;
V := To_Hex (Packet (Packet_Idx));
exit when V > 15;
end loop;
Res := Resint;
end Extract_Len;
function Is_EOP return Boolean is
begin
return Packet_Idx = Packet_Len + 1;
end Is_EOP;
procedure Check_EOP (Success : in out Boolean) is
begin
if not Is_EOP then
Success := False;
end if;
end Check_EOP;
procedure Handle_Mem_Read_Packet is
Addr : Address;
Len : Storage_Count;
Success : Boolean;
begin
Packet_Idx := 2;
Success := True;
Extract_Address (Addr, Success);
Extract_Char (',', Success);
Extract_Len (Len, Success);
Check_EOP (Success);
if not Success then
Reply_Error (1);
return;
end if;
Packet_Len := 0;
Read_Data (Addr, Len, Success);
if not Success then
Reply_Error (2);
end if;
end Handle_Mem_Read_Packet;
procedure Handle_Mem_Write_Packet is
Addr : Address;
Len : Storage_Count;
Success : Boolean;
begin
Packet_Idx := 2;
Success := True;
Extract_Address (Addr, Success);
Extract_Char (',', Success);
Extract_Len (Len, Success);
Extract_Char (':', Success);
if not Success then
Reply_Error (1);
return;
end if;
Write_Data (Addr, Len, Success);
if Success then
CPU.Invalidate_Icache (Addr, Len);
Reply_Ok;
else
Reply_Error (1);
end if;
end Handle_Mem_Write_Packet;
procedure Handle_Mem_Write_Binary_Packet is
Addr : Address;
Len : Storage_Count;
Success : Boolean;
B : Unsigned_8;
begin
Packet_Idx := 2;
Success := True;
Extract_Address (Addr, Success);
Extract_Char (',', Success);
Extract_Len (Len, Success);
Extract_Char (':', Success);
if not Success then
Reply_Error (1);
return;
end if;
for I in 0 .. Len - 1 loop
if Packet_Idx > Packet_Len then
Success := False;
exit;
end if;
B := Character'Pos (Packet (Packet_Idx));
Packet_Idx := Packet_Idx + 1;
if B = 16#7d# then
-- Escape character.
if Packet_Idx > Packet_Len then
Success := False;
exit;
end if;
B := Character'Pos (Packet (Packet_Idx)) xor 16#20#;
Packet_Idx := Packet_Idx + 1;
end if;
declare
M : Unsigned_8;
for M'Address use Addr + I;
begin
M := B;
end;
end loop;
Check_EOP (Success);
if Success then
CPU.Invalidate_Icache (Addr, Len);
Reply_Ok;
else
Reply_Error (1);
end if;
end Handle_Mem_Write_Binary_Packet;
procedure Handle_All_Regs_Write_Packet is
Success : Boolean;
begin
Packet_Idx := 2;
Success := True;
Write_Data (Registers_Area, Registers_Size, Success);
if not Success then
Reply_Error (2);
elsif not Is_EOP then
Reply_Error (1);
else
Reply_Ok;
end if;
end Handle_All_Regs_Write_Packet;
procedure Handle_All_Regs_Read_Packet is
Success : Boolean;
begin
Packet_Len := 0;
Success := True;
Read_Data (Registers_Area, Registers_Size, Success);
if not Success then
Reply_Error (2);
end if;
end Handle_All_Regs_Read_Packet;
procedure Handle_Reg_Write_Packet is
Success : Boolean;
Len : Storage_Count;
Addr : Address;
Size : Storage_Count;
begin
Packet_Idx := 2;
Success := True;
Extract_Len (Len, Success);
Extract_Char ('=', Success);
if not Success
or else Len > Natural'Pos (Natural'Last)
then
Reply_Error (1);
return;
end if;
CPU.Get_Register_Area (Natural (Len), Addr, Size);
if Size = 0 then
Reply_Error (1);
return;
end if;
Write_Data (Addr, Size, Success);
if not Success then
Reply_Error (2);
elsif not Is_EOP then
Reply_Error (1);
else
Reply_Ok;
end if;
end Handle_Reg_Write_Packet;
procedure Handle_Cont_Packet is
begin
Packet_Idx := 2;
if Is_EOP then
CPU.Set_Trace_Flag (False);
Exit_Stub_Loop := True;
else
Reply_Error (1);
end if;
end Handle_Cont_Packet;
procedure Handle_Step_Packet is
begin
Packet_Idx := 2;
if Is_EOP then
CPU.Set_Trace_Flag (True);
Exit_Stub_Loop := True;
else
Reply_Error (1);
end if;
end Handle_Step_Packet;
procedure Handle_Packet is
begin
if Flag_Debug then
Debug_Put ("packet: ");
Debug_Put (Packet (1));
Debug_Newline;
end if;
case Packet (1) is
when '?' =>
-- Reason
Reply_Status;
when 'c' =>
Handle_Cont_Packet;
when 'g' =>
-- Get registers.
Handle_All_Regs_Read_Packet;
when 'G' =>
-- Write registers
Handle_All_Regs_Write_Packet;
when 'H' =>
-- Thread selection packet.
-- Ignore it.
Packet_Len := 0;
when 'k' =>
Packet_Len := 0;
Kill;
when 'm' =>
-- Memory read.
Handle_Mem_Read_Packet;
when 'M' =>
-- Memory write.
Handle_Mem_Write_Packet;
when 'P' =>
Handle_Reg_Write_Packet;
when 'q' =>
-- Query packet.
Handle_Query_Packet;
when 's' =>
Handle_Step_Packet;
when 'X' =>
-- Memory write in binary.
Handle_Mem_Write_Binary_Packet;
when 'z' | 'Z' =>
Handle_Breakpoint_Packet;
when others =>
-- Ignore other commands.
Debug_Put ("ignored packet: ");
Debug_Put (Packet (1));
Debug_Newline;
Packet_Len := 0;
end case;
end Handle_Packet;
procedure Send_Packet is
Checksum : Unsigned_8;
begin
Write_Byte ('$');
Checksum := 0;
for I in 1 .. Packet_Len loop
Checksum := Checksum + Character'Pos (Packet (I));
Write_Byte (Packet (I));
end loop;
Write_Byte ('#');
Write_Byte (To_Char (Checksum / 16));
Write_Byte (To_Char (Checksum mod 16));
end Send_Packet;
procedure Handle_Exception (Sig : Natural) is
begin
-- Send status.
Last_Signal := Unsigned_8 (Sig);
Reply_Status;
Send_Packet;
Exit_Stub_Loop := False;
loop
Get_Packet;
if Packet_Len /= 0 then
Handle_Packet;
exit when Exit_Stub_Loop;
Send_Packet;
end if;
end loop;
end Handle_Exception;
procedure Stub is
begin
Gdbstub_Io.Initialize;
-- Put_Line ("AdaCore GdbStub");
Debug_Put_Line ("AdaCore GdbStub - Debug port");
CPU.Setup_Handlers;
CPU.Breakpoint;
end Stub;
end Gdbstub;
|
with Interfaces; use Interfaces;
with Interfaces.C; use Interfaces.C;
generic
type Element is mod <>;
-- ELement type, must be mod 2**8, i.e. represent a byte
type Index is range <>;
-- Index type
type Element_Array is array (Index range <>) of aliased Element;
-- An array of aliased Elements
package System_Random with
Preelaborate
is
-- @summary
-- Ada interface to system sources of randomness
--
-- @description
-- This package provides generic interface to OS' sources of randomeness.
-- On Windows, BCryptGenRandom() is used, on other platforms such as Linux,
-- BSD, Mac OS portable getentropy() is used.
--
-- This is a generic package as it is intended to be used with user-defined
-- byte array type, that would later be converted to a seed value used to
-- seed an appropriate strong PRNG algorithm.
pragma Compile_Time_Error
(Element'Modulus /= 2**8,
"'Element' type must be mod 2**8, i.e. represent a byte");
System_Random_Error : exception;
-- Raised whenever an underlying system function has failed
procedure Random (Output : aliased out Element_Array) with
Pre => Output'Length <= Interfaces.Unsigned_32'Last and
Output'Length <= Interfaces.C.size_t'Last;
-- Fill Output with random data. This function call blocks, thus it's
-- better to call it as few times as possible.
--
-- Maximum length of Output array is determined by the underlying system
-- implementation, and for unix is equal to 256 bytes.
end System_Random;
|
------------------------------------------------------------------------------
-- --
-- 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$
------------------------------------------------------------------------------
with AMF.Elements.Collections;
package body AMF.Visitors.Containment is
-----------
-- Visit --
-----------
procedure Visit
(Self : in out Containment_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Extent : not null access AMF.Extents.Extent'Class)
is
use type AMF.Elements.Element_Access;
Elements : constant AMF.Elements.Collections.Set_Of_Element
:= Extent.Elements;
Control : Traverse_Control := Continue;
begin
for J in 1 .. Elements.Length loop
if Elements.Element (J).Container = null then
Self.Visit (Visitor, Elements.Element (J), Control);
case Control is
when Continue =>
null;
when Abandon_Children =>
Control := Continue;
when Abandon_Sibling =>
Control := Continue;
exit;
when Terminate_Immediately =>
exit;
end case;
end if;
end loop;
end Visit;
end AMF.Visitors.Containment;
|
--
-- 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.
--
--
#if CONFIG_KERNEL_DOMAIN
with ewok.tasks;
#end if;
package body ewok.perm
with spark_mode => on
is
function dmashm_is_granted
(from : in t_real_task_id;
to : in t_real_task_id)
return boolean
is
begin
return ewok.perm_auto.com_dmashm_perm (from, to);
end dmashm_is_granted;
function ipc_is_granted
(from : in t_real_task_id;
to : in t_real_task_id)
return boolean
is
begin
return ewok.perm_auto.com_ipc_perm (from, to);
end ipc_is_granted;
#if CONFIG_KERNEL_DOMAIN
function is_same_domain
(from : in t_real_task_id;
to : in t_real_task_id)
return boolean
with
spark_mode => off -- implies tasks.get_domain() to be SPARK compatible
is
begin
return
ewok.tasks.get_domain (from) = ewok.tasks.get_domain (to);
end is_same_domain;
#end if;
function ressource_is_granted
(perm_name : in t_perm_name;
task_id : in applications.t_real_task_id)
return boolean
is
begin
-- is there some assertion checking that some ressources tuples are
-- forbidden
case perm_name is
when PERM_RES_DEV_DMA =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_DMA = 1;
when PERM_RES_DEV_CRYPTO_USR =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_CRYPTO = 1 or
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_CRYPTO = 3;
when PERM_RES_DEV_CRYPTO_CFG =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_CRYPTO = 2 or
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_CRYPTO = 3;
when PERM_RES_DEV_CRYPTO_FULL =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_CRYPTO = 3;
when PERM_RES_DEV_BUSES =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_BUS = 1;
when PERM_RES_DEV_EXTI =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_EXTI = 1;
when PERM_RES_DEV_TIM =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).DEV_TIM = 1;
when PERM_RES_TIM_GETMILLI =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TIM_TIME > 0;
when PERM_RES_TIM_GETMICRO =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TIM_TIME > 1;
when PERM_RES_TIM_GETCYCLE =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TIM_TIME > 2;
when PERM_RES_TSK_FISR =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TSK_FISR = 1;
when PERM_RES_TSK_FIPC =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TSK_FIPC = 1;
when PERM_RES_TSK_RESET =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TSK_RESET = 1;
when PERM_RES_TSK_UPGRADE =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TSK_UPGRADE = 1;
when PERM_RES_TSK_RNG =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).TSK_RNG = 1;
when PERM_RES_MEM_DYNAMIC_MAP =>
return
ewok.perm_auto.ressource_perm_register_tab(task_id).MEM_DYNAMIC_MAP = 1;
end case;
end ressource_is_granted;
end ewok.perm;
|
with Tarmi.Environments; use Tarmi.Environments;
package Tarmi.Evaluation is
function Eval (Form : Datum; Env : Environment) return Datum ;
end Tarmi.Evaluation;
|
-----------------------------------------------------------------------
-- awa-users-module -- User management module
-- Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2020 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 ASF.Applications;
with AWA.Modules;
with AWA.Users.Services;
with AWA.Users.Filters;
with AWA.Users.Servlets;
-- == Integration ==
-- The `User_Module` manages the creation, update, removal of users
-- in an application. It provides operations that are used by the user
-- beans or other services to create and update wiki pages.
-- An instance of the `User_Module` must be declared and registered in the
-- AWA application. The module instance can be defined as follows:
--
-- type Application is new AWA.Applications.Application with record
-- User_Module : aliased AWA.Users.Modules.User_Module;
-- end record;
--
-- And registered in the `Initialize_Modules` procedure by using:
--
-- Register (App => App.Self.all'Access,
-- Name => AWA.Users.Modules.NAME,
-- Module => App.User_Module'Access);
--
package AWA.Users.Modules is
NAME : constant String := "users";
type User_Module is new AWA.Modules.Module with private;
type User_Module_Access is access all User_Module'Class;
-- Initialize the user module.
overriding
procedure Initialize (Plugin : in out User_Module;
App : in AWA.Modules.Application_Access;
Props : in ASF.Applications.Config);
-- Configures the module after its initialization and after having read
-- its XML configuration.
overriding
procedure Configure (Plugin : in out User_Module;
Props : in ASF.Applications.Config);
-- Get the user manager.
function Get_User_Manager (Plugin : in User_Module) return Services.User_Service_Access;
-- Create a user manager. This operation can be overriden to provide another
-- user service implementation.
function Create_User_Manager (Plugin : in User_Module) return Services.User_Service_Access;
-- Get the user module instance associated with the current application.
function Get_User_Module return User_Module_Access;
-- Get the user manager instance associated with the current application.
function Get_User_Manager return Services.User_Service_Access;
private
type User_Module is new AWA.Modules.Module with record
Manager : Services.User_Service_Access := null;
Key_Filter : aliased AWA.Users.Filters.Verify_Filter;
Auth_Filter : aliased AWA.Users.Filters.Auth_Filter;
Auth : aliased AWA.Users.Servlets.Request_Auth_Servlet;
Verify_Auth : aliased AWA.Users.Servlets.Verify_Auth_Servlet;
end record;
end AWA.Users.Modules;
|
-- { dg-do run }
-- { dg-options "-gnatws" }
procedure Small_Alignment is
type My_Integer is new Integer;
for My_Integer'Alignment use 1;
function Set_A return My_Integer is
begin
return 12;
end;
function Set_B return My_Integer is
begin
return 6;
end;
C : Character;
A : My_Integer := Set_A;
B : My_Integer := Set_B;
begin
A := A * B / 2;
if A /= 36 then
raise Program_Error;
end if;
end;
|
-------------------------------------------------------------------------------
-- 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.
-------------------------------------------------------------------------------
with Keccak.Util; use Keccak.Util;
package body Keccak.Generic_Parallel_CSHAKE
is
---------------------------
-- Process_Full_Blocks --
---------------------------
procedure Process_Full_Blocks
(Ctx : in out Context;
Block : in out Types.Byte_Array;
Input : in Types.Byte_Array;
Block_Offset : in out Natural)
with Global => null,
Pre => (Block_Offset < Block'Length
and Block'First = 0
and Block'Length = Rate / 8
and State_Of (Ctx) = Updating),
Post => (Block_Offset < Block'Length
and State_Of (Ctx) = Updating);
---------------------------
-- Process_Full_Blocks --
---------------------------
procedure Process_Full_Blocks
(Ctx : in out Context;
Block : in out Types.Byte_Array;
Input : in Types.Byte_Array;
Block_Offset : in out Natural)
is
use type XOF.States;
Block_Length : constant Natural := Block'Length - Block_Offset;
Input_Remaining : Natural := Input'Length;
Input_Offset : Natural := 0;
Length : Natural;
Num_Full_Blocks : Natural;
Pos : Types.Index_Number;
begin
if Block_Offset > 0 then
-- Merge first bytes of Input with the last bytes currently in
-- the block.
if Input_Remaining < Block_Length then
-- Not enough for a full block.
Block (Block_Offset .. Block_Offset + Input_Remaining - 1) :=
Input (Input'First .. Input'First + Input_Remaining - 1);
Input_Offset := Input'Length;
Block_Offset := Block_Offset + Input_Remaining;
Input_Remaining := 0;
else
-- We have enough for a full block
Block (Block_Offset .. Block'Last) :=
Input (Input'First .. Input'First + Block_Length - 1);
XOF.Update_All (Ctx.XOF_Ctx, Block);
Input_Offset := Input_Offset + Block_Length;
Input_Remaining := Input_Remaining - Block_Length;
Block_Offset := 0;
end if;
end if;
pragma Assert_And_Cut
(Input_Offset + Input_Remaining = Input'Length
and Block_Offset < Block'Length
and Block'Length = Rate / 8
and State_Of (Ctx) = Updating
and XOF.State_Of (Ctx.XOF_Ctx) = XOF.Updating
and (if Input_Remaining > 0 then Block_Offset = 0));
-- Now process as many full blocks from Input as we can.
Num_Full_Blocks := Input_Remaining / Block'Length;
if Num_Full_Blocks > 0 then
Pos := Input'First + Input_Offset;
Length := Num_Full_Blocks * Block'Length;
XOF.Update_All (Ctx.XOF_Ctx, Input (Pos .. Pos + Length - 1));
Input_Offset := Input_Offset + Length;
Input_Remaining := Input_Remaining - Length;
end if;
pragma Assert_And_Cut
(Input_Offset + Input_Remaining = Input'Length
and Block_Offset < Block'Length
and Block'Length = Rate / 8
and State_Of (Ctx) = Updating
and (if Input_Remaining > 0 then Block_Offset = 0)
and Input_Remaining < Block'Length);
-- Store any leftover bytes in the block
if Input_Remaining > 0 then
Pos := Input'First + Input_Offset;
Block (0 .. Input_Remaining - 1) := Input (Pos .. Input'Last);
Block_Offset := Input_Remaining;
end if;
end Process_Full_Blocks;
------------
-- Init --
------------
procedure Init (Ctx : out Context;
Customization : in String;
Function_Name : in String)
is
Rate_Bytes : constant Positive := Rate / 8;
Block : Types.Byte_Array (0 .. Rate_Bytes - 1) := (others => 0);
Block_Offset : Natural;
begin
XOF.Init (Ctx.XOF_Ctx);
-- We need to make sure that the data length for each call to
-- XOF.Update_Separate is a multiple of the rate in order to keep the XOF
-- in the "Updating" state. This requires packing the encoded
-- rate, customization string, and function name into a block which is
-- the length of the rate.
--
-- +------+---------------+---------------+
-- | rate | Function_Name | Customization |
-- +------+---------------+---------------+
-- |<-------------->|
-- Rate
Block_Offset := 0;
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => Left_Encode_NIST (Rate_Bytes),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => Left_Encode_NIST_Bit_Length (Function_Name'Length),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => To_Byte_Array (Function_Name),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => Left_Encode_NIST_Bit_Length (Customization'Length),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => To_Byte_Array (Customization),
Block_Offset => Block_Offset);
if Block_Offset > 0 then
-- Need to add padding zeroes to leftover data
Block (Block_Offset .. Block'Last) := (others => 0);
XOF.Update_All (Ctx.XOF_Ctx, Block);
end if;
end Init;
-----------------------
-- Update_Separate --
-----------------------
procedure Update_Separate (Ctx : in out Context;
Data : in Types.Byte_Array)
is
begin
XOF.Update_Separate (Ctx.XOF_Ctx, Data);
end Update_Separate;
-----------------------
-- Extract_Separate --
-----------------------
procedure Extract_Separate (Ctx : in out Context;
Data : out Types.Byte_Array)
is
begin
XOF.Extract_Separate (Ctx.XOF_Ctx, Data);
end Extract_Separate;
end Keccak.Generic_Parallel_CSHAKE;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2014, 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 Interfaces.C;
with System;
with Matreshka.Internals.Utf16;
package Matreshka.Internals.SQL_Drivers.Oracle is
-- Options supported by driver:
Database_Option : constant League.Strings.Universal_String
:= League.Strings.To_Universal_String ("database");
Password_Option : constant League.Strings.Universal_String
:= League.Strings.To_Universal_String ("password");
User_Option : constant League.Strings.Universal_String
:= League.Strings.To_Universal_String ("user");
-- Low level Oracle Call interface binding below this line.
subtype Address is System.Address;
Null_Address : constant Address := System.Null_Address;
subtype Size_T is Interfaces.C.size_t;
subtype Sword is Interfaces.C.int;
subtype Ub4 is Interfaces.Unsigned_32;
subtype Ub2 is Interfaces.Unsigned_16;
subtype Ub1 is Interfaces.Unsigned_8;
subtype Sb1 is Interfaces.Integer_8;
subtype Sb2 is Interfaces.C.short;
subtype Ora_Text is Interfaces.C.char_array;
type Ub4_Ptr is access all Ub4;
type Sb2_Ptr is access all Sb2;
type Error_Code is new Sword;
OCI_SUCCESS : constant Error_Code := 0;
OCI_SUCCESS_WITH_INFO : constant Error_Code := 1;
OCI_NEED_DATA : constant Error_Code := 99;
OCI_NO_DATA : constant Error_Code := 100;
OCI_ERROR : constant Error_Code := -1;
OCI_INVALID_HANDLE : constant Error_Code := -2;
OCI_STILL_EXECUTING : constant Error_Code := -3123;
OCI_CONTINUE : constant Error_Code := -24200;
type Handle_Type is new Ub4;
OCI_HTYPE_ENV : constant Handle_Type := 1;
OCI_HTYPE_ERROR : constant Handle_Type := 2;
OCI_HTYPE_SVCCTX : constant Handle_Type := 3;
OCI_HTYPE_STMT : constant Handle_Type := 4;
OCI_DTYPE_PARAM : constant Handle_Type := 53;
OCI_DTYPE_TIMESTAMP : constant Handle_Type := 68;
OCI_DTYPE_TIMESTAMP_TZ : constant Handle_Type := 69;
OCI_DTYPE_TIMESTAMP_LTZ : constant Handle_Type := 70;
type Data_Type is new Ub2;
SQLT_CHR : constant Data_Type := 1;
SQLT_NUM : constant Data_Type := 2;
SQLT_INT : constant Data_Type := 3;
SQLT_FLT : constant Data_Type := 4;
SQLT_STR : constant Data_Type := 5;
SQLT_VNU : constant Data_Type := 6;
SQLT_VCS : constant Data_Type := 9;
SQLT_DAT : constant Data_Type := 12;
SQLT_BFLOAT : constant Data_Type := 21;
SQLT_BDOUBLE : constant Data_Type := 22;
SQLT_AFC : constant Data_Type := 96;
SQLT_IBFLOAT : constant Data_Type := 100;
SQLT_IBDOUBLE : constant Data_Type := 101;
SQLT_ODT : constant Data_Type := 156;
SQLT_TIMESTAMP : constant Data_Type := 187;
SQLT_TIMESTAMP_TZ : constant Data_Type := 188;
SQLT_INTERVAL_YM : constant Data_Type := 189;
SQLT_INTERVAL_DS : constant Data_Type := 190;
SQLT_TIMESTAMP_LTZ : constant Data_Type := 232;
type Internal is limited private;
type Handle is access all Internal;
pragma Convention (C, Handle);
subtype Environment is Handle;
subtype Error_Handle is Handle;
subtype Parameter is Handle;
subtype Date_Time is Handle;
subtype Service_Handle is Handle;
subtype Statement_Handle is Handle;
type Bind is access all Internal;
pragma Convention (C, Bind);
type Define is access all Internal;
pragma Convention (C, Define);
OCI_ATTR_DATA_SIZE : constant Ub4 := 1;
OCI_ATTR_DATA_TYPE : constant Ub4 := 2;
OCI_ATTR_NAME : constant Ub4 := 4;
OCI_ATTR_PRECISION : constant Ub4 := 5;
OCI_ATTR_SCALE : constant Ub4 := 6;
OCI_ATTR_PARAM_COUNT : constant Ub4 := 18;
OCI_ATTR_STMT_TYPE : constant Ub4 := 24;
OCI_ATTR_CHARSET_ID : constant Ub4 := 31;
OCI_ATTR_PTYPE : constant Ub4 := 123;
OCI_ATTR_CHAR_USED : constant Ub4 := 285;
OCI_ATTR_CHAR_SIZE : constant Ub4 := 286;
type Env_Mode is new Ub4;
OCI_DEFAULT : constant := 16#000#;
OCI_THREADED : constant Env_Mode := 16#001#;
OCI_OBJECT : constant Env_Mode := 16#002#;
OCI_EVENTS : constant Env_Mode := 16#004#;
OCI_SHARED : constant Env_Mode := 16#010#;
OCI_UTF16ID : constant := 1000;
OCI_STMT_UNKNOWN : constant Ub2 := 0; -- Unknown statement
OCI_STMT_SELECT : constant Ub2 := 1; -- select statement
OCI_STMT_UPDATE : constant Ub2 := 2; -- update statement
OCI_STMT_DELETE : constant Ub2 := 3; -- delete statement
OCI_STMT_INSERT : constant Ub2 := 4; -- Insert Statement
OCI_STMT_CREATE : constant Ub2 := 5; -- create statement
OCI_STMT_DROP : constant Ub2 := 6; -- drop statement
OCI_STMT_ALTER : constant Ub2 := 7; -- alter statement
OCI_STMT_BEGIN : constant Ub2 := 8; -- begin ... (pl/sql statement)
OCI_STMT_DECLARE : constant Ub2 := 9; -- declare .. (pl/sql statement)
OCI_STMT_CALL : constant Ub2 := 10; -- corresponds to kpu call
OCI_DATA_AT_EXEC : constant Ub4 := 2; -- data at execute time
function OCIHandleAlloc
(Parent : Environment;
Target : access Handle;
Target_Type : Handle_Type;
Extra_Sz : Size_T := 0;
Extra_Ptr : Address := Null_Address) return Error_Code;
pragma Import (C, OCIHandleAlloc, "OCIHandleAlloc");
function OCIHandleFree
(Target : Handle;
Target_Type : Handle_Type) return Error_Code;
pragma Import (C, OCIHandleFree, "OCIHandleFree");
function OCIDescriptorAlloc
(Parent : Environment;
Target : access Handle;
Target_Type : Handle_Type;
Extra_Sz : Size_T := 0;
Extra_Ptr : Address := Null_Address) return Error_Code;
pragma Import (C, OCIDescriptorAlloc, "OCIDescriptorAlloc");
function OCIAttrGet
(Target : Handle;
Target_Type : Handle_Type;
Buffer : Address;
Length : Ub4_Ptr;
Attr : Ub4;
Error : Error_Handle) return Error_Code;
pragma Import (C, OCIAttrGet, "OCIAttrGet");
function OCIDescriptorFree
(Target : Handle;
Target_Type : Handle_Type) return Error_Code;
pragma Import (C, OCIDescriptorFree, "OCIDescriptorFree");
function OCIParamGet
(Target : Handle;
Target_Type : Handle_Type;
Error : Error_Handle;
Result : access Parameter;
Position : Ub4) return Error_Code;
pragma Import (C, OCIParamGet, "OCIParamGet");
function OCIEnvNlsCreate
(Target : access Environment;
Mode : Env_Mode;
Ctxp : Address := Null_Address;
Malocfp : Address := Null_Address;
Ralocfp : Address := Null_Address;
Mfreefp : Address := Null_Address;
Extra_Sz : Size_T := 0;
Extra_Ptr : Address := Null_Address;
Charset : Ub2 := OCI_UTF16ID;
N_Charset : Ub2 := OCI_UTF16ID) return Error_Code;
pragma Import (C, OCIEnvNlsCreate, "OCIEnvNlsCreate");
function OCILogon
(Env : Environment;
Error : Error_Handle;
Target : access Service_Handle;
Username : Matreshka.Internals.Utf16.Utf16_String;
Username_Len : Ub4;
Password : Matreshka.Internals.Utf16.Utf16_String;
Passwd_Len : Ub4;
Dbname : Matreshka.Internals.Utf16.Utf16_String;
Dbname_Len : Ub4) return Error_Code;
pragma Import (C, OCILogon, "OCILogon");
function OCILogoff
(Target : Service_Handle; Error : Error_Handle) return Error_Code;
pragma Import (C, OCILogoff, "OCILogoff");
function OCITransCommit
(Target : Service_Handle;
Error : Error_Handle;
Flags : Ub4 := OCI_DEFAULT) return Error_Code;
pragma Import (C, OCITransCommit, "OCITransCommit");
function OCITransRollback
(Target : Service_Handle;
Error : Error_Handle;
Flags : Ub4 := OCI_DEFAULT) return Error_Code;
pragma Import (C, OCITransRollback, "OCITransRollback");
function OCIErrorGet
(Error : Error_Handle;
Record_No : Ub4;
Sql_State : Address := Null_Address;
Ora_Code : access Ub4;
Buffer : Matreshka.Internals.Utf16.Utf16_String;
Buffer_Size : Ub4;
H_Type : Handle_Type := OCI_HTYPE_ERROR) return Error_Code;
pragma Import (C, OCIErrorGet, "OCIErrorGet");
function OCIStmtPrepare
(Stmt : Statement_Handle;
Error : Error_Handle;
Text : Matreshka.Internals.Utf16.Utf16_String;
Text_Length : Ub4;
Language : Ub4 := 1;
Mode : Ub4 := 0) return Error_Code;
pragma Import (C, OCIStmtPrepare, "OCIStmtPrepare");
function OCIStmtExecute
(Service : Service_Handle;
Stmt : Statement_Handle;
Errhp : Error_Handle;
Iters : Ub4;
Row_Off : Ub4 := 0;
Snap_In : Address := Null_Address;
Snap_Out : Address := Null_Address;
Mode : Ub4 := 0) return Error_Code;
pragma Import (C, OCIStmtExecute, "OCIStmtExecute");
function OCIStmtFetch2
(Stmt : Statement_Handle;
Error : Error_Handle;
Rows : Ub4 := 1;
Orientation : Ub2 := OCI_DEFAULT;
Offset : Ub4 := 0;
Mode : Ub4 := OCI_DEFAULT) return Error_Code;
pragma Import (C, OCIStmtFetch2, "OCIStmtFetch2");
function OCIBindByName
(Stmt : Statement_Handle;
Target : access Bind;
Error : Error_Handle;
Place : Matreshka.Internals.Utf16.Utf16_String;
Place_Length : Ub4;
Value : Address := Null_Address;
Value_Length : Ub4;
Value_Type : Data_Type;
Indicator : Sb2_Ptr := null;
Array_Length : Address := Null_Address;
Rcodep : Address := Null_Address;
Max_Array : Ub4 := 0;
Curelep : Address := Null_Address;
Mode : Ub4 := 0) return Error_Code;
pragma Import (C, OCIBindByName, "OCIBindByName");
function OCIBindByPos
(Stmt : Statement_Handle;
Target : access Bind;
Error : Error_Handle;
Position : Ub4;
Value : Address := Null_Address;
Value_Length : Ub4;
Value_Type : Data_Type;
Indicator : Sb2_Ptr := null;
Array_Length : Address := Null_Address;
Rcodep : Address := Null_Address;
Max_Array : Ub4 := 0;
Curelep : Address := Null_Address;
Mode : Ub4 := 0) return Error_Code;
pragma Import (C, OCIBindByPos, "OCIBindByPos");
function OCIDefineByPos
(Stmt : Statement_Handle;
Target : access Define;
Error : Error_Handle;
Position : Ub4;
Value : Address;
Value_Length : Ub4;
Value_Type : Data_Type;
Indicator : access Sb2;
Array_Length : Address := Null_Address;
Rcodep : Address := Null_Address;
Mode : Ub4 := 0) return Error_Code;
pragma Import (C, OCIDefineByPos, "OCIDefineByPos");
function OCINlsCharSetIdToName
(Env : Environment;
Buffer : Ora_Text;
Buffer_Len : Size_T;
Id : Ub2) return Error_Code;
pragma Import (C, OCINlsCharSetIdToName, "OCINlsCharSetIdToName");
function OCINlsNameMap
(Env : Environment;
Buffer : Ora_Text;
Buffer_Len : Size_T;
Source : Ora_Text;
Flag : Sword) return Error_Code;
pragma Import (C, OCINlsNameMap, "OCINlsNameMap");
function OCIDateTimeGetDate
(Env : Environment;
Error : Error_Handle;
Date : Date_Time;
Year : access Sb2;
Month : access Ub1;
Day : access Ub1) return Error_Code;
pragma Import (C, OCIDateTimeGetDate, "OCIDateTimeGetDate");
function OCIDateTimeGetTime
(Env : Environment;
Error : Error_Handle;
Date : Date_Time;
Hour : access Ub1;
Min : access Ub1;
Sec : access Ub1;
Fract : access Ub4) return Error_Code;
pragma Import (C, OCIDateTimeGetTime, "OCIDateTimeGetTime");
function OCIDateTimeConstruct
(Env : Environment;
Error : Error_Handle;
Date : Date_Time;
Year : Sb2;
Month : Ub1;
Day : Ub1;
Hour : Ub1;
Min : Ub1;
Sec : Ub1;
Fract : Ub4;
TZ : Address := Null_Address;
TZ_Len : Size_T := 0) return Error_Code;
pragma Import (C, OCIDateTimeConstruct, "OCIDateTimeConstruct");
OCI_ONE_PIECE : constant Ub1 := 0;
OCI_FIRST_PIECE : constant Ub1 := 1;
OCI_NEXT_PIECE : constant Ub1 := 2;
OCI_LAST_PIECE : constant Ub1 := 3;
function OCIBindDynamic
(bindp : Bind;
Error : Error_Handle;
ictxp : Address;
icbfp : Address;
octxp : Address;
ocbfp : Address) return Error_Code;
pragma Import (C, OCIBindDynamic, "OCIBindDynamic");
private
type Internal is limited null record;
end Matreshka.Internals.SQL_Drivers.Oracle;
|
------------------------------------------------------------------------------
-- Copyright (c) 2015, 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. --
------------------------------------------------------------------------------
with Natools.S_Expressions.Conditionals.Strings.Tests;
package body Natools.S_Expressions.Conditionals.Tests is
procedure All_Tests (Report : in out NT.Reporter'Class) is
begin
Report.Section ("Conditionals on strings");
Strings.Tests.All_Tests (Report);
Report.End_Section;
end All_Tests;
end Natools.S_Expressions.Conditionals.Tests;
|
------------------------------------------------------------------------
--
-- Copyright (c) 2018, Brendan T Malone All Rights Reserved.
--
-- 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 Alog.Tests;
package body Alog_Suite is
use AUnit.Test_Suites;
-- Statically allocate test suite:
Result : aliased Test_Suite;
-- Statically allocate test cases:
Test_Alog : aliased Alog.Tests.Alog_Test;
function Suite return Access_Test_Suite is
begin
Add_Test (Result'Access, Test_Alog'Access);
return Result'Access;
end Suite;
end Alog_Suite;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S E C U R E _ H A S H E S . S H A 2 _ 3 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-2021, 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. --
-- --
-- --
-- --
-- --
-- --
-- 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 package provides support for the 32-bit FIPS PUB 180-3 functions
-- SHA-224 and SHA-256.
-- This is an internal unit and should not be used directly in applications.
-- Use GNAT.SHA224 and GNAT.SHA256 instead.
with Interfaces;
with GNAT.Byte_Swapping;
with GNAT.Secure_Hashes.SHA2_Common;
package GNAT.Secure_Hashes.SHA2_32 is
subtype Word is Interfaces.Unsigned_32;
package Hash_State is new Hash_Function_State
(Word => Word,
Swap => GNAT.Byte_Swapping.Swap4,
Hash_Bit_Order => System.High_Order_First);
-- SHA-224 and SHA-256 operate on 32-bit big endian words
K : constant Hash_State.State (0 .. 63) :=
(16#428a2f98#, 16#71374491#, 16#b5c0fbcf#, 16#e9b5dba5#,
16#3956c25b#, 16#59f111f1#, 16#923f82a4#, 16#ab1c5ed5#,
16#d807aa98#, 16#12835b01#, 16#243185be#, 16#550c7dc3#,
16#72be5d74#, 16#80deb1fe#, 16#9bdc06a7#, 16#c19bf174#,
16#e49b69c1#, 16#efbe4786#, 16#0fc19dc6#, 16#240ca1cc#,
16#2de92c6f#, 16#4a7484aa#, 16#5cb0a9dc#, 16#76f988da#,
16#983e5152#, 16#a831c66d#, 16#b00327c8#, 16#bf597fc7#,
16#c6e00bf3#, 16#d5a79147#, 16#06ca6351#, 16#14292967#,
16#27b70a85#, 16#2e1b2138#, 16#4d2c6dfc#, 16#53380d13#,
16#650a7354#, 16#766a0abb#, 16#81c2c92e#, 16#92722c85#,
16#a2bfe8a1#, 16#a81a664b#, 16#c24b8b70#, 16#c76c51a3#,
16#d192e819#, 16#d6990624#, 16#f40e3585#, 16#106aa070#,
16#19a4c116#, 16#1e376c08#, 16#2748774c#, 16#34b0bcb5#,
16#391c0cb3#, 16#4ed8aa4a#, 16#5b9cca4f#, 16#682e6ff3#,
16#748f82ee#, 16#78a5636f#, 16#84c87814#, 16#8cc70208#,
16#90befffa#, 16#a4506ceb#, 16#bef9a3f7#, 16#c67178f2#);
-- Constants from FIPS PUB 180-3
function Sigma0 (X : Word) return Word;
function Sigma1 (X : Word) return Word;
function S0 (X : Word) return Word;
function S1 (X : Word) return Word;
pragma Inline (Sigma0, Sigma1, S0, S1);
-- Elementary functions Sigma^256_0, Sigma^256_1, sigma^256_0, sigma^256_1
-- from FIPS PUB 180-3.
procedure Transform is new SHA2_Common.Transform
(Hash_State => Hash_State,
K => K,
Rounds => 64,
Sigma0 => Sigma0,
Sigma1 => Sigma1,
S0 => S0,
S1 => S1);
SHA224_Init_State : constant Hash_State.State (0 .. 7) :=
(0 => 16#c1059ed8#,
1 => 16#367cd507#,
2 => 16#3070dd17#,
3 => 16#f70e5939#,
4 => 16#ffc00b31#,
5 => 16#68581511#,
6 => 16#64f98fa7#,
7 => 16#befa4fa4#);
SHA256_Init_State : constant Hash_State.State (0 .. 7) :=
(0 => 16#6a09e667#,
1 => 16#bb67ae85#,
2 => 16#3c6ef372#,
3 => 16#a54ff53a#,
4 => 16#510e527f#,
5 => 16#9b05688c#,
6 => 16#1f83d9ab#,
7 => 16#5be0cd19#);
-- Initialization vectors from FIPS PUB 180-3
end GNAT.Secure_Hashes.SHA2_32;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>linebuffer_Loop_1_pr</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_axi_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>in_axi_stream_V_last_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.last.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>in_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>indvar_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>exitcond_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten_fu_74_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>40</item>
<item>42</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>indvar_flatten_next</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next_fu_80_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>45</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>empty_19</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>31</item>
<item>32</item>
<item>33</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>552</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>552</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_14">
<Value>
<Obj>
<type>2</type>
<id>35</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_15">
<Value>
<Obj>
<type>2</type>
<id>41</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>2073600</content>
</item>
<item class_id_reference="16" object_id="_16">
<Value>
<Obj>
<type>2</type>
<id>44</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_17">
<Obj>
<type>3</type>
<id>7</id>
<name>newFuncRoot</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_18">
<Obj>
<type>3</type>
<id>12</id>
<name>.preheader.i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_19">
<Obj>
<type>3</type>
<id>21</id>
<name>.preheader4.i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
<item>20</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_20">
<Obj>
<type>3</type>
<id>23</id>
<name>.critedge.exitStub</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>22</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_21">
<id>24</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_22">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_23">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_24">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_25">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_26">
<id>33</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_27">
<id>34</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_28">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>37</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>39</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>47</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>48</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>111</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>12</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_43">
<mId>1</mId>
<mTag>linebuffer_Loop_1_pr</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2073602</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_44">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_45">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>21</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>2073600</mMinTripCount>
<mMaxTripCount>2073600</mMaxTripCount>
<mMinLatency>2073600</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_46">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_47">
<states class_id="25" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_48">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_49">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_50">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_51">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_52">
<id>2</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_53">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_54">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_55">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_56">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_57">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_58">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_59">
<id>3</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_60">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_61">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_62">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_65">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_66">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_67">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_68">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>12</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_69">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>20</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_70">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>19</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>9</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_71">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>21</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>9</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_72">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>9</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>ap_block_pp0_stage0_flag00001001 ( or ) </first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state1 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state2_pp0_stage0_iter0 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state3_pp0_stage0_iter1 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_pp0 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_74_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>21</second>
</item>
<item>
<first>(1P1)</first>
<second>16</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>13</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_80_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>21</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>68</second>
</item>
<item>
<first>LUT</first>
<second>26</second>
</item>
</second>
</item>
<item>
<first>start_write ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>8</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>21</second>
</item>
</second>
</item>
<item>
<first>ap_done</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_last_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>in_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>21</second>
</item>
<item>
<first>(2Count)</first>
<second>42</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>real_start</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>10</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_90</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>21</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>21</second>
</item>
</second>
</item>
<item>
<first>real_start_status_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>start_control_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>start_once_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_value_V_reg_99</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>2</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>exitcond_flatten_fu_74_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_80_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>6</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>7</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_73">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>21</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>exitcond_flatten_fu_74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>tmp_value_V_fu_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_17_write_fu_56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>empty_19_read_fu_48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="56" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_reg_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>tmp_value_V_reg_99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="57" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>in_axi_stream_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>in_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="59" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>3</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
with
lace.Event,
lace.Subject;
package gel.Keyboard with remote_Types
--
-- Provides an interface for a keyboard.
--
is
type Item is limited interface
and lace.Subject.item;
type View is access all Item'class;
--------
--- Keys
--
type Key is (Nil, -- TODO: Better names.
BACKSPACE,
TAB,
CLEAR,
ENTER,
PAUSE,
ESCAPE,
SPACE,
EXCLAIM,
QUOTEDBL,
HASH,
DOLLAR,
Percent,
AMPERSAND,
QUOTE,
LEFTPAREN,
RIGHTPAREN,
ASTERISK,
PLUS,
COMMA,
MINUS,
PERIOD,
SLASH,
'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
COLON, SEMICOLON,
LESS, EQUALS, GREATER,
QUESTION,
AT_key,
LEFTBRACKET,
BACKSLASH,
RIGHTBRACKET,
CARET,
UNDERSCORE,
BACKQUOTE,
a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z,
DELETE,
WORLD_0, WORLD_1, WORLD_2, WORLD_3, WORLD_4, WORLD_5, WORLD_6, WORLD_7, WORLD_8, WORLD_9,
WORLD_10, WORLD_11, WORLD_12, WORLD_13, WORLD_14, WORLD_15, WORLD_16, WORLD_17, WORLD_18, WORLD_19,
WORLD_20, WORLD_21, WORLD_22, WORLD_23, WORLD_24, WORLD_25, WORLD_26, WORLD_27, WORLD_28, WORLD_29,
WORLD_30, WORLD_31, WORLD_32, WORLD_33, WORLD_34, WORLD_35, WORLD_36, WORLD_37, WORLD_38, WORLD_39,
WORLD_40, WORLD_41, WORLD_42, WORLD_43, WORLD_44, WORLD_45, WORLD_46, WORLD_47, WORLD_48, WORLD_49,
WORLD_50, WORLD_51, WORLD_52, WORLD_53, WORLD_54, WORLD_55, WORLD_56, WORLD_57, WORLD_58, WORLD_59,
WORLD_60, WORLD_61, WORLD_62, WORLD_63, WORLD_64, WORLD_65, WORLD_66, WORLD_67, WORLD_68, WORLD_69,
WORLD_70, WORLD_71, WORLD_72, WORLD_73, WORLD_74, WORLD_75, WORLD_76, WORLD_77, WORLD_78, WORLD_79,
WORLD_80, WORLD_81, WORLD_82, WORLD_83, WORLD_84, WORLD_85, WORLD_86, WORLD_87, WORLD_88, WORLD_89,
WORLD_90, WORLD_91, WORLD_92, WORLD_93, WORLD_94, WORLD_95,
KP0, KP1, KP2, KP3, KP4, KP5, KP6, KP7, KP8, KP9,
KP_PERIOD,
KP_DIVIDE, KP_MULTIPLY, KP_MINUS, KP_PLUS,
KP_ENTER, KP_EQUALS,
UP, DOWN, RIGHT, LEFT,
INSERT,
HOME, END_key,
PAGEUP, PAGEDOWN,
F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14, F15,
NUMLOCK, CAPSLOCK, SCROLLLOCK,
RSHIFT, LSHIFT,
RCTRL, LCTRL,
RALT, LALT,
RMETA, LMETA,
LSUPER, RSUPER,
MODE,
COMPOSE,
HELP,
PRINT,
SYSREQ,
BREAK,
MENU,
POWER,
EURO,
UNDO);
function is_Graphic (Self : in Key) return Boolean;
-------------
--- Modifiers
--
type Modifier is (LSHIFT, -- TODO: Better names.
RSHIFT,
LCTRL,
RCTRL,
LALT,
RALT,
LMETA,
RMETA,
NUM,
CAPS,
MODE);
type modifier_Set is array (Modifier) of Boolean;
no_Modifiers : constant modifier_Set;
type modified_Key is
record
Key : keyboard.Key;
modifier_Set : keyboard.modifier_Set;
end record;
function Image (Self : in modified_Key) return Character;
----------
--- Events
--
type key_press_Event is new lace.Event.item with
record
modified_Key : keyboard.modified_Key;
Code : Integer;
end record;
type key_release_Event is new lace.Event.item with
record
modified_Key : keyboard.modified_Key;
end record;
--------------
--- Attributes
--
function Modifiers (Self : in Item) return Modifier_Set is abstract;
--------------
--- Operations
--
procedure emit_key_press_Event (Self : in out Item; Key : in keyboard.Key;
key_Code : in Integer) is abstract;
procedure emit_key_release_Event (Self : in out Item; Key : in keyboard.Key) is abstract;
private
no_Modifiers : constant modifier_Set := (others => False);
end gel.Keyboard;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dct_2d</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_block</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_block</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_block</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>72</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>4</id>
<name>row_outbuf</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>col_outbuf</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>col_inbuf</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>icmp_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>115</item>
<item>117</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>i</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>118</item>
<item>120</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>121</item>
<item>122</item>
<item>123</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>_ln77</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>271</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>indvar_flatten</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>132</item>
<item>133</item>
<item>135</item>
<item>136</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>j_0</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>i_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
<item>143</item>
<item>144</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>icmp_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>145</item>
<item>147</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.71</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>add_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>148</item>
<item>150</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
<item>153</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>j</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>icmp_ln83</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>select_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>159</item>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>select_ln84_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>162</item>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>zext_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
<item>170</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>zext_ln84_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>171</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>zext_ln84_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
<item>175</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>zext_ln84_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>176</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>add_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>zext_ln84_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>row_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>180</item>
<item>182</item>
<item>183</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>add_ln84_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>184</item>
<item>185</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>zext_ln84_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>186</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>col_inbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
<item>189</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>row_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>190</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>col_inbuf_addr_write_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>191</item>
<item>192</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>i_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>193</item>
<item>194</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>195</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>i_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
<item>198</item>
<item>199</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>icmp_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>i_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>203</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>204</item>
<item>205</item>
<item>206</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>_ln88</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
<item>210</item>
<item>211</item>
<item>212</item>
<item>272</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>207</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>indvar_flatten11</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>214</item>
<item>215</item>
<item>216</item>
<item>217</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>j_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>218</item>
<item>219</item>
<item>220</item>
<item>221</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>i_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>222</item>
<item>223</item>
<item>224</item>
<item>225</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>icmp_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>226</item>
<item>227</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.71</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>add_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>228</item>
<item>229</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>230</item>
<item>231</item>
<item>232</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>j_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>233</item>
<item>234</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>icmp_ln94</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>select_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>237</item>
<item>238</item>
<item>239</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>select_ln95_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
<item>242</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>zext_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>243</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>tmp_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>244</item>
<item>245</item>
<item>246</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>zext_ln95_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>247</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>zext_ln95_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>248</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>add_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>249</item>
<item>250</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>zext_ln95_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>251</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>68</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>out_block_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>252</item>
<item>253</item>
<item>254</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>tmp_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>255</item>
<item>256</item>
<item>257</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>zext_ln95_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>258</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>add_ln95_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>259</item>
<item>260</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>zext_ln95_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>261</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>col_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>262</item>
<item>263</item>
<item>264</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>col_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>265</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>out_block_addr_write_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>266</item>
<item>267</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>70</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>i_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>268</item>
<item>269</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>270</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>_ln96</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>96</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>72</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_75">
<Value>
<Obj>
<type>2</type>
<id>105</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>110</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>116</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>119</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>125</id>
<name>dct_1d2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:dct_1d2></content>
</item>
<item class_id_reference="16" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>134</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>146</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_82">
<Value>
<Obj>
<type>2</type>
<id>149</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_83">
<Value>
<Obj>
<type>2</type>
<id>169</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_84">
<Value>
<Obj>
<type>2</type>
<id>181</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_85">
<Obj>
<type>3</type>
<id>8</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_86">
<Obj>
<type>3</type>
<id>14</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_87">
<Obj>
<type>3</type>
<id>18</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_88">
<Obj>
<type>3</type>
<id>20</id>
<name>.preheader2.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>27</id>
<name>.preheader2.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>54</id>
<name>Xpose_Row_Inner_Loop</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>20</count>
<item_version>0</item_version>
<item>28</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>52</item>
<item>53</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>56</id>
<name>.preheader1.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_92">
<Obj>
<type>3</type>
<id>62</id>
<name>.preheader1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>57</item>
<item>58</item>
<item>60</item>
<item>61</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_93">
<Obj>
<type>3</type>
<id>66</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_94">
<Obj>
<type>3</type>
<id>68</id>
<name>.preheader.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_95">
<Obj>
<type>3</type>
<id>75</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_96">
<Obj>
<type>3</type>
<id>102</id>
<name>Xpose_Col_Inner_Loop</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>20</count>
<item_version>0</item_version>
<item>76</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>100</item>
<item>101</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_97">
<Obj>
<type>3</type>
<id>104</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>169</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_98">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>4</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>112</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>114</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>122</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>123</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>124</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>131</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>133</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>136</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>138</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>140</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>144</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_137">
<id>152</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>153</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>195</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>205</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>206</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>207</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>213</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>215</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>219</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>221</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>225</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>231</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>232</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>270</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>341</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>342</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>343</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>344</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>345</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>346</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>347</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>348</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>349</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>350</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>351</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>352</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>353</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>354</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>355</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_267">
<mId>1</mId>
<mTag>dct_2d</mTag>
<mType>0</mType>
<sub_regions>
<count>9</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1590</mMinLatency>
<mMaxLatency>1590</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_268">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_269">
<mId>3</mId>
<mTag>Row_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>18</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>728</mMinLatency>
<mMaxLatency>728</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_270">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_271">
<mId>5</mId>
<mTag>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>54</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>64</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_272">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_273">
<mId>7</mId>
<mTag>Col_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>62</item>
<item>66</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>728</mMinLatency>
<mMaxLatency>728</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_274">
<mId>8</mId>
<mTag>Region 3</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_275">
<mId>9</mId>
<mTag>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>102</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>64</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_276">
<mId>10</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>72</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>4</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>8</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>5</first>
<second>6</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>6</first>
<second>6</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_277">
<region_name>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>54</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
<item class_id_reference="33" object_id="_278">
<region_name>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>102</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- --
-- 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.Generic_Collections;
package AMF.Utp.Timer_Running_Actions.Collections is
pragma Preelaborate;
package Utp_Timer_Running_Action_Collections is
new AMF.Generic_Collections
(Utp_Timer_Running_Action,
Utp_Timer_Running_Action_Access);
type Set_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Set with null record;
Empty_Set_Of_Utp_Timer_Running_Action : constant Set_Of_Utp_Timer_Running_Action;
type Ordered_Set_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_Utp_Timer_Running_Action : constant Ordered_Set_Of_Utp_Timer_Running_Action;
type Bag_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Bag with null record;
Empty_Bag_Of_Utp_Timer_Running_Action : constant Bag_Of_Utp_Timer_Running_Action;
type Sequence_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Sequence with null record;
Empty_Sequence_Of_Utp_Timer_Running_Action : constant Sequence_Of_Utp_Timer_Running_Action;
private
Empty_Set_Of_Utp_Timer_Running_Action : constant Set_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Set with null record);
Empty_Ordered_Set_Of_Utp_Timer_Running_Action : constant Ordered_Set_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Ordered_Set with null record);
Empty_Bag_Of_Utp_Timer_Running_Action : constant Bag_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Bag with null record);
Empty_Sequence_Of_Utp_Timer_Running_Action : constant Sequence_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Sequence with null record);
end AMF.Utp.Timer_Running_Actions.Collections;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Pragmas is
function Create
(Pragma_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Identifiers
.Identifier_Access;
Left_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access;
Arguments : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Right_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Pragma_Element is
begin
return Result : Pragma_Element :=
(Pragma_Token => Pragma_Token, Name => Name,
Left_Bracket_Token => Left_Bracket_Token, Arguments => Arguments,
Right_Bracket_Token => Right_Bracket_Token,
Semicolon_Token => Semicolon_Token, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Name : not null Program.Elements.Identifiers
.Identifier_Access;
Arguments : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Pragma is
begin
return Result : Implicit_Pragma :=
(Name => Name, Arguments => Arguments,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Name
(Self : Base_Pragma)
return not null Program.Elements.Identifiers.Identifier_Access is
begin
return Self.Name;
end Name;
overriding function Arguments
(Self : Base_Pragma)
return Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access is
begin
return Self.Arguments;
end Arguments;
overriding function Pragma_Token
(Self : Pragma_Element)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Pragma_Token;
end Pragma_Token;
overriding function Left_Bracket_Token
(Self : Pragma_Element)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Left_Bracket_Token;
end Left_Bracket_Token;
overriding function Right_Bracket_Token
(Self : Pragma_Element)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Right_Bracket_Token;
end Right_Bracket_Token;
overriding function Semicolon_Token
(Self : Pragma_Element)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Pragma)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Pragma)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Pragma)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : aliased in out Base_Pragma'Class) is
begin
Set_Enclosing_Element (Self.Name, Self'Unchecked_Access);
for Item in Self.Arguments.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Pragma_Element (Self : Base_Pragma) return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Pragma_Element;
overriding procedure Visit
(Self : not null access Base_Pragma;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Pragma_Element (Self);
end Visit;
overriding function To_Pragma_Text
(Self : aliased in out Pragma_Element)
return Program.Elements.Pragmas.Pragma_Text_Access is
begin
return Self'Unchecked_Access;
end To_Pragma_Text;
overriding function To_Pragma_Text
(Self : aliased in out Implicit_Pragma)
return Program.Elements.Pragmas.Pragma_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Pragma_Text;
end Program.Nodes.Pragmas;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- SYSTEM.TASK_PRIMITIVES.INTERRUPT_OPERATIONS --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-2020, Free Software Foundation, Inc. --
-- --
-- GNARL 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/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
package body System.Task_Primitives.Interrupt_Operations is
-- ??? The VxWorks version of System.Interrupt_Management needs to access
-- this array, but due to elaboration problems, it can't with this
-- package directly, so we export this variable for now.
Interrupt_ID_Map : array (IM.Interrupt_ID) of ST.Task_Id;
pragma Export (Ada, Interrupt_ID_Map,
"system__task_primitives__interrupt_operations__interrupt_id_map");
----------------------
-- Get_Interrupt_ID --
----------------------
function Get_Interrupt_ID (T : ST.Task_Id) return IM.Interrupt_ID is
use type ST.Task_Id;
begin
for Interrupt in IM.Interrupt_ID loop
if Interrupt_ID_Map (Interrupt) = T then
return Interrupt;
end if;
end loop;
raise Program_Error;
end Get_Interrupt_ID;
-----------------
-- Get_Task_Id --
-----------------
function Get_Task_Id (Interrupt : IM.Interrupt_ID) return ST.Task_Id is
begin
return Interrupt_ID_Map (Interrupt);
end Get_Task_Id;
----------------------
-- Set_Interrupt_ID --
----------------------
procedure Set_Interrupt_ID (Interrupt : IM.Interrupt_ID; T : ST.Task_Id) is
begin
Interrupt_ID_Map (Interrupt) := T;
end Set_Interrupt_ID;
end System.Task_Primitives.Interrupt_Operations;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-2017, 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. --
-- --
------------------------------------------------------------------------------
with STM32_SVD.RCC; use STM32_SVD.RCC;
with STM32_SVD.SCB; use STM32_SVD.SCB;
with System.Machine_Code; use System.Machine_Code;
package body STM32.Power_Control is
------------
-- Enable --
------------
procedure Enable is
begin
RCC_Periph.APB1ENR1.PWREN := True;
end Enable;
--------------------------------------
-- Disable_Backup_Domain_Protection --
--------------------------------------
procedure Disable_Backup_Domain_Protection is
begin
PWR_Periph.CR1.DBP := True;
end Disable_Backup_Domain_Protection;
-------------------------------------
-- Enable_Backup_Domain_Protection --
-------------------------------------
procedure Enable_Backup_Domain_Protection is
begin
PWR_Periph.CR1.DBP := False;
end Enable_Backup_Domain_Protection;
-----------------------
-- Enable_Wakeup_Pin --
-----------------------
procedure Enable_Wakeup_Pin (Pin : Wakeup_Pin) is
begin
PWR_Periph.CR3.EWUP.Arr (Pin'Enum_Rep) := True;
end Enable_Wakeup_Pin;
-----------------
-- Wakeup_Flag --
-----------------
function Wakeup_Flag (Pin : Wakeup_Pin) return Boolean
is (PWR_Periph.SR1.WUF.Arr (Pin'Enum_Rep));
-----------------------
-- Clear_Wakeup_Flag --
-----------------------
procedure Clear_Wakeup_Flag (Pin : Wakeup_Pin) is
begin
PWR_Periph.SCR.CWUF.Arr (Pin'Enum_Rep) := True;
end Clear_Wakeup_Flag;
-----------------------
-- Clear_Wakeup_Flag --
-----------------------
procedure Clear_Wakeup_Flag (Pins : Wakeup_Pin_List) is
begin
for Pin of Pins loop
PWR_Periph.SCR.CWUF.Arr (Pin'Enum_Rep) := True;
end loop;
end Clear_Wakeup_Flag;
------------------
-- Standby_Flag --
------------------
function Standby_Flag return Boolean
is (PWR_Periph.SR1.SBF);
------------------------
-- Clear_Standby_Flag --
------------------------
procedure Clear_Standby_Flag is
begin
PWR_Periph.SCR.CSBF := True;
end Clear_Standby_Flag;
------------------------------
-- Set_Power_Down_Deepsleep --
------------------------------
procedure Set_Power_Down_Deepsleep (Enabled : Boolean := True) is
begin
PWR_Periph.CR1.LPMS := Low_Power_Mode'Enum_Rep (Shutdown);
PWR_Periph.CR1.LPR := Enabled;
end Set_Power_Down_Deepsleep;
-----------------------------
-- Set_Low_Power_Deepsleep --
-----------------------------
procedure Set_Low_Power_Deepsleep (Enabled : Boolean := True) is
begin
PWR_Periph.CR1.LPMS := Low_Power_Mode'Enum_Rep (Stop_1);
PWR_Periph.CR1.LPR := Enabled;
end Set_Low_Power_Deepsleep;
------------------------
-- Enter_Standby_Mode --
------------------------
procedure Enter_Standby_Mode is
begin
for Pin in Wakeup_Pin'Range loop
Clear_Wakeup_Flag (Pin);
end loop;
Clear_Standby_Flag;
Set_Power_Down_Deepsleep;
SCB_Periph.SCR.SLEEPDEEP := True;
loop
Asm ("wfi", Volatile => True);
end loop;
end Enter_Standby_Mode;
end STM32.Power_Control;
|
-- { dg-do compile }
package Small_Alignment is
type Int is range -512 .. 511;
for Int'Alignment use 1;
type R is record
I: Int;
end record;
Pragma Pack (R);
end Small_Alignment;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S P I T B O L . P A T T E R N S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1998-2001, Ada Core Technologies, 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, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, 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 is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- Note: the data structures and general approach used in this implementation
-- are derived from the original MINIMAL sources for SPITBOL. The code is not
-- a direct translation, but the approach is followed closely. In particular,
-- we use the one stack approach developed in the SPITBOL implementation.
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Strings.Maps; use Ada.Strings.Maps;
with Ada.Strings.Unbounded.Aux; use Ada.Strings.Unbounded.Aux;
with GNAT.Debug_Utilities; use GNAT.Debug_Utilities;
with System; use System;
with Unchecked_Conversion;
with Unchecked_Deallocation;
package body GNAT.Spitbol.Patterns is
------------------------
-- Internal Debugging --
------------------------
Internal_Debug : constant Boolean := False;
-- Set this flag to True to activate some built-in debugging traceback
-- These are all lines output with PutD and Put_LineD.
procedure New_LineD;
pragma Inline (New_LineD);
-- Output new blank line with New_Line if Internal_Debug is True
procedure PutD (Str : String);
pragma Inline (PutD);
-- Output string with Put if Internal_Debug is True
procedure Put_LineD (Str : String);
pragma Inline (Put_LineD);
-- Output string with Put_Line if Internal_Debug is True
-----------------------------
-- Local Type Declarations --
-----------------------------
subtype String_Ptr is Ada.Strings.Unbounded.String_Access;
subtype File_Ptr is Ada.Text_IO.File_Access;
function To_PE_Ptr is new Unchecked_Conversion (Address, PE_Ptr);
function To_Address is new Unchecked_Conversion (PE_Ptr, Address);
-- Used only for debugging output purposes
subtype AFC is Ada.Finalization.Controlled;
N : constant PE_Ptr := null;
-- Shorthand used to initialize Copy fields to null
type Character_Ptr is access all Character;
type Natural_Ptr is access all Natural;
type Pattern_Ptr is access all Pattern;
--------------------------------------------------
-- Description of Algorithm and Data Structures --
--------------------------------------------------
-- A pattern structure is represented as a linked graph of nodes
-- with the following structure:
-- +------------------------------------+
-- I Pcode I
-- +------------------------------------+
-- I Index I
-- +------------------------------------+
-- I Pthen I
-- +------------------------------------+
-- I parameter(s) I
-- +------------------------------------+
-- Pcode is a code value indicating the type of the patterm node. This
-- code is used both as the discriminant value for the record, and as
-- the case index in the main match routine that branches to the proper
-- match code for the given element.
-- Index is a serial index number. The use of these serial index
-- numbers is described in a separate section.
-- Pthen is a pointer to the successor node, i.e the node to be matched
-- if the attempt to match the node succeeds. If this is the last node
-- of the pattern to be matched, then Pthen points to a dummy node
-- of kind PC_EOP (end of pattern), which initiales pattern exit.
-- The parameter or parameters are present for certain node types,
-- and the type varies with the pattern code.
type Pattern_Code is (
PC_Arb_Y,
PC_Assign,
PC_Bal,
PC_BreakX_X,
PC_Cancel,
PC_EOP,
PC_Fail,
PC_Fence,
PC_Fence_X,
PC_Fence_Y,
PC_R_Enter,
PC_R_Remove,
PC_R_Restore,
PC_Rest,
PC_Succeed,
PC_Unanchored,
PC_Alt,
PC_Arb_X,
PC_Arbno_S,
PC_Arbno_X,
PC_Rpat,
PC_Pred_Func,
PC_Assign_Imm,
PC_Assign_OnM,
PC_Any_VP,
PC_Break_VP,
PC_BreakX_VP,
PC_NotAny_VP,
PC_NSpan_VP,
PC_Span_VP,
PC_String_VP,
PC_Write_Imm,
PC_Write_OnM,
PC_Null,
PC_String,
PC_String_2,
PC_String_3,
PC_String_4,
PC_String_5,
PC_String_6,
PC_Setcur,
PC_Any_CH,
PC_Break_CH,
PC_BreakX_CH,
PC_Char,
PC_NotAny_CH,
PC_NSpan_CH,
PC_Span_CH,
PC_Any_CS,
PC_Break_CS,
PC_BreakX_CS,
PC_NotAny_CS,
PC_NSpan_CS,
PC_Span_CS,
PC_Arbno_Y,
PC_Len_Nat,
PC_Pos_Nat,
PC_RPos_Nat,
PC_RTab_Nat,
PC_Tab_Nat,
PC_Pos_NF,
PC_Len_NF,
PC_RPos_NF,
PC_RTab_NF,
PC_Tab_NF,
PC_Pos_NP,
PC_Len_NP,
PC_RPos_NP,
PC_RTab_NP,
PC_Tab_NP,
PC_Any_VF,
PC_Break_VF,
PC_BreakX_VF,
PC_NotAny_VF,
PC_NSpan_VF,
PC_Span_VF,
PC_String_VF);
type IndexT is range 0 .. +(2 **15 - 1);
type PE (Pcode : Pattern_Code) is record
Index : IndexT;
-- Serial index number of pattern element within pattern.
Pthen : PE_Ptr;
-- Successor element, to be matched after this one
case Pcode is
when PC_Arb_Y |
PC_Assign |
PC_Bal |
PC_BreakX_X |
PC_Cancel |
PC_EOP |
PC_Fail |
PC_Fence |
PC_Fence_X |
PC_Fence_Y |
PC_Null |
PC_R_Enter |
PC_R_Remove |
PC_R_Restore |
PC_Rest |
PC_Succeed |
PC_Unanchored => null;
when PC_Alt |
PC_Arb_X |
PC_Arbno_S |
PC_Arbno_X => Alt : PE_Ptr;
when PC_Rpat => PP : Pattern_Ptr;
when PC_Pred_Func => BF : Boolean_Func;
when PC_Assign_Imm |
PC_Assign_OnM |
PC_Any_VP |
PC_Break_VP |
PC_BreakX_VP |
PC_NotAny_VP |
PC_NSpan_VP |
PC_Span_VP |
PC_String_VP => VP : VString_Ptr;
when PC_Write_Imm |
PC_Write_OnM => FP : File_Ptr;
when PC_String => Str : String_Ptr;
when PC_String_2 => Str2 : String (1 .. 2);
when PC_String_3 => Str3 : String (1 .. 3);
when PC_String_4 => Str4 : String (1 .. 4);
when PC_String_5 => Str5 : String (1 .. 5);
when PC_String_6 => Str6 : String (1 .. 6);
when PC_Setcur => Var : Natural_Ptr;
when PC_Any_CH |
PC_Break_CH |
PC_BreakX_CH |
PC_Char |
PC_NotAny_CH |
PC_NSpan_CH |
PC_Span_CH => Char : Character;
when PC_Any_CS |
PC_Break_CS |
PC_BreakX_CS |
PC_NotAny_CS |
PC_NSpan_CS |
PC_Span_CS => CS : Character_Set;
when PC_Arbno_Y |
PC_Len_Nat |
PC_Pos_Nat |
PC_RPos_Nat |
PC_RTab_Nat |
PC_Tab_Nat => Nat : Natural;
when PC_Pos_NF |
PC_Len_NF |
PC_RPos_NF |
PC_RTab_NF |
PC_Tab_NF => NF : Natural_Func;
when PC_Pos_NP |
PC_Len_NP |
PC_RPos_NP |
PC_RTab_NP |
PC_Tab_NP => NP : Natural_Ptr;
when PC_Any_VF |
PC_Break_VF |
PC_BreakX_VF |
PC_NotAny_VF |
PC_NSpan_VF |
PC_Span_VF |
PC_String_VF => VF : VString_Func;
end case;
end record;
subtype PC_Has_Alt is Pattern_Code range PC_Alt .. PC_Arbno_X;
-- Range of pattern codes that has an Alt field. This is used in the
-- recursive traversals, since these links must be followed.
EOP_Element : aliased constant PE := (PC_EOP, 0, N);
-- This is the end of pattern element, and is thus the representation of
-- a null pattern. It has a zero index element since it is never placed
-- inside a pattern. Furthermore it does not need a successor, since it
-- marks the end of the pattern, so that no more successors are needed.
EOP : constant PE_Ptr := EOP_Element'Unrestricted_Access;
-- This is the end of pattern pointer, that is used in the Pthen pointer
-- of other nodes to signal end of pattern.
-- The following array is used to determine if a pattern used as an
-- argument for Arbno is eligible for treatment using the simple Arbno
-- structure (i.e. it is a pattern that is guaranteed to match at least
-- one character on success, and not to make any entries on the stack.
OK_For_Simple_Arbno :
array (Pattern_Code) of Boolean := (
PC_Any_CS |
PC_Any_CH |
PC_Any_VF |
PC_Any_VP |
PC_Char |
PC_Len_Nat |
PC_NotAny_CS |
PC_NotAny_CH |
PC_NotAny_VF |
PC_NotAny_VP |
PC_Span_CS |
PC_Span_CH |
PC_Span_VF |
PC_Span_VP |
PC_String |
PC_String_2 |
PC_String_3 |
PC_String_4 |
PC_String_5 |
PC_String_6 => True,
others => False);
-------------------------------
-- The Pattern History Stack --
-------------------------------
-- The pattern history stack is used for controlling backtracking when
-- a match fails. The idea is to stack entries that give a cursor value
-- to be restored, and a node to be reestablished as the current node to
-- attempt an appropriate rematch operation. The processing for a pattern
-- element that has rematch alternatives pushes an appropriate entry or
-- entry on to the stack, and the proceeds. If a match fails at any point,
-- the top element of the stack is popped off, resetting the cursor and
-- the match continues by accessing the node stored with this entry.
type Stack_Entry is record
Cursor : Integer;
-- Saved cursor value that is restored when this entry is popped
-- from the stack if a match attempt fails. Occasionally, this
-- field is used to store a history stack pointer instead of a
-- cursor. Such cases are noted in the documentation and the value
-- stored is negative since stack pointer values are always negative.
Node : PE_Ptr;
-- This pattern element reference is reestablished as the current
-- Node to be matched (which will attempt an appropriate rematch).
end record;
subtype Stack_Range is Integer range -Stack_Size .. -1;
type Stack_Type is array (Stack_Range) of Stack_Entry;
-- The type used for a history stack. The actual instance of the stack
-- is declared as a local variable in the Match routine, to properly
-- handle recursive calls to Match. All stack pointer values are negative
-- to distinguish them from normal cursor values.
-- Note: the pattern matching stack is used only to handle backtracking.
-- If no backtracking occurs, its entries are never accessed, and never
-- popped off, and in particular it is normal for a successful match
-- to terminate with entries on the stack that are simply discarded.
-- Note: in subsequent diagrams of the stack, we always place element
-- zero (the deepest element) at the top of the page, then build the
-- stack down on the page with the most recent (top of stack) element
-- being the bottom-most entry on the page.
-- Stack checking is handled by labeling every pattern with the maximum
-- number of stack entries that are required, so a single check at the
-- start of matching the pattern suffices. There are two exceptions.
-- First, the count does not include entries for recursive pattern
-- references. Such recursions must therefore perform a specific
-- stack check with respect to the number of stack entries required
-- by the recursive pattern that is accessed and the amount of stack
-- that remains unused.
-- Second, the count includes only one iteration of an Arbno pattern,
-- so a specific check must be made on subsequent iterations that there
-- is still enough stack space left. The Arbno node has a field that
-- records the number of stack entries required by its argument for
-- this purpose.
---------------------------------------------------
-- Use of Serial Index Field in Pattern Elements --
---------------------------------------------------
-- The serial index numbers for the pattern elements are assigned as
-- a pattern is consructed from its constituent elements. Note that there
-- is never any sharing of pattern elements between patterns (copies are
-- always made), so the serial index numbers are unique to a particular
-- pattern as referenced from the P field of a value of type Pattern.
-- The index numbers meet three separate invariants, which are used for
-- various purposes as described in this section.
-- First, the numbers uniquely identify the pattern elements within a
-- pattern. If Num is the number of elements in a given pattern, then
-- the serial index numbers for the elements of this pattern will range
-- from 1 .. Num, so that each element has a separate value.
-- The purpose of this assignment is to provide a convenient auxiliary
-- data structure mechanism during operations which must traverse a
-- pattern (e.g. copy and finalization processing). Once constructed
-- patterns are strictly read only. This is necessary to allow sharing
-- of patterns between tasks. This means that we cannot go marking the
-- pattern (e.g. with a visited bit). Instead we cosntuct a separate
-- vector that contains the necessary information indexed by the Index
-- values in the pattern elements. For this purpose the only requirement
-- is that they be uniquely assigned.
-- Second, the pattern element referenced directly, i.e. the leading
-- pattern element, is always the maximum numbered element and therefore
-- indicates the total number of elements in the pattern. More precisely,
-- the element referenced by the P field of a pattern value, or the
-- element returned by any of the internal pattern construction routines
-- in the body (that return a value of type PE_Ptr) always is this
-- maximum element,
-- The purpose of this requirement is to allow an immediate determination
-- of the number of pattern elements within a pattern. This is used to
-- properly size the vectors used to contain auxiliary information for
-- traversal as described above.
-- Third, as compound pattern structures are constructed, the way in which
-- constituent parts of the pattern are constructed is stylized. This is
-- an automatic consequence of the way that these compounjd structures
-- are constructed, and basically what we are doing is simply documenting
-- and specifying the natural result of the pattern construction. The
-- section describing compound pattern structures gives details of the
-- numbering of each compound pattern structure.
-- The purpose of specifying the stylized numbering structures for the
-- compound patterns is to help simplify the processing in the Image
-- function, since it eases the task of retrieving the original recursive
-- structure of the pattern from the flat graph structure of elements.
-- This use in the Image function is the only point at which the code
-- makes use of the stylized structures.
type Ref_Array is array (IndexT range <>) of PE_Ptr;
-- This type is used to build an array whose N'th entry references the
-- element in a pattern whose Index value is N. See Build_Ref_Array.
procedure Build_Ref_Array (E : PE_Ptr; RA : out Ref_Array);
-- Given a pattern element which is the leading element of a pattern
-- structure, and a Ref_Array with bounds 1 .. E.Index, fills in the
-- Ref_Array so that its N'th entry references the element of the
-- referenced pattern whose Index value is N.
-------------------------------
-- Recursive Pattern Matches --
-------------------------------
-- The pattern primitive (+P) where P is a Pattern_Ptr or Pattern_Func
-- causes a recursive pattern match. This cannot be handled by an actual
-- recursive call to the outer level Match routine, since this would not
-- allow for possible backtracking into the region matched by the inner
-- pattern. Indeed this is the classical clash between recursion and
-- backtracking, and a simple recursive stack structure does not suffice.
-- This section describes how this recursion and the possible associated
-- backtracking is handled. We still use a single stack, but we establish
-- the concept of nested regions on this stack, each of which has a stack
-- base value pointing to the deepest stack entry of the region. The base
-- value for the outer level is zero.
-- When a recursive match is established, two special stack entries are
-- made. The first entry is used to save the original node that starts
-- the recursive match. This is saved so that the successor field of
-- this node is accessible at the end of the match, but it is never
-- popped and executed.
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the recursive pattern is matched and
-- it can make history stack entries in the normal matter, so now
-- the stack looks like:
-- (stack entries made by outer level)
-- (Special entry, node is (+P) successor
-- cursor entry is not used)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack base
-- saved base value for the enclosing region)
-- (stack entries made by inner level)
-- If a subsequent failure occurs and pops the PC_R_Remove node, it
-- removes itself and the special entry immediately underneath it,
-- restores the stack base value for the enclosing region, and then
-- again signals failure to look for alternatives that were stacked
-- before the recursion was initiated.
-- Now we need to consider what happens if the inner pattern succeeds, as
-- signalled by accessing the special PC_EOP pattern primitive. First we
-- recognize the nested case by looking at the Base value. If this Base
-- value is Stack'First, then the entire match has succeeded, but if the
-- base value is greater than Stack'First, then we have successfully
-- matched an inner pattern, and processing continues at the outer level.
-- There are two cases. The simple case is when the inner pattern has made
-- no stack entries, as recognized by the fact that the current stack
-- pointer is equal to the current base value. In this case it is fine to
-- remove all trace of the recursion by restoring the outer base value and
-- using the special entry to find the appropriate successor node.
-- The more complex case arises when the inner match does make stack
-- entries. In this case, the PC_EOP processing stacks a special entry
-- whose cursor value saves the saved inner base value (the one that
-- references the corresponding PC_R_Remove value), and whose node
-- pointer references a PC_R_Restore node, so the stack looks like:
-- (stack entries made by outer level)
-- (Special entry, node is (+P) successor,
-- cursor entry is not used)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by inner level)
-- (PC_Region_Replace entry, "cursor" value is (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- If the entire match succeeds, then these stack entries are, as usual,
-- ignored and abandoned. If on the other hand a subsequent failure
-- causes the PC_Region_Replace entry to be popped, it restores the
-- inner base value from its saved "cursor" value and then fails again.
-- Note that it is OK that the cursor is temporarily clobbered by this
-- pop, since the second failure will reestablish a proper cursor value.
---------------------------------
-- Compound Pattern Structures --
---------------------------------
-- This section discusses the compound structures used to represent
-- constructed patterns. It shows the graph structures of pattern
-- elements that are constructed, and in the case of patterns that
-- provide backtracking possibilities, describes how the history
-- stack is used to control the backtracking. Finally, it notes the
-- way in which the Index numbers are assigned to the structure.
-- In all diagrams, solid lines (built witth minus signs or vertical
-- bars, represent successor pointers (Pthen fields) with > or V used
-- to indicate the direction of the pointer. The initial node of the
-- structure is in the upper left of the diagram. A dotted line is an
-- alternative pointer from the element above it to the element below
-- it. See individual sections for details on how alternatives are used.
-------------------
-- Concatenation --
-------------------
-- In the pattern structures listed in this section, a line that looks
-- lile ----> with nothing to the right indicates an end of pattern
-- (EOP) pointer that represents the end of the match.
-- When a pattern concatenation (L & R) occurs, the resulting structure
-- is obtained by finding all such EOP pointers in L, and replacing
-- them to point to R. This is the most important flattening that
-- occurs in constructing a pattern, and it means that the pattern
-- matching circuitry does not have to keep track of the structure
-- of a pattern with respect to concatenation, since the appropriate
-- successor is always at hand.
-- Concatenation itself generates no additional possibilities for
-- backtracking, but the constituent patterns of the concatenated
-- structure will make stack entries as usual. The maximum amount
-- of stack required by the structure is thus simply the sum of the
-- maximums required by L and R.
-- The index numbering of a concatenation structure works by leaving
-- the numbering of the right hand pattern, R, unchanged and adjusting
-- the numbers in the left hand pattern, L up by the count of elements
-- in R. This ensures that the maximum numbered element is the leading
-- element as required (given that it was the leading element in L).
-----------------
-- Alternation --
-----------------
-- A pattern (L or R) constructs the structure:
-- +---+ +---+
-- | A |---->| L |---->
-- +---+ +---+
-- .
-- .
-- +---+
-- | R |---->
-- +---+
-- The A element here is a PC_Alt node, and the dotted line represents
-- the contents of the Alt field. When the PC_Alt element is matched,
-- it stacks a pointer to the leading element of R on the history stack
-- so that on subsequent failure, a match of R is attempted.
-- The A node is the higest numbered element in the pattern. The
-- original index numbers of R are unchanged, but the index numbers
-- of the L pattern are adjusted up by the count of elements in R.
-- Note that the difference between the index of the L leading element
-- the index of the R leading element (after building the alt structure)
-- indicates the number of nodes in L, and this is true even after the
-- structure is incorporated into some larger structure. For example,
-- if the A node has index 16, and L has index 15 and R has index
-- 5, then we know that L has 10 (15-5) elements in it.
-- Suppose that we now concatenate this structure to another pattern
-- with 9 elements in it. We will now have the A node with an index
-- of 25, L with an index of 24 and R with an index of 14. We still
-- know that L has 10 (24-14) elements in it, numbered 15-24, and
-- consequently the successor of the alternation structure has an
-- index with a value less than 15. This is used in Image to figure
-- out the original recursive structure of a pattern.
-- To clarify the interaction of the alternation and concatenation
-- structures, here is a more complex example of the structure built
-- for the pattern:
-- (V or W or X) (Y or Z)
-- where A,B,C,D,E are all single element patterns:
-- +---+ +---+ +---+ +---+
-- I A I---->I V I---+-->I A I---->I Y I---->
-- +---+ +---+ I +---+ +---+
-- . I .
-- . I .
-- +---+ +---+ I +---+
-- I A I---->I W I-->I I Z I---->
-- +---+ +---+ I +---+
-- . I
-- . I
-- +---+ I
-- I X I------------>+
-- +---+
-- The numbering of the nodes would be as follows:
-- +---+ +---+ +---+ +---+
-- I 8 I---->I 7 I---+-->I 3 I---->I 2 I---->
-- +---+ +---+ I +---+ +---+
-- . I .
-- . I .
-- +---+ +---+ I +---+
-- I 6 I---->I 5 I-->I I 1 I---->
-- +---+ +---+ I +---+
-- . I
-- . I
-- +---+ I
-- I 4 I------------>+
-- +---+
-- Note: The above structure actually corresponds to
-- (A or (B or C)) (D or E)
-- rather than
-- ((A or B) or C) (D or E)
-- which is the more natural interpretation, but in fact alternation
-- is associative, and the construction of an alternative changes the
-- left grouped pattern to the right grouped pattern in any case, so
-- that the Image function produces a more natural looking output.
---------
-- Arb --
---------
-- An Arb pattern builds the structure
-- +---+
-- | X |---->
-- +---+
-- .
-- .
-- +---+
-- | Y |---->
-- +---+
-- The X node is a PC_Arb_X node, which matches null, and stacks a
-- pointer to Y node, which is the PC_Arb_Y node that matches one
-- extra character and restacks itself.
-- The PC_Arb_X node is numbered 2, and the PC_Arb_Y node is 1.
-------------------------
-- Arbno (simple case) --
-------------------------
-- The simple form of Arbno can be used where the pattern always
-- matches at least one character if it succeeds, and it is known
-- not to make any history stack entries. In this case, Arbno (P)
-- can construct the following structure:
-- +-------------+
-- | ^
-- V |
-- +---+ |
-- | S |----> |
-- +---+ |
-- . |
-- . |
-- +---+ |
-- | P |---------->+
-- +---+
-- The S (PC_Arbno_S) node matches null stacking a pointer to the
-- pattern P. If a subsequent failure causes P to be matched and
-- this match succeeds, then node A gets restacked to try another
-- instance if needed by a subsequent failure.
-- The node numbering of the constituent pattern P is not affected.
-- The S node has a node number of P.Index + 1.
--------------------------
-- Arbno (complex case) --
--------------------------
-- A call to Arbno (P), where P can match null (or at least is not
-- known to require a non-null string) and/or P requires pattern stack
-- entries, constructs the following structure:
-- +--------------------------+
-- | ^
-- V |
-- +---+ |
-- | X |----> |
-- +---+ |
-- . |
-- . |
-- +---+ +---+ +---+ |
-- | E |---->| P |---->| Y |--->+
-- +---+ +---+ +---+
-- The node X (PC_Arbno_X) matches null, stacking a pointer to the
-- E-P-X structure used to match one Arbno instance.
-- Here E is the PC_R_Enter node which matches null and creates two
-- stack entries. The first is a special entry whose node field is
-- not used at all, and whose cursor field has the initial cursor.
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the pattern P is matched, and it can
-- make history stack entries in the normal manner, so now the stack
-- looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack Base
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- If the match of P fails, then the PC_R_Remove entry is popped and
-- it removes both itself and the special entry underneath it,
-- restores the outer stack base, and signals failure.
-- If the match of P succeeds, then node Y, the PC_Arbno_Y node, pops
-- the inner region. There are two possibilities. If matching P left
-- no stack entries, then all traces of the inner region can be removed.
-- If there are stack entries, then we push an PC_Region_Replace stack
-- entry whose "cursor" value is the inner stack base value, and then
-- restore the outer stack base value, so the stack looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Region_Replace entry, "cursor" value is (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- Now that we have matched another instance of the Arbno pattern,
-- we need to move to the successor. There are two cases. If the
-- Arbno pattern matched null, then there is no point in seeking
-- alternatives, since we would just match a whole bunch of nulls.
-- In this case we look through the alternative node, and move
-- directly to its successor (i.e. the successor of the Arbno
-- pattern). If on the other hand a non-null string was matched,
-- we simply follow the successor to the alternative node, which
-- sets up for another possible match of the Arbno pattern.
-- As noted in the section on stack checking, the stack count (and
-- hence the stack check) for a pattern includes only one iteration
-- of the Arbno pattern. To make sure that multiple iterations do not
-- overflow the stack, the Arbno node saves the stack count required
-- by a single iteration, and the Concat function increments this to
-- include stack entries required by any successor. The PC_Arbno_Y
-- node uses this count to ensure that sufficient stack remains
-- before proceeding after matching each new instance.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the Y node is numbered N + 1,
-- the E node is N + 2, and the X node is N + 3.
----------------------
-- Assign Immediate --
----------------------
-- Immediate assignment (P * V) constructs the following structure
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node which matches null and creates two
-- stack entries. The first is a special entry whose node field is
-- not used at all, and whose cursor field has the initial cursor.
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the pattern P is matched, and it can
-- make history stack entries in the normal manner, so now the stack
-- looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack Base
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- If the match of P fails, then the PC_R_Remove entry is popped
-- and it removes both itself and the special entry underneath it,
-- restores the outer stack base, and signals failure.
-- If the match of P succeeds, then node A, which is the actual
-- PC_Assign_Imm node, executes the assignment (using the stack
-- base to locate the entry with the saved starting cursor value),
-- and the pops the inner region. There are two possibilities, if
-- matching P left no stack entries, then all traces of the inner
-- region can be removed. If there are stack entries, then we push
-- an PC_Region_Replace stack entry whose "cursor" value is the
-- inner stack base value, and then restore the outer stack base
-- value, so the stack looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node field not used,
-- used only to save initial cursor)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Region_Replace entry, "cursor" value is the (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- If a subsequent failure occurs, the PC_Region_Replace node restores
-- the inner stack base value and signals failure to explore rematches
-- of the pattern P.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
---------------------
-- Assign On Match --
---------------------
-- The assign on match (**) pattern is quite similar to the assign
-- immediate pattern, except that the actual assignment has to be
-- delayed. The following structure is constructed:
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- The operation of this pattern is identical to that described above
-- for deferred assignment, up to the point where P has been matched.
-- The A node, which is the PC_Assign_OnM node first pushes a
-- PC_Assign node onto the history stack. This node saves the ending
-- cursor and acts as a flag for the final assignment, as further
-- described below.
-- It then stores a pointer to itself in the special entry node field.
-- This was otherwise unused, and is now used to retrive the address
-- of the variable to be assigned at the end of the pattern.
-- After that the inner region is terminated in the usual manner,
-- by stacking a PC_R_Restore entry as described for the assign
-- immediate case. Note that the optimization of completely
-- removing the inner region does not happen in this case, since
-- we have at least one stack entry (the PC_Assign one we just made).
-- The stack now looks like:
-- (stack entries made before assign pattern)
-- (Special entry, node points to copy of
-- the PC_Assign_OnM node, and the
-- cursor field saves the initial cursor).
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Assign entry, saves final cursor)
-- (PC_Region_Replace entry, "cursor" value is (negative)
-- stack pointer value referencing the PC_R_Remove entry).
-- If a subsequent failure causes the PC_Assign node to execute it
-- simply removes itself and propagates the failure.
-- If the match succeeds, then the history stack is scanned for
-- PC_Assign nodes, and the assignments are executed (examination
-- of the above diagram will show that all the necessary data is
-- at hand for the assignment).
-- To optimize the common case where no assign-on-match operations
-- are present, a global flag Assign_OnM is maintained which is
-- initialize to False, and gets set True as part of the execution
-- of the PC_Assign_OnM node. The scan of the history stack for
-- PC_Assign entries is done only if this flag is set.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
---------
-- Bal --
---------
-- Bal builds a single node:
-- +---+
-- | B |---->
-- +---+
-- The node B is the PC_Bal node which matches a parentheses balanced
-- string, starting at the current cursor position. It then updates
-- the cursor past this matched string, and stacks a pointer to itself
-- with this updated cursor value on the history stack, to extend the
-- matched string on a subequent failure.
-- Since this is a single node it is numbered 1 (the reason we include
-- it in the compound patterns section is that it backtracks).
------------
-- BreakX --
------------
-- BreakX builds the structure
-- +---+ +---+
-- | B |---->| A |---->
-- +---+ +---+
-- ^ .
-- | .
-- | +---+
-- +<------| X |
-- +---+
-- Here the B node is the BreakX_xx node that performs a normal Break
-- function. The A node is an alternative (PC_Alt) node that matches
-- null, but stacks a pointer to node X (the PC_BreakX_X node) which
-- extends the match one character (to eat up the previously detected
-- break character), and then rematches the break.
-- The B node is numbered 3, the alternative node is 1, and the X
-- node is 2.
-----------
-- Fence --
-----------
-- Fence builds a single node:
-- +---+
-- | F |---->
-- +---+
-- The element F, PC_Fence, matches null, and stacks a pointer to a
-- PC_Cancel element which will abort the match on a subsequent failure.
-- Since this is a single element it is numbered 1 (the reason we
-- include it in the compound patterns section is that it backtracks).
--------------------
-- Fence Function --
--------------------
-- A call to the Fence function builds the structure:
-- +---+ +---+ +---+
-- | E |---->| P |---->| X |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node which matches null and creates two
-- stack entries. The first is a special entry which is not used at
-- all in the fence case (it is present merely for uniformity with
-- other cases of region enter operations).
-- The second entry corresponds to a standard new region action. A
-- PC_R_Remove node is stacked, whose cursor field is used to store
-- the outer stack base, and the stack base is reset to point to
-- this PC_R_Remove node. Then the pattern P is matched, and it can
-- make history stack entries in the normal manner, so now the stack
-- looks like:
-- (stack entries made before fence pattern)
-- (Special entry, not used at all)
-- (PC_R_Remove entry, "cursor" value is (negative) <-- Stack Base
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- If the match of P fails, then the PC_R_Remove entry is popped
-- and it removes both itself and the special entry underneath it,
-- restores the outer stack base, and signals failure.
-- If the match of P succeeds, then node X, the PC_Fence_X node, gets
-- control. One might be tempted to think that at this point, the
-- history stack entries made by matching P can just be removed since
-- they certainly are not going to be used for rematching (that is
-- whole point of Fence after all!) However, this is wrong, because
-- it would result in the loss of possible assign-on-match entries
-- for deferred pattern assignments.
-- Instead what we do is to make a special entry whose node references
-- PC_Fence_Y, and whose cursor saves the inner stack base value, i.e.
-- the pointer to the PC_R_Remove entry. Then the outer stack base
-- pointer is restored, so the stack looks like:
-- (stack entries made before assign pattern)
-- (Special entry, not used at all)
-- (PC_R_Remove entry, "cursor" value is (negative)
-- saved base value for the enclosing region)
-- (stack entries made by matching P)
-- (PC_Fence_Y entry, "cursor" value is (negative) stack
-- pointer value referencing the PC_R_Remove entry).
-- If a subsequent failure occurs, then the PC_Fence_Y entry removes
-- the entire inner region, including all entries made by matching P,
-- and alternatives prior to the Fence pattern are sought.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the X node is numbered N + 1,
-- and the E node is N + 2.
-------------
-- Succeed --
-------------
-- Succeed builds a single node:
-- +---+
-- | S |---->
-- +---+
-- The node S is the PC_Succeed node which matches null, and stacks
-- a pointer to itself on the history stack, so that a subsequent
-- failure repeats the same match.
-- Since this is a single node it is numbered 1 (the reason we include
-- it in the compound patterns section is that it backtracks).
---------------------
-- Write Immediate --
---------------------
-- The structure built for a write immediate operation (P * F, where
-- F is a file access value) is:
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node and W is the PC_Write_Imm node. The
-- handling is identical to that described above for Assign Immediate,
-- except that at the point where a successful match occurs, the matched
-- substring is written to the referenced file.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
--------------------
-- Write On Match --
--------------------
-- The structure built for a write on match operation (P ** F, where
-- F is a file access value) is:
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- Here E is the PC_R_Enter node and W is the PC_Write_OnM node. The
-- handling is identical to that described above for Assign On Match,
-- except that at the point where a successful match has completed,
-- the matched substring is written to the referenced file.
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
-----------------------
-- Constant Patterns --
-----------------------
-- The following pattern elements are referenced only from the pattern
-- history stack. In each case the processing for the pattern element
-- results in pattern match abort, or futher failure, so there is no
-- need for a successor and no need for a node number
CP_Assign : aliased PE := (PC_Assign, 0, N);
CP_Cancel : aliased PE := (PC_Cancel, 0, N);
CP_Fence_Y : aliased PE := (PC_Fence_Y, 0, N);
CP_R_Remove : aliased PE := (PC_R_Remove, 0, N);
CP_R_Restore : aliased PE := (PC_R_Restore, 0, N);
-----------------------
-- Local Subprograms --
-----------------------
function Alternate (L, R : PE_Ptr) return PE_Ptr;
function "or" (L, R : PE_Ptr) return PE_Ptr renames Alternate;
-- Build pattern structure corresponding to the alternation of L, R.
-- (i.e. try to match L, and if that fails, try to match R).
function Arbno_Simple (P : PE_Ptr) return PE_Ptr;
-- Build simple Arbno pattern, P is a pattern that is guaranteed to
-- match at least one character if it succeeds and to require no
-- stack entries under all circumstances. The result returned is
-- a simple Arbno structure as previously described.
function Bracket (E, P, A : PE_Ptr) return PE_Ptr;
-- Given two single node pattern elements E and A, and a (possible
-- complex) pattern P, construct the concatenation E-->P-->A and
-- return a pointer to E. The concatenation does not affect the
-- node numbering in P. A has a number one higher than the maximum
-- number in P, and E has a number two higher than the maximum
-- number in P (see for example the Assign_Immediate structure to
-- understand a typical use of this function).
function BreakX_Make (B : PE_Ptr) return Pattern;
-- Given a pattern element for a Break patternx, returns the
-- corresponding BreakX compound pattern structure.
function Concat (L, R : PE_Ptr; Incr : Natural) return PE_Ptr;
-- Creates a pattern eelement that represents a concatenation of the
-- two given pattern elements (i.e. the pattern L followed by R).
-- The result returned is always the same as L, but the pattern
-- referenced by L is modified to have R as a successor. This
-- procedure does not copy L or R, so if a copy is required, it
-- is the responsibility of the caller. The Incr parameter is an
-- amount to be added to the Nat field of any P_Arbno_Y node that is
-- in the left operand, it represents the additional stack space
-- required by the right operand.
function "&" (L, R : PE_Ptr) return PE_Ptr;
pragma Inline ("&");
-- Equivalent to Concat (L, R, 0)
function C_To_PE (C : PChar) return PE_Ptr;
-- Given a character, constructs a pattern element that matches
-- the single character.
function Copy (P : PE_Ptr) return PE_Ptr;
-- Creates a copy of the pattern element referenced by the given
-- pattern element reference. This is a deep copy, which means that
-- it follows the Next and Alt pointers.
function Image (P : PE_Ptr) return String;
-- Returns the image of the address of the referenced pattern element.
-- This is equivalent to Image (To_Address (P));
function Is_In (C : Character; Str : String) return Boolean;
pragma Inline (Is_In);
-- Determines if the character C is in string Str.
procedure Logic_Error;
-- Called to raise Program_Error with an appropriate message if an
-- internal logic error is detected.
function Str_BF (A : Boolean_Func) return String;
function Str_FP (A : File_Ptr) return String;
function Str_NF (A : Natural_Func) return String;
function Str_NP (A : Natural_Ptr) return String;
function Str_PP (A : Pattern_Ptr) return String;
function Str_VF (A : VString_Func) return String;
function Str_VP (A : VString_Ptr) return String;
-- These are debugging routines, which return a representation of the
-- given access value (they are called only by Image and Dump)
procedure Set_Successor (Pat : PE_Ptr; Succ : PE_Ptr);
-- Adjusts all EOP pointers in Pat to point to Succ. No other changes
-- are made. In particular, Succ is unchanged, and no index numbers
-- are modified. Note that Pat may not be equal to EOP on entry.
function S_To_PE (Str : PString) return PE_Ptr;
-- Given a string, constructs a pattern element that matches the string
procedure Uninitialized_Pattern;
pragma No_Return (Uninitialized_Pattern);
-- Called to raise Program_Error with an appropriate error message if
-- an uninitialized pattern is used in any pattern construction or
-- pattern matching operation.
procedure XMatch
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural);
-- This is the common pattern match routine. It is passed a string and
-- a pattern, and it indicates success or failure, and on success the
-- section of the string matched. It does not perform any assignments
-- to the subject string, so pattern replacement is for the caller.
--
-- Subject The subject string. The lower bound is always one. In the
-- Match procedures, it is fine to use strings whose lower bound
-- is not one, but we perform a one time conversion before the
-- call to XMatch, so that XMatch does not have to be bothered
-- with strange lower bounds.
--
-- Pat_P Points to initial pattern element of pattern to be matched
--
-- Pat_S Maximum required stack entries for pattern to be matched
--
-- Start If match is successful, starting index of matched section.
-- This value is always non-zero. A value of zero is used to
-- indicate a failed match.
--
-- Stop If match is successful, ending index of matched section.
-- This can be zero if we match the null string at the start,
-- in which case Start is set to zero, and Stop to one. If the
-- Match fails, then the contents of Stop is undefined.
procedure XMatchD
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural);
-- Identical in all respects to XMatch, except that trace information is
-- output on Standard_Output during execution of the match. This is the
-- version that is called if the original Match call has Debug => True.
---------
-- "&" --
---------
function "&" (L : PString; R : Pattern) return Pattern is
begin
return (AFC with R.Stk, Concat (S_To_PE (L), Copy (R.P), R.Stk));
end "&";
function "&" (L : Pattern; R : PString) return Pattern is
begin
return (AFC with L.Stk, Concat (Copy (L.P), S_To_PE (R), 0));
end "&";
function "&" (L : PChar; R : Pattern) return Pattern is
begin
return (AFC with R.Stk, Concat (C_To_PE (L), Copy (R.P), R.Stk));
end "&";
function "&" (L : Pattern; R : PChar) return Pattern is
begin
return (AFC with L.Stk, Concat (Copy (L.P), C_To_PE (R), 0));
end "&";
function "&" (L : Pattern; R : Pattern) return Pattern is
begin
return (AFC with L.Stk + R.Stk, Concat (Copy (L.P), Copy (R.P), R.Stk));
end "&";
function "&" (L, R : PE_Ptr) return PE_Ptr is
begin
return Concat (L, R, 0);
end "&";
---------
-- "*" --
---------
-- Assign immediate
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
function "*" (P : Pattern; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_Imm, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with P.Stk + 3, Bracket (E, Pat, A));
end "*";
function "*" (P : PString; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_Imm, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "*";
function "*" (P : PChar; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_Imm, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "*";
-- Write immediate
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
function "*" (P : Pattern; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_Imm, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "*";
function "*" (P : PString; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_Imm, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "*";
function "*" (P : PChar; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_Imm, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "*";
----------
-- "**" --
----------
-- Assign on match
-- +---+ +---+ +---+
-- | E |---->| P |---->| A |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the A node is numbered N + 1,
-- and the E node is N + 2.
function "**" (P : Pattern; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_OnM, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with P.Stk + 3, Bracket (E, Pat, A));
end "**";
function "**" (P : PString; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_OnM, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "**";
function "**" (P : PChar; Var : VString_Var) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
A : constant PE_Ptr :=
new PE'(PC_Assign_OnM, 0, EOP, Var'Unrestricted_Access);
begin
return (AFC with 3, Bracket (E, Pat, A));
end "**";
-- Write on match
-- +---+ +---+ +---+
-- | E |---->| P |---->| W |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the W node is numbered N + 1,
-- and the E node is N + 2.
function "**" (P : Pattern; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_OnM, 0, EOP, Fil);
begin
return (AFC with P.Stk + 3, Bracket (E, Pat, W));
end "**";
function "**" (P : PString; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := S_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_OnM, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "**";
function "**" (P : PChar; Fil : File_Access) return Pattern is
Pat : constant PE_Ptr := C_To_PE (P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
W : constant PE_Ptr := new PE'(PC_Write_OnM, 0, EOP, Fil);
begin
return (AFC with 3, Bracket (E, Pat, W));
end "**";
---------
-- "+" --
---------
function "+" (Str : VString_Var) return Pattern is
begin
return
(AFC with 0,
new PE'(PC_String_VP, 1, EOP, Str'Unrestricted_Access));
end "+";
function "+" (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_String_VF, 1, EOP, Str));
end "+";
function "+" (P : Pattern_Var) return Pattern is
begin
return
(AFC with 3,
new PE'(PC_Rpat, 1, EOP, P'Unrestricted_Access));
end "+";
function "+" (P : Boolean_Func) return Pattern is
begin
return (AFC with 3, new PE'(PC_Pred_Func, 1, EOP, P));
end "+";
----------
-- "or" --
----------
function "or" (L : PString; R : Pattern) return Pattern is
begin
return (AFC with R.Stk + 1, S_To_PE (L) or Copy (R.P));
end "or";
function "or" (L : Pattern; R : PString) return Pattern is
begin
return (AFC with L.Stk + 1, Copy (L.P) or S_To_PE (R));
end "or";
function "or" (L : PString; R : PString) return Pattern is
begin
return (AFC with 1, S_To_PE (L) or S_To_PE (R));
end "or";
function "or" (L : Pattern; R : Pattern) return Pattern is
begin
return (AFC with
Natural'Max (L.Stk, R.Stk) + 1, Copy (L.P) or Copy (R.P));
end "or";
function "or" (L : PChar; R : Pattern) return Pattern is
begin
return (AFC with 1, C_To_PE (L) or Copy (R.P));
end "or";
function "or" (L : Pattern; R : PChar) return Pattern is
begin
return (AFC with 1, Copy (L.P) or C_To_PE (R));
end "or";
function "or" (L : PChar; R : PChar) return Pattern is
begin
return (AFC with 1, C_To_PE (L) or C_To_PE (R));
end "or";
function "or" (L : PString; R : PChar) return Pattern is
begin
return (AFC with 1, S_To_PE (L) or C_To_PE (R));
end "or";
function "or" (L : PChar; R : PString) return Pattern is
begin
return (AFC with 1, C_To_PE (L) or S_To_PE (R));
end "or";
------------
-- Adjust --
------------
-- No two patterns share the same pattern elements, so the adjust
-- procedure for a Pattern assignment must do a deep copy of the
-- pattern element structure.
procedure Adjust (Object : in out Pattern) is
begin
Object.P := Copy (Object.P);
end Adjust;
---------------
-- Alternate --
---------------
function Alternate (L, R : PE_Ptr) return PE_Ptr is
begin
-- If the left pattern is null, then we just add the alternation
-- node with an index one greater than the right hand pattern.
if L = EOP then
return new PE'(PC_Alt, R.Index + 1, EOP, R);
-- If the left pattern is non-null, then build a reference vector
-- for its elements, and adjust their index values to acccomodate
-- the right hand elements. Then add the alternation node.
else
declare
Refs : Ref_Array (1 .. L.Index);
begin
Build_Ref_Array (L, Refs);
for J in Refs'Range loop
Refs (J).Index := Refs (J).Index + R.Index;
end loop;
end;
return new PE'(PC_Alt, L.Index + 1, L, R);
end if;
end Alternate;
---------
-- Any --
---------
function Any (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_CS, 1, EOP, To_Set (Str)));
end Any;
function Any (Str : VString) return Pattern is
begin
return Any (S (Str));
end Any;
function Any (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_CH, 1, EOP, Str));
end Any;
function Any (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_CS, 1, EOP, Str));
end Any;
function Any (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_VP, 1, EOP, VString_Ptr (Str)));
end Any;
function Any (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Any_VF, 1, EOP, Str));
end Any;
---------
-- Arb --
---------
-- +---+
-- | X |---->
-- +---+
-- .
-- .
-- +---+
-- | Y |---->
-- +---+
-- The PC_Arb_X element is numbered 2, and the PC_Arb_Y element is 1.
function Arb return Pattern is
Y : constant PE_Ptr := new PE'(PC_Arb_Y, 1, EOP);
X : constant PE_Ptr := new PE'(PC_Arb_X, 2, EOP, Y);
begin
return (AFC with 1, X);
end Arb;
-----------
-- Arbno --
-----------
function Arbno (P : PString) return Pattern is
begin
if P'Length = 0 then
return (AFC with 0, EOP);
else
return (AFC with 0, Arbno_Simple (S_To_PE (P)));
end if;
end Arbno;
function Arbno (P : PChar) return Pattern is
begin
return (AFC with 0, Arbno_Simple (C_To_PE (P)));
end Arbno;
function Arbno (P : Pattern) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
begin
if P.Stk = 0
and then OK_For_Simple_Arbno (Pat.Pcode)
then
return (AFC with 0, Arbno_Simple (Pat));
end if;
-- This is the complex case, either the pattern makes stack entries
-- or it is possible for the pattern to match the null string (more
-- accurately, we don't know that this is not the case).
-- +--------------------------+
-- | ^
-- V |
-- +---+ |
-- | X |----> |
-- +---+ |
-- . |
-- . |
-- +---+ +---+ +---+ |
-- | E |---->| P |---->| Y |--->+
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the Y node is numbered N + 1,
-- the E node is N + 2, and the X node is N + 3.
declare
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
X : constant PE_Ptr := new PE'(PC_Arbno_X, 0, EOP, E);
Y : constant PE_Ptr := new PE'(PC_Arbno_Y, 0, X, P.Stk + 3);
EPY : constant PE_Ptr := Bracket (E, Pat, Y);
begin
X.Alt := EPY;
X.Index := EPY.Index + 1;
return (AFC with P.Stk + 3, X);
end;
end Arbno;
------------------
-- Arbno_Simple --
------------------
-- +-------------+
-- | ^
-- V |
-- +---+ |
-- | S |----> |
-- +---+ |
-- . |
-- . |
-- +---+ |
-- | P |---------->+
-- +---+
-- The node numbering of the constituent pattern P is not affected.
-- The S node has a node number of P.Index + 1.
-- Note that we know that P cannot be EOP, because a null pattern
-- does not meet the requirements for simple Arbno.
function Arbno_Simple (P : PE_Ptr) return PE_Ptr is
S : constant PE_Ptr := new PE'(PC_Arbno_S, P.Index + 1, EOP, P);
begin
Set_Successor (P, S);
return S;
end Arbno_Simple;
---------
-- Bal --
---------
function Bal return Pattern is
begin
return (AFC with 1, new PE'(PC_Bal, 1, EOP));
end Bal;
-------------
-- Bracket --
-------------
function Bracket (E, P, A : PE_Ptr) return PE_Ptr is
begin
if P = EOP then
E.Pthen := A;
E.Index := 2;
A.Index := 1;
else
E.Pthen := P;
Set_Successor (P, A);
E.Index := P.Index + 2;
A.Index := P.Index + 1;
end if;
return E;
end Bracket;
-----------
-- Break --
-----------
function Break (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_CS, 1, EOP, To_Set (Str)));
end Break;
function Break (Str : VString) return Pattern is
begin
return Break (S (Str));
end Break;
function Break (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_CH, 1, EOP, Str));
end Break;
function Break (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_CS, 1, EOP, Str));
end Break;
function Break (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_VP, 1, EOP, VString_Ptr (Str)));
end Break;
function Break (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Break_VF, 1, EOP, Str));
end Break;
------------
-- BreakX --
------------
function BreakX (Str : String) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_CS, 3, N, To_Set (Str)));
end BreakX;
function BreakX (Str : VString) return Pattern is
begin
return BreakX (S (Str));
end BreakX;
function BreakX (Str : Character) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_CH, 3, N, Str));
end BreakX;
function BreakX (Str : Character_Set) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_CS, 3, N, Str));
end BreakX;
function BreakX (Str : access VString) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_VP, 3, N, VString_Ptr (Str)));
end BreakX;
function BreakX (Str : VString_Func) return Pattern is
begin
return BreakX_Make (new PE'(PC_BreakX_VF, 3, N, Str));
end BreakX;
-----------------
-- BreakX_Make --
-----------------
-- +---+ +---+
-- | B |---->| A |---->
-- +---+ +---+
-- ^ .
-- | .
-- | +---+
-- +<------| X |
-- +---+
-- The B node is numbered 3, the alternative node is 1, and the X
-- node is 2.
function BreakX_Make (B : PE_Ptr) return Pattern is
X : constant PE_Ptr := new PE'(PC_BreakX_X, 2, B);
A : constant PE_Ptr := new PE'(PC_Alt, 1, EOP, X);
begin
B.Pthen := A;
return (AFC with 2, B);
end BreakX_Make;
---------------------
-- Build_Ref_Array --
---------------------
procedure Build_Ref_Array (E : PE_Ptr; RA : out Ref_Array) is
procedure Record_PE (E : PE_Ptr);
-- Record given pattern element if not already recorded in RA,
-- and also record any referenced pattern elements recursively.
procedure Record_PE (E : PE_Ptr) is
begin
PutD (" Record_PE called with PE_Ptr = " & Image (E));
if E = EOP or else RA (E.Index) /= null then
Put_LineD (", nothing to do");
return;
else
Put_LineD (", recording" & IndexT'Image (E.Index));
RA (E.Index) := E;
Record_PE (E.Pthen);
if E.Pcode in PC_Has_Alt then
Record_PE (E.Alt);
end if;
end if;
end Record_PE;
-- Start of processing for Build_Ref_Array
begin
New_LineD;
Put_LineD ("Entering Build_Ref_Array");
Record_PE (E);
New_LineD;
end Build_Ref_Array;
-------------
-- C_To_PE --
-------------
function C_To_PE (C : PChar) return PE_Ptr is
begin
return new PE'(PC_Char, 1, EOP, C);
end C_To_PE;
------------
-- Cancel --
------------
function Cancel return Pattern is
begin
return (AFC with 0, new PE'(PC_Cancel, 1, EOP));
end Cancel;
------------
-- Concat --
------------
-- Concat needs to traverse the left operand performing the following
-- set of fixups:
-- a) Any successor pointers (Pthen fields) that are set to EOP are
-- reset to point to the second operand.
-- b) Any PC_Arbno_Y node has its stack count field incremented
-- by the parameter Incr provided for this purpose.
-- d) Num fields of all pattern elements in the left operand are
-- adjusted to include the elements of the right operand.
-- Note: we do not use Set_Successor in the processing for Concat, since
-- there is no point in doing two traversals, we may as well do everything
-- at the same time.
function Concat (L, R : PE_Ptr; Incr : Natural) return PE_Ptr is
begin
if L = EOP then
return R;
elsif R = EOP then
return L;
else
declare
Refs : Ref_Array (1 .. L.Index);
-- We build a reference array for L whose N'th element points to
-- the pattern element of L whose original Index value is N.
P : PE_Ptr;
begin
Build_Ref_Array (L, Refs);
for J in Refs'Range loop
P := Refs (J);
P.Index := P.Index + R.Index;
if P.Pcode = PC_Arbno_Y then
P.Nat := P.Nat + Incr;
end if;
if P.Pthen = EOP then
P.Pthen := R;
end if;
if P.Pcode in PC_Has_Alt and then P.Alt = EOP then
P.Alt := R;
end if;
end loop;
end;
return L;
end if;
end Concat;
----------
-- Copy --
----------
function Copy (P : PE_Ptr) return PE_Ptr is
begin
if P = null then
Uninitialized_Pattern;
else
declare
Refs : Ref_Array (1 .. P.Index);
-- References to elements in P, indexed by Index field
Copy : Ref_Array (1 .. P.Index);
-- Holds copies of elements of P, indexed by Index field.
E : PE_Ptr;
begin
Build_Ref_Array (P, Refs);
-- Now copy all nodes
for J in Refs'Range loop
Copy (J) := new PE'(Refs (J).all);
end loop;
-- Adjust all internal references
for J in Copy'Range loop
E := Copy (J);
-- Adjust successor pointer to point to copy
if E.Pthen /= EOP then
E.Pthen := Copy (E.Pthen.Index);
end if;
-- Adjust Alt pointer if there is one to point to copy
if E.Pcode in PC_Has_Alt and then E.Alt /= EOP then
E.Alt := Copy (E.Alt.Index);
end if;
-- Copy referenced string
if E.Pcode = PC_String then
E.Str := new String'(E.Str.all);
end if;
end loop;
return Copy (P.Index);
end;
end if;
end Copy;
----------
-- Dump --
----------
procedure Dump (P : Pattern) is
subtype Count is Ada.Text_IO.Count;
Scol : Count;
-- Used to keep track of column in dump output
Refs : Ref_Array (1 .. P.P.Index);
-- We build a reference array whose N'th element points to the
-- pattern element whose Index value is N.
Cols : Natural := 2;
-- Number of columns used for pattern numbers, minimum is 2
E : PE_Ptr;
procedure Write_Node_Id (E : PE_Ptr);
-- Writes out a string identifying the given pattern element.
procedure Write_Node_Id (E : PE_Ptr) is
begin
if E = EOP then
Put ("EOP");
for J in 4 .. Cols loop
Put (' ');
end loop;
else
declare
Str : String (1 .. Cols);
N : Natural := Natural (E.Index);
begin
Put ("#");
for J in reverse Str'Range loop
Str (J) := Character'Val (48 + N mod 10);
N := N / 10;
end loop;
Put (Str);
end;
end if;
end Write_Node_Id;
begin
New_Line;
Put ("Pattern Dump Output (pattern at " &
Image (P'Address) &
", S = " & Natural'Image (P.Stk) & ')');
Scol := Col;
New_Line;
while Col < Scol loop
Put ('-');
end loop;
New_Line;
-- If uninitialized pattern, dump line and we are done
if P.P = null then
Put_Line ("Uninitialized pattern value");
return;
end if;
-- If null pattern, just dump it and we are all done
if P.P = EOP then
Put_Line ("EOP (null pattern)");
return;
end if;
Build_Ref_Array (P.P, Refs);
-- Set number of columns required for node numbers
while 10 ** Cols - 1 < Integer (P.P.Index) loop
Cols := Cols + 1;
end loop;
-- Now dump the nodes in reverse sequence. We output them in reverse
-- sequence since this corresponds to the natural order used to
-- construct the patterns.
for J in reverse Refs'Range loop
E := Refs (J);
Write_Node_Id (E);
Set_Col (Count (Cols) + 4);
Put (Image (E));
Put (" ");
Put (Pattern_Code'Image (E.Pcode));
Put (" ");
Set_Col (21 + Count (Cols) + Address_Image_Length);
Write_Node_Id (E.Pthen);
Set_Col (24 + 2 * Count (Cols) + Address_Image_Length);
case E.Pcode is
when PC_Alt |
PC_Arb_X |
PC_Arbno_S |
PC_Arbno_X =>
Write_Node_Id (E.Alt);
when PC_Rpat =>
Put (Str_PP (E.PP));
when PC_Pred_Func =>
Put (Str_BF (E.BF));
when PC_Assign_Imm |
PC_Assign_OnM |
PC_Any_VP |
PC_Break_VP |
PC_BreakX_VP |
PC_NotAny_VP |
PC_NSpan_VP |
PC_Span_VP |
PC_String_VP =>
Put (Str_VP (E.VP));
when PC_Write_Imm |
PC_Write_OnM =>
Put (Str_FP (E.FP));
when PC_String =>
Put (Image (E.Str.all));
when PC_String_2 =>
Put (Image (E.Str2));
when PC_String_3 =>
Put (Image (E.Str3));
when PC_String_4 =>
Put (Image (E.Str4));
when PC_String_5 =>
Put (Image (E.Str5));
when PC_String_6 =>
Put (Image (E.Str6));
when PC_Setcur =>
Put (Str_NP (E.Var));
when PC_Any_CH |
PC_Break_CH |
PC_BreakX_CH |
PC_Char |
PC_NotAny_CH |
PC_NSpan_CH |
PC_Span_CH =>
Put (''' & E.Char & ''');
when PC_Any_CS |
PC_Break_CS |
PC_BreakX_CS |
PC_NotAny_CS |
PC_NSpan_CS |
PC_Span_CS =>
Put ('"' & To_Sequence (E.CS) & '"');
when PC_Arbno_Y |
PC_Len_Nat |
PC_Pos_Nat |
PC_RPos_Nat |
PC_RTab_Nat |
PC_Tab_Nat =>
Put (S (E.Nat));
when PC_Pos_NF |
PC_Len_NF |
PC_RPos_NF |
PC_RTab_NF |
PC_Tab_NF =>
Put (Str_NF (E.NF));
when PC_Pos_NP |
PC_Len_NP |
PC_RPos_NP |
PC_RTab_NP |
PC_Tab_NP =>
Put (Str_NP (E.NP));
when PC_Any_VF |
PC_Break_VF |
PC_BreakX_VF |
PC_NotAny_VF |
PC_NSpan_VF |
PC_Span_VF |
PC_String_VF =>
Put (Str_VF (E.VF));
when others => null;
end case;
New_Line;
end loop;
New_Line;
end Dump;
----------
-- Fail --
----------
function Fail return Pattern is
begin
return (AFC with 0, new PE'(PC_Fail, 1, EOP));
end Fail;
-----------
-- Fence --
-----------
-- Simple case
function Fence return Pattern is
begin
return (AFC with 1, new PE'(PC_Fence, 1, EOP));
end Fence;
-- Function case
-- +---+ +---+ +---+
-- | E |---->| P |---->| X |---->
-- +---+ +---+ +---+
-- The node numbering of the constituent pattern P is not affected.
-- Where N is the number of nodes in P, the X node is numbered N + 1,
-- and the E node is N + 2.
function Fence (P : Pattern) return Pattern is
Pat : constant PE_Ptr := Copy (P.P);
E : constant PE_Ptr := new PE'(PC_R_Enter, 0, EOP);
X : constant PE_Ptr := new PE'(PC_Fence_X, 0, EOP);
begin
return (AFC with P.Stk + 1, Bracket (E, Pat, X));
end Fence;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Pattern) is
procedure Free is new Unchecked_Deallocation (PE, PE_Ptr);
procedure Free is new Unchecked_Deallocation (String, String_Ptr);
begin
-- Nothing to do if already freed
if Object.P = null then
return;
-- Otherwise we must free all elements
else
declare
Refs : Ref_Array (1 .. Object.P.Index);
-- References to elements in pattern to be finalized
begin
Build_Ref_Array (Object.P, Refs);
for J in Refs'Range loop
if Refs (J).Pcode = PC_String then
Free (Refs (J).Str);
end if;
Free (Refs (J));
end loop;
Object.P := null;
end;
end if;
end Finalize;
-----------
-- Image --
-----------
function Image (P : PE_Ptr) return String is
begin
return Image (To_Address (P));
end Image;
function Image (P : Pattern) return String is
begin
return S (Image (P));
end Image;
function Image (P : Pattern) return VString is
Kill_Ampersand : Boolean := False;
-- Set True to delete next & to be output to Result
Result : VString := Nul;
-- The result is accumulated here, using Append
Refs : Ref_Array (1 .. P.P.Index);
-- We build a reference array whose N'th element points to the
-- pattern element whose Index value is N.
procedure Delete_Ampersand;
-- Deletes the ampersand at the end of Result
procedure Image_Seq (E : PE_Ptr; Succ : PE_Ptr; Paren : Boolean);
-- E refers to a pattern structure whose successor is given by Succ.
-- This procedure appends to Result a representation of this pattern.
-- The Paren parameter indicates whether parentheses are required if
-- the output is more than one element.
procedure Image_One (E : in out PE_Ptr);
-- E refers to a pattern structure. This procedure appends to Result
-- a representation of the single simple or compound pattern structure
-- at the start of E and updates E to point to its successor.
----------------------
-- Delete_Ampersand --
----------------------
procedure Delete_Ampersand is
L : Natural := Length (Result);
begin
if L > 2 then
Delete (Result, L - 1, L);
end if;
end Delete_Ampersand;
---------------
-- Image_One --
---------------
procedure Image_One (E : in out PE_Ptr) is
ER : PE_Ptr := E.Pthen;
-- Successor set as result in E unless reset
begin
case E.Pcode is
when PC_Cancel =>
Append (Result, "Cancel");
when PC_Alt => Alt : declare
Elmts_In_L : constant IndexT := E.Pthen.Index - E.Alt.Index;
-- Number of elements in left pattern of alternation.
Lowest_In_L : constant IndexT := E.Index - Elmts_In_L;
-- Number of lowest index in elements of left pattern
E1 : PE_Ptr;
begin
-- The successor of the alternation node must have a lower
-- index than any node that is in the left pattern or a
-- higher index than the alternation node itself.
while ER /= EOP
and then ER.Index >= Lowest_In_L
and then ER.Index < E.Index
loop
ER := ER.Pthen;
end loop;
Append (Result, '(');
E1 := E;
loop
Image_Seq (E1.Pthen, ER, False);
Append (Result, " or ");
E1 := E1.Alt;
exit when E1.Pcode /= PC_Alt;
end loop;
Image_Seq (E1, ER, False);
Append (Result, ')');
end Alt;
when PC_Any_CS =>
Append (Result, "Any (" & Image (To_Sequence (E.CS)) & ')');
when PC_Any_VF =>
Append (Result, "Any (" & Str_VF (E.VF) & ')');
when PC_Any_VP =>
Append (Result, "Any (" & Str_VP (E.VP) & ')');
when PC_Arb_X =>
Append (Result, "Arb");
when PC_Arbno_S =>
Append (Result, "Arbno (");
Image_Seq (E.Alt, E, False);
Append (Result, ')');
when PC_Arbno_X =>
Append (Result, "Arbno (");
Image_Seq (E.Alt.Pthen, Refs (E.Index - 2), False);
Append (Result, ')');
when PC_Assign_Imm =>
Delete_Ampersand;
Append (Result, "* " & Str_VP (Refs (E.Index - 1).VP));
when PC_Assign_OnM =>
Delete_Ampersand;
Append (Result, "** " & Str_VP (Refs (E.Index - 1).VP));
when PC_Any_CH =>
Append (Result, "Any ('" & E.Char & "')");
when PC_Bal =>
Append (Result, "Bal");
when PC_Break_CH =>
Append (Result, "Break ('" & E.Char & "')");
when PC_Break_CS =>
Append (Result, "Break (" & Image (To_Sequence (E.CS)) & ')');
when PC_Break_VF =>
Append (Result, "Break (" & Str_VF (E.VF) & ')');
when PC_Break_VP =>
Append (Result, "Break (" & Str_VP (E.VP) & ')');
when PC_BreakX_CH =>
Append (Result, "BreakX ('" & E.Char & "')");
ER := ER.Pthen;
when PC_BreakX_CS =>
Append (Result, "BreakX (" & Image (To_Sequence (E.CS)) & ')');
ER := ER.Pthen;
when PC_BreakX_VF =>
Append (Result, "BreakX (" & Str_VF (E.VF) & ')');
ER := ER.Pthen;
when PC_BreakX_VP =>
Append (Result, "BreakX (" & Str_VP (E.VP) & ')');
ER := ER.Pthen;
when PC_Char =>
Append (Result, ''' & E.Char & ''');
when PC_Fail =>
Append (Result, "Fail");
when PC_Fence =>
Append (Result, "Fence");
when PC_Fence_X =>
Append (Result, "Fence (");
Image_Seq (E.Pthen, Refs (E.Index - 1), False);
Append (Result, ")");
ER := Refs (E.Index - 1).Pthen;
when PC_Len_Nat =>
Append (Result, "Len (" & E.Nat & ')');
when PC_Len_NF =>
Append (Result, "Len (" & Str_NF (E.NF) & ')');
when PC_Len_NP =>
Append (Result, "Len (" & Str_NP (E.NP) & ')');
when PC_NotAny_CH =>
Append (Result, "NotAny ('" & E.Char & "')");
when PC_NotAny_CS =>
Append (Result, "NotAny (" & Image (To_Sequence (E.CS)) & ')');
when PC_NotAny_VF =>
Append (Result, "NotAny (" & Str_VF (E.VF) & ')');
when PC_NotAny_VP =>
Append (Result, "NotAny (" & Str_VP (E.VP) & ')');
when PC_NSpan_CH =>
Append (Result, "NSpan ('" & E.Char & "')");
when PC_NSpan_CS =>
Append (Result, "NSpan (" & Image (To_Sequence (E.CS)) & ')');
when PC_NSpan_VF =>
Append (Result, "NSpan (" & Str_VF (E.VF) & ')');
when PC_NSpan_VP =>
Append (Result, "NSpan (" & Str_VP (E.VP) & ')');
when PC_Null =>
Append (Result, """""");
when PC_Pos_Nat =>
Append (Result, "Pos (" & E.Nat & ')');
when PC_Pos_NF =>
Append (Result, "Pos (" & Str_NF (E.NF) & ')');
when PC_Pos_NP =>
Append (Result, "Pos (" & Str_NP (E.NP) & ')');
when PC_R_Enter =>
Kill_Ampersand := True;
when PC_Rest =>
Append (Result, "Rest");
when PC_Rpat =>
Append (Result, "(+ " & Str_PP (E.PP) & ')');
when PC_Pred_Func =>
Append (Result, "(+ " & Str_BF (E.BF) & ')');
when PC_RPos_Nat =>
Append (Result, "RPos (" & E.Nat & ')');
when PC_RPos_NF =>
Append (Result, "RPos (" & Str_NF (E.NF) & ')');
when PC_RPos_NP =>
Append (Result, "RPos (" & Str_NP (E.NP) & ')');
when PC_RTab_Nat =>
Append (Result, "RTab (" & E.Nat & ')');
when PC_RTab_NF =>
Append (Result, "RTab (" & Str_NF (E.NF) & ')');
when PC_RTab_NP =>
Append (Result, "RTab (" & Str_NP (E.NP) & ')');
when PC_Setcur =>
Append (Result, "Setcur (" & Str_NP (E.Var) & ')');
when PC_Span_CH =>
Append (Result, "Span ('" & E.Char & "')");
when PC_Span_CS =>
Append (Result, "Span (" & Image (To_Sequence (E.CS)) & ')');
when PC_Span_VF =>
Append (Result, "Span (" & Str_VF (E.VF) & ')');
when PC_Span_VP =>
Append (Result, "Span (" & Str_VP (E.VP) & ')');
when PC_String =>
Append (Result, Image (E.Str.all));
when PC_String_2 =>
Append (Result, Image (E.Str2));
when PC_String_3 =>
Append (Result, Image (E.Str3));
when PC_String_4 =>
Append (Result, Image (E.Str4));
when PC_String_5 =>
Append (Result, Image (E.Str5));
when PC_String_6 =>
Append (Result, Image (E.Str6));
when PC_String_VF =>
Append (Result, "(+" & Str_VF (E.VF) & ')');
when PC_String_VP =>
Append (Result, "(+" & Str_VP (E.VP) & ')');
when PC_Succeed =>
Append (Result, "Succeed");
when PC_Tab_Nat =>
Append (Result, "Tab (" & E.Nat & ')');
when PC_Tab_NF =>
Append (Result, "Tab (" & Str_NF (E.NF) & ')');
when PC_Tab_NP =>
Append (Result, "Tab (" & Str_NP (E.NP) & ')');
when PC_Write_Imm =>
Append (Result, '(');
Image_Seq (E, Refs (E.Index - 1), True);
Append (Result, " * " & Str_FP (Refs (E.Index - 1).FP));
ER := Refs (E.Index - 1).Pthen;
when PC_Write_OnM =>
Append (Result, '(');
Image_Seq (E.Pthen, Refs (E.Index - 1), True);
Append (Result, " ** " & Str_FP (Refs (E.Index - 1).FP));
ER := Refs (E.Index - 1).Pthen;
-- Other pattern codes should not appear as leading elements
when PC_Arb_Y |
PC_Arbno_Y |
PC_Assign |
PC_BreakX_X |
PC_EOP |
PC_Fence_Y |
PC_R_Remove |
PC_R_Restore |
PC_Unanchored =>
Append (Result, "???");
end case;
E := ER;
end Image_One;
---------------
-- Image_Seq --
---------------
procedure Image_Seq (E : PE_Ptr; Succ : PE_Ptr; Paren : Boolean) is
E1 : PE_Ptr := E;
Mult : Boolean := False;
Indx : Natural := Length (Result);
begin
-- The image of EOP is "" (the null string)
if E = EOP then
Append (Result, """""");
-- Else generate appropriate concatenation sequence
else
loop
Image_One (E1);
exit when E1 = Succ;
exit when E1 = EOP;
Mult := True;
if Kill_Ampersand then
Kill_Ampersand := False;
else
Append (Result, " & ");
end if;
end loop;
end if;
if Mult and Paren then
Insert (Result, Indx + 1, "(");
Append (Result, ")");
end if;
end Image_Seq;
-- Start of processing for Image
begin
Build_Ref_Array (P.P, Refs);
Image_Seq (P.P, EOP, False);
return Result;
end Image;
-----------
-- Is_In --
-----------
function Is_In (C : Character; Str : String) return Boolean is
begin
for J in Str'Range loop
if Str (J) = C then
return True;
end if;
end loop;
return False;
end Is_In;
---------
-- Len --
---------
function Len (Count : Natural) return Pattern is
begin
-- Note, the following is not just an optimization, it is needed
-- to ensure that Arbno (Len (0)) does not generate an infinite
-- matching loop (since PC_Len_Nat is OK_For_Simple_Arbno).
if Count = 0 then
return (AFC with 0, new PE'(PC_Null, 1, EOP));
else
return (AFC with 0, new PE'(PC_Len_Nat, 1, EOP, Count));
end if;
end Len;
function Len (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Len_NF, 1, EOP, Count));
end Len;
function Len (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Len_NP, 1, EOP, Natural_Ptr (Count)));
end Len;
-----------------
-- Logic_Error --
-----------------
procedure Logic_Error is
begin
Raise_Exception
(Program_Error'Identity,
"Internal logic error in GNAT.Spitbol.Patterns");
end Logic_Error;
-----------
-- Match --
-----------
function Match
(Subject : VString;
Pat : Pattern)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
return Start /= 0;
end Match;
function Match
(Subject : String;
Pat : Pattern)
return Boolean
is
Start, Stop : Natural;
subtype String1 is String (1 .. Subject'Length);
begin
if Debug_Mode then
XMatchD (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
else
XMatch (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
end if;
return Start /= 0;
end Match;
function Match
(Subject : VString_Var;
Pat : Pattern;
Replace : VString)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all,
Start, Stop, Get_String (Replace).all);
return True;
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : Pattern;
Replace : String)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all, Start, Stop, Replace);
return True;
end if;
end Match;
procedure Match
(Subject : VString;
Pat : Pattern)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
end Match;
procedure Match
(Subject : String;
Pat : Pattern)
is
Start, Stop : Natural;
subtype String1 is String (1 .. Subject'Length);
begin
if Debug_Mode then
XMatchD (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
else
XMatch (String1 (Subject), Pat.P, Pat.Stk, Start, Stop);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : Pattern;
Replace : VString)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Get_String (Replace).all);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : Pattern;
Replace : String)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Replace);
end if;
end Match;
function Match
(Subject : VString;
Pat : PString)
return Boolean
is
Pat_Len : constant Natural := Pat'Length;
Sub_Len : constant Natural := Length (Subject);
Sub_Str : constant String_Access := Get_String (Subject);
begin
if Anchored_Mode then
if Pat_Len > Sub_Len then
return False;
else
return Pat = Sub_Str.all (1 .. Pat_Len);
end if;
else
for J in 1 .. Sub_Len - Pat_Len + 1 loop
if Pat = Sub_Str.all (J .. J + (Pat_Len - 1)) then
return True;
end if;
end loop;
return False;
end if;
end Match;
function Match
(Subject : String;
Pat : PString)
return Boolean
is
Pat_Len : constant Natural := Pat'Length;
Sub_Len : constant Natural := Subject'Length;
SFirst : constant Natural := Subject'First;
begin
if Anchored_Mode then
if Pat_Len > Sub_Len then
return False;
else
return Pat = Subject (SFirst .. SFirst + Pat_Len - 1);
end if;
else
for J in SFirst .. SFirst + Sub_Len - Pat_Len loop
if Pat = Subject (J .. J + (Pat_Len - 1)) then
return True;
end if;
end loop;
return False;
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : PString;
Replace : VString)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all,
Start, Stop, Get_String (Replace).all);
return True;
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : PString;
Replace : String)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start = 0 then
return False;
else
Replace_Slice
(Subject'Unrestricted_Access.all, Start, Stop, Replace);
return True;
end if;
end Match;
procedure Match
(Subject : VString;
Pat : PString)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
end Match;
procedure Match
(Subject : String;
Pat : PString)
is
Start, Stop : Natural;
subtype String1 is String (1 .. Subject'Length);
begin
if Debug_Mode then
XMatchD (String1 (Subject), S_To_PE (Pat), 0, Start, Stop);
else
XMatch (String1 (Subject), S_To_PE (Pat), 0, Start, Stop);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : PString;
Replace : VString)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Get_String (Replace).all);
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : PString;
Replace : String)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
else
XMatch (Get_String (Subject).all, S_To_PE (Pat), 0, Start, Stop);
end if;
if Start /= 0 then
Replace_Slice (Subject, Start, Stop, Replace);
end if;
end Match;
function Match
(Subject : VString_Var;
Pat : Pattern;
Result : Match_Result_Var)
return Boolean
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
Result'Unrestricted_Access.all.Var := null;
return False;
else
Result'Unrestricted_Access.all.Var := Subject'Unrestricted_Access;
Result'Unrestricted_Access.all.Start := Start;
Result'Unrestricted_Access.all.Stop := Stop;
return True;
end if;
end Match;
procedure Match
(Subject : in out VString;
Pat : Pattern;
Result : out Match_Result)
is
Start, Stop : Natural;
begin
if Debug_Mode then
XMatchD (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
else
XMatch (Get_String (Subject).all, Pat.P, Pat.Stk, Start, Stop);
end if;
if Start = 0 then
Result.Var := null;
else
Result.Var := Subject'Unrestricted_Access;
Result.Start := Start;
Result.Stop := Stop;
end if;
end Match;
---------------
-- New_LineD --
---------------
procedure New_LineD is
begin
if Internal_Debug then
New_Line;
end if;
end New_LineD;
------------
-- NotAny --
------------
function NotAny (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_CS, 1, EOP, To_Set (Str)));
end NotAny;
function NotAny (Str : VString) return Pattern is
begin
return NotAny (S (Str));
end NotAny;
function NotAny (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_CH, 1, EOP, Str));
end NotAny;
function NotAny (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_CS, 1, EOP, Str));
end NotAny;
function NotAny (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_VP, 1, EOP, VString_Ptr (Str)));
end NotAny;
function NotAny (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_NotAny_VF, 1, EOP, Str));
end NotAny;
-----------
-- NSpan --
-----------
function NSpan (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_CS, 1, EOP, To_Set (Str)));
end NSpan;
function NSpan (Str : VString) return Pattern is
begin
return NSpan (S (Str));
end NSpan;
function NSpan (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_CH, 1, EOP, Str));
end NSpan;
function NSpan (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_CS, 1, EOP, Str));
end NSpan;
function NSpan (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_VP, 1, EOP, VString_Ptr (Str)));
end NSpan;
function NSpan (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_NSpan_VF, 1, EOP, Str));
end NSpan;
---------
-- Pos --
---------
function Pos (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Pos_Nat, 1, EOP, Count));
end Pos;
function Pos (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Pos_NF, 1, EOP, Count));
end Pos;
function Pos (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Pos_NP, 1, EOP, Natural_Ptr (Count)));
end Pos;
----------
-- PutD --
----------
procedure PutD (Str : String) is
begin
if Internal_Debug then
Put (Str);
end if;
end PutD;
---------------
-- Put_LineD --
---------------
procedure Put_LineD (Str : String) is
begin
if Internal_Debug then
Put_Line (Str);
end if;
end Put_LineD;
-------------
-- Replace --
-------------
procedure Replace
(Result : in out Match_Result;
Replace : VString)
is
begin
if Result.Var /= null then
Replace_Slice
(Result.Var.all,
Result.Start,
Result.Stop,
Get_String (Replace).all);
Result.Var := null;
end if;
end Replace;
----------
-- Rest --
----------
function Rest return Pattern is
begin
return (AFC with 0, new PE'(PC_Rest, 1, EOP));
end Rest;
----------
-- Rpos --
----------
function Rpos (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RPos_Nat, 1, EOP, Count));
end Rpos;
function Rpos (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_RPos_NF, 1, EOP, Count));
end Rpos;
function Rpos (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RPos_NP, 1, EOP, Natural_Ptr (Count)));
end Rpos;
----------
-- Rtab --
----------
function Rtab (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RTab_Nat, 1, EOP, Count));
end Rtab;
function Rtab (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_RTab_NF, 1, EOP, Count));
end Rtab;
function Rtab (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_RTab_NP, 1, EOP, Natural_Ptr (Count)));
end Rtab;
-------------
-- S_To_PE --
-------------
function S_To_PE (Str : PString) return PE_Ptr is
Len : constant Natural := Str'Length;
begin
case Len is
when 0 =>
return new PE'(PC_Null, 1, EOP);
when 1 =>
return new PE'(PC_Char, 1, EOP, Str (1));
when 2 =>
return new PE'(PC_String_2, 1, EOP, Str);
when 3 =>
return new PE'(PC_String_3, 1, EOP, Str);
when 4 =>
return new PE'(PC_String_4, 1, EOP, Str);
when 5 =>
return new PE'(PC_String_5, 1, EOP, Str);
when 6 =>
return new PE'(PC_String_6, 1, EOP, Str);
when others =>
return new PE'(PC_String, 1, EOP, new String'(Str));
end case;
end S_To_PE;
-------------------
-- Set_Successor --
-------------------
-- Note: this procedure is not used by the normal concatenation circuit,
-- since other fixups are required on the left operand in this case, and
-- they might as well be done all together.
procedure Set_Successor (Pat : PE_Ptr; Succ : PE_Ptr) is
begin
if Pat = null then
Uninitialized_Pattern;
elsif Pat = EOP then
Logic_Error;
else
declare
Refs : Ref_Array (1 .. Pat.Index);
-- We build a reference array for L whose N'th element points to
-- the pattern element of L whose original Index value is N.
P : PE_Ptr;
begin
Build_Ref_Array (Pat, Refs);
for J in Refs'Range loop
P := Refs (J);
if P.Pthen = EOP then
P.Pthen := Succ;
end if;
if P.Pcode in PC_Has_Alt and then P.Alt = EOP then
P.Alt := Succ;
end if;
end loop;
end;
end if;
end Set_Successor;
------------
-- Setcur --
------------
function Setcur (Var : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Setcur, 1, EOP, Natural_Ptr (Var)));
end Setcur;
----------
-- Span --
----------
function Span (Str : String) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_CS, 1, EOP, To_Set (Str)));
end Span;
function Span (Str : VString) return Pattern is
begin
return Span (S (Str));
end Span;
function Span (Str : Character) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_CH, 1, EOP, Str));
end Span;
function Span (Str : Character_Set) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_CS, 1, EOP, Str));
end Span;
function Span (Str : access VString) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_VP, 1, EOP, VString_Ptr (Str)));
end Span;
function Span (Str : VString_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Span_VF, 1, EOP, Str));
end Span;
------------
-- Str_BF --
------------
function Str_BF (A : Boolean_Func) return String is
function To_A is new Unchecked_Conversion (Boolean_Func, Address);
begin
return "BF(" & Image (To_A (A)) & ')';
end Str_BF;
------------
-- Str_FP --
------------
function Str_FP (A : File_Ptr) return String is
begin
return "FP(" & Image (A.all'Address) & ')';
end Str_FP;
------------
-- Str_NF --
------------
function Str_NF (A : Natural_Func) return String is
function To_A is new Unchecked_Conversion (Natural_Func, Address);
begin
return "NF(" & Image (To_A (A)) & ')';
end Str_NF;
------------
-- Str_NP --
------------
function Str_NP (A : Natural_Ptr) return String is
begin
return "NP(" & Image (A.all'Address) & ')';
end Str_NP;
------------
-- Str_PP --
------------
function Str_PP (A : Pattern_Ptr) return String is
begin
return "PP(" & Image (A.all'Address) & ')';
end Str_PP;
------------
-- Str_VF --
------------
function Str_VF (A : VString_Func) return String is
function To_A is new Unchecked_Conversion (VString_Func, Address);
begin
return "VF(" & Image (To_A (A)) & ')';
end Str_VF;
------------
-- Str_VP --
------------
function Str_VP (A : VString_Ptr) return String is
begin
return "VP(" & Image (A.all'Address) & ')';
end Str_VP;
-------------
-- Succeed --
-------------
function Succeed return Pattern is
begin
return (AFC with 1, new PE'(PC_Succeed, 1, EOP));
end Succeed;
---------
-- Tab --
---------
function Tab (Count : Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Tab_Nat, 1, EOP, Count));
end Tab;
function Tab (Count : Natural_Func) return Pattern is
begin
return (AFC with 0, new PE'(PC_Tab_NF, 1, EOP, Count));
end Tab;
function Tab (Count : access Natural) return Pattern is
begin
return (AFC with 0, new PE'(PC_Tab_NP, 1, EOP, Natural_Ptr (Count)));
end Tab;
---------------------------
-- Uninitialized_Pattern --
---------------------------
procedure Uninitialized_Pattern is
begin
Raise_Exception
(Program_Error'Identity,
"uninitialized value of type GNAT.Spitbol.Patterns.Pattern");
end Uninitialized_Pattern;
------------
-- XMatch --
------------
procedure XMatch
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural)
is
Node : PE_Ptr;
-- Pointer to current pattern node. Initialized from Pat_P, and then
-- updated as the match proceeds through its constituent elements.
Length : constant Natural := Subject'Length;
-- Length of string (= Subject'Last, since Subject'First is always 1)
Cursor : Integer := 0;
-- If the value is non-negative, then this value is the index showing
-- the current position of the match in the subject string. The next
-- character to be matched is at Subject (Cursor + 1). Note that since
-- our view of the subject string in XMatch always has a lower bound
-- of one, regardless of original bounds, that this definition exactly
-- corresponds to the cursor value as referenced by functions like Pos.
--
-- If the value is negative, then this is a saved stack pointer,
-- typically a base pointer of an inner or outer region. Cursor
-- temporarily holds such a value when it is popped from the stack
-- by Fail. In all cases, Cursor is reset to a proper non-negative
-- cursor value before the match proceeds (e.g. by propagating the
-- failure and popping a "real" cursor value from the stack.
PE_Unanchored : aliased PE := (PC_Unanchored, 0, Pat_P);
-- Dummy pattern element used in the unanchored case.
Stack : Stack_Type;
-- The pattern matching failure stack for this call to Match
Stack_Ptr : Stack_Range;
-- Current stack pointer. This points to the top element of the stack
-- that is currently in use. At the outer level this is the special
-- entry placed on the stack according to the anchor mode.
Stack_Init : constant Stack_Range := Stack'First + 1;
-- This is the initial value of the Stack_Ptr and Stack_Base. The
-- initial (Stack'First) element of the stack is not used so that
-- when we pop the last element off, Stack_Ptr is still in range.
Stack_Base : Stack_Range;
-- This value is the stack base value, i.e. the stack pointer for the
-- first history stack entry in the current stack region. See separate
-- section on handling of recursive pattern matches.
Assign_OnM : Boolean := False;
-- Set True if assign-on-match or write-on-match operations may be
-- present in the history stack, which must then be scanned on a
-- successful match.
procedure Pop_Region;
pragma Inline (Pop_Region);
-- Used at the end of processing of an inner region. if the inner
-- region left no stack entries, then all trace of it is removed.
-- Otherwise a PC_Restore_Region entry is pushed to ensure proper
-- handling of alternatives in the inner region.
procedure Push (Node : PE_Ptr);
pragma Inline (Push);
-- Make entry in pattern matching stack with current cursor valeu
procedure Push_Region;
pragma Inline (Push_Region);
-- This procedure makes a new region on the history stack. The
-- caller first establishes the special entry on the stack, but
-- does not push the stack pointer. Then this call stacks a
-- PC_Remove_Region node, on top of this entry, using the cursor
-- field of the PC_Remove_Region entry to save the outer level
-- stack base value, and resets the stack base to point to this
-- PC_Remove_Region node.
----------------
-- Pop_Region --
----------------
procedure Pop_Region is
begin
-- If nothing was pushed in the inner region, we can just get
-- rid of it entirely, leaving no traces that it was ever there
if Stack_Ptr = Stack_Base then
Stack_Ptr := Stack_Base - 2;
Stack_Base := Stack (Stack_Ptr + 2).Cursor;
-- If stuff was pushed in the inner region, then we have to
-- push a PC_R_Restore node so that we properly handle possible
-- rematches within the region.
else
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Restore'Access;
Stack_Base := Stack (Stack_Base).Cursor;
end if;
end Pop_Region;
----------
-- Push --
----------
procedure Push (Node : PE_Ptr) is
begin
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Cursor;
Stack (Stack_Ptr).Node := Node;
end Push;
-----------------
-- Push_Region --
-----------------
procedure Push_Region is
begin
Stack_Ptr := Stack_Ptr + 2;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Remove'Access;
Stack_Base := Stack_Ptr;
end Push_Region;
-- Start of processing for XMatch
begin
if Pat_P = null then
Uninitialized_Pattern;
end if;
-- Check we have enough stack for this pattern. This check deals with
-- every possibility except a match of a recursive pattern, where we
-- make a check at each recursion level.
if Pat_S >= Stack_Size - 1 then
raise Pattern_Stack_Overflow;
end if;
-- In anchored mode, the bottom entry on the stack is an abort entry
if Anchored_Mode then
Stack (Stack_Init).Node := CP_Cancel'Access;
Stack (Stack_Init).Cursor := 0;
-- In unanchored more, the bottom entry on the stack references
-- the special pattern element PE_Unanchored, whose Pthen field
-- points to the initial pattern element. The cursor value in this
-- entry is the number of anchor moves so far.
else
Stack (Stack_Init).Node := PE_Unanchored'Unchecked_Access;
Stack (Stack_Init).Cursor := 0;
end if;
Stack_Ptr := Stack_Init;
Stack_Base := Stack_Ptr;
Cursor := 0;
Node := Pat_P;
goto Match;
-----------------------------------------
-- Main Pattern Matching State Control --
-----------------------------------------
-- This is a state machine which uses gotos to change state. The
-- initial state is Match, to initiate the matching of the first
-- element, so the goto Match above starts the match. In the
-- following descriptions, we indicate the global values that
-- are relevant for the state transition.
-- Come here if entire match fails
<<Match_Fail>>
Start := 0;
Stop := 0;
return;
-- Come here if entire match succeeds
-- Cursor current position in subject string
<<Match_Succeed>>
Start := Stack (Stack_Init).Cursor + 1;
Stop := Cursor;
-- Scan history stack for deferred assignments or writes
if Assign_OnM then
for S in Stack_Init .. Stack_Ptr loop
if Stack (S).Node = CP_Assign'Access then
declare
Inner_Base : constant Stack_Range :=
Stack (S + 1).Cursor;
Special_Entry : constant Stack_Range :=
Inner_Base - 1;
Node_OnM : constant PE_Ptr :=
Stack (Special_Entry).Node;
Start : constant Natural :=
Stack (Special_Entry).Cursor + 1;
Stop : constant Natural := Stack (S).Cursor;
begin
if Node_OnM.Pcode = PC_Assign_OnM then
Set_String (Node_OnM.VP.all, Subject (Start .. Stop));
elsif Node_OnM.Pcode = PC_Write_OnM then
Put_Line (Node_OnM.FP.all, Subject (Start .. Stop));
else
Logic_Error;
end if;
end;
end if;
end loop;
end if;
return;
-- Come here if attempt to match current element fails
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Fail>>
Cursor := Stack (Stack_Ptr).Cursor;
Node := Stack (Stack_Ptr).Node;
Stack_Ptr := Stack_Ptr - 1;
goto Match;
-- Come here if attempt to match current element succeeds
-- Cursor current position in subject string
-- Node pointer to node successfully matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Succeed>>
Node := Node.Pthen;
-- Come here to match the next pattern element
-- Cursor current position in subject string
-- Node pointer to node to be matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Match>>
--------------------------------------------------
-- Main Pattern Match Element Matching Routines --
--------------------------------------------------
-- Here is the case statement that processes the current node. The
-- processing for each element does one of five things:
-- goto Succeed to move to the successor
-- goto Match_Succeed if the entire match succeeds
-- goto Match_Fail if the entire match fails
-- goto Fail to signal failure of current match
-- Processing is NOT allowed to fall through
case Node.Pcode is
-- Cancel
when PC_Cancel =>
goto Match_Fail;
-- Alternation
when PC_Alt =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Any (one character case)
when PC_Any_CH =>
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (character set case)
when PC_Any_CS =>
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (string function case)
when PC_Any_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Any (string pointer case)
when PC_Any_VP => declare
Str : constant String_Access := Get_String (Node.VP.all);
begin
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Arb (initial match)
when PC_Arb_X =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arb (extension)
when PC_Arb_Y =>
if Cursor < Length then
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
else
goto Fail;
end if;
-- Arbno_S (simple Arbno initialize). This is the node that
-- initiates the match of a simple Arbno structure.
when PC_Arbno_S =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_X (Arbno initialize). This is the node that initiates
-- the match of a complex Arbno structure.
when PC_Arbno_X =>
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_Y (Arbno rematch). This is the node that is executed
-- following successful matching of one instance of a complex
-- Arbno pattern.
when PC_Arbno_Y => declare
Null_Match : Boolean := (Cursor = Stack (Stack_Base - 1).Cursor);
begin
Pop_Region;
-- If arbno extension matched null, then immediately fail
if Null_Match then
goto Fail;
end if;
-- Here we must do a stack check to make sure enough stack
-- is left. This check will happen once for each instance of
-- the Arbno pattern that is matched. The Nat field of a
-- PC_Arbno pattern contains the maximum stack entries needed
-- for the Arbno with one instance and the successor pattern
if Stack_Ptr + Node.Nat >= Stack'Last then
raise Pattern_Stack_Overflow;
end if;
goto Succeed;
end;
-- Assign. If this node is executed, it means the assign-on-match
-- or write-on-match operation will not happen after all, so we
-- is propagate the failure, removing the PC_Assign node.
when PC_Assign =>
goto Fail;
-- Assign immediate. This node performs the actual assignment.
when PC_Assign_Imm =>
Set_String
(Node.VP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Assign on match. This node sets up for the eventual assignment
when PC_Assign_OnM =>
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
-- Bal
when PC_Bal =>
if Cursor >= Length or else Subject (Cursor + 1) = ')' then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
declare
Paren_Count : Natural := 1;
begin
loop
Cursor := Cursor + 1;
if Cursor >= Length then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
Paren_Count := Paren_Count + 1;
elsif Subject (Cursor + 1) = ')' then
Paren_Count := Paren_Count - 1;
exit when Paren_Count = 0;
end if;
end loop;
end;
end if;
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
-- Break (one character case)
when PC_Break_CH =>
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (character set case)
when PC_Break_CS =>
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (string function case)
when PC_Break_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- Break (string pointer case)
when PC_Break_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (one character case)
when PC_BreakX_CH =>
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (character set case)
when PC_BreakX_CS =>
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (string function case)
when PC_BreakX_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (string pointer case)
when PC_BreakX_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX_X (BreakX extension). See section on "Compound Pattern
-- Structures". This node is the alternative that is stacked to
-- skip past the break character and extend the break.
when PC_BreakX_X =>
Cursor := Cursor + 1;
goto Succeed;
-- Character (one character string)
when PC_Char =>
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- End of Pattern
when PC_EOP =>
if Stack_Base = Stack_Init then
goto Match_Succeed;
-- End of recursive inner match. See separate section on
-- handing of recursive pattern matches for details.
else
Node := Stack (Stack_Base - 1).Node;
Pop_Region;
goto Match;
end if;
-- Fail
when PC_Fail =>
goto Fail;
-- Fence (built in pattern)
when PC_Fence =>
Push (CP_Cancel'Access);
goto Succeed;
-- Fence function node X. This is the node that gets control
-- after a successful match of the fenced pattern.
when PC_Fence_X =>
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_Fence_Y'Access;
Stack_Base := Stack (Stack_Base).Cursor;
goto Succeed;
-- Fence function node Y. This is the node that gets control on
-- a failure that occurs after the fenced pattern has matched.
-- Note: the Cursor at this stage is actually the inner stack
-- base value. We don't reset this, but we do use it to strip
-- off all the entries made by the fenced pattern.
when PC_Fence_Y =>
Stack_Ptr := Cursor - 2;
goto Fail;
-- Len (integer case)
when PC_Len_Nat =>
if Cursor + Node.Nat > Length then
goto Fail;
else
Cursor := Cursor + Node.Nat;
goto Succeed;
end if;
-- Len (Integer function case)
when PC_Len_NF => declare
N : constant Natural := Node.NF.all;
begin
if Cursor + N > Length then
goto Fail;
else
Cursor := Cursor + N;
goto Succeed;
end if;
end;
-- Len (integer pointer case)
when PC_Len_NP =>
if Cursor + Node.NP.all > Length then
goto Fail;
else
Cursor := Cursor + Node.NP.all;
goto Succeed;
end if;
-- NotAny (one character case)
when PC_NotAny_CH =>
if Cursor < Length
and then Subject (Cursor + 1) /= Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (character set case)
when PC_NotAny_CS =>
if Cursor < Length
and then not Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (string function case)
when PC_NotAny_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NotAny (string pointer case)
when PC_NotAny_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NSpan (one character case)
when PC_NSpan_CH =>
while Cursor < Length
and then Subject (Cursor + 1) = Node.Char
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (character set case)
when PC_NSpan_CS =>
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (string function case)
when PC_NSpan_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
-- NSpan (string pointer case)
when PC_NSpan_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
-- Null string
when PC_Null =>
goto Succeed;
-- Pos (integer case)
when PC_Pos_Nat =>
if Cursor = Node.Nat then
goto Succeed;
else
goto Fail;
end if;
-- Pos (Integer function case)
when PC_Pos_NF => declare
N : constant Natural := Node.NF.all;
begin
if Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- Pos (integer pointer case)
when PC_Pos_NP =>
if Cursor = Node.NP.all then
goto Succeed;
else
goto Fail;
end if;
-- Predicate function
when PC_Pred_Func =>
if Node.BF.all then
goto Succeed;
else
goto Fail;
end if;
-- Region Enter. Initiate new pattern history stack region
when PC_R_Enter =>
Stack (Stack_Ptr + 1).Cursor := Cursor;
Push_Region;
goto Succeed;
-- Region Remove node. This is the node stacked by an R_Enter.
-- It removes the special format stack entry right underneath, and
-- then restores the outer level stack base and signals failure.
-- Note: the cursor value at this stage is actually the (negative)
-- stack base value for the outer level.
when PC_R_Remove =>
Stack_Base := Cursor;
Stack_Ptr := Stack_Ptr - 1;
goto Fail;
-- Region restore node. This is the node stacked at the end of an
-- inner level match. Its function is to restore the inner level
-- region, so that alternatives in this region can be sought.
-- Note: the Cursor at this stage is actually the negative of the
-- inner stack base value, which we use to restore the inner region.
when PC_R_Restore =>
Stack_Base := Cursor;
goto Fail;
-- Rest
when PC_Rest =>
Cursor := Length;
goto Succeed;
-- Initiate recursive match (pattern pointer case)
when PC_Rpat =>
Stack (Stack_Ptr + 1).Node := Node.Pthen;
Push_Region;
if Stack_Ptr + Node.PP.all.Stk >= Stack_Size then
raise Pattern_Stack_Overflow;
else
Node := Node.PP.all.P;
goto Match;
end if;
-- RPos (integer case)
when PC_RPos_Nat =>
if Cursor = (Length - Node.Nat) then
goto Succeed;
else
goto Fail;
end if;
-- RPos (integer function case)
when PC_RPos_NF => declare
N : constant Natural := Node.NF.all;
begin
if Length - Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- RPos (integer pointer case)
when PC_RPos_NP =>
if Cursor = (Length - Node.NP.all) then
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer case)
when PC_RTab_Nat =>
if Cursor <= (Length - Node.Nat) then
Cursor := Length - Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer function case)
when PC_RTab_NF => declare
N : constant Natural := Node.NF.all;
begin
if Length - Cursor >= N then
Cursor := Length - N;
goto Succeed;
else
goto Fail;
end if;
end;
-- RTab (integer pointer case)
when PC_RTab_NP =>
if Cursor <= (Length - Node.NP.all) then
Cursor := Length - Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Cursor assignment
when PC_Setcur =>
Node.Var.all := Cursor;
goto Succeed;
-- Span (one character case)
when PC_Span_CH => declare
P : Natural := Cursor;
begin
while P < Length
and then Subject (P + 1) = Node.Char
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (character set case)
when PC_Span_CS => declare
P : Natural := Cursor;
begin
while P < Length
and then Is_In (Subject (P + 1), Node.CS)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string function case)
when PC_Span_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
P : Natural := Cursor;
begin
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string pointer case)
when PC_Span_VP => declare
Str : String_Access := Get_String (Node.VP.all);
P : Natural := Cursor;
begin
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (two character case)
when PC_String_2 =>
if (Length - Cursor) >= 2
and then Subject (Cursor + 1 .. Cursor + 2) = Node.Str2
then
Cursor := Cursor + 2;
goto Succeed;
else
goto Fail;
end if;
-- String (three character case)
when PC_String_3 =>
if (Length - Cursor) >= 3
and then Subject (Cursor + 1 .. Cursor + 3) = Node.Str3
then
Cursor := Cursor + 3;
goto Succeed;
else
goto Fail;
end if;
-- String (four character case)
when PC_String_4 =>
if (Length - Cursor) >= 4
and then Subject (Cursor + 1 .. Cursor + 4) = Node.Str4
then
Cursor := Cursor + 4;
goto Succeed;
else
goto Fail;
end if;
-- String (five character case)
when PC_String_5 =>
if (Length - Cursor) >= 5
and then Subject (Cursor + 1 .. Cursor + 5) = Node.Str5
then
Cursor := Cursor + 5;
goto Succeed;
else
goto Fail;
end if;
-- String (six character case)
when PC_String_6 =>
if (Length - Cursor) >= 6
and then Subject (Cursor + 1 .. Cursor + 6) = Node.Str6
then
Cursor := Cursor + 6;
goto Succeed;
else
goto Fail;
end if;
-- String (case of more than six characters)
when PC_String => declare
Len : constant Natural := Node.Str'Length;
begin
if (Length - Cursor) >= Len
and then Node.Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (function case)
when PC_String_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
Len : constant Natural := Str'Length;
begin
if (Length - Cursor) >= Len
and then Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (pointer case)
when PC_String_VP => declare
S : String_Access := Get_String (Node.VP.all);
Len : constant Natural := S'Length;
begin
if (Length - Cursor) >= Len
and then S.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- Succeed
when PC_Succeed =>
Push (Node);
goto Succeed;
-- Tab (integer case)
when PC_Tab_Nat =>
if Cursor <= Node.Nat then
Cursor := Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- Tab (integer function case)
when PC_Tab_NF => declare
N : constant Natural := Node.NF.all;
begin
if Cursor <= N then
Cursor := N;
goto Succeed;
else
goto Fail;
end if;
end;
-- Tab (integer pointer case)
when PC_Tab_NP =>
if Cursor <= Node.NP.all then
Cursor := Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Unanchored movement
when PC_Unanchored =>
-- All done if we tried every position
if Cursor > Length then
goto Match_Fail;
-- Otherwise extend the anchor point, and restack ourself
else
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
end if;
-- Write immediate. This node performs the actual write
when PC_Write_Imm =>
Put_Line
(Node.FP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Write on match. This node sets up for the eventual write
when PC_Write_OnM =>
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
end case;
-- We are NOT allowed to fall though this case statement, since every
-- match routine must end by executing a goto to the appropriate point
-- in the finite state machine model.
Logic_Error;
end XMatch;
-------------
-- XMatchD --
-------------
-- Maintenance note: There is a LOT of code duplication between XMatch
-- and XMatchD. This is quite intentional, the point is to avoid any
-- unnecessary debugging overhead in the XMatch case, but this does mean
-- that any changes to XMatchD must be mirrored in XMatch. In case of
-- any major changes, the proper approach is to delete XMatch, make the
-- changes to XMatchD, and then make a copy of XMatchD, removing all
-- calls to Dout, and all Put and Put_Line operations. This copy becomes
-- the new XMatch.
procedure XMatchD
(Subject : String;
Pat_P : PE_Ptr;
Pat_S : Natural;
Start : out Natural;
Stop : out Natural)
is
Node : PE_Ptr;
-- Pointer to current pattern node. Initialized from Pat_P, and then
-- updated as the match proceeds through its constituent elements.
Length : constant Natural := Subject'Length;
-- Length of string (= Subject'Last, since Subject'First is always 1)
Cursor : Integer := 0;
-- If the value is non-negative, then this value is the index showing
-- the current position of the match in the subject string. The next
-- character to be matched is at Subject (Cursor + 1). Note that since
-- our view of the subject string in XMatch always has a lower bound
-- of one, regardless of original bounds, that this definition exactly
-- corresponds to the cursor value as referenced by functions like Pos.
--
-- If the value is negative, then this is a saved stack pointer,
-- typically a base pointer of an inner or outer region. Cursor
-- temporarily holds such a value when it is popped from the stack
-- by Fail. In all cases, Cursor is reset to a proper non-negative
-- cursor value before the match proceeds (e.g. by propagating the
-- failure and popping a "real" cursor value from the stack.
PE_Unanchored : aliased PE := (PC_Unanchored, 0, Pat_P);
-- Dummy pattern element used in the unanchored case.
Region_Level : Natural := 0;
-- Keeps track of recursive region level. This is used only for
-- debugging, it is the number of saved history stack base values.
Stack : Stack_Type;
-- The pattern matching failure stack for this call to Match
Stack_Ptr : Stack_Range;
-- Current stack pointer. This points to the top element of the stack
-- that is currently in use. At the outer level this is the special
-- entry placed on the stack according to the anchor mode.
Stack_Init : constant Stack_Range := Stack'First + 1;
-- This is the initial value of the Stack_Ptr and Stack_Base. The
-- initial (Stack'First) element of the stack is not used so that
-- when we pop the last element off, Stack_Ptr is still in range.
Stack_Base : Stack_Range;
-- This value is the stack base value, i.e. the stack pointer for the
-- first history stack entry in the current stack region. See separate
-- section on handling of recursive pattern matches.
Assign_OnM : Boolean := False;
-- Set True if assign-on-match or write-on-match operations may be
-- present in the history stack, which must then be scanned on a
-- successful match.
procedure Dout (Str : String);
-- Output string to standard error with bars indicating region level.
procedure Dout (Str : String; A : Character);
-- Calls Dout with the string S ('A')
procedure Dout (Str : String; A : Character_Set);
-- Calls Dout with the string S ("A")
procedure Dout (Str : String; A : Natural);
-- Calls Dout with the string S (A)
procedure Dout (Str : String; A : String);
-- Calls Dout with the string S ("A")
function Img (P : PE_Ptr) return String;
-- Returns a string of the form #nnn where nnn is P.Index
procedure Pop_Region;
pragma Inline (Pop_Region);
-- Used at the end of processing of an inner region. if the inner
-- region left no stack entries, then all trace of it is removed.
-- Otherwise a PC_Restore_Region entry is pushed to ensure proper
-- handling of alternatives in the inner region.
procedure Push (Node : PE_Ptr);
pragma Inline (Push);
-- Make entry in pattern matching stack with current cursor valeu
procedure Push_Region;
pragma Inline (Push_Region);
-- This procedure makes a new region on the history stack. The
-- caller first establishes the special entry on the stack, but
-- does not push the stack pointer. Then this call stacks a
-- PC_Remove_Region node, on top of this entry, using the cursor
-- field of the PC_Remove_Region entry to save the outer level
-- stack base value, and resets the stack base to point to this
-- PC_Remove_Region node.
----------
-- Dout --
----------
procedure Dout (Str : String) is
begin
for J in 1 .. Region_Level loop
Put ("| ");
end loop;
Put_Line (Str);
end Dout;
procedure Dout (Str : String; A : Character) is
begin
Dout (Str & " ('" & A & "')");
end Dout;
procedure Dout (Str : String; A : Character_Set) is
begin
Dout (Str & " (" & Image (To_Sequence (A)) & ')');
end Dout;
procedure Dout (Str : String; A : Natural) is
begin
Dout (Str & " (" & A & ')');
end Dout;
procedure Dout (Str : String; A : String) is
begin
Dout (Str & " (" & Image (A) & ')');
end Dout;
---------
-- Img --
---------
function Img (P : PE_Ptr) return String is
begin
return "#" & Integer (P.Index) & " ";
end Img;
----------------
-- Pop_Region --
----------------
procedure Pop_Region is
begin
Region_Level := Region_Level - 1;
-- If nothing was pushed in the inner region, we can just get
-- rid of it entirely, leaving no traces that it was ever there
if Stack_Ptr = Stack_Base then
Stack_Ptr := Stack_Base - 2;
Stack_Base := Stack (Stack_Ptr + 2).Cursor;
-- If stuff was pushed in the inner region, then we have to
-- push a PC_R_Restore node so that we properly handle possible
-- rematches within the region.
else
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Restore'Access;
Stack_Base := Stack (Stack_Base).Cursor;
end if;
end Pop_Region;
----------
-- Push --
----------
procedure Push (Node : PE_Ptr) is
begin
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Cursor;
Stack (Stack_Ptr).Node := Node;
end Push;
-----------------
-- Push_Region --
-----------------
procedure Push_Region is
begin
Region_Level := Region_Level + 1;
Stack_Ptr := Stack_Ptr + 2;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_R_Remove'Access;
Stack_Base := Stack_Ptr;
end Push_Region;
-- Start of processing for XMatchD
begin
New_Line;
Put_Line ("Initiating pattern match, subject = " & Image (Subject));
Put ("--------------------------------------");
for J in 1 .. Length loop
Put ('-');
end loop;
New_Line;
Put_Line ("subject length = " & Length);
if Pat_P = null then
Uninitialized_Pattern;
end if;
-- Check we have enough stack for this pattern. This check deals with
-- every possibility except a match of a recursive pattern, where we
-- make a check at each recursion level.
if Pat_S >= Stack_Size - 1 then
raise Pattern_Stack_Overflow;
end if;
-- In anchored mode, the bottom entry on the stack is an abort entry
if Anchored_Mode then
Stack (Stack_Init).Node := CP_Cancel'Access;
Stack (Stack_Init).Cursor := 0;
-- In unanchored more, the bottom entry on the stack references
-- the special pattern element PE_Unanchored, whose Pthen field
-- points to the initial pattern element. The cursor value in this
-- entry is the number of anchor moves so far.
else
Stack (Stack_Init).Node := PE_Unanchored'Unchecked_Access;
Stack (Stack_Init).Cursor := 0;
end if;
Stack_Ptr := Stack_Init;
Stack_Base := Stack_Ptr;
Cursor := 0;
Node := Pat_P;
goto Match;
-----------------------------------------
-- Main Pattern Matching State Control --
-----------------------------------------
-- This is a state machine which uses gotos to change state. The
-- initial state is Match, to initiate the matching of the first
-- element, so the goto Match above starts the match. In the
-- following descriptions, we indicate the global values that
-- are relevant for the state transition.
-- Come here if entire match fails
<<Match_Fail>>
Dout ("match fails");
New_Line;
Start := 0;
Stop := 0;
return;
-- Come here if entire match succeeds
-- Cursor current position in subject string
<<Match_Succeed>>
Dout ("match succeeds");
Start := Stack (Stack_Init).Cursor + 1;
Stop := Cursor;
Dout ("first matched character index = " & Start);
Dout ("last matched character index = " & Stop);
Dout ("matched substring = " & Image (Subject (Start .. Stop)));
-- Scan history stack for deferred assignments or writes
if Assign_OnM then
for S in Stack'First .. Stack_Ptr loop
if Stack (S).Node = CP_Assign'Access then
declare
Inner_Base : constant Stack_Range :=
Stack (S + 1).Cursor;
Special_Entry : constant Stack_Range :=
Inner_Base - 1;
Node_OnM : constant PE_Ptr :=
Stack (Special_Entry).Node;
Start : constant Natural :=
Stack (Special_Entry).Cursor + 1;
Stop : constant Natural := Stack (S).Cursor;
begin
if Node_OnM.Pcode = PC_Assign_OnM then
Set_String (Node_OnM.VP.all, Subject (Start .. Stop));
Dout
(Img (Stack (S).Node) &
"deferred assignment of " &
Image (Subject (Start .. Stop)));
elsif Node_OnM.Pcode = PC_Write_OnM then
Put_Line (Node_OnM.FP.all, Subject (Start .. Stop));
Dout
(Img (Stack (S).Node) &
"deferred write of " &
Image (Subject (Start .. Stop)));
else
Logic_Error;
end if;
end;
end if;
end loop;
end if;
New_Line;
return;
-- Come here if attempt to match current element fails
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Fail>>
Cursor := Stack (Stack_Ptr).Cursor;
Node := Stack (Stack_Ptr).Node;
Stack_Ptr := Stack_Ptr - 1;
if Cursor >= 0 then
Dout ("failure, cursor reset to " & Cursor);
end if;
goto Match;
-- Come here if attempt to match current element succeeds
-- Cursor current position in subject string
-- Node pointer to node successfully matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Succeed>>
Dout ("success, cursor = " & Cursor);
Node := Node.Pthen;
-- Come here to match the next pattern element
-- Cursor current position in subject string
-- Node pointer to node to be matched
-- Stack_Base current stack base
-- Stack_Ptr current stack pointer
<<Match>>
--------------------------------------------------
-- Main Pattern Match Element Matching Routines --
--------------------------------------------------
-- Here is the case statement that processes the current node. The
-- processing for each element does one of five things:
-- goto Succeed to move to the successor
-- goto Match_Succeed if the entire match succeeds
-- goto Match_Fail if the entire match fails
-- goto Fail to signal failure of current match
-- Processing is NOT allowed to fall through
case Node.Pcode is
-- Cancel
when PC_Cancel =>
Dout (Img (Node) & "matching Cancel");
goto Match_Fail;
-- Alternation
when PC_Alt =>
Dout
(Img (Node) & "setting up alternative " & Img (Node.Alt));
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Any (one character case)
when PC_Any_CH =>
Dout (Img (Node) & "matching Any", Node.Char);
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (character set case)
when PC_Any_CS =>
Dout (Img (Node) & "matching Any", Node.CS);
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- Any (string function case)
when PC_Any_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching Any", Str.all);
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Any (string pointer case)
when PC_Any_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching Any", Str.all);
if Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- Arb (initial match)
when PC_Arb_X =>
Dout (Img (Node) & "matching Arb");
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arb (extension)
when PC_Arb_Y =>
Dout (Img (Node) & "extending Arb");
if Cursor < Length then
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
else
goto Fail;
end if;
-- Arbno_S (simple Arbno initialize). This is the node that
-- initiates the match of a simple Arbno structure.
when PC_Arbno_S =>
Dout (Img (Node) &
"setting up Arbno alternative " & Img (Node.Alt));
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_X (Arbno initialize). This is the node that initiates
-- the match of a complex Arbno structure.
when PC_Arbno_X =>
Dout (Img (Node) &
"setting up Arbno alternative " & Img (Node.Alt));
Push (Node.Alt);
Node := Node.Pthen;
goto Match;
-- Arbno_Y (Arbno rematch). This is the node that is executed
-- following successful matching of one instance of a complex
-- Arbno pattern.
when PC_Arbno_Y => declare
Null_Match : Boolean := (Cursor = Stack (Stack_Base - 1).Cursor);
begin
Dout (Img (Node) & "extending Arbno");
Pop_Region;
-- If arbno extension matched null, then immediately fail
if Null_Match then
Dout ("Arbno extension matched null, so fails");
goto Fail;
end if;
-- Here we must do a stack check to make sure enough stack
-- is left. This check will happen once for each instance of
-- the Arbno pattern that is matched. The Nat field of a
-- PC_Arbno pattern contains the maximum stack entries needed
-- for the Arbno with one instance and the successor pattern
if Stack_Ptr + Node.Nat >= Stack'Last then
raise Pattern_Stack_Overflow;
end if;
goto Succeed;
end;
-- Assign. If this node is executed, it means the assign-on-match
-- or write-on-match operation will not happen after all, so we
-- is propagate the failure, removing the PC_Assign node.
when PC_Assign =>
Dout (Img (Node) & "deferred assign/write cancelled");
goto Fail;
-- Assign immediate. This node performs the actual assignment.
when PC_Assign_Imm =>
Dout
(Img (Node) & "executing immediate assignment of " &
Image (Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor)));
Set_String
(Node.VP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Assign on match. This node sets up for the eventual assignment
when PC_Assign_OnM =>
Dout (Img (Node) & "registering deferred assignment");
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
-- Bal
when PC_Bal =>
Dout (Img (Node) & "matching or extending Bal");
if Cursor >= Length or else Subject (Cursor + 1) = ')' then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
declare
Paren_Count : Natural := 1;
begin
loop
Cursor := Cursor + 1;
if Cursor >= Length then
goto Fail;
elsif Subject (Cursor + 1) = '(' then
Paren_Count := Paren_Count + 1;
elsif Subject (Cursor + 1) = ')' then
Paren_Count := Paren_Count - 1;
exit when Paren_Count = 0;
end if;
end loop;
end;
end if;
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
-- Break (one character case)
when PC_Break_CH =>
Dout (Img (Node) & "matching Break", Node.Char);
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (character set case)
when PC_Break_CS =>
Dout (Img (Node) & "matching Break", Node.CS);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- Break (string function case)
when PC_Break_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching Break", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- Break (string pointer case)
when PC_Break_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching Break", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (one character case)
when PC_BreakX_CH =>
Dout (Img (Node) & "matching BreakX", Node.Char);
while Cursor < Length loop
if Subject (Cursor + 1) = Node.Char then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (character set case)
when PC_BreakX_CS =>
Dout (Img (Node) & "matching BreakX", Node.CS);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Node.CS) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
-- BreakX (string function case)
when PC_BreakX_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching BreakX", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX (string pointer case)
when PC_BreakX_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching BreakX", Str.all);
while Cursor < Length loop
if Is_In (Subject (Cursor + 1), Str.all) then
goto Succeed;
else
Cursor := Cursor + 1;
end if;
end loop;
goto Fail;
end;
-- BreakX_X (BreakX extension). See section on "Compound Pattern
-- Structures". This node is the alternative that is stacked
-- to skip past the break character and extend the break.
when PC_BreakX_X =>
Dout (Img (Node) & "extending BreakX");
Cursor := Cursor + 1;
goto Succeed;
-- Character (one character string)
when PC_Char =>
Dout (Img (Node) & "matching '" & Node.Char & ''');
if Cursor < Length
and then Subject (Cursor + 1) = Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- End of Pattern
when PC_EOP =>
if Stack_Base = Stack_Init then
Dout ("end of pattern");
goto Match_Succeed;
-- End of recursive inner match. See separate section on
-- handing of recursive pattern matches for details.
else
Dout ("terminating recursive match");
Node := Stack (Stack_Base - 1).Node;
Pop_Region;
goto Match;
end if;
-- Fail
when PC_Fail =>
Dout (Img (Node) & "matching Fail");
goto Fail;
-- Fence (built in pattern)
when PC_Fence =>
Dout (Img (Node) & "matching Fence");
Push (CP_Cancel'Access);
goto Succeed;
-- Fence function node X. This is the node that gets control
-- after a successful match of the fenced pattern.
when PC_Fence_X =>
Dout (Img (Node) & "matching Fence function");
Stack_Ptr := Stack_Ptr + 1;
Stack (Stack_Ptr).Cursor := Stack_Base;
Stack (Stack_Ptr).Node := CP_Fence_Y'Access;
Stack_Base := Stack (Stack_Base).Cursor;
Region_Level := Region_Level - 1;
goto Succeed;
-- Fence function node Y. This is the node that gets control on
-- a failure that occurs after the fenced pattern has matched.
-- Note: the Cursor at this stage is actually the inner stack
-- base value. We don't reset this, but we do use it to strip
-- off all the entries made by the fenced pattern.
when PC_Fence_Y =>
Dout (Img (Node) & "pattern matched by Fence caused failure");
Stack_Ptr := Cursor - 2;
goto Fail;
-- Len (integer case)
when PC_Len_Nat =>
Dout (Img (Node) & "matching Len", Node.Nat);
if Cursor + Node.Nat > Length then
goto Fail;
else
Cursor := Cursor + Node.Nat;
goto Succeed;
end if;
-- Len (Integer function case)
when PC_Len_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching Len", N);
if Cursor + N > Length then
goto Fail;
else
Cursor := Cursor + N;
goto Succeed;
end if;
end;
-- Len (integer pointer case)
when PC_Len_NP =>
Dout (Img (Node) & "matching Len", Node.NP.all);
if Cursor + Node.NP.all > Length then
goto Fail;
else
Cursor := Cursor + Node.NP.all;
goto Succeed;
end if;
-- NotAny (one character case)
when PC_NotAny_CH =>
Dout (Img (Node) & "matching NotAny", Node.Char);
if Cursor < Length
and then Subject (Cursor + 1) /= Node.Char
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (character set case)
when PC_NotAny_CS =>
Dout (Img (Node) & "matching NotAny", Node.CS);
if Cursor < Length
and then not Is_In (Subject (Cursor + 1), Node.CS)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
-- NotAny (string function case)
when PC_NotAny_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching NotAny", Str.all);
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NotAny (string pointer case)
when PC_NotAny_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching NotAny", Str.all);
if Cursor < Length
and then
not Is_In (Subject (Cursor + 1), Str.all)
then
Cursor := Cursor + 1;
goto Succeed;
else
goto Fail;
end if;
end;
-- NSpan (one character case)
when PC_NSpan_CH =>
Dout (Img (Node) & "matching NSpan", Node.Char);
while Cursor < Length
and then Subject (Cursor + 1) = Node.Char
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (character set case)
when PC_NSpan_CS =>
Dout (Img (Node) & "matching NSpan", Node.CS);
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Node.CS)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
-- NSpan (string function case)
when PC_NSpan_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
begin
Dout (Img (Node) & "matching NSpan", Str.all);
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
-- NSpan (string pointer case)
when PC_NSpan_VP => declare
Str : String_Access := Get_String (Node.VP.all);
begin
Dout (Img (Node) & "matching NSpan", Str.all);
while Cursor < Length
and then Is_In (Subject (Cursor + 1), Str.all)
loop
Cursor := Cursor + 1;
end loop;
goto Succeed;
end;
when PC_Null =>
Dout (Img (Node) & "matching null");
goto Succeed;
-- Pos (integer case)
when PC_Pos_Nat =>
Dout (Img (Node) & "matching Pos", Node.Nat);
if Cursor = Node.Nat then
goto Succeed;
else
goto Fail;
end if;
-- Pos (Integer function case)
when PC_Pos_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching Pos", N);
if Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- Pos (integer pointer case)
when PC_Pos_NP =>
Dout (Img (Node) & "matching Pos", Node.NP.all);
if Cursor = Node.NP.all then
goto Succeed;
else
goto Fail;
end if;
-- Predicate function
when PC_Pred_Func =>
Dout (Img (Node) & "matching predicate function");
if Node.BF.all then
goto Succeed;
else
goto Fail;
end if;
-- Region Enter. Initiate new pattern history stack region
when PC_R_Enter =>
Dout (Img (Node) & "starting match of nested pattern");
Stack (Stack_Ptr + 1).Cursor := Cursor;
Push_Region;
goto Succeed;
-- Region Remove node. This is the node stacked by an R_Enter.
-- It removes the special format stack entry right underneath, and
-- then restores the outer level stack base and signals failure.
-- Note: the cursor value at this stage is actually the (negative)
-- stack base value for the outer level.
when PC_R_Remove =>
Dout ("failure, match of nested pattern terminated");
Stack_Base := Cursor;
Region_Level := Region_Level - 1;
Stack_Ptr := Stack_Ptr - 1;
goto Fail;
-- Region restore node. This is the node stacked at the end of an
-- inner level match. Its function is to restore the inner level
-- region, so that alternatives in this region can be sought.
-- Note: the Cursor at this stage is actually the negative of the
-- inner stack base value, which we use to restore the inner region.
when PC_R_Restore =>
Dout ("failure, search for alternatives in nested pattern");
Region_Level := Region_Level + 1;
Stack_Base := Cursor;
goto Fail;
-- Rest
when PC_Rest =>
Dout (Img (Node) & "matching Rest");
Cursor := Length;
goto Succeed;
-- Initiate recursive match (pattern pointer case)
when PC_Rpat =>
Stack (Stack_Ptr + 1).Node := Node.Pthen;
Push_Region;
Dout (Img (Node) & "initiating recursive match");
if Stack_Ptr + Node.PP.all.Stk >= Stack_Size then
raise Pattern_Stack_Overflow;
else
Node := Node.PP.all.P;
goto Match;
end if;
-- RPos (integer case)
when PC_RPos_Nat =>
Dout (Img (Node) & "matching RPos", Node.Nat);
if Cursor = (Length - Node.Nat) then
goto Succeed;
else
goto Fail;
end if;
-- RPos (integer function case)
when PC_RPos_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching RPos", N);
if Length - Cursor = N then
goto Succeed;
else
goto Fail;
end if;
end;
-- RPos (integer pointer case)
when PC_RPos_NP =>
Dout (Img (Node) & "matching RPos", Node.NP.all);
if Cursor = (Length - Node.NP.all) then
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer case)
when PC_RTab_Nat =>
Dout (Img (Node) & "matching RTab", Node.Nat);
if Cursor <= (Length - Node.Nat) then
Cursor := Length - Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- RTab (integer function case)
when PC_RTab_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching RPos", N);
if Length - Cursor >= N then
Cursor := Length - N;
goto Succeed;
else
goto Fail;
end if;
end;
-- RTab (integer pointer case)
when PC_RTab_NP =>
Dout (Img (Node) & "matching RPos", Node.NP.all);
if Cursor <= (Length - Node.NP.all) then
Cursor := Length - Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Cursor assignment
when PC_Setcur =>
Dout (Img (Node) & "matching Setcur");
Node.Var.all := Cursor;
goto Succeed;
-- Span (one character case)
when PC_Span_CH => declare
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Node.Char);
while P < Length
and then Subject (P + 1) = Node.Char
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (character set case)
when PC_Span_CS => declare
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Node.CS);
while P < Length
and then Is_In (Subject (P + 1), Node.CS)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string function case)
when PC_Span_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Str.all);
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- Span (string pointer case)
when PC_Span_VP => declare
Str : String_Access := Get_String (Node.VP.all);
P : Natural := Cursor;
begin
Dout (Img (Node) & "matching Span", Str.all);
while P < Length
and then Is_In (Subject (P + 1), Str.all)
loop
P := P + 1;
end loop;
if P /= Cursor then
Cursor := P;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (two character case)
when PC_String_2 =>
Dout (Img (Node) & "matching " & Image (Node.Str2));
if (Length - Cursor) >= 2
and then Subject (Cursor + 1 .. Cursor + 2) = Node.Str2
then
Cursor := Cursor + 2;
goto Succeed;
else
goto Fail;
end if;
-- String (three character case)
when PC_String_3 =>
Dout (Img (Node) & "matching " & Image (Node.Str3));
if (Length - Cursor) >= 3
and then Subject (Cursor + 1 .. Cursor + 3) = Node.Str3
then
Cursor := Cursor + 3;
goto Succeed;
else
goto Fail;
end if;
-- String (four character case)
when PC_String_4 =>
Dout (Img (Node) & "matching " & Image (Node.Str4));
if (Length - Cursor) >= 4
and then Subject (Cursor + 1 .. Cursor + 4) = Node.Str4
then
Cursor := Cursor + 4;
goto Succeed;
else
goto Fail;
end if;
-- String (five character case)
when PC_String_5 =>
Dout (Img (Node) & "matching " & Image (Node.Str5));
if (Length - Cursor) >= 5
and then Subject (Cursor + 1 .. Cursor + 5) = Node.Str5
then
Cursor := Cursor + 5;
goto Succeed;
else
goto Fail;
end if;
-- String (six character case)
when PC_String_6 =>
Dout (Img (Node) & "matching " & Image (Node.Str6));
if (Length - Cursor) >= 6
and then Subject (Cursor + 1 .. Cursor + 6) = Node.Str6
then
Cursor := Cursor + 6;
goto Succeed;
else
goto Fail;
end if;
-- String (case of more than six characters)
when PC_String => declare
Len : constant Natural := Node.Str'Length;
begin
Dout (Img (Node) & "matching " & Image (Node.Str.all));
if (Length - Cursor) >= Len
and then Node.Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (function case)
when PC_String_VF => declare
U : constant VString := Node.VF.all;
Str : constant String_Access := Get_String (U);
Len : constant Natural := Str'Length;
begin
Dout (Img (Node) & "matching " & Image (Str.all));
if (Length - Cursor) >= Len
and then Str.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- String (vstring pointer case)
when PC_String_VP => declare
S : String_Access := Get_String (Node.VP.all);
Len : constant Natural :=
Ada.Strings.Unbounded.Length (Node.VP.all);
begin
Dout
(Img (Node) & "matching " & Image (S.all));
if (Length - Cursor) >= Len
and then S.all = Subject (Cursor + 1 .. Cursor + Len)
then
Cursor := Cursor + Len;
goto Succeed;
else
goto Fail;
end if;
end;
-- Succeed
when PC_Succeed =>
Dout (Img (Node) & "matching Succeed");
Push (Node);
goto Succeed;
-- Tab (integer case)
when PC_Tab_Nat =>
Dout (Img (Node) & "matching Tab", Node.Nat);
if Cursor <= Node.Nat then
Cursor := Node.Nat;
goto Succeed;
else
goto Fail;
end if;
-- Tab (integer function case)
when PC_Tab_NF => declare
N : constant Natural := Node.NF.all;
begin
Dout (Img (Node) & "matching Tab ", N);
if Cursor <= N then
Cursor := N;
goto Succeed;
else
goto Fail;
end if;
end;
-- Tab (integer pointer case)
when PC_Tab_NP =>
Dout (Img (Node) & "matching Tab ", Node.NP.all);
if Cursor <= Node.NP.all then
Cursor := Node.NP.all;
goto Succeed;
else
goto Fail;
end if;
-- Unanchored movement
when PC_Unanchored =>
Dout ("attempting to move anchor point");
-- All done if we tried every position
if Cursor > Length then
goto Match_Fail;
-- Otherwise extend the anchor point, and restack ourself
else
Cursor := Cursor + 1;
Push (Node);
goto Succeed;
end if;
-- Write immediate. This node performs the actual write
when PC_Write_Imm =>
Dout (Img (Node) & "executing immediate write of " &
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Put_Line
(Node.FP.all,
Subject (Stack (Stack_Base - 1).Cursor + 1 .. Cursor));
Pop_Region;
goto Succeed;
-- Write on match. This node sets up for the eventual write
when PC_Write_OnM =>
Dout (Img (Node) & "registering deferred write");
Stack (Stack_Base - 1).Node := Node;
Push (CP_Assign'Access);
Pop_Region;
Assign_OnM := True;
goto Succeed;
end case;
-- We are NOT allowed to fall though this case statement, since every
-- match routine must end by executing a goto to the appropriate point
-- in the finite state machine model.
Logic_Error;
end XMatchD;
end GNAT.Spitbol.Patterns;
|
with
openGL.Geometry.lit_textured,
openGL.Primitive.indexed;
package body openGL.Model.hexagon.lit_textured
is
---------
--- Forge
--
function new_Hexagon (Radius : in Real;
Face : in lit_textured.Face) return View
is
Self : constant View := new Item;
begin
Self.Radius := Radius;
Self.Face := Face;
return Self;
end new_Hexagon;
--------------
--- Attributes
--
overriding
function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class;
Fonts : in Font.font_id_Map_of_font) return Geometry.views
is
pragma unreferenced (Textures, Fonts);
use Geometry.lit_textured,
Texture;
the_Sites : constant hexagon.Sites := vertex_Sites (Self.Radius);
the_Indices : aliased constant Indices := (1, 2, 3, 4, 5, 6, 7, 2);
function new_Face (Vertices : in geometry.lit_textured.Vertex_array) return Geometry.lit_textured.view
is
use Primitive;
the_Geometry : constant Geometry.lit_textured.view
:= Geometry.lit_textured.new_Geometry;
the_Primitive : constant Primitive.indexed.view
:= Primitive.indexed.new_Primitive (triangle_Fan, the_Indices);
begin
the_Geometry.Vertices_are (Vertices);
the_Geometry.add (Primitive.view (the_Primitive));
return the_Geometry;
end new_Face;
upper_Face : Geometry.lit_textured.view;
begin
-- Upper Face
--
declare
the_Vertices : constant Geometry.lit_textured.Vertex_array
:= (1 => (Site => (0.0, 0.0, 0.0), Normal => Normal, Coords => (0.0, 0.0), Shine => default_Shine),
2 => (Site => the_Sites (1), Normal => Normal, Coords => (0.0, 0.0), Shine => default_Shine),
3 => (Site => the_Sites (2), Normal => Normal, Coords => (1.0, 0.0), Shine => default_Shine),
4 => (Site => the_Sites (3), Normal => Normal, Coords => (1.0, 1.0), Shine => default_Shine),
5 => (Site => the_Sites (4), Normal => Normal, Coords => (0.0, 1.0), Shine => default_Shine),
6 => (Site => the_Sites (5), Normal => Normal, Coords => (0.0, 1.0), Shine => default_Shine),
7 => (Site => the_Sites (6), Normal => Normal, Coords => (0.0, 1.0), Shine => default_Shine));
begin
upper_Face := new_Face (Vertices => the_Vertices);
if Self.Face.Texture /= null_Object
then
upper_Face.Texture_is (Self.Face.Texture);
end if;
end;
return (1 => upper_Face.all'Access);
end to_GL_Geometries;
end openGL.Model.hexagon.lit_textured;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 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 STMicroelectronics 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. --
-- --
-- This file is based on: --
-- @file stm32f469i_discovery_audio.h --
-- @author MCD Application Team --
------------------------------------------------------------------------------
with HAL.Audio; use HAL.Audio;
with HAL.I2C; use HAL.I2C;
with Ravenscar_Time;
private with CS43L22;
package Audio is
type CS43L22_Audio_Device (Port : not null Any_I2C_Port) is
tagged limited private;
procedure Initialize_Audio_Out
(This : in out CS43L22_Audio_Device;
Volume : Audio_Volume;
Frequency : Audio_Frequency);
procedure Play
(This : in out CS43L22_Audio_Device;
Buffer : Audio_Buffer);
procedure Pause
(This : in out CS43L22_Audio_Device);
procedure Resume
(This : in out CS43L22_Audio_Device);
procedure Stop
(This : in out CS43L22_Audio_Device);
procedure Set_Volume
(This : in out CS43L22_Audio_Device;
Volume : Audio_Volume);
procedure Set_Frequency
(This : in out CS43L22_Audio_Device;
Frequency : Audio_Frequency);
private
type CS43L22_Audio_Device (Port : not null Any_I2C_Port) is
tagged limited record
Device : CS43L22.CS43L22_Device (Port, Ravenscar_Time.Delays);
end record;
end Audio;
|
--
-- Copyright (c) 2007, 2008 Tero Koskinen <tero.koskinen@iki.fi>
--
-- Permission to use, copy, modify, and distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
--
with Ada.Finalization;
with Ahven.AStrings;
with Ahven.Long_AStrings;
package Ahven.Listeners is
type Test_Phase is (TEST_BEGIN, TEST_RUN, TEST_END);
-- What is test doing right now?
type Test_Type is (CONTAINER, ROUTINE);
type Context (Phase : Test_Phase) is record
Test_Name : AStrings.Bounded_String;
Test_Kind : Test_Type;
case Phase is
when TEST_BEGIN | TEST_END =>
null;
when TEST_RUN =>
Routine_Name : AStrings.Bounded_String;
Message : AStrings.Bounded_String;
Long_Message : Long_AStrings.Bounded_String;
end case;
end record;
type Result_Listener is
abstract new Ada.Finalization.Limited_Controlled with null record;
-- Result_Listener is a listener for test results.
-- Whenever a test is run, the framework calls
-- registered listeners and tells them the result of the test.
type Result_Listener_Class_Access is access all Result_Listener'Class;
procedure Add_Pass (Listener : in out Result_Listener;
Info : Context) is abstract;
-- Called after test passes.
procedure Add_Failure (Listener : in out Result_Listener;
Info : Context) is abstract;
-- Called after test fails.
procedure Add_Skipped (Listener : in out Result_Listener;
Info : Context);
-- Called when user wants to skip the test.
procedure Add_Error (Listener : in out Result_Listener;
Info : Context) is abstract;
-- Called after there is an error in the test.
procedure Start_Test (Listener : in out Result_Listener;
Info : Context) is abstract;
-- Called before the test begins. This is called before Add_* procedures.
procedure End_Test (Listener : in out Result_Listener;
Info : Context) is abstract;
-- Called after the test ends. Add_* procedures are called before this.
end Ahven.Listeners;
|
pragma License (Unrestricted);
-- implementation unit specialized for POSIX (Darwin, FreeBSD, or Linux)
package System.Native_Command_Line is
pragma Preelaborate;
function Argument_Count return Natural;
pragma Pure_Function (Argument_Count);
pragma Inline (Argument_Count);
function Argument (Number : Natural) return String;
-- Returns Command_Name if Number = 0.
end System.Native_Command_Line;
|
-- Lumen.Program -- Helper routines fr working with shader programs.
--
-- darkestkhan, Winter 2014
-- This code is covered by the ISC License:
--
-- Copyright © 2014, darkestkhan
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- The software is provided "as is" and the author disclaims all warranties
-- with regard to this software including all implied warranties of
-- merchantability and fitness. In no event shall the author be liable for any
-- special, direct, indirect, or consequential damages or any damages
-- whatsoever resulting from loss of use, data or profits, whether in an
-- action of contract, negligence or other tortious action, arising out of or
-- in connection with the use or performance of this software.
with Lumen.GL;
package Lumen.Program is
-- Fetch info log for given shader program.
function Get_Info_Log (Program: in GL.UInt) return String;
end Lumen.Program;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-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.Elements.Generic_Hash;
function AMF.UML.Communication_Paths.Hash is
new AMF.Elements.Generic_Hash (UML_Communication_Path, UML_Communication_Path_Access);
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-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$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.UML.Activities;
with AMF.UML.Activity_Edges.Collections;
with AMF.UML.Activity_Groups.Collections;
with AMF.UML.Activity_Nodes.Collections;
with AMF.UML.Activity_Partitions.Collections;
with AMF.UML.Behaviors;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Expansion_Nodes;
with AMF.UML.Expansion_Regions;
with AMF.UML.Interruptible_Activity_Regions.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Packages.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.States.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Structured_Activity_Nodes;
with AMF.UML.Types;
with AMF.UML.Value_Specifications;
with AMF.Visitors;
package AMF.Internals.UML_Expansion_Nodes is
type UML_Expansion_Node_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Expansion_Nodes.UML_Expansion_Node with null record;
overriding function Get_Region_As_Input
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Expansion_Regions.UML_Expansion_Region_Access;
-- Getter of ExpansionNode::regionAsInput.
--
-- The expansion region for which the node is an input.
overriding procedure Set_Region_As_Input
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Expansion_Regions.UML_Expansion_Region_Access);
-- Setter of ExpansionNode::regionAsInput.
--
-- The expansion region for which the node is an input.
overriding function Get_Region_As_Output
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Expansion_Regions.UML_Expansion_Region_Access;
-- Getter of ExpansionNode::regionAsOutput.
--
-- The expansion region for which the node is an output.
overriding procedure Set_Region_As_Output
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Expansion_Regions.UML_Expansion_Region_Access);
-- Setter of ExpansionNode::regionAsOutput.
--
-- The expansion region for which the node is an output.
overriding function Get_In_State
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.States.Collections.Set_Of_UML_State;
-- Getter of ObjectNode::inState.
--
-- The required states of the object available at this point in the
-- activity.
overriding function Get_Is_Control_Type
(Self : not null access constant UML_Expansion_Node_Proxy)
return Boolean;
-- Getter of ObjectNode::isControlType.
--
-- Tells whether the type of the object node is to be treated as control.
overriding procedure Set_Is_Control_Type
(Self : not null access UML_Expansion_Node_Proxy;
To : Boolean);
-- Setter of ObjectNode::isControlType.
--
-- Tells whether the type of the object node is to be treated as control.
overriding function Get_Ordering
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.UML_Object_Node_Ordering_Kind;
-- Getter of ObjectNode::ordering.
--
-- Tells whether and how the tokens in the object node are ordered for
-- selection to traverse edges outgoing from the object node.
overriding procedure Set_Ordering
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.UML_Object_Node_Ordering_Kind);
-- Setter of ObjectNode::ordering.
--
-- Tells whether and how the tokens in the object node are ordered for
-- selection to traverse edges outgoing from the object node.
overriding function Get_Selection
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Behaviors.UML_Behavior_Access;
-- Getter of ObjectNode::selection.
--
-- Selects tokens for outgoing edges.
overriding procedure Set_Selection
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Behaviors.UML_Behavior_Access);
-- Setter of ObjectNode::selection.
--
-- Selects tokens for outgoing edges.
overriding function Get_Upper_Bound
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Value_Specifications.UML_Value_Specification_Access;
-- Getter of ObjectNode::upperBound.
--
-- The maximum number of tokens allowed in the node. Objects cannot flow
-- into the node if the upper bound is reached.
overriding procedure Set_Upper_Bound
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Value_Specifications.UML_Value_Specification_Access);
-- Setter of ObjectNode::upperBound.
--
-- The maximum number of tokens allowed in the node. Objects cannot flow
-- into the node if the upper bound is reached.
overriding function Get_Activity
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Activities.UML_Activity_Access;
-- Getter of ActivityNode::activity.
--
-- Activity containing the node.
overriding procedure Set_Activity
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Activities.UML_Activity_Access);
-- Setter of ActivityNode::activity.
--
-- Activity containing the node.
overriding function Get_In_Group
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Activity_Groups.Collections.Set_Of_UML_Activity_Group;
-- Getter of ActivityNode::inGroup.
--
-- Groups containing the node.
overriding function Get_In_Interruptible_Region
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Interruptible_Activity_Regions.Collections.Set_Of_UML_Interruptible_Activity_Region;
-- Getter of ActivityNode::inInterruptibleRegion.
--
-- Interruptible regions containing the node.
overriding function Get_In_Partition
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Activity_Partitions.Collections.Set_Of_UML_Activity_Partition;
-- Getter of ActivityNode::inPartition.
--
-- Partitions containing the node.
overriding function Get_In_Structured_Node
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access;
-- Getter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding procedure Set_In_Structured_Node
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access);
-- Setter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding function Get_Incoming
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::incoming.
--
-- Edges that have the node as target.
overriding function Get_Outgoing
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::outgoing.
--
-- Edges that have the node as source.
overriding function Get_Redefined_Node
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node;
-- Getter of ActivityNode::redefinedNode.
--
-- Inherited nodes replaced by this node in a specialization of the
-- activity.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Expansion_Node_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Expansion_Node_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Type
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Types.UML_Type_Access;
-- Getter of TypedElement::type.
--
-- The type of the TypedElement.
-- This information is derived from the return result for this Operation.
overriding procedure Set_Type
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Types.UML_Type_Access);
-- Setter of TypedElement::type.
--
-- The type of the TypedElement.
-- This information is derived from the return result for this Operation.
overriding function Is_Consistent_With
(Self : not null access constant UML_Expansion_Node_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two RedefinableElements
-- in a context in which redefinition is possible, whether redefinition
-- would be logically consistent. By default, this is false; this
-- operation must be overridden for subclasses of RedefinableElement to
-- define the consistency conditions.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Expansion_Node_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding function All_Owning_Packages
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Expansion_Node_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding procedure Enter_Element
(Self : not null access constant UML_Expansion_Node_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Expansion_Node_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Expansion_Node_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Expansion_Nodes;
|
------------------------------------------------------------------------------
-- --
-- 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.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.OCL_Attributes;
with AMF.OCL.Ocl_Expressions;
with AMF.OCL.Variables.Collections;
with AMF.UML.Comments.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Elements.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Types;
with AMF.Visitors.OCL_Iterators;
with AMF.Visitors.OCL_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.OCL_Iterator_Exps is
--------------
-- Get_Body --
--------------
overriding function Get_Body
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access is
begin
return
AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Body
(Self.Element)));
end Get_Body;
--------------
-- Set_Body --
--------------
overriding procedure Set_Body
(Self : not null access OCL_Iterator_Exp_Proxy;
To : AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Body
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Body;
------------------
-- Get_Iterator --
------------------
overriding function Get_Iterator
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.OCL.Variables.Collections.Ordered_Set_Of_OCL_Variable is
begin
return
AMF.OCL.Variables.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Iterator
(Self.Element)));
end Get_Iterator;
----------------
-- Get_Source --
----------------
overriding function Get_Source
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access is
begin
return
AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Source
(Self.Element)));
end Get_Source;
----------------
-- Set_Source --
----------------
overriding procedure Set_Source
(Self : not null access OCL_Iterator_Exp_Proxy;
To : AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Source
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Source;
--------------
-- Get_Type --
--------------
overriding function Get_Type
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Types.UML_Type_Access is
begin
return
AMF.UML.Types.UML_Type_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Type
(Self.Element)));
end Get_Type;
--------------
-- Set_Type --
--------------
overriding procedure Set_Type
(Self : not null access OCL_Iterator_Exp_Proxy;
To : AMF.UML.Types.UML_Type_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Type
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Type;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
--------------
-- Get_Name --
--------------
overriding function Get_Name
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Name;
--------------
-- Set_Name --
--------------
overriding procedure Set_Name
(Self : not null access OCL_Iterator_Exp_Proxy;
To : AMF.Optional_String) is
begin
if To.Is_Empty then
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element, null);
else
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element,
League.Strings.Internals.Internal (To.Value));
end if;
end Set_Name;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access OCL_Iterator_Exp_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Optional_UML_Visibility_Kind is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility
(Self.Element);
end Get_Visibility;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access OCL_Iterator_Exp_Proxy;
To : AMF.UML.Optional_UML_Visibility_Kind) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility
(Self.Element, To);
end Set_Visibility;
-----------------------
-- Get_Owned_Comment --
-----------------------
overriding function Get_Owned_Comment
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Comments.Collections.Set_Of_UML_Comment is
begin
return
AMF.UML.Comments.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Comment
(Self.Element)));
end Get_Owned_Comment;
-----------------------
-- Get_Owned_Element --
-----------------------
overriding function Get_Owned_Element
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Element
(Self.Element)));
end Get_Owned_Element;
---------------
-- Get_Owner --
---------------
overriding function Get_Owner
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Elements.UML_Element_Access is
begin
return
AMF.UML.Elements.UML_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owner
(Self.Element)));
end Get_Owner;
--------------------
-- All_Namespaces --
--------------------
overriding function All_Namespaces
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Namespaces.Collections.Ordered_Set_Of_UML_Namespace is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Namespaces unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.All_Namespaces";
return All_Namespaces (Self);
end All_Namespaces;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant OCL_Iterator_Exp_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.Namespace";
return Namespace (Self);
end Namespace;
--------------------
-- Qualified_Name --
--------------------
overriding function Qualified_Name
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Qualified_Name unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.Qualified_Name";
return Qualified_Name (Self);
end Qualified_Name;
---------------
-- Separator --
---------------
overriding function Separator
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Separator unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.Separator";
return Separator (Self);
end Separator;
------------------------
-- All_Owned_Elements --
------------------------
overriding function All_Owned_Elements
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owned_Elements unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.All_Owned_Elements";
return All_Owned_Elements (Self);
end All_Owned_Elements;
-------------------
-- Must_Be_Owned --
-------------------
overriding function Must_Be_Owned
(Self : not null access constant OCL_Iterator_Exp_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Must_Be_Owned unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Iterator_Exp_Proxy.Must_Be_Owned";
return Must_Be_Owned (Self);
end Must_Be_Owned;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant OCL_Iterator_Exp_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Enter_Iterator_Exp
(AMF.OCL.Iterator_Exps.OCL_Iterator_Exp_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant OCL_Iterator_Exp_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Leave_Iterator_Exp
(AMF.OCL.Iterator_Exps.OCL_Iterator_Exp_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant OCL_Iterator_Exp_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.OCL_Iterators.OCL_Iterator'Class then
AMF.Visitors.OCL_Iterators.OCL_Iterator'Class
(Iterator).Visit_Iterator_Exp
(Visitor,
AMF.OCL.Iterator_Exps.OCL_Iterator_Exp_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.OCL_Iterator_Exps;
|
--//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila (laurent@sfml-dev.org)
-- This software is provided 'as-is', without any express or implied warranty.
-- In no event will the authors be held liable for any damages arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it freely,
-- subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented;
-- you must not claim that you wrote the original software.
-- If you use this software in a product, an acknowledgment
-- in the product documentation would be appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such,
-- and must not be misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--//////////////////////////////////////////////////////////
------------------------------------------------------------
--/ @summary
--/ Graphics module
--/
--/ @description
--/ 2D graphics module: sprites, text, shapes, ...
--/
package Sf.Graphics is
type sfCircleShape is null record;
type sfCircleShape_Ptr is access all sfCircleShape;
type sfConvexShape is null record;
type sfConvexShape_Ptr is access all sfConvexShape;
type sfFont is null record;
type sfFont_Ptr is access all sfFont;
type sfImage is null record;
type sfImage_Ptr is access all sfImage;
type sfShader is null record;
type sfShader_Ptr is access all sfShader;
type sfRectangleShape is null record;
type sfRectangleShape_Ptr is access all sfRectangleShape;
type sfRenderTexture is null record;
type sfRenderTexture_Ptr is access all sfRenderTexture;
type sfRenderWindow is null record;
type sfRenderWindow_Ptr is access all sfRenderWindow;
type sfShape is null record;
type sfShape_Ptr is access all sfShape;
type sfSprite is null record;
type sfSprite_Ptr is access all sfSprite;
type sfText is null record;
type sfText_Ptr is access all sfText;
type sfTexture is null record;
type sfTexture_Ptr is access all sfTexture;
type sfTransformable is null record;
type sfTransformable_Ptr is access all sfTransformable;
type sfVertex is null record;
type sfVertex_Ptr is access all sfVertex;
type sfVertexArray is null record;
type sfVertexArray_Ptr is access all sfVertexArray;
type sfVertexBuffer is null record;
type sfVertexBuffer_Ptr is access all sfVertexBuffer;
type sfView is null record;
type sfView_Ptr is access all sfView;
private
pragma Convention (C, sfCircleShape);
pragma Convention (C, sfCircleShape_Ptr);
pragma Convention (C, sfConvexShape);
pragma Convention (C, sfConvexShape_Ptr);
pragma Convention (C, sfFont);
pragma Convention (C, sfFont_Ptr);
pragma Convention (C, sfImage);
pragma Convention (C, sfImage_Ptr);
pragma Convention (C, sfShader);
pragma Convention (C, sfShader_Ptr);
pragma Convention (C, sfRectangleShape);
pragma Convention (C, sfRectangleShape_Ptr);
pragma Convention (C, sfRenderTexture);
pragma Convention (C, sfRenderTexture_Ptr);
pragma Convention (C, sfRenderWindow);
pragma Convention (C, sfRenderWindow_Ptr);
pragma Convention (C, sfShape);
pragma Convention (C, sfShape_Ptr);
pragma Convention (C, sfSprite);
pragma Convention (C, sfSprite_Ptr);
pragma Convention (C, sfText);
pragma Convention (C, sfText_Ptr);
pragma Convention (C, sfTexture);
pragma Convention (C, sfTexture_Ptr);
pragma Convention (C, sfTransformable);
pragma Convention (C, sfTransformable_Ptr);
pragma Convention (C, sfVertexArray);
pragma Convention (C, sfVertexArray_Ptr);
pragma Convention (C, sfView);
pragma Convention (C, sfView_Ptr);
end Sf.Graphics;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, 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 Abstract_Sources;
with League.Strings;
with League.Strings.Cursors.Characters;
package String_Sources is
type String_Source is new Abstract_Sources.Abstract_Source with private;
overriding function Get_Next
(Self : not null access String_Source)
return Abstract_Sources.Code_Unit_32;
procedure Create
(Self : out String_Source;
Text : League.Strings.Universal_String);
private
type String_Source is new Abstract_Sources.Abstract_Source with record
Text : League.Strings.Universal_String;
Cursor : League.Strings.Cursors.Characters.Character_Cursor;
end record;
end String_Sources;
|
-----------------------------------------------------------------------
-- el-methods -- Bean methods
-- Copyright (C) 2010, 2021 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.
-----------------------------------------------------------------------
package EL.Methods is
pragma Preelaborate;
end EL.Methods;
|
-- SPDX-License-Identifier: MIT
--
-- Copyright (c) 2007 - 2018 Gautier de Montmollin (Maintainer of the Ada version)
-- 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.Compress
-- ------------
--
-- This package facilitates the storage or compression of data.
--
-- Note that unlike decompression where the decoding is unique,
-- there is a quasi indefinite number of ways of compressing data into
-- most Zip-supported formats, including LZW (Shrink), Reduce, Deflate, or LZMA.
-- As a result, you may want to use your own way for compressing data.
-- This package is a portable one and doesn't claim to be the "best".
-- The term "best" is relative to the needs, since there are at least
-- two criteria that usually go in opposite directions: speed and
-- compression ratio, a bit like risk and return in finance.
with DCF.Streams;
package DCF.Zip.Compress is
pragma Preelaborate;
-- Compression_Method is actually reflecting the way of compressing
-- data, not only the final compression format called "method" in
-- Zip specifications.
type Compression_Method is
-- No compression:
(Store,
-- Deflate combines LZ and Huffman encoding; 4 strengths available:
Deflate_Fixed, Deflate_1, Deflate_2, Deflate_3);
type Method_To_Format_Type is array (Compression_Method) of Pkzip_Method;
Method_To_Format : constant Method_To_Format_Type;
-- Deflate_Fixed compresses the data into a single block and with predefined
-- ("fixed") compression structures. The data are basically LZ-compressed
-- only, since the Huffman code sets are flat and not tailored for the data.
subtype Deflation_Method is Compression_Method range Deflate_Fixed .. Deflate_3;
-- The multi-block Deflate methods use refined techniques to decide when to
-- start a new block and what sort of block to put next.
subtype Taillaule_Deflation_Method is Compression_Method range Deflate_1 .. Deflate_3;
User_Abort : exception;
-- Compress data from an input stream to an output stream until
-- End_Of_File(input) = True, or number of input bytes = input_size.
-- If password /= "", an encryption header is written.
procedure Compress_Data
(Input, Output : in out DCF.Streams.Root_Zipstream_Type'Class;
Input_Size : File_Size_Type;
Method : Compression_Method;
Feedback : Feedback_Proc;
CRC : out Unsigned_32;
Output_Size : out File_Size_Type;
Zip_Type : out Unsigned_16);
-- ^ code corresponding to the compression method actually used
private
Method_To_Format : constant Method_To_Format_Type :=
(Store => Store, Deflation_Method => Deflate);
end DCF.Zip.Compress;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (PikeOS 4.2 ARM Version) --
-- --
-- Copyright (C) 2016-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- 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 is a ZFP version of this package for ARM PikeOS 4.2 targets
pragma Restrictions (No_Exception_Propagation);
-- Only local exception handling is supported in this profile
pragma Restrictions (No_Exception_Registration);
-- Disable exception name registration. This capability is not used because
-- it is only required by exception stream attributes which are not supported
-- in this run time.
pragma Restrictions (No_Implicit_Dynamic_Code);
-- Pointers to nested subprograms are not allowed in this run time, in order
-- to prevent the compiler from building "trampolines".
pragma Restrictions (No_Finalization);
-- Controlled types are not supported in this run time
pragma Restrictions (No_Tasking);
-- Tasking is not supported in this run time
pragma Discard_Names;
-- Disable explicitly the generation of names associated with entities in
-- order to reduce the amount of storage used. These names are not used anyway
-- (attributes such as 'Image and 'Value are not supported in this run time).
package System is
pragma Pure;
-- Note that we take advantage of the implementation permission to make
-- this unit Pure instead of Preelaborable (see RM 13.7.1(15)). In Ada
-- 2005, this is Pure in any case (AI-362).
pragma No_Elaboration_Code_All;
-- Allow the use of that restriction in units that WITH this unit
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1);
Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1;
Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size;
Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := Standard'Max_Integer_Size - 1;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := 0.0;
-- Storage-related Declarations
type Address is private;
pragma Preelaborable_Initialization (Address);
Null_Address : constant Address;
Storage_Unit : constant := 8;
Word_Size : constant := 32;
Memory_Size : constant := 2 ** 32;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order := Low_Order_First;
pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
-- Priority-related Declarations (RM D.1)
-- For simplicity there is a 1-1 correspondence between Ada and PikeOS
-- priorities. PikeOS priority 0 is reserved by the idle thread, so not
-- available to Ada.
-- PikeOS priorities are 0 .. 255
-- Priorities greather than 245 are reserved to the system software (PSSW)
-- This implementation reserves priorities 224-239 to interrupts
-- Priorities 240-245 are reserved to HM and PikeOS exception handlers
Max_Priority : constant Positive := 223;
Max_Interrupt_Priority : constant Positive := 239;
subtype Any_Priority is Integer range 1 .. Max_Interrupt_Priority;
subtype Priority is Any_Priority
range Any_Priority'First .. Max_Priority;
subtype Interrupt_Priority is Any_Priority
range Priority'Last + 1 .. Any_Priority'Last;
Default_Priority : constant Priority :=
(Priority'First + Priority'Last) / 2;
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
Atomic_Sync_Default : constant Boolean := False;
Backend_Divide_Checks : constant Boolean := False;
Backend_Overflow_Checks : constant Boolean := True;
Command_Line_Args : constant Boolean := False;
Configurable_Run_Time : constant Boolean := True;
Denorm : constant Boolean := True;
Duration_32_Bits : constant Boolean := True;
Exit_Status_Supported : constant Boolean := True;
Fractional_Fixed_Ops : constant Boolean := False;
Frontend_Layout : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
Preallocated_Stacks : constant Boolean := False;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := False;
Stack_Check_Limits : constant Boolean := False;
Support_Aggregates : constant Boolean := True;
Support_Composite_Assign : constant Boolean := True;
Support_Composite_Compare : constant Boolean := True;
Support_Long_Shifts : constant Boolean := True;
Always_Compatible_Rep : constant Boolean := True;
Suppress_Standard_Library : constant Boolean := True;
Use_Ada_Main_Program_Name : constant Boolean := False;
Frontend_Exceptions : constant Boolean := False;
ZCX_By_Default : constant Boolean := True;
-- The linker switches ordering comes from a project
-- generated with Codeo or pikeos-cloneproject.
pragma Linker_Options
("-u_p4_entry" & ASCII.NUL &
"-u__cxx_local_dtors" & ASCII.NUL &
"-nostdlib" & ASCII.NUL &
"-T../ld/arm-app.ld" & ASCII.NUL &
"-T../ld/memory.ld" & ASCII.NUL &
"-lp4ext" & ASCII.NUL &
"-lgnat" & ASCII.NUL &
"-lvm" & ASCII.NUL &
"-lstand" & ASCII.NUL &
"-lp4" & ASCII.NUL &
"-lgcc");
end System;
|
with STM32GD.Board;
with STM32_SVD; use STM32_SVD;
with STM32_SVD.USART; use STM32_SVD.USART;
package body Last_Chance_Handler is
procedure Put_Char (Char : Byte) is
begin
USART1_Periph.TDR.TDR := UInt9 (Char);
while USART1_Periph.ISR.TXE = 0 loop
null;
end loop;
end Put_Char;
procedure Put_String (String : System.Address) is
S : array (0 .. 31) of Byte;
for S'Address use String;
begin
for C of S loop
exit when C = Byte (0);
Put_Char (C);
end loop;
end Put_String;
procedure Put_String (S: String) is
begin
for C of S loop
exit when C = Character'Val (0);
Put_Char (Character'Pos (C));
end loop;
end Put_String;
-------------------------
-- Last_Chance_Handler --
-------------------------
procedure Last_Chance_Handler (Msg : System.Address; Line : Integer) is
Line_Str : String := Integer'Image (Line);
begin
Put_String ("Program error: ");
Put_String (Msg);
Put_String (Line_Str);
Put_Char (Byte (10));
STM32GD.Board.LED2.Set;
loop
null;
end loop;
end Last_Chance_Handler;
end Last_Chance_Handler;
|
-- @(#)File: csv.ads
-- @(#)Last changed: Aug 6 2015 10:07:13
-- @(#)Purpose: Character Separated Value (CSV) file support
-- @(#)Author: Marc Bejerano <marcbejerano@gmail.com>
-- @(#)Copyright: Copyright (C) 2015, Marc Bejerano, All Rights Reserved
-- @(#)Product: None
-- @(#)License: BSD3
--
-- Copyright (c) 2015, Marc Bejerano
-- 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 ada-tools 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.
-- RFC4180 https://tools.ietf.org/html/rfc4180
with Ada.Containers.Vectors;
with Ada.Strings.Unbounded;
with Ada.Text_IO;
package CSV is
package ASU renames Ada.Strings.Unbounded;
use ASU;
package String_Vectors is new Ada.Containers.Vectors(Natural, Unbounded_String);
use String_Vectors;
type CSV_Record is new String_Vectors.Vector with null record;
--
-- Return the size of the CSV record. This function just returns the length
-- of the container (vector).
-- @param rec CSV record
-- @return Size of the record, in columns
--
function Size(rec: in CSV_Record) return Natural;
--
-- Retrieve the CSV record value at the given index. If the given index falls
-- outside of the range of available columns then a Constraint_Error will be
-- raised.
-- @param rec CSV record
-- @param index Column index
-- @return CSV column value
--
function Get(rec: in CSV_Record;
index: in Natural) return String;
--
-- Update the CSV element at the given column index with the supplied value.
-- If the given index falls outside of the range of available columns then
-- a Constraint_Error will be raised.
-- @param rec CSV record
-- @param index Column index
-- @param value New column value
--
procedure Set(rec: in out CSV_Record;
index: in Natural;
value: in String);
type CSV_File is tagged limited private;
--
-- Open the CSV file for reading and/or writing.
-- @param csv CSV object
-- @param file_name Name of the CSV file
-- @param mode File mode (In_File, Out_File, or In_Out_File)
-- @param has_header True if this CSV file has a header line
--
procedure Open(csv: in out CSV_File;
file_name: in String;
mode: in Ada.Text_IO.File_Mode := Ada.Text_IO.In_File;
delimiter: in String := ",";
has_header: in Boolean := false);
--
-- Close the CSV file.
-- @param csv CSV file
--
procedure Close(csv: in out CSV_File);
--
-- Return the column index for the named column. IF the named column does
-- not exist in the headers then a Contraint_Error will be thrown.
-- @param csv CSV File
-- @param column_name Name of column to look up
-- @return Index of the named column
--
function Column_Index(csv: in CSV_File;
column_name: in String) return Natural;
--
-- Read the next line from the CSV file. If there are no more lines in the
-- file to read then an End_Error will be raised.
-- @param csv CSV File
-- @param delimiter Delimiter override (supercedes the CSV file object)
-- @return CSV_Record
--
function Read(csv: in CSV_File'Class;
delimiter: in String := ",") return CSV_Record;
--
-- Write the given CSV record into the provede CSV file using the delimiter
-- specified. If the use_quotes is set to True then all columns will be
-- emitted surrounded by double quotes and all quotes inside those columns
-- will be escaped (by double-quoting the double-quotes).
-- @param csv CSV File
-- @param rec CSV Record
-- @param delimiter Column delimiter
-- @param use_quotes Force column quotes
--
procedure Write(csv: in CSV_File'Class;
rec: in CSV_Record;
delimiter: in String := ",";
use_quotes: in Boolean := True);
private
type CSV_File is tagged limited record
headers: CSV_Record;
file: Ada.text_IO.File_Type;
delim: Character := ',';
end record;
end CSV;
|
-- C45347B.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT CATENATION IS DEFINED FOR ARRAY TYPES AS COMPONENT TYPES.
-- JWC 11/15/85
WITH REPORT; USE REPORT;
PROCEDURE C45347B IS
BEGIN
TEST ("C45347B", "CHECK THAT CATENATION IS DEFINED " &
"FOR ARRAY TYPES AS COMPONENT TYPES");
DECLARE
TYPE ARR IS ARRAY (1 .. 2) OF INTEGER;
TYPE A IS ARRAY ( INTEGER RANGE <>) OF ARR;
AR1 : ARR := (4,1);
AR2 : ARR := (1,1);
A1 : A(1 .. 2) := ((1,1), (2,1));
A2 : A(1 .. 2) := ((3,1), (4,1));
A3 : A(1 .. 4) := ((1,1), (2,1), (3,1), (4,1));
A4 : A(1 .. 4);
A5 : A(1 .. 4) := ((4,1), (3,1), (2,1), (1,1));
BEGIN
A4 := A1 & A2;
IF A3 /= A4 THEN
FAILED ("INCORRECT CATENATION FOR ARRAYS OF ARRAYS");
END IF;
A4 := A5;
A4 := A1 & A2(1) & AR1;
IF A3 /= A4 THEN
FAILED ("INCORRECT CATENATION FOR ARRAY OF ARRAYS " &
"WITH ARRAYS");
END IF;
A4 := A5;
A4 := AR2 & (A1(2) & A2);
IF A3 /= A4 THEN
FAILED ("INCORRECT CATENATION FOR ARRAYS WITH ARRAYS " &
"OF ARRAYS");
END IF;
A4 := A5;
A4 := A'(AR2 & A1(2)) & A'(A2(1) & AR1);
IF A3 /= A4 THEN
FAILED ("INCORRECT CATENATION FOR ARRAYS");
END IF;
END;
RESULT;
END C45347B;
|
with Freetype;
package Render.Fonts is
FONT_SIZE : constant := 14;
-- We reuse this object to store the current character glyph
face : Freetype.FT_Face;
emojiFace : Freetype.FT_Face;
--glyph : Freetype.FT_GlyphSlot;
function loadGlyph (c : Character; fontFace : Freetype.FT_Face) return Boolean;
function loadGlyph (c : Wide_Wide_Character; fontFace : Freetype.FT_Face) return Boolean;
---------------------------------------------------------------------------
-- start
-- Initialize Freetype and Fontconfig libraries
---------------------------------------------------------------------------
procedure start;
---------------------------------------------------------------------------
-- stop
-- Perform clean up of Freetype and Fontconfig libraries
---------------------------------------------------------------------------
procedure stop;
end Render.Fonts; |
-- Copyright 2007-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program 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 General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
Procedure_Result : Character := ' ';
procedure Same (C : Character);
-- Set Procedure_Result to C.
procedure Next (C : in out Character);
-- Increment C (if C is the last character, then set C to the first
-- character). Set Procedure_Result to the new value of C.
end Pck;
|
separate (Numerics.Sparse_Matrices)
function Is_Square_Matrix (A : in Sparse_Matrix) return Boolean is
begin
if A.N_Row = A.N_Col then
return True;
else
return False;
end if;
end Is_Square_Matrix;
|
-- { dg-do link }
-- { dg-options "-largs -f -margs -flto" { target lto } }
-- { dg-skip-if "missing linker support" { *-*-solaris2.* } }
procedure Lto14 is
begin
null;
end;
|
package Employee is
type Person_T is tagged private;
-- create primitive subprograms to set/get attributes for Person_T and
-- to print the contents of Person_T
procedure Set_Attribute
(O : in out Person_T;
Value : String);
function Get_Attribute
(O : Person_T)
return String;
procedure Print (O : Person_T);
-- Create a new type Employee_T based on Person with some
-- additional attributes
-- Create primitive subprograms to set/get these new attributes and to
-- print the entire contents of Employee_T
-- Create a new type Position_T based on Person with some
-- additional attributes
-- Create primitive subprograms to set/get these new attributes and to
-- print the entire contents of Position_T
private
type Person_T is tagged null record;
end Employee;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . D E C I M A L _ A U X --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, 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 package contains the routines for Ada.Text_IO.Decimal_IO that are
-- shared among separate instantiations of this package. The routines in
-- the package are identical semantically to those declared in Text_IO,
-- except that default values have been supplied by the generic, and the
-- Num parameter has been replaced by Integer or Long_Long_Integer, with
-- an additional Scale parameter giving the value of Num'Scale. In addition
-- the Get routines return the value rather than store it in an Out parameter.
private package Ada.Text_IO.Decimal_Aux is
function Get_Dec
(File : File_Type;
Width : Field;
Scale : Integer) return Integer;
function Get_LLD
(File : File_Type;
Width : Field;
Scale : Integer) return Long_Long_Integer;
procedure Put_Dec
(File : File_Type;
Item : Integer;
Fore : Field;
Aft : Field;
Exp : Field;
Scale : Integer);
procedure Put_LLD
(File : File_Type;
Item : Long_Long_Integer;
Fore : Field;
Aft : Field;
Exp : Field;
Scale : Integer);
function Gets_Dec
(From : String;
Last : not null access Positive;
Scale : Integer) return Integer;
function Gets_LLD
(From : String;
Last : not null access Positive;
Scale : Integer) return Long_Long_Integer;
procedure Puts_Dec
(To : out String;
Item : Integer;
Aft : Field;
Exp : Field;
Scale : Integer);
procedure Puts_LLD
(To : out String;
Item : Long_Long_Integer;
Aft : Field;
Exp : Field;
Scale : Integer);
end Ada.Text_IO.Decimal_Aux;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dct</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>input_r</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>input</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>output_r</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>output</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>26</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>row_outbuf_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>col_outbuf_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>col_inbuf_0</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second class_id="12" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[0]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>col_inbuf_1</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[1]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>col_inbuf_2</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[2]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>col_inbuf_3</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[3]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>col_inbuf_4</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[4]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>col_inbuf_5</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[5]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>col_inbuf_6</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[6]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>col_inbuf_7</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>27</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>27</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[7]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>buf_2d_in_0</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[0]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>buf_2d_in_1</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[1]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>buf_2d_in_2</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[2]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>buf_2d_in_3</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[3]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>buf_2d_in_4</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[4]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>buf_2d_in_5</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[5]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>buf_2d_in_6</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[6]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>buf_2d_in_7</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_in[7]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>buf_2d_out</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buf_2d_out</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>20</count>
<item_version>0</item_version>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>114</item>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
<item>149</item>
<item>150</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>12</count>
<item_version>0</item_version>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>148</item>
<item>151</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>20</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>147</item>
<item>152</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>109</item>
<item>146</item>
<item>153</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
<item>113</item>
<item>145</item>
<item>154</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>91</lineNumber>
<contextFuncName>dct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>91</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>42</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>62</id>
<name>read_data</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:read_data></content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>73</id>
<name>Loop_Row_DCT_Loop_pr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Row_DCT_Loop_pr></content>
</item>
<item class_id_reference="16" object_id="_32">
<Value>
<Obj>
<type>2</type>
<id>84</id>
<name>Loop_Xpose_Row_Outer</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Xpose_Row_Outer></content>
</item>
<item class_id_reference="16" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>95</id>
<name>Loop_Col_DCT_Loop_pr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Col_DCT_Loop_pr></content>
</item>
<item class_id_reference="16" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>106</id>
<name>Loop_Xpose_Col_Outer</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:Loop_Xpose_Col_Outer></content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>110</id>
<name>write_data</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:write_data></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_36">
<Obj>
<type>3</type>
<id>41</id>
<name>dct</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>26</count>
<item_version>0</item_version>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>91</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_37">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>145</id>
<edge_type>4</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>146</id>
<edge_type>4</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>147</id>
<edge_type>4</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>148</id>
<edge_type>4</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>149</id>
<edge_type>4</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>150</id>
<edge_type>4</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>151</id>
<edge_type>4</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>152</id>
<edge_type>4</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>153</id>
<edge_type>4</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>154</id>
<edge_type>4</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_128">
<mId>1</mId>
<mTag>dct</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>515</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>1</mIsDfPipe>
<mDfPipe class_id="23" tracking_level="1" version="0" object_id="_129">
<port_list class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port_list>
<process_list class_id="25" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_130">
<type>0</type>
<name>read_data_U0</name>
<ssdmobj_id>34</ssdmobj_id>
<pins class_id="27" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_131">
<port class_id="29" tracking_level="1" version="0" object_id="_132">
<name>input</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id="30" tracking_level="1" version="0" object_id="_133">
<type>0</type>
<name>read_data_U0</name>
<ssdmobj_id>34</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_134">
<port class_id_reference="29" object_id="_135">
<name>buf_0</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
<item class_id_reference="28" object_id="_136">
<port class_id_reference="29" object_id="_137">
<name>buf_1</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
<item class_id_reference="28" object_id="_138">
<port class_id_reference="29" object_id="_139">
<name>buf_2</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
<item class_id_reference="28" object_id="_140">
<port class_id_reference="29" object_id="_141">
<name>buf_3</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
<item class_id_reference="28" object_id="_142">
<port class_id_reference="29" object_id="_143">
<name>buf_4</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
<item class_id_reference="28" object_id="_144">
<port class_id_reference="29" object_id="_145">
<name>buf_5</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
<item class_id_reference="28" object_id="_146">
<port class_id_reference="29" object_id="_147">
<name>buf_6</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
<item class_id_reference="28" object_id="_148">
<port class_id_reference="29" object_id="_149">
<name>buf_7</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_150">
<type>0</type>
<name>Loop_Row_DCT_Loop_pr_U0</name>
<ssdmobj_id>35</ssdmobj_id>
<pins>
<count>17</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_151">
<port class_id_reference="29" object_id="_152">
<name>buf_2d_in_0</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_153">
<type>0</type>
<name>Loop_Row_DCT_Loop_pr_U0</name>
<ssdmobj_id>35</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_154">
<port class_id_reference="29" object_id="_155">
<name>buf_2d_in_1</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_156">
<port class_id_reference="29" object_id="_157">
<name>buf_2d_in_2</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_158">
<port class_id_reference="29" object_id="_159">
<name>buf_2d_in_3</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_160">
<port class_id_reference="29" object_id="_161">
<name>buf_2d_in_4</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_162">
<port class_id_reference="29" object_id="_163">
<name>buf_2d_in_5</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_164">
<port class_id_reference="29" object_id="_165">
<name>buf_2d_in_6</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_166">
<port class_id_reference="29" object_id="_167">
<name>buf_2d_in_7</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_168">
<port class_id_reference="29" object_id="_169">
<name>row_outbuf_i</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_170">
<port class_id_reference="29" object_id="_171">
<name>dct_coeff_table_0</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_172">
<port class_id_reference="29" object_id="_173">
<name>dct_coeff_table_1</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_174">
<port class_id_reference="29" object_id="_175">
<name>dct_coeff_table_2</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_176">
<port class_id_reference="29" object_id="_177">
<name>dct_coeff_table_3</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_178">
<port class_id_reference="29" object_id="_179">
<name>dct_coeff_table_4</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_180">
<port class_id_reference="29" object_id="_181">
<name>dct_coeff_table_5</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_182">
<port class_id_reference="29" object_id="_183">
<name>dct_coeff_table_6</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
<item class_id_reference="28" object_id="_184">
<port class_id_reference="29" object_id="_185">
<name>dct_coeff_table_7</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_186">
<type>0</type>
<name>Loop_Xpose_Row_Outer_U0</name>
<ssdmobj_id>36</ssdmobj_id>
<pins>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_187">
<port class_id_reference="29" object_id="_188">
<name>row_outbuf_i</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_189">
<type>0</type>
<name>Loop_Xpose_Row_Outer_U0</name>
<ssdmobj_id>36</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_190">
<port class_id_reference="29" object_id="_191">
<name>col_inbuf_0</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
<item class_id_reference="28" object_id="_192">
<port class_id_reference="29" object_id="_193">
<name>col_inbuf_1</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
<item class_id_reference="28" object_id="_194">
<port class_id_reference="29" object_id="_195">
<name>col_inbuf_2</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
<item class_id_reference="28" object_id="_196">
<port class_id_reference="29" object_id="_197">
<name>col_inbuf_3</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
<item class_id_reference="28" object_id="_198">
<port class_id_reference="29" object_id="_199">
<name>col_inbuf_4</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
<item class_id_reference="28" object_id="_200">
<port class_id_reference="29" object_id="_201">
<name>col_inbuf_5</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
<item class_id_reference="28" object_id="_202">
<port class_id_reference="29" object_id="_203">
<name>col_inbuf_6</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
<item class_id_reference="28" object_id="_204">
<port class_id_reference="29" object_id="_205">
<name>col_inbuf_7</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_206">
<type>0</type>
<name>Loop_Col_DCT_Loop_pr_U0</name>
<ssdmobj_id>37</ssdmobj_id>
<pins>
<count>17</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_207">
<port class_id_reference="29" object_id="_208">
<name>col_inbuf_0</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_209">
<type>0</type>
<name>Loop_Col_DCT_Loop_pr_U0</name>
<ssdmobj_id>37</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_210">
<port class_id_reference="29" object_id="_211">
<name>col_inbuf_1</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_212">
<port class_id_reference="29" object_id="_213">
<name>col_inbuf_2</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_214">
<port class_id_reference="29" object_id="_215">
<name>col_inbuf_3</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_216">
<port class_id_reference="29" object_id="_217">
<name>col_inbuf_4</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_218">
<port class_id_reference="29" object_id="_219">
<name>col_inbuf_5</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_220">
<port class_id_reference="29" object_id="_221">
<name>col_inbuf_6</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_222">
<port class_id_reference="29" object_id="_223">
<name>col_inbuf_7</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_224">
<port class_id_reference="29" object_id="_225">
<name>col_outbuf_i</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_226">
<port class_id_reference="29" object_id="_227">
<name>dct_coeff_table_0</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_228">
<port class_id_reference="29" object_id="_229">
<name>dct_coeff_table_1</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_230">
<port class_id_reference="29" object_id="_231">
<name>dct_coeff_table_2</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_232">
<port class_id_reference="29" object_id="_233">
<name>dct_coeff_table_3</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_234">
<port class_id_reference="29" object_id="_235">
<name>dct_coeff_table_4</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_236">
<port class_id_reference="29" object_id="_237">
<name>dct_coeff_table_5</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_238">
<port class_id_reference="29" object_id="_239">
<name>dct_coeff_table_6</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
<item class_id_reference="28" object_id="_240">
<port class_id_reference="29" object_id="_241">
<name>dct_coeff_table_7</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_242">
<type>0</type>
<name>Loop_Xpose_Col_Outer_U0</name>
<ssdmobj_id>38</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_243">
<port class_id_reference="29" object_id="_244">
<name>col_outbuf_i</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_245">
<type>0</type>
<name>Loop_Xpose_Col_Outer_U0</name>
<ssdmobj_id>38</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_246">
<port class_id_reference="29" object_id="_247">
<name>buf_2d_out</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_245"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_248">
<type>0</type>
<name>write_data_U0</name>
<ssdmobj_id>39</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_249">
<port class_id_reference="29" object_id="_250">
<name>buf</name>
<dir>2</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_251">
<type>0</type>
<name>write_data_U0</name>
<ssdmobj_id>39</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_252">
<port class_id_reference="29" object_id="_253">
<name>output</name>
<dir>2</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_251"></inst>
</item>
</pins>
</item>
</process_list>
<channel_list class_id="31" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="1" version="0" object_id="_254">
<type>1</type>
<name>buf_2d_in_0</name>
<ssdmobj_id>25</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_255">
<port class_id_reference="29" object_id="_256">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_257">
<port class_id_reference="29" object_id="_258">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_259">
<type>1</type>
<name>buf_2d_in_1</name>
<ssdmobj_id>26</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_260">
<port class_id_reference="29" object_id="_261">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_262">
<port class_id_reference="29" object_id="_263">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_264">
<type>1</type>
<name>buf_2d_in_2</name>
<ssdmobj_id>27</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_265">
<port class_id_reference="29" object_id="_266">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_267">
<port class_id_reference="29" object_id="_268">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_269">
<type>1</type>
<name>buf_2d_in_3</name>
<ssdmobj_id>28</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_270">
<port class_id_reference="29" object_id="_271">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_272">
<port class_id_reference="29" object_id="_273">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_274">
<type>1</type>
<name>buf_2d_in_4</name>
<ssdmobj_id>29</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_275">
<port class_id_reference="29" object_id="_276">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_277">
<port class_id_reference="29" object_id="_278">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_279">
<type>1</type>
<name>buf_2d_in_5</name>
<ssdmobj_id>30</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_280">
<port class_id_reference="29" object_id="_281">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_282">
<port class_id_reference="29" object_id="_283">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_284">
<type>1</type>
<name>buf_2d_in_6</name>
<ssdmobj_id>31</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_285">
<port class_id_reference="29" object_id="_286">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_287">
<port class_id_reference="29" object_id="_288">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_289">
<type>1</type>
<name>buf_2d_in_7</name>
<ssdmobj_id>32</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_290">
<port class_id_reference="29" object_id="_291">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_133"></inst>
</source>
<sink class_id_reference="28" object_id="_292">
<port class_id_reference="29" object_id="_293">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_294">
<type>1</type>
<name>row_outbuf_i</name>
<ssdmobj_id>14</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_295">
<port class_id_reference="29" object_id="_296">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_153"></inst>
</source>
<sink class_id_reference="28" object_id="_297">
<port class_id_reference="29" object_id="_298">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_299">
<type>1</type>
<name>col_inbuf_0</name>
<ssdmobj_id>16</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_300">
<port class_id_reference="29" object_id="_301">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_302">
<port class_id_reference="29" object_id="_303">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_304">
<type>1</type>
<name>col_inbuf_1</name>
<ssdmobj_id>17</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_305">
<port class_id_reference="29" object_id="_306">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_307">
<port class_id_reference="29" object_id="_308">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_309">
<type>1</type>
<name>col_inbuf_2</name>
<ssdmobj_id>18</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_310">
<port class_id_reference="29" object_id="_311">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_312">
<port class_id_reference="29" object_id="_313">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_314">
<type>1</type>
<name>col_inbuf_3</name>
<ssdmobj_id>19</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_315">
<port class_id_reference="29" object_id="_316">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_317">
<port class_id_reference="29" object_id="_318">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_319">
<type>1</type>
<name>col_inbuf_4</name>
<ssdmobj_id>20</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_320">
<port class_id_reference="29" object_id="_321">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_322">
<port class_id_reference="29" object_id="_323">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_324">
<type>1</type>
<name>col_inbuf_5</name>
<ssdmobj_id>21</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_325">
<port class_id_reference="29" object_id="_326">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_327">
<port class_id_reference="29" object_id="_328">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_329">
<type>1</type>
<name>col_inbuf_6</name>
<ssdmobj_id>22</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_330">
<port class_id_reference="29" object_id="_331">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_332">
<port class_id_reference="29" object_id="_333">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_334">
<type>1</type>
<name>col_inbuf_7</name>
<ssdmobj_id>23</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_335">
<port class_id_reference="29" object_id="_336">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_189"></inst>
</source>
<sink class_id_reference="28" object_id="_337">
<port class_id_reference="29" object_id="_338">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_339">
<type>1</type>
<name>col_outbuf_i</name>
<ssdmobj_id>15</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_340">
<port class_id_reference="29" object_id="_341">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_209"></inst>
</source>
<sink class_id_reference="28" object_id="_342">
<port class_id_reference="29" object_id="_343">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_245"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_344">
<type>1</type>
<name>buf_2d_out</name>
<ssdmobj_id>33</ssdmobj_id>
<ctype>1</ctype>
<depth>0</depth>
<bitwidth>0</bitwidth>
<source class_id_reference="28" object_id="_345">
<port class_id_reference="29" object_id="_346">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_245"></inst>
</source>
<sink class_id_reference="28" object_id="_347">
<port class_id_reference="29" object_id="_348">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_251"></inst>
</sink>
</item>
</channel_list>
<net_list class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</net_list>
</mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="34" tracking_level="1" version="0" object_id="_349">
<states class_id="35" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="1" version="0" object_id="_350">
<id>1</id>
<operations class_id="37" tracking_level="0" version="0">
<count>20</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="1" version="0" object_id="_351">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_352">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_353">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_354">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_355">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_356">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_357">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_358">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_359">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_360">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_361">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_362">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_363">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_364">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_365">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_366">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_367">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_368">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_369">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_370">
<id>34</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_371">
<id>2</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_372">
<id>34</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_373">
<id>3</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_374">
<id>35</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_375">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_376">
<id>35</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_377">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_378">
<id>36</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_379">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_380">
<id>36</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_381">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_382">
<id>37</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_383">
<id>8</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_384">
<id>37</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_385">
<id>9</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_386">
<id>38</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_387">
<id>10</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_388">
<id>38</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_389">
<id>11</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_390">
<id>39</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_391">
<id>12</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_392">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_393">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_394">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_395">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_396">
<id>39</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="38" object_id="_397">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="39" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="1" version="0" object_id="_398">
<inState>1</inState>
<outState>2</outState>
<condition class_id="41" tracking_level="0" version="0">
<id>0</id>
<sop class_id="42" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_399">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_400">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>2</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_401">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>3</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_402">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>4</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_403">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>5</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_404">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>6</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_405">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>7</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_406">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>8</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_407">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>9</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_408">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>10</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="45" tracking_level="0" version="0">
<count>26</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>14</first>
<second class_id="47" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>10</first>
<second>1</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="48" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>41</first>
<second class_id="50" tracking_level="0" version="0">
<first>0</first>
<second>11</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="51" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="1" version="0" object_id="_409">
<region_name>dct</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</basic_blocks>
<nodes>
<count>30</count>
<item_version>0</item_version>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>16</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="53" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>50</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>78</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
<item>
<first>151</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>37</item>
</second>
</item>
<item>
<first>180</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>38</item>
</second>
</item>
<item>
<first>193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>34</item>
<item>34</item>
</second>
</item>
<item>
<first>215</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>36</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="56" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="57" tracking_level="0" version="0">
<first>buf_2d_in_0_alloca_fu_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>buf_2d_in_1_alloca_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>buf_2d_in_2_alloca_fu_94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>buf_2d_in_3_alloca_fu_98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>buf_2d_in_4_alloca_fu_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>buf_2d_in_5_alloca_fu_106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>buf_2d_in_6_alloca_fu_110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>buf_2d_in_7_alloca_fu_114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>buf_2d_out_alloca_fu_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>col_inbuf_0_alloca_fu_54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>col_inbuf_1_alloca_fu_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>col_inbuf_2_alloca_fu_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>col_inbuf_3_alloca_fu_66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>col_inbuf_4_alloca_fu_70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>col_inbuf_5_alloca_fu_74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>col_inbuf_6_alloca_fu_78</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>col_inbuf_7_alloca_fu_82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>col_outbuf_i_alloca_fu_50</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>row_outbuf_i_alloca_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>6</count>
<item_version>0</item_version>
<item>
<first>grp_Loop_Col_DCT_Loop_pr_fu_151</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>37</item>
</second>
</item>
<item>
<first>grp_Loop_Row_DCT_Loop_pr_fu_122</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
<item>
<first>grp_Loop_Xpose_Col_Outer_fu_187</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>38</item>
</second>
</item>
<item>
<first>grp_Loop_Xpose_Row_Outer_fu_215</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>36</item>
</second>
</item>
<item>
<first>grp_read_data_fu_193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>34</item>
<item>34</item>
</second>
</item>
<item>
<first>grp_write_data_fu_180</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="58" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="59" tracking_level="0" version="0">
<first class_id="60" tracking_level="0" version="0">
<first>dct_coeff_table_0</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_1</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_2</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_3</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_4</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_5</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_6</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_7</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>37</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="61" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="62" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="63" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>19</count>
<item_version>0</item_version>
<item>
<first>14</first>
<second>RAM</second>
</item>
<item>
<first>15</first>
<second>RAM</second>
</item>
<item>
<first>16</first>
<second>RAM</second>
</item>
<item>
<first>17</first>
<second>RAM</second>
</item>
<item>
<first>18</first>
<second>RAM</second>
</item>
<item>
<first>19</first>
<second>RAM</second>
</item>
<item>
<first>20</first>
<second>RAM</second>
</item>
<item>
<first>21</first>
<second>RAM</second>
</item>
<item>
<first>22</first>
<second>RAM</second>
</item>
<item>
<first>23</first>
<second>RAM</second>
</item>
<item>
<first>25</first>
<second>RAM</second>
</item>
<item>
<first>26</first>
<second>RAM</second>
</item>
<item>
<first>27</first>
<second>RAM</second>
</item>
<item>
<first>28</first>
<second>RAM</second>
</item>
<item>
<first>29</first>
<second>RAM</second>
</item>
<item>
<first>30</first>
<second>RAM</second>
</item>
<item>
<first>31</first>
<second>RAM</second>
</item>
<item>
<first>32</first>
<second>RAM</second>
</item>
<item>
<first>33</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
generic
type Element_Type is private;
C_Max_Number : Positive;
package Q_Gen_Shuffle is
type Array_Type is array (Positive range 1 .. C_Max_Number) of Element_Type;
procedure P_Shuffle (List : in out Array_Type);
end Q_Gen_Shuffle;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, 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 class represents an instance of an Association, in the same way that
-- Element represents an instance of a Class.
------------------------------------------------------------------------------
with AMF.CMOF.Associations;
with AMF.Elements;
package AMF.Links is
pragma Preelaborate;
type Link is limited interface;
type Link_Access is access all Link'Class;
for Link_Access'Storage_Size use 0;
not overriding function Get_Association
(Self : not null access constant Link)
return not null AMF.CMOF.Associations.CMOF_Association_Access
is abstract;
-- This is the Association of which the Link is an instance.
not overriding function Get_First_End
(Self : not null access constant Link)
return not null AMF.Elements.Element_Access is abstract;
-- This is the Element associated with the first end of the Association.
not overriding function Get_Second_End
(Self : not null access constant Link)
return not null AMF.Elements.Element_Access is abstract;
-- This is the Element associated with the second end of the Association.
not overriding procedure Delete
(Self : not null access constant Link) is abstract;
-- Deletes the Link. This may leave the same elements associated by other
-- links for this Association.
end AMF.Links;
|
-- A string set is just a weaker form of regular expression. A string
-- set is a finite set of strings where each character belongs to a set.
--
-- A string set can be represented by a regex of the form
--
-- [...][...][...]
--
-- that is, as a concatenation of character sets.
--
-- This is convenient choice when you do not need the full "weight" of
-- usual regexs.
with Ada.Strings.Maps; use Ada.Strings.Maps;
package String_Sets is
type Set_String (<>) is private;
function To_Set_String (X : String) return Set_String;
-- Create a string set that contains only X
function "&" (X, Y : Set_String) return Set_String;
function "&" (X : String; Y : Character_Set) return Set_String;
function Match (X : String; Pattern : Set_String) return Boolean;
private
type Basic_Set_String is array (Positive range <>) of Character_Set;
type Set_String is new Basic_Set_String;
function "&" (X, Y : Set_String) return Set_String
is (Set_String(Basic_Set_String (X) & Basic_Set_String (Y)));
function "&" (X : String; Y : Character_Set) return Set_String
is (To_Set_String (X) & Set_String'(1 => Y));
end String_Sets;
|
-- C52104Y.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT LENGTHS MUST MATCH IN ARRAY AND SLICE ASSIGNMENTS.
-- MORE SPECIFICALLY, TEST THAT ATTEMPTED ASSIGNMENTS BETWEEN
-- ARRAYS WITH NON-MATCHING LENGTHS LEAVE THE DESTINATION ARRAY
-- INTACT AND CAUSE CONSTRAINT_ERROR TO BE RAISED.
-- (OVERLAPS BETWEEN THE OPERANDS OF THE ASSIGNMENT STATEMENT
-- ARE TREATED ELSEWHERE.)
-- THIS IS A SPECIAL CASE IN
-- DIVISION D : NULL ARRAYS WHOSE LENGTHS ARE NOT DETERMINABLE
-- STATICALLY
-- WHICH (THE SPECIAL CASE) TREATS TWO-DIMENSIONAL ARRAYS WHOSE LENGTH
-- ALONG ONE DIMENSION IS GREATER THAN INTEGER'LAST AND WHOSE
-- LENGTH ALONG THE OTHER DIMENSION IS 0 .
-- AN ADDITIONAL OBJECTIVE OF THIS TEST IS TO CHECK WHETHER LENGTH
-- COMPARISONS (AND LENGTH COMPUTATIONS) CAUSE CONSTRAINT_ERROR
-- TO BE RAISED.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- *** -- 9X
-- RM 07/31/81
-- SPS 03/22/83
-- JBG 06/16/83
-- EG 10/28/85 FIX NUMERIC_ERROR/CONSTRAINT_ERROR ACCORDING TO
-- AI-00387.
-- MRM 03/30/93 REMOVE NUMERIC_ERROR FOR 9X COMPATIBILITY
WITH REPORT;
PROCEDURE C52104Y IS
USE REPORT ;
BEGIN
TEST( "C52104Y" , "CHECK THAT IN ARRAY ASSIGNMENTS AND IN SLICE" &
" ASSIGNMENTS, THE LENGTHS MUST MATCH" );
-- IN THIS TEST WE CAN'T USE AGGREGATE ASSIGNMENT (EXCEPT WHEN
-- THE AGGREGATES ARE STRING LITERALS); THEREFORE:
--
-- (1) ARRAYS WILL BE INITIALIZED BY INDIVIDUAL ASSIGNMENTS;
-- (2) CAN'T USE NON-NULL CONSTANT ARRAYS.
-- WE ASSUME THAT IN AN ARRAY_TYPE_DEFINITION THE INDEX PORTION
-- AND THE COMPONENT_TYPE PORTION ARE FUNCTIONALLY ORTHOGONAL
-- ALSO AT THE IMPLEMENTATION LEVEL, I.E. THAT THE CORRECTNESS
-- OF THE ACCESSING MECHANISM FOR ARRAYS DOES NOT DEPEND ON
-- COMPONENT_TYPE. ACCORDINGLY WE ARE TESTING FOR SOME BUT
-- NOT ALL KINDS OF COMPONENT_TYPE. (COMPONENT_TYPES INCLUDED:
-- INTEGER , CHARACTER , BOOLEAN .)
-------------------------------------------------------------------
-- (10) MULTIDIMENSIONAL ARRAY OBJECTS WHOSE TYPEMARKS WERE
-- DEFINED USING THE "BOX" COMPOUND SYMBOL.
-- (TWO-DIMENSIONAL ARRAYS OF BOOLEANS.)
CONSTR_ERR:
BEGIN -- THIS BLOCK CATCHES CONSTRAINT_ERROR IF IT IS
-- RAISED BY THE SUBTYPE DECLARATION.
DCL_ARR: DECLARE
TYPE TABOX5 IS ARRAY( INTEGER RANGE <> ,
INTEGER RANGE <> ) OF BOOLEAN ;
PRAGMA PACK (TABOX5);
SUBTYPE TABOX52 IS TABOX5(
IDENT_INT(13)..IDENT_INT( 13 ) ,
IDENT_INT(-6)..IDENT_INT( INTEGER'LAST-4 ) );
BEGIN
COMMENT ("NO CONSTRAINT_ERROR FOR NON-NULL ARRAY SUBTYPE " &
"WHEN ONE DIMENSION HAS INTEGER'LAST + 3 " &
"COMPONENTS");
OBJ_DCL: DECLARE -- THIS BLOCK DECLARES ONE NULL ARRAY AND ONE
-- PACKED BOOLEAN ARRAY WITH INTEGER'LAST + 3
-- COMPONENTS; STORAGE ERROR MAY BE RAISED.
ARRX51 : TABOX5(
IDENT_INT(13)..IDENT_INT( 12 ) ,
IDENT_INT(-6)..IDENT_INT( INTEGER'LAST-4 ) );
ARRX52 : TABOX52 ; -- BIG ARRAY HERE.
BEGIN
COMMENT ("NO CONSTRAINT OR STORAGE ERROR WHEN ARRAY "&
"WITH INTEGER'LAST+3 COMPONENTS ALLOCATED");
-- NULL ARRAY ASSIGNMENT:
ARRX52 := ARRX51 ;
FAILED( "EXCEPTION NOT RAISED (10)" );
EXCEPTION
WHEN CONSTRAINT_ERROR =>
COMMENT ("CONSTRAINT_ERROR RAISED WHEN " &
"CHECKING LENGTHS FOR ARRAY HAVING " &
"> INTEGER'LAST COMPONENTS ON ONE " &
"DIMENSION");
WHEN OTHERS =>
FAILED( "OTHER EXCEPTION RAISED - SUBTEST 10");
END OBJ_DCL;
EXCEPTION
WHEN STORAGE_ERROR =>
COMMENT ("STORAGE_ERROR RAISED WHEN DECLARING ONE "&
"PACKED BOOLEAN ARRAY WITH INTEGER'LAST "&
"+ 3 COMPONENTS");
WHEN CONSTRAINT_ERROR =>
COMMENT ("CONSTRAINT_ERROR RAISED WHEN DECLARING "&
"ONE PACKED BOOLEAN ARRAY WITH "&
"INTEGER'LAST + 3 COMPONENTS");
WHEN OTHERS =>
FAILED ("SOME EXCEPTION RAISED - 3");
END DCL_ARR;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
COMMENT ("CONSTRAINT_ERROR RAISED WHEN DECLARING AN " &
"ARRAY SUBTYPE WITH INTEGER'LAST + 3 " &
"COMPONENTS");
WHEN STORAGE_ERROR =>
FAILED ("STORAGE_ERROR RAISED FOR TYPE DECLARATION");
WHEN OTHERS =>
FAILED( "OTHER EXCEPTION RAISED - 4");
END CONSTR_ERR;
RESULT ;
END C52104Y;
|
with Dispatch;
with System.Multiprocessors.Dispatching_Domains;
use System.Multiprocessors.Dispatching_Domains;
procedure Main is
begin
Set_CPU(1);
for i in 1 .. 100 loop
delay 1.0;
end loop;
end Main;
|
-- C41205A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT CONSTRAINT_ERROR IS RAISED IF THE NAME PART OF A
-- SLICE DENOTES AN ACCESS OBJECT WHOSE VALUE IS NULL, AND
-- ALSO IF THE NAME IS A FUNCTION CALL DELIVERING NULL.
-- WKB 8/6/81
-- SPS 10/26/82
-- EDS 07/14/98 AVOID OPTIMIZATION
WITH REPORT;
USE REPORT;
PROCEDURE C41205A IS
BEGIN
TEST ("C41205A", "CONSTRAINT_ERROR WHEN THE NAME PART OF A " &
"SLICE DENOTES A NULL ACCESS OBJECT OR A " &
"FUNCTION CALL DELIVERING NULL");
DECLARE
TYPE T IS ARRAY (INTEGER RANGE <> ) OF INTEGER;
SUBTYPE T1 IS T (1..5);
TYPE A1 IS ACCESS T1;
B : A1 := NEW T1' (1,2,3,4,5);
I : T (2..3);
BEGIN
IF EQUAL (3,3) THEN
B := NULL;
END IF;
I := B(2..3);
FAILED ("CONSTRAINT_ERROR NOT RAISED - 1 " & INTEGER'IMAGE(I(2)));
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL;
WHEN OTHERS => FAILED ("WRONG EXCEPTION - 1");
END;
DECLARE
TYPE T IS ARRAY (INTEGER RANGE <> ) OF INTEGER;
SUBTYPE T2 IS T (1..5);
TYPE A2 IS ACCESS T2;
I : T (2..5);
FUNCTION F RETURN A2 IS
BEGIN
IF EQUAL (3,3) THEN
RETURN NULL;
END IF;
RETURN NEW T2' (1,2,3,4,5);
END F;
BEGIN
I := F(2..5);
FAILED ("CONSTRAINT_ERROR NOT RAISED - 2 " & INTEGER'IMAGE(I(2)));
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL;
WHEN OTHERS => FAILED ("WRONG EXCEPTION - 2");
END;
RESULT;
END C41205A;
|
-- Auteur: MOUDDENE Hamza.
-- Gérer un stock de matériel informatique.
package Stocks_Materiel is
CAPACITE : constant Integer := 10; -- nombre maximum de matériels dans un stock
type T_Nature is (UNITE_CENTRALE, DISQUE, ECRAN, CLAVIER, IMPRIMANTE);
type T_Materiel is array(1..CAPACITE) of Integer;
type T_Stock is limited private;
-- Créer un stock vide.
--
-- paramètres
-- Stock : le stock à créer
--
-- Assure
-- Nb_Materiels (Stock) = 0
--
procedure Creer (Stock : out T_Stock) with
Post => Nb_Materiels (Stock) = 0;
-- Obtenir le nombre de matériels dans le stock Stock
--
-- Paramètres
-- Stock : le stock dont ont veut obtenir la taille
--
-- Nécessite
-- Vrai
--
-- Assure
-- Résultat >= 0 Et Résultat <= CAPACITE
--
function Nb_Materiels (Stock: in T_Stock) return Integer with
Post => Nb_Materiels'Result >= 0 and Nb_Materiels'Result <= CAPACITE;
-- Enregistrer un nouveau métériel dans le stock. Il est en
-- fonctionnement. Le stock ne doit pas être plein.
--
-- Paramètres
-- Stock : le stock à compléter
-- Numero_Serie : le numéro de série du nouveau matériel
-- Nature : la nature du nouveau matériel
-- Annee_Achat : l'année d'achat du nouveau matériel
--
-- Nécessite
-- Nb_Materiels (Stock) < CAPACITE
--
-- Assure
-- Nouveau matériel ajouté
-- Nb_Materiels (Stock) = Nb_Materiels (Stock)'Avant + 1
procedure Enregistrer (
Stock : in out T_Stock;
Numero_Serie : in Integer;
Nature : in T_Nature;
Annee_Achat : in Integer
) with
Pre => Nb_Materiels (Stock) < CAPACITE,
Post => Nb_Materiels (Stock) = Nb_Materiels (Stock)'Old + 1;
limited private
type T_Stock is record
Materiel : T_Materiel;
N_Item : Integer;
-- Invariant
-- Stock
-- 0 <= N_item <= CAPACITY
end record;
end Stocks_Materiel;
|
with SPARKNaCl.Core;
with SPARKNaCl.Stream;
package SPARKNaCl.Cryptobox
with Pure,
SPARK_Mode => On
is
--------------------------------------------------------
-- Public Key Authenticated Encryption - "Crypto Box" --
--------------------------------------------------------
-- Limited, so no assignment or comparison, and always
-- pass-by-reference.
type Secret_Key is limited private;
type Public_Key is limited private;
Plaintext_Zero_Bytes : constant := 32;
Ciphertext_Zero_Bytes : constant := 16;
-- Key generation
procedure Keypair (Raw_SK : in Bytes_32;
PK : out Public_Key;
SK : out Secret_Key)
with Global => null;
function Construct (K : in Bytes_32) return Secret_Key
with Global => null;
function Construct (K : in Bytes_32) return Public_Key
with Global => null;
function Serialize (K : in Secret_Key) return Bytes_32
with Global => null;
function Serialize (K : in Public_Key) return Bytes_32
with Global => null;
-- Sanitization
procedure Sanitize (K : out Secret_Key)
with Global => null;
procedure Sanitize (K : out Public_Key)
with Global => null;
-- Precomputation
procedure BeforeNM (K : out Core.Salsa20_Key;
PK : in Public_Key;
SK : in Secret_Key)
with Global => null;
-- Postcomputation for Create
procedure AfterNM (C : out Byte_Seq;
Status : out Boolean;
M : in Byte_Seq;
N : in Stream.HSalsa20_Nonce;
K : in Core.Salsa20_Key)
with Global => null,
Pre => (M'First = 0 and
C'First = 0 and
C'Last = M'Last and
M'Length >= 32) and then
Equal (M (0 .. 31), Zero_Bytes_32),
Post => Equal (C (0 .. 15), Zero_Bytes_16);
-- Postcomputation for Open
procedure Open_AfterNM
(M : out Byte_Seq; -- Output plaintext
Status : out Boolean;
C : in Byte_Seq; -- Input ciphertext
N : in Stream.HSalsa20_Nonce;
K : in Core.Salsa20_Key)
with Global => null,
Pre => (M'First = 0 and
C'First = 0 and
M'Last = C'Last and
C'Length >= 32) and then
Equal (C (0 .. 15), Zero_Bytes_16),
Post => Equal (M (0 .. 31), Zero_Bytes_32);
-- Top-level all-in-one Create operation
procedure Create (C : out Byte_Seq;
Status : out Boolean;
M : in Byte_Seq;
N : in Stream.HSalsa20_Nonce;
Recipient_PK : in Public_Key;
Sender_SK : in Secret_Key)
with Global => null,
Pre => (M'First = 0 and
C'First = 0 and
C'Last = M'Last and
M'Length >= 32) and then
Equal (M (0 .. 31), Zero_Bytes_32),
Post => Equal (C (0 .. 15), Zero_Bytes_16);
-- Top-level all-in-one Open operation
procedure Open (M : out Byte_Seq;
Status : out Boolean;
C : in Byte_Seq;
N : in Stream.HSalsa20_Nonce;
Sender_PK : in Public_Key;
Recipient_SK : in Secret_Key)
with Global => null,
Pre => (M'First = 0 and
C'First = 0 and
M'Last = C'Last and
C'Length >= 32) and then
Equal (C (0 .. 15), Zero_Bytes_16),
Post => Equal (M (0 .. 31), Zero_Bytes_32);
private
-- Note - also limited types here in the full view to ensure
-- no assignment and pass-by-reference in the body.
type Secret_Key is limited record
F : Bytes_32;
end record;
type Public_Key is limited record
F : Bytes_32;
end record;
end SPARKNaCl.Cryptobox;
|
-- AOC, Day 3
with Ada.Text_IO; use Ada.Text_IO;
with FMS;
procedure main is
begin
FMS.load_file("day3_input.txt");
put_line("Part 1: " & Positive'Image(FMS.closest_intersection));
put_line("Part 2: " & Positive'Image(FMS.shortest_intersection));
end main;
|
with Extraction.Node_Edge_Types;
package body Extraction.Source_Files_From_Projects is
use type VFS.File_Array_Access;
use type VFS.Filesystem_String;
procedure Extract_Nodes
(Project : GPR.Project_Type;
Graph : Graph_Operations.Graph_Context)
is
Source_Files : VFS.File_Array_Access := Project.Extended_Projects_Source_Files;
begin
for Source_File of Source_Files.all loop
Graph.Write_Node(Source_File);
end loop;
VFS.Unchecked_Free(Source_Files);
end Extract_Nodes;
procedure Extract_Edges
(Project : GPR.Project_Type;
Context : Utilities.Project_Context;
Recurse_Projects : Boolean;
Graph : Graph_Operations.Graph_Context)
is
Source_Files : VFS.File_Array_Access := Project.Extended_Projects_Source_Files;
Main_Files : VFS.File_Array_Access := null;
Has_Non_Ada_Main : Boolean := False;
begin
for Source_File of Source_Files.all loop
Graph.Write_Edge(Project, Source_File, Node_Edge_Types.Edge_Type_Contains);
-- GPRBuild compiles all sources in languages other than Ada.
if not Utilities.Is_Ada_File_In_Project_Context(+Source_File.Full_Name, Context, Recurse_Projects)
and then Utilities.Is_Buildable_File_In_Project_Context(+Source_File.Full_Name, Context)
then
Graph.Write_Edge(Project, Source_File, Node_Edge_Types.Edge_Type_Compiles);
end if;
if Project.Is_Main_File(Source_File.Full_Name) then
VFS.Append(Main_Files, Source_File);
Has_Non_Ada_Main := Has_Non_Ada_Main or not Utilities.Is_Ada_File_In_Project_Context(+Source_File.Full_Name, Context, Recurse_Projects);
end if;
end loop;
VFS.Unchecked_Free(Source_Files);
-- This is an over-approximation, as we do not handle the "Roots" attibute;
-- see the description of compilation phase in the GPRBuild documentation.
declare
Built_Files : VFS.File_Array_Access;
begin
if Has_Non_Ada_Main -- GPRBuild compiles all Ada soruces if there is non-Ada main.
or else Main_Files = null -- GPRBuild compiles all Ada sources if no main is specified.
then
Built_Files := Project.Extended_Projects_Source_Files;
else
declare
Status : GPR.Status_Type;
begin
-- GPRBuild compiles all Ada files in the closure of an Ada main.
Project.Get_Closures(Main_Files, False, False, Status, Built_Files);
end;
end if;
for Built_File of Built_Files.all loop
if Utilities.Is_Buildable_File_In_Project_Context(+Built_File.Full_Name, Context) then
Graph.Write_Edge(Project, Built_File, Node_Edge_Types.Edge_Type_Compiles);
end if;
end loop;
VFS.Unchecked_Free(Built_Files);
end;
VFS.Unchecked_Free(Main_Files);
end Extract_Edges;
end Extraction.Source_Files_From_Projects;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.STRINGS.UNBOUNDED.LESS_CASE_INSENSITIVE --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2019, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- 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. --
------------------------------------------------------------------------------
function Ada.Strings.Unbounded.Less_Case_Insensitive
(Left, Right : Unbounded.Unbounded_String)
return Boolean;
pragma Preelaborate (Ada.Strings.Unbounded.Less_Case_Insensitive);
|
-- 程序名稱必須跟檔案名稱相同
procedure Basic is -- 這個區塊是一個叫做 basic 的程序
begin -- 由此開始
null;
end Basic; -- 由此結束
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, 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 STMicroelectronics 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. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_rng.c --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief RNG HAL module driver. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
with STM32_SVD.RCC; use STM32_SVD.RCC;
with STM32_SVD.RNG; use STM32_SVD.RNG;
package body STM32.RNG is
----------------------
-- Enable_RNG_Clock --
----------------------
procedure Enable_RNG_Clock is
begin
RCC_Periph.AHB2ENR.RNGEN := True;
end Enable_RNG_Clock;
----------------
-- Enable_RNG --
----------------
procedure Enable_RNG is
begin
RNG_Periph.CR.RNGEN := True;
end Enable_RNG;
-----------------
-- Disable_RNG --
-----------------
procedure Disable_RNG is
begin
RNG_Periph.CR.RNGEN := False;
end Disable_RNG;
---------------
-- Reset_RNG --
---------------
procedure Reset_RNG
is
begin
RCC_Periph.AHB2RSTR.RNGRST := True;
RCC_Periph.AHB2RSTR.RNGRST := False;
end Reset_RNG;
-----------------
-- RNG_Enabled --
-----------------
function RNG_Enabled return Boolean is
(RNG_Periph.CR.RNGEN);
--------------------------
-- Enable_RNG_Interrupt --
--------------------------
procedure Enable_RNG_Interrupt is
begin
RNG_Periph.CR.IE := True;
end Enable_RNG_Interrupt;
---------------------------
-- Disable_RNG_Interrupt --
---------------------------
procedure Disable_RNG_Interrupt is
begin
RNG_Periph.CR.IE := False;
end Disable_RNG_Interrupt;
---------------------------
-- RNG_Interrupt_Enabled --
---------------------------
function RNG_Interrupt_Enabled return Boolean is
(RNG_Periph.CR.IE);
--------------
-- RNG_Data --
--------------
function RNG_Data return Word
is (RNG_Periph.DR);
--------------------
-- RNG_Data_Ready --
--------------------
function RNG_Data_Ready return Boolean
is (RNG_Periph.SR.DRDY);
---------------------------
-- RNG_Seed_Error_Status --
---------------------------
function RNG_Seed_Error_Status return Boolean is
(RNG_Periph.SR.SECS);
----------------------------
-- RNG_Clock_Error_Status --
----------------------------
function RNG_Clock_Error_Status return Boolean is
(RNG_Periph.SR.CECS);
---------------------------------
-- Clear_RNG_Seed_Error_Status --
---------------------------------
procedure Clear_RNG_Seed_Error_Status
is
begin
RNG_Periph.SR.SECS := False;
end Clear_RNG_Seed_Error_Status;
----------------------------------
-- Clear_RNG_Clock_Error_Status --
----------------------------------
procedure Clear_RNG_Clock_Error_Status
is
begin
RNG_Periph.SR.CECS := False;
end Clear_RNG_Clock_Error_Status;
end STM32.RNG;
|
-- Abstract :
--
-- Translate a wisitoken grammar file to a tree-sitter grammar file.
--
-- References:
--
-- [1] tree-sitter grammar: https://tree-sitter.github.io/tree-sitter/creating-parsers#the-grammar-dsl
--
-- Copyright (C) 2020 Stephen Leake All Rights Reserved.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, 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 MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
pragma License (GPL);
with Ada.Command_Line;
with Ada.Directories;
with Ada.Exceptions;
with Ada.Strings.Fixed;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Traceback.Symbolic;
with WisiToken.Syntax_Trees.LR_Utils;
with WisiToken.Parse.LR.Parser_No_Recover;
with WisiToken.Syntax_Trees;
with WisiToken.Text_IO_Trace;
with WisiToken_Grammar_Runtime;
with Wisitoken_Grammar_Actions; use Wisitoken_Grammar_Actions;
with Wisitoken_Grammar_Main;
procedure WisiToken.To_Tree_Sitter
is
procedure Put_Usage
is begin
Put_Line ("wisitoken-to_tree_sitter [--verbosity <level] <wisitoken grammar file> <language_name>");
end Put_Usage;
procedure Print_Tree_Sitter
(Data : in WisiToken_Grammar_Runtime.User_Data_Type;
Tree : in Syntax_Trees.Tree;
Output_File_Name : in String;
Language_Name : in String)
is
use WisiToken.Syntax_Trees;
File : File_Type;
-- Local specs
procedure Put_RHS_Item_List (Node : in Valid_Node_Index; First : in Boolean)
with Pre => Tree.ID (Node) = +rhs_item_list_ID;
-- Local bodies
function Get_Text (Tree_Index : in Valid_Node_Index) return String
is
function Strip_Delimiters (Tree_Index : in Valid_Node_Index) return String
is
Region : Buffer_Region renames Data.Terminals.all (Tree.Terminal (Tree_Index)).Byte_Region;
begin
if -Tree.ID (Tree_Index) in RAW_CODE_ID | REGEXP_ID | ACTION_ID then
-- Strip delimiters. We don't strip leading/trailing spaces to preserve indent.
return Data.Grammar_Lexer.Buffer_Text ((Region.First + 2, Region.Last - 2));
-- We don't strip string delimiters; tree-setter can use the same ones.
else
return Data.Grammar_Lexer.Buffer_Text (Region);
end if;
end Strip_Delimiters;
begin
case Tree.Label (Tree_Index) is
when Shared_Terminal =>
return Strip_Delimiters (Tree_Index);
when Virtual_Terminal =>
-- Terminal keyword inserted during tree edit. We could check for
-- Identifier, but that will be caught later.
return Image (Tree.ID (Tree_Index), Wisitoken_Grammar_Actions.Descriptor);
when Virtual_Identifier =>
raise SAL.Programmer_Error;
when Nonterm =>
declare
use all type Ada.Strings.Unbounded.Unbounded_String;
Result : Ada.Strings.Unbounded.Unbounded_String;
Tree_Indices : constant Valid_Node_Index_Array := Tree.Get_Terminals (Tree_Index);
Need_Space : Boolean := False;
begin
for Tree_Index of Tree_Indices loop
Result := Result & (if Need_Space then " " else "") &
Get_Text (Tree_Index);
Need_Space := True;
end loop;
return -Result;
end;
end case;
end Get_Text;
procedure Not_Translated (Label : in String; Node : in Valid_Node_Index)
is begin
New_Line (File);
Put (File, "// " & Label & ": not translated: " & Node_Index'Image (Node) & ":" &
Tree.Image (Node, Wisitoken_Grammar_Actions.Descriptor, Include_Children => True));
end Not_Translated;
procedure Put_RHS_Alternative_List (Node : in Valid_Node_Index; First : in Boolean)
with Pre => Tree.ID (Node) = +rhs_alternative_list_ID
is begin
case Tree.RHS_Index (Node) is
when 0 =>
-- If only alternative, don't need "choice()".
Put_RHS_Item_List (Tree.Child (Node, 1), First => True);
when 1 =>
if First then
Put (File, "choice(");
end if;
Put_RHS_Alternative_List (Tree.Child (Node, 1), First => False);
Put (File, ", ");
Put_RHS_Item_List (Tree.Child (Node, 3), First => True);
if First then
Put (File, ")");
end if;
when others =>
Not_Translated ("Put_RHS_Alternative_List", Node);
end case;
end Put_RHS_Alternative_List;
procedure Put_RHS_Optional_Item (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_optional_item_ID
is begin
Put (File, "optional(");
case Tree.RHS_Index (Node) is
when 0 | 1 =>
Put_RHS_Alternative_List (Tree.Child (Node, 2), First => True);
when 2 =>
Put (File, "$." & Get_Text (Tree.Child (Node, 1)));
when 3 =>
-- STRING_LITERAL_2
Put (File, Get_Text (Tree.Child (Node, 1)));
when others =>
Not_Translated ("Put_RHS_Optional_Item", Node);
end case;
Put (File, ")");
end Put_RHS_Optional_Item;
procedure Put_RHS_Multiple_Item (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_multiple_item_ID
is begin
case Tree.RHS_Index (Node) is
when 0 | 3 =>
Put (File, "repeat(");
Put_RHS_Alternative_List (Tree.Child (Node, 2), First => True);
Put (File, ")");
when 1 | 2 =>
Put (File, "repeat1(");
Put_RHS_Alternative_List (Tree.Child (Node, 2), First => True);
Put (File, ")");
when 4 =>
Put (File, "repeat1(");
Put (File, "$." & Get_Text (Tree.Child (Node, 1)));
Put (File, ")");
when 5 =>
Put (File, "repeat(");
Put (File, "$." & Get_Text (Tree.Child (Node, 1)));
Put (File, ")");
when others =>
Not_Translated ("Put_RHS_Multiple_Item", Node);
end case;
end Put_RHS_Multiple_Item;
procedure Put_RHS_Group_Item (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_group_item_ID
is begin
Not_Translated ("Put_RHS_Group_Item", Node); -- maybe just plain ()?
end Put_RHS_Group_Item;
procedure Put_RHS_Item (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_item_ID
is begin
case Tree.RHS_Index (Node) is
when 0 =>
declare
use WisiToken_Grammar_Runtime;
Ident : constant String := Get_Text (Node);
Decl : constant Node_Index := Find_Declaration (Data, Tree, Ident);
begin
if Decl = Invalid_Node_Index then
Raise_Programmer_Error ("decl for '" & Ident & "' not found", Data, Tree, Node);
elsif Tree.ID (Decl) = +nonterminal_ID then
Put (File, "$." & Get_Text (Tree.Child (Decl, 1)));
else
case Tree.RHS_Index (Decl) is
when 0 =>
case To_Token_Enum (Tree.ID (Tree.Child (Tree.Child (Decl, 2), 1))) is
when KEYWORD_ID =>
Put (File, Get_Text (Tree.Child (Decl, 4)));
when NON_GRAMMAR_ID =>
Not_Translated ("put_rhs_item", Node);
when Wisitoken_Grammar_Actions.TOKEN_ID =>
declare
use WisiToken.Syntax_Trees.LR_Utils;
Iter : constant Syntax_Trees.LR_Utils.Iterator :=
Iterate (Data, Tree, Tree.Child (Decl, 4), +declaration_item_ID);
Item : constant Valid_Node_Index :=
Tree.Child (Syntax_Trees.LR_Utils.Node (First (Iter)), 1);
begin
case To_Token_Enum (Tree.ID (Item)) is
when REGEXP_ID =>
Put (File, "$." & Ident);
when STRING_LITERAL_1_ID | STRING_LITERAL_2_ID =>
-- FIXME: case insensitive?
Put (File, Get_Text (Item));
when others =>
Not_Translated ("put_rhs_item ident token", Node);
end case;
end;
when others =>
Not_Translated ("put_rhs_item ident", Node);
end case;
when others =>
Not_Translated ("put_rhs_item 0", Node);
end case;
end if;
end;
when 1 =>
-- STRING_LITERAL_2
Put (File, Get_Text (Node));
when 2 =>
-- ignore attribute
null;
when 3 =>
Put_RHS_Optional_Item (Tree.Child (Node, 1));
when 4 =>
Put_RHS_Multiple_Item (Tree.Child (Node, 1));
when 5 =>
Put_RHS_Group_Item (Tree.Child (Node, 1));
when others =>
Not_Translated ("Put_RHS_Item", Node);
end case;
end Put_RHS_Item;
procedure Put_RHS_Element (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_element_ID
is begin
case Tree.RHS_Index (Node) is
when 0 =>
Put_RHS_Item (Tree.Child (Node, 1));
when 1 =>
-- Ignore the label
Put_RHS_Item (Tree.Child (Node, 3));
when others =>
Not_Translated ("Put_RHS_Element", Node);
end case;
end Put_RHS_Element;
procedure Put_RHS_Item_List (Node : in Valid_Node_Index; First : in Boolean)
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
if Children'Length = 1 then
Put_RHS_Element (Children (1));
else
if First then
Put (File, "seq(");
end if;
Put_RHS_Item_List (Children (1), First => False);
Put (File, ", ");
Put_RHS_Element (Children (2));
if First then
Put (File, ")");
end if;
end if;
end Put_RHS_Item_List;
procedure Put_RHS (Node : in Valid_Node_Index)
with Pre => Tree.ID (Node) = +rhs_ID
is begin
case Tree.RHS_Index (Node) is
when 0 =>
Put (File, "/* empty */,");
when 1 .. 3 =>
Put_RHS_Item_List (Tree.Child (Node, 1), First => True);
-- ignore actions
when others =>
Not_Translated ("put_rhs", Node);
end case;
end Put_RHS;
procedure Put_RHS_List (Node : in Valid_Node_Index; First : in Boolean)
with Pre => Tree.ID (Node) = +rhs_list_ID
is
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
case Tree.RHS_Index (Node) is
when 0 =>
Put_RHS (Children (1));
when 1 =>
if First then
Put (File, "choice(");
end if;
Put_RHS_List (Children (1), First => False);
Put (File, ",");
Put_RHS (Children (3));
if First then
Put (File, ")");
end if;
when others =>
Not_Translated ("Put_RHS_List", Node);
end case;
end Put_RHS_List;
procedure Process_Node (Node : in Valid_Node_Index)
is begin
case To_Token_Enum (Tree.ID (Node)) is
-- Enum_Token_ID alphabetical order
when compilation_unit_ID =>
Process_Node (Tree.Child (Node, 1));
when compilation_unit_list_ID =>
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
case To_Token_Enum (Tree.ID (Children (1))) is
when compilation_unit_list_ID =>
Process_Node (Children (1));
Process_Node (Children (2));
when compilation_unit_ID =>
Process_Node (Children (1));
when others =>
raise SAL.Programmer_Error;
end case;
end;
when declaration_ID =>
case Tree.RHS_Index (Node) is
when 0 =>
if Tree.ID (Tree.Child (Tree.Child (Node, 2), 1)) = +Wisitoken_Grammar_Actions.TOKEN_ID then
declare
use Ada.Strings;
use Ada.Strings.Fixed;
use WisiToken.Syntax_Trees.LR_Utils;
Name : constant String := Get_Text (Tree.Child (Node, 3));
Iter : constant Syntax_Trees.LR_Utils.Iterator :=
WisiToken_Grammar_Runtime.Iterate (Data, Tree, Tree.Child (Node, 4), +declaration_item_ID);
Item : constant Valid_Node_Index :=
Tree.Child (Syntax_Trees.LR_Utils.Node (First (Iter)), 1);
begin
case To_Token_Enum (Tree.ID (Item)) is
when REGEXP_ID =>
Put_Line (File, Name & ": $ => /" & Trim (Get_Text (Item), Both) & "/,");
when others =>
null;
end case;
end;
end if;
when others =>
null;
end case;
when nonterminal_ID =>
declare
Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
Put (File, Get_Text (Children (1)) & ": $ => ");
Put_RHS_List (Children (3), First => True);
Put_Line (File, ",");
end;
when wisitoken_accept_ID =>
Process_Node (Tree.Child (Node, 1));
when others =>
raise SAL.Not_Implemented with Image (Tree.ID (Node), Wisitoken_Grammar_Actions.Descriptor);
end case;
end Process_Node;
begin
Create (File, Out_File, Output_File_Name);
Put_Line (File, "// generated from " & Data.Grammar_Lexer.File_Name & " -*- buffer-read-only:t -*-");
-- FIXME: copy copyright, license?
Put_Line (File, "module.exports = grammar({");
Put_Line (File, " name: '" & Language_Name & "',");
Put_Line (File, " rules: {");
Process_Node (Tree.Root);
Put_Line (File, " }");
Put_Line (File, "});");
Close (File);
end Print_Tree_Sitter;
Trace : aliased WisiToken.Text_IO_Trace.Trace (Wisitoken_Grammar_Actions.Descriptor'Access);
Input_Data : aliased WisiToken_Grammar_Runtime.User_Data_Type;
Grammar_Parser : WisiToken.Parse.LR.Parser_No_Recover.Parser;
Input_File_Name : Ada.Strings.Unbounded.Unbounded_String;
Language_Name : Ada.Strings.Unbounded.Unbounded_String;
begin
Wisitoken_Grammar_Main.Create_Parser
(Parser => Grammar_Parser,
Trace => Trace'Unchecked_Access,
User_Data => Input_Data'Unchecked_Access);
declare
use Ada.Command_Line;
Arg : Integer := 1;
begin
if not (Argument_Count in 1 .. 4) then
Put_Usage;
Set_Exit_Status (Failure);
return;
end if;
loop
exit when Arg > Argument_Count;
if Argument (Arg) = "--verbosity" then
Arg := Arg + 1;
Trace_Generate_EBNF := Integer'Value (Argument (Arg));
Arg := Arg + 1;
else
exit;
end if;
end loop;
-- no more options
Input_File_Name := +Argument (Arg);
Arg := Arg + 1;
Language_Name := +Argument (Arg);
end;
begin
Grammar_Parser.Lexer.Reset_With_File (-Input_File_Name);
exception
when Ada.Text_IO.Name_Error | Ada.Text_IO.Use_Error =>
raise Ada.Text_IO.Name_Error with "input file '" & (-Input_File_Name) & "' could not be opened.";
end;
begin
Grammar_Parser.Parse;
exception
when WisiToken.Syntax_Error =>
Grammar_Parser.Put_Errors;
raise;
end;
Grammar_Parser.Execute_Actions;
declare
use Ada.Directories;
Output_File_Name : constant String := Base_Name (-Input_File_Name) & ".js";
Tree : WisiToken.Syntax_Trees.Tree renames Grammar_Parser.Parsers.First_State_Ref.Tree;
begin
if Trace_Generate_EBNF > Outline then
Put_Line ("'" & (-Input_File_Name) & "' => '" & Output_File_Name & "'");
end if;
if Trace_Generate_EBNF > Detail then
Put_Line ("wisitoken tree:");
Tree.Print_Tree (Wisitoken_Grammar_Actions.Descriptor);
Ada.Text_IO.New_Line;
end if;
Print_Tree_Sitter (Input_Data, Tree, Output_File_Name, -Language_Name);
end;
exception
when WisiToken.Syntax_Error | WisiToken.Parse_Error =>
-- error message already output
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
when E : others =>
declare
use Ada.Exceptions;
use Ada.Command_Line;
begin
Put_Line (Standard_Error, Exception_Name (E) & ": " & Exception_Message (E));
Put_Line (Standard_Error, GNAT.Traceback.Symbolic.Symbolic_Traceback (E));
Set_Exit_Status (Failure);
end;
end WisiToken.To_Tree_Sitter;
|
-- FastAPI
-- No description provided (generated by Openapi Generator https://github.com/openapitools/openapi-generator)
--
-- The version of the OpenAPI document: 0.1.0
--
--
-- NOTE: This package is auto generated by OpenAPI-Generator 4.0.0.
-- https://openapi-generator.tech
-- Do not edit the class manually.
with Swagger.Streams;
with Ada.Containers.Vectors;
package .Models is
-- ------------------------------
-- ValidationError
-- ------------------------------
type ValidationErrorType is
record
Loc : Swagger.UString_Vectors.Vector;
Msg : Swagger.UString;
P_Type : Swagger.UString;
end record;
package ValidationErrorType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => ValidationErrorType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in ValidationErrorType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in ValidationErrorType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out ValidationErrorType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out ValidationErrorType_Vectors.Vector);
-- ------------------------------
-- HTTPValidationError
-- ------------------------------
type HTTPValidationErrorType is
record
Detail : .Models.ValidationErrorType_Vectors.Vector;
end record;
package HTTPValidationErrorType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => HTTPValidationErrorType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in HTTPValidationErrorType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in HTTPValidationErrorType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out HTTPValidationErrorType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out HTTPValidationErrorType_Vectors.Vector);
-- ------------------------------
-- Body_apply_image_image_background_removal__post
-- ------------------------------
type BodyApplyImageImageBackgroundRemovalPostType is
record
Image : Swagger.Http_Content_Type;
end record;
package BodyApplyImageImageBackgroundRemovalPostType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BodyApplyImageImageBackgroundRemovalPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageBackgroundRemovalPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageBackgroundRemovalPostType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageBackgroundRemovalPostType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageBackgroundRemovalPostType_Vectors.Vector);
-- ------------------------------
-- Body_apply_image_image_colorization__post
-- ------------------------------
type BodyApplyImageImageColorizationPostType is
record
Image : Swagger.Http_Content_Type;
end record;
package BodyApplyImageImageColorizationPostType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BodyApplyImageImageColorizationPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageColorizationPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageColorizationPostType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageColorizationPostType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageColorizationPostType_Vectors.Vector);
-- ------------------------------
-- Body_apply_image_image_face_bluring__post
-- ------------------------------
type BodyApplyImageImageFaceBluringPostType is
record
Image : Swagger.Http_Content_Type;
end record;
package BodyApplyImageImageFaceBluringPostType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BodyApplyImageImageFaceBluringPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageFaceBluringPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageFaceBluringPostType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageFaceBluringPostType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageFaceBluringPostType_Vectors.Vector);
-- ------------------------------
-- Body_apply_image_image_super_resolution__post
-- ------------------------------
type BodyApplyImageImageSuperResolutionPostType is
record
Image : Swagger.Http_Content_Type;
end record;
package BodyApplyImageImageSuperResolutionPostType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BodyApplyImageImageSuperResolutionPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageSuperResolutionPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageSuperResolutionPostType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageSuperResolutionPostType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageSuperResolutionPostType_Vectors.Vector);
-- ------------------------------
-- Body_apply_image_image_uncolorization__post
-- ------------------------------
type BodyApplyImageImageUncolorizationPostType is
record
Image : Swagger.Http_Content_Type;
end record;
package BodyApplyImageImageUncolorizationPostType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BodyApplyImageImageUncolorizationPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageUncolorizationPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageUncolorizationPostType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageUncolorizationPostType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageUncolorizationPostType_Vectors.Vector);
-- ------------------------------
-- Body_apply_image_text_asciify__post
-- ------------------------------
type BodyApplyImageTextAsciifyPostType is
record
Image : Swagger.Http_Content_Type;
end record;
package BodyApplyImageTextAsciifyPostType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BodyApplyImageTextAsciifyPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextAsciifyPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextAsciifyPostType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextAsciifyPostType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextAsciifyPostType_Vectors.Vector);
-- ------------------------------
-- Body_apply_image_text_ocr__post
-- ------------------------------
type BodyApplyImageTextOcrPostType is
record
Image : Swagger.Http_Content_Type;
end record;
package BodyApplyImageTextOcrPostType_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BodyApplyImageTextOcrPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextOcrPostType);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextOcrPostType_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextOcrPostType);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextOcrPostType_Vectors.Vector);
end .Models;
|
with Ada.Directories;
with Ada.Environment_Variables;
package body SP.Platform is
function Home_Dir return String is
package Env renames Ada.Environment_Variables;
User_Profile : constant String := "HOME";
begin
if Env.Exists (User_Profile) then
return Ada.Directories.Full_Name (Env.Value (User_Profile));
else
-- TODO: Add a better fallback case here.
return "";
end if;
end Home_Dir;
function Path_Separator return Character is ('\');
function Path_Opposite_Separator return Character is ('/');
end SP.Platform;
|
-----------------------------------------------------------------------
-- atlas-microblog-modules -- Module microblog
-- 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 ASF.Applications;
with AWA.Modules;
with Atlas.Microblog.Models;
package Atlas.Microblog.Modules is
-- The name under which the module is registered.
NAME : constant String := "microblog";
-- ------------------------------
-- Module microblog
-- ------------------------------
type Microblog_Module is new AWA.Modules.Module with private;
type Microblog_Module_Access is access all Microblog_Module'Class;
-- Initialize the microblog module.
overriding
procedure Initialize (Plugin : in out Microblog_Module;
App : in AWA.Modules.Application_Access;
Props : in ASF.Applications.Config);
-- Get the microblog module.
function Get_Microblog_Module return Microblog_Module_Access;
-- Create a post for the microblog.
procedure Create (Plugin : in Microblog_Module;
Post : in out Atlas.Microblog.Models.Mblog_Ref);
private
type Microblog_Module is new AWA.Modules.Module with null record;
end Atlas.Microblog.Modules;
|
with ACO.Messages;
with ACO.OD_Types;
with ACO.Utils.Byte_Order;
with Interfaces;
with System;
package ACO.SDO_Commands is
use Interfaces;
use ACO.Messages;
use ACO.OD_Types;
use ACO.Utils.Byte_Order;
type Unsigned_3 is mod 2 ** 3 with Size => 3;
type Unsigned_2 is mod 2 ** 2 with Size => 2;
subtype Abort_Code_Type is Interfaces.Unsigned_32;
Download_Initiate_Req : constant := 1;
Download_Initiate_Conf : constant := 3;
Download_Segment_Req : constant := 0;
Download_Segment_Conf : constant := 1;
Upload_Initiate_Req : constant := 2;
Upload_Initiate_Conf : constant := 2;
Upload_Segment_Req : constant := 3;
Upload_Segment_Conf : constant := 0;
Abort_Req : constant := 4;
function Get_CS (Msg : Message) return Unsigned_3 is
(Unsigned_3 (Shift_Right (Msg.Data (0), 5) and 2#111#));
function Get_Index (Msg : Message) return Entry_Index is
((Object => Swap_Bus (Octets_2 (Msg.Data (1 .. 2))),
Sub => Msg.Data (3)));
-- function Index_To_Bus (Index : Object_Index) return Data_Array is
-- (Data_Array (Octets_2' (Swap_Bus (Unsigned_16 (Index)))));
type Download_Initiate_Cmd (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7);
when False =>
Command : Unsigned_3;
Nof_No_Data : Unsigned_2;
Is_Expedited : Boolean;
Is_Size_Indicated : Boolean;
Index : Unsigned_16;
Subindex : Unsigned_8;
Data : Data_Array (0 .. 3);
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Download_Initiate_Cmd use record
Raw at 0 range 0 .. 63;
Data at 0 range 32 .. 63;
Subindex at 0 range 24 .. 31;
Index at 0 range 8 .. 23;
Command at 0 range 5 .. 7;
Nof_No_Data at 0 range 2 .. 3;
Is_Expedited at 0 range 1 .. 1;
Is_Size_Indicated at 0 range 0 .. 0;
end record;
function Get_Data_Size (Cmd : Download_Initiate_Cmd) return Natural is
(if Cmd.Is_Expedited then 4 - Natural (Cmd.Nof_No_Data) else
Natural (Swap_Bus (Octets_4 (Cmd.Data))));
function Convert
(Msg : Message) return Download_Initiate_Cmd
is
((As_Raw => True, Raw => Msg.Data));
subtype Expedited_Data is Data_Array (0 .. 3);
function Create
(Index : Entry_Index;
Data : Data_Array)
return Download_Initiate_Cmd
with Pre => Data'Length <= Expedited_Data'Length;
function Create
(Index : Entry_Index;
Size : Natural)
return Download_Initiate_Cmd;
subtype Segment_Data is Data_Array (0 .. 6);
type Download_Segment_Cmd (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7);
when False =>
Command : Unsigned_3;
Toggle : Boolean;
Nof_No_Data : Unsigned_3;
Is_Complete : Boolean;
Data : Segment_Data;
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Download_Segment_Cmd use record
Raw at 0 range 0 .. 63;
Data at 0 range 8 .. 63;
Command at 0 range 5 .. 7;
Toggle at 0 range 4 .. 4;
Nof_No_Data at 0 range 1 .. 3;
Is_Complete at 0 range 0 .. 0;
end record;
function Convert
(Msg : Message) return Download_Segment_Cmd
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Toggle : Boolean;
Is_Complete : Boolean;
Data : Data_Array)
return Download_Segment_Cmd
with Pre => Data'Length <= Segment_Data'Length;
type Download_Initiate_Resp (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7) := (others => 0);
when False =>
Command : Unsigned_3;
Index : Unsigned_16;
Subindex : Unsigned_8;
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Download_Initiate_Resp use record
Raw at 0 range 0 .. 63;
Subindex at 0 range 24 .. 31;
Index at 0 range 8 .. 23;
Command at 0 range 5 .. 7;
end record;
function Convert
(Msg : Message) return Download_Initiate_Resp
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Index : Entry_Index)
return Download_Initiate_Resp;
type Download_Segment_Resp (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7) := (others => 0);
when False =>
Command : Unsigned_3;
Toggle : Boolean;
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Download_Segment_Resp use record
Raw at 0 range 0 .. 63;
Command at 0 range 5 .. 7;
Toggle at 0 range 4 .. 4;
end record;
function Convert
(Msg : Message) return Download_Segment_Resp
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Toggle : Boolean)
return Download_Segment_Resp;
type Abort_Cmd (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7) := (others => 0);
when False =>
Command : Unsigned_3;
Index : Unsigned_16;
Subindex : Unsigned_8;
Code : Unsigned_32;
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Abort_Cmd use record
Raw at 0 range 0 .. 63;
Code at 0 range 32 .. 63;
Subindex at 0 range 24 .. 31;
Index at 0 range 8 .. 23;
Command at 0 range 5 .. 7;
end record;
function Convert
(Msg : Message) return Abort_Cmd
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Index : Entry_Index;
Code : Abort_Code_Type)
return Abort_Cmd;
function Code (Cmd : Abort_Cmd) return Abort_Code_Type
is
(Abort_Code_Type (Unsigned_32' (Swap_Bus (Cmd.Code))));
type Upload_Initiate_Cmd (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7) := (others => 0);
when False =>
Command : Unsigned_3;
Index : Unsigned_16;
Subindex : Unsigned_8;
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Upload_Initiate_Cmd use record
Raw at 0 range 0 .. 63;
Subindex at 0 range 24 .. 31;
Index at 0 range 8 .. 23;
Command at 0 range 5 .. 7;
end record;
function Convert
(Msg : Message) return Upload_Initiate_Cmd
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Index : Entry_Index)
return Upload_Initiate_Cmd;
type Upload_Initiate_Resp (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7);
when False =>
Command : Unsigned_3;
Nof_No_Data : Unsigned_2;
Is_Expedited : Boolean;
Is_Size_Indicated : Boolean;
Index : Unsigned_16;
Subindex : Unsigned_8;
Data : Data_Array (0 .. 3);
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Upload_Initiate_Resp use record
Raw at 0 range 0 .. 63;
Data at 0 range 32 .. 63;
Subindex at 0 range 24 .. 31;
Index at 0 range 8 .. 23;
Command at 0 range 5 .. 7;
Nof_No_Data at 0 range 2 .. 3;
Is_Expedited at 0 range 1 .. 1;
Is_Size_Indicated at 0 range 0 .. 0;
end record;
function Get_Data_Size (Cmd : Upload_Initiate_Resp) return Natural is
(if Cmd.Is_Expedited then 4 - Natural (Cmd.Nof_No_Data) else
Natural (Swap_Bus (Octets_4 (Cmd.Data))));
function Convert
(Msg : Message) return Upload_Initiate_Resp
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Index : Entry_Index;
Data : Data_Array)
return Upload_Initiate_Resp
with Pre => Data'Length <= Expedited_Data'Length;
function Create
(Index : Entry_Index;
Size : Natural)
return Upload_Initiate_Resp;
type Upload_Segment_Cmd (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7) := (others => 0);
when False =>
Command : Unsigned_3;
Toggle : Boolean;
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Upload_Segment_Cmd use record
Raw at 0 range 0 .. 63;
Command at 0 range 5 .. 7;
Toggle at 0 range 4 .. 4;
end record;
function Convert
(Msg : Message) return Upload_Segment_Cmd
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Toggle : Boolean)
return Upload_Segment_Cmd;
type Upload_Segment_Resp (As_Raw : Boolean := False) is record
case As_Raw is
when True =>
Raw : Data_Array (0 .. 7);
when False =>
Command : Unsigned_3;
Toggle : Boolean;
Nof_No_Data : Unsigned_3;
Is_Complete : Boolean;
Data : Segment_Data;
end case;
end record
with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First;
for Upload_Segment_Resp use record
Raw at 0 range 0 .. 63;
Data at 0 range 8 .. 63;
Command at 0 range 5 .. 7;
Toggle at 0 range 4 .. 4;
Nof_No_Data at 0 range 1 .. 3;
Is_Complete at 0 range 0 .. 0;
end record;
function Convert
(Msg : Message) return Upload_Segment_Resp
is
((As_Raw => True, Raw => Msg.Data));
function Create
(Toggle : Boolean;
Is_Complete : Boolean;
Data : Data_Array)
return Upload_Segment_Resp
with Pre => Data'Length <= Segment_Data'Length;
end ACO.SDO_Commands;
|
separate(Basic_Declaration)
procedure Subprogram_Body_Stub_Name is
begin
null;
end Subprogram_Body_Stub_Name;
|
------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (gh+flacada@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);
with Ada.Streams.Stream_IO;
with Flac.Debug;
with Flac.Frames;
with Flac.Headers.Meta_Data;
with Flac.Headers.Stream_Info;
with Flac.Types;
with SPARK_Stream_IO;
package body Flac.Reader with
SPARK_Mode => On
is
---------------------------------------------------------------------------
-- Local helper subroutines.
---------------------------------------------------------------------------
---------------------------------------------------------------------------
-- Validate_Header
--
-- Tries reading the first block of data from the file stream and checks
-- if a valid flac file signature could be found.
---------------------------------------------------------------------------
procedure Validate_Header (Flac_File : in out File_Handle)
with
Pre => (Is_Open (Handle => Flac_File) and then
Flac_File.Error = No_Error),
Post => (case Flac_File.Error.Main is
when None => Is_Open (Handle => Flac_File),
when others => not Is_Open (Handle => Flac_File)),
Depends => (Flac_File => Flac_File);
---------------------------------------------------------------------------
-- Read_Metadata_Block
---------------------------------------------------------------------------
procedure Read_Metadata_Block (Flac_File : in out File_Handle;
Meta_Data : out Headers.Meta_Data.T)
with
Relaxed_Initialization => Meta_Data,
Pre => (Is_Open (Handle => Flac_File) and then
Flac_File.Error = No_Error),
Post => (case Flac_File.Error.Main is
when None =>
Is_Open (Handle => Flac_File) and then
Meta_Data'Initialized,
when others =>
not Is_Open (Handle => Flac_File)),
Depends => (Flac_File => Flac_File,
Meta_Data => Flac_File);
---------------------------------------------------------------------------
-- Read_Stream_Info
--
-- Reads basic stream info from current position.
-- Requires to have read a meta data block with Info = Stream_Info before.
---------------------------------------------------------------------------
procedure Read_Stream_Info (Flac_File : in out File_Handle;
Meta_Data : out Headers.Meta_Data.T)
with
Relaxed_Initialization => Meta_Data,
Pre => (Is_Open (Handle => Flac_File) and then
Flac_File.Error = No_Error),
Post => (case Flac_File.Error.Main is
when None =>
Is_Open (Handle => Flac_File) and then
Meta_Data'Initialized,
when others =>
not Is_Open (Handle => Flac_File)),
Depends => (Flac_File => Flac_File,
Meta_Data => Flac_File);
---------------------------------------------------------------------------
-- Read_Metadata_Block
---------------------------------------------------------------------------
procedure Read_Metadata_Block (Flac_File : in out File_Handle;
Meta_Data : out Headers.Meta_Data.T)
is
Error : Boolean;
begin
Headers.Meta_Data.Read (File => Flac_File.File,
Item => Meta_Data,
Error => Error);
if Error then
Close (Flac_File => Flac_File);
Flac_File.Error := Error_Type'(Main => Not_A_Flac_File,
Sub => Corrupt_Meta_Data);
return;
end if;
end Read_Metadata_Block;
---------------------------------------------------------------------------
-- Read_Stream_Info
---------------------------------------------------------------------------
procedure Read_Stream_Info (Flac_File : in out File_Handle;
Meta_Data : out Headers.Meta_Data.T)
is
Stream_Info : Headers.Stream_Info.T;
Error : Boolean;
use type Types.Block_Type;
use type Types.Length_24;
begin
Read_Metadata_Block (Flac_File => Flac_File,
Meta_Data => Meta_Data);
if Flac_File.Error.Main /= None then
return;
end if;
if
Meta_Data.Block_Type /= Types.Stream_Info or else
Meta_Data.Length /= Headers.Stream_Info.Stream_Info_Length
then
Close (Flac_File => Flac_File);
Flac_File.Error := Error_Type'(Main => Not_A_Flac_File,
Sub => Corrupt_Stream_Info);
return;
end if;
Headers.Stream_Info.Read (File => Flac_File.File,
Item => Stream_Info,
Error => Error);
if Error then
Close (Flac_File => Flac_File);
Flac_File.Error := Error_Type'(Main => Not_A_Flac_File,
Sub => Invalid_Stream_Info);
return;
end if;
Flac_File.Properties :=
Stream_Properties'(Num_Channels => Stream_Info.Num_Channels,
Bits_Per_Sample => Stream_Info.Bits_Per_Sample,
Sample_Rate => Stream_Info.Sample_Rate,
Num_Samples => Stream_Info.Total_Samples);
end Read_Stream_Info;
---------------------------------------------------------------------------
-- Validate_Header
---------------------------------------------------------------------------
procedure Validate_Header (Flac_File : in out File_Handle)
is
Header : Headers.Four_CC;
Error : Boolean;
use type Ada.Streams.Stream_Element_Array;
begin
SPARK_Stream_IO.Read (File => Flac_File.File,
Item => Header,
Error => Error);
-- Check header.
if Error or else Header /= Headers.Stream then
Close (Flac_File => Flac_File);
Flac_File.Error := Error_Type'(Main => Not_A_Flac_File,
Sub => Header_Not_Found);
end if;
end Validate_Header;
---------------------------------------------------------------------------
-- Close
---------------------------------------------------------------------------
procedure Close (Flac_File : in out File_Handle) is
begin
SPARK_Stream_IO.Close (Flac_File.File);
Flac_File.Open := False;
end Close;
---------------------------------------------------------------------------
-- Open
---------------------------------------------------------------------------
procedure Open (File : in String;
Flac_File : in out File_Handle)
is
Meta_Data : Headers.Meta_Data.T;
Error : Boolean;
begin
-- Try opening the actual file.
SPARK_Stream_IO.Open (File => Flac_File.File,
Name => File,
Error => Error);
if Error then
Flac_File.Error := Error_Type'(Main => Open_Error,
Sub => None);
return;
end if;
Flac_File.Open := True; -- For precondition of "Close" below.
Flac_File.Error := No_Error;
Validate_Header (Flac_File => Flac_File);
if Flac_File.Error /= No_Error then
return;
end if;
-- Header check went fine, now we should go for the first Stream_Info
-- meta data block. This is mandatory according to the spec.
Read_Stream_Info (Flac_File => Flac_File,
Meta_Data => Meta_Data);
if Flac_File.Error /= No_Error then
return;
end if;
-- There may be more meta data blocks. For now, we just skip them.
Skip_All_Meta_Data :
declare
use type Ada.Streams.Stream_IO.Count;
use type Types.Block_Type;
begin
while not Meta_Data.Last loop
pragma
Loop_Invariant
(Get_Error (Handle => Flac_File) = No_Error and then
Is_Open (Handle => Flac_File));
Read_Metadata_Block (Flac_File => Flac_File,
Meta_Data => Meta_Data);
if Flac_File.Error /= No_Error then
return;
end if;
if Meta_Data.Block_Type = Types.Invalid then
Close (Flac_File => Flac_File);
Flac_File.Error := Error_Type'(Main => Not_A_Flac_File,
Sub => Invalid_Meta_Data);
return;
end if;
SPARK_Stream_IO.Skip
(File => Flac_File.File,
Num_Elements => Ada.Streams.Stream_IO.Count (Meta_Data.Length),
Error => Error);
if Error then
Close (Flac_File => Flac_File);
Flac_File.Error := Error_Type'(Main => Not_A_Flac_File,
Sub => Corrupt_Meta_Data);
return;
end if;
end loop;
end Skip_All_Meta_Data;
-- Now the file should be positioned at the first frame.
declare
Frame : Frames.T;
begin
Frames.Read (File => Flac_File.File,
Sample_Rate => Sample_Rate (Handle => Flac_File),
Sample_Size => Bits_Per_Sample (Handle => Flac_File),
Item => Frame,
Error => Error);
if Error then
Flac.Debug.Print_Frame_Info (Frame => Frame);
else
Flac.Debug.Print_Frame_Info (Frame => Frame);
end if;
end;
end Open;
end Flac.Reader;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-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.Generic_Collections;
package AMF.UML.Behavioral_Features.Collections is
pragma Preelaborate;
package UML_Behavioral_Feature_Collections is
new AMF.Generic_Collections
(UML_Behavioral_Feature,
UML_Behavioral_Feature_Access);
type Set_Of_UML_Behavioral_Feature is
new UML_Behavioral_Feature_Collections.Set with null record;
Empty_Set_Of_UML_Behavioral_Feature : constant Set_Of_UML_Behavioral_Feature;
type Ordered_Set_Of_UML_Behavioral_Feature is
new UML_Behavioral_Feature_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Behavioral_Feature : constant Ordered_Set_Of_UML_Behavioral_Feature;
type Bag_Of_UML_Behavioral_Feature is
new UML_Behavioral_Feature_Collections.Bag with null record;
Empty_Bag_Of_UML_Behavioral_Feature : constant Bag_Of_UML_Behavioral_Feature;
type Sequence_Of_UML_Behavioral_Feature is
new UML_Behavioral_Feature_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Behavioral_Feature : constant Sequence_Of_UML_Behavioral_Feature;
private
Empty_Set_Of_UML_Behavioral_Feature : constant Set_Of_UML_Behavioral_Feature
:= (UML_Behavioral_Feature_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Behavioral_Feature : constant Ordered_Set_Of_UML_Behavioral_Feature
:= (UML_Behavioral_Feature_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Behavioral_Feature : constant Bag_Of_UML_Behavioral_Feature
:= (UML_Behavioral_Feature_Collections.Bag with null record);
Empty_Sequence_Of_UML_Behavioral_Feature : constant Sequence_Of_UML_Behavioral_Feature
:= (UML_Behavioral_Feature_Collections.Sequence with null record);
end AMF.UML.Behavioral_Features.Collections;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . R E S T R I C T I O N S --
-- --
-- S p e c --
-- --
-- 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/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides a run-time interface for checking the set of
-- restrictions that applies to the current partition. The information
-- comes both from explicit restriction pragmas present, and also from
-- compile time checking.
-- The package simply contains an instantiation of System.Rident, but
-- with names discarded, so that we do not have image tables for the
-- large restriction enumeration types at run time.
pragma Compiler_Unit_Warning;
with System.Rident;
package System.Restrictions is
pragma Preelaborate;
pragma Discard_Names;
package Rident is new System.Rident;
-- Instantiate a copy of System.Rident without enumeration image names
Run_Time_Restrictions : Rident.Restrictions_Info;
-- Restrictions as set by the user, or detected by the binder. See details
-- in package System.Rident for what restrictions are included in the list
-- and the format of the information.
--
-- Note that a restriction which is both Set and Violated at run-time means
-- that the violation was detected as part of the Ada run-time and not as
-- part of user code.
------------------
-- Subprograms --
-----------------
function Abort_Allowed return Boolean;
pragma Inline (Abort_Allowed);
-- Tests to see if abort is allowed by the current restrictions settings.
-- For abort to be allowed, either No_Abort_Statements must be False, or
-- Max_Asynchronous_Select_Nesting must be non-zero.
function Tasking_Allowed return Boolean;
pragma Inline (Tasking_Allowed);
-- Tests to see if tasking operations are allowed by the current
-- restrictions settings. For tasking to be allowed, No_Tasking must
-- be False, and Max_Tasks must not be set to zero.
end System.Restrictions;
|
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Containers.Indefinite_Vectors; use Ada.Containers;
-- XML includes libraries
with Input_Sources.File; use Input_Sources.File;
with Sax.Readers; use Sax.Readers;
with DOM.Readers; use DOM.Readers;
with DOM.Core; use DOM.Core;
with DOM.Core.Documents; use DOM.Core.Documents;
with DOM.Core.Nodes; use DOM.Core.Nodes;
with DOM.Core.Attrs; use DOM.Core.Attrs;
package Parser_Xml is
-- Simple vector of Strings
package String_Vector is new Indefinite_Vectors (Natural, String);
function Extract_Nodes (File_Name : String;
Parent_Name : String)
return Unbounded_String;
function Get_Xml_Tree_From_File (File_Name : String;
Description : String)
return Document;
function Get_Nodes_Value_From_Xml_Tree (Xml_Tree : Document;
Value_Description : String)
return String_Vector.Vector;
end Parser_Xml;
|
--===========================================================================
--
-- This package is the master configuration for the ItsyBitsy
-- use cases:
-- 3: Master ItsyBitsy -> Slave Pico
-- 4: Master ItsyBitsy -> Slave ItsyBitsy
--
--===========================================================================
--
-- Copyright 2022 (C) Holger Rodriguez
--
-- SPDX-License-Identifier: BSD-3-Clause
--
with HAL.SPI;
with RP.Device;
with RP.GPIO;
with RP.SPI;
with ItsyBitsy;
package SPI_Master_ItsyBitsy is
-----------------------------------------------------------------------
-- Master section
SPI : RP.SPI.SPI_Port renames RP.Device.SPI_1;
SCK : RP.GPIO.GPIO_Point renames ItsyBitsy.GP26;
NSS : RP.GPIO.GPIO_Point renames ItsyBitsy.GP29;
MOSI : RP.GPIO.GPIO_Point renames ItsyBitsy.GP27;
MISO : RP.GPIO.GPIO_Point renames ItsyBitsy.GP28;
-----------------------------------------------------------------------
-- Configuration for the master part for the ItsyBitsy
Config : constant RP.SPI.SPI_Configuration
:= (Role => RP.SPI.Master,
Baud => 10_000_000,
Data_Size => HAL.SPI.Data_Size_16b,
others => <>);
-----------------------------------------------------------------------
-- Initializes the ItsyBitsy as master
procedure Initialize;
end SPI_Master_ItsyBitsy;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ L L U --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, 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 System.Unsigned_Types; use System.Unsigned_Types;
package body System.Img_LLU is
------------------------------
-- Image_Long_Long_Unsigned --
------------------------------
procedure Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned;
S : in out String;
P : out Natural)
is
pragma Assert (S'First = 1);
begin
S (1) := ' ';
P := 1;
Set_Image_Long_Long_Unsigned (V, S, P);
end Image_Long_Long_Unsigned;
----------------------------------
-- Set_Image_Long_Long_Unsigned --
----------------------------------
procedure Set_Image_Long_Long_Unsigned
(V : Long_Long_Unsigned;
S : in out String;
P : in out Natural)
is
begin
if V >= 10 then
Set_Image_Long_Long_Unsigned (V / 10, S, P);
P := P + 1;
S (P) := Character'Val (48 + (V rem 10));
else
P := P + 1;
S (P) := Character'Val (48 + V);
end if;
end Set_Image_Long_Long_Unsigned;
end System.Img_LLU;
|
-- This file is generated by SWIG. Please do *not* modify by hand.
--
with fann_c.Pointers;
with interfaces.c;
with interfaces.C;
package fann_c.user_function is
-- Item
--
type Item is access
procedure (arg_5_1 : in interfaces.c.unsigned;
arg_5_2 : in interfaces.c.unsigned;
arg_5_3 : in interfaces.c.unsigned;
arg_5_4 : in fann_c.Pointers.fann_type_Pointer;
arg_5_5 : in fann_c.Pointers.fann_type_Pointer);
pragma convention (C, Item);
-- Items
--
type Items is array (interfaces.C.Size_t range <>) of aliased fann_c.user_function.Item;
-- Pointer
--
type Pointer is access all fann_c.user_function.Item;
-- Pointers
--
type Pointers is array (interfaces.C.Size_t range <>) of aliased fann_c.user_function.Pointer;
-- Pointer_Pointer
--
type Pointer_Pointer is access all fann_c.user_function.Pointer;
end fann_c.user_function;
|
-- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
package body Tk.Test_Data is
procedure Set_Up(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Tear_Down;
end Tk.Test_Data;
|
/*-
* Copyright (c) 1980 The Regents of the University of California.
* All rights reserved.
*
* %sccs.include.proprietary.c%
*
* @(#)instrs.adb 5.1 (Berkeley) 04/04/91
*/
OP("adda",0x8e,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("addb2",0x08,2,ACCR+TYPB,ACCM+TYPB,0,0,0,0),
OP("addb3",0x18,3,ACCR+TYPB,ACCR+TYPB,ACCW+TYPB,0,0,0),
OP("addd",0xc7,1,ACCR+TYPD,0,0,0,0,0),
OP("addf",0xc6,1,ACCR+TYPF,0,0,0,0,0),
OP("addl2",0x0c,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("addl3",0x1c,3,ACCR+TYPL,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("addw2",0x0a,2,ACCR+TYPW,ACCM+TYPW,0,0,0,0),
OP("addw3",0x1a,3,ACCR+TYPW,ACCR+TYPW,ACCW+TYPW,0,0,0),
OP("adwc",0x8d,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("andb2",0xa8,2,ACCR+TYPB,ACCM+TYPB,0,0,0,0),
OP("andb3",0xb8,3,ACCR+TYPB,ACCR+TYPB,ACCW+TYPB,0,0,0),
OP("andl2",0xac,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("andl3",0xbc,3,ACCR+TYPL,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("andw2",0xaa,2,ACCR+TYPW,ACCM+TYPW,0,0,0,0),
OP("andw3",0xba,3,ACCR+TYPW,ACCR+TYPW,ACCW+TYPW,0,0,0),
OP("aobleq",0x3f,3,ACCR+TYPL,ACCM+TYPL,ACCB+TYPW,0,0,0),
OP("aoblss",0x2f,3,ACCR+TYPL,ACCM+TYPL,ACCB+TYPW,0,0,0),
OP("atanf",0x25,0,0,0,0,0,0,0),
OP("bbc",0x1e,3,ACCR+TYPL,ACCR+TYPL,ACCB+TYPW,0,0,0),
OP("bbs",0x0e,3,ACCR+TYPL,ACCR+TYPL,ACCB+TYPW,0,0,0),
OP("bbssi",0x5f,3,ACCR+TYPL,ACCM+TYPL,ACCB+TYPW,0,0,0),
OP("bcc",0xf1,1,ACCB+TYPB,0,0,0,0,0),
OP("bcs",0xe1,1,ACCB+TYPB,0,0,0,0,0),
OP("beql",0x31,1,ACCB+TYPB,0,0,0,0,0),
OP("beqlu",0x31,1,ACCB+TYPB,0,0,0,0,0),
OP("bgeq",0x81,1,ACCB+TYPB,0,0,0,0,0),
OP("bgequ",0xe1,1,ACCB+TYPB,0,0,0,0,0),
OP("bgtr",0x41,1,ACCB+TYPB,0,0,0,0,0),
OP("bgtru",0xa1,1,ACCB+TYPB,0,0,0,0,0),
OP("bicpsw",0x9b,1,ACCR+TYPW,0,0,0,0,0),
OP("bispsw",0x8b,1,ACCR+TYPW,0,0,0,0,0),
OP("bitb",0x39,2,ACCR+TYPB,ACCR+TYPB,0,0,0,0),
OP("bitl",0x3d,2,ACCR+TYPL,ACCR+TYPL,0,0,0,0),
OP("bitw",0x3b,2,ACCR+TYPW,ACCR+TYPW,0,0,0,0),
OP("bleq",0x51,1,ACCB+TYPB,0,0,0,0,0),
OP("blequ",0xb1,1,ACCB+TYPB,0,0,0,0,0),
OP("blss",0x91,1,ACCB+TYPB,0,0,0,0,0),
OP("blssu",0xf1,1,ACCB+TYPB,0,0,0,0,0),
OP("bneq",0x21,1,ACCB+TYPB,0,0,0,0,0),
OP("bnequ",0x21,1,ACCB+TYPB,0,0,0,0,0),
OP("bpt",0x30,0,0,0,0,0,0,0),
OP("brb",0x11,1,ACCB+TYPB,0,0,0,0,0),
OP("brw",0x13,1,ACCB+TYPW,0,0,0,0,0),
OP("btcs",0xce,1,ACCR+TYPB,0,0,0,0,0),
OP("bvc",0xc1,1,ACCB+TYPB,0,0,0,0,0),
OP("bvs",0xd1,1,ACCB+TYPB,0,0,0,0,0),
OP("callf",0xfe,2,ACCR+TYPB,ACCA+TYPB,0,0,0,0),
OP("calls",0xbf,2,ACCR+TYPB,ACCA+TYPB,0,0,0,0),
OP("casel",0xfc,3,ACCR+TYPL,ACCR+TYPL,ACCR+TYPL,0,0,0),
OP("clrb",0x49,1,ACCW+TYPB,0,0,0,0,0),
OP("clrl",0x4d,1,ACCW+TYPL,0,0,0,0,0),
OP("clrw",0x4b,1,ACCW+TYPW,0,0,0,0,0),
OP("cmpb",0x19,2,ACCR+TYPB,ACCR+TYPB,0,0,0,0),
OP("cmpd",0x37,1,ACCR+TYPD,0,0,0,0,0),
OP("cmpd2",0x47,2,ACCR+TYPD,ACCR+TYPD,0,0,0,0),
OP("cmpf",0x36,1,ACCR+TYPF,0,0,0,0,0),
OP("cmpf2",0x46,2,ACCR+TYPF,ACCR+TYPF,0,0,0,0),
OP("cmpl",0x1d,2,ACCR+TYPL,ACCR+TYPL,0,0,0,0),
OP("cmps2",0x92,0,0,0,0,0,0,0),
OP("cmps3",0xd2,0,0,0,0,0,0,0),
OP("cmpw",0x1b,2,ACCR+TYPW,ACCR+TYPW,0,0,0,0),
OP("cosf",0x15,0,0,0,0,0,0,0),
OP("cvdf",0xa6,0,0,0,0,0,0,0),
OP("cvdl",0x87,1,ACCW+TYPL,0,0,0,0,0),
OP("cvfl",0x86,1,ACCW+TYPL,0,0,0,0,0),
OP("cvld",0x77,1,ACCR+TYPL,0,0,0,0,0),
OP("cvlf",0x76,1,ACCR+TYPL,0,0,0,0,0),
OP("cvtbl",0x89,2,ACCR+TYPB,ACCW+TYPL,0,0,0,0),
OP("cvtbw",0x99,2,ACCR+TYPB,ACCW+TYPW,0,0,0,0),
OP("cvtlb",0x6f,2,ACCR+TYPL,ACCW+TYPB,0,0,0,0),
OP("cvtlw",0x7f,2,ACCR+TYPL,ACCW+TYPW,0,0,0,0),
OP("cvtwb",0x33,2,ACCR+TYPW,ACCW+TYPB,0,0,0,0),
OP("cvtwl",0x23,2,ACCR+TYPW,ACCW+TYPL,0,0,0,0),
OP("decb",0x79,1,ACCM+TYPB,0,0,0,0,0),
OP("decl",0x7d,1,ACCM+TYPL,0,0,0,0,0),
OP("decw",0x7b,1,ACCM+TYPW,0,0,0,0,0),
OP("divd",0xf7,1,ACCR+TYPD,0,0,0,0,0),
OP("divf",0xf6,1,ACCR+TYPF,0,0,0,0,0),
OP("divl2",0x6c,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("divl3",0x7c,3,ACCR+TYPL,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("ediv",0x3e,4,ACCR+TYPL,ACCR+TYPQ,ACCW+TYPL,ACCW+TYPL,0,0),
OP("emul",0x2e,4,ACCR+TYPL,ACCR+TYPL,ACCR+TYPL,ACCW+TYPQ,0,0),
OP("expf",0x55,0,0,0,0,0,0,0),
OP("ffc",0xbe,2,ACCR+TYPL,ACCW+TYPL,0,0,0,0),
OP("ffs",0xae,2,ACCR+TYPL,ACCW+TYPL,0,0,0,0),
OP("halt",0x00,0,0,0,0,0,0,0),
OP("incb",0x69,1,ACCM+TYPB,0,0,0,0,0),
OP("incl",0x6d,1,ACCM+TYPL,0,0,0,0,0),
OP("incw",0x6b,1,ACCM+TYPW,0,0,0,0,0),
OP("insque",0xe0,2,ACCA+TYPL,ACCA+TYPL,0,0,0,0),
OP("jmp",0x71,1,ACCA+TYPB,0,0,0,0,0),
OP("kcall",0xcf,1,ACCR+TYPW,0,0,0,0,0),
OP("ldd",0x07,1,ACCR+TYPD,0,0,0,0,0),
OP("ldf",0x06,1,ACCR+TYPF,0,0,0,0,0),
OP("ldfd",0x97,1,ACCR+TYPF,0,0,0,0,0),
OP("ldpctx",0x60,0,0,0,0,0,0,0),
OP("lnd",0x17,1,ACCR+TYPD,0,0,0,0,0),
OP("lnf",0x16,1,ACCR+TYPF,0,0,0,0,0),
OP("loadr",0xab,2,ACCR+TYPW,ACCA+TYPL,0,0,0,0),
OP("logf",0x35,0,0,0,0,0,0,0),
OP("mcomb",0x29,2,ACCR+TYPB,ACCW+TYPB,0,0,0,0),
OP("mcoml",0x2d,2,ACCR+TYPL,ACCW+TYPL,0,0,0,0),
OP("mcomw",0x2b,2,ACCR+TYPW,ACCW+TYPW,0,0,0,0),
OP("mfpr",0xbd,2,ACCR+TYPL,ACCW+TYPL,0,0,0,0),
OP("mnegb",0xe8,2,ACCR+TYPB,ACCW+TYPB,0,0,0,0),
OP("mnegl",0xec,2,ACCR+TYPL,ACCW+TYPL,0,0,0,0),
OP("mnegw",0xea,2,ACCR+TYPW,ACCW+TYPW,0,0,0,0),
OP("movab",0xe9,2,ACCA+TYPB,ACCW+TYPL,0,0,0,0),
OP("moval",0xed,2,ACCA+TYPL,ACCW+TYPL,0,0,0,0),
OP("movaw",0xeb,2,ACCA+TYPW,ACCW+TYPL,0,0,0,0),
OP("movb",0x09,2,ACCR+TYPB,ACCW+TYPB,0,0,0,0),
OP("movblk",0xf8,0,0,0,0,0,0,0),
OP("movl",0x0d,2,ACCR+TYPL,ACCW+TYPL,0,0,0,0),
OP("movob",0xc9,2,ACCR+TYPB,ACCW+TYPB,0,0,0,0),
OP("movow",0xcb,2,ACCR+TYPW,ACCW+TYPW,0,0,0,0),
OP("movpsl",0xcd,1,ACCW+TYPL,0,0,0,0,0),
OP("movs2",0x82,0,0,0,0,0,0,0),
OP("movs3",0xc2,0,0,0,0,0,0,0),
OP("movw",0x0b,2,ACCR+TYPW,ACCW+TYPW,0,0,0,0),
OP("movzbl",0xa9,2,ACCR+TYPB,ACCW+TYPL,0,0,0,0),
OP("movzbw",0xb9,2,ACCR+TYPB,ACCW+TYPW,0,0,0,0),
OP("movzwl",0xc3,2,ACCR+TYPW,ACCW+TYPL,0,0,0,0),
OP("mtpr",0xad,2,ACCR+TYPL,ACCR+TYPL,0,0,0,0),
OP("muld",0xe7,1,ACCR+TYPD,0,0,0,0,0),
OP("mulf",0xe6,1,ACCR+TYPF,0,0,0,0,0),
OP("mull2",0x4c,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("mull3",0x5c,3,ACCR+TYPL,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("negd",0xb7,0,0,0,0,0,0,0),
OP("negf",0xb6,0,0,0,0,0,0,0),
OP("nop",0x10,0,0,0,0,0,0,0),
OP("orb2",0x88,2,ACCR+TYPB,ACCM+TYPB,0,0,0,0),
OP("orb3",0x98,3,ACCR+TYPB,ACCR+TYPB,ACCW+TYPB,0,0,0),
OP("orl2",0x8c,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("orl3",0x9c,3,ACCR+TYPL,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("orw2",0x8a,2,ACCR+TYPW,ACCM+TYPW,0,0,0,0),
OP("orw3",0x9a,3,ACCR+TYPW,ACCR+TYPW,ACCW+TYPW,0,0,0),
OP("prober",0xc0,3,ACCR+TYPB,ACCA+TYPB,ACCR+TYPL,0,0,0),
OP("probew",0xd0,3,ACCR+TYPB,ACCA+TYPB,ACCR+TYPL,0,0,0),
OP("pushab",0xf9,1,ACCA+TYPB,0,0,0,0,0),
OP("pushal",0xfd,1,ACCA+TYPL,0,0,0,0,0),
OP("pushaw",0xfb,1,ACCA+TYPW,0,0,0,0,0),
OP("pushb",0xd9,1,ACCR+TYPB,0,0,0,0,0),
OP("pushd",0x67,0,0,0,0,0,0,0),
OP("pushl",0xdd,1,ACCR+TYPL,0,0,0,0,0),
OP("pushw",0xdb,1,ACCR+TYPW,0,0,0,0,0),
OP("rei",0x20,0,0,0,0,0,0,0),
OP("remque",0xf0,1,ACCA+TYPL,0,0,0,0,0),
OP("ret",0x40,0,0,0,0,0,0,0),
OP("sbwc",0x9d,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("shal",0x4e,3,ACCR+TYPB,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("shar",0x5e,3,ACCR+TYPB,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("shll",0x48,3,ACCR+TYPB,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("shlq",0x4a,3,ACCR+TYPB,ACCR+TYPQ,ACCW+TYPQ,0,0,0),
OP("shrl",0x58,3,ACCR+TYPB,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("shrq",0x5a,3,ACCR+TYPB,ACCR+TYPQ,ACCW+TYPQ,0,0,0),
OP("sinf",0x05,0,0,0,0,0,0,0),
OP("sqrtf",0x45,0,0,0,0,0,0,0),
OP("std",0x27,1,ACCW+TYPD,0,0,0,0,0),
OP("stf",0x26,1,ACCW+TYPF,0,0,0,0,0),
OP("storer",0xbb,2,ACCR+TYPW,ACCA+TYPL,0,0,0,0),
OP("suba",0x9e,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("subb2",0x28,2,ACCR+TYPB,ACCM+TYPB,0,0,0,0),
OP("subb3",0x38,3,ACCR+TYPB,ACCR+TYPB,ACCW+TYPB,0,0,0),
OP("subd",0xd7,1,ACCR+TYPD,0,0,0,0,0),
OP("subf",0xd6,1,ACCR+TYPF,0,0,0,0,0),
OP("subl2",0x2c,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("subl3",0x3c,3,ACCR+TYPL,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("subw2",0x2a,2,ACCR+TYPW,ACCM+TYPW,0,0,0,0),
OP("subw3",0x3a,3,ACCR+TYPW,ACCR+TYPW,ACCW+TYPW,0,0,0),
OP("svpctx",0x70,0,0,0,0,0,0,0),
OP("tstb",0x59,1,ACCR+TYPB,0,0,0,0,0),
OP("tstd",0x57,0,0,0,0,0,0,0),
OP("tstf",0x56,0,0,0,0,0,0,0),
OP("tstl",0x5d,1,ACCR+TYPL,0,0,0,0,0),
OP("tstw",0x5b,1,ACCR+TYPW,0,0,0,0,0),
OP("xorb2",0xc8,2,ACCR+TYPB,ACCM+TYPB,0,0,0,0),
OP("xorb3",0xd8,3,ACCR+TYPB,ACCR+TYPB,ACCW+TYPB,0,0,0),
OP("xorl2",0xcc,2,ACCR+TYPL,ACCM+TYPL,0,0,0,0),
OP("xorl3",0xdc,3,ACCR+TYPL,ACCR+TYPL,ACCW+TYPL,0,0,0),
OP("xorw2",0xca,2,ACCR+TYPW,ACCM+TYPW,0,0,0,0),
OP("xorw3",0xda,3,ACCR+TYPW,ACCR+TYPW,ACCW+TYPW,0,0,0),
|
with Ada.Strings.Unbounded;
with Ada.Text_IO.Text_Streams;
with DOM.Core.Documents;
with DOM.Core.Elements;
with DOM.Core.Nodes;
procedure Character_Remarks is
package DC renames DOM.Core;
package IO renames Ada.Text_IO;
package US renames Ada.Strings.Unbounded;
type Remarks is record
Name : US.Unbounded_String;
Text : US.Unbounded_String;
end record;
type Remark_List is array (Positive range <>) of Remarks;
My_Remarks : Remark_List :=
((US.To_Unbounded_String ("April"),
US.To_Unbounded_String ("Bubbly: I'm > Tam and <= Emily")),
(US.To_Unbounded_String ("Tam O'Shanter"),
US.To_Unbounded_String ("Burns: ""When chapman billies leave the street ...""")),
(US.To_Unbounded_String ("Emily"),
US.To_Unbounded_String ("Short & shrift")));
My_Implementation : DC.DOM_Implementation;
My_Document : DC.Document := DC.Create_Document (My_Implementation);
My_Root_Node : DC.Element := DC.Nodes.Append_Child (My_Document,
DC.Documents.Create_Element (My_Document, "CharacterRemarks"));
My_Element_Node : DC.Element;
My_Text_Node : DC.Text;
begin
for I in My_Remarks'Range loop
My_Element_Node := DC.Nodes.Append_Child (My_Root_Node,
DC.Documents.Create_Element (My_Document, "Character"));
DC.Elements.Set_Attribute (My_Element_Node, "Name", US.To_String (My_Remarks (I).Name));
My_Text_Node := DC.Nodes.Append_Child (My_Element_Node,
DC.Documents.Create_Text_Node (My_Document, US.To_String (My_Remarks (I).Text)));
end loop;
DC.Nodes.Write (IO.Text_Streams.Stream (IO.Standard_Output),
N => My_Document,
Pretty_Print => True);
end Character_Remarks;
|
-- C95065A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT CONSTRAINT_ERROR IS NOT RAISED WHEN AN ENTRY IS DECLARED
-- IF THE VALUE OF THE DEFAULT EXPRESSION FOR THE FORMAL PARAMETER DOES
-- NOT SATISFY THE CONSTRAINTS OF THE TYPE MARK, BUT IS RAISED WHEN THE
-- ENTRY IS CALLED AND THE DEFAULT VALUE IS USED.
-- CASE (A) ARRAY PARAMETERS CONSTRAINED WITH NONSTATIC BOUNDS AND
-- INITIALIZED WITH A STATIC AGGREGATE.
-- JWC 6/19/85
WITH REPORT; USE REPORT;
PROCEDURE C95065A IS
BEGIN
TEST ("C95065A", "CHECK THAT CONSTRAINT_ERROR IS NOT RAISED IF " &
"AN INITIALIZATION VALUE DOES NOT SATISFY " &
"CONSTRAINTS ON A FORMAL PARAMETER WHEN THE " &
"FORMAL PART IS ELABORATED");
BEGIN
DECLARE
TYPE A1 IS ARRAY (1 .. IDENT_INT(1), 1 .. IDENT_INT(10))
OF INTEGER;
TASK T IS
ENTRY E1 (A : A1 := ((1, 0), (0, 1)));
END T;
TASK BODY T IS
BEGIN
SELECT
ACCEPT E1 (A : A1 := ((1, 0), (0, 1))) DO
FAILED ("ACCEPT E1 EXECUTED");
END E1;
OR
TERMINATE;
END SELECT;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED IN TASK T");
END T;
BEGIN
T.E1;
FAILED ("CONSTRAINT ERROR NOT RAISED ON CALL TO T.E1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - E1");
END;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED ("CONSTRAINT_ERROR RAISED (BY ENTRY DECL)");
WHEN TASKING_ERROR =>
FAILED ("TASKING_ERROR RAISED");
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED");
END;
RESULT;
END C95065A;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-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$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with Matreshka.Internals.Strings;
package AMF.Internals.Tables.UMLDI_String_Data_00 is
-- "UMLNameLabel"
MS_0000 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004E#,
16#0061#, 16#006D#, 16#0065#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "no_modelElement"
MS_0001 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#006E#, 16#006F#, 16#005F#, 16#006D#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "A_UMLDiagramElement_localStyle_styledElement"
MS_0002 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 44,
Length => 44,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#005F#,
16#006C#, 16#006F#, 16#0063#, 16#0061#,
16#006C#, 16#0053#, 16#0074#, 16#0079#,
16#006C#, 16#0065#, 16#005F#, 16#0073#,
16#0074#, 16#0079#, 16#006C#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "isDoubleSided may be true only when modelElement is an active Class."
MS_0003 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 68,
Length => 68,
Value =>
(16#0069#, 16#0073#, 16#0044#, 16#006F#,
16#0075#, 16#0062#, 16#006C#, 16#0065#,
16#0053#, 16#0069#, 16#0064#, 16#0065#,
16#0064#, 16#0020#, 16#006D#, 16#0061#,
16#0079#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0074#, 16#0072#, 16#0075#,
16#0065#, 16#0020#, 16#006F#, 16#006E#,
16#006C#, 16#0079#, 16#0020#, 16#0077#,
16#0068#, 16#0065#, 16#006E#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#0069#, 16#0073#, 16#0020#,
16#0061#, 16#006E#, 16#0020#, 16#0061#,
16#0063#, 16#0074#, 16#0069#, 16#0076#,
16#0065#, 16#0020#, 16#0043#, 16#006C#,
16#0061#, 16#0073#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLBehaviorDiagram"
MS_0004 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0042#,
16#0065#, 16#0068#, 16#0061#, 16#0076#,
16#0069#, 16#006F#, 16#0072#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "String to be rendered."
MS_0005 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0053#, 16#0074#, 16#0072#, 16#0069#,
16#006E#, 16#0067#, 16#0020#, 16#0074#,
16#006F#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0072#, 16#0065#, 16#006E#,
16#0064#, 16#0065#, 16#0072#, 16#0065#,
16#0064#, 16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLDiagram_heading_headedDiagram"
MS_0006 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 34,
Length => 34,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#005F#, 16#0068#, 16#0065#, 16#0061#,
16#0064#, 16#0069#, 16#006E#, 16#0067#,
16#005F#, 16#0068#, 16#0065#, 16#0061#,
16#0064#, 16#0065#, 16#0064#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "Restricts shared styles to UMLStyles."
MS_0007 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 37,
Length => 37,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0073#, 16#0068#,
16#0061#, 16#0072#, 16#0065#, 16#0064#,
16#0020#, 16#0073#, 16#0074#, 16#0079#,
16#006C#, 16#0065#, 16#0073#, 16#0020#,
16#0074#, 16#006F#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0053#, 16#0074#,
16#0079#, 16#006C#, 16#0065#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "For diamond kind and an Association modelElement, the Association has exactly two memberEnds, and exactly two of the UMLEdges linked to the shape have those memberEnds as modelElements."
MS_0008 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 191,
Unused => 185,
Length => 185,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0064#, 16#0069#, 16#0061#, 16#006D#,
16#006F#, 16#006E#, 16#0064#, 16#0020#,
16#006B#, 16#0069#, 16#006E#, 16#0064#,
16#0020#, 16#0061#, 16#006E#, 16#0064#,
16#0020#, 16#0061#, 16#006E#, 16#0020#,
16#0041#, 16#0073#, 16#0073#, 16#006F#,
16#0063#, 16#0069#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002C#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0041#, 16#0073#,
16#0073#, 16#006F#, 16#0063#, 16#0069#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0020#, 16#0068#, 16#0061#,
16#0073#, 16#0020#, 16#0065#, 16#0078#,
16#0061#, 16#0063#, 16#0074#, 16#006C#,
16#0079#, 16#0020#, 16#0074#, 16#0077#,
16#006F#, 16#0020#, 16#006D#, 16#0065#,
16#006D#, 16#0062#, 16#0065#, 16#0072#,
16#0045#, 16#006E#, 16#0064#, 16#0073#,
16#002C#, 16#0020#, 16#0061#, 16#006E#,
16#0064#, 16#0020#, 16#0065#, 16#0078#,
16#0061#, 16#0063#, 16#0074#, 16#006C#,
16#0079#, 16#0020#, 16#0074#, 16#0077#,
16#006F#, 16#0020#, 16#006F#, 16#0066#,
16#0020#, 16#0074#, 16#0068#, 16#0065#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0045#, 16#0064#, 16#0067#, 16#0065#,
16#0073#, 16#0020#, 16#006C#, 16#0069#,
16#006E#, 16#006B#, 16#0065#, 16#0064#,
16#0020#, 16#0074#, 16#006F#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#0073#, 16#0068#, 16#0061#, 16#0070#,
16#0065#, 16#0020#, 16#0068#, 16#0061#,
16#0076#, 16#0065#, 16#0020#, 16#0074#,
16#0068#, 16#006F#, 16#0073#, 16#0065#,
16#0020#, 16#006D#, 16#0065#, 16#006D#,
16#0062#, 16#0065#, 16#0072#, 16#0045#,
16#006E#, 16#0064#, 16#0073#, 16#0020#,
16#0061#, 16#0073#, 16#0020#, 16#006D#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "See Subclause 17.11."
MS_0009 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0053#, 16#0065#, 16#0065#, 16#0020#,
16#0053#, 16#0075#, 16#0062#, 16#0063#,
16#006C#, 16#0061#, 16#0075#, 16#0073#,
16#0065#, 16#0020#, 16#0031#, 16#0037#,
16#002E#, 16#0031#, 16#0031#, 16#002E#,
others => 16#0000#),
others => <>);
-- "labelShowingStereotypeValue"
MS_000A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 27,
Length => 27,
Value =>
(16#006C#, 16#0061#, 16#0062#, 16#0065#,
16#006C#, 16#0053#, 16#0068#, 16#006F#,
16#0077#, 16#0069#, 16#006E#, 16#0067#,
16#0053#, 16#0074#, 16#0065#, 16#0072#,
16#0065#, 16#006F#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#0056#, 16#0061#,
16#006C#, 16#0075#, 16#0065#,
others => 16#0000#),
others => <>);
-- "isFrame and isActivityFrame must not be true at the same time."
MS_000B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 62,
Length => 62,
Value =>
(16#0069#, 16#0073#, 16#0046#, 16#0072#,
16#0061#, 16#006D#, 16#0065#, 16#0020#,
16#0061#, 16#006E#, 16#0064#, 16#0020#,
16#0069#, 16#0073#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#0076#, 16#0069#,
16#0074#, 16#0079#, 16#0046#, 16#0072#,
16#0061#, 16#006D#, 16#0065#, 16#0020#,
16#006D#, 16#0075#, 16#0073#, 16#0074#,
16#0020#, 16#006E#, 16#006F#, 16#0074#,
16#0020#, 16#0062#, 16#0065#, 16#0020#,
16#0074#, 16#0072#, 16#0075#, 16#0065#,
16#0020#, 16#0061#, 16#0074#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#0073#, 16#0061#, 16#006D#, 16#0065#,
16#0020#, 16#0074#, 16#0069#, 16#006D#,
16#0065#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLKeywords must have exactly one modelElement."
MS_000C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 47,
Length => 47,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004B#,
16#0065#, 16#0079#, 16#0077#, 16#006F#,
16#0072#, 16#0064#, 16#0073#, 16#0020#,
16#006D#, 16#0075#, 16#0073#, 16#0074#,
16#0020#, 16#0068#, 16#0061#, 16#0076#,
16#0065#, 16#0020#, 16#0065#, 16#0078#,
16#0061#, 16#0063#, 16#0074#, 16#006C#,
16#0079#, 16#0020#, 16#006F#, 16#006E#,
16#0065#, 16#0020#, 16#006D#, 16#006F#,
16#0064#, 16#0065#, 16#006C#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Restricts UMLAssociationEndLabels to show only Properties (that are AssociationEnds, see constraint)."
MS_000D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 111,
Unused => 101,
Length => 101,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0041#, 16#0073#, 16#0073#,
16#006F#, 16#0063#, 16#0069#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0045#, 16#006E#, 16#0064#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
16#0073#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0073#, 16#0068#, 16#006F#,
16#0077#, 16#0020#, 16#006F#, 16#006E#,
16#006C#, 16#0079#, 16#0020#, 16#0050#,
16#0072#, 16#006F#, 16#0070#, 16#0065#,
16#0072#, 16#0074#, 16#0069#, 16#0065#,
16#0073#, 16#0020#, 16#0028#, 16#0074#,
16#0068#, 16#0061#, 16#0074#, 16#0020#,
16#0061#, 16#0072#, 16#0065#, 16#0020#,
16#0041#, 16#0073#, 16#0073#, 16#006F#,
16#0063#, 16#0069#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0045#,
16#006E#, 16#0064#, 16#0073#, 16#002C#,
16#0020#, 16#0073#, 16#0065#, 16#0065#,
16#0020#, 16#0063#, 16#006F#, 16#006E#,
16#0073#, 16#0074#, 16#0072#, 16#0061#,
16#0069#, 16#006E#, 16#0074#, 16#0029#,
16#002E#,
others => 16#0000#),
others => <>);
-- "diamond"
MS_000E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0064#, 16#0069#, 16#0061#, 16#006D#,
16#006F#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- "Separated portions of the shape."
MS_000F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 32,
Length => 32,
Value =>
(16#0053#, 16#0065#, 16#0070#, 16#0061#,
16#0072#, 16#0061#, 16#0074#, 16#0065#,
16#0064#, 16#0020#, 16#0070#, 16#006F#,
16#0072#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0073#, 16#0020#, 16#006F#,
16#0066#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0073#, 16#0068#,
16#0061#, 16#0070#, 16#0065#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLInheritedStateBorderKind"
MS_0010 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 27,
Length => 27,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0049#,
16#006E#, 16#0068#, 16#0065#, 16#0072#,
16#0069#, 16#0074#, 16#0065#, 16#0064#,
16#0053#, 16#0074#, 16#0061#, 16#0074#,
16#0065#, 16#0042#, 16#006F#, 16#0072#,
16#0064#, 16#0065#, 16#0072#, 16#004B#,
16#0069#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- "messageReceivingClass"
MS_0011 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#006D#, 16#0065#, 16#0073#, 16#0073#,
16#0061#, 16#0067#, 16#0065#, 16#0052#,
16#0065#, 16#0063#, 16#0065#, 16#0069#,
16#0076#, 16#0069#, 16#006E#, 16#0067#,
16#0043#, 16#006C#, 16#0061#, 16#0073#,
16#0073#,
others => 16#0000#),
others => <>);
-- "heading_modelElement"
MS_0012 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0068#, 16#0065#, 16#0061#, 16#0064#,
16#0069#, 16#006E#, 16#0067#, 16#005F#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "A_UMLClassifierShape_modelElement_umlDiagramElement"
MS_0013 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 51,
Length => 51,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0043#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0069#, 16#0066#,
16#0069#, 16#0065#, 16#0072#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#005F#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#005F#, 16#0075#, 16#006D#,
16#006C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "UMLAssociationOrConnectorOrLinkShapes must have exactly one modelElement."
MS_0014 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 79,
Unused => 73,
Length => 73,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0041#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#004F#, 16#0072#,
16#0043#, 16#006F#, 16#006E#, 16#006E#,
16#0065#, 16#0063#, 16#0074#, 16#006F#,
16#0072#, 16#004F#, 16#0072#, 16#004C#,
16#0069#, 16#006E#, 16#006B#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#0073#, 16#0020#, 16#006D#, 16#0075#,
16#0073#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0065#, 16#0078#, 16#0061#, 16#0063#,
16#0074#, 16#006C#, 16#0079#, 16#0020#,
16#006F#, 16#006E#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "Specifies the common aspects of UMLClassDiagrams and UMLCompositeStructureDiagrams."
MS_0015 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 87,
Unused => 83,
Length => 83,
Value =>
(16#0053#, 16#0070#, 16#0065#, 16#0063#,
16#0069#, 16#0066#, 16#0069#, 16#0065#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0063#, 16#006F#,
16#006D#, 16#006D#, 16#006F#, 16#006E#,
16#0020#, 16#0061#, 16#0073#, 16#0070#,
16#0065#, 16#0063#, 16#0074#, 16#0073#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0073#,
16#0020#, 16#0061#, 16#006E#, 16#0064#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0043#, 16#006F#, 16#006D#, 16#0070#,
16#006F#, 16#0073#, 16#0069#, 16#0074#,
16#0065#, 16#0053#, 16#0074#, 16#0072#,
16#0075#, 16#0063#, 16#0074#, 16#0075#,
16#0072#, 16#0065#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLDiagramElement_ownedElement_owningElement"
MS_0016 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 46,
Length => 46,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#005F#,
16#006F#, 16#0077#, 16#006E#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#006F#, 16#0077#, 16#006E#,
16#0069#, 16#006E#, 16#0067#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "isTransitionOriented"
MS_0017 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0069#, 16#0073#, 16#0054#, 16#0072#,
16#0061#, 16#006E#, 16#0073#, 16#0069#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#004F#, 16#0072#, 16#0069#, 16#0065#,
16#006E#, 16#0074#, 16#0065#, 16#0064#,
others => 16#0000#),
others => <>);
-- "elementInCompartment"
MS_0018 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0065#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0049#,
16#006E#, 16#0043#, 16#006F#, 16#006D#,
16#0070#, 16#0061#, 16#0072#, 16#0074#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "The most general class for UMLDiagrams depicting structural elements."
MS_0019 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 69,
Length => 69,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0073#, 16#0020#, 16#0064#,
16#0065#, 16#0070#, 16#0069#, 16#0063#,
16#0074#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0073#, 16#0074#, 16#0072#,
16#0075#, 16#0063#, 16#0074#, 16#0075#,
16#0072#, 16#0061#, 16#006C#, 16#0020#,
16#0065#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "UMLTypedElementLabels must have exactly one modelElement."
MS_001A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 57,
Length => 57,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0054#,
16#0079#, 16#0070#, 16#0065#, 16#0064#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
16#0073#, 16#0020#, 16#006D#, 16#0075#,
16#0073#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0065#, 16#0078#, 16#0061#, 16#0063#,
16#0074#, 16#006C#, 16#0079#, 16#0020#,
16#006F#, 16#006E#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "navigabilityNotation"
MS_001B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#006E#, 16#0061#, 16#0076#, 16#0069#,
16#0067#, 16#0061#, 16#0062#, 16#0069#,
16#006C#, 16#0069#, 16#0074#, 16#0079#,
16#004E#, 16#006F#, 16#0074#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "For modelElements that are shown with feature compartments, indicates whether features are shown indented under visibility headings."
MS_001C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 143,
Unused => 132,
Length => 132,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0061#, 16#0074#, 16#0020#, 16#0061#,
16#0072#, 16#0065#, 16#0020#, 16#0073#,
16#0068#, 16#006F#, 16#0077#, 16#006E#,
16#0020#, 16#0077#, 16#0069#, 16#0074#,
16#0068#, 16#0020#, 16#0066#, 16#0065#,
16#0061#, 16#0074#, 16#0075#, 16#0072#,
16#0065#, 16#0020#, 16#0063#, 16#006F#,
16#006D#, 16#0070#, 16#0061#, 16#0072#,
16#0074#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0073#, 16#002C#, 16#0020#,
16#0069#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#0074#, 16#0068#, 16#0065#,
16#0072#, 16#0020#, 16#0066#, 16#0065#,
16#0061#, 16#0074#, 16#0075#, 16#0072#,
16#0065#, 16#0073#, 16#0020#, 16#0061#,
16#0072#, 16#0065#, 16#0020#, 16#0073#,
16#0068#, 16#006F#, 16#0077#, 16#006E#,
16#0020#, 16#0069#, 16#006E#, 16#0064#,
16#0065#, 16#006E#, 16#0074#, 16#0065#,
16#0064#, 16#0020#, 16#0075#, 16#006E#,
16#0064#, 16#0065#, 16#0072#, 16#0020#,
16#0076#, 16#0069#, 16#0073#, 16#0069#,
16#0062#, 16#0069#, 16#006C#, 16#0069#,
16#0074#, 16#0079#, 16#0020#, 16#0068#,
16#0065#, 16#0061#, 16#0064#, 16#0069#,
16#006E#, 16#0067#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "For showing redefinition."
MS_001D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0072#, 16#0065#, 16#0064#, 16#0065#,
16#0066#, 16#0069#, 16#006E#, 16#0069#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#002E#,
others => 16#0000#),
others => <>);
-- "always"
MS_001E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0061#, 16#006C#, 16#0077#, 16#0061#,
16#0079#, 16#0073#,
others => 16#0000#),
others => <>);
-- "no_icon"
MS_001F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#006E#, 16#006F#, 16#005F#, 16#0069#,
16#0063#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "UMLClassDiagram"
MS_0020 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "heading"
MS_0021 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0068#, 16#0065#, 16#0061#, 16#0064#,
16#0069#, 16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- "UMLCompartments have no modelElements."
MS_0022 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 38,
Length => 38,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006F#, 16#006D#, 16#0070#, 16#0061#,
16#0072#, 16#0074#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#0020#,
16#0068#, 16#0061#, 16#0076#, 16#0065#,
16#0020#, 16#006E#, 16#006F#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Restricts the sources of UMLEdges to UMLDiagramElements."
MS_0023 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 56,
Length => 56,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0073#, 16#006F#,
16#0075#, 16#0072#, 16#0063#, 16#0065#,
16#0073#, 16#0020#, 16#006F#, 16#0066#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0045#, 16#0064#, 16#0067#, 16#0065#,
16#0073#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLInteractionTableLabel"
MS_0024 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 24,
Length => 24,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0049#,
16#006E#, 16#0074#, 16#0065#, 16#0072#,
16#0061#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0054#, 16#0061#,
16#0062#, 16#006C#, 16#0065#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "gray"
MS_0025 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0067#, 16#0072#, 16#0061#, 16#0079#,
others => 16#0000#),
others => <>);
-- "state_list"
MS_0026 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0073#, 16#0074#, 16#0061#, 16#0074#,
16#0065#, 16#005F#, 16#006C#, 16#0069#,
16#0073#, 16#0074#,
others => 16#0000#),
others => <>);
-- "UMLInteractionDiagram"
MS_0027 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0049#,
16#006E#, 16#0074#, 16#0065#, 16#0072#,
16#0061#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#,
others => 16#0000#),
others => <>);
-- "overview"
MS_0028 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006F#, 16#0076#, 16#0065#, 16#0072#,
16#0076#, 16#0069#, 16#0065#, 16#0077#,
others => 16#0000#),
others => <>);
-- "Shows the internal structure of a StructuredClassifier. Also see Annex A."
MS_0029 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 79,
Unused => 74,
Length => 74,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0069#, 16#006E#,
16#0074#, 16#0065#, 16#0072#, 16#006E#,
16#0061#, 16#006C#, 16#0020#, 16#0073#,
16#0074#, 16#0072#, 16#0075#, 16#0063#,
16#0074#, 16#0075#, 16#0072#, 16#0065#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0061#, 16#0020#, 16#0053#, 16#0074#,
16#0072#, 16#0075#, 16#0063#, 16#0074#,
16#0075#, 16#0072#, 16#0065#, 16#0064#,
16#0043#, 16#006C#, 16#0061#, 16#0073#,
16#0073#, 16#0069#, 16#0066#, 16#0069#,
16#0065#, 16#0072#, 16#002E#, 16#0020#,
16#0020#, 16#0041#, 16#006C#, 16#0073#,
16#006F#, 16#0020#, 16#0073#, 16#0065#,
16#0065#, 16#0020#, 16#0041#, 16#006E#,
16#006E#, 16#0065#, 16#0078#, 16#0020#,
16#0041#, 16#002E#,
others => 16#0000#),
others => <>);
-- "prop_on_stereotype"
MS_002A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0070#, 16#0072#, 16#006F#, 16#0070#,
16#005F#, 16#006F#, 16#006E#, 16#005F#,
16#0073#, 16#0074#, 16#0065#, 16#0072#,
16#0065#, 16#006F#, 16#0074#, 16#0079#,
16#0070#, 16#0065#,
others => 16#0000#),
others => <>);
-- "A_UMLActivityDiagram_modelElement_umlDiagramElement"
MS_002B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 51,
Length => 51,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#0076#, 16#0069#, 16#0074#,
16#0079#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#005F#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#005F#, 16#0075#, 16#006D#,
16#006C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "Restricts UMLDiagramElements to show UML Elements, rather than other language elements. "
MS_002C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 95,
Unused => 88,
Length => 88,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#0020#, 16#0074#, 16#006F#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0020#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#002C#, 16#0020#, 16#0072#,
16#0061#, 16#0074#, 16#0068#, 16#0065#,
16#0072#, 16#0020#, 16#0074#, 16#0068#,
16#0061#, 16#006E#, 16#0020#, 16#006F#,
16#0074#, 16#0068#, 16#0065#, 16#0072#,
16#0020#, 16#006C#, 16#0061#, 16#006E#,
16#0067#, 16#0075#, 16#0061#, 16#0067#,
16#0065#, 16#0020#, 16#0065#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0073#, 16#002E#, 16#0020#,
others => 16#0000#),
others => <>);
-- "edge_connector"
MS_002D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0065#, 16#0064#, 16#0067#, 16#0065#,
16#005F#, 16#0063#, 16#006F#, 16#006E#,
16#006E#, 16#0065#, 16#0063#, 16#0074#,
16#006F#, 16#0072#,
others => 16#0000#),
others => <>);
-- "UMLRedefinesLabel"
MS_002E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0052#,
16#0065#, 16#0064#, 16#0065#, 16#0066#,
16#0069#, 16#006E#, 16#0065#, 16#0073#,
16#004C#, 16#0061#, 16#0062#, 16#0065#,
16#006C#,
others => 16#0000#),
others => <>);
-- "Restricts UMLMultiplicityLabels to show only MultiplicityElements."
MS_002F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 66,
Length => 66,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#004D#, 16#0075#, 16#006C#,
16#0074#, 16#0069#, 16#0070#, 16#006C#,
16#0069#, 16#0063#, 16#0069#, 16#0074#,
16#0079#, 16#004C#, 16#0061#, 16#0062#,
16#0065#, 16#006C#, 16#0073#, 16#0020#,
16#0074#, 16#006F#, 16#0020#, 16#0073#,
16#0068#, 16#006F#, 16#0077#, 16#0020#,
16#006F#, 16#006E#, 16#006C#, 16#0079#,
16#0020#, 16#004D#, 16#0075#, 16#006C#,
16#0074#, 16#0069#, 16#0070#, 16#006C#,
16#0069#, 16#0063#, 16#0069#, 16#0074#,
16#0079#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLDiagrams cannot have headings without frames, or vice-versa."
MS_0030 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 63,
Length => 63,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0073#, 16#0020#,
16#0063#, 16#0061#, 16#006E#, 16#006E#,
16#006F#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0068#, 16#0065#, 16#0061#, 16#0064#,
16#0069#, 16#006E#, 16#0067#, 16#0073#,
16#0020#, 16#0077#, 16#0069#, 16#0074#,
16#0068#, 16#006F#, 16#0075#, 16#0074#,
16#0020#, 16#0066#, 16#0072#, 16#0061#,
16#006D#, 16#0065#, 16#0073#, 16#002C#,
16#0020#, 16#006F#, 16#0072#, 16#0020#,
16#0076#, 16#0069#, 16#0063#, 16#0065#,
16#002D#, 16#0076#, 16#0065#, 16#0072#,
16#0073#, 16#0061#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLKeywordLabel"
MS_0031 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004B#,
16#0065#, 16#0079#, 16#0077#, 16#006F#,
16#0072#, 16#0064#, 16#004C#, 16#0061#,
16#0062#, 16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "UMLCompartmentableShape"
MS_0032 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 23,
Length => 23,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006F#, 16#006D#, 16#0070#, 16#0061#,
16#0072#, 16#0074#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0061#, 16#0062#,
16#006C#, 16#0065#, 16#0053#, 16#0068#,
16#0061#, 16#0070#, 16#0065#,
others => 16#0000#),
others => <>);
-- "edge_instancespec"
MS_0033 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0065#, 16#0064#, 16#0067#, 16#0065#,
16#005F#, 16#0069#, 16#006E#, 16#0073#,
16#0074#, 16#0061#, 16#006E#, 16#0063#,
16#0065#, 16#0073#, 16#0070#, 16#0065#,
16#0063#,
others => 16#0000#),
others => <>);
-- "modeElement_mult"
MS_0034 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#005F#,
16#006D#, 16#0075#, 16#006C#, 16#0074#,
others => 16#0000#),
others => <>);
-- "Show navigibility or non-navigability only for unidirectional associations and connectors typed by unidirectional associations."
MS_0035 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 135,
Unused => 127,
Length => 127,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0020#, 16#006E#, 16#0061#, 16#0076#,
16#0069#, 16#0067#, 16#0069#, 16#0062#,
16#0069#, 16#006C#, 16#0069#, 16#0074#,
16#0079#, 16#0020#, 16#006F#, 16#0072#,
16#0020#, 16#006E#, 16#006F#, 16#006E#,
16#002D#, 16#006E#, 16#0061#, 16#0076#,
16#0069#, 16#0067#, 16#0061#, 16#0062#,
16#0069#, 16#006C#, 16#0069#, 16#0074#,
16#0079#, 16#0020#, 16#006F#, 16#006E#,
16#006C#, 16#0079#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0075#,
16#006E#, 16#0069#, 16#0064#, 16#0069#,
16#0072#, 16#0065#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0061#,
16#006C#, 16#0020#, 16#0061#, 16#0073#,
16#0073#, 16#006F#, 16#0063#, 16#0069#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0073#, 16#0020#, 16#0061#,
16#006E#, 16#0064#, 16#0020#, 16#0063#,
16#006F#, 16#006E#, 16#006E#, 16#0065#,
16#0063#, 16#0074#, 16#006F#, 16#0072#,
16#0073#, 16#0020#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#0064#, 16#0020#,
16#0062#, 16#0079#, 16#0020#, 16#0075#,
16#006E#, 16#0069#, 16#0064#, 16#0069#,
16#0072#, 16#0065#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0061#,
16#006C#, 16#0020#, 16#0061#, 16#0073#,
16#0073#, 16#006F#, 16#0063#, 16#0069#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLMultiplicityLabel"
MS_0036 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004D#,
16#0075#, 16#006C#, 16#0074#, 16#0069#,
16#0070#, 16#006C#, 16#0069#, 16#0063#,
16#0069#, 16#0074#, 16#0079#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "lifelineInstance"
MS_0037 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#006C#, 16#0069#, 16#0066#, 16#0065#,
16#006C#, 16#0069#, 16#006E#, 16#0065#,
16#0049#, 16#006E#, 16#0073#, 16#0074#,
16#0061#, 16#006E#, 16#0063#, 16#0065#,
others => 16#0000#),
others => <>);
-- "isIso"
MS_0038 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0069#, 16#0073#, 16#0049#, 16#0073#,
16#006F#,
others => 16#0000#),
others => <>);
-- "fontSize"
MS_0039 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0066#, 16#006F#, 16#006E#, 16#0074#,
16#0053#, 16#0069#, 16#007A#, 16#0065#,
others => 16#0000#),
others => <>);
-- "Restricts UMLClassifierShapes to showing exactly one Classifier."
MS_003A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 64,
Length => 64,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0043#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0069#, 16#0066#,
16#0069#, 16#0065#, 16#0072#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#0073#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0073#, 16#0068#, 16#006F#,
16#0077#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0065#, 16#0078#, 16#0061#,
16#0063#, 16#0074#, 16#006C#, 16#0079#,
16#0020#, 16#006F#, 16#006E#, 16#0065#,
16#0020#, 16#0043#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0069#, 16#0066#,
16#0069#, 16#0065#, 16#0072#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLLabels must have no more than one modelElement."
MS_003B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 50,
Length => 50,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
16#0073#, 16#0020#, 16#006D#, 16#0075#,
16#0073#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#006E#, 16#006F#, 16#0020#, 16#006D#,
16#006F#, 16#0072#, 16#0065#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#006E#,
16#0020#, 16#006F#, 16#006E#, 16#0065#,
16#0020#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#002E#,
others => 16#0000#),
others => <>);
-- "fontSize must be greater than zero."
MS_003C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 35,
Length => 35,
Value =>
(16#0066#, 16#006F#, 16#006E#, 16#0074#,
16#0053#, 16#0069#, 16#007A#, 16#0065#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0067#, 16#0072#, 16#0065#,
16#0061#, 16#0074#, 16#0065#, 16#0072#,
16#0020#, 16#0074#, 16#0068#, 16#0061#,
16#006E#, 16#0020#, 16#007A#, 16#0065#,
16#0072#, 16#006F#, 16#002E#,
others => 16#0000#),
others => <>);
-- "headedDiagram"
MS_003D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0068#, 16#0065#, 16#0061#, 16#0064#,
16#0065#, 16#0064#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#,
others => 16#0000#),
others => <>);
-- "diagramIdentifier"
MS_003E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0064#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0049#,
16#0064#, 16#0065#, 16#006E#, 16#0074#,
16#0069#, 16#0066#, 16#0069#, 16#0065#,
16#0072#,
others => 16#0000#),
others => <>);
-- "kind"
MS_003F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#006B#, 16#0069#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- "A_UMLEdge_target_targetEdge"
MS_0040 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 27,
Length => 27,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0045#, 16#0064#, 16#0067#,
16#0065#, 16#005F#, 16#0074#, 16#0061#,
16#0072#, 16#0067#, 16#0065#, 16#0074#,
16#005F#, 16#0074#, 16#0061#, 16#0072#,
16#0067#, 16#0065#, 16#0074#, 16#0045#,
16#0064#, 16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "UMLCompositeStructureDiagram"
MS_0041 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 28,
Length => 28,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006F#, 16#006D#, 16#0070#, 16#006F#,
16#0073#, 16#0069#, 16#0074#, 16#0065#,
16#0053#, 16#0074#, 16#0072#, 16#0075#,
16#0063#, 16#0074#, 16#0075#, 16#0072#,
16#0065#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "sequence"
MS_0042 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0073#, 16#0065#, 16#0071#, 16#0075#,
16#0065#, 16#006E#, 16#0063#, 16#0065#,
others => 16#0000#),
others => <>);
-- "localStyle"
MS_0043 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#006C#, 16#006F#, 16#0063#, 16#0061#,
16#006C#, 16#0053#, 16#0074#, 16#0079#,
16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- "messageSendingInstance"
MS_0044 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#006D#, 16#0065#, 16#0073#, 16#0073#,
16#0061#, 16#0067#, 16#0065#, 16#0053#,
16#0065#, 16#006E#, 16#0064#, 16#0069#,
16#006E#, 16#0067#, 16#0049#, 16#006E#,
16#0073#, 16#0074#, 16#0061#, 16#006E#,
16#0063#, 16#0065#,
others => 16#0000#),
others => <>);
-- "The most general class for UML elements that may have contents shown in separated portions inside the shape."
MS_0045 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 111,
Unused => 108,
Length => 108,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0020#, 16#0065#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#0074#,
16#0020#, 16#006D#, 16#0061#, 16#0079#,
16#0020#, 16#0068#, 16#0061#, 16#0076#,
16#0065#, 16#0020#, 16#0063#, 16#006F#,
16#006E#, 16#0074#, 16#0065#, 16#006E#,
16#0074#, 16#0073#, 16#0020#, 16#0073#,
16#0068#, 16#006F#, 16#0077#, 16#006E#,
16#0020#, 16#0069#, 16#006E#, 16#0020#,
16#0073#, 16#0065#, 16#0070#, 16#0061#,
16#0072#, 16#0061#, 16#0074#, 16#0065#,
16#0064#, 16#0020#, 16#0070#, 16#006F#,
16#0072#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0073#, 16#0020#, 16#0069#,
16#006E#, 16#0073#, 16#0069#, 16#0064#,
16#0065#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0073#, 16#0068#,
16#0061#, 16#0070#, 16#0065#, 16#002E#,
others => 16#0000#),
others => <>);
-- "See Subclause 17.8."
MS_0046 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0053#, 16#0065#, 16#0065#, 16#0020#,
16#0053#, 16#0075#, 16#0062#, 16#0063#,
16#006C#, 16#0061#, 16#0075#, 16#0073#,
16#0065#, 16#0020#, 16#0031#, 16#0037#,
16#002E#, 16#0038#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLAssociationOrConnectorOrLinkShape"
MS_0047 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 36,
Length => 36,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0041#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#004F#, 16#0072#,
16#0043#, 16#006F#, 16#006E#, 16#006E#,
16#0065#, 16#0063#, 16#0074#, 16#006F#,
16#0072#, 16#004F#, 16#0072#, 16#004C#,
16#0069#, 16#006E#, 16#006B#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
others => 16#0000#),
others => <>);
-- "A_UMLDiagramElement_sharedStyle_styledElement"
MS_0048 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#005F#,
16#0073#, 16#0068#, 16#0061#, 16#0072#,
16#0065#, 16#0064#, 16#0053#, 16#0074#,
16#0079#, 16#006C#, 16#0065#, 16#005F#,
16#0073#, 16#0074#, 16#0079#, 16#006C#,
16#0065#, 16#0064#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "Restricts UMLDiagramElements to own only UMLDiagramElements."
MS_0049 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 60,
Length => 60,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#0020#, 16#0074#, 16#006F#, 16#0020#,
16#006F#, 16#0077#, 16#006E#, 16#0020#,
16#006F#, 16#006E#, 16#006C#, 16#0079#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLPackageDiagram"
MS_004A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0050#,
16#0061#, 16#0063#, 16#006B#, 16#0061#,
16#0067#, 16#0065#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#,
others => 16#0000#),
others => <>);
-- "A_UMLStereotypePropertyValueLabel_modelElement_umlDiagramElement"
MS_004B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 64,
Length => 64,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0053#, 16#0074#, 16#0065#,
16#0072#, 16#0065#, 16#006F#, 16#0074#,
16#0079#, 16#0070#, 16#0065#, 16#0050#,
16#0072#, 16#006F#, 16#0070#, 16#0065#,
16#0072#, 16#0074#, 16#0079#, 16#0056#,
16#0061#, 16#006C#, 16#0075#, 16#0065#,
16#004C#, 16#0061#, 16#0062#, 16#0065#,
16#006C#, 16#005F#, 16#006D#, 16#006F#,
16#0064#, 16#0065#, 16#006C#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#005F#, 16#0075#,
16#006D#, 16#006C#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "text"
MS_004C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0074#, 16#0065#, 16#0078#, 16#0074#,
others => 16#0000#),
others => <>);
-- "doubleSided_isActive"
MS_004D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0064#, 16#006F#, 16#0075#, 16#0062#,
16#006C#, 16#0065#, 16#0053#, 16#0069#,
16#0064#, 16#0065#, 16#0064#, 16#005F#,
16#0069#, 16#0073#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#0076#, 16#0065#,
others => 16#0000#),
others => <>);
-- "UMLLabel"
MS_004E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "Indicates whether the UMLActivityDiagram shall be shown with a frame that is a round-cornered rectangle without a pentagonal header."
MS_004F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 143,
Unused => 132,
Length => 132,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#0074#, 16#0068#, 16#0065#,
16#0072#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#0076#, 16#0069#, 16#0074#,
16#0079#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0020#, 16#0073#, 16#0068#, 16#0061#,
16#006C#, 16#006C#, 16#0020#, 16#0062#,
16#0065#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#006E#, 16#0020#,
16#0077#, 16#0069#, 16#0074#, 16#0068#,
16#0020#, 16#0061#, 16#0020#, 16#0066#,
16#0072#, 16#0061#, 16#006D#, 16#0065#,
16#0020#, 16#0074#, 16#0068#, 16#0061#,
16#0074#, 16#0020#, 16#0069#, 16#0073#,
16#0020#, 16#0061#, 16#0020#, 16#0072#,
16#006F#, 16#0075#, 16#006E#, 16#0064#,
16#002D#, 16#0063#, 16#006F#, 16#0072#,
16#006E#, 16#0065#, 16#0072#, 16#0065#,
16#0064#, 16#0020#, 16#0072#, 16#0065#,
16#0063#, 16#0074#, 16#0061#, 16#006E#,
16#0067#, 16#006C#, 16#0065#, 16#0020#,
16#0077#, 16#0069#, 16#0074#, 16#0068#,
16#006F#, 16#0075#, 16#0074#, 16#0020#,
16#0061#, 16#0020#, 16#0070#, 16#0065#,
16#006E#, 16#0074#, 16#0061#, 16#0067#,
16#006F#, 16#006E#, 16#0061#, 16#006C#,
16#0020#, 16#0068#, 16#0065#, 16#0061#,
16#0064#, 16#0065#, 16#0072#, 16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLDiagramElement_modelElement_umlDiagramElement"
MS_0050 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 50,
Length => 50,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#005F#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#0075#, 16#006D#, 16#006C#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "UMLDeploymentDiagrams must have no modelElement."
MS_0051 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 48,
Length => 48,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0044#,
16#0065#, 16#0070#, 16#006C#, 16#006F#,
16#0079#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0073#, 16#0020#, 16#006D#, 16#0075#,
16#0073#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#006E#, 16#006F#, 16#0020#, 16#006D#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#002E#,
others => 16#0000#),
others => <>);
-- "generatedInstanceName"
MS_0052 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0067#, 16#0065#, 16#006E#, 16#0065#,
16#0072#, 16#0061#, 16#0074#, 16#0065#,
16#0064#, 16#0049#, 16#006E#, 16#0073#,
16#0074#, 16#0061#, 16#006E#, 16#0063#,
16#0065#, 16#004E#, 16#0061#, 16#006D#,
16#0065#,
others => 16#0000#),
others => <>);
-- "See Annex D."
MS_0053 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 12,
Length => 12,
Value =>
(16#0053#, 16#0065#, 16#0065#, 16#0020#,
16#0041#, 16#006E#, 16#006E#, 16#0065#,
16#0078#, 16#0020#, 16#0044#, 16#002E#,
others => 16#0000#),
others => <>);
-- "triangle"
MS_0054 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0074#, 16#0072#, 16#0069#, 16#0061#,
16#006E#, 16#0067#, 16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- "UMLDiagram"
MS_0055 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "The modelElement of the heading is the same as the modelElement of the diagram it heads."
MS_0056 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 95,
Unused => 88,
Length => 88,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#0068#, 16#0065#, 16#0061#, 16#0064#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0069#, 16#0073#, 16#0020#, 16#0074#,
16#0068#, 16#0065#, 16#0020#, 16#0073#,
16#0061#, 16#006D#, 16#0065#, 16#0020#,
16#0061#, 16#0073#, 16#0020#, 16#0074#,
16#0068#, 16#0065#, 16#0020#, 16#006D#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0020#,
16#006F#, 16#0066#, 16#0020#, 16#0074#,
16#0068#, 16#0065#, 16#0020#, 16#0064#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0020#, 16#0069#,
16#0074#, 16#0020#, 16#0068#, 16#0065#,
16#0061#, 16#0064#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Size of a font for rendering strings, given in typographical points."
MS_0057 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 68,
Length => 68,
Value =>
(16#0053#, 16#0069#, 16#007A#, 16#0065#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0061#, 16#0020#, 16#0066#, 16#006F#,
16#006E#, 16#0074#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0072#,
16#0065#, 16#006E#, 16#0064#, 16#0065#,
16#0072#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0073#, 16#0074#, 16#0072#,
16#0069#, 16#006E#, 16#0067#, 16#0073#,
16#002C#, 16#0020#, 16#0067#, 16#0069#,
16#0076#, 16#0065#, 16#006E#, 16#0020#,
16#0069#, 16#006E#, 16#0020#, 16#0074#,
16#0079#, 16#0070#, 16#006F#, 16#0067#,
16#0072#, 16#0061#, 16#0070#, 16#0068#,
16#0069#, 16#0063#, 16#0061#, 16#006C#,
16#0020#, 16#0070#, 16#006F#, 16#0069#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "no-frame-no-heading"
MS_0058 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#006E#, 16#006F#, 16#002D#, 16#0066#,
16#0072#, 16#0061#, 16#006D#, 16#0065#,
16#002D#, 16#006E#, 16#006F#, 16#002D#,
16#0068#, 16#0065#, 16#0061#, 16#0064#,
16#0069#, 16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- "sourceEdge"
MS_0059 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0073#, 16#006F#, 16#0075#, 16#0072#,
16#0063#, 16#0065#, 16#0045#, 16#0064#,
16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "owningElement"
MS_005A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#006F#, 16#0077#, 16#006E#, 16#0069#,
16#006E#, 16#0067#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "UMLCompositeStructureDiagrams must have exactly one modelElement."
MS_005B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 65,
Length => 65,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006F#, 16#006D#, 16#0070#, 16#006F#,
16#0073#, 16#0069#, 16#0074#, 16#0065#,
16#0053#, 16#0074#, 16#0072#, 16#0075#,
16#0063#, 16#0074#, 16#0075#, 16#0072#,
16#0065#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0073#, 16#0020#, 16#006D#, 16#0075#,
16#0073#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0065#, 16#0078#, 16#0061#, 16#0063#,
16#0074#, 16#006C#, 16#0079#, 16#0020#,
16#006F#, 16#006E#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "For showing text about NamedElements."
MS_005C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 37,
Length => 37,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0074#, 16#0065#, 16#0078#, 16#0074#,
16#0020#, 16#0061#, 16#0062#, 16#006F#,
16#0075#, 16#0074#, 16#0020#, 16#004E#,
16#0061#, 16#006D#, 16#0065#, 16#0064#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "For modelElements that are Classes with true as a value for isActive that are shown as rectangles, indicates whether the vertical sides shall be rendered as double lines."
MS_005D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 175,
Unused => 170,
Length => 170,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0061#, 16#0074#, 16#0020#, 16#0061#,
16#0072#, 16#0065#, 16#0020#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0065#, 16#0073#, 16#0020#, 16#0077#,
16#0069#, 16#0074#, 16#0068#, 16#0020#,
16#0074#, 16#0072#, 16#0075#, 16#0065#,
16#0020#, 16#0061#, 16#0073#, 16#0020#,
16#0061#, 16#0020#, 16#0076#, 16#0061#,
16#006C#, 16#0075#, 16#0065#, 16#0020#,
16#0066#, 16#006F#, 16#0072#, 16#0020#,
16#0069#, 16#0073#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#0076#, 16#0065#,
16#0020#, 16#0074#, 16#0068#, 16#0061#,
16#0074#, 16#0020#, 16#0061#, 16#0072#,
16#0065#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#006E#, 16#0020#,
16#0061#, 16#0073#, 16#0020#, 16#0072#,
16#0065#, 16#0063#, 16#0074#, 16#0061#,
16#006E#, 16#0067#, 16#006C#, 16#0065#,
16#0073#, 16#002C#, 16#0020#, 16#0069#,
16#006E#, 16#0064#, 16#0069#, 16#0063#,
16#0061#, 16#0074#, 16#0065#, 16#0073#,
16#0020#, 16#0077#, 16#0068#, 16#0065#,
16#0074#, 16#0068#, 16#0065#, 16#0072#,
16#0020#, 16#0074#, 16#0068#, 16#0065#,
16#0020#, 16#0076#, 16#0065#, 16#0072#,
16#0074#, 16#0069#, 16#0063#, 16#0061#,
16#006C#, 16#0020#, 16#0073#, 16#0069#,
16#0064#, 16#0065#, 16#0073#, 16#0020#,
16#0073#, 16#0068#, 16#0061#, 16#006C#,
16#006C#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0072#, 16#0065#, 16#006E#,
16#0064#, 16#0065#, 16#0072#, 16#0065#,
16#0064#, 16#0020#, 16#0061#, 16#0073#,
16#0020#, 16#0064#, 16#006F#, 16#0075#,
16#0062#, 16#006C#, 16#0065#, 16#0020#,
16#006C#, 16#0069#, 16#006E#, 16#0065#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Never show navigibility or non-navigability."
MS_005E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 44,
Length => 44,
Value =>
(16#004E#, 16#0065#, 16#0076#, 16#0065#,
16#0072#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#0020#, 16#006E#,
16#0061#, 16#0076#, 16#0069#, 16#0067#,
16#0069#, 16#0062#, 16#0069#, 16#006C#,
16#0069#, 16#0074#, 16#0079#, 16#0020#,
16#006F#, 16#0072#, 16#0020#, 16#006E#,
16#006F#, 16#006E#, 16#002D#, 16#006E#,
16#0061#, 16#0076#, 16#0069#, 16#0067#,
16#0061#, 16#0062#, 16#0069#, 16#006C#,
16#0069#, 16#0074#, 16#0079#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLUseCaseDiagrams must have no modelElements."
MS_005F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 46,
Length => 46,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0055#,
16#0073#, 16#0065#, 16#0043#, 16#0061#,
16#0073#, 16#0065#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0073#, 16#0020#, 16#006D#,
16#0075#, 16#0073#, 16#0074#, 16#0020#,
16#0068#, 16#0061#, 16#0076#, 16#0065#,
16#0020#, 16#006E#, 16#006F#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Shows Classifiers with shapes that may have compartments."
MS_0060 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 57,
Length => 57,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0043#, 16#006C#,
16#0061#, 16#0073#, 16#0073#, 16#0069#,
16#0066#, 16#0069#, 16#0065#, 16#0072#,
16#0073#, 16#0020#, 16#0077#, 16#0069#,
16#0074#, 16#0068#, 16#0020#, 16#0073#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0061#, 16#0074#, 16#0020#, 16#006D#,
16#0061#, 16#0079#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0072#, 16#0074#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "Restricts UMLInteractionDiagrams to showing Interactions."
MS_0061 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 57,
Length => 57,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0049#, 16#006E#, 16#0074#,
16#0065#, 16#0072#, 16#0061#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0073#,
16#0020#, 16#0074#, 16#006F#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0049#, 16#006E#, 16#0074#, 16#0065#,
16#0072#, 16#0061#, 16#0063#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "fontName"
MS_0062 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0066#, 16#006F#, 16#006E#, 16#0074#,
16#004E#, 16#0061#, 16#006D#, 16#0065#,
others => 16#0000#),
others => <>);
-- "Restricts UMLDiagramElements to be owned by only UMLDiagramElements."
MS_0063 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 68,
Length => 68,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#0020#, 16#0074#, 16#006F#, 16#0020#,
16#0062#, 16#0065#, 16#0020#, 16#006F#,
16#0077#, 16#006E#, 16#0065#, 16#0064#,
16#0020#, 16#0062#, 16#0079#, 16#0020#,
16#006F#, 16#006E#, 16#006C#, 16#0079#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLLabels must have the value of false for isIcon."
MS_0064 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 50,
Length => 50,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
16#0073#, 16#0020#, 16#006D#, 16#0075#,
16#0073#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#0076#, 16#0061#, 16#006C#, 16#0075#,
16#0065#, 16#0020#, 16#006F#, 16#0066#,
16#0020#, 16#0066#, 16#0061#, 16#006C#,
16#0073#, 16#0065#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0069#,
16#0073#, 16#0049#, 16#0063#, 16#006F#,
16#006E#, 16#002E#,
others => 16#0000#),
others => <>);
-- "targetEdge"
MS_0065 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0074#, 16#0061#, 16#0072#, 16#0067#,
16#0065#, 16#0074#, 16#0045#, 16#0064#,
16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "UMLDI"
MS_0066 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0044#,
16#0049#,
others => 16#0000#),
others => <>);
-- "UMLClassDiagrams must have no modelElements."
MS_0067 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 44,
Length => 44,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0073#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0068#, 16#0061#,
16#0076#, 16#0065#, 16#0020#, 16#006E#,
16#006F#, 16#0020#, 16#006D#, 16#006F#,
16#0064#, 16#0065#, 16#006C#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Shows an StateMachine and its elements. Also see Annex A."
MS_0068 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 58,
Length => 58,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#0053#, 16#0074#, 16#0061#,
16#0074#, 16#0065#, 16#004D#, 16#0061#,
16#0063#, 16#0068#, 16#0069#, 16#006E#,
16#0065#, 16#0020#, 16#0061#, 16#006E#,
16#0064#, 16#0020#, 16#0069#, 16#0074#,
16#0073#, 16#0020#, 16#0065#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0073#, 16#002E#, 16#0020#,
16#0020#, 16#0041#, 16#006C#, 16#0073#,
16#006F#, 16#0020#, 16#0073#, 16#0065#,
16#0065#, 16#0020#, 16#0041#, 16#006E#,
16#006E#, 16#0065#, 16#0078#, 16#0020#,
16#0041#, 16#002E#,
others => 16#0000#),
others => <>);
-- "The most general class for UML diagram interchange."
MS_0069 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 51,
Length => 51,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0020#, 16#0064#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0020#, 16#0069#,
16#006E#, 16#0074#, 16#0065#, 16#0072#,
16#0063#, 16#0068#, 16#0061#, 16#006E#,
16#0067#, 16#0065#, 16#002E#,
others => 16#0000#),
others => <>);
-- "timing"
MS_006A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0074#, 16#0069#, 16#006D#, 16#0069#,
16#006E#, 16#0067#,
others => 16#0000#),
others => <>);
-- "See Subclause 17.10."
MS_006B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0053#, 16#0065#, 16#0065#, 16#0020#,
16#0053#, 16#0075#, 16#0062#, 16#0063#,
16#006C#, 16#0061#, 16#0075#, 16#0073#,
16#0065#, 16#0020#, 16#0031#, 16#0037#,
16#002E#, 16#0031#, 16#0030#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Alternatives for diagramming Interactions."
MS_006C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 42,
Length => 42,
Value =>
(16#0041#, 16#006C#, 16#0074#, 16#0065#,
16#0072#, 16#006E#, 16#0061#, 16#0074#,
16#0069#, 16#0076#, 16#0065#, 16#0073#,
16#0020#, 16#0066#, 16#006F#, 16#0072#,
16#0020#, 16#0064#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#006D#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0049#, 16#006E#, 16#0074#,
16#0065#, 16#0072#, 16#0061#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLInteractionTableLabelKind"
MS_006D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 28,
Length => 28,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0049#,
16#006E#, 16#0074#, 16#0065#, 16#0072#,
16#0061#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0054#, 16#0061#,
16#0062#, 16#006C#, 16#0065#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
16#004B#, 16#0069#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- "The most general class for UML diagram elements that are rendered as lines."
MS_006E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 79,
Unused => 75,
Length => 75,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0020#, 16#0064#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0020#, 16#0065#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#0074#,
16#0020#, 16#0061#, 16#0072#, 16#0065#,
16#0020#, 16#0072#, 16#0065#, 16#006E#,
16#0064#, 16#0065#, 16#0072#, 16#0065#,
16#0064#, 16#0020#, 16#0061#, 16#0073#,
16#0020#, 16#006C#, 16#0069#, 16#006E#,
16#0065#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "isActivityFrame"
MS_006F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0069#, 16#0073#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#0076#, 16#0069#,
16#0074#, 16#0079#, 16#0046#, 16#0072#,
16#0061#, 16#006D#, 16#0065#,
others => 16#0000#),
others => <>);
-- "UMLInteractionDiagramKind"
MS_0070 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 25,
Length => 25,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0049#,
16#006E#, 16#0074#, 16#0065#, 16#0072#,
16#0061#, 16#0063#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#004B#, 16#0069#, 16#006E#,
16#0064#,
others => 16#0000#),
others => <>);
-- "A Property of a Stereotype applied to the stereotypedElement."
MS_0071 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 61,
Length => 61,
Value =>
(16#0041#, 16#0020#, 16#0050#, 16#0072#,
16#006F#, 16#0070#, 16#0065#, 16#0072#,
16#0074#, 16#0079#, 16#0020#, 16#006F#,
16#0066#, 16#0020#, 16#0061#, 16#0020#,
16#0053#, 16#0074#, 16#0065#, 16#0072#,
16#0065#, 16#006F#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#0020#, 16#0061#,
16#0070#, 16#0070#, 16#006C#, 16#0069#,
16#0065#, 16#0064#, 16#0020#, 16#0074#,
16#006F#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0073#, 16#0074#,
16#0065#, 16#0072#, 16#0065#, 16#006F#,
16#0074#, 16#0079#, 16#0070#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "The most general class for Styles in UML."
MS_0072 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 41,
Length => 41,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0053#,
16#0074#, 16#0079#, 16#006C#, 16#0065#,
16#0073#, 16#0020#, 16#0069#, 16#006E#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#002E#,
others => 16#0000#),
others => <>);
-- "Alternatives for rendering borders on UMLShapes that have an inherited State as modelElement."
MS_0073 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 95,
Unused => 93,
Length => 93,
Value =>
(16#0041#, 16#006C#, 16#0074#, 16#0065#,
16#0072#, 16#006E#, 16#0061#, 16#0074#,
16#0069#, 16#0076#, 16#0065#, 16#0073#,
16#0020#, 16#0066#, 16#006F#, 16#0072#,
16#0020#, 16#0072#, 16#0065#, 16#006E#,
16#0064#, 16#0065#, 16#0072#, 16#0069#,
16#006E#, 16#0067#, 16#0020#, 16#0062#,
16#006F#, 16#0072#, 16#0064#, 16#0065#,
16#0072#, 16#0073#, 16#0020#, 16#006F#,
16#006E#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0053#, 16#0068#, 16#0061#,
16#0070#, 16#0065#, 16#0073#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#0074#,
16#0020#, 16#0068#, 16#0061#, 16#0076#,
16#0065#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#0069#, 16#006E#, 16#0068#,
16#0065#, 16#0072#, 16#0069#, 16#0074#,
16#0065#, 16#0064#, 16#0020#, 16#0053#,
16#0074#, 16#0061#, 16#0074#, 16#0065#,
16#0020#, 16#0061#, 16#0073#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "Contents of the compartment."
MS_0074 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 28,
Length => 28,
Value =>
(16#0043#, 16#006F#, 16#006E#, 16#0074#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0072#, 16#0074#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLObjectDiagram"
MS_0075 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004F#,
16#0062#, 16#006A#, 16#0065#, 16#0063#,
16#0074#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "Name of a font used to render strings."
MS_0076 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 38,
Length => 38,
Value =>
(16#004E#, 16#0061#, 16#006D#, 16#0065#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0061#, 16#0020#, 16#0066#, 16#006F#,
16#006E#, 16#0074#, 16#0020#, 16#0075#,
16#0073#, 16#0065#, 16#0064#, 16#0020#,
16#0074#, 16#006F#, 16#0020#, 16#0072#,
16#0065#, 16#006E#, 16#0064#, 16#0065#,
16#0072#, 16#0020#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#006E#, 16#0067#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "isIndentForVisibility"
MS_0077 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0069#, 16#0073#, 16#0049#, 16#006E#,
16#0064#, 16#0065#, 16#006E#, 16#0074#,
16#0046#, 16#006F#, 16#0072#, 16#0056#,
16#0069#, 16#0073#, 16#0069#, 16#0062#,
16#0069#, 16#006C#, 16#0069#, 16#0074#,
16#0079#,
others => 16#0000#),
others => <>);
-- "Restricts UMLNameLabels to be notation for NamedElements."
MS_0078 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 57,
Length => 57,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#004E#, 16#0061#, 16#006D#,
16#0065#, 16#004C#, 16#0061#, 16#0062#,
16#0065#, 16#006C#, 16#0073#, 16#0020#,
16#0074#, 16#006F#, 16#0020#, 16#0062#,
16#0065#, 16#0020#, 16#006E#, 16#006F#,
16#0074#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#004E#,
16#0061#, 16#006D#, 16#0065#, 16#0064#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLAssociationEndLabel_modelElement_umlDiagramElement"
MS_0079 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 55,
Length => 55,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0041#, 16#0073#, 16#0073#,
16#006F#, 16#0063#, 16#0069#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0045#, 16#006E#, 16#0064#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
16#005F#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#005F#, 16#0075#, 16#006D#,
16#006C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "false"
MS_007A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0066#, 16#0061#, 16#006C#, 16#0073#,
16#0065#,
others => 16#0000#),
others => <>);
-- "A_UMLCompartment_elementInCompartment_owningCompartment"
MS_007B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 55,
Length => 55,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0043#, 16#006F#, 16#006D#,
16#0070#, 16#0061#, 16#0072#, 16#0074#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#0065#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0049#, 16#006E#, 16#0043#, 16#006F#,
16#006D#, 16#0070#, 16#0061#, 16#0072#,
16#0074#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#005F#, 16#006F#, 16#0077#,
16#006E#, 16#0069#, 16#006E#, 16#0067#,
16#0043#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0072#, 16#0074#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "Property must be on Stereotype applied to stereotypedElement."
MS_007C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 61,
Length => 61,
Value =>
(16#0050#, 16#0072#, 16#006F#, 16#0070#,
16#0065#, 16#0072#, 16#0074#, 16#0079#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#006F#, 16#006E#, 16#0020#,
16#0053#, 16#0074#, 16#0065#, 16#0072#,
16#0065#, 16#006F#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#0020#, 16#0061#,
16#0070#, 16#0070#, 16#006C#, 16#0069#,
16#0065#, 16#0064#, 16#0020#, 16#0074#,
16#006F#, 16#0020#, 16#0073#, 16#0074#,
16#0065#, 16#0072#, 16#0065#, 16#006F#,
16#0074#, 16#0079#, 16#0070#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "Contents of compartments in the same shape are of different types. See constraint on compartment contents."
MS_007D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 119,
Unused => 112,
Length => 112,
Value =>
(16#0043#, 16#006F#, 16#006E#, 16#0074#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0072#, 16#0074#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#0020#, 16#0069#, 16#006E#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#0073#, 16#0061#, 16#006D#, 16#0065#,
16#0020#, 16#0073#, 16#0068#, 16#0061#,
16#0070#, 16#0065#, 16#0020#, 16#0061#,
16#0072#, 16#0065#, 16#0020#, 16#006F#,
16#0066#, 16#0020#, 16#0064#, 16#0069#,
16#0066#, 16#0066#, 16#0065#, 16#0072#,
16#0065#, 16#006E#, 16#0074#, 16#0020#,
16#0074#, 16#0079#, 16#0070#, 16#0065#,
16#0073#, 16#002E#, 16#0026#, 16#006E#,
16#0062#, 16#0073#, 16#0070#, 16#003B#,
16#0020#, 16#0053#, 16#0065#, 16#0065#,
16#0020#, 16#0063#, 16#006F#, 16#006E#,
16#0073#, 16#0074#, 16#0072#, 16#0061#,
16#0069#, 16#006E#, 16#0074#, 16#0020#,
16#006F#, 16#006E#, 16#0020#, 16#0063#,
16#006F#, 16#006D#, 16#0070#, 16#0061#,
16#0072#, 16#0074#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0020#, 16#0063#,
16#006F#, 16#006E#, 16#0074#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Shows text about Properties that are Association ends."
MS_007E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 54,
Length => 54,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0074#, 16#0065#,
16#0078#, 16#0074#, 16#0020#, 16#0061#,
16#0062#, 16#006F#, 16#0075#, 16#0074#,
16#0020#, 16#0050#, 16#0072#, 16#006F#,
16#0070#, 16#0065#, 16#0072#, 16#0074#,
16#0069#, 16#0065#, 16#0073#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#0074#,
16#0020#, 16#0061#, 16#0072#, 16#0065#,
16#0020#, 16#0041#, 16#0073#, 16#0073#,
16#006F#, 16#0063#, 16#0069#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0020#, 16#0065#, 16#006E#, 16#0064#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLRedefines_modelElement_umlDiagramElement"
MS_007F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0052#, 16#0065#, 16#0064#,
16#0065#, 16#0066#, 16#0069#, 16#006E#,
16#0065#, 16#0073#, 16#005F#, 16#006D#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#005F#,
16#0075#, 16#006D#, 16#006C#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "Indicate when ISO notation rules shall be followed."
MS_0080 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 51,
Length => 51,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0020#, 16#0077#, 16#0068#, 16#0065#,
16#006E#, 16#0020#, 16#0049#, 16#0053#,
16#004F#, 16#0020#, 16#006E#, 16#006F#,
16#0074#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0020#, 16#0072#,
16#0075#, 16#006C#, 16#0065#, 16#0073#,
16#0020#, 16#0073#, 16#0068#, 16#0061#,
16#006C#, 16#006C#, 16#0020#, 16#0062#,
16#0065#, 16#0020#, 16#0066#, 16#006F#,
16#006C#, 16#006C#, 16#006F#, 16#0077#,
16#0065#, 16#0064#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLStereotypePropertyValueLabel"
MS_0081 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 31,
Length => 31,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0053#,
16#0074#, 16#0065#, 16#0072#, 16#0065#,
16#006F#, 16#0074#, 16#0079#, 16#0070#,
16#0065#, 16#0050#, 16#0072#, 16#006F#,
16#0070#, 16#0065#, 16#0072#, 16#0074#,
16#0079#, 16#0056#, 16#0061#, 16#006C#,
16#0075#, 16#0065#, 16#004C#, 16#0061#,
16#0062#, 16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "UMLStructureDiagram"
MS_0082 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0053#,
16#0074#, 16#0072#, 16#0075#, 16#0063#,
16#0074#, 16#0075#, 16#0072#, 16#0065#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "isCollapseStateIcon"
MS_0083 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0069#, 16#0073#, 16#0043#, 16#006F#,
16#006C#, 16#006C#, 16#0061#, 16#0070#,
16#0073#, 16#0065#, 16#0053#, 16#0074#,
16#0061#, 16#0074#, 16#0065#, 16#0049#,
16#0063#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "otherEnd"
MS_0084 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006F#, 16#0074#, 16#0068#, 16#0065#,
16#0072#, 16#0045#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- "Shows an Interaction and its elements. Also see Annex A."
MS_0085 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 57,
Length => 57,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#0049#, 16#006E#, 16#0074#,
16#0065#, 16#0072#, 16#0061#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0020#, 16#0061#, 16#006E#, 16#0064#,
16#0020#, 16#0069#, 16#0074#, 16#0073#,
16#0020#, 16#0065#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#002E#, 16#0020#, 16#0020#,
16#0041#, 16#006C#, 16#0073#, 16#006F#,
16#0020#, 16#0073#, 16#0065#, 16#0065#,
16#0020#, 16#0041#, 16#006E#, 16#006E#,
16#0065#, 16#0078#, 16#0020#, 16#0041#,
16#002E#,
others => 16#0000#),
others => <>);
-- "frame"
MS_0086 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0066#, 16#0072#, 16#0061#, 16#006D#,
16#0065#,
others => 16#0000#),
others => <>);
-- "For showing Property values of Stereotypes applied to UML abstract syntax elements."
MS_0087 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 87,
Unused => 83,
Length => 83,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0050#, 16#0072#, 16#006F#, 16#0070#,
16#0065#, 16#0072#, 16#0074#, 16#0079#,
16#0020#, 16#0076#, 16#0061#, 16#006C#,
16#0075#, 16#0065#, 16#0073#, 16#0020#,
16#006F#, 16#0066#, 16#0020#, 16#0053#,
16#0074#, 16#0065#, 16#0072#, 16#0065#,
16#006F#, 16#0074#, 16#0079#, 16#0070#,
16#0065#, 16#0073#, 16#0020#, 16#0061#,
16#0070#, 16#0070#, 16#006C#, 16#0069#,
16#0065#, 16#0064#, 16#0020#, 16#0074#,
16#006F#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0020#, 16#0061#, 16#0062#,
16#0073#, 16#0074#, 16#0072#, 16#0061#,
16#0063#, 16#0074#, 16#0020#, 16#0073#,
16#0079#, 16#006E#, 16#0074#, 16#0061#,
16#0078#, 16#0020#, 16#0065#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "inheritedStateBorder"
MS_0088 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0069#, 16#006E#, 16#0068#, 16#0065#,
16#0072#, 16#0069#, 16#0074#, 16#0065#,
16#0064#, 16#0053#, 16#0074#, 16#0061#,
16#0074#, 16#0065#, 16#0042#, 16#006F#,
16#0072#, 16#0064#, 16#0065#, 16#0072#,
others => 16#0000#),
others => <>);
-- "Grey borders."
MS_0089 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 13,
Length => 13,
Value =>
(16#0047#, 16#0072#, 16#0065#, 16#0079#,
16#0020#, 16#0062#, 16#006F#, 16#0072#,
16#0064#, 16#0065#, 16#0072#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "UMLStateShapes may have multiple modelElements only when their outgoing Transitions have no triggers or effects, and target the same junction State that has one outgoing Transition."
MS_008A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 191,
Unused => 181,
Length => 181,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0053#,
16#0074#, 16#0061#, 16#0074#, 16#0065#,
16#0053#, 16#0068#, 16#0061#, 16#0070#,
16#0065#, 16#0073#, 16#0020#, 16#006D#,
16#0061#, 16#0079#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#006D#, 16#0075#, 16#006C#, 16#0074#,
16#0069#, 16#0070#, 16#006C#, 16#0065#,
16#0020#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0073#, 16#0020#, 16#006F#,
16#006E#, 16#006C#, 16#0079#, 16#0020#,
16#0077#, 16#0068#, 16#0065#, 16#006E#,
16#0020#, 16#0074#, 16#0068#, 16#0065#,
16#0069#, 16#0072#, 16#0020#, 16#006F#,
16#0075#, 16#0074#, 16#0067#, 16#006F#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0054#, 16#0072#, 16#0061#, 16#006E#,
16#0073#, 16#0069#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#0020#,
16#0068#, 16#0061#, 16#0076#, 16#0065#,
16#0020#, 16#006E#, 16#006F#, 16#0020#,
16#0074#, 16#0072#, 16#0069#, 16#0067#,
16#0067#, 16#0065#, 16#0072#, 16#0073#,
16#0020#, 16#006F#, 16#0072#, 16#0020#,
16#0065#, 16#0066#, 16#0066#, 16#0065#,
16#0063#, 16#0074#, 16#0073#, 16#002C#,
16#0020#, 16#0061#, 16#006E#, 16#0064#,
16#0020#, 16#0074#, 16#0061#, 16#0072#,
16#0067#, 16#0065#, 16#0074#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#0073#, 16#0061#, 16#006D#, 16#0065#,
16#0020#, 16#006A#, 16#0075#, 16#006E#,
16#0063#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0020#, 16#0053#, 16#0074#,
16#0061#, 16#0074#, 16#0065#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#0074#,
16#0020#, 16#0068#, 16#0061#, 16#0073#,
16#0020#, 16#006F#, 16#006E#, 16#0065#,
16#0020#, 16#006F#, 16#0075#, 16#0074#,
16#0067#, 16#006F#, 16#0069#, 16#006E#,
16#0067#, 16#0020#, 16#0054#, 16#0072#,
16#0061#, 16#006E#, 16#0073#, 16#0069#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#002E#,
others => 16#0000#),
others => <>);
-- "The most general class for UML diagrams."
MS_008B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 40,
Length => 40,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0020#, 16#0064#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Indicates when to show non-navigability of associations or connectors typed by associations."
MS_008C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 95,
Unused => 92,
Length => 92,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#006E#, 16#0020#, 16#0074#,
16#006F#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#0020#, 16#006E#,
16#006F#, 16#006E#, 16#002D#, 16#006E#,
16#0061#, 16#0076#, 16#0069#, 16#0067#,
16#0061#, 16#0062#, 16#0069#, 16#006C#,
16#0069#, 16#0074#, 16#0079#, 16#0020#,
16#006F#, 16#0066#, 16#0020#, 16#0061#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#0020#,
16#006F#, 16#0072#, 16#0020#, 16#0063#,
16#006F#, 16#006E#, 16#006E#, 16#0065#,
16#0063#, 16#0074#, 16#006F#, 16#0072#,
16#0073#, 16#0020#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#0064#, 16#0020#,
16#0062#, 16#0079#, 16#0020#, 16#0061#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "sequenceNumber"
MS_008D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0073#, 16#0065#, 16#0071#, 16#0075#,
16#0065#, 16#006E#, 16#0063#, 16#0065#,
16#004E#, 16#0075#, 16#006D#, 16#0062#,
16#0065#, 16#0072#,
others => 16#0000#),
others => <>);
-- "A separated portion of a UMLCompartmentableShape."
MS_008E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 49,
Length => 49,
Value =>
(16#0041#, 16#0020#, 16#0073#, 16#0065#,
16#0070#, 16#0061#, 16#0072#, 16#0061#,
16#0074#, 16#0065#, 16#0064#, 16#0020#,
16#0070#, 16#006F#, 16#0072#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#006F#, 16#0066#, 16#0020#, 16#0061#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0043#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0072#, 16#0074#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0061#,
16#0062#, 16#006C#, 16#0065#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#002E#,
others => 16#0000#),
others => <>);
-- "isTabbed"
MS_008F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#0054#, 16#0061#,
16#0062#, 16#0062#, 16#0065#, 16#0064#,
others => 16#0000#),
others => <>);
-- "See Annex A."
MS_0090 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#0053#, 16#0065#, 16#0065#, 16#0020#,
16#0041#, 16#006E#, 16#006E#, 16#0065#,
16#0078#, 16#0020#, 16#0041#, 16#002E#,
others => 16#0000#),
others => <>);
-- "For diamond kind and a Connector modelElement, the Connector has exactly two ends, and exactly two of the UMLEdges linked to the shape have definingEnds of those ends as modelElements."
MS_0091 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 191,
Unused => 184,
Length => 184,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0064#, 16#0069#, 16#0061#, 16#006D#,
16#006F#, 16#006E#, 16#0064#, 16#0020#,
16#006B#, 16#0069#, 16#006E#, 16#0064#,
16#0020#, 16#0061#, 16#006E#, 16#0064#,
16#0020#, 16#0061#, 16#0020#, 16#0043#,
16#006F#, 16#006E#, 16#006E#, 16#0065#,
16#0063#, 16#0074#, 16#006F#, 16#0072#,
16#0020#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#002C#, 16#0020#, 16#0074#,
16#0068#, 16#0065#, 16#0020#, 16#0043#,
16#006F#, 16#006E#, 16#006E#, 16#0065#,
16#0063#, 16#0074#, 16#006F#, 16#0072#,
16#0020#, 16#0068#, 16#0061#, 16#0073#,
16#0020#, 16#0065#, 16#0078#, 16#0061#,
16#0063#, 16#0074#, 16#006C#, 16#0079#,
16#0020#, 16#0074#, 16#0077#, 16#006F#,
16#0020#, 16#0065#, 16#006E#, 16#0064#,
16#0073#, 16#002C#, 16#0020#, 16#0061#,
16#006E#, 16#0064#, 16#0020#, 16#0065#,
16#0078#, 16#0061#, 16#0063#, 16#0074#,
16#006C#, 16#0079#, 16#0020#, 16#0074#,
16#0077#, 16#006F#, 16#0020#, 16#006F#,
16#0066#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0045#, 16#0064#, 16#0067#,
16#0065#, 16#0073#, 16#0020#, 16#006C#,
16#0069#, 16#006E#, 16#006B#, 16#0065#,
16#0064#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0074#, 16#0068#, 16#0065#,
16#0020#, 16#0073#, 16#0068#, 16#0061#,
16#0070#, 16#0065#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0064#, 16#0065#, 16#0066#, 16#0069#,
16#006E#, 16#0069#, 16#006E#, 16#0067#,
16#0045#, 16#006E#, 16#0064#, 16#0073#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0074#, 16#0068#, 16#006F#, 16#0073#,
16#0065#, 16#0020#, 16#0065#, 16#006E#,
16#0064#, 16#0073#, 16#0020#, 16#0061#,
16#0073#, 16#0020#, 16#006D#, 16#006F#,
16#0064#, 16#0065#, 16#006C#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "nonNavigabilityNotation"
MS_0092 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 23,
Length => 23,
Value =>
(16#006E#, 16#006F#, 16#006E#, 16#004E#,
16#0061#, 16#0076#, 16#0069#, 16#0067#,
16#0061#, 16#0062#, 16#0069#, 16#006C#,
16#0069#, 16#0074#, 16#0079#, 16#004E#,
16#006F#, 16#0074#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "sharedStyle"
MS_0093 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0073#, 16#0068#, 16#0061#, 16#0072#,
16#0065#, 16#0064#, 16#0053#, 16#0074#,
16#0079#, 16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- "Dashed borders."
MS_0094 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 15,
Length => 15,
Value =>
(16#0044#, 16#0061#, 16#0073#, 16#0068#,
16#0065#, 16#0064#, 16#0020#, 16#0062#,
16#006F#, 16#0072#, 16#0064#, 16#0065#,
16#0072#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "table"
MS_0095 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0074#, 16#0061#, 16#0062#, 16#006C#,
16#0065#,
others => 16#0000#),
others => <>);
-- "compartmentedShape"
MS_0096 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0072#, 16#0074#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0065#,
16#0064#, 16#0053#, 16#0068#, 16#0061#,
16#0070#, 16#0065#,
others => 16#0000#),
others => <>);
-- "messageSendingClass"
MS_0097 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#006D#, 16#0065#, 16#0073#, 16#0073#,
16#0061#, 16#0067#, 16#0065#, 16#0053#,
16#0065#, 16#006E#, 16#0064#, 16#0069#,
16#006E#, 16#0067#, 16#0043#, 16#006C#,
16#0061#, 16#0073#, 16#0073#,
others => 16#0000#),
others => <>);
-- "http://www.omg.org/spec/UML/20120801/UMLDI"
MS_0098 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 42,
Length => 42,
Value =>
(16#0068#, 16#0074#, 16#0074#, 16#0070#,
16#003A#, 16#002F#, 16#002F#, 16#0077#,
16#0077#, 16#0077#, 16#002E#, 16#006F#,
16#006D#, 16#0067#, 16#002E#, 16#006F#,
16#0072#, 16#0067#, 16#002F#, 16#0073#,
16#0070#, 16#0065#, 16#0063#, 16#002F#,
16#0055#, 16#004D#, 16#004C#, 16#002F#,
16#0032#, 16#0030#, 16#0031#, 16#0032#,
16#0030#, 16#0038#, 16#0030#, 16#0031#,
16#002F#, 16#0055#, 16#004D#, 16#004C#,
16#0044#, 16#0049#,
others => 16#0000#),
others => <>);
-- "A_UMLStereotypePropertyValueLabel_stereotypedElement_labelShowingStereotypeValue"
MS_0099 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 87,
Unused => 80,
Length => 80,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0053#, 16#0074#, 16#0065#,
16#0072#, 16#0065#, 16#006F#, 16#0074#,
16#0079#, 16#0070#, 16#0065#, 16#0050#,
16#0072#, 16#006F#, 16#0070#, 16#0065#,
16#0072#, 16#0074#, 16#0079#, 16#0056#,
16#0061#, 16#006C#, 16#0075#, 16#0065#,
16#004C#, 16#0061#, 16#0062#, 16#0065#,
16#006C#, 16#005F#, 16#0073#, 16#0074#,
16#0065#, 16#0072#, 16#0065#, 16#006F#,
16#0074#, 16#0079#, 16#0070#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#006C#, 16#0061#, 16#0062#,
16#0065#, 16#006C#, 16#0053#, 16#0068#,
16#006F#, 16#0077#, 16#0069#, 16#006E#,
16#0067#, 16#0053#, 16#0074#, 16#0065#,
16#0072#, 16#0065#, 16#006F#, 16#0074#,
16#0079#, 16#0070#, 16#0065#, 16#0056#,
16#0061#, 16#006C#, 16#0075#, 16#0065#,
others => 16#0000#),
others => <>);
-- "The most general class for UML diagram elements that are not rendered as lines."
MS_009A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 87,
Unused => 79,
Length => 79,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0020#, 16#0064#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0020#, 16#0065#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#0074#,
16#0020#, 16#0061#, 16#0072#, 16#0065#,
16#0020#, 16#006E#, 16#006F#, 16#0074#,
16#0020#, 16#0072#, 16#0065#, 16#006E#,
16#0064#, 16#0065#, 16#0072#, 16#0065#,
16#0064#, 16#0020#, 16#0061#, 16#0073#,
16#0020#, 16#006C#, 16#0069#, 16#006E#,
16#0065#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "dashed"
MS_009B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0064#, 16#0061#, 16#0073#, 16#0068#,
16#0065#, 16#0064#,
others => 16#0000#),
others => <>);
-- "Indicates how an Interaction shall be shown."
MS_009C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 44,
Length => 44,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0068#, 16#006F#,
16#0077#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#0049#, 16#006E#, 16#0074#,
16#0065#, 16#0072#, 16#0061#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0020#, 16#0073#, 16#0068#, 16#0061#,
16#006C#, 16#006C#, 16#0020#, 16#0062#,
16#0065#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#006E#, 16#002E#,
others => 16#0000#),
others => <>);
-- "modelElement is a Property of a Stereotype."
MS_009D : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 43,
Length => 43,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#0069#, 16#0073#, 16#0020#,
16#0061#, 16#0020#, 16#0050#, 16#0072#,
16#006F#, 16#0070#, 16#0065#, 16#0072#,
16#0074#, 16#0079#, 16#0020#, 16#006F#,
16#0066#, 16#0020#, 16#0061#, 16#0020#,
16#0053#, 16#0074#, 16#0065#, 16#0072#,
16#0065#, 16#006F#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#002E#,
others => 16#0000#),
others => <>);
-- "isIcon"
MS_009E : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0069#, 16#0073#, 16#0049#, 16#0063#,
16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "Indicates whether properties of Transitions shall be shown graphically."
MS_009F : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 79,
Unused => 71,
Length => 71,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#0074#, 16#0068#, 16#0065#,
16#0072#, 16#0020#, 16#0070#, 16#0072#,
16#006F#, 16#0070#, 16#0065#, 16#0072#,
16#0074#, 16#0069#, 16#0065#, 16#0073#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0054#, 16#0072#, 16#0061#, 16#006E#,
16#0073#, 16#0069#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#0020#,
16#0073#, 16#0068#, 16#0061#, 16#006C#,
16#006C#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0073#, 16#0068#, 16#006F#,
16#0077#, 16#006E#, 16#0020#, 16#0067#,
16#0072#, 16#0061#, 16#0070#, 16#0068#,
16#0069#, 16#0063#, 16#0061#, 16#006C#,
16#006C#, 16#0079#, 16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLStateMachine_modelElement_umlDiagramElement"
MS_00A0 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 48,
Length => 48,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0053#, 16#0074#, 16#0061#,
16#0074#, 16#0065#, 16#004D#, 16#0061#,
16#0063#, 16#0068#, 16#0069#, 16#006E#,
16#0065#, 16#005F#, 16#006D#, 16#006F#,
16#0064#, 16#0065#, 16#006C#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#005F#, 16#0075#,
16#006D#, 16#006C#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "UMLShape"
MS_00A1 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
others => 16#0000#),
others => <>);
-- "constraint"
MS_00A2 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 10,
Length => 10,
Value =>
(16#0063#, 16#006F#, 16#006E#, 16#0073#,
16#0074#, 16#0072#, 16#0061#, 16#0069#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "UMLClassOrCompositeStructureDiagram"
MS_00A3 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 35,
Length => 35,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#004F#, 16#0072#, 16#0043#, 16#006F#,
16#006D#, 16#0070#, 16#006F#, 16#0073#,
16#0069#, 16#0074#, 16#0065#, 16#0053#,
16#0074#, 16#0072#, 16#0075#, 16#0063#,
16#0074#, 16#0075#, 16#0072#, 16#0065#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "Indicates whether UMLShapes for composite States shall contain a small icon distinguishing them from non-composite States."
MS_00A4 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 127,
Unused => 122,
Length => 122,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#0074#, 16#0068#, 16#0065#,
16#0072#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0053#, 16#0068#, 16#0061#,
16#0070#, 16#0065#, 16#0073#, 16#0020#,
16#0066#, 16#006F#, 16#0072#, 16#0020#,
16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#006F#, 16#0073#, 16#0069#, 16#0074#,
16#0065#, 16#0020#, 16#0053#, 16#0074#,
16#0061#, 16#0074#, 16#0065#, 16#0073#,
16#0020#, 16#0073#, 16#0068#, 16#0061#,
16#006C#, 16#006C#, 16#0020#, 16#0063#,
16#006F#, 16#006E#, 16#0074#, 16#0061#,
16#0069#, 16#006E#, 16#0020#, 16#0061#,
16#0020#, 16#0073#, 16#006D#, 16#0061#,
16#006C#, 16#006C#, 16#0020#, 16#0069#,
16#0063#, 16#006F#, 16#006E#, 16#0020#,
16#0064#, 16#0069#, 16#0073#, 16#0074#,
16#0069#, 16#006E#, 16#0067#, 16#0075#,
16#0069#, 16#0073#, 16#0068#, 16#0069#,
16#006E#, 16#0067#, 16#0020#, 16#0074#,
16#0068#, 16#0065#, 16#006D#, 16#0020#,
16#0066#, 16#0072#, 16#006F#, 16#006D#,
16#0020#, 16#006E#, 16#006F#, 16#006E#,
16#002D#, 16#0063#, 16#006F#, 16#006D#,
16#0070#, 16#006F#, 16#0073#, 16#0069#,
16#0074#, 16#0065#, 16#0020#, 16#0053#,
16#0074#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "umldi"
MS_00A5 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0075#, 16#006D#, 16#006C#, 16#0064#,
16#0069#,
others => 16#0000#),
others => <>);
-- "UMLAssociationOrConnectorOrLinkShapeKind"
MS_00A6 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 40,
Length => 40,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0041#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#004F#, 16#0072#,
16#0043#, 16#006F#, 16#006E#, 16#006E#,
16#0065#, 16#0063#, 16#0074#, 16#006F#,
16#0072#, 16#004F#, 16#0072#, 16#004C#,
16#0069#, 16#006E#, 16#006B#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#004B#, 16#0069#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- "modelElement must be a StructuredClassifier or an InstanceSpecification with a classifier that is a StructuredClassifier."
MS_00A7 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 127,
Unused => 121,
Length => 121,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0061#, 16#0020#, 16#0053#,
16#0074#, 16#0072#, 16#0075#, 16#0063#,
16#0074#, 16#0075#, 16#0072#, 16#0065#,
16#0064#, 16#0043#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0069#, 16#0066#,
16#0069#, 16#0065#, 16#0072#, 16#0020#,
16#006F#, 16#0072#, 16#0020#, 16#0061#,
16#006E#, 16#0020#, 16#0049#, 16#006E#,
16#0073#, 16#0074#, 16#0061#, 16#006E#,
16#0063#, 16#0065#, 16#0053#, 16#0070#,
16#0065#, 16#0063#, 16#0069#, 16#0066#,
16#0069#, 16#0063#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#0077#, 16#0069#, 16#0074#, 16#0068#,
16#0020#, 16#0061#, 16#0020#, 16#0063#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0069#, 16#0066#, 16#0069#, 16#0065#,
16#0072#, 16#0020#, 16#0074#, 16#0068#,
16#0061#, 16#0074#, 16#0020#, 16#0069#,
16#0073#, 16#0020#, 16#0061#, 16#0020#,
16#0053#, 16#0074#, 16#0072#, 16#0075#,
16#0063#, 16#0074#, 16#0075#, 16#0072#,
16#0065#, 16#0064#, 16#0043#, 16#006C#,
16#0061#, 16#0073#, 16#0073#, 16#0069#,
16#0066#, 16#0069#, 16#0065#, 16#0072#,
16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLNameLabel_modelElement_umlDiagramElement"
MS_00A8 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#004E#, 16#0061#, 16#006D#,
16#0065#, 16#004C#, 16#0061#, 16#0062#,
16#0065#, 16#006C#, 16#005F#, 16#006D#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#005F#,
16#0075#, 16#006D#, 16#006C#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "A_UMLBehaviorDiagram_modelElement_umlDiagramElement"
MS_00A9 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 51,
Length => 51,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0042#, 16#0065#, 16#0068#,
16#0061#, 16#0076#, 16#0069#, 16#006F#,
16#0072#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#005F#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#005F#, 16#0075#, 16#006D#,
16#006C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "Shows text about MultiplicityElements."
MS_00AA : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 38,
Length => 38,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0074#, 16#0065#,
16#0078#, 16#0074#, 16#0020#, 16#0061#,
16#0062#, 16#006F#, 16#0075#, 16#0074#,
16#0020#, 16#004D#, 16#0075#, 16#006C#,
16#0074#, 16#0069#, 16#0070#, 16#006C#,
16#0069#, 16#0063#, 16#0069#, 16#0074#,
16#0079#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLStateMachineDiagram"
MS_00AB : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0053#,
16#0074#, 16#0061#, 16#0074#, 16#0065#,
16#004D#, 16#0061#, 16#0063#, 16#0068#,
16#0069#, 16#006E#, 16#0065#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "ownedElement"
MS_00AC : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006F#, 16#0077#, 16#006E#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "modelElement_type"
MS_00AD : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#0074#, 16#0079#, 16#0070#,
16#0065#,
others => 16#0000#),
others => <>);
-- "messageName"
MS_00AE : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006D#, 16#0065#, 16#0073#, 16#0073#,
16#0061#, 16#0067#, 16#0065#, 16#004E#,
16#0061#, 16#006D#, 16#0065#,
others => 16#0000#),
others => <>);
-- "umlDiagramElement"
MS_00AF : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0075#, 16#006D#, 16#006C#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "See Subclause 17.9."
MS_00B0 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0053#, 16#0065#, 16#0065#, 16#0020#,
16#0053#, 16#0075#, 16#0062#, 16#0063#,
16#006C#, 16#0061#, 16#0075#, 16#0073#,
16#0065#, 16#0020#, 16#0031#, 16#0037#,
16#002E#, 16#0039#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Indicates how borders shall be rendered on UMLShapes that have an inherited State as modelElement."
MS_00B1 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 103,
Unused => 98,
Length => 98,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0068#, 16#006F#,
16#0077#, 16#0020#, 16#0062#, 16#006F#,
16#0072#, 16#0064#, 16#0065#, 16#0072#,
16#0073#, 16#0020#, 16#0073#, 16#0068#,
16#0061#, 16#006C#, 16#006C#, 16#0020#,
16#0062#, 16#0065#, 16#0020#, 16#0072#,
16#0065#, 16#006E#, 16#0064#, 16#0065#,
16#0072#, 16#0065#, 16#0064#, 16#0020#,
16#006F#, 16#006E#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0053#, 16#0068#,
16#0061#, 16#0070#, 16#0065#, 16#0073#,
16#0020#, 16#0074#, 16#0068#, 16#0061#,
16#0074#, 16#0020#, 16#0068#, 16#0061#,
16#0076#, 16#0065#, 16#0020#, 16#0061#,
16#006E#, 16#0020#, 16#0069#, 16#006E#,
16#0068#, 16#0065#, 16#0072#, 16#0069#,
16#0074#, 16#0065#, 16#0064#, 16#0020#,
16#0053#, 16#0074#, 16#0061#, 16#0074#,
16#0065#, 16#0020#, 16#0061#, 16#0073#,
16#0020#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#002E#,
others => 16#0000#),
others => <>);
-- "oneWay"
MS_00B2 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006F#, 16#006E#, 16#0065#, 16#0057#,
16#0061#, 16#0079#,
others => 16#0000#),
others => <>);
-- "messageReceivingInstance"
MS_00B3 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 24,
Length => 24,
Value =>
(16#006D#, 16#0065#, 16#0073#, 16#0073#,
16#0061#, 16#0067#, 16#0065#, 16#0052#,
16#0065#, 16#0063#, 16#0065#, 16#0069#,
16#0076#, 16#0069#, 16#006E#, 16#0067#,
16#0049#, 16#006E#, 16#0073#, 16#0074#,
16#0061#, 16#006E#, 16#0063#, 16#0065#,
others => 16#0000#),
others => <>);
-- "UMLAssociationEndLabel"
MS_00B4 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 22,
Length => 22,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0041#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0045#, 16#006E#,
16#0064#, 16#004C#, 16#0061#, 16#0062#,
16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "UMLDeploymentDiagram"
MS_00B5 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0044#,
16#0065#, 16#0070#, 16#006C#, 16#006F#,
16#0079#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "Indicates when to show navigability of associations or connectors typed by associations."
MS_00B6 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 95,
Unused => 88,
Length => 88,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#006E#, 16#0020#, 16#0074#,
16#006F#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#0020#, 16#006E#,
16#0061#, 16#0076#, 16#0069#, 16#0067#,
16#0061#, 16#0062#, 16#0069#, 16#006C#,
16#0069#, 16#0074#, 16#0079#, 16#0020#,
16#006F#, 16#0066#, 16#0020#, 16#0061#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#0020#,
16#006F#, 16#0072#, 16#0020#, 16#0063#,
16#006F#, 16#006E#, 16#006E#, 16#0065#,
16#0063#, 16#0074#, 16#006F#, 16#0072#,
16#0073#, 16#0020#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#0064#, 16#0020#,
16#0062#, 16#0079#, 16#0020#, 16#0061#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "For diamond kind and an InstanceSpecification modelElement, exactly one Association classifier of the InstanceSpecification has exactly two memberEnds and exactly two of the UMLEdges linked to the shape have those memberEnds as modelElements."
MS_00B7 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 255,
Unused => 242,
Length => 242,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0064#, 16#0069#, 16#0061#, 16#006D#,
16#006F#, 16#006E#, 16#0064#, 16#0020#,
16#006B#, 16#0069#, 16#006E#, 16#0064#,
16#0020#, 16#0061#, 16#006E#, 16#0064#,
16#0020#, 16#0061#, 16#006E#, 16#0020#,
16#0049#, 16#006E#, 16#0073#, 16#0074#,
16#0061#, 16#006E#, 16#0063#, 16#0065#,
16#0053#, 16#0070#, 16#0065#, 16#0063#,
16#0069#, 16#0066#, 16#0069#, 16#0063#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0020#, 16#006D#, 16#006F#,
16#0064#, 16#0065#, 16#006C#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#002C#, 16#0020#,
16#0065#, 16#0078#, 16#0061#, 16#0063#,
16#0074#, 16#006C#, 16#0079#, 16#0020#,
16#006F#, 16#006E#, 16#0065#, 16#0020#,
16#0041#, 16#0073#, 16#0073#, 16#006F#,
16#0063#, 16#0069#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#0063#, 16#006C#, 16#0061#, 16#0073#,
16#0073#, 16#0069#, 16#0066#, 16#0069#,
16#0065#, 16#0072#, 16#0020#, 16#006F#,
16#0066#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0049#, 16#006E#,
16#0073#, 16#0074#, 16#0061#, 16#006E#,
16#0063#, 16#0065#, 16#0053#, 16#0070#,
16#0065#, 16#0063#, 16#0069#, 16#0066#,
16#0069#, 16#0063#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#0068#, 16#0061#, 16#0073#, 16#0020#,
16#0065#, 16#0078#, 16#0061#, 16#0063#,
16#0074#, 16#006C#, 16#0079#, 16#0020#,
16#0074#, 16#0077#, 16#006F#, 16#0020#,
16#006D#, 16#0065#, 16#006D#, 16#0062#,
16#0065#, 16#0072#, 16#0045#, 16#006E#,
16#0064#, 16#0073#, 16#0020#, 16#0061#,
16#006E#, 16#0064#, 16#0020#, 16#0065#,
16#0078#, 16#0061#, 16#0063#, 16#0074#,
16#006C#, 16#0079#, 16#0020#, 16#0074#,
16#0077#, 16#006F#, 16#0020#, 16#006F#,
16#0066#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0045#, 16#0064#, 16#0067#,
16#0065#, 16#0073#, 16#0020#, 16#006C#,
16#0069#, 16#006E#, 16#006B#, 16#0065#,
16#0064#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0074#, 16#0068#, 16#0065#,
16#0020#, 16#0073#, 16#0068#, 16#0061#,
16#0070#, 16#0065#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0074#, 16#0068#, 16#006F#, 16#0073#,
16#0065#, 16#0020#, 16#006D#, 16#0065#,
16#006D#, 16#0062#, 16#0065#, 16#0072#,
16#0045#, 16#006E#, 16#0064#, 16#0073#,
16#0020#, 16#0061#, 16#0073#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Shows an Activity and its elements. Also see Annex A."
MS_00B8 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 54,
Length => 54,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#0076#, 16#0069#, 16#0074#,
16#0079#, 16#0020#, 16#0061#, 16#006E#,
16#0064#, 16#0020#, 16#0069#, 16#0074#,
16#0073#, 16#0020#, 16#0065#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0073#, 16#002E#, 16#0020#,
16#0020#, 16#0041#, 16#006C#, 16#0073#,
16#006F#, 16#0020#, 16#0073#, 16#0065#,
16#0065#, 16#0020#, 16#0041#, 16#006E#,
16#006E#, 16#0065#, 16#0078#, 16#0020#,
16#0041#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLPackageDiagrams must have no modelElement."
MS_00B9 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0050#,
16#0061#, 16#0063#, 16#006B#, 16#0061#,
16#0067#, 16#0065#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0073#, 16#0020#, 16#006D#,
16#0075#, 16#0073#, 16#0074#, 16#0020#,
16#0068#, 16#0061#, 16#0076#, 16#0065#,
16#0020#, 16#006E#, 16#006F#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "isb_mult"
MS_00BA : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0069#, 16#0073#, 16#0062#, 16#005F#,
16#006D#, 16#0075#, 16#006C#, 16#0074#,
others => 16#0000#),
others => <>);
-- "A_UMLStateShape_modelElement_umlDiagramElement"
MS_00BB : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 46,
Length => 46,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0053#, 16#0074#, 16#0061#,
16#0074#, 16#0065#, 16#0053#, 16#0068#,
16#0061#, 16#0070#, 16#0065#, 16#005F#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#0075#, 16#006D#, 16#006C#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "modelElement"
MS_00BC : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 12,
Length => 12,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "never"
MS_00BD : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#006E#, 16#0065#, 16#0076#, 16#0065#,
16#0072#,
others => 16#0000#),
others => <>);
-- "modelElement must be an Association, Connector, or InstanceSpecification with an Association classifier."
MS_00BE : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 111,
Unused => 104,
Length => 104,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0061#, 16#006E#, 16#0020#,
16#0041#, 16#0073#, 16#0073#, 16#006F#,
16#0063#, 16#0069#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#002C#,
16#0020#, 16#0043#, 16#006F#, 16#006E#,
16#006E#, 16#0065#, 16#0063#, 16#0074#,
16#006F#, 16#0072#, 16#002C#, 16#0020#,
16#006F#, 16#0072#, 16#0020#, 16#0049#,
16#006E#, 16#0073#, 16#0074#, 16#0061#,
16#006E#, 16#0063#, 16#0065#, 16#0053#,
16#0070#, 16#0065#, 16#0063#, 16#0069#,
16#0066#, 16#0069#, 16#0063#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0020#, 16#0077#, 16#0069#, 16#0074#,
16#0068#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#0041#, 16#0073#, 16#0073#,
16#006F#, 16#0063#, 16#0069#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0069#, 16#0066#,
16#0069#, 16#0065#, 16#0072#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLCompartment"
MS_00BF : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 14,
Length => 14,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006F#, 16#006D#, 16#0070#, 16#0061#,
16#0072#, 16#0074#, 16#006D#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "The most general class for UMLDiagrams depicting behavioral elements."
MS_00C0 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 69,
Length => 69,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0073#, 16#0020#, 16#0064#,
16#0065#, 16#0070#, 16#0069#, 16#0063#,
16#0074#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0062#, 16#0065#, 16#0068#,
16#0061#, 16#0076#, 16#0069#, 16#006F#,
16#0072#, 16#0061#, 16#006C#, 16#0020#,
16#0065#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "UMLNavigabilityNotationKind"
MS_00C1 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 27,
Length => 27,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004E#,
16#0061#, 16#0076#, 16#0069#, 16#0067#,
16#0061#, 16#0062#, 16#0069#, 16#006C#,
16#0069#, 16#0074#, 16#0079#, 16#004E#,
16#006F#, 16#0074#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#004B#,
16#0069#, 16#006E#, 16#0064#,
others => 16#0000#),
others => <>);
-- "true"
MS_00C2 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#0074#, 16#0072#, 16#0075#, 16#0065#,
others => 16#0000#),
others => <>);
-- "Element to which a Stereotype having the modelElement (Property) is applied."
MS_00C3 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 79,
Unused => 76,
Length => 76,
Value =>
(16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0020#,
16#0074#, 16#006F#, 16#0020#, 16#0077#,
16#0068#, 16#0069#, 16#0063#, 16#0068#,
16#0020#, 16#0061#, 16#0020#, 16#0053#,
16#0074#, 16#0065#, 16#0072#, 16#0065#,
16#006F#, 16#0074#, 16#0079#, 16#0070#,
16#0065#, 16#0020#, 16#0068#, 16#0061#,
16#0076#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0074#, 16#0068#, 16#0065#,
16#0020#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0020#, 16#0028#, 16#0050#,
16#0072#, 16#006F#, 16#0070#, 16#0065#,
16#0072#, 16#0074#, 16#0079#, 16#0029#,
16#0020#, 16#0069#, 16#0073#, 16#0020#,
16#0061#, 16#0070#, 16#0070#, 16#006C#,
16#0069#, 16#0065#, 16#0064#, 16#002E#,
others => 16#0000#),
others => <>);
-- "modelElement_mult"
MS_00C4 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#006D#, 16#0075#, 16#006C#,
16#0074#,
others => 16#0000#),
others => <>);
-- "modelElement must be an Association end."
MS_00C5 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 40,
Length => 40,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0061#, 16#006E#, 16#0020#,
16#0041#, 16#0073#, 16#0073#, 16#006F#,
16#0063#, 16#0069#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#0065#, 16#006E#, 16#0064#, 16#002E#,
others => 16#0000#),
others => <>);
-- "returnValue"
MS_00C6 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0072#, 16#0065#, 16#0074#, 16#0075#,
16#0072#, 16#006E#, 16#0056#, 16#0061#,
16#006C#, 16#0075#, 16#0065#,
others => 16#0000#),
others => <>);
-- "Indicates whether dot notation for associations shall be used."
MS_00C7 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 62,
Length => 62,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#0074#, 16#0068#, 16#0065#,
16#0072#, 16#0020#, 16#0064#, 16#006F#,
16#0074#, 16#0020#, 16#006E#, 16#006F#,
16#0074#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0061#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#0020#,
16#0073#, 16#0068#, 16#0061#, 16#006C#,
16#006C#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0075#, 16#0073#, 16#0065#,
16#0064#, 16#002E#,
others => 16#0000#),
others => <>);
-- "compartment"
MS_00C8 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#0063#, 16#006F#, 16#006D#, 16#0070#,
16#0061#, 16#0072#, 16#0074#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "A_UMLCompartmentableShape_compartmentedShape_shape"
MS_00C9 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 50,
Length => 50,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0043#, 16#006F#, 16#006D#,
16#0070#, 16#0061#, 16#0072#, 16#0074#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0061#, 16#0062#, 16#006C#, 16#0065#,
16#0053#, 16#0068#, 16#0061#, 16#0070#,
16#0065#, 16#005F#, 16#0063#, 16#006F#,
16#006D#, 16#0070#, 16#0061#, 16#0072#,
16#0074#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#0065#, 16#0064#, 16#0053#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#005F#, 16#0073#, 16#0068#, 16#0061#,
16#0070#, 16#0065#,
others => 16#0000#),
others => <>);
-- "UMLTypedElementLabel"
MS_00CA : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0054#,
16#0079#, 16#0070#, 16#0065#, 16#0064#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#004C#,
16#0061#, 16#0062#, 16#0065#, 16#006C#,
others => 16#0000#),
others => <>);
-- "org.omg.xmi.nsPrefix"
MS_00CB : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#006F#, 16#0072#, 16#0067#, 16#002E#,
16#006F#, 16#006D#, 16#0067#, 16#002E#,
16#0078#, 16#006D#, 16#0069#, 16#002E#,
16#006E#, 16#0073#, 16#0050#, 16#0072#,
16#0065#, 16#0066#, 16#0069#, 16#0078#,
others => 16#0000#),
others => <>);
-- "Restricts owned styles to UMLStyles."
MS_00CC : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 36,
Length => 36,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#006F#, 16#0077#,
16#006E#, 16#0065#, 16#0064#, 16#0020#,
16#0073#, 16#0074#, 16#0079#, 16#006C#,
16#0065#, 16#0073#, 16#0020#, 16#0074#,
16#006F#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0053#, 16#0074#, 16#0079#,
16#006C#, 16#0065#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Indicates when diagram frames shall be shown."
MS_00CD : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0049#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0077#, 16#0068#,
16#0065#, 16#006E#, 16#0020#, 16#0064#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0020#, 16#0066#,
16#0072#, 16#0061#, 16#006D#, 16#0065#,
16#0073#, 16#0020#, 16#0073#, 16#0068#,
16#0061#, 16#006C#, 16#006C#, 16#0020#,
16#0062#, 16#0065#, 16#0020#, 16#0073#,
16#0068#, 16#006F#, 16#0077#, 16#006E#,
16#002E#,
others => 16#0000#),
others => <>);
-- "UMLEdge"
MS_00CE : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0045#,
16#0064#, 16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "A_UMLInteractionDiagram_modelElement_umlDiagramElement"
MS_00CF : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 54,
Length => 54,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0049#, 16#006E#, 16#0074#,
16#0065#, 16#0072#, 16#0061#, 16#0063#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#005F#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#0075#, 16#006D#, 16#006C#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "source"
MS_00D0 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0073#, 16#006F#, 16#0075#, 16#0072#,
16#0063#, 16#0065#,
others => 16#0000#),
others => <>);
-- "For modelElements that have an option to be shown with shapes other than rectangles, such as Actors, or with other identifying shapes inside them, such as arrows distinguishing InputPins and OutputPins, or edges that have an option to be shown with lines other than solid with open arrow heads, such as Realization. A value of true for isIcon indicates the alternative notation shall be shown."
MS_00D1 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 407,
Unused => 394,
Length => 394,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0061#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#0061#, 16#006E#, 16#0020#, 16#006F#,
16#0070#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0062#, 16#0065#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#006E#, 16#0020#, 16#0077#, 16#0069#,
16#0074#, 16#0068#, 16#0020#, 16#0073#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#0073#, 16#0020#, 16#006F#, 16#0074#,
16#0068#, 16#0065#, 16#0072#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#006E#,
16#0020#, 16#0072#, 16#0065#, 16#0063#,
16#0074#, 16#0061#, 16#006E#, 16#0067#,
16#006C#, 16#0065#, 16#0073#, 16#002C#,
16#0020#, 16#0073#, 16#0075#, 16#0063#,
16#0068#, 16#0020#, 16#0061#, 16#0073#,
16#0020#, 16#0041#, 16#0063#, 16#0074#,
16#006F#, 16#0072#, 16#0073#, 16#002C#,
16#0020#, 16#006F#, 16#0072#, 16#0020#,
16#0077#, 16#0069#, 16#0074#, 16#0068#,
16#0020#, 16#006F#, 16#0074#, 16#0068#,
16#0065#, 16#0072#, 16#0020#, 16#0069#,
16#0064#, 16#0065#, 16#006E#, 16#0074#,
16#0069#, 16#0066#, 16#0079#, 16#0069#,
16#006E#, 16#0067#, 16#0020#, 16#0073#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#0073#, 16#0020#, 16#0069#, 16#006E#,
16#0073#, 16#0069#, 16#0064#, 16#0065#,
16#0020#, 16#0074#, 16#0068#, 16#0065#,
16#006D#, 16#002C#, 16#0020#, 16#0073#,
16#0075#, 16#0063#, 16#0068#, 16#0020#,
16#0061#, 16#0073#, 16#0020#, 16#0061#,
16#0072#, 16#0072#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0064#, 16#0069#,
16#0073#, 16#0074#, 16#0069#, 16#006E#,
16#0067#, 16#0075#, 16#0069#, 16#0073#,
16#0068#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0049#, 16#006E#, 16#0070#,
16#0075#, 16#0074#, 16#0050#, 16#0069#,
16#006E#, 16#0073#, 16#0020#, 16#0061#,
16#006E#, 16#0064#, 16#0020#, 16#004F#,
16#0075#, 16#0074#, 16#0070#, 16#0075#,
16#0074#, 16#0050#, 16#0069#, 16#006E#,
16#0073#, 16#002C#, 16#0020#, 16#006F#,
16#0072#, 16#0020#, 16#0065#, 16#0064#,
16#0067#, 16#0065#, 16#0073#, 16#0020#,
16#0074#, 16#0068#, 16#0061#, 16#0074#,
16#0020#, 16#0068#, 16#0061#, 16#0076#,
16#0065#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#006F#, 16#0070#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#0074#, 16#006F#, 16#0020#, 16#0062#,
16#0065#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#006E#, 16#0020#,
16#0077#, 16#0069#, 16#0074#, 16#0068#,
16#0020#, 16#006C#, 16#0069#, 16#006E#,
16#0065#, 16#0073#, 16#0020#, 16#006F#,
16#0074#, 16#0068#, 16#0065#, 16#0072#,
16#0020#, 16#0074#, 16#0068#, 16#0061#,
16#006E#, 16#0020#, 16#0073#, 16#006F#,
16#006C#, 16#0069#, 16#0064#, 16#0020#,
16#0077#, 16#0069#, 16#0074#, 16#0068#,
16#0020#, 16#006F#, 16#0070#, 16#0065#,
16#006E#, 16#0020#, 16#0061#, 16#0072#,
16#0072#, 16#006F#, 16#0077#, 16#0020#,
16#0068#, 16#0065#, 16#0061#, 16#0064#,
16#0073#, 16#002C#, 16#0020#, 16#0073#,
16#0075#, 16#0063#, 16#0068#, 16#0020#,
16#0061#, 16#0073#, 16#0020#, 16#0052#,
16#0065#, 16#0061#, 16#006C#, 16#0069#,
16#007A#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#002E#, 16#0020#,
16#0020#, 16#0041#, 16#0020#, 16#0076#,
16#0061#, 16#006C#, 16#0075#, 16#0065#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0074#, 16#0072#, 16#0075#, 16#0065#,
16#0020#, 16#0066#, 16#006F#, 16#0072#,
16#0020#, 16#0069#, 16#0073#, 16#0049#,
16#0063#, 16#006F#, 16#006E#, 16#0020#,
16#0069#, 16#006E#, 16#0064#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0065#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0061#, 16#006C#,
16#0074#, 16#0065#, 16#0072#, 16#006E#,
16#0061#, 16#0074#, 16#0069#, 16#0076#,
16#0065#, 16#0020#, 16#006E#, 16#006F#,
16#0074#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0020#, 16#0073#,
16#0068#, 16#0061#, 16#006C#, 16#006C#,
16#0020#, 16#0062#, 16#0065#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#006E#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLUseCaseDiagram"
MS_00D2 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0055#,
16#0073#, 16#0065#, 16#0043#, 16#0061#,
16#0073#, 16#0065#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#,
others => 16#0000#),
others => <>);
-- "isDoubleSided"
MS_00D3 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0069#, 16#0073#, 16#0044#, 16#006F#,
16#0075#, 16#0062#, 16#006C#, 16#0065#,
16#0053#, 16#0069#, 16#0064#, 16#0065#,
16#0064#,
others => 16#0000#),
others => <>);
-- "styledElement"
MS_00D4 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0073#, 16#0074#, 16#0079#, 16#006C#,
16#0065#, 16#0064#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "UMLObjectDiagrams must have no modelElement."
MS_00D5 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 44,
Length => 44,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#004F#,
16#0062#, 16#006A#, 16#0065#, 16#0063#,
16#0074#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0073#, 16#0020#, 16#006D#, 16#0075#,
16#0073#, 16#0074#, 16#0020#, 16#0068#,
16#0061#, 16#0076#, 16#0065#, 16#0020#,
16#006E#, 16#006F#, 16#0020#, 16#006D#,
16#006F#, 16#0064#, 16#0065#, 16#006C#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#002E#,
others => 16#0000#),
others => <>);
-- "parameter"
MS_00D6 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0070#, 16#0061#, 16#0072#, 16#0061#,
16#006D#, 16#0065#, 16#0074#, 16#0065#,
16#0072#,
others => 16#0000#),
others => <>);
-- "UMLClassifierShape"
MS_00D7 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006C#, 16#0061#, 16#0073#, 16#0073#,
16#0069#, 16#0066#, 16#0069#, 16#0065#,
16#0072#, 16#0053#, 16#0068#, 16#0061#,
16#0070#, 16#0065#,
others => 16#0000#),
others => <>);
-- "Restricts the targets of UMLEdges to UMLDiagramElements."
MS_00D8 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 56,
Length => 56,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0074#, 16#0061#,
16#0072#, 16#0067#, 16#0065#, 16#0074#,
16#0073#, 16#0020#, 16#006F#, 16#0066#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0045#, 16#0064#, 16#0067#, 16#0065#,
16#0073#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0055#, 16#004D#, 16#004C#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "A_UMLMultiplicityElement_modelElement_umlDiagramElement"
MS_00D9 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 63,
Unused => 55,
Length => 55,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#004D#, 16#0075#, 16#006C#,
16#0074#, 16#0069#, 16#0070#, 16#006C#,
16#0069#, 16#0063#, 16#0069#, 16#0074#,
16#0079#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#005F#, 16#006D#, 16#006F#, 16#0064#,
16#0065#, 16#006C#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#005F#, 16#0075#, 16#006D#,
16#006C#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "target"
MS_00DA : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#0074#, 16#0061#, 16#0072#, 16#0067#,
16#0065#, 16#0074#,
others => 16#0000#),
others => <>);
-- "For showing text about Slots, InstanceSpecifications, InstanceValues, or elements with a type, such as TypedElements or Connectors."
MS_00DB : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 135,
Unused => 131,
Length => 131,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0074#, 16#0065#, 16#0078#, 16#0074#,
16#0020#, 16#0061#, 16#0062#, 16#006F#,
16#0075#, 16#0074#, 16#0020#, 16#0053#,
16#006C#, 16#006F#, 16#0074#, 16#0073#,
16#002C#, 16#0020#, 16#0049#, 16#006E#,
16#0073#, 16#0074#, 16#0061#, 16#006E#,
16#0063#, 16#0065#, 16#0053#, 16#0070#,
16#0065#, 16#0063#, 16#0069#, 16#0066#,
16#0069#, 16#0063#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0073#,
16#002C#, 16#0020#, 16#0049#, 16#006E#,
16#0073#, 16#0074#, 16#0061#, 16#006E#,
16#0063#, 16#0065#, 16#0056#, 16#0061#,
16#006C#, 16#0075#, 16#0065#, 16#0073#,
16#002C#, 16#0020#, 16#006F#, 16#0072#,
16#0020#, 16#0065#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0073#, 16#0020#, 16#0077#, 16#0069#,
16#0074#, 16#0068#, 16#0020#, 16#0061#,
16#0020#, 16#0074#, 16#0079#, 16#0070#,
16#0065#, 16#002C#, 16#0020#, 16#0073#,
16#0075#, 16#0063#, 16#0068#, 16#0020#,
16#0061#, 16#0073#, 16#0020#, 16#0054#,
16#0079#, 16#0070#, 16#0065#, 16#0064#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#, 16#0073#,
16#0020#, 16#006F#, 16#0072#, 16#0020#,
16#0043#, 16#006F#, 16#006E#, 16#006E#,
16#0065#, 16#0063#, 16#0074#, 16#006F#,
16#0072#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "UMLStateShape"
MS_00DC : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0053#,
16#0074#, 16#0061#, 16#0074#, 16#0065#,
16#0053#, 16#0068#, 16#0061#, 16#0070#,
16#0065#,
others => 16#0000#),
others => <>);
-- "modelElement must be a Slot, InstanceSpecification, InstanceValue, or an element with a type, such as a TypedElement or Connector."
MS_00DD : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 135,
Unused => 130,
Length => 130,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0062#, 16#0065#,
16#0020#, 16#0061#, 16#0020#, 16#0053#,
16#006C#, 16#006F#, 16#0074#, 16#002C#,
16#0020#, 16#0049#, 16#006E#, 16#0073#,
16#0074#, 16#0061#, 16#006E#, 16#0063#,
16#0065#, 16#0053#, 16#0070#, 16#0065#,
16#0063#, 16#0069#, 16#0066#, 16#0069#,
16#0063#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#002C#, 16#0020#,
16#0049#, 16#006E#, 16#0073#, 16#0074#,
16#0061#, 16#006E#, 16#0063#, 16#0065#,
16#0056#, 16#0061#, 16#006C#, 16#0075#,
16#0065#, 16#002C#, 16#0020#, 16#006F#,
16#0072#, 16#0020#, 16#0061#, 16#006E#,
16#0020#, 16#0065#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#0077#, 16#0069#, 16#0074#,
16#0068#, 16#0020#, 16#0061#, 16#0020#,
16#0074#, 16#0079#, 16#0070#, 16#0065#,
16#002C#, 16#0020#, 16#0073#, 16#0075#,
16#0063#, 16#0068#, 16#0020#, 16#0061#,
16#0073#, 16#0020#, 16#0061#, 16#0020#,
16#0054#, 16#0079#, 16#0070#, 16#0065#,
16#0064#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#0020#, 16#006F#, 16#0072#, 16#0020#,
16#0043#, 16#006F#, 16#006E#, 16#006E#,
16#0065#, 16#0063#, 16#0074#, 16#006F#,
16#0072#, 16#002E#,
others => 16#0000#),
others => <>);
-- "stereotypedElement"
MS_00DE : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0073#, 16#0074#, 16#0065#, 16#0072#,
16#0065#, 16#006F#, 16#0074#, 16#0079#,
16#0070#, 16#0065#, 16#0064#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "UMLDiagramElement"
MS_00DF : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#, 16#0045#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
-- "edge_association"
MS_00E0 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 16,
Length => 16,
Value =>
(16#0065#, 16#0064#, 16#0067#, 16#0065#,
16#005F#, 16#0061#, 16#0073#, 16#0073#,
16#006F#, 16#0063#, 16#0069#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
others => 16#0000#),
others => <>);
-- "Restricts UMLRedefinesLabels to be notation for RedefinableElements."
MS_00E1 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 68,
Length => 68,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0052#, 16#0065#, 16#0064#,
16#0065#, 16#0066#, 16#0069#, 16#006E#,
16#0065#, 16#0073#, 16#004C#, 16#0061#,
16#0062#, 16#0065#, 16#006C#, 16#0073#,
16#0020#, 16#0074#, 16#006F#, 16#0020#,
16#0062#, 16#0065#, 16#0020#, 16#006E#,
16#006F#, 16#0074#, 16#0061#, 16#0074#,
16#0069#, 16#006F#, 16#006E#, 16#0020#,
16#0066#, 16#006F#, 16#0072#, 16#0020#,
16#0052#, 16#0065#, 16#0064#, 16#0065#,
16#0066#, 16#0069#, 16#006E#, 16#0061#,
16#0062#, 16#006C#, 16#0065#, 16#0045#,
16#006C#, 16#0065#, 16#006D#, 16#0065#,
16#006E#, 16#0074#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "Restricts UMLBehaviorDiagrams to showing Behaviors."
MS_00E2 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 51,
Length => 51,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0042#, 16#0065#, 16#0068#,
16#0061#, 16#0076#, 16#0069#, 16#006F#,
16#0072#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0073#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0073#, 16#0068#, 16#006F#,
16#0077#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#0042#, 16#0065#, 16#0068#,
16#0061#, 16#0076#, 16#0069#, 16#006F#,
16#0072#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "weakOrder"
MS_00E3 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 9,
Length => 9,
Value =>
(16#0077#, 16#0065#, 16#0061#, 16#006B#,
16#004F#, 16#0072#, 16#0064#, 16#0065#,
16#0072#,
others => 16#0000#),
others => <>);
-- "For showing the keywords of the modelElement."
MS_00E4 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0046#, 16#006F#, 16#0072#, 16#0020#,
16#0073#, 16#0068#, 16#006F#, 16#0077#,
16#0069#, 16#006E#, 16#0067#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#006B#, 16#0065#, 16#0079#, 16#0077#,
16#006F#, 16#0072#, 16#0064#, 16#0073#,
16#0020#, 16#006F#, 16#0066#, 16#0020#,
16#0074#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "lifelineClass"
MS_00E5 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#006C#, 16#0069#, 16#0066#, 16#0065#,
16#006C#, 16#0069#, 16#006E#, 16#0065#,
16#0043#, 16#006C#, 16#0061#, 16#0073#,
16#0073#,
others => 16#0000#),
others => <>);
-- "inheritedStateBorder must have a value if the diagram shows any inherited states."
MS_00E6 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 87,
Unused => 81,
Length => 81,
Value =>
(16#0069#, 16#006E#, 16#0068#, 16#0065#,
16#0072#, 16#0069#, 16#0074#, 16#0065#,
16#0064#, 16#0053#, 16#0074#, 16#0061#,
16#0074#, 16#0065#, 16#0042#, 16#006F#,
16#0072#, 16#0064#, 16#0065#, 16#0072#,
16#0020#, 16#006D#, 16#0075#, 16#0073#,
16#0074#, 16#0020#, 16#0068#, 16#0061#,
16#0076#, 16#0065#, 16#0020#, 16#0061#,
16#0020#, 16#0076#, 16#0061#, 16#006C#,
16#0075#, 16#0065#, 16#0020#, 16#0069#,
16#0066#, 16#0020#, 16#0074#, 16#0068#,
16#0065#, 16#0020#, 16#0064#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0020#, 16#0073#, 16#0068#,
16#006F#, 16#0077#, 16#0073#, 16#0020#,
16#0061#, 16#006E#, 16#0079#, 16#0020#,
16#0069#, 16#006E#, 16#0068#, 16#0065#,
16#0072#, 16#0069#, 16#0074#, 16#0065#,
16#0064#, 16#0020#, 16#0073#, 16#0074#,
16#0061#, 16#0074#, 16#0065#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "Shows shapes for binary relationships."
MS_00E7 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 38,
Length => 38,
Value =>
(16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#0073#, 16#0020#, 16#0073#, 16#0068#,
16#0061#, 16#0070#, 16#0065#, 16#0073#,
16#0020#, 16#0066#, 16#006F#, 16#0072#,
16#0020#, 16#0062#, 16#0069#, 16#006E#,
16#0061#, 16#0072#, 16#0079#, 16#0020#,
16#0072#, 16#0065#, 16#006C#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0073#, 16#0068#, 16#0069#, 16#0070#,
16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "communication"
MS_00E8 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0063#, 16#006F#, 16#006D#, 16#006D#,
16#0075#, 16#006E#, 16#0069#, 16#0063#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#,
others => 16#0000#),
others => <>);
-- "UMLComponentDiagram"
MS_00E9 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0043#,
16#006F#, 16#006D#, 16#0070#, 16#006F#,
16#006E#, 16#0065#, 16#006E#, 16#0074#,
16#0044#, 16#0069#, 16#0061#, 16#0067#,
16#0072#, 16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "UMLActivityDiagram"
MS_00EA : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 18,
Length => 18,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0041#,
16#0063#, 16#0074#, 16#0069#, 16#0076#,
16#0069#, 16#0074#, 16#0079#, 16#0044#,
16#0069#, 16#0061#, 16#0067#, 16#0072#,
16#0061#, 16#006D#,
others => 16#0000#),
others => <>);
-- "The most general class for UML shapes that are rendered only as text."
MS_00EB : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 71,
Unused => 69,
Length => 69,
Value =>
(16#0054#, 16#0068#, 16#0065#, 16#0020#,
16#006D#, 16#006F#, 16#0073#, 16#0074#,
16#0020#, 16#0067#, 16#0065#, 16#006E#,
16#0065#, 16#0072#, 16#0061#, 16#006C#,
16#0020#, 16#0063#, 16#006C#, 16#0061#,
16#0073#, 16#0073#, 16#0020#, 16#0066#,
16#006F#, 16#0072#, 16#0020#, 16#0055#,
16#004D#, 16#004C#, 16#0020#, 16#0073#,
16#0068#, 16#0061#, 16#0070#, 16#0065#,
16#0073#, 16#0020#, 16#0074#, 16#0068#,
16#0061#, 16#0074#, 16#0020#, 16#0061#,
16#0072#, 16#0065#, 16#0020#, 16#0072#,
16#0065#, 16#006E#, 16#0064#, 16#0065#,
16#0072#, 16#0065#, 16#0064#, 16#0020#,
16#006F#, 16#006E#, 16#006C#, 16#0079#,
16#0020#, 16#0061#, 16#0073#, 16#0020#,
16#0074#, 16#0065#, 16#0078#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "isFrame"
MS_00EC : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0069#, 16#0073#, 16#0046#, 16#0072#,
16#0061#, 16#006D#, 16#0065#,
others => 16#0000#),
others => <>);
-- "modeElement"
MS_00ED : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 11,
Length => 11,
Value =>
(16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#0045#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "UMLStyle"
MS_00EE : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0053#,
16#0074#, 16#0079#, 16#006C#, 16#0065#,
others => 16#0000#),
others => <>);
-- "fontsize_positive"
MS_00EF : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0066#, 16#006F#, 16#006E#, 16#0074#,
16#0073#, 16#0069#, 16#007A#, 16#0065#,
16#005F#, 16#0070#, 16#006F#, 16#0073#,
16#0069#, 16#0074#, 16#0069#, 16#0076#,
16#0065#,
others => 16#0000#),
others => <>);
-- "UMLProfileDiagrams must have no modelElement."
MS_00F0 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0050#,
16#0072#, 16#006F#, 16#0066#, 16#0069#,
16#006C#, 16#0065#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#, 16#0073#, 16#0020#, 16#006D#,
16#0075#, 16#0073#, 16#0074#, 16#0020#,
16#0068#, 16#0061#, 16#0076#, 16#0065#,
16#0020#, 16#006E#, 16#006F#, 16#0020#,
16#006D#, 16#006F#, 16#0064#, 16#0065#,
16#006C#, 16#0045#, 16#006C#, 16#0065#,
16#006D#, 16#0065#, 16#006E#, 16#0074#,
16#002E#,
others => 16#0000#),
others => <>);
-- "isAssociationDotShown"
MS_00F1 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 21,
Length => 21,
Value =>
(16#0069#, 16#0073#, 16#0041#, 16#0073#,
16#0073#, 16#006F#, 16#0063#, 16#0069#,
16#0061#, 16#0074#, 16#0069#, 16#006F#,
16#006E#, 16#0044#, 16#006F#, 16#0074#,
16#0053#, 16#0068#, 16#006F#, 16#0077#,
16#006E#,
others => 16#0000#),
others => <>);
-- "A_UMLEdge_source_sourceEdge"
MS_00F2 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 31,
Unused => 27,
Length => 27,
Value =>
(16#0041#, 16#005F#, 16#0055#, 16#004D#,
16#004C#, 16#0045#, 16#0064#, 16#0067#,
16#0065#, 16#005F#, 16#0073#, 16#006F#,
16#0075#, 16#0072#, 16#0063#, 16#0065#,
16#005F#, 16#0073#, 16#006F#, 16#0075#,
16#0072#, 16#0063#, 16#0065#, 16#0045#,
16#0064#, 16#0067#, 16#0065#,
others => 16#0000#),
others => <>);
-- "Restricts UMLActivityDiagrams to show Activities."
MS_00F3 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 55,
Unused => 49,
Length => 49,
Value =>
(16#0052#, 16#0065#, 16#0073#, 16#0074#,
16#0072#, 16#0069#, 16#0063#, 16#0074#,
16#0073#, 16#0020#, 16#0055#, 16#004D#,
16#004C#, 16#0041#, 16#0063#, 16#0074#,
16#0069#, 16#0076#, 16#0069#, 16#0074#,
16#0079#, 16#0044#, 16#0069#, 16#0061#,
16#0067#, 16#0072#, 16#0061#, 16#006D#,
16#0073#, 16#0020#, 16#0074#, 16#006F#,
16#0020#, 16#0073#, 16#0068#, 16#006F#,
16#0077#, 16#0020#, 16#0041#, 16#0063#,
16#0074#, 16#0069#, 16#0076#, 16#0069#,
16#0074#, 16#0069#, 16#0065#, 16#0073#,
16#002E#,
others => 16#0000#),
others => <>);
-- "UMLProfileDiagram"
MS_00F4 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#0055#, 16#004D#, 16#004C#, 16#0050#,
16#0072#, 16#006F#, 16#0066#, 16#0069#,
16#006C#, 16#0065#, 16#0044#, 16#0069#,
16#0061#, 16#0067#, 16#0072#, 16#0061#,
16#006D#,
others => 16#0000#),
others => <>);
-- "Always show navigibility or non-navigability."
MS_00F5 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 47,
Unused => 45,
Length => 45,
Value =>
(16#0041#, 16#006C#, 16#0077#, 16#0061#,
16#0079#, 16#0073#, 16#0020#, 16#0073#,
16#0068#, 16#006F#, 16#0077#, 16#0020#,
16#006E#, 16#0061#, 16#0076#, 16#0069#,
16#0067#, 16#0069#, 16#0062#, 16#0069#,
16#006C#, 16#0069#, 16#0074#, 16#0079#,
16#0020#, 16#006F#, 16#0072#, 16#0020#,
16#006E#, 16#006F#, 16#006E#, 16#002D#,
16#006E#, 16#0061#, 16#0076#, 16#0069#,
16#0067#, 16#0061#, 16#0062#, 16#0069#,
16#006C#, 16#0069#, 16#0074#, 16#0079#,
16#002E#,
others => 16#0000#),
others => <>);
-- "Alternatives for showing navigibility or non-navigability of associations and connectors typed associations."
MS_00F6 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 111,
Unused => 108,
Length => 108,
Value =>
(16#0041#, 16#006C#, 16#0074#, 16#0065#,
16#0072#, 16#006E#, 16#0061#, 16#0074#,
16#0069#, 16#0076#, 16#0065#, 16#0073#,
16#0020#, 16#0066#, 16#006F#, 16#0072#,
16#0020#, 16#0073#, 16#0068#, 16#006F#,
16#0077#, 16#0069#, 16#006E#, 16#0067#,
16#0020#, 16#006E#, 16#0061#, 16#0076#,
16#0069#, 16#0067#, 16#0069#, 16#0062#,
16#0069#, 16#006C#, 16#0069#, 16#0074#,
16#0079#, 16#0020#, 16#006F#, 16#0072#,
16#0020#, 16#006E#, 16#006F#, 16#006E#,
16#002D#, 16#006E#, 16#0061#, 16#0076#,
16#0069#, 16#0067#, 16#0061#, 16#0062#,
16#0069#, 16#006C#, 16#0069#, 16#0074#,
16#0079#, 16#0020#, 16#006F#, 16#0066#,
16#0020#, 16#0061#, 16#0073#, 16#0073#,
16#006F#, 16#0063#, 16#0069#, 16#0061#,
16#0074#, 16#0069#, 16#006F#, 16#006E#,
16#0073#, 16#0020#, 16#0061#, 16#006E#,
16#0064#, 16#0020#, 16#0063#, 16#006F#,
16#006E#, 16#006E#, 16#0065#, 16#0063#,
16#0074#, 16#006F#, 16#0072#, 16#0073#,
16#0020#, 16#0074#, 16#0079#, 16#0070#,
16#0065#, 16#0064#, 16#0020#, 16#0061#,
16#0073#, 16#0073#, 16#006F#, 16#0063#,
16#0069#, 16#0061#, 16#0074#, 16#0069#,
16#006F#, 16#006E#, 16#0073#, 16#002E#,
others => 16#0000#),
others => <>);
-- "owningCompartment"
MS_00F7 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 17,
Length => 17,
Value =>
(16#006F#, 16#0077#, 16#006E#, 16#0069#,
16#006E#, 16#0067#, 16#0043#, 16#006F#,
16#006D#, 16#0070#, 16#0061#, 16#0072#,
16#0074#, 16#006D#, 16#0065#, 16#006E#,
16#0074#,
others => 16#0000#),
others => <>);
end AMF.Internals.Tables.UMLDI_String_Data_00;
|
with
AdaM.Environment;
procedure AdaM.parse (File : in String;
Into : in out AdaM.Environment.item);
|
package body Ada.Containers.Unbounded_Synchronized_Queues is
use type Implementation.Node_Access;
protected body Queue is
-- overriding
entry Enqueue (New_Item : Queue_Interfaces.Element_Type) when True is
New_Node : constant Implementation.Node_Access :=
new Implementation.Node'(
Element => New_Item,
Next => null);
begin
if First = null then
First := New_Node;
else
Last.Next := New_Node;
end if;
Last := New_Node;
Current_Length := Current_Length + 1;
if Current_Length > Peak_Length then
Peak_Length := Current_Length;
end if;
end Enqueue;
-- overriding
entry Dequeue (Element : out Queue_Interfaces.Element_Type)
when First /= null is
begin
Element := First.Element;
First := First.Next;
if First = null then
Last := null;
end if;
Current_Length := Current_Length - 1;
end Dequeue;
-- overriding
function Current_Use return Count_Type is
begin
return Current_Length;
end Current_Use;
-- overriding
function Peak_Use return Count_Type is
begin
return Peak_Length;
end Peak_Use;
end Queue;
end Ada.Containers.Unbounded_Synchronized_Queues;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . F L O A T _ I O --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-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. --
-- --
------------------------------------------------------------------------------
package body System.Dim.Float_IO is
package Num_Dim_Float_IO is new Ada.Text_IO.Float_IO (Num_Dim_Float);
---------
-- Put --
---------
procedure Put
(File : File_Type;
Item : Num_Dim_Float;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "")
is
begin
Num_Dim_Float_IO.Put (File, Item, Fore, Aft, Exp);
Ada.Text_IO.Put (File, Symbol);
end Put;
procedure Put
(Item : Num_Dim_Float;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "")
is
begin
Num_Dim_Float_IO.Put (Item, Fore, Aft, Exp);
Ada.Text_IO.Put (Symbol);
end Put;
procedure Put
(To : out String;
Item : Num_Dim_Float;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "")
is
Ptr : constant Natural := Symbol'Length;
begin
Num_Dim_Float_IO.Put (To (To'First .. To'Last - Ptr), Item, Aft, Exp);
To (To'Last - Ptr + 1 .. To'Last) := Symbol;
end Put;
----------------
-- Put_Dim_Of --
----------------
pragma Warnings (Off);
-- kill warnings on unreferenced formals
procedure Put_Dim_Of
(File : File_Type;
Item : Num_Dim_Float;
Symbol : String := "")
is
begin
Ada.Text_IO.Put (File, Symbol);
end Put_Dim_Of;
procedure Put_Dim_Of
(Item : Num_Dim_Float;
Symbol : String := "")
is
begin
Ada.Text_IO.Put (Symbol);
end Put_Dim_Of;
procedure Put_Dim_Of
(To : out String;
Item : Num_Dim_Float;
Symbol : String := "")
is
begin
To (1 .. Symbol'Length) := Symbol;
end Put_Dim_Of;
-----------
-- Image --
-----------
function Image
(Item : Num_Dim_Float;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "") return String
is
Buffer : String (1 .. 50);
begin
Put (Buffer, Item, Aft, Exp);
for I in Buffer'Range loop
if Buffer (I) /= ' ' then
return Buffer (I .. Buffer'Last) & Symbol;
end if;
end loop;
end Image;
end System.Dim.Float_IO;
|
--//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila (laurent@sfml-dev.org)
-- This software is provided 'as-is', without any express or implied warranty.
-- In no event will the authors be held liable for any damages arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it freely,
-- subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented;
-- you must not claim that you wrote the original software.
-- If you use this software in a product, an acknowledgment
-- in the product documentation would be appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such,
-- and must not be misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
with Interfaces.C; use Interfaces.C;
package Sf.System.Vector3 is
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--/ @brief 3-component vector of floats
--/
--//////////////////////////////////////////////////////////
type sfVector3f is record
x : aliased float;
y : aliased float;
z : aliased float;
end record;
pragma Convention (C_Pass_By_Copy, sfVector3f);
end Sf.System.Vector3;
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with System;
with SDL_SDL_stdinc_h;
package SDL_SDL_thread_h is
-- skipped empty struct SDL_Thread
function SDL_CreateThread (fn : access function (arg1 : System.Address) return int; data : System.Address) return System.Address; -- ../include/SDL/SDL_thread.h:88
pragma Import (C, SDL_CreateThread, "SDL_CreateThread");
function SDL_ThreadID return SDL_SDL_stdinc_h.Uint32; -- ../include/SDL/SDL_thread.h:92
pragma Import (C, SDL_ThreadID, "SDL_ThreadID");
function SDL_GetThreadID (thread : System.Address) return SDL_SDL_stdinc_h.Uint32; -- ../include/SDL/SDL_thread.h:97
pragma Import (C, SDL_GetThreadID, "SDL_GetThreadID");
procedure SDL_WaitThread (thread : System.Address; status : access int); -- ../include/SDL/SDL_thread.h:103
pragma Import (C, SDL_WaitThread, "SDL_WaitThread");
procedure SDL_KillThread (thread : System.Address); -- ../include/SDL/SDL_thread.h:106
pragma Import (C, SDL_KillThread, "SDL_KillThread");
end SDL_SDL_thread_h;
|
-----------------------------------------------------------------------
-- util-commands-consoles-text -- Text console interface
-- Copyright (C) 2014, 2017, 2018 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.Text_IO;
generic
package Util.Commands.Consoles.Text is
type Console_Type is new Util.Commands.Consoles.Console_Type with private;
-- Report an error message.
overriding
procedure Error (Console : in out Console_Type;
Message : in String);
-- Report a notice message.
overriding
procedure Notice (Console : in out Console_Type;
Kind : in Notice_Type;
Message : in String);
-- Print the field value for the given field.
overriding
procedure Print_Field (Console : in out Console_Type;
Field : in Field_Type;
Value : in String;
Justify : in Justify_Type := J_LEFT);
-- Print the title for the given field.
overriding
procedure Print_Title (Console : in out Console_Type;
Field : in Field_Type;
Title : in String);
-- Start a new title in a report.
overriding
procedure Start_Title (Console : in out Console_Type);
-- Finish a new title in a report.
procedure End_Title (Console : in out Console_Type);
-- Start a new row in a report.
overriding
procedure Start_Row (Console : in out Console_Type);
-- Finish a new row in a report.
overriding
procedure End_Row (Console : in out Console_Type);
private
type Console_Type is new Util.Commands.Consoles.Console_Type with record
File : Ada.Text_IO.File_Type;
end record;
end Util.Commands.Consoles.Text;
|
-- Copyright 2014-2019 Simon Symeonidis (psyomn)
--
-- 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.Text_IO; use Ada.Text_IO;
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Agen; use Agen;
with Argument_Stack;
package body Actions.Init is
procedure Help is
begin
Put_Line(" (new|init)");
Put_Line(" project <name> - create a project from a basic template");
Put_Line(" gpr <name> - create a GPR from a basic template");
end Help;
function Try_Act return Boolean is
begin
if Argument_Stack.Is_Empty then goto Fail; end if;
declare
Action : constant String := Argument_Stack.Pop;
begin
if To_Upper(Action) /= "NEW" and To_Upper(Action) /= "INIT" then
goto Fail;
end if;
end;
if Argument_Stack.Is_Empty then
Put_Line(Standard_Error, "Error: No target was specified");
goto Fail;
end if;
declare
Target : constant String := Argument_Stack.Pop;
begin
if To_Upper(Target) = "PROJECT" then
if Argument_Stack.Is_Empty then
Put_Line(Standard_Error, "Error: No name was specifed");
goto Fail;
end if;
Agen.Create_Project(Argument_Stack.Pop);
return True;
elsif To_Upper(Target) = "GPR" then
if Argument_Stack.Is_Empty then
Put_Line(Standard_Error, "Error: No name was specified");
goto Fail;
end if;
Agen.Create_GPR(Argument_Stack.Pop);
return True;
else
Put_Line(Standard_Error, "Error: """ & Target & """ was not an understood target");
goto Fail;
end if;
end;
<<Fail>>
Argument_Stack.Reset;
return False;
end Try_Act;
end Actions.Init;
|
-- AoC 2020, Day 10
with Ada.Text_IO;
with Ada.Containers.Ordered_Maps;
package body Day is
package TIO renames Ada.Text_IO;
function load_file(filename : in String) return Adaptors.Vector is
package Natural_Text_IO is new Ada.Text_IO.Integer_IO(Natural);
package Adaptor_Sorter is new Adaptors.Generic_Sorting;
file : TIO.File_Type;
v : Adaptors.Vector := Empty_Vector;
n : Natural := 0;
begin
TIO.open(File => file, Mode => TIO.In_File, Name => filename);
while not TIO.end_of_file(file) loop
Natural_Text_IO.get(file, n);
v.append(n);
end loop;
TIO.close(file);
Adaptor_Sorter.sort(Container => v);
return v;
end load_file;
function mult_diffs(v : in Adaptors.Vector) return Natural is
diff_1 : Natural := 0;
diff_3 : Natural := 0;
curr : Natural;
last : Natural := v.first_element;
begin
for idx in v.first_index+1 .. v.last_index loop
curr := v(idx);
case curr - last is
when 3 => diff_3 := diff_3 + 1;
when 1 => diff_1 := diff_1 + 1;
when others => null;
end case;
last := curr;
end loop;
return diff_1 * diff_3;
end mult_diffs;
function mult_1_3_differences(v : in Adaptors.Vector) return Natural is
remaining : Adaptors.Vector := v;
begin
remaining.prepend(0);
remaining.append(remaining.last_element + 3);
return mult_diffs(remaining);
end mult_1_3_differences;
package Reachable_Map is new Ada.Containers.Ordered_Maps
(Element_Type => Long_Integer,
Key_Type => Natural);
use Reachable_Map;
reach_map : Reachable_Map.Map := Empty_Map;
function count(curr_idx : in Natural; v : in Adaptors.Vector) return Long_Integer is
curr_value : constant Natural := v(curr_idx);
total : Long_Integer := 0;
last_idx : constant Natural := Natural'Min(curr_idx+3, v.last_index);
begin
if contains(reach_map, curr_value) then
return reach_map(curr_value);
end if;
for next_idx in curr_idx+1..last_idx loop
if v(next_idx) + 3 >= curr_value then
total := total + count(next_idx, v);
end if;
end loop;
reach_map.insert(curr_value, total);
return total;
end count;
function total_arrangments(v : in Adaptors.Vector) return Long_Integer is
v_first_last : Adaptors.Vector := v;
begin
v_first_last.prepend(0);
v_first_last.append(v_first_last.last_element + 3);
reverse_elements(v_first_last);
clear(reach_map);
reach_map.insert(0, 1);
return count(v_first_last.first_index, v_first_last);
end total_arrangments;
end Day;
|
-- Copyright ©2022 Steve Merrony
-- 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.Containers; use Ada.Containers;
with Ada.Containers.Vectors;
with Ada.Streams.Stream_IO; use Ada.Streams.Stream_IO;
with Ada.Unchecked_Conversion;
with Interfaces; use Interfaces;
package Xmodem is
type Packet_Size is (Short, Long);
for Packet_Size use (Short => 128, Long => 1024);
package Char_Vectors is new Ada.Containers.Vectors (Index_Type => Natural, Element_Type => Character);
use Char_Vectors;
task type Receiver is
entry Start (RX_Stream : Stream_Access);
entry Accept_Data (Char : in Character);
entry Done;
-- entry Stop;
end Receiver;
type Receiver_Acc is access Receiver;
Receiver_Task : Receiver_Acc;
procedure Receive (Filename : in String; Trace_Flag : in Boolean);
task type Sender is
entry Start (TX_Stream : in Stream_Access; Pkt_Len : in Packet_Size);
entry Accept_Data (Char : in Character);
entry Done;
end Sender;
type Sender_Acc is access Sender;
Sender_Task : Sender_Acc;
procedure Send (Filename : in String; Pkt_Len : in Packet_Size; Trace_Flag : in Boolean);
Already_Exists,
File_Does_Not_Exist,
File_Access_Error,
Protocol_Error,
Sender_Cancelled,
Timeout,
Too_Many_Retries : exception;
private
function Char_To_U8 is new Ada.Unchecked_Conversion(Character, Unsigned_8);
function Byte_To_Char is new Ada.Unchecked_Conversion(Unsigned_8, Character);
function CRC_16 (Data : in Vector) return Unsigned_16;
-- Calculate the CRC-16 value of the provided block of data
function CRC_16_Fixed_Len (Data : in Vector; FL : in Positive) return Unsigned_16;
-- Calculate the CRC-16 Constant for the provided block of data
procedure Send_Block (Data : in out Vector; Block_Num : in Natural; Block_Size : in Packet_Size);
Tracing : Boolean;
end Xmodem; |
with UxAS.Comms.Transport.Socket_Configurations;
use UxAS.Comms.Transport.Socket_Configurations;
with ZMQ.Sockets;
package UxAS.Comms.Transport.ZeroMQ_Socket_Configurations is
type ZeroMq_Socket_Configuration is new Socket_Configuration with record
Zmq_Socket_Type : ZMQ.Sockets.Socket_Type;
Is_Server_Bind : Boolean;
Receive_High_Water_Mark : Int32;
Send_High_Water_Mark : Int32;
Number_Of_IO_Threads : Positive;
end record;
function Make -- a convenience routine
(Network_Name : String;
Socket_Address : String;
Is_Receive : Boolean;
Zmq_Socket_Type : ZMQ.Sockets.Socket_Type;
Number_Of_IO_Threads : Positive;
Is_Server_Bind : Boolean;
Receive_High_Water_Mark : Int32;
Send_High_Water_Mark : Int32)
return ZeroMq_Socket_Configuration
with Pre'Class =>
Network_Name'Length in 1 .. Max_Network_Name_Length and then
Socket_Address'Length in 1 .. Max_Socket_Address_Length;
end UxAS.Comms.Transport.ZeroMQ_Socket_Configurations;
|
Function INI.Section_to_Map( Object : in Instance;
Section: in String:= ""
) return NSO.Types.String_Map.Map is
Use NSO.Types.String_Map;
Begin
Return Result : Map do
For Item in Object(Section).Iterate loop
Declare
Key : String renames KEY_VALUE_MAP.Key( Item );
Value : Value_Object renames KEY_Value_MAP.Element(Item);
Image : Constant String := --renames "ABS"(Value);
(if Value.Kind = vt_String then Value.String_Value
else ABS Value);
Begin
Result.Include(
Key => Key,
New_Item => Image
);
End;
end loop;
Exception
when CONSTRAINT_ERROR => null;
End return;
End INI.Section_to_Map;
|
--
-- Copyright 2021 (C) Jeremy Grosser <jeremy@synack.me>
--
-- SPDX-License-Identifier: BSD-3-Clause
--
with HAL.Real_Time_Clock;
with HAL.I2C;
with HAL;
package DS3231 is
Default_Address : constant HAL.I2C.I2C_Address := 2#1101000#;
type DS3231_Device
(I2C_Port : not null HAL.I2C.Any_I2C_Port;
I2C_Address : HAL.I2C.I2C_Address)
is limited new HAL.Real_Time_Clock.RTC_Device with private;
overriding
procedure Set
(This : in out DS3231_Device;
Time : HAL.Real_Time_Clock.RTC_Time;
Date : HAL.Real_Time_Clock.RTC_Date);
overriding
procedure Get
(This : in out DS3231_Device;
Time : out HAL.Real_Time_Clock.RTC_Time;
Date : out HAL.Real_Time_Clock.RTC_Date);
overriding
function Get_Time
(This : DS3231_Device)
return HAL.Real_Time_Clock.RTC_Time;
overriding
function Get_Date
(This : DS3231_Device)
return HAL.Real_Time_Clock.RTC_Date;
-- Raised if any I2C error occurs
DS3231_Error : exception;
private
type DS3231_Device
(I2C_Port : not null HAL.I2C.Any_I2C_Port;
I2C_Address : HAL.I2C.I2C_Address)
is limited new HAL.Real_Time_Clock.RTC_Device with null record;
subtype All_Registers is HAL.UInt8_Array (16#00# .. 16#12#);
procedure Read_All
(This : DS3231_Device;
Val : out All_Registers);
function To_Integer
(BCD : HAL.UInt8)
return Integer;
function To_BCD
(N : Integer)
return HAL.UInt8;
end DS3231;
|
-- This file is generated by SWIG. Please do *not* modify by hand.
--
with gmp_c.Pointers;
with Interfaces.C;
package gmp_c.pointer_Pointers is
-- mp_limb_t_Pointer_Pointer
--
type mp_limb_t_Pointer_Pointer is
access all gmp_c.Pointers.mp_limb_t_Pointer;
-- mp_limb_signed_t_Pointer_Pointer
--
type mp_limb_signed_t_Pointer_Pointer is
access all gmp_c.Pointers.mp_limb_signed_t_Pointer;
-- mp_bitcnt_t_Pointer_Pointer
--
type mp_bitcnt_t_Pointer_Pointer is
access all gmp_c.Pointers.mp_bitcnt_t_Pointer;
-- mp_size_t_Pointer_Pointer
--
type mp_size_t_Pointer_Pointer is
access all gmp_c.Pointers.mp_size_t_Pointer;
-- mp_exp_t_Pointer_Pointer
--
type mp_exp_t_Pointer_Pointer is access all gmp_c.Pointers.mp_exp_t_Pointer;
-- gmp_randalg_t_Pointer_Pointer
--
type gmp_randalg_t_Pointer_Pointer is
access all gmp_c.Pointers.gmp_randalg_t_Pointer;
-- anonymous_enum_1_Pointer_Pointer
--
type anonymous_enum_1_Pointer_Pointer is
access all gmp_c.Pointers.anonymous_enum_1_Pointer;
end gmp_c.pointer_Pointers;
|
--PRÁCTICA 4: César Borao Moratinos (chat_server_2)
with Handlers;
with Ada.Text_IO;
with Ada.Calendar;
with Chat_Messages;
with Ordered_Maps_G;
with Chat_Procedures;
with Lower_Layer_UDP;
with Ada.Command_Line;
with Ada.Strings.Unbounded;
procedure Chat_Server_2 is
package ATI renames Ada.Text_IO;
package CM renames Chat_Messages;
package CP renames Chat_Procedures;
package LLU renames Lower_Layer_UDP;
package ACL renames Ada.Command_Line;
package ASU renames Ada.Strings.Unbounded;
use type CM.Message_Type;
use type Ada.Calendar.Time;
Port: Integer;
Server_EP: LLU.End_Point_Type;
Request: Character;
begin
--Binding
Port := Integer'Value(ACL.Argument(1));
Server_EP := LLU.Build (LLU.To_IP(LLU.Get_Host_Name), Port);
if ACL.Argument_Count = 2 and CP.Max_Valid(Natural'Value(ACL.Argument(2))) then
loop
--Server Handler
LLU.Bind(Server_EP, Handlers.Server_Handler'Access);
loop
ATI.Get_Immediate(Request);
ATI.Put_Line(Character'Image(Request));
case Request is
when 'o'|'O' =>
CP.Print_Old_Map;
when 'l'|'L' =>
CP.Print_Active_Map;
when others =>
ATI.Put_Line("Not implemented");
end case;
end loop;
end loop;
else
ATI.New_Line;
ATI.Put_Line("Server Usage: [Port] <Max_Clients (2-50)>");
ATI.New_Line;
end if;
LLU.finalize;
end Chat_Server_2;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>xfExtractPixels_1_1_0_s</name>
<ret_bitwidth>8</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_read1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>v.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>3408860784</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_2">
<Value>
<Obj>
<type>0</type>
<id>2</id>
<name>p_read</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_utility.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>xfExtractPixels&lt;1, 1, 0&gt;</contextFuncName>
<contextNormFuncName>xfExtractPixels_1_1_0_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_utility.hpp</first>
<second>xfExtractPixels&lt;1, 1, 0&gt;</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>6</item>
<item>7</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>3</id>
<name>_ln69</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_utility.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>xfExtractPixels&lt;1, 1, 0&gt;</contextFuncName>
<contextNormFuncName>xfExtractPixels_1_1_0_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_utility.hpp</first>
<second>xfExtractPixels&lt;1, 1, 0&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>3410481808</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</consts>
<blocks class_id="16" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="17" tracking_level="1" version="0" object_id="_4">
<Obj>
<type>3</type>
<id>4</id>
<name>xfExtractPixels<1, 1, 0></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
</node_objs>
</item>
</blocks>
<edges class_id="18" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="19" tracking_level="1" version="0" object_id="_5">
<id>7</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>2</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="19" object_id="_6">
<id>8</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>3</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="20" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="21" tracking_level="1" version="0" object_id="_7">
<mId>1</mId>
<mTag>xfExtractPixels<1, 1, 0></mTag>
<mNormTag>xfExtractPixels_1_1_0_s</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="25" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="0" version="0">
<first>2</first>
<second class_id="27" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>3</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="28" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="29" tracking_level="0" version="0">
<first>4</first>
<second class_id="30" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="31" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="1" version="0" object_id="_8">
<region_name>xfExtractPixels<1, 1, 0></region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>1</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core>
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-- Adobe Experience Manager (AEM) API
-- Swagger AEM is an OpenAPI specification for Adobe Experience Manager (AEM) API
-- ------------ EDIT NOTE ------------
-- This file was generated with openapi-generator. You can modify it to implement
-- the server. After you modify this file, you should add the following line
-- to the .openapi-generator-ignore file:
--
-- src/-servers.ads
--
-- Then, you can drop this edit note comment.
-- ------------ EDIT NOTE ------------
with Swagger.Servers;
with .Models;
with .Skeletons;
package .Servers is
use .Models;
type Server_Type is limited new .Skeletons.Server_Type with null record;
--
overriding
procedure Get_Aem_Product_Info
(Server : in out Server_Type
;
Result : out Swagger.UString_Vectors.Vector;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Config_Mgr
(Server : in out Server_Type
;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Bundle
(Server : in out Server_Type;
Name : in Swagger.UString;
Action : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Jmx_Repository
(Server : in out Server_Type;
Action : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Saml_Configuration
(Server : in out Server_Type;
Post : in Swagger.Nullable_Boolean;
Apply : in Swagger.Nullable_Boolean;
Delete : in Swagger.Nullable_Boolean;
Action : in Swagger.Nullable_UString;
Dollarlocation : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Service_Periodranking : in Swagger.Nullable_Integer;
Idp_Url : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Assertion_Consumer_Service_U_R_L : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Key_Store_Password : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
User_I_D_Attribute : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Create_User : in Swagger.Nullable_Boolean;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Name_Id_Format : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Handle_Logout : in Swagger.Nullable_Boolean;
Logout_Url : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Digest_Method : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
Propertylist : in Swagger.UString_Vectors.Vector;
Result : out .Models.SamlConfigurationInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Login_Page
(Server : in out Server_Type
;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Cq_Actions
(Server : in out Server_Type;
Authorizable_Id : in Swagger.UString;
Changelog : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Crxde_Status
(Server : in out Server_Type
;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Install_Status
(Server : in out Server_Type
;
Result : out .Models.InstallStatus_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Package_Manager_Servlet
(Server : in out Server_Type
;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Package_Service
(Server : in out Server_Type;
Cmd : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Package_Service_Json
(Server : in out Server_Type;
Path : in Swagger.UString;
Cmd : in Swagger.UString;
Group_Name : in Swagger.Nullable_UString;
Package_Name : in Swagger.Nullable_UString;
Package_Version : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Force : in Swagger.Nullable_Boolean;
Recursive : in Swagger.Nullable_Boolean;
P_Package : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Package_Update
(Server : in out Server_Type;
Group_Name : in Swagger.UString;
Package_Name : in Swagger.UString;
Version : in Swagger.UString;
Path : in Swagger.UString;
Filter : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Set_Password
(Server : in out Server_Type;
Old : in Swagger.UString;
Plain : in Swagger.UString;
Verify : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Aem_Health_Check
(Server : in out Server_Type;
Tags : in Swagger.Nullable_UString;
Combine_Tags_Or : in Swagger.Nullable_Boolean;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Aem_Health_Check_Servlet
(Server : in out Server_Type;
Bundles_Periodignored : in Swagger.UString_Vectors.Vector;
Bundles_Periodignored_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Aem_Password_Reset
(Server : in out Server_Type;
Pwdreset_Periodauthorizables : in Swagger.UString_Vectors.Vector;
Pwdreset_Periodauthorizables_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Delete_Agent
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Delete_Node
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Agent
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Agents
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Authorizable_Keystore
(Server : in out Server_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out .Models.KeystoreInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Keystore
(Server : in out Server_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Node
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Package
(Server : in out Server_Type;
Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Package_Filter
(Server : in out Server_Type;
Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Query
(Server : in out Server_Type;
Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
1_Property : in Swagger.UString;
1_Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Truststore
(Server : in out Server_Type
;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Get_Truststore_Info
(Server : in out Server_Type
;
Result : out .Models.TruststoreInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Agent
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString;
Jcr_Content_Slashcq_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashcq_Distribute_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Name : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Template : in Swagger.Nullable_UString;
Jcr_Content_Slashenabled : in Swagger.Nullable_Boolean;
Jcr_Content_Slashjcr_Description : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified_By : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Mixin_Types : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Title : in Swagger.Nullable_UString;
Jcr_Content_Slashlog_Level : in Swagger.Nullable_UString;
Jcr_Content_Slashno_Status_Update : in Swagger.Nullable_Boolean;
Jcr_Content_Slashno_Versioning : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Connect_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_H_T_T_P_Connection_Closed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_H_T_T_P_Expired : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_H_T_T_P_Headers : in Swagger.UString_Vectors.Vector;
Jcr_Content_Slashprotocol_H_T_T_P_Headers_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_H_T_T_P_Method : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_H_T_T_P_S_Relaxed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Interface : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_Socket_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_Version : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_N_T_L_M_Domain : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_N_T_L_M_Host : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Host : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Port : in Swagger.Number;
Jcr_Content_Slashproxy_User : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Max_Size : in Swagger.Number;
Jcr_Content_Slashqueue_Batch_Mode : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Wait_Time : in Swagger.Number;
Jcr_Content_Slashretry_Delay : in Swagger.Nullable_UString;
Jcr_Content_Slashreverse_Replication : in Swagger.Nullable_Boolean;
Jcr_Content_Slashserialization_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashsling_Resource_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashssl : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_N_T_L_M_Domain : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_N_T_L_M_Host : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Uri : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_User : in Swagger.Nullable_UString;
Jcr_Content_Slashtrigger_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Modified : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_On_Off_Time : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Receive : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Specific : in Swagger.Nullable_Boolean;
Jcr_Content_Slashuser_Id : in Swagger.Nullable_UString;
Jcr_Primary_Type : in Swagger.Nullable_UString;
Operation : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Authorizable_Keystore
(Server : in out Server_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Current_Password : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Password : in Swagger.Nullable_UString;
Key_Store_Pass : in Swagger.Nullable_UString;
Alias : in Swagger.Nullable_UString;
New_Alias : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Cert_Chain : in Swagger.File_Part_Type;
Pk : in Swagger.File_Part_Type;
Key_Store : in Swagger.File_Part_Type;
Result : out .Models.KeystoreInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Authorizables
(Server : in out Server_Type;
Authorizable_Id : in Swagger.UString;
Intermediate_Path : in Swagger.UString;
Create_User : in Swagger.Nullable_UString;
Create_Group : in Swagger.Nullable_UString;
Rep_Password : in Swagger.Nullable_UString;
Profile_Slashgiven_Name : in Swagger.Nullable_UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Adobe_Granite_Saml_Authentication_Handler
(Server : in out Server_Type;
Key_Store_Password : in Swagger.Nullable_UString;
Key_Store_Password_At_Type_Hint : in Swagger.Nullable_UString;
Service_Periodranking : in Swagger.Nullable_Integer;
Service_Periodranking_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Idp_Http_Redirect_At_Type_Hint : in Swagger.Nullable_UString;
Create_User : in Swagger.Nullable_Boolean;
Create_User_At_Type_Hint : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
Default_Redirect_Url_At_Type_Hint : in Swagger.Nullable_UString;
User_I_D_Attribute : in Swagger.Nullable_UString;
User_I_D_Attribute_At_Type_Hint : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Default_Groups_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Cert_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Add_Group_Memberships_At_Type_Hint : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Path_At_Type_Hint : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Synchronize_Attributes_At_Type_Hint : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Clock_Tolerance_At_Type_Hint : in Swagger.Nullable_UString;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Group_Membership_Attribute_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Url : in Swagger.Nullable_UString;
Idp_Url_At_Type_Hint : in Swagger.Nullable_UString;
Logout_Url : in Swagger.Nullable_UString;
Logout_Url_At_Type_Hint : in Swagger.Nullable_UString;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Service_Provider_Entity_Id_At_Type_Hint : in Swagger.Nullable_UString;
Assertion_Consumer_Service_U_R_L : in Swagger.Nullable_UString;
Assertion_Consumer_Service_U_R_L_At_Type_Hint : in Swagger.Nullable_UString;
Handle_Logout : in Swagger.Nullable_Boolean;
Handle_Logout_At_Type_Hint : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Sp_Private_Key_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Use_Encryption_At_Type_Hint : in Swagger.Nullable_UString;
Name_Id_Format : in Swagger.Nullable_UString;
Name_Id_Format_At_Type_Hint : in Swagger.Nullable_UString;
Digest_Method : in Swagger.Nullable_UString;
Digest_Method_At_Type_Hint : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
Signature_Method_At_Type_Hint : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
User_Intermediate_Path_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Apache_Felix_Jetty_Based_Http_Service
(Server : in out Server_Type;
Org_Periodapache_Periodfelix_Periodhttps_Periodnio : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodnio_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Apache_Http_Components_Proxy_Configuration
(Server : in out Server_Type;
Proxy_Periodhost : in Swagger.Nullable_UString;
Proxy_Periodhost_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodport : in Swagger.Nullable_Integer;
Proxy_Periodport_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodexceptions : in Swagger.UString_Vectors.Vector;
Proxy_Periodexceptions_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodenabled : in Swagger.Nullable_Boolean;
Proxy_Periodenabled_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Perioduser : in Swagger.Nullable_UString;
Proxy_Perioduser_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodpassword : in Swagger.Nullable_UString;
Proxy_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Apache_Sling_Dav_Ex_Servlet
(Server : in out Server_Type;
Alias : in Swagger.Nullable_UString;
Alias_At_Type_Hint : in Swagger.Nullable_UString;
Dav_Periodcreate_Absolute_Uri : in Swagger.Nullable_Boolean;
Dav_Periodcreate_Absolute_Uri_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Apache_Sling_Get_Servlet
(Server : in out Server_Type;
Json_Periodmaximumresults : in Swagger.Nullable_UString;
Json_Periodmaximumresults_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodhtml : in Swagger.Nullable_Boolean;
Enable_Periodhtml_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodtxt : in Swagger.Nullable_Boolean;
Enable_Periodtxt_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodxml : in Swagger.Nullable_Boolean;
Enable_Periodxml_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Config_Apache_Sling_Referrer_Filter
(Server : in out Server_Type;
Allow_Periodempty : in Swagger.Nullable_Boolean;
Allow_Periodempty_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts : in Swagger.Nullable_UString;
Allow_Periodhosts_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp_At_Type_Hint : in Swagger.Nullable_UString;
Filter_Periodmethods : in Swagger.Nullable_UString;
Filter_Periodmethods_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Node
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Delete_Authorizable : in Swagger.Nullable_UString;
File : in Swagger.File_Part_Type;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Node_Rw
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Add_Members : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Path
(Server : in out Server_Type;
Path : in Swagger.UString;
Jcr_Primary_Type : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Query
(Server : in out Server_Type;
Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
1_Property : in Swagger.UString;
1_Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Tree_Activation
(Server : in out Server_Type;
Ignoredeactivated : in Boolean;
Onlymodified : in Boolean;
Path : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Truststore
(Server : in out Server_Type;
Operation : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Store_Type : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Certificate : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
overriding
procedure Post_Truststore_P_K_C_S12
(Server : in out Server_Type;
Truststore_Periodp12 : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
package Server_Impl is
new .Skeletons.Shared_Instance (Server_Type);
end .Servers;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.