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 |
|---|---|---|---|---|
single-substitution-cipher/ada/src/Decipherer.adb | Tim-Tom/scratch | 0 | 13375 | <gh_stars>0
with Ada.Containers.Ordered_Sets;
with Ada.Unchecked_Deallocation;
with Ada.Containers.Generic_Array_Sort;
with Ada.Text_IO;
package body Decipherer is
package Character_Sets is new Ada.Containers.Ordered_Sets(Element_Type => Encrypted_Char);
package IO renames Ada.Text_IO;
type Priority_Pair is record
item, priority : Integer;
end record;
type Priority_Pair_Array is Array(Positive range <>) of Priority_Pair;
function "<"(a, b : Priority_Pair) return Boolean is
begin
return a.priority > b.priority;
end "<";
procedure Priority_Pair_Sort is new Ada.Containers.Generic_Array_Sort(Index_Type => Positive, Element_Type => Priority_Pair, Array_Type => Priority_Pair_Array);
type Mapping_Candidates is Array(Positive range 1 .. 26) of Character;
type Char_Possibilities is record
c : Encrypted_Char;
num_possible : Natural;
possibilities : Mapping_Candidates;
end record;
type Word_Possibilities is record
is_using_root : Boolean;
words : Word_List.Word_Vector;
end record;
type Guess_Order_Array is Array(Positive range <>) of Positive;
type Char_Possibilities_Array is Array(Positive range <>) of Char_Possibilities;
type Word_Possibilities_Array is Array(Positive range <>) of Word_Possibilities;
type Word_Inclusion is Array(Positive range <>, Positive range <>) of Natural;
type Letter_Toggle is Array(Positive range <>) of Boolean;
type Word_Toggle is Array(Positive range <>) of Boolean;
package Word_Vectors renames Word_List.Word_Vectors;
function "="(a, b: Word_Vectors.Cursor) return Boolean renames Word_Vectors."=";
procedure Free_Word_Vector is new Ada.Unchecked_Deallocation(Object => Word_Vectors.Vector, Name => Word_List.Word_Vector);
type Decipher_State (num_words : Positive; num_letters : Positive) is record
candidates : Candidate_Set(1 .. num_words);
characters : Char_Possibilities_Array(1 .. num_letters);
words : Word_Possibilities_Array(1 .. num_words);
inclusion : Word_Inclusion(1 .. num_letters, 1 .. num_words);
guess_order : Guess_Order_Array(1 .. num_letters);
results : Result_Vector;
end record;
function Image(ew: Encrypted_Word) return Word_List.Word is
w : Word_List.Word;
begin
for i in ew'Range loop
w(i) := Character(ew(i));
end loop;
return w;
end Image;
function Get_Character_Index(state : Decipher_State; c : Encrypted_Char) return Positive is
begin
for ci in state.characters'Range loop
if c = state.characters(ci).c then
return ci;
end if;
end loop;
raise Constraint_Error;
end Get_Character_Index;
function Is_Word_Valid(state : Decipher_State; candidate : Encrypted_Word; word : Word_List.Word) return Boolean is
begin
for i in candidate'Range loop
exit when candidate(i) = ' ';
declare
ci : constant Positive := Get_Character_Index(state, candidate(i));
c : constant Character := word(i);
cp : Char_Possibilities renames state.characters(ci);
found : Boolean := False;
begin
if cp.num_possible = 1 then
found := cp.possibilities(1) = c;
elsif cp.num_possible = 26 then
found := True;
else
for j in 1 .. cp.num_possible loop
if cp.possibilities(j) = c then
found := True;
exit;
end if;
end loop;
end if;
if not found then
return False;
end if;
end;
end loop;
return True;
end Is_Word_Valid;
procedure Filter_Word_List(state : Decipher_State; candidate : Encrypted_Word; initial : Word_List.Word_Vector; final : Word_List.Word_Vector) is
cur : Word_Vectors.Cursor := initial.First;
begin
while cur /= Word_Vectors.No_Element loop
if Is_Word_Valid(state, candidate, Word_Vectors.Element(cur)) then
final.Append(Word_Vectors.Element(cur));
end if;
cur := Word_Vectors.Next(cur);
end loop;
end Filter_Word_List;
procedure Put_Possible(cp: Char_Possibilities) is
begin
for i in 1 .. cp.Num_Possible loop
IO.Put(cp.possibilities(i));
end loop;
IO.New_Line;
end Put_Possible;
procedure Put_Inclusion(state: Decipher_State) is
begin
for i in 1 .. state.Num_Letters loop
IO.Put(Encrypted_Char'Image(state.characters(i).c) & ": ");
for j in 1 .. state.Num_Words loop
exit when state.inclusion(i, j) = 0;
IO.Put(Natural'Image(state.inclusion(i, j)));
end loop;
IO.New_Line;
end loop;
end Put_Inclusion;
procedure Put_Solution(state : Decipher_State) is
begin
IO.Put_Line("Found Solution");
for ci in 1 .. state.num_letters loop
IO.Put(Character(state.characters(ci).c));
if state.characters(ci).num_possible /= 1 then
IO.Put_Line(": Invalid State");
return;
end if;
end loop;
IO.New_Line;
for ci in 1 .. state.num_letters loop
IO.Put(state.characters(ci).possibilities(1));
end loop;
IO.New_Line;
for wi in 1 .. state.num_words loop
IO.Put(Image(state.candidates(wi)) & ": ");
if Natural(state.words(wi).words.all.Length) = 1 then
IO.Put_Line(state.words(wi).words.First_Element);
else
IO.Put_Line("*Invalid: " & Ada.Containers.Count_Type'Image(state.words(wi).words.all.Length) & " Words");
end if;
end loop;
IO.Put_Line("--------------------------");
end Put_Solution;
procedure Make_Unique(state : in out Decipher_State; ci : Positive; success : out Boolean; changed : in out Letter_Toggle) is
letter : constant Character := state.characters(ci).possibilities(1);
begin
success := True;
-- IO.Put_Line("Determined that " & Encrypted_Char'Image(state.characters(ci).c) & " has to be a " & Character'Image(letter));
for i in state.characters'Range loop
if i /= ci then
declare
cp : Char_Possibilities renames state.characters(i);
begin
for j in 1 .. cp.num_possible loop
if cp.possibilities(j) = letter then
if cp.num_possible = 1 then
success := False;
return;
else
-- IO.Put("Before: "); Put_Possible(cp);
cp.possibilities(j .. cp.num_possible - 1) := cp.possibilities(j + 1 .. cp.num_possible);
cp.num_possible := cp.num_possible - 1;
-- IO.Put("After: "); Put_Possible(cp);
changed(i) := True;
if cp.num_possible = 1 then
-- IO.Put_Line("Make_Unique from Make_Unique");
Make_Unique(state, i, success, changed);
if not success then
return;
end if;
end if;
exit;
end if;
end if;
end loop;
end;
end if;
end loop;
end Make_Unique;
procedure Constrain_Letters(state : in out Decipher_State; wi : Positive; success : out Boolean; changed : in out Letter_Toggle) is
ci : Positive;
cur : Word_Vectors.Cursor := state.words(wi).words.all.First;
word : Word_List.Word;
seen : Array(Positive range 1 .. state.num_letters, Character range 'a' .. 'z') of Boolean := (others => (others => False));
used : Array(Positive range 1 .. state.num_letters) of Boolean := (others => False);
begin
success := True;
while cur /= Word_Vectors.No_Element loop
word := Word_Vectors.Element(cur);
for i in word'Range loop
exit when word(i) = ' ';
ci := Get_Character_Index(state, state.candidates(wi)(i));
seen(ci, word(i)) := True;
used(ci) := True;
end loop;
cur := Word_Vectors.Next(cur);
end loop;
for i in used'range loop
if used(i) then
-- IO.Put("Seen: ");
-- for c in Character range 'a' .. 'z' loop
-- if (seen(i, c)) then
-- IO.Put(c);
-- end if;
-- end loop;
-- IO.New_Line;
declare
cp : Char_Possibilities renames state.characters(i);
shrunk : Boolean := False;
write_head : Natural := 0;
begin
-- IO.Put("Before: "); Put_Possible(cp);
for read_head in 1 .. cp.Num_Possible loop
if seen(i, cp.possibilities(read_head)) then
write_head := write_head + 1;
if write_head /= read_head then
cp.possibilities(write_head) := cp.possibilities(read_head);
end if;
else
shrunk := True;
end if;
end loop;
cp.Num_Possible := write_head;
-- IO.Put("After: "); Put_Possible(cp);
if Shrunk then
changed(i) := True;
if cp.Num_Possible = 0 then
success := False;
return;
elsif cp.Num_Possible = 1 then
-- IO.Put_Line("Make_Unique from Constrain_Letters");
Make_Unique(state, i, success, changed);
if not success then
return;
end if;
end if;
end if;
end;
end if;
end loop;
end Constrain_Letters;
procedure Check_Constraints(state : in out Decipher_State; changed : Letter_Toggle; success : out Boolean) is
words : Word_Toggle(1 .. state.num_words) := (others => False);
follow_up : Letter_Toggle(1 .. state.num_letters) := (others => False);
any_changed : Boolean := False;
begin
success := True;
for i in 1 .. state.num_letters loop
if changed(i) then
any_changed := True;
for j in 1 .. state.num_words loop
exit when state.inclusion(i, j) = 0;
words(state.inclusion(i, j)) := True;
end loop;
end if;
end loop;
if not any_changed then
return;
end if;
for i in 1 .. state.num_words loop
if words(i) then
declare
new_words : Word_List.Word_Vector := new Word_Vectors.Vector;
begin
Filter_Word_List(state, state.candidates(i), state.words(i).words, new_words);
if Natural(new_words.Length) = 0 then
Free_Word_Vector(new_words);
success := False;
return;
elsif Natural(new_words.Length) = Natural(state.words(i).words.Length) then
-- IO.Put_Line("Word set for " & Positive'Image(i) & "(" & Image(state.candidates(i)) & ") did not shrink from " & Ada.Containers.Count_Type'Image(state.words(i).words.all.Length));
Free_Word_Vector(new_Words);
else
-- IO.Put_Line("Restricting word set for " & Positive'Image(i) & "(" & Image(state.candidates(i)) & ") from " & Ada.Containers.Count_Type'Image(state.words(i).words.all.Length) & " to " & Ada.Containers.Count_Type'Image(new_words.all.Length));
if state.words(i).is_using_root then
state.words(i).is_using_root := False;
else
Free_Word_Vector(state.words(i).words);
end if;
state.words(i).words := new_words;
Constrain_Letters(state, i, success, follow_up);
if not success then
return;
end if;
end if;
end;
end if;
end loop;
Check_Constraints(state, follow_up, success);
end Check_Constraints;
procedure Guess_Letter(state : in out Decipher_State; gi : Positive) is
begin
if gi > state.num_letters then
declare
result : Result_Set := (others => '.');
begin
-- Put_Solution(state);
for ci in 1 .. state.num_letters loop
if state.characters(ci).num_possible /= 1 then
raise Constraint_Error;
end if;
result(state.characters(ci).c) := state.characters(ci).possibilities(1);
end loop;
for wi in 1 .. state.num_words loop
if Natural(state.words(wi).words.all.Length) /= 1 then
raise Constraint_Error;
end if;
end loop;
state.results.Append(result);
end;
else
declare
ci : constant Positive := state.guess_order(gi);
begin
if state.characters(ci).num_possible = 1 then
-- Nothing to do, pass it up the line
Guess_Letter(state, gi + 1);
else
declare
success : Boolean;
changed : Letter_Toggle(1 .. state.num_letters);
characters : constant Char_Possibilities_Array := state.characters;
words : constant Word_Possibilities_Array := state.words;
cp : Char_Possibilities renames characters(ci);
begin
for mi in 1 .. cp.num_possible loop
changed := (others => False);
changed(ci) := True;
state.characters(ci).possibilities(1) := characters(ci).possibilities(mi);
-- IO.Put_Line("Guessing " & Character'Image(state.characters(ci).possibilities(mi)) & " for " & Encrypted_Char'Image(state.characters(ci).c));
state.characters(ci).num_possible := 1;
for wi in 1 .. state.num_words loop
state.words(wi).is_using_root := True;
end loop;
-- IO.Put_Line("Make_Unique from Guess_Letter");
Make_Unique(state, ci, success, changed);
if success then
Check_Constraints(state, changed, success);
if success then
Guess_Letter(state, gi + 1);
end if;
end if;
for wi in 1 .. state.num_words loop
if not state.words(wi).is_using_root then
Free_Word_Vector(state.words(wi).words);
end if;
end loop;
-- IO.Put_Line("Restore Letter guess for " & Positive'Image(ci));
state.characters := characters;
state.words := words;
end loop;
end;
end if;
end;
end if;
end Guess_Letter;
function Decipher(candidates: Candidate_Set; words: Word_List.Word_List) return Result_Vector is
letters : Character_Sets.Set;
begin
for ci in candidates'Range loop
for i in candidates(ci)'Range loop
exit when candidates(ci)(i) = ' ';
letters.Include(candidates(ci)(i));
end loop;
end loop;
declare
num_words : constant Positive := Positive(candidates'Length);
num_letters : constant Positive := Positive(letters.Length);
state : Decipher_State(num_words, num_letters);
cur : Character_Sets.Cursor := letters.First;
inclusion_priority : Priority_Pair_Array(1 .. num_letters);
begin
state.candidates := candidates;
state.inclusion := (others => (others => 0));
for i in 1 .. num_letters loop
state.characters(i).c := Character_Sets.Element(cur);
state.characters(i).num_possible := 26;
inclusion_priority(i) := (item => i, priority => 0);
for l in Character range 'a' .. 'z' loop
state.characters(i).possibilities(Character'Pos(l) - Character'Pos('a') + 1) := l;
end loop;
cur := Character_Sets.Next(cur);
end loop;
for i in 1 .. num_words loop
for l in candidates(Candidates'First + i - 1)'Range loop
declare
c : constant Encrypted_Char := candidates(Candidates'First + i - 1)(l);
ci : Positive;
begin
exit when c = ' ';
ci := Get_Character_Index(state, c);
for mi in 1 .. num_words loop
if state.inclusion(ci, mi) = 0 then
state.inclusion(ci, mi) := i;
inclusion_priority(ci).priority := mi;
exit;
elsif state.inclusion(ci, mi) = i then
exit;
end if;
end loop;
end;
end loop;
state.words(i).is_using_root := True;
state.words(i).words := words.Element(Word_List.Make_Pattern(Image(candidates(i))));
end loop;
Priority_Pair_Sort(inclusion_priority);
-- Put_Inclusion(state);
for i in inclusion_priority'range loop
state.guess_order(i) := inclusion_priority(i).item;
-- IO.Put_Line("Guess " & Integer'Image(i) & " is " & Encrypted_Char'Image(state.characters(inclusion_priority(i).item).c) & " with " & Integer'Image(inclusion_priority(i).priority) & " words connected to it");
end loop;
Guess_Letter(state, 1);
return state.results;
end;
end Decipher;
end Decipherer;
|
src/Categories/Category/Cartesian/Properties.agda | MirceaS/agda-categories | 0 | 611 | {-# OPTIONS --without-K --safe #-}
open import Categories.Category
module Categories.Category.Cartesian.Properties {o ℓ e} (C : Category o ℓ e) where
open import Level using (_⊔_)
open import Function using (_$_)
open import Data.Nat using (ℕ; zero; suc)
open import Data.Product using (Σ; _,_; proj₁) renaming (_×_ to _&_)
open import Data.Product.Properties
open import Data.List as List
open import Data.List.Relation.Unary.Any as Any using (here; there)
open import Data.List.Relation.Unary.Any.Properties
open import Data.List.Membership.Propositional
open import Data.Vec as Vec using (Vec; []; _∷_)
open import Data.Vec.Relation.Unary.Any as AnyV using (here; there)
open import Data.Vec.Relation.Unary.Any.Properties
open import Data.Vec.Membership.Propositional renaming (_∈_ to _∈ᵥ_)
open import Relation.Binary using (Rel)
open import Relation.Binary.PropositionalEquality as ≡ using (refl; _≡_)
import Data.List.Membership.Propositional.Properties as ∈ₚ
import Data.Vec.Membership.Propositional.Properties as ∈ᵥₚ
open import Categories.Category.Cartesian C
open import Categories.Diagram.Pullback C
open import Categories.Diagram.Equalizer C
open import Categories.Morphism.Reasoning C
private
open Category C
open HomReasoning
variable
A B X Y : Obj
f g : A ⇒ B
-- all binary products and pullbacks implies equalizers
module _ (prods : BinaryProducts) (pullbacks : ∀ {A B X} (f : A ⇒ X) (g : B ⇒ X) → Pullback f g) where
open BinaryProducts prods
open HomReasoning
prods×pullbacks⇒equalizers : Equalizer f g
prods×pullbacks⇒equalizers {f = f} {g = g} = record
{ arr = pb′.p₁
; equality = begin
f ∘ pb′.p₁ ≈⟨ refl⟩∘⟨ helper₁ ⟩
f ∘ pb.p₁ ∘ pb′.p₂ ≈⟨ pullˡ pb.commute ⟩
(g ∘ pb.p₂) ∘ pb′.p₂ ≈˘⟨ pushʳ helper₂ ⟩
g ∘ pb′.p₁ ∎
; equalize = λ {_ i} eq → pb′.universal $ begin
⟨ id , id ⟩ ∘ i ≈⟨ ⟨⟩∘ ⟩
⟨ id ∘ i , id ∘ i ⟩ ≈⟨ ⟨⟩-cong₂ identityˡ identityˡ ⟩
⟨ i , i ⟩ ≈˘⟨ ⟨⟩-cong₂ pb.p₁∘universal≈h₁ pb.p₂∘universal≈h₂ ⟩
⟨ pb.p₁ ∘ pb.universal eq , pb.p₂ ∘ pb.universal eq ⟩ ≈˘⟨ ⟨⟩∘ ⟩
h ∘ pb.universal eq ∎
; universal = ⟺ pb′.p₁∘universal≈h₁
; unique = λ eq → pb′.unique (⟺ eq) (pb.unique (pullˡ (⟺ helper₁) ○ ⟺ eq) (pullˡ (⟺ helper₂) ○ ⟺ eq))
}
where pb : Pullback f g
pb = pullbacks _ _
module pb = Pullback pb
h = ⟨ pb.p₁ , pb.p₂ ⟩
pb′ : Pullback ⟨ id , id ⟩ h
pb′ = pullbacks _ _
module pb′ = Pullback pb′
helper₁ : pb′.p₁ ≈ pb.p₁ ∘ pb′.p₂
helper₁ = begin
pb′.p₁ ≈˘⟨ cancelˡ project₁ ⟩
π₁ ∘ ⟨ id , id ⟩ ∘ pb′.p₁ ≈⟨ refl⟩∘⟨ pb′.commute ⟩
π₁ ∘ h ∘ pb′.p₂ ≈⟨ pullˡ project₁ ⟩
pb.p₁ ∘ pb′.p₂ ∎
helper₂ : pb′.p₁ ≈ pb.p₂ ∘ pb′.p₂
helper₂ = begin
pb′.p₁ ≈˘⟨ cancelˡ project₂ ⟩
π₂ ∘ ⟨ id , id ⟩ ∘ pb′.p₁ ≈⟨ refl⟩∘⟨ pb′.commute ⟩
π₂ ∘ h ∘ pb′.p₂ ≈⟨ pullˡ project₂ ⟩
pb.p₂ ∘ pb′.p₂ ∎
module Prods (car : Cartesian) where
open Cartesian car
-- for lists
prod : List Obj → Obj
prod objs = foldr _×_ ⊤ objs
π[_] : ∀ {x xs} → x ∈ xs → prod xs ⇒ x
π[ here refl ] = π₁
π[ there x∈xs ] = π[ x∈xs ] ∘ π₂
data _⇒_* : Obj → List Obj → Set (o ⊔ ℓ) where
_~[] : ∀ x → x ⇒ [] *
_∷_ : ∀ {x y ys} → x ⇒ y → x ⇒ ys * → x ⇒ y ∷ ys *
⟨_⟩* : ∀ {x ys} (fs : x ⇒ ys *) → x ⇒ prod ys
⟨ x ~[] ⟩* = !
⟨ f ∷ fs ⟩* = ⟨ f , ⟨ fs ⟩* ⟩
∈⇒mor : ∀ {x y ys} (fs : x ⇒ ys *) (y∈ys : y ∈ ys) → x ⇒ y
∈⇒mor (x ~[]) ()
∈⇒mor (f ∷ fs) (here refl) = f
∈⇒mor (f ∷ fs) (there y∈ys) = ∈⇒mor fs y∈ys
project* : ∀ {x y ys} (fs : x ⇒ ys *) (y∈ys : y ∈ ys) → π[ y∈ys ] ∘ ⟨ fs ⟩* ≈ ∈⇒mor fs y∈ys
project* (x ~[]) ()
project* (f ∷ fs) (here refl) = project₁
project* (f ∷ fs) (there y∈ys) = pullʳ project₂ ○ project* fs y∈ys
uniqueness* : ∀ {x ys} {g h : x ⇒ prod ys} → (∀ {y} (y∈ys : y ∈ ys) → π[ y∈ys ] ∘ g ≈ π[ y∈ys ] ∘ h) → g ≈ h
uniqueness* {x} {[]} uni = !-unique₂
uniqueness* {x} {y ∷ ys} uni = unique′ (uni (here ≡.refl)) (uniqueness* λ y∈ys → sym-assoc ○ uni (there y∈ys) ○ assoc)
module _ {a} {A : Set a} (f : A → Obj) where
uniqueness*′ : ∀ {x ys} {g h : x ⇒ prod (map f ys)} → (∀ {y} (y∈ys : y ∈ ys) → π[ ∈ₚ.∈-map⁺ f y∈ys ] ∘ g ≈ π[ ∈ₚ.∈-map⁺ f y∈ys ] ∘ h) → g ≈ h
uniqueness*′ {x} {[]} uni = !-unique₂
uniqueness*′ {x} {y ∷ ys} uni = unique′ (uni (here ≡.refl)) (uniqueness*′ λ y∈ys → sym-assoc ○ uni (there y∈ys) ○ assoc)
module _ {x} (g : ∀ a → x ⇒ f a) where
build-mors : (l : List A) → x ⇒ map f l *
build-mors [] = _ ~[]
build-mors (y ∷ l) = g y ∷ build-mors l
build-proj≡ : ∀ {a l} (a∈l : a ∈ l) → g a ≡ ∈⇒mor (build-mors l) (∈ₚ.∈-map⁺ f a∈l)
build-proj≡ (here refl) = ≡.refl
build-proj≡ (there a∈l) = build-proj≡ a∈l
build-proj : ∀ {a l} (a∈l : a ∈ l) → g a ≈ π[ ∈ₚ.∈-map⁺ f a∈l ] ∘ ⟨ build-mors l ⟩*
build-proj {_} {l} a∈l = reflexive (build-proj≡ a∈l) ○ ⟺ (project* (build-mors l) _)
build-⟨⟩*∘ : ∀ {x y} (g : ∀ a → x ⇒ f a) (h : y ⇒ x) → ∀ l → ⟨ build-mors g l ⟩* ∘ h ≈ ⟨ build-mors (λ a → g a ∘ h) l ⟩*
build-⟨⟩*∘ g h [] = !-unique₂
build-⟨⟩*∘ g h (x ∷ l) = begin
⟨ build-mors g (x ∷ l) ⟩* ∘ h ≈⟨ ⟨⟩∘ ⟩
⟨ g x ∘ h , ⟨ build-mors g l ⟩* ∘ h ⟩ ≈⟨ ⟨⟩-congˡ (build-⟨⟩*∘ g h l) ⟩
⟨ g x ∘ h , ⟨ build-mors (λ a → g a ∘ h) l ⟩* ⟩ ∎
build-uniqueness* : ∀ {x} {g h : ∀ a → x ⇒ f a} → (∀ a → g a ≈ h a) → ∀ l → ⟨ build-mors g l ⟩* ≈ ⟨ build-mors h l ⟩*
build-uniqueness* {x} {g} {h} uni [] = Equiv.refl
build-uniqueness* {x} {g} {h} uni (y ∷ l) = ⟨⟩-cong₂ (uni y) (build-uniqueness* uni l)
-- for vectors
prodᵥ : ∀ {n} → Vec Obj (suc n) → Obj
prodᵥ v = Vec.foldr₁ _×_ v
π[_]ᵥ : ∀ {n x} {xs : Vec Obj (suc n)} → x ∈ᵥ xs → prodᵥ xs ⇒ x
π[_]ᵥ {.0} {.x} {x ∷ []} (here refl) = id
π[_]ᵥ {.(suc _)} {.x} {x ∷ y ∷ xs} (here refl) = π₁
π[_]ᵥ {.(suc _)} {x} {_ ∷ y ∷ xs} (there x∈xs) = π[ x∈xs ]ᵥ ∘ π₂
data [_]_⇒ᵥ_* : ∀ n → Obj → Vec Obj n → Set (o ⊔ ℓ) where
_~[] : ∀ x → [ 0 ] x ⇒ᵥ [] *
_∷_ : ∀ {x y n} {ys : Vec Obj n} → x ⇒ y → [ n ] x ⇒ᵥ ys * → [ suc n ] x ⇒ᵥ y ∷ ys *
⟨_⟩ᵥ* : ∀ {n x ys} (fs : [ suc n ] x ⇒ᵥ ys *) → x ⇒ prodᵥ ys
⟨ f ∷ (x ~[]) ⟩ᵥ* = f
⟨ f ∷ (g ∷ fs) ⟩ᵥ* = ⟨ f , ⟨ g ∷ fs ⟩ᵥ* ⟩
∈⇒morᵥ : ∀ {n x y ys} (fs : [ n ] x ⇒ᵥ ys *) (y∈ys : y ∈ᵥ ys) → x ⇒ y
∈⇒morᵥ (x ~[]) ()
∈⇒morᵥ (f ∷ fs) (here refl) = f
∈⇒morᵥ (f ∷ fs) (there y∈ys) = ∈⇒morᵥ fs y∈ys
projectᵥ* : ∀ {n x y ys} (fs : [ suc n ] x ⇒ᵥ ys *) (y∈ys : y ∈ᵥ ys) → π[ y∈ys ]ᵥ ∘ ⟨ fs ⟩ᵥ* ≈ ∈⇒morᵥ fs y∈ys
projectᵥ* (f ∷ (x ~[])) (here ≡.refl) = identityˡ
projectᵥ* (f ∷ g ∷ fs) (here ≡.refl) = project₁
projectᵥ* (f ∷ g ∷ fs) (there y∈ys) = pullʳ project₂ ○ projectᵥ* (g ∷ fs) y∈ys
uniquenessᵥ* : ∀ {x n ys} {g h : x ⇒ prodᵥ {n} ys} → (∀ {y} (y∈ys : y ∈ᵥ ys) → π[ y∈ys ]ᵥ ∘ g ≈ π[ y∈ys ]ᵥ ∘ h) → g ≈ h
uniquenessᵥ* {x} {.0} {y ∷ []} uni = ⟺ identityˡ ○ uni (here ≡.refl) ○ identityˡ
uniquenessᵥ* {x} {.(suc _)} {y ∷ z ∷ ys} uni = unique′ (uni (here ≡.refl)) (uniquenessᵥ* (λ y∈ys → sym-assoc ○ uni (there y∈ys) ○ assoc))
module _ {a} {A : Set a} (f : A → Obj) where
uniquenessᵥ*′ : ∀ {x n ys} {g h : x ⇒ prodᵥ {n} (Vec.map f ys)} → (∀ {y} (y∈ys : y ∈ᵥ ys) → π[ ∈ᵥₚ.∈-map⁺ f y∈ys ]ᵥ ∘ g ≈ π[ ∈ᵥₚ.∈-map⁺ f y∈ys ]ᵥ ∘ h) → g ≈ h
uniquenessᵥ*′ {x} {.0} {y ∷ []} uni = ⟺ identityˡ ○ uni (here ≡.refl) ○ identityˡ
uniquenessᵥ*′ {x} {.(suc _)} {y ∷ z ∷ ys} uni = unique′ (uni (here ≡.refl)) (uniquenessᵥ*′ (λ y∈ys → sym-assoc ○ uni (there y∈ys) ○ assoc))
module _ {x} (g : ∀ a → x ⇒ f a) where
buildᵥ-mors : ∀ {n} (l : Vec A n) → [ n ] x ⇒ᵥ Vec.map f l *
buildᵥ-mors [] = _ ~[]
buildᵥ-mors (y ∷ []) = g y ∷ _ ~[]
buildᵥ-mors (y ∷ z ∷ l) = g y ∷ buildᵥ-mors (z ∷ l)
buildᵥ-proj≡ : ∀ {a n} {l : Vec A n} (a∈l : a ∈ᵥ l) → g a ≡ ∈⇒morᵥ (buildᵥ-mors l) (∈ᵥₚ.∈-map⁺ f a∈l)
buildᵥ-proj≡ {_} {_} {y ∷ []} (here refl) = ≡.refl
buildᵥ-proj≡ {_} {_} {y ∷ z ∷ l} (here refl) = ≡.refl
buildᵥ-proj≡ {_} {_} {y ∷ z ∷ l} (there a∈l) = buildᵥ-proj≡ a∈l
buildᵥ-proj : ∀ {a n} {l : Vec A (suc n)} (a∈l : a ∈ᵥ l) → g a ≈ π[ ∈ᵥₚ.∈-map⁺ f a∈l ]ᵥ ∘ ⟨ buildᵥ-mors l ⟩ᵥ*
buildᵥ-proj {_} {_} {l} a∈l = reflexive (buildᵥ-proj≡ a∈l) ○ ⟺ (projectᵥ* (buildᵥ-mors l) _)
buildᵥ-⟨⟩*∘ : ∀ {x y} (g : ∀ a → x ⇒ f a) (h : y ⇒ x) → ∀ {n} (l : Vec A (suc n)) → ⟨ buildᵥ-mors g l ⟩ᵥ* ∘ h ≈ ⟨ buildᵥ-mors (λ a → g a ∘ h) l ⟩ᵥ*
buildᵥ-⟨⟩*∘ g h (x ∷ []) = Equiv.refl
buildᵥ-⟨⟩*∘ g h (x ∷ y ∷ []) = ⟨⟩∘
buildᵥ-⟨⟩*∘ g h (x ∷ y ∷ z ∷ l) = begin
⟨ g x , ⟨ buildᵥ-mors g (y ∷ z ∷ l) ⟩ᵥ* ⟩ ∘ h ≈⟨ ⟨⟩∘ ⟩
⟨ g x ∘ h , ⟨ buildᵥ-mors g (y ∷ z ∷ l) ⟩ᵥ* ∘ h ⟩ ≈⟨ ⟨⟩-congˡ (buildᵥ-⟨⟩*∘ g h (y ∷ z ∷ l)) ⟩
⟨ g x ∘ h , ⟨ buildᵥ-mors (λ a₁ → g a₁ ∘ h) (y ∷ z ∷ l) ⟩ᵥ* ⟩ ∎
buildᵥ-uniqueness* : ∀ {x} {g h : ∀ a → x ⇒ f a} → (∀ a → g a ≈ h a) → ∀ {n} (l : Vec A (suc n)) → ⟨ buildᵥ-mors g l ⟩ᵥ* ≈ ⟨ buildᵥ-mors h l ⟩ᵥ*
buildᵥ-uniqueness* {x} {g} {h} uni (y ∷ []) = uni y
buildᵥ-uniqueness* {x} {g} {h} uni (y ∷ z ∷ []) = ⟨⟩-cong₂ (uni y) (uni z)
buildᵥ-uniqueness* {x} {g} {h} uni (y ∷ z ∷ w ∷ l) = ⟨⟩-cong₂ (uni y) (buildᵥ-uniqueness* uni (z ∷ w ∷ l))
|
oeis/168/A168428.asm | neoneye/loda-programs | 11 | 100745 | ; A168428: a(n) = 4^n mod 10.
; Submitted by <NAME>
; 1,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4,6,4
mov $2,4
pow $2,$0
mov $0,$2
mod $0,10
|
programs/oeis/275/A275019.asm | jmorken/loda | 1 | 23103 | ; A275019: 2-adic valuation of tetrahedral numbers C(n+2,3) = n(n+1)(n+2)/6 = A000292.
; 0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2,1,2,0,5,4,5,0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2,1,2,0,6,5,6,0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2,1,2,0,5,4,5,0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2,1,2,0,7,6,7,0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2,1,2,0,5,4,5,0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2,1,2,0,6,5,6,0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2,1,2,0,5,4,5,0,2,1,2,0,3,2,3,0,2,1,2,0,4,3,4,0,2,1,2,0,3,2,3,0,2
add $0,3
mov $3,$0
sub $0,1
mul $0,$3
sub $0,$3
mul $3,$0
sub $0,$3
mov $2,2
lpb $0
add $1,10
mov $4,$0
div $0,$2
add $1,4
gcd $2,$4
lpe
sub $1,27
div $1,13
|
Light/Library/Relation/Binary/Decidable.agda | zamfofex/lightlib | 1 | 5882 | <filename>Light/Library/Relation/Binary/Decidable.agda
{-# OPTIONS --omega-in-omega --no-termination-check --overlapping-instances #-}
import Light.Library.Relation.Decidable as Decidable
open import Light.Package using (Package)
module Light.Library.Relation.Binary.Decidable where
open import Light.Library.Relation.Binary using (Binary)
open import Light.Level using (Setω)
module _ ⦃ decidable‐package : Package record {Decidable} ⦄ where
DecidableBinary : Setω
DecidableBinary = ∀ {aℓ bℓ} (𝕒 : Set aℓ) (𝕓 : Set bℓ) → Binary 𝕒 𝕓
DecidableSelfBinary : Setω
DecidableSelfBinary = ∀ {aℓ} (𝕒 : Set aℓ) → Binary 𝕒 𝕒
|
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-stposu.adb | djamal2727/Main-Bearing-Analytical-Model | 0 | 13182 | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S T O R A G E _ P O O L S . S U B P O O L S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Unchecked_Conversion;
with System.Address_Image;
with System.Finalization_Masters; use System.Finalization_Masters;
with System.IO; use System.IO;
with System.Soft_Links; use System.Soft_Links;
with System.Storage_Elements; use System.Storage_Elements;
with System.Storage_Pools.Subpools.Finalization;
use System.Storage_Pools.Subpools.Finalization;
package body System.Storage_Pools.Subpools is
Finalize_Address_Table_In_Use : Boolean := False;
-- This flag should be set only when a successful allocation on a subpool
-- has been performed and the associated Finalize_Address has been added to
-- the hash table in System.Finalization_Masters.
function Address_To_FM_Node_Ptr is
new Ada.Unchecked_Conversion (Address, FM_Node_Ptr);
procedure Attach (N : not null SP_Node_Ptr; L : not null SP_Node_Ptr);
-- Attach a subpool node to a pool
-----------------------------------
-- Adjust_Controlled_Dereference --
-----------------------------------
procedure Adjust_Controlled_Dereference
(Addr : in out System.Address;
Storage_Size : in out System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count)
is
Header_And_Padding : constant Storage_Offset :=
Header_Size_With_Padding (Alignment);
begin
-- Expose the two hidden pointers by shifting the address from the
-- start of the object to the FM_Node equivalent of the pointers.
Addr := Addr - Header_And_Padding;
-- Update the size of the object to include the two pointers
Storage_Size := Storage_Size + Header_And_Padding;
end Adjust_Controlled_Dereference;
--------------
-- Allocate --
--------------
overriding procedure Allocate
(Pool : in out Root_Storage_Pool_With_Subpools;
Storage_Address : out System.Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count)
is
begin
-- Dispatch to the user-defined implementations of Allocate_From_Subpool
-- and Default_Subpool_For_Pool.
Allocate_From_Subpool
(Root_Storage_Pool_With_Subpools'Class (Pool),
Storage_Address,
Size_In_Storage_Elements,
Alignment,
Default_Subpool_For_Pool
(Root_Storage_Pool_With_Subpools'Class (Pool)));
end Allocate;
-----------------------------
-- Allocate_Any_Controlled --
-----------------------------
procedure Allocate_Any_Controlled
(Pool : in out Root_Storage_Pool'Class;
Context_Subpool : Subpool_Handle;
Context_Master : Finalization_Masters.Finalization_Master_Ptr;
Fin_Address : Finalization_Masters.Finalize_Address_Ptr;
Addr : out System.Address;
Storage_Size : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count;
Is_Controlled : Boolean;
On_Subpool : Boolean)
is
Is_Subpool_Allocation : constant Boolean :=
Pool in Root_Storage_Pool_With_Subpools'Class;
Master : Finalization_Master_Ptr := null;
N_Addr : Address;
N_Ptr : FM_Node_Ptr;
N_Size : Storage_Count;
Subpool : Subpool_Handle := null;
Lock_Taken : Boolean := False;
Header_And_Padding : Storage_Offset;
-- This offset includes the size of a FM_Node plus any additional
-- padding due to a larger alignment.
begin
-- Step 1: Pool-related runtime checks
-- Allocation on a pool_with_subpools. In this scenario there is a
-- master for each subpool. The master of the access type is ignored.
if Is_Subpool_Allocation then
-- Case of an allocation without a Subpool_Handle. Dispatch to the
-- implementation of Default_Subpool_For_Pool.
if Context_Subpool = null then
Subpool :=
Default_Subpool_For_Pool
(Root_Storage_Pool_With_Subpools'Class (Pool));
-- Allocation with a Subpool_Handle
else
Subpool := Context_Subpool;
end if;
-- Ensure proper ownership and chaining of the subpool
if Subpool.Owner /=
Root_Storage_Pool_With_Subpools'Class (Pool)'Unchecked_Access
or else Subpool.Node = null
or else Subpool.Node.Prev = null
or else Subpool.Node.Next = null
then
raise Program_Error with "incorrect owner of subpool";
end if;
Master := Subpool.Master'Unchecked_Access;
-- Allocation on a simple pool. In this scenario there is a master for
-- each access-to-controlled type. No context subpool should be present.
else
-- If the master is missing, then the expansion of the access type
-- failed to create one. This is a compiler bug.
pragma Assert
(Context_Master /= null, "missing master in pool allocation");
-- If a subpool is present, then this is the result of erroneous
-- allocator expansion. This is not a serious error, but it should
-- still be detected.
if Context_Subpool /= null then
raise Program_Error
with "subpool not required in pool allocation";
end if;
-- If the allocation is intended to be on a subpool, but the access
-- type's pool does not support subpools, then this is the result of
-- incorrect end-user code.
if On_Subpool then
raise Program_Error
with "pool of access type does not support subpools";
end if;
Master := Context_Master;
end if;
-- Step 2: Master, Finalize_Address-related runtime checks and size
-- calculations.
-- Allocation of a descendant from [Limited_]Controlled, a class-wide
-- object or a record with controlled components.
if Is_Controlled then
-- Synchronization:
-- Read - allocation, finalization
-- Write - finalization
Lock_Taken := True;
Lock_Task.all;
-- Do not allow the allocation of controlled objects while the
-- associated master is being finalized.
if Finalization_Started (Master.all) then
raise Program_Error with "allocation after finalization started";
end if;
-- Check whether primitive Finalize_Address is available. If it is
-- not, then either the expansion of the designated type failed or
-- the expansion of the allocator failed. This is a compiler bug.
pragma Assert
(Fin_Address /= null, "primitive Finalize_Address not available");
-- The size must account for the hidden header preceding the object.
-- Account for possible padding space before the header due to a
-- larger alignment.
Header_And_Padding := Header_Size_With_Padding (Alignment);
N_Size := Storage_Size + Header_And_Padding;
-- Non-controlled allocation
else
N_Size := Storage_Size;
end if;
-- Step 3: Allocation of object
-- For descendants of Root_Storage_Pool_With_Subpools, dispatch to the
-- implementation of Allocate_From_Subpool.
if Is_Subpool_Allocation then
Allocate_From_Subpool
(Root_Storage_Pool_With_Subpools'Class (Pool),
N_Addr, N_Size, Alignment, Subpool);
-- For descendants of Root_Storage_Pool, dispatch to the implementation
-- of Allocate.
else
Allocate (Pool, N_Addr, N_Size, Alignment);
end if;
-- Step 4: Attachment
if Is_Controlled then
-- Note that we already did "Lock_Task.all;" in Step 2 above
-- Map the allocated memory into a FM_Node record. This converts the
-- top of the allocated bits into a list header. If there is padding
-- due to larger alignment, the header is placed right next to the
-- object:
-- N_Addr N_Ptr
-- | |
-- V V
-- +-------+---------------+----------------------+
-- |Padding| Header | Object |
-- +-------+---------------+----------------------+
-- ^ ^ ^
-- | +- Header_Size -+
-- | |
-- +- Header_And_Padding --+
N_Ptr :=
Address_To_FM_Node_Ptr (N_Addr + Header_And_Padding - Header_Size);
-- Prepend the allocated object to the finalization master
-- Synchronization:
-- Write - allocation, deallocation, finalization
Attach_Unprotected (N_Ptr, Objects (Master.all));
-- Move the address from the hidden list header to the start of the
-- object. This operation effectively hides the list header.
Addr := N_Addr + Header_And_Padding;
-- Homogeneous masters service the following:
-- 1) Allocations on / Deallocations from regular pools
-- 2) Named access types
-- 3) Most cases of anonymous access types usage
-- Synchronization:
-- Read - allocation, finalization
-- Write - outside
if Master.Is_Homogeneous then
-- Synchronization:
-- Read - finalization
-- Write - allocation, outside
Set_Finalize_Address_Unprotected (Master.all, Fin_Address);
-- Heterogeneous masters service the following:
-- 1) Allocations on / Deallocations from subpools
-- 2) Certain cases of anonymous access types usage
else
-- Synchronization:
-- Read - finalization
-- Write - allocation, deallocation
Set_Heterogeneous_Finalize_Address_Unprotected (Addr, Fin_Address);
Finalize_Address_Table_In_Use := True;
end if;
Unlock_Task.all;
Lock_Taken := False;
-- Non-controlled allocation
else
Addr := N_Addr;
end if;
exception
when others =>
-- Unlock the task in case the allocation step failed and reraise the
-- exception.
if Lock_Taken then
Unlock_Task.all;
end if;
raise;
end Allocate_Any_Controlled;
------------
-- Attach --
------------
procedure Attach (N : not null SP_Node_Ptr; L : not null SP_Node_Ptr) is
begin
-- Ensure that the node has not been attached already
pragma Assert (N.Prev = null and then N.Next = null);
Lock_Task.all;
L.Next.Prev := N;
N.Next := L.Next;
L.Next := N;
N.Prev := L;
Unlock_Task.all;
-- Note: No need to unlock in case of an exception because the above
-- code can never raise one.
end Attach;
-------------------------------
-- Deallocate_Any_Controlled --
-------------------------------
procedure Deallocate_Any_Controlled
(Pool : in out Root_Storage_Pool'Class;
Addr : System.Address;
Storage_Size : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count;
Is_Controlled : Boolean)
is
N_Addr : Address;
N_Ptr : FM_Node_Ptr;
N_Size : Storage_Count;
Header_And_Padding : Storage_Offset;
-- This offset includes the size of a FM_Node plus any additional
-- padding due to a larger alignment.
begin
-- Step 1: Detachment
if Is_Controlled then
Lock_Task.all;
begin
-- Destroy the relation pair object - Finalize_Address since it is
-- no longer needed.
if Finalize_Address_Table_In_Use then
-- Synchronization:
-- Read - finalization
-- Write - allocation, deallocation
Delete_Finalize_Address_Unprotected (Addr);
end if;
-- Account for possible padding space before the header due to a
-- larger alignment.
Header_And_Padding := Header_Size_With_Padding (Alignment);
-- N_Addr N_Ptr Addr (from input)
-- | | |
-- V V V
-- +-------+---------------+----------------------+
-- |Padding| Header | Object |
-- +-------+---------------+----------------------+
-- ^ ^ ^
-- | +- Header_Size -+
-- | |
-- +- Header_And_Padding --+
-- Convert the bits preceding the object into a list header
N_Ptr := Address_To_FM_Node_Ptr (Addr - Header_Size);
-- Detach the object from the related finalization master. This
-- action does not need to know the prior context used during
-- allocation.
-- Synchronization:
-- Write - allocation, deallocation, finalization
Detach_Unprotected (N_Ptr);
-- Move the address from the object to the beginning of the list
-- header.
N_Addr := Addr - Header_And_Padding;
-- The size of the deallocated object must include the size of the
-- hidden list header.
N_Size := Storage_Size + Header_And_Padding;
Unlock_Task.all;
exception
when others =>
-- Unlock the task in case the computations performed above
-- fail for some reason.
Unlock_Task.all;
raise;
end;
else
N_Addr := Addr;
N_Size := Storage_Size;
end if;
-- Step 2: Deallocation
-- Dispatch to the proper implementation of Deallocate. This action
-- covers both Root_Storage_Pool and Root_Storage_Pool_With_Subpools
-- implementations.
Deallocate (Pool, N_Addr, N_Size, Alignment);
end Deallocate_Any_Controlled;
------------------------------
-- Default_Subpool_For_Pool --
------------------------------
function Default_Subpool_For_Pool
(Pool : in out Root_Storage_Pool_With_Subpools)
return not null Subpool_Handle
is
pragma Unreferenced (Pool);
begin
return raise Program_Error with
"default Default_Subpool_For_Pool called; must be overridden";
end Default_Subpool_For_Pool;
------------
-- Detach --
------------
procedure Detach (N : not null SP_Node_Ptr) is
begin
-- Ensure that the node is attached to some list
pragma Assert (N.Next /= null and then N.Prev /= null);
Lock_Task.all;
N.Prev.Next := N.Next;
N.Next.Prev := N.Prev;
N.Prev := null;
N.Next := null;
Unlock_Task.all;
-- Note: No need to unlock in case of an exception because the above
-- code can never raise one.
end Detach;
--------------
-- Finalize --
--------------
overriding procedure Finalize (Controller : in out Pool_Controller) is
begin
Finalize_Pool (Controller.Enclosing_Pool.all);
end Finalize;
-------------------
-- Finalize_Pool --
-------------------
procedure Finalize_Pool (Pool : in out Root_Storage_Pool_With_Subpools) is
Curr_Ptr : SP_Node_Ptr;
Ex_Occur : Exception_Occurrence;
Raised : Boolean := False;
function Is_Empty_List (L : not null SP_Node_Ptr) return Boolean;
-- Determine whether a list contains only one element, the dummy head
-------------------
-- Is_Empty_List --
-------------------
function Is_Empty_List (L : not null SP_Node_Ptr) return Boolean is
begin
return L.Next = L and then L.Prev = L;
end Is_Empty_List;
-- Start of processing for Finalize_Pool
begin
-- It is possible for multiple tasks to cause the finalization of a
-- common pool. Allow only one task to finalize the contents.
if Pool.Finalization_Started then
return;
end if;
-- Lock the pool to prevent the creation of additional subpools while
-- the available ones are finalized. The pool remains locked because
-- either it is about to be deallocated or the associated access type
-- is about to go out of scope.
Pool.Finalization_Started := True;
while not Is_Empty_List (Pool.Subpools'Unchecked_Access) loop
Curr_Ptr := Pool.Subpools.Next;
-- Perform the following actions:
-- 1) Finalize all objects chained on the subpool's master
-- 2) Remove the subpool from the owner's list of subpools
-- 3) Deallocate the doubly linked list node associated with the
-- subpool.
-- 4) Call Deallocate_Subpool
begin
Finalize_And_Deallocate (Curr_Ptr.Subpool);
exception
when Fin_Occur : others =>
if not Raised then
Raised := True;
Save_Occurrence (Ex_Occur, Fin_Occur);
end if;
end;
end loop;
-- If the finalization of a particular master failed, reraise the
-- exception now.
if Raised then
Reraise_Occurrence (Ex_Occur);
end if;
end Finalize_Pool;
------------------------------
-- Header_Size_With_Padding --
------------------------------
function Header_Size_With_Padding
(Alignment : System.Storage_Elements.Storage_Count)
return System.Storage_Elements.Storage_Count
is
Size : constant Storage_Count := Header_Size;
begin
if Size mod Alignment = 0 then
return Size;
-- Add enough padding to reach the nearest multiple of the alignment
-- rounding up.
else
return ((Size + Alignment - 1) / Alignment) * Alignment;
end if;
end Header_Size_With_Padding;
----------------
-- Initialize --
----------------
overriding procedure Initialize (Controller : in out Pool_Controller) is
begin
Initialize_Pool (Controller.Enclosing_Pool.all);
end Initialize;
---------------------
-- Initialize_Pool --
---------------------
procedure Initialize_Pool (Pool : in out Root_Storage_Pool_With_Subpools) is
begin
-- The dummy head must point to itself in both directions
Pool.Subpools.Next := Pool.Subpools'Unchecked_Access;
Pool.Subpools.Prev := Pool.Subpools'Unchecked_Access;
end Initialize_Pool;
---------------------
-- Pool_Of_Subpool --
---------------------
function Pool_Of_Subpool
(Subpool : not null Subpool_Handle)
return access Root_Storage_Pool_With_Subpools'Class
is
begin
return Subpool.Owner;
end Pool_Of_Subpool;
----------------
-- Print_Pool --
----------------
procedure Print_Pool (Pool : Root_Storage_Pool_With_Subpools) is
Head : constant SP_Node_Ptr := Pool.Subpools'Unrestricted_Access;
Head_Seen : Boolean := False;
SP_Ptr : SP_Node_Ptr;
begin
-- Output the contents of the pool
-- Pool : 0x123456789
-- Subpools : 0x123456789
-- Fin_Start : TRUE <or> FALSE
-- Controller: OK <or> NOK
Put ("Pool : ");
Put_Line (Address_Image (Pool'Address));
Put ("Subpools : ");
Put_Line (Address_Image (Pool.Subpools'Address));
Put ("Fin_Start : ");
Put_Line (Pool.Finalization_Started'Img);
Put ("Controlled: ");
if Pool.Controller.Enclosing_Pool = Pool'Unrestricted_Access then
Put_Line ("OK");
else
Put_Line ("NOK (ERROR)");
end if;
SP_Ptr := Head;
while SP_Ptr /= null loop -- Should never be null
Put_Line ("V");
-- We see the head initially; we want to exit when we see the head a
-- second time.
if SP_Ptr = Head then
exit when Head_Seen;
Head_Seen := True;
end if;
-- The current element is null. This should never happend since the
-- list is circular.
if SP_Ptr.Prev = null then
Put_Line ("null (ERROR)");
-- The current element points back to the correct element
elsif SP_Ptr.Prev.Next = SP_Ptr then
Put_Line ("^");
-- The current element points to an erroneous element
else
Put_Line ("? (ERROR)");
end if;
-- Output the contents of the node
Put ("|Header: ");
Put (Address_Image (SP_Ptr.all'Address));
if SP_Ptr = Head then
Put_Line (" (dummy head)");
else
Put_Line ("");
end if;
Put ("| Prev: ");
if SP_Ptr.Prev = null then
Put_Line ("null");
else
Put_Line (Address_Image (SP_Ptr.Prev.all'Address));
end if;
Put ("| Next: ");
if SP_Ptr.Next = null then
Put_Line ("null");
else
Put_Line (Address_Image (SP_Ptr.Next.all'Address));
end if;
Put ("| Subp: ");
if SP_Ptr.Subpool = null then
Put_Line ("null");
else
Put_Line (Address_Image (SP_Ptr.Subpool.all'Address));
end if;
SP_Ptr := SP_Ptr.Next;
end loop;
end Print_Pool;
-------------------
-- Print_Subpool --
-------------------
procedure Print_Subpool (Subpool : Subpool_Handle) is
begin
if Subpool = null then
Put_Line ("null");
return;
end if;
-- Output the contents of a subpool
-- Owner : 0x123456789
-- Master: 0x123456789
-- Node : 0x123456789
Put ("Owner : ");
if Subpool.Owner = null then
Put_Line ("null");
else
Put_Line (Address_Image (Subpool.Owner'Address));
end if;
Put ("Master: ");
Put_Line (Address_Image (Subpool.Master'Address));
Put ("Node : ");
if Subpool.Node = null then
Put ("null");
if Subpool.Owner = null then
Put_Line (" OK");
else
Put_Line (" (ERROR)");
end if;
else
Put_Line (Address_Image (Subpool.Node'Address));
end if;
Print_Master (Subpool.Master);
end Print_Subpool;
-------------------------
-- Set_Pool_Of_Subpool --
-------------------------
procedure Set_Pool_Of_Subpool
(Subpool : not null Subpool_Handle;
To : in out Root_Storage_Pool_With_Subpools'Class)
is
N_Ptr : SP_Node_Ptr;
begin
-- If the subpool is already owned, raise Program_Error. This is a
-- direct violation of the RM rules.
if Subpool.Owner /= null then
raise Program_Error with "subpool already belongs to a pool";
end if;
-- Prevent the creation of a new subpool while the owner is being
-- finalized. This is a serious error.
if To.Finalization_Started then
raise Program_Error
with "subpool creation after finalization started";
end if;
Subpool.Owner := To'Unchecked_Access;
-- Create a subpool node and decorate it. Since this node is not
-- allocated on the owner's pool, it must be explicitly destroyed by
-- Finalize_And_Detach.
N_Ptr := new SP_Node;
N_Ptr.Subpool := Subpool;
Subpool.Node := N_Ptr;
Attach (N_Ptr, To.Subpools'Unchecked_Access);
-- Mark the subpool's master as being a heterogeneous collection of
-- controlled objects.
Set_Is_Heterogeneous (Subpool.Master);
end Set_Pool_Of_Subpool;
end System.Storage_Pools.Subpools;
|
memsim-master/src/memory-container.ads | strenkml/EE368 | 0 | 29577 | <reponame>strenkml/EE368
package Memory.Container is
type Container_Type is abstract new Memory_Type with private;
type Container_Pointer is access all Container_Type'Class;
function Get_Memory(mem : Container_Type'Class) return Memory_Pointer;
procedure Set_Memory(mem : in out Container_Type'Class;
other : access Memory_Type'Class);
overriding
function Done(mem : Container_Type) return Boolean;
overriding
procedure Reset(mem : in out Container_Type;
context : in Natural);
overriding
procedure Set_Port(mem : in out Container_Type;
port : in Natural;
ready : out Boolean);
overriding
procedure Read(mem : in out Container_Type;
address : in Address_Type;
size : in Positive);
overriding
procedure Write(mem : in out Container_Type;
address : in Address_Type;
size : in Positive);
overriding
procedure Idle(mem : in out Container_Type;
cycles : in Time_Type);
procedure Start(mem : in out Container_Type'Class);
procedure Commit(mem : in out Container_Type'Class;
cycles : out Time_Type);
procedure Do_Read(mem : in out Container_Type'Class;
address : in Address_Type;
size : in Positive);
procedure Do_Write(mem : in out Container_Type'Class;
address : in Address_Type;
size : in Positive);
procedure Do_Idle(mem : in out Container_Type'Class;
cycles : in Time_Type);
overriding
function Get_Path_Length(mem : Container_Type) return Natural;
overriding
procedure Show_Access_Stats(mem : in out Container_Type);
overriding
function To_String(mem : Container_Type) return Unbounded_String;
overriding
function Get_Cost(mem : Container_Type) return Cost_Type;
overriding
function Get_Writes(mem : Container_Type) return Long_Integer;
overriding
function Get_Word_Size(mem : Container_Type) return Positive;
overriding
function Get_Ports(mem : Container_Type) return Port_Vector_Type;
overriding
procedure Adjust(mem : in out Container_Type);
overriding
procedure Finalize(mem : in out Container_Type);
private
type Container_Type is abstract new Memory_Type with record
mem : access Memory_Type'Class := null;
start_time : Time_Type := 0;
end record;
end Memory.Container;
|
libsrc/osca/find_file.asm | meesokim/z88dk | 0 | 10323 | <reponame>meesokim/z88dk
; int find_file (char *filename, struct flos_file file);
; CALLER linkage for function pointers
;
; $Id: find_file.asm,v 1.3 2015/01/19 01:33:00 pauloscustodio Exp $
;
PUBLIC find_file
EXTERN find_file_callee
EXTERN ASMDISP_FIND_FILE_CALLEE
find_file:
pop bc
pop de ; ptr to file struct
pop hl ; ptr to file name
push hl
push de
push bc
jp find_file_callee + ASMDISP_FIND_FILE_CALLEE
|
programs/oeis/089/A089061.asm | karttu/loda | 0 | 16888 | <reponame>karttu/loda
; A089061: a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2).
; 5,7,10,13,17,22,29,39,54,77,113,170,261,407,642,1021,1633,2622,4221,6807,10990,17757,28705,46418,75077,121447,196474,317869,514289,832102,1346333,2178375,3524646,5702957,9227537,14930426,24157893
mov $1,1
mov $4,$0
lpb $0,1
sub $0,1
add $3,1
mov $2,$3
mov $3,$1
add $1,$2
lpe
mov $1,1
trn $2,1
add $2,3
add $1,$2
lpb $4,1
add $1,2
sub $4,1
lpe
add $1,1
|
asm/string_io.asm | LSantos06/IA-32 | 0 | 88299 | section .data
endereco dq 0
tam dd 5
section .text
global _start
_start:
;Endereco de memoria de onde esta a string, tamanho da string
;LerString
push tam
push endereco
call LerString
;TESTE
;MOV [letra], eax
;ADD BYTE [letra], 0x30
;MOV ECX,letra
;MOV EBX,1
;MOV EDX,1
;MOV EAX,4
;INT 80h
;EscreverString
push tam
push endereco
call EscreverString
;TESTE
;MOV [letra], eax
;ADD BYTE [letra], 0x30
;MOV ECX,letra
;MOV EBX,1
;MOV EDX,1
;MOV EAX,4
;INT 80h
Fim:
;return 0
mov EAX,1
mov EBX,0
int 80h
LerString:
;cria frame de pilha, 1 byte para char lido
enter 1,0
;registradores utilizados
push EBX
push ECX
push EDX
;ENDERECO
mov EAX,[EBP+8]
;TAM
mov EDX,[EBP+12]
mov ECX,[EDX]
LS_leitura:
;TAM atual
push ECX
;ENDERECO
push EAX
;le um CHAR do teclado
mov EAX,3
mov EBX,0
;EBP-1, variavel local
mov ECX,EBP
dec ECX
mov EDX,1
int 80h
;armazenando CHAR no ENDERECO
mov EBX,[ECX]
pop EAX
mov [EAX],EBX
;verifica se o CHAR eh enter
cmp EBX,0x0A
je LS_enter
;escreve proximo CHAR, se ainda nao chegou ao TAM
inc EAX
;ve se ainda tem TAM
pop ECX
loop LS_leitura
jmp LS_final
LS_enter:
;registradores utilizados
pop ECX
pop EDX
pop EBX
;retorno em EAX
dec ECX
mov EAX,[EBP+12]
mov EAX,[EAX]
sub EAX,ECX
;limpa frame de pilha
mov ESP,EBP
pop EBP
ret
LS_final:
;registradores utilizados
pop EDX
pop ECX
pop EBX
;retorno em EAX
mov EAX,[EBP+12]
mov EAX,[EAX]
add EAX,1
;limpa frame de pilha
leave
ret
EscreverString:
;cria frame de pilha
enter 0,0
;registradores utilizados
push EBX
push ECX
push EDX
;ENDERECO
mov EAX,[EBP+8]
;TAM
mov EDX,[EBP+12]
mov ECX,[EDX]
ES_leitura:
;TAM atual
push ECX
push EAX
;le um CHAR da memoria
mov EBX,1
pop EAX
mov ECX,EAX
push EAX
mov EAX,4
mov EDX,1
int 80h
;imprime proximo CHAR, se ainda nao chegou ao TAM
pop EAX
inc EAX
;verifica se o CHAR eh enter
cmp DWORD [ECX],0x0A
je ES_enter
;ve se ainda tem TAM
pop ECX
loop ES_leitura
jmp ES_final
ES_enter:
;registradores utilizados
pop ECX
pop EDX
pop EBX
;retorno em EAX
dec ECX
mov EAX,[EBP+12]
mov EAX,[EAX]
sub EAX,ECX
;limpa frame de pilha
mov ESP,EBP
pop EBP
ret
ES_final:
;registradores utilizados
pop EDX
pop ECX
pop EBX
;retorno em EAX
mov EAX,[EBP+12]
mov EAX,[EAX]
add EAX,1
;limpa frame de pilha
leave
ret
|
programs/oeis/033/A033550.asm | karttu/loda | 0 | 177390 | ; A033550: a(n) = A005248(n) - n.
; 2,2,5,15,43,118,316,836,2199,5769,15117,39592,103670,271430,710633,1860483,4870831,12752026,33385264,87403784,228826107,599074557,1568397585,4106118220,10749957098,28143753098,73681302221,192900153591
mov $1,2
lpb $0,1
sub $0,1
add $1,$3
add $2,1
add $3,$1
add $3,$2
lpe
|
boards/stm32f722_nucleo/src/stm32-board.ads | morbos/Ada_Drivers_Library | 2 | 15484 | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This file provides declarations for devices on the STM32F7 Discovery kits
-- manufactured by ST Microelectronics.
with Ada.Interrupts.Names; use Ada.Interrupts;
with STM32.Device; use STM32.Device;
with STM32.GPIO; use STM32.GPIO;
use STM32;
package STM32.Board is
pragma Elaborate_Body;
subtype User_LED is GPIO_Point;
Green_LED : User_LED renames PB0;
Red_LED : User_LED renames PB14;
Blue_LED : User_LED renames PB7;
LCH_LED : User_LED renames Red_LED;
All_LEDs : GPIO_Points := (Green_LED & Red_LED & Blue_LED);
procedure Initialize_LEDs;
-- MUST be called prior to any use of the LEDs
procedure Turn_On (This : in out User_LED) renames STM32.GPIO.Set;
procedure Turn_Off (This : in out User_LED) renames STM32.GPIO.Clear;
procedure Toggle (This : in out User_LED) renames STM32.GPIO.Toggle;
procedure All_LEDs_Off with Inline;
procedure All_LEDs_On with Inline;
procedure Toggle_LEDs (These : in out GPIO_Points)
renames STM32.GPIO.Toggle;
-- User button
User_Button_Point : GPIO_Point renames PC13;
User_Button_Interrupt : constant Interrupt_ID := Names.EXTI15_10_Interrupt;
procedure Configure_User_Button_GPIO;
-- Configures the GPIO port/pin for the blue user button. Sufficient
-- for polling the button, and necessary for having the button generate
-- interrupts.
end STM32.Board;
|
programs/oeis/257/A257352.asm | neoneye/loda | 22 | 243412 | ; A257352: G.f.: (1-2*x+51*x^2)/(1-x)^3.
; 1,1,51,151,301,501,751,1051,1401,1801,2251,2751,3301,3901,4551,5251,6001,6801,7651,8551,9501,10501,11551,12651,13801,15001,16251,17551,18901,20301,21751,23251,24801,26401,28051,29751,31501,33301
bin $0,2
mul $0,50
add $0,1
|
.build/ada/asis-gela-scanner_tables.ads | faelys/gela-asis | 4 | 14372 | <reponame>faelys/gela-asis
with Gela.Classificators;
with Gela.Character_Class_Buffers; use Gela;
with Asis.Gela.Parser.Tokens;
package Asis.Gela.Scanner_Tables is
subtype Token is Asis.Gela.Parser.Tokens.Token;
Error : constant Token := Asis.Gela.Parser.Tokens.Error;
subtype Character_Class is Character_Class_Buffers.Character_Class
range 0 .. 57;
type State is mod 359;
Default : constant State := 0;
Allow_Char : constant State := 334;
Allow_Keyword : constant State := 357;
function Switch (S : State; C : Character_Class) return State;
pragma Inline (Switch);
function Accepted (S : State) return Token;
pragma Inline (Accepted);
subtype Code_Point is Classificators.Code_Point;
function Get_Class (Pos : Code_Point) return Character_Class;
end Asis.Gela.Scanner_Tables;
|
ssql-core/src/main/resources/antlr4/SsqlLexer.g4 | koshox/ssql | 3 | 652 | lexer grammar SsqlLexer;
@header {package com.kosho.ssql.core.dsl.parser;}
channels {
ERROR_CHANNEL
}
// SKIP
SPACE: [ \t\r\n]+ -> channel(HIDDEN);
COMMENT: '/*' .*? '*/' -> channel(HIDDEN);
LINE_COMMENT: (
('-- ' | '#') ~[\r\n]* ('\r'? '\n' | EOF)
| '--' ('\r'? '\n' | EOF)
) -> channel(HIDDEN);
// KEYWORD
SELECT: S E L E C T;
DISTINCT:D I S T I N C T;
FROM: F R O M;
WHERE: W H E R E;
ORDER: O R D E R;
GROUP: G R O U P;
HAVING: H A V I N G;
NULLS: N U L L S;
FIRST: F I R S T;
LAST: L A S T;
ASC: A S C;
DESC: D E S C;
BY: B Y;
AS: A S;
AND: A N D;
OR: O R;
NOT: N O T;
IS: I S;
LIKE: L I K E;
CONTAINS: C O N T A I N S;
BETWEEN: B E T W E E N;
EXISTS: E X I S T S;
LIMIT: L I M I T;
TRUE: T R U E;
FALSE: F A L S E;
EMPTY: E M P T Y;
NULL: N U L L;
// ARITH OP
STAR: '*';
DIV: '/';
MOD: '%';
PLUS: '+';
MINUS: '-';
// COMPARE OP
EQ: '=';
EQS: '==';
NOT_EQ: '!=';
GT: '>';
GTE: '>=';
LT: '<';
LTE: '<=';
IN: I N;
// CONSTRUCTORS
DOT: '.';
LBKT: '(';
RBKT: ')';
COMMA: ',';
SEMI: ';';
AT_SIGN: '@';
SINGLE_QUOTE: '\'';
DOUBLE_QUOTE: '"';
REVERSE_QUOTE: '`';
COLON: ':';
DOLLAR: '$';
// STRING
SQUOTE_STRING: '\'' ('\\'. | '\'\'' | ~('\'' | '\\'))* '\'';
DQUOTE_STRING: '"' ('\\'. | '""' | ~('"' | '\\'))* '"';
RQUOTE_STRING: '`' ('\\'. | '``' | ~('`' | '\\'))* '`';
// NUMBER
INTEGER: DEG_DIGIT+;
DECIMAL: ('0' | [1-9] DEG_DIGIT*) (DOT DEG_DIGIT+)? ([eE] [+\-]? DEG_DIGIT+)?;
// ID
ID: [a-zA-Z0-9_]*? [a-zA-Z_]+? [a-zA-Z0-9_]*;
// FRAGMENT
fragment A: [aA];
fragment B: [bB];
fragment C: [cC];
fragment D: [dD];
fragment E: [eE];
fragment F: [fF];
fragment G: [gG];
fragment H: [hH];
fragment I: [iI];
fragment J: [jJ];
fragment K: [kK];
fragment L: [lL];
fragment M: [mM];
fragment N: [nN];
fragment O: [oO];
fragment P: [pP];
fragment Q: [qQ];
fragment R: [rR];
fragment S: [sS];
fragment T: [tT];
fragment U: [uU];
fragment V: [vV];
fragment W: [wW];
fragment X: [xX];
fragment Y: [yY];
fragment Z: [zZ];
fragment DEG_DIGIT: [0-9]; |
Data/Num/Continuous.agda | banacorn/numeral | 1 | 6679 | module Data.Num.Continuous where
open import Data.Num.Core
open import Data.Num.Maximum
open import Data.Num.Bounded
open import Data.Num.Next
open import Data.Num.Increment
open import Data.Nat
open import Data.Nat.Properties
open import Data.Nat.Properties.Simple
open import Data.Nat.Properties.Extra
open import Data.Fin as Fin
using (Fin; fromℕ≤; inject≤)
renaming (zero to z; suc to s)
open import Data.Fin.Properties using (toℕ-fromℕ≤; bounded)
open import Data.Product
open import Function
open import Relation.Nullary.Decidable
open import Relation.Nullary
open import Relation.Nullary.Negation
open import Relation.Binary
open import Relation.Binary.PropositionalEquality
open ≡-Reasoning
open ≤-Reasoning renaming (begin_ to start_; _∎ to _□; _≡⟨_⟩_ to _≈⟨_⟩_)
open DecTotalOrder decTotalOrder using (reflexive) renaming (refl to ≤-refl)
------------------------------------------------------------------------
Continuous : ∀ b d o → Set
Continuous b d o = (xs : Numeral b d o) → Incrementable xs
Bounded⇒¬Continuous : ∀ {b d o}
→ Bounded b d o
→ ¬ (Continuous b d o)
Bounded⇒¬Continuous (xs , max) claim = contradiction (claim xs) (Maximum⇒¬Incrementable xs max)
first-endpoint : ∀ b d o → Numeral (suc b) (suc d) o
first-endpoint b d o = greatest-digit d ∙
first-endpoint-¬Incrementable : ∀ {b d o}
→ (proper : 2 ≤ suc (d + o))
→ (gapped : Gapped#0 b d o)
→ ¬ (Incrementable (first-endpoint b d o))
first-endpoint-¬Incrementable {b} {d} {o} proper gapped with nextView (first-endpoint b d o) proper
first-endpoint-¬Incrementable proper gapped | Interval b d o ¬greatest
= contradiction (greatest-digit-is-the-Greatest d) ¬greatest
first-endpoint-¬Incrementable proper gapped | GappedEndpoint b d o greatest _
= GappedEndpoint⇒¬Incrementable (first-endpoint b d o) greatest proper gapped
first-endpoint-¬Incrementable proper gapped | UngappedEndpoint b d o greatest ¬gapped
= contradiction gapped ¬gapped
Gapped#0⇒¬Continuous : ∀ {b d o}
→ (proper : 2 ≤ suc (d + o))
→ (gapped : Gapped#0 b d o)
→ ¬ (Continuous (suc b) (suc d) o)
Gapped#0⇒¬Continuous {b} {d} {o} proper gapped#0 cont
= contradiction
(cont (first-endpoint b d o))
(first-endpoint-¬Incrementable proper gapped#0)
¬Gapped#0⇒Continuous : ∀ {b d o}
→ (proper : 2 ≤ suc (d + o))
→ (¬gapped : ¬ (Gapped#0 b d o))
→ Continuous (suc b) (suc d) o
¬Gapped#0⇒Continuous proper ¬gapped#0 xs with Incrementable? xs
¬Gapped#0⇒Continuous proper ¬gapped#0 xs | yes incr = incr
¬Gapped#0⇒Continuous proper ¬gapped#0 xs | no ¬incr = contradiction
(¬Gapped⇒Incrementable xs proper (¬Gapped#0⇒¬Gapped xs proper ¬gapped#0))
¬incr
Continuous-Proper : ∀ b d o
→ (proper : 2 ≤ suc (d + o))
→ Dec (Continuous (suc b) (suc d) o)
Continuous-Proper b d o proper with Gapped#0? b d o
Continuous-Proper b d o proper | yes gapped#0 = no (Gapped#0⇒¬Continuous proper gapped#0)
Continuous-Proper b d o proper | no ¬gapped#0 = yes (¬Gapped#0⇒Continuous proper ¬gapped#0)
Continuous? : ∀ b d o → Dec (Continuous b d o)
Continuous? b d o with numView b d o
Continuous? _ _ _ | NullBase d o = no (Bounded⇒¬Continuous (Bounded-NullBase d o))
Continuous? _ _ _ | NoDigits b o = yes (λ xs → NoDigits-explode xs)
Continuous? _ _ _ | AllZeros b = no (Bounded⇒¬Continuous (Bounded-AllZeros b))
Continuous? _ _ _ | Proper b d o proper = Continuous-Proper b d o proper
-- Continuous⇒¬Gapped#0 : ∀ {b d o}
-- → (cont : True (Continuous? (suc b) (suc d) o))
-- → (proper : suc d + o ≥ 2)
-- → ¬ (Gapped#0 b d o)
-- Continuous⇒¬Gapped#0 cont proper gapped#0 = contradiction (toWitness cont) (Gapped#0⇒¬Continuous proper gapped#0)
-- -- a partial function that only maps ℕ to Continuous Nums
-- fromℕ : ∀ {b d o}
-- → (True (Continuous? b (suc d) o))
-- → (val : ℕ)
-- → (True (o ≤? val))
-- → Numeral b (suc d) o
-- fromℕ {o = zero} cont zero o≤n = z ∙
-- fromℕ {o = zero} cont (suc n) o≤n = 1+ cont (fromℕ cont n tt)
-- fromℕ {o = suc o} cont zero ()
-- fromℕ {o = suc o} cont (suc n) o≤n with o ≟ n
-- fromℕ {b} {d} {suc o} cont (suc n) o≤n | yes o≡n = z ∙
-- fromℕ {b} {d} {suc o} cont (suc n) o≤n | no o≢n = 1+ cont (fromℕ cont n (fromWitness o<n))
-- where
-- o<n : o < n
-- o<n = ≤∧≢⇒< (≤-pred (toWitness o≤n)) o≢n
1+ : ∀ {b d o}
→ {cont : True (Continuous? b d o)}
→ (xs : Numeral b d o)
→ Numeral b d o
1+ {cont = cont} xs = proj₁ (toWitness cont xs)
1+-toℕ : ∀ {b d o}
→ {cont : True (Continuous? b d o)}
→ (xs : Numeral b d o)
→ ⟦ 1+ {cont = cont} xs ⟧ ≡ suc ⟦ xs ⟧
1+-toℕ {cont = cont} xs = proj₂ (toWitness cont xs)
|
alloy4fun_models/trashltl/models/11/gfPJqoXhBHsk5nAow.als | Kaixi26/org.alloytools.alloy | 0 | 4597 | open main
pred idgfPJqoXhBHsk5nAow_prop12 {
some f : File | after f in Trash
}
pred __repair { idgfPJqoXhBHsk5nAow_prop12 }
check __repair { idgfPJqoXhBHsk5nAow_prop12 <=> prop12o } |
project_03/proj3.asm | natemara/CSE-278 | 0 | 166621 | global main ;name this program the main function
extern printf, scanf ;define external functions that are called
section .data
prompt1: db 'Enter the first number in binary format:',0xA,0 ;message printed to users
prompt2: db 'Enter the second number in binary format:',0xA,0 ;message printed to users
opcode_prompt: db 'Enter the calculation to perform (add, sub, mul, div)',0xA,0
fmtScanf: db "%s",0 ;scanf format string
result_format: db "The result for %f %c %f:",0xA,"binary = %s",0xA,0 ;printf format string
;character codes for operations
ADD_C: equ '+'
SUB_C: equ '-'
MUL_C: equ '*'
DIV_C: equ '/'
ONE: equ '1'
ZERO: equ '0'
ADD_S: db "add",0
SUB_S: db "sub",0
MUL_S: db "mul",0
DIV_S: db "div",0
section .bss
;the binary strings inputted by the users
input1: resb 32
input2: resb 32
;the binary strings converted to numbers
number1: resb 4
number2: resb 4
number1_dub: resb 8
number2_dub: resb 8
;the operation that the user indicates
op_string: resb 3
op_c: resb 1
;final result in binary
result: resb 33
result_num: resb 4
section .text
main:
;print first promt to user
push prompt1
call printf
add esp, 4
;get the user's first input
sub esp, 4
mov dword [esp], input1
sub esp, 4
mov dword [esp], fmtScanf
call scanf
add esp, 8
;print second prompt to user
push prompt2
call printf
add esp, 4
;get the user's second input
sub esp, 4
mov dword [esp], input2
sub esp, 4
mov dword [esp], fmtScanf
call scanf
add esp, 8
;convert the first binary value to a number
push input1
call bin2int
add esp, 4
mov [number1], eax
;convert the second binary value to a number
push input2
call bin2int
add esp, 4
mov [number2], eax
;prompt user for operation code
push opcode_prompt
call printf
add esp, 4
;get the opcode from the user
sub esp, 4
mov dword [esp], op_string
sub esp, 4
mov dword [esp], fmtScanf
call scanf
add esp, 8
call get_opcode
call do_operation
push dword [result_num]
call int2bin
add esp, 4
push result
call print_result
add esp, 4
ret
bin2int:
;reset the stack pointer
;top of the stack should hold pointer to char array
push ebp
mov ebp, esp
;the value that will be returned
mov eax, 0
;loop counter
mov ecx, 0
jmp .loop
.exit:
mov esp, ebp
pop ebp
ret
.loop:
;create a bitmask stored at edx
push ecx
mov ebx, ecx
mov ecx, 31
sub ecx, ebx
mov edx, 1
shl edx, cl
pop ecx
;compare the current character to the ascii character '1'.
;if the current character is '1', OR eax with the bitmask
mov ebx, [ebp+8]
mov bl, [ebx+ecx]
cmp bl, 49
jne .reloop
or eax, edx
jmp .reloop
.reloop:
add ecx, 1
cmp ecx, 32
je .exit
jmp .loop
get_opcode:
push ebp
mov ebp, esp
mov eax, 0
mov eax, [ADD_S]
cmp eax, [op_string]
je .add
mov eax, [SUB_S]
cmp eax, [op_string]
je .sub
mov eax, [MUL_S]
cmp eax, [op_string]
je .mul
mov eax, [DIV_S]
cmp eax, [op_string]
je .div
jmp .exit
.exit:
mov esp, ebp
pop ebp
ret
.add:
mov eax, ADD_C
mov [op_c], eax
jmp .exit
.sub:
mov eax, SUB_C
mov [op_c], eax
jmp .exit
.mul:
mov eax, MUL_C
mov [op_c], eax
jmp .exit
.div:
mov eax, DIV_C
mov [op_c], eax
jmp .exit
do_operation:
push ebp
mov ebp, esp
mov ebx, [op_c]
fld dword [number1]
cmp ebx, ADD_C
je .add
cmp ebx, SUB_C
je .sub
cmp ebx, MUL_C
je .mul
cmp ebx, DIV_C
je .div
jmp .exit
.exit:
fstp dword [result_num]
mov esp, ebp
pop ebp
ret
.add:
fadd dword [number2]
jmp .exit
.sub:
fsub dword [number2]
jmp .exit
.mul:
fmul dword [number2]
jmp .exit
.div:
fdiv dword [number2]
jmp .exit
print_result:
push ebp
mov ebp, esp
mov eax, [ebp+8]
;format string order is %f %c %f %s
;push result as binary string
push eax
;push second number
fld dword [number2]
fstp qword [number2_dub]
push dword [number2_dub+4]
push dword [number2_dub]
;push operator character
push dword [op_c]
;push first number
fld dword [number1]
fstp qword [number1_dub]
push dword [number1_dub+4]
push dword [number1_dub]
push result_format
call printf
mov esp, ebp
pop ebp
ret
int2bin:
push ebp
mov ebp, esp
mov eax, [ebp+8]
mov ecx, 0
jmp .loop
.exit:
mov esp, ebp
pop ebp
ret
.loop:
mov ebx, 31
sub ebx, ecx
bt eax, ebx
jc .one
jmp .zero
.one:
mov ebx, ONE
jmp .reloop
.zero:
mov ebx, ZERO
jmp .reloop
.reloop:
mov [result+ecx], ebx
add ecx, 1
cmp ecx, 32
je .exit
jmp .loop
|
oeis/159/A159449.asm | neoneye/loda-programs | 11 | 6499 | ; A159449: Numerator of Hermite(n, 6/11).
; Submitted by <NAME>
; 1,12,-98,-6984,-12660,6608592,94621704,-8460215136,-261811748208,13237235524800,729072813894624,-23285236203280512,-2220214665026855232,40977749954004344064,7476528335622538688640,-49114276816696253425152,-27729169180110170480865024,-142579550327074152508191744,112366847403048351528180407808,1969478690061315226663848130560,-493029020078480537606607337534464,-15448625100838532148332313002323968,2320189978828775706336790733322258432,110090759782809653633762723224239906816
add $0,1
mov $3,1
lpb $0
sub $0,1
add $2,$3
mov $3,$1
mov $1,$2
mul $2,12
mul $3,-1
mul $3,$0
mul $3,242
lpe
mov $0,$1
|
generated/MiniDecaf.g4 | dangerggg/ToyCompiler | 1 | 7204 | <filename>generated/MiniDecaf.g4<gh_stars>1-10
grammar MiniDecaf;
toplv : (prog)* EOF
;
prog : type ID ('(' (type ID ',')* (type ID)? ')' stmts | ('[' INTEGER ']')* ';' | '=' INTEGER ';')
;
stmts : 'return' expr ';' # Return
| IF '(' expr ')' stmts (ELSE stmts)? # IfStmt
| WHILE '(' expr ')' stmts # WhileLoop
| FOR '(' (expr)? ';' (expr)? ';' (expr)? ')' stmts # ForLoop
| DO stmts WHILE expr # Dowhile
| expr ';' # PrintExpr
| '{' (stmts)* '}' # StmtBlock
| ';' # Nop
;
expr : ('+'|'-'|'*'|'&'|'!'|'~') expr # Unary
| expr op=(MUL|DIV|MOD) expr # MulDiv
| expr op=(ADD|SUB) expr # AddSub
| expr op=(LT|LE|GT|GE) expr # LessGreat
| expr op=(EQ|NEQ) expr # Equal
| expr op=LAND expr # LAND
| expr op=LOR expr # LOR
| expr QUES expr COLON expr # Ternary
| (type)? ID ('=' expr)? # VarDef
| type ID '[' INTEGER ']' # ArrayDef
| ID '(' (expr ',')* (expr)? ')' # CallFunc
| SIZEOF '(' ID ')' # SizeOf
| ID '[' expr ']' # ArrayCall
| INTEGER # Literal
| '(' expr ')' # Paren
| BREAK # Break
| CONTINUE # Continue
;
type : INT ('*')*
;
WS : [ \t\r\n] -> skip;
INTEGER : [0-9]+;
SEMICOLON : ';';
COMMA : ',';
ADD : '+';
SUB : '-';
MUL : '*';
AND : '&';
DIV : '/';
NOT : '!';
MOD : '%';
QUES : '?';
COLON : ':';
BITNOT : '~';
LPAREN : '(';
RPAREN : ')';
LBRACE : '{';
RBRACE : '}';
LSQUBRACE : '[';
RSQUBRACE : ']';
EQ : '==';
NEQ : '!=';
LT : '<';
LE : '<=';
GT : '>';
GE : '>=';
LAND : '&&';
LOR : '||';
ASSIGN : '=';
SIZEOF : 'sizeof';
INT : 'int';
RET : 'return';
IF : 'if';
ELSE : 'else';
WHILE : 'while';
FOR : 'for';
CONTINUE : 'continue';
BREAK : 'break';
DO : 'do';
ID : [a-zA-Z_][a-zA-Z_0-9]*;
|
leer_escribir_archivo.asm | lestersantos/Assembly2019 | 0 | 97353 | <reponame>lestersantos/Assembly2019
ORG 100h
%macro write_archivo 2
mov dx, %1 ; prepara la ruta del archivo
mov ah, 3ch ; funcion 3c, crear un archivo
mov cx, 0 ; crear un archivo normal
int 21h ; interrupcion DOS
mov bx, ax ; se guarda el puntero del archivo retornado de la funcion
mov ah, 40h ; funcion 40, escribir un archivo
mov cx, 999
mov dx, %2 ; preparacion del texto a escribir
int 21h ; interrupcion DOS
mov ah, 3eh ; funcion 3e, cerrar un archivo
int 21h ; interrupcion DOS
%endmacro
LeerArchivo:
xor ax, ax
mov ax, cs
mov ds,ax
mov ah, 3dh
mov al, 0h
mov dx, rutaArchivo
int 21h
jc errorAbriendo
mov bx, ax
mov ah, 3fh
mov cx, 499
mov dx, leido
int 21h
;cerrar archivo
mov ah, 3eh
int 21h
;imprimir contenido
mov dx, leido
mov ah, 9
int 21h
EscribirArchivo:
write_archivo rutaArchivo2, TextoAImprimir
Leer:
mov ah, 01h
int 21h
Salida:
mov ah, 4ch
int 21h
errorAbriendo:
mov dx, rutaIncorrecta
mov ah,09h
int 21h
jmp Salida
SEGMENT data
leido times 800 db "$"
rutaArchivo db "usuarios.txt",0
rutaArchivo2 db "usuarios1.txt",0
rutaIncorrecta db "LA RUTA NO EXISTE $"
TextoAImprimir db "Mensaje de Prueba:3$"
|
gyak/gyak8/verem/demo.adb | balintsoos/LearnAda | 0 | 13317 | <gh_stars>0
with vermek;
procedure demo is
begin
end demo;
|
src/Ada/syscalls/ewok-syscalls-cfg-dev.adb | wookey-project/ewok-legacy | 0 | 26618 | <reponame>wookey-project/ewok-legacy
--
-- Copyright 2018 The wookey project team <<EMAIL>>
-- - <NAME>
-- - <NAME>
-- - <NAME>
-- - <NAME>
-- - <NAME>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with ewok.debug;
with ewok.tasks; use ewok.tasks;
with ewok.tasks_shared; use ewok.tasks_shared;
with ewok.exported.devices; use ewok.exported.devices;
with ewok.devices_shared; use ewok.devices_shared;
with ewok.devices;
package body ewok.syscalls.cfg.dev
with spark_mode => off
is
--pragma debug_policy (IGNORE);
package TSK renames ewok.tasks;
procedure dev_map
(caller_id : in ewok.tasks_shared.t_task_id;
params : in out t_parameters;
mode : in ewok.tasks_shared.t_task_mode)
is
dev_descriptor : unsigned_8
with address => params(1)'address;
dev_id : ewok.devices_shared.t_device_id;
dev : ewok.devices.t_checked_user_device_access;
ok : boolean;
begin
--
-- Checking user inputs
--
-- Task must not be in ISR mode
-- NOTE
-- The reasons to forbid a task in ISR mode to map/unmap some devices
-- are not technical. An ISR *must* be a minimal piece of code that
-- manage only the interrupts provided by a specific hardware.
if mode = ewok.tasks_shared.TASK_MODE_ISRTHREAD then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_map(): forbidden in ISR mode"));
goto ret_denied;
end if;
-- No map/unmap before end of initialization
if not is_init_done (caller_id) then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_map(): forbidden during init sequence"));
goto ret_denied;
end if;
-- Valid device descriptor ?
if dev_descriptor not in TSK.tasks_list(caller_id).device_id'range
then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_map(): invalid device descriptor"));
goto ret_inval;
end if;
dev_id := TSK.tasks_list(caller_id).device_id (dev_descriptor);
-- Used device descriptor ?
if dev_id = ID_DEV_UNUSED then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_map(): unused device"));
goto ret_inval;
end if;
-- Defensive programming. Verifying that the device really belongs to the
-- task
if ewok.devices.get_task_from_id (dev_id) /= caller_id then
raise program_error;
end if;
-- Verifying that the device may be voluntary mapped by the task
dev := ewok.devices.get_user_device (dev_id);
if dev.map_mode /= ewok.exported.devices.DEV_MAP_VOLUNTARY then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_map(): not a DEV_MAP_VOLUNTARY device"));
goto ret_denied;
end if;
-- Verifying that the device is not already mapped
if TSK.is_mounted (caller_id, dev_id) then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_map(): the device is already mapped"));
goto ret_denied;
end if;
--
-- Mapping the device
--
TSK.mount_device (caller_id, dev_id, ok);
if not ok then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_map(): mount_device() failed (no free region?)"));
goto ret_busy;
end if;
-- We enable the device if its not already enabled
-- FIXME - That code should not be here.
-- Should create a special syscall for enabling/disabling
-- devices (cf. ewok-syscalls-init.adb)
ewok.devices.enable_device (dev_id, ok);
if not ok then
goto ret_denied;
end if;
set_return_value (caller_id, mode, SYS_E_DONE);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_inval>>
set_return_value (caller_id, mode, SYS_E_INVAL);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_denied>>
set_return_value (caller_id, mode, SYS_E_DENIED);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_busy>>
set_return_value (caller_id, mode, SYS_E_BUSY);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
end dev_map;
procedure dev_unmap
(caller_id : in ewok.tasks_shared.t_task_id;
params : in out t_parameters;
mode : in ewok.tasks_shared.t_task_mode)
is
dev_descriptor : unsigned_8
with address => params(1)'address;
dev_id : ewok.devices_shared.t_device_id;
dev : ewok.devices.t_checked_user_device_access;
ok : boolean;
begin
--
-- Checking user inputs
--
-- Task must not be in ISR mode
-- NOTE
-- The reasons to forbid a task in ISR mode to map/unmap some devices
-- are not technical. An ISR *must* be a minimal piece of code that
-- manage only the interrupts provided by a specific hardware.
if mode = ewok.tasks_shared.TASK_MODE_ISRTHREAD then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_unmap(): forbidden in ISR mode"));
goto ret_denied;
end if;
-- No unmap before end of initialization
if not is_init_done (caller_id) then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_unmap(): forbidden during init sequence"));
goto ret_denied;
end if;
-- Valid device descriptor ?
if dev_descriptor not in TSK.tasks_list(caller_id).device_id'range
then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_unmap(): invalid device descriptor"));
goto ret_inval;
end if;
dev_id := TSK.tasks_list(caller_id).device_id (dev_descriptor);
-- Used device descriptor ?
if dev_id = ID_DEV_UNUSED then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_unmap(): unused device"));
goto ret_inval;
end if;
-- Defensive programming. Verifying that the device really belongs to the
-- task
if ewok.devices.get_task_from_id (dev_id) /= caller_id then
raise program_error;
end if;
-- Verifying that the device may be voluntary unmapped by the task
dev := ewok.devices.get_user_device (dev_id);
if dev.map_mode /= ewok.exported.devices.DEV_MAP_VOLUNTARY then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_unmap(): not a DEV_MAP_VOLUNTARY device"));
goto ret_denied;
end if;
--
-- Unmapping the device
--
TSK.unmount_device (caller_id, dev_id, ok);
if not ok then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_unmap(): device is not mapped"));
goto ret_denied;
end if;
set_return_value (caller_id, mode, SYS_E_DONE);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_inval>>
set_return_value (caller_id, mode, SYS_E_INVAL);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_denied>>
set_return_value (caller_id, mode, SYS_E_DENIED);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
end dev_unmap;
procedure dev_release
(caller_id : in ewok.tasks_shared.t_task_id;
params : in out t_parameters;
mode : in ewok.tasks_shared.t_task_mode)
is
dev_descriptor : unsigned_8
with address => params(1)'address;
dev_id : ewok.devices_shared.t_device_id;
ok : boolean;
begin
-- No release before end of initialization
if not is_init_done (caller_id) then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_release(): forbidden during init sequence"));
goto ret_denied;
end if;
-- Valid device descriptor ?
if dev_descriptor not in TSK.tasks_list(caller_id).device_id'range
then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_release(): invalid device descriptor"));
goto ret_inval;
end if;
dev_id := TSK.tasks_list(caller_id).device_id (dev_descriptor);
-- Used device descriptor ?
if dev_id = ID_DEV_UNUSED then
pragma DEBUG (debug.log (debug.ERROR,
ewok.tasks.tasks_list(caller_id).name
& ": dev_release(): unused device"));
goto ret_inval;
end if;
-- Defensive programming. Verifying that the device really belongs to the
-- task
if ewok.devices.get_task_from_id (dev_id) /= caller_id then
raise program_error;
end if;
--
-- Releasing the device
--
-- Unmounting the device
if TSK.is_mounted (caller_id, dev_id) then
TSK.unmount_device (caller_id, dev_id, ok);
if not ok then
raise program_error; -- Should never happen
end if;
end if;
-- Removing it from the task's list of used devices
TSK.remove_device (caller_id, dev_id, ok);
if not ok then
raise program_error; -- Should never happen
end if;
-- Release GPIOs, EXTIs and interrupts
ewok.devices.release_device (caller_id, dev_id, ok);
set_return_value (caller_id, mode, SYS_E_DONE);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_inval>>
set_return_value (caller_id, mode, SYS_E_INVAL);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_denied>>
set_return_value (caller_id, mode, SYS_E_DENIED);
TSK.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
end dev_release;
end ewok.syscalls.cfg.dev;
|
test/src/tests.adb | alire-project/gnatcov-to-codecovio-action | 0 | 2876 | <reponame>alire-project/gnatcov-to-codecovio-action<filename>test/src/tests.adb
with Ada_SPARK_Workflow.Word_Search.Puzzle;
with Ada_SPARK_Workflow.Word_Search.Dictionary;
with Ada_SPARK_Workflow.Word_Search.Solution;
use Ada_SPARK_Workflow.Word_Search;
procedure Tests is
type Dict_Access is access Dictionary.Instance;
Dict : constant not null Dict_Access :=
new Dictionary.Instance (Dictionary.Builtin_Dict_Words);
Puz : Puzzle.Instance (Width => 10,
Height => 10,
Max_Words => 25);
begin
Dict.Load (Min_Word_Len => 4,
Max_Word_Len => 12);
Puz.Create (Dict.all);
Puz.Print;
Solution.Print (Puz.Solution);
end Tests;
|
source/asis/xasis/xasis-static-iter.adb | faelys/gela-asis | 4 | 8603 | <reponame>faelys/gela-asis<filename>source/asis/xasis/xasis-static-iter.adb<gh_stars>1-10
------------------------------------------------------------------------------
-- G E L A X A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Asis.Elements;
with Asis.Expressions;
with Asis.Definitions;
with Asis.Declarations;
with XASIS.Utils;
with XASIS.Classes;
package body XASIS.Static.Iter is
use Asis;
use Asis.Elements;
function Evaluate_Static_Function
(Object : access Calculator;
Func : in Asis.Element;
Args : in Asis.Association_List;
Name : in Asis.Expression) return Value;
function Statically_Denote
(Element : in Asis.Expression) return Asis.Element;
function Get_Type_Class (Name : Asis.Expression) return Classes.Type_Info;
-- Return type info for prefix of an attribute
function Evaluate_Defined
(Object : access Calculator;
Element : in Asis.Expression) return Value;
-- Ranges --
function Get_Range
(Object : access Calculator;
Element : in Asis.Range_Constraint) return Static_Range;
function Static_Indication_Range
(Object : access Calculator;
Def : in Asis.Subtype_Indication;
Base : in Boolean := False)
return Static_Range;
function Static_Subtype_Range
(Object : access Calculator;
Mark : in Asis.Expression;
Cons : in Asis.Constraint := Asis.Nil_Element;
Base : in Boolean := False)
return Static_Range;
--------------
-- Evaluate --
--------------
function Evaluate
(Object : access Calculator;
Element : in Asis.Expression) return Value
is
use Asis.Expressions;
Kind : constant Asis.Expression_Kinds := Expression_Kind (Element);
begin
case Kind is
when An_Integer_Literal
| A_Real_Literal
| An_Enumeration_Literal
| A_Character_Literal
| A_String_Literal =>
return Literal (Object, Element);
when An_Identifier
| A_Selected_Component
=>
declare
Decl : Asis.Declaration :=
XASIS.Utils.Selected_Name_Declaration (Element, False);
begin
case Declaration_Kind (Decl) is
when An_Integer_Number_Declaration
| A_Real_Number_Declaration =>
return Evaluate
(Object,
Asis.Declarations.Initialization_Expression (Decl));
when An_Enumeration_Literal_Specification =>
-- Because An_Enumeration_Literal stored as
-- An_Identifier till resolution complete, we keep
-- this call here.
return Literal (Object, Element);
when others =>
return Evaluate_Static_Constant (Object, Decl);
end case;
end;
when A_Function_Call =>
declare
Func : Asis.Element := Statically_Denote (Prefix (Element));
Attr : Boolean := Expression_Kind (Prefix (Element)) =
An_Attribute_Reference;
Args : Asis.Association_List :=
Function_Call_Parameters (Element, not Attr);
begin
return Evaluate_Static_Function
(Object, Func, Args, Prefix (Element));
end;
when An_Attribute_Reference =>
declare
Mark : Asis.Expression := Asis.Expressions.Prefix (Element);
Info : Classes.Type_Info := Get_Type_Class (Name => Mark);
Kind : Asis.Attribute_Kinds := Attribute_Kind (Element);
begin
return Attribute (Object, Info, Kind, Element);
end;
when A_Type_Conversion | A_Qualified_Expression =>
declare
Arg : constant Asis.Expression :=
Converted_Or_Qualified_Expression (Element);
begin
return Evaluate (Object, Arg);
end;
when An_In_Range_Membership_Test
| A_Not_In_Range_Membership_Test
| An_In_Type_Membership_Test
| A_Not_In_Type_Membership_Test
=>
declare
function Get_Range return Static_Range is
begin
if Kind = An_In_Range_Membership_Test
or Kind = A_Not_In_Range_Membership_Test
then
return Get_Range
(Object, Membership_Test_Range (Element));
else
return Static_Subtype_Range
(Object, Membership_Test_Subtype_Mark (Element));
end if;
end Get_Range;
Bnd : Static_Range := Get_Range;
Arg : Asis.Expression := Membership_Test_Expression (Element);
Inv : constant Boolean := Kind = A_Not_In_Range_Membership_Test
or Kind = A_Not_In_Type_Membership_Test;
begin
return Check_Range (Object, Arg, Bnd, Inv);
end;
when A_Parenthesized_Expression =>
declare
Arg : constant Asis.Expression :=
Expression_Parenthesized (Element);
begin
return Evaluate (Object, Arg);
end;
when others =>
Raise_Error (Internal_Error);
return Undefined (Object, Asis.Nil_Element);
end case;
end Evaluate;
----------------------
-- Evaluate_Defined --
----------------------
function Evaluate_Defined
(Object : access Calculator;
Element : in Asis.Expression) return Value is
begin
-- Check implementation-defined mark
if Is_Part_Of_Implicit (Element) then
return Undefined (Object, Element);
else
return Evaluate (Object, Element);
end if;
end Evaluate_Defined;
------------------------------
-- Evaluate_Static_Constant --
------------------------------
function Evaluate_Static_Constant
(Object : access Calculator;
Element : in Asis.Declaration)
return Value
is
use Asis.Declarations;
begin
case Declaration_Kind (Element) is
when An_Object_Renaming_Declaration =>
return Evaluate (Object, Renamed_Entity (Element));
when A_Constant_Declaration =>
return Evaluate (Object, Initialization_Expression (Element));
when others =>
Raise_Error (Internal_Error);
return Undefined (Object, Asis.Nil_Element);
end case;
end Evaluate_Static_Constant;
------------------------------
-- Evaluate_Static_Function --
------------------------------
function Evaluate_Static_Function
(Object : access Calculator;
Func : in Asis.Element;
Args : in Asis.Association_List;
Name : in Asis.Expression) return Value
is
begin
if Element_Kind (Func) = A_Declaration then
if XASIS.Utils.Is_Predefined_Operator (Func) then
declare
use Asis.Declarations;
Name : Asis.Defining_Name :=
XASIS.Utils.Declaration_Name (Func);
Decl : Asis.Declaration :=
Enclosing_Element (Corresponding_Type (Func));
Info : Classes.Type_Info :=
XASIS.Classes.Type_From_Declaration (Decl);
begin
return Operator (Object, Info, Operator_Kind (Name), Args);
end;
elsif Declaration_Kind (Func) =
An_Enumeration_Literal_Specification
then
return Evaluate (Object, Name);
end if;
elsif Expression_Kind (Func) = An_Attribute_Reference then
declare
Mark : Asis.Expression := Asis.Expressions.Prefix (Func);
Info : Classes.Type_Info := Get_Type_Class (Name => Mark);
begin
return Attribute_Call (Object, Info, Attribute_Kind (Func), Args);
end;
end if;
Raise_Error (Internal_Error);
return Undefined (Object, Asis.Nil_Element);
end Evaluate_Static_Function;
--------------------
-- Get_Type_Class --
--------------------
function Get_Type_Class (Name : Asis.Expression) return Classes.Type_Info is
Info : Classes.Type_Info := Classes.Type_From_Subtype_Mark (Name);
Decl : Asis.Declaration;
begin
if Classes.Is_Not_Type (Info) then
Decl := Statically_Denote (Name);
Info := Classes.Type_Of_Declaration (Decl);
end if;
return Info;
end Get_Type_Class;
-----------------------
-- Statically_Denote --
-----------------------
function Statically_Denote
(Element : in Asis.Expression) return Asis.Element
is
use Asis.Expressions;
use Asis.Declarations;
Expr : Asis.Expression := Element;
Decl : Asis.Declaration;
begin
case Expression_Kind (Element) is
when An_Attribute_Reference =>
return Element;
when An_Identifier | An_Operator_Symbol
| A_Character_Literal | An_Enumeration_Literal
| A_Selected_Component =>
if Expression_Kind (Element) = A_Selected_Component then
Expr := Selector (Element);
end if;
Decl := Corresponding_Name_Declaration (Expr);
if Declaration_Kind (Decl) = An_Object_Renaming_Declaration then
return Statically_Denote (Renamed_Entity (Decl));
else
return Decl;
end if;
when others =>
Raise_Error (Internal_Error);
return Asis.Nil_Element;
end case;
end Statically_Denote;
--------- Ranges ------------------------------------
-------------------------
-- Array_Subtype_Range --
-------------------------
function Array_Subtype_Range
(Object : access Calculator;
Def : in Asis.Subtype_Indication;
Index : in Asis.ASIS_Positive)
return Static_Range
is
use Asis.Definitions;
Cons : Asis.Constraint := Subtype_Constraint (Def);
begin
if Is_Nil (Cons) then
declare
Name : Asis.Expression := Asis.Definitions.Subtype_Mark (Def);
Decl : Asis.Declaration :=
XASIS.Utils.Selected_Name_Declaration (Name, False);
begin
return Constrained_Array_Range (Object, Decl, Index);
end;
else
declare
List : Asis.Discrete_Range_List := Discrete_Ranges (Cons);
begin
return Get_Discrete_Range (Object, List (Index));
end;
end if;
end Array_Subtype_Range;
-----------------------------
-- Constrained_Array_Range --
-----------------------------
function Constrained_Array_Range
(Object : access Calculator;
Decl : in Asis.Declaration;
Index : in Asis.ASIS_Positive)
return Static_Range
is
--------------------
-- Is_Constrained --
--------------------
function Is_Constrained (Def : Asis.Definition) return Boolean is
begin
case Definition_Kind (Def) is
when A_Type_Definition =>
return Type_Kind (Def) = A_Constrained_Array_Definition;
when A_Subtype_Indication =>
declare
Cons : Asis.Constraint :=
Asis.Definitions.Subtype_Constraint (Def);
begin
if not Is_Nil (Cons) then
return True;
else
declare
Name : Asis.Expression :=
Asis.Definitions.Subtype_Mark (Def);
Decl : Asis.Declaration :=
XASIS.Utils.Selected_Name_Declaration (Name, False);
begin
return Is_Constrained
(Asis.Declarations.Type_Declaration_View (Decl));
end;
end if;
end;
when others =>
return False;
end case;
end Is_Constrained;
use Asis.Declarations;
Kind : Asis.Declaration_Kinds := Declaration_Kind (Decl);
Def : Asis.Definition;
begin
case Kind is
when An_Ordinary_Type_Declaration =>
Def := Type_Declaration_View (Decl);
when A_Subtype_Declaration =>
Def := Type_Declaration_View (Decl);
return Array_Subtype_Range (Object, Def, Index);
when A_Variable_Declaration | A_Constant_Declaration =>
Def := Object_Declaration_View (Decl);
if Is_Constrained (Def) then
case Definition_Kind (Def) is
when A_Type_Definition =>
null;
when A_Subtype_Indication =>
return Array_Subtype_Range (Object, Def, Index);
when others =>
Raise_Error (Internal_Error);
end case;
elsif Kind = A_Constant_Declaration and Index = 1 then
return String_Constant_Range (Object, Decl);
else
Raise_Error (Internal_Error);
end if;
when An_Object_Renaming_Declaration =>
return String_Constant_Range (Object, Decl);
when others =>
Raise_Error (Internal_Error);
end case;
case Type_Kind (Def) is
when A_Constrained_Array_Definition =>
declare
List : Asis.Definition_List :=
Asis.Definitions.Discrete_Subtype_Definitions (Def);
begin
return Get_Discrete_Range (Object, List (Index));
end;
when others =>
Raise_Error (Internal_Error);
end case;
raise Evaluation_Error;
end Constrained_Array_Range;
------------------------
-- Get_Discrete_Range --
------------------------
function Get_Discrete_Range -- Is_Static_Discrete_Subtype
(Object : access Calculator;
Element : in Asis.Definition) return Static_Range
is
use Asis.Definitions;
begin
case Discrete_Range_Kind (Element) is
when A_Discrete_Subtype_Indication =>
return Static_Indication_Range (Object, Element);
when A_Discrete_Range_Attribute_Reference =>
return Static_Range_Attribute (Object, Range_Attribute (Element));
when A_Discrete_Simple_Expression_Range =>
return (Evaluate_Defined (Object, Lower_Bound (Element)),
Evaluate_Defined (Object, Upper_Bound (Element)));
when others =>
Raise_Error (Internal_Error);
end case;
raise Evaluation_Error;
end Get_Discrete_Range;
---------------
-- Get_Range --
---------------
function Get_Range
(Object : access Calculator;
Element : in Asis.Range_Constraint) return Static_Range
is
use Asis.Expressions;
use Asis.Definitions;
begin
case Constraint_Kind (Element) is
when A_Range_Attribute_Reference =>
return Static_Range_Attribute (Object, Range_Attribute (Element));
when A_Simple_Expression_Range =>
return (Evaluate_Defined (Object, Lower_Bound (Element)),
Evaluate_Defined (Object, Upper_Bound (Element)));
when others =>
Raise_Error (Internal_Error);
end case;
raise Evaluation_Error;
end Get_Range;
-----------------------------
-- Static_Indication_Range --
-----------------------------
function Static_Indication_Range
(Object : access Calculator;
Def : in Asis.Subtype_Indication;
Base : in Boolean := False)
return Static_Range
is
Name : Asis.Expression :=
Asis.Definitions.Subtype_Mark (Def);
Cons : Asis.Constraint :=
Asis.Definitions.Subtype_Constraint (Def);
begin
return Static_Subtype_Range (Object, Name, Cons, Base);
end Static_Indication_Range;
----------------------------
-- Static_Range_Attribute --
----------------------------
function Static_Range_Attribute -- Is_Static_Bound
(Object : access Calculator;
Attr : in Asis.Expression) return Static_Range
is
Prefix : Asis.Expression := Asis.Expressions.Prefix (Attr);
Info : Classes.Type_Info := Classes.Type_From_Subtype_Mark (Prefix);
Index : Asis.ASIS_Positive := 1;
begin -- Static_Range_Attribute
if Classes.Is_Scalar (Info) then
return Static_Subtype_Range (Object, Prefix);
else
declare
Decl : Asis.Declaration := Statically_Denote (Prefix);
begin
return Range_Of_Array (Object, Decl, Attr);
end;
end if;
end Static_Range_Attribute;
--------------------------
-- Static_Subtype_Range --
--------------------------
function Static_Subtype_Range
(Object : access Calculator;
Mark : in Asis.Expression;
Cons : in Asis.Constraint := Asis.Nil_Element;
Base : in Boolean := False)
return Static_Range
is
use Asis.Expressions;
use Asis.Definitions;
use Asis.Declarations;
Decl : Asis.Declaration;
Def : Asis.Definition;
begin
if not Base and not Is_Nil (Cons) then
return Get_Range (Object, Cons);
end if;
if Expression_Kind (Mark) = An_Attribute_Reference then
if Attribute_Kind (Mark) = A_Base_Attribute then
return Static_Subtype_Range (Object, Prefix (Mark), Base => True);
else
Raise_Error (Internal_Error);
end if;
end if;
Decl := XASIS.Utils.Selected_Name_Declaration (Mark, False);
Def := Type_Declaration_View (Decl);
case Definition_Kind (Def) is
when A_Subtype_Indication =>
return Static_Indication_Range (Object, Def, Base);
when A_Type_Definition =>
case Type_Kind (Def) is
when A_Derived_Type_Definition =>
Def := Parent_Subtype_Indication (Def);
return Static_Indication_Range (Object, Def, Base);
when An_Enumeration_Type_Definition =>
return Range_Of_Type (Object, Def);
when A_Signed_Integer_Type_Definition =>
if Base then
return Range_Of_Type (Object, Def);
else
return Get_Range (Object, Integer_Constraint (Def));
end if;
when A_Modular_Type_Definition =>
return Range_Of_Type (Object, Def);
when A_Floating_Point_Definition
| An_Ordinary_Fixed_Point_Definition
| A_Decimal_Fixed_Point_Definition
=>
declare
Rng : Asis.Range_Constraint :=
Real_Range_Constraint (Def);
begin
if Is_Nil (Rng) or Base then
return Range_Of_Type (Object, Def);
else
return Get_Range (Object, Rng);
end if;
end;
when others =>
Raise_Error (Internal_Error);
end case;
when others =>
Raise_Error (Internal_Error);
end case;
raise Evaluation_Error;
end Static_Subtype_Range;
end XASIS.Static.Iter;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, <NAME>
-- 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 <NAME>, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
oeis/188/A188570.asm | neoneye/loda-programs | 11 | 28125 | ; A188570: Coefficients of the absolute term in (1 + sqrt(2) + sqrt(3))^n sequence, denoted as C1(n).
; Submitted by <NAME>
; 1,1,6,16,80,296,1296,5216,21952,90304,375936,1555456,6456320,26754560,110963712,460015616,1907494912,7908659200,32792076288,135963148288,563742310400,2337417887744,9691567030272,40183767891968,166612591968256,690819710058496,2864321458077696,11876233344188416,49242004583874560,204170366063476736,846544320747012096,3509996540653469696,14553373625257295872,60342134460198682624,250194442257344495616,1037372301191283736576,4301219811433392373760,17833994450062781972480,73944455764982913564672
mov $2,1
lpb $0
sub $0,1
mul $4,2
sub $3,$4
mul $3,2
sub $1,$3
mov $4,$2
add $2,$1
mov $1,$3
add $5,$4
add $1,$5
mul $4,2
sub $4,1
lpe
mov $0,$2
|
programs/oeis/084/A084381.asm | karttu/loda | 1 | 93593 | <reponame>karttu/loda
; A084381: a(n) = n^3 + 5.
; 5,6,13,32,69,130,221,348,517,734,1005,1336,1733,2202,2749,3380,4101,4918,5837,6864,8005,9266,10653,12172,13829,15630,17581,19688,21957,24394,27005,29796,32773,35942,39309,42880,46661,50658,54877,59324,64005,68926,74093,79512,85189,91130,97341,103828,110597,117654,125005,132656,140613,148882,157469,166380,175621,185198,195117,205384,216005,226986,238333,250052,262149,274630,287501,300768,314437,328514,343005,357916,373253,389022,405229,421880,438981,456538,474557,493044,512005,531446,551373,571792,592709,614130,636061,658508,681477,704974,729005,753576,778693,804362,830589,857380,884741,912678,941197,970304,1000005,1030306,1061213,1092732,1124869,1157630,1191021,1225048,1259717,1295034,1331005,1367636,1404933,1442902,1481549,1520880,1560901,1601618,1643037,1685164,1728005,1771566,1815853,1860872,1906629,1953130,2000381,2048388,2097157,2146694,2197005,2248096,2299973,2352642,2406109,2460380,2515461,2571358,2628077,2685624,2744005,2803226,2863293,2924212,2985989,3048630,3112141,3176528,3241797,3307954,3375005,3442956,3511813,3581582,3652269,3723880,3796421,3869898,3944317,4019684,4096005,4173286,4251533,4330752,4410949,4492130,4574301,4657468,4741637,4826814,4913005,5000216,5088453,5177722,5268029,5359380,5451781,5545238,5639757,5735344,5832005,5929746,6028573,6128492,6229509,6331630,6434861,6539208,6644677,6751274,6859005,6967876,7077893,7189062,7301389,7414880,7529541,7645378,7762397,7880604,8000005,8120606,8242413,8365432,8489669,8615130,8741821,8869748,8998917,9129334,9261005,9393936,9528133,9663602,9800349,9938380,10077701,10218318,10360237,10503464,10648005,10793866,10941053,11089572,11239429,11390630,11543181,11697088,11852357,12008994,12167005,12326396,12487173,12649342,12812909,12977880,13144261,13312058,13481277,13651924,13824005,13997526,14172493,14348912,14526789,14706130,14886941,15069228,15252997,15438254
pow $0,3
add $0,5
mov $1,$0
|
g-debpoo.ads | ytomino/gnat4drake | 0 | 12769 | pragma License (Unrestricted);
with System.Storage_Elements;
with System.Storage_Pools.Standard_Pools;
package GNAT.Debug_Pools is
type Debug_Pool is new System.Storage_Pools.Standard_Pools.Standard_Pool
with null record;
subtype SSC is System.Storage_Elements.Storage_Count;
Default_Max_Freed : constant SSC := 50_000_000;
Default_Stack_Trace_Depth : constant Natural := 20;
Default_Reset_Content : constant Boolean := False;
Default_Raise_Exceptions : constant Boolean := True;
Default_Advanced_Scanning : constant Boolean := False;
Default_Min_Freed : constant SSC := 0;
Default_Errors_To_Stdout : constant Boolean := True;
Default_Low_Level_Traces : constant Boolean := False;
procedure Configure (
Pool : in out Debug_Pool;
Stack_Trace_Depth : Natural := Default_Stack_Trace_Depth;
Maximum_Logically_Freed_Memory : SSC := Default_Max_Freed;
Minimum_To_Free : SSC := Default_Min_Freed;
Reset_Content_On_Free : Boolean := Default_Reset_Content;
Raise_Exceptions : Boolean := Default_Raise_Exceptions;
Advanced_Scanning : Boolean := Default_Advanced_Scanning;
Errors_To_Stdout : Boolean := Default_Errors_To_Stdout;
Low_Level_Traces : Boolean := Default_Low_Level_Traces) is null;
-- unimplemented
type Report_Type is (All_Reports);
generic
with procedure Put_Line (S : String) is <>;
with procedure Put (S : String) is <>;
procedure Dump (
Pool : Debug_Pool;
Size : Positive;
Report : Report_Type := All_Reports);
procedure Dump_Stdout (
Pool : Debug_Pool;
Size : Positive;
Report : Report_Type := All_Reports);
procedure Reset is null; -- unimplemented
procedure Get_Size (
Storage_Address : System.Address;
Size_In_Storage_Elements : out System.Storage_Elements.Storage_Count;
Valid : out Boolean);
type Byte_Count is mod System.Max_Binary_Modulus;
function High_Water_Mark (Pool : Debug_Pool) return Byte_Count;
function Current_Water_Mark (Pool : Debug_Pool) return Byte_Count;
procedure System_Memory_Debug_Pool (
Has_Unhandled_Memory : Boolean := True) is null; -- unimplemented
end GNAT.Debug_Pools;
|
tests/z80test-1.0/src/crctab.asm | PhylumChordata/chips-test | 674 | 19029 | ; CRC table for the standard 100000100110000010001110110110111 polynomial.
; Chunked little endian, the 256 LSBs first, the 256 MSBs last, for fast access.
;
; Copyright (C) 2012 <NAME> (<EMAIL>)
;
; This source code is released under the MIT license, see included license.txt.
crctable:
db 0x00 ; 00 00000000
db 0x96 ; 01 77073096
db 0x2c ; 02 ee0e612c
db 0xba ; 03 990951ba
db 0x19 ; 04 076dc419
db 0x8f ; 05 706af48f
db 0x35 ; 06 e963a535
db 0xa3 ; 07 9e6495a3
db 0x32 ; 08 0edb8832
db 0xa4 ; 09 79dcb8a4
db 0x1e ; 0a e0d5e91e
db 0x88 ; 0b 97d2d988
db 0x2b ; 0c 09b64c2b
db 0xbd ; 0d 7eb17cbd
db 0x07 ; 0e e7b82d07
db 0x91 ; 0f 90bf1d91
db 0x64 ; 10 1db71064
db 0xf2 ; 11 6ab020f2
db 0x48 ; 12 f3b97148
db 0xde ; 13 84be41de
db 0x7d ; 14 1adad47d
db 0xeb ; 15 6ddde4eb
db 0x51 ; 16 f4d4b551
db 0xc7 ; 17 83d385c7
db 0x56 ; 18 136c9856
db 0xc0 ; 19 646ba8c0
db 0x7a ; 1a fd62f97a
db 0xec ; 1b 8a65c9ec
db 0x4f ; 1c 14015c4f
db 0xd9 ; 1d 63066cd9
db 0x63 ; 1e fa0f3d63
db 0xf5 ; 1f 8d080df5
db 0xc8 ; 20 3b6e20c8
db 0x5e ; 21 4c69105e
db 0xe4 ; 22 d56041e4
db 0x72 ; 23 a2677172
db 0xd1 ; 24 3c03e4d1
db 0x47 ; 25 4b04d447
db 0xfd ; 26 d20d85fd
db 0x6b ; 27 a50ab56b
db 0xfa ; 28 35b5a8fa
db 0x6c ; 29 42b2986c
db 0xd6 ; 2a dbbbc9d6
db 0x40 ; 2b acbcf940
db 0xe3 ; 2c 32d86ce3
db 0x75 ; 2d 45df5c75
db 0xcf ; 2e dcd60dcf
db 0x59 ; 2f abd13d59
db 0xac ; 30 26d930ac
db 0x3a ; 31 51de003a
db 0x80 ; 32 c8d75180
db 0x16 ; 33 bfd06116
db 0xb5 ; 34 21b4f4b5
db 0x23 ; 35 56b3c423
db 0x99 ; 36 cfba9599
db 0x0f ; 37 b8bda50f
db 0x9e ; 38 2802b89e
db 0x08 ; 39 5f058808
db 0xb2 ; 3a c60cd9b2
db 0x24 ; 3b b10be924
db 0x87 ; 3c 2f6f7c87
db 0x11 ; 3d 58684c11
db 0xab ; 3e c1611dab
db 0x3d ; 3f b6662d3d
db 0x90 ; 40 76dc4190
db 0x06 ; 41 01db7106
db 0xbc ; 42 98d220bc
db 0x2a ; 43 efd5102a
db 0x89 ; 44 71b18589
db 0x1f ; 45 06b6b51f
db 0xa5 ; 46 9fbfe4a5
db 0x33 ; 47 e8b8d433
db 0xa2 ; 48 7807c9a2
db 0x34 ; 49 0f00f934
db 0x8e ; 4a 9609a88e
db 0x18 ; 4b e10e9818
db 0xbb ; 4c 7f6a0dbb
db 0x2d ; 4d 086d3d2d
db 0x97 ; 4e 91646c97
db 0x01 ; 4f e6635c01
db 0xf4 ; 50 6b6b51f4
db 0x62 ; 51 1c6c6162
db 0xd8 ; 52 856530d8
db 0x4e ; 53 f262004e
db 0xed ; 54 6c0695ed
db 0x7b ; 55 1b01a57b
db 0xc1 ; 56 8208f4c1
db 0x57 ; 57 f50fc457
db 0xc6 ; 58 65b0d9c6
db 0x50 ; 59 12b7e950
db 0xea ; 5a 8bbeb8ea
db 0x7c ; 5b fcb9887c
db 0xdf ; 5c 62dd1ddf
db 0x49 ; 5d 15da2d49
db 0xf3 ; 5e 8cd37cf3
db 0x65 ; 5f fbd44c65
db 0x58 ; 60 4db26158
db 0xce ; 61 3ab551ce
db 0x74 ; 62 a3bc0074
db 0xe2 ; 63 d4bb30e2
db 0x41 ; 64 4adfa541
db 0xd7 ; 65 3dd895d7
db 0x6d ; 66 a4d1c46d
db 0xfb ; 67 d3d6f4fb
db 0x6a ; 68 4369e96a
db 0xfc ; 69 346ed9fc
db 0x46 ; 6a ad678846
db 0xd0 ; 6b da60b8d0
db 0x73 ; 6c 44042d73
db 0xe5 ; 6d 33031de5
db 0x5f ; 6e aa0a4c5f
db 0xc9 ; 6f dd0d7cc9
db 0x3c ; 70 5005713c
db 0xaa ; 71 270241aa
db 0x10 ; 72 be0b1010
db 0x86 ; 73 c90c2086
db 0x25 ; 74 5768b525
db 0xb3 ; 75 206f85b3
db 0x09 ; 76 b966d409
db 0x9f ; 77 ce61e49f
db 0x0e ; 78 5edef90e
db 0x98 ; 79 29d9c998
db 0x22 ; 7a b0d09822
db 0xb4 ; 7b c7d7a8b4
db 0x17 ; 7c 59b33d17
db 0x81 ; 7d 2eb40d81
db 0x3b ; 7e b7bd5c3b
db 0xad ; 7f c0ba6cad
db 0x20 ; 80 edb88320
db 0xb6 ; 81 9abfb3b6
db 0x0c ; 82 03b6e20c
db 0x9a ; 83 74b1d29a
db 0x39 ; 84 ead54739
db 0xaf ; 85 9dd277af
db 0x15 ; 86 04db2615
db 0x83 ; 87 73dc1683
db 0x12 ; 88 e3630b12
db 0x84 ; 89 94643b84
db 0x3e ; 8a 0d6d6a3e
db 0xa8 ; 8b 7a6a5aa8
db 0x0b ; 8c e40ecf0b
db 0x9d ; 8d 9309ff9d
db 0x27 ; 8e 0a00ae27
db 0xb1 ; 8f 7d079eb1
db 0x44 ; 90 f00f9344
db 0xd2 ; 91 8708a3d2
db 0x68 ; 92 1e01f268
db 0xfe ; 93 6906c2fe
db 0x5d ; 94 f762575d
db 0xcb ; 95 806567cb
db 0x71 ; 96 196c3671
db 0xe7 ; 97 6e6b06e7
db 0x76 ; 98 fed41b76
db 0xe0 ; 99 89d32be0
db 0x5a ; 9a 10da7a5a
db 0xcc ; 9b 67dd4acc
db 0x6f ; 9c f9b9df6f
db 0xf9 ; 9d 8ebeeff9
db 0x43 ; 9e 17b7be43
db 0xd5 ; 9f 60b08ed5
db 0xe8 ; a0 d6d6a3e8
db 0x7e ; a1 a1d1937e
db 0xc4 ; a2 38d8c2c4
db 0x52 ; a3 4fdff252
db 0xf1 ; a4 d1bb67f1
db 0x67 ; a5 a6bc5767
db 0xdd ; a6 3fb506dd
db 0x4b ; a7 48b2364b
db 0xda ; a8 d80d2bda
db 0x4c ; a9 af0a1b4c
db 0xf6 ; aa 36034af6
db 0x60 ; ab 41047a60
db 0xc3 ; ac df60efc3
db 0x55 ; ad a867df55
db 0xef ; ae 316e8eef
db 0x79 ; af 4669be79
db 0x8c ; b0 cb61b38c
db 0x1a ; b1 bc66831a
db 0xa0 ; b2 256fd2a0
db 0x36 ; b3 5268e236
db 0x95 ; b4 cc0c7795
db 0x03 ; b5 bb0b4703
db 0xb9 ; b6 220216b9
db 0x2f ; b7 5505262f
db 0xbe ; b8 c5ba3bbe
db 0x28 ; b9 b2bd0b28
db 0x92 ; ba 2bb45a92
db 0x04 ; bb 5cb36a04
db 0xa7 ; bc c2d7ffa7
db 0x31 ; bd b5d0cf31
db 0x8b ; be 2cd99e8b
db 0x1d ; bf 5bdeae1d
db 0xb0 ; c0 9b64c2b0
db 0x26 ; c1 ec63f226
db 0x9c ; c2 756aa39c
db 0x0a ; c3 026d930a
db 0xa9 ; c4 9c0906a9
db 0x3f ; c5 eb0e363f
db 0x85 ; c6 72076785
db 0x13 ; c7 05005713
db 0x82 ; c8 95bf4a82
db 0x14 ; c9 e2b87a14
db 0xae ; ca 7bb12bae
db 0x38 ; cb 0cb61b38
db 0x9b ; cc 92d28e9b
db 0x0d ; cd e5d5be0d
db 0xb7 ; ce 7cdcefb7
db 0x21 ; cf 0bdbdf21
db 0xd4 ; d0 86d3d2d4
db 0x42 ; d1 f1d4e242
db 0xf8 ; d2 68ddb3f8
db 0x6e ; d3 1fda836e
db 0xcd ; d4 81be16cd
db 0x5b ; d5 f6b9265b
db 0xe1 ; d6 6fb077e1
db 0x77 ; d7 18b74777
db 0xe6 ; d8 88085ae6
db 0x70 ; d9 ff0f6a70
db 0xca ; da 66063bca
db 0x5c ; db 11010b5c
db 0xff ; dc 8f659eff
db 0x69 ; dd f862ae69
db 0xd3 ; de 616bffd3
db 0x45 ; df 166ccf45
db 0x78 ; e0 a00ae278
db 0xee ; e1 d70dd2ee
db 0x54 ; e2 4e048354
db 0xc2 ; e3 3903b3c2
db 0x61 ; e4 a7672661
db 0xf7 ; e5 d06016f7
db 0x4d ; e6 4969474d
db 0xdb ; e7 3e6e77db
db 0x4a ; e8 aed16a4a
db 0xdc ; e9 d9d65adc
db 0x66 ; ea 40df0b66
db 0xf0 ; eb 37d83bf0
db 0x53 ; ec a9bcae53
db 0xc5 ; ed debb9ec5
db 0x7f ; ee 47b2cf7f
db 0xe9 ; ef 30b5ffe9
db 0x1c ; f0 bdbdf21c
db 0x8a ; f1 cabac28a
db 0x30 ; f2 53b39330
db 0xa6 ; f3 24b4a3a6
db 0x05 ; f4 bad03605
db 0x93 ; f5 cdd70693
db 0x29 ; f6 54de5729
db 0xbf ; f7 23d967bf
db 0x2e ; f8 b3667a2e
db 0xb8 ; f9 c4614ab8
db 0x02 ; fa 5d681b02
db 0x94 ; fb 2a6f2b94
db 0x37 ; fc b40bbe37
db 0xa1 ; fd c30c8ea1
db 0x1b ; fe 5a05df1b
db 0x8d ; ff 2d02ef8d
db 0x00 ; 00 00000000
db 0x30 ; 01 77073096
db 0x61 ; 02 ee0e612c
db 0x51 ; 03 990951ba
db 0xc4 ; 04 076dc419
db 0xf4 ; 05 706af48f
db 0xa5 ; 06 e963a535
db 0x95 ; 07 9e6495a3
db 0x88 ; 08 0edb8832
db 0xb8 ; 09 79dcb8a4
db 0xe9 ; 0a e0d5e91e
db 0xd9 ; 0b 97d2d988
db 0x4c ; 0c 09b64c2b
db 0x7c ; 0d 7eb17cbd
db 0x2d ; 0e e7b82d07
db 0x1d ; 0f 90bf1d91
db 0x10 ; 10 1db71064
db 0x20 ; 11 6ab020f2
db 0x71 ; 12 f3b97148
db 0x41 ; 13 84be41de
db 0xd4 ; 14 1adad47d
db 0xe4 ; 15 6ddde4eb
db 0xb5 ; 16 f4d4b551
db 0x85 ; 17 83d385c7
db 0x98 ; 18 136c9856
db 0xa8 ; 19 646ba8c0
db 0xf9 ; 1a fd62f97a
db 0xc9 ; 1b 8a65c9ec
db 0x5c ; 1c 14015c4f
db 0x6c ; 1d 63066cd9
db 0x3d ; 1e fa0f3d63
db 0x0d ; 1f 8d080df5
db 0x20 ; 20 3b6e20c8
db 0x10 ; 21 4c69105e
db 0x41 ; 22 d56041e4
db 0x71 ; 23 a2677172
db 0xe4 ; 24 3c03e4d1
db 0xd4 ; 25 4b04d447
db 0x85 ; 26 d20d85fd
db 0xb5 ; 27 a50ab56b
db 0xa8 ; 28 35b5a8fa
db 0x98 ; 29 42b2986c
db 0xc9 ; 2a dbbbc9d6
db 0xf9 ; 2b acbcf940
db 0x6c ; 2c 32d86ce3
db 0x5c ; 2d 45df5c75
db 0x0d ; 2e dcd60dcf
db 0x3d ; 2f abd13d59
db 0x30 ; 30 26d930ac
db 0x00 ; 31 51de003a
db 0x51 ; 32 c8d75180
db 0x61 ; 33 bfd06116
db 0xf4 ; 34 21b4f4b5
db 0xc4 ; 35 56b3c423
db 0x95 ; 36 cfba9599
db 0xa5 ; 37 b8bda50f
db 0xb8 ; 38 2802b89e
db 0x88 ; 39 5f058808
db 0xd9 ; 3a c60cd9b2
db 0xe9 ; 3b b10be924
db 0x7c ; 3c 2f6f7c87
db 0x4c ; 3d 58684c11
db 0x1d ; 3e c1611dab
db 0x2d ; 3f b6662d3d
db 0x41 ; 40 76dc4190
db 0x71 ; 41 01db7106
db 0x20 ; 42 98d220bc
db 0x10 ; 43 efd5102a
db 0x85 ; 44 71b18589
db 0xb5 ; 45 06b6b51f
db 0xe4 ; 46 9fbfe4a5
db 0xd4 ; 47 e8b8d433
db 0xc9 ; 48 7807c9a2
db 0xf9 ; 49 0f00f934
db 0xa8 ; 4a 9609a88e
db 0x98 ; 4b e10e9818
db 0x0d ; 4c 7f6a0dbb
db 0x3d ; 4d 086d3d2d
db 0x6c ; 4e 91646c97
db 0x5c ; 4f e6635c01
db 0x51 ; 50 6b6b51f4
db 0x61 ; 51 1c6c6162
db 0x30 ; 52 856530d8
db 0x00 ; 53 f262004e
db 0x95 ; 54 6c0695ed
db 0xa5 ; 55 1b01a57b
db 0xf4 ; 56 8208f4c1
db 0xc4 ; 57 f50fc457
db 0xd9 ; 58 65b0d9c6
db 0xe9 ; 59 12b7e950
db 0xb8 ; 5a 8bbeb8ea
db 0x88 ; 5b fcb9887c
db 0x1d ; 5c 62dd1ddf
db 0x2d ; 5d 15da2d49
db 0x7c ; 5e 8cd37cf3
db 0x4c ; 5f fbd44c65
db 0x61 ; 60 4db26158
db 0x51 ; 61 3ab551ce
db 0x00 ; 62 a3bc0074
db 0x30 ; 63 d4bb30e2
db 0xa5 ; 64 4adfa541
db 0x95 ; 65 3dd895d7
db 0xc4 ; 66 a4d1c46d
db 0xf4 ; 67 d3d6f4fb
db 0xe9 ; 68 4369e96a
db 0xd9 ; 69 346ed9fc
db 0x88 ; 6a ad678846
db 0xb8 ; 6b da60b8d0
db 0x2d ; 6c 44042d73
db 0x1d ; 6d 33031de5
db 0x4c ; 6e aa0a4c5f
db 0x7c ; 6f dd0d7cc9
db 0x71 ; 70 5005713c
db 0x41 ; 71 270241aa
db 0x10 ; 72 be0b1010
db 0x20 ; 73 c90c2086
db 0xb5 ; 74 5768b525
db 0x85 ; 75 206f85b3
db 0xd4 ; 76 b966d409
db 0xe4 ; 77 ce61e49f
db 0xf9 ; 78 5edef90e
db 0xc9 ; 79 29d9c998
db 0x98 ; 7a b0d09822
db 0xa8 ; 7b c7d7a8b4
db 0x3d ; 7c 59b33d17
db 0x0d ; 7d 2eb40d81
db 0x5c ; 7e b7bd5c3b
db 0x6c ; 7f c0ba6cad
db 0x83 ; 80 edb88320
db 0xb3 ; 81 9abfb3b6
db 0xe2 ; 82 03b6e20c
db 0xd2 ; 83 74b1d29a
db 0x47 ; 84 ead54739
db 0x77 ; 85 9dd277af
db 0x26 ; 86 04db2615
db 0x16 ; 87 73dc1683
db 0x0b ; 88 e3630b12
db 0x3b ; 89 94643b84
db 0x6a ; 8a 0d6d6a3e
db 0x5a ; 8b 7a6a5aa8
db 0xcf ; 8c e40ecf0b
db 0xff ; 8d 9309ff9d
db 0xae ; 8e 0a00ae27
db 0x9e ; 8f 7d079eb1
db 0x93 ; 90 f00f9344
db 0xa3 ; 91 8708a3d2
db 0xf2 ; 92 1e01f268
db 0xc2 ; 93 6906c2fe
db 0x57 ; 94 f762575d
db 0x67 ; 95 806567cb
db 0x36 ; 96 196c3671
db 0x06 ; 97 6e6b06e7
db 0x1b ; 98 fed41b76
db 0x2b ; 99 89d32be0
db 0x7a ; 9a 10da7a5a
db 0x4a ; 9b 67dd4acc
db 0xdf ; 9c f9b9df6f
db 0xef ; 9d 8ebeeff9
db 0xbe ; 9e 17b7be43
db 0x8e ; 9f 60b08ed5
db 0xa3 ; a0 d6d6a3e8
db 0x93 ; a1 a1d1937e
db 0xc2 ; a2 38d8c2c4
db 0xf2 ; a3 4fdff252
db 0x67 ; a4 d1bb67f1
db 0x57 ; a5 a6bc5767
db 0x06 ; a6 3fb506dd
db 0x36 ; a7 48b2364b
db 0x2b ; a8 d80d2bda
db 0x1b ; a9 af0a1b4c
db 0x4a ; aa 36034af6
db 0x7a ; ab 41047a60
db 0xef ; ac df60efc3
db 0xdf ; ad a867df55
db 0x8e ; ae 316e8eef
db 0xbe ; af 4669be79
db 0xb3 ; b0 cb61b38c
db 0x83 ; b1 bc66831a
db 0xd2 ; b2 256fd2a0
db 0xe2 ; b3 5268e236
db 0x77 ; b4 cc0c7795
db 0x47 ; b5 bb0b4703
db 0x16 ; b6 220216b9
db 0x26 ; b7 5505262f
db 0x3b ; b8 c5ba3bbe
db 0x0b ; b9 b2bd0b28
db 0x5a ; ba 2bb45a92
db 0x6a ; bb 5cb36a04
db 0xff ; bc c2d7ffa7
db 0xcf ; bd b5d0cf31
db 0x9e ; be 2cd99e8b
db 0xae ; bf 5bdeae1d
db 0xc2 ; c0 9b64c2b0
db 0xf2 ; c1 ec63f226
db 0xa3 ; c2 756aa39c
db 0x93 ; c3 026d930a
db 0x06 ; c4 9c0906a9
db 0x36 ; c5 eb0e363f
db 0x67 ; c6 72076785
db 0x57 ; c7 05005713
db 0x4a ; c8 95bf4a82
db 0x7a ; c9 e2b87a14
db 0x2b ; ca 7bb12bae
db 0x1b ; cb 0cb61b38
db 0x8e ; cc 92d28e9b
db 0xbe ; cd e5d5be0d
db 0xef ; ce 7cdcefb7
db 0xdf ; cf 0bdbdf21
db 0xd2 ; d0 86d3d2d4
db 0xe2 ; d1 f1d4e242
db 0xb3 ; d2 68ddb3f8
db 0x83 ; d3 1fda836e
db 0x16 ; d4 81be16cd
db 0x26 ; d5 f6b9265b
db 0x77 ; d6 6fb077e1
db 0x47 ; d7 18b74777
db 0x5a ; d8 88085ae6
db 0x6a ; d9 ff0f6a70
db 0x3b ; da 66063bca
db 0x0b ; db 11010b5c
db 0x9e ; dc 8f659eff
db 0xae ; dd f862ae69
db 0xff ; de 616bffd3
db 0xcf ; df 166ccf45
db 0xe2 ; e0 a00ae278
db 0xd2 ; e1 d70dd2ee
db 0x83 ; e2 4e048354
db 0xb3 ; e3 3903b3c2
db 0x26 ; e4 a7672661
db 0x16 ; e5 d06016f7
db 0x47 ; e6 4969474d
db 0x77 ; e7 3e6e77db
db 0x6a ; e8 aed16a4a
db 0x5a ; e9 d9d65adc
db 0x0b ; ea 40df0b66
db 0x3b ; eb 37d83bf0
db 0xae ; ec a9bcae53
db 0x9e ; ed debb9ec5
db 0xcf ; ee 47b2cf7f
db 0xff ; ef 30b5ffe9
db 0xf2 ; f0 bdbdf21c
db 0xc2 ; f1 cabac28a
db 0x93 ; f2 53b39330
db 0xa3 ; f3 24b4a3a6
db 0x36 ; f4 bad03605
db 0x06 ; f5 cdd70693
db 0x57 ; f6 54de5729
db 0x67 ; f7 23d967bf
db 0x7a ; f8 b3667a2e
db 0x4a ; f9 c4614ab8
db 0x1b ; fa 5d681b02
db 0x2b ; fb 2a6f2b94
db 0xbe ; fc b40bbe37
db 0x8e ; fd c30c8ea1
db 0xdf ; fe 5a05df1b
db 0xef ; ff 2d02ef8d
db 0x00 ; 00 00000000
db 0x07 ; 01 77073096
db 0x0e ; 02 ee0e612c
db 0x09 ; 03 990951ba
db 0x6d ; 04 076dc419
db 0x6a ; 05 706af48f
db 0x63 ; 06 e963a535
db 0x64 ; 07 9e6495a3
db 0xdb ; 08 0edb8832
db 0xdc ; 09 79dcb8a4
db 0xd5 ; 0a e0d5e91e
db 0xd2 ; 0b 97d2d988
db 0xb6 ; 0c 09b64c2b
db 0xb1 ; 0d 7eb17cbd
db 0xb8 ; 0e e7b82d07
db 0xbf ; 0f 90bf1d91
db 0xb7 ; 10 1db71064
db 0xb0 ; 11 6ab020f2
db 0xb9 ; 12 f3b97148
db 0xbe ; 13 84be41de
db 0xda ; 14 1adad47d
db 0xdd ; 15 6ddde4eb
db 0xd4 ; 16 f4d4b551
db 0xd3 ; 17 83d385c7
db 0x6c ; 18 136c9856
db 0x6b ; 19 646ba8c0
db 0x62 ; 1a fd62f97a
db 0x65 ; 1b 8a65c9ec
db 0x01 ; 1c 14015c4f
db 0x06 ; 1d 63066cd9
db 0x0f ; 1e fa0f3d63
db 0x08 ; 1f 8d080df5
db 0x6e ; 20 3b6e20c8
db 0x69 ; 21 4c69105e
db 0x60 ; 22 d56041e4
db 0x67 ; 23 a2677172
db 0x03 ; 24 3c03e4d1
db 0x04 ; 25 4b04d447
db 0x0d ; 26 d20d85fd
db 0x0a ; 27 a50ab56b
db 0xb5 ; 28 35b5a8fa
db 0xb2 ; 29 42b2986c
db 0xbb ; 2a dbbbc9d6
db 0xbc ; 2b acbcf940
db 0xd8 ; 2c 32d86ce3
db 0xdf ; 2d 45df5c75
db 0xd6 ; 2e dcd60dcf
db 0xd1 ; 2f abd13d59
db 0xd9 ; 30 26d930ac
db 0xde ; 31 51de003a
db 0xd7 ; 32 c8d75180
db 0xd0 ; 33 bfd06116
db 0xb4 ; 34 21b4f4b5
db 0xb3 ; 35 56b3c423
db 0xba ; 36 cfba9599
db 0xbd ; 37 b8bda50f
db 0x02 ; 38 2802b89e
db 0x05 ; 39 5f058808
db 0x0c ; 3a c60cd9b2
db 0x0b ; 3b b10be924
db 0x6f ; 3c 2f6f7c87
db 0x68 ; 3d 58684c11
db 0x61 ; 3e c1611dab
db 0x66 ; 3f b6662d3d
db 0xdc ; 40 76dc4190
db 0xdb ; 41 01db7106
db 0xd2 ; 42 98d220bc
db 0xd5 ; 43 efd5102a
db 0xb1 ; 44 71b18589
db 0xb6 ; 45 06b6b51f
db 0xbf ; 46 9fbfe4a5
db 0xb8 ; 47 e8b8d433
db 0x07 ; 48 7807c9a2
db 0x00 ; 49 0f00f934
db 0x09 ; 4a 9609a88e
db 0x0e ; 4b e10e9818
db 0x6a ; 4c 7f6a0dbb
db 0x6d ; 4d 086d3d2d
db 0x64 ; 4e 91646c97
db 0x63 ; 4f e6635c01
db 0x6b ; 50 6b6b51f4
db 0x6c ; 51 1c6c6162
db 0x65 ; 52 856530d8
db 0x62 ; 53 f262004e
db 0x06 ; 54 6c0695ed
db 0x01 ; 55 1b01a57b
db 0x08 ; 56 8208f4c1
db 0x0f ; 57 f50fc457
db 0xb0 ; 58 65b0d9c6
db 0xb7 ; 59 12b7e950
db 0xbe ; 5a 8bbeb8ea
db 0xb9 ; 5b fcb9887c
db 0xdd ; 5c 62dd1ddf
db 0xda ; 5d 15da2d49
db 0xd3 ; 5e 8cd37cf3
db 0xd4 ; 5f fbd44c65
db 0xb2 ; 60 4db26158
db 0xb5 ; 61 3ab551ce
db 0xbc ; 62 a3bc0074
db 0xbb ; 63 d4bb30e2
db 0xdf ; 64 4adfa541
db 0xd8 ; 65 3dd895d7
db 0xd1 ; 66 a4d1c46d
db 0xd6 ; 67 d3d6f4fb
db 0x69 ; 68 4369e96a
db 0x6e ; 69 346ed9fc
db 0x67 ; 6a ad678846
db 0x60 ; 6b da60b8d0
db 0x04 ; 6c 44042d73
db 0x03 ; 6d 33031de5
db 0x0a ; 6e aa0a4c5f
db 0x0d ; 6f dd0d7cc9
db 0x05 ; 70 5005713c
db 0x02 ; 71 270241aa
db 0x0b ; 72 be0b1010
db 0x0c ; 73 c90c2086
db 0x68 ; 74 5768b525
db 0x6f ; 75 206f85b3
db 0x66 ; 76 b966d409
db 0x61 ; 77 ce61e49f
db 0xde ; 78 5edef90e
db 0xd9 ; 79 29d9c998
db 0xd0 ; 7a b0d09822
db 0xd7 ; 7b c7d7a8b4
db 0xb3 ; 7c 59b33d17
db 0xb4 ; 7d 2eb40d81
db 0xbd ; 7e b7bd5c3b
db 0xba ; 7f c0ba6cad
db 0xb8 ; 80 edb88320
db 0xbf ; 81 9abfb3b6
db 0xb6 ; 82 03b6e20c
db 0xb1 ; 83 74b1d29a
db 0xd5 ; 84 ead54739
db 0xd2 ; 85 9dd277af
db 0xdb ; 86 04db2615
db 0xdc ; 87 73dc1683
db 0x63 ; 88 e3630b12
db 0x64 ; 89 94643b84
db 0x6d ; 8a 0d6d6a3e
db 0x6a ; 8b 7a6a5aa8
db 0x0e ; 8c e40ecf0b
db 0x09 ; 8d 9309ff9d
db 0x00 ; 8e 0a00ae27
db 0x07 ; 8f 7d079eb1
db 0x0f ; 90 f00f9344
db 0x08 ; 91 8708a3d2
db 0x01 ; 92 1e01f268
db 0x06 ; 93 6906c2fe
db 0x62 ; 94 f762575d
db 0x65 ; 95 806567cb
db 0x6c ; 96 196c3671
db 0x6b ; 97 6e6b06e7
db 0xd4 ; 98 fed41b76
db 0xd3 ; 99 89d32be0
db 0xda ; 9a 10da7a5a
db 0xdd ; 9b 67dd4acc
db 0xb9 ; 9c f9b9df6f
db 0xbe ; 9d 8ebeeff9
db 0xb7 ; 9e 17b7be43
db 0xb0 ; 9f 60b08ed5
db 0xd6 ; a0 d6d6a3e8
db 0xd1 ; a1 a1d1937e
db 0xd8 ; a2 38d8c2c4
db 0xdf ; a3 4fdff252
db 0xbb ; a4 d1bb67f1
db 0xbc ; a5 a6bc5767
db 0xb5 ; a6 3fb506dd
db 0xb2 ; a7 48b2364b
db 0x0d ; a8 d80d2bda
db 0x0a ; a9 af0a1b4c
db 0x03 ; aa 36034af6
db 0x04 ; ab 41047a60
db 0x60 ; ac df60efc3
db 0x67 ; ad a867df55
db 0x6e ; ae 316e8eef
db 0x69 ; af 4669be79
db 0x61 ; b0 cb61b38c
db 0x66 ; b1 bc66831a
db 0x6f ; b2 256fd2a0
db 0x68 ; b3 5268e236
db 0x0c ; b4 cc0c7795
db 0x0b ; b5 bb0b4703
db 0x02 ; b6 220216b9
db 0x05 ; b7 5505262f
db 0xba ; b8 c5ba3bbe
db 0xbd ; b9 b2bd0b28
db 0xb4 ; ba 2bb45a92
db 0xb3 ; bb 5cb36a04
db 0xd7 ; bc c2d7ffa7
db 0xd0 ; bd b5d0cf31
db 0xd9 ; be 2cd99e8b
db 0xde ; bf 5bdeae1d
db 0x64 ; c0 9b64c2b0
db 0x63 ; c1 ec63f226
db 0x6a ; c2 756aa39c
db 0x6d ; c3 026d930a
db 0x09 ; c4 9c0906a9
db 0x0e ; c5 eb0e363f
db 0x07 ; c6 72076785
db 0x00 ; c7 05005713
db 0xbf ; c8 95bf4a82
db 0xb8 ; c9 e2b87a14
db 0xb1 ; ca 7bb12bae
db 0xb6 ; cb 0cb61b38
db 0xd2 ; cc 92d28e9b
db 0xd5 ; cd e5d5be0d
db 0xdc ; ce 7cdcefb7
db 0xdb ; cf 0bdbdf21
db 0xd3 ; d0 86d3d2d4
db 0xd4 ; d1 f1d4e242
db 0xdd ; d2 68ddb3f8
db 0xda ; d3 1fda836e
db 0xbe ; d4 81be16cd
db 0xb9 ; d5 f6b9265b
db 0xb0 ; d6 6fb077e1
db 0xb7 ; d7 18b74777
db 0x08 ; d8 88085ae6
db 0x0f ; d9 ff0f6a70
db 0x06 ; da 66063bca
db 0x01 ; db 11010b5c
db 0x65 ; dc 8f659eff
db 0x62 ; dd f862ae69
db 0x6b ; de 616bffd3
db 0x6c ; df 166ccf45
db 0x0a ; e0 a00ae278
db 0x0d ; e1 d70dd2ee
db 0x04 ; e2 4e048354
db 0x03 ; e3 3903b3c2
db 0x67 ; e4 a7672661
db 0x60 ; e5 d06016f7
db 0x69 ; e6 4969474d
db 0x6e ; e7 3e6e77db
db 0xd1 ; e8 aed16a4a
db 0xd6 ; e9 d9d65adc
db 0xdf ; ea 40df0b66
db 0xd8 ; eb 37d83bf0
db 0xbc ; ec a9bcae53
db 0xbb ; ed debb9ec5
db 0xb2 ; ee 47b2cf7f
db 0xb5 ; ef 30b5ffe9
db 0xbd ; f0 bdbdf21c
db 0xba ; f1 cabac28a
db 0xb3 ; f2 53b39330
db 0xb4 ; f3 24b4a3a6
db 0xd0 ; f4 bad03605
db 0xd7 ; f5 cdd70693
db 0xde ; f6 54de5729
db 0xd9 ; f7 23d967bf
db 0x66 ; f8 b3667a2e
db 0x61 ; f9 c4614ab8
db 0x68 ; fa 5d681b02
db 0x6f ; fb 2a6f2b94
db 0x0b ; fc b40bbe37
db 0x0c ; fd c30c8ea1
db 0x05 ; fe 5a05df1b
db 0x02 ; ff 2d02ef8d
db 0x00 ; 00 00000000
db 0x77 ; 01 77073096
db 0xee ; 02 ee0e612c
db 0x99 ; 03 990951ba
db 0x07 ; 04 076dc419
db 0x70 ; 05 706af48f
db 0xe9 ; 06 e963a535
db 0x9e ; 07 9e6495a3
db 0x0e ; 08 0edb8832
db 0x79 ; 09 79dcb8a4
db 0xe0 ; 0a e0d5e91e
db 0x97 ; 0b 97d2d988
db 0x09 ; 0c 09b64c2b
db 0x7e ; 0d 7eb17cbd
db 0xe7 ; 0e e7b82d07
db 0x90 ; 0f 90bf1d91
db 0x1d ; 10 1db71064
db 0x6a ; 11 6ab020f2
db 0xf3 ; 12 f3b97148
db 0x84 ; 13 84be41de
db 0x1a ; 14 1adad47d
db 0x6d ; 15 6ddde4eb
db 0xf4 ; 16 f4d4b551
db 0x83 ; 17 83d385c7
db 0x13 ; 18 136c9856
db 0x64 ; 19 646ba8c0
db 0xfd ; 1a fd62f97a
db 0x8a ; 1b 8a65c9ec
db 0x14 ; 1c 14015c4f
db 0x63 ; 1d 63066cd9
db 0xfa ; 1e fa0f3d63
db 0x8d ; 1f 8d080df5
db 0x3b ; 20 3b6e20c8
db 0x4c ; 21 4c69105e
db 0xd5 ; 22 d56041e4
db 0xa2 ; 23 a2677172
db 0x3c ; 24 3c03e4d1
db 0x4b ; 25 4b04d447
db 0xd2 ; 26 d20d85fd
db 0xa5 ; 27 a50ab56b
db 0x35 ; 28 35b5a8fa
db 0x42 ; 29 42b2986c
db 0xdb ; 2a dbbbc9d6
db 0xac ; 2b acbcf940
db 0x32 ; 2c 32d86ce3
db 0x45 ; 2d 45df5c75
db 0xdc ; 2e dcd60dcf
db 0xab ; 2f abd13d59
db 0x26 ; 30 26d930ac
db 0x51 ; 31 51de003a
db 0xc8 ; 32 c8d75180
db 0xbf ; 33 bfd06116
db 0x21 ; 34 21b4f4b5
db 0x56 ; 35 56b3c423
db 0xcf ; 36 cfba9599
db 0xb8 ; 37 b8bda50f
db 0x28 ; 38 2802b89e
db 0x5f ; 39 5f058808
db 0xc6 ; 3a c60cd9b2
db 0xb1 ; 3b b10be924
db 0x2f ; 3c 2f6f7c87
db 0x58 ; 3d 58684c11
db 0xc1 ; 3e c1611dab
db 0xb6 ; 3f b6662d3d
db 0x76 ; 40 76dc4190
db 0x01 ; 41 01db7106
db 0x98 ; 42 98d220bc
db 0xef ; 43 efd5102a
db 0x71 ; 44 71b18589
db 0x06 ; 45 06b6b51f
db 0x9f ; 46 9fbfe4a5
db 0xe8 ; 47 e8b8d433
db 0x78 ; 48 7807c9a2
db 0x0f ; 49 0f00f934
db 0x96 ; 4a 9609a88e
db 0xe1 ; 4b e10e9818
db 0x7f ; 4c 7f6a0dbb
db 0x08 ; 4d 086d3d2d
db 0x91 ; 4e 91646c97
db 0xe6 ; 4f e6635c01
db 0x6b ; 50 6b6b51f4
db 0x1c ; 51 1c6c6162
db 0x85 ; 52 856530d8
db 0xf2 ; 53 f262004e
db 0x6c ; 54 6c0695ed
db 0x1b ; 55 1b01a57b
db 0x82 ; 56 8208f4c1
db 0xf5 ; 57 f50fc457
db 0x65 ; 58 65b0d9c6
db 0x12 ; 59 12b7e950
db 0x8b ; 5a 8bbeb8ea
db 0xfc ; 5b fcb9887c
db 0x62 ; 5c 62dd1ddf
db 0x15 ; 5d 15da2d49
db 0x8c ; 5e 8cd37cf3
db 0xfb ; 5f fbd44c65
db 0x4d ; 60 4db26158
db 0x3a ; 61 3ab551ce
db 0xa3 ; 62 a3bc0074
db 0xd4 ; 63 d4bb30e2
db 0x4a ; 64 4adfa541
db 0x3d ; 65 3dd895d7
db 0xa4 ; 66 a4d1c46d
db 0xd3 ; 67 d3d6f4fb
db 0x43 ; 68 4369e96a
db 0x34 ; 69 346ed9fc
db 0xad ; 6a ad678846
db 0xda ; 6b da60b8d0
db 0x44 ; 6c 44042d73
db 0x33 ; 6d 33031de5
db 0xaa ; 6e aa0a4c5f
db 0xdd ; 6f dd0d7cc9
db 0x50 ; 70 5005713c
db 0x27 ; 71 270241aa
db 0xbe ; 72 be0b1010
db 0xc9 ; 73 c90c2086
db 0x57 ; 74 5768b525
db 0x20 ; 75 206f85b3
db 0xb9 ; 76 b966d409
db 0xce ; 77 ce61e49f
db 0x5e ; 78 5edef90e
db 0x29 ; 79 29d9c998
db 0xb0 ; 7a b0d09822
db 0xc7 ; 7b c7d7a8b4
db 0x59 ; 7c 59b33d17
db 0x2e ; 7d 2eb40d81
db 0xb7 ; 7e b7bd5c3b
db 0xc0 ; 7f c0ba6cad
db 0xed ; 80 edb88320
db 0x9a ; 81 9abfb3b6
db 0x03 ; 82 03b6e20c
db 0x74 ; 83 74b1d29a
db 0xea ; 84 ead54739
db 0x9d ; 85 9dd277af
db 0x04 ; 86 04db2615
db 0x73 ; 87 73dc1683
db 0xe3 ; 88 e3630b12
db 0x94 ; 89 94643b84
db 0x0d ; 8a 0d6d6a3e
db 0x7a ; 8b 7a6a5aa8
db 0xe4 ; 8c e40ecf0b
db 0x93 ; 8d 9309ff9d
db 0x0a ; 8e 0a00ae27
db 0x7d ; 8f 7d079eb1
db 0xf0 ; 90 f00f9344
db 0x87 ; 91 8708a3d2
db 0x1e ; 92 1e01f268
db 0x69 ; 93 6906c2fe
db 0xf7 ; 94 f762575d
db 0x80 ; 95 806567cb
db 0x19 ; 96 196c3671
db 0x6e ; 97 6e6b06e7
db 0xfe ; 98 fed41b76
db 0x89 ; 99 89d32be0
db 0x10 ; 9a 10da7a5a
db 0x67 ; 9b 67dd4acc
db 0xf9 ; 9c f9b9df6f
db 0x8e ; 9d 8ebeeff9
db 0x17 ; 9e 17b7be43
db 0x60 ; 9f 60b08ed5
db 0xd6 ; a0 d6d6a3e8
db 0xa1 ; a1 a1d1937e
db 0x38 ; a2 38d8c2c4
db 0x4f ; a3 4fdff252
db 0xd1 ; a4 d1bb67f1
db 0xa6 ; a5 a6bc5767
db 0x3f ; a6 3fb506dd
db 0x48 ; a7 48b2364b
db 0xd8 ; a8 d80d2bda
db 0xaf ; a9 af0a1b4c
db 0x36 ; aa 36034af6
db 0x41 ; ab 41047a60
db 0xdf ; ac df60efc3
db 0xa8 ; ad a867df55
db 0x31 ; ae 316e8eef
db 0x46 ; af 4669be79
db 0xcb ; b0 cb61b38c
db 0xbc ; b1 bc66831a
db 0x25 ; b2 256fd2a0
db 0x52 ; b3 5268e236
db 0xcc ; b4 cc0c7795
db 0xbb ; b5 bb0b4703
db 0x22 ; b6 220216b9
db 0x55 ; b7 5505262f
db 0xc5 ; b8 c5ba3bbe
db 0xb2 ; b9 b2bd0b28
db 0x2b ; ba 2bb45a92
db 0x5c ; bb 5cb36a04
db 0xc2 ; bc c2d7ffa7
db 0xb5 ; bd b5d0cf31
db 0x2c ; be 2cd99e8b
db 0x5b ; bf 5bdeae1d
db 0x9b ; c0 9b64c2b0
db 0xec ; c1 ec63f226
db 0x75 ; c2 756aa39c
db 0x02 ; c3 026d930a
db 0x9c ; c4 9c0906a9
db 0xeb ; c5 eb0e363f
db 0x72 ; c6 72076785
db 0x05 ; c7 05005713
db 0x95 ; c8 95bf4a82
db 0xe2 ; c9 e2b87a14
db 0x7b ; ca 7bb12bae
db 0x0c ; cb 0cb61b38
db 0x92 ; cc 92d28e9b
db 0xe5 ; cd e5d5be0d
db 0x7c ; ce 7cdcefb7
db 0x0b ; cf 0bdbdf21
db 0x86 ; d0 86d3d2d4
db 0xf1 ; d1 f1d4e242
db 0x68 ; d2 68ddb3f8
db 0x1f ; d3 1fda836e
db 0x81 ; d4 81be16cd
db 0xf6 ; d5 f6b9265b
db 0x6f ; d6 6fb077e1
db 0x18 ; d7 18b74777
db 0x88 ; d8 88085ae6
db 0xff ; d9 ff0f6a70
db 0x66 ; da 66063bca
db 0x11 ; db 11010b5c
db 0x8f ; dc 8f659eff
db 0xf8 ; dd f862ae69
db 0x61 ; de 616bffd3
db 0x16 ; df 166ccf45
db 0xa0 ; e0 a00ae278
db 0xd7 ; e1 d70dd2ee
db 0x4e ; e2 4e048354
db 0x39 ; e3 3903b3c2
db 0xa7 ; e4 a7672661
db 0xd0 ; e5 d06016f7
db 0x49 ; e6 4969474d
db 0x3e ; e7 3e6e77db
db 0xae ; e8 aed16a4a
db 0xd9 ; e9 d9d65adc
db 0x40 ; ea 40df0b66
db 0x37 ; eb 37d83bf0
db 0xa9 ; ec a9bcae53
db 0xde ; ed debb9ec5
db 0x47 ; ee 47b2cf7f
db 0x30 ; ef 30b5ffe9
db 0xbd ; f0 bdbdf21c
db 0xca ; f1 cabac28a
db 0x53 ; f2 53b39330
db 0x24 ; f3 24b4a3a6
db 0xba ; f4 bad03605
db 0xcd ; f5 cdd70693
db 0x54 ; f6 54de5729
db 0x23 ; f7 23d967bf
db 0xb3 ; f8 b3667a2e
db 0xc4 ; f9 c4614ab8
db 0x5d ; fa 5d681b02
db 0x2a ; fb 2a6f2b94
db 0xb4 ; fc b40bbe37
db 0xc3 ; fd c30c8ea1
db 0x5a ; fe 5a05df1b
db 0x2d ; ff 2d02ef8d
; EOF ;
|
Source/improved_trie.ads | bkold/RISC-CPU-Assembler | 0 | 30494 | with Ada.Containers.Multiway_Trees;
package Improved_Trie is
type Element_Type is record
A : Character;
B : Integer;
end record;
function "=" (Left, Right : Element_Type) return Boolean is
(Left.A = Right.A);
--the Ada Multiway tree package backend to be used
package Trie is new Ada.Containers.Multiway_Trees (Element_Type=>Element_Type, "="=>"=");
use Trie;
--searches the Trie for the input string.
--returns the associated integer, returns -1 if not found
function Find_String (T : Tree; Input : String) return Integer;
--adds the input string into the Trie
--returns whether it is successful or not
function Add_String (T : in out Tree; Input : String; Address : Integer) return Boolean;
private
--finds the child of a node
--returns the found child node, No_Element if not found
function Find_Immediate_Child (Parent : Cursor; Element : Element_Type) return Cursor;
--moves the input node to the found child node
--returns if found or not.
--if not found, Parent is not changed
function Find_Move_Immediate_Child (Parent : in out Cursor; Element : Element_Type) return Boolean;
end Improved_Trie; |
Phase 2/app.asm | osamamagdy/Sky-Fall | 7 | 96392 | <reponame>osamamagdy/Sky-Fall<filename>Phase 2/app.asm<gh_stars>1-10
MACRO_CLEAR_PLAYER MACRO X,Y
mov pre_position_x,x
mov pre_position_y,y
call Update_Players
ENDM
; MACRO_CLEAR_Barrier MACRO X,Y
; mov pre_position_x,x
; mov pre_position_y,y
; call Update_Players
; ENDM
PRINT_Messages MACRO MSG
PUSH AX
push DX
mov ah, 9
mov dx, offset MSG
int 21h
pop DX
POP AX
ENDM
;;;;Macro to send a 8 bit word using uart
SendChar MACRO MyChar
LOCAL Send
Send:
push ax
mov dx, 3fdh
in al, dx
test al, 00100000b
jz Send
mov dx, 3f8h ;sending value
mov al, MyChar
out dx, al
pop ax
ENDM
;;;;Macro to recieve a 8 bit word using uart
ReceiveChar MACRO
LOCAL Return
RETURN:
MOV AL, 0
mov dx , 3FDH ; Line Status Register
in al , dx
test al , 1
JZ RETURN
mov dx , 03F8H
in al , dx
ENDM
;;;;Macro to recieve a 8 bit word using uart
ReceiveCharNotAmustToRecieve MACRO
LOCAL Return
MOV AL, 0
mov dx , 3FDH ; Line Status Register
in al , dx
test al , 1
JZ RETURN
mov dx , 03F8H
in al , dx
RETURN:
ENDM
.model HUGE
.stack 64h
.data
WINDOW_WIDTH equ 320 ;the width of the Game window (320 pixels)
WINDOW_HEIGHT equ 160 ;the height of the Game window (200*4/5 pixels)---> the chat takes 1/5 of the console
WINDOW_BOUNDS equ 6 ; used to check collisions early from the lower,left,right pounds
window_bounds_upper equ 15 ;height of the health bar
health_bar_width equ 100 ;width of each player's health bar
heart_height equ 10 ;height of the heart image in health bar
heart_width equ 15 ;height of the heart image in health bar
TIME_AUX DB 0 ;variable used when checking if the time has changed
background_color EQU 53 ;Background pixel color id
graphics_mode EQU 13h ;320*200 pixels , 256colors
PRE_POSITION_X DW 0 ;Temp variable used when moving position to check first if it causes collisions
PRE_POSITION_Y DW 0 ;Temp variable used when moving position to check first if it causes collisions
PRE_POSITION_X2 DW 0 ;Temp variable used when moving position to check first if it causes collisions
PRE_POSITION_Y2 DW 0 ;Temp variable used when moving position to check first if it causes collisions
First_Player_Name DB 15,?,15 dup('$')
first_player_X DW 50 ;The starting X-position of player one
first_player_Y DW 50 ;The starting Y-position of player one
first_player_health DW 5 ;Number of hearts to the first player
first_player_health_X equ 0 ;the starting upper left x coordinate of the first player's first heart
first_player_health_Y equ 0 ;the starting upper left y coordinate of the first player's first heart
first_player_health_immunity DW 0 ;when the player gets hit by barrier, he gains an immunity to resist the barriers
first_player_Freeze DW 0 ;Duration for which the player is frozen
First_Is_Collided DB 0 ;Boolean Variable To check if the player is colliding
Second_Player_Name DB 15,?,15 dup('$')
second_player_X DW 270 ;The starting X-position of player two
SECOND_PLAYER_Y DW 50 ;The starting Y-position of player two
second_player_health DW 5 ;Number of hearts to the second player
second_player_health_X equ 305 ;the starting upper left x coordinate of the second player's first heart
second_player_health_Y equ 0 ;the starting upper left y coordinate of the second player's first heart
second_player_health_immunity DW 0 ;when the player gets hit by barrier, he gains an immunity to resist the barriers
second_player_Freeze DW 0 ;Duration for which the player is frozen
PLAYERS_WIDTH equ 20 ;the width of player's image
PLAYERS_HEIGHT equ 25 ;the height of player's image
PLAYERS_VELOCITY DW 04h
Second_Is_Collided DB 0 ;Boolean Variable To check if the player is colliding
Initial_Freeze EQU 20 ;The freezing time of player after being attacked
Initial_Imunity EQU 20 ;This is the immunity to the player fter being hit
;VARIABLES USED IN THE PROCS OF DRAWING THE BARRIER
LEN DW 100d ;used by the draw barrier proc
WID DW 100d ;used by the draw barrier proc
LENMAX DW 252d ;used by the draw barrier proc
WIDMAX DW 152d ;used by the draw barrier proc
Initial_Y_Barrier1 EQU 140
Initial_Y_Barrier2 EQU 140
X_BARRIER1 DW 10 ; xpos of barrier1
Y_BARRIER1 DW 140 ; ypos of barrier1
X_BARRIER2 DW 260 ; xpos of barrier2
Y_BARRIER2 DW 104 ; ypos of barrier2
;Laser Colors
RED EQU 39
Yellow EQU 14
Dark_Blue EQU 105
Light_Blue EQU 76
;Laser Target (The ARC Reactor of the suit)
Player_Reactor_Y_Offset EQU 16
Player_Reactor_Y_Size EQU 4
LASER_SIZE EQU 3
;Laser Launcher (Laser Shooters)
Player_Shooter_Y_Offset EQU 19
;Lasers Coordinates
Blue_Laser_Start_X DW ?
Blue_Laser_End_X DW ?
Red_Laser_Start_X DW ?
Red_Laser_End_X DW ?
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;#DEFINES FOR THE LENGTH AND SIZE OF THE BARRIER
BARRIER_HORIZONTAL_SIZE EQU 60D
BARRIER_VERTICAL_SIZE EQU 10D
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;SCREEN SIZE IN PIXELS
SCREEN_MAX_X EQU 319D
SCREEN_MAX_Y EQU 199D
;next is the first player's pixel colors/Note: they are indexed in reversed order (from the (20,25) to (0,0))
p1 DB 0, 0, 0, 16, 16, 16, 16, 16, 0, 0, 0, 0, 16, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 16, 39, 39, 39, 16, 0, 0, 0, 0, 16, 39, 39, 39, 16, 0, 0, 0
DB 0, 0, 0, 16, 16, 39, 39, 16, 0, 0, 0, 0, 16, 39, 39, 16, 16, 0, 0, 0, 0, 0, 0, 0, 16, 39, 14, 14, 16, 16, 16, 16, 14, 14, 39, 16, 0, 0, 0, 0
DB 0, 0, 0, 31, 16, 14, 14, 39, 39, 39, 39, 39, 39, 14, 14, 16, 31, 0, 0, 0, 0, 0, 16, 16, 0, 16, 39, 39, 39, 39, 39, 39, 39, 39, 16, 0, 16, 16, 0, 0
DB 0, 16, 39, 39, 16, 16, 39, 39, 39, 16, 16, 39, 39, 39, 16, 16, 39, 39, 16, 0, 0, 16, 39, 39, 14, 16, 39, 39, 16, 25, 25, 16, 39, 39, 16, 14, 39, 39, 16, 0
DB 0, 0, 16, 14, 14, 16, 39, 16, 25, 25, 25, 25, 16, 39, 16, 14, 14, 16, 0, 0, 0, 0, 41, 16, 39, 16, 39, 16, 16, 16, 16, 16, 16, 39, 16, 39, 16, 41, 0, 0
DB 0, 0, 41, 0, 16, 39, 16, 14, 14, 14, 14, 14, 14, 16, 39, 16, 0, 41, 0, 0, 0, 41, 41, 0, 0, 16, 14, 16, 16, 16, 16, 16, 16, 14, 16, 0, 0, 41, 41, 0
DB 0, 41, 0, 0, 16, 39, 14, 14, 14, 14, 14, 14, 14, 14, 39, 16, 0, 0, 41, 0, 0, 41, 0, 16, 39, 39, 14, 14, 14, 14, 14, 14, 14, 14, 39, 39, 16, 0, 41, 0
DB 41, 41, 16, 39, 14, 25, 25, 25, 16, 16, 16, 16, 25, 25, 25, 14, 39, 16, 41, 41, 41, 0, 16, 39, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 39, 16, 0, 41
DB 41, 0, 16, 39, 16, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 16, 39, 16, 0, 41, 41, 0, 0, 16, 39, 14, 14, 14, 39, 39, 39, 39, 14, 14, 14, 39, 16, 0, 0, 41
DB 41, 0, 0, 16, 39, 14, 14, 39, 39, 39, 39, 39, 39, 14, 14, 39, 16, 0, 0, 41, 41, 0, 0, 0, 16, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 16, 0, 0, 0, 41
DB 41, 41, 41, 41, 41, 16, 16, 16, 39, 39, 39, 39, 16, 16, 16, 41, 41, 41, 41, 41, 41, 14, 14, 14, 14, 14, 14, 14, 16, 16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 41
DB 41, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 41, 41, 41, 41, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 41, 41, 41
DB 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41
;next is the first player's heart pixel colors/Note: they are indexed in reversed order'
h1 DB 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 39, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 39, 39, 39, 16
DB 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 39, 39, 39, 39, 39, 16, 0, 0, 0, 0, 0, 0, 0, 16, 39, 39, 39, 39, 39, 39, 39, 16, 0, 0, 0, 0, 0, 16, 39, 39
DB 39, 39, 39, 39, 39, 39, 39, 16, 0, 0, 0, 0, 16, 39, 39, 39, 39, 16, 39, 39, 39, 39, 16, 0, 0, 0, 0, 0, 16, 39, 39, 16, 0, 16, 39, 39, 16, 0, 0, 0
DB 0, 0, 0, 0, 16, 16, 0, 0, 0, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
;next is the Second player's pixel colors/Note: they are indexed in reversed order (from the (20,25) to (0,0))
p2 DB 0, 0, 0, 16, 16, 16, 16, 16, 0, 0, 0, 0, 16, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 16, 105, 105, 105, 16, 0, 0, 0, 0, 16, 105, 105, 105, 16, 0, 0, 0
DB 0, 0, 0, 16, 16, 105, 105, 16, 0, 0, 0, 0, 16, 105, 105, 16, 16, 0, 0, 0, 0, 0, 0, 0, 16, 105, 76, 76, 16, 16, 16, 16, 76, 76, 105, 16, 0, 0, 0, 0
DB 0, 0, 0, 31, 16, 76, 76, 105, 105, 105, 105, 105, 105, 76, 76, 16, 31, 0, 0, 0, 0, 0, 16, 16, 0, 16, 105, 105, 105, 105, 105, 105, 105, 105, 16, 0, 16, 16, 0, 0
DB 0, 16, 105, 105, 16, 16, 105, 105, 105, 16, 16, 105, 105, 105, 16, 16, 105, 105, 16, 0, 0, 16, 105, 105, 76, 16, 105, 105, 16, 25, 25, 16, 105, 105, 16, 76, 105, 105, 16, 0
DB 0, 0, 16, 76, 76, 16, 105, 16, 25, 25, 25, 25, 16, 105, 16, 76, 76, 16, 0, 0, 0, 0, 105, 16, 105, 16, 105, 16, 16, 16, 16, 16, 16, 105, 16, 105, 16, 105, 0, 0
DB 0, 0, 105, 0, 16, 105, 16, 76, 76, 76, 76, 76, 76, 16, 105, 16, 0, 105, 0, 0, 0, 105, 105, 0, 0, 16, 76, 16, 16, 16, 16, 16, 16, 76, 16, 0, 0, 105, 105, 0
DB 0, 105, 0, 0, 16, 105, 76, 76, 76, 76, 76, 76, 76, 76, 105, 16, 0, 0, 105, 0, 0, 105, 0, 16, 105, 105, 76, 76, 76, 76, 76, 76, 76, 76, 105, 105, 16, 0, 105, 0
DB 105, 105, 16, 105, 76, 25, 25, 25, 16, 16, 16, 16, 25, 25, 25, 76, 105, 16, 105, 105, 105, 0, 16, 105, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 105, 16, 0, 105
DB 105, 0, 16, 105, 16, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 16, 105, 16, 0, 105, 105, 0, 0, 16, 105, 76, 76, 76, 105, 105, 105, 105, 76, 76, 76, 105, 16, 0, 0, 105
DB 105, 0, 0, 16, 105, 76, 76, 105, 105, 105, 105, 105, 105, 76, 76, 105, 16, 0, 0, 105, 105, 0, 0, 0, 16, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 16, 0, 0, 0, 105
DB 105, 105, 105, 105, 105, 16, 16, 16, 105, 105, 105, 105, 16, 16, 16, 105, 105, 105, 105, 105, 105, 76, 76, 76, 76, 76, 76, 76, 16, 16, 16, 16, 76, 76, 76, 76, 76, 76, 76, 105
DB 105, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 105, 105, 105, 105, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 105, 105, 105
DB 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105
;next is the second player's heart pixel colors/Note: they are indexed in reversed order'
h2 DB 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 105, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 105, 105, 105, 16
DB 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 105, 105, 105, 105, 105, 16, 0, 0, 0, 0, 0, 0, 0, 16, 105, 105, 105, 105, 105, 105, 105, 16, 0, 0, 0, 0, 0, 16, 105, 105
DB 105, 105, 105, 105, 105, 105, 105, 16, 0, 0, 0, 0, 16, 105, 105, 105, 105, 16, 105, 105, 105, 105, 16, 0, 0, 0, 0, 0, 16, 105, 105, 16, 0, 16, 105, 105, 16, 0, 0, 0
DB 0, 0, 0, 0, 16, 16, 0, 0, 0, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Barrier_array DB 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 186, 186, 186, 186, 186, 186, 186
DB 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 16, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186
DB 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186
DB 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
DB 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 16, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
;MAIN MENU
GAME_MASTER DB 00H
GAME_SLAVE DB 0
CHAT_MASTER DB 0
CHAT_SLAVE DB 0
LEVEL_CHOSEN DB 0
GAME_INVITATION_SEND_MSG DB 'YOU SENT A GAME INVITATION TO $'
GAME_INVITATION_REC_MSG DB ' sent A GAME INVITATION TO YOU $'
CHAT_INVITATION_SEND_MEG DB 'YOU SENT A CHAT INVITATION TO $'
CHAT_INVITATION_REC_MEG DB ' sent A CHAT INVITATION TO YOU $'
play_against_meg DB ' ', 0ah,0dh
DB ' ============================================',0ah,0dh
DB ' || ||',0ah,0dh
DB ' || * YOU PLAY AGAINST ||',0ah,0dh
DB ' || ||',0ah,0dh
DB ' ============================================',0ah,0dh
DB '$',0ah,0dh
WAITING_MESSAGE DB 'PLEASE WAIT FOR OTHER PLAYER RESPONSE $'
CHAT DB '*To Start Chatting Press F1 $'
Sky_GAME DB '*To Start Sky Fall Game Press F2 $'
END_GAME_mess DB '*To End the Program Press ESC $'
levelone DB '*please press 1 for level 1 $'
leveltwo DB '*please press 2 for level 2 $'
Name_Message_1 DB '*Enter the first player name,Press Enter to porceed $'
Name_Message_2 DB '*Enter the second player name, Press Enter to porceed $'
Invalid_Start_msg2 db "* Invalid Player Name ! $"
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;Game over screen;;;;;;;;;;;;;;;;;;;;;;;;;;;
imgW equ 200
imgH equ 26
img DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 112, 112, 112, 112, 112, 112, 112, 112, 184, 184, 16, 16, 16, 16, 184, 183, 112, 112, 112, 112, 112, 184, 16, 184, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112
DB 112, 112, 112, 112, 183, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 183, 184, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 183, 183, 112, 112, 112, 184
DB 184, 184, 112, 112, 112, 112, 112, 112, 112, 185, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 112, 112, 112, 112, 112, 112, 112, 112, 112, 184, 112, 112, 112
DB 184, 184, 112, 112, 112, 112, 112, 112, 16, 16, 184, 112, 112, 112, 112, 112, 184, 16, 16, 16, 16, 16, 16, 16, 16, 184, 112, 112, 184, 184, 112, 112, 16, 16, 184, 112, 112, 112, 112, 112
DB 183, 16, 16, 16, 16, 16, 16, 16, 16, 184, 184, 112, 112, 112, 112, 184, 16, 16, 184, 112, 112, 112, 184, 112, 184, 184, 112, 112, 112, 112, 112, 112, 184, 184, 16, 16, 16, 16, 16, 16
DB 113, 113, 111, 111, 111, 111, 111, 111, 136, 184, 16, 16, 16, 16, 184, 207, 136, 111, 111, 111, 111, 183, 185, 209, 111, 111, 111, 111, 111, 111, 111, 111, 113, 113, 111, 111, 113, 113, 113, 113
DB 111, 111, 111, 111, 208, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 183, 207, 113, 113, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 208, 136, 113, 113, 111, 111
DB 113, 111, 113, 113, 113, 111, 113, 113, 111, 208, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 208, 111, 111, 111, 111, 113, 111, 111, 111, 111, 111, 111, 111, 111
DB 111, 136, 111, 111, 111, 111, 111, 111, 16, 16, 111, 111, 111, 111, 111, 111, 183, 16, 16, 16, 16, 16, 16, 16, 16, 183, 111, 111, 111, 111, 111, 111, 16, 16, 111, 111, 113, 113, 111, 110
DB 182, 16, 16, 16, 16, 16, 16, 16, 16, 185, 113, 111, 111, 111, 111, 111, 16, 185, 208, 111, 111, 111, 113, 113, 113, 113, 111, 111, 113, 113, 113, 113, 113, 185, 16, 16, 16, 16, 16, 16
DB 113, 113, 4, 4, 4, 4, 4, 4, 4, 184, 184, 16, 16, 16, 184, 111, 4, 4, 4, 4, 4, 4, 184, 208, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
DB 4, 4, 40, 40, 4, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 112, 4, 4, 4, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 112, 4, 4, 4, 4, 4
DB 4, 4, 4, 4, 4, 4, 4, 4, 4, 111, 184, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 111, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
DB 4, 4, 4, 4, 4, 4, 4, 4, 184, 184, 112, 4, 4, 4, 4, 4, 185, 16, 16, 16, 16, 16, 16, 16, 16, 184, 4, 4, 4, 4, 4, 4, 184, 183, 4, 4, 4, 4, 4, 4
DB 185, 16, 16, 16, 16, 16, 16, 16, 16, 208, 4, 4, 4, 4, 4, 111, 184, 183, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 112, 184, 16, 16, 16, 16, 16
DB 113, 113, 4, 4, 4, 4, 4, 4, 4, 112, 183, 18, 16, 16, 184, 111, 4, 4, 40, 4, 4, 4, 184, 208, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
DB 4, 4, 40, 40, 4, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 112, 4, 4, 4, 183, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 184, 113, 4, 4, 4, 4, 4
DB 4, 4, 4, 4, 4, 4, 4, 4, 4, 111, 184, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 111, 111, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
DB 4, 4, 4, 4, 4, 4, 4, 4, 184, 184, 112, 4, 4, 4, 4, 4, 185, 16, 16, 16, 16, 16, 16, 16, 16, 184, 4, 4, 4, 4, 4, 4, 183, 183, 4, 4, 4, 4, 4, 4
DB 112, 16, 16, 16, 16, 16, 16, 16, 16, 208, 4, 4, 4, 4, 4, 111, 183, 183, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 112, 184, 183, 16, 16, 16, 16
DB 16, 16, 112, 4, 40, 40, 4, 40, 4, 4, 4, 4, 183, 184, 184, 113, 4, 40, 40, 40, 4, 112, 16, 16, 16, 16, 16, 16, 183, 183, 16, 185, 184, 184, 16, 16, 16, 184, 112, 4
DB 4, 4, 40, 40, 4, 184, 16, 16, 16, 16, 16, 16, 16, 185, 113, 4, 4, 4, 4, 4, 4, 4, 111, 184, 16, 16, 16, 16, 16, 16, 16, 185, 4, 4, 40, 40, 4, 4, 184, 16
DB 16, 16, 185, 185, 16, 16, 112, 4, 40, 4, 4, 4, 111, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 183, 183, 183, 185, 16, 16, 16, 16, 183, 183, 183, 16, 16, 16
DB 184, 111, 4, 4, 4, 40, 40, 4, 16, 16, 4, 4, 4, 40, 4, 4, 182, 16, 16, 16, 16, 16, 16, 16, 16, 112, 4, 4, 40, 40, 4, 4, 184, 16, 4, 40, 40, 40, 40, 4
DB 112, 16, 16, 16, 16, 16, 16, 16, 16, 185, 40, 40, 40, 40, 4, 4, 16, 184, 4, 4, 4, 40, 4, 4, 111, 184, 185, 185, 185, 185, 4, 4, 4, 4, 4, 4, 183, 16, 16, 16
DB 16, 16, 112, 4, 40, 4, 4, 4, 40, 40, 39, 4, 183, 184, 184, 113, 40, 40, 40, 40, 4, 112, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 112, 4
DB 4, 40, 40, 40, 4, 184, 16, 16, 16, 16, 16, 16, 16, 185, 113, 4, 4, 4, 4, 40, 4, 4, 111, 184, 16, 16, 16, 16, 16, 16, 16, 113, 4, 4, 40, 40, 4, 4, 184, 16
DB 16, 16, 16, 16, 16, 16, 112, 4, 40, 40, 4, 4, 136, 185, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 184, 112, 4, 40, 40, 4, 4, 4, 16, 16, 4, 4, 40, 4, 4, 4, 208, 16, 16, 16, 16, 16, 16, 16, 16, 112, 4, 40, 40, 40, 4, 4, 184, 184, 4, 40, 40, 40, 40, 4
DB 112, 16, 16, 16, 16, 16, 16, 16, 16, 185, 40, 40, 40, 40, 4, 4, 16, 16, 4, 4, 4, 40, 4, 4, 112, 184, 16, 16, 16, 184, 4, 4, 4, 4, 4, 4, 208, 16, 16, 16
DB 16, 16, 183, 136, 136, 4, 40, 40, 40, 40, 40, 4, 112, 112, 112, 4, 40, 40, 40, 40, 39, 111, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 112, 4
DB 40, 40, 40, 40, 4, 112, 16, 16, 16, 16, 184, 184, 112, 4, 40, 40, 40, 40, 40, 40, 40, 40, 4, 112, 184, 184, 16, 16, 16, 16, 16, 111, 40, 40, 40, 40, 40, 4, 16, 16
DB 16, 16, 16, 16, 16, 16, 184, 4, 40, 40, 40, 40, 4, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 185, 4, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 4, 208, 16, 184, 184, 184, 112, 183, 184, 184, 185, 40, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 40
DB 4, 112, 112, 112, 112, 112, 112, 112, 112, 4, 40, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 40, 182, 16, 16, 16, 16, 16, 113, 111, 4, 4, 40, 40, 4, 112, 184, 184
DB 16, 16, 184, 184, 184, 112, 40, 40, 40, 40, 40, 40, 113, 113, 4, 4, 40, 40, 40, 40, 39, 111, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 112, 4
DB 40, 40, 40, 40, 4, 112, 16, 16, 16, 16, 208, 136, 4, 4, 40, 40, 40, 40, 40, 40, 40, 40, 40, 4, 136, 136, 16, 16, 16, 16, 16, 111, 40, 40, 40, 40, 40, 4, 16, 16
DB 16, 16, 16, 16, 16, 16, 184, 4, 40, 40, 40, 40, 4, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 185, 4, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 40, 208, 16, 16, 208, 136, 136, 207, 16, 184, 113, 40, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 40
DB 4, 4, 4, 4, 111, 111, 136, 136, 4, 4, 40, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 39, 182, 16, 16, 16, 16, 16, 184, 112, 112, 4, 40, 40, 4, 113, 113, 113
DB 16, 16, 16, 16, 16, 185, 4, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 4, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 4
DB 40, 40, 40, 40, 4, 111, 16, 16, 16, 184, 112, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 4, 184, 16, 16, 16, 184, 110, 40, 40, 40, 40, 4, 4, 184, 16
DB 16, 16, 16, 16, 16, 16, 184, 4, 40, 40, 40, 40, 4, 112, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 184, 112, 40, 40, 40, 40, 40, 4, 182, 183, 4, 40, 40, 40, 40, 40, 185, 184, 184, 112, 40, 40, 111, 184, 184, 113, 40, 40, 40, 40, 40, 4, 185, 184, 4, 4, 40, 40, 40, 40
DB 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 4, 184, 183, 4, 40, 40, 40, 40, 40, 208, 184, 184, 184, 16, 16, 16, 16, 184, 111, 40, 40, 40, 40, 40, 4
DB 16, 16, 16, 16, 16, 185, 4, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 39, 4, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 185, 4
DB 40, 40, 40, 40, 4, 112, 16, 18, 16, 16, 112, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 4, 185, 16, 18, 16, 184, 110, 40, 40, 40, 40, 40, 4, 184, 16
DB 16, 16, 16, 16, 16, 16, 184, 6, 40, 40, 40, 40, 4, 184, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 184, 112, 40, 40, 40, 40, 40, 4, 183, 183, 4, 40, 40, 40, 40, 40, 113, 184, 184, 111, 40, 40, 111, 184, 184, 113, 40, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 40
DB 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 4, 184, 184, 4, 40, 40, 40, 40, 40, 185, 184, 184, 184, 16, 16, 16, 16, 16, 111, 40, 40, 40, 40, 40, 4
DB 6, 6, 6, 6, 6, 6, 42, 42, 6, 113, 186, 209, 207, 206, 113, 6, 42, 42, 42, 41, 12, 114, 16, 16, 16, 16, 16, 16, 16, 114, 140, 6, 6, 6, 6, 6, 6, 6, 42, 42
DB 42, 42, 42, 42, 140, 186, 184, 212, 140, 6, 42, 42, 42, 42, 42, 42, 6, 113, 185, 113, 6, 42, 42, 42, 42, 42, 6, 6, 163, 185, 16, 188, 42, 41, 42, 42, 42, 6, 184, 16
DB 16, 16, 16, 16, 16, 16, 185, 12, 41, 42, 42, 42, 12, 185, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 115, 140, 6, 6, 6, 6, 6, 6
DB 6, 42, 42, 42, 42, 42, 42, 6, 16, 16, 6, 42, 42, 42, 42, 42, 42, 42, 6, 42, 42, 42, 42, 42, 6, 42, 42, 42, 42, 41, 42, 6, 185, 184, 6, 42, 42, 42, 42, 42
DB 114, 185, 111, 183, 208, 208, 185, 185, 184, 114, 12, 42, 42, 42, 42, 6, 16, 16, 12, 42, 42, 42, 42, 42, 6, 6, 6, 186, 16, 16, 16, 16, 16, 137, 42, 42, 42, 42, 42, 6
DB 65, 42, 42, 42, 65, 42, 42, 42, 12, 112, 16, 184, 184, 184, 184, 139, 42, 42, 42, 42, 12, 6, 16, 16, 16, 16, 16, 16, 16, 136, 65, 42, 42, 42, 42, 12, 65, 42, 42, 42
DB 42, 42, 42, 42, 12, 113, 16, 138, 65, 42, 42, 42, 42, 42, 42, 42, 12, 184, 184, 185, 12, 42, 42, 42, 42, 42, 42, 65, 64, 185, 16, 139, 42, 42, 42, 42, 12, 6, 184, 16
DB 16, 16, 16, 16, 16, 16, 185, 64, 42, 42, 42, 42, 12, 185, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 184, 139, 65, 65, 42, 42, 42, 42, 42
DB 42, 42, 42, 42, 42, 42, 42, 12, 16, 16, 12, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 65, 42, 42, 42, 42, 42, 42, 42, 185, 16, 12, 12, 42, 42, 42, 12
DB 114, 184, 184, 184, 16, 16, 16, 184, 184, 114, 12, 42, 42, 42, 42, 12, 16, 16, 12, 42, 42, 42, 42, 42, 42, 65, 65, 114, 16, 16, 16, 16, 16, 138, 42, 42, 42, 42, 12, 6
DB 42, 42, 42, 42, 42, 42, 42, 65, 24, 208, 16, 16, 16, 16, 16, 140, 42, 42, 42, 42, 42, 115, 16, 16, 16, 16, 16, 16, 16, 137, 65, 65, 42, 65, 65, 65, 65, 65, 42, 42
DB 42, 42, 42, 42, 65, 186, 16, 138, 43, 42, 42, 42, 42, 42, 65, 65, 164, 185, 16, 208, 25, 65, 42, 42, 42, 42, 42, 42, 42, 185, 16, 138, 42, 42, 42, 42, 42, 6, 16, 16
DB 16, 16, 16, 16, 16, 16, 186, 42, 42, 42, 43, 43, 140, 185, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 183, 139, 65, 42, 42, 65, 64, 65, 65
DB 65, 42, 42, 42, 42, 42, 42, 42, 16, 16, 6, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 16, 16, 6, 42, 42, 42, 42, 42
DB 114, 16, 16, 16, 16, 16, 16, 16, 16, 138, 42, 42, 42, 42, 43, 6, 16, 16, 12, 65, 65, 65, 65, 42, 65, 12, 65, 211, 16, 16, 16, 16, 16, 138, 42, 42, 42, 42, 42, 6
DB 43, 43, 43, 42, 43, 43, 115, 114, 209, 16, 16, 16, 16, 16, 184, 140, 43, 43, 43, 43, 43, 115, 16, 16, 16, 16, 16, 16, 16, 186, 114, 114, 114, 114, 114, 114, 114, 114, 6, 43
DB 43, 43, 43, 42, 65, 187, 16, 139, 43, 43, 42, 43, 43, 42, 114, 187, 187, 16, 16, 184, 187, 114, 114, 43, 43, 43, 43, 43, 65, 185, 16, 139, 43, 42, 43, 43, 43, 6, 16, 16
DB 16, 16, 16, 16, 16, 16, 186, 43, 43, 43, 43, 43, 65, 186, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 185, 114, 114, 114, 113, 113, 114, 114
DB 114, 6, 43, 43, 43, 43, 43, 42, 16, 16, 6, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 42, 16, 16, 42, 43, 43, 43, 43, 43
DB 115, 16, 16, 16, 16, 16, 16, 16, 16, 137, 43, 43, 43, 43, 43, 42, 16, 16, 113, 114, 114, 114, 114, 114, 114, 114, 114, 185, 16, 16, 16, 16, 16, 138, 43, 43, 43, 42, 43, 42
DB 43, 43, 43, 43, 43, 43, 186, 16, 16, 16, 16, 16, 16, 16, 16, 140, 43, 43, 43, 43, 43, 116, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 187, 66
DB 43, 43, 43, 43, 43, 187, 16, 163, 43, 43, 43, 43, 43, 6, 16, 16, 16, 16, 16, 167, 16, 16, 185, 66, 43, 43, 43, 43, 43, 186, 16, 140, 43, 43, 43, 43, 14, 140, 16, 16
DB 16, 16, 16, 16, 16, 16, 187, 66, 43, 43, 43, 43, 66, 186, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 138, 43, 43, 43, 43, 43, 43, 16, 16, 6, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 16, 16, 140, 43, 43, 43, 43, 43
DB 138, 16, 16, 16, 16, 16, 16, 16, 16, 138, 43, 43, 43, 43, 43, 140, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 167, 166, 16, 16, 16, 140, 44, 43, 43, 43, 43, 6
DB 43, 43, 43, 43, 43, 43, 209, 16, 16, 16, 16, 16, 16, 16, 16, 25, 43, 43, 43, 43, 14, 116, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 187, 66
DB 43, 43, 43, 43, 43, 187, 16, 163, 43, 43, 43, 43, 43, 6, 16, 16, 16, 16, 16, 16, 16, 16, 185, 66, 43, 43, 43, 43, 66, 186, 16, 164, 43, 43, 43, 43, 43, 140, 16, 16
DB 16, 16, 16, 16, 16, 16, 187, 66, 43, 43, 43, 43, 66, 186, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 138, 43, 43, 43, 43, 43, 43, 16, 16, 6, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 16, 16, 43, 14, 43, 43, 43, 43
DB 115, 16, 16, 16, 16, 16, 16, 16, 16, 138, 43, 43, 43, 43, 14, 65, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 167, 16, 16, 16, 16, 140, 43, 43, 43, 43, 43, 43
DB 43, 43, 43, 43, 43, 43, 208, 16, 16, 16, 16, 16, 16, 16, 16, 140, 44, 43, 43, 43, 44, 116, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 187, 14
DB 43, 43, 43, 43, 14, 188, 16, 164, 44, 43, 43, 43, 44, 43, 16, 16, 16, 16, 16, 16, 16, 16, 186, 43, 43, 43, 43, 43, 14, 186, 16, 140, 44, 43, 43, 44, 43, 6, 16, 16
DB 16, 16, 16, 16, 16, 16, 187, 14, 43, 43, 43, 43, 43, 187, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 115, 44, 43, 43, 43, 43, 43, 16, 16, 6, 43, 43, 43, 43, 43, 43, 43, 14, 43, 138, 138, 6, 14, 43, 43, 43, 43, 43, 43, 43, 43, 18, 16, 138, 139, 115, 43, 44, 43
DB 43, 116, 116, 188, 16, 16, 187, 116, 116, 43, 44, 43, 43, 139, 139, 137, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 116, 116, 116, 43, 43, 43, 43, 140, 138, 137
DB 43, 43, 43, 43, 44, 44, 186, 16, 16, 16, 16, 16, 16, 16, 16, 26, 44, 43, 44, 43, 14, 116, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 187, 67
DB 44, 44, 43, 44, 14, 188, 16, 164, 44, 43, 43, 43, 44, 43, 16, 16, 16, 16, 16, 16, 16, 16, 186, 14, 44, 44, 44, 43, 14, 186, 16, 164, 44, 44, 43, 43, 14, 6, 16, 16
DB 16, 16, 16, 16, 16, 16, 187, 14, 43, 43, 43, 44, 14, 187, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 139, 44, 44, 44, 44, 44, 43, 16, 16, 43, 44, 43, 43, 43, 43, 43, 44, 14, 6, 16, 16, 115, 14, 44, 43, 44, 44, 44, 43, 44, 43, 16, 16, 16, 16, 16, 43, 44, 44
DB 14, 14, 68, 140, 16, 16, 139, 68, 14, 14, 43, 44, 43, 185, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 26, 14, 14, 14, 43, 44, 6, 16, 16, 16
DB 14, 14, 14, 44, 44, 45, 187, 16, 16, 16, 16, 16, 16, 16, 16, 6, 44, 44, 44, 44, 14, 116, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 187, 14
DB 44, 44, 44, 44, 14, 188, 16, 164, 44, 43, 44, 43, 44, 6, 16, 16, 16, 16, 16, 16, 16, 16, 186, 14, 44, 44, 44, 44, 14, 186, 16, 164, 67, 14, 44, 44, 44, 6, 16, 16
DB 16, 16, 16, 16, 16, 16, 188, 14, 44, 44, 14, 67, 67, 187, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
DB 16, 115, 44, 44, 44, 44, 44, 43, 16, 16, 43, 44, 44, 44, 43, 43, 14, 14, 67, 25, 16, 16, 139, 67, 67, 14, 44, 44, 44, 44, 44, 43, 16, 16, 16, 16, 16, 26, 67, 14
DB 43, 44, 14, 116, 16, 16, 115, 14, 44, 44, 14, 67, 66, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 43, 44, 43, 44, 14, 67, 26, 16, 16, 16
DB 6, 6, 43, 44, 44, 44, 140, 140, 164, 164, 164, 164, 164, 140, 140, 14, 44, 44, 44, 44, 14, 116, 16, 21, 23, 164, 164, 164, 164, 164, 164, 164, 140, 140, 164, 164, 140, 140, 140, 14
DB 44, 44, 44, 44, 14, 188, 16, 164, 44, 44, 44, 44, 14, 45, 16, 16, 16, 16, 16, 16, 16, 16, 186, 67, 44, 44, 44, 44, 14, 187, 16, 138, 43, 6, 43, 44, 44, 43, 140, 163
DB 164, 164, 163, 164, 164, 140, 116, 14, 44, 44, 6, 115, 115, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 139, 164, 140, 164, 164, 164, 164, 164, 164, 164, 140, 140, 140, 140
DB 140, 25, 14, 44, 44, 44, 44, 43, 16, 16, 43, 44, 44, 44, 44, 14, 43, 116, 116, 115, 16, 16, 187, 116, 116, 6, 44, 44, 44, 44, 44, 14, 18, 16, 16, 16, 16, 139, 116, 116
DB 43, 14, 14, 43, 163, 163, 43, 14, 44, 45, 116, 115, 115, 16, 16, 16, 16, 16, 166, 164, 165, 164, 164, 164, 140, 140, 140, 140, 140, 140, 43, 44, 14, 43, 116, 116, 139, 16, 16, 16
DB 16, 16, 187, 67, 44, 44, 44, 44, 14, 44, 14, 14, 14, 14, 14, 14, 44, 44, 44, 44, 14, 116, 16, 26, 14, 14, 14, 14, 14, 14, 44, 44, 44, 44, 14, 14, 44, 44, 44, 44
DB 44, 44, 44, 44, 14, 188, 16, 164, 44, 44, 44, 44, 44, 45, 16, 16, 16, 16, 16, 16, 16, 16, 186, 14, 44, 44, 44, 44, 14, 187, 16, 16, 16, 16, 116, 14, 44, 44, 14, 44
DB 14, 14, 14, 14, 44, 44, 44, 44, 44, 14, 188, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 14, 14, 44, 44, 44, 44, 14, 44, 44, 44, 44, 44, 14, 14
DB 14, 44, 44, 44, 44, 44, 14, 14, 16, 16, 66, 14, 44, 44, 44, 44, 140, 16, 16, 16, 16, 16, 16, 16, 16, 236, 14, 44, 44, 44, 44, 45, 18, 16, 16, 16, 166, 166, 16, 16
DB 6, 14, 44, 44, 14, 14, 44, 44, 14, 43, 16, 16, 16, 16, 16, 16, 16, 186, 14, 14, 44, 14, 44, 14, 14, 14, 14, 44, 44, 44, 44, 44, 14, 140, 16, 16, 16, 16, 16, 16
DB 16, 16, 187, 68, 14, 44, 44, 44, 44, 14, 44, 44, 14, 14, 14, 14, 44, 44, 44, 44, 14, 116, 16, 27, 44, 14, 14, 14, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44
DB 44, 44, 44, 44, 14, 188, 16, 24, 44, 44, 44, 44, 44, 45, 16, 16, 16, 16, 16, 16, 16, 16, 189, 14, 44, 44, 44, 44, 14, 187, 16, 16, 16, 16, 140, 14, 44, 44, 14, 14
DB 14, 44, 14, 14, 44, 44, 44, 44, 44, 14, 188, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 18, 14, 14, 44, 44, 44, 14, 44, 44, 44, 44, 44, 44, 14, 14
DB 14, 44, 44, 44, 44, 44, 14, 14, 16, 16, 66, 14, 44, 44, 44, 14, 140, 16, 16, 16, 16, 16, 16, 16, 16, 138, 14, 44, 44, 44, 44, 44, 18, 16, 16, 16, 166, 166, 16, 16
DB 6, 14, 14, 14, 14, 14, 44, 44, 14, 43, 16, 16, 16, 16, 16, 16, 16, 186, 14, 14, 44, 14, 44, 14, 14, 14, 14, 44, 44, 44, 44, 44, 14, 140, 16, 16, 16, 16, 16, 16
DB 16, 16, 18, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 164, 24, 24, 24, 20, 16, 22, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24
DB 24, 24, 164, 164, 24, 189, 16, 21, 24, 164, 24, 24, 24, 165, 16, 16, 16, 16, 16, 16, 16, 16, 16, 23, 24, 24, 24, 24, 24, 18, 16, 16, 16, 16, 20, 24, 164, 140, 164, 164
DB 24, 24, 24, 24, 24, 24, 24, 24, 24, 164, 209, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 140, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24
DB 24, 24, 164, 24, 24, 24, 24, 24, 16, 16, 165, 24, 24, 24, 164, 164, 20, 16, 16, 16, 16, 16, 16, 16, 16, 19, 164, 164, 24, 24, 25, 140, 16, 16, 16, 16, 16, 16, 16, 16
DB 141, 164, 24, 24, 24, 24, 24, 24, 24, 140, 16, 16, 16, 16, 16, 16, 16, 16, 23, 24, 24, 24, 164, 164, 24, 24, 24, 24, 24, 24, 24, 24, 25, 142, 16, 16, 16, 16, 16, 16
x_position dw 50
y_position dw 30
first_player_wins db 'First Player Wins $'
second_player_wins db 'Second player wins $'
GAME_OVER_mess db 'Press ESC Key to Return to main menu $'
Goodbye_mess db 'Goodbye *^-^* $'
;;;;;;;CHAT ;;;
First_cursor_X DB 6
First_cursor_Y DB 1
; SECOND CURSOR USED FOR RECEIVING
SECOND_CURSOR_X DB 6
SECOND_CURSOR_Y DB 13
start_position_x equ 6
LETTER_SENT DB ?
LETTER_RECEIVING DB ?
Line_status_register equ 3FDH
TRANSMIT_DATA_REGISTER equ 3F8H
Line_Control_Register equ 3fbh
end_line db 76
IS_ENTER DB 0
IS_BACKSPACE DB 0
;players Name
first_chatter db 'chatter 1 : $'
second_chatter db 'chatter 2 : $'
chat_end_string db 'To end chat press ESC $'
;;; IN GAME CHAT MODULE
in_game_cursor_up db 0
in_game_cursor_down db 0
in_game_received_val db 0
in_game_to_send_val db 0
in_game_iterator db 0
in_game_end_chat db 0
is_quit db 0
level DB 0
;------------------------------------------------------------
;;FOR MAKING GAME BEING PLAYED BY TWO PCS
LETTER_RECEIVED DB ?;LETTER RECIEVED BY UART
is_master DB 01h ;WHEN A PLAYER SENT INVI. TO THE ANOTHER ONE SO HE IS THE MASTER (MASTER VALUE=1)
STORED_KEY_OR_UART DB ?;LETTER RECIEVED BY UART OR KEY OF KEYBOARD(OPTIONS OF CONTROLLING THE PLAYERS)
;---------------------------------------------------------------------------
.code
MAIN PROC FAR
mov ax,@data
mov ds ,ax
MOV ES, AX
CALL Far PTR Take_User_Data
Call FAR PTR MAIN_MENU
Call FAR PTR CLEAR_SCREEN
mov ah,2
mov dx,090fh
int 10h
PRINT_Messages Goodbye_mess
mov ah,0
int 16h
RET
MAIN ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;taking the character from the user and reacting to it
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;taking the character from the user and reacting to it
;taking the character from the user and reacting to it
MOVE_PLAYERS PROC FAR
;Check if any player is freezed--> then reduce its freezing time
cmp first_player_freeze,0
je Is_Second_Player_Freeze
dec first_player_freeze
Is_Second_Player_Freeze:
cmp second_player_freeze,0
je Check_Pressed
dec second_player_freeze
Check_Pressed:
;TO KNOW THAT I AM THE MASTER OR THE SLAVE
mov DL,GAME_MASTER
CMP DL, 0
jnz I_AM_NOT_MASTER_reverse_label
jmp I_AM_NOT_MASTER
I_AM_NOT_MASTER_reverse_label:
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MASTER;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;check if any key is being pressed
MOV AH,01h
INT 16h
JnZ CHECK_MOVEMENT_MASTER_KEYBOARD ;ZF = 1, JZ -> Jump If Zero
jmp CHECK_MOVEMENT_MASTER_UART
CHECK_MOVEMENT_MASTER_KEYBOARD:
;Read which key is being pressed (AL = ASCII character/ AH = SCAN CODE)
MOV AH,00h
INT 16h
SendChar AH
;in game chat
cmp ah,27h ;press ';' to start ni game chat
jne cont1
;call far ptr send_in_chat_inv
call far ptr start_in_game_chatting
jmp End_Moving
cont1:
cmp AH,39h ;this is space key(ATTACK BUTTON)
jne First_moved_1
cmp first_player_freeze,0
JLE Do_not_End_Moving_1 ;if it is still freezed
jmp End_Moving
Do_not_End_Moving_1:
cmp First_Is_Collided,1 ;If he is colliding, he cannot attack
JNE Do_not_End_Moving_2
Jmp End_Moving
Do_not_End_Moving_2:
call FAR PTR First_Player_Attack
jmp End_Moving
First_moved_1:
cmp first_player_freeze,0
JLE Do_not_End_Moving_3
jmp End_Moving ;if it is still freezed
Do_not_End_Moving_3:
MOV STORED_KEY_OR_UART,AH
call FAR PTR CHECK_FIRST_PLAYER_MOVEMENT
jmp End_Moving
CHECK_MOVEMENT_MASTER_UART:
;;;;;;;;;;;;;;;;;;;;;;;RECIEVEFROM_UART;;;;;;;;;;;;;;;;;;;;;;;;;;;
ReceiveCharNotAmustToRecieve
MOV LETTER_RECEIVED,AL
;in game chat
cmp LETTER_RECEIVED,27h ;press ';' to start ni game chat
jne cont2
;call far ptr send_in_chat_inv
call far ptr start_in_game_chatting
jmp End_Moving
cont2:
;;;;;;;;;;;;;;;;;;;;;;;RECIEVEFROM_UART;;;;;;;;;;;;;;;;;;;;;;;;;;;
cmp LETTER_RECEIVED,39h ;this is Enter (ATTACK BUTTON)
jne Second_MOVED_1
cmp second_player_freeze,0
JLE Do_not_End_Moving_4
jmp End_Moving ;if it is still freezed
Do_not_End_Moving_4:
cmp Second_Is_Collided,1 ;If he is colliding, he cannot attack
JNE Do_not_End_Moving_5
Jmp End_Moving
Do_not_End_Moving_5:
call FAR PTR Second_Player_Attack
jmp End_Moving
Second_MOVED_1:
cmp second_player_freeze,0
JLE Do_not_End_Moving_6
jmp End_Moving ;if it is still freezed
Do_not_End_Moving_6:
MOV STORED_KEY_OR_UART,AL
call FAR PTR CHECK_SECOND_PLAYER_MOVEMENT
jmp End_Moving
;/////////////////////////////////////////////////////////////////////////////////////////////////////SLAVE/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
I_AM_NOT_MASTER:
MOV AH,01h
INT 16h
JnZ CHECK_MOVEMENT_SLAVE_KEYBOARD ;ZF = 1, JZ -> Jump If Zero
JZ CHECK_MOVEMENT_SLAVE_UART
CHECK_MOVEMENT_SLAVE_KEYBOARD:
;Read which key is being pressed (AL = ASCII character/ AH = SCAN CODE)
MOV AH,00h
INT 16h
SendChar AH
cmp ah,27h ;press ';' to start ni game chat
jne cont3
;call far ptr send_in_chat_inv
call far ptr start_in_game_chatting
jmp End_Moving
cont3:
cmp AH,39h ;this is ENTER key (ATTACK BUTTON)
jne SECOND_moved_2
cmp SECOND_player_freeze,0
jg End_Moving ;if it is still freezed
cmp SECOND_Is_Collided,1 ;If he is colliding, he cannot attack
JE End_Moving
call FAR PTR SECOND_Player_Attack
jmp End_Moving
SECOND_moved_2:
cmp first_player_freeze,0
jg End_Moving ;if it is still freezed
MOV STORED_KEY_OR_UART,AH
call FAR PTR CHECK_SECOND_PLAYER_MOVEMENT
jmp End_Moving
CHECK_MOVEMENT_SLAVE_UART:
;;;;;;;;;;;;;;;;;;;;;;;RECIEVEFROM_UART;;;;;;;;;;;;;;;;;;;;;;;;;;;
ReceiveCharNotAmustToRecieve
MOV LETTER_RECEIVED,AL
cmp LETTER_RECEIVED,27h ;press ';' to start ni game chat
jne cont4
;call far ptr send_in_chat_inv
call far ptr start_in_game_chatting
jmp End_Moving
cont4:
;;;;;;;;;;;;;;;;;;;;;;;RECIEVEFROM_UART;;;;;;;;;;;;;;;;;;;;;;;;;;;
cmp LETTER_RECEIVED,39h ;this is SPACE (ATTACK BUTTON)
jne FIRST_MOVED_2
cmp FIRST_player_freeze,0
jg End_Moving ;if it is still freezed
cmp FIRST_Is_Collided,1 ;If he is colliding, he cannot attack
JE End_Moving
call FAR PTR FIRST_Player_Attack
jmp End_Moving
FIRST_MOVED_2:
cmp second_player_freeze,0
jg End_Moving ;if it is still freezed
MOV STORED_KEY_OR_UART,AL
call FAR PTR CHECK_FIRST_PLAYER_MOVEMENT
;call FAR PTR CHECK_SECOND_PLAYER_MOVEMENT
jmp End_Moving
End_Moving:
RET
MOVE_PLAYERS ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;this will check for direction of the attack
First_Player_Attack PROC
mov ax,first_player_X
cmp ax,second_player_X
jGE Second_IS_IN_THE_LEFT_SIDE
call FAR PTR First_Attack_Left_TO_Right
RET
Second_IS_IN_THE_LEFT_SIDE:
Call far PTR First_Attack_Right_TO_Left
RET
First_Player_Attack ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;this will check for direction of the attack
Second_Player_Attack PROC
mov ax,Second_player_X
cmp ax,First_player_X
jGE First_IS_IN_THE_LEFT_SIDE
call FAR PTR Second_Attack_Left_TO_Right
RET
First_IS_IN_THE_LEFT_SIDE:
Call far PTR Second_Attack_Right_TO_Left
RET
Second_Player_Attack ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;clear the console
CLEAR_SCREEN PROC FAR
MOV AH,00h ;set the configuration to video mode
MOV AL,13h ;choose the video mode
INT 10h ;execute the configuration
MOV AH,0fh ;set the configuration
MOV BH,00h ;to the background color
MOV BL,00h ;choose black as background color
INT 10h ;execute the configuration
RET
CLEAR_SCREEN ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;draw the image of player one
draw_p1 proc FAR
;;;;;;;;;;;;;;
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov di,0
mov al,p1[DI] ;the pixel color
mov bh,0 ;the page number
mov cx,first_player_X ;the starting x-position (column)
add cx,PLAYERS_WIDTH ;as we draw in the reversed order
mov dx,first_player_Y ;the starting y-position (row)
add dx,PLAYERS_HEIGHT ;as we draw in the reversed order
;here we loop for the image size (player_size)
fill_p1:
cmp al,0
jz pass_the_pixel
int 10h
pass_the_pixel:
inc di
mov al,p1[DI]
dec cx
cmp cx,first_player_X
jnz fill_p1 ;if not zero so we continue to the same row
mov cx,first_player_X ;the starting x-position (column)
add cx,PLAYERS_WIDTH ;as we draw in the reversed order
dec dx ;if not zero so we continue to draw the background
cmp dx,first_player_Y
jnz fill_p1
;;;;;;;;;;;;;;
ret
draw_p1 endp
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;draw the image of player two
draw_p2 proc FAR
;;;;;;;;;;;;;;
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov di,0
mov al,p2[DI] ;the pixel color
mov bh,0 ;the page number
mov cx,second_player_X ;the starting x-position (column)
add cx,PLAYERS_WIDTH ;as we draw in the reversed order
mov dx,SECOND_PLAYER_Y ;the starting y-position (row)
add dx,PLAYERS_HEIGHT ;as we draw in the reversed order
;here we loop for the image size (player_size)
fill_p2:
cmp al,0
jz pass_the_pixel_2
int 10h
pass_the_pixel_2:
inc di
mov al,p2[DI]
dec cx
cmp cx,second_player_X
jnz fill_p2 ;if not zero so we continue to the same row
mov cx,second_player_X ;the starting x-position (column)
add cx,PLAYERS_WIDTH ;as we draw in the reversed order
dec dx ;if not zero so we continue to draw the background
cmp dx,SECOND_PLAYER_Y
jnz fill_p2
;;;;;;;;;;;;;;
ret
draw_p2 endp
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;fill the whole screen with the background color
draw_background proc FAR
;;;;;;;;;;;;;;
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov al,background_color ;the pixel color
mov bh,0 ;the page number
mov cx,0 ;the x-position (column)
mov dx,0 ;the y-position (row)
;here we loop for 4/5 of the screen
fillblue:
int 10h
inc cx
cmp cx,WINDOW_WIDTH
jnz fillblue ;if not zero so we continue to the same row
inc dx
mov cx,0
cmp dx,WINDOW_HEIGHT ;if not zero so we continue to draw the background
jnz fillblue
;;;;;;;;;;;;;;
ret
draw_background endp
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;draw a number of hearts that is first_player_health
draw_h1 PROC FAR
;check if health is zero, don't draw
mov ax,first_player_health
cmp ax,0
jnz first_player_alive
RET
first_player_alive:
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov PRE_POSITION_X,first_player_health_X
mov PRE_POSITION_Y,first_player_health_Y
mov si,0
CLEAR_H1:
mov al,background_color
mov bh,0
mov cx,PRE_POSITION_X ;the starting x-position (column)
add cx,health_bar_width
mov dx,pre_position_y
add dx,window_bounds_upper
fill_h1_background:
int 10h
dec cx
cmp cx,pre_position_x
jnz fill_h1_background
mov cx,PRE_POSITION_X ;the starting x-position (column)
add cx,health_bar_width
dec dx
cmp dx,PRE_POSITION_Y
jnz fill_h1_background
draw_one_Red_heart:
;;;;;;;;;;;;;;
mov di,0
mov al,h1[DI] ;the pixel color
mov bh,0 ;the page number
mov cx,PRE_POSITION_X ;the starting x-position (column)
add cx,heart_WIDTH ;as we draw in the reversed order
mov dx,PRE_POSITION_Y ;the starting y-position (row)
add dx,heart_HEIGHT ;as we draw in the reversed order
;here we loop for the image size (player_size)
fill_h1:
cmp al,0
jz pass_the_pixel__1
int 10h
pass_the_pixel__1:
inc di
mov al,h1[DI]
dec cx
cmp cx,PRE_POSITION_X
jnz fill_h1 ;if not zero so we continue to the same row
mov cx,PRE_POSITION_X ;the starting x-position (column)
add cx,heart_WIDTH ;as we draw in the reversed order
dec dx ;if not zero so we continue to draw the background
cmp dx,PRE_POSITION_Y
jnz fill_h1
;;;;;;;;;;;;;;
inc si
cmp si,first_player_health
jz finish_drawing_h1
mov di,pre_position_x
add di,heart_WIDTH
mov pre_position_x,di
jmp draw_one_Red_heart
finish_drawing_h1:
ret
draw_h1 ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;draw a number of hearts that is second_player_health
draw_h2 PROC FAR
;check if health is zero, don't draw
mov ax,second_player_health
cmp AX,0
jnz second_player_alive
RET
second_player_alive:
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov PRE_POSITION_X,second_player_health_X
mov PRE_POSITION_Y,second_player_health_Y
mov si,0
CLEAR_H2:
mov al,background_color
mov bh,0
mov cx,WINDOW_WIDTH ;the ending x-position (column)
SUB cx,health_bar_width
mov dx,pre_position_y
add dx,window_bounds_upper
fill_h2_background:
int 10h
INC cx
cmp cx,WINDOW_WIDTH
jnz fill_h2_background
mov cx,WINDOW_WIDTH ;the starting x-position (column)
sub cx,health_bar_width
dec dx
cmp dx,PRE_POSITION_Y
jnz fill_h2_background
draw_one_Blue_heart:
;;;;;;;;;;;;;;
mov di,0
mov al,h2[DI] ;the pixel color
mov bh,0 ;the page number
mov cx,PRE_POSITION_X ;the starting x-position (column)
add cx,heart_WIDTH ;as we draw in the reversed order
mov dx,PRE_POSITION_Y ;the starting y-position (row)
add dx,heart_HEIGHT ;as we draw in the reversed order
;here we loop for the image size (player_size)
fill_h2:
cmp al,0
jz pass_the_pixel__2
int 10h
pass_the_pixel__2:
inc di
mov al,h2[DI]
dec cx
cmp cx,PRE_POSITION_X
jnz fill_h2 ;if not zero so we continue to the same row
mov cx,PRE_POSITION_X ;the starting x-position (column)
add cx,heart_WIDTH ;as we draw in the reversed order
dec dx ;if not zero so we continue to draw the background
cmp dx,PRE_POSITION_Y
jnz fill_h2
;;;;;;;;;;;;;;
inc si
cmp si,second_player_health
jz finish_drawing_h2
mov di,pre_position_x
sub di,heart_WIDTH
mov pre_position_x,di
jmp draw_one_Blue_heart
finish_drawing_h2:
ret
draw_h2 ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
FILLRECTANGLE proc FAR
MOV DI,0
PUSH LEN
FILL:
PUSH LEN
FILLINNER:
MOV AH,0CH
MOV AL,Barrier_array[DI]
INC DI
MOV BH,0H
MOV CX,LEN
MOV DX,WID
INT 10H
MOV BX,LENMAX
INC LEN
CMP BX,LEN
JNZ FILLINNER
POP LEN
INC WID
MOV BX,WIDMAX
CMP BX,WID
JNZ FILL
POP WID
RET
FILLRECTANGLE ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
DRAW_BARRIER1 PROC FAR
;As we use pre_position variables as temp, and we always call draw_barrier after we update their values
;We need to condition only one special case is when we draw them for the first time
mov ax,pre_position_y
cmp ax,0
jz first_time_to_draw1
first_time_to_draw1:
mov Ax,X_BARRIER1
mov LEN,Ax
add Ax, BARRIER_HORIZONTAL_SIZE
mov LENMAX,ax
mov ax,Y_BARRIER1
mov WID,ax
add ax, BARRIER_VERTICAL_SIZE
mov WIDMAX,ax
CALL FAR PTR CHECK_BOUNDARY_BARRIER1
RET
DRAW_BARRIER1 endp
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
DRAW_BARRIER2 PROC FAR
;As we use pre_position variables as temp, and we always call draw_barrier after we update their values
;We need to condition only one special case is when we draw them for the first time
mov ax,pre_position_y
cmp ax,0
jz first_draw2
first_draw2:
;; CALL CHECK_OVERLAPPING_BARRIER2
mov Ax,X_BARRIER2
mov LEN,Ax
add Ax, BARRIER_HORIZONTAL_SIZE
mov LENMAX,ax
mov ax,Y_BARRIER2
mov WID,ax
add ax, BARRIER_VERTICAL_SIZE
mov WIDMAX,ax
CALL FAR PTR CHECK_BOUNDARY_BARRIER2
RET
DRAW_BARRIER2 ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;checking that this move is allowed
CHECK_FIRST_PLAYER_MOVEMENT PROC FAR
;STORE THE PREVIOUS POSITION OF PLAYER 1, we will use it if the new position causes collision (the same as push it in the stack)
MOV BX,first_player_X
MOV PRE_POSITION_X,BX
mov BX,first_player_Y
MOV PRE_POSITION_Y,BX
;if it is 'w' or 'W' move up
CMP STORED_KEY_OR_UART, 48H
JE MOVE_FIRST_PLAYER_UP
;if it is 's' or 'S' move down
CMP STORED_KEY_OR_UART,50H
JE MOVE_FIRST_PLAYER_DOWN
;if it is 'D' or 'd' move first player right
cmp STORED_KEY_OR_UART,4DH
je MOVE_FIRST_PLAYER_right
; if it is 'A' or 'a' move first player left
cmp STORED_KEY_OR_UART,4BH
je MOVE_FIRST_PLAYER_LEFT
JMP Exit_FIRST_PLAYER_MOVEMENT
MOVE_FIRST_PLAYER_UP:
MOV AX,PLAYERS_VELOCITY
SUB first_player_Y,AX
MOV AX,window_bounds_upper
CMP first_player_Y,AX
JL FIX_FIRST_PLAYER_TOP_POSITION ;it will jump if first_player_Y < AX ---> outside the window
JMP CHECK_FOR_COLLISION_1
FIX_FIRST_PLAYER_TOP_POSITION: ;Return it to inside the window
MOV first_player_Y,AX
JMP CHECK_FOR_COLLISION_1
MOVE_FIRST_PLAYER_DOWN:
MOV AX,PLAYERS_VELOCITY
ADD first_player_Y,AX
MOV AX,WINDOW_HEIGHT
SUB AX,WINDOW_BOUNDS
SUB AX,PLAYERS_HEIGHT
CMP first_player_Y,AX
JG FIX_FIRST_PLAYER_BOTTOM_POSITION ;it will jump if first_player_Y > AX---> outside the window
JMP CHECK_FOR_COLLISION_1
FIX_FIRST_PLAYER_BOTTOM_POSITION: ;Return it to inside the window
MOV first_player_Y,AX
JMP CHECK_FOR_COLLISION_1
MOVE_FIRST_PLAYER_right:
MOV AX,PLAYERS_VELOCITY
ADD first_player_X,AX
MOV AX,WINDOW_WIDTH
SUB AX,PLAYERS_WIDTH
SUB AX,WINDOW_BOUNDS
cmp first_player_X,AX
JG FIX_FIRST_PLAYER_RIGHT_POSITION ;it will jump if first_player_X > AX---> outside the window
JMP CHECK_FOR_COLLISION_1
FIX_FIRST_PLAYER_RIGHT_POSITION: ;Return it to inside the window
MOV first_player_X,AX
JMP CHECK_FOR_COLLISION_1
MOVE_FIRST_PLAYER_LEFT:
mov ax,PLAYERS_VELOCITY
SUB first_player_X,ax
MOV AX,WINDOW_BOUNDS
CMP first_player_X,AX
JL FIX_FIRST_PLAYER_LEFT_POSITION
JMP CHECK_FOR_COLLISION_1
FIX_FIRST_PLAYER_LEFT_POSITION:
MOV first_player_X,AX
JMP CHECK_FOR_COLLISION_1
CHECK_FOR_COLLISION_1:
; maxx1 > minx2 && minx1 < maxx2 && maxy1 > miny2 && miny1 < maxy2
MOV AX,first_player_X ;IF maxx1 > minx2
ADD AX,PLAYERS_WIDTH
CMP AX,second_player_X
JNG Exit_FIRST_PLAYER_MOVEMENT ;No collision will happen
MOV AX,second_player_X ;IF minx1 < maxx2
ADD AX,PLAYERS_WIDTH
CMP first_player_X,AX
JNL Exit_FIRST_PLAYER_MOVEMENT ;No collision will happen
MOV AX,SECOND_PLAYER_Y ;IF maxy1 > miny2
ADD AX,PLAYERS_HEIGHT
CMP AX,first_player_Y
JNG Exit_FIRST_PLAYER_MOVEMENT ;No collision will happen
MOV AX,first_player_Y ;IF miny1 < maxy2
ADD AX,PLAYERS_HEIGHT
CMP SECOND_PLAYER_Y,AX
JNL Exit_FIRST_PLAYER_MOVEMENT ;No collision will happen
MOV DX,PRE_POSITION_X ; If it reached here then there will be a collision
MOV first_player_X,DX ; Return the old values
MOV DX,PRE_POSITION_Y
MOV first_player_Y,DX
RET
Exit_FIRST_PLAYER_MOVEMENT:
call FAR PTR Update_Players
call FAR PTR draw_p1
RET
CHECK_FIRST_PLAYER_MOVEMENT ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;checking that this move is allowed
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;checking that this move is allowed
CHECK_SECOND_PLAYER_MOVEMENT PROC FAR
mov DX,second_player_X
MOV PRE_POSITION_X,DX
mov DX,SECOND_PLAYER_Y
MOV PRE_POSITION_Y,DX
;if it is 'o' or 'O' move up
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IN AX, 60H
CMP STORED_KEY_OR_UART, 48H ;(UP_ARROW)
JE MOVE_SECOND_PLAYER_UP
CMP STORED_KEY_OR_UART, 50H ;(DOWN_ARROW)
JE MOVE_SECOND_PLAYER_DOWN
CMP STORED_KEY_OR_UART, 4BH ;(LEST_ARROW)
JE MOVE_SECOND_PLAYER_left
CMP STORED_KEY_OR_UART, 4DH;(RIGHT_ARROW)
JE MOVE_SECOND_PLAYER_right
JMP EXIT_PLAYERS_MOVEMENT
MOVE_SECOND_PLAYER_UP:
MOV AX,PLAYERS_VELOCITY
SUB SECOND_PLAYER_Y,AX
MOV AX,window_bounds_upper
CMP SECOND_PLAYER_Y,AX
JL FIX_second_player_TOP_POSITION
JMP CHECK_FOR_COLLISION_2
FIX_second_player_TOP_POSITION:
MOV SECOND_PLAYER_Y,AX
JMP CHECK_FOR_COLLISION_2
MOVE_SECOND_PLAYER_DOWN:
MOV AX,PLAYERS_VELOCITY
ADD SECOND_PLAYER_Y,AX
MOV AX,WINDOW_HEIGHT
SUB AX,WINDOW_BOUNDS
SUB AX,PLAYERS_HEIGHT
CMP SECOND_PLAYER_Y,AX
JG FIX_second_player_down_POSITION
JMP CHECK_FOR_COLLISION_2
FIX_second_player_down_POSITION:
MOV SECOND_PLAYER_Y,AX
JMP CHECK_FOR_COLLISION_2
MOVE_SECOND_PLAYER_left:
MOV AX,PLAYERS_VELOCITY
SUB second_player_X,AX
MOV AX,WINDOW_BOUNDS
CMP second_player_X,AX
JL FIX_SECOND_PLAYER_left_POSITION
JMP CHECK_FOR_COLLISION_2
FIX_SECOND_PLAYER_left_POSITION:
MOV second_player_X,AX
JMP CHECK_FOR_COLLISION_2
MOVE_SECOND_PLAYER_right:
MOV AX,PLAYERS_VELOCITY
ADD second_player_X,AX
MOV AX,WINDOW_WIDTH
SUB AX,WINDOW_BOUNDS
sub AX,PLAYERS_WIDTH
CMP second_player_X,AX
JG FIX_SECOND_PLAYER_RIGHT_POSITION
JMP CHECK_FOR_COLLISION_2
FIX_SECOND_PLAYER_RIGHT_POSITION:
MOV second_player_X,AX
JMP CHECK_FOR_COLLISION_2
CHECK_FOR_COLLISION_2:
; maxx1 > minx2 && minx1 < maxx2 && maxy1 > miny2 && miny1 < maxy2
MOV AX,first_player_X ;IF maxx1 > minx2
ADD AX,PLAYERS_WIDTH
CMP AX,second_player_X
JNG EXIT_PLAYERS_MOVEMENT ;No collision will happen
MOV AX,second_player_X ;IF minx1 < maxx2
ADD AX,PLAYERS_WIDTH
CMP first_player_X,AX
JNL EXIT_PLAYERS_MOVEMENT ;No collision will happen
MOV AX,SECOND_PLAYER_Y ;IF maxy1 > miny2
ADD AX,PLAYERS_HEIGHT
CMP AX,first_player_Y
JNG EXIT_PLAYERS_MOVEMENT ;No collision will happen
MOV AX,first_player_Y ;IF miny1 < maxy2
ADD AX,PLAYERS_HEIGHT
CMP SECOND_PLAYER_Y,AX
JNL EXIT_PLAYERS_MOVEMENT ;No collision will happen
MOV DX,PRE_POSITION_X ; If it reached here then there will be a collision
MOV second_player_X,DX ; Return the old values
MOV DX,PRE_POSITION_Y
MOV SECOND_PLAYER_Y,DX
RET
EXIT_PLAYERS_MOVEMENT:
Call FAR PTR Update_Players
Call FAR PTR draw_p2
RET
CHECK_SECOND_PLAYER_MOVEMENT ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;erase the player original position before moving
Update_Players PROC FAR
;;;;;;;;;;;;;;
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov al,background_color ;the pixel color
mov bh,0 ;the page number
MOV CX,PRE_POSITION_X
MOV SI,CX
ADD SI,PLAYERS_WIDTH
ADD SI,1
MOV Dx,PRE_POSITION_Y
MOV DI,DX
ADD DI,PLAYERS_HEIGHT
ADD DI,1
;here we loop for 4/5 of the screen
fillblue1:
int 10h
inc cx
cmp cx,SI
jnz fillblue1 ;if not zero so we continue to the same row
inc dx
mov cx,PRE_POSITION_X
cmp dx,DI ;if not zero so we continue to draw the background
jnz fillblue1
;;;;;;;;;;;;;;
RET
Update_Players ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
first_player_barriers_coli PROC FAR
;check for collision between player1 and barriers(1,2)
;CHECK_FOR_COLLISION_p1_b1:
mov First_Is_Collided,0
;first_player_x+players_width<x_barrier1
MOV AX,first_player_X
ADD AX,PLAYERS_WIDTH
CMP AX,X_BARRIER1
JNG CHECK_FOR_COLLISION_p1_b2 ;No collision will happen
;first_player_x>x_barrier1+ BARRIER_HORIZONTAL_SIZE
MOV AX,X_BARRIER1
ADD AX, BARRIER_HORIZONTAL_SIZE
CMP first_player_X,AX
JNL CHECK_FOR_COLLISION_p1_b2 ;No collision will happen
;first_player_Y+players_HEIGHT<Y_barrier1
MOV AX,First_PLAYER_Y
ADD AX,PLAYERS_HEIGHT
CMP AX,Y_BARRIER1
JNG CHECK_FOR_COLLISION_p1_b2 ;No collision will happen
;first_player_Y>Y_barrier1+ BARRIER_VERTICAL_SIZE
MOV AX,Y_BARRIER1
ADD AX, BARRIER_VERTICAL_SIZE
CMP first_player_Y,AX
JNL CHECK_FOR_COLLISION_p1_b2 ;No collision will happen
;There is collision , set his state to collided and check if he has immunity to collision before decreasing health
mov First_Is_Collided,1
;check if he has immunity to collision
cmp first_player_health_immunity , 0
JZ Decrease_first_health_1
JNZ Donot_Decrease_first_health_1
Decrease_first_health_1:
DEC first_player_health
;give him immunity to not be affected by any barriers for this player
MOV first_player_health_immunity,25
CALL draw_h1
Donot_Decrease_first_health_1:
DEC first_player_health_immunity
CHECK_FOR_COLLISION_p1_b2:
;first_player_x+players_width<x_barrier2
MOV AX,first_player_X
ADD AX,PLAYERS_WIDTH
CMP AX,X_BARRIER2
JNG EXIT_PLAYERS_barriers_col ;No collision will happen
;first_player_x>x_barrier2+ BARRIER_HORIZONTAL_SIZE
MOV AX,X_BARRIER2
ADD AX, BARRIER_HORIZONTAL_SIZE
CMP first_player_X,AX
JNL EXIT_PLAYERS_barriers_col ;No collision will happen
;first_player_Y+players_HEIGHT<Y_barrier2
MOV AX,First_PLAYER_Y
ADD AX,PLAYERS_HEIGHT
CMP AX,Y_BARRIER2
JNG EXIT_PLAYERS_barriers_col ;No collision will happen
;first_player_Y>Y_barrier2+ BARRIER_VERTICAL_SIZE
MOV AX,Y_BARRIER2
ADD AX, BARRIER_VERTICAL_SIZE
CMP first_player_Y,AX
JNL EXIT_PLAYERS_barriers_col ;No collision will happen
;There is collision , set his state to collided and check if he has immunity to collision before decreasing health
mov First_Is_Collided,1
;check if he has immunity to collision
cmp first_player_health_immunity , 0
JZ Decrease_first_health_2
JNZ Donot_Decrease_first_health_2
Decrease_first_health_2:
DEC first_player_health
;give him immunity to not be affected by any barriers for this player
MOV first_player_health_immunity,25
CALL draw_h1
Donot_Decrease_first_health_2:
DEC first_player_health_immunity
EXIT_PLAYERS_barriers_col:
RET
first_player_barriers_coli ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
second_player_barriers_coli PROC FAR
;;check for collision between player2 and barriers(1,2)
CHECK_FOR_COLLISION_p2_b1:
mov Second_Is_Collided,0
;second_player_x+players_width<x_barrier1
MOV AX,second_player_X
ADD AX,PLAYERS_WIDTH
CMP AX,X_BARRIER1
JNG CHECK_FOR_COLLISION_p2_b2 ;No collision will happen
;second_player_x>x_barrier1+ BARRIER_HORIZONTAL_SIZE
MOV AX,X_BARRIER1
ADD AX, BARRIER_HORIZONTAL_SIZE
CMP second_player_X,AX
JNL CHECK_FOR_COLLISION_p2_b2 ;No collision will happen
;second_player_Y+players_HEIGHT<Y_barrier1
MOV AX,second_PLAYER_Y
ADD AX,PLAYERS_HEIGHT
CMP AX,Y_BARRIER1
JNG CHECK_FOR_COLLISION_p2_b2 ;No collision will happen
;second_player_Y>Y_barrier1+ BARRIER_VERTICAL_SIZE
MOV AX,Y_BARRIER1
ADD AX, BARRIER_VERTICAL_SIZE
CMP second_player_Y,AX
JNL CHECK_FOR_COLLISION_p2_b2 ;No collision will happen
;There is collision , set his state to collided and check if he has immunity to collision before decreasing health
mov Second_Is_Collided,1
;check if he has immunity to collision
cmp second_player_health_immunity , 0
JZ Decrease_second_health_1
JNZ Donot_Decrease_second_health_1
Decrease_second_health_1:
DEC second_player_health
;give him immunity to not be affected by any barriers for this player
MOV second_player_health_immunity,25
CALL draw_h2
Donot_Decrease_second_health_1:
DEC second_player_health_immunity
CHECK_FOR_COLLISION_p2_b2:
;second_player_x+players_width<x_barrier2
MOV AX,second_player_X
ADD AX,PLAYERS_WIDTH
CMP AX,X_BARRIER2
JNG EXIT2_PLAYERS_barriers_col ;No collision will happen
;second_player_x>x_barrier1+ BARRIER_HORIZONTAL_SIZE
MOV AX,X_BARRIER2
ADD AX, BARRIER_HORIZONTAL_SIZE
CMP second_player_X,AX
JNL EXIT2_PLAYERS_barriers_col ;No collision will happen
;second_player_Y+players_HEIGHT<Y_barrier1
MOV AX,second_PLAYER_Y
ADD AX,PLAYERS_HEIGHT
CMP AX,Y_BARRIER2
JNG EXIT2_PLAYERS_barriers_col ;No collision will happen
;second_player_Y>Y_barrier1+ BARRIER_VERTICAL_SIZE
MOV AX,Y_BARRIER2
ADD AX, BARRIER_VERTICAL_SIZE
CMP second_player_Y,AX
JNL EXIT2_PLAYERS_barriers_col ;No collision will happen
;There is collision , set his state to collided and check if he has immunity to collision before decreasing health
mov Second_Is_Collided,1
;check if he has immunity to collision
cmp second_player_health_immunity , 0
JZ Decrease_second_health_2
JNZ Donot_Decrease_second_health_2
Decrease_second_health_2:
DEC second_player_health
;give him immunity to not be affected by any barriers for this player
MOV second_player_health_immunity,25
CALL draw_h2
Donot_Decrease_second_health_2:
DEC second_player_health_immunity
EXIT2_PLAYERS_barriers_col:
RET
second_player_barriers_coli ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
CHECK_BOUNDARY_BARRIER1 PROC FAR
MOV AX,X_BARRIER1
CMP AX,SCREEN_MAX_X
JE DONT_DRAW ;-> IF X==THE LAST ROW OF PIXELS THEN DONT DRAW
MOV BX,SCREEN_MAX_X- BARRIER_HORIZONTAL_SIZE
CMP BX,AX ;IF(BX>=AX) THEN NOTHING,,,,, ELSE -> THE BARRIER LENGTH WILL BE OUT OF THE SCREEN AND HAVE TO BE SHORTENED
JAE GOOD_LENGTH
MOV LENMAX,SCREEN_MAX_X
GOOD_LENGTH:
MOV AX,Y_BARRIER1
CMP AX,SCREEN_MAX_Y
JE DONT_DRAW ;; IF Y== LAST COLUMN OF PIXELS THEN DONT DRAW
MOV BX,SCREEN_MAX_Y- BARRIER_VERTICAL_SIZE
CMP BX,AX ;IF(BX>=AX) THEN NOTHING,,,,, ELSE -> THE BARRIER WIDTH WILL BE OUT OF THE SCREEN AND HAVE TO BE SHORTENED
JAE GOOD_WIDTH
MOV WIDMAX,SCREEN_MAX_Y
GOOD_WIDTH:
CALL FILLRECTANGLE
DONT_DRAW:
RET
CHECK_BOUNDARY_BARRIER1 ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
CHECK_BOUNDARY_BARRIER2 PROC FAR
MOV AX,X_BARRIER2
CMP AX,SCREEN_MAX_X
JE DONT_DRAW2 ;-> IF X==THE LAST ROW OF PIXELS THEN DONT DRAW
MOV BX,SCREEN_MAX_X- BARRIER_HORIZONTAL_SIZE
;IF(BX>=AX) THEN NOTHING,,,,, ELSE -> THE BARRIER LENGTH WILL BE OUT OF THE SCREEN AND HAVE TO BE SHORTENED
CMP BX,AX
JAE GOOD_LENGTH2
MOV LENMAX,SCREEN_MAX_X
GOOD_LENGTH2:
MOV AX,Y_BARRIER2
CMP AX,SCREEN_MAX_Y
JE DONT_DRAW2 ;; IF Y== LAST COLUMN OF PIXELS THEN DONT DRAW
MOV BX,SCREEN_MAX_Y- BARRIER_VERTICAL_SIZE
CMP BX,AX ;IF(BX>=AX) THEN NOTHING,,,,, ELSE -> THE BARRIER WIDTH WILL BE OUT OF THE SCREEN AND HAVE TO BE SHORTENED
JAE GOOD_WIDTH2
MOV WIDMAX,SCREEN_MAX_Y
GOOD_WIDTH2:
CALL FILLRECTANGLE
DONT_DRAW2:
RET
CHECK_BOUNDARY_BARRIER2 ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
CHECK_OVERLAPPING_BARRIER2 PROC FAR
MOV AX,X_BARRIER2
CMP AX,X_BARRIER1
JGE CHECK_LESS_X1 ; if x2>= x1 then go check if x2 is less than x1+its length
JMP END_CHECK_OVERLAPPING_BARRIER2
CHECK_LESS_X1:
MOV AX,X_BARRIER1
ADD AX, BARRIER_HORIZONTAL_SIZE
MOV BX,X_BARRIER2
CMP BX,AX
JLE X2_OVERLAPS ;this means it overlaps
JMP END_CHECK_OVERLAPPING_BARRIER2
X2_OVERLAPS: ;if barrier 2 overlaps with barrier 1,make barrier2 start at the end of barrier1
MOV AX,X_BARRIER1
ADD AX, BARRIER_HORIZONTAL_SIZE
MOV X_BARRIER2,AX
END_CHECK_OVERLAPPING_BARRIER2:
RET
CHECK_OVERLAPPING_BARRIER2 ENDP
ERASE_RECTANGLE proc FAR
;MOV DI,0
PUSH LEN
ERASE:
PUSH LEN
ERASEINNER:
MOV AH,0CH
MOV AL,background_color
INC DI
MOV BH,0H
MOV CX,LEN
MOV DX,WID
INT 10H
MOV BX,LENMAX
INC LEN
CMP BX,LEN
JNZ ERASEINNER
POP LEN
INC WID
MOV BX,WIDMAX
CMP BX,WID
JNZ ERASE
POP WID
RET
ERASE_RECTANGLE ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;MOVING BARRIER 1,2 for level_1
;MOVING BARRIER 1,2
MOVE_BARRIERS PROC FAR
;; DELETE THE OLD BARRIER1 BEFORE DRAWING IT IN THE NEW POSITION
MOV AX,X_BARRIER1
MOV LEN,AX
ADD AX,BARRIER_HORIZONTAL_SIZE
MOV LENMAX,AX
MOV AX,Y_BARRIER1
MOV WID,AX
ADD AX,BARRIER_VERTICAL_SIZE
MOV WIDMAX,AX
CALL ERASE_RECTANGLE
;; DELETE THE OLD BARRIER1 BEFORE DRAWING IT IN THE NEW POSITION
MOV AX,X_BARRIER2
MOV LEN,AX
ADD AX,BARRIER_HORIZONTAL_SIZE
MOV LENMAX,AX
MOV AX,Y_BARRIER2
MOV WID,AX
ADD AX,BARRIER_VERTICAL_SIZE
MOV WIDMAX,AX
CALL ERASE_RECTANGLE
MOV AX,x_barrier1
MOV PRE_POSITION_X,AX
MOV AX,Y_barrier1
MOV PRE_POSITION_Y,AX
MOV AX,x_barrier2
MOV PRE_POSITION_X2,AX
MOV AX,Y_barrier2
MOV PRE_POSITION_Y2,AX
CHECK_BARRIER1_TOP: ;check if barrier1 reach top of page(before reaching health bar)
CMP Y_BARRIER1 ,24
JLE BARRIER_1_REACHED_TOP
JG BARRIERS_1_DIDNT_REACH_TOP
BARRIER_1_REACHED_TOP: ;If reached top of page return it to the bottom
Mov Y_BARRIER1,Initial_Y_Barrier1
;Change the X-position of the Barrier
check_x1:
CMP X_BARRIER1,260;10<=x_barrier_1<= 260
JGE X1_REACH_MAX
JL X1_DONT_REACH_MAX
X1_REACH_MAX:
SUB X_BARRIER1,200
JMP CHECK_BARRIER2_TOP
X1_DONT_REACH_MAX:
ADD X_BARRIER1,50 ;;10-->60-->120.....--->260
JMP CHECK_BARRIER2_TOP
BARRIERS_1_DIDNT_REACH_TOP: ;moving barriers up
SUB Y_Barrier1,1 ;5 steps by which the barriers are moving
CHECK_BARRIER2_TOP: ;check if barrier2 reach top of page(before reaching health bar)
CMP Y_BARRIER2 ,24
JLE BARRIER_2_REACHED_TOP
JG BARRIERS_2_DIDNT_REACH_TOP
BARRIER_2_REACHED_TOP:
Mov Y_BARRIER2,Initial_Y_Barrier2
;Randomize the X-position of the Barrier
check_x2:
CMP X_BARRIER2,10;10<=x_barrier_1<= 260
JLE X2_REACH_MAX
JG X2_DONT_REACH_MAX
X2_REACH_MAX:
ADD X_BARRIER2,200
JMP X_TEMP_LABEL1
X2_DONT_REACH_MAX:
SUB X_BARRIER2,50 ;;260-->210-->...-->10
JMP X_TEMP_LABEL1
BARRIERS_2_DIDNT_REACH_TOP: ;moving barriers up
SUB Y_Barrier2,2 ;5 steps by which the barriers are moving
X_TEMP_LABEL1:
CALL first_player_barriers_coli
CALL second_player_barriers_coli
CALL draw_p1
CALL draw_p2
CALL DRAW_BARRIER1
CALL DRAW_BARRIER2
RET
MOVE_BARRIERS ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;MOVING BARRIER 1,2 for level_2
MOVE_BARRIERS_2 PROC FAR
;; DELETE THE OLD BARRIER1 BEFORE DRAWING IT IN THE NEW POSITION
MOV AX,X_BARRIER1
MOV LEN,AX
ADD AX,BARRIER_HORIZONTAL_SIZE
MOV LENMAX,AX
MOV AX,Y_BARRIER1
MOV WID,AX
ADD AX,BARRIER_VERTICAL_SIZE
MOV WIDMAX,AX
CALL ERASE_RECTANGLE
;; DELETE THE OLD BARRIER1 BEFORE DRAWING IT IN THE NEW POSITION
MOV AX,X_BARRIER2
MOV LEN,AX
ADD AX,BARRIER_HORIZONTAL_SIZE
MOV LENMAX,AX
MOV AX,Y_BARRIER2
MOV WID,AX
ADD AX,BARRIER_VERTICAL_SIZE
MOV WIDMAX,AX
CALL ERASE_RECTANGLE
MOV AX,x_barrier1
MOV PRE_POSITION_X,AX
MOV AX,Y_barrier1
MOV PRE_POSITION_Y,AX
MOV AX,x_barrier2
MOV PRE_POSITION_X2,AX
MOV AX,Y_barrier2
MOV PRE_POSITION_Y2,AX
CHECK_BARRIER1_TOP_2: ;check if barrier1 reach top of page(before reaching health bar)
CMP Y_BARRIER1 ,24
JLE BARRIER_1_REACHED_TOP_2
JG BARRIERS_1_DIDNT_REACH_TOP_2
BARRIER_1_REACHED_TOP_2: ;If reached top of page return it to the bottom
Mov Y_BARRIER1,Initial_Y_Barrier1
;Change the X-position of the Barrier
BARRIERS_1_DIDNT_REACH_TOP_2: ;moving barriers up
SUB Y_Barrier1,1 ;5 steps by which the barriers are moving
check_x1_2:
CMP X_BARRIER1,260;10<=x_barrier_1<= 260
JGE X1_REACH_MAX_2
JL X1_DONT_REACH_MAX_2
X1_REACH_MAX_2:
SUB X_BARRIER1,200
JMP CHECK_BARRIER2_TOP_2
X1_DONT_REACH_MAX_2:
ADD X_BARRIER1,2 ;;10-->60-->120.....--->260
JMP CHECK_BARRIER2_TOP_2
CHECK_BARRIER2_TOP_2: ;check if barrier2 reach top of page(before reaching health bar)
CMP Y_BARRIER2 ,24
JLE BARRIER_2_REACHED_TOP_2
JG BARRIERS_2_DIDNT_REACH_TOP_2
BARRIER_2_REACHED_TOP_2:
Mov Y_BARRIER2,Initial_Y_Barrier2
;Randomize the X-position of the Barrier
BARRIERS_2_DIDNT_REACH_TOP_2: ;moving barriers up
SUB Y_Barrier2,2 ;5 steps by which the barriers are moving
check_x2_2:
CMP X_BARRIER2,10;10<=x_barrier_1<= 260
JLE X2_REACH_MAX_2
JG X2_DONT_REACH_MAX_2
X2_REACH_MAX_2:
ADD X_BARRIER2,200
JMP X_TEMP_LABEL_2
X2_DONT_REACH_MAX_2:
SUB X_BARRIER2,1 ;;260-->210-->...-->10
JMP X_TEMP_LABEL_2
X_TEMP_LABEL_2:
CALL first_player_barriers_coli
CALL second_player_barriers_coli
CALL draw_p1
CALL draw_p2
CALL DRAW_BARRIER1
CALL DRAW_BARRIER2
RET
MOVE_BARRIERS_2 ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to draw the Red Laser from Left to Right (Just a colored line from start to end)
Draw_RED_LASER_LEFT_TO_RIGHT PROC FAR
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov cx,Red_Laser_Start_X
mov dx,first_player_Y
add dx,Player_Shooter_Y_Offset
Continue_Red_LASER_1:
mov al,RED
Int 10h
INC dx
mov al, Yellow
INT 10h
INC dx
mov al, Yellow
INT 10h
INC dx
mov al, Red
INT 10h
cmp cx,Red_Laser_End_X
jz END_Draw_Red_Laser_1
inc cx
Sub dx,3
jmp Continue_Red_LASER_1
End_Draw_Red_Laser_1:
mov cx,0ffffh
wait1:
DEC CX
CMP CX,0
JNE wait1
mov cx,Red_Laser_Start_X
mov dx,first_player_Y
add dx,Player_Shooter_Y_Offset
Clear_Red_Laser_1:
mov al,background_color
Int 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
cmp cx,Red_Laser_End_X
jz END_Red_Laser_1
inc cx
Sub dx,3
jmp Clear_Red_LASER_1
END_Red_Laser_1:
RET
Draw_RED_LASER_LEFT_TO_RIGHT ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to draw the Red Laser from Right to Left (Just a colored line from start to end)
Draw_RED_LASER_RIGHT_TO_LEFT PROC
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov cx,Red_Laser_Start_X
mov dx,first_player_Y
add dx,Player_Shooter_Y_Offset
Continue_Red_LASER_2:
mov al,RED
Int 10h
INC dx
mov al, Yellow
INT 10h
INC dx
mov al, Yellow
INT 10h
INC dx
mov al, Red
INT 10h
cmp cx,Red_Laser_End_X
jz END_Draw_Red_Laser_2
dec cx
Sub dx,3
jmp Continue_Red_LASER_2
END_Draw_Red_Laser_2:
mov cx,0ffffh
wait2:
DEC CX
CMP CX,0
JNE wait2
mov cx,Red_Laser_Start_X
mov dx,first_player_Y
add dx,Player_Shooter_Y_Offset
Clear_Red_LASER_2:
mov al,background_color
Int 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
cmp cx,Red_Laser_End_X
jz END_Red_Laser_2
dec cx
Sub dx,3
jmp Clear_Red_LASER_2
END_Red_Laser_2:
RET
Draw_RED_LASER_RIGHT_TO_LEFT ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to draw the Blue Laser from Left to Right (Just a colored line from start to end)
Draw_BLUE_LASER_LEFT_TO_RIGHT PROC
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov cx,Blue_Laser_Start_X
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset
Continue_Blue_LASER_1:
mov al,Dark_Blue
Int 10h
INC dx
mov al, Light_Blue
INT 10h
INC dx
mov al, Light_Blue
INT 10h
INC dx
mov al, Dark_Blue
INT 10h
cmp cx,Blue_Laser_End_X
jz END_Draw_Blue_Laser_1
inc cx
Sub dx,3
jmp Continue_Blue_LASER_1
END_Draw_Blue_Laser_1:
mov cx,0ffffh
wait3:
DEC CX
CMP CX,0
JNE wait3
mov cx,Blue_Laser_Start_X
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset
Clear_Blue_LASER_1:
mov al,background_color
Int 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
cmp cx,Blue_Laser_End_X
jz END_Blue_Laser_1
inc cx
Sub dx,3
jmp Clear_Blue_LASER_1
END_Blue_Laser_1:
RET
Draw_BLUE_LASER_LEFT_TO_RIGHT ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to draw the Blue Laser from Right to Left (Just a colored line from start to end)
Draw_BLUE_LASER_RIGHT_TO_LEFT PROC
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov cx,Blue_Laser_Start_X
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset
Continue_Blue_LASER_2:
mov al,Dark_Blue
Int 10h
INC dx
mov al, Light_Blue
INT 10h
INC dx
mov al, Light_Blue
INT 10h
INC dx
mov al, Dark_Blue
INT 10h
cmp cx,Blue_Laser_End_X
jz END_Draw_Blue_Laser_2
dec cx
Sub dx,3
jmp Continue_Blue_LASER_2
End_Draw_Blue_Laser_2:
mov cx,0ffffh
wait4:
DEC CX
CMP CX,0
JNE wait4
mov cx,Blue_Laser_Start_X
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset
Clear_Blue_LASER_2:
mov al,background_color
Int 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
INC dx
mov al, background_color
INT 10h
cmp cx,Blue_Laser_End_X
jz END_Blue_Laser_2
dec cx
Sub dx,3
jmp Clear_Blue_LASER_2
END_Blue_Laser_2:
RET
Draw_BLUE_LASER_RIGHT_TO_LEFT ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to make the first Player attack from Left to Right
First_Attack_Left_TO_Right PROC FAR
;First we set the coordinates for the drawing
mov ax,first_player_X
Add ax,PLAYERS_WIDTH
mov Red_Laser_Start_X,Ax
;git the first thing that will hit the laser
mov bx,WINDOW_WIDTH ;BX will contain the end of the laser for the rest of the function
sub bx,2
;check the barriers, first ask if it is in the same Y Area, then ask for the X area
; *---------------------------- |
; ------------* | Barrier At Right | |
; |At left: | | | | The window wall
; | Beam | | | |
; ------------* | | |
; *----------------------------- |
Red_Laser1_Colli_First_Barrier:
mov dx,First_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the Red Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier1
JL Red_Laser1_Colli_Second_Barrier ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the Red Laser Start Y
mov cx,Y_barrier1
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Red_Laser1_Colli_Second_Barrier ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Red_Laser_Start_X
cmp ax,X_BARRIER1 ;Check the Barrier Position relative to the Player
JGE Red_Laser1_Colli_Second_Barrier ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER1 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
cmp ax,bx
JG Red_Laser1_Colli_Second_Barrier ;if this new AX(X_Barrier) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the second barrier
Red_Laser1_Colli_Second_Barrier:
mov dx,First_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the Red Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier2
JL Red_Laser1_Colli_Second_Player ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the Red Laser Start Y
mov cx,Y_barrier2
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Red_Laser1_Colli_Second_Player ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Red_Laser_Start_X
cmp ax,X_BARRIER2 ;Check the Barrier Position relative to the Player
JGE Red_Laser1_Colli_Second_Player ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER2 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
cmp ax,bx
JG Red_Laser1_Colli_Second_Player ;if this new AX(X_Barrier) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the blue player
Red_Laser1_Colli_Second_Player:
mov dx,First_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the Red Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Second_player_Y
JL Finish_First_Attack_Left_TO_Right ;all the Y of the laser < starting Y of the Second Player--> No collision
sub dx,LASER_SIZE ;now the dx has the Red Laser Start Y
mov cx,Second_player_Y
add cx,PLAYERS_HEIGHT ;now cx has the last Y of the Player
cmp dx,cx
JG Finish_First_Attack_Left_TO_Right ;all the Y of the laser > ending Y of the Player--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Red_Laser_Start_X
cmp ax,second_player_X ;Check the Second Player Position relative to the Player
JGE Finish_First_Attack_Left_TO_Right ;The Second Player is Behind the player (if player is collided with the barrier we won't fire )
mov ax,Second_player_X ;when reached here, it means that the Second Player Will block my way. But is it the first thing to block ?
cmp ax,bx
JG Finish_First_Attack_Left_TO_Right ;if this new AX(second_player_X) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
mov second_player_Freeze,25 ;make the second player freeze
Finish_First_Attack_Left_TO_Right:
mov Red_Laser_End_X,bx
Call Draw_RED_LASER_LEFT_TO_RIGHT
RET
First_Attack_Left_TO_Right ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to make the first Player attack from Left to Right
First_Attack_Right_TO_Left PROC FAR
;First we set the coordinates for the drawing
mov ax,first_player_X
mov Red_Laser_Start_X,Ax
;git the first thing that will hit the laser
mov bx,2 ;BX will contain the end of the laser for the rest of the function
;check the barriers, first ask if it is in the same Y Area, then ask for the X area
; | ----------------------------*
;The | | Barrier At Left | *------------
;Window | | | |At Right: |
;Wall | | | | Beam |
; | | | *------------
; | -----------------------------*
Red_Laser2_Colli_First_Barrier:
mov dx,First_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the Red Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier1
JL Red_Laser2_Colli_Second_Barrier ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the Red Laser Start Y
mov cx,Y_barrier1
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Red_Laser2_Colli_Second_Barrier ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Red_Laser_Start_X
mov dx,X_Barrier1
Add dx,BARRIER_HORIZONTAL_SIZE ;now dx has the right most X_Position of the Barrier
cmp ax,DX ;Check the Barrier Position relative to the Player
JLE Red_Laser2_Colli_Second_Barrier ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER1 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
ADD ax,BARRIER_HORIZONTAL_SIZE
cmp ax,bx
JL Red_Laser2_Colli_Second_Barrier ;if this new AX(X_Barrier) < BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the second barrier
Red_Laser2_Colli_Second_Barrier:
mov dx,First_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the Red Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier2
JL Red_Laser2_Colli_Second_Player ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the Red Laser Start Y
mov cx,Y_barrier2
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Red_Laser2_Colli_Second_Player ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Red_Laser_Start_X
mov dx,X_BARRIER2
Add dx,BARRIER_HORIZONTAL_SIZE ;now dx has the right most X_Position of the Barrier
cmp ax,DX ;Check the Barrier Position relative to the Player
JLE Red_Laser2_Colli_Second_Player ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER2 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
ADD ax,BARRIER_HORIZONTAL_SIZE
cmp ax,bx
JL Red_Laser2_Colli_Second_Player ;if this new AX(X_Barrier) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the blue player
Red_Laser2_Colli_Second_Player:
mov dx,First_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the Red Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Second_player_Y
JL Finish_First_Attack_Right_TO_Left ;all the Y of the laser < starting Y of the Second Player--> No collision
sub dx,LASER_SIZE ;now the dx has the Red Laser Start Y
mov cx,Second_player_Y
add cx,PLAYERS_HEIGHT ;now cx has the last Y of the Player
cmp dx,cx
JG Finish_First_Attack_Right_TO_Left ;all the Y of the laser > ending Y of the Player--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Red_Laser_Start_X
mov dx,second_player_X
ADD dx,PLAYERS_WIDTH
cmp ax,DX ;Check the Second Player Position relative to the Player
JLE Finish_First_Attack_Right_TO_Left ;The Second Player is Behind the player (if player is collided with the barrier we won't fire )
mov ax,Second_player_X ;when reached here, it means that the Second Player Will block my way. But is it the first thing to block ?
add ax,PLAYERS_WIDTH
cmp ax,bx
JL Finish_First_Attack_Right_TO_Left ;if this new AX(second_player_X) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
mov second_player_Freeze,25 ;make the second player freeze
Finish_First_Attack_Right_TO_Left:
mov Red_Laser_End_X,bx
Call Draw_RED_LASER_Right_TO_Left
RET
First_Attack_Right_TO_Left ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to make the Second Player attack from Left to Right
Second_Attack_Left_TO_Right PROC FAR
;First we set the coordinates for the drawing
mov ax,Second_player_X
Add ax,PLAYERS_WIDTH
mov Blue_Laser_Start_X,Ax
;git the first thing that will hit the laser
mov bx,WINDOW_WIDTH ;BX will contain the end of the laser for the rest of the function
sub bx,2
;check the barriers, first ask if it is in the same Y Area, then ask for the X area
; *---------------------------- |
; ------------* | Barrier At Right | |
; |At left: | | | | The window wall
; | Beam | | | |
; ------------* | | |
; *----------------------------- |
Blue_Laser1_Colli_First_Barrier:
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the BLUE Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier1
JL Blue_Laser1_Colli_Second_Barrier ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the BLUE Laser Start Y
mov cx,Y_barrier1
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Blue_Laser1_Colli_Second_Barrier ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Blue_Laser_Start_X
cmp ax,X_BARRIER1 ;Check the Barrier Position relative to the Player
JGE Blue_Laser1_Colli_Second_Barrier ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER1 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
cmp ax,bx
JG Blue_Laser1_Colli_Second_Barrier ;if this new AX(X_Barrier) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the second barrier
Blue_Laser1_Colli_Second_Barrier:
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the BLUE Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier2
JL Blue_Laser1_Colli_first_Player ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the BLUE Laser Start Y
mov cx,Y_barrier2
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Blue_Laser1_Colli_first_Player ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Blue_Laser_Start_X
cmp ax,X_BARRIER2 ;Check the Barrier Position relative to the Player
JGE Blue_Laser1_Colli_First_Player ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER2 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
cmp ax,bx
JG Blue_Laser1_Colli_First_Player ;if this new AX(X_Barrier) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the BLUE player
Blue_Laser1_Colli_First_Player:
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the BLUE Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,First_player_Y
JL Finish_Second_Attack_Left_TO_Right ;all the Y of the laser < starting Y of the Second Player--> No collision
sub dx,LASER_SIZE ;now the dx has the BLUE Laser Start Y
mov cx,first_player_Y
add cx,PLAYERS_HEIGHT ;now cx has the last Y of the Player
cmp dx,cx
JG Finish_Second_Attack_Left_TO_Right ;all the Y of the laser > ending Y of the Player--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Blue_Laser_Start_X
cmp ax,First_player_X ;Check the Second Player Position relative to the Player
JGE Finish_Second_Attack_Left_TO_Right ;The Second Player is Behind the player (if player is collided with the barrier we won't fire )
mov ax,first_player_X ;when reached here, it means that the Second Player Will block my way. But is it the first thing to block ?
cmp ax,bx
JG Finish_Second_Attack_Left_TO_Right ;if this new AX(second_player_X) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
mov First_player_Freeze,25 ;make the first player freeze
Finish_Second_Attack_Left_TO_Right:
mov Blue_Laser_End_X,bx
Call Draw_Blue_LASER_LEFT_TO_RIGHT
RET
Second_Attack_Left_TO_Right ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;This function is to make the Second Player attack from Left to Right
Second_Attack_Right_TO_Left PROC FAR
;First we set the coordinates for the drawing
mov ax,Second_player_X
mov Blue_Laser_Start_X,Ax
;git the first thing that will hit the laser
mov bx,2 ;BX will contain the end of the laser for the rest of the function
;check the barriers, first ask if it is in the same Y Area, then ask for the X area
; | ----------------------------*
;The | | Barrier At Left | *------------
;Window | | | |At Right: |
;Wall | | | | Beam |
; | | | *------------
; | -----------------------------*
Blue_Laser2_Colli_First_Barrier:
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the BLUE Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier1
JL Blue_Laser2_Colli_Second_Barrier ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the BLUE Laser Start Y
mov cx,Y_barrier1
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Blue_Laser2_Colli_Second_Barrier ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Blue_Laser_Start_X
mov dx,X_Barrier1
Add dx,BARRIER_HORIZONTAL_SIZE ;now dx has the right most X_Position of the Barrier
cmp ax,DX ;Check the Barrier Position relative to the Player
JLE Blue_Laser2_Colli_Second_Barrier ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER1 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
ADD ax,BARRIER_HORIZONTAL_SIZE
cmp ax,bx
JL Blue_Laser2_Colli_Second_Barrier ;if this new AX(X_Barrier) < BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the second barrier
Blue_Laser2_Colli_Second_Barrier:
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the BLUE Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,Y_barrier2
JL Blue_Laser2_Colli_First_Player ;all the Y of the laser < starting Y of the Barrier--> No collision
sub dx,LASER_SIZE ;now the dx has the BLUE Laser Start Y
mov cx,Y_barrier2
add cx,BARRIER_VERTICAL_SIZE ;now cx has the last Y of the Barrier
cmp dx,cx
JG Blue_Laser2_Colli_First_Player ;all the Y of the laser > ending Y of the Barrier--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Blue_Laser_Start_X
mov dx,X_BARRIER2
Add dx,BARRIER_HORIZONTAL_SIZE ;now dx has the right most X_Position of the Barrier
cmp ax,DX ;Check the Barrier Position relative to the Player
JLE Blue_Laser2_Colli_First_Player ;The Barrier is Behind the player (if player is collided with the barrier we won't fire )
mov ax,X_BARRIER2 ;when reached here, it means that the Barrier Will block my way. But is it the first thing to block ?
ADD ax,BARRIER_HORIZONTAL_SIZE
cmp ax,bx
JL Blue_Laser2_Colli_First_Player ;if this new AX(X_Barrier) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
;check the BLUE player
Blue_Laser2_Colli_First_Player:
mov dx,Second_player_Y
add dx,Player_Shooter_Y_Offset ;now the dx has the BLUE Laser Start Y
add dx,LASER_SIZE ;dx --->the laser ending Y
cmp dx,First_player_Y
JL Finish_Second_Attack_Right_TO_Left ;all the Y of the laser < starting Y of the Second Player--> No collision
sub dx,LASER_SIZE ;now the dx has the BLUE Laser Start Y
mov cx,First_player_Y
add cx,PLAYERS_HEIGHT ;now cx has the last Y of the Player
cmp dx,cx
JG Finish_Second_Attack_Right_TO_Left ;all the Y of the laser > ending Y of the Player--> No collision
;;;;If it reached here then, there will be a collision in the Y,check for X
mov ax, Blue_Laser_Start_X
mov dx,First_player_X
ADD dx,PLAYERS_WIDTH
cmp ax,DX ;Check the Second Player Position relative to the Player
JLE Finish_Second_Attack_Right_TO_Left ;The Second Player is Behind the player (if player is collided with the barrier we won't fire )
mov ax,First_player_X ;when reached here, it means that the Second Player Will block my way. But is it the first thing to block ?
add ax,PLAYERS_WIDTH
cmp ax,bx
JL Finish_Second_Attack_Right_TO_Left ;if this new AX(second_player_X) > BX ---> Then it's not the first thing to Block my way
mov bx,ax
mov first_player_Freeze,25 ;make the first player freeze
Finish_Second_Attack_Right_TO_Left:
mov Blue_Laser_End_X,bx
Call Draw_Blue_LASER_Right_TO_Left
RET
Second_Attack_Right_TO_Left ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;description
Game_over_screen PROC
mov ah,0ch ;this means with int 10h ---> you're drawing a pixel
mov di,0
mov al,img[DI] ;the pixel color
mov bh,0 ;the page number
mov cx,x_position ;the starting x-position (column)
add cx,imgW ;as we draw in the reversed order
mov dx,y_position ;the starting y-position (row)
add dx,imgH ;as we draw in the reversed order
;here we loop for the image size (player_size)
fill_over:
cmp al,16
jz pass_the_pixel_over
int 10h
pass_the_pixel_over:
inc di
mov al,img[DI]
dec cx
cmp cx,x_position
jnz fill_over ;if not zero so we continue to the same row
mov cx,x_position ;the starting x-position (column)
add cx,imgw ;as we draw in the reversed order
dec dx ;if not zero so we continue to draw the background
cmp dx,y_position
jnz fill_over
ret
Game_over_screen ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;This function is to take Players name Before entering the game
Take_User_Data PROC FAR
Start:
CALL FAR PTR CLEAR_SCREEN ;clear the screen before taking the names
mov ah,0
mov al,02
int 10h ;this to choose text mode
mov ah,2
mov dx,0a0ah
int 10h ;Position the Cursor
;PRINT_Messages Name_Message_1
Add DH,2
INT 10H
PRINT_Messages Name_Message_1 ;This MACRO will print a message to ask players to enter their names
Add DH,2
INT 10H ;Position the Cursor below it by two rows
Take_First_name: ;Start taking the first name untill it reaches the maximum/or the player presses enter
mov AH,0AH
mov dx,offset First_Player_Name
int 21h
CMP First_Player_Name[2],65
JGE GREATER_Than_65
JL Wrong_start
GREATER_Than_65:
CMP First_Player_Name[2],90
JLE Between_65_90_or_97_122
JG Greater_than_90
Greater_than_90:
CMP First_Player_Name[2],97
JGE GREATER_Than_97
JL Wrong_start
GREATER_Than_97:
CMP First_Player_Name[2],122
JLE Between_65_90_or_97_122
JG Wrong_start
Wrong_start:
mov ah,2
mov dx,1620h
int 10h ;Position the Cursor
PRINT_Messages Invalid_Start_msg2
;;;;;delay;;;;;;
mov cx, 25h ;HIGH WORD.
mov dx, 2420h ;LOW WORD.
mov ah, 86h ;WAIT.
int 15h
Jmp Start
Between_65_90_or_97_122:
MOV AH,2 ;MOVE CURSOR TO PRINT WAITING MESSAGE
MOV DX,140fH
int 10h
mov ah,9
mov dx,offset WAITING_MESSAGE
int 21h
mov di,offset First_Player_Name
mov si ,offset Second_Player_Name
mov cl, First_Player_Name[1] ;actual size
;;;;;;;;;;;;;;;;;;;;;; SEND THE ACUTUAL SIZE OF PLAYER NAME
mov dx,3fdh
;wait till we are able to send
WAIT_FOR_SEND:
in al,dx
test al,00100000b
jz WAIT_FOR_SEND
;WE CAN SEND NOW
mov dx,3f8h
mov al,cl
out dx,al
;;;;;;;;;;;;; RECEIVE THE ACUTUAL SIZE OF PLAYER NAME
CHECK_size_AGAIN:
mov dx,3fdh
in al,dx
test al,1
jz CHECK_size_AGAIN ;if nothing received go to the begining
;if received
mov dx,03f8h
in al,dx
mov ch,al
add di,2
add si,2
;;;;;;;;;;;;;;;;;;;;; SEND AND RECEIVE THE PLAYER NAMES ;;;;;
START_NAME_SEND_REC:
mov dx,3fdh
;wait till we are able to send
in al,dx
test al,00100000b
jz CHECK_AGAIN_SR
cmp cl,0
je reso
;when we are able send
mov dx,3f8h
mov al,[di]
out dx,al
inc di
dec cl
reso:
mov dx,3fdh
in al,dx
test al,1
jz CHECK_AGAIN_SR ;if nothing received go to the begining
;if received
mov dx,03f8h
in al,dx
mov [si],al
inc si
dec ch
CHECK_AGAIN_SR:;check if we finished and if not go to the begining
cmp cl,0
jnz START_NAME_SEND_REC
cmp ch,0
jnz START_NAME_SEND_REC
;;;;;;;;;;;;;;;;;;;;;;;;;;; MAIN MENU ENDED -> GO TO MENUBAR ;;;;;;;;;
;; CLEAR SCREEN ;;
mov ah,0
mov al,3
int 10h
;;;;;;;SET CURSOR POSITION AND PRINT PLAY_AGAINST MESSAGE
mov ah,2
mov dx,0a0ah
int 10h
mov ah,9
mov dx,offset play_against_meg
int 21h
add dl,2
;;;;;;;SET CURSOR POSITION AND PRINT PLAYER NAME MESSAGE
mov ah,2
mov dx,0d23h
int 10h
mov ah,9
mov dx,offset Second_Player_Name+1
int 21h
;--------- DELAY FOR 5 SECOND ----------------
mov cx, 50h ;HIGH WORD.
mov dx, 4840h ;LOW WORD.
mov ah, 86h ;WAIT.
int 15h
Temp_End:
RET
Take_User_Data ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
Main_menu PROC FAR
FIRST_MENU:
mov CHAT_MASTER,0
mov GAME_MASTER,0
MOV CHAT_SLAVE,0
MOV CHAT_SLAVE,0
mov ah,00
mov al,02
int 10h
mov ah,2
mov dx,0a13h
int 10h
PRINT_Messages CHAT
ADD DH,2
INT 10h
PRINT_Messages Sky_GAME
ADD DH,2
INT 10h
PRINT_Messages END_GAME_mess
;;;;;;;;;;;; DRAW LINE ;;;;;;;;;;;;;
mov ah,02
mov dx, 1600h
int 10h
MOV AH,09H
MOV AL,'-'
MOV BH,0
MOV BL,02
MOV CX ,80
INT 10H
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; CHECK FOR INVITATIONS ;;;;;;;;;;;;;
CHECK_INVITATION:
mov dx,3fdh
in al,dx
test al,1
jz CHECK_INVITAT_again
jmp if_receive
; CHECK_INVITAT_again:
; mov ah,1
; int 16h
; jz CHECK_INVITATION
if_receive:
mov dx,03f8h
in al,dx
cmp AL,3BH ;CHECK IF F1 PRESSED CHAT INVENTATION
jE FAR PTR GO_CHAT_INVET_REC
CMP Al,3CH ;CHECK IF F2 PRESSED GAME INVENTATION
JE FAR PTR GO_GAME_INVENT_REC_TEMP
CMP AL,01
JE END_MAIN_MENU_REC_TEMP
CHECK_INVITAT_again:
mov ah,1
int 16h
jz CHECK_INVITATION
;;;;;;;;;;;;;;;;;; SEND INVITAION ;;;;;;;;;;;;;;;;;;
MOV AH,0
INT 16h
CMP AH,3BH ;f1
JE GO_CHAT_INVET_SEND
CMP AH,3CH ;f2
JE GO_GAME_INVENT_SEND_TEMP
CMP AH,01
JE END_MAIN_MENU_SEND_TEMP
JMP CHECK_INVITATION
;;;;;;;;;;;;;;;;;;; IF JUMP TO GO_CHAT_INVET_SEND ;;;;;;;;;;;;
GO_CHAT_INVET_SEND:
;;;;; MOVE THE CURSOR TO THE POSITION IN WHICH SENT INVETATION APPEAR
CMP CHAT_SLAVE,1
JE RECIEVE_CHAT
CALL FAR PTR CHAT_INVET_M_PROC
JMP CHECK_INVITATION
RECIEVE_CHAT:
MOV DX,3fdh
loop_until_ready_37:
in al,dx
test al,00100000b
jz loop_until_ready_37
;when we are able send
mov dx,3f8h
mov al,3BH
out dx,al
JMP chatpage
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;; IF I RECEIVE A CHAT INVITAION ;;;;;;;
GO_GAME_INVENT_SEND_TEMP:
JMP GO_GAME_INVENT_SEND
GO_GAME_INVENT_REC_TEMP:
JMP GO_GAME_INVENT_REC
Start_Game_temp:
jmp Start_Game
END_MAIN_MENU_SEND_TEMP:
JMP END_MAIN_MENU_SEND
END_MAIN_MENU_REC_TEMP:
JMP END_MAIN_MENU_REC
GO_CHAT_INVET_REC:
cmp CHAT_MASTER,1
jE ACCEPT
MOV ah,02 ;;SLAVE
mov dx, 1800h
int 10h
MOV AH,09H
MOV AL,' '
MOV BH,0
MOV BL,02
MOV CX ,80
INT 10H
MOV AH,02
MOV DX,1800H
INT 10H
PRINT_Messages Second_Player_Name+1
ADD DL,2
PRINT_Messages CHAT_INVITATION_REC_MEG
MOV CHAT_SLAVE,1
MOV GAME_SLAVE,0
jmp CHECK_INVITAT_again
ACCEPT:
; mov dx,3fdh
; loop_until_ready_2:
; in al,dx
; test al,00100000b
; jz loop_until_ready_2
; ;;;;;;;;;;; now we can send ;;;;;;;;;;;;;;;;;;
; mov dx,3f8h
; mov al,3BH
; out dx,al
jmp chatpage
;----------------------------------------------------;
GO_GAME_INVENT_SEND:
;;;;;;;; CLEAR THE LINE 23 BEFORE PRINTING THE NEXT INVITATION MSG ;;;;;;;
;;; MOVE THE CURSOR TO WRITE
cmp GAME_SLAVE,1 ;
JE receive_level
mov ah,02
mov dx, 1700h
int 10h
MOV AH,09H
MOV AL,' '
MOV BH,0
MOV BL,02
MOV CX ,80
INT 10H
MOV AH,02
MOV DX , 1700H
INT 10H
PRINT_Messages GAME_INVITATION_SEND_MSG
add dl,2
PRINT_Messages Second_Player_Name
;;;; CHECK IF REGISTER IS EMPTY ;;;
MOV DX,3fdh
loop_until_ready_3:
in al,dx
test al,00100000b
jz loop_until_ready_3
;when we are able send
mov dx,3f8h
mov al,3CH ;F2 ->GAME
out dx,al
mov GAME_MASTER,1
MOV CHAT_MASTER,0
JMP CHECK_INVITATION
receive_level:
MOV DX,3fdh
loop_until_ready_33:
in al,dx
test al,00100000b
jz loop_until_ready_33
;when we are able send
mov dx,3f8h
mov al,3CH
out dx,al
call far ptr CLEAR_SCREEN
call far ptr draw_background
CALL FAR PTR draw_p1
CALL FAR PTR draw_p2
MOV DX,3fdh
loop_until_ready_34:
in al,dx
test al,1
jz loop_until_ready_34
;when we are able send
mov dx,3f8h
in al,dx
mov level,al
jmp LETS_START_GAME
;--------------------------------------------------------;
GO_GAME_INVENT_REC:
CMP GAME_MASTER,1
JE ACCEPT_GAME
mov game_slave,1
MOV CHAT_SLAVE,0
MOV ah,02
mov dx, 1800h
int 10h
MOV AH,09H
MOV AL,' '
MOV BH,0
MOV BL,02
MOV CX ,80
INT 10H
MOV AH,02
MOV DX,1800H
INT 10H
mov ah,9
mov dx,offset Second_Player_Name+1
int 21h
mov ah,9
mov dx,offset GAME_INVITATION_REC_MSG
int 21h
jmp CHECK_INVITAT_again
ACCEPT_GAME:
; mov dx,3fdh
; loop_until_ready_25:
; in al,dx
; test al,00100000b
; jz loop_until_ready_25
; ;;;;;;;;;;; now we can send ;;;;;;;;;;;;;;;;;;
; mov dx,3f8h
; mov al,3CH
; out dx,al
JMP Which_level
ABCD:
mov dx,3fdh
loop_until_ready_5:
in al,dx
test al,00100000b
jz loop_until_ready_5
;;;;;;;;;;; now we can send ;;;;;;;;;;;;;;;;;;
mov dx,3f8h
mov al,bl
out dx,al
mov level,bl
LETS_START_GAME:
CALL FAR PTR Start_Game
jmp First_menu
;;-----------------------------------------------------------------------
END_MAIN_MENU_SEND:
mov dx,3fdh
loop_until_ready_66:
in al,dx
test al,00100000b
jz loop_until_ready_66
mov dx,3f8h
mov al,01H ;F1 ->CHAT
out dx,al
JMP END_GAME
END_MAIN_MENU_REC:
JMP END_GAME
chatpage:
CALL FAR PTR CHAT_MODULE
jmp FIRST_MENU
Which_level:
mov ah,00
mov al,02
int 10h
mov ah,2
mov dx,01113h
int 10h
PRINT_Messages levelone
ADD DH,2
INT 10h
PRINT_Messages leveltwo
mov ah,0
int 16h
cmp al,49
mov bl ,al
JE ABCD
cmp al,50
mov bl ,al
JE ABCD
JMP Which_level
End_Game :
RET
Main_menu ENDP
chose_which_level proc FAR
RET
chose_which_level ENDP
CHAT_INVET_M_PROC PROC FAR
mov ah,02
mov dx, 1700h
int 10h
MOV AH,09H
MOV AL,' '
MOV BH,0
MOV BL,02
MOV CX ,80
INT 10H
MOV AH,02
MOV DX,1700H
INT 10H
PRINT_Messages CHAT_INVITATION_SEND_MEG
ADD DL,2
PRINT_Messages Second_Player_Name+1
mov dx,3fdh
loop_until_ready:
in al,dx
test al,00100000b
jz loop_until_ready
;;;;;;;;;;; now we can send ;;;;;;;;;;;;;;;;;;
mov dx,3f8h
mov al,3BH ;F1 ->CHAT
out dx,al
mov GAME_MASTER,0
MOV CHAT_MASTER,1 ;;;THE PLAYER HOW SENT THE CHAT INVITAION IS THE
RET
CHAT_INVET_M_PROC ENDP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
Start_Game PROC FAR
CALL FAR PTR CLEAR_SCREEN ;clear the screen before entering the game
call FAR PTR draw_background ;draw the background of the Game window
call FAR PTR draw_h1
call FAR PTR draw_h2
CALL FAR PTR draw_p1
CALL FAR PTR draw_p2
call FAR PTR DRAW_BARRIER1
call FAR PTR DRAW_BARRIER2
;;;;;;;;;;;GAME LOOP FUNCTIONS;;;;;;;;;;;;;;;;;;;;;;;;;;;
CHECK_TIME:
MOV AH,2Ch ;get the system time
INT 21h ;CH = hour CL = minute DH = second DL = 1/100 seconds
CMP DL,TIME_AUX ;is the current time equal to the previous one(TIME_AUX)?
JE CHECK_TIME ;if it is the same, check again
;if it's different, then draw, move, etc.
MOV TIME_AUX,DL ;update time
cmp level,49
JZ level1
level2:
CALL FAR PTR MOVE_BARRIERS_2
level1:
CALL FAR PTR MOVE_BARRIERS
;check if health is zero, Game Over
mov ax,first_player_health
cmp ax,0
jz Game_Over
;check if health is zero, Game Over
mov ax,second_player_health
cmp ax,0
jz Game_Over
CALL FAR PTR MOVE_PLAYERS
;;;;;;;;;;;;;Flushing the keyboard buffer
mov ah,0ch
mov al,0
int 21h
JMP CHECK_TIME ;after everything checks time again
;;;;;;;;;;;GAME ENDING FUNCTIONS;;;;;;;;;;;;;;;;;;;;;;;;;;;
Game_Over:
CALL FAR PTR CLEAR_SCREEN ;clear the screen before entering the game
; call FAR PTR draw_background
call far PTR Game_over_screen
mov ax,second_player_health
cmp ax,0
jz first_wins
mov ax,first_player_health
cmp ax,0
jz second_wins
jmp final
first_wins:
mov first_player_X,10
mov first_player_y,90
call FAR PTR draw_p1
mov ah,2
mov dl,20
mov dh,90
int 10h
PRINT_Messages First_player_wins
; MOV BP, OFFSET first_player_wins+1 ; ES: BP POINTS TO THE TEXT
; MOV AH, 13H ; WRITE THE STRING
; MOV AL, 01H; ATTRIBUTE IN BL, MOVE CURSOR TO THAT POSITION
; XOR BH,BH ; VIDEO PAGE = 0
; MOV BL, 0eh ;YELLOW
; MOV CX, 17 ; LENGTH OF THE STRING
; MOV DH, 12 ;ROW TO PLACE STRING
; MOV DL, 12 ; COLUMN TO PLACE STRING
; INT 10H
jmp final
second_wins:
mov second_player_X,10
mov second_player_Y,90
call FAR PTR draw_p2
mov ah,2
mov dl,20
mov dh,90
int 10h
PRINT_Messages Second_player_wins
; MOV BP, OFFSET second_player_wins ; ES: BP POINTS TO THE TEXT
; MOV AH, 13H ; WRITE THE STRING
; MOV AL, 01H; ATTRIBUTE IN BL, MOVE CURSOR TO THAT POSITION
; XOR BH,BH ; VIDEO PAGE = 0
; MOV BL, 01h ;BLUE
; MOV CX, 20 ; LENGTH OF THE STRING
; MOV DH, 12 ;ROW TO PLACE STRING
; MOV DL, 12 ; COLUMN TO PLACE STRING
; INT 10H
final:
mov ah,2
mov dx,1100h
int 10h ;Position the Cursor
ADD DH,3
PRINT_Messages GAME_OVER_mess
mov ah,0
int 16h
cmp AH,01
JNE Final
;Now Send it to the reciever
mov dx , 3FDH ; Line Status Register
Send_ESC_GAME_OVER_AGAIN:
In al , dx ;Read Line Status
test al , 00100000b
JZ Send_ESC_GAME_OVER_AGAIN ;Not empty
;If empty put the VALUE in Transmit data register
mov dx , 3F8H ; Transmit data register
mov al,01 ;ESC KEY SCAN CODE
out dx , al
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
Start_RECIEVING_VALUES:
;Wait for the recived ESC from other user
;Check that Data is Ready
mov dx , 3FDH ; Line Status Register
Recieve_ESC_GAME_OVER_AGAIN:
in al , dx
test al , 1
JZ Recieve_ESC_GAME_OVER_AGAIN ;Not Ready
;If Ready read the VALUE in Receive data register
mov dx , 03F8H
in al , dx
cmp al,01 ;ESC KEY SCAN CODE
JNE Start_RECIEVING_VALUES
RESET_ALL_DATA:
mov first_player_X,50 ;The starting X-position of player one
mov first_player_Y , 50 ;The starting Y-position of player one
mov first_player_health , 5 ;Number of hearts to the first player
mov first_player_health_immunity , 0 ;when the player gets hit by barrier, he gains an immunity to resist the barriers
mov first_player_Freeze , 0 ;Duration for which the player is frozen
mov First_Is_Collided , 0 ;Boolean Variable To check if the player is colliding
mov second_player_X , 270 ;The starting X-position of player two
mov SECOND_PLAYER_Y , 50 ;The starting Y-position of player two
mov second_player_health , 5 ;Number of hearts to the second player
mov second_player_health_immunity , 0 ;when the player gets hit by barrier, he gains an immunity to resist the barriers
mov second_player_Freeze , 0 ;Duration for which the player is frozen
mov Second_Is_Collided , 0 ;Boolean Variable To check if the player is colliding
mov X_BARRIER1 , 10 ; xpos of barrier1
mov Y_BARRIER1 , 140 ; ypos of barrier1
mov X_BARRIER2 , 260 ; xpos of barrier2
mov Y_BARRIER2 , 104 ; ypos of barrier2
mov GAME_MASTER , 00H
mov GAME_SLAVE , 0
mov CHAT_MASTER , 0
mov CHAT_SLAVE , 0
mov LEVEL_CHOSEN , 0
mov First_cursor_X , 6
mov First_cursor_Y , 1
; SECOND CURSOR USED FOR RECEIVING
mov SECOND_CURSOR_X , 6
mov SECOND_CURSOR_Y , 13
mov end_line , 76
mov IS_ENTER , 0
mov IS_BACKSPACE , 0
;;; IN GAME CHAT MODULE
mov in_game_cursor_up , 0
mov in_game_cursor_down , 0
mov in_game_received_val , 0
mov in_game_to_send_val , 0
mov in_game_iterator , 0
mov in_game_end_chat , 0
mov is_quit , 0
mov level , 0
mov is_master , 01h ;WHEN A PLAYER SENT INVI. TO THE ANOTHER ONE SO HE IS THE MASTER (MASTER VALUE=1)
RET
Start_Game ENDP
CHAT_MODULE PROC FAR
;CLEAR screen
mov ah,0
mov al,3
int 10h
CALL FAR PTR SET_CHATTERS
call FAR PTR draw_line
;set first cursor position to top left center
MOV AH,2
MOV DL,0
MOV DH ,0
INT 10H
;check if any letter recevied
CHECK_RECEIVE:
;check if their is letter received
MOV DX,Line_status_register ; LINE STATUS resgister
IN AL,DX
TEST AL,1
JZ NO_RECIEVE
;receive register
MOV DX ,TRANSMIT_DATA_REGISTER
IN AL ,DX
MOV LETTER_RECEIVING,AL
CMP AL,1BH ;scan code of ESC
JE END_CHAT
CMP AL,8
JZ IT_IS_BACK_REC ;CHECK IF RECIEVED BACKSPACE TO SET THE VARIABLE
JMP CHECK_ENTER_REC
IT_IS_BACK_REC:
MOV IS_BACKSPACE,1
JMP GO_TO_LOWER_SCREEN
CHECK_ENTER_REC: CMP AL,13 ;CHECK IF RECIEVED ENTER
JZ ITIS_ENTER
JMP GO_TO_LOWER_SCREEN
ITIS_ENTER:
MOV IS_ENTER,1
GO_TO_LOWER_SCREEN: CALL FAR PTR Lower_screen
JMP CHECK_RECEIVE
;IF NOTHING TO RECIEVE SEND CHARACTER IF ANY
NO_RECIEVE:
MOV AL,0
MOV AH,01H
INT 16H
CMP AL,0
JE CHECK_RECEIVE
MOV AH,00H
INT 16H
MOV LETTER_SENT,AL ;STORE DATA IN LETTER TO BE SENT
;LATER
;--------------------- START SENDING -------------------------
MOV DX , Line_status_register ;LINE STATUS REGISTER
IN AL , DX ;READ LINE STATUS
TEST AL , 00100000B
JZ CHECK_RECEIVE ;NOT EMPTY
MOV DX , TRANSMIT_DATA_REGISTER ; TRANSMIT DATA REGISTER
MOV AL,LETTER_SENT
OUT DX , AL
CMP AL,27 ; check if ESC is pressed
JE END_CHAT
CMP AL,8
JZ IT_IS_BACK1
JMP check_enter_SEND
IT_IS_BACK1:
MOV IS_BACKSPACE,1
JMP GO_TO_UPPER_SCREEN
check_enter_SEND: CMP AL,13 ;CHECK scan code if ENTER KEY
JNZ GO_TO_UPPER_SCREEN
MOV IS_ENTER,1
GO_TO_UPPER_SCREEN: CALL FAR PTR upper_screen
JMP CHECK_RECEIVE
END_CHAT:
mov ah,0
mov al,3
int 10h
RET
CHAT_MODULE ENDP
SET_CHATTERS PROC FAR
mov ah,2 ;SET POSITION
mov DX,0H
INT 10H
MOV AH,09
MOV DX,OFFSET First_Player_Name+2 ;PRINT first_chatter NAME
INT 21H
mov ah,2 ;SET POSITION
mov DX,0c00H
INT 10H
MOV AH,09
MOV DX,OFFSET Second_Player_Name+2 ;PRINT SECOND_chatter NAME
INT 21H
mov ah,2 ;SET POSITION
mov DX,1800H
INT 10H
MOV AH,09
MOV DX,OFFSET chat_end_string ;PRINT SECOND_chatter NAME
INT 21H
RET
SET_CHATTERS ENDP
;description
draw_line PROC FAR
MOV AH,2
mov dx,12
INT 10H
mov ax,0b800h ;text mode
mov DI,1760 ; each row 80 column each one 2 bits 80*2*12
mov es,ax
mov ah,0fh ; black background
mov al,'-' ; '-'
mov cx,80
rep stosw
mov ax,0b800h ;text mode
mov DI,3680 ; each row 80 column each one 2 bits 80*2*12
mov es,ax
mov ah,0fh ; black background
mov al,'_' ; '-'
mov cx,80
rep stosw
ret
draw_line ENDP
upper_screen PROC FAR
push ax
push bx
push cx
PUSH DX
CMP IS_BACKSPACE,1
JNZ NOT_BACK
CMP First_cursor_X,start_position_x
JG CAN_BACK
JMP SET_BACK
CAN_BACK:
DEC First_cursor_X ; IF IT IS BACKSPACE DEC POSITION X
; AND STORE ' ' IN AL
SET_BACK:
MOV LETTER_SENT,' ' ;SPACE
JMP set_new_position
NOT_BACK:
CMP IS_ENTER,1
JE NEW_LINE
JMP set_new_position
NEW_LINE:
INC First_cursor_Y ;START NEW LINE
MOV First_cursor_X,start_position_x ;SET X TO LINE BEGINNING
JMP CHECK_SCROLL ;SCROLL ONE LINE
set_new_position:
MOV AH,2
MOV DL ,First_cursor_X
MOV DH ,First_cursor_Y
INT 10H
; PRINT THE CURRENT CHARACTER WITH CERTAIN COLOR
MOV AH,9
MOV BH,0
MOV AL ,LETTER_SENT ; STORE SENT LETTER IN AL
MOV CX,1H ; PRINT LETTER 1 TIME
MOV BL,03H ;LIGHT BLUE COLOR
INT 10H
CMP IS_BACKSPACE,1
JE END_UPPER_CHAT
INC First_cursor_X
;IF FIRST_CURSOR_X REACHES END OF LINE 76 START NEW LINE
MOV DL,end_line
CMP First_cursor_X ,DL
JNZ END_UPPER_CHAT
JMP NEW_LINE
CHECK_SCROLL:
CMP First_cursor_Y,11
JNZ END_UPPER_CHAT
JMP SCROLL_UPPER_SCREEN
SCROLL_UPPER_SCREEN:
CALL FAR PTR SCROLL_UP
END_UPPER_CHAT:
MOV AH,2
MOV DL ,First_cursor_X ; SET NEW X-POSITION OF CURSOR
MOV DH ,First_cursor_Y ; SET NEW Y-POSITION OF CURSOR
INT 10H
MOV AL,0
MOV IS_BACKSPACE,0 ;RETURN IS_BACKSPACE,IS_ENTER TO ZERO AGAIN
MOV IS_ENTER,0
POP DX
pop cx
pop bx
pop ax
RET
upper_screen ENDP
;description
;description
SCROLL_UP PROC FAR
PUSH ax
PUSH bx
PUSH cx
PUSH DX
MOV AH,6
MOV AL,1 ; SCROLL THE UPPER PART BY 1 LINE
MOV BH,0 ; NORMAL VIDEO ATTRIBUTE
MOV CH,1 ;GET POSITION
MOV CL,03
MOV DH,10
MOV DL,79
INT 10H
DEC First_cursor_Y
POP dx
POP CX
POP BX
POP AX
RET
SCROLL_UP ENDP
Lower_screen PROC
PUSH AX
PUSH bx
PUSH cx
PUSH DX
CMP IS_BACKSPACE,1
JNZ NOT_BACK2
CMP SECOND_CURSOR_X,start_position_x
JG CAN_BACK2
JMP SET_BACK2
CAN_BACK2:
DEC SECOND_CURSOR_X
SET_BACK2:
MOV AL,' ' ;SPACE
JMP set_new_position2
NOT_BACK2:
CMP IS_ENTER,1
JE NEW_LINE2
JMP set_new_position2
NEW_LINE2:
INC SECOND_CURSOR_Y
MOV SECOND_CURSOR_X,start_position_x ;SET CURSOR_X OF LOWER SCREEN
JMP CHECK_SCROLL2
set_new_position2:
MOV AH,2
MOV DL ,SECOND_CURSOR_X ; SET CURSOR POSITION OF 2ND CURSOR
MOV DH ,SECOND_CURSOR_Y
INT 10H
MOV AH,9 ;PRINT THE RECEIVED LETTER WITH RED COLOR
MOV BH,0
MOV CX,1H ; one time
MOV BL,0CH ;RED COLOR
INT 10H
CMP IS_BACKSPACE,1
JE END_LOWER_CHAT
INC SECOND_CURSOR_X ; inc X_position of 2nd cursor if it is not backspace
mov dl,end_line
CMP SECOND_CURSOR_X ,dl ; if X_position of 2nd cursor reach end of line
JNE END_LOWER_CHAT
JMP NEW_LINE2 ; start new line
CHECK_SCROLL2:
CMP SECOND_CURSOR_Y,23
JNE END_LOWER_CHAT
JMP SCROLL_BOTTOM
SCROLL_BOTTOM:
CALL FAR PTR SCROLL_DOWN
END_LOWER_CHAT:
MOV AH,2
MOV DL ,First_cursor_X ;SET NEW CURSOR POSITION X
MOV DH ,First_cursor_Y ;SET NEW CURSOR POSITION Y
INT 10H
;CLEAR FLAGS
MOV IS_ENTER,0
MOV IS_BACKSPACE,0
MOV AL,0
POP dx
POP CX
POP bx
POP ax
RET
Lower_screen ENDP
;description
SCROLL_dOWN PROC FAR
PUSH ax
PUSH bx
PUSH cx
PUSH DX
MOV AH,6
MOV AL,1
MOV BH,0
MOV CH,13
MOV CL,0
MOV DH,22
MOV DL,79
INT 10H
DEC SECOND_CURSOR_Y
POP dx
POP CX
POP BX
POP AX
RET
SCROLL_dOWN ENDP
start_in_game_chatting proc FAR
start_in_game_chatting_again:
; debughh:
; jmp debughh
; print_first_name_in_game_chat:
; mov SI, OFFSET First_Player_Name
; inc SI
; mov cx,0
; mov cl,First_Player_Name+1
; inc SI
; mov dl, 0 ;Column (0->39)
; mov dh, 21 ;Row (0-> 24) and we're only printing in the 1/5 of the screen
; mov bh, 0 ;Display page
; print_first_name_in_game_chat_loop :
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, [SI]
; mov bl, 0Ch ;Color is red
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; INC SI ;the next char
; INC DL ;increase col
; inc in_game_cursor_up
; Loop print_first_name_in_game_chat_loop
;if x=79 and erase all and print name again
;print chars from keyboard
;if enter pressed then erase backward all and prnit name agaibn
;send the character
;print name2 in pos 22;
;print_second_name_in_game_chat:
; mov SI, OFFSET Second_Player_Name
; inc SI
; mov cx,0
; mov cl,Second_Player_Name+1
; inc SI
; mov dl, 0 ;Column (0->39)
; mov dh, 22 ;Row (0-> 24) and we're only printing in the 1/5 of the screen
; mov bh, 0 ;Display page
; print_second_name_in_game_chat_loop :
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, [SI]
; mov bl, 0Ch ;Color is red
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; INC SI ;the next char
; INC DL ;increase col
; inc in_game_cursor_down
; Loop print_second_name_in_game_chat_loop
WHILE_IN_GAME_CHAT:
read_keyboard_ingame:
mov ah,1
int 16h
jnz Do_not_recevive_vale_from_another_player_label
jmp recevive_vale_from_another_player ;; if no key pressed then see incoming chars
Do_not_recevive_vale_from_another_player_label:
mov ah,0
int 16h
mov in_game_to_send_val,al
cmp ah,3eh;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; if key is f4 then get isquit be 1
jne not_quit
mov is_quit, 1
mov in_game_to_send_val,ah ;; put the vakue of the scan code instead of ascii code as f4 has no ascii
not_quit:
cmp in_game_to_send_val,'=' ; if user press ';' then he wil continue the game
jne not_out_out_chat
mov in_game_end_chat,1d
not_out_out_chat:
;;send value to next player
mov dx , 3FDH ; Line Status Register
AGAIN_in_game_chat: In al , dx ;Read Line Status
test al , 00100000b
JZ AGAIN_in_game_chat ;Not empty
;If empty put the VALUE in Transmit data register
mov dx , 3F8H ; Transmit data register
mov al,in_game_to_send_val
out dx , al
cmp in_game_cursor_up,39
jne not_end_of_line
;; clear_line_in_game_chat as the cursor has reached its end so we erase from the end of the postion of the player name to position 79
mov di, offset First_Player_Name
inc di
mov cl,[di]
mov cl,0
mov in_game_iterator ,cl ; save in the iterator the size of the player name to begin after it
inc in_game_iterator
clear_line_in_game_chat_up:
mov dl, in_game_iterator ;Column
mov dh, 21 ;Row
mov bh, 0 ;Display page
mov ah, 02h ;SetCursorPosition
int 10h
mov al, ' '
mov bl, 0h ;Color is black
mov bh, 0 ;Display page
mov ah, 0Eh ;Teletype
int 10h
inc in_game_iterator
mov al,in_game_iterator
cmp al,79d
jle clear_line_in_game_chat_up
mov in_game_cursor_up,0
not_end_of_line:
mov dl, in_game_cursor_up ;Column
mov dh, 21 ;Row
mov bh, 0 ;Display page
mov ah, 02h ;SetCursorPosition
int 10h
mov al, in_game_to_send_val
mov bl, 4h ;Color is white
mov bh, 0 ;Display page
mov ah, 0Eh ;Teletype
int 10h
inc in_game_cursor_up
recevive_vale_from_another_player:
mov dx , 3FDH ; Line Status Register
in al , dx
test al , 1
JZ chk_end ;Not Ready
;If Ready read the VALUE in Receive data register
mov dx , 03F8H
in al , dx
mov in_game_received_val , al
cmp al,3eh ;;;;;; if the value recieced equals to f4 then end the game
jne not_end_game2
mov is_quit,1d
not_end_game2:
cmp al,'=' ;if value received is ';' then return back to the game
jne not_end_chat2
mov in_game_end_chat,1
not_end_chat2:
print_from_another_player:
cmp in_game_cursor_down,39 ;; same as before we clear the line if it reached its end
jne not_end_of_line2
mov di, offset Second_Player_Name
inc di
mov cl,[di]
mov cl,0
mov in_game_iterator ,cl
inc in_game_iterator
clear_line_in_game_chat_down:
mov dl, in_game_iterator ;Column
mov dh, 22 ;Row
mov bh, 0 ;Display page
mov ah, 02h ;SetCursorPosition
int 10h
mov al, ' '
mov bl, 0h ;Color is black
mov bh, 0 ;Display page
mov ah, 0Eh ;Teletype
int 10h
inc in_game_iterator
mov al,in_game_iterator
cmp al,79d
jle clear_line_in_game_chat_down
mov in_game_cursor_down,0
not_end_of_line2:
mov dl, in_game_cursor_down ;Column
mov dh, 22 ;Row
mov bh, 0 ;Display page
mov ah, 02h ;SetCursorPosition
int 10h
mov al, in_game_received_val
mov bl, 1h ;Color is white
mov bh, 0 ;Display page
mov ah, 0Eh ;Teletype
int 10h
inc in_game_cursor_down
chk_end:
cmp in_game_end_chat,1
je return_from_ingame_chat
; cmp is_quit,1
; je return_from_ingame_chat
jmp WHILE_IN_GAME_CHAT
return_from_ingame_chat:
mov in_game_end_chat,0
mov in_game_cursor_up,0
mov in_game_cursor_down,0
mov in_game_iterator,0
;; clearing chat lines before returning from the functoin
clear_line_in_game_chat_down2:
mov dl, in_game_iterator ;Column
mov dh, 22 ;Row
mov bh, 0 ;Display page
mov ah, 02h ;SetCursorPosition
int 10h
mov al, ' '
mov bl, 0h ;Color is black
mov bh, 0 ;Display page
mov ah, 0Eh ;Teletype
int 10h
inc in_game_iterator
mov al,in_game_iterator
cmp al,79d
jle clear_line_in_game_chat_down2
mov in_game_iterator,0
clear_line_in_game_chat_up2:
mov dl, in_game_iterator ;Column
mov dh, 21 ;Row
mov bh, 0 ;Display page
mov ah, 02h ;SetCursorPosition
int 10h
mov al, ' '
mov bl, 0h ;Color is black
mov bh, 0 ;Display page
mov ah, 0Eh ;Teletype
int 10h
inc in_game_iterator
mov al,in_game_iterator
cmp al,79d
jle clear_line_in_game_chat_up2
mov in_game_iterator,0
mov in_game_end_chat,0
mov in_game_cursor_up,0
mov in_game_cursor_down,0
mov in_game_iterator,0
ret
;if x=79 erase all backward and print name
;if recevived print character
;if enter rceived erase backwards ;if x=79 erase all and print name again
mov ah,0
RET
start_in_game_chatting ENDP
; start_in_game_chatting2 proc FAR
; start_in_game_chatting_again2:
; ;
; WHILE_IN_GAME_CHAT2:
; read_keyboard_ingame2:
; mov ah,1
; int 16h
; jnz Do_not_recevive_vale_from_another_player_label2
; jmp recevive_vale_from_another_player2 ;; if no key pressed then see incoming chars
; Do_not_recevive_vale_from_another_player_label2:
; mov ah,0
; int 16h
; mov in_game_to_send_val,al
; cmp ah,3eh;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; if key is f4 then get isquit be 1
; jne not_quit2
; mov is_quit, 1
; mov in_game_to_send_val,ah ;; put the vakue of the scan code instead of ascii code as f4 has no ascii
; not_quit2:
; cmp in_game_to_send_val,';' ; if user press ';' then he wil continue the game
; jne not_out_out_chat2
; mov in_game_end_chat,1d
; not_out_out_chat2:
; ;;send value to next player
; mov dx , 3FDH ; Line Status Register
; AGAIN_in_game_chat2: In al , dx ;Read Line Status
; test al , 00100000b
; JZ AGAIN_in_game_chat2 ;Not empty
; ;If empty put the VALUE in Transmit data register
; mov dx , 3F8H ; Transmit data register
; mov al,in_game_to_send_val
; out dx , al
; cmp in_game_cursor_up,79
; jne not_end_of_line22
; ;; clear_line_in_game_chat as the cursor has reached its end so we erase from the end of the postion of the player name to position 79
; mov di, offset First_Player_Name
; inc di
; mov cl,[di]
; mov cl,0
; mov in_game_iterator ,cl ; save in the iterator the size of the player name to begin after it
; inc in_game_iterator
; clear_line_in_game_chat_up22:
; mov dl, in_game_iterator ;Column
; mov dh, 21 ;Row
; mov bh, 0 ;Display page
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, ' '
; mov bl, 0h ;Color is black
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; inc in_game_iterator
; mov al,in_game_iterator
; cmp al,79d
; jle clear_line_in_game_chat_up22
; not_end_of_line22:
; mov dl, in_game_cursor_up ;Column
; mov dh, 21 ;Row
; mov bh, 0 ;Display page
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, in_game_to_send_val
; mov bl, 0Fh ;Color is white
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; inc in_game_cursor_up
; recevive_vale_from_another_player2:
; mov dx , 3FDH ; Line Status Register
; in al , dx
; test al , 1
; JZ chk_end2 ;Not Ready
; ;If Ready read the VALUE in Receive data register
; mov dx , 03F8H
; in al , dx
; mov in_game_received_val , al
; cmp al,3eh ;;;;;; if the value recieced equals to f4 then end the game
; jne not_end_game22
; mov is_quit,1d
; not_end_game22:
; cmp al,';' ;if value received is ';' then return back to the game
; jne not_end_chat22
; mov is_quit,1
; not_end_chat22:
; print_from_another_player2:
; cmp in_game_cursor_down,79 ;; same as before we clear the line if it reached its end
; jne not_end_of_line223
; mov di, offset Second_Player_Name
; inc di
; mov cl,[di]
; mov cl,0
; mov in_game_iterator ,cl
; inc in_game_iterator
; clear_line_in_game_chat_down22:
; mov dl, in_game_iterator ;Column
; mov dh, 22 ;Row
; mov bh, 0 ;Display page
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, ' '
; mov bl, 0h ;Color is black
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; inc in_game_iterator
; mov al,in_game_iterator
; cmp al,79d
; jle clear_line_in_game_chat_down22
; not_end_of_line223:
; mov dl, in_game_cursor_down ;Column
; mov dh, 22 ;Row
; mov bh, 0 ;Display page
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, in_game_received_val
; mov bl, 0Fh ;Color is white
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; inc in_game_cursor_down
; chk_end2:
; cmp in_game_end_chat,1
; je return_from_ingame_chat2
; cmp is_quit,1
; je return_from_ingame_chat2
; jmp WHILE_IN_GAME_CHAT2
; return_from_ingame_chat2:
; mov in_game_end_chat,0
; mov in_game_cursor_up,0
; mov in_game_cursor_down,0
; mov in_game_iterator,0
; ;; clearing chat lines before returning from the functoin
; clear_line_in_game_chat_down223:
; mov dl, in_game_iterator ;Column
; mov dh, 22 ;Row
; mov bh, 0 ;Display page
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, ' '
; mov bl, 0h ;Color is black
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; inc in_game_iterator
; mov al,in_game_iterator
; cmp al,79d
; jle clear_line_in_game_chat_down223
; mov in_game_iterator,0
; clear_line_in_game_chat_up223:
; mov dl, in_game_iterator ;Column
; mov dh, 21 ;Row
; mov bh, 0 ;Display page
; mov ah, 02h ;SetCursorPosition
; int 10h
; mov al, ' '
; mov bl, 0h ;Color is black
; mov bh, 0 ;Display page
; mov ah, 0Eh ;Teletype
; int 10h
; inc in_game_iterator
; mov al,in_game_iterator
; cmp al,79d
; jle clear_line_in_game_chat_up223
; mov in_game_iterator,0
; mov in_game_end_chat,0
; mov in_game_cursor_up,0
; mov in_game_cursor_down,0
; mov in_game_iterator,0
; ret
; ;if x=79 erase all backward and print name
; ;if recevived print character
; ;if enter rceived erase backwards ;if x=79 erase all and print name again
; mov ah,0
; RET
; start_in_game_chatting2 ENDP
;description
send_in_chat_inv PROC
;Check that Transmitter Holding Register is Empty
mov dx , 3FDH ; Line Status Register
send_chat_now: In al , dx ;Read Line Status
test al , 00100000b
JZ send_chat_now ;Not empty
;If empty put the VALUE in Transmit data register
mov dx , 3F8H ; Transmit data register
mov al,27h
out dx , al
ret
send_in_chat_inv ENDP
END MAIN |
src/main/antlr4/com/khubla/mailcradle/mailcradle.g4 | teverett/mailcradle | 1 | 2855 | /*
BSD License
Copyright (c) 2020, <NAME>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of Tom Everett 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.
*/
grammar mailcradle;
mailcradle
: (list | filter | import_)+
;
import_
: 'import' string ';'
;
list
: 'list' identifier string (',' string)* ';'
;
filter
: 'if' '(' expression ')' '{' action* '}' ';'
;
expression
: expression logical expression
| '(' expression ')'
| NOT expression
| condition
;
logical
: AND
| OR
;
condition
: termcondition
| listcondition
;
termcondition
: term termrelation string
;
listcondition
: identifier listrelation term
;
term
: subjecterm
| fromterm
| bodyterm
| headerterm
| toterm
| ccterm
| bccterm
;
ccterm
: 'cc'
;
bccterm
: 'bcc'
;
subjecterm
: 'subject'
;
bodyterm
: 'body'
;
fromterm
: 'from'
;
toterm
: 'to'
;
headerterm
: 'header' '[' string ']'
;
termrelation
: 'contains'
| 'is'
;
listrelation
: 'contains'
;
action
: moveaction
| forwardaction
| replyaction
| flagaction
| unflagaction
| stopaction
;
stopaction
: 'stop' ';'
;
flagaction
: 'flag' string ';'
;
unflagaction
: 'unflag' string ';'
;
replyaction
: 'replywith' string ';'
;
moveaction
: 'moveto' string ';'
;
forwardaction
: 'forwardto' string ';'
;
AND
: 'and'
;
OR
: 'or'
;
NOT
: '!'
;
identifier
: IDENTIFIER
;
string
: STRING_LITERAL
;
STRING_LITERAL
: '"' .*? '"'
;
IDENTIFIER
: [A-Za-z] [A-Za-z0-9]*
;
LINECOMMENT
: '//' ~ [\r\n]* -> skip
;
WS
: [ \t\r\n]+ -> skip
;
|
programs/oeis/213/A213758.asm | neoneye/loda | 22 | 7474 | ; A213758: Antidiagonal sums of the convolution array A213756.
; 1,9,40,130,355,871,1994,4360,9245,19205,39356,79934,161415,324755,651870,1306596,2616609,5237265,10479280,20964090,41934571,83876479,167761330,335532160,671075045,1342162141,2684337764,5368690550,10737397775,21474813995,42949648326,85899319004,171798662505,343597351785,687194732760,1374389497266,2748779028979,5497558095255,10995116230810,21990232505080,43980465056941,87960930164149,175921860382220,351843720822190,703687441706135,1407374883478211,2814749767026734,5629499534128340,11258999068336305,22517998136757185,45035996273604096,90071992547303274,180143985094707195,360287970189520815,720575940379154050,1441151880758426736,2882303761516978549,5764607523034088845,11529215046068316340,23058430092136778470,46116860184273710111,92233720368547581019,184467440737095330710,368934881474190838220,737869762948381861625,1475739525896763917081,2951479051793528036904,5902958103587056285730,11805916207174112792835,23611832414348225816775,47223664828696451874666,94447329657392904000744,188894659314785808263485,377789318629571616799845,755578637259143233883740,1511157274518286468063006,3022314549036572936433319,6044629098073145873186035,12089258196146291746703870,24178516392292583493752260,48357032784585166987862081,96714065569170333976095089,193428131138340667952574800,386856262276681335905548250,773712524553362671811509515,1547425049106725343623446751,3094850098213450687247336274,6189700196426901374495130720,12379400392853802748990735365,24758800785707605497981960765,49517601571415210995964428036,99035203142830421991929379414,198070406285660843983859299375,396140812571321687967719156875,792281625142643375935438889830,1584563250285286751870878374076,3169126500570573503741757361289,6338253001141147007483515354825,12676506002282294014967031361400,25353012004564588029934063394450
lpb $0
mov $2,$0
sub $0,1
seq $2,213764 ; Antidiagonal sums of the convolution array A213762.
add $1,$2
lpe
add $1,1
mov $0,$1
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xa0.log_21829_3.asm | ljhsiun2/medusa | 9 | 172622 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r14
push %r15
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x1c2b6, %rcx
nop
xor %r11, %r11
and $0xffffffffffffffc0, %rcx
vmovaps (%rcx), %ymm6
vextracti128 $1, %ymm6, %xmm6
vpextrq $0, %xmm6, %r12
nop
nop
nop
nop
inc %r14
lea addresses_D_ht+0xce1c, %rsi
lea addresses_WC_ht+0xa4bc, %rdi
nop
nop
and $36358, %r12
mov $80, %rcx
rep movsq
and %rdi, %rdi
lea addresses_UC_ht+0x126dc, %rsi
xor $5997, %r15
mov $0x6162636465666768, %r14
movq %r14, %xmm3
vmovups %ymm3, (%rsi)
nop
nop
nop
nop
sub $9179, %r14
lea addresses_WC_ht+0x8e64, %rsi
nop
xor %r11, %r11
mov (%rsi), %rdi
nop
nop
nop
nop
nop
and $37862, %rcx
lea addresses_A_ht+0xcadc, %rsi
clflush (%rsi)
cmp %r11, %r11
mov (%rsi), %r14w
xor $18684, %rdi
lea addresses_D_ht+0x148bc, %rcx
nop
cmp %rsi, %rsi
mov $0x6162636465666768, %r11
movq %r11, (%rcx)
nop
nop
nop
sub %r11, %r11
lea addresses_normal_ht+0xc65c, %r12
nop
nop
nop
nop
nop
and $40596, %rcx
mov (%r12), %esi
nop
nop
cmp $31398, %r12
lea addresses_WT_ht+0x1a7dc, %rsi
lea addresses_D_ht+0x1cea2, %rdi
cmp %r12, %r12
mov $126, %rcx
rep movsl
nop
nop
xor $41325, %rdi
lea addresses_WC_ht+0x195dc, %r15
add $56816, %rcx
movl $0x61626364, (%r15)
sub %r12, %r12
lea addresses_UC_ht+0x160e8, %rdi
nop
nop
and $3190, %r12
mov $0x6162636465666768, %rcx
movq %rcx, %xmm3
vmovups %ymm3, (%rdi)
nop
nop
add $47626, %rdi
lea addresses_normal_ht+0x1075c, %r11
nop
mfence
movb $0x61, (%r11)
nop
nop
nop
nop
nop
add $26506, %rcx
pop %rsi
pop %rdi
pop %rcx
pop %r15
pop %r14
pop %r12
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r12
push %r13
push %r15
push %r8
push %r9
push %rbp
push %rbx
// Store
lea addresses_PSE+0x82dc, %r8
nop
nop
nop
inc %r12
mov $0x5152535455565758, %r15
movq %r15, %xmm2
vmovups %ymm2, (%r8)
nop
cmp %r8, %r8
// Store
lea addresses_D+0x2e80, %r13
and $61973, %rbx
movw $0x5152, (%r13)
add %rbp, %rbp
// Load
lea addresses_WT+0x619c, %r12
nop
nop
nop
nop
nop
and %r15, %r15
mov (%r12), %ebx
xor $44118, %r9
// Store
mov $0x4dc, %r9
nop
nop
nop
nop
nop
add %r8, %r8
movw $0x5152, (%r9)
nop
nop
nop
nop
nop
add $13005, %rbx
// Load
lea addresses_normal+0x1adc, %r9
nop
sub %r8, %r8
mov (%r9), %ebx
nop
nop
nop
nop
cmp %rbx, %rbx
// Faulty Load
lea addresses_normal+0x1adc, %r15
nop
nop
nop
nop
xor $36836, %r12
movups (%r15), %xmm2
vpextrq $0, %xmm2, %r13
lea oracles, %rbp
and $0xff, %r13
shlq $12, %r13
mov (%rbp,%r13,1), %r13
pop %rbx
pop %rbp
pop %r9
pop %r8
pop %r15
pop %r13
pop %r12
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_normal', 'AVXalign': False, 'size': 8}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 10, 'type': 'addresses_PSE', 'AVXalign': False, 'size': 32}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 2, 'type': 'addresses_D', 'AVXalign': False, 'size': 2}}
{'src': {'NT': True, 'same': False, 'congruent': 5, 'type': 'addresses_WT', 'AVXalign': True, 'size': 4}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 9, 'type': 'addresses_P', 'AVXalign': False, 'size': 2}}
{'src': {'NT': False, 'same': True, 'congruent': 0, 'type': 'addresses_normal', 'AVXalign': True, 'size': 4}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'NT': False, 'same': True, 'congruent': 0, 'type': 'addresses_normal', 'AVXalign': False, 'size': 16}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'NT': False, 'same': True, 'congruent': 1, 'type': 'addresses_WC_ht', 'AVXalign': True, 'size': 32}, 'OP': 'LOAD'}
{'src': {'same': False, 'congruent': 5, 'type': 'addresses_D_ht'}, 'OP': 'REPM', 'dst': {'same': True, 'congruent': 4, 'type': 'addresses_WC_ht'}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 10, 'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 32}}
{'src': {'NT': False, 'same': False, 'congruent': 3, 'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 8}, 'OP': 'LOAD'}
{'src': {'NT': False, 'same': False, 'congruent': 11, 'type': 'addresses_A_ht', 'AVXalign': False, 'size': 2}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 5, 'type': 'addresses_D_ht', 'AVXalign': False, 'size': 8}}
{'src': {'NT': False, 'same': False, 'congruent': 4, 'type': 'addresses_normal_ht', 'AVXalign': False, 'size': 4}, 'OP': 'LOAD'}
{'src': {'same': False, 'congruent': 7, 'type': 'addresses_WT_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 1, 'type': 'addresses_D_ht'}}
{'OP': 'STOR', 'dst': {'NT': True, 'same': False, 'congruent': 8, 'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 4}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 2, 'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 32}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 2, 'type': 'addresses_normal_ht', 'AVXalign': False, 'size': 1}}
{'34': 21829}
34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34
*/
|
src/ewok-mpu-allocator.adb | mfkiwl/ewok-kernel-security-OS | 65 | 14982 | --
-- Copyright 2018 The wookey project team <<EMAIL>>
-- - <NAME>
-- - <NAME>
-- - <NAME>
-- - <NAME>
-- - <NAME>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
package body ewok.mpu.allocator
with spark_mode => on
is
function free_region_exist return boolean
is
begin
for region in regions_pool'range loop
if not regions_pool(region).used then
return true;
end if;
end loop;
return false;
end free_region_exist;
function is_power_of_2 (n : unsigned_32)
return boolean
is
begin
-- True if n and (n-1) have no bit in common
return (n and (n - 1)) = 0;
end is_power_of_2;
function to_next_power_of_2 (n : unsigned_32)
return unsigned_32
is
ret : unsigned_32;
begin
ret := n - 1;
ret := ret or shift_right (ret, 1);
ret := ret or shift_right (ret, 2);
ret := ret or shift_right (ret, 4);
ret := ret or shift_right (ret, 8);
ret := ret or shift_right (ret, 16);
ret := ret + 1;
-- FIXME - To be proved
pragma assume (is_power_of_2 (ret));
return ret;
end to_next_power_of_2;
procedure map_in_pool
(addr : in system_address;
size : in unsigned_32; -- in bytes
region_type : in ewok.mpu.t_region_type;
subregion_mask : in m4.mpu.t_subregion_mask;
success : out boolean)
is
region_size : m4.mpu.t_region_size;
allocated_size : unsigned_32;
begin
-- Verifying size's bounds
if size < 32 or
size > 2*GBYTE
then
success := false;
return;
end if;
-- Verifying that size is a power of 2
if not is_power_of_2 (size)
then
allocated_size := to_next_power_of_2 (size);
else
allocated_size := size;
end if;
-- Verifying region alignement
if (unsigned_32 (addr) and (allocated_size - 1)) > 0 then
success := false;
return;
end if;
ewok.mpu.bytes_to_region_size (allocated_size, region_size);
for region in regions_pool'range loop
if not regions_pool(region).used then
regions_pool(region) := (used => true, addr => addr);
ewok.mpu.set_region
(region, addr, region_size, region_type, subregion_mask);
success := true;
pragma assume (is_in_pool (addr));
return;
end if;
end loop;
success := false;
end map_in_pool;
procedure unmap_from_pool
(addr : in system_address)
is
begin
for region in regions_pool'range loop
if regions_pool(region).addr = addr and
regions_pool(region).used
then
m4.mpu.disable_region (region);
regions_pool(region) := (used => false, addr => 0);
return;
end if;
end loop;
raise program_error;
end unmap_from_pool;
procedure unmap_all_from_pool
is
begin
for region in regions_pool'range loop
m4.mpu.disable_region (region);
regions_pool(region) := (used => false, addr => 0);
end loop;
end unmap_all_from_pool;
-- SPARK
function is_in_pool
(addr : system_address) return boolean
is
begin
for region in regions_pool'range loop
if regions_pool(region).addr = addr and
regions_pool(region).used
then
return true;
end if;
end loop;
return false;
end is_in_pool;
end ewok.mpu.allocator;
|
Transynther/x86/_processed/NONE/_zr_/i3-7100_9_0x84_notsx.log_128_2850.asm | ljhsiun2/medusa | 9 | 21795 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r15
push %r8
push %rax
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_UC_ht+0x1ef0c, %r15
nop
and $45070, %r8
vmovups (%r15), %ymm6
vextracti128 $0, %ymm6, %xmm6
vpextrq $0, %xmm6, %r11
nop
nop
nop
sub %rcx, %rcx
lea addresses_WT_ht+0x1684c, %rsi
lea addresses_normal_ht+0x48cc, %rdi
clflush (%rdi)
nop
nop
nop
xor %rax, %rax
mov $110, %rcx
rep movsq
nop
nop
cmp %r11, %r11
lea addresses_D_ht+0x698e, %rax
sub $38716, %rcx
movl $0x61626364, (%rax)
nop
nop
nop
nop
nop
and %r11, %r11
lea addresses_WT_ht+0x1acef, %rcx
nop
nop
nop
xor %rsi, %rsi
mov $0x6162636465666768, %r8
movq %r8, (%rcx)
nop
nop
cmp %r8, %r8
lea addresses_D_ht+0x1a20c, %rsi
lea addresses_UC_ht+0x15c4c, %rdi
nop
nop
nop
nop
add $35141, %rdx
mov $57, %rcx
rep movsq
nop
nop
nop
nop
nop
add $41752, %rdi
lea addresses_WT_ht+0x525c, %rdx
nop
xor %r11, %r11
mov (%rdx), %rcx
nop
sub $21660, %rdi
lea addresses_WC_ht+0x19d4c, %rax
nop
nop
nop
nop
xor $57375, %r8
movb (%rax), %r11b
sub %rdi, %rdi
lea addresses_WT_ht+0x52c4, %rsi
lea addresses_D_ht+0x1c24c, %rdi
nop
and %rax, %rax
mov $19, %rcx
rep movsb
nop
nop
sub %rdi, %rdi
lea addresses_UC_ht+0x1b12c, %rax
nop
nop
nop
and $710, %r15
movb $0x61, (%rax)
nop
nop
nop
nop
nop
cmp $59194, %rdx
lea addresses_WC_ht+0x1a66c, %rax
nop
nop
nop
nop
nop
add $304, %rcx
movb (%rax), %r15b
nop
and %r11, %r11
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rax
pop %r8
pop %r15
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r13
push %r14
push %r15
push %rcx
push %rdi
push %rdx
// Store
lea addresses_A+0xcc, %r15
nop
nop
nop
mfence
mov $0x5152535455565758, %r13
movq %r13, (%r15)
nop
nop
nop
nop
add $7347, %rdi
// Store
lea addresses_WT+0x1530c, %r15
nop
nop
nop
nop
add $57242, %rdx
mov $0x5152535455565758, %rcx
movq %rcx, %xmm6
vmovups %ymm6, (%r15)
nop
nop
dec %r13
// Store
lea addresses_PSE+0x1614c, %r15
add $17142, %r11
movb $0x51, (%r15)
nop
nop
nop
nop
nop
cmp $251, %rdi
// Store
lea addresses_WT+0x1044c, %r13
nop
nop
nop
nop
nop
cmp %r11, %r11
mov $0x5152535455565758, %rdx
movq %rdx, (%r13)
sub $2043, %rcx
// Store
lea addresses_A+0x8c4c, %rdi
nop
nop
xor %r11, %r11
movb $0x51, (%rdi)
nop
xor $37406, %r15
// Store
lea addresses_RW+0x122b5, %rdx
nop
nop
inc %r14
mov $0x5152535455565758, %r15
movq %r15, %xmm5
movups %xmm5, (%rdx)
nop
nop
nop
nop
sub $33388, %r14
// Load
lea addresses_PSE+0x68e0, %r11
nop
nop
nop
nop
nop
dec %rdi
mov (%r11), %rdx
nop
nop
nop
nop
nop
dec %rdx
// Store
lea addresses_RW+0x8ec8, %r11
nop
nop
nop
nop
and $6925, %rcx
movl $0x51525354, (%r11)
nop
nop
nop
nop
nop
cmp %rcx, %rcx
// Store
lea addresses_normal+0xa3ac, %r15
nop
cmp %r11, %r11
movb $0x51, (%r15)
sub %r13, %r13
// Store
lea addresses_US+0x1f90c, %r14
nop
nop
nop
nop
nop
inc %r13
mov $0x5152535455565758, %rdi
movq %rdi, (%r14)
nop
nop
nop
nop
dec %rdi
// Faulty Load
lea addresses_A+0x1504c, %r14
nop
nop
sub $59716, %r11
movups (%r14), %xmm5
vpextrq $0, %xmm5, %rdx
lea oracles, %r14
and $0xff, %rdx
shlq $12, %rdx
mov (%r14,%rdx,1), %rdx
pop %rdx
pop %rdi
pop %rcx
pop %r15
pop %r14
pop %r13
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_A', 'same': False, 'size': 4, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_A', 'same': False, 'size': 8, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WT', 'same': False, 'size': 32, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_PSE', 'same': False, 'size': 1, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WT', 'same': False, 'size': 8, 'congruent': 10, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_A', 'same': False, 'size': 1, 'congruent': 10, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_RW', 'same': False, 'size': 16, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_PSE', 'same': False, 'size': 8, 'congruent': 1, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_RW', 'same': False, 'size': 4, 'congruent': 2, 'NT': False, 'AVXalign': True}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_normal', 'same': False, 'size': 1, 'congruent': 4, 'NT': True, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_US', 'same': False, 'size': 8, 'congruent': 6, 'NT': True, 'AVXalign': False}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'type': 'addresses_A', 'same': True, 'size': 16, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 32, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WT_ht', 'congruent': 10, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 7, 'same': False}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 4, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 8, 'congruent': 0, 'NT': True, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_D_ht', 'congruent': 5, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 10, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_WT_ht', 'same': False, 'size': 8, 'congruent': 3, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WC_ht', 'same': False, 'size': 1, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WT_ht', 'congruent': 3, 'same': False}, 'dst': {'type': 'addresses_D_ht', 'congruent': 8, 'same': False}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_UC_ht', 'same': False, 'size': 1, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_WC_ht', 'same': False, 'size': 1, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'00': 128}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
programs/oeis/109/A109164.asm | jmorken/loda | 1 | 26937 | <reponame>jmorken/loda<gh_stars>1-10
; A109164: a(n) = 4*a(n-1) - 4*a(n-2) + a(n-3), n >= 3; a(0)=1, a(1)=6, a(2)=20.
; 1,6,20,57,154,408,1073,2814,7372,19305,50546,132336,346465,907062,2374724,6217113,16276618,42612744,111561617,292072110,764654716,2001892041,5241021410,13721172192,35922495169,94046313318,246216444788
mov $1,4
mov $2,1
lpb $0
mov $3,$2
lpb $0
sub $0,$2
add $3,$1
add $1,$3
lpe
lpe
sub $1,3
|
sharding-core/src/main/antlr4/imports/SQLServerDCLStatement.g4 | root1005214/sharding-jdbc | 0 | 4783 | grammar SQLServerDCLStatement;
import SQLServerKeyword, DataType, Keyword, SQLServerBase, BaseRule, Symbol;
grant
: grantGeneral | grantDW
;
grantGeneral
: GRANT generalPrisOn TO ids (WITH GRANT OPTION)? (AS ID)?
;
generalPrisOn
: (ALL PRIVILEGES? | permissionOnColumns (COMMA permissionOnColumns)*) (ON (ID COLON COLON)? ID)?
;
permissionOnColumns
: permission columnList?
;
permission
: ID +?
;
grantDW
: GRANT permission (COMMA permission)* (ON (classType COLON COLON)? ID)?
TO ids (WITH GRANT OPTION)?
;
classType
: LOGIN | DATABASE | OBJECT | ROLE | SCHEMA | USER
;
revoke
: revokeGeneral | revokeDW
;
revokeGeneral
: REVOKE (GRANT OPTION FOR)? ((ALL PRIVILEGES?)? | permissionOnColumns)
(ON (ID COLON COLON)? ID)? (TO | FROM) ids (CASCADE)? (AS ID)?
;
revokeDW
: REVOKE permissionWithClass (FROM | TO)? ids CASCADE?
;
permissionWithClass
: permission (COMMA permission)* (ON (classType COLON COLON)? ID)?
;
deny
: DENY generalPrisOn TO ids CASCADE? (AS ID)?
;
createUser
: CREATE USER
(
userName (createUserBody1 | createUserBody4)
| createUserBody2
| createUserBody3
)?
;
createUserBody1
: ((FOR | FROM) LOGIN ID)? (WITH optionsLists)?
;
createUserBody2
: windowsPrincipal (WITH optionsLists)?
| userName WITH PASSWORD EQ_ STRING (COMMA optionsList)*
| ID FROM EXTERNAL PROVIDER
;
windowsPrincipal
: ID BACKSLASH ID
;
createUserBody3
: windowsPrincipal ((FOR | FROM) LOGIN ID)?
| userName (FOR | FROM) LOGIN ID
;
createUserBody4
: WITHOUT LOGIN (WITH optionsLists)?
| (FOR | FROM) (CERTIFICATE ID | ASYMMETRIC KEY ID)
;
optionsLists
: optionsList (COMMA optionsList)*
;
optionsList
: ID EQ_ ID?
;
alterUser
: ALTER USER userName optionsLists
;
dropUser
: DROP USER (IF EXISTS)? userName
;
createLogin
: CREATE LOGIN (windowsPrincipal | ID) (WITH loginOptionList | FROM sources)
;
loginOptionList
: PASSWORD EQ_ STRING HASHED? MUST_CHANGE? (COMMA optionsList)*
;
sources
: WINDOWS (WITH optionsLists)? | CERTIFICATE ID | ASYMMETRIC KEY ID
;
alterLogin
: ALTER LOGIN ID (ENABLE | DISABLE | WITH loginOption (COMMA loginOption)* | credentialOption)
;
loginOption
: PASSWORD EQ_ STRING HASHED? (OLD_PASSWORD EQ_ STRING | passwordOption (passwordOption )?)?
| DEFAULT_DATABASE EQ_ databaseName
| optionsList
| NO CREDENTIAL
;
passwordOption
: MUST_CHANGE | UNLOCK
;
credentialOption
: ADD CREDENTIAL ID
| DROP CREDENTIAL
;
dropLogin
: DROP LOGIN ID
;
createRole
: CREATE ROLE roleName (AUTHORIZATION ID)
;
alterRole
: ALTER ROLE roleName ((ADD | DROP) MEMBER ID | WITH NAME EQ_ ID )
;
dropRole
: DROP ROLE roleName
; |
Solution/4.asm | 1813355042-Kamal/CSE331L-Section-1-Fall20-NSU | 0 | 12666 | .model small
.stack 100h
.data
msg1 db 10,13,'ENTER A HEX DIGIT:$'
msg2 db 10,13,'IN DECIMAL IS IT:$'
msg3 db 10,13,'Invalid$'
.code
again:
mov ax,@data
mov ds,ax
lea dx,msg1
mov ah,9
int 21h
mov ah,1
int 21h
mov bl,al
jmp go
go:
cmp bl,'9'
ja hex
jb num
je num
hex:
cmp bl,'F'
ja illegal
lea dx,msg2
mov ah,9
int 21h
mov dl,49d
mov ah,2
int 21h
sub bl,17d
mov dl,bl
mov ah,2
int 21h
num:
cmp bl,'0'
jb illegal
lea dx,msg2
mov ah,9
int 21h
mov dl,bl
mov ah,2
int 21h
illegal:
lea dx,msg3
mov ah,9
int 21h
mov ah,1
int 21h
mov bl,al
jmp go
exit: |
arch/ARM/STM32/drivers/i2c_stm32f4/stm32-i2c.adb | morbos/Ada_Drivers_Library | 2 | 16554 | <filename>arch/ARM/STM32/drivers/i2c_stm32f4/stm32-i2c.adb
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_i2c.c --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief I2C HAL module driver. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
with Ada.Real_Time; use Ada.Real_Time;
with STM32_SVD.I2C; use STM32_SVD.I2C;
with STM32.Device; use STM32.Device;
package body STM32.I2C is
use type HAL.I2C.I2C_Status;
type I2C_Status_Flag is
(Start_Bit,
Address_Sent,
Byte_Transfer_Finished,
Address_Sent_10bit,
Stop_Detection,
Rx_Data_Register_Not_Empty,
Tx_Data_Register_Empty,
Bus_Error,
Arbitration_Lost,
Ack_Failure,
UnderOverrun,
Packet_Error,
Timeout,
SMB_Alert,
Master_Slave_Mode,
Busy,
Transmitter_Receiver_Mode,
General_Call,
SMB_Default,
SMB_Host,
Dual_Flag);
-- Low level flag handling
function Flag_Status (This : I2C_Port;
Flag : I2C_Status_Flag)
return Boolean;
procedure Clear_Address_Sent_Status (This : I2C_Port);
-- Higher level flag handling
procedure Wait_Flag
(This : in out I2C_Port;
Flag : I2C_Status_Flag;
F_State : Boolean;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status);
procedure Wait_Master_Flag
(This : in out I2C_Port;
Flag : I2C_Status_Flag;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status);
procedure Master_Request_Write
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status);
procedure Master_Request_Read
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status);
procedure Mem_Request_Write
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : HAL.I2C.I2C_Memory_Address_Size;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status);
procedure Mem_Request_Read
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : HAL.I2C.I2C_Memory_Address_Size;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status);
---------------
-- Configure --
---------------
procedure Configure
(This : in out I2C_Port;
Conf : I2C_Configuration)
is
CR1 : CR1_Register;
CCR : CCR_Register;
OAR1 : OAR1_Register;
PCLK1 : constant UInt32 := System_Clock_Frequencies.PCLK1;
Freq_Range : constant UInt16 := UInt16 (PCLK1 / 1_000_000);
begin
if This.State /= Reset then
return;
end if;
This.Config := Conf;
-- Disable the I2C port
if Freq_Range < 2 or else Freq_Range > 45 then
raise Program_Error with
"PCLK1 too high or too low: expected 2-45 MHz, current" &
Freq_Range'Img & " MHz";
end if;
Set_State (This, False);
-- Load CR2 and clear FREQ
This.Periph.CR2 :=
(LAST => False,
DMAEN => False,
ITBUFEN => False,
ITEVTEN => False,
ITERREN => False,
FREQ => UInt6 (Freq_Range),
others => <>);
-- Set the port timing
if Conf.Clock_Speed <= 100_000 then
-- Mode selection to Standard Mode
CCR.F_S := False;
CCR.CCR := UInt12 (PCLK1 / (Conf.Clock_Speed * 2));
if CCR.CCR < 4 then
CCR.CCR := 4;
end if;
This.Periph.TRISE.TRISE := UInt6 (Freq_Range + 1);
else
-- Fast mode
CCR.F_S := True;
if Conf.Duty_Cycle = DutyCycle_2 then
CCR.CCR := UInt12 (PCLK1 / (Conf.Clock_Speed * 3));
else
CCR.CCR := UInt12 (PCLK1 / (Conf.Clock_Speed * 25));
CCR.DUTY := True;
end if;
if CCR.CCR = 0 then
CCR.CCR := 1;
end if;
This.Periph.TRISE.TRISE :=
UInt6 ((UInt32 (Freq_Range) * 300) / 1000 + 1);
end if;
This.Periph.CCR := CCR;
-- CR1 configuration
case Conf.Mode is
when I2C_Mode =>
CR1.SMBUS := False;
CR1.SMBTYPE := False;
when SMBusDevice_Mode =>
CR1.SMBUS := True;
CR1.SMBTYPE := False;
when SMBusHost_Mode =>
CR1.SMBUS := True;
CR1.SMBTYPE := True;
end case;
CR1.ENGC := Conf.General_Call_Enabled;
CR1.NOSTRETCH := not Conf.Clock_Stretching_Enabled;
This.Periph.CR1 := CR1;
-- Address mode (slave mode) configuration
OAR1.ADDMODE := Conf.Addressing_Mode = Addressing_Mode_10bit;
case Conf.Addressing_Mode is
when Addressing_Mode_7bit =>
OAR1.ADD0 := False;
OAR1.ADD7 := UInt7 (Conf.Own_Address / 2);
OAR1.ADD10 := 0;
when Addressing_Mode_10bit =>
OAR1.ADD0 := (Conf.Own_Address and 2#1#) /= 0;
OAR1.ADD7 := UInt7 ((Conf.Own_Address / 2) and 2#1111111#);
OAR1.ADD10 := UInt2 (Conf.Own_Address / 2 ** 8);
end case;
This.Periph.OAR1 := OAR1;
Set_State (This, True);
This.State := Ready;
end Configure;
-----------------
-- Flag_Status --
-----------------
function Flag_Status
(This : I2C_Port; Flag : I2C_Status_Flag) return Boolean
is
begin
case Flag is
when Start_Bit =>
return This.Periph.SR1.SB;
when Address_Sent =>
return This.Periph.SR1.ADDR;
when Byte_Transfer_Finished =>
return This.Periph.SR1.BTF;
when Address_Sent_10bit =>
return This.Periph.SR1.ADD10;
when Stop_Detection =>
return This.Periph.SR1.STOPF;
when Rx_Data_Register_Not_Empty =>
return This.Periph.SR1.RxNE;
when Tx_Data_Register_Empty =>
return This.Periph.SR1.TxE;
when Bus_Error =>
return This.Periph.SR1.BERR;
when Arbitration_Lost =>
return This.Periph.SR1.ARLO;
when Ack_Failure =>
return This.Periph.SR1.AF;
when UnderOverrun =>
return This.Periph.SR1.OVR;
when Packet_Error =>
return This.Periph.SR1.PECERR;
when Timeout =>
return This.Periph.SR1.TIMEOUT;
when SMB_Alert =>
return This.Periph.SR1.SMBALERT;
when Master_Slave_Mode =>
return This.Periph.SR2.MSL;
when Busy =>
return This.Periph.SR2.BUSY;
when Transmitter_Receiver_Mode =>
return This.Periph.SR2.TRA;
when General_Call =>
return This.Periph.SR2.GENCALL;
when SMB_Default =>
return This.Periph.SR2.SMBDEFAULT;
when SMB_Host =>
return This.Periph.SR2.SMBHOST;
when Dual_Flag =>
return This.Periph.SR2.DUALF;
end case;
end Flag_Status;
-- ----------------
-- -- Clear_Flag --
-- ----------------
--
-- procedure Clear_Flag
-- (Port : in out I2C_Port;
-- Target : Clearable_I2C_Status_Flag)
-- is
-- Unref : Bit with Unreferenced;
-- begin
-- case Target is
-- when Bus_Error =>
-- Port.SR1.BERR := 0;
-- when Arbitration_Lost =>
-- Port.SR1.ARLO := 0;
-- when Ack_Failure =>
-- Port.SR1.AF := 0;
-- when UnderOverrun =>
-- Port.SR1.OVR := 0;
-- when Packet_Error =>
-- Port.SR1.PECERR := 0;
-- when Timeout =>
-- Port.SR1.TIMEOUT := 0;
-- when SMB_Alert =>
-- Port.SR1.SMBALERT := 0;
-- end case;
-- end Clear_Flag;
-------------------------------
-- Clear_Address_Sent_Status --
-------------------------------
procedure Clear_Address_Sent_Status (This : I2C_Port)
is
Unref : Boolean with Volatile, Unreferenced;
begin
-- ADDR is cleared after reading both SR1 and SR2
Unref := This.Periph.SR1.ADDR;
Unref := This.Periph.SR2.MSL;
end Clear_Address_Sent_Status;
-- ---------------------------------
-- -- Clear_Stop_Detection_Status --
-- ---------------------------------
--
-- procedure Clear_Stop_Detection_Status (Port : in out I2C_Port) is
-- Unref : Bit with Volatile, Unreferenced;
-- begin
-- Unref := Port.SR1.STOPF;
-- Port.CR1.PE := True;
-- end Clear_Stop_Detection_Status;
---------------
-- Wait_Flag --
---------------
procedure Wait_Flag
(This : in out I2C_Port;
Flag : I2C_Status_Flag;
F_State : Boolean;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status)
is
Start : constant Time := Clock;
begin
while Flag_Status (This, Flag) = F_State loop
if Clock - Start > Milliseconds (Timeout) then
This.State := Ready;
Status := HAL.I2C.Err_Timeout;
return;
end if;
end loop;
Status := HAL.I2C.Ok;
end Wait_Flag;
----------------------
-- Wait_Master_Flag --
----------------------
procedure Wait_Master_Flag
(This : in out I2C_Port;
Flag : I2C_Status_Flag;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status)
is
Start : constant Time := Clock;
begin
while not Flag_Status (This, Flag) loop
if This.Periph.SR1.AF then
-- Generate STOP
This.Periph.CR1.STOP := True;
-- Clear the AF flag
This.Periph.SR1.AF := False;
This.State := Ready;
Status := HAL.I2C.Err_Error;
return;
end if;
if Clock - Start > Milliseconds (Timeout) then
This.State := Ready;
Status := HAL.I2C.Err_Timeout;
return;
end if;
end loop;
Status := HAL.I2C.Ok;
end Wait_Master_Flag;
--------------------------
-- Master_Request_Write --
--------------------------
procedure Master_Request_Write
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status)
is
begin
This.Periph.CR1.START := True;
Wait_Flag (This, Start_Bit, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
if This.Config.Addressing_Mode = Addressing_Mode_7bit then
This.Periph.DR.DR := UInt8 (Addr) and not 2#1#;
else
declare
MSB : constant UInt8 :=
UInt8 (Shift_Right (UInt16 (Addr) and 16#300#, 7));
LSB : constant UInt8 :=
UInt8 (Addr and 16#FF#);
begin
-- We need to send 2#1111_MSB0# when MSB are the 3 most
-- significant bits of the address
This.Periph.DR.DR := MSB or 16#F0#;
Wait_Master_Flag (This, Address_Sent_10bit, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.DR.DR := LSB;
end;
end if;
Wait_Master_Flag (This, Address_Sent, Timeout, Status);
end Master_Request_Write;
--------------------------
-- Master_Request_Write --
--------------------------
procedure Master_Request_Read
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status)
is
begin
This.Periph.CR1.ACK := True;
This.Periph.CR1.START := True;
Wait_Flag (This, Start_Bit, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
if This.Config.Addressing_Mode = Addressing_Mode_7bit then
This.Periph.DR.DR := UInt8 (Addr) or 2#1#;
else
declare
MSB : constant UInt8 :=
UInt8 (Shift_Right (UInt16 (Addr) and 16#300#, 7));
LSB : constant UInt8 :=
UInt8 (Addr and 16#FF#);
begin
-- We need to write the address bit. So let's start with a
-- write header
-- We need to send 2#1111_MSB0# when MSB are the 3 most
-- significant bits of the address
This.Periph.DR.DR := MSB or 16#F0#;
Wait_Master_Flag (This, Address_Sent_10bit, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.DR.DR := LSB;
Wait_Master_Flag (This, Address_Sent, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Clear_Address_Sent_Status (This);
-- Generate a re-start
This.Periph.CR1.START := True;
Wait_Flag (This, Start_Bit, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
-- resend the MSB with the read bit set.
This.Periph.DR.DR := MSB or 16#F1#;
end;
end if;
Wait_Master_Flag (This, Address_Sent, Timeout, Status);
end Master_Request_Read;
-----------------------
-- Mem_Request_Write --
-----------------------
procedure Mem_Request_Write
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : HAL.I2C.I2C_Memory_Address_Size;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status)
is
begin
This.Periph.CR1.START := True;
Wait_Flag (This, Start_Bit, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
-- Send slave address
This.Periph.DR.DR := UInt8 (Addr) and not 2#1#;
Wait_Master_Flag (This, Address_Sent, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Clear_Address_Sent_Status (This);
-- Wait until TXE flag is set
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
case Mem_Addr_Size is
when HAL.I2C.Memory_Size_8b =>
This.Periph.DR.DR := UInt8 (Mem_Addr);
when HAL.I2C.Memory_Size_16b =>
This.Periph.DR.DR := UInt8 (Shift_Right (Mem_Addr, 8));
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.DR.DR := UInt8 (Mem_Addr and 16#FF#);
end case;
-- Wait until TXE flag is set
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
end Mem_Request_Write;
----------------------
-- Mem_Request_Read --
----------------------
procedure Mem_Request_Read
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : HAL.I2C.I2C_Memory_Address_Size;
Timeout : Natural;
Status : out HAL.I2C.I2C_Status)
is
begin
This.Periph.CR1.ACK := True;
This.Periph.CR1.START := True;
Wait_Flag (This, Start_Bit, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
-- Send slave address in write mode
This.Periph.DR.DR := UInt8 (Addr) and not 16#1#;
Wait_Master_Flag (This, Address_Sent, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Clear_Address_Sent_Status (This);
-- Wait until TXE flag is set
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
case Mem_Addr_Size is
when HAL.I2C.Memory_Size_8b =>
This.Periph.DR.DR := UInt8 (Mem_Addr);
when HAL.I2C.Memory_Size_16b =>
This.Periph.DR.DR := UInt8 (Shift_Right (Mem_Addr, 8));
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.DR.DR := UInt8 (Mem_Addr and 16#FF#);
end case;
-- Wait until TXE flag is set
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
-- We now need to reset and send the slave address in read mode
This.Periph.CR1.START := True;
Wait_Flag (This, Start_Bit, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
-- Send slave address in read mode
This.Periph.DR.DR := UInt8 (Addr) or 16#1#;
Wait_Master_Flag (This, Address_Sent, Timeout, Status);
end Mem_Request_Read;
---------------------
-- Master_Transmit --
---------------------
overriding
procedure Master_Transmit
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Data : HAL.I2C.I2C_Data;
Status : out HAL.I2C.I2C_Status;
Timeout : Natural := 1000)
is
Idx : Natural := Data'First;
begin
if This.State = Reset then
Status := HAL.I2C.Err_Error;
return;
elsif Data'Length = 0 then
Status := HAL.I2C.Err_Error;
return;
end if;
Wait_Flag (This, Busy, True, Timeout, Status);
if Status /= HAL.I2C.Ok then
Status := HAL.I2C.Busy;
return;
end if;
if This.State /= Ready then
Status := HAL.I2C.Busy;
return;
end if;
This.State := Master_Busy_Tx;
This.Periph.CR1.POS := False;
Master_Request_Write (This, Addr, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Clear_Address_Sent_Status (This);
while Idx <= Data'Last loop
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.DR.DR := Data (Idx);
Idx := Idx + 1;
if Flag_Status (This, Byte_Transfer_Finished)
and then
Idx <= Data'Last
and then
Status = HAL.I2C.Ok
then
This.Periph.DR.DR := Data (Idx);
Idx := Idx + 1;
end if;
end loop;
Wait_Flag (This, Tx_Data_Register_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
-- Generate STOP
This.Periph.CR1.STOP := True;
This.State := Ready;
end Master_Transmit;
--------------------
-- Master_Receive --
--------------------
overriding
procedure Master_Receive
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Data : out HAL.I2C.I2C_Data;
Status : out HAL.I2C.I2C_Status;
Timeout : Natural := 1000)
is
Idx : Natural := Data'First;
begin
if This.State = Reset then
Status := HAL.I2C.Err_Error;
return;
elsif Data'Length = 0 then
Status := HAL.I2C.Err_Error;
return;
end if;
Wait_Flag (This, Busy, True, Timeout, Status);
if Status /= HAL.I2C.Ok then
Status := HAL.I2C.Busy;
return;
end if;
if This.State /= Ready then
Status := HAL.I2C.Busy;
return;
end if;
This.State := Master_Busy_Rx;
This.Periph.CR1.POS := False;
Master_Request_Read (This, Addr, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
if Data'Length = 1 then
-- Disable acknowledge
This.Periph.CR1.ACK := False;
Clear_Address_Sent_Status (This);
This.Periph.CR1.STOP := True;
elsif Data'Length = 2 then
-- Disable acknowledge
This.Periph.CR1.ACK := False;
This.Periph.CR1.POS := True;
Clear_Address_Sent_Status (This);
else
-- Automatic acknowledge
This.Periph.CR1.ACK := True;
Clear_Address_Sent_Status (This);
end if;
while Idx <= Data'Last loop
if Idx = Data'Last then
-- One UInt8 to read
Wait_Flag
(This,
Rx_Data_Register_Not_Empty,
False,
Timeout,
Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
elsif Idx + 1 = Data'Last then
-- Two bytes to read
This.Periph.CR1.ACK := False;
Wait_Flag (This,
Byte_Transfer_Finished,
False,
Timeout,
Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.CR1.STOP := True;
-- read the data from DR
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
elsif Idx + 2 = Data'Last then
-- Three bytes to read
Wait_Flag (This,
Byte_Transfer_Finished,
False,
Timeout,
Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.CR1.ACK := False;
-- read the data from DR
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Wait_Flag (This,
Byte_Transfer_Finished,
False,
Timeout,
Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.CR1.STOP := True;
-- read the data from DR
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
else
-- One byte to read
Wait_Flag
(This,
Rx_Data_Register_Not_Empty,
False,
Timeout,
Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Wait_Flag (This,
Byte_Transfer_Finished,
False,
Timeout,
Status);
if Status = HAL.I2C.Ok then
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
end if;
end if;
end loop;
This.State := Ready;
end Master_Receive;
---------------
-- Mem_Write --
---------------
overriding
procedure Mem_Write
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : HAL.I2C.I2C_Memory_Address_Size;
Data : HAL.I2C.I2C_Data;
Status : out HAL.I2C.I2C_Status;
Timeout : Natural := 1000)
is
Idx : Natural := Data'First;
begin
if This.State = Reset then
Status := HAL.I2C.Err_Error;
return;
elsif Data'Length = 0 then
Status := HAL.I2C.Err_Error;
return;
end if;
Wait_Flag (This, Busy, True, Timeout, Status);
if Status /= HAL.I2C.Ok then
Status := HAL.I2C.Busy;
return;
end if;
if This.State /= Ready then
Status := HAL.I2C.Busy;
return;
end if;
This.State := Mem_Busy_Tx;
This.Periph.CR1.POS := False;
Mem_Request_Write
(This, Addr, Mem_Addr, Mem_Addr_Size, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
while Idx <= Data'Last loop
Wait_Flag (This,
Tx_Data_Register_Empty,
False,
Timeout,
Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.DR.DR := Data (Idx);
Idx := Idx + 1;
if Flag_Status (This, Byte_Transfer_Finished)
and then
Idx <= Data'Last
and then
Status = HAL.I2C.Ok
then
This.Periph.DR.DR := Data (Idx);
Idx := Idx + 1;
end if;
end loop;
Wait_Flag (This,
Tx_Data_Register_Empty,
False,
Timeout,
Status);
if Status /= HAL.I2C.Ok then
return;
end if;
-- Generate STOP
This.Periph.CR1.STOP := True;
This.State := Ready;
end Mem_Write;
--------------
-- Mem_Read --
--------------
overriding
procedure Mem_Read
(This : in out I2C_Port;
Addr : HAL.I2C.I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : HAL.I2C.I2C_Memory_Address_Size;
Data : out HAL.I2C.I2C_Data;
Status : out HAL.I2C.I2C_Status;
Timeout : Natural := 1000)
is
Idx : Natural := Data'First;
begin
if This.State = Reset then
Status := HAL.I2C.Err_Error;
return;
elsif Data'Length = 0 then
Status := HAL.I2C.Err_Error;
return;
end if;
Wait_Flag (This, Busy, True, Timeout, Status);
if Status /= HAL.I2C.Ok then
Status := HAL.I2C.Busy;
return;
end if;
if This.State /= Ready then
Status := HAL.I2C.Busy;
return;
end if;
This.State := Mem_Busy_Rx;
This.Periph.CR1.POS := False;
Mem_Request_Read
(This, Addr, Mem_Addr, Mem_Addr_Size, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
if Data'Length = 1 then
This.Periph.CR1.ACK := False;
Clear_Address_Sent_Status (This);
This.Periph.CR1.STOP := True;
elsif Data'Length = 2 then
This.Periph.CR1.ACK := False;
This.Periph.CR1.POS := True;
Clear_Address_Sent_Status (This);
else
-- Automatic acknowledge
This.Periph.CR1.ACK := True;
Clear_Address_Sent_Status (This);
end if;
while Idx <= Data'Last loop
if Idx = Data'Last then
-- One byte to read
Wait_Flag
(This, Rx_Data_Register_Not_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
elsif Idx + 1 = Data'Last then
-- Two bytes to read
This.Periph.CR1.ACK := False;
Wait_Flag (This, Byte_Transfer_Finished, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.CR1.STOP := True;
-- read the data from DR
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
elsif Idx + 2 = Data'Last then
-- Three bytes to read
Wait_Flag (This, Byte_Transfer_Finished, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.CR1.ACK := False;
-- read the data from DR
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Wait_Flag (This, Byte_Transfer_Finished, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
This.Periph.CR1.STOP := True;
-- read the data from DR
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
else
-- One byte to read
Wait_Flag
(This, Rx_Data_Register_Not_Empty, False, Timeout, Status);
if Status /= HAL.I2C.Ok then
return;
end if;
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
Wait_Flag (This, Byte_Transfer_Finished, False, Timeout, Status);
if Status = HAL.I2C.Ok then
Data (Idx) := This.Periph.DR.DR;
Idx := Idx + 1;
end if;
end if;
end loop;
This.State := Ready;
end Mem_Read;
---------------
-- Set_State --
---------------
procedure Set_State (This : in out I2C_Port; Enabled : Boolean)
is
begin
This.Periph.CR1.PE := Enabled;
end Set_State;
------------------
-- Port_Enabled --
------------------
function Port_Enabled (This : I2C_Port) return Boolean
is
begin
return This.Periph.CR1.PE;
end Port_Enabled;
----------------------
-- Enable_Interrupt --
----------------------
procedure Enable_Interrupt
(This : in out I2C_Port;
Source : I2C_Interrupt)
is
begin
case Source is
when Error_Interrupt =>
This.Periph.CR2.ITERREN := True;
when Event_Interrupt =>
This.Periph.CR2.ITEVTEN := True;
when Buffer_Interrupt =>
This.Periph.CR2.ITBUFEN := True;
end case;
end Enable_Interrupt;
-----------------------
-- Disable_Interrupt --
-----------------------
procedure Disable_Interrupt
(This : in out I2C_Port;
Source : I2C_Interrupt)
is
begin
case Source is
when Error_Interrupt =>
This.Periph.CR2.ITERREN := False;
when Event_Interrupt =>
This.Periph.CR2.ITEVTEN := False;
when Buffer_Interrupt =>
This.Periph.CR2.ITBUFEN := False;
end case;
end Disable_Interrupt;
-------------
-- Enabled --
-------------
function Enabled
(This : I2C_Port;
Source : I2C_Interrupt)
return Boolean
is
begin
case Source is
when Error_Interrupt =>
return This.Periph.CR2.ITERREN;
when Event_Interrupt =>
return This.Periph.CR2.ITEVTEN;
when Buffer_Interrupt =>
return This.Periph.CR2.ITBUFEN;
end case;
end Enabled;
end STM32.I2C;
|
Opus/asm/resn2.asm | Computer-history-Museum/MS-Word-for-Windows-v1.1 | 2 | 103476 | include w2.inc
include noxport.inc
include consts.inc
include structs.inc
createSeg res_PCODE,resn2,byte,public,CODE
; DEBUGGING DECLARATIONS
ifdef DEBUG
midResn2 equ 32 ; module ID, for native asserts
endif ;/* DEBUG */
; EXPORTED LABELS
; EXTERNAL FUNCTIONS
externNP <LN_LpFromPossibleHq>
externNP <LN_LrgbstFromSttb>
externNP <LN_StackAdjust>
ifdef DEBUG
externFP <AssertProcForNative>
externFP <FCheckHandle>
externFP <S_PdrFetch>
externFP <S_FreePdrf>
externFP <S_PtOrigin>
endif ;/* DEBUG */
; EXTERNAL DATA
sBegin data
externW mpwwhwwd ; extern struct WWD **mpwwhwwd[];
externW mpmwhmwd ; extern struct MWD **mpmwhmwd[];
externW mpdochdod ; extern struct DOD **mpdochdod[];
externW vhwwdOrigin ; struct WWD **vhwwdOrigin;
externW vpdrfHead ; extern struct DRF *vpdrfHead;
externW vitr ; extern struct ITR vitr;
externW vfti ; extern struct FTI vfti;
ifdef DEBUG
externW vfCheckPlc ; extern BOOL vfCheckPlc;
externW vdbs ; extern struct DBS vdbs;
externW wFillBlock
externW vsccAbove
externW vpdrfHeadUnused
endif ;/* DEBUG */
sEnd data
; CODE SEGMENT res_PCODE
sBegin resn2
assumes cs,resn2
assumes ds,dgroup
assume es:nothing
assume ss:nothing
include asserth.asm
;-------------------------------------------------------------------------
; CpMac1Doc
;-------------------------------------------------------------------------
;/* C P M A C 1 D O C */
;native CP CpMac1Doc(doc)
;int doc;
;{
; struct DOD *pdod = PdodDoc(doc);
; return(pdod->cpMac - ccpEop );
;}
; %%Function:CpMac1Doc %%Owner:BRADV
PUBLIC CpMac1Doc
CpMac1Doc:
mov al,-ccpEop
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; CpMacDocEdit
;-------------------------------------------------------------------------
;/* C P M A C D O C E D I T*/
;native CP CpMacDocEdit(doc)
;int doc;
;{
; return(CpMacDoc(doc) - ccpEop);
;}
; %%Function:CpMacDocEdit %%Owner:BRADV
PUBLIC CpMacDocEdit
CpMacDocEdit:
mov al,-3*ccpEop
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; CpMac2Doc
;-------------------------------------------------------------------------
;/* C P M A C 2 D O C */
;native CP CpMac2Doc(doc)
;int doc;
;{
; return((*mpdochdod[doc])->cpMac);
;}
; %%Function:CpMac2Doc %%Owner:BRADV
PUBLIC CpMac2Doc
CpMac2Doc:
mov al,0
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; CpMacDoc
;-------------------------------------------------------------------------
;/* C P M A C D O C */
;native CP CpMacDoc(doc)
;int doc;
;{
; struct DOD *pdod = PdodDoc(doc);
; return(pdod->cpMac - 2*ccpEop );
;}
; %%Function:CpMacDoc %%Owner:BRADV
PUBLIC CpMacDoc
CpMacDoc:
mov al,-2*ccpEop
;-------------------------------------------------------------------------
; CpMacDocEngine
;-------------------------------------------------------------------------
; return ( PdodDoc(doc)->cpMac + al );
; where al and ah represent those register values upon entry.
; %%Function:CpMacDocEngine %%Owner:BRADV
PUBLIC CpMacDocEngine
CpMacDocEngine:
pop cx
pop dx ;far return address in dx:cx
pop bx
push dx
push cx
shl bx,1
mov bx,[bx.mpdochdod]
mov bx,[bx]
cbw
cwd
add ax,[bx.LO_cpMacDod]
adc dx,[bx.HI_cpMacDod]
; }
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PcaSet
;-------------------------------------------------------------------------
;/* P C A S E T */
;native struct CA *PcaSet(pca, doc, cpFirst, cpLim)
;struct CA *pca;
;int doc;
;CP cpFirst, cpLim;
;{
; pca->doc = doc;
; pca->cpFirst = cpFirst;
; pca->cpLim = cpLim;
; return(pca);
;}
; %%Function:PcaSet %%Owner:PcaSet
PUBLIC PcaSet
PcaSet:
;LN_StackAdjust is a helper routine to reduce the size of routines
;in resn.asm. It takes the number of words of arguments to
;the routine minus one in the byte following the call to LN_StackAdjust.
;It then moves the far return address and si and di to above the
;arguments, moves the top argument into bx, and puts the other arguments
;below the saved si and di. This allows the use of short pop register
;instructions to access arguments passed to the caller of LN_StackAdjust.
;ax, bx, cx, dx are altered.
call LN_StackAdjust
db 5
LN_PopCache:
pop [bx.LO_cpLimCa]
pop [bx.HI_cpLimCa]
pop [bx.LO_cpFirstCa]
pop [bx.HI_cpFirstCa]
pop [bx.docCa]
xchg ax,bx
pop di
pop si
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PcaSetDcp
;-------------------------------------------------------------------------
;/* P C A S E T D C P */
;native struct CA *PcaSetDcp(pca, doc, cpFirst, dcp)
;struct CA *pca;
;int doc;
;CP cpFirst, dcp;
;{
; pca->doc = doc;
; pca->cpFirst = cpFirst;
; pca->cpLim = cpFirst + dcp;
; return(pca);
;}
; %%Function:PcaSetDcp %%Owner:BRADV
PUBLIC PcaSetDcp
PcaSetDcp:
;LN_StackAdjust is a helper routine to reduce the size of routines
;in resn.asm. It takes the number of words of arguments to
;the routine minus one in the byte following the call to LN_StackAdjust.
;It then moves the far return address and si and di to above the
;arguments, moves the top argument into bx, and puts the other arguments
;below the saved si and di. This allows the use of short pop register
;instructions to access arguments passed to the caller of LN_StackAdjust.
;ax, bx, cx, dx are altered.
call LN_StackAdjust
db 5
pop ax ;low dcp
pop dx ;high dcp
pop si
pop di
add ax,si ;low cpFirst
adc dx,di ;high cpFirst
push di
push si
push dx
push ax
jmp short LN_PopCache
;-------------------------------------------------------------------------
; PcaSetWholeDoc
;-------------------------------------------------------------------------
;/* P C A S E T W H O L E D O C */
;native struct CA *PcaSetWholeDoc(pca, doc)
;struct CA *pca;
;int doc;
;{
; return PcaSet(pca, doc, cp0, CpMacDocEdit(doc));
;}
; %%Function:PcaSetWholeDoc %%Owner:BRADV
PUBLIC PcaSetWholeDoc
PcaSetWholeDoc:
;LN_StackAdjust is a helper routine to reduce the size of routines
;in resn.asm. It takes the number of words of arguments to
;the routine minus one in the byte following the call to LN_StackAdjust.
;It then moves the far return address and si and di to above the
;arguments, moves the top argument into bx, and puts the other arguments
;below the saved si and di. This allows the use of short pop register
;instructions to access arguments passed to the caller of LN_StackAdjust.
;ax, bx, cx, dx are altered.
call LN_StackAdjust
db 1
pop di ;doc
push bx ;save pca
push di
push cs
call CpMacDocEdit
pop bx ;restore pca
push di
xor cx,cx
push cx
push cx
push dx
push ax
jmp short LN_PopCache
;-------------------------------------------------------------------------
; PcaSetNil
;-------------------------------------------------------------------------
;/* P C A S E T N I L */
;native struct CA *PcaSetNil(pca)
;struct CA *pca;
;{
; return PcaSet(pca, docNil, cp0, cp0);
;}
; %%Function:PcaSetNil %%Owner:BRADV
PUBLIC PcaSetNil
PcaSetNil:
;LN_StackAdjust is a helper routine to reduce the size of routines
;in resn.asm. It takes the number of words of arguments to
;the routine minus one in the byte following the call to LN_StackAdjust.
;It then moves the far return address and si and di to above the
;arguments, moves the top argument into bx, and puts the other arguments
;below the saved si and di. This allows the use of short pop register
;instructions to access arguments passed to the caller of LN_StackAdjust.
;ax, bx, cx, dx are altered.
call LN_StackAdjust
db 0
xor cx,cx
errnz <docNil>
push cx
push cx
push cx
push cx
push cx
jmp short LN_PopCache
;-------------------------------------------------------------------------
; PcaPoint
;-------------------------------------------------------------------------
;/* P C A P O I N T */
;native struct CA *PcaPoint(pca, doc, cp)
;struct CA *pca;
;int doc;
;CP cp;
;{
; return PcaSet(pca, doc, cp, cp);
;}
; %%Function:PcaPoint %%Owner:BRADV
PUBLIC PcaPoint
PcaPoint:
;LN_StackAdjust is a helper routine to reduce the size of routines
;in resn.asm. It takes the number of words of arguments to
;the routine minus one in the byte following the call to LN_StackAdjust.
;It then moves the far return address and si and di to above the
;arguments, moves the top argument into bx, and puts the other arguments
;below the saved si and di. This allows the use of short pop register
;instructions to access arguments passed to the caller of LN_StackAdjust.
;ax, bx, cx, dx are altered.
call LN_StackAdjust
db 3
pop ax ;low cp
pop dx ;high cp
push dx
push ax
push dx
push ax
jmp short LN_PopCache
;-------------------------------------------------------------------------
; DcpCa
;-------------------------------------------------------------------------
;/* D C P C A */
;native CP DcpCa(pca)
;struct CA *pca;
;{
; return(pca->cpLim - pca->cpFirst);
;}
; %%Function:DcpCa %%Owner:BRADV
PUBLIC DcpCa
DcpCa:
pop cx
pop dx ;far return address in dx:cx
pop bx
push dx
push cx
mov ax,[bx.LO_cpLimCa]
mov dx,[bx.HI_cpLimCa]
sub ax,[bx.LO_cpFirstCa]
sbb dx,[bx.HI_cpFirstCa]
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PtOrigin
;-------------------------------------------------------------------------
;/* P T O R I G I N */
;/* this procedure finds the origin in outermost l space of the p's in a frame
;identified by hpldr,idr.
;If idr == -1, it finds the origin for l's in hpldr.
;The outermost containing hwwd is returned in vhwwdOrigin.
;
;It is useful to remember:
; l's are frame relative coordinates of objects in frames, e.g.
; positions of dr's
; p's are object relative coordinates of parts of objects, e.g.
; lines of text, or frames of text.
; DR's are objects which may contain text and frames
; PLDR's are frames which can contain objects.
;*/
;NATIVE struct PT PtOrigin(hpldr, idr)
;struct PLDR **hpldr; int idr;
;{
; struct PT pt;
; struct DR *pdr;
; struct DRF drfFetch;
; %%Function:N_PtOrigin %%Owner:BRADV
cProc N_PtOrigin,<PUBLIC,FAR>,<>
ParmW hpldr
ParmW idr
ifdef DEBUG
LocalW pdr
LocalV drfFetch,cbDrfMin
endif ;/* DEBUG */
cBegin
mov bx,[hpldr]
mov cx,[idr]
; pt.xp = pt.yp = 0;
xor ax,ax
cwd
; for (;;)
; {
PO01:
ifdef DEBUG
; AssertH(hpl) with a jump so as not to
; mess up short jumps.
jmp short PO06
PO02:
endif ;DEBUG
mov [vhwwdOrigin],bx
mov bx,[bx]
; if (idr != -1)
; {
cmp cx,-1
je PO04
; Debug (pdr = PdrFetch(hpldr, idr, &drfFetch));
;Do this with a call so as not to mess up short jumps
ifdef DEBUG
call PO07
endif ;DEBUG
; hpdr = HpInPl(hpldr, idr);
push di ;save caller's di
push dx ;save pt.yp
push ax ;save pt.xp
mov dx,[vhwwdOrigin]
;LN_LpInPl takes hplFoo in dx and iFoo in cx to
;return lpFoo in es:di. bx, cx and si are not altered.
call LN_LpInPl
pop ax ;restore pt.xp
pop dx ;restore pt.yp
; Assert (pdr->xl == hpdr->xl);
; Assert (pdr->yl == hpdr->yl);
; Debug (FreePdrf(&drfFetch));
;Do this debug stuff with a call so as not to mess up short jumps
ifdef DEBUG
call PO08
endif ;DEBUG
; pt.xp += pdr->xl;
; pt.yp += pdr->yl;
; }
add ax,es:[di.xlDr]
add dx,es:[di.ylDr]
pop di ;restore caller's di
PO04:
; if ((*hpldr)->hpldrBack == hNil)
; {
; vhwwdOrigin = hpldr;
; return pt;
; }
;Assembler note: we have already performed vhwwdOrigin = hpldr above.
cmp [bx.hpldrBackPldr],hNil
je PO05
; pt.xp += (*hpldr)->ptOrigin.xp;
add ax,[bx.ptOriginPldr.xpPt]
; pt.yp += (*hpldr)->ptOrigin.yp;
add dx,[bx.ptOriginPldr.ypPt]
; idr = (*hpldr)->idrBack;
; hpldr = (*hpldr)->hpldrBack;
mov cx,[bx.idrBackPldr]
mov bx,[bx.hpldrBackPldr]
; }
jmp short PO01
;}
PO05:
cEnd
;End of PtOrigin
ifdef DEBUG
PO06:
; AssertH(hpl);
push ax
push bx
push cx
push dx
mov ax,midResn2
mov cx,1000
cCall AssertHForNative,<bx, ax, cx>
pop dx
pop cx
pop bx
pop ax
jmp short PO02
endif ;/* DEBUG */
; Debug (pdr = PdrFetch(hpldr, idr, &drfFetch));
PO07:
ifdef DEBUG
push ax
push bx
push cx
push dx
lea ax,[drfFetch]
push [vhwwdOrigin]
push cx
push ax
call far ptr S_PdrFetch
mov [pdr],ax
pop dx
pop cx
pop bx
pop ax
ret
endif ;DEBUG
; Assert (pdr->xl == hpdr->xl);
; Assert (pdr->yl == hpdr->yl);
; Debug (FreePdrf(&drfFetch));
ifdef DEBUG
PO08:
push ax
push bx
push cx
push dx
mov bx,[pdr]
mov ax,[bx.xlDr]
cmp ax,es:[di.xlDr]
je PO09
mov ax,midResn2
mov bx,1001 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PO09:
mov ax,[bx.ylDr]
cmp ax,es:[di.ylDr]
je PO10
mov ax,midResn2
mov bx,1002 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PO10:
lea ax,[drfFetch]
push ax
call far ptr S_FreePdrf
pop dx
pop cx
pop bx
pop ax
ret
endif ;DEBUG
;-------------------------------------------------------------------------
; FcFromPn(pn)
;-------------------------------------------------------------------------
; /* F C F R O M P N */
; native FC FcFromPn(pn)
; PN pn;
; {
; return (((FC) pn) << shftSector);
; %%Function:FcFromPn %%Owner:BRADV
PUBLIC FcFromPn
FcFromPn:
pop bx
pop cx ; ret add in cx:bx
pop ax
push cx
push bx
xor dx,dx
errnz <shftSector - 9>
xchg ah,dl
xchg al,ah
shl ax,1
rcl dx,1
; }
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PnFromFc(fc)
;-------------------------------------------------------------------------
; /* P N F R O M F C */
; native PN PnFromFc(fc)
; FC fc;
; {
; return ((PN) (fc >> shftSector));
; %%Function:PnFromFc %%Owner:BRADV
PUBLIC PnFromFc
PnFromFc:
pop bx
pop cx ; ret add in cx:bx
pop ax
pop dx
push cx
push bx
; Assert(fc < fcMax);
ifdef DEBUG
push ax
push bx
push cx
push dx
sub ax,LO_fcMax
sbb dx,HI_fcMax
jl PFF01
mov ax,midResn2
mov cx,1034
cCall AssertHForNative,<bx, ax, cx>
PFF01:
pop dx
pop cx
pop bx
pop ax
endif ;/* DEBUG */
mov al,ah
mov ah,dl
errnz <shftSector - 9>
shr dh,1
rcr ax,1
; }
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PstFromSttb(hsttb, i)
;-------------------------------------------------------------------------
; %%Function:PstFromSttb %%Owner:BRADV
ifdef DEBUG
PUBLIC PstFromSttb
PstFromSttb:
; Assert(!psttb->fExternal);
push ax
push bx
push cx
push dx
mov bx,sp
mov bx,[bx+14] ;/* hsttb */
mov bx,[bx]
test [bx.fExternalSttb],maskFExternalSttb
je PFS01
mov ax,midResn2
mov bx,1040 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PFS01:
pop dx
pop cx
pop bx
pop ax
jmp short HpstFromSttb
endif ;DEBUG
;-------------------------------------------------------------------------
; FStcpEntryIsNull(hsttb, stcp)
;-------------------------------------------------------------------------
;FStcpEntryIsNull(hsttb, stcp)
;struct STTB **hsttb;
;int stcp;
;{
; return(*(HpstFromSttb(hsttb, stcp)) == 255);
;}
; %%Function:FStcpEntryIsNull %%Owner:BRADV
PUBLIC FStcpEntryIsNull
FStcpEntryIsNull:
mov cx,1
db 03Dh ;turns next "xor cx,cx" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; HpstFromSttb(hsttb, i)
;-------------------------------------------------------------------------
;/* H P S T F R O M S T T B */
;/* Return huge pointer to string i in hsttb */
;NATIVE CHAR HUGE *HpstFromSttb(hsttb, i)
;struct STTB **hsttb;
;int i;
;{
; struct STTB *psttb = *hsttb;
; %%Function:HpstFromSttb %%Owner:BRADV
ifndef DEBUG
PUBLIC PstFromSttb
PstFromSttb:
endif ;!DEBUG
PUBLIC HpstFromSttb
HpstFromSttb:
xor cx,cx
HpstFromSttbCore:
pop ax
pop dx
mov bx,sp
xchg ax,[bx]
xchg dx,[bx+2]
mov bx,dx
; AssertH(hsttb);
; Assert(i < (*hsttb)->ibstMac);
ifdef DEBUG
inc bp
push bp
mov bp,sp ;set up bp chain for far call
push ds
push ax
push bx
push cx
push dx
push bx ;save hsttb
push ax ;save i
mov ax,midResn2
mov cx,1003
cCall AssertHForNative,<bx, ax, cx>
pop ax ;restore i
pop bx ;restore hsttb
mov bx,[bx]
cmp ax,[bx.ibstMacSttb]
jb HFS01
mov ax,midResn2
mov bx,1004 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
HFS01:
pop dx
pop cx
pop bx
pop ax
pop ds
pop bp
dec bp ;restore bp
push ds ;ds may now be a handle
push ss
pop ds ;restore valid ds
endif ;DEBUG
; if (!psttb->fExternal)
; return (CHAR HUGE *)((char *)(psttb->rgbst) + psttb->rgbst[i]);
; else
; {
; int HUGE *hprgbst = HpOfHq(psttb->hqrgbst);
; return (CHAR HUGE *)hprgbst + hprgbst[i];
; }
mov bx,[bx]
push di
;LN_LrgbstFromSttb takes psttb in bx and returns hrgbst in dx:di
;and lrgbst in es:di. Only dx, di, and es are altered.
call LN_LrgbstFromSttb
xchg ax,bx
shl bx,1
add di,es:[bx+di]
xchg ax,di
mov bl,[di.fStyleRulesSttb] ;needed by GetStFromSttbExit
pop di
ifdef DEBUG
pop ds ;restore segment handle
endif ;DEBUG
cmp cx,1
ja GetStFromSttbExit
jcxz HFS02
;This is actually the last part of FStcpEntryIsNull
xchg ax,bx
cmp bptr es:[bx],255
cmc
sbb ax,ax ;result is -1 if 255, 0 otherwise
HFS02:
;}
db 0CBh ;far ret
;-------------------------------------------------------------------------
; GetStFromSttb(hsttb, i, st)
;-------------------------------------------------------------------------
;/* G E T S T F R O M S T T B */
;/* Fetch the contents of i in hsttb into st. st must have sufficient
; space (up to cchMaxSt). */
;NATIVE GetStFromSttb(hsttb, i, st)
;struct STTB **hsttb;
;int i;
;CHAR *st;
;{
; CHAR HUGE *hpst = HpstFromSttb(hsttb, i);
; %%Function:GetStFromSttb %%Owner:BRADV
PUBLIC GetStFromSttb
GetStFromSttb:
pop ax
pop dx
pop cx ;st in cx
push dx
push ax
;does not alter cx, lpst returned in es:ax
jmp short HpstFromSttbCore
; if ((*hsttb)->fStyleRules && *hpst == 0xFF)
; st[0] = 0xFF; /* avoid GP-FAULTs */
; else
; bltbh(hpst, (CHAR HUGE *)st, *hpst+1);
;}
GetStFromSttbExit:
push si
push di
push ds ;save current ds (may now be a handle)
push es
pop ds
push ss
pop es
xchg ax,si
mov di,cx
mov cl,[si]
errnz <maskfStyleRulesSttb - 080h>
or bl,bl
jns GetStFromSttbStyleRules
cmp cl,0FFh
jne GetStFromSttbStyleRules
xor cl,cl
GetStFromSttbStyleRules:
xor ch,ch
inc cx
rep movsb
pop ds ;restore ds (possible a handle)
pop di
pop si
db 0CBh ;far ret
;-------------------------------------------------------------------------
; IbstFindSt(hsttb, st)
;-------------------------------------------------------------------------
;/* I B S T F I N D S T */
;EXPORT IbstFindSt(hsttb, st)
;struct STTB **hsttb;
;char *st;
;{
; struct STTB *psttb = *hsttb;
; int ibst;
; int cch = *st;
; CHAR HUGE *hpst2;
; %%Function:IbstFindSt %%Owner:BRADV
PUBLIC IbstFindSt
IbstFindSt:
pop ax
pop dx
pop cx
pop bx
push dx
push ax
; AssertH(hsttb);
; Assert(i < (*hsttb)->ibstMac);
ifdef DEBUG
inc bp
push bp
mov bp,sp ;set up bp chain for far call
push ds
push ax
push bx
push cx
push dx
mov ax,midResn2
mov cx,1005
cCall AssertHForNative,<bx, ax, cx>
pop dx
pop cx
pop bx
pop ax
pop ds
pop bp
dec bp ;restore bp
push ds ;ds may now be a handle
push ss
pop ds ;restore valid ds
endif ;DEBUG
mov bx,[bx]
mov ax,[bx.ibstMacSttb]
shl ax,1
push si
push di
;LN_LrgbstFromSttb takes psttb in bx and returns hrgbst in dx:di
;and lrgbst in es:di. Only dx, di, and es are altered.
call LN_LrgbstFromSttb
mov si,cx
mov cl,[si]
xor ch,ch
inc cx
xchg ax,dx
mov ax,-2
mov bx,ax
; for (ibst = 0; ibst < psttb->ibstMac; ibst++)
; {
; hpst2 = HpstFromSttb(hsttb, ibst);
; if (*hpst2 == cch && !FNeHprgch((CHAR HUGE *)st+1, hpst2+1,
; cch))
; return(ibst);
; }
; return(-1);
;}
IFS02:
inc bx
inc bx
cmp bx,dx
jae IFS03
push cx
push si
push di
add di,es:[bx+di]
repe cmpsb
pop di
pop si
pop cx
jne IFS02
xchg ax,bx
IFS03:
sar ax,1
pop di
pop si
ifdef DEBUG
pop ds ;restore segment handle
endif ;DEBUG
db 0CBh ;far ret
maskFreeAfterFetchLocal equ 001h
maskFreeBeforeFetchLocal equ 002h
;-------------------------------------------------------------------------
; PdrFetchAndFree(hpldr, idr, pdrf)
;-------------------------------------------------------------------------
;EXPORT struct DR *PdrFetchAndFree(hpldr, idr, pdrf)
;struct PLDR **hpldr;
;int idr;
;struct DRF *pdrf;
;{
; struct DR *pdr;
;
; pdr = PdrFetch(hpldr, idr, pdrf);
; FreePdrf(pdrf);
; return pdr;
;}
; %%Function:N_PdrFetchAndFree %%Owner:BRADV
PUBLIC N_PdrFetchAndFree
N_PdrFetchAndFree:
mov al,maskFreeAfterFetchLocal
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; PdrFreeAndFetch(hpldr, idr, pdrf)
;-------------------------------------------------------------------------
;EXPORT struct DR *PdrFreeAndFetch(hpldr, idr, pdrf)
;struct PLDR **hpldr;
;int idr;
;struct DRF *pdrf;
;{
;
; FreePdrf(pdrf);
; return PdrFetch(hpldr, idr, pdrf);
;}
; %%Function:N_PdrFreeAndFetch %%Owner:BRADV
PUBLIC N_PdrFreeAndFetch
N_PdrFreeAndFetch:
mov al,maskFreeBeforeFetchLocal
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; PdrFetch(hpldr, idr, pdrf)
;-------------------------------------------------------------------------
;EXPORT struct DR *PdrFetch(hpldr, idr, pdrf)
;struct PLDR **hpldr;
;int idr;
;struct DRF *pdrf;
;{
; struct DRF *pdrfList;
; %%Function:N_PdrFetch %%Owner:BRADV
PUBLIC N_PdrFetch
N_PdrFetch:
mov al,0
cProc PdrFetchEngine,<PUBLIC,FAR>,<si, di>
ParmW hpldr
ParmW idr
ParmW pdrf
LocalW wFlags
cBegin
mov bx,[pdrf]
mov bptr ([wFlags]),al
test al,maskFreeBeforeFetchLocal
je PFE01
;LN_FreePdrf takes a pdrf in bx and performs FreePdrf(pdrf);
;bx is not altered.
call LN_FreePdrf
PFE01:
ifdef DEBUG
push ax
push bx
push cx
push dx
; Assert (hpldr != hNil);
cmp [hpldr],hNil
jne PFE02
mov ax,midResn2
mov bx,1007 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PFE02:
; Assert (idr < (*hpldr)->idrMac);
mov bx,[hpldr]
mov bx,[bx]
mov ax,[bx.idrMacPldr]
cmp [idr],ax
jb PFE03
mov ax,midResn2
mov bx,1008 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PFE03:
;#ifdef DEBUG
; for (pdrfList = vpdrfHeadUnused;
; pdrfList != NULL; pdrfList = pdrfList->pdrfNext)
; {
; Assert (pdrfList->wLast == wLastDrf);
; Assert (pdrfList != pdrf);
; }
;#endif /* DEBUG */
mov bx,[vpdrfHeadUnused]
jmp short PFE06
PFE04:
cmp [bx.wLastDrf],0ABCDh
je PFE05
push bx ;save pdrfList
mov ax,midResn2
mov bx,1009 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
pop bx ;restore pdrfList
PFE05:
cmp bx,[pdrf]
jne PFE055
push bx ;save pdrfList
mov ax,midResn2
mov bx,1010 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
pop bx ;restore pdrfList
PFE055:
mov bx,[bx.pdrfNextDrf]
PFE06:
cmp bx,NULL
jne PFE04
; Debug (pdrf->wLast = wLastDrf);
mov bx,[pdrf]
mov [bx.wLastDrf],0ABCDh
pop dx
pop cx
pop bx
pop ax
endif ;DEBUG
; pdrf->hpldr = hpldr;
mov dx,[hpldr]
mov [bx.hpldrDrf],dx
; pdrf->idr = idr;
mov cx,[idr]
mov [bx.idrDrf],cx
; for (pdrfList = vpdrfHead; pdrfList != NULL; pdrfList = pdrfList->pdrfNext)
; {
mov si,[vpdrfHead]
jmp short PFE09
PFE08:
mov si,[si.pdrfNextDrf]
PFE09:
errnz <NULL>
or si,si
je PFE10
; Assert (pdrfList->wLast == wLastDrf);
; Assert (pdrfList != pdrf);
;Do these asserts with a call so as not to mess up short jumps
ifdef DEBUG
call PFE14
endif ;DEBUG
; if (pdrfList->hpldr == hpldr && pdrfList->idr == idr)
; {
cmp [si.hpldrDrf],dx
jne PFE08
cmp [si.idrDrf],cx
jne PFE08
; pdrf->pdrfUsed = pdrfList;
mov [bx.pdrfUsedDrf],si
;#ifdef DEBUG
; pdrf->pdrfNext = vpdrfHeadUnused;
; vpdrfHeadUnused = pdrf;
;#endif /* DEBUG */
ifdef DEBUG
push [vpdrfHeadUnused]
pop [bx.pdrfNextDrf]
mov [vpdrfHeadUnused],bx
endif ;DEBUG
; return &pdrfList->dr;
lea ax,[si.drDrf]
jmp short PFE12
; }
; }
PFE10:
; bltbh(HpInPl(hpldr, idr), &pdrf->dr, sizeof(struct DR));
;LN_LpInPl takes hplFoo in dx and iFoo in cx to
;return lpFoo in es:di. bx, cx and si are not altered.
call LN_LpInPl
mov si,di
push es
pop ds
lea di,[bx.drDrf]
push ss
pop es
errnz <cbDrMin AND 1>
mov cx,cbDrMin SHR 1
rep movsw
push ss
pop ds
; pdrf->pdrfUsed = NULL;
mov [bx.pdrfUsedDrf],NULL
; pdrf->pdrfNext = vpdrfHead;
; vpdrfHead = pdrf;
mov cx,bx
xchg [vpdrfHead],cx
mov [bx.pdrfNextDrf],cx
; if ((*hpldr)->fExternal && pdrf->dr.hplcedl)
; {
cmp [bx.drDrf.hplcedlDr],0
je PFE11
mov si,[hpldr]
mov si,[si]
cmp [si.fExternalPldr],fFalse
je PFE11
; pdrf->pplcedl = &(pdrf->dr.plcedl);
; pdrf->dr.hplcedl = &(pdrf->pplcedl);
lea si,[bx.pplcedlDrf]
mov [bx.drDrf.hplcedlDr],si
lea cx,[bx.drDrf.plcedlDr]
mov [si],cx
; }
PFE11:
; return &pdrf->dr;
lea ax,[bx.drDrf]
PFE12:
test bptr ([wFlags]),maskFreeAfterFetchLocal
je PFE13
;LN_FreePdrf takes a pdrf in bx and performs FreePdrf(pdrf);
;bx is not altered.
push ax ;save pdr
call LN_FreePdrf
pop ax ;restore pdr
PFE13:
;}
cEnd
; Assert (pdrfList->wLast == wLastDrf);
; Assert (pdrfList != pdrf);
;Do these asserts with a call so as not to mess up short jumps
ifdef DEBUG
PFE14:
push ax
push bx
push cx
push dx
cmp [si.wLastDrf],0ABCDh
je PFE15
mov ax,midResn2
mov bx,1011 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PFE15:
cmp si,bx
jne PFE16
mov ax,midResn2
mov bx,1012 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PFE16:
pop dx
pop cx
pop bx
pop ax
ret
endif ;DEBUG
;-------------------------------------------------------------------------
; FreePdrf(pdrf)
;-------------------------------------------------------------------------
;EXPORT FreePdrf(pdrf)
;struct DRF *pdrf;
;{
; struct DR *pdr;
; %%Function:N_FreePdrf %%Owner:BRADV
PUBLIC N_FreePdrf
N_FreePdrf:
pop ax
pop dx
pop bx
push dx
push ax
push si ;save caller's si
push di ;save caller's di
;LN_FreePdrf takes a pdrf in bx and performs FreePdrf(pdrf);
;bx is not altered.
call LN_FreePdrf
pop di ;restore caller's di
pop si ;restore caller's si
db 0CBh ;far ret
;LN_FreePdrf takes a pdrf in bx and performs FreePdrf(pdrf);
;bx is not altered.
LN_FreePdrf:
; Assert (pdrf->wLast == wLastDrf);
; Debug (pdrf->wLast = 0);
; Assert (pdrf->pdrfUsed != NULL || vpdrfHead == pdrf);
ifdef DEBUG
push ax
push bx
push cx
push dx
cmp [bx.wLastDrf],0ABCDh
je FP01
mov ax,midResn2
mov bx,1013 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
FP01:
mov [bx.wLastDrf],0
cmp [bx.pdrfUsedDrf],NULL
jne FP02
cmp bx,[vpdrfHead]
je FP02
mov ax,midResn2
mov bx,1014 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
FP02:
; if (pdrf->pdrfUsed == NULL)
; Assert(vpdrfHead == pdrf);
;#ifdef DEBUG
; else
; {
; Assert(vpdrfHeadUnused == pdrf);
; vpdrfHeadUnused = pdrf->pdrfNext;
; }
;#endif /* DEBUG */
cmp [bx.pdrfUsedDrf],NULL
jne FP04
cmp bx,[vpdrfHead]
je FP03
mov ax,midResn2
mov bx,1015 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
FP03:
jmp short FP06
FP04:
cmp bx,[vpdrfHeadUnused]
je FP05
mov ax,midResn2
mov bx,1016 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
FP05:
mov ax,[bx.pdrfNextDrf]
mov [vpdrfHeadUnused],ax
FP06:
pop dx
pop cx
pop bx
pop ax
endif ;DEBUG
; pdr = (pdrf->pdrfUsed == NULL ? &pdrf->dr : &pdrf->pdrfUsed->dr);
; bltbh(pdr, HpInPl(pdrf->hpldr, pdrf->idr), sizeof(struct DR));
;LN_LpInPl takes hplFoo in dx and iFoo in cx to
;return lpFoo in es:di. bx, cx and si are not altered.
mov dx,[bx.hpldrDrf]
mov cx,[bx.idrDrf]
call LN_LpInPl
mov si,[bx.pdrfUsedDrf]
errnz <NULL>
or si,si
jne FP07
; if (pdrf->pdrfUsed == NULL)
; vpdrfHead = pdrf->pdrfNext;
mov si,[bx.pdrfNextDrf]
mov [vpdrfHead],si
mov si,bx
FP07:
add si,(drDrf)
errnz <cbDrMin AND 1>
mov cx,cbDrMin SHR 1
rep movsw
ifdef DEBUG
; Debug (pdrf->dr.hplcedl = NULL);
; Debug (pdrf->pplcedl = NULL);
mov [bx.drDrf.hplcedlDr],NULL
mov [bx.pplcedlDrf],NULL
endif ;DEBUG
;}
ret
;-------------------------------------------------------------------------
; PInPl(hpl, i)
;-------------------------------------------------------------------------
; %%Function:PInPl %%Owner:BRADV
PUBLIC PInPl
PInPl:
ifdef DEBUG
; Assert(!ppl->fExternal);
push ax
push bx
push cx
push dx
mov bx,sp
mov bx,[bx+14] ;/* hpl */
mov bx,[bx]
cmp [bx.fExternalPl],fFalse
je PIP01
mov ax,midResn2
mov bx,1031 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
PIP01:
pop dx
pop cx
pop bx
pop ax
endif ;DEBUG
;fall through
;-------------------------------------------------------------------------
; HpInPl(hplFoo, iFoo)
;-------------------------------------------------------------------------
;int HUGE *HpInPl(hplFoo, iFoo)
;struct PL **hplFoo;
;int iFoo;
;{
; struct PL *pplFoo = *hplFoo;
; char *rgFoo;
;
; Assert (iFoo >= 0 && iFoo < pplFoo->iMac);
; rgFoo = ((char *)pplFoo) + pplFoo->brgfoo;
; if (pplFoo->fExternal)
; hpFoo = ((char HUGE *)HpOfHq(*((HQ *)rgFoo)));
; else
; hpFoo = ((char HUGE *)rgFoo);
; return hpFoo + iFoo * pplFoo->cb;
;}
; %%Function:HpInPl %%Owner:BRADV
PUBLIC HpInPl
HpInPl:
pop ax
pop bx
pop cx
pop dx
push bx
push ax
push di ;save caller's di
call LN_LpInPl
xchg ax,di
pop di ;restore caller's di
db 0CBh ;far ret
;LN_LpInPl takes hplFoo in dx and iFoo in cx to
;return lpFoo in es:di. bx, cx and si are not altered.
LN_LpInPl:
mov di,dx
mov di,[di]
ifdef DEBUG
or cx,cx
jge LIP01
push ax
push bx
push cx
push dx
mov ax,midResn2
mov bx,1017 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
pop dx
pop cx
pop bx
pop ax
LIP01:
cmp cx,[di.iMacPl]
jl LIP02
push ax
push bx
push cx
push dx
mov ax,midResn2
mov bx,1018 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
pop dx
pop cx
pop bx
pop ax
LIP02:
endif ;DEBUG
mov dx,[di.fExternalPl]
mov ax,[di.cbPl]
add di,[di.brgfooPl]
or dx,dx
;LN_LpFromPossibleHq takes pFoo in di, and if the zero flag is
;set then converts pFoo into lpFoo in es:di. If the zero flag
;is reset then it assumes pFoo points to an hqFoo, and converts
;the hqFoo to an lpFoo in es:di. In both cases hpFoo is left
;in dx:di. Only dx, di and es are altered.
call LN_LpFromPossibleHq
push dx ;save sb
mul cx
add di,ax
pop dx ;restore sb
ret
;-------------------------------------------------------------------------
; CchSz(sz)
;-------------------------------------------------------------------------
; Returns length of sz, including trailing 0
; %%Function:CchSz %%Owner:BRADV
PUBLIC CchSz
CchSz:
pop cx
pop dx ;far return address in dx:cx
pop bx
push dx
push cx
;CchSzNoFrame performs CchSz(bx), and sets es to ds.
;bx, dx, si, di are not altered.
CchSzNoFrame:
push ds
pop es
push di
mov di,bx
mov al,0
mov cx,0FFFFh
repne scasb
xchg ax,di
sub ax,bx
pop di
db 0CBh ;far ret
;-------------------------------------------------------------------------
; CchCopySz(pch1, pch2)
;-------------------------------------------------------------------------
;/* ****
;* Description: Copies string at pch1 to pch2i, including null terminator.
;* Returns number of chars moved, excluding null terminator.
;** **** */
;int CchCopySz(pch1, pch2)
;register PCH pch1;
;register PCH pch2;
;{
; int cch = 0;
; while ((*pch2++ = *pch1++) != 0)
; cch++;
; return cch;
;} /* end of C c h C o p y S z */
; %%Function:CchCopySz %%Owner:BRADV
PUBLIC CchCopySz
CchCopySz:
pop ax
pop cx
pop dx
pop bx
push cx
push ax
;CchSzNoFrame performs CchSz(bx), and sets es to ds.
;bx, dx, si, di are not altered.
push cs
call CchSzNoFrame
mov cx,ax
push si
push di
mov si,bx
mov di,dx
rep movsb
dec ax
pop di
pop si
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PchInSt(st, ch)
;-------------------------------------------------------------------------
;CHAR *PchInSt(st, ch)
;CHAR *st;
;int ch;
;{
; CHAR *pch, *pchEnd;
;
; for (pch = &st[1], pchEnd = &st[1] + st[0]; pch < pchEnd; pch++)
; {
; if (*pch == ch)
; return(pch);
; }
; return(NULL); /* character never found */
;}
; %%Function:PchInSt %%Owner:BRADV
PUBLIC PchInSt
PchInSt:
pop dx
pop cx
pop ax
pop bx
push cx
push dx
push ds
pop es
push di
mov di,bx
mov cl,[di]
xor ch,ch
inc di
repne scasb
xchg ax,di
pop di
jne PIS01
errnz <NULL>
dec ax
db 03Dh ;turns next "xor ax,ax" into "cmp ax,immediate"
PIS01:
xor ax,ax
db 0CBh ;far ret
maskfLowerLocal equ 1
maskfUpperLocal equ 2
maskfDigitLocal equ 4
;-------------------------------------------------------------------------
; FAlphaNum(ch)
;-------------------------------------------------------------------------
;/* F A L P H A N U M */
;FAlphaNum(ch)
;CHAR ch;
;{
; return FAlpha(ch) || FDigit(ch);
;}
; %%Function:FAlphaNum %%Owner:BRADV
PUBLIC FAlphaNum
FAlphaNum:
mov bl,maskfLowerLocal+maskfUpperLocal+maskfDigitLocal
db 03Dh ;turns next "mov bl,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; FDigit(ch)
;-------------------------------------------------------------------------
;/* ****
;* Description: Returns TRUE if ch is a digit, FALSE otherwise.
;** **** */
;FDigit(ch)
;CHAR ch;
;{
; return((uns)(ch - '0') <= ('9' - '0'));
;}
; %%Function:FDigit %%Owner:BRADV
PUBLIC FDigit
FDigit:
mov bl,maskfDigitLocal
db 03Dh ;turns next "mov bl,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; FAlpha(ch)
;-------------------------------------------------------------------------
;/* F A L P H A */
;/* ****
;* Description: Returns TRUE if ch is a letter, FALSE otherwise.
;* Note: DF and FF are treated as lowercase, even though they have no
;* corresponding uppercase.
;** **** */
;FAlpha(ch)
;CHAR ch;
;{
; return(FLower(ch) || FUpper(ch));
;}
; %%Function:FAlpha %%Owner:BRADV
PUBLIC FAlpha
FAlpha:
mov bl,maskfLowerLocal+maskfUpperLocal
db 03Dh ;turns next "mov bl,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; FUpper(ch)
;-------------------------------------------------------------------------
;/* ****
;* Description: Returns TRUE if ch is an uppercase letter, FALSE otherwise.
;** **** */
;
;NATIVE FUpper(ch)
;CHAR ch;
;{
; return (((uns)(ch - 'A') <= ('Z' - 'A')) ||
; /* foreign */
; ((uns)(ch - 0x00C0) <= (0x00D6 - 0x00C0)) ||
; ((uns)(ch - 0x00D8) <= (0x00DE - 0x00D8)));
;}
; %%Function:FUpper %%Owner:BRADV
PUBLIC FUpper
FUpper:
mov bl,maskfUpperLocal
db 03Dh ;turns next "mov bl,immediate" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; FLower(ch)
;-------------------------------------------------------------------------
;/* F L O W E R */
;/* ****
;* Description: Returns TRUE if ch is a lowercase letter, FALSE otherwise.
;* Note: even though DF and FF are lowercase, they have no
;* corresponding uppercase. They are included in the lowercase
;* set so they will appear as characters.
;** **** */
; /* this is not using ChUpper/ChLower because that would be very slow -
; you would generally need 2 calls to determine the case. Since the
; ANSI set is fairly immutable, we are doing it this way. (bz)
; */
;NATIVE FLower(ch)
;CHAR ch;
;{
; return (((uns)(ch - 'a') <= ('z' - 'a')) ||
; /* foreign */
; ((uns)(ch - 0x00DF) <= (0x00F6 - 0x00DF)) ||
; ((uns)(ch - 0x00F8) <= (0x00FF - 0x00F8)));
;}
; %%Function:FLower %%Owner:BRADV
PUBLIC FLower
FLower:
mov bl,maskfLowerLocal
FClassEngine:
pop cx
pop dx
pop ax
push dx
push cx
test bl,maskfLowerLocal
je FC01
; return (((uns)(ch - 'a') <= ('z' - 'a')) ||
sub al,'a'
cmp al,'z'-'a'+1
jc FC03
; /* foreign */
; ((uns)(ch - 0x00DF) <= (0x00F6 - 0x00DF)) ||
sub al,0DFh-'a'
cmp al,0F6h-0DFh+1
jc FC03
; ((uns)(ch - 0x00F8) <= (0x00FF - 0x00F8)));
sub al,0F8h-0DFh
cmp al,0FFh-0F8h+1
jc FC03
sub al,000h-0F8h
FC01:
test bl,maskfUpperLocal
je FC02
; return (((uns)(ch - 'A') <= ('Z' - 'A')) ||
sub al,'A'
cmp al,'Z'-'A'+1
jc FC03
; /* foreign */
; ((uns)(ch - 0x00C0) <= (0x00D6 - 0x00C0)) ||
sub al,0C0h-'A'
cmp al,0D6h-0C0h+1
jc FC03
; ((uns)(ch - 0x00D8) <= (0x00DE - 0x00D8)));
; ((uns)(ch - 0x00F8) <= (0x00FF - 0x00F8)));
sub al,0D8h-0C0h
cmp al,0DEh-0D8h+1
jc FC03
sub al,000h-0D8h
FC02:
test bl,maskfDigitLocal
je FC03
; return((uns)(ch - '0') <= ('9' - '0'));
sub al,'0'
cmp al,'9'-'0'+1
FC03:
sbb ax,ax
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PrcSet( prc, xpLeft, ypTop, xpRight, ypBottom )
;-------------------------------------------------------------------------
;struct RC *PrcSet( prc, xpLeft, ypTop, xpRight, ypBottom )
;struct RC *prc;
;{
; prc->xpLeft = xpLeft;
; prc->xpRight = xpRight;
; prc->ypTop = ypTop;
; prc->ypBottom = ypBottom;
;
; return prc;
;}
; %%Function:PrcSet %%Owner:BRADV
PUBLIC PrcSet
PrcSet:
;LN_StackAdjust is a helper routine to reduce the size of routines
;in resn.asm. It takes the number of words of arguments to
;the routine minus one in the byte following the call to LN_StackAdjust.
;It then moves the far return address and si and di to above the
;arguments, moves the top argument into bx, and puts the other arguments
;below the saved si and di. This allows the use of short pop register
;instructions to access arguments passed to the caller of LN_StackAdjust.
;ax, bx, cx, dx are altered.
call LN_StackAdjust
db 4
pop [bx.ypBottomRc]
pop [bx.xpRightRc]
pop [bx.ypTopRc]
pop [bx.xpLeftRc]
xchg ax,bx
pop di
pop si
db 0CBh ;far ret
;-------------------------------------------------------------------------
; FNeNcRgch(pch1, pch2, cch)
;-------------------------------------------------------------------------
;/* F N E N C R G C H */
;/* case insensitive rgch compare */
;FNeNcRgch(pch1, pch2, cch)
;CHAR *pch1, *pch2;
;int cch;
;{
; while(cch--)
; if (ChUpperLookup(*pch1++) != ChUpperLookup(*pch2++))
; return fTrue;
; return fFalse;
;}
; %%Function:FNeNcRgch %%Owner:BRADV
PUBLIC FNeNcRgch
FNeNcRgch:
;LN_StackAdjust is a helper routine to reduce the size of routines
;in resn.asm. It takes the number of words of arguments to
;the routine minus one in the byte following the call to LN_StackAdjust.
;It then moves the far return address and si and di to above the
;arguments, moves the top argument into bx, and puts the other arguments
;below the saved si and di. This allows the use of short pop register
;instructions to access arguments passed to the caller of LN_StackAdjust.
;ax, bx, cx, dx are altered.
call LN_StackAdjust
db 2
mov si,bx
pop cx
pop di
push wptr ([vitr.fFrenchItr])
mov [vitr.fFrenchItr],fTrue ;Simulate ChUpperLookup
jmp short FNNE03
;-------------------------------------------------------------------------
; FNeNcSz(sz1, sz2)
;-------------------------------------------------------------------------
;/* F N E N C S Z */
;/* case insensitive string compare */
;EXPORT FNeNcSz(sz1, sz2)
;CHAR *sz1, *sz2;
;{
; int cch = CchSz(sz1)-1;
; if (cch != CchSz(sz2)-1)
; return fTrue;
; return FNeNcRgch(sz1, sz2, cch);
;}
; %%Function:FNeNcSz %%Owner:BRADV
PUBLIC FNeNcSz
FNeNcSz:
db 0A8h ;turns next "stc" into "test al,immediate"
;also clears the carry flag
;-------------------------------------------------------------------------
; FNeNcSt(st1, st2)
;-------------------------------------------------------------------------
;/* F N E N C S T */
;/* case insensitive string compare */
;FNeNcSt(st1, st2)
;CHAR *st1, *st2;
;{
; int cch = *st1++;
; if (cch != *st2++)
; return fTrue;
; return FNeNcRgch(st1, st2, cch);
;}
; %%Function:FNeNcSt %%Owner:BRADV
PUBLIC FNeNcSt
FNeNcSt:
stc
FNeNcEngine:
pop ax
pop dx
pop cx
pop bx
push dx
push ax
push si
push di
push wptr ([vitr.fFrenchItr])
mov [vitr.fFrenchItr],fTrue ;Simulate ChUpperLookup
mov si,bx
mov di,cx
jc FNNE01
;CchSzNoFrame performs CchSz(bx), and sets es to ds.
;bx, dx, si, di are not altered.
push cs
call CchSzNoFrame
dec ax
push ax
mov bx,di
;CchSzNoFrame performs CchSz(bx), and sets es to ds.
;bx, dx, si, di are not altered.
push cs
call CchSzNoFrame
dec ax
pop cx
cmp ax,cx
jmp short FNNE02
FNNE01:
lodsb
mov cl,[di]
inc di
xor ch,ch
cmp al,cl
FNNE02:
jne FNNE05
FNNE03:
jcxz FNNE06
FNNE04:
;LN_ChUpper performs ChUpper(al). Only al and bx are altered.
lodsb
call LN_ChUpper
mov ah,al
mov al,[di]
inc di
;LN_ChUpper performs ChUpper(al). Only al and bx are altered.
call LN_ChUpper
cmp al,ah
loope FNNE04
je FNNE06
FNNE05:
db 0B8h ;turns next "xor ax,ax" into "mov ax,immediate"
FNNE06:
errnz <fFalse>
xor ax,ax
pop wptr ([vitr.fFrenchItr])
pop di
pop si
db 0CBh ;far ret
;-------------------------------------------------------------------------
; QszUpper(pch)
;-------------------------------------------------------------------------
;/* Q S Z U P P E R */
;/* upper case conversion using international rules (received from jurgenl 10-10-88 bz) */
;EXPORT QszUpper(pch)
;CHAR *pch;
;{
; for (; *pch; pch++)
; *pch = ChUpper(*pch);
;}
; %%Function:QszUpper %%Owner:BRADV
PUBLIC QszUpper
QszUpper:
pop cx
pop dx
pop bx
push dx
push cx
jmp short QU02
QU01:
push bx
;LN_ChUpper performs ChUpper(al). Only al and bx are altered.
call LN_ChUpper
pop bx
mov [bx],al
inc bx
QU02:
mov al,[bx]
or al,al
jne QU01
db 0CBh ;far ret
chFirstUpperTbl = 224
;#define chFirstUpperTbl (224)
;/* French upper case mapping table - only chars >= E0 (224) are mapped */
;csconst CHAR mpchupFrench[] = {
;/* E0 E1 E2 E3 E4 E5 E6 E7 */
; ch(65), ch(65), ch(65), ch(195), ch(196), ch(197), ch(198), ch(199),
;/* E8 E9 EA EB EC ED EE EF */
; ch(69), ch(69), ch(69), ch(69), ch(73), ch(73), ch(73), ch(73),
;/* F0 F1 F2 F3 F4 F5 F6 F7 */
; ch(208), ch(209), ch(79), ch(79), ch(79), ch(213), ch(214), ch(247),
;/* F8 F9 FA FB FC FD FE FF */
; ch(216), ch(85), ch(85), ch(85), ch(220), ch(221), ch(222), ch(255)
; };
mpchupFrench:
db 65,65,65,195,196,197,198,199
db 69,69,69,69,73,73,73,73
db 208,209,79,79,79,213,214,247
db 216,85,85,85,220,221,222,255
;-------------------------------------------------------------------------
; ChUpper(ch)
;-------------------------------------------------------------------------
; %%Function:ChUpper %%Owner:BRADV
PUBLIC ChUpper
ChUpper:
pop cx
pop dx
pop ax
push dx
push cx
;LN_ChUpper performs ChUpper(al). Only al and bx are altered.
call LN_ChUpper
db 0CBh ;far ret
;/* C H U P P E R */
;/* upper case conversion using international rules (received from jurgenl 10-10-88 bz) */
;EXPORT ChUpper(ch)
;int ch;
;{
; if ((uns)(ch - 'a') <= ('z' - 'a'))
; return (ch - ('a' - 'A'));
;LN_ChUpper performs ChUpper(al). Only al and bx are altered.
LN_ChUpper:
ifdef DEBUG
mov bx,[wFillBlock]
endif ;DEBUG
cmp al,'a'
jb CU01
cmp al,'z'
ja CU01
sub al,'a' - 'A'
CU01:
; else if (ch >= chFirstUpperTbl) /* intl special chars */
; {
cmp al,chFirstUpperTbl
jae CU02
ret
CU02:
; if (!vitr.fFrench)
; return ((ch == 247 || ch == 255) ? ch : ch - 32);
cmp [vitr.fFrenchItr],fFalse
jne CU04
cmp al,247
je CU03
cmp al,255
je CU03
sub al,32
CU03:
ret
; else
; return (mpchupFrench[ch - chFirstUpperTbl]);
CU04:
mov bx,offset [mpchupFrench - chFirstUpperTbl]
xlat cs:[bx]
ret
; }
; else
; return (ch);
;}
;-------------------------------------------------------------------------
; StandardChp(pchp)
;-------------------------------------------------------------------------
;/* S T A N D A R D C H P */
;/* creates most basic chp */
;NATIVE StandardChp(pchp)
;struct CHP *pchp;
;{
; SetWords(pchp, 0, cwCHP);
; pchp->hps = hpsDefault;
;}
;-------------------------------------------------------------------------
; StandardPap(ppap)
;-------------------------------------------------------------------------
;/* S T A N D A R D P A P */
;/* creates most basic pap */
;NATIVE StandardPap(ppap)
;struct PAP *ppap;
;{
; SetWords(ppap, 0, cwPAPBase);
;}
;-------------------------------------------------------------------------
; StandardSep(psep)
;-------------------------------------------------------------------------
;/* S T A N D A R D S E P */
;/* creates most basic sep */
;NATIVE StandardSep(psep)
;struct SEP *psep;
;{
;#define dxaCm 567
; SetWords(psep, 0, cwSEP);
; Mac( psep->dyaPgn = psep->dxaPgn = 36 * dyaPoint );
; if (vitr.fMetric)
; psep->dxaColumns = psep->dyaHdrTop = psep->dyaHdrBottom = NMultDiv(dxaCm, 5, 4);
; else
; psep->dxaColumns = psep->dyaHdrTop = psep->dyaHdrBottom = dxaInch / 2;
; /* psep->dxaColumnWidth = undefined */
; psep->bkc = bkcNewPage;
; psep->fEndnote = fTrue;
;}
dxaCm = 567
; %%Function:StandardChp %%Owner:BRADV
PUBLIC StandardChp
StandardChp:
errnz <cbChpMin AND 1>
mov cx,cbChpMin SHR 1
jmp short StandardStruct
; %%Function:StandardPap %%Owner:BRADV
PUBLIC StandardPap
StandardPap:
errnz <cbPapBase AND 1>
mov cx,cbPapBase SHR 1
jmp short StandardStruct
; %%Function:StandardSep %%Owner:BRADV
PUBLIC StandardSep
StandardSep:
errnz <cbSepMin AND 1>
mov cx,cbSepMin SHR 1
StandardStruct:
pop dx
pop bx
pop ax ;pstruct in ax
push bx
push dx
mov dx,cx ;save cw of struct
push di ;save caller's di
xchg ax,di
xor ax,ax
push ds
pop es
rep stosw
ife cbPapBase-cbChpMin
.err
endif
ife cbPapBase-cbSepMin
.err
endif
cmp dx,cbPapBase SHR 1
je SS02
ife cbChpMin-cbSepMin
.err
endif
cmp dx,cbChpMin SHR 1
jne SS01
; pchp->hps = hpsDefault;
mov [di.hpsChp - cbChpMin],hpsDefault
jmp short SS02
SS01:
; if (vitr.fMetric)
; psep->dxaColumns = psep->dyaHdrTop = psep->dyaHdrBottom = NMultDiv(5, dxaCm, 4);
; else
; psep->dxaColumns = psep->dyaHdrTop = psep->dyaHdrBottom = dxaInch / 2;
mov ax, dxaInch / 2
cmp [vitr.fMetricItr], fFalse
jz SS011
mov ax, 709 ; /* == NMultDiv(5, dxaCm, 4) */
SS011:
mov [di.dyaHdrTopSep - cbSepMin], ax
mov [di.dyaHdrBottomSep - cbSepMin], ax
mov [di.dxaColumnsSep - cbSepMin], ax
; psep->bkc = bkcNewPage;
mov [di.bkcSep - cbSepMin],bkcNewPage
; psep->fEndnote = fTrue;
mov [di.fEndnoteSep - cbSepMin],fTrue
SS02:
pop di ;restore caller's di
db 0CBh ;far ret
;-------------------------------------------------------------------------
; PmwdWw(ww)
;-------------------------------------------------------------------------
;/* P M W D W W */
;NATIVE struct MWD *PmwdWw(ww)
;{
;#ifdef DEBUG
; int mw;
; struct WWD **hwwd;
; struct MWD **hmwd;
; Assert(ww > wwNil && ww < wwMax && (hwwd = mpwwhwwd[ww]));
; mw = (*hwwd)->mw;
; Assert(mw > mwNil && mw < mwMax && (hmwd = mpmwhmwd[mw]));
; return *hmwd;
;#endif
; return *mpmwhmwd[(*mpwwhwwd[ww])->mw];
;}
; %%Function:N_PmwdWw %%Owner:BRADV
PUBLIC N_PmwdWw
N_PmwdWw:
mov cl,1
db 03Dh ;turns next "xor cx,cx" into "cmp ax,immediate"
;-------------------------------------------------------------------------
; HwwdWw(ww)
;-------------------------------------------------------------------------
;/* H W W D W W */
;NATIVE struct WWD **HwwdWw(ww)
;{
; Assert(ww > wwNil && ww < wwMax && mpwwhwwd[ww]);
; return mpwwhwwd[ww];
;}
; %%Function:N_HwwdWw %%Owner:BRADV
PUBLIC N_HwwdWw
N_HwwdWw:
xor cx,cx
pop ax
pop dx
pop bx
push dx
push ax
ifdef DEBUG
cmp bx,wwNil
jle PW01
cmp bx,wwMax
jge PW01
endif ;DEBUG
shl bx,1
mov ax,[bx.mpwwhwwd]
ifdef DEBUG
or ax,ax
jne PW02
PW01:
inc bp
push bp
mov bp,sp
push ds
push ax
push bx
push cx
push dx
mov ax,midResn2
mov bx,1019
cCall AssertProcForNative,<ax,bx>
pop dx
pop cx
pop bx
pop ax
pop ds
pop bp
dec bp
PW02:
endif ;DEBUG
jcxz PW05
xchg ax,bx
mov bx,[bx]
mov bx,[bx.mwWwd]
ifdef DEBUG
cmp bx,mwNil
jle PW03
cmp bx,mwMax
jge PW03
endif ;DEBUG
shl bx,1
mov bx,[bx.mpmwhmwd]
ifdef DEBUG
or bx,bx
jne PW04
PW03:
inc bp
push bp
mov bp,sp
push ds
push ax
push bx
push cx
push dx
mov ax,midResn2
mov bx,1020
cCall AssertProcForNative,<ax,bx>
pop dx
pop cx
pop bx
pop ax
pop ds
pop bp
dec bp
PW04:
endif ;DEBUG
mov ax,[bx]
PW05:
db 0CBh ;far ret
;-------------------------------------------------------------------------
; DrcToRc(pdrc, prc)
;-------------------------------------------------------------------------
;/* D R C T O R C - convert from drc-style rect into a rc-style rect */
;NATIVE DrcToRc(pdrc, prc)
;struct DRC *pdrc;
;struct RC *prc;
;{
; prc->ptTopLeft = pdrc->ptTopLeft;
; prc->ypBottom = prc->ypTop + pdrc->dyp;
; prc->xpRight = prc->xpLeft + pdrc->dxp;
;}
; %%Function:DrcToRc %%Owner:BRADV
PUBLIC DrcToRc
DrcToRc:
db 0A8h ;turns next "stc" into "test al,immediate"
;also clears the carry flag
;-------------------------------------------------------------------------
; RcToDrc(prc, pdrc)
;-------------------------------------------------------------------------
;/* R C T O D R C - convert from rc-style rect into a drc-style rect */
;NATIVE RcToDrc(prc, pdrc)
;struct RC *prc;
;struct DRC *pdrc;
;{
; pdrc->ptTopLeft = prc->ptTopLeft;
; pdrc->dxp = prc->xpRight - prc->xpLeft;
; pdrc->dyp = prc->ypBottom - prc->ypTop;
;}
PUBLIC RcToDrc
RcToDrc:
stc
pop dx
pop cx ;return address in dx:cx
pop bx
pop ax
push cx
push dx
push ds
pop es
push si
push di
xchg ax,si
mov di,bx
errnz <(xpDrc) - 0> ;if DrcToRc
errnz <(xpLeftRc) - 0> ;if RcToDrc
lodsw
errnz <(xpLeftRc) - 0> ;if DrcToRc
errnz <(xpDrc) - 0> ;if RcToDrc
stosw
xchg ax,cx
errnz <(ypDrc) - 2> ;if DrcToRc
errnz <(ypTopRc) - 2> ;if RcToDrc
lodsw
errnz <(ypTopRc) - 2> ;if DrcToRc
errnz <(ypDrc) - 2> ;if RcToDrc
stosw
xchg ax,dx
jnc DTRRTD01
neg cx ;negate xpLeftRc
neg dx ;negate ypTopRc
DTRRTD01:
errnz <(dxpDrc) - 4> ;if DrcToRc
errnz <(xpRightRc) - 4> ;if RcToDrc
lodsw
add ax,cx
errnz <(xpRightRc) - 4> ;if DrcToRc
errnz <(dxpDrc) - 4> ;if RcToDrc
stosw
errnz <(dypDrc) - 6> ;if DrcToRc
errnz <(ypBottomRc) - 6> ;if RcToDrc
lodsw
add ax,dx
errnz <(ypBottomRc) - 6> ;if DrcToRc
errnz <(dypDrc) - 6> ;if RcToDrc
stosw
pop di
pop si
db 0CBh ;far ret
bitIdrIsNeg1 equ 001h
bitCallPtOrigin equ 002h
bitUseVHwwdOrigin equ 004h
bitNegate equ 008h
bitFromDrc equ 010h
bitReturnY equ 020h
;/* R C L T O R C W - converts rect in frame coord. to rect in window coord */
;NATIVE RclToRcw(hpldr, prcl, prcw)
;struct PLDR **hpldr;
;struct RC *prcl;
;struct RC *prcw;
;{
; struct WWD *pwwd;
; int dxlToXw;
; int dylToYw;
; struct PT pt;
;
; pt = PtOrigin(hpldr, -1);
;
; pwwd = *vhwwdOrigin;
; dxlToXw = pwwd->rcePage.xeLeft + pwwd->xwMin + pt.xp;
; dylToYw = pwwd->rcePage.yeTop + pwwd->ywMin + pt.yp;
;
; prcw->xwLeft = prcl->xlLeft + dxlToXw;
; prcw->xwRight = prcl->xlRight + dxlToXw;
; prcw->ywTop = prcl->ylTop + dylToYw;
; prcw->ywBottom = prcl->ylBottom + dylToYw;
;}
; %%Function:RclToRcw %%Owner:BRADV
PUBLIC RclToRcw
RclToRcw:
mov al,bitIdrIsNeg1 + bitCallPtOrigin + bitUseVHwwdOrigin
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* R C W T O R C L - converts rect in window coord. to rect in page coord */
;NATIVE RcwToRcl(hpldr, prcw, prcl)
;struct PLDR **hpldr;
;struct RC *prcw;
;struct RC *prcl;
;{
; struct WWD *pwwd;
; struct PT pt;
; int dxwToXl, dywToYl;
;
; pt = PtOrigin(hpldr,-1);
; pwwd = *vhwwdOrigin;
; dxwToXl = pwwd->rcePage.xeLeft + pwwd->xwMin + pt.xp;
; dywToYl = pwwd->rcePage.yeTop + pwwd->ywMin + pt.yp;
;
; prcl->xlLeft = prcw->xwLeft - dxwToXl;
; prcl->xlRight = prcw->xwRight - dxwToXl;
; prcl->ylTop = prcw->ywTop - dywToYl;
; prcl->ylBottom = prcw->ywBottom - dywToYl;
;}
; %%Function:RcwToRcl %%Owner:BRADV
PUBLIC RcwToRcl
RcwToRcl:
mov al,bitIdrIsNeg1 + bitCallPtOrigin + bitUseVHwwdOrigin + bitNegate
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* R C W T O R C P */
;/* Converts rc in dr coords into rc in window coords */
;NATIVE RcwToRcp(hpldr/* or hwwd*/, idr, prcw, prcp)
;struct PLDR **hpldr;
;struct RC *prcp, *prcw;
;{
; struct PT pt;
; struct WWD *pwwd;
; int dxPToW, dyPToW;
;
; pt = PtOrigin(hpldr, idr);
;
; pwwd = *vhwwdOrigin;
; dxPToW = pwwd->rcePage.xeLeft + pwwd->xwMin + pt.xl;
; dyPToW = pwwd->rcePage.yeTop + pwwd->ywMin + pt.yl;
;
; prcp->xwLeft = prcw->xpLeft - dxPToW;
; prcp->xwRight = prcw->xwRight - dxPToW;
; prcp->ywTop = prcw->ywTop - dyPToW;
; prcp->ywBottom = prcw->ywBottom - dyPToW;
;}
; %%Function:RcwToRcp %%Owner:BRADV
PUBLIC RcwToRcp
RcwToRcp:
mov al,bitCallPtOrigin + bitUseVHwwdOrigin + bitNegate
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* R C P T O R C W */
;/* Converts rc in dr coords into rc in window coords */
;NATIVE RcpToRcw(hpldr/* or hwwd*/, idr, prcp, prcw)
;struct PLDR **hpldr;
;struct RC *prcp, *prcw;
;{
; struct PT pt;
; struct WWD *pwwd;
; int dxPToW, dyPToW;
;
; pt = PtOrigin(hpldr, idr);
;
; pwwd = *vhwwdOrigin;
; dxPToW = pwwd->rcePage.xeLeft + pwwd->xwMin + pt.xl;
; dyPToW = pwwd->rcePage.yeTop + pwwd->ywMin + pt.yl;
;
; prcw->xwLeft = prcp->xpLeft + dxPToW;
; prcw->xwRight = prcp->xwRight + dxPToW;
; prcw->ywTop = prcp->ywTop + dyPToW;
; prcw->ywBottom = prcp->ywBottom + dyPToW;
;}
; %%Function:RcpToRcw %%Owner:BRADV
PUBLIC RcpToRcw
RcpToRcw:
mov al,bitCallPtOrigin + bitUseVHwwdOrigin
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* R C E T O R C W */
;/* converts a page rectangle into window coordinates. */
;NATIVE RceToRcw(pwwd, prce, prcw)
;struct WWD *pwwd;
;struct RC *prce;
;struct RC *prcw;
;{
; int dxeToXw = pwwd->xwMin;
; int dyeToYw = pwwd->ywMin;
;
; prcw->xwLeft = prce->xeLeft + dxeToXw;
; prcw->xwRight = prce->xeRight + dxeToXw;
; prcw->ywTop = prce->yeTop + dyeToYw;
; prcw->ywBottom = prce->yeBottom + dyeToYw;
;}
; %%Function:RceToRcw %%Owner:BRADV
PUBLIC RceToRcw
RceToRcw:
mov al,bitIdrIsNeg1
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* D R C L T O R C W
;* Converts drc rect in page coord to rc rect in window coordinates */
;/* Useful for getting a rcw from a dr.drcl */
;NATIVE DrclToRcw(hpldr/*or hwwd*/, pdrcl, prcw)
;struct PLDR **hpldr;
;struct DRC *pdrcl;
;struct RC *prcw;
;{
; struct RC rcl;
; DrcToRc(pdrcl, &rcl);
; RclToRcw(hpldr, &rcl, prcw);
;}
; %%Function:DrclToRcw %%Owner:BRADV
PUBLIC DrclToRcw
DrclToRcw:
mov al,bitIdrIsNeg1 + bitCallPtOrigin + bitUseVHwwdOrigin + bitFromDrc
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* D R C P T O R C L
;* Converts drc rect in DR coordinates to rc rect in page coordinates
;/* Useful for getting a rcl from a edl.drcp
;/* WARNING - this translates to the outermost l coordinate system,
;/* not necessarily the immediately enclosing l system. 'Tis
;/* better to use the w coordinate system in most cases, since
;/* it is unambiguous.
;/**/
;NATIVE DrcpToRcl(hpldr, idr, pdrcp, prcl)
;struct PLDR **hpldr;
;int idr;
;struct DRC *pdrcp;
;struct RC *prcl;
;{
; struct PT pt;
; pt = PtOrigin(hpldr, idr);
;
; prcl->xlLeft = pdrcp->xp + pt.xl;
; prcl->xlRight = prcl->xlLeft + pdrcp->dxp;
; prcl->ylTop = pdrcp->yp + pt.yl;
; prcl->ylBottom = prcl->ylTop + pdrcp->dyp;
;}
; %%Function:DrcpToRcl %%Owner:BRADV
PUBLIC DrcpToRcl
DrcpToRcl:
mov al,bitCallPtOrigin + bitFromDrc
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* D R C P T O R C W
; Converts drc rect in DR coordinates to rc rect in window coordinates */
;/* Useful for getting a rcw from a edl.drcp */
;NATIVE DrcpToRcw(hpldr/*or hwwd*/, idr, pdrcp, prcw)
;struct PLDR **hpldr;
;int idr;
;struct DRC *pdrcp;
;struct RC *prcw;
;{
; struct RC rcl;
; int dxlToXw;
; int dylToYw;
; struct WWD *pwwd;
;
; DrcpToRcl(hpldr, idr, pdrcp, &rcl);
;/* native code note: vhwwdOrigin is known to have a 0 backpointer! */
; RclToRcw(vhwwdOrigin, &rcl, prcw);
;}
; %%Function:DrcpToRcw %%Owner:BRADV
PUBLIC DrcpToRcw
DrcpToRcw:
mov al,bitCallPtOrigin + bitUseVHwwdOrigin + bitFromDrc
; db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
test al,bitIdrIsNeg1
je RCTC01
push ax ;adjust sp
push ds
pop es
push si
push di
mov di,sp
add di,4
lea si,[di+2]
movsw
movsw
movsw
movsw ;make room for the idr
mov wptr [di],-1 ;set the idr to -1
pop di
pop si
RCTC01:
; %%Function:RcToRcCommon %%Owner:BRADV
cProc RcToRcCommon,<PUBLIC,FAR>,<si,di>
ParmW hpldr
ParmW idr
ParmW prcSrc
ParmW prcDest
cBegin
; dxeToXw = pwwd->xwMin;
; dyeToYw = pwwd->ywMin;
;Assembler note: use hpldr as pwwd if bitCallPtOrigin is false
mov bx,[hpldr]
test al,bitCallPtOrigin
jne RCTC02
mov cx,[bx.xwMinWwd]
mov dx,[bx.ywMinWwd]
RCTC02:
je RCTC03
push ax ;save flags
; pt = PtOrigin(hpldr, idr);
push bx
push [idr]
ifdef DEBUG
call far ptr S_PtOrigin
else ;not DEBUG
push cs
call near ptr N_PtOrigin
endif ;DEBUG
xchg ax,cx
pop ax ;restore flags
RCTC03:
test al,bitUseVHwwdOrigin
je RCTC04
; pwwd = *vhwwdOrigin;
; dxPToW = pwwd->rcePage.xeLeft + pwwd->xwMin + pt.xl;
; dyPToW = pwwd->rcePage.yeTop + pwwd->ywMin + pt.yl;
mov bx,[vhwwdOrigin]
mov bx,[bx]
add cx,[bx.rcePageWwd.xeLeftRc]
add cx,[bx.xwMinWwd]
add dx,[bx.rcePageWwd.yeTopRc]
add dx,[bx.ywMinWwd]
RCTC04:
test al,bitNegate
je RCTC05
neg cx
neg dx
RCTC05:
; prcl->xlLeft = pdrcp->xp + pt.xl;
; prcl->xlRight = prcl->xlLeft + pdrcp->dxp;
; prcl->ylTop = pdrcp->yp + pt.yl;
; prcl->ylBottom = prcl->ylTop + pdrcp->dyp;
xchg ax,bx
push ds
pop es
mov si,[prcSrc]
mov di,[prcDest]
errnz <(xpLeftRc) - 0>
lodsw
add ax,cx
errnz <(xpLeftRc) - 0>
stosw
test bl,bitFromDrc
je RCTC06
xchg ax,cx
RCTC06:
errnz <(ypTopRc) - 2>
lodsw
add ax,dx
errnz <(ypTopRc) - 2>
stosw
test bl,bitFromDrc
je RCTC07
xchg ax,dx
RCTC07:
errnz <(xpRightRc) - 4>
lodsw
add ax,cx
errnz <(xpRightRc) - 4>
stosw
errnz <(ypBottomRc) - 6>
lodsw
add ax,dx
errnz <(ypBottomRc) - 6>
stosw
cEnd
;NATIVE XwFromXl(hpldr, xl)
;struct PLDR *hpldr;
;{
; struct PT pt;
; int xw;
;
; pt = PtOrigin(hpldr, -1);
; xw = xl + pt.xl + (*vhwwdOrigin)->rcePage.xeLeft + (*vhwwdOrigin)->xwMin;
; return(xw);
;}
; %%Function:XwFromXl %%Owner:BRADV
PUBLIC XwFromXl
XwFromXl:
db 0A8h ;turns next "stc" into "test al,immediate"
;also clears the carry flag
;NATIVE YwFromYl(hpldr, yl)
;struct PLDR *hpldr;
;{
; struct PT pt;
; int yw;
;
; pt = PtOrigin(hpldr, -1);
; yw = yl + pt.yl + (*vhwwdOrigin)->rcePage.yeTop + (*vhwwdOrigin)->ywMin;
; return(yw);
;}
; %%Function:YwFromYl %%Owner:BRADV
PUBLIC YwFromYl
YwFromYl:
stc
pop dx
pop cx
pop bx
mov ax,-1
push ax
push bx
push cx
push dx
sbb al,al
and al,bitReturnY ;0 if XwFromXl, bitReturnY if YwFromYl
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;NATIVE YwFromYp(hpldr/*hwwd*/, idr, yp)
;struct PLDR **hpldr;
;int idr;
;int yp;
;{
; struct PT pt;
; int yw;
;
; pt = PtOrigin(hpldr, idr);
; yw = yp + (*vhwwdOrigin)->rcePage.yeTop + (*vhwwdOrigin)->ywMin + pt.yl;
; return(yw);
;}
; %%Function:YwFromYp %%Owner:BRADV
PUBLIC YwFromYp
YwFromYp:
mov al,bitReturnY
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* Y P F R O M Y W */
;NATIVE YpFromYw(hpldr/*hwwd*/, idr, yw)
;struct PLDR **hpldr;
;int idr;
;int yw;
;{
; struct PT pt;
; int yp;
;
; pt = PtOrigin(hpldr, idr);
; yp = yw - (*vhwwdOrigin)->rcePage.yeTop - (*vhwwdOrigin)->ywMin - pt.yl;
; return(yp);
;}
; %%Function:YpFromYw %%Owner:BRADV
PUBLIC YpFromYw
YpFromYw:
mov al,bitNegate + bitReturnY
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;/* X W F R O M X P */
;NATIVE XwFromXp(hpldr/*hwwd*/, idr, xp)
;struct PLDR **hpldr;
;int idr;
;int xp;
;{
; struct PT pt;
; int xw;
;
; pt = PtOrigin(hpldr, idr);
; xw = xp + (*vhwwdOrigin)->rcePage.xeLeft + (*vhwwdOrigin)->xwMin + pt.xl;
; return(xw);
;}
; %%Function:XwFromXp %%Owner:BRADV
PUBLIC XwFromXp
XwFromXp:
mov al,0
db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
;//* X P F R O M X W */
;NATIVE XpFromXw(hpldr/*hwwd*/, idr, xw)
;struct PLDR **hpldr;
;int idr;
;int xw;
;{
; struct PT pt;
; int xp;
;
; pt = PtOrigin(hpldr, idr);
; xp = xw - (*vhwwdOrigin)->rcePage.xeLeft - (*vhwwdOrigin)->xwMin - pt.xl;
; return(xp);
;}
; %%Function:XpFromXw %%Owner:BRADV
PUBLIC XpFromXw
XpFromXw:
mov al,bitNegate
; db 03Dh ;turns next "mov al,immediate" into "cmp ax,immediate"
; %%Function:XOrYFromXOrY %%Owner:BRADV
cProc XOrYFromXOrY,<PUBLIC,FAR>,<>
ParmW hpldr
ParmW idr
ParmW XOrY
cBegin
push ax ;save flags
; pt = PtOrigin(hpldr, idr);
push [hpldr]
push [idr]
ifdef DEBUG
call far ptr S_PtOrigin
else ;not DEBUG
push cs
call near ptr N_PtOrigin
endif ;DEBUG
xchg ax,cx
pop ax ;restore flags
; pwwd = *vhwwdOrigin;
; dxPToW = pwwd->rcePage.xeLeft + pwwd->xwMin + pt.xl;
; dyPToW = pwwd->rcePage.yeTop + pwwd->ywMin + pt.yl;
mov bx,[vhwwdOrigin]
mov bx,[bx]
add cx,[bx.rcePageWwd.xeLeftRc]
add cx,[bx.xwMinWwd]
add dx,[bx.rcePageWwd.yeTopRc]
add dx,[bx.ywMinWwd]
test al,bitNegate
je XOYFXOY02
neg cx
neg dx
XOYFXOY02:
add cx,[XOrY]
add dx,[XOrY]
test al,bitReturnY
jne XOYFXOY03
mov dx,cx
XOYFXOY03:
xchg ax,dx
cEnd
;-------------------------------------------------------------------------
; FSectRc( prc1, prc2, prcDest )
;-------------------------------------------------------------------------
; %%FunctioN:FSectRc %%Owner:BRADV
cProc FSectRc,<PUBLIC,FAR,ATOMIC>,<si,di>
ParmW prc1
ParmW prc2
ParmW prcDest
; /* F S E C T R C */
; /* prcDest gets the rectangle that is the intersection of prc1 and prc2. */
; /* Return value is TRUE iff prcDest is non-null */
; /* case when prcDest == prc1 OR prcDest == prc2 */
; native FSectRc( prc1, prc2, prcDest )
; struct RC *prc1, *prc2, *prcDest;
; {
cBegin
; Assert( prcDest != NULL );
ifdef DEBUG
cmp [prcDest],0
jnz FSR01
push ax
push bx
push cx
push dx
mov ax,midResn2
mov bx,1024
cCall AssertProcForNative,<ax, bx>
pop dx
pop cx
pop bx
pop ax
FSR01:
endif ;DEBUG
mov si,[prc1]
mov di,[prc2]
mov bx,[prcDest]
;Assembler note: instead of doing all of this checking, just
;compute the result rc, and see if it is not empty
; if (!FEmptyRc( prc1 ) && !FEmptyRc( prc2 ) &&
; prc1->xpRight > prc2->xpLeft && prc2->xpRight > prc1->xpLeft &&
; prc1->ypBottom > prc2->ypTop && prc2->ypBottom > prc1-> ypTop)
; {
push ds
pop es
; prcDest->xpLeft = max( prc1->xpLeft, prc2->xpLeft );
; prcDest->ypTop = max( prc1->ypTop, prc2->ypTop );
errnz <(xpLeftRc) - 0>
errnz <(ypTopRc) - 2>
xor cx,cx
db 03Ch ;turns next "inc cx" into "cmp al,immediate"
FSR02:
inc cx
lodsw
scasw
jge FSR03
mov ax,[di-2]
FSR03:
mov [bx],ax
inc bx
inc bx
jcxz FSR02
; prcDest->xpRight = min( prc1->xpRight, prc2->xpRight );
; prcDest->ypBottom = min( prc1->ypBottom, prc2->ypBottom );
errnz <(xpRightRc) - 4>
errnz <(ypBottomRc) - 6>
xor cx,cx
db 03Ch ;turns next "inc cx" into "cmp al,immediate"
FSR04:
inc cx
lodsw
scasw
jle FSR05
mov ax,[di-2]
FSR05:
mov [bx],ax
inc bx
inc bx
jcxz FSR04
; return fTrue;
; }
; Assembler note: replace above test for
;
; if (!FEmptyRc( prc1 ) && !FEmptyRc( prc2 ) &&
; prc1->xpRight > prc2->xpLeft && prc2->xpRight > prc1->xpLeft &&
; prc1->ypBottom > prc2->ypTop && prc2->ypBottom > prc1-> ypTop)
;
; with a call to FNotEmptyPrc for the result rectangle
sub bx,cbRcMin
;LN_FNotEmptyPrc takes prc in bx and returns the result in ax
;Only ax and cx are altered.
call LN_FNotEmptyRc
jne FSR07
; SetWords( prcDest, 0, cwRC );
mov di,bx
mov cx,cwRC
rep stosw
; return fFalse;
FSR07:
; }
cEnd
;-------------------------------------------------------------------------
; FEmptyRc( prc )
;-------------------------------------------------------------------------
; /* F E M P T Y R C */
; native FEmptyRc( prc )
; struct RC *prc;
; { /* Return TRUE if the passed rect is empty (0 or negative height or width),
; FALSE otherwise. */
; %%Function:FEmptyRc %%Owner:BRADV
PUBLIC FEmptyRc
FEmptyRc:
pop ax
pop dx
pop bx
push dx
push ax
xor ax,ax
or bx,bx
je FER01
call LN_FNotEmptyRc
FER01:
inc ax
db 0CBh ;far ret
;LN_FNotEmptyPrc takes prc in bx and returns the result in ax
;Only ax and cx are altered.
LN_FNotEmptyRc:
; return !((prc == NULL) ||
; (prc->xpLeft >= prc->xpRight) ||
; (prc->ypTop >= prc->ypBottom));
errnz <fFalse>
xor ax,ax
mov cx,[bx.xpLeftRc]
cmp cx,[bx.xpRightRc]
jge FEP1
mov cx,[bx.ypTopRc]
cmp cx,[bx.ypBottomRc]
jge FEP1
dec ax
FEP1:
or ax,ax
; }
ret
;-----------------------------------------------------------------------------
; FSetRgchDiff (pchBase,pchNew, pchDiff,cch) - compare 2 even sized char arrays,
; setting a non-zero value into the corresponding fields of a 3rd such
; array. The 3rd array is assumed to have been set to 0's befire this routine
; was called. Returns non-zero if any differences were detected.
;
; This is an implementation of the following C code:
;
; /* how this works:
; Each word of the 2 test arrays in XOR'ed together. If they are the same,
; the result is 0, else non zero. The result is then OR'ed into the
; difference array, effectively turning on bits in any fields where there
; is a difference. The field in the difference array can then be tested
; for non-zero to see if it was different in the 2 arrays.
;
; We also keep an indicator, fDiff, originally set to 0, which gets
; or'ed into, so we can tell easily if ANY differences were detected.
; */
;
; while (cch--)
; {
; *pchDiff++ |= (chT = *pchBase++ ^ *pchNew++);
; fDiff |= chT;
; }
;
; return (fDiff != 0);
;}
;
;-----------------------------------------------------------------------------
; %%Function:FSetRgchDiff %%Owner:BRADV
cProc FSetRgchDiff,<FAR,PUBLIC,ATOMIC>,<SI,DI>
parmDP <pchBase>
parmDP <pchNew>
parmDP <pchDiff>
parmW <cch>
;/* **** -+-utility-+- **** */
cBegin
mov si,[pchBase]
mov di,[pchNew]
mov bx,[pchDiff]
mov cx,[cch]
xor dx,dx ;fDiff
shr cx,1
jnc FSRD01
lodsb ; value in pchBase into ax, increment si
xor al,[di] ; xor pchBase with pchNew
inc di
or [bx],al ; result into pchDiff
inc bx
or dl,al ; or result into fDiff
FSRD01:
jcxz FSRD03 ;cch == 0 ? finished
FSRD02:
lodsw ; value in pchBase into ax, increment si
xor ax,[di] ; xor pchBase with pwNew
inc di
inc di
or [bx],ax ; result into pchDiff
inc bx
inc bx
or dx,ax ; or result into fDiff
loop FSRD02 ; loop if cch-- != 0
FSRD03:
xchg ax,dx
cEnd
;-------------------------------------------------------------------------
; IScanLprgw( lprgw, w, iwMax )
;-------------------------------------------------------------------------
;/* I S C A N L P R G W */
;NATIVE IScanLprgw( lprgw, w, iwMax )
;WORD far *lprgw;
;WORD w;
;int iwMax;
;{
; int iw;
;
; for ( iw = 0 ; iw < iwMax ; iw++, lprgw++ )
; if (*lprgw == w)
; return iw;
;
; return iNil;
;}
; %%Function:IScanLprgw %%Owner:BRADV
PUBLIC IScanLprgw
IScanLprgw:
mov bx,sp
push di ;save caller's di
les di,[bx+8]
mov ax,[bx+6]
mov cx,[bx+4]
mov dx,cx
repne scasw
je ISL01
;Assembler note: we know cx is zero at this point
errnz <iNil - (-1)>
mov cx,dx
ISL01:
sub dx,cx
dec dx
xchg ax,dx
pop di ;restore caller's di
db 0CAh, 008h, 000h ;far ret pop 8 bytes
;-------------------------------------------------------------------------
; CchNonZeroPrefix(rgb, cbMac)
;-------------------------------------------------------------------------
; /* C C H N O N Z E R O P R E F I X */
; /* returns the cbMac reduced over the trailing zeroes in rgb. This is
; the number of non-zero previx characters.
; */
; native int CchNonZeroPrefix(rgb, cbMac)
; char *rgb;
; int cbMac;
; {
; %%Function:CchNonZeroPrefix %%Owner:BRADV
PUBLIC CchNonZeroPrefix
CchNonZeroPrefix:
pop ax
pop dx
pop cx
pop bx
push dx
push ax
push di ;save caller's di
; for (rgb += cbMac - 1; cbMac > 0 && *rgb == 0; rgb--, cbMac--)
; ;
push ds
pop es
mov di,bx
add di,cx
dec di
xor ax,ax
std
repe scasb
cld
je CNZP01
inc cx
CNZP01:
; return(cbMac);
xchg ax,cx
; }
pop di ;restore caller's di
db 0CBh ;far ret
;-------------------------------------------------------------------------
; CchCopyLpszCchMax(lpch1, lpch2, cchMax)
;-------------------------------------------------------------------------
;/* C C H C O P Y L P S Z C C H M A X */
;/* Copy one sz to another, but not more than cchMax characters (incl '\0') */
;/* %%Function:CchCopyLpszCchMax %%Owner:rosiep */
;int CchCopyLpszCchMax(lpch1, lpch2, cchMax)
;char far *lpch1;
;char far *lpch2;
;int cchMax;
;{
; int cch = 0;
; while (cch < cchMax && (*lpch2++ = *lpch1++) != 0)
; cch++;
;
; /* make sure it's null-terminated if we overflowed buffer */
; if (cch == cchMax)
; *(lpch2-1) = '\0';
;
; return cch;
;}
cProc CchCopyLpszCchMax,<FAR,PUBLIC,ATOMIC>,<si,di>
parmD <lpch1>
parmD <lpch2>
parmW <cchMax>
cBegin
les di,[lpch1]
push di
mov al,0
mov cx,0FFFFh
repne scasb
pop si
push es
pop ds
sub di,si
mov cx,[cchMax]
cmp cx,di
jbe CCLCM01
mov cx,di
CCLCM01:
push cx
les di,[lpch2]
rep movsb
push ss
pop ds
dec di
stosb
pop ax
cEnd
;/* I B S T F I N D S Z F F N */
;/* **** +-+utility+-+string **** */
;/* ****
;* Description: Given an hsttb of ffn's and a pointer to an ffn, return
;* the ibst for the string that matches the szFfn portion of the ffn,
;* ignoring the ffid portion. If no match, return iNil.
;* This is a variant of IbstFindSt in sttb.c.
;*
;* This routine assumes user input of font names and so it does
;* a CASE-INSENSITIVE string compare. It no longer
;* assumes you have already tested for the name "Default" since Tms Rmn
;* is now the default font, so we start looking at 0
;*
;** **** */
;
;/* %%Function: IbstFindSzFfn %%Owner: davidlu */
;
;EXPORT IbstFindSzFfn(hsttb, pffn)
;struct STTB **hsttb;
;struct FFN *pffn;
;{
; struct STTB *psttb = *hsttb;
; char *st2;
; int ibst;
PUBLIC N_IbstFindSzFfn
N_IbstFindSzFfn:
pop ax
pop dx
pop cx ;pffn
pop bx ;hsttb
push dx
push ax
push di ;save caller's di
push si ;save caller's si
mov di,cx
add di,(szFfn)
mov bx,[bx]
; Assert(!(*hsttb)->fExternal);
ifdef DEBUG
push ax
push bx
push cx
push dx
test [bx.fExternalSttb],maskFExternalSttb
je IFSF01
mov ax,midResn2
mov bx,1041 ;label # for native assert
cCall AssertProcForNative, <ax, bx>
IFSF01:
pop dx
pop cx
pop bx
pop ax
endif ;DEBUG
; for (ibst = 0; ibst < psttb->ibstMac; ibst++)
; {
xor si,si
mov dx,[bx.ibstMacSttb]
shl dx,1
add bx,(rgbstSttb)
IFSF02:
errnz <iNil - (-1)>
xor ax,ax
cmp si,dx
jae IFSF04
; st2 = PstFromSttb(hsttb, ibst);
push bx ;save &psttb->rgbst
;***Begin in-line PstFromSttb (assume !fExternal)
add bx,[bx+si]
;***End in-line PstFromSttb (assume !fExternal)
; if ( *st2 == *(CHAR *)pffn &&
mov al,[bx]
sub al,[di-(szFfn)]
jne IFSF03
; !FNeNcRgch(pffn->szFfn, ((struct FFN *)st2)->szFfn,
; CbSzOfPffn(pffn) - 1) )
;Call FNeNcSz here rather than FNeNcRgch to save code in the
;assembler version.
push dx ;save 2*ibstMac
add bx,(szFfn)
push di
push bx
push cs
call near ptr FNeNcSz
pop dx ;restore 2*ibstMac
IFSF03:
; return(ibst);
pop bx ;restore &psttb->rgbst
; }
inc si
inc si
or ax,ax
jne IFSF02
xchg ax,si
shr ax,1
; return(iNil);
;}
IFSF04:
dec ax
pop si ;restore caller's si
pop di ;restore caller's di
db 0CBh ;far ret
sEnd resn2
end
|
sources/glew/opengl-contexts.adb | godunko/adagl | 6 | 29746 | <reponame>godunko/adagl
------------------------------------------------------------------------------
-- --
-- Ada binding for OpenGL/WebGL --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2018-2020, <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 <NAME>, 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. --
-- --
------------------------------------------------------------------------------
with Interfaces.C.Strings;
with System.Storage_Elements;
with GLEW;
package body OpenGL.Contexts is
Current : OpenGL_Context_Access;
------------
-- Create --
------------
function Create
(Self : in out OpenGL_Context'Class)
return Boolean
is
use GLFW;
function glewInit return Interfaces.C.unsigned
with Import, Convention => C, External_Name => "glewInit";
name : Interfaces.C.char_array := Interfaces.C.To_C ("Aaa");
ko : Interfaces.C.int;
ok : Interfaces.C.unsigned;
begin
ko := glfwInit;
pragma Assert (ko in 1);
Self.Window := glfwCreateWindow (640, 480, name, null, null);
Self.Make_Current;
ok := glewInit;
pragma Assert (ok in 0);
return True;
end Create;
------------
-- Create --
------------
procedure Create
(Self : in out OpenGL_Context'Class)
is
begin
if not Self.Create then
raise Program_Error with "Create fails";
end if;
end Create;
---------------
-- Functions --
---------------
function Functions
(Self : in out OpenGL_Context'Class)
return access OpenGL.Functions.OpenGL_Functions'Class
is
begin
return Self.Functions'Unchecked_Access;
end Functions;
------------------
-- Make_Current --
------------------
procedure Make_Current (Self : in out OpenGL_Context'Class) is
begin
Current := Self'Unchecked_Access;
GLFW.glfwMakeContextCurrent (Self.Window);
end Make_Current;
---------------------
-- Current_Context --
---------------------
function Current_Context return OpenGL_Context_Access is
begin
return Current;
end Current_Context;
------------------
-- My_Functions --
------------------
package body My_Functions is
----------------
-- Blend_Func --
----------------
overriding procedure Blend_Func
(Self : My_Functions;
Source_Factor : OpenGL.GLenum;
Destination_Factor : OpenGL.GLenum)
is
begin
GLEW.glBlendFunc (Source_Factor, Destination_Factor);
end Blend_Func;
-----------
-- Clear --
-----------
overriding procedure Clear
(Self : My_Functions;
Mask : OpenGL.Clear_Buffer_Mask) is
begin
GLEW.glClear (Mask);
end Clear;
-----------------
-- Clear_Color --
-----------------
overriding procedure Clear_Color
(Self : My_Functions;
Red : OpenGL.GLfloat;
Green : OpenGL.GLfloat;
Blue : OpenGL.GLfloat;
Alpha : OpenGL.GLfloat) is
begin
GLEW.glClearColor (Red, Green, Blue, Alpha);
end Clear_Color;
-----------------
-- Clear_Depth --
-----------------
procedure Clear_Depth
(Self : My_Functions;
Depth : OpenGL.GLfloat) is
begin
GLEW.glClearDepth (OpenGL.GLdouble (Depth));
end Clear_Depth;
----------------
-- Depth_Func --
----------------
overriding procedure Depth_Func
(Self : My_Functions;
Func : OpenGL.GLenum) is
begin
GLEW.glDepthFunc (Func);
end Depth_Func;
-------------
-- Disable --
-------------
overriding procedure Disable
(Self : My_Functions;
Capability : OpenGL.GLenum) is
begin
GLEW.glDisable (Capability);
end Disable;
-----------------
-- Draw_Arrays --
-----------------
overriding procedure Draw_Arrays
(Self : My_Functions;
Mode : OpenGL.GLenum;
First : OpenGL.GLint;
Count : OpenGL.GLsizei) is
begin
GLEW.glDrawArrays (Mode, First, Count);
end Draw_Arrays;
-------------------
-- Draw_Elements --
-------------------
procedure Draw_Elements
(Self : My_Functions;
Mode : OpenGL.GLenum;
Count : OpenGL.GLsizei;
Data_Type : OpenGL.GLenum;
Offset : OpenGL.GLintptr) is
begin
GLEW.glDrawElements
(Mode,
Count,
Data_Type,
System.Storage_Elements.To_Address
(System.Storage_Elements.Integer_Address (Offset)));
end Draw_Elements;
------------
-- Enable --
------------
overriding procedure Enable
(Self : My_Functions;
Capability : OpenGL.GLenum) is
begin
GLEW.glEnable (Capability);
end Enable;
------------
-- Finish --
------------
overriding procedure Finish (Self : My_Functions) is
begin
GLEW.glFinish;
end Finish;
-----------
-- Flush --
-----------
overriding procedure Flush (Self : My_Functions) is
begin
GLEW.glFlush;
end Flush;
--------------
-- Viewport --
--------------
overriding procedure Viewport
(Self : My_Functions;
X : OpenGL.GLint;
Y : OpenGL.GLint;
Width : OpenGL.GLsizei;
Height : OpenGL.GLsizei)
is
begin
GLEW.glViewport (X, Y, Width, Height);
end Viewport;
end My_Functions;
end OpenGL.Contexts;
|
libsrc/_DEVELOPMENT/stdlib/c/sccz80/_div__callee.asm | meesokim/z88dk | 0 | 85940 | <reponame>meesokim/z88dk
; void _div_(div_t *d, int numer, int denom)
SECTION code_stdlib
PUBLIC _div__callee
EXTERN asm__div
_div__callee:
pop af
pop de
pop hl
pop bc
push af
jp asm__div
|
other.7z/SFC.7z/SFC/ソースデータ/ゼルダの伝説神々のトライフォース/ドイツ_PAL/Ger_asm1/zel_msge3.asm | prismotizm/gigaleak | 0 | 241866 | <gh_stars>0
Name: zel_msge3.asm
Type: file
Size: 23717
Last-Modified: '2016-05-13T04:23:03Z'
SHA-1: 18534347DDD1AC2031744C88E751A81042DBF75F
Description: null
|
programs/oeis/024/A024042.asm | neoneye/loda | 22 | 244416 | <reponame>neoneye/loda
; A024042: a(n) = 4^n - n^6.
; 1,3,-48,-665,-3840,-14601,-42560,-101265,-196608,-269297,48576,2422743,13791232,62282055,260905920,1062351199,4278190080,17155731615,68685464512,274830861063,1099447627776,4397960744983,17592072664512,70368596141775,281474785607680,1125899662701999,4503599318454720,18014398122061495,72057593556037632,288230375556888423,1152921503877846976,4611686017539884223,18446744072635809792,73786976293546738495,295147905177808021440,1180591620715573037799,4722366482867468431360,18889465931476015128375,75557863725911312482752,302231454903653774932783,1208925819614625078706176,4835703278458511948720463,19342813113834061306267072,77371252455336260859832215,309485009821345061468467200,1237940039285380266595358599,4951760157141521090122200000,19807040628566084387606772255,79228162514264337581313359872,316912650057057350360334514143,1267650600228229401481078205376,5070602400912917605969216533703,20282409603651670423927480676352,81129638414606681695766840782935,324518553658426726783131225664960,1298074214633706907132596401664399,5192296858534827628530465488240640,20769187434139310514121951020433135,83076749736557242056487903198828992,332306998946228968225951722889552503
mov $1,4
pow $1,$0
pow $0,6
add $0,1
sub $1,$0
add $1,1
mov $0,$1
|
programs/oeis/118/A118513.asm | neoneye/loda | 22 | 160074 | <filename>programs/oeis/118/A118513.asm<gh_stars>10-100
; A118513: Define sequence S_m by: initial term = m, reverse digits and add 1 to get next term. Entry shows S_13. This reaches a cycle of length 9 in 15 steps.
; 13,32,24,43,35,54,46,65,57,76,68,87,79,98,90,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10
mov $2,$0
mov $0,13
lpb $2
seq $0,4086 ; Read n backwards (referred to as R(n) in many sequences).
add $0,1
sub $2,1
lpe
|
data/pokemon/dex_entries/shedinja.asm | AtmaBuster/pokeplat-gen2 | 6 | 245769 | db "SHED@" ; species name
db "A strange #MON-"
next "it flies without"
next "moving its wings,"
page "has a hollow shell"
next "for a body, and"
next "does not breathe.@"
|
src/rings.ads | PThierry/ewok-kernel | 0 | 6140 | <filename>src/rings.ads
--
-- Copyright 2018 The wookey project team <<EMAIL>>
-- - <NAME>
-- - <NAME>
-- - <NAME>
-- - <NAME>
-- - <NAME>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
--
-- Ring buffer generic implementation
--
generic
type object is private;
size : in integer := 512;
package rings is
pragma Preelaborate;
type ring is private;
type ring_state is (EMPTY, USED, FULL);
procedure init
(r : out ring);
-- write some new data and increment top counter
procedure write
(r : out ring;
item : in object;
success : out boolean);
-- read some data and increment bottom counter
procedure read
(r : in out ring;
item : out object;
success : out boolean);
-- decrement top counter
procedure unwrite
(r : out ring;
success : out boolean);
-- return ring state (empty, used or full)
function state
(r : in ring)
return ring_state;
pragma inline (state);
private
type ring_range is new integer range 1 .. size;
type buffer is array (ring_range) of object;
type ring is
record
buf : buffer;
top : ring_range := ring_range'first; -- place to write
bottom : ring_range := ring_range'first; -- place to read
state : ring_state := EMPTY;
end record;
end rings;
|
wof/lcs/enemy/1E.asm | zengfr/arcade_game_romhacking_sourcecode_top_secret_data | 6 | 90788 | <reponame>zengfr/arcade_game_romhacking_sourcecode_top_secret_data
copyright zengfr site:http://github.com/zengfr/romhack
001590 lea ($20,A0), A0
01225A move.l (A2)+, (A3)+
01225C move.l (A2)+, (A3)+ [enemy+1C, enemy+1E]
01A75E dbra D4, $1a75c
026668 addq.b #2, ($29,A0) [enemy+1E]
02905C addq.b #2, ($29,A0) [enemy+1E]
02A420 addq.b #2, ($29,A0) [enemy+1E]
02B64C addq.b #2, ($29,A0) [enemy+1E]
032836 move.b #$18, ($1e,A0) [enemy+ 0]
03283C addq.b #2, ($29,A0) [enemy+1E]
036644 addq.b #2, ($29,A0) [enemy+1E]
046754 addq.b #2, ($29,A0) [enemy+1E]
047126 move.b #$18, ($1e,A0) [enemy+D8]
04712C move.l #$2000400, ($28,A0) [enemy+1E]
0494E2 move.b #$18, ($1e,A0) [enemy+D8]
0494E8 move.l #$2000400, ($28,A0) [enemy+1E]
049998 move.b #$18, ($1e,A0) [enemy+D8]
04999E move.l #$2000400, ($28,A0) [enemy+1E]
copyright zengfr site:http://github.com/zengfr/romhack
|
oeis/074/A074324.asm | neoneye/loda-programs | 11 | 244029 | ; A074324: a(2n+1) = 3^n, a(2n) = 4*3^(n-1) except for a(0) = 1.
; Submitted by <NAME>(s4)
; 1,1,4,3,12,9,36,27,108,81,324,243,972,729,2916,2187,8748,6561,26244,19683,78732,59049,236196,177147,708588,531441,2125764,1594323,6377292,4782969,19131876,14348907,57395628,43046721,172186884,129140163,516560652,387420489,1549681956,1162261467,4649045868,3486784401,13947137604,10460353203,41841412812,31381059609,125524238436,94143178827,376572715308,282429536481,1129718145924,847288609443,3389154437772,2541865828329,10167463313316,7625597484987,30502389939948,22876792454961,91507169819844
mov $1,2
lpb $0
sub $0,1
mov $2,$3
mul $2,3
mov $3,4
add $3,$1
mov $1,$2
lpe
mov $0,$2
div $0,6
add $0,1
|
data/pokemon/egg_moves_kanto.asm | Ebernacher90/pokecrystal-allworld | 0 | 26290 | SECTION "Egg Moves 1", ROMX
EggMovePointers1:
dw BulbasaurEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw CharmanderEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw SquirtleEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw PidgeyEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw RattataEggMoves
dw NoEggMoves1
dw SpearowEggMoves
dw NoEggMoves1
dw EkansEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw SandshrewEggMoves
dw NoEggMoves1
dw NidoranFEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NidoranMEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw VulpixEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw ZubatEggMoves
dw NoEggMoves1
dw OddishEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw ParasEggMoves
dw NoEggMoves1
dw VenonatEggMoves
dw NoEggMoves1
dw DiglettEggMoves
dw NoEggMoves1
dw MeowthEggMoves
dw NoEggMoves1
dw PsyduckEggMoves
dw NoEggMoves1
dw MankeyEggMoves
dw NoEggMoves1
dw GrowlitheEggMoves
dw NoEggMoves1
dw PoliwagEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw AbraEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw MachopEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw BellsproutEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw TentacoolEggMoves
dw NoEggMoves1
dw GeodudeEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw PonytaEggMoves
dw NoEggMoves1
dw SlowpokeEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw FarfetchDEggMoves
dw DoduoEggMoves
dw NoEggMoves1
dw SeelEggMoves
dw NoEggMoves1
dw GrimerEggMoves
dw NoEggMoves1
dw ShellderEggMoves
dw NoEggMoves1
dw GastlyEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw OnixEggMoves
dw DrowzeeEggMoves
dw NoEggMoves1
dw KrabbyEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw ExeggcuteEggMoves
dw NoEggMoves1
dw CuboneEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw LickitungEggMoves
dw KoffingEggMoves
dw NoEggMoves1
dw RhyhornEggMoves
dw NoEggMoves1
dw ChanseyEggMoves
dw TangelaEggMoves
dw KangaskhanEggMoves
dw HorseaEggMoves
dw NoEggMoves1
dw GoldeenEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw MrMimeEggMoves
dw ScytherEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw PinsirEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw LaprasEggMoves
dw NoEggMoves1
dw EeveeEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw OmanyteEggMoves
dw NoEggMoves1
dw KabutoEggMoves
dw NoEggMoves1
dw AerodactylEggMoves
dw SnorlaxEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw DratiniEggMoves
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
dw NoEggMoves1
BulbasaurEggMoves:
db LIGHT_SCREEN
db SKULL_BASH
db SAFEGUARD
db RAZOR_WIND
db PETAL_DANCE
db -1 ; end
CharmanderEggMoves:
db BELLY_DRUM
db ANCIENTPOWER
db ROCK_SLIDE
db BITE
db OUTRAGE
db BEAT_UP
db -1 ; end
SquirtleEggMoves:
db MIRROR_COAT
db HAZE
db MIST
db CONFUSION
db FORESIGHT
db FLAIL
db -1 ; end
PidgeyEggMoves:
db PURSUIT
db FAINT_ATTACK
db FORESIGHT
db -1 ; end
RattataEggMoves:
db SCREECH
db FLAME_WHEEL
db FURY_SWIPES
db BITE
db COUNTER
db REVERSAL
db -1 ; end
SpearowEggMoves:
db FAINT_ATTACK
db FALSE_SWIPE
db SCARY_FACE
db QUICK_ATTACK
db TRI_ATTACK
db -1 ; end
EkansEggMoves:
db PURSUIT
db SLAM
db SPITE
db BEAT_UP
db CRUNCH
db -1 ; end
SandshrewEggMoves:
db FLAIL
db SAFEGUARD
db COUNTER
db RAPID_SPIN
db METAL_CLAW
db -1 ; end
NidoranFEggMoves:
db SUPERSONIC
db DISABLE
db TAKE_DOWN
db FOCUS_ENERGY
db CHARM
db COUNTER
db BEAT_UP
db -1 ; end
NidoranMEggMoves:
db SUPERSONIC
db DISABLE
db TAKE_DOWN
db CONFUSION
db AMNESIA
db COUNTER
db BEAT_UP
db -1 ; end
VulpixEggMoves:
db FAINT_ATTACK
db HYPNOSIS
db FLAIL
db SPITE
db DISABLE
db -1 ; end
ZubatEggMoves:
db QUICK_ATTACK
db PURSUIT
db FAINT_ATTACK
db GUST
db WHIRLWIND
db -1 ; end
OddishEggMoves:
db SWORDS_DANCE
db RAZOR_LEAF
db FLAIL
db SYNTHESIS
db -1 ; end
ParasEggMoves:
db FALSE_SWIPE
db SCREECH
db COUNTER
db PSYBEAM
db FLAIL
db LIGHT_SCREEN
db PURSUIT
db -1 ; end
VenonatEggMoves:
db BATON_PASS
db SCREECH
db GIGA_DRAIN
db -1 ; end
DiglettEggMoves:
db FAINT_ATTACK
db SCREECH
db ANCIENTPOWER
db PURSUIT
db BEAT_UP
db -1 ; end
MeowthEggMoves:
db SPITE
db CHARM
db HYPNOSIS
db AMNESIA
db -1 ; end
PsyduckEggMoves:
db ICE_BEAM
db HYPNOSIS
db PSYBEAM
db FORESIGHT
db LIGHT_SCREEN
db FUTURE_SIGHT
db PSYCHIC_M
db CROSS_CHOP
db -1 ; end
MankeyEggMoves:
db ROCK_SLIDE
db FORESIGHT
db MEDITATE
db COUNTER
db REVERSAL
db BEAT_UP
db -1 ; end
GrowlitheEggMoves:
db BODY_SLAM
db SAFEGUARD
db CRUNCH
db THRASH
db FIRE_SPIN
db -1 ; end
PoliwagEggMoves:
db MIST
db SPLASH
db BUBBLEBEAM
db HAZE
db MIND_READER
db -1 ; end
AbraEggMoves:
db LIGHT_SCREEN
db ENCORE
db BARRIER
db -1 ; end
MachopEggMoves:
db LIGHT_SCREEN
db MEDITATE
db ROLLING_KICK
db ENCORE
db -1 ; end
BellsproutEggMoves:
db SWORDS_DANCE
db ENCORE
db REFLECT
db SYNTHESIS
db LEECH_LIFE
db -1 ; end
TentacoolEggMoves:
db AURORA_BEAM
db MIRROR_COAT
db RAPID_SPIN
db HAZE
db SAFEGUARD
db -1 ; end
GeodudeEggMoves:
db MEGA_PUNCH
db ROCK_SLIDE
db -1 ; end
PonytaEggMoves:
db FLAME_WHEEL
db THRASH
db DOUBLE_KICK
db HYPNOSIS
db CHARM
db QUICK_ATTACK
db -1 ; end
SlowpokeEggMoves:
db SAFEGUARD
db BELLY_DRUM
db FUTURE_SIGHT
db STOMP
db -1 ; end
FarfetchDEggMoves:
db FORESIGHT
db MIRROR_MOVE
db GUST
db QUICK_ATTACK
db FLAIL
db -1 ; end
DoduoEggMoves:
db QUICK_ATTACK
db SUPERSONIC
db HAZE
db FAINT_ATTACK
db FLAIL
db -1 ; end
SeelEggMoves:
db LICK
db PERISH_SONG
db DISABLE
db PECK
db SLAM
db ENCORE
db -1 ; end
GrimerEggMoves:
db HAZE
db MEAN_LOOK
db LICK
db -1 ; end
ShellderEggMoves:
db BUBBLEBEAM
db TAKE_DOWN
db BARRIER
db RAPID_SPIN
db SCREECH
db -1 ; end
GastlyEggMoves:
db PSYWAVE
db PERISH_SONG
db HAZE
db -1 ; end
OnixEggMoves:
db ROCK_SLIDE
db FLAIL
db -1 ; end
DrowzeeEggMoves:
db LIGHT_SCREEN
db BARRIER
db -1 ; end
KrabbyEggMoves:
db DIG
db HAZE
db AMNESIA
db FLAIL
db SLAM
db -1 ; end
ExeggcuteEggMoves:
db SYNTHESIS
db MOONLIGHT
db REFLECT
db MEGA_DRAIN
db ANCIENTPOWER
db -1 ; end
CuboneEggMoves:
db ROCK_SLIDE
db ANCIENTPOWER
db BELLY_DRUM
db SCREECH
db SKULL_BASH
db PERISH_SONG
db SWORDS_DANCE
db -1 ; end
LickitungEggMoves:
db BELLY_DRUM
db MAGNITUDE
db BODY_SLAM
db -1 ; end
KoffingEggMoves:
db SCREECH
db PSYWAVE
db PSYBEAM
db DESTINY_BOND
db PAIN_SPLIT
db -1 ; end
RhyhornEggMoves:
db CRUNCH
db REVERSAL
db ROCK_SLIDE
db THRASH
db PURSUIT
db COUNTER
db MAGNITUDE
db -1 ; end
ChanseyEggMoves:
db PRESENT
db METRONOME
db HEAL_BELL
db -1 ; end
TangelaEggMoves:
db FLAIL
db CONFUSION
db MEGA_DRAIN
db REFLECT
db AMNESIA
db -1 ; end
KangaskhanEggMoves:
db STOMP
db FORESIGHT
db FOCUS_ENERGY
db SAFEGUARD
db DISABLE
db -1 ; end
HorseaEggMoves:
db FLAIL
db AURORA_BEAM
db OCTAZOOKA
db DISABLE
db SPLASH
db DRAGON_RAGE
db -1 ; end
GoldeenEggMoves:
db PSYBEAM
db HAZE
db HYDRO_PUMP
db -1 ; end
MrMimeEggMoves:
db FUTURE_SIGHT
db HYPNOSIS
db MIMIC
db -1 ; end
ScytherEggMoves:
db COUNTER
db SAFEGUARD
db BATON_PASS
db RAZOR_WIND
db REVERSAL
db LIGHT_SCREEN
db -1 ; end
PinsirEggMoves:
db FURY_ATTACK
db FLAIL
db -1 ; end
LaprasEggMoves:
db AURORA_BEAM
db FORESIGHT
db -1 ; end
EeveeEggMoves:
db FLAIL
db CHARM
db -1 ; end
OmanyteEggMoves:
db BUBBLEBEAM
db AURORA_BEAM
db SLAM
db SUPERSONIC
db HAZE
db -1 ; end
KabutoEggMoves:
db BUBBLEBEAM
db AURORA_BEAM
db RAPID_SPIN
db DIG
db FLAIL
db -1 ; end
AerodactylEggMoves:
db WHIRLWIND
db PURSUIT
db FORESIGHT
db -1 ; end
SnorlaxEggMoves:
db LICK
db -1 ; end
DratiniEggMoves:
db LIGHT_SCREEN
db MIST
db HAZE
db SUPERSONIC
db -1 ; end
NoEggMoves1:
dw -1 ; end
|
suro-oaas/suro-oaas-core/src/main/antlr4/CplexDatFile.g4 | IBM/suro-oaas | 0 | 1648 | /**
* This grammar is a simplified version of the syntax of the CPLEX
* DAT file for the purpose of parsing specific DAT files that
* are used within the Surgical Unit Resource Optimisation project.
*/
grammar CplexDatFile;
declarations
: Declaration + EOF
;
declaration
: IDENTIFIER EQUAL body SEMICOLON
;
body
: array | set | tuple | value
;
value
: STRING | number
;
number
: FLOAT | INTEGER
;
array
: OPEN_BRACKET body + CLOSE_BRACKET
;
tuple
: OPEN_ANGLE_BRACKET body + CLOSE_ANGLE_BRACKET
;
set
: OPEN_BRACE body + CLOSE_BRACE
;
OPEN_BRACKET
: '['
;
CLOSE_BRACKET
: ']'
;
OPEN_BRACE
: '{'
;
CLOSE_BRACE
: '{'
;
OPEN_ANGLE_BRACKET
: '<'
;
CLOSE_ANGLE_BRACKET
: '<'
;
EQUAL
: '='
;
COMMA
: ','
;
SEMICOLON
: ';'
;
/**
* Maybe replace with: '"' .*? '"' ;
*/
STRING
: '"' ~ ["\r\n]* '"'
;
IDENTIFIER
: ('a'..'z'|'A'..'Z') ('a'..'z'|'A'..'Z'|'0'..'9'|'_')+
;
fragment DIGIT
: ('0'..'9')
;
fragment DIGIT_NOT_ZERO
: ('1'..'9')
;
FLOAT
: DIGIT* '.' DIGIT+
;
INTEGER
: DIGIT | (DIGIT_NOT_ZERO DIGIT+)
;
WS
: [ \r\n\t] + -> channel (HIDDEN)
;
|
examples/asm/infiniteloop.asm | Nibble-Knowledge/label-replacer | 0 | 26374 | Start:
NOP
JMP Start
HLT
|
alloy_model/gc/gc.als | vasil-sd/engineering-sw-hw-model-checking-letures | 16 | 4664 | var sig Object { -- 'var' говорит о том, что сигнатура
-- (множество объектов) может меняться со временем
-- у нас оно будет меняться в конце цикла сборки мусора,
-- когда будут удаляться недостижимые объекты
var linked_to: set Object -- отношение linked_to тоже может меняться со временем
-- заметьте, что 'var' у сигнатуры не делает изменяемыми
-- отношения объявленные вместе с сигнатурой, им нужно
-- дополнительно ставить 'var'
}
one sig Context { -- это контекст сборщика мусора
var marked: set Object, -- множество уже промаркированных объектов,
-- которые являются достижимыми из множества
-- корневых объектов
var root_objects: set Object, -- множество корневых объектов
var to_be_checked: set Object -- а в этом множестве мы будем держать объекты
-- которые собираемся просмотреть в будущем
}
fact init {
-- начальное состояние
no marked -- никакие объекты не промаркированы
some root_objects -- есть некоторые множество корневых объектов
to_be_checked = root_objects -- множество готовящихся к проверке объектов
-- при инициализации эквивалентно множеству корневых
}
-- шаг маркировки достижимых объектов
pred mark {
-- берём какой-нибудь объект из списка проверяемых
some o : Context.to_be_checked {
let lnk = o.linked_to -- все дочерние обхекты
| let lnk_unmarked = lnk - Context.marked -- которые ещё немаркированны
| Context.to_be_checked' = Context.to_be_checked + lnk_unmarked - o -- добавляем в множество проверяемых,
-- а сам объект из этого множества удаляем
-- вопрос: можно ли написать так:
-- Context.to_be_marked - o + lnk_unmarked ?
-- а почему?
-- добавляем его к списку промаркированных
Context.marked' = Context.marked + o
}
-- всё остальное неизменно
Object' = Object
root_objects' = root_objects
linked_to' = linked_to
}
-- финальная сборка
pred collect {
-- все промаркированные считаем живыми
Object' = Context.marked
-- в следующем моменте, множество маркированных обнуляем
no marked'
-- всё остальное остаётся неизменным
linked_to' = linked_to
to_be_checked' = to_be_checked
root_objects' = root_objects
}
-- шаг прокрастинации :)
pred nop {
-- ничего не делаем и ничего не меняем
Object' = Object
marked' = marked
linked_to' = linked_to
to_be_checked' = to_be_checked
root_objects' = root_objects
}
pred gc {
not is_done => mark -- пока не завершили, продолжаем маркировать
-- если нет объектов для просмотра и список маркированных не пуст,
-- то значит сборщик мусора закончил маркировку и нужно выполнить
-- финальный шаг по сборке мусора
is_done and some marked => collect
-- если всё сделали, то отдыхаем :)
is_done and no marked => nop
}
-- добавление корневого объекта
pred add_root_object[o: Object] {
root_objects' = root_objects + Context -> o -- само добавление
-- моделирование барьера
-- добавляем этот объект к объектам для будущей обработки
-- если он ещё не промаркирован
to_be_checked' = to_be_checked + (Context -> o - marked)
linked_to' = linked_to -- связи между объектами не меняются
}
-- удаление корневого объекта
pred remove_root_object[o: Object] {
root_objects' = root_objects - Context -> o -- само удаление
-- моделирование барьера
-- удаляем объект из множества проверяемых
to_be_checked' = to_be_checked - Context->o
linked_to' = linked_to
}
-- создаём связь между двумя объектами
pred link_objects[o1,o2:Object] {
linked_to' = linked_to + o1 -> o2
-- тут моделируется барьер
o1 in Context.marked =>
to_be_checked' = to_be_checked + (Context->o2 - marked)
else to_be_checked' = to_be_checked
}
-- отлинковываем объекты
pred unlink_objects[o1, o2: Object] {
linked_to' = linked_to - o1 -> o2
to_be_checked' = to_be_checked -- тут ничего не меняем
-- удалить o2 (если он там есть)
-- из списка to_be_checked мы не можем
-- так как на o2 могут указывать указатели других объектов,
-- не только o1
}
pred mutator {
-- это имитация работы пользовательской программы
-- во время работы сборщика мусора
-- неизменяемые вещи нужно явно указать
Object' = Object
-- добавим или удалим из корневых какой-нибудь случайный объект
some o : Object | add_root_object[o] or remove_root_object[o]
-- случайным образом слинкуем/разлинкуем пару объектов
some o1,o2 : Object -- выберем пару случайных объектов
| link_objects[o1, o2] or unlink_objects[o1, o2] -- и слинкуем или разлинкуем их
}
-- процесс работы, задаётся макросом для удобства
let dynamic_work {
-- всегда
always {
-- либо программа что-то поменяла в объектах
(not is_done and mutator) or
-- либо выполнили шаг сборщика мусора
gc
}
-- добавим условие, что когда-либо работа сборщика закончится,
-- чтобы не возиться с условиями fairness
-- это не совсем правильно, но для простоты учебной модели
-- можно пойти на это упрощение
eventually is_done -- именно отсутсвие этого условия привело к контрпримеру
-- в конце видеолекции
-- по-хорошему, то, что процесс сборки мусора завершится,
-- нужно показывать на liveness свойствах с fairness условиями
-- но мы тут срезали немного угол :)
}
-- процесс работы в случае отсутствия изменения корневых объектов,
-- связей и тд.
let static_work { always gc } -- работает только сборщик мусора
-- предикат завершения маркировки объектов
pred is_done {
no to_be_checked -- когда не осталось объектов для маркировки
}
-- возвращает множество достижимых
fun reachable[objs:Object] : set Object {
objs + objs.^linked_to -- достижимыми считаем сами объекты и те, до которых можно дойти
-- по отношению linked_to
}
-- признак того, что маркировка закончена и следующий шаг - сборка мусора
pred pre_collect {
is_done and some marked
}
-- помотрим примеры того, что получается
run {
-- тут зададим такие условия, чтобы получить ситуацию сборки мусора,
-- то есть потребуем такие модели, чтобы в них как минимум один
-- объект получался мусорным и его бы убирал сборщих мусора
static_work => { -- режим работы - без мутаций
-- чтобы было интереснее, потребуем минимум 3 корневых объекта
-- иначе грустно пустые множества созерцать :)
#root_objects >= 3 and
eventually -- тогда, когда-то в будущем
(some o: Object -- найдём такой объект
| o not in reachable[Context.root_objects] -- что он будет недостижим из корневых, то есть
-- это будет мусорный объект
)
-- когда-то в будущем, процесс сборки мусора завершится
-- и все оставшиеся объекты будут достижимыми из корневых
eventually always (is_done and Object = reachable[Context.root_objects])
}
} for 6 but 1..20 steps
-- проверка того, что в статичном режиме (когда пользовательский процесс ничего
-- не меняет в системе) сборщик мусора не оставляет мусора и не удаляет достижимые объекты
-- для динамического режима работы это условие слишком сильно
-- (сильно усложнит модель дополнительная информация в контексте для
-- точного отслеживания действий пользователя)
assert static_correct {
static_work => eventually always (is_done and Object = reachable[Context.root_objects])
}
-- проверка динамического режима, что сборщик мусора корректно работает
-- в режиме когда меняются корневые объекты и связи между объектами
assert dynamic_correct {
dynamic_work => {
-- все достижимые промаркированны
eventually {
pre_collect => {
reachable[Context.root_objects] in Context.marked
-- так как в динамическом режиме может получиться, что мы промаркируем объект,
-- но он потом выпадет из достижимых (связь изменилась, например), то в общем
-- случае marked больше или равно reachable
-- в следующий момент будет произведена сборка мусора
-- и marked будет обнулён
after always {
is_done and no marked
}
}
}
}
}
static_correctness: check static_correct for 5 but 1..20 steps
dynamic_correctness: check dynamic_correct for 5 but 1..20 steps
|
alloy4fun_models/trainstlt/models/1/NPCtc2qrQNMZG4FPg.als | Kaixi26/org.alloytools.alloy | 0 | 3415 | <gh_stars>0
open main
pred idNPCtc2qrQNMZG4FPg_prop2 {
always ( all g : Signal | eventually g=Green)
}
pred __repair { idNPCtc2qrQNMZG4FPg_prop2 }
check __repair { idNPCtc2qrQNMZG4FPg_prop2 <=> prop2o } |
source/interfaces/i-cwcpoi.ads | ytomino/drake | 33 | 28101 | <filename>source/interfaces/i-cwcpoi.ads
pragma License (Unrestricted);
-- extended unit
with Interfaces.C.Pointers;
package Interfaces.C.WChar_Pointers is
new Pointers (
Index => size_t,
Element => wchar_t,
Element_Array => wchar_array,
Default_Terminator => wchar_t'Val (0));
-- The instance of Interfaces.C.Pointers for wchar_t.
pragma Pure (Interfaces.C.WChar_Pointers);
|
Chapter_5/Program 5.2/x86_64/Program_5.2_NASM.asm | chen150182055/Assembly | 272 | 80691 | <gh_stars>100-1000
; Program 5.2
; Looping - NASM (64-bit)
; Copyright (c) 2020 Hall & Slonka
SECTION .text
global _main
_main:
xor rax, rax
mov rcx, 5
myLoop:
inc rax
loop myLoop
mov rax, 60
xor rdi, rdi
syscall
|
My OS/boot/print-32bit.asm | faeriemattins/Hydro-Traffic-Monitoring-System | 0 | 172782 | <filename>My OS/boot/print-32bit.asm
[bits 32] ; 32-bit protected mode
VIDEO_MEMORY equ 0xb8000
WHITE_ON_BLACK equ 0x0f ; the color byte
print32:
pusha
mov edx, VIDEO_MEMORY
print32_loop:
mov al, [ebx]
mov ah, WHITE_ON_BLACK
cmp al, 0
je print32_done
mov [edx], ax
add ebx, 1
add edx, 2
jmp print32_loop
print32_done:
popa
ret
|
applet/aide/source/palettes/aide-palette-of_packages_subpackages.ads | charlie5/aIDE | 3 | 15683 | with
AdaM.a_Package,
aIDE.Palette.of_packages,
Gtk.Button,
Gtk.Notebook,
gtk.Widget;
private
with
Gtk.Frame,
Gtk.Box;
package aIDE.Palette.of_packages_subpackages
is
type Item is new Palette.item with private;
type View is access all Item'Class;
function to_packages_Palette_package return View;
function new_Button (for_Package : in AdaM.a_Package.view;
Named : in String;
packages_Palette : in Palette.of_packages.view) return Gtk.Button.gtk_Button;
procedure Parent_is (Self : in out Item; Now : in aIDE.Palette.of_packages.view);
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget;
function children_Notebook (Self : in Item) return gtk.Notebook.gtk_Notebook;
private
use
gtk.Button,
gtk.Box,
gtk.Notebook,
gtk.Frame;
type Item is new Palette.item with
record
Parent : Palette.of_packages.view;
Top : gtk_Frame;
select_button_Box : gtk_Box;
children_Notebook : gtk_Notebook;
end record;
end aIDE.Palette.of_packages_subpackages;
|
libsrc/_DEVELOPMENT/temp/sp1/zx/c/sccz80/sp1_GetUpdateStruct.asm | meesokim/z88dk | 0 | 22034 | ; struct sp1_update *sp1_GetUpdateStruct(uchar row, uchar col)
SECTION code_temp_sp1
PUBLIC sp1_GetUpdateStruct
EXTERN asm_sp1_GetUpdateStruct
sp1_GetUpdateStruct:
ld hl,2
add hl,sp
ld e,(hl)
inc hl
inc hl
ld d,(hl)
jp asm_sp1_GetUpdateStruct
|
programs/oeis/080/A080755.asm | jmorken/loda | 1 | 160039 | <reponame>jmorken/loda
; A080755: a(n) = ceiling(n*(1+1/sqrt(2))).
; 2,4,6,7,9,11,12,14,16,18,19,21,23,24,26,28,30,31,33,35,36,38,40,41,43,45,47,48,50,52,53,55,57,59,60,62,64,65,67,69,70,72,74,76,77,79,81,82,84,86,88,89,91,93,94,96,98,100,101,103,105,106,108,110,111,113,115,117,118,120,122,123,125,127,129,130,132,134,135,137,139,140,142,144,146,147,149,151,152,154,156,158,159,161,163,164,166,168,170,171,173,175,176,178,180,181,183,185,187,188,190,192,193,195,197,199,200,202,204,205,207,209,210,212,214,216,217,219,221,222,224,226,228,229,231,233,234,236,238,239,241,243,245,246,248,250,251,253,255,257,258,260,262,263,265,267,269,270,272,274,275,277,279,280,282,284,286,287,289,291,292,294,296,298,299,301,303,304,306,308,309,311,313,315,316,318,320,321,323,325,327,328,330,332,333,335,337,339,340,342,344,345,347,349,350,352,354,356,357,359,361,362,364,366,368,369,371,373,374,376,378,379,381,383,385,386,388,390,391,393,395,397,398,400,402,403,405,407,408,410,412,414,415,417,419,420,422,424,426,427
mov $7,$0
add $0,1
pow $0,2
mov $2,$0
mov $3,1
lpb $2
add $3,1
mov $4,$2
trn $4,2
lpb $4
add $3,4
trn $4,$3
add $5,2
lpe
sub $2,$2
lpe
mov $1,$5
mov $6,$7
mul $6,2
add $1,$6
div $1,2
add $1,2
|
Transynther/x86/_processed/NONE/_xt_/i7-8650U_0xd2.log_195_728.asm | ljhsiun2/medusa | 9 | 162123 | .global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r13
push %r14
push %r15
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x1375d, %r12
add %r14, %r14
mov (%r12), %esi
cmp $4412, %rbp
lea addresses_UC_ht+0x16e5a, %r15
nop
nop
nop
xor $55863, %r13
mov $0x6162636465666768, %rbp
movq %rbp, (%r15)
cmp %r14, %r14
lea addresses_normal_ht+0x18ed1, %r15
nop
nop
sub %r14, %r14
mov $0x6162636465666768, %rsi
movq %rsi, %xmm6
vmovups %ymm6, (%r15)
nop
nop
sub %r12, %r12
lea addresses_A_ht+0xa8d1, %rsi
lea addresses_A_ht+0xf0d1, %rdi
nop
nop
cmp %r14, %r14
mov $44, %rcx
rep movsq
nop
nop
nop
and %r14, %r14
lea addresses_UC_ht+0xf8d1, %r12
nop
nop
nop
nop
cmp $32845, %r13
movups (%r12), %xmm0
vpextrq $0, %xmm0, %r15
and $14405, %rbp
lea addresses_A_ht+0x2711, %r15
nop
add $54451, %rdi
mov (%r15), %ecx
nop
sub %rcx, %rcx
lea addresses_normal_ht+0x1ab6d, %r12
clflush (%r12)
nop
xor %r13, %r13
mov (%r12), %r15
nop
nop
nop
nop
nop
cmp %r12, %r12
lea addresses_D_ht+0x6f4f, %rdi
nop
nop
nop
nop
cmp $10276, %rcx
mov (%rdi), %r15w
nop
nop
nop
dec %rbp
lea addresses_UC_ht+0x148d1, %rsi
lea addresses_A_ht+0x13ae5, %rdi
nop
nop
nop
nop
nop
sub %r14, %r14
mov $28, %rcx
rep movsb
nop
nop
inc %r14
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %r15
pop %r14
pop %r13
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r13
push %r9
push %rdi
// Faulty Load
lea addresses_PSE+0x100d1, %r9
nop
nop
nop
xor $40748, %r12
vmovups (%r9), %ymm6
vextracti128 $1, %ymm6, %xmm6
vpextrq $0, %xmm6, %r13
lea oracles, %r12
and $0xff, %r13
shlq $12, %r13
mov (%r12,%r13,1), %r13
pop %rdi
pop %r9
pop %r13
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_PSE', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_PSE', 'size': 32, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'type': 'addresses_WC_ht', 'size': 4, 'AVXalign': False, 'NT': False, 'congruent': 2, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_normal_ht', 'size': 32, 'AVXalign': False, 'NT': False, 'congruent': 6, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_A_ht', 'congruent': 10, 'same': True}, 'dst': {'type': 'addresses_A_ht', 'congruent': 11, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_UC_ht', 'size': 16, 'AVXalign': False, 'NT': False, 'congruent': 11, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_A_ht', 'size': 4, 'AVXalign': False, 'NT': False, 'congruent': 5, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_normal_ht', 'size': 8, 'AVXalign': False, 'NT': True, 'congruent': 1, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'size': 2, 'AVXalign': False, 'NT': False, 'congruent': 1, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_UC_ht', 'congruent': 9, 'same': False}, 'dst': {'type': 'addresses_A_ht', 'congruent': 2, 'same': False}}
{'33': 195}
33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33
*/
|
gcc-gcc-7_3_0-release/gcc/ada/prj.adb | best08618/asylo | 7 | 23434 | <reponame>best08618/asylo<filename>gcc-gcc-7_3_0-release/gcc/ada/prj.adb
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P R J --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Opt;
with Osint; use Osint;
with Output; use Output;
with Prj.Attr;
with Prj.Com;
with Prj.Err; use Prj.Err;
with Snames; use Snames;
with Uintp; use Uintp;
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.Containers.Ordered_Sets;
with Ada.Unchecked_Deallocation;
with GNAT.Case_Util; use GNAT.Case_Util;
with GNAT.Directory_Operations; use GNAT.Directory_Operations;
with GNAT.HTable;
package body Prj is
type Restricted_Lang;
type Restricted_Lang_Access is access Restricted_Lang;
type Restricted_Lang is record
Name : Name_Id;
Next : Restricted_Lang_Access;
end record;
Restricted_Languages : Restricted_Lang_Access := null;
-- When null, all languages are allowed, otherwise only the languages in
-- the list are allowed.
Object_Suffix : constant String := Get_Target_Object_Suffix.all;
-- File suffix for object files
Initial_Buffer_Size : constant := 100;
-- Initial size for extensible buffer used in Add_To_Buffer
The_Empty_String : Name_Id := No_Name;
The_Dot_String : Name_Id := No_Name;
Debug_Level : Integer := 0;
-- Current indentation level for debug traces
type Cst_String_Access is access constant String;
All_Lower_Case_Image : aliased constant String := "lowercase";
All_Upper_Case_Image : aliased constant String := "UPPERCASE";
Mixed_Case_Image : aliased constant String := "MixedCase";
The_Casing_Images : constant array (Known_Casing) of Cst_String_Access :=
(All_Lower_Case => All_Lower_Case_Image'Access,
All_Upper_Case => All_Upper_Case_Image'Access,
Mixed_Case => Mixed_Case_Image'Access);
package Name_Id_Set is
new Ada.Containers.Ordered_Sets (Element_Type => Name_Id);
procedure Free (Project : in out Project_Id);
-- Free memory allocated for Project
procedure Free_List (Languages : in out Language_Ptr);
procedure Free_List (Source : in out Source_Id);
procedure Free_List (Languages : in out Language_List);
-- Free memory allocated for the list of languages or sources
procedure Reset_Units_In_Table (Table : in out Units_Htable.Instance);
-- Resets all Units to No_Unit_Index Unit.File_Names (Spec).Unit &
-- Unit.File_Names (Impl).Unit in the given table.
procedure Free_Units (Table : in out Units_Htable.Instance);
-- Free memory allocated for unit information in the project
procedure Language_Changed (Iter : in out Source_Iterator);
procedure Project_Changed (Iter : in out Source_Iterator);
-- Called when a new project or language was selected for this iterator
function Contains_ALI_Files (Dir : Path_Name_Type) return Boolean;
-- Return True if there is at least one ALI file in the directory Dir
-----------------------------
-- Add_Restricted_Language --
-----------------------------
procedure Add_Restricted_Language (Name : String) is
N : String (1 .. Name'Length) := Name;
begin
To_Lower (N);
Name_Len := 0;
Add_Str_To_Name_Buffer (N);
Restricted_Languages :=
new Restricted_Lang'(Name => Name_Find, Next => Restricted_Languages);
end Add_Restricted_Language;
-------------------------------------
-- Remove_All_Restricted_Languages --
-------------------------------------
procedure Remove_All_Restricted_Languages is
begin
Restricted_Languages := null;
end Remove_All_Restricted_Languages;
-------------------
-- Add_To_Buffer --
-------------------
procedure Add_To_Buffer
(S : String;
To : in out String_Access;
Last : in out Natural)
is
begin
if To = null then
To := new String (1 .. Initial_Buffer_Size);
Last := 0;
end if;
-- If Buffer is too small, double its size
while Last + S'Length > To'Last loop
declare
New_Buffer : constant String_Access :=
new String (1 .. 2 * To'Length);
begin
New_Buffer (1 .. Last) := To (1 .. Last);
Free (To);
To := New_Buffer;
end;
end loop;
To (Last + 1 .. Last + S'Length) := S;
Last := Last + S'Length;
end Add_To_Buffer;
---------------------------------
-- Current_Object_Path_File_Of --
---------------------------------
function Current_Object_Path_File_Of
(Shared : Shared_Project_Tree_Data_Access) return Path_Name_Type
is
begin
return Shared.Private_Part.Current_Object_Path_File;
end Current_Object_Path_File_Of;
---------------------------------
-- Current_Source_Path_File_Of --
---------------------------------
function Current_Source_Path_File_Of
(Shared : Shared_Project_Tree_Data_Access)
return Path_Name_Type is
begin
return Shared.Private_Part.Current_Source_Path_File;
end Current_Source_Path_File_Of;
---------------------------
-- Delete_Temporary_File --
---------------------------
procedure Delete_Temporary_File
(Shared : Shared_Project_Tree_Data_Access := null;
Path : Path_Name_Type)
is
Dont_Care : Boolean;
pragma Warnings (Off, Dont_Care);
begin
if not Opt.Keep_Temporary_Files then
if Current_Verbosity = High then
Write_Line ("Removing temp file: " & Get_Name_String (Path));
end if;
Delete_File (Get_Name_String (Path), Dont_Care);
if Shared /= null then
for Index in
1 .. Temp_Files_Table.Last (Shared.Private_Part.Temp_Files)
loop
if Shared.Private_Part.Temp_Files.Table (Index) = Path then
Shared.Private_Part.Temp_Files.Table (Index) := No_Path;
end if;
end loop;
end if;
end if;
end Delete_Temporary_File;
------------------------------
-- Delete_Temp_Config_Files --
------------------------------
procedure Delete_Temp_Config_Files (Project_Tree : Project_Tree_Ref) is
Success : Boolean;
pragma Warnings (Off, Success);
Proj : Project_List;
begin
if not Opt.Keep_Temporary_Files then
if Project_Tree /= null then
Proj := Project_Tree.Projects;
while Proj /= null loop
if Proj.Project.Config_File_Temp then
Delete_Temporary_File
(Project_Tree.Shared, Proj.Project.Config_File_Name);
-- Make sure that we don't have a config file for this
-- project, in case there are several mains. In this case,
-- we will recreate another config file: we cannot reuse the
-- one that we just deleted.
Proj.Project.Config_Checked := False;
Proj.Project.Config_File_Name := No_Path;
Proj.Project.Config_File_Temp := False;
end if;
Proj := Proj.Next;
end loop;
end if;
end if;
end Delete_Temp_Config_Files;
---------------------------
-- Delete_All_Temp_Files --
---------------------------
procedure Delete_All_Temp_Files
(Shared : Shared_Project_Tree_Data_Access)
is
Dont_Care : Boolean;
pragma Warnings (Off, Dont_Care);
Path : Path_Name_Type;
begin
if not Opt.Keep_Temporary_Files then
for Index in
1 .. Temp_Files_Table.Last (Shared.Private_Part.Temp_Files)
loop
Path := Shared.Private_Part.Temp_Files.Table (Index);
if Path /= No_Path then
if Current_Verbosity = High then
Write_Line ("Removing temp file: "
& Get_Name_String (Path));
end if;
Delete_File (Get_Name_String (Path), Dont_Care);
end if;
end loop;
Temp_Files_Table.Free (Shared.Private_Part.Temp_Files);
Temp_Files_Table.Init (Shared.Private_Part.Temp_Files);
end if;
-- If any of the environment variables ADA_PRJ_INCLUDE_FILE or
-- ADA_PRJ_OBJECTS_FILE has been set, then reset their value to
-- the empty string.
if Shared.Private_Part.Current_Source_Path_File /= No_Path then
Setenv (Project_Include_Path_File, "");
end if;
if Shared.Private_Part.Current_Object_Path_File /= No_Path then
Setenv (Project_Objects_Path_File, "");
end if;
end Delete_All_Temp_Files;
---------------------
-- Dependency_Name --
---------------------
function Dependency_Name
(Source_File_Name : File_Name_Type;
Dependency : Dependency_File_Kind) return File_Name_Type
is
begin
case Dependency is
when None =>
return No_File;
when Makefile =>
return Extend_Name (Source_File_Name, Makefile_Dependency_Suffix);
when ALI_Closure
| ALI_File
=>
return Extend_Name (Source_File_Name, ALI_Dependency_Suffix);
end case;
end Dependency_Name;
----------------
-- Dot_String --
----------------
function Dot_String return Name_Id is
begin
return The_Dot_String;
end Dot_String;
----------------
-- Empty_File --
----------------
function Empty_File return File_Name_Type is
begin
return File_Name_Type (The_Empty_String);
end Empty_File;
-------------------
-- Empty_Project --
-------------------
function Empty_Project
(Qualifier : Project_Qualifier) return Project_Data
is
begin
Prj.Initialize (Tree => No_Project_Tree);
declare
Data : Project_Data (Qualifier => Qualifier);
begin
-- Only the fields for which no default value could be provided in
-- prj.ads are initialized below.
Data.Config := Default_Project_Config;
return Data;
end;
end Empty_Project;
------------------
-- Empty_String --
------------------
function Empty_String return Name_Id is
begin
return The_Empty_String;
end Empty_String;
------------
-- Expect --
------------
procedure Expect (The_Token : Token_Type; Token_Image : String) is
begin
if Token /= The_Token then
-- ??? Should pass user flags here instead
Error_Msg (Gnatmake_Flags, Token_Image & " expected", Token_Ptr);
end if;
end Expect;
-----------------
-- Extend_Name --
-----------------
function Extend_Name
(File : File_Name_Type;
With_Suffix : String) return File_Name_Type
is
Last : Positive;
begin
Get_Name_String (File);
Last := Name_Len + 1;
while Name_Len /= 0 and then Name_Buffer (Name_Len) /= '.' loop
Name_Len := Name_Len - 1;
end loop;
if Name_Len <= 1 then
Name_Len := Last;
end if;
for J in With_Suffix'Range loop
Name_Buffer (Name_Len) := With_Suffix (J);
Name_Len := Name_Len + 1;
end loop;
Name_Len := Name_Len - 1;
return Name_Find;
end Extend_Name;
-------------------------
-- Is_Allowed_Language --
-------------------------
function Is_Allowed_Language (Name : Name_Id) return Boolean is
R : Restricted_Lang_Access := Restricted_Languages;
Lang : constant String := Get_Name_String (Name);
begin
if R = null then
return True;
else
while R /= null loop
if Get_Name_String (R.Name) = Lang then
return True;
end if;
R := R.Next;
end loop;
return False;
end if;
end Is_Allowed_Language;
---------------------
-- Project_Changed --
---------------------
procedure Project_Changed (Iter : in out Source_Iterator) is
begin
if Iter.Project /= null then
Iter.Language := Iter.Project.Project.Languages;
Language_Changed (Iter);
end if;
end Project_Changed;
----------------------
-- Language_Changed --
----------------------
procedure Language_Changed (Iter : in out Source_Iterator) is
begin
Iter.Current := No_Source;
if Iter.Language_Name /= No_Name then
while Iter.Language /= null
and then Iter.Language.Name /= Iter.Language_Name
loop
Iter.Language := Iter.Language.Next;
end loop;
end if;
-- If there is no matching language in this project, move to next
if Iter.Language = No_Language_Index then
if Iter.All_Projects then
loop
Iter.Project := Iter.Project.Next;
exit when Iter.Project = null
or else Iter.Encapsulated_Libs
or else not Iter.Project.From_Encapsulated_Lib;
end loop;
Project_Changed (Iter);
else
Iter.Project := null;
end if;
else
Iter.Current := Iter.Language.First_Source;
if Iter.Current = No_Source then
Iter.Language := Iter.Language.Next;
Language_Changed (Iter);
elsif not Iter.Locally_Removed
and then Iter.Current.Locally_Removed
then
Next (Iter);
end if;
end if;
end Language_Changed;
---------------------
-- For_Each_Source --
---------------------
function For_Each_Source
(In_Tree : Project_Tree_Ref;
Project : Project_Id := No_Project;
Language : Name_Id := No_Name;
Encapsulated_Libs : Boolean := True;
Locally_Removed : Boolean := True) return Source_Iterator
is
Iter : Source_Iterator;
begin
Iter := Source_Iterator'
(In_Tree => In_Tree,
Project => In_Tree.Projects,
All_Projects => Project = No_Project,
Language_Name => Language,
Language => No_Language_Index,
Current => No_Source,
Encapsulated_Libs => Encapsulated_Libs,
Locally_Removed => Locally_Removed);
if Project /= null then
while Iter.Project /= null
and then Iter.Project.Project /= Project
loop
Iter.Project := Iter.Project.Next;
end loop;
else
while not Iter.Encapsulated_Libs
and then Iter.Project.From_Encapsulated_Lib
loop
Iter.Project := Iter.Project.Next;
end loop;
end if;
Project_Changed (Iter);
return Iter;
end For_Each_Source;
-------------
-- Element --
-------------
function Element (Iter : Source_Iterator) return Source_Id is
begin
return Iter.Current;
end Element;
----------
-- Next --
----------
procedure Next (Iter : in out Source_Iterator) is
begin
loop
Iter.Current := Iter.Current.Next_In_Lang;
exit when Iter.Locally_Removed
or else Iter.Current = No_Source
or else not Iter.Current.Locally_Removed;
end loop;
if Iter.Current = No_Source then
Iter.Language := Iter.Language.Next;
Language_Changed (Iter);
end if;
end Next;
--------------------------------
-- For_Every_Project_Imported --
--------------------------------
procedure For_Every_Project_Imported_Context
(By : Project_Id;
Tree : Project_Tree_Ref;
With_State : in out State;
Include_Aggregated : Boolean := True;
Imported_First : Boolean := False)
is
use Project_Boolean_Htable;
procedure Recursive_Check_Context
(Project : Project_Id;
Tree : Project_Tree_Ref;
In_Aggregate_Lib : Boolean;
From_Encapsulated_Lib : Boolean);
-- Recursively handle the project tree creating a new context for
-- keeping track about already handled projects.
-----------------------------
-- Recursive_Check_Context --
-----------------------------
procedure Recursive_Check_Context
(Project : Project_Id;
Tree : Project_Tree_Ref;
In_Aggregate_Lib : Boolean;
From_Encapsulated_Lib : Boolean)
is
package Name_Id_Set is
new Ada.Containers.Ordered_Sets (Element_Type => Path_Name_Type);
Seen_Name : Name_Id_Set.Set;
-- This set is needed to ensure that we do not handle the same
-- project twice in the context of aggregate libraries.
-- Since duplicate project names are possible in the context of
-- aggregated projects, we need to check the full paths.
procedure Recursive_Check
(Project : Project_Id;
Tree : Project_Tree_Ref;
In_Aggregate_Lib : Boolean;
From_Encapsulated_Lib : Boolean);
-- Check if project has already been seen. If not, mark it as Seen,
-- Call Action, and check all its imported and aggregated projects.
---------------------
-- Recursive_Check --
---------------------
procedure Recursive_Check
(Project : Project_Id;
Tree : Project_Tree_Ref;
In_Aggregate_Lib : Boolean;
From_Encapsulated_Lib : Boolean)
is
function Has_Sources (P : Project_Id) return Boolean;
-- Returns True if P has sources
function Get_From_Tree (P : Project_Id) return Project_Id;
-- Get project P from Tree. If P has no sources get another
-- instance of this project with sources. If P has sources,
-- returns it.
-----------------
-- Has_Sources --
-----------------
function Has_Sources (P : Project_Id) return Boolean is
Lang : Language_Ptr;
begin
Lang := P.Languages;
while Lang /= No_Language_Index loop
if Lang.First_Source /= No_Source then
return True;
end if;
Lang := Lang.Next;
end loop;
return False;
end Has_Sources;
-------------------
-- Get_From_Tree --
-------------------
function Get_From_Tree (P : Project_Id) return Project_Id is
List : Project_List := Tree.Projects;
begin
if not Has_Sources (P) then
while List /= null loop
if List.Project.Name = P.Name
and then Has_Sources (List.Project)
then
return List.Project;
end if;
List := List.Next;
end loop;
end if;
return P;
end Get_From_Tree;
-- Local variables
List : Project_List;
-- Start of processing for Recursive_Check
begin
if not Seen_Name.Contains (Project.Path.Name) then
-- Even if a project is aggregated multiple times in an
-- aggregated library, we will only return it once.
Seen_Name.Include (Project.Path.Name);
if not Imported_First then
Action
(Get_From_Tree (Project),
Tree,
Project_Context'(In_Aggregate_Lib, From_Encapsulated_Lib),
With_State);
end if;
-- Visit all extended projects
if Project.Extends /= No_Project then
Recursive_Check
(Project.Extends, Tree,
In_Aggregate_Lib, From_Encapsulated_Lib);
end if;
-- Visit all imported projects
List := Project.Imported_Projects;
while List /= null loop
Recursive_Check
(List.Project, Tree,
In_Aggregate_Lib,
From_Encapsulated_Lib
or else Project.Standalone_Library = Encapsulated);
List := List.Next;
end loop;
-- Visit all aggregated projects
if Include_Aggregated
and then Project.Qualifier in Aggregate_Project
then
declare
Agg : Aggregated_Project_List;
begin
Agg := Project.Aggregated_Projects;
while Agg /= null loop
pragma Assert (Agg.Project /= No_Project);
-- For aggregated libraries, the tree must be the one
-- of the aggregate library.
if Project.Qualifier = Aggregate_Library then
Recursive_Check
(Agg.Project, Tree,
True,
From_Encapsulated_Lib
or else
Project.Standalone_Library = Encapsulated);
else
-- Use a new context as we want to returns the same
-- project in different project tree for aggregated
-- projects.
Recursive_Check_Context
(Agg.Project, Agg.Tree, False, False);
end if;
Agg := Agg.Next;
end loop;
end;
end if;
if Imported_First then
Action
(Get_From_Tree (Project),
Tree,
Project_Context'(In_Aggregate_Lib, From_Encapsulated_Lib),
With_State);
end if;
end if;
end Recursive_Check;
-- Start of processing for Recursive_Check_Context
begin
Recursive_Check
(Project, Tree, In_Aggregate_Lib, From_Encapsulated_Lib);
end Recursive_Check_Context;
-- Start of processing for For_Every_Project_Imported
begin
Recursive_Check_Context
(Project => By,
Tree => Tree,
In_Aggregate_Lib => False,
From_Encapsulated_Lib => False);
end For_Every_Project_Imported_Context;
procedure For_Every_Project_Imported
(By : Project_Id;
Tree : Project_Tree_Ref;
With_State : in out State;
Include_Aggregated : Boolean := True;
Imported_First : Boolean := False)
is
procedure Internal
(Project : Project_Id;
Tree : Project_Tree_Ref;
Context : Project_Context;
With_State : in out State);
-- Action wrapper for handling the context
--------------
-- Internal --
--------------
procedure Internal
(Project : Project_Id;
Tree : Project_Tree_Ref;
Context : Project_Context;
With_State : in out State)
is
pragma Unreferenced (Context);
begin
Action (Project, Tree, With_State);
end Internal;
procedure For_Projects is
new For_Every_Project_Imported_Context (State, Internal);
begin
For_Projects (By, Tree, With_State, Include_Aggregated, Imported_First);
end For_Every_Project_Imported;
-----------------
-- Find_Source --
-----------------
function Find_Source
(In_Tree : Project_Tree_Ref;
Project : Project_Id;
In_Imported_Only : Boolean := False;
In_Extended_Only : Boolean := False;
Base_Name : File_Name_Type;
Index : Int := 0) return Source_Id
is
Result : Source_Id := No_Source;
procedure Look_For_Sources
(Proj : Project_Id;
Tree : Project_Tree_Ref;
Src : in out Source_Id);
-- Look for Base_Name in the sources of Proj
----------------------
-- Look_For_Sources --
----------------------
procedure Look_For_Sources
(Proj : Project_Id;
Tree : Project_Tree_Ref;
Src : in out Source_Id)
is
Iterator : Source_Iterator;
begin
Iterator := For_Each_Source (In_Tree => Tree, Project => Proj);
while Element (Iterator) /= No_Source loop
if Element (Iterator).File = Base_Name
and then (Index = 0 or else Element (Iterator).Index = Index)
then
Src := Element (Iterator);
-- If the source has been excluded, continue looking. We will
-- get the excluded source only if there is no other source
-- with the same base name that is not locally removed.
if not Element (Iterator).Locally_Removed then
return;
end if;
end if;
Next (Iterator);
end loop;
end Look_For_Sources;
procedure For_Imported_Projects is new For_Every_Project_Imported
(State => Source_Id, Action => Look_For_Sources);
Proj : Project_Id;
-- Start of processing for Find_Source
begin
if In_Extended_Only then
Proj := Project;
while Proj /= No_Project loop
Look_For_Sources (Proj, In_Tree, Result);
exit when Result /= No_Source;
Proj := Proj.Extends;
end loop;
elsif In_Imported_Only then
Look_For_Sources (Project, In_Tree, Result);
if Result = No_Source then
For_Imported_Projects
(By => Project,
Tree => In_Tree,
Include_Aggregated => False,
With_State => Result);
end if;
else
Look_For_Sources (No_Project, In_Tree, Result);
end if;
return Result;
end Find_Source;
----------------------
-- Find_All_Sources --
----------------------
function Find_All_Sources
(In_Tree : Project_Tree_Ref;
Project : Project_Id;
In_Imported_Only : Boolean := False;
In_Extended_Only : Boolean := False;
Base_Name : File_Name_Type;
Index : Int := 0) return Source_Ids
is
Result : Source_Ids (1 .. 1_000);
Last : Natural := 0;
type Empty_State is null record;
No_State : Empty_State;
-- This is needed for the State parameter of procedure Look_For_Sources
-- below, because of the instantiation For_Imported_Projects of generic
-- procedure For_Every_Project_Imported. As procedure Look_For_Sources
-- does not modify parameter State, there is no need to give its type
-- more than one value.
procedure Look_For_Sources
(Proj : Project_Id;
Tree : Project_Tree_Ref;
State : in out Empty_State);
-- Look for Base_Name in the sources of Proj
----------------------
-- Look_For_Sources --
----------------------
procedure Look_For_Sources
(Proj : Project_Id;
Tree : Project_Tree_Ref;
State : in out Empty_State)
is
Iterator : Source_Iterator;
Src : Source_Id;
begin
State := No_State;
Iterator := For_Each_Source (In_Tree => Tree, Project => Proj);
while Element (Iterator) /= No_Source loop
if Element (Iterator).File = Base_Name
and then (Index = 0
or else
(Element (Iterator).Unit /= No_Unit_Index
and then
Element (Iterator).Index = Index))
then
Src := Element (Iterator);
-- If the source has been excluded, continue looking. We will
-- get the excluded source only if there is no other source
-- with the same base name that is not locally removed.
if not Element (Iterator).Locally_Removed then
Last := Last + 1;
Result (Last) := Src;
end if;
end if;
Next (Iterator);
end loop;
end Look_For_Sources;
procedure For_Imported_Projects is new For_Every_Project_Imported
(State => Empty_State, Action => Look_For_Sources);
Proj : Project_Id;
-- Start of processing for Find_All_Sources
begin
if In_Extended_Only then
Proj := Project;
while Proj /= No_Project loop
Look_For_Sources (Proj, In_Tree, No_State);
exit when Last > 0;
Proj := Proj.Extends;
end loop;
elsif In_Imported_Only then
Look_For_Sources (Project, In_Tree, No_State);
if Last = 0 then
For_Imported_Projects
(By => Project,
Tree => In_Tree,
Include_Aggregated => False,
With_State => No_State);
end if;
else
Look_For_Sources (No_Project, In_Tree, No_State);
end if;
return Result (1 .. Last);
end Find_All_Sources;
----------
-- Hash --
----------
function Hash is new GNAT.HTable.Hash (Header_Num => Header_Num);
-- Used in implementation of other functions Hash below
----------
-- Hash --
----------
function Hash (Name : File_Name_Type) return Header_Num is
begin
return Hash (Get_Name_String (Name));
end Hash;
function Hash (Name : Name_Id) return Header_Num is
begin
return Hash (Get_Name_String (Name));
end Hash;
function Hash (Name : Path_Name_Type) return Header_Num is
begin
return Hash (Get_Name_String (Name));
end Hash;
function Hash (Project : Project_Id) return Header_Num is
begin
if Project = No_Project then
return Header_Num'First;
else
return Hash (Get_Name_String (Project.Name));
end if;
end Hash;
-----------
-- Image --
-----------
function Image (The_Casing : Casing_Type) return String is
begin
return The_Casing_Images (The_Casing).all;
end Image;
-----------------------------
-- Is_Standard_GNAT_Naming --
-----------------------------
function Is_Standard_GNAT_Naming
(Naming : Lang_Naming_Data) return Boolean
is
begin
return Get_Name_String (Naming.Spec_Suffix) = ".ads"
and then Get_Name_String (Naming.Body_Suffix) = ".adb"
and then Get_Name_String (Naming.Dot_Replacement) = "-";
end Is_Standard_GNAT_Naming;
----------------
-- Initialize --
----------------
procedure Initialize (Tree : Project_Tree_Ref) is
begin
if The_Empty_String = No_Name then
Uintp.Initialize;
Name_Len := 0;
The_Empty_String := Name_Find;
Name_Len := 1;
Name_Buffer (1) := '.';
The_Dot_String := Name_Find;
Prj.Attr.Initialize;
-- Make sure that new reserved words after Ada 95 may be used as
-- identifiers.
Opt.Ada_Version := Opt.Ada_95;
Opt.Ada_Version_Pragma := Empty;
Set_Name_Table_Byte (Name_Project, Token_Type'Pos (Tok_Project));
Set_Name_Table_Byte (Name_Extends, Token_Type'Pos (Tok_Extends));
Set_Name_Table_Byte (Name_External, Token_Type'Pos (Tok_External));
Set_Name_Table_Byte
(Name_External_As_List, Token_Type'Pos (Tok_External_As_List));
end if;
if Tree /= No_Project_Tree then
Reset (Tree);
end if;
end Initialize;
------------------
-- Is_Extending --
------------------
function Is_Extending
(Extending : Project_Id;
Extended : Project_Id) return Boolean
is
Proj : Project_Id;
begin
Proj := Extending;
while Proj /= No_Project loop
if Proj = Extended then
return True;
end if;
Proj := Proj.Extends;
end loop;
return False;
end Is_Extending;
-----------------
-- Object_Name --
-----------------
function Object_Name
(Source_File_Name : File_Name_Type;
Object_File_Suffix : Name_Id := No_Name) return File_Name_Type
is
begin
if Object_File_Suffix = No_Name then
return Extend_Name
(Source_File_Name, Object_Suffix);
else
return Extend_Name
(Source_File_Name, Get_Name_String (Object_File_Suffix));
end if;
end Object_Name;
function Object_Name
(Source_File_Name : File_Name_Type;
Source_Index : Int;
Index_Separator : Character;
Object_File_Suffix : Name_Id := No_Name) return File_Name_Type
is
Index_Img : constant String := Source_Index'Img;
Last : Natural;
begin
Get_Name_String (Source_File_Name);
Last := Name_Len;
while Last > 1 and then Name_Buffer (Last) /= '.' loop
Last := Last - 1;
end loop;
if Last > 1 then
Name_Len := Last - 1;
end if;
Add_Char_To_Name_Buffer (Index_Separator);
Add_Str_To_Name_Buffer (Index_Img (2 .. Index_Img'Last));
if Object_File_Suffix = No_Name then
Add_Str_To_Name_Buffer (Object_Suffix);
else
Add_Str_To_Name_Buffer (Get_Name_String (Object_File_Suffix));
end if;
return Name_Find;
end Object_Name;
----------------------
-- Record_Temp_File --
----------------------
procedure Record_Temp_File
(Shared : Shared_Project_Tree_Data_Access;
Path : Path_Name_Type)
is
begin
Temp_Files_Table.Append (Shared.Private_Part.Temp_Files, Path);
end Record_Temp_File;
----------
-- Free --
----------
procedure Free (List : in out Aggregated_Project_List) is
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Aggregated_Project, Aggregated_Project_List);
Tmp : Aggregated_Project_List;
begin
while List /= null loop
Tmp := List.Next;
Free (List.Tree);
Unchecked_Free (List);
List := Tmp;
end loop;
end Free;
----------------------------
-- Add_Aggregated_Project --
----------------------------
procedure Add_Aggregated_Project
(Project : Project_Id;
Path : Path_Name_Type)
is
Aggregated : Aggregated_Project_List;
begin
-- Check if the project is already in the aggregated project list. If it
-- is, do not add it again.
Aggregated := Project.Aggregated_Projects;
while Aggregated /= null loop
if Path = Aggregated.Path then
return;
else
Aggregated := Aggregated.Next;
end if;
end loop;
Project.Aggregated_Projects := new Aggregated_Project'
(Path => Path,
Project => No_Project,
Tree => null,
Next => Project.Aggregated_Projects);
end Add_Aggregated_Project;
----------
-- Free --
----------
procedure Free (Project : in out Project_Id) is
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Project_Data, Project_Id);
begin
if Project /= null then
Free (Project.Ada_Include_Path);
Free (Project.Objects_Path);
Free (Project.Ada_Objects_Path);
Free (Project.Ada_Objects_Path_No_Libs);
Free_List (Project.Imported_Projects, Free_Project => False);
Free_List (Project.All_Imported_Projects, Free_Project => False);
Free_List (Project.Languages);
case Project.Qualifier is
when Aggregate
| Aggregate_Library
=>
Free (Project.Aggregated_Projects);
when others =>
null;
end case;
Unchecked_Free (Project);
end if;
end Free;
---------------
-- Free_List --
---------------
procedure Free_List (Languages : in out Language_List) is
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Language_List_Element, Language_List);
Tmp : Language_List;
begin
while Languages /= null loop
Tmp := Languages.Next;
Unchecked_Free (Languages);
Languages := Tmp;
end loop;
end Free_List;
---------------
-- Free_List --
---------------
procedure Free_List (Source : in out Source_Id) is
procedure Unchecked_Free is new
Ada.Unchecked_Deallocation (Source_Data, Source_Id);
Tmp : Source_Id;
begin
while Source /= No_Source loop
Tmp := Source.Next_In_Lang;
Free_List (Source.Alternate_Languages);
if Source.Unit /= null
and then Source.Kind in Spec_Or_Body
then
Source.Unit.File_Names (Source.Kind) := null;
end if;
Unchecked_Free (Source);
Source := Tmp;
end loop;
end Free_List;
---------------
-- Free_List --
---------------
procedure Free_List
(List : in out Project_List;
Free_Project : Boolean)
is
procedure Unchecked_Free is new
Ada.Unchecked_Deallocation (Project_List_Element, Project_List);
Tmp : Project_List;
begin
while List /= null loop
Tmp := List.Next;
if Free_Project then
Free (List.Project);
end if;
Unchecked_Free (List);
List := Tmp;
end loop;
end Free_List;
---------------
-- Free_List --
---------------
procedure Free_List (Languages : in out Language_Ptr) is
procedure Unchecked_Free is new
Ada.Unchecked_Deallocation (Language_Data, Language_Ptr);
Tmp : Language_Ptr;
begin
while Languages /= null loop
Tmp := Languages.Next;
Free_List (Languages.First_Source);
Unchecked_Free (Languages);
Languages := Tmp;
end loop;
end Free_List;
--------------------------
-- Reset_Units_In_Table --
--------------------------
procedure Reset_Units_In_Table (Table : in out Units_Htable.Instance) is
Unit : Unit_Index;
begin
Unit := Units_Htable.Get_First (Table);
while Unit /= No_Unit_Index loop
if Unit.File_Names (Spec) /= null then
Unit.File_Names (Spec).Unit := No_Unit_Index;
end if;
if Unit.File_Names (Impl) /= null then
Unit.File_Names (Impl).Unit := No_Unit_Index;
end if;
Unit := Units_Htable.Get_Next (Table);
end loop;
end Reset_Units_In_Table;
----------------
-- Free_Units --
----------------
procedure Free_Units (Table : in out Units_Htable.Instance) is
procedure Unchecked_Free is new
Ada.Unchecked_Deallocation (Unit_Data, Unit_Index);
Unit : Unit_Index;
begin
Unit := Units_Htable.Get_First (Table);
while Unit /= No_Unit_Index loop
-- We cannot reset Unit.File_Names (Impl or Spec).Unit here as
-- Source_Data buffer is freed by the following instruction
-- Free_List (Tree.Projects, Free_Project => True);
Unchecked_Free (Unit);
Unit := Units_Htable.Get_Next (Table);
end loop;
Units_Htable.Reset (Table);
end Free_Units;
----------
-- Free --
----------
procedure Free (Tree : in out Project_Tree_Ref) is
procedure Unchecked_Free is new
Ada.Unchecked_Deallocation
(Project_Tree_Data, Project_Tree_Ref);
procedure Unchecked_Free is new
Ada.Unchecked_Deallocation
(Project_Tree_Appdata'Class, Project_Tree_Appdata_Access);
begin
if Tree /= null then
if Tree.Is_Root_Tree then
Name_List_Table.Free (Tree.Shared.Name_Lists);
Number_List_Table.Free (Tree.Shared.Number_Lists);
String_Element_Table.Free (Tree.Shared.String_Elements);
Variable_Element_Table.Free (Tree.Shared.Variable_Elements);
Array_Element_Table.Free (Tree.Shared.Array_Elements);
Array_Table.Free (Tree.Shared.Arrays);
Package_Table.Free (Tree.Shared.Packages);
Temp_Files_Table.Free (Tree.Shared.Private_Part.Temp_Files);
end if;
if Tree.Appdata /= null then
Free (Tree.Appdata.all);
Unchecked_Free (Tree.Appdata);
end if;
Source_Paths_Htable.Reset (Tree.Source_Paths_HT);
Source_Files_Htable.Reset (Tree.Source_Files_HT);
Reset_Units_In_Table (Tree.Units_HT);
Free_List (Tree.Projects, Free_Project => True);
Free_Units (Tree.Units_HT);
Unchecked_Free (Tree);
end if;
end Free;
-----------
-- Reset --
-----------
procedure Reset (Tree : Project_Tree_Ref) is
begin
-- Visible tables
if Tree.Is_Root_Tree then
-- We cannot use 'Access here:
-- "illegal attribute for discriminant-dependent component"
-- However, we know this is valid since Shared and Shared_Data have
-- the same lifetime and will always exist concurrently.
Tree.Shared := Tree.Shared_Data'Unrestricted_Access;
Name_List_Table.Init (Tree.Shared.Name_Lists);
Number_List_Table.Init (Tree.Shared.Number_Lists);
String_Element_Table.Init (Tree.Shared.String_Elements);
Variable_Element_Table.Init (Tree.Shared.Variable_Elements);
Array_Element_Table.Init (Tree.Shared.Array_Elements);
Array_Table.Init (Tree.Shared.Arrays);
Package_Table.Init (Tree.Shared.Packages);
-- Create Dot_String_List
String_Element_Table.Append
(Tree.Shared.String_Elements,
String_Element'
(Value => The_Dot_String,
Index => 0,
Display_Value => The_Dot_String,
Location => No_Location,
Flag => False,
Next => Nil_String));
Tree.Shared.Dot_String_List :=
String_Element_Table.Last (Tree.Shared.String_Elements);
-- Private part table
Temp_Files_Table.Init (Tree.Shared.Private_Part.Temp_Files);
Tree.Shared.Private_Part.Current_Source_Path_File := No_Path;
Tree.Shared.Private_Part.Current_Object_Path_File := No_Path;
end if;
Source_Paths_Htable.Reset (Tree.Source_Paths_HT);
Source_Files_Htable.Reset (Tree.Source_Files_HT);
Replaced_Source_HTable.Reset (Tree.Replaced_Sources);
Tree.Replaced_Source_Number := 0;
Reset_Units_In_Table (Tree.Units_HT);
Free_List (Tree.Projects, Free_Project => True);
Free_Units (Tree.Units_HT);
end Reset;
-------------------------------------
-- Set_Current_Object_Path_File_Of --
-------------------------------------
procedure Set_Current_Object_Path_File_Of
(Shared : Shared_Project_Tree_Data_Access;
To : Path_Name_Type)
is
begin
Shared.Private_Part.Current_Object_Path_File := To;
end Set_Current_Object_Path_File_Of;
-------------------------------------
-- Set_Current_Source_Path_File_Of --
-------------------------------------
procedure Set_Current_Source_Path_File_Of
(Shared : Shared_Project_Tree_Data_Access;
To : Path_Name_Type)
is
begin
Shared.Private_Part.Current_Source_Path_File := To;
end Set_Current_Source_Path_File_Of;
-----------------------
-- Set_Path_File_Var --
-----------------------
procedure Set_Path_File_Var (Name : String; Value : String) is
Host_Spec : String_Access := To_Host_File_Spec (Value);
begin
if Host_Spec = null then
Prj.Com.Fail
("could not convert file name """ & Value & """ to host spec");
else
Setenv (Name, Host_Spec.all);
Free (Host_Spec);
end if;
end Set_Path_File_Var;
-------------------
-- Switches_Name --
-------------------
function Switches_Name
(Source_File_Name : File_Name_Type) return File_Name_Type
is
begin
return Extend_Name (Source_File_Name, Switches_Dependency_Suffix);
end Switches_Name;
-----------
-- Value --
-----------
function Value (Image : String) return Casing_Type is
begin
for Casing in The_Casing_Images'Range loop
if To_Lower (Image) = To_Lower (The_Casing_Images (Casing).all) then
return Casing;
end if;
end loop;
raise Constraint_Error;
end Value;
---------------------
-- Has_Ada_Sources --
---------------------
function Has_Ada_Sources (Data : Project_Id) return Boolean is
Lang : Language_Ptr;
begin
Lang := Data.Languages;
while Lang /= No_Language_Index loop
if Lang.Name = Name_Ada then
return Lang.First_Source /= No_Source;
end if;
Lang := Lang.Next;
end loop;
return False;
end Has_Ada_Sources;
------------------------
-- Contains_ALI_Files --
------------------------
function Contains_ALI_Files (Dir : Path_Name_Type) return Boolean is
Dir_Name : constant String := Get_Name_String (Dir);
Direct : Dir_Type;
Name : String (1 .. 1_000);
Last : Natural;
Result : Boolean := False;
begin
Open (Direct, Dir_Name);
-- For each file in the directory, check if it is an ALI file
loop
Read (Direct, Name, Last);
exit when Last = 0;
Canonical_Case_File_Name (Name (1 .. Last));
Result := Last >= 5 and then Name (Last - 3 .. Last) = ".ali";
exit when Result;
end loop;
Close (Direct);
return Result;
exception
-- If there is any problem, close the directory if open and return True.
-- The library directory will be added to the path.
when others =>
if Is_Open (Direct) then
Close (Direct);
end if;
return True;
end Contains_ALI_Files;
--------------------------
-- Get_Object_Directory --
--------------------------
function Get_Object_Directory
(Project : Project_Id;
Including_Libraries : Boolean;
Only_If_Ada : Boolean := False) return Path_Name_Type
is
begin
if (Project.Library and then Including_Libraries)
or else
(Project.Object_Directory /= No_Path_Information
and then (not Including_Libraries or else not Project.Library))
then
-- For a library project, add the library ALI directory if there is
-- no object directory or if the library ALI directory contains ALI
-- files; otherwise add the object directory.
if Project.Library then
if Project.Object_Directory = No_Path_Information
or else
(Including_Libraries
and then
Contains_ALI_Files (Project.Library_ALI_Dir.Display_Name))
then
return Project.Library_ALI_Dir.Display_Name;
else
return Project.Object_Directory.Display_Name;
end if;
-- For a non-library project, add object directory if it is not a
-- virtual project, and if there are Ada sources in the project or
-- one of the projects it extends. If there are no Ada sources,
-- adding the object directory could disrupt the order of the
-- object dirs in the path.
elsif not Project.Virtual then
declare
Add_Object_Dir : Boolean;
Prj : Project_Id;
begin
Add_Object_Dir := not Only_If_Ada;
Prj := Project;
while not Add_Object_Dir and then Prj /= No_Project loop
if Has_Ada_Sources (Prj) then
Add_Object_Dir := True;
else
Prj := Prj.Extends;
end if;
end loop;
if Add_Object_Dir then
return Project.Object_Directory.Display_Name;
end if;
end;
end if;
end if;
return No_Path;
end Get_Object_Directory;
-----------------------------------
-- Ultimate_Extending_Project_Of --
-----------------------------------
function Ultimate_Extending_Project_Of
(Proj : Project_Id) return Project_Id
is
Prj : Project_Id;
begin
Prj := Proj;
while Prj /= null and then Prj.Extended_By /= No_Project loop
Prj := Prj.Extended_By;
end loop;
return Prj;
end Ultimate_Extending_Project_Of;
-----------------------------------
-- Compute_All_Imported_Projects --
-----------------------------------
procedure Compute_All_Imported_Projects
(Root_Project : Project_Id;
Tree : Project_Tree_Ref)
is
procedure Analyze_Tree
(Local_Root : Project_Id;
Local_Tree : Project_Tree_Ref;
Context : Project_Context);
-- Process Project and all its aggregated project to analyze their own
-- imported projects.
------------------
-- Analyze_Tree --
------------------
procedure Analyze_Tree
(Local_Root : Project_Id;
Local_Tree : Project_Tree_Ref;
Context : Project_Context)
is
pragma Unreferenced (Local_Root);
Project : Project_Id;
procedure Recursive_Add
(Prj : Project_Id;
Tree : Project_Tree_Ref;
Context : Project_Context;
Dummy : in out Boolean);
-- Recursively add the projects imported by project Project, but not
-- those that are extended.
-------------------
-- Recursive_Add --
-------------------
procedure Recursive_Add
(Prj : Project_Id;
Tree : Project_Tree_Ref;
Context : Project_Context;
Dummy : in out Boolean)
is
pragma Unreferenced (Tree);
List : Project_List;
Prj2 : Project_Id;
begin
-- A project is not importing itself
Prj2 := Ultimate_Extending_Project_Of (Prj);
if Project /= Prj2 then
-- Check that the project is not already in the list. We know
-- the one passed to Recursive_Add have never been visited
-- before, but the one passed it are the extended projects.
List := Project.All_Imported_Projects;
while List /= null loop
if List.Project = Prj2 then
return;
end if;
List := List.Next;
end loop;
-- Add it to the list
Project.All_Imported_Projects :=
new Project_List_Element'
(Project => Prj2,
From_Encapsulated_Lib =>
Context.From_Encapsulated_Lib
or else Analyze_Tree.Context.From_Encapsulated_Lib,
Next => Project.All_Imported_Projects);
end if;
end Recursive_Add;
procedure For_All_Projects is
new For_Every_Project_Imported_Context (Boolean, Recursive_Add);
Dummy : Boolean := False;
List : Project_List;
begin
List := Local_Tree.Projects;
while List /= null loop
Project := List.Project;
Free_List
(Project.All_Imported_Projects, Free_Project => False);
For_All_Projects
(Project, Local_Tree, Dummy, Include_Aggregated => False);
List := List.Next;
end loop;
end Analyze_Tree;
procedure For_Aggregates is
new For_Project_And_Aggregated_Context (Analyze_Tree);
-- Start of processing for Compute_All_Imported_Projects
begin
For_Aggregates (Root_Project, Tree);
end Compute_All_Imported_Projects;
-------------------
-- Is_Compilable --
-------------------
function Is_Compilable (Source : Source_Id) return Boolean is
begin
case Source.Compilable is
when Unknown =>
if Source.Language.Config.Compiler_Driver /= No_File
and then
Length_Of_Name (Source.Language.Config.Compiler_Driver) /= 0
and then not Source.Locally_Removed
and then (Source.Language.Config.Kind /= File_Based
or else Source.Kind /= Spec)
then
-- Do not modify Source.Compilable before the source record
-- has been initialized.
if Source.Source_TS /= Empty_Time_Stamp then
Source.Compilable := Yes;
end if;
return True;
else
if Source.Source_TS /= Empty_Time_Stamp then
Source.Compilable := No;
end if;
return False;
end if;
when Yes =>
return True;
when No =>
return False;
end case;
end Is_Compilable;
------------------------------
-- Object_To_Global_Archive --
------------------------------
function Object_To_Global_Archive (Source : Source_Id) return Boolean is
begin
return Source.Language.Config.Kind = File_Based
and then Source.Kind = Impl
and then Source.Language.Config.Objects_Linked
and then Is_Compilable (Source)
and then Source.Language.Config.Object_Generated;
end Object_To_Global_Archive;
----------------------------
-- Get_Language_From_Name --
----------------------------
function Get_Language_From_Name
(Project : Project_Id;
Name : String) return Language_Ptr
is
N : Name_Id;
Result : Language_Ptr;
begin
Name_Len := Name'Length;
Name_Buffer (1 .. Name_Len) := Name;
To_Lower (Name_Buffer (1 .. Name_Len));
N := Name_Find;
Result := Project.Languages;
while Result /= No_Language_Index loop
if Result.Name = N then
return Result;
end if;
Result := Result.Next;
end loop;
return No_Language_Index;
end Get_Language_From_Name;
----------------
-- Other_Part --
----------------
function Other_Part (Source : Source_Id) return Source_Id is
begin
if Source.Unit /= No_Unit_Index then
case Source.Kind is
when Impl => return Source.Unit.File_Names (Spec);
when Spec => return Source.Unit.File_Names (Impl);
when Sep => return No_Source;
end case;
else
return No_Source;
end if;
end Other_Part;
------------------
-- Create_Flags --
------------------
function Create_Flags
(Report_Error : Error_Handler;
When_No_Sources : Error_Warning;
Require_Sources_Other_Lang : Boolean := True;
Allow_Duplicate_Basenames : Boolean := True;
Compiler_Driver_Mandatory : Boolean := False;
Error_On_Unknown_Language : Boolean := True;
Require_Obj_Dirs : Error_Warning := Error;
Allow_Invalid_External : Error_Warning := Error;
Missing_Source_Files : Error_Warning := Error;
Ignore_Missing_With : Boolean := False)
return Processing_Flags
is
begin
return Processing_Flags'
(Report_Error => Report_Error,
When_No_Sources => When_No_Sources,
Require_Sources_Other_Lang => Require_Sources_Other_Lang,
Allow_Duplicate_Basenames => Allow_Duplicate_Basenames,
Error_On_Unknown_Language => Error_On_Unknown_Language,
Compiler_Driver_Mandatory => Compiler_Driver_Mandatory,
Require_Obj_Dirs => Require_Obj_Dirs,
Allow_Invalid_External => Allow_Invalid_External,
Missing_Source_Files => Missing_Source_Files,
Ignore_Missing_With => Ignore_Missing_With,
Incomplete_Withs => False);
end Create_Flags;
------------
-- Length --
------------
function Length
(Table : Name_List_Table.Instance;
List : Name_List_Index) return Natural
is
Count : Natural := 0;
Tmp : Name_List_Index;
begin
Tmp := List;
while Tmp /= No_Name_List loop
Count := Count + 1;
Tmp := Table.Table (Tmp).Next;
end loop;
return Count;
end Length;
------------------
-- Debug_Output --
------------------
procedure Debug_Output (Str : String) is
begin
if Current_Verbosity > Default then
Set_Standard_Error;
Write_Line ((1 .. Debug_Level * 2 => ' ') & Str);
Set_Standard_Output;
end if;
end Debug_Output;
------------------
-- Debug_Indent --
------------------
procedure Debug_Indent is
begin
if Current_Verbosity = High then
Set_Standard_Error;
Write_Str ((1 .. Debug_Level * 2 => ' '));
Set_Standard_Output;
end if;
end Debug_Indent;
------------------
-- Debug_Output --
------------------
procedure Debug_Output (Str : String; Str2 : Name_Id) is
begin
if Current_Verbosity > Default then
Debug_Indent;
Set_Standard_Error;
Write_Str (Str);
if Str2 = No_Name then
Write_Line (" <no_name>");
else
Write_Line (" """ & Get_Name_String (Str2) & '"');
end if;
Set_Standard_Output;
end if;
end Debug_Output;
---------------------------
-- Debug_Increase_Indent --
---------------------------
procedure Debug_Increase_Indent
(Str : String := ""; Str2 : Name_Id := No_Name)
is
begin
if Str2 /= No_Name then
Debug_Output (Str, Str2);
else
Debug_Output (Str);
end if;
Debug_Level := Debug_Level + 1;
end Debug_Increase_Indent;
---------------------------
-- Debug_Decrease_Indent --
---------------------------
procedure Debug_Decrease_Indent (Str : String := "") is
begin
if Debug_Level > 0 then
Debug_Level := Debug_Level - 1;
end if;
if Str /= "" then
Debug_Output (Str);
end if;
end Debug_Decrease_Indent;
----------------
-- Debug_Name --
----------------
function Debug_Name (Tree : Project_Tree_Ref) return Name_Id is
P : Project_List;
begin
Name_Len := 0;
Add_Str_To_Name_Buffer ("Tree [");
P := Tree.Projects;
while P /= null loop
if P /= Tree.Projects then
Add_Char_To_Name_Buffer (',');
end if;
Add_Str_To_Name_Buffer (Get_Name_String (P.Project.Name));
P := P.Next;
end loop;
Add_Char_To_Name_Buffer (']');
return Name_Find;
end Debug_Name;
----------
-- Free --
----------
procedure Free (Tree : in out Project_Tree_Appdata) is
pragma Unreferenced (Tree);
begin
null;
end Free;
--------------------------------
-- For_Project_And_Aggregated --
--------------------------------
procedure For_Project_And_Aggregated
(Root_Project : Project_Id;
Root_Tree : Project_Tree_Ref)
is
Agg : Aggregated_Project_List;
begin
Action (Root_Project, Root_Tree);
if Root_Project.Qualifier in Aggregate_Project then
Agg := Root_Project.Aggregated_Projects;
while Agg /= null loop
For_Project_And_Aggregated (Agg.Project, Agg.Tree);
Agg := Agg.Next;
end loop;
end if;
end For_Project_And_Aggregated;
----------------------------------------
-- For_Project_And_Aggregated_Context --
----------------------------------------
procedure For_Project_And_Aggregated_Context
(Root_Project : Project_Id;
Root_Tree : Project_Tree_Ref)
is
procedure Recursive_Process
(Project : Project_Id;
Tree : Project_Tree_Ref;
Context : Project_Context);
-- Process Project and all aggregated projects recursively
-----------------------
-- Recursive_Process --
-----------------------
procedure Recursive_Process
(Project : Project_Id;
Tree : Project_Tree_Ref;
Context : Project_Context)
is
Agg : Aggregated_Project_List;
Ctx : Project_Context;
begin
Action (Project, Tree, Context);
if Project.Qualifier in Aggregate_Project then
Ctx :=
(In_Aggregate_Lib => Project.Qualifier = Aggregate_Library,
From_Encapsulated_Lib =>
Context.From_Encapsulated_Lib
or else Project.Standalone_Library = Encapsulated);
Agg := Project.Aggregated_Projects;
while Agg /= null loop
Recursive_Process (Agg.Project, Agg.Tree, Ctx);
Agg := Agg.Next;
end loop;
end if;
end Recursive_Process;
-- Start of processing for For_Project_And_Aggregated_Context
begin
Recursive_Process
(Root_Project, Root_Tree, Project_Context'(False, False));
end For_Project_And_Aggregated_Context;
-----------------------------
-- Set_Ignore_Missing_With --
-----------------------------
procedure Set_Ignore_Missing_With
(Flags : in out Processing_Flags;
Value : Boolean)
is
begin
Flags.Ignore_Missing_With := Value;
end Set_Ignore_Missing_With;
-- Package initialization for Prj
begin
-- Make sure that the standard config and user project file extensions are
-- compatible with canonical case file naming.
Canonical_Case_File_Name (Config_Project_File_Extension);
Canonical_Case_File_Name (Project_File_Extension);
end Prj;
|
RASD/Latex File/Alloy/Model2.als | SaeidRezaei90/GalbiatiRezaei | 0 | 4525 | open util/boolean
sig string {}
sig Name, Surname{}
//sig Email, Password{}
abstract sig User {
// name: one Name,
// surname: one Surname,
// email: one Email,
// password: one Password,
accessLevel: one Bool,
minedInfo: some MinedInfo,
}
sig EndUser extends User{
userLocation: one Location,
}{
accessLevel = False
}
sig Authority extends User{
tickets: Ticket,
}{
#tickets >= 1
accessLevel = True
}
sig Location {
latitude: one Int ,
longitude:one Int
}
sig Photo {}
sig Violation {
location: one Location,
addr: some ReverseGioCoding,
reporter: one EndUser,
//type: one string,
photo: one Photo,
licensePlate: one ALPR,
// date: one Date
}
sig ReverseGioCoding {
loc: some Location,
//addr: one string
}{#ReverseGioCoding = 1}
sig ALPR { //remember to add somethin to tell it's only one
picture: some Photo ,
// licenseP: one string
}{ #ALPR = 1}
sig Date {}
abstract sig MinedInfo {
violations: some Violation,
}
sig MinedStreet extends MinedInfo{
/*
// name: some string,
frequency: some Int,
location : one Location,*/
}
sig MinedOffender extends MinedInfo{
/*
n_Violations: one Int,
licensePlate: one Int,
uuid: one Int*/
}
sig Ticket {
violations: one Violation,
}
fact NoSameGPSForDifferentUsers {
no disjoint u1, u2 : EndUser |
u1.userLocation = u2.userLocation
}
fact NoSameGPSForDifferentReverseGio {
no disjoint revGio1, revGio2: ReverseGioCoding |
revGio1.loc = revGio2.loc
}
fact NoSamePhotoForDifferentViolation {
no disjoint v1,v2 : Violation |
v1.photo = v2.photo
}
fact NoSameViolationForDiffReporter{
no disjoint v1, v2 : Violation |
v1.reporter = v2.reporter
}
fact EachTicketOneAuthority {
all t: Ticket | one au: Authority |
au.tickets = t
}
//Two different users can’t have the same email
/*fact NoSameEmailForDifferentUsers {
no disjoint u1, u2 : User |
u1.email = u2.email
}*/
fact NoSameMinedInfoForDifferentUsers {
all disjoint u1,u2: User | u1.minedInfo != u2.minedInfo
/* no disjoint u1,u2: User |
u1.minedInfo = u2.minedInfo
*/
}
fact EqualUserAndLocation{
#EndUser = #Location
}
//fact {all u: User | some n: Name | u.name = n}
//fact {all u: User | all n: Surname | u.surname = n}
fact EndUserRelateOnlyMinedStreet {
all user: EndUser |
user.minedInfo = MinedStreet
}
//fact { all mined: MinedInfo | one us: User | us.minedInfo = mined}
//fact { all us: User | some mined: MinedInfo | us.minedInfo = mined}
fact EachPhotoBelongsAlpr {
all ph: Photo|
one alpr: ALPR |
alpr.picture = ph
}
////
fact EqualLocationForEndUserAndGio {
one revGio: ReverseGioCoding|
one u: EndUser |
revGio.loc = u.userLocation
}
fact EqualLocationForViolationAndEndUser {
all viol: Violation |
some u:EndUser|
viol.location = u.userLocation
}
//fact {all d: Date, viol: Violation | viol.date = d}
fact EachViolatioContainsOneTicket {
one t: Ticket , v:Violation |
t.violations = v
}
pred show {
}
run show for 4
|
src/data/sample_scripts/benchmark_substract.asm | ambertide/SASVM | 0 | 16574 | load R5, 01010001b
load R4, 1
substract:
load R6, 11111111b
xor R7, R5, R6
and R8, R7, R4
xor R5, R5, R4
move R4, R8
addi R4, R4, R4
jmpEQ R4 = R0, end
jmp substract
end:
move RF, R5
halt
|
Transynther/x86/_processed/AVXALIGN/_zr_/i9-9900K_12_0xa0_notsx.log_97_787.asm | ljhsiun2/medusa | 9 | 1481 | <gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r13
push %r14
push %r15
push %rax
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WT_ht+0x810, %rsi
nop
nop
nop
nop
add $58527, %rdx
mov (%rsi), %eax
add $34234, %r13
lea addresses_UC_ht+0x16016, %rsi
lea addresses_normal_ht+0x147e8, %rdi
nop
nop
sub $3219, %r13
mov $114, %rcx
rep movsw
nop
xor %rsi, %rsi
lea addresses_WC_ht+0xf786, %rsi
lea addresses_normal_ht+0x1e446, %rdi
nop
nop
dec %r15
mov $97, %rcx
rep movsl
nop
xor %rdi, %rdi
lea addresses_UC_ht+0x10c96, %rsi
lea addresses_D_ht+0x7e86, %rdi
clflush (%rsi)
clflush (%rdi)
nop
nop
nop
nop
nop
cmp %rax, %rax
mov $108, %rcx
rep movsq
inc %rax
lea addresses_A_ht+0x3686, %rcx
nop
nop
cmp %rdi, %rdi
mov $0x6162636465666768, %rax
movq %rax, (%rcx)
nop
add $47090, %r15
lea addresses_WT_ht+0x2586, %rsi
lea addresses_WT_ht+0x1d5f6, %rdi
nop
nop
nop
nop
xor $12315, %r13
mov $57, %rcx
rep movsl
nop
nop
xor %rax, %rax
lea addresses_D_ht+0x1c2c6, %r15
nop
sub %r13, %r13
movl $0x61626364, (%r15)
nop
nop
and %rsi, %rsi
lea addresses_WC_ht+0xeb86, %rsi
lea addresses_UC_ht+0x1b86, %rdi
nop
nop
nop
nop
nop
xor $55588, %r13
mov $61, %rcx
rep movsl
sub %rdx, %rdx
lea addresses_normal_ht+0x173a6, %rsi
lea addresses_WT_ht+0x1286, %rdi
clflush (%rdi)
and $35728, %r14
mov $122, %rcx
rep movsl
nop
cmp $12612, %rsi
lea addresses_A_ht+0xb7f6, %rsi
lea addresses_A_ht+0xba26, %rdi
nop
nop
nop
nop
nop
sub $44344, %rax
mov $96, %rcx
rep movsb
and $42842, %r13
lea addresses_WC_ht+0x19bce, %rcx
nop
cmp %r14, %r14
movb (%rcx), %al
cmp %rdx, %rdx
lea addresses_D_ht+0xbf86, %r14
nop
nop
cmp $37990, %rdi
mov (%r14), %r15w
nop
nop
and %r13, %r13
lea addresses_normal_ht+0x12d86, %rsi
lea addresses_normal_ht+0x4bc6, %rdi
nop
and %r13, %r13
mov $36, %rcx
rep movsb
nop
add %rsi, %rsi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rax
pop %r15
pop %r14
pop %r13
ret
.global s_faulty_load
s_faulty_load:
push %r13
push %r15
push %r8
push %r9
push %rax
push %rbx
// Load
mov $0x659f270000000c8e, %r9
and %r13, %r13
mov (%r9), %r15
nop
nop
nop
nop
cmp %r13, %r13
// Faulty Load
lea addresses_A+0x1eb86, %rbx
nop
nop
nop
nop
dec %r9
mov (%rbx), %ax
lea oracles, %r9
and $0xff, %rax
shlq $12, %rax
mov (%r9,%rax,1), %rax
pop %rbx
pop %rax
pop %r9
pop %r8
pop %r15
pop %r13
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_A', 'AVXalign': False, 'size': 32, 'NT': False, 'same': False, 'congruent': 0}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_NC', 'AVXalign': False, 'size': 8, 'NT': False, 'same': False, 'congruent': 3}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'type': 'addresses_A', 'AVXalign': True, 'size': 2, 'NT': False, 'same': True, 'congruent': 0}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_WT_ht', 'AVXalign': True, 'size': 4, 'NT': False, 'same': False, 'congruent': 0}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_UC_ht', 'congruent': 2, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_normal_ht', 'congruent': 1, 'same': False}}
{'src': {'type': 'addresses_WC_ht', 'congruent': 10, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_normal_ht', 'congruent': 5, 'same': False}}
{'src': {'type': 'addresses_UC_ht', 'congruent': 0, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_D_ht', 'congruent': 7, 'same': True}}
{'OP': 'STOR', 'dst': {'type': 'addresses_A_ht', 'AVXalign': False, 'size': 8, 'NT': False, 'same': False, 'congruent': 8}}
{'src': {'type': 'addresses_WT_ht', 'congruent': 7, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_WT_ht', 'congruent': 3, 'same': True}}
{'OP': 'STOR', 'dst': {'type': 'addresses_D_ht', 'AVXalign': False, 'size': 4, 'NT': False, 'same': True, 'congruent': 5}}
{'src': {'type': 'addresses_WC_ht', 'congruent': 11, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_UC_ht', 'congruent': 11, 'same': False}}
{'src': {'type': 'addresses_normal_ht', 'congruent': 2, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_WT_ht', 'congruent': 8, 'same': False}}
{'src': {'type': 'addresses_A_ht', 'congruent': 4, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_A_ht', 'congruent': 5, 'same': False}}
{'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 1, 'NT': False, 'same': True, 'congruent': 0}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'size': 2, 'NT': False, 'same': False, 'congruent': 4}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_normal_ht', 'congruent': 8, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_normal_ht', 'congruent': 5, 'same': False}}
{'00': 97}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
alloy4fun_models/trashltl/models/0/47mgLzWR88pbRYvQg.als | Kaixi26/org.alloytools.alloy | 0 | 4260 | open main
pred id47mgLzWR88pbRYvQg_prop1 {
no Trash & Protected
}
pred __repair { id47mgLzWR88pbRYvQg_prop1 }
check __repair { id47mgLzWR88pbRYvQg_prop1 <=> prop1o }
|
3-mid/impact/source/3d/math/impact-d3-convex_hull_computer.ads | charlie5/lace | 20 | 22693 | with impact.d3.Containers,
ada.containers.Vectors;
private
with Interfaces,
System;
package impact.d3.convex_hull_Computer
--
-- Convex hull implementation based on Preparata and Hong
--
-- See http://code.google.com/p/bullet/issues/detail?id=275
-- <NAME>, MAXON Computer GmbH
--
is
--- Edge
--
type Edge is tagged
record
next,
m_reverse,
targetVertex : Integer;
end record;
type Edge_view is access all Edge'Class;
type Edges is array (Positive range <>) of aliased Edge;
function getSourceVertex (Self : access Edge) return Integer;
function getTargetVertex (Self : in Edge) return Integer;
function getNextEdgeOfVertex (Self : access Edge) return Edge_view; -- clockwise list of all edges of a vertex
function getNextEdgeOfFace (Self : access Edge) return Edge_view; -- counter-clockwise list of all edges of a face
function getReverseEdge (Self : access Edge) return Edge_view;
package edge_Vectors is new ada.containers.Vectors (Positive, Edge_view);
subtype edge_Vector is edge_Vectors.Vector;
--- impact.d3.convex_HullComputer
--
type Item is tagged
record
vertices : impact.d3.Containers.vector_3_Vector; -- Vertices of the output hull.
edges : edge_Vector; -- Edges of the output hull.
faces : impact.d3.Containers. integer_Vector; -- Faces of the convex hull. Each entry is an index into the "edges" array pointing to an edge of the face.
-- Faces are planar n-gons.
end record;
function compute (Self : access Item'Class; coords : access math.Real;
stride : in Integer;
count : in Integer;
shrink : in math.Real;
shrinkClamp : in math.Real) return math.Real;
--
-- Compute convex hull of "count" vertices stored in "coords". "stride" is the difference in bytes
-- between the addresses of consecutive vertices. If "shrink" is positive, the convex hull is shrunken
-- by that amount (each face is moved by "shrink" length units towards the center along its normal).
-- If "shrinkClamp" is positive, "shrink" is clamped to not exceed "shrinkClamp * innerRadius", where "innerRadius"
-- is the minimum distance of a face to the center of the convex hull.
--
-- The returned value is the amount by which the hull has been shrunken. If it is negative, the amount was so large
-- that the resulting convex hull is empty.
--
-- The output convex hull can be found in the member variables "vertices", "edges", "faces".
function compute (Self : access Item'Class; coords : access Long_Float;
stride : in Integer;
count : in Integer;
shrink : in math.Real;
shrinkClamp : in math.Real) return math.Real;
--
-- same as above, but double precision
private
function compute (Self : access Item'Class; coords : in system.Address;
doubleCoords : in Boolean;
stride : in Integer;
count : in Integer;
the_shrink : in math.Real;
shrinkClamp : in math.Real) return math.Real;
-- impact.d3.Scalar compute(const void* coords, bool doubleCoords, int stride, int count, impact.d3.Scalar shrink, impact.d3.Scalar shrinkClamp);
subtype int32_t is interfaces.Integer_32;
subtype int64_t is interfaces.Integer_64;
subtype uint32_t is interfaces.Unsigned_32;
subtype uint64_t is interfaces.Unsigned_64;
--- Point64
--
type Point64 is tagged
record
x : int64_t;
y : int64_t;
z : int64_t;
end record;
--- Point32
--
type Point32 is tagged
record
x, y, z : int32_t;
index : Integer;
end record;
overriding function "=" (Self : in Point32; Other : in Point32) return Boolean;
function dot (Self : in Point32; b : in Point32 ) return int64_t;
function dot (Self : in Point32; b : in Point64'Class) return int64_t;
function cross (Self : in Point32'Class; b : in Point32'Class) return Point64;
function cross (Self : in Point32'Class; b : in Point64'Class) return Point64;
--- Rational64
--
type Rational64 is tagged
record
numerator,
denominator : uint64_t;
sign : Integer;
end record;
function isNaN (Self : in Rational64) return Boolean;
function compare (Self, b : in Rational64) return Integer;
end impact.d3.convex_hull_Computer;
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3605a.ada | best08618/asylo | 7 | 12183 | <filename>gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3605a.ada
-- CE3605A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT PUT FOR CHARACTER AND STRING PARAMETERS DOES NOT
-- UPDATE THE LINE NUMBER WHEN THE LINE LENGTH IS UNBOUNDED,
-- ONLY THE COLUMN NUMBER.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- CREATION OF TEMPORARY TEXT FILES WITH OUT_FILE MODE.
-- HISTORY:
-- SPS 09/02/82
-- JBG 02/22/84 CHANGED TO .ADA TEST
-- RJW 11/04/86 REVISED TEST TO OUTPUT A NOT_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- JLH 09/08/87 CORRECTED EXCEPTION HANDLING AND ADDED CHECKS
-- FOR COLUMN NUMBER.
-- RJW 03/28/90 REVISED NUMERIC LITERALS USED IN LOOPS.
WITH REPORT;
USE REPORT;
WITH TEXT_IO;
USE TEXT_IO;
PROCEDURE CE3605A IS
INCOMPLETE : EXCEPTION;
BEGIN
TEST ("CE3605A", "CHECK THAT PUT FOR CHARACTER AND STRING " &
"PARAMETERS DOES NOT UPDATE THE LINE NUMBER " &
"WHEN THE LINE LENGTH IS UNBOUNDED, ONLY THE " &
"COLUMN NUMBER");
DECLARE
FILE1 : FILE_TYPE;
LN : POSITIVE_COUNT := 1;
BEGIN
BEGIN
CREATE (FILE1);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON TEXT CREATE " &
"FOR TEMPORARY FILES WITH " &
"OUT_FILE MODE");
RAISE INCOMPLETE;
END;
LN := LINE (FILE1);
IF LN /= 1 THEN
FAILED ("CURRENT LINE NUMBER NOT INITIALLY ONE");
END IF;
IF COL (FILE1) /= 1 THEN
FAILED ("CURRENT COLUMN NUMBER NOT INITIALLY ONE");
END IF;
FOR I IN 1 .. IDENT_INT(240) LOOP
PUT(FILE1, 'A');
END LOOP;
IF LINE (FILE1) /= LN THEN
FAILED ("PUT ALTERED LINE NUMBER - CHARACTER");
END IF;
IF COL(FILE1) /= 241 THEN
FAILED ("COLUMN NUMBER NOT UPDATED CORRECTLY - 1");
END IF;
NEW_LINE(FILE1);
LN := LINE (FILE1);
FOR I IN 1 .. IDENT_INT(40) LOOP
PUT (FILE1, "STRING");
END LOOP;
IF LN /= LINE (FILE1) THEN
FAILED ("PUT ALTERED LINE NUMBER - STRING");
END IF;
IF COL(FILE1) /= 241 THEN
FAILED ("COLUMN NUMBER NOT UPDATED CORRECTLY - 2");
END IF;
CLOSE (FILE1);
EXCEPTION
WHEN INCOMPLETE =>
NULL;
END;
RESULT;
END CE3605A;
|
alloy4fun_models/trashltl/models/5/HTiDkhsqAjdtMxmfo.als | Kaixi26/org.alloytools.alloy | 0 | 1060 | <filename>alloy4fun_models/trashltl/models/5/HTiDkhsqAjdtMxmfo.als
open main
pred idHTiDkhsqAjdtMxmfo_prop6 {
all f : File | always (f in Trash implies always f in Trash)
}
pred __repair { idHTiDkhsqAjdtMxmfo_prop6 }
check __repair { idHTiDkhsqAjdtMxmfo_prop6 <=> prop6o } |
oeis/157/A157609.asm | neoneye/loda-programs | 11 | 90827 | <reponame>neoneye/loda-programs
; A157609: 2662n - 22.
; 2640,5302,7964,10626,13288,15950,18612,21274,23936,26598,29260,31922,34584,37246,39908,42570,45232,47894,50556,53218,55880,58542,61204,63866,66528,69190,71852,74514,77176,79838,82500,85162,87824,90486,93148,95810,98472,101134,103796,106458,109120,111782,114444,117106,119768,122430,125092,127754,130416,133078,135740,138402,141064,143726,146388,149050,151712,154374,157036,159698,162360,165022,167684,170346,173008,175670,178332,180994,183656,186318,188980,191642,194304,196966,199628,202290,204952
mul $0,2662
add $0,2640
|
programs/oeis/141/A141940.asm | neoneye/loda | 22 | 87390 | ; A141940: Primes congruent to 17 mod 25.
; 17,67,167,317,367,467,617,967,1117,1217,1367,1567,1667,1867,2017,2267,2417,2467,2617,2767,2917,3067,3167,3217,3467,3517,3617,3767,3917,3967,4217,4517,4567,4817,4967,5167,5417,5717,5867,6067,6217,6317,6367,6917,6967,7417,7517,7717,7817,7867,8017,8117,8167,8317,8467,8867,9067,9467,9767,9817,9967,10067,10267,10567,10667,10867,11117,11317,11467,11617,11717,11867,12517,12917,12967,13217,13267,13367,13417,13567,13967,14717,14767,14867,15017,15217,15467,15667,15767,15817,16067,16217,16267,16417,16567,17117,17167,17317,17417,17467
mov $2,$0
add $2,1
pow $2,2
lpb $2
add $1,16
sub $2,1
mov $3,$1
seq $3,10051 ; Characteristic function of primes: 1 if n is prime, else 0.
sub $0,$3
add $1,9
mov $4,$0
max $4,0
cmp $4,$0
mul $2,$4
lpe
div $1,2
sub $1,22
mul $1,2
add $1,37
mov $0,$1
|
chap15/ex36/unroll_reduce.asm | JamesType/optimization-manual | 374 | 15076 | ;
; Copyright (C) 2021 by Intel Corporation
;
; Permission to use, copy, modify, and/or distribute this software for any
; purpose with or without fee is hereby granted.
;
; 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.
;
; .globl unroll_reduce
; float unroll_reduce(float *a, uint32_t len)
; On entry:
; rcx = a
; edx = len
; xmm0 = retval
.code
unroll_reduce PROC public
push rbx
sub rsp, 32
vmovaps xmmword ptr[rsp], xmm6
vmovaps xmmword ptr[rsp+16], xmm7
mov eax, edx
mov rbx, rcx
vmovups ymm0, ymmword ptr [rbx]
vmovups ymm1, ymmword ptr 32[rbx]
vmovups ymm2, ymmword ptr 64[rbx]
vmovups ymm3, ymmword ptr 96[rbx]
vmovups ymm4, ymmword ptr 128[rbx]
vmovups ymm5, ymmword ptr 160[rbx]
vmovups ymm6, ymmword ptr 192[rbx]
vmovups ymm7, ymmword ptr 224[rbx]
sub eax, 64
loop_start:
add rbx, 256
vaddps ymm0, ymm0, ymmword ptr [rbx]
vaddps ymm1, ymm1, ymmword ptr 32[rbx]
vaddps ymm2, ymm2, ymmword ptr 64[rbx]
vaddps ymm3, ymm3, ymmword ptr 96[rbx]
vaddps ymm4, ymm4, ymmword ptr 128[rbx]
vaddps ymm5, ymm5, ymmword ptr 160[rbx]
vaddps ymm6, ymm6, ymmword ptr 192[rbx]
vaddps ymm7, ymm7, ymmword ptr 224[rbx]
sub eax, 64
jnz loop_start
vaddps ymm0, ymm0, ymm1
vaddps ymm2, ymm2, ymm3
vaddps ymm4, ymm4, ymm5
vaddps ymm6, ymm6, ymm7
vaddps ymm0, ymm0, ymm2
vaddps ymm4, ymm4, ymm6
vaddps ymm0, ymm0, ymm4
vextractf128 xmm1, ymm0, 1
vaddps xmm0, xmm0, xmm1
vpermilps xmm1, xmm0, 0eh
vaddps xmm0, xmm0, xmm1
vpermilps xmm1, xmm0, 1
vaddss xmm0, xmm0, xmm1
; The following instruction is not needed as xmm0 already
; holds the return value.
; movss result, xmm0
vzeroupper
vmovaps xmm7, xmmword ptr[rsp+16]
vmovaps xmm6, xmmword ptr[rsp]
add rsp, 32
pop rbx
ret
unroll_reduce ENDP
end |
oeis/166/A166665.asm | neoneye/loda-programs | 11 | 169817 | ; A166665: Totally multiplicative sequence with a(p) = 7p+1 for prime p.
; Submitted by <NAME>
; 1,15,22,225,36,330,50,3375,484,540,78,4950,92,750,792,50625,120,7260,134,8100,1100,1170,162,74250,1296,1380,10648,11250,204,11880,218,759375,1716,1800,1800,108900,260,2010,2024,121500,288,16500,302,17550,17424,2430,330,1113750,2500,19440,2640,20700,372,159720,2808,168750,2948,3060,414,178200,428,3270,24200,11390625,3312,25740,470,27000,3564,27000,498,1633500,512,3900,28512,30150,3900,30360,554,1822500,234256,4320,582,247500,4320,4530,4488,263250,624,261360,4600,36450,4796,4950,4824,16706250,680
add $0,1
mul $0,2
mov $1,1
mov $2,2
mov $4,1
lpb $0
mul $1,$4
mov $3,$0
lpb $3
mov $4,$0
mod $4,$2
add $2,1
cmp $4,0
cmp $4,0
sub $3,$4
lpe
div $0,$2
mov $4,$2
add $5,$2
lpb $5
mul $4,6
add $4,$5
mov $5,1
lpe
lpe
mov $0,$1
div $0,14
|
oeis/191/A191745.asm | neoneye/loda-programs | 11 | 168692 | ; A191745: a(n) = 12*n^3 + 9*n^2 + 2*n.
; 0,23,136,411,920,1735,2928,4571,6736,9495,12920,17083,22056,27911,34720,42555,51488,61591,72936,85595,99640,115143,132176,150811,171120,193175,217048,242811,270536,300295,332160,366203,402496,441111,482120,525595,571608,620231,671536,725595,782480,842263,905016,970811,1039720,1111815,1187168,1265851,1347936,1433495,1522600,1615323,1711736,1811911,1915920,2023835,2135728,2251671,2371736,2495995,2624520,2757383,2894656,3036411,3182720,3333655,3489288,3649691,3814936,3985095,4160240,4340443
mul $0,4
mov $1,1
add $1,$0
pow $1,3
mul $1,3
sub $1,$0
div $1,16
mov $0,$1
|
wayland_egl_ada/src/wayland-egl.adb | onox/wayland-ada | 5 | 14145 | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2020 onox <<EMAIL>>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
package body Wayland.EGL is
use type EGL_API.EGL_Window_Ptr;
function Is_Initialized (Object : Window) return Boolean is (Object.Handle /= null);
procedure Create_Window
(Object : in out Window;
Surface : Protocols.Client.Surface;
Width, Height : Natural) is
begin
Object.Handle := EGL_API.Window_Create (Surface.Get_Proxy, Width, Height);
end Create_Window;
procedure Destroy (Object : in out Window) is
begin
EGL_API.Window_Destroy (Object.Handle);
Object.Handle := null;
end Destroy;
procedure Resize
(Object : Window;
Size : Dimension;
X, Y : Integer := 0) is
begin
EGL_API.Window_Resize (Object.Handle, Size.Width, Size.Height, X, Y);
end Resize;
function Attached_Size (Object : Window) return Dimension is
Width, Height : Natural;
begin
EGL_API.Get_Attached_Size (Object.Handle, Width, Height);
return (Width => Width, Height => Height);
end Attached_Size;
end Wayland.EGL;
|
agda-stdlib/src/Data/Vec/Relation/Equality/Setoid.agda | DreamLinuxer/popl21-artifact | 5 | 7586 | <gh_stars>1-10
------------------------------------------------------------------------
-- The Agda standard library
--
-- This module is DEPRECATED. Please use
-- Data.Vec.Relation.Binary.Equality.Setoid directly.
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary
module Data.Vec.Relation.Equality.Setoid
{a ℓ} (S : Setoid a ℓ) where
open import Data.Vec.Relation.Binary.Equality.Setoid S public
{-# WARNING_ON_IMPORT
"Data.Vec.Relation.Equality.Setoid was deprecated in v1.0.
Use Data.Vec.Relation.Binary.Equality.Setoid instead."
#-}
|
SOAS/Metatheory/Semantics.agda | JoeyEremondi/agda-soas | 39 | 11993 |
open import SOAS.Common
open import SOAS.Families.Core
open import Categories.Object.Initial
open import SOAS.Coalgebraic.Strength
import SOAS.Metatheory.MetaAlgebra
-- Initial-algebra semantics
module SOAS.Metatheory.Semantics {T : Set}
(⅀F : Functor 𝔽amiliesₛ 𝔽amiliesₛ) (⅀:Str : Strength ⅀F)
(𝔛 : Familyₛ) (open SOAS.Metatheory.MetaAlgebra ⅀F 𝔛)
(𝕋:Init : Initial 𝕄etaAlgebras)
where
open import SOAS.Context
open import SOAS.Variable
open import SOAS.Construction.Structure as Structure
open import SOAS.Abstract.Hom
import SOAS.Abstract.Coalgebra as →□ ; open →□.Sorted
import SOAS.Abstract.Box as □ ; open □.Sorted
open import SOAS.Metatheory.Algebra ⅀F
open Strength ⅀:Str
private
variable
Γ Δ Θ Π : Ctx
α β : T
𝒫 𝒬 𝒜 : Familyₛ
open Initial 𝕋:Init
open Object ⊥ public renaming (𝐶 to 𝕋 ; ˢ to 𝕋ᵃ)
open MetaAlg 𝕋ᵃ public renaming (𝑎𝑙𝑔 to 𝕒𝕝𝕘 ; 𝑣𝑎𝑟 to 𝕧𝕒𝕣 ; 𝑚𝑣𝑎𝑟 to 𝕞𝕧𝕒𝕣 ;
𝑚≈₁ to 𝕞≈₁ ; 𝑚≈₂ to 𝕞≈₂)
module Semantics (𝒜ᵃ : MetaAlg 𝒜) where
open Morphism (! {𝒜 ⋉ 𝒜ᵃ}) public renaming (𝑓 to 𝕤𝕖𝕞 ; ˢ⇒ to 𝕤𝕖𝕞ᵃ⇒)
open MetaAlg⇒ 𝕤𝕖𝕞ᵃ⇒ public renaming (⟨𝑎𝑙𝑔⟩ to ⟨𝕒⟩ ; ⟨𝑣𝑎𝑟⟩ to ⟨𝕧⟩ ; ⟨𝑚𝑣𝑎𝑟⟩ to ⟨𝕞⟩)
open MetaAlg 𝒜ᵃ
module 𝒜 = MetaAlg 𝒜ᵃ
eq : {g h : 𝕋 ⇾̣ 𝒜} (gᵃ : MetaAlg⇒ 𝕋ᵃ 𝒜ᵃ g) (hᵃ : MetaAlg⇒ 𝕋ᵃ 𝒜ᵃ h) (t : 𝕋 α Γ)
→ g t ≡ h t
eq {g = g}{h} gᵃ hᵃ t = !-unique₂ (g ⋉ gᵃ) (h ⋉ hᵃ) {x = t}
-- The interpretation is equal to any other pointed meta-Λ-algebra
𝕤𝕖𝕞! : {g : 𝕋 ⇾̣ 𝒜}(gᵃ : MetaAlg⇒ 𝕋ᵃ 𝒜ᵃ g)(t : 𝕋 α Γ) → 𝕤𝕖𝕞 t ≡ g t
𝕤𝕖𝕞! {g = g} gᵃ t = !-unique (g ⋉ gᵃ) {x = t}
-- Corollaries: every meta-algebra endo-homomorphism is the identity, including 𝕤𝕖𝕞
eq-id : {g : 𝕋 ⇾̣ 𝕋} (gᵃ : MetaAlg⇒ 𝕋ᵃ 𝕋ᵃ g) (t : 𝕋 α Γ) →
g t ≡ t
eq-id gᵃ t = Semantics.eq 𝕋ᵃ gᵃ (idᵃ 𝕋ᵃ) t
𝕤𝕖𝕞-id : {t : 𝕋 α Γ} → Semantics.𝕤𝕖𝕞 𝕋ᵃ t ≡ t
𝕤𝕖𝕞-id {t = t} = eq-id (Semantics.𝕤𝕖𝕞ᵃ⇒ 𝕋ᵃ) t
|
Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0x84_notsx.log_21829_2036.asm | ljhsiun2/medusa | 9 | 102188 | .global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r14
push %r8
push %rcx
push %rdi
push %rsi
lea addresses_normal_ht+0xc7e6, %rsi
lea addresses_D_ht+0x1688e, %rdi
nop
nop
cmp $65160, %r8
mov $94, %rcx
rep movsw
nop
nop
nop
nop
add %r8, %r8
lea addresses_UC_ht+0x1741e, %r10
nop
and $7976, %r14
mov (%r10), %r12w
nop
nop
nop
nop
add %r12, %r12
lea addresses_D_ht+0x208e, %r12
clflush (%r12)
nop
nop
nop
and $18321, %rdi
movb $0x61, (%r12)
nop
nop
nop
nop
nop
and %r14, %r14
lea addresses_UC_ht+0x1308e, %rsi
nop
nop
nop
nop
and %r14, %r14
mov (%rsi), %r10d
nop
nop
nop
nop
nop
sub %r14, %r14
lea addresses_WC_ht+0x1188e, %r8
and %rcx, %rcx
vmovups (%r8), %ymm3
vextracti128 $1, %ymm3, %xmm3
vpextrq $1, %xmm3, %rdi
nop
xor %rcx, %rcx
lea addresses_WC_ht+0x19762, %r14
nop
nop
nop
nop
nop
dec %rdi
mov $0x6162636465666768, %r12
movq %r12, %xmm6
vmovups %ymm6, (%r14)
nop
nop
nop
cmp $4827, %r8
lea addresses_WC_ht+0x14cce, %r10
nop
dec %rsi
mov $0x6162636465666768, %rdi
movq %rdi, %xmm4
vmovups %ymm4, (%r10)
nop
nop
nop
nop
dec %rcx
lea addresses_WC_ht+0x13d8e, %rsi
nop
nop
nop
mfence
movups (%rsi), %xmm5
vpextrq $0, %xmm5, %rcx
nop
nop
nop
dec %rcx
lea addresses_normal_ht+0x88e, %r14
cmp %r10, %r10
mov (%r14), %edi
nop
nop
nop
nop
xor %r10, %r10
pop %rsi
pop %rdi
pop %rcx
pop %r8
pop %r14
pop %r12
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r13
push %r8
push %r9
push %rax
push %rbx
// Faulty Load
lea addresses_D+0x1808e, %r13
nop
nop
nop
and %rbx, %rbx
movb (%r13), %al
lea oracles, %r8
and $0xff, %rax
shlq $12, %rax
mov (%r8,%rax,1), %rax
pop %rbx
pop %rax
pop %r9
pop %r8
pop %r13
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_D', 'same': False, 'size': 8, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'type': 'addresses_D', 'same': True, 'size': 1, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_normal_ht', 'congruent': 1, 'same': False}, 'dst': {'type': 'addresses_D_ht', 'congruent': 7, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 2, 'congruent': 1, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 1, 'congruent': 11, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 4, 'congruent': 11, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WC_ht', 'same': False, 'size': 32, 'congruent': 10, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_WC_ht', 'same': False, 'size': 32, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WC_ht', 'same': False, 'size': 32, 'congruent': 4, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_WC_ht', 'same': False, 'size': 16, 'congruent': 7, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_normal_ht', 'same': False, 'size': 4, 'congruent': 11, 'NT': True, 'AVXalign': False}, 'OP': 'LOAD'}
{'36': 21829}
36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36
*/
|
bin/src/LIB.asm | xohozu/aEditor | 10 | 164526 | <gh_stars>1-10
INCLUDE MACRO.ASM
GLOBAL SEGMENT PUBLIC
EXTRN MOUSE_BUF:BYTE
EXTRN CUR_X:WORD, CUR_Y:WORD, PRE_X:WORD, PRE_Y:WORD
EXTRN ON_LEFT_CLICK:WORD, ON_RIGHT_CLICK:WORD
GLOBAL ENDS
;公共函数
PUBLIC _SAVE_BLOCK ;保存矩形块像素值到缓冲区
PUBLIC _RESTORE_BLOCK ;将缓冲区像素值还原到矩形块
PUBLIC _DISPLAY_STRING ;在指定行列显示字符串
PUBLIC _WRITE_BLOCK_PIXEL ;以像素方式填充某一矩形块
CODE SEGMENT
ASSUME CS:CODE,ES:GLOBAL
;以像素方式填充某一矩形块
;入口参数：矩形块左上角坐标(X,Y), 宽度WIDTH,高度HEIGHT, 填充属性ATTR(颜色)
;出口参数：无
PIXEL_X EQU [BP+20]
PIXEL_Y EQU [BP+18]
PIXEL_WIDTH EQU [BP+16]
PIXEL_HEIGHT EQU [BP+14]
PIXEL_ATTR EQU [BP+12]
_WRITE_BLOCK_PIXEL PROC FAR
PUSH AX
PUSH BX
PUSH CX
PUSH BP
MOV BP,SP
PUSH PIXEL_Y
MOV CX,PIXEL_HEIGHT
WRITE_HEIGHT_LOOP:
PUSH CX
PUSH PIXEL_X
MOV CX,PIXEL_WIDTH
WRITE_WIDTH_LOOP:
__WRITE_PIXEL PIXEL_X,PIXEL_Y,PIXEL_ATTR
INC WORD PTR PIXEL_X
LOOP WRITE_WIDTH_LOOP
POP PIXEL_X
POP CX
INC WORD PTR PIXEL_Y
LOOP WRITE_HEIGHT_LOOP
POP PIXEL_Y
POP BP
POP CX
POP BX
POP AX
RET
_WRITE_BLOCK_PIXEL ENDP
;保存矩形块像素值到缓冲区
;入口参数：矩形块左上角坐标(X,Y), 宽度WIDTH,高度HEIGHT, 缓冲区偏移地址ADDRESS(在GLOBAL数据段)
;出口参数：无
BLOCK_X EQU [BP+24]
BLOCK_Y EQU [BP+22]
BLOCK_WIDTH EQU [BP+20]
BLOCK_HEIGHT EQU [BP+18]
BLOCK_ADDR EQU [BP+16]
_SAVE_BLOCK PROC FAR
PUSH AX
PUSH BX
PUSH CX
PUSH SI
PUSH ES
PUSH BP
MOV AX,GLOBAL
MOV ES,AX
MOV BP,SP
MOV SI,BLOCK_ADDR
PUSH BLOCK_Y ;保护Y坐标
MOV CX,BLOCK_HEIGHT
SAVE_HEIGHT_LOOP:
PUSH CX
PUSH BLOCK_X ;保护X坐标
MOV CX,BLOCK_WIDTH
SAVE_WIDTH_LOOP:
__READ_PIXEL BLOCK_X,BLOCK_Y
MOV ES:[SI],AL
INC SI
INC WORD PTR BLOCK_X
LOOP SAVE_WIDTH_LOOP
POP BLOCK_X
POP CX
INC WORD PTR BLOCK_Y
LOOP SAVE_HEIGHT_LOOP
POP BLOCK_Y
POP BP
POP ES
POP SI
POP CX
POP BX
POP AX
RET
_SAVE_BLOCK ENDP
;将缓冲区像素值还原到矩形块
;入口参数：矩形块左上角坐标(X,Y), 宽度WIDTH,高度HEIGHT, 缓冲区偏移地址ADDRESS(在GLOBAL数据段)
;出口参数：无
_RESTORE_BLOCK PROC FAR
PUSH AX
PUSH BX
PUSH CX
PUSH SI
PUSH ES
PUSH BP
MOV AX,GLOBAL
MOV ES,AX
MOV BP,SP
MOV SI,BLOCK_ADDR
PUSH BLOCK_Y ;保护Y坐标
MOV CX,BLOCK_HEIGHT
RESTORE_HEIGHT_LOOP:
PUSH CX
PUSH BLOCK_X ;保护X坐标
MOV CX,BLOCK_WIDTH
RESTORE_WIDTH_LOOP:
MOV BL,ES:[SI]
__WRITE_PIXEL BLOCK_X,BLOCK_Y,BL
INC SI
INC WORD PTR BLOCK_X
LOOP RESTORE_WIDTH_LOOP
POP BLOCK_X
POP CX
INC WORD PTR BLOCK_Y
LOOP RESTORE_HEIGHT_LOOP
POP BLOCK_Y
POP BP
POP ES
POP SI
POP CX
POP BX
POP AX
RET
_RESTORE_BLOCK ENDP
;在指定行列显示字符串
;入口参数：显示起始位置坐标(行,列),需显示字符串地址(段:偏移地址),字符串长度,显示颜色
;出口参数：无
ROW EQU [BP+26]
COL EQU [BP+24]
STR_SEG EQU [BP+22]
STR_ADDR EQU [BP+20]
STR_LEN EQU [BP+18]
STR_COLOR EQU [BP+16]
_DISPLAY_STRING PROC FAR
__PUSH_REGS
PUSH ES
PUSH BP
MOV BP,SP
MOV BH,0
MOV BL,STR_COLOR ;;;;;;
MOV DH,ROW
MOV DL,COL
MOV ES,STR_SEG
MOV CX,STR_LEN
MOV AX,STR_ADDR
MOV BP,AX
MOV AX,1300H
INT 10H
POP BP
POP ES
__POP_REGS
RET
_DISPLAY_STRING ENDP
CODE ENDS
END
|
extra/extra/Membership.agda | manikdv/plfa.github.io | 1,003 | 4885 | open import Data.Sum using (_⊎_; inj₁; inj₂)
open import Data.List using (List; []; _∷_; [_]; _++_)
open import Data.List.Any using (Any; here; there)
open import Data.List.Any.Membership.Propositional using (_∈_)
open import Data.Nat using (ℕ)
open import Relation.Binary.PropositionalEquality using (_≡_; refl)
-- open import Data.List.Any.Membership.Propositional.Properties using (∈-++⁺ˡ; ∈-++⁺ʳ; ∈-++⁻)
Id = ℕ
_⊆_ : List Id → List Id → Set
xs ⊆ ys = ∀ {w} → w ∈ xs → w ∈ ys
lemma : ∀ {x : Id} → x ∈ [ x ]
lemma = here refl
|
intel8080_assembler/cpudiag.asm | AgustinCB/emulators | 8 | 17957 | <gh_stars>1-10
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
JMP 01abH
MOV C,L
MOV C,C
MOV B,E
MOV D,D
MOV C,A
MOV B,E
MOV C,A
MOV D,E
MOV C,L
NOP
MOV B,C
MOV D,E
MOV D,E
MOV C,A
MOV B,E
MOV C,C
MOV B,C
MOV D,H
MOV B,L
MOV D,E
NOP
NOP
NOP
NOP
NOP
CMA
NOP
NOP
NOP
DCR M
NOP
MOV B,E
MOV D,B
MOV D,L
NOP
MOV B,H
MOV C,C
MOV B,C
MOV B,A
MOV C,M
MOV C,A
MOV D,E
MOV D,H
MOV C,C
MOV B,E
NOP
MOV D,M
MOV B,L
MOV D,D
MOV D,E
MOV C,C
MOV C,A
MOV C,M
NOP
LXI SP,302eH
NOP
NOP
MOV B,E
DAD H
NOP
LXI SP,3839H
NOP
PUSH D
RNC
MVI C,09H
CALL 0005H
POP D
RET
MVI C,02H
CALL 0005H
RET
PUSH PSW
CALL 0164H
MOV E,A
CALL 014eH
POP PSW
CALL 0168H
MOV E,A
JMP 014eH
RRC
RRC
RRC
RRC
ANI 0fH
CPI 0aH
JM 0171H
ADI 07H
ADI 30H
RET
INR C
DCR C
LDAX B
NOP
MOV B,E
MOV D,B
MOV D,L
NOP
MOV C,C
MOV D,E
NOP
MOV C,A
MOV D,B
MOV B,L
MOV D,D
MOV B,C
MOV D,H
MOV C,C
MOV C,A
MOV C,M
MOV B,C
MOV C,H
INR H
INR C
DCR C
LDAX B
NOP
MOV B,E
MOV D,B
MOV D,L
NOP
MOV C,B
MOV B,C
MOV D,E
NOP
MOV B,M
MOV B,C
MOV C,C
MOV C,H
MOV B,L
MOV B,H
LXI H,4520H
MOV D,D
MOV D,D
MOV C,A
MOV D,D
NOP
MOV B,L
MOV E,B
MOV C,C
MOV D,H
DCR A
INR H
LXI SP,07adH
ANI 00
JZ 01b6H
CALL 0689H
JNC 01bcH
CALL 0689H
JPE 01c2H
CALL 0689H
JP 01c8H
CALL 0689H
JNZ 01d7H
JC 01d7H
JPO 01d7H
JM 01d7H
JMP 01daH
CALL 0689H
ADI 06H
JNZ 01e2H
CALL 0689H
JC 01ebH
JPO 01ebH
JP 01eeH
CALL 0689H
ADI 70H
JPO 01f6H
CALL 0689H
JM 01ffH
JZ 01ffH
JNC 0202H
CALL 0689H
ADI 81H
JM 020aH
CALL 0689H
JZ 0213H
JC 0213H
JPO 0216H
CALL 0689H
ADI 00feH
JC 021eH
CALL 0689H
JZ 0227H
JPO 0227H
JM 022aH
CALL 0689H
CPI 00H
JC 0242H
JZ 0242H
CPI 00f5H
JC 0242H
JNZ 0242H
CPI 00ffH
JZ 0242H
JC 0245H
CALL 0689H
ACI 0aH
ACI 0aH
CPI 0bH
JZ 0251H
CALL 0689H
SUI 0cH
SUI 0fH
CPI 00f0H
JZ 025dH
CALL 0689H
SBI 00f1H
SBI 0eH
CPI 00f0H
JZ 0269H
CALL 0689H
ANI 55H
CPI 50H
JZ 0273H
CALL 0689H
ORI 3aH
CPI 7aH
JZ 027dH
CALL 0689H
XRI 0fH
CPI 75H
JZ 0287H
CALL 0689H
ANI 00H
CC 0689H
CPO 0689H
CM 0689H
CNZ 0689H
CPI 00H
JZ 029dH
CALL 0689H
SUI 77H
CNC 0689H
CPE 0689H
CP 0689H
CZ 0689H
CPI 89H
JZ 02b3H
CALL 0689H
ANI 00ffH
CPO 02c0H
CPI 00d9H
JZ 031dH
CALL 0689H
RPE
ADI 10H
CPE 02ccH
ADI 02H
RPO
CALL 0689H
RPO
ADI 20H
CM 02d8H
ADI 04H
RPE
CALL 0689H
RP
ADI 80H
CP 02e4H
ADI 80H
RM
CALL 0689H
RM
ADI 40H
CNC 02f0H
ADI 40H
RP
CALL 0689H
RC
ADI 8fH
CC 02fcH
SUI 02H
RNC
CALL 0689H
RNC
ADI 00f7H
CNZ 0308H
ADI 00feH
RC
CALL 0689H
RZ
ADI 01H
CZ 0314H
ADI 00d0H
RNZ
CALL 0689H
RNZ
ADI 47H
CPI 47H
RZ
CALL 0689H
MVI A,77H
INR A
MOV B,A
INR B
MOV C,B
DCR C
MOV D,C
MOV E,D
MOV H,E
MOV L,H
MOV A,L
DCR A
MOV C,A
MOV E,C
MOV L,E
MOV B,L
MOV D,B
MOV H,D
MOV A,H
MOV D,A
INR D
MOV L,D
MOV C,L
INR C
MOV H,C
MOV B,H
DCR B
MOV E,B
MOV A,E
MOV E,A
INR E
MOV B,E
MOV H,B
INR H
MOV C,H
MOV L,C
MOV D,L
DCR D
MOV A,D
MOV H,A
DCR H
MOV D,H
MOV B,D
MOV L,B
INR L
MOV E,L
DCR E
MOV C,E
MOV A,C
MOV L,A
DCR L
MOV H,L
MOV E,H
MOV D,E
MOV C,D
MOV B,C
MOV A,B
CPI 77H
CNZ 0689H
XRA A
MVI B,01H
MVI C,03H
MVI D,07H
MVI E,0fH
MVI H,1fH
MVI L,3fH
ADD B
ADD C
ADD D
ADD E
ADD H
ADD L
ADD A
CPI 00f0H
CNZ 0689H
SUB B
SUB C
SUB D
SUB E
SUB H
SUB L
CPI 78H
CNZ 0689H
SUB A
CNZ 0689H
MVI A,80H
ADD A
MVI B,01H
MVI C,02H
MVI D,03H
MVI E,04H
MVI H,05H
MVI L,06H
ADC B
MVI B,80H
ADD B
ADD B
ADC C
ADD B
ADD B
ADC D
ADD B
ADD B
ADC E
ADD B
ADD B
ADC H
ADD B
ADD B
ADC L
ADD B
ADD B
ADC A
CPI 37H
CNZ 0689H
MVI A,80H
ADD A
MVI B,01H
SBB B
MVI B,00ffH
ADD B
SBB C
ADD B
SBB D
ADD B
SBB E
ADD B
SBB H
ADD B
SBB L
CPI 00e0H
CNZ 0689H
MVI A,80H
ADD A
SBB A
CPI 00ffH
CNZ 0689H
MVI A,00ffH
MVI B,00feH
MVI C,00fcH
MVI D,00efH
MVI E,7fH
MVI H,00f4H
MVI L,00bfH
ANA A
ANA C
ANA D
ANA E
ANA H
ANA L
ANA A
CPI 24H
CNZ 0689H
XRA A
MVI B,01H
MVI C,02H
MVI D,04H
MVI E,08H
MVI H,10H
MVI L,20H
ORA B
ORA C
ORA D
ORA E
ORA H
ORA L
ORA A
CPI 3fH
CNZ 0689H
MVI A,00H
MVI H,8fH
MVI L,4fH
XRA B
XRA C
XRA D
XRA E
XRA H
XRA L
CPI 00cfH
CNZ 0689H
XRA A
CNZ 0689H
MVI B,44H
MVI C,45H
MVI D,46H
MVI E,47H
MVI H,06H
MVI L,0a6H
MOV M,B
MVI B,00H
MOV B,M
MVI A,44H
CMP B
CNZ 0689H
MOV M,D
MVI D,00H
MOV D,M
MVI A,46H
CMP D
CNZ 0689H
MOV M,E
MVI E,00H
MOV E,M
MVI A,47H
CMP E
CNZ 0689H
MOV M,H
MVI H,06H
MVI L,00a6H
MOV H,M
MVI A,06H
CMP H
CNZ 0689H
MOV M,L
MVI H,06H
MVI L,00a6H
MOV L,M
MVI A,00a6H
CMP L
CNZ 0689H
MVI H,06H
MVI L,00a6H
MVI A,32H
MOV M,A
CMP M
CNZ 0689H
ADD M
CPI 64H
CNZ 0689H
XRA A
MOV A,M
CPI 32H
CNZ 0689H
MVI H,06H
MVI L,0a6H
MOV A,M
SUB M
CNZ 0689H
MVI A,80H
ADD A
ADC M
CPI 33H
CNZ 0689H
MVI A,80H
ADD A
SBB M
CPI 00cdH
CNZ 0689H
ANA M
CNZ 0689H
MVI A,25H
ORA M
CPI 37H
CNZ 0689H
XRA M
CPI 05H
CNZ 0689H
MVI M,55H
INR M
DCR M
ADD M
CPI 5aH
CNZ 0689H
LXI B,12ffH
LXI D,12ffH
LXI H,12ffH
INX B
INX D
INX H
MVI A,13H
CMP B
CNZ 0689H
CMP D
CNZ 0689H
CMP H
CNZ 0689H
MVI A,00H
CMP C
CNZ 0689H
CMP E
CNZ 0689H
CMP L
CNZ 0689H
DCX B
DCX D
DCX H
MVI A,12H
CMP B
CNZ 0689H
CMP D
CNZ 0689H
CMP H
CNZ 0689H
MVI A,00ffH
CMP C
CNZ 0689H
CMP E
CNZ 0689H
CMP L
CNZ 0689H
STA 06a6H
XRA A
LDA 06a6H
CPI 00ffH
CNZ 0689H
LHLD 06a4H
SHLD 06a6H
LDA 06a4H
MOV B,A
LDA 06a6H
CMP B
CNZ 0689H
LDA 06a5H
MOV B,A
LDA 06a7H
CMP B
CNZ 0689H
MVI A,00aaH
STA 06a6H
MOV B,H
MOV C,L
XRA A
LDAX B
CPI 00aaH
CNZ 0689H
INR A
STAX B
LDA 06a6H
CPI 00abH
CNZ 0689H
MVI A,77H
STA 06a6H
LHLD 06a4H
LXI D,0000H
RNC
XRA A
LDAX D
CPI 77H
CNZ 0689H
XRA A
ADD H
ADD L
CNZ 0689H
MVI A,00ccH
STAX D
LDA 06a6H
CPI 00ccH
STAX D
LDA 06a6H
CPI 00ccH
CNZ 0689H
LXI H,7777H
DAD H
MVI A,00eeH
CMP H
CNZ 0689H
CMP L
CNZ 0689H
LXI H,5555H
LXI B,0ffffH
DAD B
MVI A,55H
CNC 0689H
CMP H
CNZ 0689H
MVI A,54H
CMP L
CNZ 0689H
LXI H,0aaaaH
LXI D,3333H
DAD D
MVI A,0ddH
CMP H
CNZ 0689H
CMP L
CNZ 0689H
STC
CNC 0689H
CMC
CC 0689H
MVI A,00aaH
CMA
CPI 55H
CNZ 0689H
ORA A
DAA
CPI 55H
CNZ 0689H
MVI A,88H
ADD A
DAA
CPI 76H
CNZ 0689H
XRA A
MVI A,00aaH
DAA
CNC 0689H
CPI 10H
CNZ 0689H
XRA A
MVI A,9aH
DAA
CNC 0689H
CNZ 0689H
STC
MVI A,42H
RLC
CC 0689H
RLC
CNC 0689H
CPI 09H
CNZ 0689H
RRC
CNC 0689H
RRC
CPI 42H
CNZ 0689H
RAL
RAL
CNC 0689H
CPI 08H
CNZ 0689H
RAR
RAR
CC 0689H
CPI 02H
CNZ 0689H
LXI B,1234H
LXI D,0aaaaH
LXI H,5555H
XRA A
PUSH B
PUSH D
PUSH H
PUSH PSW
LXI B,0000H
LXI D,0000H
LXI H,0000H
MVI A,0c0H
ADI 0f0H
POP PSW
POP H
POP D
POP B
CC 0689H
CNZ 0689H
CPO 0689H
CM 0689H
MVI A,12H
CMP B
CNZ 0689H
MVI A,34H
CMP C
CNZ 0689H
MVI A,0aaH
CMP D
CNZ 0689H
CMP E
CNZ 0689H
MVI A,55H
CMP H
CNZ 0689H
CMP L
CNZ 0689H
LXI H,0000H
DAD SP
SHLD 06abH
LXI SP,06aaH
DCX SP
DCX SP
INX SP
DCX SP
MVI A,55H
STA 06a8H
CMA
STA 06a9H
POP B
CMP B
CNZ 0689H
CMA
CMP C
CNZ 0689H
LXI H,06aaH
SPHL
LXI H,7733H
DCX SP
DCX SP
XTHL
LDA 06a9H
CPI 77H
CNZ 0689H
LDA 06a8H
CPI 33H
CNZ 0689H
MVI A,55H
CMP L
CNZ 0689H
CMA
CMP H
CNZ 0689H
LHLD 06abH
SPHL
LXI H,069bH
PCHL
LXI H,018bH
CALL 0145H
XTHL
MOV A,H
CALL 0154H
MOV A,L
CALL 0154H
JMP 0000H
LXI H,0174H
CALL 0145H
JMP 0000H
ANA M
MVI B,00H
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP
NOP |
programs/oeis/060/A060510.asm | neoneye/loda | 22 | 97567 | ; A060510: Alternating with hexagonal stutters: if n is hexagonal (2k^2 - k, i.e., A000384) then a(n)=a(n-1), otherwise a(n) = 1 - a(n-1).
; 0,0,1,0,1,0,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0
seq $0,25691 ; Exponent of 10 (value of j) in n-th number of form 9^i*10^j.
mod $0,2
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/volatile2.ads | best08618/asylo | 7 | 30876 | with volatile1; use volatile1;
package volatile2 is
type PData_Array is access Data_Array;
type Result_Desc is
record
Data : PData_Array;
end record;
type Result is access Result_Desc;
procedure Copy;
end volatile2;
|
test_factorize/src/test_mv_factor.adb | rogermc2/GA_Ada | 3 | 9479 |
with Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
with GL.Types;
with Maths;
with Blade;
with Blade_Types;
with GA_Maths;
with GA_Utilities;
with Multivectors; use Multivectors;
with Multivector_Type;
with Multivector_Utilities;
procedure Test_MV_Factor is
use GL.Types;
use Blade;
-- use Blade.Names_Package;
no_bv : Multivector := Basis_Vector (Blade_Types.C3_no);
e1_bv : Multivector := Basis_Vector (Blade_Types.C3_e1);
e2_bv : Multivector := Basis_Vector (Blade_Types.C3_e2);
e3_bv : Multivector := Basis_Vector (Blade_Types.C3_e3);
ni_bv : Multivector := Basis_Vector (Blade_Types.C3_ni);
BV_Names : Blade.Basis_Vector_Names;
Dim : constant Integer := 8;
Scale : Float;
BL : Blade.Blade_List;
B_MV : Multivector;
R_MV : Multivector;
NP : Normalized_Point :=
New_Normalized_Point (-0.391495, -0.430912, 0.218277);
Factors : Multivector_List;
begin
Set_Geometry (C3_Geometry);
BV_Names.Append (Ada.Strings.Unbounded.To_Unbounded_String ("no"));
BV_Names.Append (Ada.Strings.Unbounded.To_Unbounded_String ("e1"));
BV_Names.Append (Ada.Strings.Unbounded.To_Unbounded_String ("e2"));
BV_Names.Append (Ada.Strings.Unbounded.To_Unbounded_String ("e3"));
BV_Names.Append (Ada.Strings.Unbounded.To_Unbounded_String ("ni"));
B_MV := Get_Random_Blade
(Dim, Integer (Maths.Random_Float * (Single (Dim) + 0.49)), 1.0);
BL.Add_Blade (New_Basis_Blade (30, -0.662244));
BL.Add_Blade (New_Basis_Blade (29, -0.391495));
BL.Add_Blade (New_Basis_Blade (27, -0.430912));
BL.Add_Blade (New_Basis_Blade (23, 0.218277));
BL.Add_Blade (New_Basis_Blade (15, -0.213881));
B_MV := New_Multivector (BL);
GA_Utilities.Print_Multivector ("B_MV", B_MV);
Factors := Multivector_Utilities.Factorize_Blades (B_MV, Scale);
GA_Utilities.Print_Multivector_List("Factors", Factors);
-- Reconstruct original
R_MV := New_Multivector (Scale);
for index in 1 .. List_Length (Factors) loop
R_MV := Outer_Product (R_MV, MV_Item (Factors, index));
end loop;
GA_Utilities.Print_Multivector ("R_MV", R_MV);
GA_Utilities.Print_Multivector ("NP", NP);
Factors := Multivector_Utilities.Factorize_Blades (NP, Scale);
GA_Utilities.Print_Multivector_List("Factors", Factors);
exception
when anError : others =>
Put_Line ("An exception occurred in Test_MV_Factor.");
raise;
end Test_MV_Factor;
|
programs/oeis/140/A140208.asm | karttu/loda | 0 | 104606 | <reponame>karttu/loda<filename>programs/oeis/140/A140208.asm
; A140208: Floor n*Pi(n)/2.
; 0,1,3,4,7,9,14,16,18,20,27,30,39,42,45,48,59,63,76,80,84,88,103,108,112,117,121,126,145,150,170,176,181,187,192,198,222,228,234,240,266,273,301,308,315,322,352,360,367,375,382,390,424,432,440,448,456,464
mov $1,$0
cal $1,128913 ; a(n) = n*pi(n).
div $1,2
|
oeis/215/A215862.asm | neoneye/loda-programs | 11 | 6676 | <gh_stars>10-100
; A215862: Number of simple labeled graphs on n+2 nodes with exactly n connected components that are trees or cycles.
; 0,4,19,55,125,245,434,714,1110,1650,2365,3289,4459,5915,7700,9860,12444,15504,19095,23275,28105,33649,39974,47150,55250,64350,74529,85869,98455,112375,127720,144584,163064,183260,205275,229215,255189,283309,313690,346450,381710,419594,460229,503745,550275,599955,652924,709324,769300,833000,900575,972179,1047969,1128105,1212750,1302070,1396234,1495414,1599785,1709525,1824815,1945839,2072784,2205840,2345200,2491060,2643619,2803079,2969645,3143525,3324930,3514074,3711174,3916450,4130125,4352425
lpb $0
add $2,3
add $2,$0
sub $0,1
add $3,$2
add $1,$3
lpe
mov $0,$1
|
Nehemiah/Syntax/Type.agda | inc-lc/ilc-agda | 10 | 6146 | <filename>Nehemiah/Syntax/Type.agda
------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- The syntax of types with the Nehemiah plugin.
------------------------------------------------------------------------
module Nehemiah.Syntax.Type where
import Parametric.Syntax.Type as Type
data Base : Type.Structure where
base-int : Base
base-bag : Base
open Type.Structure Base public
pattern int = base base-int
pattern bag = base base-bag
|
fluidcore/samples/ice-v4.asm | bushy555/ZX-Spectrum-1-Bit-Routines | 59 | 14571 |
ds 48
ds 16,1
ds 48
ds 16,2
ds 48
ds 16,3
ds 48
ds 16,4 |
base/mvdm/dos/v86/cmd/command/stub.asm | npocmaka/Windows-Server-2003 | 17 | 85269 | <reponame>npocmaka/Windows-Server-2003<filename>base/mvdm/dos/v86/cmd/command/stub.asm
page ,132
title Command Stub
;/*
; * Microsoft Confidential
; * Copyright (C) Microsoft Corporation 1991
; * All Rights Reserved.
; */
;
; Revision History
; ================
;
; M003 SR 07/16/90 Check if UMB loading enabled and if so
; turn it off on return from Exec
;
; M005 SR 07/20/90 Carousel hack. Added a hard-coded far
; jump to the actual int 2fh entry
; point to fix Carousel problems.
;
; M009 SR 08/01/90 Restore the UMB state before the Exec
; from the saved state in LoadHiFlg.
;
; M035 SR 10/27/90 Enable interrupts at the start of
; the dispatch code. Otherwise interrupts
; remain disabled through a whole
; of code which is not good.
;
; M049 SR 1/16/91 Bug #5075. Reworked the scheduling
; strategy. There is no common
; dispatcher now. Each entry point
; now checks A20 and then does a far
; jump to the appropriate code. This
; added about 15 bytes of code but the
; speed increase and reentrancy are
; well worth the price.
;
;
;This file contains the low memory stub for command.com which hooks all the
;entry points into the resident command.com and directs the calls to the
;appropriate routines in the resident code which may be located in HIMEM.
; The stub has been made part of the resident data and will always
;be duplicated on every invocation of command.com. However, the only stubs
;that actually hook the interrupt vectors belong to either the first
;command.com or to any other command.com executed with the /p switch.
; The stub also keeps track of the current active data segment. The
;INIT code of each command.com updates this variable via an int 2fh mechanism
;with its own data segment. The INIT code also updates a pointer in its data
;segment to the previous resident data segment. Whenever a command.com exits,
;the exit code picks up the previous data segment pointer from the current
;data segment and patches it into the CurResDataSeg variable in the stub.
; Right now the stub does not bother about A20 switching. We assume
;A20 is always on. It just does a far jump to the resident code with the
;value of the current data segment in one of the registers. A20 toggle
;support maybe added as a future enhancement, if the need is felt.
;
include comseg.asm
include xmm.inc
INIT segment
extrn ConProc:near
INIT ends
CODERES segment
extrn MsgInt2fHandler :near
extrn Int_2e :near
extrn Contc :near
extrn DskErr :near
CODERES ends
DATARES segment
assume cs:DATARES,ds:nothing,es:nothing,ss:nothing
Org 0
ZERO = $
Org 100h
ProgStart:
jmp RESGROUP:ConProc
db ? ;make following table word-alligned
;
;All the entry points declared below are patched in at INIT time with the
;proper segment and offset values after the resident code segment has been
;moved to its final location
;
public Int2f_Entry, Int2e_Entry, Ctrlc_Entry, CritErr_Entry, Lodcom_Entry
public Exec_Entry, RemCheck_Entry, TrnLodCom1_Entry, MsgRetrv_Entry
public HeadFix_Entry
public XMMCallAddr, ComInHMA
;!!!WARNING!!!
; All the dword ptrs from Int2f_Entry till MsgRetrv_Entry should be contiguous
;because the init routine 'Patch_stub' (in init.asm) relies on this to patch
;in the correct segments and offsets
;
Int2f_Entry label dword
dw offset RESGROUP:MsgInt2fHandler ;Address of int 2fh handler
dw 0
Int2e_Entry label dword
dw offset RESGROUP:Int_2e ;Address of int 2eh handler
dw 0
Ctrlc_Entry label dword
dw offset RESGROUP:ContC ;Address of Ctrl-C handler
dw 0
CritErr_Entry label dword
dw offset RESGROUP:DskErr ;Address of critical error handler
dw 0
Exec_Entry dd ? ;Entry from transient to Ext_Exec
RemCheck_Entry dd ? ;Entry from transient to TRemCheck
TrnLodCom1_Entry dd ? ;Entry from transient to LodCom1
LodCom_Entry dd ? ;Entry after exit from command.com
MsgRetrv_Entry dd ? ;Entry from external to MsgRetriever
HeadFix_Entry dd ? ;Entry from trans to HeadFix
UMBOff_Entry dd ? ;Entry from here to UMBOff routine; M003
XMMCallAddr dd ? ;Call address for XMM functions
ComInHMA db 0 ;Flags if command.com in HMA
public Int2f_Trap, Int2e_Trap, Ctrlc_Trap, CritErr_Trap
public Exec_Trap, RemCheck_Trap, LodCom_Trap, MsgRetrv_Trap, TrnLodcom1_Trap
public HeadFix_Trap
Int2f_Trap:
sti
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp Int2f_Entry
Int2e_Trap:
sti
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp Int2e_Entry
Ctrlc_Trap:
sti
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp Ctrlc_Entry
CritErr_Trap:
sti
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp CritErr_Entry
Exec_Trap:
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp Exec_Entry
RemCheck_Trap:
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp RemCheck_Entry
TrnLodCom1_Trap:
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp TrnLodCom1_Entry
LodCom_Trap:
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp LodCom_Entry
MsgRetrv_Trap:
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp MsgRetrv_Entry
HeadFix_Trap:
call CheckA20
push ds ;push current ds value
push cs ;push resident data segment value
jmp HeadFix_Entry
CheckA20 proc
pushf ;save current flags
push ax
cmp cs:ComInHMA,0 ;is resident in HMA?
jz A20_on ;no, jump to resident
call QueryA20
jnc A20_on ;A20 is on, jump to resident
call EnableA20 ;turn A20 on
A20_on:
pop ax
popf ;flags have to be unchanged
ret
CheckA20 endp
;
; M005; This is a far jump to the actual int 2fh entry point. The renormalized
; M005; int 2fh cs:ip points here. We hardcode a far jump here to the int 2fh
; M005; handler. Note that we have to hardcode a jump and we cannot use any
; M005; pointers because our cs is going to be different. The segment to
; M005; jump to is patched in at init time. (in init.asm)
;
public Carousel_i2f_Hook ; M005
Carousel_i2f_Hook: ; M005
db 0eah ; far jump opcode; M005
dw offset DATARES:Int2f_Trap ; int 2fh offset ; M005
dw ? ; int 2fh segment; M005
QueryA20 proc near
push bx
push ax
mov ah, XMM_QUERY_A20
call cs:XMMCallAddr
or ax, ax
pop ax
pop bx
jnz short QA20_ON ; AX = 1 => ON
stc ; OFF
ret
QA20_ON:
clc ; ON
ret
QueryA20 endp
EnableA20 proc near
push bx
push ax
mov ah, XMM_LOCAL_ENABLE_A20
call cs:XMMCallAddr
or ax, ax
jz XMMerror ; AX = 0 fatal error
pop ax
pop bx
ret
;
;If we get an error, we just loop forever
;
XMMerror:
jmp short XMMerror
EnableA20 endp
;
;The Exec call has to be issued from the data segment. The reason for this
;is TSRs. When a TSR does a call to terminate and stay resident, the call
;returns with all registers preserved and so all our segment registers are
;still set up. However, if the TSR unloads itself later on, it still
;comes back here. In this case the segment registers and the stack are
;not set up and random things can happen. The only way to setup all the
;registers is to use the cs value and this can only be done when we are in
;the data segment ourselves. So, this piece of code had to be moved from
;the code segment to the data segment.
;
extrn RStack:WORD
extrn LoadHiFlg:BYTE
public Issue_Exec_Call
Issue_Exec_Call:
int 21h
;
;We disable interrupts while changing the stack because there is a bug in
;some old 8088 processors where interrupts are let through while ss & sp
;are being changed.
;
cli
push cs
pop ss
mov sp,offset DATARES:RStack ;stack is set up
sti
push cs
pop ds ;ds = DATARES
;
; M009; Restore UMB state to that before Exec
;
;; save execution status(carry flag)
;; and the error code(AL)
pushf ;save flags ; M003
push ax
mov al,LoadHiFlg ;current UMB state ; M009
test al,80h ;did we try to loadhigh? ;M009
jz no_lh ;no, dont restore ;M009
and al,7fh ;clear indicator bit ;M009
call dword ptr UMBOff_Entry ;restore UMB state ; M009
no_lh: ; M009
and LoadHiFlg,7fh ;clear loadhigh indicator bit
;M009
pop ax
popf ; M003; *bugbug -- popff??
;
;We now jump to the stub trap which returns us to the resident code. All
;flags are preserved by the stub code.
;
jmp Exec_Trap
DATARES ends
end ProgStart
|
MasmEd/MasmEd/Misc/Print.asm | CherryDT/FbEditMOD | 11 | 168335 | .data?
prnInches dd ?
.code
GetPrnCaps proc
LOCAL buffer[256]:BYTE
invoke GetUserDefaultLCID
mov edx,eax
invoke GetLocaleInfo,edx,LOCALE_IMEASURE,addr buffer,sizeof buffer
mov al,buffer
.if al=='1'
mov eax,1
.else
mov eax,0
.endif
mov prnInches,eax
ret
GetPrnCaps endp
ConvToPix proc lLPix:DWORD,lSize:DWORD
mov eax,lLPix
.if !prnInches
mov ecx,1000
mul ecx
xor edx,edx
mov ecx,254
div ecx
.else
mov ecx,10
mul ecx
.endif
mov ecx,eax ;Pix pr. 100mm / 10"
mov eax,lSize
mul ecx
xor edx,edx
mov ecx,10000
div ecx
ret
ConvToPix endp
Print proc uses ebx
LOCAL doci:DOCINFO
LOCAL pX:DWORD
LOCAL pY:DWORD
LOCAL pML:DWORD
LOCAL pMT:DWORD
LOCAL pMR:DWORD
LOCAL pMB:DWORD
LOCAL chrg:CHARRANGE
LOCAL rect:RECT
LOCAL pt:POINT
LOCAL hRgn:DWORD
LOCAL buffer[32]:BYTE
LOCAL lf:LOGFONT
LOCAL hPrFont:DWORD
LOCAL nLine:DWORD
LOCAL nPageno:DWORD
LOCAL nMPage:DWORD
LOCAL nMLine:DWORD
LOCAL ptX:DWORD
LOCAL ptY:DWORD
LOCAL tWt:DWORD
invoke GetPrnCaps
invoke GetDeviceCaps,pd.hDC,LOGPIXELSX
mov ebx,eax
invoke ConvToPix,ebx,psd.ptPaperSize.x
mov pX,eax
invoke ConvToPix,ebx,psd.rtMargin.left
mov pML,eax
invoke ConvToPix,ebx,psd.rtMargin.right
mov pMR,eax
invoke GetDeviceCaps,pd.hDC,LOGPIXELSY
mov ebx,eax
invoke ConvToPix,ebx,psd.ptPaperSize.y
mov pY,eax
invoke ConvToPix,ebx,psd.rtMargin.top
mov pMT,eax
invoke ConvToPix,ebx,psd.rtMargin.bottom
mov pMB,eax
invoke RtlZeroMemory,addr lf,sizeof lf
invoke strcpy,addr lf.lfFaceName,addr lfnt.lfFaceName
invoke GetDeviceCaps,pd.hDC,LOGPIXELSY
mov ecx,lfnt.lfHeight
neg ecx
mul ecx
xor edx,edx
mov ecx,72
div ecx
mov lf.lfHeight,eax
mov ecx,eax
mov eax,pY
sub eax,pMT
sub eax,pMB
xor edx,edx
div ecx
mov ppos.nlinespage,eax
invoke RegSetValueEx,ha.hReg,addr szPrnPos,0,REG_BINARY,addr ppos,sizeof ppos
mov eax,lfnt.lfWeight
mov lf.lfWeight,eax
invoke CreateFontIndirect,addr lf
mov hPrFont,eax
mov doci.cbSize,sizeof doci
mov doci.lpszDocName,offset szAppName
mov eax,pd.Flags
and eax,PD_PRINTTOFILE
.if eax
mov eax,'ELIF'
mov dword ptr buffer,eax
mov eax,':'
mov dword ptr buffer+4,eax
lea eax,buffer
mov doci.lpszOutput,eax
.else
mov doci.lpszOutput,NULL
.endif
mov doci.lpszDatatype,NULL
mov doci.fwType,NULL
invoke StartDoc,pd.hDC,addr doci
mov eax,pd.Flags
and eax,PD_SELECTION
.if eax
invoke SendMessage,ha.hREd,EM_EXLINEFROMCHAR,0,chrg.cpMin
mov nLine,eax
mov ecx,ppos.nlinespage
xor edx,edx
div ecx
mov nPageno,eax
invoke SendMessage,ha.hREd,EM_EXLINEFROMCHAR,0,chrg.cpMax
sub eax,nLine
inc eax
mov nMLine,eax
mov pd.nToPage,-1
.else
movzx eax,pd.nFromPage
dec eax
mov nPageno,eax
mov edx,ppos.nlinespage
mul edx
mov nLine,eax
invoke SendMessage,ha.hREd,EM_GETLINECOUNT,0,0
or eax,eax
je Ed
inc eax
inc eax
mov nMLine,eax
.endif
mov eax,pML
mov rect.left,eax
mov eax,pX
sub eax,pMR
mov rect.right,eax
mov eax,pMT
mov rect.top,eax
mov eax,pY
sub eax,pMB
mov rect.bottom,eax
invoke CreateRectRgn,rect.left,rect.top,rect.right,rect.bottom
mov hRgn,eax
NxtPage:
inc nPageno
mov eax,nPageno
.if ax>pd.nToPage
jmp Ed
.endif
invoke StartPage,pd.hDC
mov eax,pMT
mov ptY,eax
invoke SelectObject,pd.hDC,hPrFont
invoke SelectObject,pd.hDC,hRgn
;Get tab width
mov eax,'WWWW'
mov dword ptr buffer,eax
invoke GetTextExtentPoint32,pd.hDC,addr buffer,4,addr pt
mov eax,pt.x
shr eax,2
mov ecx,edopt.tabsize
mul ecx
mov tWt,eax
NxtLine:
mov eax,ptY
add eax,pt.y
add eax,pt.y
cmp eax,rect.bottom
jnb Ep
dec nMLine
je Ep
mov eax,pML
mov ptX,eax
mov word ptr LineTxt,sizeof LineTxt-1
invoke SendMessage,ha.hREd,EM_GETLINE,nLine,addr LineTxt
mov byte ptr LineTxt[eax],0
inc nLine
or eax,eax
je El
invoke strlen,addr LineTxt
mov ecx,eax
invoke TabbedTextOut,pd.hDC,ptX,ptY,addr LineTxt,ecx,1,addr tWt,ptX
El:
mov eax,pt.y
add ptY,eax
jmp NxtLine
Ep:
invoke EndPage,pd.hDC
.if nMLine
jmp NxtPage
.endif
Ed:
invoke EndDoc,pd.hDC
invoke DeleteDC,pd.hDC
invoke DeleteObject,hPrFont
invoke DeleteObject,hRgn
ret
Print endp
|
test/Succeed/Issue4172.agda | strake/agda | 0 | 6754 | <reponame>strake/agda
-- Andreas 2019-11-06, issue #4172, examples by nad.
-- Single constructor matches for non-indexed types should be ok
-- even when argument is erased, as long as pattern variables
-- are only used in erased context on the rhs.
-- https://github.com/agda/agda/issues/4172#issue-517690102
record Erased (A : Set) : Set where
constructor [_]
field
@0 erased : A
open Erased
data W (A : Set) (B : A → Set) : Set where
sup : (x : A) → (B x → W A B) → W A B
lemma :
{A : Set} {B : A → Set} →
Erased (W A B) → W (Erased A) (λ x → Erased (B (erased x)))
lemma [ sup x f ] = sup [ x ] λ ([ y ]) → lemma [ f y ]
-- https://github.com/agda/agda/issues/4172#issuecomment-549768270
data ⊥ : Set where
data E : Set where
c : E → E
magic : @0 E → ⊥
magic (c e) = magic e
|
Task/Walk-a-directory-Non-recursively/AppleScript/walk-a-directory-non-recursively-2.applescript | LaudateCorpus1/RosettaCodeData | 1 | 3694 | <filename>Task/Walk-a-directory-Non-recursively/AppleScript/walk-a-directory-non-recursively-2.applescript
tell application "Finder" to return name of every item in (path to documents folder from user domain) whose name ends with "pdf"
--> EXAMPLE RESULT: {"About Stacks.pdf", "Test.pdf"}
|
programs/oeis/322/A322108.asm | neoneye/loda | 22 | 1238 | <reponame>neoneye/loda<filename>programs/oeis/322/A322108.asm
; A322108: Distance of n-th iteration in an alternating rectangular spiral.
; 1,3,7,15,29,50,79,118,169,233,311,405,517,648,799,972,1169,1391,1639,1915,2221,2558,2927,3330,3769,4245,4759,5313,5909,6548,7231,7960,8737,9563,10439,11367,12349,13386,14479
add $0,1
mov $1,$0
pow $0,2
add $0,3
sub $1,1
mul $0,$1
add $0,2
div $0,4
add $0,1
|
source/amf/uml/amf-internals-uml_protocol_transitions.ads | svn2github/matreshka | 24 | 30102 | ------------------------------------------------------------------------------
-- --
-- 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.Internals.UML_Named_Elements;
with AMF.String_Collections;
with AMF.UML.Behaviors;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.Collections;
with AMF.UML.Named_Elements.Collections;
with AMF.UML.Namespaces;
with AMF.UML.Operations.Collections;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Protocol_Transitions;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.Regions;
with AMF.UML.State_Machines;
with AMF.UML.String_Expressions;
with AMF.UML.Transitions;
with AMF.UML.Triggers.Collections;
with AMF.UML.Vertexs;
with AMF.Visitors;
package AMF.Internals.UML_Protocol_Transitions is
type UML_Protocol_Transition_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Protocol_Transitions.UML_Protocol_Transition with null record;
overriding function Get_Post_Condition
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Constraints.UML_Constraint_Access;
-- Getter of ProtocolTransition::postCondition.
--
-- Specifies the post condition of the transition which is the condition
-- that should be obtained once the transition is triggered. This post
-- condition is part of the post condition of the operation connected to
-- the transition.
overriding procedure Set_Post_Condition
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Constraints.UML_Constraint_Access);
-- Setter of ProtocolTransition::postCondition.
--
-- Specifies the post condition of the transition which is the condition
-- that should be obtained once the transition is triggered. This post
-- condition is part of the post condition of the operation connected to
-- the transition.
overriding function Get_Pre_Condition
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Constraints.UML_Constraint_Access;
-- Getter of ProtocolTransition::preCondition.
--
-- Specifies the precondition of the transition. It specifies the
-- condition that should be verified before triggering the transition.
-- This guard condition added to the source state will be evaluated as
-- part of the precondition of the operation referred by the transition if
-- any.
overriding procedure Set_Pre_Condition
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Constraints.UML_Constraint_Access);
-- Setter of ProtocolTransition::preCondition.
--
-- Specifies the precondition of the transition. It specifies the
-- condition that should be verified before triggering the transition.
-- This guard condition added to the source state will be evaluated as
-- part of the precondition of the operation referred by the transition if
-- any.
overriding function Get_Referred
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Operations.Collections.Set_Of_UML_Operation;
-- Getter of ProtocolTransition::referred.
--
-- This association refers to the associated operation. It is derived from
-- the operation of the call trigger when applicable.
overriding function Get_Container
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Regions.UML_Region_Access;
-- Getter of Transition::container.
--
-- Designates the region that owns this transition.
overriding procedure Set_Container
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Regions.UML_Region_Access);
-- Setter of Transition::container.
--
-- Designates the region that owns this transition.
overriding function Get_Effect
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Behaviors.UML_Behavior_Access;
-- Getter of Transition::effect.
--
-- Specifies an optional behavior to be performed when the transition
-- fires.
overriding procedure Set_Effect
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Behaviors.UML_Behavior_Access);
-- Setter of Transition::effect.
--
-- Specifies an optional behavior to be performed when the transition
-- fires.
overriding function Get_Guard
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Constraints.UML_Constraint_Access;
-- Getter of Transition::guard.
--
-- A guard is a constraint that provides a fine-grained control over the
-- firing of the transition. The guard is evaluated when an event
-- occurrence is dispatched by the state machine. If the guard is true at
-- that time, the transition may be enabled, otherwise, it is disabled.
-- Guards should be pure expressions without side effects. Guard
-- expressions with side effects are ill formed.
overriding procedure Set_Guard
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Constraints.UML_Constraint_Access);
-- Setter of Transition::guard.
--
-- A guard is a constraint that provides a fine-grained control over the
-- firing of the transition. The guard is evaluated when an event
-- occurrence is dispatched by the state machine. If the guard is true at
-- that time, the transition may be enabled, otherwise, it is disabled.
-- Guards should be pure expressions without side effects. Guard
-- expressions with side effects are ill formed.
overriding function Get_Kind
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.UML_Transition_Kind;
-- Getter of Transition::kind.
--
-- Indicates the precise type of the transition.
overriding procedure Set_Kind
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.UML_Transition_Kind);
-- Setter of Transition::kind.
--
-- Indicates the precise type of the transition.
overriding function Get_Redefined_Transition
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Transitions.UML_Transition_Access;
-- Getter of Transition::redefinedTransition.
--
-- The transition that is redefined by this transition.
overriding procedure Set_Redefined_Transition
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Transitions.UML_Transition_Access);
-- Setter of Transition::redefinedTransition.
--
-- The transition that is redefined by this transition.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Getter of Transition::redefinitionContext.
--
-- References the classifier in which context this element may be
-- redefined.
overriding function Get_Source
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Vertexs.UML_Vertex_Access;
-- Getter of Transition::source.
--
-- Designates the originating vertex (state or pseudostate) of the
-- transition.
overriding procedure Set_Source
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Vertexs.UML_Vertex_Access);
-- Setter of Transition::source.
--
-- Designates the originating vertex (state or pseudostate) of the
-- transition.
overriding function Get_Target
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Vertexs.UML_Vertex_Access;
-- Getter of Transition::target.
--
-- Designates the target vertex that is reached when the transition is
-- taken.
overriding procedure Set_Target
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.Vertexs.UML_Vertex_Access);
-- Setter of Transition::target.
--
-- Designates the target vertex that is reached when the transition is
-- taken.
overriding function Get_Trigger
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Triggers.Collections.Set_Of_UML_Trigger;
-- Getter of Transition::trigger.
--
-- Specifies the triggers that may fire the transition.
overriding function Get_Element_Import
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import;
-- Getter of Namespace::elementImport.
--
-- References the ElementImports owned by the Namespace.
overriding function Get_Imported_Member
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Getter of Namespace::importedMember.
--
-- References the PackageableElements that are members of this Namespace
-- as a result of either PackageImports or ElementImports.
overriding function Get_Member
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::member.
--
-- A collection of NamedElements identifiable within the Namespace, either
-- by being owned or by being introduced by importing or inheritance.
overriding function Get_Owned_Member
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::ownedMember.
--
-- A collection of NamedElements owned by the Namespace.
overriding function Get_Owned_Rule
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Namespace::ownedRule.
--
-- Specifies a set of Constraints owned by this Namespace.
overriding function Get_Package_Import
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import;
-- Getter of Namespace::packageImport.
--
-- References the PackageImports owned by the Namespace.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Protocol_Transition_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Protocol_Transition_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Protocol_Transition_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Referred
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Operations.Collections.Set_Of_UML_Operation;
-- Operation ProtocolTransition::referred.
--
-- Missing derivation for ProtocolTransition::/referred : Operation
overriding function Containing_State_Machine
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.State_Machines.UML_State_Machine_Access;
-- Operation Transition::containingStateMachine.
--
-- The query containingStateMachine() returns the state machine that
-- contains the transition either directly or transitively.
overriding function Is_Consistent_With
(Self : not null access constant UML_Protocol_Transition_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation Transition::isConsistentWith.
--
-- The query isConsistentWith() specifies that a redefining transition is
-- consistent with a redefined transition provided that the redefining
-- transition has the following relation to the redefined transition: A
-- redefining transition redefines all properties of the corresponding
-- redefined transition, except the source state and the trigger.
overriding function Redefinition_Context
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Operation Transition::redefinitionContext.
--
-- The redefinition context of a transition is the nearest containing
-- statemachine.
overriding function Exclude_Collisions
(Self : not null access constant UML_Protocol_Transition_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::excludeCollisions.
--
-- The query excludeCollisions() excludes from a set of
-- PackageableElements any that would not be distinguishable from each
-- other in this namespace.
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Protocol_Transition_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String;
-- Operation Namespace::getNamesOfMember.
--
-- The query getNamesOfMember() takes importing into account. It gives
-- back the set of names that an element would have in an importing
-- namespace, either because it is owned, or if not owned then imported
-- individually, or if not individually then from a package.
-- The query getNamesOfMember() gives a set of all of the names that a
-- member would have in a Namespace. In general a member can have multiple
-- names in a Namespace if it is imported more than once with different
-- aliases. The query takes account of importing. It gives back the set of
-- names that an element would have in an importing namespace, either
-- because it is owned, or if not owned then imported individually, or if
-- not individually then from a package.
overriding function Import_Members
(Self : not null access constant UML_Protocol_Transition_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importMembers.
--
-- The query importMembers() defines which of a set of PackageableElements
-- are actually imported into the namespace. This excludes hidden ones,
-- i.e., those which have names that conflict with names of owned members,
-- and also excludes elements which would have the same name when imported.
overriding function Imported_Member
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importedMember.
--
-- The importedMember property is derived from the ElementImports and the
-- PackageImports. References the PackageableElements that are members of
-- this Namespace as a result of either PackageImports or ElementImports.
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Protocol_Transition_Proxy)
return Boolean;
-- Operation Namespace::membersAreDistinguishable.
--
-- The Boolean query membersAreDistinguishable() determines whether all of
-- the namespace's members are distinguishable within it.
overriding function Owned_Member
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Namespace::ownedMember.
--
-- Missing derivation for Namespace::/ownedMember : NamedElement
overriding function All_Owning_Packages
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Protocol_Transition_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Protocol_Transition_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Protocol_Transition_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding procedure Enter_Element
(Self : not null access constant UML_Protocol_Transition_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Protocol_Transition_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Protocol_Transition_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Protocol_Transitions;
|
oeis/074/A074370.asm | neoneye/loda-programs | 11 | 29144 | ; A074370: Sum of the divisors of Sum_{i=1..n} prime(i).
; 3,6,18,18,56,42,90,96,217,176,378,198,432,282,630,512,1080,672,1080,936,1350,912,1440,1404,2268,1760,2480,1832,3420,2400,3960,2472,4032,2840,3990,3240,5400,2856,4608,5200,5184,4992,5832,5112,7560,5640,7632,4800,10080,6336,10044,8736,11664,8112,9510,8064,16560,7372,11130,7700,12936,10292,14736,8894,13812,9720,15960,14080,17280,15360,25380,13264,18624,18320,19080,19104,25920,20072,29760,22464,26460,20720,31500,27648,37980,26368,37632,27456,34782,26688,45360,21616,30822,21340,42462,22040,52640
seq $0,237589 ; Sum of first n odd noncomposite numbers.
seq $0,203 ; a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).
|
Appl/Calendar/DayPlan/dayplanPrint.asm | steakknife/pcgeos | 504 | 244400 | <reponame>steakknife/pcgeos<filename>Appl/Calendar/DayPlan/dayplanPrint.asm
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) GeoWorks 1989 -- All Rights Reserved
PROJECT: PC GEOS
MODULE: Calendar/DayPlan
FILE: dayplanPrint.asm
AUTHOR: <NAME>, May 27, 1990
ROUTINES:
Name Description
---- -----------
DayPlanPrint High level print routine for EventWindow
DayPlanPrintsetup Internal setup for printing EventWindow
DayPlanPrintDatesEvents High level printing of events in a month
DayPlanPrintSingleDate High level printing of single date in month
DayPlanPrintEngine Medium level print routine for events
DayPlanCreatePrintEvent Creates a PrintEvent object used for printing
DayPlanNukePrintEvent Destroys the forementioned object
DayPlanPrintAllEvents Medium level routine to print built EventTable
DayPlanPrintOneEvent Low level print rouinte for a single event
DayPlanPrepareDateEvent Specialized routine to max space used in date
DayPlanPrintEventCrossesPage
Handles events that cross 1 or more pages
DayPlanPrintCalcNextOffset
Sub-routine for events that cross page boundary
InitPagePosition Simple routine to create new page
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 5/27/90 Initial revision
DESCRIPTION:
$Id: dayplanPrint.asm,v 1.1 97/04/04 14:47:30 newdeal Exp $
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
PrintCode segment resource
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanStartPrinting
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Responds to all printing requests from the PrintControl
for event information.
CALLED BY: GLOBAL (MSG_PRINT_START_PRINTING)
PASS: DS:*SI = DayPlanClass instance data
DS:DI = DayPlanClass specific instance data
BP = GState
CX:DX = PrintControl OD
RETURN: Nothing
DESTROYED: AX, BX, CX, DX, DI, SI, BP
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 5/27/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanStartPrinting method DayPlanClass, MSG_PRINT_START_PRINTING
.enter
; Some set-up work
;
push cx, dx ; save the SPC OutputDesc.
call DayPlanPrintSetup ; => CX:DX width, height
sub sp, size PrintRangeStruct ; allocate this structure
mov bx, sp ; PrintRangeStruct => SS:BX
mov ss:[bx].PRS_width, cx
mov ss:[bx].PRS_height, dx
mov ss:[bx].PRS_gstate, bp ; store the GState
mov ss:[bx].PRS_pointSize, 12 ; twelve point text
mov ss:[bx].PRS_specialValue, 2 ; normal event printing
mov dx, ds:[di].DPI_startYear
mov ss:[bx].PRS_range.RS_startYear, dx
mov dx, ds:[di].DPI_endYear
mov ss:[bx].PRS_range.RS_endYear, dx
mov dx, {word} ds:[di].DPI_startDay
mov {word} ss:[bx].PRS_range.RS_startDay, dx
mov dx, {word} ds:[di].DPI_endDay
mov {word} ss:[bx].PRS_range.RS_endDay, dx
mov ss:[bx].PRS_currentSizeObj, 0 ; no handle allocated
; Perform the actual printing
;
mov cx, {word} ds:[di].DPI_flags ; DayPlanInfoFlags => CL
; DayPlanPrintFlags => CH
cmp ds:[di].DPI_rangeLength, 1
jne doPrinting
or ch, mask DPPF_FORCE_HEADERS ; if 1 day, force a header
doPrinting:
mov bp, bx ; PrintRangeStruct => SS:BP
mov ax, MSG_DP_PRINT_ENGINE ; now do the real work
call ObjCallInstanceNoLock
; End the page properly
;
mov_tr dx, ax ; number of pages => DX
mov di, ss:[bp].PRS_gstate
mov al, PEC_FORM_FEED
call GrNewPage
add sp, size PrintRangeStruct ; clean up the stack
; Now clean up
;
pop bx, si ; PrintControl OD => BX:SI
mov cx, 1
mov ax, MSG_PRINT_CONTROL_SET_TOTAL_PAGE_RANGE
call ObjMessage_print_send ; number of pages = (DX-CX+1)
mov ax, MSG_PRINT_CONTROL_PRINTING_COMPLETED
call ObjMessage_print_send
.leave
ret
DayPlanStartPrinting endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintSetup
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Sets up the DayPlan for printing, and returns the print
information.
CALLED BY: INTERNAL - DayPlanStartPrinting
PASS: DS:*SI = DayPlanClass instance data
ES = DGroup
CX:DX = PrintControl OD
BP = GState to print with
RETURN: CX = Usable width of document
DX = Usable height of document
DS:DI = DayPlanClass specific instance data
DESTROYED: AX, BX
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 5/27/90 Initial version
Don 6/28/90 Took out unnecessary calls
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanPrintSetup proc near
.enter
; Set the inital translation
;
mov di, bp ; GState => DI
call InitPagePosition ; account for the page borders
mov di, ds:[si] ; dereference the handle
add di, ds:[di].DayPlan_offset ; access the instance data
mov cx, es:[printWidth]
mov dx, es:[printHeight]
.leave
ret
DayPlanPrintSetup endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintDatesEvents
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Print a date's worth of events - designed to work with
printing events inside of a Calendar.
CALLED BY: GLOBAL (MSG_DP_PRINT_DATES_EVENTS)
PASS: DS:*SI = DayPlanClass instance data
ES = DGroup
SS:BP = MonthPrintRangeStruct
CL = DOW of 1st day
CH = Last day in month
RETURN: Nothing
DESTROYED: TBD
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 6/2/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanPrintDatesEvents method DayPlanClass, MSG_DP_PRINT_DATES_EVENTS
.enter
; Some set-up work
;
push ds:[di].DPI_rangeLength ; save the range length
mov ds:[di].DPI_rangeLength, 1 ; to avoid header events
or es:[systemStatus], SF_PRINT_MONTH_EVENTS
mov dl, 7 ; seven columns
sub dl, cl ; start at DOW
mov cl, 1 ; start with 1st day in month
mov ax, mask PEI_IN_DATE ; PrintEventInfo => AX
call DayPlanCreatePrintEvent ; print event => DS:*BX
mov ss:[bp].PRS_currentSizeObj, bx ; store the handle
jnc printDates ; if carry clear, A-OK
; Else ask the user what to do
;
push cx, dx, bp ; save MonthPrintRangeStruct
mov bp, CAL_ERROR_EVENTS_WONT_FIT ; message to display
mov bx, ds:[LMBH_handle] ; block handle => BX
call MemOwner ; process handle => BX
mov ax, MSG_CALENDAR_DISPLAY_ERROR
mov di, mask MF_FIXUP_DS or mask MF_CALL
call ObjMessage
pop cx, dx, bp ; restore MonthPrintRangeStruct
cmp ax, IC_YES ; print empty month ?
je cleanUpOK ; yes
mov ax, MSG_PRINT_CONTROL_PRINTING_CANCELLED
jmp cleanUp
; Draw the events, day by day
;
printDates:
mov ax, ss:[bp].MPRS_newXOffset ; X position => AX
mov bx, ss:[bp].MPRS_newYOffset ; Y position => BX
anotherDay:
mov ss:[bp].MPRS_newXOffset, ax ; store the current X offset
mov ss:[bp].MPRS_newYOffset, bx ; store the current Y offset
push ax, bx, cx, dx ; save important data
mov ss:[bp].PRS_range.RS_startDay, cl
mov ss:[bp].PRS_range.RS_endDay, cl
call DayPlanPrintSingleDate ; print this date
pop ax, bx, cx, dx ; restore the important data
add ax, ss:[bp].MPRS_dateWidth ; move over one date
dec dl ; one less column in this row
jnz nextDate ; if not done, next
add bx, ss:[bp].MPRS_dateHeight ; else go down one row...
mov ax, MONTH_BORDER_HORIZ ; and to the left column
mov dl, 7 ; reset the day counter
nextDate:
inc cl ; increment the day
cmp cl, ch ; are we done yet ??
jle anotherDay
; Clean up
;
cleanUpOK:
mov ax, MSG_PRINT_CONTROL_PRINTING_COMPLETED
cleanUp:
mov di, ds:[si]
add di, ds:[di].DayPlan_offset
pop ds:[di].DPI_rangeLength ; restore range length
push ax ; save the method to send
and es:[systemStatus], not SF_PRINT_MONTH_EVENTS
mov dx, ss:[bp].PRS_currentSizeObj ; size object => DS:*DX
call DayPlanNukePrintEvent ; free up the event
; End the page properly
;
mov di, ss:[bp].PRS_gstate
mov al, PEC_FORM_FEED
call GrNewPage
; Now tell the PrintControl that we're done
;
pop ax ; method to send
GetResourceHandleNS CalendarPrintControl, bx
mov si, offset CalendarPrintControl
call ObjMessage_print_call ; send that method
.leave
ret
DayPlanPrintDatesEvents endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintSingleDate
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Print a single date's events, that appear inside of
a month.
CALLED BY: INTERNAL - DayPlanPrintDatesEvents
PASS: DS:*SI = DayPlanClass instance data
SS:BP = MonthPrintRangeStruct
ES = DGroup
RETURN: Nothing
DESTROYED: AX, BX, CX, DX, DI
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 10/1/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanPrintSingleDate proc near
.enter
; First translate
;
push si ; save the DayPlan handle
mov di, ss:[bp].PRS_gstate ; GState => DI
call GrSetNullTransform ; go back to 0,0
mov dx, ss:[bp].MPRS_newXOffset ; raw X offset => DX
add dx, es:[printMarginLeft]
inc dx
mov bx, ss:[bp].MPRS_newYOffset ; raw Y offset => BX
add bx, es:[printMarginTop] ; y offset => BX
clr ax ; no fractions
clr cx ; no fractions
call GrApplyTranslation ; perform the translation
; Now set the clip region
;
mov bx, ax ; top (and left) zero
mov cx, ss:[bp].PRS_width ; right
mov dx, ss:[bp].PRS_height ; bottom
mov si, PCT_REPLACE
call GrSetClipRect ; set the clip rectangle
; Now do the real printing
;
pop si ; restore the DayPlan handle
clr cx ; no template or headers
mov ax, MSG_DP_PRINT_ENGINE ; do the real work
call ObjCallInstanceNoLock
.leave
ret
DayPlanPrintSingleDate endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintEngine
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Performs the actual printing of events that fall within the
desired range.
CALLED BY: GLOBAL
PASS: ES = DGroup
DS:*SI = DayPlanClass instance data
SS:BP = PrintRangeStruct
CL = DayPlanInfoFlags
DP_TEMPLATE (attempt template mode)
DP_HEADERS (attempt headers mode)
CH = DayPlanPrintFlags
RETURN: AX = Number of pages that were printed
DESTROYED: BX, DI, SI
NOTES: PRS_currentSizeObj must be accurately filled in when passed
If no current print object, then zero
Else, valid handle in DPResource block
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 5/27/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanPrintEngine method DayPlanClass, MSG_DP_PRINT_ENGINE
uses cx, dx, bp
.enter
; First call for everything to be updated
;
mov ax, 1 ; assume 1 page printed
test es:[systemStatus], SF_VALID_FILE
LONG jz done ; if no file, do nothing!
push cx ; save the flags
mov ax, MSG_DP_UPDATE_ALL_EVENTS
call ObjCallInstanceNoLock
cmp ds:[LMBH_blockSize], LARGE_BLOCK_SIZE
jb eventTable ; if smaller, don't worry
mov ax, MSG_DP_FREE_MEM ; free as much mem as possible
call ObjCallInstanceNoLock ; do the work now!
; Allocate an EventTable, and initialize it
eventTable:
mov cx, size EventTableHeader ; allocate an EventTable
mov al, mask OCF_IGNORE_DIRTY ; not dirty
call LMemAlloc ; chunk handle => AX
mov bx, ax ; table handle => BX
mov di, ds:[bx] ; derference the handle
mov ds:[di].ETH_last, cx ; initialize the header...
mov ds:[di].ETH_screenFirst, OFF_SCREEN_TOP
mov ds:[di].ETH_screenLast, OFF_SCREEN_BOTTOM
; Save some important values, and reload them
;
mov di, ds:[si] ; dereference the handle
add di, ds:[di].DayPlan_offset ; access my instance data
pop cx ; restore the flags
push ds:[di].DPI_eventTable ; save these values...
push {word} ds:[di].DPI_flags ; save InfoFlags & PrintFlags
push ds:[di].DPI_textHeight ; save one-line text height
push ds:[di].DPI_viewWidth ; save the view width
push ds:[di].DPI_docHeight ; save the document height
mov ds:[di].DPI_eventTable, ax ; store the new EventTable
mov {word} ds:[di].DPI_flags, cx ; store some new flags
or ds:[di].DPI_flags, DP_LOADING ; to avoid re-draw requests
mov cx, ss:[bp].PRS_width ; screen width => CX
mov ds:[di].DPI_viewWidth, cx ; store the width here
mov bx, ss:[bp].PRS_currentSizeObj ; current handle => BX
tst bx ; check for valid handle
jnz havePrintEvent ; if exists, then print
if SUPPORT_ONE_LINE_PRINT
clr ax ; assume not one-line print
test ds:[di].DPI_printFlags, mask DPPF_ONE_LINE_EVENT
jz notOneLine
mov ax, mask PEI_ONE_LINE_PRINT
notOneLine:
else
clr ax ; PrintEventInfo => AX
endif
call DayPlanCreatePrintEvent ; print event => DS:*BX
havePrintEvent:
EC < push si ; save DayPlan handle >
EC < mov si, bx ; move event handle >
EC < call ECCheckLMemObject ; object in DS:*SI >
EC < pop si ; restore DayPlan handle>
mov es:[timeOffset], 0 ; no time offset !
push bp, bx ; save structure & DayEvent
; Load the events, and then print them out
;
call DayPlanLoadEvents ; load all of the events
pop bp, dx ; restore structure & DayEvent
call DayPlanPrintAllEvents ; print all of the events
; number of pages => CX
; Clean up
;
tst ss:[bp].PRS_currentSizeObj ; start with a size object ??
jnz finishUp ; yes, so don't kill it
call DayPlanNukePrintEvent ; else destroy the print event
finishUp:
mov di, ds:[si] ; dereference the chunk
add di, ds:[di].DayPlan_offset ; access my instace data
mov ax, ds:[di].DPI_eventTable ; print EventTable => AX
pop ds:[di].DPI_docHeight ; restore the document height
pop ds:[di].DPI_viewWidth ; restore the view width
pop ds:[di].DPI_textHeight ; resotre one-line text height
pop {word} ds:[di].DPI_flags ; restore InfoFlags & PrintFlags
pop ds:[di].DPI_eventTable ; save these values...
call LMemFree ; free up the print table
mov ax, cx ; number of pages => AX
done:
.leave
ret
DayPlanPrintEngine endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanCreatePrintEvent
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Create a DayEvent to use only for printing. Also use one
of the MyText Objects created as the SizeObject, so that
all the text heights will be correctly calculated.
CALLED BY: DayPlanPrintEngine
PASS: DS:*SI = DayPlanClass instance data
ES = DGroup
SS:BP = PrintRangeStruct
AX = PrintEventInfo
RETURN: DS:*BX = DayEventClass object to print with
Carry = Clear if sufficient room to print
= Set if not
DESTROYED: Nothing
PSEUDO CODE/STRATEGY:
Query the SPC for the print mode
Create the event buffer
Set the proper font
Calculate the height of a one-line TEO
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 6/29/90 Initial version
kho 12/18/96 One-line printing added
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanCreatePrintEvent proc near
class DayEventClass
uses ax, cx, dx, di
.enter
; Store some important information
;
push bp, si ; save DayPlan, structure
push ax ; save PrintEventInfo
if SUPPORT_ONE_LINE_PRINT
push ax ; one more time
endif
mov ax, es:[SizeTextObject]
mov ss:[bp].PRS_sizeTextObj, ax
mov ax, es:[oneLineTextHeight]
mov ss:[bp].PRS_oneLineText, ax
mov ax, es:[timeWidth]
mov ss:[bp].PRS_timeWidth, ax
mov ax, es:[timeOffset]
mov ss:[bp].PRS_timeOffset, ax
; Query the MyPrint for the output mode
;
push ss:[bp].PRS_pointSize ; save the pointsize
GetResourceHandleNS CalendarPrintOptions, bx
mov si, offset CalendarPrintOptions ; OD => BX:SI
mov ax, MSG_MY_PRINT_GET_INFO
call ObjMessage_print_call
push cx ; save the FontID
mov di, offset PrintEventClass ; parent Event class => ES:DI
call BufferCreate ; PrintEvent => CX:*DX
EC < cmp cx, ds:[LMBH_handle] ; must be in this block >
EC < ERROR_NE DP_CREATE_PRINT_EVENT_WRONG_RESOURCE >
; Now tell the DayEvent to set a new font & size
;
mov si, dx ; DayEvent OD => DS:*SI
pop cx ; FontID => CX
pop dx ; pointsize => DX
pop bp ; PrintEventInfo => BP
mov ax, MSG_PE_SET_FONT_AND_SIZE ; set the font and pointsize
call ObjCallInstanceNoLock ; send the method
; Set up the event text for multiple rulers
;
mov bx, si ; DayEvent handle => BX
mov di, ds:[si] ; dereference the DayEvent
add di, ds:[di].DayEvent_offset ; instance data => DS:DI
mov si, ds:[di].DEI_textHandle ; text MyText => DS:*DI
mov es:[SizeTextObject], si ; store the handle here
if SUPPORT_ONE_LINE_PRINT
; If one-line-print, set the VisTextStates of event text accordingly
;
pop ax
test ax, mask PEI_ONE_LINE_PRINT
jz notOneLine
mov ax, MSG_VIS_TEXT_MODIFY_EDITABLE_SELECTABLE
mov cx, (0 shl 8) or mask VTS_ONE_LINE ; Set VTS_ONE_LINE
call ObjCallInstanceNoLock
notOneLine:
endif
mov ax, MSG_VIS_TEXT_CREATE_STORAGE
mov cx, mask VTSF_MULTIPLE_PARA_ATTRS
call ObjCallInstanceNoLock ; send the method
mov ax, MSG_VIS_TEXT_SET_MAX_LENGTH
mov cx, MAX_TEXT_FIELD_LENGTH+1 ; possibly 1 character too big
call ObjCallInstanceNoLock ; send the method
; Finally, calculate the one line height
;
pop si ; DayPlan handle => SI
mov ax, MSG_DP_CALC_ONE_LINE_HEIGHT
call ObjCallInstanceNoLock ; perform the calculation
pop bp ; PrintRangeStruct => SS:BP
mov ss:[bp].PRS_oneLineHeight, dx ; store the height
; Check to see if there is sufficient room to print events
;
mov ax, es:[timeWidth] ; move the time width => AX
cmp ss:[bp].PRS_width,ax ; compare with widths
; this sets/clears the carry
.leave
ret
DayPlanCreatePrintEvent endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanNukePrintEvent
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Destory the DayEvent object used to print with
CALLED BY: DayPlanPrintEngine
PASS: DS:*DX = DayEventClass object to nuke
SS:BP = PrintRangeStruct
ES = DGroup
RETURN: Nothing
DESTROYED: Nothing
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 6/29/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanNukePrintEvent proc near
uses ax, cx, dx, bp, si
.enter
; Restore some important information
;
mov ax, ss:[bp].PRS_sizeTextObj
mov es:[SizeTextObject], ax
mov ax, ss:[bp].PRS_oneLineText
mov es:[oneLineTextHeight], ax
mov ax, ss:[bp].PRS_timeWidth
mov es:[timeWidth], ax
mov ax, ss:[bp].PRS_timeOffset
mov es:[timeOffset], ax
; Now destroy the print event
;
mov si, dx ; OD => DS:*SI
mov ax, MSG_VIS_DESTROY ; destroy the entire branch
mov dl, VUM_NOW ; destroy stuff now
call ObjCallInstanceNoLock ; send the method
.leave
ret
DayPlanNukePrintEvent endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintAllEvents
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Prints all of the events in the EventTable
CALLED BY: DayPlanPrintEngine
PASS: ES = DGroup
DS:SI = DayPlanClass instance data
SS:BP = PrintRangeStruct
DS:DX = DayEventClass object to use for printing
RETURN: CX = Number of pages printed
DESTROYED: AX, BX, DI
PSEUDO CODE/STRATEGY:
A PrintPositionStruct is allocated on the stack, which is
used to pass values to PositionDayEvent(), and to
maintain some internal state. Note that a PositionStruct
is the first element of a PrintPositionStruct.
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 5/27/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanPrintAllEvents proc near
class DayPlanClass
uses dx, si, bp
.enter
; Some set-up work
;
sub sp, size PrintPositionStruct ; allocate the PositionStruct
mov bx, sp ; structure => SS:BX
mov ax, ss:[bp].PRS_width
mov ss:[bx].PS_totalWidth, ax ; store the document width
mov ss:[bx].PS_timeLeft, 0 ; never draw the icons
mov ax, ss:[bp].PRS_oneLineHeight
mov ss:[bx].PS_timeHeight, ax ; store the one line height
mov ax, ss:[bp].PRS_height
mov ss:[bx].PPS_pageHeight, ax ; store the page height
mov ax, ss:[bp].PRS_specialValue ; either 1 or 2
mov ss:[bx].PPS_singlePage, al ; store the page boolean
mov ss:[bx].PPS_numPages, 1 ; initally, one page
mov ss:[bx].PPS_nextOffset, 0 ; no next offset
mov ax, dx ; PrintEvent => DS:*AX
mov dx, bx ; PositionStruct => SS:DX
mov bp, ss:[bp].PRS_gstate ; GState => BP
mov si, ds:[si] ; dereference the handle
add si, ds:[si].DayPlan_offset ; access my instance data
mov si, ds:[si].DPI_eventTable ; event table handle => SI
mov di, ds:[si] ; dereference the handle
mov bx, size EventTableHeader ; go to the first event
clr cx ; start at the top!
jmp midLoop ; start looping
; Loop here
eventLoop:
call DayPlanPrintOneEvent ; print the event
jc done ; if carry set, abort
add bx, size EventTableEntry
midLoop:
cmp bx, ds:[di].ETH_last ; are we done ??
jl eventLoop
; Let's do some clean up work
;
done:
mov bp, dx ; PrintPositionStruct => SS:BP
mov cx, ss:[bp].PPS_numPages ; number of pages => AX
add sp, size PrintPositionStruct ; clean up the stack
.leave
ret
DayPlanPrintAllEvents endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintOneEvent
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Prints one event corresponding to the EventTableEntry
CALLED BY: DayPlanPrintEngine()
PASS: ES = DGroup
DS:*SI = EventTable
DS:DI = EventTable
DS:*AX = PrintEvent to use
SS:DX = PrintPositionStruct
BP = GState
CX = Y-position
BX = Offset to the EventTableEntry to be printed
RETURN: DS:DI = EventTable (updated)
CX = Y-position in document (updated)
Carry = Set to stop printing of this range
DESTROYED: Nothing
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 5/27/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanPrintOneEvent proc near
.enter
; First stuff the event
;
push si, bp, dx ; table handle, GState, struct
add di, bx ; go to the proper ETE
mov bp, ds:[di].ETE_size ; event height => BP
mov dx, DO_NOT_INSERT_VALUE ; don't insert into vistree
call StuffDayEvent ; load time & text strings
mov si, ax ; DayEvent => SI
mov dx, bp ; event height => DX
pop bp ; PositionStruct => SS:BP
pop di ; GState => DI
cmp ss:[bp].PPS_singlePage, 1 ; printing events in a month?
jnz position ; no, so use regular values
call DayPlanPrintPrepareDateEvent ; set some styles, etc...
; Now position the sucker (possibly on a new page)
;
position:
mov ax, cx ; y-position => AX
add ax, dx ; calculate to end of event
cmp ss:[bp].PPS_pageHeight, ax ; does it fit on the page ??
jge positionNow ; yes, so jump
printAgain:
call DayPlanPrintEventCrossesPage ; determine what to do
positionNow:
pushf ; save the carry flag
call PositionDayEvent ; position the event (at CX)
add cx, dx ; update the document position
; Enable the event for printing
;
mov ax, MSG_PE_PRINT_ENABLE
call ObjCallInstanceNoLock ; CX, DX, BP are preserved
; Finally draw the event
;
push bp, dx, cx ; save doc offset & struct
mov bp, di ; GState => BP
mov ax, MSG_VIS_DRAW
mov cl, mask DF_PRINT ; we're printing
call ObjCallInstanceNoLock ; draw the event
pop bp, dx, cx ; restore doc offset, struct
cmp ss:[bp].PPS_singlePage, 1 ; print to single page only ?
je noLoop ; yes, so don't loop again
popf ; restore the carry flag
jc printAgain ; multiple-page event
pushf ; else store CF=0
noLoop:
popf ; restore the CF
; Clean up work
;
mov dx, bp ; PrintPositionStruct => SS:DX
mov bp, di ; GState => BP
mov ax, si ; PrintEvent => DS:*AX
pop si ; restore the EventTable chunk
mov di, ds:[si] ; dereference the handle
.leave
ret
DayPlanPrintOneEvent endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintPrepareDateEvent
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Set the margin and border information for this event
to fully utilize the space inside of a date.
CALLED BY: GLOBAL
PASS: DS:*SI = DayEventClass object used for printing
SS:BP = PrintPositionStruct
ES = DGroup
RETURN: DX = Height of the event
DESTROYED: Nothing
PSEUDO CODE/STRATEGY:
We are being very tricky here, because the SizeTextObject,
at this point, holds the text of the event. All we need to
do is determine if there is a valid time, and if so,
set up the first paragraph and the rest of the object
rulers.
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 10/4/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
TEXT_INDENT_LEVEL = 2 ; basic text indentation level
CRString byte '\r', 0 ; a carriage return
VTRP_textPtr equ <VTRP_textReference.TR_ref.TRU_pointer.TRP_pointer>
DayPlanPrintPrepareDateEvent proc near
uses ax, bx, cx, di, si, bp
class VisTextClass
.enter
; Set the default margin
;
mov di, bp ; PrintPositionStruct => SS:DI
push si ; save the DayEvent handle
mov si, es:[SizeTextObject] ; OD => DS:*SI
sub sp, size VisTextSetMarginParams
mov bp, sp
clrdw ss:[bp].VTSMP_range.VTR_start
movdw ss:[bp].VTSMP_range.VTR_end, TEXT_ADDRESS_PAST_END
mov ss:[bp].VTSMP_position, TEXT_INDENT_LEVEL * 8
mov ax, MSG_VIS_TEXT_SET_LEFT_AND_PARA_MARGIN
call ObjCallInstanceNoLock ; send the method
add sp, size VisTextSetMarginParams
; Do we have any time ?
;
mov bx, si ; MyText handle => BX
pop si ; DayEvent handle => SI
mov ax, MSG_DE_GET_TIME
call ObjCallInstanceNoLock ; time => CX
mov si, bx ; MyText handle => SI
cmp cx, -1 ; no time ??
je calcSize ; just re-calculate the size
; Check if the space between the time and the border is wide enough
; to hold some text. If it is not, insert a CR at the front of the
; text.
;
mov cx, ss:[di].PPS_posStruct.PS_totalWidth
sub cx, es:[timeWidth] ; 1st line's wdith => CX
cmp cx, VIS_TEXT_MIN_TEXT_FIELD_WIDTH
jge setMargin ; if big enough, continue
sub sp, size VisTextReplaceParameters
mov bp, sp ; structure => SS:BP
clr ax
mov ss:[bp].VTRP_flags, ax
clrdw ss:[bp].VTRP_range.VTR_start, ax
clrdw ss:[bp].VTRP_range.VTR_end, ax
mov ss:[bp].VTRP_insCount.high, ax
inc ax
mov ss:[bp].VTRP_insCount.low, ax ; insert one character
mov ss:[bp].VTRP_textReference.TR_type, TRT_POINTER
mov ss:[bp].VTRP_textPtr.segment, cs
mov ss:[bp].VTRP_textPtr.offset, offset CRString
mov ax, MSG_VIS_TEXT_REPLACE_TEXT
call ObjCallInstanceNoLock ; insert the CR.
add sp, size VisTextReplaceParameters
jmp calcSize ; finish up
; Else set the paragraph margin for the first paragraph
;
setMargin:
sub sp, size VisTextSetMarginParams
mov bp, sp
clr ax
clrdw ss:[bp].VTSMP_range.VTR_start, ax
clrdw ss:[bp].VTSMP_range.VTR_end, ax
mov ax, es:[timeWidth] ; time width => AX
shl ax, 1
shl ax, 1
shl ax, 1
mov ss:[bp].VTSMP_position, ax
mov ax, MSG_VIS_TEXT_SET_PARA_MARGIN
call ObjCallInstanceNoLock ; set paragraph margin in BP
add sp, size VisTextSetMarginParams
; Calculate the final size. I had to add a horrible hack to
; clear a field in the text object, so that the actual height
; of the text will be properly returned, rather than the height
; of the first text to be drawn. -Don 9/29/93
;
calcSize:
mov cx, ss:[di].PPS_posStruct.PS_totalWidth
clr dx ; don't cache the height
mov di, ds:[si]
add di, ds:[di].Vis_offset
clr ds:[di].VTI_lastWidth
mov ax, MSG_VIS_TEXT_CALC_HEIGHT ; using width in CX
call ObjCallInstanceNoLock ; height => DX
.leave
ret
DayPlanPrintPrepareDateEvent endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintEventCrossesPage
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: An event does not fit on one page, by the amount in AX.
Determine where to print the event.
CALLED BY: DayPlanPrintOneEvent
PASS: ES = DGroup
SS:BP = PrintPositionStruct
CX = Offset in page to the top of the event
DX = Length of the event
DI = GState
RETURN: CX = Offset at which we should print the event.
Carry = Set to print this event again
DESTROYED: AX
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 6/30/90 Initial version
Don 7/19/90 Deal with multi-page events better
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
MAX_SPACE_AT_BOTTOM_OF_PAGE = 36 ; (up to 3 lines of 12pt text)
DayPlanPrintEventCrossesPage proc near
uses bx, dx
.enter
; Will we need to draw again ??
;
mov bx, ss:[bp].PPS_pageHeight ; height of a page => BX
cmp ss:[bp].PPS_singlePage, 1 ; keep on one page ??
je forceClip ; force event to be clipped
; Are we in the middle of a multi-page event
;
tst ss:[bp].PPS_nextOffset ; is there a next offset ??
jz firstTime ; no, so continue
mov cx, ss:[bp].PPS_nextOffset ; grab the next offset
jmp newPage
; See where we should place this event
;
firstTime:
mov ax, bx ; bottom of page => AX
sub ax, cx ; how far from the bottom => AX
cmp ax, MAX_SPACE_AT_BOTTOM_OF_PAGE ; split on two pages ??
jg nextPageCalc ; yes, so calc next offset
clr cx ; else offset = 0 on a new page
; Create a new page
;
newPage:
inc ss:[bp].PPS_numPages ; count the number of pages
mov al, PEC_FORM_FEED
call GrNewPage ; new page to the GString
call InitPagePosition ; initialize the drawing
; See if it will now fit on the rest of this page
;
nextPageCalc:
mov ss:[bp].PPS_nextOffset, 0 ; assume no next offset
mov ax, cx ; offset => AX
add ax, dx ; length of the page
cmp bx, ax ; does it fit on the page ??
jge done ; yes
forceClip:
call DayPlanPrintCalcNextOffset ; else do the dirty work!
stc ; ensure the carry is set!
done:
.leave
ret
DayPlanPrintEventCrossesPage endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DayPlanPrintCalcNextOffset
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Calculate the offset of the event text for the next page,
to ensure the text starts with a complete line. Also sets
the clip rectangle (if any) for the bottom of the current
page.
CALLED BY: DayPlanPrintEventCrossesPage
PASS: ES = DGroup
SS:BP = PrintPositionStruct
BX = Page length
CX = Offset of the event text
DX = Length of the event text
DI = GState
RETURN: Nothing
DESTROYED: AX, BX, DX
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 7/19/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DayPlanPrintCalcNextOffset proc near
uses cx
.enter
; Calculate the raw offset to the next page
;
mov ss:[bp].PPS_nextOffset, cx ; store the current offset
sub ss:[bp].PPS_nextOffset, bx ; subtract offset to next page
; See if we break between lines
;
mov ax, bx ; page width => AX
sub ax, cx ; space left on page => AX
sub ax, EVENT_TB_MARGIN ; allow for top margin
mov cx, es:[oneLineTextHeight]
sub cx, 2 * EVENT_TB_MARGIN ; space per line => CX
clr dx ; difference => DX:AX
div cx ; perform the division
tst dx ; any remainder ??
jz done ; no, so we're done
; Else we must set a clip rectangle, and adjust the next offset
;
push si ; save this register
add ss:[bp].PPS_nextOffset, dx ; adjust next offset!
sub bx, dx ; offset to end of text
;;; dec bx ; text goes from 0->N-1
mov dx, bx ; bottom edge
mov cx, ss:[bp].PS_totalWidth ; right edge
clr ax ; left edge
mov bx, ax ; top edge
mov si, PCT_REPLACE ; set a new clip rectangle
call GrSetClipRect ; set the clip rectangle
pop si ; restore this register
done:
.leave
ret
DayPlanPrintCalcNextOffset endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
InitPagePosition
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Account for the page borders by translating the page down
and right by the border amount
CALLED BY: INTERNAL
PASS: DI = GString
RETURN: Nothing
DESTROYED: Nothing
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
none
REVISION HISTORY:
Name Date Description
---- ---- -----------
Don 6/29/90 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
InitPagePosition proc near
uses ax, bx, cx, dx, si
.enter
; Initialize the page position
;
mov dx, es:[printMarginLeft]
clr cx ; x translation => DX:CX
mov bx, es:[printMarginTop]
mov ax, cx ; y translation => BX:AX
call GrApplyTranslation ; allow fro print margins
; Alse set the color mapping mode
;
mov al, ColorMapMode <1, 0, CMT_CLOSEST>
call GrSetAreaColorMap ; map to solid colors
; Set a clip rectangle for the entire page
;
clr ax, bx
mov cx, es:[printWidth]
mov dx, es:[printHeight]
mov si, PCT_REPLACE ; set a new clip rectangle
call GrSetClipRect ; set the clip rectangle
.leave
ret
InitPagePosition endp
PrintCode ends
|
server/src/layerfile-service/antlr/LayerfileLexer.g4 | Peter8234/atom-layerfile | 0 | 4742 | <reponame>Peter8234/atom-layerfile<filename>server/src/layerfile-service/antlr/LayerfileLexer.g4<gh_stars>0
lexer grammar LayerfileLexer;
WS : [ \t\r\n]+ -> skip;
COMMENT: '#' ~[\r\n]*;
BUTTON: 'BUTTON' -> pushMode(BUTTON_INSTR);
CACHE: 'CACHE' -> pushMode(READ_FILES);
CHECKPOINT: 'CHECKPOINT' -> pushMode(CHECKPOINT_INSTR);
CLONE: 'CLONE ' -> pushMode(CLONE_INSTR);
COPY: 'COPY' -> pushMode(READ_FILES);
ENV: 'ENV' -> pushMode(ENV_INSTR);
BUILD_ENV: 'BUILD ENV ' -> pushMode(BUILD_ENV_INSTR);
FROM: 'FROM ' -> pushMode(FROM_INSTR);
MEMORY: 'MEMORY ' -> pushMode(MEMORY_INSTR);
RUN: 'RUN ' -> pushMode(RUN_INSTR);
RUN_BACKGROUND: 'RUN BACKGROUND ' -> pushMode(RUN_INSTR);
RUN_REPEATABLE: 'RUN REPEATABLE ' -> pushMode(RUN_INSTR);
SECRET_ENV: 'SECRET ENV ' -> pushMode(SECRET_ENV_INSTR);
SETUP_FILE: 'SETUP FILE ' -> pushMode(READ_FILES);
SKIP_REMAINING_IF: 'SKIP REMAINING IF ' -> pushMode(SKIP_REMAINING_IF_INSTR);
SPLIT: 'SPLIT ' -> pushMode(SPLIT_INSTR);
EXPOSE_WEBSITE: 'EXPOSE WEBSITE ' -> pushMode(EXPOSE_WEBSITE_INSTR);
USER: 'USER ' -> pushMode(USER_INSTR);
WAIT: 'WAIT ' -> pushMode(READ_FILES);
WORKDIR: 'WORKDIR ' -> pushMode(READ_FILES);
OTHER: .;
mode BUILD_ENV_INSTR;
BUILD_ENV_VALUE: ~[ \r\n]+;
BUILD_ENV_WS: [ \t]+ -> skip;
BUILD_ENV_EOL: (('\r'? '\n') | '\r' | EOF) -> popMode;
mode BUTTON_INSTR;
BUTTON_DATA: (('\r'? '\n') | '\r' | EOF) -> popMode;
BUTTON_MORE: . -> more;
mode CHECKPOINT_INSTR;
CHECKPOINT_VALUE: ~[ \t\r\n]+;
CHECKPOINT_WS : [ \t] -> skip;
CHECKPOINT_EOL: (('\r'? '\n') | '\r' | EOF) -> popMode;
mode CLONE_INSTR;
CLONE_VALUE:
'"' .*? '"'
| '\'' .*? '\''
| 'DEFAULT="' .*? '"'
| 'DEFAULT=\'' .*? '\''
| ~[ \t\r\n]+
;
CLONE_WS: [ \t]+ -> skip;
CLONE_EOL: (('\r'? '\n') | '\r' | EOF) -> popMode;
mode ENV_INSTR;
fragment ENV_VALUE_FRAG: '"' .*? '"'
| '\'' .*? '\''
| '`' .*? '`'
| '$(' .*? ')'
| ~[ \r\n]+
;
fragment ENV_KEY: ('0'..'9' | 'a'..'z' | 'A'..'Z' | '_' | '-')+;
ENV_VALUE:
ENV_KEY [ \t]* '=' [ \t]* ENV_VALUE_FRAG
| ENV_VALUE_FRAG
;
ENV_WS: [ \t]+ -> skip;
ENV_EOL: (('\r'? '\n') | '\r' | EOF) -> popMode;
mode EXPOSE_WEBSITE_INSTR;
WEBSITE_EOL: (('\r'? '\n') | '\r' | EOF) -> popMode;
WEBSITE_ITEM: ~[ \r\n\t]+ ;
WEBSITE_WS: [ \t]+ -> skip;
mode FROM_INSTR;
FROM_DATA: (('\r'? '\n') | '\r' | EOF) -> popMode;
FROM_MORE: . -> more;
mode MEMORY_INSTR;
MEMORY_AMOUNT: (('\r'? '\n') | '\r' | EOF) -> popMode;
MEMORY_MORE: . -> more;
mode RUN_INSTR;
RUN_DATA: (('\r'? '\n') | '\r' | EOF) -> popMode;
RUN_NEXT: ('\\\r' | '\\\r\n' | '\\\n') -> skip;
RUN_COMMAND: . -> more;
mode SECRET_ENV_INSTR;
SECRET_ENV_VALUE: ~[ \r\n=]+;
SECRET_ENV_WS: [ \t]+ -> skip;
SECRET_ENV_EOL: (('\r'? '\n') | '\r' | EOF) -> popMode;
mode SKIP_REMAINING_IF_INSTR;
SKIP_REMAINING_IF_VALUE:
('0'..'9'|'A'..'Z'|'a'..'z'|'_'|'-')+ [ \t]* ('!=~' | '!=' | '=~' | '=') [ \t]*
('"' .*? '"'
| '\'' .*? '\''
| ~[ \r\n]+
);
SKIP_REMAINING_IF_AND: 'AND';
SKIP_REMAINING_IF_WS: [ \t]+ -> skip;
SKIP_REMAINING_IF_EOL: (('\r'? '\n') | '\r' | EOF) -> popMode;
mode SPLIT_INSTR;
SPLIT_NUMBER: (('\r'? '\n') | '\r' | EOF) -> popMode;
SPLIT_MORE: . -> more;
SPLIT_WS: [ \t]+ -> skip;
mode USER_INSTR;
USER_NAME: (('\r'? '\n') | '\r' | EOF) -> popMode;
USER_MORE: . -> more;
mode READ_FILES;
END_OF_FILES: (('\r'? '\n') | '\r' | EOF) -> popMode;
FILE: ~[ \r\n\t]+
| '"' .*? '"';
FILE_WS: [ \t]+ -> skip; |
Engine Hacks/Skill System/Teq Skills/FE8-StealPlus/FE8-Rogue Robbery.asm | sme23/MekkahRestrictedHackComp1 | 0 | 24552 | <reponame>sme23/MekkahRestrictedHackComp1
.thumb
@r0=unit data ptr of unit being stolen from, r1=slot number
.equ SkillTester, Con_Getter+4
.equ StealPlusID, SkillTester+4
push {r4-r7,r14}
mov r4,r0
mov r5,r1
lsl r6,r5,#1
add r6,#0x1E
ldrh r6,[r4,r6] @item id
cmp r6,#0
beq RetFalse
mov r0,r6
ldr r3,=#0x8017548 @get item type
mov r14,r3
.short 0xF800
cmp r0,#9
beq RetTrue @we can always steal items
mov r7,r0
ldr r0,=#0x3004E50 @current character
ldr r0,[r0]
ldr r1,StealPlusID
ldr r3,SkillTester
mov r14,r3
.short 0xF800
cmp r0,#0
beq RetFalse
mov r0,r7
cmp r0,#4
beq RetTrue @can steal staves without weight check
cmp r0,#0xB
bgt RetTrue @only items higher than this are Rings, Fire Dragon Stone, and Dancer rings, which aren't really used. The rest are either normal or monster weapons (0xA is unused)
ldr r7,=#0x3004E50
ldr r7,[r7]
mov r0,r4
ldr r3,=#0x8016B58 @GetUnitEquippedItemSlot
mov r14,r3
.short 0xF800
cmp r0,r5
beq RetFalse @can't steal equipped weapons
mov r0,r6
ldr r3,=#0x801760C @get item weight
mov r14,r3
.short 0xF800
mov r5,r0
mov r0,r7
ldr r3,Con_Getter
mov r14,r3
.short 0xF800
cmp r0,r5
blt RetFalse @if con < weight, no steal
RetTrue:
mov r0,#1
b GoBack
RetFalse:
mov r0,#0
GoBack:
pop {r4-r7}
pop {r1}
bx r1
.ltorg
Con_Getter:
@
|
src/main/antlr4/com/salesforce/dynamodbv2/grammar/Expressions.g4 | salesforce/mt-dynamo | 27 | 4565 | grammar Expressions;
// not supported: REMOVE, DELETE
updateExpression
: setSection EOF
| addSection EOF
| setSection addSection EOF
;
setSection
: SET setAction (COMMA setAction)*
;
addSection
: ADD addAction (COMMA addAction)*
;
// not supported: path = setValue + setValue, path = setValue - setValue
setAction
: path '=' setValue
;
addAction
: path addValue
;
// not supported: non-literal value, if_not_exists, list_append
setValue
: literal
;
addValue
: literal
;
keyConditionExpression
: keyCondition EOF
;
// not supported: begins_with
keyCondition
: id comparator literal
| id BETWEEN literal AND literal
| keyCondition AND keyCondition
| LPAREN keyCondition RPAREN
;
/*condition
: operand comparator operand
| operand BETWEEN operand AND operand
| function
| condition AND condition
| condition OR condition
| NOT condition
| LPAREN condition RPAREN
;*/
comparator
: '='
| '<>'
| '<'
| '<='
| '>'
| '>='
;
/*operand
: path
| literal
;*/
// not supported: complex paths paths containing '.' or '[n]'
path
: id
;
literal
: VALUE_PLACEHOLDER
;
id
: FIELD_PLACEHOLDER
| ALPHANUM
;
VALUE_PLACEHOLDER
: ':'ALPHANUM
;
FIELD_PLACEHOLDER
: '#'ALPHANUM
;
SET
: [sS][eE][tT]
;
ADD
: [aA][dD][dD]
;
BETWEEN
: [bB][eE][tT][wW][eE][eE][nN]
;
AND
: [aA][nN][dD]
;
OR
: [oO][rR]
;
NOT
: [nN][oO][tT]
;
LPAREN
: '('
;
RPAREN
: ')'
;
COMMA
: ','
;
ALPHANUM
: [0-9a-zA-Z_-]+
;
WS
: [ \t]+ -> skip
; |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.