max_stars_repo_path stringlengths 4 261 | max_stars_repo_name stringlengths 6 106 | max_stars_count int64 0 38.8k | id stringlengths 1 6 | text stringlengths 7 1.05M |
|---|---|---|---|---|
source/tasking/machine-w64-mingw32/s-nattas.ads | ytomino/drake | 33 | 2903 | <filename>source/tasking/machine-w64-mingw32/s-nattas.ads
pragma License (Unrestricted);
-- implementation unit specialized for Windows
with System.Synchronous_Objects;
with C.winbase;
with C.windef;
with C.winnt;
package System.Native_Tasks is
pragma Preelaborate;
-- thread
subtype Handle_Type is C.winnt.HANDLE;
function Current return Handle_Type
renames C.winbase.GetCurrentThread;
subtype Parameter_Type is C.windef.LPVOID;
subtype Result_Type is C.windef.DWORD;
subtype Thread_Body_Type is C.winbase.PTHREAD_START_ROUTINE;
pragma Convention_Identifier (Thread_Body_CC, WINAPI);
-- WINAPI is stdcall convention on 32bit, or C convention on 64bit.
procedure Create (
Handle : aliased out Handle_Type;
Parameter : Parameter_Type;
Thread_Body : Thread_Body_Type;
Error : out Boolean);
procedure Join (
Handle : Handle_Type; -- of target thread
Current_Abort_Event : access Synchronous_Objects.Event;
Result : aliased out Result_Type;
Error : out Boolean);
procedure Detach (
Handle : in out Handle_Type;
Error : out Boolean);
-- stack
function Info_Block (Handle : Handle_Type) return C.winnt.struct_TEB_ptr;
-- signals
type Abort_Handler is access procedure;
pragma Favor_Top_Level (Abort_Handler);
procedure Install_Abort_Handler (Handler : Abort_Handler);
procedure Uninstall_Abort_Handler;
pragma Inline (Install_Abort_Handler);
pragma Inline (Uninstall_Abort_Handler);
procedure Send_Abort_Signal (
Handle : Handle_Type;
Abort_Event : in out Synchronous_Objects.Event;
Error : out Boolean);
procedure Resend_Abort_Signal (Handle : Handle_Type; Error : out Boolean) is
null;
pragma Inline (Resend_Abort_Signal);
-- [gcc-7] can not skip calling null procedure
procedure Block_Abort_Signal (Abort_Event : Synchronous_Objects.Event);
procedure Unblock_Abort_Signal is null;
pragma Inline (Unblock_Abort_Signal);
-- [gcc-7] can not skip calling null procedure
-- scheduling
procedure Yield;
end System.Native_Tasks;
|
examples/asm-64/float.asm | patrickf2000/upl | 0 | 241460 | .intel_syntax noprefix
.data
flt_1: .long 1067299373
flt_2: .long 1080255578
flt_3: .long 1078875652
STR_1: .string "Add: %f\n"
flt_4: .long 1067299373
flt_5: .long 1080255578
flt_6: .long 1078875652
STR_2: .string "Sub: %f\n"
flt_7: .long 1067299373
flt_8: .long 1080255578
flt_9: .long 1078875652
STR_3: .string "Mul: %f\n"
flt_10: .long 1067299373
flt_11: .long 1080255578
flt_12: .long 1078875652
STR_4: .string "Div: %f\n"
.bss
.text
.extern puts
.extern printf
.extern exit
.extern fflush
.extern input_int
.extern print_int
.global add_test
.global sub_test
.global mul_test
.global div_test
.global main
add_test:
push rbp
mov rbp, rsp
sub rsp, 48
movss xmm0, [flt_1]
movss [rbp-8], xmm0
movss xmm0, [flt_2]
movss [rbp-12], xmm0
movss xmm0, [rbp-8]
addss xmm0, [rbp-12]
movss [rbp-16], xmm0
movss xmm0, [rbp-16]
addss xmm0, [flt_3]
movss [rbp-16], xmm0
mov edi, OFFSET FLAT:STR_1
movss xmm0, [rbp-16]
cvtss2sd xmm0, xmm0
call printf
leave
ret
sub_test:
push rbp
mov rbp, rsp
sub rsp, 48
movss xmm0, [flt_4]
movss [rbp-8], xmm0
movss xmm0, [flt_5]
movss [rbp-12], xmm0
movss xmm0, [rbp-8]
subss xmm0, [rbp-12]
movss [rbp-16], xmm0
movss xmm0, [rbp-16]
addss xmm0, [flt_6]
movss [rbp-16], xmm0
mov edi, OFFSET FLAT:STR_2
movss xmm0, [rbp-16]
cvtss2sd xmm0, xmm0
call printf
leave
ret
mul_test:
push rbp
mov rbp, rsp
sub rsp, 48
movss xmm0, [flt_7]
movss [rbp-8], xmm0
movss xmm0, [flt_8]
movss [rbp-12], xmm0
movss xmm0, [rbp-8]
mulss xmm0, [rbp-12]
movss [rbp-16], xmm0
movss xmm0, [rbp-16]
addss xmm0, [flt_9]
movss [rbp-16], xmm0
mov edi, OFFSET FLAT:STR_3
movss xmm0, [rbp-16]
cvtss2sd xmm0, xmm0
call printf
leave
ret
div_test:
push rbp
mov rbp, rsp
sub rsp, 48
movss xmm0, [flt_10]
movss [rbp-8], xmm0
movss xmm0, [flt_11]
movss [rbp-12], xmm0
movss xmm0, [rbp-8]
divss xmm0, [rbp-12]
movss [rbp-16], xmm0
movss xmm0, [rbp-16]
addss xmm0, [flt_12]
movss [rbp-16], xmm0
mov edi, OFFSET FLAT:STR_4
movss xmm0, [rbp-16]
cvtss2sd xmm0, xmm0
call printf
leave
ret
main:
push rbp
mov rbp, rsp
sub rsp, 48
call add_test
call sub_test
call mul_test
call div_test
mov edi, 0
call fflush
leave
ret
|
src/frontend/Experimental_Ada_ROSE_Connection/parser/lal_adapter/source/lal_adapter.adb | ouankou/rose | 488 | 25843 | <gh_stars>100-1000
with Ada.Characters.Conversions;
package body Lal_Adapter is
package Acc renames Ada.Characters.Conversions;
-----------
-- PRIVATE:
-----------
function To_String (Item : in Wide_String) return String is
(Acc.To_String (Item, Substitute => ' '));
-----------
-- PRIVATE:
-----------
function To_String (Item : in Wide_Wide_String) return String is
(Acc.To_String (Item, Substitute => ' '));
-----------
-- PRIVATE:
-----------
function To_Quoted_String (Item : in String) return String is
('"' & Item & '"');
-----------
-- PRIVATE:
-----------
function To_Chars_Ptr (Item : in Wide_String) return Interfaces.C.Strings.chars_ptr is
(Interfaces.C.Strings.New_String (To_String(Item)));
-----------
-- PRIVATE:
-----------
function Spaceless_Image (Item : in Natural) return String is
Leading_Space_Image : constant String := Item'Image;
begin
return Leading_Space_Image (2 .. Leading_Space_Image'Last);
end;
-----------
-- PRIVATE:
-----------
function To_String
(Id : in IC.int;
Kind : in ID_Kind)
return String
is
function Add_Prefix_To (Item : in String) return String is
begin
case Kind is
when Unit_ID_Kind =>
return "Unit_" & Item;
when Element_ID_Kind =>
return "LAL_Node_" & Item;
end case;
end Add_Prefix_To;
use type IC.int;
begin
if anhS.Is_Empty (ID) then
return "(none)";
elsif not anhS.Is_Valid (ID) then
return "***Invalid ID***";
else
return Add_Prefix_To (Spaceless_Image (Natural (Id)));
end if;
exception
when Constraint_Error =>
raise Program_Error with "Id =>" & Id'Image & ", Kind => " & Kind'Image;
end To_String;
-----------
-- PRIVATE:
-----------
function To_Dot_ID_Type
(Id : in IC.int;
Kind : in ID_Kind)
return Dot.ID_Type is
(Dot.To_ID_Type (To_String (Id, Kind)));
------------
-- EXPORTED:
------------
procedure Add_To_Dot_Label
(Dot_Label : in out Dot.HTML_Like_Labels.Class;
Outputs : in Output_Accesses_Record;
Value : in String) is
begin
Dot_Label.Add_3_Col_Cell(Value);
Outputs.Text.Put_Indented_Line (Value);
end;
------------
-- EXPORTED:
------------
procedure Add_To_Dot_Label
(Dot_Label : in out Dot.HTML_Like_Labels.Class;
Outputs : in Output_Accesses_Record;
Name : in String;
Value : in String) is
begin
Dot_Label.Add_Eq_Row (L => Name, R => Value);
Outputs.Text.Put_Indented_Line (Name & " => " & Value);
end;
------------
-- EXPORTED:
------------
procedure Add_To_Dot_Label
(Dot_Label : in out Dot.HTML_Like_Labels.Class;
Outputs : in Output_Accesses_Record;
Name : in String;
Value : in Boolean) is
begin
if Value then
declare
Value_String : constant String := Value'Image;
begin
Dot_Label.Add_Eq_Row (L => Name, R => Value_String);
Outputs.Text.Put_Indented_Line (Name & " => " & Value_String);
end;
end if;
end;
------------
-- EXPORTED:
------------
procedure Add_Dot_Edge
(Outputs : in Output_Accesses_Record;
From : in IC.int;
From_Kind : in ID_Kind;
To : in IC.int;
To_Kind : in ID_Kind;
Label : in String)
is
Edge_Stmt : Dot.Edges.Stmts.Class; -- Initialized
begin
if not anhS.Is_Empty (To) then
Edge_Stmt.LHS.Node_Id.ID := To_Dot_ID_Type (From, From_Kind);
Edge_Stmt.RHS.Node_Id.ID := To_Dot_ID_Type (To, To_Kind);
Edge_Stmt.Attr_List.Add_Assign_To_First_Attr
(Name => "label",
Value => Label);
Outputs.Graph.Append_Stmt (new Dot.Edges.Stmts.Class'(Edge_Stmt));
end if;
end Add_Dot_Edge;
end Lal_Adapter;
|
oeis/164/A164096.asm | neoneye/loda-programs | 11 | 11584 | ; A164096: Partial sums of A164095.
; 5,11,21,33,53,77,117,165,245,341,501,693,1013,1397,2037,2805,4085,5621,8181,11253,16373,22517,32757,45045,65525,90101,131061,180213,262133,360437,524277,720885,1048565,1441781,2097141,2883573,4194293,5767157,8388597,11534325,16777205,23068661,33554421,46137333,67108853,92274677,134217717,184549365,268435445,369098741,536870901,738197493,1073741813,1476394997,2147483637,2952790005,4294967285,5905580021,8589934581,11811160053,17179869173,23622320117,34359738357,47244640245,68719476725,94489280501
lpb $0
mov $2,$0
sub $0,1
add $1,2
gcd $2,2
mul $1,$2
add $1,1
lpe
mul $1,2
add $1,5
mov $0,$1
|
libsrc/stdio_new/file/stream-in/stdio_in_capi.asm | andydansby/z88dk-mk2 | 1 | 15378 | ; stdio_in_I, read IPv4 address in dotted notation
; 09.2008 aralbrec
XLIB stdio_in_capi
LIB stdio_incommon1, stdio_inexit, stdio_getchar
LIB stdio_ungetchar, stdio_in_i, htonl
XREF LIBDISP_STDIO_IN_I
; input %I parameter, read IPv4 address in dotted notation
; * accepts octets in octal, hex or decimal
; * 'a' indicates address should be stored in network byte order (big endian)
;
; enter : ix = FILE *
; b = width
; c = flags [000a*WL0]
; hl = & parameter list
; bc' = total num chars read from stream thus far
; de' = number of conversions done thus far
; on exit : bc' = total num chars read from stream thus far
; de' = number of conversions done thus far
; hl = & parameter list
; carry set if EOF reached
;
; MUST NOT ALTER HL' FOR SSCANF FAMILY
.stdio_in_capi
call stdio_incommon1 ; leading ws, sign, long *
ret c
bit 0,c ; return error if a sign was present
jp nz, stdio_inexit
push hl ; save & parameter list
push de ; save long *
push bc ; save real flags
; ix = FILE *
; a = next char from stream
ld c,8 ; assignment suppression on
push hl ; dummy MSW of IPv4 address
call getoctet2
ld h,e ; h = first octet
call consumedot
call getoctet
ld l,e ; l = second octet
call consumedot
ex (sp),hl ; save MSW of IPv4 address
call getoctet
ld h,e ; h = third octet
call consumedot
call getoctet
ld l,e ; l = fourth octet
; carry reset here
pop de ; dehl = IPv4 address
pop bc ; c = flags [000a*WL0]
bit 3,c ; assignment suppression?
jr nz, suppress
bit 4,c ; 'a' flag = store in network order
call nz, htonl
ex de,hl ; hlde = IPv4 address
ex (sp),hl ; hl = long *, stack = MSW of IPv4 address
ld (hl),e ; write LSW of IPv4 address into long*
inc hl
ld (hl),d
inc hl
pop de ; de = MSW of IPv4 address
ld (hl),e ; write MSW of IPv4 address into long*
inc hl
ld (hl),d
exx
inc de ; increase num conversions done
exx
pop hl ; hl = & parameter list
ret
.suppress
pop de
pop hl
ret
.getoctet
call stdio_getchar
jr c, error
.getoctet2
call stdio_in_i + LIBDISP_STDIO_IN_I
jr c, error
inc d ; octet de should be < 256
dec d
ret z
.error
pop bc ; ret address
pop bc ; MSW of IPv4 address
pop bc ; flags
pop de ; long *
pop hl ; & parameter list
scf
ret
.consumedot
call stdio_getchar
jr c, error
cp '.'
ret z
call stdio_ungetchar
jp error
|
src/glfw/v3/glfw-input-mouse.ads | Roldak/OpenGLAda | 79 | 24845 | -- part of OpenGLAda, (c) 2017 <NAME>
-- released under the terms of the MIT license, see the file "COPYING"
package Glfw.Input.Mouse is
type Button is new Interfaces.C.int range 0 .. 7;
type Enter_Action is (Leaving, Entering);
type Cursor_Mode is (Normal, Hidden, Disabled);
Left_Button : constant := 0;
Right_Button : constant := 1;
Middle_Button : constant := 2;
subtype Coordinate is Interfaces.C.double;
subtype Scroll_Offset is Interfaces.C.double;
private
for Button'Size use Interfaces.C.int'Size;
for Enter_Action use (Leaving => 0,
Entering => 1);
for Enter_Action'Size use C.int'Size;
for Cursor_Mode use (Normal => 16#34001#,
Hidden => 16#34002#,
Disabled => 16#34003#);
for Cursor_Mode'Size use Interfaces.C.int'Size;
end Glfw.Input.Mouse;
|
Transynther/x86/_processed/NONE/_ht_zr_/i9-9900K_12_0xca.log_77_1844.asm | ljhsiun2/medusa | 9 | 160948 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r8
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_WT_ht+0x18521, %rsi
lea addresses_UC_ht+0xaf09, %rdi
nop
nop
nop
nop
sub $34471, %r8
mov $91, %rcx
rep movsq
nop
nop
nop
nop
sub %rcx, %rcx
lea addresses_A_ht+0x7d4d, %rsi
lea addresses_normal_ht+0x205e, %rdi
nop
nop
nop
nop
sub $14485, %rbp
mov $77, %rcx
rep movsb
nop
nop
xor %r8, %r8
lea addresses_D_ht+0x1aca1, %rbx
nop
sub $58431, %r11
mov (%rbx), %rdi
nop
add %rsi, %rsi
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %r8
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %rbx
push %rdi
push %rsi
// Faulty Load
lea addresses_WT+0x156a1, %rsi
add $44136, %rbx
vmovups (%rsi), %ymm2
vextracti128 $0, %ymm2, %xmm2
vpextrq $1, %xmm2, %r11
lea oracles, %rsi
and $0xff, %r11
shlq $12, %r11
mov (%rsi,%r11,1), %r11
pop %rsi
pop %rdi
pop %rbx
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_WT', 'same': False, 'AVXalign': False, 'congruent': 0}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'size': 32, 'NT': False, 'type': 'addresses_WT', 'same': True, 'AVXalign': False, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_WT_ht', 'congruent': 6}, 'dst': {'same': False, 'type': 'addresses_UC_ht', 'congruent': 2}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_A_ht', 'congruent': 0}, 'dst': {'same': False, 'type': 'addresses_normal_ht', 'congruent': 0}}
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_D_ht', 'same': False, 'AVXalign': False, 'congruent': 8}}
{'45': 46, '49': 19, '00': 12}
45 45 45 45 45 45 45 49 45 49 45 45 45 45 49 45 45 00 49 45 45 45 45 45 45 00 00 45 00 45 00 49 45 45 45 49 49 45 49 49 49 00 45 00 45 00 45 49 45 45 45 00 49 49 45 45 45 45 45 45 45 49 45 45 45 00 45 45 49 00 49 49 49 45 45 49 00
*/
|
programs/oeis/004/A004657.asm | neoneye/loda | 22 | 242125 | <reponame>neoneye/loda<gh_stars>10-100
; A004657: Expansion of g.f.: (1+x^3)*(1+x^4)/((1-x)*(1-x^2)^2*(1-x^4)).
; 1,1,3,4,9,11,19,24,37,45,63,76,101,119,151,176,217,249,299,340,401,451,523,584,669,741,839,924,1037,1135,1263,1376,1521,1649,1811,1956,2137,2299,2499,2680,2901,3101,3343,3564,3829,4071,4359,4624,4937,5225,5563,5876,6241,6579,6971,7336,7757,8149,8599,9020,9501,9951,10463,10944,11489,12001,12579,13124,13737,14315,14963,15576,16261,16909,17631,18316,19077,19799,20599,21360,22201,23001,23883,24724,25649,26531,27499,28424,29437,30405,31463,32476,33581,34639,35791,36896,38097,39249,40499,41700
mov $2,$0
add $2,1
mov $4,$0
lpb $2
mov $0,$4
sub $2,1
sub $0,$2
mov $6,$0
div $0,2
sub $6,$0
mul $0,2
sub $0,$6
add $0,1
mov $3,2
sub $3,$0
sub $3,2
pow $3,2
add $3,1
mov $5,$3
div $5,2
add $1,$5
lpe
mov $0,$1
|
src/server/openapi-servers.adb | mgrojo/swagger-ada | 0 | 19746 | -----------------------------------------------------------------------
-- openapi-server -- Rest server support
-- Copyright (C) 2017, 2020, 2022 <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.Readers;
with Util.Serialize.IO.JSON;
with Util.Serialize.IO.Form;
with Security;
with Servlet.Streams;
with Servlet.Responses;
package body OpenAPI.Servers is
use type Servlet.Streams.Input_Stream_Access;
-- ------------------------------
-- Get a request parameter defined in the URI path.
-- ------------------------------
procedure Get_Path_Parameter (Req : in Request'Class;
Pos : in Positive;
Value : out UString) is
begin
Value := To_UString (Req.Get_Path_Parameter (Pos));
end Get_Path_Parameter;
-- ------------------------------
-- Get a request parameter defined in the URI path.
-- ------------------------------
procedure Get_Path_Parameter (Req : in Request'Class;
Pos : in Positive;
Value : out Long) is
V : constant String := Req.Get_Path_Parameter (Pos);
begin
Value := Long'Value (V);
end Get_Path_Parameter;
-- ------------------------------
-- Get a request parameter from the query string.
-- ------------------------------
procedure Get_Query_Parameter (Req : in Request'Class;
Name : in String;
Value : out UString) is
begin
Value := To_UString (Req.Get_Parameter (Name));
end Get_Query_Parameter;
procedure Get_Query_Parameter (Req : in Request'Class;
Name : in String;
Value : out Nullable_UString) is
V : constant String := Req.Get_Parameter (Name);
begin
Value.Value := To_UString (V);
Value.Is_Null := V'Length = 0;
end Get_Query_Parameter;
-- ------------------------------
-- Get a request parameter from the query as boolean.
-- ------------------------------
procedure Get_Query_Parameter (Req : in Request'Class;
Name : in String;
Value : out Boolean) is
begin
Value := Boolean'Value (Req.Get_Parameter (Name));
end Get_Query_Parameter;
procedure Get_Query_Parameter (Req : in Request'Class;
Name : in String;
Value : out Nullable_Boolean) is
V : constant String := Req.Get_Parameter (Name);
begin
Value.Is_Null := V'Length = 0;
if Value.Is_Null then
Value.Value := False;
else
Value.Value := Boolean'Value (V);
end if;
end Get_Query_Parameter;
-- Get a request parameter from the query string.
procedure Get_Query_Parameter (Req : in Request'Class;
Name : in String;
Value : out UString_Vectors.Vector) is
begin
Value.Append (Req.Get_Parameter (Name));
end Get_Query_Parameter;
procedure Get_Query_Parameter (Req : in Request'Class;
Name : in String;
Value : out Nullable_UString_Vectors.Vector) is
Param : constant String := Req.Get_Parameter (Name);
begin
if Param'Length > 0 then
Value.Append ((Is_Null => False, Value => To_UString (Param)));
end if;
end Get_Query_Parameter;
-- ------------------------------
-- Read the request body and get a value object tree.
-- ------------------------------
procedure Read (Req : in Request'Class;
Value : out Value_Type) is
Stream : constant Servlet.Streams.Input_Stream_Access := Req.Get_Input_Stream;
Parser : Util.Serialize.IO.JSON.Parser;
Mapper : Util.Beans.Objects.Readers.Reader;
begin
if Stream = null then
Value := Util.Beans.Objects.Null_Object;
else
Parser.Parse (Stream.all, Mapper);
Value := Mapper.Get_Root;
end if;
end Read;
procedure Read (Context : in out Context_Type) is
Stream : constant Servlet.Streams.Input_Stream_Access := Context.Req.Get_Input_Stream;
Parser : Util.Serialize.IO.Form.Parser;
Mapper : Util.Beans.Objects.Readers.Reader;
begin
if Stream = null then
Context.Params := Util.Beans.Objects.Null_Object;
else
Parser.Parse (Stream.all, Mapper);
Context.Params := Mapper.Get_Root;
end if;
Context.Use_Map := True;
end Read;
procedure Initialize (Context : in out Context_Type;
Req : in out Request'Class;
Reply : in out Response'Class;
Stream : in out Output_Stream'Class) is
begin
Context.Req := Req'Unchecked_Access;
Context.Reply := Reply'Unchecked_Access;
Context.Stream := Stream'Unchecked_Access;
if Req.Get_Method = "PUT"
and then Req.Get_Content_Type = "application/x-www-form-urlencoded"
then
Context.Read;
end if;
end Initialize;
function Get_Parameter (Req : in out Context_Type;
Name : in String) return String is
begin
if Req.Use_Map then
return Util.Beans.Objects.To_String (Util.Beans.Objects.Get_Value (Req.Params, Name));
else
return Req.Req.Get_Parameter (Name);
end if;
end Get_Parameter;
-- ------------------------------
-- Get a request parameter passed in the form.
-- ------------------------------
procedure Get_Parameter (Req : in out Context_Type;
Name : in String;
Value : out Long) is
V : constant String := Req.Get_Parameter (Name);
begin
Value := Long'Value (V);
end Get_Parameter;
-- ------------------------------
-- Get a request parameter passed in the form.
-- ------------------------------
procedure Get_Parameter (Req : in out Context_Type;
Name : in String;
Value : out Integer) is
V : constant String := Req.Get_Parameter (Name);
begin
Value := Integer'Value (V);
end Get_Parameter;
-- ------------------------------
-- Get a request parameter passed in the form.
-- ------------------------------
procedure Get_Parameter (Req : in out Context_Type;
Name : in String;
Value : out UString) is
begin
Value := To_UString (Req.Get_Parameter (Name));
end Get_Parameter;
procedure Get_Parameter (Req : in out Context_Type;
Name : in String;
Value : out Nullable_UString) is
begin
if Req.Use_Map then
declare
Item : constant Util.Beans.Objects.Object
:= Util.Beans.Objects.Get_Value (Req.Params, Name);
begin
Value.Is_Null := Util.Beans.Objects.Is_Null (Item);
Value.Value := Util.Beans.Objects.To_Unbounded_String (Item);
end;
else
declare
Param : constant String := Req.Get_Parameter (Name);
begin
Value.Value := To_UString (Param);
Value.Is_Null := Param'Length = 0;
end;
end if;
end Get_Parameter;
-- ------------------------------
-- Get a request parameter passed in the form.
-- ------------------------------
procedure Get_Parameter (Req : in out Context_Type;
Name : in String;
Value : out Boolean) is
V : constant String := Req.Get_Parameter (Name);
begin
Value := Boolean'Value (V);
end Get_Parameter;
-- ------------------------------
-- Set the response error code with a message to return.
-- ------------------------------
procedure Set_Error (Context : in out Context_Type;
Code : in Natural;
Message : in String) is
begin
Context.Reply.Set_Status (Code);
Context.Stream.Start_Document;
Context.Stream.Start_Entity ("");
Context.Stream.Write_Attribute ("code", Code);
Context.Stream.Write_Attribute ("message", Message);
Context.Stream.End_Entity ("");
Context.Stream.End_Document;
end Set_Error;
-- ------------------------------
-- Set the HTTP status in the response.
-- ------------------------------
procedure Set_Status (Context : in out Context_Type;
Code : in Natural) is
begin
Context.Reply.Set_Status (Code);
end Set_Status;
-- ------------------------------
-- Get the HTTP status that will be sent in the response.
-- ------------------------------
function Get_Status (Context : in Context_Type) return Natural is
begin
return Context.Reply.Get_Status;
end Get_Status;
-- ------------------------------
-- Send a Location: header in the response.
-- ------------------------------
procedure Set_Location (Context : in out Context_Type;
URL : in String) is
begin
Context.Reply.Add_Header (Name => "Location", Value => URL);
end Set_Location;
-- ------------------------------
-- Returns True if the API request is authenticated.
-- ------------------------------
function Is_Authenticated (Context : in Context_Type) return Boolean is
use type Security.Principal_Access;
User : constant Security.Principal_Access := Context.Req.Get_User_Principal;
begin
return User /= null;
end Is_Authenticated;
-- ------------------------------
-- Returns True if the client doing the request has the given permission.
-- ------------------------------
function Has_Permission (Context : in Context_Type;
Permission : in Security.Permissions.Permission_Index)
return Boolean is
pragma Unreferenced (Permission);
use type Security.Principal_Access;
User : constant Security.Principal_Access := Context.Req.Get_User_Principal;
begin
if User = null then
return False;
end if;
return True;
end Has_Permission;
end OpenAPI.Servers;
|
Project-Einstein/src/E-Assembly/src/labs/led1.nasm | FelixLuciano/Elements-of-Computing-Systems | 0 | 170726 | ; Arquivo: led1.nasm
; Curso: Elementos de Sistemas
; Criado por: <NAME>
; Data: 4/2020
;
; Faça o primeiro LED acender
; OFF OFF OFF OFF OFF OFF OFF OFF ON
leaw $21184, %A
movw $1, (%A)
|
Lista Assembly/questao5.asm | joaovictor42/Arquitetura-de-Computadores | 0 | 19624 | extern scanf, printf
global main
section .data
msg db "%d", 0AH, 0H
section .text
main:
mov ecx, 1000; Inicio
repetir:
xor edx, edx; Dividendo
mov eax, ecx; Dividendo
mov ebx, 11; Divisor
div ebx
cmp edx, 5
je imprimir
avalicao:
inc ecx
cmp ecx, 2000
jl repetir
fim:
mov eax, 1
xor ecx, ecx
int 80h
imprimir:
push ecx
push ecx
push msg
call printf
add esp, 8
pop ecx
jmp avalicao
|
BLAS.agda | ashinkarov/agda-array | 6 | 15277 | <gh_stars>1-10
{-# OPTIONS --rewriting #-}
open import Array
open import Array.APL using (reduce-1d)
open import Data.Nat as N
open import Data.Nat.Properties
open import Data.Vec as V hiding (_>>=_; _++_)
open import Data.Fin using (Fin; zero; suc; raise; inject+; #_)
open import Relation.Binary.PropositionalEquality
open import Data.Product
open import Function
open import Relation.Nullary
open import Relation.Nullary.Decidable
sum-1d : ∀ {n} → Ar ℕ 1 (n ∷ []) → ℕ
sum-1d v = reduce-1d v _+_ 0
zipw : ∀ {a}{X : Set a}{d s} → (X → X → X) → Ar X d s → Ar X d s → Ar X d s
zipw _⊕_ (imap a) (imap b) = imap λ iv → a iv ⊕ b iv
hd : ∀ {n s : ℕ}{ss : Vec ℕ n} → Ix (suc n) (s ∷ ss) → Fin s
hd ix = ix-lookup ix zero
vec-mat-mul : ∀ {n m} → Ar ℕ 2 (m ∷ n ∷ []) → Ar ℕ 1 (n ∷ []) → Ar ℕ 1 (m ∷ [])
vec-mat-mul (imap a) b = imap λ iv → sum-1d (zipw _*_ (imap λ jv → a (iv ix++ jv)) b)
twice : ∀ {n} → (M : Ar ℕ 2 (n ∷ n ∷ [])) → (V : Ar ℕ 1 (n ∷ [])) → Ar ℕ 1 (n ∷ [])
twice m v = vec-mat-mul m (vec-mat-mul m v)
sum-2d : ∀ {m n} → Ar ℕ 2 (m ∷ n ∷ []) → ℕ
sum-2d (imap a) = sum-1d (imap λ i → sum-1d (imap λ j → a $ i ix++ j))
_+'_ : ∀ {m n} → Fin (1 + m) → Fin (1 + n) → Fin (1 + m + n)
_+'_ {m} {n} zero j = subst Fin (+-suc m n) (raise m j)
_+'_ {suc m} {n} (suc i) j = suc (i +' j)
_+''_ : ∀ {m n} → Fin m → Fin n → Fin (m + n ∸ 1)
_+''_ {suc m} {suc n} zero j = raise m j
_+''_ {suc (suc m)} {suc n} (suc i) j = suc (i +'' j)
_ix+2_ : ∀ {m n k p} → Ix 2 (m ∷ n ∷ []) → Ix 2 (k ∷ p ∷ []) → Ix 2 (m + k ∸ 1 ∷ n + p ∸ 1 ∷ [])
(x₁ ∷ x₂ ∷ []) ix+2 (y₁ ∷ y₂ ∷ []) = x₁ +'' y₁ ∷ (x₂ +'' y₂) ∷ []
conv-2 : ∀ {m n k p} → Ar ℕ 2 (m + k ∷ n + p ∷ []) → Ar ℕ 2 (k ∷ p ∷ []) → Ar ℕ 2 (1 + m ∷ 1 + n ∷ [])
conv-2 {k = k} {p} (imap a) (imap w) = imap (λ iv → sum-2d {m = k} {n = p} (imap λ ov → w ov * a (iv ix+2 ov)))
iterate-1 : ∀ {a}{X : Set a}{n} → (Fin n → X) → (X → X → X) → X → X
iterate-1 {n = zero} f _⊕_ neut = neut
iterate-1 {n = suc n} f _⊕_ neut = f zero ⊕ iterate-1 (f ∘ suc) _⊕_ neut
red-iter : ∀ {a}{X : Set a}{n} → (f : Ix 1 (n ∷ []) → X) → (op : X → X → X) → (neut : X)
→ reduce-1d (imap f) op neut ≡ iterate-1 (λ i → f (i ∷ [])) op neut
red-iter {n = zero} f op neut = refl
red-iter {n = suc n} f op neut = cong (λ x → op _ x) (red-iter (λ iv → f (suc (hd iv) ∷ [])) op neut)
{-# BUILTIN REWRITE _≡_ #-}
{-# REWRITE red-iter #-}
thm : ∀ {n} → (m : Ar ℕ 2 (n ∷ n ∷ []))
→ (v : Ar _ _ (n ∷ []))
→ ∀ iv → unimap (twice m v) iv ≡ {!!}
thm (imap m) (imap v) (i ∷ []) = {!!}
{-
-- Reflection business
open import Reflection
open import Data.List hiding (_++_)
open import Data.Bool
open import Data.Maybe hiding (_>>=_)
open import Data.Unit
defToTerm : Name → Definition → List (Arg Term) → Term
defToTerm _ (function cs) as = pat-lam cs as
defToTerm _ (constructor′ d) as = con d as
defToTerm _ _ _ = unknown
derefImmediate : Term → TC Term
derefImmediate (def f args) = getDefinition f >>= λ f' → return (defToTerm f f' args)
derefImmediate x = return x
--reflectTerm : TC Term
--reflectTerm = (getType (quote f)) >>= λ ty → quoteTC f >>= derefImmediate >>= λ x → checkType x ty
macro
reflect : Term → Term → TC ⊤
reflect f a = derefImmediate f -- (quoteTerm f)
>>= quoteTC >>= unify a
reflect-ty : Name → Type → TC ⊤
reflect-ty f a = getType f >>= quoteTC >>= unify a
r : Term
r = reflect twice
open import Data.String
open import Data.Nat.Show as Ns
open import Data.List as L using (List)
data Prog : Set where
ok : String → Prog
error : String → Prog
record State : Set where
inductive
constructor st
field
vars : List String
defs : List $ String × String
cons : List (String × ((List $ Arg Term) → Prog))
var-lkup : State → ℕ → Prog
var-lkup s n = hlpr (State.vars s) n
where hlpr : _ → _ → _
hlpr [] n = error $ "Variable not found"
hlpr (x ∷ l) zero = ok x
hlpr (x ∷ l) (suc n) = hlpr l n
def-lkup : State → String → Prog
def-lkup ss s = hlpr (State.defs ss) s
where hlpr : _ → _ → _
hlpr [] s = error $ "Definition `" ++ s ++ "' not found"
hlpr ((k , v) ∷ dfs) s with k ≈? s
... | yes p = ok v
... | no ¬p = hlpr dfs s
cons-cont : State → String → List (Arg Term) → Prog
cons-cont ss s args = {!!} {-hlpr (State.cons ss) s args
where hlpr : _ → _ → _ → _
hlpr [] s _ = error $ "Constructor `" ++ s ++ "' not found"
hlpr ((k , f) ∷ cs) s args with k ≈? s
... | yes p = f args
... | no ¬p = hlpr cs s args
-}
infixl 5 _#_
_#_ : Prog → Prog → Prog
ok x # ok y = ok $ x ++ y
error x # _ = error x
_ # error y = error y
l→s : List String → String
l→s [] = ""
l→s (x ∷ l) = x ++ " " ++ l→s l
comp-arglist-mask : State → List (Arg Term) → List Bool → Prog
comp-arglist : State → List (Arg Term) → Prog
comp-clauses : State → List Clause → Prog
_at_ : ∀ {a}{X : Set a} → List X → ℕ → Maybe X
[] at idx = nothing
(x ∷ a) at zero = just x
(x ∷ a) at suc idx = a at idx
unmaybe : ∀ {a}{X : Set a} → List (Maybe X) → Maybe (List X)
unmaybe [] = just []
unmaybe (nothing ∷ xs) = nothing
unmaybe (just x ∷ xs) with unmaybe xs
unmaybe (just x ∷ xs) | nothing = nothing
unmaybe (just x ∷ xs) | just xs' = just $ x ∷ xs'
filter-idx : ∀ {a}{X : Set a} → List X → List ℕ → Maybe (List X)
filter-idx xs idxs = unmaybe $ L.map (xs at_) idxs
_!!_ : ∀ {a}{X : Set a} → (xs : List X) → Fin (L.length xs) → X
[] !! ()
(x ∷ xs) !! zero = x
(x ∷ xs) !! suc i = xs !! i
mk-mask : (n : ℕ) → List (Fin n) → List Bool
mk-mask n xs = V.toList $ go (V.replicate {n = n} false) xs
where go : _ → _ → _
go e [] = e
go e (x ∷ xs) = go (updateAt x (λ _ → true) e) xs
compile : State → Term → Prog
compile s (var x args) = ok "V(" # var-lkup s x # ok " " # comp-arglist s args # ok ")"
compile s (con c args) with (showName c)
compile s (con c args) | "Data.Vec.Base.Vec.[]" = ok "nil"
compile s (con c args) | "Array.Base.Ix.[]" = ok "nil"
compile s (con c args) | "Data.Vec.Base.Vec._∷_" =
ok "(cons " # comp-arglist-mask s args (mk-mask 5 $ # 3 ∷ # 4 ∷ []) # ok ")"
compile s (con c args) | "Array.Base.Ix._∷_" =
ok "(cons " # comp-arglist-mask s args (mk-mask 5 $ # 3 ∷ # 4 ∷ []) # ok ")"
compile s (con c args) | _ = ok ("C(" ++ showName c ++ " ") # comp-arglist s args # ok ")"
compile s (def f args) with def-lkup s $ showName f
... | error _ = ok "D(" # ok (showName f) # ok " " # comp-arglist s args
... | d = ok "D(" # d # ok " "
# comp-arglist s args # ok ")"
compile s (lam v (abs w x)) = ok ("(\\ " ++ w ++ " -> ") # compile (record s {vars = (w ∷ State.vars s)}) x # ok ")"
compile s (pat-lam cs []) = ok "PAT-LAM (cl = " # comp-clauses s cs # ok ")" --(args = " # comp-arglist s args # ok ")"
compile s (pat-lam cs _) = error "PAT-LAM: I don't know what args to pat-lam are"
compile s (pi a b) = ok "PI TYPE"
compile s (sort _) = ok "SORT"
compile s (lit x) = ok $ showLiteral x
compile s (meta x x₁) = ok "META"
compile s unknown = ok "_" -- "UNKNOWN"
comp-arglist s [] = ok ""
comp-arglist s (arg i x ∷ l) = compile s x # ok " " # comp-arglist s l
comp-arglist-mask s [] [] = ok ""
comp-arglist-mask s [] (x ∷ mask) = error "Incorrect argument mask"
comp-arglist-mask s (x ∷ args) [] = error "Incorrect argument mask"
comp-arglist-mask s (x ∷ args) (false ∷ mask) = comp-arglist-mask s args mask
comp-arglist-mask s (arg i x ∷ args) (true ∷ mask) = compile s x # ok " " # comp-arglist-mask s args mask
comp-pats : List (Arg Pattern) → List String
comp-pats [] = []
comp-pats (vArg (var x) ∷ l) = x ∷ comp-pats l
comp-pats (vArg _ ∷ l) = "_" ∷ comp-pats l
comp-pats (_ ∷ l) = "_" ∷ comp-pats l
comp-clauses s [] = ok ""
comp-clauses s (clause ps t ∷ cs) = let
vars = comp-pats ps
in ok ("pats = " ++ l→s vars) # compile (record s {vars = (L.reverse vars L.++ State.vars s)}) t
comp-clauses s (absurd-clause ps ∷ cs) = error "absurd clause found"
test : ∀ {n} (m : Ix 2 (n ∷ n ∷ []) → ℕ) (v : Ix 1 (n ∷ []) → ℕ)
(i : Fin n) → ℕ
test m v i = iterate-1
(λ i₁ →
m (i ∷ i₁ ∷ []) *
iterate-1 (λ i₂ → m (i₁ ∷ i₂ ∷ []) * v (i₂ ∷ [])) _+_ 0)
_+_ 0
bltin-defs : List $ String × String
bltin-defs = ("Agda.Builtin.Nat.Nat" , "nat")
∷ ("Agda.Builtin.Nat._+_" , "plus")
∷ ("Agda.Builtin.Nat._*_" , "mult")
∷ ("Agda.Primitive.lzero" , "tt")
∷ ("BLAS.iterate-1" , "for-loop-acc")
∷ []
bltin-cons : List (String × (List (Arg Term) → Prog))
bltin-cons = ("Data.Vec.Base.Vec.[]" , λ _ → ok "nil")
∷ ("Array.Base.Ix.[]" , λ _ → ok "nil")
∷ ("Array.Base.Ix._∷_" , λ args → {!!})
∷ []
ct = compile (st [] bltin-defs []) (reflect test)
foo : ∀ {n : ℕ} (a b : ℕ) → ℕ
foo x = _+ x
cr = compile (st [] bltin-defs []) (reflect foo)
cconv = compile (st [] bltin-defs []) (reflect conv-2)
-}
--t : Term
--t = reflect-ty (thm)
-- PAT-LAM (cl = pats = _ m v i D(BLAS.iterate-1 D(Agda.Primitive.lzero ) D(Agda.Builtin.Nat.Nat ) V(i )
-- (\\ i₁ -> D(Agda.Builtin.Nat._*_
-- V(v C(Array.Base.Ix._∷_ 1 C(Data.Vec.Base.Vec._∷_ UNKNOWN UNKNOWN 0 V(i ) C(Data.Vec.Base.Vec.[] UNKNOWN UNKNOWN ) )
-- V(i )
-- V(_ )
-- C(Array.Base.Ix._∷_ 0 C(Data.Vec.Base.Vec.[] UNKNOWN UNKNOWN ) V(i ) V(i₁ ) C(Array.Base.Ix.[] ) ) ) )
-- D(BLAS.iterate-1 D(Agda.Primitive.lzero ) D(Agda.Builtin.Nat.Nat ) V(i )
-- (\\ i₂ -> D(Agda.Builtin.Nat._*_
-- V(v C(Array.Base.Ix._∷_ 1 C(Data.Vec.Base.Vec._∷_ UNKNOWN UNKNOWN 0 V(i ) C(Data.Vec.Base.Vec.[] UNKNOWN UNKNOWN ) )
-- V(i )
-- V(i₁ )
-- C(Array.Base.Ix._∷_ 0 C(Data.Vec.Base.Vec.[] UNKNOWN UNKNOWN )
-- V(i ) V(i₂ ) C(Array.Base.Ix.[] ) ) ) )
-- V(m C(Array.Base.Ix._∷_ 0 C(Data.Vec.Base.Vec.[] UNKNOWN UNKNOWN ) V(i ) V(i₂ ) C(Array.Base.Ix.[] ) ) ) ))
-- D(Agda.Builtin.Nat._+_ ) 0 ) ))
-- D(Agda.Builtin.Nat._+_ ) 0 )) (args = )
--compld _ m v i = D(for-loop-acc D(tt ) D(nat ) V(_ )
-- (\\ i₁ -> D(mult V(m (cons V(i ) (cons V(i₁ ) nil ) ) )
-- D(for-loop-acc D(tt ) D(nat ) V(_ )
-- (\\ i₂ -> D(mult V(m (cons V(i₁ ) (cons V(i₂ ) nil ) ) )
-- V(v (cons V(i₂ ) nil ) ) ))
-- D(plus ) 0 ) ))
-- D(plus ) 0 )
-- A * v = { i → Σ Aᵢ×v }
-- A * A * v = { i → Σ Aᵢ×v }
|
MdePkg/Library/BaseLib/X64/ReadDr5.nasm | nicklela/edk2 | 3,861 | 11567 | ;------------------------------------------------------------------------------
;
; Copyright (c) 2006, Intel Corporation. All rights reserved.<BR>
; SPDX-License-Identifier: BSD-2-Clause-Patent
;
; Module Name:
;
; ReadDr5.Asm
;
; Abstract:
;
; AsmReadDr5 function
;
; Notes:
;
;------------------------------------------------------------------------------
DEFAULT REL
SECTION .text
;------------------------------------------------------------------------------
; UINTN
; EFIAPI
; AsmReadDr5 (
; VOID
; );
;------------------------------------------------------------------------------
global ASM_PFX(AsmReadDr5)
ASM_PFX(AsmReadDr5):
;
; There's no obvious reason to access this register, since it's aliased to
; DR7 when DE=0 or an exception generated when DE=1
;
DB 0xf, 0x21, 0xe8
ret
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c36205f.ada | best08618/asylo | 7 | 6947 | <filename>gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c36205f.ada
-- C36205F.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT ATTRIBUTES GIVE THE CORRECT VALUES FOR
-- UNCONSTRAINED FORMAL PARAMETERS.
-- ATTRIBUTES OF STATIC NON-NULL AGGREGATES
-- DAT 2/17/81
-- JBG 9/11/81
-- JWC 6/28/85 RENAMED TO -AB
WITH REPORT;
PROCEDURE C36205F IS
USE REPORT;
TYPE I_A IS ARRAY (INTEGER RANGE <> ) OF INTEGER;
TYPE I_A_2 IS ARRAY (INTEGER RANGE <> ,
INTEGER RANGE <> ) OF INTEGER;
A10 : I_A (1 .. 10);
A20 : I_A (18 .. 20);
I10 : INTEGER := IDENT_INT (10);
A2_10 : I_A_2 (1 .. I10, 3+I10 .. I10*I10); -- 1..10, 13..20
A2_20 : I_A_2 (11 .. 3*I10, I10+11 .. I10+I10); -- 11..30, 21..20
SUBTYPE STR IS STRING;
ALF : CONSTANT STR(IDENT_INT(1)..IDENT_INT(5)) := "ABCDE";
ARF : STR(5 .. 9) := ALF;
PROCEDURE P1 (A : I_A; FIR, LAS: INTEGER; S : STRING) IS
BEGIN
IF A'FIRST /= FIR
OR A'FIRST(1) /= FIR
THEN
FAILED ("'FIRST IS WRONG " & S);
END IF;
IF A'LAST /= LAS
OR A'LAST(1) /= LAS
THEN
FAILED ("'LAST IS WRONG " & S);
END IF;
IF A'LENGTH /= LAS - FIR + 1
OR A'LENGTH /= A'LENGTH(1)
THEN
FAILED ("'LENGTH IS WRONG " & S);
END IF;
IF (LAS NOT IN A'RANGE AND LAS >= FIR)
OR (FIR NOT IN A'RANGE AND LAS >= FIR)
OR FIR - 1 IN A'RANGE
OR LAS + 1 IN A'RANGE(1)
THEN
FAILED ("'RANGE IS WRONG " & S);
END IF;
END P1;
PROCEDURE P2 (A : I_A_2; F1,L1,F2,L2 : INTEGER; S : STRING) IS
BEGIN
IF A'FIRST /= A'FIRST(1)
OR A'FIRST /= F1
THEN
FAILED ("'FIRST(1) IS WRONG " & S);
END IF;
IF A'LAST(1) /= L1 THEN
FAILED ("'LAST(1) IS WRONG " & S);
END IF;
IF A'LENGTH(1) /= A'LENGTH
OR A'LENGTH /= L1 - F1 + 1
THEN
FAILED ("'LENGTH(1) IS WRONG " & S);
END IF;
IF F1 - 1 IN A'RANGE
OR (F1 NOT IN A'RANGE AND F1 <= L1)
OR (L1 NOT IN A'RANGE(1) AND F1 <= L1)
OR L1 + 1 IN A'RANGE(1)
THEN
FAILED ("'RANGE(1) IS WRONG " & S);
END IF;
IF A'FIRST(2) /= F2 THEN
FAILED ("'FIRST(2) IS WRONG " & S);
END IF;
IF A'LAST(2) /= L2 THEN
FAILED ("'LAST(2) IS WRONG " & S);
END IF;
IF L2 - F2 /= A'LENGTH(2) - 1 THEN
FAILED ("'LENGTH(2) IS WRONG " & S);
END IF;
IF F2 - 1 IN A'RANGE(2)
OR (F2 NOT IN A'RANGE(2) AND A'LENGTH(2) > 0)
OR (L2 NOT IN A'RANGE(2) AND A'LENGTH(2) /= 0)
OR L2 + 1 IN A'RANGE(2)
THEN
FAILED ("'RANGE(2) IS WRONG " & S);
END IF;
END P2;
PROCEDURE S1 (S:STR; F,L:INTEGER; MESS:STRING) IS
BEGIN
IF S'FIRST /= F THEN
FAILED ("STRING 'FIRST IS WRONG " & MESS);
END IF;
IF S'LAST(1) /= L THEN
FAILED ("STRING 'LAST IS WRONG " & MESS);
END IF;
IF S'LENGTH /= L - F + 1
OR S'LENGTH(1) /= S'LENGTH
THEN
FAILED ("STRING 'LENGTH IS WRONG " & MESS);
END IF;
IF (F <= L AND
(F NOT IN S'RANGE
OR L NOT IN S'RANGE
OR F NOT IN S'RANGE(1)
OR L NOT IN S'RANGE(1)))
OR F - 1 IN S'RANGE
OR L + 1 IN S'RANGE(1)
THEN
FAILED ("STRING 'RANGE IS WRONG " & MESS);
END IF;
END S1;
BEGIN
TEST ( "C36205F", "CHECKING ATTRIBUTE VALUES POSSESSED BY FORMAL "&
"PARAMETERS WHOSE ACTUALS ARE UNCONSTRAINED " &
"ARRAYS - STATIC NON-NULL AGGREGATES");
P1 ((3 .. 5 => 2), 3, 5, "P1 16");
P1 ((5 .. 5 => 5), 5, 5, "P1 17");
RESULT;
END C36205F;
|
test/Test/Compile/Golden/simple-tensor/simple-tensor-output.agda | vehicle-lang/vehicle | 9 | 16816 | -- WARNING: This file was generated automatically by Vehicle
-- and should not be modified manually!
-- Metadata
-- - Agda version: 2.6.2
-- - AISEC version: 0.1.0.1
-- - Time generated: ???
{-# OPTIONS --allow-exec #-}
open import Vehicle
open import Vehicle.Data.Tensor
open import Data.Nat as ℕ using (ℕ)
open import Data.Fin as Fin using (Fin; #_)
open import Data.List
module simple-tensor-temp-output where
zeroD : Tensor ℕ []
zeroD = 2
oneD : Tensor ℕ (2 ∷ [])
oneD = zeroD ∷ (1 ∷ [])
twoD : Tensor ℕ (2 ∷ (2 ∷ []))
twoD = oneD ∷ ((2 ∷ (3 ∷ [])) ∷ [])
lookup2D : ℕ
lookup2D = twoD (# 0) (# 1) |
test/Succeed/uncons.agda | cruhland/agda | 1,989 | 3851 | open import Agda.Builtin.Maybe
open import Agda.Builtin.Char
open import Agda.Builtin.String
open import Agda.Builtin.Sigma
open import Agda.Builtin.Equality
_ : primStringUncons "abcd" ≡ just ('a', "bcd")
_ = refl
|
alloy4fun_models/trashltl/models/1/QKaKjEdzeAXuta6PN.als | Kaixi26/org.alloytools.alloy | 0 | 406 | open main
pred idQKaKjEdzeAXuta6PN_prop2 {
historically no File until some File
}
pred __repair { idQKaKjEdzeAXuta6PN_prop2 }
check __repair { idQKaKjEdzeAXuta6PN_prop2 <=> prop2o } |
src/ada/src/services/spark/afrl-cmasi-missioncommand-spark_boundary.adb | VVCAS-Sean/OpenUxAS | 88 | 27668 | package body AFRL.CMASI.MissionCommand.SPARK_Boundary with SPARK_Mode => Off is
-------------------
-- Get_VehicleID --
-------------------
function Get_VehicleID
(Command : MissionCommand) return Int64
renames getVehicleID;
end AFRL.CMASI.MissionCommand.SPARK_Boundary;
|
Antlr/kcc.g4 | knoxaramav2/KCC | 0 | 1178 | <reponame>knoxaramav2/KCC
grammar KCC;
options{
language = CSharp;
}
/***Parser Rules***/
rules : asm+ EOF;
//rules : statement * EOF;
asm : assembly symbol_id block;
block : L_BRACE (class|~R_BRACE)+ R_BRACE//L_BRACE (block|expression|~R_BRACE)+ R_BRACE
| L_BRACE (class|function|block|expression|~R_BRACE)+ R_BRACE
//: L_BRACE (class|~R_BRACE)+ R_BRACE
//| L_BRACE (function|~R_BRACE)+ R_BRACE
//| L_BRACE (block|~R_BRACE)+ R_BRACE
//| L_BRACE (expression|~R_BRACE)+ R_BRACE
;
class : CLASS symbol_id block
//| statement
;
statement : call
| expression* semi
| IDENTIFIER IDENTIFIER group block semi
;
expression : assign_expr
//| symbol_id expression
| var_decl
| symbol_id
| group
| unary_ops expression
| expression binary expression
| bool
| type_specifier symbol_id
;
call : symbol_id group;
function : function_decl
| function_call
;
function_decl : identifier function_call block;
function_call : identifier group;
assign_expr : identifier assign_ops (value_id|expression);
var_decl : identifier assign_expr
| identifier symbol_id
;
group : L_PARANTH (expression|~R_PARANTH)? R_PARANTH;
asm_id : (identifier DOT)*?IDENTIFIER;
value_id : DECIMAL | IDENTIFIER | logic_id;
symbol_id : (IDENTIFIER)(DOT IDENTIFIER)*?;//x or x.y.z
logic_id : (TRUE | FALSE);
identifier : type_specifier
| symbol_id
| control_block
| RETURN
| control_id
;
control_block : IF
| ELSE
| WHILE
| FOREACH
;
control_id : CONTINUE
| BREAK
| GOTO
| RETURN
;
unary_ops : INCREMENT
| DECRIMENT
| LOGIC_NOT
;
binary_arith_ops: SET
| ADD
| SUBTRACT
| MULTIPLY
| DIVIDE
| EXPONENT
| MODULO
| SET_SUM
| SET_DIFFERENCE
| SET_PRODUCT
| SET_QUOTIENT
;
assign_ops : SET
| SET_SUM
| SET_DIFFERENCE
| SET_PRODUCT
| SET_QUOTIENT
;
binary_logic_ops: LOGIC_OR
| LOGIC_AND
| LOGIC_NOT
| LOGIC_NAND
| LOGIC_NOR
| LOGIC_XOR
| LOGIC_XNOR
| GTR
| LSS
| EQU
| GTR_EQU
| LSS_EQU
;
binary : binary_arith_ops | binary_logic_ops;
bool : TRUE | FALSE;
arith_expr :arith_expr binary_arith_ops arith_expr
| L_PARANTH arith_expr R_PARANTH
| value_id
| SUBTRACT value_id
| (INCREMENT|DECRIMENT) value_id;
type_specifier : ('int'
| 'sint'
| 'double'
| 'char'
| 'byte'
| 'string'
| 'class'
| 'bool')
| type_specifier array;
array : L_BRACKET value_id? R_BRACKET;
assembly : 'asm' | 'assembly';
semi : SEMI;
/***Lexer Rules***/
//control operators
IF : 'if';
ELSE : 'else';
WHILE : 'while';
FOREACH : 'foreach';
CONTINUE : 'continue';
BREAK : 'break';
RETURN : 'return';
GOTO : 'goto';
//arithmetic operators
SET : '=';
ADD : '+';
SUBTRACT : '-';
MULTIPLY : '*';
DIVIDE : '/';
EXPONENT : '**';
MODULO : '%' ;
SET_SUM : '+=';
SET_DIFFERENCE : '-=';
SET_PRODUCT : '*=';
SET_QUOTIENT : '/=';
INCREMENT : '++';
DECRIMENT : '--';
//logical operators
LOGIC_OR : '||';
LOGIC_AND : '&&';
LOGIC_NOT : '!';
LOGIC_NAND : '!&';
LOGIC_NOR : '!|';
LOGIC_XOR : '^|';
LOGIC_XNOR : '^!';
//comparisons
GTR : '>';
LSS : '<';
EQU : '==';
GTR_EQU : '>=';
LSS_EQU : '<=';
//bitwise operators
BITWISE_AND : '&';
BITWISE_OR : '|';
BITWISE_INVERT : '~' ;
//special
CLASS : 'class';
THIS : 'this';
TRUE : 'true';
FALSE : 'false';
ASSEMBLY : 'assembly';
//binary other
JOINT : ':';
DOT : '.';
//enclosures
L_BRACKET : '[';
R_BRACKET : ']';
L_PARANTH : '(';
R_PARANTH : ')';
L_BRACE : '{';
R_BRACE : '}';
//other operators
//REFERENCE : '\@'; TODO FIX
LINE_COMMENT : '#' ~[\r\n]* ->channel(HIDDEN);
BLOCK_COMMENT : '#*' .*? '*#'->channel(HIDDEN);
fragment ALPHA : [a-zA-Z_]
;
//general identifies
DECIMAL : '-'?[0-9]+('.'[0-9])?;
IDENTIFIER : ALPHA+ (DECIMAL+)?;//[a-zA-Z_]([a-zA-Z_0-9])+;
SEMI : ';';
WS : [ \r\t\u000C\n]+ -> skip ;
|
src/postgresql/ado-connections-postgresql.ads | My-Colaborations/ada-ado | 0 | 29480 | -----------------------------------------------------------------------
-- ado-connections-postgresql -- Postgresql Database connections
-- Copyright (C) 2018, 2019 <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.
-----------------------------------------------------------------------
private with PQ;
private with Ada.Strings.Unbounded;
package ADO.Connections.Postgresql is
type Postgresql_Driver is limited private;
-- Initialize the Postgresql driver.
procedure Initialize;
private
use Ada.Strings.Unbounded;
-- Create a new Postgresql connection using the configuration parameters.
procedure Create_Connection (D : in out Postgresql_Driver;
Config : in Configuration'Class;
Result : in out Ref.Ref'Class);
type Postgresql_Driver is new ADO.Connections.Driver with record
Id : Natural := 0;
end record;
-- Create the database and initialize it with the schema SQL file.
-- The `Admin` parameter describes the database connection with administrator access.
-- The `Config` parameter describes the target database connection.
overriding
procedure Create_Database (D : in out Postgresql_Driver;
Admin : in Configs.Configuration'Class;
Config : in Configs.Configuration'Class;
Schema_Path : in String;
Messages : out Util.Strings.Vectors.Vector);
-- Deletes the Postgresql driver.
overriding
procedure Finalize (D : in out Postgresql_Driver);
-- Database connection implementation
type Database_Connection is new ADO.Connections.Database_Connection with record
Name : Unbounded_String;
Server_Name : Unbounded_String;
Login_Name : Unbounded_String;
Password : Unbounded_String;
Server : PQ.PGconn_Access := PQ.Null_PGconn;
Connected : Boolean := False;
end record;
type Database_Connection_Access is access all Database_Connection'Class;
-- Get the database driver which manages this connection.
overriding
function Get_Driver (Database : in Database_Connection)
return Driver_Access;
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Query_Statement_Access;
overriding
function Create_Statement (Database : in Database_Connection;
Query : in String)
return Query_Statement_Access;
-- Create a delete statement.
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Delete_Statement_Access;
-- Create an insert statement.
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Insert_Statement_Access;
-- Create an update statement.
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Update_Statement_Access;
-- Start a transaction.
overriding
procedure Begin_Transaction (Database : in out Database_Connection);
-- Commit the current transaction.
overriding
procedure Commit (Database : in out Database_Connection);
-- Rollback the current transaction.
overriding
procedure Rollback (Database : in out Database_Connection);
procedure Execute (Database : in out Database_Connection;
SQL : in Query_String);
-- Closes the database connection
overriding
procedure Close (Database : in out Database_Connection);
overriding
procedure Finalize (Database : in out Database_Connection);
-- Load the database schema definition for the current database.
overriding
procedure Load_Schema (Database : in Database_Connection;
Schema : out ADO.Schemas.Schema_Definition);
end ADO.Connections.Postgresql;
|
programs/oeis/323/A323741.asm | neoneye/loda | 22 | 177610 | <gh_stars>10-100
; A323741: a(n) = m-p where m = (2n+1)^2 and p is the largest prime < m.
; 2,2,2,2,8,2,2,6,2,2,6,6,2,2,8,2,2,2,10,12,2,8,2,2,8,6,2,20,12,2,2,6,6,2,2,6,2,2,12,8,6,6,8,2,8,2,12,6,10,8,2,22,2,14,20,6,6,2,2,2,8,6,2,8,2,6,2,12,2,14,6,2,8,8,14,10,2,18,20,2,8,14,6,2,10,2,32,2,12,12,2,8,6,44,2,6,14,6,20,14
seq $0,73577 ; a(n) = 4*n^2 + 4*n - 1.
seq $0,64722 ; a(1) = 0; for n >= 2, a(n) = n - (largest prime <= n).
add $0,1
|
alloy4fun_models/trashltl/models/17/SxQzpaf7zK9M6ZKZy.als | Kaixi26/org.alloytools.alloy | 0 | 816 | <reponame>Kaixi26/org.alloytools.alloy
open main
pred idSxQzpaf7zK9M6ZKZy_prop18 {
always all p: Protected | p not in Trash until p not in Protected
}
pred __repair { idSxQzpaf7zK9M6ZKZy_prop18 }
check __repair { idSxQzpaf7zK9M6ZKZy_prop18 <=> prop18o } |
oeis/179/A179601.asm | neoneye/loda-programs | 11 | 241213 | ; A179601: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1+4*x)/(1 - 2*x - 10*x^2 - 4*x^3).
; Submitted by <NAME>
; 1,6,22,108,460,2088,9208,41136,182704,813600,3618784,16104384,71651008,318820992,1418569600,6311953152,28084886272,124963582464,556023840256,2474023050240,11008138832896,48980603529216,217938687588352
add $0,2
mov $2,1
lpb $0
sub $0,1
add $1,$3
add $3,$4
mov $4,$1
add $4,$1
mov $1,$3
add $4,$3
mov $3,$2
mul $4,2
mov $2,$4
lpe
mov $0,$1
|
test/asset/agda-stdlib-1.0/Relation/Unary/Closure/StrictPartialOrder.agda | omega12345/agda-mode | 5 | 3559 | <reponame>omega12345/agda-mode<gh_stars>1-10
------------------------------------------------------------------------
-- The Agda standard library
--
-- Closures of a unary relation with respect to a strict partial order
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary
module Relation.Unary.Closure.StrictPartialOrder
{a r e} (P : StrictPartialOrder a e r) where
open StrictPartialOrder P renaming (_<_ to _∼_)
open import Relation.Unary using (Pred)
-- Specialising the results proven generically in `Base`.
import Relation.Unary.Closure.Base _∼_ as Base
open Base public using (□; map; Closed)
module _ {t} {T : Pred Carrier t} where
reindex : ∀ {x y} → x ∼ y → □ T x → □ T y
reindex = Base.reindex trans
duplicate : ∀ {x} → □ T x → □ (□ T) x
duplicate = Base.duplicate trans
□-closed : ∀ {t} {T : Pred Carrier t} → Closed (□ T)
□-closed = Base.□-closed trans
|
test/Succeed/Issue4081.agda | cruhland/agda | 1,989 | 6004 | open import Agda.Builtin.Equality
module _ (A : Set) where
data Wrap (X : Set) : Set where
wrap : X → Wrap X
data D (x : A) : ∀ y → Wrap (x ≡ y) → Set where
c : ∀ y (x≡y : x ≡ y) → D x y (wrap x≡y)
test : ∀ x y (x≡y x≡y' : Wrap (x ≡ y)) → D x y x≡y → D x y x≡y' → Set
test y .y (wrap refl) .(wrap refl) (c .y .refl) (c .y refl) = A
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34005u.ada | best08618/asylo | 7 | 20690 | <filename>gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34005u.ada
-- C34005U.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:
-- FOR DERIVED MULTI-DIMENSIONAL ARRAY TYPES WHOSE COMPONENT TYPE IS
-- A LIMITED TYPE:
-- CHECK THAT ALL VALUES OF THE PARENT (BASE) TYPE ARE PRESENT
-- FOR THE DERIVED (BASE) TYPE WHEN THE DERIVED TYPE DEFINITION
-- IS CONSTRAINED.
-- CHECK THAT ANY CONSTRAINT IMPOSED ON THE PARENT SUBTYPE IS
-- ALSO IMPOSED ON THE DERIVED SUBTYPE.
-- HISTORY:
-- JRK 08/21/87 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE C34005U IS
PACKAGE PKG_L IS
TYPE LP IS LIMITED PRIVATE;
FUNCTION CREATE (X : INTEGER) RETURN LP;
FUNCTION VALUE (X : LP) RETURN INTEGER;
FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN;
PROCEDURE ASSIGN (X : OUT LP; Y : LP);
C1 : CONSTANT LP;
C2 : CONSTANT LP;
C3 : CONSTANT LP;
C4 : CONSTANT LP;
C5 : CONSTANT LP;
C6 : CONSTANT LP;
C7 : CONSTANT LP;
C8 : CONSTANT LP;
PRIVATE
TYPE LP IS NEW INTEGER;
C1 : CONSTANT LP := 1;
C2 : CONSTANT LP := 2;
C3 : CONSTANT LP := 3;
C4 : CONSTANT LP := 4;
C5 : CONSTANT LP := 5;
C6 : CONSTANT LP := 6;
C7 : CONSTANT LP := 7;
C8 : CONSTANT LP := 8;
END PKG_L;
USE PKG_L;
SUBTYPE COMPONENT IS LP;
PACKAGE PKG_P IS
FIRST : CONSTANT := 0;
LAST : CONSTANT := 10;
SUBTYPE INDEX IS INTEGER RANGE FIRST .. LAST;
TYPE PARENT IS ARRAY (INDEX RANGE <>, INDEX RANGE <>) OF
COMPONENT;
FUNCTION CREATE ( F1, L1 : INDEX;
F2, L2 : INDEX;
C : COMPONENT;
DUMMY : PARENT -- TO RESOLVE OVERLOADING.
) RETURN PARENT;
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN;
FUNCTION AGGR (A, B, C, D, E, F, G, H : COMPONENT)
RETURN PARENT;
END PKG_P;
USE PKG_P;
TYPE T IS NEW PARENT (IDENT_INT (4) .. IDENT_INT (5),
IDENT_INT (6) .. IDENT_INT (8));
SUBTYPE SUBPARENT IS PARENT (4 .. 5, 6 .. 8);
TYPE S IS NEW SUBPARENT;
X : T;
Y : S;
PACKAGE BODY PKG_L IS
FUNCTION CREATE (X : INTEGER) RETURN LP IS
BEGIN
RETURN LP (IDENT_INT (X));
END CREATE;
FUNCTION VALUE (X : LP) RETURN INTEGER IS
BEGIN
RETURN INTEGER (X);
END VALUE;
FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN IS
BEGIN
RETURN X = Y;
END EQUAL;
PROCEDURE ASSIGN (X : OUT LP; Y : LP) IS
BEGIN
X := Y;
END ASSIGN;
END PKG_L;
PACKAGE BODY PKG_P IS
FUNCTION CREATE
( F1, L1 : INDEX;
F2, L2 : INDEX;
C : COMPONENT;
DUMMY : PARENT
) RETURN PARENT
IS
A : PARENT (F1 .. L1, F2 .. L2);
B : COMPONENT;
BEGIN
ASSIGN (B, C);
FOR I IN F1 .. L1 LOOP
FOR J IN F2 .. L2 LOOP
ASSIGN (A (I, J), B);
ASSIGN (B, CREATE (VALUE (B) + 1));
END LOOP;
END LOOP;
RETURN A;
END CREATE;
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN IS
BEGIN
IF X'LENGTH /= Y'LENGTH OR
X'LENGTH(2) /= Y'LENGTH(2) THEN
RETURN FALSE;
ELSE FOR I IN X'RANGE LOOP
FOR J IN X'RANGE(2) LOOP
IF NOT EQUAL (X (I, J),
Y (I - X'FIRST + Y'FIRST,
J - X'FIRST(2) +
Y'FIRST(2))) THEN
RETURN FALSE;
END IF;
END LOOP;
END LOOP;
END IF;
RETURN TRUE;
END EQUAL;
FUNCTION AGGR (A, B, C, D, E, F, G, H : COMPONENT)
RETURN PARENT IS
X : PARENT (INDEX'FIRST .. INDEX'FIRST + 3,
INDEX'FIRST .. INDEX'FIRST + 1);
BEGIN
ASSIGN (X (INDEX'FIRST , INDEX'FIRST ), A);
ASSIGN (X (INDEX'FIRST , INDEX'FIRST + 1), B);
ASSIGN (X (INDEX'FIRST + 1, INDEX'FIRST ), C);
ASSIGN (X (INDEX'FIRST + 1, INDEX'FIRST + 1), D);
ASSIGN (X (INDEX'FIRST + 2, INDEX'FIRST ), E);
ASSIGN (X (INDEX'FIRST + 2, INDEX'FIRST + 1), F);
ASSIGN (X (INDEX'FIRST + 3, INDEX'FIRST ), G);
ASSIGN (X (INDEX'FIRST + 3, INDEX'FIRST + 1), H);
RETURN X;
END AGGR;
END PKG_P;
PROCEDURE ASSIGN (X : IN OUT T; Y : T) IS
BEGIN
FOR I IN X'RANGE LOOP
FOR J IN X'RANGE(2) LOOP
ASSIGN (X (I, J), Y (I, J));
END LOOP;
END LOOP;
END ASSIGN;
PROCEDURE ASSIGN (X : IN OUT S; Y : S) IS
BEGIN
FOR I IN X'RANGE LOOP
FOR J IN X'RANGE(2) LOOP
ASSIGN (X (I, J), Y (I, J));
END LOOP;
END LOOP;
END ASSIGN;
BEGIN
TEST ("C34005U", "CHECK THAT ALL VALUES OF THE PARENT (BASE) " &
"TYPE ARE PRESENT FOR THE DERIVED (BASE) TYPE " &
"WHEN THE DERIVED TYPE DEFINITION IS " &
"CONSTRAINED. ALSO CHECK THAT ANY CONSTRAINT " &
"IMPOSED ON THE PARENT SUBTYPE IS ALSO IMPOSED " &
"ON THE DERIVED SUBTYPE. CHECK FOR DERIVED " &
"MULTI-DIMENSIONAL ARRAY TYPES WHOSE COMPONENT " &
"TYPE IS A LIMITED TYPE");
FOR I IN X'RANGE LOOP
FOR J IN X'RANGE(2) LOOP
ASSIGN (X (I, J), C2);
ASSIGN (Y (I, J), C2);
END LOOP;
END LOOP;
-- CHECK THAT BASE TYPE VALUES NOT IN THE SUBTYPE ARE PRESENT.
BEGIN
IF NOT EQUAL (CREATE (6, 9, 2, 3, C1, X),
AGGR (C1, C2, C3, C4, C5, C6, C7, C8)) OR
NOT EQUAL (CREATE (6, 9, 2, 3, C1, Y),
AGGR (C1, C2, C3, C4, C5, C6, C7, C8)) THEN
FAILED ("CAN'T CREATE BASE TYPE VALUES OUTSIDE THE " &
"SUBTYPE");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED ("CONSTRAINT_ERROR WHEN TRYING TO CREATE BASE " &
"TYPE VALUES OUTSIDE THE SUBTYPE");
WHEN OTHERS =>
FAILED ("EXCEPTION WHEN TRYING TO CREATE BASE TYPE " &
"VALUES OUTSIDE THE SUBTYPE");
END;
IF AGGR (C1, C2, C3, C4, C5, C6, C7, C8) IN T OR
AGGR (C1, C2, C3, C4, C5, C6, C7, C8) IN S THEN
FAILED ("INCORRECT ""IN""");
END IF;
-- CHECK THE DERIVED SUBTYPE CONSTRAINT.
IF T'FIRST /= 4 OR T'LAST /= 5 OR
S'FIRST /= 4 OR S'LAST /= 5 OR
T'FIRST (2) /= 6 OR T'LAST (2) /= 8 OR
S'FIRST (2) /= 6 OR S'LAST (2) /= 8 THEN
FAILED ("INCORRECT 'FIRST OR 'LAST");
END IF;
BEGIN
ASSIGN (X, CREATE (4, 5, 6, 8, C1, X));
ASSIGN (Y, CREATE (4, 5, 6, 8, C1, Y));
IF NOT EQUAL (PARENT (X), PARENT (Y)) THEN -- USE X AND Y.
FAILED ("INCORRECT CONVERSION TO PARENT");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED BY OK ASSIGN CALL");
END;
BEGIN
ASSIGN (X, CREATE (4, 4, 6, 8, C1, X));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (X, CREATE (4, 4, 6, 8, C1, X))");
IF EQUAL (X, CREATE (4, 4, 6, 8, C1, X)) THEN -- USE X.
COMMENT ("X ALTERED -- " &
"ASSIGN (X, CREATE (4, 4, 6, 8, C1, X))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (X, CREATE (4, 4, 6, 8, C1, X))");
END;
BEGIN
ASSIGN (X, CREATE (4, 6, 6, 8, C1, X));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (X, CREATE (4, 6, 6, 8, C1, X))");
IF EQUAL (X, CREATE (4, 6, 6, 8, C1, X)) THEN -- USE X.
COMMENT ("X ALTERED -- " &
"ASSIGN (X, CREATE (4, 6, 6, 8, C1, X))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (X, CREATE (4, 6, 6, 8, C1, X))");
END;
BEGIN
ASSIGN (X, CREATE (4, 5, 6, 7, C1, X));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (X, CREATE (4, 5, 6, 7, C1, X))");
IF EQUAL (X, CREATE (4, 5, 6, 7, C1, X)) THEN -- USE X.
COMMENT ("X ALTERED -- " &
"ASSIGN (X, CREATE (4, 5, 6, 7, C1, X))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (X, CREATE (4, 5, 6, 7, C1, X))");
END;
BEGIN
ASSIGN (X, CREATE (4, 5, 6, 9, C1, X));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (X, CREATE (4, 5, 6, 9, C1, X))");
IF EQUAL (X, CREATE (4, 5, 6, 9, C1, X)) THEN -- USE X.
COMMENT ("X ALTERED -- " &
"ASSIGN (X, CREATE (4, 5, 6, 9, C1, X))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (X, CREATE (4, 5, 6, 9, C1, X))");
END;
BEGIN
ASSIGN (Y, CREATE (4, 4, 6, 8, C1, Y));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (Y, CREATE (4, 4, 6, 8, C1, Y))");
IF EQUAL (Y, CREATE (4, 4, 6, 8, C1, Y)) THEN -- USE Y.
COMMENT ("Y ALTERED -- " &
"ASSIGN (Y, CREATE (4, 4, 6, 8, C1, Y))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (Y, CREATE (4, 4, 6, 8, C1, Y))");
END;
BEGIN
ASSIGN (Y, CREATE (4, 6, 6, 8, C1, Y));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (Y, CREATE (4, 6, 6, 8, C1, Y))");
IF EQUAL (Y, CREATE (4, 6, 6, 8, C1, Y)) THEN -- USE Y.
COMMENT ("Y ALTERED -- " &
"ASSIGN (Y, CREATE (4, 6, 6, 8, C1, Y))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (Y, CREATE (4, 6, 6, 8, C1, Y))");
END;
BEGIN
ASSIGN (Y, CREATE (4, 5, 6, 7, C1, Y));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (Y, CREATE (4, 5, 6, 7, C1, Y))");
IF EQUAL (Y, CREATE (4, 5, 6, 7, C1, Y)) THEN -- USE Y.
COMMENT ("Y ALTERED -- " &
"ASSIGN (Y, CREATE (4, 5, 6, 7, C1, Y))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (Y, CREATE (4, 5, 6, 7, C1, Y))");
END;
BEGIN
ASSIGN (Y, CREATE (4, 5, 6, 9, C1, Y));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (Y, CREATE (4, 5, 6, 9, C1, Y))");
IF EQUAL (Y, CREATE (4, 5, 6, 9, C1, Y)) THEN -- USE Y.
COMMENT ("Y ALTERED -- " &
"ASSIGN (Y, CREATE (4, 5, 6, 9, C1, Y))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (Y, CREATE (4, 5, 6, 9, C1, Y))");
END;
RESULT;
END C34005U;
|
anims.asm | RobertTheSable/fe1-5 | 0 | 82392 | <filename>anims.asm
;animation changes
; Stuff for Lance Knight Animations
ORG $8AE516
incbin binaries/armoranims.bin ; battle animation
ORG $96E51D
db $1d ; This fixes the distance
ORG $84F126
dl $A6BE98 ; map battle animation
; Animation Associations
ORG $8ADFF6
incbin binaries/animation/animatioassociation.bin
; Shields
ORG $898E58
incbin binaries/animation/shields.bin |
src/kernel/x86_64/io.asm | nothotscott/VisualOS | 28 | 10664 | <filename>src/kernel/x86_64/io.asm
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; File: io.asm
;;
;; Copyright 2020 <NAME>
;; Check the LICENSE file that came with this program for licensing terms
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
GLOBAL io_apic_enable
io_apic_enable:
mov ecx, 0x1b ; IA32_APIC_BASE_MSR
rdmsr
or eax, 0x800 ; IA32_APIC_BASE_MSR_ENABLE
wrmsr
ret
GLOBAL outb
outb: ; rdi=[port], rsi=[value]
mov rdx, rdi ; port
mov rax, rsi ; value
out dx, al
ret
GLOBAL outw
outw:
mov rdx, rdi
mov rax, rsi
out dx, ax
ret
GLOBAL outl
outl:
mov rdx, rdi
mov rax, rsi
out dx, eax
ret
GLOBAL inb
inb: ; rdi=[port], al=return(value)
mov rdx, rdi ; port
in al, dx
ret
GLOBAL inw
inw:
mov rdx, rdi
in ax, dx
ret
GLOBAL inl
inl:
mov rdx, rdi
in eax, dx
ret
GLOBAL io_wait
io_wait:
out 0x80, al
ret |
src/keystore-gpg.ads | thierr26/ada-keystore | 25 | 26718 | <reponame>thierr26/ada-keystore<filename>src/keystore-gpg.ads
-----------------------------------------------------------------------
-- keystore-gpg -- helpers to open keystores protected with GPG
-- Copyright (C) 2019 <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 Keystore.Files;
with Keystore.Passwords.GPG;
package Keystore.GPG is
subtype Wallet_File is Keystore.Files.Wallet_File;
subtype Context_Type is Keystore.Passwords.GPG.Context_Type;
-- Open the keystore file and unlock the wallet using GPG.
-- Raises the Bad_Password exception if no key slot match an available GPG key.
procedure Open (Container : in out Wallet_File;
Context : in out Context_Type;
Path : in String;
Data_Path : in String := "";
Config : in Wallet_Config := Secure_Config) with
Pre => not Container.Is_Open,
Post => Container.Is_Open;
end Keystore.GPG;
|
oeis/108/A108397.asm | neoneye/loda-programs | 11 | 90757 | <gh_stars>10-100
; A108397: Sums of rows of the triangle in A108396.
; 0,2,10,66,692,9780,167982,3362828,76695880,1961316270,55555555610,1726135607262,58359930206844,2132745542253872,83767436069591302,3518790190560477240,157412216095654840592,7471013615160978901626,374948124011649358071858,19839152658149255713160090,1103764210526315789473684420,64414521877705457298226896972,3934549824863863470951833672030,251040172089080578776677554765956,16700691466647035993101541920826712,1156482317317871396274616320927938150,83230736724400766841971036379170755402
mov $4,$0
add $0,1
mov $2,$0
mov $3,$4
lpb $0
sub $0,1
mul $3,$4
add $5,$4
add $5,$2
mov $2,$3
lpe
mov $0,$5
div $0,2
|
weakening.agda | hazelgrove/hazel-palette-agda | 4 | 15682 | open import Nat
open import Prelude
open import core
open import contexts
open import lemmas-disjointness
open import exchange
open import lemmas-freshG
-- this module contains all the proofs of different weakening structural
-- properties that we use for the hypothetical judgements
module weakening where
mutual
weaken-subst-Δ : ∀{Δ1 Δ2 Γ σ Γ'} → Δ1 ## Δ2
→ Δ1 , Γ ⊢ σ :s: Γ'
→ (Δ1 ∪ Δ2) , Γ ⊢ σ :s: Γ'
weaken-subst-Δ disj (STAId x) = STAId x
weaken-subst-Δ disj (STASubst subst x) = STASubst (weaken-subst-Δ disj subst) (weaken-ta-Δ1 disj x)
weaken-ta-Δ1 : ∀{Δ1 Δ2 Γ d τ} → Δ1 ## Δ2
→ Δ1 , Γ ⊢ d :: τ
→ (Δ1 ∪ Δ2) , Γ ⊢ d :: τ
weaken-ta-Δ1 disj TAConst = TAConst
weaken-ta-Δ1 disj (TAVar x₁) = TAVar x₁
weaken-ta-Δ1 disj (TALam x₁ wt) = TALam x₁ (weaken-ta-Δ1 disj wt)
weaken-ta-Δ1 disj (TAAp wt wt₁) = TAAp (weaken-ta-Δ1 disj wt) (weaken-ta-Δ1 disj wt₁)
weaken-ta-Δ1 {Δ1} {Δ2} {Γ} disj (TAEHole {u = u} {Γ' = Γ'} x x₁) = TAEHole (x∈∪l Δ1 Δ2 u _ x ) (weaken-subst-Δ disj x₁)
weaken-ta-Δ1 {Δ1} {Δ2} {Γ} disj (TANEHole {Γ' = Γ'} {u = u} x wt x₁) = TANEHole (x∈∪l Δ1 Δ2 u _ x) (weaken-ta-Δ1 disj wt) (weaken-subst-Δ disj x₁)
weaken-ta-Δ1 disj (TACast wt x) = TACast (weaken-ta-Δ1 disj wt) x
weaken-ta-Δ1 disj (TAFailedCast wt x x₁ x₂) = TAFailedCast (weaken-ta-Δ1 disj wt) x x₁ x₂
weaken-ta-Δ1 disj (TAFst wt) = TAFst (weaken-ta-Δ1 disj wt)
weaken-ta-Δ1 disj (TASnd wt) = TASnd (weaken-ta-Δ1 disj wt)
weaken-ta-Δ1 disj (TAPair wt wt₁) = TAPair (weaken-ta-Δ1 disj wt) (weaken-ta-Δ1 disj wt₁)
-- this is a little bit of a time saver. since ∪ is commutative on
-- disjoint contexts, and we need that premise anyway in both positions,
-- there's no real reason to repeat the inductive argument above
weaken-ta-Δ2 : ∀{Δ1 Δ2 Γ d τ} → Δ1 ## Δ2
→ Δ2 , Γ ⊢ d :: τ
→ (Δ1 ∪ Δ2) , Γ ⊢ d :: τ
weaken-ta-Δ2 {Δ1} {Δ2} {Γ} {d} {τ} disj D = tr (λ q → q , Γ ⊢ d :: τ) (∪comm Δ2 Δ1 (##-comm disj)) (weaken-ta-Δ1 (##-comm disj) D)
-- note that these statements are somewhat stronger than usual. this is
-- because we don't have implcit α-conversion. this reifies the
-- often-silent on paper assumption that if you collide with a bound
-- variable you can just α-convert it away and not worry.
-- used in both cases below, so factored into a lemma to save repeated code
lem-reassoc : {A : Set} {Γ Γ' : A ctx} {x : Nat} {τ : A} → (x # Γ') → (Γ ,, (x , τ)) ∪ Γ' == (Γ ∪ Γ') ,, (x , τ)
lem-reassoc {A} {Γ} {Γ'} {x} {τ} apt with lem-apart-sing-disj apt
... | disj = (∪assoc Γ (■ (x , τ)) Γ' disj) ·
(ap1 (λ qq → Γ ∪ qq) (∪comm (■ (x , τ)) (Γ') disj) ·
! (∪assoc Γ Γ' (■ (x , τ)) (##-comm disj)))
-- first we prove a general form of weakening, that you can add any
-- context Γ as long as it's fresh with respect to e
mutual
weaken-synth-∪ : ∀{e τ Γ Γ'} → freshΓ Γ' e → Γ ⊢ e => τ → (Γ ∪ Γ') ⊢ e => τ
weaken-synth-∪ frsh SConst = SConst
weaken-synth-∪ frsh (SAsc x) = SAsc (weaken-ana-∪ (freshΓ-asc frsh) x)
weaken-synth-∪ {Γ = Γ} {Γ' = Γ'} frsh (SVar {x = x} x₁) = SVar (x∈∪l Γ Γ' x _ x₁)
weaken-synth-∪ frsh (SAp x wt x₁ x₂) = SAp x (weaken-synth-∪ (freshΓ-ap1 frsh) wt)
x₁
(weaken-ana-∪ (freshΓ-ap2 frsh) x₂)
weaken-synth-∪ frsh SEHole = SEHole
weaken-synth-∪ frsh (SNEHole x wt) = SNEHole x (weaken-synth-∪ (freshΓ-nehole frsh) wt)
weaken-synth-∪ {Γ = Γ} {Γ' = Γ'} frsh (SLam {e = e} {τ2 = τ2} {x = x} x₁ wt)
with ctxindirect Γ' x
... | Inl qq = abort (lem-fresh-lam2 (frsh x qq))
... | Inr qq = SLam (apart-parts Γ Γ' x x₁ qq)
(tr (λ qq → qq ⊢ e => τ2) (lem-reassoc {Γ = Γ} qq)
(weaken-synth-∪ (freshΓ-lam2 frsh) wt))
weaken-synth-∪ frsh (SFst wt x) = SFst (weaken-synth-∪ (freshΓ-fst frsh) wt) x
weaken-synth-∪ frsh (SSnd wt x) = SSnd (weaken-synth-∪ (freshΓ-snd frsh) wt) x
weaken-synth-∪ frsh (SPair hd wt wt₁) = SPair hd (weaken-synth-∪ (freshΓ-pair1 frsh) wt) (weaken-synth-∪ (freshΓ-pair2 frsh) wt₁)
weaken-ana-∪ : ∀{e τ Γ Γ'} → freshΓ Γ' e → Γ ⊢ e <= τ → (Γ ∪ Γ') ⊢ e <= τ
weaken-ana-∪ frsh (ASubsume x x₁) = ASubsume (weaken-synth-∪ frsh x) x₁
weaken-ana-∪ {Γ = Γ} {Γ' = Γ'} frsh (ALam {e = e} {τ2 = τ2} {x = x} x₁ x₂ wt)
with ctxindirect Γ' x
... | Inl qq = abort (lem-fresh-lam1 (frsh x qq))
... | Inr qq = ALam (apart-parts Γ Γ' x x₁ qq)
x₂
(tr (λ qq → qq ⊢ e <= τ2) (lem-reassoc {Γ = Γ} qq)
(weaken-ana-∪ (freshΓ-lam1 frsh) wt))
-- it follows from this that if the term is closed, you can weaken with
-- any context that's fresh in e
weaken-synth-closed : ∀{e τ Γ} → freshΓ Γ e → ∅ ⊢ e => τ → Γ ⊢ e => τ
weaken-synth-closed {e} {τ} {Γ} f wt = tr (λ qq → qq ⊢ e => τ) ∅∪1 (weaken-synth-∪ f wt)
weaken-ana-closed : ∀{e τ Γ} → freshΓ Γ e → ∅ ⊢ e <= τ → Γ ⊢ e <= τ
weaken-ana-closed {e} {τ} {Γ} f wt = tr (λ qq → qq ⊢ e <= τ) ∅∪1 (weaken-ana-∪ f wt)
-- the very structural forms also follow from the union weakening, since
-- ,, is defined by ∪
weaken-synth : ∀{ x Γ e τ τ'} → freshe x e
→ Γ ⊢ e => τ
→ (Γ ,, (x , τ')) ⊢ e => τ
weaken-synth f wt = weaken-synth-∪ (fresh-freshΓ f) wt
weaken-ana : ∀{x Γ e τ τ'} → freshe x e
→ Γ ⊢ e <= τ
→ (Γ ,, (x , τ')) ⊢ e <= τ
weaken-ana f wt = weaken-ana-∪ (fresh-freshΓ f) wt
mutual
weaken-subst-Γ : ∀{ x Γ Δ σ Γ' τ} →
envfresh x σ →
Δ , Γ ⊢ σ :s: Γ' →
Δ , (Γ ,, (x , τ)) ⊢ σ :s: Γ'
weaken-subst-Γ {Γ = Γ} (EFId x₁) (STAId x₂) = STAId (λ x τ x₃ → x∈∪l Γ _ x τ (x₂ x τ x₃) )
weaken-subst-Γ {x = x} {Γ = Γ} (EFSubst x₁ efrsh x₂) (STASubst {y = y} {τ = τ'} subst x₃) =
STASubst (exchange-subst-Γ {Γ = Γ} (flip x₂) (weaken-subst-Γ {Γ = Γ ,, (y , τ')} efrsh subst))
(weaken-ta x₁ x₃)
weaken-ta : ∀{x Γ Δ d τ τ'} →
fresh x d →
Δ , Γ ⊢ d :: τ →
Δ , Γ ,, (x , τ') ⊢ d :: τ
weaken-ta _ TAConst = TAConst
weaken-ta {x} {Γ} {_} {_} {τ} {τ'} (FVar x₂) (TAVar x₃) = TAVar (x∈∪l Γ (■ (x , τ')) _ _ x₃)
weaken-ta {x = x} frsh (TALam {x = y} x₂ wt) with natEQ x y
weaken-ta (FLam x₁ x₂) (TALam x₃ wt) | Inl refl = abort (x₁ refl)
weaken-ta {Γ = Γ} {τ' = τ'} (FLam x₁ x₃) (TALam {x = y} x₄ wt) | Inr x₂ = TALam (apart-extend1 Γ (flip x₁) x₄) (exchange-ta-Γ {Γ = Γ} (flip x₁) (weaken-ta x₃ wt))
weaken-ta (FAp frsh frsh₁) (TAAp wt wt₁) = TAAp (weaken-ta frsh wt) (weaken-ta frsh₁ wt₁)
weaken-ta (FHole x₁) (TAEHole x₂ x₃) = TAEHole x₂ (weaken-subst-Γ x₁ x₃)
weaken-ta (FNEHole x₁ frsh) (TANEHole x₂ wt x₃) = TANEHole x₂ (weaken-ta frsh wt) (weaken-subst-Γ x₁ x₃)
weaken-ta (FCast frsh) (TACast wt x₁) = TACast (weaken-ta frsh wt) x₁
weaken-ta (FFailedCast frsh) (TAFailedCast wt x₁ x₂ x₃) = TAFailedCast (weaken-ta frsh wt) x₁ x₂ x₃
weaken-ta (FFst frsh) (TAFst wt) = TAFst (weaken-ta frsh wt)
weaken-ta (FSnd frsh) (TASnd wt) = TASnd (weaken-ta frsh wt)
weaken-ta (FPair frsh frsh₁) (TAPair wt wt₁) = TAPair (weaken-ta frsh wt) (weaken-ta frsh₁ wt₁)
|
oeis/216/A216778.asm | neoneye/loda-programs | 11 | 104467 | <gh_stars>10-100
; A216778: Number of derangements on n elements with an even number of cycles.
; 1,0,0,0,3,20,130,924,7413,66744,667476,7342280,88107415,1145396460,16035550518,240533257860,3848532125865,65425046139824,1177650830516968,22375365779822544,447507315596451051,9397653627525472260,206748379805560389930,4755212735527888968620
mov $2,$0
seq $0,166 ; Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.
add $0,1
sub $0,$2
div $0,2
|
C vs Assembly/factoriel.asm | zakarialaoui10/HIGH-TO-LOW | 18 | 8033 | li $v0,5
syscall
la $s0,($v0)
li $s2,1
la $t0,($s0)
loop:
beq $t0,1,print
mult $s2,$t0
mflo $s2
subi $t0,$t0,1
j loop
print :
li $v0,1
la $a0,($s2)
syscall
|
p5/p5(6).asm | Anan1225/assembly-language | 0 | 27503 | assume cs:code
a segment
dw 1,2,3,4,5,6,7,8,9,0ah,0bh,0ch,0dh,0eh,0fh,0ffh
a ends
b segment
dw 0,0,0,0,0,0,0
b ends
code segment
start:
mov ax,a
mov ds,ax
mov ax,b
mov ss,ax
mov sp,16
mov bx,0
mov cx,8
s:push ds:[bx]
add bx,2
loop s
mov ax,4c00H
int 21H
code ends
end start
|
solutions/28 - Neural Pathways/size-4_speed-51.asm | behrmann/7billionhumans | 45 | 17636 | -- 7 Billion Humans (2053) --
-- 28: Neural Pathways --
-- Author: soerface
-- Size: 4
-- Speed: 51
mem1 = nearest shredder
mem2 = nearest datacube
pickup mem2
giveto mem1 |
src/main/antlr/PL.g4 | SamChou19815/SAMPL | 0 | 953 | grammar PL;
import PLLexerPart;
program : classMemberDeclaration* EOF;
classDeclaration :
PRIVATE? CLASS UpperIdentifier genericsDeclaration?
(LPAREN typeExprInDeclaration RPAREN)?
(LBRACE classMemberDeclaration* RBRACE)?;
classMemberDeclaration
: classConstantDeclaration
| classFunctionGroupDeclaration
| classDeclaration
;
classConstantDeclaration: PRIVATE? VAL LowerIdentifier ASSIGN expression;
classFunctionGroupDeclaration : classFunctionDeclaration+;
classFunctionDeclaration :
PRIVATE? FUN genericsDeclaration? LowerIdentifier
argumentDeclarations typeAnnotation
ASSIGN expression;
typeExprInAnnotation
: (UpperIdentifier DOT)* UpperIdentifier genericsSpecialization?
# SingleIdentifierTypeInAnnotation
| LPAREN typeExprInAnnotation (COMMA typeExprInAnnotation)* RPAREN ARROW typeExprInAnnotation
# FunctionTypeInAnnotation
;
typeExprInDeclaration : variantTypeInDeclaration | structTypeInDeclaration;
variantTypeInDeclaration : LOR? variantConstructorDeclaration (LOR variantConstructorDeclaration)*;
structTypeInDeclaration : annotatedVariable (COMMA annotatedVariable)* COMMA?;
// Some parser type fragment
genericsSpecialization : LT typeExprInAnnotation (COMMA typeExprInAnnotation)* GT;
variantConstructorDeclaration : UpperIdentifier (OF typeExprInAnnotation)?;
typeAnnotation : COLON typeExprInAnnotation;
annotatedVariable : LowerIdentifier typeAnnotation;
argumentDeclarations : UNIT | (LPAREN annotatedVariable (COMMA annotatedVariable)* RPAREN);
patternToExpr : LOR pattern ARROW expression;
genericsDeclaration : LT UpperIdentifier (COMMA UpperIdentifier)* GT;
expression
: LPAREN expression RPAREN # NestedExpr
| literal # LiteralExpr
| (UpperIdentifier DOT)* LowerIdentifier genericsSpecialization? # IdentifierExpr
| constructor # ConstructorExpr
| expression DOT LowerIdentifier # StructMemberAccessExpr
| NOT expression # NotExpr
| expression (UNIT | (LPAREN expression (COMMA expression)* RPAREN)) # FunctionApplicationExpr
| expression bitOperator expression # BitExpr
| expression factorOperator expression # FactorExpr
| expression termOperator expression # TermExpr
| expression comparisonOperator expression # ComparisonExpr
| expression AND expression # ConjunctionExpr
| expression OR expression # DisjunctionExpr
| THROW LT typeExprInAnnotation GT expression # ThrowExpr
| IF expression THEN expression ELSE expression # IfElseExpr
| MATCH expression WITH patternToExpr+ # MatchExpr
| LBRACE argumentDeclarations ARROW expression RBRACE # FunExpr
| TRY expression CATCH LowerIdentifier expression # TryCatchExpr
| VAL (LowerIdentifier | WILDCARD) ASSIGN expression SEMICOLON expression # LetExpr
;
constructor
: (UpperIdentifier DOT)+ UpperIdentifier genericsSpecialization?
# NoArgVariantConstructor
| (UpperIdentifier DOT)+ UpperIdentifier WITH LPAREN expression RPAREN
# OneArgVariantConstructor
| (UpperIdentifier DOT)* UpperIdentifier LBRACE
structConstructorValueDeclaration (SEMICOLON structConstructorValueDeclaration)*
SEMICOLON?
RBRACE
# StructConstructor
| LBRACE
expression WITH
structConstructorValueDeclaration (SEMICOLON structConstructorValueDeclaration)*
SEMICOLON?
RBRACE
# StructWithConstructor
;
structConstructorValueDeclaration : LowerIdentifier ASSIGN expression;
pattern
: UpperIdentifier (LowerIdentifier | WILDCARD)? # VariantPattern
| LowerIdentifier # VariablePattern
| WILDCARD # WildcardPattern
;
// Operator collections
bitOperator : SHL | SHR | USHR | XOR | LAND | LOR;
factorOperator : MUL | DIV | MOD | F_MUL | F_DIV;
termOperator : PLUS | MINUS | F_PLUS | F_MINUS | STR_CONCAT;
comparisonOperator : LT | LE | GT | GE | STRUCT_EQ | STRUCT_NE;
// Literal collections
literal
: UNIT
| IntegerLiteral
| FloatingPointLiteral
| CharacterLiteral
| StringLiteral
| BooleanLiteral
;
|
worker/deps/openssl/config/archs/VC-WIN64A/asm_avx2/crypto/sha/sha1-mb-x86_64.asm | vanga-top/mediasoup | 1,666 | 175122 | default rel
%define XMMWORD
%define YMMWORD
%define ZMMWORD
section .text code align=64
EXTERN OPENSSL_ia32cap_P
global sha1_multi_block
ALIGN 32
sha1_multi_block:
mov QWORD[8+rsp],rdi ;WIN64 prologue
mov QWORD[16+rsp],rsi
mov rax,rsp
$L$SEH_begin_sha1_multi_block:
mov rdi,rcx
mov rsi,rdx
mov rdx,r8
mov rcx,QWORD[((OPENSSL_ia32cap_P+4))]
bt rcx,61
jc NEAR _shaext_shortcut
test ecx,268435456
jnz NEAR _avx_shortcut
mov rax,rsp
push rbx
push rbp
lea rsp,[((-168))+rsp]
movaps XMMWORD[rsp],xmm6
movaps XMMWORD[16+rsp],xmm7
movaps XMMWORD[32+rsp],xmm8
movaps XMMWORD[48+rsp],xmm9
movaps XMMWORD[(-120)+rax],xmm10
movaps XMMWORD[(-104)+rax],xmm11
movaps XMMWORD[(-88)+rax],xmm12
movaps XMMWORD[(-72)+rax],xmm13
movaps XMMWORD[(-56)+rax],xmm14
movaps XMMWORD[(-40)+rax],xmm15
sub rsp,288
and rsp,-256
mov QWORD[272+rsp],rax
$L$body:
lea rbp,[K_XX_XX]
lea rbx,[256+rsp]
$L$oop_grande:
mov DWORD[280+rsp],edx
xor edx,edx
mov r8,QWORD[rsi]
mov ecx,DWORD[8+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[rbx],ecx
cmovle r8,rbp
mov r9,QWORD[16+rsi]
mov ecx,DWORD[24+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[4+rbx],ecx
cmovle r9,rbp
mov r10,QWORD[32+rsi]
mov ecx,DWORD[40+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[8+rbx],ecx
cmovle r10,rbp
mov r11,QWORD[48+rsi]
mov ecx,DWORD[56+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[12+rbx],ecx
cmovle r11,rbp
test edx,edx
jz NEAR $L$done
movdqu xmm10,XMMWORD[rdi]
lea rax,[128+rsp]
movdqu xmm11,XMMWORD[32+rdi]
movdqu xmm12,XMMWORD[64+rdi]
movdqu xmm13,XMMWORD[96+rdi]
movdqu xmm14,XMMWORD[128+rdi]
movdqa xmm5,XMMWORD[96+rbp]
movdqa xmm15,XMMWORD[((-32))+rbp]
jmp NEAR $L$oop
ALIGN 32
$L$oop:
movd xmm0,DWORD[r8]
lea r8,[64+r8]
movd xmm2,DWORD[r9]
lea r9,[64+r9]
movd xmm3,DWORD[r10]
lea r10,[64+r10]
movd xmm4,DWORD[r11]
lea r11,[64+r11]
punpckldq xmm0,xmm3
movd xmm1,DWORD[((-60))+r8]
punpckldq xmm2,xmm4
movd xmm9,DWORD[((-60))+r9]
punpckldq xmm0,xmm2
movd xmm8,DWORD[((-60))+r10]
DB 102,15,56,0,197
movd xmm7,DWORD[((-60))+r11]
punpckldq xmm1,xmm8
movdqa xmm8,xmm10
paddd xmm14,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm11
movdqa xmm6,xmm11
pslld xmm8,5
pandn xmm7,xmm13
pand xmm6,xmm12
punpckldq xmm1,xmm9
movdqa xmm9,xmm10
movdqa XMMWORD[(0-128)+rax],xmm0
paddd xmm14,xmm0
movd xmm2,DWORD[((-56))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm11
por xmm8,xmm9
movd xmm9,DWORD[((-56))+r9]
pslld xmm7,30
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
DB 102,15,56,0,205
movd xmm8,DWORD[((-56))+r10]
por xmm11,xmm7
movd xmm7,DWORD[((-56))+r11]
punpckldq xmm2,xmm8
movdqa xmm8,xmm14
paddd xmm13,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm10
movdqa xmm6,xmm10
pslld xmm8,5
pandn xmm7,xmm12
pand xmm6,xmm11
punpckldq xmm2,xmm9
movdqa xmm9,xmm14
movdqa XMMWORD[(16-128)+rax],xmm1
paddd xmm13,xmm1
movd xmm3,DWORD[((-52))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm10
por xmm8,xmm9
movd xmm9,DWORD[((-52))+r9]
pslld xmm7,30
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
DB 102,15,56,0,213
movd xmm8,DWORD[((-52))+r10]
por xmm10,xmm7
movd xmm7,DWORD[((-52))+r11]
punpckldq xmm3,xmm8
movdqa xmm8,xmm13
paddd xmm12,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm14
movdqa xmm6,xmm14
pslld xmm8,5
pandn xmm7,xmm11
pand xmm6,xmm10
punpckldq xmm3,xmm9
movdqa xmm9,xmm13
movdqa XMMWORD[(32-128)+rax],xmm2
paddd xmm12,xmm2
movd xmm4,DWORD[((-48))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm14
por xmm8,xmm9
movd xmm9,DWORD[((-48))+r9]
pslld xmm7,30
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
DB 102,15,56,0,221
movd xmm8,DWORD[((-48))+r10]
por xmm14,xmm7
movd xmm7,DWORD[((-48))+r11]
punpckldq xmm4,xmm8
movdqa xmm8,xmm12
paddd xmm11,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm13
movdqa xmm6,xmm13
pslld xmm8,5
pandn xmm7,xmm10
pand xmm6,xmm14
punpckldq xmm4,xmm9
movdqa xmm9,xmm12
movdqa XMMWORD[(48-128)+rax],xmm3
paddd xmm11,xmm3
movd xmm0,DWORD[((-44))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm13
por xmm8,xmm9
movd xmm9,DWORD[((-44))+r9]
pslld xmm7,30
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
DB 102,15,56,0,229
movd xmm8,DWORD[((-44))+r10]
por xmm13,xmm7
movd xmm7,DWORD[((-44))+r11]
punpckldq xmm0,xmm8
movdqa xmm8,xmm11
paddd xmm10,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm12
movdqa xmm6,xmm12
pslld xmm8,5
pandn xmm7,xmm14
pand xmm6,xmm13
punpckldq xmm0,xmm9
movdqa xmm9,xmm11
movdqa XMMWORD[(64-128)+rax],xmm4
paddd xmm10,xmm4
movd xmm1,DWORD[((-40))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm12
por xmm8,xmm9
movd xmm9,DWORD[((-40))+r9]
pslld xmm7,30
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
DB 102,15,56,0,197
movd xmm8,DWORD[((-40))+r10]
por xmm12,xmm7
movd xmm7,DWORD[((-40))+r11]
punpckldq xmm1,xmm8
movdqa xmm8,xmm10
paddd xmm14,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm11
movdqa xmm6,xmm11
pslld xmm8,5
pandn xmm7,xmm13
pand xmm6,xmm12
punpckldq xmm1,xmm9
movdqa xmm9,xmm10
movdqa XMMWORD[(80-128)+rax],xmm0
paddd xmm14,xmm0
movd xmm2,DWORD[((-36))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm11
por xmm8,xmm9
movd xmm9,DWORD[((-36))+r9]
pslld xmm7,30
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
DB 102,15,56,0,205
movd xmm8,DWORD[((-36))+r10]
por xmm11,xmm7
movd xmm7,DWORD[((-36))+r11]
punpckldq xmm2,xmm8
movdqa xmm8,xmm14
paddd xmm13,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm10
movdqa xmm6,xmm10
pslld xmm8,5
pandn xmm7,xmm12
pand xmm6,xmm11
punpckldq xmm2,xmm9
movdqa xmm9,xmm14
movdqa XMMWORD[(96-128)+rax],xmm1
paddd xmm13,xmm1
movd xmm3,DWORD[((-32))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm10
por xmm8,xmm9
movd xmm9,DWORD[((-32))+r9]
pslld xmm7,30
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
DB 102,15,56,0,213
movd xmm8,DWORD[((-32))+r10]
por xmm10,xmm7
movd xmm7,DWORD[((-32))+r11]
punpckldq xmm3,xmm8
movdqa xmm8,xmm13
paddd xmm12,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm14
movdqa xmm6,xmm14
pslld xmm8,5
pandn xmm7,xmm11
pand xmm6,xmm10
punpckldq xmm3,xmm9
movdqa xmm9,xmm13
movdqa XMMWORD[(112-128)+rax],xmm2
paddd xmm12,xmm2
movd xmm4,DWORD[((-28))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm14
por xmm8,xmm9
movd xmm9,DWORD[((-28))+r9]
pslld xmm7,30
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
DB 102,15,56,0,221
movd xmm8,DWORD[((-28))+r10]
por xmm14,xmm7
movd xmm7,DWORD[((-28))+r11]
punpckldq xmm4,xmm8
movdqa xmm8,xmm12
paddd xmm11,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm13
movdqa xmm6,xmm13
pslld xmm8,5
pandn xmm7,xmm10
pand xmm6,xmm14
punpckldq xmm4,xmm9
movdqa xmm9,xmm12
movdqa XMMWORD[(128-128)+rax],xmm3
paddd xmm11,xmm3
movd xmm0,DWORD[((-24))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm13
por xmm8,xmm9
movd xmm9,DWORD[((-24))+r9]
pslld xmm7,30
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
DB 102,15,56,0,229
movd xmm8,DWORD[((-24))+r10]
por xmm13,xmm7
movd xmm7,DWORD[((-24))+r11]
punpckldq xmm0,xmm8
movdqa xmm8,xmm11
paddd xmm10,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm12
movdqa xmm6,xmm12
pslld xmm8,5
pandn xmm7,xmm14
pand xmm6,xmm13
punpckldq xmm0,xmm9
movdqa xmm9,xmm11
movdqa XMMWORD[(144-128)+rax],xmm4
paddd xmm10,xmm4
movd xmm1,DWORD[((-20))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm12
por xmm8,xmm9
movd xmm9,DWORD[((-20))+r9]
pslld xmm7,30
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
DB 102,15,56,0,197
movd xmm8,DWORD[((-20))+r10]
por xmm12,xmm7
movd xmm7,DWORD[((-20))+r11]
punpckldq xmm1,xmm8
movdqa xmm8,xmm10
paddd xmm14,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm11
movdqa xmm6,xmm11
pslld xmm8,5
pandn xmm7,xmm13
pand xmm6,xmm12
punpckldq xmm1,xmm9
movdqa xmm9,xmm10
movdqa XMMWORD[(160-128)+rax],xmm0
paddd xmm14,xmm0
movd xmm2,DWORD[((-16))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm11
por xmm8,xmm9
movd xmm9,DWORD[((-16))+r9]
pslld xmm7,30
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
DB 102,15,56,0,205
movd xmm8,DWORD[((-16))+r10]
por xmm11,xmm7
movd xmm7,DWORD[((-16))+r11]
punpckldq xmm2,xmm8
movdqa xmm8,xmm14
paddd xmm13,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm10
movdqa xmm6,xmm10
pslld xmm8,5
pandn xmm7,xmm12
pand xmm6,xmm11
punpckldq xmm2,xmm9
movdqa xmm9,xmm14
movdqa XMMWORD[(176-128)+rax],xmm1
paddd xmm13,xmm1
movd xmm3,DWORD[((-12))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm10
por xmm8,xmm9
movd xmm9,DWORD[((-12))+r9]
pslld xmm7,30
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
DB 102,15,56,0,213
movd xmm8,DWORD[((-12))+r10]
por xmm10,xmm7
movd xmm7,DWORD[((-12))+r11]
punpckldq xmm3,xmm8
movdqa xmm8,xmm13
paddd xmm12,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm14
movdqa xmm6,xmm14
pslld xmm8,5
pandn xmm7,xmm11
pand xmm6,xmm10
punpckldq xmm3,xmm9
movdqa xmm9,xmm13
movdqa XMMWORD[(192-128)+rax],xmm2
paddd xmm12,xmm2
movd xmm4,DWORD[((-8))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm14
por xmm8,xmm9
movd xmm9,DWORD[((-8))+r9]
pslld xmm7,30
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
DB 102,15,56,0,221
movd xmm8,DWORD[((-8))+r10]
por xmm14,xmm7
movd xmm7,DWORD[((-8))+r11]
punpckldq xmm4,xmm8
movdqa xmm8,xmm12
paddd xmm11,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm13
movdqa xmm6,xmm13
pslld xmm8,5
pandn xmm7,xmm10
pand xmm6,xmm14
punpckldq xmm4,xmm9
movdqa xmm9,xmm12
movdqa XMMWORD[(208-128)+rax],xmm3
paddd xmm11,xmm3
movd xmm0,DWORD[((-4))+r8]
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm13
por xmm8,xmm9
movd xmm9,DWORD[((-4))+r9]
pslld xmm7,30
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
DB 102,15,56,0,229
movd xmm8,DWORD[((-4))+r10]
por xmm13,xmm7
movdqa xmm1,XMMWORD[((0-128))+rax]
movd xmm7,DWORD[((-4))+r11]
punpckldq xmm0,xmm8
movdqa xmm8,xmm11
paddd xmm10,xmm15
punpckldq xmm9,xmm7
movdqa xmm7,xmm12
movdqa xmm6,xmm12
pslld xmm8,5
prefetcht0 [63+r8]
pandn xmm7,xmm14
pand xmm6,xmm13
punpckldq xmm0,xmm9
movdqa xmm9,xmm11
movdqa XMMWORD[(224-128)+rax],xmm4
paddd xmm10,xmm4
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm12
prefetcht0 [63+r9]
por xmm8,xmm9
pslld xmm7,30
paddd xmm10,xmm6
prefetcht0 [63+r10]
psrld xmm12,2
paddd xmm10,xmm8
DB 102,15,56,0,197
prefetcht0 [63+r11]
por xmm12,xmm7
movdqa xmm2,XMMWORD[((16-128))+rax]
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((32-128))+rax]
movdqa xmm8,xmm10
pxor xmm1,XMMWORD[((128-128))+rax]
paddd xmm14,xmm15
movdqa xmm7,xmm11
pslld xmm8,5
pxor xmm1,xmm3
movdqa xmm6,xmm11
pandn xmm7,xmm13
movdqa xmm5,xmm1
pand xmm6,xmm12
movdqa xmm9,xmm10
psrld xmm5,31
paddd xmm1,xmm1
movdqa XMMWORD[(240-128)+rax],xmm0
paddd xmm14,xmm0
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm11
por xmm8,xmm9
pslld xmm7,30
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((48-128))+rax]
movdqa xmm8,xmm14
pxor xmm2,XMMWORD[((144-128))+rax]
paddd xmm13,xmm15
movdqa xmm7,xmm10
pslld xmm8,5
pxor xmm2,xmm4
movdqa xmm6,xmm10
pandn xmm7,xmm12
movdqa xmm5,xmm2
pand xmm6,xmm11
movdqa xmm9,xmm14
psrld xmm5,31
paddd xmm2,xmm2
movdqa XMMWORD[(0-128)+rax],xmm1
paddd xmm13,xmm1
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm10
por xmm8,xmm9
pslld xmm7,30
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((64-128))+rax]
movdqa xmm8,xmm13
pxor xmm3,XMMWORD[((160-128))+rax]
paddd xmm12,xmm15
movdqa xmm7,xmm14
pslld xmm8,5
pxor xmm3,xmm0
movdqa xmm6,xmm14
pandn xmm7,xmm11
movdqa xmm5,xmm3
pand xmm6,xmm10
movdqa xmm9,xmm13
psrld xmm5,31
paddd xmm3,xmm3
movdqa XMMWORD[(16-128)+rax],xmm2
paddd xmm12,xmm2
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm14
por xmm8,xmm9
pslld xmm7,30
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((80-128))+rax]
movdqa xmm8,xmm12
pxor xmm4,XMMWORD[((176-128))+rax]
paddd xmm11,xmm15
movdqa xmm7,xmm13
pslld xmm8,5
pxor xmm4,xmm1
movdqa xmm6,xmm13
pandn xmm7,xmm10
movdqa xmm5,xmm4
pand xmm6,xmm14
movdqa xmm9,xmm12
psrld xmm5,31
paddd xmm4,xmm4
movdqa XMMWORD[(32-128)+rax],xmm3
paddd xmm11,xmm3
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm13
por xmm8,xmm9
pslld xmm7,30
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((96-128))+rax]
movdqa xmm8,xmm11
pxor xmm0,XMMWORD[((192-128))+rax]
paddd xmm10,xmm15
movdqa xmm7,xmm12
pslld xmm8,5
pxor xmm0,xmm2
movdqa xmm6,xmm12
pandn xmm7,xmm14
movdqa xmm5,xmm0
pand xmm6,xmm13
movdqa xmm9,xmm11
psrld xmm5,31
paddd xmm0,xmm0
movdqa XMMWORD[(48-128)+rax],xmm4
paddd xmm10,xmm4
psrld xmm9,27
pxor xmm6,xmm7
movdqa xmm7,xmm12
por xmm8,xmm9
pslld xmm7,30
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
movdqa xmm15,XMMWORD[rbp]
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((112-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((208-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
movdqa XMMWORD[(64-128)+rax],xmm0
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((128-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((224-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
movdqa XMMWORD[(80-128)+rax],xmm1
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((144-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((240-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
movdqa XMMWORD[(96-128)+rax],xmm2
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((160-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((0-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
movdqa XMMWORD[(112-128)+rax],xmm3
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((176-128))+rax]
movdqa xmm8,xmm11
movdqa xmm6,xmm14
pxor xmm0,XMMWORD[((16-128))+rax]
paddd xmm10,xmm15
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
movdqa XMMWORD[(128-128)+rax],xmm4
paddd xmm10,xmm4
pxor xmm0,xmm2
psrld xmm9,27
pxor xmm6,xmm13
movdqa xmm7,xmm12
pslld xmm7,30
movdqa xmm5,xmm0
por xmm8,xmm9
psrld xmm5,31
paddd xmm10,xmm6
paddd xmm0,xmm0
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((192-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((32-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
movdqa XMMWORD[(144-128)+rax],xmm0
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((208-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((48-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
movdqa XMMWORD[(160-128)+rax],xmm1
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((224-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((64-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
movdqa XMMWORD[(176-128)+rax],xmm2
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((240-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((80-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
movdqa XMMWORD[(192-128)+rax],xmm3
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((0-128))+rax]
movdqa xmm8,xmm11
movdqa xmm6,xmm14
pxor xmm0,XMMWORD[((96-128))+rax]
paddd xmm10,xmm15
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
movdqa XMMWORD[(208-128)+rax],xmm4
paddd xmm10,xmm4
pxor xmm0,xmm2
psrld xmm9,27
pxor xmm6,xmm13
movdqa xmm7,xmm12
pslld xmm7,30
movdqa xmm5,xmm0
por xmm8,xmm9
psrld xmm5,31
paddd xmm10,xmm6
paddd xmm0,xmm0
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((16-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((112-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
movdqa XMMWORD[(224-128)+rax],xmm0
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((32-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((128-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
movdqa XMMWORD[(240-128)+rax],xmm1
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((48-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((144-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
movdqa XMMWORD[(0-128)+rax],xmm2
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((64-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((160-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
movdqa XMMWORD[(16-128)+rax],xmm3
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((80-128))+rax]
movdqa xmm8,xmm11
movdqa xmm6,xmm14
pxor xmm0,XMMWORD[((176-128))+rax]
paddd xmm10,xmm15
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
movdqa XMMWORD[(32-128)+rax],xmm4
paddd xmm10,xmm4
pxor xmm0,xmm2
psrld xmm9,27
pxor xmm6,xmm13
movdqa xmm7,xmm12
pslld xmm7,30
movdqa xmm5,xmm0
por xmm8,xmm9
psrld xmm5,31
paddd xmm10,xmm6
paddd xmm0,xmm0
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((96-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((192-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
movdqa XMMWORD[(48-128)+rax],xmm0
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((112-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((208-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
movdqa XMMWORD[(64-128)+rax],xmm1
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((128-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((224-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
movdqa XMMWORD[(80-128)+rax],xmm2
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((144-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((240-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
movdqa XMMWORD[(96-128)+rax],xmm3
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((160-128))+rax]
movdqa xmm8,xmm11
movdqa xmm6,xmm14
pxor xmm0,XMMWORD[((0-128))+rax]
paddd xmm10,xmm15
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
movdqa XMMWORD[(112-128)+rax],xmm4
paddd xmm10,xmm4
pxor xmm0,xmm2
psrld xmm9,27
pxor xmm6,xmm13
movdqa xmm7,xmm12
pslld xmm7,30
movdqa xmm5,xmm0
por xmm8,xmm9
psrld xmm5,31
paddd xmm10,xmm6
paddd xmm0,xmm0
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
movdqa xmm15,XMMWORD[32+rbp]
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((176-128))+rax]
movdqa xmm8,xmm10
movdqa xmm7,xmm13
pxor xmm1,XMMWORD[((16-128))+rax]
pxor xmm1,xmm3
paddd xmm14,xmm15
pslld xmm8,5
movdqa xmm9,xmm10
pand xmm7,xmm12
movdqa xmm6,xmm13
movdqa xmm5,xmm1
psrld xmm9,27
paddd xmm14,xmm7
pxor xmm6,xmm12
movdqa XMMWORD[(128-128)+rax],xmm0
paddd xmm14,xmm0
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm11
movdqa xmm7,xmm11
pslld xmm7,30
paddd xmm1,xmm1
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((192-128))+rax]
movdqa xmm8,xmm14
movdqa xmm7,xmm12
pxor xmm2,XMMWORD[((32-128))+rax]
pxor xmm2,xmm4
paddd xmm13,xmm15
pslld xmm8,5
movdqa xmm9,xmm14
pand xmm7,xmm11
movdqa xmm6,xmm12
movdqa xmm5,xmm2
psrld xmm9,27
paddd xmm13,xmm7
pxor xmm6,xmm11
movdqa XMMWORD[(144-128)+rax],xmm1
paddd xmm13,xmm1
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm10
movdqa xmm7,xmm10
pslld xmm7,30
paddd xmm2,xmm2
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((208-128))+rax]
movdqa xmm8,xmm13
movdqa xmm7,xmm11
pxor xmm3,XMMWORD[((48-128))+rax]
pxor xmm3,xmm0
paddd xmm12,xmm15
pslld xmm8,5
movdqa xmm9,xmm13
pand xmm7,xmm10
movdqa xmm6,xmm11
movdqa xmm5,xmm3
psrld xmm9,27
paddd xmm12,xmm7
pxor xmm6,xmm10
movdqa XMMWORD[(160-128)+rax],xmm2
paddd xmm12,xmm2
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm14
movdqa xmm7,xmm14
pslld xmm7,30
paddd xmm3,xmm3
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((224-128))+rax]
movdqa xmm8,xmm12
movdqa xmm7,xmm10
pxor xmm4,XMMWORD[((64-128))+rax]
pxor xmm4,xmm1
paddd xmm11,xmm15
pslld xmm8,5
movdqa xmm9,xmm12
pand xmm7,xmm14
movdqa xmm6,xmm10
movdqa xmm5,xmm4
psrld xmm9,27
paddd xmm11,xmm7
pxor xmm6,xmm14
movdqa XMMWORD[(176-128)+rax],xmm3
paddd xmm11,xmm3
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm13
movdqa xmm7,xmm13
pslld xmm7,30
paddd xmm4,xmm4
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((240-128))+rax]
movdqa xmm8,xmm11
movdqa xmm7,xmm14
pxor xmm0,XMMWORD[((80-128))+rax]
pxor xmm0,xmm2
paddd xmm10,xmm15
pslld xmm8,5
movdqa xmm9,xmm11
pand xmm7,xmm13
movdqa xmm6,xmm14
movdqa xmm5,xmm0
psrld xmm9,27
paddd xmm10,xmm7
pxor xmm6,xmm13
movdqa XMMWORD[(192-128)+rax],xmm4
paddd xmm10,xmm4
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm12
movdqa xmm7,xmm12
pslld xmm7,30
paddd xmm0,xmm0
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((0-128))+rax]
movdqa xmm8,xmm10
movdqa xmm7,xmm13
pxor xmm1,XMMWORD[((96-128))+rax]
pxor xmm1,xmm3
paddd xmm14,xmm15
pslld xmm8,5
movdqa xmm9,xmm10
pand xmm7,xmm12
movdqa xmm6,xmm13
movdqa xmm5,xmm1
psrld xmm9,27
paddd xmm14,xmm7
pxor xmm6,xmm12
movdqa XMMWORD[(208-128)+rax],xmm0
paddd xmm14,xmm0
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm11
movdqa xmm7,xmm11
pslld xmm7,30
paddd xmm1,xmm1
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((16-128))+rax]
movdqa xmm8,xmm14
movdqa xmm7,xmm12
pxor xmm2,XMMWORD[((112-128))+rax]
pxor xmm2,xmm4
paddd xmm13,xmm15
pslld xmm8,5
movdqa xmm9,xmm14
pand xmm7,xmm11
movdqa xmm6,xmm12
movdqa xmm5,xmm2
psrld xmm9,27
paddd xmm13,xmm7
pxor xmm6,xmm11
movdqa XMMWORD[(224-128)+rax],xmm1
paddd xmm13,xmm1
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm10
movdqa xmm7,xmm10
pslld xmm7,30
paddd xmm2,xmm2
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((32-128))+rax]
movdqa xmm8,xmm13
movdqa xmm7,xmm11
pxor xmm3,XMMWORD[((128-128))+rax]
pxor xmm3,xmm0
paddd xmm12,xmm15
pslld xmm8,5
movdqa xmm9,xmm13
pand xmm7,xmm10
movdqa xmm6,xmm11
movdqa xmm5,xmm3
psrld xmm9,27
paddd xmm12,xmm7
pxor xmm6,xmm10
movdqa XMMWORD[(240-128)+rax],xmm2
paddd xmm12,xmm2
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm14
movdqa xmm7,xmm14
pslld xmm7,30
paddd xmm3,xmm3
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((48-128))+rax]
movdqa xmm8,xmm12
movdqa xmm7,xmm10
pxor xmm4,XMMWORD[((144-128))+rax]
pxor xmm4,xmm1
paddd xmm11,xmm15
pslld xmm8,5
movdqa xmm9,xmm12
pand xmm7,xmm14
movdqa xmm6,xmm10
movdqa xmm5,xmm4
psrld xmm9,27
paddd xmm11,xmm7
pxor xmm6,xmm14
movdqa XMMWORD[(0-128)+rax],xmm3
paddd xmm11,xmm3
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm13
movdqa xmm7,xmm13
pslld xmm7,30
paddd xmm4,xmm4
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((64-128))+rax]
movdqa xmm8,xmm11
movdqa xmm7,xmm14
pxor xmm0,XMMWORD[((160-128))+rax]
pxor xmm0,xmm2
paddd xmm10,xmm15
pslld xmm8,5
movdqa xmm9,xmm11
pand xmm7,xmm13
movdqa xmm6,xmm14
movdqa xmm5,xmm0
psrld xmm9,27
paddd xmm10,xmm7
pxor xmm6,xmm13
movdqa XMMWORD[(16-128)+rax],xmm4
paddd xmm10,xmm4
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm12
movdqa xmm7,xmm12
pslld xmm7,30
paddd xmm0,xmm0
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((80-128))+rax]
movdqa xmm8,xmm10
movdqa xmm7,xmm13
pxor xmm1,XMMWORD[((176-128))+rax]
pxor xmm1,xmm3
paddd xmm14,xmm15
pslld xmm8,5
movdqa xmm9,xmm10
pand xmm7,xmm12
movdqa xmm6,xmm13
movdqa xmm5,xmm1
psrld xmm9,27
paddd xmm14,xmm7
pxor xmm6,xmm12
movdqa XMMWORD[(32-128)+rax],xmm0
paddd xmm14,xmm0
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm11
movdqa xmm7,xmm11
pslld xmm7,30
paddd xmm1,xmm1
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((96-128))+rax]
movdqa xmm8,xmm14
movdqa xmm7,xmm12
pxor xmm2,XMMWORD[((192-128))+rax]
pxor xmm2,xmm4
paddd xmm13,xmm15
pslld xmm8,5
movdqa xmm9,xmm14
pand xmm7,xmm11
movdqa xmm6,xmm12
movdqa xmm5,xmm2
psrld xmm9,27
paddd xmm13,xmm7
pxor xmm6,xmm11
movdqa XMMWORD[(48-128)+rax],xmm1
paddd xmm13,xmm1
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm10
movdqa xmm7,xmm10
pslld xmm7,30
paddd xmm2,xmm2
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((112-128))+rax]
movdqa xmm8,xmm13
movdqa xmm7,xmm11
pxor xmm3,XMMWORD[((208-128))+rax]
pxor xmm3,xmm0
paddd xmm12,xmm15
pslld xmm8,5
movdqa xmm9,xmm13
pand xmm7,xmm10
movdqa xmm6,xmm11
movdqa xmm5,xmm3
psrld xmm9,27
paddd xmm12,xmm7
pxor xmm6,xmm10
movdqa XMMWORD[(64-128)+rax],xmm2
paddd xmm12,xmm2
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm14
movdqa xmm7,xmm14
pslld xmm7,30
paddd xmm3,xmm3
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((128-128))+rax]
movdqa xmm8,xmm12
movdqa xmm7,xmm10
pxor xmm4,XMMWORD[((224-128))+rax]
pxor xmm4,xmm1
paddd xmm11,xmm15
pslld xmm8,5
movdqa xmm9,xmm12
pand xmm7,xmm14
movdqa xmm6,xmm10
movdqa xmm5,xmm4
psrld xmm9,27
paddd xmm11,xmm7
pxor xmm6,xmm14
movdqa XMMWORD[(80-128)+rax],xmm3
paddd xmm11,xmm3
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm13
movdqa xmm7,xmm13
pslld xmm7,30
paddd xmm4,xmm4
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((144-128))+rax]
movdqa xmm8,xmm11
movdqa xmm7,xmm14
pxor xmm0,XMMWORD[((240-128))+rax]
pxor xmm0,xmm2
paddd xmm10,xmm15
pslld xmm8,5
movdqa xmm9,xmm11
pand xmm7,xmm13
movdqa xmm6,xmm14
movdqa xmm5,xmm0
psrld xmm9,27
paddd xmm10,xmm7
pxor xmm6,xmm13
movdqa XMMWORD[(96-128)+rax],xmm4
paddd xmm10,xmm4
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm12
movdqa xmm7,xmm12
pslld xmm7,30
paddd xmm0,xmm0
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((160-128))+rax]
movdqa xmm8,xmm10
movdqa xmm7,xmm13
pxor xmm1,XMMWORD[((0-128))+rax]
pxor xmm1,xmm3
paddd xmm14,xmm15
pslld xmm8,5
movdqa xmm9,xmm10
pand xmm7,xmm12
movdqa xmm6,xmm13
movdqa xmm5,xmm1
psrld xmm9,27
paddd xmm14,xmm7
pxor xmm6,xmm12
movdqa XMMWORD[(112-128)+rax],xmm0
paddd xmm14,xmm0
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm11
movdqa xmm7,xmm11
pslld xmm7,30
paddd xmm1,xmm1
paddd xmm14,xmm6
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((176-128))+rax]
movdqa xmm8,xmm14
movdqa xmm7,xmm12
pxor xmm2,XMMWORD[((16-128))+rax]
pxor xmm2,xmm4
paddd xmm13,xmm15
pslld xmm8,5
movdqa xmm9,xmm14
pand xmm7,xmm11
movdqa xmm6,xmm12
movdqa xmm5,xmm2
psrld xmm9,27
paddd xmm13,xmm7
pxor xmm6,xmm11
movdqa XMMWORD[(128-128)+rax],xmm1
paddd xmm13,xmm1
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm10
movdqa xmm7,xmm10
pslld xmm7,30
paddd xmm2,xmm2
paddd xmm13,xmm6
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((192-128))+rax]
movdqa xmm8,xmm13
movdqa xmm7,xmm11
pxor xmm3,XMMWORD[((32-128))+rax]
pxor xmm3,xmm0
paddd xmm12,xmm15
pslld xmm8,5
movdqa xmm9,xmm13
pand xmm7,xmm10
movdqa xmm6,xmm11
movdqa xmm5,xmm3
psrld xmm9,27
paddd xmm12,xmm7
pxor xmm6,xmm10
movdqa XMMWORD[(144-128)+rax],xmm2
paddd xmm12,xmm2
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm14
movdqa xmm7,xmm14
pslld xmm7,30
paddd xmm3,xmm3
paddd xmm12,xmm6
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((208-128))+rax]
movdqa xmm8,xmm12
movdqa xmm7,xmm10
pxor xmm4,XMMWORD[((48-128))+rax]
pxor xmm4,xmm1
paddd xmm11,xmm15
pslld xmm8,5
movdqa xmm9,xmm12
pand xmm7,xmm14
movdqa xmm6,xmm10
movdqa xmm5,xmm4
psrld xmm9,27
paddd xmm11,xmm7
pxor xmm6,xmm14
movdqa XMMWORD[(160-128)+rax],xmm3
paddd xmm11,xmm3
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm13
movdqa xmm7,xmm13
pslld xmm7,30
paddd xmm4,xmm4
paddd xmm11,xmm6
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((224-128))+rax]
movdqa xmm8,xmm11
movdqa xmm7,xmm14
pxor xmm0,XMMWORD[((64-128))+rax]
pxor xmm0,xmm2
paddd xmm10,xmm15
pslld xmm8,5
movdqa xmm9,xmm11
pand xmm7,xmm13
movdqa xmm6,xmm14
movdqa xmm5,xmm0
psrld xmm9,27
paddd xmm10,xmm7
pxor xmm6,xmm13
movdqa XMMWORD[(176-128)+rax],xmm4
paddd xmm10,xmm4
por xmm8,xmm9
psrld xmm5,31
pand xmm6,xmm12
movdqa xmm7,xmm12
pslld xmm7,30
paddd xmm0,xmm0
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
movdqa xmm15,XMMWORD[64+rbp]
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((240-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((80-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
movdqa XMMWORD[(192-128)+rax],xmm0
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((0-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((96-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
movdqa XMMWORD[(208-128)+rax],xmm1
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((16-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((112-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
movdqa XMMWORD[(224-128)+rax],xmm2
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((32-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((128-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
movdqa XMMWORD[(240-128)+rax],xmm3
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((48-128))+rax]
movdqa xmm8,xmm11
movdqa xmm6,xmm14
pxor xmm0,XMMWORD[((144-128))+rax]
paddd xmm10,xmm15
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
movdqa XMMWORD[(0-128)+rax],xmm4
paddd xmm10,xmm4
pxor xmm0,xmm2
psrld xmm9,27
pxor xmm6,xmm13
movdqa xmm7,xmm12
pslld xmm7,30
movdqa xmm5,xmm0
por xmm8,xmm9
psrld xmm5,31
paddd xmm10,xmm6
paddd xmm0,xmm0
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((64-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((160-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
movdqa XMMWORD[(16-128)+rax],xmm0
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((80-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((176-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
movdqa XMMWORD[(32-128)+rax],xmm1
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((96-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((192-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
movdqa XMMWORD[(48-128)+rax],xmm2
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((112-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((208-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
movdqa XMMWORD[(64-128)+rax],xmm3
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((128-128))+rax]
movdqa xmm8,xmm11
movdqa xmm6,xmm14
pxor xmm0,XMMWORD[((224-128))+rax]
paddd xmm10,xmm15
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
movdqa XMMWORD[(80-128)+rax],xmm4
paddd xmm10,xmm4
pxor xmm0,xmm2
psrld xmm9,27
pxor xmm6,xmm13
movdqa xmm7,xmm12
pslld xmm7,30
movdqa xmm5,xmm0
por xmm8,xmm9
psrld xmm5,31
paddd xmm10,xmm6
paddd xmm0,xmm0
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((144-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((240-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
movdqa XMMWORD[(96-128)+rax],xmm0
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((160-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((0-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
movdqa XMMWORD[(112-128)+rax],xmm1
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((176-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((16-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((192-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((32-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
pxor xmm0,xmm2
movdqa xmm2,XMMWORD[((208-128))+rax]
movdqa xmm8,xmm11
movdqa xmm6,xmm14
pxor xmm0,XMMWORD[((48-128))+rax]
paddd xmm10,xmm15
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
paddd xmm10,xmm4
pxor xmm0,xmm2
psrld xmm9,27
pxor xmm6,xmm13
movdqa xmm7,xmm12
pslld xmm7,30
movdqa xmm5,xmm0
por xmm8,xmm9
psrld xmm5,31
paddd xmm10,xmm6
paddd xmm0,xmm0
psrld xmm12,2
paddd xmm10,xmm8
por xmm0,xmm5
por xmm12,xmm7
pxor xmm1,xmm3
movdqa xmm3,XMMWORD[((224-128))+rax]
movdqa xmm8,xmm10
movdqa xmm6,xmm13
pxor xmm1,XMMWORD[((64-128))+rax]
paddd xmm14,xmm15
pslld xmm8,5
pxor xmm6,xmm11
movdqa xmm9,xmm10
paddd xmm14,xmm0
pxor xmm1,xmm3
psrld xmm9,27
pxor xmm6,xmm12
movdqa xmm7,xmm11
pslld xmm7,30
movdqa xmm5,xmm1
por xmm8,xmm9
psrld xmm5,31
paddd xmm14,xmm6
paddd xmm1,xmm1
psrld xmm11,2
paddd xmm14,xmm8
por xmm1,xmm5
por xmm11,xmm7
pxor xmm2,xmm4
movdqa xmm4,XMMWORD[((240-128))+rax]
movdqa xmm8,xmm14
movdqa xmm6,xmm12
pxor xmm2,XMMWORD[((80-128))+rax]
paddd xmm13,xmm15
pslld xmm8,5
pxor xmm6,xmm10
movdqa xmm9,xmm14
paddd xmm13,xmm1
pxor xmm2,xmm4
psrld xmm9,27
pxor xmm6,xmm11
movdqa xmm7,xmm10
pslld xmm7,30
movdqa xmm5,xmm2
por xmm8,xmm9
psrld xmm5,31
paddd xmm13,xmm6
paddd xmm2,xmm2
psrld xmm10,2
paddd xmm13,xmm8
por xmm2,xmm5
por xmm10,xmm7
pxor xmm3,xmm0
movdqa xmm0,XMMWORD[((0-128))+rax]
movdqa xmm8,xmm13
movdqa xmm6,xmm11
pxor xmm3,XMMWORD[((96-128))+rax]
paddd xmm12,xmm15
pslld xmm8,5
pxor xmm6,xmm14
movdqa xmm9,xmm13
paddd xmm12,xmm2
pxor xmm3,xmm0
psrld xmm9,27
pxor xmm6,xmm10
movdqa xmm7,xmm14
pslld xmm7,30
movdqa xmm5,xmm3
por xmm8,xmm9
psrld xmm5,31
paddd xmm12,xmm6
paddd xmm3,xmm3
psrld xmm14,2
paddd xmm12,xmm8
por xmm3,xmm5
por xmm14,xmm7
pxor xmm4,xmm1
movdqa xmm1,XMMWORD[((16-128))+rax]
movdqa xmm8,xmm12
movdqa xmm6,xmm10
pxor xmm4,XMMWORD[((112-128))+rax]
paddd xmm11,xmm15
pslld xmm8,5
pxor xmm6,xmm13
movdqa xmm9,xmm12
paddd xmm11,xmm3
pxor xmm4,xmm1
psrld xmm9,27
pxor xmm6,xmm14
movdqa xmm7,xmm13
pslld xmm7,30
movdqa xmm5,xmm4
por xmm8,xmm9
psrld xmm5,31
paddd xmm11,xmm6
paddd xmm4,xmm4
psrld xmm13,2
paddd xmm11,xmm8
por xmm4,xmm5
por xmm13,xmm7
movdqa xmm8,xmm11
paddd xmm10,xmm15
movdqa xmm6,xmm14
pslld xmm8,5
pxor xmm6,xmm12
movdqa xmm9,xmm11
paddd xmm10,xmm4
psrld xmm9,27
movdqa xmm7,xmm12
pxor xmm6,xmm13
pslld xmm7,30
por xmm8,xmm9
paddd xmm10,xmm6
psrld xmm12,2
paddd xmm10,xmm8
por xmm12,xmm7
movdqa xmm0,XMMWORD[rbx]
mov ecx,1
cmp ecx,DWORD[rbx]
pxor xmm8,xmm8
cmovge r8,rbp
cmp ecx,DWORD[4+rbx]
movdqa xmm1,xmm0
cmovge r9,rbp
cmp ecx,DWORD[8+rbx]
pcmpgtd xmm1,xmm8
cmovge r10,rbp
cmp ecx,DWORD[12+rbx]
paddd xmm0,xmm1
cmovge r11,rbp
movdqu xmm6,XMMWORD[rdi]
pand xmm10,xmm1
movdqu xmm7,XMMWORD[32+rdi]
pand xmm11,xmm1
paddd xmm10,xmm6
movdqu xmm8,XMMWORD[64+rdi]
pand xmm12,xmm1
paddd xmm11,xmm7
movdqu xmm9,XMMWORD[96+rdi]
pand xmm13,xmm1
paddd xmm12,xmm8
movdqu xmm5,XMMWORD[128+rdi]
pand xmm14,xmm1
movdqu XMMWORD[rdi],xmm10
paddd xmm13,xmm9
movdqu XMMWORD[32+rdi],xmm11
paddd xmm14,xmm5
movdqu XMMWORD[64+rdi],xmm12
movdqu XMMWORD[96+rdi],xmm13
movdqu XMMWORD[128+rdi],xmm14
movdqa XMMWORD[rbx],xmm0
movdqa xmm5,XMMWORD[96+rbp]
movdqa xmm15,XMMWORD[((-32))+rbp]
dec edx
jnz NEAR $L$oop
mov edx,DWORD[280+rsp]
lea rdi,[16+rdi]
lea rsi,[64+rsi]
dec edx
jnz NEAR $L$oop_grande
$L$done:
mov rax,QWORD[272+rsp]
movaps xmm6,XMMWORD[((-184))+rax]
movaps xmm7,XMMWORD[((-168))+rax]
movaps xmm8,XMMWORD[((-152))+rax]
movaps xmm9,XMMWORD[((-136))+rax]
movaps xmm10,XMMWORD[((-120))+rax]
movaps xmm11,XMMWORD[((-104))+rax]
movaps xmm12,XMMWORD[((-88))+rax]
movaps xmm13,XMMWORD[((-72))+rax]
movaps xmm14,XMMWORD[((-56))+rax]
movaps xmm15,XMMWORD[((-40))+rax]
mov rbp,QWORD[((-16))+rax]
mov rbx,QWORD[((-8))+rax]
lea rsp,[rax]
$L$epilogue:
mov rdi,QWORD[8+rsp] ;WIN64 epilogue
mov rsi,QWORD[16+rsp]
DB 0F3h,0C3h ;repret
$L$SEH_end_sha1_multi_block:
ALIGN 32
sha1_multi_block_shaext:
mov QWORD[8+rsp],rdi ;WIN64 prologue
mov QWORD[16+rsp],rsi
mov rax,rsp
$L$SEH_begin_sha1_multi_block_shaext:
mov rdi,rcx
mov rsi,rdx
mov rdx,r8
_shaext_shortcut:
mov rax,rsp
push rbx
push rbp
lea rsp,[((-168))+rsp]
movaps XMMWORD[rsp],xmm6
movaps XMMWORD[16+rsp],xmm7
movaps XMMWORD[32+rsp],xmm8
movaps XMMWORD[48+rsp],xmm9
movaps XMMWORD[(-120)+rax],xmm10
movaps XMMWORD[(-104)+rax],xmm11
movaps XMMWORD[(-88)+rax],xmm12
movaps XMMWORD[(-72)+rax],xmm13
movaps XMMWORD[(-56)+rax],xmm14
movaps XMMWORD[(-40)+rax],xmm15
sub rsp,288
shl edx,1
and rsp,-256
lea rdi,[64+rdi]
mov QWORD[272+rsp],rax
$L$body_shaext:
lea rbx,[256+rsp]
movdqa xmm3,XMMWORD[((K_XX_XX+128))]
$L$oop_grande_shaext:
mov DWORD[280+rsp],edx
xor edx,edx
mov r8,QWORD[rsi]
mov ecx,DWORD[8+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[rbx],ecx
cmovle r8,rsp
mov r9,QWORD[16+rsi]
mov ecx,DWORD[24+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[4+rbx],ecx
cmovle r9,rsp
test edx,edx
jz NEAR $L$done_shaext
movq xmm0,QWORD[((0-64))+rdi]
movq xmm4,QWORD[((32-64))+rdi]
movq xmm5,QWORD[((64-64))+rdi]
movq xmm6,QWORD[((96-64))+rdi]
movq xmm7,QWORD[((128-64))+rdi]
punpckldq xmm0,xmm4
punpckldq xmm5,xmm6
movdqa xmm8,xmm0
punpcklqdq xmm0,xmm5
punpckhqdq xmm8,xmm5
pshufd xmm1,xmm7,63
pshufd xmm9,xmm7,127
pshufd xmm0,xmm0,27
pshufd xmm8,xmm8,27
jmp NEAR $L$oop_shaext
ALIGN 32
$L$oop_shaext:
movdqu xmm4,XMMWORD[r8]
movdqu xmm11,XMMWORD[r9]
movdqu xmm5,XMMWORD[16+r8]
movdqu xmm12,XMMWORD[16+r9]
movdqu xmm6,XMMWORD[32+r8]
DB 102,15,56,0,227
movdqu xmm13,XMMWORD[32+r9]
DB 102,68,15,56,0,219
movdqu xmm7,XMMWORD[48+r8]
lea r8,[64+r8]
DB 102,15,56,0,235
movdqu xmm14,XMMWORD[48+r9]
lea r9,[64+r9]
DB 102,68,15,56,0,227
movdqa XMMWORD[80+rsp],xmm1
paddd xmm1,xmm4
movdqa XMMWORD[112+rsp],xmm9
paddd xmm9,xmm11
movdqa XMMWORD[64+rsp],xmm0
movdqa xmm2,xmm0
movdqa XMMWORD[96+rsp],xmm8
movdqa xmm10,xmm8
DB 15,58,204,193,0
DB 15,56,200,213
DB 69,15,58,204,193,0
DB 69,15,56,200,212
DB 102,15,56,0,243
prefetcht0 [127+r8]
DB 15,56,201,229
DB 102,68,15,56,0,235
prefetcht0 [127+r9]
DB 69,15,56,201,220
DB 102,15,56,0,251
movdqa xmm1,xmm0
DB 102,68,15,56,0,243
movdqa xmm9,xmm8
DB 15,58,204,194,0
DB 15,56,200,206
DB 69,15,58,204,194,0
DB 69,15,56,200,205
pxor xmm4,xmm6
DB 15,56,201,238
pxor xmm11,xmm13
DB 69,15,56,201,229
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,0
DB 15,56,200,215
DB 69,15,58,204,193,0
DB 69,15,56,200,214
DB 15,56,202,231
DB 69,15,56,202,222
pxor xmm5,xmm7
DB 15,56,201,247
pxor xmm12,xmm14
DB 69,15,56,201,238
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,0
DB 15,56,200,204
DB 69,15,58,204,194,0
DB 69,15,56,200,203
DB 15,56,202,236
DB 69,15,56,202,227
pxor xmm6,xmm4
DB 15,56,201,252
pxor xmm13,xmm11
DB 69,15,56,201,243
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,0
DB 15,56,200,213
DB 69,15,58,204,193,0
DB 69,15,56,200,212
DB 15,56,202,245
DB 69,15,56,202,236
pxor xmm7,xmm5
DB 15,56,201,229
pxor xmm14,xmm12
DB 69,15,56,201,220
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,1
DB 15,56,200,206
DB 69,15,58,204,194,1
DB 69,15,56,200,205
DB 15,56,202,254
DB 69,15,56,202,245
pxor xmm4,xmm6
DB 15,56,201,238
pxor xmm11,xmm13
DB 69,15,56,201,229
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,1
DB 15,56,200,215
DB 69,15,58,204,193,1
DB 69,15,56,200,214
DB 15,56,202,231
DB 69,15,56,202,222
pxor xmm5,xmm7
DB 15,56,201,247
pxor xmm12,xmm14
DB 69,15,56,201,238
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,1
DB 15,56,200,204
DB 69,15,58,204,194,1
DB 69,15,56,200,203
DB 15,56,202,236
DB 69,15,56,202,227
pxor xmm6,xmm4
DB 15,56,201,252
pxor xmm13,xmm11
DB 69,15,56,201,243
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,1
DB 15,56,200,213
DB 69,15,58,204,193,1
DB 69,15,56,200,212
DB 15,56,202,245
DB 69,15,56,202,236
pxor xmm7,xmm5
DB 15,56,201,229
pxor xmm14,xmm12
DB 69,15,56,201,220
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,1
DB 15,56,200,206
DB 69,15,58,204,194,1
DB 69,15,56,200,205
DB 15,56,202,254
DB 69,15,56,202,245
pxor xmm4,xmm6
DB 15,56,201,238
pxor xmm11,xmm13
DB 69,15,56,201,229
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,2
DB 15,56,200,215
DB 69,15,58,204,193,2
DB 69,15,56,200,214
DB 15,56,202,231
DB 69,15,56,202,222
pxor xmm5,xmm7
DB 15,56,201,247
pxor xmm12,xmm14
DB 69,15,56,201,238
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,2
DB 15,56,200,204
DB 69,15,58,204,194,2
DB 69,15,56,200,203
DB 15,56,202,236
DB 69,15,56,202,227
pxor xmm6,xmm4
DB 15,56,201,252
pxor xmm13,xmm11
DB 69,15,56,201,243
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,2
DB 15,56,200,213
DB 69,15,58,204,193,2
DB 69,15,56,200,212
DB 15,56,202,245
DB 69,15,56,202,236
pxor xmm7,xmm5
DB 15,56,201,229
pxor xmm14,xmm12
DB 69,15,56,201,220
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,2
DB 15,56,200,206
DB 69,15,58,204,194,2
DB 69,15,56,200,205
DB 15,56,202,254
DB 69,15,56,202,245
pxor xmm4,xmm6
DB 15,56,201,238
pxor xmm11,xmm13
DB 69,15,56,201,229
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,2
DB 15,56,200,215
DB 69,15,58,204,193,2
DB 69,15,56,200,214
DB 15,56,202,231
DB 69,15,56,202,222
pxor xmm5,xmm7
DB 15,56,201,247
pxor xmm12,xmm14
DB 69,15,56,201,238
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,3
DB 15,56,200,204
DB 69,15,58,204,194,3
DB 69,15,56,200,203
DB 15,56,202,236
DB 69,15,56,202,227
pxor xmm6,xmm4
DB 15,56,201,252
pxor xmm13,xmm11
DB 69,15,56,201,243
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,3
DB 15,56,200,213
DB 69,15,58,204,193,3
DB 69,15,56,200,212
DB 15,56,202,245
DB 69,15,56,202,236
pxor xmm7,xmm5
pxor xmm14,xmm12
mov ecx,1
pxor xmm4,xmm4
cmp ecx,DWORD[rbx]
cmovge r8,rsp
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,3
DB 15,56,200,206
DB 69,15,58,204,194,3
DB 69,15,56,200,205
DB 15,56,202,254
DB 69,15,56,202,245
cmp ecx,DWORD[4+rbx]
cmovge r9,rsp
movq xmm6,QWORD[rbx]
movdqa xmm2,xmm0
movdqa xmm10,xmm8
DB 15,58,204,193,3
DB 15,56,200,215
DB 69,15,58,204,193,3
DB 69,15,56,200,214
pshufd xmm11,xmm6,0x00
pshufd xmm12,xmm6,0x55
movdqa xmm7,xmm6
pcmpgtd xmm11,xmm4
pcmpgtd xmm12,xmm4
movdqa xmm1,xmm0
movdqa xmm9,xmm8
DB 15,58,204,194,3
DB 15,56,200,204
DB 69,15,58,204,194,3
DB 68,15,56,200,204
pcmpgtd xmm7,xmm4
pand xmm0,xmm11
pand xmm1,xmm11
pand xmm8,xmm12
pand xmm9,xmm12
paddd xmm6,xmm7
paddd xmm0,XMMWORD[64+rsp]
paddd xmm1,XMMWORD[80+rsp]
paddd xmm8,XMMWORD[96+rsp]
paddd xmm9,XMMWORD[112+rsp]
movq QWORD[rbx],xmm6
dec edx
jnz NEAR $L$oop_shaext
mov edx,DWORD[280+rsp]
pshufd xmm0,xmm0,27
pshufd xmm8,xmm8,27
movdqa xmm6,xmm0
punpckldq xmm0,xmm8
punpckhdq xmm6,xmm8
punpckhdq xmm1,xmm9
movq QWORD[(0-64)+rdi],xmm0
psrldq xmm0,8
movq QWORD[(64-64)+rdi],xmm6
psrldq xmm6,8
movq QWORD[(32-64)+rdi],xmm0
psrldq xmm1,8
movq QWORD[(96-64)+rdi],xmm6
movq QWORD[(128-64)+rdi],xmm1
lea rdi,[8+rdi]
lea rsi,[32+rsi]
dec edx
jnz NEAR $L$oop_grande_shaext
$L$done_shaext:
movaps xmm6,XMMWORD[((-184))+rax]
movaps xmm7,XMMWORD[((-168))+rax]
movaps xmm8,XMMWORD[((-152))+rax]
movaps xmm9,XMMWORD[((-136))+rax]
movaps xmm10,XMMWORD[((-120))+rax]
movaps xmm11,XMMWORD[((-104))+rax]
movaps xmm12,XMMWORD[((-88))+rax]
movaps xmm13,XMMWORD[((-72))+rax]
movaps xmm14,XMMWORD[((-56))+rax]
movaps xmm15,XMMWORD[((-40))+rax]
mov rbp,QWORD[((-16))+rax]
mov rbx,QWORD[((-8))+rax]
lea rsp,[rax]
$L$epilogue_shaext:
mov rdi,QWORD[8+rsp] ;WIN64 epilogue
mov rsi,QWORD[16+rsp]
DB 0F3h,0C3h ;repret
$L$SEH_end_sha1_multi_block_shaext:
ALIGN 32
sha1_multi_block_avx:
mov QWORD[8+rsp],rdi ;WIN64 prologue
mov QWORD[16+rsp],rsi
mov rax,rsp
$L$SEH_begin_sha1_multi_block_avx:
mov rdi,rcx
mov rsi,rdx
mov rdx,r8
_avx_shortcut:
shr rcx,32
cmp edx,2
jb NEAR $L$avx
test ecx,32
jnz NEAR _avx2_shortcut
jmp NEAR $L$avx
ALIGN 32
$L$avx:
mov rax,rsp
push rbx
push rbp
lea rsp,[((-168))+rsp]
movaps XMMWORD[rsp],xmm6
movaps XMMWORD[16+rsp],xmm7
movaps XMMWORD[32+rsp],xmm8
movaps XMMWORD[48+rsp],xmm9
movaps XMMWORD[(-120)+rax],xmm10
movaps XMMWORD[(-104)+rax],xmm11
movaps XMMWORD[(-88)+rax],xmm12
movaps XMMWORD[(-72)+rax],xmm13
movaps XMMWORD[(-56)+rax],xmm14
movaps XMMWORD[(-40)+rax],xmm15
sub rsp,288
and rsp,-256
mov QWORD[272+rsp],rax
$L$body_avx:
lea rbp,[K_XX_XX]
lea rbx,[256+rsp]
vzeroupper
$L$oop_grande_avx:
mov DWORD[280+rsp],edx
xor edx,edx
mov r8,QWORD[rsi]
mov ecx,DWORD[8+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[rbx],ecx
cmovle r8,rbp
mov r9,QWORD[16+rsi]
mov ecx,DWORD[24+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[4+rbx],ecx
cmovle r9,rbp
mov r10,QWORD[32+rsi]
mov ecx,DWORD[40+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[8+rbx],ecx
cmovle r10,rbp
mov r11,QWORD[48+rsi]
mov ecx,DWORD[56+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[12+rbx],ecx
cmovle r11,rbp
test edx,edx
jz NEAR $L$done_avx
vmovdqu xmm10,XMMWORD[rdi]
lea rax,[128+rsp]
vmovdqu xmm11,XMMWORD[32+rdi]
vmovdqu xmm12,XMMWORD[64+rdi]
vmovdqu xmm13,XMMWORD[96+rdi]
vmovdqu xmm14,XMMWORD[128+rdi]
vmovdqu xmm5,XMMWORD[96+rbp]
jmp NEAR $L$oop_avx
ALIGN 32
$L$oop_avx:
vmovdqa xmm15,XMMWORD[((-32))+rbp]
vmovd xmm0,DWORD[r8]
lea r8,[64+r8]
vmovd xmm2,DWORD[r9]
lea r9,[64+r9]
vpinsrd xmm0,xmm0,DWORD[r10],1
lea r10,[64+r10]
vpinsrd xmm2,xmm2,DWORD[r11],1
lea r11,[64+r11]
vmovd xmm1,DWORD[((-60))+r8]
vpunpckldq xmm0,xmm0,xmm2
vmovd xmm9,DWORD[((-60))+r9]
vpshufb xmm0,xmm0,xmm5
vpinsrd xmm1,xmm1,DWORD[((-60))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-60))+r11],1
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpandn xmm7,xmm11,xmm13
vpand xmm6,xmm11,xmm12
vmovdqa XMMWORD[(0-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpunpckldq xmm1,xmm1,xmm9
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm7
vmovd xmm2,DWORD[((-56))+r8]
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-56))+r9]
vpaddd xmm14,xmm14,xmm6
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpshufb xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpinsrd xmm2,xmm2,DWORD[((-56))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-56))+r11],1
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpandn xmm7,xmm10,xmm12
vpand xmm6,xmm10,xmm11
vmovdqa XMMWORD[(16-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpunpckldq xmm2,xmm2,xmm9
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm7
vmovd xmm3,DWORD[((-52))+r8]
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-52))+r9]
vpaddd xmm13,xmm13,xmm6
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpshufb xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpinsrd xmm3,xmm3,DWORD[((-52))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-52))+r11],1
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpandn xmm7,xmm14,xmm11
vpand xmm6,xmm14,xmm10
vmovdqa XMMWORD[(32-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpunpckldq xmm3,xmm3,xmm9
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm7
vmovd xmm4,DWORD[((-48))+r8]
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-48))+r9]
vpaddd xmm12,xmm12,xmm6
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpshufb xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpinsrd xmm4,xmm4,DWORD[((-48))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-48))+r11],1
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpandn xmm7,xmm13,xmm10
vpand xmm6,xmm13,xmm14
vmovdqa XMMWORD[(48-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpunpckldq xmm4,xmm4,xmm9
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm7
vmovd xmm0,DWORD[((-44))+r8]
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-44))+r9]
vpaddd xmm11,xmm11,xmm6
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpshufb xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpinsrd xmm0,xmm0,DWORD[((-44))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-44))+r11],1
vpaddd xmm10,xmm10,xmm15
vpslld xmm8,xmm11,5
vpandn xmm7,xmm12,xmm14
vpand xmm6,xmm12,xmm13
vmovdqa XMMWORD[(64-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpunpckldq xmm0,xmm0,xmm9
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm7
vmovd xmm1,DWORD[((-40))+r8]
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-40))+r9]
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpshufb xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpinsrd xmm1,xmm1,DWORD[((-40))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-40))+r11],1
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpandn xmm7,xmm11,xmm13
vpand xmm6,xmm11,xmm12
vmovdqa XMMWORD[(80-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpunpckldq xmm1,xmm1,xmm9
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm7
vmovd xmm2,DWORD[((-36))+r8]
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-36))+r9]
vpaddd xmm14,xmm14,xmm6
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpshufb xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpinsrd xmm2,xmm2,DWORD[((-36))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-36))+r11],1
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpandn xmm7,xmm10,xmm12
vpand xmm6,xmm10,xmm11
vmovdqa XMMWORD[(96-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpunpckldq xmm2,xmm2,xmm9
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm7
vmovd xmm3,DWORD[((-32))+r8]
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-32))+r9]
vpaddd xmm13,xmm13,xmm6
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpshufb xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpinsrd xmm3,xmm3,DWORD[((-32))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-32))+r11],1
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpandn xmm7,xmm14,xmm11
vpand xmm6,xmm14,xmm10
vmovdqa XMMWORD[(112-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpunpckldq xmm3,xmm3,xmm9
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm7
vmovd xmm4,DWORD[((-28))+r8]
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-28))+r9]
vpaddd xmm12,xmm12,xmm6
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpshufb xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpinsrd xmm4,xmm4,DWORD[((-28))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-28))+r11],1
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpandn xmm7,xmm13,xmm10
vpand xmm6,xmm13,xmm14
vmovdqa XMMWORD[(128-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpunpckldq xmm4,xmm4,xmm9
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm7
vmovd xmm0,DWORD[((-24))+r8]
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-24))+r9]
vpaddd xmm11,xmm11,xmm6
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpshufb xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpinsrd xmm0,xmm0,DWORD[((-24))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-24))+r11],1
vpaddd xmm10,xmm10,xmm15
vpslld xmm8,xmm11,5
vpandn xmm7,xmm12,xmm14
vpand xmm6,xmm12,xmm13
vmovdqa XMMWORD[(144-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpunpckldq xmm0,xmm0,xmm9
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm7
vmovd xmm1,DWORD[((-20))+r8]
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-20))+r9]
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpshufb xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpinsrd xmm1,xmm1,DWORD[((-20))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-20))+r11],1
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpandn xmm7,xmm11,xmm13
vpand xmm6,xmm11,xmm12
vmovdqa XMMWORD[(160-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpunpckldq xmm1,xmm1,xmm9
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm7
vmovd xmm2,DWORD[((-16))+r8]
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-16))+r9]
vpaddd xmm14,xmm14,xmm6
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpshufb xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpinsrd xmm2,xmm2,DWORD[((-16))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-16))+r11],1
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpandn xmm7,xmm10,xmm12
vpand xmm6,xmm10,xmm11
vmovdqa XMMWORD[(176-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpunpckldq xmm2,xmm2,xmm9
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm7
vmovd xmm3,DWORD[((-12))+r8]
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-12))+r9]
vpaddd xmm13,xmm13,xmm6
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpshufb xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpinsrd xmm3,xmm3,DWORD[((-12))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-12))+r11],1
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpandn xmm7,xmm14,xmm11
vpand xmm6,xmm14,xmm10
vmovdqa XMMWORD[(192-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpunpckldq xmm3,xmm3,xmm9
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm7
vmovd xmm4,DWORD[((-8))+r8]
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-8))+r9]
vpaddd xmm12,xmm12,xmm6
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpshufb xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpinsrd xmm4,xmm4,DWORD[((-8))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-8))+r11],1
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpandn xmm7,xmm13,xmm10
vpand xmm6,xmm13,xmm14
vmovdqa XMMWORD[(208-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpunpckldq xmm4,xmm4,xmm9
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm7
vmovd xmm0,DWORD[((-4))+r8]
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vmovd xmm9,DWORD[((-4))+r9]
vpaddd xmm11,xmm11,xmm6
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpshufb xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vmovdqa xmm1,XMMWORD[((0-128))+rax]
vpinsrd xmm0,xmm0,DWORD[((-4))+r10],1
vpinsrd xmm9,xmm9,DWORD[((-4))+r11],1
vpaddd xmm10,xmm10,xmm15
prefetcht0 [63+r8]
vpslld xmm8,xmm11,5
vpandn xmm7,xmm12,xmm14
vpand xmm6,xmm12,xmm13
vmovdqa XMMWORD[(224-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpunpckldq xmm0,xmm0,xmm9
vpsrld xmm9,xmm11,27
prefetcht0 [63+r9]
vpxor xmm6,xmm6,xmm7
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
prefetcht0 [63+r10]
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
prefetcht0 [63+r11]
vpshufb xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vmovdqa xmm2,XMMWORD[((16-128))+rax]
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((32-128))+rax]
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpandn xmm7,xmm11,xmm13
vpand xmm6,xmm11,xmm12
vmovdqa XMMWORD[(240-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((128-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm7
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((48-128))+rax]
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpandn xmm7,xmm10,xmm12
vpand xmm6,xmm10,xmm11
vmovdqa XMMWORD[(0-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((144-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm7
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((64-128))+rax]
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpandn xmm7,xmm14,xmm11
vpand xmm6,xmm14,xmm10
vmovdqa XMMWORD[(16-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((160-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm7
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((80-128))+rax]
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpandn xmm7,xmm13,xmm10
vpand xmm6,xmm13,xmm14
vmovdqa XMMWORD[(32-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((176-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm7
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((96-128))+rax]
vpaddd xmm10,xmm10,xmm15
vpslld xmm8,xmm11,5
vpandn xmm7,xmm12,xmm14
vpand xmm6,xmm12,xmm13
vmovdqa XMMWORD[(48-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((192-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm7
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vmovdqa xmm15,XMMWORD[rbp]
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((112-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vmovdqa XMMWORD[(64-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((208-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((128-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vmovdqa XMMWORD[(80-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((224-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((144-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vmovdqa XMMWORD[(96-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((240-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((160-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vmovdqa XMMWORD[(112-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((0-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((176-128))+rax]
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vmovdqa XMMWORD[(128-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((16-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm13
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((192-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vmovdqa XMMWORD[(144-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((32-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((208-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vmovdqa XMMWORD[(160-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((48-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((224-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vmovdqa XMMWORD[(176-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((64-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((240-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vmovdqa XMMWORD[(192-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((80-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((0-128))+rax]
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vmovdqa XMMWORD[(208-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((96-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm13
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((16-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vmovdqa XMMWORD[(224-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((112-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((32-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vmovdqa XMMWORD[(240-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((128-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((48-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vmovdqa XMMWORD[(0-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((144-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((64-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vmovdqa XMMWORD[(16-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((160-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((80-128))+rax]
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vmovdqa XMMWORD[(32-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((176-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm13
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((96-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vmovdqa XMMWORD[(48-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((192-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((112-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vmovdqa XMMWORD[(64-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((208-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((128-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vmovdqa XMMWORD[(80-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((224-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((144-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vmovdqa XMMWORD[(96-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((240-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((160-128))+rax]
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vmovdqa XMMWORD[(112-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((0-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm13
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vmovdqa xmm15,XMMWORD[32+rbp]
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((176-128))+rax]
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpand xmm7,xmm13,xmm12
vpxor xmm1,xmm1,XMMWORD[((16-128))+rax]
vpaddd xmm14,xmm14,xmm7
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm13,xmm12
vpxor xmm1,xmm1,xmm3
vmovdqu XMMWORD[(128-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm1,31
vpand xmm6,xmm6,xmm11
vpaddd xmm1,xmm1,xmm1
vpslld xmm7,xmm11,30
vpaddd xmm14,xmm14,xmm6
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((192-128))+rax]
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpand xmm7,xmm12,xmm11
vpxor xmm2,xmm2,XMMWORD[((32-128))+rax]
vpaddd xmm13,xmm13,xmm7
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm12,xmm11
vpxor xmm2,xmm2,xmm4
vmovdqu XMMWORD[(144-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm2,31
vpand xmm6,xmm6,xmm10
vpaddd xmm2,xmm2,xmm2
vpslld xmm7,xmm10,30
vpaddd xmm13,xmm13,xmm6
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((208-128))+rax]
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpand xmm7,xmm11,xmm10
vpxor xmm3,xmm3,XMMWORD[((48-128))+rax]
vpaddd xmm12,xmm12,xmm7
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm11,xmm10
vpxor xmm3,xmm3,xmm0
vmovdqu XMMWORD[(160-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm3,31
vpand xmm6,xmm6,xmm14
vpaddd xmm3,xmm3,xmm3
vpslld xmm7,xmm14,30
vpaddd xmm12,xmm12,xmm6
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((224-128))+rax]
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpand xmm7,xmm10,xmm14
vpxor xmm4,xmm4,XMMWORD[((64-128))+rax]
vpaddd xmm11,xmm11,xmm7
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm10,xmm14
vpxor xmm4,xmm4,xmm1
vmovdqu XMMWORD[(176-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm4,31
vpand xmm6,xmm6,xmm13
vpaddd xmm4,xmm4,xmm4
vpslld xmm7,xmm13,30
vpaddd xmm11,xmm11,xmm6
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((240-128))+rax]
vpaddd xmm10,xmm10,xmm15
vpslld xmm8,xmm11,5
vpand xmm7,xmm14,xmm13
vpxor xmm0,xmm0,XMMWORD[((80-128))+rax]
vpaddd xmm10,xmm10,xmm7
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm14,xmm13
vpxor xmm0,xmm0,xmm2
vmovdqu XMMWORD[(192-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm0,31
vpand xmm6,xmm6,xmm12
vpaddd xmm0,xmm0,xmm0
vpslld xmm7,xmm12,30
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((0-128))+rax]
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpand xmm7,xmm13,xmm12
vpxor xmm1,xmm1,XMMWORD[((96-128))+rax]
vpaddd xmm14,xmm14,xmm7
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm13,xmm12
vpxor xmm1,xmm1,xmm3
vmovdqu XMMWORD[(208-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm1,31
vpand xmm6,xmm6,xmm11
vpaddd xmm1,xmm1,xmm1
vpslld xmm7,xmm11,30
vpaddd xmm14,xmm14,xmm6
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((16-128))+rax]
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpand xmm7,xmm12,xmm11
vpxor xmm2,xmm2,XMMWORD[((112-128))+rax]
vpaddd xmm13,xmm13,xmm7
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm12,xmm11
vpxor xmm2,xmm2,xmm4
vmovdqu XMMWORD[(224-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm2,31
vpand xmm6,xmm6,xmm10
vpaddd xmm2,xmm2,xmm2
vpslld xmm7,xmm10,30
vpaddd xmm13,xmm13,xmm6
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((32-128))+rax]
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpand xmm7,xmm11,xmm10
vpxor xmm3,xmm3,XMMWORD[((128-128))+rax]
vpaddd xmm12,xmm12,xmm7
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm11,xmm10
vpxor xmm3,xmm3,xmm0
vmovdqu XMMWORD[(240-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm3,31
vpand xmm6,xmm6,xmm14
vpaddd xmm3,xmm3,xmm3
vpslld xmm7,xmm14,30
vpaddd xmm12,xmm12,xmm6
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((48-128))+rax]
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpand xmm7,xmm10,xmm14
vpxor xmm4,xmm4,XMMWORD[((144-128))+rax]
vpaddd xmm11,xmm11,xmm7
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm10,xmm14
vpxor xmm4,xmm4,xmm1
vmovdqu XMMWORD[(0-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm4,31
vpand xmm6,xmm6,xmm13
vpaddd xmm4,xmm4,xmm4
vpslld xmm7,xmm13,30
vpaddd xmm11,xmm11,xmm6
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((64-128))+rax]
vpaddd xmm10,xmm10,xmm15
vpslld xmm8,xmm11,5
vpand xmm7,xmm14,xmm13
vpxor xmm0,xmm0,XMMWORD[((160-128))+rax]
vpaddd xmm10,xmm10,xmm7
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm14,xmm13
vpxor xmm0,xmm0,xmm2
vmovdqu XMMWORD[(16-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm0,31
vpand xmm6,xmm6,xmm12
vpaddd xmm0,xmm0,xmm0
vpslld xmm7,xmm12,30
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((80-128))+rax]
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpand xmm7,xmm13,xmm12
vpxor xmm1,xmm1,XMMWORD[((176-128))+rax]
vpaddd xmm14,xmm14,xmm7
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm13,xmm12
vpxor xmm1,xmm1,xmm3
vmovdqu XMMWORD[(32-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm1,31
vpand xmm6,xmm6,xmm11
vpaddd xmm1,xmm1,xmm1
vpslld xmm7,xmm11,30
vpaddd xmm14,xmm14,xmm6
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((96-128))+rax]
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpand xmm7,xmm12,xmm11
vpxor xmm2,xmm2,XMMWORD[((192-128))+rax]
vpaddd xmm13,xmm13,xmm7
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm12,xmm11
vpxor xmm2,xmm2,xmm4
vmovdqu XMMWORD[(48-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm2,31
vpand xmm6,xmm6,xmm10
vpaddd xmm2,xmm2,xmm2
vpslld xmm7,xmm10,30
vpaddd xmm13,xmm13,xmm6
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((112-128))+rax]
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpand xmm7,xmm11,xmm10
vpxor xmm3,xmm3,XMMWORD[((208-128))+rax]
vpaddd xmm12,xmm12,xmm7
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm11,xmm10
vpxor xmm3,xmm3,xmm0
vmovdqu XMMWORD[(64-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm3,31
vpand xmm6,xmm6,xmm14
vpaddd xmm3,xmm3,xmm3
vpslld xmm7,xmm14,30
vpaddd xmm12,xmm12,xmm6
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((128-128))+rax]
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpand xmm7,xmm10,xmm14
vpxor xmm4,xmm4,XMMWORD[((224-128))+rax]
vpaddd xmm11,xmm11,xmm7
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm10,xmm14
vpxor xmm4,xmm4,xmm1
vmovdqu XMMWORD[(80-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm4,31
vpand xmm6,xmm6,xmm13
vpaddd xmm4,xmm4,xmm4
vpslld xmm7,xmm13,30
vpaddd xmm11,xmm11,xmm6
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((144-128))+rax]
vpaddd xmm10,xmm10,xmm15
vpslld xmm8,xmm11,5
vpand xmm7,xmm14,xmm13
vpxor xmm0,xmm0,XMMWORD[((240-128))+rax]
vpaddd xmm10,xmm10,xmm7
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm14,xmm13
vpxor xmm0,xmm0,xmm2
vmovdqu XMMWORD[(96-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm0,31
vpand xmm6,xmm6,xmm12
vpaddd xmm0,xmm0,xmm0
vpslld xmm7,xmm12,30
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((160-128))+rax]
vpaddd xmm14,xmm14,xmm15
vpslld xmm8,xmm10,5
vpand xmm7,xmm13,xmm12
vpxor xmm1,xmm1,XMMWORD[((0-128))+rax]
vpaddd xmm14,xmm14,xmm7
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm13,xmm12
vpxor xmm1,xmm1,xmm3
vmovdqu XMMWORD[(112-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm1,31
vpand xmm6,xmm6,xmm11
vpaddd xmm1,xmm1,xmm1
vpslld xmm7,xmm11,30
vpaddd xmm14,xmm14,xmm6
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((176-128))+rax]
vpaddd xmm13,xmm13,xmm15
vpslld xmm8,xmm14,5
vpand xmm7,xmm12,xmm11
vpxor xmm2,xmm2,XMMWORD[((16-128))+rax]
vpaddd xmm13,xmm13,xmm7
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm12,xmm11
vpxor xmm2,xmm2,xmm4
vmovdqu XMMWORD[(128-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm2,31
vpand xmm6,xmm6,xmm10
vpaddd xmm2,xmm2,xmm2
vpslld xmm7,xmm10,30
vpaddd xmm13,xmm13,xmm6
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((192-128))+rax]
vpaddd xmm12,xmm12,xmm15
vpslld xmm8,xmm13,5
vpand xmm7,xmm11,xmm10
vpxor xmm3,xmm3,XMMWORD[((32-128))+rax]
vpaddd xmm12,xmm12,xmm7
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm11,xmm10
vpxor xmm3,xmm3,xmm0
vmovdqu XMMWORD[(144-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm3,31
vpand xmm6,xmm6,xmm14
vpaddd xmm3,xmm3,xmm3
vpslld xmm7,xmm14,30
vpaddd xmm12,xmm12,xmm6
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((208-128))+rax]
vpaddd xmm11,xmm11,xmm15
vpslld xmm8,xmm12,5
vpand xmm7,xmm10,xmm14
vpxor xmm4,xmm4,XMMWORD[((48-128))+rax]
vpaddd xmm11,xmm11,xmm7
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm10,xmm14
vpxor xmm4,xmm4,xmm1
vmovdqu XMMWORD[(160-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm4,31
vpand xmm6,xmm6,xmm13
vpaddd xmm4,xmm4,xmm4
vpslld xmm7,xmm13,30
vpaddd xmm11,xmm11,xmm6
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((224-128))+rax]
vpaddd xmm10,xmm10,xmm15
vpslld xmm8,xmm11,5
vpand xmm7,xmm14,xmm13
vpxor xmm0,xmm0,XMMWORD[((64-128))+rax]
vpaddd xmm10,xmm10,xmm7
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm14,xmm13
vpxor xmm0,xmm0,xmm2
vmovdqu XMMWORD[(176-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpor xmm8,xmm8,xmm9
vpsrld xmm5,xmm0,31
vpand xmm6,xmm6,xmm12
vpaddd xmm0,xmm0,xmm0
vpslld xmm7,xmm12,30
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vmovdqa xmm15,XMMWORD[64+rbp]
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((240-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vmovdqa XMMWORD[(192-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((80-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((0-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vmovdqa XMMWORD[(208-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((96-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((16-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vmovdqa XMMWORD[(224-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((112-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((32-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vmovdqa XMMWORD[(240-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((128-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((48-128))+rax]
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vmovdqa XMMWORD[(0-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((144-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm13
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((64-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vmovdqa XMMWORD[(16-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((160-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((80-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vmovdqa XMMWORD[(32-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((176-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((96-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vmovdqa XMMWORD[(48-128)+rax],xmm2
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((192-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((112-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vmovdqa XMMWORD[(64-128)+rax],xmm3
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((208-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((128-128))+rax]
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vmovdqa XMMWORD[(80-128)+rax],xmm4
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((224-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm13
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((144-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vmovdqa XMMWORD[(96-128)+rax],xmm0
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((240-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((160-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vmovdqa XMMWORD[(112-128)+rax],xmm1
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((0-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((176-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((16-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((192-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((32-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpxor xmm0,xmm0,xmm2
vmovdqa xmm2,XMMWORD[((208-128))+rax]
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vpaddd xmm10,xmm10,xmm4
vpxor xmm0,xmm0,XMMWORD[((48-128))+rax]
vpsrld xmm9,xmm11,27
vpxor xmm6,xmm6,xmm13
vpxor xmm0,xmm0,xmm2
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm5,xmm0,31
vpaddd xmm0,xmm0,xmm0
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm0,xmm0,xmm5
vpor xmm12,xmm12,xmm7
vpxor xmm1,xmm1,xmm3
vmovdqa xmm3,XMMWORD[((224-128))+rax]
vpslld xmm8,xmm10,5
vpaddd xmm14,xmm14,xmm15
vpxor xmm6,xmm13,xmm11
vpaddd xmm14,xmm14,xmm0
vpxor xmm1,xmm1,XMMWORD[((64-128))+rax]
vpsrld xmm9,xmm10,27
vpxor xmm6,xmm6,xmm12
vpxor xmm1,xmm1,xmm3
vpslld xmm7,xmm11,30
vpor xmm8,xmm8,xmm9
vpaddd xmm14,xmm14,xmm6
vpsrld xmm5,xmm1,31
vpaddd xmm1,xmm1,xmm1
vpsrld xmm11,xmm11,2
vpaddd xmm14,xmm14,xmm8
vpor xmm1,xmm1,xmm5
vpor xmm11,xmm11,xmm7
vpxor xmm2,xmm2,xmm4
vmovdqa xmm4,XMMWORD[((240-128))+rax]
vpslld xmm8,xmm14,5
vpaddd xmm13,xmm13,xmm15
vpxor xmm6,xmm12,xmm10
vpaddd xmm13,xmm13,xmm1
vpxor xmm2,xmm2,XMMWORD[((80-128))+rax]
vpsrld xmm9,xmm14,27
vpxor xmm6,xmm6,xmm11
vpxor xmm2,xmm2,xmm4
vpslld xmm7,xmm10,30
vpor xmm8,xmm8,xmm9
vpaddd xmm13,xmm13,xmm6
vpsrld xmm5,xmm2,31
vpaddd xmm2,xmm2,xmm2
vpsrld xmm10,xmm10,2
vpaddd xmm13,xmm13,xmm8
vpor xmm2,xmm2,xmm5
vpor xmm10,xmm10,xmm7
vpxor xmm3,xmm3,xmm0
vmovdqa xmm0,XMMWORD[((0-128))+rax]
vpslld xmm8,xmm13,5
vpaddd xmm12,xmm12,xmm15
vpxor xmm6,xmm11,xmm14
vpaddd xmm12,xmm12,xmm2
vpxor xmm3,xmm3,XMMWORD[((96-128))+rax]
vpsrld xmm9,xmm13,27
vpxor xmm6,xmm6,xmm10
vpxor xmm3,xmm3,xmm0
vpslld xmm7,xmm14,30
vpor xmm8,xmm8,xmm9
vpaddd xmm12,xmm12,xmm6
vpsrld xmm5,xmm3,31
vpaddd xmm3,xmm3,xmm3
vpsrld xmm14,xmm14,2
vpaddd xmm12,xmm12,xmm8
vpor xmm3,xmm3,xmm5
vpor xmm14,xmm14,xmm7
vpxor xmm4,xmm4,xmm1
vmovdqa xmm1,XMMWORD[((16-128))+rax]
vpslld xmm8,xmm12,5
vpaddd xmm11,xmm11,xmm15
vpxor xmm6,xmm10,xmm13
vpaddd xmm11,xmm11,xmm3
vpxor xmm4,xmm4,XMMWORD[((112-128))+rax]
vpsrld xmm9,xmm12,27
vpxor xmm6,xmm6,xmm14
vpxor xmm4,xmm4,xmm1
vpslld xmm7,xmm13,30
vpor xmm8,xmm8,xmm9
vpaddd xmm11,xmm11,xmm6
vpsrld xmm5,xmm4,31
vpaddd xmm4,xmm4,xmm4
vpsrld xmm13,xmm13,2
vpaddd xmm11,xmm11,xmm8
vpor xmm4,xmm4,xmm5
vpor xmm13,xmm13,xmm7
vpslld xmm8,xmm11,5
vpaddd xmm10,xmm10,xmm15
vpxor xmm6,xmm14,xmm12
vpsrld xmm9,xmm11,27
vpaddd xmm10,xmm10,xmm4
vpxor xmm6,xmm6,xmm13
vpslld xmm7,xmm12,30
vpor xmm8,xmm8,xmm9
vpaddd xmm10,xmm10,xmm6
vpsrld xmm12,xmm12,2
vpaddd xmm10,xmm10,xmm8
vpor xmm12,xmm12,xmm7
mov ecx,1
cmp ecx,DWORD[rbx]
cmovge r8,rbp
cmp ecx,DWORD[4+rbx]
cmovge r9,rbp
cmp ecx,DWORD[8+rbx]
cmovge r10,rbp
cmp ecx,DWORD[12+rbx]
cmovge r11,rbp
vmovdqu xmm6,XMMWORD[rbx]
vpxor xmm8,xmm8,xmm8
vmovdqa xmm7,xmm6
vpcmpgtd xmm7,xmm7,xmm8
vpaddd xmm6,xmm6,xmm7
vpand xmm10,xmm10,xmm7
vpand xmm11,xmm11,xmm7
vpaddd xmm10,xmm10,XMMWORD[rdi]
vpand xmm12,xmm12,xmm7
vpaddd xmm11,xmm11,XMMWORD[32+rdi]
vpand xmm13,xmm13,xmm7
vpaddd xmm12,xmm12,XMMWORD[64+rdi]
vpand xmm14,xmm14,xmm7
vpaddd xmm13,xmm13,XMMWORD[96+rdi]
vpaddd xmm14,xmm14,XMMWORD[128+rdi]
vmovdqu XMMWORD[rdi],xmm10
vmovdqu XMMWORD[32+rdi],xmm11
vmovdqu XMMWORD[64+rdi],xmm12
vmovdqu XMMWORD[96+rdi],xmm13
vmovdqu XMMWORD[128+rdi],xmm14
vmovdqu XMMWORD[rbx],xmm6
vmovdqu xmm5,XMMWORD[96+rbp]
dec edx
jnz NEAR $L$oop_avx
mov edx,DWORD[280+rsp]
lea rdi,[16+rdi]
lea rsi,[64+rsi]
dec edx
jnz NEAR $L$oop_grande_avx
$L$done_avx:
mov rax,QWORD[272+rsp]
vzeroupper
movaps xmm6,XMMWORD[((-184))+rax]
movaps xmm7,XMMWORD[((-168))+rax]
movaps xmm8,XMMWORD[((-152))+rax]
movaps xmm9,XMMWORD[((-136))+rax]
movaps xmm10,XMMWORD[((-120))+rax]
movaps xmm11,XMMWORD[((-104))+rax]
movaps xmm12,XMMWORD[((-88))+rax]
movaps xmm13,XMMWORD[((-72))+rax]
movaps xmm14,XMMWORD[((-56))+rax]
movaps xmm15,XMMWORD[((-40))+rax]
mov rbp,QWORD[((-16))+rax]
mov rbx,QWORD[((-8))+rax]
lea rsp,[rax]
$L$epilogue_avx:
mov rdi,QWORD[8+rsp] ;WIN64 epilogue
mov rsi,QWORD[16+rsp]
DB 0F3h,0C3h ;repret
$L$SEH_end_sha1_multi_block_avx:
ALIGN 32
sha1_multi_block_avx2:
mov QWORD[8+rsp],rdi ;WIN64 prologue
mov QWORD[16+rsp],rsi
mov rax,rsp
$L$SEH_begin_sha1_multi_block_avx2:
mov rdi,rcx
mov rsi,rdx
mov rdx,r8
_avx2_shortcut:
mov rax,rsp
push rbx
push rbp
push r12
push r13
push r14
push r15
lea rsp,[((-168))+rsp]
movaps XMMWORD[rsp],xmm6
movaps XMMWORD[16+rsp],xmm7
movaps XMMWORD[32+rsp],xmm8
movaps XMMWORD[48+rsp],xmm9
movaps XMMWORD[64+rsp],xmm10
movaps XMMWORD[80+rsp],xmm11
movaps XMMWORD[(-120)+rax],xmm12
movaps XMMWORD[(-104)+rax],xmm13
movaps XMMWORD[(-88)+rax],xmm14
movaps XMMWORD[(-72)+rax],xmm15
sub rsp,576
and rsp,-256
mov QWORD[544+rsp],rax
$L$body_avx2:
lea rbp,[K_XX_XX]
shr edx,1
vzeroupper
$L$oop_grande_avx2:
mov DWORD[552+rsp],edx
xor edx,edx
lea rbx,[512+rsp]
mov r12,QWORD[rsi]
mov ecx,DWORD[8+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[rbx],ecx
cmovle r12,rbp
mov r13,QWORD[16+rsi]
mov ecx,DWORD[24+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[4+rbx],ecx
cmovle r13,rbp
mov r14,QWORD[32+rsi]
mov ecx,DWORD[40+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[8+rbx],ecx
cmovle r14,rbp
mov r15,QWORD[48+rsi]
mov ecx,DWORD[56+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[12+rbx],ecx
cmovle r15,rbp
mov r8,QWORD[64+rsi]
mov ecx,DWORD[72+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[16+rbx],ecx
cmovle r8,rbp
mov r9,QWORD[80+rsi]
mov ecx,DWORD[88+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[20+rbx],ecx
cmovle r9,rbp
mov r10,QWORD[96+rsi]
mov ecx,DWORD[104+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[24+rbx],ecx
cmovle r10,rbp
mov r11,QWORD[112+rsi]
mov ecx,DWORD[120+rsi]
cmp ecx,edx
cmovg edx,ecx
test ecx,ecx
mov DWORD[28+rbx],ecx
cmovle r11,rbp
vmovdqu ymm0,YMMWORD[rdi]
lea rax,[128+rsp]
vmovdqu ymm1,YMMWORD[32+rdi]
lea rbx,[((256+128))+rsp]
vmovdqu ymm2,YMMWORD[64+rdi]
vmovdqu ymm3,YMMWORD[96+rdi]
vmovdqu ymm4,YMMWORD[128+rdi]
vmovdqu ymm9,YMMWORD[96+rbp]
jmp NEAR $L$oop_avx2
ALIGN 32
$L$oop_avx2:
vmovdqa ymm15,YMMWORD[((-32))+rbp]
vmovd xmm10,DWORD[r12]
lea r12,[64+r12]
vmovd xmm12,DWORD[r8]
lea r8,[64+r8]
vmovd xmm7,DWORD[r13]
lea r13,[64+r13]
vmovd xmm6,DWORD[r9]
lea r9,[64+r9]
vpinsrd xmm10,xmm10,DWORD[r14],1
lea r14,[64+r14]
vpinsrd xmm12,xmm12,DWORD[r10],1
lea r10,[64+r10]
vpinsrd xmm7,xmm7,DWORD[r15],1
lea r15,[64+r15]
vpunpckldq ymm10,ymm10,ymm7
vpinsrd xmm6,xmm6,DWORD[r11],1
lea r11,[64+r11]
vpunpckldq ymm12,ymm12,ymm6
vmovd xmm11,DWORD[((-60))+r12]
vinserti128 ymm10,ymm10,xmm12,1
vmovd xmm8,DWORD[((-60))+r8]
vpshufb ymm10,ymm10,ymm9
vmovd xmm7,DWORD[((-60))+r13]
vmovd xmm6,DWORD[((-60))+r9]
vpinsrd xmm11,xmm11,DWORD[((-60))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-60))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-60))+r15],1
vpunpckldq ymm11,ymm11,ymm7
vpinsrd xmm6,xmm6,DWORD[((-60))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpandn ymm6,ymm1,ymm3
vpand ymm5,ymm1,ymm2
vmovdqa YMMWORD[(0-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vinserti128 ymm11,ymm11,xmm8,1
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm6
vmovd xmm12,DWORD[((-56))+r12]
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-56))+r8]
vpaddd ymm4,ymm4,ymm5
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpshufb ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vmovd xmm7,DWORD[((-56))+r13]
vmovd xmm6,DWORD[((-56))+r9]
vpinsrd xmm12,xmm12,DWORD[((-56))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-56))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-56))+r15],1
vpunpckldq ymm12,ymm12,ymm7
vpinsrd xmm6,xmm6,DWORD[((-56))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpandn ymm6,ymm0,ymm2
vpand ymm5,ymm0,ymm1
vmovdqa YMMWORD[(32-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vinserti128 ymm12,ymm12,xmm8,1
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm6
vmovd xmm13,DWORD[((-52))+r12]
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-52))+r8]
vpaddd ymm3,ymm3,ymm5
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpshufb ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vmovd xmm7,DWORD[((-52))+r13]
vmovd xmm6,DWORD[((-52))+r9]
vpinsrd xmm13,xmm13,DWORD[((-52))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-52))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-52))+r15],1
vpunpckldq ymm13,ymm13,ymm7
vpinsrd xmm6,xmm6,DWORD[((-52))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpandn ymm6,ymm4,ymm1
vpand ymm5,ymm4,ymm0
vmovdqa YMMWORD[(64-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vinserti128 ymm13,ymm13,xmm8,1
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm6
vmovd xmm14,DWORD[((-48))+r12]
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-48))+r8]
vpaddd ymm2,ymm2,ymm5
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpshufb ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vmovd xmm7,DWORD[((-48))+r13]
vmovd xmm6,DWORD[((-48))+r9]
vpinsrd xmm14,xmm14,DWORD[((-48))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-48))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-48))+r15],1
vpunpckldq ymm14,ymm14,ymm7
vpinsrd xmm6,xmm6,DWORD[((-48))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpandn ymm6,ymm3,ymm0
vpand ymm5,ymm3,ymm4
vmovdqa YMMWORD[(96-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vinserti128 ymm14,ymm14,xmm8,1
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm6
vmovd xmm10,DWORD[((-44))+r12]
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-44))+r8]
vpaddd ymm1,ymm1,ymm5
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpshufb ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vmovd xmm7,DWORD[((-44))+r13]
vmovd xmm6,DWORD[((-44))+r9]
vpinsrd xmm10,xmm10,DWORD[((-44))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-44))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-44))+r15],1
vpunpckldq ymm10,ymm10,ymm7
vpinsrd xmm6,xmm6,DWORD[((-44))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm0,ymm0,ymm15
vpslld ymm7,ymm1,5
vpandn ymm6,ymm2,ymm4
vpand ymm5,ymm2,ymm3
vmovdqa YMMWORD[(128-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vinserti128 ymm10,ymm10,xmm8,1
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm6
vmovd xmm11,DWORD[((-40))+r12]
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-40))+r8]
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpshufb ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vmovd xmm7,DWORD[((-40))+r13]
vmovd xmm6,DWORD[((-40))+r9]
vpinsrd xmm11,xmm11,DWORD[((-40))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-40))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-40))+r15],1
vpunpckldq ymm11,ymm11,ymm7
vpinsrd xmm6,xmm6,DWORD[((-40))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpandn ymm6,ymm1,ymm3
vpand ymm5,ymm1,ymm2
vmovdqa YMMWORD[(160-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vinserti128 ymm11,ymm11,xmm8,1
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm6
vmovd xmm12,DWORD[((-36))+r12]
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-36))+r8]
vpaddd ymm4,ymm4,ymm5
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpshufb ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vmovd xmm7,DWORD[((-36))+r13]
vmovd xmm6,DWORD[((-36))+r9]
vpinsrd xmm12,xmm12,DWORD[((-36))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-36))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-36))+r15],1
vpunpckldq ymm12,ymm12,ymm7
vpinsrd xmm6,xmm6,DWORD[((-36))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpandn ymm6,ymm0,ymm2
vpand ymm5,ymm0,ymm1
vmovdqa YMMWORD[(192-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vinserti128 ymm12,ymm12,xmm8,1
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm6
vmovd xmm13,DWORD[((-32))+r12]
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-32))+r8]
vpaddd ymm3,ymm3,ymm5
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpshufb ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vmovd xmm7,DWORD[((-32))+r13]
vmovd xmm6,DWORD[((-32))+r9]
vpinsrd xmm13,xmm13,DWORD[((-32))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-32))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-32))+r15],1
vpunpckldq ymm13,ymm13,ymm7
vpinsrd xmm6,xmm6,DWORD[((-32))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpandn ymm6,ymm4,ymm1
vpand ymm5,ymm4,ymm0
vmovdqa YMMWORD[(224-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vinserti128 ymm13,ymm13,xmm8,1
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm6
vmovd xmm14,DWORD[((-28))+r12]
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-28))+r8]
vpaddd ymm2,ymm2,ymm5
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpshufb ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vmovd xmm7,DWORD[((-28))+r13]
vmovd xmm6,DWORD[((-28))+r9]
vpinsrd xmm14,xmm14,DWORD[((-28))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-28))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-28))+r15],1
vpunpckldq ymm14,ymm14,ymm7
vpinsrd xmm6,xmm6,DWORD[((-28))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpandn ymm6,ymm3,ymm0
vpand ymm5,ymm3,ymm4
vmovdqa YMMWORD[(256-256-128)+rbx],ymm13
vpaddd ymm1,ymm1,ymm13
vinserti128 ymm14,ymm14,xmm8,1
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm6
vmovd xmm10,DWORD[((-24))+r12]
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-24))+r8]
vpaddd ymm1,ymm1,ymm5
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpshufb ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vmovd xmm7,DWORD[((-24))+r13]
vmovd xmm6,DWORD[((-24))+r9]
vpinsrd xmm10,xmm10,DWORD[((-24))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-24))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-24))+r15],1
vpunpckldq ymm10,ymm10,ymm7
vpinsrd xmm6,xmm6,DWORD[((-24))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm0,ymm0,ymm15
vpslld ymm7,ymm1,5
vpandn ymm6,ymm2,ymm4
vpand ymm5,ymm2,ymm3
vmovdqa YMMWORD[(288-256-128)+rbx],ymm14
vpaddd ymm0,ymm0,ymm14
vinserti128 ymm10,ymm10,xmm8,1
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm6
vmovd xmm11,DWORD[((-20))+r12]
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-20))+r8]
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpshufb ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vmovd xmm7,DWORD[((-20))+r13]
vmovd xmm6,DWORD[((-20))+r9]
vpinsrd xmm11,xmm11,DWORD[((-20))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-20))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-20))+r15],1
vpunpckldq ymm11,ymm11,ymm7
vpinsrd xmm6,xmm6,DWORD[((-20))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpandn ymm6,ymm1,ymm3
vpand ymm5,ymm1,ymm2
vmovdqa YMMWORD[(320-256-128)+rbx],ymm10
vpaddd ymm4,ymm4,ymm10
vinserti128 ymm11,ymm11,xmm8,1
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm6
vmovd xmm12,DWORD[((-16))+r12]
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-16))+r8]
vpaddd ymm4,ymm4,ymm5
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpshufb ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vmovd xmm7,DWORD[((-16))+r13]
vmovd xmm6,DWORD[((-16))+r9]
vpinsrd xmm12,xmm12,DWORD[((-16))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-16))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-16))+r15],1
vpunpckldq ymm12,ymm12,ymm7
vpinsrd xmm6,xmm6,DWORD[((-16))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpandn ymm6,ymm0,ymm2
vpand ymm5,ymm0,ymm1
vmovdqa YMMWORD[(352-256-128)+rbx],ymm11
vpaddd ymm3,ymm3,ymm11
vinserti128 ymm12,ymm12,xmm8,1
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm6
vmovd xmm13,DWORD[((-12))+r12]
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-12))+r8]
vpaddd ymm3,ymm3,ymm5
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpshufb ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vmovd xmm7,DWORD[((-12))+r13]
vmovd xmm6,DWORD[((-12))+r9]
vpinsrd xmm13,xmm13,DWORD[((-12))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-12))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-12))+r15],1
vpunpckldq ymm13,ymm13,ymm7
vpinsrd xmm6,xmm6,DWORD[((-12))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpandn ymm6,ymm4,ymm1
vpand ymm5,ymm4,ymm0
vmovdqa YMMWORD[(384-256-128)+rbx],ymm12
vpaddd ymm2,ymm2,ymm12
vinserti128 ymm13,ymm13,xmm8,1
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm6
vmovd xmm14,DWORD[((-8))+r12]
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-8))+r8]
vpaddd ymm2,ymm2,ymm5
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpshufb ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vmovd xmm7,DWORD[((-8))+r13]
vmovd xmm6,DWORD[((-8))+r9]
vpinsrd xmm14,xmm14,DWORD[((-8))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-8))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-8))+r15],1
vpunpckldq ymm14,ymm14,ymm7
vpinsrd xmm6,xmm6,DWORD[((-8))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpandn ymm6,ymm3,ymm0
vpand ymm5,ymm3,ymm4
vmovdqa YMMWORD[(416-256-128)+rbx],ymm13
vpaddd ymm1,ymm1,ymm13
vinserti128 ymm14,ymm14,xmm8,1
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm6
vmovd xmm10,DWORD[((-4))+r12]
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vmovd xmm8,DWORD[((-4))+r8]
vpaddd ymm1,ymm1,ymm5
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpshufb ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vmovdqa ymm11,YMMWORD[((0-128))+rax]
vmovd xmm7,DWORD[((-4))+r13]
vmovd xmm6,DWORD[((-4))+r9]
vpinsrd xmm10,xmm10,DWORD[((-4))+r14],1
vpinsrd xmm8,xmm8,DWORD[((-4))+r10],1
vpinsrd xmm7,xmm7,DWORD[((-4))+r15],1
vpunpckldq ymm10,ymm10,ymm7
vpinsrd xmm6,xmm6,DWORD[((-4))+r11],1
vpunpckldq ymm8,ymm8,ymm6
vpaddd ymm0,ymm0,ymm15
prefetcht0 [63+r12]
vpslld ymm7,ymm1,5
vpandn ymm6,ymm2,ymm4
vpand ymm5,ymm2,ymm3
vmovdqa YMMWORD[(448-256-128)+rbx],ymm14
vpaddd ymm0,ymm0,ymm14
vinserti128 ymm10,ymm10,xmm8,1
vpsrld ymm8,ymm1,27
prefetcht0 [63+r13]
vpxor ymm5,ymm5,ymm6
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
prefetcht0 [63+r14]
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
prefetcht0 [63+r15]
vpshufb ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vmovdqa ymm12,YMMWORD[((32-128))+rax]
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((64-128))+rax]
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpandn ymm6,ymm1,ymm3
prefetcht0 [63+r8]
vpand ymm5,ymm1,ymm2
vmovdqa YMMWORD[(480-256-128)+rbx],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((256-256-128))+rbx]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm6
vpxor ymm11,ymm11,ymm13
prefetcht0 [63+r9]
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
prefetcht0 [63+r10]
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
prefetcht0 [63+r11]
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((96-128))+rax]
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpandn ymm6,ymm0,ymm2
vpand ymm5,ymm0,ymm1
vmovdqa YMMWORD[(0-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((288-256-128))+rbx]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm6
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((128-128))+rax]
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpandn ymm6,ymm4,ymm1
vpand ymm5,ymm4,ymm0
vmovdqa YMMWORD[(32-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((320-256-128))+rbx]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm6
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((160-128))+rax]
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpandn ymm6,ymm3,ymm0
vpand ymm5,ymm3,ymm4
vmovdqa YMMWORD[(64-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((352-256-128))+rbx]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm6
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((192-128))+rax]
vpaddd ymm0,ymm0,ymm15
vpslld ymm7,ymm1,5
vpandn ymm6,ymm2,ymm4
vpand ymm5,ymm2,ymm3
vmovdqa YMMWORD[(96-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((384-256-128))+rbx]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm6
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vmovdqa ymm15,YMMWORD[rbp]
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((224-128))+rax]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vmovdqa YMMWORD[(128-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((416-256-128))+rbx]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((256-256-128))+rbx]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vmovdqa YMMWORD[(160-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((448-256-128))+rbx]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((288-256-128))+rbx]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vmovdqa YMMWORD[(192-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((480-256-128))+rbx]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((320-256-128))+rbx]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vmovdqa YMMWORD[(224-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((0-128))+rax]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((352-256-128))+rbx]
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vmovdqa YMMWORD[(256-256-128)+rbx],ymm14
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((32-128))+rax]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm3
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((384-256-128))+rbx]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vmovdqa YMMWORD[(288-256-128)+rbx],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((64-128))+rax]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((416-256-128))+rbx]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vmovdqa YMMWORD[(320-256-128)+rbx],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((96-128))+rax]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((448-256-128))+rbx]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vmovdqa YMMWORD[(352-256-128)+rbx],ymm12
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((128-128))+rax]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((480-256-128))+rbx]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vmovdqa YMMWORD[(384-256-128)+rbx],ymm13
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((160-128))+rax]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((0-128))+rax]
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vmovdqa YMMWORD[(416-256-128)+rbx],ymm14
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((192-128))+rax]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm3
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((32-128))+rax]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vmovdqa YMMWORD[(448-256-128)+rbx],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((224-128))+rax]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((64-128))+rax]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vmovdqa YMMWORD[(480-256-128)+rbx],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((256-256-128))+rbx]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((96-128))+rax]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vmovdqa YMMWORD[(0-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((288-256-128))+rbx]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((128-128))+rax]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vmovdqa YMMWORD[(32-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((320-256-128))+rbx]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((160-128))+rax]
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vmovdqa YMMWORD[(64-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((352-256-128))+rbx]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm3
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((192-128))+rax]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vmovdqa YMMWORD[(96-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((384-256-128))+rbx]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((224-128))+rax]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vmovdqa YMMWORD[(128-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((416-256-128))+rbx]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((256-256-128))+rbx]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vmovdqa YMMWORD[(160-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((448-256-128))+rbx]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((288-256-128))+rbx]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vmovdqa YMMWORD[(192-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((480-256-128))+rbx]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((320-256-128))+rbx]
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vmovdqa YMMWORD[(224-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((0-128))+rax]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm3
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vmovdqa ymm15,YMMWORD[32+rbp]
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((352-256-128))+rbx]
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpand ymm6,ymm3,ymm2
vpxor ymm11,ymm11,YMMWORD[((32-128))+rax]
vpaddd ymm4,ymm4,ymm6
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm3,ymm2
vpxor ymm11,ymm11,ymm13
vmovdqu YMMWORD[(256-256-128)+rbx],ymm10
vpaddd ymm4,ymm4,ymm10
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm11,31
vpand ymm5,ymm5,ymm1
vpaddd ymm11,ymm11,ymm11
vpslld ymm6,ymm1,30
vpaddd ymm4,ymm4,ymm5
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((384-256-128))+rbx]
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpand ymm6,ymm2,ymm1
vpxor ymm12,ymm12,YMMWORD[((64-128))+rax]
vpaddd ymm3,ymm3,ymm6
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm2,ymm1
vpxor ymm12,ymm12,ymm14
vmovdqu YMMWORD[(288-256-128)+rbx],ymm11
vpaddd ymm3,ymm3,ymm11
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm12,31
vpand ymm5,ymm5,ymm0
vpaddd ymm12,ymm12,ymm12
vpslld ymm6,ymm0,30
vpaddd ymm3,ymm3,ymm5
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((416-256-128))+rbx]
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpand ymm6,ymm1,ymm0
vpxor ymm13,ymm13,YMMWORD[((96-128))+rax]
vpaddd ymm2,ymm2,ymm6
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm1,ymm0
vpxor ymm13,ymm13,ymm10
vmovdqu YMMWORD[(320-256-128)+rbx],ymm12
vpaddd ymm2,ymm2,ymm12
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm13,31
vpand ymm5,ymm5,ymm4
vpaddd ymm13,ymm13,ymm13
vpslld ymm6,ymm4,30
vpaddd ymm2,ymm2,ymm5
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((448-256-128))+rbx]
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpand ymm6,ymm0,ymm4
vpxor ymm14,ymm14,YMMWORD[((128-128))+rax]
vpaddd ymm1,ymm1,ymm6
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm0,ymm4
vpxor ymm14,ymm14,ymm11
vmovdqu YMMWORD[(352-256-128)+rbx],ymm13
vpaddd ymm1,ymm1,ymm13
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm14,31
vpand ymm5,ymm5,ymm3
vpaddd ymm14,ymm14,ymm14
vpslld ymm6,ymm3,30
vpaddd ymm1,ymm1,ymm5
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((480-256-128))+rbx]
vpaddd ymm0,ymm0,ymm15
vpslld ymm7,ymm1,5
vpand ymm6,ymm4,ymm3
vpxor ymm10,ymm10,YMMWORD[((160-128))+rax]
vpaddd ymm0,ymm0,ymm6
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm4,ymm3
vpxor ymm10,ymm10,ymm12
vmovdqu YMMWORD[(384-256-128)+rbx],ymm14
vpaddd ymm0,ymm0,ymm14
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm10,31
vpand ymm5,ymm5,ymm2
vpaddd ymm10,ymm10,ymm10
vpslld ymm6,ymm2,30
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((0-128))+rax]
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpand ymm6,ymm3,ymm2
vpxor ymm11,ymm11,YMMWORD[((192-128))+rax]
vpaddd ymm4,ymm4,ymm6
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm3,ymm2
vpxor ymm11,ymm11,ymm13
vmovdqu YMMWORD[(416-256-128)+rbx],ymm10
vpaddd ymm4,ymm4,ymm10
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm11,31
vpand ymm5,ymm5,ymm1
vpaddd ymm11,ymm11,ymm11
vpslld ymm6,ymm1,30
vpaddd ymm4,ymm4,ymm5
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((32-128))+rax]
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpand ymm6,ymm2,ymm1
vpxor ymm12,ymm12,YMMWORD[((224-128))+rax]
vpaddd ymm3,ymm3,ymm6
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm2,ymm1
vpxor ymm12,ymm12,ymm14
vmovdqu YMMWORD[(448-256-128)+rbx],ymm11
vpaddd ymm3,ymm3,ymm11
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm12,31
vpand ymm5,ymm5,ymm0
vpaddd ymm12,ymm12,ymm12
vpslld ymm6,ymm0,30
vpaddd ymm3,ymm3,ymm5
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((64-128))+rax]
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpand ymm6,ymm1,ymm0
vpxor ymm13,ymm13,YMMWORD[((256-256-128))+rbx]
vpaddd ymm2,ymm2,ymm6
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm1,ymm0
vpxor ymm13,ymm13,ymm10
vmovdqu YMMWORD[(480-256-128)+rbx],ymm12
vpaddd ymm2,ymm2,ymm12
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm13,31
vpand ymm5,ymm5,ymm4
vpaddd ymm13,ymm13,ymm13
vpslld ymm6,ymm4,30
vpaddd ymm2,ymm2,ymm5
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((96-128))+rax]
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpand ymm6,ymm0,ymm4
vpxor ymm14,ymm14,YMMWORD[((288-256-128))+rbx]
vpaddd ymm1,ymm1,ymm6
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm0,ymm4
vpxor ymm14,ymm14,ymm11
vmovdqu YMMWORD[(0-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm14,31
vpand ymm5,ymm5,ymm3
vpaddd ymm14,ymm14,ymm14
vpslld ymm6,ymm3,30
vpaddd ymm1,ymm1,ymm5
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((128-128))+rax]
vpaddd ymm0,ymm0,ymm15
vpslld ymm7,ymm1,5
vpand ymm6,ymm4,ymm3
vpxor ymm10,ymm10,YMMWORD[((320-256-128))+rbx]
vpaddd ymm0,ymm0,ymm6
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm4,ymm3
vpxor ymm10,ymm10,ymm12
vmovdqu YMMWORD[(32-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm10,31
vpand ymm5,ymm5,ymm2
vpaddd ymm10,ymm10,ymm10
vpslld ymm6,ymm2,30
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((160-128))+rax]
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpand ymm6,ymm3,ymm2
vpxor ymm11,ymm11,YMMWORD[((352-256-128))+rbx]
vpaddd ymm4,ymm4,ymm6
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm3,ymm2
vpxor ymm11,ymm11,ymm13
vmovdqu YMMWORD[(64-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm11,31
vpand ymm5,ymm5,ymm1
vpaddd ymm11,ymm11,ymm11
vpslld ymm6,ymm1,30
vpaddd ymm4,ymm4,ymm5
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((192-128))+rax]
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpand ymm6,ymm2,ymm1
vpxor ymm12,ymm12,YMMWORD[((384-256-128))+rbx]
vpaddd ymm3,ymm3,ymm6
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm2,ymm1
vpxor ymm12,ymm12,ymm14
vmovdqu YMMWORD[(96-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm12,31
vpand ymm5,ymm5,ymm0
vpaddd ymm12,ymm12,ymm12
vpslld ymm6,ymm0,30
vpaddd ymm3,ymm3,ymm5
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((224-128))+rax]
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpand ymm6,ymm1,ymm0
vpxor ymm13,ymm13,YMMWORD[((416-256-128))+rbx]
vpaddd ymm2,ymm2,ymm6
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm1,ymm0
vpxor ymm13,ymm13,ymm10
vmovdqu YMMWORD[(128-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm13,31
vpand ymm5,ymm5,ymm4
vpaddd ymm13,ymm13,ymm13
vpslld ymm6,ymm4,30
vpaddd ymm2,ymm2,ymm5
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((256-256-128))+rbx]
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpand ymm6,ymm0,ymm4
vpxor ymm14,ymm14,YMMWORD[((448-256-128))+rbx]
vpaddd ymm1,ymm1,ymm6
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm0,ymm4
vpxor ymm14,ymm14,ymm11
vmovdqu YMMWORD[(160-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm14,31
vpand ymm5,ymm5,ymm3
vpaddd ymm14,ymm14,ymm14
vpslld ymm6,ymm3,30
vpaddd ymm1,ymm1,ymm5
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((288-256-128))+rbx]
vpaddd ymm0,ymm0,ymm15
vpslld ymm7,ymm1,5
vpand ymm6,ymm4,ymm3
vpxor ymm10,ymm10,YMMWORD[((480-256-128))+rbx]
vpaddd ymm0,ymm0,ymm6
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm4,ymm3
vpxor ymm10,ymm10,ymm12
vmovdqu YMMWORD[(192-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm10,31
vpand ymm5,ymm5,ymm2
vpaddd ymm10,ymm10,ymm10
vpslld ymm6,ymm2,30
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((320-256-128))+rbx]
vpaddd ymm4,ymm4,ymm15
vpslld ymm7,ymm0,5
vpand ymm6,ymm3,ymm2
vpxor ymm11,ymm11,YMMWORD[((0-128))+rax]
vpaddd ymm4,ymm4,ymm6
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm3,ymm2
vpxor ymm11,ymm11,ymm13
vmovdqu YMMWORD[(224-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm11,31
vpand ymm5,ymm5,ymm1
vpaddd ymm11,ymm11,ymm11
vpslld ymm6,ymm1,30
vpaddd ymm4,ymm4,ymm5
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((352-256-128))+rbx]
vpaddd ymm3,ymm3,ymm15
vpslld ymm7,ymm4,5
vpand ymm6,ymm2,ymm1
vpxor ymm12,ymm12,YMMWORD[((32-128))+rax]
vpaddd ymm3,ymm3,ymm6
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm2,ymm1
vpxor ymm12,ymm12,ymm14
vmovdqu YMMWORD[(256-256-128)+rbx],ymm11
vpaddd ymm3,ymm3,ymm11
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm12,31
vpand ymm5,ymm5,ymm0
vpaddd ymm12,ymm12,ymm12
vpslld ymm6,ymm0,30
vpaddd ymm3,ymm3,ymm5
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((384-256-128))+rbx]
vpaddd ymm2,ymm2,ymm15
vpslld ymm7,ymm3,5
vpand ymm6,ymm1,ymm0
vpxor ymm13,ymm13,YMMWORD[((64-128))+rax]
vpaddd ymm2,ymm2,ymm6
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm1,ymm0
vpxor ymm13,ymm13,ymm10
vmovdqu YMMWORD[(288-256-128)+rbx],ymm12
vpaddd ymm2,ymm2,ymm12
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm13,31
vpand ymm5,ymm5,ymm4
vpaddd ymm13,ymm13,ymm13
vpslld ymm6,ymm4,30
vpaddd ymm2,ymm2,ymm5
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((416-256-128))+rbx]
vpaddd ymm1,ymm1,ymm15
vpslld ymm7,ymm2,5
vpand ymm6,ymm0,ymm4
vpxor ymm14,ymm14,YMMWORD[((96-128))+rax]
vpaddd ymm1,ymm1,ymm6
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm0,ymm4
vpxor ymm14,ymm14,ymm11
vmovdqu YMMWORD[(320-256-128)+rbx],ymm13
vpaddd ymm1,ymm1,ymm13
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm14,31
vpand ymm5,ymm5,ymm3
vpaddd ymm14,ymm14,ymm14
vpslld ymm6,ymm3,30
vpaddd ymm1,ymm1,ymm5
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((448-256-128))+rbx]
vpaddd ymm0,ymm0,ymm15
vpslld ymm7,ymm1,5
vpand ymm6,ymm4,ymm3
vpxor ymm10,ymm10,YMMWORD[((128-128))+rax]
vpaddd ymm0,ymm0,ymm6
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm4,ymm3
vpxor ymm10,ymm10,ymm12
vmovdqu YMMWORD[(352-256-128)+rbx],ymm14
vpaddd ymm0,ymm0,ymm14
vpor ymm7,ymm7,ymm8
vpsrld ymm9,ymm10,31
vpand ymm5,ymm5,ymm2
vpaddd ymm10,ymm10,ymm10
vpslld ymm6,ymm2,30
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vmovdqa ymm15,YMMWORD[64+rbp]
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((480-256-128))+rbx]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vmovdqa YMMWORD[(384-256-128)+rbx],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((160-128))+rax]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((0-128))+rax]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vmovdqa YMMWORD[(416-256-128)+rbx],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((192-128))+rax]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((32-128))+rax]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vmovdqa YMMWORD[(448-256-128)+rbx],ymm12
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((224-128))+rax]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((64-128))+rax]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vmovdqa YMMWORD[(480-256-128)+rbx],ymm13
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((256-256-128))+rbx]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((96-128))+rax]
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vmovdqa YMMWORD[(0-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((288-256-128))+rbx]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm3
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((128-128))+rax]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vmovdqa YMMWORD[(32-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((320-256-128))+rbx]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((160-128))+rax]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vmovdqa YMMWORD[(64-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((352-256-128))+rbx]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((192-128))+rax]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vmovdqa YMMWORD[(96-128)+rax],ymm12
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((384-256-128))+rbx]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((224-128))+rax]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vmovdqa YMMWORD[(128-128)+rax],ymm13
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((416-256-128))+rbx]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((256-256-128))+rbx]
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vmovdqa YMMWORD[(160-128)+rax],ymm14
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((448-256-128))+rbx]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm3
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((288-256-128))+rbx]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vmovdqa YMMWORD[(192-128)+rax],ymm10
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((480-256-128))+rbx]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((320-256-128))+rbx]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vmovdqa YMMWORD[(224-128)+rax],ymm11
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((0-128))+rax]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((352-256-128))+rbx]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((32-128))+rax]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((384-256-128))+rbx]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((64-128))+rax]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpxor ymm10,ymm10,ymm12
vmovdqa ymm12,YMMWORD[((416-256-128))+rbx]
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vpaddd ymm0,ymm0,ymm14
vpxor ymm10,ymm10,YMMWORD[((96-128))+rax]
vpsrld ymm8,ymm1,27
vpxor ymm5,ymm5,ymm3
vpxor ymm10,ymm10,ymm12
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm9,ymm10,31
vpaddd ymm10,ymm10,ymm10
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm10,ymm10,ymm9
vpor ymm2,ymm2,ymm6
vpxor ymm11,ymm11,ymm13
vmovdqa ymm13,YMMWORD[((448-256-128))+rbx]
vpslld ymm7,ymm0,5
vpaddd ymm4,ymm4,ymm15
vpxor ymm5,ymm3,ymm1
vpaddd ymm4,ymm4,ymm10
vpxor ymm11,ymm11,YMMWORD[((128-128))+rax]
vpsrld ymm8,ymm0,27
vpxor ymm5,ymm5,ymm2
vpxor ymm11,ymm11,ymm13
vpslld ymm6,ymm1,30
vpor ymm7,ymm7,ymm8
vpaddd ymm4,ymm4,ymm5
vpsrld ymm9,ymm11,31
vpaddd ymm11,ymm11,ymm11
vpsrld ymm1,ymm1,2
vpaddd ymm4,ymm4,ymm7
vpor ymm11,ymm11,ymm9
vpor ymm1,ymm1,ymm6
vpxor ymm12,ymm12,ymm14
vmovdqa ymm14,YMMWORD[((480-256-128))+rbx]
vpslld ymm7,ymm4,5
vpaddd ymm3,ymm3,ymm15
vpxor ymm5,ymm2,ymm0
vpaddd ymm3,ymm3,ymm11
vpxor ymm12,ymm12,YMMWORD[((160-128))+rax]
vpsrld ymm8,ymm4,27
vpxor ymm5,ymm5,ymm1
vpxor ymm12,ymm12,ymm14
vpslld ymm6,ymm0,30
vpor ymm7,ymm7,ymm8
vpaddd ymm3,ymm3,ymm5
vpsrld ymm9,ymm12,31
vpaddd ymm12,ymm12,ymm12
vpsrld ymm0,ymm0,2
vpaddd ymm3,ymm3,ymm7
vpor ymm12,ymm12,ymm9
vpor ymm0,ymm0,ymm6
vpxor ymm13,ymm13,ymm10
vmovdqa ymm10,YMMWORD[((0-128))+rax]
vpslld ymm7,ymm3,5
vpaddd ymm2,ymm2,ymm15
vpxor ymm5,ymm1,ymm4
vpaddd ymm2,ymm2,ymm12
vpxor ymm13,ymm13,YMMWORD[((192-128))+rax]
vpsrld ymm8,ymm3,27
vpxor ymm5,ymm5,ymm0
vpxor ymm13,ymm13,ymm10
vpslld ymm6,ymm4,30
vpor ymm7,ymm7,ymm8
vpaddd ymm2,ymm2,ymm5
vpsrld ymm9,ymm13,31
vpaddd ymm13,ymm13,ymm13
vpsrld ymm4,ymm4,2
vpaddd ymm2,ymm2,ymm7
vpor ymm13,ymm13,ymm9
vpor ymm4,ymm4,ymm6
vpxor ymm14,ymm14,ymm11
vmovdqa ymm11,YMMWORD[((32-128))+rax]
vpslld ymm7,ymm2,5
vpaddd ymm1,ymm1,ymm15
vpxor ymm5,ymm0,ymm3
vpaddd ymm1,ymm1,ymm13
vpxor ymm14,ymm14,YMMWORD[((224-128))+rax]
vpsrld ymm8,ymm2,27
vpxor ymm5,ymm5,ymm4
vpxor ymm14,ymm14,ymm11
vpslld ymm6,ymm3,30
vpor ymm7,ymm7,ymm8
vpaddd ymm1,ymm1,ymm5
vpsrld ymm9,ymm14,31
vpaddd ymm14,ymm14,ymm14
vpsrld ymm3,ymm3,2
vpaddd ymm1,ymm1,ymm7
vpor ymm14,ymm14,ymm9
vpor ymm3,ymm3,ymm6
vpslld ymm7,ymm1,5
vpaddd ymm0,ymm0,ymm15
vpxor ymm5,ymm4,ymm2
vpsrld ymm8,ymm1,27
vpaddd ymm0,ymm0,ymm14
vpxor ymm5,ymm5,ymm3
vpslld ymm6,ymm2,30
vpor ymm7,ymm7,ymm8
vpaddd ymm0,ymm0,ymm5
vpsrld ymm2,ymm2,2
vpaddd ymm0,ymm0,ymm7
vpor ymm2,ymm2,ymm6
mov ecx,1
lea rbx,[512+rsp]
cmp ecx,DWORD[rbx]
cmovge r12,rbp
cmp ecx,DWORD[4+rbx]
cmovge r13,rbp
cmp ecx,DWORD[8+rbx]
cmovge r14,rbp
cmp ecx,DWORD[12+rbx]
cmovge r15,rbp
cmp ecx,DWORD[16+rbx]
cmovge r8,rbp
cmp ecx,DWORD[20+rbx]
cmovge r9,rbp
cmp ecx,DWORD[24+rbx]
cmovge r10,rbp
cmp ecx,DWORD[28+rbx]
cmovge r11,rbp
vmovdqu ymm5,YMMWORD[rbx]
vpxor ymm7,ymm7,ymm7
vmovdqa ymm6,ymm5
vpcmpgtd ymm6,ymm6,ymm7
vpaddd ymm5,ymm5,ymm6
vpand ymm0,ymm0,ymm6
vpand ymm1,ymm1,ymm6
vpaddd ymm0,ymm0,YMMWORD[rdi]
vpand ymm2,ymm2,ymm6
vpaddd ymm1,ymm1,YMMWORD[32+rdi]
vpand ymm3,ymm3,ymm6
vpaddd ymm2,ymm2,YMMWORD[64+rdi]
vpand ymm4,ymm4,ymm6
vpaddd ymm3,ymm3,YMMWORD[96+rdi]
vpaddd ymm4,ymm4,YMMWORD[128+rdi]
vmovdqu YMMWORD[rdi],ymm0
vmovdqu YMMWORD[32+rdi],ymm1
vmovdqu YMMWORD[64+rdi],ymm2
vmovdqu YMMWORD[96+rdi],ymm3
vmovdqu YMMWORD[128+rdi],ymm4
vmovdqu YMMWORD[rbx],ymm5
lea rbx,[((256+128))+rsp]
vmovdqu ymm9,YMMWORD[96+rbp]
dec edx
jnz NEAR $L$oop_avx2
$L$done_avx2:
mov rax,QWORD[544+rsp]
vzeroupper
movaps xmm6,XMMWORD[((-216))+rax]
movaps xmm7,XMMWORD[((-200))+rax]
movaps xmm8,XMMWORD[((-184))+rax]
movaps xmm9,XMMWORD[((-168))+rax]
movaps xmm10,XMMWORD[((-152))+rax]
movaps xmm11,XMMWORD[((-136))+rax]
movaps xmm12,XMMWORD[((-120))+rax]
movaps xmm13,XMMWORD[((-104))+rax]
movaps xmm14,XMMWORD[((-88))+rax]
movaps xmm15,XMMWORD[((-72))+rax]
mov r15,QWORD[((-48))+rax]
mov r14,QWORD[((-40))+rax]
mov r13,QWORD[((-32))+rax]
mov r12,QWORD[((-24))+rax]
mov rbp,QWORD[((-16))+rax]
mov rbx,QWORD[((-8))+rax]
lea rsp,[rax]
$L$epilogue_avx2:
mov rdi,QWORD[8+rsp] ;WIN64 epilogue
mov rsi,QWORD[16+rsp]
DB 0F3h,0C3h ;repret
$L$SEH_end_sha1_multi_block_avx2:
ALIGN 256
DD 0x5a827999,0x5a827999,0x5a827999,0x5a827999
DD 0x5a827999,0x5a827999,0x5a827999,0x5a827999
K_XX_XX:
DD 0x6ed9eba1,0x6ed9eba1,0x6ed9eba1,0x6ed9eba1
DD 0x6ed9eba1,0x6ed9eba1,0x6ed9eba1,0x6ed9eba1
DD 0x8f1bbcdc,0x8f1bbcdc,0x8f1bbcdc,0x8f1bbcdc
DD 0x8f1bbcdc,0x8f1bbcdc,0x8f1bbcdc,0x8f1bbcdc
DD 0xca62c1d6,0xca62c1d6,0xca62c1d6,0xca62c1d6
DD 0xca62c1d6,0xca62c1d6,0xca62c1d6,0xca62c1d6
DD 0x00010203,0x04050607,0x08090a0b,0x0c0d0e0f
DD 0x00010203,0x04050607,0x08090a0b,0x0c0d0e0f
DB 0xf,0xe,0xd,0xc,0xb,0xa,0x9,0x8,0x7,0x6,0x5,0x4,0x3,0x2,0x1,0x0
DB 83,72,65,49,32,109,117,108,116,105,45,98,108,111,99,107
DB 32,116,114,97,110,115,102,111,114,109,32,102,111,114,32,120
DB 56,54,95,54,52,44,32,67,82,89,80,84,79,71,65,77
DB 83,32,98,121,32,60,97,112,112,114,111,64,111,112,101,110
DB 115,115,108,46,111,114,103,62,0
EXTERN __imp_RtlVirtualUnwind
ALIGN 16
se_handler:
push rsi
push rdi
push rbx
push rbp
push r12
push r13
push r14
push r15
pushfq
sub rsp,64
mov rax,QWORD[120+r8]
mov rbx,QWORD[248+r8]
mov rsi,QWORD[8+r9]
mov r11,QWORD[56+r9]
mov r10d,DWORD[r11]
lea r10,[r10*1+rsi]
cmp rbx,r10
jb NEAR $L$in_prologue
mov rax,QWORD[152+r8]
mov r10d,DWORD[4+r11]
lea r10,[r10*1+rsi]
cmp rbx,r10
jae NEAR $L$in_prologue
mov rax,QWORD[272+rax]
mov rbx,QWORD[((-8))+rax]
mov rbp,QWORD[((-16))+rax]
mov QWORD[144+r8],rbx
mov QWORD[160+r8],rbp
lea rsi,[((-24-160))+rax]
lea rdi,[512+r8]
mov ecx,20
DD 0xa548f3fc
$L$in_prologue:
mov rdi,QWORD[8+rax]
mov rsi,QWORD[16+rax]
mov QWORD[152+r8],rax
mov QWORD[168+r8],rsi
mov QWORD[176+r8],rdi
mov rdi,QWORD[40+r9]
mov rsi,r8
mov ecx,154
DD 0xa548f3fc
mov rsi,r9
xor rcx,rcx
mov rdx,QWORD[8+rsi]
mov r8,QWORD[rsi]
mov r9,QWORD[16+rsi]
mov r10,QWORD[40+rsi]
lea r11,[56+rsi]
lea r12,[24+rsi]
mov QWORD[32+rsp],r10
mov QWORD[40+rsp],r11
mov QWORD[48+rsp],r12
mov QWORD[56+rsp],rcx
call QWORD[__imp_RtlVirtualUnwind]
mov eax,1
add rsp,64
popfq
pop r15
pop r14
pop r13
pop r12
pop rbp
pop rbx
pop rdi
pop rsi
DB 0F3h,0C3h ;repret
ALIGN 16
avx2_handler:
push rsi
push rdi
push rbx
push rbp
push r12
push r13
push r14
push r15
pushfq
sub rsp,64
mov rax,QWORD[120+r8]
mov rbx,QWORD[248+r8]
mov rsi,QWORD[8+r9]
mov r11,QWORD[56+r9]
mov r10d,DWORD[r11]
lea r10,[r10*1+rsi]
cmp rbx,r10
jb NEAR $L$in_prologue
mov rax,QWORD[152+r8]
mov r10d,DWORD[4+r11]
lea r10,[r10*1+rsi]
cmp rbx,r10
jae NEAR $L$in_prologue
mov rax,QWORD[544+r8]
mov rbx,QWORD[((-8))+rax]
mov rbp,QWORD[((-16))+rax]
mov r12,QWORD[((-24))+rax]
mov r13,QWORD[((-32))+rax]
mov r14,QWORD[((-40))+rax]
mov r15,QWORD[((-48))+rax]
mov QWORD[144+r8],rbx
mov QWORD[160+r8],rbp
mov QWORD[216+r8],r12
mov QWORD[224+r8],r13
mov QWORD[232+r8],r14
mov QWORD[240+r8],r15
lea rsi,[((-56-160))+rax]
lea rdi,[512+r8]
mov ecx,20
DD 0xa548f3fc
jmp NEAR $L$in_prologue
section .pdata rdata align=4
ALIGN 4
DD $L$SEH_begin_sha1_multi_block wrt ..imagebase
DD $L$SEH_end_sha1_multi_block wrt ..imagebase
DD $L$SEH_info_sha1_multi_block wrt ..imagebase
DD $L$SEH_begin_sha1_multi_block_shaext wrt ..imagebase
DD $L$SEH_end_sha1_multi_block_shaext wrt ..imagebase
DD $L$SEH_info_sha1_multi_block_shaext wrt ..imagebase
DD $L$SEH_begin_sha1_multi_block_avx wrt ..imagebase
DD $L$SEH_end_sha1_multi_block_avx wrt ..imagebase
DD $L$SEH_info_sha1_multi_block_avx wrt ..imagebase
DD $L$SEH_begin_sha1_multi_block_avx2 wrt ..imagebase
DD $L$SEH_end_sha1_multi_block_avx2 wrt ..imagebase
DD $L$SEH_info_sha1_multi_block_avx2 wrt ..imagebase
section .xdata rdata align=8
ALIGN 8
$L$SEH_info_sha1_multi_block:
DB 9,0,0,0
DD se_handler wrt ..imagebase
DD $L$body wrt ..imagebase,$L$epilogue wrt ..imagebase
$L$SEH_info_sha1_multi_block_shaext:
DB 9,0,0,0
DD se_handler wrt ..imagebase
DD $L$body_shaext wrt ..imagebase,$L$epilogue_shaext wrt ..imagebase
$L$SEH_info_sha1_multi_block_avx:
DB 9,0,0,0
DD se_handler wrt ..imagebase
DD $L$body_avx wrt ..imagebase,$L$epilogue_avx wrt ..imagebase
$L$SEH_info_sha1_multi_block_avx2:
DB 9,0,0,0
DD avx2_handler wrt ..imagebase
DD $L$body_avx2 wrt ..imagebase,$L$epilogue_avx2 wrt ..imagebase
|
Transynther/x86/_processed/NC/_st_zr_un_/i7-7700_9_0xca.log_10313_1752.asm | ljhsiun2/medusa | 9 | 164556 | <filename>Transynther/x86/_processed/NC/_st_zr_un_/i7-7700_9_0xca.log_10313_1752.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r15
push %r9
push %rbx
push %rdx
lea addresses_D_ht+0x24c3, %r15
nop
nop
nop
sub %r10, %r10
movb $0x61, (%r15)
nop
add $6509, %r9
lea addresses_UC_ht+0x4fb3, %rbx
nop
nop
nop
nop
nop
cmp %rdx, %rdx
movw $0x6162, (%rbx)
nop
nop
nop
nop
nop
and %rbx, %rbx
pop %rdx
pop %rbx
pop %r9
pop %r15
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r14
push %r15
push %rcx
push %rdi
push %rdx
push %rsi
// REPMOV
lea addresses_RW+0x1bc63, %rsi
lea addresses_normal+0x12263, %rdi
nop
nop
nop
nop
nop
sub %r14, %r14
mov $12, %rcx
rep movsw
and $60120, %rdi
// Load
lea addresses_UC+0xc063, %rdi
nop
nop
nop
nop
xor %rdx, %rdx
mov (%rdi), %r14d
nop
nop
nop
nop
add %rdx, %rdx
// Store
mov $0x6a3, %rdi
nop
nop
sub $36867, %r14
movl $0x51525354, (%rdi)
nop
nop
nop
nop
nop
sub $40006, %rcx
// Faulty Load
mov $0x5630a10000000263, %rsi
nop
nop
nop
nop
nop
sub %r10, %r10
mov (%rsi), %ecx
lea oracles, %rdi
and $0xff, %rcx
shlq $12, %rcx
mov (%rdi,%rcx,1), %rcx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %r15
pop %r14
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'congruent': 0, 'AVXalign': False, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_NC'}, 'OP': 'LOAD'}
{'src': {'congruent': 7, 'same': False, 'type': 'addresses_RW'}, 'OP': 'REPM', 'dst': {'congruent': 11, 'same': False, 'type': 'addresses_normal'}}
{'src': {'congruent': 9, 'AVXalign': False, 'same': False, 'size': 4, 'NT': False, 'type': 'addresses_UC'}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'congruent': 6, 'AVXalign': False, 'same': False, 'size': 4, 'NT': False, 'type': 'addresses_P'}}
[Faulty Load]
{'src': {'congruent': 0, 'AVXalign': False, 'same': True, 'size': 4, 'NT': False, 'type': 'addresses_NC'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'OP': 'STOR', 'dst': {'congruent': 2, 'AVXalign': False, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_D_ht'}}
{'OP': 'STOR', 'dst': {'congruent': 4, 'AVXalign': False, 'same': False, 'size': 2, 'NT': False, 'type': 'addresses_UC_ht'}}
{'0e': 1, '32': 9662, '00': 637, '5f': 13}
0e 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 00 32 32 32 32 32 32 00 32 32 32 32 32 00 32 32 32 32 32 32 00 32 00 32 32 32 32 32 00 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 00 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 00 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 00 32 00 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 00 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 00 32 00 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 00 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 00 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 00 00 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 00 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32
*/
|
programs/oeis/028/A028735.asm | neoneye/loda | 22 | 10081 | <reponame>neoneye/loda<filename>programs/oeis/028/A028735.asm
; A028735: Nonsquares mod 22.
; 2,6,7,8,10,13,17,18,19,21
seq $0,267541 ; Expansion of (2 + 4*x + x^2 + x^3 + 2*x^4 + x^5)/(1 - x - x^5 + x^6).
|
b2plasma.asm | littleli/boot2plasma | 3 | 89112 | <reponame>littleli/boot2plasma<filename>b2plasma.asm
; boot2plasma
include '80386.inc'
include '80387.inc'
use16
org 0x7C00
spd1 equ 1
spd2 equ 2
spd3 equ 3
spd4 equ 4
RED equ 0
GREEN equ 1
BLUE equ 2
color1 equ GREEN
color2 equ BLUE
entrypoint:
push cs
pop ds
push cs
pop es
xor bx, bx
; palette computation
mov ax, 0x3F00
mov di, pal1
mov cx, 768 * 3
rep stosb ; in DI rests offset of waves
pal_loop:
mov [bx + pal1 + RED + 0 * 3], al
mov [bx + pal1 + RED + 64 * 3], ah
mov [bx + pal1 + GREEN + 128 * 3], al
mov [bx + pal1 + GREEN + 192 * 3], ah
mov [bx + pal2 + GREEN + 0 * 3], al
mov [bx + pal2 + GREEN + 64 * 3], ah
mov [bx + pal2 + BLUE + 128 * 3], al
mov [bx + pal2 + BLUE + 192 * 3], ah
mov [bx + pal3 + BLUE + 0 * 3], al
mov [bx + pal3 + BLUE + 64 * 3], ah
mov [bx + pal3 + RED + 128 * 3], al
mov [bx + pal3 + RED + 192 * 3], ah
dec ah
inc al
add bx, 3
cmp bx, 64 * 3
jl pal_loop
; waves computation
mov cx, 0x100 ; array size of 0x100
finit ; coprocessor init
wave_loop:
fld dword [konst]
fimul word [x] ; st0<-st0*x x*(pi/128)
fsin ; st0<-sin(x*pi/128) sin(x*pi/128)
fstp st1
fld1 ; st0<-1!
fadd st0, st1 ; st0<-st0+st1 1+sin(x*pi/128)
fimul word [THIRTY] ; st0<-st0*30 30*(1+sin(x*pi/128))
; st0<-result before conversion
; and store to memory
fistp word [di]
inc di
inc word [x]
loop wave_loop
; vga init
mov ax, 0x13
int 0x10 ; VGA mode 320x200, 8 bits per pixel
; tweek vga mode
cli
mov dx, 0x3C4 ; reprogram vga to adjust size to 80x50
mov ax, 0x604
out dx, ax
mov ax, 0xF02
out dx, ax
add dx, 0x10 ; 0x3C4 + 0x10
mov ax, 0x14
out dx, ax
mov ax, 0xE317
out dx, ax
mov al, 9
out dx, al
inc dx
in al, dx
and al, 0xE0
add al, 7
out dx, al
sti
mov cx, 0x100
mov dx, pal1
call set_palette
push word 0xA000
pop es
waitvr: mov dx, 0x3DA
w1: in al, dx
and al, 8
jnz w1
w2: in al, dx
and al, 8
jz w2
xor bp, bp
mov ax, [pos1]
mov [tpos1], ax
mov ch, 0x32
for_y: mov ax, [pos3]
mov [tpos3], ax
mov cl, 0x50
for_x: mov si, tpos1
mov bx, waves
mov ah, 0
mov dl, 4
s1: lodsb
xlatb
add ah, al
dec dl
jnz s1
mov [es:bp], ah
inc bp
inc byte [tpos3]
add byte [tpos4], 3
dec cl
jnz for_x
add byte [tpos1], 2
inc byte [tpos2]
dec ch
jnz for_y
add byte [pos1], spd1
sub byte [pos2], spd2
add byte [pos3], spd3
sub byte [pos4], spd4
in al, 0x60
dec al
jnz waitvr
push cx
push dx
mov dx, [pal_offset]
add dx, 768
cmp dx, pal3
jng next_pal
mov dx, pal1 ; reset offset
next_pal:
mov [pal_offset], dx
mov cx, 0x100
call set_palette
pop dx
pop cx
jmp waitvr
set_palette: ; cx = colors, es:dx = palette address offset
push es
push ax
push bx
push cs
pop es
mov ax, 0x1012
xor bx, bx
int 0x10 ; use bios service call to set the palette
pop bx
pop ax
pop es
ret
; the end of code section
pos1: db 0
pos2: db 0
pos3: db 0
pos4: db 0
pal_offset:
dw pal1
; pi = 355 ⁄ 113
konst: dd 355.0 / 113 / 128 ; pi / 128
THIRTY: dw 30
x: dw 0
rb 0x7C00 + 0x200 - 2 - $
db 0x55, 0xAA
; the end of boot sector
tpos1: rb 1
tpos2: rb 1
tpos3: rb 1
tpos4: rb 1
pal1: rb 768
pal2: rb 768
pal3: rb 768
waves: rb 256
|
programs/4bit_and_subroutine.asm | Kostu96/K4004 | 1 | 3152 | ; four bit "AND" routine on the Intel 4004
;
START FIM P4, 0 ; LOAD ROM PORT 0 ADDRESS
SRC P4 ; SEND ROM PORT ADDRESS
RDR ; READ INPUT A
XCH R0 ; A TO REGISTER 0
INC R8 ; LOAD ROM PORT 1 ADDRESS
SRC P4 ; SEND ROM PORT ADDRESS
RDR ; READ INPUT B
XCH R1 ; B TO REGISTER 1
JMS AND ; EXECUTE "AND"
XCH R2 ; LOAD RESULT C
WMP ; STORE AT MEMORY PORT 0
JUN START ; RESTART
NOP
; "AND" subroutine
*=24
AND CLB ; CLEAR ACCUMULATOR AND CARRY
XCH R2 ; CLEAR REGISTER 2
LDM 4 ; LOAD LOOP COUNT (LC)
AND_3 XCH R0 ; LOAD A, LC TO REGISTER 0
RAR ; ROTATE LEAST SIGNIFICANT BIT TO CARRY
XCH R0 ; RETURN ROTATED A TO REG 0, LC TO ACC
JCN CZ, ROTR1 ; JUMP TO ROTR1 IF CARRY ZERO
XCH R1 ; LOAD B, LC TO ACCUMULATOR
RAR ; ROTATE LEAST SIGNIFICANT BIT TO CARRY
XCH R1 ; RETURN ROTATED B TO REG 1, LC TO ACC
ROTR2 XCH R2 ; LOAD PARTIAL RESULT C, LC TO REG 2
RAR ; ROTATE CARRY INTO PARTIAL RESULT MSB
XCH R2 ; LOAD LC, RETURN C TO REGISTER 2
DAC ; DECREMENT THE ACCUMULATOR (LC)
JCN ANZ, AND_3 ; LOOP IF LC NON ZERO
BBL 0 ; RETURN
ROTR1 XCH R1 ; LOAD B, LC TO REGISTER 1
RAR ; ROTATE B
XCH R1 ; RETURN ROTATED B TO REG 1, LC TO ACC
CLC ; CLEAR CARRY
JUN ROTR2 ; RETURN TO LOOP
CZ=10
ANZ=12
|
grayscale.scpt | axpensive/mac-auto-grayscale | 0 | 2948 | # System PreferencesのAccessibilityを開きます。
tell application "System Preferences"
launch
reveal anchor "Seeing_ColorFilters" of pane "Accessibility"
end tell
tell application "System Events"
tell application process "System Preferences"
delay 1
tell window "Accessibility"
# 設定画面が出るまで待ちます。
repeat until exists checkbox "Enable Color Filters" of tab group 1 of group 1
delay 0.01
end repeat
# グレースケールをon/offします。
click first checkbox of tab group 1 of group 1
end tell
end tell
end tell
# windowを閉じます。
tell application "System Preferences" to if it is running then quit
|
Notebook Export Manager.applescript | BitRancher/notebook-export-manager | 6 | 2137 | --
-- Notebook Export Manager: An Applescript to export data from Evernote
--
-- Copyright (c) 2021 <NAME>
-- Licensed under the MIT license. See accompanying documentation.
--
-- This works with the version of evernote installed from their website,
-- but not with the Apple Mac App Store version 10 which doesn't
-- support AppleScript at this time (Feb 2021).
-- Runs successfully on macOS Catalina (10.15.7) and Big Sur (11.1) with Evernote 7.14
-- 0.4.2 fix locale problem caused by date in string literal
-- 0.5.0 fix file Kind search for macOS Monterery (12.0.1): HTML files on disk now
-- show file Kind "HTML document", not "HTML text"
-- To get Finder write
use scripting additions
-- To get NSString access in urlEncode handler
-- use framework "Foundation" removed in 0.3.2
--
-- Users may wish to change these initial values
--
global logProgress -- switch to control Log statements for debugging
set logProgress to false -- run Log commands for debugging USER SETTING
global alwaysBuildTopIndex
set alwaysBuildTopIndex to true -- force rebuild of top-level index USER SETTING
-- The following setting might be useful if you make changes to the buildNoteIndex handler
-- and you want to rebuild the index pages for each notebook without actually exporting
-- all the notes from Evernote again.
global alwaysBuildBookIndexes
set alwaysBuildBookIndexes to false -- force rebuild of notebook indexes USER SETTING
global myPListFullPath -- PList full path + file name
-- The Property List file for this application (USER SETTING):
-- Store it in [my home folder]/Library/Preferences:
set myPListFullPath to POSIX path of ((path to preferences as text) & "com.lake91.nem.plist") -- Folder for preferences
-- Or, store it in Downloads, just for testing (comment this out to use standard location)
-- set myPListFullPath to POSIX path of ((path to downloads folder as text) & "com.lake91.enexp.plist") -- Test folder
-- Global variables
--
global parentTagNames, parentTagHTML -- cache of tag names
set parentTagNames to {} -- list of tag names already looked up
set parentTagHTML to {} -- corresponding list of parent tag HTML
global offsetGMT -- offset to GMT in seconds
set offsetGMT to time to GMT -- get offset to GMT in seconds
global headerInfo -- system info to store as comment in index pages
set headerInfo to "" -- initially empty
global plExportTypeDesc -- Descriptions for options
global myCSSfile, myJSfile, myTagFile, myTopIndex -- file names for top-level folder
global nbIndexFile -- filename for notebook index pages
global FolderHTML, FolderENEX, AllNotebooks, SearchString -- Properties
global ExportAsHTML, ExportAsENEX, TimeoutMinutes, BooksSelected, ExportDate -- Properties
global frontProcess -- name of our process
set myCSSfile to "enstyles.css" -- CSS file name for html export folder
set myJSfile to "enscripts.js" -- JS file name for html export folder
set myTagFile to "entags.html" -- master tag list file for html export folder
set myTopIndex to "index.html" -- name of the top-level index page listing all notebooks
set nbIndexFile to "index.html" -- name of the notebook index page listing all notes
-- For internal timing
global timerAll, timerSub1
set timerAll to 0
set timerSub1 to 0
if logProgress then log "Property List file: " & myPListFullPath
set plExportTypeDesc to {"Export only in HTML format", "Export only in ENEX format", "Export in both HTML and ENEX formats"}
-- Set initial defaults for properties
set FolderHTML to path to documents folder as text -- Path for HTML exports
set FolderENEX to path to documents folder as text -- Path for ENEX exports
set AllNotebooks to true -- export all notebooks, not just some
set SearchString to "" -- assume no user-supplied search string
set ExportAsHTML to true -- Export notebooks in HTML format
set ExportAsENEX to true -- Export notebooks in ENEX format
set BooksSelected to {} -- List of notebooks to export
set ExportDate to initDate(2000, 1, 1) -- No exports have been done yet 0.4.2
set TimeoutMinutes to 30 -- Default timeout
-- Wake up Evernote and then switch back to this script
tell application "System Events" to set frontProcess to the name of every process whose frontmost is true -- get our process name
if logProgress then log "frontProcess: " & frontProcess
if application "Evernote" is not running then
activate application "Evernote" -- start evernote if not already running
delay 5 -- give it a few seconds to crank up
activate frontProcess -- Switch back to our app so user sees the prompts
delay 2
end if
--
-- Get Properties from PList file
-- Create Piist if necessary and Get current values from Property List file
--
set plistPrompt to not managePlist(1) -- Get PList values (returns false if the PList file did not exist)
activate frontProcess -- Switch back to our app so user sees the prompts
delay 1
--
-- Loop to prompt the user to start the export or to adjust the settings
--
repeat -- Until user clicks Export Now or Cancel
if plistPrompt then -- If PList is new or it's a second pass through this loop
-- Show Properties and allow user to make changes
if not managePlist(2) then return -- update PList; quit if user cancels
activate frontProcess -- Switch back to our app so user sees the prompts
delay 1 -- give it a second
end if
set plistPrompt to true -- If we loop in the repeat, let user update PList
set msg to "Will consider " & cond(AllNotebooks, "all notebooks", ("only " & (count of BooksSelected) & " selected notebooks")) & " for export to
HTML: " & cond(ExportAsHTML, POSIX path of FolderHTML, "(not to be exported)") & "
ENEX: " & cond(ExportAsENEX, POSIX path of FolderENEX, "(not to be exported)") & "
" & cond(length of SearchString > 0, "Only notes meeting this criteria will be exported:
" & SearchString, "All notes will be exported in each notebook") & "
Start export now or change settings."
if ("Export Now" = (button returned of (display dialog msg buttons {"Export now", "Change settings", "Cancel"} default button 1 cancel button 3 with title "Ready to Export" with icon note))) then exit repeat
end repeat
set timerAll to getFineTime() -- get time at start ot run
--
-- Build a list of notebooks to consider, either all of them or a selected list
--
set exportBooks to BooksSelected -- assume a user-selected list
if AllNotebooks then set exportBooks to getBooks() -- get sorted list of all notebooks
--
-- Check that the volumes containing the output folders are mounted (eg, if on a USB stick)
--
if ExportAsENEX then
if not checkRunVol(FolderENEX, "ENEX") then return -- check volume and folder; quit if not found
end if
if ExportAsHTML then
if not checkRunVol(FolderHTML, "HTML") then return -- check volume and folder; quit if not found
end if
--
-- Set up counters for the main processing loop
--
with timeout of (TimeoutMinutes * 60) seconds -- run this code with a timeout
set countENEXtried to 0 -- init count of attempted ENEX exports
set countHTMLtried to 0 -- init count of attempted HTML exports
set countENEXdone to 0 -- init count of completed ENEX exports
set countHTMLdone to 0 -- init count of completed HTML exports
set countBooksAttempted to length of exportBooks -- count of notebooks being attempted
set ExportDate to current date -- Set date of main index rebuild
set progress total steps to (length of exportBooks) -- set up progress display
set progress completed steps to 0
set progress description to "Exporting notebooks"
set pcounter to 0
--
-- This is the main loop for this script
-- Export each eligible notebook in sequence
--
repeat with aBook in exportBooks -- repeat with each notebook name
if ExportAsENEX then -- if ENEX export was requested
set progress additional description to "Exporting " & aBook & " as ENEX" -- set progress display detail
set countENEXtried to countENEXtried + 1 -- count attempts
if exportNotes(aBook, (POSIX path of FolderENEX) & my repl(aBook, "/", "_") & ".enex", "ENEX") then set countENEXdone to countENEXdone + 1 -- export as ENEX anc count successes
end if
if ExportAsHTML then -- if HTML export was requested
set progress additional description to "Exporting " & aBook & " as HTML" -- set progress display detail
set countHTMLtried to countHTMLtried + 1 -- count attempts
set outHTML to (POSIX path of FolderHTML) & my repl(aBook, "/", "_") & "/" -- build HTML export folder path
set expSome to exportNotes(aBook, outHTML, "HTML") -- Try to export notebook
if expSome then set countHTMLdone to countHTMLdone + 1 -- count successful exports
if expSome or alwaysBuildBookIndexes then buildNoteIndex(aBook, outHTML, expSome) -- build the index.html file for this notebook
end if
set pcounter to pcounter + 1 -- increment the progress display counter
set progress completed steps to pcounter -- and ask Applescript to display it
end repeat
--
-- Build the top-level index.html page if anything was exported
-- or if it doesn't exist or if it is to be built every time.
--
tell application "Finder" to set gotIndex to (exists (FolderHTML & myTopIndex)) -- does top index exist ?
if (countHTMLdone > 0) or (not gotIndex) or alwaysBuildTopIndex then buildTopIndex() -- rebuild top index if missing or outdated
if (countENEXdone > 0) or (countHTMLdone > 0) then set x to managePlist(3) -- Update the Property List file with new Export Date
set progress total steps to 0 -- shut down the progress display
set progress completed steps to 0
set progress description to ""
set progress additional description to ""
set timerAll to getFineTime() - timerAll -- elapsed seconds for run
-- display alert "Run Time: " & timerAll & " Sub Time: " & timerSub1
--
-- Display results and exit
--
display alert cond((countENEXdone + countHTMLdone) > 0, "Some notebooks exported", "No notebooks exported") message ((countBooksAttempted as text) & " Notebooks considered
" & countHTMLdone & " of " & countHTMLtried & " exported as HTML and
" & countENEXdone & " of " & countENEXtried & " exported as ENEX
(Export time (secs): " & (timerAll as integer) & ", index read: " & (timerSub1 as integer) & ")")
end timeout
return -- end execution of this script
--
-- Select notes and export them
-- bName is the notebook name (text)
-- oFIle is the full pathname of the output file (ENEX) or folder (HTML)
-- oType is either "ENEX" or "HTML"
-- Returns True if some were exported; else False
-- A lot of logic in this handler is devoted to handling notebooks whose
-- name contains a quote (").
--
on exportNotes(bName, oFile, oType)
local f, fileExists, datesrch, enexp, srch, someNotes
local selectedNotes, d, cu, b, c, i, m, w, j
if logProgress then log "Exporting notebook: " & bName & " to file: " & oFile & " as " & oType
tell application "Evernote" to set f to exists notebook bName -- does notebook exist?
if not f then return false -- if not, stop now and return
-- set QuoteInName to cond((offset of "\"" in bName) > 0, true, false) -- notebook name contains "
tell application "Finder" to set fileExists to (exists oFile as POSIX file) -- check for output file existence
set datesrch to "" -- Assume this notebook has never been exported
set enexp to "" -- assume no export-date found in existing exported notebook
if fileExists then -- if output file already exists
-- if oType = "ENEX" then tell application "System Events" to set enexp to value of XML attribute "export-date" of XML element "en-export" of XML file oFile -- Get export date/time from inside ENEX file (this was very slow for large ENEX files and was replaced in ver 0.3.2)
if oType = "ENEX" then set enexp to item 1 of readIndex(POSIX file oFile, {"<en-export export-date=\""}, {"\""}, 500) -- Get export date/time from inside ENEX file
if oType = "HTML" then set enexp to item 1 of readIndex(POSIX file (oFile & nbIndexFile), {"<!-- bookexported "}, {" bookexported -->"}, 500) -- get export from HTML comment
if (length of enexp) > 0 then set datesrch to " updated:" & enexp -- Set export date clause for search string
end if
if (offset of "\"" in bName) = 0 then -- if normal notebook name (no " in it)
set srch to "notebook:\"" & bName & "\" " & SearchString -- Build basic search string for EXPORT
tell application "Evernote" to set someNotes to find notes srch & datesrch -- any updated notes?
if logProgress then log oType & " note count for: " & bName & " is: " & (count of someNotes) & " with search: " & srch & datesrch
if (count of someNotes) = 0 then return false -- If no new notes, don't export this notebook
tell application "Evernote" to set selectedNotes to find notes srch -- get list of notes to export
else -- there is a " in the notebook name - no search allowed
-- tell application "Evernote" to set selectedNotes to every note in notebook bName -- export all notes
if enexp ≠ "" then -- if only updated notes
set d to current date -- init date object
tell d to set {its year, its month, its day, its time} to {0 + (text 1 thru 4 of enexp), 0 + (text 5 thru 6 of enexp), 0 + (text 7 thru 8 of enexp), (hours * (0 + (text 10 thru 11 of enexp))) + (minutes * (0 + (text 12 thru 13 of enexp))) + (0 + (text 14 thru 15 of enexp))} -- convert date string into type date
set d to d + offsetGMT -- adjust GMT export-date to local time
if logProgress then log "enexp: " & enexp & " local: " & d
tell application "Evernote" to set cu to count of (every note in notebook bName whose modification date ≥ d) -- get count of updated notes in this notebook
if cu = 0 then return false -- if no changed notes in notebook, don't export it
end if
tell application "Evernote"
if SearchString = "" then -- did user specify a search string?
set selectedNotes to every note in notebook bName -- if not, export every note in notebook
else
set b to find notes SearchString -- search all of evernote with user-specified search
set selectedNotes to {} -- init list of notes to export
set c to every note in notebook bName -- get all notes in notebook
repeat with i from 1 to (length of c) -- with every note in notebook
set m to item i of c -- get the note from the notebook
repeat with j from 1 to length of b -- with every note in search str results
set w to item j of b -- get note from search results
if m is w then -- if note is in both lists
copy m to end of selectedNotes -- copy it to the result list
exit repeat
end if
end repeat
end repeat
end if
end tell
if logProgress then log oType & " note count for: " & bName & " is: " & (count of selectedNotes) & " with quoted notebook name"
end if
if (count of selectedNotes) = 0 then return false -- If no notes to export, return empty list
if oType = "ENEX" then tell application "Evernote" to export selectedNotes to oFile format ENEX with tags -- export notes as enex
if oType = "HTML" then tell application "Evernote" to export selectedNotes to oFile format HTML -- or as HTML
return true -- return: aome notes exported
end exportNotes
--
-- Build the index.html file for a notebook, replacing the simple
-- one produced by the evernote Export as HTML operation
-- Input: Notebook name (string), Output folder name (string),
-- Did export just occur (boolean)
-- Returns nothing
--
on buildNoteIndex(bookName, outHTML, wasExported)
--
-- Initialize variables before processing each note in the notebook
--
local bookMod, bookCreate, htmlNotes, tagRows, yy, noteBookCell, pfile, listNoteFiles
local noteAttrs, noteHTMLfile, sNoteTitle, fileEnc, notelink, noteLinkFar
local aNoteMod, aNoteCreate, tagsComma, allTagNames, aNoteTagList
local aTageName, seenTag, parentCell, loopTag, spanTag, sNoteAttach, dirSize
local aNoteAuthor, aNoteExporter, fOff, lOff, sz, expStamp, priorEnviron, priorExportDate
local ourTimer, bookNotes, bookFiles
-- tell application "Evernote" to set bookType to the notebook type of notebook bookName -- get type of notebook
set bookMod to initDate(2000, 1, 1) -- default book mod date 0.4.2
set bookCreate to initDate(2040, 1, 1) -- default book create date 0.4.2
set htmlNotes to "" -- Building HTML for Notes list
set tagRows to "" -- Building HTML for rows with Tag info
set bookNotes to 0 -- init count of notes in this notebook
set bookFiles to 0 -- init count of attachments
set yy to my urlEncode(my repl(bookName, "/", "_")) & "/" & nbIndexFile -- index file for this notebook
set yy to my repl(yy, ":", "%3A") -- handle filename with :
set noteBookCell to " <td class='linkhover nbname'><a class='linktarg' href=\"" & yy & "\">" & my textHT(bookName) & "</a></td>
"
-- Get a list of all .html files in the exported folder for this notebook, except for index.html
try
-- tell application "Finder" to set listNoteFiles to every item of (POSIX file outHTML as alias) whose ((kind is "HTML text") and (name ≠ nbIndexFile)) -- comment 0.3.5
set yy to alias (outHTML as POSIX file)
tell application "System Events" to set listNoteFiles to ((every file of yy) whose (((kind is "HTML text") or (kind is "HTML document")) and (name ≠ nbIndexFile))) -- get every note html file 0.5.0
on error
return -- if no files found, return without building the notebook index
end try
if (count of listNoteFiles) = 0 then return -- if no files, return 0.3.5
--
-- If this notebook was just exported, use today's date as the export date. If not
-- get the actual export date from the existing index.html file.
--
set expStamp to current date -- assume this notebook was actually just exported
set priorEnviron to "" -- assume no prior "environment" comment exists
set priorExportDate to "" -- assume no prior export date
if not wasExported then -- if it wasn't just exported ...
set yy to readIndex(POSIX file (outHTML & nbIndexFile), {"<!-- bookexported ", "<!-- Exported from Evernote "}, {" bookexported -->", " -->"}, 500) -- Get export date and environment comment from old index.html
if length of (item 1 of yy) > 0 then
set priorExportDate to item 1 of yy -- remember export date as string
set expStamp to getDateSrch(item 1 of yy) -- get export date from previous index file
set priorEnviron to item 2 of yy -- remember previous environment comment
end if
end if
--
-- Read the first few hundred characters of every exported note file (html) to get metadata
-- for that note and create appropriate table rows for the index file.
--
repeat with noteHTMLfile in listNoteFiles -- examine each note in the current notebook
-- set noteAttrs to getMeta(noteHTMLfile as text) -- get Meta tags from the note html file 0.3.5
set noteAttrs to getMeta2(noteHTMLfile) -- get Meta tags from the note html file 0.3.5
set aNoteTitle to nname of noteAttrs -- get note title from meta data
set aNoteAuthor to author of noteAttrs -- get author from meta data
set fOff to offset of "<" in aNoteAuthor -- get position of email start char
set lOff to offset of ">" in aNoteAuthor -- and end char
if (fOff > 2) and ((offset of "@" in aNoteAuthor) > fOff) and (lOff > (offset of "@" in aNoteAuthor)) then -- if Author field contains something plus an email address
set aNoteAuthor to " <td title='" & textHT(text (fOff + 1) thru (lOff - 1) of aNoteAuthor) & "'>" & textHT(trim(text 1 thru (fOff - 1) of aNoteAuthor)) & " ✉️</td>
"
else
set aNoteAuthor to " <td>" & cond(aNoteAuthor = "", " ", textHT(aNoteAuthor)) & "</td>
"
end if
set aNoteExporter to exporter of noteAttrs -- evernote version
set fileEnc to my urlEncode(name of noteHTMLfile) -- get current note file name (no path)
set fileEnc to my repl(fileEnc, "/", "%3A") -- handle filename with : which evernote saves as /
-- Build table cell containing link to Note html file (one for note index and one for top-level tag index)
set notelink to " <td class='linkhover slink'><a class='linktarg' href=\"" & fileEnc & "\">" & my textHT(aNoteTitle) & "</a></td>
"
set noteLinkFar to " <td class='linkhover nbname'><a class='linktarg' href=\"" & my repl(my urlEncode(my repl(bookName, "/", "_")), ":", "%3A") & "/" & fileEnc & "\">" & my textHT(aNoteTitle) & "</a></td>
"
set aNoteMod to getDateMeta(updated of noteAttrs) -- get note update date (as class date)
set aNoteCreate to getDateMeta(created of noteAttrs) -- get note create date (as class date)
if aNoteMod > bookMod then set bookMod to aNoteMod -- track most recently changed note in notebook
if aNoteCreate < bookCreate then set bookCreate to aNoteCreate -- and earliest created note in notebook
set tagsComma to (tags of noteAttrs) as text -- comma separated list of tags from note html meta tags
if tagsComma = "" then -- if no tags
set allTagNames to " " -- placeholder for table cell
else -- process the tags assigned to this note
--
-- Separate the string of tag names into a list of tags. Then
-- figure out if each tag has a parent tag. Keep a cache of tags
-- we've already checked so we don't have to ask Evernote again and again.
-- Create table cells with the tag and with the parent tags (if any)
--
set AppleScript's text item delimiters to ", "
set aNoteTagList to every text item of tagsComma
set AppleScript's text item delimiters to ""
set allTagNames to "" -- initialize a string of tag names for the note detail line
repeat with aTagName in aNoteTagList -- process each tag
-- set aTagName to name of aTag -- name of current tag
set seenTag to my item_position({aTagName}, parentTagNames) -- seen tag before?
if seenTag = 0 then -- have not seen this tag before
set parentCell to "" -- init hierarchy of tag names
-- loop up through linked parent tags (if any)
tell application "Evernote"
set loopTag to tag aTagName
repeat while (parent of loopTag) is not missing value
set parentCell to my fmtTag(name of loopTag) & parentCell -- pre-pend parent tag
set loopTag to parent of loopTag
end repeat
set parentCell to my fmtTag(name of loopTag) & parentCell -- pre-pend parent tag
end tell
copy parentCell to end of parentTagHTML -- cache this parent tag info
copy (aTagName) to end of parentTagNames -- and this tag
else -- get tag parent string from previously cached list
set parentCell to (item seenTag of parentTagHTML) -- get parent hierarchy data
end if
set spanTag to my fmtTag(aTagName) -- format the Tag Name
set allTagNames to allTagNames & spanTag -- add to cell for tag table detail row
-- Construct an HTML table row for the tag table, which will appear in
-- the bottom half of the notebook index page and in the top-level
-- all-tags page.
set tagRows to tagRows & " <tr>
<td>" & spanTag & "</td>
" & notelink & noteLinkFar & " <td>" & parentCell & "</td>
" & noteBookCell & " </tr>
"
end repeat
end if
--
-- Figure out file sizes and how many attachments this note has
--
set sz to size of (get info for noteHTMLfile) -- size of note html file 0.3.5
set aNoteAttach to {} -- assume no attachments for this note
try -- handle error if no resources folder exists
tell application "System Events" -- 0.3.5
set resourceFolder to (POSIX path of noteHTMLfile) & ".resources"
set sz to sz + (size of folder resourceFolder) -- add size of resources folder
set aNoteAttach to every file of folder resourceFolder -- get list of attachments
end tell
end try
set aNoteAttach to count of aNoteAttach -- count attachments
set bookFiles to bookFiles + aNoteAttach -- count attachments in this notebook
set bookNotes to bookNotes + 1 -- count notes in this notebook
set htmlNotes to htmlNotes & " <tr>
" & notelink & my dateCell(aNoteCreate) & my dateCell(aNoteMod) & fmtSize(sz) & " <td class='clfile'>" & aNoteAttach & "</td>
" & aNoteAuthor & " <td>" & allTagNames & "</td></tr>
"
end repeat -- End of processing for notes in current notebook
--
-- All notes in this notebook have been processed. Get ready to write the index page
-- for the notebook.
--
set yy to alias (outHTML as POSIX file)
tell application "System Events" to set dirSize to size of yy -- get size of notebook 0.3.5
-- set dirSize to my getSize({outHTML}) -- size of this html notebook folder in text and as a number 0.3.5
-- Build the table row for this notebook. It will be imbedded as an HTML comment in
-- the note index file and, later, extracted to build the top-level index page
set yy to count of listNoteFiles -- count of notes in this notebook
set noteBookRow to " <tr>
" & noteBookCell & " <td class='clnote' data-notes='" & yy & "'>" & yy & "</td>
" & dateCell(bookCreate) & dateCell(bookMod) & dateCell(expStamp) & fmtSize(dirSize) & " <td class='clfile' data-files='" & bookFiles & "'>" & bookFiles & "</td>
</tr>
"
set sortTags to "" -- assume no tag table to sort (fragment for the body onload attribute)
-- if there are tags in this notebook, construct the table to show them in
-- the notebook index page
if (length of tagRows) > 0 then
set tagRows to "<div class='hdr2'>Tags in this Notebook</div>
<table id='tagTable'>
<thead>
<tr>
<th class='linkhover' onclick=\"sortTable('tagTable',0,0)\">Tag Name</th>
<th class='linkhover slink' onclick=\"sortTable('tagTable',1,0)\">Note</th>
<th class='linkhover nbname' onclick=\"sortTable('tagTable',2,0)\">Note</th>
<th class='linkhover' onclick=\"sortTable('tagTable',3,0)\">Parents</th>
<th class='linkhover nbname' onclick=\"sortTable('tagTable',4,0)\">Notebook</th>
</tr>
</thead>
<tbody>
<!-- taglist start -->
" & tagRows & "<!-- taglist end -->
</tbody>
</table>
"
set sortTags to "hideNBnames('nbname'); sortTable('tagTable',0,0);" -- for onload attribute
end if
set {year:y1, month:m1, day:d1, hours:h1, minutes:r1, seconds:s1} to ((expStamp - offsetGMT) as date)
set ENdate to (y1 as text) & lzer(m1 as number) & lzer(d1 as text) & "T" & lzer(h1 as text) & lzer(r1 as text) & lzer(s1 as text) & "Z" -- build export date to embed as comment in notebook index page
if priorExportDate ≠ "" then set ENdate to priorExportDate -- use prior export date if book wasn't just exported
--
-- Build the notebook index page for this notebook
--
set htmlNotes to "<!DOCTYPE html>
<head>
<!-- bookexported " & ENdate & " bookexported -->
" & getSysInfo(priorEnviron) & "<!-- bookindex
" & noteBookRow & "bookindex -->
<meta http-equiv=\"Content-Type\" content=\"text/html; charset=UTF-8\"/>
<title>" & bookName & "</title>
<script src='../" & myJSfile & "'></script>
<link rel='stylesheet' type='text/css' href='../" & myCSSfile & "'>
</head>
<body onload=\"setLocalDates();sortTable('noteTable',0,0);" & sortTags & "\">
" & pageHead("Notebook: " & my textHT(bookName), "<a href='../" & myTopIndex & "'>All Notebooks</a> <a href='../" & myTagFile & "'>All Tags</a>", "Click headings to sort. This notebook was exported from Evernote " & my fmtLongDate(expStamp) & " " & tzone() & "</br>Totals: " & bookNotes & " notes, " & makeSize(dirSize) & " size, " & bookFiles & " files (attachments)", true) & "
<table id='noteTable'>
<thead>
<tr>
<th class='linkhover notecol' onclick=\"sortTable('noteTable',0,0)\">Note Title</th>
<th class='linkhover' onclick=\"sortTable('noteTable',1,3)\">Created</th>
<th class='linkhover' onclick=\"sortTable('noteTable',2,3)\">Modified</th>
<th class='linkhover' onclick=\"sortTable('noteTable',3,2)\">Size</th>
<th class='linkhover' onclick=\"sortTable('noteTable',4,1)\">Files</th>
<th class='linkhover' onclick=\"sortTable('noteTable',5,0)\">Author</th>
<th class='linkhover' onclick=\"sortTable('noteTable',6,0)\">Tags</th>
</tr>
</thead>
<tbody>
" & htmlNotes & " </tbody>
</table>
" & tagRows & "
</br></br>
</body>
</html>
"
my writeIndex(outHTML & nbIndexFile, htmlNotes) -- write the index.html for this notebook
return
end buildNoteIndex
--
-- Build top level index.html page by reading data stored as comments in
-- each of the notebook index pages
--
on buildTopIndex()
local bookHTML, tagHTML, buildDate, folderList, fol, pf
local bookdata, pcounter, htmlBooks, tagOutput, exi
local totNotes, totSize, totFiles, totBooks
-- get names of all subfolders
-- tell application "Finder" to set folderList to every item of alias FolderHTML whose kind is "Folder"
tell application "System Events" to set folderList to every folder of alias FolderHTML -- 0.3.5
if logProgress then log "Folders being indexed"
set bookHTML to "" -- init table body html for list of notebooks
set tagHTML to "" -- init table body html for list of tags
set buildDate to current date -- date & time these index pages are built
set totBooks to count of folderList
set totNotes to 0 -- init totals
set totSize to 0
set totFiles to 0
set progress total steps to totBooks -- set up progress display
set progress completed steps to 0 -- set progress counter to zero
set progress description to "Building top-level index"
set pcounter to 0 -- counter for progress display
--
-- This loop reads every notebook index page and extracts
-- data elements that were stored as comments in the html
--
repeat with fol in folderList -- for every subfolder
tell application "System Events" to set pf to name of fol -- 0.3.5
set progress additional description to "Processing " & pf
-- Read the index.html file from the subfolder and look for two strings:
-- the table entry for the notebook itself in the top-level index page
-- the list of tags for this notebook, if any
-- we look for both in this one operation so that we don't have to
-- read the file two times.
-- tell application "System Events" to set pf to POSIX path of fol
tell application "System Events" to set pf to ((path of fol) & nbIndexFile)
set exi to true
try
set pf to alias pf
on error
set exi to false
end try
if exi then -- if index.html exists in this folder
set bookdata to readIndex(pf, {"<!-- bookindex
", "<!-- taglist start -->
", "data-notes='", "data-foldersize='", "data-files='"}, {"bookindex -->", "<!-- taglist end -->", "'", "'", "'"}, 0) -- read the index.html page in the subfolder
set bookHTML to bookHTML & " " & item 1 of bookdata -- keep the link data
set tagHTML to tagHTML & item 2 of bookdata -- and the tag data
try
set totNotes to totNotes + (0 + (item 3 of bookdata))
set totSize to totSize + (0 + (item 4 of bookdata))
set totFiles to totFiles + (0 + (item 5 of bookdata))
end try
set pcounter to pcounter + 1
set progress completed steps to pcounter
end if
end repeat -- all notebook index pages have now been read
-- Build the HTML for the top-level index.html page
set htmlBooks to "<!DOCTYPE html>
<head>
" & getSysInfo("") & " <meta http-equiv=\"Content-Type\" content=\"text/html; charset=UTF-8\"/>
<title>All Notebooks</title>
<script src='" & myJSfile & "'></script>
<link rel='stylesheet' type='text/css' href='" & myCSSfile & "'>
</head>
<body onload=\"setLocalDates();sortTable('bookTable',0,0);\">
" & pageHead("All Exported Notebooks", "<a href='" & myTagFile & "'>All Tags</a>", "Click headings to sort. This page was built " & fmtLongDate(buildDate) & " " & tzone() & ".</br>Totals: " & totBooks & " notebooks, " & totNotes & " notes, " & makeSize(totSize) & " size, " & totFiles & " files (attachments)", true) & "
<table id=\"bookTable\">
<thead>
<tr>
<th class='linkhover' onclick=\"sortTable('bookTable',0,0)\">Notebook Name</th>
<th class='linkhover' onclick=\"sortTable('bookTable',1,1)\">Notes</th>
<th class='linkhover' onclick=\"sortTable('bookTable',2,3)\">Created</th>
<th class='linkhover' onclick=\"sortTable('bookTable',3,3)\">Modified</th>
<th class='linkhover' onclick=\"sortTable('bookTable',4,3)\">Exported</th>
<th class='linkhover' onclick=\"sortTable('bookTable',5,2)\">Size</th>
<th class='linkhover' onclick=\"sortTable('bookTable',6,1)\">Files</th>
</tr>
</thead>
<tbody>
" & bookHTML & " </tbody>
</table>
</br></br>
</body>
</html>
"
my writeIndex((POSIX path of FolderHTML) & myTopIndex, htmlBooks) -- write top-level index page for all notebooks
-- build placeholder HTML for the top-level list of tags in case there are none
set tagOutput to "<!DOCTYPE html>
<head>
<meta http-equiv=\"Content-Type\" content=\"text/html; charset=UTF-8\"/>
<title>All Tags</title>
<script src='" & myJSfile & "'></script>
<link rel='stylesheet' type='text/css' href='" & myCSSfile & "'>
</head>
<body>
" & pageHead("All Tags", "<a href='" & myTopIndex & "'>All Notebooks</a>", "No tags were found in any of the exported notebooks.", false) & "
<div> </div>
</br></br>
</body>
</html>
"
-- if there are tags, build HTML for the All Tags page
if length of tagHTML > 0 then set tagOutput to "<!DOCTYPE html>
<head>
<meta http-equiv=\"Content-Type\" content=\"text/html; charset=UTF-8\"/>
<title>All Tags</title>
<script src='" & myJSfile & "'></script>
<link rel='stylesheet' type='text/css' href='" & myCSSfile & "'>
</head>
<body onload=\"hideNBnames('slink');sortTable('tagTable',0,0);\">
" & pageHead("All Tags", "<a href='" & myTopIndex & "'>All Notebooks</a>", "Click headings to sort. This page was built " & fmtLongDate(buildDate) & " " & tzone() & ".", true) & "
<table id='tagTable'>
<thead>
<tr>
<th class='linkhover' onclick=\"sortTable('tagTable',0,0)\">Tag Name</th>
<th class='linkhover slink' onclick=\"sortTable('tagTable',1,0)\">Note</th>
<th class='linkhover nbname' onclick=\"sortTable('tagTable',2,0)\">Note</th>
<th class='linkhover' onclick=\"sortTable('tagTable',3,0)\">Parents</th>
<th class='linkhover nbname' onclick=\"sortTable('tagTable',4,0)\">Notebook</th>
</tr>
</thead>
<tbody>
" & tagHTML & "
</tbody>
</table>
</br></br>
</body>
</html>
"
my writeIndex((POSIX path of FolderHTML) & myTagFile, tagOutput) -- write all-tag page
my writeJS() -- write javascript file if it's not already there
my writeCSS() -- write CSS file if it's not already there
end buildTopIndex
--
-- Extract meta tag info from HTML note file
-- reads a hfs file name, expecting it to be an HTML note file
-- returns note metadata as a Record
--
on getMeta(ifile)
local resp, XMLAppData, t, nm, cn, metas
set ourTimer to getFineTime() -- init sub timer
-- Read first 2000 bytes of the note html file, hoping to get the entire
-- <head>...</head> group. Append those tags to the returned string so
-- the system event XML processor will see them.
set hd to "<head>" & (item 1 of readIndex(ifile, {"<head>"}, {"</head>"}, 2000)) & "</head>"
set resp to {nname:"", author:"", created:"", tags:{""}, updated:"", exporter:""} -- init returned value
tell application "System Events"
-- set XMLAppData to make new XML data with properties {name:"htData", text:hd}
-- tell XML data "htData" -- id XMLAppData
tell (make new XML data with properties {text:hd}) -- pass the note html to the xml scanner
tell XML element "head" -- look within the head tag
set metas to every XML element whose name = "meta" -- get all meta tags
repeat with t from 1 to (length of metas) -- look at each meta tag in turn
set thismeta to item t of metas -- get this meta tag
if exists (XML attribute "name" of thismeta) then -- if there'a a 'name' attribute
set nm to value of XML attribute "name" of thismeta -- get the name attribute
set cn to value of XML attribute "content" of thismeta -- and the content attribute
if nm is "exporter-version" then set exporter of resp to cn -- extract based on name ....
if nm is "created" then set created of resp to cn
if nm is "updated" then set updated of resp to cn
if nm is "author" then set author of resp to cn
if nm is "keywords" then set tags of resp to cn
end if
end repeat
set nname of resp to (value of XML element "title") as text -- get note title from title tag
end tell
end tell
end tell
set timerSub1 to timerSub1 + (getFineTime() - ourTimer) -- accumulate time for this subroutine
return resp -- return record with meta info to caller
end getMeta
--
-- Outer function to read Note html file and then
-- call our XML processor to parse the <head> tag
-- Input: alias of note html file
-- Returns: record of values from <head>
--
on getMeta2(infile)
local theXMLdata, ourTimer, resp
set theXMLdata to "<?xml version=\"1.0\" encoding=\"UTF-8\"?> <head>" & (item 1 of readIndex(infile, {"<head>"}, {"</head>"}, 2000)) & "</head>" -- get html head tags from note html file
set ourTimer to getFineTime() -- timer for start
set resp to parseNote(theXMLdata) -- parse the xml data
set timerSub1 to timerSub1 + (getFineTime() - ourTimer) -- accumulate time for this subroutine
return resp
end getMeta2
--
-- Called by getMeta2
-- This encapsulates the fromework "Foundation" call in
-- a separate script.
-- For XML processing, see https://macscripter.net/viewtopic.php?id=45479
-- and https://macscripter.net/viewtopic.php?pid=200788
-- and https://developer.apple.com/documentation/foundation/nsxmldocument
-- and https://www.w3schools.com/xml/xpath_intro.asp
--
on parseNote(xmlData)
script xmlScript -- encase the asobjc call in a script object
property parent : a reference to current application
use framework "Foundation"
on parseNote(xmlData)
local theXMLDoc, theError, t, resp
set resp to {nname:"", author:"", created:"", tags:"", updated:"", exporter:""} -- init returned value
set {theXMLDoc, theError} to current application's NSXMLDocument's alloc()'s initWithXMLString:xmlData options:0 |error|:(reference) -- parse the xml data
if theXMLDoc ≠ missing value then -- if valid xml was found
-- if theXMLDoc = missing value then error (theError's localizedDescription() as text)
set t to ((theXMLDoc's nodesForXPath:"/head/title" |error|:(missing value))'s valueForKey:"stringValue") as list
if (length of t) > 0 then set nname of resp to (item 1 of t) -- copy Note Title if it's there
set t to ((theXMLDoc's nodesForXPath:"//meta[@name='created']/@content" |error|:(missing value))'s valueForKey:"stringValue") as list
if (length of t) > 0 then set created of resp to (item 1 of t) -- copy Creation Date if it's there
set t to ((theXMLDoc's nodesForXPath:"//meta[@name='author']/@content" |error|:(missing value))'s valueForKey:"stringValue") as list
if (length of t) > 0 then set author of resp to (item 1 of t) -- copy Author Name if it's there
set t to ((theXMLDoc's nodesForXPath:"//meta[@name='updated']/@content" |error|:(missing value))'s valueForKey:"stringValue") as list
if (length of t) > 0 then set updated of resp to (item 1 of t) -- copy Modification Date if it's there
set t to ((theXMLDoc's nodesForXPath:"//meta[@name='keywords']/@content" |error|:(missing value))'s valueForKey:"stringValue") as list
if (length of t) > 0 then set tags of resp to (item 1 of t) -- copy Tag Names if it's there
set t to ((theXMLDoc's nodesForXPath:"//meta[@name='exporter-version']/@content" |error|:(missing value))'s valueForKey:"stringValue") as list
if (length of t) > 0 then set exporter of resp to (item 1 of t) -- copy EN Version if it's there
end if
return resp
end parseNote
end script
return xmlScript's parseNote(xmlData)
end parseNote
--
-- Make text string HTML safe (for Note titles, Notebook Names, Tag names, etc.)
--
on textHT(inString)
local j
set j to repl(inString, "&", "&") -- must be first to avoid double-encoding of ampersands
set j to repl(j, "\"", """)
set j to repl(j, "'", "'")
set j to repl(j, "<", "<")
set j to repl(j, ">", ">")
return j
end textHT
--
-- Replace one string with another
--
on repl(theText, theSearchString, theReplacementString)
local theTextItems
set AppleScript's text item delimiters to theSearchString
set theTextItems to every text item of theText
set AppleScript's text item delimiters to theReplacementString
set theText to theTextItems as string
set AppleScript's text item delimiters to ""
return theText
end repl
--
-- Return formatted date and time as yyyy-mm-dd hh-mm
-- input is a date object
--
on fmtLongDate(inpDate)
set {year:y, month:m, day:d, hours:h, minutes:r} to inpDate
return (y as text) & "-" & lzer(m as number) & "-" & lzer(d as text) & " " & lzer(h as text) & ":" & lzer(r as text)
end fmtLongDate
--
-- Return an integer as two digits, with leading zero if necessary and negative sign if < 0
--
on lzer(numb)
if numb ≥ 0 then
return (text -1 thru -2 of ("000" & (numb as text)))
else
return "-" & (text -1 thru -2 of ("000" & ((-numb) as text)))
end if
end lzer
--
-- Return time zone offset as -hh:mm
--
on tzone()
return lzer(offsetGMT div hours) & ":" & lzer(offsetGMT mod hours / minutes as integer)
end tzone
--
-- Return a date object
-- input is a date/time string from an HTML meta tag
-- as 2020-11-22 21:05:34 +0000
--
on getDateMeta(x)
local d
set d to initDate(2000, 1, 1) -- 0.4.2
if x = "" then return d
tell d to set {its year, its month, its day, its time} to {0 + (text 1 thru 4 of x), 0 + (text 6 thru 7 of x), 0 + (text 9 thru 10 of x), (hours * (0 + (text 12 thru 13 of x))) + (minutes * (0 + (text 15 thru 16 of x))) + (0 + (text 18 thru 19 of x))} --
set d to d + (hours * (text 22 thru 23 of x)) + (0 + (text 24 thru 25 of x)) * (cond((text 21 thru 21 of x) = "-", -1, 1)) + (time to GMT)
return d
end getDateMeta
-- 0.4.2 ....
-- Initialize a date object
-- input is year, month, day as integers
-- returns date object
-- Avoids locale-related issues with dates in strings
--
on initDate(yr, mo, dy) -- 0.4.2
local md
set md to current date
tell md to set {its year, its month, its day, its time} to {yr, mo, dy, hours * 12}
return md
end initDate
-- .... 0.4.2
--
-- Return a date object in local time
-- input is a date/time string as in our bookexported comment
-- and in Evernote's search syntax: 20210205T203848Z
-- With help from https://forum.latenightsw.com/t/time-to-gmt-for-any-date/2070/2
-- to calc GMT offset for arbitrary day of the year
-- and: http://www.unicode.org/reports/tr35/tr35-31/tr35-dates.html#Date_Format_Patterns
-- for info on date pattern strings
--
on getDateSrch(x)
script dateScript
property parent : a reference to current application
use framework "Foundation"
on getDateSrch(x)
local df, theDate, tz, theOffset, d
if x = "" then return initDate(2000, 1, 1) -- 0.4.2
set df to current application's NSDateFormatter's new()
df's setDateFormat:"yyyyMMdd'T'HHmmssX" -- Pattern date
set theDate to df's dateFromString:x
-- get offset
set tz to current application's NSTimeZone's localTimeZone()
set theOffset to tz's secondsFromGMTForDate:theDate
-- I should be able to add theDate to theOffset, but Applescript could not seem to
-- constrain theDate from NSDate to Date. So, I'm converting it another way....
set d to current date -- create a date variable 0.4.2
tell d to set {its year, its month, its day, its time} to {0 + (text 1 thru 4 of x), 0 + (text 5 thru 6 of x), 0 + (text 7 thru 8 of x), (hours * (0 + (text 10 thru 11 of x))) + (minutes * (0 + (text 12 thru 13 of x))) + (0 + (text 14 thru 15 of x))} -- convert date string to date object
set d to d + theOffset -- adjust GMT time string to local time
return d -- return date in our time zone
end getDateSrch
end script
return dateScript's getDateSrch(x)
end getDateSrch
--
-- Write an index.html file
--
on writeIndex(thePath, theText)
set theAlias to thePath as POSIX file as «class furl»
try
-- tell application "Finder" (adding class furl below fixed this)
-- using terms from scripting additions. (adding class furl below fixed this)
set theOpenedFile to open for access theAlias as «class furl» with write permission
-- end tell
-- end using terms from
-- if logProgress then log ("response from open: " & theOpenedFile)
set eof of theOpenedFile to 0
write theText to theOpenedFile as «class utf8»
-- if logProgress then log "Normal file close"
close access theOpenedFile
return true
on error errMsg number errNum
-- if logProgress then log "Error file close. Msg: " & errMsg & " Num: " & errNum
try
close access file theAlias
end try
return false
end try
-- if logProgress then log "Leaving addtolog"
end writeIndex
--
-- Format file/folder size for display within a table cell
-- Input is a number of bytes
-- Returns a table cell (<TD>) formatted with file size
--
on fmtSize(s)
return " <td class='clsize' data-foldersize='" & s & "'>" & makeSize(s) & "</td>
"
end fmtSize
--
-- Format file/folder size for display
-- Input is a number of bytes
-- Returns a string with file size
-- We're using decimal calc for KB, MB and GB, in keeping
-- with how macOS Finder reports sizes
-- This newer version of the handler adds one decimal point to the result
--
on makeSize(s)
local strSize
if s < 1000 then -- Build a formatted text showing total size
set strSize to "0." & ((s / 100) as integer as text) & " KB"
else if (s / 1000) < 1000 then
set strSize to ((s / 100) as integer as text)
set strSize to (text 1 thru -2 of strSize) & "." & (text -1 thru -1 of strSize) & " KB"
else if (s / (1000 ^ 2)) < 1000 then
set strSize to ((s / (100000)) as integer as text)
set strSize to (text 1 thru -2 of strSize) & "." & (text -1 thru -1 of strSize) & " MB"
else
set strSize to ((s / (1000 ^ 3 / 10)) as integer as text)
set strSize to (text 1 thru -2 of strSize) & "." & (text -1 thru -1 of strSize) & " GB"
end if
return strSize
end makeSize
--
-- Format file/folder size for display
-- Input is a number of bytes
-- Returns a string with file size
-- We're using decimal calc for KB, MB and GB, in keeping
-- with how macOS Finder reports sizes
--
on makeSizeOld(s)
local strSize
if s < 1000 then -- Build a formatted text showing total size
set strSize to (s as integer as text) & " B "
else if (s / 1000) < 1000 then
set strSize to ((s / 1000) as integer as text) & " KB"
else if (s / (1000 ^ 2)) < 1000 then
set strSize to ((s / (1000 ^ 2)) as integer as text) & " MB"
else
set strSize to ((s / (1000 ^ 3)) as integer as text) & " GB"
end if
return strSize
end makeSizeOld
-- Handler for Property List file. Three functions are performed in this one routine
-- so that the relevant variables can be localized here.
-- Option 1: Create Plist if necessary then fetch current property values
-- into global variables.
-- if PList already exists, return True; if we had to create it, return false
-- Option 2: Prompt user to update properties one after the other.
-- returns FALSE if user cancels or fails to correctly set the properties
-- Option 3: Update the PList with a new ExportDate
-- returns True
on managePlist(opt)
local plFolderHTML, plFolderENEX, plAllNotebooks, plSearchString
local plExportAsHTML, plExportAsENEX, plBooksSelected, plPropDate
local plExportDate, plTimeoutMinutes, foundPList, theParentDictionary
local thePropertyListFile, myResp, exopt, buts, chc, bookNames
local msgPart, resp
-- Names of Property List items
set plFolderHTML to "FolderHTML" -- Folder for HTML exports
set plFolderENEX to "FolderENEX" -- Folder for ENEX exports
set plAllNotebooks to "AllNotebooks" -- Export all notebooks, not just some
set plSearchString to "SearchString" -- user's filter for notes
set plExportAsHTML to "ExportAsHTML" -- Export as HTML?
set plExportAsENEX to "ExportAsENEX" -- Export as ENEX?
set plBooksSelected to "BooksSelected" -- names of notebooks to export
set plPropDate to "PropDate" -- date this Property List last updated
set plExportDate to "ExportDate" -- date export last completed
set plTimeoutMinutes to "TimeoutMinutes" -- export timeout in minutes
if opt = 1 then -- Option 1: create default PList if necessary and then load Plist values into Global variables
-- set foundPList to true if PList exisits
tell application "Finder" to set foundPList to (exists myPListFullPath as POSIX file) -- Does PList exist?
if not foundPList then -- If it doesn't exist, create one with default values
tell application "System Events"
set theParentDictionary to make new property list item with properties {kind:record}
set thePropertyListFile to make new property list file with properties {contents:theParentDictionary, name:myPListFullPath}
tell property list items of thePropertyListFile
make new property list item at end with properties {kind:string, name:plFolderHTML, value:FolderHTML}
make new property list item at end with properties {kind:string, name:plFolderENEX, value:FolderENEX}
make new property list item at end with properties {kind:boolean, name:plAllNotebooks, value:AllNotebooks}
make new property list item at end with properties {kind:string, name:plSearchString, value:SearchString}
make new property list item at end with properties {kind:boolean, name:plExportAsHTML, value:ExportAsHTML}
make new property list item at end with properties {kind:boolean, name:plExportAsENEX, value:ExportAsENEX}
make new property list item at end with properties {kind:list, name:plBooksSelected, value:BooksSelected}
make new property list item at end with properties {kind:date, name:plPropDate, value:(current date)}
make new property list item at end with properties {kind:date, name:plExportDate, value:ExportDate}
make new property list item at end with properties {kind:number, name:plTimeoutMinutes, value:TimeoutMinutes}
end tell
end tell
end if
-- Fetch current PList values from the file
tell application "System Events"
tell property list file myPListFullPath
set FolderHTML to value of property list item plFolderHTML
set FolderENEX to value of property list item plFolderENEX
set AllNotebooks to value of property list item plAllNotebooks
set SearchString to value of property list item plSearchString
set ExportAsHTML to value of property list item plExportAsHTML
set ExportAsENEX to value of property list item plExportAsENEX
set BooksSelected to value of property list item plBooksSelected as list
set ExportDate to value of property list item plExportDate
set TimeoutMinutes to value of property list item plTimeoutMinutes
end tell
end tell
return foundPList -- Tell caller if PList alreay existed
end if
--
-- This option prompts the user to review / update the properties
--
if opt = 2 then -- Option 2: Prompt for updates to Property List items
set myResp to false -- assume update has failed
tell application "System Events" to set frontProcess to the name of every process whose frontmost is true
set exopt to 3 -- assume both formats
if (not (ExportAsHTML and ExportAsENEX)) then set exopt to cond(not ExportAsHTML, 2, 1) -- if not HTML, then ENEX only
set exopt to item_position(choose from list plExportTypeDesc with title "Choose export types" with prompt "Which format(s) should be exported?" default items {item exopt of plExportTypeDesc}, plExportTypeDesc)
if logProgress then log "Export option: " & exopt
if exopt = 0 then return myResp -- quit if user cancelled
set ExportAsHTML to item exopt of {true, false, true} -- Set HTML export flag
set ExportAsENEX to item exopt of {false, true, true} -- Set ENEX export flag
if logProgress then log "ExportAsHTML: " & ExportAsHTML & " ExportAsENEX: " & ExportAsENEX
if ExportAsHTML then -- If exporting as HTML
-- first, check that volume containing default output folder is mounted
-- use Documents if user says to ignore prior setting
if checkPropVol(FolderHTML, "HTML") then set FolderHTML to path to documents folder as text
tell application "Finder" to set FolderHTML to (choose folder with prompt "Select or create folder for HTML exports" default location alias FolderHTML) as text -- prompt for folder
end if
if logProgress then log "FolderHTML: " & FolderHTML
if ExportAsENEX then -- if exporting as ENEX
-- first, check that volume containing default output folder is mounted
-- use Documents if user says to ignore prior setting
if checkPropVol(FolderENEX, "ENEX") then set FolderENEX to path to documents folder as text
tell application "Finder" to set FolderENEX to (choose folder with prompt "Select or create folder for ENEX exports" default location alias FolderENEX) as text -- prompt for folder
end if
if logProgress then log "FolderENEX: " & FolderENEX
activate frontProcess -- switch back from Finder to script
set buts to {"All notebooks", "Only selected notebooks", "Cancel"}
set chc to display dialog "Export all notebooks or only selected ones?" buttons buts default button cond(AllNotebooks, 1, 2) cancel button 3 with icon note
set AllNotebooks to ((item 1 of buts) = (button returned of chc))
if logProgress then log "AllNotebooks: " & AllNotebooks
if not AllNotebooks then -- if only selected notebooks
-- set bookNames to sortList(getBooks("")) -- sort notebook names 0.3.2
set bookNames to getBooks() -- get sorted notebook names
if logProgress then log "Count of Notebooks in Evernote: " & (count of bookNames)
set BooksSelected to choose from list bookNames with title "Choose Notebooks to export" with prompt "Use command key (⌘) to select several or all" default items BooksSelected with multiple selections allowed
if BooksSelected = false then return myResp -- if user cancelled, return to caller w 'false'
if logProgress then log "BooksSelected: " & BooksSelected
end if
set resp to display dialog "Enter Evernote search terms to restrict notes that will be exported. Do not use 'notebook:', 'any:', or 'updated:' terms. Leave blank to export all notes in each notebook." default answer SearchString with title "Optional search terms" with icon note
set SearchString to (text returned of resp) as text -- save user input
set msgPart to "" -- clear error message fragment
repeat -- loop to prompt for Timeout value and validate it
set resp to display dialog ("Enter export timeout in minutes. " & msgPart) default answer (TimeoutMinutes as text) with title "Specify Timeout" with icon note
set msgPart to "" -- clear error message fragment
try -- see if text entered is a valid integer
if logProgress then log "About to convert to integer."
set TimeoutMinutes to (text returned of resp) as integer
if logProgress then log "Convert to integer worked: " & TimeoutMinutes
on error -- not a valid integer
set msgPart to "
Timeout value must be a positive integer." -- set error message
if logProgress then log "Convert to integer failed."
set TimeoutMinutes to (text returned of resp) -- leave bad timeout value in place
end try
if logProgress then log "TimeoutMinutes: " & TimeoutMinutes
if msgPart = "" then
if TimeoutMinutes < 1 then
set msgPart to "
Timeout value must be a positive integer." -- set error message
else
exit repeat -- if integer was valid, break out of the Repeat loop
end if
end if
end repeat
--
-- With all Properties now reviewed by user, write them
-- to the Property List file
--
tell application "System Events"
tell property list file myPListFullPath
set value of property list item plFolderHTML to FolderHTML
set value of property list item plFolderENEX to FolderENEX
set value of property list item plAllNotebooks to AllNotebooks
set value of property list item plSearchString to SearchString
set value of property list item plExportAsHTML to ExportAsHTML
set value of property list item plExportAsENEX to ExportAsENEX
set value of property list item plTimeoutMinutes to TimeoutMinutes
set value of property list item plBooksSelected to BooksSelected
set value of property list item plPropDate to current date
end tell
end tell
if logProgress then log "Successfully set all properties"
return true
end if
--
-- This option saves the date of the last successful export
--
if opt = 3 then -- Option 3: Update only the ExportDate property
tell application "System Events"
tell property list file myPListFullPath
set value of property list item plExportDate to ExportDate
end tell
end tell
return true
end if
end managePlist
--
-- Get list of all notebooks from Evernote
-- Return a sorted list
--
on getBooks()
local listBooks
set listBooks to {} -- init the list of book names
tell application "Evernote"
repeat with iBook in every notebook -- for every notebook ...
copy (name of iBook) to end of listBooks -- add notebook name to list
end repeat
end tell
return sortListOfStrings(listBooks) -- sort the list and return it
end getBooks
--
-- Sort a list of strings
-- based on https://macosxautomation.com/applescript/sbrt/sbrt-00.html
-- converted to a Script object to avoid using framework "Foundation" in the main script
--
on sortListOfStrings(sourceList)
script sortScript -- encase the asobjc call in a script object
property parent : a reference to current application
use framework "Foundation"
on sortListOfStrings(sourceList)
-- create a Cocoa array from the passed AppleScript list
set the CocoaArray to current application's NSArray's arrayWithArray:sourceList
-- sort the Cocoa array
set the sortedItems to CocoaArray's sortedArrayUsingSelector:"localizedStandardCompare:"
-- return the Cocoa array coerced to an AppleScript list
return (sortedItems as list)
end sortListOfStrings
end script
return sortScript's sortListOfStrings(sourceList)
end sortListOfStrings
--
-- Return time since Jan 1, 2001 in millionths of a second
--
on getFineTime()
script timeScript -- encase the asobjc call in a script object
property parent : a reference to current application
use framework "Foundation"
on getFineTime()
return current application's CFAbsoluteTimeGetCurrent()
end getFineTime
end script
return timeScript's getFineTime()
end getFineTime
--
-- Return the item number of an item in a list
--
on item_position(myitem, theList)
if myitem = false then return 0
repeat with i from 1 to the count of theList
if (item i of theList) is (item 1 of myitem) then return i
end repeat
return 0
end item_position
--
-- Format a note Tag by enclosing it in html span tags
--
on fmtTag(tn)
-- wrap tagname in a Span, replacing blanks with non-breaking space to
-- hopefully prevent them from breaking across lines in notebook index page
return "<span class='ENtag'>" & repl(textHT(tn), " ", " ") & "</span> "
end fmtTag
--
-- Format a table cell containg a date
-- The local date will be visible in the cell and
-- the GMT date & time will be in a data attribute for use by
-- javascript, which will update the cell value and create a title (tool tip)
--
on dateCell(dt)
local y, m, d, yy, mm, dd, hh, s, r
set {year:y, month:m, day:d} to dt -- for short, local date that will visible in cell
-- return (y as text) & "-" & lzer(m as number) & "-" & lzer(d as text)
set {year:yy, month:mm, day:dd, hours:hh, minutes:r, seconds:s} to (dt - offsetGMT) -- for javascript to convert
-- return (yy as text) & "-" & lzer(mm as number) & "-" & lzer(dd as text) & "T" & lzer(hh as text) & ":" & lzer(r as text) & ":" & lzer(s as text) & "Z"
return " <td data-gmtdate='" & ((yy as text) & "-" & lzer(mm as number) & "-" & lzer(dd as text) & "T" & lzer(hh as text) & ":" & lzer(r as text) & ":" & lzer(s as text) & "Z") & "' class='tdate'>" & ((y as text) & "-" & lzer(m as number) & "-" & lzer(d as text)) & "</td>
"
end dateCell
--
-- Format a page header with left and right content
--
on pageHead(cleft, cright, cinstruct, checkbox)
return " <div class='hdr'>
<div class='lhdr'>" & cleft & "</div>
<div class='rhdr'>" & cright & "</div>
<div class='bhdr'> </div>
<div class='instruct'>" & cinstruct & "</div>
" & cond(checkbox, " <div>
<form class='inpform'>
<label for='notetarg'>Open links in new tabs</label>
<input type='checkbox' id='notetarg' onchange=\"settarget('notetarg','linktarg');\"></form></div>", "") & "
<div class='bhdr'> </div>
</div>
"
end pageHead
--
-- Return a value conditionally
--
on cond(tst, v1, v2)
if tst then return v1
return v2
end cond
--
-- Get a text strings from an existing file
-- fname = full name of input file
-- frontstr = list of leading tokens to scan for
-- backstr = list of trailing tokens to scan for
-- chrs = bytes of file to read, or 0 for entire file
-- Returns list of strings found with "" for strings not found
--
on readIndex(fname, frontstr, backstr, chrs)
local ex, xd, chrs, res, i, stpos, bal, enpos, infile
try
if logProgress then log "Reading file: " & fname & " for " & chrs & " bytes"
end try
tell application "Finder" to set ex to (exists fname) -- check for file existence
if not ex then -- if file does not exist
set xd to "dummy string" -- set file data to a dummy string
else -- otherwise, read the input file
try
set fname to fname as alias
end try
if chrs = 0 then
--set xd to read (fname as «class furl») as «class utf8» -- read entire file
set xd to read fname as «class utf8» -- read entire file
else
--set xd to read (fname as «class furl») for chrs as «class utf8» -- if caller specified a byte count
repeat with ei from chrs to (chrs + 7) -- try several reads in case UTF8 char is split
set readOK to true
try
set xd to read fname for ei as «class utf8» -- if caller specified a byte count
on error
set readOK to false
end try
if readOK then exit repeat
set xd to "dummy string" -- set file data to a dummy string
end repeat
end if
end if
if logProgress then log " Len read: " & length of xd
set res to {} -- initialize list to be returned
repeat with i from 1 to (length of frontstr) -- for each leading search token
-- if logProgress then log " frontstr: " & i & " " & item i of frontstr
-- if logProgress then log " backstr : " & i & " " & item i of backstr
set stpos to offset of (item i of frontstr) in xd -- find front token
if stpos = 0 then
copy "" to end of res -- return empty string if not found
else
set stpos to stpos + (length of (item i of frontstr)) -- start of target text
set bal to text stpos thru (length of xd) of xd -- remainder of file data
set enpos to (offset of (item i of backstr) in bal) - 1
if enpos = 0 then
copy "" to end of res -- return empty string if not found
else
copy trim(text 1 thru enpos of bal) to end of res
end if
end if
-- if logProgress then log " result(" & (item i of res) & ")"
end repeat
return res
end readIndex
--
-- Trim leading and trailing blanks from a string
--
-- From <NAME>'s CSV-to-list converter
-- http://macscripter.net/viewtopic.php?pid=125444#p125444
on trim(txt)
repeat with i from 1 to (count txt) - 1
if (txt begins with space) then
set txt to text 2 thru -1 of txt
else
exit repeat
end if
end repeat
repeat with i from 1 to (count txt) - 1
if (txt ends with space) then
set txt to text 1 thru -2 of txt
else
exit repeat
end if
end repeat
if (txt is space) then set txt to ""
return txt
end trim
--
-- Check that the volume is mounted before running an export
-- Then look for folder.
-- If both found, return false
--
on checkRunVol(fpath, omode)
local diskNames, targetVolume, ex
set targetVolume to text 1 thru ((offset of ":" in fpath) - 1) of fpath
repeat
tell application "System Events" to set diskNames to name of every disk
if logProgress then log diskNames
if (diskNames contains targetVolume) then exit repeat
set ret to display alert "Volume not mounted" message "The volume '" & targetVolume & "' needed for " & omode & " export is not mounted. Please mount it and then retry. Or click cancel." buttons {"Retry", "Cancel"} default button 1 cancel button 2
end repeat
tell application "Finder" to set ex to (exists fpath)
if not ex then display alert "Folder " & (POSIX path of fpath) & " not found for " & omode & " export.
Rerun this script and choose Change Settings to set " & omode & " export folder."
return ex
end checkRunVol
--
-- Check that the volume is mounted before prompting user to select the output folder
-- Return False if found or true if not found.
--
on checkPropVol(fpath, omode)
set targetVolume to text 1 thru ((offset of ":" in fpath) - 1) of fpath
repeat
tell application "System Events" to set diskNames to name of every disk
if logProgress then log diskNames
if (diskNames contains targetVolume) then exit repeat
set ret to display alert "Volume not mounted" message "The volume '" & targetVolume & "' selected for " & omode & " export is not mounted. Please mount it and then retry or choose another folder or click cancel." buttons {"Retry", "Choose another", "Cancel"} default button 1 cancel button 3
if button returned of ret = "Choose another" then return true
end repeat
tell application "Finder" to set ex to (exists fpath)
activate frontProcess -- bring us to the front
if not ex then display alert "Folder previously selected for " & omode & " export not found (" & (POSIX path of fpath) & ").
Choose another folder."
return not ex
end checkPropVol
--
-- Return a comment string with system info
-- to embed as a comment in the index.html pages
-- A comment string from prior index file may be supplied
--
on getSysInfo(pastEnv)
local sys, ENacct, ENver
if length of pastEnv > 0 then return "<!-- Exported from Evernote " & pastEnv & " -->
" -- reuse prior comment
if headerInfo is "" then
set sys to system info
tell application "Evernote"
set ENacct to name of current account
set ENver to version
end tell
set headerInfo to "<!-- Exported from Evernote ver: " & ENver & ", account: " & ENacct & "
running on macOS: " & (system version of sys) & " using AppleScript ver: " & (AppleScript version of sys) & "
on computer: " & (computer name of sys) & " by user: " & (long user name of sys) & "
user locale: " & (user locale of sys) & " GMT offset: " & tzone() & " local date: " & fmtLongDate(current date) & " -->
"
end if
return headerInfo
end getSysInfo
--
-- Encode a string for use as a URL in HTML (0.3.2)
-- replaces blanks and most special characters with hex codes
-- This is encased in a Script object as described here:
-- https://latenightsw.com/adding-applescriptobjc-to-existing-scripts/
-- so that we can avoid use framework "Foundation" which messes
-- up the Read and Write commands
--
on urlEncode(inp)
script aScript
property parent : a reference to current application
use framework "Foundation"
on urlEncode(inp)
tell current application's NSString to set rawUrl to stringWithString_(inp)
set theEncodedURL to rawUrl's stringByAddingPercentEscapesUsingEncoding:4 -- 4 is NSUTF8StringEncoding
return theEncodedURL as Unicode text
end urlEncode
end script
return aScript's urlEncode(inp)
end urlEncode
--
-- WriteJS handler - if the enscripts.js file doesn't exist, write it to
-- the top level HTML folder
--
on writeJS()
set jsFile to (POSIX path of FolderHTML) & myJSfile -- name of javascript file
tell application "Finder" to set foundJS to (exists jsFile as POSIX file) -- Does PList exist?
if foundJS then return false
set js to "/*
This JS file is created initially by the applescript
Notebook Export Manager For Evernote and placed in
the top-level html folder of exported Notebooks.
-- Once created, the user can modify this file, and
the applescript will not over-write it.
-- This JS file contains the functions to dynamically
sort the main html table and perform other
run-time functions inside the top-level
Notebook list webpage and the lower-level
Note list index pages.
-- If you want to modify this JS script and re-imbed
it into the applescript, avoid using any backslash
or double-quote characters, as they must be escaped
in applescript text constants.
*/
function setLocalDates() {
/* This function is to be called by the OnLoad tag
of a BODY element. It loops through every TD
(Table Data) element, looking for the data-gmtdate
attribute, taking the GMT date stored there and
using it to populate the innerHTML and the title
of the table cell. So, dates will be displayed
in the user's local time zone.
*/
var elems,c,d,i,s
elems = document.getElementsByTagName('TD')
for (i = 0; i < (elems.length); i++) {
c = elems[i].getAttribute('data-gmtdate');
if (c) {
d = new Date(c);
s = d.getFullYear() + '-' + lz(d.getMonth() + 1) + '-' + lz(d.getDate()) + ' ' + lz(d.getHours()) + ':' + lz(d.getMinutes()) ;
elems[i].innerText = s.substring(0, 10);
elems[i].title = s;
}
}
}
function lz(n) {
/* format an integer as two digits with leading zero */
var s = '00' + n;
return s.substring(s.length - 2);
}
function sortTable(tname,col,typ) {
/*
Sort table using javascript array sort
based on https://stackoverflow.com/questions/14267781/sorting-html-table-with-javascript
tname is the ID of the table
col is the column number to sort on (0 to n)
typ is the type of data (see Switch statement below
*/
var sortattr = 'data-sort', i ; // data attribute tag name
var tabl = document.getElementById(tname) ; // get table object
var tb = tabl.tBodies[0] ; // get table tbody object
var thdr = tabl.tHead.rows[0].cells ; // get cells in table header row
var sd = thdr[col].getAttribute(sortattr) == 'A' ? -1 : 1 ; // get sort direction (A/D) (A if no prior sort)
var tr = Array.prototype.slice.call(tb.rows, 0) ; // get rows in array
for (i = 0; i < (thdr.length); i++) {
thdr[i].classList.remove('trasc','trdesc'); /* clear table header classes */
thdr[i].setAttribute(sortattr, 'U'); // set all cols sort direction to unsorted
}
// Sort the array of table rows based on specified cell (ie, column) and data type
tr = tr.sort(function(a,b) {
var cm, la, lb
la = a.cells[col] ; // get cell being sorted
lb = b.cells[col] ; // get cell being sorted
switch(typ) {
case 1: // sort column contains integers
cm = (parseInt(la.innerHTML) > parseInt(lb.innerHTML)) ? 1 : -1 ;
break ;
case 2: // sort column contains number in an attribute
cm = (parseFloat(la.getAttribute('data-foldersize')) > parseFloat(lb.getAttribute('data-foldersize'))) ? 1 : -1 ;
break ;
case 3: // sort column contains GMT date in an attribute
cm = (la.getAttribute('data-gmtdate') > lb.getAttribute('data-gmtdate')) ? 1 : -1 ;
break ;
default: // sort column contains a string, possibly inside an <a> tag
la = ((null !== la.firstElementChild) ? la.firstElementChild : la).innerHTML.toLowerCase() ;
lb = ((null !== lb.firstElementChild) ? lb.firstElementChild : lb).innerHTML.toLowerCase() ;
cm = la > lb ? 1 : -1 ;
}
return cm * sd ; // return comparison result, adjusted for sort direction
}) ;
for(i = 0; i < tr.length; ++i) tb.appendChild(tr[i]); // append each row in order back into tbody
thdr[col].classList.add(sd == -1 ? 'trdesc' : 'trasc') ; // set color indicator in sort column
thdr[col].setAttribute(sortattr, (sd == -1 ? 'D' : 'A')); // remember sorted column
}
function hideNBnames(cls){
/* This function is used to inject CSS into all the index.html
pages for individual notebooks, to hide table columns
with specified class.
*/
var style2 = document.createElement('style');
style2.innerHTML = '.' + cls + ' { ' +
' display:none; ' +
' } ' ;
document.head.appendChild(style2);
}
function settarget(checkid,acls) {
/* This function sets the target= attribute of anchor
tags with the class 'acls' based on the checked
property of the element with id 'checkid'
*/
var atarg, elems, i
atarg = document.getElementById(checkid).checked ? '_blank' : '_self' ;
elems = document.getElementsByClassName(acls) ;
for (i = 0; i < (elems.length); i++) {
elems[i].target = atarg ;
}
}"
writeIndex(jsFile, js)
return true
end writeJS
--
-- WriteCSS handler - if the enstyles.css file doesn't exist, write it to
-- the top level HTML folder
--
on writeCSS()
set cssFile to (POSIX path of FolderHTML) & myCSSfile -- name of css file
tell application "Finder" to set foundCSS to (exists cssFile as POSIX file) -- Does CSS exist?
if foundCSS then return false
set css to "/*
This CSS stylesheet is created initially by the applescript
Notebook Export Manager to control the display
of index.html pages for exported notebooks and
for the top-level index page.
*/
body {
font-family: Arial, Helvetica, sans-serif;
}
.clnote {
text-align: center;
}
.clfile {
text-align: center;
}
.clsize {
text-align: right;
}
.tdate {
text-align: center;
}
table {
border-collapse: collapse;
border-spacing: 0;
font-size: 14px;
}
th {
cursor: pointer ;
}
tbody tr:nth-child(odd) {
background: #eee;
}
th, td {
padding:4px;
}
td a {
display:block;
width:100%;
}
.trasc {
background-color: #ccff99;
}
.trdesc {
background-color: #ff9999;
}
.ENtag {
background-color: #B7D7FF;
}
.instruct {
padding-bottom: 15px;
font-size: 14px;
color: gray;
float: left;
}
.inpform {
font-size: 14px;
background-color: lightgray ;
float: right ;
padding: 3px 5px 3px 5px ;
}
.lhdr {
float: left;
font-size: 24px;
}
.rhdr {
float: right;
font-size: 18px;
}
.bhdr {
clear:both;
bottom-margin: 15px ;
}
.hdr2 {
font-size: 18px;
padding-top: 20px;
padding-bottom: 20px;
}
.notecol {
width:40%;
}
.linkhover:hover {
background-color: #99ccff;
}
.zeroNotes {
background-color: #ffff99;
}
"
writeIndex(cssFile, css)
return true
end writeCSS
|
programs/oeis/171/A171270.asm | neoneye/loda | 22 | 242743 | <reponame>neoneye/loda
; A171270: a(n) is the only number m such that m = pi(1^(1/n)) + pi(2^(1/n)) + ... + pi(m^(1/n)).
; 3,11,33,95,273,791,2313,6815,20193,60071,179193,535535,1602513,4799351,14381673,43112255,129271233,387682631,1162785753,3487832975,10462450353,31385253911,94151567433,282446313695,847322163873,2541932937191,7625731702713,22877060890415,68630914235793,205892205836471,617675543767593,1853024483819135,5559069156490113,16677198879535751,50031579458738073,150094704016475855,450284043329950833,1350851992550899031,4052555702774790153,12157666558568556575,36472998576194041953,109418993529558870311,328256976190630099833,984770919775797277295,2954312741735205787473,8862938190021245273591,26588814499694991643113,79766443358347486574015,239299329793567483011393,717897988817752495612871,2153693965327357579995993,6461081893730272926302735,19383245676687219151537713,58149737021054458199872151,174449211045148976090134473,523347633099418131251439455,1570042899226196799716390433,4710128697534475211073315431,14130386092315195257068234553,42391158276369125018901280175,127173474827954453552096993553,381520424481557517647077286711,1144561273440060866922804472233,3433683820310959228731558640895,10301051460914430942120966371073,30903154382706399338215480009991,92709463148045411038351601823513,278128389443988659162465129057615,834385168331670829582216034346993,2503155504994422192936289397389271,7509466514982085987188150780864393,22528399544943896778323017519986335,67585198634826967968486182914745313,202755595904471459172492809453808551,608266787713395488051546949780570873
add $0,1
mov $1,3
pow $1,$0
mov $2,2
pow $2,$0
add $1,$2
sub $1,2
mov $0,$1
|
tools-src/gnu/gcc/gcc/ada/types.ads | enfoTek/tomato.linksys.e2000.nvram-mod | 80 | 15219 | <reponame>enfoTek/tomato.linksys.e2000.nvram-mod<gh_stars>10-100
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- T Y P E S --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Unchecked_Deallocation;
package Types is
pragma Preelaborate (Types);
-- This package contains host independent type definitions which are used
-- in more than one unit in the compiler. They are gathered here for easy
-- reference, though in some cases the full description is found in the
-- relevant module which implements the definition. The main reason that
-- they are not in their "natural" specs is that this would cause a lot of
-- inter-spec dependencies, and in particular some awkward circular
-- dependencies would have to be dealt with.
-- WARNING: There is a C version of this package. Any changes to this
-- source file must be properly reflected in the C header file a-types.h
-- Note: the declarations in this package reflect an expectation that the
-- host machine has an efficient integer base type with a range at least
-- 32 bits 2s-complement. If there are any machines for which this is not
-- a correct assumption, a significant number of changes will be required!
-------------------------------
-- General Use Integer Types --
-------------------------------
type Int is range -2 ** 31 .. +2 ** 31 - 1;
-- Signed 32-bit integer
type Dint is range -2 ** 63 .. +2 ** 63 - 1;
-- Double length (64-bit) integer
subtype Nat is Int range 0 .. Int'Last;
-- Non-negative Int values
subtype Pos is Int range 1 .. Int'Last;
-- Positive Int values
type Word is mod 2 ** 32;
-- Unsigned 32-bit integer
type Short is range -32768 .. +32767;
for Short'Size use 16;
-- 16-bit signed integer
type Byte is mod 2 ** 8;
for Byte'Size use 8;
-- 8-bit unsigned integer
type size_t is mod 2 ** Standard'Address_Size;
-- Memory size value, for use in calls to C routines
--------------------------------------
-- 8-Bit Character and String Types --
--------------------------------------
-- We use Standard.Character and Standard.String freely, since we are
-- compiling ourselves, and we properly implement the required 8-bit
-- character code as required in Ada 95. This section defines a few
-- general use constants and subtypes.
EOF : constant Character := ASCII.SUB;
-- The character SUB (16#1A#) is used in DOS and other systems derived
-- from DOS (OS/2, NT etc) to signal the end of a text file. Internally
-- all source files are ended by an EOF character, even on Unix systems.
-- An EOF character acts as the end of file only as the last character
-- of a source buffer, in any other position, it is treated as a blank
-- if it appears between tokens, and as an illegal character otherwise.
-- This makes life easier dealing with files that originated from DOS,
-- including concatenated files with interspersed EOF characters.
subtype Graphic_Character is Character range ' ' .. '~';
-- Graphic characters, as defined in ARM
subtype Line_Terminator is Character range ASCII.LF .. ASCII.CR;
-- Line terminator characters (LF, VT, FF, CR)
subtype Upper_Half_Character is
Character range Character'Val (16#80#) .. Character'Val (16#FF#);
-- Characters with the upper bit set
type Character_Ptr is access all Character;
type String_Ptr is access all String;
-- Standard character and string pointers
procedure Free is new Unchecked_Deallocation (String, String_Ptr);
-- Procedure for freeing dynamically allocated String values
subtype Word_Hex_String is String (1 .. 8);
-- Type used to represent Word value as 8 hex digits, with lower case
-- letters for the alphabetic cases.
function Get_Hex_String (W : Word) return Word_Hex_String;
-- Convert word value to 8-character hex string
-----------------------------------------
-- Types Used for Text Buffer Handling --
-----------------------------------------
-- We can't use type String for text buffers, since we must use the
-- standard 32-bit integer as an index value, since we count on all
-- index values being the same size.
type Text_Ptr is new Int;
-- Type used for subscripts in text buffer
type Text_Buffer is array (Text_Ptr range <>) of Character;
-- Text buffer used to hold source file or library information file
type Text_Buffer_Ptr is access all Text_Buffer;
-- Text buffers for input files are allocated dynamically and this type
-- is used to reference these text buffers.
procedure Free is new Unchecked_Deallocation (Text_Buffer, Text_Buffer_Ptr);
-- Procedure for freeing dynamically allocated text buffers
------------------------------------------
-- Types Used for Source Input Handling --
------------------------------------------
type Logical_Line_Number is range 0 .. Int'Last;
for Logical_Line_Number'Size use 32;
-- Line number type, used for storing logical line numbers (i.e. line
-- numbers that include effects of any Source_Reference pragmas in the
-- source file). The value zero indicates a line containing a source
-- reference pragma.
No_Line_Number : constant Logical_Line_Number := 0;
-- Special value used to indicate no line number
type Physical_Line_Number is range 1 .. Int'Last;
for Physical_Line_Number'Size use 32;
-- Line number type, used for storing physical line numbers (i.e.
-- line numbers in the physical file being compiled, unaffected by
-- the presence of source reference pragmas.
type Column_Number is range 0 .. 32767;
for Column_Number'Size use 16;
-- Column number (assume that 2**15 is large enough, see declaration
-- of Hostparm.Max_Line_Length)
No_Column_Number : constant Column_Number := 0;
-- Special value used to indicate no column number
subtype Source_Buffer is Text_Buffer;
-- Type used to store text of a source file . The buffer for the main
-- source (the source specified on the command line) has a lower bound
-- starting at zero. Subsequent subsidiary sources have lower bounds
-- which are one greater than the previous upper bound.
subtype Big_Source_Buffer is Text_Buffer (0 .. Text_Ptr'Last);
-- This is a virtual type used as the designated type of the access
-- type Source_Buffer_Ptr, see Osint.Read_Source_File for details.
type Source_Buffer_Ptr is access all Big_Source_Buffer;
-- Pointer to source buffer. We use virtual origin addressing for
-- source buffers, with thin pointers. The pointer points to a virtual
-- instance of type Big_Source_Buffer, where the actual type is in fact
-- of type Source_Buffer. The address is adjusted so that the virtual
-- origin addressing works correctly. See Osint.Read_Source_Buffer for
-- further details.
subtype Source_Ptr is Text_Ptr;
-- Type used to represent a source location, which is a subscript of a
-- character in the source buffer. As noted above, diffferent source
-- buffers have different ranges, so it is possible to tell from a
-- Source_Ptr value which source it refers to. Note that negative numbers
-- are allowed to accommodate the following special values.
No_Location : constant Source_Ptr := -1;
-- Value used to indicate no source position set in a node
Standard_Location : constant Source_Ptr := -2;
-- Used for all nodes in the representation of package Standard other
-- than nodes representing the contents of Standard.ASCII. Note that
-- testing for <= Standard_Location tests for both Standard_Location
-- and for Standard_ASCII_Location.
Standard_ASCII_Location : constant Source_Ptr := -3;
-- Used for all nodes in the presentation of package Standard.ASCII
First_Source_Ptr : constant Source_Ptr := 0;
-- Starting source pointer index value for first source program
-------------------------------------
-- Range Definitions for Tree Data --
-------------------------------------
-- The tree has fields that can hold any of the following types:
-- Pointers to other tree nodes (type Node_Id)
-- List pointers (type List_Id)
-- Element list pointers (type Elist_Id)
-- Names (type Name_Id)
-- Strings (type String_Id)
-- Universal integers (type Uint)
-- Universal reals (type Ureal)
-- Character codes (type Char_Code stored with a bias)
-- In most contexts, the strongly typed interface determines which of
-- these types is present. However, there are some situations (involving
-- untyped traversals of the tree), where it is convenient to be easily
-- able to distinguish these values. The underlying representation in all
-- cases is an integer type Union_Id, and we ensure that the range of
-- the various possible values for each of the above types is disjoint
-- so that this distinction is possible.
type Union_Id is new Int;
-- The type in the tree for a union of possible ID values
-- Note: it is also helpful for debugging purposes to make these ranges
-- distinct. If a bug leads to misidentification of a value, then it will
-- typically result in an out of range value and a Constraint_Error.
List_Low_Bound : constant := -100_000_000;
-- The List_Id values are subscripts into an array of list headers which
-- has List_Low_Bound as its lower bound. This value is chosen so that all
-- List_Id values are negative, and the value zero is in the range of both
-- List_Id and Node_Id values (see further description below).
List_High_Bound : constant := 0;
-- Maximum List_Id subscript value. This allows up to 100 million list
-- Id values, which is in practice infinite, and there is no need to
-- check the range. The range overlaps the node range by one element
-- (with value zero), which is used both for the Empty node, and for
-- indicating no list. The fact that the same value is used is convenient
-- because it means that the default value of Empty applies to both nodes
-- and lists, and also is more efficient to test for.
Node_Low_Bound : constant := 0;
-- The tree Id values start at zero, because we use zero for Empty (to
-- allow a zero test for Empty). Actual tree node subscripts start at 0
-- since Empty is a legitimate node value.
Node_High_Bound : constant := 099_999_999;
-- Maximum number of nodes that can be allocated is 100 million, which
-- is in practice infinite, and there is no need to check the range.
Elist_Low_Bound : constant := 100_000_000;
-- The Elist_Id values are subscripts into an array of elist headers which
-- has Elist_Low_Bound as its lower bound.
Elist_High_Bound : constant := 199_999_999;
-- Maximum Elist_Id subscript value. This allows up to 100 million Elists,
-- which is in practice infinite and there is no need to check the range.
Elmt_Low_Bound : constant := 200_000_000;
-- Low bound of element Id values. The use of these values is internal to
-- the Elists package, but the definition of the range is included here
-- since it must be disjoint from other Id values. The Elmt_Id values are
-- subscripts into an array of list elements which has this as lower bound.
Elmt_High_Bound : constant := 299_999_999;
-- Upper bound of Elmt_Id values. This allows up to 100 million element
-- list members, which is in practice infinite (no range check needed).
Names_Low_Bound : constant := 300_000_000;
-- Low bound for name Id values
Names_High_Bound : constant := 399_999_999;
-- Maximum number of names that can be allocated is 100 million, which is
-- in practice infinite and there is no need to check the range.
Strings_Low_Bound : constant := 400_000_000;
-- Low bound for string Id values
Strings_High_Bound : constant := 499_999_999;
-- Maximum number of strings that can be allocated is 100 million, which
-- is in practice infinite and there is no need to check the range.
Ureal_Low_Bound : constant := 500_000_000;
-- Low bound for Ureal values.
Ureal_High_Bound : constant := 599_999_999;
-- Maximum number of Ureal values stored is 100_000_000 which is in
-- practice infinite so that no check is required.
Uint_Low_Bound : constant := 600_000_000;
-- Low bound for Uint values.
Uint_Table_Start : constant := 2_000_000_000;
-- Location where table entries for universal integers start (see
-- Uintp spec for details of the representation of Uint values).
Uint_High_Bound : constant := 2_099_999_999;
-- The range of Uint values is very large, since a substantial part
-- of this range is used to store direct values, see Uintp for details.
Char_Code_Bias : constant := 2_100_000_000;
-- A bias value added to character code values stored in the tree which
-- ensures that they have different values from any of the above types.
-- The following subtype definitions are used to provide convenient names
-- for membership tests on Int values to see what data type range they
-- lie in. Such tests appear only in the lowest level packages.
subtype List_Range is Union_Id
range List_Low_Bound .. List_High_Bound;
subtype Node_Range is Union_Id
range Node_Low_Bound .. Node_High_Bound;
subtype Elist_Range is Union_Id
range Elist_Low_Bound .. Elist_High_Bound;
subtype Elmt_Range is Union_Id
range Elmt_Low_Bound .. Elmt_High_Bound;
subtype Names_Range is Union_Id
range Names_Low_Bound .. Names_High_Bound;
subtype Strings_Range is Union_Id
range Strings_Low_Bound .. Strings_High_Bound;
subtype Uint_Range is Union_Id
range Uint_Low_Bound .. Uint_High_Bound;
subtype Ureal_Range is Union_Id
range Ureal_Low_Bound .. Ureal_High_Bound;
subtype Char_Code_Range is Union_Id
range Char_Code_Bias .. Char_Code_Bias + 2**16 - 1;
-----------------------------
-- Types for Namet Package --
-----------------------------
-- Name_Id values are used to identify entries in the names table. Except
-- for the special values No_Name, and Error_Name, they are subscript
-- values for the Names table defined in package Namet.
-- Note that with only a few exceptions, which are clearly documented, the
-- type Name_Id should be regarded as a private type. In particular it is
-- never appropriate to perform arithmetic operations using this type.
type Name_Id is range Names_Low_Bound .. Names_High_Bound;
for Name_Id'Size use 32;
-- Type used to identify entries in the names table
No_Name : constant Name_Id := Names_Low_Bound;
-- The special Name_Id value No_Name is used in the parser to indicate
-- a situation where no name is present (e.g. on a loop or block).
Error_Name : constant Name_Id := Names_Low_Bound + 1;
-- The special Name_Id value Error_Name is used in the parser to
-- indicate that some kind of error was encountered in scanning out
-- the relevant name, so it does not have a representable label.
First_Name_Id : constant Name_Id := Names_Low_Bound + 2;
-- Subscript of first entry in names table
----------------------------
-- Types for Atree Package --
----------------------------
-- Node_Id values are used to identify nodes in the tree. They are
-- subscripts into the Node table declared in package Tree. Note that
-- the special values Empty and Error are subscripts into this table,
-- See package Atree for further details.
type Node_Id is range Node_Low_Bound .. Node_High_Bound;
-- Type used to identify nodes in the tree
subtype Entity_Id is Node_Id;
-- A synonym for node types, used in the entity package to refer to
-- nodes that are entities (i.e. nodes with an Nkind of N_Defining_xxx)
-- All such nodes are extended nodes and these are the only extended
-- nodes, so that in practice entity and extended nodes are synonymous.
subtype Node_Or_Entity_Id is Node_Id;
-- A synonym for node types, used in cases where a given value may be used
-- to represent either a node or an entity. We like to minimize such uses
-- for obvious reasons of logical type consistency, but where such uses
-- occur, they should be documented by use of this type.
Empty : constant Node_Id := Node_Low_Bound;
-- Used to indicate null node. A node is actually allocated with this
-- Id value, so that Nkind (Empty) = N_Empty. Note that Node_Low_Bound
-- is zero, so Empty = No_List = zero.
Empty_List_Or_Node : constant := 0;
-- This constant is used in situations (e.g. initializing empty fields)
-- where the value set will be used to represent either an empty node
-- or a non-existent list, depending on the context.
Error : constant Node_Id := Node_Low_Bound + 1;
-- Used to indicate that there was an error in the source program. A node
-- is actually allocated at this address, so that Nkind (Error) = N_Error.
Empty_Or_Error : constant Node_Id := Error;
-- Since Empty and Error are the first two Node_Id values, the test for
-- N <= Empty_Or_Error tests to see if N is Empty or Error. This definition
-- provides convenient self-documentation for such tests.
First_Node_Id : constant Node_Id := Node_Low_Bound;
-- Subscript of first allocated node. Note that Empty and Error are both
-- allocated nodes, whose Nkind fields can be accessed without error.
------------------------------
-- Types for Nlists Package --
------------------------------
-- List_Id values are used to identify node lists in the tree. They are
-- subscripts into the Lists table declared in package Tree. Note that
-- the special value Error_List is a subscript in this table, but the
-- value No_List is *not* a valid subscript, and any attempt to apply
-- list operations to No_List will cause a (detected) error.
type List_Id is range List_Low_Bound .. List_High_Bound;
-- Type used to identify a node list
No_List : constant List_Id := List_High_Bound;
-- Used to indicate absence of a list. Note that the value is zero, which
-- is the same as Empty, which is helpful in initializing nodes where a
-- value of zero can represent either an empty node or an empty list.
Error_List : constant List_Id := List_Low_Bound;
-- Used to indicate that there was an error in the source program in a
-- context which would normally require a list. This node appears to be
-- an empty list to the list operations (a null list is actually allocated
-- which has this Id value).
First_List_Id : constant List_Id := Error_List;
-- Subscript of first allocated list header
------------------------------
-- Types for Elists Package --
------------------------------
-- Element list Id values are used to identify element lists stored in
-- the tree (see package Tree for further details). They are formed by
-- adding a bias (Element_List_Bias) to subscript values in the same
-- array that is used for node list headers.
type Elist_Id is range Elist_Low_Bound .. Elist_High_Bound;
-- Type used to identify an element list (Elist header table subscript)
No_Elist : constant Elist_Id := Elist_Low_Bound;
-- Used to indicate absense of an element list. Note that this is not
-- an actual Elist header, so element list operations on this value
-- are not valid.
First_Elist_Id : constant Elist_Id := No_Elist + 1;
-- Subscript of first allocated Elist header.
-- Element Id values are used to identify individual elements of an
-- element list (see package Elists for further details).
type Elmt_Id is range Elmt_Low_Bound .. Elmt_High_Bound;
-- Type used to identify an element list
No_Elmt : constant Elmt_Id := Elmt_Low_Bound;
-- Used to represent empty element
First_Elmt_Id : constant Elmt_Id := No_Elmt + 1;
-- Subscript of first allocated Elmt table entry
-------------------------------
-- Types for Stringt Package --
-------------------------------
-- String_Id values are used to identify entries in the strings table.
-- They are subscripts into the strings table defined in package Strings.
-- Note that with only a few exceptions, which are clearly documented, the
-- type String_Id should be regarded as a private type. In particular it is
-- never appropriate to perform arithmetic operations using this type.
type String_Id is range Strings_Low_Bound .. Strings_High_Bound;
-- Type used to identify entries in the strings table
No_String : constant String_Id := Strings_Low_Bound;
-- Used to indicate missing string Id. Note that the value zero is used
-- to indicate a missing data value for all the Int types in this section.
First_String_Id : constant String_Id := No_String + 1;
-- First subscript allocated in string table
-------------------------
-- Character Code Type --
-------------------------
-- The type Char is used for character data internally in the compiler,
-- but character codes in the source are represented by the Char_Code
-- type. Each character literal in the source is interpreted as being one
-- of the 2**16 possible Wide_Character codes, and a unique integer value
-- is assigned, corresponding to the POS value in the Wide_Character type.
-- String literals are similarly interpreted as a sequence of such codes.
-- Note: when character code values are stored in the tree, they are stored
-- by adding a bias value (Char_Code_Bias) that results in values that can
-- be distinguished from other types of values stored in the tree.
type Char_Code is mod 2 ** 16;
for Char_Code'Size use 16;
function Get_Char_Code (C : Character) return Char_Code;
pragma Inline (Get_Char_Code);
-- Function to obtain internal character code from source character. For
-- the moment, the internal character code is simply the Pos value of the
-- input source character, but we provide this interface for possible
-- later support of alternative character sets.
function In_Character_Range (C : Char_Code) return Boolean;
pragma Inline (In_Character_Range);
-- Determines if the given character code is in range of type Character,
-- and if so, returns True. If not, returns False.
function Get_Character (C : Char_Code) return Character;
pragma Inline (Get_Character);
-- For a character C that is in character range (see above function), this
-- function returns the corresponding Character value. It is an error to
-- call Get_Character if C is not in character range
---------------------------------------
-- Types used for Library Management --
---------------------------------------
type Unit_Number_Type is new Int;
-- Unit number. The main source is unit 0, and subsidiary sources have
-- non-zero numbers starting with 1. Unit numbers are used to index the
-- file table in Lib.
Main_Unit : constant Unit_Number_Type := 0;
-- Unit number value for main unit
No_Unit : constant Unit_Number_Type := -1;
-- Special value used to signal no unit
type Source_File_Index is new Nat;
-- Type used to index the source file table (see package Sinput)
No_Source_File : constant Source_File_Index := 0;
-- Value used to indicate no source file present
System_Source_File_Index : constant Source_File_Index := 1;
-- Value used for source file table entry for system.ads, which is
-- always the first source file read (see unit Targparm for details).
subtype File_Name_Type is Name_Id;
-- File names are stored in the names table and this synonym is used to
-- indicate that a Name_Id value is being used to hold a simple file
-- name (which does not include any directory information).
No_File : constant File_Name_Type := File_Name_Type (No_Name);
-- Constant used to indicate no file found
subtype Unit_Name_Type is Name_Id;
-- Unit names are stored in the names table and this synonym is used to
-- indicate that a Name_Id value is being used to hold a unit name.
-----------------------------------
-- Representation of Time Stamps --
-----------------------------------
-- All compiled units are marked with a time stamp which is derived from
-- the source file (we assume that the host system has the concept of a
-- file time stamp which is modified when a file is modified). These
-- time stamps are used to ensure consistency of the set of units that
-- constitutes a library. Time stamps are 12 character strings with
-- with the following format:
-- YYYYMMDDHHMMSS
-- YYYY year
-- MM month (2 digits 01-12)
-- DD day (2 digits 01-31)
-- HH hour (2 digits 00-23)
-- MM minutes (2 digits 00-59)
-- SS seconds (2 digits 00-59)
-- In the case of Unix systems (and other systems which keep the time in
-- GMT), the time stamp is the GMT time of the file, not the local time.
-- This solves problems in using libraries across networks with clients
-- spread across multiple time-zones.
Time_Stamp_Length : constant := 14;
-- Length of time stamp value
subtype Time_Stamp_Index is Natural range 1 .. Time_Stamp_Length;
type Time_Stamp_Type is new String (Time_Stamp_Index);
-- Type used to represent time stamp
Empty_Time_Stamp : constant Time_Stamp_Type := (others => ' ');
-- Type used to represent an empty or missing time stamp. Looks less
-- than any real time stamp if two time stamps are compared. Note that
-- although this is not a private type, clients should not rely on the
-- exact way in which this string is represented, and instead should
-- use the subprograms below.
Dummy_Time_Stamp : constant Time_Stamp_Type := (others => '0');
-- This is used for dummy time stamp values used in the D lines for
-- non-existant files, and is intended to be an impossible value.
function "=" (Left, Right : Time_Stamp_Type) return Boolean;
function "<=" (Left, Right : Time_Stamp_Type) return Boolean;
function ">=" (Left, Right : Time_Stamp_Type) return Boolean;
function "<" (Left, Right : Time_Stamp_Type) return Boolean;
function ">" (Left, Right : Time_Stamp_Type) return Boolean;
-- Comparison functions on time stamps. Note that two time stamps
-- are defined as being equal if they have the same day/month/year
-- and the hour/minutes/seconds values are within 2 seconds of one
-- another. This deals with rounding effects in library file time
-- stamps caused by copying operations during installation. We have
-- particularly noticed that WinNT seems susceptible to such changes.
-- Note: the Empty_Time_Stamp value looks equal to itself, and less
-- than any non-empty time stamp value.
procedure Split_Time_Stamp
(TS : Time_Stamp_Type;
Year : out Nat;
Month : out Nat;
Day : out Nat;
Hour : out Nat;
Minutes : out Nat;
Seconds : out Nat);
-- Given a time stamp, decompose it into its components
procedure Make_Time_Stamp
(Year : Nat;
Month : Nat;
Day : Nat;
Hour : Nat;
Minutes : Nat;
Seconds : Nat;
TS : out Time_Stamp_Type);
-- Given the components of a time stamp, initialize the value
-----------------------------------------------
-- Types used for Pragma Suppress Management --
-----------------------------------------------
-- The following record contains an entry for each recognized check name
-- for pragma Suppress. It is used to represent current settings of scope
-- based suppress actions from pragma Suppress or command line settings.
type Suppress_Record is record
Access_Checks : Boolean;
Accessibility_Checks : Boolean;
Discriminant_Checks : Boolean;
Division_Checks : Boolean;
Elaboration_Checks : Boolean;
Index_Checks : Boolean;
Length_Checks : Boolean;
Overflow_Checks : Boolean;
Range_Checks : Boolean;
Storage_Checks : Boolean;
Tag_Checks : Boolean;
end record;
-- To add a new check type to GNAT, the following steps are required:
-- 1. Add an appropriate entry to the above record type
-- 2. Add an entry to Snames spec and body for the new name
-- 3. Add an entry to the definition of Check_Id in the Snames spec
-- 4. Add a new entity flag definition in Einfo for the check
-- 5. Add a new function to Sem.Util to handle the new check test
-- 6. Add appropriate processing for pragma Suppress in Sem.Prag
-- 7. Add a branch to the case statement in Sem.Ch8.Pop_Scope
-- 8. Add a new Do_xxx_Check flag to Sinfo (if required)
-- 9. Add appropriate checks for the new test
-----------------------------------
-- Global Exception Declarations --
-----------------------------------
-- This section contains declarations of exceptions that are used
-- throughout the compiler.
Unrecoverable_Error : exception;
-- This exception is raised to immediately terminate the compilation
-- of the current source program. Used in situations where things are
-- bad enough that it doesn't seem worth continuing (e.g. max errors
-- reached, or a required file is not found). Also raised when the
-- compiler finds itself in trouble after an error (see Comperr).
---------------------------------
-- Parameter Mechanism Control --
---------------------------------
-- Function and parameter entities have a field that records the
-- passing mechanism. See specification of Sem_Mech for full details.
-- The following subtype is used to represent values of this type:
subtype Mechanism_Type is Int range -10 .. Int'Last;
-- Type used to represent a mechanism value. This is a subtype rather
-- than a type to avoid some annoying processing problems with certain
-- routines in Einfo (processing them to create the corresponding C).
end Types;
|
source/amf/uml/amf-uml-duration_constraints.ads | svn2github/matreshka | 24 | 17421 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A duration constraint is a constraint that refers to a duration interval.
------------------------------------------------------------------------------
with AMF.Boolean_Collections;
limited with AMF.UML.Duration_Intervals;
with AMF.UML.Interval_Constraints;
package AMF.UML.Duration_Constraints is
pragma Preelaborate;
type UML_Duration_Constraint is limited interface
and AMF.UML.Interval_Constraints.UML_Interval_Constraint;
type UML_Duration_Constraint_Access is
access all UML_Duration_Constraint'Class;
for UML_Duration_Constraint_Access'Storage_Size use 0;
not overriding function Get_First_Event
(Self : not null access constant UML_Duration_Constraint)
return AMF.Boolean_Collections.Set_Of_Boolean is abstract;
-- Getter of DurationConstraint::firstEvent.
--
-- The value of firstEvent[i] is related to constrainedElement[i] (where i
-- is 1 or 2). If firstEvent[i] is true, then the corresponding
-- observation event is the first time instant the execution enters
-- constrainedElement[i]. If firstEvent[i] is false, then the
-- corresponding observation event is the last time instant the execution
-- is within constrainedElement[i]. Default value is true applied when
-- constrainedElement[i] refers an element that represents only one time
-- instant.
not overriding function Get_Specification
(Self : not null access constant UML_Duration_Constraint)
return AMF.UML.Duration_Intervals.UML_Duration_Interval_Access is abstract;
-- Getter of DurationConstraint::specification.
--
-- The interval constraining the duration.
not overriding procedure Set_Specification
(Self : not null access UML_Duration_Constraint;
To : AMF.UML.Duration_Intervals.UML_Duration_Interval_Access) is abstract;
-- Setter of DurationConstraint::specification.
--
-- The interval constraining the duration.
end AMF.UML.Duration_Constraints;
|
source/league/ucd/matreshka-internals-unicode-ucd-core_01d1.ads | svn2github/matreshka | 24 | 1323 | <reponame>svn2github/matreshka
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2015, <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 Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_01D1 is
pragma Preelaborate;
Group_01D1 : aliased constant Core_Second_Stage
:= (16#27# .. 16#28# => -- 01D127 .. 01D128
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#5E# .. 16#64# => -- 01D15E .. 01D164
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base
| Changes_When_NFKC_Casefolded => True,
others => False)),
16#65# => -- 01D165
(Spacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Grapheme_Extend
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#66# => -- 01D166
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#67# .. 16#69# => -- 01D167 .. 01D169
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#6D# => -- 01D16D
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Diacritic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#6E# .. 16#72# => -- 01D16E .. 01D172
(Spacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Other_Grapheme_Extend
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#73# .. 16#7A# => -- 01D173 .. 01D17A
(Format, Neutral,
Control, Format, Format, Combining_Mark,
(Case_Ignorable
| Default_Ignorable_Code_Point
| Changes_When_NFKC_Casefolded => True,
others => False)),
16#7B# .. 16#82# => -- 01D17B .. 01D182
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#85# .. 16#8B# => -- 01D185 .. 01D18B
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#AA# .. 16#AD# => -- 01D1AA .. 01D1AD
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#BB# .. 16#C0# => -- 01D1BB .. 01D1C0
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base
| Changes_When_NFKC_Casefolded => True,
others => False)),
16#DE# .. 16#FF# => -- 01D1DE .. 01D1FF
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
others =>
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_01D1;
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xa0_notsx.log_21829_603.asm | ljhsiun2/medusa | 9 | 178749 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %rcx
lea addresses_D_ht+0x183cc, %r10
nop
nop
nop
nop
cmp %rcx, %rcx
and $0xffffffffffffffc0, %r10
movntdqa (%r10), %xmm2
vpextrq $0, %xmm2, %r11
nop
nop
nop
nop
nop
cmp $12356, %r11
pop %rcx
pop %r11
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r12
push %r13
push %r14
push %r8
push %r9
push %rax
push %rbx
// Store
mov $0xcc, %rax
clflush (%rax)
nop
inc %r12
movw $0x5152, (%rax)
sub %rax, %rax
// Store
mov $0x34c, %r14
nop
nop
nop
nop
nop
cmp $51435, %r13
movl $0x51525354, (%r14)
nop
nop
nop
inc %r12
// Faulty Load
lea addresses_PSE+0x1d3cc, %rbx
nop
xor %r8, %r8
mov (%rbx), %rax
lea oracles, %rbx
and $0xff, %rax
shlq $12, %rax
mov (%rbx,%rax,1), %rax
pop %rbx
pop %rax
pop %r9
pop %r8
pop %r14
pop %r13
pop %r12
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_PSE', 'AVXalign': False, 'size': 1, 'NT': False, 'same': False, 'congruent': 0}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_P', 'AVXalign': False, 'size': 2, 'NT': False, 'same': False, 'congruent': 7}}
{'OP': 'STOR', 'dst': {'type': 'addresses_P', 'AVXalign': False, 'size': 4, 'NT': False, 'same': False, 'congruent': 7}}
[Faulty Load]
{'src': {'type': 'addresses_PSE', 'AVXalign': False, 'size': 8, 'NT': False, 'same': True, 'congruent': 0}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'size': 16, 'NT': True, 'same': False, 'congruent': 11}, 'OP': 'LOAD'}
{'33': 21829}
33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33
*/
|
HelloWorld.applescript | Daniel-Stout/HelloWorld | 0 | 3760 | say "Hello, World :D!"
|
test/link/uninit2/module2.asm | nigelperks/BasicAssembler | 0 | 98210 | <reponame>nigelperks/BasicAssembler
IDEAL
SEGMENT UDATA UNINIT PUBLIC
_bill DW ?
ENDS UDATA
PUBLIC _bill
END
|
specs/ada/server/ike/tkmrpc-operation_handlers-ike-isa_skip_create_first.adb | DrenfongWong/tkm-rpc | 0 | 24655 | with Tkmrpc.Servers.Ike;
with Tkmrpc.Results;
with Tkmrpc.Request.Ike.Isa_Skip_Create_First.Convert;
with Tkmrpc.Response.Ike.Isa_Skip_Create_First.Convert;
package body Tkmrpc.Operation_Handlers.Ike.Isa_Skip_Create_First is
-------------------------------------------------------------------------
procedure Handle (Req : Request.Data_Type; Res : out Response.Data_Type) is
Specific_Req : Request.Ike.Isa_Skip_Create_First.Request_Type;
Specific_Res : Response.Ike.Isa_Skip_Create_First.Response_Type;
begin
Specific_Res := Response.Ike.Isa_Skip_Create_First.Null_Response;
Specific_Req :=
Request.Ike.Isa_Skip_Create_First.Convert.From_Request (S => Req);
if Specific_Req.Data.Isa_Id'Valid then
Servers.Ike.Isa_Skip_Create_First
(Result => Specific_Res.Header.Result,
Isa_Id => Specific_Req.Data.Isa_Id);
Res :=
Response.Ike.Isa_Skip_Create_First.Convert.To_Response
(S => Specific_Res);
else
Res.Header.Result := Results.Invalid_Parameter;
end if;
end Handle;
end Tkmrpc.Operation_Handlers.Ike.Isa_Skip_Create_First;
|
t/g4-grammars/Simple.g4 | spebern/ANTLRv4-Translator | 0 | 519 | grammar Simple;
NUMBER
: [0 - 9]+
; |
tests/t05.asm | mras0/sasm | 26 | 100602 | <reponame>mras0/sasm<filename>tests/t05.asm
org 0x100
main:
mov ax, 54321
call printdec
mov ax, 65535
call printdec
mov ax, 0
call printdec
mov ax, 0x4c00
int 0x21
putch:
pusha
mov ah, 0x02
mov dl, al
int 0x21
popa
ret
; Print decimal number in ax
printdec:
push ax
push bx
push dx
; XXX: Ugly to use the stack as a character buffer in this way, but meh
push 0
mov bx, 10
.l:
xor dx, dx
div bx
xchg dx, ax
add al, '0'
push ax
xchg dx, ax
and ax, ax
jnz .l
.p:
pop ax
and ax, ax
jz .done
call putch
jmp .p
.done:
pop dx
pop bx
pop ax
ret
|
vm/asm_constructions_test/NotConstructionTest.asm | MarkoVMicic/nand2tetris-solutions | 0 | 102254 | <gh_stars>0
// Initialize stack pointer to start at 256 (i.e. RAM[0] contains 256)
@256
D=A
@SP
M=D
// push constant 69
@69
D=A
@SP
A=M
M=D
@SP
M=M+1
// not:
// 69: 0000000001000101
// !69: 1111111110111010 (-70)
@SP
M=M-1
A=M
M=!M
@SP
M=M+1
|
3-mid/physics/implement/box2d/source/thin/box2d_c-b2d_ray_collision.ads | charlie5/lace | 20 | 5645 | -- This file is generated by SWIG. Please do *not* modify by hand.
--
with c_math_c;
with c_math_c.Vector_3;
with interfaces.C;
package box2d_c.b2d_ray_Collision is
-- Item
--
type Item is
record
near_Object : access box2d_c.Object;
hit_Fraction : aliased c_math_c.Real;
Normal_world : aliased c_math_c.Vector_3.Item;
Site_world : aliased c_math_c.Vector_3.Item;
end record;
-- Items
--
type Items is array (interfaces.C.Size_t range <>) of aliased box2d_c.b2d_ray_Collision.Item;
-- Pointer
--
type Pointer is access all box2d_c.b2d_ray_Collision.Item;
-- Pointers
--
type Pointers is array (interfaces.C.Size_t range <>) of aliased box2d_c.b2d_ray_Collision.Pointer;
-- Pointer_Pointer
--
type Pointer_Pointer is access all box2d_c.b2d_ray_Collision.Pointer;
function construct return box2d_c.b2d_ray_Collision.Item;
private
pragma Import (C, construct, "Ada_new_b2d_ray_Collision");
end box2d_c.b2d_ray_Collision;
|
alloy4fun_models/trashltl/models/17/caxmPqPD7oAL4AeBf.als | Kaixi26/org.alloytools.alloy | 0 | 4921 | <reponame>Kaixi26/org.alloytools.alloy
open main
pred idcaxmPqPD7oAL4AeBf_prop18 {
always all p : Protected | p in Protected until p in Trash
}
pred __repair { idcaxmPqPD7oAL4AeBf_prop18 }
check __repair { idcaxmPqPD7oAL4AeBf_prop18 <=> prop18o } |
1571/64tass/lccgcrbn.asm | silverdr/assembly | 23 | 23438 | <gh_stars>10-100
; even faster gcr to binary conversion
jget4gb ldy gcrpnt
lda (bufpnt),y
sta gtab ; A
and #mask2
sta gtab+1
iny ; next byte
bne + ; test for next buffer
lda nxtbf
sta bufpnt+1
ldy nxtpnt
+ lda (bufpnt),y
sta gtab+2 ; C
and #mask2x
ora gtab+1
sta gtab+1 ; B
lda gtab+2
and #mask4
sta gtab+3
iny ; next
lda (bufpnt),y
tax
and #mask4x
ora gtab+3
sta gtab+3 ; D
txa
and #mask5
sta gtab+4
iny ; next byte
lda (bufpnt),y
sta gtab+5 ; F
and #mask5x
ora gtab+4
sta gtab+4 ; E
lda gtab+5
and #mask7
sta gtab+6
iny
; test for overflow during write to binary conversion
bne +
lda nxtbf
sta bufpnt+1
ldy nxtpnt
sty bufpnt
+ lda (bufpnt),y
sta gtab+7 ; H
and #mask7x
ora gtab+6
sta gtab+6 ; G
iny
sty gcrpnt
ldx gtab
lda gcrtb1,x ; a
ldx gtab+1
ora gcrtba,x ; b
sta btab
ldx gtab+2
lda gcrtb2,x ; c
ldx gtab+3
ora gcrtbd,x ; d
sta btab+1
ldx gtab+4
lda gcrtbe,x ; e
ldx gtab+5
ora gcrtb3,x ; f
sta btab+2
ldx gtab+6
lda gcrtbg,x ; g
ldx gtab+7
ora gcrtb4,x ; h
sta btab+3
rts
jgcrbin lda #0 ; setup pointers
sta gcrpnt
sta savpnt
sta bytcnt
lda #>ovrbuf ; point to overflow first
sta nxtbf
lda #255-toprd ; overflow offset
sta nxtpnt
lda bufpnt+1
sta savpnt+1
jsr jget4gb
lda btab
sta bid ; get header id
ldy bytcnt
lda btab+1
sta (savpnt),y
iny
lda btab+2
sta (savpnt),y
iny
lda btab+3
sta (savpnt),y
iny
- sty bytcnt
jsr jget4gb
ldy bytcnt
lda btab
sta (savpnt),y
iny
beq + ; test if done yet
lda btab+1
sta (savpnt),y
iny
lda btab+2
sta (savpnt),y
iny
lda btab+3
sta (savpnt),y
iny
bne - ; jmp
+ lda savpnt+1 ; restore buffer pointer
sta bufpnt+1
rts
|
data/github.com/alhassy/AgdaCheatSheet/14597cf3ce5bb985ba4dcb1a3f7384fda8f129c3/CompilingAgda.agda | ajnavarro/language-dataset | 9 | 6992 | <filename>data/github.com/alhassy/AgdaCheatSheet/14597cf3ce5bb985ba4dcb1a3f7384fda8f129c3/CompilingAgda.agda
-- Interacting with the real world ---Compilation, Haskell, and IO
-- :PROPERTIES:
-- :header-args: :tangle "CompilingAgda.agda" :comments org
-- :CUSTOM_ID: agda-interacting-with-the-real-world
-- :END:
-- # C-c C-v C-t tangles the following code into CompilingAgda.agda.
-- # Then we may compile the result using:
-- # (shell-command "NAME=CompilingAgda; time agda --compile $NAME.agda; ./$NAME")
-- #
-- # Btw: (find-file "./MAlonzo/Code/CompilingAgda.hs")
-- #+latex: {\color{white}.} \vspace{-1em}
-- #+begin_quote org
-- /Let's demonstrate how we can reach into Haskell, thereby subverting Agda!/
-- #+end_quote
-- An Agda program module containing a ~main~ function is compiled into a standalone executable
-- with ~agda --compile myfile.agda~. If the module has no main file, use the flag ~--no-main~.
-- If you only want the resulting Haskell, not necessarily an executable program, then use the flag
-- ~--ghc-dont-call-ghc~.
-- The type of ~main~ should be ~Agda.Builtin.IO.IO A~, for some ~A~;
-- this is just a proxy to Haskell's ~IO~.
-- We may ~open import IO.Primitive~ to get /this/ ~IO~, but
-- this one works with costrings, which are a bit awkward.
-- Instead, we use the standard library's wrapper type, also named ~IO~.
-- Then we use ~run~ to move from ~IO~ to ~Primitive.IO~; conversely one uses ~lift~.
-- #+latex: \begin{minipage}[c]{0.55\linewidth}
-- #+latex: \begin{tiny}
open import Data.Nat using (ℕ; suc)
open import Data.Nat.Show using (show)
open import Data.Char using (Char)
open import Data.List as L using (map; sum; upTo)
open import Function using (_$_; const; _∘_)
open import Data.String as S using (String; _++_; fromList)
open import Agda.Builtin.Unit using (⊤)
open import Codata.Musical.Colist using (take)
open import Codata.Musical.Costring using (Costring)
open import Data.BoundedVec.Inefficient as B using (toList)
open import Agda.Builtin.Coinduction using (♯_)
open import IO as IO using (run ; putStrLn ; IO)
import IO.Primitive as Primitive
-- #+latex: \end{tiny}
-- #+latex: \end{minipage} % no space if you would like to put them side by side
-- #+latex: \begin{minipage}[c]{0.5\linewidth}
-- #+begin_quote org
-- /Agda has *no* primitives for side-effects, instead it allows arbitrary/
-- /Haskell functions to be imported as axioms, whose definitions are only/
-- /used at run-time./
-- #+end_quote
-- #+latex: \end{minipage}
-- Agda lets us use “do”-notation as in Haskell.
-- To do so, methods named ~_>>_~ and ~_>>=_~ need to be in scope ---that is all.
-- The type of ~IO._>>_~ takes two “lazy” IO actions and yield a non-lazy IO action.
-- The one below is a homogeneously typed version.
infixr 1 _>>=_ _>>_
_>>=_ : ∀ {ℓ} {α β : Set ℓ} → IO α → (α → IO β) → IO β
this >>= f = ♯ this IO.>>= λ x → ♯ f x
_>>_ : ∀{ℓ} {α β : Set ℓ} → IO α → IO β → IO β
x >> y = x >>= const y
-- Oddly, Agda's standard library comes with ~readFile~ and
-- ~writeFile~, but the symmetry ends there since it provides ~putStrLn~
-- but not [[https://hackage.haskell.org/package/base-4.12.0.0/docs/Prelude.html#v:getLine][~getLine~]]. Mimicking the ~IO.Primitive~ module, we define /two/
-- versions ourselves as proxies for Haskell's ~getLine~ ---the second one
-- below is bounded by 100 characters, whereas the first is not.
postulate
getLine∞ : Primitive.IO Costring
{-# FOREIGN GHC
toColist :: [a] -> MAlonzo.Code.Codata.Musical.Colist.AgdaColist a
toColist [] = MAlonzo.Code.Codata.Musical.Colist.Nil
toColist (x : xs) =
MAlonzo.Code.Codata.Musical.Colist.Cons x (MAlonzo.RTE.Sharp (toColist xs))
#-}
{- Haskell's prelude is implicitly available; this is for demonstration. -}
{-# FOREIGN GHC import Prelude as Haskell #-}
{-# COMPILE GHC getLine∞ = fmap toColist Haskell.getLine #-}
-- (1)
-- getLine : IO Costring
-- getLine = IO.lift getLine∞
getLine : IO String
getLine = IO.lift
$ getLine∞ Primitive.>>= (Primitive.return ∘ S.fromList ∘ B.toList ∘ take 100)
-- We obtain ~MAlonzo~ strings, then convert those to colists, then
-- eventually lift those to the wrapper ~IO~ type.
-- Let's also give ourselves Haskell's ~read~ method.
postulate readInt : L.List Char → ℕ
{-# COMPILE GHC readInt = \x -> read x :: Integer #-}
-- Now we write our ~main~ method.
main : Primitive.IO ⊤
main = run do putStrLn "Hello, world! I'm a compiled Agda program!"
putStrLn "What is your name?"
name ← getLine
putStrLn "Please enter a number."
num ← getLine
let tri = show $ sum $ upTo $ suc $ readInt $ S.toList num
putStrLn $ "The triangle number of " ++ num ++ " is " ++ tri
putStrLn "Bye, "
-- IO.putStrLn∞ name {- If we use approach (1) above. -}
putStrLn $ "\t" ++ name
|
src/sys/processes/util-processes.ads | RREE/ada-util | 60 | 3343 | -----------------------------------------------------------------------
-- util-processes -- Process creation and control
-- Copyright (C) 2011, 2012, 2016, 2018, 2021 <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.Streams;
with Util.Systems.Types;
with Ada.Finalization;
with Ada.Strings.Unbounded;
package Util.Processes is
Invalid_State : exception;
Process_Error : exception;
-- The optional process pipes:
-- <dl>
-- <dt>NONE</dt>
-- <dd>the process will inherit the standard input, output and error.</dd>
-- <dt>READ</dt>
-- <dd>a pipe is created to read the process standard output.</dd>
-- <dt>READ_ERROR</dt>
-- <dd>a pipe is created to read the process standard error. The output and input are
-- inherited.</dd>
-- <dt>READ_ALL</dt>
-- <dd>similar to READ the same pipe is used for the process standard error.</dd>
-- <dt>WRITE</dt>
-- <dd>a pipe is created to write on the process standard input.</dd>
-- <dt>READ_WRITE</dt>
-- <dd>Combines the <b>READ</b> and <b>WRITE</b> modes.</dd>
-- <dt>READ_WRITE_ALL</dt>
-- <dd>Combines the <b>READ_ALL</b> and <b>WRITE</b> modes.</dd>
-- </dl>
type Pipe_Mode is (NONE, READ, READ_ERROR, READ_ALL, WRITE, READ_WRITE, READ_WRITE_ALL);
subtype String_Access is Ada.Strings.Unbounded.String_Access;
subtype File_Type is Util.Systems.Types.File_Type;
type Argument_List is array (Positive range <>) of String_Access;
type Process_Identifier is new Integer;
-- ------------------------------
-- Process
-- ------------------------------
type Process is limited private;
-- Before launching the process, redirect the input stream of the process
-- to the specified file.
-- Raises <b>Invalid_State</b> if the process is running.
procedure Set_Input_Stream (Proc : in out Process;
File : in String);
-- Set the output stream of the process.
-- Raises <b>Invalid_State</b> if the process is running.
procedure Set_Output_Stream (Proc : in out Process;
File : in String;
Append : in Boolean := False);
-- Set the error stream of the process.
-- Raises <b>Invalid_State</b> if the process is running.
procedure Set_Error_Stream (Proc : in out Process;
File : in String;
Append : in Boolean := False);
-- Set the working directory that the process will use once it is created.
-- The directory must exist or the <b>Invalid_Directory</b> exception will be raised.
procedure Set_Working_Directory (Proc : in out Process;
Path : in String);
-- Set the shell executable path to use to launch a command. The default on Unix is
-- the /bin/sh command. Argument splitting is done by the /bin/sh -c command.
-- When setting an empty shell command, the argument splitting is done by the
-- <tt>Spawn</tt> procedure.
procedure Set_Shell (Proc : in out Process;
Shell : in String);
-- Closes the given file descriptor in the child process before executing the command.
procedure Add_Close (Proc : in out Process;
Fd : in File_Type);
-- Append the argument to the current process argument list.
-- Raises <b>Invalid_State</b> if the process is running.
procedure Append_Argument (Proc : in out Process;
Arg : in String);
-- Set the environment variable to be used by the process before its creation.
procedure Set_Environment (Proc : in out Process;
Name : in String;
Value : in String);
procedure Set_Environment (Proc : in out Process;
Iterate : not null access
procedure
(Process : not null access procedure
(Name : in String;
Value : in String)));
-- Spawn a new process with the given command and its arguments. The standard input, output
-- and error streams are either redirected to a file or to a stream object.
procedure Spawn (Proc : in out Process;
Command : in String;
Arguments : in Argument_List;
Mode : in Pipe_Mode := NONE);
procedure Spawn (Proc : in out Process;
Command : in String;
Mode : in Pipe_Mode := NONE);
procedure Spawn (Proc : in out Process;
Mode : in Pipe_Mode := NONE);
-- Wait for the process to terminate.
procedure Wait (Proc : in out Process);
-- Terminate the process by sending a signal on Unix and exiting the process on Windows.
-- This operation is not portable and has a different behavior between Unix and Windows.
-- Its intent is to stop the process.
procedure Stop (Proc : in out Process;
Signal : in Positive := 15);
-- Get the process exit status.
function Get_Exit_Status (Proc : in Process) return Integer;
-- Get the process identifier.
function Get_Pid (Proc : in Process) return Process_Identifier;
-- Returns True if the process is running.
function Is_Running (Proc : in Process) return Boolean;
-- Get the process input stream allowing to write on the process standard input.
function Get_Input_Stream (Proc : in Process) return Util.Streams.Output_Stream_Access;
-- Get the process output stream allowing to read the process standard output.
function Get_Output_Stream (Proc : in Process) return Util.Streams.Input_Stream_Access;
-- Get the process error stream allowing to read the process standard output.
function Get_Error_Stream (Proc : in Process) return Util.Streams.Input_Stream_Access;
private
type File_Type_Array is array (Positive range <>) of File_Type;
type File_Type_Array_Access is access all File_Type_Array;
-- The <b>System_Process</b> interface is specific to the system. On Unix, it holds the
-- process identifier. On Windows, more information is necessary, including the process
-- and thread handles. It's a little bit overkill to setup an interface for this but
-- it looks cleaner than having specific system fields here.
type System_Process is limited interface;
type System_Process_Access is access all System_Process'Class;
type Process is new Ada.Finalization.Limited_Controlled with record
Pid : Process_Identifier := -1;
Sys : System_Process_Access := null;
Exit_Value : Integer := -1;
Dir : Ada.Strings.Unbounded.Unbounded_String;
In_File : Ada.Strings.Unbounded.Unbounded_String;
Out_File : Ada.Strings.Unbounded.Unbounded_String;
Err_File : Ada.Strings.Unbounded.Unbounded_String;
Shell : Ada.Strings.Unbounded.Unbounded_String;
Out_Append : Boolean := False;
Err_Append : Boolean := False;
Output : Util.Streams.Input_Stream_Access := null;
Input : Util.Streams.Output_Stream_Access := null;
Error : Util.Streams.Input_Stream_Access := null;
To_Close : File_Type_Array_Access;
end record;
-- Initialize the process instance.
overriding
procedure Initialize (Proc : in out Process);
-- Deletes the process instance.
overriding
procedure Finalize (Proc : in out Process);
-- Wait for the process to exit.
procedure Wait (Sys : in out System_Process;
Proc : in out Process'Class;
Timeout : in Duration) is abstract;
-- Terminate the process by sending a signal on Unix and exiting the process on Windows.
-- This operation is not portable and has a different behavior between Unix and Windows.
-- Its intent is to stop the process.
procedure Stop (Sys : in out System_Process;
Proc : in out Process'Class;
Signal : in Positive := 15) is abstract;
-- Spawn a new process.
procedure Spawn (Sys : in out System_Process;
Proc : in out Process'Class;
Mode : in Pipe_Mode := NONE) is abstract;
-- Clear the program arguments.
procedure Clear_Arguments (Sys : in out System_Process) is abstract;
-- Append the argument to the process argument list.
procedure Append_Argument (Sys : in out System_Process;
Arg : in String) is abstract;
-- Set the environment variable to be used by the process before its creation.
procedure Set_Environment (Sys : in out System_Process;
Name : in String;
Value : in String) is abstract;
-- Set the process input, output and error streams to redirect and use specified files.
procedure Set_Streams (Sys : in out System_Process;
Input : in String;
Output : in String;
Error : in String;
Append_Output : in Boolean;
Append_Error : in Boolean;
To_Close : in File_Type_Array_Access) is abstract;
-- Deletes the storage held by the system process.
procedure Finalize (Sys : in out System_Process) is abstract;
end Util.Processes;
|
bucket_D7/gprbuild/patches/patch-gpr_src_gpr-compilation-protocol.adb | jrmarino/ravensource | 17 | 25121 | <gh_stars>10-100
Revert to older code compatible with gcc9
--- gpr/src/gpr-compilation-protocol.adb.orig 2021-05-19 05:22:13 UTC
+++ gpr/src/gpr-compilation-protocol.adb
@@ -22,7 +22,7 @@
-- --
------------------------------------------------------------------------------
-with Ada.Calendar.Conversions; use Ada.Calendar;
+with Ada.Calendar.Time_Zones; use Ada.Calendar;
with Ada.Calendar.Formatting; use Ada.Calendar.Formatting;
with Ada.Characters.Handling;
with Ada.Directories; use Ada.Directories;
@@ -972,18 +972,29 @@ package body GPR.Compilation.Protocol is
procedure Set_File_Stamp
(Path_Name : String; Time_Stamp : Time_Stamp_Type)
is
- function TS (First, Last : Positive) return Integer is
- (Integer'Value (String (Time_Stamp (First .. Last))));
- -- Converts substring from Time_Stamp to Integer
+ use type Time_Zones.Time_Offset;
+
+ TS : constant String (Time_Stamp_Type'Range) := String (Time_Stamp);
+
+ T : constant Time :=
+ Time_Of (Year => Year_Number'Value (TS (1 .. 4)),
+ Month => Month_Number'Value (TS (5 .. 6)),
+ Day => Day_Number'Value (TS (7 .. 8)),
+ Hour => Hour_Number'Value (TS (9 .. 10)),
+ Minute => Minute_Number'Value (TS (11 .. 12)),
+ Second => Second_Number'Value (TS (13 .. 14)),
+ Time_Zone => -Time_Zones.UTC_Time_Offset);
+ -- Time_Zone is negative to translate the UTC Time_Stamp to local time
begin
Set_File_Last_Modify_Time_Stamp
(Path_Name,
- To_Ada
- (time_t
- (Conversions.To_Unix_Time
- (Time_Of
- (TS (1, 4), TS (5, 6), TS (7, 8),
- TS (9, 10), TS (11, 12), TS (13, 14))))));
+ GM_Time_Of
+ (Year => Formatting.Year (T),
+ Month => Formatting.Month (T),
+ Day => Formatting.Day (T),
+ Hour => Formatting.Hour (T),
+ Minute => Formatting.Minute (T),
+ Second => Formatting.Second (T)));
end Set_File_Stamp;
-----------------------
|
libsrc/math/mbf32/c/sccz80/l_f32_ne.asm | jpoikela/z88dk | 640 | 25888 |
SECTION code_fp_mbf32
PUBLIC l_f32_ne
EXTERN l_f32_yes
EXTERN l_f32_no
EXTERN ___mbf32_setup_comparison
; Stack == registers
l_f32_ne:
call ___mbf32_setup_comparison
; 0b00000000 = stack == register
; 0b00000001 = stack < register
; 0b11111111 = stack > register
and a
jp nz,l_f32_yes
jp l_f32_no
|
Transynther/x86/_processed/NONE/_ht_/i9-9900K_12_0xca.log_3369_367.asm | ljhsiun2/medusa | 9 | 18459 | .global s_prepare_buffers
s_prepare_buffers:
push %r13
push %r14
push %r8
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_A_ht+0x19dfa, %rsi
lea addresses_WC_ht+0x7dfa, %rdi
nop
nop
and $22654, %r13
mov $3, %rcx
rep movsl
xor $56184, %rdi
lea addresses_normal_ht+0xbefa, %rdx
sub $58130, %rdi
mov (%rdx), %r13w
nop
nop
nop
nop
nop
cmp %rsi, %rsi
lea addresses_WC_ht+0xfb12, %r8
nop
nop
nop
nop
sub %r14, %r14
mov $0x6162636465666768, %r13
movq %r13, %xmm6
vmovups %ymm6, (%r8)
nop
nop
nop
add $12332, %rdi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %r8
pop %r14
pop %r13
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r13
push %r14
push %r15
push %rbp
push %rdi
// Faulty Load
lea addresses_A+0x18dfa, %r14
nop
nop
nop
nop
cmp $49148, %r13
vmovups (%r14), %ymm7
vextracti128 $0, %ymm7, %xmm7
vpextrq $1, %xmm7, %rbp
lea oracles, %r14
and $0xff, %rbp
shlq $12, %rbp
mov (%r14,%rbp,1), %rbp
pop %rdi
pop %rbp
pop %r15
pop %r14
pop %r13
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'size': 1, 'NT': False, 'type': 'addresses_A', 'same': True, 'AVXalign': False, 'congruent': 0}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'size': 32, 'NT': False, 'type': 'addresses_A', 'same': True, 'AVXalign': False, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_A_ht', 'congruent': 8}, 'dst': {'same': False, 'type': 'addresses_WC_ht', 'congruent': 8}}
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_normal_ht', 'same': True, 'AVXalign': True, 'congruent': 8}}
{'OP': 'STOR', 'dst': {'size': 32, 'NT': False, 'type': 'addresses_WC_ht', 'same': False, 'AVXalign': False, 'congruent': 3}}
{'45': 3369}
45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45 45
*/
|
test/interaction/Issue1653.agda | cruhland/agda | 1,989 | 4480 | <reponame>cruhland/agda
-- Andreas, 2016-06-20
-- Issue #1653 reported by Jesper
-- Fixed by Ulf's AIM XXIII code sprint "instantiating module parameters"
open import Common.Equality
module _ (A : Set₁) where
-- Matching on refl works with new instantiateable module parameters.
test : A ≡ Set → Set₁
test refl = A
-- Case splitting thus should also work.
foo : A ≡ Set → Set₁
foo e = {!e!} -- C-c C-c
|
01_as_vs_nasm/02_as_var_memory.asm | ericens/assembly_language | 3 | 177891 | <gh_stars>1-10
// Data section begins
.section .data
var1: .int 40
var2: .int 20
var3: .int 30
.section .text
.globl _start
_start:
# move the contents of variables
movl (var1), %ecx
cmpl (var2), %ecx
jg check_third_var
movl (var2), %ecx
check_third_var:
cmpl (var3), %ecx
jg _exit
movl (var3), %ecx
_exit:
movl $1, %eax
movl %ecx, %ebx
int $0x80
|
notes/FOT/FOTC/Data/Nat/Inequalities/InductivePredicates.agda | asr/fotc | 11 | 4349 | ------------------------------------------------------------------------------
-- Testing some inductive predicates for inequalities
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module FOT.FOTC.Data.Nat.Inequalities.InductivePredicates where
open import FOTC.Base
open import FOTC.Data.Nat.Type
open import FOTC.Data.Nat.UnaryNumbers
------------------------------------------------------------------------------
module m₁ where
data _≤_ : D → D → Set where
z≤n : ∀ n → zero ≤ n
s≤s : ∀ {m n} → m ≤ n → succ₁ m ≤ succ₁ n
_<_ : D → D → Set
m < n = succ₁ m ≤ n
_≥_ : D → D → Set
m ≥ n = n ≤ m
_>_ : D → D → Set
m > n = n < m
x≤y→x≤Sy : ∀ {m n} → m ≤ n → m ≤ succ₁ n
x≤y→x≤Sy {.zero} {n} (z≤n .n) = z≤n (succ₁ n)
x≤y→x≤Sy (s≤s m≤n) = s≤s (x≤y→x≤Sy m≤n)
module m₂ where
data _≤_ : D → D → Set where
z≤n : ∀ {n} → N n → zero ≤ n
s≤s : ∀ {m n} → N m → N n → m ≤ n → succ₁ m ≤ succ₁ n
_<_ : D → D → Set
m < n = succ₁ m ≤ n
_≥_ : D → D → Set
m ≥ n = n ≤ m
_>_ : D → D → Set
m > n = n < m
x≤y→x≤Sy : ∀ {m n} → m ≤ n → m ≤ succ₁ n
x≤y→x≤Sy (z≤n Nn) = z≤n (nsucc Nn)
x≤y→x≤Sy (s≤s Nm Nn m≤n) = s≤s Nm (nsucc Nn) (x≤y→x≤Sy m≤n)
postulate
lt : D → D → D
lt-00 : lt zero zero ≡ false
lt-0S : ∀ n → lt zero (succ₁ n) ≡ true
lt-S0 : ∀ n → lt (succ₁ n) zero ≡ false
lt-SS : ∀ m n → lt (succ₁ m) (succ₁ n) ≡ lt m n
le : D → D → D
le m n = lt m (succ₁ n)
≤→le : ∀ {m n} → m ≤ n → le m n ≡ true
≤→le {n = n} (z≤n Nn) = lt-0S n
≤→le (s≤s nzero nzero h) = trans (lt-SS zero 1') (≤→le h)
≤→le (s≤s nzero (nsucc {n} Nn) h) = trans (lt-SS zero (succ₁ (succ₁ n))) (≤→le h)
≤→le (s≤s (nsucc {m} Nm) nzero h) = trans (lt-SS (succ₁ m) 1') (≤→le h)
≤→le (s≤s (nsucc {m} Nm) (nsucc {n} Nn) h) =
trans (lt-SS (succ₁ m) (succ₁ (succ₁ n))) (≤→le h)
le→≤ : ∀ {m n} → N m → N n → le m n ≡ true → m ≤ n
le→≤ nzero Nn h = z≤n Nn
le→≤ (nsucc nzero) nzero h =
⊥-elim (t≢f (trans (sym h) (trans (lt-SS zero zero) lt-00)))
le→≤ (nsucc (nsucc {m} Nm)) nzero h =
⊥-elim (t≢f (trans (sym h) (trans (lt-SS (succ₁ m) zero) (lt-S0 m))))
{-# CATCHALL #-}
le→≤ (nsucc {m} Nm) (nsucc {n} Nn) h =
s≤s Nm Nn (le→≤ Nm Nn (trans (sym (lt-SS m (succ₁ n))) h))
module m₃ where
data _≤_ : ∀ {m n} → N m → N n → Set where
z≤n : ∀ {n} → (Nn : N n) → nzero ≤ Nn
s≤s : ∀ {m n} → (Nm : N m) → (Nn : N n) → Nm ≤ Nn → nsucc Nm ≤ nsucc Nn
_<_ : ∀ {m n} → N m → N n → Set
Nm < Nn = nsucc Nm ≤ Nn
_≥_ : ∀ {m n} → N m → N n → Set
Nm ≥ Nn = Nn ≤ Nm
_>_ : ∀ {m n} → N m → N n → Set
Nm > Nn = Nn < Nm
x≤y→x≤Sy : ∀ {m n} → (Nm : N m) → (Nn : N n) → Nm ≤ Nn → Nm ≤ nsucc Nn
x≤y→x≤Sy .nzero Nn (z≤n .Nn) = z≤n (nsucc Nn)
x≤y→x≤Sy .(nsucc Nm) .(nsucc Nn) (s≤s Nm Nn Nm≤Nn) =
s≤s Nm (nsucc Nn) (x≤y→x≤Sy Nm Nn Nm≤Nn)
|
awa/plugins/awa-settings/src/awa-settings.adb | fuzzysloth/ada-awa | 81 | 16777 | -----------------------------------------------------------------------
-- awa-settings -- Settings module
-- Copyright (C) 2013 <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 Ada.Strings.Unbounded;
with Util.Strings;
with AWA.Settings.Modules;
package body AWA.Settings is
-- ------------------------------
-- Get the user setting identified by the given name.
-- If the user does not have such setting, return the default value.
-- ------------------------------
function Get_User_Setting (Name : in String;
Default : in String) return String is
Mgr : constant AWA.Settings.Modules.Setting_Manager_Access := AWA.Settings.Modules.Current;
Value : Ada.Strings.Unbounded.Unbounded_String;
begin
Mgr.Get (Name, Default, Value);
return Ada.Strings.Unbounded.To_String (Value);
end Get_User_Setting;
-- ------------------------------
-- Get the user setting identified by the given name.
-- If the user does not have such setting, return the default value.
-- ------------------------------
function Get_User_Setting (Name : in String;
Default : in Integer) return Integer is
Mgr : constant AWA.Settings.Modules.Setting_Manager_Access := AWA.Settings.Modules.Current;
Value : Ada.Strings.Unbounded.Unbounded_String;
begin
Mgr.Get (Name, Integer'Image (Default), Value);
return Integer'Value (Ada.Strings.Unbounded.To_String (Value));
end Get_User_Setting;
-- ------------------------------
-- Set the user setting identified by the given name. If the user
-- does not have such setting, it is created and set to the given value.
-- Otherwise, the user setting is updated to hold the new value.
-- ------------------------------
procedure Set_User_Setting (Name : in String;
Value : in String) is
Mgr : constant AWA.Settings.Modules.Setting_Manager_Access := AWA.Settings.Modules.Current;
begin
Mgr.Set (Name, Value);
end Set_User_Setting;
-- ------------------------------
-- Set the user setting identified by the given name. If the user
-- does not have such setting, it is created and set to the given value.
-- Otherwise, the user setting is updated to hold the new value.
-- ------------------------------
procedure Set_User_Setting (Name : in String;
Value : in Integer) is
Mgr : constant AWA.Settings.Modules.Setting_Manager_Access := AWA.Settings.Modules.Current;
begin
Mgr.Set (Name, Util.Strings.Image (Value));
end Set_User_Setting;
end AWA.Settings;
|
Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo-elaborators.adb | djamal2727/Main-Bearing-Analytical-Model | 0 | 25890 | <filename>Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo-elaborators.adb
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- B I N D O . E L A B O R A T O R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2019-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Butil; use Butil;
with Debug; use Debug;
with Output; use Output;
with Types; use Types;
with Bindo.Augmentors;
use Bindo.Augmentors;
use Bindo.Augmentors.Library_Graph_Augmentors;
with Bindo.Builders;
use Bindo.Builders;
use Bindo.Builders.Invocation_Graph_Builders;
use Bindo.Builders.Library_Graph_Builders;
with Bindo.Diagnostics;
use Bindo.Diagnostics;
with Bindo.Units;
use Bindo.Units;
with Bindo.Validators;
use Bindo.Validators;
use Bindo.Validators.Elaboration_Order_Validators;
with Bindo.Writers;
use Bindo.Writers;
use Bindo.Writers.ALI_Writers;
use Bindo.Writers.Dependency_Writers;
use Bindo.Writers.Elaboration_Order_Writers;
use Bindo.Writers.Invocation_Graph_Writers;
use Bindo.Writers.Library_Graph_Writers;
use Bindo.Writers.Phase_Writers;
use Bindo.Writers.Unit_Closure_Writers;
with GNAT; use GNAT;
with GNAT.Graphs; use GNAT.Graphs;
package body Bindo.Elaborators is
-- The following type defines the advancement of the elaboration order
-- algorithm in terms of steps.
type Elaboration_Order_Step is new Natural;
Initial_Step : constant Elaboration_Order_Step :=
Elaboration_Order_Step'First;
----------------------------------------------
-- Invocation_And_Library_Graph_Elaborators --
----------------------------------------------
package body Invocation_And_Library_Graph_Elaborators is
-----------------------
-- Local subprograms --
-----------------------
procedure Create_Component_Vertex_Sets
(G : Library_Graph;
Comp : Component_Id;
Elaborable_Vertices : out LGV_Sets.Membership_Set;
Waiting_Vertices : out LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step);
pragma Inline (Create_Component_Vertex_Sets);
-- Split all vertices of component Comp of library graph G as follows:
--
-- * Elaborable vertices are added to set Elaborable_Vertices.
--
-- * Vertices that are still waiting on their predecessors to be
-- elaborated are added to set Waiting_Vertices.
--
-- Step is the current step in the elaboration order.
procedure Create_Vertex_Sets
(G : Library_Graph;
Elaborable_Vertices : out LGV_Sets.Membership_Set;
Waiting_Vertices : out LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step);
pragma Inline (Create_Vertex_Sets);
-- Split all vertices of library graph G as follows:
--
-- * Elaborable vertices are added to set Elaborable_Vertices.
--
-- * Vertices that are still waiting on their predecessors to be
-- elaborated are added to set Waiting_Vertices.
--
-- Step is the current step in the elaboration order.
procedure Elaborate_Component
(G : Library_Graph;
Comp : Component_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Order : in out Unit_Id_Table;
Step : Elaboration_Order_Step);
pragma Inline (Elaborate_Component);
-- Elaborate as many vertices as possible that appear in component Comp
-- of library graph G. The sets contain vertices arranged as follows:
--
-- * All_Elaborable_Vertices - all elaborable vertices in the library
-- graph.
--
-- * All_Waiting_Vertices - all vertices in the library graph that are
-- waiting on predecessors to be elaborated.
--
-- Order is the elaboration order. Step denotes the current step in the
-- elaboration order.
procedure Elaborate_Library_Graph
(G : Library_Graph;
Order : out Unit_Id_Table;
Status : out Elaboration_Order_Status);
pragma Inline (Elaborate_Library_Graph);
-- Elaborate as many vertices as possible of library graph G. Order is
-- the elaboration order. Status is the condition of the elaboration
-- order.
procedure Elaborate_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Elaborable_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Order : in out Unit_Id_Table;
Step : Elaboration_Order_Step;
Indent : Indentation_Level);
pragma Inline (Elaborate_Vertex);
-- Elaborate vertex Vertex of library graph G by adding its unit to
-- elaboration order Order. The routine updates awaiting successors
-- where applicable. The sets contain vertices arranged as follows:
--
-- * All_Elaborable_Vertices - all elaborable vertices in the library
-- graph.
--
-- * All_Waiting_Vertices - all vertices in the library graph that are
-- waiting on predecessors to be elaborated.
--
-- * Comp_Elaborable_Vertices - all elaborable vertices found in the
-- component of Vertex.
--
-- * Comp_Waiting_Vertices - all vertices found in the component of
-- Vertex that are still waiting on predecessors to be elaborated.
--
-- Order denotes the elaboration order. Step is the current step in the
-- elaboration order. Indent denotes the desired indentation level for
-- tracing.
function Find_Best_Elaborable_Vertex
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level) return Library_Graph_Vertex_Id;
pragma Inline (Find_Best_Elaborable_Vertex);
-- Find the best vertex of library graph G from membership set S that
-- can be elaborated. Step is the current step in the elaboration order.
-- Indent is the desired indentation level for tracing.
function Find_Best_Vertex
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Is_Suitable_Vertex : LGV_Predicate_Ptr;
Compare_Vertices : LGV_Comparator_Ptr;
Initial_Best_Msg : String;
Subsequent_Best_Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
return Library_Graph_Vertex_Id;
pragma Inline (Find_Best_Vertex);
-- Find the best vertex of library graph G from membership set S which
-- satisfies predicate Is_Suitable_Vertex and is preferred by comparator
-- Compare_Vertices. Initial_Best_Msg is emitted on the first candidate
-- vertex. Subsequent_Best_Msg is emitted whenever a better vertex is
-- discovered. Step is the current step in the elaboration order. Indent
-- is the desired indentation level for tracing.
function Find_Best_Weakly_Elaborable_Vertex
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level) return Library_Graph_Vertex_Id;
pragma Inline (Find_Best_Weakly_Elaborable_Vertex);
-- Find the best vertex of library graph G from membership set S that
-- can be weakly elaborated. Step is the current step in the elaboration
-- order. Indent is the desired indentation level for tracing.
function Has_Elaborable_Body
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id) return Boolean;
pragma Inline (Has_Elaborable_Body);
-- Determine whether vertex Vertex of library graph G has a body that is
-- elaborable. It is assumed that the vertex has been elaborated.
procedure Insert_Elaborable_Successor
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level);
pragma Inline (Insert_Elaborable_Successor);
-- Add elaborable successor Vertex of library graph G to membership set
-- Elaborable_Vertices and remove it from both All_Waiting_Vertices and
-- Comp_Waiting_Vertices. Msg is a message emitted for tracing purposes.
-- Step is the current step in the elaboration order. Indent denotes the
-- desired indentation level for tracing.
procedure Insert_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Set : LGV_Sets.Membership_Set;
Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level);
pragma Inline (Insert_Vertex);
-- Add vertex Vertex of library graph G to membership set Set. Msg is
-- a message emitted for tracing purposes. Step is the current step in
-- the elaboration order. Indent is the desired indentation level for
-- tracing.
function Is_Better_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Compared_To : Library_Graph_Vertex_Id) return Precedence_Kind;
pragma Inline (Is_Better_Elaborable_Vertex);
-- Determine whether vertex Vertex of library graph G is a better choice
-- for elaboration compared to vertex Compared_To.
function Is_Better_Weakly_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Compared_To : Library_Graph_Vertex_Id) return Precedence_Kind;
pragma Inline (Is_Better_Weakly_Elaborable_Vertex);
-- Determine whether vertex Vertex of library graph G is a better choice
-- for weak elaboration compared to vertex Compared_To.
function Is_Suitable_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id) return Boolean;
pragma Inline (Is_Suitable_Elaborable_Vertex);
-- Determine whether vertex Vertex of library graph G is suitable for
-- elaboration.
function Is_Suitable_Weakly_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id) return Boolean;
pragma Inline (Is_Suitable_Weakly_Elaborable_Vertex);
-- Determine whether vertex Vertex of library graph G is suitable for
-- weak elaboration.
procedure Set_Unit_Elaboration_Positions (Order : Unit_Id_Table);
pragma Inline (Set_Unit_Elaboration_Positions);
-- Set the ALI.Units positions of all elaboration units in order Order
procedure Trace_Component
(G : Library_Graph;
Comp : Component_Id;
Msg : String;
Step : Elaboration_Order_Step);
pragma Inline (Trace_Component);
-- Write elaboration-related information for component Comp of library
-- graph G to standard output, starting with message Msg. Step is the
-- current step in the elaboration order.
procedure Trace_Step (Step : Elaboration_Order_Step);
pragma Inline (Trace_Step);
-- Write current step Step of the elaboration order to standard output
procedure Trace_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level);
pragma Inline (Trace_Vertex);
-- Write elaboration-related information for vertex Vertex of library
-- graph G to standard output, starting with message Msg. Step is the
-- current step in the elaboration order. Indent denotes the desired
-- indentation level for tracing.
procedure Trace_Vertices
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Set_Msg : String;
Vertex_Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level);
pragma Inline (Trace_Vertices);
-- Write the candidate vertices of library graph G present in membership
-- set Set to standard output, starting with message Set_Msg. Vertex_Msg
-- is the message emitted prior to each vertex. Step denotes the current
-- step in the elaboration order. Indent denotes the desired indentation
-- level for tracing.
procedure Update_Successor
(G : Library_Graph;
Edge : Library_Graph_Edge_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Elaborable_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level);
pragma Inline (Update_Successor);
-- Notify the successor of edge Edge of library graph G along with its
-- component that their predecessor has just been elaborated. This may
-- cause new vertices to become elaborable. The sets contain vertices
-- arranged as follows:
--
-- * All_Elaborable_Vertices - all elaborable vertices in the library
-- graph.
--
-- * All_Waiting_Vertices - all vertices in the library graph that are
-- waiting on predecessors to be elaborated.
--
-- * Comp_Elaborable_Vertices - all elaborable vertices found in the
-- component of Vertex.
--
-- * Comp_Waiting_Vertices - all vertices found in the component of
-- Vertex that are still waiting on predecessors to be elaborated.
--
-- Step is the current step in the elaboration order. Indent denotes the
-- desired indentation level for tracing.
procedure Update_Successors
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Elaborable_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level);
pragma Inline (Update_Successors);
-- Notify all successors of vertex Vertex of library graph G along with
-- their components that their predecessor has just been elaborated.
-- This may cause new vertices to become elaborable. The sets contain
-- vertices arranged as follows:
--
-- * All_Elaborable_Vertices - all elaborable vertices in the library
-- graph.
--
-- * All_Waiting_Vertices - all vertices in the library graph that are
-- waiting on predecessors to be elaborated.
--
-- * Comp_Elaborable_Vertices - all elaborable vertices found in the
-- component of Vertex.
--
-- * Comp_Waiting_Vertices - all vertices found in the component of
-- Vertex that are still waiting on predecessors to be elaborated.
--
-- Step is the current step in the elaboration order. Indent denotes the
-- desired indentation level for tracing.
----------------------------------
-- Create_Component_Vertex_Sets --
----------------------------------
procedure Create_Component_Vertex_Sets
(G : Library_Graph;
Comp : Component_Id;
Elaborable_Vertices : out LGV_Sets.Membership_Set;
Waiting_Vertices : out LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step)
is
pragma Assert (Present (G));
pragma Assert (Present (Comp));
Num_Of_Vertices : constant Natural :=
Number_Of_Component_Vertices (G, Comp);
Iter : Component_Vertex_Iterator;
Vertex : Library_Graph_Vertex_Id;
begin
Elaborable_Vertices := LGV_Sets.Create (Num_Of_Vertices);
Waiting_Vertices := LGV_Sets.Create (Num_Of_Vertices);
Iter := Iterate_Component_Vertices (G, Comp);
while Has_Next (Iter) loop
Next (Iter, Vertex);
-- Add the vertex to the proper set depending on whether it can be
-- elaborated.
if Is_Elaborable_Vertex (G, Vertex) then
Insert_Vertex
(G => G,
Vertex => Vertex,
Set => Elaborable_Vertices,
Msg => "add elaborable component vertex",
Step => Step,
Indent => No_Indentation);
else
Insert_Vertex
(G => G,
Vertex => Vertex,
Set => Waiting_Vertices,
Msg => "add waiting component vertex",
Step => Step,
Indent => No_Indentation);
end if;
end loop;
end Create_Component_Vertex_Sets;
------------------------
-- Create_Vertex_Sets --
------------------------
procedure Create_Vertex_Sets
(G : Library_Graph;
Elaborable_Vertices : out LGV_Sets.Membership_Set;
Waiting_Vertices : out LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step)
is
pragma Assert (Present (G));
Num_Of_Vertices : constant Natural := Number_Of_Vertices (G);
Iter : Library_Graphs.All_Vertex_Iterator;
Vertex : Library_Graph_Vertex_Id;
begin
Elaborable_Vertices := LGV_Sets.Create (Num_Of_Vertices);
Waiting_Vertices := LGV_Sets.Create (Num_Of_Vertices);
Iter := Iterate_All_Vertices (G);
while Has_Next (Iter) loop
Next (Iter, Vertex);
-- Add the vertex to the proper set depending on whether it can be
-- elaborated.
if Is_Elaborable_Vertex (G, Vertex) then
Insert_Vertex
(G => G,
Vertex => Vertex,
Set => Elaborable_Vertices,
Msg => "add elaborable vertex",
Step => Step,
Indent => No_Indentation);
else
Insert_Vertex
(G => G,
Vertex => Vertex,
Set => Waiting_Vertices,
Msg => "add waiting vertex",
Step => Step,
Indent => No_Indentation);
end if;
end loop;
end Create_Vertex_Sets;
-------------------------
-- Elaborate_Component --
-------------------------
procedure Elaborate_Component
(G : Library_Graph;
Comp : Component_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Order : in out Unit_Id_Table;
Step : Elaboration_Order_Step)
is
Comp_Elaborable_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Vertex : Library_Graph_Vertex_Id;
begin
pragma Assert (Present (G));
pragma Assert (Present (Comp));
pragma Assert (LGV_Sets.Present (All_Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (All_Waiting_Vertices));
Trace_Component
(G => G,
Comp => Comp,
Msg => "elaborating component",
Step => Step);
-- Divide all vertices of the component into an elaborable and
-- waiting vertex set.
Create_Component_Vertex_Sets
(G => G,
Comp => Comp,
Elaborable_Vertices => Comp_Elaborable_Vertices,
Waiting_Vertices => Comp_Waiting_Vertices,
Step => Step);
loop
Trace_Vertices
(G => G,
Set => Comp_Elaborable_Vertices,
Set_Msg => "elaborable component vertices",
Vertex_Msg => "elaborable component vertex",
Step => Step,
Indent => Nested_Indentation);
Trace_Vertices
(G => G,
Set => Comp_Waiting_Vertices,
Set_Msg => "waiting component vertices",
Vertex_Msg => "waiting component vertex",
Step => Step,
Indent => Nested_Indentation);
Vertex :=
Find_Best_Elaborable_Vertex
(G => G,
Set => Comp_Elaborable_Vertices,
Step => Step,
Indent => Nested_Indentation);
-- The component lacks an elaborable vertex. This indicates that
-- either all vertices of the component have been elaborated or
-- the graph has a circularity. Locate the best weak vertex that
-- was compiled with the dynamic model to elaborate from the set
-- waiting vertices. This action assumes that certain invocations
-- will not take place at elaboration time. An order produced in
-- this fashion may fail an ABE check at run time.
if not Present (Vertex) then
Vertex :=
Find_Best_Weakly_Elaborable_Vertex
(G => G,
Set => Comp_Waiting_Vertices,
Step => Step,
Indent => Nested_Indentation);
end if;
-- Stop the elaboration when either all vertices of the component
-- have been elaborated, or the graph contains a circularity.
exit when not Present (Vertex);
-- Try to elaborate as many vertices within the component as
-- possible. Each successful elaboration signals the appropriate
-- successors and components that they have one less predecessor
-- to wait on.
Elaborate_Vertex
(G => G,
Vertex => Vertex,
All_Elaborable_Vertices => All_Elaborable_Vertices,
All_Waiting_Vertices => All_Waiting_Vertices,
Comp_Elaborable_Vertices => Comp_Elaborable_Vertices,
Comp_Waiting_Vertices => Comp_Waiting_Vertices,
Order => Order,
Step => Step,
Indent => Nested_Indentation);
end loop;
LGV_Sets.Destroy (Comp_Elaborable_Vertices);
LGV_Sets.Destroy (Comp_Waiting_Vertices);
end Elaborate_Component;
-----------------------------
-- Elaborate_Library_Graph --
-----------------------------
procedure Elaborate_Library_Graph
(G : Library_Graph;
Order : out Unit_Id_Table;
Status : out Elaboration_Order_Status)
is
Elaborable_Vertices : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Vertex : Library_Graph_Vertex_Id;
Waiting_Vertices : LGV_Sets.Membership_Set;
begin
pragma Assert (Present (G));
Step := Initial_Step;
-- Divide all vertices of the library graph into an elaborable and
-- waiting vertex set.
Create_Vertex_Sets
(G => G,
Elaborable_Vertices => Elaborable_Vertices,
Waiting_Vertices => Waiting_Vertices,
Step => Step);
loop
Step := Step + 1;
Trace_Vertices
(G => G,
Set => Elaborable_Vertices,
Set_Msg => "elaborable vertices",
Vertex_Msg => "elaborable vertex",
Step => Step,
Indent => No_Indentation);
Trace_Vertices
(G => G,
Set => Waiting_Vertices,
Set_Msg => "waiting vertices",
Vertex_Msg => "waiting vertex",
Step => Step,
Indent => No_Indentation);
Vertex :=
Find_Best_Elaborable_Vertex
(G => G,
Set => Elaborable_Vertices,
Step => Step,
Indent => No_Indentation);
-- The graph lacks an elaborable vertex. This indicates that
-- either all vertices have been elaborated or the graph has a
-- circularity. Find the best weak vertex that was compiled with
-- the dynamic model to elaborate from set of waiting vertices.
-- This action assumes that certain invocations will not take
-- place at elaboration time. An order produced in this fashion
-- may fail an ABE check at run time.
if not Present (Vertex) then
Vertex :=
Find_Best_Weakly_Elaborable_Vertex
(G => G,
Set => Waiting_Vertices,
Step => Step,
Indent => No_Indentation);
end if;
-- Stop the elaboration when either all vertices of the graph have
-- been elaborated, or the graph contains a circularity.
exit when not Present (Vertex);
-- Elaborate the component of the vertex by trying to elaborate as
-- many vertices within the component as possible. Each successful
-- elaboration signals the appropriate successors and components
-- that they have one less predecessor to wait on.
Elaborate_Component
(G => G,
Comp => Component (G, Vertex),
All_Elaborable_Vertices => Elaborable_Vertices,
All_Waiting_Vertices => Waiting_Vertices,
Order => Order,
Step => Step);
end loop;
-- The graph contains an Elaborate_All circularity when at least one
-- edge subject to the related pragma appears in a component.
if Has_Elaborate_All_Cycle (G) then
Status := Order_Has_Elaborate_All_Circularity;
-- The graph contains a circularity when at least one vertex failed
-- to elaborate.
elsif LGV_Sets.Size (Waiting_Vertices) /= 0 then
Status := Order_Has_Circularity;
-- Otherwise the elaboration order is satisfactory
else
Status := Order_OK;
end if;
LGV_Sets.Destroy (Elaborable_Vertices);
LGV_Sets.Destroy (Waiting_Vertices);
end Elaborate_Library_Graph;
---------------------
-- Elaborate_Units --
---------------------
procedure Elaborate_Units
(Order : out Unit_Id_Table;
Main_Lib_File : File_Name_Type)
is
pragma Unreferenced (Main_Lib_File);
Inv_Graph : Invocation_Graph;
Lib_Graph : Library_Graph;
Status : Elaboration_Order_Status;
begin
Start_Phase (Unit_Elaboration);
-- Initialize all unit-related data structures and gather all units
-- that need elaboration.
Initialize_Units;
Collect_Elaborable_Units;
-- Create the library graph that captures the dependencies between
-- library items.
Lib_Graph := Build_Library_Graph;
-- Create the invocation graph that represents the flow of execution
Inv_Graph := Build_Invocation_Graph (Lib_Graph);
-- Traverse the invocation graph starting from elaboration code in
-- order to discover transitions of the execution flow from a unit
-- to a unit that result in extra edges within the library graph.
Augment_Library_Graph (Inv_Graph);
-- Create the component graph by collapsing all library items into
-- library units and traversing the library graph.
Find_Components (Lib_Graph);
-- Output the contents of the ALI tables and both graphs to standard
-- output now that they have been fully decorated.
Write_ALI_Tables;
Write_Invocation_Graph (Inv_Graph);
Write_Library_Graph (Lib_Graph);
-- Traverse the library graph to determine the elaboration order of
-- units.
Elaborate_Library_Graph (Lib_Graph, Order, Status);
-- The elaboration order is satisfactory
if Status = Order_OK then
Validate_Elaboration_Order (Order);
-- Set attribute Elab_Position of table ALI.Units for all units in
-- the elaboration order.
Set_Unit_Elaboration_Positions (Order);
-- Output the dependencies among units when switch -e (output
-- complete list of elaboration order dependencies) is active.
Write_Dependencies (Lib_Graph);
-- Output the elaboration order when switch -l (output chosen
-- elaboration order) is in effect.
Write_Elaboration_Order (Order);
-- Output the sources referenced in the closure of the order when
-- switch -R (list sources referenced in closure) is in effect.
Write_Unit_Closure (Order);
-- Otherwise the library graph contains at least one circularity
else
Diagnose_Circularities (Inv_Graph);
end if;
Destroy (Inv_Graph);
Destroy (Lib_Graph);
-- Destroy all unit-related data structures
Finalize_Units;
End_Phase (Unit_Elaboration);
-- Halt the bind when there is no satisfactory elaboration order
if Status /= Order_OK then
raise Unrecoverable_Error;
end if;
end Elaborate_Units;
----------------------
-- Elaborate_Vertex --
----------------------
procedure Elaborate_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Elaborable_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Order : in out Unit_Id_Table;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
is
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
pragma Assert (Needs_Elaboration (G, Vertex));
pragma Assert (LGV_Sets.Present (All_Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (All_Waiting_Vertices));
pragma Assert (LGV_Sets.Present (Comp_Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (Comp_Waiting_Vertices));
Trace_Vertex
(G => G,
Vertex => Vertex,
Msg => "elaborating vertex",
Step => Step,
Indent => Indent);
-- Remove the vertex from both elaborable sets. This is needed when
-- the vertex is both an overall best candidate among all vertices,
-- and the best candidate within the component.
LGV_Sets.Delete (All_Elaborable_Vertices, Vertex);
LGV_Sets.Delete (Comp_Elaborable_Vertices, Vertex);
-- Remove the vertex from both waiting sets. This is needed when a
-- weakly elaborable vertex is both an overall best candidate among
-- all waiting vertices and the best waiting candidate within the
-- component.
LGV_Sets.Delete (All_Waiting_Vertices, Vertex);
LGV_Sets.Delete (Comp_Waiting_Vertices, Vertex);
-- Mark the vertex as elaborated in order to prevent further attempts
-- to re-elaborate it.
Set_In_Elaboration_Order (G, Vertex);
-- Add the unit represented by the vertex to the elaboration order
Unit_Id_Tables.Append (Order, Unit (G, Vertex));
-- Notify all successors and their components that they have one
-- fewer predecessor to wait on. This may cause some successors to
-- be included in one of the sets.
Update_Successors
(G => G,
Vertex => Vertex,
All_Elaborable_Vertices => All_Elaborable_Vertices,
All_Waiting_Vertices => All_Waiting_Vertices,
Comp_Elaborable_Vertices => Comp_Elaborable_Vertices,
Comp_Waiting_Vertices => Comp_Waiting_Vertices,
Step => Step,
Indent => Indent + Nested_Indentation);
-- Elaborate an eligible completing body immediately after its spec.
-- This action satisfies the semantics of pragma Elaborate_Body. In
-- addition, it ensures that a body will not "drift" too far from its
-- spec in case invocation edges are removed from the library graph.
if Has_Elaborable_Body (G, Vertex) then
Elaborate_Vertex
(G => G,
Vertex => Proper_Body (G, Vertex),
All_Elaborable_Vertices => All_Elaborable_Vertices,
All_Waiting_Vertices => All_Waiting_Vertices,
Comp_Elaborable_Vertices => Comp_Elaborable_Vertices,
Comp_Waiting_Vertices => Comp_Waiting_Vertices,
Order => Order,
Step => Step,
Indent => Indent);
end if;
end Elaborate_Vertex;
---------------------------------
-- Find_Best_Elaborable_Vertex --
---------------------------------
function Find_Best_Elaborable_Vertex
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level) return Library_Graph_Vertex_Id
is
begin
pragma Assert (Present (G));
pragma Assert (LGV_Sets.Present (Set));
return
Find_Best_Vertex
(G => G,
Set => Set,
Is_Suitable_Vertex =>
Is_Suitable_Elaborable_Vertex'Access,
Compare_Vertices =>
Is_Better_Elaborable_Vertex'Access,
Initial_Best_Msg => "initial best elaborable vertex",
Subsequent_Best_Msg => "better elaborable vertex",
Step => Step,
Indent => Indent);
end Find_Best_Elaborable_Vertex;
----------------------
-- Find_Best_Vertex --
----------------------
function Find_Best_Vertex
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Is_Suitable_Vertex : LGV_Predicate_Ptr;
Compare_Vertices : LGV_Comparator_Ptr;
Initial_Best_Msg : String;
Subsequent_Best_Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
return Library_Graph_Vertex_Id
is
Best_Vertex : Library_Graph_Vertex_Id;
Current_Vertex : Library_Graph_Vertex_Id;
Iter : LGV_Sets.Iterator;
begin
pragma Assert (Present (G));
pragma Assert (LGV_Sets.Present (Set));
pragma Assert (Is_Suitable_Vertex /= null);
pragma Assert (Compare_Vertices /= null);
-- Assume that there is no candidate
Best_Vertex := No_Library_Graph_Vertex;
-- Inspect all vertices in the set, looking for the best candidate
-- according to the comparator.
Iter := LGV_Sets.Iterate (Set);
while LGV_Sets.Has_Next (Iter) loop
LGV_Sets.Next (Iter, Current_Vertex);
pragma Assert (Needs_Elaboration (G, Current_Vertex));
if Is_Suitable_Vertex.all (G, Current_Vertex) then
-- A previous iteration already picked the best candidate.
-- Update the best candidate when the current vertex is a
-- better choice.
if Present (Best_Vertex) then
if Compare_Vertices.all
(G => G,
Vertex => Current_Vertex,
Compared_To => Best_Vertex) = Higher_Precedence
then
Best_Vertex := Current_Vertex;
Trace_Vertex
(G => G,
Vertex => Best_Vertex,
Msg => Subsequent_Best_Msg,
Step => Step,
Indent => Indent);
end if;
-- Otherwise this is the first candidate
else
Best_Vertex := Current_Vertex;
Trace_Vertex
(G => G,
Vertex => Best_Vertex,
Msg => Initial_Best_Msg,
Step => Step,
Indent => Indent);
end if;
end if;
end loop;
return Best_Vertex;
end Find_Best_Vertex;
----------------------------------------
-- Find_Best_Weakly_Elaborable_Vertex --
----------------------------------------
function Find_Best_Weakly_Elaborable_Vertex
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level) return Library_Graph_Vertex_Id
is
begin
pragma Assert (Present (G));
pragma Assert (LGV_Sets.Present (Set));
return
Find_Best_Vertex
(G => G,
Set => Set,
Is_Suitable_Vertex =>
Is_Suitable_Weakly_Elaborable_Vertex'Access,
Compare_Vertices =>
Is_Better_Weakly_Elaborable_Vertex'Access,
Initial_Best_Msg => "initial best weakly elaborable vertex",
Subsequent_Best_Msg => "better weakly elaborable vertex",
Step => Step,
Indent => Indent);
end Find_Best_Weakly_Elaborable_Vertex;
-------------------------
-- Has_Elaborable_Body --
-------------------------
function Has_Elaborable_Body
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id) return Boolean
is
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
-- The body of an already-elaborated spec subject to Elaborate_Body
-- is always elaborable.
if Is_Spec_With_Elaborate_Body (G, Vertex) then
return True;
elsif Is_Spec_With_Body (G, Vertex) then
return Is_Elaborable_Vertex (G, Proper_Body (G, Vertex));
end if;
return False;
end Has_Elaborable_Body;
---------------------------------
-- Insert_Elaborable_Successor --
---------------------------------
procedure Insert_Elaborable_Successor
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
is
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
pragma Assert (LGV_Sets.Present (Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (All_Waiting_Vertices));
pragma Assert (LGV_Sets.Present (Comp_Waiting_Vertices));
Complement : constant Library_Graph_Vertex_Id :=
Complementary_Vertex
(G => G,
Vertex => Vertex,
Force_Complement => False);
begin
-- Remove the successor from both waiting vertex sets because it may
-- be the best vertex to elaborate across the whole graph and within
-- its component.
LGV_Sets.Delete (All_Waiting_Vertices, Vertex);
LGV_Sets.Delete (Comp_Waiting_Vertices, Vertex);
Insert_Vertex
(G => G,
Vertex => Vertex,
Set => Elaborable_Vertices,
Msg => Msg,
Step => Step,
Indent => Indent);
if Present (Complement) then
-- Remove the complement of the successor from both waiting vertex
-- sets because it may be the best vertex to elaborate across the
-- whole graph and within its component.
LGV_Sets.Delete (All_Waiting_Vertices, Complement);
LGV_Sets.Delete (Comp_Waiting_Vertices, Complement);
Insert_Vertex
(G => G,
Vertex => Complement,
Set => Elaborable_Vertices,
Msg => Msg,
Step => Step,
Indent => Indent);
end if;
end Insert_Elaborable_Successor;
-------------------
-- Insert_Vertex --
-------------------
procedure Insert_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Set : LGV_Sets.Membership_Set;
Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
is
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
pragma Assert (Needs_Elaboration (G, Vertex));
pragma Assert (LGV_Sets.Present (Set));
-- Nothing to do when the vertex is already present in the set
if LGV_Sets.Contains (Set, Vertex) then
return;
end if;
Trace_Vertex
(G => G,
Vertex => Vertex,
Msg => Msg,
Step => Step,
Indent => Indent);
-- Add the vertex to the set
LGV_Sets.Insert (Set, Vertex);
end Insert_Vertex;
---------------------------------
-- Is_Better_Elaborable_Vertex --
---------------------------------
function Is_Better_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Compared_To : Library_Graph_Vertex_Id) return Precedence_Kind
is
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
pragma Assert (Present (Compared_To));
-- Prefer a spec with Elaborate_Body over its corresponding body
if Is_Elaborate_Body_Pair
(G => G,
Spec_Vertex => Vertex,
Body_Vertex => Compared_To)
then
return Higher_Precedence;
elsif Is_Elaborate_Body_Pair
(G => G,
Spec_Vertex => Compared_To,
Body_Vertex => Vertex)
then
return Lower_Precedence;
-- Prefer a predefined unit over a non-predefined unit
elsif Is_Predefined_Unit (G, Vertex)
and then not Is_Predefined_Unit (G, Compared_To)
then
return Higher_Precedence;
elsif not Is_Predefined_Unit (G, Vertex)
and then Is_Predefined_Unit (G, Compared_To)
then
return Lower_Precedence;
-- Prefer an internal unit over a non-internal unit
elsif Is_Internal_Unit (G, Vertex)
and then not Is_Internal_Unit (G, Compared_To)
then
return Higher_Precedence;
elsif not Is_Internal_Unit (G, Vertex)
and then Is_Internal_Unit (G, Compared_To)
then
return Lower_Precedence;
-- Prefer a preelaborated unit over a non-preelaborated unit
elsif Is_Preelaborated_Unit (G, Vertex)
and then not Is_Preelaborated_Unit (G, Compared_To)
then
return Higher_Precedence;
elsif not Is_Preelaborated_Unit (G, Vertex)
and then Is_Preelaborated_Unit (G, Compared_To)
then
return Lower_Precedence;
-- Otherwise default to lexicographical order to ensure deterministic
-- behavior.
elsif Uname_Less (Name (G, Vertex), Name (G, Compared_To)) then
return Higher_Precedence;
else
return Lower_Precedence;
end if;
end Is_Better_Elaborable_Vertex;
----------------------------------------
-- Is_Better_Weakly_Elaborable_Vertex --
----------------------------------------
function Is_Better_Weakly_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Compared_To : Library_Graph_Vertex_Id) return Precedence_Kind
is
Comp_Strong_Preds : Natural;
Comp_Weak_Preds : Natural;
Vertex_Strong_Preds : Natural;
Vertex_Weak_Preds : Natural;
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
pragma Assert (Present (Compared_To));
-- Obtain the number of pending predecessors for both candidates,
-- taking into account Elaborate_Body pairs.
Pending_Predecessors_For_Elaboration
(G => G,
Vertex => Vertex,
Strong_Preds => Vertex_Strong_Preds,
Weak_Preds => Vertex_Weak_Preds);
Pending_Predecessors_For_Elaboration
(G => G,
Vertex => Compared_To,
Strong_Preds => Comp_Strong_Preds,
Weak_Preds => Comp_Weak_Preds);
-- Neither candidate should be waiting on strong predecessors,
-- otherwise the candidate cannot be weakly elaborated.
pragma Assert (Vertex_Strong_Preds = 0);
pragma Assert (Comp_Strong_Preds = 0);
-- Prefer a unit with fewer weak predecessors over a unit with more
-- weak predecessors.
if Vertex_Weak_Preds < Comp_Weak_Preds then
return Higher_Precedence;
elsif Vertex_Weak_Preds > Comp_Weak_Preds then
return Lower_Precedence;
-- Otherwise default to lexicographical order to ensure deterministic
-- behavior.
elsif Uname_Less (Name (G, Vertex), Name (G, Compared_To)) then
return Higher_Precedence;
else
return Lower_Precedence;
end if;
end Is_Better_Weakly_Elaborable_Vertex;
-----------------------------------
-- Is_Suitable_Elaborable_Vertex --
-----------------------------------
function Is_Suitable_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id) return Boolean
is
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
-- A vertex is suitable for elaboration as long it is not waiting on
-- any predecessors, ignoring the static or dynamic model.
return Is_Elaborable_Vertex (G, Vertex);
end Is_Suitable_Elaborable_Vertex;
------------------------------------------
-- Is_Suitable_Weakly_Elaborable_Vertex --
------------------------------------------
function Is_Suitable_Weakly_Elaborable_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id) return Boolean
is
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
-- A vertex is suitable for weak elaboration when it is waiting on
-- weak predecessors only, and the unit it represents was compiled
-- using the dynamic model.
return
Is_Dynamically_Elaborated (G, Vertex)
and then Is_Weakly_Elaborable_Vertex (G, Vertex);
end Is_Suitable_Weakly_Elaborable_Vertex;
------------------------------------
-- Set_Unit_Elaboration_Positions --
------------------------------------
procedure Set_Unit_Elaboration_Positions (Order : Unit_Id_Table) is
U_Id : Unit_Id;
begin
for Position in Unit_Id_Tables.First ..
Unit_Id_Tables.Last (Order)
loop
U_Id := Order.Table (Position);
ALI.Units.Table (U_Id).Elab_Position := Position;
end loop;
end Set_Unit_Elaboration_Positions;
---------------------
-- Trace_Component --
---------------------
procedure Trace_Component
(G : Library_Graph;
Comp : Component_Id;
Msg : String;
Step : Elaboration_Order_Step)
is
begin
pragma Assert (Present (G));
pragma Assert (Present (Comp));
-- Nothing to do when switch -d_T (output elaboration order and cycle
-- detection trace information) is not in effect.
if not Debug_Flag_Underscore_TT then
return;
end if;
Trace_Step (Step);
Write_Str (Msg);
Write_Str (" (Comp_Id_");
Write_Int (Int (Comp));
Write_Str (")");
Write_Eol;
Trace_Step (Step);
Indent_By (Nested_Indentation);
Write_Str ("pending strong predecessors: ");
Write_Num (Int (Pending_Strong_Predecessors (G, Comp)));
Write_Eol;
Trace_Step (Step);
Indent_By (Nested_Indentation);
Write_Str ("pending weak predecessors : ");
Write_Num (Int (Pending_Weak_Predecessors (G, Comp)));
Write_Eol;
end Trace_Component;
----------------
-- Trace_Step --
----------------
procedure Trace_Step (Step : Elaboration_Order_Step) is
begin
-- Nothing to do when switch -d_T (output elaboration order and cycle
-- detection trace information) is not in effect.
if not Debug_Flag_Underscore_TT then
return;
end if;
Write_Num
(Val => Int (Step),
Val_Indent => Step_Column);
Write_Str (": ");
end Trace_Step;
------------------
-- Trace_Vertex --
------------------
procedure Trace_Vertex
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
is
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
Attr_Indent : constant Indentation_Level :=
Indent + Nested_Indentation;
Comp : constant Component_Id := Component (G, Vertex);
begin
-- Nothing to do when switch -d_T (output elaboration order and cycle
-- detection trace information) is not in effect.
if not Debug_Flag_Underscore_TT then
return;
end if;
Trace_Step (Step);
Indent_By (Indent);
Write_Str (Msg);
Write_Str (" (LGV_Id_");
Write_Int (Int (Vertex));
Write_Str (")");
Write_Eol;
Trace_Step (Step);
Indent_By (Attr_Indent);
Write_Str ("name = ");
Write_Name (Name (G, Vertex));
Write_Eol;
Trace_Step (Step);
Indent_By (Attr_Indent);
Write_Str ("Component (Comp_Id_");
Write_Int (Int (Comp));
Write_Str (")");
Write_Eol;
Trace_Step (Step);
Indent_By (Attr_Indent);
Write_Str ("pending strong predecessors: ");
Write_Num (Int (Pending_Strong_Predecessors (G, Vertex)));
Write_Eol;
Trace_Step (Step);
Indent_By (Attr_Indent);
Write_Str ("pending weak predecessors : ");
Write_Num (Int (Pending_Weak_Predecessors (G, Vertex)));
Write_Eol;
Trace_Step (Step);
Indent_By (Attr_Indent);
Write_Str ("pending strong components : ");
Write_Num (Int (Pending_Strong_Predecessors (G, Comp)));
Write_Eol;
Trace_Step (Step);
Indent_By (Attr_Indent);
Write_Str ("pending weak components : ");
Write_Num (Int (Pending_Weak_Predecessors (G, Comp)));
Write_Eol;
end Trace_Vertex;
--------------------
-- Trace_Vertices --
--------------------
procedure Trace_Vertices
(G : Library_Graph;
Set : LGV_Sets.Membership_Set;
Set_Msg : String;
Vertex_Msg : String;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
is
Vertex_Indent : constant Indentation_Level :=
Indent + Nested_Indentation;
Iter : LGV_Sets.Iterator;
Vertex : Library_Graph_Vertex_Id;
begin
pragma Assert (Present (G));
pragma Assert (LGV_Sets.Present (Set));
-- Nothing to do when switch -d_T (output elaboration order and cycle
-- detection trace information) is not in effect.
if not Debug_Flag_Underscore_TT then
return;
end if;
Trace_Step (Step);
Indent_By (Indent);
Write_Str (Set_Msg);
Write_Str (": ");
Write_Int (Int (LGV_Sets.Size (Set)));
Write_Eol;
Iter := LGV_Sets.Iterate (Set);
while LGV_Sets.Has_Next (Iter) loop
LGV_Sets.Next (Iter, Vertex);
Trace_Vertex
(G => G,
Vertex => Vertex,
Msg => Vertex_Msg,
Step => Step,
Indent => Vertex_Indent);
end loop;
end Trace_Vertices;
----------------------
-- Update_Successor --
----------------------
procedure Update_Successor
(G : Library_Graph;
Edge : Library_Graph_Edge_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Elaborable_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
is
pragma Assert (Present (G));
pragma Assert (Present (Edge));
pragma Assert (LGV_Sets.Present (All_Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (All_Waiting_Vertices));
pragma Assert (LGV_Sets.Present (Comp_Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (Comp_Waiting_Vertices));
Pred : constant Library_Graph_Vertex_Id := Predecessor (G, Edge);
Succ : constant Library_Graph_Vertex_Id := Successor (G, Edge);
pragma Assert (Needs_Elaboration (G, Pred));
pragma Assert (Needs_Elaboration (G, Succ));
In_Different_Components : constant Boolean :=
not In_Same_Component
(G => G,
Left => Pred,
Right => Succ);
Succ_Comp : constant Component_Id := Component (G, Succ);
Vertex_Indent : constant Indentation_Level :=
Indent + Nested_Indentation;
Iter : Component_Vertex_Iterator;
Vertex : Library_Graph_Vertex_Id;
begin
Trace_Vertex
(G => G,
Vertex => Succ,
Msg => "updating successor",
Step => Step,
Indent => Indent);
-- Notify the successor that it has one less predecessor to wait on.
-- This effectively eliminates the edge that links the two.
Decrement_Pending_Predecessors
(G => G,
Vertex => Succ,
Edge => Edge);
-- The predecessor and successor reside in different components.
-- Notify the successor component it has one fewer components to
-- wait on.
if In_Different_Components then
Decrement_Pending_Predecessors
(G => G,
Comp => Succ_Comp,
Edge => Edge);
end if;
-- At this point the successor may become elaborable when its final
-- predecessor or final predecessor component has been elaborated.
if Is_Elaborable_Vertex (G, Succ) then
-- The predecessor and successor reside in different components.
-- The successor must not be added to the candidates of Pred's
-- component because this will mix units from the two components.
-- Instead, the successor is added to the set of all elaborable
-- vertices.
if In_Different_Components then
Insert_Elaborable_Successor
(G => G,
Vertex => Succ,
Elaborable_Vertices => All_Elaborable_Vertices,
All_Waiting_Vertices => All_Waiting_Vertices,
Comp_Waiting_Vertices => Comp_Waiting_Vertices,
Msg => "add elaborable successor",
Step => Step,
Indent => Vertex_Indent);
-- Otherwise the predecessor and successor reside within the same
-- component. Pred's component gains another elaborable vertex.
else
Insert_Elaborable_Successor
(G => G,
Vertex => Succ,
Elaborable_Vertices => Comp_Elaborable_Vertices,
All_Waiting_Vertices => All_Waiting_Vertices,
Comp_Waiting_Vertices => Comp_Waiting_Vertices,
Msg =>
"add elaborable component successor",
Step => Step,
Indent => Vertex_Indent);
end if;
end if;
-- At this point the successor component may become elaborable when
-- its final predecessor component is elaborated. This in turn may
-- allow vertices of the successor component to be elaborated.
if In_Different_Components
and then Is_Elaborable_Component (G, Succ_Comp)
then
Iter := Iterate_Component_Vertices (G, Succ_Comp);
while Has_Next (Iter) loop
Next (Iter, Vertex);
if Is_Elaborable_Vertex (G, Vertex) then
Insert_Elaborable_Successor
(G => G,
Vertex => Vertex,
Elaborable_Vertices => All_Elaborable_Vertices,
All_Waiting_Vertices => All_Waiting_Vertices,
Comp_Waiting_Vertices => Comp_Waiting_Vertices,
Msg => "add elaborable vertex",
Step => Step,
Indent => Vertex_Indent);
end if;
end loop;
end if;
end Update_Successor;
-----------------------
-- Update_Successors --
-----------------------
procedure Update_Successors
(G : Library_Graph;
Vertex : Library_Graph_Vertex_Id;
All_Elaborable_Vertices : LGV_Sets.Membership_Set;
All_Waiting_Vertices : LGV_Sets.Membership_Set;
Comp_Elaborable_Vertices : LGV_Sets.Membership_Set;
Comp_Waiting_Vertices : LGV_Sets.Membership_Set;
Step : Elaboration_Order_Step;
Indent : Indentation_Level)
is
Edge : Library_Graph_Edge_Id;
Iter : Edges_To_Successors_Iterator;
begin
pragma Assert (Present (G));
pragma Assert (Present (Vertex));
pragma Assert (Needs_Elaboration (G, Vertex));
pragma Assert (LGV_Sets.Present (All_Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (All_Waiting_Vertices));
pragma Assert (LGV_Sets.Present (Comp_Elaborable_Vertices));
pragma Assert (LGV_Sets.Present (Comp_Waiting_Vertices));
Iter := Iterate_Edges_To_Successors (G, Vertex);
while Has_Next (Iter) loop
Next (Iter, Edge);
pragma Assert (Predecessor (G, Edge) = Vertex);
Update_Successor
(G => G,
Edge => Edge,
All_Elaborable_Vertices => All_Elaborable_Vertices,
All_Waiting_Vertices => All_Waiting_Vertices,
Comp_Elaborable_Vertices => Comp_Elaborable_Vertices,
Comp_Waiting_Vertices => Comp_Waiting_Vertices,
Step => Step,
Indent => Indent);
end loop;
end Update_Successors;
end Invocation_And_Library_Graph_Elaborators;
end Bindo.Elaborators;
|
actions/Start Screensaver.applescript | chrisiona/OSX-Actions | 1 | 2913 | <filename>actions/Start Screensaver.applescript
tell application "ScreenSaverEngine"
activate
end tell |
workwork.applescript | mkrogh/9to5 | 1 | 1724 | <reponame>mkrogh/9to5<filename>workwork.applescript
set workFile to (path to me as text) & "::workapps.txt"
set nonWorkFile to (path to me as text) & "::nonworkapps.txt"
set workApps to paragraphs of (read file workFile)
set nonWorkApps to paragraphs of (read file nonWorkFile)
repeat with leisure_app in nonWorkApps
try
if application is running then
tell application leisure_app to quit
end if
end try
end repeat
repeat with work_app in workApps
if application work_app is not running then
tell application work_app to activate
end if
end repeat
|
source/nodes/program-nodes-for_loop_statements.adb | optikos/oasis | 0 | 19362 | -- Copyright (c) 2019 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.For_Loop_Statements is
function Create
(Statement_Identifier : Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Colon_Token : Program.Lexical_Elements
.Lexical_Element_Access;
For_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Loop_Parameter : Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access;
Generalized_Iterator : Program.Elements
.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access;
Element_Iterator : Program.Elements
.Element_Iterator_Specifications
.Element_Iterator_Specification_Access;
Loop_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Loop_Token_2 : not null Program.Lexical_Elements
.Lexical_Element_Access;
End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return For_Loop_Statement is
begin
return Result : For_Loop_Statement :=
(Statement_Identifier => Statement_Identifier,
Colon_Token => Colon_Token, For_Token => For_Token,
Loop_Parameter => Loop_Parameter,
Generalized_Iterator => Generalized_Iterator,
Element_Iterator => Element_Iterator, Loop_Token => Loop_Token,
Statements => Statements, End_Token => End_Token,
Loop_Token_2 => Loop_Token_2,
End_Statement_Identifier => End_Statement_Identifier,
Semicolon_Token => Semicolon_Token, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Statement_Identifier : Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Loop_Parameter : Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access;
Generalized_Iterator : Program.Elements
.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access;
Element_Iterator : Program.Elements
.Element_Iterator_Specifications
.Element_Iterator_Specification_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_For_Loop_Statement is
begin
return Result : Implicit_For_Loop_Statement :=
(Statement_Identifier => Statement_Identifier,
Loop_Parameter => Loop_Parameter,
Generalized_Iterator => Generalized_Iterator,
Element_Iterator => Element_Iterator, Statements => Statements,
End_Statement_Identifier => End_Statement_Identifier,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Statement_Identifier
(Self : Base_For_Loop_Statement)
return Program.Elements.Defining_Identifiers
.Defining_Identifier_Access is
begin
return Self.Statement_Identifier;
end Statement_Identifier;
overriding function Loop_Parameter
(Self : Base_For_Loop_Statement)
return Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access is
begin
return Self.Loop_Parameter;
end Loop_Parameter;
overriding function Generalized_Iterator
(Self : Base_For_Loop_Statement)
return Program.Elements.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access is
begin
return Self.Generalized_Iterator;
end Generalized_Iterator;
overriding function Element_Iterator
(Self : Base_For_Loop_Statement)
return Program.Elements.Element_Iterator_Specifications
.Element_Iterator_Specification_Access is
begin
return Self.Element_Iterator;
end Element_Iterator;
overriding function Statements
(Self : Base_For_Loop_Statement)
return not null Program.Element_Vectors.Element_Vector_Access is
begin
return Self.Statements;
end Statements;
overriding function End_Statement_Identifier
(Self : Base_For_Loop_Statement)
return Program.Elements.Identifiers.Identifier_Access is
begin
return Self.End_Statement_Identifier;
end End_Statement_Identifier;
overriding function Colon_Token
(Self : For_Loop_Statement)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Colon_Token;
end Colon_Token;
overriding function For_Token
(Self : For_Loop_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.For_Token;
end For_Token;
overriding function Loop_Token
(Self : For_Loop_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Loop_Token;
end Loop_Token;
overriding function End_Token
(Self : For_Loop_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.End_Token;
end End_Token;
overriding function Loop_Token_2
(Self : For_Loop_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Loop_Token_2;
end Loop_Token_2;
overriding function Semicolon_Token
(Self : For_Loop_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_For_Loop_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_For_Loop_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_For_Loop_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize
(Self : aliased in out Base_For_Loop_Statement'Class) is
begin
if Self.Statement_Identifier.Assigned then
Set_Enclosing_Element
(Self.Statement_Identifier, Self'Unchecked_Access);
end if;
if Self.Loop_Parameter.Assigned then
Set_Enclosing_Element (Self.Loop_Parameter, Self'Unchecked_Access);
end if;
if Self.Generalized_Iterator.Assigned then
Set_Enclosing_Element
(Self.Generalized_Iterator, Self'Unchecked_Access);
end if;
if Self.Element_Iterator.Assigned then
Set_Enclosing_Element (Self.Element_Iterator, Self'Unchecked_Access);
end if;
for Item in Self.Statements.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
if Self.End_Statement_Identifier.Assigned then
Set_Enclosing_Element
(Self.End_Statement_Identifier, Self'Unchecked_Access);
end if;
null;
end Initialize;
overriding function Is_For_Loop_Statement_Element
(Self : Base_For_Loop_Statement)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_For_Loop_Statement_Element;
overriding function Is_Statement_Element
(Self : Base_For_Loop_Statement)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Statement_Element;
overriding procedure Visit
(Self : not null access Base_For_Loop_Statement;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.For_Loop_Statement (Self);
end Visit;
overriding function To_For_Loop_Statement_Text
(Self : aliased in out For_Loop_Statement)
return Program.Elements.For_Loop_Statements
.For_Loop_Statement_Text_Access is
begin
return Self'Unchecked_Access;
end To_For_Loop_Statement_Text;
overriding function To_For_Loop_Statement_Text
(Self : aliased in out Implicit_For_Loop_Statement)
return Program.Elements.For_Loop_Statements
.For_Loop_Statement_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_For_Loop_Statement_Text;
end Program.Nodes.For_Loop_Statements;
|
multiple_initializations.asm | tor4z/nasm_training | 0 | 9618 | <filename>multiple_initializations.asm
global _start
section .data
starts times 9 db '*'
newLine db 0xa
section .text
_start:
; Output starts
mov eax, 4
mov ebx, 1
mov ecx, starts
mov edx, 9
int 0x80
; '\n'
mov eax, 4
mov ebx, 1
mov ecx, newLine
mov edx, 1
int 0x80
; Exit
mov eax, 1 ; exit sys call
mov ebx, 0 ;exit code
int 0x80
|
ada/original_2008/ada-gui/agar-gui-view.adb | auzkok/libagar | 286 | 30069 | <filename>ada/original_2008/ada-gui/agar-gui-view.adb
with interfaces.c.strings;
package body agar.gui.view is
package cs renames interfaces.c.strings;
use type c.int;
package cbinds is
function resize_display
(width : c.int;
height : c.int) return c.int;
pragma import (c, resize_display, "AG_ResizeDisplay");
function set_refresh_rate (rate : c.int) return c.int;
pragma import (c, set_refresh_rate, "AG_SetRefreshRate");
function find_window (name : cs.chars_ptr) return agar.gui.window.window_access_t;
pragma import (c, find_window, "AG_FindWindow");
function find_widget
(view : display_access_t;
name : cs.chars_ptr) return agar.gui.widget.widget_access_t;
pragma import (c, find_widget, "AG_WidgetFind");
function unbind_global_key
(key : sdl.keysym.key_t;
modkey : sdl.keysym.modkey_t) return c.int;
pragma import (c, unbind_global_key, "AG_UnbindGlobalKey");
end cbinds;
function resize_display
(width : positive;
height : positive) return boolean is
begin
return cbinds.resize_display
(width => c.int (width),
height => c.int (height)) = 0;
end resize_display;
function set_refresh_rate (rate : positive) return boolean is
begin
return cbinds.set_refresh_rate (c.int (rate)) = 0;
end set_refresh_rate;
function unbind_global_key
(key : sdl.keysym.key_t;
modkey : sdl.keysym.modkey_t) return boolean is
begin
return cbinds.unbind_global_key (key, modkey) = 0;
end unbind_global_key;
function find_window (name : string) return agar.gui.window.window_access_t is
ca_name : aliased c.char_array := c.to_c (name);
begin
return cbinds.find_window (cs.to_chars_ptr (ca_name'unchecked_access));
end find_window;
function find_widget
(view : display_access_t;
name : string) return agar.gui.widget.widget_access_t
is
ca_name : aliased c.char_array := c.to_c (name);
begin
return cbinds.find_widget (view, cs.to_chars_ptr (ca_name'unchecked_access));
end find_widget;
end agar.gui.view;
|
alloy4fun_models/trashltl/models/5/dkbRLCYS7EAcBvZse.als | Kaixi26/org.alloytools.alloy | 0 | 4112 | open main
pred iddkbRLCYS7EAcBvZse_prop6 {
all f : File | always f in Trash implies f in Trash
}
pred __repair { iddkbRLCYS7EAcBvZse_prop6 }
check __repair { iddkbRLCYS7EAcBvZse_prop6 <=> prop6o } |
src/lib/pce/irq1.asm | freem/freem_pong | 1 | 170810 | <reponame>freem/freem_pong<filename>src/lib/pce/irq1.asm
; PCE IRQ1 (VBlank, HBlank)
;==============================================================================;
IRQ1:
pha
phx
phy
; update VDC status
lda a:VDC_STATUS
sta int_vdcStatus
;-- check for interrupt source --;
bbr5 int_vdcStatus,IRQ1_CheckHBlank ; vblank = bit 5
IRQ1_VBlank:
; perform SATB buffer -> VRAM transfer
st0 #VDCREG_MAWR
st1 #<$7F00
st2 #>$7F00
; data transfer length ok?
st0 #VDCREG_VRWD
tia pce_satbBuf,VDC_DATA_LO,8*3
stz vblanked
bra IRQ1_end
IRQ1_CheckHBlank:
bbr2 int_vdcStatus,IRQ1_end ; hblank = bit 2
; do hblank (probably ends up being nothing)
; don't bother the with others in this small game
IRQ1_end:
ply
plx
pla
rti
|
source/oasis/program-elements-allocators.ads | reznikmm/gela | 0 | 22762 | -- SPDX-FileCopyrightText: 2019 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
with Program.Elements.Subtype_Indications;
with Program.Elements.Qualified_Expressions;
package Program.Elements.Allocators is
pragma Pure (Program.Elements.Allocators);
type Allocator is
limited interface and Program.Elements.Expressions.Expression;
type Allocator_Access is access all Allocator'Class with Storage_Size => 0;
not overriding function Subpool_Name
(Self : Allocator)
return Program.Elements.Expressions.Expression_Access is abstract;
not overriding function Subtype_Indication
(Self : Allocator)
return Program.Elements.Subtype_Indications.Subtype_Indication_Access
is abstract;
not overriding function Qualified_Expression
(Self : Allocator)
return Program.Elements.Qualified_Expressions.Qualified_Expression_Access
is abstract;
type Allocator_Text is limited interface;
type Allocator_Text_Access is access all Allocator_Text'Class
with Storage_Size => 0;
not overriding function To_Allocator_Text
(Self : in out Allocator)
return Allocator_Text_Access is abstract;
not overriding function New_Token
(Self : Allocator_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Left_Bracket_Token
(Self : Allocator_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Right_Bracket_Token
(Self : Allocator_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
end Program.Elements.Allocators;
|
unittests/ASM/Primary/Primary_10_2.asm | cobalt2727/FEX | 628 | 89187 | %ifdef CONFIG
{
"RegData": {
"RBX": "0xDA",
"RCX": "0x67EA",
"RDX": "0x656667FA",
"RBP": "0x616263646566680A",
"RDI": "0x82",
"RSP": "0x8082",
"R8": "0x80808082",
"R9": "0x1",
"R10": "0x414244164618471A",
"R11": "0x515253545556582A",
"R12": "0x6162636465666768"
},
"MemoryRegions": {
"0x100000000": "4096"
}
}
%endif
mov r15, 0xe0000000
mov rax, 0x4142434445464748
mov [r15 + 8 * 0], rax
mov rax, 0x5152535455565758
mov [r15 + 8 * 1], rax
mov rax, 0x6162636465666768
mov [r15 + 8 * 2], rax
mov rax, 0xD1
stc
adc byte [r15 + 8 * 0 + 0], al
stc
adc word [r15 + 8 * 0 + 2], ax
stc
adc dword [r15 + 8 * 0 + 4], eax
stc
adc qword [r15 + 8 * 1 + 0], rax
mov rbx, 0x71
mov rcx, 0x81
mov rdx, 0x91
mov rbp, 0xA1
stc
adc bl, byte [r15 + 8 * 2]
stc
adc cx, word [r15 + 8 * 2]
stc
adc edx, dword [r15 + 8 * 2]
stc
adc rbp, qword [r15 + 8 * 2]
mov rax, 0x01
stc
adc al, 0x80
mov rdi, rax
mov rax, 0x01
stc
adc ax, 0x8080
mov rsp, rax
mov rax, 0x01
stc
adc eax, 0x80808080
mov r8, rax
mov rax, 0x01
stc
adc rax, -1
mov r9, rax
mov r10, [r15 + 8 * 0]
mov r11, [r15 + 8 * 1]
mov r12, [r15 + 8 * 2]
hlt
|
tests/src/suits.adb | persan/AUnit-addons | 0 | 28676 | <reponame>persan/AUnit-addons
pragma Ada_2012;
with Tc;
package body Suits is
T : aliased Tc.Test_Case;
----------
-- Suit --
----------
S : aliased AUnit.Test_Suites.Test_Suite;
function Suit return AUnit.Test_Suites.Access_Test_Suite is
begin
S.Add_Test (T'Access);
return S'Access;
end Suit;
end Suits;
|
awa/awaunit/awa-tests-helpers-contexts.adb | fuzzysloth/ada-awa | 81 | 25311 | <filename>awa/awaunit/awa-tests-helpers-contexts.adb
-----------------------------------------------------------------------
-- users-tests-contexts -- Helpers for service contexts
-- Copyright (C) 2013 <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.
-----------------------------------------------------------------------
package body AWA.Tests.Helpers.Contexts is
-- ------------------------------
-- Get the attribute registered under the given name in the HTTP session.
-- ------------------------------
overriding
function Get_Session_Attribute (Ctx : in Service_Context;
Name : in String) return Util.Beans.Objects.Object is
Pos : constant Util.Beans.Objects.Maps.Cursor := Ctx.Session_Attributes.Find (Name);
begin
if Util.Beans.Objects.Maps.Has_Element (Pos) then
return Util.Beans.Objects.Maps.Element (Pos);
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Session_Attribute;
-- ------------------------------
-- Set the attribute registered under the given name in the HTTP session.
-- ------------------------------
overriding
procedure Set_Session_Attribute (Ctx : in out Service_Context;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
Ctx.Session_Attributes.Include (Name, Value);
end Set_Session_Attribute;
end AWA.Tests.Helpers.Contexts;
|
alloy4fun_models/trashltl/models/1/5iRy3JZw8Z5Zfq8c4.als | Kaixi26/org.alloytools.alloy | 0 | 54 | <filename>alloy4fun_models/trashltl/models/1/5iRy3JZw8Z5Zfq8c4.als
open main
pred id5iRy3JZw8Z5Zfq8c4_prop2 {
no File implies after some File
}
pred __repair { id5iRy3JZw8Z5Zfq8c4_prop2 }
check __repair { id5iRy3JZw8Z5Zfq8c4_prop2 <=> prop2o } |
software/pcx86/bdsrc/boot/wboot.asm | fatman2021/basicdos | 59 | 21131 | ;
; BASIC-DOS Boot Sector Updater
;
; @author <NAME> <<EMAIL>>
; @copyright (c) 2020-2021 <NAME>
; @license MIT <https://basicdos.com/LICENSE.txt>
;
; This file is part of PCjs, a computer emulation software project at pcjs.org
;
include macros.inc
include bios.inc
include devapi.inc
include dosapi.inc
CODE SEGMENT
org 100h
;
; Writes BOOT.COM (or other file specified on the command-line) to the boot
; sector of the diskette in drive A. Any portion that exceeds the 512-byte
; maximum will be written to a second file (eg, BOOT2.COM) for inclusion in the
; first boot file.
;
ASSUME CS:CODE, DS:CODE, ES:CODE, SS:CODE
DEFPROC main
mov dx,offset fname
mov bp,offset fname2
mov si,80h ; check the command-line
lodsb
test al,al
jz open ; open the default filename
m1: lodsb
cmp al,CHR_SPACE
je m1
cmp al,CHR_RETURN
je open
lea dx,[si-1] ; DS:DX -> first filename
m2: lodsb
cmp al,CHR_SPACE
je m3
cmp al,CHR_RETURN
je m3
jmp m2
m3: mov byte ptr [si-1],0 ; null-terminate the first filename
cmp al,CHR_SPACE
jne open
m4: lodsb
cmp al,CHR_SPACE
je m4
cmp al,CHR_RETURN
je open
lea bp,[si-1] ; DS:BP -> second filename
m5: lodsb
cmp al,CHR_SPACE
je m6
cmp al,CHR_RETURN
jne m5
m6: mov byte ptr [si-1],0 ; null-terminate the second filename
jmp short open
eopen: mov dx,offset emopen
jmp emsg
eread: mov dx,offset emread
jmp emsg
ewrite: mov dx,offset emwrite
jmp emsg
echeck: mov dx,offset emcheck
jmp emsg
open: mov ax,DOS_HDL_OPENRW ; AH = 3Dh (OPEN FILE), AL = R/W
int 21h
jc eopen
xchg bx,ax ; BX = file handle
;
; Let's get the boot sector length first; if it's only 512 bytes,
; then it's already been truncated, so all we want to do is write it
; to the boot drive.
;
mov ax,DOS_HDL_SEEKEND ; AH = 42h (SEEK), AL = 2 (FROM END)
sub cx,cx
sub dx,dx ; CX:DX == offset (zero)
int 21h
cmp ax,512 ; exactly 512?
mov dx,BOOT_SECTOR_LO ;
jne seek ; no
sub dx,dx ; yes, seek back to start
seek: mov ax,DOS_HDL_SEEKBEG ; AH = 42h (SEEK), AL = 0 (FROM START)
int 21h
mov cx,514 ; CX = number of bytes
mov dx,offset buffer ; DS:DX -> buffer
mov di,dx ; DS:DI -> buffer
mov word ptr [di+512],-1 ; set guard word just past sector
mov ah,DOS_HDL_READ ; AH = 3Fh (READ FILE)
int 21h
eread2: jc eread
cmp ax,512 ; read at least 512 bytes?
jb echeck ; no
cmp [di+510],0AA55h ; correct signature?
jne echeck ; no
push bx
mov ax,0301h ; AH = 03h (WRITE SECTORS), AL = 1
mov bx,dx ; ES:BX -> buffer
mov cx,0001h ; CH = CYL 0, CL = SEC 1
sub dx,dx ; DH = HEAD 0, DL = DRIVE 0
int 13h
pop bx
jc ewrite
cmp word ptr [di+512],-1 ; anything past the signature?
je done ; no, assume we're done
;
; Read the 2nd half of the boot code into buffer + 512
;
mov ax,DOS_HDL_SEEKBEG ; AH = 42h (SEEK), AL = 0 (FROM START)
mov dx,offset DIR_SECTOR ;
sub cx,cx ; CX:DX = offset
int 21h
mov cx,1024 ; CX = number of bytes
mov dx,offset buffer + 512 ; DS:DX -> buffer + 512
mov ah,DOS_HDL_READ ; AH = 3Fh (READ FILE)
int 21h
jc eread2
mov di,dx ; DI -> buffer
add di,ax ; DI -> just past bytes read
dec di ; DI -> last byte read
xchg cx,ax ; CX = # bytes read
mov al,0
std
repe scasb ; scan backward for 1st non-null
cld
jz echk2 ; must have been all nulls?
add di,3
sub di,dx
xchg ax,di ; AX = # of VALID bytes read
cmp ax,512 ; 2nd half small enough?
jb trunc ; yes
echk2: jmp echeck ; no
;
; Before we close the original file (BOOT.COM), let's write the 1st half of
; the boot sector back to it, and then truncate it at 512 bytes.
;
trunc: push ax ; save # bytes to write
mov ax,DOS_HDL_SEEKBEG ; AH = 42h (SEEK), AL = 0 (FROM START)
sub cx,cx
sub dx,dx
int 21h
mov dx,offset buffer
mov cx,512
mov ah,DOS_HDL_WRITE
int 21h
mov ah,DOS_HDL_WRITE ; write zero bytes to truncate here
sub cx,cx
int 21h
mov ah,DOS_HDL_CLOSE ; AH = 3Eh (CLOSE FILE)
int 21h
jmp short create
ecreat: mov dx,offset emcreat
emsg: mov al,0FFh
jmp short msg
create: mov ah,DOS_HDL_CREATE
sub cx,cx
mov dx,bp ; DS:DX -> second filename
int 21h
pop cx ; CX = number of bytes to write
jc ecreat
xchg bx,ax ; BX = handle
mov dx,offset buffer + 512 ; DS:DX -> buffer + 512
mov ah,DOS_HDL_WRITE ; AH = 40h (WRITE FILE)
int 21h
jc ecreat
mov ah,DOS_HDL_CLOSE ; AH = 3Eh (CLOSE FILE)
int 21h
done: mov al,0 ; exit with zero return code
mov dx,offset success
msg: push ax
mov ah,DOS_TTY_PRINT
int 21h
pop ax
exit: mov ah,DOS_PSP_RETURN ; return to caller with exit code in AL
int 21h
ENDPROC main
fname db "BOOT.COM",0
fname2 db "BOOT2.COM",0
emopen db "Unable to open BOOT.COM",13,10,'$'
emread db "Unable to read BOOT.COM",13,10,'$'
emcheck db "BOOT.COM check failure",13,10,'$'
emwrite db "Unable to write BOOT.COM to boot sector",13,10,'$'
emcreat db "Unable to create BOOT2.COM",13,10,'$'
success db "Boot sector on drive A: updated",13,10,'$'
buffer label byte
CODE ENDS
end main
|
start_up/Elf_64.asm | DosDevs/zoom-zoom | 0 | 245148 | ; ---------------------------------------------------------------
; ------- Copyright 2015 <NAME>, All Rights Reserved. --
; ------- --
; ------- Elf64.asm --
; ------- --
; ------- Interprets and executes simple ELF programs. --
; ------- --
; ------- RSI - Pointer to start of buffer. --
; ------- RCX - Size of buffer in bytes. --
; ---------------------------------------------------------------
[BITS 64]
Elf_64_Entry:
;
; Find program Table.
;
lodsd
cmp eax, ELF_64_MAGIC
jne Elf_64_Not_Elf
lodsd ; Assume 64-bit Little-Endian; ignore.
lodsq ; Ignore Padding.
lodsq ; Ignore Type, Machine, Program_Version.
lodsq ; Program entry point.
mov [Elf_64_Program_Entry_Point], rax
lodsq ; Program header offset.
mov [Elf_64_Program_Table], rax
lodsq ; Section header offset.
mov [Elf_64_Section_Table], rax
lodsd ; Ignore flags
lodsw ; Elf header size in bytes.
mov [Elf_64_Header_Size], ax
lodsw ; Program header entry size.
mov [Elf_64_Program_Header_Entry_Size], ax
lodsw ; Program header entry count.
mov [Elf_64_Program_Header_Entry_Count], ax
lodsw ; Section header entry size.
mov [Elf_64_Section_Header_Entry_Size], ax
lodsw ; Section header entry count.
mov [Elf_64_Section_Header_Entry_Count], ax
;
; Parse the Program Table.
;
mov rsi, [Elf_64_Program_Table]
add rsi, EL_ADDRESS
lodsd
mov [Elf_64_Segment_Type], eax
lodsd
mov [Elf_64_Segment_Flags], eax
lodsq
mov [Elf_64_Segment_Offset], rax
lodsq
mov [Elf_64_Segment_Address], rax
lodsq ; Ignore physical address.
lodsq
mov [Elf_64_Segment_File_Size], rax
lodsq
mov [Elf_64_Segment_Memory_Size], rax
lodsq
mov [Elf_64_Segment_Alignment], rax
mov rax, [Elf_64_Program_Entry_Point]
ret
Elf_64_Not_Elf:
stc
mov rax, 0ffffffffffffffffh
ret
ELF_64_MAGIC EQU 0464c457fh
Elf_64_Program_Entry_Point dq 0
Elf_64_Program_Table dq 0
Elf_64_Section_Table dq 0
Elf_64_Header_Size dw 0
Elf_64_Program_Header_Entry_Size dw 0
Elf_64_Program_Header_Entry_Count dw 0
Elf_64_Section_Header_Entry_Size dw 0
Elf_64_Section_Header_Entry_Count dw 0
Elf_64_Segment_Type dd 0
Elf_64_Segment_Flags dd 0
Elf_64_Segment_Offset dq 0
Elf_64_Segment_Address dq 0
Elf_64_Segment_File_Size dq 0
Elf_64_Segment_Memory_Size dq 0
Elf_64_Segment_Alignment dq 0
msgProgramEntry db "Program entry point: ", 0
msgProgramTableOffset db "Program table offset: ", 0
msgSectionTableOffset db "Section table offset: ", 0
msgSegmentOffset db "Segment offset: ", 0
msgSegmentAddress db "Segment address: ", 0
msgSegmentFileSize db "Segment size in file: ", 0
msgSegmentMemory db "Segment size in memory: ", 0
|
data/github.com/xilopaint/alfred-things/b0473406bd5f29647385eedf51539fa68cfa5388/src/things.applescript | ajnavarro/language-dataset | 9 | 3168 | <reponame>ajnavarro/language-dataset<filename>data/github.com/xilopaint/alfred-things/b0473406bd5f29647385eedf51539fa68cfa5388/src/things.applescript
on run argv
set workflowFolder to do shell script "pwd"
set wlib to load script POSIX file (workflowFolder & "/lib/lib.scpt")
set wf to wlib's workflow()
set theAction to item 1 of argv as text
set listId to (system attribute "list")
set projectId to (system attribute "project")
set tagId to (system attribute "tag")
if argv does not contain "back" then
if theAction is "showLists" then
showLists(wf)
else if theAction is "showToDos" then
showToDos(wf, listId)
else if theAction is "showListInThings" then
showListInThings(listId)
else if theAction is "showToDoInThings" then
showToDoInThings(argv)
else if theAction is "showToDosInProject" then
showToDosInProject(wf, projectId)
else if theAction is "showTagsInList" then
showTagsInList(wf, listId)
else if theAction is "showToDosInTag" then
showToDosInTag(wf, tagId)
else if theAction is "addToDo" then
addToDo()
else if theAction is "markAsCompleted" then
markAsCompleted(argv)
else if theAction is "markAsCanceled" then
markAsCanceled(argv)
else if theAction is "deleteToDo" then
deleteToDo(argv)
else if the theAction is "emptyTrash" then
emptyTrash()
end if
end if
end run
on showLists(wf)
tell application "Things3"
repeat with n from 1 to count of lists
set listName to name of item n of lists
set listId to id of item n of lists
set icons to {"inbox", "today", "anytime", "upcoming", "someday", null, "logbook", "trash"}
if n < 9 and n ≠ 6 then
set icon to "icons/" & item n of icons & ".png"
add_item of wf with valid given title:listName, subtitle:"", arg:listId, icon:icon
else if n > 8 then
set icon to "icons/area.png"
add_item of wf with valid given title:listName, subtitle:"", arg:listId, icon:icon
end if
end repeat
end tell
return wf's to_json()
end showLists
on showToDos(wf, listId)
tell application "Things3"
if wf's is_empty(to dos of list id listId)
set subtitle to "Empty list"
else
set subtitle to ""
end if
add_item of wf with valid given title:"Back to Lists", subtitle:subtitle, arg:"back", icon:"icons/back.png"
repeat with toDo in to dos of list id listId
set toDoName to name of toDo
set dueDate to due date of toDo
set toDoId to id of toDo
if dueDate is missing value then
set subtitle to ""
else
set interval to ((dueDate) - (current date)) / days
if interval > 0 then
set interval to round interval rounding up
if not interval = 1 then
set subtitle to "⚑ " & interval & " days left"
else
set subtitle to "⚑ " & interval & " day left"
end if
else if interval > -1 and interval < 0 then
set subtitle to "⚑ today"
else if interval < -1 then
set interval to -1 * interval
set interval to round interval rounding down
if not interval = 1 then
set subtitle to "⚑ " & interval & " days ago"
else
set subtitle to "⚑ " & interval & " day ago"
end if
end if
end if
if not exists project named toDoName
set icon to "icons/todo.png"
else
set icon to "icons/project.png"
end if
add_item of wf with valid given title:toDoName, subtitle:subtitle, arg:toDoId, icon:icon
end repeat
end tell
return wf's to_json()
end showToDos
on showListInThings(listId)
tell application "Things3"
activate
show list id listId
end tell
end showListInThings
on showToDoInThings(argv)
tell application "Things3"
activate
show to do id (item 2 of argv as text)
end tell
end showToDoInThings
on showToDosInProject(wf, projectId)
tell application "Things3"
if wf's is_empty(to dos of project id projectId)
set subtitle to "Empty project"
else
set subtitle to ""
end if
add_item of wf with valid given title:"Back to Lists", subtitle:subtitle, arg:"back", icon:"icons/back.png"
repeat with toDo in (to dos of project id projectId)
set toDoName to name of toDo
set dueDate to due date of toDo
set toDoId to id of toDo
if dueDate is missing value then
set subtitle to ""
else
set interval to ((dueDate) - (current date)) / days
if interval > 0 then
set interval to round interval rounding up
if not interval = 1 then
set subtitle to "⚑ " & interval & " days left"
else
set subtitle to "⚑ " & interval & " day left"
end if
else if interval > -1 and interval < 0 then
set subtitle to "⚑ today"
else if interval < -1 then
set interval to -1 * interval
set interval to round interval rounding down
if not interval = 1 then
set subtitle to "⚑ " & interval & " days ago"
else
set subtitle to "⚑ " & interval & " day ago"
end if
end if
end if
add_item of wf with valid given title:toDoName, subtitle:subtitle, arg:toDoId, icon:"icons/todo.png"
end repeat
end tell
return wf's to_json()
end showToDosInProject
on showTagsInList(wf, listId)
tell application "Things3"
add_item of wf with valid given title:"Back to Lists", subtitle:"", arg:"back", icon:"icons/back.png"
set listName to text 3 thru -11 of listId
set tagNames to {}
repeat with theTag in tags of to dos of list id listId
set tagName to name of theTag
if tagNames does not contain tagName
copy tagName to the end of tagNames
set tagId to id of theTag
set theUrl to "things:///show?id=" & listName & "&filter=" & tagName
add_item of wf with valid given title:tagName, subtitle:"", arg:tagId, icon:"icons/tag.png"
add_modifier of wf with valid given modkey:"cmd", subtitle:"Show in Things", arg:theUrl
end if
end repeat
end tell
return wf's to_json()
end showTagInList
on showToDosInTag(wf, tagId)
tell application "Things3"
add_item of wf with valid given title:"Back to Lists", subtitle:"", arg:"back", icon:"icons/back.png"
repeat with toDo in (to dos of tag id tagId)
set toDoName to name of toDo
set dueDate to due date of toDo
set toDoId to id of toDo
if dueDate is missing value then
set subtitle to ""
else
set interval to ((dueDate) - (current date)) / days
if interval > 0 then
set interval to round interval rounding up
if not interval = 1 then
set subtitle to "⚑ " & interval & " days left"
else
set subtitle to "⚑ " & interval & " day left"
end if
else if interval > -1 and interval < 0 then
set subtitle to "⚑ today"
else if interval < -1 then
set interval to -1 * interval
set interval to round interval rounding down
if not interval = 1 then
set subtitle to "⚑ " & interval & " days ago"
else
set subtitle to "⚑ " & interval & " day ago"
end if
end if
end if
add_item of wf with valid given title:toDoName, subtitle:subtitle, arg:toDoId, icon:"icons/todo.png"
end repeat
end tell
return wf's to_json()
end showToDosInTag
on addToDo()
tell application "Things3" to show quick entry panel
end addToDo
on markAsCompleted(argv)
tell application "Things3"
set toDo to to do id (item 2 of argv as text)
set status of toDo to completed
delay 1.3
end tell
end markAsCompleted
on markAsCanceled(argv)
tell application "Things3"
set toDo to to do id (item 2 of argv as text)
set status of toDo to canceled
delay 1.3
end tell
end markAsCanceled
on deleteToDo(argv)
tell application "Things3"
set toDo to to do id (item 2 of argv as text)
move toDo to list id "TMTrashListSource"
end tell
end deleteToDo
on emptyTrash()
tell application "Things3" to empty trash
end emptyTrash
|
assembler/tests/t_nestedstructs/t_nestedstructs.asm | paulscottrobson/RCA-Cosmac-VIP-III | 0 | 26499 | <reponame>paulscottrobson/RCA-Cosmac-VIP-III
cpu 6809
page 0
dottedstructs on
commin struct
command byt ?
union
disk struct
slot byt ?
size adr ?
type byt ?
gameid byt ?, ?, ?, ?, ?, ?, ?, ?
g2 byt ?, ?, ?, ?, ?, ?, ?, ?
disk endstruct
drive struct
letter byt ?
name byt [10]?
drive endstruct
endunion
commin endstruct
org 0
phase 256
a commin
dephase
adr commin.len
adr commin.disk.len
adr commin.drive.len
adr a.command
adr a.disk.slot
adr a.disk.size
adr a.disk.type
adr a.disk.gameid
adr a.disk.g2
adr a.drive.letter
adr a.drive.name
|
src/ships.adb | thindil/steamsky | 80 | 25026 | <gh_stars>10-100
-- Copyright 2016-2021 <NAME>
--
-- This file is part of Steam Sky.
--
-- Steam Sky is free software: you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation, either version 3 of the License, or
-- (at your option) any later version.
--
-- Steam Sky 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 Steam Sky. If not, see <http://www.gnu.org/licenses/>.
with Ada.Characters.Handling;
with DOM.Core;
with DOM.Core.Documents;
with DOM.Core.Nodes;
with DOM.Core.Elements;
with Bases;
with Crafts; use Crafts;
with Factions; use Factions;
with Log;
with Maps;
with Ships.Crew;
with ShipModules; use ShipModules;
with Utils; use Utils;
package body Ships is
function Create_Ship
(Proto_Index, Name: Unbounded_String; X: Map_X_Range; Y: Map_Y_Range;
Speed: Ship_Speed; Random_Upgrades: Boolean := True)
return Ship_Record is
use Bases;
use Maps;
Tmp_Ship: Ship_Record := Empty_Ship;
Ship_Modules: Modules_Container.Vector := Modules_Container.Empty_Vector;
Ship_Crew: Crew_Container.Vector := Crew_Container.Empty_Vector;
New_Name: Unbounded_String := Null_Unbounded_String;
Hull_Index: Modules_Container.Extended_Index := 0;
Amount: Natural := 0;
Proto_Ship: constant Proto_Ship_Data := Proto_Ships_List(Proto_Index);
Ship_Cargo: Inventory_Container.Vector :=
Inventory_Container.Empty_Vector;
Owners: Natural_Container.Vector := Natural_Container.Empty_Vector;
begin
-- Set ship modules
Set_Modules_Block :
declare
Weight_Gain: Natural := 0;
Max_Upgrade_Value: Positive := 1;
Temp_Module: BaseModule_Data := (others => <>);
Roll: Positive range 1 .. 100 := 1;
Upgrades_Amount: Natural :=
(if Random_Upgrades then
Get_Random(Min => 0, Max => Positive(Proto_Ship.Modules.Length))
else 0);
begin
Set_Modules_Loop :
for Module of Proto_Ship.Modules loop
Temp_Module := Modules_List(Module);
if Upgrades_Amount = 0 or
Get_Random(Min => 1, Max => 100) < 51 then
goto End_Of_Setting_Upgrades;
end if;
Weight_Gain :=
Modules_List(Module).Weight / Modules_List(Module).Durability;
if Weight_Gain < 1 then
Weight_Gain := 1;
end if;
Roll := Get_Random(Min => 1, Max => 100);
case Roll is
when 1 .. 50 => -- Upgrade durability of module
Max_Upgrade_Value :=
Positive(Float(Modules_List(Module).Durability) * 1.5);
Temp_Module.Durability :=
Get_Random
(Min => Modules_List(Module).Durability,
Max => Max_Upgrade_Value);
--## rule off SIMPLIFIABLE_EXPRESSIONS
Temp_Module.Weight :=
Temp_Module.Weight +
(Weight_Gain *
(Temp_Module.Durability -
Modules_List(Module).Durability));
--## rule on SIMPLIFIABLE_EXPRESSIONS
when 51 .. 75 => -- Upgrade value (depends on module) of module
if Modules_List(Module).MType = ENGINE then
Weight_Gain := Weight_Gain * 10;
Max_Upgrade_Value :=
Positive(Float(Modules_List(Module).Value) / 2.0);
Temp_Module.Value :=
Get_Random
(Min => Max_Upgrade_Value,
Max => Modules_List(Module).Value);
--## rule off SIMPLIFIABLE_EXPRESSIONS
Temp_Module.Weight :=
Temp_Module.Weight +
(Weight_Gain *
(Modules_List(Module).Value - Temp_Module.Value));
--## rule on SIMPLIFIABLE_EXPRESSIONS
end if;
when 76 ..
100 => -- Upgrade max_value (depends on module) of module
case Modules_List(Module).MType is
when HULL =>
Weight_Gain := Weight_Gain * 10;
when ENGINE =>
Weight_Gain := 1;
when others =>
null;
end case;
if Temp_Module.MType in ENGINE | CABIN | GUN |
BATTERING_RAM | HULL | HARPOON_GUN then
Max_Upgrade_Value :=
Positive(Float(Modules_List(Module).MaxValue) * 1.5);
Temp_Module.MaxValue :=
Get_Random
(Min => Modules_List(Module).MaxValue,
Max => Max_Upgrade_Value);
--## rule off SIMPLIFIABLE_EXPRESSIONS
Temp_Module.Weight :=
Temp_Module.Weight +
(Weight_Gain *
(Temp_Module.MaxValue -
Modules_List(Module).MaxValue));
--## rule on SIMPLIFIABLE_EXPRESSIONS
end if;
end case;
Upgrades_Amount := Upgrades_Amount - 1;
<<End_Of_Setting_Upgrades>>
Owners.Clear;
if Temp_Module.MaxOwners > 0 then
Set_Module_Owners_Loop :
for I in 1 .. Temp_Module.MaxOwners loop
Owners.Append(New_Item => 0);
end loop Set_Module_Owners_Loop;
end if;
case Temp_Module.MType is
when ENGINE =>
Ship_Modules.Append
(New_Item =>
(M_Type => ENGINE, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE,
Fuel_Usage => Temp_Module.Value,
Power => Temp_Module.MaxValue, Disabled => False));
when CABIN =>
Ship_Modules.Append
(New_Item =>
(M_Type => CABIN, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE,
Cleanliness => Temp_Module.Value,
Quality => Temp_Module.Value));
when ALCHEMY_LAB .. GREENHOUSE =>
Ship_Modules.Append
(New_Item =>
(M_Type => WORKSHOP, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE,
Crafting_Index => Null_Unbounded_String,
Crafting_Time => 0, Crafting_Amount => 0));
when MEDICAL_ROOM =>
Ship_Modules.Append
(New_Item =>
(M_Type => MEDICAL_ROOM,
Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE));
when COCKPIT =>
Ship_Modules.Append
(New_Item =>
(M_Type => COCKPIT, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE));
when TRAINING_ROOM =>
Ship_Modules.Append
(New_Item =>
(M_Type => TRAINING_ROOM,
Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE, Trained_Skill => 0));
when TURRET =>
Ship_Modules.Append
(New_Item =>
(M_Type => TURRET, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE, Gun_Index => 0));
when GUN =>
Ship_Modules.Append
(New_Item =>
(M_Type => GUN, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE, Damage => Temp_Module.MaxValue,
Ammo_Index => 0));
when CARGO =>
Ship_Modules.Append
(New_Item =>
(M_Type => CARGO_ROOM,
Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE));
when HULL =>
Ship_Modules.Append
(New_Item =>
(M_Type => HULL, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE,
Installed_Modules => Temp_Module.Value,
Max_Modules => Temp_Module.MaxValue));
when ARMOR =>
Ship_Modules.Append
(New_Item =>
(M_Type => ARMOR, Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE));
when BATTERING_RAM =>
Ship_Modules.Append
(New_Item =>
(M_Type => BATTERING_RAM,
Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE,
Damage2 => Temp_Module.MaxValue,
Cooling_Down => False));
when HARPOON_GUN =>
Ship_Modules.Append
(New_Item =>
(M_Type => HARPOON_GUN,
Name => Modules_List(Module).Name,
Proto_Index => Module, Weight => Temp_Module.Weight,
Durability => Temp_Module.Durability,
Max_Durability => Temp_Module.Durability,
Owner => Owners, Upgrade_Progress => 0,
Upgrade_Action => NONE,
Duration => Temp_Module.MaxValue, Harpoon_Index => 0));
when ANY =>
null;
end case;
end loop Set_Modules_Loop;
end Set_Modules_Block;
-- Set ship name
New_Name :=
(if Name = Null_Unbounded_String then Proto_Ship.Name else Name);
-- Set ship crew
Set_Ship_Crew_Block :
declare
Member: Member_Data :=
Member_Data'
(Amount_Of_Attributes => Attributes_Amount,
Amount_Of_Skills => Skills_Amount, others => <>);
begin
Set_Crew_Loop :
for ProtoMember of Proto_Ship.Crew loop
Amount :=
(if ProtoMember.Max_Amount = 0 then ProtoMember.Min_Amount
else Get_Random
(Min => ProtoMember.Min_Amount,
Max => ProtoMember.Max_Amount));
Add_Crew_Member_Loop :
for I in 1 .. Amount loop
Member :=
GenerateMob
(MobIndex => ProtoMember.Proto_Index,
FactionIndex => Proto_Ship.Owner);
Ship_Crew.Append(New_Item => Member);
Modules_Loop :
for Module of Ship_Modules loop
if Module.M_Type = CABIN then
Set_Cabin_Name_Loop :
for J in Module.Owner.Iterate loop
if Module.Owner(J) = 0 then
Module.Owner(J) := Ship_Crew.Last_Index;
if Natural_Container.To_Index(Position => J) =
1 then
Module.Name :=
Member.Name &
To_Unbounded_String(Source => "'s Cabin");
end if;
exit Modules_Loop;
end if;
end loop Set_Cabin_Name_Loop;
end if;
end loop Modules_Loop;
Set_Module_Owner_Loop :
for Module of Ship_Modules loop
if Module.Owner.Length > 0 then
if Module.Owner(1) = 0 and
(Module.M_Type in GUN | HARPOON_GUN and
Member.Order = Gunner) then
Module.Owner(1) := Ship_Crew.Last_Index;
exit Set_Module_Owner_Loop;
elsif Module.M_Type = COCKPIT and
Member.Order = Pilot then
Module.Owner(1) := Ship_Crew.Last_Index;
exit Set_Module_Owner_Loop;
end if;
end if;
end loop Set_Module_Owner_Loop;
end loop Add_Crew_Member_Loop;
end loop Set_Crew_Loop;
end Set_Ship_Crew_Block;
-- Set ship cargo
Set_Cargo_Loop :
for I in Proto_Ship.Cargo.Iterate loop
Amount :=
(if Proto_Ship.Cargo(I).MaxAmount > 0 then
Get_Random
(Min => Proto_Ship.Cargo(I).MinAmount,
Max => Proto_Ship.Cargo(I).MaxAmount)
else Proto_Ship.Cargo(I).MinAmount);
Ship_Cargo.Append
(New_Item =>
(ProtoIndex => Proto_Ship.Cargo(I).ProtoIndex, Amount => Amount,
Name => Null_Unbounded_String, Durability => 100, Price => 0));
end loop Set_Cargo_Loop;
Tmp_Ship :=
(Name => New_Name, Sky_X => X, Sky_Y => Y, Speed => Speed,
Modules => Ship_Modules, Cargo => Ship_Cargo, Crew => Ship_Crew,
Upgrade_Module => 0, Destination_X => 0, Destination_Y => 0,
Repair_Module => 0, Description => Proto_Ship.Description,
Home_Base => 0);
Assing_Gun_Block :
declare
Gun_Assigned: Boolean := False;
begin
Amount := 0;
Count_Modules_Loop :
for I in Tmp_Ship.Modules.Iterate loop
if Tmp_Ship.Modules(I).M_Type = TURRET then
Count_Guns_Loop :
for J in Tmp_Ship.Modules.Iterate loop
if Tmp_Ship.Modules(J).M_Type in GUN | HARPOON_GUN then
Gun_Assigned := False;
Check_Assigned_Guns_Loop :
for K in Tmp_Ship.Modules.Iterate loop
if Tmp_Ship.Modules(K).M_Type = TURRET
and then Tmp_Ship.Modules(K).Gun_Index =
Modules_Container.To_Index(Position => J) then
Gun_Assigned := True;
exit Check_Assigned_Guns_Loop;
end if;
end loop Check_Assigned_Guns_Loop;
if not Gun_Assigned then
Tmp_Ship.Modules(I).Gun_Index :=
Modules_Container.To_Index(Position => J);
end if;
end if;
end loop Count_Guns_Loop;
elsif Tmp_Ship.Modules(I).M_Type = HULL then
Hull_Index := Modules_Container.To_Index(Position => I);
end if;
if Modules_List(Tmp_Ship.Modules(I).Proto_Index).MType not in GUN |
HARPOON_GUN | ARMOR | HULL then
Amount :=
Amount + Modules_List(Tmp_Ship.Modules(I).Proto_Index).Size;
end if;
end loop Count_Modules_Loop;
Tmp_Ship.Modules(Hull_Index).Installed_Modules := Amount;
end Assing_Gun_Block;
-- Set known crafting recipes
Set_Known_Recipes_Loop :
for Recipe of Proto_Ship.Known_Recipes loop
Known_Recipes.Append(New_Item => Recipe);
end loop Set_Known_Recipes_Loop;
-- Set home base for ship
if SkyMap(X, Y).BaseIndex > 0 then
Tmp_Ship.Home_Base := SkyMap(X, Y).BaseIndex;
else
Find_Home_Base_Block :
declare
Start_X, Start_Y, End_X, End_Y: Integer;
begin
Start_X := X - 100;
NormalizeCoord(Coord => Start_X);
Start_Y := Y - 100;
NormalizeCoord(Coord => Start_Y, IsXAxis => False);
End_X := X + 100;
NormalizeCoord(Coord => End_X);
End_Y := Y + 100;
NormalizeCoord(Coord => End_Y, IsXAxis => False);
Bases_X_Loop :
for Sky_X in Start_X .. End_X loop
Bases_Y_Loop :
for Sky_Y in Start_Y .. End_Y loop
if SkyMap(Sky_X, Sky_Y).BaseIndex > 0 then
if Sky_Bases(SkyMap(Sky_X, Sky_Y).BaseIndex).Owner =
Proto_Ship.Owner then
Tmp_Ship.Home_Base := SkyMap(Sky_X, Sky_Y).BaseIndex;
exit Bases_X_Loop;
end if;
end if;
end loop Bases_Y_Loop;
end loop Bases_X_Loop;
if Tmp_Ship.Home_Base = 0 then
Set_Home_Base_Loop :
for I in Sky_Bases'Range loop
if Sky_Bases(I).Owner = Proto_Ship.Owner then
Tmp_Ship.Home_Base := I;
exit Set_Home_Base_Loop;
end if;
end loop Set_Home_Base_Loop;
end if;
end Find_Home_Base_Block;
end if;
-- Set home base for crew members
Set_Home_For_Members_Loop :
for Member of Tmp_Ship.Crew loop
Member.HomeBase :=
(if Get_Random(Min => 1, Max => 100) < 99 then Tmp_Ship.Home_Base
else Get_Random(Min => Sky_Bases'First, Max => Sky_Bases'Last));
end loop Set_Home_For_Members_Loop;
return Tmp_Ship;
end Create_Ship;
procedure Load_Ships(Reader: Tree_Reader) is
use Ada.Characters.Handling;
use DOM.Core;
use DOM.Core.Elements;
use DOM.Core.Nodes;
use Log;
Nodes_List: constant Node_List :=
DOM.Core.Documents.Get_Elements_By_Tag_Name
(Doc => Get_Tree(Read => Reader), Tag_Name => "ship");
Child_Nodes: Node_List; --## rule line off IMPROPER_INITIALIZATION
Temp_Record: Proto_Ship_Data := Empty_Proto_Ship;
Module_Amount, Delete_Index: Positive := 1;
Action, Sub_Action: Data_Action := Default_Data_Action;
Ship_Node, Child_Node: Node;
Item_Index, Recipe_Index, Mob_Index, Module_Index,
Ship_Index: Unbounded_String := Null_Unbounded_String;
procedure Count_Ammo_Value(Item_Type_Index, Multiple: Positive) is
begin
Count_Ammo_Value_Loop :
for I in Temp_Record.Cargo.Iterate loop
if Items_List(Temp_Record.Cargo(I).ProtoIndex).IType =
Items_Types(Item_Type_Index) then
--## rule off SIMPLIFIABLE_EXPRESSIONS
Temp_Record.Combat_Value :=
Temp_Record.Combat_Value +
(Items_List(Temp_Record.Cargo(I).ProtoIndex).Value(1) *
Multiple);
--## rule on SIMPLIFIABLE_EXPRESSIONS
end if;
end loop Count_Ammo_Value_Loop;
end Count_Ammo_Value;
begin
Load_Proto_Ships_Loop :
for I in 0 .. Length(List => Nodes_List) - 1 loop
Temp_Record :=
(Name => Null_Unbounded_String,
Modules => UnboundedString_Container.Empty_Vector,
Accuracy => (1 => 0, 2 => 0), Combat_Ai => NONE,
Evasion => (1 => 0, 2 => 0), Loot => (1 => 0, 2 => 0),
Perception => (1 => 0, 2 => 0),
Cargo => MobInventory_Container.Empty_Vector, Combat_Value => 1,
Crew => Proto_Crew_Container.Empty_Vector,
Description => Null_Unbounded_String,
Owner => Factions_Container.Key(Position => Factions_List.First),
Known_Recipes => UnboundedString_Container.Empty_Vector);
Ship_Node := Item(List => Nodes_List, Index => I);
Ship_Index :=
To_Unbounded_String
(Source => Get_Attribute(Elem => Ship_Node, Name => "index"));
Action :=
(if Get_Attribute(Elem => Ship_Node, Name => "action")'Length > 0
then
Data_Action'Value
(Get_Attribute(Elem => Ship_Node, Name => "action"))
else ADD);
if Action in UPDATE | REMOVE then
if not Proto_Ships_List.Contains(Key => Ship_Index) then
raise Data_Loading_Error
with "Can't " & To_Lower(Item => Data_Action'Image(Action)) &
" ship '" & To_String(Source => Ship_Index) &
"', there is no ship with that index.";
end if;
elsif Proto_Ships_List.Contains(Key => Ship_Index) then
raise Data_Loading_Error
with "Can't add ship '" & To_String(Source => Ship_Index) &
"', there is already a ship with that index.";
end if;
if Action = REMOVE then
Proto_Ships_List.Exclude(Key => Ship_Index);
Log_Message
(Message => "Ship removed: " & To_String(Source => Ship_Index),
Message_Type => EVERYTHING);
else
if Action = UPDATE then
Temp_Record := Proto_Ships_List(Ship_Index);
end if;
if Get_Attribute(Elem => Ship_Node, Name => "name")'Length > 0 then
Temp_Record.Name :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Ship_Node, Name => "name"));
end if;
Child_Nodes :=
DOM.Core.Elements.Get_Elements_By_Tag_Name
(Elem => Ship_Node, Name => "module");
Load_Modules_Loop :
for J in 0 .. Length(List => Child_Nodes) - 1 loop
Child_Node := Item(List => Child_Nodes, Index => J);
Module_Amount :=
(if Get_Attribute(Elem => Child_Node, Name => "amount") /= ""
then
Positive'Value
(Get_Attribute(Elem => Child_Node, Name => "amount"))
else 1);
Module_Index :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Child_Node, Name => "index"));
if not Modules_List.Contains(Key => Module_Index) then
raise Ships_Invalid_Data
with "Invalid module index: |" &
Get_Attribute(Elem => Child_Node, Name => "index") &
"| in " & To_String(Source => Temp_Record.Name) & ".";
end if;
Sub_Action :=
(if
Get_Attribute(Elem => Child_Node, Name => "action")'
Length >
0
then
Data_Action'Value
(Get_Attribute(Elem => Child_Node, Name => "action"))
else ADD);
if Sub_Action = ADD then
Temp_Record.Modules.Append
(New_Item => Module_Index,
Count => Count_Type(Module_Amount));
else
Find_Delete_Module_Loop :
for K in Temp_Record.Modules.Iterate loop
if Temp_Record.Modules(K) = Module_Index then
Delete_Index :=
UnboundedString_Container.To_Index(Position => K);
exit Find_Delete_Module_Loop;
end if;
end loop Find_Delete_Module_Loop;
Temp_Record.Modules.Delete
(Index => Delete_Index,
Count => Count_Type(Module_Amount));
end if;
end loop Load_Modules_Loop;
if Get_Attribute(Elem => Ship_Node, Name => "accuracy") /= "" then
Temp_Record.Accuracy(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "accuracy"));
Temp_Record.Accuracy(2) := 0;
elsif Get_Attribute(Elem => Ship_Node, Name => "minaccuracy") /=
"" then
Temp_Record.Accuracy(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "minaccuracy"));
Temp_Record.Accuracy(2) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "maxaccuracy"));
if Temp_Record.Accuracy(2) < Temp_Record.Accuracy(1) then
raise Ships_Invalid_Data
with "Can't add ship '" & To_String(Source => Ship_Index) &
"', invalid range for accuracy.";
end if;
end if;
if Get_Attribute(Elem => Ship_Node, Name => "combatai") /= "" then
Temp_Record.Combat_Ai :=
Ship_Combat_Ai'Value
(Get_Attribute(Elem => Ship_Node, Name => "combatai"));
end if;
if Get_Attribute(Elem => Ship_Node, Name => "evasion") /= "" then
Temp_Record.Evasion(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "evasion"));
Temp_Record.Evasion(2) := 0;
elsif Get_Attribute(Elem => Ship_Node, Name => "minevasion") /=
"" then
Temp_Record.Evasion(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "minevasion"));
Temp_Record.Evasion(2) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "maxevasion"));
if Temp_Record.Evasion(2) < Temp_Record.Evasion(1) then
raise Ships_Invalid_Data
with "Can't add ship '" & To_String(Source => Ship_Index) &
"', invalid range for evasion.";
end if;
end if;
if Get_Attribute(Elem => Ship_Node, Name => "loot") /= "" then
Temp_Record.Loot(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "loot"));
Temp_Record.Loot(2) := 0;
elsif Get_Attribute(Elem => Ship_Node, Name => "minloot") /=
"" then
Temp_Record.Loot(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "minloot"));
Temp_Record.Loot(2) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "maxloot"));
if Temp_Record.Loot(2) < Temp_Record.Loot(1) then
raise Ships_Invalid_Data
with "Can't add ship '" & To_String(Source => Ship_Index) &
"', invalid range for loot.";
end if;
end if;
if Get_Attribute(Elem => Ship_Node, Name => "perception") /=
"" then
Temp_Record.Perception(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "perception"));
Temp_Record.Perception(2) := 0;
elsif Get_Attribute(Elem => Ship_Node, Name => "minperception") /=
"" then
Temp_Record.Perception(1) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "minperception"));
Temp_Record.Perception(2) :=
Integer'Value
(Get_Attribute(Elem => Ship_Node, Name => "maxperception"));
if Temp_Record.Perception(2) < Temp_Record.Perception(1) then
raise Ships_Invalid_Data
with "Can't add ship '" & To_String(Source => Ship_Index) &
"', invalid range for perception.";
end if;
end if;
Child_Nodes :=
DOM.Core.Elements.Get_Elements_By_Tag_Name
(Elem => Ship_Node, Name => "cargo");
Load_Cargo_Loop :
for J in 0 .. Length(List => Child_Nodes) - 1 loop
Child_Node := Item(List => Child_Nodes, Index => J);
Item_Index :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Child_Node, Name => "index"));
if not Items_List.Contains(Key => Item_Index) then
raise Ships_Invalid_Data
with "Invalid item index: |" &
Get_Attribute(Elem => Child_Node, Name => "index") &
"| in " & To_String(Source => Temp_Record.Name) & ".";
end if;
Sub_Action :=
(if
Get_Attribute(Elem => Child_Node, Name => "action")'
Length >
0
then
Data_Action'Value
(Get_Attribute(Elem => Child_Node, Name => "action"))
else ADD);
case Sub_Action is
when ADD =>
if Get_Attribute(Elem => Child_Node, Name => "amount")'
Length =
0 then
if Integer'Value
(Get_Attribute
(Elem => Child_Node, Name => "maxamount")) <
Integer'Value
(Get_Attribute
(Elem => Child_Node, Name => "minamount")) then
raise Ships_Invalid_Data
with "Invalid amount range for item : |" &
Get_Attribute
(Elem => Child_Node, Name => "index") &
"| in " & To_String(Source => Temp_Record.Name) &
".";
end if;
Temp_Record.Cargo.Append
(New_Item =>
(ProtoIndex => Item_Index,
MinAmount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "minamount")),
MaxAmount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "maxamount"))));
else
Temp_Record.Cargo.Append
(New_Item =>
(ProtoIndex => Item_Index,
MinAmount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node, Name => "amount")),
MaxAmount => 0));
end if;
when UPDATE =>
Update_Cargo_Loop :
for Item of Temp_Record.Cargo loop
if Item.ProtoIndex = Item_Index then
if Get_Attribute
(Elem => Child_Node, Name => "amount")'
Length =
0 then
if Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "maxamount")) <
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "minamount")) then
raise Ships_Invalid_Data
with "Invalid amount range for item : |" &
Get_Attribute
(Elem => Child_Node, Name => "index") &
"| in " &
To_String(Source => Temp_Record.Name) & ".";
end if;
Item :=
(ProtoIndex => Item_Index,
MinAmount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "minamount")),
MaxAmount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "maxamount")));
else
Item :=
(ProtoIndex => Item_Index,
MinAmount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "amount")),
MaxAmount => 0);
end if;
exit Update_Cargo_Loop;
end if;
end loop Update_Cargo_Loop;
when REMOVE =>
Remove_Cargo_Block :
declare
Delete_Cargo_Index: Natural := 0;
begin
Find_Delete_Cargo_Loop :
for K in
Temp_Record.Cargo.First_Index ..
Temp_Record.Cargo.Last_Index loop
if Temp_Record.Cargo(K).ProtoIndex = Item_Index then
Delete_Cargo_Index := K;
exit Find_Delete_Cargo_Loop;
end if;
end loop Find_Delete_Cargo_Loop;
if Delete_Cargo_Index > 0 then
Temp_Record.Cargo.Delete
(Index => Delete_Cargo_Index);
end if;
end Remove_Cargo_Block;
end case;
end loop Load_Cargo_Loop;
if Get_Attribute(Elem => Ship_Node, Name => "owner") /= "" then
Temp_Record.Owner :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Ship_Node, Name => "owner"));
end if;
Child_Nodes :=
DOM.Core.Elements.Get_Elements_By_Tag_Name
(Elem => Ship_Node, Name => "recipe");
Load_Known_Recipes_Loop :
for J in 0 .. Length(List => Child_Nodes) - 1 loop
Recipe_Index :=
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Item(List => Child_Nodes, Index => J),
Name => "index"));
if not Recipes_List.Contains(Key => Recipe_Index) then
raise Ships_Invalid_Data
with "Invalid recipe index: |" &
Get_Attribute
(Elem => Item(List => Child_Nodes, Index => J),
Name => "index") &
"| in " & To_String(Source => Temp_Record.Name) & ".";
end if;
Sub_Action :=
(if
Get_Attribute(Elem => Child_Node, Name => "action")'
Length >
0
then
Data_Action'Value
(Get_Attribute(Elem => Child_Node, Name => "action"))
else ADD);
if Sub_Action = ADD then
Temp_Record.Known_Recipes.Append(New_Item => Recipe_Index);
else
Find_Delete_Recipe_Loop :
for K in Temp_Record.Known_Recipes.Iterate loop
if Temp_Record.Known_Recipes(K) = Recipe_Index then
Delete_Index :=
UnboundedString_Container.To_Index(Position => K);
exit Find_Delete_Recipe_Loop;
end if;
end loop Find_Delete_Recipe_Loop;
Temp_Record.Known_Recipes.Delete(Index => Delete_Index);
end if;
end loop Load_Known_Recipes_Loop;
Child_Nodes :=
DOM.Core.Elements.Get_Elements_By_Tag_Name
(Elem => Ship_Node, Name => "member");
Load_Crew_Loop :
for J in 0 .. Length(List => Child_Nodes) - 1 loop
Child_Node := Item(List => Child_Nodes, Index => J);
Mob_Index :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Child_Node, Name => "index"));
if not ProtoMobs_List.Contains(Key => Mob_Index) then
raise Ships_Invalid_Data
with "Invalid mob index: |" &
Get_Attribute(Elem => Child_Node, Name => "index") &
"| in " & To_String(Source => Temp_Record.Name) & ".";
end if;
Sub_Action :=
(if
Get_Attribute(Elem => Child_Node, Name => "action")'
Length >
0
then
Data_Action'Value
(Get_Attribute(Elem => Child_Node, Name => "action"))
else ADD);
case Sub_Action is
when ADD =>
if Get_Attribute(Elem => Child_Node, Name => "amount") /=
"" then
Temp_Record.Crew.Append
(New_Item =>
(Proto_Index => Mob_Index,
Min_Amount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node, Name => "amount")),
Max_Amount => 0));
elsif Get_Attribute
(Elem => Child_Node, Name => "minamount") /=
"" then
if Integer'Value
(Get_Attribute
(Elem => Child_Node, Name => "maxamount")) <
Integer'Value
(Get_Attribute
(Elem => Child_Node, Name => "minamount")) then
raise Ships_Invalid_Data
with "Invalid amount range for member : |" &
Get_Attribute
(Elem => Child_Node, Name => "index") &
"| in " & To_String(Source => Temp_Record.Name) &
".";
end if;
Temp_Record.Crew.Append
(New_Item =>
(Proto_Index => Mob_Index,
Min_Amount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "minamount")),
Max_Amount =>
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "maxamount"))));
else
Temp_Record.Crew.Append
(New_Item =>
(Proto_Index => Mob_Index, Min_Amount => 1,
Max_Amount => 0));
end if;
when UPDATE =>
Update_Crew_Loop :
for Member of Temp_Record.Crew loop
if Member.Proto_Index = Mob_Index then
if Get_Attribute
(Elem => Child_Node, Name => "amount") /=
"" then
Member.Min_Amount :=
Integer'Value
(Get_Attribute
(Elem => Child_Node, Name => "amount"));
Member.Max_Amount := 0;
elsif Get_Attribute
(Elem => Child_Node, Name => "minamount") /=
"" then
if Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "maxamount")) <
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "minamount")) then
raise Ships_Invalid_Data
with "Invalid amount range for member : |" &
Get_Attribute
(Elem => Child_Node, Name => "index") &
"| in " &
To_String(Source => Temp_Record.Name) & ".";
end if;
Member.Min_Amount :=
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "minamount"));
Member.Max_Amount :=
Integer'Value
(Get_Attribute
(Elem => Child_Node,
Name => "maxamount"));
else
Member.Min_Amount := 1;
Member.Max_Amount := 0;
end if;
exit Update_Crew_Loop;
end if;
end loop Update_Crew_Loop;
when REMOVE =>
Find_Delete_Crew_Loop :
for K in Temp_Record.Crew.Iterate loop
if Temp_Record.Crew(K).Proto_Index = Mob_Index then
Delete_Index :=
Proto_Crew_Container.To_Index(Position => K);
exit Find_Delete_Crew_Loop;
end if;
end loop Find_Delete_Crew_Loop;
Temp_Record.Crew.Delete(Index => Delete_Index);
end case;
end loop Load_Crew_Loop;
Child_Nodes :=
DOM.Core.Elements.Get_Elements_By_Tag_Name
(Elem => Ship_Node, Name => "description");
if Length(List => Child_Nodes) > 0 then
Temp_Record.Description :=
To_Unbounded_String
(Source =>
Node_Value
(N =>
First_Child
(N => Item(List => Child_Nodes, Index => 0))));
end if;
Count_Combat_Value_Loop :
for Module_Index2 of Temp_Record.Modules loop
case Modules_List(Module_Index2).MType is
when HULL | GUN | BATTERING_RAM =>
--## rule off SIMPLIFIABLE_EXPRESSIONS
Temp_Record.Combat_Value :=
Temp_Record.Combat_Value +
Modules_List(Module_Index2).Durability +
(Modules_List(Module_Index2).MaxValue * 10);
--## rule on SIMPLIFIABLE_EXPRESSIONS
if Modules_List(Module_Index2).MType = GUN then
Count_Ammo_Value
(Item_Type_Index =>
Modules_List(Module_Index2).Value,
Multiple => 10);
end if;
when ARMOR =>
Temp_Record.Combat_Value :=
Temp_Record.Combat_Value +
Modules_List(Module_Index2).Durability;
when HARPOON_GUN =>
--## rule off SIMPLIFIABLE_EXPRESSIONS
Temp_Record.Combat_Value :=
Temp_Record.Combat_Value +
Modules_List(Module_Index2).Durability +
(Modules_List(Module_Index2).MaxValue * 5);
--## rule on SIMPLIFIABLE_EXPRESSIONS
Count_Ammo_Value
(Item_Type_Index => Modules_List(Module_Index2).Value,
Multiple => 5);
when others =>
null;
end case;
end loop Count_Combat_Value_Loop;
Temp_Record.Combat_Value := Temp_Record.Combat_Value - 1;
if Action = UPDATE then
Proto_Ships_List(Ship_Index) := Temp_Record;
else
Proto_Ships_List.Include
(Key => Ship_Index, New_Item => Temp_Record);
Log_Message
(Message =>
"Ship added: " & To_String(Source => Temp_Record.Name),
Message_Type => EVERYTHING);
end if;
end if;
end loop Load_Proto_Ships_Loop;
end Load_Ships;
function Count_Ship_Weight(Ship: Ship_Record) return Positive is
Weight: Natural := 0;
Cargo_Weight: Positive := 1;
begin
Count_Ship_Weight_Loop :
for Module of Ship.Modules loop
Weight := Weight + Module.Weight;
end loop Count_Ship_Weight_Loop;
Count_Cargo_Weight_Loop :
for Item of Ship.Cargo loop
Cargo_Weight := Item.Amount * Items_List(Item.ProtoIndex).Weight;
Weight := Weight + Cargo_Weight;
end loop Count_Cargo_Weight_Loop;
return Weight;
end Count_Ship_Weight;
function Generate_Ship_Name
(Owner: Unbounded_String) return Unbounded_String is
New_Name: Unbounded_String := Null_Unbounded_String;
begin
Generate_Ship_Name_Loop :
for I in Factions_List.Iterate loop
if Factions_Container.Key(Position => I) /= Owner then
goto End_Of_Generate_Name_Loop;
end if;
if Factions_List(I).NamesType = ROBOTIC then
New_Name := Generate_Robotic_Name;
else
New_Name :=
Ship_Syllables_Start
(Get_Random
(Min => Ship_Syllables_Start.First_Index,
Max => Ship_Syllables_Start.Last_Index));
if Get_Random(Min => 1, Max => 100) < 51 then
Append
(Source => New_Name,
New_Item =>
Ship_Syllables_Middle
(Get_Random
(Min => Ship_Syllables_Middle.First_Index,
Max => Ship_Syllables_Middle.Last_Index)));
end if;
Append
(Source => New_Name,
New_Item =>
Ship_Syllables_End
(Get_Random
(Min => Ship_Syllables_End.First_Index,
Max => Ship_Syllables_End.Last_Index)));
end if;
exit Generate_Ship_Name_Loop;
<<End_Of_Generate_Name_Loop>>
end loop Generate_Ship_Name_Loop;
return New_Name;
end Generate_Ship_Name;
function Count_Combat_Value return Natural is
Combat_Value: Natural := 0;
procedure Count_Ammo_Value(Item_Type_Index, Multiple: Positive) is
begin
Count_Ammo_Value_Loop :
for Item of Player_Ship.Cargo loop
if Items_List(Item.ProtoIndex).IType =
Items_Types(Item_Type_Index) then
--## rule off SIMPLIFIABLE_EXPRESSIONS
Combat_Value :=
Combat_Value +
(Items_List(Item.ProtoIndex).Value(1) * Multiple);
--## rule on SIMPLIFIABLE_EXPRESSIONS
end if;
end loop Count_Ammo_Value_Loop;
end Count_Ammo_Value;
begin
Count_Combat_Value_Loop :
for Module of Player_Ship.Modules loop
case Modules_List(Module.Proto_Index).MType is
when BATTERING_RAM =>
--## rule off SIMPLIFIABLE_EXPRESSIONS
Combat_Value :=
Combat_Value + Module.Max_Durability + (Module.Damage2 * 10);
--## rule on SIMPLIFIABLE_EXPRESSIONS
when GUN =>
--## rule off SIMPLIFIABLE_EXPRESSIONS
Combat_Value :=
Combat_Value + Module.Max_Durability + (Module.Damage * 10);
--## rule on SIMPLIFIABLE_EXPRESSIONS
Count_Ammo_Value
(Item_Type_Index => Modules_List(Module.Proto_Index).Value,
Multiple => 10);
when ARMOR =>
Combat_Value := Combat_Value + Module.Max_Durability;
when HARPOON_GUN =>
--## rule off SIMPLIFIABLE_EXPRESSIONS
Combat_Value :=
Combat_Value + Module.Max_Durability + (Module.Duration * 5);
--## rule on SIMPLIFIABLE_EXPRESSIONS
Count_Ammo_Value
(Item_Type_Index => Modules_List(Module.Proto_Index).Value,
Multiple => 5);
when HULL =>
--## rule off SIMPLIFIABLE_EXPRESSIONS
Combat_Value :=
Combat_Value + Module.Max_Durability +
(Module.Max_Modules * 10);
--## rule on SIMPLIFIABLE_EXPRESSIONS
when others =>
null;
end case;
end loop Count_Combat_Value_Loop;
return Combat_Value;
end Count_Combat_Value;
function Get_Cabin_Quality(Quality: Natural) return String is
begin
case Quality is
when 0 .. 10 =>
return "Empty room";
when 11 .. 20 =>
return "Minimal quality";
when 21 .. 30 =>
return "Basic quality";
when 31 .. 40 =>
return "Second class";
when 41 .. 50 =>
return "Medium quality";
when 51 .. 60 =>
return "First class";
when 61 .. 70 =>
return "Extended quality";
when 71 .. 80 =>
return "Encrusted room";
when 81 .. 90 =>
return "Luxury quality";
when others =>
return "Palace room";
end case;
end Get_Cabin_Quality;
procedure Damage_Module
(Ship: in out Ship_Record; Module_Index: Modules_Container.Extended_Index;
Damage: Positive; Death_Reason: String) is
use Ships.Crew;
Real_Damage: Natural := Damage;
Weapon_Index: Natural := 0;
procedure Remove_Gun(Module_Index2: Positive) is
begin
if Ship.Modules(Module_Index2).Owner(1) > 0 then
Death
(MemberIndex => Ship.Modules(Module_Index2).Owner(1),
Reason => To_Unbounded_String(Source => Death_Reason),
Ship => Ship);
end if;
end Remove_Gun;
begin
if Damage > Ship.Modules(Module_Index).Durability then
Real_Damage := Ship.Modules(Module_Index).Durability;
end if;
Ship.Modules(Module_Index).Durability :=
Ship.Modules(Module_Index).Durability - Real_Damage;
if Ship.Modules(Module_Index).Durability = 0 then
case Modules_List(Ship.Modules(Module_Index).Proto_Index).MType is
when HULL | ENGINE =>
if Ship = Player_Ship then
Death
(MemberIndex => 1,
Reason => To_Unbounded_String(Source => Death_Reason),
Ship => Player_Ship);
end if;
when TURRET =>
Weapon_Index := Ship.Modules(Module_Index).Gun_Index;
if Weapon_Index > 0 then
Ship.Modules(Weapon_Index).Durability := 0;
Remove_Gun(Module_Index2 => Weapon_Index);
end if;
when GUN =>
Remove_Gun(Module_Index2 => Module_Index);
when CABIN =>
Kill_Owners_Loop :
for Owner of Ship.Modules(Module_Index).Owner loop
if Owner > 0 and then Ship.Crew(Owner).Order = Rest then
Death
(MemberIndex => Owner,
Reason => To_Unbounded_String(Source => Death_Reason),
Ship => Ship);
end if;
end loop Kill_Owners_Loop;
when others =>
if Ship.Modules(Module_Index).Owner.Length > 0 then
if Ship.Modules(Module_Index).Owner(1) > 0
and then
Ship.Crew(Ship.Modules(Module_Index).Owner(1)).Order /=
Rest then
Death
(MemberIndex => Ship.Modules(Module_Index).Owner(1),
Reason => To_Unbounded_String(Source => Death_Reason),
Ship => Ship);
end if;
end if;
end case;
end if;
end Damage_Module;
end Ships;
|
lib/target/rx78/classic/rx78_crt0.asm | ahjelm/z88dk | 640 | 97849 | ; Bandai RX78 CRT0
;
MODULE rx78_crt0
;--------
; Include zcc_opt.def to find out some info
;--------
defc crt0 = 1
INCLUDE "zcc_opt.def"
;--------
; Some scope definitions
;--------
EXTERN _main ; main() is always external to crt0 code
PUBLIC cleanup ; jp'd to by exit()
PUBLIC l_dcal ; jp(hl)
;--------
; Set an origin for the application (-zorg=) default to 32768
;--------
defc CRT_ORG_CODE = 0x2000
defc CRT_ORG_BSS = 0xb000
defc CONSOLE_ROWS = 23
defc CONSOLE_COLUMNS = 24
defc TAR__fputc_cons_generic = 1
defc TAR__clib_exit_stack_size = 0
defc TAR__register_sp = 0xebff
defc __CPU_CLOCK = 4090909
INCLUDE "crt/classic/crt_rules.inc"
org CRT_ORG_CODE
defb 0x01
defb 0
defb 0
start:
di
INCLUDE "crt/classic/crt_init_sp.asm"
INCLUDE "crt/classic/crt_init_atexit.asm"
ld hl,interrupt
ld (0xe788),hl ;RAM interrupt vector
call crt0_init_bss
ei
; Optional definition for auto MALLOC init
; it assumes we have free space between the end of
; the compiled program and the stack pointer
IF DEFINED_USING_amalloc
INCLUDE "crt/classic/crt_init_amalloc.asm"
ENDIF
call _main ; Call user program
cleanup:
push hl ; return code
call crt0_exit
cleanup_exit:
pop bc ; return code (still not sure it is teh right one !)
end: jp 0
interrupt:
ei
ret
l_dcal: jp (hl) ;Used for function pointer calls
INCLUDE "crt/classic/crt_runtime_selection.asm"
defc __crt_org_bss = CRT_ORG_BSS
IF DEFINED_CRT_MODEL
defc __crt_model = CRT_MODEL
ELSE
defc __crt_model = 1
ENDIF
INCLUDE "crt/classic/crt_section.asm"
|
04/fill/Fill.asm | ivan726/Construccion-de-una-maquina-computacional-y-sus-implicaciones-con-el-compilador | 0 | 9000 | // This file is part of www.nand2tetris.org
// and the book "The Elements of Computing Systems"
// by <NAME> Schocken, MIT Press.
// File name: projects/04/Fill.asm
// Runs an infinite loop that listens to the keyboard input.
// When a key is pressed (any key), the program blackens the screen,
// i.e. writes "black" in every pixel;
// the screen should remain fully black as long as the key is pressed.
// When no key is pressed, the program clears the screen, i.e. writes
// "white" in every pixel;
// the screen should remain fully clear as long as no key is pressed.
// Put your code here.
(start)
@8191
D=A
@i
M=D
(loop)
@KBD
D=M
@write
D;JNE
@clean
D;JEQ
(write)
@i
D=M
@SCREEN
A=A+D
M=-1
@out
0;JMP
(clean)
@i
D=M
@SCREEN
A=A+D
M=0
@out
0;JMP
(out)
@i
MD=M-1
@loop
D;JGE
@start
0;JMP
|
source/contexts/plain/program-plain_lexical_elements.ads | reznikmm/gela | 0 | 1278 | <gh_stars>0
-- SPDX-FileCopyrightText: 2019 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Source_Buffers;
with Program.Symbols;
private with Ada.Containers.Vectors;
package Program.Plain_Lexical_Elements is
pragma Preelaborate;
type Lexical_Element (<>) is new Program.Lexical_Elements.Lexical_Element
with private;
function Symbol (Self : Lexical_Element'Class)
return Program.Symbols.Symbol;
type Line_Buffer is limited interface;
not overriding function Text
(Self : Line_Buffer;
Span : Program.Source_Buffers.Span) return Program.Text is abstract;
not overriding procedure Get_Span
(Self : Line_Buffer;
Span : Program.Source_Buffers.Span;
From_Line : out Positive;
To_Line : out Positive;
From_Column : out Positive;
To_Column : out Positive) is abstract;
type Line_Buffer_Access is access all Line_Buffer'Class
with Storage_Size => 0;
type Lexical_Element_Vector (Buffer : not null Line_Buffer_Access)
is limited
new Program.Lexical_Elements.Lexical_Element_Vector with private;
not overriding procedure Append
(Self : aliased in out Lexical_Element_Vector;
Span : Program.Source_Buffers.Span;
Kind : Program.Lexical_Elements.Lexical_Element_Kind;
Symbol : Program.Symbols.Symbol);
private
type Lexical_Element_Vector_Access is access all Lexical_Element_Vector
with Storage_Size => 0;
type Lexical_Element
(Vector : Lexical_Element_Vector_Access)
is new Program.Lexical_Elements.Lexical_Element with
record
Span : Program.Source_Buffers.Span;
Kind : Program.Lexical_Elements.Lexical_Element_Kind;
Symbol : Program.Symbols.Symbol;
end record;
overriding function Image (Self : Lexical_Element) return Program.Text;
overriding function Kind (Self : Lexical_Element)
return Program.Lexical_Elements.Lexical_Element_Kind;
overriding function From
(Self : Lexical_Element) return Program.Lexical_Elements.Location;
package Vectors is new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Program.Lexical_Elements.Lexical_Element_Access,
"=" => Program.Lexical_Elements."=");
type Lexical_Element_Vector (Buffer : not null Line_Buffer_Access) is
limited new Program.Lexical_Elements.Lexical_Element_Vector with
record
Vector : Vectors.Vector;
end record;
overriding function First_Index (Self : Lexical_Element_Vector)
return Positive is (1);
overriding function Last_Index (Self : Lexical_Element_Vector)
return Positive;
overriding function Element
(Self : Lexical_Element_Vector;
Index : Positive)
return not null Program.Lexical_Elements.Lexical_Element_Access;
end Program.Plain_Lexical_Elements;
|
Reverse/babyvm/coding/vm.asm | scnu-sloth/hsctf-2021-trial | 1 | 170960 | mov r1, 0
mov [r1], xxx
inc r1
...
mov r1, 0
mov r2, getchar()
push r2
inc r1
cmp r1, 32
jnz 7
mov r1, 0
add [r1], 64
inc r1
cmp r1, 32
jnz 14
mov r1, 64
pop r2
sub r1, 1
mov [r1], r2
cmp r1, 32
jnz 20
mov r1, 32
mov r2, r1
sub r2, 32
xor [r1], r2
inc r1
cmp r1, 64
jnz 27
mov r1, 32
add [r1], 32
inc r1
cmp r1, 64
jnz 35
mov r1, 0
mov r2, 32
xor [r1], 0xCC
cmp [r1], [r2]
jnz 51
inc r1
inc r2
cmp r1, 32
jnz 42
puts("Right!")
jmp 52
puts("Wrong!")
exit |
tests/src/main_framed.adb | skade/bbqueue-spark | 8 | 20272 | with Ada.Text_IO; use Ada.Text_IO;
with System.Storage_Elements; use System.Storage_Elements;
with BBqueue;
with BBqueue.Buffers.framed;
with System; use System;
procedure Main_Framed
with SPARK_Mode
is
use type BBqueue.Result_Kind;
Q : aliased BBqueue.Buffers.framed.Framed_Buffer (60);
procedure Fill_With_CB (Request, Actual : BBqueue.Count;
Val : Storage_Element);
procedure Print_Content_With_CB;
------------------
-- Fill_With_CB --
------------------
procedure Fill_With_CB (Request, Actual : BBqueue.Count; Val : Storage_Element) is
pragma SPARK_Mode (Off);
procedure Process_Write (Data : out Storage_Array; To_Commit : out BBqueue.Count);
procedure Process_Write (Data : out Storage_Array; To_Commit : out BBqueue.Count) is
begin
Put_Line ("Fill" & Actual'Img & " bytes.");
Data (Data'First .. Data'First + Actual - 1) := (others => Val);
To_Commit := Actual;
end Process_Write;
procedure Write is new BBqueue.Buffers.framed.Write_CB (Process_Write);
Result : BBqueue.Result_Kind;
begin
Write (Q, Request, Result);
if Result /= BBqueue.Valid then
Put_Line ("Write failed: " & Result'Img);
end if;
end Fill_With_CB;
---------------------------
-- Print_Content_With_CB --
---------------------------
procedure Print_Content_With_CB is
procedure Process_Read (Data : Storage_Array);
procedure Process_Read (Data : Storage_Array) is
begin
Put ("Print" & Data'Length'Img & " bytes -> ");
for Elt of Data loop
Put (Elt'Img);
end loop;
New_Line;
end Process_Read;
procedure Read is new BBqueue.Buffers.framed.Read_CB (Process_Read);
Result : BBqueue.Result_Kind;
begin
Read (Q, Result);
if Result /= BBqueue.Valid then
Put_Line ("Read failed: " & Result'Img);
end if;
end Print_Content_With_CB;
V : Storage_Element := 1;
begin
Put_Line ("Count'Object_Size:" & BBqueue.Count'Object_Size'Img);
for X in BBqueue.Count range 1 .. 4 loop
Put_Line ("-- Loop" & X'Img & " --");
Fill_With_CB (10, X, V);
Fill_With_CB (20, X * 2, V * 2);
V := V + 1;
Print_Content_With_CB;
Print_Content_With_CB;
end loop;
end Main_Framed;
|
tests/all_servers.adb | faelys/simple-webapps | 1 | 3567 | <reponame>faelys/simple-webapps
------------------------------------------------------------------------------
-- Copyright (c) 2014-2016, <NAME> --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Containers.Indefinite_Doubly_Linked_Lists;
with Ada.Text_IO;
with AWS.Config;
with AWS.Dispatchers;
with AWS.Server;
with AWS.Services.Dispatchers.Virtual_Host;
with Natools.S_Expressions.File_Readers;
with Natools.S_Expressions.Interpreter_Loop;
with Natools.S_Expressions.Lockable;
with Syslog.Guess.App_Name;
with Syslog.Guess.Hostname;
with Syslog.Transport.Send_Task;
with Syslog.Transport.UDP;
with Simple_Webapps.Append_Servers;
with Simple_Webapps.Upload_Servers;
procedure All_Servers is
package String_Lists is new Ada.Containers.Indefinite_Doubly_Linked_Lists
(String);
procedure Register
(Dispatcher : in out AWS.Services.Dispatchers.Virtual_Host.Handler;
Host_List : in String_Lists.List;
Action : in AWS.Dispatchers.Handler'Class);
procedure Execute
(State : in out AWS.Services.Dispatchers.Virtual_Host.Handler;
Context : in Boolean;
Name : in Natools.S_Expressions.Atom;
Arguments : in out Natools.S_Expressions.Lockable.Descriptor'Class);
procedure Interpreter is new Natools.S_Expressions.Interpreter_Loop
(AWS.Services.Dispatchers.Virtual_Host.Handler, Boolean, Execute);
procedure Execute
(State : in out AWS.Services.Dispatchers.Virtual_Host.Handler;
Context : in Boolean;
Name : in Natools.S_Expressions.Atom;
Arguments : in out Natools.S_Expressions.Lockable.Descriptor'Class)
is
package Sx renames Natools.S_Expressions;
use type Natools.S_Expressions.Events.Event;
S_Name : constant String := Sx.To_String (Name);
Hosts : String_Lists.List;
Event : Sx.Events.Event := Arguments.Current_Event;
begin
while Event = Sx.Events.Add_Atom loop
String_Lists.Append (Hosts, Sx.To_String (Arguments.Current_Atom));
Arguments.Next (Event);
end loop;
if String_Lists.Is_Empty (Hosts) then
return;
end if;
if S_Name = "upload" or S_Name = "upload-server" then
declare
Handler : Simple_Webapps.Upload_Servers.Handler;
begin
Handler.Reset (Arguments, Context);
Register (State, Hosts, Handler);
end;
elsif S_Name = "append" or S_Name = "append-server" then
declare
Handler : Simple_Webapps.Append_Servers.Handler;
begin
Handler.Reset (Arguments, Ada.Command_Line.Argument (1));
Register (State, Hosts, Handler);
end;
end if;
end Execute;
procedure Register
(Dispatcher : in out AWS.Services.Dispatchers.Virtual_Host.Handler;
Host_List : in String_Lists.List;
Action : in AWS.Dispatchers.Handler'Class)
is
Cursor : String_Lists.Cursor := Host_List.First;
begin
while String_Lists.Has_Element (Cursor) loop
if String_Lists.Element (Cursor) = "" then
Dispatcher.Register_Default_Callback (Action);
else
Dispatcher.Register (String_Lists.Element (Cursor), Action);
end if;
String_Lists.Next (Cursor);
end loop;
end Register;
WS : AWS.Server.HTTP;
Handler : AWS.Services.Dispatchers.Virtual_Host.Handler;
Debug : constant Boolean := Ada.Command_Line.Argument_Count >= 2;
begin
if Ada.Command_Line.Argument_Count < 1 then
Ada.Text_IO.Put_Line
(Ada.Text_IO.Current_Error,
"Usage: " & Ada.Command_Line.Command_Name & " servers.sx");
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
return;
end if;
if Debug then
Simple_Webapps.Upload_Servers.Log := Ada.Text_IO.Put_Line'Access;
else
Syslog.Guess.App_Name;
Syslog.Guess.Hostname;
Syslog.Transport.UDP.Connect ("127.0.0.1");
Syslog.Transport.Send_Task.Set_Backend (Syslog.Transport.UDP.Transport);
Syslog.Set_Transport (Syslog.Transport.Send_Task.Transport);
Syslog.Set_Default_Facility (Syslog.Facilities.Daemon);
Syslog.Set_Default_Severity (Syslog.Severities.Notice);
Simple_Webapps.Upload_Servers.Log := Syslog.Log'Access;
end if;
Read_Config :
declare
Reader : Natools.S_Expressions.File_Readers.S_Reader;
begin
Reader.Set_Filename (Ada.Command_Line.Argument (1));
Interpreter (Reader, Handler, Debug);
end Read_Config;
AWS.Server.Start (WS, Handler, AWS.Config.Get_Current);
if Debug then
Ada.Text_IO.Put_Line ("Websever started");
AWS.Server.Wait (AWS.Server.Q_Key_Pressed);
else
AWS.Server.Wait;
end if;
AWS.Server.Shutdown (WS);
end All_Servers;
|
oeis/293/A293405.asm | neoneye/loda-programs | 11 | 86734 | ; A293405: The integer k that minimizes |k/n^2 - tau^2|, where tau = (1+sqrt(5))/2 (golden ratio).
; 0,3,10,24,42,65,94,128,168,212,262,317,377,442,513,589,670,757,848,945,1047,1155,1267,1385,1508,1636,1770,1909,2053,2202,2356,2516,2681,2851,3026,3207,3393,3584,3780,3982,4189,4401,4618,4841,5069,5302,5540,5783,6032,6286,6545,6810,7079,7354,7634,7920,8210,8506,8807,9113,9425,9742,10064,10391,10723,11061,11404,11752,12106,12464,12828,13198,13572,13952,14336,14726,15122,15522,15928,16339,16755,17177,17604,18036,18473,18915,19363,19816,20274,20737,21206,21680,22159,22643,23133,23628,24128,24633
mov $2,$0
seq $0,293402 ; The integer k that minimizes |k/n^2 - tau|, where tau = (1+sqrt(5))/2 (golden ratio).
mov $3,$2
mul $3,$2
add $0,$3
|
tier-1/gmp/source/gmp.ads | charlie5/cBound | 2 | 10303 | <reponame>charlie5/cBound<gh_stars>1-10
package GMP
--
--
--
is
end GMP;
|
e0301.asm | zhangyuesai/8086-asm-learning-code | 1 | 24739 | <gh_stars>1-10
assume cs:codesg
codesg segment
mov ax,2000H
mov ss,ax
mov sp,0
add sp,10
pop ax
pop bx
push ax
push bx
pop ax
pop bx
mov ax,4c00H
int 21H
codesg ends
end |
oeis/091/A091096.asm | neoneye/loda-programs | 11 | 177586 | <filename>oeis/091/A091096.asm
; A091096: Expansion of (1+5x-40x^2)/((1-5x)(1+5x)).
; Submitted by <NAME>(w2)
; 1,5,-15,125,-375,3125,-9375,78125,-234375,1953125,-5859375,48828125,-146484375,1220703125,-3662109375,30517578125,-91552734375,762939453125,-2288818359375,19073486328125,-57220458984375,476837158203125,-1430511474609375
mov $2,-1
mov $3,$0
mov $5,1
lpb $3
sub $4,1
div $2,$4
sub $3,1
add $4,1
trn $5,$2
mul $2,5
add $5,$2
lpe
mov $0,$5
|
examples/stm32f40x/src/app.adb | jonashaggstrom/ada-canopen | 6 | 19864 | with Ada.Real_Time;
with ACO.Drivers.Stm32f40x;
with STM32.Device;
with ACO.Nodes;
with ACO.OD.Example;
with ACO.CANopen;
with ACO.Nodes.Remotes;
with ACO.OD_Types;
with ACO.OD_Types.Entries;
with ACO.SDO_Sessions;
package body App is
D : aliased ACO.Drivers.Stm32f40x.CAN_Driver (STM32.Device.CAN_1'Access);
H : aliased ACO.CANopen.Handler (Driver => D'Access);
T : ACO.CANopen.Periodic_Task (H'Access, 10);
O : aliased ACO.OD.Example.Dictionary;
procedure Run
is
use Ada.Real_Time;
N : aliased ACO.Nodes.Remotes.Remote (Id => 1, Handler => H'Access, Od => O'Access);
Next_Release : Time := Clock;
begin
D.Initialize;
N.Start;
loop
-- H.Periodic_Actions (T_Now => Next_Release);
declare
use ACO.OD_Types.Entries;
An_Entry : constant Entry_U8 :=
Create (Accessability => ACO.OD_Types.RW,
Data => 0);
Req : ACO.Nodes.Remotes.SDO_Write_Request (N'Access);
Result : ACO.Nodes.Remotes.SDO_Result;
begin
N.Write (Request => Req,
Index => 16#1000#,
Subindex => 1,
An_Entry => An_Entry);
Req.Suspend_Until_Result (Result);
case Req.Status is
when ACO.SDO_Sessions.Complete =>
null;
when ACO.SDO_Sessions.Error =>
null;
when ACO.SDO_Sessions.Pending =>
null;
end case;
end;
Next_Release := Next_Release + Milliseconds (10);
delay until Next_Release;
end loop;
end Run;
end App;
|
SaveAllTabs.scpt | hascong/ExerciseForAppleScript | 0 | 235 | <filename>SaveAllTabs.scpt
tell application "Google Chrome"
--
-- Set the index of window that you want to perform the job on
--
set windowIndex to 1
set index of window windowIndex to 1
--
-- Set the delay time that prevents collision between actions
--
set timeDelayInSeconds to 0.1
--
-- Find out the number of tabs in window of Google Chrome whose index is windowIndex
--
set tabIndexMax to count tabs of (first window)
--
-- repeat with t in (tabs of (first window))
--
set i to 0
repeat tabIndexMax times
set i to i + 1
delay timeDelayInSeconds
tell application "Google Chrome" to activate
delay timeDelayInSeconds
--
-- Retrieve the title of active tab in window of Google Chrome whose index is windowIndex
--
delay timeDelayInSeconds
set s to (execute (first window)'s active tab javascript "document.title") as text
delay timeDelayInSeconds
--
-- Copy title of current tab to clipboard as pure text
--
delay timeDelayInSeconds
set the clipboard to s as text
delay timeDelayInSeconds
--
-- Paste the title of current tab to Notes
--
delay timeDelayInSeconds
tell application "Notes" to activate
delay timeDelayInSeconds
tell application "System Events"
tell process "Notes"
delay timeDelayInSeconds
keystroke "v" using {command down, shift down, option down}
delay timeDelayInSeconds
-- Press return key whose key code is 36
delay timeDelayInSeconds
key code 36
delay timeDelayInSeconds
end tell
end tell
--
-- Copy the URL of current tab
--
delay timeDelayInSeconds
tell application "Google Chrome" to activate
delay timeDelayInSeconds
tell application "System Events"
tell process "Google Chrome"
delay timeDelayInSeconds
keystroke "l" using command down
delay timeDelayInSeconds
keystroke "a" using command down
delay timeDelayInSeconds
keystroke "c" using command down
delay timeDelayInSeconds
end tell
end tell
--
-- Paste the URL of current tab to Notes
--
delay timeDelayInSeconds
tell application "Notes" to activate
delay timeDelayInSeconds
tell application "System Events"
tell process "Notes"
delay timeDelayInSeconds
keystroke "v" using {command down, shift down, option down}
delay timeDelayInSeconds
-- Press return key whose key code is 36
delay timeDelayInSeconds
key code 36
delay timeDelayInSeconds
-- Press return key whose key code is 36
delay timeDelayInSeconds
key code 36
delay timeDelayInSeconds
end tell
end tell
--
-- Switch to next tab if there is a next tab on the right hand side
--
tell application "Google Chrome"
delay timeDelayInSeconds
if i ≤ tabIndexMax then set (active tab index of (first window)) to i
delay timeDelayInSeconds
end tell
end repeat
end tell
|
oeis/032/A032834.asm | neoneye/loda-programs | 11 | 8838 | <reponame>neoneye/loda-programs
; A032834: Numbers with digits 3 and 4 only.
; Submitted by <NAME>(s4)
; 3,4,33,34,43,44,333,334,343,344,433,434,443,444,3333,3334,3343,3344,3433,3434,3443,3444,4333,4334,4343,4344,4433,4434,4443,4444,33333,33334,33343,33344,33433,33434,33443,33444,34333,34334,34343,34344,34433,34434,34443,34444,43333,43334,43343,43344,43433,43434,43443,43444,44333,44334,44343,44344,44433,44434,44443,44444,333333,333334,333343,333344,333433,333434,333443,333444,334333,334334,334343,334344,334433,334434,334443,334444,343333,343334,343343,343344,343433,343434,343443,343444,344333
add $0,1
mov $2,2
lpb $0
mov $3,$0
mul $0,2
sub $0,1
div $0,4
sub $1,$2
mod $3,2
mul $3,$2
add $1,$3
mul $2,10
lpe
mul $1,3
sub $2,$1
mov $0,$2
div $0,6
|
qxl/qxl.lptp.asm | olifink/smsqe | 0 | 13892 | ; QXL_LPTP.ASM Parallel port server and setup
; check which LPT ports are available (for the moment 1-3 only) and set them up
qxl_lptp_setup:
ASSUME ds:DGROUP
push es
xor ax,ax
mov es,ax
ASSUME es:BASESEG
mov bx, OFFSET qxl_lptbuff
mov cx,-1
mov dx,cx
qls_loop:
inc cx ; next LPT
cmp cx,3 ; all done?
je qls_done
mov bp,cx
add bp,bp ; index tables
mov ax,es:add_lpt1[bp] ; address of LPTn
test ax,ax
jz qls_loop ; ... none
mov lpt_notbusy,-1 ; say ports not busy
mov dx,cx ; highest port
mov lpt_n[bp],ax ; set address
mov lpt_buff[bp],bx ; and buffer address
add bx,qxl_buffalloc
mov al,1 ; set bit
shl ax,cl
or mes1_lpt,al ; mark in setup message
or flowpc_lpt, al ; and in flow control
jmp qls_loop
qls_done:
pop es
ASSUME es:DGROUP
inc dx
test dx,dx ; highest port number 1 to n
jz qls_ret
mov lpt_maxport,dx
mov dx,pic_mask
in al,dx
or al,080h ; enable irq7 (bit 7)
out dx,al
mov cx, OFFSET qxl_lptp_server ; but install server anyway!!
mov si, OFFSET int_rq7i
call qxl_setvr ; set up server
;
; LPT reset (set) ports
;
qxl_lptp_reset:
mov lpt_notbusy,-1
mov lpt_txdata,0
mov cx,lpt_maxport
qls_resetp:
mov bp,cx
dec bp
add bp,bp
mov bx,[bp+lpt_buff]
test bx,bx
jz qls_rseloop
mov ax,qxl_buffsize
call buff_set ; set up buffer
mov [bp+lpt_room],ax ; room in buffer
qls_rseloop:
loop qls_resetp
qls_ret:
retn
;
; LPT restore ports - no state was saved, cannot restore
;
qxl_lptp_restore:
retn
;
; LPT server, in this version, the interrupt server merely marks the LPT ports as not busy
;
qxl_lptp_server:
push ds
push ax
ASSUME ds:DGROUP
mov ax, DGROUP
mov ds,ax
mov al,pic_eof ; end of interrupt
out pic_ctrl,al
mov lpt_notbusy,al ; enable printer again
pop ax
pop ds
iretf
;
; LPT open routine - for the moment NOP
;
qxl_lptp_open:
jmp qxl_rxm_loop
;
; LPT close routine - for the moment NOP
;
qxl_lptp_close:
jmp qxl_rxm_loop
;
; LPT transmit routine (called from comms server) - buffers the data in the message
;
qxl_lptp_tx:
mov bp,bx
mov cx,ax
add ax,3 ; round up
and al,0fch
add ax,si ; next message
push ax
mov bx,[bp+lpt_buff] ; buffer
test bx,bx
jz qlt_done
qlt_loop:
lodsb
call buff_pbyte ; save data
jz qlt_stop
dec [bp+lpt_room] ; less room
loop qlt_loop
cmp [bp+lpt_room],qxl_buffmin
jg qlt_data
qlt_stop:
mov al,-2
mov cx,bp
shr cx,1
shl al,cl
and flowpc_lpt,al ; clear handshake bit
mov flowpc_head,flowpc_len ; and send message
qlt_data:
mov lpt_txdata,-1 ; say that there is data in queue
qlt_done:
pop si ; next message
jmp qxl_rxm_loop
;
; LPT send routine - called from main loop to transfer data from buffer to port
; In this version the LPT port interrupt flag is not checked / cleared
;
qxl_do_lptp:
ASSUME ds:DGROUP
ASSUME es:DGROUP
xor ax,ax
mov lpt_txdata,al ; say data taken (we may reset this later)
mov cx, lpt_maxport
test cx,cx ; any ports?
jz qld_done
qld_ploop:
mov bp,cx
dec bp ; internally, ports are from 0 - maxport-1
add bp,bp
mov dx,[bp+lpt_n] ; any printer port?
test dx,dx
jz qld_eploop
qld_bloop:
inc dx ; read port status
in al,dx
dec dx
test al,al ; bit 7 high
jns qld_nready ; ... no
mov bx,[bp+lpt_buff]
call buff_gbyte ; get data byte
jz qld_ndata
inc [bp+lpt_room]
out dx,al ; send data byte
add dx,2
mov al,lpt_stblow ; and strobe
out dx,al
out dx,al
mov al,lpt_stbhigh
out dx,al
sub dx,2
jmp qld_bloop
qld_nready:
dec lpt_txdata ; there is still data to go
qld_ndata:
cmp [bp+lpt_room],qxl_buffmin
jle qld_eploop
mov al,1
dec cl
shl al,cl
inc cl
test flowpc_lpt,al
jnz qld_eploop
or flowpc_lpt,al ; set handshake bit
mov flowpc_head,flowpc_len ; and send message
qld_eploop:
loop qld_ploop
qld_done:
retn
|
test/Fail/IUnivData.agda | cagix/agda | 1,989 | 12518 | open import Agda.Primitive.Cubical
data BadData : IUniv where
|
programs/oeis/314/A314165.asm | karttu/loda | 1 | 171557 | ; A314165: Coordination sequence Gal.5.307.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,16,22,28,34,40,46,51,57,62,67,73,78,84,90,96,102,108,113,119,124,129,135,140,146,152,158,164,170,175,181,186,191,197,202,208,214,220,226,232,237,243,248,253,259,264,270,276
mov $4,$0
cal $0,313802 ; Coordination sequence Gal.6.209.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.
mov $3,2
add $3,$0
mov $1,$3
mul $1,2
div $1,3
sub $1,1
mov $2,$4
mul $2,2
add $1,$2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.