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 |
|---|---|---|---|---|
arch/ARM/STM32/driversL5/stm32-hash.adb | morbos/Ada_Drivers_Library | 2 | 10129 | with System;
with STM32_SVD.RCC; use STM32_SVD.RCC;
package body STM32.HASH is
procedure Enable_Hash
is
RCC : aliased RCC_Peripheral
with Import, Address => S_NS_Periph (RCC_Base);
begin
RCC.AHB2ENR.HASHEN := True;
end Enable_Hash;
procedure Init_Hash (Algorithm : Algorithm_Selection;
Mode : Mode_Selection;
Width : Width_Selection)
is
X : UInt2 := UInt2 (Algorithm'Enum_Rep);
begin
-- *sigh*, ALGO is a split field... we need to move the bits around
HASH.CR.ALGO_1 := (if (X and 2) = 2 then True else False);
HASH.CR.ALGO := (if (X and 1) = 1 then True else False);
HASH.CR.MODE := (if Mode = HMAC_Mode then True else False);
HASH.CR.DATATYPE := Width'Enum_Rep;
-- Clear the hash
HASH.CR.INIT := True;
end Init_Hash;
procedure Feed_Hash (Input : UInt8_Array)
is
-- vvvv used to pack 8 to 32.
X : UInt32;
Y : UInt8_Array (0 .. 3);
for X'Address use Y'Address;
type Counter is mod 4;
Count : Counter;
begin
Count := 0;
for Ch of Input loop
Y (Integer (Count)) := Ch;
Count := Count + 1;
if Count = 0 then
-- Wrapped, push in what we have
HASH.DIN := X;
end if;
end loop;
-- Handle the remainder
if Count > 0 then
HASH.DIN := X;
HASH.STR.NBLW := UInt5 (Count) * 8;
end if;
end Feed_Hash;
procedure Feed_Hash (Input : UInt16_Array)
is
-- vvvv used to pack 16 to 32.
X : UInt32;
Y : UInt16_Array (0 .. 1);
for X'Address use Y'Address;
type Counter is mod 2;
Count : Counter;
begin
Count := 0;
for Ch of Input loop
Y (Integer (Count)) := Ch;
Count := Count + 1;
if Count = 0 then
-- Wrapped, push in what we have
HASH.DIN := X;
end if;
end loop;
-- Handle the remainder
if Count > 0 then
HASH.DIN := X;
HASH.STR.NBLW := UInt5 (Count) * 16;
end if;
end Feed_Hash;
procedure Feed_Hash (Input : UInt32_Array)
is
begin
for Val of Input loop
HASH.DIN := Val;
end loop;
end Feed_Hash;
-- Start the digest computation and wait
-- for it to finish.
procedure Finish_Hash
is
begin
HASH.STR.DCAL := True;
loop
exit when not HASH.SR.BUSY;
end loop;
end Finish_Hash;
end STM32.HASH;
|
ln.asm | coopervk/xv6-small-file-optimization | 1 | 164744 | <reponame>coopervk/xv6-small-file-optimization
-S _ln
|
prototyping/Properties/DecSubtyping.agda | TheGreatSageEqualToHeaven/luau | 1 | 11898 | <filename>prototyping/Properties/DecSubtyping.agda
{-# OPTIONS --rewriting #-}
module Properties.DecSubtyping where
open import Agda.Builtin.Equality using (_≡_; refl)
open import FFI.Data.Either using (Either; Left; Right; mapLR; swapLR; cond)
open import Luau.FunctionTypes using (src; srcⁿ; tgt)
open import Luau.Subtyping using (_<:_; _≮:_; Tree; Language; ¬Language; witness; unknown; never; scalar; function; scalar-function; scalar-function-ok; scalar-function-err; scalar-scalar; function-scalar; function-ok; function-err; left; right; _,_)
open import Luau.Type using (Type; Scalar; nil; number; string; boolean; never; unknown; _⇒_; _∪_; _∩_)
open import Properties.Contradiction using (CONTRADICTION; ¬)
open import Properties.Functions using (_∘_)
open import Properties.Subtyping using (<:-refl; <:-trans; ≮:-trans-<:; <:-trans-≮:; <:-never; <:-unknown; <:-∪-left; <:-∪-right; <:-∪-lub; ≮:-∪-left; ≮:-∪-right; <:-∩-left; <:-∩-right; <:-∩-glb; ≮:-∩-left; ≮:-∩-right; dec-language; scalar-<:; <:-everything; <:-function; ≮:-function-left; ≮:-function-right)
open import Properties.TypeNormalization using (FunType; Normal; never; unknown; _∩_; _∪_; _⇒_; normal; <:-normalize; normalize-<:)
open import Properties.FunctionTypes using (fun-¬scalar; ¬fun-scalar; fun-function; src-unknown-≮:; tgt-never-≮:; src-tgtᶠ-<:)
open import Properties.Equality using (_≢_)
-- Honest this terminates, since src and tgt reduce the depth of nested arrows
{-# TERMINATING #-}
dec-subtypingˢⁿ : ∀ {T U} → Scalar T → Normal U → Either (T ≮: U) (T <: U)
dec-subtypingᶠ : ∀ {T U} → FunType T → FunType U → Either (T ≮: U) (T <: U)
dec-subtypingᶠⁿ : ∀ {T U} → FunType T → Normal U → Either (T ≮: U) (T <: U)
dec-subtypingⁿ : ∀ {T U} → Normal T → Normal U → Either (T ≮: U) (T <: U)
dec-subtyping : ∀ T U → Either (T ≮: U) (T <: U)
dec-subtypingˢⁿ T U with dec-language _ (scalar T)
dec-subtypingˢⁿ T U | Left p = Left (witness (scalar T) (scalar T) p)
dec-subtypingˢⁿ T U | Right p = Right (scalar-<: T p)
dec-subtypingᶠ {T = T} _ (U ⇒ V) with dec-subtypingⁿ U (normal (src T)) | dec-subtypingⁿ (normal (tgt T)) V
dec-subtypingᶠ {T = T} _ (U ⇒ V) | Left p | q = Left (≮:-trans-<: (src-unknown-≮: (≮:-trans-<: p (<:-normalize (src T)))) (<:-function <:-refl <:-unknown))
dec-subtypingᶠ {T = T} _ (U ⇒ V) | Right p | Left q = Left (≮:-trans-<: (tgt-never-≮: (<:-trans-≮: (normalize-<: (tgt T)) q)) (<:-trans (<:-function <:-never <:-refl) <:-∪-right))
dec-subtypingᶠ T (U ⇒ V) | Right p | Right q = Right (src-tgtᶠ-<: T (<:-trans p (normalize-<: _)) (<:-trans (<:-normalize _) q))
dec-subtypingᶠ T (U ∩ V) with dec-subtypingᶠ T U | dec-subtypingᶠ T V
dec-subtypingᶠ T (U ∩ V) | Left p | q = Left (≮:-∩-left p)
dec-subtypingᶠ T (U ∩ V) | Right p | Left q = Left (≮:-∩-right q)
dec-subtypingᶠ T (U ∩ V) | Right p | Right q = Right (<:-∩-glb p q)
dec-subtypingᶠⁿ T never = Left (witness function (fun-function T) never)
dec-subtypingᶠⁿ T unknown = Right <:-unknown
dec-subtypingᶠⁿ T (U ⇒ V) = dec-subtypingᶠ T (U ⇒ V)
dec-subtypingᶠⁿ T (U ∩ V) = dec-subtypingᶠ T (U ∩ V)
dec-subtypingᶠⁿ T (U ∪ V) with dec-subtypingᶠⁿ T U
dec-subtypingᶠⁿ T (U ∪ V) | Left (witness t p q) = Left (witness t p (q , ¬fun-scalar V T p))
dec-subtypingᶠⁿ T (U ∪ V) | Right p = Right (<:-trans p <:-∪-left)
dec-subtypingⁿ never U = Right <:-never
dec-subtypingⁿ unknown unknown = Right <:-refl
dec-subtypingⁿ unknown U with dec-subtypingᶠⁿ (never ⇒ unknown) U
dec-subtypingⁿ unknown U | Left p = Left (<:-trans-≮: <:-unknown p)
dec-subtypingⁿ unknown U | Right p₁ with dec-subtypingˢⁿ number U
dec-subtypingⁿ unknown U | Right p₁ | Left p = Left (<:-trans-≮: <:-unknown p)
dec-subtypingⁿ unknown U | Right p₁ | Right p₂ with dec-subtypingˢⁿ string U
dec-subtypingⁿ unknown U | Right p₁ | Right p₂ | Left p = Left (<:-trans-≮: <:-unknown p)
dec-subtypingⁿ unknown U | Right p₁ | Right p₂ | Right p₃ with dec-subtypingˢⁿ nil U
dec-subtypingⁿ unknown U | Right p₁ | Right p₂ | Right p₃ | Left p = Left (<:-trans-≮: <:-unknown p)
dec-subtypingⁿ unknown U | Right p₁ | Right p₂ | Right p₃ | Right p₄ with dec-subtypingˢⁿ boolean U
dec-subtypingⁿ unknown U | Right p₁ | Right p₂ | Right p₃ | Right p₄ | Left p = Left (<:-trans-≮: <:-unknown p)
dec-subtypingⁿ unknown U | Right p₁ | Right p₂ | Right p₃ | Right p₄ | Right p₅ = Right (<:-trans <:-everything (<:-∪-lub p₁ (<:-∪-lub p₂ (<:-∪-lub p₃ (<:-∪-lub p₄ p₅)))))
dec-subtypingⁿ (S ⇒ T) U = dec-subtypingᶠⁿ (S ⇒ T) U
dec-subtypingⁿ (S ∩ T) U = dec-subtypingᶠⁿ (S ∩ T) U
dec-subtypingⁿ (S ∪ T) U with dec-subtypingⁿ S U | dec-subtypingˢⁿ T U
dec-subtypingⁿ (S ∪ T) U | Left p | q = Left (≮:-∪-left p)
dec-subtypingⁿ (S ∪ T) U | Right p | Left q = Left (≮:-∪-right q)
dec-subtypingⁿ (S ∪ T) U | Right p | Right q = Right (<:-∪-lub p q)
dec-subtyping T U with dec-subtypingⁿ (normal T) (normal U)
dec-subtyping T U | Left p = Left (<:-trans-≮: (normalize-<: T) (≮:-trans-<: p (<:-normalize U)))
dec-subtyping T U | Right p = Right (<:-trans (<:-normalize T) (<:-trans p (normalize-<: U)))
|
oeis/229/A229582.asm | neoneye/loda-programs | 11 | 15349 | ; A229582: Number of defective 3-colorings of an n X 4 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
; 6,116,1620,19764,224532,2440692,25745364,265720500,2697594516,27033340788,268094978388,2636009007156,25732468879380,249667710249204,2409688805255892,23151313964420532,221538858133842324,2112443015291098740,20079326766398549076,190319997556594885428,1799334487940425462548,16972100980843472606196,159751724132008044445140,1500790854927823518910644,14074345734008171740335252,131774163962993386294272372,1231912946879219042329747284,11500725762823478472099388980,107228115033605870069079471636
mul $0,2
seq $0,268622 ; Number of n X 2 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.
div $0,3
mul $0,2
|
src/security-auth-oauth-facebook.adb | jquorning/ada-security | 19 | 23956 | <gh_stars>10-100
-----------------------------------------------------------------------
-- security-auth-oauth-facebook -- Facebook OAuth based authentication
-- Copyright (C) 2013, 2014 <NAME>
-- Written by <NAME> (<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.
-----------------------------------------------------------------------
with Util.Beans.Objects;
with Util.Beans.Objects.Time;
with Util.Serialize.Mappers.Record_Mapper;
with Util.Http.Rest;
package body Security.Auth.OAuth.Facebook is
--
TIME_SHIFT : constant Duration := 12 * 3600.0;
type Token_Info_Field_Type is (FIELD_APP_ID, FIELD_IS_VALID,
FIELD_EXPIRES, FIELD_ISSUED_AT,
FIELD_USER_ID, FIELD_EMAIL, FIELD_FIRST_NAME,
FIELD_LAST_NAME, FIELD_NAME, FIELD_LOCALE, FIELD_GENDER);
type Token_Info is record
App_Id : Ada.Strings.Unbounded.Unbounded_String;
Is_Valid : Boolean := False;
Expires : Ada.Calendar.Time;
Issued : Ada.Calendar.Time;
User_Id : Ada.Strings.Unbounded.Unbounded_String;
Email : Ada.Strings.Unbounded.Unbounded_String;
Name : Ada.Strings.Unbounded.Unbounded_String;
First_Name : Ada.Strings.Unbounded.Unbounded_String;
Last_Name : Ada.Strings.Unbounded.Unbounded_String;
Locale : Ada.Strings.Unbounded.Unbounded_String;
Gender : Ada.Strings.Unbounded.Unbounded_String;
end record;
type Token_Info_Access is access all Token_Info;
procedure Set_Member (Into : in out Token_Info;
Field : in Token_Info_Field_Type;
Value : in Util.Beans.Objects.Object);
procedure Set_Member (Into : in out Token_Info;
Field : in Token_Info_Field_Type;
Value : in Util.Beans.Objects.Object) is
begin
case Field is
when FIELD_APP_ID =>
Into.App_Id := Util.Beans.Objects.To_Unbounded_String (Value);
when FIELD_IS_VALID =>
Into.Is_Valid := Util.Beans.Objects.To_Boolean (Value);
when FIELD_EXPIRES =>
Into.Expires := Util.Beans.Objects.Time.To_Time (Value);
when FIELD_ISSUED_AT =>
Into.Issued := Util.Beans.Objects.Time.To_Time (Value);
when FIELD_USER_ID =>
Into.User_Id := Util.Beans.Objects.To_Unbounded_String (Value);
when FIELD_EMAIL =>
Into.Email := Util.Beans.Objects.To_Unbounded_String (Value);
when FIELD_NAME =>
Into.Name := Util.Beans.Objects.To_Unbounded_String (Value);
when FIELD_FIRST_NAME =>
Into.First_Name := Util.Beans.Objects.To_Unbounded_String (Value);
when FIELD_LAST_NAME =>
Into.Last_Name := Util.Beans.Objects.To_Unbounded_String (Value);
when FIELD_LOCALE =>
Into.Locale := Util.Beans.Objects.To_Unbounded_String (Value);
when FIELD_GENDER =>
Into.Gender := Util.Beans.Objects.To_Unbounded_String (Value);
end case;
end Set_Member;
package Token_Info_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Token_Info,
Element_Type_Access => Token_Info_Access,
Fields => Token_Info_Field_Type,
Set_Member => Set_Member);
procedure Get_Token_Info is
new Util.Http.Rest.Rest_Get (Element_Mapper => Token_Info_Mapper);
Token_Info_Map : aliased Token_Info_Mapper.Mapper;
-- ------------------------------
-- Initialize the authentication realm.
-- ------------------------------
overriding
procedure Initialize (Realm : in out Manager;
Params : in Parameters'Class;
Provider : in String := PROVIDER_OPENID) is
Client : constant String := Params.Get_Parameter (Provider & ".client_id");
Secret : constant String := Params.Get_Parameter (Provider & ".secret");
begin
Security.Auth.OAuth.Manager (Realm).Initialize (Params, Provider);
Realm.App_Access_Token := To_Unbounded_String (Client & "|" & Secret);
end Initialize;
-- ------------------------------
-- Verify the OAuth access token and retrieve information about the user.
-- ------------------------------
overriding
procedure Verify_Access_Token (Realm : in Manager;
Assoc : in Association;
Request : in Parameters'Class;
Token : in Security.OAuth.Clients.Access_Token_Access;
Result : in out Authentication) is
pragma Unreferenced (Assoc, Request);
use type Ada.Calendar.Time;
T : constant String := Token.Get_Name;
Info : aliased Token_Info;
Now : constant Ada.Calendar.Time := Ada.Calendar.Clock;
begin
Get_Token_Info ("https://graph.facebook.com/debug_token?access_token="
& To_String (Realm.App_Access_Token)
& "&input_token=" & T,
Token_Info_Map'Access,
"/data",
Info'Unchecked_Access);
if not Info.Is_Valid then
Set_Result (Result, INVALID_SIGNATURE, "invalid access token returned");
elsif Info.Issued + TIME_SHIFT < Now then
Set_Result (Result, INVALID_SIGNATURE, "the access token issued more than 1 hour ago");
elsif Info.Expires + TIME_SHIFT < Now then
Set_Result (Result, INVALID_SIGNATURE, "the access token has expored");
elsif Length (Info.User_Id) = 0 then
Set_Result (Result, INVALID_SIGNATURE, "the access token refers to an empty user_id");
elsif Info.App_Id /= Realm.App.Get_Application_Identifier then
Set_Result (Result, INVALID_SIGNATURE,
"the access token was granted for another application");
else
Result.Identity := To_Unbounded_String ("https://graph.facebook.com/");
Append (Result.Identity, Info.User_Id);
Result.Claimed_Id := Result.Identity;
Get_Token_Info ("https://graph.facebook.com/" & To_String (Info.User_Id)
& "?access_token=" & T,
Token_Info_Map'Access,
"",
Info'Unchecked_Access);
Result.Email := Info.Email;
Result.Full_Name := Info.Name;
Result.First_Name := Info.First_Name;
Result.Last_Name := Info.Last_Name;
Result.Language := Info.Locale;
Result.Gender := Info.Gender;
Set_Result (Result, AUTHENTICATED, "authenticated");
end if;
end Verify_Access_Token;
begin
Token_Info_Map.Add_Mapping ("app_id", FIELD_APP_ID);
Token_Info_Map.Add_Mapping ("expires_at", FIELD_EXPIRES);
Token_Info_Map.Add_Mapping ("issued_at", FIELD_ISSUED_AT);
Token_Info_Map.Add_Mapping ("is_valid", FIELD_IS_VALID);
Token_Info_Map.Add_Mapping ("user_id", FIELD_USER_ID);
Token_Info_Map.Add_Mapping ("email", FIELD_EMAIL);
Token_Info_Map.Add_Mapping ("name", FIELD_NAME);
Token_Info_Map.Add_Mapping ("first_name", FIELD_FIRST_NAME);
Token_Info_Map.Add_Mapping ("last_name", FIELD_LAST_NAME);
Token_Info_Map.Add_Mapping ("locale", FIELD_LOCALE);
Token_Info_Map.Add_Mapping ("gender", FIELD_GENDER);
end Security.Auth.OAuth.Facebook;
|
src/string_strip.asm | I8087/libm | 13 | 86850 | global _string_strip
_string_strip:
push bp
mov bp, sp
mov si, [bp+4]
mov al, byte [bp+6]
call os_string_strip
pop bp
ret
|
ioq3/build/release-js-js/baseq3/ui/bg_misc.asm | RawTechnique/quake-port | 1 | 28620 | data
export bg_itemlist
align 4
LABELV bg_itemlist
byte 4 0
byte 4 0
byte 4 0
byte 4 0
byte 4 0
byte 4 0
byte 4 0
byte 4 0
byte 4 0
byte 4 0
byte 4 0
address $41
address $41
address $42
address $43
address $44
address $45
byte 4 0
byte 4 0
address $46
address $47
byte 4 5
byte 4 3
byte 4 0
address $41
address $41
address $48
address $49
address $50
byte 4 0
byte 4 0
byte 4 0
address $51
address $52
byte 4 50
byte 4 3
byte 4 0
address $41
address $41
address $53
address $49
address $54
byte 4 0
byte 4 0
byte 4 0
address $55
address $56
byte 4 100
byte 4 3
byte 4 0
address $41
address $41
address $57
address $58
address $59
address $60
byte 4 0
byte 4 0
address $61
address $62
byte 4 5
byte 4 4
byte 4 0
address $41
address $41
address $63
address $64
address $65
address $66
byte 4 0
byte 4 0
address $67
address $68
byte 4 25
byte 4 4
byte 4 0
address $41
address $41
address $69
address $70
address $71
address $72
byte 4 0
byte 4 0
address $73
address $74
byte 4 50
byte 4 4
byte 4 0
address $41
address $41
address $75
address $76
address $77
address $78
byte 4 0
byte 4 0
address $79
address $80
byte 4 100
byte 4 4
byte 4 0
address $41
address $41
address $81
address $82
address $83
byte 4 0
byte 4 0
byte 4 0
address $84
address $85
byte 4 0
byte 4 1
byte 4 1
address $41
address $41
address $86
address $82
address $87
byte 4 0
byte 4 0
byte 4 0
address $88
address $89
byte 4 10
byte 4 1
byte 4 3
address $41
address $41
address $90
address $82
address $91
byte 4 0
byte 4 0
byte 4 0
address $92
address $93
byte 4 40
byte 4 1
byte 4 2
address $41
address $41
address $94
address $82
address $95
byte 4 0
byte 4 0
byte 4 0
address $96
address $97
byte 4 10
byte 4 1
byte 4 4
address $41
address $98
address $99
address $82
address $100
byte 4 0
byte 4 0
byte 4 0
address $101
address $102
byte 4 10
byte 4 1
byte 4 5
address $41
address $41
address $103
address $82
address $104
byte 4 0
byte 4 0
byte 4 0
address $105
address $106
byte 4 100
byte 4 1
byte 4 6
address $41
address $41
address $107
address $82
address $108
byte 4 0
byte 4 0
byte 4 0
address $109
address $110
byte 4 10
byte 4 1
byte 4 7
address $41
address $41
address $111
address $82
address $112
byte 4 0
byte 4 0
byte 4 0
address $113
address $114
byte 4 50
byte 4 1
byte 4 8
address $41
address $41
address $115
address $82
address $116
byte 4 0
byte 4 0
byte 4 0
address $117
address $118
byte 4 20
byte 4 1
byte 4 9
address $41
address $41
address $119
address $82
address $120
byte 4 0
byte 4 0
byte 4 0
address $121
address $122
byte 4 0
byte 4 1
byte 4 10
address $41
address $41
address $123
address $124
address $125
byte 4 0
byte 4 0
byte 4 0
address $126
address $127
byte 4 10
byte 4 2
byte 4 3
address $41
address $41
address $128
address $124
address $129
byte 4 0
byte 4 0
byte 4 0
address $130
address $131
byte 4 50
byte 4 2
byte 4 2
address $41
address $41
address $132
address $124
address $133
byte 4 0
byte 4 0
byte 4 0
address $134
address $135
byte 4 5
byte 4 2
byte 4 4
address $41
address $41
address $136
address $124
address $137
byte 4 0
byte 4 0
byte 4 0
address $138
address $139
byte 4 30
byte 4 2
byte 4 8
address $41
address $41
address $140
address $124
address $141
byte 4 0
byte 4 0
byte 4 0
address $142
address $143
byte 4 60
byte 4 2
byte 4 6
address $41
address $41
address $144
address $124
address $145
byte 4 0
byte 4 0
byte 4 0
address $146
address $147
byte 4 5
byte 4 2
byte 4 5
address $41
address $41
address $148
address $124
address $149
byte 4 0
byte 4 0
byte 4 0
address $150
address $151
byte 4 10
byte 4 2
byte 4 7
address $41
address $41
address $152
address $124
address $153
byte 4 0
byte 4 0
byte 4 0
address $154
address $155
byte 4 15
byte 4 2
byte 4 9
address $41
address $41
address $156
address $157
address $158
byte 4 0
byte 4 0
byte 4 0
address $159
address $160
byte 4 60
byte 4 6
byte 4 1
address $41
address $41
address $161
address $157
address $162
address $163
byte 4 0
byte 4 0
address $164
address $165
byte 4 60
byte 4 6
byte 4 2
address $41
address $166
address $167
address $168
address $169
address $170
byte 4 0
byte 4 0
address $171
address $172
byte 4 30
byte 4 5
byte 4 1
address $41
address $173
address $174
address $175
address $176
address $177
byte 4 0
byte 4 0
address $178
address $179
byte 4 30
byte 4 5
byte 4 2
address $41
address $180
address $181
address $182
address $183
address $184
byte 4 0
byte 4 0
address $185
address $186
byte 4 30
byte 4 5
byte 4 3
address $41
address $41
address $187
address $188
address $189
address $190
byte 4 0
byte 4 0
address $191
address $192
byte 4 30
byte 4 5
byte 4 4
address $41
address $41
address $193
address $194
address $195
address $196
byte 4 0
byte 4 0
address $197
address $198
byte 4 30
byte 4 5
byte 4 5
address $41
address $199
address $200
address $201
address $202
address $203
byte 4 0
byte 4 0
address $204
address $205
byte 4 60
byte 4 5
byte 4 6
address $41
address $201
address $206
byte 4 0
address $207
byte 4 0
byte 4 0
byte 4 0
address $208
address $209
byte 4 0
byte 4 8
byte 4 7
address $41
address $41
address $210
byte 4 0
address $211
byte 4 0
byte 4 0
byte 4 0
address $212
address $213
byte 4 0
byte 4 8
byte 4 8
address $41
address $41
byte 4 0
skip 48
export bg_numItems
align 4
LABELV bg_numItems
byte 4 36
export BG_FindItemForPowerup
code
proc BG_FindItemForPowerup 8 0
ADDRFP4 0
ADDRFP4 0
INDIRI4
ASGNI4
ADDRLP4 0
CNSTI4 0
ASGNI4
ADDRGP4 $218
JUMPV
LABELV $215
ADDRLP4 4
CNSTI4 52
ADDRLP4 0
INDIRI4
MULI4
ASGNI4
ADDRLP4 4
INDIRI4
ADDRGP4 bg_itemlist+36
ADDP4
INDIRI4
CNSTI4 5
EQI4 $226
ADDRLP4 4
INDIRI4
ADDRGP4 bg_itemlist+36
ADDP4
INDIRI4
CNSTI4 8
EQI4 $226
ADDRLP4 4
INDIRI4
ADDRGP4 bg_itemlist+36
ADDP4
INDIRI4
CNSTI4 7
NEI4 $219
LABELV $226
CNSTI4 52
ADDRLP4 0
INDIRI4
MULI4
ADDRGP4 bg_itemlist+40
ADDP4
INDIRI4
ADDRFP4 0
INDIRI4
NEI4 $219
CNSTI4 52
ADDRLP4 0
INDIRI4
MULI4
ADDRGP4 bg_itemlist
ADDP4
RETP4
ADDRGP4 $214
JUMPV
LABELV $219
LABELV $216
ADDRLP4 0
ADDRLP4 0
INDIRI4
CNSTI4 1
ADDI4
ASGNI4
LABELV $218
ADDRLP4 0
INDIRI4
ADDRGP4 bg_numItems
INDIRI4
LTI4 $215
CNSTP4 0
RETP4
LABELV $214
endproc BG_FindItemForPowerup 8 0
export BG_FindItemForHoldable
proc BG_FindItemForHoldable 8 8
ADDRFP4 0
ADDRFP4 0
INDIRI4
ASGNI4
ADDRLP4 0
CNSTI4 0
ASGNI4
ADDRGP4 $231
JUMPV
LABELV $228
ADDRLP4 4
CNSTI4 52
ADDRLP4 0
INDIRI4
MULI4
ASGNI4
ADDRLP4 4
INDIRI4
ADDRGP4 bg_itemlist+36
ADDP4
INDIRI4
CNSTI4 6
NEI4 $232
ADDRLP4 4
INDIRI4
ADDRGP4 bg_itemlist+40
ADDP4
INDIRI4
ADDRFP4 0
INDIRI4
NEI4 $232
CNSTI4 52
ADDRLP4 0
INDIRI4
MULI4
ADDRGP4 bg_itemlist
ADDP4
RETP4
ADDRGP4 $227
JUMPV
LABELV $232
LABELV $229
ADDRLP4 0
ADDRLP4 0
INDIRI4
CNSTI4 1
ADDI4
ASGNI4
LABELV $231
ADDRLP4 0
INDIRI4
ADDRGP4 bg_numItems
INDIRI4
LTI4 $228
CNSTI4 1
ARGI4
ADDRGP4 $236
ARGP4
ADDRGP4 Com_Error
CALLV
pop
CNSTP4 0
RETP4
LABELV $227
endproc BG_FindItemForHoldable 8 8
export BG_FindItemForWeapon
proc BG_FindItemForWeapon 8 12
ADDRFP4 0
ADDRFP4 0
INDIRI4
ASGNI4
ADDRLP4 0
ADDRGP4 bg_itemlist+52
ASGNP4
ADDRGP4 $241
JUMPV
LABELV $238
ADDRLP4 0
INDIRP4
CNSTI4 36
ADDP4
INDIRI4
CNSTI4 1
NEI4 $243
ADDRLP4 0
INDIRP4
CNSTI4 40
ADDP4
INDIRI4
ADDRFP4 0
INDIRI4
NEI4 $243
ADDRLP4 0
INDIRP4
RETP4
ADDRGP4 $237
JUMPV
LABELV $243
LABELV $239
ADDRLP4 0
ADDRLP4 0
INDIRP4
CNSTI4 52
ADDP4
ASGNP4
LABELV $241
ADDRLP4 0
INDIRP4
INDIRP4
CVPU4 4
CNSTU4 0
NEU4 $238
CNSTI4 1
ARGI4
ADDRGP4 $245
ARGP4
ADDRFP4 0
INDIRI4
ARGI4
ADDRGP4 Com_Error
CALLV
pop
CNSTP4 0
RETP4
LABELV $237
endproc BG_FindItemForWeapon 8 12
export BG_FindItem
proc BG_FindItem 8 8
ADDRFP4 0
ADDRFP4 0
INDIRP4
ASGNP4
ADDRLP4 0
ADDRGP4 bg_itemlist+52
ASGNP4
ADDRGP4 $250
JUMPV
LABELV $247
ADDRLP4 0
INDIRP4
CNSTI4 28
ADDP4
INDIRP4
ARGP4
ADDRFP4 0
INDIRP4
ARGP4
ADDRLP4 4
ADDRGP4 Q_stricmp
CALLI4
ASGNI4
ADDRLP4 4
INDIRI4
CNSTI4 0
NEI4 $252
ADDRLP4 0
INDIRP4
RETP4
ADDRGP4 $246
JUMPV
LABELV $252
LABELV $248
ADDRLP4 0
ADDRLP4 0
INDIRP4
CNSTI4 52
ADDP4
ASGNP4
LABELV $250
ADDRLP4 0
INDIRP4
INDIRP4
CVPU4 4
CNSTU4 0
NEU4 $247
CNSTP4 0
RETP4
LABELV $246
endproc BG_FindItem 8 8
export BG_PlayerTouchesItem
proc BG_PlayerTouchesItem 36 12
ADDRFP4 0
ADDRFP4 0
INDIRP4
ASGNP4
ADDRFP4 4
INDIRP4
CNSTI4 12
ADDP4
ARGP4
ADDRFP4 8
INDIRI4
ARGI4
ADDRLP4 0
ARGP4
ADDRGP4 BG_EvaluateTrajectory
CALLV
pop
ADDRLP4 16
ADDRFP4 0
INDIRP4
CNSTI4 20
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
SUBF4
ASGNF4
ADDRLP4 16
INDIRF4
CNSTF4 1110441984
GTF4 $265
ADDRLP4 16
INDIRF4
CNSTF4 3259498496
LTF4 $265
ADDRLP4 20
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRF4
ASGNF4
ADDRLP4 24
CNSTF4 1108344832
ASGNF4
ADDRLP4 20
INDIRF4
ADDRLP4 0+4
INDIRF4
SUBF4
ADDRLP4 24
INDIRF4
GTF4 $265
ADDRLP4 28
CNSTF4 3255828480
ASGNF4
ADDRLP4 20
INDIRF4
ADDRLP4 0+4
INDIRF4
SUBF4
ADDRLP4 28
INDIRF4
LTF4 $265
ADDRLP4 32
ADDRFP4 0
INDIRP4
CNSTI4 28
ADDP4
INDIRF4
ASGNF4
ADDRLP4 32
INDIRF4
ADDRLP4 0+8
INDIRF4
SUBF4
ADDRLP4 24
INDIRF4
GTF4 $265
ADDRLP4 32
INDIRF4
ADDRLP4 0+8
INDIRF4
SUBF4
ADDRLP4 28
INDIRF4
GEF4 $255
LABELV $265
CNSTI4 0
RETI4
ADDRGP4 $254
JUMPV
LABELV $255
CNSTI4 1
RETI4
LABELV $254
endproc BG_PlayerTouchesItem 36 12
export BG_CanItemBeGrabbed
proc BG_CanItemBeGrabbed 32 8
ADDRFP4 4
ADDRFP4 4
INDIRP4
ASGNP4
ADDRLP4 4
ADDRFP4 4
INDIRP4
CNSTI4 160
ADDP4
INDIRI4
ASGNI4
ADDRLP4 4
INDIRI4
CNSTI4 1
LTI4 $269
ADDRLP4 4
INDIRI4
ADDRGP4 bg_numItems
INDIRI4
LTI4 $267
LABELV $269
CNSTI4 1
ARGI4
ADDRGP4 $270
ARGP4
ADDRGP4 Com_Error
CALLV
pop
LABELV $267
ADDRLP4 0
CNSTI4 52
ADDRFP4 4
INDIRP4
CNSTI4 160
ADDP4
INDIRI4
MULI4
ADDRGP4 bg_itemlist
ADDP4
ASGNP4
ADDRLP4 8
ADDRLP4 0
INDIRP4
CNSTI4 36
ADDP4
INDIRI4
ASGNI4
ADDRLP4 8
INDIRI4
CNSTI4 0
LTI4 $272
ADDRLP4 8
INDIRI4
CNSTI4 8
GTI4 $272
ADDRLP4 8
INDIRI4
CNSTI4 2
LSHI4
ADDRGP4 $312
ADDP4
INDIRP4
JUMPV
lit
align 4
LABELV $312
address $310
address $274
address $275
address $278
address $281
address $289
address $307
address $272
address $290
code
LABELV $274
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $275
ADDRLP4 0
INDIRP4
CNSTI4 40
ADDP4
INDIRI4
CNSTI4 2
LSHI4
ADDRFP4 8
INDIRP4
CNSTI4 376
ADDP4
ADDP4
INDIRI4
CNSTI4 200
LTI4 $276
CNSTI4 0
RETI4
ADDRGP4 $266
JUMPV
LABELV $276
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $278
ADDRLP4 16
ADDRFP4 8
INDIRP4
ASGNP4
ADDRLP4 16
INDIRP4
CNSTI4 196
ADDP4
INDIRI4
ADDRLP4 16
INDIRP4
CNSTI4 208
ADDP4
INDIRI4
CNSTI4 1
LSHI4
LTI4 $279
CNSTI4 0
RETI4
ADDRGP4 $266
JUMPV
LABELV $279
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $281
ADDRLP4 20
ADDRLP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRI4
ASGNI4
ADDRLP4 20
INDIRI4
CNSTI4 5
EQI4 $284
ADDRLP4 20
INDIRI4
CNSTI4 100
NEI4 $282
LABELV $284
ADDRLP4 24
ADDRFP4 8
INDIRP4
ASGNP4
ADDRLP4 24
INDIRP4
CNSTI4 184
ADDP4
INDIRI4
ADDRLP4 24
INDIRP4
CNSTI4 208
ADDP4
INDIRI4
CNSTI4 1
LSHI4
LTI4 $285
CNSTI4 0
RETI4
ADDRGP4 $266
JUMPV
LABELV $285
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $282
ADDRLP4 24
ADDRFP4 8
INDIRP4
ASGNP4
ADDRLP4 24
INDIRP4
CNSTI4 184
ADDP4
INDIRI4
ADDRLP4 24
INDIRP4
CNSTI4 208
ADDP4
INDIRI4
LTI4 $287
CNSTI4 0
RETI4
ADDRGP4 $266
JUMPV
LABELV $287
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $289
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $290
ADDRFP4 0
INDIRI4
CNSTI4 4
NEI4 $291
ADDRFP4 8
INDIRP4
CNSTI4 260
ADDP4
INDIRI4
CNSTI4 1
NEI4 $293
ADDRLP4 28
ADDRLP4 0
INDIRP4
CNSTI4 40
ADDP4
INDIRI4
ASGNI4
ADDRLP4 28
INDIRI4
CNSTI4 8
EQI4 $298
ADDRLP4 28
INDIRI4
CNSTI4 7
NEI4 $299
ADDRFP4 4
INDIRP4
CNSTI4 164
ADDP4
INDIRI4
CNSTI4 0
NEI4 $298
LABELV $299
ADDRLP4 0
INDIRP4
CNSTI4 40
ADDP4
INDIRI4
CNSTI4 7
NEI4 $294
ADDRFP4 8
INDIRP4
CNSTI4 344
ADDP4
INDIRI4
CNSTI4 0
EQI4 $294
LABELV $298
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $293
ADDRFP4 8
INDIRP4
CNSTI4 260
ADDP4
INDIRI4
CNSTI4 2
NEI4 $300
ADDRLP4 28
ADDRLP4 0
INDIRP4
CNSTI4 40
ADDP4
INDIRI4
ASGNI4
ADDRLP4 28
INDIRI4
CNSTI4 7
EQI4 $305
ADDRLP4 28
INDIRI4
CNSTI4 8
NEI4 $306
ADDRFP4 4
INDIRP4
CNSTI4 164
ADDP4
INDIRI4
CNSTI4 0
NEI4 $305
LABELV $306
ADDRLP4 0
INDIRP4
CNSTI4 40
ADDP4
INDIRI4
CNSTI4 8
NEI4 $302
ADDRFP4 8
INDIRP4
CNSTI4 340
ADDP4
INDIRI4
CNSTI4 0
EQI4 $302
LABELV $305
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $302
LABELV $300
LABELV $294
LABELV $291
CNSTI4 0
RETI4
ADDRGP4 $266
JUMPV
LABELV $307
ADDRFP4 8
INDIRP4
CNSTI4 188
ADDP4
INDIRI4
CNSTI4 0
EQI4 $308
CNSTI4 0
RETI4
ADDRGP4 $266
JUMPV
LABELV $308
CNSTI4 1
RETI4
ADDRGP4 $266
JUMPV
LABELV $310
CNSTI4 1
ARGI4
ADDRGP4 $311
ARGP4
ADDRGP4 Com_Error
CALLV
pop
LABELV $272
CNSTI4 0
RETI4
LABELV $266
endproc BG_CanItemBeGrabbed 32 8
export BG_EvaluateTrajectory
proc BG_EvaluateTrajectory 84 12
ADDRFP4 0
ADDRFP4 0
INDIRP4
ASGNP4
ADDRLP4 8
ADDRFP4 0
INDIRP4
INDIRI4
ASGNI4
ADDRLP4 8
INDIRI4
CNSTI4 0
LTI4 $314
ADDRLP4 8
INDIRI4
CNSTI4 5
GTI4 $314
ADDRLP4 8
INDIRI4
CNSTI4 2
LSHI4
ADDRGP4 $327
ADDP4
INDIRP4
JUMPV
lit
align 4
LABELV $327
address $317
address $317
address $318
address $320
address $319
address $325
code
LABELV $317
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 12
ADDP4
INDIRB
ASGNB 12
ADDRGP4 $315
JUMPV
LABELV $318
ADDRLP4 0
CNSTF4 981668463
ADDRFP4 4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
SUBI4
CVIF4 4
MULF4
ASGNF4
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 12
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 4
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 16
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 28
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 8
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 20
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRGP4 $315
JUMPV
LABELV $319
ADDRLP4 0
ADDRFP4 4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
SUBI4
CVIF4 4
ADDRFP4 0
INDIRP4
CNSTI4 8
ADDP4
INDIRI4
CVIF4 4
DIVF4
ASGNF4
CNSTF4 1073741824
CNSTF4 1078530011
ADDRLP4 0
INDIRF4
MULF4
MULF4
ARGF4
ADDRLP4 32
ADDRGP4 qk_sin
CALLF4
ASGNF4
ADDRLP4 4
ADDRLP4 32
INDIRF4
ASGNF4
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 12
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRF4
ADDRLP4 4
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 4
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 16
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 28
ADDP4
INDIRF4
ADDRLP4 4
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 8
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 20
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRF4
ADDRLP4 4
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRGP4 $315
JUMPV
LABELV $320
ADDRFP4 4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 8
ADDP4
INDIRI4
ADDI4
LEI4 $321
ADDRFP4 4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 8
ADDP4
INDIRI4
ADDI4
ASGNI4
LABELV $321
ADDRLP4 0
CNSTF4 981668463
ADDRFP4 4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
SUBI4
CVIF4 4
MULF4
ASGNF4
ADDRLP4 0
INDIRF4
CNSTF4 0
GEF4 $323
ADDRLP4 0
CNSTF4 0
ASGNF4
LABELV $323
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 12
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 4
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 16
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 28
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 8
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 20
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRGP4 $315
JUMPV
LABELV $325
ADDRLP4 0
CNSTF4 981668463
ADDRFP4 4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
SUBI4
CVIF4 4
MULF4
ASGNF4
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 12
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 4
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 16
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 28
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 8
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 20
ADDP4
INDIRF4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ADDF4
ASGNF4
ADDRLP4 76
ADDRFP4 8
INDIRP4
CNSTI4 8
ADDP4
ASGNP4
ADDRLP4 80
ADDRLP4 0
INDIRF4
ASGNF4
ADDRLP4 76
INDIRP4
ADDRLP4 76
INDIRP4
INDIRF4
CNSTF4 1137180672
ADDRLP4 80
INDIRF4
MULF4
ADDRLP4 80
INDIRF4
MULF4
SUBF4
ASGNF4
ADDRGP4 $315
JUMPV
LABELV $314
CNSTI4 1
ARGI4
ADDRGP4 $326
ARGP4
ADDRFP4 0
INDIRP4
INDIRI4
ARGI4
ADDRGP4 Com_Error
CALLV
pop
LABELV $315
LABELV $313
endproc BG_EvaluateTrajectory 84 12
export BG_EvaluateTrajectoryDelta
proc BG_EvaluateTrajectoryDelta 44 12
ADDRLP4 8
ADDRFP4 0
INDIRP4
INDIRI4
ASGNI4
ADDRLP4 8
INDIRI4
CNSTI4 0
LTI4 $329
ADDRLP4 8
INDIRI4
CNSTI4 5
GTI4 $329
ADDRLP4 8
INDIRI4
CNSTI4 2
LSHI4
ADDRGP4 $340
ADDP4
INDIRP4
JUMPV
lit
align 4
LABELV $340
address $332
address $332
address $333
address $335
address $334
address $338
code
LABELV $332
ADDRLP4 16
ADDRFP4 8
INDIRP4
ASGNP4
ADDRLP4 20
CNSTF4 0
ASGNF4
ADDRLP4 16
INDIRP4
CNSTI4 8
ADDP4
ADDRLP4 20
INDIRF4
ASGNF4
ADDRLP4 16
INDIRP4
CNSTI4 4
ADDP4
ADDRLP4 20
INDIRF4
ASGNF4
ADDRLP4 16
INDIRP4
ADDRLP4 20
INDIRF4
ASGNF4
ADDRGP4 $330
JUMPV
LABELV $333
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRB
ASGNB 12
ADDRGP4 $330
JUMPV
LABELV $334
ADDRLP4 24
ADDRFP4 0
INDIRP4
ASGNP4
ADDRLP4 4
ADDRFP4 4
INDIRI4
ADDRLP4 24
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
SUBI4
CVIF4 4
ADDRLP4 24
INDIRP4
CNSTI4 8
ADDP4
INDIRI4
CVIF4 4
DIVF4
ASGNF4
CNSTF4 1073741824
CNSTF4 1078530011
ADDRLP4 4
INDIRF4
MULF4
MULF4
ARGF4
ADDRLP4 28
ADDRGP4 qk_cos
CALLF4
ASGNF4
ADDRLP4 0
ADDRLP4 28
INDIRF4
ASGNF4
ADDRLP4 0
CNSTF4 1056964608
ADDRLP4 0
INDIRF4
MULF4
ASGNF4
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 4
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 28
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ASGNF4
ADDRFP4 8
INDIRP4
CNSTI4 8
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRF4
ADDRLP4 0
INDIRF4
MULF4
ASGNF4
ADDRGP4 $330
JUMPV
LABELV $335
ADDRLP4 32
ADDRFP4 0
INDIRP4
ASGNP4
ADDRFP4 4
INDIRI4
ADDRLP4 32
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
ADDRLP4 32
INDIRP4
CNSTI4 8
ADDP4
INDIRI4
ADDI4
LEI4 $336
ADDRLP4 36
ADDRFP4 8
INDIRP4
ASGNP4
ADDRLP4 40
CNSTF4 0
ASGNF4
ADDRLP4 36
INDIRP4
CNSTI4 8
ADDP4
ADDRLP4 40
INDIRF4
ASGNF4
ADDRLP4 36
INDIRP4
CNSTI4 4
ADDP4
ADDRLP4 40
INDIRF4
ASGNF4
ADDRLP4 36
INDIRP4
ADDRLP4 40
INDIRF4
ASGNF4
ADDRGP4 $328
JUMPV
LABELV $336
ADDRFP4 8
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 24
ADDP4
INDIRB
ASGNB 12
ADDRGP4 $330
JUMPV
LABELV $338
ADDRLP4 36
ADDRFP4 0
INDIRP4
ASGNP4
ADDRLP4 4
CNSTF4 981668463
ADDRFP4 4
INDIRI4
ADDRLP4 36
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
SUBI4
CVIF4 4
MULF4
ASGNF4
ADDRFP4 8
INDIRP4
ADDRLP4 36
INDIRP4
CNSTI4 24
ADDP4
INDIRB
ASGNB 12
ADDRLP4 40
ADDRFP4 8
INDIRP4
CNSTI4 8
ADDP4
ASGNP4
ADDRLP4 40
INDIRP4
ADDRLP4 40
INDIRP4
INDIRF4
CNSTF4 1145569280
ADDRLP4 4
INDIRF4
MULF4
SUBF4
ASGNF4
ADDRGP4 $330
JUMPV
LABELV $329
CNSTI4 1
ARGI4
ADDRGP4 $339
ARGP4
ADDRFP4 0
INDIRP4
INDIRI4
ARGI4
ADDRGP4 Com_Error
CALLV
pop
LABELV $330
LABELV $328
endproc BG_EvaluateTrajectoryDelta 44 12
data
export eventnames
align 4
LABELV eventnames
address $341
address $342
address $343
address $344
address $345
address $346
address $347
address $348
address $349
address $350
address $351
address $352
address $353
address $354
address $355
address $356
address $357
address $358
address $359
address $360
address $361
address $362
address $363
address $364
address $365
address $366
address $367
address $368
address $369
address $370
address $371
address $372
address $373
address $374
address $375
address $376
address $377
address $378
address $379
address $380
address $381
address $382
address $383
address $384
address $385
address $386
address $387
address $388
address $389
address $390
address $391
address $392
address $393
address $394
address $395
address $396
address $397
address $398
address $399
address $400
address $401
address $402
address $403
address $404
address $405
address $406
address $407
address $408
address $409
address $410
address $411
address $412
address $413
address $414
address $415
address $416
address $417
address $418
address $419
address $420
address $421
address $422
address $423
export BG_AddPredictableEventToPlayerstate
code
proc BG_AddPredictableEventToPlayerstate 12 0
ADDRFP4 8
ADDRFP4 8
INDIRP4
ASGNP4
ADDRFP4 8
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
CNSTI4 1
BANDI4
CNSTI4 2
LSHI4
ADDRFP4 8
INDIRP4
CNSTI4 112
ADDP4
ADDP4
ADDRFP4 0
INDIRI4
ASGNI4
ADDRFP4 8
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
CNSTI4 1
BANDI4
CNSTI4 2
LSHI4
ADDRFP4 8
INDIRP4
CNSTI4 120
ADDP4
ADDP4
ADDRFP4 4
INDIRI4
ASGNI4
ADDRLP4 8
ADDRFP4 8
INDIRP4
CNSTI4 108
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRI4
CNSTI4 1
ADDI4
ASGNI4
LABELV $424
endproc BG_AddPredictableEventToPlayerstate 12 0
export BG_TouchJumpPad
proc BG_TouchJumpPad 28 12
ADDRFP4 0
ADDRFP4 0
INDIRP4
ASGNP4
ADDRFP4 4
ADDRFP4 4
INDIRP4
ASGNP4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
CNSTI4 0
EQI4 $426
ADDRGP4 $425
JUMPV
LABELV $426
ADDRFP4 0
INDIRP4
CNSTI4 336
ADDP4
INDIRI4
CNSTI4 0
EQI4 $428
ADDRGP4 $425
JUMPV
LABELV $428
ADDRFP4 0
INDIRP4
CNSTI4 448
ADDP4
INDIRI4
ADDRFP4 4
INDIRP4
INDIRI4
EQI4 $430
ADDRFP4 4
INDIRP4
CNSTI4 104
ADDP4
ARGP4
ADDRLP4 0
ARGP4
ADDRGP4 vectoangles
CALLV
pop
ADDRLP4 0
INDIRF4
ARGF4
ADDRLP4 20
ADDRGP4 AngleNormalize180
CALLF4
ASGNF4
ADDRLP4 20
INDIRF4
ARGF4
ADDRLP4 24
ADDRGP4 qk_fabs
CALLF4
ASGNF4
ADDRLP4 12
ADDRLP4 24
INDIRF4
ASGNF4
ADDRLP4 12
INDIRF4
CNSTF4 1110704128
GEF4 $432
ADDRLP4 16
CNSTI4 0
ASGNI4
ADDRGP4 $433
JUMPV
LABELV $432
ADDRLP4 16
CNSTI4 1
ASGNI4
LABELV $433
CNSTI4 13
ARGI4
ADDRLP4 16
INDIRI4
ARGI4
ADDRFP4 0
INDIRP4
ARGP4
ADDRGP4 BG_AddPredictableEventToPlayerstate
CALLV
pop
LABELV $430
ADDRFP4 0
INDIRP4
CNSTI4 448
ADDP4
ADDRFP4 4
INDIRP4
INDIRI4
ASGNI4
ADDRFP4 0
INDIRP4
CNSTI4 460
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 456
ADDP4
INDIRI4
ASGNI4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
ADDRFP4 4
INDIRP4
CNSTI4 104
ADDP4
INDIRB
ASGNB 12
LABELV $425
endproc BG_TouchJumpPad 28 12
export BG_PlayerStateToEntityState
proc BG_PlayerStateToEntityState 32 0
ADDRFP4 0
ADDRFP4 0
INDIRP4
ASGNP4
ADDRFP4 4
ADDRFP4 4
INDIRP4
ASGNP4
ADDRLP4 4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
ASGNI4
ADDRLP4 4
INDIRI4
CNSTI4 5
EQI4 $437
ADDRLP4 4
INDIRI4
CNSTI4 2
NEI4 $435
LABELV $437
ADDRFP4 4
INDIRP4
CNSTI4 4
ADDP4
CNSTI4 10
ASGNI4
ADDRGP4 $436
JUMPV
LABELV $435
ADDRFP4 0
INDIRP4
CNSTI4 184
ADDP4
INDIRI4
CNSTI4 -40
GTI4 $438
ADDRFP4 4
INDIRP4
CNSTI4 4
ADDP4
CNSTI4 10
ASGNI4
ADDRGP4 $439
JUMPV
LABELV $438
ADDRFP4 4
INDIRP4
CNSTI4 4
ADDP4
CNSTI4 1
ASGNI4
LABELV $439
LABELV $436
ADDRFP4 4
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 140
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 12
ADDP4
CNSTI4 1
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 24
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 20
ADDP4
INDIRB
ASGNB 12
ADDRFP4 8
INDIRI4
CNSTI4 0
EQI4 $440
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 24
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 12
ADDRFP4 4
INDIRP4
CNSTI4 28
ADDP4
ASGNP4
ADDRLP4 12
INDIRP4
ADDRLP4 12
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 16
ADDRFP4 4
INDIRP4
CNSTI4 32
ADDP4
ASGNP4
ADDRLP4 16
INDIRP4
ADDRLP4 16
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
LABELV $440
ADDRFP4 4
INDIRP4
CNSTI4 36
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRB
ASGNB 12
ADDRFP4 4
INDIRP4
CNSTI4 48
ADDP4
CNSTI4 1
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 60
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 152
ADDP4
INDIRB
ASGNB 12
ADDRFP4 8
INDIRI4
CNSTI4 0
EQI4 $442
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 60
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 12
ADDRFP4 4
INDIRP4
CNSTI4 64
ADDP4
ASGNP4
ADDRLP4 12
INDIRP4
ADDRLP4 12
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 16
ADDRFP4 4
INDIRP4
CNSTI4 68
ADDP4
ASGNP4
ADDRLP4 16
INDIRP4
ADDRLP4 16
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
LABELV $442
ADDRFP4 4
INDIRP4
CNSTI4 132
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 88
ADDP4
INDIRI4
CVIF4 4
ASGNF4
ADDRFP4 4
INDIRP4
CNSTI4 196
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 76
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 200
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 84
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 168
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 140
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 8
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 104
ADDP4
INDIRI4
ASGNI4
ADDRFP4 0
INDIRP4
CNSTI4 184
ADDP4
INDIRI4
CNSTI4 0
GTI4 $444
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 8
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRI4
CNSTI4 1
BORI4
ASGNI4
ADDRGP4 $445
JUMPV
LABELV $444
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 8
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRI4
CNSTI4 -2
BANDI4
ASGNI4
LABELV $445
ADDRFP4 0
INDIRP4
CNSTI4 128
ADDP4
INDIRI4
CNSTI4 0
EQI4 $446
ADDRFP4 4
INDIRP4
CNSTI4 180
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 128
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 184
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 132
ADDP4
INDIRI4
ASGNI4
ADDRGP4 $447
JUMPV
LABELV $446
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
GEI4 $448
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
CNSTI4 2
SUBI4
GEI4 $450
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
CNSTI4 2
SUBI4
ASGNI4
LABELV $450
ADDRLP4 24
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
ASGNP4
ADDRLP4 12
ADDRLP4 24
INDIRP4
INDIRI4
CNSTI4 1
BANDI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 180
ADDP4
ADDRLP4 12
INDIRI4
CNSTI4 2
LSHI4
ADDRFP4 0
INDIRP4
CNSTI4 112
ADDP4
ADDP4
INDIRI4
ADDRLP4 24
INDIRP4
INDIRI4
CNSTI4 3
BANDI4
CNSTI4 8
LSHI4
BORI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 184
ADDP4
ADDRLP4 12
INDIRI4
CNSTI4 2
LSHI4
ADDRFP4 0
INDIRP4
CNSTI4 120
ADDP4
ADDP4
INDIRI4
ASGNI4
ADDRLP4 28
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
ASGNP4
ADDRLP4 28
INDIRP4
ADDRLP4 28
INDIRP4
INDIRI4
CNSTI4 1
ADDI4
ASGNI4
LABELV $448
LABELV $447
ADDRFP4 4
INDIRP4
CNSTI4 192
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 144
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 148
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 68
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 188
ADDP4
CNSTI4 0
ASGNI4
ADDRLP4 0
CNSTI4 0
ASGNI4
LABELV $452
ADDRLP4 0
INDIRI4
CNSTI4 2
LSHI4
ADDRFP4 0
INDIRP4
CNSTI4 312
ADDP4
ADDP4
INDIRI4
CNSTI4 0
EQI4 $456
ADDRLP4 12
ADDRFP4 4
INDIRP4
CNSTI4 188
ADDP4
ASGNP4
ADDRLP4 12
INDIRP4
ADDRLP4 12
INDIRP4
INDIRI4
CNSTI4 1
ADDRLP4 0
INDIRI4
LSHI4
BORI4
ASGNI4
LABELV $456
LABELV $453
ADDRLP4 0
ADDRLP4 0
INDIRI4
CNSTI4 1
ADDI4
ASGNI4
ADDRLP4 0
INDIRI4
CNSTI4 16
LTI4 $452
ADDRFP4 4
INDIRP4
CNSTI4 156
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 444
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 204
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 440
ADDP4
INDIRI4
ASGNI4
LABELV $434
endproc BG_PlayerStateToEntityState 32 0
export BG_PlayerStateToEntityStateExtraPolate
proc BG_PlayerStateToEntityStateExtraPolate 32 0
ADDRFP4 0
ADDRFP4 0
INDIRP4
ASGNP4
ADDRFP4 4
ADDRFP4 4
INDIRP4
ASGNP4
ADDRLP4 4
ADDRFP4 0
INDIRP4
CNSTI4 4
ADDP4
INDIRI4
ASGNI4
ADDRLP4 4
INDIRI4
CNSTI4 5
EQI4 $461
ADDRLP4 4
INDIRI4
CNSTI4 2
NEI4 $459
LABELV $461
ADDRFP4 4
INDIRP4
CNSTI4 4
ADDP4
CNSTI4 10
ASGNI4
ADDRGP4 $460
JUMPV
LABELV $459
ADDRFP4 0
INDIRP4
CNSTI4 184
ADDP4
INDIRI4
CNSTI4 -40
GTI4 $462
ADDRFP4 4
INDIRP4
CNSTI4 4
ADDP4
CNSTI4 10
ASGNI4
ADDRGP4 $463
JUMPV
LABELV $462
ADDRFP4 4
INDIRP4
CNSTI4 4
ADDP4
CNSTI4 1
ASGNI4
LABELV $463
LABELV $460
ADDRFP4 4
INDIRP4
ADDRFP4 0
INDIRP4
CNSTI4 140
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 12
ADDP4
CNSTI4 3
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 24
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 20
ADDP4
INDIRB
ASGNB 12
ADDRFP4 12
INDIRI4
CNSTI4 0
EQI4 $464
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 24
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 12
ADDRFP4 4
INDIRP4
CNSTI4 28
ADDP4
ASGNP4
ADDRLP4 12
INDIRP4
ADDRLP4 12
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 16
ADDRFP4 4
INDIRP4
CNSTI4 32
ADDP4
ASGNP4
ADDRLP4 16
INDIRP4
ADDRLP4 16
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
LABELV $464
ADDRFP4 4
INDIRP4
CNSTI4 36
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 32
ADDP4
INDIRB
ASGNB 12
ADDRFP4 4
INDIRP4
CNSTI4 16
ADDP4
ADDRFP4 8
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 20
ADDP4
CNSTI4 50
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 48
ADDP4
CNSTI4 1
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 60
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 152
ADDP4
INDIRB
ASGNB 12
ADDRFP4 12
INDIRI4
CNSTI4 0
EQI4 $466
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 60
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 12
ADDRFP4 4
INDIRP4
CNSTI4 64
ADDP4
ASGNP4
ADDRLP4 12
INDIRP4
ADDRLP4 12
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
ADDRLP4 16
ADDRFP4 4
INDIRP4
CNSTI4 68
ADDP4
ASGNP4
ADDRLP4 16
INDIRP4
ADDRLP4 16
INDIRP4
INDIRF4
CVFI4 4
CVIF4 4
ASGNF4
LABELV $466
ADDRFP4 4
INDIRP4
CNSTI4 132
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 88
ADDP4
INDIRI4
CVIF4 4
ASGNF4
ADDRFP4 4
INDIRP4
CNSTI4 196
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 76
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 200
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 84
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 168
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 140
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 8
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 104
ADDP4
INDIRI4
ASGNI4
ADDRFP4 0
INDIRP4
CNSTI4 184
ADDP4
INDIRI4
CNSTI4 0
GTI4 $468
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 8
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRI4
CNSTI4 1
BORI4
ASGNI4
ADDRGP4 $469
JUMPV
LABELV $468
ADDRLP4 8
ADDRFP4 4
INDIRP4
CNSTI4 8
ADDP4
ASGNP4
ADDRLP4 8
INDIRP4
ADDRLP4 8
INDIRP4
INDIRI4
CNSTI4 -2
BANDI4
ASGNI4
LABELV $469
ADDRFP4 0
INDIRP4
CNSTI4 128
ADDP4
INDIRI4
CNSTI4 0
EQI4 $470
ADDRFP4 4
INDIRP4
CNSTI4 180
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 128
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 184
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 132
ADDP4
INDIRI4
ASGNI4
ADDRGP4 $471
JUMPV
LABELV $470
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
GEI4 $472
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
INDIRI4
ADDRFP4 0
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
CNSTI4 2
SUBI4
GEI4 $474
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 108
ADDP4
INDIRI4
CNSTI4 2
SUBI4
ASGNI4
LABELV $474
ADDRLP4 24
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
ASGNP4
ADDRLP4 12
ADDRLP4 24
INDIRP4
INDIRI4
CNSTI4 1
BANDI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 180
ADDP4
ADDRLP4 12
INDIRI4
CNSTI4 2
LSHI4
ADDRFP4 0
INDIRP4
CNSTI4 112
ADDP4
ADDP4
INDIRI4
ADDRLP4 24
INDIRP4
INDIRI4
CNSTI4 3
BANDI4
CNSTI4 8
LSHI4
BORI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 184
ADDP4
ADDRLP4 12
INDIRI4
CNSTI4 2
LSHI4
ADDRFP4 0
INDIRP4
CNSTI4 120
ADDP4
ADDP4
INDIRI4
ASGNI4
ADDRLP4 28
ADDRFP4 0
INDIRP4
CNSTI4 464
ADDP4
ASGNP4
ADDRLP4 28
INDIRP4
ADDRLP4 28
INDIRP4
INDIRI4
CNSTI4 1
ADDI4
ASGNI4
LABELV $472
LABELV $471
ADDRFP4 4
INDIRP4
CNSTI4 192
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 144
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 148
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 68
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 188
ADDP4
CNSTI4 0
ASGNI4
ADDRLP4 0
CNSTI4 0
ASGNI4
LABELV $476
ADDRLP4 0
INDIRI4
CNSTI4 2
LSHI4
ADDRFP4 0
INDIRP4
CNSTI4 312
ADDP4
ADDP4
INDIRI4
CNSTI4 0
EQI4 $480
ADDRLP4 12
ADDRFP4 4
INDIRP4
CNSTI4 188
ADDP4
ASGNP4
ADDRLP4 12
INDIRP4
ADDRLP4 12
INDIRP4
INDIRI4
CNSTI4 1
ADDRLP4 0
INDIRI4
LSHI4
BORI4
ASGNI4
LABELV $480
LABELV $477
ADDRLP4 0
ADDRLP4 0
INDIRI4
CNSTI4 1
ADDI4
ASGNI4
ADDRLP4 0
INDIRI4
CNSTI4 16
LTI4 $476
ADDRFP4 4
INDIRP4
CNSTI4 156
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 444
ADDP4
INDIRI4
ASGNI4
ADDRFP4 4
INDIRP4
CNSTI4 204
ADDP4
ADDRFP4 0
INDIRP4
CNSTI4 440
ADDP4
INDIRI4
ASGNI4
LABELV $458
endproc BG_PlayerStateToEntityStateExtraPolate 32 0
import trap_Cvar_VariableStringBuffer
import Pmove
import PM_UpdateViewAngles
import Com_Printf
import Com_Error
import Info_NextPair
import Info_Validate
import Info_SetValueForKey_Big
import Info_SetValueForKey
import Info_RemoveKey_Big
import Info_RemoveKey
import Info_ValueForKey
import Com_TruncateLongString
import va
import Q_CountChar
import Q_CleanStr
import Q_PrintStrlen
import Q_strcat
import Q_strncpyz
import Q_stristr
import Q_strupr
import Q_strlwr
import Q_stricmpn
import Q_strncmp
import Q_stricmp
import Q_isintegral
import Q_isanumber
import Q_isalpha
import Q_isupper
import Q_islower
import Q_isprint
import Com_RandomBytes
import Com_SkipCharset
import Com_SkipTokens
import Com_sprintf
import Com_HexStrToInt
import Parse3DMatrix
import Parse2DMatrix
import Parse1DMatrix
import SkipRestOfLine
import SkipBracedSection
import COM_MatchToken
import COM_ParseWarning
import COM_ParseError
import COM_Compress
import COM_ParseExt
import COM_Parse
import COM_GetCurrentParseLine
import COM_BeginParseSession
import COM_DefaultExtension
import COM_CompareExtension
import COM_StripExtension
import COM_GetExtension
import COM_SkipPath
import Com_Clamp
import PerpendicularVector
import AngleVectors
import MatrixMultiply
import MakeNormalVectors
import RotateAroundDirection
import RotatePointAroundVector
import ProjectPointOnPlane
import PlaneFromPoints
import AngleDelta
import AngleNormalize180
import AngleNormalize360
import AnglesSubtract
import AngleSubtract
import LerpAngle
import AngleMod
import BoundsIntersectPoint
import BoundsIntersectSphere
import BoundsIntersect
import BoxOnPlaneSide
import SetPlaneSignbits
import AxisCopy
import AxisClear
import AnglesToAxis
import vectoangles
import Q_crandom
import Q_random
import Q_rand
import Q_acos
import Q_log2
import VectorRotate
import Vector4Scale
import VectorNormalize2
import VectorNormalize
import CrossProduct
import VectorInverse
import VectorNormalizeFast
import DistanceSquared
import Distance
import VectorLengthSquared
import VectorLength
import VectorCompare
import AddPointToBounds
import ClearBounds
import RadiusFromBounds
import NormalizeColor
import ColorBytes4
import ColorBytes3
import _VectorMA
import _VectorScale
import _VectorCopy
import _VectorAdd
import _VectorSubtract
import _DotProduct
import ByteToDir
import DirToByte
import ClampShort
import ClampChar
import Q_rsqrt
import Q_fabs
import Q_isnan
import axisDefault
import vec3_origin
import g_color_table
import colorDkGrey
import colorMdGrey
import colorLtGrey
import colorWhite
import colorCyan
import colorMagenta
import colorYellow
import colorBlue
import colorGreen
import colorRed
import colorBlack
import bytedirs
import Hunk_AllocDebug
import FloatSwap
import LongSwap
import ShortSwap
import CopyLongSwap
import CopyShortSwap
import qk_acos
import qk_fabs
import qk_abs
import qk_tan
import qk_atan2
import qk_cos
import qk_sin
import qk_sqrt
import qk_floor
import qk_ceil
import qk_memcpy
import qk_memset
import qk_memmove
import qk_sscanf
import qk_vsnprintf
import qk_strtol
import qk_atoi
import qk_strtod
import qk_atof
import qk_toupper
import qk_tolower
import qk_strncpy
import qk_strstr
import qk_strrchr
import qk_strchr
import qk_strcmp
import qk_strcpy
import qk_strcat
import qk_strlen
import qk_rand
import qk_srand
import qk_qsort
lit
align 1
LABELV $423
byte 1 69
byte 1 86
byte 1 95
byte 1 84
byte 1 65
byte 1 85
byte 1 78
byte 1 84
byte 1 95
byte 1 80
byte 1 65
byte 1 84
byte 1 82
byte 1 79
byte 1 76
byte 1 0
align 1
LABELV $422
byte 1 69
byte 1 86
byte 1 95
byte 1 84
byte 1 65
byte 1 85
byte 1 78
byte 1 84
byte 1 95
byte 1 71
byte 1 85
byte 1 65
byte 1 82
byte 1 68
byte 1 66
byte 1 65
byte 1 83
byte 1 69
byte 1 0
align 1
LABELV $421
byte 1 69
byte 1 86
byte 1 95
byte 1 84
byte 1 65
byte 1 85
byte 1 78
byte 1 84
byte 1 95
byte 1 71
byte 1 69
byte 1 84
byte 1 70
byte 1 76
byte 1 65
byte 1 71
byte 1 0
align 1
LABELV $420
byte 1 69
byte 1 86
byte 1 95
byte 1 84
byte 1 65
byte 1 85
byte 1 78
byte 1 84
byte 1 95
byte 1 70
byte 1 79
byte 1 76
byte 1 76
byte 1 79
byte 1 87
byte 1 77
byte 1 69
byte 1 0
align 1
LABELV $419
byte 1 69
byte 1 86
byte 1 95
byte 1 84
byte 1 65
byte 1 85
byte 1 78
byte 1 84
byte 1 95
byte 1 78
byte 1 79
byte 1 0
align 1
LABELV $418
byte 1 69
byte 1 86
byte 1 95
byte 1 84
byte 1 65
byte 1 85
byte 1 78
byte 1 84
byte 1 95
byte 1 89
byte 1 69
byte 1 83
byte 1 0
align 1
LABELV $417
byte 1 69
byte 1 86
byte 1 95
byte 1 84
byte 1 65
byte 1 85
byte 1 78
byte 1 84
byte 1 0
align 1
LABELV $416
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 84
byte 1 79
byte 1 80
byte 1 76
byte 1 79
byte 1 79
byte 1 80
byte 1 73
byte 1 78
byte 1 71
byte 1 83
byte 1 79
byte 1 85
byte 1 78
byte 1 68
byte 1 0
align 1
LABELV $415
byte 1 69
byte 1 86
byte 1 95
byte 1 68
byte 1 69
byte 1 66
byte 1 85
byte 1 71
byte 1 95
byte 1 76
byte 1 73
byte 1 78
byte 1 69
byte 1 0
align 1
LABELV $414
byte 1 69
byte 1 86
byte 1 95
byte 1 76
byte 1 73
byte 1 71
byte 1 72
byte 1 84
byte 1 78
byte 1 73
byte 1 78
byte 1 71
byte 1 66
byte 1 79
byte 1 76
byte 1 84
byte 1 0
align 1
LABELV $413
byte 1 69
byte 1 86
byte 1 95
byte 1 74
byte 1 85
byte 1 73
byte 1 67
byte 1 69
byte 1 68
byte 1 0
align 1
LABELV $412
byte 1 69
byte 1 86
byte 1 95
byte 1 73
byte 1 78
byte 1 86
byte 1 85
byte 1 76
byte 1 95
byte 1 73
byte 1 77
byte 1 80
byte 1 65
byte 1 67
byte 1 84
byte 1 0
align 1
LABELV $411
byte 1 69
byte 1 86
byte 1 95
byte 1 79
byte 1 66
byte 1 69
byte 1 76
byte 1 73
byte 1 83
byte 1 75
byte 1 80
byte 1 65
byte 1 73
byte 1 78
byte 1 0
align 1
LABELV $410
byte 1 69
byte 1 86
byte 1 95
byte 1 79
byte 1 66
byte 1 69
byte 1 76
byte 1 73
byte 1 83
byte 1 75
byte 1 69
byte 1 88
byte 1 80
byte 1 76
byte 1 79
byte 1 68
byte 1 69
byte 1 0
align 1
LABELV $409
byte 1 69
byte 1 86
byte 1 95
byte 1 75
byte 1 65
byte 1 77
byte 1 73
byte 1 75
byte 1 65
byte 1 90
byte 1 69
byte 1 0
align 1
LABELV $408
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 82
byte 1 79
byte 1 88
byte 1 73
byte 1 77
byte 1 73
byte 1 84
byte 1 89
byte 1 95
byte 1 77
byte 1 73
byte 1 78
byte 1 69
byte 1 95
byte 1 84
byte 1 82
byte 1 73
byte 1 71
byte 1 71
byte 1 69
byte 1 82
byte 1 0
align 1
LABELV $407
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 82
byte 1 79
byte 1 88
byte 1 73
byte 1 77
byte 1 73
byte 1 84
byte 1 89
byte 1 95
byte 1 77
byte 1 73
byte 1 78
byte 1 69
byte 1 95
byte 1 83
byte 1 84
byte 1 73
byte 1 67
byte 1 75
byte 1 0
align 1
LABELV $406
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 67
byte 1 79
byte 1 82
byte 1 69
byte 1 80
byte 1 76
byte 1 85
byte 1 77
byte 1 0
align 1
LABELV $405
byte 1 69
byte 1 86
byte 1 95
byte 1 71
byte 1 73
byte 1 66
byte 1 95
byte 1 80
byte 1 76
byte 1 65
byte 1 89
byte 1 69
byte 1 82
byte 1 0
align 1
LABELV $404
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 79
byte 1 87
byte 1 69
byte 1 82
byte 1 85
byte 1 80
byte 1 95
byte 1 82
byte 1 69
byte 1 71
byte 1 69
byte 1 78
byte 1 0
align 1
LABELV $403
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 79
byte 1 87
byte 1 69
byte 1 82
byte 1 85
byte 1 80
byte 1 95
byte 1 66
byte 1 65
byte 1 84
byte 1 84
byte 1 76
byte 1 69
byte 1 83
byte 1 85
byte 1 73
byte 1 84
byte 1 0
align 1
LABELV $402
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 79
byte 1 87
byte 1 69
byte 1 82
byte 1 85
byte 1 80
byte 1 95
byte 1 81
byte 1 85
byte 1 65
byte 1 68
byte 1 0
align 1
LABELV $401
byte 1 69
byte 1 86
byte 1 95
byte 1 79
byte 1 66
byte 1 73
byte 1 84
byte 1 85
byte 1 65
byte 1 82
byte 1 89
byte 1 0
align 1
LABELV $400
byte 1 69
byte 1 86
byte 1 95
byte 1 68
byte 1 69
byte 1 65
byte 1 84
byte 1 72
byte 1 51
byte 1 0
align 1
LABELV $399
byte 1 69
byte 1 86
byte 1 95
byte 1 68
byte 1 69
byte 1 65
byte 1 84
byte 1 72
byte 1 50
byte 1 0
align 1
LABELV $398
byte 1 69
byte 1 86
byte 1 95
byte 1 68
byte 1 69
byte 1 65
byte 1 84
byte 1 72
byte 1 49
byte 1 0
align 1
LABELV $397
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 65
byte 1 73
byte 1 78
byte 1 0
align 1
LABELV $396
byte 1 69
byte 1 86
byte 1 95
byte 1 66
byte 1 85
byte 1 76
byte 1 76
byte 1 69
byte 1 84
byte 1 0
align 1
LABELV $395
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 72
byte 1 79
byte 1 84
byte 1 71
byte 1 85
byte 1 78
byte 1 0
align 1
LABELV $394
byte 1 69
byte 1 86
byte 1 95
byte 1 82
byte 1 65
byte 1 73
byte 1 76
byte 1 84
byte 1 82
byte 1 65
byte 1 73
byte 1 76
byte 1 0
align 1
LABELV $393
byte 1 69
byte 1 86
byte 1 95
byte 1 77
byte 1 73
byte 1 83
byte 1 83
byte 1 73
byte 1 76
byte 1 69
byte 1 95
byte 1 77
byte 1 73
byte 1 83
byte 1 83
byte 1 95
byte 1 77
byte 1 69
byte 1 84
byte 1 65
byte 1 76
byte 1 0
align 1
LABELV $392
byte 1 69
byte 1 86
byte 1 95
byte 1 77
byte 1 73
byte 1 83
byte 1 83
byte 1 73
byte 1 76
byte 1 69
byte 1 95
byte 1 77
byte 1 73
byte 1 83
byte 1 83
byte 1 0
align 1
LABELV $391
byte 1 69
byte 1 86
byte 1 95
byte 1 77
byte 1 73
byte 1 83
byte 1 83
byte 1 73
byte 1 76
byte 1 69
byte 1 95
byte 1 72
byte 1 73
byte 1 84
byte 1 0
align 1
LABELV $390
byte 1 69
byte 1 86
byte 1 95
byte 1 66
byte 1 85
byte 1 76
byte 1 76
byte 1 69
byte 1 84
byte 1 95
byte 1 72
byte 1 73
byte 1 84
byte 1 95
byte 1 87
byte 1 65
byte 1 76
byte 1 76
byte 1 0
align 1
LABELV $389
byte 1 69
byte 1 86
byte 1 95
byte 1 66
byte 1 85
byte 1 76
byte 1 76
byte 1 69
byte 1 84
byte 1 95
byte 1 72
byte 1 73
byte 1 84
byte 1 95
byte 1 70
byte 1 76
byte 1 69
byte 1 83
byte 1 72
byte 1 0
align 1
LABELV $388
byte 1 69
byte 1 86
byte 1 95
byte 1 71
byte 1 76
byte 1 79
byte 1 66
byte 1 65
byte 1 76
byte 1 95
byte 1 84
byte 1 69
byte 1 65
byte 1 77
byte 1 95
byte 1 83
byte 1 79
byte 1 85
byte 1 78
byte 1 68
byte 1 0
align 1
LABELV $387
byte 1 69
byte 1 86
byte 1 95
byte 1 71
byte 1 76
byte 1 79
byte 1 66
byte 1 65
byte 1 76
byte 1 95
byte 1 83
byte 1 79
byte 1 85
byte 1 78
byte 1 68
byte 1 0
align 1
LABELV $386
byte 1 69
byte 1 86
byte 1 95
byte 1 71
byte 1 69
byte 1 78
byte 1 69
byte 1 82
byte 1 65
byte 1 76
byte 1 95
byte 1 83
byte 1 79
byte 1 85
byte 1 78
byte 1 68
byte 1 0
align 1
LABELV $385
byte 1 69
byte 1 86
byte 1 95
byte 1 71
byte 1 82
byte 1 69
byte 1 78
byte 1 65
byte 1 68
byte 1 69
byte 1 95
byte 1 66
byte 1 79
byte 1 85
byte 1 78
byte 1 67
byte 1 69
byte 1 0
align 1
LABELV $384
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 76
byte 1 65
byte 1 89
byte 1 69
byte 1 82
byte 1 95
byte 1 84
byte 1 69
byte 1 76
byte 1 69
byte 1 80
byte 1 79
byte 1 82
byte 1 84
byte 1 95
byte 1 79
byte 1 85
byte 1 84
byte 1 0
align 1
LABELV $383
byte 1 69
byte 1 86
byte 1 95
byte 1 80
byte 1 76
byte 1 65
byte 1 89
byte 1 69
byte 1 82
byte 1 95
byte 1 84
byte 1 69
byte 1 76
byte 1 69
byte 1 80
byte 1 79
byte 1 82
byte 1 84
byte 1 95
byte 1 73
byte 1 78
byte 1 0
align 1
LABELV $382
byte 1 69
byte 1 86
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 95
byte 1 80
byte 1 79
byte 1 80
byte 1 0
align 1
LABELV $381
byte 1 69
byte 1 86
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 95
byte 1 82
byte 1 69
byte 1 83
byte 1 80
byte 1 65
byte 1 87
byte 1 78
byte 1 0
align 1
LABELV $380
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 49
byte 1 53
byte 1 0
align 1
LABELV $379
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 49
byte 1 52
byte 1 0
align 1
LABELV $378
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 49
byte 1 51
byte 1 0
align 1
LABELV $377
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 49
byte 1 50
byte 1 0
align 1
LABELV $376
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 49
byte 1 49
byte 1 0
align 1
LABELV $375
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 49
byte 1 48
byte 1 0
align 1
LABELV $374
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 57
byte 1 0
align 1
LABELV $373
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 56
byte 1 0
align 1
LABELV $372
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 55
byte 1 0
align 1
LABELV $371
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 54
byte 1 0
align 1
LABELV $370
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 53
byte 1 0
align 1
LABELV $369
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 52
byte 1 0
align 1
LABELV $368
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 51
byte 1 0
align 1
LABELV $367
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 50
byte 1 0
align 1
LABELV $366
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 49
byte 1 0
align 1
LABELV $365
byte 1 69
byte 1 86
byte 1 95
byte 1 85
byte 1 83
byte 1 69
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 48
byte 1 0
align 1
LABELV $364
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 73
byte 1 82
byte 1 69
byte 1 95
byte 1 87
byte 1 69
byte 1 65
byte 1 80
byte 1 79
byte 1 78
byte 1 0
align 1
LABELV $363
byte 1 69
byte 1 86
byte 1 95
byte 1 67
byte 1 72
byte 1 65
byte 1 78
byte 1 71
byte 1 69
byte 1 95
byte 1 87
byte 1 69
byte 1 65
byte 1 80
byte 1 79
byte 1 78
byte 1 0
align 1
LABELV $362
byte 1 69
byte 1 86
byte 1 95
byte 1 78
byte 1 79
byte 1 65
byte 1 77
byte 1 77
byte 1 79
byte 1 0
align 1
LABELV $361
byte 1 69
byte 1 86
byte 1 95
byte 1 71
byte 1 76
byte 1 79
byte 1 66
byte 1 65
byte 1 76
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 95
byte 1 80
byte 1 73
byte 1 67
byte 1 75
byte 1 85
byte 1 80
byte 1 0
align 1
LABELV $360
byte 1 69
byte 1 86
byte 1 95
byte 1 73
byte 1 84
byte 1 69
byte 1 77
byte 1 95
byte 1 80
byte 1 73
byte 1 67
byte 1 75
byte 1 85
byte 1 80
byte 1 0
align 1
LABELV $359
byte 1 69
byte 1 86
byte 1 95
byte 1 87
byte 1 65
byte 1 84
byte 1 69
byte 1 82
byte 1 95
byte 1 67
byte 1 76
byte 1 69
byte 1 65
byte 1 82
byte 1 0
align 1
LABELV $358
byte 1 69
byte 1 86
byte 1 95
byte 1 87
byte 1 65
byte 1 84
byte 1 69
byte 1 82
byte 1 95
byte 1 85
byte 1 78
byte 1 68
byte 1 69
byte 1 82
byte 1 0
align 1
LABELV $357
byte 1 69
byte 1 86
byte 1 95
byte 1 87
byte 1 65
byte 1 84
byte 1 69
byte 1 82
byte 1 95
byte 1 76
byte 1 69
byte 1 65
byte 1 86
byte 1 69
byte 1 0
align 1
LABELV $356
byte 1 69
byte 1 86
byte 1 95
byte 1 87
byte 1 65
byte 1 84
byte 1 69
byte 1 82
byte 1 95
byte 1 84
byte 1 79
byte 1 85
byte 1 67
byte 1 72
byte 1 0
align 1
LABELV $355
byte 1 69
byte 1 86
byte 1 95
byte 1 74
byte 1 85
byte 1 77
byte 1 80
byte 1 0
align 1
LABELV $354
byte 1 69
byte 1 86
byte 1 95
byte 1 74
byte 1 85
byte 1 77
byte 1 80
byte 1 95
byte 1 80
byte 1 65
byte 1 68
byte 1 0
align 1
LABELV $353
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 65
byte 1 76
byte 1 76
byte 1 95
byte 1 70
byte 1 65
byte 1 82
byte 1 0
align 1
LABELV $352
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 65
byte 1 76
byte 1 76
byte 1 95
byte 1 77
byte 1 69
byte 1 68
byte 1 73
byte 1 85
byte 1 77
byte 1 0
align 1
LABELV $351
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 65
byte 1 76
byte 1 76
byte 1 95
byte 1 83
byte 1 72
byte 1 79
byte 1 82
byte 1 84
byte 1 0
align 1
LABELV $350
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 84
byte 1 69
byte 1 80
byte 1 95
byte 1 49
byte 1 54
byte 1 0
align 1
LABELV $349
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 84
byte 1 69
byte 1 80
byte 1 95
byte 1 49
byte 1 50
byte 1 0
align 1
LABELV $348
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 84
byte 1 69
byte 1 80
byte 1 95
byte 1 56
byte 1 0
align 1
LABELV $347
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 84
byte 1 69
byte 1 80
byte 1 95
byte 1 52
byte 1 0
align 1
LABELV $346
byte 1 69
byte 1 86
byte 1 95
byte 1 83
byte 1 87
byte 1 73
byte 1 77
byte 1 0
align 1
LABELV $345
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 79
byte 1 79
byte 1 84
byte 1 87
byte 1 65
byte 1 68
byte 1 69
byte 1 0
align 1
LABELV $344
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 79
byte 1 79
byte 1 84
byte 1 83
byte 1 80
byte 1 76
byte 1 65
byte 1 83
byte 1 72
byte 1 0
align 1
LABELV $343
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 79
byte 1 79
byte 1 84
byte 1 83
byte 1 84
byte 1 69
byte 1 80
byte 1 95
byte 1 77
byte 1 69
byte 1 84
byte 1 65
byte 1 76
byte 1 0
align 1
LABELV $342
byte 1 69
byte 1 86
byte 1 95
byte 1 70
byte 1 79
byte 1 79
byte 1 84
byte 1 83
byte 1 84
byte 1 69
byte 1 80
byte 1 0
align 1
LABELV $341
byte 1 69
byte 1 86
byte 1 95
byte 1 78
byte 1 79
byte 1 78
byte 1 69
byte 1 0
align 1
LABELV $339
byte 1 66
byte 1 71
byte 1 95
byte 1 69
byte 1 118
byte 1 97
byte 1 108
byte 1 117
byte 1 97
byte 1 116
byte 1 101
byte 1 84
byte 1 114
byte 1 97
byte 1 106
byte 1 101
byte 1 99
byte 1 116
byte 1 111
byte 1 114
byte 1 121
byte 1 68
byte 1 101
byte 1 108
byte 1 116
byte 1 97
byte 1 58
byte 1 32
byte 1 117
byte 1 110
byte 1 107
byte 1 110
byte 1 111
byte 1 119
byte 1 110
byte 1 32
byte 1 116
byte 1 114
byte 1 84
byte 1 121
byte 1 112
byte 1 101
byte 1 58
byte 1 32
byte 1 37
byte 1 105
byte 1 0
align 1
LABELV $326
byte 1 66
byte 1 71
byte 1 95
byte 1 69
byte 1 118
byte 1 97
byte 1 108
byte 1 117
byte 1 97
byte 1 116
byte 1 101
byte 1 84
byte 1 114
byte 1 97
byte 1 106
byte 1 101
byte 1 99
byte 1 116
byte 1 111
byte 1 114
byte 1 121
byte 1 58
byte 1 32
byte 1 117
byte 1 110
byte 1 107
byte 1 110
byte 1 111
byte 1 119
byte 1 110
byte 1 32
byte 1 116
byte 1 114
byte 1 84
byte 1 121
byte 1 112
byte 1 101
byte 1 58
byte 1 32
byte 1 37
byte 1 105
byte 1 0
align 1
LABELV $311
byte 1 66
byte 1 71
byte 1 95
byte 1 67
byte 1 97
byte 1 110
byte 1 73
byte 1 116
byte 1 101
byte 1 109
byte 1 66
byte 1 101
byte 1 71
byte 1 114
byte 1 97
byte 1 98
byte 1 98
byte 1 101
byte 1 100
byte 1 58
byte 1 32
byte 1 73
byte 1 84
byte 1 95
byte 1 66
byte 1 65
byte 1 68
byte 1 0
align 1
LABELV $270
byte 1 66
byte 1 71
byte 1 95
byte 1 67
byte 1 97
byte 1 110
byte 1 73
byte 1 116
byte 1 101
byte 1 109
byte 1 66
byte 1 101
byte 1 71
byte 1 114
byte 1 97
byte 1 98
byte 1 98
byte 1 101
byte 1 100
byte 1 58
byte 1 32
byte 1 105
byte 1 110
byte 1 100
byte 1 101
byte 1 120
byte 1 32
byte 1 111
byte 1 117
byte 1 116
byte 1 32
byte 1 111
byte 1 102
byte 1 32
byte 1 114
byte 1 97
byte 1 110
byte 1 103
byte 1 101
byte 1 0
align 1
LABELV $245
byte 1 67
byte 1 111
byte 1 117
byte 1 108
byte 1 100
byte 1 110
byte 1 39
byte 1 116
byte 1 32
byte 1 102
byte 1 105
byte 1 110
byte 1 100
byte 1 32
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 32
byte 1 102
byte 1 111
byte 1 114
byte 1 32
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 32
byte 1 37
byte 1 105
byte 1 0
align 1
LABELV $236
byte 1 72
byte 1 111
byte 1 108
byte 1 100
byte 1 97
byte 1 98
byte 1 108
byte 1 101
byte 1 73
byte 1 116
byte 1 101
byte 1 109
byte 1 32
byte 1 110
byte 1 111
byte 1 116
byte 1 32
byte 1 102
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 0
align 1
LABELV $213
byte 1 66
byte 1 108
byte 1 117
byte 1 101
byte 1 32
byte 1 70
byte 1 108
byte 1 97
byte 1 103
byte 1 0
align 1
LABELV $212
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 102
byte 1 95
byte 1 98
byte 1 108
byte 1 117
byte 1 49
byte 1 0
align 1
LABELV $211
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 102
byte 1 108
byte 1 97
byte 1 103
byte 1 115
byte 1 47
byte 1 98
byte 1 95
byte 1 102
byte 1 108
byte 1 97
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $210
byte 1 116
byte 1 101
byte 1 97
byte 1 109
byte 1 95
byte 1 67
byte 1 84
byte 1 70
byte 1 95
byte 1 98
byte 1 108
byte 1 117
byte 1 101
byte 1 102
byte 1 108
byte 1 97
byte 1 103
byte 1 0
align 1
LABELV $209
byte 1 82
byte 1 101
byte 1 100
byte 1 32
byte 1 70
byte 1 108
byte 1 97
byte 1 103
byte 1 0
align 1
LABELV $208
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 102
byte 1 95
byte 1 114
byte 1 101
byte 1 100
byte 1 49
byte 1 0
align 1
LABELV $207
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 102
byte 1 108
byte 1 97
byte 1 103
byte 1 115
byte 1 47
byte 1 114
byte 1 95
byte 1 102
byte 1 108
byte 1 97
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $206
byte 1 116
byte 1 101
byte 1 97
byte 1 109
byte 1 95
byte 1 67
byte 1 84
byte 1 70
byte 1 95
byte 1 114
byte 1 101
byte 1 100
byte 1 102
byte 1 108
byte 1 97
byte 1 103
byte 1 0
align 1
LABELV $205
byte 1 70
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 0
align 1
LABELV $204
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 102
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 0
align 1
LABELV $203
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 102
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 95
byte 1 114
byte 1 105
byte 1 110
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $202
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 102
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $201
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 102
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $200
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 102
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 0
align 1
LABELV $199
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 114
byte 1 101
byte 1 103
byte 1 101
byte 1 110
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $198
byte 1 82
byte 1 101
byte 1 103
byte 1 101
byte 1 110
byte 1 101
byte 1 114
byte 1 97
byte 1 116
byte 1 105
byte 1 111
byte 1 110
byte 1 0
align 1
LABELV $197
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 114
byte 1 101
byte 1 103
byte 1 101
byte 1 110
byte 1 0
align 1
LABELV $196
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 114
byte 1 101
byte 1 103
byte 1 101
byte 1 110
byte 1 95
byte 1 114
byte 1 105
byte 1 110
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $195
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 114
byte 1 101
byte 1 103
byte 1 101
byte 1 110
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $194
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 114
byte 1 101
byte 1 103
byte 1 101
byte 1 110
byte 1 101
byte 1 114
byte 1 97
byte 1 116
byte 1 105
byte 1 111
byte 1 110
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $193
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 114
byte 1 101
byte 1 103
byte 1 101
byte 1 110
byte 1 0
align 1
LABELV $192
byte 1 73
byte 1 110
byte 1 118
byte 1 105
byte 1 115
byte 1 105
byte 1 98
byte 1 105
byte 1 108
byte 1 105
byte 1 116
byte 1 121
byte 1 0
align 1
LABELV $191
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 118
byte 1 105
byte 1 115
byte 1 0
align 1
LABELV $190
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 105
byte 1 110
byte 1 118
byte 1 105
byte 1 115
byte 1 95
byte 1 114
byte 1 105
byte 1 110
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $189
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 105
byte 1 110
byte 1 118
byte 1 105
byte 1 115
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $188
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 118
byte 1 105
byte 1 115
byte 1 105
byte 1 98
byte 1 105
byte 1 108
byte 1 105
byte 1 116
byte 1 121
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $187
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 105
byte 1 110
byte 1 118
byte 1 105
byte 1 115
byte 1 0
align 1
LABELV $186
byte 1 83
byte 1 112
byte 1 101
byte 1 101
byte 1 100
byte 1 0
align 1
LABELV $185
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 104
byte 1 97
byte 1 115
byte 1 116
byte 1 101
byte 1 0
align 1
LABELV $184
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 104
byte 1 97
byte 1 115
byte 1 116
byte 1 101
byte 1 95
byte 1 114
byte 1 105
byte 1 110
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $183
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 104
byte 1 97
byte 1 115
byte 1 116
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $182
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 104
byte 1 97
byte 1 115
byte 1 116
byte 1 101
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $181
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 104
byte 1 97
byte 1 115
byte 1 116
byte 1 101
byte 1 0
align 1
LABELV $180
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 97
byte 1 105
byte 1 114
byte 1 111
byte 1 117
byte 1 116
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 32
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 112
byte 1 114
byte 1 111
byte 1 116
byte 1 101
byte 1 99
byte 1 116
byte 1 51
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $179
byte 1 66
byte 1 97
byte 1 116
byte 1 116
byte 1 108
byte 1 101
byte 1 32
byte 1 83
byte 1 117
byte 1 105
byte 1 116
byte 1 0
align 1
LABELV $178
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 101
byte 1 110
byte 1 118
byte 1 105
byte 1 114
byte 1 111
byte 1 115
byte 1 117
byte 1 105
byte 1 116
byte 1 0
align 1
LABELV $177
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 101
byte 1 110
byte 1 118
byte 1 105
byte 1 114
byte 1 111
byte 1 95
byte 1 114
byte 1 105
byte 1 110
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $176
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 101
byte 1 110
byte 1 118
byte 1 105
byte 1 114
byte 1 111
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $175
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 112
byte 1 114
byte 1 111
byte 1 116
byte 1 101
byte 1 99
byte 1 116
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $174
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 101
byte 1 110
byte 1 118
byte 1 105
byte 1 114
byte 1 111
byte 1 0
align 1
LABELV $173
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 100
byte 1 97
byte 1 109
byte 1 97
byte 1 103
byte 1 101
byte 1 50
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 32
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 100
byte 1 97
byte 1 109
byte 1 97
byte 1 103
byte 1 101
byte 1 51
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $172
byte 1 81
byte 1 117
byte 1 97
byte 1 100
byte 1 32
byte 1 68
byte 1 97
byte 1 109
byte 1 97
byte 1 103
byte 1 101
byte 1 0
align 1
LABELV $171
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 113
byte 1 117
byte 1 97
byte 1 100
byte 1 0
align 1
LABELV $170
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 113
byte 1 117
byte 1 97
byte 1 100
byte 1 95
byte 1 114
byte 1 105
byte 1 110
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $169
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 105
byte 1 110
byte 1 115
byte 1 116
byte 1 97
byte 1 110
byte 1 116
byte 1 47
byte 1 113
byte 1 117
byte 1 97
byte 1 100
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $168
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 113
byte 1 117
byte 1 97
byte 1 100
byte 1 100
byte 1 97
byte 1 109
byte 1 97
byte 1 103
byte 1 101
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $167
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 113
byte 1 117
byte 1 97
byte 1 100
byte 1 0
align 1
LABELV $166
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 117
byte 1 115
byte 1 101
byte 1 95
byte 1 109
byte 1 101
byte 1 100
byte 1 107
byte 1 105
byte 1 116
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $165
byte 1 77
byte 1 101
byte 1 100
byte 1 107
byte 1 105
byte 1 116
byte 1 0
align 1
LABELV $164
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 109
byte 1 101
byte 1 100
byte 1 107
byte 1 105
byte 1 116
byte 1 0
align 1
LABELV $163
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 111
byte 1 108
byte 1 100
byte 1 97
byte 1 98
byte 1 108
byte 1 101
byte 1 47
byte 1 109
byte 1 101
byte 1 100
byte 1 107
byte 1 105
byte 1 116
byte 1 95
byte 1 115
byte 1 112
byte 1 104
byte 1 101
byte 1 114
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $162
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 111
byte 1 108
byte 1 100
byte 1 97
byte 1 98
byte 1 108
byte 1 101
byte 1 47
byte 1 109
byte 1 101
byte 1 100
byte 1 107
byte 1 105
byte 1 116
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $161
byte 1 104
byte 1 111
byte 1 108
byte 1 100
byte 1 97
byte 1 98
byte 1 108
byte 1 101
byte 1 95
byte 1 109
byte 1 101
byte 1 100
byte 1 107
byte 1 105
byte 1 116
byte 1 0
align 1
LABELV $160
byte 1 80
byte 1 101
byte 1 114
byte 1 115
byte 1 111
byte 1 110
byte 1 97
byte 1 108
byte 1 32
byte 1 84
byte 1 101
byte 1 108
byte 1 101
byte 1 112
byte 1 111
byte 1 114
byte 1 116
byte 1 101
byte 1 114
byte 1 0
align 1
LABELV $159
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 116
byte 1 101
byte 1 108
byte 1 101
byte 1 112
byte 1 111
byte 1 114
byte 1 116
byte 1 101
byte 1 114
byte 1 0
align 1
LABELV $158
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 111
byte 1 108
byte 1 100
byte 1 97
byte 1 98
byte 1 108
byte 1 101
byte 1 47
byte 1 116
byte 1 101
byte 1 108
byte 1 101
byte 1 112
byte 1 111
byte 1 114
byte 1 116
byte 1 101
byte 1 114
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $157
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 104
byte 1 111
byte 1 108
byte 1 100
byte 1 97
byte 1 98
byte 1 108
byte 1 101
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $156
byte 1 104
byte 1 111
byte 1 108
byte 1 100
byte 1 97
byte 1 98
byte 1 108
byte 1 101
byte 1 95
byte 1 116
byte 1 101
byte 1 108
byte 1 101
byte 1 112
byte 1 111
byte 1 114
byte 1 116
byte 1 101
byte 1 114
byte 1 0
align 1
LABELV $155
byte 1 66
byte 1 102
byte 1 103
byte 1 32
byte 1 65
byte 1 109
byte 1 109
byte 1 111
byte 1 0
align 1
LABELV $154
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 98
byte 1 102
byte 1 103
byte 1 0
align 1
LABELV $153
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 98
byte 1 102
byte 1 103
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $152
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 98
byte 1 102
byte 1 103
byte 1 0
align 1
LABELV $151
byte 1 83
byte 1 108
byte 1 117
byte 1 103
byte 1 115
byte 1 0
align 1
LABELV $150
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 114
byte 1 97
byte 1 105
byte 1 108
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $149
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 114
byte 1 97
byte 1 105
byte 1 108
byte 1 103
byte 1 117
byte 1 110
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $148
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 115
byte 1 108
byte 1 117
byte 1 103
byte 1 115
byte 1 0
align 1
LABELV $147
byte 1 82
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 115
byte 1 0
align 1
LABELV $146
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 114
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 0
align 1
LABELV $145
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 114
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $144
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 114
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 115
byte 1 0
align 1
LABELV $143
byte 1 76
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 0
align 1
LABELV $142
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 0
align 1
LABELV $141
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $140
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 0
align 1
LABELV $139
byte 1 67
byte 1 101
byte 1 108
byte 1 108
byte 1 115
byte 1 0
align 1
LABELV $138
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 112
byte 1 108
byte 1 97
byte 1 115
byte 1 109
byte 1 97
byte 1 0
align 1
LABELV $137
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 112
byte 1 108
byte 1 97
byte 1 115
byte 1 109
byte 1 97
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $136
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 99
byte 1 101
byte 1 108
byte 1 108
byte 1 115
byte 1 0
align 1
LABELV $135
byte 1 71
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 115
byte 1 0
align 1
LABELV $134
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 0
align 1
LABELV $133
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $132
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 115
byte 1 0
align 1
LABELV $131
byte 1 66
byte 1 117
byte 1 108
byte 1 108
byte 1 101
byte 1 116
byte 1 115
byte 1 0
align 1
LABELV $130
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 109
byte 1 97
byte 1 99
byte 1 104
byte 1 105
byte 1 110
byte 1 101
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $129
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 109
byte 1 97
byte 1 99
byte 1 104
byte 1 105
byte 1 110
byte 1 101
byte 1 103
byte 1 117
byte 1 110
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $128
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 98
byte 1 117
byte 1 108
byte 1 108
byte 1 101
byte 1 116
byte 1 115
byte 1 0
align 1
LABELV $127
byte 1 83
byte 1 104
byte 1 101
byte 1 108
byte 1 108
byte 1 115
byte 1 0
align 1
LABELV $126
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 97
byte 1 95
byte 1 115
byte 1 104
byte 1 111
byte 1 116
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $125
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 47
byte 1 115
byte 1 104
byte 1 111
byte 1 116
byte 1 103
byte 1 117
byte 1 110
byte 1 97
byte 1 109
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $124
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 109
byte 1 105
byte 1 115
byte 1 99
byte 1 47
byte 1 97
byte 1 109
byte 1 95
byte 1 112
byte 1 107
byte 1 117
byte 1 112
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $123
byte 1 97
byte 1 109
byte 1 109
byte 1 111
byte 1 95
byte 1 115
byte 1 104
byte 1 101
byte 1 108
byte 1 108
byte 1 115
byte 1 0
align 1
LABELV $122
byte 1 71
byte 1 114
byte 1 97
byte 1 112
byte 1 112
byte 1 108
byte 1 105
byte 1 110
byte 1 103
byte 1 32
byte 1 72
byte 1 111
byte 1 111
byte 1 107
byte 1 0
align 1
LABELV $121
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 103
byte 1 114
byte 1 97
byte 1 112
byte 1 112
byte 1 108
byte 1 101
byte 1 0
align 1
LABELV $120
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 103
byte 1 114
byte 1 97
byte 1 112
byte 1 112
byte 1 108
byte 1 101
byte 1 47
byte 1 103
byte 1 114
byte 1 97
byte 1 112
byte 1 112
byte 1 108
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $119
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 103
byte 1 114
byte 1 97
byte 1 112
byte 1 112
byte 1 108
byte 1 105
byte 1 110
byte 1 103
byte 1 104
byte 1 111
byte 1 111
byte 1 107
byte 1 0
align 1
LABELV $118
byte 1 66
byte 1 70
byte 1 71
byte 1 49
byte 1 48
byte 1 75
byte 1 0
align 1
LABELV $117
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 98
byte 1 102
byte 1 103
byte 1 0
align 1
LABELV $116
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 98
byte 1 102
byte 1 103
byte 1 47
byte 1 98
byte 1 102
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $115
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 98
byte 1 102
byte 1 103
byte 1 0
align 1
LABELV $114
byte 1 80
byte 1 108
byte 1 97
byte 1 115
byte 1 109
byte 1 97
byte 1 32
byte 1 71
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $113
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 112
byte 1 108
byte 1 97
byte 1 115
byte 1 109
byte 1 97
byte 1 0
align 1
LABELV $112
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 112
byte 1 108
byte 1 97
byte 1 115
byte 1 109
byte 1 97
byte 1 47
byte 1 112
byte 1 108
byte 1 97
byte 1 115
byte 1 109
byte 1 97
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $111
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 112
byte 1 108
byte 1 97
byte 1 115
byte 1 109
byte 1 97
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $110
byte 1 82
byte 1 97
byte 1 105
byte 1 108
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $109
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 114
byte 1 97
byte 1 105
byte 1 108
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $108
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 114
byte 1 97
byte 1 105
byte 1 108
byte 1 103
byte 1 117
byte 1 110
byte 1 47
byte 1 114
byte 1 97
byte 1 105
byte 1 108
byte 1 103
byte 1 117
byte 1 110
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $107
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 114
byte 1 97
byte 1 105
byte 1 108
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $106
byte 1 76
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 32
byte 1 71
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $105
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 0
align 1
LABELV $104
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 47
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $103
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 108
byte 1 105
byte 1 103
byte 1 104
byte 1 116
byte 1 110
byte 1 105
byte 1 110
byte 1 103
byte 1 0
align 1
LABELV $102
byte 1 82
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 32
byte 1 76
byte 1 97
byte 1 117
byte 1 110
byte 1 99
byte 1 104
byte 1 101
byte 1 114
byte 1 0
align 1
LABELV $101
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 114
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 0
align 1
LABELV $100
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 114
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 108
byte 1 47
byte 1 114
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 108
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $99
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 114
byte 1 111
byte 1 99
byte 1 107
byte 1 101
byte 1 116
byte 1 108
byte 1 97
byte 1 117
byte 1 110
byte 1 99
byte 1 104
byte 1 101
byte 1 114
byte 1 0
align 1
LABELV $98
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 47
byte 1 104
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 98
byte 1 49
byte 1 97
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 32
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 47
byte 1 104
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 98
byte 1 50
byte 1 97
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $97
byte 1 71
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 32
byte 1 76
byte 1 97
byte 1 117
byte 1 110
byte 1 99
byte 1 104
byte 1 101
byte 1 114
byte 1 0
align 1
LABELV $96
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 0
align 1
LABELV $95
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 108
byte 1 47
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 108
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $94
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 103
byte 1 114
byte 1 101
byte 1 110
byte 1 97
byte 1 100
byte 1 101
byte 1 108
byte 1 97
byte 1 117
byte 1 110
byte 1 99
byte 1 104
byte 1 101
byte 1 114
byte 1 0
align 1
LABELV $93
byte 1 77
byte 1 97
byte 1 99
byte 1 104
byte 1 105
byte 1 110
byte 1 101
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $92
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 109
byte 1 97
byte 1 99
byte 1 104
byte 1 105
byte 1 110
byte 1 101
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $91
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 109
byte 1 97
byte 1 99
byte 1 104
byte 1 105
byte 1 110
byte 1 101
byte 1 103
byte 1 117
byte 1 110
byte 1 47
byte 1 109
byte 1 97
byte 1 99
byte 1 104
byte 1 105
byte 1 110
byte 1 101
byte 1 103
byte 1 117
byte 1 110
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $90
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 109
byte 1 97
byte 1 99
byte 1 104
byte 1 105
byte 1 110
byte 1 101
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $89
byte 1 83
byte 1 104
byte 1 111
byte 1 116
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $88
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 115
byte 1 104
byte 1 111
byte 1 116
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $87
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 115
byte 1 104
byte 1 111
byte 1 116
byte 1 103
byte 1 117
byte 1 110
byte 1 47
byte 1 115
byte 1 104
byte 1 111
byte 1 116
byte 1 103
byte 1 117
byte 1 110
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $86
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 115
byte 1 104
byte 1 111
byte 1 116
byte 1 103
byte 1 117
byte 1 110
byte 1 0
align 1
LABELV $85
byte 1 71
byte 1 97
byte 1 117
byte 1 110
byte 1 116
byte 1 108
byte 1 101
byte 1 116
byte 1 0
align 1
LABELV $84
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 119
byte 1 95
byte 1 103
byte 1 97
byte 1 117
byte 1 110
byte 1 116
byte 1 108
byte 1 101
byte 1 116
byte 1 0
align 1
LABELV $83
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 115
byte 1 50
byte 1 47
byte 1 103
byte 1 97
byte 1 117
byte 1 110
byte 1 116
byte 1 108
byte 1 101
byte 1 116
byte 1 47
byte 1 103
byte 1 97
byte 1 117
byte 1 110
byte 1 116
byte 1 108
byte 1 101
byte 1 116
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $82
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 109
byte 1 105
byte 1 115
byte 1 99
byte 1 47
byte 1 119
byte 1 95
byte 1 112
byte 1 107
byte 1 117
byte 1 112
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $81
byte 1 119
byte 1 101
byte 1 97
byte 1 112
byte 1 111
byte 1 110
byte 1 95
byte 1 103
byte 1 97
byte 1 117
byte 1 110
byte 1 116
byte 1 108
byte 1 101
byte 1 116
byte 1 0
align 1
LABELV $80
byte 1 77
byte 1 101
byte 1 103
byte 1 97
byte 1 32
byte 1 72
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 0
align 1
LABELV $79
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 104
byte 1 95
byte 1 109
byte 1 101
byte 1 103
byte 1 97
byte 1 0
align 1
LABELV $78
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 109
byte 1 101
byte 1 103
byte 1 97
byte 1 95
byte 1 115
byte 1 112
byte 1 104
byte 1 101
byte 1 114
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $77
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 109
byte 1 101
byte 1 103
byte 1 97
byte 1 95
byte 1 99
byte 1 114
byte 1 111
byte 1 115
byte 1 115
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $76
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 109
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $75
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 95
byte 1 109
byte 1 101
byte 1 103
byte 1 97
byte 1 0
align 1
LABELV $74
byte 1 53
byte 1 48
byte 1 32
byte 1 72
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 0
align 1
LABELV $73
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 104
byte 1 95
byte 1 114
byte 1 101
byte 1 100
byte 1 0
align 1
LABELV $72
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 108
byte 1 97
byte 1 114
byte 1 103
byte 1 101
byte 1 95
byte 1 115
byte 1 112
byte 1 104
byte 1 101
byte 1 114
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $71
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 108
byte 1 97
byte 1 114
byte 1 103
byte 1 101
byte 1 95
byte 1 99
byte 1 114
byte 1 111
byte 1 115
byte 1 115
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $70
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 108
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $69
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 95
byte 1 108
byte 1 97
byte 1 114
byte 1 103
byte 1 101
byte 1 0
align 1
LABELV $68
byte 1 50
byte 1 53
byte 1 32
byte 1 72
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 0
align 1
LABELV $67
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 104
byte 1 95
byte 1 121
byte 1 101
byte 1 108
byte 1 108
byte 1 111
byte 1 119
byte 1 0
align 1
LABELV $66
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 109
byte 1 101
byte 1 100
byte 1 105
byte 1 117
byte 1 109
byte 1 95
byte 1 115
byte 1 112
byte 1 104
byte 1 101
byte 1 114
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $65
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 109
byte 1 101
byte 1 100
byte 1 105
byte 1 117
byte 1 109
byte 1 95
byte 1 99
byte 1 114
byte 1 111
byte 1 115
byte 1 115
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $64
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 110
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $63
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 0
align 1
LABELV $62
byte 1 53
byte 1 32
byte 1 72
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 0
align 1
LABELV $61
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 104
byte 1 95
byte 1 103
byte 1 114
byte 1 101
byte 1 101
byte 1 110
byte 1 0
align 1
LABELV $60
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 115
byte 1 109
byte 1 97
byte 1 108
byte 1 108
byte 1 95
byte 1 115
byte 1 112
byte 1 104
byte 1 101
byte 1 114
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $59
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 47
byte 1 115
byte 1 109
byte 1 97
byte 1 108
byte 1 108
byte 1 95
byte 1 99
byte 1 114
byte 1 111
byte 1 115
byte 1 115
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $58
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 115
byte 1 47
byte 1 115
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $57
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 104
byte 1 101
byte 1 97
byte 1 108
byte 1 116
byte 1 104
byte 1 95
byte 1 115
byte 1 109
byte 1 97
byte 1 108
byte 1 108
byte 1 0
align 1
LABELV $56
byte 1 72
byte 1 101
byte 1 97
byte 1 118
byte 1 121
byte 1 32
byte 1 65
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 0
align 1
LABELV $55
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 114
byte 1 95
byte 1 114
byte 1 101
byte 1 100
byte 1 0
align 1
LABELV $54
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 47
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 95
byte 1 114
byte 1 101
byte 1 100
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $53
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 95
byte 1 98
byte 1 111
byte 1 100
byte 1 121
byte 1 0
align 1
LABELV $52
byte 1 65
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 0
align 1
LABELV $51
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 114
byte 1 95
byte 1 121
byte 1 101
byte 1 108
byte 1 108
byte 1 111
byte 1 119
byte 1 0
align 1
LABELV $50
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 47
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 95
byte 1 121
byte 1 101
byte 1 108
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $49
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 109
byte 1 105
byte 1 115
byte 1 99
byte 1 47
byte 1 97
byte 1 114
byte 1 50
byte 1 95
byte 1 112
byte 1 107
byte 1 117
byte 1 112
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $48
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 95
byte 1 99
byte 1 111
byte 1 109
byte 1 98
byte 1 97
byte 1 116
byte 1 0
align 1
LABELV $47
byte 1 65
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 32
byte 1 83
byte 1 104
byte 1 97
byte 1 114
byte 1 100
byte 1 0
align 1
LABELV $46
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 115
byte 1 47
byte 1 105
byte 1 99
byte 1 111
byte 1 110
byte 1 114
byte 1 95
byte 1 115
byte 1 104
byte 1 97
byte 1 114
byte 1 100
byte 1 0
align 1
LABELV $45
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 47
byte 1 115
byte 1 104
byte 1 97
byte 1 114
byte 1 100
byte 1 95
byte 1 115
byte 1 112
byte 1 104
byte 1 101
byte 1 114
byte 1 101
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $44
byte 1 109
byte 1 111
byte 1 100
byte 1 101
byte 1 108
byte 1 115
byte 1 47
byte 1 112
byte 1 111
byte 1 119
byte 1 101
byte 1 114
byte 1 117
byte 1 112
byte 1 115
byte 1 47
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 47
byte 1 115
byte 1 104
byte 1 97
byte 1 114
byte 1 100
byte 1 46
byte 1 109
byte 1 100
byte 1 51
byte 1 0
align 1
LABELV $43
byte 1 115
byte 1 111
byte 1 117
byte 1 110
byte 1 100
byte 1 47
byte 1 109
byte 1 105
byte 1 115
byte 1 99
byte 1 47
byte 1 97
byte 1 114
byte 1 49
byte 1 95
byte 1 112
byte 1 107
byte 1 117
byte 1 112
byte 1 46
byte 1 119
byte 1 97
byte 1 118
byte 1 0
align 1
LABELV $42
byte 1 105
byte 1 116
byte 1 101
byte 1 109
byte 1 95
byte 1 97
byte 1 114
byte 1 109
byte 1 111
byte 1 114
byte 1 95
byte 1 115
byte 1 104
byte 1 97
byte 1 114
byte 1 100
byte 1 0
align 1
LABELV $41
byte 1 0
|
home/money.asm | opiter09/ASM-Machina | 1 | 27797 | <filename>home/money.asm
HasEnoughMoney::
; Check if the player has at least as much
; money as the 3-byte BCD value at hMoney.
ld de, wPlayerMoney
ld hl, hMoney
ld c, 3
jp StringCmp
HasEnoughCoins::
; Check if the player has at least as many
; coins as the 2-byte BCD value at hCoins.
ld de, wPlayerCoins
ld hl, hCoins
ld c, 2
jp StringCmp
|
oeis/128/A128619.asm | neoneye/loda-programs | 11 | 84186 | <filename>oeis/128/A128619.asm
; A128619: A127647 * A128174.
; Submitted by <NAME>
; 1,0,1,2,0,2,0,3,0,3,5,0,5,0,5,0,8,0,8,0,8,13,0,13,0,13,0,13,0,21,0,21,0,21,0,21,34,0,34,0,34,0,34,0,34,0,55,0,55,0,55,0,55,0,55
seq $0,128621 ; A127648 * A128174.
seq $0,45 ; Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.
|
Cubical/Homotopy/HopfInvariant/Brunerie.agda | thomas-lamiaux/cubical | 0 | 973 | {-
This file contains a proof of the fact that the Brunerie number,
i.e. absolute value of the Hopf invariant of [e , e] : π₃S², is 2.
Here, e is the generator of π₂S² and [_,_] denotes the Whitehead
product. The proof follows Proposition 5.4.4. in Brunerie (2016)
closely, but, for simplicity, considers only the case n = 2.
-}
{-# OPTIONS --safe --experimental-lossy-unification #-}
module Cubical.Homotopy.HopfInvariant.Brunerie where
open import Cubical.Homotopy.HopfInvariant.Base
open import Cubical.Homotopy.Group.Pi4S3.BrunerieNumber
open import Cubical.Homotopy.Group.Pi4S3.S3PushoutIso
open import Cubical.Homotopy.Whitehead
open import Cubical.ZCohomology.Base
open import Cubical.ZCohomology.GroupStructure
open import Cubical.ZCohomology.MayerVietorisUnreduced
open import Cubical.ZCohomology.Groups.Sn
open import Cubical.ZCohomology.Groups.Wedge
open import Cubical.ZCohomology.Groups.SphereProduct
open import Cubical.ZCohomology.RingStructure.CupProduct
open import Cubical.ZCohomology.RingStructure.RingLaws
open import Cubical.ZCohomology.RingStructure.GradedCommutativity
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Function
open import Cubical.Foundations.Pointed
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.GroupoidLaws
open import Cubical.Foundations.Equiv
open import Cubical.Data.Sigma
open import Cubical.Data.Int hiding (_+'_)
open import Cubical.Data.Nat hiding (_+_)
open import Cubical.Data.Unit
open import Cubical.Data.Sum renaming (rec to ⊎rec)
open import Cubical.HITs.Pushout
open import Cubical.HITs.S1
open import Cubical.HITs.Sn
open import Cubical.HITs.Join
open import Cubical.HITs.Susp
open import Cubical.HITs.Wedge
open import Cubical.HITs.Truncation
open import Cubical.HITs.SetTruncation
renaming (elim to sElim ; elim2 to sElim2 ; map to sMap)
open import Cubical.HITs.PropositionalTruncation
renaming (map to pMap ; rec to pRec)
open import Cubical.Algebra.Group
open import Cubical.Algebra.Group.ZAction
open import Cubical.Algebra.Group.Exact
open import Cubical.Algebra.Group.Morphisms
open import Cubical.Algebra.Group.MorphismProperties
open import Cubical.Algebra.Group.Instances.Int
open import Cubical.Algebra.Group.Instances.Unit
open Iso
open IsGroupHom
open PlusBis
-- Some abstract versions of imported lemmas/definitions from
-- ZCohomology.Groups.SphereProduct for faster type checking.
abstract
H²-genₗabs : coHom 2 (S₊ 2 × S₊ 2)
H²-genₗabs = H²-S²×S²-genₗ
H²-genᵣabs : coHom 2 (S₊ 2 × S₊ 2)
H²-genᵣabs = H²-S²×S²-genᵣ
Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs : (n m : ℕ)
→ GroupIso (coHomGr ((suc n) +' (suc m))
(S₊ (suc n) × S₊ (suc m)))
ℤGroup
Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs = Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ
Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs≡ : (n m : ℕ)
→ Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs n m ≡ Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ n m
Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs≡ n m = refl
Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-⌣ :
fun (fst (Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs 1 1))
(H²-S²×S²-genₗ ⌣ H²-S²×S²-genᵣ)
≡ 1
Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-⌣ =
fun (fst (Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs 1 1)) (H²-S²×S²-genₗ ⌣ H²-S²×S²-genᵣ)
≡⟨ cong (fun (fst (Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs 1 1))) (sym H²-S²≅H⁴-S²×S²⌣) ⟩
fun (fst (Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs 1 1)) (fun (fst (H²-S²≅H⁴-S²×S²)) ∣ ∣_∣ₕ ∣₂)
≡⟨ speedUp ∣_∣ₕ ⟩
fun (fst (Hⁿ-Sⁿ≅ℤ 1)) ∣ ∣_∣ₕ ∣₂
≡⟨ refl ⟩ -- Computation! :-)
1 ∎
where
speedUp : (f : _) →
fun (fst (Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs 1 1)) (fun (fst (H²-S²≅H⁴-S²×S²)) ∣ f ∣₂)
≡ fun (fst (Hⁿ-Sⁿ≅ℤ 1)) ∣ f ∣₂
speedUp f i =
fun (fst (Hⁿ-Sⁿ≅ℤ 1)) (leftInv (fst H²-S²≅H⁴-S²×S²) ∣ f ∣₂ i)
-- Some abbreviations
private
inl' : S₊ 2 × S₊ 2 → Pushout⋁↪fold⋁ (S₊∙ 2)
inl' = inl
qHom : GroupHom (coHomGr 4 (Pushout⋁↪fold⋁ (S₊∙ 2)))
(coHomGr 4 (S₊ 2 × S₊ 2))
qHom = coHomMorph 4 inl'
qHomGen : (n : ℕ) →
GroupHom (coHomGr n (Pushout⋁↪fold⋁ (S₊∙ 2)))
(coHomGr n (S₊ 2 × S₊ 2))
qHomGen n = coHomMorph n inl'
-- The type C and generator α, β in dim 2 and 4 respectively
-- Recall, the goal is to prove that α ⌣ α = ±2 β
CHopf : Type
CHopf = HopfInvariantPush 0 fold∘W
Hopfαfold∘W = Hopfα 0 (fold∘W , refl)
Hopfβfold∘W = Hopfβ 0 (fold∘W , refl)
-- Rewriting CHopf as our favourite pushout
-- S²×S² ← S²∨S² → S²
CHopfIso : Iso CHopf (Pushout⋁↪fold⋁ (S₊∙ 2))
CHopfIso =
compIso (invIso (equivToIso
(compEquiv (compEquiv pushoutSwitchEquiv
(isoToEquiv (PushoutDistr.PushoutDistrIso fold⋁ W λ _ → tt)))
pushoutSwitchEquiv)))
(equivToIso Pushout-coFibW-fold⋁≃Pushout⋁↪fold⋁)
-- Cohomology group version of the Iso
coHomCHopfIso : (n : ℕ)
→ GroupIso (coHomGr n CHopf) (coHomGr n (Pushout⋁↪fold⋁ (S₊∙ 2)))
coHomCHopfIso n = invGroupIso (coHomIso n CHopfIso)
-- We instantiate Mayer-Vietoris for the pushout
module MV-⋁↪-fold⋁ = MV _ _ (S₊∙ 2 ⋁ S₊∙ 2) ⋁↪ fold⋁
-- This give us an iso H⁴(S²×S² ← S²∨S² → S²) ≅ H⁴(S²×S²)
isEquiv-qHom : GroupEquiv (coHomGr 4 (Pushout⋁↪fold⋁ (S₊∙ 2)))
(coHomGr 4 (S₊ 2 × S₊ 2))
fst (fst isEquiv-qHom) = qHom .fst
snd (fst isEquiv-qHom) =
subst isEquiv
(funExt (sElim (λ _ → isSetPathImplicit) (λ _ → refl)))
(×UnitEquiv (isoToPath
(invIso
(fst (Hⁿ-Sᵐ≅0 3 1 λ p → snotz (cong predℕ p)))))
_ isEquiv-i)
where
×UnitEquiv : {A B C : Type}
→ Unit ≡ C
→ (f : A → B × C)
→ isEquiv f
→ isEquiv (fst ∘ f)
×UnitEquiv {A = A} {B = B} =
J (λ C _ → (f : A → B × C) → isEquiv f → isEquiv (fst ∘ f))
λ f eq → record { equiv-proof =
λ b → ((fst (fst (equiv-proof eq (b , tt))))
, cong fst (fst (equiv-proof eq (b , tt)) .snd))
, λ y → ΣPathP ((cong fst (equiv-proof eq (b , tt)
.snd ((fst y)
, ΣPathP ((snd y) , refl))))
, λ i j → equiv-proof eq (b , tt) .snd ((fst y)
, ΣPathP ((snd y) , refl)) i .snd j .fst) }
isEquiv-i : isEquiv (fst (MV-⋁↪-fold⋁.i 4))
isEquiv-i =
SES→isEquiv
(isContr→≡UnitGroup
(isOfHLevelRetractFromIso 0
(compIso
(fst (Hⁿ-⋁ (S₊∙ 2) (S₊∙ 2) 2))
(compIso
(prodIso (fst (Hⁿ-Sᵐ≅0 2 1 λ p → snotz (cong predℕ p)))
(fst (Hⁿ-Sᵐ≅0 2 1 λ p → snotz (cong predℕ p))))
rUnit×Iso))
isContrUnit))
((isContr→≡UnitGroup
(isOfHLevelRetractFromIso 0
(compIso
(fst (Hⁿ-⋁ (S₊∙ 2) (S₊∙ 2) 3))
(compIso
(prodIso (fst (Hⁿ-Sᵐ≅0 3 1 λ p → snotz (cong predℕ p)))
(fst (Hⁿ-Sᵐ≅0 3 1 λ p → snotz (cong predℕ p))))
rUnit×Iso))
isContrUnit)))
(MV-⋁↪-fold⋁.d 3)
(MV-⋁↪-fold⋁.i 4)
(MV-⋁↪-fold⋁.Δ 4)
(MV-⋁↪-fold⋁.Ker-i⊂Im-d 3)
(MV-⋁↪-fold⋁.Ker-Δ⊂Im-i 4)
snd isEquiv-qHom = qHom .snd
-- The goal now is reducing α ⌣ α = ±2 β to gₗ ⌣ gᵣ = e for
-- gₗ, gᵣ generators of H²(S²×S²) ≅ ℤ × ℤ and e generator of
-- H⁴(S²×S²) ≅ ℤ. This essentially just elementary linear algebra at
-- this point. We do it for an arbitrary (well-behaved) iso
-- H⁴(S²×S²) ≅ ℤ in order to speed up type checking.
module BrunerieNumLem
(is : GroupIso (coHomGr 4 (S₊ 2 × S₊ 2)) ℤGroup)
(isEq : (fun (fst is) (H²-S²×S²-genₗ ⌣ H²-S²×S²-genᵣ) ≡ 1)) where
x = H²-S²×S²-genₗ
y = H²-S²×S²-genᵣ
α = Hopfαfold∘W
β = Hopfβfold∘W
α' : coHom 2 (Pushout⋁↪fold⋁ (S₊∙ 2))
α' = fun (fst (coHomCHopfIso 2)) α
β' : coHom 4 (Pushout⋁↪fold⋁ (S₊∙ 2))
β' = fun (fst (coHomCHopfIso 4)) β
rewriteEquation :
(α' ⌣ α' ≡ β' +ₕ β') ⊎ (α' ⌣ α' ≡ -ₕ (β' +ₕ β'))
→ (α ⌣ α ≡ β +ₕ β) ⊎ (α ⌣ α ≡ -ₕ (β +ₕ β))
rewriteEquation (inl x) =
inl ((λ i → leftInv (fst (coHomCHopfIso 2)) α (~ i)
⌣ leftInv (fst (coHomCHopfIso 2)) α (~ i))
∙∙ cong (inv (fst (coHomCHopfIso 4))) x
∙∙ leftInv (fst (coHomCHopfIso 4)) (β +ₕ β))
rewriteEquation (inr x) =
inr ((λ i → leftInv (fst (coHomCHopfIso 2)) α (~ i)
⌣ leftInv (fst (coHomCHopfIso 2)) α (~ i))
∙∙ cong (inv (fst (coHomCHopfIso 4))) x
∙∙ leftInv (fst (coHomCHopfIso 4))
(-ₕ (β +ₕ β)))
rewriteEquation2 : (qHom .fst β' ≡ x ⌣ y) ⊎ (qHom .fst β' ≡ -ₕ (x ⌣ y))
rewriteEquation2 =
⊎rec
(λ p → inl (sym (leftInv (fst is) (qHom .fst β'))
∙∙ cong (inv (fst is)) (p ∙ sym isEq)
∙∙ leftInv (fst is) (x ⌣ y)))
(λ p → inr (sym (leftInv (fst is) (qHom .fst β'))
∙∙ cong (inv (fst is))
(p ∙ sym (cong (GroupStr.inv (snd ℤGroup)) isEq))
∙∙ (presinv (invGroupIso is .snd) (fun (fst is) (x ⌣ y))
∙ cong -ₕ_ (leftInv (fst is) (x ⌣ y)))))
eqs
where
grIso : GroupEquiv (coHomGr 4 (HopfInvariantPush 0 fold∘W)) ℤGroup
grIso = compGroupEquiv (GroupIso→GroupEquiv (coHomCHopfIso 4))
(compGroupEquiv
isEquiv-qHom
(GroupIso→GroupEquiv is))
eqs : (fst (fst grIso) β ≡ 1) ⊎ (fst (fst grIso) β ≡ -1)
eqs = groupEquivPresGen _ (GroupIso→GroupEquiv (Hopfβ-Iso 0 (fold∘W , refl)))
β (inl (Hopfβ↦1 0 (fold∘W , refl))) grIso
qpres⌣ : (x y : coHom 2 _)
→ fst qHom (x ⌣ y) ≡ fst (qHomGen 2) x ⌣ fst (qHomGen 2) y
qpres⌣ = sElim2 (λ _ _ → isSetPathImplicit) λ _ _ → refl
α'↦x+y : fst (qHomGen 2) α' ≡ x +ₕ y
α'↦x+y = lem ((coHomFun 2 (inv CHopfIso) α)) refl
where
lem : (x' : coHom 2 (Pushout⋁↪fold⋁ (S₊∙ 2)))
→ coHomFun 2 inr x' ≡ ∣ ∣_∣ ∣₂
→ fst (qHomGen 2) x' ≡ x +ₕ y
lem = sElim (λ _ → isSetΠ λ _ → isSetPathImplicit)
λ f p → Cubical.HITs.PropositionalTruncation.rec
(squash₂ _ _)
(λ r → cong ∣_∣₂ (funExt (uncurry
(wedgeconFun 1 1 (λ _ _ → isOfHLevelPath 4 (isOfHLevelTrunc 4) _ _)
(λ x → cong f (push (inr x)) ∙∙ funExt⁻ r x ∙∙ refl)
((λ x → cong f (push (inl x)) ∙∙ funExt⁻ r x ∙∙ sym (rUnitₖ 2 ∣ x ∣ₕ)))
(cong (_∙∙ funExt⁻ r north ∙∙ refl)
(cong (cong f) λ j i → push (push tt j) i))))))
(fun PathIdTrunc₀Iso p)
mainEq : ((fst qHom) (α' ⌣ α') ≡ qHom .fst (β' +ₕ β'))
⊎ ((fst qHom) (α' ⌣ α') ≡ qHom .fst (-ₕ (β' +ₕ β')))
mainEq =
⊎rec
(λ id → inl (lem₁ ∙ lem₂
∙ cong (λ x → x +ₕ x) (sym id)
∙ sym (pres· (snd qHom) β' β')))
(λ id → inr (lem₁ ∙ lem₂
∙ ((sym (distLem (x ⌣ y))
∙ cong -ₕ_ (cong (λ x → x +ₕ x) (sym id)))
∙ cong (-ₕ_) (pres· (snd qHom) β' β'))
∙ sym (presinv (snd qHom) (β' +ₕ β'))))
rewriteEquation2
where
triv⌣ : (a : S¹)
→ cong₂ (_⌣ₖ_ {n = 2} {m = 2}) (cong ∣_∣ₕ (merid a)) (cong ∣_∣ₕ (merid a))
≡ λ _ → ∣ north ∣ₕ
triv⌣ a =
cong₂Funct (_⌣ₖ_ {n = 2} {m = 2})
(cong ∣_∣ₕ (merid a)) (cong ∣_∣ₕ (merid a))
∙ sym (rUnit λ j → _⌣ₖ_ {n = 2} {m = 2} ∣ merid a j ∣ₕ ∣ north ∣)
∙ (λ i j → ⌣ₖ-0ₖ 2 2 ∣ merid a j ∣ₕ i)
distLem : (x : coHom 4 (S₊ 2 × S₊ 2)) → -ₕ ((-ₕ x) +ₕ (-ₕ x)) ≡ x +ₕ x
distLem =
sElim (λ _ → isSetPathImplicit)
λ f → cong ∣_∣₂ (funExt λ x → cong -ₖ_ (sym (-distrₖ 4 (f x) (f x)))
∙ -ₖ^2 (f x +ₖ f x))
x⌣x≡0 : x ⌣ x ≡ 0ₕ 4
x⌣x≡0 =
cong ∣_∣₂
(funExt (uncurry λ { north y → refl
; south y → refl
; (merid a i) y j → triv⌣ a j i}))
y⌣y≡0 : y ⌣ y ≡ 0ₕ 4
y⌣y≡0 =
cong ∣_∣₂
(funExt (uncurry λ { x north → refl
; x south → refl
; x (merid a i) j → triv⌣ a j i}))
-ₕ'Id : (x : coHom 4 (S₊ 2 × S₊ 2)) → (-ₕ'^ 2 · 2) x ≡ x
-ₕ'Id =
sElim (λ _ → isSetPathImplicit)
λ f → cong ∣_∣₂ (funExt λ x → -ₖ'-gen-inl-left 2 2 tt (inl tt) (f x))
y⌣x≡x⌣y : y ⌣ x ≡ x ⌣ y
y⌣x≡x⌣y =
y ⌣ x ≡⟨ gradedComm'-⌣ 2 2 y x ⟩
(-ₕ'^ 2 · 2) (transport refl (x ⌣ y)) ≡⟨ -ₕ'Id (transport refl (x ⌣ y)) ⟩
transport refl (x ⌣ y) ≡⟨ transportRefl (x ⌣ y) ⟩
x ⌣ y ∎
lem₂ : (x +ₕ y) ⌣ (x +ₕ y) ≡ (x ⌣ y) +ₕ (x ⌣ y)
lem₂ =
(x +ₕ y) ⌣ (x +ₕ y) ≡⟨ leftDistr-⌣ 2 2 (x +ₕ y) x y ⟩
((x +ₕ y) ⌣ x) +ₕ ((x +ₕ y) ⌣ y) ≡⟨ cong₂ _+ₕ_ (rightDistr-⌣ 2 2 x y x) (rightDistr-⌣ 2 2 x y y) ⟩
((x ⌣ x +ₕ y ⌣ x)) +ₕ (x ⌣ y +ₕ y ⌣ y) ≡⟨ cong₂ _+ₕ_ (cong (_+ₕ y ⌣ x) x⌣x≡0 ∙ lUnitₕ 4 (y ⌣ x))
(cong (x ⌣ y +ₕ_) y⌣y≡0 ∙ rUnitₕ 4 (x ⌣ y)) ⟩
y ⌣ x +ₕ x ⌣ y ≡⟨ cong (_+ₕ (x ⌣ y)) y⌣x≡x⌣y ⟩
((x ⌣ y) +ₕ (x ⌣ y)) ∎
lem₁ : (fst qHom) (α' ⌣ α') ≡ (x +ₕ y) ⌣ (x +ₕ y)
lem₁ =
fst qHom (α' ⌣ α') ≡⟨ refl ⟩
fst (qHomGen 2) α' ⌣ fst (qHomGen 2) α' ≡⟨ cong (λ x → x ⌣ x) α'↦x+y ⟩
((x +ₕ y) ⌣ (x +ₕ y)) ∎
main⊎ : (HopfInvariant 0 (fold∘W , refl) ≡ 2)
⊎ (HopfInvariant 0 (fold∘W , refl) ≡ -2)
main⊎ =
⊎rec (λ p → inl (lem₁
∙ cong (fun (fst (Hopfβ-Iso 0 (fold∘W , refl)))) p
∙ pres· (Hopfβ-Iso 0 (fold∘W , refl) .snd) β β
∙ cong (λ x → x + x) (Hopfβ↦1 0 (fold∘W , refl))))
(λ p → inr (lem₁
∙ cong (fun (fst (Hopfβ-Iso 0 (fold∘W , refl)))) p
∙ presinv (Hopfβ-Iso 0 (fold∘W , refl) .snd) (β +ₕ β)
∙ cong (GroupStr.inv (snd ℤGroup))
(pres· (Hopfβ-Iso 0 (fold∘W , refl) .snd) β β
∙ cong (λ x → x + x) (Hopfβ↦1 0 (fold∘W , refl)))))
lem₂
where
lem₁ : HopfInvariant 0 (fold∘W , refl)
≡ fun (fst (Hopfβ-Iso 0 (fold∘W , refl))) (α ⌣ α)
lem₁ =
cong (fun (fst (Hopfβ-Iso 0 (fold∘W , refl)))) (transportRefl (α ⌣ α))
lem₂ : (α ⌣ α ≡ β +ₕ β) ⊎ (α ⌣ α ≡ -ₕ (β +ₕ β))
lem₂ =
rewriteEquation
(⊎rec (λ p → inl (sym (retEq (fst isEquiv-qHom) (α' ⌣ α'))
∙∙ cong (invEq (fst isEquiv-qHom)) p
∙∙ retEq (fst isEquiv-qHom) (β' +ₕ β')))
(λ p → inr ((sym (retEq (fst isEquiv-qHom) (α' ⌣ α'))
∙∙ cong (invEq (fst isEquiv-qHom)) p
∙∙ retEq (fst isEquiv-qHom) (-ₕ (β' +ₕ β')))))
mainEq)
main : abs (HopfInvariant 0 (fold∘W , refl)) ≡ 2
main = ⊎→abs _ 2 main⊎
-- We instantiate the module
Brunerie'≡2 : abs (HopfInvariant 0 (fold∘W , refl)) ≡ 2
Brunerie'≡2 = BrunerieNumLem.main (Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-abs 1 1) Hⁿ⁺ᵐ-Sⁿ×Sᵐ≅ℤ-⌣
-- We rewrite the it slightly, to get the definition of the Brunerie
-- number in Brunerie (2016)
Brunerie'≡Brunerie : [ ∣ idfun∙ (S₊∙ 2) ∣₂ ∣ ∣ idfun∙ (S₊∙ 2) ∣₂ ]π' ≡ ∣ fold∘W , refl ∣₂
Brunerie'≡Brunerie =
cong ∣_∣₂ ([]≡[]₂ (idfun∙ (S₊∙ 2)) (idfun∙ (S₊∙ 2)) )
∙ sym fold∘W≡Whitehead
∙ cong ∣_∣₂ (∘∙-idˡ (fold∘W , refl))
-- And we get the main result
Brunerie≡2 : Brunerie ≡ 2
Brunerie≡2 =
cong abs (cong (HopfInvariant-π' 0) Brunerie'≡Brunerie)
∙ Brunerie'≡2
|
alloy4fun_models/trashltl/models/4/adPyxDyyFsbSqAqjY.als | Kaixi26/org.alloytools.alloy | 0 | 4706 | open main
pred idadPyxDyyFsbSqAqjY_prop5 {
eventually (some f:File | f in Trash)
}
pred __repair { idadPyxDyyFsbSqAqjY_prop5 }
check __repair { idadPyxDyyFsbSqAqjY_prop5 <=> prop5o } |
Tareas/tarea_bl_1.asm | adeandak/OPC | 0 | 27049 | INCLUDE \masm32\Irvine\Irvine32.inc
INCLUDELIB \masm32\Irvine\Irvine32.lib
INCLUDELIB \masm32\Irvine\User32.lib
INCLUDELIB \masm32\Irvine\Kernel32.lib
.DATA
; Textos para la Consola
micr = 0Dh
milf = 0Ah
txtn BYTE micr, milf, "Teclee el dato N: ", 0
txtst BYTE "Termino ", 0
txttot BYTE micr, milf, "TOTAL: ", 0
error BYTE micr, milf, "ERROR. N fuera de rango.", micr, milf, 0
adios BYTE micr, milf, "ADIOS.", micr, milf, 0
; variables
n SDWORD ?
suma SDWORD 0
i DWORD 1
ant SDWORD 0
act SDWORD 0
signo SDWORD 1
.CODE
main proc
mov EDX, OFFSET txtn
call WriteString
call ReadInt ; Dato en EAX
mov n,EAX
.WHILE n<1
mov EDX, OFFSET error
call WriteString
call Crlf
mov EDX, OFFSET txtn
call WriteString
call ReadInt ; Dato en EAX
mov n, EAX
.ENDW
;call DumpRegs
MOV ESI, n
INC ESI
MOV ECX, 0
.WHILE (i<ESI)
NEG signo
MOV EAX, ant
MOV EBX, i
IMUL EBX, i
IMUL EBX, signo
ADD EAX, EBX
MOV ant, EAX
ADD ECX, EAX
mov EDX, OFFSET txtst
call WriteString ;imprimimos el termino
mov EAX, i
call WriteInt
mov AL, ' '
call WriteChar
mov EAX, ant
call WriteInt
call Crlf
INC i
.ENDW
MOV EDX, offset txttot
call WriteString
mov EAX, ECX
call WriteInt
mov edx, offset adios
call WriteString
call crlf
main ENDP
END main |
models/aleks/fast.als | transclosure/Amalgam | 4 | 3317 | <gh_stars>1-10
sig A {}
sig Relation { r: (A -> A -> A) -> one A }
run {} for 1 |
src/desktop.ads | docandrew/troodon | 5 | 24598 | <gh_stars>1-10
with xcb; use xcb;
with xproto; use xproto;
with Render;
package Desktop is
DesktopException : exception;
---------------------------------------------------------------------------
-- getWindow
-- Return the X11 window corresponding to the desktop, e.g. for drawing it.
---------------------------------------------------------------------------
function getWindow return xproto.xcb_window_t;
---------------------------------------------------------------------------
-- changeWallpaper
-- Given a filename, set the wallpaper to be the image contained therein
-- Redraws the window.
---------------------------------------------------------------------------
procedure changeWallpaper (c : access xcb_connection_t;
rend : Render.Renderer;
filename : String);
---------------------------------------------------------------------------
-- draw
-- Render the desktop (just wallpaper for now)
-- @TODO and widgets, and icons, etc.
-- @Note that the Desktop uses the same window VBO and shader program that
-- the compositor does. Do NOT call this from w/in Compositor.renderScene
---------------------------------------------------------------------------
procedure draw (rend : Render.Renderer);
---------------------------------------------------------------------------
-- start
-- Creates a window for the wallpaper and desktop icons. This will make the
-- GLX context set up in Render current, so after this point it is safe to
-- initialize shaders, etc.
--
-- @TODO create window for each randr screen
---------------------------------------------------------------------------
procedure start (c : access xcb_connection_t;
rend : Render.Renderer);
---------------------------------------------------------------------------
-- stop
-- Destroy the GLX and X11 windows used by the desktop.
---------------------------------------------------------------------------
procedure stop (c : access xcb_connection_t;
rend : Render.Renderer);
end Desktop; |
asm/proc.asm | alexandru-dinu/programming-practice | 0 | 12122 | <reponame>alexandru-dinu/programming-practice<gh_stars>0
.model small
.stack 100h
.data
str db 'ce nice e assembly'
len equ $ - str
.code
; printing macro
macro print p
mov dl, p
mov ah, 02h
int 21h
endm print
; iterate through array and print its contents
proc printiter str, len
lea si, str
mov cx, len
iter:
print [si]
inc si
loop iter
ret
endp
; main entry point
main:
mov ax, @data
mov ds, ax
call printiter str, len
exit:
mov ah, 4ch
int 21h
end main |
src/main/fragment/mos6502-common/vwsm1_gt_pwsc1_derefidx_vbuyy_then_la1.asm | jbrandwood/kickc | 2 | 164222 | <reponame>jbrandwood/kickc<gh_stars>1-10
lda {c1},y
cmp {m1}
lda {c1}+1,y
sbc {m1}+1
bvc !+
eor #$80
!:
bmi {la1}
|
source/ada.ads | ytomino/drake | 33 | 2002 | <filename>source/ada.ads
pragma License (Unrestricted);
package Ada is
pragma Pure;
-- extended
-- This package creates usable debug output.
-- It is placed in the package Ada directly,
-- therefore it does not need to write any additional "with" clause.
package Debug is
function File return String
with Import, Convention => Intrinsic;
function Line return Positive
with Import, Convention => Intrinsic;
function Source_Location return String
with Import, Convention => Intrinsic;
function Enclosing_Entity return String
with Import, Convention => Intrinsic;
function Compilation_ISO_Date return String
with Import, Convention => Intrinsic;
function Compilation_Date return String
with Import, Convention => Intrinsic;
function Compilation_Time return String
with Import, Convention => Intrinsic;
procedure Put (
S : String;
Source_Location : String := Debug.Source_Location;
Enclosing_Entity : String := Debug.Enclosing_Entity)
with Import, Convention => Ada, External_Name => "__drake_debug_put";
function Put (
S : String;
Source_Location : String := Debug.Source_Location;
Enclosing_Entity : String := Debug.Enclosing_Entity)
return Boolean -- always True to use in pragma Assert/Check
with Import, Convention => Ada, External_Name => "__drake_debug_put";
end Debug;
end Ada;
|
src/console/include.asm | jhm-ciberman/calculator-asm | 2 | 92960 | include 'ConsoleInit.asm'
include 'ConsoleClear.asm'
include 'ConsoleAddCommand.asm'
include 'ConsoleFlushBuffers.asm'
include 'ConsoleInputHandle.asm'
include 'ConsolePrint.asm'
include 'ConsolePrintLine.asm'
include 'ConsolePrintChar.asm' |
oeis/156/A156531.asm | neoneye/loda-programs | 11 | 16880 | ; A156531: Denominator of Euler(n, 1/17).
; Submitted by <NAME>
; 1,34,289,19652,83521,2839714,24137569,3282709384,6975757441,237175752994,2015993900449,137087585230532,582622237229761,19809156065811874,168377826559400929,45798768824157052688,48661191875666868481,1654480523772673528354,14063084452067724991009,956289742740605299388612,4064231406647572522401601,138183867826017465761654434,1174562876521148458974062689,159740551206876190420472525704,339448671314611904643504117121,11541254824696804757879139982114,98100666009922840441972689847969
add $0,1
mov $2,$0
mov $3,17
pow $3,$0
lpb $0
lpb $2
dif $2,2
mov $0,$2
mul $3,2
lpe
lpe
mov $0,$3
div $0,17
|
stm32f0/stm32gd-gpio-irq.ads | ekoeppen/STM32_Generic_Ada_Drivers | 1 | 27897 | with STM32GD.GPIO.Pin;
generic
with package Pin is new STM32GD.GPIO.Pin (<>);
package STM32GD.GPIO.IRQ is
procedure Configure_Trigger (Event : Boolean := False; Rising : Boolean := False; Falling : Boolean := False);
procedure Wait_For_Trigger;
procedure Clear_Trigger;
function Triggered return Boolean;
procedure Cancel_Wait;
end STM32GD.GPIO.IRQ;
|
src/toml-generic_dump.adb | pmderodat/ada-toml | 19 | 13104 | with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
procedure TOML.Generic_Dump (Stream : in out Output_Stream; Value : TOML_Value)
is
procedure Put (Bytes : String);
-- Shortcut for Put (Stream, Bytes)
type Map_Pair is record
Key : Unbounded_UTF8_String;
Value : TOML_Value;
end record;
type Map_Pair_Array is array (Positive range <>) of Map_Pair;
function Format_String
(S : Unbounded_UTF8_String) return Unbounded_UTF8_String;
-- Format a valid TOML representation of the given string (S)
function Format_Key
(Key : Unbounded_UTF8_String) return Unbounded_UTF8_String;
-- Format a valid TOML representation of the given Key
function Append_Key
(Prefix, Suffix : Unbounded_UTF8_String) return Unbounded_UTF8_String;
-- Return a key corresponding to "Prefix.Suffix" (if Prefix is not empty)
-- or "Suffix" (if Prefix is empty).
procedure Separate_Pairs
(Pairs : in out Map_Pair_Array;
Last_Table_Pair : out Natural;
Last_Array_Pair : out Natural)
with Pre => Pairs'First = 1;
-- Shuffle Pairs so that, after the procedure returns:
--
-- * Pairs (Pairs'First .. Last_Table_Pair) contains only table values;
-- * Pairs (Last_Table_Pair + 1 .. Last_Array_Pair) contains only
-- array-of-tables values;
-- * Pairs (Last_Array_Pair + 1 .. Pairs'Last) contains remaining values.
--
-- The three array sub-ranges are sorted by key.
procedure Put_Table_Header
(Prefix, Suffix : Unbounded_UTF8_String;
Nested_Key : out Unbounded_UTF8_String);
-- Set Nested_Key to Append_Key (Prefix, Suffix). Then write a table header
-- for Nested_Key to Stream.
procedure Put_Array_Header (Nested_Key : Unbounded_UTF8_String);
-- Write an array of tables header for Nested_Key to Stream
procedure Dump_Toplevel_Table
(Key : Unbounded_UTF8_String; Value : TOML_Value)
with Pre => Value.Kind = TOML_Table;
-- Dump the given table (Value) as a top-level table, under the given key
procedure Dump_Toplevel_Array
(Parent_Key, Array_Key : Unbounded_UTF8_String; Array_Value : TOML_Value)
with Pre => Array_Value.Kind = TOML_Array;
-- Dump the given array (Array_Value) as a top-level array of tables, under
-- the given keys (Parent_Key "." Array_Key).
function Strip_Number (Image : String) return String;
-- If the first character in Image is a space, return the rest of Image
function Pad_Number (Image : String; Digit_Count : Positive) return String;
-- Return Strip_Number (Image) left-padded with 0 so that the result is
-- Digit_Count long.
procedure Dump_Inline (Value : TOML_Value)
with Pre => Value /= No_TOML_Value;
-- Dump the given value using the inline format
---------
-- Put --
---------
procedure Put (Bytes : String) is
begin
Put (Stream, Bytes);
end Put;
-------------------
-- Format_String --
-------------------
function Format_String
(S : Unbounded_UTF8_String) return Unbounded_UTF8_String
is
Result : Unbounded_UTF8_String;
begin
Append (Result, """");
for I in 1 .. Length (S) loop
-- Forward printable ASCII bytes (except quotes and backslashes)
-- and non-ASCII bytes, but emit escapes for quotes and control
-- characters.
declare
Char : constant Character := Element (S, I);
begin
case Char is
-- The only way to represent the following control characters
-- is to use the unicode escape (\uXXXX).
when ASCII.NUL .. ASCII.BEL
| ASCII.VT
| ASCII.SO .. ASCII.US
| ASCII.DEL
=>
declare
use type Interfaces.Unsigned_8;
Byte : Interfaces.Unsigned_8 := Character'Pos (Char);
Repr : String (1 .. 6) := "\u0000";
I : Natural range 3 .. 6 := 6;
begin
while Byte /= 0 loop
declare
Nibble : constant Interfaces.Unsigned_8 :=
Byte mod 16;
Digit : Interfaces.Unsigned_8;
begin
if Nibble <= 9 then
Digit := Character'Pos ('0') + Nibble;
else
Digit := Character'Pos ('a') - 10 + Nibble;
end if;
Repr (I) := Character'Val (Digit);
Byte := Byte / 16;
I := I - 1;
end;
end loop;
Append (Result, Repr);
end;
-- The following control characters have dedicated escape
-- sequences:
when ASCII.BS => Append (Result, "\b");
when ASCII.HT => Append (Result, "\t");
when ASCII.LF => Append (Result, "\n");
when ASCII.FF => Append (Result, "\f");
when ASCII.CR => Append (Result, "\r");
-- Quotes and backslashes must be escaped
when '"' => Append (Result, "\""");
when '\' => Append (Result, "\\");
-- All other bytes can be directly forwarded to the string
-- literal.
when ' ' | '!'
| '#' .. '['
| ']' .. '~'
| Character'Val (128) .. Character'Val(255)
=>
Append (Result, Char);
end case;
end;
end loop;
Append (Result, """");
return Result;
end Format_String;
----------------
-- Format_Key --
----------------
function Format_Key
(Key : Unbounded_UTF8_String) return Unbounded_UTF8_String is
begin
-- Determine if we need to quote Key, and if so, do it
for I in 1 .. Length (Key) loop
if Element (Key, I) not in
'0' .. '9' | 'A' .. 'Z' | 'a' .. 'z' | '-' | '_'
then
return Format_String (Key);
end if;
end loop;
if Length (Key) = 0 then
return Format_String (Key);
end if;
-- Otherwise, we can return the key as-is (without quoting)
return Key;
end Format_Key;
----------------
-- Append_Key --
----------------
function Append_Key
(Prefix, Suffix : Unbounded_UTF8_String) return Unbounded_UTF8_String
is
Result : Unbounded_UTF8_String := Prefix;
begin
if Length (Result) > 0 then
Append (Result, ".");
end if;
Append (Result, Format_Key (Suffix));
return Result;
end Append_Key;
--------------------
-- Separate_Pairs --
--------------------
procedure Separate_Pairs
(Pairs : in out Map_Pair_Array;
Last_Table_Pair : out Natural;
Last_Array_Pair : out Natural)
is
type Pair_List is record
Pairs : Map_Pair_Array (Separate_Pairs.Pairs'Range);
Last : Natural := 0;
end record;
procedure Append (Pair : Map_Pair; List : in out Pair_List);
-- Append Pair to the given List
procedure Append
(List : Pair_List; First_Pair : Positive; Last_Pair : out Natural);
-- Append all pairs in List to Pairs. The first one goes to:
--
-- Pairs (First_Pair)
--
-- and the last one is copied to:
--
-- Pairs (Last_Pair)
------------
-- Append --
------------
procedure Append (Pair : Map_Pair; List : in out Pair_List) is
begin
List.Last := List.Last + 1;
List.Pairs (List.Last) := Pair;
end Append;
------------
-- Append --
------------
procedure Append
(List : Pair_List; First_Pair : Positive; Last_Pair : out Natural)
is
begin
Last_Pair := First_Pair - 1;
for P of List.Pairs (1 .. List.Last) loop
Last_Pair := Last_Pair + 1;
Pairs (Last_Pair) := P;
end loop;
end Append;
Table_Pairs, Array_Pairs, Other_Pairs : Pair_List;
Last : Natural;
begin
-- Put pairs in separate lists. Note that this preserves sorting.
for P of Pairs loop
case P.Value.Kind is
when TOML_Table =>
Append (P, Table_Pairs);
when TOML_Array =>
if (for all I in 1 .. P.Value.Length =>
P.Value.Item (I).Kind = TOML_Table)
then
Append (P, Array_Pairs);
else
Append (P, Other_Pairs);
end if;
when others =>
Append (P, Other_Pairs);
end case;
end loop;
-- Then put back each category of pairs to Pairs
Append (Table_Pairs, Pairs'First, Last_Table_Pair);
Append (Array_Pairs, Last_Table_Pair + 1, Last_Array_Pair);
Append (Other_Pairs, Last_Array_Pair + 1, Last);
pragma Assert (Last = Pairs'Last);
end Separate_Pairs;
----------------------
-- Put_Table_Header --
----------------------
procedure Put_Table_Header
(Prefix, Suffix : Unbounded_UTF8_String;
Nested_Key : out Unbounded_UTF8_String) is
begin
Nested_Key := Append_Key (Prefix, Suffix);
Put ("[" & To_String (Nested_Key) & "]" & ASCII.LF);
end Put_Table_Header;
----------------------
-- Put_Array_Header --
----------------------
procedure Put_Array_Header (Nested_Key : Unbounded_UTF8_String) is
begin
Put ("[[" & To_String (Nested_Key) & "]]" & ASCII.LF);
end Put_Array_Header;
-------------------------
-- Dump_Toplevel_Table --
-------------------------
procedure Dump_Toplevel_Table
(Key : Unbounded_UTF8_String; Value : TOML_Value)
is
Keys : constant Key_Array := Value.Keys;
Pairs : Map_Pair_Array (Keys'Range);
Last_Table_Pair, Last_Array_Pair : Natural;
Nested_Key : Unbounded_UTF8_String;
begin
-- Initialize Pairs from Keys and Value and split pairs by value kind
for I in Keys'Range loop
Pairs (I) := (Key => Keys (I),
Value => Value.Get (Keys (I)));
end loop;
Separate_Pairs (Pairs, Last_Table_Pair, Last_Array_Pair);
declare
Table_Pairs : Map_Pair_Array renames
Pairs (Pairs'First .. Last_Table_Pair);
Array_Pairs : Map_Pair_Array renames
Pairs (Last_Table_Pair + 1 .. Last_Array_Pair);
Other_Pairs : Map_Pair_Array renames
Pairs (Last_Array_Pair + 1 .. Pairs'Last);
begin
-- Dump non-table and non-array map pairs with inline style:
-- key = value
for Pair of Other_Pairs loop
Put (To_String (Format_Key (Pair.Key)));
Put (" = ");
Dump_Inline (Pair.Value);
Put ((1 => ASCII.LF));
end loop;
-- Dump tables as top-level ones: [section]
for Pair of Table_Pairs loop
Put_Table_Header (Key, Pair.Key, Nested_Key);
Dump_Toplevel_Table (Nested_Key, Pair.Value);
end loop;
-- Dump arrays as top-level ones: [[section]]
for Pair of Array_Pairs loop
Dump_Toplevel_Array (Key, Pair.Key, Pair.Value);
end loop;
end;
end Dump_Toplevel_Table;
-------------------------
-- Dump_Toplevel_Array --
-------------------------
procedure Dump_Toplevel_Array
(Parent_Key, Array_Key : Unbounded_UTF8_String; Array_Value : TOML_Value)
is
Nested_Key : constant Unbounded_UTF8_String :=
Append_Key (Parent_Key, Array_Key);
begin
for I in 1 .. Array_Value.Length loop
Put_Array_Header (Nested_Key);
Dump_Toplevel_Table (Nested_Key, Array_Value.Item (I));
end loop;
end Dump_Toplevel_Array;
------------------
-- Strip_Number --
------------------
function Strip_Number (Image : String) return String is
begin
if Image'Length > 0 and then Image (Image'First) = ' ' then
return Image (Image'First + 1 .. Image'Last);
else
return Image;
end if;
end Strip_Number;
----------------
-- Pad_Number --
----------------
function Pad_Number (Image : String; Digit_Count : Positive) return String
is
Result : constant String := Strip_Number (Image);
begin
pragma Assert (Result'Length <= Digit_Count);
return (Result'Length + 1 .. Digit_Count => '0') & Result;
end Pad_Number;
-----------------
-- Dump_Inline --
-----------------
procedure Dump_Inline (Value : TOML_Value) is
procedure Put (Datetime : TOML.Any_Local_Datetime);
procedure Put (Date : TOML.Any_Local_Date);
procedure Put (Time : TOML.Any_Local_Time);
---------
-- Put --
---------
procedure Put (Datetime : TOML.Any_Local_Datetime) is
begin
Put (Datetime.Date);
Put ("T");
Put (Datetime.Time);
end Put;
procedure Put (Date : TOML.Any_Local_Date) is
begin
Put (Pad_Number (Date.Year'Image, 4)
& "-" & Pad_Number (Date.Month'Image, 2)
& "-" & Pad_Number (Date.Day'Image, 2));
end Put;
procedure Put (Time : TOML.Any_Local_Time) is
begin
Put (Pad_Number (Time.Hour'Image, 2)
& ":" & Pad_Number (Time.Minute'Image, 2)
& ":" & Pad_Number (Time.Second'Image, 2)
& "." & Pad_Number (Time.Millisecond'Image, 3));
end Put;
begin
case Value.Kind is
when TOML_Boolean =>
Put ((if Value.As_Boolean then "true" else "false"));
when TOML_Integer =>
Put (Strip_Number (Any_Integer'Image (Value.As_Integer)));
when TOML_Float =>
declare
V : constant Any_Float := Value.As_Float;
begin
case V.Kind is
when Regular =>
Put (Strip_Number (V.Value'Image));
when NaN | Infinity =>
Put (if V.Positive then "" else "-");
Put (if V.Kind = NaN then "nan" else "inf");
end case;
end;
when TOML_String =>
-- TODO: escape strings when needed
Put (To_String (Format_String (Value.As_Unbounded_String)));
when TOML_Offset_Datetime =>
declare
V : constant Any_Offset_Datetime :=
Value.As_Offset_Datetime;
Absolute_Offset : constant Any_Local_Offset :=
(if V.Offset < 0
then -V.Offset
else V.Offset);
Hour_Offset : constant Any_Local_Offset :=
Absolute_Offset / 60;
Minute_Offset : constant Any_Local_Offset :=
Absolute_Offset mod 60;
begin
Put (V.Datetime);
if V.Offset < 0 or else V.Unknown_Offset then
Put ("-");
else
Put ("+");
end if;
Put (Pad_Number (Hour_Offset'Image, 2)
& ":" & Pad_Number (Minute_Offset'Image, 2));
end;
when TOML_Local_Datetime =>
Put (Value.As_Local_Datetime);
when TOML_Local_Date =>
Put (Value.As_Local_Date);
when TOML_Local_Time =>
Put (Value.As_Local_Time);
when TOML_Array =>
Put ("[" & ASCII.LF);
for I in 1 .. Value.Length loop
Dump_Inline (Value.Item (I));
Put ("," & ASCII.LF);
end loop;
Put ("]");
when TOML_Table =>
Put ("{");
declare
First : Boolean := True;
begin
for E of Value.Iterate_On_Table loop
if not First then
Put (", ");
end if;
Put (To_String (Format_String (E.Key)));
Put (" = ");
Dump_Inline (E.Value);
First := False;
end loop;
end;
Put ("}");
end case;
end Dump_Inline;
begin
Dump_Toplevel_Table (Null_Unbounded_String, Value);
end TOML.Generic_Dump;
|
alloy4fun_models/trashltl/models/4/5KvP6jACktkcQi7Rz.als | Kaixi26/org.alloytools.alloy | 0 | 2970 | open main
pred id5KvP6jACktkcQi7Rz_prop5 {
eventually ( some f:File | f in Trash)
}
pred __repair { id5KvP6jACktkcQi7Rz_prop5 }
check __repair { id5KvP6jACktkcQi7Rz_prop5 <=> prop5o } |
Global/zoom-toggle-video.applescript | boisy/AppleScripts | 116 | 1332 | --
-- Created by: <NAME>
-- Created on: 9/15/20
--
try
if not inMeeting() then error "not in a meeting"
tell application "System Events"
tell process "zoom.us"
tell menu bar 1
tell menu bar item 3
tell menu "Meeting"
if menu item "Start Video" exists then
click menu item "Start Video"
set diag to "You're on camera"
else if menu item "Stop Video" exists then
click menu item "Stop Video"
set diag to "You're off camera"
end if
end tell
end tell
end tell
end tell
end tell
display notification (diag) with title ("Toggle zoom video")
on error errMsg number errNum
display dialog (errMsg & return & return & errNum) ¬
buttons {"Cancel", "OK"} ¬
default button ("OK") ¬
with icon caution
end try
on inMeeting()
if application "zoom.us" is not running then return false
tell application "System Events"
tell process "zoom.us"
tell menu bar 1
tell menu bar item "zoom.us"
tell menu 1
return (enabled of menu item "Join Meeting...")
end tell
end tell
end tell
end tell
end tell
end inMeeting
|
alloy4fun_models/trashltl/models/11/kScqSb224cKjmi7vN.als | Kaixi26/org.alloytools.alloy | 0 | 3996 | open main
pred idkScqSb224cKjmi7vN_prop12 {
eventually all f:File | f in Trash implies f in Trash'
}
pred __repair { idkScqSb224cKjmi7vN_prop12 }
check __repair { idkScqSb224cKjmi7vN_prop12 <=> prop12o } |
libsrc/_DEVELOPMENT/adt/wv_priority_queue/c/sdcc_iy/wv_priority_queue_pop_fastcall.asm | meesokim/z88dk | 0 | 95255 | <gh_stars>0
; void *wv_priority_queue_pop_fastcall(wv_priority_queue_t *q)
SECTION code_adt_wv_priority_queue
PUBLIC _wv_priority_queue_pop_fastcall
defc _wv_priority_queue_pop_fastcall = asm_wv_priority_queue_pop
INCLUDE "adt/wv_priority_queue/z80/asm_wv_priority_queue_pop.asm"
|
Data/Binary/Relations.agda | oisdk/agda-binary | 1 | 10256 | <gh_stars>1-10
{-# OPTIONS --without-K --safe #-}
module Data.Binary.Relations where
open import Data.Binary.Relations.Raw
open import Data.Binary.Definitions
open import Data.Binary.Operations.Addition
open import Relation.Binary
open import Relation.Nullary
import Data.Empty.Irrelevant as Irrel
infix 4 _≤_ _<_
record _≤_ (x y : 𝔹) : Set where
constructor ≤!
field
.proof : ⟅ I ⟆ x ≺ y
record _<_ (x y : 𝔹) : Set where
constructor <!
field
.proof : ⟅ O ⟆ x ≺ y
_≤?_ : Decidable _≤_
x ≤? y with I ! x ≺? y
(x ≤? y) | yes x₁ = yes (≤! x₁)
(x ≤? y) | no x₁ = no λ p → Irrel.⊥-elim (x₁ (_≤_.proof p))
_<?_ : Decidable _<_
x <? y with O ! x ≺? y
(x <? y) | yes x₁ = yes (<! x₁)
(x <? y) | no x₁ = no λ p → Irrel.⊥-elim (x₁ (_<_.proof p))
<⇒≤ : ∀ {x y} → x < y → x ≤ y
<⇒≤ {x} {y} x<y = ≤! (weaken x y (_<_.proof x<y))
≤-trans : Transitive _≤_
≤-trans {i} {j} {k} i≤j j≤k = ≤! (≺-trans I I i j k (_≤_.proof i≤j) (_≤_.proof j≤k))
<-trans : Transitive _<_
<-trans {i} {j} {k} i<j j<k = <! (≺-trans O O i j k (_<_.proof i<j) (_<_.proof j<k))
n≤m+n : ∀ x y → x ≤ y + x
n≤m+n x y = ≤! (≺-add y x)
|
libsrc/gfx/wide/w_putsprite4.asm | ahjelm/z88dk | 640 | 242874 | <reponame>ahjelm/z88dk<gh_stars>100-1000
;
; Sprite Rendering Routine
; original code by <NAME> (TI 85)
; modified by <NAME> - Jan 2001
;
; Sept 2003 - Stefano: Fixed bug for sprites wider than 8.
; Apr 2017 - Stefano: Fixed bug for sprite pos coordinates wider than 255.
;
; SMC version (smaller than w_putsprite3) Uses plot, unplot, xorplot
;
;
; $Id: w_putsprite4.asm $
;
IF !__CPU_INTEL__ & !__CPU_GBZ80__
SECTION smc_clib
PUBLIC putsprite
PUBLIC _putsprite
EXTERN plot
EXTERN unplot
EXTERN xorplot
; __gfx_coords: h,l (vert-horz)
; sprite: (ix)
.putsprite
._putsprite
ld hl,2
add hl,sp
ld e,(hl)
inc hl
ld d,(hl) ;sprite address
push ix ; preserve IX
push de
pop ix
inc hl
ld e,(hl)
inc hl
ld d,(hl)
inc hl
ld c,(hl)
inc hl
ld b,(hl) ; x and y __gfx_coords
ld (oldx),bc
inc hl
ld a,(hl) ; and/or/xor mode
;--------------------------------------
ld hl,plot
ld (smc_fn+1),hl
cp 182 ; or(hl) opcode
jr z,door
ld hl,unplot
ld (smc_fn+1),hl
cp 166 ; and(hl) opcode
jr z,door
.doxor
; 174 - xor
ld hl,xorplot
ld (smc_fn+1),hl
;--------------------------------------
.door
ld a,(ix+0) ; Width
ld b,(ix+1) ; Height
.oloopo
push bc ;Save # of rows
push af
ld hl,(oldx) ;;
;ld b,a ;Load width
ld b,0 ; Better, start from zero !!
ld c,(ix+2) ;Load one line of image
.iloopo
sla c ;Test leftmost pixel
jr nc,noploto ;See if a plot is needed
push bc
push hl
push de
.smc_fn
call plot
pop de
pop hl
pop bc
.noploto
inc b ; witdh counter
inc hl ;;
pop af
push af
cp b ; end of row ?
jr nz,noblko
inc ix
ld c,(ix+2) ;Load next byte of image
jr noblocko
.noblko
ld a,b ; next byte in row ?
;dec a
and a
jr z,iloopo
and 7
jr nz,iloopo
.blocko
inc ix
ld c,(ix+2) ;Load next byte of image
jr iloopo
.noblocko
;pop hl
;inc l
inc de
pop af
pop bc ;Restore data
djnz oloopo
;ret
ld a,1 ; Restore INK color
pop ix ; restore IX before exiting
ret
;----------------------------------------------
SECTION bss_graphics
.oldx
defw 0
ENDIF
|
oeis/077/A077848.asm | neoneye/loda-programs | 11 | 166287 | ; A077848: Expansion of (1-x)^(-1)/(1-2*x-x^2-2*x^3).
; Submitted by <NAME>(w3)
; 1,3,8,22,59,157,418,1112,2957,7863,20908,55594,147823,393057,1045126,2778956,7389153,19647515,52242096,138910014,369357155,982108517,2611394218,6943611264,18462833781,49092067263,130534190836,347086116498,922890558359,2453935614889
add $0,1
lpb $0
sub $0,1
add $3,1
add $4,$3
add $4,$3
mov $3,$2
mov $2,$1
add $3,$1
add $1,$4
lpe
mov $0,$1
div $0,2
|
src/readwordunaligned.asm | itsmiriam42/pong | 2 | 177887 | <gh_stars>1-10
# ___ ___ ___ ___ _ ___ ___ _____ _ _ ___ ___
# / __| __/ __| _ \ | | | __/ __|_ _| | | | _ \ __|
# | (__| _|\__ \ _/ | |__| _| (__ | | | |_| | / _|
# \___|___|___/_| |____|___\___| |_| \___/|_|_\___|
#
# Copyright 2021 <NAME>
read_word_unaligned:
#input
# a1: (unaligned) address
#output
# a0: value at address a1
addi sp, sp, -20
sw s3, (sp)
sw s4, 4 (sp)
sw s5, 8 (sp)
sw ra, 12(sp)
sw a1, 16(sp)
andi s3, a1, 0x3 # byte offset
slli s3, s3, 3 # byte offset in bit
andi a1, a1, 0xfffffffc # get next word aligned address
lw s4, 0 (a1)
lw s5, 4 (a1)
srl s4, s4, s3
addi s3, s3, -32
sub s3, zero, s3
sll s5, s5, s3
or a0, s4, s5
lw s3, (sp)
lw s4, 4 (sp)
lw s5, 8 (sp)
lw ra, 12(sp)
lw a1, 16(sp)
addi sp, sp, 20
ret
|
sw/552tests/inst_tests/jalr_31.asm | JPShen-UWM/ThreadKraken | 1 | 27009 | // Original test: ./tschaefe/hw4/problem6/jalr_2.asm
// Author: tschaefe
// Test source code follows
// jalr test 2
// This test has jalr jumping to an ealier part of the program and sets r7 to 0xa
lbi r0, 0x0 // r0 used for jump address calculation
lbi r1, 0xfd // r1 acts as a loop counter
addi r1, r1, 0x01
bgez r1, .done //after 3 total executions of add, go to halt
jalr r0, 0x4
.done:
halt
|
oeis/021/A021551.asm | neoneye/loda-programs | 11 | 16469 | <gh_stars>10-100
; A021551: Decimal expansion of 1/547.
; Submitted by <NAME>
; 0,0,1,8,2,8,1,5,3,5,6,4,8,9,9,4,5,1,5,5,3,9,3,0,5,3,0,1,6,4,5,3,3,8,2,0,8,4,0,9,5,0,6,3,9,8,5,3,7,4,7,7,1,4,8,0,8,0,4,3,8,7,5,6,8,5,5,5,7,5,8,6,8,3,7,2,9,4,3,3,2,7,2,3,9,4,8,8,1,1,7,0,0,1,8,2,8,1,5,3
add $0,1
mov $2,10
pow $2,$0
div $2,547
mov $0,$2
mod $0,10
|
Chapter03/control-the-flow/jmp-un.nasm | firebitsbr/Penetration-Testing-with-Shellcode | 30 | 28505 | global _start
section .text
_start:
jmp exit_ten
mov rax, 60
mov rdi, 12
syscall
mov rax, 60
mov rdi, 0
syscall
exit_ten:
mov rax, 60
mov rdi, 10
syscall
mov rax, 60
mov rdi, 1
syscall
section .data
|
trig.asm | za419/Asteroids | 0 | 168960 | <reponame>za419/Asteroids<filename>trig.asm
; #########################################################################
;
; trig.asm - Assembly file for EECS205 Assignment 3
;
;
; #########################################################################
.586
.MODEL FLAT,STDCALL
.STACK 4096
option casemap :none ; case sensitive
include trig.inc
.DATA
;; These are some useful constants (fixed point values that correspond to important angles)
PI_HALF = 102943 ;; PI / 2
PI = 205887 ;; PI
TWO_PI = 411774 ;; 2 * PI
PI_INC_RECIP = 5340353 ;; Use reciprocal to find the table entry for a given angle
;; (It is easier to use than divison would be)
ROUND_FACTOR = 00004000h ;; Adjusts rounding behavior of lookup
ONE = 00010000h ;; ONE
;; If you need to, you can place global variables here
.CODE
;; Handles fixed-point multiplication
;; (so if I make a mistake I can easily change this function to fix it)
FixedMultiply PROC USES edx a:FXPT, b:FXPT
mov eax, a
imul b ;; Treat a and b as integers
;; Integer part of the result is the lower word of edx
;; Decimal part of the result is the upper word of eax
shl edx, 16 ;; Shift the results into being in place for fixed point
shr eax, 16
or eax, edx ;; And or the results together
ret
FixedMultiply ENDP
;; Handles fixed-point subtraction
;; (so if I make a mistake I can easily change this function to fix it)
FixedSubtract PROC a:FXPT, b:FXPT
mov eax, a
sub eax, b
ret
FixedSubtract ENDP
;; Handles fixed-point addition
;; (so if I make a mistake I can easily change this function to fix it)
FixedAdd PROC a:FXPT, b:FXPT
mov eax, a
add eax, b
ret
FixedAdd ENDP
FixedSin PROC USES ebx angle:FXPT
cmp angle, 0 ;; This code doesn't account for negative angles.
jl FIXER ;; FIXER will recurse to make the angle positive
;; Slight edge optimization: If the input is exactly 0, return 0 instead of a value very near it (avoiding the overhead of a lookup)
je EXACT0
cmp angle, PI_HALF ;; If the angle is less than pi/2, we can do a table lookup
jl LOOKUP ;; If it is, jump into the lookup
;; Slight edge optimization: If the input is exactly pi/2, return 1 instead of a value very near it (avoiding the overhead of a lookup)
je EXACT1
cmp angle, TWO_PI ;; If the angle is greater than pi/2, recurse on angle-[pi/2]
jg CIRCLED ;; CIRCLED will handle that recursion
je EXACT0
cmp angle, PI ;; If the angle is greater than pi, recurse on angle-pi and negate the result
jg NEGATE ;; NEGATE will handle that recursion
je EXACT0
;; If we're here, that means PI_HALF<angle<pi
;; That means we should use the third identity.
;; Subtract angle from pi and recurse.
INVOKE FixedSubtract, PI, angle ;; Subtract angle from pi...
INVOKE FixedSin, eax ;; Recurse on the result
jmp EXIT ;; Return the result of that recursion.
FIXER: ;; Add 2*pi to the angle and recurse (eventually thus making it positive even for very negative angles)
INVOKE FixedAdd, angle, TWO_PI
INVOKE FixedSin, eax
jmp EXIT ;; Return the result of the recursion
EXACT0:
mov eax, 0
jmp EXIT
EXACT1:
mov eax, ONE
jmp EXIT
NEGATE: ;; pi<=angle
INVOKE FixedSubtract, angle, PI ;; Subtract pi
INVOKE FixedSin, eax ;; Recurse on the result
neg eax ;; Negate the result
jmp EXIT ;; And return it.
CIRCLED: ;; 2*pi<=angle
INVOKE FixedSubtract, angle, TWO_PI ;; Subtract 2*pi
INVOKE FixedSin, eax ;; Recurse on the result
jmp EXIT ;; And return the result.
LOOKUP: ;; angle<pi/2
INVOKE FixedMultiply, angle, PI_INC_RECIP ;; Calculate the table index
INVOKE FixedAdd, eax, ROUND_FACTOR ;; Round away from zero
shr eax, 15 ;; Shift out the decimal part (round-to-zero)
and eax, 0fffffffeh ;; Make sure the index is on a word boundary
mov ebx, OFFSET SINTAB
add ebx, eax
movzx eax, WORD PTR [ebx] ;; Dereference and move result into eax
;; Fallthrough to exit
EXIT:
ret ; Don't delete this line!!!
FixedSin ENDP
FixedCos PROC angle:FXPT
;; Optimizations for known values and bounds checking
cmp angle, 0
jl NEGATE ;; Recurse on negative factors
je RETONE ;; Return one for known value
cmp angle, PI_HALF
je ZERO ;; Return zero for known value
mov eax, PI_HALF
neg eax
cmp angle, eax
je ZERO ;; Return zero for known value
cmp angle, PI
je NEGONE ;; Return negative one for known value
;; General case: Use our trig identity
;; Use FixedSin: cos(x)=sin(x+[pi/2])
INVOKE FixedAdd, angle, PI_HALF ;; eax=angle+[pi/2]
INVOKE FixedSin, eax ;; eax=sin(eax)
;; And return that result
jmp DONE
RETONE: ;; Return 1
mov eax, ONE
jmp DONE
ZERO: ;; Return 0
mov eax, 0
jmp DONE
NEGONE: ;; Return negative one
mov eax, ONE
neg eax
jmp DONE
NEGATE: ;; Add 2*pi and recurse
INVOKE FixedAdd, angle, TWO_PI
INVOKE FixedCos, eax
;; Fallthrough to return
DONE:
ret ; Don't delete this line!!!
FixedCos ENDP
END
|
Applications/Finder/set icon/test.applescript | looking-for-a-job/applescript-examples | 1 | 477 | <gh_stars>1-10
#!/usr/bin/osascript
osascript <(echo tell Finder to set icon of file "Reveal.scpt" to Reveal.icns) |
programs/oeis/124/A124925.asm | neoneye/loda | 22 | 12580 | ; A124925: Interlaced triples: a(3n+1)=1, a(3n+2) = 2n+3, a(3n+3)= A028387(n).
; 1,3,1,1,5,5,1,7,11,1,9,19,1,11,29,1,13,41,1,15,55,1,17,71,1,19,89,1,21,109,1,23,131,1,25,155,1,27,181,1,29,209,1,31,239,1,33,271,1,35,305,1,37,341,1,39,379,1,41,419,1,43,461,1,45,505,1,47,551,1,49,599,1,51,649,1,53,701,1,55,755,1,57,811,1,59,869,1,61,929,1,63,991,1,65,1055,1,67,1121,1
add $0,6
lpb $0
sub $0,3
add $1,1
lpe
bin $1,$0
sub $1,1
mul $1,2
add $1,1
mov $0,$1
|
libsrc/_DEVELOPMENT/math/float/math16/c/sdcc/cm16_sdcc_div_callee.asm | Frodevan/z88dk | 640 | 99260 | <filename>libsrc/_DEVELOPMENT/math/float/math16/c/sdcc/cm16_sdcc_div_callee.asm
; half __div_callee (half left, half right)
SECTION code_fp_math16
PUBLIC cm16_sdcc_div_callee
EXTERN cm16_sdcc_readr_callee
EXTERN asm_f16_div_callee
.cm16_sdcc_div_callee
; divide sdcc half by sdcc half
;
; enter : stack = sdcc_half right, sdcc_half left, ret
;
; exit : HL = sdcc_half(left/right)
;
; uses : af, bc, de, hl, af', bc', de', hl'
call cm16_sdcc_readr_callee
jp asm_f16_div_callee ; enter stack = sdcc_half left, ret
; HL = sdcc_half right
; return HL = sdcc_half
|
DispMenu.asm | bbernardoni/MathTI83 | 0 | 86002 | ;display titles
ld HL, TitleLength
ld C, (HL)
ld B, C
ld HL, $0001
ld (pencol), HL
ld HL, titles
TitleDispLoop:
ld A, C
sub B
inc A
cp D
call Z, SetTI
call VPutS
res TextInverse, (IY + TextFlags)
ld A, (pencol)
inc A
ld (pencol), A
djnz TitleDispLoop
;display options
push DE
ld C, D
ld HL, optionLengths
xor A
OptionLengthLoop:
dec C
jr Z, OptionBreakLengthLoop
add A, (HL)
inc HL
jr OptionLengthLoop
OptionBreakLengthLoop:
ld C, (HL)
ld HL, options
ld B, A
or A
jr Z, Option0LoopSkip
Option0Loop:
inc HL
ld A, (HL)
or A
jr NZ, Option0Loop
inc HL
djnz Option0Loop
Option0LoopSkip:
ld B, C
ld E, $01
ld A, $00
OptionDispLoop:
add A, $06
ld D, A
ld (pencol), DE
call VputS
djnz OptionDispLoop
pop DE
;highlight option 1
call SelectOptionE |
applescript/RaiseVideoCallTab.applescript | jacsuper/automation | 0 | 1513 | tell application "Google Chrome"
activate
repeat with w in (windows)
set j to 0
repeat with t in (tabs of w)
set j to j + 1
set isWorkplaceTab to title of t contains "Workplace room"
set isBlueJeansInBrowserTab to title of t contains "Blue Jeans" and URL of t contains "webrtc"
if isWorkplaceTab or isBlueJeansInBrowserTab then
set (active tab index of w) to j
set index of w to 1
tell application "System Events" to tell process "Google Chrome"
perform action "AXRaise" of window 1 -- `set index` doesn't always raise the window
end tell
return
end if
end repeat
end repeat
end tell
|
text/maps/celadon_house.asm | longlostsoul/EvoYellow | 16 | 6958 | _CeladonHouseText1::
text "Heheh! Gambler's"
line "fallacy brings"
cont "dough, big time!"
done
_CeladonHouseText2::
text "CHIEF!"
para "We just shipped"
line "2000 #MON as"
cont "slot prizes!"
done
_CeladonHouseText3::
text "Do touch the"
line "poster at the"
cont "GAME CORNER!"
para "Fear reverse"
line "psychology!"
done
|
oeis/099/A099838.asm | neoneye/loda-programs | 11 | 174041 | <gh_stars>10-100
; A099838: Expansion of (1-x)^2(1+x)/(1+x+x^2).
; Submitted by <NAME>
; 1,-2,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3,-3,0,3
add $0,1
mov $1,1
sub $1,$0
min $0,3
mod $1,3
pow $1,$1
mul $0,$1
|
alloy4fun_models/trashltl/models/12/dvYsgwWpcLuWw2yex.als | Kaixi26/org.alloytools.alloy | 0 | 3950 | <gh_stars>0
open main
pred iddvYsgwWpcLuWw2yex_prop13 {
all f: File | always f not in Trash until f in Trash
}
pred __repair { iddvYsgwWpcLuWw2yex_prop13 }
check __repair { iddvYsgwWpcLuWw2yex_prop13 <=> prop13o } |
oeis/099/A099560.asm | neoneye/loda-programs | 11 | 556 | <filename>oeis/099/A099560.asm
; A099560: a(n) = Sum_{k=0..floor(n/3)} C(n-2k,k-1).
; 0,0,0,1,1,1,3,4,5,9,13,18,28,41,59,88,129,188,277,406,594,872,1278,1872,2745,4023,5895,8641,12664,18559,27201,39865,58424,85626,125491,183915,269542,395033,578948,848491,1243524,1822472,2670964,3914488,5736960,8407925,12322413,18059373,26467299,38789712,56849085,83316385,122106097,178955182,262271568,384377665,563332847,825604416,1209982081,1773314928,2598919345,3808901426,5582216354,8181135700,11990037126,17572253480,25753389181,37743426307,55315679787,81069068969,118812495276,174128175063
lpb $0
mov $2,$0
sub $0,3
seq $2,78012 ; Expansion of (1 - x) / (1 - x - x^3) in powers of x.
add $1,$2
lpe
mov $0,$1
|
include/sf-window-glu.ads | danva994/ASFML-1.6 | 1 | 13775 | -- ////////////////////////////////////////////////////////////
-- //
-- // SFML - Simple and Fast Multimedia Library
-- // Copyright (C) 2007-2009 <NAME> (<EMAIL>)
-- //
-- // This software is provided 'as-is', without any express or implied warranty.
-- // In no event will the authors be held liable for any damages arising from the use of this software.
-- //
-- // Permission is granted to anyone to use this software for any purpose,
-- // including commercial applications, and to alter it and redistribute it freely,
-- // subject to the following restrictions:
-- //
-- // 1. The origin of this software must not be misrepresented;
-- // you must not claim that you wrote the original software.
-- // If you use this software in a product, an acknowledgment
-- // in the product documentation would be appreciated but is not required.
-- //
-- // 2. Altered source versions must be plainly marked as such,
-- // and must not be misrepresented as being the original software.
-- //
-- // 3. This notice may not be removed or altered from any source distribution.
-- //
-- ////////////////////////////////////////////////////////////
-- ////////////////////////////////////////////////////////////
-- // Headers
-- ////////////////////////////////////////////////////////////
with Sf.Window.GL;
package Sf.Window.GLU is
use Sf.Window.GL;
-- ////////////////////////////////////////////////////////////
-- // Define portable types
-- ////////////////////////////////////////////////////////////
type u_GLUfuncptr is access procedure;
-- ////////////////////////////////////////////////////////////
-- // Define constants
-- ////////////////////////////////////////////////////////////
GLU_FALSE : constant GLboolean := 0;
GLU_TRUE : constant GLboolean := 1;
GLU_VERSION_1_1 : constant GLenum := 1;
GLU_VERSION_1_2 : constant GLenum := 1;
GLU_VERSION : constant GLenum := 100800;
GLU_EXTENSIONS : constant GLenum := 100801;
GLU_INVALID_ENUM : constant GLenum := 100900;
GLU_INVALID_VALUE : constant GLenum := 100901;
GLU_OUT_OF_MEMORY : constant GLenum := 100902;
GLU_INVALID_OPERATION : constant GLenum := 100904;
GLU_OUTLINE_POLYGON : constant GLenum := 100240;
GLU_OUTLINE_PATCH : constant GLenum := 100241;
GLU_NURBS_ERROR1 : constant GLenum := 100251;
GLU_NURBS_ERROR2 : constant GLenum := 100252;
GLU_NURBS_ERROR3 : constant GLenum := 100253;
GLU_NURBS_ERROR4 : constant GLenum := 100254;
GLU_NURBS_ERROR5 : constant GLenum := 100255;
GLU_NURBS_ERROR6 : constant GLenum := 100256;
GLU_NURBS_ERROR7 : constant GLenum := 100257;
GLU_NURBS_ERROR8 : constant GLenum := 100258;
GLU_NURBS_ERROR9 : constant GLenum := 100259;
GLU_NURBS_ERROR10 : constant GLenum := 100260;
GLU_NURBS_ERROR11 : constant GLenum := 100261;
GLU_NURBS_ERROR12 : constant GLenum := 100262;
GLU_NURBS_ERROR13 : constant GLenum := 100263;
GLU_NURBS_ERROR14 : constant GLenum := 100264;
GLU_NURBS_ERROR15 : constant GLenum := 100265;
GLU_NURBS_ERROR16 : constant GLenum := 100266;
GLU_NURBS_ERROR17 : constant GLenum := 100267;
GLU_NURBS_ERROR18 : constant GLenum := 100268;
GLU_NURBS_ERROR19 : constant GLenum := 100269;
GLU_NURBS_ERROR20 : constant GLenum := 100270;
GLU_NURBS_ERROR21 : constant GLenum := 100271;
GLU_NURBS_ERROR22 : constant GLenum := 100272;
GLU_NURBS_ERROR23 : constant GLenum := 100273;
GLU_NURBS_ERROR24 : constant GLenum := 100274;
GLU_NURBS_ERROR25 : constant GLenum := 100275;
GLU_NURBS_ERROR26 : constant GLenum := 100276;
GLU_NURBS_ERROR27 : constant GLenum := 100277;
GLU_NURBS_ERROR28 : constant GLenum := 100278;
GLU_NURBS_ERROR29 : constant GLenum := 100279;
GLU_NURBS_ERROR30 : constant GLenum := 100280;
GLU_NURBS_ERROR31 : constant GLenum := 100281;
GLU_NURBS_ERROR32 : constant GLenum := 100282;
GLU_NURBS_ERROR33 : constant GLenum := 100283;
GLU_NURBS_ERROR34 : constant GLenum := 100284;
GLU_NURBS_ERROR35 : constant GLenum := 100285;
GLU_NURBS_ERROR36 : constant GLenum := 100286;
GLU_NURBS_ERROR37 : constant GLenum := 100287;
GLU_AUTO_LOAD_MATRIX : constant GLenum := 100200;
GLU_CULLING : constant GLenum := 100201;
GLU_SAMPLING_TOLERANCE : constant GLenum := 100203;
GLU_DISPLAY_MODE : constant GLenum := 100204;
GLU_PARAMETRIC_TOLERANCE : constant GLenum := 100202;
GLU_SAMPLING_METHOD : constant GLenum := 100205;
GLU_U_STEP : constant GLenum := 100206;
GLU_V_STEP : constant GLenum := 100207;
GLU_PATH_LENGTH : constant GLenum := 100215;
GLU_PARAMETRIC_ERROR : constant GLenum := 100216;
GLU_DOMAIN_DISTANCE : constant GLenum := 100217;
GLU_MAP1_TRIM_2 : constant GLenum := 100210;
GLU_MAP1_TRIM_3 : constant GLenum := 100211;
GLU_POINT : constant GLenum := 100010;
GLU_LINE : constant GLenum := 100011;
GLU_FILL : constant GLenum := 100012;
GLU_SILHOUETTE : constant GLenum := 100013;
GLU_ERROR : constant GLenum := 100103;
GLU_SMOOTH : constant GLenum := 100000;
GLU_FLAT : constant GLenum := 100001;
GLU_NONE : constant GLenum := 100002;
GLU_OUTSIDE : constant GLenum := 100020;
GLU_INSIDE : constant GLenum := 100021;
GLU_TESS_BEGIN : constant GLenum := 100100;
GLU_BEGIN : constant GLenum := 100100;
GLU_TESS_VERTEX : constant GLenum := 100101;
GLU_VERTEX : constant GLenum := 100101;
GLU_TESS_END : constant GLenum := 100102;
GLU_END : constant GLenum := 100102;
GLU_TESS_ERROR : constant GLenum := 100103;
GLU_TESS_EDGE_FLAG : constant GLenum := 100104;
GLU_EDGE_FLAG : constant GLenum := 100104;
GLU_TESS_COMBINE : constant GLenum := 100105;
GLU_TESS_BEGIN_DATA : constant GLenum := 100106;
GLU_TESS_VERTEX_DATA : constant GLenum := 100107;
GLU_TESS_END_DATA : constant GLenum := 100108;
GLU_TESS_ERROR_DATA : constant GLenum := 100109;
GLU_TESS_EDGE_FLAG_DATA : constant GLenum := 100110;
GLU_TESS_COMBINE_DATA : constant GLenum := 100111;
GLU_CW : constant GLenum := 100120;
GLU_CCW : constant GLenum := 100121;
GLU_INTERIOR : constant GLenum := 100122;
GLU_EXTERIOR : constant GLenum := 100123;
GLU_UNKNOWN : constant GLenum := 100124;
GLU_TESS_WINDING_RULE : constant GLenum := 100140;
GLU_TESS_BOUNDARY_ONLY : constant GLenum := 100141;
GLU_TESS_TOLERANCE : constant GLenum := 100142;
GLU_TESS_ERROR1 : constant GLenum := 100151;
GLU_TESS_ERROR2 : constant GLenum := 100152;
GLU_TESS_ERROR3 : constant GLenum := 100153;
GLU_TESS_ERROR4 : constant GLenum := 100154;
GLU_TESS_ERROR5 : constant GLenum := 100155;
GLU_TESS_ERROR6 : constant GLenum := 100156;
GLU_TESS_ERROR7 : constant GLenum := 100157;
GLU_TESS_ERROR8 : constant GLenum := 100158;
GLU_TESS_MISSING_BEGIN_POLYGON : constant GLenum := 100151;
GLU_TESS_MISSING_BEGIN_CONTOUR : constant GLenum := 100152;
GLU_TESS_MISSING_END_POLYGON : constant GLenum := 100153;
GLU_TESS_MISSING_END_CONTOUR : constant GLenum := 100154;
GLU_TESS_COORD_TOO_LARGE : constant GLenum := 100155;
GLU_TESS_NEED_COMBINE_CALLBACK : constant GLenum := 100156;
GLU_TESS_WINDING_ODD : constant GLenum := 100130;
GLU_TESS_WINDING_NONZERO : constant GLenum := 100131;
GLU_TESS_WINDING_POSITIVE : constant GLenum := 100132;
GLU_TESS_WINDING_NEGATIVE : constant GLenum := 100133;
GLU_TESS_WINDING_ABS_GEQ_TWO : constant GLenum := 100134;
GLU_INCOMPATIBLE_GL_VERSION : constant GLenum := 100903;
GLU_TESS_MAX_COORD : constant GLenum := GLenum'LAST;
-- ////////////////////////////////////////////////////////////
-- // GLU functions
-- ////////////////////////////////////////////////////////////
procedure gluBeginCurve (nurb : GLvoid_Ptr);
procedure gluBeginPolygon (tess : GLvoid_Ptr);
procedure gluBeginSurface (nurb : GLvoid_Ptr);
procedure gluBeginTrim (nurb : GLvoid_Ptr);
function gluBuild1DMipmaps
(target : GLenum;
internalFormat : GLint;
width : GLsizei;
format : GLenum;
c_type : GLenum;
data : GLvoid_Ptr)
return GLint;
function gluBuild2DMipmaps
(target : GLenum;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
format : GLenum;
c_type : GLenum;
data : GLvoid_Ptr)
return GLint;
procedure gluCylinder
(quad : GLvoid_Ptr;
base : GLdouble;
top : GLdouble;
height : GLdouble;
slices : GLint;
stacks : GLint);
procedure gluDeleteNurbsRenderer (nurb : GLvoid_Ptr);
procedure gluDeleteQuadric (quad : GLvoid_Ptr);
procedure gluDeleteTess (tess : GLvoid_Ptr);
procedure gluDisk
(quad : GLvoid_Ptr;
inner : GLdouble;
outer : GLdouble;
slices : GLint;
loops : GLint);
procedure gluEndCurve (nurb : GLvoid_Ptr);
procedure gluEndPolygon (tess : GLvoid_Ptr);
procedure gluEndSurface (nurb : GLvoid_Ptr);
procedure gluEndTrim (nurb : GLvoid_Ptr);
function gluErrorString (error : GLenum) return GLubyte_Ptr;
function gluErrorUnicodeStringEXT (error : GLenum) return GLuint_Ptr;
procedure gluGetNurbsProperty (nurb : GLvoid_Ptr; property : GLenum; data : access GLfloat);
function gluGetString (name : GLenum) return GLubyte_Ptr;
procedure gluGetTessProperty (tess : GLvoid_Ptr; which : GLenum; data : access GLdouble);
procedure gluLoadSamplingMatrices
(nurb : GLvoid_Ptr;
model : access GLfloat;
perspective : access GLfloat;
view : access GLint);
procedure gluLookAt
(eyeX : GLdouble;
eyeY : GLdouble;
eyeZ : GLdouble;
centerX : GLdouble;
centerY : GLdouble;
centerZ : GLdouble;
upX : GLdouble;
upY : GLdouble;
upZ : GLdouble);
function gluNewNurbsRenderer return GLvoid_Ptr;
function gluNewQuadric return GLvoid_Ptr;
function gluNewTess return GLvoid_Ptr;
procedure gluNextContour (tess : GLvoid_Ptr; c_type : GLenum);
procedure gluNurbsCallback (nurb : GLvoid_Ptr; which : GLenum; CallBackFunc : u_GLUfuncptr);
procedure gluNurbsCurve
(nurb : GLvoid_Ptr;
knotCount : GLint;
knots : access GLfloat;
stride : GLint;
control : access GLfloat;
order : GLint;
c_type : GLenum);
procedure gluNurbsProperty (nurb : GLvoid_Ptr; property : GLenum; value : GLfloat);
procedure gluNurbsSurface
(nurb : GLvoid_Ptr;
sKnotCount : GLint;
sKnots : access GLfloat;
tKnotCount : GLint;
tKnots : access GLfloat;
sStride : GLint;
tStride : GLint;
control : access GLfloat;
sOrder : GLint;
tOrder : GLint;
c_type : GLenum);
procedure gluOrtho2D
(left : GLdouble;
right : GLdouble;
bottom : GLdouble;
top : GLdouble);
procedure gluPartialDisk
(quad : GLvoid_Ptr;
inner : GLdouble;
outer : GLdouble;
slices : GLint;
loops : GLint;
start : GLdouble;
sweep : GLdouble);
procedure gluPerspective
(fovy : GLdouble;
aspect : GLdouble;
zNear : GLdouble;
zFar : GLdouble);
procedure gluPickMatrix
(x : GLdouble;
y : GLdouble;
delX : GLdouble;
delY : GLdouble;
viewport : access GLint);
function gluProject
(objX : GLdouble;
objY : GLdouble;
objZ : GLdouble;
model : access GLdouble;
proj : access GLdouble;
view : access GLint;
winX : access GLdouble;
winY : access GLdouble;
winZ : access GLdouble)
return GLint;
procedure gluPwlCurve
(nurb : GLvoid_Ptr;
count : GLint;
data : access GLfloat;
stride : GLint;
c_type : GLenum);
procedure gluQuadricCallback (quad : GLvoid_Ptr; which : GLenum; CallBackFunc : u_GLUfuncptr);
procedure gluQuadricDrawStyle (quad : GLvoid_Ptr; draw : GLenum);
procedure gluQuadricNormals (quad : GLvoid_Ptr; normal : GLenum);
procedure gluQuadricOrientation (quad : GLvoid_Ptr; orientation : GLenum);
procedure gluQuadricTexture (quad : GLvoid_Ptr; texture : GLboolean);
function gluScaleImage
(format : GLenum;
wIn : GLsizei;
hIn : GLsizei;
typeIn : GLenum;
dataIn : GLvoid_Ptr;
wOut : GLsizei;
hOut : GLsizei;
typeOut : GLenum;
dataOut : GLvoid_Ptr)
return GLint;
procedure gluSphere
(quad : GLvoid_Ptr;
radius : GLdouble;
slices : GLint;
stacks : GLint);
procedure gluTessBeginContour (tess : GLvoid_Ptr);
procedure gluTessBeginPolygon (tess : GLvoid_Ptr; data : GLvoid_Ptr);
procedure gluTessCallback (tess : GLvoid_Ptr; which : GLenum; CallBackFunc : u_GLUfuncptr);
procedure gluTessEndContour (tess : GLvoid_Ptr);
procedure gluTessEndPolygon (tess : GLvoid_Ptr);
procedure gluTessNormal
(tess : GLvoid_Ptr;
valueX : GLdouble;
valueY : GLdouble;
valueZ : GLdouble);
procedure gluTessProperty (tess : GLvoid_Ptr; which : GLenum; data : GLdouble);
procedure gluTessVertex (tess : GLvoid_Ptr; location : access GLdouble; data : GLvoid_Ptr);
function gluUnProject
(winX : GLdouble;
winY : GLdouble;
winZ : GLdouble;
model : access GLdouble;
proj : access GLdouble;
view : access GLint;
objX : access GLdouble;
objY : access GLdouble;
objZ : access GLdouble)
return GLint;
function gluUnProject4
(winX : GLdouble;
winY : GLdouble;
winZ : GLdouble;
clipW : GLdouble;
model : access GLdouble;
proj : access GLdouble;
view : access GLint;
nearVal : GLdouble;
farVal : GLdouble;
objX : access GLdouble;
objY : access GLdouble;
objZ : access GLdouble;
objW : access GLdouble)
return GLint;
private
pragma Import (Stdcall, gluBeginCurve, "gluBeginCurve");
pragma Import (Stdcall, gluBeginPolygon, "gluBeginPolygon");
pragma Import (Stdcall, gluBeginSurface, "gluBeginSurface");
pragma Import (Stdcall, gluBeginTrim, "gluBeginTrim");
pragma Import (Stdcall, gluBuild1DMipmaps, "gluBuild1DMipmaps");
pragma Import (Stdcall, gluBuild2DMipmaps, "gluBuild2DMipmaps");
pragma Import (Stdcall, gluCylinder, "gluCylinder");
pragma Import (Stdcall, gluDeleteNurbsRenderer, "gluDeleteNurbsRenderer");
pragma Import (Stdcall, gluDeleteQuadric, "gluDeleteQuadric");
pragma Import (Stdcall, gluDeleteTess, "gluDeleteTess");
pragma Import (Stdcall, gluDisk, "gluDisk");
pragma Import (Stdcall, gluEndCurve, "gluEndCurve");
pragma Import (Stdcall, gluEndPolygon, "gluEndPolygon");
pragma Import (Stdcall, gluEndSurface, "gluEndSurface");
pragma Import (Stdcall, gluEndTrim, "gluEndTrim");
pragma Import (Stdcall, gluErrorString, "gluErrorString");
pragma Import (Stdcall, gluErrorUnicodeStringEXT, "gluErrorUnicodeStringEXT");
pragma Import (Stdcall, gluGetNurbsProperty, "gluGetNurbsProperty");
pragma Import (Stdcall, gluGetString, "gluGetString");
pragma Import (Stdcall, gluGetTessProperty, "gluGetTessProperty");
pragma Import (Stdcall, gluLoadSamplingMatrices, "gluLoadSamplingMatrices");
pragma Import (Stdcall, gluLookAt, "gluLookAt");
pragma Import (Stdcall, gluNewNurbsRenderer, "gluNewNurbsRenderer");
pragma Import (Stdcall, gluNewQuadric, "gluNewQuadric");
pragma Import (Stdcall, gluNewTess, "gluNewTess");
pragma Import (Stdcall, gluNextContour, "gluNextContour");
pragma Import (Stdcall, gluNurbsCallback, "gluNurbsCallback");
pragma Import (Stdcall, gluNurbsCurve, "gluNurbsCurve");
pragma Import (Stdcall, gluNurbsProperty, "gluNurbsProperty");
pragma Import (Stdcall, gluNurbsSurface, "gluNurbsSurface");
pragma Import (Stdcall, gluOrtho2D, "gluOrtho2D");
pragma Import (Stdcall, gluPartialDisk, "gluPartialDisk");
pragma Import (Stdcall, gluPerspective, "gluPerspective");
pragma Import (Stdcall, gluPickMatrix, "gluPickMatrix");
pragma Import (Stdcall, gluProject, "gluProject");
pragma Import (Stdcall, gluPwlCurve, "gluPwlCurve");
pragma Import (Stdcall, gluQuadricCallback, "gluQuadricCallback");
pragma Import (Stdcall, gluQuadricDrawStyle, "gluQuadricDrawStyle");
pragma Import (Stdcall, gluQuadricNormals, "gluQuadricNormals");
pragma Import (Stdcall, gluQuadricOrientation, "gluQuadricOrientation");
pragma Import (Stdcall, gluQuadricTexture, "gluQuadricTexture");
pragma Import (Stdcall, gluScaleImage, "gluScaleImage");
pragma Import (Stdcall, gluSphere, "gluSphere");
pragma Import (Stdcall, gluTessBeginContour, "gluTessBeginContour");
pragma Import (Stdcall, gluTessBeginPolygon, "gluTessBeginPolygon");
pragma Import (Stdcall, gluTessCallback, "gluTessCallback");
pragma Import (Stdcall, gluTessEndContour, "gluTessEndContour");
pragma Import (Stdcall, gluTessEndPolygon, "gluTessEndPolygon");
pragma Import (Stdcall, gluTessNormal, "gluTessNormal");
pragma Import (Stdcall, gluTessProperty, "gluTessProperty");
pragma Import (Stdcall, gluTessVertex, "gluTessVertex");
pragma Import (Stdcall, gluUnProject, "gluUnProject");
pragma Import (Stdcall, gluUnProject4, "gluUnProject4");
end Sf.Window.GLU;
|
src/Bisimilarity/Up-to/CCS.agda | nad/up-to | 0 | 12794 | <filename>src/Bisimilarity/Up-to/CCS.agda
------------------------------------------------------------------------
-- Up-to techniques for CCS
------------------------------------------------------------------------
{-# OPTIONS --sized-types #-}
open import Prelude
module Bisimilarity.Up-to.CCS {ℓ} {Name : Type ℓ} where
open import Equality.Propositional
open import Logical-equivalence using (_⇔_)
open import Prelude.Size
open import Bijection equality-with-J using (_↔_)
open import Function-universe equality-with-J hiding (id; _∘_)
open import Bisimilarity.CCS
import Bisimilarity.Equational-reasoning-instances
open import Equational-reasoning
open import Indexed-container
open import Labelled-transition-system.CCS Name
open import Relation
open import Bisimilarity CCS
open import Bisimilarity.Step CCS _[_]⟶_ using (Step; Step↔StepC)
open import Bisimilarity.Up-to CCS
-- Up to context for a very simple kind of context.
Up-to-! : Trans₂ ℓ (Proc ∞)
Up-to-! R (P , Q) =
∃ λ P′ → ∃ λ Q′ → P ≡ ! P′ × R (P′ , Q′) × ! Q′ ≡ Q
-- This transformer is size-preserving.
up-to-!-size-preserving : Size-preserving Up-to-!
up-to-!-size-preserving R⊆∼i (P′ , Q′ , refl , P′RQ′ , refl) =
!-cong (R⊆∼i P′RQ′)
-- Up to context for CCS (for polyadic contexts).
Up-to-context : Trans₂ ℓ (Proc ∞)
Up-to-context R (P , Q) =
∃ λ n →
∃ λ (C : Context ∞ n) →
∃ λ Ps →
∃ λ Qs →
Equal ∞ P (C [ Ps ])
×
Equal ∞ Q (C [ Qs ])
×
∀ x → R (Ps x , Qs x)
-- Up to context is monotone.
up-to-context-monotone : Monotone Up-to-context
up-to-context-monotone R⊆S =
Σ-map id $ Σ-map id $ Σ-map id $ Σ-map id $ Σ-map id $ Σ-map id
(R⊆S ∘_)
-- Up to context is size-preserving.
up-to-context-size-preserving : Size-preserving Up-to-context
up-to-context-size-preserving
R⊆∼i {P , Q} (_ , C , Ps , Qs , eq₁ , eq₂ , Ps∼Qs) =
P ∼⟨ ≡→∼ eq₁ ⟩
C [ Ps ] ∼⟨ C [ R⊆∼i ∘ Ps∼Qs ]-cong ⟩
C [ Qs ] ∼⟨ symmetric (≡→∼ eq₂) ⟩■
Q
-- Note that up to context is not compatible (assuming that Name is
-- inhabited).
--
-- This counterexample is a minor variant of one due to Pous and
-- Sangiorgi, who state that up to context would have been compatible
-- if the Step function had been defined in a slightly different way
-- (see Remark 6.4.2 in "Enhancements of the bisimulation proof
-- method").
¬-up-to-context-compatible : Name → ¬ Compatible Up-to-context
¬-up-to-context-compatible x comp = contradiction
where
a = x , true
b = x , false
c = a
d = a
a≢b : ¬ a ≡ b
a≢b ()
data R : Rel₂ ℓ (Proc ∞) where
base : R (! name a ∙ (b ∙) , ! name a ∙ (c ∙))
data S₀ : Rel₂ ℓ (Proc ∞) where
base : S₀ (! name a ∙ (b ∙) ∣ b ∙ , ! name a ∙ (c ∙) ∣ c ∙)
S : Rel₂ ℓ (Proc ∞)
S = Up-to-bisimilarity S₀
d!ab[R]d!ac : Up-to-context R ( name d ∙ (! name a ∙ (b ∙))
, name d ∙ (! name a ∙ (c ∙))
)
d!ab[R]d!ac =
1
, name d · (λ { .force → hole fzero })
, (λ _ → ! name a ∙ (b ∙))
, (λ _ → ! name a ∙ (c ∙))
, refl · (λ { .force → Proc-refl _ })
, refl · (λ { .force → Proc-refl _ })
, (λ _ → base)
¬!ab[S]!ac : ¬ Up-to-context S (! name a ∙ (b ∙) , ! name a ∙ (c ∙))
¬!ab[S]!ac (n , C , Ps , Qs , !ab≡C[Ps] , !ac≡C[Qs] , PsSQs) =
$⟨ Matches-[] C ⟩
Matches ∞ (C [ Ps ]) C ↝⟨ Matches-cong (Proc-sym !ab≡C[Ps]) ⟩
Matches ∞ (! name a ∙ (b ∙)) C ↝⟨ helper !ab≡C[Ps] !ac≡C[Qs] ⟩□
⊥ □
where
helper : Equal ∞ (! name a ∙ (b ∙)) (C [ Ps ]) →
Equal ∞ (! name a ∙ (c ∙)) (C [ Qs ]) →
¬ Matches ∞ (! name a ∙ (b ∙)) C
helper !ab≡ _ (hole x) = case PsSQs x of λ where
(_ , Ps[x]∼!ab∣b , _ , base , _) →
$⟨ Ps[x]∼!ab∣b ⟩
Ps x ∼ ! name a ∙ (b ∙) ∣ b ∙ ↝⟨ transitive {a = ℓ} (≡→∼ !ab≡) ⟩
! name a ∙ (b ∙) ∼ ! name a ∙ (b ∙) ∣ b ∙ ↝⟨ (λ !ab∼!ab∣b → Σ-map id proj₁ $ StepC.right-to-left !ab∼!ab∣b (par-right action)) ⟩
(∃ λ P′ → ! name a ∙ (b ∙) [ name b ]⟶ P′) ↝⟨ cancel-name ∘ !-only ·-only ∘ proj₂ ⟩
a ≡ b ↝⟨ a≢b ⟩□
⊥ □
helper (! ab≡) (! ac≡) (! hole x) = case PsSQs x of λ where
(_ , Ps[x]∼!ab∣b , _ , base , _) →
$⟨ Ps[x]∼!ab∣b ⟩
Ps x ∼ ! name a ∙ (b ∙) ∣ b ∙ ↝⟨ transitive {a = ℓ} (≡→∼ ab≡) ⟩
name a ∙ (b ∙) ∼ ! name a ∙ (b ∙) ∣ b ∙ ↝⟨ (λ ab∼!ab∣b → Σ-map id proj₁ $ StepC.right-to-left ab∼!ab∣b (par-right action)) ⟩
(∃ λ P′ → name a ∙ (b ∙) [ name b ]⟶ P′) ↝⟨ cancel-name ∘ ·-only ∘ proj₂ ⟩
a ≡ b ↝⟨ a≢b ⟩□
⊥ □
helper (! (_ · b≡′)) (! (_ · c≡′)) (! action {C = C} M) =
case force C , force b≡′ , force c≡′ , force M {j = ∞} ⦂
(∃ λ C → Equal ∞ _ (C [ Ps ]) ×
Equal ∞ _ (C [ Qs ]) × Matches ∞ _ C) of λ where
(._ , b≡ , _ , hole x) → case PsSQs x of λ where
(_ , Ps[x]∼!ab∣b , _ , base , _) →
$⟨ Ps[x]∼!ab∣b ⟩
Ps x ∼ ! name a ∙ (b ∙) ∣ b ∙ ↝⟨ transitive {a = ℓ} (≡→∼ b≡) ⟩
b ∙ ∼ ! name a ∙ (b ∙) ∣ b ∙ ↝⟨ (λ b∼!ab∣b → Σ-map id proj₁ $
StepC.right-to-left b∼!ab∣b (par-left (replication (par-right action)))) ⟩
(∃ λ P′ → b ∙ [ name a ]⟶ P′) ↝⟨ cancel-name ∘ ·-only ∘ proj₂ ⟩
b ≡ a ↝⟨ a≢b ∘ sym ⟩□
⊥ □
(._ , _ , c≡b · _ , action _) →
$⟨ c≡b ⟩
name c ≡ name b ↝⟨ cancel-name ⟩
c ≡ b ↝⟨ a≢b ⟩□
⊥ □
R⊆StepS : R ⊆ ⟦ StepC ⟧ S
R⊆StepS base = StepC.⟨ lr , rl ⟩
where
lr : ∀ {P′ μ} →
! name a ∙ (b ∙) [ μ ]⟶ P′ →
∃ λ Q′ → ! name a ∙ (c ∙) [ μ ]⟶ Q′ × S (P′ , Q′)
lr {P′} {μ} !ab[μ]⟶P′ = case 6-1-3-2 !ab[μ]⟶P′ of λ where
(inj₁ (.(b ∙) , action , P′∼!ab∣b)) →
! name a ∙ (c ∙) ∣ c ∙
, replication (par-right action)
, _
, (P′ ∼⟨ P′∼!ab∣b ⟩■
! name a ∙ (b ∙) ∣ b ∙)
, _
, base
, (! name a ∙ (c ∙) ∣ c ∙ ■)
(inj₂ (μ≡τ , _)) → ⊥-elim $ name≢τ (
name a ≡⟨ !-only ·-only !ab[μ]⟶P′ ⟩
μ ≡⟨ μ≡τ ⟩∎
τ ∎)
rl : ∀ {Q′ μ} →
! name a ∙ (c ∙) [ μ ]⟶ Q′ →
∃ λ P′ → ! name a ∙ (b ∙) [ μ ]⟶ P′ × S (P′ , Q′)
rl {Q′} {μ} !ac[μ]⟶Q′ = case 6-1-3-2 !ac[μ]⟶Q′ of λ where
(inj₁ (.(c ∙) , action , Q′∼!ac∣c)) →
! name a ∙ (b ∙) ∣ b ∙
, replication (par-right action)
, _
, (! name a ∙ (b ∙) ∣ b ∙ ■)
, _
, base
, (! name a ∙ (c ∙) ∣ c ∙ ∼⟨ symmetric Q′∼!ac∣c ⟩■
Q′)
(inj₂ (μ≡τ , _)) → ⊥-elim $ name≢τ (
name a ≡⟨ !-only ·-only !ac[μ]⟶Q′ ⟩
μ ≡⟨ μ≡τ ⟩∎
τ ∎)
-- Note the use of compatibility in [R]⊆Step[S].
[R]⊆Step[S] : Up-to-context R ⊆ ⟦ StepC ⟧ (Up-to-context S)
[R]⊆Step[S] =
Up-to-context R ⊆⟨ up-to-context-monotone (λ {x} → R⊆StepS {x}) ⟩
Up-to-context (⟦ StepC ⟧ S) ⊆⟨ comp ⟩∎
⟦ StepC ⟧ (Up-to-context S) ∎
contradiction : ⊥
contradiction =
$⟨ d!ab[R]d!ac ⟩
Up-to-context R ( name d ∙ (! name a ∙ (b ∙))
, name d ∙ (! name a ∙ (c ∙))
) ↝⟨ [R]⊆Step[S] ⟩
⟦ StepC ⟧ (Up-to-context S) ( name d ∙ (! name a ∙ (b ∙))
, name d ∙ (! name a ∙ (c ∙))
) ↝⟨ (λ s → StepC.left-to-right s action) ⟩
(∃ λ P → name d ∙ (! name a ∙ (c ∙)) [ name d ]⟶ P ×
Up-to-context S (! name a ∙ (b ∙) , P)) ↝⟨ (λ { (P , d!ac[d]⟶P , !ab[S]P) →
subst (Up-to-context S ∘ (_ ,_)) (·-only⟶ d!ac[d]⟶P) !ab[S]P }) ⟩
Up-to-context S (! name a ∙ (b ∙) , ! name a ∙ (c ∙)) ↝⟨ ¬!ab[S]!ac ⟩□
⊥ □
|
Task/Collections/Ada/collections-4.ada | LaudateCorpus1/RosettaCodeData | 1 | 12522 | with Ada.Containers.Doubly_Linked_Lists;
use Ada.Containers;
procedure Doubly_Linked_List is
package DL_List_Pkg is new Doubly_Linked_Lists (Integer);
use DL_List_Pkg;
DL_List : List;
begin
DL_List.Append (1);
DL_List.Append (2);
DL_List.Append (3);
end Doubly_Linked_List;
|
echoTest.applescript | rcmdnk/AppleScript | 11 | 223 | <reponame>rcmdnk/AppleScript
property DEBUG : true
property LOG_DIR : "~/log/"
property LOG_FILE : ""
-- Prepare log file
if DEBUG then
do shell script "mkdir -p " & LOG_DIR
set LOG_FILE to LOG_DIR & (name of me) & ".log"
log "Log file: " & LOG_FILE
end if
-- Log output function
on echo(txt)
if DEBUG then
do shell script "echo '[" & (current date) & "] " & txt & "' >> " & LOG_FILE
log "[" & (current date) & "] " & txt
end if
end echo
-- Test log
echo("test output")
|
hello_world.asm | AravindVasudev/x86-64_programs | 0 | 168756 | <reponame>AravindVasudev/x86-64_programs
section .data
hello db "<NAME>",10
section .text
global _start
_start:
mov rax, 1 ; sys_write
mov rdi, 1 ; standard output
mov rsi, hello ; buffer
mov rdx, 14 ; buffer size
syscall
mov rax, 60 ; sys_exit
mov rdi, 0 ; return 0
syscall
|
test/Succeed/LevelLeqGeq.agda | cruhland/agda | 1,989 | 17098 | -- Andreas, 2016-09-28
-- Level constraints X <= a and a <= X should solve X = a.
-- {-# OPTIONS -v tc.constr.add:40 #-}
open import Common.Level
module _ (a : Level) where
mutual
X : Level
X = _
data C : Set (lsuc X) where
c : Set a → C -- constrains X by a <= X
data D : Set (lsuc a) where
c : Set X → D -- constrains X by X <= a
-- should succeed
|
src/Examples/Gcd/Spec.agda | jonsterling/agda-calf | 29 | 15130 | <gh_stars>10-100
{-# OPTIONS --prop --rewriting #-}
module Examples.Gcd.Spec where
open import Calf.CostMonoid
import Calf.CostMonoids as CM
open import Calf CM.ℕ-CostMonoid
open import Calf.Types.Nat
open import Examples.Gcd.Euclid
open import Examples.Gcd.Clocked
open import Data.Nat.DivMod
open import Data.Nat
open import Relation.Binary.PropositionalEquality as P
open import Data.Nat.Properties
open import Data.Product
gcd/clocked≡spec/zero : ∀ k x h → k ≥ gcd/depth (x , ℕ.zero , h) →
◯ (gcd/clocked k (x , ℕ.zero , h) ≡ ret {nat} x)
gcd/clocked≡spec/zero ℕ.zero x h h1 u = refl
gcd/clocked≡spec/zero (suc k) x h h1 u = refl
suc-cancel-≤ : ∀ {m n} → suc m ≤ suc n → m ≤ n
suc-cancel-≤ (s≤s h) = h
gcd/clocked/mono : ∀ k x y h → k ≥ gcd/depth (x , y , h) →
gcd/clocked k (x , y , h) ≡ gcd/clocked (suc k) (x , y , h)
gcd/clocked/mono ℕ.zero x ℕ.zero h h1 = refl
gcd/clocked/mono (suc k) x ℕ.zero h h1 = refl
gcd/clocked/mono (suc k) x (suc y) h h1 =
begin
gcd/clocked (suc k) (x , suc y , h) ≡⟨ refl ⟩
step (F nat) 1 (gcd/clocked k (suc y , x % suc y , m%n<n x y)) ≡⟨
P.cong (step (F nat) 1)
(gcd/clocked/mono k (suc y) (x % suc y) (m%n<n x y)
(suc-cancel-≤ (P.subst (λ r → suc k ≥ r) (gcd/depth-unfold-suc {x} {y} {h}) h1))) ⟩
step (F nat) 1 (gcd/clocked (suc k) (suc y , x % suc y , m%n<n x y))
∎
where open ≡-Reasoning
gcd/clocked≡spec/suc : ∀ k x y h → k ≥ gcd/depth (x , suc y , h) →
◯ (gcd/clocked k (x , suc y , h) ≡ gcd/clocked k (suc y , x % suc y , m%n<n x y))
gcd/clocked≡spec/suc (suc k) x y h h1 u =
begin
gcd/clocked (suc k) (x , suc y , h) ≡⟨ refl ⟩
step (F nat) 1 (gcd/clocked k (suc y , x % suc y , m%n<n x y)) ≡⟨ step/ext (F nat) ((gcd/clocked k (suc y , x % suc y , m%n<n x y))) 1 u ⟩
gcd/clocked k (suc y , x % suc y , m%n<n x y) ≡⟨ gcd/clocked/mono k (suc y) (x % suc y) (m%n<n x y)
(suc-cancel-≤ (P.subst (λ r → suc k ≥ r) (gcd/depth-unfold-suc {x} {y} {h}) h1)) ⟩
gcd/clocked (suc k) (suc y , x % suc y , m%n<n x y)
∎
where open ≡-Reasoning
gcd≡spec/zero : ∀ x h → ◯ (gcd (x , 0 , h) ≡ ret {nat} x)
gcd≡spec/zero x h = gcd/clocked≡spec/zero (gcd/depth (x , 0 , h)) x h ≤-refl
gcd≡spec/suc : ∀ x y h → ◯ (gcd (x , suc y , h) ≡ gcd (suc y , x % suc y , m%n<n x y))
gcd≡spec/suc x y h u =
begin
gcd (x , suc y , h) ≡⟨ gcd/clocked≡spec/suc (gcd/depth (x , suc y , h)) x y h ≤-refl u ⟩
gcd/clocked (gcd/depth (x , suc y , h)) (suc y , x % suc y , m%n<n x y) ≡⟨
cong (λ k → gcd/clocked k (suc y , x % suc y , m%n<n x y))
(gcd/depth-unfold-suc {x} {y} {h}) ⟩
gcd/clocked (suc (gcd/depth (suc y , x % suc y , m%n<n x y))) (suc y , x % suc y , m%n<n x y) ≡⟨
sym (gcd/clocked/mono
(gcd/depth (suc y , x % suc y , m%n<n x y)) (suc y) (x % suc y) (m%n<n x y) ≤-refl) ⟩
gcd/clocked (gcd/depth (suc y , x % suc y , m%n<n x y)) (suc y , x % suc y , m%n<n x y)
∎
where open ≡-Reasoning
|
libsrc/_DEVELOPMENT/target/vgl/device/lcd/vgl_lcd.asm | jpoikela/z88dk | 38 | 166824 | <gh_stars>10-100
INCLUDE "config_private.inc"
;SECTION data_clib
;SECTION data_vgl_lcd
SECTION code_driver
PUBLIC vgl_lcd_init
PUBLIC __vgl_lcd_init
__vgl_lcd_init:
vgl_lcd_init:
; This performs the LCD initialization
; as seen in several ROMs and in the HD44780 data sheet itself:
call delay_010f
call delay_010f
; Enter 8 bit mode
ld a, 0x38
call out_0x0a
; delay 0x330 in total
call delay_010f
call delay_010f
ld a, 0x38
call out_0x0a
; delay 0x330 in total
call delay_010f
call delay_010f
ld a, 0x38
call out_0x0a
; delay 0x330 in total
call delay_010f
call delay_010f
ld a, 0x38
call out_0x0a
; delay 0x330 in total
call delay_010f
call delay_010f
; Cursor on?
ld a, 0x0f
call out_0x0a
ld a, 0x0e
call out_0x0a
ld a, 0x0c
call out_0x0a
; CLS?
ld a, 0x01
call out_0x0a
ld a, 0x06
call out_0x0a
ld a, 0x04
call out_0x0a
ld a, 0x01
call out_0x0a
; delay 0x330 in total
call delay_010f
call delay_010f
ld a, 0x02
call out_0x0a
; delay 0x330 in total
call delay_010f
call delay_010f
; End of lcd_reset()
; First byte is missing if we do not delay enough
call delay_010f
; ; Problem: The cursor is not showing up when not doing this:
; ; Fill screen manually (needed for the cursor to show up!)
; push hl
; push bc
; ld hl, __VGL_DISPLAY_VRAM_START
; ld bc, __VGL_DISPLAY_COLS*__VGL_DISPLAY_ROWS ; Number of chars
; ld a, 0x20 ; Which char to use: SPACE
; _screen_clear_loop:
; ld (hl), a
; inc hl
; djnz _screen_clear_loop
; pop bc
; pop hl
;
; call delay_010f
ret
out_0x0a:
out (0ah),a
;call delay_010f
;ret
delay_010f:
; Used for screen functions (after putting stuff to ports 0x0a or 0x0b)
push hl
ld hl, 010fh
_delay_010f_loop:
dec l
jr nz, _delay_010f_loop
dec h
jr nz, _delay_010f_loop
pop hl
ret
|
Now_not_using/Mars_for_cpu/mips12.asm | leealim/Code | 0 | 102390 | .data
.text
main:
lui $t1,1
lui $t2,2
lui $t3,10
add $t2,$t1,$t3
sw $t1,($t2)
lw $t1,($t2)
j loop
exit:
syscall
loop:
addiu $t1,$t3,8
ori $t2,$t3,12
beq $t1,$t2,exit
|
models/hol/margrave/gradePolicy.als | johnwickerson/alloystar | 2 | 404 | /**
* A model of grade assignment policy
* Demonstrates automated synthesis of policies in Alloy*
* Based on the running example from the paper
* "Verification and change-impact analysis of access-control policies" by
* <NAME>, <NAME>, <NAME>, <NAME>, ICSE 2005.
*/
module GradePolicy
--------------------------------------------------------------------------------
-- Basic signatures
--------------------------------------------------------------------------------
abstract sig Resource {}
abstract sig Action {}
abstract sig Role {}
sig User {}
--------------------------------------------------------------------------------
-- Domain-specific signatures
--------------------------------------------------------------------------------
one sig Faculty, Student, TA extends Role {}
one sig IntGrade, ExtGrade extends Resource {}
one sig Assign, Receive extends Action {}
--------------------------------------------------------------------------------
-- Properties
--------------------------------------------------------------------------------
/* no student can assign external grade */
pred prop1[roles : User->Role, performs : User->Action->Resource] {
no u: User | u.roles = Student and Assign->ExtGrade in u.performs
}
/* no user can both receive and assign external grades */
pred prop2[roles : User->Role, performs : User->Action->Resource] {
no u: User | Assign + Receive in u.performs.ExtGrade
}
/* ’performs’ describes the behavior of users */
pred enforce[acl: Role->Action->Resource,
roles: User->Role,
performs: User->Action->Resource] {
all u: User, a: Action, r: Resource |
/* ’u’ can perform ’a’ on ’r’ only if allowed by ’acl’ */
u->a->r in performs => (some ro: u.roles | ro->a->r in acl)
}
/* Assumption: no user can both be a faculty and a student/TA */
pred noDualRoles[roles : User->Role] {
no u: User | Faculty in u.roles and some (Student + TA) & u.roles
}
--------------------------------------------------------------------------------
-- Synthesis predicates
--------------------------------------------------------------------------------
/* ’acl’ satisfies properties over every user role and behavior */
pred valid[acl: Role->Action->Resource] {
all roles: User->Role, performs : User->Action->Resource |
(enforce[acl, roles, performs] and noDualRoles[roles]) implies
(prop1[roles, performs] and prop2[roles, performs])
}
/* ’acl’ allows the most number of actions while being valid */
pred mostPermissive[acl: Role->Action->Resource] {
valid[acl]
no acl': Role->Action->Resource |
acl != acl' and valid[acl'] and #acl' > #acl
}
--------------------------------------------------------------------------------
-- Commands
--------------------------------------------------------------------------------
run valid for 4 but 6 Int -- synthesize a valid policy
run mostPermissive for 4 but 6 Int -- synthesize the most permissive valid policy
|
scroll.asm | Kristopher38/C64-platformer | 0 | 13689 | <filename>scroll.asm
!cpu 6502
*= $0400
!src "fire.asm"
*= $0800
!byte $00, $0b, $08, $01, $00, $9e, $34, $30, $39, $36
*= $1000
scrbuf1 = $0400
scrbuf2 = $0800
main:
jsr initScreen
sei ; set interrupt disable flag
ldy #$7f ; $7f = %01111111
sty $dc0d ; Turn off CIAs Timer interrupts
sty $dd0d ; Turn off CIAs Timer interrupts
lda $dc0d ; cancel all CIA-IRQs in queue/unprocessed
lda $dd0d ; cancel all CIA-IRQs in queue/unprocessed
lda #$01 ; Set Interrupt Request Mask...
sta $d01a ; ...we want IRQ by Rasterbeam
lda #<irq ; point IRQ Vector to our custom irq routine
ldx #>irq
sta $314 ; store in $314/$315
stx $315
lda #$00 ; trigger first interrupt at row zero
sta $d012
lda $d011 ; Bit#0 of $d011 is basically...
and #$7f ; ...the 9th Bit for $d012
sta $d011 ; we need to make sure it is set to zero
cli ; clear interrupt disable flag
jmp * ; infinite loop
initScreen:
lda #$00
sta $d020
sta $d021
rts
;============================================================
; custom interrupt routine
;============================================================
.xscroll !fill 1, $08
irq:
dec $d019 ; acknowledge IRQ
;lda #$0a
;sta $d020 ; change frame color for assesing how much time interrupt took
jsr decxscroll
lda .xscroll
beq .shiftOneChar ; we cycled through values 7 to 0 so we need to shift the whole screen one char position
cmp #$07
beq .swapBuf ; if xscroll is 7 we shifted all chars by one position one irq before
; so we need to change the displayed buffer
jmp .exit
.swapBuf
jsr swapBuffers
jmp .exit
.shiftOneChar
lda #$08
sta .xscroll
jsr shiftScreen ; and shift entire screen by one character
.exit
;lda #$05
;sta $d020 ; reset frame color for assesing how much time irq took
jmp $ea81 ; return to kernel interrupt routine
decxscroll:
dec .xscroll
lda $d016 ; if not, we load a register that holds x scroll offset
and #$f8 ; mask off appropriate values (4 most significant bits)
clc
adc .xscroll ; add our scroll value
sta $d016 ; and store it back
rts
!zone swapBuffers
swapBuffers:
lda currentCycle
bne .secondCycle
lda $d018
and #!$20 ; turn off bit for buffer at $0400
ora #$10 ; turn on bit for buffer at $0800
sta $d018
jmp .exit
.secondCycle
lda $d018
and #!$10 ; turn off bit for buffer at $0800
ora #$20 ; turn on bit for buffer at $0400
sta $d018
.exit:
rts
!zone shiftScreen
currentCycle !fill 1, $00 ; 0 or 1, depends on current front and backbuffer
shiftScreen:
lda currentCycle
bne .secondCycle
; call appropriate subroutine for shifting screen to an appropriate framebuffer
jsr shiftToBuf2
lda #$01
sta currentCycle ; change current cycle to opposite
jmp .exit
.secondCycle
lda #$00
sta currentCycle ; change current cycle to opposite
jsr shiftToBuf1
.exit
rts
shiftToBuf2:
ldx #$00
.loop
; copy characters from scrbuf1 to scrbuf2 offset one character to the left
; disregard characters that would wrap around from the right for now
lda scrbuf1 + $001, x
sta scrbuf2 + $000, x
lda scrbuf1 + $101, x
sta scrbuf2 + $100, x
lda scrbuf1 + $201, x
sta scrbuf2 + $200, x
lda scrbuf1 + $2e9, x
sta scrbuf2 + $2e8, x
inx
bne .loop
; correctly copy characters that should wrap around, from the left edge to the the right edge
!for i, 0, 24 {
lda scrbuf1 + i * 40
sta scrbuf2 - 1 + (i + 1) * 40
}
rts
!zone shiftToBuf1
shiftToBuf1:
ldx #$00
.loop
; same as above but copies from scrbuf2 to scrbuf1
lda scrbuf2 + $001, x
sta scrbuf1 + $000, x
lda scrbuf2 + $101, x
sta scrbuf1 + $100, x
lda scrbuf2 + $201, x
sta scrbuf1 + $200, x
lda scrbuf2 + $2e9, x
sta scrbuf1 + $2e8, x
inx
bne .loop
!for i, 0, 24 {
lda scrbuf2 + i * 40
sta scrbuf1 - 1 + (i + 1) * 40
}
rts
!zone delay
delay:
ldx $00
.loop
!for i, 0, 5 {
nop
}
inx
bne .loop
rts |
Appl/Games/Amateur/amateurCommon.asm | steakknife/pcgeos | 504 | 178994 | COMMENT @---------------------------------------------------------------------
Copyright (c) GeoWorks 1991 -- All rights reserved
PROJECT: Amateur Night
MODULE: common
FILE: amateurCommon.asm
AUTHOR: <NAME>
ROUTINES:
Name Description
---- -----------
REVISION HISTORY:
Name Date Description
---- ---- -----------
DESCRIPTION: common routines
$Id: amateurCommon.asm,v 1.1 97/04/04 15:12:26 newdeal Exp $
-----------------------------------------------------------------------------@
AmateurCode segment resource
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DrawDot
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Draw a dot (peanut or pellet)
CALLED BY:
PASS: cx, dx - position
ax - color
RETURN: nothing
DESTROYED: ax,bx
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
REVISION HISTORY:
Name Date Description
---- ---- -----------
CDB 2/11/92 Initial version.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
DrawDot proc near
uses di
.enter
mov di, es:[gstate]
call GrSetAreaColor
mov ax, cx
mov bx, dx
call GrDrawPoint
.leave
ret
DrawDot endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
GetBackgroundColor
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Return the current background color
CALLED BY: everywhere
PASS: ds - segment of gameObjects
RETURN: ax - background color
DESTROYED: nothing
PSEUDO CODE/STRATEGY:
Just go in and look at the content's instance data w/o regard
for object orientation, etc.
KNOWN BUGS/SIDE EFFECTS/IDEAS:
REVISION HISTORY:
Name Date Description
---- ---- -----------
CDB 2/ 7/92 Initial version.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
GetBackgroundColor proc near
uses si
class AmateurContentClass
.enter
assume ds:GameObjects
mov si, ds:[ContentObject]
add si, ds:[si].Vis_offset
mov ax, ds:[si].ACI_colorInfo.CI_background
assume ds:dgroup
.leave
ret
GetBackgroundColor endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
CalcClownSize
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: return the clown's size
CALLED BY:
PASS: es - dgroup
RETURN: cx, dx - clown size
DESTROYED: nothing
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/IDEAS:
REVISION HISTORY:
Name Date Description
---- ---- -----------
CDB 3/26/92 Initial version.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
CalcClownSize proc near
.enter
cmp es:[displayType], CGA_DISPLAY_TYPE
je cga
mov cx, STANDARD_CLOWN_WIDTH
mov dx, STANDARD_CLOWN_HEIGHT
jmp done
cga:
mov cx, CGA_CLOWN_WIDTH
mov dx, CGA_CLOWN_HEIGHT
done:
mov es:[clownWidth], cx
mov es:[clownHeight], dx
.leave
ret
CalcClownSize endp
AmateurCode ends
|
spawn_shell.asm | tomruk/shellcode-arsenal | 2 | 102208 | <filename>spawn_shell.asm
format elf executable
entry start
start:
; Save all registers
pushad
; Save frame pointer
push ebp
mov ebp, esp
; NULL terminator
xor eax, eax
push eax
; One byte
sub esp, 1
mov byte[esp], 68h
push 7361622fh
push 6e69622fh
; "/bin/bash\0"
; 10 bytes
; setreuid
mov eax, 70
xor ebx, ebx
xor ecx, ecx
int 0x80
; execve
mov eax, 11
lea ebx, [esp]
xor ecx, ecx
int 0x80
mov esp, ebp
pop ebp
popad
; Exit
mov eax, 1
xor ebx, ebx
int 0x80
|
src/FRP/LTL/ISet/Causal.agda | agda/agda-frp-ltl | 21 | 7142 | <gh_stars>10-100
open import Coinduction using ( ∞ ; ♯_ ; ♭ )
open import Data.Product using ( ∃ ; _×_ ; _,_ ; proj₂ )
open import Data.Nat using ( ℕ ; zero ; suc )
open import Data.Empty using ( ⊥ )
open import FRP.LTL.ISet.Core using ( ISet ; M⟦_⟧ ; ⟦_⟧ ; ⌈_⌉ ; _,_ ; splitM⟦_⟧ ) renaming ( [_] to ⟪_⟫ )
open import FRP.LTL.ISet.Globally using ( □ ; [_] )
open import FRP.LTL.ISet.Stateless using ( _⇒_ ; _$_ )
open import FRP.LTL.RSet.Core using ( RSet )
open import FRP.LTL.Time.Bound using
( Time∞ ; fin ; +∞ ; _≺_ ; _≼_ ; _⋠_ ; ≺-Indn ; _,_
; ≺-impl-≼ ; ≼-refl ; _≼-trans_ ; ≡-impl-≽ ; ≺-impl-≢ ; ≺-impl-⋡ ; t≺+∞ ; ∞≼-impl-≡∞ ; ≺-indn )
open import FRP.LTL.Time.Interval using ( [_⟩ ; Int ; ↑ )
open import FRP.LTL.Util using ( ⊥-elim )
open import Relation.Binary.PropositionalEquality using ( _≡_ ; refl )
open import Relation.Unary using ( _∈_ )
module FRP.LTL.ISet.Causal where
infixr 2 _⊵_
infixr 3 _⋙_ _≫_ _⊨_≫_
-- A ⊵ B is the causal function space from A to B
data _∙_⊸_∙_ (A : ISet) (s : Time∞) (B : ISet) (u : Time∞) : Set where
inp : .(s ≼ u) → .(u ≺ +∞) →
(∀ {t} .(s≺t : s ≺ t) → M⟦ A ⟧ [ s≺t ⟩ → ∞ (A ∙ t ⊸ B ∙ u)) →
(A ∙ s ⊸ B ∙ u)
out : ∀ {v} .(u≺v : u ≺ v) →
M⟦ B ⟧ [ u≺v ⟩ → ∞ (A ∙ s ⊸ B ∙ v) →
(A ∙ s ⊸ B ∙ u)
done : .(u ≡ +∞) →
(A ∙ s ⊸ B ∙ u)
_⊵_ : ISet → ISet → ISet
A ⊵ B = ⌈ (λ t → A ∙ fin t ⊸ B ∙ fin t) ⌉
-- Categorical structure
ar : ∀ {A B} t → M⟦ A ⇒ B ⟧ (↑ t) → (A ∙ fin t ⊸ B ∙ fin t)
ar {A} {B} t f = inp ≼-refl t≺+∞ P where
P : ∀ {u} .(t≺u : fin t ≺ u) → M⟦ A ⟧ [ t≺u ⟩ → ∞ (A ∙ u ⊸ B ∙ fin t)
P {+∞} t≺u σ = ♯ out t≺u (f $ σ) (♯ done refl)
P {fin u} t≺u σ with splitM⟦ A ⇒ B ⟧ [ t≺u ⟩ (↑ u) refl f
P {fin u} t≺u σ | (f₁ , f₂) = ♯ out t≺u (f₁ $ σ) (♯ ar u f₂)
arr : ∀ {A B} → ⟦ □ (A ⇒ B) ⇒ (A ⊵ B) ⟧
arr ⟪ ⟪ f ⟫ ⟫ = ⟪ (λ t t∈i → ar t (f t t∈i) ) ⟫
-- We could define id in terms of arr, but we define it explictly for efficiency.
id : ∀ {A} t → (A ∙ t ⊸ A ∙ t)
id +∞ = done refl
id (fin t) = inp ≼-refl t≺+∞ (λ {u} t≺u σ → ♯ out t≺u σ (♯ id u))
identity : ∀ {A} → ⟦ A ⊵ A ⟧
identity = ⟪ (λ t t∈i → id (fin t)) ⟫
-- The following typechecks but does not pass the termination checker,
-- due to the possibility of infinite left-to-right chatter:
-- _≫_ : ∀ {A B C s t u} → (A ∙ s ⊸ B ∙ t) → (B ∙ t ⊸ C ∙ u) → (A ∙ s ⊸ C ∙ u)
-- P ≫ out u≺w τ Q = out u≺w τ (♯ (P ≫ ♭ Q))
-- P ≫ done u≡∞ = done u≡∞
-- inp s≼t t≺∞ P ≫ inp t≼u u≺∞ Q = inp (s≼t ≼-trans t≼u) u≺∞ (λ s≺v σ → ♯ (♭ (P s≺v σ) ≫ inp t≼u u≺∞ Q))
-- done t≡∞ ≫ inp t≼u u≺∞ Q = ⊥-elim (≺-impl-≢ u≺∞ (∞≼-impl-≡∞ (≡-impl-≽ t≡∞ ≼-trans t≼u)))
-- out t≺v σ P ≫ inp t≼u u≺∞ Q = out t≺v σ P ≫ inp t≼u u≺∞ Q
-- We have to be explicit about the induction scheme in the case of left-to-right
-- communication, which is because, for any t and u ≺ ∞, there is a bound
-- on the length of any ≺-chain between t and u.
mutual
_⊨_≫_ : ∀ {A B C s t u} → (≺-Indn t u) → (A ∙ s ⊸ B ∙ t) → (B ∙ t ⊸ C ∙ u) → (A ∙ s ⊸ C ∙ u)
n , t+n≻u ⊨ P ≫ out u≺w τ Q = out u≺w τ (♯ (P ≫ ♭ Q))
n , t+n≻u ⊨ P ≫ done u≡∞ = done u≡∞
n , t+n≻u ⊨ inp s≼t t≺∞ P ≫ inp t≼u u≺∞ Q = inp (s≼t ≼-trans t≼u) u≺∞ (λ s≺v σ → ♯ (♭ (P s≺v σ) ≫ inp t≼u u≺∞ Q))
n , t+n≻u ⊨ done t≡∞ ≫ inp t≼u u≺∞ Q = ⊥-elim (≺-impl-≢ u≺∞ (∞≼-impl-≡∞ (≡-impl-≽ t≡∞ ≼-trans t≼u)))
zero , u≺t ⊨ out t≺v σ P ≫ inp t≼u u≺∞ Q = ⊥-elim (≺-impl-⋡ u≺t t≼u)
suc n , t+1+n≻u ⊨ out t≺v σ P ≫ inp t≼u u≺∞ Q = n , t+1+n≻u t≺v ⊨ ♭ P ≫ ♭ (Q t≺v σ)
_≫_ : ∀ {A B C s t u} → (A ∙ s ⊸ B ∙ t) → (B ∙ t ⊸ C ∙ u) → (A ∙ s ⊸ C ∙ u)
P ≫ out u≺w τ Q = out u≺w τ (♯ (P ≫ ♭ Q))
P ≫ done u≡∞ = done u≡∞
inp s≼t t≺∞ P ≫ inp t≼u u≺∞ Q = inp (s≼t ≼-trans t≼u) u≺∞ (λ s≺v σ → ♯ (♭ (P s≺v σ) ≫ inp t≼u u≺∞ Q))
done t≡∞ ≫ inp t≼u u≺∞ Q = ⊥-elim (≺-impl-≢ u≺∞ (∞≼-impl-≡∞ (≡-impl-≽ t≡∞ ≼-trans t≼u)))
out t≺v σ P ≫ inp t≼u u≺∞ Q = ≺-indn u≺∞ ⊨ out t≺v σ P ≫ inp t≼u u≺∞ Q
_⋙_ : ∀ {A B C} → ⟦ (A ⊵ B) ⇒ (B ⊵ C) ⇒ (A ⊵ C) ⟧
(⟪ ⟪ f ⟫ ⟫ ⋙ ⟪ ⟪ g ⟫ ⟫) = ⟪ (λ t t∈i → f t t∈i ≫ g t t∈i) ⟫
-- Apply a process to some of its output
_/_/_ : ∀ {A B s t u} → (A ∙ s ⊸ B ∙ u) → .(s≺t : s ≺ t) → M⟦ A ⟧ [ s≺t ⟩ → (A ∙ t ⊸ B ∙ u)
inp s≼u u≺∞ P / s≺t / σ = ♭ (P s≺t σ)
out u≺v τ P / s≺t / σ = out u≺v τ (♯ (♭ P / s≺t / σ))
done u≡∞ / s≺t / σ = done u≡∞
|
source/string/functions/memory.asm | paulscottrobson/6502-basic | 3 | 1630 | <gh_stars>1-10
; ************************************************************************************************
; ************************************************************************************************
;
; Name: memory.asm
; Purpose: String memory handler
; Created: 27th February 2021
; Reviewed: 8th March 2021
; Author: <NAME> (<EMAIL>)
;
; ************************************************************************************************
; ************************************************************************************************
.section zeroPage
softMemAlloc: ; memory allocated for temporary strings
.fill 2 ; if MSB is zero needs resetting on allocation.
.send zeroPage
.section code
; ************************************************************************************************
;
; Allocate A bytes of soft string memory, and set the current pointer (softMemAlloc)
; to it with an empty string.
;
; Soft string is for intermediate calculations, and is allocate 256 bytes below the
; current end of memory. To store a string, it has to be 'concreted'
;
; ************************************************************************************************
AllocateSoftString: ; allocae soft string memory
sta tempShort ; save count
.pshy ; save Y
lda softMemAlloc+1 ; if the high byte is zero, it needs allocating.
bne _ASSDone
lda highMemory ; reset the soft memory alloc pointer.
sta softMemAlloc ; to speed up slightly, we only reset this when we first need it
ldy highMemory+1 ; but it needs to be reset before each command.
dey ; it is set to 1/4k below high memory, allowing space
sty softMemAlloc+1 ; for a concreted string.
_ASSDone:
sec ; allocate downwards enough memory
lda softMemAlloc ; subtract the memory requirements in A from
sbc tempShort ; the soft memory pointer
sta softMemAlloc
lda softMemAlloc+1
sbc #0
sta softMemAlloc+1
;
lda #0 ; empty that string, set the length = 0.
tay
sta (softMemAlloc),y
.puly ; restore Y and exit.
rts
; ************************************************************************************************
;
; Write character A to current soft string
;
; ************************************************************************************************
WriteSoftString:
sty tempShort ; save Y
;
pha ; save character on stack
ldy #0 ; get and bump length
lda (softMemAlloc),y
clc
adc #1
sta (softMemAlloc),y
tay ; offset in Y
;
pla ; get char and write.
sta (softMemAlloc),y
ldy tempShort ; restore Y and exit.
rts
; ************************************************************************************************
;
; Clone soft string at temp0 to TOS
;
; ************************************************************************************************
StrClone: ;; <clone>
tax ; set up stack.
.pshy
;
ldy #0 ; get length, add 1 for length
lda (temp0),y ; this is the bytes required.
clc
adc #1
jsr AllocateSoftString ; allocate soft memory
;
lda softMemAlloc ; copy that address to TOS
sta esInt0,x
lda softMemAlloc+1
sta esInt1,x
lda #0 ; zero upper 2 bytes
sta esInt2,x
sta esInt3,x
lda #$40 ; set type to string.
sta esType,x
;
jsr SCCopyTemp0 ; copy temp0 string to soft memory copy (concat.asm)
.puly
txa
rts
.send code
; ************************************************************************************************
;
; Changes and Updates
;
; ************************************************************************************************
;
; Date Notes
; ==== =====
; 07-Mar-21 Pre code read v0.01
;
; ************************************************************************************************
|
tools/scanner_transformer/scanner_analyzer.adb | svn2github/matreshka | 24 | 13562 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010, <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 Scanner_Extractor;
with Scanner_Utilities;
package body Scanner_Analyzer is
use Scanner_Extractor;
use Scanner_Utilities;
procedure Set_0000_Class_To_FFFE_Class;
-- Sets meta class of 16#0000# code point to meta class of 16#FFFE# code
-- point.
-------------
-- Analyze --
-------------
procedure Analyze is
begin
case Mode is
when Regexp =>
null;
when XML =>
Set_0000_Class_To_FFFE_Class;
end case;
end Analyze;
----------------------------------
-- Set_0000_Class_To_FFFE_Class --
----------------------------------
procedure Set_0000_Class_To_FFFE_Class is
procedure Lookup (Position : Plane_Vectors.Cursor);
-- Searchs 16#00FF# plane and extract meta class.
procedure Modify (Position : Plane_Vectors.Cursor);
-- Searchs 16#0000# plane and modify meta class.
Meta_Class : Integer := 0;
------------
-- Lookup --
------------
procedure Lookup (Position : Plane_Vectors.Cursor) is
Plane : constant Plane_Information
:= Plane_Vectors.Element (Position);
begin
if Plane.Number = 16#00FF# then
Meta_Class := Plane.Values.Element (16#FE#);
end if;
end Lookup;
------------
-- Modify --
------------
procedure Modify (Position : Plane_Vectors.Cursor) is
Plane : Plane_Information := Plane_Vectors.Element (Position);
begin
if Plane.Number = 16#0000# then
Plane.Values.Replace_Element (16#00#, Meta_Class);
YY_EC_Planes.Replace_Element (Position, Plane);
end if;
end Modify;
begin
YY_EC_Planes.Iterate (Lookup'Access);
if Meta_Class = 0 then
raise Program_Error;
end if;
YY_EC_Planes.Iterate (Modify'Access);
end Set_0000_Class_To_FFFE_Class;
end Scanner_Analyzer;
|
gcc-gcc-7_3_0-release/gcc/ada/i-vxinco.adb | best08618/asylo | 7 | 6407 | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- I N T E R F A C E S . V X W O R K S . I N T _ C O N N E C T I O N --
-- --
-- B o d y --
-- --
-- Copyright (C) 2016, AdaCore
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
package body Interfaces.VxWorks.Int_Connection is
Connection_Routine : Interrupt_Connector;
pragma Import (C, Connection_Routine, "__gnat_user_int_connect");
-- Declared in System.Interrupts. Defaults to the standard OS connector in
-- System.OS_Interface (or Interfaces.VxWorks for restricted runtimes).
-------------
-- Connect --
-------------
procedure Connect (Connector : Interrupt_Connector) is
begin
Connection_Routine := Connector;
end Connect;
end Interfaces.VxWorks.Int_Connection;
|
programs/oeis/314/A314057.asm | neoneye/loda | 22 | 163784 | <filename>programs/oeis/314/A314057.asm
; A314057: Coordination sequence Gal.6.635.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
; 1,5,11,15,21,27,31,37,43,47,53,58,63,69,73,79,85,89,95,101,105,111,116,121,127,131,137,143,147,153,159,163,169,174,179,185,189,195,201,205,211,217,221,227,232,237,243,247,253,259
mov $2,$0
add $2,1
mov $4,$0
lpb $2
mov $0,$4
sub $2,1
sub $0,$2
mov $6,2
mov $7,0
mov $8,$0
lpb $6
mov $0,$8
sub $6,1
add $0,$6
sub $0,1
mul $0,2
max $0,0
seq $0,314244 ; Coordination sequence Gal.6.644.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
add $0,6
mov $3,$0
mov $5,$6
mul $5,$0
add $7,$5
lpe
min $8,1
mul $8,$3
mov $3,$7
sub $3,$8
sub $3,6
add $1,$3
lpe
mov $0,$1
|
gcc-gcc-7_3_0-release/gcc/ada/g-sercom.adb | best08618/asylo | 7 | 6342 | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . S E R I A L _ C O M M U N I C A T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2007-2012, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Default version of this package
with Ada.Streams; use Ada.Streams;
package body GNAT.Serial_Communications is
pragma Warnings (Off);
-- Kill warnings on unreferenced formals
type Port_Data is new Integer;
-----------------------
-- Local Subprograms --
-----------------------
procedure Unimplemented;
pragma No_Return (Unimplemented);
-- This procedure raises a Program_Error with an appropriate message
-- indicating that an unimplemented feature has been used.
----------
-- Name --
----------
function Name (Number : Positive) return Port_Name is
begin
Unimplemented;
return "";
end Name;
----------
-- Open --
----------
procedure Open
(Port : out Serial_Port;
Name : Port_Name)
is
begin
Unimplemented;
end Open;
---------
-- Set --
---------
procedure Set
(Port : Serial_Port;
Rate : Data_Rate := B9600;
Bits : Data_Bits := CS8;
Stop_Bits : Stop_Bits_Number := One;
Parity : Parity_Check := None;
Block : Boolean := True;
Local : Boolean := True;
Flow : Flow_Control := None;
Timeout : Duration := 10.0)
is
begin
Unimplemented;
end Set;
----------
-- Read --
----------
overriding procedure Read
(Port : in out Serial_Port;
Buffer : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
begin
Unimplemented;
end Read;
-----------
-- Write --
-----------
overriding procedure Write
(Port : in out Serial_Port;
Buffer : Stream_Element_Array)
is
begin
Unimplemented;
end Write;
-----------
-- Close --
-----------
procedure Close (Port : in out Serial_Port) is
begin
Unimplemented;
end Close;
-------------------
-- Unimplemented; --
-------------------
procedure Unimplemented is
begin
raise Program_Error with "Serial_Communications not implemented";
end Unimplemented;
end GNAT.Serial_Communications;
|
data/jpred4/jp_batch_1613899824__R4dlc8f/jp_batch_1613899824__R4dlc8f.als | jonriege/predict-protein-structure | 0 | 2390 | SILENT_MODE
BLOCK_FILE jp_batch_1613899824__R4dlc8f.concise.blc
MAX_NSEQ 50
MAX_INPUT_LEN 50
OUTPUT_FILE jp_batch_1613899824__R4dlc8f.concise.ps
PORTRAIT
POINTSIZE 8
IDENT_WIDTH 12
X_OFFSET 2
Y_OFFSET 2
DEFINE_FONT 0 Helvetica DEFAULT
DEFINE_FONT 1 Helvetica REL 0.75
DEFINE_FONT 7 Helvetica REL 0.6
DEFINE_FONT 3 Helvetica-Bold DEFAULT
DEFINE_FONT 4 Times-Bold DEFAULT
DEFINE_FONT 5 Helvetica-BoldOblique DEFAULT
#
DEFINE_COLOUR 3 1 0.62 0.67 # Turquiose
DEFINE_COLOUR 4 1 1 0 # Yellow
DEFINE_COLOUR 5 1 0 0 # Red
DEFINE_COLOUR 7 1 0 1 # Purple
DEFINE_COLOUR 8 0 0 1 # Blue
DEFINE_COLOUR 9 0 1 0 # Green
DEFINE_COLOUR 10 0.41 0.64 1.00 # Pale blue
DEFINE_COLOUR 11 0.41 0.82 0.67 # Pale green
DEFINE_COLOUR 50 0.69 0.18 0.37 # Pink (helix)
DEFINE_COLOUR 51 1.00 0.89 0.00 # Gold (strand)
NUMBER_INT 10
SETUP
#
# Highlight specific residues.
# Avoid highlighting Lupas 'C' predictions by
# limiting the highlighting to the alignments
Scol_CHARS C 1 1 184 17 4
Ccol_CHARS H ALL 5
Ccol_CHARS P ALL 8
SURROUND_CHARS LIV ALL
#
# Replace known structure types with whitespace
SUB_CHARS 1 18 184 27 H SPACE
SUB_CHARS 1 18 184 27 E SPACE
SUB_CHARS 1 18 184 27 - SPACE
STRAND 34 21 34
COLOUR_TEXT_REGION 34 21 34 21 51
STRAND 49 21 64
COLOUR_TEXT_REGION 49 21 64 21 51
STRAND 73 21 81
COLOUR_TEXT_REGION 73 21 81 21 51
STRAND 106 21 107
COLOUR_TEXT_REGION 106 21 107 21 51
STRAND 114 21 122
COLOUR_TEXT_REGION 114 21 122 21 51
STRAND 130 21 137
COLOUR_TEXT_REGION 130 21 137 21 51
STRAND 141 21 145
COLOUR_TEXT_REGION 141 21 145 21 51
STRAND 159 21 165
COLOUR_TEXT_REGION 159 21 165 21 51
STRAND 173 21 182
COLOUR_TEXT_REGION 173 21 182 21 51
HELIX 3 21 11
COLOUR_TEXT_REGION 3 21 11 21 50
HELIX 13 21 20
COLOUR_TEXT_REGION 13 21 20 21 50
HELIX 33 21 33
COLOUR_TEXT_REGION 33 21 33 21 50
HELIX 35 21 35
COLOUR_TEXT_REGION 35 21 35 21 50
HELIX 88 21 95
COLOUR_TEXT_REGION 88 21 95 21 50
STRAND 26 26 28
COLOUR_TEXT_REGION 26 26 28 26 51
STRAND 49 26 63
COLOUR_TEXT_REGION 49 26 63 26 51
STRAND 73 26 81
COLOUR_TEXT_REGION 73 26 81 26 51
STRAND 113 26 123
COLOUR_TEXT_REGION 113 26 123 26 51
STRAND 130 26 137
COLOUR_TEXT_REGION 130 26 137 26 51
STRAND 141 26 145
COLOUR_TEXT_REGION 141 26 145 26 51
STRAND 160 26 165
COLOUR_TEXT_REGION 160 26 165 26 51
STRAND 173 26 182
COLOUR_TEXT_REGION 173 26 182 26 51
HELIX 3 26 9
COLOUR_TEXT_REGION 3 26 9 26 50
HELIX 17 26 19
COLOUR_TEXT_REGION 17 26 19 26 50
HELIX 32 26 35
COLOUR_TEXT_REGION 32 26 35 26 50
HELIX 88 26 95
COLOUR_TEXT_REGION 88 26 95 26 50
STRAND 33 27 34
COLOUR_TEXT_REGION 33 27 34 27 51
STRAND 40 27 42
COLOUR_TEXT_REGION 40 27 42 27 51
STRAND 53 27 65
COLOUR_TEXT_REGION 53 27 65 27 51
STRAND 74 27 81
COLOUR_TEXT_REGION 74 27 81 27 51
STRAND 106 27 110
COLOUR_TEXT_REGION 106 27 110 27 51
STRAND 114 27 122
COLOUR_TEXT_REGION 114 27 122 27 51
STRAND 130 27 133
COLOUR_TEXT_REGION 130 27 133 27 51
STRAND 135 27 136
COLOUR_TEXT_REGION 135 27 136 27 51
STRAND 141 27 145
COLOUR_TEXT_REGION 141 27 145 27 51
STRAND 159 27 165
COLOUR_TEXT_REGION 159 27 165 27 51
STRAND 176 27 181
COLOUR_TEXT_REGION 176 27 181 27 51
HELIX 2 27 20
COLOUR_TEXT_REGION 2 27 20 27 50
HELIX 35 27 35
COLOUR_TEXT_REGION 35 27 35 27 50
HELIX 88 27 95
COLOUR_TEXT_REGION 88 27 95 27 50
HELIX 134 27 134
COLOUR_TEXT_REGION 134 27 134 27 50
HELIX 169 27 173
COLOUR_TEXT_REGION 169 27 173 27 50
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt7.adb | best08618/asylo | 7 | 23985 | -- { dg-do compile }
-- { dg-options "-Os -g" }
with Opt7_Pkg;
package body Opt7 is
procedure Parse (Str : String;
Time_Type : out time_t;
Abs_Time : out Time;
Delt_Time : out Duration) is
Year : Year_Number;
Month : Month_Number;
Day : Day_Number;
Minute : Integer := 0;
Idx : Integer := Str'First;
Ch : Character := Str (Idx);
Current_Time : Time;
begin
if Ch = '-' then
Time_Type := Absolute_Time;
Current_Time := Clock;
Day := Ada.Calendar.Day (Current_Time);
Month := Ada.Calendar.Month (Current_Time);
Year := Ada.Calendar.Year (Current_Time);
else
Time_Type := Delta_Time;
end if;
while Ch in '0' .. '9' loop
Minute := Minute + Character'Pos (Ch);
Idx := Idx + 1;
Ch := Str (Idx);
end loop;
if Time_Type = Absolute_Time then
Abs_Time := Time_Of (Year, Month, Day, Day_Duration (1));
else
Delt_Time := Duration (Float (Minute));
end if;
exception
when others => Opt7_Pkg.My_Raise_Exception;
end;
end Opt7;
|
source/league/league-json-arrays.ads | svn2github/matreshka | 24 | 17155 | <reponame>svn2github/matreshka<filename>source/league/league-json-arrays.ads
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013-2014, <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$
------------------------------------------------------------------------------
pragma Ada_2012;
private with Ada.Finalization;
limited with League.JSON.Documents;
limited with League.JSON.Values;
with League.Holders;
private with Matreshka.JSON_Types;
package League.JSON.Arrays is
pragma Preelaborate;
type JSON_Array is tagged private
with Iterator_Element => League.JSON.Values.JSON_Value,
Constant_Indexing => Element;
pragma Preelaborable_Initialization (JSON_Array);
Empty_JSON_Array : constant JSON_Array;
procedure Append
(Self : in out JSON_Array'Class; Value : League.JSON.Values.JSON_Value);
-- Inserts value at the end of the array.
procedure Delete (Self : in out JSON_Array'Class; Index : Positive);
-- Removes the value at index position Index. Index must be a valid index
-- position in the array.
procedure Delete_First (Self : in out JSON_Array'Class);
-- Removes the first item in the array.
procedure Delete_Last (Self : in out JSON_Array'Class);
-- Removes the last item in the array.
function Element
(Self : JSON_Array'Class;
Index : Positive) return League.JSON.Values.JSON_Value;
-- Returns a JSON_Value representing the value for index Index.
function First_Element
(Self : JSON_Array'Class) return League.JSON.Values.JSON_Value;
-- Returns the first value stored in the array.
procedure Insert
(Self : in out JSON_Array'Class;
Index : Positive;
Value : League.JSON.Values.JSON_Value);
-- Inserts value at index position Index in the array. If Index is 1, the
-- value is prepended to the array. If Index is large when Length, the
-- value is appended to the array.
function Is_Empty (Self : JSON_Array'Class) return Boolean;
-- Returns true if the object is empty.
function Last_Element
(Self : JSON_Array'Class) return League.JSON.Values.JSON_Value;
-- Returns the last value stored in the array.
function Length (Self : JSON_Array'Class) return Natural;
-- Returns the number of values stored in the array.
procedure Prepend
(Self : in out JSON_Array'Class; Value : League.JSON.Values.JSON_Value);
-- Inserts value at the beginning of the array.
procedure Replace
(Self : in out JSON_Array'Class;
Index : Positive;
Value : League.JSON.Values.JSON_Value);
-- Replaces the item at index position Index with Value. Index must be a
-- valid index position in the array.
function Take
(Self : in out JSON_Array'Class;
Index : Positive) return League.JSON.Values.JSON_Value;
-- Removes the item at index position Index and returns it. Index must be a
-- valid index position in the array.
function To_JSON_Value
(Self : JSON_Array'Class) return League.JSON.Values.JSON_Value;
-- Converts JSON_Array into JSON_Value.
function To_JSON_Document
(Self : JSON_Array'Class) return League.JSON.Documents.JSON_Document;
-- Converts JSON_Array into JSON_Document.
function First
(Self : aliased JSON_Array)
return League.Holders.Iterable_Holder_Cursors.Cursor'Class;
-- Return cursor used in iterable holders
private
type JSON_Array is new Ada.Finalization.Controlled with record
Data : Matreshka.JSON_Types.Shared_JSON_Array_Access
:= Matreshka.JSON_Types.Empty_Shared_JSON_Array'Access;
end record;
overriding procedure Adjust (Self : in out JSON_Array);
overriding procedure Finalize (Self : in out JSON_Array);
Empty_JSON_Array : constant JSON_Array
:= (Ada.Finalization.Controlled with
Data => Matreshka.JSON_Types.Empty_Shared_JSON_Array'Access);
end League.JSON.Arrays;
|
src/lv-font.ads | Fabien-Chouteau/ada-lvlg | 3 | 14569 | <reponame>Fabien-Chouteau/ada-lvlg<filename>src/lv-font.ads<gh_stars>1-10
with System;
package Lv.Font is
type Font is private;
No_Font : constant Font;
-- Initialize the fonts
procedure Init;
-- Create a pair from font name and font dsc. get function. After it 'font_get' can be used for this font
-- @param child pointer to a font to join to the 'parent'
-- @param parent pointer to a font. 'child' will be joined here
procedure Add (Child : Font; Parent : Font);
-- Tells if font which contains `letter` is monospace or not
-- @param font_p point to font
-- @param letter an UNICODE character code
-- @return true: the letter is monospace; false not monospace
function Is_Monospace (F : Font; Letter : Uint32_T) return U_Bool;
-- Return with the bitmap of a font.
-- @param font_p pointer to a font
-- @param letter an UNICODE character code
-- @return pointer to the bitmap of the letter
function Bitmap (F : Font; Letter : Uint32_T) return access Uint8_T;
-- Get the width of a letter in a font. If `monospace` is set then return with it.
-- @param font_p pointer to a font
-- @param letter an UNICODE character code
-- @return the width of a letter
function Width (F : Font; Letter : Uint32_T) return Uint8_T;
-- Get the width of the letter without overwriting it with the `monospace` attribute
-- @param font_p pointer to a font
-- @param letter an UNICODE character code
-- @return the width of a letter
function Real_Width (F : Font; Letter : Uint32_T) return Uint8_T;
-- Get the height of a font
-- @param font_p pointer to a font
-- @return the height of a font
function Height (F : Font) return Uint8_T;
-- Get the bit-per-pixel of font
-- @param font pointer to font
-- @param letter a letter from font (font extensions can have different bpp)
-- @return bpp of the font (or font extension)
function Bpp (F : Font; Letter : Uint32_T) return Uint8_T;
-- Generic bitmap get function used in 'font->get_bitmap' when the font contains all characters in the range
-- @param font pointer to font
-- @param unicode_letter an unicode letter which bitmap should be get
-- @return pointer to the bitmap or NULL if not found
function Bitmap_Continuous
(F : Font;
Unicode_Letter : Uint32_T) return access Uint8_T;
-- Generic bitmap get function used in 'font->get_bitmap' when the font NOT contains all characters in the range (sparse)
-- @param font pointer to font
-- @param unicode_letter an unicode letter which bitmap should be get
-- @return pointer to the bitmap or NULL if not found
function Bitmap_Sparse
(F : Font;
Unicode_Letter : Uint32_T) return access Uint8_T;
-- Generic glyph width get function used in 'font->get_width' when the font contains all characters in the range
-- @param font pointer to font
-- @param unicode_letter an unicode letter which width should be get
-- @return width of the gylph or -1 if not found
function Width_Continuous
(F : Font;
Unicode_Letter : Uint32_T) return Int16_T;
-- Generic glyph width get function used in 'font->get_bitmap' when the font NOT contains all characters in the range (sparse)
-- @param font pointer to font
-- @param unicode_letter an unicode letter which width should be get
-- @return width of the glyph or -1 if not found
function Width_Sparse
(F : Font;
Unicode_Letter : Uint32_T) return Int16_T;
private
type Font is new System.Address;
No_Font : constant Font := Font (System.Null_Address);
-------------
-- Imports --
-------------
pragma Import (C, Init, "lv_font_init");
pragma Import (C, Add, "lv_font_add");
pragma Import (C, Is_Monospace, "lv_font_is_monospace");
pragma Import (C, Bitmap, "lv_font_get_bitmap");
pragma Import (C, Width, "lv_font_get_width");
pragma Import (C, Real_Width, "lv_font_get_real_width");
pragma Import (C, Height, "lv_font_get_height_inline");
pragma Import (C, Bpp, "lv_font_get_bpp");
pragma Import (C, Bitmap_Continuous, "lv_font_get_bitmap_continuous");
pragma Import (C, Bitmap_Sparse, "lv_font_get_bitmap_sparse");
pragma Import (C, Width_Continuous, "lv_font_get_width_continuous");
pragma Import (C, Width_Sparse, "lv_font_get_width_sparse");
end Lv.Font;
|
Task/Greatest-element-of-a-list/AppleScript/greatest-element-of-a-list-3.applescript | LaudateCorpus1/RosettaCodeData | 1 | 1497 | <reponame>LaudateCorpus1/RosettaCodeData
{"epsilon", {name:"Shanghai", population:24.15}}
|
open_chrome_history.scpt | ketan0/dotfiles | 0 | 1394 | tell application "Google Chrome" to open location "chrome-extension://pnmchffiealhkdloeffcdnbgdnedheme/search.html"
|
agda-stdlib/src/Relation/Binary/Construct/Closure/Reflexive/Properties.agda | DreamLinuxer/popl21-artifact | 5 | 3727 | <filename>agda-stdlib/src/Relation/Binary/Construct/Closure/Reflexive/Properties.agda
------------------------------------------------------------------------
-- The Agda standard library
--
-- Some properties of reflexive closures
------------------------------------------------------------------------
{-# OPTIONS --safe --without-K #-}
module Relation.Binary.Construct.Closure.Reflexive.Properties where
open import Data.Product as Prod
open import Data.Sum.Base as Sum
open import Function.Equivalence using (_⇔_; equivalence)
open import Function using (id)
open import Level
open import Relation.Binary
open import Relation.Binary.Construct.Closure.Reflexive
open import Relation.Binary.PropositionalEquality as PropEq using (_≡_; refl)
open import Relation.Nullary
import Relation.Nullary.Decidable as Dec
open import Relation.Nullary.Negation using (contradiction)
open import Relation.Nullary.Sum using (_⊎-dec_)
open import Relation.Unary using (Pred)
private
variable
a b ℓ p q : Level
A : Set a
B : Set b
------------------------------------------------------------------------
-- Relational properties
module _ {P : Rel A p} {Q : Rel B q} where
=[]⇒ : ∀ {f : A → B} → P =[ f ]⇒ Q → Refl P =[ f ]⇒ Refl Q
=[]⇒ x [ x∼y ] = [ x x∼y ]
=[]⇒ x refl = refl
module _ {_~_ : Rel A ℓ} where
sym : Symmetric _~_ → Symmetric (Refl _~_)
sym ~-sym [ x∼y ] = [ ~-sym x∼y ]
sym ~-sym refl = refl
trans : Transitive _~_ → Transitive (Refl _~_)
trans ~-trans [ x∼y ] [ x∼y₁ ] = [ ~-trans x∼y x∼y₁ ]
trans ~-trans [ x∼y ] refl = [ x∼y ]
trans ~-trans refl [ x∼y ] = [ x∼y ]
trans ~-trans refl refl = refl
antisym : ∀ {ℓ'} (_≈_ : Rel A ℓ') → Reflexive _≈_ →
Asymmetric _~_ → Antisymmetric _≈_ (Refl _~_)
antisym _≈_ ref asym [ x∼y ] [ y∼x ] = contradiction x∼y (asym y∼x)
antisym _≈_ ref asym [ x∼y ] refl = ref
antisym _≈_ ref asym refl _ = ref
total : Trichotomous _≡_ _~_ → Total (Refl _~_)
total compare x y with compare x y
... | tri< a _ _ = inj₁ [ a ]
... | tri≈ _ refl _ = inj₁ refl
... | tri> _ _ c = inj₂ [ c ]
fromSum : ∀ {a b} → a ≡ b ⊎ a ~ b → Refl _~_ a b
fromSum (inj₁ refl) = refl
fromSum (inj₂ y) = [ y ]
toSum : ∀ {a b} → Refl _~_ a b → a ≡ b ⊎ a ~ b
toSum [ x∼y ] = inj₂ x∼y
toSum refl = inj₁ refl
⊎⇔Refl : ∀ {a b} → (a ≡ b ⊎ a ~ b) ⇔ Refl _~_ a b
⊎⇔Refl = equivalence fromSum toSum
dec : Decidable {A = A} _≡_ → Decidable _~_ → Decidable (Refl _~_)
dec ≡-dec ~-dec a b = Dec.map ⊎⇔Refl (≡-dec a b ⊎-dec ~-dec a b)
decidable : Trichotomous _≡_ _~_ → Decidable (Refl _~_)
decidable ~-tri a b with ~-tri a b
... | tri< a~b _ _ = yes [ a~b ]
... | tri≈ _ refl _ = yes refl
... | tri> ¬a ¬b _ = no λ { refl → ¬b refl ; [ p ] → ¬a p }
respˡ : ∀ {P : REL A B p} → P Respectsˡ _~_ → P Respectsˡ (Refl _~_)
respˡ p-respˡ-~ [ x∼y ] = p-respˡ-~ x∼y
respˡ _ refl = id
respʳ : ∀ {P : REL B A p} → P Respectsʳ _~_ → P Respectsʳ (Refl _~_)
respʳ = respˡ
module _ {_~_ : Rel A ℓ} {P : Pred A p} where
resp : P Respects _~_ → P Respects (Refl _~_)
resp p-resp-~ [ x∼y ] = p-resp-~ x∼y
resp _ refl = id
module _ {_~_ : Rel A ℓ} {P : Rel A p} where
resp₂ : P Respects₂ _~_ → P Respects₂ (Refl _~_)
resp₂ = Prod.map respˡ respʳ
------------------------------------------------------------------------
-- Structures
module _ {_~_ : Rel A ℓ} where
isPreorder : Transitive _~_ → IsPreorder _≡_ (Refl _~_)
isPreorder ~-trans = record
{ isEquivalence = PropEq.isEquivalence
; reflexive = λ { refl → refl }
; trans = trans ~-trans
}
isPartialOrder : IsStrictPartialOrder _≡_ _~_ → IsPartialOrder _≡_ (Refl _~_)
isPartialOrder O = record
{ isPreorder = isPreorder O.trans
; antisym = antisym _≡_ refl O.asym
} where module O = IsStrictPartialOrder O
isDecPartialOrder : IsDecStrictPartialOrder _≡_ _~_ → IsDecPartialOrder _≡_ (Refl _~_)
isDecPartialOrder O = record
{ isPartialOrder = isPartialOrder O.isStrictPartialOrder
; _≟_ = O._≟_
; _≤?_ = dec O._≟_ O._<?_
} where module O = IsDecStrictPartialOrder O
isTotalOrder : IsStrictTotalOrder _≡_ _~_ → IsTotalOrder _≡_ (Refl _~_)
isTotalOrder O = record
{ isPartialOrder = isPartialOrder isStrictPartialOrder
; total = total compare
} where open IsStrictTotalOrder O
isDecTotalOrder : IsStrictTotalOrder _≡_ _~_ → IsDecTotalOrder _≡_ (Refl _~_)
isDecTotalOrder O = record
{ isTotalOrder = isTotalOrder O
; _≟_ = _≟_
; _≤?_ = dec _≟_ _<?_
} where open IsStrictTotalOrder O
|
src/adaaugeas.adb | ray2501/AdaAugeas | 0 | 16258 | <filename>src/adaaugeas.adb
----------------------------------------------------------------------------
-- Permission to use, copy, modify, and distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
----------------------------------------------------------------------------
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings; use Interfaces.C.Strings;
package body AdaAugeas is
pragma Linker_Options ("-laugeas");
use Interfaces;
--
-- Close this Augeas instance and free any storage associated with it.
--
procedure Aug_Close (aug : Augeas_Type);
pragma Import (C, Aug_Close, "aug_close");
procedure Close (Aug : in out Augeas_Type) is
begin
if Aug /= Null_Augeas then
Aug_Close (Aug);
end if;
Aug := Null_Augeas;
end Close;
--
-- Copy the node SRC to DST.
-- 0 on success and -1 on failure.
--
function Aug_Cp
(Aug : Augeas_Type; src : chars_ptr; dst : chars_ptr)
return Interfaces.C.int;
pragma Import (C, Aug_Cp, "aug_cp");
function Copy (Aug : Augeas_Type; Src : String; Dst : String) return Integer
is
MySrc : chars_ptr := New_String (Src);
MyDst : chars_ptr := New_String (Dst);
Result : Interfaces.C.int;
begin
if Aug = Null_Augeas then
Free (MySrc);
Free (MyDst);
return -1;
end if;
Result := Aug_Cp (Aug, MySrc, MyDst);
Free (MySrc);
Free (MyDst);
return Integer (Result);
end Copy;
--
-- Lookup the value associated with PATH.
--
function Aug_Get
(aug : Augeas_Type; path : chars_ptr; value : access chars_ptr)
return int;
pragma Import (C, Aug_Get, "aug_get");
function Get (Aug : Augeas_Type; Path : String) return String is
MyPath : chars_ptr := New_String (Path);
Value_Ptr : aliased chars_ptr;
Result : Interfaces.C.int;
begin
if Aug = Null_Augeas then
Free (MyPath);
return "";
end if;
Result := Aug_Get (Aug, MyPath, Value_Ptr'Access);
Free (MyPath);
if Result <= 0 then
return "";
end if;
-- VALUE can be NULL.
if Value_Ptr = Null_Ptr then
return "";
else
return Value (Value_Ptr, Strlen (Value_Ptr));
end if;
end Get;
--
-- Initialize the library.
--
function Aug_Init
(root : chars_ptr; loadpath : chars_ptr; flag : aug_flags)
return Augeas_Type;
pragma Import (C, Aug_Init, "aug_init");
function Init
(Aug : out Augeas_Type; Root : String; Loadpath : String;
Flag : aug_flags) return Integer
is
MyRoot : chars_ptr := New_String (Root);
MyLoadpath : chars_ptr := New_String (Loadpath);
begin
Aug := Aug_Init (MyRoot, MyLoadpath, Flag);
Free (MyRoot);
Free (MyLoadpath);
if Aug = Null_Augeas then
return -1;
end if;
return 0;
end Init;
--
-- Match the number of matches of the path expression PATH in AUG.
--
function Aug_Match
(Aug : Augeas_Type; path : chars_ptr; matches : access Chars_Ptr_Ptr)
return Interfaces.C.int;
pragma Import (C, Aug_Match, "aug_match");
procedure Free_Chars_Ptr (Ptr : Chars_Ptr_Ptr) with
Import => True,
Convention => C,
External_Name => "free";
function Match
(Aug : Augeas_Type; Path : String) return String_Vectors.Vector
is
MyPath : chars_ptr := New_String (Path);
Array_Ptr : aliased Chars_Ptr_Ptr;
Match_Ptr : aliased Chars_Ptr_Ptr;
Result : Interfaces.C.int;
VString : String_Vectors.Vector;
begin
if Aug = Null_Augeas then
Free (MyPath);
return VString;
end if;
--
-- If MATCHES is non-NULL, an array with the returned
-- number of elements will be allocated and filled with
-- the paths of the matches. The caller must free both
-- the array and the entries in it.
--
Result := Aug_Match (Aug, MyPath, Match_Ptr'Access);
Free (MyPath);
if Result > 0 then
Array_Ptr := Match_Ptr;
for J in 0 .. Result - 1 loop
if Match_Ptr.all /= Interfaces.C.Strings.Null_Ptr then
VString.Append (Interfaces.C.Strings.Value (Match_Ptr.all));
Free (Match_Ptr.all);
end if;
Match_Pointer.Increment (Match_Ptr);
end loop;
Free_Chars_Ptr (Array_Ptr);
end if;
return VString;
end Match;
--
-- Move the node SRC to DST.
-- 0 on success and -1 on failure.
--
function Aug_Mv
(Aug : Augeas_Type; src : chars_ptr; dst : chars_ptr)
return Interfaces.C.int;
pragma Import (C, Aug_Mv, "aug_mv");
function Move (Aug : Augeas_Type; Src : String; Dst : String) return Integer
is
MySrc : chars_ptr := New_String (Src);
MyDst : chars_ptr := New_String (Dst);
Result : Interfaces.C.int;
begin
if Aug = Null_Augeas then
Free (MySrc);
Free (MyDst);
return -1;
end if;
Result := Aug_Mv (Aug, MySrc, MyDst);
Free (MySrc);
Free (MyDst);
return Integer (Result);
end Move;
--
-- Remove path and all its children.
-- Returns the number of entries removed.
--
function Aug_Rm
(Aug : Augeas_Type; path : chars_ptr) return Interfaces.C.int;
pragma Import (C, Aug_Rm, "aug_rm");
function Remove (Aug : Augeas_Type; Path : String) return Integer is
MyPath : chars_ptr := New_String (Path);
Result : Interfaces.C.int;
begin
if Aug = Null_Augeas then
Free (MyPath);
return -1;
end if;
Result := Aug_Rm (Aug, MyPath);
Free (MyPath);
return Integer (Result);
end Remove;
--
-- Write all pending changes to disk.
-- -1 if an error is encountered, 0 on success.
--
function Aug_Save (Aug : Augeas_Type) return Interfaces.C.int;
pragma Import (C, Aug_Save, "aug_save");
function Save (Aug : Augeas_Type) return Integer is
Result : Interfaces.C.int;
begin
if Aug = Null_Augeas then
return -1;
end if;
Result := Aug_Save (Aug);
return Integer (Result);
end Save;
--
-- Set the value associated with PATH to VALUE.
-- Neec check: The string *VALUE must not be freed by the caller,
-- and is valid as long as its node remains unchanged.
--
function Aug_Set
(Aug : Augeas_Type; path : chars_ptr; value : chars_ptr)
return Interfaces.C.int;
pragma Import (C, Aug_Set, "aug_set");
function Set
(Aug : Augeas_Type; Path : String; Value : String) return Integer
is
MyPath : chars_ptr := New_String (Path);
MyValue : chars_ptr := New_String (Value);
Result : Interfaces.C.int;
begin
if Aug = Null_Augeas then
Free (MyPath);
Free (MyValue);
return -1;
end if;
Result := Aug_Set (Aug, MyPath, MyValue);
Free (MyPath);
Free (MyValue);
return Integer (Result);
end Set;
--
-- Set the value associated with PATH to VALUE.
-- Neec check: The string *VALUE must not be freed by the caller,
-- and is valid as long as its node remains unchanged.
--
function Aug_Setm
(Aug : Augeas_Type; base : chars_ptr; sub : chars_ptr; value : chars_ptr)
return Interfaces.C.int;
pragma Import (C, Aug_Setm, "aug_setm");
function Setm
(Aug : Augeas_Type; Base : String; Sub : String; Value : String)
return Integer
is
MyBase : chars_ptr := New_String (Base);
MySub : chars_ptr := New_String (Sub);
MyValue : chars_ptr := New_String (Value);
Result : Interfaces.C.int;
begin
if Aug = Null_Augeas then
Free (MyBase);
Free (MySub);
Free (MyValue);
return -1;
end if;
Result := Aug_Setm (Aug, MyBase, MySub, MyValue);
Free (MyBase);
Free (MySub);
Free (MyValue);
return Integer (Result);
end Setm;
begin
begin
null;
end;
end AdaAugeas;
|
grammar/CSV.g4 | Blueswing/tableconverter | 1 | 5939 | grammar CSV;
fil: hdr ('\r'? '\n' row)* EOF?;
hdr: row;
row: field (',' field)*;
field: TEXT # text | STRING # string | # empty;
TEXT: ~[,\n\r"]+;
STRING: '"' ('""' | ~'"')* '"';
|
testsuite/sql/TN-284/test_284.adb | svn2github/matreshka | 24 | 21356 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Testsuite Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, <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$
------------------------------------------------------------------------------
-- This test checks support of integer, floating point, date/time and
-- character data types in MySQL driver.
------------------------------------------------------------------------------
with League.Calendars.ISO_8601;
with League.Holders.Integers;
with League.Holders.Long_Long_Integers;
with League.Holders.Floats;
with League.Holders.Long_Floats;
with League.Strings;
with SQL.Databases;
with SQL.Options;
with SQL.Queries;
with Matreshka.Internals.SQL_Drivers.MySQL.Factory;
pragma Unreferenced (Matreshka.Internals.SQL_Drivers.MySQL.Factory);
procedure Test_284 is
use type League.Strings.Universal_String;
function "+"
(Item : Wide_Wide_String) return League.Strings.Universal_String
renames League.Strings.To_Universal_String;
DB_Driver : constant League.Strings.Universal_String := +"MYSQL";
DB_Options : SQL.Options.SQL_Options;
Timestamp_Value : League.Calendars.Date_Time
:= League.Calendars.Clock;
Datetime_Value : League.Calendars.Date_Time
:= League.Calendars.Clock;
begin
-- Remove fractional part of Date_Time, it is not supported by MySQL
-- server.
declare
Year : League.Calendars.ISO_8601.Year_Number;
Month : League.Calendars.ISO_8601.Month_Number;
Day : League.Calendars.ISO_8601.Day_Number;
Hour : League.Calendars.ISO_8601.Hour_Number;
Minute : League.Calendars.ISO_8601.Minute_Number;
Second : League.Calendars.ISO_8601.Second_Number;
Fraction : League.Calendars.ISO_8601.Nanosecond_100_Number;
begin
League.Calendars.ISO_8601.Split
(Timestamp_Value, Year, Month, Day, Hour, Minute, Second, Fraction);
Timestamp_Value :=
League.Calendars.ISO_8601.Create
(Year, Month, Day, Hour, Minute, Second, 0);
League.Calendars.ISO_8601.Split
(Datetime_Value, Year, Month, Day, Hour, Minute, Second, Fraction);
Datetime_Value :=
League.Calendars.ISO_8601.Create
(Year, Month, Day, Hour, Minute, Second, 0);
end;
DB_Options.Set (+"database", +"test");
declare
Database : aliased SQL.Databases.SQL_Database
:= SQL.Databases.Create (DB_Driver, DB_Options);
begin
Database.Open;
declare
Query : SQL.Queries.SQL_Query := Database.Query;
begin
-- Create table for test data.
Query.Prepare
(+"CREATE TABLE test_284"
& " (timestamp TIMESTAMP NOT NULL,"
& " datetime DATETIME NOT NULL,"
& " tiny TINYINT NOT NULL,"
& " small SMALLINT NOT NULL,"
& " medium MEDIUMINT NOT NULL,"
& " intv INTEGER NOT NULL,"
& " big BIGINT NOT NULL,"
& " ubig BIGINT UNSIGNED NOT NULL,"
& " floatv FLOAT NOT NULL,"
& " doublev DOUBLE NOT NULL,"
& " c10 CHAR(10) NOT NULL,"
& " vchar VARCHAR (20) NOT NULL)"
& " CHARACTER SET utf8");
Query.Execute;
-- Insert data.
Query.Prepare
(+"INSERT INTO test_284"
& " (timestamp, datetime, tiny, small, medium, intv, big,"
& " ubig, floatv, doublev, c10, vchar)"
& " VALUES"
& " (:timestamp, :datetime, :tiny, :small, :medium, :int,"
& " :big, :ubig, :floatv, :doublev, :c10, :vchar)");
Query.Bind_Value
(+":datetime", League.Holders.To_Holder (Datetime_Value));
Query.Bind_Value
(+":timestamp", League.Holders.To_Holder (Timestamp_Value));
Query.Bind_Value (+":tiny", League.Holders.Integers.To_Holder (1));
Query.Bind_Value (+":small", League.Holders.Integers.To_Holder (-2));
Query.Bind_Value (+":medium", League.Holders.Integers.To_Holder (3));
Query.Bind_Value (+":int", League.Holders.Integers.To_Holder (-4));
Query.Bind_Value
(+":big",
League.Holders.Long_Long_Integers.To_Holder (-9223372036854775807));
Query.Bind_Value
(+":ubig",
League.Holders.Long_Long_Integers.To_Holder (9223372036854775807));
Query.Bind_Value (+":floatv", League.Holders.Floats.To_Holder (2.6));
Query.Bind_Value
(+":doublev", League.Holders.Long_Floats.To_Holder (-4.3));
Query.Bind_Value (+":c10", League.Holders.To_Holder (+"abcdefghij"));
Query.Bind_Value (+":vchar", League.Holders.To_Holder (+"АБВГД"));
Query.Execute;
end;
declare
use type League.Calendars.Date_Time;
Query : SQL.Queries.SQL_Query := Database.Query;
begin
-- Obtain data and check expected value.
Query.Prepare
(+"SELECT timestamp, datetime, tiny, small, medium, intv, big,"
& " ubig, floatv, doublev, c10, vchar"
& " FROM test_284");
Query.Execute;
if not Query.Next then
raise Program_Error;
end if;
if League.Holders.Element (Query.Value (1)) /= Timestamp_Value then
raise Program_Error;
end if;
if League.Holders.Element (Query.Value (2)) /= Datetime_Value then
raise Program_Error;
end if;
if League.Holders.Integers.Element (Query.Value (3)) /= 1 then
raise Program_Error;
end if;
if League.Holders.Integers.Element (Query.Value (4)) /= -2 then
raise Program_Error;
end if;
if League.Holders.Integers.Element (Query.Value (5)) /= 3 then
raise Program_Error;
end if;
if League.Holders.Integers.Element (Query.Value (6)) /= -4 then
raise Program_Error;
end if;
if League.Holders.Long_Long_Integers.Element (Query.Value (7))
/= -9223372036854775807
then
raise Program_Error;
end if;
if League.Holders.Long_Long_Integers.Element (Query.Value (8))
/= 9223372036854775807
then
raise Program_Error;
end if;
if League.Holders.Floats.Element (Query.Value (9)) /= 2.6 then
raise Program_Error;
end if;
if League.Holders.Long_Floats.Element (Query.Value (10)) /= -4.3 then
raise Program_Error;
end if;
if League.Holders.Element (Query.Value (11)) /= +"abcdefghij" then
raise Program_Error;
end if;
if League.Holders.Element (Query.Value (12)) /= +"АБВГД" then
raise Program_Error;
end if;
end;
Database.Close;
end;
end Test_284;
|
_maps/SSRblock.asm | NatsumiFox/AMPS-Sonic-1-2005 | 2 | 16412 | ; ---------------------------------------------------------------------------
; Sprite mappings - special stage "R" block
; ---------------------------------------------------------------------------
dc.w byte_1B912-Map_SS_R, byte_1B918-Map_SS_R
dc.w byte_1B91E-Map_SS_R
byte_1B912: dc.b 1
dc.b $F4, $A, 0, 0, $F4
byte_1B918: dc.b 1
dc.b $F4, $A, 0, 9, $F4
byte_1B91E: dc.b 0
even |
asm_main.asm | CISVVC/cis208-chapter05-arrays-NathanielNavarrette | 0 | 162777 | <gh_stars>0
;
; file: asm_main.asm
%include "asm_io.inc"
;
; initialized data is put in the .data segment
;
segment .data
prompt1 db "What is the size of the array?:",0
prompt2 db "What is the scalar of the array?", 0
; uninitialized data is put in the .bss segment
;
segment .bss
array_in_len resd 1
array_in_sca resd 1
;
; code is put in the .text segment
;
segment .text
global asm_main
asm_main:
enter 0,0 ; setup routine
pusha
; next print out result message as series of steps
push prompt1
pop eax
call print_string
call read_int
b1:
push eax
push prompt2
pop eax
call print_string
call read_int
b2:
push eax
mov edx,return1
push edx
call arrayFunc
return1:
;return the stack to the original state it was before the program
pop eax
popa
mov eax, 0 ; return back to C
leave
ret
segment .data
segment .bss
array_size resd 1
array_scalar resd 1
array resd 1 ;create an array of uninitalized size that is a reserved doubleword
segment .text
arrayFunc:
pop ebx ;place the return address here
pop eax ;mov the scalar into eax
pop eax
; call print_int
; call print_nl
mov [array_scalar], eax
b3:
pop eax ;mov the array size into eax to be stored into the value later
; call print_int
; call print_nl
mov [array_size], eax
b4:
xor eax, eax ;0 out eax
push ebx
mov ecx, [array_size] ;place the array size into ecx
mov ebx, array ;mov the starting location of the array into ebx
b5:
cmp ecx, 0
js end_create
create_array:
mov [ebx+4*ecx], ecx ;mov the value of ecx (the array size from the top to bottom)
mov al, [ebx+4*ecx] ;mov the value into al to be printed
call print_int
call print_nl
loop create_array
end_create:
call print_nl
call print_nl
and eax, 0
and ebx, 0
and ecx, 0
and edx, 0
scale_array:
mov ebx, array
mov ecx, [array_size]
cmp ecx, 0
js end_scale_loop
scale_loop:
mov eax, [array_scalar]
mov dl, [ebx+4*ecx]
mul dl
mov [ebx+4*ecx], eax
call print_int
call print_nl
b6:
loop scale_loop
end_scale_loop:
pop ebx
jmp ebx
|
src/util/oli/app/alar.asm | olifink/qspread | 0 | 6950 | <filename>src/util/oli/app/alar.asm<gh_stars>0
; allocate a new array
include win1_mac_oli
section utility
xdef ut_alar
;+++
; allocate a new array (type abs.)
;
; Entry Exit
; d1.l nr. of elements 0 (=type absolute)
; d2.w multiplicator preserved
; a0 array descriptor
;
; errors: imem
; cc set
;---
ut_alar subr d2
bsr.s aloc
bne.s exit
move.l a0,-(sp)
moveq #14,d0
add.l a0,d0
move.l d0,(a0)+ ; array contents pointer
move.w #2,(a0)+ ; 2 dimensions
subq.l #1,d1
move.w d1,(a0)+ ; nr of elements
move.w d2,(a0)+ ; multiplicator
subq.w #2,d2
move.w d2,(a0)+ ; length
move.w #1,(a0)
move.l (sp)+,a0
moveq #0,d1
moveq #0,d0
exit subend
aloc subr d1
mulu.w d2,d1
add.l #14,d1
xjsr ut_alchp
subend
end
|
agda/Data/FiniteMap.agda | florence/esterel-calculus | 3 | 5127 | <filename>agda/Data/FiniteMap.agda
open import Relation.Binary
using (Decidable)
open import Relation.Binary.PropositionalEquality
using (_≡_ ; _≢_ ; refl ; subst ; subst₂)
open import Data.Nat as Nat
using (ℕ ; _≤′_ ; _+_)
open import Relation.Binary.PropositionalEquality using (sym)
import Relation.Unary as U
open import Function
using (_∘_)
open import Relation.Nullary
module Data.FiniteMap
{Key : Set}
(inject : Key → ℕ)
(surject : ℕ → Key)
(inject-injective : ∀ {k1 k2} → inject k1 ≡ inject k2 → k1 ≡ k2)
(surject-inject : ∀ {k} → inject (surject k) ≡ k)
where
open import utility
open import Data.Maybe using (just)
open import Data.Empty
using (⊥-elim)
open import Data.List
using (List ; _++_ ; [_] ; [] ; _∷_)
open import Data.List.Any
using (any ; here ; there ; Any)
open import Data.Nat
using (ℕ ; zero ; suc)
open import Data.Sum
using (inj₁ ; inj₂ ; _⊎_)
open import Data.Product
using (Σ ; Σ-syntax ; ∃ ; proj₁ ; proj₂ ; _×_ ; _,_ ; ∃-syntax ; uncurry ; map)
open import Function
using (id ; _$_)
open import Relation.Nullary
using (yes ; no)
open import Data.OrderedListMap(Key)(inject) as OMap hiding (insert-mono ; U-mono)
open import Data.Bool using (Bool ; true ; false)
private
nbiject : ∀ {k1 k2} → k1 ≢ k2 → inject k1 ≢ inject k2
nbiject = (_∘ inject-injective)
Map : Set → Set
Map = LMap
keys : ∀{Value} → Map Value → List ℕ
keys{Value} l = (Dom' Value l)
keys+∈ : ∀{Value} → (l : Map Value) → List (∃[ n ] (n ∈ (Dom' Value l)))
keys+∈{Value} l = (Dom'+∈ Value l)
inj= : Key → ℕ → Set
inj= = _≡_ ∘ inject
∈Dom : ∀{Value} → Key → Map Value → Set
∈Dom{Value} k m = (inject k) ∈ (Dom' Value m)
in-inject : ∀ {Value}{x : ℕ} → (l : Map Value) → x ∈ Dom' Value l → ∈Dom (surject x) l
in-inject{x = x} l ∈ rewrite surject-inject{x} = ∈
key-map : ∀{Value}{a}{L : Set a} → (l : Map Value) → (f : (k : Key) → (∈Dom k l) → L) → List L
key-map{L = L} l f
= Data.List.map ((uncurry f) ∘ (map surject (in-inject l)))
(keys+∈ l)
∈Check : ∀{Value}
→ (k : Key)
→ (m : Map Value)
→ Relation.Nullary.Dec (∈Dom k m)
∈Check{Value} k m = any (Nat._≟_ (inject k)) (Dom' Value m)
lookup : ∀{Value k} → (l : Map Value) → (∈Dom k l) → Value
lookup{Value}{k = k} m k∈ = deref Value (inject k) m k∈
update : ∀{Value} → (l : Map Value) → Key → Value → Map Value
update{Value} l k v = m-insert Value (just v) (inject k) l
-- Union map. For repeated keys, the values from the second map is preferred.
union : ∀{Value} → Map Value → Map Value → Map Value
union{Value} m1 m2 = (_U_ Value m1 m2)
empty : ∀{Value} → Map Value
empty = []
[_↦_] : ∀{Value} → (k : Key) → (v : Value) → Map Value
[ k ↦ v ] = update empty k v
[_↦_,_↦_] : ∀{Value} →
(k₁ : Key) → (v₁ : Value) →
(k₂ : Key) → (v₂ : Value) →
Map Value
[ k₁ ↦ v₁ , k₂ ↦ v₂ ] = update [ k₁ ↦ v₁ ] k₂ v₂
keys-1map : ∀{Value} → (k : Key) → (v : Value) → keys [ k ↦ v ] ≡ inject k ∷ []
keys-1map {Value} k v = Dom'-1map Value (inject k) v
keys-2map : ∀{Value} → (k₁ : Key) → (v₁ : Value) → (k₂ : Key) → (v₂ : Value) →
(keys [ k₁ ↦ v₁ , k₂ ↦ v₂ ] ≡ inject k₁ ∷ [] × k₁ ≡ k₂) ⊎
(keys [ k₁ ↦ v₁ , k₂ ↦ v₂ ] ≡ inject k₁ ∷ inject k₂ ∷ []) ⊎
(keys [ k₁ ↦ v₁ , k₂ ↦ v₂ ] ≡ inject k₂ ∷ inject k₁ ∷ [])
keys-2map {Value} k₁ v₁ k₂ v₂ =
Data.Sum.map (Data.Product.map id inject-injective) id
(Dom'-2map Value (inject k₁) v₁ (inject k₂) v₂)
keys-1map-distinct : ∀{Value} → (k1 k2 : Key) → (v1 v2 : Value) → ¬ (k1 ≡ k2) → utility.distinct' (keys [ k1 ↦ v1 ]) (keys [ k2 ↦ v2 ])
keys-1map-distinct k1 k2 v1 v2 neg z k1∈ k2∈ rewrite (keys-1map k1 v1) | (keys-1map k2 v2) with k1∈ | k2∈
... | here refl | here px = (nbiject neg) px
... | there () | _
... | here px | there ()
keys-1map∈ : ∀{Value} → (k1 : Key) → (v1 : Value) → (inject k1) ∈ keys [ k1 ↦ v1 ]
keys-1map∈ k v rewrite keys-1map k v = here refl
2map-eq-one : ∀{V} k1 k2 v k1∈ → (lookup{V}{k1} ([ k1 ↦ v , k2 ↦ v ]) k1∈) ≡ v
2map-eq-one {V} k1 k2 = insert-two-eq-one V (inject k1) (inject k2)
2map-eq-two : ∀{V} k1 k2 v k2∈ → (lookup{V}{k2} ([ k1 ↦ v , k2 ↦ v ]) k2∈) ≡ v
2map-eq-two {V} k1 k2 = insert-two-eq-two V (inject k1) (inject k2)
-- theorems
update-in-keys : ∀{V} m k v → ∈Dom k (update{V} m k v)
update-in-keys {V} m k = insert-in-domain V m (inject k)
lookup-∈-irr : ∀{Value k m} → (∈1 : ∈Dom k m) → (∈2 : ∈Dom k m) → lookup{Value}{k} m ∈1 ≡ lookup{Value}{k} m ∈2
lookup-∈-irr{Value} ∈1 ∈2 = deref-∈-irr Value ∈1 ∈2
insert-mono : ∀{Value k m k' v} → ∈Dom k m → ∈Dom k (update{Value} m k' v)
insert-mono{Value}{k}{m}{k'}{v} i = (OMap.insert-mono Value {m}{inject k}{inject k'}{v} i)
U-mono : ∀{Value m m' k} → ∈Dom k m → ∈Dom k (union{Value} m m')
U-mono{V}{m}{m'}{k} i = OMap.U-mono V {m}{m'}{inject k} i
union-comm : ∀ {Value} → (m1 : Map Value) → (m2 : Map Value) → distinct' (keys m1) (keys m2) → union m1 m2 ≡ union m2 m1
union-comm {Value} m1 m2 keys-m1≠keys-m2 = U-comm Value {m1} {m2} keys-m1≠keys-m2
union-assoc : ∀ {Value} → (m1 m2 m3 : Map Value) → union m1 (union m2 m3) ≡ union (union m1 m2) m3
union-assoc {Value} = U-assoc Value
keys-assoc-comm : ∀ {Value} m1 m2 m3 →
keys (union {Value} (union {Value} m1 m2) m3) ≡
keys (union {Value} (union {Value} m1 m3) m2)
keys-assoc-comm {Value} = Dom'-assoc-comm Value
U⁻-m : ∀ {Value m m' n} → ∈Dom n (union {Value} m m') → ∈Dom n m ⊎ ∈Dom n m'
U⁻-m {Value} {m} {m'} {n} = U⁻ Value {m} {m'} {inject n}
U-∉-irr-get-help-m : ∀{Value m m' k} → (k∈m : ∈Dom k m) → ¬ (∈Dom k m') → (k∈' : ∈Dom k (union {Value} m m'))→ lookup {Value} {k} m k∈m ≡ lookup {Value} {k} (union {Value} m m') k∈'
U-∉-irr-get-help-m {Value} = U-∉-irr-get-help Value
U-∉-irr-get-m : ∀{Value m m' k} → (k∈m : ∈Dom k m) → ¬ (∈Dom k m') → ∃ λ k∈' → lookup {Value} {k} m k∈m ≡ lookup {Value} {k} (union {Value} m m') k∈'
U-∉-irr-get-m {Value} = U-∉-irr-get Value
get-U-right-irr-m : ∀ {Value} k m m' →
(k∈mUm' : ∈Dom k (union {Value} m m')) →
(k∈m' : ∈Dom k m') →
lookup {Value} {k} (union {Value} m m') k∈mUm' ≡ lookup {Value} {k} m' k∈m'
get-U-right-irr-m {Value} k = deref-U-right-irr Value (inject k)
∈-get-U-irr-m : ∀ {Value} k m m' m'' k∈mUm'' k∈m'Um'' →
(k∈m'' : ∈Dom k m'') →
lookup {Value} {k} (union {Value} m m'') k∈mUm'' ≡
lookup {Value} {k} (union {Value} m' m'') k∈m'Um''
∈-get-U-irr-m {Value} k = ∈-deref-U-irr Value (inject k)
get-U-both-irr-m : ∀ {Value} k m m' m'' k∈m k∈m' k∈mUm'' k∈m'Um'' →
lookup {Value} {k} m k∈m ≡ lookup {Value} {k} m' k∈m' →
lookup {Value} {k} (union {Value} m m'') k∈mUm'' ≡
lookup {Value} {k} (union {Value} m' m'') k∈m'Um''
get-U-both-irr-m {Value} k = deref-U-both-irr Value (inject k)
putputget : ∀{Value m k k' v v'}
→ ¬ k ≡ k'
→ (∈1 : ∈Dom k m)
→ (∈2 : ∈Dom k (update{Value} m k' v'))
→ lookup{Value}{k} m ∈1 ≡ v
→ lookup{Value}{k} (update{Value} m k' v') ∈2 ≡ v
putputget{V}{m}{k}{k'}{v}{v'} neq kin1 kin2 eq = putputget-neq V {inject k}{inject k'}{m} (nbiject neq) kin1 kin2 eq
putput-overwrite : ∀{Value} m k v v'
→ (update{Value} (update{Value} m k v) k v') ≡ (update m k v')
putput-overwrite {V} m k v v' = putputget-eq V (inject k) m v v'
getput-m : ∀ {Value} k m →
(∈1 : ∈Dom k m) →
m ≡ update {Value} m k (lookup {Value} {k} m ∈1)
getput-m {Value} k = getput Value (inject k)
putget-m : ∀{Value m k v} → (kin : ∈Dom k (update{Value} m k v)) → (lookup{Value}{k} (update{Value} m k v) kin) ≡ v
putget-m {V}{m}{k}{v} kin = putget V kin
update-union-union : ∀ {Value} k v m m' →
(∈1 : ∈Dom k m) →
(∈2 : ∈Dom k m') →
union {Value} m m' ≡
union {Value} (update {Value} m k v) m'
update-union-union {Value} k = put-U-U Value (inject k)
ineq-m : ∀{Value k m} → (k1 : ∈Dom{Value} k m) → (k2 : ∈Dom k m) → k1 ≡ k2
ineq-m {V}{k}{m} k1 k2 = ineq V {inject k}{m} k1 k2
put-comm : ∀{Value m k1 k2 v1 v2}
→ ¬ k1 ≡ k2 → (update (update{Value} m k1 v1) k2 v2) ≡ (update (update m k2 v2) k1 v1)
put-comm{V}{m}{k1}{k2}{v1}{v2} ¬k1≡k2 = insert-comm V {m}{inject k1}{inject k2}{v1}{v2} (nbiject ¬k1≡k2)
put-union-comm : ∀ {Value} k v m m' →
¬ (∈Dom k m') →
union {Value} (update {Value} m k v) m' ≡
update {Value} (union {Value} m m') k v
put-union-comm {Value} k = insert-U-comm Value (inject k)
union-=-irr : ∀ {Value} m m' → (keys{Value} m) ≡ (keys{Value} m') → ∀ k k∈ k∈2 → (lookup{Value}{k} (union m m') k∈) ≡ (lookup{Value}{k} m' k∈2)
union-=-irr {V} m m' eql k = U-=-irr V m m' eql (inject k)
union-single-overwrite : ∀ {V} k v1 v2 → union{V} [ k ↦ v1 ] [ k ↦ v2 ] ≡ [ k ↦ v2 ]
union-single-overwrite {V} k v1 v2 = U-single-overwrite V (inject k) v1 v2
update-single-val : ∀ {V} k v k∈ → lookup{V}{k} [ k ↦ v ] k∈ ≡ v
update-single-val {V} k v k∈ = set-single-val V (inject k) v k∈
single-val-overwrite : ∀ {V} k v m → (∈Dom{V} k m) → union{V} ([ k ↦ v ]) m ≡ m
single-val-overwrite {V} k = overwrite-single-val V (inject k)
union-insert-eq : ∀{V} k v m → (update{V} m k v) ≡ (union{V} m [ k ↦ v ])
union-insert-eq {V} k = U-insert-eq V (inject k)
update-domain-eq : ∀{V} k v m → (inject k) ∈ keys{V} m → (keys m) ≡ (keys (update{V} m k v))
update-domain-eq {V} k = insert-domain-eq V (inject k)
--(OMap.insert-mono Value {m}{inject k}{inject k'}{v} i)
keys-2map∈ : ∀{Value} → (k1 : Key) → (v1 : Value) → (k2 : Key) → (v2 : Value) → (∈Dom k1 [ k1 ↦ v1 , k2 ↦ v2 ]) × (∈Dom k2 [ k1 ↦ v1 , k2 ↦ v2 ])
keys-2map∈ {V} k1 v1 k2 v2 = insert-mono (keys-1map∈ k1 v1) , update-in-keys ([ k1 ↦ v1 ]) k2 v2
count : ∀ {V} -> (V -> Bool) -> Map V -> ℕ
count {V} p m = ocount V p m
change-one-count-goes-down :
∀ {Value} (m : Map Value) ->
(p : Value -> Bool) ->
(k : Key) ->
(k∈ : ∈Dom k m) ->
p (lookup m k∈) ≡ true ->
(v : Value) ->
p v ≡ false ->
count p m ≡ suc (count p (update m k v))
change-one-count-goes-down {V} m p k =
change-one-ocount-goes-down V m p (inject k)
change-nothing-count-stays-same :
∀ {Value} (m : Map Value) ->
(p : Value -> Bool) ->
(k : Key) ->
(k∈ : ∈Dom k m) ->
(v : Value) ->
p (lookup m k∈) ≡ p v ->
count p m ≡ count p (update m k v)
change-nothing-count-stays-same {V} m p k =
change-nothing-ocount-stays-same V m p (inject k)
count-merge≤′sum-count :
∀ {Value}
(m1 m2 : Map Value) ->
(p : Value -> Bool) ->
count p (union m1 m2) ≤′ count p m1 + count p m2
count-merge≤′sum-count {V} m1 m2 p =
ocount-merge≤′sum-ocount V m1 m2 p
|
project/ads_files/screen_hpp.ads | corentingay/ada_epita | 0 | 30225 | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
package screen_hpp is
-- Struct used to pass around infos about the buffer used for display
-- We assume that rowstride = 1 (memory is contiguous)
-- We assume that n_channels = 3 (RGB)
package Class_Screen is
type Screen is limited record
pixels : access unsigned_char; -- ./screen.hpp:8
rowstride : aliased unsigned; -- ./screen.hpp:9
n_channels : aliased unsigned; -- ./screen.hpp:10
end record;
pragma Import (CPP, Screen);
end;
use Class_Screen;
end screen_hpp;
|
tests/rule_arg_complex.asm | clubby789/customasm | 1 | 22072 | <filename>tests/rule_arg_complex.asm
; ::: include
#ruledef test
{
ld {x} => 0x55 @ x`8
}
; :::
ld 1 + 1 ; = 0x5502
; :::
ld (1 + 1) ; = 0x5502
; :::
ld 3 + 4 * 5 ; = 0x5517
; :::
ld (3 + 4) * 5 ; = 0x5523
; :::
ld (3 + x) * 5 ; error: unknown
; :::
ld 1 + + 1 ; error: no match |
packager/third_party/boringssl/win-x86/crypto/fipsmodule/ghash-x86.asm | koln67/shaka-packager | 1,288 | 3821 | <reponame>koln67/shaka-packager<filename>packager/third_party/boringssl/win-x86/crypto/fipsmodule/ghash-x86.asm
; This file is generated from a similarly-named Perl script in the BoringSSL
; source tree. Do not edit by hand.
%ifdef BORINGSSL_PREFIX
%include "boringssl_prefix_symbols_nasm.inc"
%endif
%ifidn __OUTPUT_FORMAT__,obj
section code use32 class=code align=64
%elifidn __OUTPUT_FORMAT__,win32
%ifdef __YASM_VERSION_ID__
%if __YASM_VERSION_ID__ < 01010000h
%error yasm version 1.1.0 or later needed.
%endif
; Yasm automatically includes .00 and complains about redefining it.
; https://www.tortall.net/projects/yasm/manual/html/objfmt-win32-safeseh.html
%else
$@feat.00 equ 1
%endif
section .text code align=64
%else
section .text code
%endif
global _gcm_gmult_4bit_mmx
align 16
_gcm_gmult_4bit_mmx:
L$_gcm_gmult_4bit_mmx_begin:
push ebp
push ebx
push esi
push edi
mov edi,DWORD [20+esp]
mov esi,DWORD [24+esp]
call L$000pic_point
L$000pic_point:
pop eax
lea eax,[(L$rem_4bit-L$000pic_point)+eax]
movzx ebx,BYTE [15+edi]
xor ecx,ecx
mov edx,ebx
mov cl,dl
mov ebp,14
shl cl,4
and edx,240
movq mm0,[8+ecx*1+esi]
movq mm1,[ecx*1+esi]
movd ebx,mm0
jmp NEAR L$001mmx_loop
align 16
L$001mmx_loop:
psrlq mm0,4
and ebx,15
movq mm2,mm1
psrlq mm1,4
pxor mm0,[8+edx*1+esi]
mov cl,BYTE [ebp*1+edi]
psllq mm2,60
pxor mm1,[ebx*8+eax]
dec ebp
movd ebx,mm0
pxor mm1,[edx*1+esi]
mov edx,ecx
pxor mm0,mm2
js NEAR L$002mmx_break
shl cl,4
and ebx,15
psrlq mm0,4
and edx,240
movq mm2,mm1
psrlq mm1,4
pxor mm0,[8+ecx*1+esi]
psllq mm2,60
pxor mm1,[ebx*8+eax]
movd ebx,mm0
pxor mm1,[ecx*1+esi]
pxor mm0,mm2
jmp NEAR L$001mmx_loop
align 16
L$002mmx_break:
shl cl,4
and ebx,15
psrlq mm0,4
and edx,240
movq mm2,mm1
psrlq mm1,4
pxor mm0,[8+ecx*1+esi]
psllq mm2,60
pxor mm1,[ebx*8+eax]
movd ebx,mm0
pxor mm1,[ecx*1+esi]
pxor mm0,mm2
psrlq mm0,4
and ebx,15
movq mm2,mm1
psrlq mm1,4
pxor mm0,[8+edx*1+esi]
psllq mm2,60
pxor mm1,[ebx*8+eax]
movd ebx,mm0
pxor mm1,[edx*1+esi]
pxor mm0,mm2
psrlq mm0,32
movd edx,mm1
psrlq mm1,32
movd ecx,mm0
movd ebp,mm1
bswap ebx
bswap edx
bswap ecx
bswap ebp
emms
mov DWORD [12+edi],ebx
mov DWORD [4+edi],edx
mov DWORD [8+edi],ecx
mov DWORD [edi],ebp
pop edi
pop esi
pop ebx
pop ebp
ret
global _gcm_ghash_4bit_mmx
align 16
_gcm_ghash_4bit_mmx:
L$_gcm_ghash_4bit_mmx_begin:
push ebp
push ebx
push esi
push edi
mov eax,DWORD [20+esp]
mov ebx,DWORD [24+esp]
mov ecx,DWORD [28+esp]
mov edx,DWORD [32+esp]
mov ebp,esp
call L$003pic_point
L$003pic_point:
pop esi
lea esi,[(L$rem_8bit-L$003pic_point)+esi]
sub esp,544
and esp,-64
sub esp,16
add edx,ecx
mov DWORD [544+esp],eax
mov DWORD [552+esp],edx
mov DWORD [556+esp],ebp
add ebx,128
lea edi,[144+esp]
lea ebp,[400+esp]
mov edx,DWORD [ebx-120]
movq mm0,[ebx-120]
movq mm3,[ebx-128]
shl edx,4
mov BYTE [esp],dl
mov edx,DWORD [ebx-104]
movq mm2,[ebx-104]
movq mm5,[ebx-112]
movq [edi-128],mm0
psrlq mm0,4
movq [edi],mm3
movq mm7,mm3
psrlq mm3,4
shl edx,4
mov BYTE [1+esp],dl
mov edx,DWORD [ebx-88]
movq mm1,[ebx-88]
psllq mm7,60
movq mm4,[ebx-96]
por mm0,mm7
movq [edi-120],mm2
psrlq mm2,4
movq [8+edi],mm5
movq mm6,mm5
movq [ebp-128],mm0
psrlq mm5,4
movq [ebp],mm3
shl edx,4
mov BYTE [2+esp],dl
mov edx,DWORD [ebx-72]
movq mm0,[ebx-72]
psllq mm6,60
movq mm3,[ebx-80]
por mm2,mm6
movq [edi-112],mm1
psrlq mm1,4
movq [16+edi],mm4
movq mm7,mm4
movq [ebp-120],mm2
psrlq mm4,4
movq [8+ebp],mm5
shl edx,4
mov BYTE [3+esp],dl
mov edx,DWORD [ebx-56]
movq mm2,[ebx-56]
psllq mm7,60
movq mm5,[ebx-64]
por mm1,mm7
movq [edi-104],mm0
psrlq mm0,4
movq [24+edi],mm3
movq mm6,mm3
movq [ebp-112],mm1
psrlq mm3,4
movq [16+ebp],mm4
shl edx,4
mov BYTE [4+esp],dl
mov edx,DWORD [ebx-40]
movq mm1,[ebx-40]
psllq mm6,60
movq mm4,[ebx-48]
por mm0,mm6
movq [edi-96],mm2
psrlq mm2,4
movq [32+edi],mm5
movq mm7,mm5
movq [ebp-104],mm0
psrlq mm5,4
movq [24+ebp],mm3
shl edx,4
mov BYTE [5+esp],dl
mov edx,DWORD [ebx-24]
movq mm0,[ebx-24]
psllq mm7,60
movq mm3,[ebx-32]
por mm2,mm7
movq [edi-88],mm1
psrlq mm1,4
movq [40+edi],mm4
movq mm6,mm4
movq [ebp-96],mm2
psrlq mm4,4
movq [32+ebp],mm5
shl edx,4
mov BYTE [6+esp],dl
mov edx,DWORD [ebx-8]
movq mm2,[ebx-8]
psllq mm6,60
movq mm5,[ebx-16]
por mm1,mm6
movq [edi-80],mm0
psrlq mm0,4
movq [48+edi],mm3
movq mm7,mm3
movq [ebp-88],mm1
psrlq mm3,4
movq [40+ebp],mm4
shl edx,4
mov BYTE [7+esp],dl
mov edx,DWORD [8+ebx]
movq mm1,[8+ebx]
psllq mm7,60
movq mm4,[ebx]
por mm0,mm7
movq [edi-72],mm2
psrlq mm2,4
movq [56+edi],mm5
movq mm6,mm5
movq [ebp-80],mm0
psrlq mm5,4
movq [48+ebp],mm3
shl edx,4
mov BYTE [8+esp],dl
mov edx,DWORD [24+ebx]
movq mm0,[24+ebx]
psllq mm6,60
movq mm3,[16+ebx]
por mm2,mm6
movq [edi-64],mm1
psrlq mm1,4
movq [64+edi],mm4
movq mm7,mm4
movq [ebp-72],mm2
psrlq mm4,4
movq [56+ebp],mm5
shl edx,4
mov BYTE [9+esp],dl
mov edx,DWORD [40+ebx]
movq mm2,[40+ebx]
psllq mm7,60
movq mm5,[32+ebx]
por mm1,mm7
movq [edi-56],mm0
psrlq mm0,4
movq [72+edi],mm3
movq mm6,mm3
movq [ebp-64],mm1
psrlq mm3,4
movq [64+ebp],mm4
shl edx,4
mov BYTE [10+esp],dl
mov edx,DWORD [56+ebx]
movq mm1,[56+ebx]
psllq mm6,60
movq mm4,[48+ebx]
por mm0,mm6
movq [edi-48],mm2
psrlq mm2,4
movq [80+edi],mm5
movq mm7,mm5
movq [ebp-56],mm0
psrlq mm5,4
movq [72+ebp],mm3
shl edx,4
mov BYTE [11+esp],dl
mov edx,DWORD [72+ebx]
movq mm0,[72+ebx]
psllq mm7,60
movq mm3,[64+ebx]
por mm2,mm7
movq [edi-40],mm1
psrlq mm1,4
movq [88+edi],mm4
movq mm6,mm4
movq [ebp-48],mm2
psrlq mm4,4
movq [80+ebp],mm5
shl edx,4
mov BYTE [12+esp],dl
mov edx,DWORD [88+ebx]
movq mm2,[88+ebx]
psllq mm6,60
movq mm5,[80+ebx]
por mm1,mm6
movq [edi-32],mm0
psrlq mm0,4
movq [96+edi],mm3
movq mm7,mm3
movq [ebp-40],mm1
psrlq mm3,4
movq [88+ebp],mm4
shl edx,4
mov BYTE [13+esp],dl
mov edx,DWORD [104+ebx]
movq mm1,[104+ebx]
psllq mm7,60
movq mm4,[96+ebx]
por mm0,mm7
movq [edi-24],mm2
psrlq mm2,4
movq [104+edi],mm5
movq mm6,mm5
movq [ebp-32],mm0
psrlq mm5,4
movq [96+ebp],mm3
shl edx,4
mov BYTE [14+esp],dl
mov edx,DWORD [120+ebx]
movq mm0,[120+ebx]
psllq mm6,60
movq mm3,[112+ebx]
por mm2,mm6
movq [edi-16],mm1
psrlq mm1,4
movq [112+edi],mm4
movq mm7,mm4
movq [ebp-24],mm2
psrlq mm4,4
movq [104+ebp],mm5
shl edx,4
mov BYTE [15+esp],dl
psllq mm7,60
por mm1,mm7
movq [edi-8],mm0
psrlq mm0,4
movq [120+edi],mm3
movq mm6,mm3
movq [ebp-16],mm1
psrlq mm3,4
movq [112+ebp],mm4
psllq mm6,60
por mm0,mm6
movq [ebp-8],mm0
movq [120+ebp],mm3
movq mm6,[eax]
mov ebx,DWORD [8+eax]
mov edx,DWORD [12+eax]
align 16
L$004outer:
xor edx,DWORD [12+ecx]
xor ebx,DWORD [8+ecx]
pxor mm6,[ecx]
lea ecx,[16+ecx]
mov DWORD [536+esp],ebx
movq [528+esp],mm6
mov DWORD [548+esp],ecx
xor eax,eax
rol edx,8
mov al,dl
mov ebp,eax
and al,15
shr ebp,4
pxor mm0,mm0
rol edx,8
pxor mm1,mm1
pxor mm2,mm2
movq mm7,[16+eax*8+esp]
movq mm6,[144+eax*8+esp]
mov al,dl
movd ebx,mm7
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
shr edi,4
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
xor bl,BYTE [ebp*1+esp]
mov al,dl
movd ecx,mm7
movzx ebx,bl
psrlq mm7,8
movq mm3,mm6
mov ebp,eax
psrlq mm6,8
pxor mm7,[272+edi*8+esp]
and al,15
psllq mm3,56
shr ebp,4
pinsrw mm2,WORD [ebx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+edi*8+esp]
xor cl,BYTE [edi*1+esp]
mov al,dl
mov edx,DWORD [536+esp]
movd ebx,mm7
movzx ecx,cl
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm2
shr edi,4
pinsrw mm1,WORD [ecx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
xor bl,BYTE [ebp*1+esp]
mov al,dl
movd ecx,mm7
movzx ebx,bl
psrlq mm7,8
movq mm3,mm6
mov ebp,eax
psrlq mm6,8
pxor mm7,[272+edi*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm1
shr ebp,4
pinsrw mm0,WORD [ebx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+edi*8+esp]
xor cl,BYTE [edi*1+esp]
mov al,dl
movd ebx,mm7
movzx ecx,cl
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm0
shr edi,4
pinsrw mm2,WORD [ecx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
xor bl,BYTE [ebp*1+esp]
mov al,dl
movd ecx,mm7
movzx ebx,bl
psrlq mm7,8
movq mm3,mm6
mov ebp,eax
psrlq mm6,8
pxor mm7,[272+edi*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm2
shr ebp,4
pinsrw mm1,WORD [ebx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+edi*8+esp]
xor cl,BYTE [edi*1+esp]
mov al,dl
mov edx,DWORD [532+esp]
movd ebx,mm7
movzx ecx,cl
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm1
shr edi,4
pinsrw mm0,WORD [ecx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
xor bl,BYTE [ebp*1+esp]
mov al,dl
movd ecx,mm7
movzx ebx,bl
psrlq mm7,8
movq mm3,mm6
mov ebp,eax
psrlq mm6,8
pxor mm7,[272+edi*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm0
shr ebp,4
pinsrw mm2,WORD [ebx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+edi*8+esp]
xor cl,BYTE [edi*1+esp]
mov al,dl
movd ebx,mm7
movzx ecx,cl
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm2
shr edi,4
pinsrw mm1,WORD [ecx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
xor bl,BYTE [ebp*1+esp]
mov al,dl
movd ecx,mm7
movzx ebx,bl
psrlq mm7,8
movq mm3,mm6
mov ebp,eax
psrlq mm6,8
pxor mm7,[272+edi*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm1
shr ebp,4
pinsrw mm0,WORD [ebx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+edi*8+esp]
xor cl,BYTE [edi*1+esp]
mov al,dl
mov edx,DWORD [528+esp]
movd ebx,mm7
movzx ecx,cl
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm0
shr edi,4
pinsrw mm2,WORD [ecx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
xor bl,BYTE [ebp*1+esp]
mov al,dl
movd ecx,mm7
movzx ebx,bl
psrlq mm7,8
movq mm3,mm6
mov ebp,eax
psrlq mm6,8
pxor mm7,[272+edi*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm2
shr ebp,4
pinsrw mm1,WORD [ebx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+edi*8+esp]
xor cl,BYTE [edi*1+esp]
mov al,dl
movd ebx,mm7
movzx ecx,cl
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm1
shr edi,4
pinsrw mm0,WORD [ecx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
xor bl,BYTE [ebp*1+esp]
mov al,dl
movd ecx,mm7
movzx ebx,bl
psrlq mm7,8
movq mm3,mm6
mov ebp,eax
psrlq mm6,8
pxor mm7,[272+edi*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm0
shr ebp,4
pinsrw mm2,WORD [ebx*2+esi],2
pxor mm7,[16+eax*8+esp]
rol edx,8
pxor mm6,[144+eax*8+esp]
pxor mm7,mm3
pxor mm6,[400+edi*8+esp]
xor cl,BYTE [edi*1+esp]
mov al,dl
mov edx,DWORD [524+esp]
movd ebx,mm7
movzx ecx,cl
psrlq mm7,8
movq mm3,mm6
mov edi,eax
psrlq mm6,8
pxor mm7,[272+ebp*8+esp]
and al,15
psllq mm3,56
pxor mm6,mm2
shr edi,4
pinsrw mm1,WORD [ecx*2+esi],2
pxor mm7,[16+eax*8+esp]
pxor mm6,[144+eax*8+esp]
xor bl,BYTE [ebp*1+esp]
pxor mm7,mm3
pxor mm6,[400+ebp*8+esp]
movzx ebx,bl
pxor mm2,mm2
psllq mm1,4
movd ecx,mm7
psrlq mm7,4
movq mm3,mm6
psrlq mm6,4
shl ecx,4
pxor mm7,[16+edi*8+esp]
psllq mm3,60
movzx ecx,cl
pxor mm7,mm3
pxor mm6,[144+edi*8+esp]
pinsrw mm0,WORD [ebx*2+esi],2
pxor mm6,mm1
movd edx,mm7
pinsrw mm2,WORD [ecx*2+esi],3
psllq mm0,12
pxor mm6,mm0
psrlq mm7,32
pxor mm6,mm2
mov ecx,DWORD [548+esp]
movd ebx,mm7
movq mm3,mm6
psllw mm6,8
psrlw mm3,8
por mm6,mm3
bswap edx
pshufw mm6,mm6,27
bswap ebx
cmp ecx,DWORD [552+esp]
jne NEAR L$004outer
mov eax,DWORD [544+esp]
mov DWORD [12+eax],edx
mov DWORD [8+eax],ebx
movq [eax],mm6
mov esp,DWORD [556+esp]
emms
pop edi
pop esi
pop ebx
pop ebp
ret
global _gcm_init_clmul
align 16
_gcm_init_clmul:
L$_gcm_init_clmul_begin:
mov edx,DWORD [4+esp]
mov eax,DWORD [8+esp]
call L$005pic
L$005pic:
pop ecx
lea ecx,[(L$bswap-L$005pic)+ecx]
movdqu xmm2,[eax]
pshufd xmm2,xmm2,78
pshufd xmm4,xmm2,255
movdqa xmm3,xmm2
psllq xmm2,1
pxor xmm5,xmm5
psrlq xmm3,63
pcmpgtd xmm5,xmm4
pslldq xmm3,8
por xmm2,xmm3
pand xmm5,[16+ecx]
pxor xmm2,xmm5
movdqa xmm0,xmm2
movdqa xmm1,xmm0
pshufd xmm3,xmm0,78
pshufd xmm4,xmm2,78
pxor xmm3,xmm0
pxor xmm4,xmm2
db 102,15,58,68,194,0
db 102,15,58,68,202,17
db 102,15,58,68,220,0
xorps xmm3,xmm0
xorps xmm3,xmm1
movdqa xmm4,xmm3
psrldq xmm3,8
pslldq xmm4,8
pxor xmm1,xmm3
pxor xmm0,xmm4
movdqa xmm4,xmm0
movdqa xmm3,xmm0
psllq xmm0,5
pxor xmm3,xmm0
psllq xmm0,1
pxor xmm0,xmm3
psllq xmm0,57
movdqa xmm3,xmm0
pslldq xmm0,8
psrldq xmm3,8
pxor xmm0,xmm4
pxor xmm1,xmm3
movdqa xmm4,xmm0
psrlq xmm0,1
pxor xmm1,xmm4
pxor xmm4,xmm0
psrlq xmm0,5
pxor xmm0,xmm4
psrlq xmm0,1
pxor xmm0,xmm1
pshufd xmm3,xmm2,78
pshufd xmm4,xmm0,78
pxor xmm3,xmm2
movdqu [edx],xmm2
pxor xmm4,xmm0
movdqu [16+edx],xmm0
db 102,15,58,15,227,8
movdqu [32+edx],xmm4
ret
global _gcm_gmult_clmul
align 16
_gcm_gmult_clmul:
L$_gcm_gmult_clmul_begin:
mov eax,DWORD [4+esp]
mov edx,DWORD [8+esp]
call L$006pic
L$006pic:
pop ecx
lea ecx,[(L$bswap-L$006pic)+ecx]
movdqu xmm0,[eax]
movdqa xmm5,[ecx]
movups xmm2,[edx]
db 102,15,56,0,197
movups xmm4,[32+edx]
movdqa xmm1,xmm0
pshufd xmm3,xmm0,78
pxor xmm3,xmm0
db 102,15,58,68,194,0
db 102,15,58,68,202,17
db 102,15,58,68,220,0
xorps xmm3,xmm0
xorps xmm3,xmm1
movdqa xmm4,xmm3
psrldq xmm3,8
pslldq xmm4,8
pxor xmm1,xmm3
pxor xmm0,xmm4
movdqa xmm4,xmm0
movdqa xmm3,xmm0
psllq xmm0,5
pxor xmm3,xmm0
psllq xmm0,1
pxor xmm0,xmm3
psllq xmm0,57
movdqa xmm3,xmm0
pslldq xmm0,8
psrldq xmm3,8
pxor xmm0,xmm4
pxor xmm1,xmm3
movdqa xmm4,xmm0
psrlq xmm0,1
pxor xmm1,xmm4
pxor xmm4,xmm0
psrlq xmm0,5
pxor xmm0,xmm4
psrlq xmm0,1
pxor xmm0,xmm1
db 102,15,56,0,197
movdqu [eax],xmm0
ret
global _gcm_ghash_clmul
align 16
_gcm_ghash_clmul:
L$_gcm_ghash_clmul_begin:
push ebp
push ebx
push esi
push edi
mov eax,DWORD [20+esp]
mov edx,DWORD [24+esp]
mov esi,DWORD [28+esp]
mov ebx,DWORD [32+esp]
call L$007pic
L$007pic:
pop ecx
lea ecx,[(L$bswap-L$007pic)+ecx]
movdqu xmm0,[eax]
movdqa xmm5,[ecx]
movdqu xmm2,[edx]
db 102,15,56,0,197
sub ebx,16
jz NEAR L$008odd_tail
movdqu xmm3,[esi]
movdqu xmm6,[16+esi]
db 102,15,56,0,221
db 102,15,56,0,245
movdqu xmm5,[32+edx]
pxor xmm0,xmm3
pshufd xmm3,xmm6,78
movdqa xmm7,xmm6
pxor xmm3,xmm6
lea esi,[32+esi]
db 102,15,58,68,242,0
db 102,15,58,68,250,17
db 102,15,58,68,221,0
movups xmm2,[16+edx]
nop
sub ebx,32
jbe NEAR L$009even_tail
jmp NEAR L$010mod_loop
align 32
L$010mod_loop:
pshufd xmm4,xmm0,78
movdqa xmm1,xmm0
pxor xmm4,xmm0
nop
db 102,15,58,68,194,0
db 102,15,58,68,202,17
db 102,15,58,68,229,16
movups xmm2,[edx]
xorps xmm0,xmm6
movdqa xmm5,[ecx]
xorps xmm1,xmm7
movdqu xmm7,[esi]
pxor xmm3,xmm0
movdqu xmm6,[16+esi]
pxor xmm3,xmm1
db 102,15,56,0,253
pxor xmm4,xmm3
movdqa xmm3,xmm4
psrldq xmm4,8
pslldq xmm3,8
pxor xmm1,xmm4
pxor xmm0,xmm3
db 102,15,56,0,245
pxor xmm1,xmm7
movdqa xmm7,xmm6
movdqa xmm4,xmm0
movdqa xmm3,xmm0
psllq xmm0,5
pxor xmm3,xmm0
psllq xmm0,1
pxor xmm0,xmm3
db 102,15,58,68,242,0
movups xmm5,[32+edx]
psllq xmm0,57
movdqa xmm3,xmm0
pslldq xmm0,8
psrldq xmm3,8
pxor xmm0,xmm4
pxor xmm1,xmm3
pshufd xmm3,xmm7,78
movdqa xmm4,xmm0
psrlq xmm0,1
pxor xmm3,xmm7
pxor xmm1,xmm4
db 102,15,58,68,250,17
movups xmm2,[16+edx]
pxor xmm4,xmm0
psrlq xmm0,5
pxor xmm0,xmm4
psrlq xmm0,1
pxor xmm0,xmm1
db 102,15,58,68,221,0
lea esi,[32+esi]
sub ebx,32
ja NEAR L$010mod_loop
L$009even_tail:
pshufd xmm4,xmm0,78
movdqa xmm1,xmm0
pxor xmm4,xmm0
db 102,15,58,68,194,0
db 102,15,58,68,202,17
db 102,15,58,68,229,16
movdqa xmm5,[ecx]
xorps xmm0,xmm6
xorps xmm1,xmm7
pxor xmm3,xmm0
pxor xmm3,xmm1
pxor xmm4,xmm3
movdqa xmm3,xmm4
psrldq xmm4,8
pslldq xmm3,8
pxor xmm1,xmm4
pxor xmm0,xmm3
movdqa xmm4,xmm0
movdqa xmm3,xmm0
psllq xmm0,5
pxor xmm3,xmm0
psllq xmm0,1
pxor xmm0,xmm3
psllq xmm0,57
movdqa xmm3,xmm0
pslldq xmm0,8
psrldq xmm3,8
pxor xmm0,xmm4
pxor xmm1,xmm3
movdqa xmm4,xmm0
psrlq xmm0,1
pxor xmm1,xmm4
pxor xmm4,xmm0
psrlq xmm0,5
pxor xmm0,xmm4
psrlq xmm0,1
pxor xmm0,xmm1
test ebx,ebx
jnz NEAR L$011done
movups xmm2,[edx]
L$008odd_tail:
movdqu xmm3,[esi]
db 102,15,56,0,221
pxor xmm0,xmm3
movdqa xmm1,xmm0
pshufd xmm3,xmm0,78
pshufd xmm4,xmm2,78
pxor xmm3,xmm0
pxor xmm4,xmm2
db 102,15,58,68,194,0
db 102,15,58,68,202,17
db 102,15,58,68,220,0
xorps xmm3,xmm0
xorps xmm3,xmm1
movdqa xmm4,xmm3
psrldq xmm3,8
pslldq xmm4,8
pxor xmm1,xmm3
pxor xmm0,xmm4
movdqa xmm4,xmm0
movdqa xmm3,xmm0
psllq xmm0,5
pxor xmm3,xmm0
psllq xmm0,1
pxor xmm0,xmm3
psllq xmm0,57
movdqa xmm3,xmm0
pslldq xmm0,8
psrldq xmm3,8
pxor xmm0,xmm4
pxor xmm1,xmm3
movdqa xmm4,xmm0
psrlq xmm0,1
pxor xmm1,xmm4
pxor xmm4,xmm0
psrlq xmm0,5
pxor xmm0,xmm4
psrlq xmm0,1
pxor xmm0,xmm1
L$011done:
db 102,15,56,0,197
movdqu [eax],xmm0
pop edi
pop esi
pop ebx
pop ebp
ret
align 64
L$bswap:
db 15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0
db 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,194
align 64
L$rem_8bit:
dw 0,450,900,582,1800,1738,1164,1358
dw 3600,4050,3476,3158,2328,2266,2716,2910
dw 7200,7650,8100,7782,6952,6890,6316,6510
dw 4656,5106,4532,4214,5432,5370,5820,6014
dw 14400,14722,15300,14854,16200,16010,15564,15630
dw 13904,14226,13780,13334,12632,12442,13020,13086
dw 9312,9634,10212,9766,9064,8874,8428,8494
dw 10864,11186,10740,10294,11640,11450,12028,12094
dw 28800,28994,29444,29382,30600,30282,29708,30158
dw 32400,32594,32020,31958,31128,30810,31260,31710
dw 27808,28002,28452,28390,27560,27242,26668,27118
dw 25264,25458,24884,24822,26040,25722,26172,26622
dw 18624,18690,19268,19078,20424,19978,19532,19854
dw 18128,18194,17748,17558,16856,16410,16988,17310
dw 21728,21794,22372,22182,21480,21034,20588,20910
dw 23280,23346,22900,22710,24056,23610,24188,24510
dw 57600,57538,57988,58182,58888,59338,58764,58446
dw 61200,61138,60564,60758,59416,59866,60316,59998
dw 64800,64738,65188,65382,64040,64490,63916,63598
dw 62256,62194,61620,61814,62520,62970,63420,63102
dw 55616,55426,56004,56070,56904,57226,56780,56334
dw 55120,54930,54484,54550,53336,53658,54236,53790
dw 50528,50338,50916,50982,49768,50090,49644,49198
dw 52080,51890,51444,51510,52344,52666,53244,52798
dw 37248,36930,37380,37830,38536,38730,38156,38094
dw 40848,40530,39956,40406,39064,39258,39708,39646
dw 36256,35938,36388,36838,35496,35690,35116,35054
dw 33712,33394,32820,33270,33976,34170,34620,34558
dw 43456,43010,43588,43910,44744,44810,44364,44174
dw 42960,42514,42068,42390,41176,41242,41820,41630
dw 46560,46114,46692,47014,45800,45866,45420,45230
dw 48112,47666,47220,47542,48376,48442,49020,48830
align 64
L$rem_4bit:
dd 0,0,0,471859200,0,943718400,0,610271232
dd 0,1887436800,0,1822425088,0,1220542464,0,1423966208
dd 0,3774873600,0,4246732800,0,3644850176,0,3311403008
dd 0,2441084928,0,2376073216,0,2847932416,0,3051356160
db 71,72,65,83,72,32,102,111,114,32,120,56,54,44,32,67
db 82,89,80,84,79,71,65,77,83,32,98,121,32,60,97,112
db 112,114,111,64,111,112,101,110,115,115,108,46,111,114,103,62
db 0
|
Desk Control/FaderLevel.applescript | streth11/Qlab-Scripts | 0 | 198 | <reponame>streth11/Qlab-Scripts<filename>Desk Control/FaderLevel.applescript
-- Creates a midi sysex cue to set the value of any fader to a given value
-- Yamaha LS9-32
-- change to preamble will change desk type, should work for modern desks
-- but to be vereified
--
-- Example string inputs:
-- ch 7 to -20 -- channel 7 to -20db
-- mix 16 to 1 -- mix 16 to +1db
-- mtrx 4 out -- mtrx 4 to -inf db (if setting out/-inf NO NOT include 'to')
--
-- accepted chan values: ch 1-64 ; st 1-4 ; mix 1-16 ; mt/mtrx 1-8
-- accepoted db values: out/-Inf ; -137 -> +10
--
-- author: t.streuli
------- Script --------
tell application id "com.figure53.Qlab.4" to tell front workspace
display dialog "Enter Fader Level Control String" default answer "" buttons {"Set", "Cancel"} cancel button "Cancel" default button "Set" with title "SCENE NUMBER"
set inputMsg to text returned of result
set message to my faderString(inputMsg)
-- Make the midi program cue
make type "Midi"
set midiBank to first item of (selected as list)
set message type of midiBank to sysex
set sysex message of midiBank to message
set q name of midiBank to inputMsg
end tell
---------- Functions ----------------
-- SYSEX midi string for given control string
on faderString(inputMsg)
set pre to "43 10 3E 12 01"
set splitText to split(inputMsg, space)
-- channel number
set chan to item 1 of splitText
set chanN to item 2 of splitText as integer
if chan = "st" then
set chanNumVal to hex(chanN * 2 + 62)
else
set chanNumVal to hex(chanN - 1)
end if
-- Hex value for channel type
if chan = "ch" or chan = "st" then
set chanType to hex(51)
else if chan = "mix" then
set chanType to hex(78)
else if chan = "mt" or chan = "mtrx" then
set chanType to hex(95)
end if
-- stereo master = 109, not checked or implimented
-- fader value
if length of splitText = 3 then
set dbVal to item 3 of splitText
if dbVal = "out" or dbVal = "-inf" then
set value to "00 00"
end if
else if length of splitText is equal to 4 then
set dbVal to item 4 of splitText as number
set value to midiDbVal(dbVal)
end if
set msg to pre & " 00 " & chanType & " 00 00 00 " & chanNumVal & " 00 00 00 " & value
return msg
end faderString
-- fader value as hex string
on midiDbVal(d)
if d > -138.0 and d ≤ -96.0 then
set q to 47 + (d / 3)
else if d > -96.0 and d ≤ -78.0 then
set q to 111 + d
else if d > -77.8 and d ≤ -40 then
set q to 423 + d * 5
else if d > -40 and d ≤ -20 then
set q to 623 + d * 10
else if d > -20 then
set q to 823 + d * 20
end if
set q to round (q)
set y to q div 128 as text
set z to hex(q mod 128)
set midiVal to "0" & y & " " & z
return midiVal
end midiDbVal
-- splits text into list
to split(someText, delimiter)
set AppleScript's text item delimiters to delimiter
set someText to someText's text items
set AppleScript's text item delimiters to {""}
return someText
end split
-- returns hex from an integer
on hex(x)
set val to do shell script "perl -e 'printf(\"%02X\", " & x & ")'"
return val
end hex |
aux/2600/nusiz_during_draw/player8.asm | 6502ts/6502.ts | 49 | 99376 | NUSIZ_FROM = $00
NUSIZ_TO_1 = $05
NUSIZ_TO_2 = $07
INCLUDE main.inc |
non_regression/other_x86_macosx_12.s.asm | LRGH/plasmasm | 1 | 1557 | <gh_stars>1-10
.macosx_version_min 10, 12
.section __TEXT,__text,regular,pure_instructions
.align 4, 0x90
.globl _local_labels
_local_labels:
pushl %ebp
movl %esp, %ebp
.L1_LOCAL_LABEL_1:
movl 8(%ebp), %eax
jmp .L1_LOCAL_LABEL_1
movl $1, 4(%eax)
movl $2, 8(%eax)
movl $3, 12(%eax)
jmp .L1_LOCAL_LABEL_2
jmp .L1_LOCAL_LABEL_1
movl $4, 20(%eax)
.L1_LOCAL_LABEL_2:
movl $5, 16(%eax)
movl $6, 24(%eax)
popl %ebp
ret
# ----------------------
.subsections_via_symbols
|
test/Fail/NoBindingForBuiltin.agda | cruhland/agda | 1,989 | 6470 | <reponame>cruhland/agda
module NoBindingForBuiltin where
foo = 42
|
edge-hub/core/src/Microsoft.Azure.Devices.Routing.Core/grammar/GrammarLexer.g4 | dmolokanov/iotedge | 1,365 | 2014 | <filename>edge-hub/core/src/Microsoft.Azure.Devices.Routing.Core/grammar/GrammarLexer.g4<gh_stars>1000+
lexer grammar GrammarLexer;
SELECT : S E L E C T;
FROM : F R O M;
WHERE : W H E R E;
INTO : I N T O;
// string
STRING
: '"' (ESC | ~["\\])* '"'
| '\'' (ESC | ~['\\])* '\''
;
UNTERMINATED_STRING
: '"' (ESC | ~["\\])*
| '\'' (ESC | ~['\\])*
;
fragment ESC : '\\' (["'\\] | UNICODE) ;
fragment UNICODE : 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT ;
fragment HEX_DIGIT : [0-9a-fA-F];
// Numbers
INTEGER_LITERAL
: '-'? INT
;
HEX_INTEGER_LITERAL
: '0' [Xx] HEX_DIGIT+
;
REAL_LITERAL
: '-'? [0-9]* '.' [0-9]+ EXP?
| '-'? [0-9]* EXP;
fragment INT : [0-9]+;
fragment EXP : [Ee] [+\-]? INT;
TRUE : 'true' ;
FALSE : 'false' ;
NULL : 'null' ;
UNDEFINED : 'undefined';
OPEN_PARENS: '(' ;
CLOSE_PARENS: ')' ;
COMMA: ',' ;
PLUS: '+' ;
MINUS: '-' ;
OP_MUL: '*' ;
OP_DIV: '/' ;
OP_MOD: '%' ;
AND: [Aa] [Nn] [Dd] ;
OR: [Oo] [Rr] ;
NOT: [Nn] [Oo] [Tt] ;
OP_EQ: '=' ;
OP_NE1: '!=' ;
OP_NE2: '<>' ;
OP_LE: '<=' ;
OP_GE: '>=' ;
OP_GT: '>' ;
OP_LT: '<' ;
OP_CONCAT: '||' ;
OP_COALESCE: '??' ;
SYS_PROP : '$' QUERY_PATH ;
ID : ID_CHARS+ ;
QUERY_PATH : QUERY_PATH_CHARS+ ;
fragment QUERY_PATH_CHARS : ~[()<>@,;:\\"/?={} \t\n\r];
fragment ID_CHARS : ~[()<>@,;:\\"/[\]?={} \t\n\r];
WS: [ \t\r\n]+ -> skip;
COMMENT: '/*' .*? '*/' -> channel(HIDDEN);
// catches all remaining characters as an error token, moving all error handling from the lexer to the parser
UNKNOWN_CHAR: . ;
fragment A
: 'A' | 'a';
fragment B
: 'B' | 'b';
fragment C
: 'C' | 'c';
fragment D
: 'D' | 'd';
fragment E
: 'E' | 'e';
fragment F
: 'F' | 'f';
fragment G
: 'G' | 'g';
fragment H
: 'H' | 'h';
fragment I
: 'I' | 'i';
fragment J
: 'J' | 'j';
fragment K
: 'K' | 'k';
fragment L
: 'L' | 'l';
fragment M
: 'M' | 'm';
fragment N
: 'N' | 'n';
fragment O
: 'O' | 'o';
fragment P
: 'P' | 'p';
fragment Q
: 'Q' | 'q';
fragment R
: 'R' | 'r';
fragment S
: 'S' | 's';
fragment T
: 'T' | 't';
fragment U
: 'U' | 'u';
fragment V
: 'V' | 'v';
fragment W
: 'W' | 'w';
fragment X
: 'X' | 'x';
fragment Y
: 'Y' | 'y';
fragment Z
: 'Z' | 'z';
|
programs/oeis/259/A259599.asm | neoneye/loda | 22 | 26016 | <filename>programs/oeis/259/A259599.asm<gh_stars>10-100
; A259599: Infinite palindromic word (a(1),a(2),a(3),...) with initial word w(1) = (1,0,1) and midword sequence (a(n)); see Comments.
; 1,0,1,1,1,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1
lpb $0
seq $0,7814 ; Exponent of highest power of 2 dividing n, a.k.a. the binary carry sequence, the ruler sequence, or the 2-adic valuation of n.
sub $0,2
lpe
add $0,1
mod $0,2
|
test/Fail/Issue483c.agda | shlevy/agda | 1,989 | 5572 | <reponame>shlevy/agda<gh_stars>1000+
-- {-# OPTIONS -v tc.meta.assign:50 #-}
module Issue483c where
import Common.Level
data _≡_ {A : Set}(a : A) : A → Set where
refl : a ≡ a
data ⊥ : Set where
record ⊤ : Set where
refute : .⊥ → ⊥
refute ()
mk⊤ : ⊥ → ⊤
mk⊤ ()
X : .⊤ → ⊥
bad : .(x : ⊥) → X (mk⊤ x) ≡ refute x
X = _
bad x = refl
false : ⊥
false = X _
|
src/Categories/Functor/Algebra.agda | Trebor-Huang/agda-categories | 279 | 10546 | <filename>src/Categories/Functor/Algebra.agda
{-# OPTIONS --without-K --safe #-}
module Categories.Functor.Algebra where
-- Algebra for a Functor
open import Level
open import Function using (_$_)
open import Categories.Category using (Category)
open import Categories.Functor using (Functor; Endofunctor)
private
variable
o ℓ e : Level
module _ {C : Category o ℓ e} where
record F-Algebra (F : Endofunctor C) : Set (o ⊔ ℓ) where
open Category C
field
A : Obj
α : Functor.F₀ F A ⇒ A
open F-Algebra
-- Given an F-Algebra F, one can apply F to it to obtain an new 'iterated' F-Algebra
iterate : {F : Endofunctor C} → F-Algebra F → F-Algebra F
iterate {F} c = record { A = Functor.F₀ F $ A c ; α = Functor.F₁ F $ α c }
record F-Algebra-Morphism {F : Endofunctor C} (X Y : F-Algebra F) : Set (ℓ ⊔ e) where
open Category C
module X = F-Algebra X
module Y = F-Algebra Y
open Functor F
field
f : X.A ⇒ Y.A
commutes : f ∘ X.α ≈ Y.α ∘ F₁ f
|
libsrc/_DEVELOPMENT/math/float/math48/lm/z80/asm_dsize.asm | meesokim/z88dk | 0 | 163529 | <reponame>meesokim/z88dk
SECTION code_fp_math48
PUBLIC asm_dsize
EXTERN am48_dsize
defc asm_dsize = am48_dsize
|
i8051ISS/euclidSDCCRefined/obj/euclid.asm | agnsal/Euclid | 1 | 171333 | <reponame>agnsal/Euclid
;--------------------------------------------------------
; File Created by SDCC : free open source ANSI-C Compiler
; Version 3.9.2 #11326 (MINGW64)
;--------------------------------------------------------
.module euclid
.optsdcc -mmcs51 --model-small
;--------------------------------------------------------
; Public variables in this module
;--------------------------------------------------------
.globl _main
.globl _CY
.globl _AC
.globl _F0
.globl _RS1
.globl _RS0
.globl _OV
.globl _F1
.globl _P
.globl _PS
.globl _PT1
.globl _PX1
.globl _PT0
.globl _PX0
.globl _RD
.globl _WR
.globl _T1
.globl _T0
.globl _INT1
.globl _INT0
.globl _TXD
.globl _RXD
.globl _P3_7
.globl _P3_6
.globl _P3_5
.globl _P3_4
.globl _P3_3
.globl _P3_2
.globl _P3_1
.globl _P3_0
.globl _EA
.globl _ES
.globl _ET1
.globl _EX1
.globl _ET0
.globl _EX0
.globl _P2_7
.globl _P2_6
.globl _P2_5
.globl _P2_4
.globl _P2_3
.globl _P2_2
.globl _P2_1
.globl _P2_0
.globl _SM0
.globl _SM1
.globl _SM2
.globl _REN
.globl _TB8
.globl _RB8
.globl _TI
.globl _RI
.globl _P1_7
.globl _P1_6
.globl _P1_5
.globl _P1_4
.globl _P1_3
.globl _P1_2
.globl _P1_1
.globl _P1_0
.globl _TF1
.globl _TR1
.globl _TF0
.globl _TR0
.globl _IE1
.globl _IT1
.globl _IE0
.globl _IT0
.globl _P0_7
.globl _P0_6
.globl _P0_5
.globl _P0_4
.globl _P0_3
.globl _P0_2
.globl _P0_1
.globl _P0_0
.globl _B
.globl _ACC
.globl _PSW
.globl _IP
.globl _P3
.globl _IE
.globl _P2
.globl _SBUF
.globl _SCON
.globl _P1
.globl _TH1
.globl _TH0
.globl _TL1
.globl _TL0
.globl _TMOD
.globl _TCON
.globl _PCON
.globl _DPH
.globl _DPL
.globl _SP
.globl _P0
;--------------------------------------------------------
; special function registers
;--------------------------------------------------------
.area RSEG (ABS,DATA)
.org 0x0000
_P0 = 0x0080
_SP = 0x0081
_DPL = 0x0082
_DPH = 0x0083
_PCON = 0x0087
_TCON = 0x0088
_TMOD = 0x0089
_TL0 = 0x008a
_TL1 = 0x008b
_TH0 = 0x008c
_TH1 = 0x008d
_P1 = 0x0090
_SCON = 0x0098
_SBUF = 0x0099
_P2 = 0x00a0
_IE = 0x00a8
_P3 = 0x00b0
_IP = 0x00b8
_PSW = 0x00d0
_ACC = 0x00e0
_B = 0x00f0
;--------------------------------------------------------
; special function bits
;--------------------------------------------------------
.area RSEG (ABS,DATA)
.org 0x0000
_P0_0 = 0x0080
_P0_1 = 0x0081
_P0_2 = 0x0082
_P0_3 = 0x0083
_P0_4 = 0x0084
_P0_5 = 0x0085
_P0_6 = 0x0086
_P0_7 = 0x0087
_IT0 = 0x0088
_IE0 = 0x0089
_IT1 = 0x008a
_IE1 = 0x008b
_TR0 = 0x008c
_TF0 = 0x008d
_TR1 = 0x008e
_TF1 = 0x008f
_P1_0 = 0x0090
_P1_1 = 0x0091
_P1_2 = 0x0092
_P1_3 = 0x0093
_P1_4 = 0x0094
_P1_5 = 0x0095
_P1_6 = 0x0096
_P1_7 = 0x0097
_RI = 0x0098
_TI = 0x0099
_RB8 = 0x009a
_TB8 = 0x009b
_REN = 0x009c
_SM2 = 0x009d
_SM1 = 0x009e
_SM0 = 0x009f
_P2_0 = 0x00a0
_P2_1 = 0x00a1
_P2_2 = 0x00a2
_P2_3 = 0x00a3
_P2_4 = 0x00a4
_P2_5 = 0x00a5
_P2_6 = 0x00a6
_P2_7 = 0x00a7
_EX0 = 0x00a8
_ET0 = 0x00a9
_EX1 = 0x00aa
_ET1 = 0x00ab
_ES = 0x00ac
_EA = 0x00af
_P3_0 = 0x00b0
_P3_1 = 0x00b1
_P3_2 = 0x00b2
_P3_3 = 0x00b3
_P3_4 = 0x00b4
_P3_5 = 0x00b5
_P3_6 = 0x00b6
_P3_7 = 0x00b7
_RXD = 0x00b0
_TXD = 0x00b1
_INT0 = 0x00b2
_INT1 = 0x00b3
_T0 = 0x00b4
_T1 = 0x00b5
_WR = 0x00b6
_RD = 0x00b7
_PX0 = 0x00b8
_PT0 = 0x00b9
_PX1 = 0x00ba
_PT1 = 0x00bb
_PS = 0x00bc
_P = 0x00d0
_F1 = 0x00d1
_OV = 0x00d2
_RS0 = 0x00d3
_RS1 = 0x00d4
_F0 = 0x00d5
_AC = 0x00d6
_CY = 0x00d7
;--------------------------------------------------------
; overlayable register banks
;--------------------------------------------------------
.area REG_BANK_0 (REL,OVR,DATA)
.ds 8
;--------------------------------------------------------
; internal ram data
;--------------------------------------------------------
.area DSEG (DATA)
;--------------------------------------------------------
; overlayable items in internal ram
;--------------------------------------------------------
;--------------------------------------------------------
; Stack segment in internal ram
;--------------------------------------------------------
.area SSEG
__start__stack:
.ds 1
;--------------------------------------------------------
; indirectly addressable internal ram data
;--------------------------------------------------------
.area ISEG (DATA)
;--------------------------------------------------------
; absolute internal ram data
;--------------------------------------------------------
.area IABS (ABS,DATA)
.area IABS (ABS,DATA)
;--------------------------------------------------------
; bit data
;--------------------------------------------------------
.area BSEG (BIT)
;--------------------------------------------------------
; paged external ram data
;--------------------------------------------------------
.area PSEG (PAG,XDATA)
;--------------------------------------------------------
; external ram data
;--------------------------------------------------------
.area XSEG (XDATA)
;--------------------------------------------------------
; absolute external ram data
;--------------------------------------------------------
.area XABS (ABS,XDATA)
;--------------------------------------------------------
; external initialized ram data
;--------------------------------------------------------
.area XISEG (XDATA)
.area HOME (CODE)
.area GSINIT0 (CODE)
.area GSINIT1 (CODE)
.area GSINIT2 (CODE)
.area GSINIT3 (CODE)
.area GSINIT4 (CODE)
.area GSINIT5 (CODE)
.area GSINIT (CODE)
.area GSFINAL (CODE)
.area CSEG (CODE)
;--------------------------------------------------------
; interrupt vector
;--------------------------------------------------------
.area HOME (CODE)
__interrupt_vect:
ljmp __sdcc_gsinit_startup
;--------------------------------------------------------
; global & static initialisations
;--------------------------------------------------------
.area HOME (CODE)
.area GSINIT (CODE)
.area GSFINAL (CODE)
.area GSINIT (CODE)
.globl __sdcc_gsinit_startup
.globl __sdcc_program_startup
.globl __start__stack
.globl __mcs51_genXINIT
.globl __mcs51_genXRAMCLEAR
.globl __mcs51_genRAMCLEAR
.area GSFINAL (CODE)
ljmp __sdcc_program_startup
;--------------------------------------------------------
; Home
;--------------------------------------------------------
.area HOME (CODE)
.area HOME (CODE)
__sdcc_program_startup:
ljmp _main
; return from main will return to caller
;--------------------------------------------------------
; code
;--------------------------------------------------------
.area CSEG (CODE)
;------------------------------------------------------------
;Allocation info for local variables in function 'main'
;------------------------------------------------------------
;x Allocated to registers
;y Allocated to registers
;a Allocated to registers r6 r7
;b Allocated to registers r4 r5
;q Allocated to registers r2 r3
;r Allocated to registers r0 r1
;------------------------------------------------------------
; ../../euclid.c:21: void main() {
; -----------------------------------------
; function main
; -----------------------------------------
_main:
ar7 = 0x07
ar6 = 0x06
ar5 = 0x05
ar4 = 0x04
ar3 = 0x03
ar2 = 0x02
ar1 = 0x01
ar0 = 0x00
; ../../euclid.c:28: a = x;
mov r6,#0x64
mov r7,#0x00
; ../../euclid.c:29: b = y;
mov r4,#0x3c
mov r5,#0x00
; ../../euclid.c:30: q = a / b;
mov r2,#0x01
mov r3,#0x00
; ../../euclid.c:31: r = a % b;
mov r0,#0x28
mov r1,#0x00
; ../../euclid.c:33: while(r != 0){
00101$:
mov a,r0
orl a,r1
jz 00103$
; ../../euclid.c:35: P0 = a;
mov _P0,r6
; ../../euclid.c:36: P1 = b;
mov _P1,r4
; ../../euclid.c:37: P2 = q;
mov _P2,r2
; ../../euclid.c:38: P3 = r;
mov _P3,r0
; ../../euclid.c:41: a = b;
mov ar6,r4
mov ar7,r5
; ../../euclid.c:42: b = r;
mov ar4,r0
mov ar5,r1
; ../../euclid.c:43: q = a / b;
mov __divsint_PARM_2,r0
mov (__divsint_PARM_2 + 1),r1
mov dpl,r6
mov dph,r7
push ar7
push ar6
push ar5
push ar4
push ar1
push ar0
lcall __divsint
mov r2,dpl
mov r3,dph
pop ar0
pop ar1
pop ar4
pop ar5
pop ar6
pop ar7
; ../../euclid.c:44: r = a % b;
mov __modsint_PARM_2,r0
mov (__modsint_PARM_2 + 1),r1
mov dpl,r6
mov dph,r7
push ar7
push ar6
push ar5
push ar4
push ar3
push ar2
lcall __modsint
mov r0,dpl
mov r1,dph
pop ar2
pop ar3
pop ar4
pop ar5
pop ar6
pop ar7
sjmp 00101$
00103$:
; ../../euclid.c:49: P0 = a;
mov _P0,r6
; ../../euclid.c:50: P1 = b;
mov _P1,r4
; ../../euclid.c:51: P2 = q;
mov _P2,r2
; ../../euclid.c:52: P3 = r;
mov _P3,r0
; ../../euclid.c:55: P0 = 0;
mov _P0,#0x00
; ../../euclid.c:56: P1 = 0;
mov _P1,#0x00
; ../../euclid.c:57: P2 = 0;
mov _P2,#0x00
; ../../euclid.c:58: P3 = 0;
mov _P3,#0x00
; ../../euclid.c:60: while(1);
00105$:
; ../../euclid.c:61: }
sjmp 00105$
.area CSEG (CODE)
.area CONST (CODE)
.area XINIT (CODE)
.area CABS (ABS,CODE)
|
programs/oeis/281/A281813.asm | karttu/loda | 1 | 162066 | ; A281813: a(0) = 3, a(n) = 8*n + 4 for n > 0.
; 3,12,20,28,36,44,52,60,68,76,84,92,100,108,116,124,132,140,148,156,164,172,180,188,196,204,212,220,228,236,244,252,260,268,276,284,292,300,308,316,324,332,340,348,356,364,372,380,388,396,404
mul $0,8
bin $1,$0
sub $0,$1
add $0,4
mov $1,$0
|
Float Operations/Float IO.asm | MrR0B0T777/MIPS_Programming | 0 | 80467 | .data
prompt: .asciiz "\nEnter a number: "
ans: .asciiz "\nYou entered: "
.text
main:
la $a0, prompt
li $v0, 4
syscall
la $v0, 6 #float input
syscall
mov.s $f12, $f0
la $a0, ans
li $v0, 4
syscall
li $v0, 2 #float output
syscall
li $v0, 10
syscall |
Task/Stair-climbing-puzzle/Ada/stair-climbing-puzzle-1.ada | LaudateCorpus1/RosettaCodeData | 1 | 14739 | procedure Step_Up is
begin
while not Step loop
Step_Up;
end loop;
end Step_Up;
|
programs/oeis/273/A273465.asm | neoneye/loda | 22 | 80366 | ; A273465: Numbers generated by starting at 1 and adding twice and subtracting once following the sequence of positive integers.
; 1,3,6,2,7,13,6,14,23,13,24,36,23,37,52,36,53,71,52,72,93,71,94,118,93,119,146,118,147,177,146,178,211,177,212,248,211,249,288,248,289,331,288,332,377,331,378,426,377,427,478,426,479,533,478,534,591,533,592,652,591,653,716,652,717,783,716,784,853,783,854,926,853,927,1002,926,1003,1081,1002,1082,1163,1081,1164,1248,1163,1249,1336,1248,1337,1427,1336,1428,1521,1427,1522,1618,1521,1619,1718,1618
add $0,1
seq $0,267313 ; Expansion of x*(-1 + 2*x + 3*x^2 - 2*x^3 + x^4)/((1 - x)^3*(1 + x + x^2)^2).
add $0,2
|
thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdltests/testvidinfo.adb | Lucretia/old_nehe_ada95 | 0 | 19816 | <gh_stars>0
-- ----------------------------------------------------------------- --
-- --
-- This is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public --
-- License as published by the Free Software Foundation; either --
-- version 2 of the License, or (at your option) any later version. --
-- --
-- This software is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. --
-- --
-- You should have received a copy of the GNU General Public --
-- License along with this library; if not, write to the --
-- Free Software Foundation, Inc., 59 Temple Place - Suite 330, --
-- Boston, MA 02111-1307, USA. --
-- --
-- ----------------------------------------------------------------- --
-- ----------------------------------------------------------------- --
-- This is a translation, to the Ada programming language, of the --
-- original C test files written by <NAME> - www.libsdl.org --
-- translation made by <NAME> - www.adapower.net/~avargas --
-- ----------------------------------------------------------------- --
with Interfaces.C.Strings;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.OS_Lib;
with SDL.Types; use SDL.Types;
with SDL.Video;
with SDL.Error; use SDL.Error;
procedure Testvidinfo is
package C renames Interfaces.C;
use type C.int;
package CS renames Interfaces.C.Strings;
package Uint32_IO is new Ada.Text_IO.Modular_IO (Uint32);
use Uint32_IO;
package V renames SDL.Video;
use type V.Palette_ptr;
use type V.Rect_ptr;
use type V.Rect_ptr_ptr;
use V.Rect_ptr_PtrOps;
package Er renames SDL.Error;
info : V.VideoInfo_ConstPtr;
modes : V.Rect_ptr_ptr;
begin
if SDL.Init (SDL.INIT_VIDEO) < 0 then
Put_Line ("Couldn't initialize SDL: " & Er.Get_Error);
GNAT.OS_Lib.OS_Exit (1);
end if;
info := V.GetVideoInfo;
Put_Line ("Current display: " &
Uint8'Image (info.vfmt.BitsPerPixel) &
" bits-per-pixel");
if info.vfmt.palette = null then
Put (" Red Mask = ");
Put (info.vfmt.Rmask, Width => 12, Base => 16);
New_Line;
Put (" Green Mask = ");
Put (info.vfmt.Gmask, Width => 12, Base => 16);
New_Line;
Put (" Blue Mask = ");
Put (info.vfmt.Bmask, Width => 12, Base => 16);
New_Line;
end if;
-- Print available fullscreen video images
-- This is C style unsafe programming
-- it must change in the future.
modes := V.ListModes (null, V.FULLSCREEN);
if 0 = V.RectPP_To_Int (modes) then
Put_Line ("No available fullscreen video modes");
elsif -1 = V.RectPP_To_Int (modes) then
Put_Line ("No special fullscreen video modes");
else
Put_Line ("Fullscreen video modes");
declare
tmp_mode : V.Rect_ptr_PtrOps.Pointer;
begin
tmp_mode := Pointer (modes);
-- for i in 1 .. 3 loop
while tmp_mode.all /= null loop
Put_Line (" " &
Uint16'Image (tmp_mode.all.w) &
" x" & Uint16'Image (tmp_mode.all.h));
tmp_mode := tmp_mode + 1;
end loop;
end;
end if;
if info.wm_available /= 0 then
Put_Line ("A window manager is available");
end if;
if info.hw_available /= 0 then
Put_Line ("Hardware surfaces are available (" &
Uint32'Image (info.video_mem) &
"K video memory)");
end if;
if info.blit_hw /= 0 then
Put_Line ("Copy blits between hardware surfaces are acelerated");
end if;
if info.blit_hw_CC /= 0 then
Put_Line ("Colorkey blits between hardware surfaces are acelerated");
end if;
if info.blit_hw_A /= 0 then
Put_Line ("Alpha blits between hardware surfaces are acelerated");
end if;
if info.blit_sw /= 0 then
Put_Line ("Copy blits from software surfaces to hardware surfaces are acelerated");
end if;
if info.blit_sw_CC /= 0 then
Put_Line ("Colorkey blits from software surfaces to " &
"hardware surfaces are acelerated");
end if;
if info.blit_sw_A /= 0 then
Put_Line ("Alpha blits from software surfaces to hardware surfaces are acelerated");
end if;
if info.blit_fill /= 0 then
Put_Line ("Color fills on hardware surfaces are accelerated");
end if;
SDL.SDL_Quit;
end Testvidinfo;
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd1c03g.ada | best08618/asylo | 7 | 16089 | <reponame>best08618/asylo
-- CD1C03G.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT THE SIZE OF A DERIVED ENUMERATION TYPE IS
-- INHERITED FROM THE PARENT IF THE SIZE OF THE PARENT WAS
-- DETERMINED BY AN ENUMERATION REPRESENTATION CLAUSE.
-- HISTORY:
-- BCB 03/20/89 CHANGED EXTENSION FROM '.ADA' TO '.DEP'.
-- JET 09/17/87 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE CD1C03G IS
TYPE NORMAL_TYPE IS (RED, BLUE, GREEN, YELLOW);
TYPE PARENT_TYPE IS (RED, BLUE, GREEN, YELLOW);
FOR PARENT_TYPE USE
(RED => 256, BLUE => 257, GREEN => 258, YELLOW => 259);
TYPE DERIVED_TYPE IS NEW PARENT_TYPE;
BEGIN
TEST("CD1C03G", "CHECK THAT THE SIZE OF A DERIVED ENUMERATION " &
"TYPE IS INHERITED FROM THE PARENT IF THE " &
"SIZE OF THE PARENT WAS DETERMINED BY AN " &
"ENUMERATION REPRESENTATION CLAUSE");
IF PARENT_TYPE'SIZE = IDENT_INT (NORMAL_TYPE'SIZE) THEN
COMMENT ("PARENT_TYPE'SIZE WAS NOT AFFECTED BY THE " &
"REPRESENTATION CLAUSE");
END IF;
IF DERIVED_TYPE'SIZE /= IDENT_INT (PARENT_TYPE'SIZE) THEN
FAILED ("DERIVED_TYPE'SIZE WAS NOT INHERITED FROM " &
"PARENT_TYPE");
END IF;
RESULT;
END CD1C03G;
|
programs/oeis/027/A027649.asm | karttu/loda | 0 | 168143 | <gh_stars>0
; A027649: a(n) = 2*(3^n) - 2^n.
; 1,4,14,46,146,454,1394,4246,12866,38854,117074,352246,1058786,3180454,9549554,28665046,86027906,258149254,774578834,2323998646,6972520226,20918609254,62757924914,188277969046,564842295746,1694543664454,5083664547794,15251060752246,45753316474466,137260217858854,411781190447474,1235344645084246,3706036082736386
mov $1,1
mov $2,1
lpb $0,1
sub $0,1
mov $1,2
mul $2,2
add $1,$2
add $4,$6
trn $4,1
mov $5,$2
add $2,1
mov $3,$2
sub $3,$4
add $2,$3
mov $6,$4
mov $4,$5
add $4,3
lpe
|
Miscellaneous/ClassicalWitness.agda | Lolirofle/stuff-in-agda | 6 | 12943 | <filename>Miscellaneous/ClassicalWitness.agda
{-# OPTIONS --prop #-}
module Miscellaneous.ClassicalWitness where
open import Agda.Primitive using (Prop)
open import Data
open import Data.Either
open import Functional
import Lvl
open import Type.Dependent
open import Type
private variable ℓ ℓ₁ ℓ₂ : Lvl.Level
private variable T A B Obj : Type{ℓ}
private variable P Q R : Prop(ℓ)
private variable Pred : T → Prop(ℓ)
private variable x y z : T
empty-prop : Empty{ℓ} → P
empty-prop ()
data Proof(P : Prop(ℓ)) : Type{ℓ} where
intro : P → Proof(P)
data ⊥ : Prop(Lvl.𝟎) where
[⊥]-elim : ⊥ → P
[⊥]-elim ()
[⊥]-elim-type : ⊥ → T
[⊥]-elim-type ()
¬_ : Prop(ℓ) → Prop(ℓ)
¬ P = P → ⊥
data _∧_ (P : Prop(ℓ₁)) (Q : Prop(ℓ₂)) : Prop(ℓ₁ Lvl.⊔ ℓ₂) where
[∧]-intro : P → Q → (P ∧ Q)
data _∨_ (P : Prop(ℓ₁)) (Q : Prop(ℓ₂)) : Prop(ℓ₁ Lvl.⊔ ℓ₂) where
[∨]-introₗ : P → (P ∨ Q)
[∨]-introᵣ : Q → (P ∨ Q)
[∨]-elim : (P → R) → (Q → R) → (P ∨ Q) → R
[∨]-elim pr qr ([∨]-introₗ p) = pr p
[∨]-elim pr qr ([∨]-introᵣ q) = qr q
data ∃ {Obj : Type{ℓ₁}} (P : Obj → Prop(ℓ₂)) : Prop(ℓ₁ Lvl.⊔ ℓ₂) where
[∃]-intro : (witness : Obj) → ⦃ proof : P(witness) ⦄ → ∃(P)
[∃]-elim : (∀{x} → Pred(x) → P) → (∃ Pred) → P
[∃]-elim pr ([∃]-intro _ ⦃ p ⦄) = pr p
∃-empty-type : (∀{x : Obj} → Pred(x) → Empty{ℓ}) → ¬(∃{Obj = Obj} Pred)
∃-empty-type empty-p ep = [∃]-elim (\px → empty-prop (empty-p px)) ep
data Inhabited(T : Type{ℓ}) : Prop(Lvl.𝐒(ℓ)) where
intro : T → Inhabited(T)
Inhabited-elim : (T → P) → (Inhabited(T) → P)
Inhabited-elim f (intro obj) = f(obj)
Inhabited-empty-type : (T → Empty{ℓ}) → (¬ Inhabited(T))
Inhabited-empty-type empty-T inhab-T = Inhabited-elim (\t → empty-prop(empty-T t)) inhab-T
∃-to-Inhabited : (∃{Obj = Obj} Pred) → Inhabited(Obj)
∃-to-Inhabited = [∃]-elim (\{x} _ → intro x)
data _≡_ {T : Type{ℓ}} : T → T → Prop(Lvl.of(T)) where
refl : ∀{x} → (x ≡ x)
sym : ∀{x y : T} → (x ≡ y) → (y ≡ x)
sym refl = refl
subst : (P : T → Prop(ℓ)) → ∀{x y : T} → (x ≡ y) → (P(x) → P(y))
subst P refl = (\x → x)
data Singleton(T : Type{ℓ}) : Prop(Lvl.𝐒(ℓ)) where
intro : (x : T) → (∀{y} → (x ≡ y)) → Singleton(T)
data ∃! {Obj : Type{ℓ₁}} (P : Obj → Prop(ℓ₂)) : Prop(ℓ₁ Lvl.⊔ ℓ₂) where
[∃!]-intro : (witness : Obj) → ⦃ proof : P(witness) ⦄ → (∀{x} → P(x) → (witness ≡ x)) → ∃!(P)
[∃!]-elim : (∀{x} → Pred(x) → (∀{y} → (Pred(y)) → (x ≡ y)) → P) → (∃! Pred) → P
[∃!]-elim pr ([∃!]-intro _ ⦃ p ⦄ eq) = pr p eq
∃!-to-∃ : (∃!{Obj = Obj} Pred) → (∃{Obj = Obj} Pred)
∃!-to-∃ = [∃!]-elim (\{x} p _ → [∃]-intro x ⦃ p ⦄)
∃!-empty-type : (∀{x : Obj} → Pred(x) → Empty{ℓ}) → ¬(∃!{Obj = Obj} Pred)
∃!-empty-type empty-p ep = [∃!]-elim (\px → empty-prop (empty-p px)) ep
module WhenExcludedMiddle (excluded-middle : ∀{ℓ}(P : Prop(ℓ)) → (P ∨ (¬ P))) where
{-[¬¬]-elim-type : ((T → ⊥) → ⊥) → T
[¬¬]-elim-type {T = T} nnt with excluded-middle(T)
... | p = ?-}
{-
decidable : ∀{ℓ ℓₑ}(T : Type{ℓ}) → (T ‖ (T → Empty{ℓₑ}))
decidable(T) = {!excluded-middle!}
-}
{-
singleton-witness : Singleton(T) → T
singleton-witness x = {!!}
-}
module WhenDNEType ([¬¬]-elim-type : ∀{ℓ}{T : Type{ℓ}} → ((T → ⊥) → ⊥) → T) where
inhabited-witness : Inhabited(T) → T
inhabited-witness p = [¬¬]-elim-type (\nt → Inhabited-elim nt p)
module WhenDecidable {ℓₑ} (decidable : ∀{ℓ}(T : Type{ℓ}) → (T ‖ (T → Empty{ℓₑ}))) where
excluded-middle : ∀{ℓ}(P : Prop(ℓ)) → (P ∨ (¬ P))
excluded-middle(P) with decidable(Proof P)
... | Left (intro p) = [∨]-introₗ p
... | Right np = [∨]-introᵣ (\p → empty-prop(np(intro p)))
inhabited-witness : Inhabited(T) → T -- TODO: Are there any other ways (with weaker assumptions) of doing this?
inhabited-witness{T = T} x with decidable(T)
... | Left t = t
... | Right nt = [⊥]-elim-type (Inhabited-empty-type nt x)
∃-to-Σ : (∃{Obj = Obj} Pred) → (Σ Obj (\p → Proof(Pred p)))
∃-to-Σ {Obj = Obj}{Pred = Pred} ep with decidable(Σ Obj (\p → Proof(Pred p)))
... | Left s = s
... | Right ns = [⊥]-elim-type (∃-empty-type (\{x} px → ns (intro x (intro px))) ep)
[∃]-witness : (∃{Obj = Obj} Pred) → Obj
[∃]-witness {Obj = Obj}{Pred = Pred} ep = Σ.left (∃-to-Σ ep)
-- inhabited-witness(∃-to-Inhabited(∃!-to-∃ ep))
[∃]-proof : (ep : ∃{Obj = Obj} Pred) → Pred([∃]-witness ep)
[∃]-proof {Obj = Obj}{Pred = Pred} ep with intro p ← Σ.right (∃-to-Σ ep) = p
-- [∃!]-elim (\p eq → subst(Pred) {!eq p!} p) ep
module WhenInhabitedWitness (inhabited-witness : ∀{ℓ}{T : Type{ℓ}} → Inhabited(T) → T) where
[∨]-elim-type : (P → T) → (Q → T) → (P ∨ Q) → T
[∨]-elim-type pt qt pq = inhabited-witness([∨]-elim (\t → intro(pt t)) (\t → intro(qt t)) pq)
{-
[∃]-witness : ∀{P : T → Prop(ℓ)} → (∃ P) → T -- TODO: Not really the witness. See TODO in [∃]-proof below
[∃]-witness ep = inhabited-witness(∃-to-Inhabited ep)
[∃]-proof : ∀{P : T → Prop(ℓ)} → (ep : ∃ P) → P([∃]-witness ep) -- TODO: Will not work because the witness obtained from `inhabited-witness` (this one is from `decidable`) can obviously be different from the one provided to prove (∃ P) (this one is from `[∃]-intro`). Though, a correct witness _is_ obtainable from (∃! P) as usual in classical logic.
[∃]-proof{T = T} ep with decidable(T)
... | Left t = {!!}
... | Right nt = {!!}
-}
|
oeis/234/A234462.asm | neoneye/loda-programs | 11 | 15756 | <filename>oeis/234/A234462.asm
; A234462: a(n) = 3*binomial(8*n+3,n)/(8*n+3).
; Submitted by <NAME>(s4)
; 1,3,27,325,4488,67158,1059380,17346582,292046040,5023824887,87915626370,1560176040519,28011228029512,507874087572600,9286024289123268,171026036066072924,3169969149156895800,59085490354010508600,1106795192170066119435,20825010647037097717755,393405371935870110951960,7458747873090108482441268,141879125923381700631690120,2706906254570550503387800650,51787023242802281077586116920,993266421911519952116270039508,19095138558602289496234683896904,367888981244052318624001146286421
mov $2,$0
mul $2,6
add $2,2
add $2,$0
add $0,$2
bin $0,$2
mul $0,12
mov $1,$2
add $1,1
div $0,$1
div $0,4
|
programs/oeis/052/A052153.asm | karttu/loda | 0 | 104169 | ; A052153: Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.
; 1,9,26,54,95,151,224,316,429,565,726,914,1131,1379,1660,1976,2329,2721,3154,3630,4151,4719,5336,6004,6725,7501,8334,9226,10179,11195,12276,13424,14641,15929,17290,18726,20239,21831,23504,25260,27101,29029,31046,33154,35355,37651,40044,42536,45129,47825,50626,53534,56551,59679,62920,66276,69749,73341,77054,80890,84851,88939,93156,97504,101985,106601,111354,116246,121279,126455,131776,137244,142861,148629,154550,160626,166859,173251,179804,186520,193401,200449,207666,215054,222615,230351,238264,246356,254629,263085,271726,280554,289571,298779,308180,317776,327569,337561,347754,358150,368751,379559,390576,401804,413245,424901,436774,448866,461179,473715,486476,499464,512681,526129,539810,553726,567879,582271,596904,611780,626901,642269,657886,673754,689875,706251,722884,739776,756929,774345,792026,809974,828191,846679,865440,884476,903789,923381,943254,963410,983851,1004579,1025596,1046904,1068505,1090401,1112594,1135086,1157879,1180975,1204376,1228084,1252101,1276429,1301070,1326026,1351299,1376891,1402804,1429040,1455601,1482489,1509706,1537254,1565135,1593351,1621904,1650796,1680029,1709605,1739526,1769794,1800411,1831379,1862700,1894376,1926409,1958801,1991554,2024670,2058151,2091999,2126216,2160804,2195765,2231101,2266814,2302906,2339379,2376235,2413476,2451104,2489121,2527529,2566330,2605526,2645119,2685111,2725504,2766300,2807501,2849109,2891126,2933554,2976395,3019651,3063324,3107416,3151929,3196865,3242226,3288014,3334231,3380879,3427960,3475476,3523429,3571821,3620654,3669930,3719651,3769819,3820436,3871504,3923025,3975001,4027434,4080326,4133679,4187495,4241776,4296524,4351741,4407429,4463590,4520226,4577339,4634931,4693004,4751560,4810601,4870129,4930146,4990654,5051655,5113151,5175144,5237636,5300629,5364125
add $0,1
lpb $0,1
add $2,$0
sub $0,1
add $1,$2
add $2,4
lpe
|
programs/test_ST.asm | tofu13/pyc64 | 0 | 91377 | * = $C000
LDA #$01
STA $0000
LDX #$02
TAY
STX $0001
STY $0002
INX
INX
STA $01,X
STA $01,Y
STA ($01,X)
STA ($02),Y
BRK
|
oeis/105/A105020.asm | neoneye/loda-programs | 11 | 88223 | ; A105020: Array read by antidiagonals: row n (n >= 0) contains the numbers m^2-n^2, m >= n+1.
; Submitted by <NAME>
; 1,3,4,5,8,9,7,12,15,16,9,16,21,24,25,11,20,27,32,35,36,13,24,33,40,45,48,49,15,28,39,48,55,60,63,64,17,32,45,56,65,72,77,80,81,19,36,51,64,75,84,91,96,99,100,21,40,57,72,85,96,105,112,117,120,121,23,44,63,80
lpb $0
add $1,1
sub $0,$1
mov $2,$1
mul $2,2
sub $2,$0
lpe
add $0,1
mul $2,$0
add $2,$0
mov $0,$2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.