bigcode/the-stack-smol-xl · Datasets at Hugging Face

4d60dbf5e158f7324ab9993dbae6ab7eca23e434

13,922

adb

Ada

src/latin_utils/latin_utils-dictionary_package-part_entry_io.adb

Alex-Vasile/whitakers-words

9fa16606d97842746fea0379839f40c959c53d56

[ "FTL" ]

204

2015-06-12T21:22:55.000Z

2022-03-28T10:50:16.000Z

src/latin_utils/latin_utils-dictionary_package-part_entry_io.adb

Alex-Vasile/whitakers-words

9fa16606d97842746fea0379839f40c959c53d56

[ "FTL" ]

98

2015-06-15T22:17:04.000Z

2021-10-01T18:17:55.000Z

src/latin_utils/latin_utils-dictionary_package-part_entry_io.adb

Alex-Vasile/whitakers-words

9fa16606d97842746fea0379839f40c959c53d56

[ "FTL" ]

50

2015-06-16T22:42:24.000Z

2021-12-29T16:53:08.000Z

-- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired) -- -- Copyright William A. Whitaker (1936–2010) -- -- This is a free program, which means it is proper to copy it and pass -- it on to your friends. Consider it a developmental item for which -- there is no charge. However, just for form, it is Copyrighted -- (c). Permission is hereby freely given for any and all use of program -- and data. You can sell it as your own, but at least tell me. -- -- This version is distributed without obligation, but the developer -- would appreciate comments and suggestions. -- -- All parts of the WORDS system, source code and data files, are made freely -- available to anyone who wishes to use them, for whatever purpose. separate (Latin_Utils.Dictionary_Package) package body Part_Entry_IO is --------------------------------------------------------------------------- use type Ada.Text_IO.Positive_Count; --------------------------------------------------------------------------- procedure Get (File : in Ada.Text_IO.File_Type; Item : out Part_Entry) is POFS : Part_Of_Speech_Type := X; Starting_Col : constant Ada.Text_IO.Positive_Count := Ada.Text_IO.Col (File); Spacer : Character; pragma Unreferenced (Spacer); -------------------------------------------------------------------------- Noun : Noun_Entry; Pronoun : Pronoun_Entry; Propack : Propack_Entry; Adjective : Adjective_Entry; Numeral : Numeral_Entry; Adverb : Adverb_Entry; Verb : Verb_Entry; Preposition : Preposition_Entry; Conjunction : Conjunction_Entry; Interjection : Interjection_Entry; -------------------------------------------------------------------------- begin Part_Of_Speech_Type_IO.Get (File, POFS); Ada.Text_IO.Get (File, Spacer); case POFS is when N => Noun_Entry_IO.Get (File, Noun); Item := (N, Noun); when Pron => Pronoun_Entry_IO.Get (File, Pronoun); Item := (Pron, Pronoun); when Pack => Propack_Entry_IO.Get (File, Propack); Item := (Pack, Propack); when Adj => Adjective_Entry_IO.Get (File, Adjective); Item := (Adj, Adjective); when Num => Numeral_Entry_IO.Get (File, Numeral); Item := (Num, Numeral); when Adv => Adverb_Entry_IO.Get (File, Adverb); Item := (Adv, Adverb); when V => Verb_Entry_IO.Get (File, Verb); Item := (V, Verb); when Vpar => null; -- No VAPR entry when Supine => null; -- No SUPINE entry when Prep => Preposition_Entry_IO.Get (File, Preposition); Item := (Prep, Preposition); when Conj => Conjunction_Entry_IO.Get (File, Conjunction); Item := (Conj, Conjunction); when Interj => Interjection_Entry_IO.Get (File, Interjection); Item := (Interj, Interjection); when Prefix => Item := (Pofs => Prefix); when Suffix => Item := (Pofs => Suffix); when Tackon => Item := (Pofs => Tackon); when X => Item := (Pofs => X); end case; Ada.Text_IO.Set_Col (File, Ada.Text_IO.Positive_Count (Part_Entry_IO.Default_Width) + Starting_Col ); end Get; --------------------------------------------------------------------------- procedure Get (Item : out Part_Entry) is POFS : Part_Of_Speech_Type := X; Spacer : Character; pragma Unreferenced (Spacer); -------------------------------------------------------------------------- Noun : Noun_Entry; Pronoun : Pronoun_Entry; Propack : Propack_Entry; Adjective : Adjective_Entry; Numeral : Numeral_Entry; Adverb : Adverb_Entry; Verb : Verb_Entry; Preposition : Preposition_Entry; Conjunction : Conjunction_Entry; Interjection : Interjection_Entry; -------------------------------------------------------------------------- begin Part_Of_Speech_Type_IO.Get (POFS); Ada.Text_IO.Get (Spacer); case POFS is when N => Noun_Entry_IO.Get (Noun); Item := (N, Noun); when Pron => Pronoun_Entry_IO.Get (Pronoun); Item := (Pron, Pronoun); when Pack => Propack_Entry_IO.Get (Propack); Item := (Pack, Propack); when Adj => Adjective_Entry_IO.Get (Adjective); Item := (Adj, Adjective); when Num => Numeral_Entry_IO.Get (Numeral); Item := (Num, Numeral); when Adv => Adverb_Entry_IO.Get (Adverb); Item := (Adv, Adverb); when V => Verb_Entry_IO.Get (Verb); Item := (V, Verb); when Vpar => null; -- No VAPR entry when Supine => null; -- No SUPINE entry when Prep => Preposition_Entry_IO.Get (Preposition); Item := (Prep, Preposition); when Conj => Conjunction_Entry_IO.Get (Conjunction); Item := (Conj, Conjunction); when Interj => Interjection_Entry_IO.Get (Interjection); Item := (Interj, Interjection); when Prefix => Item := (Pofs => Prefix); when Suffix => Item := (Pofs => Suffix); when Tackon => Item := (Pofs => Tackon); when X => Item := (Pofs => X); end case; end Get; --------------------------------------------------------------------------- procedure Put (File : in Ada.Text_IO.File_Type; Item : in Part_Entry) is begin Part_Of_Speech_Type_IO.Put (File, Item.Pofs); Ada.Text_IO.Put (File, ' '); case Item.Pofs is when N => Noun_Entry_IO.Put (File, Item.N); when Pron => Pronoun_Entry_IO.Put (File, Item.Pron); when Pack => Propack_Entry_IO.Put (File, Item.Pack); when Adj => Adjective_Entry_IO.Put (File, Item.Adj); when Num => Numeral_Entry_IO.Put (File, Item.Num); when Adv => Adverb_Entry_IO.Put (File, Item.Adv); when V => Verb_Entry_IO.Put (File, Item.V); when Vpar => null; -- No VAPR entry when Supine => null; -- No SUPINE entry when Prep => Preposition_Entry_IO.Put (File, Item.Prep); when Conj => Conjunction_Entry_IO.Put (File, Item.Conj); when Interj => Interjection_Entry_IO.Put (File, Item.Interj); when X => null; when Tackon .. Suffix => null; end case; end Put; --------------------------------------------------------------------------- procedure Put (Item : in Part_Entry) is begin Part_Of_Speech_Type_IO.Put (Item.Pofs); Ada.Text_IO.Put (' '); case Item.Pofs is when N => Noun_Entry_IO.Put (Item.N); when Pron => Pronoun_Entry_IO.Put (Item.Pron); when Pack => Propack_Entry_IO.Put (Item.Pack); when Adj => Adjective_Entry_IO.Put (Item.Adj); when Num => Numeral_Entry_IO.Put (Item.Num); when Adv => Adverb_Entry_IO.Put (Item.Adv); when V => Verb_Entry_IO.Put (Item.V); when Vpar => null; -- No VAPR entry when Supine => null; -- No SUPINE entry when Prep => Preposition_Entry_IO.Put (Item.Prep); when Conj => Conjunction_Entry_IO.Put (Item.Conj); when Interj => Interjection_Entry_IO.Put (Item.Interj); when Tackon .. Suffix => null; when X => null; end case; end Put; --------------------------------------------------------------------------- procedure Get (Source : in String; Target : out Part_Entry; Last : out Integer ) is -- Used to get lower bound of substring Low : Integer := Source'First - 1; -- Used to know which variant of Part_Entry shall be constructed POFS : Part_Of_Speech_Type := X; -------------------------------------------------------------------------- Noun : Noun_Entry; Pronoun : Pronoun_Entry; Propack : Propack_Entry; Adjective : Adjective_Entry; Numeral : Numeral_Entry; Adverb : Adverb_Entry; Verb : Verb_Entry; Preposition : Preposition_Entry; Conjunction : Conjunction_Entry; Interjection : Interjection_Entry; -------------------------------------------------------------------------- begin Last := Low; -- In case it is not set later Part_Of_Speech_Type_IO.Get (Source, POFS, Low); Low := Low + 1; case POFS is when N => Noun_Entry_IO.Get (Source (Low + 1 .. Source'Last), Noun, Last); Target := (N, Noun); when Pron => Pronoun_Entry_IO.Get (Source (Low + 1 .. Source'Last), Pronoun, Last); Target := (Pron, Pronoun); when Pack => Propack_Entry_IO.Get (Source (Low + 1 .. Source'Last), Propack, Last); Target := (Pack, Propack); when Adj => Adjective_Entry_IO.Get (Source (Low + 1 .. Source'Last), Adjective, Last); Target := (Adj, Adjective); when Num => Numeral_Entry_IO.Get (Source (Low + 1 .. Source'Last), Numeral, Last); Target := (Num, Numeral); when Adv => Adverb_Entry_IO.Get (Source (Low + 1 .. Source'Last), Adverb, Last); Target := (Adv, Adverb); when V => Verb_Entry_IO.Get (Source (Low + 1 .. Source'Last), Verb, Last); Target := (V, Verb); when Vpar => null; -- No VAPR entry when Supine => null; -- No SUPINE entry when Prep => Preposition_Entry_IO.Get (Source (Low + 1 .. Source'Last), Preposition, Last); Target := (Prep, Preposition); when Conj => Conjunction_Entry_IO.Get (Source (Low + 1 .. Source'Last), Conjunction, Last); Target := (Conj, Conjunction); when Interj => Interjection_Entry_IO.Get (Source (Low + 1 .. Source'Last), Interjection, Last); Target := (Interj, Interjection); when Prefix => Target := (Pofs => Prefix); when Suffix => Target := (Pofs => Suffix); when Tackon => Target := (Pofs => Tackon); when X => Target := (Pofs => X); end case; end Get; --------------------------------------------------------------------------- procedure Put (Target : out String; Item : in Part_Entry) is -- Used to get bounds of substrings Low : Integer := Target'First - 1; High : Integer := 0; begin -- Put Part_Of_Speech_Type High := Low + Part_Of_Speech_Type_IO.Default_Width; Part_Of_Speech_Type_IO.Put (Target (Low + 1 .. High), Item.Pofs); Low := High + 1; Target (Low) := ' '; -- Put Part_Entry case Item.Pofs is when N => High := Low + Noun_Entry_IO.Default_Width; Noun_Entry_IO.Put (Target (Low + 1 .. High), Item.N); when Pron => High := Low + Pronoun_Entry_IO.Default_Width; Pronoun_Entry_IO.Put (Target (Low + 1 .. High), Item.Pron); when Pack => High := Low + Propack_Entry_IO.Default_Width; Propack_Entry_IO.Put (Target (Low + 1 .. High), Item.Pack); when Adj => High := Low + Adjective_Entry_IO.Default_Width; Adjective_Entry_IO.Put (Target (Low + 1 .. High), Item.Adj); when Num => High := Low + Numeral_Entry_IO.Default_Width; Numeral_Entry_IO.Put (Target (Low + 1 .. High), Item.Num); when Adv => High := Low + Adverb_Entry_IO.Default_Width; Adverb_Entry_IO.Put (Target (Low + 1 .. High), Item.Adv); when V => High := Low + Verb_Entry_IO.Default_Width; Verb_Entry_IO.Put (Target (Low + 1 .. High), Item.V); when Vpar => null; -- No VAPR entry when Supine => null; -- No SUPINE entry when Prep => High := Low + Preposition_Entry_IO.Default_Width; Preposition_Entry_IO.Put (Target (Low + 1 .. High), Item.Prep); when Conj => High := Low + Conjunction_Entry_IO.Default_Width; Conjunction_Entry_IO.Put (Target (Low + 1 .. High), Item.Conj); when Interj => High := Low + Interjection_Entry_IO.Default_Width; Interjection_Entry_IO.Put (Target (Low + 1 .. High), Item.Interj); when X => null; when Tackon .. Suffix => null; end case; end Put; --------------------------------------------------------------------------- end Part_Entry_IO;

35.24557

80

0.479241

a1b1b8a2aa004be4707be07e0fe6bd8e9dde276c

30,292

adb

Ada

src/commands/makeewds.adb

lenzomj/whitakers-words

4712d5c5ce87b3a8e8419af7bff02fe478f7059b

[ "FTL" ]

null

src/commands/makeewds.adb

lenzomj/whitakers-words

4712d5c5ce87b3a8e8419af7bff02fe478f7059b

[ "FTL" ]

null

src/commands/makeewds.adb

lenzomj/whitakers-words

4712d5c5ce87b3a8e8419af7bff02fe478f7059b

[ "FTL" ]

null

-- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired) -- -- Copyright William A. Whitaker (1936–2010) -- -- This is a free program, which means it is proper to copy it and pass -- it on to your friends. Consider it a developmental item for which -- there is no charge. However, just for form, it is Copyrighted -- (c). Permission is hereby freely given for any and all use of program -- and data. You can sell it as your own, but at least tell me. -- -- This version is distributed without obligation, but the developer -- would appreciate comments and suggestions. -- -- All parts of the WORDS system, source code and data files, are made freely -- available to anyone who wishes to use them, for whatever purpose. with Ada.Text_IO; with Latin_Utils.Config; with Latin_Utils.Strings_Package; use Latin_Utils.Strings_Package; with Latin_Utils.Latin_File_Names; use Latin_Utils.Latin_File_Names; with Latin_Utils.Inflections_Package; use Latin_Utils.Inflections_Package; with Latin_Utils.Dictionary_Package; use Latin_Utils.Dictionary_Package; with Words_Engine.English_Support_Package; use Words_Engine.English_Support_Package; with Weed; with Weed_All; with Support_Utils.Dictionary_Form; with Latin_Utils.General; use Latin_Utils; procedure Makeewds is package Integer_IO is new Ada.Text_IO.Integer_IO (Integer); use Ada.Text_IO; use Integer_IO; use Dictionary_Entry_IO; use Part_Entry_IO; use Part_Of_Speech_Type_IO; use Age_Type_IO; use Area_Type_IO; use Geo_Type_IO; use Frequency_Type_IO; use Source_Type_IO; use Ewds_Record_Io; Porting : constant Boolean := False; Checking : constant Boolean := True; D_K : Dictionary_Kind := Xxx; -- ###################### Start_Stem_1 : constant := 1; Start_Stem_2 : constant := Start_Stem_1 + Max_Stem_Size + 1; Start_Stem_3 : constant := Start_Stem_2 + Max_Stem_Size + 1; Start_Stem_4 : constant := Start_Stem_3 + Max_Stem_Size + 1; Start_Part : constant := Start_Stem_4 + Max_Stem_Size + 1; Line_Number : Integer := 0; subtype Line_Type is String (1 .. 400); N : Integer := 0; Input, Output, Check : Ada.Text_IO.File_Type; De : Dictionary_Entry; S, Line : Line_Type := (others => ' '); Blank_Line : constant Line_Type := (others => ' '); L, Last : Integer := 0; Ewa : Ewds_Array (1 .. 40) := (others => Null_Ewds_Record); Ewr : Ewds_Record := Null_Ewds_Record; -- First we supplement MEAN with singles of any hyphenated words -- In principle this could be done in the main EXTRACT, much same logic/code -- However this is difficult code for an old man, EXTRACT was hard -- when I was a bit younger, and I cannot remember anything about it. -- Separating them out makes it much easier to test function Add_Hyphenated (S : String) return String is -------- I tried to do something with hyphenated but so far it -------- does not work -- Find hyphenated words and add them to MEAN with a / connector, -- right before the parse so one has both the individual words (may -- be more than two) and a single combined word -- counting-board -> counting board/countingboard -- Cannot be bigger: T : String (1 .. Max_Meaning_Size * 2 + 20) := (others => ' '); Word_Start : Integer := 1; Word_End : Integer := 0; I, J, Jmax : Integer := 0; Hyphenated : Boolean := False; begin --PUT_LINE (S); while I < S'Last loop I := I + 1; J := J + 1; Word_End := 0; --PUT (INTEGER'IMAGE (I) & "-"); -- First clear away or ignore all the non-words stuff if S (I) = '|' then -- Skip continuation |'s Word_Start := I + 1; T (J) := S (I); J := J + 1; Jmax := Jmax + 1; null; I := I + 1; elsif S (I) = '"' then -- Skip "'S Word_Start := I + 1; T (J) := S (I); J := J + 1; Jmax := Jmax + 1; null; I := I + 1; else if S (I) = '(' then -- ( .. .) not to be parsed T (J) := S (I); J := J + 1; Jmax := Jmax + 1; I := I + 1; while S (I) /= ')' loop T (J) := S (I); J := J + 1; Jmax := Jmax + 1; I := I + 1; end loop; Word_Start := I + 2; -- Skip }; Word_End := 0; elsif S (I) = '[' then -- ( .. .) not to be parsed T (J) := S (I); J := J + 1; Jmax := Jmax + 1; I := I + 1; while S (I - 1 .. I) /= "=>" loop T (J) := S (I); J := J + 1; Jmax := Jmax + 1; I := I + 1; end loop; Word_Start := I + 2; Word_End := 0; end if; -- Finished with the non-word stuff if S (I) = '-' then Word_End := I - 1; -- if (I /= S'FIRST) and then -- Not -word -- ( (S (I-1) /= ' ') and -- (S (I-1) /= '/') ) then -- HYPHENATED := TRUE; -- end if; end if; if S (I) = ' ' or S (I) = '/' or S (I) = ',' or S (I) = ';' or S (I) = '!' or S (I) = '?' or S (I) = '+' or S (I) = '*' or S (I) = '"' or S (I) = '(' then Word_End := I - 1; if Hyphenated then T (J) := '/'; J := J + 1; Jmax := Jmax + 1; for K in Word_Start .. Word_End loop if S (K) /= '-' then T (J) := S (K); J := J + 1; Jmax := Jmax + 1; end if; end loop; Hyphenated := False; end if; end if; if --WORD_END /= 0 and then S (I) = ' ' or S (I) = '/' then Word_Start := I + 1; Word_End := 0; end if; end if; -- On '|' -- Set up the Output to return --PUT ('|' & INTEGER'IMAGE (J) & '/' & INTEGER'IMAGE (I)); T (J) := S (I); Jmax := Jmax + 1; end loop; -- Over S'RANGE return T (1 .. Jmax); exception when others => Put_Line ("ADD_HYPHENATED Exception LINE = " & Integer'Image (Line_Number)); Put_Line (S); Put (De); New_Line; return T (1 .. Jmax); end Add_Hyphenated; procedure Extract_Words (S : in String; Pofs : in Part_Of_Speech_Type; N : out Integer; Ewa : out Ewds_Array) is -- i, j, js, k, l, m, im, ic : Integer := 0; J, K, L, M, Im, Ic : Integer := 0; End_Semi : constant Integer := 1; -- Have to expand type to take care of hyphenated subtype X_Meaning_Type is String (1 .. Max_Meaning_Size * 2 + 20); Null_X_Meaning_Type : constant X_Meaning_Type := (others => ' '); Semi, Comma : X_Meaning_Type := Null_X_Meaning_Type; Ww : Integer := 0; -- For debug begin -- i := 1; -- Element Position in line, per SEMI J := 1; -- Position in word K := 0; -- SEMI - Division in line L := 1; -- Position in MEAN, for EXTRACTing SEMI M := 1; -- COMMA in SEMI N := 1; -- Word number Im := 0; -- Position in SEMI Ic := 0; -- Position in COMMA Ewa (N) := Null_Ewds_Record; -- Slightly disparage extension if S (S'First) = '|' then K := 3; end if; while L <= S'Last loop -- loop over MEAN if S (L) = ' ' then -- Clear initial blanks L := L + 1; end if; Semi := Null_X_Meaning_Type; Im := 1; Extract_Semi : loop if S (L) = '|' then null; -- Ignore continuation flag | as word elsif S (L) in '0' .. '9' then null; -- Ignore numbers elsif S (L) = ';' then -- Division Terminator K := K + 1; --PUT ('+'); L := L + 1; -- Clear ; exit Extract_Semi; elsif S (L) = '(' then -- Skip ( .. .) ! while S (L) /= ')' loop --PUT ('+'); --PUT (INTEGER'IMAGE (L)); --PUT (S (L)); exit when L = S'Last; -- Run out L := L + 1; end loop; -- L := L + 1; -- Clear the ')' --PUT ('^'); --PUT (INTEGER'IMAGE (L)); --PUT (S (L)); if L > S'Last then L := S'Last; else if S (L) = ';' then -- ); exit Extract_Semi; end if; end if; --PUT (']'); if L >= S'Last then -- Ends in ) -- PUT ('!'); exit Extract_Semi; end if; --PUT ('+'); --L := L + 1; -- Clear the ')' elsif L = S'Last then --PUT ('|'); L := L + 1; -- To end the loop exit Extract_Semi; else Semi (Im) := S (L); Im := Im + 1; end if; --PUT ('+'); --IM := IM + 1; -- To next Character L := L + 1; -- To next Character end loop Extract_Semi; Ww := 10; Process_Semi : declare St : constant String := Trim (Semi); Sm : constant String (St'First .. St'Last) := St; begin if St'Length > 0 then Comma := Null_X_Meaning_Type; Im := Sm'First; M := 0; --I := SM'FIRST; --while I <= ST'LAST loop --PUT (S (I)); --PUT ('*'); --COMMA := NULL_X_MEANING_TYPE; Ic := 1; Loop_Over_Semi : while Im <= Sm'Last loop Comma := Null_X_Meaning_Type; Ww := 20; Find_Comma : loop --PUT (INTEGER'IMAGE (IM) & " ( " & SM (IM)); if Sm (Im) = '(' then -- Skip ( .. .) ! while Sm (Im) /= ')' loop Im := Im + 1; end loop; Im := Im + 1; -- Clear the ')' -- IM := IM + 1; -- Go to next Character if Im >= End_Semi then exit Find_Comma; end if; if (Sm (Im) = ';') or (Sm (Im) = ',') then -- Foumd COMMA M := M + 1; Ic := 1; Im := Im + 1; -- Clear ;, exit Find_Comma; elsif Sm (Im) = ' ' then Im := Im + 1; end if; --PUT_LINE ("------------------------"); end if; if Sm (Im) = '[' then -- Take end of [=>] while Sm (Im) /= '>' loop exit when Sm (Im) = ']'; -- If no > Im := Im + 1; end loop; Im := Im + 1; -- Clear the '>' or ']' if Sm (Im) = ';' then -- Foumd COMMA M := M + 1; Ic := 1; Im := Im + 1; -- Clear ; exit Find_Comma; elsif Sm (Im) = ' ' then Im := Im + 1; end if; end if; -- But could be 2 =>! --PUT_LINE ("Through ()[] I = " & INTEGER'IMAGE (I)); exit Find_Comma when Im > Sm'Last; --PUT (INTEGER'IMAGE (IM) & " ) " & SM (IM)); if Sm (Im) = ',' then -- Foumd COMMA M := M + 1; Ic := 1; Im := Im + 1; -- Clear , exit Find_Comma; elsif Im >= Sm'Last or Im = S'Last then -- Foumd COMMA Comma (Ic) := Sm (Im); M := M + 1; Ic := 1; exit Find_Comma; else Comma (Ic) := Sm (Im); Im := Im + 1; Ic := Ic + 1; end if; --PUT (INTEGER'IMAGE (IM) & " ! " & SM (IM)); end loop Find_Comma; Im := Im + 1; Ww := 30; Process_Comma : declare Ct : constant String := Trim (Comma); Cs : String (Ct'First .. Ct'Last) := Ct; Pure : Boolean := True; W_Start, W_End : Integer := 0; begin Ww := 31; if Ct'Length > 0 then -- Is COMMA non empty -- Are there any blanks? -- If not then it is a pure word -- Or words with / for Ip in Cs'Range loop if Cs (Ip) = ' ' then Pure := False; end if; end loop; Ww := 32; -- Check for WEED words and eliminate them W_Start := Cs'First; W_End := Cs'Last; for Iw in Cs'Range loop --PUT ('-'); --PUT (CS (IW)); if (Cs (Iw) = '(') or (Cs (Iw) = '[') then Ww := 33; W_Start := Iw + 1; else Ww := 34; if (Cs (Iw) = ' ') or (Cs (Iw) = '_') or (Cs (Iw) = '-') or (Cs (Iw) = ''') or (Cs (Iw) = '!') or (Cs (Iw) = '/') or (Cs (Iw) = ':') or (Cs (Iw) = '.') or (Cs (Iw) = '!') or (Cs (Iw) = ')') or (Cs (Iw) = ']') or (Iw = Cs'Last) then Ww := 35; if Iw = Cs'Last then W_End := Iw; elsif Iw /= Cs'First then W_End := Iw - 1; end if; Ww := 36; -- KLUDGE if Cs (W_Start) = '"' then Ww := 361; W_Start := W_Start + 1; Ww := 362; elsif Cs (W_End) = '"' then Ww := 364; W_End := W_End - 1; Ww := 365; end if; Ww := 37; --& " " & CS (W_START .. W_END) --); Weed_All (Cs (W_Start .. W_End)); if not Pure then Weed (Cs (W_Start .. W_End), Pofs); end if; W_Start := Iw + 1; end if; Ww := 38; end if; Ww := 39; end loop; -- On CS'RANGE --PUT_LINE (INTEGER'IMAGE (LINE_NUMBER) & "WEED done"); Ww := 40; -- Main process of COMMA Ic := 1; J := 1; while Ic <= Cs'Last loop --PUT (CS (IC)); if Cs (Ic) = '"' or -- Skip all " Cs (Ic) = '(' or -- Skip initial ( Cs (Ic) = '?' or -- Ignore ? Cs (Ic) = '~' or -- Ignore about ~ Cs (Ic) = '*' or Cs (Ic) = '%' or -- Ignore % unless word Cs (Ic) = '.' or -- Ignore . .. Cs (Ic) = '\' or -- Ignore weed (Cs (Ic) in '0' .. '9') then -- Skip numbers Ic := Ic + 1; Ww := 50; ----PUT ('-'); else if Cs (Ic) = '/' or Cs (Ic) = ' ' or Cs (Ic) = ''' or -- Ignore all ' incl 's ??? Cs (Ic) = '-' or -- Hyphen causes 2 words XXX Cs (Ic) = '+' or -- Plus causes 2 words Cs (Ic) = '_' or -- Underscore causes 2 words Cs (Ic) = '=' or -- = space/terminates Cs (Ic) = '>' or Cs (Ic) = ')' or Cs (Ic) = ']' or Cs (Ic) = '!' or Cs (Ic) = '?' or Cs (Ic) = '+' or Cs (Ic) = ':' or Cs (Ic) = ']' then -- Found word Ww := 60; --PUT ('/'); Ewa (N).Semi := K; if Pure then if K = 1 then Ewa (N).Kind := 15; else Ewa (N).Kind := 10; end if; else Ewa (N).Kind := 0; end if; Ww := 70; N := N + 1; -- Start new word in COMMA Ic := Ic + 1; J := 1; Ewa (N) := Null_Ewds_Record; elsif Ic = Cs'Last then -- Order of if important -- End, Found word --PUT ('!'); Ewa (N).W (J) := Cs (Ic); Ewa (N).Semi := K; if Pure then if K = 1 then Ewa (N).Kind := 15; else Ewa (N).Kind := 10; end if; else Ewa (N).Kind := 0; end if; N := N + 1; -- Start new word/COMMA Ewa (N) := Null_Ewds_Record; exit; else Ww := 80; --PUT ('+'); Ewa (N).W (J) := Cs (Ic); J := J + 1; Ic := Ic + 1; end if; end if; Ww := 90; end loop; end if; -- On COMMA being empty end Process_Comma; --PUT_LINE ("COMMA Processed "); end loop Loop_Over_Semi; --PUT_LINE ("LOOP OVER SEMI Processed "); end if; -- On ST'LENGTH > 0 --PUT_LINE ("LOOP OVER SEMI after ST'LENGTH 0 "); end Process_Semi; --PUT_LINE ("SEMI Processed "); -- I = " & INTEGER'IMAGE (I) --& " S (I) = " & S (I) --); if (L < S'Last) and then (S (L) = ';') then -- ?????? --PUT_LINE ("Clear L = " & INTEGER'IMAGE (L)); L := L + 1; end if; -- investigate this: -- js := l; -- Odd but necessary ????? for J in L .. S'Last loop exit when J = S'Last; if S (J) = ' ' then L := L + 1; else exit; end if; end loop; exit when L >= S'Last; end loop; -- loop over MEAN --PUT_LINE ("SEMI loop Processed"); DROP_DUPES : for Z in Ewa'Range loop if Ewa (Z).W /= Null_Eword then INNER_LOOP : for ZZ in (Z + 1) .. Ewa'Last loop if Ewa (Z).W = Ewa (ZZ).W then Ewa (ZZ).W := Null_Eword; end if; end loop INNER_LOOP; end if; end loop DROP_DUPES; if Ewa (N) = Null_Ewds_Record then N := N - 1; -- Clean up danglers end if; if Ewa (N) = Null_Ewds_Record then -- AGAIN!!!!!! N := N - 1; -- Clean up danglers end if; exception when others => if (S (S'Last) /= ')') or (S (S'Last) /= ']') then -- KLUDGE New_Line; Put_Line ("Extract Exception WW = " & Integer'Image (Ww) & " LINE = " & Integer'Image (Line_Number)); Put_Line (S); Put (De); New_Line; end if; end Extract_Words; begin Put_Line ("Takes a DICTLINE.D_K and produces a EWDSLIST.D_K "); Latin_Utils.General.Load_Dictionary (Line, Last, D_K); Open (Input, In_File, Latin_Utils.Config.Path (Dict_Line_Name & '.' & Ext (D_K))); --PUT_LINE ("OPEN"); if not Porting then --PUT_LINE ("CREATING"); Create (Output, Out_File, "EWDSLIST." & Ext (D_K)); if Checking then Create (Check, Out_File, "CHECKEWD."); end if; --PUT_LINE ("CREATED"); end if; -- Now do the rest Over_Lines : while not End_Of_File (Input) loop S := Blank_Line; Get_Line (Input, S, Last); if Trim (S (1 .. Last)) /= "" then -- If non-blank line L := 0; Form_De : begin De.Stems (1) := S (Start_Stem_1 .. Max_Stem_Size); --NEW_LINE; PUT (DE.STEMS (1)); De.Stems (2) := S (Start_Stem_2 .. Start_Stem_2 + Max_Stem_Size - 1); De.Stems (3) := S (Start_Stem_3 .. Start_Stem_3 + Max_Stem_Size - 1); De.Stems (4) := S (Start_Stem_4 .. Start_Stem_4 + Max_Stem_Size - 1); --PUT ('#'); PUT (INTEGER'IMAGE (L)); PUT (INTEGER'IMAGE (LAST)); --PUT ('@'); Get (S (Start_Part .. Last), De.Part, L); --PUT ('%'); PUT (INTEGER'IMAGE (L)); PUT (INTEGER'IMAGE (LAST)); --PUT ('&'); PUT (S (L+1 .. LAST)); PUT ('3'); --GET (S (L+1 .. LAST), DE.PART.POFS, DE.KIND, L); -- FIXME: Why not Translation_Record_IO.Put ? Get (S (L + 1 .. Last), De.Tran.Age, L); Get (S (L + 1 .. Last), De.Tran.Area, L); Get (S (L + 1 .. Last), De.Tran.Geo, L); Get (S (L + 1 .. Last), De.Tran.Freq, L); Get (S (L + 1 .. Last), De.Tran.Source, L); De.Mean := Head (S (L + 2 .. Last), Max_Meaning_Size); -- Note that this allows initial blanks -- L+2 skips over the SPACER, required because -- this is STRING, not ENUM exception when others => New_Line; Put_Line ("GET Exception LAST = " & Integer'Image (Last)); Put_Line (S (1 .. Last)); Integer_IO.Put (Line_Number); New_Line; Put (De); New_Line; end Form_De; Line_Number := Line_Number + 1; if De.Part.Pofs = V and then De.Part.V.Con.Which = 8 then -- V 8 is a kludge for variant forms of verbs -- that have regular forms elsewhere null; else -- Extract words Extract_Words (Add_Hyphenated (Trim (De.Mean)), De.Part.Pofs, N, Ewa); -- EWORD_SIZE : constant := 38; -- AUX_WORD_SIZE : constant := 9; -- LINE_NUMBER_WIDTH : constant := 10; -- -- type EWDS_RECORD is -- record -- POFS : PART_OF_SPEECH_TYPE := X; -- W : STRING (1 .. EWORD_SIZE); -- AUX : STRING (1 .. AUX_WORD_SIZE); -- N : INTEGER; -- end record; for I in 1 .. N loop if Trim (Ewa (I).W)'Length /= 0 then Ewr.W := Head (Trim (Ewa (I).W), Eword_Size); Ewr.Aux := Head ("", Aux_Word_Size); Ewr.N := Line_Number; Ewr.Pofs := De.Part.Pofs; Ewr.Freq := De.Tran.Freq; Ewr.Semi := Ewa (I).Semi; Ewr.Kind := Ewa (I).Kind; Ewr.Rank := 80 - Frequency_Type'Pos (Ewr.Freq) * 10 + Ewr.Kind + (Ewr.Semi - 1) * (-3); if Ewr.Freq = Inflections_Package.N then Ewr.Rank := Ewr.Rank + 25; end if; --PUT (EWA (I)); NEW_LINE; --PUT (EWR); NEW_LINE; Put (Output, Ewr); -- SET_COL (OUTPUT, 71); -- INTEGER_IO.PUT (OUTPUT, I, 2); New_Line (Output); if Checking then -- Now make the CHECK file Put (Check, Ewr.W); Set_Col (Check, 25); declare Df : constant String := Support_Utils.Dictionary_Form (De); Ii : Integer := 1; begin if Df'Length > 0 then while Df (Ii) /= ' ' and Df (Ii) /= '.' and Df (Ii) /= ',' loop Put (Check, Df (Ii)); Ii := Ii + 1; exit when Ii = 19; end loop; end if; end; Set_Col (Check, 44); Put (Check, Ewr.N, 6); Put (Check, ' '); Put (Check, Ewr.Pofs); Put (Check, ' '); Put (Check, Ewr.Freq); Put (Check, ' '); Put (Check, Ewr.Semi, 5); Put (Check, ' '); Put (Check, Ewr.Kind, 5); Put (Check, ' '); Put (Check, Ewr.Rank, 5); Put (Check, ' '); Put (Check, De.Mean); New_Line (Check); end if; end if; end loop; end if; -- If non-blank line end if; end loop Over_Lines; Put_Line ("NUMBER_OF_LINES = " & Integer'Image (Line_Number)); if not Porting then Close (Output); if Checking then Close (Check); end if; end if; exception when Ada.Text_IO.Data_Error => null; when others => Put_Line (S (1 .. Last)); Integer_IO.Put (Line_Number); New_Line; Close (Output); if Checking then Close (Check); end if; end Makeewds;

37.259533

80

0.344645

31e67a72ee633ace84613ec8a07b7a2223db6cc2

11,185

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34005p.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34005p.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34005p.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C34005P.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. --* -- OBJECTIVE: -- CHECK THAT THE REQUIRED PREDEFINED OPERATIONS ARE DECLARED -- (IMPLICITLY) FOR DERIVED ONE-DIMENSIONAL ARRAY TYPES WHOSE -- COMPONENT TYPE IS A LIMITED TYPE. -- HISTORY: -- JRK 08/17/87 CREATED ORIGINAL TEST. -- VCL 07/01/88 MODIFIED THE STATEMENTS INVOLVING THE 'SIZE -- ATTRIBUTE TO REMOVE ANY ASSUMPTIONS ABOUT THE -- SIZES. ADDED EXCEPTION HANDLERS TO CATCH INCORRECT -- TYPE CONVERSIONS TO DERIVED SUBTYPES. -- PWN 11/30/94 REMOVED 'BASE USE ILLEGAL IN ADA 9X. -- RLB 10/03/02 REMOVED ILLEGAL (BY AI-246) TYPE CONVERSIONS AND -- SUPPORTING CODE. WITH SYSTEM; USE SYSTEM; WITH REPORT; USE REPORT; PROCEDURE C34005P IS PACKAGE PKG_L IS TYPE LP IS LIMITED PRIVATE; FUNCTION CREATE (X : INTEGER) RETURN LP; FUNCTION VALUE (X : LP) RETURN INTEGER; FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN; PROCEDURE ASSIGN (X : OUT LP; Y : LP); C1 : CONSTANT LP; C2 : CONSTANT LP; C3 : CONSTANT LP; C4 : CONSTANT LP; C5 : CONSTANT LP; C6 : CONSTANT LP; PRIVATE TYPE LP IS NEW INTEGER; C1 : CONSTANT LP := 1; C2 : CONSTANT LP := 2; C3 : CONSTANT LP := 3; C4 : CONSTANT LP := 4; C5 : CONSTANT LP := 5; C6 : CONSTANT LP := 6; END PKG_L; USE PKG_L; SUBTYPE COMPONENT IS LP; PACKAGE PKG_P IS FIRST : CONSTANT := 0; LAST : CONSTANT := 100; SUBTYPE INDEX IS INTEGER RANGE FIRST .. LAST; TYPE PARENT IS ARRAY (INDEX RANGE <>) OF COMPONENT; FUNCTION CREATE ( F, L : INDEX; C : COMPONENT; DUMMY : PARENT -- TO RESOLVE OVERLOADING. ) RETURN PARENT; FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN; FUNCTION AGGR (X, Y : COMPONENT) RETURN PARENT; FUNCTION AGGR (X, Y, Z : COMPONENT) RETURN PARENT; END PKG_P; USE PKG_P; TYPE T IS NEW PARENT (IDENT_INT (5) .. IDENT_INT (7)); X : T; W : PARENT (5 .. 7); C : COMPONENT; B : BOOLEAN := FALSE; N : CONSTANT := 1; PROCEDURE A (X : ADDRESS) IS BEGIN B := IDENT_BOOL (TRUE); END A; FUNCTION V RETURN T IS RESULT : T; BEGIN FOR I IN RESULT'RANGE LOOP ASSIGN (RESULT (I), C); END LOOP; RETURN RESULT; END V; PACKAGE BODY PKG_L IS FUNCTION CREATE (X : INTEGER) RETURN LP IS BEGIN RETURN LP (IDENT_INT (X)); END CREATE; FUNCTION VALUE (X : LP) RETURN INTEGER IS BEGIN RETURN INTEGER (X); END VALUE; FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN IS BEGIN RETURN X = Y; END EQUAL; PROCEDURE ASSIGN (X : OUT LP; Y : LP) IS BEGIN X := Y; END ASSIGN; END PKG_L; PACKAGE BODY PKG_P IS FUNCTION CREATE ( F, L : INDEX; C : COMPONENT; DUMMY : PARENT ) RETURN PARENT IS A : PARENT (F .. L); B : COMPONENT; BEGIN ASSIGN (B, C); FOR I IN F .. L LOOP ASSIGN (A (I), B); ASSIGN (B, CREATE (VALUE (B) + 1)); END LOOP; RETURN A; END CREATE; FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN IS BEGIN IF X'LENGTH /= Y'LENGTH THEN RETURN FALSE; ELSE FOR I IN X'RANGE LOOP IF NOT EQUAL (X (I), Y (I - X'FIRST + Y'FIRST)) THEN RETURN FALSE; END IF; END LOOP; END IF; RETURN TRUE; END EQUAL; FUNCTION AGGR (X, Y : COMPONENT) RETURN PARENT IS RESULT : PARENT (INDEX'FIRST .. INDEX'FIRST + 1); BEGIN ASSIGN (RESULT (INDEX'FIRST ), X); ASSIGN (RESULT (INDEX'FIRST + 1), Y); RETURN RESULT; END AGGR; FUNCTION AGGR (X, Y, Z : COMPONENT) RETURN PARENT IS RESULT : PARENT (INDEX'FIRST .. INDEX'FIRST + 2); BEGIN ASSIGN (RESULT (INDEX'FIRST ), X); ASSIGN (RESULT (INDEX'FIRST + 1), Y); ASSIGN (RESULT (INDEX'FIRST + 2), Z); RETURN RESULT; END AGGR; END PKG_P; BEGIN TEST ("C34005P", "CHECK THAT THE REQUIRED PREDEFINED OPERATIONS " & "ARE DECLARED (IMPLICITLY) FOR DERIVED " & "ONE-DIMENSIONAL ARRAY TYPES WHOSE COMPONENT " & "TYPE IS A LIMITED TYPE"); ASSIGN (X (IDENT_INT (5)), CREATE (1)); ASSIGN (X (IDENT_INT (6)), CREATE (2)); ASSIGN (X (IDENT_INT (7)), CREATE (3)); ASSIGN (W (5), CREATE (1)); ASSIGN (W (6), CREATE (2)); ASSIGN (W (7), CREATE (3)); ASSIGN (C, CREATE (2)); IF NOT EQUAL (T'(X), AGGR (C1, C2, C3)) THEN FAILED ("INCORRECT QUALIFICATION"); END IF; IF NOT EQUAL (T(X), AGGR (C1, C2, C3)) THEN FAILED ("INCORRECT SELF CONVERSION"); END IF; IF NOT EQUAL (T(W), AGGR (C1, C2, C3)) THEN FAILED ("INCORRECT CONVERSION FROM PARENT"); END IF; IF NOT EQUAL (PARENT(X), AGGR (C1, C2, C3)) THEN FAILED ("INCORRECT CONVERSION TO PARENT - 1"); END IF; BEGIN IF NOT EQUAL (PARENT(CREATE (2, 3, C4, X)), AGGR (C4, C5)) THEN FAILED ("INCORRECT CONVERSION TO PARENT - 2"); END IF; EXCEPTION WHEN OTHERS => FAILED ("EXCEPTION RAISED WHILE CHECKING BASE TYPE " & "VALUES OUTSIDE OF THE SUBTYPE T - 1"); END; IF NOT EQUAL (X(IDENT_INT (5)), C1) THEN FAILED ("INCORRECT INDEX (VALUE)"); END IF; BEGIN IF NOT EQUAL (X(IDENT_INT (6)..IDENT_INT (7)), AGGR (C2, C3)) OR NOT EQUAL (CREATE (1, 4, C4, X)(1..3), AGGR (C4, C5, C6)) THEN FAILED ("INCORRECT SLICE (VALUE)"); END IF; EXCEPTION WHEN OTHERS => FAILED ("EXCEPTION RAISED WHILE CHECKING SLICES"); END; IF NOT (X IN T) OR AGGR (C1, C2) IN T THEN FAILED ("INCORRECT ""IN"""); END IF; IF X NOT IN T OR NOT (AGGR (C1, C2) NOT IN T) THEN FAILED ("INCORRECT ""NOT IN"""); END IF; B := FALSE; A (X'ADDRESS); IF NOT B THEN FAILED ("INCORRECT 'ADDRESS"); END IF; IF T'FIRST /= 5 THEN FAILED ("INCORRECT TYPE'FIRST"); END IF; IF X'FIRST /= 5 THEN FAILED ("INCORRECT OBJECT'FIRST"); END IF; IF V'FIRST /= 5 THEN FAILED ("INCORRECT VALUE'FIRST"); END IF; IF T'FIRST (N) /= 5 THEN FAILED ("INCORRECT TYPE'FIRST (N)"); END IF; IF X'FIRST (N) /= 5 THEN FAILED ("INCORRECT OBJECT'FIRST (N)"); END IF; IF V'FIRST (N) /= 5 THEN FAILED ("INCORRECT VALUE'FIRST (N)"); END IF; IF T'LAST /= 7 THEN FAILED ("INCORRECT TYPE'LAST"); END IF; IF X'LAST /= 7 THEN FAILED ("INCORRECT OBJECT'LAST"); END IF; IF V'LAST /= 7 THEN FAILED ("INCORRECT VALUE'LAST"); END IF; IF T'LAST (N) /= 7 THEN FAILED ("INCORRECT TYPE'LAST (N)"); END IF; IF X'LAST (N) /= 7 THEN FAILED ("INCORRECT OBJECT'LAST (N)"); END IF; IF V'LAST (N) /= 7 THEN FAILED ("INCORRECT VALUE'LAST (N)"); END IF; IF T'LENGTH /= 3 THEN FAILED ("INCORRECT TYPE'LENGTH"); END IF; IF X'LENGTH /= 3 THEN FAILED ("INCORRECT OBJECT'LENGTH"); END IF; IF V'LENGTH /= 3 THEN FAILED ("INCORRECT VALUE'LENGTH"); END IF; IF T'LENGTH (N) /= 3 THEN FAILED ("INCORRECT TYPE'LENGTH (N)"); END IF; IF X'LENGTH (N) /= 3 THEN FAILED ("INCORRECT OBJECT'LENGTH (N)"); END IF; IF V'LENGTH (N) /= 3 THEN FAILED ("INCORRECT VALUE'LENGTH (N)"); END IF; DECLARE Y : PARENT (T'RANGE); BEGIN IF Y'FIRST /= 5 OR Y'LAST /= 7 THEN FAILED ("INCORRECT TYPE'RANGE"); END IF; END; DECLARE Y : PARENT (X'RANGE); BEGIN IF Y'FIRST /= 5 OR Y'LAST /= 7 THEN FAILED ("INCORRECT OBJECT'RANGE"); END IF; END; DECLARE Y : PARENT (V'RANGE); BEGIN IF Y'FIRST /= 5 OR Y'LAST /= 7 THEN FAILED ("INCORRECT VALUE'RANGE"); END IF; END; DECLARE Y : PARENT (T'RANGE (N)); BEGIN IF Y'FIRST /= 5 OR Y'LAST /= 7 THEN FAILED ("INCORRECT TYPE'RANGE (N)"); END IF; END; DECLARE Y : PARENT (X'RANGE (N)); BEGIN IF Y'FIRST /= 5 OR Y'LAST /= 7 THEN FAILED ("INCORRECT OBJECT'RANGE (N)"); END IF; END; DECLARE Y : PARENT (V'RANGE (N)); BEGIN IF Y'FIRST /= 5 OR Y'LAST /= 7 THEN FAILED ("INCORRECT VALUE'RANGE (N)"); END IF; END; IF X'SIZE < T'SIZE THEN COMMENT ("X'SIZE < T'SIZE"); ELSIF X'SIZE = T'SIZE THEN COMMENT ("X'SIZE = T'SIZE"); ELSE COMMENT ("X'SIZE > T'SIZE"); END IF; RESULT; END C34005P;

27.549261

78

0.499866

062ec53869fb6c3639f5683c4d7da113cf32e15a

24,481

adb

Ada

Ada95/samples/ncurses2-demo_pad.adb

Ancient-Rom/android_external_libncurses

cfb80399910df8d55602d879d5cf0bc5ceaa2f89

[ "X11" ]

1,167

2017-08-21T21:21:24.000Z

2022-03-31T15:42:10.000Z

vendor/ncurses/Ada95/samples/ncurses2-demo_pad.adb

motor-admin/ruby-packer

0a2a888d3facaa66c53ee7da008f7a49d479fce1

[ "MIT" ]

374

2015-11-03T12:37:22.000Z

2021-12-17T14:18:08.000Z

vendor/ncurses/Ada95/samples/ncurses2-demo_pad.adb

motor-admin/ruby-packer

0a2a888d3facaa66c53ee7da008f7a49d479fce1

[ "MIT" ]

96

2015-11-22T07:47:26.000Z

2022-01-20T19:52:19.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- ncurses -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 2000-2011,2014 Free Software Foundation, Inc. -- -- -- -- 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, distribute with modifications, 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 ABOVE 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. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Eugene V. Melaragno <[email protected]> 2000 -- Version Control -- $Revision: 1.9 $ -- $Date: 2014/09/13 19:10:18 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ with ncurses2.util; use ncurses2.util; with Terminal_Interface.Curses; use Terminal_Interface.Curses; with Interfaces.C; with System.Storage_Elements; with System.Address_To_Access_Conversions; with Ada.Text_IO; -- with Ada.Real_Time; use Ada.Real_Time; -- TODO is there a way to use Real_Time or Ada.Calendar in place of -- gettimeofday? -- Demonstrate pads. procedure ncurses2.demo_pad is type timestruct is record seconds : Integer; microseconds : Integer; end record; type myfunc is access function (w : Window) return Key_Code; function gettime return timestruct; procedure do_h_line (y : Line_Position; x : Column_Position; c : Attributed_Character; to : Column_Position); procedure do_v_line (y : Line_Position; x : Column_Position; c : Attributed_Character; to : Line_Position); function padgetch (win : Window) return Key_Code; function panner_legend (line : Line_Position) return Boolean; procedure panner_legend (line : Line_Position); procedure panner_h_cleanup (from_y : Line_Position; from_x : Column_Position; to_x : Column_Position); procedure panner_v_cleanup (from_y : Line_Position; from_x : Column_Position; to_y : Line_Position); procedure panner (pad : Window; top_xp : Column_Position; top_yp : Line_Position; portyp : Line_Position; portxp : Column_Position; pgetc : myfunc); function gettime return timestruct is retval : timestruct; use Interfaces.C; type timeval is record tv_sec : long; tv_usec : long; end record; pragma Convention (C, timeval); -- TODO function from_timeval is new Ada.Unchecked_Conversion( -- timeval_a, System.Storage_Elements.Integer_Address); -- should Interfaces.C.Pointers be used here? package myP is new System.Address_To_Access_Conversions (timeval); use myP; t : constant Object_Pointer := new timeval; function gettimeofday (TP : System.Storage_Elements.Integer_Address; TZP : System.Storage_Elements.Integer_Address) return int; pragma Import (C, gettimeofday, "gettimeofday"); tmp : int; begin tmp := gettimeofday (System.Storage_Elements.To_Integer (myP.To_Address (t)), System.Storage_Elements.To_Integer (myP.To_Address (null))); if tmp < 0 then retval.seconds := 0; retval.microseconds := 0; else retval.seconds := Integer (t.all.tv_sec); retval.microseconds := Integer (t.all.tv_usec); end if; return retval; end gettime; -- in C, The behavior of mvhline, mvvline for negative/zero length is -- unspecified, though we can rely on negative x/y values to stop the -- macro. Except Ada makes Line_Position(-1) = Natural - 1 so forget it. procedure do_h_line (y : Line_Position; x : Column_Position; c : Attributed_Character; to : Column_Position) is begin if to > x then Move_Cursor (Line => y, Column => x); Horizontal_Line (Line_Size => Natural (to - x), Line_Symbol => c); end if; end do_h_line; procedure do_v_line (y : Line_Position; x : Column_Position; c : Attributed_Character; to : Line_Position) is begin if to > y then Move_Cursor (Line => y, Column => x); Vertical_Line (Line_Size => Natural (to - y), Line_Symbol => c); end if; end do_v_line; function padgetch (win : Window) return Key_Code is c : Key_Code; c2 : Character; begin c := Getchar (win); c2 := Code_To_Char (c); case c2 is when '!' => ShellOut (False); return Key_Refresh; when Character'Val (Character'Pos ('r') mod 16#20#) => -- CTRL('r') End_Windows; Refresh; return Key_Refresh; when Character'Val (Character'Pos ('l') mod 16#20#) => -- CTRL('l') return Key_Refresh; when 'U' => return Key_Cursor_Up; when 'D' => return Key_Cursor_Down; when 'R' => return Key_Cursor_Right; when 'L' => return Key_Cursor_Left; when '+' => return Key_Insert_Line; when '-' => return Key_Delete_Line; when '>' => return Key_Insert_Char; when '<' => return Key_Delete_Char; -- when ERR=> /* FALLTHRU */ when 'q' => return (Key_Exit); when others => return (c); end case; end padgetch; show_panner_legend : Boolean := True; function panner_legend (line : Line_Position) return Boolean is legend : constant array (0 .. 3) of String (1 .. 61) := ( "Use arrow keys (or U,D,L,R) to pan, q to quit (?,t,s flags) ", "Use ! to shell-out. Toggle legend:?, timer:t, scroll mark:s.", "Use +,- (or j,k) to grow/shrink the panner vertically. ", "Use <,> (or h,l) to grow/shrink the panner horizontally. "); legendsize : constant := 4; n : constant Integer := legendsize - Integer (Lines - line); begin if line < Lines and n >= 0 then Move_Cursor (Line => line, Column => 0); if show_panner_legend then Add (Str => legend (n)); end if; Clear_To_End_Of_Line; return show_panner_legend; end if; return False; end panner_legend; procedure panner_legend (line : Line_Position) is begin if not panner_legend (line) then Beep; end if; end panner_legend; procedure panner_h_cleanup (from_y : Line_Position; from_x : Column_Position; to_x : Column_Position) is begin if not panner_legend (from_y) then do_h_line (from_y, from_x, Blank2, to_x); end if; end panner_h_cleanup; procedure panner_v_cleanup (from_y : Line_Position; from_x : Column_Position; to_y : Line_Position) is begin if not panner_legend (from_y) then do_v_line (from_y, from_x, Blank2, to_y); end if; end panner_v_cleanup; procedure panner (pad : Window; top_xp : Column_Position; top_yp : Line_Position; portyp : Line_Position; portxp : Column_Position; pgetc : myfunc) is function f (y : Line_Position) return Line_Position; function f (x : Column_Position) return Column_Position; function greater (y1, y2 : Line_Position) return Integer; function greater (x1, x2 : Column_Position) return Integer; top_x : Column_Position := top_xp; top_y : Line_Position := top_yp; porty : Line_Position := portyp; portx : Column_Position := portxp; -- f[x] returns max[x - 1, 0] function f (y : Line_Position) return Line_Position is begin if y > 0 then return y - 1; else return y; -- 0 end if; end f; function f (x : Column_Position) return Column_Position is begin if x > 0 then return x - 1; else return x; -- 0 end if; end f; function greater (y1, y2 : Line_Position) return Integer is begin if y1 > y2 then return 1; else return 0; end if; end greater; function greater (x1, x2 : Column_Position) return Integer is begin if x1 > x2 then return 1; else return 0; end if; end greater; pymax : Line_Position; basey : Line_Position := 0; pxmax : Column_Position; basex : Column_Position := 0; c : Key_Code; scrollers : Boolean := True; before, after : timestruct; timing : Boolean := True; package floatio is new Ada.Text_IO.Float_IO (Long_Float); begin Get_Size (pad, pymax, pxmax); Allow_Scrolling (Mode => False); -- we don't want stdscr to scroll! c := Key_Refresh; loop -- During shell-out, the user may have resized the window. Adjust -- the port size of the pad to accommodate this. Ncurses -- automatically resizes all of the normal windows to fit on the -- new screen. if top_x > Columns then top_x := Columns; end if; if portx > Columns then portx := Columns; end if; if top_y > Lines then top_y := Lines; end if; if porty > Lines then porty := Lines; end if; case c is when Key_Refresh | Character'Pos ('?') => if c = Key_Refresh then Erase; else -- '?' show_panner_legend := not show_panner_legend; end if; panner_legend (Lines - 4); panner_legend (Lines - 3); panner_legend (Lines - 2); panner_legend (Lines - 1); when Character'Pos ('t') => timing := not timing; if not timing then panner_legend (Lines - 1); end if; when Character'Pos ('s') => scrollers := not scrollers; -- Move the top-left corner of the pad, keeping the -- bottom-right corner fixed. when Character'Pos ('h') => -- increase-columns: move left edge to left if top_x = 0 then Beep; else panner_v_cleanup (top_y, top_x, porty); top_x := top_x - 1; end if; when Character'Pos ('j') => -- decrease-lines: move top-edge down if top_y >= porty then Beep; else if top_y /= 0 then panner_h_cleanup (top_y - 1, f (top_x), portx); end if; top_y := top_y + 1; end if; when Character'Pos ('k') => -- increase-lines: move top-edge up if top_y = 0 then Beep; else top_y := top_y - 1; panner_h_cleanup (top_y, top_x, portx); end if; when Character'Pos ('l') => -- decrease-columns: move left-edge to right if top_x >= portx then Beep; else if top_x /= 0 then panner_v_cleanup (f (top_y), top_x - 1, porty); end if; top_x := top_x + 1; end if; -- Move the bottom-right corner of the pad, keeping the -- top-left corner fixed. when Key_Insert_Char => -- increase-columns: move right-edge to right if portx >= pxmax or portx >= Columns then Beep; else panner_v_cleanup (f (top_y), portx - 1, porty); portx := portx + 1; -- C had ++portx instead of portx++, weird. end if; when Key_Insert_Line => -- increase-lines: move bottom-edge down if porty >= pymax or porty >= Lines then Beep; else panner_h_cleanup (porty - 1, f (top_x), portx); porty := porty + 1; end if; when Key_Delete_Char => -- decrease-columns: move bottom edge up if portx <= top_x then Beep; else portx := portx - 1; panner_v_cleanup (f (top_y), portx, porty); end if; when Key_Delete_Line => -- decrease-lines if porty <= top_y then Beep; else porty := porty - 1; panner_h_cleanup (porty, f (top_x), portx); end if; when Key_Cursor_Left => -- pan leftwards if basex > 0 then basex := basex - 1; else Beep; end if; when Key_Cursor_Right => -- pan rightwards -- if (basex + portx - (pymax > porty) < pxmax) if basex + portx - Column_Position (greater (pymax, porty)) < pxmax then -- if basex + portx < pxmax or -- (pymax > porty and basex + portx - 1 < pxmax) then basex := basex + 1; else Beep; end if; when Key_Cursor_Up => -- pan upwards if basey > 0 then basey := basey - 1; else Beep; end if; when Key_Cursor_Down => -- pan downwards -- same as if (basey + porty - (pxmax > portx) < pymax) if basey + porty - Line_Position (greater (pxmax, portx)) < pymax then -- if (basey + porty < pymax) or -- (pxmax > portx and basey + porty - 1 < pymax) then basey := basey + 1; else Beep; end if; when Character'Pos ('H') | Key_Home | Key_Find => basey := 0; when Character'Pos ('E') | Key_End | Key_Select => if pymax < porty then basey := 0; else basey := pymax - porty; end if; when others => Beep; end case; -- more writing off the screen. -- Interestingly, the exception is not handled if -- we put a block around this. -- delcare --begin if top_y /= 0 and top_x /= 0 then Add (Line => top_y - 1, Column => top_x - 1, Ch => ACS_Map (ACS_Upper_Left_Corner)); end if; if top_x /= 0 then do_v_line (top_y, top_x - 1, ACS_Map (ACS_Vertical_Line), porty); end if; if top_y /= 0 then do_h_line (top_y - 1, top_x, ACS_Map (ACS_Horizontal_Line), portx); end if; -- exception when Curses_Exception => null; end; -- in C was ... pxmax > portx - 1 if scrollers and pxmax >= portx then declare length : constant Column_Position := portx - top_x - 1; lowend, highend : Column_Position; begin -- Instead of using floats, I'll use integers only. lowend := top_x + (basex * length) / pxmax; highend := top_x + ((basex + length) * length) / pxmax; do_h_line (porty - 1, top_x, ACS_Map (ACS_Horizontal_Line), lowend); if highend < portx then Switch_Character_Attribute (Attr => (Reverse_Video => True, others => False), On => True); do_h_line (porty - 1, lowend, Blank2, highend + 1); Switch_Character_Attribute (Attr => (Reverse_Video => True, others => False), On => False); do_h_line (porty - 1, highend + 1, ACS_Map (ACS_Horizontal_Line), portx); end if; end; else do_h_line (porty - 1, top_x, ACS_Map (ACS_Horizontal_Line), portx); end if; if scrollers and pymax >= porty then declare length : constant Line_Position := porty - top_y - 1; lowend, highend : Line_Position; begin lowend := top_y + (basey * length) / pymax; highend := top_y + ((basey + length) * length) / pymax; do_v_line (top_y, portx - 1, ACS_Map (ACS_Vertical_Line), lowend); if highend < porty then Switch_Character_Attribute (Attr => (Reverse_Video => True, others => False), On => True); do_v_line (lowend, portx - 1, Blank2, highend + 1); Switch_Character_Attribute (Attr => (Reverse_Video => True, others => False), On => False); do_v_line (highend + 1, portx - 1, ACS_Map (ACS_Vertical_Line), porty); end if; end; else do_v_line (top_y, portx - 1, ACS_Map (ACS_Vertical_Line), porty); end if; if top_y /= 0 then Add (Line => top_y - 1, Column => portx - 1, Ch => ACS_Map (ACS_Upper_Right_Corner)); end if; if top_x /= 0 then Add (Line => porty - 1, Column => top_x - 1, Ch => ACS_Map (ACS_Lower_Left_Corner)); end if; declare begin -- Here is another place where it is possible -- to write to the corner of the screen. Add (Line => porty - 1, Column => portx - 1, Ch => ACS_Map (ACS_Lower_Right_Corner)); exception when Curses_Exception => null; end; before := gettime; Refresh_Without_Update; declare -- the C version allows the panel to have a zero height -- wich raise the exception begin Refresh_Without_Update ( pad, basey, basex, top_y, top_x, porty - Line_Position (greater (pxmax, portx)) - 1, portx - Column_Position (greater (pymax, porty)) - 1); exception when Curses_Exception => null; end; Update_Screen; if timing then declare s : String (1 .. 7); elapsed : Long_Float; begin after := gettime; elapsed := (Long_Float (after.seconds - before.seconds) + Long_Float (after.microseconds - before.microseconds) / 1.0e6); Move_Cursor (Line => Lines - 1, Column => Columns - 20); floatio.Put (s, elapsed, Aft => 3, Exp => 0); Add (Str => s); Refresh; end; end if; c := pgetc (pad); exit when c = Key_Exit; end loop; Allow_Scrolling (Mode => True); end panner; Gridsize : constant := 3; Gridcount : Integer := 0; Pad_High : constant Line_Count := 200; Pad_Wide : constant Column_Count := 200; panpad : Window := New_Pad (Pad_High, Pad_Wide); begin if panpad = Null_Window then Cannot ("cannot create requested pad"); return; end if; for i in 0 .. Pad_High - 1 loop for j in 0 .. Pad_Wide - 1 loop if i mod Gridsize = 0 and j mod Gridsize = 0 then if i = 0 or j = 0 then Add (panpad, '+'); else -- depends on ASCII? Add (panpad, Ch => Character'Val (Character'Pos ('A') + Gridcount mod 26)); Gridcount := Gridcount + 1; end if; elsif i mod Gridsize = 0 then Add (panpad, '-'); elsif j mod Gridsize = 0 then Add (panpad, '|'); else declare -- handle the write to the lower right corner error begin Add (panpad, ' '); exception when Curses_Exception => null; end; end if; end loop; end loop; panner_legend (Lines - 4); panner_legend (Lines - 3); panner_legend (Lines - 2); panner_legend (Lines - 1); Set_KeyPad_Mode (panpad, True); -- Make the pad (initially) narrow enough that a trace file won't wrap. -- We'll still be able to widen it during a test, since that's required -- for testing boundaries. panner (panpad, 2, 2, Lines - 5, Columns - 15, padgetch'Access); Delete (panpad); End_Windows; -- Hmm, Erase after End_Windows Erase; end ncurses2.demo_pad;

36.10767

79

0.47882

4d99e1c3b7e54c5a7393ed045a3257a3b9b042f7

1,024

adb

Ada

specs/ada/server/ike/tkmrpc-operation_handlers-ike-esa_reset.adb

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/server/ike/tkmrpc-operation_handlers-ike-esa_reset.adb

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/server/ike/tkmrpc-operation_handlers-ike-esa_reset.adb

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

with Tkmrpc.Servers.Ike; with Tkmrpc.Results; with Tkmrpc.Request.Ike.Esa_Reset.Convert; with Tkmrpc.Response.Ike.Esa_Reset.Convert; package body Tkmrpc.Operation_Handlers.Ike.Esa_Reset is ------------------------------------------------------------------------- procedure Handle (Req : Request.Data_Type; Res : out Response.Data_Type) is Specific_Req : Request.Ike.Esa_Reset.Request_Type; Specific_Res : Response.Ike.Esa_Reset.Response_Type; begin Specific_Res := Response.Ike.Esa_Reset.Null_Response; Specific_Req := Request.Ike.Esa_Reset.Convert.From_Request (S => Req); if Specific_Req.Data.Esa_Id'Valid then Servers.Ike.Esa_Reset (Result => Specific_Res.Header.Result, Esa_Id => Specific_Req.Data.Esa_Id); Res := Response.Ike.Esa_Reset.Convert.To_Response (S => Specific_Res); else Res.Header.Result := Results.Invalid_Parameter; end if; end Handle; end Tkmrpc.Operation_Handlers.Ike.Esa_Reset;

32

78

0.654297

1d7d1eb09f9220e0b481f5861a18563763b775fc

25,112

ads

Ada

tools/scitools/conf/understand/ada/ada12/a-cbhase.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada12/a-cbhase.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada12/a-cbhase.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . C O N T A I N E R S . B O U N D E D _ H A S H E D _ S E T S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-2012, 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. -- -- -- -- -- -- -- -- -- -- -- -- 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. -- ------------------------------------------------------------------------------ with Ada.Iterator_Interfaces; private with Ada.Containers.Hash_Tables; private with Ada.Streams; generic type Element_Type is private; with function Hash (Element : Element_Type) return Hash_Type; with function Equivalent_Elements (Left, Right : Element_Type) return Boolean; with function "=" (Left, Right : Element_Type) return Boolean is <>; package Ada.Containers.Bounded_Hashed_Sets is pragma Pure; pragma Remote_Types; type Set (Capacity : Count_Type; Modulus : Hash_Type) is tagged private with Constant_Indexing => Constant_Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type; pragma Preelaborable_Initialization (Set); type Cursor is private; pragma Preelaborable_Initialization (Cursor); Empty_Set : constant Set; -- Set objects declared without an initialization expression are -- initialized to the value Empty_Set. No_Element : constant Cursor; -- Cursor objects declared without an initialization expression are -- initialized to the value No_Element. function Has_Element (Position : Cursor) return Boolean; -- Equivalent to Position /= No_Element package Set_Iterator_Interfaces is new Ada.Iterator_Interfaces (Cursor, Has_Element); function "=" (Left, Right : Set) return Boolean; -- For each element in Left, set equality attempts to find the equal -- element in Right; if a search fails, then set equality immediately -- returns False. The search works by calling Hash to find the bucket in -- the Right set that corresponds to the Left element. If the bucket is -- non-empty, the search calls the generic formal element equality operator -- to compare the element (in Left) to the element of each node in the -- bucket (in Right); the search terminates when a matching node in the -- bucket is found, or the nodes in the bucket are exhausted. (Note that -- element equality is called here, not Equivalent_Elements. Set equality -- is the only operation in which element equality is used. Compare set -- equality to Equivalent_Sets, which does call Equivalent_Elements.) function Equivalent_Sets (Left, Right : Set) return Boolean; -- Similar to set equality, with the difference that the element in Left is -- compared to the elements in Right using the generic formal -- Equivalent_Elements operation instead of element equality. function To_Set (New_Item : Element_Type) return Set; -- Constructs a singleton set comprising New_Element. To_Set calls Hash to -- determine the bucket for New_Item. function Capacity (Container : Set) return Count_Type; -- Returns the current capacity of the set. Capacity is the maximum length -- before which rehashing in guaranteed not to occur. procedure Reserve_Capacity (Container : in out Set; Capacity : Count_Type); -- If the value of the Capacity actual parameter is less or equal to -- Container.Capacity, then the operation has no effect. Otherwise it -- raises Capacity_Error (as no expansion of capacity is possible for a -- bounded form). function Default_Modulus (Capacity : Count_Type) return Hash_Type; -- Returns a modulus value (hash table size) which is optimal for the -- specified capacity (which corresponds to the maximum number of items). function Length (Container : Set) return Count_Type; -- Returns the number of items in the set function Is_Empty (Container : Set) return Boolean; -- Equivalent to Length (Container) = 0 procedure Clear (Container : in out Set); -- Removes all of the items from the set function Element (Position : Cursor) return Element_Type; -- Returns the element of the node designated by the cursor procedure Replace_Element (Container : in out Set; Position : Cursor; New_Item : Element_Type); -- If New_Item is equivalent (as determined by calling Equivalent_Elements) -- to the element of the node designated by Position, then New_Element is -- assigned to that element. Otherwise, it calls Hash to determine the -- bucket for New_Item. If the bucket is not empty, then it calls -- Equivalent_Elements for each node in that bucket to determine whether -- New_Item is equivalent to an element in that bucket. If -- Equivalent_Elements returns True then Program_Error is raised (because -- an element may appear only once in the set); otherwise, New_Item is -- assigned to the node designated by Position, and the node is moved to -- its new bucket. procedure Query_Element (Position : Cursor; Process : not null access procedure (Element : Element_Type)); -- Calls Process with the element (having only a constant view) of the node -- designated by the cursor. type Constant_Reference_Type (Element : not null access constant Element_Type) is private with Implicit_Dereference => Element; function Constant_Reference (Container : aliased Set; Position : Cursor) return Constant_Reference_Type; procedure Assign (Target : in out Set; Source : Set); -- If Target denotes the same object as Source, then the operation has no -- effect. If the Target capacity is less than the Source length, then -- Assign raises Capacity_Error. Otherwise, Assign clears Target and then -- copies the (active) elements from Source to Target. function Copy (Source : Set; Capacity : Count_Type := 0; Modulus : Hash_Type := 0) return Set; -- Constructs a new set object whose elements correspond to Source. If the -- Capacity parameter is 0, then the capacity of the result is the same as -- the length of Source. If the Capacity parameter is equal or greater than -- the length of Source, then the capacity of the result is the specified -- value. Otherwise, Copy raises Capacity_Error. If the Modulus parameter -- is 0, then the modulus of the result is the value returned by a call to -- Default_Modulus with the capacity parameter determined as above; -- otherwise the modulus of the result is the specified value. procedure Move (Target : in out Set; Source : in out Set); -- Clears Target (if it's not empty), and then moves (not copies) the -- buckets array and nodes from Source to Target. procedure Insert (Container : in out Set; New_Item : Element_Type; Position : out Cursor; Inserted : out Boolean); -- Conditionally inserts New_Item into the set. If New_Item is already in -- the set, then Inserted returns False and Position designates the node -- containing the existing element (which is not modified). If New_Item is -- not already in the set, then Inserted returns True and Position -- designates the newly-inserted node containing New_Item. The search for -- an existing element works as follows. Hash is called to determine -- New_Item's bucket; if the bucket is non-empty, then Equivalent_Elements -- is called to compare New_Item to the element of each node in that -- bucket. If the bucket is empty, or there were no equivalent elements in -- the bucket, the search "fails" and the New_Item is inserted in the set -- (and Inserted returns True); otherwise, the search "succeeds" (and -- Inserted returns False). procedure Insert (Container : in out Set; New_Item : Element_Type); -- Attempts to insert New_Item into the set, performing the usual insertion -- search (which involves calling both Hash and Equivalent_Elements); if -- the search succeeds (New_Item is equivalent to an element already in the -- set, and so was not inserted), then this operation raises -- Constraint_Error. (This version of Insert is similar to Replace, but -- having the opposite exception behavior. It is intended for use when you -- want to assert that the item is not already in the set.) procedure Include (Container : in out Set; New_Item : Element_Type); -- Attempts to insert New_Item into the set. If an element equivalent to -- New_Item is already in the set (the insertion search succeeded, and -- hence New_Item was not inserted), then the value of New_Item is assigned -- to the existing element. (This insertion operation only raises an -- exception if cursor tampering occurs. It is intended for use when you -- want to insert the item in the set, and you don't care whether an -- equivalent element is already present.) procedure Replace (Container : in out Set; New_Item : Element_Type); -- Searches for New_Item in the set; if the search fails (because an -- equivalent element was not in the set), then it raises -- Constraint_Error. Otherwise, the existing element is assigned the value -- New_Item. (This is similar to Insert, but with the opposite exception -- behavior. It is intended for use when you want to assert that the item -- is already in the set.) procedure Exclude (Container : in out Set; Item : Element_Type); -- Searches for Item in the set, and if found, removes its node from the -- set and then deallocates it. The search works as follows. The operation -- calls Hash to determine the item's bucket; if the bucket is not empty, -- it calls Equivalent_Elements to compare Item to the element of each node -- in the bucket. (This is the deletion analog of Include. It is intended -- for use when you want to remove the item from the set, but don't care -- whether the item is already in the set.) procedure Delete (Container : in out Set; Item : Element_Type); -- Searches for Item in the set (which involves calling both Hash and -- Equivalent_Elements). If the search fails, then the operation raises -- Constraint_Error. Otherwise it removes the node from the set and then -- deallocates it. (This is the deletion analog of non-conditional -- Insert. It is intended for use when you want to assert that the item is -- already in the set.) procedure Delete (Container : in out Set; Position : in out Cursor); -- Removes the node designated by Position from the set, and then -- deallocates the node. The operation calls Hash to determine the bucket, -- and then compares Position to each node in the bucket until there's a -- match (it does not call Equivalent_Elements). procedure Union (Target : in out Set; Source : Set); -- Iterates over the Source set, and conditionally inserts each element -- into Target. function Union (Left, Right : Set) return Set; -- The operation first copies the Left set to the result, and then iterates -- over the Right set to conditionally insert each element into the result. function "or" (Left, Right : Set) return Set renames Union; procedure Intersection (Target : in out Set; Source : Set); -- Iterates over the Target set (calling First and Next), calling Find to -- determine whether the element is in Source. If an equivalent element is -- not found in Source, the element is deleted from Target. function Intersection (Left, Right : Set) return Set; -- Iterates over the Left set, calling Find to determine whether the -- element is in Right. If an equivalent element is found, it is inserted -- into the result set. function "and" (Left, Right : Set) return Set renames Intersection; procedure Difference (Target : in out Set; Source : Set); -- Iterates over the Source (calling First and Next), calling Find to -- determine whether the element is in Target. If an equivalent element is -- found, it is deleted from Target. function Difference (Left, Right : Set) return Set; -- Iterates over the Left set, calling Find to determine whether the -- element is in the Right set. If an equivalent element is not found, the -- element is inserted into the result set. function "-" (Left, Right : Set) return Set renames Difference; procedure Symmetric_Difference (Target : in out Set; Source : Set); -- The operation iterates over the Source set, searching for the element -- in Target (calling Hash and Equivalent_Elements). If an equivalent -- element is found, it is removed from Target; otherwise it is inserted -- into Target. function Symmetric_Difference (Left, Right : Set) return Set; -- The operation first iterates over the Left set. It calls Find to -- determine whether the element is in the Right set. If no equivalent -- element is found, the element from Left is inserted into the result. The -- operation then iterates over the Right set, to determine whether the -- element is in the Left set. If no equivalent element is found, the Right -- element is inserted into the result. function "xor" (Left, Right : Set) return Set renames Symmetric_Difference; function Overlap (Left, Right : Set) return Boolean; -- Iterates over the Left set (calling First and Next), calling Find to -- determine whether the element is in the Right set. If an equivalent -- element is found, the operation immediately returns True. The operation -- returns False if the iteration over Left terminates without finding any -- equivalent element in Right. function Is_Subset (Subset : Set; Of_Set : Set) return Boolean; -- Iterates over Subset (calling First and Next), calling Find to determine -- whether the element is in Of_Set. If no equivalent element is found in -- Of_Set, the operation immediately returns False. The operation returns -- True if the iteration over Subset terminates without finding an element -- not in Of_Set (that is, every element in Subset is equivalent to an -- element in Of_Set). function First (Container : Set) return Cursor; -- Returns a cursor that designates the first non-empty bucket, by -- searching from the beginning of the buckets array. function Next (Position : Cursor) return Cursor; -- Returns a cursor that designates the node that follows the current one -- designated by Position. If Position designates the last node in its -- bucket, the operation calls Hash to compute the index of this bucket, -- and searches the buckets array for the first non-empty bucket, starting -- from that index; otherwise, it simply follows the link to the next node -- in the same bucket. procedure Next (Position : in out Cursor); -- Equivalent to Position := Next (Position) function Find (Container : Set; Item : Element_Type) return Cursor; -- Searches for Item in the set. Find calls Hash to determine the item's -- bucket; if the bucket is not empty, it calls Equivalent_Elements to -- compare Item to each element in the bucket. If the search succeeds, Find -- returns a cursor designating the node containing the equivalent element; -- otherwise, it returns No_Element. function Contains (Container : Set; Item : Element_Type) return Boolean; -- Equivalent to Find (Container, Item) /= No_Element function Equivalent_Elements (Left, Right : Cursor) return Boolean; -- Returns the result of calling Equivalent_Elements with the elements of -- the nodes designated by cursors Left and Right. function Equivalent_Elements (Left : Cursor; Right : Element_Type) return Boolean; -- Returns the result of calling Equivalent_Elements with element of the -- node designated by Left and element Right. function Equivalent_Elements (Left : Element_Type; Right : Cursor) return Boolean; -- Returns the result of calling Equivalent_Elements with element Left and -- the element of the node designated by Right. procedure Iterate (Container : Set; Process : not null access procedure (Position : Cursor)); -- Calls Process for each node in the set function Iterate (Container : Set) return Set_Iterator_Interfaces.Forward_Iterator'Class; generic type Key_Type (<>) is private; with function Key (Element : Element_Type) return Key_Type; with function Hash (Key : Key_Type) return Hash_Type; with function Equivalent_Keys (Left, Right : Key_Type) return Boolean; package Generic_Keys is function Key (Position : Cursor) return Key_Type; -- Applies generic formal operation Key to the element of the node -- designated by Position. function Element (Container : Set; Key : Key_Type) return Element_Type; -- Searches (as per the key-based Find) for the node containing Key, and -- returns the associated element. procedure Replace (Container : in out Set; Key : Key_Type; New_Item : Element_Type); -- Searches (as per the key-based Find) for the node containing Key, and -- then replaces the element of that node (as per the element-based -- Replace_Element). procedure Exclude (Container : in out Set; Key : Key_Type); -- Searches for Key in the set, and if found, removes its node from the -- set and then deallocates it. The search works by first calling Hash -- (on Key) to determine the bucket; if the bucket is not empty, it -- calls Equivalent_Keys to compare parameter Key to the value of -- generic formal operation Key applied to element of each node in the -- bucket. procedure Delete (Container : in out Set; Key : Key_Type); -- Deletes the node containing Key as per Exclude, with the difference -- that Constraint_Error is raised if Key is not found. function Find (Container : Set; Key : Key_Type) return Cursor; -- Searches for the node containing Key, and returns a cursor -- designating the node. The search works by first calling Hash (on Key) -- to determine the bucket. If the bucket is not empty, the search -- compares Key to the element of each node in the bucket, and returns -- the matching node. The comparison itself works by applying the -- generic formal Key operation to the element of the node, and then -- calling generic formal operation Equivalent_Keys. function Contains (Container : Set; Key : Key_Type) return Boolean; -- Equivalent to Find (Container, Key) /= No_Element procedure Update_Element_Preserving_Key (Container : in out Set; Position : Cursor; Process : not null access procedure (Element : in out Element_Type)); -- Calls Process with the element of the node designated by Position, -- but with the restriction that the key-value of the element is not -- modified. The operation first makes a copy of the value returned by -- applying generic formal operation Key on the element of the node, and -- then calls Process with the element. The operation verifies that the -- key-part has not been modified by calling generic formal operation -- Equivalent_Keys to compare the saved key-value to the value returned -- by applying generic formal operation Key to the post-Process value of -- element. If the key values compare equal then the operation -- completes. Otherwise, the node is removed from the map and -- Program_Error is raised. type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference => Element; function Reference_Preserving_Key (Container : aliased in out Set; Position : Cursor) return Reference_Type; function Constant_Reference (Container : aliased Set; Key : Key_Type) return Constant_Reference_Type; function Reference_Preserving_Key (Container : aliased in out Set; Key : Key_Type) return Reference_Type; private type Reference_Type (Element : not null access Element_Type) is null record; use Ada.Streams; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Reference_Type); for Reference_Type'Read use Read; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Reference_Type); for Reference_Type'Write use Write; end Generic_Keys; private pragma Inline (Next); type Node_Type is record Element : aliased Element_Type; Next : Count_Type; end record; package HT_Types is new Hash_Tables.Generic_Bounded_Hash_Table_Types (Node_Type); type Set (Capacity : Count_Type; Modulus : Hash_Type) is new HT_Types.Hash_Table_Type (Capacity, Modulus) with null record; use HT_Types; use Ada.Streams; procedure Write (Stream : not null access Root_Stream_Type'Class; Container : Set); for Set'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Container : out Set); for Set'Read use Read; type Set_Access is access all Set; for Set_Access'Storage_Size use 0; -- Note: If a Cursor object has no explicit initialization expression, -- it must default initialize to the same value as constant No_Element. -- The Node component of type Cursor has scalar type Count_Type, so it -- requires an explicit initialization expression of its own declaration, -- in order for objects of record type Cursor to properly initialize. type Cursor is record Container : Set_Access; Node : Count_Type := 0; end record; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Cursor); for Cursor'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Cursor); for Cursor'Read use Read; type Constant_Reference_Type (Element : not null access constant Element_Type) is null record; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Constant_Reference_Type); for Constant_Reference_Type'Read use Read; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Constant_Reference_Type); for Constant_Reference_Type'Write use Write; Empty_Set : constant Set := (Hash_Table_Type with Capacity => 0, Modulus => 0); No_Element : constant Cursor := (Container => null, Node => 0); end Ada.Containers.Bounded_Hashed_Sets;

46.417745

79

0.669282

3185db7121672be1f91db6ee433a8547ce3a4cf8

653

ada

Ada

examples/Ada/rtmama.ada

dcramer/zguide

a07fe97c4c597e6401b4281ae07c3a156590f4c6

[ "Zed", "X11", "MIT" ]

2

2015-09-24T19:53:04.000Z

2015-11-06T10:22:53.000Z

examples/Ada/rtmama.ada

gaubert/zguide

e24c02481c47b129a37f261d1109140572f255f4

[ "Zed", "X11", "MIT" ]

null

examples/Ada/rtmama.ada

gaubert/zguide

e24c02481c47b129a37f261d1109140572f255f4

[ "Zed", "X11", "MIT" ]

null

No-one has translated the rtmama example into Ada yet. Be the first to create rtmama in Ada and get one free Internet! If you're the author of the Ada binding, this is a great way to get people to use 0MQ in Ada. To submit a new translation email it to [email protected]. Please: * Stick to identical functionality and naming used in examples so that readers can easily compare languages. * You MUST place your name as author in the examples so readers can contact you. * You MUST state in the email that you license your code under the MIT/X11 license. Subscribe to this list at http://lists.zeromq.org/mailman/listinfo/zeromq-dev.

46.642857

80

0.774885

1d75bde801b48a4ffa90e57ee724d1623b196276

1,097

ads

Ada

3-mid/physics/implement/bullet/source/thin/bullet_c-pointers.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

3-mid/physics/implement/bullet/source/thin/bullet_c-pointers.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

3-mid/physics/implement/bullet/source/thin/bullet_c-pointers.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

-- This file is generated by SWIG. Please do *not* modify by hand. -- with Interfaces.C; package bullet_c.Pointers is -- Shape_Pointer -- type Shape_Pointer is access all bullet_c.Shape; -- Shape_Pointers -- type Shape_Pointers is array (Interfaces.C .size_t range <>) of aliased bullet_c.Pointers.Shape_Pointer; -- Object_Pointer -- type Object_Pointer is access all bullet_c.Object; -- Object_Pointers -- type Object_Pointers is array (Interfaces.C .size_t range <>) of aliased bullet_c.Pointers.Object_Pointer; -- Joint_Pointer -- type Joint_Pointer is access all bullet_c.Joint; -- Joint_Pointers -- type Joint_Pointers is array (Interfaces.C .size_t range <>) of aliased bullet_c.Pointers.Joint_Pointer; -- Space_Pointer -- type Space_Pointer is access all bullet_c.Space; -- Space_Pointers -- type Space_Pointers is array (Interfaces.C .size_t range <>) of aliased bullet_c.Pointers.Space_Pointer; end bullet_c.Pointers;

21.096154

72

0.660893

50d1dd36e88c73735c804b25da5b32c0dbf1b0f3

656

ads

Ada

ga_lib/src/e3ga_utilities.ads

rogermc2/GA_Ada

0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be

[ "ISC" ]

3

2019-04-12T01:09:55.000Z

2021-02-24T18:17:32.000Z

ga_lib/src/e3ga_utilities.ads

rogermc2/GA_Ada

0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be

[ "ISC" ]

1

2020-08-12T10:10:25.000Z

ga_lib/src/e3ga_utilities.ads

rogermc2/GA_Ada

0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be

[ "ISC" ]

1

2019-04-12T01:14:15.000Z

with GA_Maths; with Multivectors; use Multivectors; package E3GA_Utilities is -- special exp() for 3D bivectors function exp (BV : Bivector) return Rotor; -- special log() for 3D rotors function log (R : Rotor) return Bivector; procedure Print_Rotor (Name : String; R : Rotor); -- procedure Print_Vector (Name : String; aVector : E2GA.Vector); -- procedure Print_Vector (Name : String; aVector : E3GA.Vector); procedure Rotor_To_Matrix (R : Rotor; M : out GA_Maths.GA_Matrix3); function Rotor_Vector_To_Vector (From_V1, To_V2 : Multivectors.M_Vector) return Rotor; end E3GA_Utilities;

34.526316

75

0.682927

0b8e34e9d82ba70b09d8b046ef4999c4ca12cc02

4,326

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/prj-pars.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/prj-pars.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/prj-pars.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P R J . P A R S -- -- -- -- B o d y -- -- -- -- Copyright (C) 2001-2006, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Exceptions; use Ada.Exceptions; with Opt; with Output; use Output; with Prj.Err; use Prj.Err; with Prj.Part; with Prj.Proc; with Prj.Tree; use Prj.Tree; package body Prj.Pars is ----------- -- Parse -- ----------- procedure Parse (In_Tree : Project_Tree_Ref; Project : out Project_Id; Project_File_Name : String; Packages_To_Check : String_List_Access := All_Packages; When_No_Sources : Error_Warning := Error) is Project_Node_Tree : constant Project_Node_Tree_Ref := new Project_Node_Tree_Data; Project_Node : Project_Node_Id := Empty_Node; The_Project : Project_Id := No_Project; Success : Boolean := True; begin Prj.Tree.Initialize (Project_Node_Tree); -- Parse the main project file into a tree Prj.Part.Parse (In_Tree => Project_Node_Tree, Project => Project_Node, Project_File_Name => Project_File_Name, Always_Errout_Finalize => False, Packages_To_Check => Packages_To_Check); -- If there were no error, process the tree if Project_Node /= Empty_Node then Prj.Proc.Process (In_Tree => In_Tree, Project => The_Project, Success => Success, From_Project_Node => Project_Node, From_Project_Node_Tree => Project_Node_Tree, Report_Error => null, Follow_Links => Opt.Follow_Links, When_No_Sources => When_No_Sources); Prj.Err.Finalize; if not Success then The_Project := No_Project; end if; end if; Project := The_Project; exception when X : others => -- Internal error Write_Line (Exception_Information (X)); Write_Str ("Exception "); Write_Str (Exception_Name (X)); Write_Line (" raised, while processing project file"); Project := No_Project; end Parse; ------------------- -- Set_Verbosity -- ------------------- procedure Set_Verbosity (To : Verbosity) is begin Current_Verbosity := To; end Set_Verbosity; end Prj.Pars;

39.327273

78

0.465557

31f11697cf38138c1ac5fc711de1755a981782d8

2,339

ads

Ada

src/main/resources/project-templates/stm32f_leds/src/button.ads

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

17

2018-10-03T21:31:03.000Z

2021-01-22T04:16:05.000Z

src/main/resources/project-templates/stm32f_leds/src/button.ads

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

20

2020-11-05T14:35:20.000Z

2022-01-13T15:59:33.000Z

src/main/resources/project-templates/stm32f_leds/src/button.ads

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

6

2020-10-08T15:57:06.000Z

2021-08-31T12:03:08.000Z

------------------------------------------------------------------------------ -- -- -- GNAT EXAMPLE -- -- -- -- Copyright (C) 2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This file provides declarations for the blue user button on the STM32F4 -- Discovery board from ST Microelectronics. package Button is pragma Elaborate_Body; type Directions is (Clockwise, Counterclockwise); function Current_Direction return Directions; end Button;

59.974359

78

0.451047

318718d51f67bf831258746cb6bf805862fd4815

19,396

adb

Ada

hex-modular_codec.adb

annexi-strayline/ASAP-HEX

cd792605321e5418de39bdbf0a454f1b37f2d503

[ "BSD-3-Clause" ]

1

2021-09-29T09:48:10.000Z

hex-modular_codec.adb

annexi-strayline/ASAP-HEX

cd792605321e5418de39bdbf0a454f1b37f2d503

[ "BSD-3-Clause" ]

null

hex-modular_codec.adb

annexi-strayline/ASAP-HEX

cd792605321e5418de39bdbf0a454f1b37f2d503

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Generic HEX String Handling Package -- -- -- -- ------------------------------------------------------------------------ -- -- -- -- Copyright (C) 2018-2019, ANNEXI-STRAYLINE Trans-Human Ltd. -- -- All rights reserved. -- -- -- -- Original Contributors: -- -- * Richard Wai, Ensi Martini, Aninda Poddar, Noshen Atashe -- -- (ANNEXI-STRAYLINE) -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- -- -- * Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A -- -- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ package body Hex.Modular_Codec with SPARK_Mode => On is pragma Assertion_Policy (Ignore); pragma Suppress (Division_Check); pragma Suppress (Index_Check); pragma Suppress (Length_Check); pragma Suppress (Overflow_Check); pragma Suppress (Range_Check); pragma Suppress (Tag_Check); -- Package fully verified -- -- Proof Support -- type Nibble is mod 2**4; subtype Encoded_Digits is String (1 .. Max_Nibbles); type Decoded_Digits is array (Positive range 1 .. Max_Nibbles) of Nibble; -- Decoded_Digits (like Encoded_Digits) is in Big Endian order, with -- the most significant nibble at position 'First. This greatly simplifies -- proof! -- Table-based Decode/Encode for Nibbles type Encode_Table is array (Nibble) of Hex_Character; Nibble_Encode_Lower: constant Encode_Table := (0 => '0', 1 => '1', 2 => '2', 3 => '3', 4 => '4', 5 => '5', 6 => '6', 7 => '7', 8 => '8', 9 => '9', 10 => 'a', 11 => 'b', 12 => 'c', 13 => 'd', 14 => 'e', 15 => 'f'); Nibble_Encode_Upper: constant Encode_Table := (0 => '0', 1 => '1', 2 => '2', 3 => '3', 4 => '4', 5 => '5', 6 => '6', 7 => '7', 8 => '8', 9 => '9', 10 => 'A', 11 => 'B', 12 => 'C', 13 => 'D', 14 => 'E', 15 => 'F'); function Nibble_Decode (Digit: in Hex_Character) return Nibble with Inline => True, Post => Nibble_Encode_Lower (Nibble_Decode'Result) = Digit or else Nibble_Encode_Upper (Nibble_Decode'Result) = Digit; ---------------------------------------------------------------------------- function Nibble_Decode (Digit: in Hex_Character) return Nibble is begin return (case Digit is when '0' => 0, when '1' => 1, when '2' => 2, when '3' => 3, when '4' => 4, when '5' => 5, when '6' => 6, when '7' => 7, when '8' => 8, when '9' => 9, when 'a' | 'A' => 16#A#, when 'b' | 'B' => 16#B#, when 'c' | 'C' => 16#C#, when 'd' | 'D' => 16#D#, when 'e' | 'E' => 16#E#, when 'f' | 'F' => 16#F#); end Nibble_Decode; ------------------ -- Batch_Decode -- ------------------ -- Decode each nibble for a String/Decoded_Digits pair procedure Batch_Decode (Input: in Encoded_Digits; Batch: in out Decoded_Digits) with Global => null, Depends => (Batch => (Input, Batch)), Pre => Valid_Hex_String (Input) and (for all N of Batch => N = 0), Post => (for all I in Input'Range => Batch(I) = Nibble_Decode (Input(I))) and (for all I in Input'Range => (Nibble_Encode_Lower(Batch(I)) = Input(I) or else Nibble_Encode_Upper(Batch(I)) = Input(I))) and (if (for all N of Batch => N = 0) then (for all I of Input => I = '0') else (for some I of Input => I /= '0')), Inline => True is Zero: Boolean := True with Ghost => True; begin for Digit in Input'Range loop Batch(Digit) := Nibble_Decode (Input (Digit)); Zero := Zero and (Input(Digit) = '0'); pragma Loop_Invariant (Valid_Hex_String (Input)); pragma Loop_Invariant (for all I in Input'First .. Digit => Batch(I) = Nibble_Decode (Input (I))); pragma Loop_Invariant (for all I in Input'First .. Digit => (Nibble_Encode_Lower(Batch(I)) = Input(I) or else Nibble_Encode_Upper(Batch(I)) = Input(I))); pragma Loop_Invariant (if Zero then ((for all N of Batch(Input'First .. Digit) => N = 0) and (for all I of Input(Input'First .. Digit) => I = '0')) else ((for some N of Batch(Input'First .. Digit) => N > 0) and (for some I of Input(Input'First .. Digit) => I /= '0'))); end loop; end Batch_Decode; ------------------ -- Batch_Encode -- ------------------ -- Decode each nibble for a String/Decoded_Digits pair procedure Batch_Encode (Batch : in Decoded_Digits; Output : in out Encoded_Digits; Use_Case: in Set_Case) with Global => null, Depends => (Output => (Batch, Output, Use_Case)), Pre => (for all Digit of Output => Digit = '0'), Post => Valid_Hex_String (Output) and (case Use_Case is when Lower_Case => (for all C of Output => C in '0' .. '9' | 'a' .. 'f'), when Upper_Case => (for all C of Output => C in '0' .. '9' | 'A' .. 'F')) and (if (for all N of Batch => N = 0) then (for all I of Output => I = '0') else ((for some N of Batch => N > 0) and (for some I of Output => I /= '0'))), Inline => True is Zero: Boolean := True with Ghost => True; begin for Digit in Batch'Range loop Zero := (Zero and Batch(Digit) = 0); case Use_Case is when Upper_Case => Output(Digit) := Nibble_Encode_Upper (Batch (Digit)); when Lower_Case => Output(Digit) := Nibble_Encode_Lower (Batch (Digit)); end case; pragma Loop_Invariant (Valid_Hex_String (Output)); pragma Loop_Invariant (if Zero then (for all C of Output => C = '0') and (for all I in Batch'First .. Digit => Batch(I) = 0) else (for some C of Output => C /= '0') and (for some N of Batch => N > 0)); pragma Loop_Invariant (case Use_Case is when Lower_Case => (for all C of Output => C in '0' .. '9' | 'a' .. 'f'), when Upper_Case => (for all C of Output => C in '0' .. '9' | 'A' .. 'F')); pragma Loop_Invariant (for all I in Batch'First .. Digit => Batch(I) = Nibble_Decode (Output (I))); end loop; end Batch_Encode; ------------------- -- Batch_Combine -- ------------------- -- Convert a given Decoded_Digits set into a Modular_Value function Batch_Combine (Batch: Decoded_Digits) return Modular_Value with Global => null, Pre => Batch'Length > 1, Post => (if Batch_Combine'Result = 0 then (for all N of Batch => N = 0) else (for some N of Batch => N > 0)), Inline => True is Value_Tracker: array (Batch'Range) of Modular_Value := (others => 0) with Ghost => True; begin pragma Assert (for all N of Batch => N in 0 .. 16#F#); return Value: Modular_Value := Modular_Value (Batch(Batch'First)) do Value_Tracker(Batch'First) := Modular_Value (Batch(Batch'First)); for I in Batch'First + 1 .. Batch'Last loop Value := Value * 16#10# + Modular_Value (Batch(I)); Value_Tracker(I) := Value; pragma Loop_Invariant (Value = Value_Tracker(I)); pragma Loop_Invariant (Modular_Value (Batch(I)) in 16#0# .. 16#F#); pragma Loop_Invariant (for all K in Batch'First + 1 .. I => (Value_Tracker(K) = (Value_Tracker(K - 1) * 16#10#) + Modular_Value (Batch(K)))); pragma Loop_Invariant (if Value = 0 then (for all K in Batch'First .. I => Batch(K) = 0)); pragma Loop_Invariant (if Value > 0 then (for some K in Batch'First .. I => Batch(K) > 0)); end loop; end return; end Batch_Combine; ------------------ -- Batch_Expand -- ------------------ -- Convert a given Modular_Value to a batch of Decoded_Digits function Batch_Expand (Value: Modular_Value) return Decoded_Digits with Global => null, Post => (if Value = 0 then (for all N of Batch_Expand'Result => N = 0) else (for some N of Batch_Expand'Result => N > 0)), Inline => True is Dissipator: Modular_Value := Value; begin return Batch: Decoded_Digits do for I in reverse Batch'Range loop Batch(I) := Nibble (Dissipator and 16#F#); Dissipator := Dissipator / 16#10#; end loop; end return; end Batch_Expand; -- -- Package Interface -- ------------ -- Decode -- ------------ procedure Decode (Input: in String; Value: out Modular_Value) is Temp_Decoded: Decoded_Digits := (others => 0); Input_Offset: constant Natural := Input'First - 1 with Ghost => True; -- How much to subtract to get the "start at 1" equivilent. -- This is used to compare each position of Input with -- Temporary_Decoded begin -- Precondition requires that Input is no longer than -- the maximum length, but it may be shorter if Input'Length < Max_Nibbles then -- We need to make an intermediate to fill it in declare Temp_Encoded: Encoded_Digits := (others => '0'); MSN: constant Positive := Temp_Encoded'Last - Input'Length + 1; begin Temp_Encoded (MSN .. Temp_Encoded'Last) := Input; pragma Assert (Temp_Encoded(MSN .. Temp_Encoded'Last) = Input and (for all I of Temp_Encoded(Temp_Encoded'First .. MSN - 1) => I = '0')); Batch_Decode (Input => Temp_Encoded, Batch => Temp_Decoded); pragma Assert (for all I in Temp_Encoded'Range => Temp_Decoded(I) = Nibble_Decode (Temp_Encoded(I))); Value := Batch_Combine (Temp_Decoded); pragma Assert (if Value = 0 then (for all I of Temp_Encoded => I = '0') else (for some I of Temp_Encoded => I /= '0') and Value > 0); end; else pragma Assert (Input'Length in 1 .. Max_Nibbles); Batch_Decode (Input => Input, Batch => Temp_Decoded); pragma Assert (for all I in Input'Range => Temp_Decoded(I - Input_Offset) = Nibble_Decode (Input(I))); Value := Batch_Combine (Temp_Decoded); pragma Assert (if Value = 0 then (for all I of Input => I = '0') else (for some I of Input => I /= '0') and Value > 0); end if; end Decode; ---------------------------------------------------------------------------- function Decode (Input: String) return Modular_Value is begin return Value: Modular_Value do Decode (Input => Input, Value => Value); end return; end Decode; ------------ -- Encode -- ------------ procedure Encode (Value : in Modular_Value; Buffer : out String; Use_Case: in Set_Case := Lower_Case) is Temp_Encoded: Encoded_Digits := (others => '0'); Temp_Decoded: Decoded_Digits := Batch_Expand (Value); begin Batch_Encode (Batch => Temp_Decoded, Output => Temp_Encoded, Use_Case => Use_Case); pragma Assert (if Value = 0 then (for all I of Temp_Encoded => I = '0') else (for some I of Temp_Encoded => I /= '0')); -- Precondition says buffer is at least as long as Temp_Encoded if Buffer'Length > Temp_Encoded'Length then -- Zero extend Buffer := (others => '0'); Buffer(Buffer'Last - Temp_Encoded'Length + 1 .. Buffer'Last) := Temp_Encoded; pragma Assert (Buffer(Buffer'Last - Temp_Encoded'Length + 1 .. Buffer'Last) = Temp_Encoded); pragma Assert (if Value = 0 then (for all Digit of Buffer => Digit = '0') else (for some Digit of Buffer => Digit /= '0')); else Buffer := Temp_Encoded; pragma Assert (Buffer = Temp_Encoded); pragma Assert (if Value = 0 then (for all Digit of Buffer => Digit = '0') else (for some Digit of Buffer => Digit /= '0')); end if; pragma Assert (Valid_Hex_String (Buffer)); pragma Assert ((if Value = 0 then (for all Digit of Buffer => Digit = '0') else (for some Digit of Buffer => Digit /= '0'))); pragma Assert ((case Use_Case is when Lower_Case => (for all Digit of Buffer => Digit in '0' .. '9' | 'a' .. 'f'), when Upper_Case => (for all Digit of Buffer => Digit in '0' .. '9' | 'A' .. 'F'))); pragma Assert ((if Buffer'Length > Max_Nibbles then (for all I in Buffer'First .. (Buffer'Last - Max_Nibbles) => Buffer(I) = '0'))); end Encode; ---------------------------------------------------------------------------- function Encode (Value: Modular_Value; Use_Case: Set_Case := Lower_Case) return String is Buffer: String (1 .. Max_Nibbles); -- An intermediate buffer that can handle the largest possible value. -- We will trim all zeros from the most significant portion before -- returning Start: Positive := Buffer'First; begin Encode (Value => Value, Buffer => Buffer, Use_Case => Use_Case); pragma Assert (if Value = 0 then (for all Digit of Buffer => Digit = '0') else (for some Digit of Buffer => Digit /= '0')); for I in Buffer'Range loop if Buffer(I) /= '0' then Start := I; exit; end if; end loop; return Buffer(Start .. Buffer'Last); end Encode; end Hex.Modular_Codec;

37.157088

79

0.434368

1d77b973d04a642cac5a485e7b37f7c2e4b7402a

9,375

adb

Ada

source/amf/utp/amf-internals-utp_coding_rules.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/utp/amf-internals-utp_coding_rules.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/utp/amf-internals-utp_coding_rules.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <[email protected]> -- -- 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.Helpers; with AMF.Internals.Tables.Utp_Attributes; with AMF.UML.Namespaces; with AMF.UML.Properties; with AMF.UML.Value_Specifications; with AMF.Visitors.Utp_Iterators; with AMF.Visitors.Utp_Visitors; with League.Strings.Internals; package body AMF.Internals.Utp_Coding_Rules is ---------------------------------- -- Get_Base_Value_Specification -- ---------------------------------- overriding function Get_Base_Value_Specification (Self : not null access constant Utp_Coding_Rule_Proxy) return AMF.UML.Value_Specifications.UML_Value_Specification_Access is begin return AMF.UML.Value_Specifications.UML_Value_Specification_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.Utp_Attributes.Internal_Get_Base_Value_Specification (Self.Element))); end Get_Base_Value_Specification; ---------------------------------- -- Set_Base_Value_Specification -- ---------------------------------- overriding procedure Set_Base_Value_Specification (Self : not null access Utp_Coding_Rule_Proxy; To : AMF.UML.Value_Specifications.UML_Value_Specification_Access) is begin AMF.Internals.Tables.Utp_Attributes.Internal_Set_Base_Value_Specification (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Base_Value_Specification; ------------------------ -- Get_Base_Namespace -- ------------------------ overriding function Get_Base_Namespace (Self : not null access constant Utp_Coding_Rule_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.Utp_Attributes.Internal_Get_Base_Namespace (Self.Element))); end Get_Base_Namespace; ------------------------ -- Set_Base_Namespace -- ------------------------ overriding procedure Set_Base_Namespace (Self : not null access Utp_Coding_Rule_Proxy; To : AMF.UML.Namespaces.UML_Namespace_Access) is begin AMF.Internals.Tables.Utp_Attributes.Internal_Set_Base_Namespace (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Base_Namespace; ----------------------- -- Get_Base_Property -- ----------------------- overriding function Get_Base_Property (Self : not null access constant Utp_Coding_Rule_Proxy) return AMF.UML.Properties.UML_Property_Access is begin return AMF.UML.Properties.UML_Property_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.Utp_Attributes.Internal_Get_Base_Property (Self.Element))); end Get_Base_Property; ----------------------- -- Set_Base_Property -- ----------------------- overriding procedure Set_Base_Property (Self : not null access Utp_Coding_Rule_Proxy; To : AMF.UML.Properties.UML_Property_Access) is begin AMF.Internals.Tables.Utp_Attributes.Internal_Set_Base_Property (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Base_Property; ---------------- -- Get_Coding -- ---------------- overriding function Get_Coding (Self : not null access constant Utp_Coding_Rule_Proxy) return League.Strings.Universal_String is begin null; return League.Strings.Internals.Create (AMF.Internals.Tables.Utp_Attributes.Internal_Get_Coding (Self.Element)); end Get_Coding; ---------------- -- Set_Coding -- ---------------- overriding procedure Set_Coding (Self : not null access Utp_Coding_Rule_Proxy; To : League.Strings.Universal_String) is begin AMF.Internals.Tables.Utp_Attributes.Internal_Set_Coding (Self.Element, League.Strings.Internals.Internal (To)); end Set_Coding; ------------------- -- Enter_Element -- ------------------- overriding procedure Enter_Element (Self : not null access constant Utp_Coding_Rule_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.Utp_Visitors.Utp_Visitor'Class then AMF.Visitors.Utp_Visitors.Utp_Visitor'Class (Visitor).Enter_Coding_Rule (AMF.Utp.Coding_Rules.Utp_Coding_Rule_Access (Self), Control); end if; end Enter_Element; ------------------- -- Leave_Element -- ------------------- overriding procedure Leave_Element (Self : not null access constant Utp_Coding_Rule_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.Utp_Visitors.Utp_Visitor'Class then AMF.Visitors.Utp_Visitors.Utp_Visitor'Class (Visitor).Leave_Coding_Rule (AMF.Utp.Coding_Rules.Utp_Coding_Rule_Access (Self), Control); end if; end Leave_Element; ------------------- -- Visit_Element -- ------------------- overriding procedure Visit_Element (Self : not null access constant Utp_Coding_Rule_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.Utp_Iterators.Utp_Iterator'Class then AMF.Visitors.Utp_Iterators.Utp_Iterator'Class (Iterator).Visit_Coding_Rule (Visitor, AMF.Utp.Coding_Rules.Utp_Coding_Rule_Access (Self), Control); end if; end Visit_Element; end AMF.Internals.Utp_Coding_Rules;

41.482301

85

0.551253

a1ea335d179695c3c32a30a3d9c8e0c8859cf0a6

20,816

adb

Ada

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d/conv2d/hls_target/.autopilot/db/linebuffer_1.sched.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

1

2020-06-18T16:51:39.000Z

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d/conv2d/hls_target/.autopilot/db/linebuffer_1.sched.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

null

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d/conv2d/hls_target/.autopilot/db/linebuffer_1.sched.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

1

2020-03-18T00:43:22.000Z

<?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>linebuffer_1</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></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_axi_stream.V.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</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></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in_axi_stream.V.last.V</originalName> <rtlName></rtlName> <coreName></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>out_stream_V_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_stream.V.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>288</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>4</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_4"> <Value> <Obj> <type>0</type> <id>7</id> <name>in_stream_V_value_V</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>545</lineNumber> <contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</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>../../../lib_files/Linebuffer.h</first> <second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second> </first> <second>545</second> </item> </second> </item> </inlineStackInfo> <originalName>in_stream.V.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>16</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>11</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>4</count> <item_version>0</item_version> <item>18</item> <item>19</item> <item>20</item> <item>21</item> </oprand_edges> <opcode>call</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>12</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>556</lineNumber> <contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&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_32_shifts/conv2d</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 int&gt;</second> </first> <second>556</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>23</item> <item>24</item> <item>25</item> <item>107</item> <item>108</item> </oprand_edges> <opcode>call</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>13</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>557</lineNumber> <contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&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_32_shifts/conv2d</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 int&gt;</second> </first> <second>557</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>3</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_8"> <Value> <Obj> <type>2</type> <id>15</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="_9"> <Value> <Obj> <type>2</type> <id>17</id> <name>linebuffer_Loop_1_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:linebuffer_Loop_1_pr></content> </item> <item class_id_reference="16" object_id="_10"> <Value> <Obj> <type>2</type> <id>22</id> <name>linebuffer</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:linebuffer></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="_11"> <Obj> <type>3</type> <id>14</id> <name>linebuffer.1</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>7</item> <item>11</item> <item>12</item> <item>13</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_12"> <id>16</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>7</sink_obj> </item> <item class_id_reference="20" object_id="_13"> <id>18</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_14"> <id>19</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_15"> <id>20</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_16"> <id>21</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_17"> <id>23</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_18"> <id>24</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_19"> <id>25</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_20"> <id>107</id> <edge_type>4</edge_type> <source_obj>11</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_21"> <id>108</id> <edge_type>4</edge_type> <source_obj>11</source_obj> <sink_obj>12</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="_22"> <mId>1</mId> <mTag>linebuffer.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>14</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>2077921</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>1</mIsDfPipe> <mDfPipe class_id="23" tracking_level="1" version="0" object_id="_23"> <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>2</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_24"> <type>0</type> <name>linebuffer_Loop_1_pr_U0</name> <ssdmobj_id>11</ssdmobj_id> <pins 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="_25"> <port class_id="29" tracking_level="1" version="0" object_id="_26"> <name>in_axi_stream_V_value_V</name> <dir>3</dir> <type>0</type> </port> <inst class_id="30" tracking_level="1" version="0" object_id="_27"> <type>0</type> <name>linebuffer_Loop_1_pr_U0</name> <ssdmobj_id>11</ssdmobj_id> </inst> </item> <item class_id_reference="28" object_id="_28"> <port class_id_reference="29" object_id="_29"> <name>in_axi_stream_V_last_V</name> <dir>3</dir> <type>0</type> </port> <inst class_id_reference="30" object_id_reference="_27"></inst> </item> <item class_id_reference="28" object_id="_30"> <port class_id_reference="29" object_id="_31"> <name>in_stream_V_value_V</name> <dir>0</dir> <type>1</type> </port> <inst class_id_reference="30" object_id_reference="_27"></inst> </item> </pins> </item> <item class_id_reference="26" object_id="_32"> <type>0</type> <name>linebuffer_U0</name> <ssdmobj_id>12</ssdmobj_id> <pins> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_33"> <port class_id_reference="29" object_id="_34"> <name>in_stream_V_value_V</name> <dir>0</dir> <type>0</type> </port> <inst class_id_reference="30" object_id="_35"> <type>0</type> <name>linebuffer_U0</name> <ssdmobj_id>12</ssdmobj_id> </inst> </item> <item class_id_reference="28" object_id="_36"> <port class_id_reference="29" object_id="_37"> <name>out_stream_V_value_V</name> <dir>0</dir> <type>1</type> </port> <inst class_id_reference="30" object_id_reference="_35"></inst> </item> </pins> </item> </process_list> <channel_list 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="_38"> <type>1</type> <name>in_stream_V_value_V</name> <ssdmobj_id>7</ssdmobj_id> <ctype>0</ctype> <depth>1</depth> <bitwidth>32</bitwidth> <source class_id_reference="28" object_id="_39"> <port class_id_reference="29" object_id="_40"> <name>in</name> <dir>3</dir> <type>0</type> </port> <inst class_id_reference="30" object_id_reference="_27"></inst> </source> <sink class_id_reference="28" object_id="_41"> <port class_id_reference="29" object_id="_42"> <name>out</name> <dir>3</dir> <type>1</type> </port> <inst class_id_reference="30" object_id_reference="_35"></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="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="36" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="37" tracking_level="0" version="0"> <first>7</first> <second class_id="38" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>11</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>12</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>13</first> <second> <first>3</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="39" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>14</first> <second class_id="41" tracking_level="0" version="0"> <first>0</first> <second>3</second> </second> </item> </bblk_ent_exit> <regions class_id="42" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="43" tracking_level="1" version="0" object_id="_43"> <region_name>linebuffer.1</region_name> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>14</item> </basic_blocks> <nodes> <count>10</count> <item_version>0</item_version> <item>4</item> <item>5</item> <item>6</item> <item>7</item> <item>8</item> <item>9</item> <item>10</item> <item>11</item> <item>12</item> <item>13</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="44" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="45" 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="46" 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="47" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="48" 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>

30.037518

136

0.614864

0b193b810c816d0a38cfdd177b7b6a3be17440ce

4,298

ads

Ada

src/asf-validators-texts.ads

jquorning/ada-asf

ddc697c5dfa4e22c57c6958f4cff27e14d02ce98

[ "Apache-2.0" ]

12

2015-01-18T23:02:20.000Z

2022-03-25T15:30:30.000Z

src/asf-validators-texts.ads

jquorning/ada-asf

ddc697c5dfa4e22c57c6958f4cff27e14d02ce98

[ "Apache-2.0" ]

3

2021-01-06T09:44:02.000Z

2022-02-04T20:20:53.000Z

src/asf-validators-texts.ads

jquorning/ada-asf

ddc697c5dfa4e22c57c6958f4cff27e14d02ce98

[ "Apache-2.0" ]

4

2016-04-12T05:29:00.000Z

2022-01-24T23:53:59.000Z

----------------------------------------------------------------------- -- asf-validators-texts -- ASF Texts Validators -- Copyright (C) 2011, 2020 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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.Regpat; with EL.Objects; with ASF.Components.Base; with ASF.Contexts.Faces; -- == Length validator == -- The `ASF.Validators.Texts.Length_Validator` implements the validator for the -- `<f:validateLength>` XHTML validator. -- -- == Regex validator == -- The `ASF.Validators.Texts.Regex_Validator` implements the validator for the -- `<f:validateRegex>` XHTML validator. -- package ASF.Validators.Texts is MAXIMUM_MESSAGE_ID : constant String := "asf.validators.length.maximum"; MINIMUM_MESSAGE_ID : constant String := "asf.validators.length.minimum"; REGEX_MESSAGE_ID : constant String := "asf.validators.regex"; -- ------------------------------ -- Length_Validator -- ------------------------------ -- The Length_Validator implements the length validator whereby the given -- value must have a minimum length and a maximum length. type Length_Validator is new Validator with private; type Length_Validator_Access is access all Length_Validator'Class; -- Create a length validator. function Create_Length_Validator (Minimum : in Natural; Maximum : in Natural) return Validator_Access; -- Verify that the value's length is between the validator minimum and maximum -- boundaries. -- If some error are found, the procedure should create a FacesMessage -- describing the problem and add that message to the current faces context. -- The procedure can examine the state and modify the component tree. -- It must raise the Invalid_Value exception if the value is not valid. procedure Validate (Valid : in Length_Validator; Context : in out ASF.Contexts.Faces.Faces_Context'Class; Component : in out ASF.Components.Base.UIComponent'Class; Value : in EL.Objects.Object); -- ------------------------------ -- Regex_Validator -- ------------------------------ -- The Regex_Validator implements the regular expression validator -- whereby the given value must match a regular expression. type Regex_Validator (Size : GNAT.Regpat.Program_Size) is new Validator with private; type Regex_Validator_Access is access all Regex_Validator'Class; -- Create a regex validator. function Create_Regex_Validator (Pattern : in GNAT.Regpat.Pattern_Matcher) return Validator_Access; -- Verify that the value matches the regular expression. -- If some error are found, the procedure should create a FacesMessage -- describing the problem and add that message to the current faces context. -- The procedure can examine the state and modify the component tree. -- It must raise the Invalid_Value exception if the value is not valid. procedure Validate (Valid : in Regex_Validator; Context : in out ASF.Contexts.Faces.Faces_Context'Class; Component : in out ASF.Components.Base.UIComponent'Class; Value : in EL.Objects.Object); private type Length_Validator is new Validator with record Minimum : Natural; Maximum : Natural; end record; type Regex_Validator (Size : GNAT.Regpat.Program_Size) is new Validator with record Pattern : GNAT.Regpat.Pattern_Matcher (Size); end record; end ASF.Validators.Texts;

45.723404

88

0.653094

062ad186fec86af900a7e1d235ed2a3c3e782779

9,120

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/g-socthi.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/g-socthi.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/g-socthi.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . S O C K E T S . T H I N -- -- -- -- S p e c -- -- -- -- Copyright (C) 2001-2013, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 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 target dependent thin interface to the sockets -- layer for use by the GNAT.Sockets package (g-socket.ads). This package -- should not be directly with'ed by an applications program. -- This is the default version with Interfaces.C; with GNAT.OS_Lib; with GNAT.Sockets.Thin_Common; with System; with System.CRTL; package GNAT.Sockets.Thin is -- This package is intended for hosts implementing BSD sockets with a -- standard interface. It will be used as a default for all the platforms -- that do not have a specific version of this file. use Thin_Common; package C renames Interfaces.C; use type System.CRTL.ssize_t; function Socket_Errno return Integer renames GNAT.OS_Lib.Errno; -- Returns last socket error number function Socket_Error_Message (Errno : Integer) return String; -- Returns the error message string for the error number Errno. If Errno is -- not known, returns "Unknown system error". function Host_Errno return Integer; pragma Import (C, Host_Errno, "__gnat_get_h_errno"); -- Returns last host error number package Host_Error_Messages is function Host_Error_Message (H_Errno : Integer) return String; -- Returns the error message string for the host error number H_Errno. -- If H_Errno is not known, returns "Unknown system error". end Host_Error_Messages; -------------------------------- -- Standard library functions -- -------------------------------- function C_Accept (S : C.int; Addr : System.Address; Addrlen : not null access C.int) return C.int; function C_Bind (S : C.int; Name : System.Address; Namelen : C.int) return C.int; function C_Close (Fd : C.int) return C.int; function C_Connect (S : C.int; Name : System.Address; Namelen : C.int) return C.int; function C_Gethostname (Name : System.Address; Namelen : C.int) return C.int; function C_Getpeername (S : C.int; Name : System.Address; Namelen : not null access C.int) return C.int; function C_Getsockname (S : C.int; Name : System.Address; Namelen : not null access C.int) return C.int; function C_Getsockopt (S : C.int; Level : C.int; Optname : C.int; Optval : System.Address; Optlen : not null access C.int) return C.int; function Socket_Ioctl (S : C.int; Req : SOSC.IOCTL_Req_T; Arg : access C.int) return C.int; function C_Listen (S : C.int; Backlog : C.int) return C.int; function C_Recv (S : C.int; Msg : System.Address; Len : C.int; Flags : C.int) return C.int; function C_Recvfrom (S : C.int; Msg : System.Address; Len : C.int; Flags : C.int; From : System.Address; Fromlen : not null access C.int) return C.int; function C_Recvmsg (S : C.int; Msg : System.Address; Flags : C.int) return System.CRTL.ssize_t; function C_Select (Nfds : C.int; Readfds : access Fd_Set; Writefds : access Fd_Set; Exceptfds : access Fd_Set; Timeout : Timeval_Access) return C.int; function C_Sendmsg (S : C.int; Msg : System.Address; Flags : C.int) return System.CRTL.ssize_t; function C_Sendto (S : C.int; Msg : System.Address; Len : C.int; Flags : C.int; To : System.Address; Tolen : C.int) return C.int; function C_Setsockopt (S : C.int; Level : C.int; Optname : C.int; Optval : System.Address; Optlen : C.int) return C.int; function C_Shutdown (S : C.int; How : C.int) return C.int; function C_Socket (Domain : C.int; Typ : C.int; Protocol : C.int) return C.int; function C_System (Command : System.Address) return C.int; ------------------------------------------------------- -- Signalling file descriptors for selector abortion -- ------------------------------------------------------- package Signalling_Fds is function Create (Fds : not null access Fd_Pair) return C.int; pragma Convention (C, Create); -- Create a pair of connected descriptors suitable for use with C_Select -- (used for signalling in Selector objects). function Read (Rsig : C.int) return C.int; pragma Convention (C, Read); -- Read one byte of data from rsig, the read end of a pair of signalling -- fds created by Create_Signalling_Fds. function Write (Wsig : C.int) return C.int; pragma Convention (C, Write); -- Write one byte of data to wsig, the write end of a pair of signalling -- fds created by Create_Signalling_Fds. procedure Close (Sig : C.int); pragma Convention (C, Close); -- Close one end of a pair of signalling fds (ignoring any error) end Signalling_Fds; ------------------------------------------- -- Nonreentrant network databases access -- ------------------------------------------- -- The following are used only on systems that have nonreentrant -- getXXXbyYYY functions, and do NOT have corresponding getXXXbyYYY_ -- functions. Currently, LynxOS is the only such system. function Nonreentrant_Gethostbyname (Name : C.char_array) return Hostent_Access; function Nonreentrant_Gethostbyaddr (Addr : System.Address; Addr_Len : C.int; Addr_Type : C.int) return Hostent_Access; function Nonreentrant_Getservbyname (Name : C.char_array; Proto : C.char_array) return Servent_Access; function Nonreentrant_Getservbyport (Port : C.int; Proto : C.char_array) return Servent_Access; procedure Initialize; procedure Finalize; private pragma Import (C, C_Bind, "bind"); pragma Import (C, C_Close, "close"); pragma Import (C, C_Gethostname, "gethostname"); pragma Import (C, C_Getpeername, "getpeername"); pragma Import (C, C_Getsockname, "getsockname"); pragma Import (C, C_Getsockopt, "getsockopt"); pragma Import (C, C_Listen, "listen"); pragma Import (C, C_Select, "select"); pragma Import (C, C_Setsockopt, "setsockopt"); pragma Import (C, C_Shutdown, "shutdown"); pragma Import (C, C_System, "system"); pragma Import (C, Nonreentrant_Gethostbyname, "gethostbyname"); pragma Import (C, Nonreentrant_Gethostbyaddr, "gethostbyaddr"); pragma Import (C, Nonreentrant_Getservbyname, "getservbyname"); pragma Import (C, Nonreentrant_Getservbyport, "getservbyport"); end GNAT.Sockets.Thin;

35.076923

79

0.550219

5016e5c81756f4348c7627c4a5ba147dd3622577

1,103

adb

Ada

day14/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

3

2020-12-26T23:44:33.000Z

2021-12-06T16:00:54.000Z

day14/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

null

day14/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

null

with AUnit.Assertions; use AUnit.Assertions; package body Day.Test is procedure Test_Part1 (T : in out AUnit.Test_Cases.Test_Case'Class) is pragma Unreferenced (T); p : constant Program := load_file("test1.txt"); t1 : constant Long_Integer := sum_memory(p); begin Assert(t1 = 165, "Wrong number, expected 165, got" & Long_Integer'IMAGE(t1)); end Test_Part1; procedure Test_Part2 (T : in out AUnit.Test_Cases.Test_Case'Class) is pragma Unreferenced (T); p : constant Program := load_file("test2.txt"); t1 : constant Long_Integer := sum_memory_v2(p); begin Assert(t1 = 208, "Wrong number, expected 208, got" & Long_Integer'IMAGE(t1)); end Test_Part2; function Name (T : Test) return AUnit.Message_String is pragma Unreferenced (T); begin return AUnit.Format ("Test Day package"); end Name; procedure Register_Tests (T : in out Test) is use AUnit.Test_Cases.Registration; begin Register_Routine (T, Test_Part1'Access, "Test Part 1"); Register_Routine (T, Test_Part2'Access, "Test Part 2"); end Register_Tests; end Day.Test;

31.514286

81

0.702629

4d6b0d208361d4dedda0019923fee919ad0ed7ec

3,969

ads

Ada

test/standard_application.ads

Jellix/open_weather_map_api

fa3484b361411b9362500a25e36d63d4bb6dbca3

[ "WTFPL" ]

1

2020-09-04T18:31:05.000Z

test/standard_application.ads

Jellix/open_weather_map_api

fa3484b361411b9362500a25e36d63d4bb6dbca3

[ "WTFPL" ]

2

2020-03-22T16:28:32.000Z

2020-03-22T16:31:51.000Z

test/standard_application.ads

HeisenbugLtd/open_weather_map_api

fa3484b361411b9362500a25e36d63d4bb6dbca3

[ "WTFPL" ]

null

-------------------------------------------------------------------------------- -- Copyright (C) 2020 by Heisenbug Ltd. ([email protected]) -- -- 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); limited with Ada.Real_Time; private with GNATCOLL.Memory; package Standard_Application is type T is abstract tagged limited private; ----------------------------------------------------------------------------- -- Initialize ----------------------------------------------------------------------------- procedure Initialize (Self : in out T; Cycle_Time : in Ada.Real_Time.Time_Span; Application_Directory : in String; Log_Name : in String); --% Initializes the application. -- --% @param Self --% Instance of the application to initialize. -- --% @param Cycle_Time --% The interval at which the Worker subprogram shall be called. -- --% @param Application_Directory --% Application specific directory containing configuration data and such. -- --% @param Log_Name --% Base name of the application log file. ----------------------------------------------------------------------------- -- Shutdown ----------------------------------------------------------------------------- procedure Shutdown (Self : in out T); --% Shuts down the application. -- --% @param Self --% Instance of the application to shut down. ----------------------------------------------------------------------------- -- Epoch ----------------------------------------------------------------------------- function Epoch (Self : in T) return Ada.Real_Time.Time; --% Returns the epoch (i.e. startup time) of the application. Used to --% generate relative time stamps. -- --% @param Self --% Instance of the application. -- --% @return --% The start time of the application. ----------------------------------------------------------------------------- -- Run ----------------------------------------------------------------------------- procedure Run (Self : in out T); --% Starts the application main loop. -- --% @param Self --% Instance of the application to start. ----------------------------------------------------------------------------- -- Work ----------------------------------------------------------------------------- procedure Work (Self : in out T) is abstract; --% The work to be done on each iteration of the main loop. -- --% @param Self --% Instance of the application. private type T is abstract tagged limited record Start_Time : Ada.Real_Time.Time; --% @field Start_Time --% Time the application has been initialized. Interval : Ada.Real_Time.Time_Span; --% @field Interval --% The interval at which the Work subprogram shall be called from --% within the Run subprogram. Previous_Memory : GNATCOLL.Memory.Watermark_Info; --% @field Previous_Memory --% Holds the last value of the application's memory consumption as --% reported by the operating system. end record; ----------------------------------------------------------------------------- -- Report_Memory_Usage ----------------------------------------------------------------------------- procedure Report_Memory_Usage (Self : in out T); --% Prints memory usage to the log file. -- --% @param Self --% Instance of the application to report memory usage for. end Standard_Application;

37.8

80

0.447216

0651305f93ef5d509a9abf27f9a71f5f898b6442

889

ads

Ada

awa/samples/src/atlas-reviews.ads

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

7

2016-05-01T13:19:01.000Z

2020-03-18T14:47:27.000Z

awa/samples/src/atlas-reviews.ads

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

3

2018-06-06T15:52:11.000Z

2020-03-11T14:03:46.000Z

src/atlas-reviews.ads

stcarrez/atlas

712e6c99ebf2d6742f493b74bef9275205df98c6

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- atlas-reviews -- Module reviews -- Copyright (C) 2014 Stephane.Carrez -- Written by Stephane.Carrez ([email protected]) -- -- 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 Atlas.Reviews is end Atlas.Reviews;

44.45

76

0.618673

50cb2856137eaf1758f0057e7521830118f27ae5

18,246

ads

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-szmzco.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-szmzco.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-szmzco.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- ADA.STRINGS.WIDE_WIDE_MAPS.WIDE_WIDE_CONSTANTS -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2021, 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. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Characters.Wide_Wide_Latin_1; package Ada.Strings.Wide_Wide_Maps.Wide_Wide_Constants is pragma Preelaborate; Control_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Graphic_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Letter_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Lower_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Upper_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Basic_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Decimal_Digit_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Hexadecimal_Digit_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Alphanumeric_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Special_Graphic_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; ISO_646_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Character_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set; Lower_Case_Map : constant Wide_Wide_Maps.Wide_Wide_Character_Mapping; -- Maps to lower case for letters, else identity Upper_Case_Map : constant Wide_Wide_Maps.Wide_Wide_Character_Mapping; -- Maps to upper case for letters, else identity Basic_Map : constant Wide_Wide_Maps.Wide_Wide_Character_Mapping; -- Maps to basic letter for letters, else identity private package W renames Ada.Characters.Wide_Wide_Latin_1; subtype WC is Wide_Wide_Character; Control_Ranges : aliased constant Wide_Wide_Character_Ranges := ((W.NUL, W.US), (W.DEL, W.APC)); Control_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Control_Ranges'Unrestricted_Access); Graphic_Ranges : aliased constant Wide_Wide_Character_Ranges := ((W.Space, W.Tilde), (WC'Val (256), WC'Last)); Graphic_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Graphic_Ranges'Unrestricted_Access); Letter_Ranges : aliased constant Wide_Wide_Character_Ranges := (('A', 'Z'), (W.LC_A, W.LC_Z), (W.UC_A_Grave, W.UC_O_Diaeresis), (W.UC_O_Oblique_Stroke, W.LC_O_Diaeresis), (W.LC_O_Oblique_Stroke, W.LC_Y_Diaeresis)); Letter_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Letter_Ranges'Unrestricted_Access); Lower_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => (W.LC_A, W.LC_Z), 2 => (W.LC_German_Sharp_S, W.LC_O_Diaeresis), 3 => (W.LC_O_Oblique_Stroke, W.LC_Y_Diaeresis)); Lower_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Lower_Ranges'Unrestricted_Access); Upper_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => ('A', 'Z'), 2 => (W.UC_A_Grave, W.UC_O_Diaeresis), 3 => (W.UC_O_Oblique_Stroke, W.UC_Icelandic_Thorn)); Upper_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Upper_Ranges'Unrestricted_Access); Basic_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => ('A', 'Z'), 2 => (W.LC_A, W.LC_Z), 3 => (W.UC_AE_Diphthong, W.UC_AE_Diphthong), 4 => (W.LC_AE_Diphthong, W.LC_AE_Diphthong), 5 => (W.LC_German_Sharp_S, W.LC_German_Sharp_S), 6 => (W.UC_Icelandic_Thorn, W.UC_Icelandic_Thorn), 7 => (W.LC_Icelandic_Thorn, W.LC_Icelandic_Thorn), 8 => (W.UC_Icelandic_Eth, W.UC_Icelandic_Eth), 9 => (W.LC_Icelandic_Eth, W.LC_Icelandic_Eth)); Basic_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Basic_Ranges'Unrestricted_Access); Decimal_Digit_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => ('0', '9')); Decimal_Digit_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Decimal_Digit_Ranges'Unrestricted_Access); Hexadecimal_Digit_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => ('0', '9'), 2 => ('A', 'F'), 3 => (W.LC_A, W.LC_F)); Hexadecimal_Digit_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Hexadecimal_Digit_Ranges'Unrestricted_Access); Alphanumeric_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => ('0', '9'), 2 => ('A', 'Z'), 3 => (W.LC_A, W.LC_Z), 4 => (W.UC_A_Grave, W.UC_O_Diaeresis), 5 => (W.UC_O_Oblique_Stroke, W.LC_O_Diaeresis), 6 => (W.LC_O_Oblique_Stroke, W.LC_Y_Diaeresis)); Alphanumeric_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Alphanumeric_Ranges'Unrestricted_Access); Special_Graphic_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => (Wide_Wide_Space, W.Solidus), 2 => (W.Colon, W.Commercial_At), 3 => (W.Left_Square_Bracket, W.Grave), 4 => (W.Left_Curly_Bracket, W.Tilde), 5 => (W.No_Break_Space, W.Inverted_Question), 6 => (W.Multiplication_Sign, W.Multiplication_Sign), 7 => (W.Division_Sign, W.Division_Sign)); Special_Graphic_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Special_Graphic_Ranges'Unrestricted_Access); ISO_646_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => (W.NUL, W.DEL)); ISO_646_Set : constant Wide_Wide_Character_Set := (AF.Controlled with ISO_646_Ranges'Unrestricted_Access); Character_Ranges : aliased constant Wide_Wide_Character_Ranges := (1 => (W.NUL, WC'Val (255))); Character_Set : constant Wide_Wide_Character_Set := (AF.Controlled with Character_Ranges'Unrestricted_Access); Lower_Case_Mapping : aliased constant Wide_Wide_Character_Mapping_Values := (Length => 56, Domain => "ABCDEFGHIJKLMNOPQRSTUVWXYZ" & W.UC_A_Grave & W.UC_A_Acute & W.UC_A_Circumflex & W.UC_A_Tilde & W.UC_A_Diaeresis & W.UC_A_Ring & W.UC_AE_Diphthong & W.UC_C_Cedilla & W.UC_E_Grave & W.UC_E_Acute & W.UC_E_Circumflex & W.UC_E_Diaeresis & W.UC_I_Grave & W.UC_I_Acute & W.UC_I_Circumflex & W.UC_I_Diaeresis & W.UC_Icelandic_Eth & W.UC_N_Tilde & W.UC_O_Grave & W.UC_O_Acute & W.UC_O_Circumflex & W.UC_O_Tilde & W.UC_O_Diaeresis & W.UC_O_Oblique_Stroke & W.UC_U_Grave & W.UC_U_Acute & W.UC_U_Circumflex & W.UC_U_Diaeresis & W.UC_Y_Acute & W.UC_Icelandic_Thorn, Rangev => "abcdefghijklmnopqrstuvwxyz" & W.LC_A_Grave & W.LC_A_Acute & W.LC_A_Circumflex & W.LC_A_Tilde & W.LC_A_Diaeresis & W.LC_A_Ring & W.LC_AE_Diphthong & W.LC_C_Cedilla & W.LC_E_Grave & W.LC_E_Acute & W.LC_E_Circumflex & W.LC_E_Diaeresis & W.LC_I_Grave & W.LC_I_Acute & W.LC_I_Circumflex & W.LC_I_Diaeresis & W.LC_Icelandic_Eth & W.LC_N_Tilde & W.LC_O_Grave & W.LC_O_Acute & W.LC_O_Circumflex & W.LC_O_Tilde & W.LC_O_Diaeresis & W.LC_O_Oblique_Stroke & W.LC_U_Grave & W.LC_U_Acute & W.LC_U_Circumflex & W.LC_U_Diaeresis & W.LC_Y_Acute & W.LC_Icelandic_Thorn); Lower_Case_Map : constant Wide_Wide_Character_Mapping := (AF.Controlled with Map => Lower_Case_Mapping'Unrestricted_Access); Upper_Case_Mapping : aliased constant Wide_Wide_Character_Mapping_Values := (Length => 56, Domain => "abcdefghijklmnopqrstuvwxyz" & W.LC_A_Grave & W.LC_A_Acute & W.LC_A_Circumflex & W.LC_A_Tilde & W.LC_A_Diaeresis & W.LC_A_Ring & W.LC_AE_Diphthong & W.LC_C_Cedilla & W.LC_E_Grave & W.LC_E_Acute & W.LC_E_Circumflex & W.LC_E_Diaeresis & W.LC_I_Grave & W.LC_I_Acute & W.LC_I_Circumflex & W.LC_I_Diaeresis & W.LC_Icelandic_Eth & W.LC_N_Tilde & W.LC_O_Grave & W.LC_O_Acute & W.LC_O_Circumflex & W.LC_O_Tilde & W.LC_O_Diaeresis & W.LC_O_Oblique_Stroke & W.LC_U_Grave & W.LC_U_Acute & W.LC_U_Circumflex & W.LC_U_Diaeresis & W.LC_Y_Acute & W.LC_Icelandic_Thorn, Rangev => "ABCDEFGHIJKLMNOPQRSTUVWXYZ" & W.UC_A_Grave & W.UC_A_Acute & W.UC_A_Circumflex & W.UC_A_Tilde & W.UC_A_Diaeresis & W.UC_A_Ring & W.UC_AE_Diphthong & W.UC_C_Cedilla & W.UC_E_Grave & W.UC_E_Acute & W.UC_E_Circumflex & W.UC_E_Diaeresis & W.UC_I_Grave & W.UC_I_Acute & W.UC_I_Circumflex & W.UC_I_Diaeresis & W.UC_Icelandic_Eth & W.UC_N_Tilde & W.UC_O_Grave & W.UC_O_Acute & W.UC_O_Circumflex & W.UC_O_Tilde & W.UC_O_Diaeresis & W.UC_O_Oblique_Stroke & W.UC_U_Grave & W.UC_U_Acute & W.UC_U_Circumflex & W.UC_U_Diaeresis & W.UC_Y_Acute & W.UC_Icelandic_Thorn); Upper_Case_Map : constant Wide_Wide_Character_Mapping := (AF.Controlled with Upper_Case_Mapping'Unrestricted_Access); Basic_Mapping : aliased constant Wide_Wide_Character_Mapping_Values := (Length => 55, Domain => W.UC_A_Grave & W.UC_A_Acute & W.UC_A_Circumflex & W.UC_A_Tilde & W.UC_A_Diaeresis & W.UC_A_Ring & W.UC_C_Cedilla & W.UC_E_Grave & W.UC_E_Acute & W.UC_E_Circumflex & W.UC_E_Diaeresis & W.UC_I_Grave & W.UC_I_Acute & W.UC_I_Circumflex & W.UC_I_Diaeresis & W.UC_N_Tilde & W.UC_O_Grave & W.UC_O_Acute & W.UC_O_Circumflex & W.UC_O_Tilde & W.UC_O_Diaeresis & W.UC_O_Oblique_Stroke & W.UC_U_Grave & W.UC_U_Acute & W.UC_U_Circumflex & W.UC_U_Diaeresis & W.UC_Y_Acute & W.LC_A_Grave & W.LC_A_Acute & W.LC_A_Circumflex & W.LC_A_Tilde & W.LC_A_Diaeresis & W.LC_A_Ring & W.LC_C_Cedilla & W.LC_E_Grave & W.LC_E_Acute & W.LC_E_Circumflex & W.LC_E_Diaeresis & W.LC_I_Grave & W.LC_I_Acute & W.LC_I_Circumflex & W.LC_I_Diaeresis & W.LC_N_Tilde & W.LC_O_Grave & W.LC_O_Acute & W.LC_O_Circumflex & W.LC_O_Tilde & W.LC_O_Diaeresis & W.LC_O_Oblique_Stroke & W.LC_U_Grave & W.LC_U_Acute & W.LC_U_Circumflex & W.LC_U_Diaeresis & W.LC_Y_Acute & W.LC_Y_Diaeresis, Rangev => 'A' & -- UC_A_Grave 'A' & -- UC_A_Acute 'A' & -- UC_A_Circumflex 'A' & -- UC_A_Tilde 'A' & -- UC_A_Diaeresis 'A' & -- UC_A_Ring 'C' & -- UC_C_Cedilla 'E' & -- UC_E_Grave 'E' & -- UC_E_Acute 'E' & -- UC_E_Circumflex 'E' & -- UC_E_Diaeresis 'I' & -- UC_I_Grave 'I' & -- UC_I_Acute 'I' & -- UC_I_Circumflex 'I' & -- UC_I_Diaeresis 'N' & -- UC_N_Tilde 'O' & -- UC_O_Grave 'O' & -- UC_O_Acute 'O' & -- UC_O_Circumflex 'O' & -- UC_O_Tilde 'O' & -- UC_O_Diaeresis 'O' & -- UC_O_Oblique_Stroke 'U' & -- UC_U_Grave 'U' & -- UC_U_Acute 'U' & -- UC_U_Circumflex 'U' & -- UC_U_Diaeresis 'Y' & -- UC_Y_Acute 'a' & -- LC_A_Grave 'a' & -- LC_A_Acute 'a' & -- LC_A_Circumflex 'a' & -- LC_A_Tilde 'a' & -- LC_A_Diaeresis 'a' & -- LC_A_Ring 'c' & -- LC_C_Cedilla 'e' & -- LC_E_Grave 'e' & -- LC_E_Acute 'e' & -- LC_E_Circumflex 'e' & -- LC_E_Diaeresis 'i' & -- LC_I_Grave 'i' & -- LC_I_Acute 'i' & -- LC_I_Circumflex 'i' & -- LC_I_Diaeresis 'n' & -- LC_N_Tilde 'o' & -- LC_O_Grave 'o' & -- LC_O_Acute 'o' & -- LC_O_Circumflex 'o' & -- LC_O_Tilde 'o' & -- LC_O_Diaeresis 'o' & -- LC_O_Oblique_Stroke 'u' & -- LC_U_Grave 'u' & -- LC_U_Acute 'u' & -- LC_U_Circumflex 'u' & -- LC_U_Diaeresis 'y' & -- LC_Y_Acute 'y'); -- LC_Y_Diaeresis Basic_Map : constant Wide_Wide_Character_Mapping := (AF.Controlled with Basic_Mapping'Unrestricted_Access); end Ada.Strings.Wide_Wide_Maps.Wide_Wide_Constants;

40.456763

79

0.471062

504372e35cad5f587137abc89d0c8e300d978373

976

adb

Ada

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/O2_float_param/caller.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/O2_float_param/caller.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/O2_float_param/caller.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2013-2017 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/>. with IO; use IO; with Callee; use Callee; package body Caller is procedure Verbose_Increment (Val : in out Float; Msg : String) is begin Put_Line ("DEBUG: " & Msg); Increment (Val, "Verbose_Increment"); end Verbose_Increment; end Caller;

36.148148

73

0.723361

3125390ec3f6da0cfca07e2c56f518031c9d9660

3,749

adb

Ada

firehog/ncurses/Ada95/ada_include/terminal_interface-curses-text_io-modular_io.adb

KipodAfterFree/KAF-2019-FireHog

5f6ee3c3c3329459bc9daeabc1a16ff4619508d9

[ "MIT" ]

1

2019-04-02T20:28:58.000Z

Ada95/ada_include/terminal_interface-curses-text_io-modular_io.adb

mitchelhaan/ncurses

0b8ae5088202164ecc1769aa255ed1aad283d2ae

[ "X11" ]

null

Ada95/ada_include/terminal_interface-curses-text_io-modular_io.adb

mitchelhaan/ncurses

0b8ae5088202164ecc1769aa255ed1aad283d2ae

[ "X11" ]

1

2019-12-26T10:18:16.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding -- -- -- -- Terminal_Interface.Curses.Text_IO.Modular_IO -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998 Free Software Foundation, Inc. -- -- -- -- 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, distribute with modifications, 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 ABOVE 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. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer <[email protected]> 1996 -- Version Control: -- $Revision: 1.6 $ -- Binding Version 00.93 ------------------------------------------------------------------------------ with Ada.Text_IO; with Terminal_Interface.Curses.Text_IO.Aux; package body Terminal_Interface.Curses.Text_IO.Modular_IO is package Aux renames Terminal_Interface.Curses.Text_IO.Aux; package MIO is new Ada.Text_IO.Modular_IO (Num); procedure Put (Win : in Window; Item : in Num; Width : in Field := Default_Width; Base : in Number_Base := Default_Base) is Buf : String (1 .. Field'Last); begin MIO.Put (Buf, Item, Base); Aux.Put_Buf (Win, Buf, Width); end Put; procedure Put (Item : in Num; Width : in Field := Default_Width; Base : in Number_Base := Default_Base) is begin Put (Get_Window, Item, Width, Base); end Put; end Terminal_Interface.Curses.Text_IO.Modular_IO;

52.802817

78

0.461456

1c2d9cf502e32602b67c4eedef29c06fd4b7e28b

807

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/missing_acc_check.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/missing_acc_check.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/missing_acc_check.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do run } procedure Missing_Acc_Check is Test_Failed : Exception; type Int_Access is access all Integer; Save : Int_Access := null; type Int_Rec is record Int : aliased Integer; end record; type Ltd_Rec (IR_Acc : access Int_Rec) is limited null record; function Pass_Rec (IR_Acc : access Int_Rec) return Int_Access is begin return IR_Acc.Int'Access; -- Accessibility check here end Pass_Rec; procedure Proc is IR : aliased Int_Rec; LR : Ltd_Rec (IR'Access); begin Save := Pass_Rec (LR.IR_Acc); -- Must raise Program_Error; if Save /= null then raise Test_Failed; end if; exception when Program_Error => null; end Proc; begin Proc; end Missing_Acc_Check;

20.175

67

0.628253

12fcd58953cad52ec5937723eeedca27e085c606

8,798

ads

Ada

tests/tk-wm-test_data-tests.ads

thindil/tashy2

43fcbadb33c0062b2c8d6138a8238441dec5fd80

[ "Apache-2.0" ]

2

2020-12-09T07:27:07.000Z

2021-10-19T13:31:54.000Z

tests/tk-wm-test_data-tests.ads

thindil/tashy2

43fcbadb33c0062b2c8d6138a8238441dec5fd80

[ "Apache-2.0" ]

null

tests/tk-wm-test_data-tests.ads

thindil/tashy2

43fcbadb33c0062b2c8d6138a8238441dec5fd80

[ "Apache-2.0" ]

null

-- This package has been generated automatically by GNATtest. -- Do not edit any part of it, see GNATtest documentation for more details. -- begin read only with Gnattest_Generated; package Tk.Wm.Test_Data.Tests is type Test is new GNATtest_Generated.GNATtest_Standard.Tk.Wm.Test_Data .Test with null record; procedure Test_Set_Aspect_193522_4b5997(Gnattest_T: in out Test); -- tk-wm.ads:418:4:Set_Aspect:Test_Wm_Aspect procedure Test_Get_Aspect_6af3ff_d6b574(Gnattest_T: in out Test); -- tk-wm.ads:443:4:Get_Aspect:Test_Wm_Aspect2 procedure Test_Get_Attributes_0c5f59_7e1726(Gnattest_T: in out Test); -- tk-wm.ads:466:4:Get_Attributes:Test_Wm_Get_Attributes procedure Test_Set_Attributes_58cf2d_d28502(Gnattest_T: in out Test); -- tk-wm.ads:488:4:Set_Attributes:Test_Wm_Set_Attributes procedure Test_Get_Attribute_e4067c_13e29a(Gnattest_T: in out Test); -- tk-wm.ads:512:4:Get_Attribute:Test_Wm_Get_Attribute procedure Test_Get_Attribute_97698a_5dc191(Gnattest_T: in out Test); -- tk-wm.ads:529:4:Get_Attribute:Test_Wm_Get_Attribute2 procedure Test_Get_Attribute_e0766a_48ba42(Gnattest_T: in out Test); -- tk-wm.ads:536:4:Get_Attribute:Test_Wm_Get_Attribute3 procedure Test_Get_Attribute_6aefd8_1be407(Gnattest_T: in out Test); -- tk-wm.ads:540:4:Get_Attribute:Test_Wm_Get_Attribute4 procedure Test_Get_Client_c3e755_649902(Gnattest_T: in out Test); -- tk-wm.ads:563:4:Get_Client:Test_Wm_Client procedure Test_Set_Client_2c6ab7_d2f7a7(Gnattest_T: in out Test); -- tk-wm.ads:589:4:Set_Client:Test_Wm_Client2 procedure Test_Get_Color_Map_Windows_2764f5_798c45(Gnattest_T: in out Test); -- tk-wm.ads:613:4:Get_Color_Map_Windows:Test_Wm_Color_Map_Windows procedure Test_Set_Color_Map_Windows_af7285_93136d(Gnattest_T: in out Test); -- tk-wm.ads:635:4:Set_Color_Map_Windows:Test_Wm_Color_Map_Windows2 procedure Test_Get_Command_93826d_e6db9d(Gnattest_T: in out Test); -- tk-wm.ads:658:4:Get_Command:Test_Wm_Command procedure Test_Set_Command_49e617_7c33cf(Gnattest_T: in out Test); -- tk-wm.ads:686:4:Set_Command:Test_Wm_Command2 procedure Test_Deiconify_46ab19_2f30b1(Gnattest_T: in out Test); -- tk-wm.ads:707:4:Deiconify:Test_Wm_Deiconify procedure Test_Get_Focus_Model_526220_857661(Gnattest_T: in out Test); -- tk-wm.ads:729:4:Get_Focus_Model:Test_Wm_Focus_Model procedure Test_Set_Focus_Model_71dc8a_9f50c8(Gnattest_T: in out Test); -- tk-wm.ads:750:4:Set_Focus_Model:Test_Wm_Focus_Model2 procedure Test_Forget_7f8bc2_846bd1(Gnattest_T: in out Test); -- tk-wm.ads:769:4:Forget:Test_Wm_Forget procedure Test_Get_Frame_7e4b43_b86ec4(Gnattest_T: in out Test); -- tk-wm.ads:791:4:Get_Frame:Test_Wm_Frame procedure Test_Get_Geometry_ef6848_4f4f37(Gnattest_T: in out Test); -- tk-wm.ads:814:4:Get_Geometry:Test_Wm_Geometry procedure Test_Set_Geometry_812d71_574eec(Gnattest_T: in out Test); -- tk-wm.ads:839:4:Set_Geometry:Test_Wm_Set_Geometry procedure Test_Set_Geometry_ab86cd_24d3e6(Gnattest_T: in out Test); -- tk-wm.ads:863:4:Set_Geometry:Test_Wm_Set_Geometry2 procedure Test_Set_Geometry_Position_816b2e_f16759(Gnattest_T: in out Test); -- tk-wm.ads:886:4:Set_Geometry_Position:Test_Wm_Set_Geometry_Position procedure Test_Get_Grid_30f13e_fc763d(Gnattest_T: in out Test); -- tk-wm.ads:908:4:Get_Grid:Test_Wm_Grid procedure Test_Set_Grid_9a47fa_1fe5bc(Gnattest_T: in out Test); -- tk-wm.ads:935:4:Set_Grid:Test_Wm_Grid2 procedure Test_Get_Group_f9ea32_7210ab(Gnattest_T: in out Test); -- tk-wm.ads:962:4:Get_Group:Test_Wm_Group procedure Test_Set_Group_67e692_95a2e7(Gnattest_T: in out Test); -- tk-wm.ads:989:4:Set_Group:Test_Wm_Group2 procedure Test_Get_Icon_Bitmap_6135da_c75fae(Gnattest_T: in out Test); -- tk-wm.ads:1012:4:Get_Icon_Bitmap:Test_Wm_Icon_Bitmap procedure Test_Set_Icon_Bitmap_9571ee_31ebac(Gnattest_T: in out Test); -- tk-wm.ads:1039:4:Set_Icon_Bitmap:Test_Wm_Icon_Bitmap2 procedure Test_Iconify_b7aad2_844804(Gnattest_T: in out Test); -- tk-wm.ads:1059:4:Iconify:Test_Wm_Iconify procedure Test_Get_Icon_Mask_dd14ea_9079a9(Gnattest_T: in out Test); -- tk-wm.ads:1082:4:Get_Icon_Mask:Test_Wm_Icon_Mask procedure Test_Set_Icon_Mask_7f471f_b2153c(Gnattest_T: in out Test); -- tk-wm.ads:1108:4:Set_Icon_Mask:Test_Wm_Icon_Mask2 procedure Test_Get_Icon_Name_ab4de4_2bafa0(Gnattest_T: in out Test); -- tk-wm.ads:1131:4:Get_Icon_Name:Test_Wm_Icon_Name procedure Test_Set_Icon_Name_8f26b1_3f7273(Gnattest_T: in out Test); -- tk-wm.ads:1157:4:Set_Icon_Name:Test_Wm_Icon_Name2 procedure Test_Set_Icon_Photo_27ff53_a0feb6(Gnattest_T: in out Test); -- tk-wm.ads:1178:4:Set_Icon_Photo:Test_Wm_Icon_Photo procedure Test_Get_Icon_Position_e3f767_0e4e31(Gnattest_T: in out Test); -- tk-wm.ads:1201:4:Get_Icon_Position:Test_Wm_Icon_Position procedure Test_Set_Icon_Position_6df176_86302c(Gnattest_T: in out Test); -- tk-wm.ads:1223:4:Set_Icon_Position:Test_Wm_Icon_Set_Position procedure Test_Reset_Icon_Position_e1c582_37ae99(Gnattest_T: in out Test); -- tk-wm.ads:1243:4:Reset_Icon_Position:Test_Wm_Icon_Reset_Position procedure Test_Get_Icon_Window_1f202f_44e6ae(Gnattest_T: in out Test); -- tk-wm.ads:1266:4:Get_Icon_Window:Test_Wm_Icon_Window procedure Test_Set_Icon_Window_d6a591_e657dc(Gnattest_T: in out Test); -- tk-wm.ads:1288:4:Set_Icon_Window:Test_Wm_Icon_Window2 procedure Test_Manage_691f50_c53d0d(Gnattest_T: in out Test); -- tk-wm.ads:1306:4:Manage:Test_Wm_Manage procedure Test_Get_Max_Size_4ccc81_4463a7(Gnattest_T: in out Test); -- tk-wm.ads:1330:4:Get_Max_Size:Test_Wm_Max_Size procedure Test_Set_Max_Size_dec96a_efa6b3(Gnattest_T: in out Test); -- tk-wm.ads:1353:4:Set_Max_Size:Test_Wm_Max_Size2 procedure Test_Get_Min_Size_2ac171_7d5aa0(Gnattest_T: in out Test); -- tk-wm.ads:1377:4:Get_Min_Size:Test_Wm_Min_Size procedure Test_Set_Min_Size_8a0b01_86115b(Gnattest_T: in out Test); -- tk-wm.ads:1400:4:Set_Min_Size:Test_Wm_Min_Size2 procedure Test_Get_Override_Redirect_09d97c_2fcf15(Gnattest_T: in out Test); -- tk-wm.ads:1422:4:Get_Override_Redirect:Test_Wm_Override_Redirect procedure Test_Set_Override_Redirect_92338d_fdca84(Gnattest_T: in out Test); -- tk-wm.ads:1447:4:Set_Override_Redirect:Test_Wm_Override_Redirect procedure Test_Get_Position_From_369d0f_48bfdf(Gnattest_T: in out Test); -- tk-wm.ads:1471:4:Get_Position_From:Test_Wm_Position_From procedure Test_Set_Position_From_8a863a_a97a4c(Gnattest_T: in out Test); -- tk-wm.ads:1495:4:Set_Position_From:Test_Wm_Position_From2 procedure Test_Get_Protocols_dcaf07_4c2c40(Gnattest_T: in out Test); -- tk-wm.ads:1522:4:Get_Protocols:Test_Wm_Protocol procedure Test_Get_Protocol_aa44e2_686681(Gnattest_T: in out Test); -- tk-wm.ads:1548:4:Get_Protocol:Test_Wm_Protocol2 procedure Test_Set_Protocol_cd4a1b_4c09c4(Gnattest_T: in out Test); -- tk-wm.ads:1582:4:Set_Protocol:Test_Wm_Protocol3 procedure Test_Get_Resizable_0f6614_2b8386(Gnattest_T: in out Test); -- tk-wm.ads:1609:4:Get_Resizable:Test_Wm_Resizable procedure Test_Set_Resizable_0b9f82_b49918(Gnattest_T: in out Test); -- tk-wm.ads:1632:4:Set_Resizable:Test_Wm_Resizable2 procedure Test_Get_Size_From_5c14ae_7bb223(Gnattest_T: in out Test); -- tk-wm.ads:1656:4:Get_Size_From:Test_Wm_Size_From procedure Test_Set_Size_From_e4e6f1_bc3e6a(Gnattest_T: in out Test); -- tk-wm.ads:1679:4:Set_Size_From:Test_Wm_Size_From2 procedure Test_Get_Stack_Order_ad8dde_ada760(Gnattest_T: in out Test); -- tk-wm.ads:1705:4:Get_Stack_Order:Test_Wm_Stack_Order procedure Test_Get_Stack_Order_Above_707d59_05815a(Gnattest_T: in out Test); -- tk-wm.ads:1736:4:Get_Stack_Order_Above:Test_Wm_Stack_Order2 procedure Test_Get_State_d36f93_369ab4(Gnattest_T: in out Test); -- tk-wm.ads:1770:4:Get_State:Test_Wm_State procedure Test_Set_State_5b3aeb_b6b816(Gnattest_T: in out Test); -- tk-wm.ads:1792:4:Set_State:Test_Wm_State2 procedure Test_Get_Title_0b831c_790475(Gnattest_T: in out Test); -- tk-wm.ads:1815:4:Get_Title:Test_Wm_Title procedure Test_Set_Title_733354_35ca12(Gnattest_T: in out Test); -- tk-wm.ads:1843:4:Set_Title:Test_Wm_Title2 procedure Test_Get_Transient_911661_b820a7(Gnattest_T: in out Test); -- tk-wm.ads:1866:4:Get_Transient:Test_Wm_Transient procedure Test_Set_Transient_522d97_9ec765(Gnattest_T: in out Test); -- tk-wm.ads:1887:4:Set_Transient:Test_Wm_Transient2 procedure Test_Withdraw_9bd119_51d547(Gnattest_T: in out Test); -- tk-wm.ads:1905:4:Withdraw:Test_Wm_Withdraw end Tk.Wm.Test_Data.Tests; -- end read only

41.895238

79

0.79018

1d9698f427354dad3898f5b1eca4397c2f43fec7

4,303

ads

Ada

tools/configure/configure-tests-valgrind.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

tools/configure/configure-tests-valgrind.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

tools/configure/configure-tests-valgrind.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Tools Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011, Vadim Godunko <[email protected]> -- -- 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 test detects whether valgrind is installed on system. -- -- It sets following substitution variables: -- - HAS_VALGRIND ------------------------------------------------------------------------------ with Configure.Abstract_Tests; package Configure.Tests.Valgrind is type Valgrind_Test is new Configure.Abstract_Tests.Abstract_Test with private; overriding function Name (Self : Valgrind_Test) return String; -- Returns name of the test to be used in reports. overriding function Help (Self : Valgrind_Test) return Unbounded_String_Vector; -- Returns help information for test. overriding procedure Execute (Self : in out Valgrind_Test; Arguments : in out Unbounded_String_Vector); -- Executes test's actions. All used arguments must be removed from -- Arguments. private type Valgrind_Test is new Configure.Abstract_Tests.Abstract_Test with null record; end Configure.Tests.Valgrind;

57.373333

78

0.459447

1c34a5800e6350db3fbc8c041c1a5ca697bb2f1b

17,142

adb

Ada

tools-src/gnu/gcc/gcc/ada/sem_elim.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/sem_elim.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/sem_elim.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ E L I M -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1997-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. -- -- -- ------------------------------------------------------------------------------ with Atree; use Atree; with Einfo; use Einfo; with Errout; use Errout; with Namet; use Namet; with Nlists; use Nlists; with Sinfo; use Sinfo; with Snames; use Snames; with Stand; use Stand; with Stringt; use Stringt; with GNAT.HTable; use GNAT.HTable; package body Sem_Elim is No_Elimination : Boolean; -- Set True if no Eliminate pragmas active --------------------- -- Data Structures -- --------------------- -- A single pragma Eliminate is represented by the following record type Elim_Data; type Access_Elim_Data is access Elim_Data; type Names is array (Nat range <>) of Name_Id; -- Type used to represent set of names. Used for names in Unit_Name -- and also the set of names in Argument_Types. type Access_Names is access Names; type Elim_Data is record Unit_Name : Access_Names; -- Unit name, broken down into a set of names (e.g. A.B.C is -- represented as Name_Id values for A, B, C in sequence). Entity_Name : Name_Id; -- Entity name if Entity parameter if present. If no Entity parameter -- was supplied, then Entity_Node is set to Empty, and the Entity_Name -- field contains the last identifier name in the Unit_Name. Entity_Scope : Access_Names; -- Static scope of the entity within the compilation unit represented by -- Unit_Name. Entity_Node : Node_Id; -- Save node of entity argument, for posting error messages. Set -- to Empty if there is no entity argument. Parameter_Types : Access_Names; -- Set to set of names given for parameter types. If no parameter -- types argument is present, this argument is set to null. Result_Type : Name_Id; -- Result type name if Result_Types parameter present, No_Name if not Hash_Link : Access_Elim_Data; -- Link for hash table use Homonym : Access_Elim_Data; -- Pointer to next entry with same key end record; ---------------- -- Hash_Table -- ---------------- -- Setup hash table using the Entity_Name field as the hash key subtype Element is Elim_Data; subtype Elmt_Ptr is Access_Elim_Data; subtype Key is Name_Id; type Header_Num is range 0 .. 1023; Null_Ptr : constant Elmt_Ptr := null; ---------------------- -- Hash_Subprograms -- ---------------------- package Hash_Subprograms is function Equal (F1, F2 : Key) return Boolean; pragma Inline (Equal); function Get_Key (E : Elmt_Ptr) return Key; pragma Inline (Get_Key); function Hash (F : Key) return Header_Num; pragma Inline (Hash); function Next (E : Elmt_Ptr) return Elmt_Ptr; pragma Inline (Next); procedure Set_Next (E : Elmt_Ptr; Next : Elmt_Ptr); pragma Inline (Set_Next); end Hash_Subprograms; package body Hash_Subprograms is ----------- -- Equal -- ----------- function Equal (F1, F2 : Key) return Boolean is begin return F1 = F2; end Equal; ------------- -- Get_Key -- ------------- function Get_Key (E : Elmt_Ptr) return Key is begin return E.Entity_Name; end Get_Key; ---------- -- Hash -- ---------- function Hash (F : Key) return Header_Num is begin return Header_Num (Int (F) mod 1024); end Hash; ---------- -- Next -- ---------- function Next (E : Elmt_Ptr) return Elmt_Ptr is begin return E.Hash_Link; end Next; -------------- -- Set_Next -- -------------- procedure Set_Next (E : Elmt_Ptr; Next : Elmt_Ptr) is begin E.Hash_Link := Next; end Set_Next; end Hash_Subprograms; package Elim_Hash_Table is new Static_HTable ( Header_Num => Header_Num, Element => Element, Elmt_Ptr => Elmt_Ptr, Null_Ptr => Null_Ptr, Set_Next => Hash_Subprograms.Set_Next, Next => Hash_Subprograms.Next, Key => Key, Get_Key => Hash_Subprograms.Get_Key, Hash => Hash_Subprograms.Hash, Equal => Hash_Subprograms.Equal); ---------------------- -- Check_Eliminated -- ---------------------- procedure Check_Eliminated (E : Entity_Id) is Elmt : Access_Elim_Data; Scop : Entity_Id; Form : Entity_Id; begin if No_Elimination then return; -- Elimination of objects and types is not implemented yet. elsif Ekind (E) not in Subprogram_Kind then return; end if; Elmt := Elim_Hash_Table.Get (Chars (E)); -- Loop through homonyms for this key while Elmt /= null loop -- First we check that the name of the entity matches if Elmt.Entity_Name /= Chars (E) then goto Continue; end if; -- Then we need to see if the static scope matches within the -- compilation unit. Scop := Scope (E); if Elmt.Entity_Scope /= null then for J in reverse Elmt.Entity_Scope'Range loop if Elmt.Entity_Scope (J) /= Chars (Scop) then goto Continue; end if; Scop := Scope (Scop); if not Is_Compilation_Unit (Scop) and then J = 1 then goto Continue; end if; end loop; end if; -- Now see if compilation unit matches for J in reverse Elmt.Unit_Name'Range loop if Elmt.Unit_Name (J) /= Chars (Scop) then goto Continue; end if; Scop := Scope (Scop); if Scop /= Standard_Standard and then J = 1 then goto Continue; end if; end loop; if Scop /= Standard_Standard then goto Continue; end if; -- Check for case of given entity is a library level subprogram -- and we have the single parameter Eliminate case, a match! if Is_Compilation_Unit (E) and then Is_Subprogram (E) and then No (Elmt.Entity_Node) then Set_Is_Eliminated (E); return; -- Check for case of type or object with two parameter case elsif (Is_Type (E) or else Is_Object (E)) and then Elmt.Result_Type = No_Name and then Elmt.Parameter_Types = null then Set_Is_Eliminated (E); return; -- Check for case of subprogram elsif Ekind (E) = E_Function or else Ekind (E) = E_Procedure then -- Two parameter case always matches if Elmt.Result_Type = No_Name and then Elmt.Parameter_Types = null then Set_Is_Eliminated (E); return; -- Here we have a profile, so see if it matches else if Ekind (E) = E_Function then if Chars (Etype (E)) /= Elmt.Result_Type then goto Continue; end if; end if; Form := First_Formal (E); if No (Form) and then Elmt.Parameter_Types = null then Set_Is_Eliminated (E); return; elsif Elmt.Parameter_Types = null then goto Continue; else for J in Elmt.Parameter_Types'Range loop if No (Form) or else Chars (Etype (Form)) /= Elmt.Parameter_Types (J) then goto Continue; else Next_Formal (Form); end if; end loop; if Present (Form) then goto Continue; else Set_Is_Eliminated (E); return; end if; end if; end if; end if; <<Continue>> Elmt := Elmt.Homonym; end loop; return; end Check_Eliminated; ---------------- -- Initialize -- ---------------- procedure Initialize is begin Elim_Hash_Table.Reset; No_Elimination := True; end Initialize; ------------------------------ -- Process_Eliminate_Pragma -- ------------------------------ procedure Process_Eliminate_Pragma (Arg_Unit_Name : Node_Id; Arg_Entity : Node_Id; Arg_Parameter_Types : Node_Id; Arg_Result_Type : Node_Id) is Argx_Unit_Name : Node_Id; Argx_Entity : Node_Id; Argx_Parameter_Types : Node_Id; Argx_Result_Type : Node_Id; Data : constant Access_Elim_Data := new Elim_Data; -- Build result data here Elmt : Access_Elim_Data; Num_Names : Nat := 0; -- Number of names in unit name Lit : Node_Id; function OK_Selected_Component (N : Node_Id) return Boolean; -- Test if N is a selected component with all identifiers, or a -- selected component whose selector is an operator symbol. As a -- side effect if result is True, sets Num_Names to the number -- of names present (identifiers and operator if any). --------------------------- -- OK_Selected_Component -- --------------------------- function OK_Selected_Component (N : Node_Id) return Boolean is begin if Nkind (N) = N_Identifier or else Nkind (N) = N_Operator_Symbol then Num_Names := Num_Names + 1; return True; elsif Nkind (N) = N_Selected_Component then return OK_Selected_Component (Prefix (N)) and then OK_Selected_Component (Selector_Name (N)); else return False; end if; end OK_Selected_Component; -- Start of processing for Process_Eliminate_Pragma begin Error_Msg_Name_1 := Name_Eliminate; -- Process Unit_Name argument Argx_Unit_Name := Expression (Arg_Unit_Name); if Nkind (Argx_Unit_Name) = N_Identifier then Data.Unit_Name := new Names'(1 => Chars (Argx_Unit_Name)); Num_Names := 1; elsif OK_Selected_Component (Argx_Unit_Name) then Data.Unit_Name := new Names (1 .. Num_Names); for J in reverse 2 .. Num_Names loop Data.Unit_Name (J) := Chars (Selector_Name (Argx_Unit_Name)); Argx_Unit_Name := Prefix (Argx_Unit_Name); end loop; Data.Unit_Name (1) := Chars (Argx_Unit_Name); else Error_Msg_N ("wrong form for Unit_Name parameter of pragma%", Argx_Unit_Name); return; end if; -- Process Entity argument if Present (Arg_Entity) then Argx_Entity := Expression (Arg_Entity); Num_Names := 0; if Nkind (Argx_Entity) = N_Identifier or else Nkind (Argx_Entity) = N_Operator_Symbol then Data.Entity_Name := Chars (Argx_Entity); Data.Entity_Node := Argx_Entity; Data.Entity_Scope := null; elsif OK_Selected_Component (Argx_Entity) then Data.Entity_Scope := new Names (1 .. Num_Names - 1); Data.Entity_Name := Chars (Selector_Name (Argx_Entity)); Data.Entity_Node := Argx_Entity; Argx_Entity := Prefix (Argx_Entity); for J in reverse 2 .. Num_Names - 1 loop Data.Entity_Scope (J) := Chars (Selector_Name (Argx_Entity)); Argx_Entity := Prefix (Argx_Entity); end loop; Data.Entity_Scope (1) := Chars (Argx_Entity); elsif Nkind (Argx_Entity) = N_String_Literal then String_To_Name_Buffer (Strval (Argx_Entity)); Data.Entity_Name := Name_Find; Data.Entity_Node := Argx_Entity; else Error_Msg_N ("wrong form for Entity_Argument parameter of pragma%", Argx_Unit_Name); return; end if; else Data.Entity_Node := Empty; Data.Entity_Name := Data.Unit_Name (Num_Names); end if; -- Process Parameter_Types argument if Present (Arg_Parameter_Types) then Argx_Parameter_Types := Expression (Arg_Parameter_Types); -- Case of one name, which looks like a parenthesized literal -- rather than an aggregate. if Nkind (Argx_Parameter_Types) = N_String_Literal and then Paren_Count (Argx_Parameter_Types) = 1 then String_To_Name_Buffer (Strval (Argx_Parameter_Types)); Data.Parameter_Types := new Names'(1 => Name_Find); -- Otherwise must be an aggregate elsif Nkind (Argx_Parameter_Types) /= N_Aggregate or else Present (Component_Associations (Argx_Parameter_Types)) or else No (Expressions (Argx_Parameter_Types)) then Error_Msg_N ("Parameter_Types for pragma% must be list of string literals", Argx_Parameter_Types); return; -- Here for aggregate case else Data.Parameter_Types := new Names (1 .. List_Length (Expressions (Argx_Parameter_Types))); Lit := First (Expressions (Argx_Parameter_Types)); for J in Data.Parameter_Types'Range loop if Nkind (Lit) /= N_String_Literal then Error_Msg_N ("parameter types for pragma% must be string literals", Lit); return; end if; String_To_Name_Buffer (Strval (Lit)); Data.Parameter_Types (J) := Name_Find; Next (Lit); end loop; end if; end if; -- Process Result_Types argument if Present (Arg_Result_Type) then Argx_Result_Type := Expression (Arg_Result_Type); if Nkind (Argx_Result_Type) /= N_String_Literal then Error_Msg_N ("Result_Type argument for pragma% must be string literal", Argx_Result_Type); return; end if; String_To_Name_Buffer (Strval (Argx_Result_Type)); Data.Result_Type := Name_Find; else Data.Result_Type := No_Name; end if; -- Now link this new entry into the hash table Elmt := Elim_Hash_Table.Get (Hash_Subprograms.Get_Key (Data)); -- If we already have an entry with this same key, then link -- it into the chain of entries for this key. if Elmt /= null then Data.Homonym := Elmt.Homonym; Elmt.Homonym := Data; -- Otherwise create a new entry else Elim_Hash_Table.Set (Data); end if; No_Elimination := False; end Process_Eliminate_Pragma; end Sem_Elim;

30.72043

79

0.53016

31bf124b57f42af5e76a45883700b287df93c78b

5,523

adb

Ada

src/bintoasc-base16.adb

jhumphry/Ada_BinToAsc

b1aa44263d03c46ffe32b766ea01a7710dabbd63

[ "0BSD" ]

null

src/bintoasc-base16.adb

jhumphry/Ada_BinToAsc

b1aa44263d03c46ffe32b766ea01a7710dabbd63

[ "0BSD" ]

null

src/bintoasc-base16.adb

jhumphry/Ada_BinToAsc

b1aa44263d03c46ffe32b766ea01a7710dabbd63

[ "0BSD" ]

null

-- BinToAsc.Base16 -- Binary data to ASCII codecs - Base16 codec as in RFC4648 -- Copyright (c) 2015, James Humphry - see LICENSE file for details with Ada.Characters.Handling; package body BinToAsc.Base16 is use Ada.Characters.Handling; Reverse_Alphabet : constant Reverse_Alphabet_Lookup := Make_Reverse_Alphabet(Alphabet, Case_Sensitive); -- -- Base16_To_String -- procedure Reset (C : out Base16_To_String) is begin C := (State => Ready); end Reset; procedure Process (C : in out Base16_To_String; Input : in Bin; Output : out String; Output_Length : out Natural) is pragma Unreferenced (C); Input_Index : constant Bin := Bin'Pos(Input); begin Output_Length := 2; Output := (Alphabet(Input_Index / 16), Alphabet(Input_Index and 2#00001111#), others => ' '); end Process; procedure Process (C : in out Base16_To_String; Input : in Bin_Array; Output : out String; Output_Length : out Natural) is pragma Unreferenced (C); Output_Index : Integer := Output'First; Input_Index : Bin; begin Output_Length := 2 * Input'Length; for I in Input'Range loop Input_Index := Bin'Pos(Input(I)); Output(Output_Index) := Alphabet(Input_Index / 16); Output(Output_Index + 1) := Alphabet(Input_Index and 2#00001111#); Output_Index := Output_Index + 2; end loop; end Process; procedure Complete (C : in out Base16_To_String; Output : out String; Output_Length : out Natural) is begin C.State := Completed; Output := (others => ' '); Output_Length := 0; end Complete; function To_String_Private is new BinToAsc.To_String(Codec => Base16_To_String); function To_String (Input : in Bin_Array) return String renames To_String_Private; -- -- Base16_To_Bin -- procedure Reset (C : out Base16_To_Bin) is begin C := (State => Ready, Loaded => False, Load => 0); end Reset; procedure Process (C : in out Base16_To_Bin; Input : in Character; Output : out Bin_Array; Output_Length : out Bin_Array_Index) is Input_Bin : Bin; begin Input_Bin := Reverse_Alphabet(Input); if Input_Bin = Invalid_Character_Input then Output_Length := 0; C.State := Failed; else if C.Loaded then Output(Output'First) := Bin(C.Load) * 16 or Input_Bin; Output(Output'First + 1 .. Output'Last) := (others => 0); Output_Length := 1; C.Loaded := False; else Output := (others => 0); Output_Length := 0; C.Loaded := True; C.Load := Input_Bin; end if; end if; end Process; procedure Process (C : in out Base16_To_Bin; Input : in String; Output : out Bin_Array; Output_Length : out Bin_Array_Index) is Input_Bin : Bin; Output_Index : Bin_Array_Index := Output'First; begin for I in Input'Range loop Input_Bin := Reverse_Alphabet(Input(I)); if Input_Bin = Invalid_Character_Input then C.State := Failed; exit; end if; if C.Loaded then Output(Output_Index) := Bin(C.Load) * 16 or Input_Bin; Output_Index := Output_Index + 1; C.Loaded := False; else C.Loaded := True; C.Load := Input_Bin; end if; end loop; if C.State = Failed then Output := (others => 0); Output_Length := 0; else Output(Output_Index .. Output'Last) := (others => 0); Output_Length := Output_Index - Output'First; end if; end Process; procedure Complete (C : in out Base16_To_Bin; Output : out Bin_Array; Output_Length : out Bin_Array_Index) is begin if C.Loaded then C.State := Failed; elsif C.State = Ready then C.State := Completed; end if; Output := (others => 0); Output_Length := 0; end Complete; function To_Bin_Private is new BinToAsc.To_Bin(Codec => Base16_To_Bin); function To_Bin (Input : in String) return Bin_Array renames To_Bin_Private; begin -- The following Compile_Time_Error test is silently ignored by GNAT GPL 2015, -- although it does appear to be a static boolean expression as required by -- the user guide. It works if converted to a run-time test so it has been -- left in, in the hope that in a future version of GNAT it will actually be -- tested. pragma Warnings (GNATprove, Off, "Compile_Time_Error"); pragma Compile_Time_Error ((for some X in 1..Alphabet'Last => (for some Y in 0..X-1 => (Alphabet(Y) = Alphabet(X) or (not Case_Sensitive and To_Lower(Alphabet(Y)) = To_Lower(Alphabet(X))) ) ) ), "Duplicate letter in alphabet for Base16 codec."); pragma Warnings (GNATprove, On, "Compile_Time_Error"); end BinToAsc.Base16;

29.222222

92

0.557487

31cf5381d8e546614fd4b80a5ccb2e1594ffc516

1,835

ads

Ada

source/gmp-random.ads

ytomino/gmp-ada

72b08a0e8dae5c8576c4d48ef580eb95a5c5455b

[ "Unlicense" ]

4

2017-12-20T00:16:36.000Z

2020-09-08T09:35:25.000Z

source/gmp-random.ads

ytomino/gmp-ada

72b08a0e8dae5c8576c4d48ef580eb95a5c5455b

[ "Unlicense" ]

null

source/gmp-random.ads

ytomino/gmp-ada

72b08a0e8dae5c8576c4d48ef580eb95a5c5455b

[ "Unlicense" ]

null

with Ada.Finalization; private with C.gmp; package GMP.Random is pragma Preelaborate; type Generator is limited private; function Initialize return Generator; function Initialize (Initiator : Long_Integer) return Generator; procedure Reset (Gen : in out Generator); procedure Reset (Gen : in out Generator; Initiator : in Long_Integer); type State is private; function Initialize return State; function Initialize (Initiator : Long_Integer) return State; function Save (Gen : Generator) return State; procedure Save (Gen : in Generator; To_State : out State); function Reset (From_State : State) return Generator; procedure Reset (Gen : in out Generator; From_State : State); function Random (Gen : aliased in out Generator) return Long_Integer; generic type Result_Subtype is (<>); package Discrete_Random is function Random (Gen : aliased in out Generator) return Result_Subtype; end Discrete_Random; private package Controlled is type State is private; function Reference (Item : in out GMP.Random.State) return not null access C.gmp.gmp_randstate_struct; function Constant_Reference (Item : GMP.Random.State) return not null access constant C.gmp.gmp_randstate_struct; pragma Inline (Reference); pragma Inline (Constant_Reference); private type State is new Ada.Finalization.Controlled with record Raw : aliased C.gmp.gmp_randstate_t := (others => (mp_seed => (others => (others => <>)), others => <>)); end record; overriding procedure Initialize (Object : in out State); overriding procedure Adjust (Object : in out State); overriding procedure Finalize (Object : in out State); end Controlled; type State is new Controlled.State; type Generator is limited record State : GMP.Random.State; end record; end GMP.Random;

28.230769

73

0.73842

50d711c1efd3d010486c9eb5ecab5e9fcd51db13

12,543

adb

Ada

src/asf-views-facelets.adb

My-Colaborations/ada-asf

29cf62f17755c3af6f1be542d072c007bc569f7e

[ "Apache-2.0" ]

null

src/asf-views-facelets.adb

My-Colaborations/ada-asf

29cf62f17755c3af6f1be542d072c007bc569f7e

[ "Apache-2.0" ]

null

src/asf-views-facelets.adb

My-Colaborations/ada-asf

29cf62f17755c3af6f1be542d072c007bc569f7e

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- asf-views-facelets -- Facelets representation and management -- Copyright (C) 2009, 2010, 2011, 2014, 2015, 2017, 2019, 2020 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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.Exceptions; with Ada.Directories; with Ada.Unchecked_Deallocation; with ASF.Views.Nodes.Reader; with Input_Sources.File; with Sax.Readers; with EL.Contexts.Default; with Util.Files; with Util.Log.Loggers; package body ASF.Views.Facelets is use ASF.Views.Nodes; use Util.Log; -- The logger Log : constant Loggers.Logger := Loggers.Create ("ASF.Views.Facelets"); procedure Free is new Ada.Unchecked_Deallocation (Object => ASF.Views.File_Info, Name => ASF.Views.File_Info_Access); procedure Free is new Ada.Unchecked_Deallocation (Object => Facelet_Type, Name => Facelet_Access); -- Find in the factory for the facelet with the given name. procedure Find (Factory : in out Facelet_Factory; Name : in String; Result : out Facelet); -- Load the facelet node tree by reading the facelet XHTML file. procedure Load (Factory : in out Facelet_Factory; Name : in String; Context : in ASF.Contexts.Facelets.Facelet_Context'Class; Result : out Facelet); -- Update the factory to store the facelet node tree procedure Update (Factory : in out Facelet_Factory; Facelet : in Facelet_Access); -- ------------------------------ -- Returns True if the facelet is null/empty. -- ------------------------------ function Is_Null (F : Facelet) return Boolean is begin return F.Facelet = null; end Is_Null; -- ------------------------------ -- Get the facelet identified by the given name. If the facelet is already -- loaded, the cached value is returned. The facelet file is searched in -- a set of directories configured in the facelet factory. -- ------------------------------ procedure Find_Facelet (Factory : in out Facelet_Factory; Name : in String; Context : in ASF.Contexts.Facelets.Facelet_Context'Class; Result : out Facelet) is begin Log.Debug ("Find facelet {0}", Name); Find (Factory, Name, Result); if Result.Facelet = null then Load (Factory, Name, Context, Result); if Result.Facelet = null then return; end if; Update (Factory, Result.Facelet); end if; end Find_Facelet; -- ------------------------------ -- Create the component tree from the facelet view. -- ------------------------------ procedure Build_View (View : in Facelet; Context : in out ASF.Contexts.Facelets.Facelet_Context'Class; Root : in ASF.Components.Base.UIComponent_Access) is Old : Unbounded_String; begin if View.Facelet /= null then Context.Set_Relative_Path (Path => ASF.Views.Relative_Path (View.Facelet.File.all), Previous => Old); View.Facelet.Root.Build_Children (Parent => Root, Context => Context); Context.Set_Relative_Path (Path => Old); end if; end Build_View; -- ------------------------------ -- Initialize the facelet factory. -- Set the search directories for facelet files. -- Set the ignore white space configuration when reading XHTML files. -- Set the ignore empty lines configuration when reading XHTML files. -- Set the escape unknown tags configuration when reading XHTML files. -- ------------------------------ procedure Initialize (Factory : in out Facelet_Factory; Components : access ASF.Factory.Component_Factory; Paths : in String; Ignore_White_Spaces : in Boolean; Ignore_Empty_Lines : in Boolean; Escape_Unknown_Tags : in Boolean) is begin Log.Info ("Set facelet search directory to: '{0}'", Paths); Factory.Factory := Components; Factory.Paths := To_Unbounded_String (Paths); Factory.Ignore_White_Spaces := Ignore_White_Spaces; Factory.Ignore_Empty_Lines := Ignore_Empty_Lines; Factory.Escape_Unknown_Tags := Escape_Unknown_Tags; end Initialize; -- ------------------------------ -- Find the facelet file in one of the facelet directories. -- Returns the path to be used for reading the facelet file. -- ------------------------------ function Find_Facelet_Path (Factory : Facelet_Factory; Name : String) return String is begin return Util.Files.Find_File_Path (Name, To_String (Factory.Paths)); end Find_Facelet_Path; -- ------------------------------ -- Find in the factory for the facelet with the given name. -- ------------------------------ procedure Find (Factory : in out Facelet_Factory; Name : in String; Result : out Facelet) is use Ada.Directories; use Ada.Calendar; begin Result.Facelet := Factory.Map.Find (Name); if Result.Facelet /= null then declare Now : constant Ada.Calendar.Time := Ada.Calendar.Clock; begin if Result.Facelet.Check_Time < Now then if Modification_Time (Result.Facelet.File.Path) > Result.Facelet.Modify_Time then Log.Info ("Ignoring cache because file '{0}' was modified", Result.Facelet.File.Path); Result.Facelet := null; else Result.Facelet.Check_Time := Now + CHECK_FILE_DELAY; end if; end if; end; end if; end Find; -- ------------------------------ -- Load the facelet node tree by reading the facelet XHTML file. -- ------------------------------ procedure Load (Factory : in out Facelet_Factory; Name : in String; Context : in ASF.Contexts.Facelets.Facelet_Context'Class; Result : out Facelet) is Path : constant String := Find_Facelet_Path (Factory, Name); begin if Path = "" or else not Ada.Directories.Exists (Path) then Log.Warn ("Cannot read '{0}': file does not exist", Path); Result.Facelet := null; return; end if; declare use type Ada.Calendar.Time; Pos : constant Integer := Path'Last - Name'Length + 1; Now : constant Ada.Calendar.Time := Ada.Calendar.Clock + CHECK_FILE_DELAY; File : File_Info_Access; Reader : ASF.Views.Nodes.Reader.Xhtml_Reader; Read : Input_Sources.File.File_Input; Mtime : Ada.Calendar.Time; Ctx : aliased EL.Contexts.Default.Default_Context; Root : ASF.Views.Nodes.Tag_Node_Access; begin if Pos <= Path'First then File := Create_File_Info (Path, Path'First); else File := Create_File_Info (Path, Pos); end if; Log.Info ("Loading facelet: '{0}' - {1} - {2}", Path, Name, Natural'Image (File.Relative_Pos)); Ctx.Set_Function_Mapper (Context.Get_Function_Mapper); Mtime := Ada.Directories.Modification_Time (Path); Input_Sources.File.Open (Path, Read); -- If True, xmlns:* attributes will be reported in Start_Element Reader.Set_Feature (Sax.Readers.Namespace_Prefixes_Feature, False); Reader.Set_Feature (Sax.Readers.Validation_Feature, False); Reader.Set_Ignore_White_Spaces (Factory.Ignore_White_Spaces); Reader.Set_Escape_Unknown_Tags (Factory.Escape_Unknown_Tags); Reader.Set_Ignore_Empty_Lines (Factory.Ignore_Empty_Lines); begin Reader.Parse (File, Read, Factory.Factory, Ctx'Unchecked_Access); exception when ASF.Views.Nodes.Reader.Parsing_Error => Free (File); when E : others => Free (File); Log.Error ("Unexpected exception while reading: '{0}': {1}: {2}", Path, Ada.Exceptions.Exception_Name (E), Ada.Exceptions.Exception_Message (E)); end; Root := Reader.Get_Root; if File = null then if Root /= null then Root.Delete; end if; Result.Facelet := null; else Result.Facelet := new Facelet_Type '(Util.Refs.Ref_Entity with Len => Name'Length, Root => Root, File => File, Modify_Time => Mtime, Check_Time => Now, Name => Name); end if; Input_Sources.File.Close (Read); end; end Load; -- ------------------------------ -- Update the factory to store the facelet node tree -- ------------------------------ procedure Update (Factory : in out Facelet_Factory; Facelet : in Facelet_Access) is begin Factory.Map.Insert (Facelet); end Update; -- ------------------------------ -- Clear the facelet cache -- ------------------------------ procedure Clear_Cache (Factory : in out Facelet_Factory) is begin Log.Info ("Clearing facelet cache"); Factory.Map.Clear; end Clear_Cache; protected body Facelet_Cache is -- ------------------------------ -- Find the facelet entry associated with the given name. -- ------------------------------ function Find (Name : in String) return Facelet_Access is Key : aliased Facelet_Type := Facelet_Type '(Util.Refs.Ref_Entity with Len => Name'Length, Name => Name, others => <>); Pos : constant Facelet_Sets.Cursor := Map.Find (Key'Unchecked_Access); begin if Facelet_Sets.Has_Element (Pos) then return Element (Pos); else return null; end if; end Find; -- ------------------------------ -- Insert or replace the facelet entry associated with the given name. -- ------------------------------ procedure Insert (Facelet : in Facelet_Access) is begin Map.Include (Facelet); end Insert; -- ------------------------------ -- Clear the cache. -- ------------------------------ procedure Clear is begin loop declare Pos : Facelet_Sets.Cursor := Map.First; Node : Facelet_Access; begin exit when not Has_Element (Pos); Node := Element (Pos); Map.Delete (Pos); Free (Node.File); ASF.Views.Nodes.Destroy (Node.Root); Free (Node); end; end loop; end Clear; end Facelet_Cache; -- ------------------------------ -- Free the storage held by the factory cache. -- ------------------------------ overriding procedure Finalize (Factory : in out Facelet_Factory) is begin Factory.Clear_Cache; end Finalize; end ASF.Views.Facelets;

39.196875

99

0.527545

4d09d9e2de593e2a26a9a22fb7dfedffc42b31b3

7,667

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/system-linux-arm.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/system-linux-arm.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/system-linux-arm.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M -- -- -- -- S p e c -- -- (GNU-Linux/ARM Version) -- -- -- -- Copyright (C) 1992-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. -- -- -- ------------------------------------------------------------------------------ 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 := 63; Fine_Delta : constant := 2.0 ** (-Max_Mantissa); Tick : constant := 0.000_001; -- Storage-related Declarations type Address is private; pragma Preelaborable_Initialization (Address); Null_Address : constant Address; Storage_Unit : constant := 8; Word_Size : constant := Standard'Word_Size; Memory_Size : constant := 2 ** Long_Integer'Size; -- 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 := Bit_Order'Val (Standard'Default_Bit_Order); pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning -- Priority-related Declarations (RM D.1) -- 0 .. 98 corresponds to the system priority range 1 .. 99. -- -- If the scheduling policy is SCHED_FIFO or SCHED_RR the runtime makes use -- of the entire range provided by the system. -- -- If the scheduling policy is SCHED_OTHER the only valid system priority -- is 1 and other values are simply ignored. Max_Priority : constant Positive := 97; Max_Interrupt_Priority : constant Positive := 98; subtype Any_Priority is Integer range 0 .. 98; subtype Priority is Any_Priority range 0 .. 97; subtype Interrupt_Priority is Any_Priority range 98 .. 98; Default_Priority : constant Priority := 48; 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. Backend_Divide_Checks : constant Boolean := False; Backend_Overflow_Checks : constant Boolean := True; Command_Line_Args : constant Boolean := True; Configurable_Run_Time : constant Boolean := False; Denorm : constant Boolean := True; Duration_32_Bits : constant Boolean := False; 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 := True; Stack_Check_Limits : constant Boolean := False; Support_Aggregates : constant Boolean := True; Support_Atomic_Primitives : 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 := False; Suppress_Standard_Library : constant Boolean := False; Use_Ada_Main_Program_Name : constant Boolean := False; Frontend_Exceptions : constant Boolean := False; ZCX_By_Default : constant Boolean := True; end System;

48.525316

79

0.557715

313d66245e9026209840d07fecc780e9117c8162

6,435

ads

Ada

source/amf/uml/amf-uml-collaboration_uses.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-collaboration_uses.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-collaboration_uses.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- 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. ------------------------------------------------------------------------------ -- A collaboration use represents one particular use of a collaboration to -- explain the relationships between the properties of a classifier. A -- collaboration use shows how the pattern described by a collaboration is -- applied in a given context, by binding specific entities from that context -- to the roles of the collaboration. Depending on the context, these -- entities could be structural features of a classifier, instance -- specifications, or even roles in some containing collaboration. There may -- be multiple occurrences of a given collaboration within a classifier, each -- involving a different set of roles and connectors. A given role or -- connector may be involved in multiple occurrences of the same or different -- collaborations. Associated dependencies map features of the collaboration -- type to features in the classifier. These dependencies indicate which role -- in the classifier plays which role in the collaboration. ------------------------------------------------------------------------------ limited with AMF.UML.Collaborations; limited with AMF.UML.Dependencies.Collections; with AMF.UML.Named_Elements; package AMF.UML.Collaboration_Uses is pragma Preelaborate; type UML_Collaboration_Use is limited interface and AMF.UML.Named_Elements.UML_Named_Element; type UML_Collaboration_Use_Access is access all UML_Collaboration_Use'Class; for UML_Collaboration_Use_Access'Storage_Size use 0; not overriding function Get_Role_Binding (Self : not null access constant UML_Collaboration_Use) return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is abstract; -- Getter of CollaborationUse::roleBinding. -- -- A mapping between features of the collaboration type and features of -- the owning classifier. This mapping indicates which connectable element -- of the classifier plays which role(s) in the collaboration. A -- connectable element may be bound to multiple roles in the same -- collaboration use (that is, it may play multiple roles). not overriding function Get_Type (Self : not null access constant UML_Collaboration_Use) return AMF.UML.Collaborations.UML_Collaboration_Access is abstract; -- Getter of CollaborationUse::type. -- -- The collaboration which is used in this occurrence. The collaboration -- defines the cooperation between its roles which are mapped to -- properties of the classifier owning the collaboration use. not overriding procedure Set_Type (Self : not null access UML_Collaboration_Use; To : AMF.UML.Collaborations.UML_Collaboration_Access) is abstract; -- Setter of CollaborationUse::type. -- -- The collaboration which is used in this occurrence. The collaboration -- defines the cooperation between its roles which are mapped to -- properties of the classifier owning the collaboration use. end AMF.UML.Collaboration_Uses;

61.285714

81

0.551981

4d9e44c4caaae3b55f35b1d0a8e9f7d0aa64bd82

157

adb

Ada

source/environment/machine-apple-darwin/s-envblo.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/environment/machine-apple-darwin/s-envblo.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/environment/machine-apple-darwin/s-envblo.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

with C.crt_externs; function System.Environment_Block return C.char_ptr_ptr is begin return C.crt_externs.NSGetEnviron.all; end System.Environment_Block;

26.166667

58

0.840764

1daa11857cceae79b6f1234698a9b35b4cbd4fe7

5,143

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c52103r.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c52103r.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c52103r.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C52103R.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 ARRAY ASSIGNMENTS WITH MATCHING -- LENGTHS DO NOT CAUSE CONSTRAINT_ERROR TO BE RAISED AND -- ARE PERFORMED CORRECTLY. -- (OVERLAPS BETWEEN THE OPERANDS OF THE ASSIGNMENT STATEMENT -- ARE TREATED ELSWEWHERE.) -- THIS IS THE THIRD FILE IN -- DIVISION D : NULL LENGTHS NOT DETERMINABLE STATICALLY. -- RM 07/20/81 -- SPS 2/18/83 WITH REPORT; PROCEDURE C52103R IS USE REPORT ; BEGIN TEST( "C52103R" , "CHECK THAT IN ARRAY ASSIGNMENTS AND IN SLICE" & " ASSIGNMENTS THE LENGTHS MUST MATCH" ); -- ( EACH DIVISION COMPRISES 3 FILES, -- COVERING RESPECTIVELY THE FIRST -- 3 , NEXT 2 , AND LAST 3 OF THE 8 -- SELECTIONS FOR THE DIVISION.) ------------------------------------------------------------------- -- (7) UNSLICED OBJECTS OF THE PREDEFINED TYPE 'STRING' (BY -- THEMSELVES). DECLARE ARR71 : STRING( IDENT_INT(1)..IDENT_INT(0) ) := "" ; ARR72 : STRING( IDENT_INT(5)..IDENT_INT(4) ) ; BEGIN -- STRING ASSIGNMENT: ARR72 := ARR71 ; -- CHECKING THE VALUES AFTER THE STRING ASSIGNMENT: IF ARR72 /= "" THEN FAILED( "STRING ASSIGNMENT NOT CORRECT (7)" ); END IF; EXCEPTION WHEN OTHERS => FAILED( "EXCEPTION RAISED - SUBTEST 7" ); END ; ------------------------------------------------------------------- -- (8) SLICED OBJECTS OF THE PREDEFINED TYPE 'STRING' , WITH -- STRING LITERALS. -- DECLARE ARR82 : STRING( IDENT_INT(5)..IDENT_INT(9) ) ; BEGIN -- INITIALIZATION OF LHS ARRAY: ARR82( IDENT_INT(5)..IDENT_INT(9) ) := "QUINC" ; -- STRING LITERAL ASSIGNMENT: ARR82( IDENT_INT(5)..IDENT_INT(9) ) ( IDENT_INT(6)..IDENT_INT(9) ) ( IDENT_INT(6)..IDENT_INT(5) ) := "" ; -- CHECKING THE VALUES AFTER THE SLICE ASSIGNMENT: IF ARR82 /= "QUINC" OR ARR82( IDENT_INT(5)..IDENT_INT(9) ) /= "QUINC" THEN FAILED( "SLICE ASSIGNMENT NOT CORRECT (8)" ); END IF; EXCEPTION WHEN OTHERS => FAILED( "EXCEPTION RAISED - SUBTEST 8" ); END ; ------------------------------------------------------------------- -- (9) SLICED OBJECTS OF THE PREDEFINED TYPE 'STRING' (BY -- THEMSELVES). -- DECLARE SUBTYPE TA92 IS STRING( IDENT_INT(5)..IDENT_INT(9) ) ; ARR91 : STRING( IDENT_INT(1)..IDENT_INT(5) ) := "ABCDE" ; ARR92 : TA92 ; BEGIN -- INITIALIZATION OF LHS ARRAY: ARR92( IDENT_INT(5)..IDENT_INT(9) ) := "QUINC" ; -- STRING SLICE ASSIGNMENT: ARR92( IDENT_INT(5)..IDENT_INT(9) ) ( IDENT_INT(6)..IDENT_INT(9) ) ( IDENT_INT(8)..IDENT_INT(7) ) := ARR91 ( IDENT_INT(1)..IDENT_INT(5) ) ( IDENT_INT(5)..IDENT_INT(4) ) ; -- CHECKING THE VALUES AFTER THE SLICE ASSIGNMENT: IF ARR92 /= "QUINC" OR ARR92( IDENT_INT(5)..IDENT_INT(9) ) /= "QUINC" THEN FAILED( "SLICE ASSIGNMENT NOT CORRECT (9)" ); END IF; EXCEPTION WHEN OTHERS => FAILED( "EXCEPTION RAISED - SUBTEST 9" ); END ; ------------------------------------------------------------------- RESULT ; END C52103R;

28.258242

79

0.51118

1dd5f12f7185e978a8b9c54da80dead6a91f8162

3,458

ads

Ada

3-mid/opengl/private/freetype/source/freetype-face_size.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

3-mid/opengl/private/freetype/source/freetype-face_size.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

3-mid/opengl/private/freetype/source/freetype-face_size.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with freeType_C.FT_Face, freeType_C.FT_Size; package freetype.face_Size -- -- The face_Size class provides an abstraction layer for the Freetype Size type. -- is type Item is tagged private; type View is access all Item'Class; --------- --- Forge -- procedure destruct (Self : in out Item) is null; -------------- --- Attributes -- function CharSize (Self : access Item; Face : in freeType_C.FT_Face.item; point_Size : in Natural; x_Resolution, y_Resolution : in Natural) return Boolean; -- -- Sets the char size for the current face. -- -- This doesn't guarantee that the size was set correctly. Clients should call 'check Error' for -- more information if this function returns false. If an error does occur the size object isn't modified. -- -- Face: Parent face for this size object. -- point_Size: The face size in points (1/72 inch). -- x_Resolution: The horizontal resolution of the target device. -- y_Resolution: The vertical resolution of the target device. -- -- Returns true if the size has been set. function CharSize (Self : in Item) return Natural; -- Returns the char size in points. -- -- Get the char size for the current face. function Ascender (Self : in Item) return Float; -- Returns the Ascender height. -- -- Gets the global ascender height for the face in pixels. function Descender (Self : in Item) return Float; -- Returns the Descender height. -- -- Gets the global descender height for the face in pixels. function Height (Self : in Item) return Float; -- Returns the height in pixels. -- -- Gets the global face height for the face. -- -- If the face is scalable this returns the height of the global -- bounding box which ensures that any glyph will be less than or -- equal to this height. If the font isn't scalable there is no -- guarantee that glyphs will not be taller than this value. function Width (Self : in Item) return Float; -- Returns the width in pixels. -- -- Gets the global face width for the face. -- -- If the face is scalable this returns the width of the global -- bounding box which ensures that any glyph will be less than or -- equal to this width. If the font isn't scalable this value is -- the max_advance for the face. function Underline (Self : in Item) return Float; -- Returns the underline position in pixels. -- -- Gets the underline position for the face. function Error (Self : in Item) return freeType_C.FT_Error; -- Returns the current error code. -- -- Queries for errors. private type Item is tagged record ftFace : freeType_C.FT_Face.item; -- The current Freetype face that this FTSize object relates to. ftSize : freeType_C.FT_Size.item; -- The freetype Size. Size : Natural := 0; -- The size in points. xResolution, -- The horizontal resolution. yResolution : Natural := 0; -- The vertical resolution. Err : freeType_C.FT_Error := 0; -- Current error code. Zero means no error. end record; end freetype.face_Size;

33.25

115

0.616252

31839943b97d6e28a92bd20329416252a1c8f4bd

5,795

adb

Ada

src/implementation/yaml-events-queue.adb

robdaemon/AdaYaml

2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e

[ "MIT" ]

null

src/implementation/yaml-events-queue.adb

robdaemon/AdaYaml

2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e

[ "MIT" ]

null

src/implementation/yaml-events-queue.adb

robdaemon/AdaYaml

2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e

[ "MIT" ]

null

-- part of AdaYaml, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "copying.txt" package body Yaml.Events.Queue is procedure Adjust (Object : in out Reference) is begin Increase_Refcount (Object.Data); end Adjust; procedure Finalize (Object : in out Reference) is begin Decrease_Refcount (Object.Data); end Finalize; procedure Copy_Data (Source : Instance; Target : not null Event_Array_Access) is begin Target (1 .. Source.Data.all'Last - Source.First_Pos + 1) := Source.Data (Source.First_Pos .. Source.Data.all'Last); Target (Source.Data.all'Last - Source.First_Pos + 2 .. Source.Data.all'Last) := Source.Data (1 .. Source.First_Pos - 1); end Copy_Data; procedure Append (Object : in out Instance; E : Event) is Position : Mark; begin Append (Object, E, Position); end Append; function Next_Index (Object : Instance) return Positive is (((Object.First_Pos + Object.Length - 1) mod Object.Data.all'Length) + 1); procedure Append (Object : in out Instance; E : Event; Position : out Mark) is begin if Object.Stream_Count > 0 then raise State_Error with "cannot manipulate event queue while a Stream_Instance exists"; end if; if Object.Length = Object.Data.all'Length then Object.Grow; Object.First_Pos := 1; end if; Position := Mark (Next_Index (Object)); Object.Data (Positive (Position)) := E; Object.Length := Object.Length + 1; end Append; function Length (Object : in Instance) return Natural is (Object.Length); function Length (Object : Reference) return Natural is (Object.Data.Length); function First (Object : in Instance) return Event is begin if Object.Length = 0 then raise Constraint_Error with "no items in event queue"; end if; return Object.Data (Object.First_Pos); end First; procedure Dequeue (Object : in out Instance) is begin if Object.Stream_Count > 0 then raise State_Error with "cannot manipulate event queue while a Stream_Instance exists"; elsif Object.Length = 0 then raise Constraint_Error with "no items in event queue"; end if; Object.Length := Object.Length - 1; Object.First_Pos := Object.First_Pos + 1; if Object.First_Pos > Object.Data.all'Last then Object.First_Pos := 1; end if; end Dequeue; function Value (Object : Reference) return Accessor is ((Data => Object.Data)); function New_Queue return Reference is Ptr : constant not null access Instance := new Instance; begin return Reference'(Ada.Finalization.Controlled with Data => Ptr); end New_Queue; function Element (Object : Instance; Position : Mark) return Element_Accessor is Index : constant Positive := Positive (Position); begin if Index < Object.First_Pos and then Index >= Next_Index (Object) then raise State_Error with "no element at this index"; end if; return (Data => Object.Data (Index)'Unrestricted_Access); end Element; function As_Stream (Object : Reference'Class) return Stream_Reference is Ptr : constant not null access Stream_Instance := new Stream_Instance'(Refcount_Base with Buffer => Reference (Object), Offset => 0); begin Ptr.Buffer.Data.Stream_Count := Ptr.Buffer.Data.Stream_Count + 1; return Stream_Reference'(Ada.Finalization.Controlled with Data => Ptr); end As_Stream; function Value (Object : Stream_Reference) return Stream_Accessor is ((Data => Object.Data)); function Value (Object : Optional_Stream_Reference) return Stream_Accessor is ((Data => Object.Data)); function Next (Object : in out Stream_Instance) return Event is Index : constant Positive := (Object.Buffer.Data.First_Pos + Object.Offset) mod Object.Buffer.Data.Data.all'Last; begin if Object.Offset = Object.Buffer.Data.Length then raise Constraint_Error with "Tried to query more events than in queue"; else return E : constant Event := Object.Buffer.Data.Data (Index) do Object.Offset := Object.Offset + 1; end return; end if; end Next; function Required (Object : Optional_Stream_Reference'Class) return Stream_Reference is begin Object.Data.Increase_Refcount; return (Ada.Finalization.Controlled with Data => Object.Data); end Required; function Optional (Object : Stream_Reference'Class) return Optional_Stream_Reference is begin Object.Data.Increase_Refcount; return (Ada.Finalization.Controlled with Data => Object.Data); end Optional; procedure Finalize (Object : in out Stream_Instance) is begin Object.Buffer.Data.Stream_Count := Object.Buffer.Data.Stream_Count - 1; end Finalize; overriding procedure Adjust (Object : in out Stream_Reference) is begin Increase_Refcount (Object.Data); end Adjust; procedure Finalize (Object : in out Stream_Reference) is begin Decrease_Refcount (Object.Data); end Finalize; overriding procedure Adjust (Object : in out Optional_Stream_Reference) is begin if Object.Data /= null then Increase_Refcount (Object.Data); end if; end Adjust; procedure Finalize (Object : in out Optional_Stream_Reference) is begin if Object.Data /= null then Decrease_Refcount (Object.Data); end if; end Finalize; end Yaml.Events.Queue;

33.69186

80

0.65384

1d6e79f91bd06c2f2a22ecde7f0ff37360c6081b

4,881

adb

Ada

awa/src/awa-converters-dates.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/src/awa-converters-dates.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/src/awa-converters-dates.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-converters-dates -- Date Converters -- Copyright (C) 2012, 2013, 2014 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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.Calendar; with Ada.Exceptions; with Ada.Strings.Unbounded; with Util.Locales; with Util.Dates.Formats; with Util.Properties.Bundles; with Util.Beans.Objects.Time; with ASF.Locales; with ASF.Utils; with ASF.Applications.Main; package body AWA.Converters.Dates is ONE_HOUR : constant Duration := 3600.0; ONE_DAY : constant Duration := 24 * ONE_HOUR; -- ------------------------------ -- Convert the object value into a string. The object value is associated -- with the specified component. -- If the string cannot be converted, the Invalid_Conversion exception should be raised. -- ------------------------------ overriding function To_String (Convert : in Relative_Date_Converter; Context : in ASF.Contexts.Faces.Faces_Context'Class; Component : in ASF.Components.Base.UIComponent'Class; Value : in Util.Beans.Objects.Object) return String is Bundle : ASF.Locales.Bundle; Locale : constant Util.Locales.Locale := Context.Get_Locale; begin begin ASF.Applications.Main.Load_Bundle (Context.Get_Application.all, Name => "dates", Locale => Util.Locales.To_String (Locale), Bundle => Bundle); exception when E : Util.Properties.Bundles.NO_BUNDLE => Component.Log_Error ("Cannot localize dates: {0}", Ada.Exceptions.Exception_Message (E)); end; -- Convert the value as a date here so that we can raise an Invalid_Conversion exception. declare use Ada.Calendar; Date : constant Ada.Calendar.Time := Util.Beans.Objects.Time.To_Time (Value); Now : constant Ada.Calendar.Time := Ada.Calendar.Clock; Dt : constant Duration := Now - Date; Values : ASF.Utils.Object_Array (1 .. 1); Result : Ada.Strings.Unbounded.Unbounded_String; begin if Dt < 60.0 then return Bundle.Get ("date_moment_ago"); elsif Dt < 120.0 then return Bundle.Get ("date_minute_ago"); elsif Dt < ONE_HOUR then Values (1) := Util.Beans.Objects.To_Object (Natural (Dt / 60.0)); ASF.Utils.Formats.Format (Bundle.Get ("date_minutes_ago"), Values, Result); elsif Dt < 2 * ONE_HOUR then Values (1) := Util.Beans.Objects.To_Object (Natural (Dt / 60.0)); ASF.Utils.Formats.Format (Bundle.Get ("date_hour_ago"), Values, Result); elsif Dt < ONE_DAY then Values (1) := Util.Beans.Objects.To_Object (Natural (Dt / ONE_HOUR)); ASF.Utils.Formats.Format (Bundle.Get ("date_hours_ago"), Values, Result); elsif Dt < 2 * ONE_DAY then Values (1) := Util.Beans.Objects.To_Object (Natural (Dt / ONE_HOUR)); ASF.Utils.Formats.Format (Bundle.Get ("date_day_ago"), Values, Result); elsif Dt < 7 * ONE_DAY then Values (1) := Util.Beans.Objects.To_Object (Natural (Dt / ONE_DAY)); ASF.Utils.Formats.Format (Bundle.Get ("date_days_ago"), Values, Result); else declare use ASF.Converters.Dates; Pattern : constant String := Date_Converter'Class (Convert).Get_Pattern (Context, Bundle, Component); begin return Util.Dates.Formats.Format (Pattern, Date, Bundle); end; end if; return Ada.Strings.Unbounded.To_String (Result); end; exception when E : others => raise ASF.Converters.Invalid_Conversion with Ada.Exceptions.Exception_Message (E); end To_String; end AWA.Converters.Dates;

40.338843

96

0.569555

31d9564330cd67123727719b7a9b1f6cbb09c7bd

808

ads

Ada

firmware/coreboot/3rdparty/libgfxinit/common/ironlake/hw-gfx-gma-pch-hdmi.ads

fabiojna02/OpenCellular

45b6a202d6b2e2485c89955b9a6da920c4d56ddb

[ "CC-BY-4.0", "BSD-3-Clause" ]

1

2019-11-04T07:11:25.000Z

firmware/coreboot/3rdparty/libgfxinit/common/ironlake/hw-gfx-gma-pch-hdmi.ads

aimin-wang/OpenCellular

5308146bf7edf43cc81c0e4d15305b711117070a

[ "CC-BY-4.0", "BSD-3-Clause" ]

13

2018-10-12T21:29:09.000Z

2018-10-25T20:06:51.000Z

firmware/coreboot/3rdparty/libgfxinit/common/ironlake/hw-gfx-gma-pch-hdmi.ads

aimin-wang/OpenCellular

5308146bf7edf43cc81c0e4d15305b711117070a

[ "CC-BY-4.0", "BSD-3-Clause" ]

null

-- -- Copyright (C) 2016 secunet Security Networks AG -- -- 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 2 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. -- package HW.GFX.GMA.PCH.HDMI is procedure On (Port_Cfg : Port_Config; FDI_Port : FDI_Port_Type) with Pre => Port_Cfg.PCH_Port in PCH_HDMI_Port; procedure Off (Port : PCH_HDMI_Port); procedure All_Off; end HW.GFX.GMA.PCH.HDMI;

31.076923

71

0.740099

31611274771afa08620727c4e6768c2a92d900d2

38,732

ads

Ada

src/bitmap_fonts/giza-bitmap_fonts-freesans18pt7b.ads

Fabien-Chouteau/Giza

9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd

[ "BSD-3-Clause" ]

7

2017-10-18T02:40:24.000Z

2020-12-19T22:41:19.000Z

src/bitmap_fonts/giza-bitmap_fonts-freesans18pt7b.ads

Fabien-Chouteau/Giza

9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd

[ "BSD-3-Clause" ]

null

src/bitmap_fonts/giza-bitmap_fonts-freesans18pt7b.ads

Fabien-Chouteau/Giza

9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd

[ "BSD-3-Clause" ]

2

2019-05-06T08:30:26.000Z

2020-11-22T11:27:27.000Z

package Giza.Bitmap_Fonts.FreeSans18pt7b is Font : constant Giza.Font.Ref_Const; private FreeSans18pt7bBitmaps : aliased constant Font_Bitmap := ( 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C9#, 16#20#, 16#3F#, 16#FC#, 16#E3#, 16#F1#, 16#F8#, 16#FC#, 16#7E#, 16#3F#, 16#1F#, 16#8E#, 16#82#, 16#41#, 16#00#, 16#01#, 16#C3#, 16#80#, 16#38#, 16#70#, 16#06#, 16#0E#, 16#00#, 16#C1#, 16#80#, 16#38#, 16#70#, 16#07#, 16#0E#, 16#0F#, 16#FF#, 16#F9#, 16#FF#, 16#FF#, 16#3F#, 16#FF#, 16#E0#, 16#E1#, 16#C0#, 16#1C#, 16#38#, 16#03#, 16#87#, 16#00#, 16#70#, 16#E0#, 16#0C#, 16#18#, 16#3F#, 16#FF#, 16#F7#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#C1#, 16#C3#, 16#80#, 16#30#, 16#60#, 16#06#, 16#0C#, 16#01#, 16#C3#, 16#80#, 16#38#, 16#70#, 16#07#, 16#0E#, 16#00#, 16#C1#, 16#80#, 16#03#, 16#00#, 16#0F#, 16#C0#, 16#3F#, 16#F0#, 16#3F#, 16#F8#, 16#7B#, 16#3C#, 16#F3#, 16#1C#, 16#E3#, 16#0E#, 16#E3#, 16#0E#, 16#E3#, 16#0E#, 16#E3#, 16#00#, 16#E3#, 16#00#, 16#F3#, 16#00#, 16#7B#, 16#00#, 16#7F#, 16#80#, 16#1F#, 16#F0#, 16#07#, 16#FC#, 16#03#, 16#7E#, 16#03#, 16#0F#, 16#03#, 16#07#, 16#E3#, 16#07#, 16#E3#, 16#07#, 16#E3#, 16#07#, 16#E3#, 16#0F#, 16#73#, 16#3E#, 16#7F#, 16#FC#, 16#3F#, 16#F8#, 16#0F#, 16#E0#, 16#03#, 16#00#, 16#03#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#78#, 16#00#, 16#E0#, 16#0F#, 16#F0#, 16#06#, 16#00#, 16#FF#, 16#C0#, 16#70#, 16#07#, 16#0E#, 16#03#, 16#00#, 16#70#, 16#38#, 16#30#, 16#03#, 16#00#, 16#C1#, 16#80#, 16#18#, 16#06#, 16#18#, 16#00#, 16#E0#, 16#70#, 16#C0#, 16#03#, 16#87#, 16#8C#, 16#00#, 16#1F#, 16#F8#, 16#E0#, 16#00#, 16#7F#, 16#86#, 16#00#, 16#01#, 16#F8#, 16#70#, 16#00#, 16#00#, 16#03#, 16#03#, 16#C0#, 16#00#, 16#38#, 16#7F#, 16#80#, 16#01#, 16#87#, 16#FE#, 16#00#, 16#18#, 16#38#, 16#70#, 16#00#, 16#C3#, 16#81#, 16#C0#, 16#0C#, 16#18#, 16#06#, 16#00#, 16#60#, 16#C0#, 16#30#, 16#06#, 16#07#, 16#03#, 16#80#, 16#70#, 16#1C#, 16#38#, 16#03#, 16#00#, 16#FF#, 16#C0#, 16#38#, 16#03#, 16#FC#, 16#01#, 16#80#, 16#07#, 16#80#, 16#01#, 16#F0#, 16#00#, 16#7F#, 16#80#, 16#0F#, 16#FC#, 16#01#, 16#E1#, 16#E0#, 16#1C#, 16#0E#, 16#01#, 16#C0#, 16#E0#, 16#1C#, 16#0E#, 16#01#, 16#E1#, 16#E0#, 16#0E#, 16#3C#, 16#00#, 16#77#, 16#80#, 16#07#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#E0#, 16#03#, 16#CF#, 16#1C#, 16#78#, 16#79#, 16#C7#, 16#03#, 16#DC#, 16#E0#, 16#1F#, 16#8E#, 16#00#, 16#F8#, 16#E0#, 16#0F#, 16#0E#, 16#00#, 16#70#, 16#F0#, 16#0F#, 16#87#, 16#C3#, 16#FC#, 16#7F#, 16#FD#, 16#C3#, 16#FF#, 16#0E#, 16#0F#, 16#C0#, 16#F0#, 16#FF#, 16#FF#, 16#FA#, 16#40#, 16#06#, 16#06#, 16#0C#, 16#0C#, 16#18#, 16#18#, 16#38#, 16#30#, 16#70#, 16#70#, 16#70#, 16#60#, 16#E0#, 16#E0#, 16#E0#, 16#E0#, 16#E0#, 16#E0#, 16#E0#, 16#E0#, 16#E0#, 16#60#, 16#70#, 16#70#, 16#70#, 16#30#, 16#38#, 16#18#, 16#18#, 16#0C#, 16#0C#, 16#06#, 16#03#, 16#C0#, 16#60#, 16#30#, 16#30#, 16#38#, 16#18#, 16#1C#, 16#0C#, 16#0E#, 16#0E#, 16#0E#, 16#06#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#06#, 16#0E#, 16#0E#, 16#0E#, 16#0C#, 16#1C#, 16#18#, 16#38#, 16#30#, 16#30#, 16#60#, 16#C0#, 16#0C#, 16#03#, 16#00#, 16#C3#, 16#B7#, 16#FF#, 16#C7#, 16#81#, 16#E0#, 16#FC#, 16#73#, 16#88#, 16#40#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#01#, 16#80#, 16#FF#, 16#F6#, 16#DA#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#C0#, 16#30#, 16#08#, 16#06#, 16#01#, 16#80#, 16#40#, 16#30#, 16#0C#, 16#02#, 16#01#, 16#80#, 16#60#, 16#10#, 16#0C#, 16#03#, 16#00#, 16#80#, 16#60#, 16#18#, 16#04#, 16#03#, 16#00#, 16#C0#, 16#20#, 16#18#, 16#06#, 16#01#, 16#00#, 16#C0#, 16#30#, 16#00#, 16#07#, 16#E0#, 16#0F#, 16#F8#, 16#1F#, 16#FC#, 16#3C#, 16#3C#, 16#78#, 16#1E#, 16#70#, 16#0E#, 16#70#, 16#0E#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#0F#, 16#70#, 16#0E#, 16#70#, 16#0E#, 16#78#, 16#1E#, 16#3C#, 16#3C#, 16#1F#, 16#F8#, 16#1F#, 16#F0#, 16#07#, 16#E0#, 16#03#, 16#03#, 16#07#, 16#0F#, 16#3F#, 16#FF#, 16#FF#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#07#, 16#E0#, 16#1F#, 16#F8#, 16#3F#, 16#FC#, 16#7C#, 16#3E#, 16#70#, 16#0F#, 16#F0#, 16#0F#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#00#, 16#07#, 16#00#, 16#07#, 16#00#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#00#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#3C#, 16#00#, 16#38#, 16#00#, 16#70#, 16#00#, 16#60#, 16#00#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#07#, 16#F0#, 16#07#, 16#FE#, 16#07#, 16#FF#, 16#87#, 16#83#, 16#C3#, 16#80#, 16#F3#, 16#80#, 16#39#, 16#C0#, 16#1C#, 16#E0#, 16#0E#, 16#00#, 16#07#, 16#00#, 16#0F#, 16#00#, 16#7F#, 16#00#, 16#3F#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#00#, 16#03#, 16#F0#, 16#01#, 16#F8#, 16#00#, 16#FE#, 16#00#, 16#77#, 16#00#, 16#73#, 16#E0#, 16#F8#, 16#FF#, 16#F8#, 16#3F#, 16#F8#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#01#, 16#F8#, 16#03#, 16#B8#, 16#03#, 16#38#, 16#07#, 16#38#, 16#0E#, 16#38#, 16#1C#, 16#38#, 16#18#, 16#38#, 16#38#, 16#38#, 16#70#, 16#38#, 16#60#, 16#38#, 16#E0#, 16#38#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#38#, 16#1F#, 16#FF#, 16#0F#, 16#FF#, 16#8F#, 16#FF#, 16#C7#, 16#00#, 16#03#, 16#80#, 16#01#, 16#C0#, 16#00#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#39#, 16#F0#, 16#3B#, 16#FE#, 16#1F#, 16#FF#, 16#8F#, 16#83#, 16#E7#, 16#00#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#0E#, 16#00#, 16#07#, 16#00#, 16#03#, 16#80#, 16#01#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#EF#, 16#00#, 16#73#, 16#C0#, 16#F0#, 16#FF#, 16#F8#, 16#3F#, 16#F8#, 16#07#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#0F#, 16#F8#, 16#1F#, 16#FC#, 16#3C#, 16#1E#, 16#38#, 16#0E#, 16#70#, 16#0E#, 16#70#, 16#00#, 16#60#, 16#00#, 16#E0#, 16#00#, 16#E3#, 16#E0#, 16#EF#, 16#F8#, 16#FF#, 16#FC#, 16#FC#, 16#3E#, 16#F0#, 16#0E#, 16#F0#, 16#0F#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#60#, 16#07#, 16#70#, 16#0F#, 16#70#, 16#0E#, 16#3C#, 16#3E#, 16#3F#, 16#FC#, 16#1F#, 16#F8#, 16#07#, 16#E0#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#06#, 16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#18#, 16#00#, 16#38#, 16#00#, 16#70#, 16#00#, 16#60#, 16#00#, 16#E0#, 16#00#, 16#C0#, 16#01#, 16#C0#, 16#01#, 16#80#, 16#03#, 16#80#, 16#03#, 16#80#, 16#07#, 16#00#, 16#07#, 16#00#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#0E#, 16#00#, 16#0E#, 16#00#, 16#0C#, 16#00#, 16#1C#, 16#00#, 16#1C#, 16#00#, 16#07#, 16#F0#, 16#0F#, 16#FE#, 16#0F#, 16#FF#, 16#87#, 16#83#, 16#C7#, 16#80#, 16#F3#, 16#80#, 16#39#, 16#C0#, 16#1C#, 16#E0#, 16#0E#, 16#78#, 16#0F#, 16#1E#, 16#0F#, 16#07#, 16#FF#, 16#01#, 16#FF#, 16#03#, 16#FF#, 16#E3#, 16#E0#, 16#F9#, 16#C0#, 16#1D#, 16#C0#, 16#0F#, 16#E0#, 16#03#, 16#F0#, 16#01#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#F7#, 16#00#, 16#73#, 16#E0#, 16#F8#, 16#FF#, 16#F8#, 16#3F#, 16#F8#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#E0#, 16#1F#, 16#F8#, 16#3F#, 16#FC#, 16#7C#, 16#3C#, 16#70#, 16#0E#, 16#F0#, 16#0E#, 16#E0#, 16#06#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#0F#, 16#70#, 16#0F#, 16#78#, 16#3F#, 16#3F#, 16#FF#, 16#1F#, 16#F7#, 16#07#, 16#C7#, 16#00#, 16#07#, 16#00#, 16#06#, 16#00#, 16#0E#, 16#70#, 16#0E#, 16#70#, 16#1C#, 16#78#, 16#3C#, 16#3F#, 16#F8#, 16#1F#, 16#F0#, 16#07#, 16#C0#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#B6#, 16#D6#, 16#00#, 16#00#, 16#80#, 16#03#, 16#C0#, 16#07#, 16#E0#, 16#0F#, 16#C0#, 16#3F#, 16#80#, 16#7E#, 16#00#, 16#FC#, 16#01#, 16#F0#, 16#00#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#80#, 16#07#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#00#, 16#01#, 16#80#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#80#, 16#00#, 16#70#, 16#00#, 16#3E#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#C0#, 16#03#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#7F#, 16#00#, 16#FC#, 16#01#, 16#F8#, 16#03#, 16#F0#, 16#01#, 16#C0#, 16#00#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#7F#, 16#E1#, 16#FF#, 16#E3#, 16#C3#, 16#EF#, 16#01#, 16#FC#, 16#01#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#38#, 16#00#, 16#F0#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#7C#, 16#00#, 16#E0#, 16#03#, 16#C0#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#03#, 16#80#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#01#, 16#F8#, 16#0F#, 16#E0#, 16#03#, 16#E0#, 16#01#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F8#, 16#0F#, 16#00#, 16#00#, 16#3C#, 16#1E#, 16#00#, 16#00#, 16#1E#, 16#3C#, 16#03#, 16#E0#, 16#1E#, 16#38#, 16#0F#, 16#F3#, 16#8E#, 16#78#, 16#1E#, 16#3F#, 16#0F#, 16#70#, 16#38#, 16#1F#, 16#07#, 16#70#, 16#78#, 16#0F#, 16#07#, 16#E0#, 16#70#, 16#0E#, 16#07#, 16#E0#, 16#70#, 16#0E#, 16#07#, 16#E0#, 16#E0#, 16#0E#, 16#07#, 16#E0#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#E0#, 16#1C#, 16#0E#, 16#E0#, 16#E0#, 16#1C#, 16#0E#, 16#E0#, 16#E0#, 16#38#, 16#1C#, 16#F0#, 16#70#, 16#78#, 16#3C#, 16#70#, 16#78#, 16#FC#, 16#78#, 16#78#, 16#3F#, 16#DF#, 16#F0#, 16#38#, 16#1F#, 16#0F#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#0E#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#DC#, 16#00#, 16#07#, 16#78#, 16#00#, 16#3C#, 16#E0#, 16#00#, 16#E3#, 16#80#, 16#03#, 16#8F#, 16#00#, 16#1E#, 16#1C#, 16#00#, 16#70#, 16#70#, 16#01#, 16#C1#, 16#E0#, 16#0E#, 16#03#, 16#80#, 16#38#, 16#0E#, 16#00#, 16#E0#, 16#3C#, 16#07#, 16#FF#, 16#F0#, 16#1F#, 16#FF#, 16#E0#, 16#FF#, 16#FF#, 16#83#, 16#C0#, 16#0E#, 16#0E#, 16#00#, 16#3C#, 16#78#, 16#00#, 16#F1#, 16#C0#, 16#01#, 16#C7#, 16#00#, 16#07#, 16#BC#, 16#00#, 16#1E#, 16#E0#, 16#00#, 16#3B#, 16#80#, 16#00#, 16#F0#, 16#FF#, 16#FC#, 16#1F#, 16#FF#, 16#E3#, 16#FF#, 16#FE#, 16#70#, 16#03#, 16#CE#, 16#00#, 16#3D#, 16#C0#, 16#03#, 16#B8#, 16#00#, 16#77#, 16#00#, 16#0E#, 16#E0#, 16#01#, 16#DC#, 16#00#, 16#73#, 16#80#, 16#1E#, 16#7F#, 16#FF#, 16#8F#, 16#FF#, 16#F1#, 16#FF#, 16#FF#, 16#38#, 16#00#, 16#F7#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#C0#, 16#03#, 16#F8#, 16#00#, 16#F7#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#FF#, 16#FE#, 16#07#, 16#E0#, 16#7C#, 16#3E#, 16#00#, 16#78#, 16#F0#, 16#00#, 16#E7#, 16#80#, 16#03#, 16#DC#, 16#00#, 16#07#, 16#70#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#1D#, 16#C0#, 16#00#, 16#77#, 16#00#, 16#03#, 16#DE#, 16#00#, 16#0E#, 16#3C#, 16#00#, 16#78#, 16#F8#, 16#03#, 16#C1#, 16#F8#, 16#1F#, 16#03#, 16#FF#, 16#F8#, 16#03#, 16#FF#, 16#C0#, 16#03#, 16#F8#, 16#00#, 16#FF#, 16#F8#, 16#0F#, 16#FF#, 16#E0#, 16#FF#, 16#FF#, 16#0E#, 16#00#, 16#F8#, 16#E0#, 16#03#, 16#CE#, 16#00#, 16#1C#, 16#E0#, 16#00#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#FE#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#7E#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#7E#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#7E#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#01#, 16#EE#, 16#00#, 16#3C#, 16#E0#, 16#0F#, 16#8F#, 16#FF#, 16#F0#, 16#FF#, 16#FE#, 16#0F#, 16#FF#, 16#80#, 16#FF#, 16#FF#, 16#BF#, 16#FF#, 16#EF#, 16#FF#, 16#FB#, 16#80#, 16#00#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#0E#, 16#00#, 16#03#, 16#80#, 16#00#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#0E#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#BF#, 16#FF#, 16#EE#, 16#00#, 16#03#, 16#80#, 16#00#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#0E#, 16#00#, 16#03#, 16#80#, 16#00#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#0E#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#0E#, 16#00#, 16#07#, 16#00#, 16#03#, 16#80#, 16#01#, 16#C0#, 16#00#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#38#, 16#00#, 16#1F#, 16#FF#, 16#CF#, 16#FF#, 16#E7#, 16#FF#, 16#F3#, 16#80#, 16#01#, 16#C0#, 16#00#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#38#, 16#00#, 16#1C#, 16#00#, 16#0E#, 16#00#, 16#07#, 16#00#, 16#03#, 16#80#, 16#01#, 16#C0#, 16#00#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#03#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#F8#, 16#0F#, 16#80#, 16#FC#, 16#1E#, 16#00#, 16#3E#, 16#3C#, 16#00#, 16#0E#, 16#78#, 16#00#, 16#0F#, 16#70#, 16#00#, 16#07#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#E0#, 16#03#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#70#, 16#00#, 16#07#, 16#70#, 16#00#, 16#0F#, 16#78#, 16#00#, 16#0F#, 16#3C#, 16#00#, 16#1F#, 16#1E#, 16#00#, 16#3F#, 16#0F#, 16#C0#, 16#F7#, 16#07#, 16#FF#, 16#E7#, 16#03#, 16#FF#, 16#C3#, 16#00#, 16#FF#, 16#03#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1C#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#07#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#07#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#07#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#07#, 16#00#, 16#1F#, 16#80#, 16#7E#, 16#01#, 16#F8#, 16#07#, 16#E0#, 16#1F#, 16#C0#, 16#F7#, 16#87#, 16#9F#, 16#FE#, 16#3F#, 16#F0#, 16#3F#, 16#00#, 16#E0#, 16#01#, 16#EE#, 16#00#, 16#3C#, 16#E0#, 16#07#, 16#8E#, 16#00#, 16#F0#, 16#E0#, 16#1E#, 16#0E#, 16#03#, 16#C0#, 16#E0#, 16#38#, 16#0E#, 16#07#, 16#00#, 16#E0#, 16#E0#, 16#0E#, 16#1C#, 16#00#, 16#E3#, 16#80#, 16#0E#, 16#7C#, 16#00#, 16#EF#, 16#E0#, 16#0F#, 16#CF#, 16#00#, 16#F8#, 16#F0#, 16#0F#, 16#07#, 16#80#, 16#E0#, 16#3C#, 16#0E#, 16#03#, 16#C0#, 16#E0#, 16#1E#, 16#0E#, 16#00#, 16#F0#, 16#E0#, 16#0F#, 16#0E#, 16#00#, 16#78#, 16#E0#, 16#03#, 16#CE#, 16#00#, 16#3C#, 16#E0#, 16#01#, 16#EE#, 16#00#, 16#0F#, 16#E0#, 16#01#, 16#C0#, 16#03#, 16#80#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#38#, 16#00#, 16#70#, 16#00#, 16#E0#, 16#01#, 16#C0#, 16#03#, 16#80#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#38#, 16#00#, 16#70#, 16#00#, 16#E0#, 16#01#, 16#C0#, 16#03#, 16#80#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#38#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#F8#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#3F#, 16#EE#, 16#00#, 16#77#, 16#EE#, 16#00#, 16#77#, 16#EE#, 16#00#, 16#77#, 16#E7#, 16#00#, 16#E7#, 16#E7#, 16#00#, 16#E7#, 16#E7#, 16#80#, 16#E7#, 16#E3#, 16#81#, 16#C7#, 16#E3#, 16#81#, 16#C7#, 16#E3#, 16#C1#, 16#C7#, 16#E1#, 16#C3#, 16#87#, 16#E1#, 16#C3#, 16#87#, 16#E1#, 16#E3#, 16#87#, 16#E0#, 16#E7#, 16#07#, 16#E0#, 16#E7#, 16#07#, 16#E0#, 16#F7#, 16#07#, 16#E0#, 16#7E#, 16#07#, 16#E0#, 16#7E#, 16#07#, 16#E0#, 16#7E#, 16#07#, 16#E0#, 16#3C#, 16#07#, 16#E0#, 16#3C#, 16#07#, 16#F0#, 16#00#, 16#7F#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#7F#, 16#C0#, 16#07#, 16#FC#, 16#00#, 16#7F#, 16#E0#, 16#07#, 16#EF#, 16#00#, 16#7E#, 16#F0#, 16#07#, 16#E7#, 16#80#, 16#7E#, 16#3C#, 16#07#, 16#E3#, 16#C0#, 16#7E#, 16#1E#, 16#07#, 16#E0#, 16#F0#, 16#7E#, 16#0F#, 16#07#, 16#E0#, 16#78#, 16#7E#, 16#03#, 16#C7#, 16#E0#, 16#3C#, 16#7E#, 16#01#, 16#E7#, 16#E0#, 16#0F#, 16#7E#, 16#00#, 16#F7#, 16#E0#, 16#07#, 16#FE#, 16#00#, 16#7F#, 16#E0#, 16#03#, 16#FE#, 16#00#, 16#1F#, 16#E0#, 16#01#, 16#FE#, 16#00#, 16#0F#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FC#, 16#01#, 16#F0#, 16#1F#, 16#01#, 16#E0#, 16#03#, 16#C1#, 16#E0#, 16#00#, 16#F1#, 16#E0#, 16#00#, 16#3C#, 16#E0#, 16#00#, 16#0E#, 16#70#, 16#00#, 16#07#, 16#70#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#03#, 16#B8#, 16#00#, 16#03#, 16#9C#, 16#00#, 16#01#, 16#CF#, 16#00#, 16#01#, 16#E3#, 16#C0#, 16#01#, 16#E0#, 16#F0#, 16#01#, 16#E0#, 16#3E#, 16#03#, 16#E0#, 16#0F#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#FF#, 16#FC#, 16#3F#, 16#FF#, 16#8F#, 16#FF#, 16#F3#, 16#80#, 16#3E#, 16#E0#, 16#03#, 16#F8#, 16#00#, 16#7E#, 16#00#, 16#1F#, 16#80#, 16#07#, 16#E0#, 16#01#, 16#F8#, 16#00#, 16#7E#, 16#00#, 16#3F#, 16#80#, 16#1E#, 16#FF#, 16#FF#, 16#3F#, 16#FF#, 16#8F#, 16#FF#, 16#C3#, 16#80#, 16#00#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#0E#, 16#00#, 16#03#, 16#80#, 16#00#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#0E#, 16#00#, 16#03#, 16#80#, 16#00#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FC#, 16#01#, 16#F0#, 16#1F#, 16#01#, 16#E0#, 16#03#, 16#C1#, 16#E0#, 16#00#, 16#F1#, 16#E0#, 16#00#, 16#3C#, 16#E0#, 16#00#, 16#0E#, 16#70#, 16#00#, 16#07#, 16#70#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#07#, 16#B8#, 16#00#, 16#03#, 16#9C#, 16#00#, 16#01#, 16#CF#, 16#00#, 16#39#, 16#E3#, 16#C0#, 16#1F#, 16#E0#, 16#F0#, 16#07#, 16#E0#, 16#3E#, 16#03#, 16#F0#, 16#0F#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#EE#, 16#00#, 16#3F#, 16#83#, 16#80#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#20#, 16#FF#, 16#FE#, 16#0F#, 16#FF#, 16#F8#, 16#FF#, 16#FF#, 16#CE#, 16#00#, 16#3C#, 16#E0#, 16#01#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#01#, 16#CE#, 16#00#, 16#3C#, 16#FF#, 16#FF#, 16#8F#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#8E#, 16#00#, 16#3C#, 16#E0#, 16#01#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#EE#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#FE#, 16#00#, 16#0F#, 16#03#, 16#FC#, 16#00#, 16#FF#, 16#F0#, 16#1F#, 16#FF#, 16#83#, 16#E0#, 16#7C#, 16#38#, 16#01#, 16#E7#, 16#00#, 16#0E#, 16#70#, 16#00#, 16#E7#, 16#00#, 16#00#, 16#70#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#7E#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#77#, 16#80#, 16#0E#, 16#7C#, 16#03#, 16#E3#, 16#FF#, 16#FC#, 16#1F#, 16#FF#, 16#80#, 16#3F#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#70#, 16#00#, 16#0E#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#38#, 16#00#, 16#07#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#1C#, 16#00#, 16#03#, 16#80#, 16#00#, 16#70#, 16#00#, 16#0E#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#38#, 16#00#, 16#07#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#1C#, 16#00#, 16#03#, 16#80#, 16#00#, 16#70#, 16#00#, 16#0E#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#38#, 16#00#, 16#07#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#1C#, 16#00#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#7F#, 16#00#, 16#1E#, 16#F0#, 16#07#, 16#9F#, 16#01#, 16#F1#, 16#FF#, 16#FC#, 16#1F#, 16#FE#, 16#00#, 16#7F#, 16#00#, 16#E0#, 16#00#, 16#3F#, 16#80#, 16#03#, 16#FC#, 16#00#, 16#1D#, 16#E0#, 16#00#, 16#E7#, 16#80#, 16#0E#, 16#3C#, 16#00#, 16#70#, 16#E0#, 16#03#, 16#87#, 16#80#, 16#38#, 16#3C#, 16#01#, 16#C0#, 16#E0#, 16#0E#, 16#07#, 16#80#, 16#E0#, 16#3C#, 16#07#, 16#00#, 16#E0#, 16#38#, 16#07#, 16#83#, 16#80#, 16#3C#, 16#1C#, 16#00#, 16#F0#, 16#E0#, 16#07#, 16#8E#, 16#00#, 16#1C#, 16#70#, 16#00#, 16#F3#, 16#00#, 16#07#, 16#B8#, 16#00#, 16#1D#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#0F#, 16#70#, 16#03#, 16#C0#, 16#0F#, 16#78#, 16#03#, 16#E0#, 16#0F#, 16#78#, 16#03#, 16#E0#, 16#0E#, 16#38#, 16#03#, 16#E0#, 16#0E#, 16#38#, 16#07#, 16#F0#, 16#1E#, 16#3C#, 16#07#, 16#F0#, 16#1E#, 16#3C#, 16#07#, 16#70#, 16#1C#, 16#1C#, 16#0E#, 16#70#, 16#1C#, 16#1C#, 16#0E#, 16#78#, 16#3C#, 16#1C#, 16#0E#, 16#38#, 16#38#, 16#1E#, 16#0E#, 16#38#, 16#38#, 16#0E#, 16#1C#, 16#3C#, 16#38#, 16#0E#, 16#1C#, 16#1C#, 16#38#, 16#0E#, 16#1C#, 16#1C#, 16#70#, 16#0F#, 16#3C#, 16#1E#, 16#70#, 16#07#, 16#38#, 16#1E#, 16#70#, 16#07#, 16#38#, 16#0E#, 16#70#, 16#07#, 16#38#, 16#0E#, 16#60#, 16#07#, 16#70#, 16#0F#, 16#E0#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#F0#, 16#00#, 16#7B#, 16#C0#, 16#07#, 16#8F#, 16#00#, 16#38#, 16#78#, 16#03#, 16#C1#, 16#E0#, 16#3C#, 16#07#, 16#81#, 16#C0#, 16#3C#, 16#1E#, 16#00#, 16#F1#, 16#E0#, 16#03#, 16#CE#, 16#00#, 16#1E#, 16#E0#, 16#00#, 16#7F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#3B#, 16#80#, 16#03#, 16#DE#, 16#00#, 16#3C#, 16#78#, 16#01#, 16#C1#, 16#C0#, 16#1E#, 16#0F#, 16#01#, 16#E0#, 16#3C#, 16#0E#, 16#00#, 16#E0#, 16#F0#, 16#07#, 16#8F#, 16#00#, 16#1E#, 16#70#, 16#00#, 16#F7#, 16#80#, 16#03#, 16#C0#, 16#F0#, 16#00#, 16#3C#, 16#F0#, 16#00#, 16#78#, 16#F0#, 16#01#, 16#E1#, 16#E0#, 16#03#, 16#81#, 16#E0#, 16#0F#, 16#03#, 16#C0#, 16#1C#, 16#03#, 16#C0#, 16#78#, 16#03#, 16#C1#, 16#E0#, 16#07#, 16#83#, 16#80#, 16#07#, 16#8F#, 16#00#, 16#07#, 16#1C#, 16#00#, 16#0F#, 16#70#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#70#, 16#00#, 16#7F#, 16#FF#, 16#EF#, 16#FF#, 16#FD#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#80#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#01#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#F8#, 16#E3#, 16#8E#, 16#38#, 16#E3#, 16#8E#, 16#38#, 16#E3#, 16#8E#, 16#38#, 16#E3#, 16#8E#, 16#38#, 16#E3#, 16#8E#, 16#38#, 16#E3#, 16#8E#, 16#38#, 16#E3#, 16#8F#, 16#FF#, 16#FC#, 16#C0#, 16#30#, 16#0E#, 16#01#, 16#80#, 16#60#, 16#1C#, 16#03#, 16#00#, 16#C0#, 16#38#, 16#06#, 16#01#, 16#80#, 16#70#, 16#0C#, 16#03#, 16#00#, 16#E0#, 16#18#, 16#06#, 16#01#, 16#C0#, 16#30#, 16#0C#, 16#03#, 16#80#, 16#60#, 16#18#, 16#07#, 16#00#, 16#C0#, 16#30#, 16#FF#, 16#FF#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#7F#, 16#FF#, 16#FC#, 16#07#, 16#00#, 16#78#, 16#03#, 16#C0#, 16#1F#, 16#01#, 16#D8#, 16#0C#, 16#E0#, 16#E3#, 16#06#, 16#1C#, 16#30#, 16#E3#, 16#03#, 16#18#, 16#1D#, 16#C0#, 16#6C#, 16#03#, 16#80#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#F0#, 16#F0#, 16#E0#, 16#E0#, 16#E0#, 16#07#, 16#F0#, 16#0F#, 16#FC#, 16#0F#, 16#FF#, 16#0F#, 16#03#, 16#C7#, 16#00#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#38#, 16#00#, 16#1C#, 16#00#, 16#FE#, 16#0F#, 16#FF#, 16#1F#, 16#F3#, 16#9F#, 16#01#, 16#CF#, 16#00#, 16#E7#, 16#00#, 16#73#, 16#80#, 16#79#, 16#E0#, 16#FC#, 16#7F#, 16#EF#, 16#9F#, 16#E3#, 16#C7#, 16#E1#, 16#E0#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E3#, 16#E0#, 16#EF#, 16#F8#, 16#FF#, 16#FC#, 16#FC#, 16#3E#, 16#F8#, 16#1E#, 16#F0#, 16#0E#, 16#E0#, 16#0F#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#F0#, 16#0E#, 16#F8#, 16#1E#, 16#FC#, 16#3C#, 16#EF#, 16#FC#, 16#EF#, 16#F8#, 16#E3#, 16#E0#, 16#07#, 16#F0#, 16#1F#, 16#F8#, 16#3F#, 16#FC#, 16#3C#, 16#1E#, 16#78#, 16#0E#, 16#70#, 16#07#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#07#, 16#70#, 16#07#, 16#78#, 16#0E#, 16#7C#, 16#1E#, 16#3F#, 16#FC#, 16#1F#, 16#F8#, 16#07#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#01#, 16#C0#, 16#00#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#38#, 16#00#, 16#1C#, 16#00#, 16#0E#, 16#0F#, 16#C7#, 16#1F#, 16#FB#, 16#9F#, 16#FF#, 16#DF#, 16#07#, 16#EF#, 16#01#, 16#F7#, 16#00#, 16#7F#, 16#80#, 16#3F#, 16#80#, 16#0F#, 16#C0#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#01#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#77#, 16#00#, 16#7B#, 16#C0#, 16#7D#, 16#F0#, 16#7E#, 16#7F#, 16#FB#, 16#1F#, 16#F9#, 16#83#, 16#F0#, 16#C0#, 16#07#, 16#E0#, 16#1F#, 16#F8#, 16#3F#, 16#FC#, 16#7C#, 16#1E#, 16#70#, 16#0E#, 16#60#, 16#06#, 16#E0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#70#, 16#07#, 16#78#, 16#0E#, 16#3C#, 16#1E#, 16#3F#, 16#FC#, 16#1F#, 16#F8#, 16#07#, 16#E0#, 16#0E#, 16#3C#, 16#F9#, 16#C3#, 16#87#, 16#0E#, 16#7F#, 16#FF#, 16#FC#, 16#E1#, 16#C3#, 16#87#, 16#0E#, 16#1C#, 16#38#, 16#70#, 16#E1#, 16#C3#, 16#87#, 16#0E#, 16#1C#, 16#38#, 16#70#, 16#07#, 16#C7#, 16#1F#, 16#F7#, 16#3F#, 16#FF#, 16#3C#, 16#3F#, 16#78#, 16#0F#, 16#70#, 16#0F#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#70#, 16#0F#, 16#78#, 16#0F#, 16#7C#, 16#3F#, 16#3F#, 16#F7#, 16#1F#, 16#E7#, 16#07#, 16#C7#, 16#00#, 16#07#, 16#00#, 16#07#, 16#00#, 16#0E#, 16#70#, 16#0E#, 16#78#, 16#1E#, 16#3F#, 16#FC#, 16#1F#, 16#F8#, 16#07#, 16#E0#, 16#E0#, 16#01#, 16#C0#, 16#03#, 16#80#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#1C#, 16#00#, 16#38#, 16#00#, 16#71#, 16#F8#, 16#E7#, 16#FD#, 16#DF#, 16#FB#, 16#F0#, 16#FF#, 16#C0#, 16#FF#, 16#00#, 16#FC#, 16#01#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#3F#, 16#00#, 16#7E#, 16#00#, 16#FC#, 16#01#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#0F#, 16#C0#, 16#1C#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#1C#, 16#71#, 16#C7#, 16#00#, 16#00#, 16#07#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#73#, 16#FF#, 16#FB#, 16#C0#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#3C#, 16#E0#, 16#78#, 16#E0#, 16#F0#, 16#E1#, 16#E0#, 16#E3#, 16#C0#, 16#E7#, 16#80#, 16#EF#, 16#00#, 16#EF#, 16#80#, 16#FF#, 16#80#, 16#FB#, 16#C0#, 16#F1#, 16#E0#, 16#E0#, 16#E0#, 16#E0#, 16#F0#, 16#E0#, 16#70#, 16#E0#, 16#78#, 16#E0#, 16#3C#, 16#E0#, 16#1C#, 16#E0#, 16#1E#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FC#, 16#E3#, 16#E0#, 16#F8#, 16#E7#, 16#F1#, 16#FE#, 16#EF#, 16#FB#, 16#FE#, 16#F8#, 16#7F#, 16#0F#, 16#F0#, 16#3E#, 16#07#, 16#F0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E0#, 16#1C#, 16#07#, 16#E3#, 16#F1#, 16#CF#, 16#FB#, 16#BF#, 16#F7#, 16#E1#, 16#FF#, 16#81#, 16#FE#, 16#01#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#3F#, 16#00#, 16#7E#, 16#00#, 16#FC#, 16#01#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#38#, 16#07#, 16#F0#, 16#0F#, 16#FE#, 16#0F#, 16#FF#, 16#87#, 16#83#, 16#C7#, 16#80#, 16#F3#, 16#80#, 16#3B#, 16#80#, 16#1F#, 16#C0#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#01#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#7E#, 16#00#, 16#3B#, 16#80#, 16#39#, 16#E0#, 16#3C#, 16#78#, 16#3C#, 16#3F#, 16#FE#, 16#0F#, 16#FE#, 16#01#, 16#FC#, 16#00#, 16#E3#, 16#E0#, 16#E7#, 16#F8#, 16#EF#, 16#FC#, 16#FC#, 16#3E#, 16#F8#, 16#1E#, 16#F0#, 16#0E#, 16#E0#, 16#0F#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#F0#, 16#0E#, 16#F8#, 16#1E#, 16#FC#, 16#3E#, 16#FF#, 16#FC#, 16#EF#, 16#F8#, 16#E3#, 16#E0#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#E0#, 16#00#, 16#07#, 16#E1#, 16#8F#, 16#FC#, 16#CF#, 16#FF#, 16#67#, 16#83#, 16#F7#, 16#80#, 16#FB#, 16#80#, 16#3F#, 16#C0#, 16#1F#, 16#C0#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#01#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#7E#, 16#00#, 16#3B#, 16#80#, 16#3D#, 16#E0#, 16#3E#, 16#F8#, 16#3F#, 16#3F#, 16#FF#, 16#8F#, 16#FD#, 16#C1#, 16#F8#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#38#, 16#00#, 16#1C#, 16#00#, 16#0E#, 16#00#, 16#07#, 16#00#, 16#03#, 16#80#, 16#E3#, 16#F7#, 16#FB#, 16#FF#, 16#8F#, 16#07#, 16#83#, 16#81#, 16#C0#, 16#E0#, 16#70#, 16#38#, 16#1C#, 16#0E#, 16#07#, 16#03#, 16#81#, 16#C0#, 16#E0#, 16#70#, 16#38#, 16#00#, 16#0F#, 16#C0#, 16#FF#, 16#87#, 16#FF#, 16#3C#, 16#1E#, 16#E0#, 16#3B#, 16#80#, 16#0E#, 16#00#, 16#3C#, 16#00#, 16#7F#, 16#00#, 16#FF#, 16#80#, 16#FF#, 16#80#, 16#7F#, 16#00#, 16#3F#, 16#80#, 16#7E#, 16#01#, 16#FC#, 16#1F#, 16#7F#, 16#F8#, 16#FF#, 16#C1#, 16#FC#, 16#00#, 16#38#, 16#70#, 16#E1#, 16#CF#, 16#FF#, 16#FF#, 16#9C#, 16#38#, 16#70#, 16#E1#, 16#C3#, 16#87#, 16#0E#, 16#1C#, 16#38#, 16#70#, 16#E1#, 16#C3#, 16#E7#, 16#C7#, 16#80#, 16#E0#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#3F#, 16#00#, 16#7E#, 16#00#, 16#FC#, 16#01#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#3F#, 16#00#, 16#7E#, 16#00#, 16#FC#, 16#03#, 16#FC#, 16#0F#, 16#FC#, 16#3F#, 16#7F#, 16#EE#, 16#FF#, 16#9C#, 16#7E#, 16#38#, 16#F0#, 16#03#, 16#B8#, 16#03#, 16#9C#, 16#01#, 16#CF#, 16#00#, 16#E3#, 16#80#, 16#E1#, 16#C0#, 16#70#, 16#F0#, 16#38#, 16#38#, 16#38#, 16#1C#, 16#1C#, 16#0F#, 16#0C#, 16#03#, 16#8E#, 16#01#, 16#C7#, 16#00#, 16#F7#, 16#00#, 16#3B#, 16#80#, 16#1D#, 16#80#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#F0#, 16#1C#, 16#03#, 16#F8#, 16#0F#, 16#01#, 16#DC#, 16#0F#, 16#81#, 16#CE#, 16#07#, 16#C0#, 16#E7#, 16#83#, 16#E0#, 16#71#, 16#C1#, 16#B8#, 16#70#, 16#E1#, 16#DC#, 16#38#, 16#70#, 16#EE#, 16#1C#, 16#3C#, 16#63#, 16#0E#, 16#0E#, 16#31#, 16#CE#, 16#07#, 16#38#, 16#E7#, 16#03#, 16#9C#, 16#73#, 16#80#, 16#EC#, 16#19#, 16#80#, 16#7E#, 16#0F#, 16#C0#, 16#3F#, 16#07#, 16#E0#, 16#1F#, 16#83#, 16#F0#, 16#07#, 16#80#, 16#F0#, 16#03#, 16#C0#, 16#78#, 16#01#, 16#E0#, 16#3C#, 16#00#, 16#70#, 16#07#, 16#38#, 16#0E#, 16#3C#, 16#1C#, 16#1C#, 16#1C#, 16#0E#, 16#38#, 16#0F#, 16#70#, 16#07#, 16#70#, 16#03#, 16#E0#, 16#03#, 16#C0#, 16#01#, 16#C0#, 16#03#, 16#E0#, 16#07#, 16#E0#, 16#07#, 16#70#, 16#0E#, 16#78#, 16#1E#, 16#38#, 16#1C#, 16#1C#, 16#38#, 16#1E#, 16#78#, 16#0E#, 16#70#, 16#07#, 16#70#, 16#07#, 16#38#, 16#03#, 16#9C#, 16#01#, 16#C7#, 16#01#, 16#C3#, 16#80#, 16#E1#, 16#C0#, 16#70#, 16#70#, 16#70#, 16#38#, 16#38#, 16#1C#, 16#18#, 16#07#, 16#1C#, 16#03#, 16#8E#, 16#01#, 16#C6#, 16#00#, 16#77#, 16#00#, 16#3B#, 16#80#, 16#1F#, 16#80#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#30#, 16#00#, 16#38#, 16#00#, 16#1C#, 16#00#, 16#1C#, 16#00#, 16#0E#, 16#00#, 16#3F#, 16#00#, 16#1F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#FF#, 16#F9#, 16#FF#, 16#F0#, 16#00#, 16#E0#, 16#03#, 16#80#, 16#0E#, 16#00#, 16#3C#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F8#, 16#07#, 16#0F#, 16#1F#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#38#, 16#F8#, 16#E0#, 16#F8#, 16#38#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1C#, 16#1F#, 16#0F#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#E0#, 16#F0#, 16#F8#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#1C#, 16#1F#, 16#07#, 16#1F#, 16#1C#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#38#, 16#F8#, 16#F0#, 16#E0#, 16#38#, 16#00#, 16#FC#, 16#03#, 16#FC#, 16#1F#, 16#3E#, 16#3C#, 16#1F#, 16#E0#, 16#1F#, 16#80#, 16#1E#, 16#00#); FreeSans18pt7bGlyphs : aliased constant Glyph_Array := ( (0, 0, 0, 9, 0, 1), -- 0x20 ' ' (0, 3, 26, 12, 4, -25), -- 0x21 '!' (10, 9, 9, 12, 1, -24), -- 0x22 '"' (21, 19, 24, 19, 0, -23), -- 0x23 '#' (78, 16, 30, 19, 2, -26), -- 0x24 '$' (138, 29, 25, 31, 1, -24), -- 0x25 '%' (229, 20, 25, 23, 2, -24), -- 0x26 '&' (292, 3, 9, 7, 2, -24), -- 0x27 ''' (296, 8, 33, 12, 3, -25), -- 0x28 '(' (329, 8, 33, 12, 1, -25), -- 0x29 ')' (362, 10, 10, 14, 2, -25), -- 0x2A '*' (375, 16, 16, 20, 2, -15), -- 0x2B '+' (407, 3, 9, 10, 3, -3), -- 0x2C ',' (411, 8, 3, 12, 2, -10), -- 0x2D '-' (414, 3, 4, 9, 3, -3), -- 0x2E '.' (416, 10, 26, 10, 0, -25), -- 0x2F '/' (449, 16, 25, 19, 2, -24), -- 0x30 '0' (499, 8, 25, 19, 4, -24), -- 0x31 '1' (524, 16, 25, 19, 2, -24), -- 0x32 '2' (574, 17, 25, 19, 1, -24), -- 0x33 '3' (628, 16, 25, 19, 1, -24), -- 0x34 '4' (678, 17, 25, 19, 1, -24), -- 0x35 '5' (732, 16, 25, 19, 2, -24), -- 0x36 '6' (782, 16, 25, 19, 2, -24), -- 0x37 '7' (832, 17, 25, 19, 1, -24), -- 0x38 '8' (886, 16, 25, 19, 1, -24), -- 0x39 '9' (936, 3, 19, 9, 3, -18), -- 0x3A ':' (944, 3, 24, 9, 3, -18), -- 0x3B ';' (953, 17, 17, 20, 2, -16), -- 0x3C '<' (990, 17, 9, 20, 2, -12), -- 0x3D '=' (1010, 17, 17, 20, 2, -16), -- 0x3E '>' (1047, 15, 26, 19, 3, -25), -- 0x3F '?' (1096, 32, 31, 36, 1, -25), -- 0x40 '@' (1220, 22, 26, 23, 1, -25), -- 0x41 'A' (1292, 19, 26, 23, 3, -25), -- 0x42 'B' (1354, 22, 26, 25, 1, -25), -- 0x43 'C' (1426, 20, 26, 24, 3, -25), -- 0x44 'D' (1491, 18, 26, 22, 3, -25), -- 0x45 'E' (1550, 17, 26, 21, 3, -25), -- 0x46 'F' (1606, 24, 26, 27, 1, -25), -- 0x47 'G' (1684, 19, 26, 25, 3, -25), -- 0x48 'H' (1746, 3, 26, 10, 4, -25), -- 0x49 'I' (1756, 14, 26, 18, 1, -25), -- 0x4A 'J' (1802, 20, 26, 24, 3, -25), -- 0x4B 'K' (1867, 15, 26, 20, 3, -25), -- 0x4C 'L' (1916, 24, 26, 30, 3, -25), -- 0x4D 'M' (1994, 20, 26, 26, 3, -25), -- 0x4E 'N' (2059, 25, 26, 27, 1, -25), -- 0x4F 'O' (2141, 18, 26, 23, 3, -25), -- 0x50 'P' (2200, 25, 28, 27, 1, -25), -- 0x51 'Q' (2288, 20, 26, 25, 3, -25), -- 0x52 'R' (2353, 20, 26, 23, 1, -25), -- 0x53 'S' (2418, 19, 26, 22, 1, -25), -- 0x54 'T' (2480, 19, 26, 25, 3, -25), -- 0x55 'U' (2542, 21, 26, 23, 1, -25), -- 0x56 'V' (2611, 32, 26, 33, 0, -25), -- 0x57 'W' (2715, 21, 26, 23, 1, -25), -- 0x58 'X' (2784, 23, 26, 24, 0, -25), -- 0x59 'Y' (2859, 19, 26, 22, 1, -25), -- 0x5A 'Z' (2921, 6, 33, 10, 2, -25), -- 0x5B '[' (2946, 10, 26, 10, 0, -25), -- 0x5C '\' (2979, 6, 33, 10, 1, -25), -- 0x5D ']' (3004, 13, 13, 16, 2, -24), -- 0x5E '^' (3026, 21, 2, 19, -1, 5), -- 0x5F '_' (3032, 7, 5, 9, 1, -25), -- 0x60 '`' (3037, 17, 19, 19, 1, -18), -- 0x61 'a' (3078, 16, 26, 20, 2, -25), -- 0x62 'b' (3130, 16, 19, 18, 1, -18), -- 0x63 'c' (3168, 17, 26, 20, 1, -25), -- 0x64 'd' (3224, 16, 19, 19, 1, -18), -- 0x65 'e' (3262, 7, 26, 10, 1, -25), -- 0x66 'f' (3285, 16, 27, 19, 1, -18), -- 0x67 'g' (3339, 15, 26, 19, 2, -25), -- 0x68 'h' (3388, 3, 26, 8, 2, -25), -- 0x69 'i' (3398, 6, 34, 9, 0, -25), -- 0x6A 'j' (3424, 16, 26, 18, 2, -25), -- 0x6B 'k' (3476, 3, 26, 7, 2, -25), -- 0x6C 'l' (3486, 24, 19, 28, 2, -18), -- 0x6D 'm' (3543, 15, 19, 19, 2, -18), -- 0x6E 'n' (3579, 17, 19, 19, 1, -18), -- 0x6F 'o' (3620, 16, 25, 20, 2, -18), -- 0x70 'p' (3670, 17, 25, 20, 1, -18), -- 0x71 'q' (3724, 9, 19, 12, 2, -18), -- 0x72 'r' (3746, 14, 19, 17, 2, -18), -- 0x73 's' (3780, 7, 23, 10, 1, -22), -- 0x74 't' (3801, 15, 19, 19, 2, -18), -- 0x75 'u' (3837, 17, 19, 17, 0, -18), -- 0x76 'v' (3878, 25, 19, 25, 0, -18), -- 0x77 'w' (3938, 16, 19, 17, 0, -18), -- 0x78 'x' (3976, 17, 27, 17, 0, -18), -- 0x79 'y' (4034, 15, 19, 17, 1, -18), -- 0x7A 'z' (4070, 8, 33, 12, 1, -25), -- 0x7B '{' (4103, 2, 33, 9, 3, -25), -- 0x7C '|' (4112, 8, 33, 12, 3, -25), -- 0x7D '}' (4145, 15, 7, 18, 1, -15)); -- 0x7E '~' Font_D : aliased constant Bitmap_Font := (FreeSans18pt7bBitmaps'Access, FreeSans18pt7bGlyphs'Access, 42); Font : constant Giza.Font.Ref_Const := Font_D'Access; end Giza.Bitmap_Fonts.FreeSans18pt7b;

67.477352

73

0.479113

50f6371296cd1d790cf6f447e14be005a6b032c8

14,745

ads

Ada

tools-src/gnu/gcc/gcc/ada/a-strbou.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/a-strbou.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/a-strbou.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S T R I N G S . B O U N D E D -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2000 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 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 was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Strings.Maps; package Ada.Strings.Bounded is pragma Preelaborate (Bounded); generic Max : Positive; -- Maximum length of a Bounded_String package Generic_Bounded_Length is Max_Length : constant Positive := Max; type Bounded_String is private; Null_Bounded_String : constant Bounded_String; subtype Length_Range is Natural range 0 .. Max_Length; function Length (Source : in Bounded_String) return Length_Range; -------------------------------------------------------- -- Conversion, Concatenation, and Selection Functions -- -------------------------------------------------------- function To_Bounded_String (Source : in String; Drop : in Truncation := Error) return Bounded_String; function To_String (Source : in Bounded_String) return String; function Append (Left, Right : in Bounded_String; Drop : in Truncation := Error) return Bounded_String; function Append (Left : in Bounded_String; Right : in String; Drop : in Truncation := Error) return Bounded_String; function Append (Left : in String; Right : in Bounded_String; Drop : in Truncation := Error) return Bounded_String; function Append (Left : in Bounded_String; Right : in Character; Drop : in Truncation := Error) return Bounded_String; function Append (Left : in Character; Right : in Bounded_String; Drop : in Truncation := Error) return Bounded_String; procedure Append (Source : in out Bounded_String; New_Item : in Bounded_String; Drop : in Truncation := Error); procedure Append (Source : in out Bounded_String; New_Item : in String; Drop : in Truncation := Error); procedure Append (Source : in out Bounded_String; New_Item : in Character; Drop : in Truncation := Error); function "&" (Left, Right : in Bounded_String) return Bounded_String; function "&" (Left : in Bounded_String; Right : in String) return Bounded_String; function "&" (Left : in String; Right : in Bounded_String) return Bounded_String; function "&" (Left : in Bounded_String; Right : in Character) return Bounded_String; function "&" (Left : in Character; Right : in Bounded_String) return Bounded_String; function Element (Source : in Bounded_String; Index : in Positive) return Character; procedure Replace_Element (Source : in out Bounded_String; Index : in Positive; By : in Character); function Slice (Source : in Bounded_String; Low : in Positive; High : in Natural) return String; function "=" (Left, Right : in Bounded_String) return Boolean; function "=" (Left : in Bounded_String; Right : in String) return Boolean; function "=" (Left : in String; Right : in Bounded_String) return Boolean; function "<" (Left, Right : in Bounded_String) return Boolean; function "<" (Left : in Bounded_String; Right : in String) return Boolean; function "<" (Left : in String; Right : in Bounded_String) return Boolean; function "<=" (Left, Right : in Bounded_String) return Boolean; function "<=" (Left : in Bounded_String; Right : in String) return Boolean; function "<=" (Left : in String; Right : in Bounded_String) return Boolean; function ">" (Left, Right : in Bounded_String) return Boolean; function ">" (Left : in Bounded_String; Right : in String) return Boolean; function ">" (Left : in String; Right : in Bounded_String) return Boolean; function ">=" (Left, Right : in Bounded_String) return Boolean; function ">=" (Left : in Bounded_String; Right : in String) return Boolean; function ">=" (Left : in String; Right : in Bounded_String) return Boolean; ---------------------- -- Search Functions -- ---------------------- function Index (Source : in Bounded_String; Pattern : in String; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping := Maps.Identity) return Natural; function Index (Source : in Bounded_String; Pattern : in String; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping_Function) return Natural; function Index (Source : in Bounded_String; Set : in Maps.Character_Set; Test : in Membership := Inside; Going : in Direction := Forward) return Natural; function Index_Non_Blank (Source : in Bounded_String; Going : in Direction := Forward) return Natural; function Count (Source : in Bounded_String; Pattern : in String; Mapping : in Maps.Character_Mapping := Maps.Identity) return Natural; function Count (Source : in Bounded_String; Pattern : in String; Mapping : in Maps.Character_Mapping_Function) return Natural; function Count (Source : in Bounded_String; Set : in Maps.Character_Set) return Natural; procedure Find_Token (Source : in Bounded_String; Set : in Maps.Character_Set; Test : in Membership; First : out Positive; Last : out Natural); ------------------------------------ -- String Translation Subprograms -- ------------------------------------ function Translate (Source : in Bounded_String; Mapping : in Maps.Character_Mapping) return Bounded_String; procedure Translate (Source : in out Bounded_String; Mapping : in Maps.Character_Mapping); function Translate (Source : in Bounded_String; Mapping : in Maps.Character_Mapping_Function) return Bounded_String; procedure Translate (Source : in out Bounded_String; Mapping : in Maps.Character_Mapping_Function); --------------------------------------- -- String Transformation Subprograms -- --------------------------------------- function Replace_Slice (Source : in Bounded_String; Low : in Positive; High : in Natural; By : in String; Drop : in Truncation := Error) return Bounded_String; procedure Replace_Slice (Source : in out Bounded_String; Low : in Positive; High : in Natural; By : in String; Drop : in Truncation := Error); function Insert (Source : in Bounded_String; Before : in Positive; New_Item : in String; Drop : in Truncation := Error) return Bounded_String; procedure Insert (Source : in out Bounded_String; Before : in Positive; New_Item : in String; Drop : in Truncation := Error); function Overwrite (Source : in Bounded_String; Position : in Positive; New_Item : in String; Drop : in Truncation := Error) return Bounded_String; procedure Overwrite (Source : in out Bounded_String; Position : in Positive; New_Item : in String; Drop : in Truncation := Error); function Delete (Source : in Bounded_String; From : in Positive; Through : in Natural) return Bounded_String; procedure Delete (Source : in out Bounded_String; From : in Positive; Through : in Natural); --------------------------------- -- String Selector Subprograms -- --------------------------------- function Trim (Source : in Bounded_String; Side : in Trim_End) return Bounded_String; procedure Trim (Source : in out Bounded_String; Side : in Trim_End); function Trim (Source : in Bounded_String; Left : in Maps.Character_Set; Right : in Maps.Character_Set) return Bounded_String; procedure Trim (Source : in out Bounded_String; Left : in Maps.Character_Set; Right : in Maps.Character_Set); function Head (Source : in Bounded_String; Count : in Natural; Pad : in Character := Space; Drop : in Truncation := Error) return Bounded_String; procedure Head (Source : in out Bounded_String; Count : in Natural; Pad : in Character := Space; Drop : in Truncation := Error); function Tail (Source : in Bounded_String; Count : in Natural; Pad : in Character := Space; Drop : in Truncation := Error) return Bounded_String; procedure Tail (Source : in out Bounded_String; Count : in Natural; Pad : in Character := Space; Drop : in Truncation := Error); ------------------------------------ -- String Constructor Subprograms -- ------------------------------------ function "*" (Left : in Natural; Right : in Character) return Bounded_String; function "*" (Left : in Natural; Right : in String) return Bounded_String; function "*" (Left : in Natural; Right : in Bounded_String) return Bounded_String; function Replicate (Count : in Natural; Item : in Character; Drop : in Truncation := Error) return Bounded_String; function Replicate (Count : in Natural; Item : in String; Drop : in Truncation := Error) return Bounded_String; function Replicate (Count : in Natural; Item : in Bounded_String; Drop : in Truncation := Error) return Bounded_String; private type Bounded_String is record Length : Length_Range := 0; Data : String (1 .. Max_Length) := (1 .. Max_Length => ASCII.NUL); end record; Null_Bounded_String : constant Bounded_String := (Length => 0, Data => (1 .. Max_Length => ASCII.NUL)); -- Pragma Inline declarations (GNAT specific additions) pragma Inline ("="); pragma Inline ("<"); pragma Inline ("<="); pragma Inline (">"); pragma Inline (">="); pragma Inline ("&"); pragma Inline (Count); pragma Inline (Element); pragma Inline (Find_Token); pragma Inline (Index); pragma Inline (Index_Non_Blank); pragma Inline (Length); pragma Inline (Replace_Element); pragma Inline (Slice); pragma Inline (To_Bounded_String); pragma Inline (To_String); end Generic_Bounded_Length; end Ada.Strings.Bounded;

31.50641

78

0.50824

1d85b53fec341cd57aabd086fdc5ee45adf97b4b

676

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/pointer_controlled.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/pointer_controlled.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/pointer_controlled.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- PR ada/49732 -- Testcase by Vorfeed Canal -- { dg-do compile } -- { dg-options "-gnato" } with Interfaces.C; use Interfaces.C; with Interfaces.C.Strings; use Interfaces.C.Strings; with Interfaces.C.Pointers; procedure Pointer_Controlled is function Create (Name : String) return size_t is type Name_String is new char_array (0 .. Name'Length); type Name_String_Ptr is access Name_String; pragma Controlled (Name_String_Ptr); Name_Str : constant Name_String_Ptr := new Name_String; Name_Len : size_t; begin To_C (Name, Name_Str.all, Name_Len); return 1; end; Test : size_t; begin Test := Create("ABC"); end;

21.125

61

0.681953

1d6b404fc8c854d6f0401f8c0634c7fa4ca4e83b

3,794

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-expmod.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-expmod.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-expmod.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . E X P _ M O D -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ package body System.Exp_Mod is use System.Unsigned_Types; ----------------- -- Exp_Modular -- ----------------- function Exp_Modular (Left : Unsigned; Modulus : Unsigned; Right : Natural) return Unsigned is Result : Unsigned := 1; Factor : Unsigned := Left; Exp : Natural := Right; function Mult (X, Y : Unsigned) return Unsigned is (Unsigned (Long_Long_Unsigned (X) * Long_Long_Unsigned (Y) mod Long_Long_Unsigned (Modulus))); -- Modular multiplication. Note that we can't take advantage of the -- compiler's circuit, because the modulus is not known statically. begin -- We use the standard logarithmic approach, Exp gets shifted right -- testing successive low order bits and Factor is the value of the -- base raised to the next power of 2. -- Note: it is not worth special casing the cases of base values -1,0,+1 -- since the expander does this when the base is a literal, and other -- cases will be extremely rare. if Exp /= 0 then loop if Exp rem 2 /= 0 then Result := Mult (Result, Factor); end if; Exp := Exp / 2; exit when Exp = 0; Factor := Mult (Factor, Factor); end loop; end if; return Result; end Exp_Modular; end System.Exp_Mod;

47.425

79

0.443332

1d88a373bc2a5d04565106da4a3a054bc00d6f4d

3,178

ads

Ada

software/hal/hpl/STM32/svd/stm32f427x/stm32_svd-iwdg.ads

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

12

2017-06-08T14:19:57.000Z

2022-03-09T02:48:59.000Z

software/hal/hpl/STM32/svd/stm32f427x/stm32_svd-iwdg.ads

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

6

2017-06-08T13:13:50.000Z

2020-05-15T09:32:43.000Z

software/hal/hpl/STM32/svd/stm32f427x/stm32_svd-iwdg.ads

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

3

2017-06-30T14:05:06.000Z

2022-02-17T12:20:45.000Z

-- This spec has been automatically generated from STM32F427x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; with System; with HAL; package STM32_SVD.IWDG is pragma Preelaborate; --------------- -- Registers -- --------------- ----------------- -- KR_Register -- ----------------- subtype KR_KEY_Field is HAL.Short; -- Key register type KR_Register is record -- Write-only. Key value (write only, read 0000h) KEY : KR_KEY_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.Short := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for KR_Register use record KEY at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ----------------- -- PR_Register -- ----------------- subtype PR_PR_Field is HAL.UInt3; -- Prescaler register type PR_Register is record -- Prescaler divider PR : PR_PR_Field := 16#0#; -- unspecified Reserved_3_31 : HAL.UInt29 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PR_Register use record PR at 0 range 0 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; ------------------ -- RLR_Register -- ------------------ subtype RLR_RL_Field is HAL.UInt12; -- Reload register type RLR_Register is record -- Watchdog counter reload value RL : RLR_RL_Field := 16#FFF#; -- unspecified Reserved_12_31 : HAL.UInt20 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RLR_Register use record RL at 0 range 0 .. 11; Reserved_12_31 at 0 range 12 .. 31; end record; ----------------- -- SR_Register -- ----------------- -- Status register type SR_Register is record -- Read-only. Watchdog prescaler value update PVU : Boolean; -- Read-only. Watchdog counter reload value update RVU : Boolean; -- unspecified Reserved_2_31 : HAL.UInt30; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register use record PVU at 0 range 0 .. 0; RVU at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Independent watchdog type IWDG_Peripheral is record -- Key register KR : KR_Register; -- Prescaler register PR : PR_Register; -- Reload register RLR : RLR_Register; -- Status register SR : SR_Register; end record with Volatile; for IWDG_Peripheral use record KR at 0 range 0 .. 31; PR at 4 range 0 .. 31; RLR at 8 range 0 .. 31; SR at 12 range 0 .. 31; end record; -- Independent watchdog IWDG_Periph : aliased IWDG_Peripheral with Import, Address => IWDG_Base; end STM32_SVD.IWDG;

24.446154

66

0.554437

31f533a2aaa5e56c4644f456a81f0aef30a6785c

6,516

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/s-pack22.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/s-pack22.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/s-pack22.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 2 2 -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Storage_Elements; with System.Unsigned_Types; with Unchecked_Conversion; package body System.Pack_22 is subtype Ofs is System.Storage_Elements.Storage_Offset; subtype Uns is System.Unsigned_Types.Unsigned; subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7; use type System.Storage_Elements.Storage_Offset; use type System.Unsigned_Types.Unsigned; type Cluster is record E0, E1, E2, E3, E4, E5, E6, E7 : Bits_22; end record; for Cluster use record E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1; E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1; E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1; E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1; E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1; E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1; E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1; E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1; end record; for Cluster'Size use Bits * 8; for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment, 1 + 1 * Boolean'Pos (Bits mod 2 = 0) + 2 * Boolean'Pos (Bits mod 4 = 0)); -- Use maximum possible alignment, given the bit field size, since this -- will result in the most efficient code possible for the field. type Cluster_Ref is access Cluster; function To_Ref is new Unchecked_Conversion (System.Address, Cluster_Ref); -- The following declarations are for the case where the address -- passed to GetU_22 or SetU_22 is not guaranteed to be aligned. -- These routines are used when the packed array is itself a -- component of a packed record, and therefore may not be aligned. type ClusterU is new Cluster; for ClusterU'Alignment use 1; type ClusterU_Ref is access ClusterU; function To_Ref is new Unchecked_Conversion (System.Address, ClusterU_Ref); ------------ -- Get_22 -- ------------ function Get_22 (Arr : System.Address; N : Natural) return Bits_22 is C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8)); begin case N07 (Uns (N) mod 8) is when 0 => return C.E0; when 1 => return C.E1; when 2 => return C.E2; when 3 => return C.E3; when 4 => return C.E4; when 5 => return C.E5; when 6 => return C.E6; when 7 => return C.E7; end case; end Get_22; ------------- -- GetU_22 -- ------------- function GetU_22 (Arr : System.Address; N : Natural) return Bits_22 is C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8)); begin case N07 (Uns (N) mod 8) is when 0 => return C.E0; when 1 => return C.E1; when 2 => return C.E2; when 3 => return C.E3; when 4 => return C.E4; when 5 => return C.E5; when 6 => return C.E6; when 7 => return C.E7; end case; end GetU_22; ------------ -- Set_22 -- ------------ procedure Set_22 (Arr : System.Address; N : Natural; E : Bits_22) is C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8)); begin case N07 (Uns (N) mod 8) is when 0 => C.E0 := E; when 1 => C.E1 := E; when 2 => C.E2 := E; when 3 => C.E3 := E; when 4 => C.E4 := E; when 5 => C.E5 := E; when 6 => C.E6 := E; when 7 => C.E7 := E; end case; end Set_22; ------------- -- SetU_22 -- ------------- procedure SetU_22 (Arr : System.Address; N : Natural; E : Bits_22) is C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8)); begin case N07 (Uns (N) mod 8) is when 0 => C.E0 := E; when 1 => C.E1 := E; when 2 => C.E2 := E; when 3 => C.E3 := E; when 4 => C.E4 := E; when 5 => C.E5 := E; when 6 => C.E6 := E; when 7 => C.E7 := E; end case; end SetU_22; end System.Pack_22;

39.253012

78

0.494629

3143d10528a3db1c9b70d1929778e14a590f4f61

55

adb

Ada

blueprints/app/standard/src/@[email protected]

GLADORG/glad-cli

d6a804ea51b52d84bf590f061e05f404787a79f2

[ "MIT" ]

null

blueprints/app/standard/src/@[email protected]

GLADORG/glad-cli

d6a804ea51b52d84bf590f061e05f404787a79f2

[ "MIT" ]

3

2021-09-03T16:44:49.000Z

2021-09-03T16:45:24.000Z

blueprints/app/standard/src/@[email protected]

GLADORG/glad-cli

d6a804ea51b52d84bf590f061e05f404787a79f2

[ "MIT" ]

null

procedure @_APPNAME_@ is begin null; end @_APPNAME_@;

13.75

24

0.745455

0b5daf639de192a7f85e6b658641dd3fedf18b6e

159

adb

Ada

Practica 03/P03_Crea_Tarea/src/crea_tarea.adb

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

null

Practica 03/P03_Crea_Tarea/src/crea_tarea.adb

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

null

Practica 03/P03_Crea_Tarea/src/crea_tarea.adb

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

1

2022-03-06T17:37:39.000Z

with Tareas; use Tareas; procedure Crea_Tarea is --T1 : Tarea_1; T2 : Tarea_2; T3 : Tarea_3; begin -- Insert code here. null; end Crea_Tarea;

13.25

24

0.647799

1d060d3f3653d44f75601800304b1a1a4d2ff0b2

1,308

ads

Ada

gdb-7.3/gdb/testsuite/gdb.ada/interface/types.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

gdb-7.3/gdb/testsuite/gdb.ada/interface/types.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

gdb-7.3/gdb/testsuite/gdb.ada/interface/types.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

-- Copyright 2008, 2009, 2010, 2011 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 Types is type Object_Int is interface; type Another_Int is interface; type Object_Root is abstract tagged record X : Natural; Y : Natural; end record; type Object is abstract new Object_Root and Object_Int and Another_Int with null record; function Ident (O : Object'Class) return Object'Class; procedure Do_Nothing (O : in out Object'Class); type Rectangle is new Object with record W : Natural; H : Natural; end record; type Circle is new Object with record R : Natural; end record; end Types;

30.418605

73

0.711774

0631a8413a20bc0cc91e2bb25eeb3245bb058ebf

3,810

ads

Ada

boards/HiFive1/src/hifive1.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

192

2016-06-01T18:32:04.000Z

2022-03-26T22:52:31.000Z

boards/HiFive1/src/hifive1.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

239

2016-05-26T20:02:01.000Z

2022-03-31T09:46:56.000Z

boards/HiFive1/src/hifive1.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

142

2016-06-05T08:12:20.000Z

2022-03-24T17:37:17.000Z

------------------------------------------------------------------------------ -- -- -- Copyright (C) 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 FE310.Device; use FE310.Device; with FE310.GPIO; use FE310.GPIO; package HiFive1 is HF1_Pin_0 : GPIO_Point renames P16; -- IOF 0: UART 0 RX HF1_Pin_1 : GPIO_Point renames P17; -- IOF 0: UART 0 TX HF1_Pin_2 : GPIO_Point renames P18; HF1_Pin_3 : GPIO_Point renames P19; -- | IOF 1 : PWM 1 HF1_Pin_4 : GPIO_Point renames P20; -- | IOF 1 : PWM 1 HF1_Pin_5 : GPIO_Point renames P21; -- | IOF 1 : PWM 1 HF1_Pin_6 : GPIO_Point renames P22; -- | IOF 1 : PWM 1 HF1_Pin_7 : GPIO_Point renames P23; HF1_Pin_8 : GPIO_Point renames P00; -- | IOF 1 : PWM 0 HF1_Pin_9 : GPIO_Point renames P01; -- | IOF 1 : PWM 0 HF1_Pin_10 : GPIO_Point renames P02; -- | IOF 1 : PWM 0 HF1_Pin_11 : GPIO_Point renames P03; -- IOF 0: SPI 1 MOSI | IOF 1 : PWM 0 HF1_Pin_12 : GPIO_Point renames P04; -- IOF 0: SPI 1 MISO HF1_Pin_13 : GPIO_Point renames P05; -- IOF 0: SPI 1 SCK -- HF1_Pin_14 is not connected HF1_Pin_15 : GPIO_Point renames P09; HF1_Pin_16 : GPIO_Point renames P10; -- | IOF 1 : PWM 2 HF1_Pin_17 : GPIO_Point renames P11; -- | IOF 1 : PWM 2 HF1_Pin_18 : GPIO_Point renames P12; -- | IOF 1 : PWM 2 HF1_Pin_19 : GPIO_Point renames P13; -- | IOF 1 : PWM 2 end HiFive1;

64.576271

78

0.527034

1db7f4abde5618ab2c465708a986be1f76b16865

4,630

ads

Ada

src/drivers/sercom_u2201/sam-sercom-i2c.ads

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

1

2020-02-24T23:19:03.000Z

src/drivers/sercom_u2201/sam-sercom-i2c.ads

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

null

src/drivers/sercom_u2201/sam-sercom-i2c.ads

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2020, 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 HAL.I2C; use HAL.I2C; with HAL; use HAL; package SAM.SERCOM.I2C is type I2C_Device is new SERCOM_Device and HAL.I2C.I2C_Port with private; procedure Configure (This : in out I2C_Device; Baud : UInt8) with Pre => not This.Enabled and then not This.Configured, Post => not This.Enabled and then This.Configured; -- Configure SERCOM in I2C Master mode. -- DMA -- function Data_Address (This : I2C_Device) return System.Address; -- return the address of the data register for DMA transfer configuration ------------- -- HAL.I2C -- ------------- overriding procedure Master_Transmit (This : in out I2C_Device; Addr : I2C_Address; Data : I2C_Data; Status : out I2C_Status; Timeout : Natural := 1000); overriding procedure Master_Receive (This : in out I2C_Device; Addr : I2C_Address; Data : out I2C_Data; Status : out I2C_Status; Timeout : Natural := 1000); overriding procedure Mem_Write (This : in out I2C_Device; Addr : I2C_Address; Mem_Addr : UInt16; Mem_Addr_Size : I2C_Memory_Address_Size; Data : I2C_Data; Status : out I2C_Status; Timeout : Natural := 1000); overriding procedure Mem_Read (This : in out I2C_Device; Addr : I2C_Address; Mem_Addr : UInt16; Mem_Addr_Size : I2C_Memory_Address_Size; Data : out I2C_Data; Status : out I2C_Status; Timeout : Natural := 1000); private type I2C_Device is new SERCOM_Device and HAL.I2C.I2C_Port with record Do_Stop_Sequence : Boolean := True; end record; procedure Wait_Sync (This : in out I2C_Device); procedure Wait_Bus (This : in out I2C_Device); function Send_Addr (This : in out I2C_Device; Addr : UInt11) return I2C_Status; procedure Cmd_Stop (This : in out I2C_Device); procedure Cmd_Read (This : in out I2C_Device); procedure Cmd_Nack (This : in out I2C_Device); function Bus_Status (This : I2C_Device) return I2C_Status; end SAM.SERCOM.I2C;

40.614035

78

0.55162

235f81d75e952a4c5f90481719c0a06543cf120d

34,474

adb

Ada

makeewds.adb

ddugovic/words

13c2fc67d5b75259318cb4c9d23d3abcb7e5efbe

[ "MIT" ]

4

2016-10-30T13:30:55.000Z

2021-09-25T21:29:17.000Z

makeewds.adb

ddugovic/words

13c2fc67d5b75259318cb4c9d23d3abcb7e5efbe

[ "MIT" ]

1

2020-09-29T02:56:42.000Z

2020-10-06T18:50:42.000Z

makeewds.adb

ddugovic/words

13c2fc67d5b75259318cb4c9d23d3abcb7e5efbe

[ "MIT" ]

7

2016-07-07T20:40:08.000Z

2021-10-18T21:11:06.000Z

with TEXT_IO; with STRINGS_PACKAGE; use STRINGS_PACKAGE; with LATIN_FILE_NAMES; use LATIN_FILE_NAMES; with INFLECTIONS_PACKAGE; use INFLECTIONS_PACKAGE; with DICTIONARY_PACKAGE; use DICTIONARY_PACKAGE; with LINE_STUFF; use LINE_STUFF; with ENGLISH_SUPPORT_PACKAGE; use ENGLISH_SUPPORT_PACKAGE; with WEED; with WEED_ALL; with DICTIONARY_FORM; procedure MAKEEWDS is package INTEGER_IO is new TEXT_IO.INTEGER_IO(INTEGER); use TEXT_IO; use INTEGER_IO; use STEM_KEY_TYPE_IO; use DICTIONARY_ENTRY_IO; use PART_ENTRY_IO; use PART_OF_SPEECH_TYPE_IO; use KIND_ENTRY_IO; use TRANSLATION_RECORD_IO; use AGE_TYPE_IO; use AREA_TYPE_IO; use GEO_TYPE_IO; use FREQUENCY_TYPE_IO; use SOURCE_TYPE_IO; use EWDS_Record_io; PORTING : constant BOOLEAN := FALSE; CHECKING : constant BOOLEAN := TRUE; D_K : DICTIONARY_KIND := XXX; -- ###################### START_STEM_1 : constant := 1; START_STEM_2 : constant := START_STEM_1 + MAX_STEM_SIZE + 1; START_STEM_3 : constant := START_STEM_2 + MAX_STEM_SIZE + 1; START_STEM_4 : constant := START_STEM_3 + MAX_STEM_SIZE + 1; START_PART : constant := START_STEM_4 + MAX_STEM_SIZE + 1; START_TRAN : constant INTEGER := START_PART + INTEGER(PART_ENTRY_IO.DEFAULT_WIDTH + 1); FINISH_LINE : constant INTEGER := START_TRAN + TRANSLATION_RECORD_IO.DEFAULT_WIDTH - 1; LINE_NUMBER : INTEGER := 0; subtype WORD_TYPE is STRING(1..MAX_MEANING_SIZE); subtype LINE_TYPE is STRING(1..400); N : INTEGER := 0; INPUT, OUTPUT, CHECK : TEXT_IO.FILE_TYPE; DE : DICTIONARY_ENTRY; NULL_WORD_TYPE, BLANK_WORD : WORD_TYPE := (others => ' '); S, LINE, BLANK_LINE : LINE_TYPE := (others => ' '); L, LL, LAST : INTEGER := 0; EWA : EWDS_ARRAY(1..40) := (others => NULL_EWDS_RECORD); EWR : EWDS_RECORD := NULL_EWDS_RECORD; -- First we supplement MEAN with singles of any hyphenated words -- In principle this could be done in the main EXTRACT, much same logic/code -- However this is difficult code for an old man, EXTRACT was hard when I was a bit younger -- And I cannot remember anything about it. Separating them out makes it much easier to test function ADD_HYPHENATED(S : STRING) return STRING is -------- I tried to do something with hyphenated but so far it does not work ---------- -- Find hyphenated words and add them to MEAN with a / connector, right before the parse -- so one has both the individual words (may be more than two) and a single combined word -- counting-board -> counting board/countingboard T : STRING (1..MAX_MEANING_SIZE*2 + 20) := (others => ' '); -- Cannot be bigger WORD_START : INTEGER := 1; WORD_END : INTEGER := 0; I, J, JMAX : INTEGER := 0; HYPHENATED : BOOLEAN := FALSE; WW : INTEGER := 0; -- For debug begin --PUT_LINE("S " & INTEGER'IMAGE(LINE_NUMBER) & " " & INTEGER'IMAGE(S'FIRST) & " " & INTEGER'IMAGE(S'LAST)); --PUT_LINE(S); while I < S'LAST loop I := I + 1; J := J + 1; WORD_END := 0; --PUT(INTEGER'IMAGE(I) & "-"); -- First clear away or ignore all the non-words stuff if S(I) = '|' then -- Skip continuation |'s WORD_START := I + 1; T(J) := S(I); J := J + 1; JMAX := JMAX + 1; null; I := I + 1; --PUT_LINE("||| " & INTEGER'IMAGE(LINE_NUMBER) & " " & S(I) & '_' & S(WORD_START..S'LAST)); elsif S(I) = '"' then -- Skip "'s WORD_START := I + 1; T(J) := S(I); J := J + 1; JMAX := JMAX + 1; null; I := I + 1; --PUT_LINE('"' & " " & INTEGER'IMAGE(LINE_NUMBER) & " ->" & S(WORD_START..S'LAST)); else if S(I) = '(' then -- (...) not to be parsed T(J) := S(I); J := J + 1; JMAX := JMAX + 1; I := I + 1; while S(I) /= ')' loop T(J) := S(I); J := J + 1; JMAX := JMAX + 1; I := I + 1; end loop; WORD_START := I + 2; -- Skip }; WORD_END := 0; elsif S(I) = '[' then -- (...) not to be parsed T(J) := S(I); J := J + 1; JMAX := JMAX + 1; I := I + 1; while S(I-1..I) /= "=>" loop T(J) := S(I); J := J + 1; JMAX := JMAX + 1; I := I + 1; end loop; WORD_START := I + 2; WORD_END := 0; end if; -- Finished with the non-word stuff if (S(I) = '-') then WORD_END := I - 1; -- if (I /= S'FIRST) and then -- Not -word -- ( (S(I-1) /= ' ') and -- (S(I-1) /= '/') ) then -- HYPHENATED := TRUE; -- end if; --PUT_LINE("--- " & INTEGER'IMAGE(LINE_NUMBER) & " " & INTEGER'IMAGE(I) & --" " & INTEGER'IMAGE(WORD_START) & " " & INTEGER'IMAGE(WORD_END) & " ->" & S(WORD_START..WORD_END)); end if; if S(I) = ' ' or S(I) = '/' or S(I) = ',' or S(I) = ';' or S(I) = '!' or S(I) = '?' or S(I) = '+' or S(I) = '*' or S(I) = '"' or S(I) = '(' then WORD_END := I - 1; --PUT_LINE(INTEGER'IMAGE(LINE_NUMBER) & " NNN " & S(I) & " " & INTEGER'IMAGE(I) & " " --& INTEGER'IMAGE(WORD_START)& " " & INTEGER'IMAGE(WORD_END) & " " & S(WORD_START..WORD_END)); if HYPHENATED then T(J) := '/'; J := J + 1; JMAX := JMAX + 1; for K in WORD_START..WORD_END loop if S(K) /= '-' then T(J) := S(K); J := J + 1; JMAX := JMAX + 1; end if; end loop; HYPHENATED := FALSE; end if; end if; if --WORD_END /= 0 and then (S(I) = ' ' or S(I) = '/' ) then WORD_START := I + 1; WORD_END := 0; end if; --PUT_LINE(INTEGER'IMAGE(LINE_NUMBER) & " TTT " & S(I) & " " & INTEGER'IMAGE(I) & --" " & INTEGER'IMAGE(WORD_START) & " " & INTEGER'IMAGE(WORD_END) & " " & S(WORD_START..WORD_END)); end if; -- On '|' -- Set up the output to return --PUT('|' & INTEGER'IMAGE(J) & '/' & INTEGER'IMAGE(I)); T(J) := S(I); JMAX := JMAX + 1; end loop; -- Over S'RANGE --PUT_LINE("RRR ->" & INTEGER'IMAGE(LINE_NUMBER) & " " & T(1..JMAX)); return T(1..JMAX); exception when others => PUT_LINE("ADD_HYPHENATED Exception LINE = " & INTEGER'IMAGE(LINE_NUMBER)); PUT_LINE(S); PUT(DE); NEW_LINE; return T(1..JMAX); end ADD_HYPHENATED; procedure EXTRACT_WORDS (S : in STRING; POFS : in PART_OF_SPEECH_TYPE; N : out INTEGER; EWA : out EWDS_ARRAY) is I, J, JS, K, L, M, IM, IC : INTEGER := 0; START_SEMI, END_SEMI : INTEGER := 1; -- Have to expand type to take care of hyphenated subtype X_MEANING_TYPE is STRING(1..MAX_MEANING_SIZE*2+20); NULL_X_MEANING_TYPE : constant X_MEANING_TYPE := (others => ' '); SEMI, COMMA : X_MEANING_TYPE := NULL_X_MEANING_TYPE; SM1, SM2 : INTEGER := 0; WW : INTEGER := 0; -- For debug begin --NEW_LINE(2); --PUT_LINE("MEAN " & INTEGER'IMAGE(LINE_NUMBER) & " =>" & S); --PUT_LINE("MEAN=>" & INTEGER'IMAGE(S'FIRST) & " " & INTEGER'IMAGE(S'LAST) & "|::::::::"); I := 1; -- Element Position in line, per SEMI J := 1; -- Position in word K := 0; -- SEMI - Division in line L := 1; -- Position in MEAN, for EXTRACTing SEMI M := 1; -- COMMA in SEMI N := 1; -- Word number IM := 0; -- Position in SEMI IC := 0; -- Position in COMMA EWA(N) := NULL_EWDS_RECORD; -- Slightly disparage extension if S(1) = '|' then K := 3; end if; while L <= S'LAST loop -- loop over MEAN if S(L) = ' ' then -- Clear initial blanks L := L + 1; end if; SEMI := NULL_X_MEANING_TYPE; IM := 1; SM1 := 1; SM2 := 0; EXTRACT_SEMI: loop --PUT('/'); --PUT(S(L)); if S(L) = '|' then null; -- Ignore continuation flag | as word elsif S(L) in '0'..'9' then null; -- Ignore numbers elsif S(L) = ';' then -- Division Terminator --PUT(':'); K := K + 1; SM2 := IM - 1; --PUT('+'); L := L + 1; -- Clear ; exit; elsif S(L) = '(' then -- Skip (...) ! --PUT('['); while S(L) /= ')' loop --PUT('+'); --PUT(INTEGER'IMAGE(L)); --PUT(S(L)); exit when L = S'LAST; -- Run out L := L + 1; end loop; -- L := L + 1; -- Clear the ')' --PUT('^'); --PUT(INTEGER'IMAGE(L)); --PUT(S(L)); if L > S'LAST then L := S'LAST; SM2 := IM; else if S(L) = ';' then -- ); SM2 := IM - 1; exit EXTRACT_SEMI; end if; end if; --PUT(']'); if L >= S'LAST then -- Ends in ) --PUT('!'); SM2 := IM; exit; end if; --PUT('+'); --L := L + 1; -- Clear the ')' elsif L = S'LAST then --PUT('|'); SM2 := IM; L := L + 1; -- To end the loop exit; else SEMI(IM) := S(L); SM2 := IM; IM := IM + 1; end if; --PUT('+'); --IM := IM + 1; -- To next character L := L + 1; -- To next character end loop EXTRACT_SEMI; WW := 10; --if LINE_NUMBER = 8399 then --NEW_LINE; --PUT_LINE("NEW SEMI=>" & SEMI(SM1..SM2) & "|::::::::"); --PUT_LINE("NEW SEMI INDEX=>" & INTEGER'IMAGE(SM1) & " " & INTEGER'IMAGE(SM2) & "|::::::::"); --end if; PROCESS_SEMI: declare ST : constant STRING := TRIM(SEMI); SM : STRING(ST'FIRST..ST'LAST) := ST; START_COMMA, END_COMMA : INTEGER := 0; begin if ST'LENGTH > 0 then COMMA := NULL_X_MEANING_TYPE; IM := SM'FIRST; M := 0; --I := SM'FIRST; --while I <= ST'LAST loop --PUT(S(I)); --PUT('*'); --COMMA := NULL_X_MEANING_TYPE; IC := 1; LOOP_OVER_SEMI: while IM <= SM'LAST loop COMMA := NULL_X_MEANING_TYPE; WW := 20; FIND_COMMA: loop --PUT(INTEGER'IMAGE(IM) & " ( " & SM(IM)); if SM(IM) = '(' then -- Skip (...) ! while SM(IM) /= ')' loop IM := IM + 1; end loop; IM := IM + 1; -- Clear the ')' -- IM := IM + 1; -- Go to next character --PUT_LINE("Cleared (+" & " IM = " & INTEGER'IMAGE(IM)); if IM >= END_SEMI then --PUT_LINE("exit on SM'LAST " & INTEGER'IMAGE(SM'LAST) & " I = " & INTEGER'IMAGE(IM)); exit; end if; --PUT_LINE("No exit on SM'LAST " & INTEGER'IMAGE(SM'LAST) & " I = " & INTEGER'IMAGE(IM) & "|" & SM(IM) & "|"); if (SM(IM) = ';') or (SM(IM) = ',') then --PUT_LINE("Found ;, COMMA IM = " & INTEGER'IMAGE(IM)); -- Foumd COMMA M := M + 1; IC := 1; IM := IM + 1; -- Clear ;, exit; elsif SM(IM) = ' ' then --PUT_LINE("Found blank - IM = " & INTEGER'IMAGE(IM)); IM := IM + 1; --PUT_LINE("Found blank + IM = " & INTEGER'IMAGE(IM)); end if; --PUT_LINE("------------------------"); end if; if SM(IM) = '[' then -- Take end of [=>] while SM(IM) /= '>' loop exit when SM(IM) = ']'; -- If no > IM := IM + 1; end loop; IM := IM + 1; -- Clear the '>' or ']' if SM(IM) = ';' then -- Foumd COMMA M := M + 1; IC := 1; IM := IM + 1; -- Clear ; exit; elsif SM(IM) = ' ' then IM := IM + 1; end if; end if; -- But could be 2 =>! --PUT_LINE("Through ()[] I = " & INTEGER'IMAGE(I)); exit when IM > SM'LAST; --PUT(INTEGER'IMAGE(IM) & " ) " & SM(IM)); if SM(IM) = ',' then -- Foumd COMMA M := M + 1; IC := 1; IM := IM + 1; -- Clear , exit; elsif IM >= SM'LAST or IM = S'LAST then -- Foumd COMMA COMMA(IC) := SM(IM); M := M + 1; IC := 1; exit; else COMMA(IC) := SM(IM); IM := IM + 1; IC := IC + 1; end if; --PUT(INTEGER'IMAGE(IM) & " ! " & SM(IM)); end loop FIND_COMMA; --PUT_LINE("COMMA " & INTEGER'IMAGE(LINE_NUMBER) & INTEGER'IMAGE(IM) & "=>" & TRIM(COMMA)); IM := IM + 1; WW := 30; PROCESS_COMMA: declare CT : constant STRING := TRIM(COMMA); CS : STRING(CT'FIRST..CT'LAST) := CT; PURE : BOOLEAN := TRUE; W_START, W_END : INTEGER := 0; begin WW := 31; --PUT_LINE("PROCESS COMMA " & INTEGER'IMAGE(LINE_NUMBER) & INTEGER'IMAGE(CT'FIRST) & INTEGER'IMAGE(CT'LAST) & "=>" & TRIM(COMMA)); if CT'LENGTH > 0 then -- Is COMMA non empty -- Are there any blanks? -- If not then it is a pure word -- Or words with / for IP in CS'RANGE loop if CS(IP) = ' ' then PURE := FALSE; end if; end loop; WW := 32; -- Check for WEED words and eliminate them W_START := CS'FIRST; W_END := CS'LAST; for IW in CS'RANGE loop --PUT('-'); --PUT(CS(IW)); if (CS(IW) = '(') or (CS(IW) = '[') then WW := 33; W_START := IW + 1; else WW := 34; if (CS(IW) = ' ') or (CS(IW) = '_') or (CS(IW) = '-') or (CS(IW) = ''') or (CS(IW) = '!') or (CS(IW) = '/') or (CS(IW) = ':') or (CS(IW) = '.') or (CS(IW) = '!') or (CS(IW) = ')') or (CS(IW) = ']') or (IW = CS'LAST) then --PUT_LINE("HIT " & CS(IW) & " IW = " & INTEGER'IMAGE(IW) & " CS'LAST = " & INTEGER'IMAGE(CS'LAST)); WW := 35; if IW = CS'LAST then W_END := IW; elsif IW /= CS'FIRST then W_END := IW - 1; end if; WW := 36; -- KLUDGE if CS(W_START) = '"' then WW := 361; W_START := W_START + 1; WW := 362; elsif CS(W_END) = '"' then WW := 364; W_END := W_END - 1; WW := 365; end if; WW := 37; --PUT_LINE(INTEGER'IMAGE(LINE_NUMBER) & "WEEDing " & --INTEGER'IMAGE(W_START) & " " & INTEGER'IMAGE(W_END) --& " " & CS(W_START..W_END) --); WEED_ALL(CS(W_START..W_END), POFS); if not PURE then WEED(CS(W_START..W_END), POFS); end if; W_START := IW + 1; end if; WW := 38; end if; WW := 39; end loop; -- On CS'RANGE --PUT_LINE(INTEGER'IMAGE(LINE_NUMBER) & "WEED done"); WW := 40; -- Main process of COMMA IC := 1; J := 1; while IC <= CS'LAST loop --PUT(CS(IC)); if CS(IC) = '"' or -- Skip all " CS(IC) = '(' or -- Skip initial ( --CS(IC) = '-' or -- Skip hyphen -> one word! CS(IC) = '?' or -- Ignore ? CS(IC) = '~' or -- Ignore about ~ CS(IC) = '*' or CS(IC) = '%' or -- Ignore percent unless word CS(IC) = '.' or -- Ignore ... CS(IC) = '\' or -- Ignore weed (CS(IC) in '0'..'9') then -- Skip numbers IC := IC + 1; WW := 50; ----PUT('-'); else if -- S(IC) = ',' or -- Terminators -- S(IC) = '.' or -- Would be typo -- S(IC) = ';' or -- Should catch at SEMI CS(IC) = '/' or CS(IC) = ' ' or CS(IC) = ''' or -- Ignore all ' incl 's ??? CS(IC) = '-' or -- Hyphen causes 2 words XXX CS(IC) = '+' or -- Plus causes 2 words CS(IC) = '_' or -- Underscore causes 2 words CS(IC) = '=' or -- = space/terminates CS(IC) = '>' or CS(IC) = ')' or CS(IC) = ']' or CS(IC) = '!' or CS(IC) = '?' or CS(IC) = '+' or CS(IC) = ':' or CS(IC) = ']' then -- Found word WW := 60; --PUT('/'); EWA(N).SEMI := K; if PURE then if K = 1 then EWA(N).KIND := 15; else EWA(N).KIND := 10; end if; else EWA(N).KIND := 0; end if; WW := 70; --PUT_LINE("====1 K J = " & INTEGER'IMAGE(K) & " " & INTEGER'IMAGE(J) & " ." & EWA(N).W(1..J-1) & "."); N := N + 1; -- Start new word in COMMA IC := IC + 1; J := 1; EWA(N) := NULL_EWDS_RECORD; elsif -- Order of if important IC = CS'LAST then -- End, Found word --PUT('!'); EWA(N).W(J) := CS(IC); EWA(N).SEMI := K; if PURE then if K = 1 then EWA(N).KIND := 15; else EWA(N).KIND := 10; end if; else EWA(N).KIND := 0; end if; --PUT_LINE("====2 K J = " & INTEGER'IMAGE(K) & " " & INTEGER'IMAGE(J) & " ." & EWA(N).W(1..J) & "."); N := N + 1; -- Start new word/COMMA EWA(N) := NULL_EWDS_RECORD; exit; else WW := 80; --PUT('+'); EWA(N).W(J) := CS(IC); J := J + 1; IC := IC + 1; end if; end if; WW := 90; end loop; end if; -- On COMMA being empty end PROCESS_COMMA; --PUT_LINE("COMMA Processed "); end loop LOOP_OVER_SEMI; --PUT_LINE("LOOP OVER SEMI Processed "); end if; -- On ST'LENGTH > 0 --PUT_LINE("LOOP OVER SEMI after ST'LENGTH 0 "); end PROCESS_SEMI; --PUT_LINE("SEMI Processed "); -- I = " & INTEGER'IMAGE(I) --& " S(I) = " & S(I) --); if (L < S'LAST) and then (S(L) = ';') then -- ?????? --PUT_LINE("Clear L = " & INTEGER'IMAGE(L)); L := L + 1; end if; JS := L; -- Odd but necessary ????? for J in L..S'LAST loop exit when J >= S'LAST; if S(J) = ' ' then L := L + 1; else exit; end if; end loop; START_SEMI := L; --PUT_LINE("SEMI Processed Completely L = " & INTEGER'IMAGE(L) & " S'LAST = " & INTEGER'IMAGE(S'LAST)); exit when L >= S'LAST; end loop; -- loop over MEAN --PUT_LINE("SEMI loop Processed"); if EWA(N) = NULL_EWDS_RECORD then N := N -1; -- Clean up danglers end if; if EWA(N) = NULL_EWDS_RECORD then -- AGAIN!!!!!! N := N -1; -- Clean up danglers end if; exception when others => if (S(S'LAST) /= ')') or (S(S'LAST) /= ']') then -- KLUDGE NEW_LINE; PUT_LINE("Extract Exception WW = " & INTEGER'IMAGE(WW) & " LINE = " & INTEGER'IMAGE(LINE_NUMBER)); PUT_LINE(S); PUT(DE); NEW_LINE; end if; end EXTRACT_WORDS; begin PUT_LINE( "Takes a DICTLINE.D_K and produces a EWDSLIST.D_K "); PUT("What dictionary to list, GENERAL or SPECIAL =>"); GET_LINE(LINE, LAST); if LAST > 0 then if TRIM(LINE(1..LAST))(1) = 'G' or else TRIM(LINE(1..LAST))(1) = 'g' then D_K := GENERAL; -- LINE_NUMBER := LINE_NUMBER + 1; -- Because of ESSE DICTFILE line -- no longer elsif TRIM(LINE(1..LAST))(1) = 'S' or else TRIM(LINE(1..LAST))(1) = 's' then D_K := SPECIAL; else PUT_LINE("No such dictionary"); raise TEXT_IO.DATA_ERROR; end if; end if; --PUT_LINE("OPENING " & -- ADD_FILE_NAME_EXTENSION(DICT_LINE_NAME, DICTIONARY_KIND'IMAGE(D_K))); OPEN(INPUT, IN_FILE, ADD_FILE_NAME_EXTENSION(DICT_LINE_NAME, DICTIONARY_KIND'IMAGE(D_K))); --PUT_LINE("OPEN"); if not PORTING then --PUT_LINE("CREATING"); CREATE(OUTPUT, OUT_FILE, ADD_FILE_NAME_EXTENSION("EWDSLIST", DICTIONARY_KIND'IMAGE(D_K))); if CHECKING then CREATE(CHECK, OUT_FILE, "CHECKEWD."); end if; --PUT_LINE("CREATED"); end if; -- Now do the rest OVER_LINES: while not END_OF_FILE(INPUT) loop S := BLANK_LINE; GET_LINE(INPUT, S, LAST); if TRIM(S(1..LAST)) /= "" then -- If non-blank line L := 0; FORM_DE: begin DE.STEMS(1) := S(START_STEM_1..MAX_STEM_SIZE); --NEW_LINE; PUT(DE.STEMS(1)); DE.STEMS(2) := S(START_STEM_2..START_STEM_2+MAX_STEM_SIZE-1); DE.STEMS(3) := S(START_STEM_3..START_STEM_3+MAX_STEM_SIZE-1); DE.STEMS(4) := S(START_STEM_4..START_STEM_4+MAX_STEM_SIZE-1); --PUT('#'); PUT(INTEGER'IMAGE(L)); PUT(INTEGER'IMAGE(LAST)); --PUT('@'); GET(S(START_PART..LAST), DE.PART, L); --PUT('%'); PUT(INTEGER'IMAGE(L)); PUT(INTEGER'IMAGE(LAST)); --PUT('&'); PUT(S(L+1..LAST)); PUT('3'); --GET(S(L+1..LAST), DE.PART.POFS, DE.KIND, L); GET(S(L+1..LAST), DE.TRAN.AGE, L); GET(S(L+1..LAST), DE.TRAN.AREA, L); GET(S(L+1..LAST), DE.TRAN.GEO, L); GET(S(L+1..LAST), DE.TRAN.FREQ, L); GET(S(L+1..LAST), DE.TRAN.SOURCE, L); DE.MEAN := HEAD(S(L+2..LAST), MAX_MEANING_SIZE); -- Note that this allows initial blanks -- L+2 skips over the SPACER, required because this is STRING, not ENUM exception when others => NEW_LINE; PUT_LINE("GET Exception LAST = " & INTEGER'IMAGE(LAST)); PUT_LINE(S(1..LAST)); INTEGER_IO.PUT(LINE_NUMBER); NEW_LINE; PUT(DE); NEW_LINE; end FORM_DE; LINE_NUMBER := LINE_NUMBER + 1; if DE.PART.POFS = V and then DE.PART.V.CON.WHICH = 8 then -- V 8 is a kludge for variant forms of verbs that have regular forms elsewhere null; else -- Extract words EXTRACT_WORDS(ADD_HYPHENATED(TRIM(DE.MEAN)), DE.PART.POFS, N, EWA); -- EWORD_SIZE : constant := 38; -- AUX_WORD_SIZE : constant := 9; -- LINE_NUMBER_WIDTH : constant := 10; -- -- type EWDS_RECORD is -- record -- POFS : PART_OF_SPEECH_TYPE := X; -- W : STRING(1..EWORD_SIZE); -- AUX : STRING(1..AUX_WORD_SIZE); -- N : INTEGER; -- end record; for I in 1..N loop if TRIM(EWA(I).W)'LENGTH /= 0 then EWR.W := HEAD(TRIM(EWA(I).W), EWORD_SIZE); EWR.AUX := HEAD("", AUX_WORD_SIZE); EWR.N := LINE_NUMBER; EWR.POFS := DE.PART.POFS; EWR.FREQ := DE.TRAN.FREQ; EWR.SEMI := EWA(I).SEMI; EWR.KIND := EWA(I).KIND; EWR.RANK := 80-FREQUENCY_TYPE'POS(EWR.FREQ)*10 + EWR.KIND + (EWR.SEMI-1)*(-3); if EWR.FREQ = INFLECTIONS_PACKAGE.N then EWR.RANK := EWR.RANK + 25; end if; --PUT(EWA(I)); NEW_LINE; --PUT(EWR); NEW_LINE; PUT(OUTPUT, EWR); -- SET_COL(OUTPUT, 71); -- INTEGER_IO.PUT(OUTPUT, I, 2); NEW_LINE(OUTPUT); if CHECKING then -- Now make the CHECK file PUT(CHECK, EWR.W); SET_COL(CHECK, 25); declare DF : constant STRING := DICTIONARY_FORM(DE); II : INTEGER := 1; begin if DF'LENGTH > 0 then while DF(II) /= ' ' and DF(II) /= '.' and DF(II) /= ',' loop PUT(CHECK, DF(II)); II := II+ 1; exit when II = 19; end loop; end if; end; SET_COL(CHECK, 44); PUT(CHECK, EWR.N, 6); PUT(CHECK, ' '); PUT(CHECK, EWR.POFS); PUT(CHECK, ' '); PUT(CHECK, EWR.FREQ); PUT(CHECK, ' '); PUT(CHECK, EWR.SEMI, 5); PUT(CHECK, ' '); PUT(CHECK, EWR.KIND, 5); PUT(CHECK, ' '); PUT(CHECK, EWR.RANK, 5); PUT(CHECK, ' '); PUT(CHECK, DE.MEAN); NEW_LINE(CHECK); end if; end if; end loop; end if; -- If non-blank line end if; end loop OVER_LINES; PUT_LINE("NUMBER_OF_LINES = " & INTEGER'IMAGE(LINE_NUMBER)); if not PORTING then CLOSE(OUTPUT); if CHECKING then CLOSE(CHECK); end if; end if; exception when TEXT_IO.DATA_ERROR => null; when others => PUT_LINE(S(1..LAST)); INTEGER_IO.PUT(INTEGER(LINE_NUMBER)); NEW_LINE; CLOSE(OUTPUT); if CHECKING then CLOSE(CHECK); end if; end MAKEEWDS;

39.353881

132

0.337849

a1f18cd8555e8b5fd6aace86ba358227f877e26f

1,203

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-sfteio.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/a-sfteio.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-sfteio.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S H O R T _ F L O A T _ T E X T _ I O -- -- -- -- S p e c -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. In accordance with the copyright of that document, you can freely -- -- copy and modify this specification, provided that if you redistribute a -- -- modified version, any changes that you have made are clearly indicated. -- -- -- ------------------------------------------------------------------------------ with Ada.Text_IO; package Ada.Short_Float_Text_IO is new Ada.Text_IO.Float_IO (Short_Float);

60.15

78

0.300914

1d0ddb82ba2a67049b266bd18974dfae52833d04

2,147

adb

Ada

source/machine-apple-darwin/s-zetest.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/machine-apple-darwin/s-zetest.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/machine-apple-darwin/s-zetest.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

with System.Address_To_Constant_Access_Conversions; with System.Address_To_Named_Access_Conversions; package body System.Zero_Terminated_Strings is pragma Suppress (All_Checks); use type C.size_t; function strlen (s : not null access constant C.char) return C.size_t with Import, Convention => Intrinsic, External_Name => "__builtin_strlen"; procedure memcpy (s1, s2 : Address; n : C.size_t) with Import, Convention => Intrinsic, External_Name => "__builtin_memcpy"; -- implementation function Value (Item : not null access constant C.char) return String is begin return Value (Item, strlen (Item)); end Value; function Value (Item : not null access constant C.char; Length : C.size_t) return String is type char_const_ptr is access constant C.char -- local type with Convention => C; for char_const_ptr'Storage_Size use 0; package Conv is new Address_To_Constant_Access_Conversions (C.char, char_const_ptr); Item_All : String (1 .. Natural (Length)); for Item_All'Address use Conv.To_Address (char_const_ptr (Item)); begin return Item_All; end Value; procedure To_C (Source : String; Result : not null access C.char) is Dummy : C.size_t; begin To_C (Source, Result, Dummy); end To_C; procedure To_C ( Source : String; Result : not null access C.char; Result_Length : out C.size_t) is begin -- Source and Result should not be overlapped Result_Length := Source'Length; declare type char_ptr is access all C.char -- local type with Convention => C; for char_ptr'Storage_Size use 0; package Conv is new Address_To_Named_Access_Conversions (C.char, char_ptr); Result_All : aliased C.char_array (0 .. Result_Length); for Result_All'Address use Conv.To_Address (char_ptr (Result)); begin memcpy (Result_All'Address, Source'Address, Result_Length); Result_All (Result_Length) := C.char'Val (0); end; end To_C; end System.Zero_Terminated_Strings;

33.546875

77

0.670703

0696b79d18891a1eedcf90e507d8b0e98c1b0362

45

adb

Ada

src/tri_base.adb

zdimension/tdinfo302

0bfa11f56215a7afc0e9ff58d3fb296c184f23b4

[ "MIT" ]

null

src/tri_base.adb

zdimension/tdinfo302

0bfa11f56215a7afc0e9ff58d3fb296c184f23b4

[ "MIT" ]

null

src/tri_base.adb

zdimension/tdinfo302

0bfa11f56215a7afc0e9ff58d3fb296c184f23b4

[ "MIT" ]

null

procedure tri_base is begin end tri_base;

11.25

21

0.777778

a1c2bc277ac90d3b6301df93c8215079006eb5b9

662

ada

Ada

examples/Ada/spworker.ada

dcramer/zguide

a07fe97c4c597e6401b4281ae07c3a156590f4c6

[ "Zed", "X11", "MIT" ]

2

2015-09-24T19:53:04.000Z

2015-11-06T10:22:53.000Z

examples/Ada/spworker.ada

dcramer/zguide

a07fe97c4c597e6401b4281ae07c3a156590f4c6

[ "Zed", "X11", "MIT" ]

null

examples/Ada/spworker.ada

dcramer/zguide

a07fe97c4c597e6401b4281ae07c3a156590f4c6

[ "Zed", "X11", "MIT" ]

null

No-one has translated the spworker example into Ada yet. Be the first to create spworker in Ada and get one free Internet! If you're the author of the Ada binding, this is a great way to get people to use 0MQ in Ada. To submit a new translation email it to [email protected]. Please: * Stick to identical functionality and naming used in examples so that readers can easily compare languages. * You MUST place your name as author in the examples so readers can contact you. * You MUST state in the email that you license your code under the MIT/X11 license. Subscribe to the email list at http://lists.zeromq.org/mailman/listinfo/zeromq-dev.

47.285714

83

0.776435

3189ee10e87b07cdb4bc1965afca4a6a90acf773

2,696

ads

Ada

3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_raycast-continuous_convex.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_raycast-continuous_convex.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_raycast-continuous_convex.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with impact.d3.collision.convex_Raycast, impact.d3.collision.simplex_Solver, impact.d3.collision.convex_penetration_depth_Solver, impact.d3.Shape.convex, impact.d3.Shape.concave.static_plane, impact.d3.collision.point_Collector; package impact.d3.collision.convex_Raycast.continuous_convex -- -- impact.d3.collision.convex_Raycast.continuous_convex implements angular and linear time of impact for convex objects. -- -- Based on Brian Mirtich's Conservative Advancement idea (PhD thesis). -- -- Algorithm operates in worldspace, in order to keep inbetween motion globally consistent. -- It uses GJK at the moment. Future improvement would use minkowski sum / supporting vertex, merging innerloops -- is type Item is new impact.d3.collision.convex_Raycast.Item with private; --- Forge -- function to_convex_Raycast (shapeA, shapeB : access impact.d3.Shape.convex.Item'Class; simplexSolver : access impact.d3.collision.simplex_Solver.item'Class; penetrationDepthSolver : access impact.d3.collision.convex_penetration_depth_Solver.item'Class) return Item; function to_convex_Raycast (shapeA : access impact.d3.Shape.convex.Item'Class; plane : access impact.d3.Shape.concave.static_plane.item'Class) return Item; --- Attributes -- overriding function calcTimeOfImpact (Self : access Item; fromA, toA : in Transform_3d; fromB, toB : in Transform_3d; result : access impact.d3.collision.convex_Raycast.CastResult'Class) return Boolean; private type Item is new impact.d3.collision.convex_Raycast.Item with record m_simplexSolver : access impact.d3.collision.simplex_Solver .Item'Class; m_penetrationDepthSolver : access impact.d3.collision.convex_penetration_depth_Solver.Item'Class; m_convexA : access impact.d3.Shape.convex .Item'Class; m_convexB1 : access impact.d3.Shape.convex .Item'Class; -- second object is either a convex or a plane (code sharing) m_planeShape : access impact.d3.Shape.concave.static_plane .Item'Class; end record; procedure computeClosestPoints (Self : in out Item; transA, transB : in Transform_3d; pointCollector : in out impact.d3.collision.point_Collector.item); end impact.d3.collision.convex_Raycast.continuous_convex;

37.444444

159

0.650593

20fe90a7429a4e4af4fb6e759692d54ee9a06222

34,351

adb

Ada

src/asis/asis-text.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

15

2015-01-18T23:04:19.000Z

2022-03-01T20:27:08.000Z

src/asis/asis-text.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

16

2018-06-10T07:09:30.000Z

2022-03-26T18:28:40.000Z

src/asis/asis-text.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

3

2015-11-11T18:00:14.000Z

2022-01-30T23:08:45.000Z

------------------------------------------------------------------------------ -- -- -- ASIS-for-GNAT IMPLEMENTATION COMPONENTS -- -- -- -- A S I S . T E X T -- -- -- -- B o d y -- -- -- -- Copyright (C) 1995-2011, Free Software Foundation, Inc. -- -- -- -- ASIS-for-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 -- -- Software Foundation; either version 2, or (at your option) any later -- -- version. ASIS-for-GNAT is distributed in the hope that it will be use- -- -- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- -- -- CHANTABILITY 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 ASIS-for-GNAT; see file -- -- COPYING. If not, write to the Free Software Foundation, 51 Franklin -- -- Street, Fifth Floor, Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the -- -- Software Engineering Laboratory of the Swiss Federal Institute of -- -- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the -- -- Scientific Research Computer Center of Moscow State University (SRCC -- -- MSU), Russia, with funding partially provided by grants from the Swiss -- -- National Science Foundation and the Swiss Academy of Engineering -- -- Sciences. ASIS-for-GNAT is now maintained by AdaCore -- -- (http://www.adacore.com). -- -- -- ------------------------------------------------------------------------------ with Ada.Characters.Handling; use Ada.Characters.Handling; with Asis; use Asis; with Asis.Compilation_Units; use Asis.Compilation_Units; with Asis.Elements; use Asis.Elements; with Asis.Errors; use Asis.Errors; with Asis.Exceptions; use Asis.Exceptions; with Asis.Set_Get; use Asis.Set_Get; with Asis.Text.Set_Get; use Asis.Text.Set_Get; with A4G.A_Debug; use A4G.A_Debug; with A4G.A_Sinput; use A4G.A_Sinput; with A4G.Contt; use A4G.Contt; with A4G.Contt.TT; use A4G.Contt.TT; with A4G.Contt.UT; use A4G.Contt.UT; with A4G.Span_Beginning; use A4G.Span_Beginning; with A4G.Span_End; use A4G.Span_End; with A4G.Vcheck; use A4G.Vcheck; with Namet; use Namet; with Output; use Output; with Sinput; use Sinput; package body Asis.Text is ------------------- -- Comment_Image -- ------------------- function Comment_Image (The_Line : Asis.Text.Line) return Wide_String is begin Check_Validity (The_Line, "Asis.Text.Comment_Image"); if The_Line.Length = 0 then -- just a small optimization return ""; end if; declare The_Line_Image : Wide_String := Line_Image (The_Line); Comment_Pos : constant Source_Ptr := Comment_Beginning (Text_Buffer (To_String (The_Line_Image))); begin if Comment_Pos = No_Location then -- no comment in this string return ""; else -- we have to pad the beginning (that is, non-comment part) -- of the line image by white spaces, making difference between -- HT and other symbols: for I in The_Line_Image'First .. Natural (Comment_Pos) - 1 loop if To_Character (The_Line_Image (I)) /= ASCII.HT then The_Line_Image (I) := ' '; end if; end loop; return The_Line_Image; end if; end; exception when ASIS_Inappropriate_Line => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Comment_Image"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Comment_Image", Arg_Line => The_Line, Ex => Ex); end Comment_Image; ---------------------- -- Compilation_Span -- ---------------------- function Compilation_Span (Element : Asis.Element) return Asis.Text.Span is Result_Span : Asis.Text.Span := Asis.Text.Nil_Span; S_P : Source_Ptr; S_P_Last : Source_Ptr; SFI : Source_File_Index; Src : Source_Buffer_Ptr; Last_Line : Physical_Line_Number; begin Check_Validity (Element, "Asis.Text.Compilation_Span"); -- In case of GNAT compilations are source files, so there is no need -- to compute Result_Span.First_Line and Result_Span.First_Column - -- the correct values are (1, 1) , and they come from Nil_Span S_P := Get_Location (Element); -- this makes all the rest "tree-swapping-safe" if S_P > Standard_Location then SFI := Get_Source_File_Index (S_P); Src := Source_Text (SFI); Last_Line := Last_Source_Line (SFI); Result_Span.Last_Line := Line_Number (Last_Line); S_P := Line_Start (Last_Line, SFI); S_P_Last := S_P; while not (S_P_Last = Source_Last (SFI) or else Src (S_P_Last) = ASCII.LF or else Src (S_P_Last) = ASCII.CR) loop S_P_Last := S_P_Last + 1; end loop; Result_Span.Last_Column := Character_Position (S_P_Last - S_P); end if; return Result_Span; exception when ASIS_Inappropriate_Element => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Compilation_Span", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Compilation_Span", Arg_Element => Element, Ex => Ex); end Compilation_Span; --------------------------- -- Compilation_Unit_Span -- --------------------------- function Compilation_Unit_Span (Element : Asis.Element) return Asis.Text.Span is Result_Span : Asis.Text.Span := Asis.Text.Nil_Span; CU : Asis.Compilation_Unit; First_El : Asis.Element; Unit : Asis.Element; No_Cont_Clause : Boolean := True; Span_Start : Source_Ptr; Span_End : Source_Ptr; begin Check_Validity (Element, "Asis.Text.Compilation_Unit_Span"); -- First, check that the argument Element is not from the predefined -- Standard package. Span_Start := Get_Location (Element); -- this makes all the rest "tree-swapping-safe" if Span_Start > Standard_Location then CU := Enclosing_Compilation_Unit (Element); Unit := Unit_Declaration (CU); declare Cont_Cl_Elms : constant Asis.Context_Clause_List := Context_Clause_Elements (Compilation_Unit => CU, Include_Pragmas => True); begin if Is_Nil (Cont_Cl_Elms) then First_El := Unit; else First_El := Cont_Cl_Elms (Cont_Cl_Elms'First); No_Cont_Clause := False; end if; end; Span_Start := Set_Image_Beginning (First_El); if No_Cont_Clause then -- For private unit declarations and for subunits we have to take -- into account syntax elements which are not a part of the -- corresponding unit declaration element case Unit_Class (CU) is when A_Private_Declaration => -- Taking into account leading 'private' keyword Span_Start := Search_Prev_Word_Start (Span_Start); when A_Separate_Body => -- Taking into account 'separate (...)" Span_Start := Search_Left_Parenthesis (Span_Start); Span_Start := Search_Prev_Word_Start (Span_Start); when others => null; end case; end if; Span_End := Set_Image_End (Unit); Result_Span := Source_Locations_To_Span (Span_Start, Span_End); end if; return Result_Span; exception when ASIS_Inappropriate_Element => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Compilation_Unit_Span", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Compilation_Unit_Span", Arg_Element => Element, Ex => Ex); end Compilation_Unit_Span; ----------------- -- Debug_Image -- ----------------- function Debug_Image (The_Line : Asis.Text.Line) return Wide_String is LT : String renames ASIS_Line_Terminator; S : constant Source_Ptr := Line_Location (The_Line); -- this makes the rest "tree-swapping-safe" Sindex : constant Source_File_Index := Get_Source_File_Index (S); F_Name : constant File_Name_Type := File_Name (Sindex); T : constant Tree_Id := The_Line.Enclosing_Tree; C : constant Context_Id := The_Line.Enclosing_Context; Tree_Name : String_Ptr; begin Check_Validity (The_Line, "Asis.Text.Debug_Image"); if Present (T) then Get_Name_String (C, T); Tree_Name := new String'(A_Name_Buffer (1 .. A_Name_Len) & " (Tree_Id =" & Tree_Id'Image (T) & ")"); else Tree_Name := new String'(" <nil tree>"); end if; Get_Name_String (F_Name); return To_Wide_String ("Debug image for Asis.Text.Line:" & LT & " obtained from file " & Name_Buffer (1 .. Name_Len) & LT & " Absolute (relative) location in source file :" & Source_Ptr'Image (S) & " (" & Source_Ptr'Image (The_Line.Rel_Sloc) & ')' & LT & " Line :" & Physical_Line_Number'Image (Get_Physical_Line_Number (S)) & LT & " Column:" & Source_Ptr'Image (A_Get_Column_Number (S)) & LT & " Number of characters in line:" & Asis.Text.Character_Position'Image (Line_Length (The_Line)) & LT & " obtained from the tree " & Tree_Name.all); exception when ASIS_Inappropriate_Line => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Debug_Image"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Debug_Image", Arg_Line => The_Line, Ex => Ex); end Debug_Image; --------------------- -- Delimiter_Image -- --------------------- function Delimiter_Image return Wide_String is begin return Asis_Wide_Line_Terminator; end Delimiter_Image; ------------------- -- Element_Image -- ------------------- function Element_Image (Element : Asis.Element) return Wide_String is begin Check_Validity (Element, "Asis.Text.Element_Image"); if not Is_Text_Available (Element) then return ""; end if; declare LList : constant Asis.Text.Line_List := Lines (Element); -- We create the Element Image from Lines containing the Element Spaces : Natural; -- The number of characters in the first line of the Image, which -- should be padded by white spaces Numb : Natural; -- Yere we collect the whole number of characters needed in the -- string representing the result Element image. Note that we are -- counting in wide characters begin Spaces := Natural (Element_Span (Element).First_Column) - 1; Numb := Asis.ASIS_Natural (Spaces) + Asis.ASIS_Natural (LList'Last - LList'First) * Asis.ASIS_Natural (Asis_Wide_Line_Terminator'Length); for I in LList'First .. LList'Last loop Numb := Numb + Natural (Line_Length (LList (I))); end loop; declare Result : Wide_String (1 .. Numb); In_Str : Positive := 1; begin -- The image of the first line may contain spaces padding the part -- of the physal line that precedes the element Result (In_Str .. In_Str + Spaces + Line_Length (LList (LList'First)) - 1) := Line_Image (LList (LList'First)); In_Str := In_Str + Spaces + Line_Length (LList (LList'First)); -- and now - filling the rest of Result_String -- by the "proper" Element Image for Linee in LList'First + 1 .. LList'Last loop Result (In_Str .. In_Str + ASIS_Line_Terminator'Length - 1) := Asis_Wide_Line_Terminator; In_Str := In_Str + Asis_Wide_Line_Terminator'Length; Result (In_Str .. In_Str + Line_Length (LList (Linee)) - 1) := Line_Image (LList (Linee)); In_Str := In_Str + Line_Length (LList (Linee)); end loop; return Result; end; end; exception when ASIS_Inappropriate_Element => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Element_Image", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis_Text.Element_Image", Arg_Element => Element, Ex => Ex); end Element_Image; ------------------ -- Element_Span -- ------------------ -- Element_Span is "tree-swapping-safe"! function Element_Span (Element : Asis.Element) return Asis.Text.Span is Sp : Asis.Text.Span := Asis.Text.Nil_Span; Span_Start : Source_Ptr; Span_End : Source_Ptr; begin Check_Validity (Element, "Asis.Text.Element_Span"); if Debug_Flag_X or else Debug_Mode then Write_Str ("*** Asis.Text.Element_Span ***"); Write_Eol; Write_Str ("Element kind is "); Write_Str (Internal_Element_Kinds'Image (Int_Kind (Element))); Write_Eol; end if; if not Is_Text_Available (Element) then if Debug_Flag_X or else Debug_Mode then Write_Str ("!!! Text isn't available !!!"); Write_Eol; end if; return Sp; end if; -- Set_Image_Beginning is "tree-swapping-safe" Span_Start := Set_Image_Beginning (Element); Span_End := Set_Image_End (Element); Sp := Source_Locations_To_Span (Span_Start, Span_End); if Debug_Flag_X or else Debug_Mode then Write_Str ("Returning Asis.Text.Span parameters:"); Write_Eol; Write_Str (Debug_Image (Sp)); Write_Eol; end if; return Sp; exception when ASIS_Inappropriate_Element => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Element_Span", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Element_Span", Arg_Element => Element, Ex => Ex); end Element_Span; ----------------------- -- First_Line_Number -- ----------------------- function First_Line_Number (Element : Asis.Element) return Line_Number is Sp : Asis.Text.Span; begin Check_Validity (Element, "Asis.Text.First_Line_Number"); if Is_Text_Available (Element) then Sp := Element_Span (Element); return Sp.First_Line; else return 0; end if; exception when ASIS_Inappropriate_Element => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.First_Line_Number", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.First_Line_Number", Arg_Element => Element, Ex => Ex); end First_Line_Number; -------------- -- Is_Equal -- -------------- function Is_Equal (Left : Asis.Text.Line; Right : Asis.Text.Line) return Boolean is C_Left : Context_Id; C_Right : Context_Id; U_Left : Unit_Id; U_Right : Unit_Id; begin Check_Validity (Left, "Asis.Text.Is_Equal"); Check_Validity (Right, "Asis.Text.Is_Equal"); -- Two lines which are Is_Equal may be obtained from different -- Context, and they may be based on different trees. But to -- be Is_Equal, they have to represent the same portion of the -- source text from the same source file if Left.Length /= Right.Length or else Left.Rel_Sloc /= Right.Rel_Sloc then return False; else -- we use just the same approach as for comparing Elements C_Left := Left.Enclosing_Context; U_Left := Left.Enclosing_Unit; C_Right := Right.Enclosing_Context; U_Right := Right.Enclosing_Unit; return Time_Stamp (C_Left, U_Left) = Time_Stamp (C_Right, U_Right); end if; exception when ASIS_Inappropriate_Line => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Is_Equal"); end if; raise; when Ex : others => -- Note, that in case of failure the very primitive diagnosis will be -- generated. If the implementation of this query become more -- sophisticated, we'll probably need two Line parameters for -- Report_ASIS_Bug procedure Report_ASIS_Bug (Query_Name => "Asis.Text.Is_Equal", Ex => Ex); end Is_Equal; ------------------ -- Is_Identical -- ------------------ function Is_Identical (Left : Asis.Text.Line; Right : Asis.Text.Line) return Boolean is begin Check_Validity (Left, "Asis.Text.Is_Identical"); Check_Validity (Right, "Asis.Text.Is_Identical"); return (Left.Length = Right.Length and then Left.Rel_Sloc = Right.Rel_Sloc and then Left.Enclosing_Context = Right.Enclosing_Context and then Left.Enclosing_Unit = Right.Enclosing_Unit); end Is_Identical; ------------ -- Is_Nil -- ------------ function Is_Nil (Right : Asis.Text.Line) return Boolean is Result : Boolean; begin -- Here we have to simulate the predefined "=" operation for -- Line as if it is called as 'Right + Nil_Line' Result := Right.Sloc = No_Location and then Right.Length = 0 and then Right.Rel_Sloc = No_Location and then Right.Enclosing_Unit = Nil_Unit and then Right.Enclosing_Context = Non_Associated and then Right.Enclosing_Tree = Nil_Tree and then Right.Obtained = Nil_ASIS_OS_Time; return Result; end Is_Nil; function Is_Nil (Right : Asis.Text.Line_List) return Boolean is begin return Right'Length = 0; end Is_Nil; function Is_Nil (Right : Asis.Text.Span) return Boolean is begin return (Right.Last_Line < Right.First_Line) or else ((Right.Last_Line = Right.First_Line) and then (Right.Last_Column < Right.First_Column)); end Is_Nil; ----------------------- -- Is_Text_Available -- ----------------------- function Is_Text_Available (Element : Asis.Element) return Boolean is El_Kind : constant Internal_Element_Kinds := Int_Kind (Element); Spec_Case : constant Special_Cases := Special_Case (Element); begin Check_Validity (Element, "Asis.Text.Is_Text_Available"); if El_Kind = Not_An_Element or else Is_From_Implicit (Element) or else Is_From_Instance (Element) or else Normalization_Case (Element) /= Is_Not_Normalized or else Spec_Case in Explicit_From_Standard .. Stand_Char_Literal then return False; else return True; end if; end Is_Text_Available; ---------------------- -- Last_Line_Number -- ---------------------- function Last_Line_Number (Element : Asis.Element) return Asis.Text.Line_Number is Sp : Asis.Text.Span; begin Check_Validity (Element, "Asis.Text.Last_Line_Number"); if Is_Text_Available (Element) then Sp := Element_Span (Element); return Sp.Last_Line; else return 0; end if; exception when ASIS_Inappropriate_Element => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Last_Line_Number", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Last_Line_Number", Arg_Element => Element, Ex => Ex); end Last_Line_Number; ------------ -- Length -- ------------ function Length (The_Line : Asis.Text.Line) return Asis.Text.Character_Position is begin Check_Validity (The_Line, "Asis.Text.Length"); return Line_Length (The_Line); end Length; ---------------- -- Line_Image -- ---------------- function Line_Image (The_Line : Asis.Text.Line) return Wide_String is begin Check_Validity (The_Line, "Asis.Text.Line_Image"); if Line_Length (The_Line) = 0 then return ""; end if; declare ASIS_Line_Start : constant Source_Ptr := Line_Location (The_Line); S : Source_Ptr := Line_Start (ASIS_Line_Start); Space_Len : constant Natural := Natural (ASIS_Line_Start - S); Space_String : Wide_String (1 .. Space_Len); -- We cannot have more padding white spaces then Space_Len Space_Num : Natural := 0; -- Counter for padding spaces Sindex : constant Source_File_Index := Get_Source_File_Index (S); Src : constant Source_Buffer_Ptr := Source_Text (Sindex); Line_Wide_Img : constant Wide_String := Line_Wide_Image (The_Line); begin -- first, padding the beginning of the image if needed: while S < ASIS_Line_Start loop Space_Num := Space_Num + 1; if Get_Character (S) = ASCII.HT then Space_String (Space_Num) := To_Wide_Character (ASCII.HT); S := S + 1; elsif Is_Start_Of_Wide_Char_For_ASIS (Src, S) then Skip_Wide_For_ASIS (Src, S); Space_String (Space_Num) := ' '; else Space_String (Space_Num) := ' '; S := S + 1; end if; end loop; return Space_String (1 .. Space_Num) & Line_Wide_Img; end; exception when ASIS_Inappropriate_Line => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Line_Image"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Line_Image", Arg_Line => The_Line, Ex => Ex); end Line_Image; --------------------- -- Lines (Element) -- --------------------- function Lines (Element : Asis.Element) return Asis.Text.Line_List is begin Check_Validity (Element, "Asis.Text.Lines (Element)"); if not Is_Text_Available (Element) then return Nil_Line_List; end if; return Lines (Element, Element_Span (Element)); exception when ASIS_Inappropriate_Element => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Lines (Element)", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Lines (Element)", Arg_Element => Element, Ex => Ex); end Lines; --------------------------- -- Lines (Element, Span) -- --------------------------- function Lines (Element : Asis.Element; The_Span : Asis.Text.Span) return Asis.Text.Line_List is begin Check_Validity (Element, "Asis.Text.Lines (Element, Span)"); if not Is_Text_Available (Element) then return Nil_Line_List; end if; if Is_Nil (The_Span) or else The_Span.Last_Line > Line_Number (Number_Of_Lines (Element)) then Raise_ASIS_Inappropriate_Line_Number ("Lines (Element, Span)"); end if; declare LList : Asis.Text.Line_List := Lines (Element, The_Span.First_Line, The_Span.Last_Line); -- this call to Lines is "tree-swapping-safe"; -- note also, that this call to Lines should not raise -- any exception, because all the checks are already done First_Line : constant Line_Number := LList'First; Last_Line : constant Line_Number := LList'Last; First_Line_Sloc : Source_Ptr := Line_Location (LList (First_Line)); -- Needs adjustment if The_Span does does not start from the first -- column. Count : Character_Position; Sindex : constant Source_File_Index := Get_Source_File_Index (First_Line_Sloc); Src : constant Source_Buffer_Ptr := Source_Text (Sindex); begin -- and now we have to adjust the first and the last line in LList: -- for the first line both the line location and the line length -- should be adjusted, for the last line - the line length only; -- the case when there is only one line is special: if The_Span.First_Column > 1 then Count := The_Span.First_Column - 1; while Count > 0 loop if Is_Start_Of_Wide_Char_For_ASIS (Src, First_Line_Sloc) then Skip_Wide_For_ASIS (Src, First_Line_Sloc); else First_Line_Sloc := First_Line_Sloc + 1; end if; Count := Count - 1; end loop; Set_Line_Location (L => LList (First_Line), S => First_Line_Sloc); end if; if First_Line = Last_Line then -- Special case when there is only one line. Set_Line_Length (L => LList (First_Line), N => The_Span.Last_Column - The_Span.First_Column + 1); else Set_Line_Length (L => LList (First_Line), N => Line_Length (LList (First_Line)) - The_Span.First_Column + 1); Set_Line_Length (L => LList (Last_Line), N => The_Span.Last_Column); end if; return LList; end; exception when ASIS_Inappropriate_Element | ASIS_Inappropriate_Line_Number => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Lines (Element, Asis.Text.Span)", Argument => Element); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Lines (Element, Asis.Text.Span)", Arg_Element => Element, Arg_Span => The_Span, Ex => Ex); end Lines; -------------------------------------------- -- Lines (Element, First_Line, Last_Line) -- -------------------------------------------- function Lines (Element : Asis.Element; First_Line : Line_Number_Positive; Last_Line : Line_Number) return Asis.Text.Line_List is Result_List : Line_List (First_Line .. Last_Line); -- there is no harm to define result list here, because the -- real work with it will be started when all the tests are passed. begin Check_Validity (Element, "Asis.Text.Lines (Element, First_Line, Last_Line)"); if Is_Nil (Element) then return Nil_Line_List; end if; if First_Line > Last_Line or else -- ??? Last_Line > Line_Number (Number_Of_Lines (Element)) then Raise_ASIS_Inappropriate_Line_Number ("Asis.Text.Lines (Element, First_Line, Last_Line)"); end if; -- if we are here, we have Result_List consisting of Nil_Lines, -- and we know, that all the conditions for returning the -- proper Line_List are met. So we have to make proper settings -- for the fields of all the Lines from Result_List Set_Lines (Result_List, Element); -- this is "tree-swapping-safe" return Result_List; exception when ASIS_Inappropriate_Element | ASIS_Inappropriate_Line_Number => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Lines (Asis.Element, First_Line, Last_Line)", Argument => Element); end if; raise; when Ex : others => -- We construct the fake Span value to pass the line numbers into -- the diagnosis Report_ASIS_Bug (Query_Name => "Asis.Text.Lines (Asis.Element, First_Line, Last_Line)", Arg_Element => Element, Arg_Span => (First_Line => First_Line, First_Column => 1, Last_Line => Last_Line, Last_Column => Character_Position'Last), Ex => Ex); end Lines; ----------------------- -- Non_Comment_Image -- ----------------------- function Non_Comment_Image (The_Line : Asis.Text.Line) return Wide_String is begin Check_Validity (The_Line, "Asis.Text.Non_Comment_Image"); if The_Line.Length = 0 then -- just a small optimization return ""; end if; declare The_Line_Image : constant Wide_String := Line_Image (The_Line); Comment_Pos : constant Source_Ptr := Comment_Beginning (Text_Buffer (To_String (The_Line_Image))); begin if Comment_Pos = No_Location then -- no comment in this Line return The_Line_Image; else return The_Line_Image (The_Line_Image'First .. Natural (Comment_Pos) - 1); end if; end; exception when ASIS_Inappropriate_Line => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => "Asis.Text.Non_Comment_Image"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => "Asis.Text.Non_Comment_Image", Arg_Line => The_Line, Ex => Ex); end Non_Comment_Image; end Asis.Text;

32.13377

79

0.536433

504743e3272909cc80a79c4ecbb7156cd80e5986

2,221

adb

Ada

unit_tests/colour_test_cases.adb

mosteo/sdlada

429c594de613c5ba2f0d7c59f8708956697e14f1

[ "Zlib" ]

89

2015-01-03T01:41:23.000Z

2022-02-23T18:21:11.000Z

unit_tests/colour_test_cases.adb

mosteo/sdlada

429c594de613c5ba2f0d7c59f8708956697e14f1

[ "Zlib" ]

66

2015-05-01T00:54:03.000Z

2022-01-20T04:09:59.000Z

unit_tests/colour_test_cases.adb

Jellix/sdlada

997d2ae2da5c75e2ea99cee98372cf5b752519cf

[ "Zlib" ]

33

2015-04-30T23:39:31.000Z

2022-01-03T13:00:41.000Z

-------------------------------------------------------------------------------------------------------------------- -- Copyright (c) 2013-2020, Luke A. Guest -- -- 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. -------------------------------------------------------------------------------------------------------------------- -- Colour_Test_Cases -------------------------------------------------------------------------------------------------------------------- with AUnit.Assertions; use AUnit.Assertions; package body Colour_Test_Cases is overriding function Name (Test : Colour_Test_Case) return Message_String is pragma Unreferenced (Test); -- TODO: Fix me! begin return Format ("Colour test"); end Name; overriding procedure Run_Test (Test : in out Colour_Test_Case) is pragma Unreferenced (Test); -- TODO: Fix me! use type SDL.Video.Palettes.Colour_Component; Colour : constant SDL.Video.Palettes.Colour := (Red => 16#FF#, Green => 16#DD#, Blue => 16#AA#, Alpha => 16#88#); begin Assert (Colour.Red = C_Test.Red, "Red values do not match"); Assert (Colour.Green = C_Test.Green, "Green values do not match"); Assert (Colour.Blue = C_Test.Blue, "Blue values do not match"); Assert (Colour.Alpha = C_Test.Alpha, "Alpha values do not match"); end Run_Test; end Colour_Test_Cases;

45.326531

119

0.589374

31efdd7ea1d95094b49c9ada57b6a88807012c26

8,345

adb

Ada

tools-src/gnu/gcc/gcc/ada/5wmemory.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/5wmemory.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/5wmemory.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . M E M O R Y -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 2001 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 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 was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This version provides ways to limit the amount of used memory for systems -- that do not have OS support for that. -- The amount of available memory available for dynamic allocation is limited -- by setting the environment variable GNAT_MEMORY_LIMIT to the number of -- kilobytes that can be used. -- -- Windows is currently using this version. with Ada.Exceptions; with System.Soft_Links; package body System.Memory is use Ada.Exceptions; use System.Soft_Links; function c_malloc (Size : size_t) return System.Address; pragma Import (C, c_malloc, "malloc"); procedure c_free (Ptr : System.Address); pragma Import (C, c_free, "free"); function c_realloc (Ptr : System.Address; Size : size_t) return System.Address; pragma Import (C, c_realloc, "realloc"); function msize (Ptr : System.Address) return size_t; pragma Import (C, msize, "_msize"); function getenv (Str : String) return System.Address; pragma Import (C, getenv); function atoi (Str : System.Address) return Integer; pragma Import (C, atoi); Available_Memory : size_t := 0; -- Amount of memory that is available for heap allocations. -- A value of 0 means that the amount is not yet initialized. Msize_Accuracy : constant := 4096; -- Defines the amount of memory to add to requested allocation sizes, -- because malloc may return a bigger block than requested. As msize -- is used when by Free, it must be used on allocation as well. To -- prevent underflow of available_memory we need to use a reserve. procedure Check_Available_Memory (Size : size_t); -- This routine must be called while holding the task lock. When the -- memory limit is not yet initialized, it will be set to the value of -- the GNAT_MEMORY_LIMIT environment variable or to unlimited if that -- does not exist. If the size is larger than the amount of available -- memory, the task lock will be freed and a storage_error exception -- will be raised. ----------- -- Alloc -- ----------- function Alloc (Size : size_t) return System.Address is Result : System.Address; Actual_Size : size_t := Size; begin if Size = size_t'Last then Raise_Exception (Storage_Error'Identity, "object too large"); end if; -- Change size from zero to non-zero. We still want a proper pointer -- for the zero case because pointers to zero length objects have to -- be distinct, but we can't just go ahead and allocate zero bytes, -- since some malloc's return zero for a zero argument. if Size = 0 then Actual_Size := 1; end if; Lock_Task.all; if Actual_Size + Msize_Accuracy >= Available_Memory then Check_Available_Memory (Size + Msize_Accuracy); end if; Result := c_malloc (Actual_Size); if Result /= System.Null_Address then Available_Memory := Available_Memory - msize (Result); end if; Unlock_Task.all; if Result = System.Null_Address then Raise_Exception (Storage_Error'Identity, "heap exhausted"); end if; return Result; end Alloc; ---------------------------- -- Check_Available_Memory -- ---------------------------- procedure Check_Available_Memory (Size : size_t) is Gnat_Memory_Limit : System.Address; begin if Available_Memory = 0 then -- The amount of available memory hasn't been initialized yet Gnat_Memory_Limit := getenv ("GNAT_MEMORY_LIMIT" & ASCII.NUL); if Gnat_Memory_Limit /= System.Null_Address then Available_Memory := size_t (atoi (Gnat_Memory_Limit)) * 1024 + Msize_Accuracy; else Available_Memory := size_t'Last; end if; end if; if Size >= Available_Memory then -- There is a memory overflow Unlock_Task.all; Raise_Exception (Storage_Error'Identity, "heap memory limit exceeded"); end if; end Check_Available_Memory; ---------- -- Free -- ---------- procedure Free (Ptr : System.Address) is begin Lock_Task.all; if Ptr /= System.Null_Address then Available_Memory := Available_Memory + msize (Ptr); end if; c_free (Ptr); Unlock_Task.all; end Free; ------------- -- Realloc -- ------------- function Realloc (Ptr : System.Address; Size : size_t) return System.Address is Result : System.Address; Actual_Size : size_t := Size; Old_Size : size_t; begin if Size = size_t'Last then Raise_Exception (Storage_Error'Identity, "object too large"); end if; Lock_Task.all; Old_Size := msize (Ptr); -- Conservative check - no need to try to be precise here if Size + Msize_Accuracy >= Available_Memory then Check_Available_Memory (Size + Msize_Accuracy); end if; Result := c_realloc (Ptr, Actual_Size); if Result /= System.Null_Address then Available_Memory := Available_Memory + Old_Size - msize (Ptr); end if; Unlock_Task.all; if Result = System.Null_Address then Raise_Exception (Storage_Error'Identity, "heap exhausted"); end if; return Result; end Realloc; end System.Memory;

36.282609

78

0.55686

1d073e5da5ee6a5b7de6934c73b3172457b0320d

232,754

adb

Ada

boards/ip_colordetect/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_s.adb

Kgfu/PYNQ_HelloWorld

a5197130e7d4a5e7f382c3963349c1c0bd213213

[ "BSD-3-Clause" ]

null

boards/ip_colordetect/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_s.adb

Kgfu/PYNQ_HelloWorld

a5197130e7d4a5e7f382c3963349c1c0bd213213

[ "BSD-3-Clause" ]

null

boards/ip_colordetect/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_s.adb

Kgfu/PYNQ_HelloWorld

a5197130e7d4a5e7f382c3963349c1c0bd213213

[ "BSD-3-Clause" ]

null

<?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/> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>colorthresholding_9_0_3_2160_3840_1_s</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>6</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>rgb2hsv_4100</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName>FIFO_SRL</coreName> <coreId>3580080480</coreId> </Obj> <bitwidth>24</bitwidth> </Value> <direction>0</direction> <if_type>3</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>imgHelper1_4101</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName>FIFO_SRL</coreName> <coreId>1769566319</coreId> </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> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>low_thresh</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName>RAM_1P</coreName> <coreId>892418672</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>9</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>high_thresh</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName>RAM_1P</coreName> <coreId>1702127986</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>9</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>5</id> <name>p_src_mat_rows</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName>FIFO_SRL</coreName> <coreId>1295661686</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>3</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="_6"> <Value> <Obj> <type>1</type> <id>6</id> <name>p_src_mat_cols</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName>FIFO_SRL</coreName> <coreId>741422136</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</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>27</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_7"> <Value> <Obj> <type>0</type> <id>9</id> <name>p_src_mat_cols_c_i</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>p_src_mat_cols_c_i_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </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> <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="_8"> <Value> <Obj> <type>0</type> <id>10</id> <name>p_src_mat_rows_c_i</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>p_src_mat_rows_c_i_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </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> <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="_9"> <Value> <Obj> <type>0</type> <id>26</id> <name>_ln0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>colorthresholding_9_0_3_2160_3840_1_entry29_U0</rtlName> <control/> <opType/> <implIndex/> <coreName/> <coreId>1013801317</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>56</item> <item>57</item> <item>58</item> <item>59</item> <item>60</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.00</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>27</id> <name>call_ret</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0</rtlName> <control/> <opType/> <implIndex/> <coreName/> <coreId>1868705636</coreId> </Obj> <bitwidth>144</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>62</item> <item>63</item> <item>64</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.00</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>28</id> <name>low_th_0_0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[0][0]</originalName> <rtlName>low_th_0_0_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>65</item> </oprand_edges> <opcode>extractvalue</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="_12"> <Value> <Obj> <type>0</type> <id>29</id> <name>low_th_0_1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[0][1]</originalName> <rtlName>low_th_0_1_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>66</item> </oprand_edges> <opcode>extractvalue</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>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>30</id> <name>low_th_0_2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[0][2]</originalName> <rtlName>low_th_0_2_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>67</item> </oprand_edges> <opcode>extractvalue</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>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>31</id> <name>high_th_0_0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[0][0]</originalName> <rtlName>high_th_0_0_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>68</item> </oprand_edges> <opcode>extractvalue</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="_15"> <Value> <Obj> <type>0</type> <id>32</id> <name>high_th_0_1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[0][1]</originalName> <rtlName>high_th_0_1_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>69</item> </oprand_edges> <opcode>extractvalue</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>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>33</id> <name>high_th_0_2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[0][2]</originalName> <rtlName>high_th_0_2_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>70</item> </oprand_edges> <opcode>extractvalue</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>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>34</id> <name>low_th_1_0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[1][0]</originalName> <rtlName>low_th_1_0_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>71</item> </oprand_edges> <opcode>extractvalue</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="_18"> <Value> <Obj> <type>0</type> <id>35</id> <name>low_th_1_1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[1][1]</originalName> <rtlName>low_th_1_1_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>72</item> </oprand_edges> <opcode>extractvalue</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="_19"> <Value> <Obj> <type>0</type> <id>36</id> <name>low_th_1_2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[1][2]</originalName> <rtlName>low_th_1_2_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>73</item> </oprand_edges> <opcode>extractvalue</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="_20"> <Value> <Obj> <type>0</type> <id>37</id> <name>high_th_1_0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[1][0]</originalName> <rtlName>high_th_1_0_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>74</item> </oprand_edges> <opcode>extractvalue</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="_21"> <Value> <Obj> <type>0</type> <id>38</id> <name>high_th_1_1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[1][1]</originalName> <rtlName>high_th_1_1_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>75</item> </oprand_edges> <opcode>extractvalue</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>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>39</id> <name>high_th_1_2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[1][2]</originalName> <rtlName>high_th_1_2_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>76</item> </oprand_edges> <opcode>extractvalue</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>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>40</id> <name>low_th_2_0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[2][0]</originalName> <rtlName>low_th_2_0_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>77</item> </oprand_edges> <opcode>extractvalue</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="_24"> <Value> <Obj> <type>0</type> <id>41</id> <name>low_th_2_1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[2][1]</originalName> <rtlName>low_th_2_1_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>78</item> </oprand_edges> <opcode>extractvalue</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>18</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>42</id> <name>low_th_2_2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>low_th[2][2]</originalName> <rtlName>low_th_2_2_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>79</item> </oprand_edges> <opcode>extractvalue</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>19</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>43</id> <name>high_th_2_0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[2][0]</originalName> <rtlName>high_th_2_0_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>80</item> </oprand_edges> <opcode>extractvalue</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>20</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>44</id> <name>high_th_2_1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[2][1]</originalName> <rtlName>high_th_2_1_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>81</item> </oprand_edges> <opcode>extractvalue</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>21</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>45</id> <name>high_th_2_2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>high_th[2][2]</originalName> <rtlName>high_th_2_2_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>82</item> </oprand_edges> <opcode>extractvalue</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="_29"> <Value> <Obj> <type>0</type> <id>46</id> <name>call_ret1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_U0</rtlName> <control/> <opType/> <implIndex/> <coreName/> <coreId>645164649</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>84</item> <item>85</item> <item>86</item> <item>374</item> <item>375</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.00</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>47</id> <name>img_height_loc_i_channel</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>img_height_loc_i_channel_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>87</item> </oprand_edges> <opcode>extractvalue</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="_31"> <Value> <Obj> <type>0</type> <id>48</id> <name>img_width_loc_i_channel</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>img_width_loc_i_channel_U</rtlName> <control>auto</control> <opType>fifo</opType> <implIndex>srl</implIndex> <coreName>FIFO_SRL</coreName> <coreId>81</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>88</item> </oprand_edges> <opcode>extractvalue</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>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>49</id> <name>_ln155</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>155</lineNumber> <contextFuncName>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</contextFuncName> <contextNormFuncName>colorthresholding_9_0_3_2160_3840_1_s</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</first> <second>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</second> </first> <second>155</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>xFInRange_9_0_2160_3840_15_0_1_9_1_3_U0</rtlName> <control/> <opType/> <implIndex/> <coreName/> <coreId>1936683105</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>23</count> <item_version>0</item_version> <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>99</item> <item>100</item> <item>101</item> <item>102</item> <item>103</item> <item>104</item> <item>105</item> <item>106</item> <item>107</item> <item>108</item> <item>109</item> <item>110</item> <item>111</item> <item>112</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>1.82</m_delay> <m_topoIndex>26</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>50</id> <name>_ln0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName/> <coreId>2037148777</coreId> </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>27</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_34"> <Value> <Obj> <type>2</type> <id>52</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName/> <coreId>574452846</coreId> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_35"> <Value> <Obj> <type>2</type> <id>55</id> <name>colorthresholding_9_0_3_2160_3840_1_entry29</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName/> <coreId>976974951</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <const_type>6</const_type> <content><constant:colorthresholding<9, 0, 3, 2160, 3840, 1>.entry29></content> </item> <item class_id_reference="16" object_id="_36"> <Value> <Obj> <type>2</type> <id>61</id> <name>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName/> <coreId>1852270963</coreId> </Obj> <bitwidth>144</bitwidth> </Value> <const_type>6</const_type> <content><constant:colorthresholding<9, 0, 3, 2160, 3840, 1>_Loop_VITIS_LOOP_138_1_proc></content> </item> <item class_id_reference="16" object_id="_37"> <Value> <Obj> <type>2</type> <id>83</id> <name>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName/> <coreId>673215073</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>6</const_type> <content><constant:colorthresholding<9, 0, 3, 2160, 3840, 1>_Block_colorthresholding<9, 0, 3, 2160, 3840, 1>_.exit_proc></content> </item> <item class_id_reference="16" object_id="_38"> <Value> <Obj> <type>2</type> <id>89</id> <name>xFInRange_9_0_2160_3840_15_0_1_9_1_3_s</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName/> <coreId>539119430</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <const_type>6</const_type> <content><constant:xFInRange<9, 0, 2160, 3840, 15, 0, 1, 9, 1, 3>></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="_39"> <Obj> <type>3</type> <id>51</id> <name>colorthresholding<9, 0, 3, 2160, 3840, 1></name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <contextNormFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <control/> <opType/> <implIndex/> <coreName/> <coreId>1768189039</coreId> </Obj> <node_objs> <count>27</count> <item_version>0</item_version> <item>9</item> <item>10</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> <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> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>58</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_40"> <id>53</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_41"> <id>54</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>10</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_42"> <id>56</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_43"> <id>57</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_44"> <id>58</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_45"> <id>59</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_46"> <id>60</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_47"> <id>62</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_48"> <id>63</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_49"> <id>64</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_50"> <id>65</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_51"> <id>66</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_52"> <id>67</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_53"> <id>68</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_54"> <id>69</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_55"> <id>70</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_56"> <id>71</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_57"> <id>72</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_58"> <id>73</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_59"> <id>74</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_60"> <id>75</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_61"> <id>76</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_62"> <id>77</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_63"> <id>78</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_64"> <id>79</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_65"> <id>80</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_66"> <id>81</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_67"> <id>82</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_68"> <id>84</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_69"> <id>85</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_70"> <id>86</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_71"> <id>87</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="_72"> <id>88</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_73"> <id>90</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_74"> <id>91</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_75"> <id>92</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_76"> <id>93</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_77"> <id>94</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_78"> <id>95</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_79"> <id>96</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_80"> <id>97</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_81"> <id>98</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_82"> <id>99</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_83"> <id>100</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_84"> <id>101</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_85"> <id>102</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_86"> <id>103</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_87"> <id>104</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_88"> <id>105</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_89"> <id>106</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_90"> <id>107</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_91"> <id>108</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_92"> <id>109</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_93"> <id>110</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="_94"> <id>111</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_95"> <id>112</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_96"> <id>374</id> <edge_type>4</edge_type> <source_obj>26</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_97"> <id>375</id> <edge_type>4</edge_type> <source_obj>26</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </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="_98"> <mId>1</mId> <mTag>colorthresholding<9, 0, 3, 2160, 3840, 1></mTag> <mNormTag>colorthresholding_9_0_3_2160_3840_1_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>51</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>17</mMinLatency> <mMaxLatency>8294418</mMaxLatency> <mIsDfPipe>1</mIsDfPipe> <mDfPipe class_id="23" tracking_level="1" version="0" object_id="_99"> <port_list class_id="24" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="25" tracking_level="1" version="0" object_id="_100"> <name>rgb2hsv_4100</name> <dir>0</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </item> <item class_id_reference="25" object_id="_101"> <name>imgHelper1_4101</name> <dir>1</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </item> <item class_id_reference="25" object_id="_102"> <name>low_thresh</name> <dir>0</dir> <type>2</type> <need_hs>1</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </item> <item class_id_reference="25" object_id="_103"> <name>high_thresh</name> <dir>0</dir> <type>2</type> <need_hs>1</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </item> <item class_id_reference="25" object_id="_104"> <name>p_src_mat_rows</name> <dir>0</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </item> <item class_id_reference="25" object_id="_105"> <name>p_src_mat_cols</name> <dir>0</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </item> </port_list> <process_list class_id="27" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_106"> <type>0</type> <name>colorthresholding_9_0_3_2160_3840_1_entry29_U0</name> <ssdmobj_id>26</ssdmobj_id> <pins class_id="29" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_107"> <port class_id_reference="25" object_id="_108"> <name>p_src_mat_rows</name> <dir>0</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id_reference="25" object_id_reference="_104"/> <chan class_id="-1"/> </port> <inst class_id="31" tracking_level="1" version="0" object_id="_109"> <type>0</type> <name>colorthresholding_9_0_3_2160_3840_1_entry29_U0</name> <ssdmobj_id>26</ssdmobj_id> </inst> </item> <item class_id_reference="30" object_id="_110"> <port class_id_reference="25" object_id="_111"> <name>p_src_mat_cols</name> <dir>0</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id_reference="25" object_id_reference="_105"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_109"/> </item> </pins> <in_source_fork>1</in_source_fork> <in_sink_join>0</in_sink_join> <flag_in_gui>0</flag_in_gui> </item> <item class_id_reference="28" object_id="_112"> <type>0</type> <name>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0</name> <ssdmobj_id>27</ssdmobj_id> <pins> <count>2</count> <item_version>0</item_version> <item class_id_reference="30" object_id="_113"> <port class_id_reference="25" object_id="_114"> <name>low_thresh</name> <dir>0</dir> <type>2</type> <need_hs>1</need_hs> <top_port class_id_reference="25" object_id_reference="_102"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id="_115"> <type>0</type> <name>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0</name> <ssdmobj_id>27</ssdmobj_id> </inst> </item> <item class_id_reference="30" object_id="_116"> <port class_id_reference="25" object_id="_117"> <name>high_thresh</name> <dir>0</dir> <type>2</type> <need_hs>1</need_hs> <top_port class_id_reference="25" object_id_reference="_103"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </item> </pins> <in_source_fork>1</in_source_fork> <in_sink_join>0</in_sink_join> <flag_in_gui>0</flag_in_gui> </item> <item class_id_reference="28" object_id="_118"> <type>0</type> <name>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_U0</name> <ssdmobj_id>46</ssdmobj_id> <pins> <count>0</count> <item_version>0</item_version> </pins> <in_source_fork>0</in_source_fork> <in_sink_join>0</in_sink_join> <flag_in_gui>0</flag_in_gui> </item> <item class_id_reference="28" object_id="_119"> <type>0</type> <name>xFInRange_9_0_2160_3840_15_0_1_9_1_3_U0</name> <ssdmobj_id>49</ssdmobj_id> <pins> <count>2</count> <item_version>0</item_version> <item class_id_reference="30" object_id="_120"> <port class_id_reference="25" object_id="_121"> <name>rgb2hsv_4100</name> <dir>0</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id_reference="25" object_id_reference="_100"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id="_122"> <type>0</type> <name>xFInRange_9_0_2160_3840_15_0_1_9_1_3_U0</name> <ssdmobj_id>49</ssdmobj_id> </inst> </item> <item class_id_reference="30" object_id="_123"> <port class_id_reference="25" object_id="_124"> <name>imgHelper1_4101</name> <dir>1</dir> <type>0</type> <need_hs>0</need_hs> <top_port class_id_reference="25" object_id_reference="_101"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </item> </pins> <in_source_fork>0</in_source_fork> <in_sink_join>1</in_sink_join> <flag_in_gui>1</flag_in_gui> </item> </process_list> <channel_list class_id="32" tracking_level="0" version="0"> <count>22</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_125"> <type>1</type> <name>p_src_mat_rows_c_i</name> <ssdmobj_id>10</ssdmobj_id> <ctype>0</ctype> <depth>2</depth> <bitwidth>16</bitwidth> <suggested_type>2</suggested_type> <suggested_depth>2</suggested_depth> <source class_id_reference="30" object_id="_126"> <port class_id_reference="25" object_id="_127"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_109"/> </source> <sink class_id_reference="30" object_id="_128"> <port class_id_reference="25" object_id="_129"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id="_130"> <type>0</type> <name>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_U0</name> <ssdmobj_id>46</ssdmobj_id> </inst> </sink> </item> <item class_id_reference="26" object_id="_131"> <type>1</type> <name>p_src_mat_cols_c_i</name> <ssdmobj_id>9</ssdmobj_id> <ctype>0</ctype> <depth>2</depth> <bitwidth>16</bitwidth> <suggested_type>2</suggested_type> <suggested_depth>2</suggested_depth> <source class_id_reference="30" object_id="_132"> <port class_id_reference="25" object_id="_133"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_109"/> </source> <sink class_id_reference="30" object_id="_134"> <port class_id_reference="25" object_id="_135"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_130"/> </sink> </item> <item class_id_reference="26" object_id="_136"> <type>1</type> <name>low_th_0_0</name> <ssdmobj_id>28</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_137"> <port class_id_reference="25" object_id="_138"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_139"> <port class_id_reference="25" object_id="_140"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_141"> <type>1</type> <name>low_th_0_1</name> <ssdmobj_id>29</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_142"> <port class_id_reference="25" object_id="_143"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_144"> <port class_id_reference="25" object_id="_145"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_146"> <type>1</type> <name>low_th_0_2</name> <ssdmobj_id>30</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_147"> <port class_id_reference="25" object_id="_148"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_149"> <port class_id_reference="25" object_id="_150"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_151"> <type>1</type> <name>high_th_0_0</name> <ssdmobj_id>31</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_152"> <port class_id_reference="25" object_id="_153"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_154"> <port class_id_reference="25" object_id="_155"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_156"> <type>1</type> <name>high_th_0_1</name> <ssdmobj_id>32</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_157"> <port class_id_reference="25" object_id="_158"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_159"> <port class_id_reference="25" object_id="_160"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_161"> <type>1</type> <name>high_th_0_2</name> <ssdmobj_id>33</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_162"> <port class_id_reference="25" object_id="_163"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_164"> <port class_id_reference="25" object_id="_165"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_166"> <type>1</type> <name>low_th_1_0</name> <ssdmobj_id>34</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_167"> <port class_id_reference="25" object_id="_168"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_169"> <port class_id_reference="25" object_id="_170"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_171"> <type>1</type> <name>low_th_1_1</name> <ssdmobj_id>35</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_172"> <port class_id_reference="25" object_id="_173"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_174"> <port class_id_reference="25" object_id="_175"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_176"> <type>1</type> <name>low_th_1_2</name> <ssdmobj_id>36</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_177"> <port class_id_reference="25" object_id="_178"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_179"> <port class_id_reference="25" object_id="_180"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_181"> <type>1</type> <name>high_th_1_0</name> <ssdmobj_id>37</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_182"> <port class_id_reference="25" object_id="_183"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_184"> <port class_id_reference="25" object_id="_185"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_186"> <type>1</type> <name>high_th_1_1</name> <ssdmobj_id>38</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_187"> <port class_id_reference="25" object_id="_188"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_189"> <port class_id_reference="25" object_id="_190"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_191"> <type>1</type> <name>high_th_1_2</name> <ssdmobj_id>39</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_192"> <port class_id_reference="25" object_id="_193"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_194"> <port class_id_reference="25" object_id="_195"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_196"> <type>1</type> <name>low_th_2_0</name> <ssdmobj_id>40</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_197"> <port class_id_reference="25" object_id="_198"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_199"> <port class_id_reference="25" object_id="_200"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_201"> <type>1</type> <name>low_th_2_1</name> <ssdmobj_id>41</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_202"> <port class_id_reference="25" object_id="_203"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_204"> <port class_id_reference="25" object_id="_205"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_206"> <type>1</type> <name>low_th_2_2</name> <ssdmobj_id>42</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_207"> <port class_id_reference="25" object_id="_208"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_209"> <port class_id_reference="25" object_id="_210"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_211"> <type>1</type> <name>high_th_2_0</name> <ssdmobj_id>43</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_212"> <port class_id_reference="25" object_id="_213"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_214"> <port class_id_reference="25" object_id="_215"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_216"> <type>1</type> <name>high_th_2_1</name> <ssdmobj_id>44</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_217"> <port class_id_reference="25" object_id="_218"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_219"> <port class_id_reference="25" object_id="_220"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_221"> <type>1</type> <name>high_th_2_2</name> <ssdmobj_id>45</ssdmobj_id> <ctype>0</ctype> <depth>3</depth> <bitwidth>8</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>3</suggested_depth> <source class_id_reference="30" object_id="_222"> <port class_id_reference="25" object_id="_223"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_115"/> </source> <sink class_id_reference="30" object_id="_224"> <port class_id_reference="25" object_id="_225"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_226"> <type>1</type> <name>img_height_loc_i_channel</name> <ssdmobj_id>47</ssdmobj_id> <ctype>0</ctype> <depth>2</depth> <bitwidth>16</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>2</suggested_depth> <source class_id_reference="30" object_id="_227"> <port class_id_reference="25" object_id="_228"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_130"/> </source> <sink class_id_reference="30" object_id="_229"> <port class_id_reference="25" object_id="_230"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </sink> </item> <item class_id_reference="26" object_id="_231"> <type>1</type> <name>img_width_loc_i_channel</name> <ssdmobj_id>48</ssdmobj_id> <ctype>0</ctype> <depth>2</depth> <bitwidth>16</bitwidth> <suggested_type>1</suggested_type> <suggested_depth>2</suggested_depth> <source class_id_reference="30" object_id="_232"> <port class_id_reference="25" object_id="_233"> <name>in</name> <dir>0</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_130"/> </source> <sink class_id_reference="30" object_id="_234"> <port class_id_reference="25" object_id="_235"> <name>out</name> <dir>1</dir> <type>3</type> <need_hs>0</need_hs> <top_port class_id="-1"/> <chan class_id="-1"/> </port> <inst class_id_reference="31" object_id_reference="_122"/> </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="_236"> <states class_id="35" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="36" tracking_level="1" version="0" object_id="_237"> <id>1</id> <operations class_id="37" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="38" tracking_level="1" version="0" object_id="_238"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_239"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_240"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_241"> <id>27</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="36" object_id="_242"> <id>2</id> <operations> <count>23</count> <item_version>0</item_version> <item class_id_reference="38" object_id="_243"> <id>27</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="38" object_id="_244"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_245"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_246"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_247"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_248"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_249"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_250"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_251"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_252"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_253"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_254"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_255"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_256"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_257"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_258"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_259"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_260"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_261"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_262"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_263"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_264"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_265"> <id>49</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="36" object_id="_266"> <id>3</id> <operations> <count>19</count> <item_version>0</item_version> <item class_id_reference="38" object_id="_267"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_268"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_269"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_270"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_271"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_272"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_273"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_274"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_275"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_276"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_277"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_278"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_279"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_280"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_281"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_282"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_283"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="38" object_id="_284"> <id>49</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="38" object_id="_285"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="39" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="40" tracking_level="1" version="0" object_id="_286"> <inState>1</inState> <outState>2</outState> <condition class_id="41" tracking_level="0" version="0"> <id>-1</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="_287"> <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> </transitions> </fsm> <res class_id="44" tracking_level="1" version="0" object_id="_288"> <dp_component_resource class_id="45" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="46" tracking_level="0" version="0"> <first>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_U0 (colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc)</first> <second class_id="47" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="48" tracking_level="0" version="0"> <first>FF</first> <second>34</second> </item> <item> <first>LUT</first> <second>46</second> </item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0 (colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc)</first> <second> <count>2</count> <item_version>0</item_version> <item> <first>FF</first> <second>168</second> </item> <item> <first>LUT</first> <second>136</second> </item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_entry29_U0 (colorthresholding_9_0_3_2160_3840_1_entry29)</first> <second> <count>2</count> <item_version>0</item_version> <item> <first>FF</first> <second>3</second> </item> <item> <first>LUT</first> <second>55</second> </item> </second> </item> <item> <first>start_for_colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2dEe_U (start_for_colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2dEe)</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>xFInRange_9_0_2160_3840_15_0_1_9_1_3_U0 (xFInRange_9_0_2160_3840_15_0_1_9_1_3_s)</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>DSP</first> <second>1</second> </item> <item> <first>FF</first> <second>79</second> </item> <item> <first>LUT</first> <second>262</second> </item> </second> </item> </dp_component_resource> <dp_expression_resource> <count>49</count> <item_version>0</item_version> <item> <first>ap_channel_done_high_th_0_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_0_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_0_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_1_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_1_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_1_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_2_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_2_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_high_th_2_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_img_height_loc_i_channel ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_img_width_loc_i_channel ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_0_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_0_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_0_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_1_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_1_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_1_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_2_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_2_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_channel_done_low_th_2_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_idle ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_0_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_0_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_0_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_1_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_1_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_1_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_2_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_2_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_high_th_2_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_img_height_loc_i_channel ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_img_width_loc_i_channel ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_0_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_0_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_0_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_1_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_1_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_1_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_2_0 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_2_1 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_channel_write_low_th_2_2 ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0_ap_ready ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_colorthresholding_9_0_3_2160_3840_1_entry29_U0_ap_ready ( 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>1</second> </item> </second> </item> <item> <first>ap_sync_ready ( 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>1</second> </item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_U0_ap_continue ( 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>1</second> </item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0_ap_continue ( 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>1</second> </item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0_ap_start ( 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>1</second> </item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_entry29_U0_ap_start ( 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>1</second> </item> </second> </item> <item> <first>xFInRange_9_0_2160_3840_15_0_1_9_1_3_U0_ap_start ( 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>1</second> </item> </second> </item> </dp_expression_resource> <dp_fifo_resource> <count>22</count> <item_version>0</item_version> <item> <first>high_th_0_0_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_0_1_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_0_2_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_1_0_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_1_1_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_1_2_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_2_0_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_2_1_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>high_th_2_2_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>img_height_loc_i_channel_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Size:D*B)</first> <second>32</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>img_width_loc_i_channel_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Size:D*B)</first> <second>32</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_0_0_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_0_1_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_0_2_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_1_0_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_1_1_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_1_2_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_2_0_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_2_1_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>low_th_2_2_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>8</second> </item> <item> <first>(2Size:D*B)</first> <second>24</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>p_src_mat_cols_c_i_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Size:D*B)</first> <second>32</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> <item> <first>p_src_mat_rows_c_i_U</first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0Depth)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Size:D*B)</first> <second>32</second> </item> <item> <first>FF</first> <second>99</second> </item> <item> <first>LUT</first> <second>68</second> </item> </second> </item> </dp_fifo_resource> <dp_memory_resource> <count>0</count> <item_version>0</item_version> </dp_memory_resource> <dp_multiplexer_resource> <count>22</count> <item_version>0</item_version> <item> <first>ap_sync_reg_channel_write_high_th_0_0</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_sync_reg_channel_write_high_th_0_1</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_sync_reg_channel_write_high_th_0_2</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_sync_reg_channel_write_high_th_1_0</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_sync_reg_channel_write_high_th_1_1</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_sync_reg_channel_write_high_th_1_2</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_sync_reg_channel_write_high_th_2_0</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_sync_reg_channel_write_high_th_2_1</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_sync_reg_channel_write_high_th_2_2</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_sync_reg_channel_write_img_height_loc_i_channel</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_sync_reg_channel_write_img_width_loc_i_channel</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_sync_reg_channel_write_low_th_0_0</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_sync_reg_channel_write_low_th_0_1</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_sync_reg_channel_write_low_th_0_2</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_sync_reg_channel_write_low_th_1_0</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_sync_reg_channel_write_low_th_1_1</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_sync_reg_channel_write_low_th_1_2</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_sync_reg_channel_write_low_th_2_0</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_sync_reg_channel_write_low_th_2_1</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_sync_reg_channel_write_low_th_2_2</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_sync_reg_colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0_ap_ready</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_sync_reg_colorthresholding_9_0_3_2160_3840_1_entry29_U0_ap_ready</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>22</count> <item_version>0</item_version> <item> <first>ap_sync_reg_channel_write_high_th_0_0</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_sync_reg_channel_write_high_th_0_1</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_sync_reg_channel_write_high_th_0_2</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_sync_reg_channel_write_high_th_1_0</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_sync_reg_channel_write_high_th_1_1</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_sync_reg_channel_write_high_th_1_2</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_sync_reg_channel_write_high_th_2_0</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_sync_reg_channel_write_high_th_2_1</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_sync_reg_channel_write_high_th_2_2</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_sync_reg_channel_write_img_height_loc_i_channel</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_sync_reg_channel_write_img_width_loc_i_channel</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_sync_reg_channel_write_low_th_0_0</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_sync_reg_channel_write_low_th_0_1</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_sync_reg_channel_write_low_th_0_2</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_sync_reg_channel_write_low_th_1_0</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_sync_reg_channel_write_low_th_1_1</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_sync_reg_channel_write_low_th_1_2</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_sync_reg_channel_write_low_th_2_0</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_sync_reg_channel_write_low_th_2_1</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_sync_reg_channel_write_low_th_2_2</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_sync_reg_colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0_ap_ready</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_sync_reg_colorthresholding_9_0_3_2160_3840_1_entry29_U0_ap_ready</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> </dp_register_resource> <dp_dsp_resource> <count>5</count> <item_version>0</item_version> <item> <first>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_U0</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_entry29_U0</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>start_for_colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2dEe_U</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>xFInRange_9_0_2160_3840_15_0_1_9_1_3_U0</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> </dp_dsp_resource> <dp_component_map class_id="49" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="50" tracking_level="0" version="0"> <first>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_U0 (colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc)</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_U0 (colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc)</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>colorthresholding_9_0_3_2160_3840_1_entry29_U0 (colorthresholding_9_0_3_2160_3840_1_entry29)</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>xFInRange_9_0_2160_3840_15_0_1_9_1_3_U0 (xFInRange_9_0_2160_3840_15_0_1_9_1_3_s)</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> </dp_component_map> <dp_expression_map> <count>0</count> <item_version>0</item_version> </dp_expression_map> <dp_fifo_map> <count>22</count> <item_version>0</item_version> <item> <first>high_th_0_0_U</first> <second> <count>1</count> <item_version>0</item_version> <item>369</item> </second> </item> <item> <first>high_th_0_1_U</first> <second> <count>1</count> <item_version>0</item_version> <item>379</item> </second> </item> <item> <first>high_th_0_2_U</first> <second> <count>1</count> <item_version>0</item_version> <item>389</item> </second> </item> <item> <first>high_th_1_0_U</first> <second> <count>1</count> <item_version>0</item_version> <item>429</item> </second> </item> <item> <first>high_th_1_1_U</first> <second> <count>1</count> <item_version>0</item_version> <item>439</item> </second> </item> <item> <first>high_th_1_2_U</first> <second> <count>1</count> <item_version>0</item_version> <item>449</item> </second> </item> <item> <first>high_th_2_0_U</first> <second> <count>1</count> <item_version>0</item_version> <item>489</item> </second> </item> <item> <first>high_th_2_1_U</first> <second> <count>1</count> <item_version>0</item_version> <item>499</item> </second> </item> <item> <first>high_th_2_2_U</first> <second> <count>1</count> <item_version>0</item_version> <item>509</item> </second> </item> <item> <first>img_height_loc_i_channel_U</first> <second> <count>1</count> <item_version>0</item_version> <item>519</item> </second> </item> <item> <first>img_width_loc_i_channel_U</first> <second> <count>1</count> <item_version>0</item_version> <item>529</item> </second> </item> <item> <first>low_th_0_0_U</first> <second> <count>1</count> <item_version>0</item_version> <item>340</item> </second> </item> <item> <first>low_th_0_1_U</first> <second> <count>1</count> <item_version>0</item_version> <item>349</item> </second> </item> <item> <first>low_th_0_2_U</first> <second> <count>1</count> <item_version>0</item_version> <item>359</item> </second> </item> <item> <first>low_th_1_0_U</first> <second> <count>1</count> <item_version>0</item_version> <item>399</item> </second> </item> <item> <first>low_th_1_1_U</first> <second> <count>1</count> <item_version>0</item_version> <item>409</item> </second> </item> <item> <first>low_th_1_2_U</first> <second> <count>1</count> <item_version>0</item_version> <item>419</item> </second> </item> <item> <first>low_th_2_0_U</first> <second> <count>1</count> <item_version>0</item_version> <item>459</item> </second> </item> <item> <first>low_th_2_1_U</first> <second> <count>1</count> <item_version>0</item_version> <item>469</item> </second> </item> <item> <first>low_th_2_2_U</first> <second> <count>1</count> <item_version>0</item_version> <item>479</item> </second> </item> <item> <first>p_src_mat_cols_c_i_U</first> <second> <count>1</count> <item_version>0</item_version> <item>329</item> </second> </item> <item> <first>p_src_mat_rows_c_i_U</first> <second> <count>1</count> <item_version>0</item_version> <item>319</item> </second> </item> </dp_fifo_map> <dp_memory_map> <count>0</count> <item_version>0</item_version> </dp_memory_map> </res> <node_label_latency class_id="51" tracking_level="0" version="0"> <count>27</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>9</first> <second class_id="53" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>10</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>1</second> </second> </item> <item> <first>28</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>50</first> <second> <first>2</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="54" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="55" tracking_level="0" version="0"> <first>51</first> <second class_id="56" tracking_level="0" version="0"> <first>0</first> <second>2</second> </second> </item> </bblk_ent_exit> <regions class_id="57" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="58" tracking_level="1" version="0" object_id="_289"> <region_name>colorthresholding<9, 0, 3, 2160, 3840, 1></region_name> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>51</item> </basic_blocks> <nodes> <count>44</count> <item_version>0</item_version> <item>7</item> <item>8</item> <item>9</item> <item>10</item> <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> <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> </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="59" tracking_level="0" version="0"> <count>26</count> <item_version>0</item_version> <item class_id="60" tracking_level="0" version="0"> <first>60</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>64</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>68</first> <second> <count>2</count> <item_version>0</item_version> <item>49</item> <item>49</item> </second> </item> <item> <first>96</first> <second> <count>2</count> <item_version>0</item_version> <item>27</item> <item>27</item> </second> </item> <item> <first>104</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>114</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>120</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>125</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>130</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>135</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>140</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>145</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>150</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>155</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>160</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>165</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>170</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>175</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>180</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>185</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>190</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>195</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>200</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>205</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>210</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>215</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="62" tracking_level="0" version="0"> <count>22</count> <item_version>0</item_version> <item class_id="63" tracking_level="0" version="0"> <first>high_th_0_0_fu_135</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>high_th_0_1_fu_140</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>high_th_0_2_fu_145</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>high_th_1_0_fu_165</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>high_th_1_1_fu_170</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>high_th_1_2_fu_175</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>high_th_2_0_fu_195</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>high_th_2_1_fu_200</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>high_th_2_2_fu_205</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>img_height_loc_i_channel_fu_210</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>img_width_loc_i_channel_fu_215</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>low_th_0_0_fu_120</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>low_th_0_1_fu_125</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>low_th_0_2_fu_130</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>low_th_1_0_fu_150</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>low_th_1_1_fu_155</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>low_th_1_2_fu_160</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>low_th_2_0_fu_180</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>low_th_2_1_fu_185</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>low_th_2_2_fu_190</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>p_src_mat_cols_c_i_fu_60</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>p_src_mat_rows_c_i_fu_64</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>4</count> <item_version>0</item_version> <item> <first>call_ln0_colorthresholding_9_0_3_2160_3840_1_entry29_fu_104</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>call_ret1_colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc_fu_114</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>grp_colorthresholding_9_0_3_2160_3840_1_Loop_VITIS_LOOP_138_1_proc_fu_96</first> <second> <count>2</count> <item_version>0</item_version> <item>27</item> <item>27</item> </second> </item> <item> <first>grp_xFInRange_9_0_2160_3840_15_0_1_9_1_3_s_fu_68</first> <second> <count>2</count> <item_version>0</item_version> <item>49</item> <item>49</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="64" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>22</count> <item_version>0</item_version> <item> <first>220</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>226</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>232</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>237</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>242</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>247</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>252</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>257</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>262</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>267</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>272</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>277</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>282</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>287</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>292</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>297</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>302</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>307</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>312</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>317</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>322</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>327</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>22</count> <item_version>0</item_version> <item> <first>high_th_0_0_reg_247</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>high_th_0_1_reg_252</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>high_th_0_2_reg_257</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>high_th_1_0_reg_277</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>high_th_1_1_reg_282</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>high_th_1_2_reg_287</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>high_th_2_0_reg_307</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>high_th_2_1_reg_312</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>high_th_2_2_reg_317</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>img_height_loc_i_channel_reg_322</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>img_width_loc_i_channel_reg_327</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>low_th_0_0_reg_232</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>low_th_0_1_reg_237</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>low_th_0_2_reg_242</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>low_th_1_0_reg_262</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>low_th_1_1_reg_267</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>low_th_1_2_reg_272</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>low_th_2_0_reg_292</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>low_th_2_1_reg_297</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>low_th_2_2_reg_302</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>p_src_mat_cols_c_i_reg_220</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>p_src_mat_rows_c_i_reg_226</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> </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="65" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="66" tracking_level="0" version="0"> <first>imgHelper1_4101</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>call</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> </second> </item> <item> <first>p_src_mat_cols</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>call</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> </second> </item> <item> <first>p_src_mat_rows</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>call</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> </second> </item> <item> <first>rgb2hsv_4100</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>call</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core> <count>6</count> <item_version>0</item_version> <item> <first>1</first> <second> <first>1150</first> <second>10</second> </second> </item> <item> <first>2</first> <second> <first>1151</first> <second>10</second> </second> </item> <item> <first>3</first> <second> <first>666</first> <second>17</second> </second> </item> <item> <first>4</first> <second> <first>666</first> <second>17</second> </second> </item> <item> <first>5</first> <second> <first>1150</first> <second>10</second> </second> </item> <item> <first>6</first> <second> <first>1150</first> <second>10</second> </second> </item> </port2core> <node2core> <count>26</count> <item_version>0</item_version> <item> <first>9</first> <second> <first>1150</first> <second>10</second> </second> </item> <item> <first>10</first> <second> <first>1150</first> <second>10</second> </second> </item> <item> <first>26</first> <second> <first>-1</first> <second>-1</second> </second> </item> <item> <first>27</first> <second> <first>-1</first> <second>-1</second> </second> </item> <item> <first>28</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>29</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>30</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>31</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>32</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>33</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>34</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>35</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>36</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>37</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>38</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>39</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>40</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>41</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>42</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>43</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>44</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>45</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>46</first> <second> <first>-1</first> <second>-1</second> </second> </item> <item> <first>47</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>48</first> <second> <first>666</first> <second>10</second> </second> </item> <item> <first>49</first> <second> <first>-1</first> <second>-1</second> </second> </item> </node2core> </syndb> </boost_serialization>

30.922546

205

0.446025

317daf61ceeedeee92e0f82bf8728a6020eea45a

7,712

ads

Ada

arch/ARM/RP/svd/rp2040/rp_svd-xip_ctrl.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/RP/svd/rp2040/rp_svd-xip_ctrl.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/RP/svd/rp2040/rp_svd-xip_ctrl.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

-- Copyright (c) 2020 Raspberry Pi (Trading) Ltd. -- -- SPDX-License-Identifier: BSD-3-Clause -- This spec has been automatically generated from rp2040.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; -- QSPI flash execute-in-place block package RP_SVD.XIP_CTRL is pragma Preelaborate; --------------- -- Registers -- --------------- -- Cache control type CTRL_Register is record -- When 1, enable the cache. When the cache is disabled, all XIP -- accesses\n will go straight to the flash, without querying the cache. -- When enabled,\n cacheable XIP accesses will query the cache, and the -- flash will\n not be accessed if the tag matches and the valid bit is -- set.\n\n If the cache is enabled, cache-as-SRAM accesses have no -- effect on the\n cache data RAM, and will produce a bus error -- response. EN : Boolean := True; -- When 1, writes to any alias other than 0x0 (caching, allocating)\n -- will produce a bus fault. When 0, these writes are silently -- ignored.\n In either case, writes to the 0x0 alias will deallocate on -- tag match,\n as usual. ERR_BADWRITE : Boolean := True; -- unspecified Reserved_2_2 : HAL.Bit := 16#0#; -- When 1, the cache memories are powered down. They retain state,\n but -- can not be accessed. This reduces static power dissipation.\n Writing -- 1 to this bit forces CTRL_EN to 0, i.e. the cache cannot\n be enabled -- when powered down.\n Cache-as-SRAM accesses will produce a bus error -- response when\n the cache is powered down. POWER_DOWN : Boolean := False; -- unspecified Reserved_4_31 : HAL.UInt28 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CTRL_Register use record EN at 0 range 0 .. 0; ERR_BADWRITE at 0 range 1 .. 1; Reserved_2_2 at 0 range 2 .. 2; POWER_DOWN at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Cache Flush control type FLUSH_Register is record -- After a write operation all bits in the field are cleared (set to -- zero). Write 1 to flush the cache. This clears the tag memory, but\n -- the data memory retains its contents. (This means cache-as-SRAM\n -- contents is not affected by flush or reset.)\n Reading will hold the -- bus (stall the processor) until the flush\n completes. Alternatively -- STAT can be polled until completion. FLUSH : Boolean := False; -- unspecified Reserved_1_31 : HAL.UInt31 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for FLUSH_Register use record FLUSH at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; -- Cache Status type STAT_Register is record -- Read-only. Reads as 0 while a cache flush is in progress, and 1 -- otherwise.\n The cache is flushed whenever the XIP block is reset, -- and also\n when requested via the FLUSH register. FLUSH_READY : Boolean; -- Read-only. When 1, indicates the XIP streaming FIFO is completely -- empty. FIFO_EMPTY : Boolean; -- Read-only. When 1, indicates the XIP streaming FIFO is completely -- full.\n The streaming FIFO is 2 entries deep, so the full and empty\n -- flag allow its level to be ascertained. FIFO_FULL : Boolean; -- unspecified Reserved_3_31 : HAL.UInt29; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for STAT_Register use record FLUSH_READY at 0 range 0 .. 0; FIFO_EMPTY at 0 range 1 .. 1; FIFO_FULL at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; subtype STREAM_ADDR_STREAM_ADDR_Field is HAL.UInt30; -- FIFO stream address type STREAM_ADDR_Register is record -- unspecified Reserved_0_1 : HAL.UInt2 := 16#0#; -- The address of the next word to be streamed from flash to the -- streaming FIFO.\n Increments automatically after each flash access.\n -- Write the initial access address here before starting a streaming -- read. STREAM_ADDR : STREAM_ADDR_STREAM_ADDR_Field := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for STREAM_ADDR_Register use record Reserved_0_1 at 0 range 0 .. 1; STREAM_ADDR at 0 range 2 .. 31; end record; subtype STREAM_CTR_STREAM_CTR_Field is HAL.UInt22; -- FIFO stream control type STREAM_CTR_Register is record -- Write a nonzero value to start a streaming read. This will then\n -- progress in the background, using flash idle cycles to transfer\n a -- linear data block from flash to the streaming FIFO.\n Decrements -- automatically (1 at a time) as the stream\n progresses, and halts on -- reaching 0.\n Write 0 to halt an in-progress stream, and discard any -- in-flight\n read, so that a new stream can immediately be started -- (after\n draining the FIFO and reinitialising STREAM_ADDR) STREAM_CTR : STREAM_CTR_STREAM_CTR_Field := 16#0#; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for STREAM_CTR_Register use record STREAM_CTR at 0 range 0 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- QSPI flash execute-in-place block type XIP_CTRL_Peripheral is record -- Cache control CTRL : aliased CTRL_Register; -- Cache Flush control FLUSH : aliased FLUSH_Register; -- Cache Status STAT : aliased STAT_Register; -- Cache Hit counter\n A 32 bit saturating counter that increments upon -- each cache hit,\n i.e. when an XIP access is serviced directly from -- cached data.\n Write any value to clear. CTR_HIT : aliased HAL.UInt32; -- Cache Access counter\n A 32 bit saturating counter that increments -- upon each XIP access,\n whether the cache is hit or not. This -- includes noncacheable accesses.\n Write any value to clear. CTR_ACC : aliased HAL.UInt32; -- FIFO stream address STREAM_ADDR : aliased STREAM_ADDR_Register; -- FIFO stream control STREAM_CTR : aliased STREAM_CTR_Register; -- FIFO stream data\n Streamed data is buffered here, for retrieval by -- the system DMA.\n This FIFO can also be accessed via the XIP_AUX -- slave, to avoid exposing\n the DMA to bus stalls caused by other XIP -- traffic. STREAM_FIFO : aliased HAL.UInt32; end record with Volatile; for XIP_CTRL_Peripheral use record CTRL at 16#0# range 0 .. 31; FLUSH at 16#4# range 0 .. 31; STAT at 16#8# range 0 .. 31; CTR_HIT at 16#C# range 0 .. 31; CTR_ACC at 16#10# range 0 .. 31; STREAM_ADDR at 16#14# range 0 .. 31; STREAM_CTR at 16#18# range 0 .. 31; STREAM_FIFO at 16#1C# range 0 .. 31; end record; -- QSPI flash execute-in-place block XIP_CTRL_Periph : aliased XIP_CTRL_Peripheral with Import, Address => XIP_CTRL_Base; end RP_SVD.XIP_CTRL;

39.346939

79

0.642376

1d59069d11242d71840a8ed345fd52b2cc574d75

9,736

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/g-mbflra.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/g-mbflra.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/g-mbflra.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . M B B S _ F L O A T _ R A N D O M -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2010, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Calendar; package body GNAT.MBBS_Float_Random is ------------------------- -- Implementation Note -- ------------------------- -- The design of this spec is a bit awkward, as a result of Ada 95 not -- permitting in-out parameters for function formals (most naturally -- Generator values would be passed this way). In pure Ada 95, the only -- solution would be to add a self-referential component to the generator -- allowing access to the generator object from inside the function. This -- would work because the generator is limited, which prevents any copy. -- This is a bit heavy, so what we do is to use Unrestricted_Access to -- get a pointer to the state in the passed Generator. This works because -- Generator is a limited type and will thus always be passed by reference. package Calendar renames Ada.Calendar; type Pointer is access all State; ----------------------- -- Local Subprograms -- ----------------------- procedure Euclid (P, Q : Int; X, Y : out Int; GCD : out Int); function Euclid (P, Q : Int) return Int; function Square_Mod_N (X, N : Int) return Int; ------------ -- Euclid -- ------------ procedure Euclid (P, Q : Int; X, Y : out Int; GCD : out Int) is XT : Int := 1; YT : Int := 0; procedure Recur (P, Q : Int; -- a (i-1), a (i) X, Y : Int; -- x (i), y (i) XP, YP : in out Int; -- x (i-1), y (i-1) GCD : out Int); procedure Recur (P, Q : Int; X, Y : Int; XP, YP : in out Int; GCD : out Int) is Quo : Int := P / Q; -- q <-- |_ a (i-1) / a (i) _| XT : Int := X; -- x (i) YT : Int := Y; -- y (i) begin if P rem Q = 0 then -- while does not divide GCD := Q; XP := X; YP := Y; else Recur (Q, P - Q * Quo, XP - Quo * X, YP - Quo * Y, XT, YT, Quo); -- a (i) <== a (i) -- a (i+1) <-- a (i-1) - q*a (i) -- x (i+1) <-- x (i-1) - q*x (i) -- y (i+1) <-- y (i-1) - q*y (i) -- x (i) <== x (i) -- y (i) <== y (i) XP := XT; YP := YT; GCD := Quo; end if; end Recur; -- Start of processing for Euclid begin Recur (P, Q, 0, 1, XT, YT, GCD); X := XT; Y := YT; end Euclid; function Euclid (P, Q : Int) return Int is X, Y, GCD : Int; pragma Unreferenced (Y, GCD); begin Euclid (P, Q, X, Y, GCD); return X; end Euclid; ----------- -- Image -- ----------- function Image (Of_State : State) return String is begin return Int'Image (Of_State.X1) & ',' & Int'Image (Of_State.X2) & ',' & Int'Image (Of_State.P) & ',' & Int'Image (Of_State.Q); end Image; ------------ -- Random -- ------------ function Random (Gen : Generator) return Uniformly_Distributed is Genp : constant Pointer := Gen.Gen_State'Unrestricted_Access; begin Genp.X1 := Square_Mod_N (Genp.X1, Genp.P); Genp.X2 := Square_Mod_N (Genp.X2, Genp.Q); return Float ((Flt (((Genp.X2 - Genp.X1) * Genp.X) mod Genp.Q) * Flt (Genp.P) + Flt (Genp.X1)) * Genp.Scl); end Random; ----------- -- Reset -- ----------- -- Version that works from given initiator value procedure Reset (Gen : Generator; Initiator : Integer) is Genp : constant Pointer := Gen.Gen_State'Unrestricted_Access; X1, X2 : Int; begin X1 := 2 + Int (Initiator) mod (K1 - 3); X2 := 2 + Int (Initiator) mod (K2 - 3); -- Eliminate effects of small initiators for J in 1 .. 5 loop X1 := Square_Mod_N (X1, K1); X2 := Square_Mod_N (X2, K2); end loop; Genp.all := (X1 => X1, X2 => X2, P => K1, Q => K2, X => 1, Scl => Scal); end Reset; -- Version that works from specific saved state procedure Reset (Gen : Generator; From_State : State) is Genp : constant Pointer := Gen.Gen_State'Unrestricted_Access; begin Genp.all := From_State; end Reset; -- Version that works from calendar procedure Reset (Gen : Generator) is Genp : constant Pointer := Gen.Gen_State'Unrestricted_Access; Now : constant Calendar.Time := Calendar.Clock; X1, X2 : Int; begin X1 := Int (Calendar.Year (Now)) * 12 * 31 + Int (Calendar.Month (Now)) * 31 + Int (Calendar.Day (Now)); X2 := Int (Calendar.Seconds (Now) * Duration (1000.0)); X1 := 2 + X1 mod (K1 - 3); X2 := 2 + X2 mod (K2 - 3); -- Eliminate visible effects of same day starts for J in 1 .. 5 loop X1 := Square_Mod_N (X1, K1); X2 := Square_Mod_N (X2, K2); end loop; Genp.all := (X1 => X1, X2 => X2, P => K1, Q => K2, X => 1, Scl => Scal); end Reset; ---------- -- Save -- ---------- procedure Save (Gen : Generator; To_State : out State) is begin To_State := Gen.Gen_State; end Save; ------------------ -- Square_Mod_N -- ------------------ function Square_Mod_N (X, N : Int) return Int is Temp : constant Flt := Flt (X) * Flt (X); Div : Int; begin Div := Int (Temp / Flt (N)); Div := Int (Temp - Flt (Div) * Flt (N)); if Div < 0 then return Div + N; else return Div; end if; end Square_Mod_N; ----------- -- Value -- ----------- function Value (Coded_State : String) return State is Last : constant Natural := Coded_State'Last; Start : Positive := Coded_State'First; Stop : Positive := Coded_State'First; Outs : State; begin while Stop <= Last and then Coded_State (Stop) /= ',' loop Stop := Stop + 1; end loop; if Stop > Last then raise Constraint_Error; end if; Outs.X1 := Int'Value (Coded_State (Start .. Stop - 1)); Start := Stop + 1; loop Stop := Stop + 1; exit when Stop > Last or else Coded_State (Stop) = ','; end loop; if Stop > Last then raise Constraint_Error; end if; Outs.X2 := Int'Value (Coded_State (Start .. Stop - 1)); Start := Stop + 1; loop Stop := Stop + 1; exit when Stop > Last or else Coded_State (Stop) = ','; end loop; if Stop > Last then raise Constraint_Error; end if; Outs.P := Int'Value (Coded_State (Start .. Stop - 1)); Outs.Q := Int'Value (Coded_State (Stop + 1 .. Last)); Outs.X := Euclid (Outs.P, Outs.Q); Outs.Scl := 1.0 / (Flt (Outs.P) * Flt (Outs.Q)); -- Now do *some* sanity checks if Outs.Q < 31 or else Outs.P < 31 or else Outs.X1 not in 2 .. Outs.P - 1 or else Outs.X2 not in 2 .. Outs.Q - 1 then raise Constraint_Error; end if; return Outs; end Value; end GNAT.MBBS_Float_Random;

30.907937

79

0.455526

1d19531a6e3877d53aac4111734eb554dbdec2f3

2,011

ads

Ada

linear_algebra/hessenberg.ads

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

30

2018-12-09T01:15:04.000Z

2022-03-20T16:14:54.000Z

linear_algebra/hessenberg.ads

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

null

linear_algebra/hessenberg.ads

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

null

--------------------------------------------------------------------------- -- package Hessenberg -- Copyright (C) 2011-2018 Jonathan S. Parker -- -- 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. --------------------------------------------------------------------------- generic type Real is digits <>; type Index is range <>; type A_Matrix is array(Index, Index) of Real; package Hessenberg is subtype C_Index is Index; subtype R_Index is Index; function Identity return A_Matrix; -- The input matrix A is transformed with similarity transformations: -- -- A_hessenberg = Q_transpose * A * Q. -- -- The Q's are orthogonal matrices constructed from the products of -- 2 x 2 Givens matrices. -- Q matrix has the same shape as A. procedure Lower_Hessenberg (A : in out A_Matrix; Q : out A_Matrix; Starting_Col : in C_Index := C_Index'First; Final_Col : in C_Index := C_Index'Last; Initial_Q : in A_Matrix := Identity); procedure Upper_Hessenberg (A : in out A_Matrix; Q : out A_Matrix; Starting_Col : in C_Index := C_Index'First; Final_Col : in C_Index := C_Index'Last; Initial_Q : in A_Matrix := Identity); end Hessenberg;

35.910714

75

0.62357

a101d96ab9c5fc9caca27861ebc8679e113b4d3a

1,640

adb

Ada

src/keystore-passwords.adb

ALPHA-60/ada-keystore

46c27b830b5c37bb28ab2951f47a60a740e16b81

[ "Apache-2.0" ]

null

src/keystore-passwords.adb

ALPHA-60/ada-keystore

46c27b830b5c37bb28ab2951f47a60a740e16b81

[ "Apache-2.0" ]

null

src/keystore-passwords.adb

ALPHA-60/ada-keystore

46c27b830b5c37bb28ab2951f47a60a740e16b81

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- keystore-passwords -- Password provider -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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 body Keystore.Passwords is procedure To_Provider (Secret : in Secret_Key; Process : not null access procedure (P : in out Provider'Class)) is type Secret_Provider is new Provider with null record; overriding procedure Get_Password (From : in Secret_Provider; Getter : not null access procedure (Password : in Secret_Key)); overriding procedure Get_Password (From : in Secret_Provider; Getter : not null access procedure (Password : in Secret_Key)) is pragma Unreferenced (From); begin Getter (Secret); end Get_Password; P : Secret_Provider; begin Process (P); end To_Provider; end Keystore.Passwords;

38.139535

95

0.612805

1de0d5c8d2976b6608cc02aadc248e13d21caa7e

3,434

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/a-caldel.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/a-caldel.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/a-caldel.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- A D A . C A L E N D A R . D E L A Y S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2005, 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 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, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This package implements Calendar.Time delays using protected objects -- Note: the compiler generates direct calls to this interface, in the -- processing of time types. package Ada.Calendar.Delays is procedure Delay_For (D : Duration); -- Delay until an interval of length (at least) D seconds has passed, or -- the task is aborted to at least the current ATC nesting level. This is -- an abort completion point. The body of this procedure must perform all -- the processing required for an abort point. procedure Delay_Until (T : Time); -- Delay until Clock has reached (at least) time T, or the task is aborted -- to at least the current ATC nesting level. The body of this procedure -- must perform all the processing required for an abort point. function To_Duration (T : Time) return Duration; -- Convert Time to Duration end Ada.Calendar.Delays;

61.321429

78

0.496506

1d6c8782622c30ef8c7ec9a086ebcb31292396b2

8,858

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95087b.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95087b.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95087b.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C95087B.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 ASSIGNMENTS TO ENTRY FORMAL PARAMETERS OF UNCONSTRAINED -- RECORD, PRIVATE, AND LIMITED PRIVATE TYPES WITHOUT DEFAULT -- CONSTRAINTS RAISE CONSTRAINT_ERROR IF AN ATTEMPT IS MADE TO CHANGE -- THE CONSTRAINT OF THE ACTUAL PARAMETER. -- SUBTESTS ARE: -- (A) RECORD TYPE. -- (B) PRIVATE TYPE. -- (C) LIMITED PRIVATE TYPE. -- RJW 1/10/86 WITH REPORT; USE REPORT; PROCEDURE C95087B IS BEGIN TEST ( "C95087B", "CHECK ASSIGNMENT TO ENTRY FORMAL PARAMETERS " & "OF UNCONSTRAINED TYPE (WITH NO DEFAULT)" ); -------------------------------------------------- DECLARE -- (A) PACKAGE PKG IS TYPE RECTYPE (CONSTRAINT : INTEGER) IS RECORD INTFIELD : INTEGER; STRFIELD : STRING (1..CONSTRAINT); END RECORD; TASK T IS ENTRY E (REC9 : OUT RECTYPE; REC6 : IN OUT RECTYPE); END T; END PKG; REC9 : PKG.RECTYPE(IDENT_INT(9)) := (IDENT_INT(9), 9, "123456789"); REC6 : PKG.RECTYPE(IDENT_INT(6)) := (IDENT_INT(6), 5, "AEIOUY"); PACKAGE BODY PKG IS TASK BODY T IS REC4 : CONSTANT RECTYPE(IDENT_INT(4)) := (IDENT_INT(4), 4, "OOPS"); BEGIN ACCEPT E (REC9 : OUT RECTYPE; REC6 : IN OUT RECTYPE) DO BEGIN -- (A.1) REC9 := REC6; FAILED ("CONSTRAINT_ERROR NOT RAISED " & "- A.1"); EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED " & "- A.1"); END; -- (A.1) BEGIN -- (A.2) REC6 := REC4; FAILED ("CONSTRAINT_ERROR NOT RAISED " & "- A.2"); EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED " & "- A.2"); END; -- (A.2) REC9 := (IDENT_INT(9), 9, "987654321"); END E; END T; END PKG; BEGIN -- (A) PKG.T.E (REC9, REC6); IF REC9.STRFIELD /= IDENT_STR("987654321") THEN FAILED ("ASSIGNMENT TO REC9 FAILED - (A)"); END IF; END; -- (A) -------------------------------------------------- DECLARE -- (B) PACKAGE PKG IS TYPE RECTYPE (CONSTRAINT : INTEGER) IS PRIVATE; TASK T IS ENTRY E (REC9 : OUT RECTYPE; REC6 : IN OUT RECTYPE); END T; PRIVATE TYPE RECTYPE (CONSTRAINT : INTEGER) IS RECORD INTFIELD : INTEGER; STRFIELD : STRING (1..CONSTRAINT); END RECORD; END PKG; REC9 : PKG.RECTYPE(9); REC6 : PKG.RECTYPE(6); PACKAGE BODY PKG IS TASK BODY T IS REC4 : CONSTANT RECTYPE(4) := (4, 4, "OOPS"); BEGIN ACCEPT E (REC9 : OUT RECTYPE; REC6 : IN OUT RECTYPE) DO BEGIN -- (B.1) REC9 := REC6; FAILED ("CONSTRAINT_ERROR NOT RAISED " & "- B.1"); EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED " & "- B.1"); END; -- (B.1) BEGIN -- (B.2) REC6 := REC4; FAILED ("CONSTRAINT_ERROR NOT RAISED " & "- B.2"); EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED " & "- B.2"); END; -- (B.2) END E; END T; BEGIN REC9 := (9, 9, "123456789"); REC6 := (6, 5, "AEIOUY"); END PKG; BEGIN -- (B) PKG.T.E (REC9, REC6); END; -- (B) -------------------------------------------------- DECLARE -- (C) PACKAGE PKG IS TYPE RECTYPE (CONSTRAINT : INTEGER) IS LIMITED PRIVATE; TASK T IS ENTRY E (REC9 : OUT RECTYPE; REC6 : IN OUT RECTYPE); END T; PRIVATE TYPE RECTYPE (CONSTRAINT : INTEGER) IS RECORD INTFIELD : INTEGER; STRFIELD : STRING (1..CONSTRAINT); END RECORD; END PKG; REC6 : PKG.RECTYPE(IDENT_INT(6)); REC9 : PKG.RECTYPE(IDENT_INT(9)); PACKAGE BODY PKG IS TASK BODY T IS REC4 : CONSTANT RECTYPE(4) := (4, 4, "OOPS"); BEGIN ACCEPT E (REC9 : OUT RECTYPE; REC6 : IN OUT RECTYPE) DO BEGIN -- (C.1) REC9 := REC6; FAILED ("CONSTRAINT_ERROR NOT RAISED " & "- C.1"); EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED " & "- C.1"); END; -- (C.1) BEGIN -- (C.2) REC6 := REC4; FAILED ("CONSTRAINT_ERROR NOT RAISED " & "- C.2"); EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED " & "- C.2"); END; -- (C.2) END E; END T; BEGIN REC6 := (6, 5, "AEIOUY"); REC9 := (9, 9, "123456789"); END PKG; BEGIN -- (C) PKG.T.E (REC9, REC6); END; -- (C) -------------------------------------------------- RESULT; END C95087B;

33.052239

79

0.372996

39f9a0dec0dc949be171d45e06ef651d3584e37b

7,410

ads

Ada

elan520-gp_timer_registers.ads

Jellix/elan520

447601b7912ea2faf45cd4e9e75b427f34d45cc3

[ "WTFPL" ]

null

elan520-gp_timer_registers.ads

Jellix/elan520

447601b7912ea2faf45cd4e9e75b427f34d45cc3

[ "WTFPL" ]

null

elan520-gp_timer_registers.ads

Jellix/elan520

447601b7912ea2faf45cd4e9e75b427f34d45cc3

[ "WTFPL" ]

null

------------------------------------------------------------------------ -- Copyright (C) 2005-2020 by <[email protected]> -- -- -- -- 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); ------------------------------------------------------------------------ -- AMD Élan(tm) SC 520 embedded microprocessor -- -- MMCR -> General-Purpose Timer Registers -- -- -- -- reference: User's Manual Chapter 17, -- -- Register Set Manual Chapter 14 -- ------------------------------------------------------------------------ with Elan520.Basic_Types; package Elan520.GP_Timer_Registers is --------------------------------------------------------------------- -- GP Timers Status (GPTMRSTA) -- -- Memory Mapped, Read/Write(!) -- -- MMCR Offset C70h -- -- NOTE: writing a 1 (True) to the register resets (clears) the -- -- appropriate bit -- --------------------------------------------------------------------- MMCR_OFFSET_STATUS : constant := 16#C70#; STATUS_SIZE : constant := 8; type Status is record T0_Int_Sta : Boolean; T1_Int_Sta : Boolean; T2_Int_Sta : Boolean; end record; for Status use record T0_Int_Sta at 0 range 0 .. 0; T1_Int_Sta at 0 range 1 .. 1; T2_Int_Sta at 0 range 2 .. 2; -- bits 3 .. 7 are reserved end record; for Status'Size use STATUS_SIZE; -- type used for clock source and retrigger mode selections -- bits [4:2] -- RTG PSC_SEL EXT_CLK clock mode -- 0 0 0 Internal, cpu clock, gated -- 0 0 1 External -- 0 1 0 Internal, prescaled, gated -- 0 1 1 N/A (same as 001) -- 1 0 0 Internal, cpu clock, retriggered -- 1 0 1 N/A (same as 001) -- 1 1 0 internal, prescaled, retriggered -- 1 1 1 N/A (same as 001) type Clock_Source is (Internal_Gated, External, Prescaled_Gated, Internal_Retriggered, Prescaled_Retriggered); for Clock_Source use (Internal_Gated => 2#000#, External => 2#001#, Prescaled_Gated => 2#010#, Internal_Retriggered => 2#100#, Prescaled_Retriggered => 2#110#); for Clock_Source'Size use 3; -- type used for the enable bits (ENB, P_ENB_WR) -- bits [15:14] type Enable_Set is (Dont_Care, Disable, Enable); for Enable_Set use (Dont_Care => 2#00#, Disable => 2#01#, Enable => 2#11#); for Enable_Set'Size use 2; --------------------------------------------------------------------- -- GP Timer Mode/Control (GPTMRxCTL) -- -- Memory Mapped, Read/Write(!) -- -- MMCR Offset C72h (GP Timer 0) -- -- C7Ah (GP Timer 1) -- --------------------------------------------------------------------- MMCR_OFFSET_T0_CONTROL : constant := 16#C72#; MMCR_OFFSET_T1_CONTROL : constant := 16#C7A#; CONTROL_SIZE : constant := 16; type Control is record Continuous_Mode : Basic_Types.Positive_Bit; Alternate_Compare : Basic_Types.Positive_Bit; -- this combines RTG, EXT_CLK and PSC_SEL bits Clock_Mode : Clock_Source; Max_Count_Reached : Boolean; Max_Count_In_Use : Boolean; Interrupt : Basic_Types.Positive_Bit; Enable_Mode : Enable_Set; end record; for Control use record Continuous_Mode at 0 range 0 .. 0; Alternate_Compare at 0 range 1 .. 1; Clock_Mode at 0 range 2 .. 4; Max_Count_Reached at 0 range 5 .. 5; -- bits [11:6] are reserved Max_Count_In_Use at 0 range 12 .. 12; Interrupt at 0 range 13 .. 13; Enable_Mode at 0 range 14 .. 15; end record; --------------------------------------------------------------------- -- GP Timer 2 Mode/Control (GPTMR2CTL) -- -- Memory Mapped, Read/Write(!) -- -- MMCR Offset C82h -- --------------------------------------------------------------------- MMCR_OFFSET_T2_CONTROL : constant := 16#C82#; T2_CONTROL_SIZE : constant := CONTROL_SIZE; type Control_2 is record Continuous_Mode : Basic_Types.Positive_Bit; Max_Count_Reached : Boolean; Interrupt : Basic_Types.Positive_Bit; Enable_Mode : Enable_Set; end record; for Control_2 use record Continuous_Mode at 0 range 0 .. 0; -- bits [4:1] are reserved Max_Count_Reached at 0 range 5 .. 5; -- bits [12:6] are reserved Interrupt at 0 range 13 .. 13; Enable_Mode at 0 range 14 .. 15; end record; -- type used for all count registers type Count is range 0 .. 65535; for Count'Size use 16; --------------------------------------------------------------------- -- GP Count/Maxcount Compare registers -- -- Memory Mapped, Read/Write -- -- MMCR Offset C74h, (Timer 0 Count, GPTMR0CNT) -- -- C76h, (Timer 0 Maxcount Compare A, GPTMR0MAXCMPA) -- -- C78h, (Timer 0 Maxcount Compare B, GPTMR0MAXCMPB) -- -- C7Ch, (Timer 1 Count, GPTMR1CNT) -- -- C7Eh, (Timer 1 Maxcount Compare A, GPTMR1MAXCMPA) -- -- C80h, (Timer 1 Maxcount Compare A, GPTMR1MAXCMPB) -- -- C84h, (Timer 2 Count, GPTMR2CNT) -- -- C86h, (Timer 2 Maxcount Compare A, GPTMR2MAXCMPA) -- --------------------------------------------------------------------- MMCR_OFFSET_T0_COUNT : constant := 16#C74#; MMCR_OFFSET_T0_MAX_A : constant := 16#C76#; MMCR_OFFSET_T0_MAX_B : constant := 16#C78#; MMCR_OFFSET_T1_COUNT : constant := 16#C7C#; MMCR_OFFSET_T1_MAX_A : constant := 16#C7E#; MMCR_OFFSET_T1_MAX_B : constant := 16#C80#; MMCR_OFFSET_T2_COUNT : constant := 16#C84#; MMCR_OFFSET_T2_MAX_A : constant := 16#C86#; end Elan520.GP_Timer_Registers;

42.586207

72

0.430499

5032bc7093d1699dabfbe34d43f7f5f5f4419186

6,147

ads

Ada

src/vulkan-math/vulkan-math-dmat2x4.ads

zrmyers/VulkanAda

ed8c46d923bc8936db3a5d55d36afebb928a9ede

[ "MIT" ]

1

2021-01-29T21:10:45.000Z

src/vulkan-math/vulkan-math-dmat2x4.ads

zrmyers/VulkanAda

ed8c46d923bc8936db3a5d55d36afebb928a9ede

[ "MIT" ]

8

2020-04-22T14:55:20.000Z

2021-11-22T03:58:08.000Z

src/vulkan-math/vulkan-math-dmat2x4.ads

zrmyers/VulkanAda

ed8c46d923bc8936db3a5d55d36afebb928a9ede

[ "MIT" ]

1

2021-04-05T13:19:21.000Z

-------------------------------------------------------------------------------- -- MIT License -- -- Copyright (c) 2020 Zane Myers -- -- 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 Vulkan.Math.GenDMatrix; with Vulkan.Math.Dvec4; use Vulkan.Math.GenDMatrix; use Vulkan.Math.Dvec4; -------------------------------------------------------------------------------- --< @group Vulkan Math Basic Types -------------------------------------------------------------------------------- --< @summary --< This package provides a single precision floating point matrix with 2 rows --< and 4 columns. -------------------------------------------------------------------------------- package Vulkan.Math.Dmat2x4 is pragma Preelaborate; pragma Pure; --< A 2x3 matrix of single-precision floating point numbers. subtype Vkm_Dmat2x4 is Vkm_Dmat( last_row_index => 1, last_column_index => 3); ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat2x4 type. --< --< @description --< Construct a 2x3 matrix with each component set to zero. --< --< @return --< A 2x3 matrix. ---------------------------------------------------------------------------- function Make_Dmat2x4 return Vkm_Dmat2x4 is (GDM.Make_GenMatrix(cN => 3, rN => 1)) with Inline; ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat2x4 type. --< --< @description --< Construct a 2x3 matrix with each component set to a different value. --< --< | value1 value3 value5 value7 | --< | value2 value4 value6 value8 | --< --< @param value1 --< The first value to set for the matrix. --< --< @param value2 --< The second value to set for the matrix. --< --< @param value3 --< The third value to set for the matrix. --< --< @param value4 --< The fourth value to set for the matrix. --< --< @param value5 --< The fifth value to set for the matrix. --< --< @param value6 --< The sixth value to set for the matrix. --< --< @param value7 --< The seventh value to set for the matrix. --< --< @param value8 --< The eighth value to set for the matrix. --< --< @return --< A 2x4 matrix. ---------------------------------------------------------------------------- function Make_Dmat2x4 ( value1, value2, value3, value4, value5, value6, value7, value8 : in Vkm_Double) return Vkm_Dmat2x4 is (GDM.Make_GenMatrix( cN => 3, rN => 1, c0r0_val => value1, c0r1_val => value5, c1r0_val => value2, c1r1_val => value6, c2r0_val => value3, c2r1_val => value7, c3r0_val => value4, c3r1_val => value8)) with Inline; ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat2x4 type. --< --< @description --< Construct a 2x4 matrix with each row set to the value of a 4 dimmensional --< vector. --< --< | value1.x value1.y value1.z value1.w | --< | value2.x value2.y value2.z value2.w | --< --< @param value1 --< The first value to set for the matrix. --< --< @param value2 --< The second value to set for the matrix. --< --< @return --< A 2x4 matrix. ---------------------------------------------------------------------------- function Make_Dmat2x4 ( value1, value2 : in Vkm_Dvec4) return Vkm_Dmat2x4 is (GDM.Make_GenMatrix( cN => 3, rN => 1, c0r0_val => value1.x, c0r1_val => value2.x, c1r0_val => value1.y, c1r1_val => value2.y, c2r0_val => value1.z, c2r1_val => value2.z, c3r0_val => value1.w, c3r1_val => value2.w)) with Inline; ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat2x4 type. --< --< @description --< Construct a 2x3 matrix using values from an existing matrix. --< --< If the provided matrix has dimmensions that are not the same as this --< matrix, the corresponding element in the 4x4 identity matrix is used for --< out of bounds accesses. --< --< @param value1 --< The submatrix to extract values from. --< --< @return --< A 2x4 matrix. ---------------------------------------------------------------------------- function Make_Dmat2x4 ( value1 : in Vkm_Dmat) return Vkm_Dmat2x4 is (GDM.Make_GenMatrix( cN => 3, rN => 1, c0r0_val => value1.c0r0, c0r1_val => value1.c0r1, c1r0_val => value1.c1r0, c1r1_val => value1.c1r1, c2r0_val => value1.c2r0, c2r1_val => value1.c2r1, c3r0_val => value1.c3r0, c3r1_val => value1.c3r1)) with Inline; end Vulkan.Math.Dmat2x4;

37.03012

81

0.513909

066df9fc8b279e8b8e8b80668753922d70ffa288

2,929

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-tirsfi.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/a-tirsfi.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-tirsfi.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . T E X T _ I O . R E S E T _ S T A N D A R D _ F I L E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2009-2012, 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 reset routine that resets the standard files used -- by Text_IO. This is useful in systems such as VxWorks where Ada.Text_IO is -- elaborated at the program start, but a system restart may alter the status -- of these files, resulting in incorrect operation of Text_IO (in particular -- if the standard input file is changed to be interactive, then Get_Line may -- hang looking for an extra character after the end of the line. procedure Ada.Text_IO.Reset_Standard_Files; -- Reset standard Text_IO files as described above

71.439024

78

0.449642

067b5e93fb5db141d3bddf3166ed2f7ac84e59fd

2,323

adb

Ada

ada_lists_tests/src/bug01.adb

gerr135/ada_gems

fc1b55e991766110581fcc340c8bc7c51ef7a49b

[ "BSD-2-Clause" ]

6

2020-11-26T20:01:50.000Z

2022-03-04T22:22:12.000Z

ada_lists_tests/src/bug01.adb

gerr135/ada_gems

fc1b55e991766110581fcc340c8bc7c51ef7a49b

[ "BSD-2-Clause" ]

null

ada_lists_tests/src/bug01.adb

gerr135/ada_gems

fc1b55e991766110581fcc340c8bc7c51ef7a49b

[ "BSD-2-Clause" ]

null

-- -- Short demo of the bug inducing code: tagged hierarchy as a field of discriminated record -- -- 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. -- with Ada.Command_Line, GNAT.Command_Line; with Ada.Text_IO, Ada.Integer_Text_IO; use Ada.Text_IO; with Ada.Containers.Vectors; with lists.Fixed; with lists.Dynamic; with lists.Vectors; procedure bug01 is type Element_Type is new Integer; package ACV is new Ada.Containers.Vectors(Positive, Element_Type); package PL is new Lists(Natural, Element_Type); package PLF is new PL.Fixed; package PLD is new PL.Dynamic; package PLV is new PL.Vectors; begin Put_Line("Ada.Containers.Vectors.."); declare v : ACV.Vector := ACV.To_Vector(5); type VRec is record f : ACV.Vector; end record; vr : VRec := (f => ACV.To_Vector(5)); begin v(1) := 1; vr.f(1) := 1; end; -- Put_Line("Lists.Dynamic.."); declare ld : PLD.List := PLD.To_Vector(5); type DRec is record f : PLD.List; end record; ldr : DRec := (f => PLD.To_Vector(5)); -- type DDRec (N : Positive) is record f : PLD.List := PLD.To_Vector(N); end record; lddr : DDRec(5); begin ld(1) := 1; ldr.f(1) := 1; lddr.f(1) := 1; end; -- Put_Line("Lists.Vectors.."); declare lv : PLV.List := PLV.To_Vector(5); type VRec is record f : PLV.List; end record; lvr : VRec := (f => PLV.To_Vector(5)); begin lv(1) := 1; lvr.f(1) := 1; end; -- Put_Line("Lists.Fixed (discriminated record)"); declare type FRec5 is record f : PLF.List(5); end record; -- type FRec (N : Positive) is record f : PLF.List(N); end record; -- lf : PLF.List(5); lfr5 : FRec5; lfr : FRec(5); begin lf(1) := 1; lfr5.f(1) := 1; -- this is still fine lfr.f(1) := 1; -- this triggers the bug end; end bug01;

24.978495

91

0.553164

1d0946aaccbc06450e0899b5ada2a13d4ebb88d3

2,513

adb

Ada

1A/S5/PIM/tps/pr2/ensembles_chainage.adb

MOUDDENEHamza/ENSEEIHT

a90b1dee0c8d18a9578153a357278d99405bb534

[ "Apache-2.0" ]

4

2020-05-02T12:32:32.000Z

2022-01-12T20:20:35.000Z

1A/S5/PIM/tps/pr2/ensembles_chainage.adb

MOUDDENEHamza/ENSEEIHT

a90b1dee0c8d18a9578153a357278d99405bb534

[ "Apache-2.0" ]

2

2021-01-14T20:03:26.000Z

2022-01-30T01:10:00.000Z

1A/S5/PIM/tps/pr2/ensembles_chainage.adb

MOUDDENEHamza/ENSEEIHT

a90b1dee0c8d18a9578153a357278d99405bb534

[ "Apache-2.0" ]

13

2020-11-11T21:28:11.000Z

2022-02-19T13:54:22.000Z

-- Implantation du module Ensembles. with Ada.Unchecked_Deallocation; package body Ensembles_Chainage is -- Libérer la mémoire alloué auparavant. procedure Free is new Ada.Unchecked_Deallocation (T_Cellule, T_Ensemble); procedure Initialiser (Ensemble : out T_Ensemble) is begin Ensemble := Null; end Initialiser; procedure Detruire (Ensemble : in out T_Ensemble) is begin if (Ensemble /= Null) then Detruire (Ensemble.all.Suivant); Free (Ensemble); else null; end if; end Detruire; function Est_Vide (Ensemble : in T_Ensemble) return Boolean is begin return Ensemble = Null; end Est_Vide; function Taille (Ensemble : in T_Ensemble) return Integer is begin if (Ensemble = Null) then return 0; else return 1 + Taille (Ensemble.all.suivant); end if; end Taille; function Est_Present (Ensemble : in T_Ensemble; Element : in T_Element) return Boolean is present : Boolean; Temp : T_Ensemble; begin present := False; Temp := Ensemble; while (Temp /= Null) loop if (Temp.all.Element = Element) then present := True; end if; Temp := Temp.all.Suivant; end loop; return present; end Est_Present; procedure Ajouter (Ensemble : in out T_Ensemble; Element : in T_Element) is Nouvelle_Cellule, Temp : T_Ensemble; begin Nouvelle_Cellule := New T_Cellule'(Element, Null); if ( Ensemble = Null) then -- Si l'ensemble est vide. Ensemble := Nouvelle_Cellule; --Créer une nouvelle cellule. else -- Sinon, on ajoute à la fin de l'ensemble. Temp := Ensemble; while (Temp.all.Suivant /= Null) loop Temp := Temp.all.Suivant; end loop; Temp.all.Suivant := Nouvelle_Cellule; --Créer une nouvelle cellule.; end if; end Ajouter; procedure Supprimer (Ensemble : in out T_Ensemble; Element : in T_Element) is Temp : T_Ensemble; begin if (Ensemble.all.Element = Element) then Temp := Ensemble.all.Suivant; Free (Ensemble); Ensemble := Temp; else Supprimer (Ensemble.all.Suivant, Element); end if; end Supprimer; procedure Appliquer_Sur_Tous (Ensemble : in T_Ensemble) is Temp : T_Ensemble; begin Temp := Ensemble; while (Temp /= NULL) loop Operation (Temp.all.Element); Temp := Temp.all.Suivant; end loop; end Appliquer_Sur_Tous; end Ensembles_Chainage;

26.177083

93

0.64425

1259e92da4eb54651615871404d76268b21b940a

4,964

ads

Ada

source/amf/mof/cmof/amf-cmof-operations-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/cmof/amf-cmof-operations-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/cmof/amf-cmof-operations-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- 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.CMOF.Operations.Collections is pragma Preelaborate; package CMOF_Operation_Collections is new AMF.Generic_Collections (CMOF_Operation, CMOF_Operation_Access); type Set_Of_CMOF_Operation is new CMOF_Operation_Collections.Set with null record; Empty_Set_Of_CMOF_Operation : constant Set_Of_CMOF_Operation; type Ordered_Set_Of_CMOF_Operation is new CMOF_Operation_Collections.Ordered_Set with null record; Empty_Ordered_Set_Of_CMOF_Operation : constant Ordered_Set_Of_CMOF_Operation; type Bag_Of_CMOF_Operation is new CMOF_Operation_Collections.Bag with null record; Empty_Bag_Of_CMOF_Operation : constant Bag_Of_CMOF_Operation; type Sequence_Of_CMOF_Operation is new CMOF_Operation_Collections.Sequence with null record; Empty_Sequence_Of_CMOF_Operation : constant Sequence_Of_CMOF_Operation; private Empty_Set_Of_CMOF_Operation : constant Set_Of_CMOF_Operation := (CMOF_Operation_Collections.Set with null record); Empty_Ordered_Set_Of_CMOF_Operation : constant Ordered_Set_Of_CMOF_Operation := (CMOF_Operation_Collections.Ordered_Set with null record); Empty_Bag_Of_CMOF_Operation : constant Bag_Of_CMOF_Operation := (CMOF_Operation_Collections.Bag with null record); Empty_Sequence_Of_CMOF_Operation : constant Sequence_Of_CMOF_Operation := (CMOF_Operation_Collections.Sequence with null record); end AMF.CMOF.Operations.Collections;

53.956522

80

0.512691

31a8a0515dffb697e0e3abd1ad96c518790d4b48

269,572

adb

Ada

source/nodes/program-implicit_element_factories.adb

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/nodes/program-implicit_element_factories.adb

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/nodes/program-implicit_element_factories.adb

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

2

2019-09-14T23:18:50.000Z

2019-10-02T10:11:40.000Z

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Program.Storage_Pools; with Program.Nodes.Pragmas; with Program.Nodes.Defining_Identifiers; with Program.Nodes.Defining_Character_Literals; with Program.Nodes.Defining_Operator_Symbols; with Program.Nodes.Defining_Expanded_Names; with Program.Nodes.Type_Declarations; with Program.Nodes.Task_Type_Declarations; with Program.Nodes.Protected_Type_Declarations; with Program.Nodes.Subtype_Declarations; with Program.Nodes.Object_Declarations; with Program.Nodes.Single_Task_Declarations; with Program.Nodes.Single_Protected_Declarations; with Program.Nodes.Number_Declarations; with Program.Nodes.Enumeration_Literal_Specifications; with Program.Nodes.Discriminant_Specifications; with Program.Nodes.Component_Declarations; with Program.Nodes.Loop_Parameter_Specifications; with Program.Nodes.Generalized_Iterator_Specifications; with Program.Nodes.Element_Iterator_Specifications; with Program.Nodes.Procedure_Declarations; with Program.Nodes.Function_Declarations; with Program.Nodes.Parameter_Specifications; with Program.Nodes.Procedure_Body_Declarations; with Program.Nodes.Function_Body_Declarations; with Program.Nodes.Return_Object_Specifications; with Program.Nodes.Package_Declarations; with Program.Nodes.Package_Body_Declarations; with Program.Nodes.Object_Renaming_Declarations; with Program.Nodes.Exception_Renaming_Declarations; with Program.Nodes.Procedure_Renaming_Declarations; with Program.Nodes.Function_Renaming_Declarations; with Program.Nodes.Package_Renaming_Declarations; with Program.Nodes.Generic_Package_Renaming_Declarations; with Program.Nodes.Generic_Procedure_Renaming_Declarations; with Program.Nodes.Generic_Function_Renaming_Declarations; with Program.Nodes.Task_Body_Declarations; with Program.Nodes.Protected_Body_Declarations; with Program.Nodes.Entry_Declarations; with Program.Nodes.Entry_Body_Declarations; with Program.Nodes.Entry_Index_Specifications; with Program.Nodes.Procedure_Body_Stubs; with Program.Nodes.Function_Body_Stubs; with Program.Nodes.Package_Body_Stubs; with Program.Nodes.Task_Body_Stubs; with Program.Nodes.Protected_Body_Stubs; with Program.Nodes.Exception_Declarations; with Program.Nodes.Choice_Parameter_Specifications; with Program.Nodes.Generic_Package_Declarations; with Program.Nodes.Generic_Procedure_Declarations; with Program.Nodes.Generic_Function_Declarations; with Program.Nodes.Package_Instantiations; with Program.Nodes.Procedure_Instantiations; with Program.Nodes.Function_Instantiations; with Program.Nodes.Formal_Object_Declarations; with Program.Nodes.Formal_Type_Declarations; with Program.Nodes.Formal_Procedure_Declarations; with Program.Nodes.Formal_Function_Declarations; with Program.Nodes.Formal_Package_Declarations; with Program.Nodes.Subtype_Indications; with Program.Nodes.Component_Definitions; with Program.Nodes.Discrete_Subtype_Indications; with Program.Nodes.Discrete_Range_Attribute_References; with Program.Nodes.Discrete_Simple_Expression_Ranges; with Program.Nodes.Unknown_Discriminant_Parts; with Program.Nodes.Known_Discriminant_Parts; with Program.Nodes.Record_Definitions; with Program.Nodes.Null_Components; with Program.Nodes.Variant_Parts; with Program.Nodes.Variants; with Program.Nodes.Others_Choices; with Program.Nodes.Anonymous_Access_To_Objects; with Program.Nodes.Anonymous_Access_To_Procedures; with Program.Nodes.Anonymous_Access_To_Functions; with Program.Nodes.Private_Type_Definitions; with Program.Nodes.Private_Extension_Definitions; with Program.Nodes.Incomplete_Type_Definitions; with Program.Nodes.Task_Definitions; with Program.Nodes.Protected_Definitions; with Program.Nodes.Aspect_Specifications; with Program.Nodes.Real_Range_Specifications; with Program.Nodes.Numeric_Literals; with Program.Nodes.String_Literals; with Program.Nodes.Identifiers; with Program.Nodes.Operator_Symbols; with Program.Nodes.Character_Literals; with Program.Nodes.Explicit_Dereferences; with Program.Nodes.Infix_Operators; with Program.Nodes.Function_Calls; with Program.Nodes.Indexed_Components; with Program.Nodes.Slices; with Program.Nodes.Selected_Components; with Program.Nodes.Attribute_References; with Program.Nodes.Record_Aggregates; with Program.Nodes.Extension_Aggregates; with Program.Nodes.Array_Aggregates; with Program.Nodes.Short_Circuit_Operations; with Program.Nodes.Membership_Tests; with Program.Nodes.Null_Literals; with Program.Nodes.Parenthesized_Expressions; with Program.Nodes.Raise_Expressions; with Program.Nodes.Type_Conversions; with Program.Nodes.Qualified_Expressions; with Program.Nodes.Allocators; with Program.Nodes.Case_Expressions; with Program.Nodes.If_Expressions; with Program.Nodes.Quantified_Expressions; with Program.Nodes.Discriminant_Associations; with Program.Nodes.Record_Component_Associations; with Program.Nodes.Array_Component_Associations; with Program.Nodes.Parameter_Associations; with Program.Nodes.Formal_Package_Associations; with Program.Nodes.Null_Statements; with Program.Nodes.Assignment_Statements; with Program.Nodes.If_Statements; with Program.Nodes.Case_Statements; with Program.Nodes.Loop_Statements; with Program.Nodes.While_Loop_Statements; with Program.Nodes.For_Loop_Statements; with Program.Nodes.Block_Statements; with Program.Nodes.Exit_Statements; with Program.Nodes.Goto_Statements; with Program.Nodes.Call_Statements; with Program.Nodes.Simple_Return_Statements; with Program.Nodes.Extended_Return_Statements; with Program.Nodes.Accept_Statements; with Program.Nodes.Requeue_Statements; with Program.Nodes.Delay_Statements; with Program.Nodes.Terminate_Alternative_Statements; with Program.Nodes.Select_Statements; with Program.Nodes.Abort_Statements; with Program.Nodes.Raise_Statements; with Program.Nodes.Code_Statements; with Program.Nodes.Elsif_Paths; with Program.Nodes.Case_Paths; with Program.Nodes.Select_Paths; with Program.Nodes.Case_Expression_Paths; with Program.Nodes.Elsif_Expression_Paths; with Program.Nodes.Use_Clauses; with Program.Nodes.With_Clauses; with Program.Nodes.Component_Clauses; with Program.Nodes.Derived_Types; with Program.Nodes.Derived_Record_Extensions; with Program.Nodes.Enumeration_Types; with Program.Nodes.Signed_Integer_Types; with Program.Nodes.Modular_Types; with Program.Nodes.Root_Types; with Program.Nodes.Floating_Point_Types; with Program.Nodes.Ordinary_Fixed_Point_Types; with Program.Nodes.Decimal_Fixed_Point_Types; with Program.Nodes.Unconstrained_Array_Types; with Program.Nodes.Constrained_Array_Types; with Program.Nodes.Record_Types; with Program.Nodes.Interface_Types; with Program.Nodes.Object_Access_Types; with Program.Nodes.Procedure_Access_Types; with Program.Nodes.Function_Access_Types; with Program.Nodes.Formal_Private_Type_Definitions; with Program.Nodes.Formal_Derived_Type_Definitions; with Program.Nodes.Formal_Discrete_Type_Definitions; with Program.Nodes.Formal_Signed_Integer_Type_Definitions; with Program.Nodes.Formal_Modular_Type_Definitions; with Program.Nodes.Formal_Floating_Point_Definitions; with Program.Nodes.Formal_Ordinary_Fixed_Point_Definitions; with Program.Nodes.Formal_Decimal_Fixed_Point_Definitions; with Program.Nodes.Formal_Unconstrained_Array_Types; with Program.Nodes.Formal_Constrained_Array_Types; with Program.Nodes.Formal_Object_Access_Types; with Program.Nodes.Formal_Procedure_Access_Types; with Program.Nodes.Formal_Function_Access_Types; with Program.Nodes.Formal_Interface_Types; with Program.Nodes.Range_Attribute_References; with Program.Nodes.Simple_Expression_Ranges; with Program.Nodes.Digits_Constraints; with Program.Nodes.Delta_Constraints; with Program.Nodes.Index_Constraints; with Program.Nodes.Discriminant_Constraints; with Program.Nodes.Attribute_Definition_Clauses; with Program.Nodes.Enumeration_Representation_Clauses; with Program.Nodes.Record_Representation_Clauses; with Program.Nodes.At_Clauses; with Program.Nodes.Exception_Handlers; package body Program.Implicit_Element_Factories is type Pragma_Access is not null access Program.Nodes.Pragmas.Implicit_Pragma with Storage_Pool => Program.Storage_Pools.Pool; type Defining_Identifier_Access is not null access Program.Nodes.Defining_Identifiers .Implicit_Defining_Identifier with Storage_Pool => Program.Storage_Pools.Pool; type Defining_Character_Literal_Access is not null access Program.Nodes.Defining_Character_Literals .Implicit_Defining_Character_Literal with Storage_Pool => Program.Storage_Pools.Pool; type Defining_Operator_Symbol_Access is not null access Program.Nodes.Defining_Operator_Symbols .Implicit_Defining_Operator_Symbol with Storage_Pool => Program.Storage_Pools.Pool; type Defining_Expanded_Name_Access is not null access Program.Nodes.Defining_Expanded_Names .Implicit_Defining_Expanded_Name with Storage_Pool => Program.Storage_Pools.Pool; type Type_Declaration_Access is not null access Program.Nodes.Type_Declarations.Implicit_Type_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Task_Type_Declaration_Access is not null access Program.Nodes.Task_Type_Declarations .Implicit_Task_Type_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Protected_Type_Declaration_Access is not null access Program.Nodes.Protected_Type_Declarations .Implicit_Protected_Type_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Subtype_Declaration_Access is not null access Program.Nodes.Subtype_Declarations .Implicit_Subtype_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Object_Declaration_Access is not null access Program.Nodes.Object_Declarations .Implicit_Object_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Single_Task_Declaration_Access is not null access Program.Nodes.Single_Task_Declarations .Implicit_Single_Task_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Single_Protected_Declaration_Access is not null access Program.Nodes.Single_Protected_Declarations .Implicit_Single_Protected_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Number_Declaration_Access is not null access Program.Nodes.Number_Declarations .Implicit_Number_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Enumeration_Literal_Specification_Access is not null access Program.Nodes.Enumeration_Literal_Specifications .Implicit_Enumeration_Literal_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Discriminant_Specification_Access is not null access Program.Nodes.Discriminant_Specifications .Implicit_Discriminant_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Component_Declaration_Access is not null access Program.Nodes.Component_Declarations .Implicit_Component_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Loop_Parameter_Specification_Access is not null access Program.Nodes.Loop_Parameter_Specifications .Implicit_Loop_Parameter_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Generalized_Iterator_Specification_Access is not null access Program.Nodes.Generalized_Iterator_Specifications .Implicit_Generalized_Iterator_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Element_Iterator_Specification_Access is not null access Program.Nodes.Element_Iterator_Specifications .Implicit_Element_Iterator_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Procedure_Declaration_Access is not null access Program.Nodes.Procedure_Declarations .Implicit_Procedure_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Function_Declaration_Access is not null access Program.Nodes.Function_Declarations .Implicit_Function_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Parameter_Specification_Access is not null access Program.Nodes.Parameter_Specifications .Implicit_Parameter_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Procedure_Body_Declaration_Access is not null access Program.Nodes.Procedure_Body_Declarations .Implicit_Procedure_Body_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Function_Body_Declaration_Access is not null access Program.Nodes.Function_Body_Declarations .Implicit_Function_Body_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Return_Object_Specification_Access is not null access Program.Nodes.Return_Object_Specifications .Implicit_Return_Object_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Package_Declaration_Access is not null access Program.Nodes.Package_Declarations .Implicit_Package_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Package_Body_Declaration_Access is not null access Program.Nodes.Package_Body_Declarations .Implicit_Package_Body_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Object_Renaming_Declaration_Access is not null access Program.Nodes.Object_Renaming_Declarations .Implicit_Object_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Exception_Renaming_Declaration_Access is not null access Program.Nodes.Exception_Renaming_Declarations .Implicit_Exception_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Procedure_Renaming_Declaration_Access is not null access Program.Nodes.Procedure_Renaming_Declarations .Implicit_Procedure_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Function_Renaming_Declaration_Access is not null access Program.Nodes.Function_Renaming_Declarations .Implicit_Function_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Package_Renaming_Declaration_Access is not null access Program.Nodes.Package_Renaming_Declarations .Implicit_Package_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Generic_Package_Renaming_Declaration_Access is not null access Program.Nodes.Generic_Package_Renaming_Declarations .Implicit_Generic_Package_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Generic_Procedure_Renaming_Declaration_Access is not null access Program.Nodes.Generic_Procedure_Renaming_Declarations .Implicit_Generic_Procedure_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Generic_Function_Renaming_Declaration_Access is not null access Program.Nodes.Generic_Function_Renaming_Declarations .Implicit_Generic_Function_Renaming_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Task_Body_Declaration_Access is not null access Program.Nodes.Task_Body_Declarations .Implicit_Task_Body_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Protected_Body_Declaration_Access is not null access Program.Nodes.Protected_Body_Declarations .Implicit_Protected_Body_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Entry_Declaration_Access is not null access Program.Nodes.Entry_Declarations .Implicit_Entry_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Entry_Body_Declaration_Access is not null access Program.Nodes.Entry_Body_Declarations .Implicit_Entry_Body_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Entry_Index_Specification_Access is not null access Program.Nodes.Entry_Index_Specifications .Implicit_Entry_Index_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Procedure_Body_Stub_Access is not null access Program.Nodes.Procedure_Body_Stubs .Implicit_Procedure_Body_Stub with Storage_Pool => Program.Storage_Pools.Pool; type Function_Body_Stub_Access is not null access Program.Nodes.Function_Body_Stubs .Implicit_Function_Body_Stub with Storage_Pool => Program.Storage_Pools.Pool; type Package_Body_Stub_Access is not null access Program.Nodes.Package_Body_Stubs .Implicit_Package_Body_Stub with Storage_Pool => Program.Storage_Pools.Pool; type Task_Body_Stub_Access is not null access Program.Nodes.Task_Body_Stubs.Implicit_Task_Body_Stub with Storage_Pool => Program.Storage_Pools.Pool; type Protected_Body_Stub_Access is not null access Program.Nodes.Protected_Body_Stubs .Implicit_Protected_Body_Stub with Storage_Pool => Program.Storage_Pools.Pool; type Exception_Declaration_Access is not null access Program.Nodes.Exception_Declarations .Implicit_Exception_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Choice_Parameter_Specification_Access is not null access Program.Nodes.Choice_Parameter_Specifications .Implicit_Choice_Parameter_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Generic_Package_Declaration_Access is not null access Program.Nodes.Generic_Package_Declarations .Implicit_Generic_Package_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Generic_Procedure_Declaration_Access is not null access Program.Nodes.Generic_Procedure_Declarations .Implicit_Generic_Procedure_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Generic_Function_Declaration_Access is not null access Program.Nodes.Generic_Function_Declarations .Implicit_Generic_Function_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Package_Instantiation_Access is not null access Program.Nodes.Package_Instantiations .Implicit_Package_Instantiation with Storage_Pool => Program.Storage_Pools.Pool; type Procedure_Instantiation_Access is not null access Program.Nodes.Procedure_Instantiations .Implicit_Procedure_Instantiation with Storage_Pool => Program.Storage_Pools.Pool; type Function_Instantiation_Access is not null access Program.Nodes.Function_Instantiations .Implicit_Function_Instantiation with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Object_Declaration_Access is not null access Program.Nodes.Formal_Object_Declarations .Implicit_Formal_Object_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Type_Declaration_Access is not null access Program.Nodes.Formal_Type_Declarations .Implicit_Formal_Type_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Procedure_Declaration_Access is not null access Program.Nodes.Formal_Procedure_Declarations .Implicit_Formal_Procedure_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Function_Declaration_Access is not null access Program.Nodes.Formal_Function_Declarations .Implicit_Formal_Function_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Package_Declaration_Access is not null access Program.Nodes.Formal_Package_Declarations .Implicit_Formal_Package_Declaration with Storage_Pool => Program.Storage_Pools.Pool; type Subtype_Indication_Access is not null access Program.Nodes.Subtype_Indications .Implicit_Subtype_Indication with Storage_Pool => Program.Storage_Pools.Pool; type Component_Definition_Access is not null access Program.Nodes.Component_Definitions .Implicit_Component_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Discrete_Subtype_Indication_Access is not null access Program.Nodes.Discrete_Subtype_Indications .Implicit_Discrete_Subtype_Indication with Storage_Pool => Program.Storage_Pools.Pool; type Discrete_Range_Attribute_Reference_Access is not null access Program.Nodes.Discrete_Range_Attribute_References .Implicit_Discrete_Range_Attribute_Reference with Storage_Pool => Program.Storage_Pools.Pool; type Discrete_Simple_Expression_Range_Access is not null access Program.Nodes.Discrete_Simple_Expression_Ranges .Implicit_Discrete_Simple_Expression_Range with Storage_Pool => Program.Storage_Pools.Pool; type Unknown_Discriminant_Part_Access is not null access Program.Nodes.Unknown_Discriminant_Parts .Implicit_Unknown_Discriminant_Part with Storage_Pool => Program.Storage_Pools.Pool; type Known_Discriminant_Part_Access is not null access Program.Nodes.Known_Discriminant_Parts .Implicit_Known_Discriminant_Part with Storage_Pool => Program.Storage_Pools.Pool; type Record_Definition_Access is not null access Program.Nodes.Record_Definitions .Implicit_Record_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Null_Component_Access is not null access Program.Nodes.Null_Components.Implicit_Null_Component with Storage_Pool => Program.Storage_Pools.Pool; type Variant_Part_Access is not null access Program.Nodes.Variant_Parts.Implicit_Variant_Part with Storage_Pool => Program.Storage_Pools.Pool; type Variant_Access is not null access Program.Nodes.Variants.Implicit_Variant with Storage_Pool => Program.Storage_Pools.Pool; type Others_Choice_Access is not null access Program.Nodes.Others_Choices.Implicit_Others_Choice with Storage_Pool => Program.Storage_Pools.Pool; type Anonymous_Access_To_Object_Access is not null access Program.Nodes.Anonymous_Access_To_Objects .Implicit_Anonymous_Access_To_Object with Storage_Pool => Program.Storage_Pools.Pool; type Anonymous_Access_To_Procedure_Access is not null access Program.Nodes.Anonymous_Access_To_Procedures .Implicit_Anonymous_Access_To_Procedure with Storage_Pool => Program.Storage_Pools.Pool; type Anonymous_Access_To_Function_Access is not null access Program.Nodes.Anonymous_Access_To_Functions .Implicit_Anonymous_Access_To_Function with Storage_Pool => Program.Storage_Pools.Pool; type Private_Type_Definition_Access is not null access Program.Nodes.Private_Type_Definitions .Implicit_Private_Type_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Private_Extension_Definition_Access is not null access Program.Nodes.Private_Extension_Definitions .Implicit_Private_Extension_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Incomplete_Type_Definition_Access is not null access Program.Nodes.Incomplete_Type_Definitions .Implicit_Incomplete_Type_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Task_Definition_Access is not null access Program.Nodes.Task_Definitions.Implicit_Task_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Protected_Definition_Access is not null access Program.Nodes.Protected_Definitions .Implicit_Protected_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Aspect_Specification_Access is not null access Program.Nodes.Aspect_Specifications .Implicit_Aspect_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Real_Range_Specification_Access is not null access Program.Nodes.Real_Range_Specifications .Implicit_Real_Range_Specification with Storage_Pool => Program.Storage_Pools.Pool; type Numeric_Literal_Access is not null access Program.Nodes.Numeric_Literals.Implicit_Numeric_Literal with Storage_Pool => Program.Storage_Pools.Pool; type String_Literal_Access is not null access Program.Nodes.String_Literals.Implicit_String_Literal with Storage_Pool => Program.Storage_Pools.Pool; type Identifier_Access is not null access Program.Nodes.Identifiers.Implicit_Identifier with Storage_Pool => Program.Storage_Pools.Pool; type Operator_Symbol_Access is not null access Program.Nodes.Operator_Symbols.Implicit_Operator_Symbol with Storage_Pool => Program.Storage_Pools.Pool; type Character_Literal_Access is not null access Program.Nodes.Character_Literals .Implicit_Character_Literal with Storage_Pool => Program.Storage_Pools.Pool; type Explicit_Dereference_Access is not null access Program.Nodes.Explicit_Dereferences .Implicit_Explicit_Dereference with Storage_Pool => Program.Storage_Pools.Pool; type Infix_Operator_Access is not null access Program.Nodes.Infix_Operators.Implicit_Infix_Operator with Storage_Pool => Program.Storage_Pools.Pool; type Function_Call_Access is not null access Program.Nodes.Function_Calls.Implicit_Function_Call with Storage_Pool => Program.Storage_Pools.Pool; type Indexed_Component_Access is not null access Program.Nodes.Indexed_Components .Implicit_Indexed_Component with Storage_Pool => Program.Storage_Pools.Pool; type Slice_Access is not null access Program.Nodes.Slices.Implicit_Slice with Storage_Pool => Program.Storage_Pools.Pool; type Selected_Component_Access is not null access Program.Nodes.Selected_Components .Implicit_Selected_Component with Storage_Pool => Program.Storage_Pools.Pool; type Attribute_Reference_Access is not null access Program.Nodes.Attribute_References .Implicit_Attribute_Reference with Storage_Pool => Program.Storage_Pools.Pool; type Record_Aggregate_Access is not null access Program.Nodes.Record_Aggregates.Implicit_Record_Aggregate with Storage_Pool => Program.Storage_Pools.Pool; type Extension_Aggregate_Access is not null access Program.Nodes.Extension_Aggregates .Implicit_Extension_Aggregate with Storage_Pool => Program.Storage_Pools.Pool; type Array_Aggregate_Access is not null access Program.Nodes.Array_Aggregates.Implicit_Array_Aggregate with Storage_Pool => Program.Storage_Pools.Pool; type Short_Circuit_Operation_Access is not null access Program.Nodes.Short_Circuit_Operations .Implicit_Short_Circuit_Operation with Storage_Pool => Program.Storage_Pools.Pool; type Membership_Test_Access is not null access Program.Nodes.Membership_Tests.Implicit_Membership_Test with Storage_Pool => Program.Storage_Pools.Pool; type Null_Literal_Access is not null access Program.Nodes.Null_Literals.Implicit_Null_Literal with Storage_Pool => Program.Storage_Pools.Pool; type Parenthesized_Expression_Access is not null access Program.Nodes.Parenthesized_Expressions .Implicit_Parenthesized_Expression with Storage_Pool => Program.Storage_Pools.Pool; type Raise_Expression_Access is not null access Program.Nodes.Raise_Expressions.Implicit_Raise_Expression with Storage_Pool => Program.Storage_Pools.Pool; type Type_Conversion_Access is not null access Program.Nodes.Type_Conversions.Implicit_Type_Conversion with Storage_Pool => Program.Storage_Pools.Pool; type Qualified_Expression_Access is not null access Program.Nodes.Qualified_Expressions .Implicit_Qualified_Expression with Storage_Pool => Program.Storage_Pools.Pool; type Allocator_Access is not null access Program.Nodes.Allocators.Implicit_Allocator with Storage_Pool => Program.Storage_Pools.Pool; type Case_Expression_Access is not null access Program.Nodes.Case_Expressions.Implicit_Case_Expression with Storage_Pool => Program.Storage_Pools.Pool; type If_Expression_Access is not null access Program.Nodes.If_Expressions.Implicit_If_Expression with Storage_Pool => Program.Storage_Pools.Pool; type Quantified_Expression_Access is not null access Program.Nodes.Quantified_Expressions .Implicit_Quantified_Expression with Storage_Pool => Program.Storage_Pools.Pool; type Discriminant_Association_Access is not null access Program.Nodes.Discriminant_Associations .Implicit_Discriminant_Association with Storage_Pool => Program.Storage_Pools.Pool; type Record_Component_Association_Access is not null access Program.Nodes.Record_Component_Associations .Implicit_Record_Component_Association with Storage_Pool => Program.Storage_Pools.Pool; type Array_Component_Association_Access is not null access Program.Nodes.Array_Component_Associations .Implicit_Array_Component_Association with Storage_Pool => Program.Storage_Pools.Pool; type Parameter_Association_Access is not null access Program.Nodes.Parameter_Associations .Implicit_Parameter_Association with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Package_Association_Access is not null access Program.Nodes.Formal_Package_Associations .Implicit_Formal_Package_Association with Storage_Pool => Program.Storage_Pools.Pool; type Null_Statement_Access is not null access Program.Nodes.Null_Statements.Implicit_Null_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Assignment_Statement_Access is not null access Program.Nodes.Assignment_Statements .Implicit_Assignment_Statement with Storage_Pool => Program.Storage_Pools.Pool; type If_Statement_Access is not null access Program.Nodes.If_Statements.Implicit_If_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Case_Statement_Access is not null access Program.Nodes.Case_Statements.Implicit_Case_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Loop_Statement_Access is not null access Program.Nodes.Loop_Statements.Implicit_Loop_Statement with Storage_Pool => Program.Storage_Pools.Pool; type While_Loop_Statement_Access is not null access Program.Nodes.While_Loop_Statements .Implicit_While_Loop_Statement with Storage_Pool => Program.Storage_Pools.Pool; type For_Loop_Statement_Access is not null access Program.Nodes.For_Loop_Statements .Implicit_For_Loop_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Block_Statement_Access is not null access Program.Nodes.Block_Statements.Implicit_Block_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Exit_Statement_Access is not null access Program.Nodes.Exit_Statements.Implicit_Exit_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Goto_Statement_Access is not null access Program.Nodes.Goto_Statements.Implicit_Goto_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Call_Statement_Access is not null access Program.Nodes.Call_Statements.Implicit_Call_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Simple_Return_Statement_Access is not null access Program.Nodes.Simple_Return_Statements .Implicit_Simple_Return_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Extended_Return_Statement_Access is not null access Program.Nodes.Extended_Return_Statements .Implicit_Extended_Return_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Accept_Statement_Access is not null access Program.Nodes.Accept_Statements.Implicit_Accept_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Requeue_Statement_Access is not null access Program.Nodes.Requeue_Statements .Implicit_Requeue_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Delay_Statement_Access is not null access Program.Nodes.Delay_Statements.Implicit_Delay_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Terminate_Alternative_Statement_Access is not null access Program.Nodes.Terminate_Alternative_Statements .Implicit_Terminate_Alternative_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Select_Statement_Access is not null access Program.Nodes.Select_Statements.Implicit_Select_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Abort_Statement_Access is not null access Program.Nodes.Abort_Statements.Implicit_Abort_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Raise_Statement_Access is not null access Program.Nodes.Raise_Statements.Implicit_Raise_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Code_Statement_Access is not null access Program.Nodes.Code_Statements.Implicit_Code_Statement with Storage_Pool => Program.Storage_Pools.Pool; type Elsif_Path_Access is not null access Program.Nodes.Elsif_Paths.Implicit_Elsif_Path with Storage_Pool => Program.Storage_Pools.Pool; type Case_Path_Access is not null access Program.Nodes.Case_Paths.Implicit_Case_Path with Storage_Pool => Program.Storage_Pools.Pool; type Select_Path_Access is not null access Program.Nodes.Select_Paths.Implicit_Select_Path with Storage_Pool => Program.Storage_Pools.Pool; type Case_Expression_Path_Access is not null access Program.Nodes.Case_Expression_Paths .Implicit_Case_Expression_Path with Storage_Pool => Program.Storage_Pools.Pool; type Elsif_Expression_Path_Access is not null access Program.Nodes.Elsif_Expression_Paths .Implicit_Elsif_Expression_Path with Storage_Pool => Program.Storage_Pools.Pool; type Use_Clause_Access is not null access Program.Nodes.Use_Clauses.Implicit_Use_Clause with Storage_Pool => Program.Storage_Pools.Pool; type With_Clause_Access is not null access Program.Nodes.With_Clauses.Implicit_With_Clause with Storage_Pool => Program.Storage_Pools.Pool; type Component_Clause_Access is not null access Program.Nodes.Component_Clauses.Implicit_Component_Clause with Storage_Pool => Program.Storage_Pools.Pool; type Derived_Type_Access is not null access Program.Nodes.Derived_Types.Implicit_Derived_Type with Storage_Pool => Program.Storage_Pools.Pool; type Derived_Record_Extension_Access is not null access Program.Nodes.Derived_Record_Extensions .Implicit_Derived_Record_Extension with Storage_Pool => Program.Storage_Pools.Pool; type Enumeration_Type_Access is not null access Program.Nodes.Enumeration_Types.Implicit_Enumeration_Type with Storage_Pool => Program.Storage_Pools.Pool; type Signed_Integer_Type_Access is not null access Program.Nodes.Signed_Integer_Types .Implicit_Signed_Integer_Type with Storage_Pool => Program.Storage_Pools.Pool; type Modular_Type_Access is not null access Program.Nodes.Modular_Types.Implicit_Modular_Type with Storage_Pool => Program.Storage_Pools.Pool; type Root_Type_Access is not null access Program.Nodes.Root_Types.Implicit_Root_Type with Storage_Pool => Program.Storage_Pools.Pool; type Floating_Point_Type_Access is not null access Program.Nodes.Floating_Point_Types .Implicit_Floating_Point_Type with Storage_Pool => Program.Storage_Pools.Pool; type Ordinary_Fixed_Point_Type_Access is not null access Program.Nodes.Ordinary_Fixed_Point_Types .Implicit_Ordinary_Fixed_Point_Type with Storage_Pool => Program.Storage_Pools.Pool; type Decimal_Fixed_Point_Type_Access is not null access Program.Nodes.Decimal_Fixed_Point_Types .Implicit_Decimal_Fixed_Point_Type with Storage_Pool => Program.Storage_Pools.Pool; type Unconstrained_Array_Type_Access is not null access Program.Nodes.Unconstrained_Array_Types .Implicit_Unconstrained_Array_Type with Storage_Pool => Program.Storage_Pools.Pool; type Constrained_Array_Type_Access is not null access Program.Nodes.Constrained_Array_Types .Implicit_Constrained_Array_Type with Storage_Pool => Program.Storage_Pools.Pool; type Record_Type_Access is not null access Program.Nodes.Record_Types.Implicit_Record_Type with Storage_Pool => Program.Storage_Pools.Pool; type Interface_Type_Access is not null access Program.Nodes.Interface_Types.Implicit_Interface_Type with Storage_Pool => Program.Storage_Pools.Pool; type Object_Access_Type_Access is not null access Program.Nodes.Object_Access_Types .Implicit_Object_Access_Type with Storage_Pool => Program.Storage_Pools.Pool; type Procedure_Access_Type_Access is not null access Program.Nodes.Procedure_Access_Types .Implicit_Procedure_Access_Type with Storage_Pool => Program.Storage_Pools.Pool; type Function_Access_Type_Access is not null access Program.Nodes.Function_Access_Types .Implicit_Function_Access_Type with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Private_Type_Definition_Access is not null access Program.Nodes.Formal_Private_Type_Definitions .Implicit_Formal_Private_Type_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Derived_Type_Definition_Access is not null access Program.Nodes.Formal_Derived_Type_Definitions .Implicit_Formal_Derived_Type_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Discrete_Type_Definition_Access is not null access Program.Nodes.Formal_Discrete_Type_Definitions .Implicit_Formal_Discrete_Type_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Signed_Integer_Type_Definition_Access is not null access Program.Nodes.Formal_Signed_Integer_Type_Definitions .Implicit_Formal_Signed_Integer_Type_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Modular_Type_Definition_Access is not null access Program.Nodes.Formal_Modular_Type_Definitions .Implicit_Formal_Modular_Type_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Floating_Point_Definition_Access is not null access Program.Nodes.Formal_Floating_Point_Definitions .Implicit_Formal_Floating_Point_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Ordinary_Fixed_Point_Definition_Access is not null access Program.Nodes.Formal_Ordinary_Fixed_Point_Definitions .Implicit_Formal_Ordinary_Fixed_Point_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Decimal_Fixed_Point_Definition_Access is not null access Program.Nodes.Formal_Decimal_Fixed_Point_Definitions .Implicit_Formal_Decimal_Fixed_Point_Definition with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Unconstrained_Array_Type_Access is not null access Program.Nodes.Formal_Unconstrained_Array_Types .Implicit_Formal_Unconstrained_Array_Type with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Constrained_Array_Type_Access is not null access Program.Nodes.Formal_Constrained_Array_Types .Implicit_Formal_Constrained_Array_Type with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Object_Access_Type_Access is not null access Program.Nodes.Formal_Object_Access_Types .Implicit_Formal_Object_Access_Type with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Procedure_Access_Type_Access is not null access Program.Nodes.Formal_Procedure_Access_Types .Implicit_Formal_Procedure_Access_Type with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Function_Access_Type_Access is not null access Program.Nodes.Formal_Function_Access_Types .Implicit_Formal_Function_Access_Type with Storage_Pool => Program.Storage_Pools.Pool; type Formal_Interface_Type_Access is not null access Program.Nodes.Formal_Interface_Types .Implicit_Formal_Interface_Type with Storage_Pool => Program.Storage_Pools.Pool; type Range_Attribute_Reference_Access is not null access Program.Nodes.Range_Attribute_References .Implicit_Range_Attribute_Reference with Storage_Pool => Program.Storage_Pools.Pool; type Simple_Expression_Range_Access is not null access Program.Nodes.Simple_Expression_Ranges .Implicit_Simple_Expression_Range with Storage_Pool => Program.Storage_Pools.Pool; type Digits_Constraint_Access is not null access Program.Nodes.Digits_Constraints .Implicit_Digits_Constraint with Storage_Pool => Program.Storage_Pools.Pool; type Delta_Constraint_Access is not null access Program.Nodes.Delta_Constraints.Implicit_Delta_Constraint with Storage_Pool => Program.Storage_Pools.Pool; type Index_Constraint_Access is not null access Program.Nodes.Index_Constraints.Implicit_Index_Constraint with Storage_Pool => Program.Storage_Pools.Pool; type Discriminant_Constraint_Access is not null access Program.Nodes.Discriminant_Constraints .Implicit_Discriminant_Constraint with Storage_Pool => Program.Storage_Pools.Pool; type Attribute_Definition_Clause_Access is not null access Program.Nodes.Attribute_Definition_Clauses .Implicit_Attribute_Definition_Clause with Storage_Pool => Program.Storage_Pools.Pool; type Enumeration_Representation_Clause_Access is not null access Program.Nodes.Enumeration_Representation_Clauses .Implicit_Enumeration_Representation_Clause with Storage_Pool => Program.Storage_Pools.Pool; type Record_Representation_Clause_Access is not null access Program.Nodes.Record_Representation_Clauses .Implicit_Record_Representation_Clause with Storage_Pool => Program.Storage_Pools.Pool; type At_Clause_Access is not null access Program.Nodes.At_Clauses.Implicit_At_Clause with Storage_Pool => Program.Storage_Pools.Pool; type Exception_Handler_Access is not null access Program.Nodes.Exception_Handlers .Implicit_Exception_Handler with Storage_Pool => Program.Storage_Pools.Pool; not overriding function Create_Pragma (Self : Element_Factory; 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 not null Program.Elements.Pragmas.Pragma_Access is Result : constant Pragma_Access := new (Self.Subpool) Program.Nodes.Pragmas.Implicit_Pragma' (Program.Nodes.Pragmas.Create (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)); begin return Program.Elements.Pragmas.Pragma_Access (Result); end Create_Pragma; not overriding function Create_Defining_Identifier (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access is Result : constant Defining_Identifier_Access := new (Self.Subpool) Program.Nodes.Defining_Identifiers .Implicit_Defining_Identifier' (Program.Nodes.Defining_Identifiers.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Defining_Identifiers.Defining_Identifier_Access (Result); end Create_Defining_Identifier; not overriding function Create_Defining_Character_Literal (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Defining_Character_Literals .Defining_Character_Literal_Access is Result : constant Defining_Character_Literal_Access := new (Self.Subpool) Program.Nodes.Defining_Character_Literals .Implicit_Defining_Character_Literal' (Program.Nodes.Defining_Character_Literals.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Defining_Character_Literals .Defining_Character_Literal_Access (Result); end Create_Defining_Character_Literal; not overriding function Create_Defining_Operator_Symbol (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Defining_Operator_Symbols .Defining_Operator_Symbol_Access is Result : constant Defining_Operator_Symbol_Access := new (Self.Subpool) Program.Nodes.Defining_Operator_Symbols .Implicit_Defining_Operator_Symbol' (Program.Nodes.Defining_Operator_Symbols.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Defining_Operator_Symbols .Defining_Operator_Symbol_Access (Result); end Create_Defining_Operator_Symbol; not overriding function Create_Defining_Expanded_Name (Self : Element_Factory; Prefix : not null Program.Elements.Expressions .Expression_Access; Selector : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Defining_Expanded_Names .Defining_Expanded_Name_Access is Result : constant Defining_Expanded_Name_Access := new (Self.Subpool) Program.Nodes.Defining_Expanded_Names .Implicit_Defining_Expanded_Name' (Program.Nodes.Defining_Expanded_Names.Create (Prefix => Prefix, Selector => Selector, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Defining_Expanded_Names .Defining_Expanded_Name_Access (Result); end Create_Defining_Expanded_Name; not overriding function Create_Type_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Discriminant_Part : Program.Elements.Definitions.Definition_Access; Definition : not null Program.Elements.Definitions .Definition_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Type_Declarations .Type_Declaration_Access is Result : constant Type_Declaration_Access := new (Self.Subpool) Program.Nodes.Type_Declarations .Implicit_Type_Declaration' (Program.Nodes.Type_Declarations.Create (Name => Name, Discriminant_Part => Discriminant_Part, Definition => Definition, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Type_Declarations.Type_Declaration_Access (Result); end Create_Type_Declaration; not overriding function Create_Task_Type_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Discriminant_Part : Program.Elements.Known_Discriminant_Parts .Known_Discriminant_Part_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Definition : not null Program.Elements.Task_Definitions .Task_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Task_Type_Declarations .Task_Type_Declaration_Access is Result : constant Task_Type_Declaration_Access := new (Self.Subpool) Program.Nodes.Task_Type_Declarations .Implicit_Task_Type_Declaration' (Program.Nodes.Task_Type_Declarations.Create (Name => Name, Discriminant_Part => Discriminant_Part, Aspects => Aspects, Progenitors => Progenitors, Definition => Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Task_Type_Declarations .Task_Type_Declaration_Access (Result); end Create_Task_Type_Declaration; not overriding function Create_Protected_Type_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Discriminant_Part : Program.Elements.Known_Discriminant_Parts .Known_Discriminant_Part_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Definition : not null Program.Elements.Protected_Definitions .Protected_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Protected_Type_Declarations .Protected_Type_Declaration_Access is Result : constant Protected_Type_Declaration_Access := new (Self.Subpool) Program.Nodes.Protected_Type_Declarations .Implicit_Protected_Type_Declaration' (Program.Nodes.Protected_Type_Declarations.Create (Name => Name, Discriminant_Part => Discriminant_Part, Aspects => Aspects, Progenitors => Progenitors, Definition => Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Protected_Type_Declarations .Protected_Type_Declaration_Access (Result); end Create_Protected_Type_Declaration; not overriding function Create_Subtype_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Subtype_Indication : not null Program.Elements.Subtype_Indications .Subtype_Indication_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Subtype_Declarations .Subtype_Declaration_Access is Result : constant Subtype_Declaration_Access := new (Self.Subpool) Program.Nodes.Subtype_Declarations .Implicit_Subtype_Declaration' (Program.Nodes.Subtype_Declarations.Create (Name => Name, Subtype_Indication => Subtype_Indication, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Subtype_Declarations.Subtype_Declaration_Access (Result); end Create_Subtype_Declaration; not overriding function Create_Object_Declaration (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Object_Subtype : not null Program.Elements.Definitions .Definition_Access; Initialization_Expression : Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Aliased : Boolean := False; Has_Constant : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Object_Declarations .Object_Declaration_Access is Result : constant Object_Declaration_Access := new (Self.Subpool) Program.Nodes.Object_Declarations .Implicit_Object_Declaration' (Program.Nodes.Object_Declarations.Create (Names => Names, Object_Subtype => Object_Subtype, Initialization_Expression => Initialization_Expression, Aspects => Aspects, Has_Aliased => Has_Aliased, Has_Constant => Has_Constant, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Object_Declarations.Object_Declaration_Access (Result); end Create_Object_Declaration; not overriding function Create_Single_Task_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Definition : not null Program.Elements.Task_Definitions .Task_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Single_Task_Declarations .Single_Task_Declaration_Access is Result : constant Single_Task_Declaration_Access := new (Self.Subpool) Program.Nodes.Single_Task_Declarations .Implicit_Single_Task_Declaration' (Program.Nodes.Single_Task_Declarations.Create (Name => Name, Aspects => Aspects, Progenitors => Progenitors, Definition => Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Single_Task_Declarations .Single_Task_Declaration_Access (Result); end Create_Single_Task_Declaration; not overriding function Create_Single_Protected_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Definition : not null Program.Elements.Protected_Definitions .Protected_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Single_Protected_Declarations .Single_Protected_Declaration_Access is Result : constant Single_Protected_Declaration_Access := new (Self.Subpool) Program.Nodes.Single_Protected_Declarations .Implicit_Single_Protected_Declaration' (Program.Nodes.Single_Protected_Declarations.Create (Name => Name, Aspects => Aspects, Progenitors => Progenitors, Definition => Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Single_Protected_Declarations .Single_Protected_Declaration_Access (Result); end Create_Single_Protected_Declaration; not overriding function Create_Number_Declaration (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Number_Declarations .Number_Declaration_Access is Result : constant Number_Declaration_Access := new (Self.Subpool) Program.Nodes.Number_Declarations .Implicit_Number_Declaration' (Program.Nodes.Number_Declarations.Create (Names => Names, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Number_Declarations.Number_Declaration_Access (Result); end Create_Number_Declaration; not overriding function Create_Enumeration_Literal_Specification (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Enumeration_Literal_Specifications .Enumeration_Literal_Specification_Access is Result : constant Enumeration_Literal_Specification_Access := new (Self.Subpool) Program.Nodes.Enumeration_Literal_Specifications .Implicit_Enumeration_Literal_Specification' (Program.Nodes.Enumeration_Literal_Specifications.Create (Name => Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Enumeration_Literal_Specifications .Enumeration_Literal_Specification_Access (Result); end Create_Enumeration_Literal_Specification; not overriding function Create_Discriminant_Specification (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Object_Subtype : not null Program.Elements.Element_Access; Default_Expression : Program.Elements.Expressions.Expression_Access; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Discriminant_Specifications .Discriminant_Specification_Access is Result : constant Discriminant_Specification_Access := new (Self.Subpool) Program.Nodes.Discriminant_Specifications .Implicit_Discriminant_Specification' (Program.Nodes.Discriminant_Specifications.Create (Names => Names, Object_Subtype => Object_Subtype, Default_Expression => Default_Expression, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Discriminant_Specifications .Discriminant_Specification_Access (Result); end Create_Discriminant_Specification; not overriding function Create_Component_Declaration (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Object_Subtype : not null Program.Elements.Component_Definitions .Component_Definition_Access; Default_Expression : Program.Elements.Expressions.Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Component_Declarations .Component_Declaration_Access is Result : constant Component_Declaration_Access := new (Self.Subpool) Program.Nodes.Component_Declarations .Implicit_Component_Declaration' (Program.Nodes.Component_Declarations.Create (Names => Names, Object_Subtype => Object_Subtype, Default_Expression => Default_Expression, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Component_Declarations .Component_Declaration_Access (Result); end Create_Component_Declaration; not overriding function Create_Loop_Parameter_Specification (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Definition : not null Program.Elements.Discrete_Ranges .Discrete_Range_Access; Has_Reverse : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Loop_Parameter_Specifications .Loop_Parameter_Specification_Access is Result : constant Loop_Parameter_Specification_Access := new (Self.Subpool) Program.Nodes.Loop_Parameter_Specifications .Implicit_Loop_Parameter_Specification' (Program.Nodes.Loop_Parameter_Specifications.Create (Name => Name, Definition => Definition, Has_Reverse => Has_Reverse, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Loop_Parameter_Specifications .Loop_Parameter_Specification_Access (Result); end Create_Loop_Parameter_Specification; not overriding function Create_Generalized_Iterator_Specification (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Iterator_Name : not null Program.Elements.Expressions .Expression_Access; Has_Reverse : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Generalized_Iterator_Specifications .Generalized_Iterator_Specification_Access is Result : constant Generalized_Iterator_Specification_Access := new (Self.Subpool) Program.Nodes.Generalized_Iterator_Specifications .Implicit_Generalized_Iterator_Specification' (Program.Nodes.Generalized_Iterator_Specifications.Create (Name => Name, Iterator_Name => Iterator_Name, Has_Reverse => Has_Reverse, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Generalized_Iterator_Specifications .Generalized_Iterator_Specification_Access (Result); end Create_Generalized_Iterator_Specification; not overriding function Create_Element_Iterator_Specification (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Subtype_Indication : not null Program.Elements.Subtype_Indications .Subtype_Indication_Access; Iterable_Name : not null Program.Elements.Expressions .Expression_Access; Has_Reverse : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Element_Iterator_Specifications .Element_Iterator_Specification_Access is Result : constant Element_Iterator_Specification_Access := new (Self.Subpool) Program.Nodes.Element_Iterator_Specifications .Implicit_Element_Iterator_Specification' (Program.Nodes.Element_Iterator_Specifications.Create (Name => Name, Subtype_Indication => Subtype_Indication, Iterable_Name => Iterable_Name, Has_Reverse => Has_Reverse, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Element_Iterator_Specifications .Element_Iterator_Specification_Access (Result); end Create_Element_Iterator_Specification; not overriding function Create_Procedure_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Has_Abstract : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Procedure_Declarations .Procedure_Declaration_Access is Result : constant Procedure_Declaration_Access := new (Self.Subpool) Program.Nodes.Procedure_Declarations .Implicit_Procedure_Declaration' (Program.Nodes.Procedure_Declarations.Create (Name => Name, Parameters => Parameters, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Has_Abstract => Has_Abstract, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Procedure_Declarations .Procedure_Declaration_Access (Result); end Create_Procedure_Declaration; not overriding function Create_Function_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Result_Expression : Program.Elements.Parenthesized_Expressions .Parenthesized_Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Has_Abstract : Boolean := False; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Function_Declarations .Function_Declaration_Access is Result : constant Function_Declaration_Access := new (Self.Subpool) Program.Nodes.Function_Declarations .Implicit_Function_Declaration' (Program.Nodes.Function_Declarations.Create (Name => Name, Parameters => Parameters, Result_Subtype => Result_Subtype, Result_Expression => Result_Expression, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Has_Abstract => Has_Abstract, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Function_Declarations.Function_Declaration_Access (Result); end Create_Function_Declaration; not overriding function Create_Parameter_Specification (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Parameter_Subtype : not null Program.Elements.Element_Access; Default_Expression : Program.Elements.Expressions.Expression_Access; Has_Aliased : Boolean := False; Has_In : Boolean := False; Has_Out : Boolean := False; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Parameter_Specifications .Parameter_Specification_Access is Result : constant Parameter_Specification_Access := new (Self.Subpool) Program.Nodes.Parameter_Specifications .Implicit_Parameter_Specification' (Program.Nodes.Parameter_Specifications.Create (Names => Names, Parameter_Subtype => Parameter_Subtype, Default_Expression => Default_Expression, Has_Aliased => Has_Aliased, Has_In => Has_In, Has_Out => Has_Out, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Parameter_Specifications .Parameter_Specification_Access (Result); end Create_Parameter_Specification; not overriding function Create_Procedure_Body_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Name : Program.Elements.Expressions.Expression_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Procedure_Body_Declarations .Procedure_Body_Declaration_Access is Result : constant Procedure_Body_Declaration_Access := new (Self.Subpool) Program.Nodes.Procedure_Body_Declarations .Implicit_Procedure_Body_Declaration' (Program.Nodes.Procedure_Body_Declarations.Create (Name => Name, Parameters => Parameters, Aspects => Aspects, Declarations => Declarations, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Name => End_Name, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Procedure_Body_Declarations .Procedure_Body_Declaration_Access (Result); end Create_Procedure_Body_Declaration; not overriding function Create_Function_Body_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Name : Program.Elements.Expressions.Expression_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Function_Body_Declarations .Function_Body_Declaration_Access is Result : constant Function_Body_Declaration_Access := new (Self.Subpool) Program.Nodes.Function_Body_Declarations .Implicit_Function_Body_Declaration' (Program.Nodes.Function_Body_Declarations.Create (Name => Name, Parameters => Parameters, Result_Subtype => Result_Subtype, Aspects => Aspects, Declarations => Declarations, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Name => End_Name, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Function_Body_Declarations .Function_Body_Declaration_Access (Result); end Create_Function_Body_Declaration; not overriding function Create_Return_Object_Specification (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Object_Subtype : not null Program.Elements.Element_Access; Expression : Program.Elements.Expressions.Expression_Access; Has_Aliased : Boolean := False; Has_Constant : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Return_Object_Specifications .Return_Object_Specification_Access is Result : constant Return_Object_Specification_Access := new (Self.Subpool) Program.Nodes.Return_Object_Specifications .Implicit_Return_Object_Specification' (Program.Nodes.Return_Object_Specifications.Create (Name => Name, Object_Subtype => Object_Subtype, Expression => Expression, Has_Aliased => Has_Aliased, Has_Constant => Has_Constant, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Return_Object_Specifications .Return_Object_Specification_Access (Result); end Create_Return_Object_Specification; not overriding function Create_Package_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Visible_Declarations : Program.Element_Vectors.Element_Vector_Access; Private_Declarations : Program.Element_Vectors.Element_Vector_Access; End_Name : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Package_Declarations .Package_Declaration_Access is Result : constant Package_Declaration_Access := new (Self.Subpool) Program.Nodes.Package_Declarations .Implicit_Package_Declaration' (Program.Nodes.Package_Declarations.Create (Name => Name, Aspects => Aspects, Visible_Declarations => Visible_Declarations, Private_Declarations => Private_Declarations, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Package_Declarations.Package_Declaration_Access (Result); end Create_Package_Declaration; not overriding function Create_Package_Body_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Name : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Package_Body_Declarations .Package_Body_Declaration_Access is Result : constant Package_Body_Declaration_Access := new (Self.Subpool) Program.Nodes.Package_Body_Declarations .Implicit_Package_Body_Declaration' (Program.Nodes.Package_Body_Declarations.Create (Name => Name, Aspects => Aspects, Declarations => Declarations, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Package_Body_Declarations .Package_Body_Declaration_Access (Result); end Create_Package_Body_Declaration; not overriding function Create_Object_Renaming_Declaration (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Object_Subtype : not null Program.Elements.Element_Access; Renamed_Object : not null Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Object_Renaming_Declarations .Object_Renaming_Declaration_Access is Result : constant Object_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes.Object_Renaming_Declarations .Implicit_Object_Renaming_Declaration' (Program.Nodes.Object_Renaming_Declarations.Create (Names => Names, Object_Subtype => Object_Subtype, Renamed_Object => Renamed_Object, Aspects => Aspects, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Object_Renaming_Declarations .Object_Renaming_Declaration_Access (Result); end Create_Object_Renaming_Declaration; not overriding function Create_Exception_Renaming_Declaration (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Renamed_Exception : not null Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration_Access is Result : constant Exception_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes.Exception_Renaming_Declarations .Implicit_Exception_Renaming_Declaration' (Program.Nodes.Exception_Renaming_Declarations.Create (Names => Names, Renamed_Exception => Renamed_Exception, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration_Access (Result); end Create_Exception_Renaming_Declaration; not overriding function Create_Procedure_Renaming_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Renamed_Procedure : Program.Elements.Expressions.Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Procedure_Renaming_Declarations .Procedure_Renaming_Declaration_Access is Result : constant Procedure_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes.Procedure_Renaming_Declarations .Implicit_Procedure_Renaming_Declaration' (Program.Nodes.Procedure_Renaming_Declarations.Create (Name => Name, Parameters => Parameters, Renamed_Procedure => Renamed_Procedure, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Procedure_Renaming_Declarations .Procedure_Renaming_Declaration_Access (Result); end Create_Procedure_Renaming_Declaration; not overriding function Create_Function_Renaming_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Renamed_Function : Program.Elements.Expressions.Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Function_Renaming_Declarations .Function_Renaming_Declaration_Access is Result : constant Function_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes.Function_Renaming_Declarations .Implicit_Function_Renaming_Declaration' (Program.Nodes.Function_Renaming_Declarations.Create (Name => Name, Parameters => Parameters, Result_Subtype => Result_Subtype, Renamed_Function => Renamed_Function, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Function_Renaming_Declarations .Function_Renaming_Declaration_Access (Result); end Create_Function_Renaming_Declaration; not overriding function Create_Package_Renaming_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Renamed_Package : not null Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Package_Renaming_Declarations .Package_Renaming_Declaration_Access is Result : constant Package_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes.Package_Renaming_Declarations .Implicit_Package_Renaming_Declaration' (Program.Nodes.Package_Renaming_Declarations.Create (Name => Name, Renamed_Package => Renamed_Package, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Package_Renaming_Declarations .Package_Renaming_Declaration_Access (Result); end Create_Package_Renaming_Declaration; not overriding function Create_Generic_Package_Renaming_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Renamed_Package : not null Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Generic_Package_Renaming_Declarations .Generic_Package_Renaming_Declaration_Access is Result : constant Generic_Package_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes .Generic_Package_Renaming_Declarations .Implicit_Generic_Package_Renaming_Declaration' (Program.Nodes.Generic_Package_Renaming_Declarations.Create (Name => Name, Renamed_Package => Renamed_Package, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Generic_Package_Renaming_Declarations .Generic_Package_Renaming_Declaration_Access (Result); end Create_Generic_Package_Renaming_Declaration; not overriding function Create_Generic_Procedure_Renaming_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Renamed_Procedure : not null Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Generic_Procedure_Renaming_Declarations .Generic_Procedure_Renaming_Declaration_Access is Result : constant Generic_Procedure_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes .Generic_Procedure_Renaming_Declarations .Implicit_Generic_Procedure_Renaming_Declaration' (Program.Nodes.Generic_Procedure_Renaming_Declarations.Create (Name => Name, Renamed_Procedure => Renamed_Procedure, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Generic_Procedure_Renaming_Declarations .Generic_Procedure_Renaming_Declaration_Access (Result); end Create_Generic_Procedure_Renaming_Declaration; not overriding function Create_Generic_Function_Renaming_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Renamed_Function : not null Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Generic_Function_Renaming_Declarations .Generic_Function_Renaming_Declaration_Access is Result : constant Generic_Function_Renaming_Declaration_Access := new (Self.Subpool) Program.Nodes .Generic_Function_Renaming_Declarations .Implicit_Generic_Function_Renaming_Declaration' (Program.Nodes.Generic_Function_Renaming_Declarations.Create (Name => Name, Renamed_Function => Renamed_Function, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Generic_Function_Renaming_Declarations .Generic_Function_Renaming_Declaration_Access (Result); end Create_Generic_Function_Renaming_Declaration; not overriding function Create_Task_Body_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Name : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Task_Body_Declarations .Task_Body_Declaration_Access is Result : constant Task_Body_Declaration_Access := new (Self.Subpool) Program.Nodes.Task_Body_Declarations .Implicit_Task_Body_Declaration' (Program.Nodes.Task_Body_Declarations.Create (Name => Name, Aspects => Aspects, Declarations => Declarations, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Task_Body_Declarations .Task_Body_Declaration_Access (Result); end Create_Task_Body_Declaration; not overriding function Create_Protected_Body_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Protected_Operations : not null Program.Element_Vectors .Element_Vector_Access; End_Name : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Protected_Body_Declarations .Protected_Body_Declaration_Access is Result : constant Protected_Body_Declaration_Access := new (Self.Subpool) Program.Nodes.Protected_Body_Declarations .Implicit_Protected_Body_Declaration' (Program.Nodes.Protected_Body_Declarations.Create (Name => Name, Aspects => Aspects, Protected_Operations => Protected_Operations, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Protected_Body_Declarations .Protected_Body_Declaration_Access (Result); end Create_Protected_Body_Declaration; not overriding function Create_Entry_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Entry_Family_Definition : Program.Elements.Discrete_Ranges .Discrete_Range_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Entry_Declarations .Entry_Declaration_Access is Result : constant Entry_Declaration_Access := new (Self.Subpool) Program.Nodes.Entry_Declarations .Implicit_Entry_Declaration' (Program.Nodes.Entry_Declarations.Create (Name => Name, Entry_Family_Definition => Entry_Family_Definition, Parameters => Parameters, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Entry_Declarations.Entry_Declaration_Access (Result); end Create_Entry_Declaration; not overriding function Create_Entry_Body_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Entry_Index : not null Program.Elements .Entry_Index_Specifications.Entry_Index_Specification_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Entry_Barrier : not null Program.Elements.Expressions .Expression_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Name : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Entry_Body_Declarations .Entry_Body_Declaration_Access is Result : constant Entry_Body_Declaration_Access := new (Self.Subpool) Program.Nodes.Entry_Body_Declarations .Implicit_Entry_Body_Declaration' (Program.Nodes.Entry_Body_Declarations.Create (Name => Name, Entry_Index => Entry_Index, Parameters => Parameters, Entry_Barrier => Entry_Barrier, Declarations => Declarations, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Entry_Body_Declarations .Entry_Body_Declaration_Access (Result); end Create_Entry_Body_Declaration; not overriding function Create_Entry_Index_Specification (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Entry_Index_Subtype : not null Program.Elements.Discrete_Ranges .Discrete_Range_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Entry_Index_Specifications .Entry_Index_Specification_Access is Result : constant Entry_Index_Specification_Access := new (Self.Subpool) Program.Nodes.Entry_Index_Specifications .Implicit_Entry_Index_Specification' (Program.Nodes.Entry_Index_Specifications.Create (Name => Name, Entry_Index_Subtype => Entry_Index_Subtype, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Entry_Index_Specifications .Entry_Index_Specification_Access (Result); end Create_Entry_Index_Specification; not overriding function Create_Procedure_Body_Stub (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Procedure_Body_Stubs .Procedure_Body_Stub_Access is Result : constant Procedure_Body_Stub_Access := new (Self.Subpool) Program.Nodes.Procedure_Body_Stubs .Implicit_Procedure_Body_Stub' (Program.Nodes.Procedure_Body_Stubs.Create (Name => Name, Parameters => Parameters, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Procedure_Body_Stubs.Procedure_Body_Stub_Access (Result); end Create_Procedure_Body_Stub; not overriding function Create_Function_Body_Stub (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Function_Body_Stubs .Function_Body_Stub_Access is Result : constant Function_Body_Stub_Access := new (Self.Subpool) Program.Nodes.Function_Body_Stubs .Implicit_Function_Body_Stub' (Program.Nodes.Function_Body_Stubs.Create (Name => Name, Parameters => Parameters, Result_Subtype => Result_Subtype, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Function_Body_Stubs.Function_Body_Stub_Access (Result); end Create_Function_Body_Stub; not overriding function Create_Package_Body_Stub (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Package_Body_Stubs .Package_Body_Stub_Access is Result : constant Package_Body_Stub_Access := new (Self.Subpool) Program.Nodes.Package_Body_Stubs .Implicit_Package_Body_Stub' (Program.Nodes.Package_Body_Stubs.Create (Name => Name, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Package_Body_Stubs.Package_Body_Stub_Access (Result); end Create_Package_Body_Stub; not overriding function Create_Task_Body_Stub (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Task_Body_Stubs.Task_Body_Stub_Access is Result : constant Task_Body_Stub_Access := new (Self.Subpool) Program.Nodes.Task_Body_Stubs .Implicit_Task_Body_Stub' (Program.Nodes.Task_Body_Stubs.Create (Name => Name, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Task_Body_Stubs.Task_Body_Stub_Access (Result); end Create_Task_Body_Stub; not overriding function Create_Protected_Body_Stub (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Protected_Body_Stubs .Protected_Body_Stub_Access is Result : constant Protected_Body_Stub_Access := new (Self.Subpool) Program.Nodes.Protected_Body_Stubs .Implicit_Protected_Body_Stub' (Program.Nodes.Protected_Body_Stubs.Create (Name => Name, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Protected_Body_Stubs.Protected_Body_Stub_Access (Result); end Create_Protected_Body_Stub; not overriding function Create_Exception_Declaration (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Exception_Declarations .Exception_Declaration_Access is Result : constant Exception_Declaration_Access := new (Self.Subpool) Program.Nodes.Exception_Declarations .Implicit_Exception_Declaration' (Program.Nodes.Exception_Declarations.Create (Names => Names, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Exception_Declarations .Exception_Declaration_Access (Result); end Create_Exception_Declaration; not overriding function Create_Choice_Parameter_Specification (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Choice_Parameter_Specifications .Choice_Parameter_Specification_Access is Result : constant Choice_Parameter_Specification_Access := new (Self.Subpool) Program.Nodes.Choice_Parameter_Specifications .Implicit_Choice_Parameter_Specification' (Program.Nodes.Choice_Parameter_Specifications.Create (Name => Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Choice_Parameter_Specifications .Choice_Parameter_Specification_Access (Result); end Create_Choice_Parameter_Specification; not overriding function Create_Generic_Package_Declaration (Self : Element_Factory; Formal_Parameters : Program.Element_Vectors.Element_Vector_Access; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Visible_Declarations : Program.Element_Vectors.Element_Vector_Access; Private_Declarations : Program.Element_Vectors.Element_Vector_Access; End_Name : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Generic_Package_Declarations .Generic_Package_Declaration_Access is Result : constant Generic_Package_Declaration_Access := new (Self.Subpool) Program.Nodes.Generic_Package_Declarations .Implicit_Generic_Package_Declaration' (Program.Nodes.Generic_Package_Declarations.Create (Formal_Parameters => Formal_Parameters, Name => Name, Aspects => Aspects, Visible_Declarations => Visible_Declarations, Private_Declarations => Private_Declarations, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Generic_Package_Declarations .Generic_Package_Declaration_Access (Result); end Create_Generic_Package_Declaration; not overriding function Create_Generic_Procedure_Declaration (Self : Element_Factory; Formal_Parameters : Program.Element_Vectors.Element_Vector_Access; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Generic_Procedure_Declarations .Generic_Procedure_Declaration_Access is Result : constant Generic_Procedure_Declaration_Access := new (Self.Subpool) Program.Nodes.Generic_Procedure_Declarations .Implicit_Generic_Procedure_Declaration' (Program.Nodes.Generic_Procedure_Declarations.Create (Formal_Parameters => Formal_Parameters, Name => Name, Parameters => Parameters, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Generic_Procedure_Declarations .Generic_Procedure_Declaration_Access (Result); end Create_Generic_Procedure_Declaration; not overriding function Create_Generic_Function_Declaration (Self : Element_Factory; Formal_Parameters : Program.Element_Vectors.Element_Vector_Access; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Generic_Function_Declarations .Generic_Function_Declaration_Access is Result : constant Generic_Function_Declaration_Access := new (Self.Subpool) Program.Nodes.Generic_Function_Declarations .Implicit_Generic_Function_Declaration' (Program.Nodes.Generic_Function_Declarations.Create (Formal_Parameters => Formal_Parameters, Name => Name, Parameters => Parameters, Result_Subtype => Result_Subtype, Aspects => Aspects, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Generic_Function_Declarations .Generic_Function_Declaration_Access (Result); end Create_Generic_Function_Declaration; not overriding function Create_Package_Instantiation (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Generic_Package_Name : not null Program.Elements.Expressions .Expression_Access; Parameters : Program.Elements.Parameter_Associations .Parameter_Association_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Package_Instantiations .Package_Instantiation_Access is Result : constant Package_Instantiation_Access := new (Self.Subpool) Program.Nodes.Package_Instantiations .Implicit_Package_Instantiation' (Program.Nodes.Package_Instantiations.Create (Name => Name, Generic_Package_Name => Generic_Package_Name, Parameters => Parameters, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Package_Instantiations .Package_Instantiation_Access (Result); end Create_Package_Instantiation; not overriding function Create_Procedure_Instantiation (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Generic_Procedure_Name : not null Program.Elements.Expressions .Expression_Access; Parameters : Program.Elements.Parameter_Associations .Parameter_Association_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Procedure_Instantiations .Procedure_Instantiation_Access is Result : constant Procedure_Instantiation_Access := new (Self.Subpool) Program.Nodes.Procedure_Instantiations .Implicit_Procedure_Instantiation' (Program.Nodes.Procedure_Instantiations.Create (Name => Name, Generic_Procedure_Name => Generic_Procedure_Name, Parameters => Parameters, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Procedure_Instantiations .Procedure_Instantiation_Access (Result); end Create_Procedure_Instantiation; not overriding function Create_Function_Instantiation (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Generic_Function_Name : not null Program.Elements.Expressions .Expression_Access; Parameters : Program.Elements.Parameter_Associations .Parameter_Association_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not : Boolean := False; Has_Overriding : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Function_Instantiations .Function_Instantiation_Access is Result : constant Function_Instantiation_Access := new (Self.Subpool) Program.Nodes.Function_Instantiations .Implicit_Function_Instantiation' (Program.Nodes.Function_Instantiations.Create (Name => Name, Generic_Function_Name => Generic_Function_Name, Parameters => Parameters, Aspects => Aspects, Has_Not => Has_Not, Has_Overriding => Has_Overriding, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Function_Instantiations .Function_Instantiation_Access (Result); end Create_Function_Instantiation; not overriding function Create_Formal_Object_Declaration (Self : Element_Factory; Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Object_Subtype : not null Program.Elements.Element_Access; Default_Expression : Program.Elements.Expressions.Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_In : Boolean := False; Has_Out : Boolean := False; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Object_Declarations .Formal_Object_Declaration_Access is Result : constant Formal_Object_Declaration_Access := new (Self.Subpool) Program.Nodes.Formal_Object_Declarations .Implicit_Formal_Object_Declaration' (Program.Nodes.Formal_Object_Declarations.Create (Names => Names, Object_Subtype => Object_Subtype, Default_Expression => Default_Expression, Aspects => Aspects, Has_In => Has_In, Has_Out => Has_Out, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Object_Declarations .Formal_Object_Declaration_Access (Result); end Create_Formal_Object_Declaration; not overriding function Create_Formal_Type_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Discriminant_Part : Program.Elements.Definitions.Definition_Access; Definition : not null Program.Elements.Formal_Type_Definitions .Formal_Type_Definition_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Type_Declarations .Formal_Type_Declaration_Access is Result : constant Formal_Type_Declaration_Access := new (Self.Subpool) Program.Nodes.Formal_Type_Declarations .Implicit_Formal_Type_Declaration' (Program.Nodes.Formal_Type_Declarations.Create (Name => Name, Discriminant_Part => Discriminant_Part, Definition => Definition, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Type_Declarations .Formal_Type_Declaration_Access (Result); end Create_Formal_Type_Declaration; not overriding function Create_Formal_Procedure_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Subprogram_Default : Program.Elements.Expressions.Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Abstract : Boolean := False; Has_Null : Boolean := False; Has_Box : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Procedure_Declarations .Formal_Procedure_Declaration_Access is Result : constant Formal_Procedure_Declaration_Access := new (Self.Subpool) Program.Nodes.Formal_Procedure_Declarations .Implicit_Formal_Procedure_Declaration' (Program.Nodes.Formal_Procedure_Declarations.Create (Name => Name, Parameters => Parameters, Subprogram_Default => Subprogram_Default, Aspects => Aspects, Has_Abstract => Has_Abstract, Has_Null => Has_Null, Has_Box => Has_Box, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Procedure_Declarations .Formal_Procedure_Declaration_Access (Result); end Create_Formal_Procedure_Declaration; not overriding function Create_Formal_Function_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Names .Defining_Name_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Subprogram_Default : Program.Elements.Expressions.Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Has_Not_Null : Boolean := False; Has_Abstract : Boolean := False; Has_Box : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Function_Declarations .Formal_Function_Declaration_Access is Result : constant Formal_Function_Declaration_Access := new (Self.Subpool) Program.Nodes.Formal_Function_Declarations .Implicit_Formal_Function_Declaration' (Program.Nodes.Formal_Function_Declarations.Create (Name => Name, Parameters => Parameters, Result_Subtype => Result_Subtype, Subprogram_Default => Subprogram_Default, Aspects => Aspects, Has_Not_Null => Has_Not_Null, Has_Abstract => Has_Abstract, Has_Box => Has_Box, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Function_Declarations .Formal_Function_Declaration_Access (Result); end Create_Formal_Function_Declaration; not overriding function Create_Formal_Package_Declaration (Self : Element_Factory; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Generic_Package_Name : not null Program.Elements.Expressions .Expression_Access; Parameters : Program.Elements.Formal_Package_Associations .Formal_Package_Association_Vector_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Package_Declarations .Formal_Package_Declaration_Access is Result : constant Formal_Package_Declaration_Access := new (Self.Subpool) Program.Nodes.Formal_Package_Declarations .Implicit_Formal_Package_Declaration' (Program.Nodes.Formal_Package_Declarations.Create (Name => Name, Generic_Package_Name => Generic_Package_Name, Parameters => Parameters, Aspects => Aspects, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Package_Declarations .Formal_Package_Declaration_Access (Result); end Create_Formal_Package_Declaration; not overriding function Create_Subtype_Indication (Self : Element_Factory; Subtype_Mark : not null Program.Elements.Expressions .Expression_Access; Constraint : Program.Elements.Constraints.Constraint_Access; Has_Not_Null : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Subtype_Indications .Subtype_Indication_Access is Result : constant Subtype_Indication_Access := new (Self.Subpool) Program.Nodes.Subtype_Indications .Implicit_Subtype_Indication' (Program.Nodes.Subtype_Indications.Create (Subtype_Mark => Subtype_Mark, Constraint => Constraint, Has_Not_Null => Has_Not_Null, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Subtype_Indications.Subtype_Indication_Access (Result); end Create_Subtype_Indication; not overriding function Create_Component_Definition (Self : Element_Factory; Subtype_Indication : not null Program.Elements.Element_Access; Has_Aliased : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Component_Definitions .Component_Definition_Access is Result : constant Component_Definition_Access := new (Self.Subpool) Program.Nodes.Component_Definitions .Implicit_Component_Definition' (Program.Nodes.Component_Definitions.Create (Subtype_Indication => Subtype_Indication, Has_Aliased => Has_Aliased, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Component_Definitions.Component_Definition_Access (Result); end Create_Component_Definition; not overriding function Create_Discrete_Subtype_Indication (Self : Element_Factory; Subtype_Mark : not null Program.Elements.Expressions .Expression_Access; Constraint : Program.Elements.Constraints .Constraint_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False; Is_Discrete_Subtype_Definition : Boolean := False) return not null Program.Elements.Discrete_Subtype_Indications .Discrete_Subtype_Indication_Access is Result : constant Discrete_Subtype_Indication_Access := new (Self.Subpool) Program.Nodes.Discrete_Subtype_Indications .Implicit_Discrete_Subtype_Indication' (Program.Nodes.Discrete_Subtype_Indications.Create (Subtype_Mark => Subtype_Mark, Constraint => Constraint, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance, Is_Discrete_Subtype_Definition => Is_Discrete_Subtype_Definition)); begin return Program.Elements.Discrete_Subtype_Indications .Discrete_Subtype_Indication_Access (Result); end Create_Discrete_Subtype_Indication; not overriding function Create_Discrete_Range_Attribute_Reference (Self : Element_Factory; Range_Attribute : not null Program.Elements .Attribute_References.Attribute_Reference_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False; Is_Discrete_Subtype_Definition : Boolean := False) return not null Program.Elements.Discrete_Range_Attribute_References .Discrete_Range_Attribute_Reference_Access is Result : constant Discrete_Range_Attribute_Reference_Access := new (Self.Subpool) Program.Nodes.Discrete_Range_Attribute_References .Implicit_Discrete_Range_Attribute_Reference' (Program.Nodes.Discrete_Range_Attribute_References.Create (Range_Attribute => Range_Attribute, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance, Is_Discrete_Subtype_Definition => Is_Discrete_Subtype_Definition)); begin return Program.Elements.Discrete_Range_Attribute_References .Discrete_Range_Attribute_Reference_Access (Result); end Create_Discrete_Range_Attribute_Reference; not overriding function Create_Discrete_Simple_Expression_Range (Self : Element_Factory; Lower_Bound : not null Program.Elements.Expressions .Expression_Access; Upper_Bound : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False; Is_Discrete_Subtype_Definition : Boolean := False) return not null Program.Elements.Discrete_Simple_Expression_Ranges .Discrete_Simple_Expression_Range_Access is Result : constant Discrete_Simple_Expression_Range_Access := new (Self.Subpool) Program.Nodes.Discrete_Simple_Expression_Ranges .Implicit_Discrete_Simple_Expression_Range' (Program.Nodes.Discrete_Simple_Expression_Ranges.Create (Lower_Bound => Lower_Bound, Upper_Bound => Upper_Bound, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance, Is_Discrete_Subtype_Definition => Is_Discrete_Subtype_Definition)); begin return Program.Elements.Discrete_Simple_Expression_Ranges .Discrete_Simple_Expression_Range_Access (Result); end Create_Discrete_Simple_Expression_Range; not overriding function Create_Unknown_Discriminant_Part (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Unknown_Discriminant_Parts .Unknown_Discriminant_Part_Access is Result : constant Unknown_Discriminant_Part_Access := new (Self.Subpool) Program.Nodes.Unknown_Discriminant_Parts .Implicit_Unknown_Discriminant_Part' (Program.Nodes.Unknown_Discriminant_Parts.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Unknown_Discriminant_Parts .Unknown_Discriminant_Part_Access (Result); end Create_Unknown_Discriminant_Part; not overriding function Create_Known_Discriminant_Part (Self : Element_Factory; Discriminants : Program.Elements.Discriminant_Specifications .Discriminant_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Known_Discriminant_Parts .Known_Discriminant_Part_Access is Result : constant Known_Discriminant_Part_Access := new (Self.Subpool) Program.Nodes.Known_Discriminant_Parts .Implicit_Known_Discriminant_Part' (Program.Nodes.Known_Discriminant_Parts.Create (Discriminants => Discriminants, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Known_Discriminant_Parts .Known_Discriminant_Part_Access (Result); end Create_Known_Discriminant_Part; not overriding function Create_Record_Definition (Self : Element_Factory; Components : not null Program.Element_Vectors .Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Record_Definitions .Record_Definition_Access is Result : constant Record_Definition_Access := new (Self.Subpool) Program.Nodes.Record_Definitions .Implicit_Record_Definition' (Program.Nodes.Record_Definitions.Create (Components => Components, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Record_Definitions.Record_Definition_Access (Result); end Create_Record_Definition; not overriding function Create_Null_Component (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Null_Components.Null_Component_Access is Result : constant Null_Component_Access := new (Self.Subpool) Program.Nodes.Null_Components .Implicit_Null_Component' (Program.Nodes.Null_Components.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Null_Components.Null_Component_Access (Result); end Create_Null_Component; not overriding function Create_Variant_Part (Self : Element_Factory; Discriminant : not null Program.Elements.Identifiers .Identifier_Access; Variants : not null Program.Elements.Variants .Variant_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Variant_Parts.Variant_Part_Access is Result : constant Variant_Part_Access := new (Self.Subpool) Program.Nodes.Variant_Parts.Implicit_Variant_Part' (Program.Nodes.Variant_Parts.Create (Discriminant => Discriminant, Variants => Variants, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Variant_Parts.Variant_Part_Access (Result); end Create_Variant_Part; not overriding function Create_Variant (Self : Element_Factory; Choices : not null Program.Element_Vectors .Element_Vector_Access; Components : not null Program.Element_Vectors .Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Variants.Variant_Access is Result : constant Variant_Access := new (Self.Subpool) Program.Nodes.Variants.Implicit_Variant' (Program.Nodes.Variants.Create (Choices => Choices, Components => Components, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Variants.Variant_Access (Result); end Create_Variant; not overriding function Create_Others_Choice (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Others_Choices.Others_Choice_Access is Result : constant Others_Choice_Access := new (Self.Subpool) Program.Nodes.Others_Choices .Implicit_Others_Choice' (Program.Nodes.Others_Choices.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Others_Choices.Others_Choice_Access (Result); end Create_Others_Choice; not overriding function Create_Anonymous_Access_To_Object (Self : Element_Factory; Subtype_Indication : not null Program.Elements.Subtype_Indications .Subtype_Indication_Access; Has_Not_Null : Boolean := False; Has_All : Boolean := False; Has_Constant : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Anonymous_Access_To_Objects .Anonymous_Access_To_Object_Access is Result : constant Anonymous_Access_To_Object_Access := new (Self.Subpool) Program.Nodes.Anonymous_Access_To_Objects .Implicit_Anonymous_Access_To_Object' (Program.Nodes.Anonymous_Access_To_Objects.Create (Subtype_Indication => Subtype_Indication, Has_Not_Null => Has_Not_Null, Has_All => Has_All, Has_Constant => Has_Constant, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Anonymous_Access_To_Objects .Anonymous_Access_To_Object_Access (Result); end Create_Anonymous_Access_To_Object; not overriding function Create_Anonymous_Access_To_Procedure (Self : Element_Factory; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Has_Not_Null : Boolean := False; Has_Protected : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Anonymous_Access_To_Procedures .Anonymous_Access_To_Procedure_Access is Result : constant Anonymous_Access_To_Procedure_Access := new (Self.Subpool) Program.Nodes.Anonymous_Access_To_Procedures .Implicit_Anonymous_Access_To_Procedure' (Program.Nodes.Anonymous_Access_To_Procedures.Create (Parameters => Parameters, Has_Not_Null => Has_Not_Null, Has_Protected => Has_Protected, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Anonymous_Access_To_Procedures .Anonymous_Access_To_Procedure_Access (Result); end Create_Anonymous_Access_To_Procedure; not overriding function Create_Anonymous_Access_To_Function (Self : Element_Factory; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Has_Not_Null : Boolean := False; Has_Protected : Boolean := False; Has_Not_Null_2 : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Anonymous_Access_To_Functions .Anonymous_Access_To_Function_Access is Result : constant Anonymous_Access_To_Function_Access := new (Self.Subpool) Program.Nodes.Anonymous_Access_To_Functions .Implicit_Anonymous_Access_To_Function' (Program.Nodes.Anonymous_Access_To_Functions.Create (Parameters => Parameters, Result_Subtype => Result_Subtype, Has_Not_Null => Has_Not_Null, Has_Protected => Has_Protected, Has_Not_Null_2 => Has_Not_Null_2, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Anonymous_Access_To_Functions .Anonymous_Access_To_Function_Access (Result); end Create_Anonymous_Access_To_Function; not overriding function Create_Private_Type_Definition (Self : Element_Factory; Has_Abstract : Boolean := False; Has_Tagged : Boolean := False; Has_Limited : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Private_Type_Definitions .Private_Type_Definition_Access is Result : constant Private_Type_Definition_Access := new (Self.Subpool) Program.Nodes.Private_Type_Definitions .Implicit_Private_Type_Definition' (Program.Nodes.Private_Type_Definitions.Create (Has_Abstract => Has_Abstract, Has_Tagged => Has_Tagged, Has_Limited => Has_Limited, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Private_Type_Definitions .Private_Type_Definition_Access (Result); end Create_Private_Type_Definition; not overriding function Create_Private_Extension_Definition (Self : Element_Factory; Ancestor : not null Program.Elements.Subtype_Indications .Subtype_Indication_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Has_Abstract : Boolean := False; Has_Limited : Boolean := False; Has_Synchronized : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Private_Extension_Definitions .Private_Extension_Definition_Access is Result : constant Private_Extension_Definition_Access := new (Self.Subpool) Program.Nodes.Private_Extension_Definitions .Implicit_Private_Extension_Definition' (Program.Nodes.Private_Extension_Definitions.Create (Ancestor => Ancestor, Progenitors => Progenitors, Has_Abstract => Has_Abstract, Has_Limited => Has_Limited, Has_Synchronized => Has_Synchronized, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Private_Extension_Definitions .Private_Extension_Definition_Access (Result); end Create_Private_Extension_Definition; not overriding function Create_Incomplete_Type_Definition (Self : Element_Factory; Has_Tagged : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Incomplete_Type_Definitions .Incomplete_Type_Definition_Access is Result : constant Incomplete_Type_Definition_Access := new (Self.Subpool) Program.Nodes.Incomplete_Type_Definitions .Implicit_Incomplete_Type_Definition' (Program.Nodes.Incomplete_Type_Definitions.Create (Has_Tagged => Has_Tagged, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Incomplete_Type_Definitions .Incomplete_Type_Definition_Access (Result); end Create_Incomplete_Type_Definition; not overriding function Create_Task_Definition (Self : Element_Factory; Visible_Declarations : Program.Element_Vectors.Element_Vector_Access; Private_Declarations : Program.Element_Vectors.Element_Vector_Access; End_Name : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Task_Definitions .Task_Definition_Access is Result : constant Task_Definition_Access := new (Self.Subpool) Program.Nodes.Task_Definitions .Implicit_Task_Definition' (Program.Nodes.Task_Definitions.Create (Visible_Declarations => Visible_Declarations, Private_Declarations => Private_Declarations, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Task_Definitions.Task_Definition_Access (Result); end Create_Task_Definition; not overriding function Create_Protected_Definition (Self : Element_Factory; Visible_Declarations : Program.Element_Vectors.Element_Vector_Access; Private_Declarations : Program.Element_Vectors.Element_Vector_Access; End_Name : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Protected_Definitions .Protected_Definition_Access is Result : constant Protected_Definition_Access := new (Self.Subpool) Program.Nodes.Protected_Definitions .Implicit_Protected_Definition' (Program.Nodes.Protected_Definitions.Create (Visible_Declarations => Visible_Declarations, Private_Declarations => Private_Declarations, End_Name => End_Name, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Protected_Definitions.Protected_Definition_Access (Result); end Create_Protected_Definition; not overriding function Create_Aspect_Specification (Self : Element_Factory; Aspect_Mark : not null Program.Elements.Expressions .Expression_Access; Aspect_Definition : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Aspect_Specifications .Aspect_Specification_Access is Result : constant Aspect_Specification_Access := new (Self.Subpool) Program.Nodes.Aspect_Specifications .Implicit_Aspect_Specification' (Program.Nodes.Aspect_Specifications.Create (Aspect_Mark => Aspect_Mark, Aspect_Definition => Aspect_Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Aspect_Specifications.Aspect_Specification_Access (Result); end Create_Aspect_Specification; not overriding function Create_Real_Range_Specification (Self : Element_Factory; Lower_Bound : not null Program.Elements.Expressions .Expression_Access; Upper_Bound : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Real_Range_Specifications .Real_Range_Specification_Access is Result : constant Real_Range_Specification_Access := new (Self.Subpool) Program.Nodes.Real_Range_Specifications .Implicit_Real_Range_Specification' (Program.Nodes.Real_Range_Specifications.Create (Lower_Bound => Lower_Bound, Upper_Bound => Upper_Bound, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Real_Range_Specifications .Real_Range_Specification_Access (Result); end Create_Real_Range_Specification; not overriding function Create_Numeric_Literal (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Numeric_Literals .Numeric_Literal_Access is Result : constant Numeric_Literal_Access := new (Self.Subpool) Program.Nodes.Numeric_Literals .Implicit_Numeric_Literal' (Program.Nodes.Numeric_Literals.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Numeric_Literals.Numeric_Literal_Access (Result); end Create_Numeric_Literal; not overriding function Create_String_Literal (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.String_Literals.String_Literal_Access is Result : constant String_Literal_Access := new (Self.Subpool) Program.Nodes.String_Literals .Implicit_String_Literal' (Program.Nodes.String_Literals.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.String_Literals.String_Literal_Access (Result); end Create_String_Literal; not overriding function Create_Identifier (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Identifiers.Identifier_Access is Result : constant Identifier_Access := new (Self.Subpool) Program.Nodes.Identifiers.Implicit_Identifier' (Program.Nodes.Identifiers.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Identifiers.Identifier_Access (Result); end Create_Identifier; not overriding function Create_Operator_Symbol (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Operator_Symbols .Operator_Symbol_Access is Result : constant Operator_Symbol_Access := new (Self.Subpool) Program.Nodes.Operator_Symbols .Implicit_Operator_Symbol' (Program.Nodes.Operator_Symbols.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Operator_Symbols.Operator_Symbol_Access (Result); end Create_Operator_Symbol; not overriding function Create_Character_Literal (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Character_Literals .Character_Literal_Access is Result : constant Character_Literal_Access := new (Self.Subpool) Program.Nodes.Character_Literals .Implicit_Character_Literal' (Program.Nodes.Character_Literals.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Character_Literals.Character_Literal_Access (Result); end Create_Character_Literal; not overriding function Create_Explicit_Dereference (Self : Element_Factory; Prefix : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Explicit_Dereferences .Explicit_Dereference_Access is Result : constant Explicit_Dereference_Access := new (Self.Subpool) Program.Nodes.Explicit_Dereferences .Implicit_Explicit_Dereference' (Program.Nodes.Explicit_Dereferences.Create (Prefix => Prefix, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Explicit_Dereferences.Explicit_Dereference_Access (Result); end Create_Explicit_Dereference; not overriding function Create_Infix_Operator (Self : Element_Factory; Left : Program.Elements.Expressions.Expression_Access; Operator : not null Program.Elements.Operator_Symbols .Operator_Symbol_Access; Right : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Infix_Operators.Infix_Operator_Access is Result : constant Infix_Operator_Access := new (Self.Subpool) Program.Nodes.Infix_Operators .Implicit_Infix_Operator' (Program.Nodes.Infix_Operators.Create (Left => Left, Operator => Operator, Right => Right, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Infix_Operators.Infix_Operator_Access (Result); end Create_Infix_Operator; not overriding function Create_Function_Call (Self : Element_Factory; Prefix : not null Program.Elements.Expressions .Expression_Access; Parameters : 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 not null Program.Elements.Function_Calls.Function_Call_Access is Result : constant Function_Call_Access := new (Self.Subpool) Program.Nodes.Function_Calls .Implicit_Function_Call' (Program.Nodes.Function_Calls.Create (Prefix => Prefix, Parameters => Parameters, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Function_Calls.Function_Call_Access (Result); end Create_Function_Call; not overriding function Create_Indexed_Component (Self : Element_Factory; Prefix : not null Program.Elements.Expressions .Expression_Access; Expressions : Program.Elements.Expressions .Expression_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Indexed_Components .Indexed_Component_Access is Result : constant Indexed_Component_Access := new (Self.Subpool) Program.Nodes.Indexed_Components .Implicit_Indexed_Component' (Program.Nodes.Indexed_Components.Create (Prefix => Prefix, Expressions => Expressions, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Indexed_Components.Indexed_Component_Access (Result); end Create_Indexed_Component; not overriding function Create_Slice (Self : Element_Factory; Prefix : not null Program.Elements.Expressions .Expression_Access; Slice_Range : not null Program.Elements.Discrete_Ranges .Discrete_Range_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Slices.Slice_Access is Result : constant Slice_Access := new (Self.Subpool) Program.Nodes.Slices.Implicit_Slice' (Program.Nodes.Slices.Create (Prefix => Prefix, Slice_Range => Slice_Range, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Slices.Slice_Access (Result); end Create_Slice; not overriding function Create_Selected_Component (Self : Element_Factory; Prefix : not null Program.Elements.Expressions .Expression_Access; Selector : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Selected_Components .Selected_Component_Access is Result : constant Selected_Component_Access := new (Self.Subpool) Program.Nodes.Selected_Components .Implicit_Selected_Component' (Program.Nodes.Selected_Components.Create (Prefix => Prefix, Selector => Selector, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Selected_Components.Selected_Component_Access (Result); end Create_Selected_Component; not overriding function Create_Attribute_Reference (Self : Element_Factory; Prefix : not null Program.Elements.Expressions .Expression_Access; Attribute_Designator : not null Program.Elements.Identifiers .Identifier_Access; Expressions : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Attribute_References .Attribute_Reference_Access is Result : constant Attribute_Reference_Access := new (Self.Subpool) Program.Nodes.Attribute_References .Implicit_Attribute_Reference' (Program.Nodes.Attribute_References.Create (Prefix => Prefix, Attribute_Designator => Attribute_Designator, Expressions => Expressions, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Attribute_References.Attribute_Reference_Access (Result); end Create_Attribute_Reference; not overriding function Create_Record_Aggregate (Self : Element_Factory; Components : Program.Elements.Record_Component_Associations .Record_Component_Association_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Record_Aggregates .Record_Aggregate_Access is Result : constant Record_Aggregate_Access := new (Self.Subpool) Program.Nodes.Record_Aggregates .Implicit_Record_Aggregate' (Program.Nodes.Record_Aggregates.Create (Components => Components, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Record_Aggregates.Record_Aggregate_Access (Result); end Create_Record_Aggregate; not overriding function Create_Extension_Aggregate (Self : Element_Factory; Ancestor : not null Program.Elements.Expressions .Expression_Access; Components : Program.Elements.Record_Component_Associations .Record_Component_Association_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Extension_Aggregates .Extension_Aggregate_Access is Result : constant Extension_Aggregate_Access := new (Self.Subpool) Program.Nodes.Extension_Aggregates .Implicit_Extension_Aggregate' (Program.Nodes.Extension_Aggregates.Create (Ancestor => Ancestor, Components => Components, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Extension_Aggregates.Extension_Aggregate_Access (Result); end Create_Extension_Aggregate; not overriding function Create_Array_Aggregate (Self : Element_Factory; Components : Program.Elements.Array_Component_Associations .Array_Component_Association_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Array_Aggregates .Array_Aggregate_Access is Result : constant Array_Aggregate_Access := new (Self.Subpool) Program.Nodes.Array_Aggregates .Implicit_Array_Aggregate' (Program.Nodes.Array_Aggregates.Create (Components => Components, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Array_Aggregates.Array_Aggregate_Access (Result); end Create_Array_Aggregate; not overriding function Create_Short_Circuit_Operation (Self : Element_Factory; Left : not null Program.Elements.Expressions .Expression_Access; Right : not null Program.Elements.Expressions .Expression_Access; Has_And_Then : Boolean := False; Has_Or_Else : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Short_Circuit_Operations .Short_Circuit_Operation_Access is Result : constant Short_Circuit_Operation_Access := new (Self.Subpool) Program.Nodes.Short_Circuit_Operations .Implicit_Short_Circuit_Operation' (Program.Nodes.Short_Circuit_Operations.Create (Left => Left, Right => Right, Has_And_Then => Has_And_Then, Has_Or_Else => Has_Or_Else, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Short_Circuit_Operations .Short_Circuit_Operation_Access (Result); end Create_Short_Circuit_Operation; not overriding function Create_Membership_Test (Self : Element_Factory; Expression : not null Program.Elements.Expressions .Expression_Access; Choices : not null Program.Element_Vectors .Element_Vector_Access; Has_Not : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Membership_Tests .Membership_Test_Access is Result : constant Membership_Test_Access := new (Self.Subpool) Program.Nodes.Membership_Tests .Implicit_Membership_Test' (Program.Nodes.Membership_Tests.Create (Expression => Expression, Choices => Choices, Has_Not => Has_Not, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Membership_Tests.Membership_Test_Access (Result); end Create_Membership_Test; not overriding function Create_Null_Literal (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Null_Literals.Null_Literal_Access is Result : constant Null_Literal_Access := new (Self.Subpool) Program.Nodes.Null_Literals.Implicit_Null_Literal' (Program.Nodes.Null_Literals.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Null_Literals.Null_Literal_Access (Result); end Create_Null_Literal; not overriding function Create_Parenthesized_Expression (Self : Element_Factory; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Parenthesized_Expressions .Parenthesized_Expression_Access is Result : constant Parenthesized_Expression_Access := new (Self.Subpool) Program.Nodes.Parenthesized_Expressions .Implicit_Parenthesized_Expression' (Program.Nodes.Parenthesized_Expressions.Create (Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Parenthesized_Expressions .Parenthesized_Expression_Access (Result); end Create_Parenthesized_Expression; not overriding function Create_Raise_Expression (Self : Element_Factory; Exception_Name : not null Program.Elements.Expressions .Expression_Access; Associated_Message : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Raise_Expressions .Raise_Expression_Access is Result : constant Raise_Expression_Access := new (Self.Subpool) Program.Nodes.Raise_Expressions .Implicit_Raise_Expression' (Program.Nodes.Raise_Expressions.Create (Exception_Name => Exception_Name, Associated_Message => Associated_Message, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Raise_Expressions.Raise_Expression_Access (Result); end Create_Raise_Expression; not overriding function Create_Type_Conversion (Self : Element_Factory; Subtype_Mark : not null Program.Elements.Expressions .Expression_Access; Operand : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Type_Conversions .Type_Conversion_Access is Result : constant Type_Conversion_Access := new (Self.Subpool) Program.Nodes.Type_Conversions .Implicit_Type_Conversion' (Program.Nodes.Type_Conversions.Create (Subtype_Mark => Subtype_Mark, Operand => Operand, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Type_Conversions.Type_Conversion_Access (Result); end Create_Type_Conversion; not overriding function Create_Qualified_Expression (Self : Element_Factory; Subtype_Mark : not null Program.Elements.Expressions .Expression_Access; Operand : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Qualified_Expressions .Qualified_Expression_Access is Result : constant Qualified_Expression_Access := new (Self.Subpool) Program.Nodes.Qualified_Expressions .Implicit_Qualified_Expression' (Program.Nodes.Qualified_Expressions.Create (Subtype_Mark => Subtype_Mark, Operand => Operand, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Qualified_Expressions.Qualified_Expression_Access (Result); end Create_Qualified_Expression; not overriding function Create_Allocator (Self : Element_Factory; Subpool_Name : Program.Elements.Expressions.Expression_Access; Subtype_Indication : Program.Elements.Subtype_Indications .Subtype_Indication_Access; Qualified_Expression : Program.Elements.Qualified_Expressions .Qualified_Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Allocators.Allocator_Access is Result : constant Allocator_Access := new (Self.Subpool) Program.Nodes.Allocators.Implicit_Allocator' (Program.Nodes.Allocators.Create (Subpool_Name => Subpool_Name, Subtype_Indication => Subtype_Indication, Qualified_Expression => Qualified_Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Allocators.Allocator_Access (Result); end Create_Allocator; not overriding function Create_Case_Expression (Self : Element_Factory; Selecting_Expression : not null Program.Elements.Expressions .Expression_Access; Paths : not null Program.Elements.Case_Expression_Paths .Case_Expression_Path_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Case_Expressions .Case_Expression_Access is Result : constant Case_Expression_Access := new (Self.Subpool) Program.Nodes.Case_Expressions .Implicit_Case_Expression' (Program.Nodes.Case_Expressions.Create (Selecting_Expression => Selecting_Expression, Paths => Paths, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Case_Expressions.Case_Expression_Access (Result); end Create_Case_Expression; not overriding function Create_If_Expression (Self : Element_Factory; Condition : not null Program.Elements.Expressions .Expression_Access; Then_Expression : not null Program.Elements.Expressions .Expression_Access; Elsif_Paths : Program.Elements.Elsif_Paths .Elsif_Path_Vector_Access; Else_Expression : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.If_Expressions.If_Expression_Access is Result : constant If_Expression_Access := new (Self.Subpool) Program.Nodes.If_Expressions .Implicit_If_Expression' (Program.Nodes.If_Expressions.Create (Condition => Condition, Then_Expression => Then_Expression, Elsif_Paths => Elsif_Paths, Else_Expression => Else_Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.If_Expressions.If_Expression_Access (Result); end Create_If_Expression; not overriding function Create_Quantified_Expression (Self : Element_Factory; Parameter : Program.Elements.Loop_Parameter_Specifications .Loop_Parameter_Specification_Access; Generalized_Iterator : Program.Elements .Generalized_Iterator_Specifications .Generalized_Iterator_Specification_Access; Element_Iterator : Program.Elements.Element_Iterator_Specifications .Element_Iterator_Specification_Access; Predicate : not null Program.Elements.Expressions .Expression_Access; Has_All : Boolean := False; Has_Some : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Quantified_Expressions .Quantified_Expression_Access is Result : constant Quantified_Expression_Access := new (Self.Subpool) Program.Nodes.Quantified_Expressions .Implicit_Quantified_Expression' (Program.Nodes.Quantified_Expressions.Create (Parameter => Parameter, Generalized_Iterator => Generalized_Iterator, Element_Iterator => Element_Iterator, Predicate => Predicate, Has_All => Has_All, Has_Some => Has_Some, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Quantified_Expressions .Quantified_Expression_Access (Result); end Create_Quantified_Expression; not overriding function Create_Discriminant_Association (Self : Element_Factory; Selector_Names : Program.Elements.Identifiers .Identifier_Vector_Access; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Discriminant_Associations .Discriminant_Association_Access is Result : constant Discriminant_Association_Access := new (Self.Subpool) Program.Nodes.Discriminant_Associations .Implicit_Discriminant_Association' (Program.Nodes.Discriminant_Associations.Create (Selector_Names => Selector_Names, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Discriminant_Associations .Discriminant_Association_Access (Result); end Create_Discriminant_Association; not overriding function Create_Record_Component_Association (Self : Element_Factory; Choices : Program.Element_Vectors.Element_Vector_Access; Expression : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Record_Component_Associations .Record_Component_Association_Access is Result : constant Record_Component_Association_Access := new (Self.Subpool) Program.Nodes.Record_Component_Associations .Implicit_Record_Component_Association' (Program.Nodes.Record_Component_Associations.Create (Choices => Choices, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Record_Component_Associations .Record_Component_Association_Access (Result); end Create_Record_Component_Association; not overriding function Create_Array_Component_Association (Self : Element_Factory; Choices : Program.Element_Vectors.Element_Vector_Access; Expression : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Array_Component_Associations .Array_Component_Association_Access is Result : constant Array_Component_Association_Access := new (Self.Subpool) Program.Nodes.Array_Component_Associations .Implicit_Array_Component_Association' (Program.Nodes.Array_Component_Associations.Create (Choices => Choices, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Array_Component_Associations .Array_Component_Association_Access (Result); end Create_Array_Component_Association; not overriding function Create_Parameter_Association (Self : Element_Factory; Formal_Parameter : Program.Elements.Expressions.Expression_Access; Actual_Parameter : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Parameter_Associations .Parameter_Association_Access is Result : constant Parameter_Association_Access := new (Self.Subpool) Program.Nodes.Parameter_Associations .Implicit_Parameter_Association' (Program.Nodes.Parameter_Associations.Create (Formal_Parameter => Formal_Parameter, Actual_Parameter => Actual_Parameter, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Parameter_Associations .Parameter_Association_Access (Result); end Create_Parameter_Association; not overriding function Create_Formal_Package_Association (Self : Element_Factory; Formal_Parameter : Program.Elements.Expressions.Expression_Access; Actual_Parameter : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Package_Associations .Formal_Package_Association_Access is Result : constant Formal_Package_Association_Access := new (Self.Subpool) Program.Nodes.Formal_Package_Associations .Implicit_Formal_Package_Association' (Program.Nodes.Formal_Package_Associations.Create (Formal_Parameter => Formal_Parameter, Actual_Parameter => Actual_Parameter, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Package_Associations .Formal_Package_Association_Access (Result); end Create_Formal_Package_Association; not overriding function Create_Null_Statement (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Null_Statements.Null_Statement_Access is Result : constant Null_Statement_Access := new (Self.Subpool) Program.Nodes.Null_Statements .Implicit_Null_Statement' (Program.Nodes.Null_Statements.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Null_Statements.Null_Statement_Access (Result); end Create_Null_Statement; not overriding function Create_Assignment_Statement (Self : Element_Factory; Variable_Name : not null Program.Elements.Expressions .Expression_Access; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Assignment_Statements .Assignment_Statement_Access is Result : constant Assignment_Statement_Access := new (Self.Subpool) Program.Nodes.Assignment_Statements .Implicit_Assignment_Statement' (Program.Nodes.Assignment_Statements.Create (Variable_Name => Variable_Name, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Assignment_Statements.Assignment_Statement_Access (Result); end Create_Assignment_Statement; not overriding function Create_If_Statement (Self : Element_Factory; Condition : not null Program.Elements.Expressions .Expression_Access; Then_Statements : not null Program.Element_Vectors .Element_Vector_Access; Elsif_Paths : Program.Elements.Elsif_Paths .Elsif_Path_Vector_Access; Else_Statements : Program.Element_Vectors.Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.If_Statements.If_Statement_Access is Result : constant If_Statement_Access := new (Self.Subpool) Program.Nodes.If_Statements.Implicit_If_Statement' (Program.Nodes.If_Statements.Create (Condition => Condition, Then_Statements => Then_Statements, Elsif_Paths => Elsif_Paths, Else_Statements => Else_Statements, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.If_Statements.If_Statement_Access (Result); end Create_If_Statement; not overriding function Create_Case_Statement (Self : Element_Factory; Selecting_Expression : not null Program.Elements.Expressions .Expression_Access; Paths : not null Program.Elements.Case_Paths .Case_Path_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Case_Statements.Case_Statement_Access is Result : constant Case_Statement_Access := new (Self.Subpool) Program.Nodes.Case_Statements .Implicit_Case_Statement' (Program.Nodes.Case_Statements.Create (Selecting_Expression => Selecting_Expression, Paths => Paths, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Case_Statements.Case_Statement_Access (Result); end Create_Case_Statement; not overriding function Create_Loop_Statement (Self : Element_Factory; Statement_Identifier : Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Loop_Statements.Loop_Statement_Access is Result : constant Loop_Statement_Access := new (Self.Subpool) Program.Nodes.Loop_Statements .Implicit_Loop_Statement' (Program.Nodes.Loop_Statements.Create (Statement_Identifier => Statement_Identifier, Statements => Statements, End_Statement_Identifier => End_Statement_Identifier, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Loop_Statements.Loop_Statement_Access (Result); end Create_Loop_Statement; not overriding function Create_While_Loop_Statement (Self : Element_Factory; Statement_Identifier : Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Condition : not null Program.Elements.Expressions .Expression_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.While_Loop_Statements .While_Loop_Statement_Access is Result : constant While_Loop_Statement_Access := new (Self.Subpool) Program.Nodes.While_Loop_Statements .Implicit_While_Loop_Statement' (Program.Nodes.While_Loop_Statements.Create (Statement_Identifier => Statement_Identifier, Condition => Condition, Statements => Statements, End_Statement_Identifier => End_Statement_Identifier, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.While_Loop_Statements.While_Loop_Statement_Access (Result); end Create_While_Loop_Statement; not overriding function Create_For_Loop_Statement (Self : Element_Factory; Statement_Identifier : Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Loop_Parameter : Program.Elements.Loop_Parameter_Specifications .Loop_Parameter_Specification_Access; Generalized_Iterator : Program.Elements .Generalized_Iterator_Specifications .Generalized_Iterator_Specification_Access; Element_Iterator : Program.Elements .Element_Iterator_Specifications .Element_Iterator_Specification_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.For_Loop_Statements .For_Loop_Statement_Access is Result : constant For_Loop_Statement_Access := new (Self.Subpool) Program.Nodes.For_Loop_Statements .Implicit_For_Loop_Statement' (Program.Nodes.For_Loop_Statements.Create (Statement_Identifier => Statement_Identifier, Loop_Parameter => Loop_Parameter, Generalized_Iterator => Generalized_Iterator, Element_Iterator => Element_Iterator, Statements => Statements, End_Statement_Identifier => End_Statement_Identifier, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.For_Loop_Statements.For_Loop_Statement_Access (Result); end Create_For_Loop_Statement; not overriding function Create_Block_Statement (Self : Element_Factory; Statement_Identifier : Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Block_Statements .Block_Statement_Access is Result : constant Block_Statement_Access := new (Self.Subpool) Program.Nodes.Block_Statements .Implicit_Block_Statement' (Program.Nodes.Block_Statements.Create (Statement_Identifier => Statement_Identifier, Declarations => Declarations, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Statement_Identifier => End_Statement_Identifier, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Block_Statements.Block_Statement_Access (Result); end Create_Block_Statement; not overriding function Create_Exit_Statement (Self : Element_Factory; Exit_Loop_Name : Program.Elements.Expressions.Expression_Access; Condition : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Exit_Statements.Exit_Statement_Access is Result : constant Exit_Statement_Access := new (Self.Subpool) Program.Nodes.Exit_Statements .Implicit_Exit_Statement' (Program.Nodes.Exit_Statements.Create (Exit_Loop_Name => Exit_Loop_Name, Condition => Condition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Exit_Statements.Exit_Statement_Access (Result); end Create_Exit_Statement; not overriding function Create_Goto_Statement (Self : Element_Factory; Goto_Label : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Goto_Statements.Goto_Statement_Access is Result : constant Goto_Statement_Access := new (Self.Subpool) Program.Nodes.Goto_Statements .Implicit_Goto_Statement' (Program.Nodes.Goto_Statements.Create (Goto_Label => Goto_Label, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Goto_Statements.Goto_Statement_Access (Result); end Create_Goto_Statement; not overriding function Create_Call_Statement (Self : Element_Factory; Called_Name : not null Program.Elements.Expressions .Expression_Access; Parameters : 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 not null Program.Elements.Call_Statements.Call_Statement_Access is Result : constant Call_Statement_Access := new (Self.Subpool) Program.Nodes.Call_Statements .Implicit_Call_Statement' (Program.Nodes.Call_Statements.Create (Called_Name => Called_Name, Parameters => Parameters, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Call_Statements.Call_Statement_Access (Result); end Create_Call_Statement; not overriding function Create_Simple_Return_Statement (Self : Element_Factory; Expression : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Simple_Return_Statements .Simple_Return_Statement_Access is Result : constant Simple_Return_Statement_Access := new (Self.Subpool) Program.Nodes.Simple_Return_Statements .Implicit_Simple_Return_Statement' (Program.Nodes.Simple_Return_Statements.Create (Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Simple_Return_Statements .Simple_Return_Statement_Access (Result); end Create_Simple_Return_Statement; not overriding function Create_Extended_Return_Statement (Self : Element_Factory; Return_Object : not null Program.Elements .Return_Object_Specifications.Return_Object_Specification_Access; Statements : Program.Element_Vectors.Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Extended_Return_Statements .Extended_Return_Statement_Access is Result : constant Extended_Return_Statement_Access := new (Self.Subpool) Program.Nodes.Extended_Return_Statements .Implicit_Extended_Return_Statement' (Program.Nodes.Extended_Return_Statements.Create (Return_Object => Return_Object, Statements => Statements, Exception_Handlers => Exception_Handlers, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Extended_Return_Statements .Extended_Return_Statement_Access (Result); end Create_Extended_Return_Statement; not overriding function Create_Accept_Statement (Self : Element_Factory; Entry_Name : not null Program.Elements.Identifiers .Identifier_Access; Entry_Index : Program.Elements.Expressions.Expression_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Statements : Program.Element_Vectors.Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Accept_Statements .Accept_Statement_Access is Result : constant Accept_Statement_Access := new (Self.Subpool) Program.Nodes.Accept_Statements .Implicit_Accept_Statement' (Program.Nodes.Accept_Statements.Create (Entry_Name => Entry_Name, Entry_Index => Entry_Index, Parameters => Parameters, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Statement_Identifier => End_Statement_Identifier, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Accept_Statements.Accept_Statement_Access (Result); end Create_Accept_Statement; not overriding function Create_Requeue_Statement (Self : Element_Factory; Entry_Name : not null Program.Elements.Expressions .Expression_Access; Has_With_Abort : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Requeue_Statements .Requeue_Statement_Access is Result : constant Requeue_Statement_Access := new (Self.Subpool) Program.Nodes.Requeue_Statements .Implicit_Requeue_Statement' (Program.Nodes.Requeue_Statements.Create (Entry_Name => Entry_Name, Has_With_Abort => Has_With_Abort, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Requeue_Statements.Requeue_Statement_Access (Result); end Create_Requeue_Statement; not overriding function Create_Delay_Statement (Self : Element_Factory; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Delay_Statements .Delay_Statement_Access is Result : constant Delay_Statement_Access := new (Self.Subpool) Program.Nodes.Delay_Statements .Implicit_Delay_Statement' (Program.Nodes.Delay_Statements.Create (Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Delay_Statements.Delay_Statement_Access (Result); end Create_Delay_Statement; not overriding function Create_Terminate_Alternative_Statement (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Terminate_Alternative_Statements .Terminate_Alternative_Statement_Access is Result : constant Terminate_Alternative_Statement_Access := new (Self.Subpool) Program.Nodes.Terminate_Alternative_Statements .Implicit_Terminate_Alternative_Statement' (Program.Nodes.Terminate_Alternative_Statements.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Terminate_Alternative_Statements .Terminate_Alternative_Statement_Access (Result); end Create_Terminate_Alternative_Statement; not overriding function Create_Select_Statement (Self : Element_Factory; Paths : not null Program.Elements.Select_Paths .Select_Path_Vector_Access; Then_Abort_Statements : Program.Element_Vectors.Element_Vector_Access; Else_Statements : Program.Element_Vectors.Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Select_Statements .Select_Statement_Access is Result : constant Select_Statement_Access := new (Self.Subpool) Program.Nodes.Select_Statements .Implicit_Select_Statement' (Program.Nodes.Select_Statements.Create (Paths => Paths, Then_Abort_Statements => Then_Abort_Statements, Else_Statements => Else_Statements, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Select_Statements.Select_Statement_Access (Result); end Create_Select_Statement; not overriding function Create_Abort_Statement (Self : Element_Factory; Aborted_Tasks : not null Program.Elements.Expressions .Expression_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Abort_Statements .Abort_Statement_Access is Result : constant Abort_Statement_Access := new (Self.Subpool) Program.Nodes.Abort_Statements .Implicit_Abort_Statement' (Program.Nodes.Abort_Statements.Create (Aborted_Tasks => Aborted_Tasks, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Abort_Statements.Abort_Statement_Access (Result); end Create_Abort_Statement; not overriding function Create_Raise_Statement (Self : Element_Factory; Raised_Exception : Program.Elements.Expressions.Expression_Access; Associated_Message : Program.Elements.Expressions.Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Raise_Statements .Raise_Statement_Access is Result : constant Raise_Statement_Access := new (Self.Subpool) Program.Nodes.Raise_Statements .Implicit_Raise_Statement' (Program.Nodes.Raise_Statements.Create (Raised_Exception => Raised_Exception, Associated_Message => Associated_Message, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Raise_Statements.Raise_Statement_Access (Result); end Create_Raise_Statement; not overriding function Create_Code_Statement (Self : Element_Factory; Expression : not null Program.Elements.Qualified_Expressions .Qualified_Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Code_Statements.Code_Statement_Access is Result : constant Code_Statement_Access := new (Self.Subpool) Program.Nodes.Code_Statements .Implicit_Code_Statement' (Program.Nodes.Code_Statements.Create (Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Code_Statements.Code_Statement_Access (Result); end Create_Code_Statement; not overriding function Create_Elsif_Path (Self : Element_Factory; Condition : not null Program.Elements.Expressions .Expression_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Elsif_Paths.Elsif_Path_Access is Result : constant Elsif_Path_Access := new (Self.Subpool) Program.Nodes.Elsif_Paths.Implicit_Elsif_Path' (Program.Nodes.Elsif_Paths.Create (Condition => Condition, Statements => Statements, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Elsif_Paths.Elsif_Path_Access (Result); end Create_Elsif_Path; not overriding function Create_Case_Path (Self : Element_Factory; Choices : not null Program.Element_Vectors .Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Case_Paths.Case_Path_Access is Result : constant Case_Path_Access := new (Self.Subpool) Program.Nodes.Case_Paths.Implicit_Case_Path' (Program.Nodes.Case_Paths.Create (Choices => Choices, Statements => Statements, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Case_Paths.Case_Path_Access (Result); end Create_Case_Path; not overriding function Create_Select_Path (Self : Element_Factory; Guard : Program.Elements.Expressions.Expression_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Select_Paths.Select_Path_Access is Result : constant Select_Path_Access := new (Self.Subpool) Program.Nodes.Select_Paths.Implicit_Select_Path' (Program.Nodes.Select_Paths.Create (Guard => Guard, Statements => Statements, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Select_Paths.Select_Path_Access (Result); end Create_Select_Path; not overriding function Create_Case_Expression_Path (Self : Element_Factory; Choices : not null Program.Element_Vectors .Element_Vector_Access; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Case_Expression_Paths .Case_Expression_Path_Access is Result : constant Case_Expression_Path_Access := new (Self.Subpool) Program.Nodes.Case_Expression_Paths .Implicit_Case_Expression_Path' (Program.Nodes.Case_Expression_Paths.Create (Choices => Choices, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Case_Expression_Paths.Case_Expression_Path_Access (Result); end Create_Case_Expression_Path; not overriding function Create_Elsif_Expression_Path (Self : Element_Factory; Condition : not null Program.Elements.Expressions .Expression_Access; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Elsif_Expression_Paths .Elsif_Expression_Path_Access is Result : constant Elsif_Expression_Path_Access := new (Self.Subpool) Program.Nodes.Elsif_Expression_Paths .Implicit_Elsif_Expression_Path' (Program.Nodes.Elsif_Expression_Paths.Create (Condition => Condition, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Elsif_Expression_Paths .Elsif_Expression_Path_Access (Result); end Create_Elsif_Expression_Path; not overriding function Create_Use_Clause (Self : Element_Factory; Clause_Names : not null Program.Elements.Expressions .Expression_Vector_Access; Has_All : Boolean := False; Has_Type : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Use_Clauses.Use_Clause_Access is Result : constant Use_Clause_Access := new (Self.Subpool) Program.Nodes.Use_Clauses.Implicit_Use_Clause' (Program.Nodes.Use_Clauses.Create (Clause_Names => Clause_Names, Has_All => Has_All, Has_Type => Has_Type, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Use_Clauses.Use_Clause_Access (Result); end Create_Use_Clause; not overriding function Create_With_Clause (Self : Element_Factory; Clause_Names : not null Program.Elements.Expressions .Expression_Vector_Access; Has_Limited : Boolean := False; Has_Private : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.With_Clauses.With_Clause_Access is Result : constant With_Clause_Access := new (Self.Subpool) Program.Nodes.With_Clauses.Implicit_With_Clause' (Program.Nodes.With_Clauses.Create (Clause_Names => Clause_Names, Has_Limited => Has_Limited, Has_Private => Has_Private, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.With_Clauses.With_Clause_Access (Result); end Create_With_Clause; not overriding function Create_Component_Clause (Self : Element_Factory; Clause_Name : not null Program.Elements.Identifiers .Identifier_Access; Position : not null Program.Elements.Expressions .Expression_Access; Clause_Range : not null Program.Elements.Simple_Expression_Ranges .Simple_Expression_Range_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Component_Clauses .Component_Clause_Access is Result : constant Component_Clause_Access := new (Self.Subpool) Program.Nodes.Component_Clauses .Implicit_Component_Clause' (Program.Nodes.Component_Clauses.Create (Clause_Name => Clause_Name, Position => Position, Clause_Range => Clause_Range, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Component_Clauses.Component_Clause_Access (Result); end Create_Component_Clause; not overriding function Create_Derived_Type (Self : Element_Factory; Parent : not null Program.Elements.Expressions .Expression_Access; Has_Abstract : Boolean := False; Has_Limited : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Derived_Types.Derived_Type_Access is Result : constant Derived_Type_Access := new (Self.Subpool) Program.Nodes.Derived_Types.Implicit_Derived_Type' (Program.Nodes.Derived_Types.Create (Parent => Parent, Has_Abstract => Has_Abstract, Has_Limited => Has_Limited, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Derived_Types.Derived_Type_Access (Result); end Create_Derived_Type; not overriding function Create_Derived_Record_Extension (Self : Element_Factory; Parent : not null Program.Elements.Expressions .Expression_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Record_Definition : not null Program.Elements.Definitions .Definition_Access; Has_Abstract : Boolean := False; Has_Limited : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Derived_Record_Extensions .Derived_Record_Extension_Access is Result : constant Derived_Record_Extension_Access := new (Self.Subpool) Program.Nodes.Derived_Record_Extensions .Implicit_Derived_Record_Extension' (Program.Nodes.Derived_Record_Extensions.Create (Parent => Parent, Progenitors => Progenitors, Record_Definition => Record_Definition, Has_Abstract => Has_Abstract, Has_Limited => Has_Limited, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Derived_Record_Extensions .Derived_Record_Extension_Access (Result); end Create_Derived_Record_Extension; not overriding function Create_Enumeration_Type (Self : Element_Factory; Literals : not null Program.Elements .Enumeration_Literal_Specifications .Enumeration_Literal_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Enumeration_Types .Enumeration_Type_Access is Result : constant Enumeration_Type_Access := new (Self.Subpool) Program.Nodes.Enumeration_Types .Implicit_Enumeration_Type' (Program.Nodes.Enumeration_Types.Create (Literals => Literals, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Enumeration_Types.Enumeration_Type_Access (Result); end Create_Enumeration_Type; not overriding function Create_Signed_Integer_Type (Self : Element_Factory; Lower_Bound : not null Program.Elements.Expressions .Expression_Access; Upper_Bound : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Signed_Integer_Types .Signed_Integer_Type_Access is Result : constant Signed_Integer_Type_Access := new (Self.Subpool) Program.Nodes.Signed_Integer_Types .Implicit_Signed_Integer_Type' (Program.Nodes.Signed_Integer_Types.Create (Lower_Bound => Lower_Bound, Upper_Bound => Upper_Bound, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Signed_Integer_Types.Signed_Integer_Type_Access (Result); end Create_Signed_Integer_Type; not overriding function Create_Modular_Type (Self : Element_Factory; Modulus : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Modular_Types.Modular_Type_Access is Result : constant Modular_Type_Access := new (Self.Subpool) Program.Nodes.Modular_Types.Implicit_Modular_Type' (Program.Nodes.Modular_Types.Create (Modulus => Modulus, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Modular_Types.Modular_Type_Access (Result); end Create_Modular_Type; not overriding function Create_Root_Type (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Root_Types.Root_Type_Access is Result : constant Root_Type_Access := new (Self.Subpool) Program.Nodes.Root_Types.Implicit_Root_Type' (Program.Nodes.Root_Types.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Root_Types.Root_Type_Access (Result); end Create_Root_Type; not overriding function Create_Floating_Point_Type (Self : Element_Factory; Digits_Expression : not null Program.Elements.Expressions .Expression_Access; Real_Range : Program.Elements.Real_Range_Specifications .Real_Range_Specification_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Floating_Point_Types .Floating_Point_Type_Access is Result : constant Floating_Point_Type_Access := new (Self.Subpool) Program.Nodes.Floating_Point_Types .Implicit_Floating_Point_Type' (Program.Nodes.Floating_Point_Types.Create (Digits_Expression => Digits_Expression, Real_Range => Real_Range, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Floating_Point_Types.Floating_Point_Type_Access (Result); end Create_Floating_Point_Type; not overriding function Create_Ordinary_Fixed_Point_Type (Self : Element_Factory; Delta_Expression : not null Program.Elements.Expressions .Expression_Access; Real_Range : not null Program.Elements.Real_Range_Specifications .Real_Range_Specification_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Ordinary_Fixed_Point_Types .Ordinary_Fixed_Point_Type_Access is Result : constant Ordinary_Fixed_Point_Type_Access := new (Self.Subpool) Program.Nodes.Ordinary_Fixed_Point_Types .Implicit_Ordinary_Fixed_Point_Type' (Program.Nodes.Ordinary_Fixed_Point_Types.Create (Delta_Expression => Delta_Expression, Real_Range => Real_Range, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Ordinary_Fixed_Point_Types .Ordinary_Fixed_Point_Type_Access (Result); end Create_Ordinary_Fixed_Point_Type; not overriding function Create_Decimal_Fixed_Point_Type (Self : Element_Factory; Delta_Expression : not null Program.Elements.Expressions .Expression_Access; Digits_Expression : not null Program.Elements.Expressions .Expression_Access; Real_Range : Program.Elements.Real_Range_Specifications .Real_Range_Specification_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Decimal_Fixed_Point_Types .Decimal_Fixed_Point_Type_Access is Result : constant Decimal_Fixed_Point_Type_Access := new (Self.Subpool) Program.Nodes.Decimal_Fixed_Point_Types .Implicit_Decimal_Fixed_Point_Type' (Program.Nodes.Decimal_Fixed_Point_Types.Create (Delta_Expression => Delta_Expression, Digits_Expression => Digits_Expression, Real_Range => Real_Range, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Decimal_Fixed_Point_Types .Decimal_Fixed_Point_Type_Access (Result); end Create_Decimal_Fixed_Point_Type; not overriding function Create_Unconstrained_Array_Type (Self : Element_Factory; Index_Subtypes : not null Program.Elements.Expressions .Expression_Vector_Access; Component_Definition : not null Program.Elements.Component_Definitions .Component_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Unconstrained_Array_Types .Unconstrained_Array_Type_Access is Result : constant Unconstrained_Array_Type_Access := new (Self.Subpool) Program.Nodes.Unconstrained_Array_Types .Implicit_Unconstrained_Array_Type' (Program.Nodes.Unconstrained_Array_Types.Create (Index_Subtypes => Index_Subtypes, Component_Definition => Component_Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Unconstrained_Array_Types .Unconstrained_Array_Type_Access (Result); end Create_Unconstrained_Array_Type; not overriding function Create_Constrained_Array_Type (Self : Element_Factory; Index_Subtypes : not null Program.Elements.Discrete_Ranges .Discrete_Range_Vector_Access; Component_Definition : not null Program.Elements.Component_Definitions .Component_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Constrained_Array_Types .Constrained_Array_Type_Access is Result : constant Constrained_Array_Type_Access := new (Self.Subpool) Program.Nodes.Constrained_Array_Types .Implicit_Constrained_Array_Type' (Program.Nodes.Constrained_Array_Types.Create (Index_Subtypes => Index_Subtypes, Component_Definition => Component_Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Constrained_Array_Types .Constrained_Array_Type_Access (Result); end Create_Constrained_Array_Type; not overriding function Create_Record_Type (Self : Element_Factory; Record_Definition : not null Program.Elements.Definitions .Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Record_Types.Record_Type_Access is Result : constant Record_Type_Access := new (Self.Subpool) Program.Nodes.Record_Types.Implicit_Record_Type' (Program.Nodes.Record_Types.Create (Record_Definition => Record_Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Record_Types.Record_Type_Access (Result); end Create_Record_Type; not overriding function Create_Interface_Type (Self : Element_Factory; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Has_Limited : Boolean := False; Has_Task : Boolean := False; Has_Protected : Boolean := False; Has_Synchronized : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Interface_Types.Interface_Type_Access is Result : constant Interface_Type_Access := new (Self.Subpool) Program.Nodes.Interface_Types .Implicit_Interface_Type' (Program.Nodes.Interface_Types.Create (Progenitors => Progenitors, Has_Limited => Has_Limited, Has_Task => Has_Task, Has_Protected => Has_Protected, Has_Synchronized => Has_Synchronized, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Interface_Types.Interface_Type_Access (Result); end Create_Interface_Type; not overriding function Create_Object_Access_Type (Self : Element_Factory; Subtype_Indication : not null Program.Elements.Subtype_Indications .Subtype_Indication_Access; Has_Not_Null : Boolean := False; Has_All : Boolean := False; Has_Constant : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Object_Access_Types .Object_Access_Type_Access is Result : constant Object_Access_Type_Access := new (Self.Subpool) Program.Nodes.Object_Access_Types .Implicit_Object_Access_Type' (Program.Nodes.Object_Access_Types.Create (Subtype_Indication => Subtype_Indication, Has_Not_Null => Has_Not_Null, Has_All => Has_All, Has_Constant => Has_Constant, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Object_Access_Types.Object_Access_Type_Access (Result); end Create_Object_Access_Type; not overriding function Create_Procedure_Access_Type (Self : Element_Factory; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Has_Not_Null : Boolean := False; Has_Protected : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Procedure_Access_Types .Procedure_Access_Type_Access is Result : constant Procedure_Access_Type_Access := new (Self.Subpool) Program.Nodes.Procedure_Access_Types .Implicit_Procedure_Access_Type' (Program.Nodes.Procedure_Access_Types.Create (Parameters => Parameters, Has_Not_Null => Has_Not_Null, Has_Protected => Has_Protected, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Procedure_Access_Types .Procedure_Access_Type_Access (Result); end Create_Procedure_Access_Type; not overriding function Create_Function_Access_Type (Self : Element_Factory; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Has_Not_Null : Boolean := False; Has_Protected : Boolean := False; Has_Not_Null_2 : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Function_Access_Types .Function_Access_Type_Access is Result : constant Function_Access_Type_Access := new (Self.Subpool) Program.Nodes.Function_Access_Types .Implicit_Function_Access_Type' (Program.Nodes.Function_Access_Types.Create (Parameters => Parameters, Result_Subtype => Result_Subtype, Has_Not_Null => Has_Not_Null, Has_Protected => Has_Protected, Has_Not_Null_2 => Has_Not_Null_2, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Function_Access_Types.Function_Access_Type_Access (Result); end Create_Function_Access_Type; not overriding function Create_Formal_Private_Type_Definition (Self : Element_Factory; Has_Abstract : Boolean := False; Has_Tagged : Boolean := False; Has_Limited : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Private_Type_Definitions .Formal_Private_Type_Definition_Access is Result : constant Formal_Private_Type_Definition_Access := new (Self.Subpool) Program.Nodes.Formal_Private_Type_Definitions .Implicit_Formal_Private_Type_Definition' (Program.Nodes.Formal_Private_Type_Definitions.Create (Has_Abstract => Has_Abstract, Has_Tagged => Has_Tagged, Has_Limited => Has_Limited, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Private_Type_Definitions .Formal_Private_Type_Definition_Access (Result); end Create_Formal_Private_Type_Definition; not overriding function Create_Formal_Derived_Type_Definition (Self : Element_Factory; Subtype_Mark : not null Program.Elements.Expressions .Expression_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Has_Abstract : Boolean := False; Has_Limited : Boolean := False; Has_Synchronized : Boolean := False; Has_With_Private : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Derived_Type_Definitions .Formal_Derived_Type_Definition_Access is Result : constant Formal_Derived_Type_Definition_Access := new (Self.Subpool) Program.Nodes.Formal_Derived_Type_Definitions .Implicit_Formal_Derived_Type_Definition' (Program.Nodes.Formal_Derived_Type_Definitions.Create (Subtype_Mark => Subtype_Mark, Progenitors => Progenitors, Has_Abstract => Has_Abstract, Has_Limited => Has_Limited, Has_Synchronized => Has_Synchronized, Has_With_Private => Has_With_Private, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Derived_Type_Definitions .Formal_Derived_Type_Definition_Access (Result); end Create_Formal_Derived_Type_Definition; not overriding function Create_Formal_Discrete_Type_Definition (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Discrete_Type_Definitions .Formal_Discrete_Type_Definition_Access is Result : constant Formal_Discrete_Type_Definition_Access := new (Self.Subpool) Program.Nodes.Formal_Discrete_Type_Definitions .Implicit_Formal_Discrete_Type_Definition' (Program.Nodes.Formal_Discrete_Type_Definitions.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Discrete_Type_Definitions .Formal_Discrete_Type_Definition_Access (Result); end Create_Formal_Discrete_Type_Definition; not overriding function Create_Formal_Signed_Integer_Type_Definition (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Signed_Integer_Type_Definitions .Formal_Signed_Integer_Type_Definition_Access is Result : constant Formal_Signed_Integer_Type_Definition_Access := new (Self.Subpool) Program.Nodes .Formal_Signed_Integer_Type_Definitions .Implicit_Formal_Signed_Integer_Type_Definition' (Program.Nodes.Formal_Signed_Integer_Type_Definitions.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Signed_Integer_Type_Definitions .Formal_Signed_Integer_Type_Definition_Access (Result); end Create_Formal_Signed_Integer_Type_Definition; not overriding function Create_Formal_Modular_Type_Definition (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Modular_Type_Definitions .Formal_Modular_Type_Definition_Access is Result : constant Formal_Modular_Type_Definition_Access := new (Self.Subpool) Program.Nodes.Formal_Modular_Type_Definitions .Implicit_Formal_Modular_Type_Definition' (Program.Nodes.Formal_Modular_Type_Definitions.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Modular_Type_Definitions .Formal_Modular_Type_Definition_Access (Result); end Create_Formal_Modular_Type_Definition; not overriding function Create_Formal_Floating_Point_Definition (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition_Access is Result : constant Formal_Floating_Point_Definition_Access := new (Self.Subpool) Program.Nodes.Formal_Floating_Point_Definitions .Implicit_Formal_Floating_Point_Definition' (Program.Nodes.Formal_Floating_Point_Definitions.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition_Access (Result); end Create_Formal_Floating_Point_Definition; not overriding function Create_Formal_Ordinary_Fixed_Point_Definition (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Ordinary_Fixed_Point_Definitions .Formal_Ordinary_Fixed_Point_Definition_Access is Result : constant Formal_Ordinary_Fixed_Point_Definition_Access := new (Self.Subpool) Program.Nodes .Formal_Ordinary_Fixed_Point_Definitions .Implicit_Formal_Ordinary_Fixed_Point_Definition' (Program.Nodes.Formal_Ordinary_Fixed_Point_Definitions.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Ordinary_Fixed_Point_Definitions .Formal_Ordinary_Fixed_Point_Definition_Access (Result); end Create_Formal_Ordinary_Fixed_Point_Definition; not overriding function Create_Formal_Decimal_Fixed_Point_Definition (Self : Element_Factory; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Decimal_Fixed_Point_Definitions .Formal_Decimal_Fixed_Point_Definition_Access is Result : constant Formal_Decimal_Fixed_Point_Definition_Access := new (Self.Subpool) Program.Nodes .Formal_Decimal_Fixed_Point_Definitions .Implicit_Formal_Decimal_Fixed_Point_Definition' (Program.Nodes.Formal_Decimal_Fixed_Point_Definitions.Create (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Decimal_Fixed_Point_Definitions .Formal_Decimal_Fixed_Point_Definition_Access (Result); end Create_Formal_Decimal_Fixed_Point_Definition; not overriding function Create_Formal_Unconstrained_Array_Type (Self : Element_Factory; Index_Subtypes : not null Program.Elements.Expressions .Expression_Vector_Access; Component_Definition : not null Program.Elements.Component_Definitions .Component_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Unconstrained_Array_Types .Formal_Unconstrained_Array_Type_Access is Result : constant Formal_Unconstrained_Array_Type_Access := new (Self.Subpool) Program.Nodes.Formal_Unconstrained_Array_Types .Implicit_Formal_Unconstrained_Array_Type' (Program.Nodes.Formal_Unconstrained_Array_Types.Create (Index_Subtypes => Index_Subtypes, Component_Definition => Component_Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Unconstrained_Array_Types .Formal_Unconstrained_Array_Type_Access (Result); end Create_Formal_Unconstrained_Array_Type; not overriding function Create_Formal_Constrained_Array_Type (Self : Element_Factory; Index_Subtypes : not null Program.Elements.Discrete_Ranges .Discrete_Range_Vector_Access; Component_Definition : not null Program.Elements.Component_Definitions .Component_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Constrained_Array_Types .Formal_Constrained_Array_Type_Access is Result : constant Formal_Constrained_Array_Type_Access := new (Self.Subpool) Program.Nodes.Formal_Constrained_Array_Types .Implicit_Formal_Constrained_Array_Type' (Program.Nodes.Formal_Constrained_Array_Types.Create (Index_Subtypes => Index_Subtypes, Component_Definition => Component_Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Constrained_Array_Types .Formal_Constrained_Array_Type_Access (Result); end Create_Formal_Constrained_Array_Type; not overriding function Create_Formal_Object_Access_Type (Self : Element_Factory; Subtype_Indication : not null Program.Elements.Subtype_Indications .Subtype_Indication_Access; Has_Not_Null : Boolean := False; Has_All : Boolean := False; Has_Constant : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Object_Access_Types .Formal_Object_Access_Type_Access is Result : constant Formal_Object_Access_Type_Access := new (Self.Subpool) Program.Nodes.Formal_Object_Access_Types .Implicit_Formal_Object_Access_Type' (Program.Nodes.Formal_Object_Access_Types.Create (Subtype_Indication => Subtype_Indication, Has_Not_Null => Has_Not_Null, Has_All => Has_All, Has_Constant => Has_Constant, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Object_Access_Types .Formal_Object_Access_Type_Access (Result); end Create_Formal_Object_Access_Type; not overriding function Create_Formal_Procedure_Access_Type (Self : Element_Factory; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Has_Not_Null : Boolean := False; Has_Protected : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Procedure_Access_Types .Formal_Procedure_Access_Type_Access is Result : constant Formal_Procedure_Access_Type_Access := new (Self.Subpool) Program.Nodes.Formal_Procedure_Access_Types .Implicit_Formal_Procedure_Access_Type' (Program.Nodes.Formal_Procedure_Access_Types.Create (Parameters => Parameters, Has_Not_Null => Has_Not_Null, Has_Protected => Has_Protected, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Procedure_Access_Types .Formal_Procedure_Access_Type_Access (Result); end Create_Formal_Procedure_Access_Type; not overriding function Create_Formal_Function_Access_Type (Self : Element_Factory; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Has_Not_Null : Boolean := False; Has_Protected : Boolean := False; Has_Not_Null_2 : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Function_Access_Types .Formal_Function_Access_Type_Access is Result : constant Formal_Function_Access_Type_Access := new (Self.Subpool) Program.Nodes.Formal_Function_Access_Types .Implicit_Formal_Function_Access_Type' (Program.Nodes.Formal_Function_Access_Types.Create (Parameters => Parameters, Result_Subtype => Result_Subtype, Has_Not_Null => Has_Not_Null, Has_Protected => Has_Protected, Has_Not_Null_2 => Has_Not_Null_2, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Function_Access_Types .Formal_Function_Access_Type_Access (Result); end Create_Formal_Function_Access_Type; not overriding function Create_Formal_Interface_Type (Self : Element_Factory; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Has_Limited : Boolean := False; Has_Task : Boolean := False; Has_Protected : Boolean := False; Has_Synchronized : Boolean := False; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Formal_Interface_Types .Formal_Interface_Type_Access is Result : constant Formal_Interface_Type_Access := new (Self.Subpool) Program.Nodes.Formal_Interface_Types .Implicit_Formal_Interface_Type' (Program.Nodes.Formal_Interface_Types.Create (Progenitors => Progenitors, Has_Limited => Has_Limited, Has_Task => Has_Task, Has_Protected => Has_Protected, Has_Synchronized => Has_Synchronized, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Formal_Interface_Types .Formal_Interface_Type_Access (Result); end Create_Formal_Interface_Type; not overriding function Create_Range_Attribute_Reference (Self : Element_Factory; Range_Attribute : not null Program.Elements.Attribute_References .Attribute_Reference_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Range_Attribute_References .Range_Attribute_Reference_Access is Result : constant Range_Attribute_Reference_Access := new (Self.Subpool) Program.Nodes.Range_Attribute_References .Implicit_Range_Attribute_Reference' (Program.Nodes.Range_Attribute_References.Create (Range_Attribute => Range_Attribute, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Range_Attribute_References .Range_Attribute_Reference_Access (Result); end Create_Range_Attribute_Reference; not overriding function Create_Simple_Expression_Range (Self : Element_Factory; Lower_Bound : not null Program.Elements.Expressions .Expression_Access; Upper_Bound : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Simple_Expression_Ranges .Simple_Expression_Range_Access is Result : constant Simple_Expression_Range_Access := new (Self.Subpool) Program.Nodes.Simple_Expression_Ranges .Implicit_Simple_Expression_Range' (Program.Nodes.Simple_Expression_Ranges.Create (Lower_Bound => Lower_Bound, Upper_Bound => Upper_Bound, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Simple_Expression_Ranges .Simple_Expression_Range_Access (Result); end Create_Simple_Expression_Range; not overriding function Create_Digits_Constraint (Self : Element_Factory; Digits_Expression : not null Program.Elements.Expressions .Expression_Access; Real_Range_Constraint : Program.Elements.Constraints.Constraint_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Digits_Constraints .Digits_Constraint_Access is Result : constant Digits_Constraint_Access := new (Self.Subpool) Program.Nodes.Digits_Constraints .Implicit_Digits_Constraint' (Program.Nodes.Digits_Constraints.Create (Digits_Expression => Digits_Expression, Real_Range_Constraint => Real_Range_Constraint, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Digits_Constraints.Digits_Constraint_Access (Result); end Create_Digits_Constraint; not overriding function Create_Delta_Constraint (Self : Element_Factory; Delta_Expression : not null Program.Elements.Expressions .Expression_Access; Real_Range_Constraint : Program.Elements.Constraints.Constraint_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Delta_Constraints .Delta_Constraint_Access is Result : constant Delta_Constraint_Access := new (Self.Subpool) Program.Nodes.Delta_Constraints .Implicit_Delta_Constraint' (Program.Nodes.Delta_Constraints.Create (Delta_Expression => Delta_Expression, Real_Range_Constraint => Real_Range_Constraint, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Delta_Constraints.Delta_Constraint_Access (Result); end Create_Delta_Constraint; not overriding function Create_Index_Constraint (Self : Element_Factory; Ranges : not null Program.Elements.Discrete_Ranges .Discrete_Range_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Index_Constraints .Index_Constraint_Access is Result : constant Index_Constraint_Access := new (Self.Subpool) Program.Nodes.Index_Constraints .Implicit_Index_Constraint' (Program.Nodes.Index_Constraints.Create (Ranges => Ranges, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Index_Constraints.Index_Constraint_Access (Result); end Create_Index_Constraint; not overriding function Create_Discriminant_Constraint (Self : Element_Factory; Discriminants : not null Program.Elements.Discriminant_Associations .Discriminant_Association_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Discriminant_Constraints .Discriminant_Constraint_Access is Result : constant Discriminant_Constraint_Access := new (Self.Subpool) Program.Nodes.Discriminant_Constraints .Implicit_Discriminant_Constraint' (Program.Nodes.Discriminant_Constraints.Create (Discriminants => Discriminants, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Discriminant_Constraints .Discriminant_Constraint_Access (Result); end Create_Discriminant_Constraint; not overriding function Create_Attribute_Definition_Clause (Self : Element_Factory; Name : not null Program.Elements.Expressions .Expression_Access; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Attribute_Definition_Clauses .Attribute_Definition_Clause_Access is Result : constant Attribute_Definition_Clause_Access := new (Self.Subpool) Program.Nodes.Attribute_Definition_Clauses .Implicit_Attribute_Definition_Clause' (Program.Nodes.Attribute_Definition_Clauses.Create (Name => Name, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Attribute_Definition_Clauses .Attribute_Definition_Clause_Access (Result); end Create_Attribute_Definition_Clause; not overriding function Create_Enumeration_Representation_Clause (Self : Element_Factory; Name : not null Program.Elements.Expressions .Expression_Access; Expression : not null Program.Elements.Array_Aggregates .Array_Aggregate_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Enumeration_Representation_Clauses .Enumeration_Representation_Clause_Access is Result : constant Enumeration_Representation_Clause_Access := new (Self.Subpool) Program.Nodes.Enumeration_Representation_Clauses .Implicit_Enumeration_Representation_Clause' (Program.Nodes.Enumeration_Representation_Clauses.Create (Name => Name, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Enumeration_Representation_Clauses .Enumeration_Representation_Clause_Access (Result); end Create_Enumeration_Representation_Clause; not overriding function Create_Record_Representation_Clause (Self : Element_Factory; Name : not null Program.Elements.Expressions .Expression_Access; Mod_Clause_Expression : Program.Elements.Expressions.Expression_Access; Component_Clauses : not null Program.Elements.Component_Clauses .Component_Clause_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Record_Representation_Clauses .Record_Representation_Clause_Access is Result : constant Record_Representation_Clause_Access := new (Self.Subpool) Program.Nodes.Record_Representation_Clauses .Implicit_Record_Representation_Clause' (Program.Nodes.Record_Representation_Clauses.Create (Name => Name, Mod_Clause_Expression => Mod_Clause_Expression, Component_Clauses => Component_Clauses, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Record_Representation_Clauses .Record_Representation_Clause_Access (Result); end Create_Record_Representation_Clause; not overriding function Create_At_Clause (Self : Element_Factory; Name : not null Program.Elements.Identifiers .Identifier_Access; Expression : not null Program.Elements.Expressions .Expression_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.At_Clauses.At_Clause_Access is Result : constant At_Clause_Access := new (Self.Subpool) Program.Nodes.At_Clauses.Implicit_At_Clause' (Program.Nodes.At_Clauses.Create (Name => Name, Expression => Expression, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.At_Clauses.At_Clause_Access (Result); end Create_At_Clause; not overriding function Create_Exception_Handler (Self : Element_Factory; Choice_Parameter : Program.Elements.Choice_Parameter_Specifications .Choice_Parameter_Specification_Access; Choices : not null Program.Element_Vectors .Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return not null Program.Elements.Exception_Handlers .Exception_Handler_Access is Result : constant Exception_Handler_Access := new (Self.Subpool) Program.Nodes.Exception_Handlers .Implicit_Exception_Handler' (Program.Nodes.Exception_Handlers.Create (Choice_Parameter => Choice_Parameter, Choices => Choices, Statements => Statements, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance)); begin return Program.Elements.Exception_Handlers.Exception_Handler_Access (Result); end Create_Exception_Handler; end Program.Implicit_Element_Factories;

46.096443

79

0.711086

a1015f41f15d7c6370749199185ab3b0a8153d2d

1,954

ads

Ada

src/GBA.Display.Palettes.ads

98devin/ada-gba-dev

6ebca014b7537117144d878db8d13db49aa00cee

[ "Zlib" ]

7

2021-04-08T02:32:54.000Z

2022-02-14T01:21:43.000Z

src/GBA.Display.Palettes.ads

98devin/ada-gba-dev

6ebca014b7537117144d878db8d13db49aa00cee

[ "Zlib" ]

15

2021-04-09T20:13:33.000Z

2021-12-22T01:03:59.000Z

src/GBA.Display.Palettes.ads

98devin/ada-gba-dev

6ebca014b7537117144d878db8d13db49aa00cee

[ "Zlib" ]

1

2021-06-12T07:48:05.000Z

-- Copyright (c) 2021 Devin Hill -- zlib License -- see LICENSE for details. with GBA.Memory; use GBA.Memory; use type GBA.Memory.Address; package GBA.Display.Palettes is type Palette_Mode is ( Colors_16 -- 16 palettes of 15 colors + transparent (4-bit indexed color) , Colors_256 -- one palette of 255 colors + transparent (8-bit indexed color) ); for Palette_Mode use ( Colors_16 => 0 , Colors_256 => 1 ); type Unsigned_5 is mod 2**5; type Color is record R, G, B : Unsigned_5; end record with Size => 16; for Color use record R at 0 range 0 .. 4; G at 0 range 5 .. 9; B at 0 range 10 .. 14; end record; type Color_Index_16 is range 0 .. 15 with Size => 4; type Color_Index_256 is range 0 .. 255 with Size => 8; Transparent_Color_Index : constant := 0; type Palette_Index_16 is range 0 .. 15 with Size => 4; type Color_Ref is access all Color with Storage_Size => 0; type Palette_16 is array (Color_Index_16) of Color with Volatile_Components; type Palette_16_Ptr is access all Palette_16 with Storage_Size => 0; type Palette_256 is array (Color_Index_256) of Color with Volatile_Components; type Palette_256_Ptr is access all Palette_256 with Storage_Size => 0; type Palette_16x16 is array (Palette_Index_16) of aliased Palette_16; type Palette_16x16_Ptr is access all Palette_16x16 with Storage_Size => 0; BG_Palette_RAM : constant Address := 16#05000000#; OBJ_Palette_RAM : constant Address := 16#05000200#; BG_Palette_256 : aliased Palette_256 with Import, Address => BG_Palette_RAM; BG_Palette_16x16 : Palette_16x16 with Import, Address => BG_Palette_RAM; OBJ_Palette_256 : aliased Palette_256 with Import, Address => OBJ_Palette_RAM; OBJ_Palette_16x16 : Palette_16x16 with Import, Address => OBJ_Palette_RAM; end GBA.Display.Palettes;

21.010753

82

0.686285

1d535252f6f127837ce4e783939c2d3b02f0681c

1,375

ads

Ada

gdb/testsuite/gdb.ada/arr_acc_idx_w_gap/enum_with_gap.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

1

2020-10-14T03:24:35.000Z

gdb/testsuite/gdb.ada/arr_acc_idx_w_gap/enum_with_gap.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

gdb/testsuite/gdb.ada/arr_acc_idx_w_gap/enum_with_gap.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

-- Copyright 2018-2021 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 Enum_With_Gap is type Enum_With_Gaps is ( LIT0, LIT1, LIT2, LIT3, LIT4 ); for Enum_With_Gaps use ( LIT0 => 3, LIT1 => 5, LIT2 => 8, LIT3 => 13, LIT4 => 21 ); for Enum_With_Gaps'size use 16; type Enum_Subrange is new Enum_With_Gaps range Lit1 .. Lit3; type MyWord is range 0 .. 16#FFFF# ; for MyWord'Size use 16; type AR is array (Enum_With_Gaps range <>) of MyWord; type AR_Access is access AR; type String_Access is access String; procedure Do_Nothing (E : AR_Access); procedure Do_Nothing (E : String_Access); end Enum_With_Gap;

26.960784

73

0.673455

a1cd0e2466a0f46d67b1be447ee675d905c905cd

848

adb

Ada

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/bp_enum_homonym/p.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/bp_enum_homonym/p.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/bp_enum_homonym/p.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2012-2017 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/>. with Pck; use Pck; procedure P is A : Action; begin A := Get_Action; if A = Archive then Archive; end if; end P;

31.407407

73

0.714623

06c3653c467d149917483fcba6cf3a6c1fcbfe2d

3,450

ads

Ada

tools/scitools/conf/understand/ada/ada05/a-suteio.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada05/a-suteio.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada05/a-suteio.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S T R I N G S . U N B O U N D E D . T E X T _ I O -- -- -- -- S p e c -- -- -- -- Copyright (C) 1997-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This child package of Ada.Strings.Unbounded provides some specialized -- Text_IO routines that work directly with unbounded strings, avoiding the -- inefficiencies of access via the standard interface, and also taking -- direct advantage of the variable length semantics of these strings. with Ada.Text_IO; package Ada.Strings.Unbounded.Text_IO is function Get_Line return Unbounded_String; function Get_Line (File : Ada.Text_IO.File_Type) return Unbounded_String; -- Reads up to the end of the current line, returning the result -- as an unbounded string of appropriate length. If no File parameter -- is present, input is from Current_Input. procedure Get_Line (File : Ada.Text_IO.File_Type; Item : out Unbounded_String); procedure Get_Line (Item : out Unbounded_String); -- Similar to the above, but in procedure form with an out parameter procedure Put (U : Unbounded_String); procedure Put (File : Ada.Text_IO.File_Type; U : Unbounded_String); procedure Put_Line (U : Unbounded_String); procedure Put_Line (File : Ada.Text_IO.File_Type; U : Unbounded_String); -- These are equivalent to the standard Text_IO routines passed the -- value To_String (U), but operate more efficiently, because the extra -- copy of the argument is avoided. end Ada.Strings.Unbounded.Text_IO;

53.90625

78

0.506957

1ccf290fbee00fbd96cf744f4cf9ed93901c9b10

15,063

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-coorse.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-coorse.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-coorse.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . C O N T A I N E R S . O R D E R E D _ S E T S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with Ada.Iterator_Interfaces; with Ada.Containers.Helpers; private with Ada.Containers.Red_Black_Trees; private with Ada.Finalization; private with Ada.Streams; private with Ada.Strings.Text_Output; generic type Element_Type is private; with function "<" (Left, Right : Element_Type) return Boolean is <>; with function "=" (Left, Right : Element_Type) return Boolean is <>; package Ada.Containers.Ordered_Sets with SPARK_Mode => Off is pragma Annotate (CodePeer, Skip_Analysis); pragma Preelaborate; pragma Remote_Types; function Equivalent_Elements (Left, Right : Element_Type) return Boolean; type Set is tagged private with Constant_Indexing => Constant_Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type; -- Aggregate => (Empty => Empty, -- Add_Unnamed => Include); pragma Preelaborable_Initialization (Set); type Cursor is private; pragma Preelaborable_Initialization (Cursor); function Has_Element (Position : Cursor) return Boolean; Empty_Set : constant Set; function Empty return Set; No_Element : constant Cursor; package Set_Iterator_Interfaces is new Ada.Iterator_Interfaces (Cursor, Has_Element); function "=" (Left, Right : Set) return Boolean; function Equivalent_Sets (Left, Right : Set) return Boolean; function To_Set (New_Item : Element_Type) return Set; function Length (Container : Set) return Count_Type; function Is_Empty (Container : Set) return Boolean; procedure Clear (Container : in out Set); function Element (Position : Cursor) return Element_Type; procedure Replace_Element (Container : in out Set; Position : Cursor; New_Item : Element_Type); procedure Query_Element (Position : Cursor; Process : not null access procedure (Element : Element_Type)); type Constant_Reference_Type (Element : not null access constant Element_Type) is private with Implicit_Dereference => Element; function Constant_Reference (Container : aliased Set; Position : Cursor) return Constant_Reference_Type; pragma Inline (Constant_Reference); procedure Assign (Target : in out Set; Source : Set); function Copy (Source : Set) return Set; procedure Move (Target : in out Set; Source : in out Set); procedure Insert (Container : in out Set; New_Item : Element_Type; Position : out Cursor; Inserted : out Boolean); procedure Insert (Container : in out Set; New_Item : Element_Type); procedure Include (Container : in out Set; New_Item : Element_Type); procedure Replace (Container : in out Set; New_Item : Element_Type); procedure Exclude (Container : in out Set; Item : Element_Type); procedure Delete (Container : in out Set; Item : Element_Type); procedure Delete (Container : in out Set; Position : in out Cursor); procedure Delete_First (Container : in out Set); procedure Delete_Last (Container : in out Set); procedure Union (Target : in out Set; Source : Set); function Union (Left, Right : Set) return Set; function "or" (Left, Right : Set) return Set renames Union; procedure Intersection (Target : in out Set; Source : Set); function Intersection (Left, Right : Set) return Set; function "and" (Left, Right : Set) return Set renames Intersection; procedure Difference (Target : in out Set; Source : Set); function Difference (Left, Right : Set) return Set; function "-" (Left, Right : Set) return Set renames Difference; procedure Symmetric_Difference (Target : in out Set; Source : Set); function Symmetric_Difference (Left, Right : Set) return Set; function "xor" (Left, Right : Set) return Set renames Symmetric_Difference; function Overlap (Left, Right : Set) return Boolean; function Is_Subset (Subset : Set; Of_Set : Set) return Boolean; function First (Container : Set) return Cursor; function First_Element (Container : Set) return Element_Type; function Last (Container : Set) return Cursor; function Last_Element (Container : Set) return Element_Type; function Next (Position : Cursor) return Cursor; procedure Next (Position : in out Cursor); function Previous (Position : Cursor) return Cursor; procedure Previous (Position : in out Cursor); function Find (Container : Set; Item : Element_Type) return Cursor; function Floor (Container : Set; Item : Element_Type) return Cursor; function Ceiling (Container : Set; Item : Element_Type) return Cursor; function Contains (Container : Set; Item : Element_Type) return Boolean; function "<" (Left, Right : Cursor) return Boolean; function ">" (Left, Right : Cursor) return Boolean; function "<" (Left : Cursor; Right : Element_Type) return Boolean; function ">" (Left : Cursor; Right : Element_Type) return Boolean; function "<" (Left : Element_Type; Right : Cursor) return Boolean; function ">" (Left : Element_Type; Right : Cursor) return Boolean; procedure Iterate (Container : Set; Process : not null access procedure (Position : Cursor)); procedure Reverse_Iterate (Container : Set; Process : not null access procedure (Position : Cursor)); function Iterate (Container : Set) return Set_Iterator_Interfaces.Reversible_Iterator'class; function Iterate (Container : Set; Start : Cursor) return Set_Iterator_Interfaces.Reversible_Iterator'class; generic type Key_Type (<>) is private; with function Key (Element : Element_Type) return Key_Type; with function "<" (Left, Right : Key_Type) return Boolean is <>; package Generic_Keys is function Equivalent_Keys (Left, Right : Key_Type) return Boolean; function Key (Position : Cursor) return Key_Type; function Element (Container : Set; Key : Key_Type) return Element_Type; procedure Replace (Container : in out Set; Key : Key_Type; New_Item : Element_Type); procedure Exclude (Container : in out Set; Key : Key_Type); procedure Delete (Container : in out Set; Key : Key_Type); function Find (Container : Set; Key : Key_Type) return Cursor; function Floor (Container : Set; Key : Key_Type) return Cursor; function Ceiling (Container : Set; Key : Key_Type) return Cursor; function Contains (Container : Set; Key : Key_Type) return Boolean; procedure Update_Element_Preserving_Key (Container : in out Set; Position : Cursor; Process : not null access procedure (Element : in out Element_Type)); type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference => Element; function Reference_Preserving_Key (Container : aliased in out Set; Position : Cursor) return Reference_Type; function Constant_Reference (Container : aliased Set; Key : Key_Type) return Constant_Reference_Type; function Reference_Preserving_Key (Container : aliased in out Set; Key : Key_Type) return Reference_Type; private type Set_Access is access all Set; for Set_Access'Storage_Size use 0; type Key_Access is access all Key_Type; package Impl is new Helpers.Generic_Implementation; type Reference_Control_Type is new Impl.Reference_Control_Type with record Container : Set_Access; Pos : Cursor; Old_Key : Key_Access; end record; overriding procedure Finalize (Control : in out Reference_Control_Type); pragma Inline (Finalize); type Reference_Type (Element : not null access Element_Type) is record Control : Reference_Control_Type; end record; use Ada.Streams; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Reference_Type); for Reference_Type'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Reference_Type); for Reference_Type'Read use Read; end Generic_Keys; private pragma Inline (Next); pragma Inline (Previous); type Node_Type; type Node_Access is access Node_Type; type Node_Type is limited record Parent : Node_Access; Left : Node_Access; Right : Node_Access; Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red; Element : aliased Element_Type; end record; package Tree_Types is new Red_Black_Trees.Generic_Tree_Types (Node_Type, Node_Access); type Set is new Ada.Finalization.Controlled with record Tree : Tree_Types.Tree_Type; end record with Put_Image => Put_Image; procedure Put_Image (S : in out Ada.Strings.Text_Output.Sink'Class; V : Set); overriding procedure Adjust (Container : in out Set); overriding procedure Finalize (Container : in out Set) renames Clear; use Red_Black_Trees; use Tree_Types, Tree_Types.Implementation; use Ada.Finalization; use Ada.Streams; procedure Write (Stream : not null access Root_Stream_Type'Class; Container : Set); for Set'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Container : out Set); for Set'Read use Read; type Set_Access is access all Set; for Set_Access'Storage_Size use 0; type Cursor is record Container : Set_Access; Node : Node_Access; end record; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Cursor); for Cursor'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Cursor); for Cursor'Read use Read; subtype Reference_Control_Type is Implementation.Reference_Control_Type; -- It is necessary to rename this here, so that the compiler can find it type Constant_Reference_Type (Element : not null access constant Element_Type) is record Control : Reference_Control_Type := raise Program_Error with "uninitialized reference"; -- The RM says, "The default initialization of an object of -- type Constant_Reference_Type or Reference_Type propagates -- Program_Error." end record; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Constant_Reference_Type); for Constant_Reference_Type'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Constant_Reference_Type); for Constant_Reference_Type'Read use Read; -- Three operations are used to optimize in the expansion of "for ... of" -- loops: the Next(Cursor) procedure in the visible part, and the following -- Pseudo_Reference and Get_Element_Access functions. See Sem_Ch5 for -- details. function Pseudo_Reference (Container : aliased Set'Class) return Reference_Control_Type; pragma Inline (Pseudo_Reference); -- Creates an object of type Reference_Control_Type pointing to the -- container, and increments the Lock. Finalization of this object will -- decrement the Lock. type Element_Access is access all Element_Type with Storage_Size => 0; function Get_Element_Access (Position : Cursor) return not null Element_Access; -- Returns a pointer to the element designated by Position. Empty_Set : constant Set := (Controlled with others => <>); function Empty return Set is (Empty_Set); No_Element : constant Cursor := Cursor'(null, null); type Iterator is new Limited_Controlled and Set_Iterator_Interfaces.Reversible_Iterator with record Container : Set_Access; Node : Node_Access; end record with Disable_Controlled => not T_Check; overriding procedure Finalize (Object : in out Iterator); overriding function First (Object : Iterator) return Cursor; overriding function Last (Object : Iterator) return Cursor; overriding function Next (Object : Iterator; Position : Cursor) return Cursor; overriding function Previous (Object : Iterator; Position : Cursor) return Cursor; end Ada.Containers.Ordered_Sets;

32.463362

79

0.636394

12d904dbbd8a11fb704e56a1b915dae9dce2cadc

4,111

adb

Ada

source/amf/uml/amf-internals-umldi_uml_diagrams.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-internals-umldi_uml_diagrams.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-internals-umldi_uml_diagrams.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <[email protected]> -- -- 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.Tables.UML_Attributes; package body AMF.Internals.UMLDI_UML_Diagrams is ---------------- -- Get_Bounds -- ---------------- overriding function Get_Bounds (Self : not null access constant UMLDI_UML_Diagram_Proxy) return AMF.DC.Optional_DC_Bounds is begin return AMF.Internals.Tables.UML_Attributes.Internal_Get_Bounds (Self.Element); end Get_Bounds; ---------------- -- Set_Bounds -- ---------------- overriding procedure Set_Bounds (Self : not null access UMLDI_UML_Diagram_Proxy; To : AMF.DC.Optional_DC_Bounds) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Bounds (Self.Element, To); end Set_Bounds; end AMF.Internals.UMLDI_UML_Diagrams;

55.554054

78

0.437363

1df483f8a495fa060d1f01a328c9dd6aa750c406

59,318

ads

Ada

arch/ARM/RP/svd/rp2040/rp_svd-sio.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/RP/svd/rp2040/rp_svd-sio.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/RP/svd/rp2040/rp_svd-sio.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

-- Copyright (c) 2020 Raspberry Pi (Trading) Ltd. -- -- SPDX-License-Identifier: BSD-3-Clause -- This spec has been automatically generated from rp2040.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; -- Single-cycle IO block\n -- Provides core-local and inter-core hardware for the two processors, -- with single-cycle access. package RP_SVD.SIO is pragma Preelaborate; --------------- -- Registers -- --------------- subtype GPIO_IN_GPIO_IN_Field is HAL.UInt30; -- Input value for GPIO pins type GPIO_IN_Register is record -- Read-only. Input value for GPIO0...29 GPIO_IN : GPIO_IN_GPIO_IN_Field; -- unspecified Reserved_30_31 : HAL.UInt2; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_IN_Register use record GPIO_IN at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_HI_IN_GPIO_HI_IN_Field is HAL.UInt6; -- Input value for QSPI pins type GPIO_HI_IN_Register is record -- Read-only. Input value on QSPI IO in order 0..5: SCLK, SSn, SD0, SD1, -- SD2, SD3 GPIO_HI_IN : GPIO_HI_IN_GPIO_HI_IN_Field; -- unspecified Reserved_6_31 : HAL.UInt26; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_IN_Register use record GPIO_HI_IN at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_OUT_GPIO_OUT_Field is HAL.UInt30; -- GPIO output value type GPIO_OUT_Register is record -- Set output level (1/0 -> high/low) for GPIO0...29.\n Reading back -- gives the last value written, NOT the input value from the pins.\n If -- core 0 and core 1 both write to GPIO_OUT simultaneously (or to a -- SET/CLR/XOR alias),\n the result is as though the write from core 0 -- took place first,\n and the write from core 1 was then applied to -- that intermediate result. GPIO_OUT : GPIO_OUT_GPIO_OUT_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OUT_Register use record GPIO_OUT at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_OUT_SET_GPIO_OUT_SET_Field is HAL.UInt30; -- GPIO output value set type GPIO_OUT_SET_Register is record -- Perform an atomic bit-set on GPIO_OUT, i.e. `GPIO_OUT |= wdata` GPIO_OUT_SET : GPIO_OUT_SET_GPIO_OUT_SET_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OUT_SET_Register use record GPIO_OUT_SET at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_OUT_CLR_GPIO_OUT_CLR_Field is HAL.UInt30; -- GPIO output value clear type GPIO_OUT_CLR_Register is record -- Perform an atomic bit-clear on GPIO_OUT, i.e. `GPIO_OUT &= ~wdata` GPIO_OUT_CLR : GPIO_OUT_CLR_GPIO_OUT_CLR_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OUT_CLR_Register use record GPIO_OUT_CLR at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_OUT_XOR_GPIO_OUT_XOR_Field is HAL.UInt30; -- GPIO output value XOR type GPIO_OUT_XOR_Register is record -- Perform an atomic bitwise XOR on GPIO_OUT, i.e. `GPIO_OUT ^= wdata` GPIO_OUT_XOR : GPIO_OUT_XOR_GPIO_OUT_XOR_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OUT_XOR_Register use record GPIO_OUT_XOR at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_OE_GPIO_OE_Field is HAL.UInt30; -- GPIO output enable type GPIO_OE_Register is record -- Set output enable (1/0 -> output/input) for GPIO0...29.\n Reading -- back gives the last value written.\n If core 0 and core 1 both write -- to GPIO_OE simultaneously (or to a SET/CLR/XOR alias),\n the result -- is as though the write from core 0 took place first,\n and the write -- from core 1 was then applied to that intermediate result. GPIO_OE : GPIO_OE_GPIO_OE_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OE_Register use record GPIO_OE at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_OE_SET_GPIO_OE_SET_Field is HAL.UInt30; -- GPIO output enable set type GPIO_OE_SET_Register is record -- Perform an atomic bit-set on GPIO_OE, i.e. `GPIO_OE |= wdata` GPIO_OE_SET : GPIO_OE_SET_GPIO_OE_SET_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OE_SET_Register use record GPIO_OE_SET at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_OE_CLR_GPIO_OE_CLR_Field is HAL.UInt30; -- GPIO output enable clear type GPIO_OE_CLR_Register is record -- Perform an atomic bit-clear on GPIO_OE, i.e. `GPIO_OE &= ~wdata` GPIO_OE_CLR : GPIO_OE_CLR_GPIO_OE_CLR_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OE_CLR_Register use record GPIO_OE_CLR at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_OE_XOR_GPIO_OE_XOR_Field is HAL.UInt30; -- GPIO output enable XOR type GPIO_OE_XOR_Register is record -- Perform an atomic bitwise XOR on GPIO_OE, i.e. `GPIO_OE ^= wdata` GPIO_OE_XOR : GPIO_OE_XOR_GPIO_OE_XOR_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_OE_XOR_Register use record GPIO_OE_XOR at 0 range 0 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; subtype GPIO_HI_OUT_GPIO_HI_OUT_Field is HAL.UInt6; -- QSPI output value type GPIO_HI_OUT_Register is record -- Set output level (1/0 -> high/low) for QSPI IO0...5.\n Reading back -- gives the last value written, NOT the input value from the pins.\n If -- core 0 and core 1 both write to GPIO_HI_OUT simultaneously (or to a -- SET/CLR/XOR alias),\n the result is as though the write from core 0 -- took place first,\n and the write from core 1 was then applied to -- that intermediate result. GPIO_HI_OUT : GPIO_HI_OUT_GPIO_HI_OUT_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OUT_Register use record GPIO_HI_OUT at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_HI_OUT_SET_GPIO_HI_OUT_SET_Field is HAL.UInt6; -- QSPI output value set type GPIO_HI_OUT_SET_Register is record -- Perform an atomic bit-set on GPIO_HI_OUT, i.e. `GPIO_HI_OUT |= wdata` GPIO_HI_OUT_SET : GPIO_HI_OUT_SET_GPIO_HI_OUT_SET_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OUT_SET_Register use record GPIO_HI_OUT_SET at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_HI_OUT_CLR_GPIO_HI_OUT_CLR_Field is HAL.UInt6; -- QSPI output value clear type GPIO_HI_OUT_CLR_Register is record -- Perform an atomic bit-clear on GPIO_HI_OUT, i.e. `GPIO_HI_OUT &= -- ~wdata` GPIO_HI_OUT_CLR : GPIO_HI_OUT_CLR_GPIO_HI_OUT_CLR_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OUT_CLR_Register use record GPIO_HI_OUT_CLR at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_HI_OUT_XOR_GPIO_HI_OUT_XOR_Field is HAL.UInt6; -- QSPI output value XOR type GPIO_HI_OUT_XOR_Register is record -- Perform an atomic bitwise XOR on GPIO_HI_OUT, i.e. `GPIO_HI_OUT ^= -- wdata` GPIO_HI_OUT_XOR : GPIO_HI_OUT_XOR_GPIO_HI_OUT_XOR_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OUT_XOR_Register use record GPIO_HI_OUT_XOR at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_HI_OE_GPIO_HI_OE_Field is HAL.UInt6; -- QSPI output enable type GPIO_HI_OE_Register is record -- Set output enable (1/0 -> output/input) for QSPI IO0...5.\n Reading -- back gives the last value written.\n If core 0 and core 1 both write -- to GPIO_HI_OE simultaneously (or to a SET/CLR/XOR alias),\n the -- result is as though the write from core 0 took place first,\n and the -- write from core 1 was then applied to that intermediate result. GPIO_HI_OE : GPIO_HI_OE_GPIO_HI_OE_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OE_Register use record GPIO_HI_OE at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_HI_OE_SET_GPIO_HI_OE_SET_Field is HAL.UInt6; -- QSPI output enable set type GPIO_HI_OE_SET_Register is record -- Perform an atomic bit-set on GPIO_HI_OE, i.e. `GPIO_HI_OE |= wdata` GPIO_HI_OE_SET : GPIO_HI_OE_SET_GPIO_HI_OE_SET_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OE_SET_Register use record GPIO_HI_OE_SET at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_HI_OE_CLR_GPIO_HI_OE_CLR_Field is HAL.UInt6; -- QSPI output enable clear type GPIO_HI_OE_CLR_Register is record -- Perform an atomic bit-clear on GPIO_HI_OE, i.e. `GPIO_HI_OE &= -- ~wdata` GPIO_HI_OE_CLR : GPIO_HI_OE_CLR_GPIO_HI_OE_CLR_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OE_CLR_Register use record GPIO_HI_OE_CLR at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype GPIO_HI_OE_XOR_GPIO_HI_OE_XOR_Field is HAL.UInt6; -- QSPI output enable XOR type GPIO_HI_OE_XOR_Register is record -- Perform an atomic bitwise XOR on GPIO_HI_OE, i.e. `GPIO_HI_OE ^= -- wdata` GPIO_HI_OE_XOR : GPIO_HI_OE_XOR_GPIO_HI_OE_XOR_Field := 16#0#; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for GPIO_HI_OE_XOR_Register use record GPIO_HI_OE_XOR at 0 range 0 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; -- Status register for inter-core FIFOs (mailboxes).\n There is one FIFO in -- the core 0 -> core 1 direction, and one core 1 -> core 0. Both are 32 -- bits wide and 8 words deep.\n Core 0 can see the read side of the 1->0 -- FIFO (RX), and the write side of 0->1 FIFO (TX).\n Core 1 can see the -- read side of the 0->1 FIFO (RX), and the write side of 1->0 FIFO (TX).\n -- The SIO IRQ for each core is the logical OR of the VLD, WOF and ROE -- fields of its FIFO_ST register. type FIFO_ST_Register is record -- Read-only. Value is 1 if this core's RX FIFO is not empty (i.e. if -- FIFO_RD is valid) VLD : Boolean := False; -- Read-only. Value is 1 if this core's TX FIFO is not full (i.e. if -- FIFO_WR is ready for more data) RDY : Boolean := True; -- Write data bit of one shall clear (set to zero) the corresponding bit -- in the field. Sticky flag indicating the TX FIFO was written when -- full. This write was ignored by the FIFO. WOF : Boolean := False; -- Write data bit of one shall clear (set to zero) the corresponding bit -- in the field. Sticky flag indicating the RX FIFO was read when empty. -- This read was ignored by the FIFO. ROE : Boolean := False; -- unspecified Reserved_4_31 : HAL.UInt28 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for FIFO_ST_Register use record VLD at 0 range 0 .. 0; RDY at 0 range 1 .. 1; WOF at 0 range 2 .. 2; ROE at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Control and status register for divider. type DIV_CSR_Register is record -- Read-only. Reads as 0 when a calculation is in progress, 1 -- otherwise.\n Writing an operand (xDIVIDEND, xDIVISOR) will -- immediately start a new calculation, no\n matter if one is already in -- progress.\n Writing to a result register will immediately terminate -- any in-progress calculation\n and set the READY and DIRTY flags. READY : Boolean; -- Read-only. Changes to 1 when any register is written, and back to 0 -- when QUOTIENT is read.\n Software can use this flag to make -- save/restore more efficient (skip if not DIRTY).\n If the flag is -- used in this way, it's recommended to either read QUOTIENT only,\n or -- REMAINDER and then QUOTIENT, to prevent data loss on context switch. DIRTY : Boolean; -- unspecified Reserved_2_31 : HAL.UInt30; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for DIV_CSR_Register use record READY at 0 range 0 .. 0; DIRTY at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; subtype INTERP0_CTRL_LANE0_SHIFT_Field is HAL.UInt5; subtype INTERP0_CTRL_LANE0_MASK_LSB_Field is HAL.UInt5; subtype INTERP0_CTRL_LANE0_MASK_MSB_Field is HAL.UInt5; subtype INTERP0_CTRL_LANE0_FORCE_MSB_Field is HAL.UInt2; -- INTERP0_CTRL_LANE0_OVERF array type INTERP0_CTRL_LANE0_OVERF_Field_Array is array (0 .. 2) of Boolean with Component_Size => 1, Size => 3; -- Type definition for INTERP0_CTRL_LANE0_OVERF type INTERP0_CTRL_LANE0_OVERF_Field (As_Array : Boolean := False) is record case As_Array is when False => -- OVERF as a value Val : HAL.UInt3; when True => -- OVERF as an array Arr : INTERP0_CTRL_LANE0_OVERF_Field_Array; end case; end record with Unchecked_Union, Size => 3; for INTERP0_CTRL_LANE0_OVERF_Field use record Val at 0 range 0 .. 2; Arr at 0 range 0 .. 2; end record; -- Control register for lane 0 type INTERP0_CTRL_LANE0_Register is record -- Logical right-shift applied to accumulator before masking SHIFT : INTERP0_CTRL_LANE0_SHIFT_Field := 16#0#; -- The least-significant bit allowed to pass by the mask (inclusive) MASK_LSB : INTERP0_CTRL_LANE0_MASK_LSB_Field := 16#0#; -- The most-significant bit allowed to pass by the mask (inclusive)\n -- Setting MSB < LSB may cause chip to turn inside-out MASK_MSB : INTERP0_CTRL_LANE0_MASK_MSB_Field := 16#0#; -- If SIGNED is set, the shifted and masked accumulator value is -- sign-extended to 32 bits\n before adding to BASE0, and LANE0 PEEK/POP -- appear extended to 32 bits when read by processor. SIGNED : Boolean := False; -- If 1, feed the opposite lane's accumulator into this lane's shift + -- mask hardware.\n Takes effect even if ADD_RAW is set (the CROSS_INPUT -- mux is before the shift+mask bypass) CROSS_INPUT : Boolean := False; -- If 1, feed the opposite lane's result into this lane's accumulator on -- POP. CROSS_RESULT : Boolean := False; -- If 1, mask + shift is bypassed for LANE0 result. This does not affect -- FULL result. ADD_RAW : Boolean := False; -- ORed into bits 29:28 of the lane result presented to the processor on -- the bus.\n No effect on the internal 32-bit datapath. Handy for using -- a lane to generate sequence\n of pointers into flash or SRAM. FORCE_MSB : INTERP0_CTRL_LANE0_FORCE_MSB_Field := 16#0#; -- Only present on INTERP0 on each core. If BLEND mode is enabled:\n - -- LANE1 result is a linear interpolation between BASE0 and BASE1, -- controlled\n by the 8 LSBs of lane 1 shift and mask value (a -- fractional number between\n 0 and 255/256ths)\n - LANE0 result does -- not have BASE0 added (yields only the 8 LSBs of lane 1 shift+mask -- value)\n - FULL result does not have lane 1 shift+mask value added -- (BASE2 + lane 0 shift+mask)\n LANE1 SIGNED flag controls whether the -- interpolation is signed or unsigned. BLEND : Boolean := False; -- unspecified Reserved_22_22 : HAL.Bit := 16#0#; -- Read-only. Indicates if any masked-off MSBs in ACCUM0 are set. OVERF : INTERP0_CTRL_LANE0_OVERF_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_26_31 : HAL.UInt6 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP0_CTRL_LANE0_Register use record SHIFT at 0 range 0 .. 4; MASK_LSB at 0 range 5 .. 9; MASK_MSB at 0 range 10 .. 14; SIGNED at 0 range 15 .. 15; CROSS_INPUT at 0 range 16 .. 16; CROSS_RESULT at 0 range 17 .. 17; ADD_RAW at 0 range 18 .. 18; FORCE_MSB at 0 range 19 .. 20; BLEND at 0 range 21 .. 21; Reserved_22_22 at 0 range 22 .. 22; OVERF at 0 range 23 .. 25; Reserved_26_31 at 0 range 26 .. 31; end record; subtype INTERP0_CTRL_LANE1_SHIFT_Field is HAL.UInt5; subtype INTERP0_CTRL_LANE1_MASK_LSB_Field is HAL.UInt5; subtype INTERP0_CTRL_LANE1_MASK_MSB_Field is HAL.UInt5; subtype INTERP0_CTRL_LANE1_FORCE_MSB_Field is HAL.UInt2; -- Control register for lane 1 type INTERP0_CTRL_LANE1_Register is record -- Logical right-shift applied to accumulator before masking SHIFT : INTERP0_CTRL_LANE1_SHIFT_Field := 16#0#; -- The least-significant bit allowed to pass by the mask (inclusive) MASK_LSB : INTERP0_CTRL_LANE1_MASK_LSB_Field := 16#0#; -- The most-significant bit allowed to pass by the mask (inclusive)\n -- Setting MSB < LSB may cause chip to turn inside-out MASK_MSB : INTERP0_CTRL_LANE1_MASK_MSB_Field := 16#0#; -- If SIGNED is set, the shifted and masked accumulator value is -- sign-extended to 32 bits\n before adding to BASE1, and LANE1 PEEK/POP -- appear extended to 32 bits when read by processor. SIGNED : Boolean := False; -- If 1, feed the opposite lane's accumulator into this lane's shift + -- mask hardware.\n Takes effect even if ADD_RAW is set (the CROSS_INPUT -- mux is before the shift+mask bypass) CROSS_INPUT : Boolean := False; -- If 1, feed the opposite lane's result into this lane's accumulator on -- POP. CROSS_RESULT : Boolean := False; -- If 1, mask + shift is bypassed for LANE1 result. This does not affect -- FULL result. ADD_RAW : Boolean := False; -- ORed into bits 29:28 of the lane result presented to the processor on -- the bus.\n No effect on the internal 32-bit datapath. Handy for using -- a lane to generate sequence\n of pointers into flash or SRAM. FORCE_MSB : INTERP0_CTRL_LANE1_FORCE_MSB_Field := 16#0#; -- unspecified Reserved_21_31 : HAL.UInt11 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP0_CTRL_LANE1_Register use record SHIFT at 0 range 0 .. 4; MASK_LSB at 0 range 5 .. 9; MASK_MSB at 0 range 10 .. 14; SIGNED at 0 range 15 .. 15; CROSS_INPUT at 0 range 16 .. 16; CROSS_RESULT at 0 range 17 .. 17; ADD_RAW at 0 range 18 .. 18; FORCE_MSB at 0 range 19 .. 20; Reserved_21_31 at 0 range 21 .. 31; end record; subtype INTERP0_ACCUM0_ADD_INTERP0_ACCUM0_ADD_Field is HAL.UInt24; -- Values written here are atomically added to ACCUM0\n Reading yields lane -- 0's raw shift and mask value (BASE0 not added). type INTERP0_ACCUM0_ADD_Register is record INTERP0_ACCUM0_ADD : INTERP0_ACCUM0_ADD_INTERP0_ACCUM0_ADD_Field := 16#0#; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP0_ACCUM0_ADD_Register use record INTERP0_ACCUM0_ADD at 0 range 0 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype INTERP0_ACCUM1_ADD_INTERP0_ACCUM1_ADD_Field is HAL.UInt24; -- Values written here are atomically added to ACCUM1\n Reading yields lane -- 1's raw shift and mask value (BASE1 not added). type INTERP0_ACCUM1_ADD_Register is record INTERP0_ACCUM1_ADD : INTERP0_ACCUM1_ADD_INTERP0_ACCUM1_ADD_Field := 16#0#; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP0_ACCUM1_ADD_Register use record INTERP0_ACCUM1_ADD at 0 range 0 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype INTERP1_CTRL_LANE0_SHIFT_Field is HAL.UInt5; subtype INTERP1_CTRL_LANE0_MASK_LSB_Field is HAL.UInt5; subtype INTERP1_CTRL_LANE0_MASK_MSB_Field is HAL.UInt5; subtype INTERP1_CTRL_LANE0_FORCE_MSB_Field is HAL.UInt2; -- INTERP1_CTRL_LANE0_OVERF array type INTERP1_CTRL_LANE0_OVERF_Field_Array is array (0 .. 2) of Boolean with Component_Size => 1, Size => 3; -- Type definition for INTERP1_CTRL_LANE0_OVERF type INTERP1_CTRL_LANE0_OVERF_Field (As_Array : Boolean := False) is record case As_Array is when False => -- OVERF as a value Val : HAL.UInt3; when True => -- OVERF as an array Arr : INTERP1_CTRL_LANE0_OVERF_Field_Array; end case; end record with Unchecked_Union, Size => 3; for INTERP1_CTRL_LANE0_OVERF_Field use record Val at 0 range 0 .. 2; Arr at 0 range 0 .. 2; end record; -- Control register for lane 0 type INTERP1_CTRL_LANE0_Register is record -- Logical right-shift applied to accumulator before masking SHIFT : INTERP1_CTRL_LANE0_SHIFT_Field := 16#0#; -- The least-significant bit allowed to pass by the mask (inclusive) MASK_LSB : INTERP1_CTRL_LANE0_MASK_LSB_Field := 16#0#; -- The most-significant bit allowed to pass by the mask (inclusive)\n -- Setting MSB < LSB may cause chip to turn inside-out MASK_MSB : INTERP1_CTRL_LANE0_MASK_MSB_Field := 16#0#; -- If SIGNED is set, the shifted and masked accumulator value is -- sign-extended to 32 bits\n before adding to BASE0, and LANE0 PEEK/POP -- appear extended to 32 bits when read by processor. SIGNED : Boolean := False; -- If 1, feed the opposite lane's accumulator into this lane's shift + -- mask hardware.\n Takes effect even if ADD_RAW is set (the CROSS_INPUT -- mux is before the shift+mask bypass) CROSS_INPUT : Boolean := False; -- If 1, feed the opposite lane's result into this lane's accumulator on -- POP. CROSS_RESULT : Boolean := False; -- If 1, mask + shift is bypassed for LANE0 result. This does not affect -- FULL result. ADD_RAW : Boolean := False; -- ORed into bits 29:28 of the lane result presented to the processor on -- the bus.\n No effect on the internal 32-bit datapath. Handy for using -- a lane to generate sequence\n of pointers into flash or SRAM. FORCE_MSB : INTERP1_CTRL_LANE0_FORCE_MSB_Field := 16#0#; -- unspecified Reserved_21_21 : HAL.Bit := 16#0#; -- Only present on INTERP1 on each core. If CLAMP mode is enabled:\n - -- LANE0 result is shifted and masked ACCUM0, clamped by a lower bound -- of\n BASE0 and an upper bound of BASE1.\n - Signedness of these -- comparisons is determined by LANE0_CTRL_SIGNED CLAMP : Boolean := False; -- Read-only. Indicates if any masked-off MSBs in ACCUM0 are set. OVERF : INTERP1_CTRL_LANE0_OVERF_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_26_31 : HAL.UInt6 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP1_CTRL_LANE0_Register use record SHIFT at 0 range 0 .. 4; MASK_LSB at 0 range 5 .. 9; MASK_MSB at 0 range 10 .. 14; SIGNED at 0 range 15 .. 15; CROSS_INPUT at 0 range 16 .. 16; CROSS_RESULT at 0 range 17 .. 17; ADD_RAW at 0 range 18 .. 18; FORCE_MSB at 0 range 19 .. 20; Reserved_21_21 at 0 range 21 .. 21; CLAMP at 0 range 22 .. 22; OVERF at 0 range 23 .. 25; Reserved_26_31 at 0 range 26 .. 31; end record; subtype INTERP1_CTRL_LANE1_SHIFT_Field is HAL.UInt5; subtype INTERP1_CTRL_LANE1_MASK_LSB_Field is HAL.UInt5; subtype INTERP1_CTRL_LANE1_MASK_MSB_Field is HAL.UInt5; subtype INTERP1_CTRL_LANE1_FORCE_MSB_Field is HAL.UInt2; -- Control register for lane 1 type INTERP1_CTRL_LANE1_Register is record -- Logical right-shift applied to accumulator before masking SHIFT : INTERP1_CTRL_LANE1_SHIFT_Field := 16#0#; -- The least-significant bit allowed to pass by the mask (inclusive) MASK_LSB : INTERP1_CTRL_LANE1_MASK_LSB_Field := 16#0#; -- The most-significant bit allowed to pass by the mask (inclusive)\n -- Setting MSB < LSB may cause chip to turn inside-out MASK_MSB : INTERP1_CTRL_LANE1_MASK_MSB_Field := 16#0#; -- If SIGNED is set, the shifted and masked accumulator value is -- sign-extended to 32 bits\n before adding to BASE1, and LANE1 PEEK/POP -- appear extended to 32 bits when read by processor. SIGNED : Boolean := False; -- If 1, feed the opposite lane's accumulator into this lane's shift + -- mask hardware.\n Takes effect even if ADD_RAW is set (the CROSS_INPUT -- mux is before the shift+mask bypass) CROSS_INPUT : Boolean := False; -- If 1, feed the opposite lane's result into this lane's accumulator on -- POP. CROSS_RESULT : Boolean := False; -- If 1, mask + shift is bypassed for LANE1 result. This does not affect -- FULL result. ADD_RAW : Boolean := False; -- ORed into bits 29:28 of the lane result presented to the processor on -- the bus.\n No effect on the internal 32-bit datapath. Handy for using -- a lane to generate sequence\n of pointers into flash or SRAM. FORCE_MSB : INTERP1_CTRL_LANE1_FORCE_MSB_Field := 16#0#; -- unspecified Reserved_21_31 : HAL.UInt11 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP1_CTRL_LANE1_Register use record SHIFT at 0 range 0 .. 4; MASK_LSB at 0 range 5 .. 9; MASK_MSB at 0 range 10 .. 14; SIGNED at 0 range 15 .. 15; CROSS_INPUT at 0 range 16 .. 16; CROSS_RESULT at 0 range 17 .. 17; ADD_RAW at 0 range 18 .. 18; FORCE_MSB at 0 range 19 .. 20; Reserved_21_31 at 0 range 21 .. 31; end record; subtype INTERP1_ACCUM0_ADD_INTERP1_ACCUM0_ADD_Field is HAL.UInt24; -- Values written here are atomically added to ACCUM0\n Reading yields lane -- 0's raw shift and mask value (BASE0 not added). type INTERP1_ACCUM0_ADD_Register is record INTERP1_ACCUM0_ADD : INTERP1_ACCUM0_ADD_INTERP1_ACCUM0_ADD_Field := 16#0#; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP1_ACCUM0_ADD_Register use record INTERP1_ACCUM0_ADD at 0 range 0 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype INTERP1_ACCUM1_ADD_INTERP1_ACCUM1_ADD_Field is HAL.UInt24; -- Values written here are atomically added to ACCUM1\n Reading yields lane -- 1's raw shift and mask value (BASE1 not added). type INTERP1_ACCUM1_ADD_Register is record INTERP1_ACCUM1_ADD : INTERP1_ACCUM1_ADD_INTERP1_ACCUM1_ADD_Field := 16#0#; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTERP1_ACCUM1_ADD_Register use record INTERP1_ACCUM1_ADD at 0 range 0 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Single-cycle IO block\n Provides core-local and inter-core hardware for -- the two processors, with single-cycle access. type SIO_Peripheral is record -- Processor core identifier\n Value is 0 when read from processor core -- 0, and 1 when read from processor core 1. CPUID : aliased HAL.UInt32; -- Input value for GPIO pins GPIO_IN : aliased GPIO_IN_Register; -- Input value for QSPI pins GPIO_HI_IN : aliased GPIO_HI_IN_Register; -- GPIO output value GPIO_OUT : aliased GPIO_OUT_Register; -- GPIO output value set GPIO_OUT_SET : aliased GPIO_OUT_SET_Register; -- GPIO output value clear GPIO_OUT_CLR : aliased GPIO_OUT_CLR_Register; -- GPIO output value XOR GPIO_OUT_XOR : aliased GPIO_OUT_XOR_Register; -- GPIO output enable GPIO_OE : aliased GPIO_OE_Register; -- GPIO output enable set GPIO_OE_SET : aliased GPIO_OE_SET_Register; -- GPIO output enable clear GPIO_OE_CLR : aliased GPIO_OE_CLR_Register; -- GPIO output enable XOR GPIO_OE_XOR : aliased GPIO_OE_XOR_Register; -- QSPI output value GPIO_HI_OUT : aliased GPIO_HI_OUT_Register; -- QSPI output value set GPIO_HI_OUT_SET : aliased GPIO_HI_OUT_SET_Register; -- QSPI output value clear GPIO_HI_OUT_CLR : aliased GPIO_HI_OUT_CLR_Register; -- QSPI output value XOR GPIO_HI_OUT_XOR : aliased GPIO_HI_OUT_XOR_Register; -- QSPI output enable GPIO_HI_OE : aliased GPIO_HI_OE_Register; -- QSPI output enable set GPIO_HI_OE_SET : aliased GPIO_HI_OE_SET_Register; -- QSPI output enable clear GPIO_HI_OE_CLR : aliased GPIO_HI_OE_CLR_Register; -- QSPI output enable XOR GPIO_HI_OE_XOR : aliased GPIO_HI_OE_XOR_Register; -- Status register for inter-core FIFOs (mailboxes).\n There is one FIFO -- in the core 0 -> core 1 direction, and one core 1 -> core 0. Both are -- 32 bits wide and 8 words deep.\n Core 0 can see the read side of the -- 1->0 FIFO (RX), and the write side of 0->1 FIFO (TX).\n Core 1 can -- see the read side of the 0->1 FIFO (RX), and the write side of 1->0 -- FIFO (TX).\n The SIO IRQ for each core is the logical OR of the VLD, -- WOF and ROE fields of its FIFO_ST register. FIFO_ST : aliased FIFO_ST_Register; -- Write access to this core's TX FIFO FIFO_WR : aliased HAL.UInt32; -- Read access to this core's RX FIFO FIFO_RD : aliased HAL.UInt32; -- Spinlock state\n A bitmap containing the state of all 32 spinlocks -- (1=locked).\n Mainly intended for debugging. SPINLOCK_ST : aliased HAL.UInt32; -- Divider unsigned dividend\n Write to the DIVIDEND operand of the -- divider, i.e. the p in `p / q`.\n Any operand write starts a new -- calculation. The results appear in QUOTIENT, REMAINDER.\n -- UDIVIDEND/SDIVIDEND are aliases of the same internal register. The U -- alias starts an\n unsigned calculation, and the S alias starts a -- signed calculation. DIV_UDIVIDEND : aliased HAL.UInt32; -- Divider unsigned divisor\n Write to the DIVISOR operand of the -- divider, i.e. the q in `p / q`.\n Any operand write starts a new -- calculation. The results appear in QUOTIENT, REMAINDER.\n -- UDIVIDEND/SDIVIDEND are aliases of the same internal register. The U -- alias starts an\n unsigned calculation, and the S alias starts a -- signed calculation. DIV_UDIVISOR : aliased HAL.UInt32; -- Divider signed dividend\n The same as UDIVIDEND, but starts a signed -- calculation, rather than unsigned. DIV_SDIVIDEND : aliased HAL.UInt32; -- Divider signed divisor\n The same as UDIVISOR, but starts a signed -- calculation, rather than unsigned. DIV_SDIVISOR : aliased HAL.UInt32; -- Divider result quotient\n The result of `DIVIDEND / DIVISOR` -- (division). Contents undefined while CSR_READY is low.\n For signed -- calculations, QUOTIENT is negative when the signs of DIVIDEND and -- DIVISOR differ.\n This register can be written to directly, for -- context save/restore purposes. This halts any\n in-progress -- calculation and sets the CSR_READY and CSR_DIRTY flags.\n Reading -- from QUOTIENT clears the CSR_DIRTY flag, so should read results in -- the order\n REMAINDER, QUOTIENT if CSR_DIRTY is used. DIV_QUOTIENT : aliased HAL.UInt32; -- Divider result remainder\n The result of `DIVIDEND % DIVISOR` -- (modulo). Contents undefined while CSR_READY is low.\n For signed -- calculations, REMAINDER is negative only when DIVIDEND is negative.\n -- This register can be written to directly, for context save/restore -- purposes. This halts any\n in-progress calculation and sets the -- CSR_READY and CSR_DIRTY flags. DIV_REMAINDER : aliased HAL.UInt32; -- Control and status register for divider. DIV_CSR : aliased DIV_CSR_Register; -- Read/write access to accumulator 0 INTERP0_ACCUM0 : aliased HAL.UInt32; -- Read/write access to accumulator 1 INTERP0_ACCUM1 : aliased HAL.UInt32; -- Read/write access to BASE0 register. INTERP0_BASE0 : aliased HAL.UInt32; -- Read/write access to BASE1 register. INTERP0_BASE1 : aliased HAL.UInt32; -- Read/write access to BASE2 register. INTERP0_BASE2 : aliased HAL.UInt32; -- Read LANE0 result, and simultaneously write lane results to both -- accumulators (POP). INTERP0_POP_LANE0 : aliased HAL.UInt32; -- Read LANE1 result, and simultaneously write lane results to both -- accumulators (POP). INTERP0_POP_LANE1 : aliased HAL.UInt32; -- Read FULL result, and simultaneously write lane results to both -- accumulators (POP). INTERP0_POP_FULL : aliased HAL.UInt32; -- Read LANE0 result, without altering any internal state (PEEK). INTERP0_PEEK_LANE0 : aliased HAL.UInt32; -- Read LANE1 result, without altering any internal state (PEEK). INTERP0_PEEK_LANE1 : aliased HAL.UInt32; -- Read FULL result, without altering any internal state (PEEK). INTERP0_PEEK_FULL : aliased HAL.UInt32; -- Control register for lane 0 INTERP0_CTRL_LANE0 : aliased INTERP0_CTRL_LANE0_Register; -- Control register for lane 1 INTERP0_CTRL_LANE1 : aliased INTERP0_CTRL_LANE1_Register; -- Values written here are atomically added to ACCUM0\n Reading yields -- lane 0's raw shift and mask value (BASE0 not added). INTERP0_ACCUM0_ADD : aliased INTERP0_ACCUM0_ADD_Register; -- Values written here are atomically added to ACCUM1\n Reading yields -- lane 1's raw shift and mask value (BASE1 not added). INTERP0_ACCUM1_ADD : aliased INTERP0_ACCUM1_ADD_Register; -- On write, the lower 16 bits go to BASE0, upper bits to BASE1 -- simultaneously.\n Each half is sign-extended to 32 bits if that -- lane's SIGNED flag is set. INTERP0_BASE_1AND0 : aliased HAL.UInt32; -- Read/write access to accumulator 0 INTERP1_ACCUM0 : aliased HAL.UInt32; -- Read/write access to accumulator 1 INTERP1_ACCUM1 : aliased HAL.UInt32; -- Read/write access to BASE0 register. INTERP1_BASE0 : aliased HAL.UInt32; -- Read/write access to BASE1 register. INTERP1_BASE1 : aliased HAL.UInt32; -- Read/write access to BASE2 register. INTERP1_BASE2 : aliased HAL.UInt32; -- Read LANE0 result, and simultaneously write lane results to both -- accumulators (POP). INTERP1_POP_LANE0 : aliased HAL.UInt32; -- Read LANE1 result, and simultaneously write lane results to both -- accumulators (POP). INTERP1_POP_LANE1 : aliased HAL.UInt32; -- Read FULL result, and simultaneously write lane results to both -- accumulators (POP). INTERP1_POP_FULL : aliased HAL.UInt32; -- Read LANE0 result, without altering any internal state (PEEK). INTERP1_PEEK_LANE0 : aliased HAL.UInt32; -- Read LANE1 result, without altering any internal state (PEEK). INTERP1_PEEK_LANE1 : aliased HAL.UInt32; -- Read FULL result, without altering any internal state (PEEK). INTERP1_PEEK_FULL : aliased HAL.UInt32; -- Control register for lane 0 INTERP1_CTRL_LANE0 : aliased INTERP1_CTRL_LANE0_Register; -- Control register for lane 1 INTERP1_CTRL_LANE1 : aliased INTERP1_CTRL_LANE1_Register; -- Values written here are atomically added to ACCUM0\n Reading yields -- lane 0's raw shift and mask value (BASE0 not added). INTERP1_ACCUM0_ADD : aliased INTERP1_ACCUM0_ADD_Register; -- Values written here are atomically added to ACCUM1\n Reading yields -- lane 1's raw shift and mask value (BASE1 not added). INTERP1_ACCUM1_ADD : aliased INTERP1_ACCUM1_ADD_Register; -- On write, the lower 16 bits go to BASE0, upper bits to BASE1 -- simultaneously.\n Each half is sign-extended to 32 bits if that -- lane's SIGNED flag is set. INTERP1_BASE_1AND0 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK0 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK1 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK2 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK3 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK4 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK5 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK6 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK7 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK8 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK9 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK10 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK11 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK12 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK13 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK14 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK15 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK16 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK17 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK18 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK19 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK20 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK21 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK22 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK23 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK24 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK25 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK26 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK27 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK28 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK29 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK30 : aliased HAL.UInt32; -- Reading from a spinlock address will:\n - Return 0 if lock is already -- locked\n - Otherwise return nonzero, and simultaneously claim the -- lock\n\n Writing (any value) releases the lock.\n If core 0 and core -- 1 attempt to claim the same lock simultaneously, core 0 wins.\n The -- value returned on success is 0x1 << lock number. SPINLOCK31 : aliased HAL.UInt32; end record with Volatile; for SIO_Peripheral use record CPUID at 16#0# range 0 .. 31; GPIO_IN at 16#4# range 0 .. 31; GPIO_HI_IN at 16#8# range 0 .. 31; GPIO_OUT at 16#10# range 0 .. 31; GPIO_OUT_SET at 16#14# range 0 .. 31; GPIO_OUT_CLR at 16#18# range 0 .. 31; GPIO_OUT_XOR at 16#1C# range 0 .. 31; GPIO_OE at 16#20# range 0 .. 31; GPIO_OE_SET at 16#24# range 0 .. 31; GPIO_OE_CLR at 16#28# range 0 .. 31; GPIO_OE_XOR at 16#2C# range 0 .. 31; GPIO_HI_OUT at 16#30# range 0 .. 31; GPIO_HI_OUT_SET at 16#34# range 0 .. 31; GPIO_HI_OUT_CLR at 16#38# range 0 .. 31; GPIO_HI_OUT_XOR at 16#3C# range 0 .. 31; GPIO_HI_OE at 16#40# range 0 .. 31; GPIO_HI_OE_SET at 16#44# range 0 .. 31; GPIO_HI_OE_CLR at 16#48# range 0 .. 31; GPIO_HI_OE_XOR at 16#4C# range 0 .. 31; FIFO_ST at 16#50# range 0 .. 31; FIFO_WR at 16#54# range 0 .. 31; FIFO_RD at 16#58# range 0 .. 31; SPINLOCK_ST at 16#5C# range 0 .. 31; DIV_UDIVIDEND at 16#60# range 0 .. 31; DIV_UDIVISOR at 16#64# range 0 .. 31; DIV_SDIVIDEND at 16#68# range 0 .. 31; DIV_SDIVISOR at 16#6C# range 0 .. 31; DIV_QUOTIENT at 16#70# range 0 .. 31; DIV_REMAINDER at 16#74# range 0 .. 31; DIV_CSR at 16#78# range 0 .. 31; INTERP0_ACCUM0 at 16#80# range 0 .. 31; INTERP0_ACCUM1 at 16#84# range 0 .. 31; INTERP0_BASE0 at 16#88# range 0 .. 31; INTERP0_BASE1 at 16#8C# range 0 .. 31; INTERP0_BASE2 at 16#90# range 0 .. 31; INTERP0_POP_LANE0 at 16#94# range 0 .. 31; INTERP0_POP_LANE1 at 16#98# range 0 .. 31; INTERP0_POP_FULL at 16#9C# range 0 .. 31; INTERP0_PEEK_LANE0 at 16#A0# range 0 .. 31; INTERP0_PEEK_LANE1 at 16#A4# range 0 .. 31; INTERP0_PEEK_FULL at 16#A8# range 0 .. 31; INTERP0_CTRL_LANE0 at 16#AC# range 0 .. 31; INTERP0_CTRL_LANE1 at 16#B0# range 0 .. 31; INTERP0_ACCUM0_ADD at 16#B4# range 0 .. 31; INTERP0_ACCUM1_ADD at 16#B8# range 0 .. 31; INTERP0_BASE_1AND0 at 16#BC# range 0 .. 31; INTERP1_ACCUM0 at 16#C0# range 0 .. 31; INTERP1_ACCUM1 at 16#C4# range 0 .. 31; INTERP1_BASE0 at 16#C8# range 0 .. 31; INTERP1_BASE1 at 16#CC# range 0 .. 31; INTERP1_BASE2 at 16#D0# range 0 .. 31; INTERP1_POP_LANE0 at 16#D4# range 0 .. 31; INTERP1_POP_LANE1 at 16#D8# range 0 .. 31; INTERP1_POP_FULL at 16#DC# range 0 .. 31; INTERP1_PEEK_LANE0 at 16#E0# range 0 .. 31; INTERP1_PEEK_LANE1 at 16#E4# range 0 .. 31; INTERP1_PEEK_FULL at 16#E8# range 0 .. 31; INTERP1_CTRL_LANE0 at 16#EC# range 0 .. 31; INTERP1_CTRL_LANE1 at 16#F0# range 0 .. 31; INTERP1_ACCUM0_ADD at 16#F4# range 0 .. 31; INTERP1_ACCUM1_ADD at 16#F8# range 0 .. 31; INTERP1_BASE_1AND0 at 16#FC# range 0 .. 31; SPINLOCK0 at 16#100# range 0 .. 31; SPINLOCK1 at 16#104# range 0 .. 31; SPINLOCK2 at 16#108# range 0 .. 31; SPINLOCK3 at 16#10C# range 0 .. 31; SPINLOCK4 at 16#110# range 0 .. 31; SPINLOCK5 at 16#114# range 0 .. 31; SPINLOCK6 at 16#118# range 0 .. 31; SPINLOCK7 at 16#11C# range 0 .. 31; SPINLOCK8 at 16#120# range 0 .. 31; SPINLOCK9 at 16#124# range 0 .. 31; SPINLOCK10 at 16#128# range 0 .. 31; SPINLOCK11 at 16#12C# range 0 .. 31; SPINLOCK12 at 16#130# range 0 .. 31; SPINLOCK13 at 16#134# range 0 .. 31; SPINLOCK14 at 16#138# range 0 .. 31; SPINLOCK15 at 16#13C# range 0 .. 31; SPINLOCK16 at 16#140# range 0 .. 31; SPINLOCK17 at 16#144# range 0 .. 31; SPINLOCK18 at 16#148# range 0 .. 31; SPINLOCK19 at 16#14C# range 0 .. 31; SPINLOCK20 at 16#150# range 0 .. 31; SPINLOCK21 at 16#154# range 0 .. 31; SPINLOCK22 at 16#158# range 0 .. 31; SPINLOCK23 at 16#15C# range 0 .. 31; SPINLOCK24 at 16#160# range 0 .. 31; SPINLOCK25 at 16#164# range 0 .. 31; SPINLOCK26 at 16#168# range 0 .. 31; SPINLOCK27 at 16#16C# range 0 .. 31; SPINLOCK28 at 16#170# range 0 .. 31; SPINLOCK29 at 16#174# range 0 .. 31; SPINLOCK30 at 16#178# range 0 .. 31; SPINLOCK31 at 16#17C# range 0 .. 31; end record; -- Single-cycle IO block\n Provides core-local and inter-core hardware for -- the two processors, with single-cycle access. SIO_Periph : aliased SIO_Peripheral with Import, Address => SIO_Base; end RP_SVD.SIO;

47.837097

79

0.645554

31947cb760283d01b1926b15c14e1e1bd9a9c6ee

8,643

ads

Ada

bb-runtimes/src/system/system-pikeos42-arm-ravenscar-full.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/system/system-pikeos42-arm-ravenscar-full.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/system/system-pikeos42-arm-ravenscar-full.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M -- -- -- -- S p e c -- -- (PikeOS 4.2 ARM Version) -- -- -- -- Copyright (C) 1992-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 Ravenscar version of this package for ARM PikeOS 4.2 targets 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 Profile (Jorvik); -- This is a Ravenscar 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.000_000_001; -- 1 ns -- 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 := False; 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 := True; Signed_Zeros : constant Boolean := True; Stack_Check_Default : constant Boolean := False; Stack_Check_Probes : constant Boolean := True; 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 := False; 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 & "-nostdlib" & ASCII.NUL & "-T../ld/arm-app.ld" & ASCII.NUL & "-lp4ext" & ASCII.NUL & "-lgnat" & ASCII.NUL & "-lvm" & ASCII.NUL & "-lstand" & ASCII.NUL & "-lp4" & ASCII.NUL & "-lgcc"); end System;

45.973404

79

0.570751

1c37cdf5b9b79f2245d9397fec87374114784abb

2,399

ads

Ada

sources/driver/custom_writers.ads

reznikmm/markdown

af47bd45427f1c016c0a2a11e86fa2d1b1c82315

[ "MIT" ]

null

sources/driver/custom_writers.ads

reznikmm/markdown

af47bd45427f1c016c0a2a11e86fa2d1b1c82315

[ "MIT" ]

null

sources/driver/custom_writers.ads

reznikmm/markdown

af47bd45427f1c016c0a2a11e86fa2d1b1c82315

[ "MIT" ]

null

-- SPDX-FileCopyrightText: 2020 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ---------------------------------------------------------------- with League.Strings; with XML.SAX.Attributes; with XML.SAX.Output_Destinations; with XML.SAX.Writers; package Custom_Writers is type SAX_Output_Destination_Access is access all XML.SAX.Output_Destinations.SAX_Output_Destination'Class; type Writer is limited new XML.SAX.Writers.SAX_Writer with private; procedure Set_Output_Destination (Self : in out Writer'Class; Output : not null SAX_Output_Destination_Access); not overriding procedure Unescaped_Characters (Self : in out Writer; Text : League.Strings.Universal_String); private type Writer is limited new XML.SAX.Writers.SAX_Writer with record Output : SAX_Output_Destination_Access; Tag : League.Strings.Universal_String; CDATA : Boolean := False; end record; overriding function Error_String (Self : Writer) return League.Strings.Universal_String; overriding procedure Characters (Self : in out Writer; Text : League.Strings.Universal_String; Success : in out Boolean); overriding procedure End_Element (Self : in out Writer; Namespace_URI : League.Strings.Universal_String; Local_Name : League.Strings.Universal_String; Qualified_Name : League.Strings.Universal_String; Success : in out Boolean); overriding procedure Start_Element (Self : in out Writer; Namespace_URI : League.Strings.Universal_String; Local_Name : League.Strings.Universal_String; Qualified_Name : League.Strings.Universal_String; Attributes : XML.SAX.Attributes.SAX_Attributes; Success : in out Boolean); overriding procedure Comment (Self : in out Writer; Text : League.Strings.Universal_String; Success : in out Boolean); overriding procedure Processing_Instruction (Self : in out Writer; Target : League.Strings.Universal_String; Data : League.Strings.Universal_String; Success : in out Boolean); overriding procedure Start_CDATA (Self : in out Writer; Success : in out Boolean); overriding procedure End_CDATA (Self : in out Writer; Success : in out Boolean); end Custom_Writers;

30.75641

73

0.682784

12e4c7d8b1e54e781d39e953b445a825212fe19b

818

adb

Ada

gdb/testsuite/gdb.ada/bp_reset/io.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

1

2020-10-14T03:24:35.000Z

gdb/testsuite/gdb.ada/bp_reset/io.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

gdb/testsuite/gdb.ada/bp_reset/io.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

-- Copyright 2012-2021 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 body IO is procedure Put_Line (S : String) is begin null; end Put_Line; end IO;

37.181818

73

0.726161

10724ed69aea97fb75f1c3038279c4c3dbaebe09

3,012

adb

Ada

ImgAnnealing/src/main.adb

kochab/simulatedannealing-ada

ed1f2d15b0aadd31d8ca474b67ac02ae380aaf71

[ "MIT" ]

null

ImgAnnealing/src/main.adb

kochab/simulatedannealing-ada

ed1f2d15b0aadd31d8ca474b67ac02ae380aaf71

[ "MIT" ]

null

ImgAnnealing/src/main.adb

kochab/simulatedannealing-ada

ed1f2d15b0aadd31d8ca474b67ac02ae380aaf71

[ "MIT" ]

null

with Ada.Text_IO; with Ada.Float_Text_IO; with Ada.Long_Integer_Text_IO; with Ada.Command_Line; with Ada.Environment_Variables; with Bitmaps.IO; with Bitmaps.RGB; with Ada.Text_IO.Text_Streams; with Problem; with ImageOps; with Simulated_Annealing; with RAII; procedure Main is package Positive_IO is new Ada.Text_IO.Integer_IO (Positive); type Image_Access is access all Bitmaps.RGB.Image; package Image_Problem is new Problem (Image_Access); function Opt_Iterations return Positive is Result : Positive := 1000000; Last : Positive; begin if Ada.Environment_Variables.Exists ("ANNEALING_ITERATIONS") then Positive_IO.Get (From => Ada.Environment_Variables.Value ("ANNEALING_ITERATIONS"), Item => Result, Last => Last); end if; return Result; end Opt_Iterations; function Opt_Temperature return Float is Result : Float := 100.0; Last : Positive; begin if Ada.Environment_Variables.Exists ("ANNEALING_TEMPERATURE") then Ada.Float_Text_IO.Get (From => Ada.Environment_Variables.Value ("ANNEALING_TEMPERATURE"), Item => Result, Last => Last); end if; return Result; end Opt_Temperature; function Opt_Size return Positive is Result : Positive := 64; Last : Positive; begin if Ada.Environment_Variables.Exists("ANNEALING_SIZE") then Positive_IO.Get (From => Ada.Environment_Variables.Value("ANNEALING_SIZE"), Item => Result, Last => Last); end if; return Result; end Opt_Size; Bitmap_Size : constant Positive := Opt_Size; B : aliased Bitmaps.RGB.Image (Bitmap_Size, Bitmap_Size); S : Image_Problem.State; begin ImageOps.Noise (B); S.Img := B'Access; S.E := ImageOps.Adj_Distance_Sum (B); Image_Problem.Roll (S); S.Visited := False; declare M : Image_Problem.Opt.Minimization := Image_Problem.Opt.Minimize (S); Sched : Simulated_Annealing.Scheduler := Simulated_Annealing.Exponential (Opt_Iterations, Opt_Temperature); Improved : Boolean := False; begin while Image_Problem.Opt.Step (M, Sched, Improved) loop if Improved then Ada.Text_IO.Put ("T = "); Ada.Float_Text_IO.Put (Simulated_Annealing.Temperature (Sched)); Ada.Text_IO.Put (", E = "); Ada.Long_Integer_Text_IO.Put (Image_Problem.Opt.Minimum (M).E, Width => 0); Ada.Text_IO.New_Line; if Ada.Command_Line.Argument_Count > 0 then declare CF : RAII.Controlled_File; begin Ada.Text_IO.Open (CF.File, Ada.Text_IO.Out_File, Ada.Command_Line.Argument (1)); Bitmaps.IO.Write_PPM_P6 (Ada.Text_IO.Text_Streams.Stream (CF.File), B); end; end if; end if; end loop; end; end Main;

30.424242

79

0.626494

0ed3f6708ad34c97e04fa7f1c26e6fa9b5cc1ea7

3,326

ads

Ada

bb-runtimes/riscv/sifive/fe310/svd/i-fe310.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/riscv/sifive/fe310/svd/i-fe310.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/riscv/sifive/fe310/svd/i-fe310.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

-- -- Copyright (C) 2018, AdaCore -- -- This spec has been automatically generated from FE310.svd pragma Ada_2012; pragma Style_Checks (Off); with System; -- E31 CPU Coreplex, high-performance, 32-bit RV32IMAC core -- package Interfaces.FE310 is pragma Preelaborate; pragma No_Elaboration_Code_All; --------------- -- Base type -- --------------- type UInt32 is new Interfaces.Unsigned_32; type UInt16 is new Interfaces.Unsigned_16; type Byte is new Interfaces.Unsigned_8; type Bit is mod 2**1 with Size => 1; type UInt2 is mod 2**2 with Size => 2; type UInt3 is mod 2**3 with Size => 3; type UInt4 is mod 2**4 with Size => 4; type UInt5 is mod 2**5 with Size => 5; type UInt6 is mod 2**6 with Size => 6; type UInt7 is mod 2**7 with Size => 7; type UInt9 is mod 2**9 with Size => 9; type UInt10 is mod 2**10 with Size => 10; type UInt11 is mod 2**11 with Size => 11; type UInt12 is mod 2**12 with Size => 12; type UInt13 is mod 2**13 with Size => 13; type UInt14 is mod 2**14 with Size => 14; type UInt15 is mod 2**15 with Size => 15; type UInt17 is mod 2**17 with Size => 17; type UInt18 is mod 2**18 with Size => 18; type UInt19 is mod 2**19 with Size => 19; type UInt20 is mod 2**20 with Size => 20; type UInt21 is mod 2**21 with Size => 21; type UInt22 is mod 2**22 with Size => 22; type UInt23 is mod 2**23 with Size => 23; type UInt24 is mod 2**24 with Size => 24; type UInt25 is mod 2**25 with Size => 25; type UInt26 is mod 2**26 with Size => 26; type UInt27 is mod 2**27 with Size => 27; type UInt28 is mod 2**28 with Size => 28; type UInt29 is mod 2**29 with Size => 29; type UInt30 is mod 2**30 with Size => 30; type UInt31 is mod 2**31 with Size => 31; -------------------- -- Base addresses -- -------------------- PLIC_Base : constant System.Address := System'To_Address (16#C000000#); CLINT_Base : constant System.Address := System'To_Address (16#2000000#); GPIO0_Base : constant System.Address := System'To_Address (16#10012000#); QSPI0_Base : constant System.Address := System'To_Address (16#10014000#); QSPI1_Base : constant System.Address := System'To_Address (16#10024000#); QSPI2_Base : constant System.Address := System'To_Address (16#10034000#); UART0_Base : constant System.Address := System'To_Address (16#10013000#); UART1_Base : constant System.Address := System'To_Address (16#10023000#); PWM0_Base : constant System.Address := System'To_Address (16#10015000#); PWM1_Base : constant System.Address := System'To_Address (16#10025000#); PWM2_Base : constant System.Address := System'To_Address (16#10035000#); WDT_Base : constant System.Address := System'To_Address (16#10000000#); RTC_Base : constant System.Address := System'To_Address (16#10000040#); AON_Base : constant System.Address := System'To_Address (16#10000070#); BACKUP_Base : constant System.Address := System'To_Address (16#10000080#); PMU_Base : constant System.Address := System'To_Address (16#10000100#); end Interfaces.FE310;

27.262295

61

0.619663

39396db6358d289f18cb6856c48595ac0dc19863

234

ads

Ada

source/gc.ads

ytomino/boehmgc-ada

a37650c655cb849068f7eba5cdfc196495935885

[ "Xerox", "Unlicense" ]

3

2019-04-04T10:33:59.000Z

2022-01-25T19:15:51.000Z

source/gc.ads

ytomino/boehmgc-ada

a37650c655cb849068f7eba5cdfc196495935885

[ "Xerox", "Unlicense" ]

null

source/gc.ads

ytomino/boehmgc-ada

a37650c655cb849068f7eba5cdfc196495935885

[ "Xerox", "Unlicense" ]

null

with System.Storage_Elements; package GC is pragma Preelaborate; pragma Linker_Options ("-lgc"); function Version return String; function Heap_Size return System.Storage_Elements.Storage_Count; procedure Collect; end GC;

18

65

0.786325

310c32bae982c25b4df865a06628d7417a38815b

4,715

ads

Ada

source/amf/uml/amf-uml-read_link_actions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-read_link_actions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-read_link_actions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- 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. ------------------------------------------------------------------------------ -- A read link action is a link action that navigates across associations to -- retrieve objects on one end. ------------------------------------------------------------------------------ with AMF.UML.Link_Actions; limited with AMF.UML.Output_Pins; package AMF.UML.Read_Link_Actions is pragma Preelaborate; type UML_Read_Link_Action is limited interface and AMF.UML.Link_Actions.UML_Link_Action; type UML_Read_Link_Action_Access is access all UML_Read_Link_Action'Class; for UML_Read_Link_Action_Access'Storage_Size use 0; not overriding function Get_Result (Self : not null access constant UML_Read_Link_Action) return AMF.UML.Output_Pins.UML_Output_Pin_Access is abstract; -- Getter of ReadLinkAction::result. -- -- The pin on which are put the objects participating in the association -- at the end not specified by the inputs. not overriding procedure Set_Result (Self : not null access UML_Read_Link_Action; To : AMF.UML.Output_Pins.UML_Output_Pin_Access) is abstract; -- Setter of ReadLinkAction::result. -- -- The pin on which are put the objects participating in the association -- at the end not specified by the inputs. end AMF.UML.Read_Link_Actions;

58.9375

78

0.469141

12120afdac4267734acf6dfb80a5d95047857400

951

ads

Ada

src/ewok-exti-handler.ads

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

src/ewok-exti-handler.ads

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

src/ewok-exti-handler.ads

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

-- -- Copyright 2018 The wookey project team <[email protected]> -- - 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. -- -- package ewok.exti.handler with spark_mode => off is procedure exti_handler (frame_a : in ewok.t_stack_frame_access); procedure init; end ewok.exti.handler;

27.970588

79

0.699264

1217d1459ac14c49541c73644bcc8d4fbf08b9bd

2,826

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c91006a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c91006a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c91006a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C91006A.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 IN A TASK SPECIFICATION ENTRY DECLARATIONS ARE ELABORATED -- WHEN THE SPECIFICATION IS ELABORATED, AND IN TEXTUAL ORDER. -- WEI 3/04/82 -- BHS 7/13/84 -- TBN 12/17/85 RENAMED FROM C910AHA-B.ADA; -- ADDED DECLARATIONS OF FIRST AND LAST. -- PWB 5/15/86 MOVED DECLARATIONS OF FIRST, TASK T1, AND LAST -- INTO A DECLARE/BEGIN/END BLOCK. WITH REPORT; USE REPORT; PROCEDURE C91006A IS SUBTYPE ARG IS NATURAL RANGE 0..9; INDEX : INTEGER RANGE 0..5 := 0; SPYNUMB : STRING(1..5) := (1..5 => ' '); FUNCTION FINIT_POS (DIGT: IN ARG) RETURN NATURAL IS TEMP : STRING(1..2); BEGIN TEMP := ARG'IMAGE(DIGT); INDEX := INDEX + 1; SPYNUMB(INDEX) := TEMP(2); RETURN DIGT; END FINIT_POS; BEGIN TEST ("C91006A", "CHECK THAT IN A TASK SPEC, ELABORATION IS IN " & "TEXTUAL ORDER"); DECLARE FIRST : INTEGER := FINIT_POS (1); TASK T1 IS ENTRY E2 (NATURAL RANGE 1 .. FINIT_POS (2)); ENTRY E3 (NATURAL RANGE 1 .. FINIT_POS (3)); ENTRY E4 (NATURAL RANGE 1 .. FINIT_POS (4)); END T1; LAST : INTEGER := FINIT_POS (5); TASK BODY T1 IS BEGIN NULL; END T1; BEGIN NULL; END; IF SPYNUMB /= "12345" THEN FAILED ("TASK SPEC T1 NOT ELABORATED IN TEXTUAL ORDER"); COMMENT ("ACTUAL ORDER WAS: " & SPYNUMB); END IF; RESULT; END C91006A;

34.048193

79

0.600495

06d1ac87a2e45f74daa4ca843f4d3a31d1b26980

5,244

ads

Ada

src/helios-datas.ads

stcarrez/helios

770055d87eaaa70a29a8a39190ecc8aa4e31b5be

[ "Apache-2.0" ]

1

2020-09-04T18:34:08.000Z

src/helios-datas.ads

stcarrez/helios

770055d87eaaa70a29a8a39190ecc8aa4e31b5be

[ "Apache-2.0" ]

null

src/helios-datas.ads

stcarrez/helios

770055d87eaaa70a29a8a39190ecc8aa4e31b5be

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- helios-datas -- Helios monitoring data and snapshots -- Copyright (C) 2017 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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.Calendar; with Ada.Real_Time; with Util.Refs; with Helios.Schemas; -- == Data Representation == -- The monitored data is collected into snapshots and snapshots are stored in a queue -- before being flushed. package Helios.Datas is subtype Definition_Type_Access is Schemas.Definition_Type_Access; type Snapshot_Type; type Snapshot_Type_Access is access all Snapshot_Type; type Snapshot_Type is tagged limited private; type Snapshot_Queue_Type is limited private; -- Initialize the snapshot queue for the schema. procedure Initialize (Queue : in out Snapshot_Queue_Type; Schema : in Helios.Schemas.Definition_Type_Access; Count : in Positive); -- Get the snapshot start time. function Get_Start_Time (Data : in Snapshot_Type) return Ada.Real_Time.Time; -- Get the snapshot end time. function Get_End_Time (Data : in Snapshot_Type) return Ada.Real_Time.Time; -- Finish updating the current values of the snapshot. procedure Finish (Data : in out Snapshot_Type); -- Set the value in the snapshot. procedure Set_Value (Into : in out Snapshot_Type; Def : in Schemas.Definition_Type_Access; Value : in Uint64); -- Iterate over the values in the snapshot and collected for the definition node. procedure Iterate (Data : in Snapshot_Type; Node : in Definition_Type_Access; Process : not null access procedure (Value : in Uint64)); procedure Iterate (Data : in Snapshot_Type; Node : in Definition_Type_Access; Process_Snapshot : not null access procedure (D : in Snapshot_Type; N : in Definition_Type_Access); Process_Values : not null access procedure (D : in Snapshot_Type; N : in Definition_Type_Access)); -- Prepare the snapshot queue to collect new values. procedure Prepare (Queue : in out Snapshot_Queue_Type; Snapshot : out Snapshot_Type_Access); -- Flush the snapshot to start a fresh one for the queue. procedure Flush (Queue : in out Snapshot_Queue_Type); type Report_Queue_Type is private; function Get_Report return Report_Queue_Type; -- Iterate over the values of the reports. procedure Iterate (Report : in Report_Queue_Type; Process : not null access procedure (Data : in Snapshot_Type; Node : in Definition_Type_Access)); private subtype Value_Index is Schemas.Value_Index; subtype Value_Array_Index is Value_Index range 1 .. Value_Index'Last; type Snapshot_Index is new Natural; type Report_Index is new Natural; type Value_Array is array (Value_Array_Index range <>) of Uint64; type Value_Array_Access is access all Value_Array; type Snapshot_Type is tagged limited record Schema : Helios.Schemas.Definition_Type_Access; Next : Snapshot_Type_Access; Count : Value_Index := 0; Time : Ada.Calendar.Time; Start_Time : Ada.Real_Time.Time; End_Time : Ada.Real_Time.Time; Offset : Value_Index := 0; Values : Value_Array_Access; end record; type Snapshot_List is new Util.Refs.Ref_Entity with record First : Snapshot_Type_Access; end record; type Snapshot_List_Access is access all Snapshot_List; -- Release the snapshots when the reference counter reaches 0. overriding procedure Finalize (Object : in out Snapshot_List); package Snapshot_Refs is new Util.Refs.References (Element_Type => Snapshot_List, Element_Access => Snapshot_List_Access); subtype Snapshot_Accessor is Snapshot_Refs.Element_Accessor; type Snapshot_Queue_Type is limited record Count : Natural := 0; Schema : Helios.Schemas.Definition_Type_Access; Current : Snapshot_Type_Access; end record; type Snapshot_Queue_Access is access all Snapshot_Queue_Type; type Report_Queue_Type is record Snapshot : Snapshot_Refs.Ref; end record; end Helios.Datas;

40.338462

99

0.644737

2f0fa91bf20aacbc7f68f2fc801ffb80f45e6255

6,481

adb

Ada

tools/druss-commands-wifi.adb

stcarrez/bbox-ada-api

53292f82b11806a5415e202da4a023a726b8fe55

[ "Apache-2.0" ]

2

2017-04-03T21:21:12.000Z

2017-05-25T13:05:08.000Z

tools/druss-commands-wifi.adb

stcarrez/bbox-ada-api

53292f82b11806a5415e202da4a023a726b8fe55

[ "Apache-2.0" ]

2

2017-04-07T09:30:14.000Z

2019-05-23T17:45:35.000Z

tools/druss-commands-wifi.adb

stcarrez/bbox-ada-api

53292f82b11806a5415e202da4a023a726b8fe55

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- druss-commands-wifi -- Wifi related commands -- Copyright (C) 2017, 2018, 2019, 2021 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Strings.Unbounded; with Bbox.API; package body Druss.Commands.Wifi is use Ada.Strings.Unbounded; -- ------------------------------ -- Enable or disable with wifi radio. -- ------------------------------ procedure Do_Enable (Command : in Command_Type; Args : in Argument_List'Class; Context : in out Context_Type) is procedure Radio (Gateway : in out Druss.Gateways.Gateway_Type; State : in String); procedure Radio (Gateway : in out Druss.Gateways.Gateway_Type; State : in String) is Box : Bbox.API.Client_Type; begin Box.Set_Server (To_String (Gateway.Ip)); if Ada.Strings.Unbounded.Length (Gateway.Passwd) > 0 then Box.Login (To_String (Gateway.Passwd)); end if; Box.Put ("wireless", (if State = "on" then "radio.enable=1" else "radio.enable=0")); end Radio; begin Druss.Commands.Gateway_Command (Command, Args, 1, Radio'Access, Context); end Do_Enable; -- ------------------------------ -- Execute the wifi 'status' command to print the Wifi current status. -- ------------------------------ procedure Do_Status (Command : in Command_Type; Args : in Argument_List'Class; Context : in out Context_Type) is pragma Unreferenced (Command, Args); procedure Wifi_Status (Gateway : in out Druss.Gateways.Gateway_Type); Console : constant Druss.Commands.Consoles.Console_Access := Context.Console; procedure Wifi_Status (Gateway : in out Druss.Gateways.Gateway_Type) is begin Gateway.Refresh; Console.Start_Row; Console.Print_Field (F_IP_ADDR, Gateway.Ip); Print_On_Off (Console, F_BOOL, Gateway.Wifi.Get ("wireless.radio.24.enable", " ")); Console.Print_Field (F_CHANNEL, Gateway.Wifi.Get ("wireless.radio.24.current_channel", " ")); Console.Print_Field (F_SSID, Gateway.Wifi.Get ("wireless.ssid.24.id", " ")); Console.Print_Field (F_PROTOCOL, Gateway.Wifi.Get ("wireless.ssid.24.security.protocol", " ")); Console.Print_Field (F_ENCRYPTION, Gateway.Wifi.Get ("wireless.ssid.24.security.encryption", " ")); Console.Print_Field (F_DEVICES, Gateway.Hosts.Get ("hosts.list.length", "")); Console.End_Row; if not Gateway.Wifi.Exists ("wireless.radio.5.enable") then return; end if; Console.Start_Row; Console.Print_Field (F_IP_ADDR, To_String (Gateway.Ip)); Print_On_Off (Console, F_BOOL, Gateway.Wifi.Get ("wireless.radio.5.enable", " ")); Console.Print_Field (F_CHANNEL, Gateway.Wifi.Get ("wireless.radio.5.current_channel", " ")); Console.Print_Field (F_SSID, Gateway.Wifi.Get ("wireless.ssid.5.id", " ")); Console.Print_Field (F_PROTOCOL, Gateway.Wifi.Get ("wireless.ssid.5.security.protocol", " ")); Console.Print_Field (F_ENCRYPTION, Gateway.Wifi.Get ("wireless.ssid.5.security.encryption", " ")); Console.End_Row; end Wifi_Status; begin Console.Start_Title; Console.Print_Title (F_IP_ADDR, "Bbox IP", 15); Console.Print_Title (F_BOOL, "Enable", 8); Console.Print_Title (F_CHANNEL, "Channel", 8); Console.Print_Title (F_SSID, "SSID", 20); Console.Print_Title (F_PROTOCOL, "Protocol", 12); Console.Print_Title (F_ENCRYPTION, "Encryption", 12); Console.Print_Title (F_DEVICES, "Devices", 12); Console.End_Title; Druss.Gateways.Iterate (Context.Gateways, Gateways.ITER_ENABLE, Wifi_Status'Access); end Do_Status; -- ------------------------------ -- Execute a command to control or get status about the Wifi. -- ------------------------------ overriding procedure Execute (Command : in out Command_Type; Name : in String; Args : in Argument_List'Class; Context : in out Context_Type) is pragma Unreferenced (Name); begin if Args.Get_Count = 0 then Command.Do_Status (Args, Context); elsif Args.Get_Argument (1) in "on" | "off" then Command.Do_Enable (Args, Context); elsif Args.Get_Argument (1) = "show" then Command.Do_Status (Args, Context); else Context.Console.Notice (N_USAGE, "Invalid sub-command: " & Args.Get_Argument (1)); Druss.Commands.Driver.Usage (Args, Context); end if; end Execute; -- ------------------------------ -- Write the help associated with the command. -- ------------------------------ overriding procedure Help (Command : in out Command_Type; Name : in String; Context : in out Context_Type) is pragma Unreferenced (Command); Console : constant Druss.Commands.Consoles.Console_Access := Context.Console; begin Console.Notice (N_HELP, "wifi: Control and get status about the Bbox Wifi"); Console.Notice (N_HELP, "Usage: wifi {<action>} [<parameters>]"); Console.Notice (N_HELP, ""); Console.Notice (N_HELP, " wifi on [IP]... Turn ON the wifi on the Bbox."); Console.Notice (N_HELP, " wifi off [IP]... Turn OFF the wifi on the Bbox."); Console.Notice (N_HELP, " wifi show Show information about the wifi on the Bbox."); Console.Notice (N_HELP, " wifi devices Show the wifi devices which are connected."); end Help; end Druss.Commands.Wifi;

45.964539

108

0.597284

1dc3132c2a6797a350bd7a2a1a5e83662c48521f

2,650

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-flocon__none.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-flocon__none.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-flocon__none.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . F L O A T _ C O N T R O L -- -- -- -- B o d y -- -- -- -- Copyright (C) 2011-2020, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 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 implementation does nothing and can be used when the floating point -- unit is fully under control. package body System.Float_Control is ----------- -- Reset -- ----------- procedure Reset is begin null; end Reset; end System.Float_Control;

56.382979

78

0.387925

4d1d8ca2409b2d685fb36eff48fd5fa07be73268

1,303

adb

Ada

tests/glfw2/glfw_test-display.adb

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

null

tests/glfw2/glfw_test-display.adb

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

null

tests/glfw2/glfw_test-display.adb

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

null

-- part of OpenGLAda, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "COPYING" with Glfw.Display; with Glfw.Display.Modes; with Glfw.Events; with Glfw.Events.Keys; with Ada.Text_IO; procedure Glfw_Test.Display is procedure Write_Mode (Subject : Glfw.Display.Modes.Mode) is begin Ada.Text_IO.Put (Subject.Width'Img & " x" & Subject.Height'Img); Ada.Text_IO.Put ("; RGB:" & Subject.Red_Bits'Img & " +" & Subject.Green_Bits'Img & " +" & Subject.Blue_Bits'Img); Ada.Text_IO.New_Line; end Write_Mode; begin Glfw.Init; Glfw.Display.Open (Mode => Glfw.Display.Window); Glfw.Events.Keys.Set_Key_Callback (Glfw_Test.Key_To_Title'Access); declare Mode_List : Glfw.Display.Modes.Mode_List := Glfw.Display.Modes.Available_Modes; Desktop_Mode : Glfw.Display.Modes.Mode := Glfw.Display.Modes.Desktop_Mode; begin Ada.Text_IO.Put_Line ("---- Video Modes ----"); for Index in Mode_List'Range loop Write_Mode (Mode_List (Index)); end loop; Ada.Text_IO.Put ("Current: "); Write_Mode (Desktop_Mode); end; while Glfw.Display.Opened loop Glfw.Events.Wait_For_Events; end loop; Glfw.Terminate_Glfw; end Glfw_Test.Display;

27.145833

85

0.663085

1d77c4cbc945ca1ab0bca482bdfff58194471b38

57,887

adb

Ada

Acceleration/memcached/hls/dramModel_prj/solution1/.autopilot/db/cmdAggregator.bind.adb

pratik0509/HLSx_Xilinx_edit

14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca

[ "BSD-3-Clause" ]

null

Acceleration/memcached/hls/dramModel_prj/solution1/.autopilot/db/cmdAggregator.bind.adb

pratik0509/HLSx_Xilinx_edit

14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca

[ "BSD-3-Clause" ]

null

Acceleration/memcached/hls/dramModel_prj/solution1/.autopilot/db/cmdAggregator.bind.adb

pratik0509/HLSx_Xilinx_edit

14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca

[ "BSD-3-Clause" ]

1

2018-11-13T17:59:49.000Z

<?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>cmdAggregator</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>rdCmdIn_V</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>rdCmdIn.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>40</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>wrCmdIn_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>wrCmdIn.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>40</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>aggregateMemCmd_V</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>FIFO_SRL</coreName> </Obj> <bitwidth>21</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>18</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_4"> <Value> <Obj> <type>0</type> <id>8</id> <name>tmp</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>33</item> <item>34</item> <item>36</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>9</id> <name></name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>80</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</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>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>80</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>37</item> <item>38</item> <item>39</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>11</id> <name>tmp_3</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>62</item> <item>63</item> <item>64</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>12</id> <name></name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>85</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>85</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>65</item> <item>66</item> <item>67</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>14</id> <name>tmp_2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.2</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>40</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>68</item> <item>69</item> <item>159</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>15</id> <name>tempExtCtrlWord_addr_1</name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>87</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>87</second> </item> </second> </item> </inlineStackInfo> <originalName>tempExtCtrlWord.address.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>70</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>16</id> <name>tempExtCtrlWord_coun_1</name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>87</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>87</second> </item> </second> </item> </inlineStackInfo> <originalName>tempExtCtrlWord.count.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>71</item> <item>72</item> <item>73</item> <item>74</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>17</id> <name>tmp_3_1</name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>88</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.3</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>21</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>75</item> <item>77</item> <item>78</item> <item>79</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>18</id> <name></name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>88</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>88</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>80</item> <item>81</item> <item>82</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>19</id> <name></name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>89</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>89</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>83</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>21</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>1</count> <item_version>0</item_version> <item>84</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>23</id> <name>tmp19</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp19</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>40</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>41</item> <item>42</item> <item>158</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>24</id> <name>tempExtCtrlWord_addr</name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>82</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>82</second> </item> </second> </item> </inlineStackInfo> <originalName>tempExtCtrlWord.address.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>43</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>25</id> <name>tempExtCtrlWord_coun</name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>82</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>82</second> </item> </second> </item> </inlineStackInfo> <originalName>tempExtCtrlWord.count.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>45</item> <item>46</item> <item>48</item> <item>50</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>26</id> <name>tmp_1</name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>83</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>83</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>21</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>52</item> <item>54</item> <item>55</item> <item>56</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>27</id> <name></name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>83</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>83</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>58</item> <item>59</item> <item>60</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>28</id> <name></name> <fileName>sources/otherModules/dramModel/dramModel.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>84</lineNumber> <contextFuncName>cmdAggregator</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/otherModules/dramModel/dramModel.cpp</first> <second>cmdAggregator</second> </first> <second>84</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>61</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>30</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>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_delay>0.00</m_delay> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_22"> <Value> <Obj> <type>2</type> <id>35</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>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_23"> <Value> <Obj> <type>2</type> <id>47</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>32</bitwidth> </Value> <const_type>0</const_type> <content>32</content> </item> <item class_id_reference="16" object_id="_24"> <Value> <Obj> <type>2</type> <id>49</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>32</bitwidth> </Value> <const_type>0</const_type> <content>39</content> </item> <item class_id_reference="16" object_id="_25"> <Value> <Obj> <type>2</type> <id>53</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>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_26"> <Value> <Obj> <type>2</type> <id>76</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>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_27"> <Obj> <type>3</type> <id>10</id> <name>entry</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>8</item> <item>9</item> </node_objs> </item> <item class_id_reference="18" object_id="_28"> <Obj> <type>3</type> <id>13</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>11</item> <item>12</item> </node_objs> </item> <item class_id_reference="18" object_id="_29"> <Obj> <type>3</type> <id>20</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>6</count> <item_version>0</item_version> <item>14</item> <item>15</item> <item>16</item> <item>17</item> <item>18</item> <item>19</item> </node_objs> </item> <item class_id_reference="18" object_id="_30"> <Obj> <type>3</type> <id>22</id> <name>._crit_edge.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></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>21</item> </node_objs> </item> <item class_id_reference="18" object_id="_31"> <Obj> <type>3</type> <id>29</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>6</count> <item_version>0</item_version> <item>23</item> <item>24</item> <item>25</item> <item>26</item> <item>27</item> <item>28</item> </node_objs> </item> <item class_id_reference="18" object_id="_32"> <Obj> <type>3</type> <id>31</id> <name>cmdAggregator.exit</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>30</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>42</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_33"> <id>34</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_34"> <id>36</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_35"> <id>37</id> <edge_type>1</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="_36"> <id>38</id> <edge_type>2</edge_type> <source_obj>13</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_37"> <id>39</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_38"> <id>42</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_39"> <id>43</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_40"> <id>46</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_41"> <id>48</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_42"> <id>50</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_43"> <id>54</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_44"> <id>55</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_45"> <id>56</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="_46"> <id>59</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_47"> <id>60</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_48"> <id>61</id> <edge_type>2</edge_type> <source_obj>31</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_49"> <id>63</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>11</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_50"> <id>64</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>11</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_51"> <id>65</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_52"> <id>66</id> <edge_type>2</edge_type> <source_obj>22</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_53"> <id>67</id> <edge_type>2</edge_type> <source_obj>20</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_54"> <id>69</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_55"> <id>70</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>15</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_56"> <id>72</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_57"> <id>73</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_58"> <id>74</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_59"> <id>77</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_60"> <id>78</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_61"> <id>79</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_62"> <id>81</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_63"> <id>82</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_64"> <id>83</id> <edge_type>2</edge_type> <source_obj>22</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_65"> <id>84</id> <edge_type>2</edge_type> <source_obj>31</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_66"> <id>151</id> <edge_type>2</edge_type> <source_obj>10</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_67"> <id>152</id> <edge_type>2</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="_68"> <id>153</id> <edge_type>2</edge_type> <source_obj>13</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_69"> <id>154</id> <edge_type>2</edge_type> <source_obj>13</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_70"> <id>155</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="_71"> <id>156</id> <edge_type>2</edge_type> <source_obj>22</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_72"> <id>157</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_73"> <id>158</id> <edge_type>4</edge_type> <source_obj>8</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_74"> <id>159</id> <edge_type>4</edge_type> <source_obj>11</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </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="_75"> <mId>1</mId> <mTag>cmdAggregator</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>6</count> <item_version>0</item_version> <item>10</item> <item>13</item> <item>20</item> <item>22</item> <item>29</item> <item>31</item> </basic_blocks> <mII>1</mII> <mDepth>2</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>1</mMinLatency> <mMaxLatency>1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_76"> <states class_id="25" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_77"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_78"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_79"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_80"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_81"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_82"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_83"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_84"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_85"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_86"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_87"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_88"> <id>2</id> <operations> <count>12</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_89"> <id>4</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_90"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_91"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_92"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_93"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_94"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_95"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_96"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_97"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_98"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_99"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_100"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_101"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>20</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> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="35" tracking_level="0" version="0"> <count>18</count> <item_version>0</item_version> <item class_id="36" tracking_level="0" version="0"> <first>8</first> <second class_id="37" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>9</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>11</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>12</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <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>1</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>1</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>1</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>24</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>1</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="38" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="39" tracking_level="0" version="0"> <first>10</first> <second class_id="40" tracking_level="0" version="0"> <first>0</first> <second>1</second> </second> </item> <item> <first>13</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>22</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>29</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>31</first> <second> <first>1</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="41" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="42" tracking_level="1" version="0" object_id="_102"> <region_name>cmdAggregator</region_name> <basic_blocks> <count>6</count> <item_version>0</item_version> <item>10</item> <item>13</item> <item>20</item> <item>22</item> <item>29</item> <item>31</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="43" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>44</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>52</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>60</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>66</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>72</first> <second> <count>2</count> <item_version>0</item_version> <item>18</item> <item>27</item> </second> </item> <item> <first>79</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>83</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>93</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>97</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>107</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>116</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="46" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="47" tracking_level="0" version="0"> <first>tempExtCtrlWord_addr_1_fu_79</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>tempExtCtrlWord_addr_fu_93</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>tempExtCtrlWord_coun_1_fu_83</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tempExtCtrlWord_coun_fu_97</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp_1_fu_116</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>tmp_3_1_fu_107</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>5</count> <item_version>0</item_version> <item> <first>grp_write_fu_72</first> <second> <count>2</count> <item_version>0</item_version> <item>18</item> <item>27</item> </second> </item> <item> <first>tmp19_read_fu_66</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>tmp_2_read_fu_60</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>tmp_3_nbreadreq_fu_52</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_nbreadreq_fu_44</first> <second> <count>1</count> <item_version>0</item_version> <item>8</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="48" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>6</count> <item_version>0</item_version> <item> <first>125</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>129</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>133</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>138</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>143</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>148</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>6</count> <item_version>0</item_version> <item> <first>tempExtCtrlWord_addr_1_reg_133</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>tempExtCtrlWord_addr_reg_143</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>tempExtCtrlWord_coun_1_reg_138</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tempExtCtrlWord_coun_reg_148</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp_3_reg_129</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_reg_125</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> </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="49" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="50" tracking_level="0" version="0"> <first>aggregateMemCmd_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>2</count> <item_version>0</item_version> <item>27</item> <item>18</item> </second> </item> </second> </item> <item> <first>rdCmdIn_V</first> <second> <count>2</count> <item_version>0</item_version> <item> <first>nbreadreq</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> </second> </item> <item> <first>wrCmdIn_V</first> <second> <count>2</count> <item_version>0</item_version> <item> <first>nbreadreq</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="51" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="52" 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>

26.264519

102

0.60587

a101b67d10e224ebb874cd5f34362a5d3790abf1

918

adb

Ada

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/tagged/foo.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/tagged/foo.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/tagged/foo.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2008-2017 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/>. with Pck; use Pck; procedure Foo is Segm : Segment := (Position => 74, Width => 8); Obj : Object'Class := Segm; begin Do_Nothing (Segm'Address); -- START Do_Nothing (Obj'Address); end Foo;

36.72

73

0.715686

120be4e759f9101ff30882adb306fe8f7b678419

6,541

ads

Ada

source/amf/mof/cmof/amf-internals-cmof_opaque_expressions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/cmof/amf-internals-cmof_opaque_expressions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/cmof/amf-internals-cmof_opaque_expressions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- 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.CMOF.Elements.Collections; with AMF.CMOF.Named_Elements; with AMF.CMOF.Namespaces; with AMF.CMOF.Opaque_Expressions; with AMF.Internals.CMOF_Value_Specifications; with AMF.String_Collections; with AMF.Visitors; package AMF.Internals.CMOF_Opaque_Expressions is type CMOF_Opaque_Expression_Proxy is limited new AMF.Internals.CMOF_Value_Specifications.CMOF_Value_Specification_Proxy and AMF.CMOF.Opaque_Expressions.CMOF_Opaque_Expression with null record; -- XXX These subprograms are stubs overriding function All_Owned_Elements (Self : not null access constant CMOF_Opaque_Expression_Proxy) return AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element; overriding function Get_Qualified_Name (Self : not null access constant CMOF_Opaque_Expression_Proxy) return Optional_String; overriding function Is_Distinguishable_From (Self : not null access constant CMOF_Opaque_Expression_Proxy; N : AMF.CMOF.Named_Elements.CMOF_Named_Element_Access; Ns : AMF.CMOF.Namespaces.CMOF_Namespace_Access) return Boolean; overriding function Is_Computable (Self : not null access constant CMOF_Opaque_Expression_Proxy) return Boolean; overriding function Integer_Value (Self : not null access constant CMOF_Opaque_Expression_Proxy) return Integer; overriding function Boolean_Value (Self : not null access constant CMOF_Opaque_Expression_Proxy) return Boolean; overriding function String_Value (Self : not null access constant CMOF_Opaque_Expression_Proxy) return League.Strings.Universal_String; overriding function Unlimited_Value (Self : not null access constant CMOF_Opaque_Expression_Proxy) return Unlimited_Natural; overriding function Is_Null (Self : not null access constant CMOF_Opaque_Expression_Proxy) return Boolean; overriding function Get_Body (Self : not null access constant CMOF_Opaque_Expression_Proxy) return AMF.String_Collections.Sequence_Of_String; overriding function Get_Language (Self : not null access constant CMOF_Opaque_Expression_Proxy) return AMF.String_Collections.Ordered_Set_Of_String; overriding procedure Enter_Element (Self : not null access constant CMOF_Opaque_Expression_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 CMOF_Opaque_Expression_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 CMOF_Opaque_Expression_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.CMOF_Opaque_Expressions;

51.503937

87

0.579881

311b9a2c2fab2077313c730f5644c6c0b0ee44db

1,360

adb

Ada

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/out_of_line_in_inlined/foo_o224_021.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

31

2018-08-01T21:25:24.000Z

2022-02-14T07:52:34.000Z

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/out_of_line_in_inlined/foo_o224_021.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

40

2018-12-03T19:48:52.000Z

2021-03-10T06:34:26.000Z

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/out_of_line_in_inlined/foo_o224_021.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

20

2018-11-16T21:19:22.000Z

2021-10-18T23:08:24.000Z

-- Copyright 2015-2016 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/>. with Bar; use Bar; procedure Foo_O224_021 is O1 : constant Object_Type := Get_Str ("Foo"); procedure Child1 is O2 : constant Object_Type := Get_Str ("Foo"); function Child2 (S : String) return Boolean is -- STOP begin for C of S loop Do_Nothing (C); if C = 'o' then return True; end if; end loop; return False; end Child2; R : Boolean; begin R := Child2 ("Foo"); R := Child2 ("Bar"); R := Child2 ("Foobar"); end Child1; begin Child1; end Foo_O224_021;

30.222222

73

0.618382

d0eada3337dceb76da6767a21f005c909f462624

6,246

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/s-pack31.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/s-pack31.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/s-pack31.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 3 1 -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Storage_Elements; with System.Unsigned_Types; package body System.Pack_31 is subtype Bit_Order is System.Bit_Order; Reverse_Bit_Order : constant Bit_Order := Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order)); subtype Ofs is System.Storage_Elements.Storage_Offset; subtype Uns is System.Unsigned_Types.Unsigned; subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7; use type System.Storage_Elements.Storage_Offset; use type System.Unsigned_Types.Unsigned; type Cluster is record E0, E1, E2, E3, E4, E5, E6, E7 : Bits_31; end record; for Cluster use record E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1; E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1; E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1; E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1; E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1; E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1; E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1; E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1; end record; for Cluster'Size use Bits * 8; for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment, 1 + 1 * Boolean'Pos (Bits mod 2 = 0) + 2 * Boolean'Pos (Bits mod 4 = 0)); -- Use maximum possible alignment, given the bit field size, since this -- will result in the most efficient code possible for the field. type Cluster_Ref is access Cluster; type Rev_Cluster is new Cluster with Bit_Order => Reverse_Bit_Order, Scalar_Storage_Order => Reverse_Bit_Order; type Rev_Cluster_Ref is access Rev_Cluster; ------------ -- Get_31 -- ------------ function Get_31 (Arr : System.Address; N : Natural; Rev_SSO : Boolean) return Bits_31 is A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8); C : Cluster_Ref with Address => A'Address, Import; RC : Rev_Cluster_Ref with Address => A'Address, Import; begin if Rev_SSO then case N07 (Uns (N) mod 8) is when 0 => return RC.E0; when 1 => return RC.E1; when 2 => return RC.E2; when 3 => return RC.E3; when 4 => return RC.E4; when 5 => return RC.E5; when 6 => return RC.E6; when 7 => return RC.E7; end case; else case N07 (Uns (N) mod 8) is when 0 => return C.E0; when 1 => return C.E1; when 2 => return C.E2; when 3 => return C.E3; when 4 => return C.E4; when 5 => return C.E5; when 6 => return C.E6; when 7 => return C.E7; end case; end if; end Get_31; ------------ -- Set_31 -- ------------ procedure Set_31 (Arr : System.Address; N : Natural; E : Bits_31; Rev_SSO : Boolean) is A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8); C : Cluster_Ref with Address => A'Address, Import; RC : Rev_Cluster_Ref with Address => A'Address, Import; begin if Rev_SSO then case N07 (Uns (N) mod 8) is when 0 => RC.E0 := E; when 1 => RC.E1 := E; when 2 => RC.E2 := E; when 3 => RC.E3 := E; when 4 => RC.E4 := E; when 5 => RC.E5 := E; when 6 => RC.E6 := E; when 7 => RC.E7 := E; end case; else case N07 (Uns (N) mod 8) is when 0 => C.E0 := E; when 1 => C.E1 := E; when 2 => C.E2 := E; when 3 => C.E3 := E; when 4 => C.E4 := E; when 5 => C.E5 := E; when 6 => C.E6 := E; when 7 => C.E7 := E; end case; end if; end Set_31; end System.Pack_31;

39.531646

78

0.460775

31deba4af97fa5fddbd1b0e3f913a320b9472f30

58

ads

Ada

Ada/inc/Problem_45.ads

Tim-Tom/project-euler

177e0043ee93409742ec596c4379251f681b4275

[ "Unlicense" ]

null

Ada/inc/Problem_45.ads

Tim-Tom/project-euler

177e0043ee93409742ec596c4379251f681b4275

[ "Unlicense" ]

null

Ada/inc/Problem_45.ads

Tim-Tom/project-euler

177e0043ee93409742ec596c4379251f681b4275

[ "Unlicense" ]

null

package Problem_45 is procedure Solve; end Problem_45;

14.5

21

0.793103

06680e50d74dbb75e57ed2ecbdb6e5c0a283a294

11,276

ads

Ada

ada-strings-unbounded.ads

mgrojo/adalib

dc1355a5b65c2843e702ac76252addb2caf3c56b

[ "BSD-3-Clause" ]

15

2018-07-08T07:09:19.000Z

2021-11-21T09:58:55.000Z

ada-strings-unbounded.ads

mgrojo/adalib

dc1355a5b65c2843e702ac76252addb2caf3c56b

[ "BSD-3-Clause" ]

4

2019-11-17T20:04:33.000Z

2021-08-29T21:24:55.000Z

ada-strings-unbounded.ads

mgrojo/adalib

dc1355a5b65c2843e702ac76252addb2caf3c56b

[ "BSD-3-Clause" ]

3

2020-04-23T11:17:11.000Z

2021-08-29T19:31:09.000Z

-- Standard Ada library specification -- Copyright (c) 2003-2018 Maxim Reznik <[email protected]> -- Copyright (c) 2004-2016 AXE Consultants -- Copyright (c) 2004, 2005, 2006 Ada-Europe -- Copyright (c) 2000 The MITRE Corporation, Inc. -- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc. -- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual --------------------------------------------------------------------------- with Ada.Strings.Maps; package Ada.Strings.Unbounded is pragma Preelaborate (Unbounded); type Unbounded_String is private; pragma Preelaborable_Initialization (Unbounded_String); Null_Unbounded_String : constant Unbounded_String; function Length (Source : in Unbounded_String) return Natural; type String_Access is access all String; procedure Free (X : in out String_Access); -- Conversion, Concatenation, and Selection functions function To_Unbounded_String (Source : in String) return Unbounded_String; function To_Unbounded_String (Length : in Natural) return Unbounded_String; function To_String (Source : in Unbounded_String) return String; procedure Set_Unbounded_String (Target : out Unbounded_String; Source : in String); procedure Append (Source : in out Unbounded_String; New_Item : in Unbounded_String); procedure Append (Source : in out Unbounded_String; New_Item : in String); procedure Append (Source : in out Unbounded_String; New_Item : in Character); function "&" (Left, Right : in Unbounded_String) return Unbounded_String; function "&" (Left : in Unbounded_String; Right : in String) return Unbounded_String; function "&" (Left : in String; Right : in Unbounded_String) return Unbounded_String; function "&" (Left : in Unbounded_String; Right : in Character) return Unbounded_String; function "&" (Left : in Character; Right : in Unbounded_String) return Unbounded_String; function Element (Source : in Unbounded_String; Index : in Positive) return Character; procedure Replace_Element (Source : in out Unbounded_String; Index : in Positive; By : in Character); function Slice (Source : in Unbounded_String; Low : in Positive; High : in Natural) return String; function Unbounded_Slice (Source : in Unbounded_String; Low : in Positive; High : in Natural) return Unbounded_String; procedure Unbounded_Slice (Source : in Unbounded_String; Target : out Unbounded_String; Low : in Positive; High : in Natural); function "=" (Left, Right : in Unbounded_String) return Boolean; function "=" (Left : in Unbounded_String; Right : in String) return Boolean; function "=" (Left : in String; Right : in Unbounded_String) return Boolean; function "<" (Left, Right : in Unbounded_String) return Boolean; function "<" (Left : in Unbounded_String; Right : in String) return Boolean; function "<" (Left : in String; Right : in Unbounded_String) return Boolean; function "<=" (Left, Right : in Unbounded_String) return Boolean; function "<=" (Left : in Unbounded_String; Right : in String) return Boolean; function "<=" (Left : in String; Right : in Unbounded_String) return Boolean; function ">" (Left, Right : in Unbounded_String) return Boolean; function ">" (Left : in Unbounded_String; Right : in String) return Boolean; function ">" (Left : in String; Right : in Unbounded_String) return Boolean; function ">=" (Left, Right : in Unbounded_String) return Boolean; function ">=" (Left : in Unbounded_String; Right : in String) return Boolean; function ">=" (Left : in String; Right : in Unbounded_String) return Boolean; -- Search subprograms function Index (Source : in Unbounded_String; Pattern : in String; From : in Positive; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping := Maps.Identity) return Natural; function Index (Source : in Unbounded_String; Pattern : in String; From : in Positive; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping_Function) return Natural; function Index (Source : in Unbounded_String; Pattern : in String; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping := Maps.Identity) return Natural; function Index (Source : in Unbounded_String; Pattern : in String; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping_Function) return Natural; function Index (Source : in Unbounded_String; Set : in Maps.Character_Set; From : in Positive; Test : in Membership := Inside; Going : in Direction := Forward) return Natural; function Index (Source : in Unbounded_String; Set : in Maps.Character_Set; Test : in Membership := Inside; Going : in Direction := Forward) return Natural; function Index_Non_Blank (Source : in Unbounded_String; From : in Positive; Going : in Direction := Forward) return Natural; function Index_Non_Blank (Source : in Unbounded_String; Going : in Direction := Forward) return Natural; function Count (Source : in Unbounded_String; Pattern : in String; Mapping : in Maps.Character_Mapping := Maps.Identity) return Natural; function Count (Source : in Unbounded_String; Pattern : in String; Mapping : in Maps.Character_Mapping_Function) return Natural; function Count (Source : in Unbounded_String; Set : in Maps.Character_Set) return Natural; procedure Find_Token (Source : in Unbounded_String; Set : in Maps.Character_Set; Test : in Membership; First : out Positive; Last : out Natural); procedure Find_Token (Source : in Unbounded_String; Set : in Maps.Character_Set; Test : in Membership; First : out Positive; Last : out Natural); -- String translation subprograms function Translate (Source : in Unbounded_String; Mapping : in Maps.Character_Mapping) return Unbounded_String; procedure Translate (Source : in out Unbounded_String; Mapping : in Maps.Character_Mapping); function Translate (Source : in Unbounded_String; Mapping : in Maps.Character_Mapping_Function) return Unbounded_String; procedure Translate (Source : in out Unbounded_String; Mapping : in Maps.Character_Mapping_Function); -- String transformation subprograms function Replace_Slice (Source : in Unbounded_String; Low : in Positive; High : in Natural; By : in String) return Unbounded_String; procedure Replace_Slice (Source : in out Unbounded_String; Low : in Positive; High : in Natural; By : in String); function Insert (Source : in Unbounded_String; Before : in Positive; New_Item : in String) return Unbounded_String; procedure Insert (Source : in out Unbounded_String; Before : in Positive; New_Item : in String); function Overwrite (Source : in Unbounded_String; Position : in Positive; New_Item : in String) return Unbounded_String; procedure Overwrite (Source : in out Unbounded_String; Position : in Positive; New_Item : in String); function Delete (Source : in Unbounded_String; From : in Positive; Through : in Natural) return Unbounded_String; procedure Delete (Source : in out Unbounded_String; From : in Positive; Through : in Natural); function Trim (Source : in Unbounded_String; Side : in Trim_End) return Unbounded_String; procedure Trim (Source : in out Unbounded_String; Side : in Trim_End); function Trim (Source : in Unbounded_String; Left : in Maps.Character_Set; Right : in Maps.Character_Set) return Unbounded_String; procedure Trim (Source : in out Unbounded_String; Left : in Maps.Character_Set; Right : in Maps.Character_Set); function Head (Source : in Unbounded_String; Count : in Natural; Pad : in Character := Space) return Unbounded_String; procedure Head (Source : in out Unbounded_String; Count : in Natural; Pad : in Character := Space); function Tail (Source : in Unbounded_String; Count : in Natural; Pad : in Character := Space) return Unbounded_String; procedure Tail (Source : in out Unbounded_String; Count : in Natural; Pad : in Character := Space); function "*" (Left : in Natural; Right : in Character) return Unbounded_String; function "*" (Left : in Natural; Right : in String) return Unbounded_String; function "*" (Left : in Natural; Right : in Unbounded_String) return Unbounded_String; private pragma Import (Ada, Unbounded_String); pragma Import (Ada, Null_Unbounded_String); end Ada.Strings.Unbounded;

36.141026

75

0.543721

1c8dd9599b4858c6108e0df5e60482185b720cbc

5,941

ads

Ada

bb-runtimes/src/i-leon3.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/i-leon3.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/i-leon3.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- I N T E R F A C E S . L E O N 3 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1999-2002 Universidad Politecnica de Madrid -- -- Copyright (C) 2003-2006 The European Space Agency -- -- Copyright (C) 2003-2017, 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 3, 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. -- -- -- -- 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. -- -- -- -- The port of GNARL to bare board targets was initially developed by the -- -- Real-Time Systems Group at the Technical University of Madrid. -- -- -- ------------------------------------------------------------------------------ -- This package provides the appropriate mapping for the system registers. -- This is a LEON3 specific package, based on the UT699 LEON 3FT/SPARC V8 -- Micro-Processor Advanced Users Manual, dated March 2, 2009 from -- www.aeroflex.com/LEON, referenced hereafter as AUM. package Interfaces.Leon3 is pragma No_Elaboration_Code_All; pragma Preelaborate; -- Pragma Suppress_Initialization (register_type) must be used in order -- to keep eficiency. Otherwise, initialization procedures are always -- generated for objects of packed boolean array types and of record types -- that have components of these types. ---------------------------- -- Local type definitions -- ---------------------------- type Reserved_2 is array (0 .. 1) of Boolean; for Reserved_2'Size use 2; pragma Pack (Reserved_2); type Reserved_3 is array (0 .. 2) of Boolean; for Reserved_3'Size use 3; pragma Pack (Reserved_3); type Reserved_8 is array (0 .. 7) of Boolean; for Reserved_8'Size use 8; pragma Pack (Reserved_8); type Reserved_9 is array (0 .. 8) of Boolean; for Reserved_9'Size use 9; pragma Pack (Reserved_9); type Reserved_16 is array (0 .. 15) of Boolean; for Reserved_16'Size use 16; pragma Pack (Reserved_16); type Reserved_20 is array (0 .. 19) of Boolean; for Reserved_20'Size use 20; pragma Pack (Reserved_20); type Reserved_21 is array (0 .. 20) of Boolean; for Reserved_21'Size use 21; pragma Pack (Reserved_21); type Reserved_22 is array (0 .. 21) of Boolean; for Reserved_22'Size use 22; pragma Pack (Reserved_22); type Reserved_23 is array (0 .. 22) of Boolean; for Reserved_23'Size use 23; pragma Pack (Reserved_23); type Reserved_24 is array (0 .. 23) of Boolean; for Reserved_24'Size use 24; pragma Pack (Reserved_24); type Reserved_25 is array (0 .. 24) of Boolean; for Reserved_25'Size use 25; pragma Pack (Reserved_25); type Reserved_27 is array (0 .. 26) of Boolean; for Reserved_27'Size use 27; pragma Pack (Reserved_27); -- Mapping between bits in a 32-bit register as used in the hardware -- documentation and bit order as used by Ada. -- This makes it easier to verify correctness against the AUM. Ranges will -- need to be reversed, but the compiler will check this. Bit00 : constant := 31; Bit01 : constant := 30; Bit02 : constant := 29; Bit03 : constant := 28; Bit04 : constant := 27; Bit05 : constant := 26; Bit06 : constant := 25; Bit07 : constant := 24; Bit08 : constant := 23; Bit09 : constant := 22; Bit10 : constant := 21; Bit11 : constant := 20; Bit12 : constant := 19; Bit13 : constant := 18; Bit14 : constant := 17; Bit15 : constant := 16; Bit16 : constant := 15; Bit17 : constant := 14; Bit18 : constant := 13; Bit19 : constant := 12; Bit20 : constant := 11; Bit21 : constant := 10; Bit22 : constant := 09; Bit23 : constant := 08; Bit24 : constant := 7; Bit25 : constant := 06; Bit26 : constant := 05; Bit27 : constant := 4; Bit28 : constant := 03; Bit29 : constant := 02; Bit30 : constant := 1; Bit31 : constant := 00; end Interfaces.Leon3;

48.696721

78

0.532907

1cfccd70ab59c5d8aba93d2f22ae957b2f9bf48c

5,544

adb

Ada

aunit/aunit-time_measure.adb

btmalone/alog

164a0a3e82aee414dc6125b64cd8ccc3a01876f9

[ "Apache-2.0" ]

null

aunit/aunit-time_measure.adb

btmalone/alog

164a0a3e82aee414dc6125b64cd8ccc3a01876f9

[ "Apache-2.0" ]

3

2018-12-23T03:07:49.000Z

2019-06-03T20:16:30.000Z

aunit/aunit-time_measure.adb

btmalone/alog

164a0a3e82aee414dc6125b64cd8ccc3a01876f9

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- A U N I T . T I M E _ M E A S U R E -- -- -- -- B o d y -- -- -- -- -- -- Copyright (C) 2006-2014, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 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 is maintained by AdaCore (http://www.adacore.com) -- -- -- ------------------------------------------------------------------------------ package body AUnit.Time_Measure is ------------------- -- Start_Measure -- ------------------- procedure Start_Measure (T : in out Time) is begin T.Start := Ada.Calendar.Clock; end Start_Measure; ------------------ -- Stop_Measure -- ------------------ procedure Stop_Measure (T : in out Time) is begin T.Stop := Ada.Calendar.Clock; end Stop_Measure; ----------------- -- Get_Measure -- ----------------- function Get_Measure (T : Time) return AUnit_Duration is use type Ada.Calendar.Time; begin return AUnit_Duration (T.Stop - T.Start); end Get_Measure; --------------------- -- Gen_Put_Measure -- --------------------- procedure Gen_Put_Measure (Measure : AUnit_Duration) is H, M, S : Integer := 0; T : Duration := Duration (Measure); Force : Boolean; procedure Put (N : Integer; Length : Integer); -- Put N using at least Length digits. procedure Put (N : Integer; Length : Integer) is begin for Dig in reverse 1 .. Length - 1 loop if N < 10**Dig then Put ("0"); else exit; end if; end loop; Put (N); end Put; begin -- Calculate the number of hours, minutes and seconds while T >= 3600.0 loop H := H + 1; T := T - 3600.0; end loop; while T >= 60.0 loop M := M + 1; T := T - 60.0; end loop; while T >= 1.0 loop S := S + 1; T := T - 1.0; end loop; -- Now display the result Force := False; if H > 0 then Put (H); Put ("h"); Force := True; end if; if M > 0 or else Force then if not Force then Put (M); else -- In case some output is already done, then we force a 2 digits -- output so that the output is normalized. Put (M, 2); end if; Put ("min. "); Force := True; end if; if not Force then Put (S); else Put (S, 2); end if; Put ("."); Put (Integer (T * 1_000_000.0), 6); Put (" sec."); end Gen_Put_Measure; -------------------------------- -- Gen_Put_Measure_In_Seconds -- -------------------------------- procedure Gen_Put_Measure_In_Seconds (Measure : AUnit_Duration) is S : Integer := 0; T : Duration := Duration (Measure); procedure Put (N : Integer; Length : Integer); -- Put N using at least Length digits. procedure Put (N : Integer; Length : Integer) is begin for Dig in reverse 1 .. Length - 1 loop if N < 10**Dig then Put ("0"); else exit; end if; end loop; Put (N); end Put; begin while T >= 1.0 loop S := S + 1; T := T - 1.0; end loop; Put (S); Put ("."); Put (Integer (T * 1_000_000.0), 9); Put ("s"); end Gen_Put_Measure_In_Seconds; end AUnit.Time_Measure;

31.5

78

0.371212