max_stars_repo_path stringlengths 4 261 | max_stars_repo_name stringlengths 6 106 | max_stars_count int64 0 38.8k | id stringlengths 1 6 | text stringlengths 7 1.05M |
|---|---|---|---|---|
source/RASCAL-Utility.adb | bracke/Meaning | 1 | 20167 | <reponame>bracke/Meaning<gh_stars>1-10
--------------------------------------------------------------------------------
-- --
-- Copyright (C) 2004, RISC OS Ada Library (RASCAL) developers. --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU Lesser General Public --
-- License as published by the Free Software Foundation; either --
-- version 2.1 of the License, or (at your option) any later version. --
-- --
-- This library is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Lesser General Public License for more details. --
-- --
-- You should have received a copy of the GNU Lesser General Public --
-- License along with this library; if not, write to the Free Software --
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA --
-- --
--------------------------------------------------------------------------------
-- $Author$
-- $Date$
-- $Revision$
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with System.Storage_Elements; use System.Storage_Elements;
with System.Address_To_Access_Conversions;
with Interfaces.C;
with Reporter;
with RASCAL.OS; use RASCAL.OS;
package body RASCAL.Utility is
--
Linebufferlength : constant := 1024;
-- Methods
procedure Get_Line (File : in File_Type;
Item : out Unbounded_String) is
function More_Input return Unbounded_String is
Input : String (1..Linebufferlength);
Last : Natural;
begin
Get_Line (File, Input, Last);
if Last < Input'Last then
return To_Unbounded_String (Input(1..Last));
else
return To_Unbounded_String (Input(1..Last)) & More_Input;
end if;
end More_Input;
begin
Item := More_Input;
end Get_Line;
--
function Get_Line (File : in File_Type) return String is
dummy : Ustring;
begin
Get_Line (File,dummy);
return S(dummy);
end Get_Line;
--
procedure Put (File : in File_type;
Item : in Unbounded_String) is
begin
Put(File, To_String(Item));
end Put;
--
procedure Put_Line (File : in File_Type;
Item : in Unbounded_String) is
begin
Put(File, To_String(Item));
New_Line(File);
end Put_Line;
--
function "and" (left : in Integer; right : in Unsigned) return Integer is
begin
return Unsigned_To_Int(Int_To_Unsigned(left) and right);
end "and";
--
function "or" (left : in Integer; right : in Unsigned) return Integer is
begin
return Unsigned_To_Int(Int_To_Unsigned(left) or right);
end "or";
--
function "xor" (left : in Integer; right : in Unsigned) return Integer is
begin
return Unsigned_To_Int(Int_To_Unsigned(left) xor right);
end "xor";
--
function bic (left : in Integer; right : in Unsigned) return Integer is
begin
return "and"(left,not right);
end bic;
--
function charbool (char : in Character) return Boolean is
begin
if char = '0' then
return false;
else
return true;
end if;
exception
when others => Reporter.Report("Exception raised in Utility.charbool!");
raise;
end charbool;
--
function boolstr (bool : in Boolean) return String is
begin
if bool then
return "1";
else
return "0";
end if;
exception
when others => Reporter.Report("Exception raised in Utility.boolstr!");
raise;
end boolstr;
--
function intstr (int : in Integer) return String is
begin
return Trim(Integer'Image(int),left);
exception
when others => Reporter.Report("Exception raised in Utility.intstr!");
raise;
end intstr;
--
function strint (str : in String) return Integer is
begin
return Integer'Value(str);
exception
when others => Reporter.Report("Exception raised in Utility.strint!");
raise;
end strint;
--
function Adr_To_Int (adr : in Address) return Interfaces.C.int is
begin
return Interfaces.C.int(To_Integer(adr));
end Adr_To_Int;
--
function Int_To_Adr (cint : in Interfaces.C.int) return Address is
begin
return To_Address(Integer_Address(cint));
end Int_To_Adr;
--
function Adr_To_Integer (adr : in Address) return Integer is
begin
return Integer(To_Integer(adr));
end Adr_To_Integer;
--
function Integer_To_Adr (aint : in Integer) return Address is
begin
return To_Address(Integer_Address(aint));
end Integer_To_Adr;
--
function StripLeadingSpaces (Str : in String) return String is
begin
return Trim(Str,Left);
exception
when others => Reporter.Report("Exception raised in Utility.StripLeadingSpaces!");
raise;
end StripLeadingSpaces;
--
function StripTrailingSpaces (Str : in String) return String is
begin
return Trim(Str,Right);
exception
when others => Reporter.Report("Exception raised in Utility.StripLeadingSpaces!");
raise;
end StripTrailingSpaces;
--
function StripTrailingZeroes (Str : in String) return String is
Ende : Integer;
begin
Ende:=Str'Last;
while (Ende > Str'First and Str(Ende) = ASCII.NUL) loop
Ende:=Ende-1;
end loop;
return Str(Str'First..Ende);
exception
when others => Reporter.Report("Exception raised in Utility.StripTrailingZeroes!");
raise;
end StripTrailingZeroes;
--
function Align(nr : Integer) return Integer is
aligned : integer := nr;
begin
while aligned mod 4 /= 0 loop
aligned := aligned + 1;
end loop;
return aligned;
end Align;
--
procedure Call_OS_CLI (Command : in String) is
Local_String : String := Command & ASCII.NUL;
Error : oserror_access;
OS_CLI : constant Interfaces.C.Unsigned := 16#5#;
Regs : aliased Kernel.SWI_Regs;
begin
Regs.R(0) := Adr_To_Int (Local_String'Address);
Error := Kernel.SWI (OS_CLI, Regs'Access, Regs'Access);
if Error /= null then
pragma Debug(Reporter.Report("Utility.Call_OS_CLI: " & Interfaces.C.To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
exception
when others => null;
end Call_OS_CLI;
--
end RASCAL.Utility;
|
src/interactive-cmds.agda | ice1k/cedille | 0 | 8648 | <filename>src/interactive-cmds.agda
import cedille-options
module interactive-cmds (options : cedille-options.options) where
open import functions
open import cedille-types
open import conversion
open import constants
open import ctxt
open import general-util
open import spans options {Id}
open import subst
open import syntax-util
open import type-util
open import to-string options
open import toplevel-state options {IO}
open import untyped-spans options {Id}
open import parser
open import resugar
open import rewriting
open import rename
open import classify options {Id} (λ _ → return triv)
import spans options {IO} as io-spans
open import datatype-util
open import free-vars
open import json
private
elab-typed-err : ∀ {ed} → ctxt → ⟦ ed ⟧' → ⟦ ed ⟧ × 𝔹
elab-typed-err {TERM} Γ t =
map-snd spans-have-error $ map-fst fst $ id-out $ check-term Γ t nothing empty-spans
elab-typed-err {TYPE} Γ T =
map-snd spans-have-error $ map-fst fst $ id-out $ check-type Γ T nothing empty-spans
elab-typed-err {KIND} Γ k =
map-snd spans-have-error $ id-out $ check-kind Γ k empty-spans
elab-typed : ∀ {ed} → ctxt → ⟦ ed ⟧' → ⟦ ed ⟧
elab-typed Γ = fst ∘ elab-typed-err Γ
elab-untyped : ∀ {ed} → ctxt → ⟦ ed ⟧' → ⟦ ed ⟧
elab-untyped {TERM} Γ t = fst $ id-out $ untyped-term Γ t empty-spans
elab-untyped {TYPE} Γ T = fst $ id-out $ untyped-type Γ T empty-spans
elab-untyped {KIND} Γ k = fst $ id-out $ untyped-kind Γ k empty-spans
elab-untyped-no-params : ∀ {ed} → ctxt → ⟦ ed ⟧' → ⟦ ed ⟧
elab-untyped-no-params Γ =
elab-untyped (record Γ {qual = trie-map (map-snd λ _ → []) (ctxt.qual Γ)})
{- Parsing -}
ll-ind : ∀ {X : exprd → Set} → X TERM → X TYPE → X KIND → (ll : exprd) → X ll
ll-ind t T k TERM = t
ll-ind t T k TYPE = T
ll-ind t T k KIND = k
ll-ind' : ∀ {X : Σ exprd ⟦_⟧ → Set} → (s : Σ exprd ⟦_⟧) → ((t : term) → X (TERM , t)) → ((T : type) → X (TYPE , T)) → ((k : kind) → X (KIND , k)) → X s
ll-ind' (TERM , t) tf Tf kf = tf t
ll-ind' (TYPE , T) tf Tf kf = Tf T
ll-ind' (KIND , k) tf Tf kf = kf k
ll-disambiguate : ctxt → ex-tm → maybe ex-tp
ll-disambiguate Γ (ExVar pi x) = ctxt-lookup-type-var Γ x >>= λ _ → just (ExTpVar pi x)
ll-disambiguate Γ (ExApp t NotErased t') = ll-disambiguate Γ t >>= λ T →
just (ExTpAppt T t')
ll-disambiguate Γ (ExAppTp t T') = ll-disambiguate Γ t >>= λ T → just (ExTpApp T T')
ll-disambiguate Γ (ExLam pi ff pi' x (just atk) t) =
ll-disambiguate (ctxt-tk-decl pi' x (case atk of λ {(ExTkt _) → Tkt (TpHole pi'); (ExTkk _) → Tkk KdStar}) Γ) t >>= λ T →
just (ExTpLam pi pi' x atk T)
ll-disambiguate Γ (ExParens pi t pi') = ll-disambiguate Γ t
ll-disambiguate Γ (ExLet pi _ d t) =
ll-disambiguate (Γ' d) t >>= λ T → just (ExTpLet pi d T)
where
Γ' : ex-def → ctxt
Γ' (ExDefTerm pi' x T? t) = ctxt-term-def pi' localScope opacity-open x (just (Hole pi')) (TpHole pi') Γ
Γ' (ExDefType pi' x k T) = ctxt-type-def pi' localScope opacity-open x (just (TpHole pi')) KdStar Γ
ll-disambiguate Γ t = nothing
parse-string : (ll : exprd) → string → maybe ⟦ ll ⟧'
parse-string ll s = case ll-ind {λ ll → string → Either string ⟦ ll ⟧'}
parseTerm parseType parseKind ll s of λ {(Left e) → nothing; (Right e) → just e}
ttk = "term, type, or kind"
parse-err-msg : (failed-to-parse : string) → (as-a : string) → string
parse-err-msg failed-to-parse "" =
"Failed to parse \\\\\"" ^ failed-to-parse ^ "\\\\\""
parse-err-msg failed-to-parse as-a =
"Failed to parse \\\\\"" ^ failed-to-parse ^ "\\\\\" as a " ^ as-a
infixr 7 _>>nothing_ _-_!_>>parse_ _!_>>error_
_>>nothing_ : ∀{ℓ}{A : Set ℓ} → maybe A → maybe A → maybe A
(nothing >>nothing m₂) = m₂
(m₁ >>nothing m₂) = m₁
_-_!_>>parse_ : ∀{A B : Set} → (string → maybe A) → string →
(error-msg : string) → (A → string ⊎ B) → string ⊎ B
(f - s ! e >>parse f') = maybe-else (inj₁ (parse-err-msg s e)) f' (f s)
_!_>>error_ : ∀{E A B : Set} → maybe A → E → (A → E ⊎ B) → E ⊎ B
(just a ! e >>error f) = f a
(nothing ! e >>error f) = inj₁ e
parse-try : ∀ {X : Set} → ctxt → string → maybe
(((ll : exprd) → ⟦ ll ⟧' → X) → X)
parse-try Γ s =
maybe-map (λ t f → maybe-else (f TERM t) (f TYPE) (ll-disambiguate Γ t))
(parse-string TERM s) >>nothing
maybe-map (λ T f → f TYPE T) (parse-string TYPE s) >>nothing
maybe-map (λ k f → f KIND k) (parse-string KIND s)
string-to-𝔹 : string → maybe 𝔹
string-to-𝔹 "tt" = just tt
string-to-𝔹 "ff" = just ff
string-to-𝔹 _ = nothing
parse-ll : string → maybe exprd
parse-ll "term" = just TERM
parse-ll "type" = just TYPE
parse-ll "kind" = just KIND
parse-ll _ = nothing
{- Local Context -}
record lci : Set where
constructor mk-lci
field ll : string; x : var; t : string; T : string; fn : string; pi : posinfo
data 𝕃ₛ {ℓ} (A : Set ℓ) : Set ℓ where
[_]ₛ : A → 𝕃ₛ A
_::ₛ_ : A → 𝕃ₛ A → 𝕃ₛ A
headₛ : ∀ {ℓ} {A : Set ℓ} → 𝕃ₛ A → A
headₛ [ a ]ₛ = a
headₛ (a ::ₛ as) = a
𝕃ₛ-to-𝕃 : ∀ {ℓ} {A : Set ℓ} → 𝕃ₛ A → 𝕃 A
𝕃ₛ-to-𝕃 [ a ]ₛ = [ a ]
𝕃ₛ-to-𝕃 (a ::ₛ as) = a :: 𝕃ₛ-to-𝕃 as
merge-lcis-ctxt-tvs : ctxt → 𝕃 string → ctxt × 𝕃 tagged-val
merge-lcis-ctxt-tvs c =
foldl merge-lcis-ctxt' (c , [])
∘ (sort-lcis ∘ strings-to-lcis)
where
strings-to-lcis : 𝕃 string → 𝕃 lci
strings-to-lcis ss = strings-to-lcis-h ss [] where
strings-to-lcis-h : 𝕃 string → 𝕃 lci → 𝕃 lci
strings-to-lcis-h (ll :: x :: t :: T :: fn :: pi :: tl) items =
strings-to-lcis-h tl (mk-lci ll x t T fn pi :: items)
strings-to-lcis-h _ items = items
-- TODO: Local context information does not pass Δ information!
-- When users are using BR-explorer to rewrite with the rec function,
-- if they call it upon "μ' [SUBTERM] {...}", it won't work unless they say
-- "μ'<rec/mu> [SUBTERM] {...}".
decl-lci : posinfo → var → ctxt → ctxt
decl-lci pi x Γ =
record Γ { qual = trie-insert (ctxt.qual Γ) x (pi % x , []) }
exprd-type-of : exprd → exprd
exprd-type-of TERM = TYPE
exprd-type-of _ = KIND
merge-lci-ctxt : lci → ctxt × 𝕃 tagged-val → ctxt × 𝕃 tagged-val
merge-lci-ctxt (mk-lci ll v t T fn pi) (Γ , tvs) =
maybe-else (Γ , tvs) (map-snd (λ tv → tvs ++ [ tv ]))
(parse-ll ll >>= λ ll →
parse-string (exprd-type-of ll) T >>=
h ll (parse-string ll t))
where
h : (ll : exprd) → maybe ⟦ ll ⟧' → ⟦ exprd-type-of ll ⟧' → maybe (ctxt × tagged-val)
h TERM (just t) T =
let t = elab-untyped Γ t
T = elab-typed Γ T in
return2 (ctxt-term-def pi localScope opacity-open v (just t) T Γ)
(binder-data Γ pi v (Tkt T) ff (just t) "0" "0")
h TYPE (just T) k =
let T = elab-untyped Γ T
k = elab-typed Γ k in
return2 (ctxt-type-def pi localScope opacity-open v (just T) k Γ)
(binder-data Γ pi v (Tkk k) ff (just T) "0" "0")
h TERM nothing T =
let T = elab-typed Γ T in
return2 (ctxt-term-decl pi v T Γ)
(binder-data Γ pi v (Tkt T) ff nothing "0" "0")
h TYPE nothing k =
let k = elab-typed Γ k in
return2 (ctxt-type-decl pi v k Γ)
(binder-data Γ pi v (Tkk k) ff nothing "0" "0")
h _ _ _ = nothing
merge-lcis-ctxt' : 𝕃ₛ lci → ctxt × 𝕃 tagged-val → ctxt × 𝕃 tagged-val
merge-lcis-ctxt' ls (Γ , tvs) =
let ls' = 𝕃ₛ-to-𝕃 ls in
foldr merge-lci-ctxt (foldr (λ l → decl-lci (lci.pi l) (lci.x l)) Γ ls' , tvs) ls'
sort-eq : ∀ {ℓ} {A : Set ℓ} → (A → A → compare-t) → 𝕃 A → 𝕃 (𝕃ₛ A)
sort-eq {_} {A} c = foldr insert [] where
insert : A → 𝕃 (𝕃ₛ A) → 𝕃 (𝕃ₛ A)
insert n [] = [ [ n ]ₛ ]
insert n (a :: as) with c (headₛ a) n
...| compare-eq = n ::ₛ a :: as
...| compare-gt = [ n ]ₛ :: a :: as
...| compare-lt = a :: insert n as
sort-lcis : 𝕃 lci → 𝕃 (𝕃ₛ lci)
sort-lcis = sort-eq λ l₁ l₂ →
compare (posinfo-to-ℕ $ lci.pi l₁) (posinfo-to-ℕ $ lci.pi l₂)
{-
sort-lcis = list-merge-sort.merge-sort lci λ l l' →
posinfo-to-ℕ (lci.pi l) > posinfo-to-ℕ (lci.pi l')
where import list-merge-sort
-}
merge-lcis-ctxt : ctxt → 𝕃 string → ctxt
merge-lcis-ctxt Γ ls = fst $ merge-lcis-ctxt-tvs Γ ls
get-local-ctxt-tvs : ctxt → (pos : ℕ) → (local-ctxt : 𝕃 string) → ctxt × 𝕃 tagged-val
get-local-ctxt-tvs Γ pi =
merge-lcis-ctxt-tvs (foldr (flip ctxt-clear-symbol ∘ fst) Γ
(flip filter (trie-mappings (ctxt.i Γ)) λ {(x , ci , fn' , pi') →
ctxt.fn Γ =string fn' && posinfo-to-ℕ pi' > pi}))
get-local-ctxt : ctxt → (pos : ℕ) → (local-ctxt : 𝕃 string) → ctxt
get-local-ctxt Γ pi ls = fst (get-local-ctxt-tvs Γ pi ls)
{- Helpers -}
step-reduce : ∀ {ed : exprd} → ctxt → ⟦ ed ⟧ → ⟦ ed ⟧
step-reduce Γ t =
let t' = erase t in maybe-else t' id (step-reduceh Γ t') where
step-reduceh : ∀ {ed : exprd} → ctxt → ⟦ ed ⟧ → maybe ⟦ ed ⟧
step-reduceh{TERM} Γ (Var x) = ctxt-lookup-term-var-def Γ x
step-reduceh{TYPE} Γ (TpVar x) = ctxt-lookup-type-var-def Γ x
step-reduceh{TERM} Γ (App (Lam ff x nothing t) t') = just (subst Γ t' x t)
step-reduceh{TYPE} Γ (TpApp (TpLam x (Tkk _) T) (Ttp T')) = just (subst Γ T' x T)
step-reduceh{TYPE} Γ (TpApp (TpLam x (Tkt _) T) (Ttm t)) = just (subst Γ t x T)
step-reduceh{TERM} Γ (App t t') = step-reduceh Γ t >>= λ t → just (App t t')
step-reduceh{TYPE} Γ (TpApp T tT) = step-reduceh Γ T >>= λ T → just (TpApp T tT)
step-reduceh{TERM} Γ (Lam ff x nothing t) = step-reduceh (ctxt-var-decl x Γ) t >>= λ t → just (Lam ff x nothing t)
step-reduceh{TYPE} Γ (TpLam x atk T) = step-reduceh (ctxt-var-decl x Γ) T >>= λ T → just (TpLam x atk T)
step-reduceh{TERM} Γ (LetTm ff x T t' t) = just (subst Γ t' x t)
step-reduceh{TERM} Γ t @ (Mu μ s Tₘ f~ ms) with
decompose-var-headed s >>=c λ sₕ sₐs → env-lookup Γ sₕ
...| just (ctr-def _ _ _ _ _ , _) = just (hnf Γ unfold-head-no-defs t)
...| _ = step-reduceh Γ s >>= λ s → just (Mu μ s Tₘ f~ ms)
step-reduceh Γ t = nothing
parse-norm : erased? → string → maybe (∀ {ed : exprd} → ctxt → ⟦ ed ⟧ → ⟦ ed ⟧)
parse-norm me "all" = just λ Γ → hnf Γ (record unfold-all {unfold-erase = me})
parse-norm me "head" = just λ Γ → hnf Γ (record unfold-head-elab {unfold-erase = me})
parse-norm me "once" = just λ Γ → step-reduce Γ ∘ erase
parse-norm _ _ = nothing
parse-norm-err = "normalization method (all, head, once)"
{- Command Executors -}
normalize-cmd : ctxt → (str ll pi norm : string) → 𝕃 string → string ⊎ tagged-val
normalize-cmd Γ str ll pi norm ls =
parse-ll - ll ! "language-level" >>parse λ ll' →
string-to-ℕ - pi ! "natural number" >>parse λ sp →
parse-norm tt - norm ! parse-norm-err >>parse λ norm →
parse-string ll' - str ! ll >>parse λ t →
let Γ' = get-local-ctxt Γ sp ls in
inj₂ (to-string-tag "" Γ' (norm Γ' (elab-untyped Γ' t)))
normalize-prompt : ctxt → (str norm : string) → 𝕃 string → string ⊎ tagged-val
normalize-prompt Γ str norm ls =
parse-norm tt - norm ! parse-norm-err >>parse λ norm →
let Γ' = merge-lcis-ctxt Γ ls in
parse-try Γ' - str ! ttk >>parse λ f → f λ ll t →
inj₂ (to-string-tag "" Γ' (norm Γ' (elab-untyped Γ' t)))
erase-cmd : ctxt → (str ll pi : string) → 𝕃 string → string ⊎ tagged-val
erase-cmd Γ str ll pi ls =
parse-ll - ll ! "language-level" >>parse λ ll' →
string-to-ℕ - pi ! "natural number" >>parse λ sp →
parse-string ll' - str ! ll >>parse λ t →
let Γ' = get-local-ctxt Γ sp ls in
inj₂ (to-string-tag "" Γ' (erase (elab-untyped Γ' t)))
erase-prompt : ctxt → (str : string) → 𝕃 string → string ⊎ tagged-val
erase-prompt Γ str ls =
let Γ' = merge-lcis-ctxt Γ ls in
parse-try Γ' - str ! ttk >>parse λ f → f λ ll t →
inj₂ (to-string-tag "" Γ' (erase (elab-untyped Γ' t)))
-- private
-- cmds-to-escaped-string : cmds → strM
-- cmds-to-escaped-string (c :: cs) = cmd-to-string c $ strAdd "\\n\\n" >>str cmds-to-escaped-string cs
-- cmds-to-escaped-string [] = strEmpty
-- data-cmd : ctxt → (encoding name ps is cs : string) → string ⊎ tagged-val
-- data-cmd Γ encodingₛ x psₛ isₛ csₛ =
-- string-to-𝔹 - encodingₛ ! "boolean" >>parse λ encoding →
-- parse-string KIND - psₛ ! "kind" >>parse λ psₖ →
-- parse-string KIND - isₛ ! "kind" >>parse λ isₖ →
-- parse-string KIND - csₛ ! "kind" >>parse λ csₖ →
-- let ps = map (λ {(Index x atk) → Decl posinfo-gen posinfo-gen Erased x atk posinfo-gen}) $ kind-to-indices Γ psₖ
-- cs = map (λ {(Index x (Tkt T)) → Ctr posinfo-gen x T; (Index x (Tkk k)) → Ctr posinfo-gen x $ mtpvar "ErrorExpectedTypeNotKind"}) $ kind-to-indices empty-ctxt csₖ
-- is = kind-to-indices (add-ctrs-to-ctxt cs $ add-params-to-ctxt ps Γ) isₖ
-- picked-encoding = if encoding then mendler-encoding else mendler-simple-encoding
-- defs = datatype-encoding.mk-defs picked-encoding Γ $ Data x ps is cs in
-- inj₂ $ strRunTag "" Γ $ cmds-to-escaped-string $ fst defs
-- pretty-cmd : filepath → filepath → IO string
-- pretty-cmd src-fn dest-fn =
-- readFiniteFile src-fn >>= λ src →
-- case parseStart src of λ where
-- (Left (Left p)) → return ("Lexical error at position " ^ p)
-- (Left (Right p)) → return ("Parse error at position " ^ p)
-- (Right file) → writeFile dest-fn "" >> writeRopeToFile dest-fn (to-string.strRun empty-ctxt (to-string.file-to-string file)) >> return "Finished"
-- where import to-string (record options {pretty-print = tt}) as to-string
{- Commands -}
tv-to-json : string ⊎ tagged-val → json
tv-to-json (inj₁ s) = json-object [ "error" , json-string s ] -- [[ "{\"error\":\"" ]] ⊹⊹ [[ s ]] ⊹⊹ [[ "\"}" ]]
tv-to-json (inj₂ (_ , v , ts)) = tagged-vals-to-json [ "value" , v , ts ]
interactive-cmd-h : ctxt → 𝕃 string → string ⊎ tagged-val
interactive-cmd-h Γ ("normalize" :: input :: ll :: sp :: norm :: lc) =
normalize-cmd Γ input ll sp norm lc
interactive-cmd-h Γ ("erase" :: input :: ll :: sp :: lc) =
erase-cmd Γ input ll sp lc
interactive-cmd-h Γ ("normalizePrompt" :: input :: norm :: lc) =
normalize-prompt Γ input norm lc
interactive-cmd-h Γ ("erasePrompt" :: input :: lc) =
erase-prompt Γ input lc
-- interactive-cmd-h Γ ("data" :: encoding :: x :: ps :: is :: cs :: []) =
-- data-cmd Γ encoding x ps is cs
interactive-cmd-h Γ cs =
inj₁ ("Unknown interactive cmd: " ^ 𝕃-to-string (λ s → s) ", " cs)
record br-history : Set where
inductive
constructor mk-br-history
field
Γ : ctxt
t : term
Tₗₗ : exprd
T : ⟦ Tₗₗ ⟧
Tᵤ : string
f : term → 𝕃 (ctr × term) → term
Γₗ : 𝕃 tagged-val
undo : 𝕃 br-history
redo : 𝕃 br-history
data br-history2 : Set where
br-node : br-history → 𝕃 (ctr × br-history2) → br-history2
br-get-h : br-history2 → br-history
br-get-h (br-node h hs) = h
br-lookup : 𝕃 ℕ → br-history2 → maybe br-history
br-lookup xs h = maybe-map br-get-h $
foldl (λ x h? → h? >>= λ {(br-node h hs) → maybe-map snd $ head2 (nthTail x hs)}) (just h) xs
{-# TERMINATING #-}
br-cmd2 : ctxt → string → string → string → 𝕃 string → IO ⊤
br-cmd2 Γ Tₛ tₛ sp ls =
(string-to-ℕ - sp ! "natural number" >>parse inj₂) >>parseIO λ sp →
elim-pair (get-local-ctxt-tvs Γ sp ls) λ Γ Γₗ →
(parse-try Γ - Tₛ ! ttk >>parse inj₂) >>parseIO λ Tf → Tf λ Tₗₗ T →
(parse-string TERM - tₛ ! "term" >>parse inj₂) >>parseIO λ t →
let T = elab-untyped Γ T
Tₑ = erase T
t = elab-typed Γ t in -- TODO: Probably should switch back to ex-tm so if this doesn't currently check it won't elaborate to a hole!
putJson (tv-to-json $ inj₂ $ ts-tag Γ Tₑ) >>
await (br-node (mk-br-history Γ t Tₗₗ T (rope-to-string $ ts2.to-string Γ Tₑ) const Γₗ [] []) [])
where
import to-string (record options {erase-types = ff}) as ts2
import to-string (record options {erase-types = ff; pretty-print = tt}) as pretty2s
ts-tag : ∀ {ed} → ctxt → ⟦ ed ⟧ → tagged-val
ts-tag = ts2.to-string-tag ""
infixr 6 _>>parseIO_
_>>parseIO_ : ∀ {A : Set} → string ⊎ A → (A → IO ⊤) → IO ⊤
inj₁ e >>parseIO f = putJson $ tv-to-json $ inj₁ e
inj₂ a >>parseIO f = f a
replace-substring : string → string → ℕ → ℕ → string × string
replace-substring sₒ sᵣ fm to with string-to-𝕃char sₒ | string-to-𝕃char sᵣ
...| csₒ | csᵣ =
𝕃char-to-string (take fm csₒ ++ csᵣ ++ drop to csₒ) ,
𝕃char-to-string (take (to ∸ fm) $ drop fm csₒ)
replace : string → string → ℕ → ℕ → string
replace sₒ sᵣ fm to = fst $ replace-substring sₒ sᵣ fm to
substring : string → ℕ → ℕ → string
substring s fm to = snd $ replace-substring s "" fm to
escape-rope : rope → rope
escape-rope [[ s ]] = [[ escape-string s ]]
escape-rope (r₁ ⊹⊹ r₂) = escape-rope r₁ ⊹⊹ escape-rope r₂
parse-path : string → maybe (𝕃 ℕ)
parse-path "" = just []
parse-path s with string-split s ' ' | foldr (λ n ns → ns >>= λ ns → string-to-ℕ n >>= λ n → just (n :: ns)) (just [])
...| "" :: ss | f = f ss
...| path | f = f path
write-history : 𝕃 ℕ → br-history → br-history2 → br-history2
write-history [] h (br-node _ hs) = br-node h hs
write-history (n :: ns) h (br-node hₒ hs) = br-node hₒ $ writeh n hs where
writeh : ℕ → 𝕃 (ctr × br-history2) → 𝕃 (ctr × br-history2)
writeh _ [] = []
writeh zero ((c , h') :: hs) = (c , write-history ns h h') :: hs
writeh (suc n) (h' :: hs) = h' :: writeh n hs
write-children : 𝕃 ℕ → 𝕃 (ctr × br-history) → br-history2 → br-history2
write-children [] hs (br-node h _) = br-node h (map (uncurry λ c h → c , br-node h []) hs)
write-children (n :: ns) hs (br-node h hsₒ) = br-node h $ writeh n hsₒ where
writeh : ℕ → 𝕃 (ctr × br-history2) → 𝕃 (ctr × br-history2)
writeh _ [] = []
writeh zero ((c , h') :: hs') = (c , write-children ns hs h') :: hs'
writeh (suc n) (h' :: hs) = h' :: writeh n hs
outline : br-history2 → term
-- outline (br-node (mk-br-history Γ t TYPE T Tₛ f Γₗ undo redo) []) =
-- elim-pair (id-out $ check-term Γ t (just T) empty-spans) λ t~ ss → f t~ []
-- outline (br-node (mk-br-history Γ t Tₗₗ T Tₛ f Γₗ undo redo) []) = f (elab-untyped-no-params Γ t) []
-- outline (br-node (mk-br-history Γ t Tₗₗ T Tₛ f Γₗ undo redo) hs) =
-- f (elab-typed Γ t) (map (uncurry λ c h → c , outline h) hs)
outline (br-node (mk-br-history Γ t Tₗₗ T Tₛ f Γₗ undo redo) hs) =
f t (map-snd outline <$> hs)
make-case : ctxt → params → term → case-args × term
make-case = h [] where
h : params → ctxt → params → term → case-args × term
h acc Γ (Param me x atk :: ps) (Lam me' x' oc' t') =
h (Param me x' atk :: acc) (ctxt-var-decl x' Γ) (substh-params Γ (renamectxt-single x x') empty-trie ps) t'
h acc Γ ps (Hole pi) = params-to-case-args (reverse acc ++ ps) , Hole pi
h acc Γ ps t = params-to-case-args (reverse acc ++ ps) , params-to-apps ps t
await : br-history2 → IO ⊤
awaith : br-history2 → 𝕃 string → IO ⊤
await his =
getLine >>= λ input →
let input = undo-escape-string input
as = string-split input delimiter in
awaith his as
awaith his as =
let put = putJson ∘ tv-to-json
err = (_>> await his) ∘' put ∘' inj₁ in
case as of λ where -- TODO: for these commands, do not add TYPES/KINDS of local decls to context, as they are probably just bound by foralls/pis/lambdas, not _really_ in scope!
("br" :: path :: as) →
maybe-else' (parse-path path) (err ("Could not parse " ^ path ^ " as a list of space-delimited natural numbers")) λ path →
let await-with = await ∘ flip (write-history path) his in
maybe-else' (br-lookup path his) (err "Beta-reduction pointer does not exist") λ where
this @ (mk-br-history Γ t Tₗₗ T Tᵤ f Γₗ undo redo) → case as of λ where
("undo" :: []) → case undo of λ where
[] → err "No undo history"
(u :: us) →
put (inj₂ $ "" , [[ "Undo" ]] , []) >>
await-with (record u {undo = us; redo = this :: redo})
--u (await Γ t Tₗₗ T Tᵤ f undo redo :: redo)
("redo" :: []) → case redo of λ where
[] → err "No redo history"
(r :: rs) →
put (inj₂ $ "" , [[ "Redo" ]] , []) >>
await-with (record r {undo = this :: undo; redo = rs})
--r
("get" :: []) →
put (inj₂ $ "" , [[ Tᵤ ]] , []) >>
await his
("parse" :: []) →
(_>> await his) $
maybe-else' (parse-string Tₗₗ Tᵤ)
(putJson $ spans-to-json $ global-error "Parse error" nothing)
λ T → putJson $ spans-to-json $ snd $ id-out $ ll-ind {λ ll → ctxt → ⟦ ll ⟧' → spanM ⟦ ll ⟧}
untyped-term untyped-type untyped-kind Tₗₗ (record Γ { fn = "missing" }) T empty-spans
("context" :: []) →
putJson (json-object [ "value" , json-array [ tagged-vals-to-json Γₗ ] ]) >> await his
("check" :: t?) →
let await-set = maybe-else (await his) λ t → await-with $ record this
{t = t; undo = this :: undo; redo = []} in
(λ e → either-else' e
(uncurry λ t? e → put (inj₁ e) >> await-set t?)
(uncurry λ t? m → put (inj₂ $ "value" , [[ m ]] , []) >> await-set t?)) $
ll-ind' {λ T → (maybe term × string) ⊎ (maybe term × string)} (Tₗₗ , T)
(λ _ → inj₁ $ nothing , "Expression must be a type, not a term!")
(λ T →
(case t? of λ where
[] → inj₂ nothing
(t :: []) → maybe-else' (parse-string TERM t)
(inj₁ $ nothing , parse-err-msg t "term")
(inj₂ ∘ just)
_ → inj₁ $ nothing ,
"To many arguments given to beta-reduction command 'check'")
>>= λ t? →
elim-pair (maybe-else' t? (elim-pair (id-out (check-term (qualified-ctxt Γ) (resugar t) (just T) empty-spans)) λ t~ ss → nothing , spans-have-error ss)
λ t → elim-pair (id-out (check-term Γ t (just T) empty-spans))
λ t~ ss → just t~ , spans-have-error ss) λ t~? e? →
let fail = inj₁ (just (maybe-else' t~? t id) , "Type error")
try-β = elim-pair (id-out (check-term Γ (ExBeta pi-gen nothing nothing) (just T) empty-spans)) λ β~ ss → if spans-have-error ss then inj₁ (nothing , "Type error") else inj₂ (just β~ , "Equal by beta") in
if e?
then if isJust t? then fail else try-β
else inj₂ (t~? , "Type inhabited"))
(λ _ → inj₁ $ nothing , "Expression must be a type, not a kind!")
("rewrite" :: fm :: to :: eq :: ρ+? :: lc) →
let Γ' = merge-lcis-ctxt Γ lc in
either-else'
(parse-string TERM - eq ! "term" >>parse λ eqₒ →
string-to-𝔹 - ρ+? ! "boolean" >>parse λ ρ+? →
string-to-ℕ - fm ! "natural number" >>parse λ fm →
string-to-ℕ - to ! "natural number" >>parse λ to →
parse-try Γ' - substring Tᵤ fm to ! ttk >>parse λ Tf → Tf λ ll Tₗ →
elim-pair (id-out (check-term Γ' eqₒ nothing empty-spans)) $ uncurry λ eq Tₑ ss →
is-eq-tp? Tₑ ! "Synthesized a non-equational type from the proof"
>>error uncurry λ t₁ t₂ →
err⊎-guard (spans-have-error ss) "Proof does not type check" >>
let Tₑ = TpEq t₁ t₂
x = fresh-var Γ' "x"
Tₗ = elab-untyped-no-params Γ' Tₗ in
elim-pair (map-snd snd $ rewrite-exprd Tₗ Γ' ρ+? nothing (just eq) t₁ x 0) λ Tᵣ n →
err⊎-guard (iszero n) "No rewrites could be performed" >>
parse-string Tₗₗ - replace Tᵤ
(rope-to-string $ [[ "(" ]] ⊹⊹ ts2.to-string Γ' Tᵣ ⊹⊹ [[ ")" ]]) fm to
! ll-ind "term" "type" "kind" Tₗₗ >>parse λ Tᵤ →
let Tᵤ = elab-untyped-no-params (ctxt-var-decl x Γ) Tᵤ in
ll-ind' {λ {(ll , T) → ⟦ ll ⟧ → string ⊎ ⟦ ll ⟧ × (term → term)}}
(Tₗₗ , Tᵤ)
(λ t T → inj₂ $ rewrite-mk-phi x eq T (subst Γ t₂ x t) , id)
(λ Tᵤ _ → inj₂ $ post-rewrite (ctxt-var-decl x Γ) x eq t₂ Tᵤ ,
Rho eq x Tᵤ)
(λ k _ → inj₂ $ subst Γ t₂ x k , id)
T) err $ uncurry λ T' fₜ →
put (inj₂ $ ts-tag Γ $ erase T') >>
await-with (record this {T = T'; Tᵤ = rope-to-string $ ts2.to-string Γ $ erase T'; f = f ∘ fₜ; undo = this :: undo; redo = []})
("normalize" :: fm :: to :: norm :: lc) →
either-else'
(let Γ' = merge-lcis-ctxt Γ lc in
string-to-ℕ - fm ! "natural number" >>parse λ fm →
string-to-ℕ - to ! "natural number" >>parse λ to →
let tₛ = substring Tᵤ fm to in
parse-try Γ' - tₛ ! ttk >>parse λ t → t λ ll t →
parse-norm ff - norm ! parse-norm-err >>parse λ norm →
let s = norm Γ' $ elab-untyped-no-params Γ' t
rs = rope-to-string $ [[ "(" ]] ⊹⊹ ts2.to-string Γ' s ⊹⊹ [[ ")" ]]
Tᵤ' = replace Tᵤ rs fm to in
parse-string Tₗₗ - Tᵤ' ! ll-ind "term" "type" "kind" Tₗₗ >>parse λ Tᵤ' →
let Tᵤ' = elab-untyped-no-params Γ' Tᵤ' in
inj₂ Tᵤ')
err λ Tᵤ' →
put (inj₂ $ ts-tag Γ Tᵤ') >>
await-with (record this {T = Tᵤ' {-Checks?-}; Tᵤ = rope-to-string $ ts2.to-string Γ $ erase Tᵤ'; undo = this :: undo; redo = []})
("conv" :: ll :: fm :: to :: t' :: ls) →
let Γ' = merge-lcis-ctxt Γ ls in
either-else'
(parse-ll - ll ! "language level" >>parse λ ll →
string-to-ℕ - fm ! "natural number" >>parse λ fm →
string-to-ℕ - to ! "natural number" >>parse λ to →
let t = substring Tᵤ fm to in
parse-string ll - t ! ll-ind "term" "type" "kind" ll >>parse λ t →
parse-string ll - t' ! ll-ind "term" "type" "kind" ll >>parse λ t' →
let t = elab-untyped-no-params Γ' t; t' = elab-untyped-no-params Γ' t' in
err⊎-guard (~ ll-ind {λ ll → ctxt → ⟦ ll ⟧ → ⟦ ll ⟧ → 𝔹}
conv-term conv-type conv-kind ll Γ' t t') "Inconvertible" >>
let rs = [[ "(" ]] ⊹⊹ ts2.to-string Γ' (erase t') ⊹⊹ [[ ")" ]]
Tᵤ = replace Tᵤ (rope-to-string rs) fm to in
parse-string Tₗₗ - Tᵤ ! ll-ind "term" "type" "kind" Tₗₗ >>parse λ Tᵤ →
inj₂ (elab-untyped-no-params Γ Tᵤ)) err λ Tᵤ' →
put (inj₂ $ ts-tag Γ $ erase Tᵤ') >>
await-with (record this {Tᵤ = rope-to-string $ ts2.to-string Γ $ erase Tᵤ'; undo = this :: undo; redo = []})
("bind" :: xᵤ :: []) →
let Γₚᵢ = ℕ-to-string (length Γₗ) in
either-else'
(ll-ind' {λ {(ll , _) → string ⊎ ctxt × erased? × tpkd × ⟦ ll ⟧ × (term → term)}} (Tₗₗ , T)
(λ t' →
let R = string ⊎ ctxt × erased? × tpkd × term × (term → term) in
(case_of_ {B = (erased? → var → maybe tpkd → term → R) → R}
(t' , hnf Γ unfold-head t') $ uncurry λ where
(Lam me x oc body) _ f → f me x oc body
_ (Lam me x oc body) f → f me x oc body
_ _ _ → inj₁ "Not a term abstraction") λ me x oc body →
inj₂ $ ctxt-var-decl-loc Γₚᵢ xᵤ Γ ,
me ,
maybe-else' oc (Tkt $ TpHole pi-gen) id ,
rename-var (ctxt-var-decl-loc Γₚᵢ xᵤ Γ) x xᵤ body ,
Lam me xᵤ oc)
(λ T → Γ ⊢ T =β= λ where
(TpAbs me x dom cod) →
let Γ' = ctxt-tk-decl Γₚᵢ xᵤ dom Γ in
inj₂ $ Γ' ,
me ,
dom ,
rename-var Γ' x (Γₚᵢ % xᵤ) cod ,
Lam me xᵤ (just dom)
_ → inj₁ "Not a type abstraction")
(λ k → inj₁ "Expression must be a term or a type"))
err λ where
(Γ' , me , dom , cod , fₜ) →
let tv = binder-data Γ' Γₚᵢ xᵤ dom me nothing "0" "0" in
-- putJson (json-object [ "value" , json-array (json-array (json-rope (fst (snd tv)) :: json-rope (to-string Γ' $ erase cod) :: []) :: []) ]) >>
putJson (json-object [ "value" , json-array [ json-rope (to-string Γ' $ erase cod) ] ]) >>
await-with (record this
{Γ = Γ' ;
T = cod;
Tᵤ = rope-to-string $ ts2.to-string Γ' $ erase cod;
f = f ∘ fₜ;
Γₗ = Γₗ ++ [ tv ];
undo = this :: undo;
redo = []})
("case" :: scrutinee :: rec :: motive?) → -- TODO: Motive?
let Γₚᵢ = ℕ-to-string (length Γₗ) in
either-else'
(parse-string TERM - scrutinee ! "term" >>parse λ scrutinee →
elim-pair (id-out (check-term Γ scrutinee nothing empty-spans)) $ uncurry λ tₛ Tₛ ss →
if (spans-have-error ss) then inj₁ "Error synthesizing a type from the input term"
else
let Tₛ = hnf Γ unfold-no-defs Tₛ in
case decompose-ctr-type Γ Tₛ of λ where
(TpVar Xₛ , [] , as) →
ll-ind' {λ T → string ⊎ (term × term × 𝕃 (ctr × type) × type × ctxt × 𝕃 tagged-val × datatype-info)} (Tₗₗ , T)
(λ t → inj₁ "Expression must be a type to case split")
(λ T → maybe-else' (data-lookup Γ Xₛ as)
(inj₁ "The synthesized type of the input term is not a datatype")
λ d → let mk-data-info X _ asₚ asᵢ ps kᵢ k cs csₚₛ _ _ = d
is' = kind-to-indices (add-params-to-ctxt ps Γ) kᵢ
is = drop-last 1 is'
Tₘ = refine-motive Γ is' (asᵢ ++ [ Ttm tₛ ]) T
sM' = ctxt-mu-decls Γ tₛ is Tₘ d Γₚᵢ "0" "0" rec
σ = λ y → inst-ctrs Γ ps asₚ (map-snd (rename-var {TYPE} Γ X y) <$> cs)
sM = if rec =string ""
then (σ X , const spanMok , Γ , [] , empty-renamectxt , (λ Γ t T → t) , (λ Γ T k → T))
else (σ (Γₚᵢ % mu-Type/ rec) , sM')
mu = sigma-build-evidence Xₛ d in
case sM of λ where
(σ-cs , _ , Γ' , ts , ρ , tf , Tf) →
if spans-have-error (snd $ id-out $
check-type (qualified-ctxt Γ) (resugar Tₘ) (just kᵢ) empty-spans)
then inj₁ "Computed an ill-typed motive"
else inj₂ (
tₛ ,
mu ,
map (λ {(Ctr x T) →
let T' = hnf Γ' unfold-head-elab T in
Ctr x T ,
(case decompose-ctr-type Γ' T' of λ {(Tₕ , ps' , as) →
params-to-alls ps' $ hnf Γ' unfold-head-no-defs (TpApp
(recompose-tpapps (drop (length ps) as) Tₘ)
(Ttm (recompose-apps (params-to-args ps') $
recompose-apps asₚ (Var x))))})})
σ-cs ,
Tₘ ,
Γ' ,
ts ,
d))
(λ k → inj₁ "Expression must be a type to case split")
(Tₕ , [] , as) → inj₁ "Synthesized a non-datatype from the input term"
(Tₕ , ps , as) →
inj₁ "Case splitting is currently restricted to datatypes")
err $ λ where
(scrutinee , mu , cs , Tₘ , Γ , ts , d) →
let json = json-object [ "value" , json-array
[ json-object (map
(λ {(Ctr x _ , T) → unqual-all (ctxt.qual Γ) x ,
json-rope (to-string Γ (erase T))})
cs) ] ] in -- ) ] ] in
putJson json >>
let shallow = iszero (string-length rec)
mk-cs = map λ where
(Ctr x T , t) →
let T' = hnf Γ unfold-head-elab T in
case decompose-ctr-type Γ T' of λ where
(Tₕ , ps , as) →
elim-pair (make-case Γ ps t) λ cas t → Case x cas t []
f'' = λ t cs → (if shallow then Mu rec else Sigma (just mu)) t (just Tₘ) d (mk-cs cs)
f' = λ t cs → f (f'' t cs) cs
mk-hs = map $ map-snd λ T'' →
mk-br-history Γ t TYPE T''
(rope-to-string $ to-string Γ $ erase T'')
(λ t cs → t) (Γₗ ++ ts) [] [] in
await (write-children path (mk-hs cs) $
write-history path (record this
{f = f';
Γ = Γ;
t = scrutinee;
Γₗ = Γₗ ++ ts;-- TODO: Should we really do this?
undo = this :: undo;
redo = []})
his)
("print" :: tab :: []) →
either-else' (string-to-ℕ - tab ! "natural number" >>parse inj₂) err λ tab →
putRopeLn (escape-rope (json-to-rope (tv-to-json (inj₂ $ pretty2s.strRunTag "" Γ $ pretty2s.strNest (suc {-left paren-} tab) (pretty2s.to-stringh $ outline his))))) >> await his
("quit" :: []) → put $ inj₂ $ strRunTag "" Γ $ strAdd "Quitting beta-reduction mode..."
_ → err $ foldl (λ a s → s ^ char-to-string delimiter ^ a)
"Unknown beta-reduction command: " as
_ → err "A beta-reduction buffer is still open"
interactive-cmd : 𝕃 string → toplevel-state → IO ⊤
interactive-cmd ("br2" :: T :: t :: sp :: lc) ts = br-cmd2 (toplevel-state.Γ ts) T t sp lc
--interactive-cmd ("pretty" :: src :: dest :: []) ts = pretty-cmd src dest >>= putStrLn
interactive-cmd ls ts = putRopeLn (json-to-rope (tv-to-json (interactive-cmd-h (toplevel-state.Γ ts) ls)))
interactive-not-br-cmd-msg = tv-to-json $ inj₁ "Beta-reduction mode has been terminated"
|
libsrc/_DEVELOPMENT/temp/sp1/zx/c/sccz80/sp1_MoveSprAbs_callee.asm | jpoikela/z88dk | 640 | 305 | <reponame>jpoikela/z88dk<gh_stars>100-1000
; void __CALLEE__ sp1_MoveSprAbs_callee(struct sp1_ss *s, struct sp1_Rect *clip, uchar *frame, uchar row, uchar col, uchar vrot, uchar hrot)
; 04.2006 aralbrec, Sprite Pack v3.0
; sinclair zx version
SECTION code_clib
SECTION code_temp_sp1
PUBLIC sp1_MoveSprAbs_callee
EXTERN asm_sp1_MoveSprAbs
sp1_MoveSprAbs_callee:
pop af
pop de
pop bc
ld b,e
pop de
pop hl
ld d,l
pop hl
pop iy
pop ix
push af
jp asm_sp1_MoveSprAbs
|
grammar/Graphql.g4 | emajcher/gq | 0 | 903 | /*
Derived from the GraphQL-Java implementation, according to MIT license.
The MIT License (MIT)
Copyright (c) 2015 <NAME> and Contributors
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.
*/
grammar Graphql;
/* Common */
operationType : SUBSCRIPTION | MUTATION | QUERY;
enumValue : name ;
arrayValue: '[' value* ']';
arrayValueWithVariable: '[' valueWithVariable* ']';
objectValue: '{' objectField* '}';
objectValueWithVariable: '{' objectFieldWithVariable* '}';
objectField : name ':' value;
objectFieldWithVariable : name ':' valueWithVariable;
directives : directive+;
directive :'@' name arguments?;
arguments : '(' argument+ ')';
argument : name ':' valueWithVariable;
name: NAME | FRAGMENT | QUERY | MUTATION | SUBSCRIPTION | SCHEMA | SCALAR | TYPE | INTERFACE | IMPLEMENTS | ENUM | UNION | INPUT | EXTEND | DIRECTIVE;
value :
stringValue |
IntValue |
FloatValue |
BooleanValue |
NullValue |
enumValue |
arrayValue |
objectValue;
valueWithVariable :
variable |
stringValue |
IntValue |
FloatValue |
BooleanValue |
NullValue |
enumValue |
arrayValueWithVariable |
objectValueWithVariable;
variable : '$' name;
defaultValue : '=' value;
stringValue
: TripleQuotedStringValue
| StringValue
;
gqlType : typeName | listType | nonNullType;
typeName : name;
listType : '[' gqlType ']';
nonNullType: typeName '!' | listType '!';
BooleanValue: 'true' | 'false';
NullValue: 'null';
FRAGMENT: 'fragment';
QUERY: 'query';
MUTATION: 'mutation';
SUBSCRIPTION: 'subscription';
SCHEMA: 'schema';
SCALAR: 'scalar';
TYPE: 'type';
INTERFACE: 'interface';
IMPLEMENTS: 'implements';
ENUM: 'enum';
UNION: 'union';
INPUT: 'input';
EXTEND: 'extend';
DIRECTIVE: 'directive';
NAME: [_A-Za-z][_0-9A-Za-z]*;
IntValue : Sign? IntegerPart;
FloatValue : Sign? IntegerPart ('.' Digit+)? ExponentPart?;
Sign : '-';
IntegerPart : '0' | NonZeroDigit | NonZeroDigit Digit+;
NonZeroDigit: '1'.. '9';
ExponentPart : ('e'|'E') Sign? Digit+;
Digit : '0'..'9';
StringValue
: '"' ( ~["\\\n\r\u2028\u2029] | EscapedChar )* '"'
;
TripleQuotedStringValue
: '"""' TripleQuotedStringPart? '"""'
;
// Fragments never become a token of their own: they are only used inside other lexer rules
fragment TripleQuotedStringPart : ( EscapedTripleQuote | SourceCharacter )+?;
fragment EscapedTripleQuote : '\\"""';
fragment SourceCharacter :[\u0009\u000A\u000D\u0020-\uFFFF];
Comment: '#' ~[\n\r\u2028\u2029]* -> channel(2);
Ignored: (UnicodeBOM|Whitespace|LineTerminator|Comma) -> skip;
fragment EscapedChar : '\\' (["\\/bfnrt] | Unicode) ;
fragment Unicode : 'u' Hex Hex Hex Hex ;
fragment Hex : [0-9a-fA-F] ;
fragment LineTerminator: [\n\r\u2028\u2029];
fragment Whitespace : [\u0009\u0020];
fragment Comma : ',';
fragment UnicodeBOM : [\ufeff];
/* Operation */
operationDefinition:
selectionSet |
operationType name? variableDefinitions? directives? selectionSet;
variableDefinitions : '(' variableDefinition+ ')';
variableDefinition : variable ':' gqlType defaultValue?;
selectionSet : '{' selection+ '}';
selection :
field |
fragmentSpread |
inlineFragment;
field : alias? name arguments? directives? selectionSet?;
alias : name ':';
fragmentSpread : '...' fragmentName directives?;
inlineFragment : '...' typeCondition? directives? selectionSet;
fragmentDefinition : 'fragment' fragmentName typeCondition directives? selectionSet;
fragmentName : name;
typeCondition : 'on' typeName;
/* Document */
document : (operationDefinition | fragmentDefinition)+;
/* Schema */
description : stringValue;
typeSystemDefinition: description?
schemaDefinition |
typeDefinition |
typeExtension |
directiveDefinition
;
schemaDefinition : description? SCHEMA directives? '{' operationTypeDefinition+ '}';
operationTypeDefinition : description? operationType ':' typeName;
typeDefinition:
scalarTypeDefinition |
objectTypeDefinition |
interfaceTypeDefinition |
unionTypeDefinition |
enumTypeDefinition |
inputObjectTypeDefinition
;
//
// type extensions dont get "description" strings according to spec
// https://github.com/facebook/graphql/blob/master/spec/Appendix%20B%20--%20Grammar%20Summary.md
//
typeExtension :
objectTypeExtensionDefinition |
interfaceTypeExtensionDefinition |
unionTypeExtensionDefinition |
scalarTypeExtensionDefinition |
enumTypeExtensionDefinition |
inputObjectTypeExtensionDefinition
;
scalarTypeDefinition : description? SCALAR name directives?;
scalarTypeExtensionDefinition : EXTEND SCALAR name directives?;
objectTypeDefinition : description? TYPE name implementsInterfaces? directives? fieldsDefinition?;
objectTypeExtensionDefinition : EXTEND TYPE name implementsInterfaces? directives? fieldsDefinition?;
implementsInterfaces :
IMPLEMENTS '&'? typeName+ |
implementsInterfaces '&' typeName ;
fieldsDefinition : '{' fieldDefinition* '}';
fieldDefinition : description? name argumentsDefinition? ':' gqlType directives?;
argumentsDefinition : '(' inputValueDefinition+ ')';
inputValueDefinition : description? name ':' gqlType defaultValue? directives?;
interfaceTypeDefinition : description? INTERFACE name directives? fieldsDefinition?;
interfaceTypeExtensionDefinition : EXTEND INTERFACE name directives? fieldsDefinition?;
unionTypeDefinition : description? UNION name directives? unionMembership;
unionTypeExtensionDefinition : EXTEND UNION name directives? unionMembership?;
unionMembership : '=' unionMembers;
unionMembers:
'|'? typeName |
unionMembers '|' typeName
;
enumTypeDefinition : description? ENUM name directives? enumValueDefinitions;
enumTypeExtensionDefinition : EXTEND ENUM name directives? enumValueDefinitions?;
enumValueDefinitions : '{' enumValueDefinition+ '}';
enumValueDefinition : description? enumValue directives?;
inputObjectTypeDefinition : description? INPUT name directives? inputObjectValueDefinitions;
inputObjectTypeExtensionDefinition : EXTEND INPUT name directives? inputObjectValueDefinitions?;
inputObjectValueDefinitions : '{' inputValueDefinition+ '}';
directiveDefinition : description? DIRECTIVE '@' name argumentsDefinition? 'on' directiveLocations;
directiveLocation : name;
directiveLocations :
directiveLocation |
directiveLocations '|' directiveLocation
;
/* Partial definitions */
partialFieldDefinition :
name argumentsDefinition? ':' gqlType directives? |
argumentsDefinition ':' gqlType directives? |
name argumentsDefinition? directives? |
':' gqlType directives? |
argumentsDefinition |
directives;
partialObjectTypeDefinition :
description? TYPE name implementsInterfaces? directives? fieldsDefinition? |
description? name implementsInterfaces? directives? fieldsDefinition? |
description? implementsInterfaces? directives? fieldsDefinition?;
partialInputObjectTypeDefinition :
description? INPUT name directives? inputObjectValueDefinitions |
description? name directives? inputObjectValueDefinitions |
description? directives? inputObjectValueDefinitions |
description? directives?;
partialInputValueDefinition :
description? name ':' gqlType defaultValue? directives? |
description? name defaultValue? directives? |
description? ':' gqlType defaultValue? directives?;
partialEnumTypeDefinition :
description? ENUM name directives? enumValueDefinitions |
description? name directives? enumValueDefinitions |
description? directives? enumValueDefinitions;
partialInterfaceTypeDefinition :
description? INTERFACE name directives? fieldsDefinition |
description? name directives? fieldsDefinition |
description? directives? fieldsDefinition;
partialUnionTypeDefinition :
description? UNION name directives? unionMembership |
description? name directives? unionMembership |
description? directives? unionMembership |
description;
partialScalarTypeDefinition : description? name? directives?; |
src/machine_udefault_types_h.ads | JeremyGrosser/arm_cmsis_dsp | 0 | 25830 | <filename>src/machine_udefault_types_h.ads
pragma Ada_2012;
pragma Style_Checks (Off);
pragma Warnings ("U");
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Extensions;
package machine_udefault_types_h is
subtype uu_int8_t is signed_char; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:41
subtype uu_uint8_t is unsigned_char; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:43
subtype uu_int16_t is short; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:55
subtype uu_uint16_t is unsigned_short; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:57
subtype uu_int32_t is long; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:77
subtype uu_uint32_t is unsigned_long; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:79
subtype uu_int64_t is Long_Long_Integer; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:103
subtype uu_uint64_t is Extensions.unsigned_long_long; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:105
subtype uu_int_least8_t is signed_char; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:134
subtype uu_uint_least8_t is unsigned_char; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:136
subtype uu_int_least16_t is short; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:160
subtype uu_uint_least16_t is unsigned_short; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:162
subtype uu_int_least32_t is long; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:182
subtype uu_uint_least32_t is unsigned_long; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:184
subtype uu_int_least64_t is Long_Long_Integer; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:200
subtype uu_uint_least64_t is Extensions.unsigned_long_long; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:202
subtype uu_intmax_t is Long_Long_Integer; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:214
subtype uu_uintmax_t is Extensions.unsigned_long_long; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:222
subtype uu_intptr_t is int; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:230
subtype uu_uintptr_t is unsigned; -- /home/synack/.config/alire/cache/dependencies/gnat_arm_elf_11.2.3_811265cb/arm-eabi/include/machine/_default_types.h:232
end machine_udefault_types_h;
|
oeis/063/A063258.asm | neoneye/loda-programs | 11 | 23862 | <reponame>neoneye/loda-programs
; A063258: a(n) = binomial(n+5,4) - 1.
; 4,14,34,69,125,209,329,494,714,1000,1364,1819,2379,3059,3875,4844,5984,7314,8854,10625,12649,14949,17549,20474,23750,27404,31464,35959,40919,46375,52359,58904,66044,73814,82250,91389,101269,111929,123409,135750,148994,163184,178364,194579,211875,230299,249899,270724,292824,316250,341054,367289,395009,424269,455125,487634,521854,557844,595664,635375,677039,720719,766479,814384,864500,916894,971634,1028789,1088429,1150625,1215449,1282974,1353274,1426424,1502500,1581579,1663739,1749059,1837619
add $0,5
bin $0,4
sub $0,1
|
test/Succeed/DependentInstanceSearch.agda | redfish64/autonomic-agda | 3 | 11055 |
open import Common.Prelude
open import Common.Equality
infixr 5 _∷_
data Vec (A : Set) : Nat → Set where
[] : Vec A zero
_∷_ : ∀ {n} → A → Vec A n → Vec A (suc n)
record Eq (A : Set) : Set where
field
_==_ : (x y : A) → Maybe (x ≡ y)
open Eq {{...}}
data Σ (A : Set) (B : A → Set) : Set where
_,_ : (x : A) → B x → Σ A B
eqNat : ∀ n m → Maybe (n ≡ m)
eqNat zero zero = just refl
eqNat zero (suc m) = nothing
eqNat (suc n) zero = nothing
eqNat (suc n) (suc m) with eqNat n m
eqNat (suc n) (suc m) | nothing = nothing
eqNat (suc n) (suc .n) | just refl = just refl
eqVec : ∀ {A n} {{EqA : Eq A}} (xs ys : Vec A n) → Maybe (xs ≡ ys)
eqVec [] [] = just refl
eqVec (x ∷ xs) ( y ∷ ys) with x == y | eqVec xs ys
eqVec (x ∷ xs) ( y ∷ ys) | nothing | _ = nothing
eqVec (x ∷ xs) ( y ∷ ys) | _ | nothing = nothing
eqVec (x ∷ xs) (.x ∷ .xs) | just refl | just refl = just refl
eqSigma : ∀ {A B} {{EqA : Eq A}} {{EqB : ∀ {x} → Eq (B x)}} (x y : Σ A B) → Maybe (x ≡ y)
eqSigma (x , y) (x₁ , y₁) with x == x₁
eqSigma (x , y) (x₁ , y₁) | nothing = nothing
eqSigma (x , y) (.x , y₁) | just refl with y == y₁
eqSigma (x , y) (.x , y₁) | just refl | nothing = nothing
eqSigma (x , y) (.x , .y) | just refl | just refl = just refl
instance
EqNat : Eq Nat
EqNat = record { _==_ = eqNat }
EqVec : ∀ {A n} {{_ : Eq A}} → Eq (Vec A n)
EqVec = record { _==_ = eqVec }
EqSigma : ∀ {A B} {{_ : Eq A}} {{_ : ∀ {x} → Eq (B x)}} → Eq (Σ A B)
EqSigma = record { _==_ = eqSigma }
cmpSigma : (xs ys : Σ Nat (Vec Nat)) → Maybe (xs ≡ ys)
cmpSigma xs ys = xs == ys
|
opengl/src/implementation/gl-fixed-textures.adb | Cre8or/OpenGLAda | 79 | 20697 | <reponame>Cre8or/OpenGLAda<filename>opengl/src/implementation/gl-fixed-textures.adb
-- part of OpenGLAda, (c) 2017 <NAME>
-- released under the terms of the MIT license, see the file "COPYING"
with GL.Enums.Textures;
with GL.Helpers;
with GL.API;
package body GL.Fixed.Textures is
procedure Set_Tex_Function (Func : Texture_Function) is
begin
API.Tex_Env_Tex_Func (Enums.Textures.Texture_Env, Enums.Textures.Env_Mode,
Func);
Raise_Exception_On_OpenGL_Error;
end Set_Tex_Function;
function Tex_Function return Texture_Function is
Ret : Texture_Function := Texture_Function'Val (0);
begin
API.Get_Tex_Env_Tex_Func (Enums.Textures.Texture_Env, Enums.Textures.Env_Mode,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Tex_Function;
procedure Set_RGB_Combine (Func : Combine_Function) is
begin
API.Tex_Env_Combine_Func (Enums.Textures.Texture_Env, Enums.Textures.Combine_RGB,
Func);
Raise_Exception_On_OpenGL_Error;
end Set_RGB_Combine;
function RGB_Combine return Combine_Function is
Ret : Combine_Function := Combine_Function'Val (0);
begin
API.Get_Tex_Env_Combine_Func (Enums.Textures.Texture_Env,
Enums.Textures.Combine_RGB, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end RGB_Combine;
procedure Set_Alpha_Combine (Func : Alpha_Combine_Function) is
begin
API.Tex_Env_Combine_Func (Enums.Textures.Texture_Env,
Enums.Textures.Combine_Alpha, Func);
Raise_Exception_On_OpenGL_Error;
end Set_Alpha_Combine;
function Alpha_Combine return Alpha_Combine_Function is
Ret : Combine_Function := Combine_Function'Val (0);
begin
API.Get_Tex_Env_Combine_Func (Enums.Textures.Texture_Env,
Enums.Textures.Combine_Alpha, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Alpha_Combine;
procedure Set_RGB_Source (Source : Source_Kind; Index : Source_Index) is
Param : Enums.Textures.Env_Parameter;
begin
case Index is
when 0 => Param := Enums.Textures.Src0_RGB;
when 1 => Param := Enums.Textures.Src1_RGB;
when 2 => Param := Enums.Textures.Src2_RGB;
end case;
API.Tex_Env_Source (Enums.Textures.Texture_Env, Param, Source);
Raise_Exception_On_OpenGL_Error;
end Set_RGB_Source;
function RGB_Source (Index : Source_Index) return Source_Kind is
Param : Enums.Textures.Env_Parameter;
Ret : Source_Kind := Source_Kind'Val (0);
begin
case Index is
when 0 => Param := Enums.Textures.Src0_RGB;
when 1 => Param := Enums.Textures.Src1_RGB;
when 2 => Param := Enums.Textures.Src2_RGB;
end case;
API.Get_Tex_Env_Source (Enums.Textures.Texture_Env, Param, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end RGB_Source;
procedure Set_Alpha_Source (Source : Source_Kind; Index : Source_Index) is
Param : Enums.Textures.Env_Parameter;
begin
case Index is
when 0 => Param := Enums.Textures.Src0_Alpha;
when 1 => Param := Enums.Textures.Src1_Alpha;
when 2 => Param := Enums.Textures.Src2_Alpha;
end case;
API.Tex_Env_Source (Enums.Textures.Texture_Env, Param, Source);
Raise_Exception_On_OpenGL_Error;
end Set_Alpha_Source;
function Alpha_Source (Index : Source_Index) return Source_Kind is
Param : Enums.Textures.Env_Parameter;
Ret : Source_Kind := Source_Kind'Val (0);
begin
case Index is
when 0 => Param := Enums.Textures.Src0_Alpha;
when 1 => Param := Enums.Textures.Src1_Alpha;
when 2 => Param := Enums.Textures.Src2_Alpha;
end case;
API.Get_Tex_Env_Source (Enums.Textures.Texture_Env, Param, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Alpha_Source;
procedure Set_RGB_Scale (Value : Scaling_Factor) is
begin
API.Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.RGB_Scale, Single (Value));
Raise_Exception_On_OpenGL_Error;
end Set_RGB_Scale;
function RGB_Scale return Scaling_Factor is
Ret : Single := 0.0;
begin
API.Get_Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.RGB_Scale, Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end RGB_Scale;
procedure Set_Alpha_Scale (Value : Scaling_Factor) is
begin
API.Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.Alpha_Scale, Single (Value));
Raise_Exception_On_OpenGL_Error;
end Set_Alpha_Scale;
function Alpha_Scale return Scaling_Factor is
Ret : Single := 0.0;
begin
API.Get_Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.Alpha_Scale, Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end Alpha_Scale;
procedure Set_LoD_Bias (Value : Double) is
begin
API.Tex_Env_Float (Enums.Textures.Filter_Control,
Enums.Textures.LoD_Bias, Single (Value));
Raise_Exception_On_OpenGL_Error;
end Set_LoD_Bias;
function LoD_Bias return Double is
Ret : Single := 0.0;
begin
API.Get_Tex_Env_Float (Enums.Textures.Filter_Control,
Enums.Textures.LoD_Bias, Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end LoD_Bias;
procedure Set_Env_Color (Value : Colors.Color) is
Float_Colors : constant Single_Array
:= Helpers.Float_Array (Value);
begin
API.Tex_Env_Arr (Enums.Textures.Texture_Env,
Enums.Textures.Env_Color, Float_Colors);
Raise_Exception_On_OpenGL_Error;
end Set_Env_Color;
function Env_Color return Colors.Color is
Ret : Single_Array (1 .. 4);
begin
API.Get_Tex_Env_Arr (Enums.Textures.Texture_Env,
Enums.Textures.Env_Color, Ret);
Raise_Exception_On_OpenGL_Error;
return Helpers.Color (Ret);
end Env_Color;
procedure Toggle_Point_Sprite_Coord_Replace (Enabled : Boolean) is
begin
API.Tex_Env_Bool (Enums.Textures.Point_Sprite,
Enums.Textures.Coord_Replace, Low_Level.Bool (Enabled));
Raise_Exception_On_OpenGL_Error;
end Toggle_Point_Sprite_Coord_Replace;
function Point_Sprite_Coord_Replace return Boolean is
Ret : Low_Level.Bool := Low_Level.False;
begin
API.Get_Tex_Env_Bool (Enums.Textures.Point_Sprite,
Enums.Textures.Coord_Replace, Ret);
Raise_Exception_On_OpenGL_Error;
return Boolean (Ret);
end Point_Sprite_Coord_Replace;
end GL.Fixed.Textures;
|
Transynther/x86/_processed/AVXALIGN/_st_/i3-7100_9_0x84_notsx.log_21829_499.asm | ljhsiun2/medusa | 9 | 13851 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r13
push %r15
push %r8
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_UC_ht+0x3b66, %r13
nop
dec %r11
mov (%r13), %r8d
nop
nop
cmp %r10, %r10
lea addresses_D_ht+0x1878e, %r15
nop
cmp %rax, %rax
mov $0x6162636465666768, %rbx
movq %rbx, %xmm6
movups %xmm6, (%r15)
nop
nop
cmp $61113, %r10
lea addresses_D_ht+0x59b6, %rsi
lea addresses_A_ht+0x124f6, %rdi
clflush (%rsi)
nop
nop
inc %rax
mov $30, %rcx
rep movsw
nop
nop
nop
sub $38800, %rcx
lea addresses_D_ht+0x1cfa6, %rsi
lea addresses_WC_ht+0x1791e, %rdi
nop
nop
nop
nop
add $13718, %rax
mov $86, %rcx
rep movsq
nop
nop
xor $17482, %r15
lea addresses_WT_ht+0x1bc26, %rcx
nop
cmp $62796, %rbx
mov $0x6162636465666768, %r13
movq %r13, %xmm3
vmovups %ymm3, (%rcx)
nop
nop
nop
inc %r13
lea addresses_WC_ht+0x30a6, %r13
nop
nop
inc %r10
mov $0x6162636465666768, %rax
movq %rax, (%r13)
nop
nop
inc %r8
lea addresses_UC_ht+0x30a6, %rbx
nop
nop
nop
nop
nop
and $44565, %r15
mov (%rbx), %r10
nop
nop
nop
nop
nop
add %r11, %r11
lea addresses_A_ht+0x1d436, %rcx
nop
nop
nop
sub %rsi, %rsi
movl $0x61626364, (%rcx)
nop
nop
nop
cmp $29918, %rbx
lea addresses_A_ht+0x40a6, %r13
nop
nop
nop
nop
nop
and %rax, %rax
mov $0x6162636465666768, %rbx
movq %rbx, %xmm3
movups %xmm3, (%r13)
nop
nop
nop
nop
nop
sub $51794, %rsi
lea addresses_WT_ht+0x970b, %rcx
nop
nop
nop
nop
inc %rsi
movb (%rcx), %r11b
nop
nop
nop
cmp $16090, %rbx
lea addresses_WT_ht+0x18ca6, %rsi
lea addresses_WT_ht+0x6fe6, %rdi
clflush (%rsi)
nop
nop
inc %rax
mov $9, %rcx
rep movsq
and %r10, %r10
lea addresses_normal_ht+0x118a6, %rcx
nop
cmp $55713, %rdi
vmovups (%rcx), %ymm3
vextracti128 $0, %ymm3, %xmm3
vpextrq $1, %xmm3, %rax
nop
nop
nop
add %r11, %r11
lea addresses_normal_ht+0x178a6, %r8
dec %rbx
movups (%r8), %xmm3
vpextrq $0, %xmm3, %rsi
nop
nop
cmp $54983, %r15
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rax
pop %r8
pop %r15
pop %r13
pop %r11
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r8
push %r9
push %rax
// Faulty Load
lea addresses_A+0x170a6, %r12
nop
sub $8020, %rax
movb (%r12), %r8b
lea oracles, %r9
and $0xff, %r8
shlq $12, %r8
mov (%r9,%r8,1), %r8
pop %rax
pop %r9
pop %r8
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_A', 'same': False, 'size': 2, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'type': 'addresses_A', 'same': True, 'size': 1, 'congruent': 0, 'NT': True, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 4, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 16, 'congruent': 2, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_D_ht', 'congruent': 3, 'same': False}, 'dst': {'type': 'addresses_A_ht', 'congruent': 2, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_D_ht', 'congruent': 8, 'same': False}, 'dst': {'type': 'addresses_WC_ht', 'congruent': 3, 'same': False}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 32, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WC_ht', 'same': False, 'size': 8, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_UC_ht', 'same': True, 'size': 8, 'congruent': 10, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_A_ht', 'same': False, 'size': 4, 'congruent': 2, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_A_ht', 'same': False, 'size': 16, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_WT_ht', 'same': False, 'size': 1, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WT_ht', 'congruent': 10, 'same': False}, 'dst': {'type': 'addresses_WT_ht', 'congruent': 4, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_normal_ht', 'same': False, 'size': 32, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_normal_ht', 'same': True, 'size': 16, 'congruent': 10, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'35': 21829}
35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35
*/
|
asg/asm/rdrand.asm | asgkafka/librdkafka | 0 | 20476 | <reponame>asgkafka/librdkafka<filename>asg/asm/rdrand.asm
*PROCESS DUPALIAS
*
* Compiled by DCC Version 2.25.07 Mar 6 2021 08:51:07
* on Fri Apr 30 15:36:21 2021
*
WXTRN @@ZARCH#
*
*
*
* Code Section
*
@CODE ALIAS C'@RDRAND'
@CODE CSECT
@CODE AMODE ANY
@CODE RMODE ANY
@DATA ALIAS C'@rdrand'
rand_r ALIAS X'998195846D99'
EXTRN rand_r
gettimeofday ALIAS C'GETTFD@Y'
EXTRN gettimeofday
thrd_current ALIAS X'A38899846D83A499998595A3'
EXTRN thrd_current
*
*
*
* ....... start of rd_jitter
rd_jitter ALIAS X'99846D9189A3A38599'
@LNAME759 DS 0H
DC X'00000009'
DC C'rd_jitter'
DC X'00'
rd_jitter DCCPRLG CINDEX=759,BASER=12,FRAME=200,ENTRY=YES,ARCH=ZARCH,LN*
AMEADDR=@LNAME759
DCCPRV REG=15 ; Get PRV from DVT
LGR 2,1 ; ptr to parm area
* ******* End of Prologue
* *
* *** int rand_num;
* ***
* *** static unsigned int seed = 0;
* ***
* ***
* *** if (((seed == 0))) {
LGF 1,@lit_759_0
LA 3,0(1,15)
CLFHSI 540(3),0
BNE @L65
* *** struct timeval tv;
* *** gettimeofday(&tv,((void *)0));
LA 15,168(0,13)
STG 15,184(0,13)
XC 192(8,13),192(13)
LA 1,184(0,13)
LG 15,@lit_759_1 ; gettimeofday
@@gen_label1 DS 0H
BALR 14,15
@@gen_label2 DS 0H
* *** seed = (unsigned int)(tv.tv_usec / 1000);
LG 5,176(0,13) ; offset of tv_usec in timeval
DSGF 4,@lit_759_2
ST 5,540(0,3) ; seed
* *** seed ^= (unsigned int)(intptr_t)thrd_current();
LG 15,@lit_759_3 ; thrd_current
@@gen_label3 DS 0H
BALR 14,15
@@gen_label4 DS 0H
XR 5,15
ST 5,540(0,3) ; seed
* *** }
@L65 DS 0H
* ***
* *** rand_num = rand_r(&seed);
LA 15,540(0,3)
STG 15,184(0,13)
LA 1,184(0,13)
LG 15,@lit_759_4 ; rand_r
@@gen_label5 DS 0H
BALR 14,15
@@gen_label6 DS 0H
* ***
* ***
* ***
* *** return (low + (rand_num % ((high-low)+1)));
L 1,12(0,2) ; high
S 1,4(0,2)
AHI 1,1
LR 4,15
SRDA 4,32(0)
DR 4,1
A 4,4(0,2)
LGFR 15,4
* *** }
* * **** Start of Epilogue
DCCEPIL
* * **** End of Epilogue
DS 0D
@FRAMESIZE_759 DC F'200'
@lit_759_0 DC Q(@@STATIC)
@lit_759_1 DC AD(gettimeofday)
@lit_759_3 DC AD(thrd_current)
@lit_759_2 DC F'1000' 0x000003e8
@lit_759_4 DC AD(rand_r)
DROP 12
*
* DSECT for automatic variables in "rd_jitter"
* (FUNCTION #759)
*
@AUTO#rd_jitter DSECT
DS XL168
rd_jitter#tv#1 DS 16XL1 ; tv
ORG @AUTO#rd_jitter+168
rd_jitter#rand_num#0 DS 1F ; rand_num
*
@CODE CSECT
*
*
*
* ....... start of rd_array_shuffle
rd_array_shuffle ALIAS X'99846D81999981A86DA288A486869385'
@LNAME760 DS 0H
DC X'00000010'
DC C'rd_array_shuffle'
DC X'00'
rd_array_shuffle DCCPRLG CINDEX=760,BASER=12,FRAME=192,ENTRY=YES,ARCH=Z*
ARCH,LNAMEADDR=@LNAME760
LGR 2,1 ; ptr to parm area
* ******* End of Prologue
* *
LG 3,0(0,2) ; base
LG 4,16(0,2) ; entry_size
* *** int i;
* *** void *tmp = __builtin_alloca(entry_size);
STG 4,176(0,13)
LA 1,176(0,13)
LG 15,@lit_760_6 ; @@ALLOCA
@@gen_label7 DS 0H
BALR 14,15
@@gen_label8 DS 0H
LGR 5,15
* ***
* ***
* ***
* *** for (i = (int) nmemb - 1 ; i > 0 ; i--) {
LG 2,8(0,2) ; nmemb
AHI 2,-1
B @L67
DS 0D
@FRAMESIZE_760 DC F'192'
@lit_760_6 DC AD(@@ALLOCA)
@lit_760_7 DC AD(rd_jitter)
@lit_760_8 MVC 0(1,7),0(6)
@lit_760_10 MVC 0(1,6),0(1)
@L66 DS 0H
* *** int j = rd_jitter(0, i);
XC 176(8,13),176(13)
LGFR 15,2
STG 15,184(0,13)
LA 1,176(0,13)
LG 15,@lit_760_7 ; rd_jitter
@@gen_label9 DS 0H
BALR 14,15
@@gen_label10 DS 0H
* *** if (((i == j)))
CR 2,15
BE @L69
* *** continue;
@L70 DS 0H
* ***
* *** __memcpy(tmp,(char *)base + (i*entry_size),entry_size);
LGFR 1,2
MSGR 1,4
LA 6,0(1,3)
LGR 7,5
LTGR 1,4
BZ @@gen_label14
AGHI 1,-1
SRAG 8,1,8(0)
LTGR 8,8
BZ @@gen_label13
@@gen_label12 DS 0H
MVC 0(256,7),0(6)
LA 7,256(0,7)
LA 6,256(0,6)
BCTG 8,@@gen_label12
@@gen_label13 DS 0H
EX 1,@lit_760_8
@@gen_label14 DS 0H
* *** __memcpy((char *)base+(i*entry_size),(char *)base+(j*ent\
* ry_size),entry_size);
LGFR 1,2
MSGR 1,4
LGFR 6,15
MSGR 6,4
LA 6,0(6,3)
LA 7,0(1,3)
LTGR 1,4
BZ @@gen_label17
AGHI 1,-1
SRAG 8,1,8(0)
LTGR 8,8
BZ @@gen_label16
@@gen_label15 DS 0H
MVC 0(256,7),0(6)
LA 7,256(0,7)
LA 6,256(0,6)
BCTG 8,@@gen_label15
@@gen_label16 DS 0H
EX 1,@lit_760_8
@@gen_label17 DS 0H
* ***
* *** __memcpy((char *)base+(j*entry_size),tmp,entry_size);
LGFR 15,15
MSGR 15,4
LGR 1,5
LA 6,0(15,3)
LTGR 15,4
BZ @@gen_label20
AGHI 15,-1
SRAG 7,15,8(0)
LTGR 7,7
BZ @@gen_label19
@@gen_label18 DS 0H
MVC 0(256,6),0(1)
LA 6,256(0,6)
LA 1,256(0,1)
BCTG 7,@@gen_label18
@@gen_label19 DS 0H
EX 15,@lit_760_10
@@gen_label20 DS 0H
* *** }
@L69 DS 0H
AHI 2,-1
@L67 DS 0H
LTR 2,2
BH @L66
* *** }
@ret_lab_760 DS 0H
* * **** Start of Epilogue
DCCEPIL
* * **** End of Epilogue
DROP 12
*
* DSECT for automatic variables in "rd_array_shuffle"
* (FUNCTION #760)
*
@AUTO#rd_array_shuffle DSECT
DS XL168
rd_array_shuffle#j#1 DS 1F ; j
ORG @AUTO#rd_array_shuffle+168
rd_array_shuffle#i#0 DS 1F ; i
*
@CODE CSECT
@@STATIC ALIAS X'7C99849981958450'
@@STATIC DXD 68D
*
* Non-Re-Entrant Data Section
*
@DATA CSECT
@DATA RMODE ANY
@DATA AMODE ANY
@@T349 DC X'99846D838193939683' rd.calloc
DC 1X'00'
@@T34D DC X'99846D948193939683' rd.malloc
DC 1X'00'
@@T352 DC X'99846D99858193939683' rd.realloc
DC 2X'00'
@@T358 DC X'99846DA2A39984A497' rd.strdup
DC 1X'00'
@@T35D DC X'99846DA2A3999584A497' rd.strndup
DC 2X'00'
@@T365 DC X'99846D9985868395A36DA2A482F0' rd.refcnt.sub0
DC 1X'00'
*
*
* Re-entrant Data Initialization Section
*
@@INIT@ ALIAS C'@rdrand:'
@@INIT@ CSECT
@@INIT@ AMODE ANY
@@INIT@ RMODE ANY
DC XL1'5'
DC AL3(0)
DC AL4(288)
DC 4X'00'
DC Q(@@STATIC)
DC X'00000000'
DC X'00000001'
DC X'00000000'
DC X'000000FF'
DC X'0102039C09867F978D8E0B0C0D0E0F10' .....f.p........
DC X'1112139D8508871819928F1C1D1E1F80' ....e.g..k......
DC X'818283840A171B88898A8B8C05060790' abcd...hi.......
DC X'9116939495960498999A9B14159E1A20' j.lmno.qr.......
DC X'A0E2E4E0E1E3E5E7F1A22E3C282B7C26' .SU..TVX1s......
DC X'E9EAEBE8EDEEEFECDF21242A293B5E2D' Z..Y............
DC X'2FC2C4C0C1C3C5C7D1A62C255F3E3FF8' .BD.ACEGJw.....8
DC X'C9CACBC8CDCECFCC603A2340273D22D8' I..H...........Q
DC X'616263646566676869ABBBF0FDFEB1B0' ...........0....
DC X'6A6B6C6D6E6F707172AABAE6B8C6A4B5' ...........W.Fu.
DC X'7E737475767778797AA1BFD05BDEAEAC' ................
DC X'A3A5B7A9A7B6BCBDBEDDA8AF5DB4D77B' tv.zx.....y...P.
DC X'414243444546474849ADF4F6F2F3F57D' ..........46235.
DC X'4A4B4C4D4E4F505152B9FBFCF9FAFF5C' ............9...
DC X'F7535455565758595AB2D4D6D2D3D530' 7.........MOKLN.
DC X'313233343536373839B3DBDCD9DA9F40' ............R...
*
DC XL1'5'
DC AL3(0)
DC AL4(480)
DC 4X'00'
DC Q(@@STATIC)
DC X'00000000'
DC X'00000101'
DC X'00000000'
DC X'000000A0'
DC X'010203372D2E2F1605150B0C0D0E0F10' ................
DC X'1112133C3D322618193F271C1D1E1F40' ................
DC X'5A7F7B5B6C507D4D5D5C4E6B604B61F0' ...............0
DC X'F1F2F3F4F5F6F7F8F97A5E4C7E6E6F7C' 123456789.......
DC X'C1C2C3C4C5C6C7C8C9D1D2D3D4D5D6D7' ABCDEFGHIJKLMNOP
DC X'D8D9E2E3E4E5E6E7E8E9ADE0BD5F6D79' QRSTUVWXYZ......
DC X'81828384858687888991929394959697' abcdefghijklmnop
DC X'9899A2A3A4A5A6A7A8A9C04FD0A10720' qrstuvwxyz......
DC X'2122232425061728292A2B2C090A1B30' ................
DC X'311A333435360838393A3B04143EFF80' ................
*
DC XL1'5'
DC AL3(0)
DC AL4(520)
DC 4X'00'
DC Q(@@STATIC)
DC X'00000000'
DC X'000001C0'
DC X'00000000'
DC X'00000001'
DC X'8A40404040404040' ........
*
DC XL1'5'
DC AL3(0)
DC AL4(0)
DC 4X'00'
DC Q(@@STATIC)
DC X'00000000'
DC X'000001E0'
DC X'00000000'
DC X'00000001'
DC X'8B40404040404040' ........
*
EXTRN @@ALLOCA
END
|
compass-create-watch/src/ccw_main.applescript | franzheidl/alfred-workflows | 458 | 303 | on run query
-- setup
set myLocation to (do shell script "pwd")
set myIconFile to myLocation & "/compass.icns"
set myDesktopWarningIconFile to myLocation & "/compassdesktopwarning.icns"
set myDesktopwarningIcon to (POSIX file myDesktopWarningIconFile as text)
set myIcon to (POSIX file myIconFile as text)
set targetPath to ""
set targetFolder to ""
set theTerminalCommand to ""
set theQuery to item 1 of query
tell application "Finder"
if (theQuery as string) is not "" and (theQuery as string) is not "nowatch" then
try
try
set targetFolder to (POSIX file theQuery) as alias
on error
error (query as text) & " is not a valid path." number 9999
end try
set targetItemType to my getItemType(targetFolder)
if targetItemType is "file" then
set targetFolder to container of targetFolder as alias
else if targetItemType is "application" or targetItemType is "file package" then
error (query as text) & " is not a folder." number 9998
end if
on error error_text
display alert "Compass Create Watch Error" message error_text as warning
error 128
end try
else
try
set targetFolder to (folder of front window as alias)
on error
set finderSelection to (get selection)
if length of finderSelection is 1 and my getItemType(finderSelection) is "folder" then
set targetFolder to (finderSelection as alias)
else
set targetFolder to (path to desktop folder)
activate
display dialog "Are you sure you want to create a Compass project directly on your desktop?" with title "Compass Create Watch" with icon file myDesktopwarningIcon
end if
end try
end if
end tell
try
set targetPath to quoted form of (the POSIX path of targetFolder)
on error
tell application "Finder"
display alert "Compass Create Watch Error" message "Choked on coercing " & (targetFolder as text) & " to POSIX path: " & (targetPath as text) & "."
error number 128
end tell
end try
if (theQuery as string) is "nowatch" then
set theTerminalCommand to "cd " & targetPath & "&& compass create"
else
set theTerminalCommand to "cd " & targetPath & "&& compass create" & "&& compass watch"
end if
tell application "Terminal"
activate
set terminalWindow to ""
if (count of windows) is greater than 0 then
repeat with theWindow in windows
if theWindow is not busy then
set terminalWindow to theWindow
set frontmost of terminalWindow to true
exit repeat
end if
end repeat
end if
if terminalWindow is not "" then
do script theTerminalCommand in terminalWindow
else
do script theTerminalCommand
end if
end tell
tell application "Finder"
activate
if (targetFolder as string) is not ((path to desktop folder) as string) then
if targetFolder is not in Finder windows then
open targetFolder
else
set the index of Finder window targetFolder to 1
end if
end if
end tell
end run
on getItemType(aHFSPath)
tell application "System Events"
set itemType to (get class of item (aHFSPath as text) as string)
return itemType
end tell
end getItemType |
programs/oeis/060/A060633.asm | jmorken/loda | 1 | 176409 | ; A060633: Surround numbers of an n X 1 rectangle.
; 16,123,361,778,1428,2371,3673,5406,7648,10483,14001,18298,23476,29643,36913,45406,55248,66571,79513,94218,110836,129523,150441,173758,199648,228291,259873,294586,332628,374203,419521,468798,522256,580123,642633,710026,782548,860451,943993,1033438,1129056,1231123,1339921,1455738,1578868,1709611,1848273,1995166,2150608,2314923,2488441,2671498,2864436,3067603,3281353,3506046,3742048,3989731,4249473,4521658,4806676,5104923,5416801,5742718,6083088,6438331,6808873,7195146,7597588,8016643,8452761,8906398,9378016,9868083,10377073,10905466,11453748,12022411,12611953,13222878,13855696,14510923,15189081,15890698,16616308,17366451,18141673,18942526,19769568,20623363,21504481,22413498,23350996,24317563,25313793,26340286,27397648,28486491,29607433,30761098,31948116,33169123,34424761,35715678,37042528,38405971,39806673,41245306,42722548,44239083,45795601,47392798,49031376,50712043,52435513,54202506,56013748,57869971,59771913,61720318,63715936,65759523,67851841,69993658,72185748,74428891,76723873,79071486,81472528,83927803,86438121,89004298,91627156,94307523,97046233,99844126,102702048,105620851,108601393,111644538,114751156,117922123,121158321,124460638,127829968,131267211,134773273,138349066,141995508,145713523,149504041,153367998,157306336,161320003,165409953,169577146,173822548,178147131,182551873,187037758,191605776,196256923,200992201,205812618,210719188,215712931,220794873,225966046,231227488,236580243,242025361,247563898,253196916,258925483,264750673,270673566,276695248,282816811,289039353,295363978,301791796,308323923,314961481,321705598,328557408,335518051,342588673,349770426,357064468,364471963,371994081,379631998,387386896,395259963,403252393,411365386,419600148,427957891,436439833,445047198,453781216,462643123,471634161,480755578,490008628,499394571,508914673,518570206,528362448,538292683,548362201,558572298,568924276,579419443,590059113,600844606,611777248,622858371,634089313,645471418,657006036,668694523,680538241,692538558,704696848,717014491,729492873,742133386,754937428,767906403,781041721,794344798,807817056,821459923,835274833,849263226,863426548,877766251,892283793,906980638,921858256,936918123,952161721,967590538,983206068,999009811,1015003273,1031187966,1047565408,1064137123
mov $2,$0
mov $5,3
lpb $0
add $5,$0
sub $0,1
add $5,6
lpe
sub $5,1
mov $3,$5
add $6,1
lpb $3
sub $3,1
add $4,1
lpe
lpb $4
sub $4,1
add $6,$5
lpe
mov $1,$6
lpb $2
add $1,30
sub $2,1
lpe
add $1,11
|
programs/oeis/072/A072197.asm | neoneye/loda | 22 | 170769 | ; A072197: a(n) = 4*a(n-1) + 1 with a(0) = 3.
; 3,13,53,213,853,3413,13653,54613,218453,873813,3495253,13981013,55924053,223696213,894784853,3579139413,14316557653,57266230613,229064922453,916259689813,3665038759253,14660155037013,58640620148053,234562480592213,938249922368853,3752999689475413,15011998757901653,60047995031606613,240191980126426453,960767920505705813,3843071682022823253,15372286728091293013,61489146912365172053,245956587649460688213,983826350597842752853,3935305402391371011413,15741221609565484045653,62964886438261936182613,251859545753047744730453,1007438183012190978921813,4029752732048763915687253,16119010928195055662749013,64476043712780222650996053,257904174851120890603984213,1031616699404483562415936853,4126466797617934249663747413,16505867190471736998654989653,66023468761886947994619958613,264093875047547791978479834453,1056375500190191167913919337813,4225502000760764671655677351253,16902008003043058686622709405013,67608032012172234746490837620053,270432128048688938985963350480213,1081728512194755755943853401920853,4326914048779023023775413607683413,17307656195116092095101654430733653,69230624780464368380406617722934613,276922499121857473521626470891738453
mov $1,4
pow $1,$0
mul $1,10
div $1,3
mov $0,$1
|
software/libs/string.asm | Arkaeriit/asrm | 1 | 86951 | <reponame>Arkaeriit/asrm
;----------------------
;This lib contains some function to manipulate C-strings
;----------------------
;compute the length of a 0-terminated string in R1 and write the result in R1
label strlen
pushr R2 ;str pointer
pushr R3 ;loop pointer
pushr R4 ;buffer register to store a null byte as a comparaison test
pushr R5 ;Copy of the status register
read SR
cpy R5
set 6 ;getting in byte-mode
cpy SR
read R1 ;init registers
cpy R2
setlab strlenLoop
cpy R3
set 0
cpy R4
label strlenLoop
load R2 ;reading byte
eq R4 ;comparing
cmpnot
set 1 ;incresing the str pointer
add R2
cpy R2
read R3 ;jumping back if needed
jif
set 1 ;decreasing the str pointer by 1 as we increased it even if not needed
cpy R3
read R2
sub R3
sub R1 ;computing the offset
cpy R1 ;puting the result
read R5 ;restoring SR
cpy SR
popr R5 ;restoring tmp registers
popr R4
popr R3
popr R2
ret
;-------------------------------------------
;Fill R2 bytes with the char in R3 at the address starting at R1
label memset
pushr R1
pushr R2
pushr R3
pushr R5 ;loop pointer
pushr R6
pushr R4 ;saving the status register
mov R4 SR
set 6
cpy SR
setlab memsetLoop
cpy R5
setlab memsetLoopEnd
cpy R6
set 1 ;constant 1 in R12
cpy R12
label memsetLoop
set 0 ;testing for loop end
eq R2
read R6
jif
read R3 ;setting mem
str R1
read R1 ;updating R1 and R2
add R12
cpy R1
read R2
sub R12
cpy R2
read R5 ;looping back
jmp
label memsetLoopEnd
read R4 ;restoring SR
cpy SR
popr R4 ;restoring registers
popr R6
popr R4
popr R3
popr R2
popr R1
ret
;-------------------------------------------
;Flip the string in R1
label strFlip
pushr R2 ;length
pushr R3 ;current offset
pushr R4 ;max offset
pushr R5 ;loop pointer
pushr R6
pushr R7 ;save status register
pushr R8 ;scratch register
pushr R1 ;init registers
callf strlen
read R1
cpy R2
popr R1
set 0
cpy R3
set 1
cpy R12
read R2
lsr R12
cpy R4
setlab strFlipLoop
cpy R5
setlab strFlipLoopEnd
cpy R6
mov R7 SR ;byte mode
set 6
cpy SR
label strFlipLoop
read R3 ;if done, go to the end
eq R4
read R6
jif
read R1 ;geting the start char
add R3
cpy R11 ;copy of the start index
load WR
push
set 1 ;getting the end char
cpy R12
read R1
add R2
sub R3
sub R12
cpy R12 ;copy of the end index
load R12
cpy R8
pop ;putting the front char at the end
str R12
read R8 ;putting the end char at the front
str R11
set 1 ;updating R3
add R3
cpy R3
read R5 ;jumping back
jmp
label strFlipLoopEnd
read R7 ;restoring SR
cpy SR
popr R8 ;restoring registers
popr R7
popr R6
popr R5
popr R4
popr R3
popr R2
ret
|
next_level/demosrc/s_imustcontinue.asm | viznut/demoscene | 14 | 10310 | <reponame>viznut/demoscene
;,; deps_imustcontinue
;,; <- lyrics_imustcontinue
;,; <- ibpcaablocks
;,; SC53_000
;,; <- deps_imustcontinue
!byte $e4,7,chFFFFFFFFFFFFFFFF ; clrscr
;,; <- chFFFFFFFFFFFFFFFF ; 449
;,; <- chFFFFFFFFFFFF0000 ; 3
;,; <- chFCFCFCFCFCFCFCFC ; 13
;,; <- ch0000000000000000 ; 19
;,; <- ch3F3F3F3F3F3F3F3F ; 13
;,; <- ch0080C0E0F0F8FCFE ; 1
;,; <- ch000103070F1F3F7F ; 1
;,; <- chFEFCF8F0E0C08000 ; 1
;,; <- ch7F3F1F0F07030100 ; 1
;,; <- ch0000FFFFFFFFFFFF ; 3
; total unique chars in pic: 10 (worst case req 80 bytes)
!byte $DA,$00 ;addr
!byte $e2,1;mode4
!byte $07 ;data4
!byte $44
!byte $42
!byte $44
!byte $24
!byte $22
!byte $77
!byte $22
!byte $22
!byte $47,$04 ;fill
!byte $46,$02 ;fill
!byte $07 ;data4
!byte $77
!byte $77
!byte $27
!byte $22
!byte $22
!byte $44
!byte $44
!byte $24
!byte $DA,$30 ;addr
!byte $46,$02 ;fill
!byte $0A ;data4
!byte $77
!byte $77
!byte $77
!byte $22
!byte $72
!byte $22
!byte $44
!byte $44
!byte $22
!byte $27
!byte $22
!byte $8C ;skip
!byte $02 ;data4
!byte $22
!byte $22
!byte $24
!byte $94 ;skip
!byte $01 ;data4
!byte $22
!byte $72
!byte $94 ;skip
!byte $00 ;data4
!byte $22
!byte $95 ;skip
!byte $00 ;data4
!byte $22
!byte $95 ;skip
!byte $00 ;data4
!byte $22
!byte $95 ;skip
!byte $00 ;data4
!byte $22
!byte $94 ;skip
!byte $01 ;data4
!byte $22
!byte $72
!byte $93 ;skip
!byte $01 ;data4
!byte $22
!byte $72
!byte $94 ;skip
!byte $00 ;data4
!byte $22
!byte $94 ;skip
!byte $01 ;data4
!byte $22
!byte $72
!byte $93 ;skip
!byte $01 ;data4
!byte $22
!byte $72
!byte $93 ;skip
!byte $03 ;data4
!byte $22
!byte $22
!byte $77
!byte $22
!byte $8A ;skip
!byte $02 ;data4
!byte $22
!byte $77
!byte $27
!byte $DB,$7E ;addr
!byte $47,$02 ;fill
!byte $86 ;skip
!byte $4F,$02 ;fill
!byte $03 ;data4
!byte $27
!byte $77
!byte $77
!byte $27
!byte $DB,$A6 ;addr
!byte $48,$02 ;fill
!byte $06 ;data4
!byte $24
!byte $22
!byte $44
!byte $22
!byte $72
!byte $77
!byte $27
!byte $DB,$BD ;addr
!byte $48,$02 ;fill
!byte $45,$04 ;fill
!byte $48,$02 ;fill
!byte $02 ;data4
!byte $44
!byte $24
!byte $42
!byte $DB,$DD ;addr
!byte $49,$04 ;fill
!byte $45,$02 ;fill
!byte $47,$04 ;fill
; method 0 ( bytes ) -- 229 cumulative
; method 5 ( ibpc0 ibcpaa bytes ) -- 186 cumulative
; METHOD 5 CHOSEN
!byte $CE,$3A ;addr
!byte $e2,$ff;mode1
!byte $00 ;data1
!byte $E0
!byte $90 ;skip
!byte $27 ;data1
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $00
!byte $80
!byte $00
!byte $01
!byte $C0
!byte $e3 ;run ibpcaa
!byte $e1,12
;,; *_001
;,; <- deps_imustcontinue
;,; <- chFFFFFFFFFFFFFFFF ; 298
;,; <- chFFFFFFFFFFFF0000 ; 20
;,; <- chFCFCFCFCFCFCFCFC ; 24
;,; <- ch0000000000000000 ; 80
;,; <- ch3C3C3C3C3C3C3C3C ; 30
;,; <- ch3F3F3F3F3F3F3F3F ; 24
;,; <- ch000018183C3C3C3C ; 2
;,; <- ch000103070F1F3F7F ; 2
;,; <- ch0000FFFFFFFFFFFF ; 18
;,; <- ch0080C0E0F0F8FCFE ; 2
;,; <- ch7F3F1F0F07030100 ; 2
;,; <- chFEFCF8F0E0C08000 ; 2
; total unique chars in pic: 12 (worst case req 96 bytes)
; method 0 ( bytes ) -- 434 cumulative
; method 5 ( ibpc0 ibcpaa bytes ) -- 233 cumulative
; METHOD 5 CHOSEN
!byte $CE,$3A ;addr
!byte $00 ;data1
!byte $00
!byte $90 ;skip
!byte $27 ;data1
!byte $00
!byte $00
!byte $00
!byte $00
!byte $01
!byte $F4
!byte $BD
!byte $F1
!byte $54
!byte $A0
!byte $41
!byte $54
!byte $A0
!byte $41
!byte $54
!byte $A0
!byte $41
!byte $54
!byte $BC
!byte $41
!byte $54
!byte $84
!byte $41
!byte $54
!byte $84
!byte $41
!byte $54
!byte $84
!byte $41
!byte $57
!byte $BC
!byte $40
!byte $00
!byte $00
!byte $00
!byte $00
!byte $00
!byte $00
!byte $00
!byte $00
!byte $e3 ;run ibpcaa
!byte $e1,12
;,; *_002
;,; <- deps_imustcontinue
;,; <- chFFFFFFFFFFFFFFFF ; 348
;,; <- chFFFFFFFFFFFF0000 ; 14
;,; <- chFCFCFCFCFCFCFCFC ; 28
;,; <- ch0000000000000000 ; 57
;,; <- ch3C3C3C3C3C3C3C3C ; 11
;,; <- ch3F3F3F3F3F3F3F3F ; 26
;,; <- ch000103070F1F3F7F ; 3
;,; <- ch0000FFFFFFFFFFFF ; 12
;,; <- ch0080C0E0F0F8FCFE ; 2
;,; <- ch7F3F1F0F07030100 ; 2
;,; <- chFEFCF8F0E0C08000 ; 1
; total unique chars in pic: 11 (worst case req 88 bytes)
; method 0 ( bytes ) -- 441 cumulative
; method 5 ( ibpc0 ibcpaa bytes ) -- 264 cumulative
; METHOD 5 CHOSEN
!byte $CE,$7A ;addr
!byte $1A ;data1
!byte $3D
!byte $EF
!byte $00
!byte $21
!byte $29
!byte $00
!byte $21
!byte $29
!byte $00
!byte $21
!byte $29
!byte $00
!byte $21
!byte $29
!byte $00
!byte $21
!byte $29
!byte $00
!byte $21
!byte $29
!byte $00
!byte $21
!byte $29
!byte $00
!byte $3D
!byte $E9
!byte $00
!byte $e3 ;run ibpcaa
!byte $e1,12
;,; *_003
;,; <- deps_imustcontinue
;,; <- chFFFFFFFFFFFFFFFF ; 437
;,; <- chFFFFFFFFFFFF0000 ; 6
;,; <- chFCFCFCFCFCFCFCFC ; 16
;,; <- ch0000000000000000 ; 22
;,; <- ch3C3C3C3C3C3C3C3C ; 1
;,; <- ch3F3F3F3F3F3F3F3F ; 16
;,; <- ch0000FFFFFFFFFFFF ; 4
;,; <- ch0080C0E0F0F8FCFE ; 1
;,; <- ch000103070F1F3F7F ; 1
; total unique chars in pic: 9 (worst case req 72 bytes)
; method 0 ( bytes ) -- 373 cumulative
; method 5 ( ibpc0 ibcpaa bytes ) -- 294 cumulative
; METHOD 5 CHOSEN
!byte $CE,$7C ;addr
!byte $19 ;data1
!byte $1F
!byte $40
!byte $00
!byte $04
!byte $40
!byte $00
!byte $04
!byte $40
!byte $00
!byte $04
!byte $40
!byte $00
!byte $04
!byte $40
!byte $00
!byte $04
!byte $40
!byte $00
!byte $04
!byte $40
!byte $00
!byte $04
!byte $40
!byte $00
!byte $04
!byte $40
!byte $e3 ;run ibpcaa
!byte $e1,12
;,; *_004
;,; <- deps_imustcontinue
;,; <- chFFFFFFFFFFFFFFFF ; 347
;,; <- chFFFFFFFFFFFF0000 ; 15
;,; <- chFCFCFCFCFCFCFCFC ; 23
;,; <- ch0000000000000000 ; 59
;,; <- ch3C3C3C3C3C3C3C3C ; 18
;,; <- ch3F3F3F3F3F3F3F3F ; 19
;,; <- ch000103070F1F3F7F ; 3
;,; <- ch0000FFFFFFFFFFFF ; 15
;,; <- ch0080C0E0F0F8FCFE ; 1
;,; <- ch7F3F1F0F07030100 ; 3
;,; <- chFEFCF8F0E0C08000 ; 1
; total unique chars in pic: 11 (worst case req 88 bytes)
; method 0 ( bytes ) -- 489 cumulative
; method 5 ( ibpc0 ibcpaa bytes ) -- 324 cumulative
; METHOD 5 CHOSEN
!byte $CE,$7C ;addr
!byte $19 ;data1
!byte $FA
!byte $2F
!byte $00
!byte $8A
!byte $28
!byte $00
!byte $8A
!byte $28
!byte $00
!byte $8A
!byte $28
!byte $00
!byte $8A
!byte $2E
!byte $00
!byte $8A
!byte $28
!byte $00
!byte $8A
!byte $28
!byte $00
!byte $8A
!byte $28
!byte $00
!byte $8B
!byte $EF
!byte $e3 ;run ibpcaa
; total compressed size 324 bytes
!byte $e1,12
|
tests/checkers.adb | reznikmm/ada_lsp | 11 | 29971 | <filename>tests/checkers.adb
-- Copyright (c) 2017 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Ada.Streams;
with Ada.Characters.Wide_Wide_Latin_1;
with League.Stream_Element_Vectors;
with League.Strings;
with League.Text_Codecs;
with League.String_Vectors;
package body Checkers is
function "+" (Text : Wide_Wide_String)
return League.Strings.Universal_String renames
League.Strings.To_Universal_String;
Pattern : constant Wide_Wide_String :=
"^(..[^\:]*)\:([0-9]+)\:(([0-9]+)\:)?\ ((warning\:|\(style\))?.*)";
-- 1 2 34 56
type Capture_Kinds is
(File_Name, Line, Column_Group, Column, Message, Warning);
pragma Unreferenced (Column_Group);
type Capture_Array is
array (Capture_Kinds) of League.Strings.Universal_String;
procedure Decode
(Got : Capture_Array;
File : out LSP.Types.LSP_String;
Item : out LSP.Messages.Diagnostic);
------------
-- Decode --
------------
procedure Decode
(Got : Capture_Array;
File : out LSP.Types.LSP_String;
Item : out LSP.Messages.Diagnostic)
is
From : constant Positive := Positive'Wide_Wide_Value
(Got (Line).To_Wide_Wide_String);
Col : Positive := 1;
begin
File := Got (File_Name);
if not Got (Column).Is_Empty then
Col := Positive'Wide_Wide_Value
(Got (Column).To_Wide_Wide_String);
end if;
Item.span :=
(first =>
(LSP.Types.Line_Number (From - 1),
LSP.Types.UTF_16_Index (Col - 1)),
last =>
(LSP.Types.Line_Number (From - 1),
LSP.Types.UTF_16_Index (Col - 1)));
if Got (Warning).Is_Empty then
Item.severity := (True, LSP.Messages.Error);
elsif Got (Warning).Starts_With ("warning") then
Item.severity := (True, LSP.Messages.Warning);
elsif Got (Warning).Starts_With ("(style)") then
Item.severity := (True, LSP.Messages.Hint);
end if;
Item.message := Got (Message);
Item.source := (True, +"Compiler");
end Decode;
----------------
-- Initialize --
----------------
not overriding procedure Initialize
(Self : in out Checker;
Project : LSP.Types.LSP_String) is
begin
Self.Project := Project;
Self.Pattern := League.Regexps.Compile (+Pattern);
Self.Compiler := GNAT.OS_Lib.Locate_Exec_On_Path ("gprbuild");
end Initialize;
---------
-- Run --
---------
not overriding procedure Run
(Self : in out Checker;
File : LSP.Types.LSP_String;
Result : in out LSP.Messages.Diagnostic_Vector)
is
Data : League.Stream_Element_Vectors.Stream_Element_Vector;
Input : GNAT.OS_Lib.File_Descriptor;
Name : aliased String := File.To_UTF_8_String;
U : aliased String := "-u";
F : aliased String := "-f";
C : aliased String := "-c";
P : aliased String := "-P";
GPR : aliased String := Self.Project.To_UTF_8_String;
Args : constant GNAT.OS_Lib.Argument_List (1 .. 6) :=
(U'Unchecked_Access,
F'Unchecked_Access,
C'Unchecked_Access,
P'Unchecked_Access,
GPR'Unchecked_Access,
Name'Unchecked_Access);
Code : Integer;
begin
Input := GNAT.OS_Lib.Create_File
("/tmp/ada-lsp.log", GNAT.OS_Lib.Binary);
GNAT.OS_Lib.Spawn
(Program_Name => Self.Compiler.all,
Args => Args,
Output_File_Descriptor => Input,
Return_Code => Code);
Input := GNAT.OS_Lib.Open_Read
("/tmp/ada-lsp.log", GNAT.OS_Lib.Binary);
loop
declare
use type Ada.Streams.Stream_Element_Offset;
Buffer : Ada.Streams.Stream_Element_Array (1 .. 512);
Last : Ada.Streams.Stream_Element_Offset;
begin
Last := Ada.Streams.Stream_Element_Offset
(GNAT.OS_Lib.Read (Input, Buffer'Address, Buffer'Length));
Data.Append (Buffer (1 .. Last));
exit when Last /= Buffer'Length;
end;
end loop;
declare
Text : constant League.Strings.Universal_String :=
League.Text_Codecs.Codec_For_Application_Locale.Decode (Data);
Lines : constant League.String_Vectors.Universal_String_Vector :=
Text.Split (Ada.Characters.Wide_Wide_Latin_1.LF);
begin
for J in 1 .. Lines.Length loop
declare
Name : LSP.Types.LSP_String;
Item : LSP.Messages.Diagnostic;
Got : Capture_Array;
Match : constant League.Regexps.Regexp_Match :=
Self.Pattern.Find_Match (Lines (J));
begin
if Match.Is_Matched then
for J in Got'Range loop
Got (J) := Match.Capture (Capture_Kinds'Pos (J) + 1);
end loop;
Decode (Got, Name, Item);
Result.Append (Item);
end if;
end;
end loop;
end;
end Run;
end Checkers;
|
programs/oeis/276/A276855.asm | neoneye/loda | 22 | 8336 | <gh_stars>10-100
; A276855: Beatty sequence for (3 + golden ratio).
; 0,4,9,13,18,23,27,32,36,41,46,50,55,60,64,69,73,78,83,87,92,96,101,106,110,115,120,124,129,133,138,143,147,152,157,161,166,170,175,180,184,189,193,198,203,207,212,217,221,226,230,235,240,244,249,253,258,263,267,272,277,281,286,290,295,300,304,309,314,318,323,327,332,337,341,346,350,355,360,364,369,374,378,383,387,392,397,401,406,411,415,420,424,429,434,438,443,447,452,457
mov $2,$0
seq $0,26356 ; a(n) = floor((n-1)*phi) + n + 1, n > 0, where phi = (1+sqrt(5))/2.
add $0,$2
add $0,$2
sub $0,2
|
test/Fail/Issue1035.agda | shlevy/agda | 1,989 | 9584 |
data _≡_ {A : Set}(x : A) : A → Set where
refl : x ≡ x
data * : Set where ! : *
postulate
prop : ∀ x → x ≡ !
record StrictTotalOrder : Set where
field compare : *
open StrictTotalOrder
module M (Key : StrictTotalOrder) where
postulate
intersection′-₁ : ∀ x → x ≡ compare Key
-- Doesn't termination check, but shouldn't get __IMPOSSIBLE__
-- when termination checking!
to-∈-intersection′ : * → * → Set
to-∈-intersection′ x h with intersection′-₁ x
to-∈-intersection′ ._ h | refl with prop h
to-∈-intersection′ ._ ._ | refl | refl = to-∈-intersection′ ! !
|
day03/src/day.adb | jwarwick/aoc_2020 | 3 | 8308 | -- AoC 2020, Day 3
with Ada.Text_IO;
package body Day is
package TIO renames Ada.Text_IO;
function "<"(left, right : in Position) return Boolean is
begin
if left.y < right.y then
return true;
elsif left.y = right.y and left.x < right.x then
return true;
else
return false;
end if;
end "<";
procedure parse_line(line : in String; y : in Natural; trees : in out Tree_Sets.Set) is
x : Natural := 0;
begin
for c of line loop
if c = '#' then
trees.insert(Position'(X => x, Y => y));
end if;
x := x + 1;
end loop;
end parse_line;
function load_map(filename : in String) return Forest is
file : TIO.File_Type;
trees : Tree_Sets.Set;
height : Natural := 0;
width : Natural := 0;
begin
TIO.open(File => file, Mode => TIO.In_File, Name => filename);
while not TIO.end_of_file(file) loop
declare
l : constant String := TIO.get_line(file);
begin
parse_line(l, height, trees);
width := l'Length;
end;
height := height + 1;
end loop;
TIO.close(file);
return Forest'(Trees => trees, Width => width, Height => height);
end load_map;
function hit_tree(pos : in Position; trees : in Tree_Sets.Set) return Boolean is
begin
return trees.contains(pos);
end hit_tree;
function trees_hit_slope(f : in Forest; slope_x : in Natural; slope_y : in Natural) return Natural is
x : Natural := 0;
y : Natural := 0;
hits : Natural := 0;
begin
while y < f.height loop
if hit_tree(Position'(X => x, Y => y), f.trees) then
hits := hits + 1;
end if;
x := (x + slope_x) mod f.width;
y := y + slope_y;
end loop;
return hits;
end trees_hit_slope;
function trees_hit(f : in Forest; slope : in Natural) return Natural is
begin
return trees_hit_slope(f, slope, 1);
end trees_hit;
function many_trees_hit(f : in Forest) return Natural is
mult : Natural := 1;
begin
mult := trees_hit_slope(f, 1, 1);
mult := mult * trees_hit_slope(f, 3, 1);
mult := mult * trees_hit_slope(f, 5, 1);
mult := mult * trees_hit_slope(f, 7, 1);
mult := mult * trees_hit_slope(f, 1, 2);
return mult;
end many_trees_hit;
end Day;
|
lmnl/src/main/antlr4/nl/knaw/huygens/alexandria/lmnl/grammar/LMNLParser.g4 | rhdekker/alexandria-markup | 0 | 5584 | parser grammar LMNLParser;
// experimental!
options { tokenVocab=LMNLLexer; }
document
: limen EOF
;
limen
: ( rangeOpenTag | text | rangeCloseTag )+
;
rangeOpenTag
: BEGIN_OPEN_RANGE rangeName (annotation)* END_OPEN_RANGE
;
rangeCloseTag
: BEGIN_CLOSE_RANGE rangeName (annotation)* END_CLOSE_RANGE
;
annotation
: BEGIN_OPEN_ANNO annotationName (annotation)* END_OPEN_ANNO limen BEGIN_CLOSE_ANNO annotationName? END_CLOSE_ANNO # annotationWithLimen
| BEGIN_OPEN_ANNO annotationName (annotation)* END_EMPTY_ANNO # emptyAnnotation
| OPEN_ANNO_IN_ANNO_OPENER annotationName (annotation)* END_OPEN_ANNO limen BEGIN_CLOSE_ANNO annotationName? END_CLOSE_ANNO # nestedAnnotationWithLimen
| OPEN_ANNO_IN_ANNO_OPENER annotationName (annotation)* END_EMPTY_ANNO # nestedEmptyAnnotation
;
text
: TEXT+
;
rangeName
: Name_Open_Range
| Name_Close_Range
;
annotationName
: Name_Open_Annotation
| Name_Close_Annotation
;
|
Lab03/Suppose that CL contains the value of 5. Take an integer from user. Compare the value with CL. And show whether the user input is less than, greater than .asm | Deboraj-roy/COMPUTER-ORGANIZATION-AND-ARCHITECTURE-C- | 0 | 162561 | ;Suppose that CL contains the value of 5. Take an integer from user. Compare the value with CL. And show whether the user input is less than, greater than and equal to CL. Hints: use CMP, JL, JG, JE
.MODEL SMALL
.STACK 100H
.DATA
CR EQU '0DH'
LF EQU '0AH'
MSG1 DB 'ENTER AN INPUT: $'
MSG2 DB ' Greater Than 5 $'
MSG3 DB ' Equal to 5 $'
MSG4 DB ' Less Than 5 $'
.CODE
MAIN PROC
MOV AX,@DATA
MOV DS,AX
LEA DX,MSG1
MOV AH,9
INT 21H
MOV AH,1
INT 21H
MOV CL,AL
SUB CL,48
CMP CL,5
JL Less
JE Equal
JG Greater
Less:
LEA DX,MSG4
MOV AH,9
INT 21H
JMP END_CASE
Equal:
LEA DX,MSG3
MOV AH,9
INT 21H
JMP END_CASE
Greater:
LEA DX,MSG2
MOV AH,9
INT 21H
JMP END_CASE
END_CASE:
MOV AH,4CH
INT 21H
MAIN ENDP
END MAIN
|
src/frontend/Experimental_Ada_ROSE_Connection/dot_asis/dot_asis_library/source/asis_tool_2-unit.ads | sourceryinstitute/rose-sourcery-institute | 0 | 20213 | with Asis;
with A_Nodes;
with Dot;
package Asis_Tool_2.Unit is
type Class (Trace : Boolean := False) is tagged limited private; -- Initialized
procedure Process
(This : in out Class;
Unit : in Asis.Compilation_Unit;
Outputs : in Outputs_Record);
private
type Class (Trace : Boolean := False) is tagged limited
record
-- Current, in-progress intermediate output products:
-- Used when making dot edges to child nodes:
Unit_ID : a_nodes_h.Unit_ID := anhS.Invalid_Unit_ID;
Dot_Node : Dot.Node_Stmt.Class; -- Initialized
Dot_Label : Dot.HTML_Like_Labels.Class; -- Initialized
A_Unit : a_nodes_h.Unit_Struct := anhS.Default_Unit_Struct;
-- I would like to just pass Outputs through and not store it in the
-- object, since it is all pointers and we doesn't need to store their
-- values between calls to Process_Element_Tree. Outputs has to go into
-- Add_To_Dot_Label, though, so we'll put it in the object and pass
-- that:
Outputs : Outputs_Record; -- Initialized
end record;
end Asis_Tool_2.Unit;
|
project/ntstub/amd64/10_0_10240_sp0_ssdt_sysenter.asm | rmusser01/windows-syscall-table | 6 | 88266 | <filename>project/ntstub/amd64/10_0_10240_sp0_ssdt_sysenter.asm<gh_stars>1-10
; DO NOT MODIFY THIS FILE DIRECTLY!
; author: @TinySecEx
; ssdt asm stub for 10.0.10240-sp0-windows-10-th1-1507 amd64
option casemap:none
option prologue:none
option epilogue:none
.code
; ULONG64 __stdcall NtAccessCheck( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheck PROC STDCALL
mov r10 , rcx
mov eax , 0
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheck ENDP
; ULONG64 __stdcall NtWorkerFactoryWorkerReady( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtWorkerFactoryWorkerReady PROC STDCALL
mov r10 , rcx
mov eax , 1
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWorkerFactoryWorkerReady ENDP
; ULONG64 __stdcall NtAcceptConnectPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAcceptConnectPort PROC STDCALL
mov r10 , rcx
mov eax , 2
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAcceptConnectPort ENDP
; ULONG64 __stdcall NtMapUserPhysicalPagesScatter( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtMapUserPhysicalPagesScatter PROC STDCALL
mov r10 , rcx
mov eax , 3
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtMapUserPhysicalPagesScatter ENDP
; ULONG64 __stdcall NtWaitForSingleObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForSingleObject PROC STDCALL
mov r10 , rcx
mov eax , 4
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForSingleObject ENDP
; ULONG64 __stdcall NtCallbackReturn( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCallbackReturn PROC STDCALL
mov r10 , rcx
mov eax , 5
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCallbackReturn ENDP
; ULONG64 __stdcall NtReadFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtReadFile PROC STDCALL
mov r10 , rcx
mov eax , 6
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReadFile ENDP
; ULONG64 __stdcall NtDeviceIoControlFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeviceIoControlFile PROC STDCALL
mov r10 , rcx
mov eax , 7
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeviceIoControlFile ENDP
; ULONG64 __stdcall NtWriteFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtWriteFile PROC STDCALL
mov r10 , rcx
mov eax , 8
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWriteFile ENDP
; ULONG64 __stdcall NtRemoveIoCompletion( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtRemoveIoCompletion PROC STDCALL
mov r10 , rcx
mov eax , 9
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRemoveIoCompletion ENDP
; ULONG64 __stdcall NtReleaseSemaphore( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseSemaphore PROC STDCALL
mov r10 , rcx
mov eax , 10
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseSemaphore ENDP
; ULONG64 __stdcall NtReplyWaitReceivePort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtReplyWaitReceivePort PROC STDCALL
mov r10 , rcx
mov eax , 11
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReplyWaitReceivePort ENDP
; ULONG64 __stdcall NtReplyPort( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtReplyPort PROC STDCALL
mov r10 , rcx
mov eax , 12
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReplyPort ENDP
; ULONG64 __stdcall NtSetInformationThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationThread PROC STDCALL
mov r10 , rcx
mov eax , 13
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationThread ENDP
; ULONG64 __stdcall NtSetEvent( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetEvent PROC STDCALL
mov r10 , rcx
mov eax , 14
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetEvent ENDP
; ULONG64 __stdcall NtClose( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtClose PROC STDCALL
mov r10 , rcx
mov eax , 15
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtClose ENDP
; ULONG64 __stdcall NtQueryObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryObject PROC STDCALL
mov r10 , rcx
mov eax , 16
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryObject ENDP
; ULONG64 __stdcall NtQueryInformationFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationFile PROC STDCALL
mov r10 , rcx
mov eax , 17
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationFile ENDP
; ULONG64 __stdcall NtOpenKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKey PROC STDCALL
mov r10 , rcx
mov eax , 18
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKey ENDP
; ULONG64 __stdcall NtEnumerateValueKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateValueKey PROC STDCALL
mov r10 , rcx
mov eax , 19
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateValueKey ENDP
; ULONG64 __stdcall NtFindAtom( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtFindAtom PROC STDCALL
mov r10 , rcx
mov eax , 20
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFindAtom ENDP
; ULONG64 __stdcall NtQueryDefaultLocale( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDefaultLocale PROC STDCALL
mov r10 , rcx
mov eax , 21
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDefaultLocale ENDP
; ULONG64 __stdcall NtQueryKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryKey PROC STDCALL
mov r10 , rcx
mov eax , 22
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryKey ENDP
; ULONG64 __stdcall NtQueryValueKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryValueKey PROC STDCALL
mov r10 , rcx
mov eax , 23
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryValueKey ENDP
; ULONG64 __stdcall NtAllocateVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 24
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateVirtualMemory ENDP
; ULONG64 __stdcall NtQueryInformationProcess( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationProcess PROC STDCALL
mov r10 , rcx
mov eax , 25
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationProcess ENDP
; ULONG64 __stdcall NtWaitForMultipleObjects32( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForMultipleObjects32 PROC STDCALL
mov r10 , rcx
mov eax , 26
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForMultipleObjects32 ENDP
; ULONG64 __stdcall NtWriteFileGather( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtWriteFileGather PROC STDCALL
mov r10 , rcx
mov eax , 27
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWriteFileGather ENDP
; ULONG64 __stdcall NtSetInformationProcess( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationProcess PROC STDCALL
mov r10 , rcx
mov eax , 28
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationProcess ENDP
; ULONG64 __stdcall NtCreateKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateKey PROC STDCALL
mov r10 , rcx
mov eax , 29
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateKey ENDP
; ULONG64 __stdcall NtFreeVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtFreeVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 30
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFreeVirtualMemory ENDP
; ULONG64 __stdcall NtImpersonateClientOfPort( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtImpersonateClientOfPort PROC STDCALL
mov r10 , rcx
mov eax , 31
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtImpersonateClientOfPort ENDP
; ULONG64 __stdcall NtReleaseMutant( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseMutant PROC STDCALL
mov r10 , rcx
mov eax , 32
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseMutant ENDP
; ULONG64 __stdcall NtQueryInformationToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationToken PROC STDCALL
mov r10 , rcx
mov eax , 33
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationToken ENDP
; ULONG64 __stdcall NtRequestWaitReplyPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtRequestWaitReplyPort PROC STDCALL
mov r10 , rcx
mov eax , 34
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRequestWaitReplyPort ENDP
; ULONG64 __stdcall NtQueryVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 35
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryVirtualMemory ENDP
; ULONG64 __stdcall NtOpenThreadToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenThreadToken PROC STDCALL
mov r10 , rcx
mov eax , 36
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenThreadToken ENDP
; ULONG64 __stdcall NtQueryInformationThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationThread PROC STDCALL
mov r10 , rcx
mov eax , 37
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationThread ENDP
; ULONG64 __stdcall NtOpenProcess( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenProcess PROC STDCALL
mov r10 , rcx
mov eax , 38
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenProcess ENDP
; ULONG64 __stdcall NtSetInformationFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationFile PROC STDCALL
mov r10 , rcx
mov eax , 39
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationFile ENDP
; ULONG64 __stdcall NtMapViewOfSection( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtMapViewOfSection PROC STDCALL
mov r10 , rcx
mov eax , 40
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtMapViewOfSection ENDP
; ULONG64 __stdcall NtAccessCheckAndAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckAndAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 41
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckAndAuditAlarm ENDP
; ULONG64 __stdcall NtUnmapViewOfSection( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnmapViewOfSection PROC STDCALL
mov r10 , rcx
mov eax , 42
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnmapViewOfSection ENDP
; ULONG64 __stdcall NtReplyWaitReceivePortEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtReplyWaitReceivePortEx PROC STDCALL
mov r10 , rcx
mov eax , 43
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReplyWaitReceivePortEx ENDP
; ULONG64 __stdcall NtTerminateProcess( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtTerminateProcess PROC STDCALL
mov r10 , rcx
mov eax , 44
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtTerminateProcess ENDP
; ULONG64 __stdcall NtSetEventBoostPriority( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetEventBoostPriority PROC STDCALL
mov r10 , rcx
mov eax , 45
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetEventBoostPriority ENDP
; ULONG64 __stdcall NtReadFileScatter( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtReadFileScatter PROC STDCALL
mov r10 , rcx
mov eax , 46
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReadFileScatter ENDP
; ULONG64 __stdcall NtOpenThreadTokenEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenThreadTokenEx PROC STDCALL
mov r10 , rcx
mov eax , 47
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenThreadTokenEx ENDP
; ULONG64 __stdcall NtOpenProcessTokenEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenProcessTokenEx PROC STDCALL
mov r10 , rcx
mov eax , 48
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenProcessTokenEx ENDP
; ULONG64 __stdcall NtQueryPerformanceCounter( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryPerformanceCounter PROC STDCALL
mov r10 , rcx
mov eax , 49
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryPerformanceCounter ENDP
; ULONG64 __stdcall NtEnumerateKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateKey PROC STDCALL
mov r10 , rcx
mov eax , 50
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateKey ENDP
; ULONG64 __stdcall NtOpenFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenFile PROC STDCALL
mov r10 , rcx
mov eax , 51
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenFile ENDP
; ULONG64 __stdcall NtDelayExecution( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtDelayExecution PROC STDCALL
mov r10 , rcx
mov eax , 52
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDelayExecution ENDP
; ULONG64 __stdcall NtQueryDirectoryFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDirectoryFile PROC STDCALL
mov r10 , rcx
mov eax , 53
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDirectoryFile ENDP
; ULONG64 __stdcall NtQuerySystemInformation( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemInformation PROC STDCALL
mov r10 , rcx
mov eax , 54
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemInformation ENDP
; ULONG64 __stdcall NtOpenSection( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSection PROC STDCALL
mov r10 , rcx
mov eax , 55
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSection ENDP
; ULONG64 __stdcall NtQueryTimer( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryTimer PROC STDCALL
mov r10 , rcx
mov eax , 56
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryTimer ENDP
; ULONG64 __stdcall NtFsControlFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtFsControlFile PROC STDCALL
mov r10 , rcx
mov eax , 57
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFsControlFile ENDP
; ULONG64 __stdcall NtWriteVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtWriteVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 58
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWriteVirtualMemory ENDP
; ULONG64 __stdcall NtCloseObjectAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCloseObjectAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 59
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCloseObjectAuditAlarm ENDP
; ULONG64 __stdcall NtDuplicateObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtDuplicateObject PROC STDCALL
mov r10 , rcx
mov eax , 60
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDuplicateObject ENDP
; ULONG64 __stdcall NtQueryAttributesFile( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryAttributesFile PROC STDCALL
mov r10 , rcx
mov eax , 61
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryAttributesFile ENDP
; ULONG64 __stdcall NtClearEvent( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtClearEvent PROC STDCALL
mov r10 , rcx
mov eax , 62
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtClearEvent ENDP
; ULONG64 __stdcall NtReadVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtReadVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 63
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReadVirtualMemory ENDP
; ULONG64 __stdcall NtOpenEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenEvent PROC STDCALL
mov r10 , rcx
mov eax , 64
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenEvent ENDP
; ULONG64 __stdcall NtAdjustPrivilegesToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAdjustPrivilegesToken PROC STDCALL
mov r10 , rcx
mov eax , 65
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAdjustPrivilegesToken ENDP
; ULONG64 __stdcall NtDuplicateToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtDuplicateToken PROC STDCALL
mov r10 , rcx
mov eax , 66
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDuplicateToken ENDP
; ULONG64 __stdcall NtContinue( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtContinue PROC STDCALL
mov r10 , rcx
mov eax , 67
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtContinue ENDP
; ULONG64 __stdcall NtQueryDefaultUILanguage( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDefaultUILanguage PROC STDCALL
mov r10 , rcx
mov eax , 68
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDefaultUILanguage ENDP
; ULONG64 __stdcall NtQueueApcThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueueApcThread PROC STDCALL
mov r10 , rcx
mov eax , 69
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueueApcThread ENDP
; ULONG64 __stdcall NtYieldExecution( );
_10_0_10240_sp0_windows_10_th1_1507_NtYieldExecution PROC STDCALL
mov r10 , rcx
mov eax , 70
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtYieldExecution ENDP
; ULONG64 __stdcall NtAddAtom( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAddAtom PROC STDCALL
mov r10 , rcx
mov eax , 71
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAddAtom ENDP
; ULONG64 __stdcall NtCreateEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateEvent PROC STDCALL
mov r10 , rcx
mov eax , 72
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateEvent ENDP
; ULONG64 __stdcall NtQueryVolumeInformationFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryVolumeInformationFile PROC STDCALL
mov r10 , rcx
mov eax , 73
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryVolumeInformationFile ENDP
; ULONG64 __stdcall NtCreateSection( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateSection PROC STDCALL
mov r10 , rcx
mov eax , 74
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateSection ENDP
; ULONG64 __stdcall NtFlushBuffersFile( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushBuffersFile PROC STDCALL
mov r10 , rcx
mov eax , 75
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushBuffersFile ENDP
; ULONG64 __stdcall NtApphelpCacheControl( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtApphelpCacheControl PROC STDCALL
mov r10 , rcx
mov eax , 76
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtApphelpCacheControl ENDP
; ULONG64 __stdcall NtCreateProcessEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProcessEx PROC STDCALL
mov r10 , rcx
mov eax , 77
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProcessEx ENDP
; ULONG64 __stdcall NtCreateThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateThread PROC STDCALL
mov r10 , rcx
mov eax , 78
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateThread ENDP
; ULONG64 __stdcall NtIsProcessInJob( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtIsProcessInJob PROC STDCALL
mov r10 , rcx
mov eax , 79
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtIsProcessInJob ENDP
; ULONG64 __stdcall NtProtectVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtProtectVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 80
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtProtectVirtualMemory ENDP
; ULONG64 __stdcall NtQuerySection( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySection PROC STDCALL
mov r10 , rcx
mov eax , 81
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySection ENDP
; ULONG64 __stdcall NtResumeThread( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtResumeThread PROC STDCALL
mov r10 , rcx
mov eax , 82
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtResumeThread ENDP
; ULONG64 __stdcall NtTerminateThread( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtTerminateThread PROC STDCALL
mov r10 , rcx
mov eax , 83
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtTerminateThread ENDP
; ULONG64 __stdcall NtReadRequestData( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtReadRequestData PROC STDCALL
mov r10 , rcx
mov eax , 84
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReadRequestData ENDP
; ULONG64 __stdcall NtCreateFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateFile PROC STDCALL
mov r10 , rcx
mov eax , 85
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateFile ENDP
; ULONG64 __stdcall NtQueryEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryEvent PROC STDCALL
mov r10 , rcx
mov eax , 86
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryEvent ENDP
; ULONG64 __stdcall NtWriteRequestData( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtWriteRequestData PROC STDCALL
mov r10 , rcx
mov eax , 87
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWriteRequestData ENDP
; ULONG64 __stdcall NtOpenDirectoryObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenDirectoryObject PROC STDCALL
mov r10 , rcx
mov eax , 88
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenDirectoryObject ENDP
; ULONG64 __stdcall NtAccessCheckByTypeAndAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 , ULONG64 arg_14 , ULONG64 arg_15 , ULONG64 arg_16 );
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeAndAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 89
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeAndAuditAlarm ENDP
; ULONG64 __stdcall NtQuerySystemTime( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemTime PROC STDCALL
mov r10 , rcx
mov eax , 90
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemTime ENDP
; ULONG64 __stdcall NtWaitForMultipleObjects( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForMultipleObjects PROC STDCALL
mov r10 , rcx
mov eax , 91
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForMultipleObjects ENDP
; ULONG64 __stdcall NtSetInformationObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationObject PROC STDCALL
mov r10 , rcx
mov eax , 92
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationObject ENDP
; ULONG64 __stdcall NtCancelIoFile( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCancelIoFile PROC STDCALL
mov r10 , rcx
mov eax , 93
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCancelIoFile ENDP
; ULONG64 __stdcall NtTraceEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtTraceEvent PROC STDCALL
mov r10 , rcx
mov eax , 94
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtTraceEvent ENDP
; ULONG64 __stdcall NtPowerInformation( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtPowerInformation PROC STDCALL
mov r10 , rcx
mov eax , 95
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPowerInformation ENDP
; ULONG64 __stdcall NtSetValueKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetValueKey PROC STDCALL
mov r10 , rcx
mov eax , 96
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetValueKey ENDP
; ULONG64 __stdcall NtCancelTimer( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCancelTimer PROC STDCALL
mov r10 , rcx
mov eax , 97
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCancelTimer ENDP
; ULONG64 __stdcall NtSetTimer( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimer PROC STDCALL
mov r10 , rcx
mov eax , 98
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimer ENDP
; ULONG64 __stdcall NtAccessCheckByType( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByType PROC STDCALL
mov r10 , rcx
mov eax , 99
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByType ENDP
; ULONG64 __stdcall NtAccessCheckByTypeResultList( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeResultList PROC STDCALL
mov r10 , rcx
mov eax , 100
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeResultList ENDP
; ULONG64 __stdcall NtAccessCheckByTypeResultListAndAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 , ULONG64 arg_14 , ULONG64 arg_15 , ULONG64 arg_16 );
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeResultListAndAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 101
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeResultListAndAuditAlarm ENDP
; ULONG64 __stdcall NtAccessCheckByTypeResultListAndAuditAlarmByHandle( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 , ULONG64 arg_14 , ULONG64 arg_15 , ULONG64 arg_16 , ULONG64 arg_17 );
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeResultListAndAuditAlarmByHandle PROC STDCALL
mov r10 , rcx
mov eax , 102
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAccessCheckByTypeResultListAndAuditAlarmByHandle ENDP
; ULONG64 __stdcall NtAddAtomEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtAddAtomEx PROC STDCALL
mov r10 , rcx
mov eax , 103
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAddAtomEx ENDP
; ULONG64 __stdcall NtAddBootEntry( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtAddBootEntry PROC STDCALL
mov r10 , rcx
mov eax , 104
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAddBootEntry ENDP
; ULONG64 __stdcall NtAddDriverEntry( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtAddDriverEntry PROC STDCALL
mov r10 , rcx
mov eax , 105
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAddDriverEntry ENDP
; ULONG64 __stdcall NtAdjustGroupsToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAdjustGroupsToken PROC STDCALL
mov r10 , rcx
mov eax , 106
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAdjustGroupsToken ENDP
; ULONG64 __stdcall NtAdjustTokenClaimsAndDeviceGroups( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 , ULONG64 arg_14 , ULONG64 arg_15 , ULONG64 arg_16 );
_10_0_10240_sp0_windows_10_th1_1507_NtAdjustTokenClaimsAndDeviceGroups PROC STDCALL
mov r10 , rcx
mov eax , 107
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAdjustTokenClaimsAndDeviceGroups ENDP
; ULONG64 __stdcall NtAlertResumeThread( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlertResumeThread PROC STDCALL
mov r10 , rcx
mov eax , 108
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlertResumeThread ENDP
; ULONG64 __stdcall NtAlertThread( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlertThread PROC STDCALL
mov r10 , rcx
mov eax , 109
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlertThread ENDP
; ULONG64 __stdcall NtAlertThreadByThreadId( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlertThreadByThreadId PROC STDCALL
mov r10 , rcx
mov eax , 110
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlertThreadByThreadId ENDP
; ULONG64 __stdcall NtAllocateLocallyUniqueId( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateLocallyUniqueId PROC STDCALL
mov r10 , rcx
mov eax , 111
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateLocallyUniqueId ENDP
; ULONG64 __stdcall NtAllocateReserveObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateReserveObject PROC STDCALL
mov r10 , rcx
mov eax , 112
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateReserveObject ENDP
; ULONG64 __stdcall NtAllocateUserPhysicalPages( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateUserPhysicalPages PROC STDCALL
mov r10 , rcx
mov eax , 113
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateUserPhysicalPages ENDP
; ULONG64 __stdcall NtAllocateUuids( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateUuids PROC STDCALL
mov r10 , rcx
mov eax , 114
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAllocateUuids ENDP
; ULONG64 __stdcall NtAlpcAcceptConnectPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcAcceptConnectPort PROC STDCALL
mov r10 , rcx
mov eax , 115
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcAcceptConnectPort ENDP
; ULONG64 __stdcall NtAlpcCancelMessage( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCancelMessage PROC STDCALL
mov r10 , rcx
mov eax , 116
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCancelMessage ENDP
; ULONG64 __stdcall NtAlpcConnectPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcConnectPort PROC STDCALL
mov r10 , rcx
mov eax , 117
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcConnectPort ENDP
; ULONG64 __stdcall NtAlpcConnectPortEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcConnectPortEx PROC STDCALL
mov r10 , rcx
mov eax , 118
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcConnectPortEx ENDP
; ULONG64 __stdcall NtAlpcCreatePort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreatePort PROC STDCALL
mov r10 , rcx
mov eax , 119
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreatePort ENDP
; ULONG64 __stdcall NtAlpcCreatePortSection( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreatePortSection PROC STDCALL
mov r10 , rcx
mov eax , 120
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreatePortSection ENDP
; ULONG64 __stdcall NtAlpcCreateResourceReserve( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreateResourceReserve PROC STDCALL
mov r10 , rcx
mov eax , 121
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreateResourceReserve ENDP
; ULONG64 __stdcall NtAlpcCreateSectionView( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreateSectionView PROC STDCALL
mov r10 , rcx
mov eax , 122
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreateSectionView ENDP
; ULONG64 __stdcall NtAlpcCreateSecurityContext( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreateSecurityContext PROC STDCALL
mov r10 , rcx
mov eax , 123
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcCreateSecurityContext ENDP
; ULONG64 __stdcall NtAlpcDeletePortSection( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeletePortSection PROC STDCALL
mov r10 , rcx
mov eax , 124
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeletePortSection ENDP
; ULONG64 __stdcall NtAlpcDeleteResourceReserve( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeleteResourceReserve PROC STDCALL
mov r10 , rcx
mov eax , 125
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeleteResourceReserve ENDP
; ULONG64 __stdcall NtAlpcDeleteSectionView( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeleteSectionView PROC STDCALL
mov r10 , rcx
mov eax , 126
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeleteSectionView ENDP
; ULONG64 __stdcall NtAlpcDeleteSecurityContext( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeleteSecurityContext PROC STDCALL
mov r10 , rcx
mov eax , 127
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDeleteSecurityContext ENDP
; ULONG64 __stdcall NtAlpcDisconnectPort( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDisconnectPort PROC STDCALL
mov r10 , rcx
mov eax , 128
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcDisconnectPort ENDP
; ULONG64 __stdcall NtAlpcImpersonateClientContainerOfPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcImpersonateClientContainerOfPort PROC STDCALL
mov r10 , rcx
mov eax , 129
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcImpersonateClientContainerOfPort ENDP
; ULONG64 __stdcall NtAlpcImpersonateClientOfPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcImpersonateClientOfPort PROC STDCALL
mov r10 , rcx
mov eax , 130
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcImpersonateClientOfPort ENDP
; ULONG64 __stdcall NtAlpcOpenSenderProcess( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcOpenSenderProcess PROC STDCALL
mov r10 , rcx
mov eax , 131
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcOpenSenderProcess ENDP
; ULONG64 __stdcall NtAlpcOpenSenderThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcOpenSenderThread PROC STDCALL
mov r10 , rcx
mov eax , 132
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcOpenSenderThread ENDP
; ULONG64 __stdcall NtAlpcQueryInformation( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcQueryInformation PROC STDCALL
mov r10 , rcx
mov eax , 133
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcQueryInformation ENDP
; ULONG64 __stdcall NtAlpcQueryInformationMessage( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcQueryInformationMessage PROC STDCALL
mov r10 , rcx
mov eax , 134
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcQueryInformationMessage ENDP
; ULONG64 __stdcall NtAlpcRevokeSecurityContext( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcRevokeSecurityContext PROC STDCALL
mov r10 , rcx
mov eax , 135
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcRevokeSecurityContext ENDP
; ULONG64 __stdcall NtAlpcSendWaitReceivePort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcSendWaitReceivePort PROC STDCALL
mov r10 , rcx
mov eax , 136
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcSendWaitReceivePort ENDP
; ULONG64 __stdcall NtAlpcSetInformation( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcSetInformation PROC STDCALL
mov r10 , rcx
mov eax , 137
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAlpcSetInformation ENDP
; ULONG64 __stdcall NtAreMappedFilesTheSame( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtAreMappedFilesTheSame PROC STDCALL
mov r10 , rcx
mov eax , 138
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAreMappedFilesTheSame ENDP
; ULONG64 __stdcall NtAssignProcessToJobObject( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtAssignProcessToJobObject PROC STDCALL
mov r10 , rcx
mov eax , 139
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAssignProcessToJobObject ENDP
; ULONG64 __stdcall NtAssociateWaitCompletionPacket( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtAssociateWaitCompletionPacket PROC STDCALL
mov r10 , rcx
mov eax , 140
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtAssociateWaitCompletionPacket ENDP
; ULONG64 __stdcall NtCancelIoFileEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCancelIoFileEx PROC STDCALL
mov r10 , rcx
mov eax , 141
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCancelIoFileEx ENDP
; ULONG64 __stdcall NtCancelSynchronousIoFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCancelSynchronousIoFile PROC STDCALL
mov r10 , rcx
mov eax , 142
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCancelSynchronousIoFile ENDP
; ULONG64 __stdcall NtCancelTimer2( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCancelTimer2 PROC STDCALL
mov r10 , rcx
mov eax , 143
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCancelTimer2 ENDP
; ULONG64 __stdcall NtCancelWaitCompletionPacket( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCancelWaitCompletionPacket PROC STDCALL
mov r10 , rcx
mov eax , 144
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCancelWaitCompletionPacket ENDP
; ULONG64 __stdcall NtCommitComplete( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCommitComplete PROC STDCALL
mov r10 , rcx
mov eax , 145
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCommitComplete ENDP
; ULONG64 __stdcall NtCommitEnlistment( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCommitEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 146
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCommitEnlistment ENDP
; ULONG64 __stdcall NtCommitTransaction( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCommitTransaction PROC STDCALL
mov r10 , rcx
mov eax , 147
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCommitTransaction ENDP
; ULONG64 __stdcall NtCompactKeys( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCompactKeys PROC STDCALL
mov r10 , rcx
mov eax , 148
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCompactKeys ENDP
; ULONG64 __stdcall NtCompareObjects( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCompareObjects PROC STDCALL
mov r10 , rcx
mov eax , 149
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCompareObjects ENDP
; ULONG64 __stdcall NtCompareTokens( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCompareTokens PROC STDCALL
mov r10 , rcx
mov eax , 150
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCompareTokens ENDP
; ULONG64 __stdcall NtCompleteConnectPort( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtCompleteConnectPort PROC STDCALL
mov r10 , rcx
mov eax , 151
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCompleteConnectPort ENDP
; ULONG64 __stdcall NtCompressKey( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtCompressKey PROC STDCALL
mov r10 , rcx
mov eax , 152
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCompressKey ENDP
; ULONG64 __stdcall NtConnectPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtConnectPort PROC STDCALL
mov r10 , rcx
mov eax , 153
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtConnectPort ENDP
; ULONG64 __stdcall NtCreateDebugObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateDebugObject PROC STDCALL
mov r10 , rcx
mov eax , 154
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateDebugObject ENDP
; ULONG64 __stdcall NtCreateDirectoryObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateDirectoryObject PROC STDCALL
mov r10 , rcx
mov eax , 155
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateDirectoryObject ENDP
; ULONG64 __stdcall NtCreateDirectoryObjectEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateDirectoryObjectEx PROC STDCALL
mov r10 , rcx
mov eax , 156
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateDirectoryObjectEx ENDP
; ULONG64 __stdcall NtCreateEnlistment( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 157
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateEnlistment ENDP
; ULONG64 __stdcall NtCreateEventPair( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateEventPair PROC STDCALL
mov r10 , rcx
mov eax , 158
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateEventPair ENDP
; ULONG64 __stdcall NtCreateIRTimer( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateIRTimer PROC STDCALL
mov r10 , rcx
mov eax , 159
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateIRTimer ENDP
; ULONG64 __stdcall NtCreateIoCompletion( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateIoCompletion PROC STDCALL
mov r10 , rcx
mov eax , 160
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateIoCompletion ENDP
; ULONG64 __stdcall NtCreateJobObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateJobObject PROC STDCALL
mov r10 , rcx
mov eax , 161
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateJobObject ENDP
; ULONG64 __stdcall NtCreateJobSet( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateJobSet PROC STDCALL
mov r10 , rcx
mov eax , 162
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateJobSet ENDP
; ULONG64 __stdcall NtCreateKeyTransacted( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateKeyTransacted PROC STDCALL
mov r10 , rcx
mov eax , 163
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateKeyTransacted ENDP
; ULONG64 __stdcall NtCreateKeyedEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateKeyedEvent PROC STDCALL
mov r10 , rcx
mov eax , 164
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateKeyedEvent ENDP
; ULONG64 __stdcall NtCreateLowBoxToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateLowBoxToken PROC STDCALL
mov r10 , rcx
mov eax , 165
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateLowBoxToken ENDP
; ULONG64 __stdcall NtCreateMailslotFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateMailslotFile PROC STDCALL
mov r10 , rcx
mov eax , 166
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateMailslotFile ENDP
; ULONG64 __stdcall NtCreateMutant( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateMutant PROC STDCALL
mov r10 , rcx
mov eax , 167
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateMutant ENDP
; ULONG64 __stdcall NtCreateNamedPipeFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 , ULONG64 arg_14 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateNamedPipeFile PROC STDCALL
mov r10 , rcx
mov eax , 168
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateNamedPipeFile ENDP
; ULONG64 __stdcall NtCreatePagingFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePagingFile PROC STDCALL
mov r10 , rcx
mov eax , 169
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePagingFile ENDP
; ULONG64 __stdcall NtCreatePartition( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePartition PROC STDCALL
mov r10 , rcx
mov eax , 170
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePartition ENDP
; ULONG64 __stdcall NtCreatePort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePort PROC STDCALL
mov r10 , rcx
mov eax , 171
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePort ENDP
; ULONG64 __stdcall NtCreatePrivateNamespace( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePrivateNamespace PROC STDCALL
mov r10 , rcx
mov eax , 172
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreatePrivateNamespace ENDP
; ULONG64 __stdcall NtCreateProcess( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProcess PROC STDCALL
mov r10 , rcx
mov eax , 173
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProcess ENDP
; ULONG64 __stdcall NtCreateProfile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProfile PROC STDCALL
mov r10 , rcx
mov eax , 174
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProfile ENDP
; ULONG64 __stdcall NtCreateProfileEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProfileEx PROC STDCALL
mov r10 , rcx
mov eax , 175
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateProfileEx ENDP
; ULONG64 __stdcall NtCreateResourceManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateResourceManager PROC STDCALL
mov r10 , rcx
mov eax , 176
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateResourceManager ENDP
; ULONG64 __stdcall NtCreateSemaphore( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateSemaphore PROC STDCALL
mov r10 , rcx
mov eax , 177
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateSemaphore ENDP
; ULONG64 __stdcall NtCreateSymbolicLinkObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateSymbolicLinkObject PROC STDCALL
mov r10 , rcx
mov eax , 178
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateSymbolicLinkObject ENDP
; ULONG64 __stdcall NtCreateThreadEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateThreadEx PROC STDCALL
mov r10 , rcx
mov eax , 179
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateThreadEx ENDP
; ULONG64 __stdcall NtCreateTimer( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTimer PROC STDCALL
mov r10 , rcx
mov eax , 180
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTimer ENDP
; ULONG64 __stdcall NtCreateTimer2( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTimer2 PROC STDCALL
mov r10 , rcx
mov eax , 181
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTimer2 ENDP
; ULONG64 __stdcall NtCreateToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateToken PROC STDCALL
mov r10 , rcx
mov eax , 182
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateToken ENDP
; ULONG64 __stdcall NtCreateTokenEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 , ULONG64 arg_14 , ULONG64 arg_15 , ULONG64 arg_16 , ULONG64 arg_17 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTokenEx PROC STDCALL
mov r10 , rcx
mov eax , 183
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTokenEx ENDP
; ULONG64 __stdcall NtCreateTransaction( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTransaction PROC STDCALL
mov r10 , rcx
mov eax , 184
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTransaction ENDP
; ULONG64 __stdcall NtCreateTransactionManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTransactionManager PROC STDCALL
mov r10 , rcx
mov eax , 185
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateTransactionManager ENDP
; ULONG64 __stdcall NtCreateUserProcess( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateUserProcess PROC STDCALL
mov r10 , rcx
mov eax , 186
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateUserProcess ENDP
; ULONG64 __stdcall NtCreateWaitCompletionPacket( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWaitCompletionPacket PROC STDCALL
mov r10 , rcx
mov eax , 187
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWaitCompletionPacket ENDP
; ULONG64 __stdcall NtCreateWaitablePort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWaitablePort PROC STDCALL
mov r10 , rcx
mov eax , 188
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWaitablePort ENDP
; ULONG64 __stdcall NtCreateWnfStateName( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWnfStateName PROC STDCALL
mov r10 , rcx
mov eax , 189
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWnfStateName ENDP
; ULONG64 __stdcall NtCreateWorkerFactory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWorkerFactory PROC STDCALL
mov r10 , rcx
mov eax , 190
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtCreateWorkerFactory ENDP
; ULONG64 __stdcall NtDebugActiveProcess( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtDebugActiveProcess PROC STDCALL
mov r10 , rcx
mov eax , 191
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDebugActiveProcess ENDP
; ULONG64 __stdcall NtDebugContinue( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtDebugContinue PROC STDCALL
mov r10 , rcx
mov eax , 192
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDebugContinue ENDP
; ULONG64 __stdcall NtDeleteAtom( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteAtom PROC STDCALL
mov r10 , rcx
mov eax , 193
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteAtom ENDP
; ULONG64 __stdcall NtDeleteBootEntry( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteBootEntry PROC STDCALL
mov r10 , rcx
mov eax , 194
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteBootEntry ENDP
; ULONG64 __stdcall NtDeleteDriverEntry( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteDriverEntry PROC STDCALL
mov r10 , rcx
mov eax , 195
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteDriverEntry ENDP
; ULONG64 __stdcall NtDeleteFile( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteFile PROC STDCALL
mov r10 , rcx
mov eax , 196
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteFile ENDP
; ULONG64 __stdcall NtDeleteKey( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteKey PROC STDCALL
mov r10 , rcx
mov eax , 197
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteKey ENDP
; ULONG64 __stdcall NtDeleteObjectAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteObjectAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 198
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteObjectAuditAlarm ENDP
; ULONG64 __stdcall NtDeletePrivateNamespace( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeletePrivateNamespace PROC STDCALL
mov r10 , rcx
mov eax , 199
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeletePrivateNamespace ENDP
; ULONG64 __stdcall NtDeleteValueKey( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteValueKey PROC STDCALL
mov r10 , rcx
mov eax , 200
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteValueKey ENDP
; ULONG64 __stdcall NtDeleteWnfStateData( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteWnfStateData PROC STDCALL
mov r10 , rcx
mov eax , 201
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteWnfStateData ENDP
; ULONG64 __stdcall NtDeleteWnfStateName( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteWnfStateName PROC STDCALL
mov r10 , rcx
mov eax , 202
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDeleteWnfStateName ENDP
; ULONG64 __stdcall NtDisableLastKnownGood( );
_10_0_10240_sp0_windows_10_th1_1507_NtDisableLastKnownGood PROC STDCALL
mov r10 , rcx
mov eax , 203
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDisableLastKnownGood ENDP
; ULONG64 __stdcall NtDisplayString( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDisplayString PROC STDCALL
mov r10 , rcx
mov eax , 204
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDisplayString ENDP
; ULONG64 __stdcall NtDrawText( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtDrawText PROC STDCALL
mov r10 , rcx
mov eax , 205
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtDrawText ENDP
; ULONG64 __stdcall NtEnableLastKnownGood( );
_10_0_10240_sp0_windows_10_th1_1507_NtEnableLastKnownGood PROC STDCALL
mov r10 , rcx
mov eax , 206
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtEnableLastKnownGood ENDP
; ULONG64 __stdcall NtEnumerateBootEntries( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateBootEntries PROC STDCALL
mov r10 , rcx
mov eax , 207
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateBootEntries ENDP
; ULONG64 __stdcall NtEnumerateDriverEntries( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateDriverEntries PROC STDCALL
mov r10 , rcx
mov eax , 208
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateDriverEntries ENDP
; ULONG64 __stdcall NtEnumerateSystemEnvironmentValuesEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateSystemEnvironmentValuesEx PROC STDCALL
mov r10 , rcx
mov eax , 209
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateSystemEnvironmentValuesEx ENDP
; ULONG64 __stdcall NtEnumerateTransactionObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateTransactionObject PROC STDCALL
mov r10 , rcx
mov eax , 210
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtEnumerateTransactionObject ENDP
; ULONG64 __stdcall NtExtendSection( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtExtendSection PROC STDCALL
mov r10 , rcx
mov eax , 211
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtExtendSection ENDP
; ULONG64 __stdcall NtFilterBootOption( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtFilterBootOption PROC STDCALL
mov r10 , rcx
mov eax , 212
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFilterBootOption ENDP
; ULONG64 __stdcall NtFilterToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtFilterToken PROC STDCALL
mov r10 , rcx
mov eax , 213
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFilterToken ENDP
; ULONG64 __stdcall NtFilterTokenEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 , ULONG64 arg_13 , ULONG64 arg_14 );
_10_0_10240_sp0_windows_10_th1_1507_NtFilterTokenEx PROC STDCALL
mov r10 , rcx
mov eax , 214
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFilterTokenEx ENDP
; ULONG64 __stdcall NtFlushBuffersFileEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushBuffersFileEx PROC STDCALL
mov r10 , rcx
mov eax , 215
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushBuffersFileEx ENDP
; ULONG64 __stdcall NtFlushInstallUILanguage( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushInstallUILanguage PROC STDCALL
mov r10 , rcx
mov eax , 216
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushInstallUILanguage ENDP
; ULONG64 __stdcall NtFlushInstructionCache( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushInstructionCache PROC STDCALL
mov r10 , rcx
mov eax , 217
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushInstructionCache ENDP
; ULONG64 __stdcall NtFlushKey( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushKey PROC STDCALL
mov r10 , rcx
mov eax , 218
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushKey ENDP
; ULONG64 __stdcall NtFlushProcessWriteBuffers( );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushProcessWriteBuffers PROC STDCALL
mov r10 , rcx
mov eax , 219
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushProcessWriteBuffers ENDP
; ULONG64 __stdcall NtFlushVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 220
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushVirtualMemory ENDP
; ULONG64 __stdcall NtFlushWriteBuffer( );
_10_0_10240_sp0_windows_10_th1_1507_NtFlushWriteBuffer PROC STDCALL
mov r10 , rcx
mov eax , 221
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFlushWriteBuffer ENDP
; ULONG64 __stdcall NtFreeUserPhysicalPages( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtFreeUserPhysicalPages PROC STDCALL
mov r10 , rcx
mov eax , 222
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFreeUserPhysicalPages ENDP
; ULONG64 __stdcall NtFreezeRegistry( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtFreezeRegistry PROC STDCALL
mov r10 , rcx
mov eax , 223
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFreezeRegistry ENDP
; ULONG64 __stdcall NtFreezeTransactions( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtFreezeTransactions PROC STDCALL
mov r10 , rcx
mov eax , 224
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtFreezeTransactions ENDP
; ULONG64 __stdcall NtGetCachedSigningLevel( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetCachedSigningLevel PROC STDCALL
mov r10 , rcx
mov eax , 225
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetCachedSigningLevel ENDP
; ULONG64 __stdcall NtGetCompleteWnfStateSubscription( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetCompleteWnfStateSubscription PROC STDCALL
mov r10 , rcx
mov eax , 226
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetCompleteWnfStateSubscription ENDP
; ULONG64 __stdcall NtGetContextThread( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetContextThread PROC STDCALL
mov r10 , rcx
mov eax , 227
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetContextThread ENDP
; ULONG64 __stdcall NtGetCurrentProcessorNumber( );
_10_0_10240_sp0_windows_10_th1_1507_NtGetCurrentProcessorNumber PROC STDCALL
mov r10 , rcx
mov eax , 228
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetCurrentProcessorNumber ENDP
; ULONG64 __stdcall NtGetCurrentProcessorNumberEx( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetCurrentProcessorNumberEx PROC STDCALL
mov r10 , rcx
mov eax , 229
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetCurrentProcessorNumberEx ENDP
; ULONG64 __stdcall NtGetDevicePowerState( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetDevicePowerState PROC STDCALL
mov r10 , rcx
mov eax , 230
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetDevicePowerState ENDP
; ULONG64 __stdcall NtGetMUIRegistryInfo( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetMUIRegistryInfo PROC STDCALL
mov r10 , rcx
mov eax , 231
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetMUIRegistryInfo ENDP
; ULONG64 __stdcall NtGetNextProcess( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetNextProcess PROC STDCALL
mov r10 , rcx
mov eax , 232
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetNextProcess ENDP
; ULONG64 __stdcall NtGetNextThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetNextThread PROC STDCALL
mov r10 , rcx
mov eax , 233
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetNextThread ENDP
; ULONG64 __stdcall NtGetNlsSectionPtr( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetNlsSectionPtr PROC STDCALL
mov r10 , rcx
mov eax , 234
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetNlsSectionPtr ENDP
; ULONG64 __stdcall NtGetNotificationResourceManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetNotificationResourceManager PROC STDCALL
mov r10 , rcx
mov eax , 235
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetNotificationResourceManager ENDP
; ULONG64 __stdcall NtGetWriteWatch( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtGetWriteWatch PROC STDCALL
mov r10 , rcx
mov eax , 236
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtGetWriteWatch ENDP
; ULONG64 __stdcall NtImpersonateAnonymousToken( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtImpersonateAnonymousToken PROC STDCALL
mov r10 , rcx
mov eax , 237
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtImpersonateAnonymousToken ENDP
; ULONG64 __stdcall NtImpersonateThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtImpersonateThread PROC STDCALL
mov r10 , rcx
mov eax , 238
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtImpersonateThread ENDP
; ULONG64 __stdcall NtInitializeNlsFiles( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtInitializeNlsFiles PROC STDCALL
mov r10 , rcx
mov eax , 239
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtInitializeNlsFiles ENDP
; ULONG64 __stdcall NtInitializeRegistry( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtInitializeRegistry PROC STDCALL
mov r10 , rcx
mov eax , 240
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtInitializeRegistry ENDP
; ULONG64 __stdcall NtInitiatePowerAction( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtInitiatePowerAction PROC STDCALL
mov r10 , rcx
mov eax , 241
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtInitiatePowerAction ENDP
; ULONG64 __stdcall NtIsSystemResumeAutomatic( );
_10_0_10240_sp0_windows_10_th1_1507_NtIsSystemResumeAutomatic PROC STDCALL
mov r10 , rcx
mov eax , 242
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtIsSystemResumeAutomatic ENDP
; ULONG64 __stdcall NtIsUILanguageComitted( );
_10_0_10240_sp0_windows_10_th1_1507_NtIsUILanguageComitted PROC STDCALL
mov r10 , rcx
mov eax , 243
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtIsUILanguageComitted ENDP
; ULONG64 __stdcall NtListenPort( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtListenPort PROC STDCALL
mov r10 , rcx
mov eax , 244
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtListenPort ENDP
; ULONG64 __stdcall NtLoadDriver( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtLoadDriver PROC STDCALL
mov r10 , rcx
mov eax , 245
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLoadDriver ENDP
; ULONG64 __stdcall NtLoadKey( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtLoadKey PROC STDCALL
mov r10 , rcx
mov eax , 246
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLoadKey ENDP
; ULONG64 __stdcall NtLoadKey2( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtLoadKey2 PROC STDCALL
mov r10 , rcx
mov eax , 247
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLoadKey2 ENDP
; ULONG64 __stdcall NtLoadKeyEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtLoadKeyEx PROC STDCALL
mov r10 , rcx
mov eax , 248
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLoadKeyEx ENDP
; ULONG64 __stdcall NtLockFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtLockFile PROC STDCALL
mov r10 , rcx
mov eax , 249
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLockFile ENDP
; ULONG64 __stdcall NtLockProductActivationKeys( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtLockProductActivationKeys PROC STDCALL
mov r10 , rcx
mov eax , 250
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLockProductActivationKeys ENDP
; ULONG64 __stdcall NtLockRegistryKey( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtLockRegistryKey PROC STDCALL
mov r10 , rcx
mov eax , 251
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLockRegistryKey ENDP
; ULONG64 __stdcall NtLockVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtLockVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 252
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtLockVirtualMemory ENDP
; ULONG64 __stdcall NtMakePermanentObject( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtMakePermanentObject PROC STDCALL
mov r10 , rcx
mov eax , 253
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtMakePermanentObject ENDP
; ULONG64 __stdcall NtMakeTemporaryObject( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtMakeTemporaryObject PROC STDCALL
mov r10 , rcx
mov eax , 254
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtMakeTemporaryObject ENDP
; ULONG64 __stdcall NtManagePartition( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtManagePartition PROC STDCALL
mov r10 , rcx
mov eax , 255
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtManagePartition ENDP
; ULONG64 __stdcall NtMapCMFModule( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtMapCMFModule PROC STDCALL
mov r10 , rcx
mov eax , 256
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtMapCMFModule ENDP
; ULONG64 __stdcall NtMapUserPhysicalPages( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtMapUserPhysicalPages PROC STDCALL
mov r10 , rcx
mov eax , 257
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtMapUserPhysicalPages ENDP
; ULONG64 __stdcall NtModifyBootEntry( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtModifyBootEntry PROC STDCALL
mov r10 , rcx
mov eax , 258
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtModifyBootEntry ENDP
; ULONG64 __stdcall NtModifyDriverEntry( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtModifyDriverEntry PROC STDCALL
mov r10 , rcx
mov eax , 259
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtModifyDriverEntry ENDP
; ULONG64 __stdcall NtNotifyChangeDirectoryFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeDirectoryFile PROC STDCALL
mov r10 , rcx
mov eax , 260
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeDirectoryFile ENDP
; ULONG64 __stdcall NtNotifyChangeKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 );
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeKey PROC STDCALL
mov r10 , rcx
mov eax , 261
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeKey ENDP
; ULONG64 __stdcall NtNotifyChangeMultipleKeys( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 );
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeMultipleKeys PROC STDCALL
mov r10 , rcx
mov eax , 262
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeMultipleKeys ENDP
; ULONG64 __stdcall NtNotifyChangeSession( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 );
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeSession PROC STDCALL
mov r10 , rcx
mov eax , 263
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtNotifyChangeSession ENDP
; ULONG64 __stdcall NtOpenEnlistment( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 264
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenEnlistment ENDP
; ULONG64 __stdcall NtOpenEventPair( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenEventPair PROC STDCALL
mov r10 , rcx
mov eax , 265
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenEventPair ENDP
; ULONG64 __stdcall NtOpenIoCompletion( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenIoCompletion PROC STDCALL
mov r10 , rcx
mov eax , 266
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenIoCompletion ENDP
; ULONG64 __stdcall NtOpenJobObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenJobObject PROC STDCALL
mov r10 , rcx
mov eax , 267
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenJobObject ENDP
; ULONG64 __stdcall NtOpenKeyEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyEx PROC STDCALL
mov r10 , rcx
mov eax , 268
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyEx ENDP
; ULONG64 __stdcall NtOpenKeyTransacted( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyTransacted PROC STDCALL
mov r10 , rcx
mov eax , 269
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyTransacted ENDP
; ULONG64 __stdcall NtOpenKeyTransactedEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyTransactedEx PROC STDCALL
mov r10 , rcx
mov eax , 270
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyTransactedEx ENDP
; ULONG64 __stdcall NtOpenKeyedEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyedEvent PROC STDCALL
mov r10 , rcx
mov eax , 271
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenKeyedEvent ENDP
; ULONG64 __stdcall NtOpenMutant( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenMutant PROC STDCALL
mov r10 , rcx
mov eax , 272
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenMutant ENDP
; ULONG64 __stdcall NtOpenObjectAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 , ULONG64 arg_10 , ULONG64 arg_11 , ULONG64 arg_12 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenObjectAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 273
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenObjectAuditAlarm ENDP
; ULONG64 __stdcall NtOpenPartition( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenPartition PROC STDCALL
mov r10 , rcx
mov eax , 274
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenPartition ENDP
; ULONG64 __stdcall NtOpenPrivateNamespace( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenPrivateNamespace PROC STDCALL
mov r10 , rcx
mov eax , 275
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenPrivateNamespace ENDP
; ULONG64 __stdcall NtOpenProcessToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenProcessToken PROC STDCALL
mov r10 , rcx
mov eax , 276
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenProcessToken ENDP
; ULONG64 __stdcall NtOpenResourceManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenResourceManager PROC STDCALL
mov r10 , rcx
mov eax , 277
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenResourceManager ENDP
; ULONG64 __stdcall NtOpenSemaphore( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSemaphore PROC STDCALL
mov r10 , rcx
mov eax , 278
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSemaphore ENDP
; ULONG64 __stdcall NtOpenSession( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSession PROC STDCALL
mov r10 , rcx
mov eax , 279
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSession ENDP
; ULONG64 __stdcall NtOpenSymbolicLinkObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSymbolicLinkObject PROC STDCALL
mov r10 , rcx
mov eax , 280
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenSymbolicLinkObject ENDP
; ULONG64 __stdcall NtOpenThread( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenThread PROC STDCALL
mov r10 , rcx
mov eax , 281
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenThread ENDP
; ULONG64 __stdcall NtOpenTimer( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenTimer PROC STDCALL
mov r10 , rcx
mov eax , 282
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenTimer ENDP
; ULONG64 __stdcall NtOpenTransaction( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenTransaction PROC STDCALL
mov r10 , rcx
mov eax , 283
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenTransaction ENDP
; ULONG64 __stdcall NtOpenTransactionManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtOpenTransactionManager PROC STDCALL
mov r10 , rcx
mov eax , 284
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtOpenTransactionManager ENDP
; ULONG64 __stdcall NtPlugPlayControl( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtPlugPlayControl PROC STDCALL
mov r10 , rcx
mov eax , 285
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPlugPlayControl ENDP
; ULONG64 __stdcall NtPrePrepareComplete( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtPrePrepareComplete PROC STDCALL
mov r10 , rcx
mov eax , 286
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPrePrepareComplete ENDP
; ULONG64 __stdcall NtPrePrepareEnlistment( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtPrePrepareEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 287
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPrePrepareEnlistment ENDP
; ULONG64 __stdcall NtPrepareComplete( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtPrepareComplete PROC STDCALL
mov r10 , rcx
mov eax , 288
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPrepareComplete ENDP
; ULONG64 __stdcall NtPrepareEnlistment( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtPrepareEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 289
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPrepareEnlistment ENDP
; ULONG64 __stdcall NtPrivilegeCheck( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtPrivilegeCheck PROC STDCALL
mov r10 , rcx
mov eax , 290
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPrivilegeCheck ENDP
; ULONG64 __stdcall NtPrivilegeObjectAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtPrivilegeObjectAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 291
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPrivilegeObjectAuditAlarm ENDP
; ULONG64 __stdcall NtPrivilegedServiceAuditAlarm( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtPrivilegedServiceAuditAlarm PROC STDCALL
mov r10 , rcx
mov eax , 292
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPrivilegedServiceAuditAlarm ENDP
; ULONG64 __stdcall NtPropagationComplete( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtPropagationComplete PROC STDCALL
mov r10 , rcx
mov eax , 293
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPropagationComplete ENDP
; ULONG64 __stdcall NtPropagationFailed( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtPropagationFailed PROC STDCALL
mov r10 , rcx
mov eax , 294
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPropagationFailed ENDP
; ULONG64 __stdcall NtPulseEvent( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtPulseEvent PROC STDCALL
mov r10 , rcx
mov eax , 295
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtPulseEvent ENDP
; ULONG64 __stdcall NtQueryBootEntryOrder( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryBootEntryOrder PROC STDCALL
mov r10 , rcx
mov eax , 296
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryBootEntryOrder ENDP
; ULONG64 __stdcall NtQueryBootOptions( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryBootOptions PROC STDCALL
mov r10 , rcx
mov eax , 297
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryBootOptions ENDP
; ULONG64 __stdcall NtQueryDebugFilterState( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDebugFilterState PROC STDCALL
mov r10 , rcx
mov eax , 298
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDebugFilterState ENDP
; ULONG64 __stdcall NtQueryDirectoryObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDirectoryObject PROC STDCALL
mov r10 , rcx
mov eax , 299
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDirectoryObject ENDP
; ULONG64 __stdcall NtQueryDriverEntryOrder( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDriverEntryOrder PROC STDCALL
mov r10 , rcx
mov eax , 300
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryDriverEntryOrder ENDP
; ULONG64 __stdcall NtQueryEaFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryEaFile PROC STDCALL
mov r10 , rcx
mov eax , 301
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryEaFile ENDP
; ULONG64 __stdcall NtQueryFullAttributesFile( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryFullAttributesFile PROC STDCALL
mov r10 , rcx
mov eax , 302
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryFullAttributesFile ENDP
; ULONG64 __stdcall NtQueryInformationAtom( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationAtom PROC STDCALL
mov r10 , rcx
mov eax , 303
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationAtom ENDP
; ULONG64 __stdcall NtQueryInformationEnlistment( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 304
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationEnlistment ENDP
; ULONG64 __stdcall NtQueryInformationJobObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationJobObject PROC STDCALL
mov r10 , rcx
mov eax , 305
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationJobObject ENDP
; ULONG64 __stdcall NtQueryInformationPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationPort PROC STDCALL
mov r10 , rcx
mov eax , 306
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationPort ENDP
; ULONG64 __stdcall NtQueryInformationResourceManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationResourceManager PROC STDCALL
mov r10 , rcx
mov eax , 307
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationResourceManager ENDP
; ULONG64 __stdcall NtQueryInformationTransaction( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationTransaction PROC STDCALL
mov r10 , rcx
mov eax , 308
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationTransaction ENDP
; ULONG64 __stdcall NtQueryInformationTransactionManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationTransactionManager PROC STDCALL
mov r10 , rcx
mov eax , 309
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationTransactionManager ENDP
; ULONG64 __stdcall NtQueryInformationWorkerFactory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationWorkerFactory PROC STDCALL
mov r10 , rcx
mov eax , 310
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInformationWorkerFactory ENDP
; ULONG64 __stdcall NtQueryInstallUILanguage( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInstallUILanguage PROC STDCALL
mov r10 , rcx
mov eax , 311
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryInstallUILanguage ENDP
; ULONG64 __stdcall NtQueryIntervalProfile( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryIntervalProfile PROC STDCALL
mov r10 , rcx
mov eax , 312
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryIntervalProfile ENDP
; ULONG64 __stdcall NtQueryIoCompletion( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryIoCompletion PROC STDCALL
mov r10 , rcx
mov eax , 313
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryIoCompletion ENDP
; ULONG64 __stdcall NtQueryLicenseValue( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryLicenseValue PROC STDCALL
mov r10 , rcx
mov eax , 314
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryLicenseValue ENDP
; ULONG64 __stdcall NtQueryMultipleValueKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryMultipleValueKey PROC STDCALL
mov r10 , rcx
mov eax , 315
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryMultipleValueKey ENDP
; ULONG64 __stdcall NtQueryMutant( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryMutant PROC STDCALL
mov r10 , rcx
mov eax , 316
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryMutant ENDP
; ULONG64 __stdcall NtQueryOpenSubKeys( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryOpenSubKeys PROC STDCALL
mov r10 , rcx
mov eax , 317
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryOpenSubKeys ENDP
; ULONG64 __stdcall NtQueryOpenSubKeysEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryOpenSubKeysEx PROC STDCALL
mov r10 , rcx
mov eax , 318
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryOpenSubKeysEx ENDP
; ULONG64 __stdcall NtQueryPortInformationProcess( );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryPortInformationProcess PROC STDCALL
mov r10 , rcx
mov eax , 319
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryPortInformationProcess ENDP
; ULONG64 __stdcall NtQueryQuotaInformationFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryQuotaInformationFile PROC STDCALL
mov r10 , rcx
mov eax , 320
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryQuotaInformationFile ENDP
; ULONG64 __stdcall NtQuerySecurityAttributesToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySecurityAttributesToken PROC STDCALL
mov r10 , rcx
mov eax , 321
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySecurityAttributesToken ENDP
; ULONG64 __stdcall NtQuerySecurityObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySecurityObject PROC STDCALL
mov r10 , rcx
mov eax , 322
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySecurityObject ENDP
; ULONG64 __stdcall NtQuerySemaphore( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySemaphore PROC STDCALL
mov r10 , rcx
mov eax , 323
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySemaphore ENDP
; ULONG64 __stdcall NtQuerySymbolicLinkObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySymbolicLinkObject PROC STDCALL
mov r10 , rcx
mov eax , 324
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySymbolicLinkObject ENDP
; ULONG64 __stdcall NtQuerySystemEnvironmentValue( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemEnvironmentValue PROC STDCALL
mov r10 , rcx
mov eax , 325
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemEnvironmentValue ENDP
; ULONG64 __stdcall NtQuerySystemEnvironmentValueEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemEnvironmentValueEx PROC STDCALL
mov r10 , rcx
mov eax , 326
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemEnvironmentValueEx ENDP
; ULONG64 __stdcall NtQuerySystemInformationEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemInformationEx PROC STDCALL
mov r10 , rcx
mov eax , 327
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQuerySystemInformationEx ENDP
; ULONG64 __stdcall NtQueryTimerResolution( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryTimerResolution PROC STDCALL
mov r10 , rcx
mov eax , 328
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryTimerResolution ENDP
; ULONG64 __stdcall NtQueryWnfStateData( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryWnfStateData PROC STDCALL
mov r10 , rcx
mov eax , 329
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryWnfStateData ENDP
; ULONG64 __stdcall NtQueryWnfStateNameInformation( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueryWnfStateNameInformation PROC STDCALL
mov r10 , rcx
mov eax , 330
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueryWnfStateNameInformation ENDP
; ULONG64 __stdcall NtQueueApcThreadEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtQueueApcThreadEx PROC STDCALL
mov r10 , rcx
mov eax , 331
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtQueueApcThreadEx ENDP
; ULONG64 __stdcall NtRaiseException( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtRaiseException PROC STDCALL
mov r10 , rcx
mov eax , 332
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRaiseException ENDP
; ULONG64 __stdcall NtRaiseHardError( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtRaiseHardError PROC STDCALL
mov r10 , rcx
mov eax , 333
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRaiseHardError ENDP
; ULONG64 __stdcall NtReadOnlyEnlistment( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtReadOnlyEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 334
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReadOnlyEnlistment ENDP
; ULONG64 __stdcall NtRecoverEnlistment( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRecoverEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 335
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRecoverEnlistment ENDP
; ULONG64 __stdcall NtRecoverResourceManager( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtRecoverResourceManager PROC STDCALL
mov r10 , rcx
mov eax , 336
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRecoverResourceManager ENDP
; ULONG64 __stdcall NtRecoverTransactionManager( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtRecoverTransactionManager PROC STDCALL
mov r10 , rcx
mov eax , 337
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRecoverTransactionManager ENDP
; ULONG64 __stdcall NtRegisterProtocolAddressInformation( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtRegisterProtocolAddressInformation PROC STDCALL
mov r10 , rcx
mov eax , 338
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRegisterProtocolAddressInformation ENDP
; ULONG64 __stdcall NtRegisterThreadTerminatePort( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtRegisterThreadTerminatePort PROC STDCALL
mov r10 , rcx
mov eax , 339
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRegisterThreadTerminatePort ENDP
; ULONG64 __stdcall NtReleaseKeyedEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseKeyedEvent PROC STDCALL
mov r10 , rcx
mov eax , 340
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseKeyedEvent ENDP
; ULONG64 __stdcall NtReleaseWorkerFactoryWorker( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseWorkerFactoryWorker PROC STDCALL
mov r10 , rcx
mov eax , 341
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReleaseWorkerFactoryWorker ENDP
; ULONG64 __stdcall NtRemoveIoCompletionEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtRemoveIoCompletionEx PROC STDCALL
mov r10 , rcx
mov eax , 342
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRemoveIoCompletionEx ENDP
; ULONG64 __stdcall NtRemoveProcessDebug( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRemoveProcessDebug PROC STDCALL
mov r10 , rcx
mov eax , 343
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRemoveProcessDebug ENDP
; ULONG64 __stdcall NtRenameKey( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRenameKey PROC STDCALL
mov r10 , rcx
mov eax , 344
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRenameKey ENDP
; ULONG64 __stdcall NtRenameTransactionManager( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRenameTransactionManager PROC STDCALL
mov r10 , rcx
mov eax , 345
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRenameTransactionManager ENDP
; ULONG64 __stdcall NtReplaceKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtReplaceKey PROC STDCALL
mov r10 , rcx
mov eax , 346
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReplaceKey ENDP
; ULONG64 __stdcall NtReplacePartitionUnit( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtReplacePartitionUnit PROC STDCALL
mov r10 , rcx
mov eax , 347
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReplacePartitionUnit ENDP
; ULONG64 __stdcall NtReplyWaitReplyPort( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtReplyWaitReplyPort PROC STDCALL
mov r10 , rcx
mov eax , 348
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtReplyWaitReplyPort ENDP
; ULONG64 __stdcall NtRequestPort( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRequestPort PROC STDCALL
mov r10 , rcx
mov eax , 349
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRequestPort ENDP
; ULONG64 __stdcall NtResetEvent( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtResetEvent PROC STDCALL
mov r10 , rcx
mov eax , 350
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtResetEvent ENDP
; ULONG64 __stdcall NtResetWriteWatch( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtResetWriteWatch PROC STDCALL
mov r10 , rcx
mov eax , 351
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtResetWriteWatch ENDP
; ULONG64 __stdcall NtRestoreKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtRestoreKey PROC STDCALL
mov r10 , rcx
mov eax , 352
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRestoreKey ENDP
; ULONG64 __stdcall NtResumeProcess( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtResumeProcess PROC STDCALL
mov r10 , rcx
mov eax , 353
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtResumeProcess ENDP
; ULONG64 __stdcall NtRevertContainerImpersonation( );
_10_0_10240_sp0_windows_10_th1_1507_NtRevertContainerImpersonation PROC STDCALL
mov r10 , rcx
mov eax , 354
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRevertContainerImpersonation ENDP
; ULONG64 __stdcall NtRollbackComplete( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRollbackComplete PROC STDCALL
mov r10 , rcx
mov eax , 355
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRollbackComplete ENDP
; ULONG64 __stdcall NtRollbackEnlistment( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRollbackEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 356
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRollbackEnlistment ENDP
; ULONG64 __stdcall NtRollbackTransaction( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRollbackTransaction PROC STDCALL
mov r10 , rcx
mov eax , 357
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRollbackTransaction ENDP
; ULONG64 __stdcall NtRollforwardTransactionManager( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtRollforwardTransactionManager PROC STDCALL
mov r10 , rcx
mov eax , 358
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtRollforwardTransactionManager ENDP
; ULONG64 __stdcall NtSaveKey( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSaveKey PROC STDCALL
mov r10 , rcx
mov eax , 359
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSaveKey ENDP
; ULONG64 __stdcall NtSaveKeyEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtSaveKeyEx PROC STDCALL
mov r10 , rcx
mov eax , 360
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSaveKeyEx ENDP
; ULONG64 __stdcall NtSaveMergedKeys( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtSaveMergedKeys PROC STDCALL
mov r10 , rcx
mov eax , 361
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSaveMergedKeys ENDP
; ULONG64 __stdcall NtSecureConnectPort( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 , ULONG64 arg_08 , ULONG64 arg_09 );
_10_0_10240_sp0_windows_10_th1_1507_NtSecureConnectPort PROC STDCALL
mov r10 , rcx
mov eax , 362
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSecureConnectPort ENDP
; ULONG64 __stdcall NtSerializeBoot( );
_10_0_10240_sp0_windows_10_th1_1507_NtSerializeBoot PROC STDCALL
mov r10 , rcx
mov eax , 363
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSerializeBoot ENDP
; ULONG64 __stdcall NtSetBootEntryOrder( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetBootEntryOrder PROC STDCALL
mov r10 , rcx
mov eax , 364
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetBootEntryOrder ENDP
; ULONG64 __stdcall NtSetBootOptions( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetBootOptions PROC STDCALL
mov r10 , rcx
mov eax , 365
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetBootOptions ENDP
; ULONG64 __stdcall NtSetCachedSigningLevel( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetCachedSigningLevel PROC STDCALL
mov r10 , rcx
mov eax , 366
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetCachedSigningLevel ENDP
; ULONG64 __stdcall NtSetContextThread( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetContextThread PROC STDCALL
mov r10 , rcx
mov eax , 367
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetContextThread ENDP
; ULONG64 __stdcall NtSetDebugFilterState( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetDebugFilterState PROC STDCALL
mov r10 , rcx
mov eax , 368
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetDebugFilterState ENDP
; ULONG64 __stdcall NtSetDefaultHardErrorPort( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetDefaultHardErrorPort PROC STDCALL
mov r10 , rcx
mov eax , 369
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetDefaultHardErrorPort ENDP
; ULONG64 __stdcall NtSetDefaultLocale( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetDefaultLocale PROC STDCALL
mov r10 , rcx
mov eax , 370
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetDefaultLocale ENDP
; ULONG64 __stdcall NtSetDefaultUILanguage( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetDefaultUILanguage PROC STDCALL
mov r10 , rcx
mov eax , 371
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetDefaultUILanguage ENDP
; ULONG64 __stdcall NtSetDriverEntryOrder( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetDriverEntryOrder PROC STDCALL
mov r10 , rcx
mov eax , 372
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetDriverEntryOrder ENDP
; ULONG64 __stdcall NtSetEaFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetEaFile PROC STDCALL
mov r10 , rcx
mov eax , 373
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetEaFile ENDP
; ULONG64 __stdcall NtSetHighEventPair( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetHighEventPair PROC STDCALL
mov r10 , rcx
mov eax , 374
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetHighEventPair ENDP
; ULONG64 __stdcall NtSetHighWaitLowEventPair( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetHighWaitLowEventPair PROC STDCALL
mov r10 , rcx
mov eax , 375
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetHighWaitLowEventPair ENDP
; ULONG64 __stdcall NtSetIRTimer( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetIRTimer PROC STDCALL
mov r10 , rcx
mov eax , 376
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetIRTimer ENDP
; ULONG64 __stdcall NtSetInformationDebugObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationDebugObject PROC STDCALL
mov r10 , rcx
mov eax , 377
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationDebugObject ENDP
; ULONG64 __stdcall NtSetInformationEnlistment( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationEnlistment PROC STDCALL
mov r10 , rcx
mov eax , 378
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationEnlistment ENDP
; ULONG64 __stdcall NtSetInformationJobObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationJobObject PROC STDCALL
mov r10 , rcx
mov eax , 379
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationJobObject ENDP
; ULONG64 __stdcall NtSetInformationKey( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationKey PROC STDCALL
mov r10 , rcx
mov eax , 380
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationKey ENDP
; ULONG64 __stdcall NtSetInformationResourceManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationResourceManager PROC STDCALL
mov r10 , rcx
mov eax , 381
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationResourceManager ENDP
; ULONG64 __stdcall NtSetInformationSymbolicLink( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationSymbolicLink PROC STDCALL
mov r10 , rcx
mov eax , 382
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationSymbolicLink ENDP
; ULONG64 __stdcall NtSetInformationToken( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationToken PROC STDCALL
mov r10 , rcx
mov eax , 383
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationToken ENDP
; ULONG64 __stdcall NtSetInformationTransaction( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationTransaction PROC STDCALL
mov r10 , rcx
mov eax , 384
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationTransaction ENDP
; ULONG64 __stdcall NtSetInformationTransactionManager( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationTransactionManager PROC STDCALL
mov r10 , rcx
mov eax , 385
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationTransactionManager ENDP
; ULONG64 __stdcall NtSetInformationVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 386
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationVirtualMemory ENDP
; ULONG64 __stdcall NtSetInformationWorkerFactory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationWorkerFactory PROC STDCALL
mov r10 , rcx
mov eax , 387
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetInformationWorkerFactory ENDP
; ULONG64 __stdcall NtSetIntervalProfile( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetIntervalProfile PROC STDCALL
mov r10 , rcx
mov eax , 388
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetIntervalProfile ENDP
; ULONG64 __stdcall NtSetIoCompletion( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetIoCompletion PROC STDCALL
mov r10 , rcx
mov eax , 389
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetIoCompletion ENDP
; ULONG64 __stdcall NtSetIoCompletionEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetIoCompletionEx PROC STDCALL
mov r10 , rcx
mov eax , 390
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetIoCompletionEx ENDP
; ULONG64 __stdcall NtSetLdtEntries( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetLdtEntries PROC STDCALL
mov r10 , rcx
mov eax , 391
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetLdtEntries ENDP
; ULONG64 __stdcall NtSetLowEventPair( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetLowEventPair PROC STDCALL
mov r10 , rcx
mov eax , 392
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetLowEventPair ENDP
; ULONG64 __stdcall NtSetLowWaitHighEventPair( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetLowWaitHighEventPair PROC STDCALL
mov r10 , rcx
mov eax , 393
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetLowWaitHighEventPair ENDP
; ULONG64 __stdcall NtSetQuotaInformationFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetQuotaInformationFile PROC STDCALL
mov r10 , rcx
mov eax , 394
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetQuotaInformationFile ENDP
; ULONG64 __stdcall NtSetSecurityObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetSecurityObject PROC STDCALL
mov r10 , rcx
mov eax , 395
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetSecurityObject ENDP
; ULONG64 __stdcall NtSetSystemEnvironmentValue( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemEnvironmentValue PROC STDCALL
mov r10 , rcx
mov eax , 396
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemEnvironmentValue ENDP
; ULONG64 __stdcall NtSetSystemEnvironmentValueEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemEnvironmentValueEx PROC STDCALL
mov r10 , rcx
mov eax , 397
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemEnvironmentValueEx ENDP
; ULONG64 __stdcall NtSetSystemInformation( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemInformation PROC STDCALL
mov r10 , rcx
mov eax , 398
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemInformation ENDP
; ULONG64 __stdcall NtSetSystemPowerState( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemPowerState PROC STDCALL
mov r10 , rcx
mov eax , 399
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemPowerState ENDP
; ULONG64 __stdcall NtSetSystemTime( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemTime PROC STDCALL
mov r10 , rcx
mov eax , 400
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetSystemTime ENDP
; ULONG64 __stdcall NtSetThreadExecutionState( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetThreadExecutionState PROC STDCALL
mov r10 , rcx
mov eax , 401
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetThreadExecutionState ENDP
; ULONG64 __stdcall NtSetTimer2( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimer2 PROC STDCALL
mov r10 , rcx
mov eax , 402
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimer2 ENDP
; ULONG64 __stdcall NtSetTimerEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimerEx PROC STDCALL
mov r10 , rcx
mov eax , 403
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimerEx ENDP
; ULONG64 __stdcall NtSetTimerResolution( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimerResolution PROC STDCALL
mov r10 , rcx
mov eax , 404
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetTimerResolution ENDP
; ULONG64 __stdcall NtSetUuidSeed( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetUuidSeed PROC STDCALL
mov r10 , rcx
mov eax , 405
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetUuidSeed ENDP
; ULONG64 __stdcall NtSetVolumeInformationFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetVolumeInformationFile PROC STDCALL
mov r10 , rcx
mov eax , 406
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetVolumeInformationFile ENDP
; ULONG64 __stdcall NtSetWnfProcessNotificationEvent( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSetWnfProcessNotificationEvent PROC STDCALL
mov r10 , rcx
mov eax , 407
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSetWnfProcessNotificationEvent ENDP
; ULONG64 __stdcall NtShutdownSystem( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtShutdownSystem PROC STDCALL
mov r10 , rcx
mov eax , 408
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtShutdownSystem ENDP
; ULONG64 __stdcall NtShutdownWorkerFactory( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtShutdownWorkerFactory PROC STDCALL
mov r10 , rcx
mov eax , 409
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtShutdownWorkerFactory ENDP
; ULONG64 __stdcall NtSignalAndWaitForSingleObject( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSignalAndWaitForSingleObject PROC STDCALL
mov r10 , rcx
mov eax , 410
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSignalAndWaitForSingleObject ENDP
; ULONG64 __stdcall NtSinglePhaseReject( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSinglePhaseReject PROC STDCALL
mov r10 , rcx
mov eax , 411
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSinglePhaseReject ENDP
; ULONG64 __stdcall NtStartProfile( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtStartProfile PROC STDCALL
mov r10 , rcx
mov eax , 412
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtStartProfile ENDP
; ULONG64 __stdcall NtStopProfile( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtStopProfile PROC STDCALL
mov r10 , rcx
mov eax , 413
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtStopProfile ENDP
; ULONG64 __stdcall NtSubscribeWnfStateChange( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtSubscribeWnfStateChange PROC STDCALL
mov r10 , rcx
mov eax , 414
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSubscribeWnfStateChange ENDP
; ULONG64 __stdcall NtSuspendProcess( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtSuspendProcess PROC STDCALL
mov r10 , rcx
mov eax , 415
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSuspendProcess ENDP
; ULONG64 __stdcall NtSuspendThread( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtSuspendThread PROC STDCALL
mov r10 , rcx
mov eax , 416
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSuspendThread ENDP
; ULONG64 __stdcall NtSystemDebugControl( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtSystemDebugControl PROC STDCALL
mov r10 , rcx
mov eax , 417
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtSystemDebugControl ENDP
; ULONG64 __stdcall NtTerminateJobObject( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtTerminateJobObject PROC STDCALL
mov r10 , rcx
mov eax , 418
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtTerminateJobObject ENDP
; ULONG64 __stdcall NtTestAlert( );
_10_0_10240_sp0_windows_10_th1_1507_NtTestAlert PROC STDCALL
mov r10 , rcx
mov eax , 419
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtTestAlert ENDP
; ULONG64 __stdcall NtThawRegistry( );
_10_0_10240_sp0_windows_10_th1_1507_NtThawRegistry PROC STDCALL
mov r10 , rcx
mov eax , 420
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtThawRegistry ENDP
; ULONG64 __stdcall NtThawTransactions( );
_10_0_10240_sp0_windows_10_th1_1507_NtThawTransactions PROC STDCALL
mov r10 , rcx
mov eax , 421
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtThawTransactions ENDP
; ULONG64 __stdcall NtTraceControl( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 );
_10_0_10240_sp0_windows_10_th1_1507_NtTraceControl PROC STDCALL
mov r10 , rcx
mov eax , 422
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtTraceControl ENDP
; ULONG64 __stdcall NtTranslateFilePath( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtTranslateFilePath PROC STDCALL
mov r10 , rcx
mov eax , 423
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtTranslateFilePath ENDP
; ULONG64 __stdcall NtUmsThreadYield( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtUmsThreadYield PROC STDCALL
mov r10 , rcx
mov eax , 424
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUmsThreadYield ENDP
; ULONG64 __stdcall NtUnloadDriver( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadDriver PROC STDCALL
mov r10 , rcx
mov eax , 425
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadDriver ENDP
; ULONG64 __stdcall NtUnloadKey( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadKey PROC STDCALL
mov r10 , rcx
mov eax , 426
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadKey ENDP
; ULONG64 __stdcall NtUnloadKey2( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadKey2 PROC STDCALL
mov r10 , rcx
mov eax , 427
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadKey2 ENDP
; ULONG64 __stdcall NtUnloadKeyEx( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadKeyEx PROC STDCALL
mov r10 , rcx
mov eax , 428
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnloadKeyEx ENDP
; ULONG64 __stdcall NtUnlockFile( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnlockFile PROC STDCALL
mov r10 , rcx
mov eax , 429
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnlockFile ENDP
; ULONG64 __stdcall NtUnlockVirtualMemory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnlockVirtualMemory PROC STDCALL
mov r10 , rcx
mov eax , 430
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnlockVirtualMemory ENDP
; ULONG64 __stdcall NtUnmapViewOfSectionEx( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnmapViewOfSectionEx PROC STDCALL
mov r10 , rcx
mov eax , 431
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnmapViewOfSectionEx ENDP
; ULONG64 __stdcall NtUnsubscribeWnfStateChange( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtUnsubscribeWnfStateChange PROC STDCALL
mov r10 , rcx
mov eax , 432
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUnsubscribeWnfStateChange ENDP
; ULONG64 __stdcall NtUpdateWnfStateData( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 , ULONG64 arg_06 , ULONG64 arg_07 );
_10_0_10240_sp0_windows_10_th1_1507_NtUpdateWnfStateData PROC STDCALL
mov r10 , rcx
mov eax , 433
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtUpdateWnfStateData ENDP
; ULONG64 __stdcall NtVdmControl( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtVdmControl PROC STDCALL
mov r10 , rcx
mov eax , 434
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtVdmControl ENDP
; ULONG64 __stdcall NtWaitForAlertByThreadId( ULONG64 arg_01 , ULONG64 arg_02 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForAlertByThreadId PROC STDCALL
mov r10 , rcx
mov eax , 435
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForAlertByThreadId ENDP
; ULONG64 __stdcall NtWaitForDebugEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForDebugEvent PROC STDCALL
mov r10 , rcx
mov eax , 436
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForDebugEvent ENDP
; ULONG64 __stdcall NtWaitForKeyedEvent( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForKeyedEvent PROC STDCALL
mov r10 , rcx
mov eax , 437
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForKeyedEvent ENDP
; ULONG64 __stdcall NtWaitForWorkViaWorkerFactory( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ULONG64 arg_04 , ULONG64 arg_05 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForWorkViaWorkerFactory PROC STDCALL
mov r10 , rcx
mov eax , 438
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitForWorkViaWorkerFactory ENDP
; ULONG64 __stdcall NtWaitHighEventPair( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitHighEventPair PROC STDCALL
mov r10 , rcx
mov eax , 439
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitHighEventPair ENDP
; ULONG64 __stdcall NtWaitLowEventPair( ULONG64 arg_01 );
_10_0_10240_sp0_windows_10_th1_1507_NtWaitLowEventPair PROC STDCALL
mov r10 , rcx
mov eax , 440
;syscall
db 0Fh , 05h
ret
_10_0_10240_sp0_windows_10_th1_1507_NtWaitLowEventPair ENDP
|
test/interaction/Issue3678.agda | cruhland/agda | 1,989 | 9227 | <filename>test/interaction/Issue3678.agda
-- Two out-of-scope variables are given the same name #3678
open import Agda.Builtin.Sigma
open import Agda.Builtin.Equality
postulate
A : Set
B : A → Set
a : A
Pi : (A → Set) → Set
Pi B = {x : A} → B x
foo : Pi \ y → Σ (B y) \ _ → Pi \ z → Σ (y ≡ a → B z) \ _ → B y → B z → A
foo = {!!} , (\ { refl → {!!} }) , {!!}
-- Expected:
-- ...
-- ?2 : B x₁ → B x₂ → A (not the same name for these variables)
|
Nehemiah/Change/Value.agda | inc-lc/ilc-agda | 10 | 3807 | <filename>Nehemiah/Change/Value.agda
------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- The values of terms in Nehemiah.Change.Term.
------------------------------------------------------------------------
module Nehemiah.Change.Value where
open import Nehemiah.Syntax.Type
open import Nehemiah.Syntax.Term
open import Nehemiah.Denotation.Value
open import Data.Integer
open import Structure.Bag.Nehemiah
import Parametric.Change.Value Const ⟦_⟧Base ΔBase as ChangeValue
⟦apply-base⟧ : ChangeValue.ApplyStructure
⟦apply-base⟧ base-int n Δn = n + Δn
⟦apply-base⟧ base-bag b Δb = b ++ Δb
⟦diff-base⟧ : ChangeValue.DiffStructure
⟦diff-base⟧ base-int m n = m - n
⟦diff-base⟧ base-bag a b = a \\ b
⟦nil-base⟧ : ChangeValue.NilStructure
⟦nil-base⟧ base-int n = + 0
⟦nil-base⟧ base-bag b = emptyBag
open ChangeValue.Structure ⟦apply-base⟧ ⟦diff-base⟧ ⟦nil-base⟧ public
|
programs/oeis/111/A111406.asm | karttu/loda | 0 | 99465 | ; A111406: a(n) = f(f(n+1)) - f(f(n)), where f(m) = pi(m) = A000720(m), with f(0) = 0.
; 0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0
cal $0,78442 ; a(p) = a(n) + 1 if p is the n-th prime, prime(n); a(n)=0 if n is not prime.
mov $2,3
lpb $0,1
mov $1,$2
mov $5,$2
lpb $5,1
mov $4,$5
lpb $4,1
lpb $4,1
mul $0,$5
sub $4,1
trn $5,$2
lpe
cmp $3,0
add $0,$3
lpe
sub $4,4
lpe
sub $4,3
lpe
sub $1,$4
div $1,8
|
test/maths/maths.adb | Fabien-Chouteau/sdlada | 89 | 13155 | <reponame>Fabien-Chouteau/sdlada
package body Maths is
function Add (A, B : in Integer) return Integer is
begin
return A + B;
end Add;
end Maths;
|
tests/syntax_examples/src/basic_subprogram_calls-f_internal.adb | TNO/Dependency_Graph_Extractor-Ada | 1 | 6284 | separate(Basic_Subprogram_Calls)
function F_Internal return Integer is
begin
return F10;
end F_Internal;
|
Transynther/x86/_processed/NONE/_zr_/i3-7100_9_0x84_notsx.log_21829_1063.asm | ljhsiun2/medusa | 9 | 101359 | .global s_prepare_buffers
s_prepare_buffers:
push %r8
push %r9
push %rax
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x13f2b, %rax
nop
nop
dec %r9
mov (%rax), %rcx
and %r8, %r8
lea addresses_D_ht+0x1295b, %rsi
lea addresses_D_ht+0xacc7, %rdi
clflush (%rsi)
nop
cmp %rbp, %rbp
mov $51, %rcx
rep movsb
sub %r8, %r8
lea addresses_WT_ht+0xa2ab, %rdi
clflush (%rdi)
nop
xor $63820, %rcx
mov (%rdi), %r9d
nop
nop
nop
nop
and %rcx, %rcx
lea addresses_normal_ht+0x9ab, %rbp
nop
inc %rcx
movl $0x61626364, (%rbp)
nop
nop
and %r8, %r8
lea addresses_WT_ht+0x12d2b, %rsi
clflush (%rsi)
sub $29093, %rcx
mov $0x6162636465666768, %rbp
movq %rbp, %xmm7
vmovups %ymm7, (%rsi)
nop
inc %rsi
lea addresses_UC_ht+0x672b, %r9
nop
nop
nop
sub %rcx, %rcx
vmovups (%r9), %ymm2
vextracti128 $1, %ymm2, %xmm2
vpextrq $1, %xmm2, %rdi
nop
nop
inc %r9
lea addresses_A_ht+0x532b, %rcx
nop
nop
sub $5145, %rax
vmovups (%rcx), %ymm7
vextracti128 $0, %ymm7, %xmm7
vpextrq $0, %xmm7, %rsi
nop
and $1657, %rsi
lea addresses_D_ht+0xa23b, %rsi
lea addresses_normal_ht+0x11667, %rdi
clflush (%rdi)
add %rbx, %rbx
mov $50, %rcx
rep movsb
sub $49191, %rcx
lea addresses_UC_ht+0x1b2b, %rdi
nop
nop
nop
xor %rax, %rax
vmovups (%rdi), %ymm3
vextracti128 $1, %ymm3, %xmm3
vpextrq $0, %xmm3, %r9
nop
nop
nop
nop
nop
xor %rsi, %rsi
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %rax
pop %r9
pop %r8
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r13
push %r15
push %r8
push %rax
push %rbp
push %rbx
// Store
mov $0x2a3, %rbp
nop
nop
nop
nop
dec %r13
mov $0x5152535455565758, %r11
movq %r11, (%rbp)
nop
sub $12591, %r11
// Store
lea addresses_PSE+0x971, %r15
nop
nop
nop
dec %r13
mov $0x5152535455565758, %rax
movq %rax, (%r15)
nop
nop
nop
nop
nop
and %r15, %r15
// Faulty Load
lea addresses_A+0x972b, %r8
nop
nop
sub %rbx, %rbx
mov (%r8), %r13w
lea oracles, %r11
and $0xff, %r13
shlq $12, %r13
mov (%r11,%r13,1), %r13
pop %rbx
pop %rbp
pop %rax
pop %r8
pop %r15
pop %r13
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_A', 'same': False, 'size': 2, 'congruent': 0, 'NT': False, 'AVXalign': True}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_P', 'same': False, 'size': 8, 'congruent': 3, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_PSE', 'same': False, 'size': 8, 'congruent': 1, 'NT': True, 'AVXalign': False}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'type': 'addresses_A', 'same': True, 'size': 2, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_WC_ht', 'same': False, 'size': 8, 'congruent': 9, 'NT': False, 'AVXalign': True}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_D_ht', 'congruent': 4, 'same': False}, 'dst': {'type': 'addresses_D_ht', 'congruent': 2, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_WT_ht', 'same': False, 'size': 4, 'congruent': 4, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_normal_ht', 'same': False, 'size': 4, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 32, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 32, 'congruent': 11, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_A_ht', 'same': False, 'size': 32, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_D_ht', 'congruent': 1, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 2, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 32, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'00': 21829}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
Source/Api/EtAlii.Ubigia.Api.Functional.Antlr/ScriptParser.g4 | vrenken/EtAlii.Ubigia | 2 | 1128 | <reponame>vrenken/EtAlii.Ubigia<filename>Source/Api/EtAlii.Ubigia.Api.Functional.Antlr/ScriptParser.g4<gh_stars>1-10
parser grammar ScriptParser;
@header {
#pragma warning disable CS0115 // CS0115: no suitable method found to override
#pragma warning disable CS3021 // CS3021: The CLSCompliant attribute is not needed because the assembly does not have a CLSCompliant attribute
// ReSharper disable InvalidXmlDocComment
// ReSharper disable all
}
options {
language = CSharp;
tokenVocab = UbigiaLexer;
}
import Primitives, PathParser ;
script: (WHITESPACE | NEWLINE)* (sequence WHITESPACE* NEWLINE+ (WHITESPACE | NEWLINE)*)+ (WHITESPACE | NEWLINE)* EOF;
comment : WHITESPACE* COMMENT ;
sequence
: subject_operator_pair+ subject_optional? comment? #sequence_pattern_1
| operator_subject_pair+ operator_optional? comment? #sequence_pattern_2
| subject comment? #sequence_pattern_3
| comment #sequence_pattern_4
;
subject_operator_pair : subject operator ;
operator_subject_pair : operator subject ;
subject_optional : subject ;
operator_optional : operator ;
operator_assign : WHITESPACE* LCHEVR EQUALS WHITESPACE* ;
operator_add : WHITESPACE* PLUS EQUALS WHITESPACE* ;
operator_remove : WHITESPACE* MINUS EQUALS WHITESPACE* ;
operator
: operator_assign
| operator_add
| operator_remove
;
subject
: subject_root
| subject_function
| subject_constant_string
| subject_constant_object
| subject_root_definition
| subject_rooted_path
| subject_non_rooted_path
| subject_variable
;
subject_non_rooted_path : non_rooted_path ;
subject_rooted_path : rooted_path ;
subject_constant_object : object_value ;
subject_constant_string : string_quoted ;
subject_root : ROOT_SUBJECT_PREFIX COLON identifier;
subject_variable : DOLLAR identifier ;
subject_root_definition : identifier (DOT identifier)+ ;
// Functions.
subject_function
: identifier WHITESPACE* LPAREN WHITESPACE* RPAREN WHITESPACE*
| identifier WHITESPACE* LPAREN (WHITESPACE* subject_function_argument WHITESPACE* COMMA WHITESPACE*)*? subject_function_argument WHITESPACE* RPAREN WHITESPACE*
;
subject_function_argument
: subject_function_argument_string_quoted
| subject_function_argument_identifier
//| subject_function_argument_value
| subject_function_argument_variable
| subject_function_argument_rooted_path
| subject_function_argument_non_rooted_path
;
subject_function_argument_identifier : identifier ;
subject_function_argument_string_quoted : string_quoted ;
subject_function_argument_variable : DOLLAR identifier ;
subject_function_argument_non_rooted_path : path_part+ ;
subject_function_argument_rooted_path : identifier COLON path_part*;
// This one should replace both the identifier and string_quoted argument:
//subject_function_argument_value
// : string_quoted
// | string_quoted_non_empty
// | datetime
// | timespan
// | float_literal
// | float_literal_unsigned
// | integer_literal
// | integer_literal_unsigned
// | boolean_literal
// ;
|
source/nodes/program-nodes-string_literals.adb | optikos/oasis | 0 | 27581 | -- Copyright (c) 2019 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.String_Literals is
function Create
(String_Literal_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return String_Literal is
begin
return Result : String_Literal :=
(String_Literal_Token => String_Literal_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_String_Literal is
begin
return Result : Implicit_String_Literal :=
(Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function String_Literal_Token
(Self : String_Literal)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.String_Literal_Token;
end String_Literal_Token;
overriding function Image (Self : String_Literal) return Text is
begin
return Self.String_Literal_Token.Image;
end Image;
overriding function Is_Part_Of_Implicit
(Self : Implicit_String_Literal)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_String_Literal)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_String_Literal)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
overriding function Image (Self : Implicit_String_Literal) return Text is
pragma Unreferenced (Self);
begin
return "";
end Image;
procedure Initialize (Self : aliased in out Base_String_Literal'Class) is
begin
null;
end Initialize;
overriding function Is_String_Literal_Element
(Self : Base_String_Literal)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_String_Literal_Element;
overriding function Is_Expression_Element
(Self : Base_String_Literal)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Expression_Element;
overriding procedure Visit
(Self : not null access Base_String_Literal;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.String_Literal (Self);
end Visit;
overriding function To_String_Literal_Text
(Self : aliased in out String_Literal)
return Program.Elements.String_Literals.String_Literal_Text_Access is
begin
return Self'Unchecked_Access;
end To_String_Literal_Text;
overriding function To_String_Literal_Text
(Self : aliased in out Implicit_String_Literal)
return Program.Elements.String_Literals.String_Literal_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_String_Literal_Text;
end Program.Nodes.String_Literals;
|
kernel/net/arp.asm | ssebs/xos | 15 | 104064 | <gh_stars>10-100
;; xOS32
;; Copyright (C) 2016-2017 by <NAME>.
use32
; Address Resolution Protocol..
ARP_PROTOCOL_TYPE = 0x0806
ARP_REQUEST = 0x0001
ARP_REPLY = 0x0002
; arp_gratuitous:
; Sends a gratuitous ARP request
arp_gratuitous:
cmp [network_available], 0
je .done
mov ecx, 8192
call kmalloc
mov [.packet], eax
mov edi, [.packet]
mov ax, 0x0001
xchg al, ah
stosw ; hardware type - ethernet
mov ax, IP_PROTOCOL_TYPE
xchg al, ah
stosw ; IP protocol
mov al, 6 ; MAC address size
stosb
mov al, 4 ; IP address size
stosb
mov ax, ARP_REQUEST
xchg al, ah
stosw ; opcode
; sender MAC address, that's us
mov esi, my_mac
mov ecx, 6
rep movsb
; my IP address
mov esi, my_ip
movsd
; target MAC address - broadcast
mov esi, broadcast_mac
mov ecx, 6
rep movsb
; target IP address -- it's us again
mov esi, my_ip
movsd
sub edi, [.packet]
mov [.packet_size], edi
; send the packet
mov ebx, broadcast_mac
mov ecx, [.packet_size]
mov dx, ARP_PROTOCOL_TYPE ; type of packet
mov esi, [.packet]
call net_send
push eax
mov eax, [.packet]
call kfree
pop eax
.done:
ret
align 4
.packet dd 0
.packet_size dd 0
; arp_request:
; Gets the MAC address from an IP address
; In\ EAX = IP address
; In\ EDI = 6-byte buffer to store MAC address
; Out\ EAX = 0 on success, EDI filled
arp_request:
cmp [network_available], 0
je .error
mov [.ip], eax
mov [.buffer], edi
mov ecx, 8192
call kmalloc
mov [.packet], eax
mov edi, [.packet]
mov ax, 0x0001
xchg al, ah
stosw ; hardware type - ethernet
mov ax, IP_PROTOCOL_TYPE
xchg al, ah
stosw ; IP protocol
mov al, 6 ; MAC address size
stosb
mov al, 4 ; IP address size
stosb
mov ax, ARP_REQUEST
xchg al, ah
stosw ; opcode
; sender MAC address, that's us
mov esi, my_mac
mov ecx, 6
rep movsb
; my IP address
mov esi, my_ip
movsd
; target MAC address - broadcast
mov esi, broadcast_mac
mov ecx, 6
rep movsb
; target IP address, the IP we want
mov eax, [.ip]
stosd
sub edi, [.packet]
mov [.packet_size], edi
; send the packet
mov ebx, broadcast_mac
mov ecx, [.packet_size]
mov dx, ARP_PROTOCOL_TYPE ; type of packet
mov esi, [.packet]
call net_send
cmp eax, 0
jne .error
; clear the buffer
mov edi, [.packet]
mov al, 0
mov ecx, 8192
rep stosb
.receive_start:
; receive a packet in the same buffer
mov [.wait_loops], 0
inc [.packet_count]
cmp [.packet_count], NET_TIMEOUT
jge .error
.receive_loop:
inc [.wait_loops]
cmp [.wait_loops], NET_TIMEOUT
jg .error
mov edi, [.packet]
call net_receive
cmp eax, 0
jne .check_received
jmp .receive_loop
.check_received:
; destination is us?
mov esi, [.packet]
mov edi, my_mac
mov ecx, 6
rep cmpsb
jne .receive_start
; is it an ARP packet?
mov esi, [.packet]
mov ax, [esi+12]
xchg al, ah
cmp ax, ARP_PROTOCOL_TYPE
jne .receive_start
; is it an ARP reply?
add esi, ETHERNET_HEADER_SIZE
mov ax, [esi+6]
xchg al, ah
cmp ax, ARP_REPLY
jne .receive_start
; copy the MAC address
add esi, 8
mov edi, [.buffer]
mov ecx, 6
rep movsb
; finished..
mov eax, [.packet]
call kfree
mov eax, 0
ret
.error:
mov eax, 1
ret
align 4
.packet dd 0
.packet_size dd 0
.ip dd 0
.buffer dd 0
.wait_loops dd 0
.packet_count dd 0
; arp_handle:
; Handles an incoming ARP request
; In\ ESI = Packet
; In\ ECX = Packet total size
; Out\ Nothing
arp_handle:
mov [.packet], esi
mov [.packet_size], ecx
; determine if this packet really is for us
mov esi, [.packet]
add esi, ETHERNET_HEADER_SIZE
mov ax, [esi] ; hardware type
xchg al, ah
cmp ax, 0x0001 ; ethernet?
jne .drop
mov ax, [esi+2] ; protocol type
xchg al, ah
cmp ax, IP_PROTOCOL_TYPE
jne .drop
mov al, [esi+4] ; hardware address length
cmp al, 6 ; MAC length
jne .drop
mov al, [esi+5] ; protocol address length
cmp al, 4 ; IPv4
jne .drop
mov ax, [esi+6] ; opcode
xchg al, ah
cmp ax, ARP_REQUEST
jne .drop
mov eax, [esi+0x18] ; destination IP
cmp eax, [my_ip]
jne .drop
;mov esi, .msg
;call kprint
;mov eax, [.packet_size]
;sub eax, ETHERNET_HEADER_SIZE
;call int_to_string
;call kprint
;mov esi, newline
;call kprint
; okay, someone is asking for the MAC of our IP address
; save their information --
mov esi, [net_buffer]
add esi, 22 ; source MAC
mov edi, .mac
mov ecx, 6
rep movsb
mov esi, [net_buffer]
mov eax, [esi+28] ; source IP
mov [.ip], eax
; -- and give them a reply
; construct an ARP packet
mov edi, [net_buffer]
mov ax, 0x0001 ; hardware type - ethernet
xchg al, ah
stosw
mov ax, IP_PROTOCOL_TYPE ; protocol type - IP
xchg al, ah
stosw
mov al, 6 ; MAC address size
stosb
mov al, 4 ; IP address size
stosb
mov ax, ARP_REPLY
xchg al, ah
stosw ; opcode
; sender MAC address, that's us
mov esi, my_mac
mov ecx, 6
rep movsb
; my IP address
mov esi, my_ip
movsd
; target MAC address, that's whoever sent it to us in the first place
mov esi, .mac
mov ecx, 6
rep movsb
; target IP address, same as above
mov esi, .ip
movsd
sub edi, [net_buffer]
mov [.packet_size], edi
mov ebx, .mac
mov ecx, [.packet_size]
mov dx, ARP_PROTOCOL_TYPE ; type of packet
mov esi, [.packet]
call net_send
ret
.drop:
mov [kprint_type], KPRINT_TYPE_WARNING
mov esi, .drop_msg
call kprint
mov eax, [.packet_size]
sub eax, ETHERNET_HEADER_SIZE
call int_to_string
call kprint
mov esi, newline
call kprint
mov [kprint_type], KPRINT_TYPE_NORMAL
ret
align 4
.packet dd 0
.packet_size dd 0
.ip dd 0
.mac: times 6 db 0
.msg db "net-arp: handle incoming packet with size ",0
.drop_msg db "net-arp: drop incoming packet with size ",0
|
libsrc/_DEVELOPMENT/env/esxdos/z80/__ENV_MKSNAM.asm | jpoikela/z88dk | 640 | 95536 | INCLUDE "config_private.inc"
SECTION bss_env
PUBLIC __ENV_MKSNAM
__ENV_MKSNAM:
defs __ENV_LTMPNAM
|
oeis/195/A195284.asm | neoneye/loda-programs | 11 | 160324 | <reponame>neoneye/loda-programs
; A195284: Decimal expansion of shortest length of segment from side AB through incenter to side AC in right triangle ABC with sidelengths (a,b,c)=(3,4,5); i.e., decimal expansion of 2*sqrt(10)/3.
; Submitted by <NAME>
; 2,1,0,8,1,8,5,1,0,6,7,7,8,9,1,9,5,5,4,6,6,5,9,2,9,0,2,9,6,2,1,8,1,2,3,5,5,8,1,3,0,3,6,7,5,9,5,5,0,1,4,4,5,5,1,2,3,8,3,3,6,5,6,8,5,2,8,3,9,6,2,9,2,4,2,6,1,5,8,8,1,4,2,2,9,4,9,8,7,3,8,9,1,9,5,3,3,5,3,0
add $0,1
seq $0,96484 ; Integer part of the square root of [2n-1]-th decimal repunit.
div $0,5
mod $0,10
|
Cubical/Codata/Everything.agda | limemloh/cubical | 0 | 11579 | {-# OPTIONS --cubical #-}
module Cubical.Codata.Everything where
open import Cubical.Codata.EverythingSafe public
--- Modules making assumptions that might be incompatible with other
-- flags or make use of potentially unsafe features.
-- Assumes --guardedness
open import Cubical.Codata.Stream public
open import Cubical.Codata.Conat public
open import Cubical.Codata.M public
-- Also uses {-# TERMINATING #-}.
open import Cubical.Codata.M.Bisimilarity public
|
projects/batfish/src/main/antlr4/org/batfish/grammar/cisco/Cisco_interface.g4 | sskausik08/Wilco | 0 | 1584 | <gh_stars>0
parser grammar Cisco_interface;
import Cisco_common;
options {
tokenVocab = CiscoLexer;
}
if_autostate
:
NO? AUTOSTATE NEWLINE
;
if_default_gw
:
DEFAULT_GW IP_ADDRESS NEWLINE
;
if_description
:
description_line
;
if_flow_sampler
:
NO? FLOW_SAMPLER variable EGRESS? NEWLINE
;
if_hsrp
:
HSRP group = DEC NEWLINE
(
if_hsrp_ip_address
| if_hsrp_null
| if_hsrp_preempt
| if_hsrp_priority
| if_hsrp_track
)*
;
if_hsrp_ip_address
:
IP ip = IP_ADDRESS NEWLINE
;
if_hsrp_null
:
NO?
(
AUTHENTICATION
| MAC_ADDRESS
| NAME
| TIMERS
) ~NEWLINE* NEWLINE
;
if_hsrp_preempt
:
NO? PREEMPT ~NEWLINE* NEWLINE
;
if_hsrp_priority
:
NO? PRIORITY value = DEC ~NEWLINE* NEWLINE
;
if_hsrp_track
:
NO? TRACK ~NEWLINE* NEWLINE
;
if_ip_access_group
:
(
(
(
IP
| IPV4
) PORT? ACCESS_GROUP
)
|
(
ACCESS_LIST NAME
)
) name = variable
(
EGRESS
| IN
| INGRESS
| OUT
)
(
HARDWARE_COUNT
| OPTIMIZED
)* NEWLINE
;
if_ip_address
:
(
IP
| IPV4
) ADDRESS VIRTUAL?
(
(
ip = IP_ADDRESS subnet = IP_ADDRESS
)
| prefix = IP_PREFIX
)
(
STANDBY standby_address = IP_ADDRESS
)? NEWLINE
;
if_ip_address_dhcp
:
IP ADDRESS DHCP NEWLINE
;
if_ip_address_secondary
:
(
IP
| IPV4
) ADDRESS
(
(
ip = IP_ADDRESS subnet = IP_ADDRESS
)
| prefix = IP_PREFIX
) SECONDARY DHCP_GIADDR? NEWLINE
;
if_ip_dhcp
:
NO? IP DHCP
(
ifdhcp_null
| ifdhcp_relay
)
;
if_ip_helper_address
:
IP HELPER_ADDRESS address = IP_ADDRESS NEWLINE
;
if_ip_inband_access_group
:
IP INBAND ACCESS_GROUP name = variable_permissive NEWLINE
;
if_ip_igmp
:
NO? IP IGMP
(
NEWLINE
| ifigmp_access_group
| ifigmp_null
| ifigmp_static_group
)
;
if_ip_nat_destination
:
IP NAT DESTINATION STATIC IP_ADDRESS ACCESS_LIST acl = variable IP_ADDRESS
NEWLINE
;
if_ip_nat_source
:
IP NAT SOURCE DYNAMIC ACCESS_LIST acl = variable
(
OVERLOAD
|
(
POOL pool = variable
)
)* NEWLINE
;
if_ip_ospf_area
:
IP OSPF procnum = DEC AREA area = DEC NEWLINE
;
if_ip_ospf_cost
:
IP? OSPF COST cost = DEC NEWLINE
;
if_ip_ospf_dead_interval
:
IP OSPF DEAD_INTERVAL seconds = DEC NEWLINE
;
if_ip_ospf_dead_interval_minimal
:
IP OSPF DEAD_INTERVAL MINIMAL HELLO_MULTIPLIER mult = DEC NEWLINE
;
if_ip_ospf_hello_interval
:
IP OSPF HELLO_INTERVAL seconds = DEC NEWLINE
;
if_ip_ospf_passive_interface
:
NO? IP OSPF PASSIVE_INTERFACE NEWLINE
;
if_ip_pim_neighbor_filter
:
IP PIM NEIGHBOR_FILTER acl = variable NEWLINE
;
if_ip_policy
:
IP POLICY ROUTE_MAP name = ~NEWLINE NEWLINE
;
if_ip_proxy_arp
:
NO? IP PROXY_ARP NEWLINE
;
if_ip_router_isis
:
IP ROUTER ISIS NEWLINE
;
if_ip_router_ospf_area
:
IP ROUTER OSPF procnum = DEC AREA area = IP_ADDRESS NEWLINE
;
if_ip_verify
:
IP VERIFY UNICAST
(
(
NOTIFICATION THRESHOLD DEC
)
|
(
REVERSE_PATH ALLOW_SELF_PING? acl = DEC?
)
|
(
SOURCE REACHABLE_VIA
(
ANY
| RX
)
(
ALLOW_DEFAULT
| ALLOW_SELF_PING
| L2_SRC
)* acl = DEC?
)
) NEWLINE
;
if_ip_virtual_router
:
IP VIRTUAL_ROUTER ADDRESS address = IP_ADDRESS NEWLINE
;
if_isis_circuit_type
:
ISIS CIRCUIT_TYPE
(
LEVEL_1
| LEVEL_2_ONLY
| LEVEL_2
) NEWLINE
;
if_isis_enable
:
ISIS ENABLE num = DEC NEWLINE
;
if_isis_hello_interval
:
ISIS HELLO_INTERVAL DEC
(
LEVEL_1
| LEVEL_2
)? NEWLINE
;
if_isis_metric
:
ISIS IPV6? METRIC metric = DEC
(
LEVEL_1
| LEVEL_2
)? NEWLINE
;
if_isis_network
:
ISIS NETWORK POINT_TO_POINT NEWLINE
;
if_isis_passive
:
ISIS PASSIVE NEWLINE
;
if_isis_tag
:
ISIS TAG tag = DEC NEWLINE
;
if_load_interval
:
LOAD_INTERVAL li = DEC NEWLINE
;
if_mtu
:
MTU mtu_size = DEC NEWLINE
;
if_no_ip_address
:
NO IP ADDRESS NEWLINE
;
if_null_block
:
NO?
(
ACTIVE
| AFFINITY
| ANTENNA
| ARP
| ASYNC
| ATM
| AUTHENTICATION
| AUTO
| AUTOROUTE
| BANDWIDTH
| BEACON
| BFD
| BGP_POLICY
| BRIDGE_GROUP
| BUNDLE
| CABLE
| CABLELENGTH
| CARRIER_DELAY
| CDP
| CHANNEL
| CHANNEL_GROUP
| CHANNEL_PROTOCOL
| CLASS
| CLNS
| CLOCK
| COUNTER
| CRC
| CRYPTO
| DAMPENING
| DCB
| DCBX
| DCB_POLICY
| DELAY
| DESTINATION
| DIALER
| DIALER_GROUP
| DFS
| DOWNSTREAM
| DSL
|
(
DSU BANDWIDTH
)
| DUPLEX
| ENABLE
| ENCAPSULATION
| ENCRYPTION
| ETHERNET
| EXIT
| FAIR_QUEUE
| FAST_REROUTE
| FLOW
| FLOW_CONTROL
| FLOWCONTROL
| FORWARDER
| FRAME_RELAY
| FRAMING
| FULL_DUPLEX
| GIG_DEFAULT
| GLBP
| GROUP_RANGE
| H323_GATEWAY
| HALF_DUPLEX
| HARDWARE
| HISTORY
| HOLD_QUEUE
|
(
HSRP
(
BFD
| DELAY
| USE_BIA
| VERSION
)
)
| IGNORE
| INGRESS
|
(
IP
(
ACCOUNTING
| ADDRESS
(
NEGOTIATED
)
| ARP
| BGP
| BROADCAST_ADDRESS
| CGMP
| CONTROL_APPS_USE_MGMT_PORT
| DVMRP
|
(
DIRECTED_BROADCAST
)
| FLOW
| IP_ADDRESS
| IRDP
| LOAD_SHARING
| MROUTE_CACHE
| MTU
| MULTICAST
| MULTICAST_BOUNDARY
|
(
NAT
(
INSIDE
| OUTSIDE
)
)
| NHRP
|
(
OSPF
(
AUTHENTICATION
| AUTHENTICATION_KEY
| BFD
| DEMAND_CIRCUIT
| MESSAGE_DIGEST_KEY
| MTU_IGNORE
| NETWORK
| PRIORITY
| RETRANSMIT_INTERVAL
| TRANSMIT_DELAY
)
)
|
(
PIM
(
BORDER
| BORDER_ROUTER
| BSR_BORDER
| DR_PRIORITY
| HELLO_INTERVAL
| PASSIVE
| QUERY_INTERVAL
| SNOOPING
| SPARSE_DENSE_MODE
| SPARSE_MODE
| SPARSE_MODE_SSM
)
)
| PIM_SPARSE
| PORT_UNREACHABLE
| REDIRECT
| REDIRECTS
| RIP
| ROUTE_CACHE
| RSVP
| SDR
| TCP
| UNNUMBERED
| UNREACHABLES
| VERIFY
| VIRTUAL_REASSEMBLY
| VIRTUAL_ROUTER
| VRF
| WCCP
)
)
|
(
IPV4
(
ICMP
| MTU
| POINT_TO_POINT
| UNNUMBERED
| UNREACHABLES
| VERIFY
)
)
| IPV6
| ISDN
|
(
ISIS
(
AUTHENTICATION
| CSNP_INTERVAL
| DS_HELLO_INTERVAL
| HELLO
| HELLO_INTERVAL
| HELLO_MULTIPLIER
| LSP_INTERVAL
| POINT_TO_POINT
| PROTOCOL
| SMALL_HELLO
| WIDE_METRIC
)
)
| KEEPALIVE
| L2_FILTER
| L2PROTOCOL_TUNNEL
| L2TRANSPORT
| LANE
| LAPB
| LACP
| LINK
| LINK_FAULT_SIGNALING
| LLDP
| LOAD_BALANCING
| LOAD_INTERVAL
| LOGGING
| LOOPBACK
| LRE
| MAC
| MAC_ADDRESS
| MACRO
| MANAGEMENT
| MANAGEMENT_ONLY
| MAP_GROUP
| MDIX
| MEDIA_TYPE
| MEDIUM
| MEMBER
| MINIMUM_LINKS
| MLAG
| MLS
| MOBILITY
| MOP
| MPLS
| NAME
| NAMEIF
| NEGOTIATE
| NEGOTIATION
| NMSP
|
(
NO
(
DESCRIPTION
)
)
|
(
NTP
(
BROADCAST
| DISABLE
| MULTICAST
)
)
| NV
| OPENFLOW
| OPTICAL_MONITOR
| OSPFV3
| PACKET
| PATH_OPTION
| PEAKDETECT
| PEER
| PFC PRIORITY
| PHYSICAL_LAYER
| PLATFORM
| PORT_CHANNEL
| PORT_CHANNEL_PROTOCOL
| PORT_NAME
| PORT_TYPE
| PORTMODE
| POS
| POWER
| POWER_LEVEL
| PPP
| PREEMPT
| PRIORITY
| PRIORITY_FLOW_CONTROL
| PRIORITY_QUEUE
| PVC
| QOS
| QUEUE_MONITOR
| QUEUE_SET
| RANDOM_DETECT
| RATE_LIMIT
| RATE_MODE
| RCV_QUEUE
| REDIRECTS
| REMOTE
| ROUTE_CACHE
| ROUTE_ONLY
| SCRAMBLE
| SECURITY_LEVEL
| SERIAL
| SERVICE
| SERVICE_MODULE
| SERVICE_POLICY
| SFLOW
| SHAPE
| SIGNALLED_BANDWIDTH
| SIGNALLED_NAME
| SONET
| SOURCE
| SPEED
| SPEED_DUPLEX
| SNMP
| SRR_QUEUE
| SSID
| STACK_MIB
| STANDBY
| STATION_ROLE
| STBC
| STORM_CONTROL
|
(
SWITCHPORT
(
BACKUP
| BLOCK
| DOT1Q
| EMPTY
|
(
MODE PRIVATE_VLAN
)
| MONITOR
| NONEGOTIATE
| PORT_SECURITY
| PRIORITY
| TAP
| TOOL
|
(
TRUNK
(
GROUP
| PRUNING
)
)
| VOICE
| VLAN
)
)
| TAG_SWITCHING
| TAGGED
| TAP
| TCAM
| TRANSCEIVER
| TRANSPORT_MODE
| TRUST
| TUNABLE_OPTIC
| TUNNEL
| TX_QUEUE
| UC_TX_QUEUE
| UDLD
| UNTAGGED
| VLT_PEER_LAG
| VMTRACER
| VPC
| VTP
| VXLAN
| WEIGHTING
| WRR_QUEUE
| X25
| XCONNECT
) ~NEWLINE* NEWLINE if_null_inner*
;
if_null_inner
:
NO?
(
ADDRESS
| BACKUP
| BRIDGE_DOMAIN
| DIALER
| ENCAPSULATION
| L2PROTOCOL
| MODE
| PRIORITY
| PROPAGATE
| PROTOCOL
| RECEIVE
| REMOTE_PORTS
| REWRITE
| SATELLITE_FABRIC_LINK
| SERVICE_POLICY
| TRANSMIT
| VIRTUAL_ADDRESS
) ~NEWLINE* NEWLINE
;
if_null_single
:
NO?
(
BCMC_OPTIMIZATION
| JUMBO
| LINKDEBOUNCE
| PHY
| SUPPRESS_ARP
| TRIMODE
| TRUSTED
) ~NEWLINE* NEWLINE
;
if_port_security
:
PORT SECURITY NEWLINE
(
if_port_security_null
)*
;
if_spanning_tree
:
NO? SPANNING_TREE
(
if_st_null
| if_st_portfast
| NEWLINE
)
;
if_st_null
:
(
BPDUFILTER
| BPDUGUARD
| COST
| GUARD
| LINK_TYPE
| MST
| PORT
| PORT_PRIORITY
| PRIORITY
| PROTECT
| RSTP
| VLAN
) ~NEWLINE* NEWLINE
;
if_st_portfast
:
PORTFAST
(
disable = DISABLE
| edge = EDGE
| network = NETWORK
| trunk = TRUNK
)* NEWLINE
;
if_port_security_null
:
NO?
(
AGE
| ENABLE
| MAXIMUM
| SECURE_MAC_ADDRESS
| VIOLATION
) ~NEWLINE* NEWLINE
;
if_shutdown
:
NO?
(
DISABLE
| SHUTDOWN
) FORCE? LAN? NEWLINE
;
if_switchport
:
NO? SWITCHPORT NEWLINE
;
if_switchport_access
:
SWITCHPORT ACCESS VLAN
(
vlan = DEC
| DYNAMIC
) NEWLINE
;
if_switchport_mode
:
SWITCHPORT MODE
(
ACCESS
| DOT1Q_TUNNEL
|
(
DYNAMIC
(
AUTO
| DESIRABLE
)
)
| FEX_FABRIC
| TAP
| TOOL
| TRUNK
) NEWLINE
;
if_switchport_private_vlan_association
:
SWITCHPORT PRIVATE_VLAN ASSOCIATION TRUNK primary_vlan_id = DEC
secondary_vlan_id = DEC NEWLINE
;
if_switchport_private_vlan_host_association
:
SWITCHPORT PRIVATE_VLAN HOST_ASSOCIATION primary_vlan_id = DEC
secondary_vlan_id = DEC NEWLINE
;
if_switchport_private_vlan_mapping
:
SWITCHPORT PRIVATE_VLAN MAPPING TRUNK? primary_vlan_id = DEC
secondary_vlan_list = range NEWLINE
;
if_switchport_trunk_allowed
:
SWITCHPORT TRUNK ALLOWED VLAN ADD? r = range NEWLINE
;
if_switchport_trunk_encapsulation
:
SWITCHPORT TRUNK ENCAPSULATION e = switchport_trunk_encapsulation NEWLINE
;
if_switchport_trunk_native
:
SWITCHPORT TRUNK NATIVE VLAN vlan = DEC NEWLINE
;
if_vrf
:
VRF name = variable NEWLINE
;
if_vrf_forwarding
:
VRF FORWARDING name = variable NEWLINE
;
if_vrf_member
:
VRF MEMBER name = variable NEWLINE
;
if_vrrp
:
VRRP groupnum = DEC
(
ifvrrp_authentication
| ifvrrp_ip
| ifvrrp_ip_secondary
| ifvrrp_preempt
| ifvrrp_priority
)
;
ifdhcp_null
:
(
SMART_RELAY
| SNOOPING
) ~NEWLINE* NEWLINE
;
ifdhcp_relay
:
RELAY
(
ifdhcpr_address
| ifdhcpr_client
| ifdhcpr_null
)
;
ifdhcpr_address
:
ADDRESS address = IP_ADDRESS NEWLINE
;
ifdhcpr_client
:
CLIENT NEWLINE
;
ifdhcpr_null
:
(
INFORMATION
| SUBNET_BROADCAST
) ~NEWLINE* NEWLINE
;
ifigmp_access_group
:
ACCESS_GROUP name = variable NEWLINE
;
ifigmp_null
:
(
GROUP_TIMEOUT
| HOST_PROXY
| LAST_MEMBER_QUERY_COUNT
| LAST_MEMBER_QUERY_INTERVAL
| LAST_MEMBER_QUERY_RESPONSE_TIME
| MULTICAST_STATIC_ONLY
| QUERY_INTERVAL
| QUERY_MAX_RESPONSE_TIME
| QUERY_TIMEOUT
| ROBUSTNESS_VARIABLE
| ROUTER_ALERT
| SNOOPING
| STARTUP_QUERY_COUNT
| STARTUP_QUERY_INTERVAL
| VERSION
) ~NEWLINE* NEWLINE
;
ifigmp_static_group
:
STATIC_GROUP
(
ifigmpsg_acl
| ifigmpsg_null
)
;
ifigmpsg_acl
:
ACL name = variable NEWLINE
;
ifigmpsg_null
:
(
IP_ADDRESS
| RANGE
) ~NEWLINE* NEWLINE
;
ifvrrp_authentication
:
AUTHENTICATION TEXT text = variable_permissive NEWLINE
;
ifvrrp_ip
:
IP ip = IP_ADDRESS NEWLINE
;
ifvrrp_ip_secondary
:
IP ip = IP_ADDRESS SECONDARY NEWLINE
;
ifvrrp_preempt
:
PREEMPT DELAY
(
MINIMUM
| RELOAD
) DEC NEWLINE
;
ifvrrp_priority
:
PRIORITY priority = DEC NEWLINE
;
s_interface
:
INTERFACE PRECONFIGURE? iname = interface_name
(
L2TRANSPORT
| MULTIPOINT
| POINT_TO_POINT
)?
(
NEWLINE
|
{_cadant}?
NEWLINE?
)
(
if_autostate
| if_default_gw
| if_description
| if_flow_sampler
| if_hsrp
| if_ip_proxy_arp
| if_ip_verify
| if_ip_access_group
| if_ip_address
| if_ip_address_dhcp
| if_ip_address_secondary
| if_ip_dhcp
| if_ip_helper_address
| if_ip_inband_access_group
| if_ip_igmp
| if_ip_nat_destination
| if_ip_nat_source
| if_ip_ospf_area
| if_ip_ospf_cost
| if_ip_ospf_dead_interval
| if_ip_ospf_dead_interval_minimal
| if_ip_ospf_hello_interval
| if_ip_ospf_passive_interface
| if_ip_pim_neighbor_filter
| if_ip_policy
| if_ip_router_isis
| if_ip_router_ospf_area
| if_ip_virtual_router
| if_isis_circuit_type
| if_isis_enable
| if_isis_hello_interval
| if_isis_metric
| if_isis_network
| if_isis_passive
| if_isis_tag
| if_load_interval
| if_mtu
| if_no_ip_address
| if_port_security
| if_shutdown
| if_spanning_tree
| if_switchport
| if_switchport_access
| if_switchport_mode
| if_switchport_private_vlan_association
| if_switchport_private_vlan_host_association
| if_switchport_private_vlan_mapping
| if_switchport_trunk_allowed
| if_switchport_trunk_encapsulation
| if_switchport_trunk_native
| if_vrf
| if_vrf_forwarding
| if_vrf_member
| if_vrrp
// do not rearrange items below
| if_null_single
| if_null_block
|
{ !_disableUnrecognized }?
unrecognized_line
)*
;
|
Transynther/x86/_processed/NONE/_xt_sm_/i7-7700_9_0xca_notsx.log_11_526.asm | ljhsiun2/medusa | 9 | 171626 | <gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r8
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WT_ht+0x2ce9, %rsi
lea addresses_WC_ht+0x832d, %rdi
nop
cmp $48077, %r12
mov $83, %rcx
rep movsb
nop
nop
nop
nop
dec %rdx
lea addresses_WC_ht+0xffa9, %r8
nop
add $17775, %rcx
mov $0x6162636465666768, %rdi
movq %rdi, (%r8)
nop
and %rdx, %rdx
lea addresses_A_ht+0x19764, %rsi
lea addresses_UC_ht+0x12f49, %rdi
nop
nop
nop
nop
nop
and $53888, %rbp
mov $111, %rcx
rep movsq
nop
nop
nop
nop
cmp $26350, %rdx
lea addresses_WC_ht+0x23a9, %rbp
nop
nop
nop
sub %rsi, %rsi
movb $0x61, (%rbp)
and %rdx, %rdx
lea addresses_normal_ht+0x6be0, %rcx
nop
nop
add %r12, %r12
and $0xffffffffffffffc0, %rcx
movntdqa (%rcx), %xmm3
vpextrq $1, %xmm3, %rdx
nop
add $739, %rbp
lea addresses_WC_ht+0x90b9, %r12
nop
nop
nop
nop
xor %rdx, %rdx
mov (%r12), %r8
nop
nop
nop
dec %rdi
lea addresses_A_ht+0x15ba9, %r8
clflush (%r8)
nop
sub $35251, %rcx
mov $0x6162636465666768, %rdi
movq %rdi, (%r8)
nop
nop
and %r8, %r8
lea addresses_D_ht+0x151a9, %rsi
lea addresses_WC_ht+0x1bfa9, %rdi
nop
nop
nop
sub $32208, %r11
mov $103, %rcx
rep movsb
nop
nop
nop
nop
xor $59782, %rbp
lea addresses_WT_ht+0x14c10, %rsi
lea addresses_D_ht+0x1b2cd, %rdi
nop
nop
nop
nop
xor %r12, %r12
mov $82, %rcx
rep movsw
nop
nop
inc %rdi
lea addresses_WC_ht+0x55e9, %rdi
nop
nop
nop
add %r11, %r11
movb $0x61, (%rdi)
nop
nop
nop
nop
nop
add %rdi, %rdi
lea addresses_WC_ht+0x2ba9, %rdx
nop
nop
nop
and $5140, %r12
movb (%rdx), %r8b
nop
nop
nop
nop
nop
and %r11, %r11
lea addresses_normal_ht+0x3241, %rbp
nop
sub $2258, %rcx
movw $0x6162, (%rbp)
nop
nop
nop
nop
nop
and $9022, %rdx
lea addresses_A_ht+0x15069, %r12
nop
nop
inc %rdi
mov (%r12), %esi
nop
nop
nop
nop
sub %rdi, %rdi
lea addresses_A_ht+0x108f5, %rbp
nop
cmp $35428, %r12
movb $0x61, (%rbp)
nop
nop
nop
nop
nop
add %rcx, %rcx
lea addresses_D_ht+0xe9ad, %rsi
lea addresses_normal_ht+0x1aaa9, %rdi
nop
nop
nop
nop
add $38447, %r8
mov $85, %rcx
rep movsq
nop
nop
nop
nop
nop
add %rdx, %rdx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbp
pop %r8
pop %r12
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r15
push %r8
push %r9
push %rax
push %rbp
push %rcx
push %rdi
// Store
lea addresses_RW+0xfba9, %rbp
nop
nop
sub $21169, %r15
movb $0x51, (%rbp)
nop
nop
nop
nop
nop
sub %rax, %rax
// Store
lea addresses_A+0x1bba9, %r9
clflush (%r9)
nop
xor %rdi, %rdi
mov $0x5152535455565758, %r15
movq %r15, %xmm1
vmovups %ymm1, (%r9)
nop
nop
nop
nop
and $9072, %rbp
// Load
mov $0x54be00000001a9, %rdi
nop
nop
nop
cmp $28417, %r8
movb (%rdi), %r9b
add $19489, %rcx
// Load
mov $0xc12, %r8
nop
nop
nop
nop
add $32561, %rcx
mov (%r8), %bp
nop
nop
nop
nop
nop
and %rax, %rax
// Store
lea addresses_WC+0xe969, %r9
nop
nop
nop
and %r8, %r8
movw $0x5152, (%r9)
nop
nop
nop
nop
nop
sub %rax, %rax
// Faulty Load
lea addresses_A+0x1bba9, %rbp
nop
nop
nop
sub $37759, %rcx
mov (%rbp), %rax
lea oracles, %r8
and $0xff, %rax
shlq $12, %rax
mov (%r8,%rax,1), %rax
pop %rdi
pop %rcx
pop %rbp
pop %rax
pop %r9
pop %r8
pop %r15
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': True, 'AVXalign': False, 'size': 1, 'congruent': 0, 'same': False, 'type': 'addresses_A'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 11, 'same': False, 'type': 'addresses_RW'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 0, 'same': True, 'type': 'addresses_A'}, 'OP': 'STOR'}
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 8, 'same': False, 'type': 'addresses_NC'}, 'OP': 'LOAD'}
{'src': {'NT': True, 'AVXalign': False, 'size': 2, 'congruent': 0, 'same': False, 'type': 'addresses_P'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 2, 'congruent': 6, 'same': False, 'type': 'addresses_WC'}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'NT': False, 'AVXalign': False, 'size': 8, 'congruent': 0, 'same': True, 'type': 'addresses_A'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'congruent': 2, 'same': False, 'type': 'addresses_WT_ht'}, 'dst': {'congruent': 1, 'same': True, 'type': 'addresses_WC_ht'}, 'OP': 'REPM'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 8, 'congruent': 9, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'STOR'}
{'src': {'congruent': 0, 'same': True, 'type': 'addresses_A_ht'}, 'dst': {'congruent': 5, 'same': False, 'type': 'addresses_UC_ht'}, 'OP': 'REPM'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 1, 'congruent': 11, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'STOR'}
{'src': {'NT': True, 'AVXalign': False, 'size': 16, 'congruent': 0, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'LOAD'}
{'src': {'NT': False, 'AVXalign': False, 'size': 8, 'congruent': 4, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 8, 'congruent': 9, 'same': True, 'type': 'addresses_A_ht'}, 'OP': 'STOR'}
{'src': {'congruent': 9, 'same': False, 'type': 'addresses_D_ht'}, 'dst': {'congruent': 9, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'REPM'}
{'src': {'congruent': 0, 'same': False, 'type': 'addresses_WT_ht'}, 'dst': {'congruent': 2, 'same': False, 'type': 'addresses_D_ht'}, 'OP': 'REPM'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 5, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'STOR'}
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 11, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 2, 'congruent': 3, 'same': True, 'type': 'addresses_normal_ht'}, 'OP': 'STOR'}
{'src': {'NT': False, 'AVXalign': True, 'size': 4, 'congruent': 2, 'same': False, 'type': 'addresses_A_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': True, 'AVXalign': False, 'size': 1, 'congruent': 0, 'same': False, 'type': 'addresses_A_ht'}, 'OP': 'STOR'}
{'src': {'congruent': 0, 'same': False, 'type': 'addresses_D_ht'}, 'dst': {'congruent': 5, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'REPM'}
{'58': 11}
58 58 58 58 58 58 58 58 58 58 58
*/
|
unit_tests/static-tests/common/assert.assertzeropage.success.asm | undisbeliever/untech-engine | 34 | 167352 | <reponame>undisbeliever/untech-engine
architecture wdc65816-strict
include "../../../src/common/assert.inc"
constant a = 0x00
constant b = 0x10
constant c = 0xff
constant d = 0x7e0000
constant e = 0x7e0010
constant f = 0x7e00ff
assertZeroPage(a)
assertZeroPage(b)
assertZeroPage(c)
assertZeroPage(d)
assertZeroPage(e)
assertZeroPage(f)
|
include/bits_types_clockid_t_h.ads | docandrew/troodon | 5 | 13598 | pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with bits_types_h;
package bits_types_clockid_t_h is
-- Clock ID used in clock and timer functions.
subtype clockid_t is bits_types_h.uu_clockid_t; -- /usr/include/bits/types/clockid_t.h:7
end bits_types_clockid_t_h;
|
lib/random/16bit/lib.asm | Turboxray/VDC_display_latch_test | 0 | 26889 | <reponame>Turboxray/VDC_display_latch_test<gh_stars>0
;
; Source: https://codebase64.org/doku.php?id=base:16bit_xorshift_random_generator
; Author: <NAME>
;
;
;..................................................................
;
; You can get 8-bit random numbers in A or 16-bit numbers
; from the zero page addresses. Leaves X/Y unchanged.
random.rnd:
lda random.RNG.hi
lsr a
lda random.RNG.lo
ror a
eor random.RNG.hi
sta random.RNG.hi ; high part of x ^= x << 7 done
ror a ; A has now x >> 9 and high bit comes from low byte
eor random.RNG.lo
sta random.RNG.lo ; x ^= x >> 9 and the low part of x ^= x << 7 done
eor random.RNG.hi
sta random.RNG.hi ; x ^= x << 8 done
rts
|
src/LibraBFT/Impl/Execution/ExecutorTypes/StateComputeResult.agda | LaudateCorpus1/bft-consensus-agda | 4 | 14109 | {- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2021, Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import LibraBFT.ImplShared.Consensus.Types
open import Optics.All
module LibraBFT.Impl.Execution.ExecutorTypes.StateComputeResult where
extensionProof : StateComputeResult → AccumulatorExtensionProof
extensionProof self = AccumulatorExtensionProof∙new (self ^∙ scrObmNumLeaves)
|
screen_splitting/viewport_globals.asm | cainex/c64_playground | 0 | 176037 | <filename>screen_splitting/viewport_globals.asm
map_starts:
.for (var h = 0; h < MAP_HEIGHT; h++) {
.word map+(h*MAP_WIDTH)
}
map_offsets:
.for (var h = 0; h < MAP_HEIGHT; h++) {
.word $0000
}
offset:
.byte $00
offset_y:
.byte $06
key_check_count:
.byte $00
|
data/pokemon/cries.asm | Dev727/ancientplatinum | 0 | 25431 | mon_cry: MACRO
; index, pitch, length
dw \1, \2, \3
ENDM
PokemonCries::
; entries correspond to constants/pokemon_constants.asm
mon_cry CRY_BULBASAUR, $080, $081 ; BULBASAUR
mon_cry CRY_BULBASAUR, $020, $100 ; IVYSAUR
mon_cry CRY_BULBASAUR, $000, $140 ; VENUSAUR
mon_cry CRY_CHARMANDER, $060, $0c0 ; CHARMANDER
mon_cry CRY_CHARMANDER, $020, $0c0 ; CHARMELEON
mon_cry CRY_CHARMANDER, $000, $100 ; CHARIZARD
mon_cry CRY_SQUIRTLE, $060, $0c0 ; SQUIRTLE
mon_cry CRY_SQUIRTLE, $020, $0c0 ; WARTORTLE
mon_cry CRY_BLASTOISE, $000, $100 ; BLASTOISE
mon_cry CRY_CATERPIE, $080, $0a0 ; CATERPIE
mon_cry CRY_METAPOD, $0cc, $081 ; METAPOD
mon_cry CRY_CATERPIE, $077, $0c0 ; BUTTERFREE
mon_cry CRY_WEEDLE, $0ee, $081 ; WEEDLE
mon_cry CRY_BLASTOISE, $0ff, $081 ; KAKUNA
mon_cry CRY_BLASTOISE, $060, $100 ; BEEDRILL
mon_cry CRY_PIDGEY, $0df, $084 ; PIDGEY
mon_cry CRY_PIDGEOTTO, $028, $140 ; PIDGEOTTO
mon_cry CRY_PIDGEOTTO, $011, $17f ; PIDGEOT
mon_cry CRY_RATTATA, $000, $100 ; RATTATA
mon_cry CRY_RATTATA, $020, $17f ; RATICATE
mon_cry CRY_SPEAROW, $000, $100 ; SPEAROW
mon_cry CRY_FEAROW, $040, $120 ; FEAROW
mon_cry CRY_EKANS, $012, $0c0 ; EKANS
mon_cry CRY_EKANS, $0e0, $090 ; ARBOK
mon_cry CRY_BULBASAUR, $0ee, $081 ; PIKACHU
mon_cry CRY_RAICHU, $0ee, $088 ; RAICHU
mon_cry CRY_NIDORAN_M, $020, $0c0 ; SANDSHREW
mon_cry CRY_NIDORAN_M, $0ff, $17f ; SANDSLASH
mon_cry CRY_NIDORAN_F, $000, $100 ; NIDORAN_F
mon_cry CRY_NIDORAN_F, $02c, $160 ; NIDORINA
mon_cry CRY_NIDOQUEEN, $000, $100 ; NIDOQUEEN
mon_cry CRY_NIDORAN_M, $000, $100 ; NIDORAN_M
mon_cry CRY_NIDORAN_M, $02c, $140 ; NIDORINO
mon_cry CRY_RAICHU, $000, $100 ; NIDOKING
mon_cry CRY_CLEFAIRY, $0cc, $081 ; CLEFAIRY
mon_cry CRY_CLEFAIRY, $0aa, $0a0 ; CLEFABLE
mon_cry CRY_VULPIX, $04f, $090 ; VULPIX
mon_cry CRY_VULPIX, $088, $0e0 ; NINETALES
mon_cry CRY_PIDGEY, $0ff, $0b5 ; JIGGLYPUFF
mon_cry CRY_PIDGEY, $068, $0e0 ; WIGGLYTUFF
mon_cry CRY_SQUIRTLE, $0e0, $100 ; ZUBAT
mon_cry CRY_SQUIRTLE, $0fa, $100 ; GOLBAT
mon_cry CRY_ODDISH, $0dd, $081 ; ODDISH
mon_cry CRY_ODDISH, $0aa, $0c0 ; GLOOM
mon_cry CRY_VILEPLUME, $022, $17f ; VILEPLUME
mon_cry CRY_PARAS, $020, $160 ; PARAS
mon_cry CRY_PARAS, $042, $17f ; PARASECT
mon_cry CRY_VENONAT, $044, $0c0 ; VENONAT
mon_cry CRY_VENONAT, $029, $100 ; VENOMOTH
mon_cry CRY_DIGLETT, $0aa, $081 ; DIGLETT
mon_cry CRY_DIGLETT, $02a, $090 ; DUGTRIO
mon_cry CRY_CLEFAIRY, $077, $090 ; MEOWTH
mon_cry CRY_CLEFAIRY, $099, $17f ; PERSIAN
mon_cry CRY_PSYDUCK, $020, $0e0 ; PSYDUCK
mon_cry CRY_PSYDUCK, $0ff, $0c0 ; GOLDUCK
mon_cry CRY_NIDOQUEEN, $0dd, $0e0 ; MANKEY
mon_cry CRY_NIDOQUEEN, $0af, $0c0 ; PRIMEAPE
mon_cry CRY_GROWLITHE, $020, $0c0 ; GROWLITHE
mon_cry CRY_WEEDLE, $000, $100 ; ARCANINE
mon_cry CRY_PIDGEY, $0ff, $17f ; POLIWAG
mon_cry CRY_PIDGEY, $077, $0e0 ; POLIWHIRL
mon_cry CRY_PIDGEY, $000, $17f ; POLIWRATH
mon_cry CRY_METAPOD, $0c0, $081 ; ABRA
mon_cry CRY_METAPOD, $0a8, $140 ; KADABRA
mon_cry CRY_METAPOD, $098, $17f ; ALAKAZAM
mon_cry CRY_GROWLITHE, $0ee, $081 ; MACHOP
mon_cry CRY_GROWLITHE, $048, $0e0 ; MACHOKE
mon_cry CRY_GROWLITHE, $008, $140 ; MACHAMP
mon_cry CRY_PSYDUCK, $055, $081 ; BELLSPROUT
mon_cry CRY_WEEPINBELL, $044, $0a0 ; WEEPINBELL
mon_cry CRY_WEEPINBELL, $066, $14c ; VICTREEBEL
mon_cry CRY_VENONAT, $000, $100 ; TENTACOOL
mon_cry CRY_VENONAT, $0ee, $17f ; TENTACRUEL
mon_cry CRY_VULPIX, $0f0, $090 ; GEODUDE
mon_cry CRY_VULPIX, $000, $100 ; GRAVELER
mon_cry CRY_GOLEM, $0e0, $0c0 ; GOLEM
mon_cry CRY_WEEPINBELL, $000, $100 ; PONYTA
mon_cry CRY_WEEPINBELL, $020, $140 ; RAPIDASH
mon_cry CRY_SLOWPOKE, $000, $100 ; SLOWPOKE
mon_cry CRY_GROWLITHE, $000, $100 ; SLOWBRO
mon_cry CRY_METAPOD, $080, $0e0 ; MAGNEMITE
mon_cry CRY_METAPOD, $020, $140 ; MAGNETON
mon_cry CRY_SPEAROW, $0dd, $081 ; FARFETCH_D
mon_cry CRY_DIGLETT, $0bb, $081 ; DODUO
mon_cry CRY_DIGLETT, $099, $0a0 ; DODRIO
mon_cry CRY_SEEL, $088, $140 ; SEEL
mon_cry CRY_SEEL, $023, $17f ; DEWGONG
mon_cry CRY_GRIMER, $000, $100 ; GRIMER
mon_cry CRY_MUK, $0ef, $17f ; MUK
mon_cry CRY_FEAROW, $000, $100 ; SHELLDER
mon_cry CRY_FEAROW, $06f, $160 ; CLOYSTER
mon_cry CRY_METAPOD, $000, $100 ; GASTLY
mon_cry CRY_METAPOD, $030, $0c0 ; HAUNTER
mon_cry CRY_MUK, $000, $17f ; GENGAR
mon_cry CRY_EKANS, $0ff, $140 ; ONIX
mon_cry CRY_DROWZEE, $088, $0a0 ; DROWZEE
mon_cry CRY_DROWZEE, $0ee, $0c0 ; HYPNO
mon_cry CRY_KRABBY, $020, $160 ; KRABBY
mon_cry CRY_KRABBY, $0ee, $160 ; KINGLER
mon_cry CRY_VOLTORB, $0ed, $100 ; VOLTORB
mon_cry CRY_VOLTORB, $0a8, $110 ; ELECTRODE
mon_cry CRY_DIGLETT, $000, $100 ; EXEGGCUTE
mon_cry CRY_DROWZEE, $000, $100 ; EXEGGUTOR
mon_cry CRY_CLEFAIRY, $000, $100 ; CUBONE
mon_cry CRY_ODDISH, $04f, $0e0 ; MAROWAK
mon_cry CRY_GOLEM, $080, $140 ; HITMONLEE
mon_cry CRY_SEEL, $0ee, $140 ; HITMONCHAN
mon_cry CRY_SEEL, $000, $100 ; LICKITUNG
mon_cry CRY_GOLEM, $0e6, $15d ; KOFFING
mon_cry CRY_GOLEM, $0ff, $17f ; WEEZING
mon_cry CRY_CHARMANDER, $000, $100 ; RHYHORN
mon_cry CRY_RHYDON, $000, $100 ; RHYDON
mon_cry CRY_PIDGEOTTO, $00a, $140 ; CHANSEY
mon_cry CRY_GOLEM, $000, $100 ; TANGELA
mon_cry CRY_KANGASKHAN, $000, $100 ; KANGASKHAN
mon_cry CRY_CLEFAIRY, $099, $090 ; HORSEA
mon_cry CRY_CLEFAIRY, $03c, $081 ; SEADRA
mon_cry CRY_CATERPIE, $080, $0c0 ; GOLDEEN
mon_cry CRY_CATERPIE, $010, $17f ; SEAKING
mon_cry CRY_PARAS, $002, $0a0 ; STARYU
mon_cry CRY_PARAS, $000, $100 ; STARMIE
mon_cry CRY_KRABBY, $008, $0c0 ; MR__MIME
mon_cry CRY_CATERPIE, $000, $100 ; SCYTHER
mon_cry CRY_DROWZEE, $0ff, $17f ; JYNX
mon_cry CRY_VOLTORB, $08f, $17f ; ELECTABUZZ
mon_cry CRY_CHARMANDER, $0ff, $0b0 ; MAGMAR
mon_cry CRY_PIDGEOTTO, $000, $100 ; PINSIR
mon_cry CRY_SQUIRTLE, $011, $0c0 ; TAUROS
mon_cry CRY_EKANS, $080, $080 ; MAGIKARP
mon_cry CRY_EKANS, $000, $100 ; GYARADOS
mon_cry CRY_LAPRAS, $000, $100 ; LAPRAS
mon_cry CRY_PIDGEY, $0ff, $17f ; DITTO
mon_cry CRY_VENONAT, $088, $0e0 ; EEVEE
mon_cry CRY_VENONAT, $0aa, $17f ; VAPOREON
mon_cry CRY_VENONAT, $03d, $100 ; JOLTEON
mon_cry CRY_VENONAT, $010, $0a0 ; FLAREON
mon_cry CRY_WEEPINBELL, $0aa, $17f ; PORYGON
mon_cry CRY_GROWLITHE, $0f0, $081 ; OMANYTE
mon_cry CRY_GROWLITHE, $0ff, $0c0 ; OMASTAR
mon_cry CRY_CATERPIE, $0bb, $0c0 ; KABUTO
mon_cry CRY_FEAROW, $0ee, $081 ; KABUTOPS
mon_cry CRY_VILEPLUME, $020, $170 ; AERODACTYL
mon_cry CRY_GRIMER, $055, $081 ; SNORLAX
mon_cry CRY_RAICHU, $080, $0c0 ; ARTICUNO
mon_cry CRY_FEAROW, $0ff, $100 ; ZAPDOS
mon_cry CRY_RAICHU, $0f8, $0c0 ; MOLTRES
mon_cry CRY_BULBASAUR, $060, $0c0 ; DRATINI
mon_cry CRY_BULBASAUR, $040, $100 ; DRAGONAIR
mon_cry CRY_BULBASAUR, $03c, $140 ; DRAGONITE
mon_cry CRY_PARAS, $099, $17f ; MEWTWO
mon_cry CRY_PARAS, $0ee, $17f ; MEW
mon_cry CRY_CHIKORITA, -$010, $0b0 ; CHIKORITA
mon_cry CRY_CHIKORITA, -$022, $120 ; BAYLEEF
mon_cry CRY_CHIKORITA, -$0b7, $200 ; MEGANIUM
mon_cry CRY_CYNDAQUIL, $347, $080 ; CYNDAQUIL
mon_cry CRY_CYNDAQUIL, $321, $120 ; QUILAVA
mon_cry CRY_TYPHLOSION, $f00, $0d4 ; TYPHLOSION
mon_cry CRY_TOTODILE, $46c, $0e8 ; TOTODILE
mon_cry CRY_TOTODILE, $440, $110 ; CROCONAW
mon_cry CRY_TOTODILE, $3fc, $180 ; FERALIGATR
mon_cry CRY_SENTRET, $08a, $0b8 ; SENTRET
mon_cry CRY_SENTRET, $06b, $102 ; FURRET
mon_cry CRY_HOOTHOOT, $091, $0d8 ; HOOTHOOT
mon_cry CRY_HOOTHOOT, $000, $1a0 ; NOCTOWL
mon_cry CRY_LEDYBA, $000, $0de ; LEDYBA
mon_cry CRY_LEDYBA, -$096, $138 ; LEDIAN
mon_cry CRY_SPINARAK, $011, $200 ; SPINARAK
mon_cry CRY_SPINARAK, -$0ae, $1e2 ; ARIADOS
mon_cry CRY_SQUIRTLE, -$010, $140 ; CROBAT
mon_cry CRY_CYNDAQUIL, $3c9, $140 ; CHINCHOU
mon_cry CRY_CYNDAQUIL, $2d0, $110 ; LANTURN
mon_cry CRY_PICHU, $000, $140 ; PICHU
mon_cry CRY_CLEFFA, $061, $091 ; CLEFFA
mon_cry CRY_CHIKORITA, $0e8, $0e8 ; IGGLYBUFF
mon_cry CRY_TOGEPI, $010, $100 ; TOGEPI
mon_cry CRY_TOGETIC, $03b, $038 ; TOGETIC
mon_cry CRY_NATU, -$067, $100 ; NATU
mon_cry CRY_NATU, -$0a7, $168 ; XATU
mon_cry CRY_MAREEP, $022, $0d8 ; MAREEP
mon_cry CRY_MAREEP, -$007, $180 ; FLAAFFY
mon_cry CRY_AMPHAROS, -$07c, $0e8 ; AMPHAROS
mon_cry CRY_CLEFFA, $084, $150 ; BELLOSSOM
mon_cry CRY_MARILL, $11b, $120 ; MARILL
mon_cry CRY_MARILL, $0b6, $180 ; AZUMARILL
mon_cry CRY_CLEFFA, $f40, $180 ; SUDOWOODO
mon_cry CRY_CLEFFA, -$2a3, $1c8 ; POLITOED
mon_cry CRY_CLEFFA, $03b, $0c8 ; HOPPIP
mon_cry CRY_CLEFFA, $027, $138 ; SKIPLOOM
mon_cry CRY_CLEFFA, $000, $180 ; JUMPLUFF
mon_cry CRY_AIPOM, -$051, $0e8 ; AIPOM
mon_cry CRY_MARILL, $12b, $0b8 ; SUNKERN
mon_cry CRY_SUNFLORA, -$020, $180 ; SUNFLORA
mon_cry CRY_TOTODILE, $031, $0c8 ; YANMA
mon_cry CRY_WOOPER, $093, $0af ; WOOPER
mon_cry CRY_WOOPER, -$0c6, $140 ; QUAGSIRE
mon_cry CRY_AIPOM, $0a2, $140 ; ESPEON
mon_cry CRY_VENONAT, -$0e9, $0f0 ; UMBREON
mon_cry CRY_MARILL, -$01f, $180 ; MURKROW
mon_cry CRY_SLOWKING, $104, $200 ; SLOWKING
mon_cry CRY_HOOTHOOT, $130, $0e8 ; MISDREAVUS
mon_cry CRY_HOOTHOOT, $162, $100 ; UNOWN
mon_cry CRY_AMPHAROS, $27b, $144 ; WOBBUFFET
mon_cry CRY_GIRAFARIG, $041, $200 ; GIRAFARIG
mon_cry CRY_SLOWKING, $080, $100 ; PINECO
mon_cry CRY_SLOWKING, $000, $180 ; FORRETRESS
mon_cry CRY_DUNSPARCE, $1c4, $100 ; DUNSPARCE
mon_cry CRY_GLIGAR, -$102, $100 ; GLIGAR
mon_cry CRY_TYPHLOSION, $0ef, $0f7 ; STEELIX
mon_cry CRY_DUNSPARCE, $112, $0e8 ; SNUBBULL
mon_cry CRY_DUNSPARCE, $000, $180 ; GRANBULL
mon_cry CRY_SLOWKING, $160, $0e0 ; QWILFISH
mon_cry CRY_AMPHAROS, $000, $160 ; SCIZOR
mon_cry CRY_DUNSPARCE, $290, $0a8 ; SHUCKLE
mon_cry CRY_AMPHAROS, $035, $0e0 ; HERACROSS
mon_cry CRY_WOOPER, $053, $0af ; SNEASEL
mon_cry CRY_TEDDIURSA, $7a2, $06e ; TEDDIURSA
mon_cry CRY_TEDDIURSA, $640, $0d8 ; URSARING
mon_cry CRY_SLUGMA, -$1d8, $140 ; SLUGMA
mon_cry CRY_MAGCARGO, -$20d, $1c0 ; MAGCARGO
mon_cry CRY_CYNDAQUIL, $1fe, $140 ; SWINUB
mon_cry CRY_MAGCARGO, -$109, $100 ; PILOSWINE
mon_cry CRY_MAGCARGO, $0a1, $0e8 ; CORSOLA
mon_cry CRY_SUNFLORA, $00d, $100 ; REMORAID
mon_cry CRY_TOTODILE, $000, $180 ; OCTILLERY
mon_cry CRY_TEDDIURSA, $002, $06a ; DELIBIRD
mon_cry CRY_MANTINE, -$0be, $0f0 ; MANTINE
mon_cry CRY_AMPHAROS, $8a9, $180 ; SKARMORY
mon_cry CRY_CYNDAQUIL, $039, $140 ; HOUNDOUR
mon_cry CRY_TOTODILE, -$10a, $100 ; HOUNDOOM
mon_cry CRY_SLUGMA, $2fb, $100 ; KINGDRA
mon_cry CRY_SENTRET, $048, $230 ; PHANPY
mon_cry CRY_DONPHAN, $000, $1a0 ; DONPHAN
mon_cry CRY_GIRAFARIG, $073, $240 ; PORYGON2
mon_cry CRY_AIPOM, -$160, $180 ; STANTLER
mon_cry CRY_PICHU, -$21a, $1f0 ; SMEARGLE
mon_cry CRY_AIPOM, $02c, $108 ; TYROGUE
mon_cry CRY_SLUGMA, $000, $100 ; HITMONTOP
mon_cry CRY_MARILL, $068, $100 ; SMOOCHUM
mon_cry CRY_SUNFLORA, -$2d8, $0b4 ; ELEKID
mon_cry CRY_TEDDIURSA, $176, $03a ; MAGBY
mon_cry CRY_GLIGAR, -$1cd, $1a0 ; MILTANK
mon_cry CRY_SLOWKING, $293, $140 ; BLISSEY
mon_cry CRY_RAIKOU, $22e, $120 ; RAIKOU
mon_cry CRY_ENTEI, $000, $1a0 ; ENTEI
mon_cry CRY_MAGCARGO, $000, $180 ; SUICUNE
mon_cry CRY_RAIKOU, $05f, $0d0 ; LARVITAR
mon_cry CRY_SPINARAK, -$1db, $150 ; PUPITAR
mon_cry CRY_RAIKOU, -$100, $180 ; TYRANITAR
mon_cry CRY_TYPHLOSION, $000, $100 ; LUGIA
mon_cry CRY_AIPOM, $000, $180 ; HO_OH
mon_cry CRY_ENTEI, $14a, $111 ; CELEBI
;Hoenn
mon_cry CRY_BULBASAUR, $0ee, $081 ; TREECKO
mon_cry CRY_BULBASAUR, $0ee, $081 ; GROVYLE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SCEPTILE
mon_cry CRY_BULBASAUR, $0ee, $081 ; TORCHIC
mon_cry CRY_BULBASAUR, $0ee, $081 ; COMBUSKEN
mon_cry CRY_BULBASAUR, $0ee, $081 ; BLAZIKEN
mon_cry CRY_BULBASAUR, $0ee, $081 ; MUDKIP
mon_cry CRY_BULBASAUR, $0ee, $081 ; MARSHTOMP
mon_cry CRY_BULBASAUR, $0ee, $081 ; SWAMPERT
mon_cry CRY_BULBASAUR, $0ee, $081 ; POOCHYENA
mon_cry CRY_BULBASAUR, $0ee, $081 ; MIGHTYENA
mon_cry CRY_BULBASAUR, $0ee, $081 ; ZIGZAGOON
mon_cry CRY_BULBASAUR, $0ee, $081 ; LINOONE
mon_cry CRY_BULBASAUR, $0ee, $081 ; WURMPLE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SILCOON
mon_cry CRY_BULBASAUR, $0ee, $081 ; BEAUTIFLY
mon_cry CRY_BULBASAUR, $0ee, $081 ; CASCOON
mon_cry CRY_BULBASAUR, $0ee, $081 ; DUSTOX
mon_cry CRY_BULBASAUR, $0ee, $081 ; LOTAD
mon_cry CRY_BULBASAUR, $0ee, $081 ; LOMBRE
mon_cry CRY_BULBASAUR, $0ee, $081 ; LUDICOLO
mon_cry CRY_BULBASAUR, $0ee, $081 ; SEEDOT
mon_cry CRY_BULBASAUR, $0ee, $081 ; NUZLEAF
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHIFTRY
mon_cry CRY_BULBASAUR, $0ee, $081 ; TAILLOW
mon_cry CRY_BULBASAUR, $0ee, $081 ; SWELLOW
mon_cry CRY_BULBASAUR, $0ee, $081 ; WINGULL
mon_cry CRY_BULBASAUR, $0ee, $081 ; PELIPPER
mon_cry CRY_BULBASAUR, $0ee, $081 ; RALTS
mon_cry CRY_BULBASAUR, $0ee, $081 ; KIRLIA
mon_cry CRY_BULBASAUR, $0ee, $081 ; GARDEVOIR
mon_cry CRY_BULBASAUR, $0ee, $081 ; SURSKIT
mon_cry CRY_BULBASAUR, $0ee, $081 ; MASQUERAIN
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHROOMISH
mon_cry CRY_BULBASAUR, $0ee, $081 ; BRELOOM
mon_cry CRY_BULBASAUR, $0ee, $081 ; SLAKOTH
mon_cry CRY_BULBASAUR, $0ee, $081 ; VIGOROTH
mon_cry CRY_BULBASAUR, $0ee, $081 ; SLAKING
mon_cry CRY_BULBASAUR, $0ee, $081 ; NINCADA
mon_cry CRY_BULBASAUR, $0ee, $081 ; NINJASK
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHEDINJA
mon_cry CRY_BULBASAUR, $0ee, $081 ; WHISMUR
mon_cry CRY_BULBASAUR, $0ee, $081 ; LOUDRED
mon_cry CRY_BULBASAUR, $0ee, $081 ; EXPLOUD
mon_cry CRY_BULBASAUR, $0ee, $081 ; MAKUHITA
mon_cry CRY_BULBASAUR, $0ee, $081 ; HARIYAMA
mon_cry CRY_BULBASAUR, $0ee, $081 ; AZURILL
mon_cry CRY_BULBASAUR, $0ee, $081 ; NOSEPASS
mon_cry CRY_BULBASAUR, $0ee, $081 ; SKITTY
mon_cry CRY_BULBASAUR, $0ee, $081 ; DELCATTY
mon_cry CRY_BULBASAUR, $0ee, $081 ; SABLEYE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MAWILE
mon_cry CRY_BULBASAUR, $0ee, $081 ; ARON
mon_cry CRY_BULBASAUR, $0ee, $081 ; LAIRON
mon_cry CRY_BULBASAUR, $0ee, $081 ; AGGRON
mon_cry CRY_BULBASAUR, $0ee, $081 ; MEDITITE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MEDICHAM
mon_cry CRY_BULBASAUR, $0ee, $081 ; ELECTRIKE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MANECTRIC
mon_cry CRY_BULBASAUR, $0ee, $081 ; PLUSLE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MINUN
mon_cry CRY_BULBASAUR, $0ee, $081 ; VOLBEAT
mon_cry CRY_BULBASAUR, $0ee, $081 ; ILLUMISE
mon_cry CRY_BULBASAUR, $0ee, $081 ; ROSELIA
mon_cry CRY_BULBASAUR, $0ee, $081 ; GULPIN
mon_cry CRY_BULBASAUR, $0ee, $081 ; SWALOT
mon_cry CRY_BULBASAUR, $0ee, $081 ; CARVANHA
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHARPEDO
mon_cry CRY_BULBASAUR, $0ee, $081 ; WAILMER
mon_cry CRY_BULBASAUR, $0ee, $081 ; WAILORD
mon_cry CRY_BULBASAUR, $0ee, $081 ; NUMEL
mon_cry CRY_BULBASAUR, $0ee, $081 ; CAMERUPT
mon_cry CRY_BULBASAUR, $0ee, $081 ; TORKOAL
mon_cry CRY_BULBASAUR, $0ee, $081 ; SPOINK
mon_cry CRY_BULBASAUR, $0ee, $081 ; GRUMPIG
mon_cry CRY_BULBASAUR, $0ee, $081 ; SPINDA
mon_cry CRY_BULBASAUR, $0ee, $081 ; TRAPINCH
mon_cry CRY_BULBASAUR, $0ee, $081 ; VIBRAVA
mon_cry CRY_BULBASAUR, $0ee, $081 ; FLYGON
mon_cry CRY_BULBASAUR, $0ee, $081 ; CACNEA
mon_cry CRY_BULBASAUR, $0ee, $081 ; CACTURNE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SWABLU
mon_cry CRY_BULBASAUR, $0ee, $081 ; ALTARIA
mon_cry CRY_BULBASAUR, $0ee, $081 ; ZANGOOSE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SEVIPER
mon_cry CRY_BULBASAUR, $0ee, $081 ; LUNATONE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SOLROCK
mon_cry CRY_BULBASAUR, $0ee, $081 ; BARBOACH
mon_cry CRY_BULBASAUR, $0ee, $081 ; WHISCASH
mon_cry CRY_BULBASAUR, $0ee, $081 ; CORPHISH
mon_cry CRY_BULBASAUR, $0ee, $081 ; CRAWDAUNT
mon_cry CRY_BULBASAUR, $0ee, $081 ; BALTOY
mon_cry CRY_BULBASAUR, $0ee, $081 ; CLAYDOL
mon_cry CRY_BULBASAUR, $0ee, $081 ; LILEEP
mon_cry CRY_BULBASAUR, $0ee, $081 ; CRADILY
mon_cry CRY_BULBASAUR, $0ee, $081 ; ANORITH
mon_cry CRY_BULBASAUR, $0ee, $081 ; ARMALDO
mon_cry CRY_BULBASAUR, $0ee, $081 ; FEEBAS
mon_cry CRY_BULBASAUR, $0ee, $081 ; MILOTIC
mon_cry CRY_BULBASAUR, $0ee, $081 ; CASTFORM
mon_cry CRY_BULBASAUR, $0ee, $081 ; KECLEON
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHUPPET
mon_cry CRY_BULBASAUR, $0ee, $081 ; BANETTE
mon_cry CRY_BULBASAUR, $0ee, $081 ; DUSKULL
mon_cry CRY_BULBASAUR, $0ee, $081 ; DUSCLOPS
mon_cry CRY_BULBASAUR, $0ee, $081 ; TROPIUS
mon_cry CRY_BULBASAUR, $0ee, $081 ; CHIMECHO
mon_cry CRY_BULBASAUR, $0ee, $081 ; ABSOL
mon_cry CRY_BULBASAUR, $0ee, $081 ; WYNAUT
mon_cry CRY_BULBASAUR, $0ee, $081 ; SNORUNT
mon_cry CRY_BULBASAUR, $0ee, $081 ; GLALIE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SPHEAL
mon_cry CRY_BULBASAUR, $0ee, $081 ; SEALEO
mon_cry CRY_BULBASAUR, $0ee, $081 ; WALREIN
mon_cry CRY_BULBASAUR, $0ee, $081 ; CLAMPERL
mon_cry CRY_BULBASAUR, $0ee, $081 ; HUNTAIL
mon_cry CRY_BULBASAUR, $0ee, $081 ; GOREBYSS
mon_cry CRY_BULBASAUR, $0ee, $081 ; RELICANTH
mon_cry CRY_BULBASAUR, $0ee, $081 ; LUVDISC
mon_cry CRY_BULBASAUR, $0ee, $081 ; BAGON
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHELGON
mon_cry CRY_BULBASAUR, $0ee, $081 ; SALAMENCE
mon_cry CRY_BULBASAUR, $0ee, $081 ; BELDUM
mon_cry CRY_BULBASAUR, $0ee, $081 ; METANG
mon_cry CRY_BULBASAUR, $0ee, $081 ; METAGROSS
mon_cry CRY_BULBASAUR, $0ee, $081 ; REGIROCK
mon_cry CRY_BULBASAUR, $0ee, $081 ; REGICE
mon_cry CRY_BULBASAUR, $0ee, $081 ; REGISTEEL
mon_cry CRY_BULBASAUR, $0ee, $081 ; LATIAS
mon_cry CRY_BULBASAUR, $0ee, $081 ; LATIOS
mon_cry CRY_BULBASAUR, $0ee, $081 ; KYOGRE
mon_cry CRY_BULBASAUR, $0ee, $081 ; GROUDON
mon_cry CRY_BULBASAUR, $0ee, $081 ; RAYQUAZA
mon_cry CRY_BULBASAUR, $0ee, $081 ; JIRACHI
mon_cry CRY_BULBASAUR, $0ee, $081 ; DEOXYS
;Sinnoh
mon_cry CRY_BULBASAUR, $0ee, $081 ; TURTWIG
mon_cry CRY_BULBASAUR, $0ee, $081 ; GROTLE
mon_cry CRY_BULBASAUR, $0ee, $081 ; TORTERRA
mon_cry CRY_BULBASAUR, $0ee, $081 ; CHIMCHAR
mon_cry CRY_BULBASAUR, $0ee, $081 ; MONFERNO
mon_cry CRY_BULBASAUR, $0ee, $081 ; INFERNAPE
mon_cry CRY_BULBASAUR, $0ee, $081 ; PIPLUP
mon_cry CRY_BULBASAUR, $0ee, $081 ; PRINPLUP
mon_cry CRY_BULBASAUR, $0ee, $081 ; EMPOLEON
mon_cry CRY_BULBASAUR, $0ee, $081 ; STARLY
mon_cry CRY_BULBASAUR, $0ee, $081 ; STARAVIA
mon_cry CRY_BULBASAUR, $0ee, $081 ; STARAPTOR
mon_cry CRY_BULBASAUR, $0ee, $081 ; BIDOOF
mon_cry CRY_BULBASAUR, $0ee, $081 ; BIBAREL
mon_cry CRY_BULBASAUR, $0ee, $081 ; KRICKETOT
mon_cry CRY_BULBASAUR, $0ee, $081 ; KRICKETUNE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHINX
mon_cry CRY_BULBASAUR, $0ee, $081 ; LUXIO
mon_cry CRY_BULBASAUR, $0ee, $081 ; LUXRAY
mon_cry CRY_BULBASAUR, $0ee, $081 ; BUDEW
mon_cry CRY_BULBASAUR, $0ee, $081 ; ROSERADE
mon_cry CRY_BULBASAUR, $0ee, $081 ; CRANIDOS
mon_cry CRY_BULBASAUR, $0ee, $081 ; RAMPARDOS
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHIELDON
mon_cry CRY_BULBASAUR, $0ee, $081 ; BASTIODON
mon_cry CRY_BULBASAUR, $0ee, $081 ; BURMY
mon_cry CRY_BULBASAUR, $0ee, $081 ; WORMADAM
mon_cry CRY_BULBASAUR, $0ee, $081 ; MOTHIM
mon_cry CRY_BULBASAUR, $0ee, $081 ; COMBEE
mon_cry CRY_BULBASAUR, $0ee, $081 ; VESPIQUEN
mon_cry CRY_BULBASAUR, $0ee, $081 ; PACHIRISU
mon_cry CRY_BULBASAUR, $0ee, $081 ; BUIZEL
mon_cry CRY_BULBASAUR, $0ee, $081 ; FLOATZEL
mon_cry CRY_BULBASAUR, $0ee, $081 ; CHERUBI
mon_cry CRY_BULBASAUR, $0ee, $081 ; CHERRIM
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHELLOS
mon_cry CRY_BULBASAUR, $0ee, $081 ; GASTRODON
mon_cry CRY_BULBASAUR, $0ee, $081 ; AMBIPOM
mon_cry CRY_BULBASAUR, $0ee, $081 ; DRIFLOON
mon_cry CRY_BULBASAUR, $0ee, $081 ; DRIFBLIM
mon_cry CRY_BULBASAUR, $0ee, $081 ; BUNEARY
mon_cry CRY_BULBASAUR, $0ee, $081 ; LOPUNNY
mon_cry CRY_BULBASAUR, $0ee, $081 ; MISMAGIUS
mon_cry CRY_BULBASAUR, $0ee, $081 ; HONCHKROW
mon_cry CRY_BULBASAUR, $0ee, $081 ; GLAMEOW
mon_cry CRY_BULBASAUR, $0ee, $081 ; PURUGLY
mon_cry CRY_BULBASAUR, $0ee, $081 ; CHINGLING
mon_cry CRY_BULBASAUR, $0ee, $081 ; STUNKY
mon_cry CRY_BULBASAUR, $0ee, $081 ; SKUNTANK
mon_cry CRY_BULBASAUR, $0ee, $081 ; BRONZOR
mon_cry CRY_BULBASAUR, $0ee, $081 ; BRONZONG
mon_cry CRY_BULBASAUR, $0ee, $081 ; BONSLY
mon_cry CRY_BULBASAUR, $0ee, $081 ; MIME_JR
mon_cry CRY_BULBASAUR, $0ee, $081 ; HAPPINY
mon_cry CRY_BULBASAUR, $0ee, $081 ; CHATOT
mon_cry CRY_BULBASAUR, $0ee, $081 ; SPIRITOMB
mon_cry CRY_BULBASAUR, $0ee, $081 ; GIBLE
mon_cry CRY_BULBASAUR, $0ee, $081 ; GABITE
mon_cry CRY_BULBASAUR, $0ee, $081 ; GARCHOMP
mon_cry CRY_BULBASAUR, $0ee, $081 ; MUNCHLAX
mon_cry CRY_BULBASAUR, $0ee, $081 ; RIOLU
mon_cry CRY_BULBASAUR, $0ee, $081 ; LUCARIO
mon_cry CRY_BULBASAUR, $0ee, $081 ; HIPPOPOTAS
mon_cry CRY_BULBASAUR, $0ee, $081 ; HIPPOWDON
mon_cry CRY_BULBASAUR, $0ee, $081 ; SKORUPI
mon_cry CRY_BULBASAUR, $0ee, $081 ; DRAPION
mon_cry CRY_BULBASAUR, $0ee, $081 ; CROAGUNK
mon_cry CRY_BULBASAUR, $0ee, $081 ; TOXICROAK
mon_cry CRY_BULBASAUR, $0ee, $081 ; CARNIVINE
mon_cry CRY_BULBASAUR, $0ee, $081 ; FINNEON
mon_cry CRY_BULBASAUR, $0ee, $081 ; LUMINEON
mon_cry CRY_BULBASAUR, $0ee, $081 ; MANTYKE
mon_cry CRY_BULBASAUR, $0ee, $081 ; SNOVER
mon_cry CRY_BULBASAUR, $0ee, $081 ; ABOMASNOW
mon_cry CRY_BULBASAUR, $0ee, $081 ; WEAVILE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MAGNEZONE
mon_cry CRY_BULBASAUR, $0ee, $081 ; LICKILICKY
mon_cry CRY_BULBASAUR, $0ee, $081 ; RHYPERIOR
mon_cry CRY_BULBASAUR, $0ee, $081 ; TANGROWTH
mon_cry CRY_BULBASAUR, $0ee, $081 ; ELECTIVIRE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MAGMORTAR
mon_cry CRY_BULBASAUR, $0ee, $081 ; TOGEKISS
mon_cry CRY_BULBASAUR, $0ee, $081 ; YANMEGA
mon_cry CRY_BULBASAUR, $0ee, $081 ; LEAFEON
mon_cry CRY_BULBASAUR, $0ee, $081 ; GLACEON
mon_cry CRY_BULBASAUR, $0ee, $081 ; GLISCOR
mon_cry CRY_BULBASAUR, $0ee, $081 ; MAMOSWINE
mon_cry CRY_BULBASAUR, $0ee, $081 ; PORYGON_Z
mon_cry CRY_BULBASAUR, $0ee, $081 ; GALLADE
mon_cry CRY_BULBASAUR, $0ee, $081 ; PROBOPASS
mon_cry CRY_BULBASAUR, $0ee, $081 ; DUSKNOIR
mon_cry CRY_BULBASAUR, $0ee, $081 ; FROSLASS
mon_cry CRY_BULBASAUR, $0ee, $081 ; ROTOM
mon_cry CRY_BULBASAUR, $0ee, $081 ; UXIE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MESPRIT
mon_cry CRY_BULBASAUR, $0ee, $081 ; AZELF
mon_cry CRY_BULBASAUR, $0ee, $081 ; DIALGA
mon_cry CRY_BULBASAUR, $0ee, $081 ; PALKIA
mon_cry CRY_BULBASAUR, $0ee, $081 ; HEATRAN
mon_cry CRY_BULBASAUR, $0ee, $081 ; REGIGIGAS
mon_cry CRY_BULBASAUR, $0ee, $081 ; GIRATINA
mon_cry CRY_BULBASAUR, $0ee, $081 ; CRESSELIA
mon_cry CRY_BULBASAUR, $0ee, $081 ; PHIONE
mon_cry CRY_BULBASAUR, $0ee, $081 ; MANAPHY
mon_cry CRY_BULBASAUR, $0ee, $081 ; DARKRAI
mon_cry CRY_BULBASAUR, $0ee, $081 ; SHAYMIN
mon_cry CRY_BULBASAUR, $0ee, $081 ; ARCEUS
;Secret
mon_cry CRY_BULBASAUR, $0ee, $081 ; SYLVEON
mon_cry CRY_BULBASAUR, $0ee, $081 ; REGIELEKI
mon_cry CRY_BULBASAUR, $0ee, $081 ; REGIDRAGO
|
00_PiscaLed/PiscaLed/main.asm | amandarwagner/atmel-studio | 2 | 21345 | <gh_stars>1-10
;
; PiscaLed.asm
;
; Created: 21/03/2021 13:57:17
; Author : Amanda
;
; Replace with your application code
start:
ldi R16, 0xFF
out DDRB, R16;
loop:
sbi PORTB, 5
rcall delay_05
cbi PORTB, 5
rcall delay_05
rjmp loop
delay_05:
ldi R16,8
loop1:
ldi R24, low(3037)
ldi R25, high(3037)
delay_loop:
adiw R24, 1
brne delay_loop
dec R16
brne loop1
ret
|
NonReflectiveQ.agda | z-murray/AnalysisAgda | 0 | 17478 | {-# OPTIONS --without-K --safe #-}
open import Agda.Builtin.Bool
open import Data.Maybe.Base using (Maybe; just; nothing)
open import Relation.Nullary
open import Data.Rational.Unnormalised.Base using (ℚᵘ; 0ℚᵘ; _≃_)
open import Data.Rational.Unnormalised.Properties using (+-*-commutativeRing; _≃?_)
isZero? : ∀ (p : ℚᵘ) -> Maybe (0ℚᵘ ≃ p)
isZero? p with 0ℚᵘ ≃? p
... | .true because ofʸ p₁ = just p₁
... | .false because ofⁿ ¬p = nothing
open import Tactic.RingSolver.Core.AlmostCommutativeRing using (fromCommutativeRing)
open import Tactic.RingSolver.NonReflective (fromCommutativeRing +-*-commutativeRing isZero?) public
|
optimised/utility.asm | PJBoy/SM-SPC | 4 | 5659 | memclear_8bit:
{
;; Parameters
;; !misc0: Destination
;; Y: Size. 0 = 100h bytes
mov a,#$00
decw !misc0
-
mov (!misc0)+y,a
dec y : bne -
+
incw !misc0
ret
}
memclear:
{
;; Parameters
;; !misc0: Destination
;; !misc1: Size
; Clear blocks of 100h bytes
mov x,!misc1+1
beq +
mov y,#$00
-
call memclear_8bit
inc !misc0+1
dec x : bne -
+
; Clear the remaining bytes if any
mov y,!misc1
beq +
call memclear_8bit
+
ret
}
|
test/Fail/Issue461.agda | shlevy/agda | 1,989 | 12339 |
module Issue461 where
data D : Set where
data D : Set where
|
Transynther/x86/_processed/NONE/_zr_/i7-7700_9_0x48.log_21829_1435.asm | ljhsiun2/medusa | 9 | 161770 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r15
push %rax
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x13b61, %rbx
nop
and $31691, %rsi
vmovups (%rbx), %ymm1
vextracti128 $1, %ymm1, %xmm1
vpextrq $1, %xmm1, %r12
sub $22835, %r11
lea addresses_D_ht+0x1aa41, %r15
nop
nop
nop
mfence
movups (%r15), %xmm4
vpextrq $1, %xmm4, %rax
nop
nop
nop
nop
nop
sub %rsi, %rsi
lea addresses_WT_ht+0x1dc51, %rbx
nop
nop
nop
cmp %rdx, %rdx
mov (%rbx), %rax
nop
nop
nop
nop
add %rax, %rax
lea addresses_WT_ht+0x10b61, %rsi
lea addresses_UC_ht+0x1637f, %rdi
nop
nop
nop
nop
nop
dec %rbx
mov $70, %rcx
rep movsb
nop
nop
nop
nop
nop
xor $22343, %rcx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbx
pop %rax
pop %r15
pop %r12
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r14
push %r15
push %r8
push %rbp
push %rbx
push %rcx
// Faulty Load
lea addresses_A+0x12b61, %rbp
add %r15, %r15
movb (%rbp), %r14b
lea oracles, %r8
and $0xff, %r14
shlq $12, %r14
mov (%r8,%r14,1), %r14
pop %rcx
pop %rbx
pop %rbp
pop %r8
pop %r15
pop %r14
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_A', 'AVXalign': False, 'congruent': 0, 'size': 2, 'same': False, 'NT': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_A', 'AVXalign': False, 'congruent': 0, 'size': 1, 'same': True, 'NT': False}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'congruent': 8, 'size': 32, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'congruent': 5, 'size': 16, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WT_ht', 'AVXalign': False, 'congruent': 4, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WT_ht', 'congruent': 11, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 0, 'same': False}}
{'00': 21829}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
symbolinen_konekieli/Ratol_msdos/summaa1.asm | tkukka/VariousContent | 0 | 7058 | ;RaTol Symbolinen konekieli: Harjoitus 2, tehtävä 3
;Tero Kukka IY96A
;Tiedosto: summaa1.asm
;Luotu 25.2.1998
;Aliohjelma _Summaa1
;Yhteenlaskettavat luvut ovat rekistereissä BL ja DH.
;Aliohjelmien esittely:
public _Summaa1
.model small ;muistimalli
.stack 00h ;pinon koko
.data ;muuttujalohko
.code ;ohjelmakoodi alkaa
_Summaa1 proc ;unsigned char _Summaa1();
mov ah, 0 ;varmistetaan summan (word) oikea tulos
mov al, bl
add al, dh
ret ;return AX;
_Summaa1 endp
end
|
Transynther/x86/_processed/NC/_st_zr_un_sm_/i9-9900K_12_0xa0_notsx.log_21829_496.asm | ljhsiun2/medusa | 9 | 243758 | .global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r9
push %rbp
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x36ba, %rdx
clflush (%rdx)
nop
nop
sub %rbp, %rbp
mov (%rdx), %r9w
nop
nop
nop
xor %rdx, %rdx
lea addresses_normal_ht+0xb42, %rdx
nop
nop
nop
dec %rcx
mov $0x6162636465666768, %r9
movq %r9, %xmm5
movups %xmm5, (%rdx)
and $64134, %r10
lea addresses_WC_ht+0x17086, %rdi
nop
nop
add %r9, %r9
movb (%rdi), %dl
nop
nop
nop
xor %rdi, %rdi
lea addresses_WT_ht+0xdc42, %rcx
nop
dec %rbx
movl $0x61626364, (%rcx)
nop
nop
nop
sub %r10, %r10
lea addresses_UC_ht+0x350a, %rcx
nop
nop
sub $9963, %rbx
mov (%rcx), %edi
inc %rbx
lea addresses_A_ht+0x1dc1e, %rdx
nop
nop
nop
nop
nop
xor $27758, %r10
movb $0x61, (%rdx)
and $27236, %r9
lea addresses_UC_ht+0x196ca, %rsi
lea addresses_normal_ht+0x139a2, %rdi
and %rdx, %rdx
mov $23, %rcx
rep movsb
nop
nop
nop
xor %rbx, %rbx
lea addresses_WT_ht+0x1ba02, %rsi
lea addresses_D_ht+0x1d8c2, %rdi
nop
nop
nop
dec %rdx
mov $118, %rcx
rep movsq
nop
nop
nop
nop
cmp $46834, %rsi
lea addresses_WC_ht+0x1d742, %rbp
nop
nop
add %rdx, %rdx
movb (%rbp), %r9b
nop
nop
nop
and $14497, %r10
lea addresses_WT_ht+0x9bc2, %rsi
lea addresses_D_ht+0x4b92, %rdi
nop
nop
nop
cmp $15014, %r9
mov $39, %rcx
rep movsb
add %rbp, %rbp
lea addresses_WC_ht+0x98c2, %rdi
nop
nop
nop
xor %rbx, %rbx
mov (%rdi), %dx
nop
and %rsi, %rsi
lea addresses_A_ht+0xc9c2, %rsi
lea addresses_D_ht+0x6f42, %rdi
clflush (%rsi)
nop
nop
nop
nop
nop
and %r10, %r10
mov $19, %rcx
rep movsw
nop
nop
nop
nop
sub $44815, %rsi
lea addresses_WC_ht+0x17b92, %r10
nop
nop
nop
xor $37805, %rdi
mov (%r10), %rsi
xor $15756, %r10
lea addresses_UC_ht+0x9e02, %r10
nop
nop
dec %rbx
mov (%r10), %edi
nop
nop
nop
xor $57008, %rdi
lea addresses_UC_ht+0x14342, %r10
nop
and %rbp, %rbp
movw $0x6162, (%r10)
xor %rbx, %rbx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %r9
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r12
push %r14
push %r15
push %r8
push %r9
push %rcx
push %rdi
// Store
lea addresses_RW+0xfa42, %rcx
sub $1125, %rdi
movb $0x51, (%rcx)
nop
nop
nop
nop
nop
inc %r12
// Store
lea addresses_WC+0x1cc42, %r15
xor %r12, %r12
movb $0x51, (%r15)
nop
nop
cmp %rdi, %rdi
// Store
lea addresses_D+0x12942, %rdi
xor %r9, %r9
movl $0x51525354, (%rdi)
nop
add $30290, %rdi
// Store
mov $0x23a6ce0000000742, %r8
clflush (%r8)
nop
nop
nop
nop
nop
and %r14, %r14
movb $0x51, (%r8)
nop
nop
nop
cmp %r9, %r9
// Faulty Load
mov $0x23a6ce0000000742, %rcx
nop
nop
and $43102, %r14
movb (%rcx), %r15b
lea oracles, %r14
and $0xff, %r15
shlq $12, %r15
mov (%r14,%r15,1), %r15
pop %rdi
pop %rcx
pop %r9
pop %r8
pop %r15
pop %r14
pop %r12
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_NC', 'AVXalign': False, 'size': 2, 'NT': False, 'same': False, 'congruent': 0}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_RW', 'AVXalign': False, 'size': 1, 'NT': True, 'same': False, 'congruent': 7}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WC', 'AVXalign': True, 'size': 1, 'NT': False, 'same': False, 'congruent': 8}}
{'OP': 'STOR', 'dst': {'type': 'addresses_D', 'AVXalign': False, 'size': 4, 'NT': False, 'same': False, 'congruent': 9}}
{'OP': 'STOR', 'dst': {'type': 'addresses_NC', 'AVXalign': False, 'size': 1, 'NT': False, 'same': True, 'congruent': 0}}
[Faulty Load]
{'src': {'type': 'addresses_NC', 'AVXalign': False, 'size': 1, 'NT': False, 'same': True, 'congruent': 0}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 2, 'NT': False, 'same': False, 'congruent': 2}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_normal_ht', 'AVXalign': False, 'size': 16, 'NT': False, 'same': False, 'congruent': 10}}
{'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 1, 'NT': True, 'same': False, 'congruent': 2}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_WT_ht', 'AVXalign': False, 'size': 4, 'NT': False, 'same': False, 'congruent': 7}}
{'src': {'type': 'addresses_UC_ht', 'AVXalign': True, 'size': 4, 'NT': False, 'same': False, 'congruent': 3}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_A_ht', 'AVXalign': False, 'size': 1, 'NT': False, 'same': False, 'congruent': 2}}
{'src': {'type': 'addresses_UC_ht', 'congruent': 3, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_normal_ht', 'congruent': 5, 'same': False}}
{'src': {'type': 'addresses_WT_ht', 'congruent': 4, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_D_ht', 'congruent': 6, 'same': False}}
{'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 1, 'NT': True, 'same': False, 'congruent': 11}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WT_ht', 'congruent': 6, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_D_ht', 'congruent': 3, 'same': True}}
{'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 2, 'NT': False, 'same': False, 'congruent': 7}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_A_ht', 'congruent': 5, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_D_ht', 'congruent': 11, 'same': False}}
{'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 8, 'NT': False, 'same': False, 'congruent': 3}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 4, 'NT': True, 'same': False, 'congruent': 0}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 2, 'NT': False, 'same': False, 'congruent': 7}}
{'79': 1862, '51': 19831, '00': 136}
79 51 51 79 51 51 51 51 51 51 51 51 51 00 51 51 51 51 51 51 51 51 79 51 51 79 51 51 51 51 51 51 51 51 51 51 79 51 79 51 51 51 51 51 51 79 79 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 79 00 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 79 51 79 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 79 51 79 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 00 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 00 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 00 51 51 51 51 51 51 51 51 79 00 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 79 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 00 79 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 79 79 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 79 51 79 51 51 79 51 79 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 51 51 51 51 51 00 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 79 51 51 51 51 51 51 51 79
*/
|
Abhijeet_Chopra_Assign_1.asm | abhijeetchopra/assembly | 0 | 27818 | <filename>Abhijeet_Chopra_Assign_1.asm
TITLE Assignment One (Abhijeet_Chopra_Assign1.asm)
; Name: <NAME>
; CWID: 50180612
; Date: 20 Oct,16
; Task: Assignment #1
; Program Description:
; define A, B, C as 16-bit integers (i.e. WORDS)
; initialize A=10, B=30, C=20
; calculate A = max { A, B, C}
; this should work for all A, B, C, not only for the initial values
; display A
INCLUDE Irvine32.inc
INCLUDE Macros.inc
.DATA
A1 WORD 10 ; defining and initializing A1
B1 WORD 30 ; defining and initializing B1
C1 WORD 20 ; defining and initializing C1
.CODE
main PROC
mov EAX, 0 ; moving 0 to EAX to clear it
; printing A1, B1, C1
;------------------------
mWrite "A = " ; writes string, uses Macros.inc
mov AX, A1 ; moving AX to A1
call WriteInt ; displaying A
mWriteLn " " ; next line
mWrite "B = " ; writes string, uses Macros.inc
mov AX, B1 ; moving AX to A1
call WriteInt ; displaying A
mWriteLn " " ; next line
mWrite "C = " ; writes string, uses Macros.inc
mov AX, C1 ; moving AX to A1
call WriteInt ; displaying A
mWriteLn " " ; next line
; comparing A and B
;------------------------
mov AX, B1 ; moving B1 to AX
cmp A1,AX ; if (A > B)
ja LAB ; jump to L1
jmp LBA ; else jump to L2
; L1 : A1 > B1
;------------------------
LAB:
mov AX, C1 ; moving C1 to AX
cmp A1,AX ; if (A > C)
ja LABC ; jump to L3
jmp LCAB ; else jump to L4
; L2 : B1 > A1
;------------------------
LBA:
mov AX, C1 ; moving C1 to AX
cmp B1,AX ; if (B > C)
ja LBAC ; jump to L5
jmp LCBA ; else jump to L6
; L3 : A is MAX
;------------------------
LABC:
mov AX, A1 ; moving A1 to AX
jmp LEND ; else jump to LEND
; L4 : C is MAX
;------------------------
LCAB:
mov AX, C1 ; moving C1 to AX
jmp LEND ; else jump to LEND
; L5 : B is MAX
;------------------------
LBAC:
mov AX, B1 ; moving B1 to AX
jmp LEND ; else jump to LEND
; L6 : C is MAX
;------------------------
LCBA:
mov AX, C1 ; moving C1 to AX
jmp LEND ; else jump to LEND
; END
;------------------------
LEND:
mWriteLn " " ; writes string followed by end of line, uses Macros.inc
mWrite "MAX = " ; writes string, uses Macros.inc
mov A1, AX ; moving AX to A1
call WriteInt ; displaying A
mWriteLn " " ; writes string followed by end of line, uses Macros.inc
exit
main ENDP
END main |
src/tiles_zxn.asm | jardafis/CastleEscape | 1 | 179088 | IF _ZXN
public _displayTile
public displayTile
public setTileAttr
#include "defs.inc"
section CODE_2
;
; Display the specified tile and attribute at the specified location.
;
; Callable from 'C' (sccz80)
;
defvars 0 ; Define the stack variables used
{
yPos ds.b 2
xPos ds.b 2
tile ds.b 2
}
_displayTile:
entry
ld b, (ix+yPos)
ld c, (ix+xPos)
ld a, (ix+tile)
call displayTile
exit
ret
;
; Display the specified tile at the specified location.
;
; All used registers are preserved by this function.
;
; Entry:
; b - Y character location
; c - X character location
; a - Tile ID of item
;
; Exit:
; b - Y character location
; c - X character location
; a - Tile ID of item
;
displayTile:
push de
push hl
; Multiply Y by 40
ld d, b
ld e, ZXN_TILEMAP_WIDTH
mul d, e
; Add the tilemap base address
ld hl, TILEMAP_START
add hl, de
ld e, a
; Add the X offset
ld a, c
add hl, a
; Update tilemap
ld a, e ; Restore A (must be preserved for exit)
ld (hl), a
pop hl
pop de
ret
;
; Set the attribute for the tile at the specified location
;
; Entry:
; b - Y location
; c - X location
; a - Tile ID of item
;
setTileAttr:
; Does nothing for ZXN as tile attributes (colors) are embedded into
; the bitmaps. This routine is here for compatability.
ret
ENDIF
|
Ada/src/Problem_14.adb | Tim-Tom/project-euler | 0 | 24667 | <filename>Ada/src/Problem_14.adb
with Ada.Text_IO;
with Ada.Containers.Ordered_Maps;
package body Problem_14 is
package IO renames Ada.Text_IO;
procedure Solve is
type Collatz_Count is new Positive;
package Integer_Map is new Ada.Containers.Ordered_Maps(Key_Type => Long_Long_Integer, Element_Type => Collatz_Count);
table : Integer_Map.Map;
function Next(current : in Long_Long_Integer) return Long_Long_Integer is
begin
if current mod 2 = 0 then -- even
return current / 2;
else
return 3*current + 1;
end if;
end Next;
function Collatz(start : in Long_Long_Integer) return Collatz_Count is
begin
if not table.Contains(start) then
table.Insert(start, 1 + Collatz(Next(start)));
end if;
return table.Element(start);
end;
Max : Collatz_Count := 1;
Max_Pos : Long_Long_Integer := 1;
begin
table.Insert(1, 1);
for index in Long_Long_Integer(2) .. Long_Long_Integer(1_000_000) loop
declare
n : constant Collatz_Count := Collatz(index);
begin
if n > max then
Max := n;
Max_Pos := index;
end if;
end;
end loop;
IO.Put_Line(Long_Long_Integer'Image(Max_Pos) & " with a chain of " & Collatz_Count'Image(Max));
end Solve;
end Problem_14;
|
src/power-pellets.asm | santiontanon/triton | 41 | 26190 | ;-----------------------------------------------
; input:
; - c: tile x
; - b: tile y
spawn_power_pellet:
ld a,(scroll_restart)
or a
ret nz ; do not spawn power pellets on scroll restart cycles to avoid an edge case
ld hl,power_pellets
ld de,POWER_PELLET_STRUCT_SIZE
ld a,MAX_POWER_PELLETS
spawn_power_pellet_loop:
push af
ld a,(hl)
or a
jr nz,spawn_power_pellet_next
pop af
; spot found:
push hl ; save this pointer, in case the spawn is not allowed
ld (hl),1
inc hl
ld (hl),c
inc hl
ld (hl),b
inc hl
ld (hl),0 ; POWER_PELLET_STRUCT_BG_FLAG
inc hl
; calculate the pointer of where the pellet has to be drawn:
push hl
ld e,b
ld d,0
ld hl,map_y_ptr_table
add hl,de
add hl,de
ld e,(hl)
inc hl
ld d,(hl) ; de now has the y ptr
ld h,0
ld l,c
add hl,de
ex de,hl
pop hl
ld (hl),e
inc hl
ld (hl),d
; ld a,b
; cp 8
; jr nc,spawn_power_pellet_bank2
spawn_power_pellet_bank1:
ld b,FIRST_WALL_COLLIDABLE_TILE
; jr spawn_power_pellet_bank_selected
; spawn_power_pellet_bank2:
; ld b,FIRST_WALL_COLLIDABLE_TILE_BANK_2
spawn_power_pellet_bank_selected:
pop hl
; check that there is no obstacle underneath (power pellets cannot spawn over walls):
ld a,(de)
cp b
jr nc,spawn_power_pellet_not_allowed
inc de
ld a,(de)
cp b
jr nc,spawn_power_pellet_not_allowed
inc de
ld a,(de)
cp b
jr nc,spawn_power_pellet_not_allowed
inc de
ld a,(de)
cp b
jr nc,spawn_power_pellet_not_allowed
ld hl,redraw_power_pellets_signal
ld (hl),1
ret
spawn_power_pellet_next:
add hl,de
pop af
dec a
jr nz,spawn_power_pellet_loop
ret
spawn_power_pellet_not_allowed:
ld (hl),0
ret
;-----------------------------------------------
; preserves IX, IY
power_pellets_restore_bg:
ld hl,power_pellets+((MAX_POWER_PELLETS-1)*POWER_PELLET_STRUCT_SIZE)
ld de,-POWER_PELLET_STRUCT_SIZE
ld b,MAX_POWER_PELLETS
power_pellets_restore_bg_loop:
ld a,(hl)
or a
jr z,power_pellets_restore_bg_next
; restore bg:
push hl
push de
push bc
rla
jr nc,power_pellets_restore_bg_loop_no_deletion
; it was marked for deletion, delete it
ld (hl),0
power_pellets_restore_bg_loop_no_deletion:
inc hl ; skip type
ld a,(scroll_x_tile)
add a,-2
cp (hl) ; x
jp p,power_pellets_restore_bg_loop_skip
inc hl
inc hl
ld a,(hl) ; check if any BG has been saved yet
or a
jr z,power_pellets_restore_bg_loop_continue
inc hl
ld e,(hl)
inc hl
ld d,(hl)
inc hl
ldi
ldi
ldi
power_pellets_restore_bg_loop_continue:
pop bc
pop de
pop hl
power_pellets_restore_bg_next:
add hl,de
djnz power_pellets_restore_bg_loop
ret
power_pellets_restore_bg_loop_skip:
dec hl
ld (hl),0 ; remove the power pellet
jr power_pellets_restore_bg_loop_continue
;-----------------------------------------------
; preserves IX, IY
power_pellets_draw:
ld hl,power_pellets
ld de,POWER_PELLET_STRUCT_SIZE
ld b,MAX_POWER_PELLETS
power_pellets_draw_loop:
ld a,(hl)
or a
jr z,power_pellets_draw_next
push hl
push de
push bc
; save bg:
inc hl ; skip type
ld a,(scroll_x_tile)
dec a
cp (hl) ; x
jp p,power_pellets_draw_loop_skip
inc hl
ld a,(hl) ; y
inc hl
ld (hl),1 ; POWER_PELLET_STRUCT_BG_FLAG
inc hl
ld e,(hl) ; ptrl
inc hl
ld d,(hl) ; ptrh
inc hl
ex de,hl ; hl has the pointer to the map where to draw, de points to the BG buffer
push hl
ldi
ldi
ldi
pop de
; draw:
cp 8 ; a has the value of "y"
jp p,power_pellets_draw_bank1
ld hl,power_pellet_types_bank0
jr power_pellets_draw_bank_set
power_pellets_draw_bank1:
ld hl,power_pellet_types_bank1
power_pellets_draw_bank_set:
ldi
ldi
ldi
power_pellets_draw_loop_continue:
pop bc
pop de
pop hl
power_pellets_draw_next:
add hl,de
djnz power_pellets_draw_loop
ret
power_pellets_draw_loop_skip:
dec hl
ld (hl),0 ; remove the power pellet
jr power_pellets_draw_loop_continue
;-----------------------------------------------
; Since the scroll works on a circular buffer, when the scroll circles back,
; we need to adjust the coordinates of the power pellets, to bring them back to where the viewport is
adjust_power_pellet_positions_after_scroll_restart:
ld ix,power_pellets
ld b,MAX_POWER_PELLETS
ld de,POWER_PELLET_STRUCT_SIZE
adjust_power_pellet_positions_loop:
ld a,(ix)
or a
jr z,adjust_power_pellet_positions_loop_next
ld a,(ix+POWER_PELLET_STRUCT_X)
sub 64
jp p,adjust_power_pellet_positions_adjust
; power pellet got out of the scroll
ld (ix),0
adjust_power_pellet_positions_loop_next:
add ix,de
djnz adjust_power_pellet_positions_loop
ret
adjust_power_pellet_positions_adjust:
ld (ix+POWER_PELLET_STRUCT_X),a
push bc
push de
ld l,(ix+POWER_PELLET_STRUCT_PTRL)
ld h,(ix+POWER_PELLET_STRUCT_PTRH)
ld bc,-64
add hl,bc
ld (ix+POWER_PELLET_STRUCT_PTRL),l
ld (ix+POWER_PELLET_STRUCT_PTRH),h
ex de,hl
; draw the power pellet in the new position (no need to store the bg, as it should be the same as before):
ld a,(ix+POWER_PELLET_STRUCT_Y)
cp 8
jp p,adjust_power_pellet_positions_bank1
ld hl,power_pellet_types_bank0
jr adjust_power_pellet_positions_bank_set
adjust_power_pellet_positions_bank1:
ld hl,power_pellet_types_bank1
adjust_power_pellet_positions_bank_set:
ldi
ldi
ldi
pop de
pop bc
jr adjust_power_pellet_positions_loop_next
;-----------------------------------------------
power_pellet_pickup:
ld ix,power_pellets
ld b,MAX_POWER_PELLETS
ld a,(player_tile_y)
ld c,a
ld de,POWER_PELLET_STRUCT_SIZE
power_pellet_pickup_loop:
ld a,(ix)
or a
jr z,power_pellet_pickup_loop_next
ld a,c
cp (ix+POWER_PELLET_STRUCT_Y)
jr nz,power_pellet_pickup_loop_next
ld a,(player_tile_x)
cp (ix+POWER_PELLET_STRUCT_X)
jp m,power_pellet_pickup_loop_next
sub 3
cp (ix+POWER_PELLET_STRUCT_X)
jp p,power_pellet_pickup_loop_next
; found! mark pellet for deletion
set 7,(ix)
ld hl,redraw_power_pellets_signal
ld (hl),1
ld hl,SFX_power_capsule
call play_SFX_with_high_priority
ld hl,ingame_weapon_current_selection
ld a,(hl)
cp 7
jp z,select_weapon_sfx
inc a
and #07
ld (hl),a
jp update_scoreboard_weapon_selection
power_pellet_pickup_loop_next:
add ix,de
djnz power_pellet_pickup_loop
ld hl,redraw_power_pellets_signal
ld (hl),1
ret
|
src/main/fragment/mos6502-common/vwum1=vwum2_minus_vbuaa.asm | jbrandwood/kickc | 2 | 4646 | eor #$ff
sec
adc {m2}
sta {m1}
lda {m2}+1
sbc #0
sta {m1}+1
|
3-mid/impact/source/3d/collision/broadphase/impact-d3-collision-overlapped_pair_callback-cached.adb | charlie5/lace | 20 | 3922 | with Ada.Containers;
with Ada.Unchecked_Conversion;
with impact.d3.collision.Proxy,
impact.d3.Collision.Algorithm;
package body impact.d3.collision.overlapped_pair_Callback.cached
--
--
--
is
-----------
--- Globals
--
gOverlappingPairs : Integer := 0;
gRemovePairs : Integer := 0;
gAddedPairs : Integer := 0;
gFindPairs : Integer := 0;
--------------------------------
--- btHashedOverlappingPairCache
--
--- Forge
--
function to_btHashedOverlappingPairCache return btHashedOverlappingPairCache
is
Self : btHashedOverlappingPairCache;
begin
Self.m_blockedForChanges := False;
Self.m_overlappingPairArray.reserve_Capacity (2);
Self.growTables;
return Self;
end to_btHashedOverlappingPairCache;
function new_btHashedOverlappingPairCache return btHashedOverlappingPairCache_view
is
Self : constant btHashedOverlappingPairCache_view := new btHashedOverlappingPairCache;
begin
Self.m_blockedForChanges := False;
Self.m_overlappingPairArray.reserve_Capacity (2);
Self.growTables;
return Self;
-- return new btHashedOverlappingPairCache' (to_btHashedOverlappingPairCache);
end new_btHashedOverlappingPairCache;
overriding procedure destruct (Self : in out btHashedOverlappingPairCache)
is
begin
null;
end destruct;
--- Attributes
--
overriding function getOverlappingPairArrayPtr (Self : in btHashedOverlappingPairCache) return btBroadphasePair_Vectors.Cursor
is
begin
return Self.m_overlappingPairArray.First;
end getOverlappingPairArrayPtr;
overriding function getOverlappingPairArray (Self : access btHashedOverlappingPairCache) return access btBroadphasePairArray
is
begin
return Self.m_overlappingPairArray'Access;
end getOverlappingPairArray;
overriding procedure cleanOverlappingPair (Self : in out btHashedOverlappingPairCache; pair : access impact.d3.collision.Proxy.btBroadphasePair;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
pragma Unreferenced (Self);
begin
if pair.m_algorithm /= null then
pair.m_algorithm.destruct;
dispatcher.freeCollisionAlgorithm (pair.m_algorithm);
pair.m_algorithm := null;
end if;
end cleanOverlappingPair;
overriding function getNumOverlappingPairs (Self : in btHashedOverlappingPairCache) return Integer
is
begin
return Integer (Self.m_overlappingPairArray.Length);
end getNumOverlappingPairs;
--- 'cleanProxyFromPairs'
--
type CleanPairCallback is new btOverlapCallback with
record
m_cleanProxy : access impact.d3.collision.Proxy.item'Class;
m_pairCache : access impact.d3.collision.overlapped_pair_Callback.cached.Item'Class;
m_dispatcher : access impact.d3.Dispatcher.item'Class;
end record;
overriding function processOverlap (Self : in CleanPairCallback; pair : access impact.d3.collision.Proxy.btBroadphasePair) return Boolean
is
begin
if pair.m_pProxy0 = Self.m_cleanProxy
or else pair.m_pProxy1 = Self.m_cleanProxy
then
Self.m_pairCache.cleanOverlappingPair (pair, Self.m_dispatcher);
end if;
return False;
end processOverlap;
function to_CleanPairCallback (cleanProxy : access impact.d3.collision.Proxy.item'Class;
pairCache : access impact.d3.collision.overlapped_pair_Callback.cached.Item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class) return CleanPairCallback
is
Self : CleanPairCallback;
begin
Self.m_cleanProxy := cleanProxy;
Self.m_pairCache := pairCache;
Self.m_dispatcher := dispatcher;
return Self;
end to_CleanPairCallback;
overriding procedure cleanProxyFromPairs (Self : access btHashedOverlappingPairCache; proxy : access impact.d3.collision.Proxy.item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
cleanPairs : aliased CleanPairCallback := to_CleanPairCallback (proxy, Self, dispatcher);
begin
Self.processAllOverlappingPairs (cleanPairs'Access, dispatcher);
end cleanProxyFromPairs;
overriding procedure setOverlapFilterCallback (Self : in out btHashedOverlappingPairCache; callback : access btOverlapFilterCallback'Class)
is
begin
Self.m_overlapFilterCallback := callback;
end setOverlapFilterCallback;
function getOverlapFilterCallback (Self : access btHashedOverlappingPairCache) return access btOverlapFilterCallback'Class
is
begin
return Self.m_overlapFilterCallback;
end getOverlapFilterCallback;
function needsBroadphaseCollision (Self : in btHashedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class) return Boolean
is
use type impact.d3.collision.Proxy.CollisionFilterGroups;
collides : Boolean;
begin
if Self.m_overlapFilterCallback /= null then
return Self.m_overlapFilterCallback.needBroadphaseCollision (proxy0, proxy1);
end if;
collides := (proxy0.m_collisionFilterGroup and proxy1.m_collisionFilterMask) /= 0;
collides := collides and then (proxy1.m_collisionFilterGroup and proxy0.m_collisionFilterMask) /= 0;
return collides;
end needsBroadphaseCollision;
function internalAddPair (Self : access btHashedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class) return access impact.d3.collision.Proxy.btBroadphasePair
is
use Interfaces;
use type Ada.Containers.Count_type;
the_proxy0 : access impact.d3.collision.Proxy.item'Class := proxy0;
the_proxy1 : access impact.d3.collision.Proxy.item'Class := proxy1;
proxyId1,
proxyId2,
hash : Integer;
pair : access impact.d3.collision.Proxy.btBroadphasePair;
count,
oldCapacity,
newCapacity : Integer;
unused : access impact.d3.collision.Proxy.btBroadphasePair;
pragma Unreferenced (unused);
function to_Integer is new ada.unchecked_Conversion (Unsigned_32, Integer);
begin
if proxy0.m_uniqueId > proxy1.m_uniqueId then
declare
Pad : constant access impact.d3.collision.Proxy.item := the_proxy0;
begin
the_proxy0 := the_proxy1;
the_proxy1 := Pad; -- btSwap (proxy0, proxy1);
end;
end if;
proxyId1 := the_proxy0.getUid;
proxyId2 := the_proxy1.getUid;
declare
kkk : Unsigned_32 := getHash (proxyId1, proxyId2);
ppp : Integer := Integer (Self.m_overlappingPairArray.capacity - 1);
jjj : Unsigned_32 := Unsigned_32 (Self.m_overlappingPairArray.capacity - 1);
begin
null;
end;
hash := to_Integer (getHash (proxyId1, proxyId2) and Unsigned_32 (Self.m_overlappingPairArray.capacity - 1)); -- New hash value with new mask.
pair := Self.internalFindPair (the_proxy0, the_proxy1, hash);
if pair /= null then
return pair;
end if;
count := Integer (Self.m_overlappingPairArray.Length);
oldCapacity := Integer (Self.m_overlappingPairArray.capacity);
-- void* mem = &m_overlappingPairArray.expandNonInitializing();
-- pair = new (mem) btBroadphasePair(*proxy0,*proxy1);
pair := new impact.d3.collision.Proxy.btBroadphasePair'(impact.d3.collision.Proxy.to_btBroadphasePair (the_proxy0, the_proxy1));
pair.m_algorithm := null;
pair.internals.m_internalTmpValue := 0;
Self.m_overlappingPairArray.append (pair);
-- this is where we add an actual pair, so also call the 'ghost'
--
if Self.m_ghostPairCallback /= null then
unused := Self.m_ghostPairCallback.addOverlappingPair (the_proxy0, the_proxy1);
end if;
newCapacity := Integer (Self.m_overlappingPairArray.capacity);
if oldCapacity < newCapacity then
Self.growTables;
hash := Integer (getHash (proxyId1, proxyId2) and Unsigned_32 (Self.m_overlappingPairArray.capacity - 1)); -- hash with new capacity
end if;
Self.m_next .replace_Element (count + 1, Unsigned_32'(Self.m_hashTable.Element (hash + 1)));
Self.m_hashTable.replace_Element (hash + 1, Unsigned_32 (count + 1));
return pair;
end internalAddPair;
procedure growTables (Self : in out btHashedOverlappingPairCache)
is
use type ada.containers.Count_type;
newCapacity : constant ada.containers.Count_type := Self.m_overlappingPairArray.capacity;
curHashtableSize : Integer;
begin
if Self.m_hashTable.Length < newCapacity then -- grow 'hashtable' and 'next' table
curHashtableSize := Integer (Self.m_hashTable.Length);
Self.m_hashTable.set_Length (newCapacity);
Self.m_next .set_Length (newCapacity);
for i in 1 .. Integer (newCapacity)
loop
Self.m_hashTable.replace_Element (i, BT_NULL_PAIR);
end loop;
for i in 1 .. Integer (newCapacity)
loop
Self.m_next.replace_Element (i, BT_NULL_PAIR);
end loop;
for i in 1 .. Integer (curHashtableSize)
loop
declare
use Interfaces;
pair : constant access impact.d3.collision.Proxy.btBroadphasePair := Self.m_overlappingPairArray.Element (i);
proxyId1 : constant Integer := pair.m_pProxy0.getUid;
proxyId2 : constant Integer := pair.m_pProxy1.getUid;
hashValue : constant Unsigned_32 := (getHash (proxyId1, proxyId2) and Unsigned_32 (Self.m_overlappingPairArray.capacity - 1)) + 1; -- New hash value with new mask
begin
Self.m_next .replace_Element (i, Unsigned_32'(Self.m_hashTable.Element (Integer (hashValue))));
Self.m_hashTable.replace_Element (Integer (hashValue), Unsigned_32 (i));
end;
end loop;
end if;
end growTables;
function equalsPair (Self : in btHashedOverlappingPairCache; pair : in impact.d3.collision.Proxy.btBroadphasePair;
proxyId1, proxyId2 : in Integer) return Boolean
is
pragma Unreferenced (Self);
begin
return pair.m_pProxy0.getUid = proxyId1
and then pair.m_pProxy1.getUid = proxyId2;
end equalsPair;
overriding procedure processAllOverlappingPairs (Self : in out btHashedOverlappingPairCache; callback : access btOverlapCallback'Class;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
pair : access impact.d3.collision.Proxy.btBroadphasePair;
i : Integer := 1;
unused : access Any'Class;
pragma Unreferenced (unused);
begin
while i <= Integer (Self.m_overlappingPairArray.Length)
loop
pair := Self.m_overlappingPairArray.Element (i);
if callback.processOverlap (pair) then
unused := Self.removeOverlappingPair (pair.m_pProxy0, pair.m_pProxy1, dispatcher);
gOverlappingPairs := gOverlappingPairs - 1;
else
i := i + 1;
end if;
end loop;
end processAllOverlappingPairs;
overriding function findPair (Self : in btHashedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item) return access impact.d3.collision.Proxy.btBroadphasePair
is
use Interfaces;
the_proxy0 : access impact.d3.collision.Proxy.item := proxy0;
the_proxy1 : access impact.d3.collision.Proxy.item := proxy1;
index,
hash : Integer;
proxyId1,
proxyId2 : Integer;
begin
gFindPairs := gFindPairs + 1;
if the_proxy0.m_uniqueId > the_proxy1.m_uniqueId then
declare
Pad : constant access impact.d3.collision.Proxy.item := the_proxy0;
begin
the_proxy0 := the_proxy1;
the_proxy1 := Pad; -- btSwap (proxy0, proxy1);
end;
end if;
proxyId1 := the_proxy0.getUid;
proxyId2 := the_proxy1.getUid;
hash := Integer (getHash (proxyId1, proxyId2) and (Unsigned_32 (Self.m_overlappingPairArray.capacity) - 1));
if hash >= Integer (Self.m_hashTable.Length) then
return null;
end if;
index := Integer (Unsigned_32'(Self.m_hashTable.Element (hash)));
while Unsigned_32 (index) /= BT_NULL_PAIR
and then not Self.equalsPair (Self.m_overlappingPairArray.Element (index).all, proxyId1, proxyId2)
loop
index := Integer (Unsigned_32'(Self.m_next.Element (index)));
end loop;
if Unsigned_32 (index) = BT_NULL_PAIR then
return null;
end if;
pragma Assert (index <= Integer (Self.m_overlappingPairArray.Length));
return Self.m_overlappingPairArray.Element (index);
end findPair;
overriding function hasDeferredRemoval (Self : in btHashedOverlappingPairCache) return Boolean
is
pragma Unreferenced (Self);
begin
return False;
end hasDeferredRemoval;
overriding procedure setInternalGhostPairCallback (Self : in out btHashedOverlappingPairCache; ghostPairCallback : access impact.d3.collision.overlapped_pair_Callback.item'Class)
is
begin
Self.m_ghostPairCallback := ghostPairCallback;
end setInternalGhostPairCallback;
overriding procedure sortOverlappingPairs (Self : in out btHashedOverlappingPairCache; dispatcher : access impact.d3.Dispatcher.item'Class)
is
-- need to keep hashmap in sync with pair address, so rebuild all
tmpPairs : btBroadphasePairArray;
function "<" (L, R : in impact.d3.collision.Proxy.btBroadphasePair_view) return Boolean
is
begin
return impact.d3.collision.Proxy.btBroadphasePairSortPredicate (L.all, R.all);
end;
package Sorter is new btBroadphasePair_Vectors.generic_Sorting ("<");
unused : access Any'Class;
pragma Unreferenced (unused);
unused_pair : access impact.d3.collision.Proxy.btBroadphasePair;
pragma Unreferenced (unused_pair);
begin
for i in 1 .. Integer (Self.m_overlappingPairArray.Length)
loop
tmpPairs.append (Self.m_overlappingPairArray.Element (i));
end loop;
for i in 1 .. Integer (tmpPairs.Length)
loop
unused := Self.removeOverlappingPair (tmpPairs.Element (i).m_pProxy0, tmpPairs.Element (i).m_pProxy1, dispatcher);
end loop;
for i in 1 .. Integer (Self.m_next.Length)
loop
Self.m_next.replace_Element (i, BT_NULL_PAIR);
end loop;
Sorter.sort (tmpPairs); -- tmpPairs.quickSort (btBroadphasePairSortPredicate());
for i in 1 .. Integer (tmpPairs.Length)
loop
unused_pair := Self.addOverlappingPair (tmpPairs.Element (i).m_pProxy0,
tmpPairs.Element (i).m_pProxy1);
end loop;
end sortOverlappingPairs;
-- Add a pair and return the new pair. If the pair already exists,
-- no new pair is created and the old one is returned.
--
overriding function addOverlappingPair (Self : access btHashedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class) return access impact.d3.collision.Proxy.btBroadphasePair
is
begin
gAddedPairs := gAddedPairs + 1;
if not Self.needsBroadphaseCollision (proxy0, proxy1) then
return null;
end if;
return Self.internalAddPair (proxy0, proxy1);
end addOverlappingPair;
overriding function removeOverlappingPair (Self : access btHashedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class) return access Any'Class
is
use Interfaces;
use type Ada.Containers.count_type;
the_proxy0 : access impact.d3.collision.Proxy.item := proxy0;
the_proxy1 : access impact.d3.collision.Proxy.item := proxy1;
proxyId1,
proxyId2 : Integer;
hash : Integer;
pair : access impact.d3.collision.Proxy.btBroadphasePair;
userData : access Any'Class;
pairIndex,
lastPairIndex : Integer;
index,
previous : Unsigned_32;
last : access impact.d3.collision.Proxy.btBroadphasePair;
lastHash : Integer;
unused : access Any'Class;
pragma Unreferenced (unused);
begin
gRemovePairs := gRemovePairs + 1;
if the_proxy0.m_uniqueId > the_proxy1.m_uniqueId then
declare
Pad : constant access impact.d3.collision.Proxy.item := the_proxy0;
begin
the_proxy0 := the_proxy1;
the_proxy1 := Pad; -- btSwap (proxy0, proxy1);
end;
end if;
proxyId1 := the_proxy0.getUid;
proxyId2 := the_proxy1.getUid;
hash := Integer (getHash (proxyId1, proxyId2) and Unsigned_32 (Self.m_overlappingPairArray.capacity - 1));
pair := Self.internalFindPair (the_proxy0, the_proxy1, hash);
if pair = null then
return null;
end if;
Self.cleanOverlappingPair (pair, dispatcher);
userData := pair.internals.m_internalInfo1;
pragma Assert (pair.m_pProxy0.getUid = proxyId1);
pragma Assert (pair.m_pProxy1.getUid = proxyId2);
pairIndex := Self.internalFindPairIndex (the_proxy0, the_proxy1, hash); -- Integer (pair - Self.m_overlappingPairArray (1));
pragma Assert (pairIndex <= Integer (Self.m_overlappingPairArray.Length));
-- Remove the pair from the hash table.
index := Self.m_hashTable.Element (hash + 1);
pragma Assert (Unsigned_32 (index) /= BT_NULL_PAIR);
previous := BT_NULL_PAIR;
while index /= Unsigned_32 (pairIndex)
loop
previous := index;
index := Self.m_next.Element (Integer (index));
end loop;
if previous /= BT_NULL_PAIR then
pragma Assert (Self.m_next.Element (Integer (previous)) = Unsigned_32 (pairIndex));
Self.m_next.replace_Element (Integer (previous), Unsigned_32'(Self.m_next.Element (pairIndex)));
else
Self.m_hashTable.replace_Element (hash + 1, Unsigned_32'(Self.m_next.Element (pairIndex)));
end if;
-- We now move the last pair into spot of the
-- pair being removed. We need to fix the hash
-- table indices to support the move.
lastPairIndex := Integer (Self.m_overlappingPairArray.Length - 0);
if Self.m_ghostPairCallback /= null then
unused := Self.m_ghostPairCallback.removeOverlappingPair (the_proxy0, the_proxy1, dispatcher);
end if;
-- If the removed pair is the last pair, we are done.
--
if lastPairIndex = pairIndex then
Self.m_overlappingPairArray.delete_Last;
return userData;
end if;
-- Remove the last pair from the hash table.
last := Self.m_overlappingPairArray.Element (lastPairIndex);
-- missing swap here too, Nat.
lastHash := Integer (getHash (last.m_pProxy0.getUid, last.m_pProxy1.getUid) and Unsigned_32 (Self.m_overlappingPairArray.capacity - 1));
index := Self.m_hashTable.Element (lastHash + 1);
pragma Assert (index /= BT_NULL_PAIR);
previous := BT_NULL_PAIR;
while index /= Unsigned_32 (lastPairIndex)
loop
previous := index;
index := Self.m_next.Element (Integer (index));
end loop;
if previous /= BT_NULL_PAIR then
pragma Assert (Unsigned_32'(Self.m_next.Element (Integer (previous))) = Unsigned_32 (lastPairIndex));
Self.m_next.replace_Element (Integer (previous), Unsigned_32'(Self.m_next.Element (lastPairIndex)));
else
Self.m_hashTable.replace_Element (lastHash + 1, Unsigned_32'(Self.m_next.Element (lastPairIndex)));
end if;
-- Copy the last pair into the remove pair's spot.
Self.m_overlappingPairArray.replace_Element (pairIndex, impact.d3.collision.Proxy.btBroadphasePair_view'(Self.m_overlappingPairArray.Element (lastPairIndex)));
-- Insert the last pair into the hash table
Self.m_next.replace_Element (pairIndex, Unsigned_32'(Self.m_hashTable.Element (lastHash + 1)));
Self.m_hashTable.replace_Element (lastHash + 1, Unsigned_32 (pairIndex));
Self.m_overlappingPairArray.delete_Last;
return userData;
end removeOverlappingPair;
--- 'removeOverlappingPairsContainingProxy'
--
type RemovePairCallback is new btOverlapCallback with
record
m_obsoleteProxy : access impact.d3.collision.Proxy.item'Class;
end record;
overriding function processOverlap (Self : in RemovePairCallback; pair : access impact.d3.collision.Proxy.btBroadphasePair) return Boolean
is
begin
return pair.m_pProxy0 = Self.m_obsoleteProxy
or else pair.m_pProxy1 = Self.m_obsoleteProxy;
end processOverlap;
function to_RemovePairCallback (obsoleteProxy : access impact.d3.collision.Proxy.item'Class) return RemovePairCallback
is
Self : RemovePairCallback;
begin
Self.m_obsoleteProxy := obsoleteProxy;
return Self;
end to_RemovePairCallback;
overriding procedure removeOverlappingPairsContainingProxy (Self : access btHashedOverlappingPairCache; proxy0 : access impact.d3.collision.Proxy.item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
removeCallback : aliased RemovePairCallback := to_RemovePairCallback (proxy0);
begin
Self.processAllOverlappingPairs (removeCallback'Access, dispatcher);
end removeOverlappingPairsContainingProxy;
function GetCount (Self : in btHashedOverlappingPairCache) return Integer
is
begin
return Integer (Self.m_overlappingPairArray.Length);
end GetCount;
function internalFindPairIndex (Self : access btHashedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class;
hash : in Integer) return Integer
is
use Interfaces;
proxyId1 : constant Integer := proxy0.getUid;
proxyId2 : constant Integer := proxy1.getUid;
index : Unsigned_32 := Self.m_hashTable.Element (hash + 1);
begin
while Interfaces.unsigned_32 (index) /= BT_NULL_PAIR
and then not Self.equalsPair (Self.m_overlappingPairArray.Element (Integer (index)).all, proxyId1, proxyId2)
loop
index := Self.m_next.Element (Integer (index));
end loop;
if Interfaces.unsigned_32 (index) = BT_NULL_PAIR then
return 0;
end if;
pragma Assert (index <= Unsigned_32 (Self.m_overlappingPairArray.Length));
return Integer (index);
end internalFindPairIndex;
function internalFindPair (Self : access btHashedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class;
hash : in Integer) return access collision.Proxy.btBroadphasePair
is
index : constant Integer := Self.internalFindPairIndex (proxy0, proxy1, hash);
begin
if index = 0 then
return null;
end if;
return Self.m_overlappingPairArray.Element (index);
end internalFindPair;
function getHash (proxyId1, proxyId2 : in Integer) return Interfaces.Unsigned_32
is
use Interfaces;
key : Unsigned_32 := Unsigned_32 (proxyId1)
or shift_Left (Unsigned_32 (proxyId2), 16);
begin
-- <NAME>'s hash
--
key := key + not shift_Left (key, 15);
key := key xor shift_Right (key, 10);
key := key + shift_Left (key, 3);
key := key xor shift_Right (key, 6);
key := key + not shift_Left (key, 11);
key := key xor shift_Right (key, 16);
return key;
end getHash;
--------------------------------
--- btSortedOverlappingPairCache
--
--- Forge
--
function to_btSortedOverlappingPairCache return btSortedOverlappingPairCache
is
Self : btSortedOverlappingPairCache;
begin
Self.m_blockedForChanges := False;
Self.m_hasDeferredRemoval := True;
Self.m_overlappingPairArray.reserve_Capacity (2);
return Self;
end to_btSortedOverlappingPairCache;
overriding procedure destruct (Self : in out btSortedOverlappingPairCache)
is
begin
null;
end destruct;
--- Attributes
--
overriding function getOverlappingPairArrayPtr (Self : in btSortedOverlappingPairCache) return btBroadphasePair_Vectors.Cursor
is
begin
return Self.m_overlappingPairArray.First;
end getOverlappingPairArrayPtr;
overriding function getOverlappingPairArray (Self : access btSortedOverlappingPairCache) return access btBroadphasePairArray
is
begin
return Self.m_overlappingPairArray'Access;
end getOverlappingPairArray;
overriding procedure cleanOverlappingPair (Self : in out btSortedOverlappingPairCache; pair : access impact.d3.collision.Proxy.btBroadphasePair;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
pragma Unreferenced (Self);
begin
if pair.m_algorithm /= null then
pair.m_algorithm.destruct;
dispatcher.freeCollisionAlgorithm (pair.m_algorithm);
pair.m_algorithm := null;
gRemovePairs := gRemovePairs - 1;
end if;
end cleanOverlappingPair;
overriding function getNumOverlappingPairs (Self : in btSortedOverlappingPairCache) return Integer
is
begin
return Integer (Self.m_overlappingPairArray.Length);
end getNumOverlappingPairs;
overriding procedure cleanProxyFromPairs (Self : access btSortedOverlappingPairCache; proxy : access impact.d3.collision.Proxy.item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
type CleanPairCallback is new btOverlapCallback with
record
m_cleanProxy : access impact.d3.collision.Proxy.item;
m_pairCache : access impact.d3.collision.overlapped_pair_Callback.cached.Item'Class;
m_dispatcher : access impact.d3.Dispatcher.item;
end record;
overriding function processOverlap (Self : in CleanPairCallback; pair : access impact.d3.collision.Proxy.btBroadphasePair) return Boolean;
function to_CleanPairCallback (cleanProxy : access impact.d3.collision.Proxy.item'Class;
pairCache : access impact.d3.collision.overlapped_pair_Callback.cached.item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class) return CleanPairCallback
is
Self : CleanPairCallback;
begin
Self.m_cleanProxy := cleanProxy;
Self.m_pairCache := pairCache;
Self.m_dispatcher := dispatcher;
return Self;
end to_CleanPairCallback;
overriding function processOverlap (Self : in CleanPairCallback; pair : access impact.d3.collision.Proxy.btBroadphasePair) return Boolean
is
begin
if pair.m_pProxy0 = Self.m_cleanProxy
or else pair.m_pProxy1 = Self.m_cleanProxy
then
Self.m_pairCache.cleanOverlappingPair (pair, Self.m_dispatcher);
end if;
return False;
end processOverlap;
cleanPairs : aliased CleanPairCallback := to_CleanPairCallback (proxy, Self, dispatcher);
begin
Self.processAllOverlappingPairs (cleanPairs'Access, dispatcher);
end cleanProxyFromPairs;
overriding procedure processAllOverlappingPairs (Self : in out btSortedOverlappingPairCache; callback : access btOverlapCallback'Class;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
i : Integer := 1;
pair : impact.d3.collision.Proxy.btBroadphasePair_view;
begin
while i <= Integer (Self.m_overlappingPairArray.Length)
loop
pair := Self.m_overlappingPairArray.Element (i);
if callback.processOverlap (pair) then
Self.cleanOverlappingPair (pair, dispatcher);
pair.m_pProxy0 := null;
pair.m_pProxy1 := null;
Self.m_overlappingPairArray.swap (i, Integer (Self.m_overlappingPairArray.Length) - 0);
Self.m_overlappingPairArray.delete_Last;
gOverlappingPairs := gOverlappingPairs - 1;
else
i := i + 1;
end if;
end loop;
end processAllOverlappingPairs;
-- This findPair becomes really slow. Either sort the list to speedup the query, or
-- use a different solution. It is mainly used for Removing overlapping pairs. Removal could be delayed.
-- we could keep a linked list in each proxy, and store pair in one of the proxies (with lowest memory address)
-- Also we can use a 2D bitmap, which can be useful for a future GPU implementation
--
overriding function findPair (Self : in btSortedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item) return access impact.d3.collision.Proxy.btBroadphasePair
is
begin
if not Self.needsBroadphaseCollision (proxy0, proxy1) then
return null;
end if;
declare
use btBroadphasePair_Vectors, impact.d3.collision.Proxy;
tmpPair : constant btBroadphasePair := to_btBroadphasePair (proxy0, proxy1);
Cursor : btBroadphasePair_Vectors.Cursor := Self.m_overlappingPairArray.First;
begin
while has_Element (Cursor)
loop
if Element (Cursor).all = tmpPair then
return Element (Cursor);
end if;
next (Cursor);
end loop;
end;
return null;
end findPair;
overriding function hasDeferredRemoval (Self : in btSortedOverlappingPairCache) return Boolean
is
begin
return Self.m_hasDeferredRemoval;
end hasDeferredRemoval;
overriding procedure setInternalGhostPairCallback (Self : in out btSortedOverlappingPairCache; ghostPairCallback : access impact.d3.collision.overlapped_pair_Callback.item'Class)
is
begin
Self.m_ghostPairCallback := ghostPairCallback;
end setInternalGhostPairCallback;
overriding procedure sortOverlappingPairs (Self : in out btSortedOverlappingPairCache; dispatcher : access impact.d3.Dispatcher.item'Class)
is
begin
null; -- Should already be sorted.
end sortOverlappingPairs;
function needsBroadphaseCollision (Self : in btSortedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class) return Boolean
is
use type impact.d3.collision.Proxy.CollisionFilterGroups;
collides : Boolean;
begin
if Self.m_overlapFilterCallback /= null then
return Self.m_overlapFilterCallback.needBroadphaseCollision (proxy0, proxy1);
end if;
collides := (proxy0.m_collisionFilterGroup and proxy1.m_collisionFilterMask) /= 0;
collides := collides and then (proxy1.m_collisionFilterGroup and proxy0.m_collisionFilterMask) /= 0;
return collides;
end needsBroadphaseCollision;
overriding function addOverlappingPair (Self : access btSortedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class) return access impact.d3.collision.Proxy.btBroadphasePair
is
begin
pragma Assert (proxy0 /= proxy1); -- don't add overlap with own
if not Self.needsBroadphaseCollision (proxy0, proxy1) then
return null;
end if;
declare
use impact.d3.collision.Proxy;
pair : constant btBroadphasePair_view := new btBroadphasePair'(to_btBroadphasePair (proxy0, proxy1));
unused : access btBroadphasePair;
pragma Unreferenced (unused);
begin
gOverlappingPairs := gOverlappingPairs + 1;
gAddedPairs := gAddedPairs + 1;
if Self.m_ghostPairCallback /= null then
unused := Self.m_ghostPairCallback.addOverlappingPair (proxy0, proxy1);
end if;
Self.m_overlappingPairArray.Append (pair);
return pair;
end;
end addOverlappingPair;
type Any_View is access all Any'Class;
overriding
function removeOverlappingPair (Self : access btSortedOverlappingPairCache; proxy0, proxy1 : access impact.d3.collision.Proxy.item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class) return access Any'Class
is
use impact.d3.collision.Proxy;
findPair : btBroadphasePair_view;
findIndex : Integer;
userData : Any_view;
begin
if not Self.hasDeferredRemoval then
findPair := new btBroadphasePair'(to_btBroadphasePair (proxy0, proxy1));
findIndex := Self.m_overlappingPairArray.find_Index (findPair);
if findIndex <= Integer (Self.m_overlappingPairArray.Length) then
gOverlappingPairs := gOverlappingPairs - 1;
declare
pair : constant btBroadphasePair_view := Self.m_overlappingPairArray.Element (findIndex);
unused : access Any'Class;
pragma Unreferenced (unused);
begin
userData := pair.internals.m_internalInfo1.all'Access;
Self.cleanOverlappingPair (pair, dispatcher);
if Self.m_ghostPairCallback /= null then
unused := Self.m_ghostPairCallback.removeOverlappingPair (proxy0, proxy1, dispatcher);
end if;
Self.m_overlappingPairArray.replace_Element (findIndex, pair);
end;
end if;
Self.m_overlappingPairArray.swap (findIndex, Integer (Self.m_overlappingPairArray.capacity) - 0);
Self.m_overlappingPairArray.delete_Last;
return Any_view (userData);
end if;
return null;
end removeOverlappingPair;
overriding procedure removeOverlappingPairsContainingProxy (Self : access btSortedOverlappingPairCache; proxy : access impact.d3.collision.Proxy.item'Class;
dispatcher : access impact.d3.Dispatcher.item'Class)
is
type RemovePairCallback is new btOverlapCallback with
record
m_obsoleteProxy : access impact.d3.collision.Proxy.item;
end record;
overriding function processOverlap (Self : in RemovePairCallback; pair : access impact.d3.collision.Proxy.btBroadphasePair) return Boolean;
function to_RemovePairCallback (obsoleteProxy : access impact.d3.collision.Proxy.item'Class) return RemovePairCallback
is
Self : RemovePairCallback;
begin
Self.m_obsoleteProxy := obsoleteProxy;
return Self;
end to_RemovePairCallback;
overriding function processOverlap (Self : in RemovePairCallback; pair : access impact.d3.collision.Proxy.btBroadphasePair) return Boolean
is
begin
return pair.m_pProxy0 = Self.m_obsoleteProxy
or else pair.m_pProxy1 = Self.m_obsoleteProxy;
end processOverlap;
removeCallback : aliased RemovePairCallback := to_RemovePairCallback (proxy);
begin
Self.processAllOverlappingPairs (removeCallback'Access, dispatcher);
end removeOverlappingPairsContainingProxy;
function getOverlapFilterCallback (Self : access btSortedOverlappingPairCache) return access btOverlapFilterCallback'Class
is
begin
return Self.m_overlapFilterCallback;
end getOverlapFilterCallback;
overriding procedure setOverlapFilterCallback (Self : in out btSortedOverlappingPairCache; callback : access btOverlapFilterCallback'Class)
is
begin
Self.m_overlapFilterCallback := callback;
end setOverlapFilterCallback;
end impact.d3.collision.overlapped_pair_Callback.cached;
|
libsrc/_DEVELOPMENT/arch/ts2068/display/c/sccz80/tshr_saddr2cy.asm | Frodevan/z88dk | 640 | 23720 | <reponame>Frodevan/z88dk
; uchar tshr_saddr2cy(void *saddr)
SECTION code_clib
SECTION code_arch
PUBLIC tshr_saddr2cy
EXTERN zx_saddr2cy
defc tshr_saddr2cy = zx_saddr2cy
; SDCC bridge for Classic
IF __CLASSIC
PUBLIC _tshr_saddr2cy
defc _tshr_saddr2cy = tshr_saddr2cy
ENDIF
|
ver0/3_osInPro/4_devKernel/string.asm | RongbinZhuang/simpleOS | 0 | 10094 | [section .text]
global memcpy
memcpy:
push ebp
mov ebp ,esp
push esi
push edi
push ecx
mov edi ,[ebp+8]
mov esi ,[ebp+12]
mov ecx ,[ebp+16]
.1:
cmp ecx ,0
jz .2
mov al ,[ds:esi]
inc esi
mov BYTE[es:edi] ,al
inc edi
dec ecx
jmp .1
.2:
mov eax ,[ebp+8]
pop ecx
pop edi
pop esi
mov esp ,ebp
pop ebp
ret
|
out/euler02.adb | FardaleM/metalang | 22 | 5516 | <filename>out/euler02.adb
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C;
use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C;
procedure euler02 is
type stringptr is access all char_array;
procedure PString(s : stringptr) is
begin
String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all));
end;
procedure PInt(i : in Integer) is
begin
String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left));
end;
sum : Integer;
c : Integer;
b : Integer;
a : Integer;
begin
a := 1;
b := 2;
sum := 0;
while a < 4000000 loop
if a rem 2 = 0
then
sum := sum + a;
end if;
c := a;
a := b;
b := b + c;
end loop;
PInt(sum);
PString(new char_array'( To_C("" & Character'Val(10))));
end;
|
Seagull/Grammar/SeagullParser.g4 | pacojq/Seagull | 5 | 4144 | parser grammar SeagullParser;
options { tokenVocab = SeagullLexer; }
@header {
using System.Collections.Generic;
using System.Linq;
using Seagull.Grammar;
using Seagull.AST;
using Seagull.AST.Expressions;
using Seagull.AST.Expressions.Binary;
using Seagull.AST.Expressions.Literals;
using Seagull.AST.Statements;
using Seagull.AST.Statements.Definitions;
using Seagull.AST.Types;
using Seagull.AST.AccessModifiers;
}
program returns [ProgramNode Ast,
List<string> Links = new List<string>(),
List<string> Imports = new List<string>(),
List<IDefinition> Def = new List<IDefinition>(),
List<NamespaceNode> Ns = new List<NamespaceNode>()]:
(l=link { $Links.Add($l.File); })*
(i=imp { $Imports.Add($i.Namespace); })*
(
(n=namespaceNode { $Ns.Add($n.Ast); })
| (d=definition { $Def.AddRange($d.Ast); }) // TODO access level
)*
EOF
{ $Ast = new ProgramNode(0, 0, $Links, $Imports, $Def, $Ns); }
;
// Imports and loads
link returns [string File]:
LINK p=STRING_CONSTANT { $File = $p.text; }
;
imp returns [string Namespace]:
IMPORT ns1=ID { $Namespace = $ns1.GetText(); }
( DOT ns2=ID { $Namespace += "." + $ns2.GetText(); } )* SEMI_COL
;
// * * * * * * * * * TYPES * * * * * * * * * * //
typeOrVoid returns [IType Ast]:
type { $Ast = $type.Ast; }
| voidType { $Ast = $voidType.Ast; }
;
type returns [IType Ast]:
primitive { $Ast = $primitive.Ast; }
| functionType { $Ast = $functionType.Ast; }
| structType { $Ast = $structType.Ast; }
| namedType { $Ast = $namedType.Ast; }
// Arrays
| t=type L_BRACKET i=INT_CONSTANT R_BRACKET
{ $Ast = ArrayType.BuildArray(int.Parse($i.text), $t.Ast); }
(L_BRACKET i2=INT_CONSTANT R_BRACKET
{ $Ast = ArrayType.BuildArray( int.Parse($i2.text), $Ast); }
)*
;
// Custom type, which might be inside a namespace
namedType returns [IType Ast]
locals [List<string> typeNamespace = new List<string>()]:
(ID DOT { $typeNamespace.Add($ID.GetText()); }) *
ID { $Ast = new UnknownType($ID.GetLine(), $ID.GetCol(), $ID.GetText(), $typeNamespace); }
;
// TODO define it better
// (int a, int b) -> int
//
// Maybe: (int, int | int)
// (int, int : int)
// [int, int -> int] <- this one may fit
// |int, int : int|
// <int, int : int> <- this one may fit
//
functionType returns [FunctionType Ast]
locals [List<VariableDefinition> Params = new List<VariableDefinition>(), IType Rt]:
L_PAR (p=parameters { $Params = $p.Ast;})? par=R_PAR { $Rt=new VoidType($par.GetLine(), $par.GetCol()); }
(ARROW ((t=type { $Rt=$t.Ast; }) | (vt=voidType{ $Rt=$vt.Ast; })) )? // if we donot specify '-> returnType', it's void
{ $Ast = new FunctionType($Rt, $Params); }
;
parameters returns [List<VariableDefinition> Ast = new List<VariableDefinition>()]:
t1=type id1=ID { $Ast.Add(new VariableDefinition($id1.GetLine(), $id1.GetCol(), $id1.GetText(), $t1.Ast, null)); }
(COMMA t2=type id2=ID
{ $Ast.Add(new VariableDefinition($id2.GetLine(), $id2.GetCol(), $id2.GetText(), $t2.Ast, null)); }
)*
(COMMA t2=type id2=ID ASSIGN l=literal
{ $Ast.Add(new VariableDefinition($id2.GetLine(), $id2.GetCol(), $id2.GetText(), $t2.Ast, $l.Ast)); }
)*
;
// *struct Person* {
// string Name;
// int Age;
// }
structType returns [StructType Ast]
locals [List<VariableDefinition> fields = new List<VariableDefinition>(),
IAccessModifier access]:
c=L_CURL (
(am=accessModifier { $access = $am.Ast; })?
f=variableDef
{
foreach (var def in $f.Ast)
{
if ($access != null)
def.AccessModifier = $access;
$fields.Add(def);
}
$access = null;
}
)* R_CURL
{ $Ast = new StructType($c.GetLine(), $c.GetCol(), $fields); }
;
// [enum Types : int] {
// TYPE_A = 0,
// TYPE_B = 1,
// TYPE_C = 2
// }
enumType[IType typeOf] returns [EnumType Ast]
locals [List<EnumElementDefinition> defs = new List<EnumElementDefinition>()]:
curl=L_CURL
(
d1=enumElement[$typeOf, 0] { $defs.Add($d1.Ast); }
(COMMA d2=enumElement[$typeOf, 0] { $defs.Add($d2.Ast); })*
)?
R_CURL
{ $Ast = new EnumType($curl.GetLine(), $curl.GetCol(), $typeOf, $defs); }
;
enumElement[IType typeOf, int defaultInt] returns [EnumElementDefinition Ast]:
id=ID ASSIGN expr=expression
{ $Ast = new EnumElementDefinition($id.GetLine(), $id.GetCol(), $id.text, $expr.Ast, $typeOf); }
| id=ID
{
IExpression def = new IntLiteral($id.GetLine(), $id.GetCol(), defaultInt);
if (!($typeOf is IntType))
def = new DefaultNode($id.GetLine(), $id.GetCol(), $typeOf);
$Ast = new EnumElementDefinition($id.GetLine(), $id.GetCol(), $id.text, def, $typeOf);
}
;
// Primitive types
primitive returns [IType Ast]:
ptr=PTR { $Ast = new PointerType($ptr.GetLine(), $ptr.GetCol()); }
| c=CHAR { $Ast = new CharType($c.GetLine(), $c.GetCol()); }
| b=BYTE { $Ast = new ByteType($b.GetLine(), $b.GetCol()); }
| i=INT { $Ast = new IntType($i.GetLine(), $i.GetCol()); }
| d=DOUBLE { $Ast = new DoubleType($d.GetLine(), $d.GetCol()); }
| l=LONG { $Ast = new LongType($l.GetLine(), $l.GetCol()); }
| s=STRING { $Ast = new StringType($s.GetLine(), $s.GetCol()); }
;
voidType returns [IType Ast]:
v=VOID { $Ast = new VoidType($v.GetLine(), $v.GetCol()); }
;
// * * * * * * * * * MEMBER ACCESS * * * * * * * * * * //
accessModifier returns [IAccessModifier Ast] :
PUBLIC { $Ast = new PublicAccessModifier($PUBLIC.GetLine(), $PUBLIC.GetCol()); }
| PROTECTED { $Ast = new ProtectedAccessModifier($PROTECTED.GetLine(), $PROTECTED.GetCol()); }
| PRIVATE { $Ast = new PrivateAccessModifier($PRIVATE.GetLine(), $PRIVATE.GetCol()); }
;
// TODO friend namespaces
// * * * * * * * * * DEFINITIONS * * * * * * * * * * //
definition returns [List<IDefinition> Ast = new List<IDefinition>()]:
variableDef { $Ast.AddRange($variableDef.Ast); }
| functionDef { $Ast.Add($functionDef.Ast); }
| structDef { $Ast.Add($structDef.Ast); }
| enumDef { $Ast.Add($enumDef.Ast); }
;
namespaceNode returns[NamespaceNode Ast]
locals [List<string> parents = new List<string>(),
List<IDefinition> defs = new List<IDefinition>()]:
ns=NAMESPACE (p=ID DOT { $parents.Add($p.GetText()); })*
n=ID L_CURL (d=namespaceDefinitions { $defs.AddRange($d.Ast); })* R_CURL
{ $Ast = new NamespaceNode($n.GetLine(), $n.GetCol(), $n.GetText(), $parents, $defs); }
;
namespaceDefinitions returns[List<IDefinition> Ast = new List<IDefinition>()]
locals [IAccessModifier access]:
(am = accessModifier { $access = $am.Ast; })?
d=definition
{
IDefinition[] defs = $d.Ast.ToArray();
foreach (var definition in defs)
{
if ($access != null)
definition.AccessModifier = $access;
$Ast.Add(definition);
}
$access = null;
}
;
/*
a, a1 : int;
b : double = 3.0;
c := 1f;
*/
variableDef returns [List<VariableDefinition> Ast = new List<VariableDefinition>()]:
// int a, a1;
t=type ids=variableDefIds SEMI_COL
{
foreach (string id in $ids.Ids)
$Ast.Add(new VariableDefinition($t.Ast.Line, $t.Ast.Column, id, $t.Ast, null));
}
// double b = 3.0;
| t=type ids=variableDefIds ASSIGN e=expression SEMI_COL
{
foreach (string id in $ids.Ids)
$Ast.Add(new VariableDefinition($t.Ast.Line, $t.Ast.Column, id, $t.Ast, $e.Ast));
}
// TODO var ID '=' expression
| i=inferredVariableDef { $Ast.Add($i.Ast); }
;
inferredVariableDef returns [VariableDefinition Ast]:
VAR ID ASSIGN e=expression SEMI_COL
{
IType t = $e.Ast.Type;
if (t == null)
{
t = Seagull.Errors.ErrorHandler.Instance.RaiseError(
$VAR.GetLine(), $VAR.GetCol(), string.Format("Cannot infer type for variable {0}", $ID.GetText())
);
}
$Ast = new VariableDefinition($VAR.GetLine(), $VAR.GetCol(), $ID.GetText(), $e.Ast.Type, $e.Ast);
}
;
// Util function, to get variable definition ids
// public a, a1, ...
variableDefIds returns [List<string> Ids = new List<string>()]:
n1=ID { $Ids.Add($n1.GetText()); } (COMMA n2=ID { $Ids.Add($n2.GetText()); })*
;
/*
void method() { ... }
public int sum (int a, int b) { ... }
*/
functionDef returns [FunctionDefinition Ast]
locals [List<VariableDefinition> _params = new List<VariableDefinition>()]:
rt=typeOrVoid n=ID L_PAR (p=parameters { $_params = $p.Ast; })? R_PAR fnBlock
{
string name = $n.GetText();
IType fType = new FunctionType($rt.Ast, $_params);
if (name.Equals("main") && $rt.Ast is VoidType)
$Ast = new MainFunctionDefinition($n.GetLine(), $n.GetCol(), fType, $fnBlock.Ast);
else $Ast = new FunctionDefinition($n.GetLine(), $n.GetCol(), name, fType, $fnBlock.Ast);
}
;
structDef returns [StructDefinition Ast]:
s=STRUCT n=ID t=structType
{ $Ast = new StructDefinition($s.GetLine(), $s.GetCol(), $n.GetText(), $t.Ast); }
;
enumDef returns [EnumDefinition Ast] locals[IType typeOf]:
e=ENUM n=ID { $typeOf = new IntType($n.GetLine(), $n.GetCol()); } // Default type is int
(COL t=type { $typeOf = $t.Ast; })? enumType[$typeOf]
{ $Ast = new EnumDefinition($e.GetLine(), $e.GetCol(), $n.GetText(), $enumType.Ast); }
;
// TODO create a type with the lambda name
lambda returns [IType Ast]:
LAMBDA n=ID functionType { $Ast = $functionType.Ast; }
;
// * * * * * * * * * STATEMENTS * * * * * * * * * * //
statement returns [List<IStatement> Ast = new List<IStatement>()]:
// Block of statements
L_CURL
{ List<IStatement> delayed = new List<IStatement>(); } // Statements might be delayed
(
(st1=statement { $Ast.AddRange($st1.Ast); })
| (DELAY st2=statement { delayed.AddRange($st2.Ast); })
)*
{ $Ast.AddRange(delayed); }
R_CURL
// While loop
| w=WHILE L_PAR cond=expression R_PAR st=statement
{ $Ast.Add(new WhileLoopNode($w.GetLine(), $w.GetCol(), $cond.Ast, $st.Ast)); }
// For / Foreach loop
| f=FOR L_PAR init=statement cond=expression SEMI_COL incr=expression R_PAR st=statement
{ $Ast.Add(new ForLoopNode($f.GetLine(), $f.GetCol(), $init.Ast[0], $cond.Ast, $incr.Ast, $st.Ast)); }
| f=FOR L_PAR e=variable IN col=expression R_PAR st=statement
{ $Ast.Add(new ForeachLoopNode($f.GetLine(), $f.GetCol(), $e.Ast, $col.Ast, $st.Ast)); }
// Continue / Break
| c=CONTINUE SEMI_COL { $Ast.Add(new ContinueNode($c.GetLine(), $c.GetCol())); }
| br=BREAK SEMI_COL { $Ast.Add(new BreakNode($br.GetLine(), $br.GetCol())); }
// If / Else
| i=IF L_PAR cond=expression R_PAR st1=statement
{ $Ast.Add(new IfNode($i.GetLine(), $i.GetCol(), $cond.Ast, $st1.Ast)); }
(ELSE st2=statement { ((IfNode)$Ast[0]).Else = $st2.Ast; })?
// Assignment
| e1=expression ASSIGN e2=expression SEMI_COL { $Ast.Add( new AssignmentNode($e1.Ast, $e2.Ast) ); }
// Return statement
| r=RETURN expr=expression SEMI_COL { $Ast.Add(new ReturnNode($r.GetLine(), $r.GetCol(), $expr.Ast)); }
| r=RETURN SEMI_COL { $Ast.Add(new ReturnNode($r.GetLine(), $r.GetCol(), null)); }
// Read / Print
| readPrint { $Ast.Add($readPrint.Ast); }
// Accepted expressions
| e1=expression SEMI_COL
{
IExpression expr = $e1.Ast;
if (expr is IStatement)
$Ast.Add((IStatement) expr);
else {
Seagull.Errors.ErrorHandler
.Instance
.RaiseError(expr.Line, expr.Column, string.Format(
"The expression {0} cannot be used as a statement", expr.ToString())
);
}
}
;
// TODO read write syntactic sugar
readPrint returns [IStatement Ast]:
p=PRINT L_PAR e=expression R_PAR SEMI_COL { $Ast = new PrintNode($p.GetLine(), $p.GetCol(), $e.Ast); }
| r=READ L_PAR e=expression R_PAR SEMI_COL { $Ast = new ReadNode($r.GetLine(), $r.GetCol(), $e.Ast); }
;
funcInvocation returns [FunctionInvocation Ast, List<IExpression> arguments = new List<IExpression>()]:
func=variable L_PAR ( e1=expression { $arguments.Add($e1.Ast); } (COMMA e2=expression { $arguments.Add($e2.Ast); })* )? R_PAR
{ $Ast = new FunctionInvocation($func.Ast, $arguments); }
;
// A function block is different than a simple statement block, since it might contain variable definitions.
fnBlock returns [List<IStatement> Ast = new List<IStatement>()]:
L_CURL
{ List<IStatement> delayed = new List<IStatement>(); } // Statements might be delayed
(
(c1=fnBlockContent { $Ast.AddRange($c1.Ast); })
| (DELAY c2=fnBlockContent { delayed.AddRange($c2.Ast); })
)*
{ $Ast.AddRange(delayed); }
R_CURL
;
fnBlockContent returns [List<IStatement> Ast = new List<IStatement>()]:
variableDef { $Ast.AddRange($variableDef.Ast); }
| block=statement { $Ast.AddRange($block.Ast); }
;
// * * * * * * * * * EXPRESSIONS * * * * * * * * * * //
expression returns [IExpression Ast]:
variable { $Ast = $variable.Ast; }
| literal { $Ast = $literal.Ast; }
// Function invocation
| funcInvocation { $Ast = $funcInvocation.Ast; }
// Parentheses
| L_PAR e=expression R_PAR { $Ast = $e.Ast; }
// Indexing
| e1=expression L_BRACKET e2=expression R_BRACKET { $Ast = new IndexingNode($e1.Ast, $e2.Ast); }
// New
| n=NEW nt=namedType { $Ast = new NewNode($n.GetLine(), $n.GetCol(), $nt.Ast); }
// Attribute access
| e=expression DOT att=ID { $Ast = new AttributeAccessNode($e.Ast, $att.text); }
// Default TODO: primitive or ID
| def=DEFAULT L_PAR type R_PAR { $Ast = new DefaultNode($def.GetLine(), $def.GetCol(), $type.Ast); }
// Unary operations
| um=MINUS expression { $Ast = new UnaryMinusNode($um.GetLine(), $um.GetCol(), $expression.Ast); }
| not=NOT expression { $Ast = new NegationNode($not.GetLine(), $not.GetCol(), $expression.Ast); }
// Increment and decrement
| e=expression PLUS_PLUS { $Ast = new IncrementNode($e.Ast.Line, $e.Ast.Column, false, true, $e.Ast); }
| e=expression MINUS_MINUS { $Ast = new IncrementNode($e.Ast.Line, $e.Ast.Column, false, false, $e.Ast); }
| p=PLUS_PLUS e=expression { $Ast = new IncrementNode($p.GetLine(), $p.GetCol(), true, true, $e.Ast); }
| m=MINUS_MINUS e=expression { $Ast = new IncrementNode($m.GetLine(), $m.GetCol(), true, false, $e.Ast); }
// Arithmetics
| e1=expression op=(STAR|SLASH|PERCENT) e2=expression { $Ast = new ArithmeticNode($op.text, $e1.Ast, $e2.Ast); }
| e1=expression op=(PLUS|MINUS) e2=expression { $Ast = new ArithmeticNode($op.text, $e1.Ast, $e2.Ast); }
// Cast
| p=L_PAR t=primitive R_PAR e=expression { $Ast = new CastNode($p.GetLine(), $p.GetCol(), $t.Ast, $e.Ast); }
// Comparisons
| e1=expression op=(GREATER_THAN|LESS_THAN|GREATER_EQ_THAN|LESS_EQ_THAN|EQUAL|NOT_EQUAL) e2=expression
{ $Ast = new ComparisonNode($op.text, $e1.Ast, $e2.Ast); }
// Logical operations
| e1=expression op=(AND|OR) e2=expression { $Ast = new LogicalOperationNode($op.text, $e1.Ast, $e2.Ast); }
// Ternary operator
| e1=expression QUESTION e2=expression COL e3=expression { $Ast = new TernaryOperatorNode($e1.Ast, $e2.Ast, $e3.Ast); }
;
variable returns [VariableNode Ast]:
ID { $Ast = new VariableNode($ID.GetLine(), $ID.GetCol(), $ID.text); }
;
literal returns [IExpression Ast]:
b=BOOLEAN_CONSTANT { $Ast = new BooleanLiteral($b.GetLine(), $b.GetCol(), LexerHelper.LexemeToBoolean($b.text)); }
| i=INT_CONSTANT { $Ast = new IntLiteral($i.GetLine(), $i.GetCol(), LexerHelper.LexemeToInt($i.text)); }
| r=REAL_CONSTANT { $Ast = new DoubleLiteral($r.GetLine(), $r.GetCol(), LexerHelper.LexemeToReal($r.text)); }
| c=CHAR_CONSTANT { $Ast = new CharLiteral($c.GetLine(), $c.GetCol(), LexerHelper.LexemeToChar($c.text)); }
| s=STRING_CONSTANT { $Ast = new StringLiteral($s.GetLine(), $s.GetCol(), $s.text); }
// TODO array literal
// int[] array = [0, 1, 2, 3];
;
|
idea/src/Compiler2018/M.g4 | wanton-wind/M-compiler | 0 | 1957 | grammar M;
program: programSection* EOF;
// AbstractDecl
programSection
: classDeclaration # ClassDecl
| functionDeclaration # FuncDecl
| variableDeclarationStatement # VarDecl
;
classDeclaration: 'class' Identifier classBlock; // --> ClassDecl
functionDeclaration : classType Identifier '(' functionParameters? ')' blockStatement; // --> FuncDecl
variableDeclaration : classType Identifier ('=' expression)?; // --> VarDecl
variableDeclarationStatement : variableDeclaration ';'; // -- VarDecl --
functionParameters : (variableDeclaration ',')* variableDeclaration;
classBlock: '{' classBlockItem* '}';
// AbstractClassItem
classBlockItem
: variableDeclarationStatement # ClassVarDecl // --> ClassVarDecl
| constructorDeclaration # ClassCstrDecl
| functionDeclaration # ClassFuncDecl // --> ClassFuncDecl
;
constructorDeclaration : Identifier '(' functionParameters? ')' blockStatement; // --> ClassCstrDecl
// ABstractStmt
statement
: blockStatement # BlockStmt
| variableDeclarationStatement # VarDeclStmt
| branchStatement # BranchStmt
| loopStatement # LoopStmt
| expression ';' # ExprStmt
| jumpStatement # JumpStmt
| ';' # EmptyStmt
;
blockStatement: '{' statement* '}'; // --> BlockStmt
branchStatement: If '(' expression ')' statement (Else statement)? ; // --> BranchStmt
// AbstractLoopStmt
loopStatement
: 'for' '(' init=expression? ';' cond=expression? ';' step=expression? ')' statement # ForStmt // --> ForStmt
| 'while' '(' expression ')' statement # WhileStmt // --> WhileStmt
;
// AbstractJumpStmt
jumpStatement
: 'return' expression? ';' # ReturnStmt // --> ReturnStmt
| 'break' ';' # BreakStmt // --> BreakStmt
| 'continue' ';' # ContinueStmt // --> ContinueStmt
;
// ClassType
classType
: arrayClass # ArrayType
| nonArrayClass # NonArrayType
;
arrayClass: nonArrayClass (brackets)+; // --> ClassType
nonArrayClass // --> ClassType
: type='bool'
| type='int'
| type='void'
| type='string'
| type=Identifier
;
// AbstractExpr
expression
: expression oprator=('++'|'--') # PostfixIncDec // --> UnaryExpr
| expression '(' callParameter? ')' # FunctionCall // --> FunctionCall
| expression '[' expression ']' # ArrayAcess // --> ArrayAcess
| expression '.' Identifier # MemberAcess // --> MemberAcess
| <assoc=right> oprator=('++'|'--') expression # UnaryExpr // --> UnaryExpr
| <assoc=right> oprator=('+'|'-') expression # UnaryExpr // --> UnaryExpr
| <assoc=right> oprator=('!'|'~') expression # UnaryExpr // --> UnaryExpr
| <assoc=right> 'new' newObject # NewExpr // --> NewExpr
| expression oprator=('*'|'/'|'%') expression # BinaryExpr // --> BinaryExpr
| expression oprator=('-'|'+') expression # BinaryExpr // --> BinaryExpr
| expression oprator=('<<'|'>>') expression # BinaryExpr // --> BinaryExpr
| expression oprator=('<'|'<='|'>'|'>=') expression # BinaryExpr // --> BinaryExpr
| expression oprator=('=='|'!=') expression # BinaryExpr // --> BinaryExpr
| expression oprator='&' expression # BinaryExpr // --> BinaryExpr
| expression oprator='^' expression # BinaryExpr // --> BinaryExpr
| expression oprator='|' expression # BinaryExpr // --> BinaryExpr
| <assoc=right> expression oprator='&&' expression # BinaryExpr // --> BinaryExpr
| expression oprator='||' expression # BinaryExpr // --> BinaryExpr
| <assoc=right> expression oprator='=' expression # BinaryExpr // --> BinaryExpr
| Identifier # Identifier // --> Identifier
| constant # Const
| '(' expression ')' # SubExpr
;
callParameter: (expression ',')* expression;
// AbstractNewObeject
newObject
: nonArrayClass ('[' expression ']')+ (brackets)+ ('[' expression ']')+ # NewError // throw
| nonArrayClass ('[' expression ']')+ (brackets)* # NewArray // --> NewArray
| nonArrayClass ('(' callParameter? ')')? # NewNonArray // --> NewNonArray
;
brackets: '[' ']';
// AbstractConst
constant
: type=BoolConst // --> BoolConst
| type=NumConst // --> NumConst
| type=StrConst // --> StrConst
| type=NullConst // --> NullConst
;
//------ Reseversed keywords
Bool : 'bool';
Int : 'int';
String : 'string';
Void : 'void';
// Null are defined as Null later
// True False are defined as BoolConst later
If : 'if';
Else : 'else';
For : 'for';
While : 'while';
Break : 'break';
Continue: 'continue';
Return : 'return';
New : 'new';
Class : 'class';
//------ Symbols
Add : '+';
Sub : '-';
Mul : '*';
Div : '/';
Mod : '%';
LT : '<';
GT : '>';
LE : '<=';
GE : '>=';
EQ : '==';
NE : '!=';
And : '&&';
Or : '||';
Not : '!';
LShift : '<<';
RShift : '>>';
BNot : '~'; // B -> Bitwise
BOr : '|';
BXor : '^';
BAnd : '&';
Assign : '=';
AddAdd : '++';
SubSub : '--';
Semi : ';';
Comma : ',';
Dot : '.';
LParen : '(';
RParen : ')';
LBracket : '[';
RBracket : ']';
LBrace : '{';
RBrace : '}';
//------ Constants
BoolConst: 'true' | 'false';
NumConst : [0-9]+;
StrConst : '"' ('\\'[btnr"\\] | .)*? '"';
NullConst : 'null';
//------ Indentifiers
Identifier : [a-zA-Z][a-zA-Z_0-9]*;
//------ WhiteSpace
WhiteSpace : [ \t\n\r]+ -> channel (HIDDEN);
//------ Comments
LineComment : '//' .*? '\n' -> channel (HIDDEN);
BlockComment : '/*' .*? '*/' -> channel (HIDDEN);
|
release/src/router/gmp/source/mpn/mips32/submul_1.asm | zhoutao0712/rtn11pb1 | 184 | 12534 | <gh_stars>100-1000
dnl MIPS32 mpn_submul_1 -- Multiply a limb vector with a single limb and
dnl subtract the product from a second limb vector.
dnl Copyright 1992, 1994, 1996, 2000, 2002 Free Software Foundation, Inc.
dnl This file is part of the GNU MP Library.
dnl The GNU MP Library is free software; you can redistribute it and/or modify
dnl it under the terms of the GNU Lesser General Public License as published
dnl by the Free Software Foundation; either version 3 of the License, or (at
dnl your option) any later version.
dnl The GNU MP Library is distributed in the hope that it will be useful, but
dnl WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
dnl or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
dnl License for more details.
dnl You should have received a copy of the GNU Lesser General Public License
dnl along with the GNU MP Library. If not, see http://www.gnu.org/licenses/.
include(`../config.m4')
C INPUT PARAMETERS
C res_ptr $4
C s1_ptr $5
C size $6
C s2_limb $7
ASM_START()
PROLOGUE(mpn_submul_1)
C feed-in phase 0
lw $8,0($5)
C feed-in phase 1
addiu $5,$5,4
multu $8,$7
addiu $6,$6,-1
beq $6,$0,$LC0
move $2,$0 C zero cy2
addiu $6,$6,-1
beq $6,$0,$LC1
lw $8,0($5) C load new s1 limb as early as possible
Loop: lw $10,0($4)
mflo $3
mfhi $9
addiu $5,$5,4
addu $3,$3,$2 C add old carry limb to low product limb
multu $8,$7
lw $8,0($5) C load new s1 limb as early as possible
addiu $6,$6,-1 C decrement loop counter
sltu $2,$3,$2 C carry from previous addition -> $2
subu $3,$10,$3
sgtu $10,$3,$10
addu $2,$2,$10
sw $3,0($4)
addiu $4,$4,4
bne $6,$0,Loop
addu $2,$9,$2 C add high product limb and carry from addition
C wind-down phase 1
$LC1: lw $10,0($4)
mflo $3
mfhi $9
addu $3,$3,$2
sltu $2,$3,$2
multu $8,$7
subu $3,$10,$3
sgtu $10,$3,$10
addu $2,$2,$10
sw $3,0($4)
addiu $4,$4,4
addu $2,$9,$2 C add high product limb and carry from addition
C wind-down phase 0
$LC0: lw $10,0($4)
mflo $3
mfhi $9
addu $3,$3,$2
sltu $2,$3,$2
subu $3,$10,$3
sgtu $10,$3,$10
addu $2,$2,$10
sw $3,0($4)
j $31
addu $2,$9,$2 C add high product limb and carry from addition
EPILOGUE(mpn_submul_1)
|
test/interaction/Issue1926.agda | cruhland/agda | 1,989 | 591 | <gh_stars>1000+
-- Andreas, 2019-04-10, re #3687, better test case for #1926
-- {-# OPTIONS -v interaction.contents.record:20 #-}
module _ (Foo : Set) where
open import Agda.Builtin.Sigma
test : {A : Set} {B : A → Set} (r : Σ A B) → Set
test r = {!r!} -- C-c C-o
|
llvm-gcc-4.2-2.9/gcc/ada/sem_ch6.adb | vidkidz/crossbridge | 1 | 12870 | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ C H 6 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-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 Atree; use Atree;
with Checks; use Checks;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Expander; use Expander;
with Exp_Ch7; use Exp_Ch7;
with Exp_Tss; use Exp_Tss;
with Fname; use Fname;
with Freeze; use Freeze;
with Itypes; use Itypes;
with Lib.Xref; use Lib.Xref;
with Namet; use Namet;
with Lib; use Lib;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Output; use Output;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Cat; use Sem_Cat;
with Sem_Ch3; use Sem_Ch3;
with Sem_Ch4; use Sem_Ch4;
with Sem_Ch5; use Sem_Ch5;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch10; use Sem_Ch10;
with Sem_Ch12; use Sem_Ch12;
with Sem_Disp; use Sem_Disp;
with Sem_Dist; use Sem_Dist;
with Sem_Elim; use Sem_Elim;
with Sem_Eval; use Sem_Eval;
with Sem_Mech; use Sem_Mech;
with Sem_Prag; use Sem_Prag;
with Sem_Res; use Sem_Res;
with Sem_Util; use Sem_Util;
with Sem_Type; use Sem_Type;
with Sem_Warn; use Sem_Warn;
with Sinput; use Sinput;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Sinfo.CN; use Sinfo.CN;
with Snames; use Snames;
with Stringt; use Stringt;
with Style;
with Stylesw; use Stylesw;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
with Urealp; use Urealp;
with Validsw; use Validsw;
package body Sem_Ch6 is
-- The following flag is used to indicate that two formals in two
-- subprograms being checked for conformance differ only in that one is
-- an access parameter while the other is of a general access type with
-- the same designated type. In this case, if the rest of the signatures
-- match, a call to either subprogram may be ambiguous, which is worth
-- a warning. The flag is set in Compatible_Types, and the warning emitted
-- in New_Overloaded_Entity.
May_Hide_Profile : Boolean := False;
-----------------------
-- Local Subprograms --
-----------------------
procedure Analyze_Return_Type (N : Node_Id);
-- Subsidiary to Process_Formals: analyze subtype mark in function
-- specification, in a context where the formals are visible and hide
-- outer homographs.
procedure Analyze_Generic_Subprogram_Body (N : Node_Id; Gen_Id : Entity_Id);
-- Analyze a generic subprogram body. N is the body to be analyzed, and
-- Gen_Id is the defining entity Id for the corresponding spec.
procedure Build_Body_To_Inline (N : Node_Id; Subp : Entity_Id);
-- If a subprogram has pragma Inline and inlining is active, use generic
-- machinery to build an unexpanded body for the subprogram. This body is
-- subsequenty used for inline expansions at call sites. If subprogram can
-- be inlined (depending on size and nature of local declarations) this
-- function returns true. Otherwise subprogram body is treated normally.
-- If proper warnings are enabled and the subprogram contains a construct
-- that cannot be inlined, the offending construct is flagged accordingly.
type Conformance_Type is
(Type_Conformant, Mode_Conformant, Subtype_Conformant, Fully_Conformant);
-- Conformance type used for following call, meaning matches the
-- RM definitions of the corresponding terms.
procedure Check_Conformance
(New_Id : Entity_Id;
Old_Id : Entity_Id;
Ctype : Conformance_Type;
Errmsg : Boolean;
Conforms : out Boolean;
Err_Loc : Node_Id := Empty;
Get_Inst : Boolean := False;
Skip_Controlling_Formals : Boolean := False);
-- Given two entities, this procedure checks that the profiles associated
-- with these entities meet the conformance criterion given by the third
-- parameter. If they conform, Conforms is set True and control returns
-- to the caller. If they do not conform, Conforms is set to False, and
-- in addition, if Errmsg is True on the call, proper messages are output
-- to complain about the conformance failure. If Err_Loc is non_Empty
-- the error messages are placed on Err_Loc, if Err_Loc is empty, then
-- error messages are placed on the appropriate part of the construct
-- denoted by New_Id. If Get_Inst is true, then this is a mode conformance
-- against a formal access-to-subprogram type so Get_Instance_Of must
-- be called.
procedure Check_Overriding_Indicator
(Subp : Entity_Id;
Does_Override : Boolean);
-- Verify the consistency of an overriding_indicator given for subprogram
-- declaration, body, renaming, or instantiation. The flag Does_Override
-- is set if the scope into which we are introducing the subprogram
-- contains a type-conformant subprogram that becomes hidden by the new
-- subprogram.
procedure Check_Subprogram_Order (N : Node_Id);
-- N is the N_Subprogram_Body node for a subprogram. This routine applies
-- the alpha ordering rule for N if this ordering requirement applicable.
procedure Check_Returns
(HSS : Node_Id;
Mode : Character;
Err : out Boolean;
Proc : Entity_Id := Empty);
-- Called to check for missing return statements in a function body, or for
-- returns present in a procedure body which has No_Return set. L is the
-- handled statement sequence for the subprogram body. This procedure
-- checks all flow paths to make sure they either have return (Mode = 'F',
-- used for functions) or do not have a return (Mode = 'P', used for
-- No_Return procedures). The flag Err is set if there are any control
-- paths not explicitly terminated by a return in the function case, and is
-- True otherwise. Proc is the entity for the procedure case and is used
-- in posting the warning message.
function Conforming_Types
(T1 : Entity_Id;
T2 : Entity_Id;
Ctype : Conformance_Type;
Get_Inst : Boolean := False) return Boolean;
-- Check that two formal parameter types conform, checking both for
-- equality of base types, and where required statically matching
-- subtypes, depending on the setting of Ctype.
procedure Enter_Overloaded_Entity (S : Entity_Id);
-- This procedure makes S, a new overloaded entity, into the first visible
-- entity with that name.
procedure Install_Entity (E : Entity_Id);
-- Make single entity visible. Used for generic formals as well
procedure Install_Formals (Id : Entity_Id);
-- On entry to a subprogram body, make the formals visible. Note that
-- simply placing the subprogram on the scope stack is not sufficient:
-- the formals must become the current entities for their names.
function Is_Non_Overriding_Operation
(Prev_E : Entity_Id;
New_E : Entity_Id) return Boolean;
-- Enforce the rule given in 12.3(18): a private operation in an instance
-- overrides an inherited operation only if the corresponding operation
-- was overriding in the generic. This can happen for primitive operations
-- of types derived (in the generic unit) from formal private or formal
-- derived types.
procedure Make_Inequality_Operator (S : Entity_Id);
-- Create the declaration for an inequality operator that is implicitly
-- created by a user-defined equality operator that yields a boolean.
procedure May_Need_Actuals (Fun : Entity_Id);
-- Flag functions that can be called without parameters, i.e. those that
-- have no parameters, or those for which defaults exist for all parameters
procedure Reference_Body_Formals (Spec : Entity_Id; Bod : Entity_Id);
-- If there is a separate spec for a subprogram or generic subprogram, the
-- formals of the body are treated as references to the corresponding
-- formals of the spec. This reference does not count as an actual use of
-- the formal, in order to diagnose formals that are unused in the body.
procedure Set_Formal_Validity (Formal_Id : Entity_Id);
-- Formal_Id is an formal parameter entity. This procedure deals with
-- setting the proper validity status for this entity, which depends
-- on the kind of parameter and the validity checking mode.
---------------------------------------------
-- Analyze_Abstract_Subprogram_Declaration --
---------------------------------------------
procedure Analyze_Abstract_Subprogram_Declaration (N : Node_Id) is
Designator : constant Entity_Id :=
Analyze_Subprogram_Specification (Specification (N));
Scop : constant Entity_Id := Current_Scope;
begin
Generate_Definition (Designator);
Set_Is_Abstract (Designator);
New_Overloaded_Entity (Designator);
Check_Delayed_Subprogram (Designator);
Set_Categorization_From_Scope (Designator, Scop);
if Ekind (Scope (Designator)) = E_Protected_Type then
Error_Msg_N
("abstract subprogram not allowed in protected type", N);
end if;
Generate_Reference_To_Formals (Designator);
end Analyze_Abstract_Subprogram_Declaration;
----------------------------
-- Analyze_Function_Call --
----------------------------
procedure Analyze_Function_Call (N : Node_Id) is
P : constant Node_Id := Name (N);
L : constant List_Id := Parameter_Associations (N);
Actual : Node_Id;
begin
Analyze (P);
-- A call of the form A.B (X) may be an Ada05 call, which is rewritten
-- as B (A, X). If the rewriting is successful, the call has been
-- analyzed and we just return.
if Nkind (P) = N_Selected_Component
and then Name (N) /= P
and then Is_Rewrite_Substitution (N)
and then Present (Etype (N))
then
return;
end if;
-- If error analyzing name, then set Any_Type as result type and return
if Etype (P) = Any_Type then
Set_Etype (N, Any_Type);
return;
end if;
-- Otherwise analyze the parameters
if Present (L) then
Actual := First (L);
while Present (Actual) loop
Analyze (Actual);
Check_Parameterless_Call (Actual);
Next (Actual);
end loop;
end if;
Analyze_Call (N);
end Analyze_Function_Call;
-------------------------------------
-- Analyze_Generic_Subprogram_Body --
-------------------------------------
procedure Analyze_Generic_Subprogram_Body
(N : Node_Id;
Gen_Id : Entity_Id)
is
Gen_Decl : constant Node_Id := Unit_Declaration_Node (Gen_Id);
Kind : constant Entity_Kind := Ekind (Gen_Id);
Body_Id : Entity_Id;
New_N : Node_Id;
Spec : Node_Id;
begin
-- Copy body and disable expansion while analyzing the generic For a
-- stub, do not copy the stub (which would load the proper body), this
-- will be done when the proper body is analyzed.
if Nkind (N) /= N_Subprogram_Body_Stub then
New_N := Copy_Generic_Node (N, Empty, Instantiating => False);
Rewrite (N, New_N);
Start_Generic;
end if;
Spec := Specification (N);
-- Within the body of the generic, the subprogram is callable, and
-- behaves like the corresponding non-generic unit.
Body_Id := Defining_Entity (Spec);
if Kind = E_Generic_Procedure
and then Nkind (Spec) /= N_Procedure_Specification
then
Error_Msg_N ("invalid body for generic procedure ", Body_Id);
return;
elsif Kind = E_Generic_Function
and then Nkind (Spec) /= N_Function_Specification
then
Error_Msg_N ("invalid body for generic function ", Body_Id);
return;
end if;
Set_Corresponding_Body (Gen_Decl, Body_Id);
if Has_Completion (Gen_Id)
and then Nkind (Parent (N)) /= N_Subunit
then
Error_Msg_N ("duplicate generic body", N);
return;
else
Set_Has_Completion (Gen_Id);
end if;
if Nkind (N) = N_Subprogram_Body_Stub then
Set_Ekind (Defining_Entity (Specification (N)), Kind);
else
Set_Corresponding_Spec (N, Gen_Id);
end if;
if Nkind (Parent (N)) = N_Compilation_Unit then
Set_Cunit_Entity (Current_Sem_Unit, Defining_Entity (N));
end if;
-- Make generic parameters immediately visible in the body. They are
-- needed to process the formals declarations. Then make the formals
-- visible in a separate step.
New_Scope (Gen_Id);
declare
E : Entity_Id;
First_Ent : Entity_Id;
begin
First_Ent := First_Entity (Gen_Id);
E := First_Ent;
while Present (E) and then not Is_Formal (E) loop
Install_Entity (E);
Next_Entity (E);
end loop;
Set_Use (Generic_Formal_Declarations (Gen_Decl));
-- Now generic formals are visible, and the specification can be
-- analyzed, for subsequent conformance check.
Body_Id := Analyze_Subprogram_Specification (Spec);
-- Make formal parameters visible
if Present (E) then
-- E is the first formal parameter, we loop through the formals
-- installing them so that they will be visible.
Set_First_Entity (Gen_Id, E);
while Present (E) loop
Install_Entity (E);
Next_Formal (E);
end loop;
end if;
-- Visible generic entity is callable within its own body
Set_Ekind (Gen_Id, Ekind (Body_Id));
Set_Ekind (Body_Id, E_Subprogram_Body);
Set_Convention (Body_Id, Convention (Gen_Id));
Set_Scope (Body_Id, Scope (Gen_Id));
Check_Fully_Conformant (Body_Id, Gen_Id, Body_Id);
if Nkind (N) = N_Subprogram_Body_Stub then
-- No body to analyze, so restore state of generic unit
Set_Ekind (Gen_Id, Kind);
Set_Ekind (Body_Id, Kind);
if Present (First_Ent) then
Set_First_Entity (Gen_Id, First_Ent);
end if;
End_Scope;
return;
end if;
-- If this is a compilation unit, it must be made visible explicitly,
-- because the compilation of the declaration, unlike other library
-- unit declarations, does not. If it is not a unit, the following
-- is redundant but harmless.
Set_Is_Immediately_Visible (Gen_Id);
Reference_Body_Formals (Gen_Id, Body_Id);
Set_Actual_Subtypes (N, Current_Scope);
Analyze_Declarations (Declarations (N));
Check_Completion;
Analyze (Handled_Statement_Sequence (N));
Save_Global_References (Original_Node (N));
-- Prior to exiting the scope, include generic formals again (if any
-- are present) in the set of local entities.
if Present (First_Ent) then
Set_First_Entity (Gen_Id, First_Ent);
end if;
Check_References (Gen_Id);
end;
Process_End_Label (Handled_Statement_Sequence (N), 't', Current_Scope);
End_Scope;
Check_Subprogram_Order (N);
-- Outside of its body, unit is generic again
Set_Ekind (Gen_Id, Kind);
Generate_Reference (Gen_Id, Body_Id, 'b', Set_Ref => False);
Style.Check_Identifier (Body_Id, Gen_Id);
End_Generic;
end Analyze_Generic_Subprogram_Body;
-----------------------------
-- Analyze_Operator_Symbol --
-----------------------------
-- An operator symbol such as "+" or "and" may appear in context where the
-- literal denotes an entity name, such as "+"(x, y) or in context when it
-- is just a string, as in (conjunction = "or"). In these cases the parser
-- generates this node, and the semantics does the disambiguation. Other
-- such case are actuals in an instantiation, the generic unit in an
-- instantiation, and pragma arguments.
procedure Analyze_Operator_Symbol (N : Node_Id) is
Par : constant Node_Id := Parent (N);
begin
if (Nkind (Par) = N_Function_Call and then N = Name (Par))
or else Nkind (Par) = N_Function_Instantiation
or else (Nkind (Par) = N_Indexed_Component and then N = Prefix (Par))
or else (Nkind (Par) = N_Pragma_Argument_Association
and then not Is_Pragma_String_Literal (Par))
or else Nkind (Par) = N_Subprogram_Renaming_Declaration
or else (Nkind (Par) = N_Attribute_Reference
and then Attribute_Name (Par) /= Name_Value)
then
Find_Direct_Name (N);
else
Change_Operator_Symbol_To_String_Literal (N);
Analyze (N);
end if;
end Analyze_Operator_Symbol;
-----------------------------------
-- Analyze_Parameter_Association --
-----------------------------------
procedure Analyze_Parameter_Association (N : Node_Id) is
begin
Analyze (Explicit_Actual_Parameter (N));
end Analyze_Parameter_Association;
----------------------------
-- Analyze_Procedure_Call --
----------------------------
procedure Analyze_Procedure_Call (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
P : constant Node_Id := Name (N);
Actuals : constant List_Id := Parameter_Associations (N);
Actual : Node_Id;
New_N : Node_Id;
procedure Analyze_Call_And_Resolve;
-- Do Analyze and Resolve calls for procedure call
------------------------------
-- Analyze_Call_And_Resolve --
------------------------------
procedure Analyze_Call_And_Resolve is
begin
if Nkind (N) = N_Procedure_Call_Statement then
Analyze_Call (N);
Resolve (N, Standard_Void_Type);
else
Analyze (N);
end if;
end Analyze_Call_And_Resolve;
-- Start of processing for Analyze_Procedure_Call
begin
-- The syntactic construct: PREFIX ACTUAL_PARAMETER_PART can denote
-- a procedure call or an entry call. The prefix may denote an access
-- to subprogram type, in which case an implicit dereference applies.
-- If the prefix is an indexed component (without implicit defererence)
-- then the construct denotes a call to a member of an entire family.
-- If the prefix is a simple name, it may still denote a call to a
-- parameterless member of an entry family. Resolution of these various
-- interpretations is delicate.
Analyze (P);
-- If this is a call of the form Obj.Op, the call may have been
-- analyzed and possibly rewritten into a block, in which case
-- we are done.
if Analyzed (N) then
return;
end if;
-- If error analyzing prefix, then set Any_Type as result and return
if Etype (P) = Any_Type then
Set_Etype (N, Any_Type);
return;
end if;
-- Otherwise analyze the parameters
if Present (Actuals) then
Actual := First (Actuals);
while Present (Actual) loop
Analyze (Actual);
Check_Parameterless_Call (Actual);
Next (Actual);
end loop;
end if;
-- Special processing for Elab_Spec and Elab_Body calls
if Nkind (P) = N_Attribute_Reference
and then (Attribute_Name (P) = Name_Elab_Spec
or else Attribute_Name (P) = Name_Elab_Body)
then
if Present (Actuals) then
Error_Msg_N
("no parameters allowed for this call", First (Actuals));
return;
end if;
Set_Etype (N, Standard_Void_Type);
Set_Analyzed (N);
elsif Is_Entity_Name (P)
and then Is_Record_Type (Etype (Entity (P)))
and then Remote_AST_I_Dereference (P)
then
return;
elsif Is_Entity_Name (P)
and then Ekind (Entity (P)) /= E_Entry_Family
then
if Is_Access_Type (Etype (P))
and then Ekind (Designated_Type (Etype (P))) = E_Subprogram_Type
and then No (Actuals)
and then Comes_From_Source (N)
then
Error_Msg_N ("missing explicit dereference in call", N);
end if;
Analyze_Call_And_Resolve;
-- If the prefix is the simple name of an entry family, this is
-- a parameterless call from within the task body itself.
elsif Is_Entity_Name (P)
and then Nkind (P) = N_Identifier
and then Ekind (Entity (P)) = E_Entry_Family
and then Present (Actuals)
and then No (Next (First (Actuals)))
then
-- Can be call to parameterless entry family. What appears to be the
-- sole argument is in fact the entry index. Rewrite prefix of node
-- accordingly. Source representation is unchanged by this
-- transformation.
New_N :=
Make_Indexed_Component (Loc,
Prefix =>
Make_Selected_Component (Loc,
Prefix => New_Occurrence_Of (Scope (Entity (P)), Loc),
Selector_Name => New_Occurrence_Of (Entity (P), Loc)),
Expressions => Actuals);
Set_Name (N, New_N);
Set_Etype (New_N, Standard_Void_Type);
Set_Parameter_Associations (N, No_List);
Analyze_Call_And_Resolve;
elsif Nkind (P) = N_Explicit_Dereference then
if Ekind (Etype (P)) = E_Subprogram_Type then
Analyze_Call_And_Resolve;
else
Error_Msg_N ("expect access to procedure in call", P);
end if;
-- The name can be a selected component or an indexed component that
-- yields an access to subprogram. Such a prefix is legal if the call
-- has parameter associations.
elsif Is_Access_Type (Etype (P))
and then Ekind (Designated_Type (Etype (P))) = E_Subprogram_Type
then
if Present (Actuals) then
Analyze_Call_And_Resolve;
else
Error_Msg_N ("missing explicit dereference in call ", N);
end if;
-- If not an access to subprogram, then the prefix must resolve to the
-- name of an entry, entry family, or protected operation.
-- For the case of a simple entry call, P is a selected component where
-- the prefix is the task and the selector name is the entry. A call to
-- a protected procedure will have the same syntax. If the protected
-- object contains overloaded operations, the entity may appear as a
-- function, the context will select the operation whose type is Void.
elsif Nkind (P) = N_Selected_Component
and then (Ekind (Entity (Selector_Name (P))) = E_Entry
or else
Ekind (Entity (Selector_Name (P))) = E_Procedure
or else
Ekind (Entity (Selector_Name (P))) = E_Function)
then
Analyze_Call_And_Resolve;
elsif Nkind (P) = N_Selected_Component
and then Ekind (Entity (Selector_Name (P))) = E_Entry_Family
and then Present (Actuals)
and then No (Next (First (Actuals)))
then
-- Can be call to parameterless entry family. What appears to be the
-- sole argument is in fact the entry index. Rewrite prefix of node
-- accordingly. Source representation is unchanged by this
-- transformation.
New_N :=
Make_Indexed_Component (Loc,
Prefix => New_Copy (P),
Expressions => Actuals);
Set_Name (N, New_N);
Set_Etype (New_N, Standard_Void_Type);
Set_Parameter_Associations (N, No_List);
Analyze_Call_And_Resolve;
-- For the case of a reference to an element of an entry family, P is
-- an indexed component whose prefix is a selected component (task and
-- entry family), and whose index is the entry family index.
elsif Nkind (P) = N_Indexed_Component
and then Nkind (Prefix (P)) = N_Selected_Component
and then Ekind (Entity (Selector_Name (Prefix (P)))) = E_Entry_Family
then
Analyze_Call_And_Resolve;
-- If the prefix is the name of an entry family, it is a call from
-- within the task body itself.
elsif Nkind (P) = N_Indexed_Component
and then Nkind (Prefix (P)) = N_Identifier
and then Ekind (Entity (Prefix (P))) = E_Entry_Family
then
New_N :=
Make_Selected_Component (Loc,
Prefix => New_Occurrence_Of (Scope (Entity (Prefix (P))), Loc),
Selector_Name => New_Occurrence_Of (Entity (Prefix (P)), Loc));
Rewrite (Prefix (P), New_N);
Analyze (P);
Analyze_Call_And_Resolve;
-- Anything else is an error
else
Error_Msg_N ("invalid procedure or entry call", N);
end if;
end Analyze_Procedure_Call;
------------------------------
-- Analyze_Return_Statement --
------------------------------
procedure Analyze_Return_Statement (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Expr : Node_Id;
Scope_Id : Entity_Id;
Kind : Entity_Kind;
R_Type : Entity_Id;
begin
-- Find subprogram or accept statement enclosing the return statement
Scope_Id := Empty;
for J in reverse 0 .. Scope_Stack.Last loop
Scope_Id := Scope_Stack.Table (J).Entity;
exit when Ekind (Scope_Id) /= E_Block and then
Ekind (Scope_Id) /= E_Loop;
end loop;
pragma Assert (Present (Scope_Id));
Kind := Ekind (Scope_Id);
Expr := Expression (N);
if Kind /= E_Function
and then Kind /= E_Generic_Function
and then Kind /= E_Procedure
and then Kind /= E_Generic_Procedure
and then Kind /= E_Entry
and then Kind /= E_Entry_Family
then
Error_Msg_N ("illegal context for return statement", N);
elsif Present (Expr) then
if Kind = E_Function or else Kind = E_Generic_Function then
Set_Return_Present (Scope_Id);
R_Type := Etype (Scope_Id);
Set_Return_Type (N, R_Type);
Analyze_And_Resolve (Expr, R_Type);
-- Ada 2005 (AI-318-02): When the result type is an anonymous
-- access type, apply an implicit conversion of the expression
-- to that type to force appropriate static and run-time
-- accessibility checks.
if Ada_Version >= Ada_05
and then Ekind (R_Type) = E_Anonymous_Access_Type
then
Rewrite (Expr, Convert_To (R_Type, Relocate_Node (Expr)));
Analyze_And_Resolve (Expr, R_Type);
end if;
if (Is_Class_Wide_Type (Etype (Expr))
or else Is_Dynamically_Tagged (Expr))
and then not Is_Class_Wide_Type (R_Type)
then
Error_Msg_N
("dynamically tagged expression not allowed!", Expr);
end if;
Apply_Constraint_Check (Expr, R_Type);
-- Ada 2005 (AI-318-02): Return-by-reference types have been
-- removed and replaced by anonymous access results. This is
-- an incompatibility with Ada 95. Not clear whether this
-- should be enforced yet or perhaps controllable with a
-- special switch. ???
-- if Ada_Version >= Ada_05
-- and then Is_Limited_Type (R_Type)
-- and then Nkind (Expr) /= N_Aggregate
-- and then Nkind (Expr) /= N_Extension_Aggregate
-- and then Nkind (Expr) /= N_Function_Call
-- then
-- Error_Msg_N
-- ("(Ada 2005) illegal operand for limited return", N);
-- end if;
-- ??? A real run-time accessibility check is needed in cases
-- involving dereferences of access parameters. For now we just
-- check the static cases.
if Is_Return_By_Reference_Type (Etype (Scope_Id))
and then Object_Access_Level (Expr)
> Subprogram_Access_Level (Scope_Id)
then
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Accessibility_Check_Failed));
Analyze (N);
Error_Msg_N
("cannot return a local value by reference?", N);
Error_Msg_NE
("\& will be raised at run time?",
N, Standard_Program_Error);
end if;
elsif Kind = E_Procedure or else Kind = E_Generic_Procedure then
Error_Msg_N ("procedure cannot return value (use function)", N);
else
Error_Msg_N ("accept statement cannot return value", N);
end if;
-- No expression present
else
if Kind = E_Function or Kind = E_Generic_Function then
Error_Msg_N ("missing expression in return from function", N);
end if;
if (Ekind (Scope_Id) = E_Procedure
or else Ekind (Scope_Id) = E_Generic_Procedure)
and then No_Return (Scope_Id)
then
Error_Msg_N
("RETURN statement not allowed (No_Return)", N);
end if;
end if;
Check_Unreachable_Code (N);
end Analyze_Return_Statement;
-------------------------
-- Analyze_Return_Type --
-------------------------
procedure Analyze_Return_Type (N : Node_Id) is
Designator : constant Entity_Id := Defining_Entity (N);
Typ : Entity_Id := Empty;
begin
if Result_Definition (N) /= Error then
if Nkind (Result_Definition (N)) = N_Access_Definition then
Typ := Access_Definition (N, Result_Definition (N));
Set_Parent (Typ, Result_Definition (N));
Set_Is_Local_Anonymous_Access (Typ);
Set_Etype (Designator, Typ);
-- Ada 2005 (AI-231): Static checks
-- Null_Exclusion_Static_Checks needs to be extended to handle
-- null exclusion checks for function specifications. ???
-- if Null_Exclusion_Present (N) then
-- Null_Exclusion_Static_Checks (Param_Spec);
-- end if;
-- Subtype_Mark case
else
Find_Type (Result_Definition (N));
Typ := Entity (Result_Definition (N));
Set_Etype (Designator, Typ);
if Ekind (Typ) = E_Incomplete_Type
or else (Is_Class_Wide_Type (Typ)
and then
Ekind (Root_Type (Typ)) = E_Incomplete_Type)
then
Error_Msg_N
("invalid use of incomplete type", Result_Definition (N));
end if;
end if;
else
Set_Etype (Designator, Any_Type);
end if;
end Analyze_Return_Type;
-----------------------------
-- Analyze_Subprogram_Body --
-----------------------------
-- This procedure is called for regular subprogram bodies, generic bodies,
-- and for subprogram stubs of both kinds. In the case of stubs, only the
-- specification matters, and is used to create a proper declaration for
-- the subprogram, or to perform conformance checks.
procedure Analyze_Subprogram_Body (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Body_Spec : constant Node_Id := Specification (N);
Body_Id : Entity_Id := Defining_Entity (Body_Spec);
Prev_Id : constant Entity_Id := Current_Entity_In_Scope (Body_Id);
Body_Deleted : constant Boolean := False;
HSS : Node_Id;
Spec_Id : Entity_Id;
Spec_Decl : Node_Id := Empty;
Last_Formal : Entity_Id := Empty;
Conformant : Boolean;
Missing_Ret : Boolean;
P_Ent : Entity_Id;
procedure Check_Inline_Pragma (Spec : in out Node_Id);
-- Look ahead to recognize a pragma that may appear after the body.
-- If there is a previous spec, check that it appears in the same
-- declarative part. If the pragma is Inline_Always, perform inlining
-- unconditionally, otherwise only if Front_End_Inlining is requested.
-- If the body acts as a spec, and inlining is required, we create a
-- subprogram declaration for it, in order to attach the body to inline.
procedure Copy_Parameter_List (Plist : List_Id);
-- Comment required ???
procedure Verify_Overriding_Indicator;
-- If there was a previous spec, the entity has been entered in the
-- current scope previously. If the body itself carries an overriding
-- indicator, check that it is consistent with the known status of the
-- entity.
-------------------------
-- Check_Inline_Pragma --
-------------------------
procedure Check_Inline_Pragma (Spec : in out Node_Id) is
Prag : Node_Id;
Plist : List_Id;
begin
if not Expander_Active then
return;
end if;
if Is_List_Member (N)
and then Present (Next (N))
and then Nkind (Next (N)) = N_Pragma
then
Prag := Next (N);
if Nkind (Prag) = N_Pragma
and then
(Get_Pragma_Id (Chars (Prag)) = Pragma_Inline_Always
or else
(Front_End_Inlining
and then Get_Pragma_Id (Chars (Prag)) = Pragma_Inline))
and then
Chars
(Expression (First (Pragma_Argument_Associations (Prag))))
= Chars (Body_Id)
then
Prag := Next (N);
else
Prag := Empty;
end if;
else
Prag := Empty;
end if;
if Present (Prag) then
if Present (Spec_Id) then
if List_Containing (N) =
List_Containing (Unit_Declaration_Node (Spec_Id))
then
Analyze (Prag);
end if;
else
-- Create a subprogram declaration, to make treatment uniform
declare
Subp : constant Entity_Id :=
Make_Defining_Identifier (Loc, Chars (Body_Id));
Decl : constant Node_Id :=
Make_Subprogram_Declaration (Loc,
Specification => New_Copy_Tree (Specification (N)));
begin
Set_Defining_Unit_Name (Specification (Decl), Subp);
if Present (First_Formal (Body_Id)) then
Plist := New_List;
Copy_Parameter_List (Plist);
Set_Parameter_Specifications
(Specification (Decl), Plist);
end if;
Insert_Before (N, Decl);
Analyze (Decl);
Analyze (Prag);
Set_Has_Pragma_Inline (Subp);
if Get_Pragma_Id (Chars (Prag)) = Pragma_Inline_Always then
Set_Is_Inlined (Subp);
Set_Next_Rep_Item (Prag, First_Rep_Item (Subp));
Set_First_Rep_Item (Subp, Prag);
end if;
Spec := Subp;
end;
end if;
end if;
end Check_Inline_Pragma;
-------------------------
-- Copy_Parameter_List --
-------------------------
procedure Copy_Parameter_List (Plist : List_Id) is
Formal : Entity_Id;
begin
Formal := First_Formal (Body_Id);
while Present (Formal) loop
Append
(Make_Parameter_Specification (Loc,
Defining_Identifier =>
Make_Defining_Identifier (Sloc (Formal),
Chars => Chars (Formal)),
In_Present => In_Present (Parent (Formal)),
Out_Present => Out_Present (Parent (Formal)),
Parameter_Type =>
New_Reference_To (Etype (Formal), Loc),
Expression =>
New_Copy_Tree (Expression (Parent (Formal)))),
Plist);
Next_Formal (Formal);
end loop;
end Copy_Parameter_List;
---------------------------------
-- Verify_Overriding_Indicator --
---------------------------------
procedure Verify_Overriding_Indicator is
begin
if Must_Override (Body_Spec)
and then not Is_Overriding_Operation (Spec_Id)
then
Error_Msg_NE
("subprogram& is not overriding", Body_Spec, Spec_Id);
elsif Must_Not_Override (Body_Spec)
and then Is_Overriding_Operation (Spec_Id)
then
Error_Msg_NE
("subprogram& overrides inherited operation",
Body_Spec, Spec_Id);
end if;
end Verify_Overriding_Indicator;
-- Start of processing for Analyze_Subprogram_Body
begin
if Debug_Flag_C then
Write_Str ("==== Compiling subprogram body ");
Write_Name (Chars (Body_Id));
Write_Str (" from ");
Write_Location (Loc);
Write_Eol;
end if;
Trace_Scope (N, Body_Id, " Analyze subprogram");
-- Generic subprograms are handled separately. They always have a
-- generic specification. Determine whether current scope has a
-- previous declaration.
-- If the subprogram body is defined within an instance of the same
-- name, the instance appears as a package renaming, and will be hidden
-- within the subprogram.
if Present (Prev_Id)
and then not Is_Overloadable (Prev_Id)
and then (Nkind (Parent (Prev_Id)) /= N_Package_Renaming_Declaration
or else Comes_From_Source (Prev_Id))
then
if Is_Generic_Subprogram (Prev_Id) then
Spec_Id := Prev_Id;
Set_Is_Compilation_Unit (Body_Id, Is_Compilation_Unit (Spec_Id));
Set_Is_Child_Unit (Body_Id, Is_Child_Unit (Spec_Id));
Analyze_Generic_Subprogram_Body (N, Spec_Id);
return;
else
-- Previous entity conflicts with subprogram name. Attempting to
-- enter name will post error.
Enter_Name (Body_Id);
return;
end if;
-- Non-generic case, find the subprogram declaration, if one was seen,
-- or enter new overloaded entity in the current scope. If the
-- Current_Entity is the Body_Id itself, the unit is being analyzed as
-- part of the context of one of its subunits. No need to redo the
-- analysis.
elsif Prev_Id = Body_Id
and then Has_Completion (Body_Id)
then
return;
else
Body_Id := Analyze_Subprogram_Specification (Body_Spec);
if Nkind (N) = N_Subprogram_Body_Stub
or else No (Corresponding_Spec (N))
then
Spec_Id := Find_Corresponding_Spec (N);
-- If this is a duplicate body, no point in analyzing it
if Error_Posted (N) then
return;
end if;
-- A subprogram body should cause freezing of its own declaration,
-- but if there was no previous explicit declaration, then the
-- subprogram will get frozen too late (there may be code within
-- the body that depends on the subprogram having been frozen,
-- such as uses of extra formals), so we force it to be frozen
-- here. Same holds if the body and the spec are compilation
-- units.
if No (Spec_Id) then
Freeze_Before (N, Body_Id);
elsif Nkind (Parent (N)) = N_Compilation_Unit then
Freeze_Before (N, Spec_Id);
end if;
else
Spec_Id := Corresponding_Spec (N);
end if;
end if;
-- Do not inline any subprogram that contains nested subprograms, since
-- the backend inlining circuit seems to generate uninitialized
-- references in this case. We know this happens in the case of front
-- end ZCX support, but it also appears it can happen in other cases as
-- well. The backend often rejects attempts to inline in the case of
-- nested procedures anyway, so little if anything is lost by this.
-- Note that this is test is for the benefit of the back-end. There is
-- a separate test for front-end inlining that also rejects nested
-- subprograms.
-- Do not do this test if errors have been detected, because in some
-- error cases, this code blows up, and we don't need it anyway if
-- there have been errors, since we won't get to the linker anyway.
if Comes_From_Source (Body_Id)
and then Serious_Errors_Detected = 0
then
P_Ent := Body_Id;
loop
P_Ent := Scope (P_Ent);
exit when No (P_Ent) or else P_Ent = Standard_Standard;
if Is_Subprogram (P_Ent) then
Set_Is_Inlined (P_Ent, False);
if Comes_From_Source (P_Ent)
and then Has_Pragma_Inline (P_Ent)
then
Cannot_Inline
("cannot inline& (nested subprogram)?",
N, P_Ent);
end if;
end if;
end loop;
end if;
Check_Inline_Pragma (Spec_Id);
-- Case of fully private operation in the body of the protected type.
-- We must create a declaration for the subprogram, in order to attach
-- the protected subprogram that will be used in internal calls.
if No (Spec_Id)
and then Comes_From_Source (N)
and then Is_Protected_Type (Current_Scope)
then
declare
Decl : Node_Id;
Plist : List_Id;
Formal : Entity_Id;
New_Spec : Node_Id;
begin
Formal := First_Formal (Body_Id);
-- The protected operation always has at least one formal, namely
-- the object itself, but it is only placed in the parameter list
-- if expansion is enabled.
if Present (Formal)
or else Expander_Active
then
Plist := New_List;
else
Plist := No_List;
end if;
Copy_Parameter_List (Plist);
if Nkind (Body_Spec) = N_Procedure_Specification then
New_Spec :=
Make_Procedure_Specification (Loc,
Defining_Unit_Name =>
Make_Defining_Identifier (Sloc (Body_Id),
Chars => Chars (Body_Id)),
Parameter_Specifications => Plist);
else
New_Spec :=
Make_Function_Specification (Loc,
Defining_Unit_Name =>
Make_Defining_Identifier (Sloc (Body_Id),
Chars => Chars (Body_Id)),
Parameter_Specifications => Plist,
Result_Definition =>
New_Occurrence_Of (Etype (Body_Id), Loc));
end if;
Decl :=
Make_Subprogram_Declaration (Loc,
Specification => New_Spec);
Insert_Before (N, Decl);
Spec_Id := Defining_Unit_Name (New_Spec);
-- Indicate that the entity comes from source, to ensure that
-- cross-reference information is properly generated. The body
-- itself is rewritten during expansion, and the body entity will
-- not appear in calls to the operation.
Set_Comes_From_Source (Spec_Id, True);
Analyze (Decl);
Set_Has_Completion (Spec_Id);
Set_Convention (Spec_Id, Convention_Protected);
end;
elsif Present (Spec_Id) then
Spec_Decl := Unit_Declaration_Node (Spec_Id);
Verify_Overriding_Indicator;
end if;
-- Place subprogram on scope stack, and make formals visible. If there
-- is a spec, the visible entity remains that of the spec.
if Present (Spec_Id) then
Generate_Reference (Spec_Id, Body_Id, 'b', Set_Ref => False);
if Is_Child_Unit (Spec_Id) then
Generate_Reference (Spec_Id, Scope (Spec_Id), 'k', False);
end if;
if Style_Check then
Style.Check_Identifier (Body_Id, Spec_Id);
end if;
Set_Is_Compilation_Unit (Body_Id, Is_Compilation_Unit (Spec_Id));
Set_Is_Child_Unit (Body_Id, Is_Child_Unit (Spec_Id));
if Is_Abstract (Spec_Id) then
Error_Msg_N ("an abstract subprogram cannot have a body", N);
return;
else
Set_Convention (Body_Id, Convention (Spec_Id));
Set_Has_Completion (Spec_Id);
if Is_Protected_Type (Scope (Spec_Id)) then
Set_Privals_Chain (Spec_Id, New_Elmt_List);
end if;
-- If this is a body generated for a renaming, do not check for
-- full conformance. The check is redundant, because the spec of
-- the body is a copy of the spec in the renaming declaration,
-- and the test can lead to spurious errors on nested defaults.
if Present (Spec_Decl)
and then not Comes_From_Source (N)
and then
(Nkind (Original_Node (Spec_Decl)) =
N_Subprogram_Renaming_Declaration
or else (Present (Corresponding_Body (Spec_Decl))
and then
Nkind (Unit_Declaration_Node
(Corresponding_Body (Spec_Decl))) =
N_Subprogram_Renaming_Declaration))
then
Conformant := True;
else
Check_Conformance
(Body_Id, Spec_Id,
Fully_Conformant, True, Conformant, Body_Id);
end if;
-- If the body is not fully conformant, we have to decide if we
-- should analyze it or not. If it has a really messed up profile
-- then we probably should not analyze it, since we will get too
-- many bogus messages.
-- Our decision is to go ahead in the non-fully conformant case
-- only if it is at least mode conformant with the spec. Note
-- that the call to Check_Fully_Conformant has issued the proper
-- error messages to complain about the lack of conformance.
if not Conformant
and then not Mode_Conformant (Body_Id, Spec_Id)
then
return;
end if;
end if;
if Spec_Id /= Body_Id then
Reference_Body_Formals (Spec_Id, Body_Id);
end if;
if Nkind (N) /= N_Subprogram_Body_Stub then
Set_Corresponding_Spec (N, Spec_Id);
-- Ada 2005 (AI-345): Restore the correct Etype: here we undo the
-- work done by Analyze_Subprogram_Specification to allow the
-- overriding of task, protected and interface primitives.
if Comes_From_Source (Spec_Id)
and then Present (First_Entity (Spec_Id))
and then Ekind (Etype (First_Entity (Spec_Id))) = E_Record_Type
and then Is_Tagged_Type (Etype (First_Entity (Spec_Id)))
and then Present (Abstract_Interfaces
(Etype (First_Entity (Spec_Id))))
and then Present (Corresponding_Concurrent_Type
(Etype (First_Entity (Spec_Id))))
then
Set_Etype (First_Entity (Spec_Id),
Corresponding_Concurrent_Type
(Etype (First_Entity (Spec_Id))));
end if;
-- Ada 2005: A formal that is an access parameter may have a
-- designated type imported through a limited_with clause, while
-- the body has a regular with clause. Update the types of the
-- formals accordingly, so that the non-limited view of each type
-- is available in the body. We have already verified that the
-- declarations are type-conformant.
if Ada_Version >= Ada_05 then
declare
F_Spec : Entity_Id;
F_Body : Entity_Id;
begin
F_Spec := First_Formal (Spec_Id);
F_Body := First_Formal (Body_Id);
while Present (F_Spec) loop
if Ekind (Etype (F_Spec)) = E_Anonymous_Access_Type
and then
From_With_Type (Designated_Type (Etype (F_Spec)))
then
Set_Etype (F_Spec, Etype (F_Body));
end if;
Next_Formal (F_Spec);
Next_Formal (F_Body);
end loop;
end;
end if;
-- Now make the formals visible, and place subprogram
-- on scope stack.
Install_Formals (Spec_Id);
Last_Formal := Last_Entity (Spec_Id);
New_Scope (Spec_Id);
-- Make sure that the subprogram is immediately visible. For
-- child units that have no separate spec this is indispensable.
-- Otherwise it is safe albeit redundant.
Set_Is_Immediately_Visible (Spec_Id);
end if;
Set_Corresponding_Body (Unit_Declaration_Node (Spec_Id), Body_Id);
Set_Ekind (Body_Id, E_Subprogram_Body);
Set_Scope (Body_Id, Scope (Spec_Id));
-- Case of subprogram body with no previous spec
else
if Style_Check
and then Comes_From_Source (Body_Id)
and then not Suppress_Style_Checks (Body_Id)
and then not In_Instance
then
Style.Body_With_No_Spec (N);
end if;
New_Overloaded_Entity (Body_Id);
if Nkind (N) /= N_Subprogram_Body_Stub then
Set_Acts_As_Spec (N);
Generate_Definition (Body_Id);
Generate_Reference
(Body_Id, Body_Id, 'b', Set_Ref => False, Force => True);
Generate_Reference_To_Formals (Body_Id);
Install_Formals (Body_Id);
New_Scope (Body_Id);
end if;
end if;
-- If this is the proper body of a stub, we must verify that the stub
-- conforms to the body, and to the previous spec if one was present.
-- we know already that the body conforms to that spec. This test is
-- only required for subprograms that come from source.
if Nkind (Parent (N)) = N_Subunit
and then Comes_From_Source (N)
and then not Error_Posted (Body_Id)
and then Nkind (Corresponding_Stub (Parent (N))) =
N_Subprogram_Body_Stub
then
declare
Old_Id : constant Entity_Id :=
Defining_Entity
(Specification (Corresponding_Stub (Parent (N))));
Conformant : Boolean := False;
begin
if No (Spec_Id) then
Check_Fully_Conformant (Body_Id, Old_Id);
else
Check_Conformance
(Body_Id, Old_Id, Fully_Conformant, False, Conformant);
if not Conformant then
-- The stub was taken to be a new declaration. Indicate
-- that it lacks a body.
Set_Has_Completion (Old_Id, False);
end if;
end if;
end;
end if;
Set_Has_Completion (Body_Id);
Check_Eliminated (Body_Id);
if Nkind (N) = N_Subprogram_Body_Stub then
return;
elsif Present (Spec_Id)
and then Expander_Active
and then
(Is_Always_Inlined (Spec_Id)
or else (Has_Pragma_Inline (Spec_Id) and Front_End_Inlining))
then
Build_Body_To_Inline (N, Spec_Id);
end if;
-- Ada 2005 (AI-262): In library subprogram bodies, after the analysis
-- if its specification we have to install the private withed units.
if Is_Compilation_Unit (Body_Id)
and then Scope (Body_Id) = Standard_Standard
then
Install_Private_With_Clauses (Body_Id);
end if;
-- Now we can go on to analyze the body
HSS := Handled_Statement_Sequence (N);
Set_Actual_Subtypes (N, Current_Scope);
Analyze_Declarations (Declarations (N));
Check_Completion;
Analyze (HSS);
Process_End_Label (HSS, 't', Current_Scope);
End_Scope;
Check_Subprogram_Order (N);
Set_Analyzed (Body_Id);
-- If we have a separate spec, then the analysis of the declarations
-- caused the entities in the body to be chained to the spec id, but
-- we want them chained to the body id. Only the formal parameters
-- end up chained to the spec id in this case.
if Present (Spec_Id) then
-- We must conform to the categorization of our spec
Validate_Categorization_Dependency (N, Spec_Id);
-- And if this is a child unit, the parent units must conform
if Is_Child_Unit (Spec_Id) then
Validate_Categorization_Dependency
(Unit_Declaration_Node (Spec_Id), Spec_Id);
end if;
if Present (Last_Formal) then
Set_Next_Entity
(Last_Entity (Body_Id), Next_Entity (Last_Formal));
Set_Next_Entity (Last_Formal, Empty);
Set_Last_Entity (Body_Id, Last_Entity (Spec_Id));
Set_Last_Entity (Spec_Id, Last_Formal);
else
Set_First_Entity (Body_Id, First_Entity (Spec_Id));
Set_Last_Entity (Body_Id, Last_Entity (Spec_Id));
Set_First_Entity (Spec_Id, Empty);
Set_Last_Entity (Spec_Id, Empty);
end if;
end if;
-- If function, check return statements
if Nkind (Body_Spec) = N_Function_Specification then
declare
Id : Entity_Id;
begin
if Present (Spec_Id) then
Id := Spec_Id;
else
Id := Body_Id;
end if;
if Return_Present (Id) then
Check_Returns (HSS, 'F', Missing_Ret);
if Missing_Ret then
Set_Has_Missing_Return (Id);
end if;
elsif not Is_Machine_Code_Subprogram (Id)
and then not Body_Deleted
then
Error_Msg_N ("missing RETURN statement in function body", N);
end if;
end;
-- If procedure with No_Return, check returns
elsif Nkind (Body_Spec) = N_Procedure_Specification
and then Present (Spec_Id)
and then No_Return (Spec_Id)
then
Check_Returns (HSS, 'P', Missing_Ret, Spec_Id);
end if;
-- Now we are going to check for variables that are never modified in
-- the body of the procedure. We omit these checks if the first
-- statement of the procedure raises an exception. In particular this
-- deals with the common idiom of a stubbed function, which might
-- appear as something like
-- function F (A : Integer) return Some_Type;
-- X : Some_Type;
-- begin
-- raise Program_Error;
-- return X;
-- end F;
-- Here the purpose of X is simply to satisfy the (annoying)
-- requirement in Ada that there be at least one return, and we
-- certainly do not want to go posting warnings on X that it is not
-- initialized!
declare
Stm : Node_Id := First (Statements (HSS));
begin
-- Skip an initial label (for one thing this occurs when we are in
-- front end ZCX mode, but in any case it is irrelevant).
if Nkind (Stm) = N_Label then
Next (Stm);
end if;
-- Do the test on the original statement before expansion
declare
Ostm : constant Node_Id := Original_Node (Stm);
begin
-- If explicit raise statement, return with no checks
if Nkind (Ostm) = N_Raise_Statement then
return;
-- Check for explicit call cases which likely raise an exception
elsif Nkind (Ostm) = N_Procedure_Call_Statement then
if Is_Entity_Name (Name (Ostm)) then
declare
Ent : constant Entity_Id := Entity (Name (Ostm));
begin
-- If the procedure is marked No_Return, then likely it
-- raises an exception, but in any case it is not coming
-- back here, so no need to check beyond the call.
if Ekind (Ent) = E_Procedure
and then No_Return (Ent)
then
return;
-- If the procedure name is Raise_Exception, then also
-- assume that it raises an exception. The main target
-- here is Ada.Exceptions.Raise_Exception, but this name
-- is pretty evocative in any context! Note that the
-- procedure in Ada.Exceptions is not marked No_Return
-- because of the annoying case of the null exception Id.
elsif Chars (Ent) = Name_Raise_Exception then
return;
end if;
end;
end if;
end if;
end;
end;
-- Check for variables that are never modified
declare
E1, E2 : Entity_Id;
begin
-- If there is a separate spec, then transfer Never_Set_In_Source
-- flags from out parameters to the corresponding entities in the
-- body. The reason we do that is we want to post error flags on
-- the body entities, not the spec entities.
if Present (Spec_Id) then
E1 := First_Entity (Spec_Id);
while Present (E1) loop
if Ekind (E1) = E_Out_Parameter then
E2 := First_Entity (Body_Id);
while Present (E2) loop
exit when Chars (E1) = Chars (E2);
Next_Entity (E2);
end loop;
if Present (E2) then
Set_Never_Set_In_Source (E2, Never_Set_In_Source (E1));
end if;
end if;
Next_Entity (E1);
end loop;
end if;
-- Check references in body unless it was deleted. Note that the
-- check of Body_Deleted here is not just for efficiency, it is
-- necessary to avoid junk warnings on formal parameters.
if not Body_Deleted then
Check_References (Body_Id);
end if;
end;
end Analyze_Subprogram_Body;
------------------------------------
-- Analyze_Subprogram_Declaration --
------------------------------------
procedure Analyze_Subprogram_Declaration (N : Node_Id) is
Designator : constant Entity_Id :=
Analyze_Subprogram_Specification (Specification (N));
Scop : constant Entity_Id := Current_Scope;
-- Start of processing for Analyze_Subprogram_Declaration
begin
Generate_Definition (Designator);
-- Check for RCI unit subprogram declarations against in-lined
-- subprograms and subprograms having access parameter or limited
-- parameter without Read and Write (RM E.2.3(12-13)).
Validate_RCI_Subprogram_Declaration (N);
Trace_Scope
(N,
Defining_Entity (N),
" Analyze subprogram spec. ");
if Debug_Flag_C then
Write_Str ("==== Compiling subprogram spec ");
Write_Name (Chars (Designator));
Write_Str (" from ");
Write_Location (Sloc (N));
Write_Eol;
end if;
New_Overloaded_Entity (Designator);
Check_Delayed_Subprogram (Designator);
-- What is the following code for, it used to be
-- ??? Set_Suppress_Elaboration_Checks
-- ??? (Designator, Elaboration_Checks_Suppressed (Designator));
-- The following seems equivalent, but a bit dubious
if Elaboration_Checks_Suppressed (Designator) then
Set_Kill_Elaboration_Checks (Designator);
end if;
if Scop /= Standard_Standard
and then not Is_Child_Unit (Designator)
then
Set_Categorization_From_Scope (Designator, Scop);
else
-- For a compilation unit, check for library-unit pragmas
New_Scope (Designator);
Set_Categorization_From_Pragmas (N);
Validate_Categorization_Dependency (N, Designator);
Pop_Scope;
end if;
-- For a compilation unit, set body required. This flag will only be
-- reset if a valid Import or Interface pragma is processed later on.
if Nkind (Parent (N)) = N_Compilation_Unit then
Set_Body_Required (Parent (N), True);
if Ada_Version >= Ada_05
and then Nkind (Specification (N)) = N_Procedure_Specification
and then Null_Present (Specification (N))
then
Error_Msg_N
("null procedure cannot be declared at library level", N);
end if;
end if;
Generate_Reference_To_Formals (Designator);
Check_Eliminated (Designator);
-- Ada 2005: if procedure is declared with "is null" qualifier,
-- it requires no body.
if Nkind (Specification (N)) = N_Procedure_Specification
and then Null_Present (Specification (N))
then
Set_Has_Completion (Designator);
Set_Is_Inlined (Designator);
end if;
end Analyze_Subprogram_Declaration;
--------------------------------------
-- Analyze_Subprogram_Specification --
--------------------------------------
-- Reminder: N here really is a subprogram specification (not a subprogram
-- declaration). This procedure is called to analyze the specification in
-- both subprogram bodies and subprogram declarations (specs).
function Analyze_Subprogram_Specification (N : Node_Id) return Entity_Id is
Designator : constant Entity_Id := Defining_Entity (N);
Formals : constant List_Id := Parameter_Specifications (N);
function Has_Interface_Formals (T : List_Id) return Boolean;
-- Ada 2005 (AI-251): Returns true if some non class-wide interface
-- formal is found.
---------------------------
-- Has_Interface_Formals --
---------------------------
function Has_Interface_Formals (T : List_Id) return Boolean is
Param_Spec : Node_Id;
Formal : Entity_Id;
begin
Param_Spec := First (T);
while Present (Param_Spec) loop
Formal := Defining_Identifier (Param_Spec);
if Is_Class_Wide_Type (Etype (Formal)) then
null;
elsif Is_Interface (Etype (Formal)) then
return True;
end if;
Next (Param_Spec);
end loop;
return False;
end Has_Interface_Formals;
-- Start of processing for Analyze_Subprogram_Specification
begin
Generate_Definition (Designator);
if Nkind (N) = N_Function_Specification then
Set_Ekind (Designator, E_Function);
Set_Mechanism (Designator, Default_Mechanism);
else
Set_Ekind (Designator, E_Procedure);
Set_Etype (Designator, Standard_Void_Type);
end if;
-- Introduce new scope for analysis of the formals and of the
-- return type.
Set_Scope (Designator, Current_Scope);
if Present (Formals) then
New_Scope (Designator);
Process_Formals (Formals, N);
-- Ada 2005 (AI-345): Allow overriding primitives of protected
-- interfaces by means of normal subprograms. For this purpose
-- temporarily use the corresponding record type as the etype
-- of the first formal.
if Ada_Version >= Ada_05
and then Comes_From_Source (Designator)
and then Present (First_Entity (Designator))
and then (Ekind (Etype (First_Entity (Designator)))
= E_Protected_Type
or else
Ekind (Etype (First_Entity (Designator)))
= E_Task_Type)
and then Present (Corresponding_Record_Type
(Etype (First_Entity (Designator))))
and then Present (Abstract_Interfaces
(Corresponding_Record_Type
(Etype (First_Entity (Designator)))))
then
Set_Etype (First_Entity (Designator),
Corresponding_Record_Type (Etype (First_Entity (Designator))));
end if;
End_Scope;
elsif Nkind (N) = N_Function_Specification then
Analyze_Return_Type (N);
end if;
if Nkind (N) = N_Function_Specification then
if Nkind (Designator) = N_Defining_Operator_Symbol then
Valid_Operator_Definition (Designator);
end if;
May_Need_Actuals (Designator);
if Is_Abstract (Etype (Designator))
and then Nkind (Parent (N))
/= N_Abstract_Subprogram_Declaration
and then (Nkind (Parent (N)))
/= N_Formal_Abstract_Subprogram_Declaration
and then (Nkind (Parent (N)) /= N_Subprogram_Renaming_Declaration
or else not Is_Entity_Name (Name (Parent (N)))
or else not Is_Abstract (Entity (Name (Parent (N)))))
then
Error_Msg_N
("function that returns abstract type must be abstract", N);
end if;
end if;
if Ada_Version >= Ada_05
and then Comes_From_Source (N)
and then Nkind (Parent (N)) /= N_Abstract_Subprogram_Declaration
and then (Nkind (N) /= N_Procedure_Specification
or else
not Null_Present (N))
and then Has_Interface_Formals (Formals)
then
Error_Msg_Name_1 := Chars (Defining_Unit_Name
(Specification (Parent (N))));
Error_Msg_N
("(Ada 2005) interface subprogram % must be abstract or null", N);
end if;
return Designator;
end Analyze_Subprogram_Specification;
--------------------------
-- Build_Body_To_Inline --
--------------------------
procedure Build_Body_To_Inline (N : Node_Id; Subp : Entity_Id) is
Decl : constant Node_Id := Unit_Declaration_Node (Subp);
Original_Body : Node_Id;
Body_To_Analyze : Node_Id;
Max_Size : constant := 10;
Stat_Count : Integer := 0;
function Has_Excluded_Declaration (Decls : List_Id) return Boolean;
-- Check for declarations that make inlining not worthwhile
function Has_Excluded_Statement (Stats : List_Id) return Boolean;
-- Check for statements that make inlining not worthwhile: any tasking
-- statement, nested at any level. Keep track of total number of
-- elementary statements, as a measure of acceptable size.
function Has_Pending_Instantiation return Boolean;
-- If some enclosing body contains instantiations that appear before
-- the corresponding generic body, the enclosing body has a freeze node
-- so that it can be elaborated after the generic itself. This might
-- conflict with subsequent inlinings, so that it is unsafe to try to
-- inline in such a case.
function Has_Single_Return return Boolean;
-- In general we cannot inline functions that return unconstrained
-- type. However, we can handle such functions if all return statements
-- return a local variable that is the only declaration in the body
-- of the function. In that case the call can be replaced by that
-- local variable as is done for other inlined calls.
procedure Remove_Pragmas;
-- A pragma Unreferenced that mentions a formal parameter has no
-- meaning when the body is inlined and the formals are rewritten.
-- Remove it from body to inline. The analysis of the non-inlined body
-- will handle the pragma properly.
function Uses_Secondary_Stack (Bod : Node_Id) return Boolean;
-- If the body of the subprogram includes a call that returns an
-- unconstrained type, the secondary stack is involved, and it
-- is not worth inlining.
------------------------------
-- Has_Excluded_Declaration --
------------------------------
function Has_Excluded_Declaration (Decls : List_Id) return Boolean is
D : Node_Id;
function Is_Unchecked_Conversion (D : Node_Id) return Boolean;
-- Nested subprograms make a given body ineligible for inlining, but
-- we make an exception for instantiations of unchecked conversion.
-- The body has not been analyzed yet, so check the name, and verify
-- that the visible entity with that name is the predefined unit.
-----------------------------
-- Is_Unchecked_Conversion --
-----------------------------
function Is_Unchecked_Conversion (D : Node_Id) return Boolean is
Id : constant Node_Id := Name (D);
Conv : Entity_Id;
begin
if Nkind (Id) = N_Identifier
and then Chars (Id) = Name_Unchecked_Conversion
then
Conv := Current_Entity (Id);
elsif (Nkind (Id) = N_Selected_Component
or else Nkind (Id) = N_Expanded_Name)
and then Chars (Selector_Name (Id)) = Name_Unchecked_Conversion
then
Conv := Current_Entity (Selector_Name (Id));
else
return False;
end if;
return Present (Conv)
and then Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (Conv)))
and then Is_Intrinsic_Subprogram (Conv);
end Is_Unchecked_Conversion;
-- Start of processing for Has_Excluded_Declaration
begin
D := First (Decls);
while Present (D) loop
if (Nkind (D) = N_Function_Instantiation
and then not Is_Unchecked_Conversion (D))
or else Nkind (D) = N_Protected_Type_Declaration
or else Nkind (D) = N_Package_Declaration
or else Nkind (D) = N_Package_Instantiation
or else Nkind (D) = N_Subprogram_Body
or else Nkind (D) = N_Procedure_Instantiation
or else Nkind (D) = N_Task_Type_Declaration
then
Cannot_Inline
("cannot inline & (non-allowed declaration)?", D, Subp);
return True;
end if;
Next (D);
end loop;
return False;
end Has_Excluded_Declaration;
----------------------------
-- Has_Excluded_Statement --
----------------------------
function Has_Excluded_Statement (Stats : List_Id) return Boolean is
S : Node_Id;
E : Node_Id;
begin
S := First (Stats);
while Present (S) loop
Stat_Count := Stat_Count + 1;
if Nkind (S) = N_Abort_Statement
or else Nkind (S) = N_Asynchronous_Select
or else Nkind (S) = N_Conditional_Entry_Call
or else Nkind (S) = N_Delay_Relative_Statement
or else Nkind (S) = N_Delay_Until_Statement
or else Nkind (S) = N_Selective_Accept
or else Nkind (S) = N_Timed_Entry_Call
then
Cannot_Inline
("cannot inline & (non-allowed statement)?", S, Subp);
return True;
elsif Nkind (S) = N_Block_Statement then
if Present (Declarations (S))
and then Has_Excluded_Declaration (Declarations (S))
then
return True;
elsif Present (Handled_Statement_Sequence (S))
and then
(Present
(Exception_Handlers (Handled_Statement_Sequence (S)))
or else
Has_Excluded_Statement
(Statements (Handled_Statement_Sequence (S))))
then
return True;
end if;
elsif Nkind (S) = N_Case_Statement then
E := First (Alternatives (S));
while Present (E) loop
if Has_Excluded_Statement (Statements (E)) then
return True;
end if;
Next (E);
end loop;
elsif Nkind (S) = N_If_Statement then
if Has_Excluded_Statement (Then_Statements (S)) then
return True;
end if;
if Present (Elsif_Parts (S)) then
E := First (Elsif_Parts (S));
while Present (E) loop
if Has_Excluded_Statement (Then_Statements (E)) then
return True;
end if;
Next (E);
end loop;
end if;
if Present (Else_Statements (S))
and then Has_Excluded_Statement (Else_Statements (S))
then
return True;
end if;
elsif Nkind (S) = N_Loop_Statement
and then Has_Excluded_Statement (Statements (S))
then
return True;
end if;
Next (S);
end loop;
return False;
end Has_Excluded_Statement;
-------------------------------
-- Has_Pending_Instantiation --
-------------------------------
function Has_Pending_Instantiation return Boolean is
S : Entity_Id := Current_Scope;
begin
while Present (S) loop
if Is_Compilation_Unit (S)
or else Is_Child_Unit (S)
then
return False;
elsif Ekind (S) = E_Package
and then Has_Forward_Instantiation (S)
then
return True;
end if;
S := Scope (S);
end loop;
return False;
end Has_Pending_Instantiation;
------------------------
-- Has_Single_Return --
------------------------
function Has_Single_Return return Boolean is
Return_Statement : Node_Id := Empty;
function Check_Return (N : Node_Id) return Traverse_Result;
------------------
-- Check_Return --
------------------
function Check_Return (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) = N_Return_Statement then
if Present (Expression (N))
and then Is_Entity_Name (Expression (N))
then
if No (Return_Statement) then
Return_Statement := N;
return OK;
elsif Chars (Expression (N)) =
Chars (Expression (Return_Statement))
then
return OK;
else
return Abandon;
end if;
else
-- Expression has wrong form
return Abandon;
end if;
else
return OK;
end if;
end Check_Return;
function Check_All_Returns is new Traverse_Func (Check_Return);
-- Start of processing for Has_Single_Return
begin
return Check_All_Returns (N) = OK
and then Present (Declarations (N))
and then Chars (Expression (Return_Statement)) =
Chars (Defining_Identifier (First (Declarations (N))));
end Has_Single_Return;
--------------------
-- Remove_Pragmas --
--------------------
procedure Remove_Pragmas is
Decl : Node_Id;
Nxt : Node_Id;
begin
Decl := First (Declarations (Body_To_Analyze));
while Present (Decl) loop
Nxt := Next (Decl);
if Nkind (Decl) = N_Pragma
and then Chars (Decl) = Name_Unreferenced
then
Remove (Decl);
end if;
Decl := Nxt;
end loop;
end Remove_Pragmas;
--------------------------
-- Uses_Secondary_Stack --
--------------------------
function Uses_Secondary_Stack (Bod : Node_Id) return Boolean is
function Check_Call (N : Node_Id) return Traverse_Result;
-- Look for function calls that return an unconstrained type
----------------
-- Check_Call --
----------------
function Check_Call (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) = N_Function_Call
and then Is_Entity_Name (Name (N))
and then Is_Composite_Type (Etype (Entity (Name (N))))
and then not Is_Constrained (Etype (Entity (Name (N))))
then
Cannot_Inline
("cannot inline & (call returns unconstrained type)?",
N, Subp);
return Abandon;
else
return OK;
end if;
end Check_Call;
function Check_Calls is new Traverse_Func (Check_Call);
begin
return Check_Calls (Bod) = Abandon;
end Uses_Secondary_Stack;
-- Start of processing for Build_Body_To_Inline
begin
if Nkind (Decl) = N_Subprogram_Declaration
and then Present (Body_To_Inline (Decl))
then
return; -- Done already.
-- Functions that return unconstrained composite types require
-- secondary stack handling, and cannot currently be inlined, unless
-- all return statements return a local variable that is the first
-- local declaration in the body.
elsif Ekind (Subp) = E_Function
and then not Is_Scalar_Type (Etype (Subp))
and then not Is_Access_Type (Etype (Subp))
and then not Is_Constrained (Etype (Subp))
then
if not Has_Single_Return then
Cannot_Inline
("cannot inline & (unconstrained return type)?", N, Subp);
return;
end if;
-- Ditto for functions that return controlled types, where controlled
-- actions interfere in complex ways with inlining.
elsif Ekind (Subp) = E_Function
and then Controlled_Type (Etype (Subp))
then
Cannot_Inline
("cannot inline & (controlled return type)?", N, Subp);
return;
end if;
if Present (Declarations (N))
and then Has_Excluded_Declaration (Declarations (N))
then
return;
end if;
if Present (Handled_Statement_Sequence (N)) then
if Present (Exception_Handlers (Handled_Statement_Sequence (N))) then
Cannot_Inline
("cannot inline& (exception handler)?",
First (Exception_Handlers (Handled_Statement_Sequence (N))),
Subp);
return;
elsif
Has_Excluded_Statement
(Statements (Handled_Statement_Sequence (N)))
then
return;
end if;
end if;
-- We do not inline a subprogram that is too large, unless it is
-- marked Inline_Always. This pragma does not suppress the other
-- checks on inlining (forbidden declarations, handlers, etc).
if Stat_Count > Max_Size
and then not Is_Always_Inlined (Subp)
then
Cannot_Inline ("cannot inline& (body too large)?", N, Subp);
return;
end if;
if Has_Pending_Instantiation then
Cannot_Inline
("cannot inline& (forward instance within enclosing body)?",
N, Subp);
return;
end if;
-- Within an instance, the body to inline must be treated as a nested
-- generic, so that the proper global references are preserved.
if In_Instance then
Save_Env (Scope (Current_Scope), Scope (Current_Scope));
Original_Body := Copy_Generic_Node (N, Empty, True);
else
Original_Body := Copy_Separate_Tree (N);
end if;
-- We need to capture references to the formals in order to substitute
-- the actuals at the point of inlining, i.e. instantiation. To treat
-- the formals as globals to the body to inline, we nest it within
-- a dummy parameterless subprogram, declared within the real one.
-- To avoid generating an internal name (which is never public, and
-- which affects serial numbers of other generated names), we use
-- an internal symbol that cannot conflict with user declarations.
Set_Parameter_Specifications (Specification (Original_Body), No_List);
Set_Defining_Unit_Name
(Specification (Original_Body),
Make_Defining_Identifier (Sloc (N), Name_uParent));
Set_Corresponding_Spec (Original_Body, Empty);
Body_To_Analyze := Copy_Generic_Node (Original_Body, Empty, False);
-- Set return type of function, which is also global and does not need
-- to be resolved.
if Ekind (Subp) = E_Function then
Set_Result_Definition (Specification (Body_To_Analyze),
New_Occurrence_Of (Etype (Subp), Sloc (N)));
end if;
if No (Declarations (N)) then
Set_Declarations (N, New_List (Body_To_Analyze));
else
Append (Body_To_Analyze, Declarations (N));
end if;
Expander_Mode_Save_And_Set (False);
Remove_Pragmas;
Analyze (Body_To_Analyze);
New_Scope (Defining_Entity (Body_To_Analyze));
Save_Global_References (Original_Body);
End_Scope;
Remove (Body_To_Analyze);
Expander_Mode_Restore;
if In_Instance then
Restore_Env;
end if;
-- If secondary stk used there is no point in inlining. We have
-- already issued the warning in this case, so nothing to do.
if Uses_Secondary_Stack (Body_To_Analyze) then
return;
end if;
Set_Body_To_Inline (Decl, Original_Body);
Set_Ekind (Defining_Entity (Original_Body), Ekind (Subp));
Set_Is_Inlined (Subp);
end Build_Body_To_Inline;
-------------------
-- Cannot_Inline --
-------------------
procedure Cannot_Inline (Msg : String; N : Node_Id; Subp : Entity_Id) is
begin
-- Do not emit warning if this is a predefined unit which is not
-- the main unit. With validity checks enabled, some predefined
-- subprograms may contain nested subprograms and become ineligible
-- for inlining.
if Is_Predefined_File_Name (Unit_File_Name (Get_Source_Unit (Subp)))
and then not In_Extended_Main_Source_Unit (Subp)
then
null;
elsif Is_Always_Inlined (Subp) then
-- Remove last character (question mark) to make this into an error,
-- because the Inline_Always pragma cannot be obeyed.
-- LLVM local
Error_Msg_NE (Msg (Msg'First .. Msg'Last - 1), N, Subp);
elsif Ineffective_Inline_Warnings then
Error_Msg_NE (Msg, N, Subp);
end if;
end Cannot_Inline;
-----------------------
-- Check_Conformance --
-----------------------
procedure Check_Conformance
(New_Id : Entity_Id;
Old_Id : Entity_Id;
Ctype : Conformance_Type;
Errmsg : Boolean;
Conforms : out Boolean;
Err_Loc : Node_Id := Empty;
Get_Inst : Boolean := False;
Skip_Controlling_Formals : Boolean := False)
is
Old_Type : constant Entity_Id := Etype (Old_Id);
New_Type : constant Entity_Id := Etype (New_Id);
Old_Formal : Entity_Id;
New_Formal : Entity_Id;
procedure Conformance_Error (Msg : String; N : Node_Id := New_Id);
-- Post error message for conformance error on given node. Two messages
-- are output. The first points to the previous declaration with a
-- general "no conformance" message. The second is the detailed reason,
-- supplied as Msg. The parameter N provide information for a possible
-- & insertion in the message, and also provides the location for
-- posting the message in the absence of a specified Err_Loc location.
-----------------------
-- Conformance_Error --
-----------------------
procedure Conformance_Error (Msg : String; N : Node_Id := New_Id) is
Enode : Node_Id;
begin
Conforms := False;
if Errmsg then
if No (Err_Loc) then
Enode := N;
else
Enode := Err_Loc;
end if;
Error_Msg_Sloc := Sloc (Old_Id);
case Ctype is
when Type_Conformant =>
Error_Msg_N
("not type conformant with declaration#!", Enode);
when Mode_Conformant =>
Error_Msg_N
("not mode conformant with declaration#!", Enode);
when Subtype_Conformant =>
Error_Msg_N
("not subtype conformant with declaration#!", Enode);
when Fully_Conformant =>
Error_Msg_N
("not fully conformant with declaration#!", Enode);
end case;
Error_Msg_NE (Msg, Enode, N);
end if;
end Conformance_Error;
-- Start of processing for Check_Conformance
begin
Conforms := True;
-- We need a special case for operators, since they don't appear
-- explicitly.
if Ctype = Type_Conformant then
if Ekind (New_Id) = E_Operator
and then Operator_Matches_Spec (New_Id, Old_Id)
then
return;
end if;
end if;
-- If both are functions/operators, check return types conform
if Old_Type /= Standard_Void_Type
and then New_Type /= Standard_Void_Type
then
if not Conforming_Types (Old_Type, New_Type, Ctype, Get_Inst) then
Conformance_Error ("return type does not match!", New_Id);
return;
end if;
-- Ada 2005 (AI-231): In case of anonymous access types check the
-- null-exclusion and access-to-constant attributes must match.
if Ada_Version >= Ada_05
and then Ekind (Etype (Old_Type)) = E_Anonymous_Access_Type
and then
(Can_Never_Be_Null (Old_Type)
/= Can_Never_Be_Null (New_Type)
or else Is_Access_Constant (Etype (Old_Type))
/= Is_Access_Constant (Etype (New_Type)))
then
Conformance_Error ("return type does not match!", New_Id);
return;
end if;
-- If either is a function/operator and the other isn't, error
elsif Old_Type /= Standard_Void_Type
or else New_Type /= Standard_Void_Type
then
Conformance_Error ("functions can only match functions!", New_Id);
return;
end if;
-- In subtype conformant case, conventions must match (RM 6.3.1(16))
-- If this is a renaming as body, refine error message to indicate that
-- the conflict is with the original declaration. If the entity is not
-- frozen, the conventions don't have to match, the one of the renamed
-- entity is inherited.
if Ctype >= Subtype_Conformant then
if Convention (Old_Id) /= Convention (New_Id) then
if not Is_Frozen (New_Id) then
null;
elsif Present (Err_Loc)
and then Nkind (Err_Loc) = N_Subprogram_Renaming_Declaration
and then Present (Corresponding_Spec (Err_Loc))
then
Error_Msg_Name_1 := Chars (New_Id);
Error_Msg_Name_2 :=
Name_Ada + Convention_Id'Pos (Convention (New_Id));
Conformance_Error ("prior declaration for% has convention %!");
else
Conformance_Error ("calling conventions do not match!");
end if;
return;
elsif Is_Formal_Subprogram (Old_Id)
or else Is_Formal_Subprogram (New_Id)
then
Conformance_Error ("formal subprograms not allowed!");
return;
end if;
end if;
-- Deal with parameters
-- Note: we use the entity information, rather than going directly
-- to the specification in the tree. This is not only simpler, but
-- absolutely necessary for some cases of conformance tests between
-- operators, where the declaration tree simply does not exist!
Old_Formal := First_Formal (Old_Id);
New_Formal := First_Formal (New_Id);
while Present (Old_Formal) and then Present (New_Formal) loop
if Is_Controlling_Formal (Old_Formal)
and then Is_Controlling_Formal (New_Formal)
and then Skip_Controlling_Formals
then
goto Skip_Controlling_Formal;
end if;
if Ctype = Fully_Conformant then
-- Names must match. Error message is more accurate if we do
-- this before checking that the types of the formals match.
if Chars (Old_Formal) /= Chars (New_Formal) then
Conformance_Error ("name & does not match!", New_Formal);
-- Set error posted flag on new formal as well to stop
-- junk cascaded messages in some cases.
Set_Error_Posted (New_Formal);
return;
end if;
end if;
-- Types must always match. In the visible part of an instance,
-- usual overloading rules for dispatching operations apply, and
-- we check base types (not the actual subtypes).
if In_Instance_Visible_Part
and then Is_Dispatching_Operation (New_Id)
then
if not Conforming_Types
(Base_Type (Etype (Old_Formal)),
Base_Type (Etype (New_Formal)), Ctype, Get_Inst)
then
Conformance_Error ("type of & does not match!", New_Formal);
return;
end if;
elsif not Conforming_Types
(Etype (Old_Formal), Etype (New_Formal), Ctype, Get_Inst)
then
Conformance_Error ("type of & does not match!", New_Formal);
return;
end if;
-- For mode conformance, mode must match
if Ctype >= Mode_Conformant
and then Parameter_Mode (Old_Formal) /= Parameter_Mode (New_Formal)
then
Conformance_Error ("mode of & does not match!", New_Formal);
return;
end if;
-- Full conformance checks
if Ctype = Fully_Conformant then
-- We have checked already that names match
if Parameter_Mode (Old_Formal) = E_In_Parameter then
-- Ada 2005 (AI-231): In case of anonymous access types check
-- the null-exclusion and access-to-constant attributes must
-- match.
if Ada_Version >= Ada_05
and then Ekind (Etype (Old_Formal)) = E_Anonymous_Access_Type
and then
(Can_Never_Be_Null (Old_Formal)
/= Can_Never_Be_Null (New_Formal)
or else Is_Access_Constant (Etype (Old_Formal))
/= Is_Access_Constant (Etype (New_Formal)))
then
-- It is allowed to omit the null-exclusion in case of
-- stream attribute subprograms
declare
TSS_Name : TSS_Name_Type;
begin
Get_Name_String (Chars (New_Id));
TSS_Name :=
TSS_Name_Type
(Name_Buffer
(Name_Len - TSS_Name'Length + 1 .. Name_Len));
if TSS_Name /= TSS_Stream_Read
and then TSS_Name /= TSS_Stream_Write
and then TSS_Name /= TSS_Stream_Input
and then TSS_Name /= TSS_Stream_Output
then
Conformance_Error
("type of & does not match!", New_Formal);
return;
end if;
end;
end if;
-- Check default expressions for in parameters
declare
NewD : constant Boolean :=
Present (Default_Value (New_Formal));
OldD : constant Boolean :=
Present (Default_Value (Old_Formal));
begin
if NewD or OldD then
-- The old default value has been analyzed because the
-- current full declaration will have frozen everything
-- before. The new default values have not been
-- analyzed, so analyze them now before we check for
-- conformance.
if NewD then
New_Scope (New_Id);
Analyze_Per_Use_Expression
(Default_Value (New_Formal), Etype (New_Formal));
End_Scope;
end if;
if not (NewD and OldD)
or else not Fully_Conformant_Expressions
(Default_Value (Old_Formal),
Default_Value (New_Formal))
then
Conformance_Error
("default expression for & does not match!",
New_Formal);
return;
end if;
end if;
end;
end if;
end if;
-- A couple of special checks for Ada 83 mode. These checks are
-- skipped if either entity is an operator in package Standard.
-- or if either old or new instance is not from the source program.
if Ada_Version = Ada_83
and then Sloc (Old_Id) > Standard_Location
and then Sloc (New_Id) > Standard_Location
and then Comes_From_Source (Old_Id)
and then Comes_From_Source (New_Id)
then
declare
Old_Param : constant Node_Id := Declaration_Node (Old_Formal);
New_Param : constant Node_Id := Declaration_Node (New_Formal);
begin
-- Explicit IN must be present or absent in both cases. This
-- test is required only in the full conformance case.
if In_Present (Old_Param) /= In_Present (New_Param)
and then Ctype = Fully_Conformant
then
Conformance_Error
("(Ada 83) IN must appear in both declarations",
New_Formal);
return;
end if;
-- Grouping (use of comma in param lists) must be the same
-- This is where we catch a misconformance like:
-- A,B : Integer
-- A : Integer; B : Integer
-- which are represented identically in the tree except
-- for the setting of the flags More_Ids and Prev_Ids.
if More_Ids (Old_Param) /= More_Ids (New_Param)
or else Prev_Ids (Old_Param) /= Prev_Ids (New_Param)
then
Conformance_Error
("grouping of & does not match!", New_Formal);
return;
end if;
end;
end if;
-- This label is required when skipping controlling formals
<<Skip_Controlling_Formal>>
Next_Formal (Old_Formal);
Next_Formal (New_Formal);
end loop;
if Present (Old_Formal) then
Conformance_Error ("too few parameters!");
return;
elsif Present (New_Formal) then
Conformance_Error ("too many parameters!", New_Formal);
return;
end if;
end Check_Conformance;
------------------------------
-- Check_Delayed_Subprogram --
------------------------------
procedure Check_Delayed_Subprogram (Designator : Entity_Id) is
F : Entity_Id;
procedure Possible_Freeze (T : Entity_Id);
-- T is the type of either a formal parameter or of the return type.
-- If T is not yet frozen and needs a delayed freeze, then the
-- subprogram itself must be delayed.
---------------------
-- Possible_Freeze --
---------------------
procedure Possible_Freeze (T : Entity_Id) is
begin
if Has_Delayed_Freeze (T)
and then not Is_Frozen (T)
then
Set_Has_Delayed_Freeze (Designator);
elsif Is_Access_Type (T)
and then Has_Delayed_Freeze (Designated_Type (T))
and then not Is_Frozen (Designated_Type (T))
then
Set_Has_Delayed_Freeze (Designator);
end if;
end Possible_Freeze;
-- Start of processing for Check_Delayed_Subprogram
begin
-- Never need to freeze abstract subprogram
if Is_Abstract (Designator) then
null;
else
-- Need delayed freeze if return type itself needs a delayed
-- freeze and is not yet frozen.
Possible_Freeze (Etype (Designator));
Possible_Freeze (Base_Type (Etype (Designator))); -- needed ???
-- Need delayed freeze if any of the formal types themselves need
-- a delayed freeze and are not yet frozen.
F := First_Formal (Designator);
while Present (F) loop
Possible_Freeze (Etype (F));
Possible_Freeze (Base_Type (Etype (F))); -- needed ???
Next_Formal (F);
end loop;
end if;
-- Mark functions that return by reference. Note that it cannot be
-- done for delayed_freeze subprograms because the underlying
-- returned type may not be known yet (for private types)
if not Has_Delayed_Freeze (Designator)
and then Expander_Active
then
declare
Typ : constant Entity_Id := Etype (Designator);
Utyp : constant Entity_Id := Underlying_Type (Typ);
begin
if Is_Return_By_Reference_Type (Typ) then
Set_Returns_By_Ref (Designator);
elsif Present (Utyp) and then Controlled_Type (Utyp) then
Set_Returns_By_Ref (Designator);
end if;
end;
end if;
end Check_Delayed_Subprogram;
------------------------------------
-- Check_Discriminant_Conformance --
------------------------------------
procedure Check_Discriminant_Conformance
(N : Node_Id;
Prev : Entity_Id;
Prev_Loc : Node_Id)
is
Old_Discr : Entity_Id := First_Discriminant (Prev);
New_Discr : Node_Id := First (Discriminant_Specifications (N));
New_Discr_Id : Entity_Id;
New_Discr_Type : Entity_Id;
procedure Conformance_Error (Msg : String; N : Node_Id);
-- Post error message for conformance error on given node. Two messages
-- are output. The first points to the previous declaration with a
-- general "no conformance" message. The second is the detailed reason,
-- supplied as Msg. The parameter N provide information for a possible
-- & insertion in the message.
-----------------------
-- Conformance_Error --
-----------------------
procedure Conformance_Error (Msg : String; N : Node_Id) is
begin
Error_Msg_Sloc := Sloc (Prev_Loc);
Error_Msg_N ("not fully conformant with declaration#!", N);
Error_Msg_NE (Msg, N, N);
end Conformance_Error;
-- Start of processing for Check_Discriminant_Conformance
begin
while Present (Old_Discr) and then Present (New_Discr) loop
New_Discr_Id := Defining_Identifier (New_Discr);
-- The subtype mark of the discriminant on the full type has not
-- been analyzed so we do it here. For an access discriminant a new
-- type is created.
if Nkind (Discriminant_Type (New_Discr)) = N_Access_Definition then
New_Discr_Type :=
Access_Definition (N, Discriminant_Type (New_Discr));
else
Analyze (Discriminant_Type (New_Discr));
New_Discr_Type := Etype (Discriminant_Type (New_Discr));
end if;
if not Conforming_Types
(Etype (Old_Discr), New_Discr_Type, Fully_Conformant)
then
Conformance_Error ("type of & does not match!", New_Discr_Id);
return;
else
-- Treat the new discriminant as an occurrence of the old one,
-- for navigation purposes, and fill in some semantic
-- information, for completeness.
Generate_Reference (Old_Discr, New_Discr_Id, 'r');
Set_Etype (New_Discr_Id, Etype (Old_Discr));
Set_Scope (New_Discr_Id, Scope (Old_Discr));
end if;
-- Names must match
if Chars (Old_Discr) /= Chars (Defining_Identifier (New_Discr)) then
Conformance_Error ("name & does not match!", New_Discr_Id);
return;
end if;
-- Default expressions must match
declare
NewD : constant Boolean :=
Present (Expression (New_Discr));
OldD : constant Boolean :=
Present (Expression (Parent (Old_Discr)));
begin
if NewD or OldD then
-- The old default value has been analyzed and expanded,
-- because the current full declaration will have frozen
-- everything before. The new default values have not been
-- expanded, so expand now to check conformance.
if NewD then
Analyze_Per_Use_Expression
(Expression (New_Discr), New_Discr_Type);
end if;
if not (NewD and OldD)
or else not Fully_Conformant_Expressions
(Expression (Parent (Old_Discr)),
Expression (New_Discr))
then
Conformance_Error
("default expression for & does not match!",
New_Discr_Id);
return;
end if;
end if;
end;
-- In Ada 83 case, grouping must match: (A,B : X) /= (A : X; B : X)
if Ada_Version = Ada_83 then
declare
Old_Disc : constant Node_Id := Declaration_Node (Old_Discr);
begin
-- Grouping (use of comma in param lists) must be the same
-- This is where we catch a misconformance like:
-- A,B : Integer
-- A : Integer; B : Integer
-- which are represented identically in the tree except
-- for the setting of the flags More_Ids and Prev_Ids.
if More_Ids (Old_Disc) /= More_Ids (New_Discr)
or else Prev_Ids (Old_Disc) /= Prev_Ids (New_Discr)
then
Conformance_Error
("grouping of & does not match!", New_Discr_Id);
return;
end if;
end;
end if;
Next_Discriminant (Old_Discr);
Next (New_Discr);
end loop;
if Present (Old_Discr) then
Conformance_Error ("too few discriminants!", Defining_Identifier (N));
return;
elsif Present (New_Discr) then
Conformance_Error
("too many discriminants!", Defining_Identifier (New_Discr));
return;
end if;
end Check_Discriminant_Conformance;
----------------------------
-- Check_Fully_Conformant --
----------------------------
procedure Check_Fully_Conformant
(New_Id : Entity_Id;
Old_Id : Entity_Id;
Err_Loc : Node_Id := Empty)
is
Result : Boolean;
-- LLVM local
pragma Warnings (Off, Result);
begin
Check_Conformance
(New_Id, Old_Id, Fully_Conformant, True, Result, Err_Loc);
end Check_Fully_Conformant;
---------------------------
-- Check_Mode_Conformant --
---------------------------
procedure Check_Mode_Conformant
(New_Id : Entity_Id;
Old_Id : Entity_Id;
Err_Loc : Node_Id := Empty;
Get_Inst : Boolean := False)
is
Result : Boolean;
-- LLVM local
pragma Warnings (Off, Result);
begin
Check_Conformance
(New_Id, Old_Id, Mode_Conformant, True, Result, Err_Loc, Get_Inst);
end Check_Mode_Conformant;
--------------------------------
-- Check_Overriding_Indicator --
--------------------------------
procedure Check_Overriding_Indicator
(Subp : Entity_Id;
Does_Override : Boolean)
is
Decl : Node_Id;
Spec : Node_Id;
begin
if Ekind (Subp) = E_Enumeration_Literal then
-- No overriding indicator for literals
return;
else
Decl := Unit_Declaration_Node (Subp);
end if;
if Nkind (Decl) = N_Subprogram_Declaration
or else Nkind (Decl) = N_Subprogram_Body
or else Nkind (Decl) = N_Subprogram_Renaming_Declaration
or else Nkind (Decl) = N_Subprogram_Body_Stub
then
Spec := Specification (Decl);
else
return;
end if;
if not Does_Override then
if Must_Override (Spec) then
Error_Msg_NE ("subprogram& is not overriding", Spec, Subp);
end if;
else
if Must_Not_Override (Spec) then
Error_Msg_NE
("subprogram& overrides inherited operation", Spec, Subp);
end if;
end if;
end Check_Overriding_Indicator;
-------------------
-- Check_Returns --
-------------------
procedure Check_Returns
(HSS : Node_Id;
Mode : Character;
Err : out Boolean;
Proc : Entity_Id := Empty)
is
Handler : Node_Id;
procedure Check_Statement_Sequence (L : List_Id);
-- Internal recursive procedure to check a list of statements for proper
-- termination by a return statement (or a transfer of control or a
-- compound statement that is itself internally properly terminated).
------------------------------
-- Check_Statement_Sequence --
------------------------------
procedure Check_Statement_Sequence (L : List_Id) is
Last_Stm : Node_Id;
Kind : Node_Kind;
Raise_Exception_Call : Boolean;
-- Set True if statement sequence terminated by Raise_Exception call
-- or a Reraise_Occurrence call.
begin
Raise_Exception_Call := False;
-- Get last real statement
Last_Stm := Last (L);
-- Don't count pragmas
while Nkind (Last_Stm) = N_Pragma
-- Don't count call to SS_Release (can happen after Raise_Exception)
or else
(Nkind (Last_Stm) = N_Procedure_Call_Statement
and then
Nkind (Name (Last_Stm)) = N_Identifier
and then
Is_RTE (Entity (Name (Last_Stm)), RE_SS_Release))
-- Don't count exception junk
or else
((Nkind (Last_Stm) = N_Goto_Statement
or else Nkind (Last_Stm) = N_Label
or else Nkind (Last_Stm) = N_Object_Declaration)
and then Exception_Junk (Last_Stm))
loop
Prev (Last_Stm);
end loop;
-- Here we have the "real" last statement
Kind := Nkind (Last_Stm);
-- Transfer of control, OK. Note that in the No_Return procedure
-- case, we already diagnosed any explicit return statements, so
-- we can treat them as OK in this context.
if Is_Transfer (Last_Stm) then
return;
-- Check cases of explicit non-indirect procedure calls
elsif Kind = N_Procedure_Call_Statement
and then Is_Entity_Name (Name (Last_Stm))
then
-- Check call to Raise_Exception procedure which is treated
-- specially, as is a call to Reraise_Occurrence.
-- We suppress the warning in these cases since it is likely that
-- the programmer really does not expect to deal with the case
-- of Null_Occurrence, and thus would find a warning about a
-- missing return curious, and raising Program_Error does not
-- seem such a bad behavior if this does occur.
-- Note that in the Ada 2005 case for Raise_Exception, the actual
-- behavior will be to raise Constraint_Error (see AI-329).
if Is_RTE (Entity (Name (Last_Stm)), RE_Raise_Exception)
or else
Is_RTE (Entity (Name (Last_Stm)), RE_Reraise_Occurrence)
then
Raise_Exception_Call := True;
-- For Raise_Exception call, test first argument, if it is
-- an attribute reference for a 'Identity call, then we know
-- that the call cannot possibly return.
declare
Arg : constant Node_Id :=
Original_Node (First_Actual (Last_Stm));
begin
if Nkind (Arg) = N_Attribute_Reference
and then Attribute_Name (Arg) = Name_Identity
then
return;
end if;
end;
end if;
-- If statement, need to look inside if there is an else and check
-- each constituent statement sequence for proper termination.
elsif Kind = N_If_Statement
and then Present (Else_Statements (Last_Stm))
then
Check_Statement_Sequence (Then_Statements (Last_Stm));
Check_Statement_Sequence (Else_Statements (Last_Stm));
if Present (Elsif_Parts (Last_Stm)) then
declare
Elsif_Part : Node_Id := First (Elsif_Parts (Last_Stm));
begin
while Present (Elsif_Part) loop
Check_Statement_Sequence (Then_Statements (Elsif_Part));
Next (Elsif_Part);
end loop;
end;
end if;
return;
-- Case statement, check each case for proper termination
elsif Kind = N_Case_Statement then
declare
Case_Alt : Node_Id;
begin
Case_Alt := First_Non_Pragma (Alternatives (Last_Stm));
while Present (Case_Alt) loop
Check_Statement_Sequence (Statements (Case_Alt));
Next_Non_Pragma (Case_Alt);
end loop;
end;
return;
-- Block statement, check its handled sequence of statements
elsif Kind = N_Block_Statement then
declare
Err1 : Boolean;
begin
Check_Returns
(Handled_Statement_Sequence (Last_Stm), Mode, Err1);
if Err1 then
Err := True;
end if;
return;
end;
-- Loop statement. If there is an iteration scheme, we can definitely
-- fall out of the loop. Similarly if there is an exit statement, we
-- can fall out. In either case we need a following return.
elsif Kind = N_Loop_Statement then
if Present (Iteration_Scheme (Last_Stm))
or else Has_Exit (Entity (Identifier (Last_Stm)))
then
null;
-- A loop with no exit statement or iteration scheme if either
-- an inifite loop, or it has some other exit (raise/return).
-- In either case, no warning is required.
else
return;
end if;
-- Timed entry call, check entry call and delay alternatives
-- Note: in expanded code, the timed entry call has been converted
-- to a set of expanded statements on which the check will work
-- correctly in any case.
elsif Kind = N_Timed_Entry_Call then
declare
ECA : constant Node_Id := Entry_Call_Alternative (Last_Stm);
DCA : constant Node_Id := Delay_Alternative (Last_Stm);
begin
-- If statement sequence of entry call alternative is missing,
-- then we can definitely fall through, and we post the error
-- message on the entry call alternative itself.
if No (Statements (ECA)) then
Last_Stm := ECA;
-- If statement sequence of delay alternative is missing, then
-- we can definitely fall through, and we post the error
-- message on the delay alternative itself.
-- Note: if both ECA and DCA are missing the return, then we
-- post only one message, should be enough to fix the bugs.
-- If not we will get a message next time on the DCA when the
-- ECA is fixed!
elsif No (Statements (DCA)) then
Last_Stm := DCA;
-- Else check both statement sequences
else
Check_Statement_Sequence (Statements (ECA));
Check_Statement_Sequence (Statements (DCA));
return;
end if;
end;
-- Conditional entry call, check entry call and else part
-- Note: in expanded code, the conditional entry call has been
-- converted to a set of expanded statements on which the check
-- will work correctly in any case.
elsif Kind = N_Conditional_Entry_Call then
declare
ECA : constant Node_Id := Entry_Call_Alternative (Last_Stm);
begin
-- If statement sequence of entry call alternative is missing,
-- then we can definitely fall through, and we post the error
-- message on the entry call alternative itself.
if No (Statements (ECA)) then
Last_Stm := ECA;
-- Else check statement sequence and else part
else
Check_Statement_Sequence (Statements (ECA));
Check_Statement_Sequence (Else_Statements (Last_Stm));
return;
end if;
end;
end if;
-- If we fall through, issue appropriate message
if Mode = 'F' then
if not Raise_Exception_Call then
Error_Msg_N
("?RETURN statement missing following this statement",
Last_Stm);
Error_Msg_N
("\?Program_Error may be raised at run time",
Last_Stm);
end if;
-- Note: we set Err even though we have not issued a warning
-- because we still have a case of a missing return. This is
-- an extremely marginal case, probably will never be noticed
-- but we might as well get it right.
Err := True;
-- Otherwise we have the case of a procedure marked No_Return
else
Error_Msg_N
("?implied return after this statement will raise Program_Error",
Last_Stm);
Error_Msg_NE
("?procedure & is marked as No_Return",
Last_Stm, Proc);
declare
RE : constant Node_Id :=
Make_Raise_Program_Error (Sloc (Last_Stm),
Reason => PE_Implicit_Return);
begin
Insert_After (Last_Stm, RE);
Analyze (RE);
end;
end if;
end Check_Statement_Sequence;
-- Start of processing for Check_Returns
begin
Err := False;
Check_Statement_Sequence (Statements (HSS));
if Present (Exception_Handlers (HSS)) then
Handler := First_Non_Pragma (Exception_Handlers (HSS));
while Present (Handler) loop
Check_Statement_Sequence (Statements (Handler));
Next_Non_Pragma (Handler);
end loop;
end if;
end Check_Returns;
----------------------------
-- Check_Subprogram_Order --
----------------------------
procedure Check_Subprogram_Order (N : Node_Id) is
function Subprogram_Name_Greater (S1, S2 : String) return Boolean;
-- This is used to check if S1 > S2 in the sense required by this
-- test, for example nameab < namec, but name2 < name10.
-----------------------------
-- Subprogram_Name_Greater --
-----------------------------
function Subprogram_Name_Greater (S1, S2 : String) return Boolean is
L1, L2 : Positive;
N1, N2 : Natural;
begin
-- Remove trailing numeric parts
L1 := S1'Last;
while S1 (L1) in '0' .. '9' loop
L1 := L1 - 1;
end loop;
L2 := S2'Last;
while S2 (L2) in '0' .. '9' loop
L2 := L2 - 1;
end loop;
-- If non-numeric parts non-equal, that's decisive
if S1 (S1'First .. L1) < S2 (S2'First .. L2) then
return False;
elsif S1 (S1'First .. L1) > S2 (S2'First .. L2) then
return True;
-- If non-numeric parts equal, compare suffixed numeric parts. Note
-- that a missing suffix is treated as numeric zero in this test.
else
N1 := 0;
while L1 < S1'Last loop
L1 := L1 + 1;
N1 := N1 * 10 + Character'Pos (S1 (L1)) - Character'Pos ('0');
end loop;
N2 := 0;
while L2 < S2'Last loop
L2 := L2 + 1;
N2 := N2 * 10 + Character'Pos (S2 (L2)) - Character'Pos ('0');
end loop;
return N1 > N2;
end if;
end Subprogram_Name_Greater;
-- Start of processing for Check_Subprogram_Order
begin
-- Check body in alpha order if this is option
if Style_Check
and then Style_Check_Order_Subprograms
and then Nkind (N) = N_Subprogram_Body
and then Comes_From_Source (N)
and then In_Extended_Main_Source_Unit (N)
then
declare
LSN : String_Ptr
renames Scope_Stack.Table
(Scope_Stack.Last).Last_Subprogram_Name;
Body_Id : constant Entity_Id :=
Defining_Entity (Specification (N));
begin
Get_Decoded_Name_String (Chars (Body_Id));
if LSN /= null then
if Subprogram_Name_Greater
(LSN.all, Name_Buffer (1 .. Name_Len))
then
Style.Subprogram_Not_In_Alpha_Order (Body_Id);
end if;
Free (LSN);
end if;
LSN := new String'(Name_Buffer (1 .. Name_Len));
end;
end if;
end Check_Subprogram_Order;
------------------------------
-- Check_Subtype_Conformant --
------------------------------
procedure Check_Subtype_Conformant
(New_Id : Entity_Id;
Old_Id : Entity_Id;
Err_Loc : Node_Id := Empty)
is
Result : Boolean;
-- LLVM local
pragma Warnings (Off, Result);
begin
Check_Conformance
(New_Id, Old_Id, Subtype_Conformant, True, Result, Err_Loc);
end Check_Subtype_Conformant;
---------------------------
-- Check_Type_Conformant --
---------------------------
procedure Check_Type_Conformant
(New_Id : Entity_Id;
Old_Id : Entity_Id;
Err_Loc : Node_Id := Empty)
is
Result : Boolean;
-- LLVM local
pragma Warnings (Off, Result);
begin
Check_Conformance
(New_Id, Old_Id, Type_Conformant, True, Result, Err_Loc);
end Check_Type_Conformant;
----------------------
-- Conforming_Types --
----------------------
function Conforming_Types
(T1 : Entity_Id;
T2 : Entity_Id;
Ctype : Conformance_Type;
Get_Inst : Boolean := False) return Boolean
is
Type_1 : Entity_Id := T1;
Type_2 : Entity_Id := T2;
Are_Anonymous_Access_To_Subprogram_Types : Boolean := False;
function Base_Types_Match (T1, T2 : Entity_Id) return Boolean;
-- If neither T1 nor T2 are generic actual types, or if they are
-- in different scopes (e.g. parent and child instances), then verify
-- that the base types are equal. Otherwise T1 and T2 must be
-- on the same subtype chain. The whole purpose of this procedure
-- is to prevent spurious ambiguities in an instantiation that may
-- arise if two distinct generic types are instantiated with the
-- same actual.
----------------------
-- Base_Types_Match --
----------------------
function Base_Types_Match (T1, T2 : Entity_Id) return Boolean is
begin
if T1 = T2 then
return True;
elsif Base_Type (T1) = Base_Type (T2) then
-- The following is too permissive. A more precise test must
-- check that the generic actual is an ancestor subtype of the
-- other ???.
return not Is_Generic_Actual_Type (T1)
or else not Is_Generic_Actual_Type (T2)
or else Scope (T1) /= Scope (T2);
-- In some cases a type imported through a limited_with clause,
-- and its non-limited view are both visible, for example in an
-- anonymous access_to_classwide type in a formal. Both entities
-- designate the same type.
elsif From_With_Type (T1)
and then Ekind (T1) = E_Incomplete_Type
and then T2 = Non_Limited_View (T1)
then
return True;
elsif From_With_Type (T2)
and then Ekind (T2) = E_Incomplete_Type
and then T1 = Non_Limited_View (T2)
then
return True;
else
return False;
end if;
end Base_Types_Match;
-- Start of processing for Conforming_Types
begin
-- The context is an instance association for a formal
-- access-to-subprogram type; the formal parameter types require
-- mapping because they may denote other formal parameters of the
-- generic unit.
if Get_Inst then
Type_1 := Get_Instance_Of (T1);
Type_2 := Get_Instance_Of (T2);
end if;
-- First see if base types match
if Base_Types_Match (Type_1, Type_2) then
return Ctype <= Mode_Conformant
or else Subtypes_Statically_Match (Type_1, Type_2);
elsif Is_Incomplete_Or_Private_Type (Type_1)
and then Present (Full_View (Type_1))
and then Base_Types_Match (Full_View (Type_1), Type_2)
then
return Ctype <= Mode_Conformant
or else Subtypes_Statically_Match (Full_View (Type_1), Type_2);
elsif Ekind (Type_2) = E_Incomplete_Type
and then Present (Full_View (Type_2))
and then Base_Types_Match (Type_1, Full_View (Type_2))
then
return Ctype <= Mode_Conformant
or else Subtypes_Statically_Match (Type_1, Full_View (Type_2));
elsif Is_Private_Type (Type_2)
and then In_Instance
and then Present (Full_View (Type_2))
and then Base_Types_Match (Type_1, Full_View (Type_2))
then
return Ctype <= Mode_Conformant
or else Subtypes_Statically_Match (Type_1, Full_View (Type_2));
end if;
-- Ada 2005 (AI-254): Anonymous access to subprogram types must be
-- treated recursively because they carry a signature.
Are_Anonymous_Access_To_Subprogram_Types :=
-- Case 1: Anonymous access to subprogram types
(Ekind (Type_1) = E_Anonymous_Access_Subprogram_Type
and then Ekind (Type_2) = E_Anonymous_Access_Subprogram_Type)
-- Case 2: Anonymous access to PROTECTED subprogram types. In this
-- case the anonymous type_declaration has been replaced by an
-- occurrence of an internal access to subprogram type declaration
-- available through the Original_Access_Type attribute
or else
(Ekind (Type_1) = E_Access_Protected_Subprogram_Type
and then Ekind (Type_2) = E_Access_Protected_Subprogram_Type
and then not Comes_From_Source (Type_1)
and then not Comes_From_Source (Type_2)
and then Present (Original_Access_Type (Type_1))
and then Present (Original_Access_Type (Type_2))
and then Ekind (Original_Access_Type (Type_1)) =
E_Anonymous_Access_Protected_Subprogram_Type
and then Ekind (Original_Access_Type (Type_2)) =
E_Anonymous_Access_Protected_Subprogram_Type);
-- Test anonymous access type case. For this case, static subtype
-- matching is required for mode conformance (RM 6.3.1(15))
if (Ekind (Type_1) = E_Anonymous_Access_Type
and then Ekind (Type_2) = E_Anonymous_Access_Type)
or else Are_Anonymous_Access_To_Subprogram_Types -- Ada 2005 (AI-254)
then
declare
Desig_1 : Entity_Id;
Desig_2 : Entity_Id;
begin
Desig_1 := Directly_Designated_Type (Type_1);
-- An access parameter can designate an incomplete type
-- If the incomplete type is the limited view of a type
-- from a limited_with_clause, check whether the non-limited
-- view is available.
if Ekind (Desig_1) = E_Incomplete_Type then
if Present (Full_View (Desig_1)) then
Desig_1 := Full_View (Desig_1);
elsif Present (Non_Limited_View (Desig_1)) then
Desig_1 := Non_Limited_View (Desig_1);
end if;
end if;
Desig_2 := Directly_Designated_Type (Type_2);
if Ekind (Desig_2) = E_Incomplete_Type then
if Present (Full_View (Desig_2)) then
Desig_2 := Full_View (Desig_2);
elsif Present (Non_Limited_View (Desig_2)) then
Desig_2 := Non_Limited_View (Desig_2);
end if;
end if;
-- The context is an instance association for a formal
-- access-to-subprogram type; formal access parameter designated
-- types require mapping because they may denote other formal
-- parameters of the generic unit.
if Get_Inst then
Desig_1 := Get_Instance_Of (Desig_1);
Desig_2 := Get_Instance_Of (Desig_2);
end if;
-- It is possible for a Class_Wide_Type to be introduced for an
-- incomplete type, in which case there is a separate class_ wide
-- type for the full view. The types conform if their Etypes
-- conform, i.e. one may be the full view of the other. This can
-- only happen in the context of an access parameter, other uses
-- of an incomplete Class_Wide_Type are illegal.
if Is_Class_Wide_Type (Desig_1)
and then Is_Class_Wide_Type (Desig_2)
then
return
Conforming_Types
(Etype (Base_Type (Desig_1)),
Etype (Base_Type (Desig_2)), Ctype);
elsif Are_Anonymous_Access_To_Subprogram_Types then
if Ada_Version < Ada_05 then
return Ctype = Type_Conformant
or else
Subtypes_Statically_Match (Desig_1, Desig_2);
-- We must check the conformance of the signatures themselves
else
declare
Conformant : Boolean;
begin
Check_Conformance
(Desig_1, Desig_2, Ctype, False, Conformant);
return Conformant;
end;
end if;
else
return Base_Type (Desig_1) = Base_Type (Desig_2)
and then (Ctype = Type_Conformant
or else
Subtypes_Statically_Match (Desig_1, Desig_2));
end if;
end;
-- Otherwise definitely no match
else
if ((Ekind (Type_1) = E_Anonymous_Access_Type
and then Is_Access_Type (Type_2))
or else (Ekind (Type_2) = E_Anonymous_Access_Type
and then Is_Access_Type (Type_1)))
and then
Conforming_Types
(Designated_Type (Type_1), Designated_Type (Type_2), Ctype)
then
May_Hide_Profile := True;
end if;
return False;
end if;
end Conforming_Types;
--------------------------
-- Create_Extra_Formals --
--------------------------
procedure Create_Extra_Formals (E : Entity_Id) is
Formal : Entity_Id;
Last_Extra : Entity_Id;
Formal_Type : Entity_Id;
P_Formal : Entity_Id := Empty;
function Add_Extra_Formal (Typ : Entity_Id) return Entity_Id;
-- Add an extra formal, associated with the current Formal. The extra
-- formal is added to the list of extra formals, and also returned as
-- the result. These formals are always of mode IN.
----------------------
-- Add_Extra_Formal --
----------------------
function Add_Extra_Formal (Typ : Entity_Id) return Entity_Id is
EF : constant Entity_Id :=
Make_Defining_Identifier (Sloc (Formal),
Chars => New_External_Name (Chars (Formal), 'F'));
begin
-- We never generate extra formals if expansion is not active
-- because we don't need them unless we are generating code.
if not Expander_Active then
return Empty;
end if;
-- A little optimization. Never generate an extra formal for the
-- _init operand of an initialization procedure, since it could
-- never be used.
if Chars (Formal) = Name_uInit then
return Empty;
end if;
Set_Ekind (EF, E_In_Parameter);
Set_Actual_Subtype (EF, Typ);
Set_Etype (EF, Typ);
Set_Scope (EF, Scope (Formal));
Set_Mechanism (EF, Default_Mechanism);
Set_Formal_Validity (EF);
Set_Extra_Formal (Last_Extra, EF);
Last_Extra := EF;
return EF;
end Add_Extra_Formal;
-- Start of processing for Create_Extra_Formals
begin
-- If this is a derived subprogram then the subtypes of the parent
-- subprogram's formal parameters will be used to to determine the need
-- for extra formals.
if Is_Overloadable (E) and then Present (Alias (E)) then
P_Formal := First_Formal (Alias (E));
end if;
Last_Extra := Empty;
Formal := First_Formal (E);
while Present (Formal) loop
Last_Extra := Formal;
Next_Formal (Formal);
end loop;
-- If Extra_formals where already created, don't do it again. This
-- situation may arise for subprogram types created as part of
-- dispatching calls (see Expand_Dispatching_Call)
if Present (Last_Extra) and then
Present (Extra_Formal (Last_Extra))
then
return;
end if;
Formal := First_Formal (E);
while Present (Formal) loop
-- Create extra formal for supporting the attribute 'Constrained.
-- The case of a private type view without discriminants also
-- requires the extra formal if the underlying type has defaulted
-- discriminants.
if Ekind (Formal) /= E_In_Parameter then
if Present (P_Formal) then
Formal_Type := Etype (P_Formal);
else
Formal_Type := Etype (Formal);
end if;
-- Do not produce extra formals for Unchecked_Union parameters.
-- Jump directly to the end of the loop.
if Is_Unchecked_Union (Base_Type (Formal_Type)) then
goto Skip_Extra_Formal_Generation;
end if;
if not Has_Discriminants (Formal_Type)
and then Ekind (Formal_Type) in Private_Kind
and then Present (Underlying_Type (Formal_Type))
then
Formal_Type := Underlying_Type (Formal_Type);
end if;
if Has_Discriminants (Formal_Type)
and then
((not Is_Constrained (Formal_Type)
and then not Is_Indefinite_Subtype (Formal_Type))
or else Present (Extra_Formal (Formal)))
then
Set_Extra_Constrained
(Formal, Add_Extra_Formal (Standard_Boolean));
end if;
end if;
-- Create extra formal for supporting accessibility checking
-- This is suppressed if we specifically suppress accessibility
-- checks at the pacage level for either the subprogram, or the
-- package in which it resides. However, we do not suppress it
-- simply if the scope has accessibility checks suppressed, since
-- this could cause trouble when clients are compiled with a
-- different suppression setting. The explicit checks at the
-- package level are safe from this point of view.
if Ekind (Etype (Formal)) = E_Anonymous_Access_Type
and then not
(Explicit_Suppress (E, Accessibility_Check)
or else
Explicit_Suppress (Scope (E), Accessibility_Check))
and then
(No (P_Formal)
or else Present (Extra_Accessibility (P_Formal)))
then
-- Temporary kludge: for now we avoid creating the extra formal
-- for access parameters of protected operations because of
-- problem with the case of internal protected calls. ???
if Nkind (Parent (Parent (Parent (E)))) /= N_Protected_Definition
and then Nkind (Parent (Parent (Parent (E)))) /= N_Protected_Body
then
Set_Extra_Accessibility
(Formal, Add_Extra_Formal (Standard_Natural));
end if;
end if;
if Present (P_Formal) then
Next_Formal (P_Formal);
end if;
-- This label is required when skipping extra formal generation for
-- Unchecked_Union parameters.
<<Skip_Extra_Formal_Generation>>
Next_Formal (Formal);
end loop;
end Create_Extra_Formals;
-----------------------------
-- Enter_Overloaded_Entity --
-----------------------------
procedure Enter_Overloaded_Entity (S : Entity_Id) is
E : Entity_Id := Current_Entity_In_Scope (S);
C_E : Entity_Id := Current_Entity (S);
begin
if Present (E) then
Set_Has_Homonym (E);
Set_Has_Homonym (S);
end if;
Set_Is_Immediately_Visible (S);
Set_Scope (S, Current_Scope);
-- Chain new entity if front of homonym in current scope, so that
-- homonyms are contiguous.
if Present (E)
and then E /= C_E
then
while Homonym (C_E) /= E loop
C_E := Homonym (C_E);
end loop;
Set_Homonym (C_E, S);
else
E := C_E;
Set_Current_Entity (S);
end if;
Set_Homonym (S, E);
Append_Entity (S, Current_Scope);
Set_Public_Status (S);
if Debug_Flag_E then
Write_Str ("New overloaded entity chain: ");
Write_Name (Chars (S));
E := S;
while Present (E) loop
Write_Str (" "); Write_Int (Int (E));
E := Homonym (E);
end loop;
Write_Eol;
end if;
-- Generate warning for hiding
if Warn_On_Hiding
and then Comes_From_Source (S)
and then In_Extended_Main_Source_Unit (S)
then
E := S;
loop
E := Homonym (E);
exit when No (E);
-- Warn unless genuine overloading
if (not Is_Overloadable (E))
or else Subtype_Conformant (E, S)
then
Error_Msg_Sloc := Sloc (E);
Error_Msg_N ("declaration of & hides one#?", S);
end if;
end loop;
end if;
end Enter_Overloaded_Entity;
-----------------------------
-- Find_Corresponding_Spec --
-----------------------------
function Find_Corresponding_Spec (N : Node_Id) return Entity_Id is
Spec : constant Node_Id := Specification (N);
Designator : constant Entity_Id := Defining_Entity (Spec);
E : Entity_Id;
begin
E := Current_Entity (Designator);
while Present (E) loop
-- We are looking for a matching spec. It must have the same scope,
-- and the same name, and either be type conformant, or be the case
-- of a library procedure spec and its body (which belong to one
-- another regardless of whether they are type conformant or not).
if Scope (E) = Current_Scope then
if Current_Scope = Standard_Standard
or else (Ekind (E) = Ekind (Designator)
and then Type_Conformant (E, Designator))
then
-- Within an instantiation, we know that spec and body are
-- subtype conformant, because they were subtype conformant
-- in the generic. We choose the subtype-conformant entity
-- here as well, to resolve spurious ambiguities in the
-- instance that were not present in the generic (i.e. when
-- two different types are given the same actual). If we are
-- looking for a spec to match a body, full conformance is
-- expected.
if In_Instance then
Set_Convention (Designator, Convention (E));
if Nkind (N) = N_Subprogram_Body
and then Present (Homonym (E))
and then not Fully_Conformant (E, Designator)
then
goto Next_Entity;
elsif not Subtype_Conformant (E, Designator) then
goto Next_Entity;
end if;
end if;
if not Has_Completion (E) then
if Nkind (N) /= N_Subprogram_Body_Stub then
Set_Corresponding_Spec (N, E);
end if;
Set_Has_Completion (E);
return E;
elsif Nkind (Parent (N)) = N_Subunit then
-- If this is the proper body of a subunit, the completion
-- flag is set when analyzing the stub.
return E;
-- If body already exists, this is an error unless the
-- previous declaration is the implicit declaration of
-- a derived subprogram, or this is a spurious overloading
-- in an instance.
elsif No (Alias (E))
and then not Is_Intrinsic_Subprogram (E)
and then not In_Instance
then
Error_Msg_Sloc := Sloc (E);
if Is_Imported (E) then
Error_Msg_NE
("body not allowed for imported subprogram & declared#",
N, E);
else
Error_Msg_NE ("duplicate body for & declared#", N, E);
end if;
end if;
elsif Is_Child_Unit (E)
and then
Nkind (Unit_Declaration_Node (Designator)) = N_Subprogram_Body
and then
Nkind (Parent (Unit_Declaration_Node (Designator)))
= N_Compilation_Unit
then
-- Child units cannot be overloaded, so a conformance mismatch
-- between body and a previous spec is an error.
Error_Msg_N
("body of child unit does not match previous declaration", N);
end if;
end if;
<<Next_Entity>>
E := Homonym (E);
end loop;
-- On exit, we know that no previous declaration of subprogram exists
return Empty;
end Find_Corresponding_Spec;
----------------------
-- Fully_Conformant --
----------------------
function Fully_Conformant (New_Id, Old_Id : Entity_Id) return Boolean is
Result : Boolean;
begin
Check_Conformance (New_Id, Old_Id, Fully_Conformant, False, Result);
return Result;
end Fully_Conformant;
----------------------------------
-- Fully_Conformant_Expressions --
----------------------------------
function Fully_Conformant_Expressions
(Given_E1 : Node_Id;
Given_E2 : Node_Id) return Boolean
is
E1 : constant Node_Id := Original_Node (Given_E1);
E2 : constant Node_Id := Original_Node (Given_E2);
-- We always test conformance on original nodes, since it is possible
-- for analysis and/or expansion to make things look as though they
-- conform when they do not, e.g. by converting 1+2 into 3.
function FCE (Given_E1, Given_E2 : Node_Id) return Boolean
renames Fully_Conformant_Expressions;
function FCL (L1, L2 : List_Id) return Boolean;
-- Compare elements of two lists for conformance. Elements have to
-- be conformant, and actuals inserted as default parameters do not
-- match explicit actuals with the same value.
function FCO (Op_Node, Call_Node : Node_Id) return Boolean;
-- Compare an operator node with a function call
---------
-- FCL --
---------
function FCL (L1, L2 : List_Id) return Boolean is
N1, N2 : Node_Id;
begin
if L1 = No_List then
N1 := Empty;
else
N1 := First (L1);
end if;
if L2 = No_List then
N2 := Empty;
else
N2 := First (L2);
end if;
-- Compare two lists, skipping rewrite insertions (we want to
-- compare the original trees, not the expanded versions!)
loop
if Is_Rewrite_Insertion (N1) then
Next (N1);
elsif Is_Rewrite_Insertion (N2) then
Next (N2);
elsif No (N1) then
return No (N2);
elsif No (N2) then
return False;
elsif not FCE (N1, N2) then
return False;
else
Next (N1);
Next (N2);
end if;
end loop;
end FCL;
---------
-- FCO --
---------
function FCO (Op_Node, Call_Node : Node_Id) return Boolean is
Actuals : constant List_Id := Parameter_Associations (Call_Node);
Act : Node_Id;
begin
if No (Actuals)
or else Entity (Op_Node) /= Entity (Name (Call_Node))
then
return False;
else
Act := First (Actuals);
if Nkind (Op_Node) in N_Binary_Op then
if not FCE (Left_Opnd (Op_Node), Act) then
return False;
end if;
Next (Act);
end if;
return Present (Act)
and then FCE (Right_Opnd (Op_Node), Act)
and then No (Next (Act));
end if;
end FCO;
-- Start of processing for Fully_Conformant_Expressions
begin
-- Non-conformant if paren count does not match. Note: if some idiot
-- complains that we don't do this right for more than 3 levels of
-- parentheses, they will be treated with the respect they deserve :-)
if Paren_Count (E1) /= Paren_Count (E2) then
return False;
-- If same entities are referenced, then they are conformant even if
-- they have different forms (RM 8.3.1(19-20)).
elsif Is_Entity_Name (E1) and then Is_Entity_Name (E2) then
if Present (Entity (E1)) then
return Entity (E1) = Entity (E2)
or else (Chars (Entity (E1)) = Chars (Entity (E2))
and then Ekind (Entity (E1)) = E_Discriminant
and then Ekind (Entity (E2)) = E_In_Parameter);
elsif Nkind (E1) = N_Expanded_Name
and then Nkind (E2) = N_Expanded_Name
and then Nkind (Selector_Name (E1)) = N_Character_Literal
and then Nkind (Selector_Name (E2)) = N_Character_Literal
then
return Chars (Selector_Name (E1)) = Chars (Selector_Name (E2));
else
-- Identifiers in component associations don't always have
-- entities, but their names must conform.
return Nkind (E1) = N_Identifier
and then Nkind (E2) = N_Identifier
and then Chars (E1) = Chars (E2);
end if;
elsif Nkind (E1) = N_Character_Literal
and then Nkind (E2) = N_Expanded_Name
then
return Nkind (Selector_Name (E2)) = N_Character_Literal
and then Chars (E1) = Chars (Selector_Name (E2));
elsif Nkind (E2) = N_Character_Literal
and then Nkind (E1) = N_Expanded_Name
then
return Nkind (Selector_Name (E1)) = N_Character_Literal
and then Chars (E2) = Chars (Selector_Name (E1));
elsif Nkind (E1) in N_Op
and then Nkind (E2) = N_Function_Call
then
return FCO (E1, E2);
elsif Nkind (E2) in N_Op
and then Nkind (E1) = N_Function_Call
then
return FCO (E2, E1);
-- Otherwise we must have the same syntactic entity
elsif Nkind (E1) /= Nkind (E2) then
return False;
-- At this point, we specialize by node type
else
case Nkind (E1) is
when N_Aggregate =>
return
FCL (Expressions (E1), Expressions (E2))
and then FCL (Component_Associations (E1),
Component_Associations (E2));
when N_Allocator =>
if Nkind (Expression (E1)) = N_Qualified_Expression
or else
Nkind (Expression (E2)) = N_Qualified_Expression
then
return FCE (Expression (E1), Expression (E2));
-- Check that the subtype marks and any constraints
-- are conformant
else
declare
Indic1 : constant Node_Id := Expression (E1);
Indic2 : constant Node_Id := Expression (E2);
Elt1 : Node_Id;
Elt2 : Node_Id;
begin
if Nkind (Indic1) /= N_Subtype_Indication then
return
Nkind (Indic2) /= N_Subtype_Indication
and then Entity (Indic1) = Entity (Indic2);
elsif Nkind (Indic2) /= N_Subtype_Indication then
return
Nkind (Indic1) /= N_Subtype_Indication
and then Entity (Indic1) = Entity (Indic2);
else
if Entity (Subtype_Mark (Indic1)) /=
Entity (Subtype_Mark (Indic2))
then
return False;
end if;
Elt1 := First (Constraints (Constraint (Indic1)));
Elt2 := First (Constraints (Constraint (Indic2)));
while Present (Elt1) and then Present (Elt2) loop
if not FCE (Elt1, Elt2) then
return False;
end if;
Next (Elt1);
Next (Elt2);
end loop;
return True;
end if;
end;
end if;
when N_Attribute_Reference =>
return
Attribute_Name (E1) = Attribute_Name (E2)
and then FCL (Expressions (E1), Expressions (E2));
when N_Binary_Op =>
return
Entity (E1) = Entity (E2)
and then FCE (Left_Opnd (E1), Left_Opnd (E2))
and then FCE (Right_Opnd (E1), Right_Opnd (E2));
when N_And_Then | N_Or_Else | N_In | N_Not_In =>
return
FCE (Left_Opnd (E1), Left_Opnd (E2))
and then
FCE (Right_Opnd (E1), Right_Opnd (E2));
when N_Character_Literal =>
return
Char_Literal_Value (E1) = Char_Literal_Value (E2);
when N_Component_Association =>
return
FCL (Choices (E1), Choices (E2))
and then FCE (Expression (E1), Expression (E2));
when N_Conditional_Expression =>
return
FCL (Expressions (E1), Expressions (E2));
when N_Explicit_Dereference =>
return
FCE (Prefix (E1), Prefix (E2));
when N_Extension_Aggregate =>
return
FCL (Expressions (E1), Expressions (E2))
and then Null_Record_Present (E1) =
Null_Record_Present (E2)
and then FCL (Component_Associations (E1),
Component_Associations (E2));
when N_Function_Call =>
return
FCE (Name (E1), Name (E2))
and then FCL (Parameter_Associations (E1),
Parameter_Associations (E2));
when N_Indexed_Component =>
return
FCE (Prefix (E1), Prefix (E2))
and then FCL (Expressions (E1), Expressions (E2));
when N_Integer_Literal =>
return (Intval (E1) = Intval (E2));
when N_Null =>
return True;
when N_Operator_Symbol =>
return
Chars (E1) = Chars (E2);
when N_Others_Choice =>
return True;
when N_Parameter_Association =>
return
Chars (Selector_Name (E1)) = Chars (Selector_Name (E2))
and then FCE (Explicit_Actual_Parameter (E1),
Explicit_Actual_Parameter (E2));
when N_Qualified_Expression =>
return
FCE (Subtype_Mark (E1), Subtype_Mark (E2))
and then FCE (Expression (E1), Expression (E2));
when N_Range =>
return
FCE (Low_Bound (E1), Low_Bound (E2))
and then FCE (High_Bound (E1), High_Bound (E2));
when N_Real_Literal =>
return (Realval (E1) = Realval (E2));
when N_Selected_Component =>
return
FCE (Prefix (E1), Prefix (E2))
and then FCE (Selector_Name (E1), Selector_Name (E2));
when N_Slice =>
return
FCE (Prefix (E1), Prefix (E2))
and then FCE (Discrete_Range (E1), Discrete_Range (E2));
when N_String_Literal =>
declare
S1 : constant String_Id := Strval (E1);
S2 : constant String_Id := Strval (E2);
L1 : constant Nat := String_Length (S1);
L2 : constant Nat := String_Length (S2);
begin
if L1 /= L2 then
return False;
else
for J in 1 .. L1 loop
if Get_String_Char (S1, J) /=
Get_String_Char (S2, J)
then
return False;
end if;
end loop;
return True;
end if;
end;
when N_Type_Conversion =>
return
FCE (Subtype_Mark (E1), Subtype_Mark (E2))
and then FCE (Expression (E1), Expression (E2));
when N_Unary_Op =>
return
Entity (E1) = Entity (E2)
and then FCE (Right_Opnd (E1), Right_Opnd (E2));
when N_Unchecked_Type_Conversion =>
return
FCE (Subtype_Mark (E1), Subtype_Mark (E2))
and then FCE (Expression (E1), Expression (E2));
-- All other node types cannot appear in this context. Strictly
-- we should raise a fatal internal error. Instead we just ignore
-- the nodes. This means that if anyone makes a mistake in the
-- expander and mucks an expression tree irretrievably, the
-- result will be a failure to detect a (probably very obscure)
-- case of non-conformance, which is better than bombing on some
-- case where two expressions do in fact conform.
when others =>
return True;
end case;
end if;
end Fully_Conformant_Expressions;
----------------------------------------
-- Fully_Conformant_Discrete_Subtypes --
----------------------------------------
function Fully_Conformant_Discrete_Subtypes
(Given_S1 : Node_Id;
Given_S2 : Node_Id) return Boolean
is
S1 : constant Node_Id := Original_Node (Given_S1);
S2 : constant Node_Id := Original_Node (Given_S2);
function Conforming_Bounds (B1, B2 : Node_Id) return Boolean;
-- Special-case for a bound given by a discriminant, which in the body
-- is replaced with the discriminal of the enclosing type.
function Conforming_Ranges (R1, R2 : Node_Id) return Boolean;
-- Check both bounds
function Conforming_Bounds (B1, B2 : Node_Id) return Boolean is
begin
if Is_Entity_Name (B1)
and then Is_Entity_Name (B2)
and then Ekind (Entity (B1)) = E_Discriminant
then
return Chars (B1) = Chars (B2);
else
return Fully_Conformant_Expressions (B1, B2);
end if;
end Conforming_Bounds;
function Conforming_Ranges (R1, R2 : Node_Id) return Boolean is
begin
return
Conforming_Bounds (Low_Bound (R1), Low_Bound (R2))
and then
Conforming_Bounds (High_Bound (R1), High_Bound (R2));
end Conforming_Ranges;
-- Start of processing for Fully_Conformant_Discrete_Subtypes
begin
if Nkind (S1) /= Nkind (S2) then
return False;
elsif Is_Entity_Name (S1) then
return Entity (S1) = Entity (S2);
elsif Nkind (S1) = N_Range then
return Conforming_Ranges (S1, S2);
elsif Nkind (S1) = N_Subtype_Indication then
return
Entity (Subtype_Mark (S1)) = Entity (Subtype_Mark (S2))
and then
Conforming_Ranges
(Range_Expression (Constraint (S1)),
Range_Expression (Constraint (S2)));
else
return True;
end if;
end Fully_Conformant_Discrete_Subtypes;
--------------------
-- Install_Entity --
--------------------
procedure Install_Entity (E : Entity_Id) is
Prev : constant Entity_Id := Current_Entity (E);
begin
Set_Is_Immediately_Visible (E);
Set_Current_Entity (E);
Set_Homonym (E, Prev);
end Install_Entity;
---------------------
-- Install_Formals --
---------------------
procedure Install_Formals (Id : Entity_Id) is
F : Entity_Id;
begin
F := First_Formal (Id);
while Present (F) loop
Install_Entity (F);
Next_Formal (F);
end loop;
end Install_Formals;
---------------------------------
-- Is_Non_Overriding_Operation --
---------------------------------
function Is_Non_Overriding_Operation
(Prev_E : Entity_Id;
New_E : Entity_Id) return Boolean
is
Formal : Entity_Id;
F_Typ : Entity_Id;
G_Typ : Entity_Id := Empty;
function Get_Generic_Parent_Type (F_Typ : Entity_Id) return Entity_Id;
-- If F_Type is a derived type associated with a generic actual
-- subtype, then return its Generic_Parent_Type attribute, else return
-- Empty.
function Types_Correspond
(P_Type : Entity_Id;
N_Type : Entity_Id) return Boolean;
-- Returns true if and only if the types (or designated types in the
-- case of anonymous access types) are the same or N_Type is derived
-- directly or indirectly from P_Type.
-----------------------------
-- Get_Generic_Parent_Type --
-----------------------------
function Get_Generic_Parent_Type (F_Typ : Entity_Id) return Entity_Id is
G_Typ : Entity_Id;
Indic : Node_Id;
begin
if Is_Derived_Type (F_Typ)
and then Nkind (Parent (F_Typ)) = N_Full_Type_Declaration
then
-- The tree must be traversed to determine the parent subtype in
-- the generic unit, which unfortunately isn't always available
-- via semantic attributes. ??? (Note: The use of Original_Node
-- is needed for cases where a full derived type has been
-- rewritten.)
Indic := Subtype_Indication
(Type_Definition (Original_Node (Parent (F_Typ))));
if Nkind (Indic) = N_Subtype_Indication then
G_Typ := Entity (Subtype_Mark (Indic));
else
G_Typ := Entity (Indic);
end if;
if Nkind (Parent (G_Typ)) = N_Subtype_Declaration
and then Present (Generic_Parent_Type (Parent (G_Typ)))
then
return Generic_Parent_Type (Parent (G_Typ));
end if;
end if;
return Empty;
end Get_Generic_Parent_Type;
----------------------
-- Types_Correspond --
----------------------
function Types_Correspond
(P_Type : Entity_Id;
N_Type : Entity_Id) return Boolean
is
Prev_Type : Entity_Id := Base_Type (P_Type);
New_Type : Entity_Id := Base_Type (N_Type);
begin
if Ekind (Prev_Type) = E_Anonymous_Access_Type then
Prev_Type := Designated_Type (Prev_Type);
end if;
if Ekind (New_Type) = E_Anonymous_Access_Type then
New_Type := Designated_Type (New_Type);
end if;
if Prev_Type = New_Type then
return True;
elsif not Is_Class_Wide_Type (New_Type) then
while Etype (New_Type) /= New_Type loop
New_Type := Etype (New_Type);
if New_Type = Prev_Type then
return True;
end if;
end loop;
end if;
return False;
end Types_Correspond;
-- Start of processing for Is_Non_Overriding_Operation
begin
-- In the case where both operations are implicit derived subprograms
-- then neither overrides the other. This can only occur in certain
-- obscure cases (e.g., derivation from homographs created in a generic
-- instantiation).
if Present (Alias (Prev_E)) and then Present (Alias (New_E)) then
return True;
elsif Ekind (Current_Scope) = E_Package
and then Is_Generic_Instance (Current_Scope)
and then In_Private_Part (Current_Scope)
and then Comes_From_Source (New_E)
then
-- We examine the formals and result subtype of the inherited
-- operation, to determine whether their type is derived from (the
-- instance of) a generic type.
Formal := First_Formal (Prev_E);
while Present (Formal) loop
F_Typ := Base_Type (Etype (Formal));
if Ekind (F_Typ) = E_Anonymous_Access_Type then
F_Typ := Designated_Type (F_Typ);
end if;
G_Typ := Get_Generic_Parent_Type (F_Typ);
Next_Formal (Formal);
end loop;
if No (G_Typ) and then Ekind (Prev_E) = E_Function then
G_Typ := Get_Generic_Parent_Type (Base_Type (Etype (Prev_E)));
end if;
if No (G_Typ) then
return False;
end if;
-- If the generic type is a private type, then the original
-- operation was not overriding in the generic, because there was
-- no primitive operation to override.
if Nkind (Parent (G_Typ)) = N_Formal_Type_Declaration
and then Nkind (Formal_Type_Definition (Parent (G_Typ))) =
N_Formal_Private_Type_Definition
then
return True;
-- The generic parent type is the ancestor of a formal derived
-- type declaration. We need to check whether it has a primitive
-- operation that should be overridden by New_E in the generic.
else
declare
P_Formal : Entity_Id;
N_Formal : Entity_Id;
P_Typ : Entity_Id;
N_Typ : Entity_Id;
P_Prim : Entity_Id;
Prim_Elt : Elmt_Id := First_Elmt (Primitive_Operations (G_Typ));
begin
while Present (Prim_Elt) loop
P_Prim := Node (Prim_Elt);
if Chars (P_Prim) = Chars (New_E)
and then Ekind (P_Prim) = Ekind (New_E)
then
P_Formal := First_Formal (P_Prim);
N_Formal := First_Formal (New_E);
while Present (P_Formal) and then Present (N_Formal) loop
P_Typ := Etype (P_Formal);
N_Typ := Etype (N_Formal);
if not Types_Correspond (P_Typ, N_Typ) then
exit;
end if;
Next_Entity (P_Formal);
Next_Entity (N_Formal);
end loop;
-- Found a matching primitive operation belonging to the
-- formal ancestor type, so the new subprogram is
-- overriding.
if No (P_Formal)
and then No (N_Formal)
and then (Ekind (New_E) /= E_Function
or else
Types_Correspond
(Etype (P_Prim), Etype (New_E)))
then
return False;
end if;
end if;
Next_Elmt (Prim_Elt);
end loop;
-- If no match found, then the new subprogram does not
-- override in the generic (nor in the instance).
return True;
end;
end if;
else
return False;
end if;
end Is_Non_Overriding_Operation;
------------------------------
-- Make_Inequality_Operator --
------------------------------
-- S is the defining identifier of an equality operator. We build a
-- subprogram declaration with the right signature. This operation is
-- intrinsic, because it is always expanded as the negation of the
-- call to the equality function.
procedure Make_Inequality_Operator (S : Entity_Id) is
Loc : constant Source_Ptr := Sloc (S);
Decl : Node_Id;
Formals : List_Id;
Op_Name : Entity_Id;
FF : constant Entity_Id := First_Formal (S);
NF : constant Entity_Id := Next_Formal (FF);
begin
-- Check that equality was properly defined, ignore call if not
if No (NF) then
return;
end if;
declare
A : constant Entity_Id :=
Make_Defining_Identifier (Sloc (FF),
Chars => Chars (FF));
B : constant Entity_Id :=
Make_Defining_Identifier (Sloc (NF),
Chars => Chars (NF));
begin
Op_Name := Make_Defining_Operator_Symbol (Loc, Name_Op_Ne);
Formals := New_List (
Make_Parameter_Specification (Loc,
Defining_Identifier => A,
Parameter_Type =>
New_Reference_To (Etype (First_Formal (S)),
Sloc (Etype (First_Formal (S))))),
Make_Parameter_Specification (Loc,
Defining_Identifier => B,
Parameter_Type =>
New_Reference_To (Etype (Next_Formal (First_Formal (S))),
Sloc (Etype (Next_Formal (First_Formal (S)))))));
Decl :=
Make_Subprogram_Declaration (Loc,
Specification =>
Make_Function_Specification (Loc,
Defining_Unit_Name => Op_Name,
Parameter_Specifications => Formals,
Result_Definition =>
New_Reference_To (Standard_Boolean, Loc)));
-- Insert inequality right after equality if it is explicit or after
-- the derived type when implicit. These entities are created only
-- for visibility purposes, and eventually replaced in the course of
-- expansion, so they do not need to be attached to the tree and seen
-- by the back-end. Keeping them internal also avoids spurious
-- freezing problems. The declaration is inserted in the tree for
-- analysis, and removed afterwards. If the equality operator comes
-- from an explicit declaration, attach the inequality immediately
-- after. Else the equality is inherited from a derived type
-- declaration, so insert inequality after that declaration.
if No (Alias (S)) then
Insert_After (Unit_Declaration_Node (S), Decl);
elsif Is_List_Member (Parent (S)) then
Insert_After (Parent (S), Decl);
else
Insert_After (Parent (Etype (First_Formal (S))), Decl);
end if;
Mark_Rewrite_Insertion (Decl);
Set_Is_Intrinsic_Subprogram (Op_Name);
Analyze (Decl);
Remove (Decl);
Set_Has_Completion (Op_Name);
Set_Corresponding_Equality (Op_Name, S);
Set_Is_Abstract (Op_Name, Is_Abstract (S));
end;
end Make_Inequality_Operator;
----------------------
-- May_Need_Actuals --
----------------------
procedure May_Need_Actuals (Fun : Entity_Id) is
F : Entity_Id;
B : Boolean;
begin
F := First_Formal (Fun);
B := True;
while Present (F) loop
if No (Default_Value (F)) then
B := False;
exit;
end if;
Next_Formal (F);
end loop;
Set_Needs_No_Actuals (Fun, B);
end May_Need_Actuals;
---------------------
-- Mode_Conformant --
---------------------
function Mode_Conformant (New_Id, Old_Id : Entity_Id) return Boolean is
Result : Boolean;
begin
Check_Conformance (New_Id, Old_Id, Mode_Conformant, False, Result);
return Result;
end Mode_Conformant;
---------------------------
-- New_Overloaded_Entity --
---------------------------
procedure New_Overloaded_Entity
(S : Entity_Id;
Derived_Type : Entity_Id := Empty)
is
Does_Override : Boolean := False;
-- Set if the current scope has an operation that is type-conformant
-- with S, and becomes hidden by S.
E : Entity_Id;
-- Entity that S overrides
Prev_Vis : Entity_Id := Empty;
-- Needs comment ???
Is_Alias_Interface : Boolean := False;
function Is_Private_Declaration (E : Entity_Id) return Boolean;
-- Check that E is declared in the private part of the current package,
-- or in the package body, where it may hide a previous declaration.
-- We can't use In_Private_Part by itself because this flag is also
-- set when freezing entities, so we must examine the place of the
-- declaration in the tree, and recognize wrapper packages as well.
procedure Maybe_Primitive_Operation (Is_Overriding : Boolean := False);
-- If the subprogram being analyzed is a primitive operation of
-- the type of one of its formals, set the corresponding flag.
----------------------------
-- Is_Private_Declaration --
----------------------------
function Is_Private_Declaration (E : Entity_Id) return Boolean is
Priv_Decls : List_Id;
Decl : constant Node_Id := Unit_Declaration_Node (E);
begin
if Is_Package_Or_Generic_Package (Current_Scope)
and then In_Private_Part (Current_Scope)
then
Priv_Decls :=
Private_Declarations (
Specification (Unit_Declaration_Node (Current_Scope)));
return In_Package_Body (Current_Scope)
or else
(Is_List_Member (Decl)
and then List_Containing (Decl) = Priv_Decls)
or else (Nkind (Parent (Decl)) = N_Package_Specification
and then not Is_Compilation_Unit (
Defining_Entity (Parent (Decl)))
and then List_Containing (Parent (Parent (Decl)))
= Priv_Decls);
else
return False;
end if;
end Is_Private_Declaration;
-------------------------------
-- Maybe_Primitive_Operation --
-------------------------------
procedure Maybe_Primitive_Operation (Is_Overriding : Boolean := False) is
Formal : Entity_Id;
F_Typ : Entity_Id;
B_Typ : Entity_Id;
function Visible_Part_Type (T : Entity_Id) return Boolean;
-- Returns true if T is declared in the visible part of
-- the current package scope; otherwise returns false.
-- Assumes that T is declared in a package.
procedure Check_Private_Overriding (T : Entity_Id);
-- Checks that if a primitive abstract subprogram of a visible
-- abstract type is declared in a private part, then it must
-- override an abstract subprogram declared in the visible part.
-- Also checks that if a primitive function with a controlling
-- result is declared in a private part, then it must override
-- a function declared in the visible part.
------------------------------
-- Check_Private_Overriding --
------------------------------
procedure Check_Private_Overriding (T : Entity_Id) is
begin
if Ekind (Current_Scope) = E_Package
and then In_Private_Part (Current_Scope)
and then Visible_Part_Type (T)
and then not In_Instance
then
if Is_Abstract (T)
and then Is_Abstract (S)
and then (not Is_Overriding or else not Is_Abstract (E))
then
if not Is_Interface (T) then
Error_Msg_N ("abstract subprograms must be visible "
& "('R'M 3.9.3(10))!", S);
-- Ada 2005 (AI-251)
else
Error_Msg_N ("primitive subprograms of interface types "
& "declared in a visible part, must be declared in "
& "the visible part ('R'M 3.9.4)!", S);
end if;
elsif Ekind (S) = E_Function
and then Is_Tagged_Type (T)
and then T = Base_Type (Etype (S))
and then not Is_Overriding
then
Error_Msg_N
("private function with tagged result must"
& " override visible-part function", S);
Error_Msg_N
("\move subprogram to the visible part"
& " ('R'M 3.9.3(10))", S);
end if;
end if;
end Check_Private_Overriding;
-----------------------
-- Visible_Part_Type --
-----------------------
function Visible_Part_Type (T : Entity_Id) return Boolean is
P : constant Node_Id := Unit_Declaration_Node (Scope (T));
N : Node_Id;
begin
-- If the entity is a private type, then it must be
-- declared in a visible part.
if Ekind (T) in Private_Kind then
return True;
end if;
-- Otherwise, we traverse the visible part looking for its
-- corresponding declaration. We cannot use the declaration
-- node directly because in the private part the entity of a
-- private type is the one in the full view, which does not
-- indicate that it is the completion of something visible.
N := First (Visible_Declarations (Specification (P)));
while Present (N) loop
if Nkind (N) = N_Full_Type_Declaration
and then Present (Defining_Identifier (N))
and then T = Defining_Identifier (N)
then
return True;
elsif (Nkind (N) = N_Private_Type_Declaration
or else
Nkind (N) = N_Private_Extension_Declaration)
and then Present (Defining_Identifier (N))
and then T = Full_View (Defining_Identifier (N))
then
return True;
end if;
Next (N);
end loop;
return False;
end Visible_Part_Type;
-- Start of processing for Maybe_Primitive_Operation
begin
if not Comes_From_Source (S) then
null;
-- If the subprogram is at library level, it is not primitive
-- operation.
elsif Current_Scope = Standard_Standard then
null;
elsif (Ekind (Current_Scope) = E_Package
and then not In_Package_Body (Current_Scope))
or else Is_Overriding
then
-- For function, check return type
if Ekind (S) = E_Function then
B_Typ := Base_Type (Etype (S));
if Scope (B_Typ) = Current_Scope then
Set_Has_Primitive_Operations (B_Typ);
Check_Private_Overriding (B_Typ);
end if;
end if;
-- For all subprograms, check formals
Formal := First_Formal (S);
while Present (Formal) loop
if Ekind (Etype (Formal)) = E_Anonymous_Access_Type then
F_Typ := Designated_Type (Etype (Formal));
else
F_Typ := Etype (Formal);
end if;
B_Typ := Base_Type (F_Typ);
if Scope (B_Typ) = Current_Scope then
Set_Has_Primitive_Operations (B_Typ);
Check_Private_Overriding (B_Typ);
end if;
Next_Formal (Formal);
end loop;
end if;
end Maybe_Primitive_Operation;
-- Start of processing for New_Overloaded_Entity
begin
-- We need to look for an entity that S may override. This must be a
-- homonym in the current scope, so we look for the first homonym of
-- S in the current scope as the starting point for the search.
E := Current_Entity_In_Scope (S);
-- If there is no homonym then this is definitely not overriding
if No (E) then
Enter_Overloaded_Entity (S);
Check_Dispatching_Operation (S, Empty);
Maybe_Primitive_Operation;
-- Ada 2005 (AI-397): Subprograms in the context of protected
-- types have their overriding indicators checked in Sem_Ch9.
if Ekind (S) not in Subprogram_Kind
or else Ekind (Scope (S)) /= E_Protected_Type
then
Check_Overriding_Indicator (S, False);
end if;
-- If there is a homonym that is not overloadable, then we have an
-- error, except for the special cases checked explicitly below.
elsif not Is_Overloadable (E) then
-- Check for spurious conflict produced by a subprogram that has the
-- same name as that of the enclosing generic package. The conflict
-- occurs within an instance, between the subprogram and the renaming
-- declaration for the package. After the subprogram, the package
-- renaming declaration becomes hidden.
if Ekind (E) = E_Package
and then Present (Renamed_Object (E))
and then Renamed_Object (E) = Current_Scope
and then Nkind (Parent (Renamed_Object (E))) =
N_Package_Specification
and then Present (Generic_Parent (Parent (Renamed_Object (E))))
then
Set_Is_Hidden (E);
Set_Is_Immediately_Visible (E, False);
Enter_Overloaded_Entity (S);
Set_Homonym (S, Homonym (E));
Check_Dispatching_Operation (S, Empty);
Check_Overriding_Indicator (S, False);
-- If the subprogram is implicit it is hidden by the previous
-- declaration. However if it is dispatching, it must appear in the
-- dispatch table anyway, because it can be dispatched to even if it
-- cannot be called directly.
elsif Present (Alias (S))
and then not Comes_From_Source (S)
then
Set_Scope (S, Current_Scope);
if Is_Dispatching_Operation (Alias (S)) then
Check_Dispatching_Operation (S, Empty);
end if;
return;
else
Error_Msg_Sloc := Sloc (E);
Error_Msg_N ("& conflicts with declaration#", S);
-- Useful additional warning
if Is_Generic_Unit (E) then
Error_Msg_N ("\previous generic unit cannot be overloaded", S);
end if;
return;
end if;
-- E exists and is overloadable
else
Is_Alias_Interface :=
Present (Alias (S))
and then Is_Dispatching_Operation (Alias (S))
and then Present (DTC_Entity (Alias (S)))
and then Is_Interface (Scope (DTC_Entity (Alias (S))));
-- Loop through E and its homonyms to determine if any of them is
-- the candidate for overriding by S.
while Present (E) loop
-- Definitely not interesting if not in the current scope
if Scope (E) /= Current_Scope then
null;
-- Check if we have type conformance
-- Ada 2005 (AI-251): In case of overriding an interface
-- subprogram it is not an error that the old and new entities
-- have the same profile, and hence we skip this code.
elsif not Is_Alias_Interface
and then Type_Conformant (E, S)
-- Ada 2005 (AI-251): Do not consider here entities that cover
-- abstract interface primitives. They will be handled after
-- the overriden entity is found (see comments bellow inside
-- this subprogram).
and then not (Is_Subprogram (E)
and then Present (Abstract_Interface_Alias (E)))
then
-- If the old and new entities have the same profile and one
-- is not the body of the other, then this is an error, unless
-- one of them is implicitly declared.
-- There are some cases when both can be implicit, for example
-- when both a literal and a function that overrides it are
-- inherited in a derivation, or when an inhertited operation
-- of a tagged full type overrides the ineherited operation of
-- a private extension. Ada 83 had a special rule for the the
-- literal case. In Ada95, the later implicit operation hides
-- the former, and the literal is always the former. In the
-- odd case where both are derived operations declared at the
-- same point, both operations should be declared, and in that
-- case we bypass the following test and proceed to the next
-- part (this can only occur for certain obscure cases
-- involving homographs in instances and can't occur for
-- dispatching operations ???). Note that the following
-- condition is less than clear. For example, it's not at all
-- clear why there's a test for E_Entry here. ???
if Present (Alias (S))
and then (No (Alias (E))
or else Comes_From_Source (E)
or else Is_Dispatching_Operation (E))
and then
(Ekind (E) = E_Entry
or else Ekind (E) /= E_Enumeration_Literal)
then
-- When an derived operation is overloaded it may be due to
-- the fact that the full view of a private extension
-- re-inherits. It has to be dealt with.
if Is_Package_Or_Generic_Package (Current_Scope)
and then In_Private_Part (Current_Scope)
then
Check_Operation_From_Private_View (S, E);
end if;
-- In any case the implicit operation remains hidden by
-- the existing declaration, which is overriding.
Set_Is_Overriding_Operation (E);
if Comes_From_Source (E) then
Check_Overriding_Indicator (E, True);
-- Indicate that E overrides the operation from which
-- S is inherited.
if Present (Alias (S)) then
Set_Overridden_Operation (E, Alias (S));
else
Set_Overridden_Operation (E, S);
end if;
end if;
return;
-- Within an instance, the renaming declarations for
-- actual subprograms may become ambiguous, but they do
-- not hide each other.
elsif Ekind (E) /= E_Entry
and then not Comes_From_Source (E)
and then not Is_Generic_Instance (E)
and then (Present (Alias (E))
or else Is_Intrinsic_Subprogram (E))
and then (not In_Instance
or else No (Parent (E))
or else Nkind (Unit_Declaration_Node (E)) /=
N_Subprogram_Renaming_Declaration)
then
-- A subprogram child unit is not allowed to override
-- an inherited subprogram (10.1.1(20)).
if Is_Child_Unit (S) then
Error_Msg_N
("child unit overrides inherited subprogram in parent",
S);
return;
end if;
if Is_Non_Overriding_Operation (E, S) then
Enter_Overloaded_Entity (S);
if No (Derived_Type)
or else Is_Tagged_Type (Derived_Type)
then
Check_Dispatching_Operation (S, Empty);
end if;
return;
end if;
-- E is a derived operation or an internal operator which
-- is being overridden. Remove E from further visibility.
-- Furthermore, if E is a dispatching operation, it must be
-- replaced in the list of primitive operations of its type
-- (see Override_Dispatching_Operation).
Does_Override := True;
declare
Prev : Entity_Id;
begin
Prev := First_Entity (Current_Scope);
while Present (Prev)
and then Next_Entity (Prev) /= E
loop
Next_Entity (Prev);
end loop;
-- It is possible for E to be in the current scope and
-- yet not in the entity chain. This can only occur in a
-- generic context where E is an implicit concatenation
-- in the formal part, because in a generic body the
-- entity chain starts with the formals.
pragma Assert
(Present (Prev) or else Chars (E) = Name_Op_Concat);
-- E must be removed both from the entity_list of the
-- current scope, and from the visibility chain
if Debug_Flag_E then
Write_Str ("Override implicit operation ");
Write_Int (Int (E));
Write_Eol;
end if;
-- If E is a predefined concatenation, it stands for four
-- different operations. As a result, a single explicit
-- declaration does not hide it. In a possible ambiguous
-- situation, Disambiguate chooses the user-defined op,
-- so it is correct to retain the previous internal one.
if Chars (E) /= Name_Op_Concat
or else Ekind (E) /= E_Operator
then
-- For nondispatching derived operations that are
-- overridden by a subprogram declared in the private
-- part of a package, we retain the derived
-- subprogram but mark it as not immediately visible.
-- If the derived operation was declared in the
-- visible part then this ensures that it will still
-- be visible outside the package with the proper
-- signature (calls from outside must also be
-- directed to this version rather than the
-- overriding one, unlike the dispatching case).
-- Calls from inside the package will still resolve
-- to the overriding subprogram since the derived one
-- is marked as not visible within the package.
-- If the private operation is dispatching, we achieve
-- the overriding by keeping the implicit operation
-- but setting its alias to be the overriding one. In
-- this fashion the proper body is executed in all
-- cases, but the original signature is used outside
-- of the package.
-- If the overriding is not in the private part, we
-- remove the implicit operation altogether.
if Is_Private_Declaration (S) then
if not Is_Dispatching_Operation (E) then
Set_Is_Immediately_Visible (E, False);
else
-- Work done in Override_Dispatching_Operation,
-- so nothing else need to be done here.
null;
end if;
else
-- Find predecessor of E in Homonym chain
if E = Current_Entity (E) then
Prev_Vis := Empty;
else
Prev_Vis := Current_Entity (E);
while Homonym (Prev_Vis) /= E loop
Prev_Vis := Homonym (Prev_Vis);
end loop;
end if;
if Prev_Vis /= Empty then
-- Skip E in the visibility chain
Set_Homonym (Prev_Vis, Homonym (E));
else
Set_Name_Entity_Id (Chars (E), Homonym (E));
end if;
Set_Next_Entity (Prev, Next_Entity (E));
if No (Next_Entity (Prev)) then
Set_Last_Entity (Current_Scope, Prev);
end if;
end if;
end if;
Enter_Overloaded_Entity (S);
Set_Is_Overriding_Operation (S);
Check_Overriding_Indicator (S, True);
-- Indicate that S overrides the operation from which
-- E is inherited.
if Comes_From_Source (S) then
if Present (Alias (E)) then
Set_Overridden_Operation (S, Alias (E));
else
Set_Overridden_Operation (S, E);
end if;
end if;
if Is_Dispatching_Operation (E) then
-- An overriding dispatching subprogram inherits the
-- convention of the overridden subprogram (by
-- AI-117).
Set_Convention (S, Convention (E));
-- AI-251: For an entity overriding an interface
-- primitive check if the entity also covers other
-- abstract subprograms in the same scope. This is
-- required to handle the general case, that is,
-- 1) overriding other interface primitives, and
-- 2) overriding abstract subprograms inherited from
-- some abstract ancestor type.
if Has_Homonym (E)
and then Present (Alias (E))
and then Ekind (Alias (E)) /= E_Operator
and then Present (DTC_Entity (Alias (E)))
and then Is_Interface (Scope (DTC_Entity
(Alias (E))))
then
declare
E1 : Entity_Id;
begin
E1 := Homonym (E);
while Present (E1) loop
if (Is_Overloadable (E1)
or else Ekind (E1) = E_Subprogram_Type)
and then Present (Alias (E1))
and then Ekind (Alias (E1)) /= E_Operator
and then Present (DTC_Entity (Alias (E1)))
and then Is_Abstract
(Scope (DTC_Entity (Alias (E1))))
and then Type_Conformant (E1, S)
then
Check_Dispatching_Operation (S, E1);
end if;
E1 := Homonym (E1);
end loop;
end;
end if;
Check_Dispatching_Operation (S, E);
-- AI-251: Handle the case in which the entity
-- overrides a primitive operation that covered
-- several abstract interface primitives.
declare
E1 : Entity_Id;
begin
E1 := Current_Entity_In_Scope (S);
while Present (E1) loop
if Is_Subprogram (E1)
and then Present
(Abstract_Interface_Alias (E1))
and then Alias (E1) = E
then
Set_Alias (E1, S);
end if;
E1 := Homonym (E1);
end loop;
end;
else
Check_Dispatching_Operation (S, Empty);
end if;
Maybe_Primitive_Operation (Is_Overriding => True);
goto Check_Inequality;
end;
-- Apparent redeclarations in instances can occur when two
-- formal types get the same actual type. The subprograms in
-- in the instance are legal, even if not callable from the
-- outside. Calls from within are disambiguated elsewhere.
-- For dispatching operations in the visible part, the usual
-- rules apply, and operations with the same profile are not
-- legal (B830001).
elsif (In_Instance_Visible_Part
and then not Is_Dispatching_Operation (E))
or else In_Instance_Not_Visible
then
null;
-- Here we have a real error (identical profile)
else
Error_Msg_Sloc := Sloc (E);
-- Avoid cascaded errors if the entity appears in
-- subsequent calls.
Set_Scope (S, Current_Scope);
Error_Msg_N ("& conflicts with declaration#", S);
if Is_Generic_Instance (S)
and then not Has_Completion (E)
then
Error_Msg_N
("\instantiation cannot provide body for it", S);
end if;
return;
end if;
else
-- If one subprogram has an access parameter and the other
-- a parameter of an access type, calls to either might be
-- ambiguous. Verify that parameters match except for the
-- access parameter.
if May_Hide_Profile then
declare
F1 : Entity_Id;
F2 : Entity_Id;
begin
F1 := First_Formal (S);
F2 := First_Formal (E);
while Present (F1) and then Present (F2) loop
if Is_Access_Type (Etype (F1)) then
if not Is_Access_Type (Etype (F2))
or else not Conforming_Types
(Designated_Type (Etype (F1)),
Designated_Type (Etype (F2)),
Type_Conformant)
then
May_Hide_Profile := False;
end if;
elsif
not Conforming_Types
(Etype (F1), Etype (F2), Type_Conformant)
then
May_Hide_Profile := False;
end if;
Next_Formal (F1);
Next_Formal (F2);
end loop;
if May_Hide_Profile
and then No (F1)
and then No (F2)
then
Error_Msg_NE ("calls to& may be ambiguous?", S, S);
end if;
end;
end if;
end if;
Prev_Vis := E;
E := Homonym (E);
end loop;
-- On exit, we know that S is a new entity
Enter_Overloaded_Entity (S);
Maybe_Primitive_Operation;
Check_Overriding_Indicator (S, Does_Override);
-- If S is a derived operation for an untagged type then by
-- definition it's not a dispatching operation (even if the parent
-- operation was dispatching), so we don't call
-- Check_Dispatching_Operation in that case.
if No (Derived_Type)
or else Is_Tagged_Type (Derived_Type)
then
Check_Dispatching_Operation (S, Empty);
end if;
end if;
-- If this is a user-defined equality operator that is not a derived
-- subprogram, create the corresponding inequality. If the operation is
-- dispatching, the expansion is done elsewhere, and we do not create
-- an explicit inequality operation.
<<Check_Inequality>>
if Chars (S) = Name_Op_Eq
and then Etype (S) = Standard_Boolean
and then Present (Parent (S))
and then not Is_Dispatching_Operation (S)
then
Make_Inequality_Operator (S);
end if;
end New_Overloaded_Entity;
---------------------
-- Process_Formals --
---------------------
procedure Process_Formals
(T : List_Id;
Related_Nod : Node_Id)
is
Param_Spec : Node_Id;
Formal : Entity_Id;
Formal_Type : Entity_Id;
Default : Node_Id;
Ptype : Entity_Id;
function Is_Class_Wide_Default (D : Node_Id) return Boolean;
-- Check whether the default has a class-wide type. After analysis the
-- default has the type of the formal, so we must also check explicitly
-- for an access attribute.
---------------------------
-- Is_Class_Wide_Default --
---------------------------
function Is_Class_Wide_Default (D : Node_Id) return Boolean is
begin
return Is_Class_Wide_Type (Designated_Type (Etype (D)))
or else (Nkind (D) = N_Attribute_Reference
and then Attribute_Name (D) = Name_Access
and then Is_Class_Wide_Type (Etype (Prefix (D))));
end Is_Class_Wide_Default;
-- Start of processing for Process_Formals
begin
-- In order to prevent premature use of the formals in the same formal
-- part, the Ekind is left undefined until all default expressions are
-- analyzed. The Ekind is established in a separate loop at the end.
Param_Spec := First (T);
while Present (Param_Spec) loop
Formal := Defining_Identifier (Param_Spec);
Enter_Name (Formal);
-- Case of ordinary parameters
if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then
Find_Type (Parameter_Type (Param_Spec));
Ptype := Parameter_Type (Param_Spec);
if Ptype = Error then
goto Continue;
end if;
Formal_Type := Entity (Ptype);
if Ekind (Formal_Type) = E_Incomplete_Type
or else (Is_Class_Wide_Type (Formal_Type)
and then Ekind (Root_Type (Formal_Type)) =
E_Incomplete_Type)
then
-- Ada 2005 (AI-326): Tagged incomplete types allowed
if Is_Tagged_Type (Formal_Type) then
null;
elsif Nkind (Parent (T)) /= N_Access_Function_Definition
and then Nkind (Parent (T)) /= N_Access_Procedure_Definition
then
Error_Msg_N ("invalid use of incomplete type", Param_Spec);
end if;
elsif Ekind (Formal_Type) = E_Void then
Error_Msg_NE ("premature use of&",
Parameter_Type (Param_Spec), Formal_Type);
end if;
-- Ada 2005 (AI-231): Create and decorate an internal subtype
-- declaration corresponding to the null-excluding type of the
-- formal in the enclosing scope. Finally, replace the parameter
-- type of the formal with the internal subtype.
if Ada_Version >= Ada_05
and then Is_Access_Type (Formal_Type)
and then Null_Exclusion_Present (Param_Spec)
then
if Can_Never_Be_Null (Formal_Type)
and then Comes_From_Source (Related_Nod)
then
Error_Msg_N
("null exclusion must apply to a type that does not "
& "exclude null ('R'M 3.10 (14)", Related_Nod);
end if;
Formal_Type :=
Create_Null_Excluding_Itype
(T => Formal_Type,
Related_Nod => Related_Nod,
Scope_Id => Scope (Current_Scope));
end if;
-- An access formal type
else
Formal_Type :=
Access_Definition (Related_Nod, Parameter_Type (Param_Spec));
-- Ada 2005 (AI-254)
declare
AD : constant Node_Id :=
Access_To_Subprogram_Definition
(Parameter_Type (Param_Spec));
begin
if Present (AD) and then Protected_Present (AD) then
Formal_Type :=
Replace_Anonymous_Access_To_Protected_Subprogram
(Param_Spec, Formal_Type);
end if;
end;
end if;
Set_Etype (Formal, Formal_Type);
Default := Expression (Param_Spec);
if Present (Default) then
if Out_Present (Param_Spec) then
Error_Msg_N
("default initialization only allowed for IN parameters",
Param_Spec);
end if;
-- Do the special preanalysis of the expression (see section on
-- "Handling of Default Expressions" in the spec of package Sem).
Analyze_Per_Use_Expression (Default, Formal_Type);
-- Check that the designated type of an access parameter's default
-- is not a class-wide type unless the parameter's designated type
-- is also class-wide.
if Ekind (Formal_Type) = E_Anonymous_Access_Type
and then not From_With_Type (Formal_Type)
and then Is_Class_Wide_Default (Default)
and then not Is_Class_Wide_Type (Designated_Type (Formal_Type))
then
Error_Msg_N
("access to class-wide expression not allowed here", Default);
end if;
end if;
-- Ada 2005 (AI-231): Static checks
if Ada_Version >= Ada_05
and then Is_Access_Type (Etype (Formal))
and then Can_Never_Be_Null (Etype (Formal))
then
Null_Exclusion_Static_Checks (Param_Spec);
end if;
<<Continue>>
Next (Param_Spec);
end loop;
-- If this is the formal part of a function specification, analyze the
-- subtype mark in the context where the formals are visible but not
-- yet usable, and may hide outer homographs.
if Nkind (Related_Nod) = N_Function_Specification then
Analyze_Return_Type (Related_Nod);
end if;
-- Now set the kind (mode) of each formal
Param_Spec := First (T);
while Present (Param_Spec) loop
Formal := Defining_Identifier (Param_Spec);
Set_Formal_Mode (Formal);
if Ekind (Formal) = E_In_Parameter then
Set_Default_Value (Formal, Expression (Param_Spec));
if Present (Expression (Param_Spec)) then
Default := Expression (Param_Spec);
if Is_Scalar_Type (Etype (Default)) then
if Nkind
(Parameter_Type (Param_Spec)) /= N_Access_Definition
then
Formal_Type := Entity (Parameter_Type (Param_Spec));
else
Formal_Type := Access_Definition
(Related_Nod, Parameter_Type (Param_Spec));
end if;
Apply_Scalar_Range_Check (Default, Formal_Type);
end if;
end if;
end if;
Next (Param_Spec);
end loop;
end Process_Formals;
----------------------------
-- Reference_Body_Formals --
----------------------------
procedure Reference_Body_Formals (Spec : Entity_Id; Bod : Entity_Id) is
Fs : Entity_Id;
Fb : Entity_Id;
begin
if Error_Posted (Spec) then
return;
end if;
Fs := First_Formal (Spec);
Fb := First_Formal (Bod);
while Present (Fs) loop
Generate_Reference (Fs, Fb, 'b');
if Style_Check then
Style.Check_Identifier (Fb, Fs);
end if;
Set_Spec_Entity (Fb, Fs);
Set_Referenced (Fs, False);
Next_Formal (Fs);
Next_Formal (Fb);
end loop;
end Reference_Body_Formals;
-------------------------
-- Set_Actual_Subtypes --
-------------------------
procedure Set_Actual_Subtypes (N : Node_Id; Subp : Entity_Id) is
Loc : constant Source_Ptr := Sloc (N);
Decl : Node_Id;
Formal : Entity_Id;
T : Entity_Id;
First_Stmt : Node_Id := Empty;
AS_Needed : Boolean;
begin
-- If this is an emtpy initialization procedure, no need to create
-- actual subtypes (small optimization).
if Ekind (Subp) = E_Procedure
and then Is_Null_Init_Proc (Subp)
then
return;
end if;
Formal := First_Formal (Subp);
while Present (Formal) loop
T := Etype (Formal);
-- We never need an actual subtype for a constrained formal
if Is_Constrained (T) then
AS_Needed := False;
-- If we have unknown discriminants, then we do not need an actual
-- subtype, or more accurately we cannot figure it out! Note that
-- all class-wide types have unknown discriminants.
elsif Has_Unknown_Discriminants (T) then
AS_Needed := False;
-- At this stage we have an unconstrained type that may need an
-- actual subtype. For sure the actual subtype is needed if we have
-- an unconstrained array type.
elsif Is_Array_Type (T) then
AS_Needed := True;
-- The only other case needing an actual subtype is an unconstrained
-- record type which is an IN parameter (we cannot generate actual
-- subtypes for the OUT or IN OUT case, since an assignment can
-- change the discriminant values. However we exclude the case of
-- initialization procedures, since discriminants are handled very
-- specially in this context, see the section entitled "Handling of
-- Discriminants" in Einfo.
-- We also exclude the case of Discrim_SO_Functions (functions used
-- in front end layout mode for size/offset values), since in such
-- functions only discriminants are referenced, and not only are such
-- subtypes not needed, but they cannot always be generated, because
-- of order of elaboration issues.
elsif Is_Record_Type (T)
and then Ekind (Formal) = E_In_Parameter
and then Chars (Formal) /= Name_uInit
and then not Is_Unchecked_Union (T)
and then not Is_Discrim_SO_Function (Subp)
then
AS_Needed := True;
-- All other cases do not need an actual subtype
else
AS_Needed := False;
end if;
-- Generate actual subtypes for unconstrained arrays and
-- unconstrained discriminated records.
if AS_Needed then
if Nkind (N) = N_Accept_Statement then
-- If expansion is active, The formal is replaced by a local
-- variable that renames the corresponding entry of the
-- parameter block, and it is this local variable that may
-- require an actual subtype.
if Expander_Active then
Decl := Build_Actual_Subtype (T, Renamed_Object (Formal));
else
Decl := Build_Actual_Subtype (T, Formal);
end if;
if Present (Handled_Statement_Sequence (N)) then
First_Stmt :=
First (Statements (Handled_Statement_Sequence (N)));
Prepend (Decl, Statements (Handled_Statement_Sequence (N)));
Mark_Rewrite_Insertion (Decl);
else
-- If the accept statement has no body, there will be no
-- reference to the actuals, so no need to compute actual
-- subtypes.
return;
end if;
else
Decl := Build_Actual_Subtype (T, Formal);
Prepend (Decl, Declarations (N));
Mark_Rewrite_Insertion (Decl);
end if;
-- The declaration uses the bounds of an existing object, and
-- therefore needs no constraint checks.
Analyze (Decl, Suppress => All_Checks);
-- We need to freeze manually the generated type when it is
-- inserted anywhere else than in a declarative part.
if Present (First_Stmt) then
Insert_List_Before_And_Analyze (First_Stmt,
Freeze_Entity (Defining_Identifier (Decl), Loc));
end if;
if Nkind (N) = N_Accept_Statement
and then Expander_Active
then
Set_Actual_Subtype (Renamed_Object (Formal),
Defining_Identifier (Decl));
else
Set_Actual_Subtype (Formal, Defining_Identifier (Decl));
end if;
end if;
Next_Formal (Formal);
end loop;
end Set_Actual_Subtypes;
---------------------
-- Set_Formal_Mode --
---------------------
procedure Set_Formal_Mode (Formal_Id : Entity_Id) is
Spec : constant Node_Id := Parent (Formal_Id);
begin
-- Note: we set Is_Known_Valid for IN parameters and IN OUT parameters
-- since we ensure that corresponding actuals are always valid at the
-- point of the call.
if Out_Present (Spec) then
if Ekind (Scope (Formal_Id)) = E_Function
or else Ekind (Scope (Formal_Id)) = E_Generic_Function
then
Error_Msg_N ("functions can only have IN parameters", Spec);
Set_Ekind (Formal_Id, E_In_Parameter);
elsif In_Present (Spec) then
Set_Ekind (Formal_Id, E_In_Out_Parameter);
else
Set_Ekind (Formal_Id, E_Out_Parameter);
Set_Never_Set_In_Source (Formal_Id, True);
Set_Is_True_Constant (Formal_Id, False);
Set_Current_Value (Formal_Id, Empty);
end if;
else
Set_Ekind (Formal_Id, E_In_Parameter);
end if;
-- Set Is_Known_Non_Null for access parameters since the language
-- guarantees that access parameters are always non-null. We also set
-- Can_Never_Be_Null, since there is no way to change the value.
if Nkind (Parameter_Type (Spec)) = N_Access_Definition then
-- Ada 2005 (AI-231): In Ada95, access parameters are always non-
-- null; In Ada 2005, only if then null_exclusion is explicit.
if Ada_Version < Ada_05
or else Can_Never_Be_Null (Etype (Formal_Id))
then
Set_Is_Known_Non_Null (Formal_Id);
Set_Can_Never_Be_Null (Formal_Id);
end if;
-- Ada 2005 (AI-231): Null-exclusion access subtype
elsif Is_Access_Type (Etype (Formal_Id))
and then Can_Never_Be_Null (Etype (Formal_Id))
then
Set_Is_Known_Non_Null (Formal_Id);
end if;
Set_Mechanism (Formal_Id, Default_Mechanism);
Set_Formal_Validity (Formal_Id);
end Set_Formal_Mode;
-------------------------
-- Set_Formal_Validity --
-------------------------
procedure Set_Formal_Validity (Formal_Id : Entity_Id) is
begin
-- If no validity checking, then we cannot assume anything about the
-- validity of parameters, since we do not know there is any checking
-- of the validity on the call side.
if not Validity_Checks_On then
return;
-- If validity checking for parameters is enabled, this means we are
-- not supposed to make any assumptions about argument values.
elsif Validity_Check_Parameters then
return;
-- If we are checking in parameters, we will assume that the caller is
-- also checking parameters, so we can assume the parameter is valid.
elsif Ekind (Formal_Id) = E_In_Parameter
and then Validity_Check_In_Params
then
Set_Is_Known_Valid (Formal_Id, True);
-- Similar treatment for IN OUT parameters
elsif Ekind (Formal_Id) = E_In_Out_Parameter
and then Validity_Check_In_Out_Params
then
Set_Is_Known_Valid (Formal_Id, True);
end if;
end Set_Formal_Validity;
------------------------
-- Subtype_Conformant --
------------------------
function Subtype_Conformant (New_Id, Old_Id : Entity_Id) return Boolean is
Result : Boolean;
begin
Check_Conformance (New_Id, Old_Id, Subtype_Conformant, False, Result);
return Result;
end Subtype_Conformant;
---------------------
-- Type_Conformant --
---------------------
function Type_Conformant
(New_Id : Entity_Id;
Old_Id : Entity_Id;
Skip_Controlling_Formals : Boolean := False) return Boolean
is
Result : Boolean;
begin
May_Hide_Profile := False;
Check_Conformance
(New_Id, Old_Id, Type_Conformant, False, Result,
Skip_Controlling_Formals => Skip_Controlling_Formals);
return Result;
end Type_Conformant;
-------------------------------
-- Valid_Operator_Definition --
-------------------------------
procedure Valid_Operator_Definition (Designator : Entity_Id) is
N : Integer := 0;
F : Entity_Id;
Id : constant Name_Id := Chars (Designator);
N_OK : Boolean;
begin
F := First_Formal (Designator);
while Present (F) loop
N := N + 1;
if Present (Default_Value (F)) then
Error_Msg_N
("default values not allowed for operator parameters",
Parent (F));
end if;
Next_Formal (F);
end loop;
-- Verify that user-defined operators have proper number of arguments
-- First case of operators which can only be unary
if Id = Name_Op_Not
or else Id = Name_Op_Abs
then
N_OK := (N = 1);
-- Case of operators which can be unary or binary
elsif Id = Name_Op_Add
or Id = Name_Op_Subtract
then
N_OK := (N in 1 .. 2);
-- All other operators can only be binary
else
N_OK := (N = 2);
end if;
if not N_OK then
Error_Msg_N
("incorrect number of arguments for operator", Designator);
end if;
if Id = Name_Op_Ne
and then Base_Type (Etype (Designator)) = Standard_Boolean
and then not Is_Intrinsic_Subprogram (Designator)
then
Error_Msg_N
("explicit definition of inequality not allowed", Designator);
end if;
end Valid_Operator_Definition;
end Sem_Ch6;
|
asm/binary/binary.asm | severinkaderli/BTI7061-CSBas | 1 | 162277 | <gh_stars>1-10
section .data
Number: db 42
section .bss
StringBuffer: resb 32
section .text
global _start
EXTERN printText, printNewline, convertNumberToString, binaryLog, numberToBinaryString
_start:
nop
mov al, [Number]
mov rbx, StringBuffer
call numberToBinaryString
mov rcx, StringBuffer
mov rdx, 32
call printText
call printNewline
exit:
mov rax, 1
mov rbx, 0
int 0x80
|
sound_tests.asm | jwestfall69/ddragon-diag | 0 | 22166 | include "ddragon.inc"
include "ddragon_diag.inc"
include "error_codes.inc"
include "macros.inc"
global manual_sound_tests
global STR_SOUND_TESTS
section text
manual_sound_tests:
; static text
FG_XY 10,4
ldy #STR_SOUND_TESTS
JRU fg_print_string
FG_XY 2,7
ldy #STR_SND_NUM
JRU fg_print_string
FG_XY 2,19
ldy #STR_02_12_FM
JRU fg_print_string
FG_XY 2,20
ldy #STR_80_BA_PCM
JRU fg_print_string
FG_XY 2,23
ldy #STR_JOY_CHANGE
JRU fg_print_string
FG_XY 2,24
ldy #STR_A_PLAY
JRU fg_print_string
FG_XY 2,25
ldy #STR_B_STOP
JRU fg_print_string
FG_XY 2,26
ldy #STR_C_MAIN_MENU
JRU fg_print_string
ldb #2 ; sound number; start at 2 as 0/1 aren't valid
.loop_input:
jsr input_update
lda g_p1_input_edge
bita #UP
beq .up_not_pressed
incb
.up_not_pressed:
bita #DOWN
beq .down_not_pressed
decb
.down_not_pressed:
bita #LEFT
beq .left_not_pressed
subb #$10
.left_not_pressed:
bita #RIGHT
beq .right_not_pressed
addb #$10
.right_not_pressed:
bita #A_BUTTON
beq .a_not_pressed
stb REG_SOUND
.a_not_pressed:
bita #B_BUTTON
beq .b_not_pressed
lde REG_SOUND ; reading will cause sound to stop
.b_not_pressed:
lda g_extra_input_edge
bita #$2
beq .c_not_pressed
lde REG_SOUND
rts
.c_not_pressed:
FG_XY 13,7
tfr b,a
pshs b
JRU fg_print_hex_byte
puls b
jmp .loop_input
STR_SOUND_TESTS: string "SOUND TESTS"
STR_SND_NUM: string "SND NUMBER "
STR_02_12_FM: string "02 TO 12 ARE FM"
STR_80_BA_PCM: string "80 TO BA ARE PCM"
STR_JOY_CHANGE: string "JOY - CHANGE SOUND NUMBER"
STR_A_PLAY: string "A - PLAY SOUND"
STR_B_STOP: string "B - STOP SOUND"
|
pixy/src/host/pantilt_in_ada/specs/libusb_1_0_libusb_h.ads | GambuzX/Pixy-SIW | 1 | 2030 | <filename>pixy/src/host/pantilt_in_ada/specs/libusb_1_0_libusb_h.ads
--
-- Copyright (c) 2015, <NAME> <<EMAIL>>
--
-- 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.
--
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with stdint_h;
with Interfaces.C.Strings;
with System;
with stdio_h;
limited with x86_64_linux_gnu_bits_time_h;
package libusb_1_0_libusb_h is
-- unsupported macro: LIBUSB_DEPRECATED_FOR(f) __attribute__((deprecated("Use " #f " instead")))
-- unsupported macro: LIBUSBX_API_VERSION 0x01000102
-- unsupported macro: libusb_le16_to_cpu libusb_cpu_to_le16
-- unsupported macro: LIBUSB_DT_DEVICE_SIZE 18
-- unsupported macro: LIBUSB_DT_CONFIG_SIZE 9
-- unsupported macro: LIBUSB_DT_INTERFACE_SIZE 9
-- unsupported macro: LIBUSB_DT_ENDPOINT_SIZE 7
-- unsupported macro: LIBUSB_DT_ENDPOINT_AUDIO_SIZE 9
-- unsupported macro: LIBUSB_DT_HUB_NONVAR_SIZE 7
-- unsupported macro: LIBUSB_DT_SS_ENDPOINT_COMPANION_SIZE 6
-- unsupported macro: LIBUSB_DT_BOS_SIZE 5
-- unsupported macro: LIBUSB_DT_DEVICE_CAPABILITY_SIZE 3
-- unsupported macro: LIBUSB_BT_USB_2_0_EXTENSION_SIZE 7
-- unsupported macro: LIBUSB_BT_SS_USB_DEVICE_CAPABILITY_SIZE 10
-- unsupported macro: LIBUSB_BT_CONTAINER_ID_SIZE 20
-- unsupported macro: LIBUSB_DT_BOS_MAX_SIZE ((LIBUSB_DT_BOS_SIZE) + (LIBUSB_BT_USB_2_0_EXTENSION_SIZE) + (LIBUSB_BT_SS_USB_DEVICE_CAPABILITY_SIZE) + (LIBUSB_BT_CONTAINER_ID_SIZE))
-- unsupported macro: LIBUSB_ENDPOINT_ADDRESS_MASK 0x0f
-- unsupported macro: LIBUSB_ENDPOINT_DIR_MASK 0x80
-- unsupported macro: LIBUSB_TRANSFER_TYPE_MASK 0x03
-- unsupported macro: LIBUSB_ISO_SYNC_TYPE_MASK 0x0C
-- unsupported macro: LIBUSB_ISO_USAGE_TYPE_MASK 0x30
-- unsupported macro: LIBUSB_CONTROL_SETUP_SIZE (sizeof(struct libusb_control_setup))
-- unsupported macro: LIBUSB_ERROR_COUNT 14
-- unsupported macro: LIBUSB_HOTPLUG_MATCH_ANY -1
function libusb_cpu_to_le16 (x : stdint_h.uint16_t) return stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:161
pragma Import (C, libusb_cpu_to_le16, "libusb_cpu_to_le16");
subtype libusb_class_code is unsigned;
LIBUSB_CLASS_PER_INTERFACE : constant libusb_class_code := 0;
LIBUSB_CLASS_AUDIO : constant libusb_class_code := 1;
LIBUSB_CLASS_COMM : constant libusb_class_code := 2;
LIBUSB_CLASS_HID : constant libusb_class_code := 3;
LIBUSB_CLASS_PHYSICAL : constant libusb_class_code := 5;
LIBUSB_CLASS_PRINTER : constant libusb_class_code := 7;
LIBUSB_CLASS_PTP : constant libusb_class_code := 6;
LIBUSB_CLASS_IMAGE : constant libusb_class_code := 6;
LIBUSB_CLASS_MASS_STORAGE : constant libusb_class_code := 8;
LIBUSB_CLASS_HUB : constant libusb_class_code := 9;
LIBUSB_CLASS_DATA : constant libusb_class_code := 10;
LIBUSB_CLASS_SMART_CARD : constant libusb_class_code := 11;
LIBUSB_CLASS_CONTENT_SECURITY : constant libusb_class_code := 13;
LIBUSB_CLASS_VIDEO : constant libusb_class_code := 14;
LIBUSB_CLASS_PERSONAL_HEALTHCARE : constant libusb_class_code := 15;
LIBUSB_CLASS_DIAGNOSTIC_DEVICE : constant libusb_class_code := 220;
LIBUSB_CLASS_WIRELESS : constant libusb_class_code := 224;
LIBUSB_CLASS_APPLICATION : constant libusb_class_code := 254;
LIBUSB_CLASS_VENDOR_SPEC : constant libusb_class_code := 255; -- /usr/include/libusb-1.0/libusb.h:186
subtype libusb_descriptor_type is unsigned;
LIBUSB_DT_DEVICE : constant libusb_descriptor_type := 1;
LIBUSB_DT_CONFIG : constant libusb_descriptor_type := 2;
LIBUSB_DT_STRING : constant libusb_descriptor_type := 3;
LIBUSB_DT_INTERFACE : constant libusb_descriptor_type := 4;
LIBUSB_DT_ENDPOINT : constant libusb_descriptor_type := 5;
LIBUSB_DT_BOS : constant libusb_descriptor_type := 15;
LIBUSB_DT_DEVICE_CAPABILITY : constant libusb_descriptor_type := 16;
LIBUSB_DT_HID : constant libusb_descriptor_type := 33;
LIBUSB_DT_REPORT : constant libusb_descriptor_type := 34;
LIBUSB_DT_PHYSICAL : constant libusb_descriptor_type := 35;
LIBUSB_DT_HUB : constant libusb_descriptor_type := 41;
LIBUSB_DT_SUPERSPEED_HUB : constant libusb_descriptor_type := 42;
LIBUSB_DT_SS_ENDPOINT_COMPANION : constant libusb_descriptor_type := 48; -- /usr/include/libusb-1.0/libusb.h:248
subtype libusb_endpoint_direction is unsigned;
LIBUSB_ENDPOINT_IN : constant libusb_endpoint_direction := 128;
LIBUSB_ENDPOINT_OUT : constant libusb_endpoint_direction := 0; -- /usr/include/libusb-1.0/libusb.h:318
type libusb_transfer_type is
(LIBUSB_TRANSFER_TYPE_CONTROL,
LIBUSB_TRANSFER_TYPE_ISOCHRONOUS,
LIBUSB_TRANSFER_TYPE_BULK,
LIBUSB_TRANSFER_TYPE_INTERRUPT);
pragma Convention (C, libusb_transfer_type); -- /usr/include/libusb-1.0/libusb.h:332
subtype libusb_standard_request is unsigned;
LIBUSB_REQUEST_GET_STATUS : constant libusb_standard_request := 0;
LIBUSB_REQUEST_CLEAR_FEATURE : constant libusb_standard_request := 1;
LIBUSB_REQUEST_SET_FEATURE : constant libusb_standard_request := 3;
LIBUSB_REQUEST_SET_ADDRESS : constant libusb_standard_request := 5;
LIBUSB_REQUEST_GET_DESCRIPTOR : constant libusb_standard_request := 6;
LIBUSB_REQUEST_SET_DESCRIPTOR : constant libusb_standard_request := 7;
LIBUSB_REQUEST_GET_CONFIGURATION : constant libusb_standard_request := 8;
LIBUSB_REQUEST_SET_CONFIGURATION : constant libusb_standard_request := 9;
LIBUSB_REQUEST_GET_INTERFACE : constant libusb_standard_request := 10;
LIBUSB_REQUEST_SET_INTERFACE : constant libusb_standard_request := 11;
LIBUSB_REQUEST_SYNCH_FRAME : constant libusb_standard_request := 12;
LIBUSB_REQUEST_SET_SEL : constant libusb_standard_request := 48;
LIBUSB_SET_ISOCH_DELAY : constant libusb_standard_request := 49; -- /usr/include/libusb-1.0/libusb.h:348
subtype libusb_request_type is unsigned;
LIBUSB_REQUEST_TYPE_STANDARD : constant libusb_request_type := 0;
LIBUSB_REQUEST_TYPE_CLASS : constant libusb_request_type := 32;
LIBUSB_REQUEST_TYPE_VENDOR : constant libusb_request_type := 64;
LIBUSB_REQUEST_TYPE_RESERVED : constant libusb_request_type := 96; -- /usr/include/libusb-1.0/libusb.h:398
type libusb_request_recipient is
(LIBUSB_RECIPIENT_DEVICE,
LIBUSB_RECIPIENT_INTERFACE,
LIBUSB_RECIPIENT_ENDPOINT,
LIBUSB_RECIPIENT_OTHER);
pragma Convention (C, libusb_request_recipient); -- /usr/include/libusb-1.0/libusb.h:416
type libusb_iso_sync_type is
(LIBUSB_ISO_SYNC_TYPE_NONE,
LIBUSB_ISO_SYNC_TYPE_ASYNC,
LIBUSB_ISO_SYNC_TYPE_ADAPTIVE,
LIBUSB_ISO_SYNC_TYPE_SYNC);
pragma Convention (C, libusb_iso_sync_type); -- /usr/include/libusb-1.0/libusb.h:437
type libusb_iso_usage_type is
(LIBUSB_ISO_USAGE_TYPE_DATA,
LIBUSB_ISO_USAGE_TYPE_FEEDBACK,
LIBUSB_ISO_USAGE_TYPE_IMPLICIT);
pragma Convention (C, libusb_iso_usage_type); -- /usr/include/libusb-1.0/libusb.h:458
type libusb_device_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:476
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:481
bcdUSB : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:485
bDeviceClass : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:488
bDeviceSubClass : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:492
bDeviceProtocol : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:496
bMaxPacketSize0 : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:499
idVendor : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:502
idProduct : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:505
bcdDevice : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:508
iManufacturer : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:511
iProduct : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:514
iSerialNumber : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:517
bNumConfigurations : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:520
end record;
pragma Convention (C_Pass_By_Copy, libusb_device_descriptor); -- /usr/include/libusb-1.0/libusb.h:474
type libusb_endpoint_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:530
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:535
bEndpointAddress : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:541
bmAttributes : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:550
wMaxPacketSize : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:553
bInterval : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:556
bRefresh : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:560
bSynchAddress : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:563
extra : access unsigned_char; -- /usr/include/libusb-1.0/libusb.h:567
extra_length : aliased int; -- /usr/include/libusb-1.0/libusb.h:570
end record;
pragma Convention (C_Pass_By_Copy, libusb_endpoint_descriptor); -- /usr/include/libusb-1.0/libusb.h:528
type libusb_interface_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:580
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:585
bInterfaceNumber : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:588
bAlternateSetting : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:591
bNumEndpoints : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:595
bInterfaceClass : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:598
bInterfaceSubClass : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:602
bInterfaceProtocol : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:606
iInterface : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:609
endpoint : access constant libusb_endpoint_descriptor; -- /usr/include/libusb-1.0/libusb.h:613
extra : access unsigned_char; -- /usr/include/libusb-1.0/libusb.h:617
extra_length : aliased int; -- /usr/include/libusb-1.0/libusb.h:620
end record;
pragma Convention (C_Pass_By_Copy, libusb_interface_descriptor); -- /usr/include/libusb-1.0/libusb.h:578
type libusb_interface is record
altsetting : access constant libusb_interface_descriptor; -- /usr/include/libusb-1.0/libusb.h:629
num_altsetting : aliased int; -- /usr/include/libusb-1.0/libusb.h:632
end record;
pragma Convention (C_Pass_By_Copy, libusb_interface); -- /usr/include/libusb-1.0/libusb.h:626
type libusb_config_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:642
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:647
wTotalLength : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:650
bNumInterfaces : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:653
bConfigurationValue : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:656
iConfiguration : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:659
bmAttributes : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:662
MaxPower : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:667
c_interface : access constant libusb_interface; -- /usr/include/libusb-1.0/libusb.h:671
extra : access unsigned_char; -- /usr/include/libusb-1.0/libusb.h:675
extra_length : aliased int; -- /usr/include/libusb-1.0/libusb.h:678
end record;
pragma Convention (C_Pass_By_Copy, libusb_config_descriptor); -- /usr/include/libusb-1.0/libusb.h:640
type libusb_ss_endpoint_companion_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:690
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:695
bMaxBurst : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:700
bmAttributes : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:706
wBytesPerInterval : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:710
end record;
pragma Convention (C_Pass_By_Copy, libusb_ss_endpoint_companion_descriptor); -- /usr/include/libusb-1.0/libusb.h:687
type libusb_bos_dev_capability_descriptor_dev_capability_data_array is array (0 .. -1) of aliased stdint_h.uint8_t;
type libusb_bos_dev_capability_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:720
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:724
bDevCapabilityType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:726
dev_capability_data : aliased libusb_bos_dev_capability_descriptor_dev_capability_data_array; -- /usr/include/libusb-1.0/libusb.h:732
end record;
pragma Convention (C_Pass_By_Copy, libusb_bos_dev_capability_descriptor); -- /usr/include/libusb-1.0/libusb.h:718
type libusb_bos_descriptor_dev_capability_array is array (0 .. -1) of access libusb_bos_dev_capability_descriptor;
type libusb_bos_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:744
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:749
wTotalLength : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:752
bNumDeviceCaps : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:756
dev_capability : aliased libusb_bos_descriptor_dev_capability_array; -- /usr/include/libusb-1.0/libusb.h:763
end record;
pragma Convention (C_Pass_By_Copy, libusb_bos_descriptor); -- /usr/include/libusb-1.0/libusb.h:742
type libusb_usb_2_0_extension_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:775
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:780
bDevCapabilityType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:785
bmAttributes : aliased stdint_h.uint32_t; -- /usr/include/libusb-1.0/libusb.h:791
end record;
pragma Convention (C_Pass_By_Copy, libusb_usb_2_0_extension_descriptor); -- /usr/include/libusb-1.0/libusb.h:773
type libusb_ss_usb_device_capability_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:801
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:806
bDevCapabilityType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:811
bmAttributes : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:817
wSpeedSupported : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:821
bFunctionalitySupport : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:827
bU1DevExitLat : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:830
bU2DevExitLat : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:833
end record;
pragma Convention (C_Pass_By_Copy, libusb_ss_usb_device_capability_descriptor); -- /usr/include/libusb-1.0/libusb.h:799
type libusb_container_id_descriptor_ContainerID_array is array (0 .. 15) of aliased stdint_h.uint8_t;
type libusb_container_id_descriptor is record
bLength : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:843
bDescriptorType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:848
bDevCapabilityType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:853
bReserved : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:856
ContainerID : aliased libusb_container_id_descriptor_ContainerID_array; -- /usr/include/libusb-1.0/libusb.h:859
end record;
pragma Convention (C_Pass_By_Copy, libusb_container_id_descriptor); -- /usr/include/libusb-1.0/libusb.h:841
type libusb_control_setup is record
bmRequestType : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:870
bRequest : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:877
wValue : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:880
wIndex : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:884
wLength : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:887
end record;
pragma Convention (C_Pass_By_Copy, libusb_control_setup); -- /usr/include/libusb-1.0/libusb.h:864
-- skipped empty struct libusb_context
-- skipped empty struct libusb_device
-- skipped empty struct libusb_device_handle
-- skipped empty struct libusb_hotplug_callback
type libusb_version is record
major : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:904
minor : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:907
micro : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:910
nano : aliased stdint_h.uint16_t; -- /usr/include/libusb-1.0/libusb.h:913
rc : Interfaces.C.Strings.chars_ptr; -- /usr/include/libusb-1.0/libusb.h:916
describe : Interfaces.C.Strings.chars_ptr; -- /usr/include/libusb-1.0/libusb.h:919
end record;
pragma Convention (C_Pass_By_Copy, libusb_version); -- /usr/include/libusb-1.0/libusb.h:902
type libusb_speed is
(LIBUSB_SPEED_UNKNOWN,
LIBUSB_SPEED_LOW,
LIBUSB_SPEED_FULL,
LIBUSB_SPEED_HIGH,
LIBUSB_SPEED_SUPER);
pragma Convention (C, libusb_speed); -- /usr/include/libusb-1.0/libusb.h:972
subtype libusb_supported_speed is unsigned;
LIBUSB_LOW_SPEED_OPERATION : constant libusb_supported_speed := 1;
LIBUSB_FULL_SPEED_OPERATION : constant libusb_supported_speed := 2;
LIBUSB_HIGH_SPEED_OPERATION : constant libusb_supported_speed := 4;
LIBUSB_SUPER_SPEED_OPERATION : constant libusb_supported_speed := 8; -- /usr/include/libusb-1.0/libusb.h:993
subtype libusb_usb_2_0_extension_attributes is unsigned;
LIBUSB_BM_LPM_SUPPORT : constant libusb_usb_2_0_extension_attributes := 2; -- /usr/include/libusb-1.0/libusb.h:1012
subtype libusb_ss_usb_device_capability_attributes is unsigned;
LIBUSB_BM_LTM_SUPPORT : constant libusb_ss_usb_device_capability_attributes := 2; -- /usr/include/libusb-1.0/libusb.h:1022
subtype libusb_bos_type is unsigned;
LIBUSB_BT_WIRELESS_USB_DEVICE_CAPABILITY : constant libusb_bos_type := 1;
LIBUSB_BT_USB_2_0_EXTENSION : constant libusb_bos_type := 2;
LIBUSB_BT_SS_USB_DEVICE_CAPABILITY : constant libusb_bos_type := 3;
LIBUSB_BT_CONTAINER_ID : constant libusb_bos_type := 4; -- /usr/include/libusb-1.0/libusb.h:1030
subtype libusb_error is unsigned;
LIBUSB_SUCCESS : constant libusb_error := 0;
LIBUSB_ERROR_IO : constant libusb_error := -1;
LIBUSB_ERROR_INVALID_PARAM : constant libusb_error := -2;
LIBUSB_ERROR_ACCESS : constant libusb_error := -3;
LIBUSB_ERROR_NO_DEVICE : constant libusb_error := -4;
LIBUSB_ERROR_NOT_FOUND : constant libusb_error := -5;
LIBUSB_ERROR_BUSY : constant libusb_error := -6;
LIBUSB_ERROR_TIMEOUT : constant libusb_error := -7;
LIBUSB_ERROR_OVERFLOW : constant libusb_error := -8;
LIBUSB_ERROR_PIPE : constant libusb_error := -9;
LIBUSB_ERROR_INTERRUPTED : constant libusb_error := -10;
LIBUSB_ERROR_NO_MEM : constant libusb_error := -11;
LIBUSB_ERROR_NOT_SUPPORTED : constant libusb_error := -12;
LIBUSB_ERROR_OTHER : constant libusb_error := -99; -- /usr/include/libusb-1.0/libusb.h:1051
type libusb_transfer_status is
(LIBUSB_TRANSFER_COMPLETED,
LIBUSB_TRANSFER_ERROR,
LIBUSB_TRANSFER_TIMED_OUT,
LIBUSB_TRANSFER_CANCELLED,
LIBUSB_TRANSFER_STALL,
LIBUSB_TRANSFER_NO_DEVICE,
LIBUSB_TRANSFER_OVERFLOW);
pragma Convention (C, libusb_transfer_status); -- /usr/include/libusb-1.0/libusb.h:1103
subtype libusb_transfer_flags is unsigned;
LIBUSB_TRANSFER_SHORT_NOT_OK : constant libusb_transfer_flags := 1;
LIBUSB_TRANSFER_FREE_BUFFER : constant libusb_transfer_flags := 2;
LIBUSB_TRANSFER_FREE_TRANSFER : constant libusb_transfer_flags := 4;
LIBUSB_TRANSFER_ADD_ZERO_PACKET : constant libusb_transfer_flags := 8; -- /usr/include/libusb-1.0/libusb.h:1133
type libusb_iso_packet_descriptor is record
length : aliased unsigned; -- /usr/include/libusb-1.0/libusb.h:1176
actual_length : aliased unsigned; -- /usr/include/libusb-1.0/libusb.h:1179
status : aliased libusb_transfer_status; -- /usr/include/libusb-1.0/libusb.h:1182
end record;
pragma Convention (C_Pass_By_Copy, libusb_iso_packet_descriptor); -- /usr/include/libusb-1.0/libusb.h:1174
type libusb_transfer_cb_fn is access procedure (arg1 : System.Address);
pragma Convention (C, libusb_transfer_cb_fn); -- /usr/include/libusb-1.0/libusb.h:1196
type libusb_transfer_iso_packet_desc_array is array (0 .. -1) of aliased libusb_iso_packet_descriptor;
type libusb_transfer is record
dev_handle : System.Address; -- /usr/include/libusb-1.0/libusb.h:1206
flags : aliased stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:1209
endpoint : aliased unsigned_char; -- /usr/include/libusb-1.0/libusb.h:1212
c_type : aliased unsigned_char; -- /usr/include/libusb-1.0/libusb.h:1215
timeout : aliased unsigned; -- /usr/include/libusb-1.0/libusb.h:1219
status : aliased libusb_transfer_status; -- /usr/include/libusb-1.0/libusb.h:1228
length : aliased int; -- /usr/include/libusb-1.0/libusb.h:1231
actual_length : aliased int; -- /usr/include/libusb-1.0/libusb.h:1236
callback : libusb_transfer_cb_fn; -- /usr/include/libusb-1.0/libusb.h:1240
user_data : System.Address; -- /usr/include/libusb-1.0/libusb.h:1243
buffer : access unsigned_char; -- /usr/include/libusb-1.0/libusb.h:1246
num_iso_packets : aliased int; -- /usr/include/libusb-1.0/libusb.h:1250
iso_packet_desc : aliased libusb_transfer_iso_packet_desc_array; -- /usr/include/libusb-1.0/libusb.h:1257
end record;
pragma Convention (C_Pass_By_Copy, libusb_transfer); -- /usr/include/libusb-1.0/libusb.h:1204
subtype libusb_capability is unsigned;
LIBUSB_CAP_HAS_CAPABILITY : constant libusb_capability := 0;
LIBUSB_CAP_HAS_HOTPLUG : constant libusb_capability := 1;
LIBUSB_CAP_HAS_HID_ACCESS : constant libusb_capability := 256;
LIBUSB_CAP_SUPPORTS_DETACH_KERNEL_DRIVER : constant libusb_capability := 257; -- /usr/include/libusb-1.0/libusb.h:1267
type libusb_log_level is
(LIBUSB_LOG_LEVEL_NONE,
LIBUSB_LOG_LEVEL_ERROR,
LIBUSB_LOG_LEVEL_WARNING,
LIBUSB_LOG_LEVEL_INFO,
LIBUSB_LOG_LEVEL_DEBUG);
pragma Convention (C, libusb_log_level); -- /usr/include/libusb-1.0/libusb.h:1292
function libusb_init (ctx : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1300
pragma Import (C, libusb_init, "libusb_init");
procedure libusb_exit (ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1301
pragma Import (C, libusb_exit, "libusb_exit");
procedure libusb_set_debug (ctx : System.Address; level : int); -- /usr/include/libusb-1.0/libusb.h:1302
pragma Import (C, libusb_set_debug, "libusb_set_debug");
function libusb_get_version return access constant libusb_version; -- /usr/include/libusb-1.0/libusb.h:1303
pragma Import (C, libusb_get_version, "libusb_get_version");
function libusb_has_capability (capability : stdint_h.uint32_t) return int; -- /usr/include/libusb-1.0/libusb.h:1304
pragma Import (C, libusb_has_capability, "libusb_has_capability");
function libusb_error_name (errcode : int) return Interfaces.C.Strings.chars_ptr; -- /usr/include/libusb-1.0/libusb.h:1305
pragma Import (C, libusb_error_name, "libusb_error_name");
function libusb_setlocale (locale : Interfaces.C.Strings.chars_ptr) return int; -- /usr/include/libusb-1.0/libusb.h:1306
pragma Import (C, libusb_setlocale, "libusb_setlocale");
function libusb_strerror (errcode : libusb_error) return Interfaces.C.Strings.chars_ptr; -- /usr/include/libusb-1.0/libusb.h:1307
pragma Import (C, libusb_strerror, "libusb_strerror");
function libusb_get_device_list (ctx : System.Address; list : System.Address) return stdio_h.ssize_t; -- /usr/include/libusb-1.0/libusb.h:1309
pragma Import (C, libusb_get_device_list, "libusb_get_device_list");
procedure libusb_free_device_list (list : System.Address; unref_devices : int); -- /usr/include/libusb-1.0/libusb.h:1311
pragma Import (C, libusb_free_device_list, "libusb_free_device_list");
function libusb_ref_device (dev : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1313
pragma Import (C, libusb_ref_device, "libusb_ref_device");
procedure libusb_unref_device (dev : System.Address); -- /usr/include/libusb-1.0/libusb.h:1314
pragma Import (C, libusb_unref_device, "libusb_unref_device");
function libusb_get_configuration (dev : System.Address; config : access int) return int; -- /usr/include/libusb-1.0/libusb.h:1316
pragma Import (C, libusb_get_configuration, "libusb_get_configuration");
function libusb_get_device_descriptor (dev : System.Address; desc : access libusb_device_descriptor) return int; -- /usr/include/libusb-1.0/libusb.h:1318
pragma Import (C, libusb_get_device_descriptor, "libusb_get_device_descriptor");
function libusb_get_active_config_descriptor (dev : System.Address; config : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1320
pragma Import (C, libusb_get_active_config_descriptor, "libusb_get_active_config_descriptor");
function libusb_get_config_descriptor
(dev : System.Address;
config_index : stdint_h.uint8_t;
config : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1322
pragma Import (C, libusb_get_config_descriptor, "libusb_get_config_descriptor");
function libusb_get_config_descriptor_by_value
(dev : System.Address;
bConfigurationValue : stdint_h.uint8_t;
config : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1324
pragma Import (C, libusb_get_config_descriptor_by_value, "libusb_get_config_descriptor_by_value");
procedure libusb_free_config_descriptor (config : access libusb_config_descriptor); -- /usr/include/libusb-1.0/libusb.h:1326
pragma Import (C, libusb_free_config_descriptor, "libusb_free_config_descriptor");
function libusb_get_ss_endpoint_companion_descriptor
(ctx : System.Address;
endpoint : access constant libusb_endpoint_descriptor;
ep_comp : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1328
pragma Import (C, libusb_get_ss_endpoint_companion_descriptor, "libusb_get_ss_endpoint_companion_descriptor");
procedure libusb_free_ss_endpoint_companion_descriptor (ep_comp : access libusb_ss_endpoint_companion_descriptor); -- /usr/include/libusb-1.0/libusb.h:1332
pragma Import (C, libusb_free_ss_endpoint_companion_descriptor, "libusb_free_ss_endpoint_companion_descriptor");
function libusb_get_bos_descriptor (handle : System.Address; bos : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1334
pragma Import (C, libusb_get_bos_descriptor, "libusb_get_bos_descriptor");
procedure libusb_free_bos_descriptor (bos : access libusb_bos_descriptor); -- /usr/include/libusb-1.0/libusb.h:1336
pragma Import (C, libusb_free_bos_descriptor, "libusb_free_bos_descriptor");
function libusb_get_usb_2_0_extension_descriptor
(ctx : System.Address;
dev_cap : access libusb_bos_dev_capability_descriptor;
usb_2_0_extension : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1337
pragma Import (C, libusb_get_usb_2_0_extension_descriptor, "libusb_get_usb_2_0_extension_descriptor");
procedure libusb_free_usb_2_0_extension_descriptor (usb_2_0_extension : access libusb_usb_2_0_extension_descriptor); -- /usr/include/libusb-1.0/libusb.h:1341
pragma Import (C, libusb_free_usb_2_0_extension_descriptor, "libusb_free_usb_2_0_extension_descriptor");
function libusb_get_ss_usb_device_capability_descriptor
(ctx : System.Address;
dev_cap : access libusb_bos_dev_capability_descriptor;
ss_usb_device_cap : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1343
pragma Import (C, libusb_get_ss_usb_device_capability_descriptor, "libusb_get_ss_usb_device_capability_descriptor");
procedure libusb_free_ss_usb_device_capability_descriptor (ss_usb_device_cap : access libusb_ss_usb_device_capability_descriptor); -- /usr/include/libusb-1.0/libusb.h:1347
pragma Import (C, libusb_free_ss_usb_device_capability_descriptor, "libusb_free_ss_usb_device_capability_descriptor");
function libusb_get_container_id_descriptor
(ctx : System.Address;
dev_cap : access libusb_bos_dev_capability_descriptor;
container_id : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1349
pragma Import (C, libusb_get_container_id_descriptor, "libusb_get_container_id_descriptor");
procedure libusb_free_container_id_descriptor (container_id : access libusb_container_id_descriptor); -- /usr/include/libusb-1.0/libusb.h:1352
pragma Import (C, libusb_free_container_id_descriptor, "libusb_free_container_id_descriptor");
function libusb_get_bus_number (dev : System.Address) return stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:1354
pragma Import (C, libusb_get_bus_number, "libusb_get_bus_number");
function libusb_get_port_number (dev : System.Address) return stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:1355
pragma Import (C, libusb_get_port_number, "libusb_get_port_number");
function libusb_get_port_numbers
(dev : System.Address;
port_numbers : access stdint_h.uint8_t;
port_numbers_len : int) return int; -- /usr/include/libusb-1.0/libusb.h:1356
pragma Import (C, libusb_get_port_numbers, "libusb_get_port_numbers");
function libusb_get_port_path
(ctx : System.Address;
dev : System.Address;
path : access stdint_h.uint8_t;
path_length : stdint_h.uint8_t) return int; -- /usr/include/libusb-1.0/libusb.h:1358
pragma Import (C, libusb_get_port_path, "libusb_get_port_path");
function libusb_get_parent (dev : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1359
pragma Import (C, libusb_get_parent, "libusb_get_parent");
function libusb_get_device_address (dev : System.Address) return stdint_h.uint8_t; -- /usr/include/libusb-1.0/libusb.h:1360
pragma Import (C, libusb_get_device_address, "libusb_get_device_address");
function libusb_get_device_speed (dev : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1361
pragma Import (C, libusb_get_device_speed, "libusb_get_device_speed");
function libusb_get_max_packet_size (dev : System.Address; endpoint : unsigned_char) return int; -- /usr/include/libusb-1.0/libusb.h:1362
pragma Import (C, libusb_get_max_packet_size, "libusb_get_max_packet_size");
function libusb_get_max_iso_packet_size (dev : System.Address; endpoint : unsigned_char) return int; -- /usr/include/libusb-1.0/libusb.h:1364
pragma Import (C, libusb_get_max_iso_packet_size, "libusb_get_max_iso_packet_size");
function libusb_open (dev : System.Address; handle : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1367
pragma Import (C, libusb_open, "libusb_open");
procedure libusb_close (dev_handle : System.Address); -- /usr/include/libusb-1.0/libusb.h:1368
pragma Import (C, libusb_close, "libusb_close");
function libusb_get_device (dev_handle : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1369
pragma Import (C, libusb_get_device, "libusb_get_device");
function libusb_set_configuration (dev : System.Address; configuration : int) return int; -- /usr/include/libusb-1.0/libusb.h:1371
pragma Import (C, libusb_set_configuration, "libusb_set_configuration");
function libusb_claim_interface (dev : System.Address; interface_number : int) return int; -- /usr/include/libusb-1.0/libusb.h:1373
pragma Import (C, libusb_claim_interface, "libusb_claim_interface");
function libusb_release_interface (dev : System.Address; interface_number : int) return int; -- /usr/include/libusb-1.0/libusb.h:1375
pragma Import (C, libusb_release_interface, "libusb_release_interface");
function libusb_open_device_with_vid_pid
(ctx : System.Address;
vendor_id : stdint_h.uint16_t;
product_id : stdint_h.uint16_t) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1378
pragma Import (C, libusb_open_device_with_vid_pid, "libusb_open_device_with_vid_pid");
function libusb_set_interface_alt_setting
(dev : System.Address;
interface_number : int;
alternate_setting : int) return int; -- /usr/include/libusb-1.0/libusb.h:1381
pragma Import (C, libusb_set_interface_alt_setting, "libusb_set_interface_alt_setting");
function libusb_clear_halt (dev : System.Address; endpoint : unsigned_char) return int; -- /usr/include/libusb-1.0/libusb.h:1383
pragma Import (C, libusb_clear_halt, "libusb_clear_halt");
function libusb_reset_device (dev : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1385
pragma Import (C, libusb_reset_device, "libusb_reset_device");
function libusb_kernel_driver_active (dev : System.Address; interface_number : int) return int; -- /usr/include/libusb-1.0/libusb.h:1387
pragma Import (C, libusb_kernel_driver_active, "libusb_kernel_driver_active");
function libusb_detach_kernel_driver (dev : System.Address; interface_number : int) return int; -- /usr/include/libusb-1.0/libusb.h:1389
pragma Import (C, libusb_detach_kernel_driver, "libusb_detach_kernel_driver");
function libusb_attach_kernel_driver (dev : System.Address; interface_number : int) return int; -- /usr/include/libusb-1.0/libusb.h:1391
pragma Import (C, libusb_attach_kernel_driver, "libusb_attach_kernel_driver");
function libusb_set_auto_detach_kernel_driver (dev : System.Address; enable : int) return int; -- /usr/include/libusb-1.0/libusb.h:1393
pragma Import (C, libusb_set_auto_detach_kernel_driver, "libusb_set_auto_detach_kernel_driver");
function libusb_control_transfer_get_data (transfer : access libusb_transfer) return access unsigned_char; -- /usr/include/libusb-1.0/libusb.h:1410
pragma Import (C, libusb_control_transfer_get_data, "libusb_control_transfer_get_data");
function libusb_control_transfer_get_setup (transfer : access libusb_transfer) return access libusb_control_setup; -- /usr/include/libusb-1.0/libusb.h:1428
pragma Import (C, libusb_control_transfer_get_setup, "libusb_control_transfer_get_setup");
procedure libusb_fill_control_setup
(buffer : access unsigned_char;
bmRequestType : stdint_h.uint8_t;
bRequest : stdint_h.uint8_t;
wValue : stdint_h.uint16_t;
wIndex : stdint_h.uint16_t;
wLength : stdint_h.uint16_t); -- /usr/include/libusb-1.0/libusb.h:1457
pragma Import (C, libusb_fill_control_setup, "libusb_fill_control_setup");
function libusb_alloc_transfer (iso_packets : int) return access libusb_transfer; -- /usr/include/libusb-1.0/libusb.h:1469
pragma Import (C, libusb_alloc_transfer, "libusb_alloc_transfer");
function libusb_submit_transfer (transfer : access libusb_transfer) return int; -- /usr/include/libusb-1.0/libusb.h:1470
pragma Import (C, libusb_submit_transfer, "libusb_submit_transfer");
function libusb_cancel_transfer (transfer : access libusb_transfer) return int; -- /usr/include/libusb-1.0/libusb.h:1471
pragma Import (C, libusb_cancel_transfer, "libusb_cancel_transfer");
procedure libusb_free_transfer (transfer : access libusb_transfer); -- /usr/include/libusb-1.0/libusb.h:1472
pragma Import (C, libusb_free_transfer, "libusb_free_transfer");
procedure libusb_fill_control_transfer
(transfer : access libusb_transfer;
dev_handle : System.Address;
buffer : access unsigned_char;
callback : libusb_transfer_cb_fn;
user_data : System.Address;
timeout : unsigned); -- /usr/include/libusb-1.0/libusb.h:1502
pragma Import (C, libusb_fill_control_transfer, "libusb_fill_control_transfer");
procedure libusb_fill_bulk_transfer
(transfer : access libusb_transfer;
dev_handle : System.Address;
endpoint : unsigned_char;
buffer : access unsigned_char;
length : int;
callback : libusb_transfer_cb_fn;
user_data : System.Address;
timeout : unsigned); -- /usr/include/libusb-1.0/libusb.h:1533
pragma Import (C, libusb_fill_bulk_transfer, "libusb_fill_bulk_transfer");
procedure libusb_fill_interrupt_transfer
(transfer : access libusb_transfer;
dev_handle : System.Address;
endpoint : unsigned_char;
buffer : access unsigned_char;
length : int;
callback : libusb_transfer_cb_fn;
user_data : System.Address;
timeout : unsigned); -- /usr/include/libusb-1.0/libusb.h:1561
pragma Import (C, libusb_fill_interrupt_transfer, "libusb_fill_interrupt_transfer");
procedure libusb_fill_iso_transfer
(transfer : access libusb_transfer;
dev_handle : System.Address;
endpoint : unsigned_char;
buffer : access unsigned_char;
length : int;
num_iso_packets : int;
callback : libusb_transfer_cb_fn;
user_data : System.Address;
timeout : unsigned); -- /usr/include/libusb-1.0/libusb.h:1590
pragma Import (C, libusb_fill_iso_transfer, "libusb_fill_iso_transfer");
procedure libusb_set_iso_packet_lengths (transfer : access libusb_transfer; length : unsigned); -- /usr/include/libusb-1.0/libusb.h:1614
pragma Import (C, libusb_set_iso_packet_lengths, "libusb_set_iso_packet_lengths");
function libusb_get_iso_packet_buffer (transfer : access libusb_transfer; packet : unsigned) return access unsigned_char; -- /usr/include/libusb-1.0/libusb.h:1638
pragma Import (C, libusb_get_iso_packet_buffer, "libusb_get_iso_packet_buffer");
function libusb_get_iso_packet_buffer_simple (transfer : access libusb_transfer; packet : unsigned) return access unsigned_char; -- /usr/include/libusb-1.0/libusb.h:1680
pragma Import (C, libusb_get_iso_packet_buffer_simple, "libusb_get_iso_packet_buffer_simple");
function libusb_control_transfer
(dev_handle : System.Address;
request_type : stdint_h.uint8_t;
bRequest : stdint_h.uint8_t;
wValue : stdint_h.uint16_t;
wIndex : stdint_h.uint16_t;
data : access unsigned_char;
wLength : stdint_h.uint16_t;
timeout : unsigned) return int; -- /usr/include/libusb-1.0/libusb.h:1700
pragma Import (C, libusb_control_transfer, "libusb_control_transfer");
function libusb_bulk_transfer
(dev_handle : System.Address;
endpoint : unsigned_char;
data : access unsigned_char;
length : int;
actual_length : access int;
timeout : unsigned) return int; -- /usr/include/libusb-1.0/libusb.h:1704
pragma Import (C, libusb_bulk_transfer, "libusb_bulk_transfer");
function libusb_interrupt_transfer
(dev_handle : System.Address;
endpoint : unsigned_char;
data : access unsigned_char;
length : int;
actual_length : access int;
timeout : unsigned) return int; -- /usr/include/libusb-1.0/libusb.h:1708
pragma Import (C, libusb_interrupt_transfer, "libusb_interrupt_transfer");
function libusb_get_descriptor
(dev : System.Address;
desc_type : stdint_h.uint8_t;
desc_index : stdint_h.uint8_t;
data : access unsigned_char;
length : int) return int; -- /usr/include/libusb-1.0/libusb.h:1724
pragma Import (C, libusb_get_descriptor, "libusb_get_descriptor");
function libusb_get_string_descriptor
(dev : System.Address;
desc_index : stdint_h.uint8_t;
langid : stdint_h.uint16_t;
data : access unsigned_char;
length : int) return int; -- /usr/include/libusb-1.0/libusb.h:1746
pragma Import (C, libusb_get_string_descriptor, "libusb_get_string_descriptor");
function libusb_get_string_descriptor_ascii
(dev : System.Address;
desc_index : stdint_h.uint8_t;
data : access unsigned_char;
length : int) return int; -- /usr/include/libusb-1.0/libusb.h:1754
pragma Import (C, libusb_get_string_descriptor_ascii, "libusb_get_string_descriptor_ascii");
function libusb_try_lock_events (ctx : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1759
pragma Import (C, libusb_try_lock_events, "libusb_try_lock_events");
procedure libusb_lock_events (ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1760
pragma Import (C, libusb_lock_events, "libusb_lock_events");
procedure libusb_unlock_events (ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1761
pragma Import (C, libusb_unlock_events, "libusb_unlock_events");
function libusb_event_handling_ok (ctx : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1762
pragma Import (C, libusb_event_handling_ok, "libusb_event_handling_ok");
function libusb_event_handler_active (ctx : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1763
pragma Import (C, libusb_event_handler_active, "libusb_event_handler_active");
procedure libusb_lock_event_waiters (ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1764
pragma Import (C, libusb_lock_event_waiters, "libusb_lock_event_waiters");
procedure libusb_unlock_event_waiters (ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1765
pragma Import (C, libusb_unlock_event_waiters, "libusb_unlock_event_waiters");
function libusb_wait_for_event (ctx : System.Address; tv : access x86_64_linux_gnu_bits_time_h.timeval) return int; -- /usr/include/libusb-1.0/libusb.h:1766
pragma Import (C, libusb_wait_for_event, "libusb_wait_for_event");
function libusb_handle_events_timeout (ctx : System.Address; tv : access x86_64_linux_gnu_bits_time_h.timeval) return int; -- /usr/include/libusb-1.0/libusb.h:1768
pragma Import (C, libusb_handle_events_timeout, "libusb_handle_events_timeout");
function libusb_handle_events_timeout_completed
(ctx : System.Address;
tv : access x86_64_linux_gnu_bits_time_h.timeval;
completed : access int) return int; -- /usr/include/libusb-1.0/libusb.h:1770
pragma Import (C, libusb_handle_events_timeout_completed, "libusb_handle_events_timeout_completed");
function libusb_handle_events (ctx : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1772
pragma Import (C, libusb_handle_events, "libusb_handle_events");
function libusb_handle_events_completed (ctx : System.Address; completed : access int) return int; -- /usr/include/libusb-1.0/libusb.h:1773
pragma Import (C, libusb_handle_events_completed, "libusb_handle_events_completed");
function libusb_handle_events_locked (ctx : System.Address; tv : access x86_64_linux_gnu_bits_time_h.timeval) return int; -- /usr/include/libusb-1.0/libusb.h:1774
pragma Import (C, libusb_handle_events_locked, "libusb_handle_events_locked");
function libusb_pollfds_handle_timeouts (ctx : System.Address) return int; -- /usr/include/libusb-1.0/libusb.h:1776
pragma Import (C, libusb_pollfds_handle_timeouts, "libusb_pollfds_handle_timeouts");
function libusb_get_next_timeout (ctx : System.Address; tv : access x86_64_linux_gnu_bits_time_h.timeval) return int; -- /usr/include/libusb-1.0/libusb.h:1777
pragma Import (C, libusb_get_next_timeout, "libusb_get_next_timeout");
type libusb_pollfd is record
fd : aliased int; -- /usr/include/libusb-1.0/libusb.h:1785
events : aliased short; -- /usr/include/libusb-1.0/libusb.h:1791
end record;
pragma Convention (C_Pass_By_Copy, libusb_pollfd); -- /usr/include/libusb-1.0/libusb.h:1783
type libusb_pollfd_added_cb is access procedure
(arg1 : int;
arg2 : short;
arg3 : System.Address);
pragma Convention (C, libusb_pollfd_added_cb); -- /usr/include/libusb-1.0/libusb.h:1804
type libusb_pollfd_removed_cb is access procedure (arg1 : int; arg2 : System.Address);
pragma Convention (C, libusb_pollfd_removed_cb); -- /usr/include/libusb-1.0/libusb.h:1816
function libusb_get_pollfds (ctx : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1818
pragma Import (C, libusb_get_pollfds, "libusb_get_pollfds");
procedure libusb_set_pollfd_notifiers
(ctx : System.Address;
added_cb : libusb_pollfd_added_cb;
removed_cb : libusb_pollfd_removed_cb;
user_data : System.Address); -- /usr/include/libusb-1.0/libusb.h:1820
pragma Import (C, libusb_set_pollfd_notifiers, "libusb_set_pollfd_notifiers");
subtype libusb_hotplug_callback_handle is int; -- /usr/include/libusb-1.0/libusb.h:1836
subtype libusb_hotplug_flag is unsigned;
LIBUSB_HOTPLUG_ENUMERATE : constant libusb_hotplug_flag := 1; -- /usr/include/libusb-1.0/libusb.h:1846
subtype libusb_hotplug_event is unsigned;
LIBUSB_HOTPLUG_EVENT_DEVICE_ARRIVED : constant libusb_hotplug_event := 1;
LIBUSB_HOTPLUG_EVENT_DEVICE_LEFT : constant libusb_hotplug_event := 2; -- /usr/include/libusb-1.0/libusb.h:1861
type libusb_hotplug_callback_fn is access function
(arg1 : System.Address;
arg2 : System.Address;
arg3 : libusb_hotplug_event;
arg4 : System.Address) return int;
pragma Convention (C, libusb_hotplug_callback_fn); -- /usr/include/libusb-1.0/libusb.h:1889
function libusb_hotplug_register_callback
(ctx : System.Address;
events : libusb_hotplug_event;
flags : libusb_hotplug_flag;
vendor_id : int;
product_id : int;
dev_class : int;
cb_fn : libusb_hotplug_callback_fn;
user_data : System.Address;
handle : access libusb_hotplug_callback_handle) return int; -- /usr/include/libusb-1.0/libusb.h:1928
pragma Import (C, libusb_hotplug_register_callback, "libusb_hotplug_register_callback");
procedure libusb_hotplug_deregister_callback (ctx : System.Address; handle : libusb_hotplug_callback_handle); -- /usr/include/libusb-1.0/libusb.h:1948
pragma Import (C, libusb_hotplug_deregister_callback, "libusb_hotplug_deregister_callback");
end libusb_1_0_libusb_h;
|
main.asm | Speff/masm_template | 1 | 175173 | <filename>main.asm<gh_stars>1-10
.386
.model flat,stdcall
.stack 4096
includelib \masm32\lib\kernel32.lib
ExitProcess PROTO, dwExitCode:DWORD
.code
main PROC
mov eax, 5
add eax, 6
call ExitProcess
main ENDP
END main
|
oeis/004/A004587.asm | neoneye/loda-programs | 11 | 178271 | <gh_stars>10-100
; A004587: Expansion of sqrt(10) in base 4.
; Submitted by <NAME>
; 3,0,2,2,1,2,0,2,3,0,0,1,3,1,1,2,3,1,0,2,3,1,2,2,2,1,1,0,2,1,0,0,0,2,1,1,0,1,1,1,3,2,1,0,0,1,2,0,1,2,1,2,3,0,3,1,3,3,3,3,1,1,0,2,2,2,3,1,0,3,2,0,0,2,2,2,3,2,2,3,3,2,0,1,2,0,0,0,0,0,1,3,0,1,1,1,3,1,1,1
mov $2,1
mov $3,$0
add $3,2
mov $4,$0
add $4,2
mul $4,2
mov $7,10
pow $7,$4
lpb $3
mov $4,$2
pow $4,2
mul $4,10
mov $5,$1
pow $5,2
add $4,$5
mov $6,$1
mov $1,$4
mul $6,$2
mul $6,2
mov $2,$6
mov $8,$4
div $8,$7
max $8,1
div $1,$8
div $2,$8
add $2,2
sub $3,1
mov $9,4
lpe
mov $3,$9
pow $3,$0
div $2,$3
div $1,$2
mod $1,$9
mov $0,$1
|
Example.applescript | BlueM/Pashua-Binding-AppleScript | 26 | 224 |
-- This example loads script "Pashua.scpt" (to be compiled from "Pashua.applescript") from the
-- same folder which contains this file. Pashua.scpt handles the communication with Pashua.app.
-- You can either take the handlers out of Pashua.scpt and use them inline whenever you write
-- a script which uses Pashua, use Pashua.scpt as an AppleScript Library (OS X 10.9 or newer)
-- or use the "load script" approach used in this file.
-- Get the path to the folder containing this script
tell application "Finder"
set thisFolder to (container of (path to me)) as string
if "Pashua:Pashua.app:" exists then
-- Looks like the Pashua disk image is mounted. Run from there.
set customLocation to "Pashua:"
else
-- Search for Pashua in the standard locations
set customLocation to ""
end if
end tell
try
set thePath to alias (thisFolder & "Pashua.scpt")
set pashuaBinding to load script thePath
tell pashuaBinding
-- Display the dialog
try
set pashuaLocation to getPashuaPath(customLocation)
set dialogConfiguration to my getDialogConfiguration(pashuaLocation)
set theResult to showDialog(dialogConfiguration, customLocation)
-- Display the result. The record keys ("... of theResult") are defined in the
-- dialog configuration string.
if {} = theResult then
display alert "Empty return value" message "It looks like Pashua had some problems using the window configuration." as warning
else if cb of theResult is not "1" then
display dialog "AppleScript received this record: " & return & return & ¬
"pop: " & pop of theResult & return & ¬
"ob: " & ob of theResult & return & ¬
"tf: " & tf of theResult & return & ¬
"chk: " & chk of theResult & return & ¬
"rb: " & rb of theResult & return
else
-- The cancelbutton (named "cb" in the config string) was pressed
display dialog "The dialog was closed without submitting the values"
end if
on error errorMessage
display alert "An error occurred" message errorMessage as warning
end try
end tell
on error errStr number errorNumber
display dialog errStr
end try
-- Returns the configuration string for an example dialog
on getDialogConfiguration(pashuaLocation)
if pashuaLocation is not "" then
set img to "img.type = image
img.x = 435
img.y = 248
img.maxwidth = 128
img.tooltip = This is an element of type “image”
img.path = " & (POSIX path of pashuaLocation) & "/Contents/Resources/AppIcon@2.png" & return
else
set img to ""
end if
return "
# Set window title
*.title = Welcome to Pashua
# Introductory text
txt.type = text
txt.default = Pashua is an application for generating dialog windows from programming languages which lack support for creating native GUIs on Mac OS X. Any information you enter in this example window will be returned to the calling script when you hit “OK”; if you decide to click “Cancel” or press “Esc” instead, no values will be returned.[return][return]This window shows nine of the UI element types that are available. You can find a full list of all GUI elements and their corresponding attributes in the documentation (➔ Help menu) that is included with Pashua.
txt.height = 276
txt.width = 310
txt.x = 340
txt.y = 44
txt.tooltip = This is an element of type “text”
# Add a text field
tf.type = textfield
tf.label = Example textfield
tf.default = Textfield content
tf.width = 310
tf.tooltip = This is an element of type “textfield”
# Add a filesystem browser
ob.type = openbrowser
ob.label = Example filesystem browser (textfield + open panel)
ob.width=310
ob.tooltip = This is an element of type “openbrowser”
# Define radiobuttons
rb.type = radiobutton
rb.label = Example radiobuttons
rb.option = Radiobutton item #1
rb.option = Radiobutton item #2
rb.option = Radiobutton item #3
rb.tooltip = This is an element of type “radiobutton”
# Add a popup menu
pop.type = popup
pop.label = Example popup menu
pop.width = 310
pop.option = Popup menu item #1
pop.option = Popup menu item #2
pop.option = Popup menu item #3
pop.default = Popup menu item #2
pop.tooltip = This is an element of type “popup”
# Add 2 checkboxes
chk.rely = -18
chk.type = checkbox
chk.label = Pashua offers checkboxes, too
chk.tooltip = This is an element of type “checkbox”
chk.default = 1
chk2.type = checkbox
chk2.label = But this one is disabled
chk2.disabled = 1
chk2.tooltip = Another element of type “checkbox”
# Add a cancel button with default label
cb.type = cancelbutton
cb.tooltip = This is an element of type “cancelbutton”
db.type = defaultbutton
db.tooltip = This is an element of type “defaultbutton” (which is automatically added to each window, if not included in the configuration)
" & img
end getDialogConfiguration
|
source/amf/mof/cmof/amf-internals-cmof_properties.ads | svn2github/matreshka | 24 | 10541 | <filename>source/amf/mof/cmof/amf-internals-cmof_properties.ads<gh_stars>10-100
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, <NAME> <<EMAIL>> --
-- 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.Associations;
with AMF.CMOF.Classes;
with AMF.CMOF.Classifiers.Collections;
with AMF.CMOF.Data_Types;
with AMF.CMOF.Elements.Collections;
with AMF.CMOF.Multiplicity_Elements;
with AMF.CMOF.Named_Elements;
with AMF.CMOF.Namespaces;
with AMF.CMOF.Properties.Collections;
with AMF.CMOF.Redefinable_Elements;
with AMF.Internals.CMOF_Features;
with AMF.Internals.CMOF_Multiplicity_Elements;
pragma Elaborate (AMF.Internals.CMOF_Multiplicity_Elements);
with AMF.Internals.CMOF_Typed_Elements;
pragma Elaborate (AMF.Internals.CMOF_Typed_Elements);
with AMF.Visitors;
package AMF.Internals.CMOF_Properties is
package Multiplicity_Elements is
new AMF.Internals.CMOF_Multiplicity_Elements
(AMF.Internals.CMOF_Features.CMOF_Feature_Proxy);
package Typed_Elements is
new AMF.Internals.CMOF_Typed_Elements
(Multiplicity_Elements.CMOF_Multiplicity_Element_Proxy);
type CMOF_Property_Proxy is
limited new Typed_Elements.CMOF_Typed_Element_Proxy
and AMF.CMOF.Properties.CMOF_Property
with null record;
-- XXX These subprograms are stubs
overriding function All_Owned_Elements
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element;
overriding procedure Set_Lower
(Self : not null access CMOF_Property_Proxy;
To : Optional_Integer);
overriding procedure Set_Upper
(Self : not null access CMOF_Property_Proxy;
To : Optional_Unlimited_Natural);
overriding function Includes_Multiplicity
(Self : not null access constant CMOF_Property_Proxy;
M : AMF.CMOF.Multiplicity_Elements.CMOF_Multiplicity_Element_Access)
return Boolean;
overriding function Includes_Cardinality
(Self : not null access constant CMOF_Property_Proxy;
C : Integer)
return Boolean;
overriding function Get_Qualified_Name
(Self : not null access constant CMOF_Property_Proxy)
return Optional_String;
overriding function Is_Distinguishable_From
(Self : not null access constant CMOF_Property_Proxy;
N : AMF.CMOF.Named_Elements.CMOF_Named_Element_Access;
Ns : AMF.CMOF.Namespaces.CMOF_Namespace_Access)
return Boolean;
overriding procedure Set_Is_Leaf
(Self : not null access CMOF_Property_Proxy;
To : Boolean);
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant CMOF_Property_Proxy;
Redefined : AMF.CMOF.Redefinable_Elements.CMOF_Redefinable_Element_Access)
return Boolean;
overriding function Get_Is_Read_Only
(Self : not null access constant CMOF_Property_Proxy)
return Boolean;
overriding procedure Set_Is_Read_Only
(Self : not null access CMOF_Property_Proxy;
To : Boolean);
overriding function Get_Default
(Self : not null access constant CMOF_Property_Proxy)
return Optional_String;
overriding procedure Set_Default
(Self : not null access CMOF_Property_Proxy;
To : Optional_String);
overriding function Get_Is_Composite
(Self : not null access constant CMOF_Property_Proxy)
return Boolean;
overriding procedure Set_Is_Composite
(Self : not null access CMOF_Property_Proxy;
To : Boolean);
overriding function Get_Is_Derived
(Self : not null access constant CMOF_Property_Proxy)
return Boolean;
overriding procedure Set_Is_Derived
(Self : not null access CMOF_Property_Proxy;
To : Boolean);
overriding function Get_Is_Derived_Union
(Self : not null access constant CMOF_Property_Proxy)
return Boolean;
overriding procedure Set_Is_Derived_Union
(Self : not null access CMOF_Property_Proxy;
To : Boolean);
overriding function Get_Class
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Classes.CMOF_Class_Access;
overriding procedure Set_Class
(Self : not null access CMOF_Property_Proxy;
To : AMF.CMOF.Classes.CMOF_Class_Access);
overriding function Get_Owning_Association
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Associations.CMOF_Association_Access;
overriding procedure Set_Owning_Association
(Self : not null access CMOF_Property_Proxy;
To : AMF.CMOF.Associations.CMOF_Association_Access);
overriding function Get_Redefined_Property
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Properties.Collections.Set_Of_CMOF_Property;
overriding function Get_Subsetted_Property
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Properties.Collections.Set_Of_CMOF_Property;
overriding function Get_Opposite
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Properties.CMOF_Property_Access;
-- Getter of Property::opposite.
--
-- In the case where the property is one navigable end of a binary
-- association with both ends navigable, this gives the other end.
overriding procedure Set_Opposite
(Self : not null access CMOF_Property_Proxy;
To : AMF.CMOF.Properties.CMOF_Property_Access);
overriding function Get_Datatype
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Data_Types.CMOF_Data_Type_Access;
-- Getter of Property::datatype.
--
-- The DataType that owns this Property.
overriding procedure Set_Datatype
(Self : not null access CMOF_Property_Proxy;
To : AMF.CMOF.Data_Types.CMOF_Data_Type_Access);
overriding function Get_Association
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Associations.CMOF_Association_Access;
overriding procedure Set_Association
(Self : not null access CMOF_Property_Proxy;
To : AMF.CMOF.Associations.CMOF_Association_Access);
overriding function Opposite
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Properties.CMOF_Property_Access;
overriding function Is_Consistent_With
(Self : not null access constant CMOF_Property_Proxy;
Redefinee : AMF.CMOF.Redefinable_Elements.CMOF_Redefinable_Element_Access)
return Boolean;
overriding function Subsetting_Context
(Self : not null access constant CMOF_Property_Proxy)
return AMF.CMOF.Classifiers.Collections.Set_Of_CMOF_Classifier;
overriding function Is_Navigable
(Self : not null access constant CMOF_Property_Proxy)
return Boolean;
overriding function Is_Attribute
(Self : not null access constant CMOF_Property_Proxy;
P : AMF.CMOF.Properties.CMOF_Property_Access)
return Boolean;
overriding procedure Enter_Element
(Self : not null access constant CMOF_Property_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_Property_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_Property_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_Properties;
|
snapshot/Ada/client-spec.ada | daemonl/openapi-codegen | 0 | 19725 | <gh_stars>0
-- Swagger Petstore
-- This is a sample server Petstore server. You can find out more about Swagger at [http://swagger.io](http://swagger.io) or on [irc.freenode.net, #swagger](http://swagger.io/irc/). For this sample, you can use the api key `special-key` to test the authorization filters.
--
-- OpenAPI spec version: 1.0.0
-- Contact: <EMAIL>
--
-- NOTE: This package is auto generated by the swagger code generator 1.5.0.
-- https://github.com/swagger-api/swagger-codegen.git
-- Do not edit the class manually.with IO.OpenAPI.Model.Default;
with IO.OpenAPI.Api.Models;
with Swagger.Clients;
package IO.OpenAPI.Api.Clients is
type Client_Type is new Swagger.Clients.Client_Type with null record;
-- Add a new pet to the store
procedure addPet
(Client : in out Client_Type;
body : in IO.OpenAPI.Api.Models.object);
-- Update an existing pet
procedure updatePet
(Client : in out Client_Type;
body : in IO.OpenAPI.Api.Models.object);
-- Finds Pets by status
procedure findPetsByStatus
(Client : in out Client_Type;
status : in array;
Result : out array);
-- Finds Pets by tags
procedure findPetsByTags
(Client : in out Client_Type;
tags : in array;
Result : out array);
-- Find pet by ID
procedure getPetById
(Client : in out Client_Type;
petId : in integer;
Result : out Pet);
-- Updates a pet in the store with form data
procedure updatePetWithForm
(Client : in out Client_Type;
petId : in integer;
body : in IO.OpenAPI.Api.Models.object);
-- Deletes a pet
procedure deletePet
(Client : in out Client_Type;
petId : in integer;
api_key : in string);
-- uploads an image
procedure uploadFile
(Client : in out Client_Type;
petId : in integer;
body : in IO.OpenAPI.Api.Models.string;
Result : out ApiResponse);
-- Returns pet inventories by status
procedure getInventory
(Client : in out Client_Type;
Result : out object);
-- Place an order for a pet
procedure placeOrder
(Client : in out Client_Type;
body : in IO.OpenAPI.Api.Models.object;
Result : out Order);
-- Find purchase order by ID
procedure getOrderById
(Client : in out Client_Type;
orderId : in integer;
Result : out Order);
-- Delete purchase order by ID
procedure deleteOrder
(Client : in out Client_Type;
orderId : in integer);
-- Create user
procedure createUser
(Client : in out Client_Type;
body : in IO.OpenAPI.Api.Models.object);
-- Creates list of users with given input array
procedure createUsersWithArrayInput
(Client : in out Client_Type;
body : in IO.OpenAPI.Api.Models.array);
-- Creates list of users with given input array
procedure createUsersWithListInput
(Client : in out Client_Type;
body : in IO.OpenAPI.Api.Models.array);
-- Logs user into the system
procedure loginUser
(Client : in out Client_Type;
username : in string;
password : in string;
Result : out string);
-- Logs out current logged in user session
procedure logoutUser
(Client : in out Client_Type);
-- Get user by user name
procedure getUserByName
(Client : in out Client_Type;
username : in string;
Result : out User);
-- Updated user
procedure updateUser
(Client : in out Client_Type;
username : in string;
body : in IO.OpenAPI.Api.Models.object);
-- Delete user
procedure deleteUser
(Client : in out Client_Type;
username : in string);
end IO.OpenAPI.Api.Clients;
|
programs/oeis/173/A173786.asm | neoneye/loda | 22 | 27745 | ; A173786: Triangle read by rows: T(n,k) = 2^n + 2^k, 0 <= k <= n.
; 2,3,4,5,6,8,9,10,12,16,17,18,20,24,32,33,34,36,40,48,64,65,66,68,72,80,96,128,129,130,132,136,144,160,192,256,257,258,260,264,272,288,320,384,512,513,514,516,520,528,544,576,640,768,1024,1025,1026,1028,1032,1040,1056,1088,1152,1280,1536,2048,2049,2050,2052,2056,2064,2080,2112,2176,2304,2560,3072,4096,4097,4098,4100,4104,4112,4128,4160,4224,4352,4608,5120,6144,8192,8193,8194,8196,8200,8208,8224,8256,8320,8448
lpb $0
mov $2,$0
sub $0,1
seq $2,232089 ; Table read by rows, which consist of 1 followed by 2^k, 0 <= k < n ; n = 0,1,2,3,...
add $1,$2
lpe
add $1,2
mov $0,$1
|
programs/oeis/158/A158673.asm | karttu/loda | 1 | 178984 | <reponame>karttu/loda
; A158673: a(n) = 60*n^2 + 1.
; 1,61,241,541,961,1501,2161,2941,3841,4861,6001,7261,8641,10141,11761,13501,15361,17341,19441,21661,24001,26461,29041,31741,34561,37501,40561,43741,47041,50461,54001,57661,61441,65341,69361,73501,77761,82141,86641,91261,96001,100861,105841,110941,116161,121501,126961,132541,138241,144061,150001,156061,162241,168541,174961,181501,188161,194941,201841,208861,216001,223261,230641,238141,245761,253501,261361,269341,277441,285661,294001,302461,311041,319741,328561,337501,346561,355741,365041,374461,384001,393661,403441,413341,423361,433501,443761,454141,464641,475261,486001,496861,507841,518941,530161,541501,552961,564541,576241,588061,600001,612061,624241,636541,648961,661501,674161,686941,699841,712861,726001,739261,752641,766141,779761,793501,807361,821341,835441,849661,864001,878461,893041,907741,922561,937501,952561,967741,983041,998461,1014001,1029661,1045441,1061341,1077361,1093501,1109761,1126141,1142641,1159261,1176001,1192861,1209841,1226941,1244161,1261501,1278961,1296541,1314241,1332061,1350001,1368061,1386241,1404541,1422961,1441501,1460161,1478941,1497841,1516861,1536001,1555261,1574641,1594141,1613761,1633501,1653361,1673341,1693441,1713661,1734001,1754461,1775041,1795741,1816561,1837501,1858561,1879741,1901041,1922461,1944001,1965661,1987441,2009341,2031361,2053501,2075761,2098141,2120641,2143261,2166001,2188861,2211841,2234941,2258161,2281501,2304961,2328541,2352241,2376061,2400001,2424061,2448241,2472541,2496961,2521501,2546161,2570941,2595841,2620861,2646001,2671261,2696641,2722141,2747761,2773501,2799361,2825341,2851441,2877661,2904001,2930461,2957041,2983741,3010561,3037501,3064561,3091741,3119041,3146461,3174001,3201661,3229441,3257341,3285361,3313501,3341761,3370141,3398641,3427261,3456001,3484861,3513841,3542941,3572161,3601501,3630961,3660541,3690241,3720061
mov $1,$0
pow $1,2
mul $1,60
add $1,1
|
tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/exception_declaration.ads | ouankou/rose | 488 | 26910 | <reponame>ouankou/rose
package Exception_Declaration is
The_Exception : exception;
end Exception_Declaration;
|
Transynther/x86/_processed/NONE/_xt_/i7-8650U_0xd2_notsx.log_6251_1175.asm | ljhsiun2/medusa | 9 | 7743 | .global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r14
push %r15
push %r9
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WT_ht+0xfed, %r15
nop
nop
nop
xor %r14, %r14
and $0xffffffffffffffc0, %r15
movaps (%r15), %xmm7
vpextrq $0, %xmm7, %r9
nop
nop
nop
dec %r11
lea addresses_WC_ht+0xd285, %r10
nop
nop
nop
and %rdx, %rdx
mov (%r10), %rbp
sub $27294, %rbp
lea addresses_UC_ht+0xec61, %rbp
nop
nop
inc %r9
mov (%rbp), %r10w
nop
nop
nop
nop
inc %r14
lea addresses_A_ht+0xd861, %r14
nop
add %rdx, %rdx
movb $0x61, (%r14)
nop
nop
add %r10, %r10
lea addresses_WC_ht+0x162e1, %r14
nop
nop
nop
nop
cmp %rdx, %rdx
mov (%r14), %r9w
nop
nop
nop
nop
nop
inc %r14
lea addresses_A_ht+0x15b61, %rsi
lea addresses_UC_ht+0x6021, %rdi
nop
nop
nop
nop
inc %r9
mov $23, %rcx
rep movsw
nop
nop
nop
nop
sub %r15, %r15
lea addresses_WC_ht+0x615, %rsi
lea addresses_WT_ht+0xbf61, %rdi
nop
nop
nop
nop
nop
inc %r10
mov $64, %rcx
rep movsb
nop
nop
nop
add $5560, %r11
lea addresses_D_ht+0x9861, %rsi
lea addresses_WT_ht+0x1cc61, %rdi
clflush (%rsi)
nop
nop
add %rbp, %rbp
mov $97, %rcx
rep movsw
nop
nop
nop
xor %r15, %r15
lea addresses_UC_ht+0x17861, %r10
clflush (%r10)
nop
nop
nop
nop
sub %r11, %r11
mov $0x6162636465666768, %rdx
movq %rdx, (%r10)
nop
nop
and $54019, %r15
lea addresses_A_ht+0x1d409, %rsi
nop
nop
nop
dec %rdi
movl $0x61626364, (%rsi)
nop
nop
nop
nop
sub %rsi, %rsi
lea addresses_UC_ht+0x1a461, %rdx
nop
and $33189, %r15
mov $0x6162636465666768, %rsi
movq %rsi, %xmm1
vmovups %ymm1, (%rdx)
nop
nop
nop
nop
nop
add %rdi, %rdi
lea addresses_D_ht+0x1e161, %rdx
inc %rdi
mov $0x6162636465666768, %r10
movq %r10, %xmm1
vmovups %ymm1, (%rdx)
nop
nop
nop
nop
nop
dec %r15
lea addresses_UC_ht+0x1898b, %rcx
nop
nop
nop
nop
xor %r15, %r15
mov $0x6162636465666768, %rbp
movq %rbp, %xmm3
movups %xmm3, (%rcx)
nop
nop
nop
and %rcx, %rcx
lea addresses_A_ht+0x1649d, %rsi
lea addresses_A_ht+0x1c549, %rdi
nop
nop
nop
add $53724, %r14
mov $122, %rcx
rep movsw
nop
nop
nop
nop
add %rsi, %rsi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbp
pop %r9
pop %r15
pop %r14
pop %r11
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r14
push %rax
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
// Store
lea addresses_normal+0xd461, %rax
nop
nop
nop
xor $26183, %r11
mov $0x5152535455565758, %rbp
movq %rbp, (%rax)
nop
nop
nop
nop
xor $30100, %rdi
// Store
lea addresses_normal+0x10261, %rax
clflush (%rax)
and %r14, %r14
movb $0x51, (%rax)
add $2627, %rdx
// Store
lea addresses_A+0x11e61, %rax
and $12428, %rdx
movl $0x51525354, (%rax)
nop
nop
add $19792, %r14
// REPMOV
mov $0x261, %rsi
lea addresses_WC+0x1dc61, %rdi
nop
nop
nop
nop
nop
cmp %rax, %rax
mov $121, %rcx
rep movsb
nop
nop
nop
nop
nop
inc %r14
// Faulty Load
lea addresses_normal+0xd461, %rbp
nop
add %r14, %r14
vmovups (%rbp), %ymm7
vextracti128 $0, %ymm7, %xmm7
vpextrq $1, %xmm7, %rsi
lea oracles, %r14
and $0xff, %rsi
shlq $12, %rsi
mov (%r14,%rsi,1), %rsi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbp
pop %rax
pop %r14
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_normal', 'size': 2, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
{'OP': 'STOR', 'dst': {'type': 'addresses_normal', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
{'OP': 'STOR', 'dst': {'type': 'addresses_normal', 'size': 1, 'AVXalign': True, 'NT': False, 'congruent': 9, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_A', 'size': 4, 'AVXalign': False, 'NT': False, 'congruent': 8, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_P', 'congruent': 9, 'same': False}, 'dst': {'type': 'addresses_WC', 'congruent': 11, 'same': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_normal', 'size': 32, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'type': 'addresses_WT_ht', 'size': 16, 'AVXalign': True, 'NT': True, 'congruent': 2, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WC_ht', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 1, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_UC_ht', 'size': 2, 'AVXalign': False, 'NT': False, 'congruent': 10, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_A_ht', 'size': 1, 'AVXalign': False, 'NT': False, 'congruent': 6, 'same': True}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WC_ht', 'size': 2, 'AVXalign': False, 'NT': True, 'congruent': 6, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_A_ht', 'congruent': 8, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 4, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WC_ht', 'congruent': 2, 'same': False}, 'dst': {'type': 'addresses_WT_ht', 'congruent': 8, 'same': True}}
{'OP': 'REPM', 'src': {'type': 'addresses_D_ht', 'congruent': 8, 'same': False}, 'dst': {'type': 'addresses_WT_ht', 'congruent': 11, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 9, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_A_ht', 'size': 4, 'AVXalign': False, 'NT': False, 'congruent': 1, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'size': 32, 'AVXalign': False, 'NT': False, 'congruent': 10, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_D_ht', 'size': 32, 'AVXalign': False, 'NT': False, 'congruent': 6, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'size': 16, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_A_ht', 'congruent': 1, 'same': False}, 'dst': {'type': 'addresses_A_ht', 'congruent': 0, 'same': False}}
{'34': 6251}
34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34
*/
|
programs/oeis/021/A021460.asm | neoneye/loda | 22 | 13568 | <reponame>neoneye/loda<gh_stars>10-100
; A021460: Decimal expansion of 1/456.
; 0,0,2,1,9,2,9,8,2,4,5,6,1,4,0,3,5,0,8,7,7,1,9,2,9,8,2,4,5,6,1,4,0,3,5,0,8,7,7,1,9,2,9,8,2,4,5,6,1,4,0,3,5,0,8,7,7,1,9,2,9,8,2,4,5,6,1,4,0,3,5,0,8,7,7,1,9,2,9,8,2,4,5,6,1,4,0,3,5,0,8,7,7,1,9,2,9,8,2
add $0,1
mov $1,10
pow $1,$0
mul $1,7
div $1,3192
mod $1,10
mov $0,$1
|
SiriRemote/AppleRemote_1FingeTouchPadRightClick.applescript | guileschool/SiriRemoteBTT | 20 | 3605 | (*
The MIT License (MIT)
Copyright (c) 2015 guileschool
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.
http://github.com/guileschool/SiriRemoteBTT
*)
-- ScreenShot( 2nd monitor )
-- get Screens infomation
set resolutions to {}
repeat with p in paragraphs of ¬
(do shell script "system_profiler SPDisplaysDataType | awk '/Resolution:/{ printf \"%s %s\\n\", $2, $4 }'")
set resolutions to resolutions & {{word 1 of p as number, word 2 of p as number}}
end repeat
# `resolutions` now contains a list of size lists;
# e.g., with 2 displays, something like {{2560, 1440}, {1920, 1200}}
set screen to item 1 of resolutions
set width to item 1 of screen
set height to item 2 of screen
--display dialog "width:" & width & ", height:" & height
-- click!
set playsound to POSIX path of ("/System/Library/Sounds/Tink.aiff")
do shell script ("afplay " & playsound & " > /dev/null 2>&1 &")
do shell script "screencapture -T 0 -R" & width & ",0," & width & "," & height & " -c"
tell application "Notes" to activate
tell application "System Events"
tell process "Notes"
set IS_ITUNES_PLAYING to my isPlayingITUNES()
-- screen paste
keystroke "v" using command down
keystroke return
delay 0.5
-- text paste
if IS_ITUNES_PLAYING is true then
set the clipboard to my infoTrack()
keystroke "v" using command down
keystroke return
end if
end tell
end tell
(* 숫자의 앞에 zero 을 입력해 주는 함수 *)
on pad_with_zero(the_number)
if (the_number as integer) < 10 then
return "0" & the_number
else
return the_number as text
end if
end pad_with_zero
(* 숫자(정수값)을 입력 받아 이를 Time(시간) 포맷으로 변환하는 함수 *)
on timeToText(theTime)
set myString to ""
set myString to theTime
set min to myString div 60 as string
set min to my pad_with_zero(min)
set sec to myString mod 60
set sec to my pad_with_zero(sec)
set answer to min & sec
--display dialog answer
return answer
end timeToText
(* 현재 재생중인 트랙의 재생위치정보와 트랙번호를 텍스트 정보로 리턴 *)
on infoTrack()
-- "next" command moves to next track.
try
tell application "iTunes"
set _trackname to the name of the current track
set _trackno to the track number of the current track
set _trackno to my pad_with_zero(_trackno)
set _time to get player position
set _time to _time as integer
set _playtime to my timeToText(_time)
--display dialog "E" & _trackno & "T" & _playtime
end tell
on error
display alert "심각한 장애가 발생하였습니다! : 화면캡쳐"
end try
return "▲ " & _trackname & "_E" & _trackno & "T" & _playtime
end infoTrack
(* 현재 음악이나 동영상이 재생중인지 여부를 확인 *)
on isPlayingITUNES()
tell application "System Events"
if exists process "iTunes" then
-- PLAY / PAUSE
tell application "iTunes"
set state to get player state
if state is playing then
return true
else
return false
end if
end tell
end if
return false
end tell
end isPlayingITUNES
|
other.7z/SFC.7z/SFC/ソースデータ/ヨッシーアイランド/日本_Ver2/sfc/ys_w18.asm | prismotizm/gigaleak | 0 | 104922 | <filename>other.7z/SFC.7z/SFC/ソースデータ/ヨッシーアイランド/日本_Ver2/sfc/ys_w18.asm<gh_stars>0
Name: ys_w18.asm
Type: file
Size: 13810
Last-Modified: '2016-05-13T04:51:45Z'
SHA-1: AB80D8B48446CF86F70508812585CC166F5C84C8
Description: null
|
projects/batfish/src/main/antlr4/org/batfish/grammar/cisco_nxos/CiscoNxos_aaa.g4 | zabrewer/batfish | 763 | 5762 | <filename>projects/batfish/src/main/antlr4/org/batfish/grammar/cisco_nxos/CiscoNxos_aaa.g4
parser grammar CiscoNxos_aaa;
import CiscoNxos_common;
options {
tokenVocab = CiscoNxosLexer;
}
aaa_group_name
:
// 1-127 characters
WORD
;
aaag_deadtime_value
:
// 0-1440
uint16
;
s_aaa
:
AAA
(
aaa_group
| aaa_accounting
| aaa_authentication
| aaa_authorization
)
;
aaa_group
:
GROUP SERVER
(
aaag_radius
| aaag_tacacsp
)
;
aaag_radius
:
RADIUS name = aaa_group_name NEWLINE
(
aaagr_deadtime
| aaagr_no
| aaagr_server
| aaagr_source_interface
| aaagr_use_vrf
)*
;
aaagr_deadtime
:
DEADTIME aaag_deadtime_value NEWLINE
;
aaagr_no
:
NO aaagr_no_source_interface
;
aaagr_no_source_interface
:
SOURCE_INTERFACE NEWLINE
;
aaagr_server
:
SERVER
(
aaagrs_dns
| aaagrs_ip4
| aaagrs_ip6
)
;
aaagrs_dns
:
dns = WORD NEWLINE
;
aaagrs_ip4
:
ip = ip_address NEWLINE
;
aaagrs_ip6
:
ip6 = ipv6_address NEWLINE
;
aaagr_source_interface
:
SOURCE_INTERFACE name = interface_name NEWLINE
;
aaagr_use_vrf
:
USE_VRF name = vrf_name NEWLINE
;
aaag_tacacsp
:
TACACSP name = aaa_group_name NEWLINE
(
aaagt_deadtime
| aaagt_no
| aaagt_server
| aaagt_source_interface
| aaagt_use_vrf
)*
;
aaagt_deadtime
:
DEADTIME aaag_deadtime_value NEWLINE
;
aaagt_no
:
NO aaagt_no_source_interface
;
aaagt_no_source_interface
:
SOURCE_INTERFACE NEWLINE
;
aaagt_server
:
SERVER
(
aaagts_dns
| aaagts_ip4
| aaagts_ip6
)
;
aaagts_dns
:
dns = WORD NEWLINE
;
aaagts_ip4
:
ip = ip_address NEWLINE
;
aaagts_ip6
:
ip6 = ipv6_address NEWLINE
;
aaagt_source_interface
:
SOURCE_INTERFACE name = interface_name NEWLINE
;
aaagt_use_vrf
:
USE_VRF name = vrf_name NEWLINE
;
aaa_accounting
:
ACCOUNTING aaa_accounting_default
;
aaa_accounting_default
:
DEFAULT
(
GROUP groups += aaa_group_name+
)? LOCAL? NEWLINE
;
aaa_authentication
:
AUTHENTICATION aaa_authentication_login
;
aaa_authentication_login
:
LOGIN
(
aaa_authentication_login_default
| aaa_authentication_login_error_enable
)
;
aaa_authentication_login_default
:
DEFAULT
(
GROUP groups += aaa_group_name+
)? LOCAL? NEWLINE
;
aaa_authentication_login_error_enable
:
ERROR_ENABLE NEWLINE
;
aaa_authorization
:
AUTHORIZATION
(
aaa_authorization_commands
| aaa_authorization_config_commands
)
;
aaa_authorization_commands
:
COMMANDS aaa_authorization_commands_default
;
aaa_authorization_commands_default
:
DEFAULT
(
GROUP groups += aaa_group_name+
)? LOCAL? NEWLINE
;
aaa_authorization_config_commands
:
CONFIG_COMMANDS aaa_authorization_config_commands_default
;
aaa_authorization_config_commands_default
:
DEFAULT
(
GROUP groups += aaa_group_name+
)? LOCAL? NEWLINE
;
|
source/oasis/program-elements-parenthesized_expressions.ads | reznikmm/gela | 0 | 13192 | -- SPDX-FileCopyrightText: 2019 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
package Program.Elements.Parenthesized_Expressions is
pragma Pure (Program.Elements.Parenthesized_Expressions);
type Parenthesized_Expression is
limited interface and Program.Elements.Expressions.Expression;
type Parenthesized_Expression_Access is
access all Parenthesized_Expression'Class with Storage_Size => 0;
not overriding function Expression
(Self : Parenthesized_Expression)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
type Parenthesized_Expression_Text is limited interface;
type Parenthesized_Expression_Text_Access is
access all Parenthesized_Expression_Text'Class with Storage_Size => 0;
not overriding function To_Parenthesized_Expression_Text
(Self : in out Parenthesized_Expression)
return Parenthesized_Expression_Text_Access is abstract;
not overriding function Left_Bracket_Token
(Self : Parenthesized_Expression_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Right_Bracket_Token
(Self : Parenthesized_Expression_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Parenthesized_Expressions;
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0x48.log_21829_536.asm | ljhsiun2/medusa | 9 | 245251 | <gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r13
push %r8
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_D_ht+0x2450, %rsi
lea addresses_normal_ht+0x19102, %rdi
nop
nop
nop
add %r10, %r10
mov $48, %rcx
rep movsq
nop
nop
nop
nop
inc %r10
lea addresses_UC_ht+0x1187c, %r11
nop
nop
nop
nop
nop
and $37975, %r8
mov $0x6162636465666768, %rax
movq %rax, %xmm5
and $0xffffffffffffffc0, %r11
movaps %xmm5, (%r11)
nop
nop
inc %r10
lea addresses_WT_ht+0xa102, %r8
clflush (%r8)
sub %rsi, %rsi
mov (%r8), %r11d
nop
add $50553, %rax
lea addresses_WC_ht+0x1ac82, %r10
nop
xor $8149, %rcx
movl $0x61626364, (%r10)
nop
nop
nop
nop
nop
and %rdi, %rdi
lea addresses_WT_ht+0xa302, %rcx
nop
nop
nop
nop
add %rsi, %rsi
vmovups (%rcx), %ymm4
vextracti128 $1, %ymm4, %xmm4
vpextrq $0, %xmm4, %r10
nop
nop
nop
xor $41957, %rsi
lea addresses_WC_ht+0x1cd42, %rsi
lea addresses_A_ht+0x12582, %rdi
nop
nop
nop
nop
nop
xor %r8, %r8
mov $56, %rcx
rep movsq
nop
nop
sub $33675, %r10
lea addresses_D_ht+0xc492, %rsi
nop
nop
nop
nop
sub $39221, %rdi
movups (%rsi), %xmm1
vpextrq $1, %xmm1, %rcx
nop
nop
cmp $48337, %rax
lea addresses_WC_ht+0x63fe, %r8
clflush (%r8)
nop
nop
and %rax, %rax
mov (%r8), %cx
dec %r10
lea addresses_WC_ht+0xe38a, %rsi
lea addresses_D_ht+0x18f02, %rdi
nop
nop
nop
nop
nop
dec %r13
mov $100, %rcx
rep movsw
nop
nop
sub $60753, %r10
pop %rsi
pop %rdi
pop %rcx
pop %rax
pop %r8
pop %r13
pop %r11
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r12
push %r13
push %rax
push %rbx
push %rdx
push %rsi
// Load
lea addresses_UC+0x1e349, %rsi
nop
nop
nop
nop
and $39120, %r10
mov (%rsi), %rax
nop
xor %r10, %r10
// Store
lea addresses_PSE+0x1aeaa, %r12
nop
nop
nop
nop
nop
and %r13, %r13
movb $0x51, (%r12)
add %rsi, %rsi
// Faulty Load
lea addresses_RW+0x9b02, %r13
nop
xor %r10, %r10
vmovups (%r13), %ymm3
vextracti128 $1, %ymm3, %xmm3
vpextrq $1, %xmm3, %r12
lea oracles, %r13
and $0xff, %r12
shlq $12, %r12
mov (%r13,%r12,1), %r12
pop %rsi
pop %rdx
pop %rbx
pop %rax
pop %r13
pop %r12
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_RW', 'AVXalign': True, 'congruent': 0, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_UC', 'AVXalign': False, 'congruent': 0, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_PSE', 'AVXalign': False, 'congruent': 2, 'size': 1, 'same': False, 'NT': True}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_RW', 'AVXalign': False, 'congruent': 0, 'size': 32, 'same': True, 'NT': False}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'type': 'addresses_D_ht', 'congruent': 0, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 8, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'AVXalign': True, 'congruent': 1, 'size': 16, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WT_ht', 'AVXalign': False, 'congruent': 9, 'size': 4, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WC_ht', 'AVXalign': False, 'congruent': 7, 'size': 4, 'same': True, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WT_ht', 'AVXalign': False, 'congruent': 10, 'size': 32, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WC_ht', 'congruent': 5, 'same': False}, 'dst': {'type': 'addresses_A_ht', 'congruent': 5, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'congruent': 3, 'size': 16, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'congruent': 2, 'size': 2, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WC_ht', 'congruent': 1, 'same': False}, 'dst': {'type': 'addresses_D_ht', 'congruent': 10, 'same': False}}
{'32': 21829}
32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32
*/
|
coverage/IN_CTS/0503-COVERAGE-anv-nir-apply-pipeline-layout-560/work/variant/2_spirv_opt_asm/shader.frag.asm | asuonpaa/ShaderTests | 0 | 85448 | ; SPIR-V
; Version: 1.0
; Generator: Khronos Glslang Reference Front End; 10
; Bound: 110
; Schema: 0
OpCapability Shader
%1 = OpExtInstImport "GLSL.std.450"
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %4 "main" %88
OpExecutionMode %4 OriginUpperLeft
OpSource ESSL 320
OpName %4 "main"
OpName %8 "f"
OpName %12 "buf1"
OpMemberName %12 0 "_GLF_uniform_float_values"
OpName %14 ""
OpName %25 "i"
OpName %33 "buf0"
OpMemberName %33 0 "_GLF_uniform_int_values"
OpName %35 ""
OpName %41 "buf2"
OpMemberName %41 0 "one"
OpName %43 ""
OpName %88 "_GLF_color"
OpDecorate %11 ArrayStride 16
OpMemberDecorate %12 0 Offset 0
OpDecorate %12 Block
OpDecorate %14 DescriptorSet 0
OpDecorate %14 Binding 1
OpDecorate %32 ArrayStride 16
OpMemberDecorate %33 0 Offset 0
OpDecorate %33 Block
OpDecorate %35 DescriptorSet 0
OpDecorate %35 Binding 0
OpMemberDecorate %41 0 Offset 0
OpDecorate %41 Block
OpDecorate %43 DescriptorSet 0
OpDecorate %43 Binding 2
OpDecorate %88 Location 0
%2 = OpTypeVoid
%3 = OpTypeFunction %2
%6 = OpTypeFloat 32
%7 = OpTypePointer Function %6
%9 = OpTypeInt 32 0
%10 = OpConstant %9 2
%11 = OpTypeArray %6 %10
%12 = OpTypeStruct %11
%13 = OpTypePointer Uniform %12
%14 = OpVariable %13 Uniform
%15 = OpTypeInt 32 1
%16 = OpConstant %15 0
%17 = OpTypePointer Uniform %6
%24 = OpTypePointer Function %15
%32 = OpTypeArray %15 %10
%33 = OpTypeStruct %32
%34 = OpTypePointer Uniform %33
%35 = OpVariable %34 Uniform
%36 = OpConstant %15 1
%37 = OpTypePointer Uniform %15
%40 = OpTypeVector %6 2
%41 = OpTypeStruct %40
%42 = OpTypePointer Uniform %41
%43 = OpVariable %42 Uniform
%44 = OpConstant %9 0
%48 = OpConstant %15 2
%50 = OpTypeBool
%52 = OpConstant %9 1
%58 = OpConstant %6 256
%59 = OpConstant %6 2
%73 = OpConstant %6 0.00999999978
%86 = OpTypeVector %6 4
%87 = OpTypePointer Output %86
%88 = OpVariable %87 Output
%4 = OpFunction %2 None %3
%5 = OpLabel
%8 = OpVariable %7 Function
%25 = OpVariable %24 Function
%18 = OpAccessChain %17 %14 %16 %16
%19 = OpLoad %6 %18
OpStore %8 %19
OpBranch %20
%20 = OpLabel
%109 = OpPhi %6 %19 %5 %108 %23
OpStore %25 %16
OpLoopMerge %22 %23 None
OpBranch %26
%26 = OpLabel
%108 = OpPhi %6 %109 %20 %62 %27
%107 = OpPhi %15 %16 %20 %64 %27
%38 = OpAccessChain %37 %35 %16 %36
%39 = OpLoad %15 %38
%45 = OpAccessChain %17 %43 %16 %44
%46 = OpLoad %6 %45
%47 = OpConvertFToS %15 %46
%49 = OpExtInst %15 %1 SClamp %39 %47 %48
%51 = OpINotEqual %50 %107 %49
OpLoopMerge %28 %27 None
OpBranchConditional %51 %27 %28
%27 = OpLabel
%53 = OpAccessChain %17 %43 %16 %52
%54 = OpLoad %6 %53
%57 = OpFOrdGreaterThan %50 %54 %19
%60 = OpSelect %6 %57 %58 %59
%62 = OpFDiv %6 %108 %60
OpStore %8 %62
%64 = OpIAdd %15 %107 %36
OpStore %25 %64
OpBranch %26
%28 = OpLabel
OpBranch %23
%23 = OpLabel
%67 = OpAccessChain %17 %43 %16 %52
%68 = OpLoad %6 %67
%69 = OpFOrdGreaterThan %50 %19 %68
OpBranchConditional %69 %20 %22
%22 = OpLabel
%71 = OpAccessChain %17 %14 %16 %36
%72 = OpLoad %6 %71
%74 = OpFSub %6 %72 %73
%75 = OpFOrdGreaterThan %50 %108 %74
OpSelectionMerge %77 None
OpBranchConditional %75 %76 %77
%76 = OpLabel
%81 = OpFAdd %6 %72 %73
%82 = OpFOrdLessThan %50 %108 %81
OpBranch %77
%77 = OpLabel
%83 = OpPhi %50 %75 %22 %82 %76
OpSelectionMerge %85 None
OpBranchConditional %83 %84 %102
%84 = OpLabel
%89 = OpAccessChain %37 %35 %16 %16
%90 = OpLoad %15 %89
%91 = OpConvertSToF %6 %90
%94 = OpConvertSToF %6 %39
%101 = OpCompositeConstruct %86 %91 %94 %94 %91
OpStore %88 %101
OpBranch %85
%102 = OpLabel
%105 = OpConvertSToF %6 %39
%106 = OpCompositeConstruct %86 %105 %105 %105 %105
OpStore %88 %106
OpBranch %85
%85 = OpLabel
OpReturn
OpFunctionEnd
|
oeis/275/A275198.asm | neoneye/loda-programs | 11 | 22684 | ; A275198: Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 14.
; Submitted by <NAME>(s3)
; 1,1,1,1,2,1,1,3,3,1,1,4,6,4,1,1,5,10,10,5,1,1,6,1,6,1,6,1,1,7,7,7,7,7,7,1,1,8,0,0,0,0,0,8,1,1,9,8,0,0,0,0,8,9,1,1,10,3,8,0,0,0,8,3,10,1,1,11,13,11,8,0,0,8,11,13,11,1,1,12,10,10,5,8,0,8,5,10,10,12,1,1,13,8,6,1,13,8,8,13
lpb $0
add $1,1
sub $0,$1
lpe
bin $1,$0
mod $1,14
mov $0,$1
|
bin/JWASM/Samples/Res2Inc.asm | Abd-Beltaji/ASMEMU | 3 | 169730 | <filename>bin/JWASM/Samples/Res2Inc.asm<gh_stars>1-10
;--- Res2Inc.asm.
;--- convert .RES file to assembly include file.
;--- this program uses C runtime functions
;--- Win32 binary:
;--- assemble: jwasm -c -coff res2inc.asm crtexe.asm
;--- link: link res2inc.obj crtexe.obj msvcrt.lib
;--- Linux binary:
;--- assemble: jwasm -zcw -elf -D?MSC=0 -Fo res2inc.o res2inc.asm
;--- link: gcc -o res2inc res2inc.o
.386
.MODEL FLAT, stdcall
option casemap:none
option proc:private
?USEDYN equ 1 ;0=use static CRT, 1=use dynamic CRT
ifndef ?MSC
?MSC equ 1 ;0=use gcc, 1=use ms CRT
endif
SEEK_SET equ 0
SEEK_END equ 2
fopen proto c :ptr BYTE, :ptr BYTE
fclose proto c :ptr
fseek proto c :ptr, :DWORD, :DWORD
ftell proto c :ptr
fread proto c :ptr BYTE, :DWORD, :DWORD, :ptr
fwrite proto c :ptr BYTE, :DWORD, :DWORD, :ptr
printf proto c :ptr byte, :vararg
sprintf proto c :ptr byte, :ptr byte, :vararg
malloc proto c :DWORD
free proto c :ptr
qsort proto c :ptr, :DWORD, :DWORD, :ptr
lf equ 0Ah
LPSTR typedef ptr byte
CStr macro text:VARARG
local x
.const
x db text,0
.code
exitm <offset x>
endm
;--- errno access
ife ?USEDYN
externdef c errno:dword ;errno is global var
else
__errno macro
;--- if errno is to be defined as a function call
if ?MSC
_errno proto c ;ms CRT
call _errno
else
__errno_location proto c ;gcc
call __errno_location
endif
mov eax,[eax]
exitm <eax>
endm
errno textequ <__errno()>
endif
;--- .RES header
;--- MS 32-bit .RSRC file format if type + name ordinal
reshdr struct
size_ dd ? ;size of resource data
hdrsize dd ? ;size of header (20h if both type and id are "by ordinal")
typef dw ? ;if -1, ordinal in restype
restype dw ? ;resource type
idf dw ? ;if -1. ordinal in id
id dw ? ;resource ID
dversion dd ? ;data version
memflags dw ? ;memory flags
langId dw ? ;language ID
version dd ? ;version
flags dd ? ;flags
reshdr ends
.DATA
pszFileInp LPSTR 0
pszFileOut LPSTR 0
fVerbose BYTE 0 ;display maximum msgs
fQuiet BYTE 0 ;display no msgs
fGeneric BYTE 0 ;generic syntax, no Masm struct initializer
.CONST
szUsage label byte
db "res2inc: convert compiled resource (.RES) file to assembly include file",lf
db "usage: res2inc [options] src_file dst_file",lf
db " options:",lf
db " -v: verbose",lf
db " -q: quiet",lf
db " -g: generic (don't use Masm struct initializer)",lf
db 0
.CODE
;--- scan command line for options
getoption proc uses esi pszArgument:ptr byte
mov esi, pszArgument
mov eax,[esi]
cmp al,'/'
jz @F
cmp al,'-'
jnz getoption_1
@@:
shr eax,8
or al,20h
cmp ax,"v"
jnz @F
mov fVerbose, 1
jmp done
@@:
cmp ax,"q"
jnz @F
mov fQuiet, 1
jmp done
@@:
cmp ax,"g"
jnz @F
mov fGeneric, 1
jmp done
@@:
jmp error
getoption_1:
.if (!pszFileInp)
mov pszFileInp, esi
.elseif (!pszFileOut)
mov pszFileOut, esi
.else
jmp error
.endif
done:
clc
ret
error:
stc
ret
getoption endp
;--- compare proc for qsort()
cmpproc proc c uses ebx item1:ptr, item2:ptr
mov ebx, item1
mov ebx, [ebx]
mov edx, item2
mov edx, [edx]
movzx eax, [ebx].reshdr.restype
movzx ecx, [edx].reshdr.restype
sub eax, ecx
jnz exit
movzx eax, [ebx].reshdr.id
movzx ecx, [edx].reshdr.id
sub eax, ecx
jnz exit
movzx eax, [ebx].reshdr.langId
movzx ecx, [edx].reshdr.langId
sub eax, ecx
exit:
ret
cmpproc endp
;--- convert content of buffer to include lines
WriteContent proc uses ebx esi edi pMem:ptr, dwSize:dword, hFile:dword
local cnt:dword
local hdrarray:dword
local dwTypes:dword
local dwIDs:dword
local dwLangs:dword
local currtype:dword
local currid:dword
local currlang:dword
local szLine[256]:byte
;--- first, scan the file buffer and create an array of resource headers
;--- onto the stack. EDI will hold the resource counter.
mov esi,pMem
mov ebx, esi
add ebx, dwSize
add esi, sizeof reshdr ;skip NULL header
mov cnt, 0
.while (esi < ebx)
push esi ;store entry onto the stack
;--- currently, both type and id must be ordinal
mov al,fVerbose
lea edi, [esi].reshdr.typef
.if ( word ptr [edi] != -1 )
lea ecx, szLine
.repeat
mov ax,[edi]
mov [ecx],al
add edi,2
inc ecx
.until ( ax == 0 )
mov ecx, esi
sub ecx, pMem
invoke printf, CStr("hdr at %4X: error! resource type %s not ordinal",lf), ecx, addr szLine
mov al,0
.else
lea edi, [esi].reshdr.idf
.endif
.if ( word ptr [edi] != -1 )
lea ecx, szLine
.repeat
mov ax,[edi]
mov [ecx],al
add edi,2
inc ecx
.until ( ax == 0 )
mov ecx, esi
sub ecx, pMem
invoke printf, CStr("hdr at %4X: error! resource id %s not ordinal",lf), ecx, addr szLine
mov al,0
.endif
.if ( al )
mov eax, esi
sub eax, pMem
invoke printf, CStr("hdr at %4X: type=%2u, ID=%4u, lang=%X [ hdrsize=%X size=%4X memflags=%4X flags=%X ]",lf), eax,
[esi].reshdr.restype, [esi].reshdr.id, [esi].reshdr.langId, [esi].reshdr.hdrsize, [esi].reshdr.size_, [esi].reshdr.memflags, [esi].reshdr.flags
.endif
mov ecx,[esi].reshdr.hdrsize
add ecx, 4-1 ;align _size to dword
and ecx, not (4-1)
mov edx,[esi].reshdr.size_
add edx, 4-1 ;align _size to dword
and edx, not (4-1)
add edx, ecx
lea esi,[esi+edx]
inc cnt
.endw
;--- check if the current pointer is exactly at the file's end.
mov eax, esi
sub eax, pMem
mov edx, ebx
sub edx, pMem
.if ( eax != edx )
invoke printf, CStr("end reached: expected=%X, real=%X",lf), eax, edx
.endif
mov edi, cnt
and edi, edi
jz @exit
mov hdrarray, esp
;--- sort the resource header array
mov edx, esp
invoke qsort, edx, edi, DWORD, offset cmpproc
.if ( fVerbose )
invoke printf, CStr("sort done",lf)
.endif
if 0
;--- for debugging: print the sorted array
mov esi, esp
mov ebx, edi
.while ebx
lodsd
mov ecx, eax
sub ecx, pMem
invoke printf, CStr("hdr at %8X: type=%2X, ID=%3X, lang=%4X",lf), ecx,
[eax].reshdr.restype, [eax].reshdr.id, [eax].reshdr.langId
dec ebx
.endw
endif
;--- count resource types
mov esi, hdrarray
mov ebx, edi
mov currtype, -1
mov dwTypes, 0
.while ebx
lodsd
movzx ecx, [eax].reshdr.restype
.if ( ecx != currtype )
mov currtype, ecx
inc dwTypes
.endif
dec ebx
.endw
;--- first level, write resource directory and enum resource type entries
.if ( fGeneric )
invoke sprintf, addr szLine, CStr("@rsrc_start dw 0,0,0,0,0,0,0,%u",lf), dwTypes
.else
invoke sprintf, addr szLine, CStr("IMAGE_RESOURCE_DIRECTORY <0,0,0,0,0,%u>",lf), dwTypes
.endif
invoke fwrite, addr szLine, 1, eax, hFile
mov esi, hdrarray
mov ebx, edi
mov currtype, -1
.while ebx
lodsd
movzx ecx, [eax].reshdr.restype
.if ( ecx != currtype )
mov currtype, ecx
.if ( fGeneric )
invoke sprintf, addr szLine, CStr("dd %u, @resource_type_%u + 80000000h - @rsrc_start",lf), ecx, ecx
.else
invoke sprintf, addr szLine, CStr("IMAGE_RESOURCE_DIRECTORY_ENTRY < <%u>, <SECTIONREL @resource_type_%u + 80000000h> >",lf), ecx, ecx
.endif
invoke fwrite, addr szLine, 1, eax, hFile
.endif
dec ebx
.endw
;--- second level, write resource type directories and ID entries
mov esi, hdrarray
mov ebx, edi
mov currtype, -1
.while ebx
lodsd
movzx ecx, [eax].reshdr.restype
.if ( ecx != currtype )
mov currtype, ecx
push esi
push ebx
push eax
mov dwIDs, 1
movzx ecx, [eax].reshdr.id
mov currid,ecx
dec ebx
.while ebx
lodsd
movzx ecx, [eax].reshdr.restype
.break .if ecx != currtype
movzx ecx, [eax].reshdr.id
.if ( ecx != currid )
mov currid, ecx
inc dwIDs
.endif
dec ebx
.endw
.if ( fGeneric )
invoke sprintf, addr szLine, CStr("@resource_type_%u dw 0,0,0,0,0,0,0,%u",lf), currtype, dwIDs
.else
invoke sprintf, addr szLine, CStr("@resource_type_%u IMAGE_RESOURCE_DIRECTORY <0,0,0,0,0,%u>",lf), currtype, dwIDs
.endif
invoke fwrite, addr szLine, 1, eax, hFile
pop eax
pop ebx
pop esi
push esi
push ebx
.while dwIDs
dec dwIDs
movzx ecx, [eax].reshdr.id
mov currid, ecx
.if ( fGeneric )
invoke sprintf, addr szLine, CStr("dd %u, @resource_id_%u + 80000000h - @rsrc_start",lf), ecx, ecx
.else
invoke sprintf, addr szLine, CStr("IMAGE_RESOURCE_DIRECTORY_ENTRY < <%u>, <SECTIONREL @resource_id_%u + 80000000h> >",lf), ecx, ecx
.endif
invoke fwrite, addr szLine, 1, eax, hFile
.break .if dwIDs == 0
.repeat
lodsd
movzx edx, [eax].reshdr.id
.until edx != currid
.endw
pop ebx
pop esi
.endif
dec ebx
.endw
;--- third level, write resource ID directories and language entries
mov esi, hdrarray
mov ebx, edi
mov currid, -1
.while ebx
lodsd
movzx ecx, [eax].reshdr.id
.if ( ecx != currid )
mov currid, ecx
push esi
push ebx
push eax
mov dwLangs, 1
movzx ecx, [eax].reshdr.langId
mov currlang,ecx
dec ebx
.while ebx
lodsd
movzx ecx, [eax].reshdr.id
.break .if ecx != currid
movzx ecx, [eax].reshdr.langId
.if ( ecx != currlang )
mov currlang, ecx
inc dwLangs
.endif
dec ebx
.endw
.if ( fGeneric )
invoke sprintf, addr szLine, CStr("@resource_id_%u dw 0,0,0,0,0,0,0,%u",lf), currid, dwLangs
.else
invoke sprintf, addr szLine, CStr("@resource_id_%u IMAGE_RESOURCE_DIRECTORY <0,0,0,0,0,%u>",lf), currid, dwLangs
.endif
invoke fwrite, addr szLine, 1, eax, hFile
pop eax
pop ebx
pop esi
push esi
push ebx
.while dwLangs
dec dwLangs
movzx ecx, [eax].reshdr.langId
mov currlang, ecx
.if ( fGeneric )
invoke sprintf, addr szLine, CStr("dd 0%Xh, @resource_id_%u_lang_%X - @rsrc_start",lf), currlang, currid, currlang
.else
invoke sprintf, addr szLine, CStr("IMAGE_RESOURCE_DIRECTORY_ENTRY < <0%Xh>, <SECTIONREL @resource_id_%u_lang_%X> >",lf), currlang, currid, currlang
.endif
invoke fwrite, addr szLine, 1, eax, hFile
.break .if dwLangs == 0
.repeat
lodsd
movzx edx, [eax].reshdr.langId
.until edx != currlang
.endw
pop ebx
pop esi
.endif
dec ebx
.endw
;--- last level, write resource data
mov esi, hdrarray
mov ebx, edi
.while ebx
lodsd
push eax
movzx ecx, [eax].reshdr.id
movzx edx, [eax].reshdr.langId
mov currid, ecx
mov currlang, edx
.if ( fGeneric )
invoke sprintf, addr szLine, CStr("@resource_id_%u_lang_%X dd IMAGEREL @resource_id_%u_lang_%X_data, @size_resource_id_%u_lang_%X, 0, 0",lf), ecx, edx, ecx, edx, ecx, edx
.else
invoke sprintf, addr szLine, CStr("@resource_id_%u_lang_%X IMAGE_RESOURCE_DATA_ENTRY <IMAGEREL @resource_id_%u_lang_%X_data, @size_resource_id_%u_lang_%X, 0, 0>",lf), ecx, edx, ecx, edx, ecx, edx
.endif
invoke fwrite, addr szLine, 1, eax, hFile
pop eax
pushad
mov ebx, [eax].reshdr.size_
mov esi, [eax].reshdr.hdrsize
add esi, eax
lea edi, szLine
invoke sprintf, addr szLine, CStr("@resource_id_%u_lang_%X_data "), currid, currlang
add edi, eax
.while ebx
invoke sprintf, edi, CStr("db ")
add edi, eax
.if ( ebx > 16 )
mov ecx, 16
.else
mov ecx, ebx
.endif
sub ebx, ecx
.while ecx
lodsb
movzx eax, al
push ecx
invoke sprintf, edi, CStr("%u"), eax
add edi, eax
pop ecx
dec ecx
.if ( ecx )
mov al,','
stosb
.endif
.endw
mov al,lf
stosb
lea eax, szLine
sub edi, eax
invoke fwrite, addr szLine, 1, edi, hFile
lea edi, szLine
.endw
popad
invoke sprintf, addr szLine, CStr("@size_resource_id_%u_lang_%X equ $ - @resource_id_%u_lang_%X_data",lf), currid, currlang, currid, currlang
invoke fwrite, addr szLine, 1, eax, hFile
invoke sprintf, addr szLine, CStr("align 4",lf)
invoke fwrite, addr szLine, 1, eax, hFile
dec ebx
.endw
lea esp, [esp+edi*4]
@exit:
ret
WriteContent endp
;*** main proc ***
main proc c public argc:dword, argv:ptr
local dwWritten:DWORD
local dwSize:DWORD
local bError:DWORD
mov bError, 1
cmp argc,2
jb displayusage
mov ecx, 1
mov ebx,argv
.while (ecx < argc)
push ecx
invoke getoption, dword ptr [ebx+ecx*4]
pop ecx
jc displayusage
inc ecx
.endw
cmp pszFileOut, 0
jz displayusage
;--- open and read input file
invoke fopen, pszFileInp, CStr("rb")
.if ( !eax )
invoke printf, CStr("fopen('%s') failed [%u]",lf), pszFileInp, errno
jmp main_ex
.endif
mov ebx, eax
invoke fseek, ebx, 0, SEEK_END
invoke ftell, ebx
mov dwSize, eax
invoke fseek, ebx, 0, SEEK_SET
.if fVerbose
invoke printf, CStr("res2inc: file '%s', size %u bytes",lf), pszFileInp, dwSize
.endif
invoke malloc, dwSize
.if (!eax)
invoke fclose, ebx
invoke printf, CStr("out of memory",lf)
jmp main_ex
.endif
mov esi, eax
invoke fread, esi, 1, dwSize, ebx
push eax
invoke fclose, ebx
pop eax
.if ( eax != dwSize )
invoke printf, CStr("fread() failed [%u]",lf), errno
jmp main_ex
.endif
;--- open output file
invoke fopen, pszFileOut, CStr("wb")
.if ( !eax )
invoke printf, CStr("fopen('%s') failed [%u]",lf), pszFileOut, errno
jmp main_ex
.endif
mov ebx, eax
;--- process data and write output file
invoke WriteContent, esi, dwSize, ebx
;--- cleanup
invoke fclose, ebx
invoke free, esi
.if (!fQuiet)
invoke printf, CStr("res2inc: file '%s' done",lf), pszFileInp
.endif
mov bError, 0
main_ex:
mov eax, bError
ret
displayusage:
invoke printf, CStr("%s"), addr szUsage
jmp main_ex
main endp
END
|
alloy4fun_models/trainstlt/models/0/QL4xhLXvQdFi2PA7Y.als | Kaixi26/org.alloytools.alloy | 0 | 652 | open main
pred idQL4xhLXvQdFi2PA7Y_prop1 {
all t : Track | t.signal not in Green
}
pred __repair { idQL4xhLXvQdFi2PA7Y_prop1 }
check __repair { idQL4xhLXvQdFi2PA7Y_prop1 <=> prop1o } |
Groups/Abelian/Definition.agda | Smaug123/agdaproofs | 4 | 12153 | {-# OPTIONS --safe --warning=error --without-K #-}
open import Setoids.Setoids
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
open import Groups.Definition
module Groups.Abelian.Definition where
record AbelianGroup {a} {b} {A : Set a} {S : Setoid {a} {b} A} {_·_ : A → A → A} (G : Group S _·_) : Set (lsuc a ⊔ b) where
open Setoid S
field
commutative : {a b : A} → (a · b) ∼ (b · a)
|
test/succeed/TerminationListInsertionNaive.agda | asr/agda-kanso | 1 | 9450 | module TerminationListInsertionNaive where
data List (A : Set) : Set where
[] : List A
_::_ : A -> List A -> List A
infixr 50 _::_
-- non-deterministic choice
postulate
_⊕_ : {A : Set} -> A -> A -> A
infixl 10 _⊕_
-- a funny formulation of insert
-- insert (a :: l) inserts a into l
--
-- this example cannot be handled with subpatterns
-- it is done with structured orders
-- could also be done with sized types
insert : {A : Set} -> List A -> List A
insert [] = []
insert (a :: []) = a :: []
insert (a :: b :: bs) = a :: b :: bs ⊕ -- case a <= b
b :: insert (a :: bs) -- case a > b
-- list flattening
-- termination using structured orders
flat : {A : Set} -> List (List A) -> List A
flat [] = []
flat ([] :: ll) = flat ll
flat ((x :: l) :: ll) = x :: flat (l :: ll)
{- generates two recursive calls with the following call matrices
[] :: ll (x :: l) ll
ll < l < .
ll . =
during composition, the second is collapsed to =, so the call graph is
already complete. Both matrices are idempotent and contain a strictly
decreasing argument.
It could also be done with sized types; lexicographic in (i,j)
with type
flat : {A : Set} -> (1 + Listʲ A × List^i (List^∞ A)) -> List^∞ A
-}
|
project/src/avr.adb | pvrego/adaino | 8 | 22382 | <gh_stars>1-10
-- =============================================================================
-- Package body AVR
-- =============================================================================
package body AVR is
procedure Wait (Cycles : Long_Integer) is
begin
for C1 in 1 .. Cycles loop
for C2 in 1 .. Cycles loop
null;
end loop;
end loop;
end Wait;
end AVR;
|
parralel-prog/Lab1/src/main.adb | smithros/kpi-stuff | 21 | 22080 | <reponame>smithros/kpi-stuff
with Data;
with Ada.Integer_Text_IO,Ada.Text_IO;
use Ada.Integer_Text_IO,Ada.Text_IO;
with System.Multiprocessors; use System.Multiprocessors;
--F1 ME = MAX(B) *(MA*MD)
--F2 MF = g*TRANS(MG)*(MK*ML)
--F3 O = (MP *MR)*S + T
procedure Main is
N:Integer:=2;
package Data1 is new Data (N);
use Data1;
Res1:Matrix;
Res2:Matrix;
Res3:Vector;
CPU_0: CPU_Range := 1;
CPU_1: CPU_Range := 2;
CPU_2: CPU_Range := 3;
procedure Tasks is
task T1 is
pragma Task_Name("T1");
pragma Priority (9);
pragma Storage_Size(10000000);
pragma CPU(CPU_0);
end T1;
task T2 is
pragma Task_Name("T2");
pragma Priority (8);
pragma Storage_Size(10000000);
pragma CPU(CPU_1);
end T2;
task T3 is
pragma Task_Name("T3");
pragma Priority (3);
pragma Storage_Size(10000000);
pragma CPU(CPU_2);
end T3;
task body T1 is
B:Vector;
MA:Matrix;
MD:Matrix;
--ME:Matrix;
begin
Put_Line("Task T1 started");
Vector_Filling_Ones(B);
Matrix_Filling_Ones(MA);
Matrix_Filling_Ones(MD);
delay 1.0;
Res1 := Func1(B=>B,MA=>MA,MD=>MD);
delay 1.0;
--
Put_Line("Task T1 finished");
end T1;
task body T2 is
g:Integer := N;
MG:Matrix;
MK:Matrix;
ML:Matrix;
--MF:Matrix;
begin
Put_Line("Task T2 started");
Matrix_Filling_Ones(MG);
Matrix_Filling_Ones(MK);
Matrix_Filling_Ones(ML);
delay 1.0;
Res2 := Func2(g => g, MG => MG, MK => MK, ML => ML );
delay 1.0;
Put_Line("Task T2 finished");
end T2;
task body T3 is
MP,MR:Matrix;
S,T:Vector;
begin
Put_Line("Task T3 started");
Matrix_Filling_Ones(MP);
Matrix_Filling_Ones(MR);
Vector_Filling_Ones(S);
Vector_Filling_Ones(T);
delay 1.0;
Res3 := Func3(MP,MR,S,T);
delay 1.0;
Put_Line("Task T3 finished");
end T3;
begin
null;
end Tasks;
begin
Tasks;
Put("T1: ME = ");
New_Line;
Matrix_Output(Res1);
Put("T2: ME = ");
New_Line;
Matrix_Output(Res2);
New_Line;
Put("T3: O = ");
New_Line;
Vector_Output(Res3);
end Main;
|
alloy4fun_models/trashltl/models/5/XbJAYv8CRQYuFPSj8.als | Kaixi26/org.alloytools.alloy | 0 | 4540 | open main
pred idXbJAYv8CRQYuFPSj8_prop6 {
Trash' in Trash
}
pred __repair { idXbJAYv8CRQYuFPSj8_prop6 }
check __repair { idXbJAYv8CRQYuFPSj8_prop6 <=> prop6o } |
libsrc/_DEVELOPMENT/arch/zx/misc/c/sdcc_ix/zx_cls_wc_pix.asm | jpoikela/z88dk | 640 | 13304 | <reponame>jpoikela/z88dk
; void zx_cls_wc_pix(struct r_Rect8 *r, uchar pix)
SECTION code_clib
SECTION code_arch
PUBLIC _zx_cls_wc_pix
EXTERN l0_zx_cls_wc_pix
_zx_cls_wc_pix:
pop af
pop bc
pop hl
push hl
push bc
push af
jp l0_zx_cls_wc_pix
|
ZORTON.reko/ZORTON_21CC.asm | 0xLiso/dePIXELator | 0 | 12034 | <reponame>0xLiso/dePIXELator
;;; Segment 21CC (21CC:0000)
l216E_05E0:
pop es
pop si
pop di
pop bp
retf
216E:05E5 00 00 00 00 00 FF 00 00 00 00 FF ...........
216E:05F0 00 00 FF FF 00 00 00 00 FF 00 FF 00 FF 00 00 FF ................
216E:0600 FF 00 FF FF FF 00 00 00 00 FF FF 00 00 FF 00 FF ................
216E:0610 00 FF FF FF 00 FF 00 00 FF FF FF 00 FF FF 00 FF ................
216E:0620 FF FF FF FF FF FF 00 00 00 00 00 00 00 00 00 00 ................
216E:0630 00 00 ..
;; fn21CC_0052: 21CC:0052
;; Called from:
;; 1D10:1238 (in fn1D10_1153)
fn21CC_0052 proc
push bp
mov bp,sp
sub sp,2h
push ds
push es
push si
push di
mov word ptr [bp-2h],0Ah
lds si,[bp+6h]
mov cl,[si]
inc si
mov ch,[si]
inc si
mov al,cl
or al,ch
jz 00AFh
l21CC_0070:
mov ax,0A000h
push ax
mov ax,0h
push ax
mov al,ch
cbw
push ax
mov al,cl
cbw
push ax
push ax
push bp
mov bp,sp
mov word ptr [bp+2h],8Ch
pop bp
push ax
push bp
mov bp,sp
mov word ptr [bp+2h],0E4h
pop bp
push ax
push bp
mov bp,sp
mov word ptr [bp+2h],0Ah
pop bp
push ax
push bp
mov bp,sp
mov word ptr [bp+2h],0Ah
pop bp
push cs
call 0156h
add sp,10h
l21CC_00AF:
mov cl,[si]
or cl,cl
jnz 00B8h
l21CC_00B5:
jmp 014Dh
l21CC_00B8:
add si,2h
l21CC_00BB:
mov dl,[si]
add si,2h
mov dh,[si]
add si,2h
add [bp-2h],dl
mov ax,0A000h
mov es,ax
mov di,0Ah
mov ax,[bp-2h]
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
add di,ax
push dx
l21CC_00F6:
mov ch,[si]
inc si
push di
l21CC_00FA:
mov bl,[si]
inc si
mov bh,[si]
inc si
mov al,bl
mov ah,0h
add di,ax
test bh,80h
jz 0124h
l21CC_010B:
push cx
mov cl,bh
and cx,7Fh
inc cx
cld
mov al,[si]
mov ah,al
inc si
shr cx,1h
jnc 011Dh
l21CC_011C:
stosb
l21CC_011D:
jcxz 0121h
l21CC_011F:
rep stosw
l21CC_0121:
pop cx
jmp 0135h
l21CC_0124:
push cx
mov cl,bh
mov ch,0h
inc cx
cld
shr cx,1h
jnc 0130h
l21CC_012F:
movsb
l21CC_0130:
jcxz 0134h
l21CC_0132:
rep movsw
l21CC_0134:
pop cx
l21CC_0135:
dec ch
jnz 00FAh
l21CC_0139:
pop di
add di,140h
dec dh
jnz 00F6h
l21CC_0142:
pop dx
add [bp-2h],dh
dec cl
jz 014Dh
l21CC_014A:
jmp 00BBh
l21CC_014D:
pop di
pop si
pop es
pop ds
add sp,2h
pop bp
retf
;; fn21CC_0156: 21CC:0156
;; Called from:
;; 21CC:00A8 (in fn21CC_0052)
fn21CC_0156 proc
push bp
mov bp,sp
push ds
push es
push si
push di
lds si,[bp+12h]
mov ax,ds
mov es,ax
mov di,si
mov ax,[bp+6h]
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add bx,ax
add bx,[bp+6h]
add bx,si
cmp byte ptr [bp+0Eh],0h
jl 0197h
l21CC_0194:
jmp 0260h
l21CC_0197:
mov si,bx
mov di,si
mov ax,[bp+0Eh]
neg ax
add si,ax
cmp byte ptr [bp+10h],0h
jl 01AAh
l21CC_01A8:
jmp 01F4h
l21CC_01AA:
mov ax,[bp+10h]
neg ax
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
add si,ax
mov dx,[bp+0Ch]
add dx,[bp+10h]
mov cx,[bp+0Ah]
add cx,[bp+0Eh]
cld
l21CC_01DE:
push cx
push si
push di
l21CC_01E1:
rep movsb
l21CC_01E3:
pop di
pop si
pop cx
add si,140h
add di,140h
dec dx
jnz 01DEh
l21CC_01F1:
jmp 034Fh
l21CC_01F4:
mov ax,[bp+0Ch]
dec ax
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
add si,ax
add di,ax
mov ax,[bp+10h]
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
sub si,ax
mov dx,[bp+0Ch]
sub dx,[bp+10h]
mov cx,[bp+0Ah]
add cx,[bp+0Eh]
cld
l21CC_024A:
push cx
push si
push di
l21CC_024D:
rep movsb
l21CC_024F:
pop di
pop si
pop cx
sub si,140h
sub di,140h
dec dx
jnz 024Ah
l21CC_025D:
jmp 034Fh
l21CC_0260:
mov si,bx
add si,[bp+0Ah]
dec si
mov di,si
sub si,[bp+0Eh]
cmp byte ptr [bp+10h],0h
jl 0273h
l21CC_0271:
jmp 02BDh
l21CC_0273:
mov ax,[bp+10h]
neg ax
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
add si,ax
mov dx,[bp+0Ch]
add dx,[bp+10h]
mov cx,[bp+0Ah]
sub cx,[bp+0Eh]
std
l21CC_02A7:
push cx
push si
push di
l21CC_02AA:
rep movsb
l21CC_02AC:
pop di
pop si
pop cx
add si,140h
add di,140h
dec dx
jnz 02A7h
l21CC_02BA:
jmp 034Fh
l21CC_02BD:
mov ax,[bp+0Ch]
dec ax
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
add di,ax
add si,ax
mov ax,[bp+10h]
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
sub si,ax
mov ax,[bp+10h]
mov bx,ax
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl ax,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
shl bx,1h
add ax,bx
add di,ax
mov dx,[bp+0Ch]
sub dx,[bp+10h]
mov cx,[bp+0Ah]
sub cx,[bp+0Eh]
std
l21CC_033C:
push cx
push si
push di
l21CC_033F:
rep movsb
l21CC_0341:
pop di
pop si
pop cx
sub si,140h
sub di,140h
dec dx
jnz 033Ch
l21CC_034F:
pop di
pop si
pop es
pop ds
pop bp
retf
21CC:0355 55 8B EC 06 57 B8 00 A0 8E C0 BF U...W......
21CC:0360 8A 0C B9 8C 00 8A 46 06 8A E0 FC 57 51 B9 72 00 ......F....WQ.r.
21CC:0370 F3 AB 59 5F 81 C7 40 01 E2 F1 5F 07 5D CB ..Y_..@..._.].
;; fn21CC_037E: 21CC:037E
;; Called from:
;; 21CC:0420 (in fn21CC_03CC)
;; 21CC:0435 (in fn21CC_03CC)
fn21CC_037E proc
push di
mov dx,[si]
mov cx,4h
l21CC_0384:
mov bx,0h
shr dx,1h
adc bx,0h
mov al,[bx+si+2h]
ror eax,8h
mov bx,0h
shr dx,1h
adc bx,0h
mov al,[bx+si+2h]
ror eax,8h
mov bx,0h
shr dx,1h
adc bx,0h
mov al,[bx+si+2h]
ror eax,8h
mov bx,0h
shr dx,1h
adc bx,0h
mov al,[bx+si+2h]
ror eax,8h
mov es:[di],eax
add di,140h
loop 0384h
l21CC_03CA:
pop di
ret
;; fn21CC_03CC: 21CC:03CC
;; Called from:
;; 1D10:1244 (in fn1D10_1153)
fn21CC_03CC proc
push bp
mov bp,sp
push ds
push es
push si
push di
mov ax,0A000h
mov es,ax
mov di,0C8Ah
lds si,[bp+6h]
mov cl,[si]
inc si
or cl,cl
jnz 03E7h
l21CC_03E5:
jmp 0454h
l21CC_03E7:
mov dl,[si]
inc si
mov dh,[si]
inc si
mov al,dl
shl al,2h
mov ah,0h
mov bx,ax
shl ax,8h
shl bx,6h
add ax,bx
add di,ax
l21CC_0400:
mov ch,[si]
inc si
push di
l21CC_0404:
mov al,[si]
inc si
mov ah,0h
shl ax,2h
add di,ax
mov al,[si]
inc si
push cx
test al,80h
jz 042Fh
l21CC_0416:
and al,7Fh
inc al
mov cl,al
mov ch,0h
l21CC_041E:
push cx
push dx
call 037Eh
pop dx
pop cx
add di,4h
loop 041Eh
l21CC_042A:
add si,4h
jmp 0442h
l21CC_042F:
mov cl,al
mov ch,0h
l21CC_0433:
push cx
push dx
call 037Eh
pop dx
pop cx
add di,4h
add si,4h
loop 0433h
l21CC_0442:
pop cx
dec ch
jnz 0404h
l21CC_0447:
pop di
add di,500h
dec dh
jnz 0400h
l21CC_0450:
dec cl
jnz 03E7h
l21CC_0454:
pop di
pop si
pop es
pop ds
pop bp
retf
;; fn21CC_045A: 21CC:045A
;; Called from:
;; 1D10:11E7 (in fn1D10_1153)
fn21CC_045A proc
push bp
mov bp,sp
push ds
push es
push si
push di
mov ax,0A000h
mov es,ax
mov di,0C8Ah
lds si,[bp+6h]
mov bx,8Ch
l21CC_046F:
push di
mov dx,0E4h
l21CC_0473:
mov al,[si]
inc si
test al,80h
jz 049Ah
l21CC_047A:
and al,7Fh
mov cl,al
mov ch,0h
inc cx
mov al,[si]
inc si
mov ah,al
cld
sub dx,cx
and al,al
jnz 0491h
l21CC_048D:
add di,cx
jmp 04ABh
l21CC_0491:
shr cx,1h
jnc 0496h
l21CC_0495:
stosb
l21CC_0496:
rep stosw
l21CC_0498:
jmp 04ABh
l21CC_049A:
mov cl,al
mov ch,0h
inc cx
cld
sub dx,cx
shr cx,1h
jnc 04A7h
l21CC_04A6:
movsb
l21CC_04A7:
jcxz 04ABh
l21CC_04A9:
rep movsw
l21CC_04AB:
cmp dx,0h
jg 0473h
l21CC_04B0:
pop di
add di,140h
dec bx
jnz 046Fh
l21CC_04B8:
pop di
pop si
pop es
pop ds
pop bp
retf
;; fn21CC_04BE: 21CC:04BE
;; Called from:
;; 1D10:11AA (in fn1D10_1153)
fn21CC_04BE proc
push bp
mov bp,sp
push ds
push si
push es
push di
lds si,[bp+6h]
mov ax,0A000h
mov es,ax
mov di,0C8Ah
mov cx,8Ch
cld
l21CC_04D4:
push cx
push di
mov cx,39h
l21CC_04D9:
rep movsd
l21CC_04DC:
pop di
add di,140h
pop cx
loop 04D4h
l21CC_04E4:
pop di
pop es
pop si
pop ds
pop bp
retf
21CC:04EA 55 8B EC 83 EC 02 U.....
21CC:04F0 1E 06 56 57 C5 76 06 B8 00 A0 8E C0 BF 8A 0C C7 ..VW.v..........
21CC:0500 46 FE 00 00 8A 3C 46 F6 C7 01 74 14 B8 E4 00 BA F....<F...t.....
21CC:0510 8C 00 D1 E8 D1 EA F7 E2 05 07 00 C1 E8 03 03 F0 ................
21CC:0520 B9 8C 00 33 D2 51 B9 E4 00 57 F6 C7 01 74 20 F7 ...3.Q...W...t .
21CC:0530 46 FE 07 00 75 10 56 8B 46 FE C1 E8 03 40 8B 76 F...u.V.F....@.v
21CC:0540 06 03 F0 8A 04 5E FF 46 FE D0 E0 72 02 EB 5A 50 .....^.F...r..ZP
21CC:0550 8A 04 46 8A 24 46 42 F7 C2 01 00 75 08 8A 1C 46 ..F.$FB....u...F
21CC:0560 80 E3 0F EB 09 8A 5C 02 C0 EB 04 80 E3 0F D0 EB ......\.........
21CC:0570 73 05 26 88 25 EB 03 26 88 05 D0 EB 73 06 26 88 s.&.%..&....s.&.
21CC:0580 65 01 EB 04 26 88 45 01 D0 EB 73 07 26 88 A5 40 e...&.E...s.&..@
21CC:0590 01 EB 05 26 88 85 40 01 D0 EB 73 07 26 88 A5 41 ...&..@...s.&..A
21CC:05A0 01 EB 05 26 88 85 41 01 58 83 C7 02 49 E2 02 EB ...&..A.X...I...
21CC:05B0 03 E9 76 FF 5F 81 C7 80 02 59 49 E2 02 EB 03 E9 ..v._....YI.....
21CC:05C0 63 FF 5F 5E 07 1F 83 C4 02 5D CB c._^.....].
;; fn21CC_05CB: 21CC:05CB
;; Called from:
;; 1D10:1299 (in fn1D10_1153)
fn21CC_05CB proc
push bp
mov bp,sp
push ds
push es
push si
push di
lds si,[bp+6h]
mov ax,0A000h
mov es,ax
mov di,0C8Ah
mov bh,[si]
inc si
test bh,1h
jz 05FAh
l21CC_05E5:
mov ax,0E4h
mov dx,8Ch
shr ax,2h
shr dx,1h
mul dx
add ax,7h
shr ax,3h
add si,ax
l21CC_05FA:
mov cx,8Ch
xor dx,dx
l21CC_05FF:
push cx
mov cx,0E4h
push di
l21CC_0604:
test bh,1h
jz 0626h
l21CC_0609:
test dx,7h
jnz 061Eh
l21CC_060F:
push si
mov ax,dx
shr ax,3h
inc ax
mov si,[bp+6h]
add si,ax
mov al,[si]
pop si
l21CC_061E:
inc dx
shl al,1h
jc 0626h
l21CC_0623:
jmp 06A7h
l21CC_0626:
push ax
mov al,[si]
inc si
mov ah,[si]
inc si
mov bl,[si]
inc si
shr bl,1h
jnc 0639h
l21CC_0634:
mov es:[di],ah
jmp 063Ch
l21CC_0639:
mov es:[di],al
l21CC_063C:
shr bl,1h
jnc 0646h
l21CC_0640:
mov es:[di+1h],ah
jmp 064Ah
l21CC_0646:
mov es:[di+1h],al
l21CC_064A:
shr bl,1h
jnc 0654h
l21CC_064E:
mov es:[di+2h],ah
jmp 0658h
l21CC_0654:
mov es:[di+2h],al
l21CC_0658:
shr bl,1h
jnc 0662h
l21CC_065C:
mov es:[di+3h],ah
jmp 0666h
l21CC_0662:
mov es:[di+3h],al
l21CC_0666:
shr bl,1h
jnc 0671h
l21CC_066A:
mov es:[di+140h],ah
jmp 0676h
l21CC_0671:
mov es:[di+140h],al
l21CC_0676:
shr bl,1h
jnc 0681h
l21CC_067A:
mov es:[di+141h],ah
jmp 0686h
l21CC_0681:
mov es:[di+141h],al
l21CC_0686:
shr bl,1h
jnc 0691h
l21CC_068A:
mov es:[di+142h],ah
jmp 0696h
l21CC_0691:
mov es:[di+142h],al
l21CC_0696:
shr bl,1h
jnc 06A1h
l21CC_069A:
mov es:[di+143h],ah
jmp 06A6h
l21CC_06A1:
mov es:[di+143h],al
l21CC_06A6:
pop ax
l21CC_06A7:
add di,4h
sub cx,3h
loop 06B1h
l21CC_06AF:
jmp 06B4h
l21CC_06B1:
jmp 0604h
l21CC_06B4:
pop di
add di,280h
pop cx
dec cx
loop 06BFh
l21CC_06BD:
jmp 06C2h
l21CC_06BF:
jmp 05FFh
l21CC_06C2:
pop di
pop si
pop es
pop ds
pop bp
retf
;; fn21CC_06C8: 21CC:06C8
;; Called from:
;; 1D10:128D (in fn1D10_1153)
fn21CC_06C8 proc
push bp
mov bp,sp
push ds
push es
push esi
push edi
mov ax,cs:[07B3h]
cmp ax,4D2h
jnz 06E3h
l21CC_06DA:
mov ax,cs:[07B9h]
cmp ax,10E1h
jz 06F5h
l21CC_06E3:
mov ax,0A000h
mov es,ax
mov di,0h
mov ax,0FFFFh
mov cx,8000h
l21CC_06F1:
rep stosw
l21CC_06F3:
jmp 06F3h
l21CC_06F5:
lds si,[bp+6h]
mov bp,6h
mov ax,0A000h
mov es,ax
mov di,0C8Ah
mov al,[si]
inc si
test al,1h
jz 070Dh
l21CC_070A:
jmp 07BEh
l21CC_070D:
mov cx,46h
l21CC_0710:
mov cs:[07B7h],cx
mov cx,39h
l21CC_0718:
mov ax,[si]
mov bl,[si+2h]
and ebx,0Fh
shl bl,2h
add bx,bp
mov edx,cs:[bx]
mov bl,ah
mov bh,ah
shl ebx,10h
mov bl,ah
mov bh,ah
and ebx,edx
mov ah,al
mov cs:[07B5h],ax
shl eax,10h
mov ax,cs:[07B5h]
not edx
and eax,edx
or eax,ebx
mov es:[di],eax
mov ax,[si]
mov bl,[si+2h]
add si,3h
and ebx,0F0h
shr bl,2h
add bx,bp
mov edx,cs:[bx]
mov bl,ah
mov bh,ah
shl ebx,10h
mov bl,ah
mov bh,ah
and ebx,edx
mov ah,al
mov cs:[07B5h],ax
shl eax,10h
mov ax,cs:[07B5h]
not edx
and eax,edx
or eax,ebx
mov es:[di+140h],eax
add di,4h
dec cx
jnz 0718h
l21CC_07A0:
add di,19Ch
mov cx,cs:[07B7h]
loop 07BBh
l21CC_07AB:
pop edi
pop esi
pop es
pop ds
pop bp
retf
21CC:07B3 D2 04 00 00 00 00 E1 10 ........
l21CC_07BB:
jmp 0710h
l21CC_07BE:
mov bx,si
add bx,1F3h
mov al,[si]
mov cx,46h
xor edx,edx
l21CC_07CC:
mov cs:[07B7h],cx
mov cx,39h
l21CC_07D4:
inc dl
cmp dl,9h
jnc 07F7h
l21CC_07DB:
shl al,1h
jc 07FFh
l21CC_07DF:
add di,4h
loop 07D4h
l21CC_07E4:
add di,19Ch
mov cx,cs:[07B7h]
loop 07CCh
l21CC_07EF:
pop edi
pop esi
pop es
pop ds
pop bp
retf
l21CC_07F7:
inc si
mov al,[si]
xor edx,edx
jmp 07D4h
l21CC_07FF:
mov cs:[004Ah],si
mov cs:[0046h],dx
mov cs:[004Eh],ax
mov si,bx
mov ax,[si]
mov bl,[si+2h]
and ebx,0Fh
shl bl,2h
add bx,bp
mov edx,cs:[bx]
mov bl,ah
mov bh,ah
shl ebx,10h
mov bl,ah
mov bh,ah
and ebx,edx
mov ah,al
mov cs:[07B5h],ax
shl eax,10h
mov ax,cs:[07B5h]
not edx
and eax,edx
or eax,ebx
mov es:[di],eax
mov ax,[si]
mov bl,[si+2h]
add si,3h
and ebx,0F0h
shr bl,2h
add bx,bp
mov edx,cs:[bx]
mov bl,ah
mov bh,ah
shl ebx,10h
mov bl,ah
mov bh,ah
and ebx,edx
mov ah,al
mov cs:[07B5h],ax
shl eax,10h
mov ax,cs:[07B5h]
not edx
and eax,edx
or eax,ebx
mov es:[di+140h],eax
mov bx,si
mov dx,cs:[0046h]
mov ax,cs:[004Eh]
mov si,cs:[004Ah]
jmp 07DFh
;; fn21CC_08A2: 21CC:08A2
;; Called from:
;; 1D10:122C (in fn1D10_1153)
fn21CC_08A2 proc
enter 0h,0h
push bp
mov bp,sp
push ds
push es
push si
push di
lds si,[bp+8h]
add si,2h
xor ch,ch
mov cl,[si]
or cl,cl
jz 0A14h
l21CC_08BD:
mov ax,0A000h
mov es,ax
mov di,0C8Ah
add si,2h
mov bp,cx
xor bx,bx
l21CC_08CC:
xor dx,dx
mov eax,[si]
add si,4h
xor ah,ah
and ax,ax
jz 08E3h
l21CC_08DA:
mov dh,al
shl ax,6h
add ax,dx
add di,ax
l21CC_08E3:
shr eax,10h
xor ah,ah
mov dx,ax
l21CC_08EB:
mov bl,[si]
inc si
push di
l21CC_08EF:
xor cx,cx
mov ax,[si]
add si,2h
xchg ah,ch
add di,ax
test ch,80h
jz 09B0h
l21CC_0901:
mov al,[si]
mov ah,al
shl eax,10h
mov al,[si]
inc si
mov ah,al
and ch,7Fh
inc ch
mov cl,ch
and ch,3h
jz 092Ch
l21CC_091A:
shr ch,1h
jnc 0922h
l21CC_091E:
mov es:[di],al
inc di
l21CC_0922:
shr ch,1h
jnc 092Ch
l21CC_0926:
mov es:[di],ax
add di,2h
l21CC_092C:
shr cl,2h
jz 0A00h
l21CC_0933:
test di,1h
jz 0981h
l21CC_0939:
dec cl
jz 0977h
l21CC_093D:
test di,2h
jnz 095Dh
l21CC_0943:
mov es:[di],al
mov es:[di+1h],ax
add di,3h
l21CC_094D:
mov es:[di],eax
add di,4h
loop 094Dh
l21CC_0956:
mov es:[di],al
inc di
jmp 0A00h
l21CC_095D:
mov es:[di],al
inc di
l21CC_0961:
mov es:[di],eax
add di,4h
loop 0961h
l21CC_096A:
mov es:[di],ax
mov es:[di+2h],al
add di,3h
jmp 0A00h
l21CC_0977:
mov es:[di],eax
add di,4h
jmp 0A00h
l21CC_0981:
cmp cl,1h
jz 0977h
l21CC_0986:
test di,2h
jz 09A5h
l21CC_098C:
dec cl
mov es:[di],ax
add di,2h
l21CC_0994:
mov es:[di],eax
add di,4h
loop 0994h
l21CC_099D:
mov es:[di],ax
add di,2h
jmp 0A00h
l21CC_09A5:
mov es:[di],eax
add di,4h
loop 09A5h
l21CC_09AE:
jmp 0A00h
l21CC_09B0:
inc ch
mov cl,ch
and ch,3h
jz 09C3h
l21CC_09B9:
shr ch,1h
jnc 09BEh
l21CC_09BD:
movsb
l21CC_09BE:
shr ch,1h
jnc 09C3h
l21CC_09C2:
movsw
l21CC_09C3:
shr cl,2h
jz 0A00h
l21CC_09C8:
test di,1h
jz 09ECh
l21CC_09CE:
dec cl
jz 09E8h
l21CC_09D2:
test di,2h
jnz 09E0h
l21CC_09D8:
movsb
movsw
l21CC_09DA:
rep movsd
l21CC_09DD:
movsb
jmp 0A00h
l21CC_09E0:
movsb
l21CC_09E1:
rep movsd
l21CC_09E4:
movsw
movsb
jmp 0A00h
l21CC_09E8:
movsd
jmp 0A00h
l21CC_09EC:
test di,2h
jz 09FDh
l21CC_09F2:
dec cl
jz 09E8h
l21CC_09F6:
movsw
l21CC_09F7:
rep movsd
l21CC_09FA:
movsw
jmp 0A00h
l21CC_09FD:
rep movsd
l21CC_0A00:
dec bx
jnz 08EFh
l21CC_0A05:
pop di
add di,140h
dec dx
jnz 08EBh
l21CC_0A0F:
dec bp
|
registrar-last_run_store.adb | annexi-strayline/AURA | 13 | 12175 | ------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- Command Line Interface --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * <NAME> (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Directories;
with Ada.Streams.Stream_IO;
with Ada.Containers.Hashed_Sets;
with Registrar.Registry;
package body Registrar.Last_Run_Store is
All_Subsystems_Store : constant String := ".aura/all_subsys.dat";
All_Library_Units_Store: constant String := ".aura/all_libuni.dat";
-- The Operation is simple and fail-passive. Any failure during load simply
-- leads to an empty set
----------
-- Load --
----------
generic
Store_Path: in String;
with package Sets is new Ada.Containers.Hashed_Sets (<>);
function Generic_Load_Last_Run return Sets.Set;
function Generic_Load_Last_Run return Sets.Set is
use Sets;
use Ada.Streams.Stream_IO;
Store: File_Type;
begin
Open (File => Store,
Mode => In_File,
Name => Store_Path);
return Loaded_Set: Set do
Set'Read (Stream (Store), Loaded_Set);
Close (Store);
end return;
exception
when others =>
return Empty_Set;
end Generic_Load_Last_Run;
-- All_Subsystems --
function Load_Last_Run return Subsystems.Subsystem_Sets.Set is
function Do_Load is new Generic_Load_Last_Run
(Store_Path => All_Subsystems_Store,
Sets => Subsystems.Subsystem_Sets);
begin
return Do_Load;
end Load_Last_Run;
-- All_Library_Units --
function Load_Last_Run return Library_Units.Library_Unit_Sets.Set is
function Do_Load is new Generic_Load_Last_Run
(Store_Path => All_Library_Units_Store,
Sets => Library_Units.Library_Unit_Sets);
begin
return Do_Load;
end Load_Last_Run;
-----------
-- Store --
-----------
generic
Store_Path: in String;
with package Sets is new Ada.Containers.Hashed_Sets (<>);
procedure Generic_Store_Last_Run (S: Sets.Set);
procedure Generic_Store_Last_Run (S: Sets.Set) is
use Sets;
use Ada.Streams.Stream_IO;
Store: File_Type;
begin
if not Ada.Directories.Exists (".aura") then
Ada.Directories.Create_Directory (".aura");
end if;
if not Ada.Directories.Exists (Store_Path) then
Create (File => Store,
Mode => Out_File,
Name => Store_Path);
else
Open (File => Store,
Mode => Out_File,
Name => Store_Path);
end if;
Set'Write (Stream (Store), S);
Close (Store);
end Generic_Store_Last_Run;
--------------------------------------------------
procedure Store_Current_Run is
use Ada.Streams.Stream_IO;
Store: File_Type;
function Select_All (Element: Subsystems.Subsystem)
return Boolean is (True);
function Select_All (Element: Library_Units.Library_Unit)
return Boolean is (True);
Current_All_Subsystems: constant Subsystems.Subsystem_Sets.Set
:= Registry.All_Subsystems.Extract_Subset (Select_All'Access);
Current_All_Library_Units: constant Library_Units.Library_Unit_Sets.Set
:= Registry.All_Library_Units.Extract_Subset (Select_All'Access);
procedure Store_All_Subsystems is new Generic_Store_Last_Run
(Store_Path => All_Subsystems_Store,
Sets => Subsystems.Subsystem_Sets);
procedure Store_All_Library_Units is new Generic_Store_Last_Run
(Store_Path => All_Library_Units_Store,
Sets => Library_Units.Library_Unit_Sets);
begin
Store_All_Subsystems (Current_All_Subsystems );
Store_All_Library_Units (Current_All_Library_Units);
end Store_Current_Run;
end Registrar.Last_Run_Store;
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c6/c64103d.ada | best08618/asylo | 7 | 11131 | -- C64103D.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 THE APPROPRIATE EXCEPTION IS RAISED FOR TYPE CONVERSIONS
-- ON OUT ARRAY PARAMETERS. IN PARTICULAR:
-- (A) CONSTRAINT_ERROR IS RAISED BEFORE THE CALL WHEN THE ACTUAL
-- COMPONENT'S CONSTRAINTS DIFFER FROM THE FORMAL COMPONENT'S
-- CONSTRAINTS.
-- (B) CONSTRAINT_ERROR IS RAISED BEFORE THE CALL WHEN CONVERSION TO
-- AN UNCONSTRAINED ARRAY TYPE CAUSES AN ACTUAL INDEX BOUND TO LIE
-- OUTSIDE OF A FORMAL INDEX SUBTYPE.
-- (C) CONSTRAINT_ERROR IS RAISED BEFORE THE CALL FOR CONVERSION TO A
-- CONSTRAINED ARRAY TYPE WHEN THE NUMBER OF COMPONENTS PER
-- DIMENSION OF THE ACTUAL DIFFERS FROM THAT OF THE FORMAL.
-- (D) CONSTRAINT_ERROR IS RAISED BEFORE THE CALL WHEN CONVERSION TO AN
-- UNCONSTRAINED ARRAY TYPE CAUSES AN ACTUAL INDEX BOUND TO LIE
-- OUTSIDE OF THE BASE INDEX TYPE OF THE FORMAL.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- *** -- 9X
-- CPP 07/19/84
-- EG 10/29/85 FIX NUMERIC_ERROR/CONSTRAINT_ERROR ACCORDING TO
-- AI-00387.
-- MRM 03/30/93 REMOVED NUMERIC_ERROR FOR 9X COMPATIBILITY
-- PWN 01/31/95 REMOVED INCONSISTENCIES WITH ADA 9X.
WITH SYSTEM;
WITH REPORT; USE REPORT;
PROCEDURE C64103D IS
BEGIN
TEST ("C64103D", "CHECK THAT APPROPRIATE EXCEPTION IS RAISED ON " &
"TYPE CONVERSIONS OF OUT ARRAY PARAMETERS");
-----------------------------------------------
DECLARE -- (A)
BEGIN -- (A)
DECLARE
TYPE SUBINT IS RANGE 0..8;
TYPE ARRAY_TYPE IS ARRAY (SUBINT RANGE <>) OF BOOLEAN;
A0 : ARRAY_TYPE (0..3) := (0..3 => TRUE);
PROCEDURE P2 (X : OUT ARRAY_TYPE) IS
BEGIN
NULL;
END P2;
BEGIN
P2 (ARRAY_TYPE (A0)); -- OK.
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED -P2 (A)");
END;
END; -- (A)
-----------------------------------------------
DECLARE -- (B)
TYPE SUBINT IS RANGE 0..8;
TYPE ARRAY_TYPE IS ARRAY (SUBINT RANGE <>) OF BOOLEAN;
TYPE AR1 IS ARRAY (INTEGER RANGE <>) OF BOOLEAN;
A1 : AR1 (-1..7) := (-1..7 => TRUE);
A2 : AR1 (1..9) := (1..9 => TRUE);
PROCEDURE P1 (X : OUT ARRAY_TYPE) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P1 (B)");
END P1;
BEGIN -- (B)
BEGIN
COMMENT ("CALL TO P1 (B) ON A1");
P1 (ARRAY_TYPE (A1));
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P1 (B)");
END;
BEGIN
COMMENT ("CALL TO P1 (B) ON A2");
P1 (ARRAY_TYPE (A2));
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P1 (B)");
END;
END; -- (B)
-----------------------------------------------
DECLARE -- (C)
BEGIN -- (C)
DECLARE
TYPE INDEX1 IS RANGE 1..3;
TYPE INDEX2 IS RANGE 1..4;
TYPE AR_TYPE IS ARRAY (INDEX1, INDEX2) OF BOOLEAN;
A0 : AR_TYPE := (1..3 => (1..4 => FALSE));
TYPE I1 IS RANGE 1..4;
TYPE I2 IS RANGE 1..3;
TYPE ARRAY_TYPE IS ARRAY (I1, I2) OF BOOLEAN;
PROCEDURE P1 (X : OUT ARRAY_TYPE) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P1 (C)");
END P1;
BEGIN
P1 (ARRAY_TYPE (A0));
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P1 (C)");
END;
END; -- (C)
-----------------------------------------------
DECLARE -- (D)
BEGIN -- (D)
DECLARE
TYPE SM_INT IS RANGE 0..2;
TYPE LG_INT IS RANGE SYSTEM.MIN_INT..SYSTEM.MAX_INT;
TYPE AR_SMALL IS ARRAY (SM_INT RANGE <>) OF BOOLEAN;
TYPE AR_LARGE IS ARRAY (LG_INT RANGE <>) OF BOOLEAN;
A0 : AR_LARGE (SYSTEM.MAX_INT - 2..SYSTEM.MAX_INT) :=
(SYSTEM.MAX_INT - 2..SYSTEM.MAX_INT => TRUE);
PROCEDURE P1 (X : OUT AR_SMALL) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P1 (D)");
END P1;
BEGIN
IF LG_INT (SM_INT'BASE'LAST) < LG_INT'BASE'LAST THEN
P1 (AR_SMALL (A0));
ELSE
COMMENT ("NOT APPLICABLE -P1 (D)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
COMMENT ("CONSTRAINT_ERROR RAISED - P1 (D)");
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - P1 (D)");
END;
END; -- (D)
-----------------------------------------------
RESULT;
END C64103D;
|
data/pokemon/dex_entries/spheal.asm | AtmaBuster/pokeplat-gen2 | 6 | 96290 | <reponame>AtmaBuster/pokeplat-gen2
db "CLAP@" ; species name
db "It crosses oceans"
next "by rolling itself"
next "on drifting ice."
page "When the weather"
next "is cold, its fluffy"
next "fur keeps it warm.@"
|
oeis/187/A187738.asm | neoneye/loda-programs | 11 | 87027 | ; A187738: G.f.: Sum_{n>=0} (3*n+1)^n * x^n / (1 + (3*n+1)*x)^n.
; Submitted by <NAME>
; 1,4,33,378,5508,97200,2012040,47764080,1278607680,38093690880,1249949232000,44783895340800,1739500776921600,72804471541401600,3266273336880153600,156364149105964800000,7955807906511489024000,428712969452770050048000,24390705726366524633088000
mov $1,2
lpb $0
mov $2,3
mul $2,$0
sub $0,1
add $1,$2
add $1,2
mul $1,$2
lpe
mov $0,$1
div $0,6
add $0,1
|
src/tools/Dependency_Graph_Extractor/src/extraction-deferred_constants.adb | selroc/Renaissance-Ada | 1 | 5948 | with Extraction.Node_Edge_Types;
with Extraction.Utilities;
package body Extraction.Deferred_Constants is
use type LALCO.Ada_Node_Kind_Type;
procedure Extract_Edges
(Node : LAL.Ada_Node'Class;
Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl(Node) then
if Node.Kind = LALCO.Ada_Object_Decl then
declare
Object_Decl : constant LAL.Object_Decl := Node.As_Object_Decl;
Defining_Names : constant LAL.Defining_Name_Array := Object_Decl.P_Defining_Names;
begin
for Defining_Name of Defining_Names loop
if not Defining_Name.P_Previous_Part.Is_Null then
declare
Previous_Name : constant LAL.Defining_Name := Defining_Name.P_Previous_Part;
Previous_Decl : constant LAL.Basic_Decl := Previous_Name.P_Basic_Decl;
begin
Graph.Write_Edge(Previous_Name, Previous_Decl, Defining_Name, Object_Decl, Node_Edge_Types.Edge_Type_Is_Implemented_By);
end;
end if;
end loop;
end;
end if;
end if;
end Extract_Edges;
end Extraction.Deferred_Constants;
|
thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdl_framebuffer.adb | Lucretia/old_nehe_ada95 | 0 | 5147 | <gh_stars>0
-- ----------------------------------------------------------------- --
-- AdaSDL_Framebuffer --
-- Copyright (C) 2001 A.M.F.Vargas --
-- <NAME> --
-- Ponta Delgada - Azores - Portugal --
-- http://www.adapower.net/~avargas --
-- E-mail: <EMAIL> --
-- ----------------------------------------------------------------- --
-- --
-- This library 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 library is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. --
-- --
-- You should have received a copy of the GNU General Public --
-- License along with this library; if not, write to the --
-- Free Software Foundation, Inc., 59 Temple Place - Suite 330, --
-- Boston, MA 02111-1307, USA. --
-- --
-- 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. --
-- ----------------------------------------------------------------- --
-- ##########################################################################
-- ### These are new extensions to the SDL API in order to improve the
-- ### Ada code and to isolate the pointer arithmetic inside the library.
-- ##########################################################################
with Interfaces.C;
with Lib_C;
package body SDL_Framebuffer is
use type C.int;
-- ===========================================================
function Go_XY_24b_Unchecked (
Surface : Vd.Surface_ptr;
X : Natural;
Y : Natural) return Framebuffer_8bPointer
is
begin
return Go_XY_Unchecked (Surface, Natural (3 * X), Natural (Y));
end Go_XY_24b_Unchecked;
-- ===========================================================
procedure Set_24b_Value_Unchecked (
Surface : Vd.Surface_ptr;
Location : Framebuffer_8bPointer;
Value : Uint32)
is
use Uint8_Ptrs;
use Uint8_PtrOps;
use Interfaces;
Shift : C.int;
Pix : Framebuffer_8bPointer := Location;
begin
Shift := C.int (Surface.format.Rshift);
Uint8_Ptrs.Object_Pointer (
Uint8_PtrOps.Pointer (Pix)
+ C.ptrdiff_t (Shift / 8)
).all := Uint8 (Shift_Right (Value, Integer (Shift)));
Shift := C.int (Surface.format.Gshift);
Uint8_Ptrs.Object_Pointer (
Uint8_PtrOps.Pointer (Pix)
+ C.ptrdiff_t (Shift / 8)
).all := Uint8 (Shift_Right (Value, Integer (Shift)));
Shift := C.int (Surface.format.Bshift);
Uint8_Ptrs.Object_Pointer (
Uint8_PtrOps.Pointer (Pix)
+ C.ptrdiff_t (Shift / 8)
).all := Uint8 (Shift_Right (Value, Integer (Shift)));
end Set_24b_Value_Unchecked;
-- =======================================
procedure Copy_Colors (
Source : Surface_ptr;
Dest : Color_PtrOps.Pointer;
Num_Colors : Natural)
is
begin
Color_PtrOps.Copy_Array (
Color_PtrOps.Pointer (Source.format.palette.colors),
Dest,
C.ptrdiff_t (Num_Colors));
end Copy_Colors;
-- =======================================
function Copy_Colors (
Surface : Surface_ptr;
Num_Colors : Natural) return Colors_Array is
begin
return Color_PtrOps.Value (
Color_PtrOps.Pointer (Surface.format.palette.colors),
C.ptrdiff_t (Num_Colors));
end Copy_Colors;
-- ===================================================================
function Pitch_Gap (Surface : Surface_ptr) return Uint16 is
begin
return Surface.pitch
- Uint16 (Surface.w)* Uint16 (Surface.format.BytesPerPixel);
end Pitch_Gap;
-- ==================================================================
function Get_Palette_Red (
Surface : Surface_ptr;
Color_Index : Uint8) return Uint8
is
use Color_PtrOps;
begin
return
Color_ptr (
Color_PtrOps.Pointer (Surface.format.palette.colors)
+ C.ptrdiff_t (Color_Index)
).all.r;
end Get_Palette_Red;
-- =============================================
function Get_Palette_Green (
Surface : Surface_ptr;
Color_Index : Uint8) return Uint8
is
use Color_PtrOps;
begin
return
Color_ptr (
Color_PtrOps.Pointer (Surface.format.palette.colors)
+ C.ptrdiff_t (Color_Index)
).all.g;
end Get_Palette_Green;
-- =============================================
function Get_Palette_Blue (
Surface : Surface_ptr;
Color_Index : Uint8) return Uint8
is
use Color_PtrOps;
begin
return
Color_ptr (
Color_PtrOps.Pointer (Surface.format.palette.colors)
+ C.ptrdiff_t (Color_Index)
).all.b;
end Get_Palette_Blue;
-- #######################################################################
end SDL_Framebuffer;
|
programs/oeis/329/A329199.asm | karttu/loda | 0 | 99726 | <gh_stars>0
; A329199: a(n) = round(log_3(n)).
; 0,1,1,1,1,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4
mov $2,2
add $2,$0
mul $0,$2
mov $1,2
add $1,$0
log $1,3
add $1,5
div $1,2
sub $1,2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.