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 |
|---|---|---|---|---|
src/test/ref/test-lowhigh.asm | jbrandwood/kickc | 2 | 173991 | /// @file
/// A lightweight library for printing on the C64.
///
/// Printing with this library is done by calling print_ function for each element
// Commodore 64 PRG executable file
.file [name="test-lowhigh.prg", type="prg", segments="Program"]
.segmentdef Program [segments="Basic, Code, Data"]
.segmentdef Basic [start=$0801]
.segmentdef Code [start=$80d]
.segmentdef Data [startAfter="Code"]
.segment Basic
:BasicUpstart(main)
.label print_screen = $400
.label print_line_cursor = 6
.label print_char_cursor = 2
.label print_char_cursor_1 = 6
.label print_line_cursor_1 = 4
.segment Code
main: {
.label __3 = 8
.label __6 = 2
.label __28 = 8
.label __29 = 2
.label dw2 = $a
.label dw = $e
// print_cls()
jsr print_cls
lda #<print_screen
sta.z print_char_cursor_1
lda #>print_screen
sta.z print_char_cursor_1+1
lda #<print_screen
sta.z print_line_cursor_1
lda #>print_screen
sta.z print_line_cursor_1+1
lda #<$12345678
sta.z dw
lda #>$12345678
sta.z dw+1
lda #<$12345678>>$10
sta.z dw+2
lda #>$12345678>>$10
sta.z dw+3
__b1:
// for( dword dw = $12345678; dw != $12345690; dw++ )
lda.z dw+3
cmp #>$12345690>>$10
bne __b2
lda.z dw+2
cmp #<$12345690>>$10
bne __b2
lda.z dw+1
cmp #>$12345690
bne __b2
lda.z dw
cmp #<$12345690
bne __b2
// }
rts
__b2:
// WORD1(dw)
lda.z dw+2
sta.z __3
lda.z dw+3
sta.z __3+1
// WORD1(dw2) = WORD1(dw) + $1111
lda.z __28
clc
adc #<$1111
sta.z __28
lda.z __28+1
adc #>$1111
sta.z __28+1
lda.z dw
sta.z dw2
lda.z dw+1
sta.z dw2+1
lda.z __28
sta.z dw2+2
lda.z __28+1
sta.z dw2+3
// WORD0(dw)
lda.z dw
sta.z __6
lda.z dw+1
sta.z __6+1
// WORD0(dw2) = WORD0(dw) + $1111
lda.z __29
clc
adc #<$1111
sta.z __29
lda.z __29+1
adc #>$1111
sta.z __29+1
lda.z __29
sta.z dw2
lda.z __29+1
sta.z dw2+1
// print_ulong(dw2)
// Test set/get low word of dword
jsr print_ulong
// print_char(' ')
lda #' '
jsr print_char
// print_uint(WORD1(dw2))
lda.z dw2+2
sta.z print_uint.w
lda.z dw2+3
sta.z print_uint.w+1
jsr print_uint
// print_char(' ')
// Test get high word of dword
lda #' '
jsr print_char
// print_uint(WORD0(dw2))
lda.z dw2
sta.z print_uint.w
lda.z dw2+1
sta.z print_uint.w+1
jsr print_uint
// print_char(' ')
// Test get low word of dword
lda #' '
jsr print_char
// print_uchar(BYTE3(dw2))
ldx.z dw2+3
jsr print_uchar
// print_char(' ')
// Test get high high byte of dword
lda #' '
jsr print_char
// print_uchar(BYTE2(dw2))
ldx.z dw2+2
jsr print_uchar
// print_char(' ')
// Test get low high byte of dword
lda #' '
jsr print_char
// print_uchar(BYTE1(dw2))
ldx.z dw2+1
jsr print_uchar
// print_char(' ')
// Test get high low byte of dword
lda #' '
jsr print_char
// print_uchar(BYTE0(dw2))
ldx.z dw2
jsr print_uchar
// print_ln()
// Test get low low byte of dword
jsr print_ln
// for( dword dw = $12345678; dw != $12345690; dw++ )
inc.z dw
bne !+
inc.z dw+1
bne !+
inc.z dw+2
bne !+
inc.z dw+3
!:
lda.z print_line_cursor
sta.z print_line_cursor_1
lda.z print_line_cursor+1
sta.z print_line_cursor_1+1
jmp __b1
}
// Clear the screen. Also resets current line/char cursor.
print_cls: {
// memset(print_screen, ' ', 1000)
jsr memset
// }
rts
}
// Print a unsigned long as HEX
// void print_ulong(__zp($a) unsigned long dw)
print_ulong: {
.label dw = $a
// print_uint(WORD1(dw))
lda.z dw+2
sta.z print_uint.w
lda.z dw+3
sta.z print_uint.w+1
lda.z print_char_cursor_1
sta.z print_char_cursor
lda.z print_char_cursor_1+1
sta.z print_char_cursor+1
// print_uint(WORD1(dw))
jsr print_uint
// print_uint(WORD0(dw))
lda.z dw
sta.z print_uint.w
lda.z dw+1
sta.z print_uint.w+1
jsr print_uint
// }
rts
}
// Print a single char
// void print_char(__register(A) char ch)
print_char: {
// *(print_char_cursor++) = ch
ldy #0
sta (print_char_cursor),y
// *(print_char_cursor++) = ch;
inc.z print_char_cursor
bne !+
inc.z print_char_cursor+1
!:
// }
rts
}
// Print a unsigned int as HEX
// void print_uint(__zp(8) unsigned int w)
print_uint: {
.label w = 8
// print_uchar(BYTE1(w))
ldx.z w+1
jsr print_uchar
// print_uchar(BYTE0(w))
ldx.z w
jsr print_uchar
// }
rts
}
// Print a char as HEX
// void print_uchar(__register(X) char b)
print_uchar: {
// b>>4
txa
lsr
lsr
lsr
lsr
// print_char(print_hextab[b>>4])
tay
lda print_hextab,y
// Table of hexadecimal digits
jsr print_char
// b&$f
lda #$f
axs #0
// print_char(print_hextab[b&$f])
lda print_hextab,x
jsr print_char
// }
rts
}
// Print a newline
print_ln: {
__b1:
// print_line_cursor + $28
lda #$28
clc
adc.z print_line_cursor_1
sta.z print_line_cursor
lda #0
adc.z print_line_cursor_1+1
sta.z print_line_cursor+1
// while (print_line_cursor<print_char_cursor)
cmp.z print_char_cursor+1
bcc __b2
bne !+
lda.z print_line_cursor
cmp.z print_char_cursor
bcc __b2
!:
// }
rts
__b2:
lda.z print_line_cursor
sta.z print_line_cursor_1
lda.z print_line_cursor+1
sta.z print_line_cursor_1+1
jmp __b1
}
// Copies the character c (an unsigned char) to the first num characters of the object pointed to by the argument str.
// void * memset(void *str, char c, unsigned int num)
memset: {
.const c = ' '
.const num = $3e8
.label str = print_screen
.label end = str+num
.label dst = 6
lda #<str
sta.z dst
lda #>str
sta.z dst+1
__b1:
// for(char* dst = str; dst!=end; dst++)
lda.z dst+1
cmp #>end
bne __b2
lda.z dst
cmp #<end
bne __b2
// }
rts
__b2:
// *dst = c
lda #c
ldy #0
sta (dst),y
// for(char* dst = str; dst!=end; dst++)
inc.z dst
bne !+
inc.z dst+1
!:
jmp __b1
}
.segment Data
print_hextab: .text "0123456789abcdef"
|
src/autogenerated/textBank4.asm | jannone/westen | 49 | 83934 | <reponame>jannone/westen
; line: 'The key opened the chest.'
; size in bytes: 26
line_0:
db #19,#55,#77,#71,#00,#7c,#71,#9b,#00,#84,#86,#71,#82,#71,#6f,#00
db #8e,#77,#71,#00,#6d,#77,#71,#8c,#8e,#14
end_line_0:
; line: 'The door opened! I thought I was'
; size in bytes: 33
line_1:
db #20,#55,#77,#71,#00,#6f,#84,#84,#8a,#00,#84,#86,#71,#82,#71,#6f
db #02,#00,#3b,#00,#8e,#77,#84,#90,#75,#77,#8e,#00,#3b,#00,#95,#69
db #8c
end_line_1:
; line: 'This window doesn't open.'
; size in bytes: 26
line_2:
db #19,#55,#77,#79,#8c,#00,#95,#79,#82,#6f,#84,#95,#00,#6f,#84,#71
db #8c,#82,#08,#8e,#00,#84,#86,#71,#82,#14
end_line_2:
; line: 'Looks like the key for a chest.'
; size in bytes: 32
line_3:
db #1f,#42,#84,#84,#7c,#8c,#00,#7e,#79,#7c,#71,#00,#8e,#77,#71,#00
db #7c,#71,#9b,#00,#73,#84,#8a,#00,#69,#00,#6d,#77,#71,#8c,#8e,#14
end_line_3:
; line: 'Lucy: Indeed! The house is now mine!'
; size in bytes: 37
line_4:
db #24,#42,#90,#6d,#9b,#2a,#00,#3b,#82,#6f,#71,#71,#6f,#02,#00,#55
db #77,#71,#00,#77,#84,#90,#8c,#71,#00,#79,#8c,#00,#82,#84,#95,#00
db #7f,#79,#82,#71,#02
end_line_4:
; line: 'To pick it up: do the same while'
; size in bytes: 33
line_5:
db #20,#55,#84,#00,#86,#79,#6d,#7c,#00,#79,#8e,#00,#90,#86,#2a,#00
db #6f,#84,#00,#8e,#77,#71,#00,#8c,#69,#7f,#71,#00,#95,#77,#79,#7e
db #71
end_line_5:
; line: 'No time for a bath now.'
; size in bytes: 24
line_6:
db #17,#47,#84,#00,#8e,#79,#7f,#71,#00,#73,#84,#8a,#00,#69,#00,#6b
db #69,#8e,#77,#00,#82,#84,#95,#14
end_line_6:
; line: 'Not now! The vampire is awake!'
; size in bytes: 31
line_7:
db #1e,#47,#84,#8e,#00,#82,#84,#95,#02,#00,#55,#77,#71,#00,#92,#69
db #7f,#86,#79,#8a,#71,#00,#79,#8c,#00,#69,#95,#69,#7c,#71,#02
end_line_7:
; line: 'This is worse than I thought!'
; size in bytes: 30
line_8:
db #1d,#55,#77,#79,#8c,#00,#79,#8c,#00,#95,#84,#8a,#8c,#71,#00,#8e
db #77,#69,#82,#00,#3b,#00,#8e,#77,#84,#90,#75,#77,#8e,#02
end_line_8:
; line: 'An oil lamp. It's out of oil.'
; size in bytes: 30
line_9:
db #1d,#2b,#82,#00,#84,#79,#7e,#00,#7e,#69,#7f,#86,#14,#00,#3b,#8e
db #08,#8c,#00,#84,#90,#8e,#00,#84,#73,#00,#84,#79,#7e,#14
end_line_9:
; line: 'They are here! I was too slow!'
; size in bytes: 31
line_10:
db #1e,#55,#77,#71,#9b,#00,#69,#8a,#71,#00,#77,#71,#8a,#71,#02,#00
db #3b,#00,#95,#69,#8c,#00,#8e,#84,#84,#00,#8c,#7e,#84,#95,#02
end_line_10:
; line: 'house is stranger than I thought!'
; size in bytes: 34
line_11:
db #21,#77,#84,#90,#8c,#71,#00,#79,#8c,#00,#8c,#8e,#8a,#69,#82,#75
db #71,#8a,#00,#8e,#77,#69,#82,#00,#3b,#00,#8e,#77,#84,#90,#75,#77
db #8e,#02
end_line_11:
; line: 'An oil lamp. The flame is on.'
; size in bytes: 30
line_12:
db #1d,#2b,#82,#00,#84,#79,#7e,#00,#7e,#69,#7f,#86,#14,#00,#55,#77
db #71,#00,#73,#7e,#69,#7f,#71,#00,#79,#8c,#00,#84,#82,#14
end_line_12:
; line: 'It opened!'
; size in bytes: 11
line_13:
db #0a,#3b,#8e,#00,#84,#86,#71,#82,#71,#6f,#02
end_line_13:
; line: ' for all three of us!'
; size in bytes: 23
line_14:
db #16,#00,#00,#73,#84,#8a,#00,#69,#7e,#7e,#00,#8e,#77,#8a,#71,#71
db #00,#84,#73,#00,#90,#8c,#02
end_line_14:
; line: 'An accounting book. It's strange'
; size in bytes: 33
line_15:
db #20,#2b,#82,#00,#69,#6d,#6d,#84,#90,#82,#8e,#79,#82,#75,#00,#6b
db #84,#84,#7c,#14,#00,#3b,#8e,#08,#8c,#00,#8c,#8e,#8a,#69,#82,#75
db #71
end_line_15:
; line: 'a vampire. They are all vampires now Ed!'
; size in bytes: 41
line_16:
db #28,#69,#00,#92,#69,#7f,#86,#79,#8a,#71,#14,#00,#55,#77,#71,#9b
db #00,#69,#8a,#71,#00,#69,#7e,#7e,#00,#92,#69,#7f,#86,#79,#8a,#71
db #8c,#00,#82,#84,#95,#00,#33,#6f,#02
end_line_16:
|
servlet_unit/servlet-tests.adb | My-Colaborations/ada-servlet | 6 | 12338 | -----------------------------------------------------------------------
-- Servlet tests - Servlet Tests Framework
-- Copyright (C) 2011, 2012, 2013, 2015, 2017, 2018, 2020 <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 GNAT.Regpat;
with Ada.Strings.Unbounded;
with Ada.Unchecked_Deallocation;
with Util.Files;
with Servlet.Streams;
with Servlet.Responses;
with Servlet.Responses.Tools;
with EL.Variables.Default;
package body Servlet.Tests is
use Ada.Strings.Unbounded;
use Util.Tests;
type Container_Access is access Servlet.Server.Container;
Server : Container_Access;
App_Created : Servlet.Core.Servlet_Registry_Access;
App : Servlet.Core.Servlet_Registry_Access;
App_URI : Unbounded_String;
-- Save the response headers and content in a file
procedure Save_Response (Name : in String;
Response : in out Servlet.Responses.Mockup.Response'Class);
-- ------------------------------
-- Initialize the awa test framework mockup.
-- ------------------------------
procedure Initialize (Props : in Util.Properties.Manager'Class;
Context_Path : in String := "/servlet-unit";
Registry : in Servlet.Core.Servlet_Registry_Access := null) is
use type Servlet.Core.Servlet_Registry_Access;
begin
if Registry /= null then
App := Registry;
else
if App_Created = null then
App_Created := new Servlet.Core.Servlet_Registry;
end if;
App := App_Created;
end if;
if not Props.Is_Empty then
App.Set_Init_Parameters (Props);
end if;
App_URI := To_Unbounded_String (Context_Path);
Server := new Servlet.Server.Container;
Server.Register_Application (Context_Path, App.all'Access);
end Initialize;
-- ------------------------------
-- Called when the testsuite execution has finished.
-- ------------------------------
procedure Finish (Status : in Util.XUnit.Status) is
pragma Unreferenced (Status);
procedure Free is
new Ada.Unchecked_Deallocation (Object => Servlet.Server.Container,
Name => Container_Access);
begin
Free (Server);
end Finish;
-- ------------------------------
-- Get the server
-- ------------------------------
function Get_Server return access Servlet.Server.Container is
begin
return Server;
end Get_Server;
-- ------------------------------
-- Get the test application.
-- ------------------------------
function Get_Application return Servlet.Core.Servlet_Registry_Access is
begin
return App;
end Get_Application;
-- ------------------------------
-- Save the response headers and content in a file
-- ------------------------------
procedure Save_Response (Name : in String;
Response : in out Servlet.Responses.Mockup.Response'Class) is
use Servlet.Responses;
Info : constant String := Tools.To_String (Reply => Response,
Html => False,
Print_Headers => True);
Result_Path : constant String := Util.Tests.Get_Test_Path ("regtests/result");
Content : Unbounded_String;
Stream : Servlet.Streams.Print_Stream := Response.Get_Output_Stream;
begin
Response.Read_Content (Content);
Stream.Write (Content);
Insert (Content, 1, Info);
Util.Files.Write_File (Result_Path & "/" & Name, Content);
end Save_Response;
-- ------------------------------
-- Simulate a raw request. The URI and method must have been set on the Request object.
-- ------------------------------
procedure Do_Req (Request : in out Servlet.Requests.Mockup.Request'Class;
Response : in out Servlet.Responses.Mockup.Response'Class) is
begin
-- For the purpose of writing tests, clear the buffer before invoking the service.
Response.Clear;
Server.Service (Request => Request,
Response => Response);
end Do_Req;
-- ------------------------------
-- Simulate a GET request on the given URI with the request parameters.
-- Get the result in the response object.
-- ------------------------------
procedure Do_Get (Request : in out Servlet.Requests.Mockup.Request'Class;
Response : in out Servlet.Responses.Mockup.Response'Class;
URI : in String;
Save : in String := "") is
begin
Request.Set_Method (Method => "GET");
Request.Set_Request_URI (URI => To_String (App_URI) & URI, Split => True);
Request.Set_Protocol (Protocol => "HTTP/1.1");
Do_Req (Request, Response);
if Save'Length > 0 then
Save_Response (Save, Response);
end if;
end Do_Get;
-- ------------------------------
-- Simulate a POST request on the given URI with the request parameters.
-- Get the result in the response object.
-- ------------------------------
procedure Do_Post (Request : in out Servlet.Requests.Mockup.Request'Class;
Response : in out Servlet.Responses.Mockup.Response'Class;
URI : in String;
Save : in String := "") is
begin
Request.Set_Method (Method => "POST");
Request.Set_Request_URI (URI => To_String (App_URI) & URI, Split => False);
Request.Set_Protocol (Protocol => "HTTP/1.1");
Do_Req (Request, Response);
if Save'Length > 0 then
Save_Response (Save, Response);
end if;
end Do_Post;
-- ------------------------------
-- Check that the response body contains the string
-- ------------------------------
procedure Assert_Contains (T : in Util.Tests.Test'Class;
Value : in String;
Reply : in out Servlet.Responses.Mockup.Response;
Message : in String := "Test failed";
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line) is
Stream : Servlet.Streams.Print_Stream := Reply.Get_Output_Stream;
Content : Unbounded_String;
begin
Reply.Read_Content (Content);
Stream.Write (Content);
Assert_Equals (T, Servlet.Responses.SC_OK, Reply.Get_Status,
"Invalid response", Source, Line);
T.Assert (Condition => Index (Content, Value) > 0,
Message => Message & ": value '" & Value & "' not found",
Source => Source,
Line => Line);
end Assert_Contains;
-- ------------------------------
-- Check that the response body matches the regular expression
-- ------------------------------
procedure Assert_Matches (T : in Util.Tests.Test'Class;
Pattern : in String;
Reply : in out Servlet.Responses.Mockup.Response;
Message : in String := "Test failed";
Status : in Natural := Servlet.Responses.SC_OK;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line) is
use GNAT.Regpat;
Stream : Servlet.Streams.Print_Stream := Reply.Get_Output_Stream;
Content : Unbounded_String;
Regexp : constant Pattern_Matcher := Compile (Expression => Pattern,
Flags => Multiple_Lines);
begin
Reply.Read_Content (Content);
Stream.Write (Content);
Assert_Equals (T, Status, Reply.Get_Status, "Invalid response", Source, Line);
T.Assert (Condition => Match (Regexp, To_String (Content)),
Message => Message & ": does not match '" & Pattern & "'",
Source => Source,
Line => Line);
end Assert_Matches;
-- ------------------------------
-- Check that the response contains the given header.
-- ------------------------------
procedure Assert_Header (T : in Util.Tests.Test'Class;
Header : in String;
Value : in String;
Reply : in out Servlet.Responses.Mockup.Response;
Message : in String := "Test failed";
Status : in Natural := Servlet.Responses.SC_OK;
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line) is
begin
Assert_Equals (T, Status, Reply.Get_Status,
"Invalid response status", Source, Line);
T.Assert (Condition => Reply.Contains_Header (Header),
Message => Message & ": missing header '" & Header & "'",
Source => Source,
Line => Line);
Assert_Equals (T, Value, Reply.Get_Header (Header), Message, Source, Line);
end Assert_Header;
-- ------------------------------
-- Check that the response body is a redirect to the given URI.
-- ------------------------------
procedure Assert_Redirect (T : in Util.Tests.Test'Class;
Value : in String;
Reply : in out Servlet.Responses.Mockup.Response;
Message : in String := "Test failed";
Source : String := GNAT.Source_Info.File;
Line : Natural := GNAT.Source_Info.Line) is
begin
Assert_Equals (T, Servlet.Responses.SC_MOVED_TEMPORARILY, Reply.Get_Status,
"Invalid response", Source, Line);
Util.Tests.Assert_Equals (T, Value, Reply.Get_Header ("Location"),
Message & ": missing Location",
Source, Line);
end Assert_Redirect;
-- ------------------------------
-- Cleanup the test instance.
-- ------------------------------
overriding
procedure Tear_Down (T : in out EL_Test) is
procedure Free is
new Ada.Unchecked_Deallocation (EL.Contexts.Default.Default_Context'Class,
EL.Contexts.Default.Default_Context_Access);
procedure Free is
new Ada.Unchecked_Deallocation (EL.Variables.Variable_Mapper'Class,
EL.Variables.Variable_Mapper_Access);
procedure Free is
new Ada.Unchecked_Deallocation (EL.Contexts.Default.Default_ELResolver'Class,
EL.Contexts.Default.Default_ELResolver_Access);
begin
-- Servlet.Contexts.Faces.Restore (null);
Free (T.ELContext);
Free (T.Variables);
Free (T.Root_Resolver);
end Tear_Down;
-- ------------------------------
-- Setup the test instance.
-- ------------------------------
overriding
procedure Set_Up (T : in out EL_Test) is
begin
T.ELContext := new EL.Contexts.Default.Default_Context;
T.Root_Resolver := new EL.Contexts.Default.Default_ELResolver;
T.Variables := new EL.Variables.Default.Default_Variable_Mapper;
T.ELContext.Set_Resolver (T.Root_Resolver.all'Access);
T.ELContext.Set_Variable_Mapper (T.Variables.all'Access);
end Set_Up;
end Servlet.Tests;
|
test/mov.asm | killvxk/AssemblyLine | 147 | 162879 | SECTION .text
GLOBAL test
test:
mov [rsp + 0x03f0 ], rax
mov [rsp + 0x03f0 ], rax
mov byte [ rsp + 0xa0 ], r14b
mov byte [ rsp + 0xa0 ], ah
mov byte [ rsp + 0xa0 ], ch
mov byte [ rsp + 0xa0 ], dh
mov byte [ rsp + 0xa0 ], bh
mov byte [ rsp + 0xa0 ], spl
mov byte [ rbp + 0xa0 ], spl
mov word [ rsp + 0xa0 ], ax
mov dword [ rsp + 0xa0 ], eax
mov byte [ rsp + 0xa0 ], al
mov byte [r12], al
mov [ r10 + 0xa0 ], rbx
mov r10, r11
mov r10, r12
mov r10, r13
mov r10, r14
mov r10, r15
mov r10, r8
mov r10, r9
mov r10, rax
mov r10, rbp
mov r10, rbx
mov r10, rcx
mov r10, rdi
mov r10, rdx
mov r10, rsi
mov r13, [rbp+0x7f]
mov r13, [rbp+0x80]
mov r10, [ rsi + 0x68 ]
mov r10, [ rsi + 0xc0 ]
mov r10, [ rsp + 0x108 ]
mov r10, [ rsp + 0x1110 ]
mov r10, [ rsp + 0x11f8 ]
mov r10, [ rsp + 0x1228 ]
mov r10, [ rsp + 0x12e0 ]
mov r10, [ rsp + 0x12e8 ]
mov r10, [ rsp + 0x1310 ]
mov r10, [ rsp + 0x1330 ]
mov r10, [ rsp + 0x1358 ]
mov r10, [ rsp + 0x1460 ]
mov r10, [ rsp + 0x1468 ]
mov r10, [ rsp + 0x14d8 ]
mov r10, [ rsp + 0x1500 ]
mov r10, [ rsp + 0x15d8 ]
mov r10, [ rsp + 0x1628 ]
mov r10, [ rsp + 0x1638 ]
mov r10, [ rsp + 0x168 ]
mov r10, [ rsp + 0x16d8 ]
mov r10, [ rsp + 0x1880 ]
mov r10, [ rsp + 0x1888 ]
mov r10, [ rsp + 0x190 ]
mov r10, [ rsp + 0x1920 ]
mov r10, [ rsp + 0x1928 ]
mov r10, [ rsp + 0x1940 ]
mov r10, [ rsp + 0x1978 ]
mov r10, [ rsp + 0x198 ]
mov r10, [ rsp + 0x1a38 ]
mov r10, [ rsp + 0x1a8 ]
mov r10, [ rsp + 0x1b98 ]
mov r10, [ rsp + 0x1bf8 ]
mov r10, [ rsp + 0x1c00 ]
mov r10, [ rsp + 0x1c68 ]
mov r10, [ rsp + 0x1d48 ]
mov r10, [ rsp + 0x1d68 ]
mov r10, [ rsp + 0x1ec8 ]
mov r10, [ rsp + 0x1f00 ]
mov r10, [ rsp + 0x1f08 ]
mov r10, [ rsp + 0x1f20 ]
mov r10, [ rsp + 0x1f38 ]
mov r10, [ rsp + 0x1f78 ]
mov r10, [ rsp + 0x1f88 ]
mov r10, [ rsp + 0x1f98 ]
mov r10, [ rsp + 0x1fb0 ]
mov r10, [ rsp + 0x2010 ]
mov r10, [ rsp + 0x2030 ]
mov r10, [ rsp + 0x2080 ]
mov r10, [ rsp + 0x20b8 ]
mov r10, [ rsp + 0x2108 ]
mov r10, [ rsp + 0x2140 ]
mov r10, [ rsp + 0x2158 ]
mov r10, [ rsp + 0x2208 ]
mov r10, [ rsp + 0x2308 ]
mov r10, [ rsp + 0x2328 ]
mov r10, [ rsp + 0x2330 ]
mov r10, [ rsp + 0x2358 ]
mov r10, [ rsp + 0x2400 ]
mov r10, [ rsp + 0x250 ]
mov r10, [ rsp + 0x25e8 ]
mov r10, [ rsp + 0x2628 ]
mov r10, [ rsp + 0x2630 ]
mov r10, [ rsp + 0x2738 ]
mov r10, [ rsp + 0x2758 ]
mov r10, [ rsp + 0x27e8 ]
mov r10, [ rsp + 0x2818 ]
mov r10, [ rsp + 0x2840 ]
mov r10, [ rsp + 0x2880 ]
mov r10, [ rsp + 0x2968 ]
mov r10, [ rsp + 0x298 ]
mov r10, [ rsp + 0x2990 ]
mov r10, [ rsp + 0x29a0 ]
mov r10, [ rsp + 0x2a28 ]
mov r10, [ rsp + 0x2ae8 ]
mov r10, [ rsp + 0x2b48 ]
mov r10, [ rsp + 0x2b88 ]
mov r10, [ rsp + 0x2c58 ]
mov r10, [ rsp + 0x2cd8 ]
mov r10, [ rsp + 0x2d08 ]
mov r10, [ rsp + 0x2d50 ]
mov r10, [ rsp + 0x2dd0 ]
mov r10, [ rsp + 0x2e98 ]
mov r10, [ rsp + 0x2f08 ]
mov r10, [ rsp + 0x2f48 ]
mov r10, [ rsp + 0x2f68 ]
mov r10, [ rsp + 0x2fc0 ]
mov r10, [ rsp + 0x3020 ]
mov r10, [ rsp + 0x3028 ]
mov r10, [ rsp + 0x3058 ]
mov r10, [ rsp + 0x30e8 ]
mov r10, [ rsp + 0x3158 ]
mov r10, [ rsp + 0x31a8 ]
mov r10, [ rsp + 0x3328 ]
mov r10, [ rsp + 0x3400 ]
mov r10, [ rsp + 0x34b0 ]
mov r10, [ rsp + 0x3538 ]
mov r10, [ rsp + 0x3550 ]
mov r10, [ rsp + 0x3588 ]
mov r10, [ rsp + 0x35a0 ]
mov r10, [ rsp + 0x3628 ]
mov r10, [ rsp + 0x3698 ]
mov r10, [ rsp + 0x36a8 ]
mov r10, [ rsp + 0x3730 ]
mov r10, [ rsp + 0x3770 ]
mov r10, [ rsp + 0x380 ]
mov r10, [ rsp + 0x3848 ]
mov r10, [ rsp + 0x3850 ]
mov r10, [ rsp + 0x38c0 ]
mov r10, [ rsp + 0x38c8 ]
mov r10, [ rsp + 0x3908 ]
mov r10, [ rsp + 0x3a0 ]
mov r10, [ rsp + 0x450 ]
mov r10, [ rsp + 0x458 ]
mov r10, [ rsp + 0x48 ]
mov r10, [ rsp + 0x4c0 ]
mov r10, [ rsp + 0x678 ]
mov r10, [ rsp + 0x6a8 ]
mov r10, [ rsp + 0x6b0 ]
mov r10, [ rsp + 0x700 ]
mov r10, [ rsp + 0x780 ]
mov r10, [ rsp + 0x7b0 ]
mov r10, [ rsp + 0x898 ]
mov r10, [ rsp + 0x9a0 ]
mov r10, [ rsp + 0xa38 ]
mov r10, [ rsp + 0xa98 ]
mov r10, [ rsp + 0xb40 ]
mov r10, [ rsp + 0xbc0 ]
mov r10, [ rsp + 0xbf0 ]
mov r10, [ rsp + 0xcd8 ]
mov r10, [ rsp + 0xd08 ]
mov r10, [ rsp + 0xd60 ]
mov r10, [ rsp + 0xda8 ]
mov r10, [ rsp + 0xdd8 ]
mov r10, [ rsp + 0xe30 ]
mov r10, [ rsp + 0xef0 ]
mov r11, r10
mov r11, r12
mov r11, r13
mov r11, r14
mov r11, r15
mov r11, r8
mov r11, r9
mov r11, rax
mov r11, rbp
mov r11, rbx
mov r11, rcx
mov r11, rdi
mov r11, rdx
mov r11, rsi
mov r11, [ rsi + 0xa8 ]
mov r11, [ rsp + 0x1130 ]
mov r11, [ rsp + 0x1170 ]
mov r11, [ rsp + 0x118 ]
mov r11, [ rsp + 0x11c0 ]
mov r11, [ rsp + 0x1200 ]
mov r11, [ rsp + 0x1220 ]
mov r11, [ rsp + 0x1458 ]
mov r11, [ rsp + 0x14f0 ]
mov r11, [ rsp + 0x1520 ]
mov r11, [ rsp + 0x1558 ]
mov r11, [ rsp + 0x1578 ]
mov r11, [ rsp + 0x15a0 ]
mov r11, [ rsp + 0x15b0 ]
mov r11, [ rsp + 0x15c0 ]
mov r11, [ rsp + 0x15f0 ]
mov r11, [ rsp + 0x1698 ]
mov r11, [ rsp + 0x16f0 ]
mov r11, [ rsp + 0x1840 ]
mov r11, [ rsp + 0x188 ]
mov r11, [ rsp + 0x1960 ]
mov r11, [ rsp + 0x1998 ]
mov r11, [ rsp + 0x1a0 ]
mov r11, [ rsp + 0x1a30 ]
mov r11, [ rsp + 0x1a48 ]
mov r11, [ rsp + 0x1a58 ]
mov r11, [ rsp + 0x1a98 ]
mov r11, [ rsp + 0x1ac0 ]
mov r11, [ rsp + 0x1ad8 ]
mov r11, [ rsp + 0x1ae8 ]
mov r11, [ rsp + 0x1b48 ]
mov r11, [ rsp + 0x1ba8 ]
mov r11, [ rsp + 0x1bc8 ]
mov r11, [ rsp + 0x1c60 ]
mov r11, [ rsp + 0x1cb8 ]
mov r11, [ rsp + 0x1cf8 ]
mov r11, [ rsp + 0x1d60 ]
mov r11, [ rsp + 0x1dd8 ]
mov r11, [ rsp + 0x1e30 ]
mov r11, [ rsp + 0x1e98 ]
mov r11, [ rsp + 0x2000 ]
mov r11, [ rsp + 0x2008 ]
mov r11, [ rsp + 0x2048 ]
mov r11, [ rsp + 0x2050 ]
mov r11, [ rsp + 0x2100 ]
mov r11, [ rsp + 0x2148 ]
mov r11, [ rsp + 0x2150 ]
mov r11, [ rsp + 0x21a0 ]
mov r11, [ rsp + 0x2360 ]
mov r11, [ rsp + 0x23d0 ]
mov r11, [ rsp + 0x24e8 ]
mov r11, [ rsp + 0x2588 ]
mov r11, [ rsp + 0x25d0 ]
mov r11, [ rsp + 0x2678 ]
mov r11, [ rsp + 0x2808 ]
mov r11, [ rsp + 0x2850 ]
mov r11, [ rsp + 0x28c0 ]
mov r11, [ rsp + 0x28e0 ]
mov r11, [ rsp + 0x2930 ]
mov r11, [ rsp + 0x2978 ]
mov r11, [ rsp + 0x2988 ]
mov r11, [ rsp + 0x29e8 ]
mov r11, [ rsp + 0x2a0 ]
mov r11, [ rsp + 0x2ac0 ]
mov r11, [ rsp + 0x2b30 ]
mov r11, [ rsp + 0x2b8 ]
mov r11, [ rsp + 0x2ba8 ]
mov r11, [ rsp + 0x2bb0 ]
mov r11, [ rsp + 0x2c88 ]
mov r11, [ rsp + 0x2cc8 ]
mov r11, [ rsp + 0x2d90 ]
mov r11, [ rsp + 0x2e68 ]
mov r11, [ rsp + 0x3090 ]
mov r11, [ rsp + 0x31c0 ]
mov r11, [ rsp + 0x31f0 ]
mov r11, [ rsp + 0x3228 ]
mov r11, [ rsp + 0x33d0 ]
mov r11, [ rsp + 0x33e8 ]
mov r11, [ rsp + 0x3560 ]
mov r11, [ rsp + 0x3578 ]
mov r11, [ rsp + 0x35e0 ]
mov r11, [ rsp + 0x3610 ]
mov r11, [ rsp + 0x3668 ]
mov r11, [ rsp + 0x36b8 ]
mov r11, [ rsp + 0x3708 ]
mov r11, [ rsp + 0x37f0 ]
mov r11, [ rsp + 0x410 ]
mov r11, [ rsp + 0x4b8 ]
mov r11, [ rsp + 0x540 ]
mov r11, [ rsp + 0x628 ]
mov r11, [ rsp + 0x670 ]
mov r11, [ rsp + 0x68 ]
mov r11, [ rsp + 0x7d0 ]
mov r11, [ rsp + 0x998 ]
mov r11, [ rsp + 0xa88 ]
mov r11, [ rsp + 0xb20 ]
mov r11, [ rsp + 0xba0 ]
mov r11, [ rsp + 0xba8 ]
mov r11, [ rsp + 0xbe8 ]
mov r11, [ rsp + 0xc08 ]
mov r11, [ rsp + 0xc30 ]
mov r11, [ rsp + 0xc40 ]
mov r11, [ rsp + 0xc48 ]
mov r11, [ rsp + 0xc68 ]
mov r11, [ rsp + 0xca8 ]
mov r11, [ rsp + 0xd00 ]
mov r11, [ rsp + 0xd38 ]
mov r11, [ rsp + 0xd80 ]
mov r11, [ rsp + 0xd88 ]
mov r11, [ rsp + 0xdb8 ]
mov r11, [ rsp + 0xe68 ]
mov r11, [ rsp + 0xfc8 ]
mov r11, [ rsp + 0xff8 ]
mov [ r12 + 0x30 ], rdx
mov [ r12 + 0x68 ], r15
mov [ r12 + 0xb8 ], r10
mov r12, r10
mov r12, r11
mov r12, r13
mov r12, r14
mov r12, r15
mov r12, r8
mov r12, r9
mov r12, rax
mov r12, rbp
mov r12, rbx
mov r12, rcx
mov r12, rdi
mov r12, rdx
mov r12, rsi
mov r12, [ rsi + 0x20 ]
mov r12, [ rsi + 0x50 ]
mov r12, [ rsi + 0x58 ]
mov r12, [ rsp + 0x1028 ]
mov r12, [ rsp + 0x1050 ]
mov r12, [ rsp + 0x1090 ]
mov r12, [ rsp + 0x10a0 ]
mov r12, [ rsp + 0x1200 ]
mov r12, [ rsp + 0x1250 ]
mov r12, [ rsp + 0x1308 ]
mov r12, [ rsp + 0x1350 ]
mov r12, [ rsp + 0x1378 ]
mov r12, [ rsp + 0x13b8 ]
mov r12, [ rsp + 0x1438 ]
mov r12, [ rsp + 0x148 ]
mov r12, [ rsp + 0x1480 ]
mov r12, [ rsp + 0x1490 ]
mov r12, [ rsp + 0x1498 ]
mov r12, [ rsp + 0x1540 ]
mov r12, [ rsp + 0x1560 ]
mov r12, [ rsp + 0x1590 ]
mov r12, [ rsp + 0x16e0 ]
mov r12, [ rsp + 0x1760 ]
mov r12, [ rsp + 0x17f0 ]
mov r12, [ rsp + 0x1800 ]
mov r12, [ rsp + 0x1ab0 ]
mov r12, [ rsp + 0x1b30 ]
mov r12, [ rsp + 0x1c50 ]
mov r12, [ rsp + 0x1ce8 ]
mov r12, [ rsp + 0x1d80 ]
mov r12, [ rsp + 0x1e40 ]
mov r12, [ rsp + 0x1e78 ]
mov r12, [ rsp + 0x1ee0 ]
mov r12, [ rsp + 0x1f10 ]
mov r12, [ rsp + 0x1f60 ]
mov r12, [ rsp + 0x1f70 ]
mov r12, [ rsp + 0x200 ]
mov r12, [ rsp + 0x2060 ]
mov r12, [ rsp + 0x2170 ]
mov r12, [ rsp + 0x2180 ]
mov r12, [ rsp + 0x2198 ]
mov r12, [ rsp + 0x2230 ]
mov r12, [ rsp + 0x2238 ]
mov r12, [ rsp + 0x22e0 ]
mov r12, [ rsp + 0x2320 ]
mov r12, [ rsp + 0x238 ]
mov r12, [ rsp + 0x2388 ]
mov r12, [ rsp + 0x23c8 ]
mov r12, [ rsp + 0x23d8 ]
mov r12, [ rsp + 0x23f8 ]
mov r12, [ rsp + 0x2418 ]
mov r12, [ rsp + 0x2420 ]
mov r12, [ rsp + 0x2430 ]
mov r12, [ rsp + 0x2438 ]
mov r12, [ rsp + 0x2458 ]
mov r12, [ rsp + 0x25c8 ]
mov r12, [ rsp + 0x25e0 ]
mov r12, [ rsp + 0x25e8 ]
mov r12, [ rsp + 0x27f0 ]
mov r12, [ rsp + 0x29a0 ]
mov r12, [ rsp + 0x29e0 ]
mov r12, [ rsp + 0x29f0 ]
mov r12, [ rsp + 0x2a00 ]
mov r12, [ rsp + 0x2a78 ]
mov r12, [ rsp + 0x2a90 ]
mov r12, [ rsp + 0x2aa0 ]
mov r12, [ rsp + 0x2ae8 ]
mov r12, [ rsp + 0x2af8 ]
mov r12, [ rsp + 0x2b68 ]
mov r12, [ rsp + 0x2b90 ]
mov r12, [ rsp + 0x2b98 ]
mov r12, [ rsp + 0x2ba0 ]
mov r12, [ rsp + 0x2bd0 ]
mov r12, [ rsp + 0x2c28 ]
mov r12, [ rsp + 0x2d78 ]
mov r12, [ rsp + 0x2d8 ]
mov r12, [ rsp + 0x2eb0 ]
mov r12, [ rsp + 0x2ec0 ]
mov r12, [ rsp + 0x2f0 ]
mov r12, [ rsp + 0x2f28 ]
mov r12, [ rsp + 0x2f30 ]
mov r12, [ rsp + 0x2f78 ]
mov r12, [ rsp + 0x2f90 ]
mov r12, [ rsp + 0x2fb0 ]
mov r12, [ rsp + 0x3000 ]
mov r12, [ rsp + 0x30d0 ]
mov r12, [ rsp + 0x30f0 ]
mov r12, [ rsp + 0x31d8 ]
mov r12, [ rsp + 0x3218 ]
mov r12, [ rsp + 0x3220 ]
mov r12, [ rsp + 0x3348 ]
mov r12, [ rsp + 0x350 ]
mov r12, [ rsp + 0x3570 ]
mov r12, [ rsp + 0x35a0 ]
mov r12, [ rsp + 0x36d0 ]
mov r12, [ rsp + 0x3728 ]
mov r12, [ rsp + 0x37d8 ]
mov r12, [ rsp + 0x3830 ]
mov r12, [ rsp + 0x38f0 ]
mov r12, [ rsp + 0x3988 ]
mov r12, [ rsp + 0x448 ]
mov r12, [ rsp + 0x48 ]
mov r12, [ rsp + 0x4f0 ]
mov r12, [ rsp + 0x508 ]
mov r12, [ rsp + 0x590 ]
mov r12, [ rsp + 0x768 ]
mov r12, [ rsp + 0x788 ]
mov r12, [ rsp + 0x7d8 ]
mov r12, [ rsp + 0x860 ]
mov r12, [ rsp + 0x870 ]
mov r12, [ rsp + 0x878 ]
mov r12, [ rsp + 0x900 ]
mov r12, [ rsp + 0x920 ]
mov r12, [ rsp + 0xa10 ]
mov r12, [ rsp + 0xaf0 ]
mov r12, [ rsp + 0xb08 ]
mov r12, [ rsp + 0xd88 ]
mov r12, [ rsp + 0xec8 ]
mov r12, [ rsp + 0xf60 ]
mov r12, [ rsp + 0xf90 ]
mov r12, [ rsp + 0xfa8 ]
mov r12, [ rsp + 0xfe8 ]
mov r13, r10
mov r13, r11
mov r13, r12
mov r13, r14
mov r13, r15
mov r13, r8
mov r13, r9
mov r13, rax
mov r13, rbp
mov r13, rbx
mov r13, rcx
mov r13, rdi
mov r13, rdx
mov r13, rsi
mov r13, [ rsi + 0xb0 ]
mov r13, [ rsp + 0x108 ]
mov r13, [ rsp + 0x1178 ]
mov r13, [ rsp + 0x1258 ]
mov r13, [ rsp + 0x1288 ]
mov r13, [ rsp + 0x1300 ]
mov r13, [ rsp + 0x1340 ]
mov r13, [ rsp + 0x1398 ]
mov r13, [ rsp + 0x13f8 ]
mov r13, [ rsp + 0x1440 ]
mov r13, [ rsp + 0x14a8 ]
mov r13, [ rsp + 0x14e0 ]
mov r13, [ rsp + 0x1518 ]
mov r13, [ rsp + 0x1548 ]
mov r13, [ rsp + 0x1598 ]
mov r13, [ rsp + 0x1658 ]
mov r13, [ rsp + 0x16f8 ]
mov r13, [ rsp + 0x1758 ]
mov r13, [ rsp + 0x1828 ]
mov r13, [ rsp + 0x1a80 ]
mov r13, [ rsp + 0x1b18 ]
mov r13, [ rsp + 0x1b68 ]
mov r13, [ rsp + 0x1b88 ]
mov r13, [ rsp + 0x1bb0 ]
mov r13, [ rsp + 0x1bf8 ]
mov r13, [ rsp + 0x1c40 ]
mov r13, [ rsp + 0x1c70 ]
mov r13, [ rsp + 0x1cb8 ]
mov r13, [ rsp + 0x1d08 ]
mov r13, [ rsp + 0x1d68 ]
mov r13, [ rsp + 0x1dc0 ]
mov r13, [ rsp + 0x1e28 ]
mov r13, [ rsp + 0x1e80 ]
mov r13, [ rsp + 0x1ea8 ]
mov r13, [ rsp + 0x1eb8 ]
mov r13, [ rsp + 0x1ff0 ]
mov r13, [ rsp + 0x200 ]
mov r13, [ rsp + 0x2020 ]
mov r13, [ rsp + 0x20f8 ]
mov r13, [ rsp + 0x210 ]
mov r13, [ rsp + 0x2118 ]
mov r13, [ rsp + 0x2120 ]
mov r13, [ rsp + 0x21d8 ]
mov r13, [ rsp + 0x21e8 ]
mov r13, [ rsp + 0x2220 ]
mov r13, [ rsp + 0x22b8 ]
mov r13, [ rsp + 0x2368 ]
mov r13, [ rsp + 0x2378 ]
mov r13, [ rsp + 0x23a8 ]
mov r13, [ rsp + 0x23f0 ]
mov r13, [ rsp + 0x24c8 ]
mov r13, [ rsp + 0x24d0 ]
mov r13, [ rsp + 0x2510 ]
mov r13, [ rsp + 0x2570 ]
mov r13, [ rsp + 0x2578 ]
mov r13, [ rsp + 0x25d8 ]
mov r13, [ rsp + 0x2660 ]
mov r13, [ rsp + 0x2668 ]
mov r13, [ rsp + 0x268 ]
mov r13, [ rsp + 0x2698 ]
mov r13, [ rsp + 0x26e8 ]
mov r13, [ rsp + 0x26f0 ]
mov r13, [ rsp + 0x2740 ]
mov r13, [ rsp + 0x2828 ]
mov r13, [ rsp + 0x2838 ]
mov r13, [ rsp + 0x2870 ]
mov r13, [ rsp + 0x2918 ]
mov r13, [ rsp + 0x2948 ]
mov r13, [ rsp + 0x2a40 ]
mov r13, [ rsp + 0x2a98 ]
mov r13, [ rsp + 0x2b28 ]
mov r13, [ rsp + 0x2bd8 ]
mov r13, [ rsp + 0x2cc8 ]
mov r13, [ rsp + 0x2d20 ]
mov r13, [ rsp + 0x2d60 ]
mov r13, [ rsp + 0x2db0 ]
mov r13, [ rsp + 0x2de0 ]
mov r13, [ rsp + 0x2e28 ]
mov r13, [ rsp + 0x2e58 ]
mov r13, [ rsp + 0x2ec0 ]
mov r13, [ rsp + 0x2f80 ]
mov r13, [ rsp + 0x2f88 ]
mov r13, [ rsp + 0x2f98 ]
mov r13, [ rsp + 0x2fa8 ]
mov r13, [ rsp + 0x2ff8 ]
mov r13, [ rsp + 0x300 ]
mov r13, [ rsp + 0x3030 ]
mov r13, [ rsp + 0x3050 ]
mov r13, [ rsp + 0x3108 ]
mov r13, [ rsp + 0x3180 ]
mov r13, [ rsp + 0x3200 ]
mov r13, [ rsp + 0x3260 ]
mov r13, [ rsp + 0x3280 ]
mov r13, [ rsp + 0x3358 ]
mov r13, [ rsp + 0x3520 ]
mov r13, [ rsp + 0x3528 ]
mov r13, [ rsp + 0x35a8 ]
mov r13, [ rsp + 0x35e0 ]
mov r13, [ rsp + 0x35f8 ]
mov r13, [ rsp + 0x3608 ]
mov r13, [ rsp + 0x3640 ]
mov r13, [ rsp + 0x3650 ]
mov r13, [ rsp + 0x368 ]
mov r13, [ rsp + 0x3680 ]
mov r13, [ rsp + 0x3690 ]
mov r13, [ rsp + 0x36e8 ]
mov r13, [ rsp + 0x3828 ]
mov r13, [ rsp + 0x388 ]
mov r13, [ rsp + 0x3990 ]
mov r13, [ rsp + 0x500 ]
mov r13, [ rsp + 0x518 ]
mov r13, [ rsp + 0x538 ]
mov r13, [ rsp + 0x560 ]
mov r13, [ rsp + 0x578 ]
mov r13, [ rsp + 0x58 ]
mov r13, [ rsp + 0x750 ]
mov r13, [ rsp + 0x7c8 ]
mov r13, [ rsp + 0x7f8 ]
mov r13, [ rsp + 0x8a8 ]
mov r13, [ rsp + 0x970 ]
mov r13, [ rsp + 0xac0 ]
mov r13, [ rsp + 0xac8 ]
mov r13, [ rsp + 0xad0 ]
mov r13, [ rsp + 0xd48 ]
mov r13, [ rsp + 0xde8 ]
mov r13, [ rsp + 0xe88 ]
mov r14, r10
mov r14, r11
mov r14, r12
mov r14, r13
mov r14, r15
mov r14, r8
mov r14, r9
mov r14, rax
mov r14, rbp
mov r14, rbx
mov r14, rcx
mov r14, rdi
mov r14, rdx
mov r14, rsi
mov r14, [ rsi + 0x48 ]
mov r14, [ rsi + 0x8 ]
mov r14, [ rsi + 0x98 ]
mov r14, [ rsp + 0x1098 ]
mov r14, [ rsp + 0x10c0 ]
mov r14, [ rsp + 0x1100 ]
mov r14, [ rsp + 0x1148 ]
mov r14, [ rsp + 0x1160 ]
mov r14, [ rsp + 0x11a8 ]
mov r14, [ rsp + 0x11e0 ]
mov r14, [ rsp + 0x1208 ]
mov r14, [ rsp + 0x1210 ]
mov r14, [ rsp + 0x1240 ]
mov r14, [ rsp + 0x1298 ]
mov r14, [ rsp + 0x12b0 ]
mov r14, [ rsp + 0x12d8 ]
mov r14, [ rsp + 0x13c8 ]
mov r14, [ rsp + 0x1408 ]
mov r14, [ rsp + 0x1418 ]
mov r14, [ rsp + 0x14e0 ]
mov r14, [ rsp + 0x1528 ]
mov r14, [ rsp + 0x1558 ]
mov r14, [ rsp + 0x1570 ]
mov r14, [ rsp + 0x15c8 ]
mov r14, [ rsp + 0x1778 ]
mov r14, [ rsp + 0x17c0 ]
mov r14, [ rsp + 0x1808 ]
mov r14, [ rsp + 0x1818 ]
mov r14, [ rsp + 0x18a0 ]
mov r14, [ rsp + 0x19b8 ]
mov r14, [ rsp + 0x19c0 ]
mov r14, [ rsp + 0x19e0 ]
mov r14, [ rsp + 0x1a0 ]
mov r14, [ rsp + 0x1a70 ]
mov r14, [ rsp + 0x1bf0 ]
mov r14, [ rsp + 0x1c48 ]
mov r14, [ rsp + 0x1d30 ]
mov r14, [ rsp + 0x1dc8 ]
mov r14, [ rsp + 0x1dd0 ]
mov r14, [ rsp + 0x1e10 ]
mov r14, [ rsp + 0x1e20 ]
mov r14, [ rsp + 0x1e78 ]
mov r14, [ rsp + 0x1ed8 ]
mov r14, [ rsp + 0x1f48 ]
mov r14, [ rsp + 0x2040 ]
mov r14, [ rsp + 0x2068 ]
mov r14, [ rsp + 0x20b0 ]
mov r14, [ rsp + 0x20c8 ]
mov r14, [ rsp + 0x2138 ]
mov r14, [ rsp + 0x21f8 ]
mov r14, [ rsp + 0x23a8 ]
mov r14, [ rsp + 0x2480 ]
mov r14, [ rsp + 0x25a8 ]
mov r14, [ rsp + 0x2600 ]
mov r14, [ rsp + 0x2678 ]
mov r14, [ rsp + 0x28 ]
mov r14, [ rsp + 0x280 ]
mov r14, [ rsp + 0x2828 ]
mov r14, [ rsp + 0x2838 ]
mov r14, [ rsp + 0x28d8 ]
mov r14, [ rsp + 0x28f8 ]
mov r14, [ rsp + 0x2908 ]
mov r14, [ rsp + 0x2918 ]
mov r14, [ rsp + 0x2958 ]
mov r14, [ rsp + 0x2ab8 ]
mov r14, [ rsp + 0x2ac8 ]
mov r14, [ rsp + 0x2ae0 ]
mov r14, [ rsp + 0x2b98 ]
mov r14, [ rsp + 0x2c70 ]
mov r14, [ rsp + 0x2cb8 ]
mov r14, [ rsp + 0x2ce0 ]
mov r14, [ rsp + 0x2e30 ]
mov r14, [ rsp + 0x2e70 ]
mov r14, [ rsp + 0x2e80 ]
mov r14, [ rsp + 0x2e88 ]
mov r14, [ rsp + 0x2eb0 ]
mov r14, [ rsp + 0x2f10 ]
mov r14, [ rsp + 0x2f58 ]
mov r14, [ rsp + 0x3080 ]
mov r14, [ rsp + 0x3178 ]
mov r14, [ rsp + 0x32b8 ]
mov r14, [ rsp + 0x3390 ]
mov r14, [ rsp + 0x33a8 ]
mov r14, [ rsp + 0x3430 ]
mov r14, [ rsp + 0x3508 ]
mov r14, [ rsp + 0x3548 ]
mov r14, [ rsp + 0x3590 ]
mov r14, [ rsp + 0x3630 ]
mov r14, [ rsp + 0x3678 ]
mov r14, [ rsp + 0x3690 ]
mov r14, [ rsp + 0x370 ]
mov r14, [ rsp + 0x3790 ]
mov r14, [ rsp + 0x37d0 ]
mov r14, [ rsp + 0x3858 ]
mov r14, [ rsp + 0x3880 ]
mov r14, [ rsp + 0x390 ]
mov r14, [ rsp + 0x3928 ]
mov r14, [ rsp + 0x3930 ]
mov r14, [ rsp + 0x3960 ]
mov r14, [ rsp + 0x3998 ]
mov r14, [ rsp + 0x3b8 ]
mov r14, [ rsp + 0x40 ]
mov r14, [ rsp + 0x408 ]
mov r14, [ rsp + 0x4a8 ]
mov r14, [ rsp + 0x4d0 ]
mov r14, [ rsp + 0x4f8 ]
mov r14, [ rsp + 0x520 ]
mov r14, [ rsp + 0x590 ]
mov r14, [ rsp + 0x658 ]
mov r14, [ rsp + 0x6a0 ]
mov r14, [ rsp + 0x6c0 ]
mov r14, [ rsp + 0x6d0 ]
mov r14, [ rsp + 0x738 ]
mov r14, [ rsp + 0x778 ]
mov r14, [ rsp + 0x7c0 ]
mov r14, [ rsp + 0x810 ]
mov r14, [ rsp + 0x930 ]
mov r14, [ rsp + 0x940 ]
mov r14, [ rsp + 0x9c0 ]
mov r14, [ rsp + 0x9f8 ]
mov r14, [ rsp + 0xa18 ]
mov r14, [ rsp + 0xa68 ]
mov r14, [ rsp + 0xa80 ]
mov r14, [ rsp + 0xb80 ]
mov r14, [ rsp + 0xcc0 ]
mov r14, [ rsp + 0xcf0 ]
mov r14, [ rsp + 0xd20 ]
mov r14, [ rsp + 0xdd0 ]
mov r14, [ rsp + 0xe90 ]
mov r14, [ rsp + 0xfa8 ]
mov r14, [ rsp + 0xfc0 ]
mov r14, [ rsp + 0xfc8 ]
mov r14, [ rsp + 0xfd8 ]
mov [ r15 + 0x10 ], rdx
mov [ r15 + 0x88 ], rdx
mov r15, r10
mov r15, r11
mov r15, r12
mov r15, r13
mov r15, r14
mov r15, r8
mov r15, r9
mov r15, rax
mov r15, rbp
mov r15, rbx
mov r15, rcx
mov r15, rdi
mov r15, rdx
mov r15, rsi
mov r15, [ rsi + 0x0 ]
mov r15, [ rsi + 0xb8 ]
mov r15, [ rsp + 0x0 ]
mov r15, [ rsp + 0x1070 ]
mov r15, [ rsp + 0x10b0 ]
mov r15, [ rsp + 0x10c8 ]
mov r15, [ rsp + 0x10e8 ]
mov r15, [ rsp + 0x1150 ]
mov r15, [ rsp + 0x1318 ]
mov r15, [ rsp + 0x1378 ]
mov r15, [ rsp + 0x14f8 ]
mov r15, [ rsp + 0x160 ]
mov r15, [ rsp + 0x1668 ]
mov r15, [ rsp + 0x1680 ]
mov r15, [ rsp + 0x16a0 ]
mov r15, [ rsp + 0x1718 ]
mov r15, [ rsp + 0x17a0 ]
mov r15, [ rsp + 0x17c8 ]
mov r15, [ rsp + 0x17d8 ]
mov r15, [ rsp + 0x17e0 ]
mov r15, [ rsp + 0x17e8 ]
mov r15, [ rsp + 0x1800 ]
mov r15, [ rsp + 0x18b0 ]
mov r15, [ rsp + 0x1900 ]
mov r15, [ rsp + 0x19d8 ]
mov r15, [ rsp + 0x1a18 ]
mov r15, [ rsp + 0x1a48 ]
mov r15, [ rsp + 0x1a68 ]
mov r15, [ rsp + 0x1ae0 ]
mov r15, [ rsp + 0x1b78 ]
mov r15, [ rsp + 0x1bc0 ]
mov r15, [ rsp + 0x1c78 ]
mov r15, [ rsp + 0x1d88 ]
mov r15, [ rsp + 0x1e38 ]
mov r15, [ rsp + 0x1ee8 ]
mov r15, [ rsp + 0x1f0 ]
mov r15, [ rsp + 0x20c0 ]
mov r15, [ rsp + 0x2130 ]
mov r15, [ rsp + 0x2190 ]
mov r15, [ rsp + 0x22d0 ]
mov r15, [ rsp + 0x22e0 ]
mov r15, [ rsp + 0x2390 ]
mov r15, [ rsp + 0x25d0 ]
mov r15, [ rsp + 0x2800 ]
mov r15, [ rsp + 0x2890 ]
mov r15, [ rsp + 0x2898 ]
mov r15, [ rsp + 0x28e8 ]
mov r15, [ rsp + 0x2998 ]
mov r15, [ rsp + 0x29b8 ]
mov r15, [ rsp + 0x2a30 ]
mov r15, [ rsp + 0x2a48 ]
mov r15, [ rsp + 0x2a58 ]
mov r15, [ rsp + 0x2a60 ]
mov r15, [ rsp + 0x2b0 ]
mov r15, [ rsp + 0x2b38 ]
mov r15, [ rsp + 0x2c58 ]
mov r15, [ rsp + 0x2ce0 ]
mov r15, [ rsp + 0x2d0 ]
mov r15, [ rsp + 0x2d10 ]
mov r15, [ rsp + 0x2d40 ]
mov r15, [ rsp + 0x2e00 ]
mov r15, [ rsp + 0x2ee0 ]
mov r15, [ rsp + 0x2f28 ]
mov r15, [ rsp + 0x30c0 ]
mov r15, [ rsp + 0x3128 ]
mov r15, [ rsp + 0x3170 ]
mov r15, [ rsp + 0x31b8 ]
mov r15, [ rsp + 0x3218 ]
mov r15, [ rsp + 0x32c8 ]
mov r15, [ rsp + 0x32e8 ]
mov r15, [ rsp + 0x32f0 ]
mov r15, [ rsp + 0x3338 ]
mov r15, [ rsp + 0x3370 ]
mov r15, [ rsp + 0x3558 ]
mov r15, [ rsp + 0x358 ]
mov r15, [ rsp + 0x3580 ]
mov r15, [ rsp + 0x3638 ]
mov r15, [ rsp + 0x3648 ]
mov r15, [ rsp + 0x3798 ]
mov r15, [ rsp + 0x38e8 ]
mov r15, [ rsp + 0x3940 ]
mov r15, [ rsp + 0x39a0 ]
mov r15, [ rsp + 0x3c0 ]
mov r15, [ rsp + 0x3d8 ]
mov r15, [ rsp + 0x3f0 ]
mov r15, [ rsp + 0x48 ]
mov r15, [ rsp + 0x488 ]
mov r15, [ rsp + 0x4c8 ]
mov r15, [ rsp + 0x548 ]
mov r15, [ rsp + 0x698 ]
mov r15, [ rsp + 0x6c8 ]
mov r15, [ rsp + 0x758 ]
mov r15, [ rsp + 0x7e8 ]
mov r15, [ rsp + 0x800 ]
mov r15, [ rsp + 0x898 ]
mov r15, [ rsp + 0x8c8 ]
mov r15, [ rsp + 0x9b0 ]
mov r15, [ rsp + 0xa28 ]
mov r15, [ rsp + 0xa88 ]
mov r15, [ rsp + 0xaa8 ]
mov r15, [ rsp + 0xb0 ]
mov r15, [ rsp + 0xb18 ]
mov r15, [ rsp + 0xb38 ]
mov r15, [ rsp + 0xbb0 ]
mov r15, [ rsp + 0xbb8 ]
mov r15, [ rsp + 0xc18 ]
mov r15, [ rsp + 0xc28 ]
mov r15, [ rsp + 0xcc8 ]
mov r15, [ rsp + 0xcf8 ]
mov r15, [ rsp + 0xd10 ]
mov r15, [ rsp + 0xd90 ]
mov r15, [ rsp + 0xdc0 ]
mov r15, [ rsp + 0xe10 ]
mov r15, [ rsp + 0xe80 ]
mov r15, [ rsp + 0xf98 ]
mov r8, r10
mov r8, r11
mov r8, r12
mov r8, r13
mov r8, r14
mov r8, r15
mov r8, r9
mov r8, rax
mov r8, rbp
mov r8, rbx
mov r8, rcx
mov r8, rdi
mov r8, rdx
mov r8, rsi
mov r8, [ rsi + 0x38 ]
mov r8, [ rsi + 0x40 ]
mov r8, [ rsp + 0x1010 ]
mov r8, [ rsp + 0x1088 ]
mov r8, [ rsp + 0x1120 ]
mov r8, [ rsp + 0x1168 ]
mov r8, [ rsp + 0x1230 ]
mov r8, [ rsp + 0x1268 ]
mov r8, [ rsp + 0x1340 ]
mov r8, [ rsp + 0x1350 ]
mov r8, [ rsp + 0x1368 ]
mov r8, [ rsp + 0x13a0 ]
mov r8, [ rsp + 0x1400 ]
mov r8, [ rsp + 0x14e8 ]
mov r8, [ rsp + 0x15e8 ]
mov r8, [ rsp + 0x15f8 ]
mov r8, [ rsp + 0x1610 ]
mov r8, [ rsp + 0x1640 ]
mov r8, [ rsp + 0x1738 ]
mov r8, [ rsp + 0x1740 ]
mov r8, [ rsp + 0x1768 ]
mov r8, [ rsp + 0x1820 ]
mov r8, [ rsp + 0x1830 ]
mov r8, [ rsp + 0x1838 ]
mov r8, [ rsp + 0x1878 ]
mov r8, [ rsp + 0x1900 ]
mov r8, [ rsp + 0x1918 ]
mov r8, [ rsp + 0x1948 ]
mov r8, [ rsp + 0x19b0 ]
mov r8, [ rsp + 0x1a08 ]
mov r8, [ rsp + 0x1a90 ]
mov r8, [ rsp + 0x1aa8 ]
mov r8, [ rsp + 0x1b00 ]
mov r8, [ rsp + 0x1b20 ]
mov r8, [ rsp + 0x1b50 ]
mov r8, [ rsp + 0x1b60 ]
mov r8, [ rsp + 0x1b78 ]
mov r8, [ rsp + 0x1cd0 ]
mov r8, [ rsp + 0x1d50 ]
mov r8, [ rsp + 0x1df8 ]
mov r8, [ rsp + 0x1e48 ]
mov r8, [ rsp + 0x1ed0 ]
mov r8, [ rsp + 0x1f18 ]
mov r8, [ rsp + 0x1fb8 ]
mov r8, [ rsp + 0x2000 ]
mov r8, [ rsp + 0x2008 ]
mov r8, [ rsp + 0x2018 ]
mov r8, [ rsp + 0x2028 ]
mov r8, [ rsp + 0x208 ]
mov r8, [ rsp + 0x21d0 ]
mov r8, [ rsp + 0x2208 ]
mov r8, [ rsp + 0x2278 ]
mov r8, [ rsp + 0x2290 ]
mov r8, [ rsp + 0x2450 ]
mov r8, [ rsp + 0x2488 ]
mov r8, [ rsp + 0x2490 ]
mov r8, [ rsp + 0x2550 ]
mov r8, [ rsp + 0x2608 ]
mov r8, [ rsp + 0x2650 ]
mov r8, [ rsp + 0x2680 ]
mov r8, [ rsp + 0x27f8 ]
mov r8, [ rsp + 0x2800 ]
mov r8, [ rsp + 0x28a0 ]
mov r8, [ rsp + 0x2980 ]
mov r8, [ rsp + 0x2a88 ]
mov r8, [ rsp + 0x2c98 ]
mov r8, [ rsp + 0x2ca0 ]
mov r8, [ rsp + 0x2d28 ]
mov r8, [ rsp + 0x2d80 ]
mov r8, [ rsp + 0x2dd8 ]
mov r8, [ rsp + 0x3010 ]
mov r8, [ rsp + 0x3048 ]
mov r8, [ rsp + 0x3150 ]
mov r8, [ rsp + 0x3160 ]
mov r8, [ rsp + 0x3300 ]
mov r8, [ rsp + 0x3318 ]
mov r8, [ rsp + 0x3330 ]
mov r8, [ rsp + 0x33e8 ]
mov r8, [ rsp + 0x33f0 ]
mov r8, [ rsp + 0x3428 ]
mov r8, [ rsp + 0x3438 ]
mov r8, [ rsp + 0x3480 ]
mov r8, [ rsp + 0x3520 ]
mov r8, [ rsp + 0x35d8 ]
mov r8, [ rsp + 0x3858 ]
mov r8, [ rsp + 0x3910 ]
mov r8, [ rsp + 0x478 ]
mov r8, [ rsp + 0x4a8 ]
mov r8, [ rsp + 0x50 ]
mov r8, [ rsp + 0x528 ]
mov r8, [ rsp + 0x548 ]
mov r8, [ rsp + 0x550 ]
mov r8, [ rsp + 0x570 ]
mov r8, [ rsp + 0x5e0 ]
mov r8, [ rsp + 0x5e8 ]
mov r8, [ rsp + 0x638 ]
mov r8, [ rsp + 0x740 ]
mov r8, [ rsp + 0x968 ]
mov r8, [ rsp + 0xa40 ]
mov r8, [ rsp + 0xad0 ]
mov r8, [ rsp + 0xb30 ]
mov r8, [ rsp + 0xb68 ]
mov r8, [ rsp + 0xd28 ]
mov r8, [ rsp + 0xd70 ]
mov r8, [ rsp + 0xd88 ]
mov r8, [ rsp + 0xdf8 ]
mov r8, [ rsp + 0xe50 ]
mov r8, [ rsp + 0xe78 ]
mov r8, [ rsp + 0xeb8 ]
mov r8, [ rsp + 0xed8 ]
mov r8, [ rsp + 0xf0 ]
mov r8, [ rsp + 0xf18 ]
mov r8, [ rsp + 0xf50 ]
mov r8, [ rsp + 0xf58 ]
mov r8, [ rsp + 0xf68 ]
mov r8, [ rsp + 0xf88 ]
mov [ r9 + 0x0 ], r14
mov [ r9 + 0x20 ], r13
mov [ r9 + 0x28 ], r12
mov [ r9 + 0x48 ], r14
mov [ r9 + 0x58 ], r14
mov [ r9 + 0x60 ], r14
mov [ r9 + 0xa8 ], r14
mov r9, r10
mov r9, r11
mov r9, r12
mov r9, r13
mov r9, r14
mov r9, r15
mov r9, r8
mov r9, rax
mov r9, rbp
mov r9, rbx
mov r9, rcx
mov r9, rdi
mov r9, rdx
mov r9, rsi
mov r9, [ rsi + 0x60 ]
mov r9, [ rsi + 0x80 ]
mov r9, [ rsi + 0x88 ]
mov r9, [ rsp + 0x1040 ]
mov r9, [ rsp + 0x10a0 ]
mov r9, [ rsp + 0x10a8 ]
mov r9, [ rsp + 0x10e8 ]
mov r9, [ rsp + 0x1118 ]
mov r9, [ rsp + 0x1128 ]
mov r9, [ rsp + 0x1138 ]
mov r9, [ rsp + 0x1188 ]
mov r9, [ rsp + 0x1338 ]
mov r9, [ rsp + 0x13b8 ]
mov r9, [ rsp + 0x13c0 ]
mov r9, [ rsp + 0x1448 ]
mov r9, [ rsp + 0x1450 ]
mov r9, [ rsp + 0x14f8 ]
mov r9, [ rsp + 0x1518 ]
mov r9, [ rsp + 0x15b0 ]
mov r9, [ rsp + 0x1608 ]
mov r9, [ rsp + 0x1788 ]
mov r9, [ rsp + 0x17a8 ]
mov r9, [ rsp + 0x18d8 ]
mov r9, [ rsp + 0x1938 ]
mov r9, [ rsp + 0x1948 ]
mov r9, [ rsp + 0x1b30 ]
mov r9, [ rsp + 0x1ca8 ]
mov r9, [ rsp + 0x1cb0 ]
mov r9, [ rsp + 0x1d98 ]
mov r9, [ rsp + 0x1da0 ]
mov r9, [ rsp + 0x1e08 ]
mov r9, [ rsp + 0x1e50 ]
mov r9, [ rsp + 0x1e70 ]
mov r9, [ rsp + 0x2048 ]
mov r9, [ rsp + 0x21c8 ]
mov r9, [ rsp + 0x2210 ]
mov r9, [ rsp + 0x2238 ]
mov r9, [ rsp + 0x2250 ]
mov r9, [ rsp + 0x2280 ]
mov r9, [ rsp + 0x22a0 ]
mov r9, [ rsp + 0x230 ]
mov r9, [ rsp + 0x2368 ]
mov r9, [ rsp + 0x23b0 ]
mov r9, [ rsp + 0x2470 ]
mov r9, [ rsp + 0x2568 ]
mov r9, [ rsp + 0x2598 ]
mov r9, [ rsp + 0x25a0 ]
mov r9, [ rsp + 0x2640 ]
mov r9, [ rsp + 0x26d0 ]
mov r9, [ rsp + 0x26e8 ]
mov r9, [ rsp + 0x2730 ]
mov r9, [ rsp + 0x2748 ]
mov r9, [ rsp + 0x2788 ]
mov r9, [ rsp + 0x2798 ]
mov r9, [ rsp + 0x27a8 ]
mov r9, [ rsp + 0x27b0 ]
mov r9, [ rsp + 0x27f8 ]
mov r9, [ rsp + 0x2830 ]
mov r9, [ rsp + 0x2b78 ]
mov r9, [ rsp + 0x2c78 ]
mov r9, [ rsp + 0x2c8 ]
mov r9, [ rsp + 0x2cb0 ]
mov r9, [ rsp + 0x2d0 ]
mov r9, [ rsp + 0x2e58 ]
mov r9, [ rsp + 0x2f18 ]
mov r9, [ rsp + 0x3120 ]
mov r9, [ rsp + 0x328 ]
mov r9, [ rsp + 0x33d8 ]
mov r9, [ rsp + 0x33f8 ]
mov r9, [ rsp + 0x3418 ]
mov r9, [ rsp + 0x3420 ]
mov r9, [ rsp + 0x3470 ]
mov r9, [ rsp + 0x3620 ]
mov r9, [ rsp + 0x3688 ]
mov r9, [ rsp + 0x3778 ]
mov r9, [ rsp + 0x38b8 ]
mov r9, [ rsp + 0x3920 ]
mov r9, [ rsp + 0x3d0 ]
mov r9, [ rsp + 0x428 ]
mov r9, [ rsp + 0x438 ]
mov r9, [ rsp + 0x48 ]
mov r9, [ rsp + 0x480 ]
mov r9, [ rsp + 0x488 ]
mov r9, [ rsp + 0x498 ]
mov r9, [ rsp + 0x650 ]
mov r9, [ rsp + 0x660 ]
mov r9, [ rsp + 0x748 ]
mov r9, [ rsp + 0x758 ]
mov r9, [ rsp + 0x770 ]
mov r9, [ rsp + 0x868 ]
mov r9, [ rsp + 0x938 ]
mov r9, [ rsp + 0x9d0 ]
mov r9, [ rsp + 0xa90 ]
mov r9, [ rsp + 0xac0 ]
mov r9, [ rsp + 0xb80 ]
mov r9, [ rsp + 0xc18 ]
mov r9, [ rsp + 0xc8 ]
mov r9, [ rsp + 0xc80 ]
mov r9, [ rsp + 0xda0 ]
mov r9, [ rsp + 0xf10 ]
mov r9, [ rsp + 0xf40 ]
mov r9, [ rsp + 0xf80 ]
mov r9, [ rsp + 0xfb8 ]
mov r9, [ rsp + 0xfc8 ]
mov rax, r10
mov rax, r11
mov rax, r12
mov rax, r13
mov rax, r14
mov rax, r15
mov rax, r8
mov rax, r9
mov rax, rbp
mov rax, rbx
mov rax, rcx
mov rax, rdi
mov rax, rdx
mov rax, rsi
mov rax, [ rsi + 0x10 ]
mov rax, [ rsp + 0x1028 ]
mov rax, [ rsp + 0x10e0 ]
mov rax, [ rsp + 0x1210 ]
mov rax, [ rsp + 0x128 ]
mov rax, [ rsp + 0x1290 ]
mov rax, [ rsp + 0x1320 ]
mov rax, [ rsp + 0x1348 ]
mov rax, [ rsp + 0x13e0 ]
mov rax, [ rsp + 0x1510 ]
mov rax, [ rsp + 0x1538 ]
mov rax, [ rsp + 0x1550 ]
mov rax, [ rsp + 0x15e0 ]
mov rax, [ rsp + 0x1638 ]
mov rax, [ rsp + 0x1690 ]
mov rax, [ rsp + 0x16c0 ]
mov rax, [ rsp + 0x16d0 ]
mov rax, [ rsp + 0x16d8 ]
mov rax, [ rsp + 0x16e8 ]
mov rax, [ rsp + 0x16f8 ]
mov rax, [ rsp + 0x1780 ]
mov rax, [ rsp + 0x1798 ]
mov rax, [ rsp + 0x17c0 ]
mov rax, [ rsp + 0x18a0 ]
mov rax, [ rsp + 0x1a38 ]
mov rax, [ rsp + 0x1a40 ]
mov rax, [ rsp + 0x1b28 ]
mov rax, [ rsp + 0x1b78 ]
mov rax, [ rsp + 0x1b90 ]
mov rax, [ rsp + 0x1c88 ]
mov rax, [ rsp + 0x1e0 ]
mov rax, [ rsp + 0x1ea0 ]
mov rax, [ rsp + 0x1fd0 ]
mov rax, [ rsp + 0x2090 ]
mov rax, [ rsp + 0x20d0 ]
mov rax, [ rsp + 0x2128 ]
mov rax, [ rsp + 0x2168 ]
mov rax, [ rsp + 0x218 ]
mov rax, [ rsp + 0x2240 ]
mov rax, [ rsp + 0x22a8 ]
mov rax, [ rsp + 0x22c0 ]
mov rax, [ rsp + 0x24a0 ]
mov rax, [ rsp + 0x24c8 ]
mov rax, [ rsp + 0x25f8 ]
mov rax, [ rsp + 0x2610 ]
mov rax, [ rsp + 0x2750 ]
mov rax, [ rsp + 0x2778 ]
mov rax, [ rsp + 0x2860 ]
mov rax, [ rsp + 0x28d0 ]
mov rax, [ rsp + 0x2a18 ]
mov rax, [ rsp + 0x2a8 ]
mov rax, [ rsp + 0x2ad0 ]
mov rax, [ rsp + 0x2ad8 ]
mov rax, [ rsp + 0x2b40 ]
mov rax, [ rsp + 0x2bf0 ]
mov rax, [ rsp + 0x2c0 ]
mov rax, [ rsp + 0x2c68 ]
mov rax, [ rsp + 0x2cd0 ]
mov rax, [ rsp + 0x2d18 ]
mov rax, [ rsp + 0x2d68 ]
mov rax, [ rsp + 0x2d88 ]
mov rax, [ rsp + 0x2dc8 ]
mov rax, [ rsp + 0x2e90 ]
mov rax, [ rsp + 0x2ed8 ]
mov rax, [ rsp + 0x2f50 ]
mov rax, [ rsp + 0x2f60 ]
mov rax, [ rsp + 0x3060 ]
mov rax, [ rsp + 0x3078 ]
mov rax, [ rsp + 0x30f0 ]
mov rax, [ rsp + 0x3130 ]
mov rax, [ rsp + 0x318 ]
mov rax, [ rsp + 0x3240 ]
mov rax, [ rsp + 0x3298 ]
mov rax, [ rsp + 0x3310 ]
mov rax, [ rsp + 0x338 ]
mov rax, [ rsp + 0x3398 ]
mov rax, [ rsp + 0x33a0 ]
mov rax, [ rsp + 0x33e0 ]
mov rax, [ rsp + 0x340 ]
mov rax, [ rsp + 0x3448 ]
mov rax, [ rsp + 0x3460 ]
mov rax, [ rsp + 0x3478 ]
mov rax, [ rsp + 0x348 ]
mov rax, [ rsp + 0x3530 ]
mov rax, [ rsp + 0x35d0 ]
mov rax, [ rsp + 0x3670 ]
mov rax, [ rsp + 0x36b0 ]
mov rax, [ rsp + 0x36c0 ]
mov rax, [ rsp + 0x36f0 ]
mov rax, [ rsp + 0x370 ]
mov rax, [ rsp + 0x37c8 ]
mov rax, [ rsp + 0x3820 ]
mov rax, [ rsp + 0x38e0 ]
mov rax, [ rsp + 0x418 ]
mov rax, [ rsp + 0x4a0 ]
mov rax, [ rsp + 0x530 ]
mov rax, [ rsp + 0x588 ]
mov rax, [ rsp + 0x5d0 ]
mov rax, [ rsp + 0x5f8 ]
mov rax, [ rsp + 0x610 ]
mov rax, [ rsp + 0x688 ]
mov rax, [ rsp + 0x78 ]
mov rax, [ rsp + 0x780 ]
mov rax, [ rsp + 0x80 ]
mov rax, [ rsp + 0x88 ]
mov rax, [ rsp + 0x880 ]
mov rax, [ rsp + 0x888 ]
mov rax, [ rsp + 0x8a0 ]
mov rax, [ rsp + 0x8d0 ]
mov rax, [ rsp + 0x8f0 ]
mov rax, [ rsp + 0x928 ]
mov rax, [ rsp + 0x988 ]
mov rax, [ rsp + 0x9d0 ]
mov rax, [ rsp + 0x9e8 ]
mov rax, [ rsp + 0xa08 ]
mov rax, [ rsp + 0xa48 ]
mov rax, [ rsp + 0xab0 ]
mov rax, [ rsp + 0xae0 ]
mov rax, [ rsp + 0xb10 ]
mov rax, [ rsp + 0xb58 ]
mov rax, [ rsp + 0xbc8 ]
mov rax, [ rsp + 0xc10 ]
mov rax, [ rsp + 0xc90 ]
mov rax, [ rsp + 0xc98 ]
mov rax, [ rsp + 0xcc8 ]
mov rax, [ rsp + 0xcd0 ]
mov rax, [ rsp + 0xd28 ]
mov rax, [ rsp + 0xd58 ]
mov rax, [ rsp + 0xe70 ]
mov rax, [ rsp + 0xf08 ]
mov rax, [ rsp + 0xf28 ]
mov rax, [ rsp + 0xf48 ]
mov rax, [ rsp + 0xf80 ]
mov rax, [ rsp + 0xf98 ]
mov rbp, r10
mov rbp, r11
mov rbp, r12
mov rbp, r13
mov rbp, r14
mov rbp, r15
mov rbp, r8
mov rbp, r9
mov rbp, rax
mov rbp, rbx
mov rbp, rcx
mov rbp, rdi
mov rbp, rdx
mov rbp, rsi
mov rbp, [ rsp + 0x1008 ]
mov rbp, [ rsp + 0x1038 ]
mov rbp, [ rsp + 0x1180 ]
mov rbp, [ rsp + 0x1328 ]
mov rbp, [ rsp + 0x140 ]
mov rbp, [ rsp + 0x1430 ]
mov rbp, [ rsp + 0x1530 ]
mov rbp, [ rsp + 0x1600 ]
mov rbp, [ rsp + 0x1660 ]
mov rbp, [ rsp + 0x1678 ]
mov rbp, [ rsp + 0x16a8 ]
mov rbp, [ rsp + 0x1710 ]
mov rbp, [ rsp + 0x1768 ]
mov rbp, [ rsp + 0x1868 ]
mov rbp, [ rsp + 0x1870 ]
mov rbp, [ rsp + 0x18b8 ]
mov rbp, [ rsp + 0x18d8 ]
mov rbp, [ rsp + 0x18f0 ]
mov rbp, [ rsp + 0x1930 ]
mov rbp, [ rsp + 0x19b0 ]
mov rbp, [ rsp + 0x19e0 ]
mov rbp, [ rsp + 0x19e8 ]
mov rbp, [ rsp + 0x1c20 ]
mov rbp, [ rsp + 0x1c98 ]
mov rbp, [ rsp + 0x1ca0 ]
mov rbp, [ rsp + 0x1d80 ]
mov rbp, [ rsp + 0x1d88 ]
mov rbp, [ rsp + 0x1da8 ]
mov rbp, [ rsp + 0x1e30 ]
mov rbp, [ rsp + 0x1e68 ]
mov rbp, [ rsp + 0x1e8 ]
mov rbp, [ rsp + 0x1f38 ]
mov rbp, [ rsp + 0x2070 ]
mov rbp, [ rsp + 0x2098 ]
mov rbp, [ rsp + 0x2100 ]
mov rbp, [ rsp + 0x2188 ]
mov rbp, [ rsp + 0x2260 ]
mov rbp, [ rsp + 0x2270 ]
mov rbp, [ rsp + 0x2288 ]
mov rbp, [ rsp + 0x2418 ]
mov rbp, [ rsp + 0x248 ]
mov rbp, [ rsp + 0x24e0 ]
mov rbp, [ rsp + 0x2598 ]
mov rbp, [ rsp + 0x2648 ]
mov rbp, [ rsp + 0x2770 ]
mov rbp, [ rsp + 0x278 ]
mov rbp, [ rsp + 0x2790 ]
mov rbp, [ rsp + 0x28 ]
mov rbp, [ rsp + 0x2868 ]
mov rbp, [ rsp + 0x28c8 ]
mov rbp, [ rsp + 0x2948 ]
mov rbp, [ rsp + 0x29c0 ]
mov rbp, [ rsp + 0x2a70 ]
mov rbp, [ rsp + 0x2c40 ]
mov rbp, [ rsp + 0x2ca0 ]
mov rbp, [ rsp + 0x2d50 ]
mov rbp, [ rsp + 0x2df0 ]
mov rbp, [ rsp + 0x2e28 ]
mov rbp, [ rsp + 0x2e38 ]
mov rbp, [ rsp + 0x2e78 ]
mov rbp, [ rsp + 0x2f40 ]
mov rbp, [ rsp + 0x2fa0 ]
mov rbp, [ rsp + 0x2fb8 ]
mov rbp, [ rsp + 0x2fc8 ]
mov rbp, [ rsp + 0x30 ]
mov rbp, [ rsp + 0x3008 ]
mov rbp, [ rsp + 0x3048 ]
mov rbp, [ rsp + 0x3070 ]
mov rbp, [ rsp + 0x30a8 ]
mov rbp, [ rsp + 0x3138 ]
mov rbp, [ rsp + 0x3188 ]
mov rbp, [ rsp + 0x3210 ]
mov rbp, [ rsp + 0x3258 ]
mov rbp, [ rsp + 0x3270 ]
mov rbp, [ rsp + 0x3328 ]
mov rbp, [ rsp + 0x3340 ]
mov rbp, [ rsp + 0x3368 ]
mov rbp, [ rsp + 0x3378 ]
mov rbp, [ rsp + 0x3420 ]
mov rbp, [ rsp + 0x3458 ]
mov rbp, [ rsp + 0x3598 ]
mov rbp, [ rsp + 0x35b0 ]
mov rbp, [ rsp + 0x36d8 ]
mov rbp, [ rsp + 0x3818 ]
mov rbp, [ rsp + 0x3980 ]
mov rbp, [ rsp + 0x3e8 ]
mov rbp, [ rsp + 0x4e8 ]
mov rbp, [ rsp + 0x5a8 ]
mov rbp, [ rsp + 0x5d0 ]
mov rbp, [ rsp + 0x628 ]
mov rbp, [ rsp + 0x6e8 ]
mov rbp, [ rsp + 0x760 ]
mov rbp, [ rsp + 0x828 ]
mov rbp, [ rsp + 0x8e8 ]
mov rbp, [ rsp + 0x918 ]
mov rbp, [ rsp + 0x98 ]
mov rbp, [ rsp + 0x9d8 ]
mov rbp, [ rsp + 0xa00 ]
mov rbp, [ rsp + 0xb80 ]
mov rbp, [ rsp + 0xc18 ]
mov rbp, [ rsp + 0xc70 ]
mov rbp, [ rsp + 0xce0 ]
mov rbp, [ rsp + 0xd40 ]
mov rbp, [ rsp + 0xd60 ]
mov rbp, [ rsp + 0xe00 ]
mov rbp, [ rsp + 0xe50 ]
mov rbp, [ rsp + 0xf8 ]
mov [ rbx + 0x38 ], r11
mov [ rbx + 0x98 ], r12
mov rbx, r10
mov rbx, r11
mov rbx, r12
mov rbx, r13
mov rbx, r14
mov rbx, r15
mov rbx, r8
mov rbx, r9
mov rbx, rax
mov rbx, rbp
mov rbx, rcx
mov rbx, rdi
mov rbx, rdx
mov rbx, rsi
mov rbx, [ rsi + 0x90 ]
mov rbx, [ rsp + 0x1058 ]
mov rbx, [ rsp + 0x11b8 ]
mov rbx, [ rsp + 0x1218 ]
mov rbx, [ rsp + 0x1230 ]
mov rbx, [ rsp + 0x1260 ]
mov rbx, [ rsp + 0x1280 ]
mov rbx, [ rsp + 0x1360 ]
mov rbx, [ rsp + 0x1370 ]
mov rbx, [ rsp + 0x1380 ]
mov rbx, [ rsp + 0x1410 ]
mov rbx, [ rsp + 0x1858 ]
mov rbx, [ rsp + 0x19a0 ]
mov rbx, [ rsp + 0x1a10 ]
mov rbx, [ rsp + 0x1a20 ]
mov rbx, [ rsp + 0x1ac8 ]
mov rbx, [ rsp + 0x1b8 ]
mov rbx, [ rsp + 0x1be8 ]
mov rbx, [ rsp + 0x1c18 ]
mov rbx, [ rsp + 0x1c28 ]
mov rbx, [ rsp + 0x1c70 ]
mov rbx, [ rsp + 0x1c88 ]
mov rbx, [ rsp + 0x1e0 ]
mov rbx, [ rsp + 0x1e78 ]
mov rbx, [ rsp + 0x1ee8 ]
mov rbx, [ rsp + 0x1ef0 ]
mov rbx, [ rsp + 0x1ff8 ]
mov rbx, [ rsp + 0x20 ]
mov rbx, [ rsp + 0x20b8 ]
mov rbx, [ rsp + 0x20f0 ]
mov rbx, [ rsp + 0x2100 ]
mov rbx, [ rsp + 0x2160 ]
mov rbx, [ rsp + 0x2198 ]
mov rbx, [ rsp + 0x21c0 ]
mov rbx, [ rsp + 0x2200 ]
mov rbx, [ rsp + 0x22f8 ]
mov rbx, [ rsp + 0x230 ]
mov rbx, [ rsp + 0x2348 ]
mov rbx, [ rsp + 0x2370 ]
mov rbx, [ rsp + 0x23a0 ]
mov rbx, [ rsp + 0x24f8 ]
mov rbx, [ rsp + 0x2518 ]
mov rbx, [ rsp + 0x2540 ]
mov rbx, [ rsp + 0x26b0 ]
mov rbx, [ rsp + 0x270 ]
mov rbx, [ rsp + 0x2770 ]
mov rbx, [ rsp + 0x27c0 ]
mov rbx, [ rsp + 0x28b0 ]
mov rbx, [ rsp + 0x28b8 ]
mov rbx, [ rsp + 0x28f8 ]
mov rbx, [ rsp + 0x2928 ]
mov rbx, [ rsp + 0x2998 ]
mov rbx, [ rsp + 0x2ab0 ]
mov rbx, [ rsp + 0x2d30 ]
mov rbx, [ rsp + 0x2da8 ]
mov rbx, [ rsp + 0x2e08 ]
mov rbx, [ rsp + 0x2e40 ]
mov rbx, [ rsp + 0x2e50 ]
mov rbx, [ rsp + 0x2eb8 ]
mov rbx, [ rsp + 0x2ef8 ]
mov rbx, [ rsp + 0x2f38 ]
mov rbx, [ rsp + 0x3010 ]
mov rbx, [ rsp + 0x3188 ]
mov rbx, [ rsp + 0x3198 ]
mov rbx, [ rsp + 0x31a0 ]
mov rbx, [ rsp + 0x31c8 ]
mov rbx, [ rsp + 0x31e8 ]
mov rbx, [ rsp + 0x32b0 ]
mov rbx, [ rsp + 0x32f8 ]
mov rbx, [ rsp + 0x3388 ]
mov rbx, [ rsp + 0x33b0 ]
mov rbx, [ rsp + 0x33c8 ]
mov rbx, [ rsp + 0x340 ]
mov rbx, [ rsp + 0x3490 ]
mov rbx, [ rsp + 0x34a0 ]
mov rbx, [ rsp + 0x34e8 ]
mov rbx, [ rsp + 0x3518 ]
mov rbx, [ rsp + 0x3540 ]
mov rbx, [ rsp + 0x360 ]
mov rbx, [ rsp + 0x3720 ]
mov rbx, [ rsp + 0x3750 ]
mov rbx, [ rsp + 0x37c0 ]
mov rbx, [ rsp + 0x3800 ]
mov rbx, [ rsp + 0x3808 ]
mov rbx, [ rsp + 0x3978 ]
mov rbx, [ rsp + 0x3f8 ]
mov rbx, [ rsp + 0x40 ]
mov rbx, [ rsp + 0x468 ]
mov rbx, [ rsp + 0x48 ]
mov rbx, [ rsp + 0x5c8 ]
mov rbx, [ rsp + 0x608 ]
mov rbx, [ rsp + 0x648 ]
mov rbx, [ rsp + 0x668 ]
mov rbx, [ rsp + 0x698 ]
mov rbx, [ rsp + 0x6d8 ]
mov rbx, [ rsp + 0x6f0 ]
mov rbx, [ rsp + 0x738 ]
mov rbx, [ rsp + 0x838 ]
mov rbx, [ rsp + 0x878 ]
mov rbx, [ rsp + 0x950 ]
mov rbx, [ rsp + 0x9b8 ]
mov rbx, [ rsp + 0x9c0 ]
mov rbx, [ rsp + 0x9e0 ]
mov rbx, [ rsp + 0xa70 ]
mov rbx, [ rsp + 0xaa0 ]
mov rbx, [ rsp + 0xb00 ]
mov rbx, [ rsp + 0xb50 ]
mov rbx, [ rsp + 0xb78 ]
mov rbx, [ rsp + 0xba0 ]
mov rbx, [ rsp + 0xc00 ]
mov rbx, [ rsp + 0xdb0 ]
mov rbx, [ rsp + 0xdf0 ]
mov rbx, [ rsp + 0xe0 ]
mov rbx, [ rsp + 0xe28 ]
mov rbx, [ rsp + 0xea8 ]
mov rbx, [ rsp + 0xef8 ]
mov rbx, [ rsp + 0xf38 ]
mov rbx, [ rsp + 0xfa0 ]
mov rbx, [ rsp + 0xfb0 ]
mov rcx, r10
mov rcx, r11
mov rcx, r12
mov rcx, r13
mov rcx, r14
mov rcx, r15
mov rcx, r8
mov rcx, r9
mov rcx, rax
mov rcx, rbp
mov rcx, rbx
mov rcx, rdi
mov rcx, rdx
mov rcx, rsi
mov rcx, [ rsi + 0x30 ]
mov rcx, [ rsi + 0x78 ]
mov rcx, [ rsp + 0x100 ]
mov rcx, [ rsp + 0x1060 ]
mov rcx, [ rsp + 0x10f8 ]
mov rcx, [ rsp + 0x1108 ]
mov rcx, [ rsp + 0x11c0 ]
mov rcx, [ rsp + 0x11d8 ]
mov rcx, [ rsp + 0x1278 ]
mov rcx, [ rsp + 0x128 ]
mov rcx, [ rsp + 0x12a8 ]
mov rcx, [ rsp + 0x12c0 ]
mov rcx, [ rsp + 0x12c8 ]
mov rcx, [ rsp + 0x1308 ]
mov rcx, [ rsp + 0x13a8 ]
mov rcx, [ rsp + 0x13b0 ]
mov rcx, [ rsp + 0x140 ]
mov rcx, [ rsp + 0x14c8 ]
mov rcx, [ rsp + 0x150 ]
mov rcx, [ rsp + 0x1550 ]
mov rcx, [ rsp + 0x15b8 ]
mov rcx, [ rsp + 0x1658 ]
mov rcx, [ rsp + 0x16f8 ]
mov rcx, [ rsp + 0x170 ]
mov rcx, [ rsp + 0x1708 ]
mov rcx, [ rsp + 0x1728 ]
mov rcx, [ rsp + 0x1780 ]
mov rcx, [ rsp + 0x17d8 ]
mov rcx, [ rsp + 0x18d0 ]
mov rcx, [ rsp + 0x1918 ]
mov rcx, [ rsp + 0x1930 ]
mov rcx, [ rsp + 0x1958 ]
mov rcx, [ rsp + 0x19a8 ]
mov rcx, [ rsp + 0x19c8 ]
mov rcx, [ rsp + 0x1a30 ]
mov rcx, [ rsp + 0x1a40 ]
mov rcx, [ rsp + 0x1a50 ]
mov rcx, [ rsp + 0x1aa8 ]
mov rcx, [ rsp + 0x1ac8 ]
mov rcx, [ rsp + 0x1ad0 ]
mov rcx, [ rsp + 0x1b48 ]
mov rcx, [ rsp + 0x1bd0 ]
mov rcx, [ rsp + 0x1be0 ]
mov rcx, [ rsp + 0x1c0 ]
mov rcx, [ rsp + 0x1c38 ]
mov rcx, [ rsp + 0x1c90 ]
mov rcx, [ rsp + 0x1d00 ]
mov rcx, [ rsp + 0x1d28 ]
mov rcx, [ rsp + 0x1db8 ]
mov rcx, [ rsp + 0x1ec0 ]
mov rcx, [ rsp + 0x1ee8 ]
mov rcx, [ rsp + 0x1f08 ]
mov rcx, [ rsp + 0x1f28 ]
mov rcx, [ rsp + 0x1fa0 ]
mov rcx, [ rsp + 0x1fa8 ]
mov rcx, [ rsp + 0x200 ]
mov rcx, [ rsp + 0x2090 ]
mov rcx, [ rsp + 0x20e0 ]
mov rcx, [ rsp + 0x21d8 ]
mov rcx, [ rsp + 0x2240 ]
mov rcx, [ rsp + 0x2300 ]
mov rcx, [ rsp + 0x2350 ]
mov rcx, [ rsp + 0x240 ]
mov rcx, [ rsp + 0x24c0 ]
mov rcx, [ rsp + 0x24d8 ]
mov rcx, [ rsp + 0x2508 ]
mov rcx, [ rsp + 0x2538 ]
mov rcx, [ rsp + 0x258 ]
mov rcx, [ rsp + 0x25e8 ]
mov rcx, [ rsp + 0x260 ]
mov rcx, [ rsp + 0x2668 ]
mov rcx, [ rsp + 0x2670 ]
mov rcx, [ rsp + 0x26a0 ]
mov rcx, [ rsp + 0x26a8 ]
mov rcx, [ rsp + 0x2768 ]
mov rcx, [ rsp + 0x27b8 ]
mov rcx, [ rsp + 0x28c0 ]
mov rcx, [ rsp + 0x28f0 ]
mov rcx, [ rsp + 0x2900 ]
mov rcx, [ rsp + 0x29f8 ]
mov rcx, [ rsp + 0x2a38 ]
mov rcx, [ rsp + 0x2a68 ]
mov rcx, [ rsp + 0x2a80 ]
mov rcx, [ rsp + 0x2af0 ]
mov rcx, [ rsp + 0x2c18 ]
mov rcx, [ rsp + 0x2d70 ]
mov rcx, [ rsp + 0x2de8 ]
mov rcx, [ rsp + 0x2e0 ]
mov rcx, [ rsp + 0x2e60 ]
mov rcx, [ rsp + 0x2f20 ]
mov rcx, [ rsp + 0x2f38 ]
mov rcx, [ rsp + 0x2f70 ]
mov rcx, [ rsp + 0x2f88 ]
mov rcx, [ rsp + 0x3070 ]
mov rcx, [ rsp + 0x308 ]
mov rcx, [ rsp + 0x3080 ]
mov rcx, [ rsp + 0x3088 ]
mov rcx, [ rsp + 0x30b8 ]
mov rcx, [ rsp + 0x3148 ]
mov rcx, [ rsp + 0x31a0 ]
mov rcx, [ rsp + 0x3250 ]
mov rcx, [ rsp + 0x3268 ]
mov rcx, [ rsp + 0x3368 ]
mov rcx, [ rsp + 0x33b8 ]
mov rcx, [ rsp + 0x33c0 ]
mov rcx, [ rsp + 0x3400 ]
mov rcx, [ rsp + 0x3438 ]
mov rcx, [ rsp + 0x3468 ]
mov rcx, [ rsp + 0x34a8 ]
mov rcx, [ rsp + 0x34c8 ]
mov rcx, [ rsp + 0x34d0 ]
mov rcx, [ rsp + 0x3510 ]
mov rcx, [ rsp + 0x3568 ]
mov rcx, [ rsp + 0x35c8 ]
mov rcx, [ rsp + 0x35e8 ]
mov rcx, [ rsp + 0x3768 ]
mov rcx, [ rsp + 0x37a8 ]
mov rcx, [ rsp + 0x38 ]
mov rcx, [ rsp + 0x38f8 ]
mov rcx, [ rsp + 0x3938 ]
mov rcx, [ rsp + 0x398 ]
mov rcx, [ rsp + 0x3e8 ]
mov rcx, [ rsp + 0x498 ]
mov rcx, [ rsp + 0x558 ]
mov rcx, [ rsp + 0x5a0 ]
mov rcx, [ rsp + 0x5b0 ]
mov rcx, [ rsp + 0x6e0 ]
mov rcx, [ rsp + 0x710 ]
mov rcx, [ rsp + 0x790 ]
mov rcx, [ rsp + 0x7e0 ]
mov rcx, [ rsp + 0x808 ]
mov rcx, [ rsp + 0x908 ]
mov rcx, [ rsp + 0x948 ]
mov rcx, [ rsp + 0xab8 ]
mov rcx, [ rsp + 0xb98 ]
mov rcx, [ rsp + 0xcb0 ]
mov rcx, [ rsp + 0xd30 ]
mov rcx, [ rsp + 0xe20 ]
mov rcx, [ rsp + 0xe38 ]
mov rcx, [ rsp + 0xe60 ]
mov rcx, [ rsp + 0xe98 ]
mov rcx, [ rsp + 0xff8 ]
mov [ rdi + 0x50 ], rcx
mov [ rdi + 0x8 ], rsi
mov [ rdi + 0xb0 ], rdx
mov [ rdi + 0xc0 ], rcx
mov rdi, r10
mov rdi, r11
mov rdi, r12
mov rdi, r13
mov rdi, r14
mov rdi, r15
mov rdi, r8
mov rdi, r9
mov rdi, rax
mov rdi, rbp
mov rdi, rbx
mov rdi, rcx
mov rdi, rdx
mov rdi, rsi
mov rdi, [ rsi + 0x28 ]
mov rdi, [ rsi + 0x70 ]
mov rdi, [ rsp + 0x1020 ]
mov rdi, [ rsp + 0x1068 ]
mov rdi, [ rsp + 0x10d0 ]
mov rdi, [ rsp + 0x10d8 ]
mov rdi, [ rsp + 0x1158 ]
mov rdi, [ rsp + 0x1190 ]
mov rdi, [ rsp + 0x1280 ]
mov rdi, [ rsp + 0x12b8 ]
mov rdi, [ rsp + 0x13a8 ]
mov rdi, [ rsp + 0x13e0 ]
mov rdi, [ rsp + 0x1420 ]
mov rdi, [ rsp + 0x1440 ]
mov rdi, [ rsp + 0x1508 ]
mov rdi, [ rsp + 0x1568 ]
mov rdi, [ rsp + 0x1588 ]
mov rdi, [ rsp + 0x1598 ]
mov rdi, [ rsp + 0x15d0 ]
mov rdi, [ rsp + 0x17d8 ]
mov rdi, [ rsp + 0x1898 ]
mov rdi, [ rsp + 0x18d0 ]
mov rdi, [ rsp + 0x1908 ]
mov rdi, [ rsp + 0x198 ]
mov rdi, [ rsp + 0x1988 ]
mov rdi, [ rsp + 0x19f8 ]
mov rdi, [ rsp + 0x1a60 ]
mov rdi, [ rsp + 0x1a88 ]
mov rdi, [ rsp + 0x1ae8 ]
mov rdi, [ rsp + 0x1b18 ]
mov rdi, [ rsp + 0x1ba0 ]
mov rdi, [ rsp + 0x1bb8 ]
mov rdi, [ rsp + 0x1c30 ]
mov rdi, [ rsp + 0x1cc8 ]
mov rdi, [ rsp + 0x1d18 ]
mov rdi, [ rsp + 0x1d38 ]
mov rdi, [ rsp + 0x1e50 ]
mov rdi, [ rsp + 0x1eb0 ]
mov rdi, [ rsp + 0x1fc0 ]
mov rdi, [ rsp + 0x1fd8 ]
mov rdi, [ rsp + 0x2080 ]
mov rdi, [ rsp + 0x20a8 ]
mov rdi, [ rsp + 0x2278 ]
mov rdi, [ rsp + 0x22d8 ]
mov rdi, [ rsp + 0x22f0 ]
mov rdi, [ rsp + 0x2398 ]
mov rdi, [ rsp + 0x23e8 ]
mov rdi, [ rsp + 0x2410 ]
mov rdi, [ rsp + 0x2448 ]
mov rdi, [ rsp + 0x2550 ]
mov rdi, [ rsp + 0x2640 ]
mov rdi, [ rsp + 0x2690 ]
mov rdi, [ rsp + 0x26c8 ]
mov rdi, [ rsp + 0x26d8 ]
mov rdi, [ rsp + 0x2720 ]
mov rdi, [ rsp + 0x27a0 ]
mov rdi, [ rsp + 0x28e8 ]
mov rdi, [ rsp + 0x2910 ]
mov rdi, [ rsp + 0x2928 ]
mov rdi, [ rsp + 0x29c8 ]
mov rdi, [ rsp + 0x2a08 ]
mov rdi, [ rsp + 0x2ab8 ]
mov rdi, [ rsp + 0x2b20 ]
mov rdi, [ rsp + 0x2b58 ]
mov rdi, [ rsp + 0x2b60 ]
mov rdi, [ rsp + 0x2b68 ]
mov rdi, [ rsp + 0x2be0 ]
mov rdi, [ rsp + 0x2c38 ]
mov rdi, [ rsp + 0x2c48 ]
mov rdi, [ rsp + 0x2ca8 ]
mov rdi, [ rsp + 0x2cc0 ]
mov rdi, [ rsp + 0x2d78 ]
mov rdi, [ rsp + 0x2e18 ]
mov rdi, [ rsp + 0x2e8 ]
mov rdi, [ rsp + 0x3168 ]
mov rdi, [ rsp + 0x3188 ]
mov rdi, [ rsp + 0x3238 ]
mov rdi, [ rsp + 0x3280 ]
mov rdi, [ rsp + 0x32a0 ]
mov rdi, [ rsp + 0x32a8 ]
mov rdi, [ rsp + 0x32d0 ]
mov rdi, [ rsp + 0x3348 ]
mov rdi, [ rsp + 0x3408 ]
mov rdi, [ rsp + 0x3498 ]
mov rdi, [ rsp + 0x34e8 ]
mov rdi, [ rsp + 0x3528 ]
mov rdi, [ rsp + 0x36a8 ]
mov rdi, [ rsp + 0x36e0 ]
mov rdi, [ rsp + 0x3748 ]
mov rdi, [ rsp + 0x37f8 ]
mov rdi, [ rsp + 0x3900 ]
mov rdi, [ rsp + 0x408 ]
mov rdi, [ rsp + 0x420 ]
mov rdi, [ rsp + 0x470 ]
mov rdi, [ rsp + 0x48 ]
mov rdi, [ rsp + 0x4d8 ]
mov rdi, [ rsp + 0x598 ]
mov rdi, [ rsp + 0x5d8 ]
mov rdi, [ rsp + 0x618 ]
mov rdi, [ rsp + 0x630 ]
mov rdi, [ rsp + 0x690 ]
mov rdi, [ rsp + 0x748 ]
mov rdi, [ rsp + 0x798 ]
mov rdi, [ rsp + 0x7a8 ]
mov rdi, [ rsp + 0x7b8 ]
mov rdi, [ rsp + 0x7d0 ]
mov rdi, [ rsp + 0x7f0 ]
mov rdi, [ rsp + 0x8 ]
mov rdi, [ rsp + 0x820 ]
mov rdi, [ rsp + 0x830 ]
mov rdi, [ rsp + 0x90 ]
mov rdi, [ rsp + 0x9a8 ]
mov rdi, [ rsp + 0x9c8 ]
mov rdi, [ rsp + 0xa58 ]
mov rdi, [ rsp + 0xa8 ]
mov rdi, [ rsp + 0xaa0 ]
mov rdi, [ rsp + 0xbc0 ]
mov rdi, [ rsp + 0xbf8 ]
mov rdi, [ rsp + 0xc80 ]
mov rdi, [ rsp + 0xce8 ]
mov rdi, [ rsp + 0xd0 ]
mov rdi, [ rsp + 0xd58 ]
mov rdi, [ rsp + 0xde0 ]
mov rdi, [ rsp + 0xe28 ]
mov rdi, [ rsp + 0xe78 ]
mov rdi, [ rsp + 0xed0 ]
mov rdi, [ rsp + 0xf00 ]
mov rdi, [ rsp + 0xf48 ]
mov rdi, [ rsp + 0xfb8 ]
mov rdi, [ rsp + 0xfc0 ]
mov rdi, [ rsp + 0xff0 ]
mov [ rdx + 0x70 ], rbx
mov rdx, r10
mov rdx, r11
mov rdx, r12
mov rdx, r13
mov rdx, r14
mov rdx, r15
mov rdx, r8
mov rdx, r9
mov rdx, rax
mov rdx, rbp
mov rdx, rbx
mov rdx, rcx
mov rdx, rdi
mov rdx, rsi
mov rdx, [ rsi + 0x18 ]
mov rdx, [ rsi + 0xa0 ]
mov rdx, [ rsp + 0x1018 ]
mov rdx, [ rsp + 0x10b8 ]
mov rdx, [ rsp + 0x11d0 ]
mov rdx, [ rsp + 0x1390 ]
mov rdx, [ rsp + 0x13d8 ]
mov rdx, [ rsp + 0x1528 ]
mov rdx, [ rsp + 0x15a8 ]
mov rdx, [ rsp + 0x1650 ]
mov rdx, [ rsp + 0x1668 ]
mov rdx, [ rsp + 0x1670 ]
mov rdx, [ rsp + 0x1720 ]
mov rdx, [ rsp + 0x1770 ]
mov rdx, [ rsp + 0x1948 ]
mov rdx, [ rsp + 0x1cf0 ]
mov rdx, [ rsp + 0x1d20 ]
mov rdx, [ rsp + 0x1d48 ]
mov rdx, [ rsp + 0x1f40 ]
mov rdx, [ rsp + 0x1f50 ]
mov rdx, [ rsp + 0x1fd0 ]
mov rdx, [ rsp + 0x2048 ]
mov rdx, [ rsp + 0x20d8 ]
mov rdx, [ rsp + 0x2298 ]
mov rdx, [ rsp + 0x22e8 ]
mov rdx, [ rsp + 0x2338 ]
mov rdx, [ rsp + 0x23b0 ]
mov rdx, [ rsp + 0x23c0 ]
mov rdx, [ rsp + 0x23e0 ]
mov rdx, [ rsp + 0x2488 ]
mov rdx, [ rsp + 0x2580 ]
mov rdx, [ rsp + 0x2590 ]
mov rdx, [ rsp + 0x25b0 ]
mov rdx, [ rsp + 0x25f0 ]
mov rdx, [ rsp + 0x2638 ]
mov rdx, [ rsp + 0x2658 ]
mov rdx, [ rsp + 0x2700 ]
mov rdx, [ rsp + 0x27e0 ]
mov rdx, [ rsp + 0x2810 ]
mov rdx, [ rsp + 0x2848 ]
mov rdx, [ rsp + 0x2b00 ]
mov rdx, [ rsp + 0x2ba8 ]
mov rdx, [ rsp + 0x2bc8 ]
mov rdx, [ rsp + 0x2c0 ]
mov rdx, [ rsp + 0x2c00 ]
mov rdx, [ rsp + 0x2c30 ]
mov rdx, [ rsp + 0x2cc8 ]
mov rdx, [ rsp + 0x2cd8 ]
mov rdx, [ rsp + 0x2db8 ]
mov rdx, [ rsp + 0x2ea8 ]
mov rdx, [ rsp + 0x3018 ]
mov rdx, [ rsp + 0x3068 ]
mov rdx, [ rsp + 0x30b0 ]
mov rdx, [ rsp + 0x30f8 ]
mov rdx, [ rsp + 0x310 ]
mov rdx, [ rsp + 0x3100 ]
mov rdx, [ rsp + 0x3190 ]
mov rdx, [ rsp + 0x31b0 ]
mov rdx, [ rsp + 0x31d0 ]
mov rdx, [ rsp + 0x320 ]
mov rdx, [ rsp + 0x3260 ]
mov rdx, [ rsp + 0x3308 ]
mov rdx, [ rsp + 0x33e0 ]
mov rdx, [ rsp + 0x36c8 ]
mov rdx, [ rsp + 0x36f8 ]
mov rdx, [ rsp + 0x3768 ]
mov rdx, [ rsp + 0x3788 ]
mov rdx, [ rsp + 0x3840 ]
mov rdx, [ rsp + 0x3868 ]
mov rdx, [ rsp + 0x3870 ]
mov rdx, [ rsp + 0x3878 ]
mov rdx, [ rsp + 0x3898 ]
mov rdx, [ rsp + 0x38a8 ]
mov rdx, [ rsp + 0x3950 ]
mov rdx, [ rsp + 0x3b0 ]
mov rdx, [ rsp + 0x40 ]
mov rdx, [ rsp + 0x430 ]
mov rdx, [ rsp + 0x48 ]
mov rdx, [ rsp + 0x6c0 ]
mov rdx, [ rsp + 0x70 ]
mov rdx, [ rsp + 0x708 ]
mov rdx, [ rsp + 0x758 ]
mov rdx, [ rsp + 0x768 ]
mov rdx, [ rsp + 0x840 ]
mov rdx, [ rsp + 0x860 ]
mov rdx, [ rsp + 0x890 ]
mov rdx, [ rsp + 0x8a8 ]
mov rdx, [ rsp + 0x8d8 ]
mov rdx, [ rsp + 0x8e0 ]
mov rdx, [ rsp + 0x938 ]
mov rdx, [ rsp + 0x958 ]
mov rdx, [ rsp + 0x990 ]
mov rdx, [ rsp + 0x9b0 ]
mov rdx, [ rsp + 0x9e8 ]
mov rdx, [ rsp + 0x9f0 ]
mov rdx, [ rsp + 0xa30 ]
mov rdx, [ rsp + 0xaa8 ]
mov rdx, [ rsp + 0xad8 ]
mov rdx, [ rsp + 0xb28 ]
mov rdx, [ rsp + 0xc0 ]
mov rdx, [ rsp + 0xc08 ]
mov rdx, [ rsp + 0xc38 ]
mov rdx, [ rsp + 0xc60 ]
mov rdx, [ rsp + 0xcb8 ]
mov rdx, [ rsp + 0xd08 ]
mov rdx, [ rsp + 0xdb0 ]
mov rdx, [ rsp + 0xe40 ]
mov rdx, [ rsp + 0xe48 ]
mov rdx, [ rsp + 0xe8 ]
mov rdx, [ rsp + 0xea8 ]
mov rdx, [ rsp + 0xeb0 ]
mov rdx, [ rsp + 0xfd0 ]
mov [ rsi + rax + 0x18 ], rdx
mov [ rsi + rbp + 0x40 ], r10
mov [ rsi + r14 + 0x78 ], r9
mov [ rsi + r11 + 0x80 ], r10
mov [ rsi + r9 + 0x90 ], r14
mov rsi, r10
mov rsi, r11
mov rsi, r12
mov rsi, r13
mov rsi, r14
mov rsi, r15
mov rsi, r8
mov rsi, r9
mov rsi, rax
mov rsi, rbp
mov rsi, rbx
mov rsi, rcx
mov rsi, rdi
mov rsi, rdx
mov rsi, [ rsp + 0x1190 ]
mov rsi, [ rsp + 0x12f0 ]
mov rsi, [ rsp + 0x130 ]
mov rsi, [ rsp + 0x13d0 ]
mov rsi, [ rsp + 0x1408 ]
mov rsi, [ rsp + 0x1438 ]
mov rsi, [ rsp + 0x150 ]
mov rsi, [ rsp + 0x1620 ]
mov rsi, [ rsp + 0x16b0 ]
mov rsi, [ rsp + 0x1748 ]
mov rsi, [ rsp + 0x17b8 ]
mov rsi, [ rsp + 0x17d0 ]
mov rsi, [ rsp + 0x17f8 ]
mov rsi, [ rsp + 0x18 ]
mov rsi, [ rsp + 0x1810 ]
mov rsi, [ rsp + 0x1848 ]
mov rsi, [ rsp + 0x1850 ]
mov rsi, [ rsp + 0x18e0 ]
mov rsi, [ rsp + 0x1950 ]
mov rsi, [ rsp + 0x19d0 ]
mov rsi, [ rsp + 0x1a00 ]
mov rsi, [ rsp + 0x1a08 ]
mov rsi, [ rsp + 0x1a28 ]
mov rsi, [ rsp + 0x1b0 ]
mov rsi, [ rsp + 0x1b40 ]
mov rsi, [ rsp + 0x1bd8 ]
mov rsi, [ rsp + 0x1c58 ]
mov rsi, [ rsp + 0x1c80 ]
mov rsi, [ rsp + 0x1d78 ]
mov rsi, [ rsp + 0x1d8 ]
mov rsi, [ rsp + 0x1db0 ]
mov rsi, [ rsp + 0x1de0 ]
mov rsi, [ rsp + 0x1df0 ]
mov rsi, [ rsp + 0x1e00 ]
mov rsi, [ rsp + 0x1e60 ]
mov rsi, [ rsp + 0x1e98 ]
mov rsi, [ rsp + 0x1ef8 ]
mov rsi, [ rsp + 0x1f70 ]
mov rsi, [ rsp + 0x1fc8 ]
mov rsi, [ rsp + 0x2078 ]
mov rsi, [ rsp + 0x21e0 ]
mov rsi, [ rsp + 0x2268 ]
mov rsi, [ rsp + 0x2380 ]
mov rsi, [ rsp + 0x23e8 ]
mov rsi, [ rsp + 0x2468 ]
mov rsi, [ rsp + 0x2478 ]
mov rsi, [ rsp + 0x24c8 ]
mov rsi, [ rsp + 0x24f0 ]
mov rsi, [ rsp + 0x2530 ]
mov rsi, [ rsp + 0x2548 ]
mov rsi, [ rsp + 0x2558 ]
mov rsi, [ rsp + 0x25c0 ]
mov rsi, [ rsp + 0x2618 ]
mov rsi, [ rsp + 0x2718 ]
mov rsi, [ rsp + 0x27b0 ]
mov rsi, [ rsp + 0x2858 ]
mov rsi, [ rsp + 0x2870 ]
mov rsi, [ rsp + 0x28a8 ]
mov rsi, [ rsp + 0x290 ]
mov rsi, [ rsp + 0x29d8 ]
mov rsi, [ rsp + 0x2a20 ]
mov rsi, [ rsp + 0x2a70 ]
mov rsi, [ rsp + 0x2b00 ]
mov rsi, [ rsp + 0x2b50 ]
mov rsi, [ rsp + 0x2bc0 ]
mov rsi, [ rsp + 0x2c08 ]
mov rsi, [ rsp + 0x2c10 ]
mov rsi, [ rsp + 0x2c60 ]
mov rsi, [ rsp + 0x2cf0 ]
mov rsi, [ rsp + 0x2cf8 ]
mov rsi, [ rsp + 0x2d08 ]
mov rsi, [ rsp + 0x2e20 ]
mov rsi, [ rsp + 0x2e28 ]
mov rsi, [ rsp + 0x2ee8 ]
mov rsi, [ rsp + 0x2f00 ]
mov rsi, [ rsp + 0x2f30 ]
mov rsi, [ rsp + 0x2f78 ]
mov rsi, [ rsp + 0x2fd0 ]
mov rsi, [ rsp + 0x2fd8 ]
mov rsi, [ rsp + 0x2fe0 ]
mov rsi, [ rsp + 0x3130 ]
mov rsi, [ rsp + 0x31a8 ]
mov rsi, [ rsp + 0x31c0 ]
mov rsi, [ rsp + 0x31c8 ]
mov rsi, [ rsp + 0x31f8 ]
mov rsi, [ rsp + 0x3230 ]
mov rsi, [ rsp + 0x330 ]
mov rsi, [ rsp + 0x3350 ]
mov rsi, [ rsp + 0x3450 ]
mov rsi, [ rsp + 0x348 ]
mov rsi, [ rsp + 0x34a0 ]
mov rsi, [ rsp + 0x34d8 ]
mov rsi, [ rsp + 0x3640 ]
mov rsi, [ rsp + 0x37b0 ]
mov rsi, [ rsp + 0x398 ]
mov rsi, [ rsp + 0x400 ]
mov rsi, [ rsp + 0x48 ]
mov rsi, [ rsp + 0x50 ]
mov rsi, [ rsp + 0x510 ]
mov rsi, [ rsp + 0x528 ]
mov rsi, [ rsp + 0x5d8 ]
mov rsi, [ rsp + 0x60 ]
mov rsi, [ rsp + 0x698 ]
mov rsi, [ rsp + 0x6f8 ]
mov rsi, [ rsp + 0x720 ]
mov rsi, [ rsp + 0x7a0 ]
mov rsi, [ rsp + 0x890 ]
mov rsi, [ rsp + 0x9a0 ]
mov rsi, [ rsp + 0x9c0 ]
mov rsi, [ rsp + 0xb60 ]
mov rsi, [ rsp + 0xc50 ]
mov rsi, [ rsp + 0xc88 ]
mov rsi, [ rsp + 0xe78 ]
mov [ rsp + 0x0 ], r11
mov [ rsp + 0x1000 ], rbx
mov [ rsp + 0x1008 ], r11
mov [ rsp + 0x100 ], r10
mov [ rsp + 0x1010 ], r8
mov [ rsp + 0x1018 ], r9
mov [ rsp + 0x1020 ], rbp
mov [ rsp + 0x1028 ], r8
mov [ rsp + 0x1030 ], rdi
mov [ rsp + 0x1038 ], r14
mov [ rsp + 0x1040 ], r14
mov [ rsp + 0x1048 ], rbx
mov [ rsp + 0x1050 ], r10
mov [ rsp + 0x1058 ], rdx
mov [ rsp + 0x1060 ], rax
mov [ rsp + 0x1068 ], r12
mov [ rsp + 0x1070 ], rbp
mov [ rsp + 0x1078 ], rcx
mov [ rsp + 0x1080 ], r14
mov [ rsp + 0x1088 ], r12
mov [ rsp + 0x108 ], rdx
mov [ rsp + 0x1090 ], r9
mov [ rsp + 0x1098 ], rdx
mov [ rsp + 0x10a0 ], r12
mov [ rsp + 0x10a8 ], rdi
mov [ rsp + 0x10b0 ], r13
mov [ rsp + 0x10b8 ], rbx
mov [ rsp + 0x10c0 ], rbp
mov [ rsp + 0x10c8 ], r8
mov [ rsp + 0x10d0 ], r9
mov [ rsp + 0x10d8 ], r12
mov [ rsp + 0x10e0 ], r15
mov [ rsp + 0x10e8 ], r12
mov [ rsp + 0x10f0 ], r14
mov [ rsp + 0x10f8 ], r15
mov [ rsp + 0x10 ], r13
mov [ rsp + 0x1100 ], rsi
mov [ rsp + 0x1108 ], rbp
mov [ rsp + 0x110 ], rbx
mov [ rsp + 0x1110 ], rax
mov [ rsp + 0x1118 ], rbx
mov [ rsp + 0x1120 ], r9
mov [ rsp + 0x1128 ], rcx
mov [ rsp + 0x1130 ], r15
mov [ rsp + 0x1138 ], r9
mov [ rsp + 0x1140 ], r9
mov [ rsp + 0x1148 ], r9
mov [ rsp + 0x1150 ], r12
mov [ rsp + 0x1158 ], r8
mov [ rsp + 0x1160 ], r9
mov [ rsp + 0x1168 ], r11
mov [ rsp + 0x1170 ], r11
mov [ rsp + 0x1178 ], r15
mov [ rsp + 0x1180 ], rbp
mov [ rsp + 0x1188 ], rdi
mov [ rsp + 0x118 ], r15
mov [ rsp + 0x1190 ], r15
mov [ rsp + 0x1198 ], rdx
mov [ rsp + 0x11a0 ], rsi
mov [ rsp + 0x11a8 ], r12
mov [ rsp + 0x11b0 ], r13
mov [ rsp + 0x11b8 ], rdi
mov [ rsp + 0x11c0 ], r12
mov [ rsp + 0x11c8 ], r11
mov [ rsp + 0x11d0 ], r11
mov [ rsp + 0x11d8 ], r10
mov [ rsp + 0x11e0 ], rbx
mov [ rsp + 0x11e8 ], r9
mov [ rsp + 0x11f0 ], r12
mov [ rsp + 0x11f8 ], rcx
mov [ rsp + 0x1200 ], r11
mov [ rsp + 0x1208 ], r11
mov [ rsp + 0x120 ], rcx
mov [ rsp + 0x1210 ], r14
mov [ rsp + 0x1218 ], r13
mov [ rsp + 0x1220 ], r11
mov [ rsp + 0x1228 ], r12
mov [ rsp + 0x1230 ], r11
mov [ rsp + 0x1238 ], r15
mov [ rsp + 0x1240 ], rsi
mov [ rsp + 0x1248 ], r14
mov [ rsp + 0x1250 ], rdi
mov [ rsp + 0x1258 ], rdx
mov [ rsp + 0x1260 ], r13
mov [ rsp + 0x1268 ], rbx
mov [ rsp + 0x1270 ], r9
mov [ rsp + 0x1278 ], rdi
mov [ rsp + 0x1280 ], r8
mov [ rsp + 0x1288 ], rdx
mov [ rsp + 0x128 ], rax
mov [ rsp + 0x1290 ], rdx
mov [ rsp + 0x1298 ], r10
mov [ rsp + 0x12a0 ], rbx
mov [ rsp + 0x12a8 ], rbp
mov [ rsp + 0x12b0 ], rcx
mov [ rsp + 0x12b8 ], r12
mov [ rsp + 0x12c0 ], r14
mov [ rsp + 0x12c8 ], rbx
mov [ rsp + 0x12d0 ], r11
mov [ rsp + 0x12d8 ], rdi
mov [ rsp + 0x12e0 ], rbx
mov [ rsp + 0x12e8 ], r9
mov [ rsp + 0x12f0 ], rcx
mov [ rsp + 0x12f8 ], rbx
mov [ rsp + 0x1300 ], r12
mov [ rsp + 0x1308 ], r14
mov [ rsp + 0x130 ], rsi
mov [ rsp + 0x1310 ], rdi
mov [ rsp + 0x1318 ], rcx
mov [ rsp + 0x1320 ], r14
mov [ rsp + 0x1328 ], r10
mov [ rsp + 0x1330 ], r14
mov [ rsp + 0x1338 ], r13
mov [ rsp + 0x1340 ], rsi
mov [ rsp + 0x1348 ], rdi
mov [ rsp + 0x1350 ], r9
mov [ rsp + 0x1358 ], r13
mov [ rsp + 0x1360 ], r10
mov [ rsp + 0x1368 ], rax
mov [ rsp + 0x1370 ], r10
mov [ rsp + 0x1378 ], r15
mov [ rsp + 0x1380 ], r10
mov [ rsp + 0x1388 ], r11
mov [ rsp + 0x138 ], r11
mov [ rsp + 0x1390 ], rbx
mov [ rsp + 0x1398 ], r8
mov [ rsp + 0x13a0 ], rcx
mov [ rsp + 0x13a8 ], rbx
mov [ rsp + 0x13b0 ], r11
mov [ rsp + 0x13b8 ], r8
mov [ rsp + 0x13c0 ], rbx
mov [ rsp + 0x13c8 ], rdx
mov [ rsp + 0x13d0 ], r13
mov [ rsp + 0x13d8 ], rbp
mov [ rsp + 0x13e0 ], rcx
mov [ rsp + 0x13e8 ], r8
mov [ rsp + 0x13f0 ], rdi
mov [ rsp + 0x13f8 ], r13
mov [ rsp + 0x1400 ], rbx
mov [ rsp + 0x1408 ], rbp
mov [ rsp + 0x140 ], r9
mov [ rsp + 0x1410 ], rbp
mov [ rsp + 0x1418 ], r14
mov [ rsp + 0x1420 ], rsi
mov [ rsp + 0x1428 ], rdx
mov [ rsp + 0x1430 ], r13
mov [ rsp + 0x1438 ], rdx
mov [ rsp + 0x1440 ], rbx
mov [ rsp + 0x1448 ], rsi
mov [ rsp + 0x1450 ], rdi
mov [ rsp + 0x1458 ], r11
mov [ rsp + 0x1460 ], rdi
mov [ rsp + 0x1468 ], rcx
mov [ rsp + 0x1470 ], rax
mov [ rsp + 0x1478 ], r10
mov [ rsp + 0x1480 ], rbx
mov [ rsp + 0x1488 ], r9
mov [ rsp + 0x148 ], rsi
mov [ rsp + 0x1490 ], rbp
mov [ rsp + 0x1498 ], rbp
mov [ rsp + 0x14a0 ], r12
mov [ rsp + 0x14a8 ], r13
mov [ rsp + 0x14b0 ], rcx
mov [ rsp + 0x14b8 ], r15
mov [ rsp + 0x14c0 ], r14
mov [ rsp + 0x14c8 ], rbx
mov [ rsp + 0x14d0 ], rcx
mov [ rsp + 0x14d8 ], r9
mov [ rsp + 0x14e0 ], r9
mov [ rsp + 0x14e8 ], r8
mov [ rsp + 0x14f0 ], r11
mov [ rsp + 0x14f8 ], r13
mov [ rsp + 0x1500 ], r9
mov [ rsp + 0x1508 ], rax
mov [ rsp + 0x150 ], r9
mov [ rsp + 0x1510 ], r15
mov [ rsp + 0x1518 ], r9
mov [ rsp + 0x1520 ], rsi
mov [ rsp + 0x1528 ], r10
mov [ rsp + 0x1530 ], r14
mov [ rsp + 0x1538 ], rax
mov [ rsp + 0x1540 ], r12
mov [ rsp + 0x1548 ], r8
mov [ rsp + 0x1550 ], rdi
mov [ rsp + 0x1558 ], r12
mov [ rsp + 0x1560 ], r13
mov [ rsp + 0x1568 ], r10
mov [ rsp + 0x1570 ], rcx
mov [ rsp + 0x1578 ], rbp
mov [ rsp + 0x1580 ], rax
mov [ rsp + 0x1588 ], r13
mov [ rsp + 0x158 ], rdi
mov [ rsp + 0x1590 ], r10
mov [ rsp + 0x1598 ], rax
mov [ rsp + 0x15a0 ], rdi
mov [ rsp + 0x15a8 ], r9
mov [ rsp + 0x15b0 ], r12
mov [ rsp + 0x15b8 ], rdi
mov [ rsp + 0x15c0 ], r14
mov [ rsp + 0x15c8 ], r11
mov [ rsp + 0x15d0 ], r14
mov [ rsp + 0x15d8 ], r12
mov [ rsp + 0x15e0 ], r11
mov [ rsp + 0x15e8 ], rdi
mov [ rsp + 0x15f0 ], rdi
mov [ rsp + 0x15f8 ], r14
mov [ rsp + 0x1600 ], r8
mov [ rsp + 0x1608 ], rbp
mov [ rsp + 0x160 ], r15
mov [ rsp + 0x1610 ], rax
mov [ rsp + 0x1618 ], r11
mov [ rsp + 0x1620 ], rcx
mov [ rsp + 0x1628 ], rbx
mov [ rsp + 0x1630 ], r9
mov [ rsp + 0x1638 ], r9
mov [ rsp + 0x1640 ], rax
mov [ rsp + 0x1648 ], rcx
mov [ rsp + 0x1650 ], r8
mov [ rsp + 0x1658 ], r15
mov [ rsp + 0x1660 ], r8
mov [ rsp + 0x1668 ], r14
mov [ rsp + 0x1670 ], rdx
mov [ rsp + 0x1678 ], r13
mov [ rsp + 0x1680 ], rdi
mov [ rsp + 0x1688 ], rbp
mov [ rsp + 0x168 ], rcx
mov [ rsp + 0x1690 ], rsi
mov [ rsp + 0x1698 ], rsi
mov [ rsp + 0x16a0 ], rax
mov [ rsp + 0x16a8 ], r10
mov [ rsp + 0x16b0 ], rcx
mov [ rsp + 0x16b8 ], r15
mov [ rsp + 0x16c0 ], r12
mov [ rsp + 0x16c8 ], rdx
mov [ rsp + 0x16d0 ], r13
mov [ rsp + 0x16d8 ], rdi
mov [ rsp + 0x16e0 ], rbp
mov [ rsp + 0x16e8 ], r10
mov [ rsp + 0x16f0 ], r14
mov [ rsp + 0x16f8 ], r10
mov [ rsp + 0x1700 ], rax
mov [ rsp + 0x1708 ], rsi
mov [ rsp + 0x170 ], rdi
mov [ rsp + 0x1710 ], rbp
mov [ rsp + 0x1718 ], r10
mov [ rsp + 0x1720 ], r10
mov [ rsp + 0x1728 ], r14
mov [ rsp + 0x1730 ], r13
mov [ rsp + 0x1738 ], r8
mov [ rsp + 0x1740 ], rdi
mov [ rsp + 0x1748 ], rax
mov [ rsp + 0x1750 ], rbp
mov [ rsp + 0x1758 ], r12
mov [ rsp + 0x1760 ], r13
mov [ rsp + 0x1768 ], rax
mov [ rsp + 0x1770 ], rcx
mov [ rsp + 0x1778 ], rbp
mov [ rsp + 0x1780 ], rax
mov [ rsp + 0x1788 ], r12
mov [ rsp + 0x178 ], rax
mov [ rsp + 0x1790 ], r8
mov [ rsp + 0x1798 ], r8
mov [ rsp + 0x17a0 ], rax
mov [ rsp + 0x17a8 ], r15
mov [ rsp + 0x17b0 ], r11
mov [ rsp + 0x17b8 ], r8
mov [ rsp + 0x17c0 ], r11
mov [ rsp + 0x17c8 ], rcx
mov [ rsp + 0x17d0 ], r15
mov [ rsp + 0x17d8 ], rcx
mov [ rsp + 0x17e0 ], rsi
mov [ rsp + 0x17e8 ], r11
mov [ rsp + 0x17f0 ], r12
mov [ rsp + 0x17f8 ], r9
mov [ rsp + 0x1800 ], r14
mov [ rsp + 0x1808 ], r15
mov [ rsp + 0x180 ], rbp
mov [ rsp + 0x1810 ], r15
mov [ rsp + 0x1818 ], rdi
mov [ rsp + 0x1820 ], r9
mov [ rsp + 0x1828 ], r15
mov [ rsp + 0x1830 ], r11
mov [ rsp + 0x1838 ], r14
mov [ rsp + 0x1840 ], r8
mov [ rsp + 0x1848 ], r11
mov [ rsp + 0x1850 ], rsi
mov [ rsp + 0x1858 ], rcx
mov [ rsp + 0x1860 ], rsi
mov [ rsp + 0x1868 ], r14
mov [ rsp + 0x1870 ], r9
mov [ rsp + 0x1878 ], r12
mov [ rsp + 0x1880 ], rcx
mov [ rsp + 0x1888 ], r9
mov [ rsp + 0x188 ], r8
mov [ rsp + 0x1890 ], rbp
mov [ rsp + 0x1898 ], r13
mov [ rsp + 0x18a0 ], rcx
mov [ rsp + 0x18a8 ], r11
mov [ rsp + 0x18b0 ], r8
mov [ rsp + 0x18b8 ], r12
mov [ rsp + 0x18c0 ], rax
mov [ rsp + 0x18c8 ], rcx
mov [ rsp + 0x18d0 ], rcx
mov [ rsp + 0x18d8 ], rbp
mov [ rsp + 0x18e0 ], rax
mov [ rsp + 0x18e8 ], r13
mov [ rsp + 0x18f0 ], rcx
mov [ rsp + 0x18f8 ], r8
mov [ rsp + 0x18 ], r8
mov [ rsp + 0x1900 ], r8
mov [ rsp + 0x1908 ], rbx
mov [ rsp + 0x190 ], r11
mov [ rsp + 0x1910 ], rax
mov [ rsp + 0x1918 ], rax
mov [ rsp + 0x1920 ], rsi
mov [ rsp + 0x1928 ], rbp
mov [ rsp + 0x1930 ], rcx
mov [ rsp + 0x1938 ], rbp
mov [ rsp + 0x1940 ], r11
mov [ rsp + 0x1948 ], rbp
mov [ rsp + 0x1950 ], rax
mov [ rsp + 0x1958 ], rax
mov [ rsp + 0x1960 ], rcx
mov [ rsp + 0x1968 ], rdx
mov [ rsp + 0x1970 ], rsi
mov [ rsp + 0x1978 ], rdx
mov [ rsp + 0x1980 ], r10
mov [ rsp + 0x1988 ], rsi
mov [ rsp + 0x198 ], rax
mov [ rsp + 0x1990 ], rdi
mov [ rsp + 0x1998 ], r8
mov [ rsp + 0x19a0 ], r10
mov [ rsp + 0x19a8 ], r15
mov [ rsp + 0x19b0 ], r13
mov [ rsp + 0x19b8 ], rbp
mov [ rsp + 0x19c0 ], r10
mov [ rsp + 0x19c8 ], rax
mov [ rsp + 0x19d0 ], r10
mov [ rsp + 0x19d8 ], rbx
mov [ rsp + 0x19e0 ], r9
mov [ rsp + 0x19e8 ], rbp
mov [ rsp + 0x19f0 ], rdx
mov [ rsp + 0x19f8 ], rbx
mov [ rsp + 0x1a00 ], rbp
mov [ rsp + 0x1a08 ], r10
mov [ rsp + 0x1a0 ], rdi
mov [ rsp + 0x1a10 ], rsi
mov [ rsp + 0x1a18 ], rdi
mov [ rsp + 0x1a20 ], r10
mov [ rsp + 0x1a28 ], r15
mov [ rsp + 0x1a30 ], rbx
mov [ rsp + 0x1a38 ], r10
mov [ rsp + 0x1a40 ], rsi
mov [ rsp + 0x1a48 ], r11
mov [ rsp + 0x1a50 ], rax
mov [ rsp + 0x1a58 ], rcx
mov [ rsp + 0x1a60 ], rcx
mov [ rsp + 0x1a68 ], r8
mov [ rsp + 0x1a70 ], rbx
mov [ rsp + 0x1a78 ], rax
mov [ rsp + 0x1a80 ], rsi
mov [ rsp + 0x1a88 ], rbx
mov [ rsp + 0x1a8 ], rcx
mov [ rsp + 0x1a90 ], r11
mov [ rsp + 0x1a98 ], rcx
mov [ rsp + 0x1aa0 ], r9
mov [ rsp + 0x1aa8 ], rcx
mov [ rsp + 0x1ab0 ], r8
mov [ rsp + 0x1ab8 ], r8
mov [ rsp + 0x1ac0 ], rcx
mov [ rsp + 0x1ac8 ], r11
mov [ rsp + 0x1ad0 ], r9
mov [ rsp + 0x1ad8 ], r14
mov [ rsp + 0x1ae0 ], r11
mov [ rsp + 0x1ae8 ], r11
mov [ rsp + 0x1af0 ], rsi
mov [ rsp + 0x1af8 ], rax
mov [ rsp + 0x1b00 ], r11
mov [ rsp + 0x1b08 ], rdx
mov [ rsp + 0x1b0 ], rbp
mov [ rsp + 0x1b10 ], r13
mov [ rsp + 0x1b18 ], r11
mov [ rsp + 0x1b20 ], r15
mov [ rsp + 0x1b28 ], r12
mov [ rsp + 0x1b30 ], r9
mov [ rsp + 0x1b38 ], r10
mov [ rsp + 0x1b40 ], rsi
mov [ rsp + 0x1b48 ], r9
mov [ rsp + 0x1b50 ], rdx
mov [ rsp + 0x1b58 ], rcx
mov [ rsp + 0x1b60 ], rdi
mov [ rsp + 0x1b68 ], r12
mov [ rsp + 0x1b70 ], r11
mov [ rsp + 0x1b78 ], rdi
mov [ rsp + 0x1b80 ], rbp
mov [ rsp + 0x1b88 ], rcx
mov [ rsp + 0x1b8 ], rbp
mov [ rsp + 0x1b90 ], r8
mov [ rsp + 0x1b98 ], r13
mov [ rsp + 0x1ba0 ], rdi
mov [ rsp + 0x1ba8 ], rbx
mov [ rsp + 0x1bb0 ], rax
mov [ rsp + 0x1bb8 ], rax
mov [ rsp + 0x1bc0 ], r11
mov [ rsp + 0x1bc8 ], rbp
mov [ rsp + 0x1bd0 ], r13
mov [ rsp + 0x1bd8 ], rax
mov [ rsp + 0x1be0 ], rsi
mov [ rsp + 0x1be8 ], r14
mov [ rsp + 0x1bf0 ], r10
mov [ rsp + 0x1bf8 ], rcx
mov [ rsp + 0x1c00 ], r10
mov [ rsp + 0x1c08 ], rbx
mov [ rsp + 0x1c0 ], r8
mov [ rsp + 0x1c10 ], r11
mov [ rsp + 0x1c18 ], r10
mov [ rsp + 0x1c20 ], rax
mov [ rsp + 0x1c28 ], r13
mov [ rsp + 0x1c30 ], r8
mov [ rsp + 0x1c38 ], r10
mov [ rsp + 0x1c40 ], rcx
mov [ rsp + 0x1c48 ], r15
mov [ rsp + 0x1c50 ], rdi
mov [ rsp + 0x1c58 ], r11
mov [ rsp + 0x1c60 ], rsi
mov [ rsp + 0x1c68 ], rdi
mov [ rsp + 0x1c70 ], r11
mov [ rsp + 0x1c78 ], rbp
mov [ rsp + 0x1c80 ], rbx
mov [ rsp + 0x1c88 ], r13
mov [ rsp + 0x1c8 ], r15
mov [ rsp + 0x1c90 ], r14
mov [ rsp + 0x1c98 ], r9
mov [ rsp + 0x1ca0 ], rdi
mov [ rsp + 0x1ca8 ], r11
mov [ rsp + 0x1cb0 ], rbp
mov [ rsp + 0x1cb8 ], r10
mov [ rsp + 0x1cc0 ], r9
mov [ rsp + 0x1cc8 ], r13
mov [ rsp + 0x1cd0 ], rcx
mov [ rsp + 0x1cd8 ], rax
mov [ rsp + 0x1ce0 ], rbx
mov [ rsp + 0x1ce8 ], r15
mov [ rsp + 0x1cf0 ], r8
mov [ rsp + 0x1cf8 ], r13
mov [ rsp + 0x1d00 ], r10
mov [ rsp + 0x1d08 ], r11
mov [ rsp + 0x1d0 ], r11
mov [ rsp + 0x1d10 ], r11
mov [ rsp + 0x1d18 ], rdx
mov [ rsp + 0x1d20 ], r15
mov [ rsp + 0x1d28 ], rbp
mov [ rsp + 0x1d30 ], r13
mov [ rsp + 0x1d38 ], r11
mov [ rsp + 0x1d40 ], r12
mov [ rsp + 0x1d48 ], r12
mov [ rsp + 0x1d50 ], r13
mov [ rsp + 0x1d58 ], r8
mov [ rsp + 0x1d60 ], rsi
mov [ rsp + 0x1d68 ], r13
mov [ rsp + 0x1d70 ], rcx
mov [ rsp + 0x1d78 ], r10
mov [ rsp + 0x1d80 ], r10
mov [ rsp + 0x1d88 ], rdx
mov [ rsp + 0x1d8 ], rsi
mov [ rsp + 0x1d90 ], r12
mov [ rsp + 0x1d98 ], rax
mov [ rsp + 0x1da0 ], r15
mov [ rsp + 0x1da8 ], rdi
mov [ rsp + 0x1db0 ], r12
mov [ rsp + 0x1db8 ], rsi
mov [ rsp + 0x1dc0 ], rdx
mov [ rsp + 0x1dc8 ], rbp
mov [ rsp + 0x1dd0 ], rsi
mov [ rsp + 0x1dd8 ], rdi
mov [ rsp + 0x1de0 ], rcx
mov [ rsp + 0x1de8 ], r13
mov [ rsp + 0x1df0 ], rdi
mov [ rsp + 0x1df8 ], r11
mov [ rsp + 0x1e00 ], r13
mov [ rsp + 0x1e08 ], r12
mov [ rsp + 0x1e0 ], r11
mov [ rsp + 0x1e10 ], r12
mov [ rsp + 0x1e18 ], r14
mov [ rsp + 0x1e20 ], r8
mov [ rsp + 0x1e28 ], r13
mov [ rsp + 0x1e30 ], rdi
mov [ rsp + 0x1e38 ], r13
mov [ rsp + 0x1e40 ], r11
mov [ rsp + 0x1e48 ], rsi
mov [ rsp + 0x1e50 ], r8
mov [ rsp + 0x1e58 ], rcx
mov [ rsp + 0x1e60 ], r11
mov [ rsp + 0x1e68 ], rsi
mov [ rsp + 0x1e70 ], rcx
mov [ rsp + 0x1e78 ], rbp
mov [ rsp + 0x1e80 ], rbp
mov [ rsp + 0x1e88 ], r14
mov [ rsp + 0x1e8 ], r10
mov [ rsp + 0x1e90 ], r14
mov [ rsp + 0x1e98 ], r14
mov [ rsp + 0x1ea0 ], rcx
mov [ rsp + 0x1ea8 ], rsi
mov [ rsp + 0x1eb0 ], r8
mov [ rsp + 0x1eb8 ], r13
mov [ rsp + 0x1ec0 ], r12
mov [ rsp + 0x1ec8 ], r15
mov [ rsp + 0x1ed0 ], r9
mov [ rsp + 0x1ed8 ], r9
mov [ rsp + 0x1ee0 ], rdi
mov [ rsp + 0x1ee8 ], rbx
mov [ rsp + 0x1ef0 ], rdi
mov [ rsp + 0x1ef8 ], rsi
mov [ rsp + 0x1f00 ], r10
mov [ rsp + 0x1f08 ], rsi
mov [ rsp + 0x1f0 ], r13
mov [ rsp + 0x1f10 ], r10
mov [ rsp + 0x1f18 ], r14
mov [ rsp + 0x1f20 ], r8
mov [ rsp + 0x1f28 ], rsi
mov [ rsp + 0x1f30 ], rbx
mov [ rsp + 0x1f38 ], rbx
mov [ rsp + 0x1f40 ], rcx
mov [ rsp + 0x1f48 ], r13
mov [ rsp + 0x1f50 ], r15
mov [ rsp + 0x1f58 ], r10
mov [ rsp + 0x1f60 ], rdx
mov [ rsp + 0x1f68 ], rbp
mov [ rsp + 0x1f70 ], r10
mov [ rsp + 0x1f78 ], r14
mov [ rsp + 0x1f80 ], rax
mov [ rsp + 0x1f88 ], r8
mov [ rsp + 0x1f8 ], rdx
mov [ rsp + 0x1f90 ], r13
mov [ rsp + 0x1f98 ], r12
mov [ rsp + 0x1fa0 ], r12
mov [ rsp + 0x1fa8 ], r10
mov [ rsp + 0x1fb0 ], r9
mov [ rsp + 0x1fb8 ], r15
mov [ rsp + 0x1fc0 ], rbp
mov [ rsp + 0x1fc8 ], rdi
mov [ rsp + 0x1fd0 ], rdi
mov [ rsp + 0x1fd8 ], rcx
mov [ rsp + 0x1fe0 ], r11
mov [ rsp + 0x1fe8 ], r10
mov [ rsp + 0x1ff0 ], rax
mov [ rsp + 0x1ff8 ], rdx
mov [ rsp + 0x2000 ], rax
mov [ rsp + 0x2008 ], r8
mov [ rsp + 0x200 ], rcx
mov [ rsp + 0x2010 ], r12
mov [ rsp + 0x2018 ], rbp
mov [ rsp + 0x2020 ], rbp
mov [ rsp + 0x2028 ], rdx
mov [ rsp + 0x2030 ], rsi
mov [ rsp + 0x2038 ], r8
mov [ rsp + 0x2040 ], rdi
mov [ rsp + 0x2048 ], r12
mov [ rsp + 0x2050 ], rdi
mov [ rsp + 0x2058 ], rdx
mov [ rsp + 0x2060 ], r13
mov [ rsp + 0x2068 ], rax
mov [ rsp + 0x2070 ], rdx
mov [ rsp + 0x2078 ], r10
mov [ rsp + 0x2080 ], r13
mov [ rsp + 0x2088 ], rdi
mov [ rsp + 0x208 ], r10
mov [ rsp + 0x2090 ], r8
mov [ rsp + 0x2098 ], rcx
mov [ rsp + 0x20a0 ], r10
mov [ rsp + 0x20a8 ], rsi
mov [ rsp + 0x20b0 ], r10
mov [ rsp + 0x20b8 ], rsi
mov [ rsp + 0x20c0 ], rax
mov [ rsp + 0x20c8 ], r9
mov [ rsp + 0x20d0 ], rsi
mov [ rsp + 0x20d8 ], rdi
mov [ rsp + 0x20e0 ], rcx
mov [ rsp + 0x20e8 ], r14
mov [ rsp + 0x20f0 ], rbp
mov [ rsp + 0x20f8 ], rbx
mov [ rsp + 0x20 ], r9
mov [ rsp + 0x2100 ], rbx
mov [ rsp + 0x2108 ], r13
mov [ rsp + 0x210 ], rbp
mov [ rsp + 0x2110 ], r11
mov [ rsp + 0x2118 ], r15
mov [ rsp + 0x2120 ], rdx
mov [ rsp + 0x2128 ], rcx
mov [ rsp + 0x2130 ], r10
mov [ rsp + 0x2138 ], r12
mov [ rsp + 0x2140 ], rbx
mov [ rsp + 0x2148 ], r12
mov [ rsp + 0x2150 ], rdi
mov [ rsp + 0x2158 ], r11
mov [ rsp + 0x2160 ], r10
mov [ rsp + 0x2168 ], r14
mov [ rsp + 0x2170 ], r13
mov [ rsp + 0x2178 ], rbx
mov [ rsp + 0x2180 ], r10
mov [ rsp + 0x2188 ], rbx
mov [ rsp + 0x218 ], rbp
mov [ rsp + 0x2190 ], rbp
mov [ rsp + 0x2198 ], rbx
mov [ rsp + 0x21a0 ], r10
mov [ rsp + 0x21a8 ], rsi
mov [ rsp + 0x21b0 ], rax
mov [ rsp + 0x21b8 ], r9
mov [ rsp + 0x21c0 ], rsi
mov [ rsp + 0x21c8 ], r8
mov [ rsp + 0x21d0 ], r10
mov [ rsp + 0x21d8 ], r12
mov [ rsp + 0x21e0 ], r15
mov [ rsp + 0x21e8 ], rcx
mov [ rsp + 0x21f0 ], rbp
mov [ rsp + 0x21f8 ], r12
mov [ rsp + 0x2200 ], rbp
mov [ rsp + 0x2208 ], r15
mov [ rsp + 0x220 ], rsi
mov [ rsp + 0x2210 ], rbx
mov [ rsp + 0x2218 ], r14
mov [ rsp + 0x2220 ], r8
mov [ rsp + 0x2228 ], r13
mov [ rsp + 0x2230 ], rdx
mov [ rsp + 0x2238 ], r8
mov [ rsp + 0x2240 ], r12
mov [ rsp + 0x2248 ], rax
mov [ rsp + 0x2250 ], rcx
mov [ rsp + 0x2258 ], r11
mov [ rsp + 0x2260 ], r8
mov [ rsp + 0x2268 ], r13
mov [ rsp + 0x2270 ], r14
mov [ rsp + 0x2278 ], r13
mov [ rsp + 0x2280 ], r15
mov [ rsp + 0x2288 ], r8
mov [ rsp + 0x228 ], rdx
mov [ rsp + 0x2290 ], r12
mov [ rsp + 0x2298 ], r8
mov [ rsp + 0x22a0 ], rdi
mov [ rsp + 0x22a8 ], rsi
mov [ rsp + 0x22b0 ], rbx
mov [ rsp + 0x22b8 ], rsi
mov [ rsp + 0x22c0 ], rsi
mov [ rsp + 0x22c8 ], r11
mov [ rsp + 0x22d0 ], r14
mov [ rsp + 0x22d8 ], rbp
mov [ rsp + 0x22e0 ], rbp
mov [ rsp + 0x22e8 ], rax
mov [ rsp + 0x22f0 ], r12
mov [ rsp + 0x22f8 ], r14
mov [ rsp + 0x2300 ], rbp
mov [ rsp + 0x2308 ], r8
mov [ rsp + 0x230 ], r10
mov [ rsp + 0x2310 ], r15
mov [ rsp + 0x2318 ], r11
mov [ rsp + 0x2320 ], rbx
mov [ rsp + 0x2328 ], r9
mov [ rsp + 0x2330 ], r8
mov [ rsp + 0x2338 ], r9
mov [ rsp + 0x2340 ], r15
mov [ rsp + 0x2348 ], r10
mov [ rsp + 0x2350 ], rdi
mov [ rsp + 0x2358 ], rax
mov [ rsp + 0x2360 ], r10
mov [ rsp + 0x2368 ], rcx
mov [ rsp + 0x2370 ], rax
mov [ rsp + 0x2378 ], r8
mov [ rsp + 0x2380 ], rdi
mov [ rsp + 0x2388 ], rbp
mov [ rsp + 0x238 ], rax
mov [ rsp + 0x2390 ], rdi
mov [ rsp + 0x2398 ], rdx
mov [ rsp + 0x23a0 ], r13
mov [ rsp + 0x23a8 ], rbx
mov [ rsp + 0x23b0 ], r11
mov [ rsp + 0x23b8 ], r10
mov [ rsp + 0x23c0 ], r13
mov [ rsp + 0x23c8 ], r9
mov [ rsp + 0x23d0 ], rbx
mov [ rsp + 0x23d8 ], r15
mov [ rsp + 0x23e0 ], r12
mov [ rsp + 0x23e8 ], r9
mov [ rsp + 0x23f0 ], rax
mov [ rsp + 0x23f8 ], r12
mov [ rsp + 0x2400 ], r13
mov [ rsp + 0x2408 ], r13
mov [ rsp + 0x240 ], rdx
mov [ rsp + 0x2410 ], rdx
mov [ rsp + 0x2418 ], r12
mov [ rsp + 0x2420 ], rbp
mov [ rsp + 0x2428 ], r15
mov [ rsp + 0x2430 ], r14
mov [ rsp + 0x2438 ], rbp
mov [ rsp + 0x2440 ], r11
mov [ rsp + 0x2448 ], rdi
mov [ rsp + 0x2450 ], rdx
mov [ rsp + 0x2458 ], rcx
mov [ rsp + 0x2460 ], r13
mov [ rsp + 0x2468 ], rbx
mov [ rsp + 0x2470 ], rax
mov [ rsp + 0x2478 ], r12
mov [ rsp + 0x2480 ], rbx
mov [ rsp + 0x2488 ], rax
mov [ rsp + 0x248 ], rdx
mov [ rsp + 0x2490 ], rax
mov [ rsp + 0x2498 ], rdx
mov [ rsp + 0x24a0 ], r11
mov [ rsp + 0x24a8 ], r8
mov [ rsp + 0x24b0 ], r12
mov [ rsp + 0x24b8 ], r10
mov [ rsp + 0x24c0 ], r9
mov [ rsp + 0x24c8 ], r12
mov [ rsp + 0x24d0 ], r11
mov [ rsp + 0x24d8 ], r9
mov [ rsp + 0x24e0 ], rcx
mov [ rsp + 0x24e8 ], rbx
mov [ rsp + 0x24f0 ], rax
mov [ rsp + 0x24f8 ], rsi
mov [ rsp + 0x2500 ], r12
mov [ rsp + 0x2508 ], r8
mov [ rsp + 0x250 ], rbp
mov [ rsp + 0x2510 ], rcx
mov [ rsp + 0x2518 ], r11
mov [ rsp + 0x2520 ], rdx
mov [ rsp + 0x2528 ], rbp
mov [ rsp + 0x2530 ], rbx
mov [ rsp + 0x2538 ], rdx
mov [ rsp + 0x2540 ], r15
mov [ rsp + 0x2548 ], r8
mov [ rsp + 0x2550 ], r15
mov [ rsp + 0x2558 ], rdi
mov [ rsp + 0x2560 ], rbx
mov [ rsp + 0x2568 ], r13
mov [ rsp + 0x2570 ], r15
mov [ rsp + 0x2578 ], r13
mov [ rsp + 0x2580 ], rsi
mov [ rsp + 0x2588 ], r12
mov [ rsp + 0x258 ], r12
mov [ rsp + 0x2590 ], r8
mov [ rsp + 0x2598 ], rsi
mov [ rsp + 0x25a0 ], r15
mov [ rsp + 0x25a8 ], rcx
mov [ rsp + 0x25b0 ], rsi
mov [ rsp + 0x25b8 ], r13
mov [ rsp + 0x25c0 ], r14
mov [ rsp + 0x25c8 ], rsi
mov [ rsp + 0x25d0 ], r10
mov [ rsp + 0x25d8 ], r13
mov [ rsp + 0x25e0 ], rdx
mov [ rsp + 0x25e8 ], r15
mov [ rsp + 0x25f0 ], r10
mov [ rsp + 0x25f8 ], r9
mov [ rsp + 0x2600 ], rbx
mov [ rsp + 0x2608 ], rax
mov [ rsp + 0x260 ], rbx
mov [ rsp + 0x2610 ], rdx
mov [ rsp + 0x2618 ], r12
mov [ rsp + 0x2620 ], r13
mov [ rsp + 0x2628 ], r9
mov [ rsp + 0x2630 ], rbx
mov [ rsp + 0x2638 ], rbp
mov [ rsp + 0x2640 ], rax
mov [ rsp + 0x2648 ], r8
mov [ rsp + 0x2650 ], rcx
mov [ rsp + 0x2658 ], rdi
mov [ rsp + 0x2660 ], rcx
mov [ rsp + 0x2668 ], rdi
mov [ rsp + 0x2670 ], rax
mov [ rsp + 0x2678 ], rcx
mov [ rsp + 0x2680 ], rcx
mov [ rsp + 0x2688 ], r8
mov [ rsp + 0x268 ], rcx
mov [ rsp + 0x2690 ], r14
mov [ rsp + 0x2698 ], rdi
mov [ rsp + 0x26a0 ], rbx
mov [ rsp + 0x26a8 ], rbp
mov [ rsp + 0x26b0 ], rdx
mov [ rsp + 0x26b8 ], r15
mov [ rsp + 0x26c0 ], r8
mov [ rsp + 0x26c8 ], r15
mov [ rsp + 0x26d0 ], rbx
mov [ rsp + 0x26d8 ], rdi
mov [ rsp + 0x26e0 ], r9
mov [ rsp + 0x26e8 ], r8
mov [ rsp + 0x26f0 ], rbp
mov [ rsp + 0x26f8 ], rsi
mov [ rsp + 0x2700 ], rcx
mov [ rsp + 0x2708 ], rdx
mov [ rsp + 0x270 ], r10
mov [ rsp + 0x2710 ], r13
mov [ rsp + 0x2718 ], rsi
mov [ rsp + 0x2720 ], r11
mov [ rsp + 0x2728 ], r10
mov [ rsp + 0x2730 ], rdi
mov [ rsp + 0x2738 ], r15
mov [ rsp + 0x2740 ], rbx
mov [ rsp + 0x2748 ], rax
mov [ rsp + 0x2750 ], r14
mov [ rsp + 0x2758 ], rdx
mov [ rsp + 0x2760 ], r9
mov [ rsp + 0x2768 ], rdi
mov [ rsp + 0x2770 ], r13
mov [ rsp + 0x2778 ], rbp
mov [ rsp + 0x2780 ], rsi
mov [ rsp + 0x2788 ], rdi
mov [ rsp + 0x278 ], r15
mov [ rsp + 0x2790 ], r15
mov [ rsp + 0x2798 ], rsi
mov [ rsp + 0x27a0 ], rbx
mov [ rsp + 0x27a8 ], r15
mov [ rsp + 0x27b0 ], rdi
mov [ rsp + 0x27b8 ], rdi
mov [ rsp + 0x27c0 ], rcx
mov [ rsp + 0x27c8 ], r10
mov [ rsp + 0x27d0 ], r9
mov [ rsp + 0x27d8 ], rbp
mov [ rsp + 0x27e0 ], rdx
mov [ rsp + 0x27e8 ], r13
mov [ rsp + 0x27f0 ], r9
mov [ rsp + 0x27f8 ], r13
mov [ rsp + 0x2800 ], r9
mov [ rsp + 0x2808 ], r15
mov [ rsp + 0x280 ], r12
mov [ rsp + 0x2810 ], r10
mov [ rsp + 0x2818 ], rdi
mov [ rsp + 0x2820 ], rbp
mov [ rsp + 0x2828 ], r10
mov [ rsp + 0x2830 ], r9
mov [ rsp + 0x2838 ], r9
mov [ rsp + 0x2840 ], rcx
mov [ rsp + 0x2848 ], r13
mov [ rsp + 0x2850 ], rdi
mov [ rsp + 0x2858 ], rcx
mov [ rsp + 0x2860 ], rdx
mov [ rsp + 0x2868 ], r9
mov [ rsp + 0x2870 ], r14
mov [ rsp + 0x2878 ], r12
mov [ rsp + 0x2880 ], rax
mov [ rsp + 0x2888 ], r12
mov [ rsp + 0x288 ], rcx
mov [ rsp + 0x2890 ], r9
mov [ rsp + 0x2898 ], r14
mov [ rsp + 0x28a0 ], rbp
mov [ rsp + 0x28a8 ], r8
mov [ rsp + 0x28b0 ], r11
mov [ rsp + 0x28b8 ], rbx
mov [ rsp + 0x28c0 ], rbp
mov [ rsp + 0x28c8 ], r10
mov [ rsp + 0x28d0 ], rsi
mov [ rsp + 0x28d8 ], rbp
mov [ rsp + 0x28e0 ], rcx
mov [ rsp + 0x28e8 ], rax
mov [ rsp + 0x28f0 ], rbp
mov [ rsp + 0x28f8 ], r11
mov [ rsp + 0x28 ], r9
mov [ rsp + 0x2900 ], rax
mov [ rsp + 0x2908 ], r8
mov [ rsp + 0x290 ], r13
mov [ rsp + 0x2910 ], r9
mov [ rsp + 0x2918 ], rcx
mov [ rsp + 0x2920 ], rsi
mov [ rsp + 0x2928 ], rcx
mov [ rsp + 0x2930 ], rbp
mov [ rsp + 0x2938 ], rbx
mov [ rsp + 0x2940 ], rdx
mov [ rsp + 0x2948 ], rcx
mov [ rsp + 0x2950 ], r13
mov [ rsp + 0x2958 ], r14
mov [ rsp + 0x2960 ], rdi
mov [ rsp + 0x2968 ], rbx
mov [ rsp + 0x2970 ], rbp
mov [ rsp + 0x2978 ], r9
mov [ rsp + 0x2980 ], rdx
mov [ rsp + 0x2988 ], r10
mov [ rsp + 0x298 ], rbx
mov [ rsp + 0x2990 ], r14
mov [ rsp + 0x2998 ], rbx
mov [ rsp + 0x29a0 ], r14
mov [ rsp + 0x29a8 ], rax
mov [ rsp + 0x29b0 ], rdx
mov [ rsp + 0x29b8 ], rcx
mov [ rsp + 0x29c0 ], r8
mov [ rsp + 0x29c8 ], r15
mov [ rsp + 0x29d0 ], rax
mov [ rsp + 0x29d8 ], r11
mov [ rsp + 0x29e0 ], r8
mov [ rsp + 0x29e8 ], r9
mov [ rsp + 0x29f0 ], rbx
mov [ rsp + 0x29f8 ], rax
mov [ rsp + 0x2a00 ], rsi
mov [ rsp + 0x2a08 ], rdi
mov [ rsp + 0x2a0 ], rcx
mov [ rsp + 0x2a10 ], r13
mov [ rsp + 0x2a18 ], r10
mov [ rsp + 0x2a20 ], r10
mov [ rsp + 0x2a28 ], r15
mov [ rsp + 0x2a30 ], rbx
mov [ rsp + 0x2a38 ], r14
mov [ rsp + 0x2a40 ], r11
mov [ rsp + 0x2a48 ], rbp
mov [ rsp + 0x2a50 ], r15
mov [ rsp + 0x2a58 ], r11
mov [ rsp + 0x2a60 ], rcx
mov [ rsp + 0x2a68 ], r12
mov [ rsp + 0x2a70 ], r12
mov [ rsp + 0x2a78 ], rdi
mov [ rsp + 0x2a80 ], r10
mov [ rsp + 0x2a88 ], rax
mov [ rsp + 0x2a8 ], r9
mov [ rsp + 0x2a90 ], r8
mov [ rsp + 0x2a98 ], rax
mov [ rsp + 0x2aa0 ], r13
mov [ rsp + 0x2aa8 ], r13
mov [ rsp + 0x2ab0 ], rax
mov [ rsp + 0x2ab8 ], rbx
mov [ rsp + 0x2ac0 ], rcx
mov [ rsp + 0x2ac8 ], rcx
mov [ rsp + 0x2ad0 ], rdi
mov [ rsp + 0x2ad8 ], r14
mov [ rsp + 0x2ae0 ], rbx
mov [ rsp + 0x2ae8 ], r14
mov [ rsp + 0x2af0 ], r13
mov [ rsp + 0x2af8 ], r12
mov [ rsp + 0x2b00 ], r13
mov [ rsp + 0x2b08 ], rbx
mov [ rsp + 0x2b0 ], rsi
mov [ rsp + 0x2b10 ], rsi
mov [ rsp + 0x2b18 ], rbp
mov [ rsp + 0x2b20 ], r14
mov [ rsp + 0x2b28 ], r12
mov [ rsp + 0x2b30 ], rdi
mov [ rsp + 0x2b38 ], rdx
mov [ rsp + 0x2b40 ], r9
mov [ rsp + 0x2b48 ], r8
mov [ rsp + 0x2b50 ], r12
mov [ rsp + 0x2b58 ], rax
mov [ rsp + 0x2b60 ], rbp
mov [ rsp + 0x2b68 ], r9
mov [ rsp + 0x2b70 ], rdi
mov [ rsp + 0x2b78 ], r15
mov [ rsp + 0x2b80 ], r13
mov [ rsp + 0x2b88 ], rdx
mov [ rsp + 0x2b8 ], r8
mov [ rsp + 0x2b90 ], r9
mov [ rsp + 0x2b98 ], rdx
mov [ rsp + 0x2ba0 ], r10
mov [ rsp + 0x2ba8 ], r12
mov [ rsp + 0x2bb0 ], r8
mov [ rsp + 0x2bb8 ], r15
mov [ rsp + 0x2bc0 ], rdx
mov [ rsp + 0x2bc8 ], rdi
mov [ rsp + 0x2bd0 ], rbp
mov [ rsp + 0x2bd8 ], r14
mov [ rsp + 0x2be0 ], rbp
mov [ rsp + 0x2be8 ], rax
mov [ rsp + 0x2bf0 ], r15
mov [ rsp + 0x2bf8 ], r11
mov [ rsp + 0x2c00 ], r10
mov [ rsp + 0x2c08 ], r12
mov [ rsp + 0x2c0 ], r10
mov [ rsp + 0x2c10 ], r9
mov [ rsp + 0x2c18 ], rcx
mov [ rsp + 0x2c20 ], rdi
mov [ rsp + 0x2c28 ], r15
mov [ rsp + 0x2c30 ], r11
mov [ rsp + 0x2c38 ], r11
mov [ rsp + 0x2c40 ], rdi
mov [ rsp + 0x2c48 ], r9
mov [ rsp + 0x2c50 ], r14
mov [ rsp + 0x2c58 ], r10
mov [ rsp + 0x2c60 ], r15
mov [ rsp + 0x2c68 ], r11
mov [ rsp + 0x2c70 ], r13
mov [ rsp + 0x2c78 ], rsi
mov [ rsp + 0x2c80 ], rdi
mov [ rsp + 0x2c88 ], rax
mov [ rsp + 0x2c8 ], rax
mov [ rsp + 0x2c90 ], r13
mov [ rsp + 0x2c98 ], rsi
mov [ rsp + 0x2ca0 ], rdx
mov [ rsp + 0x2ca8 ], r12
mov [ rsp + 0x2cb0 ], rdi
mov [ rsp + 0x2cb8 ], rsi
mov [ rsp + 0x2cc0 ], r11
mov [ rsp + 0x2cc8 ], r12
mov [ rsp + 0x2cd0 ], r11
mov [ rsp + 0x2cd8 ], rsi
mov [ rsp + 0x2ce0 ], rbp
mov [ rsp + 0x2ce8 ], r10
mov [ rsp + 0x2cf0 ], r13
mov [ rsp + 0x2cf8 ], rbp
mov [ rsp + 0x2d00 ], rax
mov [ rsp + 0x2d08 ], rax
mov [ rsp + 0x2d0 ], r9
mov [ rsp + 0x2d10 ], rdi
mov [ rsp + 0x2d18 ], rcx
mov [ rsp + 0x2d20 ], rbp
mov [ rsp + 0x2d28 ], r15
mov [ rsp + 0x2d30 ], r8
mov [ rsp + 0x2d38 ], r10
mov [ rsp + 0x2d40 ], r11
mov [ rsp + 0x2d48 ], rdi
mov [ rsp + 0x2d50 ], r15
mov [ rsp + 0x2d58 ], r12
mov [ rsp + 0x2d60 ], r10
mov [ rsp + 0x2d68 ], rax
mov [ rsp + 0x2d70 ], rcx
mov [ rsp + 0x2d78 ], rax
mov [ rsp + 0x2d80 ], rdi
mov [ rsp + 0x2d88 ], rbx
mov [ rsp + 0x2d8 ], r11
mov [ rsp + 0x2d90 ], r12
mov [ rsp + 0x2d98 ], r13
mov [ rsp + 0x2da0 ], r15
mov [ rsp + 0x2da8 ], rdx
mov [ rsp + 0x2db0 ], rcx
mov [ rsp + 0x2db8 ], r14
mov [ rsp + 0x2dc0 ], rsi
mov [ rsp + 0x2dc8 ], rbx
mov [ rsp + 0x2dd0 ], r13
mov [ rsp + 0x2dd8 ], rax
mov [ rsp + 0x2de0 ], r8
mov [ rsp + 0x2de8 ], rbx
mov [ rsp + 0x2df0 ], r9
mov [ rsp + 0x2df8 ], rsi
mov [ rsp + 0x2e00 ], rdx
mov [ rsp + 0x2e08 ], rax
mov [ rsp + 0x2e0 ], rax
mov [ rsp + 0x2e10 ], r11
mov [ rsp + 0x2e18 ], r11
mov [ rsp + 0x2e20 ], r8
mov [ rsp + 0x2e28 ], r9
mov [ rsp + 0x2e30 ], r12
mov [ rsp + 0x2e38 ], r12
mov [ rsp + 0x2e40 ], rbp
mov [ rsp + 0x2e48 ], rax
mov [ rsp + 0x2e50 ], rsi
mov [ rsp + 0x2e58 ], rax
mov [ rsp + 0x2e60 ], r13
mov [ rsp + 0x2e68 ], r8
mov [ rsp + 0x2e70 ], r13
mov [ rsp + 0x2e78 ], r14
mov [ rsp + 0x2e80 ], r13
mov [ rsp + 0x2e88 ], rdx
mov [ rsp + 0x2e8 ], rbx
mov [ rsp + 0x2e90 ], rax
mov [ rsp + 0x2e98 ], r9
mov [ rsp + 0x2ea0 ], r15
mov [ rsp + 0x2ea8 ], rcx
mov [ rsp + 0x2eb0 ], r13
mov [ rsp + 0x2eb8 ], rsi
mov [ rsp + 0x2ec0 ], rcx
mov [ rsp + 0x2ec8 ], r14
mov [ rsp + 0x2ed0 ], rbp
mov [ rsp + 0x2ed8 ], rsi
mov [ rsp + 0x2ee0 ], r8
mov [ rsp + 0x2ee8 ], rdx
mov [ rsp + 0x2ef0 ], rbp
mov [ rsp + 0x2ef8 ], rax
mov [ rsp + 0x2f00 ], rdi
mov [ rsp + 0x2f08 ], rbx
mov [ rsp + 0x2f0 ], rbp
mov [ rsp + 0x2f10 ], r10
mov [ rsp + 0x2f18 ], r11
mov [ rsp + 0x2f20 ], r15
mov [ rsp + 0x2f28 ], rbx
mov [ rsp + 0x2f30 ], rbx
mov [ rsp + 0x2f38 ], rsi
mov [ rsp + 0x2f40 ], rbx
mov [ rsp + 0x2f48 ], r12
mov [ rsp + 0x2f50 ], r15
mov [ rsp + 0x2f58 ], rdi
mov [ rsp + 0x2f60 ], r14
mov [ rsp + 0x2f68 ], rbp
mov [ rsp + 0x2f70 ], r10
mov [ rsp + 0x2f78 ], r14
mov [ rsp + 0x2f80 ], rcx
mov [ rsp + 0x2f88 ], rax
mov [ rsp + 0x2f8 ], rax
mov [ rsp + 0x2f90 ], rbp
mov [ rsp + 0x2f98 ], r12
mov [ rsp + 0x2fa0 ], rax
mov [ rsp + 0x2fa8 ], r12
mov [ rsp + 0x2fb0 ], rbx
mov [ rsp + 0x2fb8 ], r10
mov [ rsp + 0x2fc0 ], rbp
mov [ rsp + 0x2fc8 ], rsi
mov [ rsp + 0x2fd0 ], rcx
mov [ rsp + 0x2fd8 ], r13
mov [ rsp + 0x2fe0 ], r11
mov [ rsp + 0x2fe8 ], r15
mov [ rsp + 0x2ff0 ], r13
mov [ rsp + 0x2ff8 ], rdx
mov [ rsp + 0x3000 ], rsi
mov [ rsp + 0x3008 ], rbp
mov [ rsp + 0x300 ], r11
mov [ rsp + 0x3010 ], r15
mov [ rsp + 0x3018 ], r14
mov [ rsp + 0x3020 ], r11
mov [ rsp + 0x3028 ], r8
mov [ rsp + 0x3030 ], r11
mov [ rsp + 0x3038 ], r13
mov [ rsp + 0x3040 ], r12
mov [ rsp + 0x3048 ], r12
mov [ rsp + 0x3050 ], rsi
mov [ rsp + 0x3058 ], r15
mov [ rsp + 0x3060 ], rsi
mov [ rsp + 0x3068 ], r11
mov [ rsp + 0x3070 ], rbx
mov [ rsp + 0x3078 ], r8
mov [ rsp + 0x3080 ], r9
mov [ rsp + 0x3088 ], r10
mov [ rsp + 0x308 ], r10
mov [ rsp + 0x3090 ], r14
mov [ rsp + 0x3098 ], r13
mov [ rsp + 0x30a0 ], rax
mov [ rsp + 0x30a8 ], r8
mov [ rsp + 0x30b0 ], rax
mov [ rsp + 0x30b8 ], r10
mov [ rsp + 0x30c0 ], rdx
mov [ rsp + 0x30c8 ], rbp
mov [ rsp + 0x30d0 ], r12
mov [ rsp + 0x30d8 ], rsi
mov [ rsp + 0x30e0 ], r14
mov [ rsp + 0x30e8 ], rax
mov [ rsp + 0x30f0 ], r12
mov [ rsp + 0x30f8 ], rbp
mov [ rsp + 0x30 ], r12
mov [ rsp + 0x3100 ], r13
mov [ rsp + 0x3108 ], rdx
mov [ rsp + 0x310 ], rcx
mov [ rsp + 0x3110 ], rcx
mov [ rsp + 0x3118 ], rsi
mov [ rsp + 0x3120 ], r9
mov [ rsp + 0x3128 ], r10
mov [ rsp + 0x3130 ], rdx
mov [ rsp + 0x3138 ], rsi
mov [ rsp + 0x3140 ], rbp
mov [ rsp + 0x3148 ], r13
mov [ rsp + 0x3150 ], rdx
mov [ rsp + 0x3158 ], rax
mov [ rsp + 0x3160 ], rdx
mov [ rsp + 0x3168 ], rbx
mov [ rsp + 0x3170 ], r10
mov [ rsp + 0x3178 ], rax
mov [ rsp + 0x3180 ], rcx
mov [ rsp + 0x3188 ], r15
mov [ rsp + 0x318 ], rax
mov [ rsp + 0x3190 ], r10
mov [ rsp + 0x3198 ], r13
mov [ rsp + 0x31a0 ], r10
mov [ rsp + 0x31a8 ], r10
mov [ rsp + 0x31b0 ], rbp
mov [ rsp + 0x31b8 ], r13
mov [ rsp + 0x31c0 ], r8
mov [ rsp + 0x31c8 ], rbx
mov [ rsp + 0x31d0 ], rdi
mov [ rsp + 0x31d8 ], r9
mov [ rsp + 0x31e0 ], rdx
mov [ rsp + 0x31e8 ], r12
mov [ rsp + 0x31f0 ], rbx
mov [ rsp + 0x31f8 ], r10
mov [ rsp + 0x3200 ], r14
mov [ rsp + 0x3208 ], rsi
mov [ rsp + 0x320 ], rax
mov [ rsp + 0x3210 ], r10
mov [ rsp + 0x3218 ], rsi
mov [ rsp + 0x3220 ], rsi
mov [ rsp + 0x3228 ], rbx
mov [ rsp + 0x3230 ], r11
mov [ rsp + 0x3238 ], r13
mov [ rsp + 0x3240 ], rbp
mov [ rsp + 0x3248 ], r11
mov [ rsp + 0x3250 ], rdx
mov [ rsp + 0x3258 ], rcx
mov [ rsp + 0x3260 ], r13
mov [ rsp + 0x3268 ], r8
mov [ rsp + 0x3270 ], r11
mov [ rsp + 0x3278 ], rbp
mov [ rsp + 0x3280 ], rdx
mov [ rsp + 0x3288 ], r13
mov [ rsp + 0x328 ], rdx
mov [ rsp + 0x3290 ], r14
mov [ rsp + 0x3298 ], r15
mov [ rsp + 0x32a0 ], r11
mov [ rsp + 0x32a8 ], rsi
mov [ rsp + 0x32b0 ], rcx
mov [ rsp + 0x32b8 ], r8
mov [ rsp + 0x32c0 ], r10
mov [ rsp + 0x32c8 ], r12
mov [ rsp + 0x32d0 ], rax
mov [ rsp + 0x32d8 ], rdx
mov [ rsp + 0x32e0 ], rdi
mov [ rsp + 0x32e8 ], rsi
mov [ rsp + 0x32f0 ], rbp
mov [ rsp + 0x32f8 ], r13
mov [ rsp + 0x3300 ], r14
mov [ rsp + 0x3308 ], r12
mov [ rsp + 0x330 ], r15
mov [ rsp + 0x3310 ], r11
mov [ rsp + 0x3318 ], rsi
mov [ rsp + 0x3320 ], rdi
mov [ rsp + 0x3328 ], rdi
mov [ rsp + 0x3330 ], r9
mov [ rsp + 0x3338 ], r8
mov [ rsp + 0x3340 ], r12
mov [ rsp + 0x3348 ], r8
mov [ rsp + 0x3350 ], rax
mov [ rsp + 0x3358 ], rsi
mov [ rsp + 0x3360 ], rbx
mov [ rsp + 0x3368 ], rbx
mov [ rsp + 0x3370 ], rdx
mov [ rsp + 0x3378 ], rsi
mov [ rsp + 0x3380 ], rcx
mov [ rsp + 0x3388 ], r15
mov [ rsp + 0x338 ], rcx
mov [ rsp + 0x3390 ], r9
mov [ rsp + 0x3398 ], rcx
mov [ rsp + 0x33a0 ], r12
mov [ rsp + 0x33a8 ], r11
mov [ rsp + 0x33b0 ], r8
mov [ rsp + 0x33b8 ], rbp
mov [ rsp + 0x33c0 ], rcx
mov [ rsp + 0x33c8 ], r11
mov [ rsp + 0x33d0 ], rbp
mov [ rsp + 0x33d8 ], r15
mov [ rsp + 0x33e0 ], rbp
mov [ rsp + 0x33e8 ], r14
mov [ rsp + 0x33f0 ], rax
mov [ rsp + 0x33f8 ], rbx
mov [ rsp + 0x3400 ], rax
mov [ rsp + 0x3408 ], r9
mov [ rsp + 0x340 ], r12
mov [ rsp + 0x3410 ], rcx
mov [ rsp + 0x3418 ], rdi
mov [ rsp + 0x3420 ], r11
mov [ rsp + 0x3428 ], rdx
mov [ rsp + 0x3430 ], r15
mov [ rsp + 0x3438 ], r13
mov [ rsp + 0x3440 ], rdx
mov [ rsp + 0x3448 ], r14
mov [ rsp + 0x3450 ], rax
mov [ rsp + 0x3458 ], r8
mov [ rsp + 0x3460 ], rax
mov [ rsp + 0x3468 ], r11
mov [ rsp + 0x3470 ], rbp
mov [ rsp + 0x3478 ], rax
mov [ rsp + 0x3480 ], r9
mov [ rsp + 0x3488 ], rcx
mov [ rsp + 0x348 ], rax
mov [ rsp + 0x3490 ], r8
mov [ rsp + 0x3498 ], rbx
mov [ rsp + 0x34a0 ], rcx
mov [ rsp + 0x34a8 ], r8
mov [ rsp + 0x34b0 ], rdi
mov [ rsp + 0x34b8 ], r14
mov [ rsp + 0x34c0 ], r11
mov [ rsp + 0x34c8 ], r10
mov [ rsp + 0x34d0 ], r15
mov [ rsp + 0x34d8 ], rsi
mov [ rsp + 0x34e0 ], rcx
mov [ rsp + 0x34e8 ], r11
mov [ rsp + 0x34f0 ], rax
mov [ rsp + 0x34f8 ], rdi
mov [ rsp + 0x3500 ], r9
mov [ rsp + 0x3508 ], r10
mov [ rsp + 0x350 ], r13
mov [ rsp + 0x3510 ], rdi
mov [ rsp + 0x3518 ], r15
mov [ rsp + 0x3520 ], rbp
mov [ rsp + 0x3528 ], r15
mov [ rsp + 0x3530 ], r9
mov [ rsp + 0x3538 ], rdi
mov [ rsp + 0x3540 ], r8
mov [ rsp + 0x3548 ], r8
mov [ rsp + 0x3550 ], rbx
mov [ rsp + 0x3558 ], r8
mov [ rsp + 0x3560 ], rax
mov [ rsp + 0x3568 ], rcx
mov [ rsp + 0x3570 ], r14
mov [ rsp + 0x3578 ], rbp
mov [ rsp + 0x3580 ], rax
mov [ rsp + 0x3588 ], rdi
mov [ rsp + 0x358 ], r8
mov [ rsp + 0x3590 ], r12
mov [ rsp + 0x3598 ], rdi
mov [ rsp + 0x35a0 ], rcx
mov [ rsp + 0x35a8 ], r9
mov [ rsp + 0x35b0 ], rdx
mov [ rsp + 0x35b8 ], rax
mov [ rsp + 0x35c0 ], r10
mov [ rsp + 0x35c8 ], rcx
mov [ rsp + 0x35d0 ], r15
mov [ rsp + 0x35d8 ], r10
mov [ rsp + 0x35e0 ], r10
mov [ rsp + 0x35e8 ], rsi
mov [ rsp + 0x35f0 ], r9
mov [ rsp + 0x35f8 ], r9
mov [ rsp + 0x3600 ], r13
mov [ rsp + 0x3608 ], r14
mov [ rsp + 0x360 ], rsi
mov [ rsp + 0x3610 ], r10
mov [ rsp + 0x3618 ], r8
mov [ rsp + 0x3620 ], r10
mov [ rsp + 0x3628 ], r11
mov [ rsp + 0x3630 ], rbp
mov [ rsp + 0x3638 ], r10
mov [ rsp + 0x3640 ], rbx
mov [ rsp + 0x3648 ], r14
mov [ rsp + 0x3650 ], r13
mov [ rsp + 0x3658 ], rcx
mov [ rsp + 0x3660 ], r8
mov [ rsp + 0x3668 ], r13
mov [ rsp + 0x3670 ], r10
mov [ rsp + 0x3678 ], rcx
mov [ rsp + 0x3680 ], r10
mov [ rsp + 0x3688 ], rbx
mov [ rsp + 0x368 ], rbx
mov [ rsp + 0x3690 ], rcx
mov [ rsp + 0x3698 ], rax
mov [ rsp + 0x36a0 ], r13
mov [ rsp + 0x36a8 ], r8
mov [ rsp + 0x36b0 ], r15
mov [ rsp + 0x36b8 ], rax
mov [ rsp + 0x36c0 ], rdx
mov [ rsp + 0x36c8 ], r10
mov [ rsp + 0x36d0 ], rdi
mov [ rsp + 0x36d8 ], rax
mov [ rsp + 0x36e0 ], rdi
mov [ rsp + 0x36e8 ], r10
mov [ rsp + 0x36f0 ], rcx
mov [ rsp + 0x36f8 ], rax
mov [ rsp + 0x3700 ], rsi
mov [ rsp + 0x3708 ], r15
mov [ rsp + 0x370 ], rdx
mov [ rsp + 0x3710 ], rcx
mov [ rsp + 0x3718 ], r8
mov [ rsp + 0x3720 ], rbx
mov [ rsp + 0x3728 ], rbp
mov [ rsp + 0x3730 ], r15
mov [ rsp + 0x3738 ], r14
mov [ rsp + 0x3740 ], r13
mov [ rsp + 0x3748 ], r12
mov [ rsp + 0x3750 ], rbp
mov [ rsp + 0x3758 ], r15
mov [ rsp + 0x3760 ], rcx
mov [ rsp + 0x3768 ], rbx
mov [ rsp + 0x3770 ], rdx
mov [ rsp + 0x3778 ], r12
mov [ rsp + 0x3780 ], r11
mov [ rsp + 0x3788 ], r15
mov [ rsp + 0x378 ], r13
mov [ rsp + 0x3790 ], r8
mov [ rsp + 0x3798 ], r14
mov [ rsp + 0x37a0 ], r12
mov [ rsp + 0x37a8 ], r8
mov [ rsp + 0x37b0 ], rdx
mov [ rsp + 0x37b8 ], r15
mov [ rsp + 0x37c0 ], r11
mov [ rsp + 0x37c8 ], r14
mov [ rsp + 0x37d0 ], rdi
mov [ rsp + 0x37d8 ], rsi
mov [ rsp + 0x37e0 ], rsi
mov [ rsp + 0x37e8 ], rax
mov [ rsp + 0x37f0 ], r14
mov [ rsp + 0x37f8 ], rdx
mov [ rsp + 0x3800 ], r15
mov [ rsp + 0x3808 ], rbx
mov [ rsp + 0x380 ], rdi
mov [ rsp + 0x3810 ], rsi
mov [ rsp + 0x3818 ], r11
mov [ rsp + 0x3820 ], r10
mov [ rsp + 0x3828 ], r14
mov [ rsp + 0x3830 ], r10
mov [ rsp + 0x3838 ], r14
mov [ rsp + 0x3840 ], rbx
mov [ rsp + 0x3848 ], rcx
mov [ rsp + 0x3850 ], rbx
mov [ rsp + 0x3858 ], rsi
mov [ rsp + 0x3860 ], rax
mov [ rsp + 0x3868 ], r8
mov [ rsp + 0x3870 ], rdx
mov [ rsp + 0x3878 ], r13
mov [ rsp + 0x3880 ], r14
mov [ rsp + 0x3888 ], r9
mov [ rsp + 0x388 ], r11
mov [ rsp + 0x3890 ], r10
mov [ rsp + 0x3898 ], rax
mov [ rsp + 0x38a0 ], r12
mov [ rsp + 0x38a8 ], rbx
mov [ rsp + 0x38b0 ], r11
mov [ rsp + 0x38b8 ], r9
mov [ rsp + 0x38c0 ], r12
mov [ rsp + 0x38c8 ], rdi
mov [ rsp + 0x38d0 ], rbx
mov [ rsp + 0x38d8 ], rdx
mov [ rsp + 0x38e0 ], r10
mov [ rsp + 0x38e8 ], r11
mov [ rsp + 0x38f0 ], rax
mov [ rsp + 0x38f8 ], rbp
mov [ rsp + 0x38 ], r14
mov [ rsp + 0x3900 ], r15
mov [ rsp + 0x3908 ], r12
mov [ rsp + 0x390 ], r11
mov [ rsp + 0x3910 ], rdx
mov [ rsp + 0x3918 ], r11
mov [ rsp + 0x3920 ], r15
mov [ rsp + 0x3928 ], r9
mov [ rsp + 0x3930 ], rdi
mov [ rsp + 0x3938 ], r11
mov [ rsp + 0x3940 ], r8
mov [ rsp + 0x3948 ], r10
mov [ rsp + 0x3950 ], r15
mov [ rsp + 0x3958 ], rcx
mov [ rsp + 0x3960 ], rcx
mov [ rsp + 0x3968 ], rax
mov [ rsp + 0x3970 ], r14
mov [ rsp + 0x3978 ], rbx
mov [ rsp + 0x3980 ], rbp
mov [ rsp + 0x3988 ], r12
mov [ rsp + 0x398 ], rsi
mov [ rsp + 0x3990 ], r13
mov [ rsp + 0x3998 ], r14
mov [ rsp + 0x39a0 ], r15
mov [ rsp + 0x3a0 ], r12
mov [ rsp + 0x3a8 ], r13
mov [ rsp + 0x3b0 ], r14
mov [ rsp + 0x3b8 ], rcx
mov [ rsp + 0x3c0 ], r8
mov [ rsp + 0x3c8 ], r15
mov [ rsp + 0x3d0 ], rdx
mov [ rsp + 0x3d8 ], r8
mov [ rsp + 0x3e0 ], r10
mov [ rsp + 0x3e8 ], r14
mov [ rsp + 0x3f0 ], rsi
mov [ rsp + 0x3f8 ], r14
mov [ rsp + 0x400 ], r8
mov [ rsp + 0x408 ], r10
mov [ rsp + 0x40 ], r14
mov [ rsp + 0x410 ], rcx
mov [ rsp + 0x418 ], r15
mov [ rsp + 0x420 ], r15
mov [ rsp + 0x428 ], r9
mov [ rsp + 0x430 ], r8
mov [ rsp + 0x438 ], r15
mov [ rsp + 0x440 ], rax
mov [ rsp + 0x448 ], rdi
mov [ rsp + 0x450 ], r13
mov [ rsp + 0x458 ], rdx
mov [ rsp + 0x460 ], r14
mov [ rsp + 0x468 ], rdx
mov [ rsp + 0x470 ], r10
mov [ rsp + 0x478 ], r10
mov [ rsp + 0x480 ], r8
mov [ rsp + 0x488 ], r10
mov [ rsp + 0x48 ], r10
mov [ rsp + 0x48 ], r12
mov [ rsp + 0x48 ], r15
mov [ rsp + 0x48 ], r9
mov [ rsp + 0x48 ], rbx
mov [ rsp + 0x48 ], rdi
mov [ rsp + 0x48 ], rdx
mov [ rsp + 0x490 ], rbx
mov [ rsp + 0x498 ], r15
mov [ rsp + 0x4a0 ], rsi
mov [ rsp + 0x4a8 ], rsi
mov [ rsp + 0x4b0 ], rdx
mov [ rsp + 0x4b8 ], r14
mov [ rsp + 0x4c0 ], r10
mov [ rsp + 0x4c8 ], rdx
mov [ rsp + 0x4d0 ], r9
mov [ rsp + 0x4d8 ], r13
mov [ rsp + 0x4e0 ], r13
mov [ rsp + 0x4e8 ], r10
mov [ rsp + 0x4f0 ], r15
mov [ rsp + 0x4f8 ], r9
mov [ rsp + 0x500 ], rdi
mov [ rsp + 0x508 ], r14
mov [ rsp + 0x50 ], r14
mov [ rsp + 0x510 ], rdx
mov [ rsp + 0x518 ], r11
mov [ rsp + 0x520 ], rbx
mov [ rsp + 0x528 ], r10
mov [ rsp + 0x530 ], r15
mov [ rsp + 0x538 ], rax
mov [ rsp + 0x540 ], r8
mov [ rsp + 0x548 ], r13
mov [ rsp + 0x550 ], r9
mov [ rsp + 0x558 ], rax
mov [ rsp + 0x560 ], r13
mov [ rsp + 0x568 ], r8
mov [ rsp + 0x570 ], rax
mov [ rsp + 0x578 ], r8
mov [ rsp + 0x580 ], r15
mov [ rsp + 0x588 ], rsi
mov [ rsp + 0x58 ], r10
mov [ rsp + 0x590 ], r15
mov [ rsp + 0x598 ], rdi
mov [ rsp + 0x5a0 ], rdx
mov [ rsp + 0x5a8 ], rbp
mov [ rsp + 0x5b0 ], r12
mov [ rsp + 0x5b8 ], rcx
mov [ rsp + 0x5c0 ], r10
mov [ rsp + 0x5c8 ], rdi
mov [ rsp + 0x5d0 ], r10
mov [ rsp + 0x5d8 ], r10
mov [ rsp + 0x5e0 ], rbp
mov [ rsp + 0x5e8 ], rax
mov [ rsp + 0x5f0 ], rdi
mov [ rsp + 0x5f8 ], rbp
mov [ rsp + 0x600 ], r13
mov [ rsp + 0x608 ], rcx
mov [ rsp + 0x60 ], r8
mov [ rsp + 0x610 ], r11
mov [ rsp + 0x618 ], rbx
mov [ rsp + 0x620 ], r8
mov [ rsp + 0x628 ], rbx
mov [ rsp + 0x630 ], r13
mov [ rsp + 0x638 ], rbp
mov [ rsp + 0x640 ], r9
mov [ rsp + 0x648 ], rsi
mov [ rsp + 0x650 ], r11
mov [ rsp + 0x658 ], rax
mov [ rsp + 0x660 ], rsi
mov [ rsp + 0x668 ], r13
mov [ rsp + 0x670 ], rsi
mov [ rsp + 0x678 ], rsi
mov [ rsp + 0x680 ], rcx
mov [ rsp + 0x688 ], r9
mov [ rsp + 0x68 ], rcx
mov [ rsp + 0x690 ], rbx
mov [ rsp + 0x698 ], r11
mov [ rsp + 0x6a0 ], rdi
mov [ rsp + 0x6a8 ], r8
mov [ rsp + 0x6b0 ], rbp
mov [ rsp + 0x6b8 ], rax
mov [ rsp + 0x6c0 ], rax
mov [ rsp + 0x6c8 ], rax
mov [ rsp + 0x6d0 ], rdi
mov [ rsp + 0x6d8 ], r9
mov [ rsp + 0x6e0 ], r10
mov [ rsp + 0x6e8 ], r14
mov [ rsp + 0x6f0 ], r12
mov [ rsp + 0x6f8 ], r11
mov [ rsp + 0x700 ], rax
mov [ rsp + 0x708 ], r14
mov [ rsp + 0x70 ], r14
mov [ rsp + 0x710 ], rbx
mov [ rsp + 0x718 ], rbx
mov [ rsp + 0x720 ], r10
mov [ rsp + 0x728 ], r8
mov [ rsp + 0x730 ], rdi
mov [ rsp + 0x738 ], rbx
mov [ rsp + 0x740 ], r14
mov [ rsp + 0x748 ], r10
mov [ rsp + 0x750 ], r8
mov [ rsp + 0x758 ], r14
mov [ rsp + 0x760 ], rsi
mov [ rsp + 0x768 ], r10
mov [ rsp + 0x770 ], r15
mov [ rsp + 0x778 ], rdx
mov [ rsp + 0x780 ], rsi
mov [ rsp + 0x788 ], rax
mov [ rsp + 0x78 ], r15
mov [ rsp + 0x790 ], rdx
mov [ rsp + 0x798 ], rcx
mov [ rsp + 0x7a0 ], rax
mov [ rsp + 0x7a8 ], r11
mov [ rsp + 0x7b0 ], r15
mov [ rsp + 0x7b8 ], r14
mov [ rsp + 0x7c0 ], rbp
mov [ rsp + 0x7c8 ], rdi
mov [ rsp + 0x7d0 ], r11
mov [ rsp + 0x7d8 ], r8
mov [ rsp + 0x7e0 ], rbp
mov [ rsp + 0x7e8 ], rdi
mov [ rsp + 0x7f0 ], rsi
mov [ rsp + 0x7f8 ], r13
mov [ rsp + 0x800 ], r9
mov [ rsp + 0x808 ], r14
mov [ rsp + 0x80 ], r9
mov [ rsp + 0x810 ], r12
mov [ rsp + 0x818 ], rsi
mov [ rsp + 0x820 ], r10
mov [ rsp + 0x828 ], r13
mov [ rsp + 0x830 ], rbp
mov [ rsp + 0x838 ], rax
mov [ rsp + 0x840 ], r9
mov [ rsp + 0x848 ], r12
mov [ rsp + 0x850 ], rcx
mov [ rsp + 0x858 ], r15
mov [ rsp + 0x860 ], rdi
mov [ rsp + 0x868 ], rax
mov [ rsp + 0x870 ], rcx
mov [ rsp + 0x878 ], rax
mov [ rsp + 0x880 ], r13
mov [ rsp + 0x888 ], r14
mov [ rsp + 0x88 ], rdi
mov [ rsp + 0x890 ], r12
mov [ rsp + 0x898 ], r15
mov [ rsp + 0x8a0 ], rax
mov [ rsp + 0x8a8 ], r12
mov [ rsp + 0x8b0 ], rdx
mov [ rsp + 0x8b8 ], rdi
mov [ rsp + 0x8c0 ], r8
mov [ rsp + 0x8c8 ], r15
mov [ rsp + 0x8d0 ], r14
mov [ rsp + 0x8d8 ], r10
mov [ rsp + 0x8e0 ], r14
mov [ rsp + 0x8e8 ], r12
mov [ rsp + 0x8f0 ], rax
mov [ rsp + 0x8f8 ], r13
mov [ rsp + 0x8 ], rbx
mov [ rsp + 0x900 ], rcx
mov [ rsp + 0x908 ], rdi
mov [ rsp + 0x90 ], r12
mov [ rsp + 0x910 ], r9
mov [ rsp + 0x918 ], rdi
mov [ rsp + 0x920 ], r13
mov [ rsp + 0x928 ], rbx
mov [ rsp + 0x930 ], rbp
mov [ rsp + 0x938 ], r15
mov [ rsp + 0x940 ], r13
mov [ rsp + 0x948 ], r13
mov [ rsp + 0x950 ], rcx
mov [ rsp + 0x958 ], rax
mov [ rsp + 0x960 ], r11
mov [ rsp + 0x968 ], r11
mov [ rsp + 0x970 ], r12
mov [ rsp + 0x978 ], rdi
mov [ rsp + 0x980 ], rcx
mov [ rsp + 0x988 ], r10
mov [ rsp + 0x98 ], rcx
mov [ rsp + 0x990 ], r9
mov [ rsp + 0x998 ], rax
mov [ rsp + 0x9a0 ], rax
mov [ rsp + 0x9a8 ], rbp
mov [ rsp + 0x9b0 ], rdx
mov [ rsp + 0x9b8 ], rax
mov [ rsp + 0x9c0 ], rdx
mov [ rsp + 0x9c8 ], r12
mov [ rsp + 0x9d0 ], rdx
mov [ rsp + 0x9d8 ], rbx
mov [ rsp + 0x9e0 ], rdi
mov [ rsp + 0x9e8 ], rdi
mov [ rsp + 0x9f0 ], r8
mov [ rsp + 0x9f8 ], rax
mov [ rsp + 0xa00 ], r14
mov [ rsp + 0xa08 ], r10
mov [ rsp + 0xa0 ], rdx
mov [ rsp + 0xa10 ], r13
mov [ rsp + 0xa18 ], rdx
mov [ rsp + 0xa20 ], r14
mov [ rsp + 0xa28 ], rdi
mov [ rsp + 0xa30 ], rax
mov [ rsp + 0xa38 ], r10
mov [ rsp + 0xa40 ], rsi
mov [ rsp + 0xa48 ], rbx
mov [ rsp + 0xa50 ], r9
mov [ rsp + 0xa58 ], rbx
mov [ rsp + 0xa60 ], rdx
mov [ rsp + 0xa68 ], r15
mov [ rsp + 0xa70 ], rsi
mov [ rsp + 0xa78 ], rax
mov [ rsp + 0xa80 ], r14
mov [ rsp + 0xa88 ], rax
mov [ rsp + 0xa8 ], r9
mov [ rsp + 0xa90 ], r13
mov [ rsp + 0xa98 ], rbp
mov [ rsp + 0xaa0 ], r10
mov [ rsp + 0xaa8 ], r11
mov [ rsp + 0xab0 ], rbx
mov [ rsp + 0xab8 ], r9
mov [ rsp + 0xac0 ], r15
mov [ rsp + 0xac8 ], r10
mov [ rsp + 0xad0 ], r11
mov [ rsp + 0xad8 ], r13
mov [ rsp + 0xae0 ], rbx
mov [ rsp + 0xae8 ], rdi
mov [ rsp + 0xaf0 ], rdi
mov [ rsp + 0xaf8 ], rdx
mov [ rsp + 0xb00 ], r8
mov [ rsp + 0xb08 ], rcx
mov [ rsp + 0xb0 ], rcx
mov [ rsp + 0xb10 ], r13
mov [ rsp + 0xb18 ], r15
mov [ rsp + 0xb20 ], r15
mov [ rsp + 0xb28 ], r9
mov [ rsp + 0xb30 ], r12
mov [ rsp + 0xb38 ], rcx
mov [ rsp + 0xb40 ], rbx
mov [ rsp + 0xb48 ], r10
mov [ rsp + 0xb50 ], r10
mov [ rsp + 0xb58 ], r12
mov [ rsp + 0xb60 ], r8
mov [ rsp + 0xb68 ], rax
mov [ rsp + 0xb70 ], rsi
mov [ rsp + 0xb78 ], rdi
mov [ rsp + 0xb80 ], r13
mov [ rsp + 0xb88 ], rbp
mov [ rsp + 0xb8 ], rsi
mov [ rsp + 0xb90 ], rdx
mov [ rsp + 0xb98 ], r12
mov [ rsp + 0xba0 ], r13
mov [ rsp + 0xba8 ], r13
mov [ rsp + 0xbb0 ], r9
mov [ rsp + 0xbb8 ], rdi
mov [ rsp + 0xbc0 ], r11
mov [ rsp + 0xbc8 ], rsi
mov [ rsp + 0xbd0 ], rbx
mov [ rsp + 0xbd8 ], r14
mov [ rsp + 0xbe0 ], rax
mov [ rsp + 0xbe8 ], r8
mov [ rsp + 0xbf0 ], rdx
mov [ rsp + 0xbf8 ], r15
mov [ rsp + 0xc00 ], rbx
mov [ rsp + 0xc08 ], rax
mov [ rsp + 0xc0 ], rdi
mov [ rsp + 0xc10 ], r11
mov [ rsp + 0xc18 ], r15
mov [ rsp + 0xc20 ], r14
mov [ rsp + 0xc28 ], rax
mov [ rsp + 0xc30 ], rcx
mov [ rsp + 0xc38 ], r10
mov [ rsp + 0xc40 ], r15
mov [ rsp + 0xc48 ], r9
mov [ rsp + 0xc50 ], r11
mov [ rsp + 0xc58 ], r9
mov [ rsp + 0xc60 ], rdi
mov [ rsp + 0xc68 ], r9
mov [ rsp + 0xc70 ], r15
mov [ rsp + 0xc78 ], r11
mov [ rsp + 0xc80 ], rdi
mov [ rsp + 0xc88 ], rbx
mov [ rsp + 0xc8 ], r9
mov [ rsp + 0xc90 ], rdx
mov [ rsp + 0xc98 ], rbp
mov [ rsp + 0xca0 ], rbp
mov [ rsp + 0xca8 ], r15
mov [ rsp + 0xcb0 ], r13
mov [ rsp + 0xcb8 ], r11
mov [ rsp + 0xcc0 ], r10
mov [ rsp + 0xcc8 ], r10
mov [ rsp + 0xcd0 ], r11
mov [ rsp + 0xcd8 ], r9
mov [ rsp + 0xce0 ], r12
mov [ rsp + 0xce8 ], rsi
mov [ rsp + 0xcf0 ], r11
mov [ rsp + 0xcf8 ], r13
mov [ rsp + 0xd00 ], r10
mov [ rsp + 0xd08 ], rsi
mov [ rsp + 0xd0 ], r10
mov [ rsp + 0xd10 ], rax
mov [ rsp + 0xd18 ], rdi
mov [ rsp + 0xd20 ], r8
mov [ rsp + 0xd28 ], rdx
mov [ rsp + 0xd30 ], r9
mov [ rsp + 0xd38 ], rcx
mov [ rsp + 0xd40 ], r12
mov [ rsp + 0xd48 ], r9
mov [ rsp + 0xd50 ], r11
mov [ rsp + 0xd58 ], r10
mov [ rsp + 0xd60 ], rcx
mov [ rsp + 0xd68 ], rdx
mov [ rsp + 0xd70 ], rax
mov [ rsp + 0xd78 ], rbx
mov [ rsp + 0xd80 ], rcx
mov [ rsp + 0xd88 ], rax
mov [ rsp + 0xd8 ], rbx
mov [ rsp + 0xd90 ], r13
mov [ rsp + 0xd98 ], r15
mov [ rsp + 0xda0 ], r13
mov [ rsp + 0xda8 ], rbp
mov [ rsp + 0xdb0 ], r15
mov [ rsp + 0xdb8 ], rcx
mov [ rsp + 0xdc0 ], rbp
mov [ rsp + 0xdc8 ], rax
mov [ rsp + 0xdd0 ], rdi
mov [ rsp + 0xdd8 ], r11
mov [ rsp + 0xde0 ], r12
mov [ rsp + 0xde8 ], rdi
mov [ rsp + 0xdf0 ], rdx
mov [ rsp + 0xdf8 ], r15
mov [ rsp + 0xe00 ], r13
mov [ rsp + 0xe08 ], r14
mov [ rsp + 0xe0 ], r13
mov [ rsp + 0xe10 ], r15
mov [ rsp + 0xe18 ], rax
mov [ rsp + 0xe20 ], rcx
mov [ rsp + 0xe28 ], r11
mov [ rsp + 0xe30 ], rbx
mov [ rsp + 0xe38 ], r11
mov [ rsp + 0xe40 ], r9
mov [ rsp + 0xe48 ], r14
mov [ rsp + 0xe50 ], r10
mov [ rsp + 0xe58 ], r11
mov [ rsp + 0xe60 ], r10
mov [ rsp + 0xe68 ], r15
mov [ rsp + 0xe70 ], rbp
mov [ rsp + 0xe78 ], r8
mov [ rsp + 0xe80 ], r14
mov [ rsp + 0xe88 ], r11
mov [ rsp + 0xe8 ], rdx
mov [ rsp + 0xe90 ], rdx
mov [ rsp + 0xe98 ], rdx
mov [ rsp + 0xea0 ], rsi
mov [ rsp + 0xea8 ], r9
mov [ rsp + 0xeb0 ], rdi
mov [ rsp + 0xeb8 ], rcx
mov [ rsp + 0xec0 ], r13
mov [ rsp + 0xec8 ], rdx
mov [ rsp + 0xed0 ], rax
mov [ rsp + 0xed8 ], rcx
mov [ rsp + 0xee0 ], rbx
mov [ rsp + 0xee8 ], rsi
mov [ rsp + 0xef0 ], r15
mov [ rsp + 0xef8 ], rbp
mov [ rsp + 0xf00 ], r8
mov [ rsp + 0xf08 ], r14
mov [ rsp + 0xf0 ], rax
mov [ rsp + 0xf10 ], r12
mov [ rsp + 0xf18 ], rbp
mov [ rsp + 0xf20 ], rdi
mov [ rsp + 0xf28 ], r15
mov [ rsp + 0xf30 ], rax
mov [ rsp + 0xf38 ], r13
mov [ rsp + 0xf40 ], r8
mov [ rsp + 0xf48 ], rbx
mov [ rsp + 0xf50 ], r9
mov [ rsp + 0xf58 ], r10
mov [ rsp + 0xf60 ], rdx
mov [ rsp + 0xf68 ], r13
mov [ rsp + 0xf70 ], rdi
mov [ rsp + 0xf78 ], rax
mov [ rsp + 0xf80 ], rax
mov [ rsp + 0xf88 ], rbx
mov [ rsp + 0xf8 ], rbx
mov [ rsp + 0xf90 ], r10
mov [ rsp + 0xf98 ], r10
mov [ rsp + 0xfa0 ], rbp
mov [ rsp + 0xfa8 ], rdi
mov [ rsp + 0xfb0 ], r11
mov [ rsp + 0xfb8 ], rax
mov [ rsp + 0xfc0 ], r14
mov [ rsp + 0xfc8 ], r14
mov [ rsp + 0xfd0 ], r15
mov [ rsp + 0xfd8 ], rcx
mov [ rsp + 0xfe0 ], rdx
mov [ rsp + 0xfe8 ], r8
mov [ rsp + 0xff0 ], rsi
mov [ rsp + 0xff8 ], r8
mov byte [ rsp + 0x18 ], r10b
mov byte [ rsp + 0xa0 ], r14b
mov byte [ rsp + 0xa8 ], r14b
mov byte [ rsp + 0xf0 ], r15b
mov r10b, dl
mov r10, r12
mov r10, r9
mov r10, rdx
mov r10, rdx
mov r10, [ rsp + 0x58 ]
mov r11, -0x1
mov r11, r13
mov r11, rdx
mov r11, [ rsi + 0x10 ]
mov r11, [ rsp + 0x30 ]
mov r11, [ rsp + 0x60 ]
mov r11, [ rsp + 0x90 ]
mov r12, r15
mov r12, rax
mov r12, rcx
mov r12, [ rsp + 0x110 ]
mov r12, [ rsp + 0x20 ]
mov r12, [ rsp + 0x28 ]
mov r12, [ rsp + 0x30 ]
mov r12, [ rsp + 0x58 ]
mov r13, -0x1
mov r13, r10
mov r13, rdx
mov r13, rdx
mov r13, [ rsi + 0x18 ]
mov r13, [ rsp + 0x10 ]
mov r13, [ rsp + 0x118 ]
mov r13, [ rsp + 0x28 ]
mov r13, [ rsp + 0x30 ]
mov r13, [ rsp + 0x40 ]
mov r13, [ rsp + 0x60 ]
mov r14, -0x1
mov r14, r10
mov r14, rax
mov r14, rdx
mov r14, [ rsp + 0x120 ]
mov r14, [ rsp + 0x30 ]
mov r14, [ rsp + 0x38 ]
mov r14, [ rsp + 0x68 ]
mov r15, -0x1
mov r15, r8
mov r15, rdx
mov r15, rdx
mov r15, [ rsp + 0x128 ]
mov r15, [ rsp + 0x38 ]
mov r15, [ rsp + 0x40 ]
mov r15, [ rsp + 0x70 ]
mov r15, [ rsp + 0x8 ]
mov r15, [ rsp + 0xf8 ]
mov r8, r12
mov r8, rbx
mov r8, [ rsp + 0x18 ]
mov r8, [ rsp + 0x8 ]
mov r8, [ rsp + 0x8 ]
mov r9, r14
mov r9, rbx
mov r9, rdx
mov r9, [ rsi + 0x0 ]
mov r9, [ rsp + 0x30 ]
mov r9, [ rsp + 0x88 ]
mov r9, [ rsp + 0xb0 ]
mov r9, [ rsp + 0xd8 ]
mov [ rax + 0x0 ], r11
mov [ rax + 0x0 ], rbx
mov [ rax + 0x10 ], rbp
mov [ rax + 0x10 ], rcx
mov [ rax + 0x18 ], r14
mov [ rax + 0x18 ], r15
mov [ rax + 0x20 ], rcx
mov [ rax + 0x8 ], r9
mov [ rax + 0x8 ], rbp
mov rax, [ rsp + 0x0 ]
mov rax, [ rsp + 0x0 ]
mov rbp, -0x1
mov rbp, r9
mov rbp, rbx
mov rbp, [ rsp + 0x108 ]
mov rbp, [ rsp + 0x18 ]
mov rbp, [ rsp + 0x20 ]
mov rbp, [ rsp + 0x50 ]
mov rbp, [ rsp + 0x78 ]
mov rbx, -0x1
mov rbx, rdx
mov rbx, [ rsp + 0x10 ]
mov rbx, [ rsp + 0x100 ]
mov rbx, [ rsp + 0x18 ]
mov rbx, [ rsp + 0x38 ]
mov rbx, [ rsp + 0x48 ]
mov rbx, [ rsp + 0xc8 ]
mov rbx, [ rsp + 0xe0 ]
mov rcx, -0x1
mov rcx, r14
mov rcx, r14
mov rcx, rbp
mov rcx, [ rsp + 0x28 ]
mov rcx, [ rsp + 0xb8 ]
mov [ rdi + 0x0 ], r12
mov [ rdi + 0x0 ], r9
mov [ rdi + 0x10 ], r13
mov [ rdi + 0x10 ], r14
mov [ rdi + 0x18 ], r8
mov [ rdi + 0x18 ], rcx
mov [ rdi + 0x20 ], r15
mov [ rdi + 0x20 ], r8
mov [ rdi + 0x8 ], r10
mov [ rdi + 0x8 ], rdx
mov rdi, [ rsp + 0x50 ]
mov rdi, [ rsp + 0x8 ]
mov rdi, [ rsp + 0xe8 ]
mov rdx, -0x1
mov rdx, r10
mov rdx, r10
mov rdx, r11
mov rdx, r12
mov rdx, r13
mov rdx, r13
mov rdx, r14
mov rdx, r15
mov rdx, r15
mov rdx, [ r9 + 0x8 ]
mov rdx, rbx
mov rdx, rcx
mov rdx, [ rsi + 0x0 ]
mov rdx, [ rsi + 0x0 ]
mov rdx, [ rsi + 0x10 ]
mov rdx, [ rsi + 0x10 ]
mov rdx, [ rsi + 0x18 ]
mov rdx, [ rsi + 0x18 ]
mov rdx, [ rsi + 0x20 ]
mov rdx, [ rsi + 0x8 ]
mov rdx, [ rsi + 0x8 ]
mov rdx, [ rsp + 0x0 ]
mov rdx, [ rsp + 0x30 ]
mov rdx, [ rsp + 0x70 ]
mov rdx, [ rsp + 0x80 ]
mov rdx, [ rsp + 0x90 ]
mov rsi, -0x1
mov rsi, [ r12 + 0x8 ]
mov rsi, [ rsp + 0x30 ]
mov rsi, [ rsp + 0xc0 ]
mov [ rsp + 0x0 ], r9
mov [ rsp + 0x0 ], rcx
mov [ rsp + 0x0 ], rdi
mov [ rsp + 0x0 ], rdi
mov [ rsp + 0x100 ], rbx
mov [ rsp + 0x108 ], rbp
mov [ rsp + 0x10 ], r15
mov [ rsp + 0x10 ], rax
mov [ rsp + 0x10 ], rbx
mov [ rsp + 0x110 ], r12
mov [ rsp + 0x118 ], r13
mov [ rsp + 0x120 ], r14
mov [ rsp + 0x128 ], r15
mov [ rsp + 0x18 ], r14
mov [ rsp + 0x18 ], rbp
mov [ rsp + 0x18 ], rbx
mov [ rsp + 0x20 ], r12
mov [ rsp + 0x20 ], r13
mov [ rsp + 0x20 ], rax
mov [ rsp + 0x20 ], rbp
mov [ rsp + 0x28 ], r11
mov [ rsp + 0x28 ], r12
mov [ rsp + 0x28 ], r13
mov [ rsp + 0x28 ], r15
mov [ rsp + 0x30 ], r10
mov [ rsp + 0x30 ], r11
mov [ rsp + 0x30 ], r12
mov [ rsp + 0x30 ], r13
mov [ rsp + 0x30 ], r14
mov [ rsp + 0x30 ], r9
mov [ rsp + 0x30 ], rsi
mov [ rsp + 0x38 ], r14
mov [ rsp + 0x38 ], r15
mov [ rsp + 0x38 ], r15
mov [ rsp + 0x38 ], rbx
mov [ rsp + 0x40 ], r12
mov [ rsp + 0x40 ], r15
mov [ rsp + 0x40 ], rsi
mov [ rsp + 0x48 ], rbx
mov [ rsp + 0x48 ], rsi
mov [ rsp + 0x50 ], r13
mov [ rsp + 0x50 ], rbp
mov [ rsp + 0x58 ], r12
mov [ rsp + 0x58 ], r9
mov [ rsp + 0x60 ], r13
mov [ rsp + 0x60 ], rbp
mov [ rsp + 0x68 ], r14
mov [ rsp + 0x70 ], r14
mov [ rsp + 0x70 ], r15
mov [ rsp + 0x78 ], rdi
mov [ rsp + 0x80 ], r8
mov [ rsp + 0x88 ], r8
mov [ rsp + 0x8 ], r12
mov [ rsp + 0x8 ], r9
mov [ rsp + 0x8 ], rcx
mov [ rsp + 0x8 ], rdi
mov [ rsp + 0x90 ], r14
mov [ rsp + 0x98 ], rdx
mov [ rsp + 0xb0 ], rbx
mov [ rsp + 0xb8 ], rcx
mov [ rsp + 0xc0 ], rbx
mov [ rsp + 0xc8 ], rcx
mov [ rsp + 0xd0 ], rbp
mov [ rsp + 0xd8 ], rsi
mov [ rsp + 0xe0 ], r13
mov [ rsp + 0xe8 ], rcx
mov [ rsp + 0xf8 ], r14
mov eax, r15d
mov eax, r15d
mov ax, r15w
mov al, r15b |
test/mat/vulkan-math-test_mat.adb | zrmyers/VulkanAda | 1 | 11229 | <reponame>zrmyers/VulkanAda
--------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2021 <NAME>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
--------------------------------------------------------------------------------
with Vulkan.Math.Vec2.Test;
with Vulkan.Math.Vec3.Test;
with Vulkan.Math.Mat2x2.Test;
with Vulkan.Math.Mat2x3.Test;
with Vulkan.Math.Mat2x4.Test;
with Vulkan.Math.Mat3x2.Test;
with Vulkan.Math.Mat3x3.Test;
with Vulkan.Math.Mat3x4.Test;
with Vulkan.Math.Mat4x2.Test;
with Vulkan.Math.Mat4x3.Test;
with Vulkan.Math.Mat4x4.Test;
use Vulkan.Math.Vec2.Test;
use Vulkan.Math.Vec3.Test;
use Vulkan.Math.Mat2x2.Test;
use Vulkan.Math.Mat2x3.Test;
use Vulkan.Math.Mat2x4.Test;
use Vulkan.Math.Mat3x2.Test;
use Vulkan.Math.Mat3x3.Test;
use Vulkan.Math.Mat3x4.Test;
use Vulkan.Math.Mat4x2.Test;
use Vulkan.Math.Mat4x3.Test;
use Vulkan.Math.Mat4x4.Test;
package body Vulkan.Math.Test_Mat is
-- Test Harness for single precision floating point matrices.
procedure Test_Mat is
begin
Test_Mat2x2;
Test_Mat2x3;
Test_Mat2x4;
Test_Mat3x2;
Test_Mat3x3;
Test_Mat3x4;
Test_Mat4x2;
Test_Mat4x3;
Test_Mat4x4;
end Test_Mat;
end Vulkan.Math.Test_Mat;
|
3-mid/opengl/source/lean/text/opengl-glyph-texture.ads | charlie5/lace | 20 | 17961 | with
openGL.Texture,
openGL.GlyphImpl.Texture,
freetype_c.FT_GlyphSlot;
package openGL.Glyph.texture
--
-- A specialisation of Glyph for creating texture glyphs.
--
is
type Item is new Glyph.item with private;
-----------
-- Forge
--
function to_Glyph (glyth_Slot : in freetype_c.FT_GlyphSlot.item;
texture_Id : in openGL.Texture.texture_Name;
xOffset, yOffset : in Integer;
Width, Height : in Integer) return Glyph.texture.item;
--
-- glyth_Slot: The Freetype glyph to be processed.
-- texture_id: The id of the texture that this glyph will be drawn in.
-- xOffset, yOffset: The x and y offset into the parent texture to draw this glyph.
-- Width, Height: The width and height (number of rows) of the parent texture.
function new_Glyph (glyth_Slot : in freetype_c.FT_GlyphSlot.item;
texture_Id : in openGL.Texture.texture_Name;
xOffset, yOffset : in Integer;
Width, Height : in Integer) return access Glyph.texture.item'Class;
--
-- glyth_Slot: The Freetype glyph to be processed.
-- texture_Id: The id of the texture that this glyph will be drawn in.
-- xOffset, yOffset: The x,y offset into the parent texture to draw this glyph.
-- Width, Height: The width and height (number of rows) of the parent texture.
--------------
-- Attributes
--
function Quad (Self : in Item; Pen : in Vector_3) return GlyphImpl.texture.Quad_t;
---------------
-- Operations
--
overriding
function render (Self : in Item; Pen : in Vector_3;
renderMode : in Integer) return Vector_3;
--
-- Render this glyph at the current pen position.
--
-- Pen: The current pen position.
-- renderMode: Render mode to display.
--
-- Returns the advance distance for this glyph.
private
type Item is new Glyph.item with null record;
end openGL.Glyph.texture;
|
trie-functions.agda | rfindler/ial | 29 | 16551 | <gh_stars>10-100
open import trie-core
open import string
open import maybe
module trie-functions (trie-lookup : ∀{A : Set} → trie A → string → maybe A)
(trie-insert : ∀{A : Set} → trie A → string → A → trie A)
(trie-remove : ∀{A : Set} → trie A → string → trie A) where
open import bool
open import char
open import list
open import product
open import unit
open import eq
open import nat
trie-contains : ∀{A : Set} → trie A → string → 𝔹
trie-contains t s with trie-lookup t s
trie-contains t s | nothing = ff
trie-contains t s | just _ = tt
trie-map : ∀{A B : Set} → (A → B) → trie A → trie B
trie-cal-map : ∀{A B : Set} → (A → B) → cal (trie A) → cal (trie B)
trie-map f (Node x x₁) = Node (maybe-map f x) (trie-cal-map f x₁)
trie-cal-map f [] = []
trie-cal-map f ((c , t) :: cs) =
(c , trie-map f t) :: trie-cal-map f cs
trie-to-string-h : ∀{A : Set} → string → (A → string) → trie A → 𝕃 char → string
trie-cal-to-string-h : ∀{A : Set} → string → (A → string) → cal (trie A) → 𝕃 char → string
trie-to-string-h sep d (Node (just x) c) prev-str =
(𝕃char-to-string (reverse prev-str)) ^ sep ^ (d x) ^ "\n" ^ (trie-cal-to-string-h sep d c prev-str)
trie-to-string-h sep d (Node nothing c) prev-str = trie-cal-to-string-h sep d c prev-str
trie-cal-to-string-h sep d [] prev-str = ""
trie-cal-to-string-h sep d ((c , t) :: cs) prev-str =
(trie-to-string-h sep d t (c :: prev-str)) ^ (trie-cal-to-string-h sep d cs prev-str)
{- trie-to-string sep d t returns a string representation of the trie t,
where each mapping from string s to data x is printed as
s sep d x
where sep is a string and d returns a string for any element A of the trie. -}
trie-to-string : ∀{A : Set} → string → (A → string) → trie A → string
trie-to-string sep d t = trie-to-string-h sep d t []
trie-mappings-h : ∀{A : Set} → trie A → 𝕃 char → 𝕃 (string × A)
trie-cal-mappings-h : ∀{A : Set} → cal (trie A) → 𝕃 char → 𝕃 (string × A)
trie-mappings-h (Node (just x) c) prev-str = (𝕃char-to-string (reverse prev-str) , x) :: (trie-cal-mappings-h c prev-str)
trie-mappings-h (Node nothing c) prev-str = (trie-cal-mappings-h c prev-str)
trie-cal-mappings-h [] prev-str = []
trie-cal-mappings-h ((c , t) :: cs) prev-str = trie-mappings-h t (c :: prev-str) ++ (trie-cal-mappings-h cs prev-str)
trie-mappings : ∀{A : Set} → trie A → 𝕃 (string × A)
trie-mappings t = trie-mappings-h t []
-- return a list of all the strings which have associated data in the trie
trie-strings : ∀{A : Set} → trie A → 𝕃 string
trie-strings t = map fst (trie-mappings t)
trie-size : ∀{A : Set} → trie A → ℕ
trie-size t = length (trie-strings t)
trie-nonempty : ∀{A : Set} → trie A → 𝔹
trie-cal-nonempty : ∀{A : Set} → cal (trie A) → 𝔹
trie-nonempty (Node (just x) t) = tt
trie-nonempty (Node nothing c) = trie-cal-nonempty c
trie-cal-nonempty [] = ff
trie-cal-nonempty ((a , t) :: c) = trie-nonempty t || trie-cal-nonempty c
----------------------------------------------------------------------
-- list-tries, which map strings to lists of values
----------------------------------------------------------------------
𝕃trie : Set → Set
𝕃trie A = trie (𝕃 A)
𝕃trie-lookup : ∀{A : Set} → 𝕃trie A → string → 𝕃 A
𝕃trie-lookup t s with trie-lookup t s
... | nothing = []
... | just l = l
𝕃trie-add : ∀{A : Set} → trie (𝕃 A) → string → A → trie (𝕃 A)
𝕃trie-add t s a = trie-insert t s (a :: 𝕃trie-lookup t s)
𝕃trie-add* : ∀{A : Set} → trie (𝕃 A) → string → 𝕃 A → trie (𝕃 A)
𝕃trie-add* t s aa = trie-insert t s (aa ++ 𝕃trie-lookup t s)
----------------------------------------------------------------------
-- stringset
----------------------------------------------------------------------
stringset : Set
stringset = trie ⊤
stringset-contains : stringset → string → 𝔹
stringset-contains ss s = trie-contains ss s
stringset-insert : stringset → string → stringset
stringset-insert ss s = trie-insert ss s triv
stringset-remove : stringset → string → stringset
stringset-remove ss s = trie-remove ss s
stringset-insert𝕃 : stringset → 𝕃 char → stringset
stringset-insert𝕃 ss s = trie-insert-h ss s triv
empty-stringset : stringset
empty-stringset = empty-trie
stringset-insert* : stringset → 𝕃 string → stringset
stringset-insert* s [] = s
stringset-insert* s (x :: xs) = stringset-insert (stringset-insert* s xs) x
stringset-strings : ∀{A : Set} → trie A → 𝕃 string
stringset-strings t = map fst (trie-mappings t)
|
programs/oeis/220/A220465.asm | neoneye/loda | 22 | 161659 | <filename>programs/oeis/220/A220465.asm
; A220465: Reverse reluctant sequence of reverse reluctant sequence A004736.
; 1,2,1,1,2,1,3,1,2,1,2,3,1,2,1,1,2,3,1,2,1,4,1,2,3,1,2,1,3,4,1,2,3,1,2,1,2,3,4,1,2,3,1,2,1,1,2,3,4,1,2,3,1,2,1,5,1,2,3,4,1,2,3,1,2,1,4,5,1,2,3,4,1,2,3,1,2,1,3,4,5,1,2,3,4,1,2,3,1,2,1,2,3,4,5,1,2,3,4,1
seq $0,25676 ; Exponent of 8 (value of i) in n-th number of form 8^i*9^j.
seq $0,212012 ; Triangle read by rows in which row n lists the number of states of the subshells of the n-th shell of the nuclear shell model ordered by energy level in increasing order.
div $0,2
|
test/Succeed/Issue441.agda | cruhland/agda | 1,989 | 16566 | {-# OPTIONS --universe-polymorphism #-}
module Issue441 where
open import Common.Level
postulate
C : ∀ ℓ → Set ℓ → Set ℓ
I : ∀ a b (A : Set a) (B : Set b) → (A → B) → B → Set (a ⊔ b)
E : ∀ a b (A : Set a) → (A → Set b) → Set (a ⊔ b)
c : ∀ a (A : Set a) → ((B : A → Set a) → E a a A B) → C a A
foo : (∀ a b (A : Set a) (B : A → Set b) → E a b A B) →
∀ a b (A : Set a) (B : Set b) (f : A → B) x →
C (a ⊔ b) (I a b A B f x)
foo e a b A B f x = c _ _ (λ B′ → e _ _ _ _)
infix 4 _≡_
data _≡_ {a} {A : Set a} : A → A → Set a where
refl : ∀ x → x ≡ x
elim : ∀ {a p} {A : Set a} (P : {x y : A} → x ≡ y → Set p) →
(∀ x → P (refl x)) →
∀ {x y} (x≡y : x ≡ y) → P x≡y
elim P r (refl x) = r _
cong : ∀ {a b} {A : Set a} {B : Set b}
(f : A → B) {x y : A} → x ≡ y → f x ≡ f y
cong f (refl x) = refl (f x)
bar : ∀ {a} {A : Set a} {x y : A}
(x≡y : x ≡ y) (f : x ≡ y → x ≡ y) →
f x≡y ≡ f x≡y
bar = elim (λ {x} {y} x≡y → (f : x ≡ y → x ≡ y) → f x≡y ≡ f x≡y)
(λ x f → cong {a = _} {b = _} f (refl (refl x)))
|
applescript/nextTrack.applescript | SoloUnity/Alfred-Spotify-Commands | 15 | 2607 | <reponame>SoloUnity/Alfred-Spotify-Commands<filename>applescript/nextTrack.applescript
on alfred_script(q)
tell application "Spotify"
next track
end tell
end alfred_script |
oeis/307/A307695.asm | neoneye/loda-programs | 11 | 97997 | ; A307695: Expansion of 1/(sqrt(1-4*x)*sqrt(1-16*x)).
; Submitted by <NAME>(s4)
; 1,10,118,1540,21286,304300,4443580,65830600,985483270,14869654300,225759595348,3444812388280,52781007848284,811510465220920,12513859077134008,193460383702061200,2997463389599395270,46532910920993515900,723626591914643806180,11270311875128088314200,175774584776587378711156,2744837169439851058542760,42910860950881932644799688,671528551883719973901376240,10518901336068757620020903836,164911751959211894155909159000,2587490436980309762595393267400,40628028753312428974078725598000
mov $1,1
mov $2,$0
lpb $0
sub $0,1
mul $1,9
mov $3,$2
bin $3,$0
pow $3,2
add $1,$3
lpe
mov $0,$1
|
Micro/Tests/and/and.asm | JavierOramas/CP_AC | 0 | 91362 | addi r3 r0 -1
addi r1 r0 65
and r4 r3 r1
tty r4
halt
# prints A |
06_mem/practica6-insertar.adb | hbarrientosg/cs-mp | 0 | 3218 | separate(Practica6)
procedure Insertar(L: in out Lista; V: in Integer) is
Aux:pnodo;
begin
Aux := crear(V);
if L.Numelem = 0 then
L.inicio := aux;
l.fin := aux;
l.Numelem := 1;--inserto el primer elemento cuando la lista esta vacia
else
l.fin.siguiente := aux;
aux.anterior := L.Fin;
L.Fin := Aux;
l.Numelem := L.Numelem + 1;
--Aqui voy isertando al final de la lista
--el resto de los elementos
end if;
return;
end insertar;
|
org.alloytools.alloy.diff/misc/bankOneBranch.als | jringert/alloy-diff | 1 | 1719 | module bankOneBranch
sig Branch {}
sig Bank{
branches: one Branch
}
fact {
all b : Bank | one b.branches
} |
Transynther/x86/_processed/AVXALIGN/_zr_/i7-7700_9_0x48.log_21829_685.asm | ljhsiun2/medusa | 9 | 80909 | <reponame>ljhsiun2/medusa<filename>Transynther/x86/_processed/AVXALIGN/_zr_/i7-7700_9_0x48.log_21829_685.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r15
push %r9
push %rax
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_D_ht+0x1649b, %rdi
nop
xor $30233, %rbx
mov (%rdi), %rcx
xor $21359, %rdx
lea addresses_A_ht+0x131c3, %rax
nop
nop
nop
add %r9, %r9
mov (%rax), %rsi
nop
and %rdx, %rdx
lea addresses_D_ht+0x1c262, %rsi
nop
nop
nop
nop
cmp %rdi, %rdi
movb (%rsi), %bl
nop
nop
and %rbx, %rbx
lea addresses_A_ht+0x359b, %rbx
clflush (%rbx)
nop
nop
nop
xor %rcx, %rcx
mov $0x6162636465666768, %rdi
movq %rdi, %xmm3
vmovups %ymm3, (%rbx)
nop
nop
and %rdx, %rdx
lea addresses_normal_ht+0x1009b, %rsi
lea addresses_WC_ht+0x1689b, %rdi
nop
nop
nop
add $43620, %r15
mov $59, %rcx
rep movsw
nop
nop
nop
nop
nop
sub %rcx, %rcx
lea addresses_D_ht+0x1709b, %r15
nop
nop
nop
sub %r9, %r9
movups (%r15), %xmm3
vpextrq $0, %xmm3, %rax
nop
cmp %rax, %rax
lea addresses_D_ht+0xe173, %rsi
lea addresses_normal_ht+0x5f45, %rdi
nop
nop
nop
nop
and %rbx, %rbx
mov $46, %rcx
rep movsl
cmp $5858, %r15
lea addresses_UC_ht+0x1d09b, %r9
clflush (%r9)
sub $28811, %rdi
mov (%r9), %ebx
and $3618, %rdx
lea addresses_WC_ht+0xc97, %rcx
nop
nop
nop
sub $1737, %rdx
movl $0x61626364, (%rcx)
nop
sub $6351, %rbx
lea addresses_WT_ht+0x1bc9b, %rsi
nop
nop
and $58047, %rdi
movb (%rsi), %dl
dec %rdi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbx
pop %rax
pop %r9
pop %r15
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r13
push %r14
push %r9
push %rbp
push %rbx
push %rsi
// Load
mov $0x3abb8a0000000f3b, %r9
nop
nop
nop
nop
nop
xor %rbp, %rbp
mov (%r9), %esi
nop
nop
nop
xor %rsi, %rsi
// Store
lea addresses_RW+0x14e1b, %r11
nop
nop
nop
nop
cmp %r9, %r9
movb $0x51, (%r11)
nop
nop
nop
and $38620, %r13
// Store
mov $0xf9b, %r14
add $50051, %rbx
movb $0x51, (%r14)
nop
nop
nop
xor %r14, %r14
// Store
mov $0x32f3be0000000c9b, %r13
nop
nop
nop
nop
and $29439, %rbx
movb $0x51, (%r13)
nop
nop
nop
nop
nop
cmp $33129, %rbx
// Store
lea addresses_WT+0x1f103, %rbx
and %rbp, %rbp
mov $0x5152535455565758, %r11
movq %r11, (%rbx)
add %r14, %r14
// Store
lea addresses_D+0x1e08a, %r13
clflush (%r13)
nop
nop
nop
nop
nop
xor %rbp, %rbp
mov $0x5152535455565758, %rsi
movq %rsi, %xmm3
movups %xmm3, (%r13)
nop
nop
nop
nop
add %r13, %r13
// Load
lea addresses_UC+0xed37, %rbx
nop
nop
add $49177, %r14
vmovntdqa (%rbx), %ymm6
vextracti128 $0, %ymm6, %xmm6
vpextrq $1, %xmm6, %rsi
add $5361, %rbx
// Faulty Load
mov $0x746df6000000009b, %rbx
nop
nop
nop
nop
dec %r14
mov (%rbx), %r9d
lea oracles, %r14
and $0xff, %r9
shlq $12, %r9
mov (%r14,%r9,1), %r9
pop %rsi
pop %rbx
pop %rbp
pop %r9
pop %r14
pop %r13
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 0, 'size': 2, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 4, 'size': 4, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_RW', 'AVXalign': False, 'congruent': 6, 'size': 1, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_P', 'AVXalign': False, 'congruent': 8, 'size': 1, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 7, 'size': 1, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WT', 'AVXalign': False, 'congruent': 2, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_D', 'AVXalign': False, 'congruent': 0, 'size': 16, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_UC', 'AVXalign': False, 'congruent': 1, 'size': 32, 'same': False, 'NT': True}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_NC', 'AVXalign': True, 'congruent': 0, 'size': 4, 'same': True, 'NT': True}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'congruent': 10, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_A_ht', 'AVXalign': False, 'congruent': 3, 'size': 8, 'same': True, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'congruent': 0, 'size': 1, 'same': False, 'NT': True}}
{'OP': 'STOR', 'dst': {'type': 'addresses_A_ht', 'AVXalign': False, 'congruent': 8, 'size': 32, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_normal_ht', 'congruent': 8, 'same': False}, 'dst': {'type': 'addresses_WC_ht', 'congruent': 11, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'congruent': 11, 'size': 16, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_D_ht', 'congruent': 1, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 1, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_UC_ht', 'AVXalign': False, 'congruent': 11, 'size': 4, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WC_ht', 'AVXalign': False, 'congruent': 1, 'size': 4, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WT_ht', 'AVXalign': False, 'congruent': 10, 'size': 1, 'same': True, 'NT': False}}
{'00': 21829}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
oeis/145/A145423.asm | neoneye/loda-programs | 11 | 92234 | ; A145423: Decimal expansion of Sum_{n>=1} (-1)^(n-1)/(n^2-1/4)^2.
; Submitted by <NAME>
; 1,7,1,6,8,1,4,6,9,2,8,2,0,4,1,3,5,2,3,0,7,4,7,1,3,2,3,3,4,4,0,9,9,4,2,3,1,6,0,5,6,6,1,2,0,1,2,4,9,7,8,8,3,5,8,0,5,0,1,1,0,8,1,5,3,8,4,3,6,7,1,8,7,4,2,7,5,8,2,0,0,2,7,4,3,9,3,0,3,4,9,3,1,5,7,6,5,8,6,4
add $0,1
mov $2,1
mov $3,$0
mul $3,5
lpb $3
mul $1,$3
mov $5,$3
mul $5,2
add $5,3
mul $2,$5
add $1,$2
div $1,$0
div $2,$0
sub $3,1
lpe
mul $1,2
div $1,15
mov $4,10
pow $4,$0
div $2,$4
div $1,$2
mov $0,$1
mod $0,10
|
gcc-gcc-7_3_0-release/gcc/ada/s-valint.adb | best08618/asylo | 7 | 28167 | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ I N T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Unsigned_Types; use System.Unsigned_Types;
with System.Val_Uns; use System.Val_Uns;
with System.Val_Util; use System.Val_Util;
package body System.Val_Int is
------------------
-- Scan_Integer --
------------------
function Scan_Integer
(Str : String;
Ptr : not null access Integer;
Max : Integer) return Integer
is
Uval : Unsigned;
-- Unsigned result
Minus : Boolean := False;
-- Set to True if minus sign is present, otherwise to False
Start : Positive;
-- Saves location of first non-blank (not used in this case)
begin
Scan_Sign (Str, Ptr, Max, Minus, Start);
if Str (Ptr.all) not in '0' .. '9' then
Ptr.all := Start;
Bad_Value (Str);
end if;
Uval := Scan_Raw_Unsigned (Str, Ptr, Max);
-- Deal with overflow cases, and also with maximum negative number
if Uval > Unsigned (Integer'Last) then
if Minus and then Uval = Unsigned (-(Integer'First)) then
return Integer'First;
else
Bad_Value (Str);
end if;
-- Negative values
elsif Minus then
return -(Integer (Uval));
-- Positive values
else
return Integer (Uval);
end if;
end Scan_Integer;
-------------------
-- Value_Integer --
-------------------
function Value_Integer (Str : String) return Integer is
begin
-- We have to special case Str'Last = Positive'Last because the normal
-- circuit ends up setting P to Str'Last + 1 which is out of bounds. We
-- deal with this by converting to a subtype which fixes the bounds.
if Str'Last = Positive'Last then
declare
subtype NT is String (1 .. Str'Length);
begin
return Value_Integer (NT (Str));
end;
-- Normal case where Str'Last < Positive'Last
else
declare
V : Integer;
P : aliased Integer := Str'First;
begin
V := Scan_Integer (Str, P'Access, Str'Last);
Scan_Trailing_Blanks (Str, P);
return V;
end;
end if;
end Value_Integer;
end System.Val_Int;
|
programs/oeis/047/A047519.asm | neoneye/loda | 22 | 14015 | ; A047519: Numbers that are congruent to {1, 2, 3, 4, 6, 7} mod 8.
; 1,2,3,4,6,7,9,10,11,12,14,15,17,18,19,20,22,23,25,26,27,28,30,31,33,34,35,36,38,39,41,42,43,44,46,47,49,50,51,52,54,55,57,58,59,60,62,63,65,66,67,68,70,71,73,74,75,76,78,79,81,82,83,84,86,87,89,90,91,92,94,95,97,98,99,100,102,103,105,106,107,108,110,111,113,114,115,116,118,119,121,122,123,124,126,127,129,130,131,132
mov $1,$0
div $1,2
mul $1,2
div $1,3
add $0,$1
add $0,1
|
Fields/Lemmas.agda | Smaug123/agdaproofs | 4 | 2327 | <reponame>Smaug123/agdaproofs
{-# OPTIONS --safe --warning=error --without-K #-}
open import Setoids.Setoids
open import Rings.Definition
open import Groups.Definition
open import Fields.Fields
open import Sets.EquivalenceRelations
open import LogicalFormulae
open import Rings.IntegralDomains.Definition
open import Rings.IntegralDomains.Lemmas
open import Setoids.Subset
module Fields.Lemmas {m n : _} {A : Set m} {S : Setoid {m} {n} A} {_+_ : A → A → A} {_*_ : A → A → A} {R : Ring S _+_ _*_} (F : Field R) where
open Setoid S
open Field F
open Ring R
open Group additiveGroup
open Equivalence eq
open import Rings.Lemmas R
halve : (charNot2 : ((1R + 1R) ∼ 0R) → False) → (a : A) → Sg A (λ i → i + i ∼ a)
halve charNot2 a with allInvertible (1R + 1R) charNot2
... | 1/2 , pr1/2 = (a * 1/2) , transitive (+WellDefined *Commutative *Commutative) (transitive (symmetric (*DistributesOver+ {1/2} {a} {a})) (transitive (*WellDefined (reflexive) r) (transitive (*Associative) (transitive (*WellDefined pr1/2 (reflexive)) identIsIdent))))
where
r : a + a ∼ (1R + 1R) * a
r = symmetric (transitive *Commutative (transitive *DistributesOver+ (+WellDefined (transitive *Commutative identIsIdent) (transitive *Commutative identIsIdent))))
abstract
halfHalves : {x : A} (1/2 : A) (pr : 1/2 + 1/2 ∼ 1R) → (x + x) * 1/2 ∼ x
halfHalves {x} 1/2 pr = transitive (transitive (transitive *Commutative (transitive (transitive *DistributesOver+ (transitive (+WellDefined *Commutative *Commutative) (symmetric *DistributesOver+))) *Commutative)) (*WellDefined pr (reflexive))) identIsIdent
fieldIsIntDom : IntegralDomain R
IntegralDomain.intDom fieldIsIntDom {a} {b} ab=0 a!=0 with Field.allInvertible F a a!=0
IntegralDomain.intDom fieldIsIntDom {a} {b} ab=0 a!=0 | 1/a , prA = transitive (symmetric identIsIdent) (transitive (*WellDefined (symmetric prA) reflexive) (transitive (symmetric *Associative) (transitive (*WellDefined reflexive ab=0) (Ring.timesZero R))))
IntegralDomain.nontrivial fieldIsIntDom 1=0 = Field.nontrivial F (symmetric 1=0)
allInvertibleWellDefined : {a b : A} {a!=0 : (a ∼ 0F) → False} {b!=0 : (b ∼ 0F) → False} → (a ∼ b) → underlying (allInvertible a a!=0) ∼ underlying (allInvertible b b!=0)
allInvertibleWellDefined {a} {b} {a!=0} {b!=0} a=b with allInvertible a a!=0
... | x , prX with allInvertible b b!=0
... | y , prY with transitive (transitive prX (symmetric prY)) (*WellDefined reflexive (symmetric a=b))
... | xa=ya = cancelIntDom fieldIsIntDom (transitive *Commutative (transitive xa=ya *Commutative)) a!=0
private
mulNonzeros : Sg A (λ m → (Setoid._∼_ S m (Ring.0R R)) → False) → Sg A (λ m → (Setoid._∼_ S m (Ring.0R R)) → False) → Sg A (λ m → (Setoid._∼_ S m (Ring.0R R)) → False)
mulNonzeros (a , a!=0) (b , b!=0) = (a * b) , λ ab=0 → b!=0 (IntegralDomain.intDom (fieldIsIntDom) ab=0 a!=0)
fieldMultiplicativeGroup : Group (subsetSetoid S {pred = λ m → ((Setoid._∼_ S m (Ring.0R R)) → False)}(λ {x} {y} x=y x!=0 → λ y=0 → x!=0 (Equivalence.transitive (Setoid.eq S) x=y y=0))) (mulNonzeros)
Group.+WellDefined (fieldMultiplicativeGroup) {x , prX} {y , prY} {z , prZ} {w , prW} = Ring.*WellDefined R
Group.0G (fieldMultiplicativeGroup) = Ring.1R R , λ 1=0 → Field.nontrivial F (Equivalence.symmetric (Setoid.eq S) 1=0)
Group.inverse (fieldMultiplicativeGroup) (x , pr) with Field.allInvertible F x pr
... | 1/x , pr1/x = 1/x , λ 1/x=0 → Field.nontrivial F (Equivalence.transitive (Setoid.eq S) (Equivalence.symmetric (Setoid.eq S) (Equivalence.transitive (Setoid.eq S) (Ring.*WellDefined R 1/x=0 (Equivalence.reflexive (Setoid.eq S))) (Ring.timesZero' R))) pr1/x)
Group.+Associative (fieldMultiplicativeGroup) {x , prX} {y , prY} {z , prZ} = Ring.*Associative R
Group.identRight (fieldMultiplicativeGroup) {x , prX} = Ring.identIsIdent' R
Group.identLeft (fieldMultiplicativeGroup) {x , prX} = Ring.identIsIdent R
Group.invLeft (fieldMultiplicativeGroup) {x , prX} with Field.allInvertible F x prX
... | 1/x , pr1/x = pr1/x
Group.invRight (fieldMultiplicativeGroup) {x , prX} with Field.allInvertible F x prX
... | 1/x , pr1/x = Equivalence.transitive (Setoid.eq S) (Ring.*Commutative R) pr1/x
|
core/words/halt.asm | paulscottrobson/nextForth | 2 | 93989 | <reponame>paulscottrobson/nextForth
;
; Word: HALT
; Dictionary: ( - )
; Date: 1st February 2018
; Macro: No
; Notes:
;
__Halt00:
halt
jr __Halt00
|
45/qb/ir/ssaid.asm | minblock/msdos | 0 | 247681 | page 49,132
TITLE ssaid - Scan support for array id opcodes
;***
;ssaid.asm - Scan support for array id opcodes
;
; Copyright <C> 1986, Microsoft Corporation
;
;Purpose:
;
; This module contains the scanner dispatch routines for array id opcodes.
; These routines perform all tasks related to moving array id opcodes from
; SS_PARSER to SS_EXECUTE scan state.
;
; Scan routines for IdLd opcodes make a stack entry that describes the type
; and location of the id in the scanned pcode. The scan stack entry is
; created by:
;
; push oTx - emitted pcode address of byte following id
; (address at which coercion would be inserted)
; push oTyp - type of expression or ET_RC for records
;
; See scanner.inc for a complete definition of the id stack entry. The
; oTyp word contains flags that uniquely distinguish variable references,
; literals, and intermediate expression values.
;
; Routines named Ss_<name> are dispatched by a jmp. These routines
; all return to the scan loop by an indirect jmp through variable scanret.
;
;
;****************************************************************************
.xlist
include version.inc
SSAID_ASM = ON
IncludeOnce context
IncludeOnce executor
IncludeOnce opid
IncludeOnce pcode
IncludeOnce qbimsgs
IncludeOnce ssint
IncludeOnce txtmgr
IncludeOnce variable
.list
assumes ds, DATA
assumes es, NOTHING
assumes ss, DATA
sBegin SCAN
assumes cs, SCAN
subttl Ss_AIdLd
page
;***
;Ss_AId Scan Ld and St variants of array Id opcodes
;
;Purpose:
;
; Scan the id variants opAIdLd<type> and opAIdSt<type>.
;
; Functions are referenced using opAIdLd opcodes. The scanner must detect
; that the reference is a function reference from flags in the variable
; table entry.
;
; These routines expect only fundamental BASIC data types. User types are
; handled by opIdRf variants followed by OpIdOff opcodes.
;
;Parsed state opcode format:
;
; (Nexp,...) opAId<Ld|St><Imp|I2|I4|R4|R8|CY|SD|TX>(cnt,oVar)
;
; The expressions preceeding the opcode represent the indices whose
; count is given by the argument cnt.
;
;Algorithm:
;
; Calculate exe map table offset for data type from type in vt.
; Calculate exe map offset for <I|S|F|C> from oPrsCur and vt flags
; Load and emit executor
; Copy operand
; Coerce index arguments to I2.
; If this is a Ld variant then
; Push stack entry
; operand address + 2
; type (with variable reference bit set)
; Else
; Ensure the right side variable is of the correct type.
; Set $STATIC flag in the variable table (if this is 1st ref).
; Return to main loop
;
;Input:
;
; ax = executor map address
; bx = 2 * opcode
; es:di = pcode emission address
; es:si = pcode source address
;
;Output:
;
; si,di updated
;
;Modifies:
;Exceptions:
; Ss_Error
;******************************************************************
page
StRedirect:
mov ax,[bx].VAR_Value ;Value field has new oVar
mov PTRTX[si+2],ax ;Replace old one in pcode
jmp short AIdStRetry
SsProc AIdSt,Rude
.erre LOW OPCODE_MASK EQ 0ffh
test byte ptr es:[si-1],HIGH (NOT OPCODE_MASK)
jnz AIdStRetry
mov dx,scanOFFSET mpAStImpOpExe
AIdStRetry:
mov bx,[MrsCur.MRS_bdVar.BD_pb]
add bx,PTRTX[si+2]
DbChk pVar,bx ;Verify this is a variable
;Check flags to see if we're really doing a store
mov ax,[bx].VAR_flags ; Fetch flags
TestX ax,FVREDIRECT ;Test for redirected variable
jnz StRedirect ;Go fix the redirected case
TestX ax,FVFUN ;Test for function reference
jz @F
mov ax,ER_DD ;It is an error to store into a
call SsError ;function with arguments.
@@:
DbAssertTst [bx].VAR_flags,nz,FVARRAY+FVFUN,SCAN,<Ss_AIdSt: Non-Array>
call cDimsAndIndex ;Check cDims, index into executor map
;CX = scan stack oTyp of variable
jcxz NeedOtyp ;Is it a record?
HavOtyp:
call CoerceIndices ;Also restores DS if SizeD
assumes ds,DATA
xchg ax,cx ;AX = oTyp of target array
call EnsureArgType ;Pop stack frame test for coerce
jmp [ScanRet]
NeedOtyp:
mov cx,[bx].VAR_oTyp ;Get real oTyp for coercion
jmp HavOtyp
;*****************************************************************************
LdRedirect:
mov ax,[bx].VAR_Value ;Value field has new oVar
mov PTRTX[si+2],ax ;Replace old one in pcode
jmp short AIdLdRetry
SsProc AIdLd,Rude
.erre LOW OPCODE_MASK EQ 0ffh
test byte ptr es:[si-1],HIGH (NOT OPCODE_MASK)
jnz AIdLdRetry
mov dx,scanOFFSET mpALdImpOpExe
AIdLdRetry:
mov bx,[MrsCur.MRS_bdVar.BD_pb]
add bx,PTRTX[si+2]
DbChk pVar,bx ;Verify this is a variable
;Check flags to see if we're really doing a load
mov ax,[bx].VAR_flags ; Fetch flags
TestX ax,FVREDIRECT ;Test for redirected variable
jnz LdRedirect ;Go fix the redirected case
TestX ax,FVFUN ;Test for function reference
jnz ExecFunc ;This is a function
DbAssertTst [bx].VAR_flags,nz,FVARRAY,SCAN,<Ss_AIdLd: Non-Array>
call cDimsAndIndex ;Check cDims, index into executor map
call CoerceIndices ;Also restores DS if SizeD
assumes ds,DATA
or ch,HIGH ST_ArrVar ;Indicate this is a var reference
push di ;oTx for coercion insertion
push cx ;oTyp of array element or ET_RC
jmp [ScanRet]
ExecFunc:
mov cx,PTRTX[si] ;Get count of args
jmp SsCallFunc
subttl Subroutines for <AId|Id><|Off><Ld|St>
page
;cDimsAndIndex
;
; Used by AId<Ld|St>
; Check count of indices, then fall into SsIndexType
;
;Inputs:
;
; dx = base of executor map
; ds:bx = pVar
; es:si = pointer to first operand (cDims)
;
;Exceptions:
;
; Generate MSG_SubCnt if incorrect number of dimensions
; Undefined Array if first ref as whole array
FirstReference:
;It's ok to be undefined if this is a ReDim
cmp PTRTX[si+4],opStReDimTo
je ArIndexType
;For QB4 this is the first ref to a previously undefined array.
;Lets treat this as an implicit dim. However, it is an error if
;this is a whole array ref.
jcxz ArrayNotDefined ; Brif whole array reference
test byte ptr [bx].VAR_fStat,FV_STATIC ; Is this $Static
jz ArrayNotDefined
cmp [bx].ASTAT_ad.FHD_hData,0 ;Allocated already?
jne ArrayCmpCDims ;Brif yes. Bypass allocation.
cmp [SsErr],0 ; Have any errors occured?
jne ArrayCmpCDims ; Brif yes. Bypass allocation.
push cx ;Save CX = cDims
push dx ;Save DX = Executor map
mov [SsScanExStart],1 ;Indicate implicit Dim
push ax ;Dummy parameter
push ax ;Dummy parameter
call ExecuteFromScan ;Allocate array. AX = RT error code.
pop dx ;Restore DX = Executor map
pop cx ;Restore CX = cDims
mov bx,[MrsCur.MRS_bdVar.BD_pb]
add bx,PTRTX[si+2] ;BX = pVar
or ax,ax ;Was there an error?
jnz ArrayError ;Brif error code <> 0
jmp short ArrayCmpCDims
ArrayNotDefined:
mov ax,ER_UA ; Array not defined
ArrayError:
call SsError
jmp short ArIndexType
cDimsAndIndex:
mov cx,PTRTX[si] ; Get actual cDims
and ch,7fh ; Clear MSB which indicates no ()
mov [f_StaticCalc],TRUE ;$Static array if this is first ref
;There is a problem with ReDim where the FV_STATIC bit is being set
;when the first array reference is a ReDim with constant indices.
;This causes the SetArrayType call in Ss_ReDim to complain about
;ReDim of a $Static array. The resetting of f_StaticCalc is a
;solution. For EB, this is done above as a default. For QB4, implicit
;arrays are $Static and only if this is a ReDim is $Dynamic selected.
cmp PTRTX[si+4],opStReDimTo
jne @F
shr cx,1 ; AIdLd in ReDim has cDims * 2
mov [f_StaticCalc],FALSE;Dynamic array if this is first ref
@@:
call SetArrayType ;CY set if first ref
jc FirstReference ; Brif this is first reference
jcxz ArIndexType ; Whole array ref. Bypass cDim chk.
ArrayCmpCDims:
DbAssertRelB ch,e,0,SCAN,<cDimsAndIndex: cDims GT 255>
mov ax,MSG_SubCnt
cmp cl,[bx].VAR_value.ASTAT_cDims ;Cmp cDims from variable table
jne ArrayError ;Correct no. of indices?
ArIndexType:
;Look for special case of integer array with 1 dimension
dec cx ; One dimension?
jnz SsIndexType ;brif no
mov ax,[bx].VAR_flags ; Fetch flags
TestX ax,FVCOMMON+FVFORMAL ;Don't optimize these
jnz SsIndexType
and ax,FV_TYP_MASK ;Mask flags down to oTyp
.erre ET_I2 EQ 1
dec ax ; I2?
jnz SsIndexType ;Brif no, only optimize I2s
add dx,A1SOffset ;Point to optimized executors
;Note: The constant A1SOffset represents the distance between the
;executor map for static arrays and the map for one dimension
;static arrays. If this is a frame array we are optimizing, the
;map address must be adjusted again to account for the different
;seperation.
TestM [bx].VAR_flags,FVVALUESTORED
jnz SsIndexType ;Pointing to correct executor map
add dx,FrameOffset+A1FrameOffset ;Correct for later ISFC calc.
; fall into SsIndexType
;SsIndexType
;
; Used by all <AId|Id|Off><Ld|St>
; Compute index into executor map based on type
; Executor map is organized as follows:
; Record
; I2
; I4
; R4 Only if R4s enabled (FV_R4)
; R8
; CY Only if currency enabled (FV_CURRENCY)
; SD
; TX Only if text enabled (FV_TEXT)
; FS
; FT Only if text enabled (FV_TEXT)
;Inputs:
; ds:bx = pVar
; cs:dx = base of executor map
;Outputs:
; cx = Scan stack type
; cs:dx = modified executor map address
;Preserves:
; ax,bx
public SsIndexType,SsIndexTypeCx
SsIndexType:
mov cl,[bx].VAR_flags
and cx,FV_TYP_MASK ;CX = oTyp
SsIndexTypeCx:
cmp cx,ET_MAX ;Record type?
jbe StdType
.errnz ET_RC
xor cx,cx ;Replace oType with ET_RC
StdType:
jb IndexType
mov [SsOtxHeapMove],di ;FS/FT can cause heap movement
IndexType:
;Calculate offset due to type (cx)
add dx,cx
add dx,cx ;One word per type in table
ret
;CoerceIndices
;
; Used by AId<Ld|St>
; Calls SsIndexISFC, copies oVar, then coerces array indices
;
;Inputs:
;
; dx = current executor map address
;
;Preserves:
;
; cx
CoerceIndices:
call SsIndexISFC ;Locate executor, emit and copy cDims
MOVSWTX ;Copy oVar
;Coerce array indices
pop [SsCbParmCur] ;Get return address out of the way
mov bx,cx ;Preserve cx in bx
mov cx,PTRTX[di-4] ;count of indices
and ch,7fh ;clear MSB when no parens listed
mov ax,ET_I2 ;Target type for indices
call SsCoerceN ;Coerce indices to I2
mov cx,bx
jmp [SsCbParmCur] ;Return to caller
;SsIndexISFC
;
; Used by <AId|Id><Ld|St>
; Call SsGetISFC to index into executor map, then fetches and emits
; executor and one operand
;Inputs:
; bx = pVar
; dx = current executor map address
;Preserves
; cx
public SsIndexISFC ;Restores DS if necessary
SsIndexISFC:
push cx
call SsGetISFC ;Calculate <I|S|F|C> offset from
; bx (MSV flags) and oPrsCur
;Offset returned as modified dx
pop cx
;SsEmitExecutor
;
; Called by Off<Ld|St>, fallen into by all others
; Fetches executor from map, emits and copies one operand
;
;Inputs:
;
; dx = current executor map address
;
;Preserves:
;
; cx
public SsEmitExecutor
SsEmitExecutor:
mov bx,dx
mov ax,WORD PTR cs:[bx] ;Load executor
STOSWTX ;Emit the executor
MOVSWTX ;Copy the operand
ret
subttl Executor map for AIdLd variants
page
;Table mpALdImpOpExe is a list of AIdLdImp executors. The list is ordered
;as follows:
; exAId<I|E><I|S|F|C>Ld<type>
;After the Ld executors is Rf excutors for numeric types only.
;
;This table is then followed by AIdLdExp executors.
;Type "0" is used by record executors (implicits only).
;Optimized 1-dimension load
mpA1IdISLd equ $ - 2
DWEXT exA1IdISLdI2
;Additional types may be added here
mpA1IdIFLd equ $ - 2
DWEXT exA1IdIFLdI2
A1FrameOffset = mpA1IdIFLd - mpA1IdISLd
;Note: The following word fills space used by MakeRef
;before the explicit map to find the implicit map.
DW 0
public mpALdImpOpExe
mpALdImpOpExe label word
A1SOffset = mpA1IdISLd - $
mpAIdISLd label word
DWEXT exAIdISRf
DWEXT exAIdISLd2
DWEXT exAIdISLd4
DWEXT exAIdISLdR4
DWEXT exAIdISLdR8
DWEXT exAIdISRfSD
DWEXT exAIdISLdFS
cbContext = $ - mpAIdISLd
mpAIdICLd label word
DWEXT exAIdICRf
DWEXT exAIdICLd2
DWEXT exAIdICLd4
DWEXT exAIdICLdR4
DWEXT exAIdICLdR8
DWEXT exAIdICRfSD
DWEXT exAIdICLdFS
.erre cbContext EQ ($-mpAIdICLd)
mpAIdIILd label word
DWEXT exAIdIIRf
DWEXT exAIdIILd2
DWEXT exAIdIILd4
DWEXT exAIdIILdR4
DWEXT exAIdIILdR8
DWEXT exAIdIIRfSD
DWEXT exAIdIILdFS
.erre cbContext EQ ($-mpAIdIILd)
FrameOffset = mpAIdISLd - $
mpAIdIFLd label word
DWEXT exAIdIFRf
DWEXT exAIdIFLd2
DWEXT exAIdIFLd4
DWEXT exAIdIFLdR4
DWEXT exAIdIFLdR8
DWEXT exAIdIFRfSD
DWEXT exAIdIFLdFS
.erre cbContext EQ ($-mpAIdIFLd)
;AIdRfImp executor map
mpAIdIRf label word
mpAIdISRf equ $-2
DWEXT exAIdISRf
DWEXT exAIdISRf
DWEXT exAIdISRf
DWEXT exAIdISRf
DWEXT exAIdISRfSD
DWEXT exAIdISRfFS
.erre cbContext EQ ($-mpAIdISRf)
mpAIdICRf equ $-2
DWEXT exAIdICRf
DWEXT exAIdICRf
DWEXT exAIdICRf
DWEXT exAIdICRf
DWEXT exAIdICRfSD
DWEXT exAIdICRfFS
.erre cbContext EQ ($-mpAIdICRf)
mpAIdIIRf equ $-2
DWEXT exAIdIIRf
DWEXT exAIdIIRf
DWEXT exAIdIIRf
DWEXT exAIdIIRf
DWEXT exAIdIIRfSD
DWEXT exAIdIIRfFS
.erre cbContext EQ ($-mpAIdIIRf)
mpAIdIFRf equ $-2
DWEXT exAIdIFRf
DWEXT exAIdIFRf
DWEXT exAIdIFRf
DWEXT exAIdIFRf
DWEXT exAIdIFRfSD
DWEXT exAIdIFRfFS
.erre cbContext EQ ($-mpAIdIFRf)
;Function call executors
DWFILL
DWEXT exFuncNArgImp
DWEXT exFuncNArgImp
DWEXT exFuncNArgImp
DWEXT exFuncNArgImp
DWEXT exFuncNArgImp
;Optimized 1-dimension load
mpA1IdESLd equ $ - 2
DWEXT exA1IdESLdI2
mpA1IdEFLd equ $ - 2
DWEXT exA1IdEFLdI2
.erre A1FrameOffset EQ (mpA1IdEFLd - mpA1IdESLd)
;Note: The following word is used by MakeRef to
;find the implicit map from the explicit map.
DW mpALdImpOpExe
public mpALdExpOpExe
mpALdExpOpExe label word
.erre A1SOffset EQ (mpA1IdESLd - $)
mpAIdESLd label word
DWFILL
DWEXT exAIdESLdI2
DWEXT exAIdESLdI4
DWEXT exAIdESLdR4
DWEXT exAIdESLdR8
DWEXT exAIdESRfSD
DWEXT exAIdESLdFS
.erre cbContext EQ ($-mpAIdESLd)
mpAIdECLd label word
DWFILL
DWEXT exAIdECLdI2
DWEXT exAIdECLdI4
DWEXT exAIdECLdR4
DWEXT exAIdECLdR8
DWEXT exAIdECRfSD
DWEXT exAIdECLdFS
.erre cbContext EQ ($-mpAIdECLd)
mpAIdEILd label word
DWFILL
DWEXT exAIdEILdI2
DWEXT exAIdEILdI4
DWEXT exAIdEILdR4
DWEXT exAIdEILdR8
DWEXT exAIdEIRfSD
DWEXT exAIdEILdFS
.erre cbContext EQ ($-mpAIdEILd)
.erre FrameOffset EQ (mpAIdESLd - $)
mpAIdEFLd label word
DWFILL
DWEXT exAIdEFLdI2
DWEXT exAIdEFLdI4
DWEXT exAIdEFLdR4
DWEXT exAIdEFLdR8
DWEXT exAIdEFRfSD
DWEXT exAIdEFLdFS
.erre cbContext EQ ($-mpAIdEFLd)
;AIdRfExp executor map
mpAIdESRf equ $-2
DWEXT exAIdESRfI2
DWEXT exAIdESRfI4
DWEXT exAIdESRfR4
DWEXT exAIdESRfR8
DWEXT exAIdESRfSD
DWEXT exAIdESRfFS
.erre cbContext EQ ($-mpAIdESRf)
mpAIdECRf equ $-2
DWEXT exAIdECRfI2
DWEXT exAIdECRfI4
DWEXT exAIdECRfR4
DWEXT exAIdECRfR8
DWEXT exAIdECRfSD
DWEXT exAIdECRfFS
.erre cbContext EQ ($-mpAIdECRf)
mpAIdEIRf equ $-2
DWEXT exAIdEIRfI2
DWEXT exAIdEIRfI4
DWEXT exAIdEIRfR4
DWEXT exAIdEIRfR8
DWEXT exAIdEIRfSD
DWEXT exAIdEIRfFS
.erre cbContext EQ ($-mpAIdEIRf)
mpAIdEFRf equ $-2
DWEXT exAIdEFRfI2
DWEXT exAIdEFRfI4
DWEXT exAIdEFRfR4
DWEXT exAIdEFRfR8
DWEXT exAIdEFRfSD
DWEXT exAIdEFRfFS
.erre cbContext EQ ($-mpAIdEFRf)
;Function call executors
DWFILL
DWEXT exFuncNArgI2
DWEXT exFuncNArgI4
DWEXT exFuncNArgR4
DWEXT exFuncNArgR8
DWEXT exFuncNArgSD
;Table mpAStImpOpExe is a list of AIdStImp executors. The list is ordered
;as follows:
; exAId<I|E><I|S|F|C>St<type>
;This table is then followed by AIdStExp executors.
;Type "0" entries are used for record executors (implicit types only).
;Optimized 1-dimension store
mpA1IdISSt equ $ - 2
DWEXT exA1IdISStI2
mpA1IdIFSt equ $ - 2
DWEXT exA1IdIFStI2
.erre A1FrameOffset EQ (mpA1IdIFSt - mpA1IdISSt)
;Note: The following word fills space used by MakeRef
;before the explicit map to find the implicit map.
DW 0
public mpAStImpOpExe
mpAStImpOpExe label word
.erre A1SOffset EQ (mpA1IdISSt - $)
mpAIdISSt label word
DWEXT exAIdISStTyp
DWEXT exAIdISSt2
DWEXT exAIdISSt4
DWEXT exAIdISStR4
DWEXT exAIdISStR8
DWEXT exAIdISStSD
DWEXT exAIdISStFS
.erre cbContext EQ ($-mpAIdISSt)
mpAIdICSt label word
DWEXT exAIdICStTyp
DWEXT exAIdICSt2
DWEXT exAIdICSt4
DWEXT exAIdICStR4
DWEXT exAIdICStR8
DWEXT exAIdICStSD
DWEXT exAIdICStFS
.erre cbContext EQ ($-mpAIdICSt)
mpAIdIISt label word
DWEXT exAIdIIStTyp
DWEXT exAIdIISt2
DWEXT exAIdIISt4
DWEXT exAIdIIStR4
DWEXT exAIdIIStR8
DWEXT exAIdIIStSD
DWEXT exAIdIIStFS
.erre cbContext EQ ($-mpAIdIISt)
.erre FrameOffset EQ (mpAIdISSt - $)
mpAIdIFSt label word
DWEXT exAIdIFStTyp
DWEXT exAIdIFSt2
DWEXT exAIdIFSt4
DWEXT exAIdIFStR4
DWEXT exAIdIFStR8
DWEXT exAIdIFStSD
DWEXT exAIdIFStFS
.erre cbContext EQ ($-mpAIdIFSt)
;Optimized 1-dimension store
mpA1IdESSt equ $ - 2
DWEXT exA1IdESStI2
mpA1IdEFSt equ $ - 2
DWEXT exA1IdEFStI2
.erre A1FrameOffset EQ (mpA1IdEFSt - mpA1IdESSt)
;Note: The following word fills space used by MakeRef
;before the explicit map to find the implicit map.
DW 0
public mpAStExpOpExe
mpAStExpOpExe label word
.erre A1SOffset EQ (mpA1IdESSt - $)
mpAIdESSt label word
DWFILL
DWEXT exAIdESStI2
DWEXT exAIdESStI4
DWEXT exAIdESStR4
DWEXT exAIdESStR8
DWEXT exAIdESStSD
DWEXT exAIdESStFS
.erre cbContext EQ ($-mpAIdESSt)
mpAIdECSt label word
DWFILL
DWEXT exAIdECStI2
DWEXT exAIdECStI4
DWEXT exAIdECStR4
DWEXT exAIdECStR8
DWEXT exAIdECStSD
DWEXT exAIdECStFS
.erre cbContext EQ ($-mpAIdECSt)
mpAIdEISt label word
DWFILL
DWEXT exAIdEIStI2
DWEXT exAIdEIStI4
DWEXT exAIdEIStR4
DWEXT exAIdEIStR8
DWEXT exAIdEIStSD
DWEXT exAIdEIStFS
.erre cbContext EQ ($-mpAIdEISt)
.erre FrameOffset EQ (mpAIdESSt - $)
mpAIdEFSt label word
DWFILL
DWEXT exAIdEFStI2
DWEXT exAIdEFStI4
DWEXT exAIdEFStR4
DWEXT exAIdEFStR8
DWEXT exAIdEFStSD
DWEXT exAIdEFStFS
.erre cbContext EQ ($-mpAIdEFSt)
;AdRf executor map
public mpAdRf
mpAdRf label word
DWEXT exAdRfImp
DWEXT exAdRfI2
DWEXT exAdRfI4
DWEXT exAdRfR4
DWEXT exAdRfR8
DWEXT exAdRfSD
page
;***
;MakeArrayRef
;
;Purpose:
;
; This procedure converts an exAIdLd with cArgs == 0 to an exAdRf.
;
;Input:
;
; BX = oTx from scan stack of pointer after exAIdLd
;
;Output:
;
; standard exit
;
;Preserves
;
; BX, CX, DX
;
;***************************************************************************
public MakeArrayRef
MakeArrayRef proc
mov ax,PTRTX[bx-6] ;AX = exAIdLd executor
xchg ax,bx ;AX = oTx, BX = executor
GetCodeIntoDs SCAN
mov bl,byte ptr [bx-1] ;Get HIGH byte of opcode
push ss
pop ds
.erre OPCODE_MASK EQ 03ffh
; and bx,HIGH (NOT OPCODE_MASK)
and bx,0FCh ;Mask off garbage leaving oTyp * 4
shr bx,1 ;Convert to word offset
mov bx,mpAdRf[bx] ;BX = AdRf executor
xchg ax,bx ;AX = executor, BX = oTx
mov PTRTX[bx-6],ax
ret
MakeArrayRef endp
page
;***
;Ss_Erase
;
;Purpose:
;
; Scan Erase statement.
;
; AIdLd scanning has left a stack entry consisting of:
; oType
; oTx of point after AIdLd
;
;Parsed state opcode format:
;
; (AIdLd,...) opStErase(cnt)
;
; The cnt argument represents the number of preceeding AIdLd opcodes
; each of which will have left an entry on the stack.
;
;Input:
;
; opStErase operand has count of AIdLd arguments.
;
;Output:
;
; standard exit
;
;***************************************************************************
SsProc Erase
STOSWTX ;Emit executor
LODSWTX ;Load operand count
STOSWTX ;And emit it
xchg cx,ax ;CX = operand count
EraseLoop:
pop bx ;Discard oType
pop bx ;BX = oTx after exAIdLd
call MakeArrayRef ;Convert to exAdRf
loop EraseLoop ;Go process next array
jmp [ScanRet] ; and back to the main loop
page
;***
;Ss_LUbound - scan LBOUND and UBOUND
;
;Purpose:
;
; Scan opFn<L|U>bound<1|2>
;
; Scan stack contains:
; I2 (for op<L|U>Bound2 case)
; AIdLd entry:
; oType
; oTx of point after AIdLd (location of exFn<L|U>Bound<1|2>)
;
;Parsed state opcode format:
;
; (AIdLd) opFn<L|U>bound1
; (AIdLd,Nexp) opFn<L|U>bound2
;
;Input:
;
; standard entry
;
;Output:
;
; standard exit
;
;***************************************************************************
SsProc LUBound2
mov ax,ET_I2 ;Index must be I2
call EnsureArgType ;Perform the coercion as required
xchg ax,dx
SKIP2_PSW ; Skip over descan routine address
SsProc LUBound1
STOSWTX
pop bx ;Discard oType
pop bx ;BX = oTx after exAIdLd
push di ;Push oTx of result for coercion
PushI ax,ET_I2 ;Push oTyp of result. Always I2
FixNoDimArray:
call MakeArrayRef ;Convert to exAdRf
jmp [ScanRet] ; and back to the main loop
page
;***
;Ss_GPutGet,PaletteUsing
;
;Purpose:
;
; Scan graphics PUT, GET and PALETTE USING
;
;Parsed state opcode format:
;
; (I2exp,...,AIdLd) opStPalletteUsing
; (I2exp,...,AIdLd) opStGraphicsGet
; (I2exp,...,AIdLd) opStGraphicsPut(function)
;
;Input:
;
; standard entry
;
;Output:
;
; standard exit
;
;***************************************************************************
SsProc PaletteUsing
mov dl,ET_I4 ;Max type for PALETTE USING
jmp short PutGetUsing
SsProc GPutGet
mov dl,ET_MaxNum ; Max type for PUT/GET
PutGetUsing:
call EmitExCopyOps ;Emit executor, copy operands for PUT
pop cx ; Get oTyp
or cl,cl
jz TMErr ;If not simple type, always wrong
cmp cl,dl ;Test for valid array type (numeric)
jbe PutGetX
TMErr:
mov ax,ER_TM ;Type mismatch error
call SsError
PutGetX:
pop bx ;BX = oTx of insertion point
cmp byte ptr es:[bx-4],0 ;Is cDims == 0
je FixNoDimArray ;Brif yes, convert to AdRf
xchg ax,cx ;AX = oTyp w/Flags
call MakeRef ;AX = AIdRf executor
mov PTRTX[bx-6],ax ;Update emitted code
jmp [ScanRet] ; and back to the main loop
sEnd SCAN
end
|
oeis/339/A339686.asm | neoneye/loda-programs | 11 | 27062 | ; A339686: a(n) = Sum_{d|n} 6^(d-1).
; Submitted by <NAME>(s4)
; 1,7,37,223,1297,7819,46657,280159,1679653,10078999,60466177,362805091,2176782337,13060740679,78364165429,470185264735,2821109907457,16926661132171,101559956668417,609359750089711,3656158440109669,21936950700844039,131621703842267137,789730223416687843,4738381338321618193,28430288032106483719,170581728179579887909,1023490369090529990431,6140942214464815497217,36845653286867267234203,221073919720733357899777,1326443518324870332663391,7958661109946400944858149,47751966659681226416259079
add $0,1
mov $2,$0
lpb $0
mul $1,6
mov $3,$2
dif $3,$0
trn $0,2
add $0,1
cmp $3,$2
cmp $3,0
add $1,$3
lpe
mov $0,$1
mul $0,6
add $0,1
|
Utils/vdp.asm | SavagePencil/SMSFramework | 0 | 162695 | .IFNDEF __VDP_ASM__
.DEFINE __VDP_ASM__
.include "Utils/vdpregisters.asm"
.DEFINE VDP_VCOUNTER_PORT $7E
.DEFINE VDP_HCOUNTER_PORT $7F
.DEFINE VDP_DATA_PORT $BE
.DEFINE VDP_CONTROL_PORT $BF
.DEFINE VDP_COMMAND_MASK_VRAM_READ 0 << 6
.DEFINE VDP_COMMAND_MASK_VRAM_WRITE 1 << 6
.DEFINE VDP_COMMAND_MASK_REGISTER_WRITE 2 << 6
.DEFINE VDP_COMMAND_MASK_CRAM_WRITE 3 << 6
.DEFINE VDP_COMMMAND_MASK_REGISTER0 0
.DEFINE VDP_COMMMAND_MASK_REGISTER1 1
.DEFINE VDP_COMMMAND_MASK_REGISTER2 2
.DEFINE VDP_COMMMAND_MASK_REGISTER3 3
.DEFINE VDP_COMMMAND_MASK_REGISTER4 4
.DEFINE VDP_COMMMAND_MASK_REGISTER5 5
.DEFINE VDP_COMMMAND_MASK_REGISTER6 6
.DEFINE VDP_COMMMAND_MASK_REGISTER7 7
.DEFINE VDP_COMMMAND_MASK_REGISTER8 8
.DEFINE VDP_COMMMAND_MASK_REGISTER9 9
.DEFINE VDP_COMMMAND_MASK_REGISTER10 $A
.DEFINE VDP_STATUS_PORT $BF
.DEFINE VDP_STATUS_FRAME_INTERRUPT_MASK $80 ; Did a frame interrupt occur?
.DEFINE VDP_STATUS_SPRITE_OVERFLOW_MASK $40 ; > 8 sprites on a line?
.DEFINE VDP_STATUS_SPRITE_COLLISION_MASK $20 ; Did any sprites' non-opaque pixels overlap?
.DEFINE VDP_PATTERN_TABLE_START $0000 ; Constant
.DEFINE VDP_PATTERN_TABLE_SIZE $3800 ; Constant
.DEFINE VDP_NAMETABLE_SIZE $0700 ; 1792 bytes
.DEFINE VDP_SAT_SIZE $0100 ; Includes the gap
.DEFINE VDP_SAT_UNUSED_GAP_LOC VDP_SAT_START_LOC + $0040
.DEFINE VDP_SAT_UNUSED_GAP_SIZE $40 ; 64 bytes
.DEFINE VDP_SAT_SECOND_HALF_LOC VDP_SAT_START_LOC + $0080
.DEFINE VDP_SAT_SECOND_HALF_SIZE $80 ; 128 bytes
.DEFINE VDP_PALETTE_NUM_PALETTES 2 ; BG & Sprite
.DEFINE VDP_PALETTE_ENTRIES_PER_PALETTE 16
.DEFINE VDP_PALETTE_BYTES_PER_ENTRY 1 ; --BBGGRR
.DEFINE VDP_PALETTE_BG_PALETTE_INDEX 0 ; BG palettes go first
.DEFINE VDP_PALETTE_SPRITE_PALETTE_INDEX 16 ; ...then sprite
.DEFINE VDP_PALETTE_BLUE_SHIFT 4 ; --BB ----
.DEFINE VDP_PALETTE_BLUE_MASK 3 << VDP_PALETTE_BLUE_SHIFT
.DEFINE VDP_PALETTE_GREEN_SHIFT 2 ; ---- GG--
.DEFINE VDP_PALETTE_GREEN_MASK 3 << VDP_PALETTE_GREEN_SHIFT
.DEFINE VDP_PALETTE_RED_SHIFT 0 ; ---- --RR
.DEFINE VDP_PALETTE_RED_MASK 3 << VDP_PALETTE_RED_SHIFT
.DEFINE VDP_TILE_PIXEL_WIDTH 8
.DEFINE VDP_TILE_PIXEL_HEIGHT 8
.DEFINE VDP_TILE_SIZE 32 ; 8*8 * 4bpp = 32 bytes
.DEFINE VDP_TILE_BITPLANES 4
.DEFINE VDP_TILE_LSB 0 ; Bit plane 0
.DEFINE VDP_TILE_MSB 3 ; Bit plane 3
.DEFINE VDP_NAMETABLE_NUMCOLS 32
.DEFINE VDP_NAMETABLE_NUMROWS 28
.DEFINE VDP_NAMETABLE_NUMVISIBLEROWS 24
.DEFINE VDP_NAMETABLE_ENTRY_BANKSELECT_SHIFT 0
.DEFINE VDP_NAMETABLE_ENTRY_USE_HIGH_BANK 1 << VDP_NAMETABLE_ENTRY_BANKSELECT_SHIFT
.DEFINE VDP_NAMETABLE_ENTRY_HFLIP_SHIFT 1
.DEFINE VDP_NAMETABLE_ENTRY_HFLIP 1 << VDP_NAMETABLE_ENTRY_HFLIP_SHIFT
.DEFINE VDP_NAMETABLE_ENTRY_VFLIP_SHIFT 2
.DEFINE VDP_NAMETABLE_ENTRY_VFLIP 1 << VDP_NAMETABLE_ENTRY_VFLIP_SHIFT
.DEFINE VDP_NAMETABLE_ENTRY_PALSELECT_SHIFT 3
.DEFINE VDP_NAMETABLE_ENTRY_USE_SPRITE_PAL 1 << VDP_NAMETABLE_ENTRY_PALSELECT_SHIFT
.DEFINE VDP_NAMETABLE_ENTRY_PRIORITYSELECT_SHIFT 4
.DEFINE VDP_NAMETABLE_ENTRY_BGPRIORITY 1 << VDP_NAMETABLE_ENTRY_PRIORITYSELECT_SHIFT
.DEFINE VDP_NAMETABLE_USERBITS_SHIFT 5
.DEFINE VDP_NAMETABLE_USERBITS_MASK 7 << VDP_NAMETABLE_USERBITS_SHIFT
.DEFINE VDP_SAT_MAX_SPRITES 64
.DEFINE VDP_SAT_YTABLE_OFFSET 0 ; Y entries go first
.DEFINE VDP_SAT_XTABLE_OFFSET $80 ; X entries start after a gap
.DEFINE VDP_SAT_TILETABLE_OFFSET $81 ; Tile values follow the X
.DEFINE VDP_SAT_STOP_SPRITES_YVALUE $D0 ; A magic value indicating "no more sprites"
;==============================================================================
; VDP Memory Summary:
; * The Palette lives in CRAM. The VDP has 32 entries for palette entries.
; This is stored in separate write-only CRAM memory.
; It has the following layout:
; + SMS: 1 byte per entry: --BBGGRR. 6 bits per entry.
; + GG: 2 bytes per entry: ----BBBB GGGGRRRR. 12 bits per entry.
; There are two palettes of 16 entries each:
; + Entries 0..15 cannot be used by Sprites, only the BG.
; + Entries 16..31 can be used by either Sprites or the BG.
; * The VDP has 16K (0x4000) of VRAM that is shared by the following:
; + The Sprite Attribute Table (SAT): 256 bytes (ish)
; + The Name Table (usually a 32x28 screen map): 1792 bytes
; + The Pattern Table (~448 tiles, 32 bytes each): 14336 bytes
; * The Sprite Attribute Table (SAT) is in VRAM and holds data for 64 sprites.
; It can be located at any 256-byte boundary (e.g., $0000, $0100, etc.).
; It contains the following data for each sprite:
; + The Y position (1 byte)
; + The X position (1 byte)
; + The Tile Index (1 byte)
; ...it holds them in a block of 256 bytes, with a gap of 64 unused bytes
; in the middle:
; Byte Offset Meaning
; 0x00 Sprite #0 Y pos
; 0x01 Sprite #1 Y pos
; .
; .
; 0x3F Sprite #63 Y pos
; 0x40 <Unused>
; .
; .
; 0x7F <End of unused section>
; 0x80 Sprite #0 X pos
; 0x81 Sprite #0 Tile Index
; 0x82 Sprite #1 X pos
; 0x83 Sprite #1 Tile Index
; .
; .
; 0xFE Sprite #63 X Pos
; 0xFF Sprite #63 Tile Index
; * The Name Table lives in VRAM and holds data for the background. This is
; usually a 32x28 grid of tiles, with only 32x24 tiles visibile at any
; given time.
; For the standard 256x192 resolution mode, it can be located at any
; 2K-byte boundary (e.g., 0x0800, 0x1000, etc.).
; Each cell is 2 bytes. 32x28x2 bytes = 1792 bytes.
; It contains the following data for each cell of the grid:
; + Bits 0-8: Index of tile to use (0..512) from the Pattern Table
; + Bit 9: Horizontally flip the tile?
; + Bit 10: Vertically flip the tile?
; + Bit 11: Should this use the BG palette, or the Sprite palette?
; + Bit 12: Should this tile be in front of, or behind Sprites?
; + Bits 13-15: Unused.
; * The Pattern Table lives in VRAM and holds the tile data.
; In theory, it could hold 512 tiles worth of data, but because of the
; SAT and the Name Table, this is reduced to 448 tiles. Each tile is
; 32 bytes (8 pixels wide x 8 pixels tall x 4 bits per pixel).
; We get a final size of (32 bytes x 512 tiles) - (SAT + Name Table) or
; 16384 - (256 + 1792) = 14336 bytes.
; The Pattern Table MUST begin at 0x0000 in VRAM.
; Patterns are 4 planes of 8 bits each, and look like this:
; + Bits 0..7: Least-significant bits of palette entry, right-to-left
; + Bits 8..15: Bit 1 of each pixel's palette entry.
; + Bits 16..23: Bit 2 of each pixel's palette entry.
; + Bits 24..31: Bit 3 of each pixel's palette entry.
;==============================================================================
;==============================================================================
; Tiles are 4bpp arranged in bitplanes, like so:
;
; 76543210 <- Rightmost pixel
; Row 0, Bitplane 0 0
; Row 0, Bitplane 1 1
; Row 0, Bitplane 2 0
; Row 0, Bitplane 3 1
; .
; .
; .
; Row 7, Bitplane 3
;
; The upper left pixel is color %1010.
;==============================================================================
.STRUCT sTile
.UNION
Data DSB 32 ; 32 bytes of data, if you know what you're doing.
.NEXTU
Row0 DSB 4 ; Each row is spread across 4 bitplanes
Row1 DSB 4
Row2 DSB 4
Row3 DSB 4
Row4 DSB 4
Row5 DSB 4
Row6 DSB 4
Row7 DSB 4
.NEXTU
Row0Bitplane0 DB ; Super granular
Row0Bitplane1 DB
Row0Bitplane2 DB
Row0Bitplane3 DB
Row1Bitplane0 DB
Row1Bitplane1 DB
Row1Bitplane2 DB
Row1Bitplane3 DB
Row2Bitplane0 DB
Row2Bitplane1 DB
Row2Bitplane2 DB
Row2Bitplane3 DB
Row3Bitplane0 DB
Row3Bitplane1 DB
Row3Bitplane2 DB
Row3Bitplane3 DB
Row4Bitplane0 DB
Row4Bitplane1 DB
Row4Bitplane2 DB
Row4Bitplane3 DB
Row5Bitplane0 DB
Row5Bitplane1 DB
Row5Bitplane2 DB
Row5Bitplane3 DB
Row6Bitplane0 DB
Row6Bitplane1 DB
Row6Bitplane2 DB
Row6Bitplane3 DB
Row7Bitplane0 DB
Row7Bitplane1 DB
Row7Bitplane2 DB
Row7Bitplane3 DB
.ENDU
.ENDST
;==============================================================================
; A nametable entry is 16-bits and comprised of two things:
; byte 0: tile index
; byte 1: <user flags><priority><palette><vflip><hflip><bank select>
;
; You can think of the bank select + tile index as a 9th bit for 0..511.
;==============================================================================
.STRUCT sNameTableEntry
.UNION
Data DW
.NEXTU
TileIndex DB
Flags DB
.ENDU
.ENDST
.DEFINE VDP_NAMETABLE_ROWSIZE_IN_BYTES VDP_NAMETABLE_NUMCOLS * _sizeof_sNameTableEntry
; If you want to define a nametable entry with all of the parameters.
.MACRO DEFINE_NAMETABLE_ENTRY ARGS PATTERN_INDEX0_511, HFLIP0_1, VFLIP0_1, PALETTE0_1, PRIORITY0_1, USER_FLAGS0_7
;.DW PATTERN_INDEX0_511 | (HFLIP0_1 << (8 + VDP_NAMETABLE_ENTRY_HFLIP_SHIFT)) | (VFLIP0_1 << (8 + VDP_NAMETABLE_ENTRY_VFLIP_SHIFT)) | (PALETTE0_1 << (8 + VDP_NAMETABLE_ENTRY_PALSELECT_SHIFT)) | (PRIORITY0_1 << (8 + VDP_NAMETABLE_ENTRY_PRIORITYSELECT_SHIFT)) | (USER_FLAGS0_7 << (8 + VDP_NAMETABLE_USERBITS_SHIFT))
.DSTRUCT INSTANCEOF sNameTableEntry VALUES
TileIndex .DB <PATTERN_INDEX0_511
Flags .DB ((PATTERN_INDEX0_511 >> 8) << VDP_NAMETABLE_ENTRY_BANKSELECT_SHIFT) | (HFLIP0_1 << VDP_NAMETABLE_ENTRY_HFLIP_SHIFT) | (VFLIP0_1 << VDP_NAMETABLE_ENTRY_VFLIP_SHIFT) | (PALETTE0_1 << VDP_NAMETABLE_ENTRY_PALSELECT_SHIFT) | (PRIORITY0_1 << VDP_NAMETABLE_ENTRY_PRIORITYSELECT_SHIFT) | (USER_FLAGS0_7 << VDP_NAMETABLE_USERBITS_SHIFT)
.ENDST
.ENDM
; If you want to define a nametable location based on row and column.
.MACRO DEFINE_NAMETABLE_LOC ARGS NAME, COL, ROW
.DEFINE \1 ( VDP_NAMETABLE_START_LOC + ( ROW * VDP_NAMETABLE_ROWSIZE_IN_BYTES ) + ( COL * _sizeof_sNameTableEntry ) )
.ENDM
; If you already know the row and column you intend to write to, we can
; embed the destination VRAM address.
.MACRO VDP_NAMETABLE_CALC_VRAM_ADDRESS_DE ARGS ROW, COL, VDP_COMMAND
ld de, ( VDP_COMMAND << 8 ) | ( VDP_NAMETABLE_START_LOC + ( ROW * VDP_NAMETABLE_ROWSIZE_IN_BYTES ) + ( COL * _sizeof_sNameTableEntry ) )
.ENDM
; If you want to go from tile index to VRAM loc.
.MACRO CALC_VRAM_LOC_FOR_TILE_INDEX_IN_HL
.REPT 5 ; 2 ^ 5 == 32, which is how many bytes there are in a tile.
add hl, hl
.ENDR
.ENDM
; If you want to set VRAM to write mode from value in HL.
.MACRO SET_VRAM_WRITE_LOC_FROM_HL
; Set the VRAM pointer.
ld a, l
out (VDP_CONTROL_PORT), a ; Set low byte of address in first byte
ld a, h
or VDP_COMMAND_MASK_VRAM_WRITE
out (VDP_CONTROL_PORT), a ; Set high byte of address + command
.ENDM
; If you want to set VRAM to write mode from value in DE.
.MACRO SET_VRAM_WRITE_LOC_FROM_DE
; Set the VRAM pointer.
ld a, e
out (VDP_CONTROL_PORT), a ; Set low byte of address in first byte
ld a, d
or VDP_COMMAND_MASK_VRAM_WRITE
out (VDP_CONTROL_PORT), a ; Set high byte of address + command
.ENDM
;==============================================================================
; The sprite attribute table
;==============================================================================
.STRUCT sSAT_YPosEntry
YPos: DB
.ENDST
.STRUCT sSAT_XPosTileEntry
XPos: DB
TileIndex: DB
.ENDST
.STRUCT sSAT_YTable:
YPosEntries INSTANCEOF sSAT_YPosEntry VDP_SAT_MAX_SPRITES
.ENDST
.STRUCT sSAT_XTileTable:
XPosEntries INSTANCEOF sSAT_XPosTileEntry VDP_SAT_MAX_SPRITES
.ENDST
.SECTION "VDP Write Register" FREE
;==============================================================================
; VDP_WriteRegister
; Sets a VDP register value.
; INPUTS: E: Register to set
; A: Value to set
; OUTPUTS: Alters A. A is E masked with VDP command
;==============================================================================
VDP_WriteRegister:
; Output to the VDP
out (VDP_CONTROL_PORT), a ; Data first
ld a, e
or VDP_COMMAND_MASK_REGISTER_WRITE ; Mask in the command
out (VDP_CONTROL_PORT), a ; Commands + register num
ret
.ENDS
.SECTION "VDP Set Palette Entry" FREE
;==============================================================================
; VDP_SetPaletteEntry
; Sets a palette entry directly in the VDP.
; INPUTS: E: Entry to set (0..31)
; C: Color value to set
; OUTPUTS: None
; Destroys A.
;==============================================================================
VDP_SetPaletteEntry:
; Output to the VDP
ld a, e
out (VDP_CONTROL_PORT), a ; Set pal entry in low byte
ld a, VDP_COMMAND_MASK_CRAM_WRITE ; The command
out (VDP_CONTROL_PORT), a ; Send the command
; Emit the color
ld a, c
out (VDP_DATA_PORT), a
ret
.ENDS
.SECTION "VDP Set Palette Entries" FREE
;==============================================================================
; VDP_SetPaletteEntries
; Sets a series of palette entries in the VDP.
; INPUTS: A: Index of first palette entry to fill
; B: Count of entries to update
; HL: Pointer to palette data
; OUTPUTS: B is 0, HL points to end of data
; Destroys A, B, C, HL.
;==============================================================================
VDP_SetPaletteEntries:
; Now output to the VDP
out (VDP_CONTROL_PORT), a ; Set pal entry in low byte
ld a, VDP_COMMAND_MASK_CRAM_WRITE ; The command
out (VDP_CONTROL_PORT), a ; Send the command
; Now set the color values.
ld c, VDP_DATA_PORT
otir
ret
.ENDS
.SECTION "VDP Upload Tile Data" FREE
;==============================================================================
; VDP_UploadTileDataToTilePos
; Uploads the tile data starting at the tile index specified. Assumes data is
; all 4bpp (no bitplane skips, etc.)
; INPUTS: DE: Start of tile data
; BC: Size of tile data, in bytes
; HL: Index of tile to begin at (16-bit because it's 0..448)
; OUTPUTS: HL points to end of data. D, B are 0. C is the Data Port.
; Destroys B, C, D, E
;==============================================================================
VDP_UploadTileDataToTilePos:
; Find offset in VRAM.
CALC_VRAM_LOC_FOR_TILE_INDEX_IN_HL
ex de, hl ; HL now points to tile data, DE points to VRAM loc
jp VDP_UploadDataToVRAMLoc
.ENDS
.SECTION "VDP Upload Data Routines" FREE
;==============================================================================
; VDP_UploadDataToVRAMLoc
; Uploads data starting at the VRAM loc specified.
; INPUTS: DE: VRAM loc to write to
; BC: Size of data, in bytes
; HL: Pointer to src data
; OUTPUTS: HL points to end of data. D, B are 0. C is the Data Port.
; Destroys B, C, D, E
;==============================================================================
VDP_UploadDataToVRAMLoc:
; Set the VRAM pointer.
SET_VRAM_WRITE_LOC_FROM_DE
ld d, b
ld e, c
; FALL THROUGH
;==============================================================================
; VDP_UploadData_VDPPtrSet
; General-purpose method to upload up to 64K of data to the VDP (VRAM or CRAM).
; It's assumed that the VDP is already prepped for writing.
; INPUTS: HL: Start of data to write
; DE: Size of data size to upload
; OUTPUTS: HL points to end of data. D, B are 0. C is the Data Port.
; Destroys B, C, D, E
;==============================================================================
VDP_UploadData_VDPPtrSet:
; Ensures we roll over correctly:
; If DE == $00FF, we only want one otir.
; If DE == $0100, we *also* only want one otir.
; If DE == $0101, we want two otirs (one for 1 byte, one for 256 bytes)
ld b, e ; B gets low byte count
dec de
inc d
ld c, VDP_DATA_PORT ; Port for OTIR
VDP_UploadData_VDPPtrSet_WriteLoop:
otir
dec d
jp nz, VDP_UploadData_VDPPtrSet_WriteLoop
ret
.ENDS
.SECTION "VDP Upload Name Table Entry" FREE
;==============================================================================
; VDP_UploadNameTableEntry
; Uploads a single entry to the name table, at the column and row specfied.
; INPUTS: D: Row
; E: Column (range 0..31)
; HL: Name Table entry
; OUTPUTS: DE = VRAM address + command
; Destroys A, C
;==============================================================================
VDP_UploadNameTableEntry:
; Calculate the VRAM position.
; Remember that b << 6 is easier to rotate right twice
; H = 00rr rrrr ; High byte = Row * 64
; L = rrcc cccc ; Low byte = low bits from Row * 64 | column
; H |= NameTable|Cmd ; Add in nametable offset and "write to VRAM" command
; Start with row. This should be VDP_NAMETABLE_ROWSIZE_IN_BYTES * row.
xor a
srl d ; Low bit of Row -> CY
rra ; A = r000 0000
srl d ; Low bit of Row -> CY
rra ; A = rr00 0000
sla e ; Col = col * 2 bytes per entry
or e ; A = rrcc ccc0
ld e, a
ld a, (VDP_NAMETABLE_START_LOC >> 8) | VDP_COMMAND_MASK_VRAM_WRITE
or d
ld d, a ; Row = Nametable + Row * 64
; FALL THROUGH
;==============================================================================
; VDP_UploadNameTableEntry_AddressCalculated
; Uploads a single entry to the name table, at the VRAM address specified.
; INPUTS: DE: VRAM address + command
; HL: Name Table entry
; OUTPUTS: DE = VRAM address + command
; Destroys A, C
;==============================================================================
VDP_UploadNameTableEntry_AddressCalculated:
; We've calculated the offset, so actually write it.
; Prep the VRAM for writing.
ld c, VDP_CONTROL_PORT
out (c), e ; Set low byte of address in first byte
out (c), d ; Set high byte of address + command
; Now write the data.
ld c, VDP_DATA_PORT
out (c), l
out (c), h
ret
.ENDS
.SECTION "VDP Upload Name Table Entries" FREE
;==============================================================================
; VDP_UploadNameTableEntries
; Uploads a sequence of entries to the name table, starting at the column
; and row specfied.
; INPUTS: D: Row
; E: Column (range 0..31)
; HL: Pointer to name table entries
; BC: Total size in bytes (remember 1 entry = 2 bytes!)
; OUTPUTS: HL points to end of data. D, B are 0. C is the Data Port.
; Destroys B, C, D, E
;==============================================================================
VDP_UploadNameTableEntries:
; Calculate the VRAM position.
; Remember that b << 6 is easier to rotate right twice
; D = 00rr rrrr ; High byte = Row * 64
; E = rrcc cccc ; Low byte = low bits from Row * 64 | column
; D |= NameTable|Cmd ; Add in nametable offset and "write to VRAM" command
; Start with row. This should be VDP_NAMETABLE_ROWSIZE_IN_BYTES * row.
xor a
srl d ; Low bit of Row -> CY
rra ; A = r000 0000
srl d ; Low bit of Row -> CY
rra ; A = rr00 0000
sla e ; Col = col * 2 bytes per entry
or e ; A = rrcc ccc0
ld e, a
ld a, (VDP_NAMETABLE_START_LOC >> 8) | VDP_COMMAND_MASK_VRAM_WRITE
or d
ld d, a ; Row = Nametable + row * 64
jp VDP_UploadDataToVRAMLoc
.ENDS
.SECTION "VDP Upload String to Name Table" FREE
;==============================================================================
; VDP_UploadStringToNameTable
; Uploads a string of bytes to the name table, starting at the column
; and row specfied. Standard Name Table uses two bytes per entry, here you
; can use one register to specify the attribute to apply for each character.
; INPUTS: D: Row
; E: Column (range 0..31)
; HL: Pointer to string
; B: Length of string
; C: Attribute to apply to every other byte
; OUTPUTS: HL points to end of data. B are 0. A is the attribute. C is the
; data port.
; Destroys A, B, C, D, E
;==============================================================================
VDP_UploadStringToNameTable:
; Calculate the VRAM position.
; Remember that b << 6 is easier to rotate right twice
; D = 00rr rrrr ; High byte = Row * 64
; E = rrcc cccc ; Low byte = low bits from Row * 64 | column
; D |= NameTable|Cmd ; Add in nametable offset and "write to VRAM" command
; Start with row. This should be VDP_NAMETABLE_ROWSIZE_IN_BYTES * row.
xor a
srl d ; Low bit of Row -> CY
rra ; A = r000 0000
srl d ; Low bit of Row -> CY
rra ; A = rr00 0000
sla e ; Col = col * 2 bytes per entry
or e ; A = rrcc ccc0
ld e, a
ld a, (VDP_NAMETABLE_START_LOC >> 8) | VDP_COMMAND_MASK_VRAM_WRITE
or d
ld d, a ; Row = Nametable + row * 64
; Set the VRAM pointer.
ld a, e
out (VDP_CONTROL_PORT), a ; Set low byte of address in first byte
ld a, d
or VDP_COMMAND_MASK_VRAM_WRITE
out (VDP_CONTROL_PORT), a ; Set high byte of address + command
; Now interleave the chars from the string with the attribute
ld a, c
ld c, VDP_DATA_PORT
-:
outi ; Char from string
out (VDP_DATA_PORT), a ; Attribute
jp nz, -
ret
.ENDS
.SECTION "VDP Upload Sprite Data Routines" FREE
;==============================================================================
; VDP_UploadSpriteData
; Uploads the Y values and X/Tile Index values to the SAT. Trusts caller to
; have entered the appropriate sentinel value to terminate Y values.
; INPUTS: HL: Pointer to Y table for sprites (SAT_YTable)
; DE: Pointer to X/Tile Index table for sprites (SAT_XTileTable)
; B: #/sprites
; OUTPUTS: HL points to end of X/Tile Index table
; DE points to the end of the Y Pos table.
; B = 0, C = VDP_DATA_PORT, A = High byte of VRAM + write command
;==============================================================================
VDP_UploadSpriteData:
; Both tables will use the same register for the out port.
ld c, VDP_DATA_PORT
; Set the VRAM address for the Y table first.
; Low byte first
ld a, VDP_SAT_START_LOC & $FF ; Slam to 8-bit :(
out (VDP_CONTROL_PORT), a
; High byte + command
ld a, (VDP_SAT_START_LOC >> 8) | VDP_COMMAND_MASK_VRAM_WRITE
out (VDP_CONTROL_PORT), a
; Preserve our count; we'll need it for the second table.
ld a, b
; Upload that data!
otir
; Now the X pos/Tile Index table.
; A has been holding our count, double it since this table is twice as big.
add a, a
ld b, a
; Set the VRAM address
; Low byte first
ld a, (VDP_SAT_START_LOC & $FF) + VDP_SAT_XTABLE_OFFSET ; Slam to 8-bit
out (VDP_CONTROL_PORT), a
; High byte + command
ld a, (VDP_SAT_START_LOC >> 8) | VDP_COMMAND_MASK_VRAM_WRITE
out (VDP_CONTROL_PORT), a
; Put the other table into HL
ex de, hl
; Upload that data!
otir
ret
.ENDS
.ENDIF ;__VDP_ASM__ |
libsrc/_DEVELOPMENT/font/fzx/fonts/dkud4/Font03/_ff_dkud4_Font03.asm | jpoikela/z88dk | 640 | 4020 | <filename>libsrc/_DEVELOPMENT/font/fzx/fonts/dkud4/Font03/_ff_dkud4_Font03.asm
SECTION rodata_font
SECTION rodata_font_fzx
PUBLIC _ff_dkud4_Font03
_ff_dkud4_Font03:
BINARY "font/fzx/fonts/dkud4/Font03/font03.fzx"
|
resources/sleepy.asm | dgtized/redwall | 0 | 15625 | ;redcode-94
;name Sleepy
;author <NAME>
;strategy bombing core
org sleepy
sleepy: ADD #10, -1
MOV 2, @-1
JMP -2
DAT #33, #33
end
|
oeis/333/A333747.asm | neoneye/loda-programs | 11 | 243904 | <filename>oeis/333/A333747.asm
; A333747: Numbers that are either the product of two consecutive primes or two primes with a prime in between.
; Submitted by <NAME>
; 6,10,15,21,35,55,77,91,143,187,221,247,323,391,437,551,667,713,899,1073,1147,1271,1517,1591,1763,1927,2021,2279,2491,2773,3127,3233,3599,3953,4087,4331,4757,4891,5183,5609,5767,6059,6557,7031,7387,8051,8633,8989,9797,9991,10403,10807,11021,11227,11663,12091,12317,13843,14351,14803,16637,17399,17947,18209,19043,20413,20711,20989,22499,23393,23707,24613,25591,26219,27221,28199,28891,29893,30967,31313,32399,34189,34571,34933,36863,37627,38021,38407,39203,41567,41989,44377,47053,47897,50621,51067
mov $2,$0
add $0,1
div $2,2
sub $0,$2
seq $0,40 ; The prime numbers.
seq $2,40 ; The prime numbers.
mul $0,$2
|
oeis/021/A021858.asm | neoneye/loda-programs | 11 | 246324 | ; A021858: Decimal expansion of 1/854.
; Submitted by <NAME>(m2)
; 0,0,1,1,7,0,9,6,0,1,8,7,3,5,3,6,2,9,9,7,6,5,8,0,7,9,6,2,5,2,9,2,7,4,0,0,4,6,8,3,8,4,0,7,4,9,4,1,4,5,1,9,9,0,6,3,2,3,1,8,5,0,1,1,7,0,9,6,0,1,8,7,3,5,3,6,2,9,9,7,6,5,8,0,7,9,6,2,5,2,9,2,7,4,0,0,4,6,8
seq $0,83811 ; Numbers n such that 2n+1 is the digit reversal of n+1.
div $0,3416
mod $0,10
|
Algebra/Category.agda | esoeylemez/agda-simple | 1 | 2476 | <filename>Algebra/Category.agda
-- Copyright: (c) 2016 <NAME>
-- License: BSD3
-- Maintainer: <NAME> <<EMAIL>>
module Algebra.Category where
open import Algebra.Category.Category public
open import Algebra.Category.Groupoid public
open import Algebra.Category.Semigroupoid public
|
examples/paex_sine/src/paex_sine.adb | ficorax/PortAudioAda | 2 | 16618 | <reponame>ficorax/PortAudioAda
with Ada.Float_Text_IO; use Ada.Float_Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;
with System;
with PortAudioAda; use PortAudioAda;
with PaEx_Sine_Types; use PaEx_Sine_Types;
with PaEx_Sine_Callbacks; use PaEx_Sine_Callbacks;
procedure PaEx_Sine
is
stream : aliased Pa_Stream_Ptr;
err : PA_Error;
begin
Put ("PortAudio Test: output sine wave. SR = ");
Put (Sample_Rate, 0, 0, 0);
Put (", BufSize = ");
Put (Frames_Per_Buffer, 0);
New_Line;
Put_Line (PA_Get_Version);
-----------------------------------------------------------------------------
-- initialize sinusoidal wavetable
for i in 1 .. Table_Size loop
data.sine (i) :=
Sin (Float (i) / Float (Table_Size) * Ada.Numerics.Pi * 2.0);
end loop;
data.left_phase := 1;
data.right_phase := 1;
err := PA_Initialize;
if err /= paNoError then
raise PortAudio_Exception;
end if;
outputParameters.device := PA_Get_Default_Output_Device;
if outputParameters.device = paNoDevice then
raise PortAudio_Exception;
end if;
outputParameters.channelCount := 2;
outputParameters.sampleFormat := paFloat32;
outputParameters.suggestedLatency :=
PA_Get_Device_Info (outputParameters.device).defaultLowOutputLatency;
outputParameters.hostApiSpecificStreamInfo := System.Null_Address;
err := PA_Open_Stream
(stream'Access,
null,
outputParameters'Access,
Sample_Rate,
Frames_Per_Buffer,
paClipOff,
paTestCallback'Access,
data'Address);
if err /= paNoError then
raise PortAudio_Exception;
end if;
data.message := "No Message ";
err := PA_Set_Stream_Finished_Callback (stream, StreamFinished'Access);
if err /= paNoError then
raise PortAudio_Exception;
end if;
err := PA_Start_Stream (stream);
if err /= paNoError then
raise PortAudio_Exception;
end if;
delay Num_Seconds;
err := PA_Stop_Stream (stream);
if err /= paNoError then
raise PortAudio_Exception;
end if;
err := PA_Close_Stream (stream);
if err /= paNoError then
raise PortAudio_Exception;
end if;
err := PA_Terminate;
Put_Line ("Test finished.");
-----------------------------------------------------------------------------
return;
exception
when PortAudio_Exception =>
err := PA_Terminate;
Put_Line ("Error occured while using the PortAudio stream");
Put_Line ("Error code: " & PA_Error'Image (err));
Put_Line ("Error message: " & PA_Get_Error_Text (err));
end PaEx_Sine;
|
Impression.NETCore/Grammar/TheParser.g4 | sirgru/on.impression | 0 | 3359 | parser grammar TheParser
;
options
{
tokenVocab = TheLexer;
}
expressionSeq: (expression)+;
expression
: '(' expressionSeq '|' expressionSeq ')' # EnclosedAlternation
| '(' expressionSeq ')' # ParenExpr
| literal # n__Literal
| set # n__Set
| not_set # n__NotSet
| subtr_set # n__SubSet
| type # n__Type
| shorts # n__Shorts
| not_short # n__NotShort
| anchors # n__Anchors
| expression NAME # Naming
| expression RENAME # Renaming
| grouping # n__Grouping
| expression QUANTIFIER # Quantifier
| expression LAZY_QUANTIFIER # LazyQuantifier
| expression ANY_GREEDY # AnyGreedy
| expression ANY_LAZY # AnyLazy
| expression ALL_GREEDY # AllGreedy
| expression ALL_LAZY # AllLazy
| expression MAYBE_GREEDY # MaybeGreedy
| expression MAYBE_LAZY # MaybeLazy
| expression '|' expression # Alternation
| IF '(' expression ')' expression ELSE expression # ConditionExpression
| IF VAR_USE expression ELSE expression # ConditionVariable
| additions # n__Additions
| subst_special # n__SubstSpecial
| VAR_USE # NamedBackreference
| lex_error # LexicalError
;
literal
: EMPTY_LITERAL # EmptyLiteral
| LITERAL # LiteralWithContent
;
set
: EMPTY_SET # EmptySet
| SET # SetWithContent
| RANGE_SET # RangeSet
| set SET_UNION set # CombinationSet
;
not_set: NOT set # SetNegative;
subtr_set: (set | not_set) SET_DIFF set # SubtractionSet;
type: CHAR_TYPE # CharType
| NOT CHAR_TYPE # NotCharType
;
shorts
: C_WORD # WordChar
| C_WHITE_SPACE # WhiteSpace
| C_DIGIT # Digit
| WORD_BOUNDARY # WordBoundary
;
not_short
: NOT C_WORD # NotWord
| NOT C_WHITE_SPACE # NotWhiteSpace
| NOT C_DIGIT # NotDigit
| NOT WORD_BOUNDARY # NotWordBoundary
;
anchors
: START_LINE # StartLine
| END_LINE # EndLine
| START_STRING # StartString
| END_STRING_BEFORE_WS # EndStringBeforeWS
| END_STRING # EndString
| LAST_MATCH_END # LastMatchEnd
;
grouping
: I expression # CaseInsensitive
| BEFORE expression # Before
| NOT BEFORE expression # NotBefore
| AFTER expression # After
| NOT AFTER expression # NotAfter
| ATOMIC expression # Atomic
;
additions
: NL # NewLine
| WORD # Word
| INT # Int
| WHITESPACE # Whitespace
| C_ANY_NOT_NL # AnyNotNL
| C_ANY # AnyChar
| WORD_BEGIN # WordBegin
| WORD_END # WordEnd
;
subst_special
: NAMED_SUBST # NamedSubst
| MATCH # MatchKeyword
| BEFORE_MATCH # BeforeMatchKeyword
| AFTER_MATCH # AfterMatchKeyword
| INPUT # InputKeyword
;
lex_error
: NEVER+
;
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca_notsx.log_34_132.asm | ljhsiun2/medusa | 9 | 7829 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r14
push %r9
push %rdi
push %rdx
push %rsi
// Store
lea addresses_RW+0x15cf4, %r14
nop
nop
nop
inc %r9
movw $0x5152, (%r14)
nop
nop
add $2363, %rdi
// Store
lea addresses_normal+0xbb74, %r14
nop
cmp $41803, %r11
mov $0x5152535455565758, %rdx
movq %rdx, %xmm7
vmovups %ymm7, (%r14)
nop
xor $14524, %rsi
// Store
lea addresses_UC+0x7574, %r11
nop
nop
nop
nop
xor $24764, %r12
movl $0x51525354, (%r11)
nop
nop
xor %r11, %r11
// Store
lea addresses_UC+0xa4ec, %r14
nop
nop
nop
nop
nop
and %rdx, %rdx
mov $0x5152535455565758, %r12
movq %r12, (%r14)
nop
nop
nop
nop
sub $64152, %r11
// Store
lea addresses_D+0x1c05c, %r9
nop
add $16560, %r12
movw $0x5152, (%r9)
nop
nop
nop
inc %rdi
// Store
mov $0x95f, %r11
nop
nop
nop
nop
nop
sub $41484, %rdi
movl $0x51525354, (%r11)
nop
nop
nop
nop
add %r14, %r14
// Store
lea addresses_D+0x145f4, %r14
nop
nop
nop
xor %rsi, %rsi
movw $0x5152, (%r14)
nop
nop
nop
nop
xor $36804, %rdi
// Faulty Load
lea addresses_normal+0x90f4, %r11
clflush (%r11)
nop
nop
nop
nop
nop
cmp $19781, %r9
vmovups (%r11), %ymm5
vextracti128 $0, %ymm5, %xmm5
vpextrq $1, %xmm5, %rsi
lea oracles, %rdi
and $0xff, %rsi
shlq $12, %rsi
mov (%rdi,%rsi,1), %rsi
pop %rsi
pop %rdx
pop %rdi
pop %r9
pop %r14
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 0, 'same': False, 'type': 'addresses_normal'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 10, 'same': False, 'type': 'addresses_RW'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 7, 'same': False, 'type': 'addresses_normal'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 6, 'same': False, 'type': 'addresses_UC'}, 'OP': 'STOR'}
{'dst': {'NT': True, 'AVXalign': False, 'size': 8, 'congruent': 3, 'same': False, 'type': 'addresses_UC'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 1, 'same': False, 'type': 'addresses_D'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 0, 'same': False, 'type': 'addresses_P'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 8, 'same': False, 'type': 'addresses_D'}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 0, 'same': True, 'type': 'addresses_normal'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'34': 34}
34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34
*/
|
programs/oeis/080/A080722.asm | karttu/loda | 0 | 99123 | <gh_stars>0
; A080722: a(0) = 0; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 1 mod 3".
; 0,1,3,4,7,8,9,10,13,16,19,20,21,22,23,24,25,26,27,28,31,34,37,40,43,46,49,52,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,85,88,91,94,97,100,103,106,109,112,115,118,121
mov $2,$0
mov $4,$0
lpb $2,1
mov $0,$4
sub $2,1
sub $0,$2
mov $6,1
add $6,$0
lpb $0,1
mov $5,$0
add $0,1
div $0,3
add $0,1
sub $5,1
mov $6,$5
gcd $6,3
add $6,1
lpe
mul $6,6
mov $3,$6
sub $3,6
div $3,6
add $1,$3
lpe
|
Cubical/Experiments/Generic.agda | cj-xu/cubical | 0 | 774 | <gh_stars>0
-- Two fun examples of generic programming using univalence
{-# OPTIONS --cubical --safe #-}
module Cubical.Experiments.Generic where
open import Agda.Builtin.String
open import Agda.Builtin.List
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Univalence
open import Cubical.Data.Nat
open import Cubical.Data.Int
open import Cubical.Data.Prod
----------------------------------------------------------------------------
--
-- Dan Licata's example from slide 47 of:
-- http://dlicata.web.wesleyan.edu/pubs/l13jobtalk/l13jobtalk.pdf
There : Type₀ → Type₀
There X = List (ℕ × String × (X × ℕ))
Database : Type₀
Database = There (ℕ × ℕ)
us : Database
us = (4 , "John" , (30 , 5) , 1956)
∷ (8 , "Hugo" , (29 , 12) , 1978)
∷ (15 , "James" , (1 , 7) , 1968)
∷ (16 , "Sayid" , (2 , 10) , 1967)
∷ (23 , "Jack" , (3 , 12) , 1969)
∷ (42 , "Sun" , (20 , 3) , 1980)
∷ []
convert : Database → Database
convert d = transport (λ i → There (swapEq ℕ ℕ i)) d
-- Swap the dates of the American database to get the European format
eu : Database
eu = convert us
-- A sanity check
_ : us ≡ convert eu
_ = refl
----------------------------------------------------------------------------
--
-- Example inspired by:
--
-- Scrap Your Boilerplate: A Practical Design Pattern for Generic Programming
-- R<NAME> & <NAME>, TLDI'03
Address : Type₀
Address = String
Name : Type₀
Name = String
data Person : Type₀ where
P : Name → Address → Person
data Salary (A : Type₀) : Type₀ where
S : A → Salary A
data Employee (A : Type₀) : Type₀ where
E : Person → Salary A → Employee A
Manager : Type₀ → Type₀
Manager A = Employee A
-- First test of "mutual"
mutual
data Dept (A : Type₀) : Type₀ where
D : Name → Manager A → List (SubUnit A) → Dept A
data SubUnit (A : Type₀) : Type₀ where
PU : Employee A → SubUnit A
DU : Dept A → SubUnit A
data Company (A : Type₀) : Type₀ where
C : List (Dept A) → Company A
-- A small example
anders : Employee Int
anders = E (P "Anders" "Pittsburgh") (S (pos 2500))
andrea : Employee Int
andrea = E (P "Andrea" "Copenhagen") (S (pos 2000))
andreas : Employee Int
andreas = E (P "Andreas" "Gothenburg") (S (pos 3000))
-- For now we have a small company
genCom : Company Int
genCom =
C ( D "Research" andreas (PU anders ∷ PU andrea ∷ [])
∷ [])
-- Increase the salary for everyone by 1
incSalary : Company Int → Company Int
incSalary c = transport (λ i → Company (sucPathInt i)) c
genCom1 : Company Int
genCom1 = incSalary genCom
-- Increase the salary more
incSalaryℕ : ℕ → Company Int → Company Int
incSalaryℕ n c = transport (λ i → Company (addEq n i)) c
genCom2 : Company Int
genCom2 = incSalaryℕ 2 genCom
genCom10 : Company Int
genCom10 = incSalaryℕ 10 genCom
|
programs/oeis/103/A103609.asm | neoneye/loda | 22 | 175025 | ; A103609: Fibonacci numbers repeated (cf. A000045).
; 0,0,1,1,1,1,2,2,3,3,5,5,8,8,13,13,21,21,34,34,55,55,89,89,144,144,233,233,377,377,610,610,987,987,1597,1597,2584,2584,4181,4181,6765,6765,10946,10946,17711,17711,28657,28657,46368,46368,75025,75025,121393,121393,196418,196418,317811,317811,514229,514229,832040,832040,1346269,1346269,2178309,2178309,3524578,3524578,5702887,5702887,9227465,9227465,14930352,14930352,24157817,24157817,39088169,39088169,63245986,63245986,102334155,102334155,165580141,165580141,267914296,267914296,433494437,433494437,701408733,701408733,1134903170,1134903170,1836311903,1836311903,2971215073,2971215073,4807526976,4807526976,7778742049,7778742049
div $0,2
seq $0,45 ; Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.
|
programs/oeis/058/A058161.asm | jmorken/loda | 1 | 241496 | <filename>programs/oeis/058/A058161.asm
; A058161: Number of labeled cyclic groups with a fixed identity.
; 1,1,1,3,6,60,120,1260,6720,90720,362880,9979200,39916800,1037836800,10897286400,163459296000,1307674368000,59281238016000,355687428096000,15205637551104000
mov $1,$0
cal $1,142
cal $0,10 ; Euler totient function phi(n): count numbers <= n and prime to n.
div $1,$0
|
tests/tdsysv.adb | leo-brewin/ada-lapack | 5 | 7644 | with Ada.Text_IO;
with Ada.Text_IO.Complex_IO;
with Ada.Numerics.Generic_Real_Arrays;
with Ada.Numerics.Generic_Complex_Types;
with Ada.Numerics.Generic_Complex_Arrays;
with Ada.Numerics.Generic_Elementary_Functions;
with Ada.Numerics.Generic_Complex_Elementary_Functions;
with Ada_Lapack;
use Ada.Text_IO;
procedure tdsysv is
type Real is digits 18;
package Real_Arrays is new Ada.Numerics.Generic_Real_Arrays (Real);
package Complex_Types is new Ada.Numerics.Generic_Complex_Types (Real);
package Complex_Arrays is new Ada.Numerics.Generic_Complex_Arrays (Real_Arrays, Complex_Types);
package Real_Maths is new Ada.Numerics.Generic_Elementary_Functions (Real);
package Complex_Maths is new Ada.Numerics.Generic_Complex_Elementary_Functions (Complex_Types);
package Real_IO is new Ada.Text_IO.Float_IO (Real);
package Integer_IO is new Ada.Text_IO.Integer_IO (Integer);
package Complex_IO is new Ada.Text_IO.Complex_IO (Complex_Types);
package Lapack is new Ada_Lapack(Real, Complex_Types, Real_Arrays, Complex_Arrays);
use Lapack;
use Real_Arrays;
use Complex_Types;
use Complex_Arrays;
use Real_IO;
use Integer_IO;
use Complex_IO;
use Real_Maths;
use Complex_Maths;
matrix : Real_Matrix (1..5,1..5);
matrix_rows : Integer := Matrix'Length (1);
matrix_cols : Integer := Matrix'Length (2);
rhs : Real_Matrix (1..5,1..3);
rhs_rows : Integer := rhs'Length (1);
rhs_cols : Integer := rhs'Length (2);
pivots : Integer_Vector (1..matrix_rows);
short_vector : Real_Vector (1..1);
return_code : Integer;
begin
matrix:= (( -5.86, 3.99, -5.93, -2.82, 7.69 ),
( 3.99, 4.46, 2.58, 4.42, 4.61 ),
( -5.93, 2.58, -8.52, 8.57, 7.69 ),
( -2.82, 4.42, 8.57, 3.72, 8.07 ),
( 7.69, 4.61, 7.69, 8.07, 9.83 ));
rhs:= (( 1.32, -6.33, -8.77 ),
( 2.22, 1.69, -8.33 ),
( 0.12, -1.56, 9.54 ),
( -6.41, -9.49, 9.56 ),
( 6.33, -3.67, 7.48 ));
SYSV ( UPLO => 'L',
A => matrix,
LDA => matrix_rows,
N => matrix_cols,
B => rhs,
LDB => rhs_rows,
NRHS => rhs_cols,
IPIV => pivots,
WORK => short_vector,
LWORK => -1,
INFO => return_code );
declare
work_vector_max : Constant Integer := Integer( short_vector(1) );
work_vector : Real_Vector (1 .. work_vector_max);
begin
SYSV ( UPLO => 'L',
A => matrix,
LDA => matrix_rows,
N => matrix_cols,
B => rhs,
LDB => rhs_rows,
NRHS => rhs_cols,
IPIV => pivots,
WORK => work_vector,
LWORK => work_vector_max,
INFO => return_code );
end;
if (return_code /= 0) then
Put ("DSYSV failed, the return code was : ");
Put ( return_code );
New_line;
else
Put_line ("Solution");
for i in rhs'range(1) loop
for j in rhs'range(2) loop
put(" ");
put(rhs(i,j),3,3,0);
end loop;
new_line;
end loop;
new_line;
Put_line ("The matrix factorization");
for i in matrix'range(1) loop
for j in matrix'range(2) loop
put(" ");
put(matrix(i,j),3,3,0);
end loop;
new_line;
end loop;
new_line;
Put_line ("The pivot indices");
put("(");
for i in pivots'range loop
put(pivots(i),3);
end loop;
put_line(" )");
end if;
end tdsysv;
|
test/asset/agda-stdlib-1.0/Data/Nat/DivMod/WithK.agda | omega12345/agda-mode | 0 | 5019 | ------------------------------------------------------------------------
-- The Agda standard library
--
-- More efficient mod and divMod operations (require the K axiom)
------------------------------------------------------------------------
{-# OPTIONS --with-K --safe #-}
module Data.Nat.DivMod.WithK where
open import Data.Nat using (ℕ; _+_; _*_; _≟_; zero; suc)
open import Data.Nat.DivMod hiding (_mod_; _divMod_)
open import Data.Nat.Properties using (≤⇒≤″)
open import Data.Nat.WithK
open import Data.Fin using (Fin; toℕ; fromℕ≤″)
open import Data.Fin.Properties using (toℕ-fromℕ≤″)
open import Function using (_$_)
open import Relation.Nullary.Decidable using (False)
open import Relation.Binary.PropositionalEquality
using (refl; sym; cong; module ≡-Reasoning)
open import Relation.Binary.PropositionalEquality.WithK
open ≡-Reasoning
infixl 7 _mod_ _divMod_
------------------------------------------------------------------------
-- Certified modulus
_mod_ : (dividend divisor : ℕ) {≢0 : False (divisor ≟ 0)} → Fin divisor
(a mod 0) {}
(a mod suc n) = fromℕ≤″ (a % suc n) (≤″-erase (≤⇒≤″ (a%n<n a n)))
------------------------------------------------------------------------
-- Returns modulus and division result with correctness proof
_divMod_ : (dividend divisor : ℕ) {≢0 : False (divisor ≟ 0)} →
DivMod dividend divisor
(a divMod 0) {}
(a divMod suc n) = result (a div suc n) (a mod suc n) $ ≡-erase $ begin
a ≡⟨ a≡a%n+[a/n]*n a n ⟩
a % suc n + [a/n]*n ≡⟨ cong (_+ [a/n]*n) (sym (toℕ-fromℕ≤″ lemma′)) ⟩
toℕ (fromℕ≤″ _ lemma′) + [a/n]*n ∎
where
lemma′ = ≤″-erase (≤⇒≤″ (a%n<n a n))
[a/n]*n = a div suc n * suc n
|
test/Fail/RecordPattern4.agda | cruhland/agda | 1,989 | 16740 | <gh_stars>1000+
-- {-# OPTIONS -v tc.lhs:10 -v tc.lhs.split:50 #-}
postulate A : Set
record R : Set where
field f : A
test : _ → A
test record{f = a} = a
-- This could succeed, but Agda currently does not try to guess
-- the type type of the record pattern from its field names.
|
Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0x84_notsx.log_21829_1026.asm | ljhsiun2/medusa | 9 | 176965 | <filename>Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0x84_notsx.log_21829_1026.asm<gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r14
push %r15
push %r8
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_D_ht+0x2db8, %rsi
nop
sub %rdi, %rdi
mov (%rsi), %edx
nop
nop
sub %rdx, %rdx
lea addresses_D_ht+0x1424, %r15
nop
nop
nop
xor $38716, %r14
mov (%r15), %bp
nop
dec %rdx
lea addresses_D_ht+0xd1b8, %rdi
add $35784, %r8
mov $0x6162636465666768, %rsi
movq %rsi, %xmm2
vmovups %ymm2, (%rdi)
nop
nop
sub %rdi, %rdi
lea addresses_WT_ht+0x37b8, %r15
nop
nop
nop
xor %rdx, %rdx
mov (%r15), %si
nop
nop
nop
cmp %rbp, %rbp
lea addresses_D_ht+0x6bb8, %r15
nop
nop
nop
nop
nop
xor $6213, %r14
movb $0x61, (%r15)
nop
sub %rdx, %rdx
lea addresses_WT_ht+0x1c058, %rsi
lea addresses_UC_ht+0x3af8, %rdi
dec %rbp
mov $56, %rcx
rep movsl
inc %rcx
lea addresses_UC_ht+0x143b8, %rsi
lea addresses_normal_ht+0xe1b8, %rdi
nop
cmp $578, %r14
mov $66, %rcx
rep movsw
nop
nop
nop
xor $23404, %r14
lea addresses_normal_ht+0x195b8, %rdx
nop
nop
and %rcx, %rcx
mov $0x6162636465666768, %r15
movq %r15, %xmm2
movups %xmm2, (%rdx)
nop
nop
xor %rsi, %rsi
lea addresses_WT_ht+0x10fb8, %r15
nop
nop
nop
nop
nop
sub $37772, %rcx
movb (%r15), %dl
nop
nop
nop
add %rdx, %rdx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbp
pop %r8
pop %r15
pop %r14
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r11
push %r12
push %r9
push %rbp
push %rdi
push %rdx
// Store
lea addresses_RW+0x3948, %rdx
nop
inc %r11
mov $0x5152535455565758, %r12
movq %r12, %xmm0
vmovups %ymm0, (%rdx)
nop
nop
nop
cmp $1515, %r9
// Faulty Load
lea addresses_PSE+0xf9b8, %r11
nop
nop
sub %rdi, %rdi
mov (%r11), %r9d
lea oracles, %r12
and $0xff, %r9
shlq $12, %r9
mov (%r12,%r9,1), %r9
pop %rdx
pop %rdi
pop %rbp
pop %r9
pop %r12
pop %r11
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_PSE', 'same': False, 'size': 4, 'congruent': 0, 'NT': True, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_RW', 'same': False, 'size': 32, 'congruent': 4, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'type': 'addresses_PSE', 'same': True, 'size': 4, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_D_ht', 'same': False, 'size': 4, 'congruent': 10, 'NT': False, 'AVXalign': True}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_D_ht', 'same': False, 'size': 2, 'congruent': 2, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 32, 'congruent': 11, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_WT_ht', 'same': False, 'size': 2, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 1, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_WT_ht', 'congruent': 4, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 5, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_UC_ht', 'congruent': 9, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 11, 'same': False}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_normal_ht', 'same': False, 'size': 16, 'congruent': 10, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_WT_ht', 'same': False, 'size': 1, 'congruent': 8, 'NT': False, 'AVXalign': False}, '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
*/
|
test/asset/agda-stdlib-1.0/Codata/M/Bisimilarity.agda | omega12345/agda-mode | 5 | 15567 | <reponame>omega12345/agda-mode<gh_stars>1-10
------------------------------------------------------------------------
-- The Agda standard library
--
-- Bisimilarity for M-types
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe --sized-types #-}
module Codata.M.Bisimilarity where
open import Level
open import Size
open import Codata.Thunk
open import Codata.M
open import Data.Container.Core
open import Data.Container.Relation.Binary.Pointwise using (Pointwise; _,_)
open import Data.Product using (_,_)
open import Function
open import Relation.Binary
import Relation.Binary.PropositionalEquality as P
data Bisim {s p} (C : Container s p) (i : Size) : Rel (M C ∞) (s ⊔ p) where
inf : ∀ {t u} → Pointwise C (Thunk^R (Bisim C) i) t u → Bisim C i (inf t) (inf u)
module _ {s p} {C : Container s p} where
-- unfortunately the proofs are a lot nicer if we do not use the combinators
-- C.refl, C.sym and C.trans
refl : ∀ {i} → Reflexive (Bisim C i)
refl {x = inf t} = inf (P.refl , λ where p .force → refl)
sym : ∀ {i} → Symmetric (Bisim C i)
sym (inf (P.refl , f)) = inf (P.refl , λ where p .force → sym (f p .force))
trans : ∀ {i} → Transitive (Bisim C i)
trans (inf (P.refl , f)) (inf (P.refl , g)) =
inf (P.refl , λ where p .force → trans (f p .force) (g p .force))
isEquivalence : ∀ {i} → IsEquivalence (Bisim C i)
isEquivalence = record
{ refl = refl
; sym = sym
; trans = trans
}
setoid : {i : Size} → Setoid (s ⊔ p) (s ⊔ p)
setoid {i} = record
{ isEquivalence = isEquivalence {i}
}
|
Transynther/x86/_processed/NONE/_xt_sm_/i3-7100_9_0x84_notsx.log_1426_1803.asm | ljhsiun2/medusa | 9 | 86490 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r8
push %r9
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x1c2b2, %r9
nop
nop
nop
and %rbx, %rbx
mov (%r9), %r11
nop
nop
nop
nop
nop
dec %r8
lea addresses_UC_ht+0x10872, %rsi
lea addresses_normal_ht+0x131a2, %rdi
nop
nop
and $57076, %r9
mov $126, %rcx
rep movsb
nop
cmp %rdi, %rdi
lea addresses_WC_ht+0x4d72, %rdi
cmp %r8, %r8
mov $0x6162636465666768, %rcx
movq %rcx, (%rdi)
nop
nop
nop
nop
and %r8, %r8
lea addresses_A_ht+0x147c2, %rdi
dec %rbx
movb $0x61, (%rdi)
nop
nop
add $14550, %rsi
lea addresses_D_ht+0x15d32, %r11
nop
nop
nop
and %rdi, %rdi
movl $0x61626364, (%r11)
nop
nop
nop
nop
xor %r11, %r11
lea addresses_WT_ht+0x7f2, %r9
nop
nop
nop
xor %r8, %r8
mov $0x6162636465666768, %rsi
movq %rsi, %xmm7
vmovups %ymm7, (%r9)
nop
xor %rcx, %rcx
lea addresses_D_ht+0x12d72, %rbx
cmp $39438, %r8
mov $0x6162636465666768, %rcx
movq %rcx, %xmm5
movups %xmm5, (%rbx)
nop
nop
add %rbx, %rbx
lea addresses_WC_ht+0xd6f2, %rcx
clflush (%rcx)
nop
nop
nop
nop
nop
sub $27578, %r8
movw $0x6162, (%rcx)
nop
xor %rsi, %rsi
lea addresses_A_ht+0x59f2, %rsi
lea addresses_UC_ht+0xd6b2, %rdi
nop
nop
nop
nop
nop
sub $12606, %r8
mov $106, %rcx
rep movsl
nop
dec %r9
lea addresses_normal_ht+0xceb2, %r8
nop
nop
nop
inc %rsi
movw $0x6162, (%r8)
nop
nop
xor %rsi, %rsi
lea addresses_A_ht+0x16a72, %rcx
nop
nop
nop
inc %rsi
movb $0x61, (%rcx)
nop
sub $9495, %rbx
lea addresses_D_ht+0x1839a, %rsi
lea addresses_normal_ht+0x7f32, %rdi
nop
nop
nop
nop
lfence
mov $8, %rcx
rep movsw
sub %r9, %r9
lea addresses_WT_ht+0xde72, %r12
nop
nop
xor $46340, %r11
mov $0x6162636465666768, %rcx
movq %rcx, %xmm3
vmovups %ymm3, (%r12)
nop
nop
nop
add %r9, %r9
lea addresses_normal_ht+0x8e57, %r9
clflush (%r9)
sub $60920, %r12
movb $0x61, (%r9)
nop
nop
cmp $51449, %r12
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %r9
pop %r8
pop %r12
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r15
push %r8
push %r9
push %rbp
push %rbx
push %rcx
// Store
mov $0xd72, %rbp
nop
nop
nop
nop
xor %r8, %r8
mov $0x5152535455565758, %r9
movq %r9, (%rbp)
nop
nop
nop
nop
nop
add %r15, %r15
// Store
lea addresses_A+0x10d72, %r8
nop
nop
nop
add $53140, %rbx
movl $0x51525354, (%r8)
nop
nop
xor $45353, %r8
// Store
lea addresses_WC+0xa772, %rbp
nop
nop
nop
sub $55410, %r8
movw $0x5152, (%rbp)
nop
inc %rcx
// Store
lea addresses_A+0x10d72, %r9
nop
nop
nop
nop
dec %r10
mov $0x5152535455565758, %r8
movq %r8, (%r9)
nop
nop
nop
sub $27031, %rbx
// Load
lea addresses_D+0x1cef2, %r9
nop
nop
sub %r15, %r15
vmovups (%r9), %ymm1
vextracti128 $1, %ymm1, %xmm1
vpextrq $0, %xmm1, %rcx
cmp $52249, %r15
// Store
lea addresses_US+0x13b72, %r9
sub %r10, %r10
movw $0x5152, (%r9)
nop
cmp %rcx, %rcx
// Store
lea addresses_A+0x178f2, %r9
nop
nop
add $6315, %rbx
movb $0x51, (%r9)
nop
xor %rbp, %rbp
// Store
lea addresses_PSE+0xf472, %r8
nop
nop
nop
add %rbp, %rbp
movw $0x5152, (%r8)
nop
add $2809, %r9
// Store
lea addresses_UC+0x1567c, %r8
nop
nop
nop
nop
nop
xor %rcx, %rcx
mov $0x5152535455565758, %r9
movq %r9, (%r8)
nop
nop
nop
nop
nop
cmp %rbp, %rbp
// Faulty Load
lea addresses_A+0x10d72, %r10
nop
nop
nop
dec %r9
movb (%r10), %bl
lea oracles, %r9
and $0xff, %rbx
shlq $12, %rbx
mov (%r9,%rbx,1), %rbx
pop %rcx
pop %rbx
pop %rbp
pop %r9
pop %r8
pop %r15
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_A', 'same': False, 'size': 16, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_P', 'same': False, 'size': 8, 'congruent': 11, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_A', 'same': True, 'size': 4, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WC', 'same': False, 'size': 2, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_A', 'same': True, 'size': 8, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_D', 'same': False, 'size': 32, 'congruent': 7, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_US', 'same': False, 'size': 2, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_A', 'same': False, 'size': 1, 'congruent': 6, 'NT': False, 'AVXalign': True}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_PSE', 'same': False, 'size': 2, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_UC', 'same': False, 'size': 8, 'congruent': 1, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'type': 'addresses_A', 'same': True, 'size': 1, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_WC_ht', 'same': False, 'size': 8, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_UC_ht', 'congruent': 8, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 3, 'same': True}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_WC_ht', 'same': False, 'size': 8, 'congruent': 10, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_A_ht', 'same': True, 'size': 1, 'congruent': 4, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 4, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 32, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 16, 'congruent': 11, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WC_ht', 'same': False, 'size': 2, 'congruent': 7, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_A_ht', 'congruent': 7, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 4, 'same': False}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_normal_ht', 'same': False, 'size': 2, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_A_ht', 'same': False, 'size': 1, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_D_ht', 'congruent': 3, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 5, 'same': False}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 32, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_normal_ht', 'same': False, 'size': 1, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'58': 1426}
58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58
*/
|
programs/oeis/089/A089801.asm | karttu/loda | 0 | 9517 | <reponame>karttu/loda<filename>programs/oeis/089/A089801.asm<gh_stars>0
; A089801: a(n) = 0 unless n = 3j^2+2j or 3j^2+4j+1 for some j>=0, in which case a(n) = 1.
; 1,1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
mov $2,$0
mul $0,2
add $0,1
add $0,$2
lpb $0,1
sub $0,1
add $1,1
trn $1,$0
add $3,2
trn $0,$3
lpe
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca.log_21829_1869.asm | ljhsiun2/medusa | 9 | 93342 | <filename>Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca.log_21829_1869.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r9
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_A_ht+0xda10, %rbx
nop
nop
add %rdi, %rdi
mov $0x6162636465666768, %r12
movq %r12, %xmm4
movups %xmm4, (%rbx)
nop
nop
nop
nop
nop
xor %rsi, %rsi
lea addresses_WC_ht+0x1d610, %rsi
lea addresses_UC_ht+0x1d610, %rdi
nop
sub %r9, %r9
mov $53, %rcx
rep movsl
nop
nop
inc %rsi
lea addresses_A_ht+0x1cd10, %rdi
and $65164, %rdx
mov $0x6162636465666768, %r12
movq %r12, %xmm1
movups %xmm1, (%rdi)
nop
cmp $29771, %rcx
lea addresses_A_ht+0x19e10, %rbx
nop
add %r12, %r12
movb $0x61, (%rbx)
nop
nop
nop
nop
cmp $54323, %r9
lea addresses_A_ht+0xa490, %r12
nop
nop
nop
xor $58775, %rsi
mov (%r12), %rbx
nop
nop
nop
sub %rdi, %rdi
lea addresses_normal_ht+0x108a0, %rdx
nop
nop
nop
nop
nop
add $54306, %r12
mov (%rdx), %ebx
nop
nop
nop
nop
nop
cmp $31762, %rdi
lea addresses_WC_ht+0x11f10, %rbx
nop
nop
nop
nop
nop
sub %rdi, %rdi
movb (%rbx), %r9b
add $4940, %rdi
lea addresses_WC_ht+0x11d8c, %r9
nop
nop
nop
dec %rcx
movups (%r9), %xmm7
vpextrq $0, %xmm7, %rdi
inc %rcx
lea addresses_D_ht+0x1de10, %r12
nop
nop
nop
nop
nop
add $37652, %rbx
mov (%r12), %ecx
nop
xor %rbx, %rbx
lea addresses_D_ht+0x530, %rsi
lea addresses_UC_ht+0x14110, %rdi
sub %r11, %r11
mov $24, %rcx
rep movsb
nop
nop
nop
nop
nop
inc %rdx
lea addresses_D_ht+0x1cb50, %rsi
lea addresses_WT_ht+0x1d7b0, %rdi
xor $11123, %r9
mov $18, %rcx
rep movsq
nop
nop
xor %rbx, %rbx
lea addresses_normal_ht+0x13a10, %r9
nop
nop
nop
xor %rdx, %rdx
movups (%r9), %xmm5
vpextrq $1, %xmm5, %rdi
nop
dec %r11
lea addresses_normal_ht+0x904c, %rsi
lea addresses_D_ht+0xdad0, %rdi
clflush (%rdi)
nop
nop
nop
nop
nop
xor %rdx, %rdx
mov $40, %rcx
rep movsw
nop
nop
dec %rcx
lea addresses_UC_ht+0xce10, %rsi
inc %r9
and $0xffffffffffffffc0, %rsi
movntdqa (%rsi), %xmm1
vpextrq $0, %xmm1, %rcx
nop
nop
nop
cmp $5962, %r12
lea addresses_WT_ht+0xc888, %rdi
nop
nop
nop
nop
nop
xor $27256, %rcx
mov (%rdi), %r9
nop
nop
nop
nop
xor $2010, %rdx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbx
pop %r9
pop %r12
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r13
push %r14
push %r15
push %r9
push %rcx
push %rsi
// Faulty Load
lea addresses_RW+0xfa10, %rsi
and %r9, %r9
mov (%rsi), %rcx
lea oracles, %r13
and $0xff, %rcx
shlq $12, %rcx
mov (%r13,%rcx,1), %rcx
pop %rsi
pop %rcx
pop %r9
pop %r15
pop %r14
pop %r13
ret
/*
<gen_faulty_load>
[REF]
{'src': {'congruent': 0, 'AVXalign': False, 'same': False, 'size': 16, 'NT': False, 'type': 'addresses_RW'}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'congruent': 0, 'AVXalign': False, 'same': True, 'size': 8, 'NT': False, 'type': 'addresses_RW'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'OP': 'STOR', 'dst': {'congruent': 11, 'AVXalign': False, 'same': True, 'size': 16, 'NT': False, 'type': 'addresses_A_ht'}}
{'src': {'congruent': 9, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'REPM', 'dst': {'congruent': 8, 'same': False, 'type': 'addresses_UC_ht'}}
{'OP': 'STOR', 'dst': {'congruent': 8, 'AVXalign': False, 'same': True, 'size': 16, 'NT': False, 'type': 'addresses_A_ht'}}
{'OP': 'STOR', 'dst': {'congruent': 9, 'AVXalign': False, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_A_ht'}}
{'src': {'congruent': 7, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_A_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 4, 'AVXalign': False, 'same': True, 'size': 4, 'NT': False, 'type': 'addresses_normal_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 6, 'AVXalign': False, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_WC_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 1, 'AVXalign': False, 'same': False, 'size': 16, 'NT': False, 'type': 'addresses_WC_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 8, 'AVXalign': False, 'same': False, 'size': 4, 'NT': False, 'type': 'addresses_D_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 5, 'same': False, 'type': 'addresses_D_ht'}, 'OP': 'REPM', 'dst': {'congruent': 8, 'same': False, 'type': 'addresses_UC_ht'}}
{'src': {'congruent': 6, 'same': False, 'type': 'addresses_D_ht'}, 'OP': 'REPM', 'dst': {'congruent': 4, 'same': False, 'type': 'addresses_WT_ht'}}
{'src': {'congruent': 11, 'AVXalign': False, 'same': False, 'size': 16, 'NT': False, 'type': 'addresses_normal_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 1, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'REPM', 'dst': {'congruent': 5, 'same': True, 'type': 'addresses_D_ht'}}
{'src': {'congruent': 10, 'AVXalign': False, 'same': False, 'size': 16, 'NT': True, 'type': 'addresses_UC_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 3, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_WT_ht'}, 'OP': 'LOAD'}
{'32': 21829}
32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32
*/
|
src/intel/tools/tests/gen6/lzd.asm | SoftReaper/Mesa-Renoir-deb | 0 | 89458 | lzd(8) g16<1>UD g17<4>UD { align16 1Q };
lzd(8) g4<1>UD g5<8,8,1>UD { align1 1Q };
lzd(16) g4<1>UD g6<8,8,1>UD { align1 1H };
|
test/src/yaml-lexer-tokenization_test.adb | robdaemon/AdaYaml | 32 | 11494 | -- part of AdaYaml, (c) 2017 <NAME>
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Finalization;
with Ada.Unchecked_Deallocation;
with AUnit.Assertions; use AUnit.Assertions;
package body Yaml.Lexer.Tokenization_Test is
use type Text.Reference;
subtype Evaluated_Token is Token_Kind with Static_Predicate =>
Evaluated_Token in Scalar_Token_Kind | Suffix | Verbatim_Tag;
subtype Short_Lexeme_Token is Token_Kind with Static_Predicate =>
Short_Lexeme_Token in Unknown_Directive | Anchor | Alias;
subtype Full_Lexeme_Token is Token_Kind with Static_Predicate =>
Full_Lexeme_Token in Directive_Param | Tag_Handle;
subtype Value_Token is Token_Kind with Static_Predicate =>
Value_Token in Evaluated_Token | Short_Lexeme_Token | Full_Lexeme_Token;
subtype Empty_Token is Token_Kind with Static_Predicate =>
not (Empty_Token in Value_Token | Indentation);
type Token_With_Value_Holder (Kind : Token_Kind) is record
Refcount : Natural := 1;
case Kind is
when Value_Token => Value : Text.Reference;
when Indentation => Depth : Natural;
when others => null;
end case;
end record;
type Token_With_Value_Holder_Access is access Token_With_Value_Holder;
type Token_With_Value is new Ada.Finalization.Controlled with record
Reference : Token_With_Value_Holder_Access;
end record;
overriding procedure Adjust (Object : in out Token_With_Value);
overriding procedure Finalize (Object : in out Token_With_Value);
procedure Adjust (Object : in out Token_With_Value) is
begin
if Object.Reference /= null then
Object.Reference.Refcount := Object.Reference.Refcount + 1;
end if;
end Adjust;
procedure Finalize (Object : in out Token_With_Value) is
procedure Free is new Ada.Unchecked_Deallocation
(Token_With_Value_Holder, Token_With_Value_Holder_Access);
Reference : Token_With_Value_Holder_Access := Object.Reference;
begin
Object.Reference := null;
if Reference /= null then
Reference.Refcount := Reference.Refcount - 1;
if Reference.Refcount = 0 then
Free (Reference);
end if;
end if;
end Finalize;
function To_String (T : Token_With_Value) return String is
(T.Reference.Kind'Img &
(case T.Reference.Kind is
when Value_Token => '(' & Escaped (T.Reference.Value) & ')',
when Indentation => '(' & T.Reference.Depth'Img & ')',
when others => ""));
type Token_List is array (Positive range <>) of Token_With_Value;
function TI (Indent : Natural) return Token_With_Value is
(Token_With_Value'(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1,
Kind => Indentation,
Depth => Indent)));
function With_String (Tok : Value_Token; S : String;
T : in out Test_Cases.Test_Case'Class)
return Token_With_Value is
begin
return V : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference => new Token_With_Value_Holder (Kind => Tok)) do
V.Reference.Refcount := 1;
V.Reference.Value := TC (T).Pool.From_String (S);
end return;
end With_String;
function TPS (T : in out Test_Cases.Test_Case'Class;
Content : String) return Token_With_Value is
(With_String (Plain_Scalar, Content, T));
function TSQS (T : in out Test_Cases.Test_Case'Class;
Content : String) return Token_With_Value is
(With_String (Single_Quoted_Scalar, Content, T));
function TDQS (T : in out Test_Cases.Test_Case'Class;
Content : String) return Token_With_Value is
(With_String (Double_Quoted_Scalar, Content, T));
function TLS (T : in out Test_Cases.Test_Case'Class;
Content : String) return Token_With_Value is
(With_String (Literal_Scalar, Content, T));
function TFS (T : in out Test_Cases.Test_Case'Class;
Content : String) return Token_With_Value is
(With_String (Folded_Scalar, Content, T));
TStrE : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Stream_End));
TMK : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Map_Key_Ind));
TMV : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Map_Value_Ind));
TMS : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Flow_Map_Start));
TME : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Flow_Map_End));
TSep : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Flow_Separator));
TSS : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Flow_Seq_Start));
TSE : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Flow_Seq_End));
TSI : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Seq_Item_Ind));
TYD : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Yaml_Directive));
TTD : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Tag_Directive));
TDirE : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Directives_End));
TDocE : constant Token_With_Value :=
(Ada.Finalization.Controlled with Reference =>
new Token_With_Value_Holder'(Refcount => 1, Kind => Document_End));
function TDP (T : in out Test_Cases.Test_Case'Class; Content : String)
return Token_With_Value is
(With_String (Directive_Param, Content, T));
function TTH (T : in out Test_Cases.Test_Case'Class; Content : String)
return Token_With_Value is
(With_String (Tag_Handle, Content, T));
function TTV (T : in out Test_Cases.Test_Case'Class; Content : String)
return Token_With_Value is
(With_String (Verbatim_Tag, Content, T));
function TTU (T : in out Test_Cases.Test_Case'Class; Content : String)
return Token_With_Value is
(With_String (Suffix, Content, T));
function TUD (T : in out Test_Cases.Test_Case'Class; Content : String)
return Token_With_Value is
(With_String (Unknown_Directive, Content, T));
function TAn (T : in out Test_Cases.Test_Case'Class; Content : String)
return Token_With_Value is
(With_String (Anchor, Content, T));
function TAli (T : in out Test_Cases.Test_Case'Class; Content : String)
return Token_With_Value is
(With_String (Alias, Content, T));
function To_String (L : Instance; T : Token_Kind) return String is
(T'Img & (case T is
when Evaluated_Token => '(' & Escaped (L.Value) & ')',
when Short_Lexeme_Token => '(' & Escaped (Short_Lexeme (L)) & ')',
when Full_Lexeme_Token => '(' & Escaped (Full_Lexeme (L)) & ')',
when Empty_Token => "",
when Indentation => '(' & Natural'(L.Pos - L.Line_Start - 1)'Img & ')'));
procedure Assert_Equals (P : Text.Pool.Reference;
Input : String; Expected : Token_List) is
L : Instance;
I : Natural := 0;
begin
Init (L, Input, P);
for Expected_Token of Expected loop
I := I + 1;
declare
T : constant Token := Next_Token (L);
begin
Assert (T.Kind = Expected_Token.Reference.Kind,
"Wrong token kind at #" & I'Img & ": Expected " &
To_String (Expected_Token) & ", got " &
To_String (L, T.Kind));
if T.Kind = Expected_Token.Reference.Kind then
case T.Kind is
when Evaluated_Token =>
Assert (L.Value = Expected_Token.Reference.Value,
"Wrong content at #" & I'Img & ": Expected " &
Escaped (Expected_Token.Reference.Value) &
", got " & Escaped (L.Value));
when Full_Lexeme_Token =>
Assert (Full_Lexeme (L) = Expected_Token.Reference.Value,
"Wrong " & T.Kind'Img & " at #" & I'Img & ": Expected " &
Escaped (Expected_Token.Reference.Value) &
", got " & Escaped (Full_Lexeme (L)));
when Short_Lexeme_Token =>
Assert (Short_Lexeme (L) = Expected_Token.Reference.Value,
"Wrong " & T.Kind'Img & "at #" & I'Img & ": Expected " &
Escaped (Expected_Token.Reference.Value) &
", got " & Escaped (Short_Lexeme (L)));
when Indentation =>
Assert (L.Pos - L.Line_Start - 1 = Expected_Token.Reference.Depth,
"Wrong indentation at #" & I'Img & ": Expected" &
Expected_Token.Reference.Depth'Img & ", got " &
Integer'(L.Pos - L.Line_Start - 2)'Img);
when Empty_Token => null;
end case;
end if;
end;
end loop;
end Assert_Equals;
procedure Register_Tests (T : in out TC) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Empty_Document'Access, "Empty document");
Register_Routine (T, Single_Line_Scalar'Access, "Single line scalar");
Register_Routine (T, Multiline_Scalar'Access, "Multiline scalar");
Register_Routine (T, Single_Line_Mapping'Access, "Single line mapping");
Register_Routine (T, Multiline_Mapping'Access, "Multiline mapping");
Register_Routine (T, Explicit_Mapping'Access, "Explicit mapping");
Register_Routine (T, Sequence'Access, "Sequence");
Register_Routine (T, Sequence_With_Block_Mappings'Access, "Sequence with block mappings");
Register_Routine (T, Single_Quoted_Scalar'Access, "Single-line single quoted scalar");
Register_Routine (T, Multiline_Single_Quoted_Scalar'Access, "Multiline single quoted scalar");
Register_Routine (T, Double_Quoted_Scalar'Access, "Single-line double quoted scalar");
Register_Routine (T, Multiline_Double_Quoted_Scalar'Access, "Multiline double quoted scalar");
Register_Routine (T, Escape_Sequences'Access, "Escape sequences");
Register_Routine (T, Block_Scalar'Access, "Block scalar");
Register_Routine (T, Block_Scalars'Access, "Block scalars");
Register_Routine (T, Directives'Access, "Directives");
Register_Routine (T, Markers'Access, "Markers and unknown directives");
Register_Routine (T, Flow_Indicators'Access, "Flow indicators");
Register_Routine (T, Adjacent_Map_Values'Access, "Adjacent map values (JSON-style)");
Register_Routine (T, Tag_Handles'Access, "Tag handles");
Register_Routine (T, Verbatim_Tag_Handle'Access, "Verbatim tag handle");
Register_Routine (T, Anchors_And_Aliases'Access, "Anchors and aliases");
Register_Routine (T, Empty_Lines'Access, "Empty lines");
end Register_Tests;
function Name (T : TC) return Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("Tokenization tests for Lexer");
end Name;
procedure Set_Up (T : in out TC) is
begin
T.Pool.Create (8092);
end Set_Up;
procedure Empty_Document (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "", (1 => TStrE));
end Empty_Document;
procedure Single_Line_Scalar (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "scalar",
(TI (0), TPS (T, "scalar"), TStrE));
end Single_Line_Scalar;
procedure Multiline_Scalar (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "scalar" & Line_Feed & " line two",
(TI (0), TPS (T, "scalar line two"), TStrE));
end Multiline_Scalar;
procedure Single_Line_Mapping (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "key: value",
(TI (0), TPS (T, "key"), TMV, TPS (T, "value"), TStrE));
end Single_Line_Mapping;
procedure Multiline_Mapping (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "key:" & Line_Feed & " value",
(TI (0), TPS (T, "key"), TMV, TI (2), TPS (T, "value"),
TStrE));
end Multiline_Mapping;
procedure Explicit_Mapping (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "? key" & Line_Feed & ": value",
(TI (0), TMK, TPS (T, "key"), TI (0), TMV,
TPS (T, "value"), TStrE));
end Explicit_Mapping;
procedure Sequence (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "- a" & Line_Feed & "- b",
(TI (0), TSI, TPS (T, "a"), TI (0), TSI, TPS (T, "b"),
TStrE));
end Sequence;
procedure Sequence_With_Block_Mappings (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "-" & Line_Feed & " avg: 0.228",
(TI (0), TSI, TI (2), TPS (T, "avg"), TMV,
TPS (T, "0.228"), TStrE));
end Sequence_With_Block_Mappings;
procedure Single_Quoted_Scalar (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "'quoted scalar'",
(TI (0), TSQS (T, "quoted scalar"), TStrE));
end Single_Quoted_Scalar;
procedure Multiline_Single_Quoted_Scalar
(T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "'quoted" & Line_Feed &
" multi line " & Line_Feed & Line_Feed & "scalar'",
(TI (0),
TSQS (T, "quoted multi line" & Line_Feed & "scalar"),
TStrE));
end Multiline_Single_Quoted_Scalar;
procedure Double_Quoted_Scalar (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, """quoted scalar""",
(TI (0), TDQS (T, "quoted scalar"), TStrE));
end Double_Quoted_Scalar;
procedure Multiline_Double_Quoted_Scalar
(T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, """quoted" & Line_Feed &
" multi line " & Line_Feed & Line_Feed & "scalar""",
(TI (0),
TDQS (T, "quoted multi line" & Line_Feed & "scalar"),
TStrE));
end Multiline_Double_Quoted_Scalar;
procedure Escape_Sequences (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, """\n\x31\u0032\U00000033""",
(TI (0), TDQS (T, Line_Feed & "123"), TStrE));
end Escape_Sequences;
procedure Block_Scalar (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "|" & Line_Feed & " a" & Line_Feed &
Line_Feed & " b" & Line_Feed & " # comment",
(TI (0),
TLS (T, "a" & Line_Feed & Line_Feed & "b" & Line_Feed),
TStrE));
end Block_Scalar;
procedure Block_Scalars (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "one : >2-" & Line_Feed & " foo" &
Line_Feed & " bar" & Line_Feed & "two: |+" & Line_Feed &
" bar" & Line_Feed & " baz" & Line_Feed & Line_Feed,
(TI (0), TPS (T, "one"), TMV, TFS (T, " foo bar"), TI (0),
TPS (T, "two"), TMV,
TLS (T, "bar" & Line_Feed & " baz" & Line_Feed & Line_Feed),
TStrE));
end Block_Scalars;
procedure Directives (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "%YAML 1.3" & Line_Feed & "---" &
Line_Feed & "%TAG" & Line_Feed & "..." & Line_Feed &
Line_Feed & "%TAG ! example%20.html",
(TYD, TDP (T, "1.3"), TDirE, TI (0), TPS (T, "%TAG"),
TDocE, TTD, TTH (T, "!"), TTU (T, "example .html"),
TStrE));
end Directives;
procedure Markers (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "---" & Line_Feed & "---" & Line_Feed &
"..." & Line_Feed & "%UNKNOWN warbl",
(TDirE, TDirE, TDocE, TUD (T, "UNKNOWN"),
TDP (T, "warbl"), TStrE));
end Markers;
procedure Flow_Indicators (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "bla]: {c: d, [e]: f}",
(TI (0), TPS (T, "bla]"), TMV, TMS, TPS (T, "c"), TMV,
TPS (T, "d"), TSep, TSS, TPS (T, "e"), TSE, TMV,
TPS (T, "f"), TME, TStrE));
end Flow_Indicators;
procedure Adjacent_Map_Values (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "{""foo"":bar, [1]" & Line_Feed &
":egg}",
(TI (0), TMS, TDQS (T, "foo"), TMV, TPS (T, "bar"), TSep,
TSS, TPS (T, "1"), TSE, TMV, TPS (T, "egg"), TME, TStrE));
end Adjacent_Map_Values;
procedure Tag_Handles (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "- !!str string" & Line_Feed &
"- !local%21 local" & Line_Feed & "- !e! e",
(TI (0), TSI, TTH (T, "!!"), TTU (T, "str"),
TPS (T, "string"), TI (0), TSI, TTH (T, "!"),
TTU (T, "local!"), TPS (T, "local"), TI (0), TSI,
TTH (T, "!e!"), TTU (T, ""), TPS (T, "e"), TStrE));
end Tag_Handles;
procedure Verbatim_Tag_Handle (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "!<tag:yaml.org,2002:str> string",
(TI (0), TTV (T, "tag:yaml.org,2002:str"),
TPS (T, "string"), TStrE));
end Verbatim_Tag_Handle;
procedure Anchors_And_Aliases (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "&a foo: {&b b: *a, *b : c}",
(TI (0), TAn (T, "a"), TPS (T, "foo"), TMV, TMS,
TAn (T, "b"), TPS (T, "b"), TMV, TAli (T, "a"), TSep,
TAli (T, "b"), TMV, TPS (T, "c"), TME, TStrE));
end Anchors_And_Aliases;
procedure Empty_Lines (T : in out Test_Cases.Test_Case'Class) is
begin
Assert_Equals (TC (T).Pool, "block: foo" & Line_Feed & Line_Feed &
" bar" & Line_Feed & Line_Feed & " baz" & Line_Feed &
"flow: {" & Line_Feed & " foo" & Line_Feed & Line_Feed &
" bar: baz" & Line_Feed & Line_Feed & Line_Feed &
" mi" & Line_Feed & "}",
(TI (0), TPS (T, "block"), TMV,
TPS (T, "foo" & Line_Feed & "bar" & Line_Feed & "baz"),
TI (0), TPS (T, "flow"), TMV, TMS,
TPS (T, "foo" & Line_Feed & "bar"), TMV,
TPS (T, "baz" & Line_Feed & Line_Feed & "mi"),
TME, TStrE));
end Empty_Lines;
end Yaml.Lexer.Tokenization_Test;
|
symbolinen_konekieli/Linux/kuudes_x87_32.asm | tkukka/VariousContent | 0 | 29056 | BITS 32
metodi EQU 0
SECTION .text
EXTERN set_method
GLOBAL laske_ala:function
;vastaa: double laske_ala(double). ST0 = ympyrän pinta-ala
laske_ala: push ebp ;ABI: rekisterin tila säilytettävä
mov ebp, esp ;funktion pinokehys
fld qword [ebp + 8] ;st0 = säde
fmul st0, st0 ;st0 = säde ^ 2
fldpi ;st0 = pii, st1 = säde ^ 2
fmul st0, st1 ;st0 = pii * säde ^ 2
push metodi
call set_method ;kerrotaan main():iin laskentatapa
add esp, 4
leave
ret
|
asmTests/movsb.asm | SimpleTease/asm2c | 154 | 18476 | <reponame>SimpleTease/asm2c<gh_stars>100-1000
.386p
_DATA segment use32 dword public 'DATA' ;IGNORE
db 1,2,3,4
var1 db 2,5,6
var2 dw 4,6,9
var3 dd 11,-11,2,4
var4 db 100 dup (1)
testOVerlap db 1,2,3,4,5,6,7,8,9,10,11,12,13,14
T EQU 4
_DATA ends ;IGNORE
_TEXT segment use32 dword public 'CODE' ;IGNORE
assume cs:_TEXT,ds:_DATA
start: ;IGNORE
push ds
pop es
jmp finTest
mov esi,offset var1
mov edi,offset var4
movsb
cmp [var4],2
jne failure
cmp esi,offset var1+1
jne failure
cmp edi,offset var4+1
jne failure
mov esi,offset var3
mov edi,offset var4
mov ecx,t
rep movsb
cmp dword ptr var4,11
jne failure
cmp [var4+t],1
jne failure
cmp esi,offset var3+4
jne failure
cmp edi,offset var4+4
jne failure
;mov edx,offset var1 ; DS:EDX -> $ Terminated String
;cmp edx,0
;jne failure
;mov cl, byte ptr ds:[2]
;cmp cl,6
;jne failure
finTest:
mov esi,offset testOVerlap
mov edi,esi
inc edi
mov ecx,10
rep movsb
lea edi,testOVerlap
cmp byte ptr [testOVerlap+1],1
jne failure
mov byte ptr [var1+1],5
cmp byte ptr [var1+1],5
jne failure
mov esi,offset var1
mov edi,esi
inc edi
mov ecx,10
rep movsb
lea edi,var1
cmp byte ptr [var1+2],5
je failure ; http://blog.rewolf.pl/blog/?p=177
MOV al,0
JMP exitLabel
failure:
mov al,1
exitLabel:
mov ah,4ch ; AH=4Ch - Exit To DOS
int 21h
_TEXT ends ;IGNORE
stackseg segment para stack 'STACK' ;IGNORE
db 1000h dup(?)
stackseg ends ;IGNORE
end start ;IGNORE
|
programs/oeis/103/A103460.asm | neoneye/loda | 22 | 165496 | ; A103460: a(n) = 9^n + 1 - 0^n.
; 1,10,82,730,6562,59050,531442,4782970,43046722,387420490,3486784402,31381059610,282429536482,2541865828330,22876792454962,205891132094650,1853020188851842,16677181699666570,150094635296999122,1350851717672992090,12157665459056928802,109418989131512359210,984770902183611232882,8862938119652501095930,79766443076872509863362,717897987691852588770250,6461081889226673298932242,58149737003040059690390170,523347633027360537213511522,4710128697246244834921603690,42391158275216203514294433202,381520424476945831628649898810,3433683820292512484657849089282,30903154382632612361920641803530,278128389443693511257285776231762,2503155504993241601315571986085850,22528399544939174411840147874772642,202755595904452569706561330872953770
sub $0,1
mov $1,9
pow $1,$0
mul $1,9
add $1,1
mov $0,$1
|
oeis/332/A332163.asm | neoneye/loda-programs | 11 | 17103 | ; A332163: a(n) = 6*(10^(2*n+1)-1)/9 - 3*10^n.
; Submitted by <NAME>(s2)
; 3,636,66366,6663666,666636666,66666366666,6666663666666,666666636666666,66666666366666666,6666666663666666666,666666666636666666666,66666666666366666666666,6666666666663666666666666,666666666666636666666666666,66666666666666366666666666666,6666666666666663666666666666666
add $0,1
mov $1,10
pow $1,$0
sub $1,2
mul $1,2
bin $1,2
mov $0,$1
div $0,90
mul $0,3
|
libsrc/_DEVELOPMENT/input/zx/z80/asm_in_stick_cursor.asm | meesokim/z88dk | 0 | 16811 | <gh_stars>0
; ===============================================================
; 2014
; ===============================================================
;
; uint16_t in_stick_cursor(void)
;
; Return joystick state in byte FGHIRLDU active high. The
; FGHI bits are fire buttons with "F" being primary.
;
; ===============================================================
SECTION code_input
PUBLIC asm_in_stick_cursor
asm_in_stick_cursor:
; exit : hl = F000RLDU active high
;
; uses : af, de, hl
ld a,$f7
in a,($fe)
and $10
push af
ld a,$ef
in a,($fe)
and $1f
ld e,a
ld d,0
ld hl,table
add hl,de
ld l,(hl)
ld h,d
pop af
ret nz
set 2,l
ret
table:
defb $8b,$0b,$8b,$0b
defb $83,$03,$83,$03
defb $8a,$0a,$8a,$0a
defb $82,$02,$82,$02
defb $89,$09,$89,$09
defb $81,$01,$81,$01
defb $88,$08,$88,$08
defb $80,$00,$80,$00
|
programs/oeis/028/A028950.asm | karttu/loda | 0 | 23809 | <reponame>karttu/loda
; A028950: Minimal norm of n-dimensional, strictly odd, unimodular lattice.
; 0,1,1,1,1,1,1,1,1,1,1,1,2,1,2,2,2,2,2,2,2,2,2,3,3,2,3,3,3,3,3,3,4,3
mov $2,$0
mov $4,$0
lpb $4,1
lpb $0,1
trn $2,4
trn $3,$0
mov $0,0
add $0,$2
sub $4,$3
mov $3,2
sub $4,2
lpe
add $1,1
trn $4,5
lpe
|
models/tests/test09.als | transclosure/Amalgam | 4 | 1455 | <gh_stars>1-10
module tests/test // Bugpost by <NAME> <<EMAIL>>
sig Domain {
phenomena : set Phenomena // phenomena this domain controls
, interface : set Interface // interfaces this domain participates in
}
sig DomainType extends Domain{}
sig Causal, Biddable, Lexical extends DomainType{}
sig Description extends DomainType {
describes : set Phenomena
}
fact {
Domain in DomainType
DomainType in Causal + Biddable + Lexical + Description
}
sig DevDescription {
refers : set Phenomena
, constrains : set Phenomena
}
{
no constrains & refers
no constrains.domain & refers.domain
}
sig Optative extends DevDescription {}
{
some constrains
}
sig Indicative extends DevDescription {}
{
no constrains
}
fact {
DevDescription in Optative + Indicative
}
sig Interface {
domain : set Domain,
phenomena : set Phenomena
}
{
#(this.@domain) > 1
}
fact {
all i,j : Interface | disj[i,j] => i.domain != j.domain
}
sig Phenomena {
domain : Domain
, interface : lone Interface
, affects : set Domain
}
fact {
Domain<: phenomena = ~ (Phenomena <:domain)
Interface<: phenomena = ~ (Phenomena <: interface)
Phenomena<: affects = Phenomena<: interface.domain - Phenomena<:domain
}
sig State, Event, Symbolic extends Phenomena {}
sig CausalPhenomena in Phenomena {}
fact {
Phenomena = State + Event + Symbolic
CausalPhenomena = State + Event
Phenomena<: domain.Lexical in Symbolic
}
sig Frame {
requirement : lone DevDescription
, machine, given, designed : set Domain
, phenomena : set Phenomena
, interface : set Interface
, domain : set Domain
}
{
disj[machine,given,designed]
domain = machine + given + designed
phenomena = interface.@phenomena + requirement.(refers + constrains)
phenomena = interface.@phenomena + requirement.(refers + constrains)
}
fact {
all x:Frame | {
x.phenomena = x.interface.phenomena + x.requirement.(refers + constrains)
x.phenomena = x.interface.phenomena + x.requirement.(refers + constrains)
}
}
fact {
all r : Optative | lone f : Frame | f.requirement = r
}
sig FrameDomain extends Domain {
inPhenomena : set Phenomena // phenomena which affect this domain
, outPhenomena : set Phenomena // phenomena which affect other domains
, refPhenomena : set Phenomena // phenomena which are only referenced
}
{
no phenomena & inPhenomena
inPhenomena = { p : Phenomena | p.affects = this}
outPhenomena = { p : this.@phenomena | some p.affects }
refPhenomena = phenomena - outPhenomena
}
sig FrameAnalysis extends Frame {
display, operator, realworld, controlled, workpiece, input, output :set Domain
, feedback : set Interface
}
fact {
all f : FrameAnalysis {
all d : Domain {
d in f.domain and d in Causal and some d.inPhenomena & f.phenomena and no d.outPhenomena & f.phenomena
and some d.phenomena & Symbolic & f.phenomena <=> d in f.display
d in f.domain and d in Biddable and no d.inPhenomena & f.phenomena and some d.outPhenomena & CausalPhenomena & f.phenomena <=> d in f.operator
d in f.domain and d in Causal and no d.inPhenomena & f.phenomena and some d.outPhenomena & CausalPhenomena & f.phenomena and d !in f.machine <=> d in f.realworld
d in f.domain and d in Causal and some d.inPhenomena & CausalPhenomena & f.phenomena
and some (d.inPhenomena.domain & f.machine )
and d !in f.machine
<=> d in f.controlled
d in f.domain and d in Lexical and some d.inPhenomena & f.phenomena and some d.outPhenomena & f.phenomena <=> d in f.workpiece
d in f.domain and d in Lexical and no d.inPhenomena & f.phenomena and some d.outPhenomena & Symbolic & f.phenomena <=> d in f.input
d in f.domain and d in Lexical and some d.inPhenomena & Symbolic & f.phenomena and no d.outPhenomena & f.phenomena <=> d in f.output
some f.requirement.refers =>
f.requirement.constrains in
f.requirement.refers.domain.^
((Domain<: phenomena & f.domain -> f.phenomena).
(Phenomena<:interface & f.phenomena -> f.interface).
(Interface<:domain & f.interface -> f.domain)).
(Domain<:phenomena & f.domain -> f.phenomena)
}
all i : Interface {
i in f.interface and (all d : i.domain & f.domain| some p :
i.phenomena & f.phenomena | d in p.affects )
<=> i in f.feedback
}
}
}
fact {
Frame in FrameAnalysis
Domain in FrameDomain
}
sig ContextDiagram extends Frame{}
{
no this.@phenomena
}
sig ProblemFrame extends Frame {}
{
one requirement
}
pred frameOnly
{
Phenomena in Frame.phenomena
Domain in Frame.domain
Interface in Frame.interface
DevDescription in Frame.requirement
}
pred t1 {
one ProblemFrame
#Domain = 2
one f : Frame | one r: f.requirement | one r.refers
#Frame = 1
#Phenomena = 3
#Interface = 1
#Optative = 1
#DevDescription = 1
}
run t1 for 4 expect 0
|
orka/src/orka/interface/orka-simulation_jobs.ads | onox/orka | 52 | 21494 | <reponame>onox/orka
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2018 onox <<EMAIL>>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Ada.Real_Time;
with Orka.Behaviors;
with Orka.Cameras;
with Orka.Jobs;
with Orka.Rendering.Fences;
with Orka.Simulation;
with Orka.Transforms.Singles.Vectors;
with Orka.Windows;
private package Orka.Simulation_Jobs is
use Ada.Real_Time;
type Buffer_Region_Type is mod 4;
package Transforms renames Orka.Transforms.Singles.Vectors;
package Fences is new Orka.Rendering.Fences (Buffer_Region_Type);
-----------------------------------------------------------------------------
function Clone_Fixed_Update_Job
(Job : Jobs.Parallel_Job_Ptr;
Length : Positive) return Jobs.Dependency_Array;
function Create_Fixed_Update_Job
(Scene : not null Behaviors.Behavior_Array_Access;
Time_Step : Time_Span;
Count : Natural) return Jobs.Parallel_Job_Ptr;
function Create_Finished_Job
(Scene : not null Behaviors.Behavior_Array_Access;
Time_Step : Time_Span;
Position : Behaviors.Vector4;
Batch_Length : Positive) return Jobs.Job_Ptr;
-----------------------------------------------------------------------------
function Create_Start_Render_Job
(Fence : not null access Fences.Buffer_Fence) return Jobs.Job_Ptr;
function Create_Scene_Render_Job
(Render : Simulation.Render_Ptr;
Scene : not null Behaviors.Behavior_Array_Access;
Camera : Cameras.Camera_Ptr) return Jobs.Job_Ptr;
function Create_Finish_Render_Job
(Fence : not null access Fences.Buffer_Fence) return Jobs.Job_Ptr;
end Orka.Simulation_Jobs;
|
oeis/295/A295726.asm | neoneye/loda-programs | 11 | 20911 | <gh_stars>10-100
; A295726: a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = -1, a(2) = 1, a(3) = 1.
; Submitted by <NAME>
; 0,-1,1,1,6,9,23,36,75,119,226,361,651,1044,1823,2931,5010,8069,13591,21916,36531,58959,97538,157521,259155,418724,686071,1108891,1811346,2928429,4772543,7717356,12555435,20305559,32992066,53363161,86617371,140111604,227253263,367627011,595928850,964080149,1562106151,2527234876,4093535331,6622867359,10724791298,17351852961,28093421475,45453663044,73580638951,119051079211,192698827026,311783460669,504616505423,816467074956,1321352015835,2137953308519,3459842195266,5598063939241,9058979876331
mov $1,1
lpb $0
sub $0,1
add $1,$3
add $4,$5
sub $3,$4
mov $4,$2
mov $2,$3
mov $3,$5
add $4,$1
mul $1,2
add $4,$2
sub $4,2
add $5,$2
lpe
mov $0,$4
|
oeis/002/A002279.asm | neoneye/loda-programs | 11 | 244729 | <reponame>neoneye/loda-programs
; A002279: a(n) = 5*(10^n - 1)/9.
; 0,5,55,555,5555,55555,555555,5555555,55555555,555555555,5555555555,55555555555,555555555555,5555555555555,55555555555555,555555555555555,5555555555555555,55555555555555555,555555555555555555,5555555555555555555,55555555555555555555,555555555555555555555,5555555555555555555555,55555555555555555555555,555555555555555555555555,5555555555555555555555555,55555555555555555555555555,555555555555555555555555555,5555555555555555555555555555,55555555555555555555555555555,555555555555555555555555555555
mov $1,10
pow $1,$0
div $1,9
mul $1,5
mov $0,$1
|
src/Delay/W1S/W1S.asm | randombenj/uController | 2 | 98938 | <gh_stars>1-10
;===============================================================================
;- Programm: W1S
;-
;- Dateinname: W1S.asm
;- Version: 1.0
;- Autor: <NAME>
;-
;- Verwendungszweck: uP-Schulung
;-
;- Beschreibung:
;- Delay for 1 Second
;-
;-
;- Entwicklungsablauf:
;- Ver: Datum: Autor: Entwicklungsschritt: Zeit:
;- 1.0 01.01.13 FAB Ganzes Programm erstellt Min.
;-
;- Totalzeit: Min.
;-
;- Copyright: <NAME>, Sonneggstrasse 13, 6410 Goldau (2013)
;------------------------------------------------------------------------------
;--- Kontrollerangabe ---
.include "m2560def.inc"
RJMP Reset
;--- Konstanten ---
.equ LED = PORTB ; Ausgabeport fuer LED
.equ LED_D = DDRB ; Daten Direction Port fuer LED
.equ SWITCH = PIND ; Eingabeport fuer SWITCH
.equ SWITCH_D = DDRD ; Daten Direction Port fuer SWITCH
;--- Variablen ---
.def mpr = R16 ; Multifunktionsregister
;------------------------------------------------------------------------------
; Hauptprogramm
;------------------------------------------------------------------------------
;--- Initialisierung ---
Reset: SER mpr ; Output:= LED
OUT LED_D, mpr
CLR mpr ; Input:= Schalterwerte
OUT SWITCH_D, mpr
LDI mpr, LOW(RAMEND) ; Stack initialisieren
OUT SPL,mpr
LDI mpr, HIGH(RAMEND)
OUT SPH,mpr
;--- Hauptprogramm ---
Main: ; Main() function
RCALL W1S ; W1S()
RJMP Main ; GoTo: Main
;------------------------------------------------------------------------------
; Unterprogramme
;------------------------------------------------------------------------------
W1S: ; W100MS() function
PUSH mpr ; save <mpr> to stack
IN mpr, SREG ; <mpr> = <SREG>
PUSH mpr ; save <SREG> to stack
LDI mpr, $09 ; <mpr> = 10
W1S_LOOP01: ; LOOP:
RCALL W100MS ; W10MS()
DEC mpr ; <mpr>--
BRNE W1S_LOOP01 ; if <mpr> > 0: LOOP
LDI mpr, $09 ; <mpr> = 10
W1S_LOOP02: ; LOOP:
RCALL W10MS ; W10MS()
DEC mpr ; <mpr>--
BRNE W1S_LOOP02 ; if <mpr> > 0: LOOP
LDI mpr, $09 ; <mpr> = 10
W1S_LOOP03: ; LOOP:
RCALL W1MS ; W1MS()
RCALL W100US ; W100US()
DEC mpr ; <mpr>--
BRNE W1S_LOOP03 ; if <mpr> > 0: LOOP
LDI mpr, $AF ; <mpr> = 120
W1S_LOOP04: ; LOOP:
NOP ; wait 1 clock
DEC mpr ; <mpr>--
BRNE W1S_LOOP04 ; if <mpr> > 0: LOOP
POP mpr ; loat <SREG> from stack
OUT SREG, mpr ; <SREG> = <mpr>
POP mpr ; load <mpr> from stack
RET ; return <void>
W100MS: ; W100MS() function
PUSH mpr ; save <mpr> to stack
IN mpr, SREG ; <mpr> = <SREG>
PUSH mpr ; save <SREG> to stack
LDI mpr, $09 ; <mpr> = 10
W100MS_LOOP01: ; LOOP:
RCALL W10MS ; W10MS()
DEC mpr ; <mpr>--
BRNE W100MS_LOOP01 ; if <mpr> > 0: LOOP
LDI mpr, $09 ; <mpr> = 10
W100MS_LOOP02: ; LOOP:
RCALL W1MS ; W1MS()
RCALL W100US ; W100US()
DEC mpr ; <mpr>--
BRNE W100MS_LOOP02 ; if <mpr> > 0: LOOP
LDI mpr, $B5 ; <mpr> = 120
W100MS_LOOP03: ; LOOP:
NOP ; wait 1 clock
DEC mpr ; <mpr>--
BRNE W100MS_LOOP03 ; if <mpr> > 0: LOOP
// this is needed for accuracy
NOP ; wait 1 clock
NOP ; wait 1 clock
NOP ; wait 1 clock
POP mpr ; loat <SREG> from stack
OUT SREG, mpr ; <SREG> = <mpr>
POP mpr ; load <mpr> from stack
RET ; return <void>
W10MS: ; function W1MS():
PUSH mpr ; save <mpr> to stack
IN mpr, SREG ; <mpr> = <SREG>
PUSH mpr ; save <SREG> to stack
LDI mpr, $63 ; <mp> = 99
W10MS_LOOP01: ; LOOP:
RCALL W100US ; W100US()
DEC mpr ; <mpr>--
BRNE W10MS_LOOP01 ; if mpr > 0: GoTo: W1MS_LOOP01
// this is needed for accuracy
LDI mpr, $79 ; <mpr> = 120
W10MS_LOOP02: ; LOOP:
NOP ; wait 1 clock
DEC mpr ; <mpr>--
BRNE W10MS_LOOP02 ; if <mpr> > 0: LOOP
POP mpr ; loat <SREG> from stack
OUT SREG, mpr ; <SREG> = <mpr>
POP mpr ; load <mpr> from stack
RET ; return <void>
W1MS: ; function W1MS():
PUSH mpr ; save <mpr> to stack
IN mpr, SREG ; <mpr> = <SREG>
PUSH mpr ; save <SREG> to stack
LDI mpr, $09 ; <mp> = 9
W1MS_LOOP01: ; LOOP:
RCALL W100US ; W100US()
DEC mpr ; <mpr>--
BRNE W1MS_LOOP01 ; if mpr > 0: GoTo: W1MS_LOOP01
// this is needed for accuracy
LDI mpr, $BC ; <mpr> = 188
W1MS_LOOP02: ; LOOP:
NOP ; wait 1 clock
DEC mpr ; <mpr>--
BRNE W1MS_LOOP02 ; if <mpr> > 0: LOOP
NOP ; wait 1 clock
NOP ; wait 1 clock
POP mpr ; loat <SREG> from stack
OUT SREG, mpr ; <SREG> = <mpr>
POP mpr ; load <mpr> from stack
RET ; return <void>
W100US: ; function W100US():
PUSH mpr ; save <mpr> to stack
IN mpr, SREG ; <mpr> = <SREG>
PUSH mpr ; save <SREG> to stack
LDI mpr, $C3 ; <mpr> = 195
W100US_LOOP01: ; LOOP:
NOP ; wait 1 clock
DEC mpr ; <mpr>--
BRNE W100US_LOOP01 ; if <mpr> > 0: LOOP
// this is needed for accuracy
NOP
POP mpr ; loat <SREG> from stack
OUT SREG, mpr ; <SREG> = <mpr>
POP mpr ; load <mpr> from stack
RET ; return <void>
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a31e.ada | best08618/asylo | 7 | 24250 | -- CD2A31E.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT WHEN A SIZE SPECIFICATION IS GIVEN FOR AN
-- INTEGER TYPE, THEN SUCH A TYPE CAN BE PASSED AS AN ACTUAL
-- PARAMETER TO GENERIC PROCEDURES.
-- HISTORY:
-- JET 08/12/87 CREATED ORIGINAL TEST.
-- BCB 10/18/88 MODIFIED HEADER AND ENTERED IN ACVC.
-- DHH 04/06/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA', CHANGED
-- SIZE CLAUSE VALUE TO 9, AND CHANGED 'SIZE CLAUSE
-- CHECKS.
-- JRL 03/27/92 ELIMINATED REDUNDANT TESTING.
WITH REPORT; USE REPORT;
PROCEDURE CD2A31E IS
TYPE BASIC_INT IS RANGE -100 .. 100;
BASIC_SIZE : CONSTANT := 9;
FOR BASIC_INT'SIZE USE BASIC_SIZE;
BEGIN
TEST ("CD2A31E", "CHECK THAT WHEN A SIZE SPECIFICATION IS " &
"GIVEN FOR AN INTEGER TYPE, THEN SUCH A TYPE " &
"CAN BE PASSED AS AN ACTUAL PARAMETER TO " &
"GENERIC PACKAGES AND PROCEDURES");
DECLARE -- TYPE DECLARATION WITHIN GENERIC PROCEDURE.
GENERIC
TYPE GPARM IS RANGE <>;
PROCEDURE GENPROC;
PROCEDURE GENPROC IS
SUBTYPE INT IS GPARM;
I1 : INT := -100;
I2 : INT := 0;
I3 : INT := 100;
FUNCTION IDENT (I : INT) RETURN INT IS
BEGIN
IF EQUAL (0,0) THEN
RETURN I;
ELSE
RETURN 0;
END IF;
END IDENT;
BEGIN -- GENPROC.
IF INT'SIZE /= IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR INT'SIZE");
END IF;
IF I1'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR I1'SIZE");
END IF;
IF NOT ((I1 < IDENT (0)) AND
(IDENT (I3) > IDENT (I2)) AND
(I2 <= IDENT (0)) AND
(IDENT (100) = I3)) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL " &
"OPERATORS");
END IF;
IF NOT (((I1 + I3) = I2) AND
((I2 - I3) = I1) AND
((I3 * I2) = I2) AND
((I2 / I1) = I2) AND
((I1 ** 1) = I1) AND
((I1 REM 9) = IDENT (-1)) AND
((I3 MOD 9) = IDENT (1))) THEN
FAILED ("INCORRECT RESULTS FOR BINARY ARITHMETIC " &
"OPERATORS");
END IF;
IF INT'LAST /= IDENT (100) THEN
FAILED ("INCORRECT VALUE FOR INT'LAST");
END IF;
IF INT'VAL (-100) /= IDENT (I1) OR
INT'VAL (0) /= IDENT (I2) OR
INT'VAL (100) /= IDENT (I3) THEN
FAILED ("INCORRECT VALUE FOR INT'VAL");
END IF;
IF INT'PRED (I2) /= IDENT (-1) OR
INT'PRED (I3) /= IDENT (99) THEN
FAILED ("INCORRECT VALUE FOR INT'PRED");
END IF;
IF INT'VALUE ("-100") /= IDENT (I1) OR
INT'VALUE (" 0") /= IDENT (I2) OR
INT'VALUE (" 100") /= IDENT (I3) THEN
FAILED ("INCORRECT VALUE FOR INT'VALUE");
END IF;
END GENPROC;
PROCEDURE NEWPROC IS NEW GENPROC (BASIC_INT);
BEGIN
NEWPROC;
END;
RESULT;
END CD2A31E;
|
oeis/039/A039649.asm | neoneye/loda-programs | 11 | 246299 | ; A039649: a(n) = phi(n)+1.
; Submitted by <NAME>
; 2,2,3,3,5,3,7,5,7,5,11,5,13,7,9,9,17,7,19,9,13,11,23,9,21,13,19,13,29,9,31,17,21,17,25,13,37,19,25,17,41,13,43,21,25,23,47,17,43,21,33,25,53,19,41,25,37,29,59,17,61,31,37,33,49,21,67,33,45,25,71,25,73,37,41,37,61,25,79,33,55,41,83,25,65,43,57,41,89,25,73,45,61,47,73,33,97,43,61,41
add $0,1
mov $2,$0
lpb $2
mov $3,$2
gcd $3,$0
cmp $3,1
add $1,$3
sub $2,1
lpe
mov $0,$1
add $0,1
|
03-bootsector-memory/boot_sect_memory_3.asm | gyuki1029/os-tutorial | 0 | 247429 | mov ah, 0x0e
; attempt 3
; Add the BIOS starting offset 0x7c00 to the memory address of the X
; and then dereference the contents of that pointer.
; We need the help of a different register 'bx' because 'mov al, [ax]' is illegal.
; A register can't be used as source and destination for the same command.
mov al, "3"
int 0x10
mov bx, the_secret
add bx, 0x7c00
mov al, [bx]
int 0x10
jmp $ ; infinite loop
the_secret:
; ASCII code 0x58 ('X') is stored just before the zero-padding.
; On this code that is at byte 0x2d (check it out using 'xxd file.bin')
db "X"
; zero padding and magic bios number
times 510-($-$$) db 0
dw 0xaa55
|
valor-ql/src/main/antlr4/Valor.g4 | CyberAgent/valor | 0 | 2813 | grammar Valor;
tokens{
TOK_EXPLAIN,
TOK_QUERY,
TOK_SELECT,
TOK_CREATE_RELATION,
TOK_DROP_RELATION,
TOK_RELATION_ATTRS,
TOK_RELATION_ATTR,
TOK_ATTR_TYPE,
TOK_ARRAY_ATTR_TYPE,
TOK_MAP_ATTR_TYPE,
TOK_RELATION_OPTS,
TOK_RELATION_OPT,
TOK_KEY_LIST,
TOK_CREATE_SCHEMA,
TOK_DROP_SCHEMA,
TOK_OVERWRITE,
TOK_SCHEMA_DEF,
TOK_PRIMARY_SCHEMA,
TOK_SCHEMA_MODE,
TOK_FORMAT_DEF,
TOK_ELEMENT,
TOK_ELEMENT_DEF,
TOK_ATTR_ELEMENT_DEF,
TOK_CONST_ELEMENT_DEF,
TOK_DECORATOR_DEF,
TOK_SCHEMA_OPTION,
TOK_ALTER_SET_SCHEMA_MODE,
TOK_ALTER_RELATION,
TOK_REPAIR_RELATION,
TOK_USING,
TOK_DESCRIBE,
TOK_SHOW_RELATIONS,
TOK_SHOW_SCHEMAS,
TOK_INSERT,
TOK_UPDATE,
TOK_DELETE,
TOK_FROM,
TOK_INTO,
TOK_ATTR_NAMES,
TOK_VALUES,
TOK_ATTRS,
TOK_ATTR,
TOK_ATTR_NAME,
TOK_ATTR_VALUE,
TOK_SELECT_ITEMS,
TOK_SELECT_ITEM,
TOK_WHERE,
TOK_LIMIT,
TOK_OFFSET,
TOK_NULL,
TOK_ISNULL,
TOK_ISNOTNULL,
TOK_BETWEEN,
TOK_IN,
TOK_WITH_UNKNOWN,
TOK_WITHOUT_UNKNOWN,
TOK_FUNCTION,
TOK_FUNCTION_ARGUMENT,
TOK_COMPLEX_CONST,
TOK_TRUE,
TOK_FALSE,
TOK_BOOLEAN
}
@header {
package jp.co.cyberagent.valor.ql.grammer.gen;
}
// starting rule
statement:
execStatement EOF
;
execStatement:
showRelationsStatement
| showSchemasStatement
| describeStatement
| insertStatementExpression
| updateStatementExpression
| deleteStatementExpression
| selectStatementExpression
;
showRelationsStatement:
KW_SHOW KW_RELATIONS
;
showSchemasStatement:
KW_SHOW KW_SCHEMAS KW_FOR Identifier
;
describeStatement:
KW_DESCRIBE relationId=Identifier (DOT schemaId=Identifier)?
;
insertStatementExpression:
KW_INSERT KW_INTO relationSource (KW_VALUES LPAREN attrNames RPAREN)? valuesClause
;
relationSource:
relationId=Identifier (DOT schemaId=Identifier)?
;
attrNames:
Identifier (COMMA Identifier)*
;
valuesClause:
KW_VALUES valueItem+
;
valueItem:
LPAREN constant (COMMA constant)* RPAREN
;
attributesValueClause:
attribute (COMMA attribute)*
;
// TODO use attrName instead of Identifier
attribute:
attrName=attributeName EQUAL attrValue=expression
;
updateStatementExpression:
KW_UPDATE relationId=Identifier (DOT schemaId=Identifier)? KW_SET attributesValueClause whereClause
;
deleteStatementExpression:
KW_DELETE fromClause whereClause limitClause?
;
selectStatementExpression :
KW_SELECT selectItems fromClause whereClause? limitClause? offsetClause?
;
selectItems:
selectItem (COMMA selectItem)*
;
selectItem:
expression
| STAR
;
fromClause:
KW_FROM relationSource
;
whereClause:
KW_WHERE searchCondition
;
searchCondition:
expression ;
attributeName:
BACKQUOTE? Identifier BACKQUOTE?
| BACKQUOTE? keywords BACKQUOTE?
;
limitClause:
KW_LIMIT num=IntegerLiteral
;
offsetClause:
KW_OFFSET num=IntegerLiteral
;
atomExpression :
constant
| attributeName
| functionExpression
| LPAREN expression RPAREN
;
expression:
orExpression
;
orOperator:
KW_OR ;
orExpression:
andExpression (orOperator andExpression)*;
andOperator:
KW_AND ;
andExpression:
notExpression (andOperator notExpression)*;
notOperator:
KW_NOT;
notExpression :
notOperator? predicate
;
compareOperator :
EQUAL
|NOTEQUAL
|LIKE
|REGEXP
|GREATERTHAN
|GREATERTHANOREQUAL
|LESSTHAN
|LESSTHANOREQUAL
;
predicate :
atomExpression
| binaryPredicateExpression
| isNullExpression
| betweenExpression
| inExpression
;
binaryPredicateExpression:
left=plusExpression compareOperator right=plusExpression
;
isNullExpression:
left=plusExpression KW_IS KW_NOT? KW_NULL
;
betweenExpression:
left=plusExpression KW_BETWEEN (min = plusExpression) KW_AND (max=plusExpression)
;
inExpression:
left=plusExpression KW_IN LPAREN candidates += plusExpression (COMMA candidates+=plusExpression)* RPAREN
;
plusOperator:
PLUS | MINUS
;
plusExpression:
multiplyExpression (plusOperator multiplyExpression)*
;
multiplyOperator:
STAR | DIV
;
multiplyExpression:
collectionElementExpression (multiplyOperator collectionElementExpression)*
;
collectionElementExpression:
collection=atomExpression (LSQUARE index=atomExpression RSQUARE)?
;
functionExpression:
functionName=Identifier LPAREN (expression (COMMA expression)*)? RPAREN
;
constant :
LongLiteral
| IntegerLiteral
| BytesLiteral
| DoubleLiteral
| FloatLiteral
| StringLiteral
| BooleanLiteral
| arrayLiteral
| mapLiteral
| setLiteral
| QUESTION
| KW_NULL
;
arrayLiteral:
KW_ARRAY LPAREN ((constant (COMMA constant)*))? RPAREN
;
setLiteral:
KW_SET LPAREN ((constant (COMMA constant)*))? RPAREN
;
mapLiteral:
KW_MAP LPAREN (constant COMMA constant (COMMA constant COMMA constant)*)? RPAREN
;
keywords:
KW_EXPLAIN
| KW_UNKNOWN
|KW_RELATION
|KW_TABLE
|KW_INCLUDE
|KW_EXCLUDE
|KW_FOR
|KW_ROW
|KW_FAMILY
|KW_QUALIFIER
|KW_VALUE
|KW_SELECT
|KW_CREATE
|KW_EXISTS
|KW_EVEN
|KW_ALTER
|KW_REPAIR
|KW_USING
|KW_MODE
|KW_DROP
|KW_INSERT
|KW_UPDATE
|KW_DELETE
|KW_DESCRIBE
|KW_SHOW
|KW_RELATIONS
|KW_PRIMARY
|KW_SCHEMA
|KW_SCHEMAS
|KW_VALUES
|KW_INTO
|KW_FROM
|KW_SET
|KW_WHERE
|KW_LIMIT
|KW_OFFSET
|KW_MAP
|KW_ARRAY
;
KW_EXPLAIN: 'EXPLAIN';
KW_UNKNOWN: 'UNKNOWN';
KW_RELATION: 'RELATION';
KW_TABLE: 'TABLE';
KW_INCLUDE: 'INCLUDE';
KW_EXCLUDE: 'EXCLUDE';
KW_FOR: 'FOR';
KW_ROW: 'ROW';
KW_FAMILY: 'FAMILY';
KW_QUALIFIER: 'QUALIFIER';
KW_VALUE: 'VALUE';
KW_SELECT: 'SELECT';
KW_CREATE: 'CREATE';
KW_IF: 'IF';
KW_NOT: 'NOT';
KW_EXISTS: 'EXISTS';
KW_EVEN: 'EVEN';
KW_ALTER: 'ALTER';
KW_REPAIR: 'REPAIR';
KW_USING: 'USING';
KW_MODE: 'MODE';
KW_DROP: 'DROP';
KW_INSERT: 'INSERT';
KW_UPDATE: 'UPDATE';
KW_DELETE: 'DELETE';
KW_DESCRIBE: 'DESCRIBE';
KW_SHOW: 'SHOW';
KW_RELATIONS: 'RELATIONS';
KW_PRIMARY: 'PRIMARY';
KW_SCHEMA: 'SCHEMA';
KW_SCHEMAS: 'SCHEMAS';
KW_VALUES: 'VALUES';
KW_INTO: 'INTO';
KW_FROM: 'FROM';
KW_SET: 'SET';
KW_WHERE: 'WHERE';
KW_LIMIT: 'LIMIT';
KW_OFFSET: 'OFFSET';
KW_AND: 'AND';
KW_OR: 'OR';
KW_IS: 'IS';
KW_NULL: 'NULL';
KW_BETWEEN: 'BETWEEN';
KW_IN: 'IN';
KW_MAP: 'MAP';
KW_ARRAY: 'ARRAY';
// operators
DOT : '.'; // generated as a part of Number rule
COLON : ':' ;
COMMA : ',' ;
SEMICOLON : ';' ;
X :'X';
QUESTION : '?';
BACKQUOTE: '`';
LPAREN : '(' ;
RPAREN : ')' ;
LSQUARE : '[' ;
RSQUARE : ']' ;
LCURLY : '{';
RCURLY : '}';
EQUAL : '='|'==';
NOTEQUAL : '!=';
LIKE : 'LIKE';
REGEXP : 'REGEXP';
GREATERTHAN : '>';
GREATERTHANOREQUAL : '>=';
LESSTHAN : '<';
LESSTHANOREQUAL : '<=';
PLUS: '+';
MINUS: '-';
STAR : '*';
DIV: '/';
// LITERALS
fragment
Letter:
NameStartChar NameChar*
;
fragment
NameChar
: NameStartChar
| '0'..'9'
| '_'
| '.'
| '\u00B7'
| '\u0300'..'\u036F'
| '\u203F'..'\u2040'
;
fragment
NameStartChar
: 'A'..'Z' | 'a'..'z'
| '\u00C0'..'\u00D6'
| '\u00D8'..'\u00F6'
| '\u00F8'..'\u02FF'
| '\u0370'..'\u037D'
| '\u037F'..'\u1FFF'
| '\u200C'..'\u200D'
| '\u2070'..'\u218F'
| '\u2C00'..'\u2FEF'
| '\u3001'..'\uD7FF'
| '\uF900'..'\uFDCF'
| '\uFDF0'..'\uFFFD'
;
fragment
Digit
:
'0'..'9'
;
fragment
IntegerNumber
: '0'
| '1'..'9' ('0'..'9')* ;
fragment
LongSuffix:
'l'|'L';
fragment
FloatSuffix:
'f'|'F';
fragment
ByteNumber
: '0' X(('0'..'9'|'a'..'z' | 'A'..'Z') ('0'..'9'|'a'..'z' | 'A'..'Z'))+;
fragment
EscapeSequence
: '\\' [btnfr"'\\]
;
StringLiteral
:
'"' (~["\\\r\n] | EscapeSequence)* '"'
| '\'' (~['\\\r\n] | EscapeSequence)* '\''
;
LongLiteral
:
(MINUS)? IntegerNumber LongSuffix
;
IntegerLiteral
:
(MINUS)? IntegerNumber
;
DoubleLiteral
:
(MINUS)? IntegerNumber DOT IntegerNumber+
;
FloatLiteral
:
(MINUS)? IntegerNumber DOT IntegerNumber+ FloatSuffix
;
BytesLiteral
:
ByteNumber
;
Identifier
:
(Letter | Digit) (Letter | Digit | '_' | '-' )*
;
WS : (' '|'\t'|'\r'|'\n') -> skip
;
COMMENT
: '/*' .*? '*/' -> skip
;
LINE_COMMENT
: '//' ~('\n'|'\r')* '\r'? '\n' -> skip
;
|
RefactorAgdaEngine/Test/Tests/input/ExtractFunction.agda | omega12345/RefactorAgda | 5 | 7130 | {-# OPTIONS --allow-unsolved-metas #-}
module ExtractFunction where
open import Agda.Builtin.Nat
open import Agda.Builtin.Bool
plus : Nat -> Nat -> Nat
plus = {! !}
function1 : (x : Nat) -> (y : Nat) -> Nat
function1 x y = plus x y
pickTheFirst : Nat -> Bool -> Nat
pickTheFirst x y = x
function2 : Nat -> Bool -> Nat
function2 x y = pickTheFirst x y
|
WordScript.applescript | DavidWingate/WordScript | 2 | 1618 | -- WordScript for BibDesk
---
-- MIT License
-- Copyright (c) 2020 <NAME>
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
---
-- Acknowledgements
-- The basic functionality of this software was inspired by three existing projects:
-- - BibFuse by <NAME> (http://bibfuse.sourceforge.net)
-- - BibDeskToWord by <NAME>
-- - NatBib Reference Sheet by <NAME> (http://merkel.texture.rocks/Latex/natbib.php)
-- Many thanks to the authors of these projects for sharing their hard work.
---
-- check that Word and BibDesk are ready
tell application "System Events"
set {countWord, countBibDesk} to {0, 0}
if (exists of process "Microsoft Word") is true then
set countWord to (count of documents in application "Microsoft Word")
end if
if (exists of process "BibDesk") is true then
set countBibDesk to (count of documents in application "BibDesk")
end if
end tell
if {countWord, countBibDesk} contains 0 then
activate
try
display dialog "Documents must be open in both Microsoft Word and BibDesk" buttons {"Cancel", "Open Now"} default button "Open Now"
if button returned of result contains "Open Now" then
tell application "BibDesk"
launch
end tell
delay 3
end if
on error
return
end try
end if
-- check for selection in Word to trigger quick format
tell application "Microsoft Word"
if content of text object of first paragraph of selection contains "ADDIN" then
select text object of first paragraph of selection -- select recently edited reference
end if
set selectionStart to (selection start of selection)
set selectionEnd to (selection end of selection)
end tell
if selectionStart is not selectionEnd then
readBibliographySettings()
set bibliographySettings to result
if bibliographySettings is {} then
defaultSettings()
set bibliographySettings to result
writeBibliographySettings(bibliographySettings)
set bibliographySettings to result
if bibliographySettings is {} then
return
end if
end if
formatReferences(bibliographySettings)
return
end if
-- open WordScript Menu
activate
with timeout of 0 seconds
choose from list {"Format References", "Unformat References", "Fill Empty References", "Tools", "Document Settings"} with title "WordScript" with prompt "You should save your work first!" default items "Format References" cancel button name {"Exit"} OK button name {"Choose"}
set menuChoice to result
end timeout
if menuChoice is false then
return
end if
if menuChoice contains "Format References" then
readBibliographySettings()
set bibliographySettings to result
if bibliographySettings is {} then
defaultSettings()
set bibliographySettings to result
writeBibliographySettings(bibliographySettings)
set bibliographySettings to result
if bibliographySettings is {} then
return
end if
end if
formatReferences(bibliographySettings)
else if menuChoice contains "Unformat References" then
unformatReferences()
else if menuChoice contains "Fill Empty References" then
fillEmptyReferences()
else if menuChoice contains "Document Settings" then
readBibliographySettings()
set bibliographySettings to result
if bibliographySettings is {} then
defaultSettings()
set bibliographySettings to result
writeBibliographySettings(bibliographySettings)
set bibliographySettings to result
if bibliographySettings is {} then
return
end if
end if
settingsMenu(bibliographySettings)
if result is not bibliographySettings then
set bibliographySettings to result
writeBibliographySettings(bibliographySettings)
set bibliographySettings to result
if bibliographySettings is {} then
return
end if
try
tell application "Microsoft Word"
activate
display dialog "Settings have been changed, do you wish to format the references now?"
end tell
formatReferences(bibliographySettings)
on error
return
end try
else
return
end if
else if menuChoice contains "Tools" then
try
display dialog "References must be unformatted, do you wish to unformat now?"
unformatReferences()
on error
return
end try
toolsMenu()
try
activate
display dialog "Operation complete, do you wish to format the references now?"
readBibliographySettings()
set bibliographySettings to result
formatReferences(bibliographySettings)
on error
return
end try
end if
---
on defaultSettings()
set bibDeskDocumentName to ""
set bibliographyTemplatePath to ""
set citepTemplatePath to ""
set citetTemplatePath to ""
set parenthesisOpen to "("
set parenthesisClose to ")"
set bibliographySortBy to "Cite Key" -- BibDesk field (leave blank for order of appearance)
set bibliographyStyle to "Bibliography" -- leave blank to use formatting of template file
set italicLatin to {"et al.", "ibid.", "cf.", "inter alia", "circa"}
set italicPublicationTypes to {"film", "broadcast"}
set superscriptReferences to "No"
set numberedReferences to "No" -- overrides templates and sorting
set numberSeperator to ","
return {bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator}
end defaultSettings
---
on readBibliographySettings()
-- global setup
tell application "Microsoft Word"
set wordDocument to active document
set selectionRange to create range wordDocument start (selection start of selection) end (selection end of selection)
set status bar to "Reading bibliography..."
end tell
-- look for a formatted bibliography
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
set fieldCount to (count of fields in wordDocument)
repeat until fieldCount is 0
set currentField to (field fieldCount of wordDocument)
set fieldCode to content of field code of currentField
if field type of currentField is field addin and word 2 of fieldCode contains "bibliography" then
set bibliographySettings to characters 21 thru -2 of fieldCode as string
exit repeat
end if
set fieldCount to fieldCount - 1
end repeat
if fieldCount is 0 then -- look for an unformatted bibliography
set findObject to find object of selection -- set up the find system in Word
set match wildcards of findObject to true
set wrap of findObject to find continue
set content of findObject to "\\\\bibliography*\\}"
select (create range wordDocument start 0 end 0)
try -- count the number of instances found
set findCount to 0
repeat while (execute find findObject)
set findCount to findCount + 1
end repeat
on error -- this can break if advanced find and replace has been used in Word
display dialog "Something is wrong with the find system in Microsoft Word, please quit Microsoft Word then re-open" buttons {"OK"} cancel button {"OK"} default button {"OK"}
return
end try
if the findCount is not 0 then -- extract raw bibiography settings
set bibliographySettings to characters 15 thru -2 of (content of selection as string) as string
else if findCount is 0 then -- no bibliography found
return {}
end if
end if
end tell
try -- extract bibliography settings as a list
set AppleScript's text item delimiters to {"<bibDeskDocumentName=", "><bibliographyTemplatePath=", "><citepTemplatePath=", "><citetTemplatePath=", "><parenthesisOpen=", "><parenthesisClose=", "><bibliographySortBy=", "><bibliographyStyle=", "><italicLatin=", "><italicPublicationTypes=", "><superscriptReferences=", "><numberedReferences=", "><numberSeperator=", ">"}
set {bibliographyCommand, bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator} to text items of bibliographySettings
on error -- if anything is amiss, recreate the bibliography field
tell application "Microsoft Word"
display dialog "There is something wrong with the bibliography data, please delete the bibliography and try again" buttons {"OK"} default button {"OK"}
end tell
return
end try
set AppleScript's text item delimiters to "," -- recover lists from settings
set italicLatin to text items of italicLatin
set italicPublicationTypes to text items of italicPublicationTypes
set AppleScript's text item delimiters to ""
try -- check to make sure that the template files exist
tell application "Finder"
get (exists of (POSIX file (bibliographyTemplatePath as string) as alias))
get (exists of (POSIX file (citepTemplatePath as string) as alias))
get (exists of (POSIX file (citetTemplatePath as string) as alias))
end tell
on error -- if not, recreate the bibliography field
tell application "Microsoft Word"
display dialog "Template files not found, please delete the bibliography and try again" buttons {"OK"} default button {"OK"}
end tell
return
end try
-- restore Word to its original position
tell application "Microsoft Word"
try
select selectionRange
on error -- produces error if cursor was at the end of the document
select (create range wordDocument start (selection end of selection) end (selection end of selection))
end try
set status bar to "Finished reading bibliography"
end tell
return {bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator}
end readBibliographySettings
---
on writeBibliographySettings(bibliographySettings)
-- global setup
tell application "Microsoft Word"
set wordDocument to active document
set selectionRange to create range wordDocument start (selection start of selection) end (selection end of selection)
set status bar to "Writing bibliography..."
end tell
tell application "BibDesk"
set bibDeskDocument to front document
end tell
-- parse bibliography settings
set AppleScript's text item delimiters to ""
set {bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator} to bibliographySettings
-- parse custom lists from the bibliography settings
set AppleScript's text item delimiters to ","
set italicLatin to text items of italicLatin
set italicPublicationTypes to text items of italicPublicationTypes
set AppleScript's text item delimiters to ""
-- look for formatted bibliography
tell application "Microsoft Word"
set fieldCount to (count of fields in wordDocument)
if fieldCount is not 0 then
repeat until fieldCount is 0
if content of field code of field fieldCount of wordDocument contains "ADDIN bibliography" then
set bibliographyField to field fieldCount of wordDocument
set show codes of bibliographyField to true
exit repeat
end if
set fieldCount to fieldCount - 1
end repeat
end if
end tell
-- if none found, create the bibliography field
if fieldCount is 0 then
try
tell application "Microsoft Word"
display dialog "No bibliography found, do you wish to create one now?"
set bibliographyField to make new field at end of text object of wordDocument with properties {field type:field quote, show codes:true, field text:"*"}
end tell
on error -- return the bibliography settings empty
return {}
end try
if bibDeskDocumentName is "" then -- if default settings were used, set the BibDesk library
tell application "BibDesk"
set bibDeskDocumentName to name of bibDeskDocument
end tell
end if
if bibliographyTemplatePath is "" then -- if default settings were used, set the template paths
tell application "Microsoft Word"
set bibliographyTemplatePath to POSIX path of (choose file with prompt "Please choose WordScript Template Bibliography" of type {"public.rtf", "com.microsoft.word.doc"})
end tell
end if
set AppleScript's text item delimiters to "/" -- guess the other template paths
set assumedTemplatePath to (text items 1 through -2 of bibliographyTemplatePath) as string
set AppleScript's text item delimiters to ""
tell application "Finder"
try
set citepTemplatePath to POSIX path of (POSIX file (assumedTemplatePath & "/" & "WordScript Template Author-Year (citep).txt" as string) as alias)
set citetTemplatePath to POSIX path of (POSIX file (assumedTemplatePath & "/" & "WordScript Template Year Only (citet).txt" as string) as alias)
end try
end tell
if citepTemplatePath is "" then -- otherwise choose manually
tell application "Microsoft Word"
set citepTemplatePath to POSIX path of (choose file with prompt "Please choose WordScript Template Author-Year (citep)" of type {"public.plain-text"})
end tell
end if
if citetTemplatePath is "" then
tell application "Microsoft Word"
set citetTemplatePath to POSIX path of (choose file with prompt "Please choose WordScript Template Year Only (citet)" of type {"public.plain-text"})
end tell
end if
end if
-- write the bibiography field in Word
tell application "Microsoft Word"
set AppleScript's text item delimiters to ","
set content of field code of bibliographyField to " ADDIN bibliography{" & "<bibDeskDocumentName=" & bibDeskDocumentName & "><bibliographyTemplatePath=" & bibliographyTemplatePath & "><citepTemplatePath=" & citepTemplatePath & "><citetTemplatePath=" & citetTemplatePath & "><parenthesisOpen=" & parenthesisOpen & "><parenthesisClose=" & parenthesisClose & "><bibliographySortBy=" & bibliographySortBy & "><bibliographyStyle=" & bibliographyStyle & "><italicLatin=" & italicLatin & "><italicPublicationTypes=" & italicPublicationTypes & "><superscriptReferences=" & superscriptReferences & "><numberedReferences=" & numberedReferences & "><numberSeperator=" & numberSeperator & ">}"
set AppleScript's text item delimiters to ""
try -- restore the cursor to its original position
select selectionRange
on error -- produces error if cursor was at the end of the document
select (create range wordDocument start (selection end of selection) end (selection end of selection))
end try
end tell
-- restore Word to its original position
tell application "Microsoft Word"
try
select selectionRange
on error -- produces error if cursor was at the end of the document
select (create range wordDocument start (selection end of selection) end (selection end of selection))
end try
set status bar to "Finished writing bibliography"
end tell
return {bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator}
end writeBibliographySettings
---
on formatReferences(bibliographySettings)
-- global setup
tell application "Microsoft Word"
set wordDocument to active document
set selectionRange to create range wordDocument start (selection start of selection) end (selection end of selection)
set status bar to "Formatting references..."
end tell
tell application "BibDesk"
set bibDeskDocument to front document
end tell
-- parse bibliography settings
set AppleScript's text item delimiters to ""
set {bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator} to bibliographySettings
-- parse custom lists from the bibliography settings
set AppleScript's text item delimiters to ","
set italicLatin to text items of italicLatin
set italicPublicationTypes to text items of italicPublicationTypes
set AppleScript's text item delimiters to ""
-- read the plain text template data (should this move to 'format author-year references'?)
set citepTemplate to read citepTemplatePath
set citetTemplate to read citetTemplatePath
-- intitialise document lists
set citeKeyList to {}
set publicationList to {}
set ibidCiteKeyList to {}
set italicReferences to {}
-- begin formatting the references
tell application "Microsoft Word"
activate
-- establish the format range
if (selection start of selection) is equal to (selection end of selection) then
if content of selection is "]" then -- just edited page number
set formatRange to words of sentences of selection
else
set formatRange to wordDocument -- format entire document
select (create range wordDocument start 0 end 0)
end if
else
set formatRange to selectionRange -- format selection only
end if
-- set up the find system in Word
set findObject to find object of selection
set match wildcards of findObject to true
set wrap of findObject to find continue
-- convert unformatted cite commands to ADDIN fields
repeat with citeCommand in {"citep", "citet", "citealp", "citealt", "bibliography"}
set content of findObject to "\\\\" & citeCommand & "*\\}"
select formatRange
try
repeat while (execute find findObject)
set citeCommand to content of selection
set content of selection to ""
make new field at (text object of selection) with properties {field type:field quote, show codes:true, field text:"*"}
set currentField to first field of (create range wordDocument start ((selection start of selection) - 1) end (selection end of selection))
set content of field code of currentField to " ADDIN " & characters 2 thru -1 of citeCommand
end repeat
on error -- this can break if advanced find and replace has been used in Word
display dialog "Something is wrong with the find system in Microsoft Word, please quit Microsoft Word then re-open" buttons {"OK"} default button {"OK"}
return
end try
end repeat
repeat with fieldNumber from 1 to count of fields of formatRange -- convert ADDIN fields to formatted references
set currentField to field fieldNumber of formatRange
set fieldCode to content of field code of currentField
if field type of currentField is field addin and {"citep", "citet", "citealp", "citealt"} contains word 2 of fieldCode then -- extract cite key and prefix/suffix
select currentField
set AppleScript's text item delimiters to {"{", "}"} -- parse cite key
set citeKey to text item 2 of fieldCode
set AppleScript's text item delimiters to {"[", "]"} -- parse prefix/suffix
set referencePrefix to ""
set referenceSuffix to ""
if (count of text items of fieldCode) is 5 then -- two pairs of square brackets
set referencePrefix to text item 2 of fieldCode
set referenceSuffix to text item 4 of fieldCode
else if (count of text items of fieldCode) is 3 then -- one pair of square brackets
set referenceSuffix to text item 2 of fieldCode
end if
tell application "BibDesk" -- match cite keys to publications
set multiplePublications to {} -- intitialise the multiple reference lists
set multipleCiteKeys to {}
set AppleScript's text item delimiters to "," -- multiple cite keys must be seperated by commas in BibDesk
repeat with eachInteger from 1 to count of text items of citeKey -- loop through every cite key and match to a publication
set currentCiteKey to item eachInteger of text items of citeKey
set currentPublication to (publications in bibDeskDocument whose cite key is currentCiteKey)
if (count of currentPublication) is 0 then -- no match found
tell application "Microsoft Word"
set show codes of currentField to true
select field code of currentField
select (create range wordDocument start ((selection start of selection) - 1) end (selection end of selection) + 1)
display dialog "No BibDesk reference matches this cite key: " & currentCiteKey buttons {"OK"} default button {"OK"}
return
end tell
end if
if ibidCiteKeyList is not {} and last item of ibidCiteKeyList is currentCiteKey then -- check for ibid. references
set ibidReference to true
else
set ibidReference to false
end if
set ibidCiteKeyList to ibidCiteKeyList & currentCiteKey
if citeKeyList does not contain currentCiteKey then -- list all cite keys
set citeKeyList to citeKeyList & currentCiteKey
end if
repeat with eachInteger from 1 to the count of citeKeyList -- get number for numbered references
if item eachInteger of citeKeyList is currentCiteKey then
set citeKeyNumber to eachInteger
end if
end repeat
set multiplePublications to multiplePublications & currentPublication -- list multiple publications in current field
-- list of all publications
if publicationList does not contain currentPublication then set publicationList to publicationList & currentPublication
-- list references to be made italic such as films
if italicPublicationTypes contains type of (publications in bibDeskDocument whose cite key is citeKey) then
set italicReferenceTitle to title of (publications in bibDeskDocument whose cite key is citeKey)
if italicReferences does not contain italicReferenceTitle then
set italicReferences to italicReferences & italicReferenceTitle
end if
end if
set multipleCiteKeys to multipleCiteKeys & citeKeyNumber
set citeKeyNumberText to multipleCiteKeys
end repeat
end tell
if (numberedReferences as boolean) is false then
-- format author-year references
if fieldCode contains "citep" then
if ibidReference is true then
set templatedText to "ibid."
else
tell application "BibDesk"
set templatedText to (templated text document bibDeskDocumentName using text citepTemplate for multiplePublications)
end tell
end if
set formattedReference to parenthesisOpen & referencePrefix & templatedText & referenceSuffix & parenthesisClose
else if fieldCode contains "citet" then
if ibidReference is true then
set templatedText to "ibid."
else
tell application "BibDesk"
set templatedText to (templated text document bibDeskDocumentName using text citetTemplate for multiplePublications)
end tell
end if
set formattedReference to parenthesisOpen & referencePrefix & templatedText & referenceSuffix & parenthesisClose
else if fieldCode contains "citealp" then
if ibidReference is true then
set templatedText to "ibid."
else
tell application "BibDesk"
set templatedText to (templated text document bibDeskDocumentName using text citepTemplate for multiplePublications)
end tell
end if
set formattedReference to referencePrefix & templatedText & referenceSuffix
else if fieldCode contains "citealt" then
if ibidReference is true then
set templatedText to "ibid."
else
tell application "BibDesk"
set templatedText to (templated text document bibDeskDocumentName using text citetTemplate for multiplePublications)
end tell
end if
set formattedReference to referencePrefix & templatedText & referenceSuffix
end if
set content of result range of currentField to formattedReference
else if (numberedReferences as boolean) is true then
-- format numbered references
set formattedReference to ""
set AppleScript's text item delimiters to numberSeperator
set content of result range of currentField to parenthesisOpen & citeKeyNumberText & parenthesisClose
end if
-- set superscript for current field
if superscriptReferences is false then
set superscript of font object of result range of currentField to false
else if superscriptReferences is true then
set superscript of font object of result range of currentField to true
end if
set show codes of currentField to false
-- set italics for current field
set italicCombined to italicLatin & italicReferences
repeat with eachItalic in italicCombined
if formattedReference contains eachItalic then
set AppleScript's text item delimiters to ","
repeat with italicFind in italicCombined
set findObject to find object of selection
set content of findObject to italicFind
set content of replacement of findObject to italicFind
set italic of font object of replacement of findObject to true
execute find findObject replace replace all
end repeat
set AppleScript's text item delimiters to ""
end if
end repeat
end if
end repeat
-- format bibliography
set fieldCount to count of fields of formatRange
repeat until fieldCount is 0
set currentField to field fieldCount of formatRange
set fieldCode to content of field code of currentField
if field type of currentField is field addin and word 2 of fieldCode contains "bibliography" then
set bibliographyField to currentField
select bibliographyField
-- compile the bibliography text and export to a temp file
tell application "System Events"
set tempDirectory to path to temporary items from user domain
set bibliographyTemplateFile to POSIX file bibliographyTemplatePath as string
set bibliographyTemplateFileName to name of file bibliographyTemplatePath
set tempfile to (tempDirectory as string) & bibliographyTemplateFileName
end tell
tell application "BibDesk"
if bibliographySortBy is not "" and (numberedReferences as boolean) is false then
sort publicationList by bibliographySortBy
set publicationList to result
end if
export bibDeskDocument using template file (bibliographyTemplateFile as string) to file tempfile for publicationList
end tell
-- insert exported text into the bibliography field
set show codes of bibliographyField to false
set content of result range of bibliographyField to "*"
insert file at (create range wordDocument start (start of content of result range of bibliographyField) end (start of content of result range of bibliographyField)) file name tempfile
tell application "System Events" to delete file tempfile
-- set Word style of bibliography and force font object
set style of result range of bibliographyField to bibliographyStyle
set name of font object of result range of bibliographyField to name of font object of Word style bibliographyStyle of wordDocument
-- remove superfluous characters
delete (create range wordDocument start ((end of content of result range of bibliographyField) - 2) end (end of content of result range of bibliographyField))
exit repeat
end if
set fieldCount to fieldCount - 1
end repeat
end tell
-- restore Word to its original position
tell application "Microsoft Word"
try
select selectionRange
on error -- produces error if cursor was at the end of the document
select (create range wordDocument start (selection end of selection) end (selection end of selection))
end try
set status bar to "Finished formatting references"
end tell
return bibliographySettings
end formatReferences
---
on unformatReferences()
-- global setup
tell application "Microsoft Word"
set wordDocument to active document
set selectionRange to create range wordDocument start (selection start of selection) end (selection end of selection)
set status bar to "Unformatting references..."
end tell
set AppleScript's text item delimiters to ""
-- unformat references
tell application "Microsoft Word"
activate
if (selection start of selection) is equal to (selection end of selection) then
set formatRange to wordDocument
try
display dialog "Are you sure? This will unformat the entire document!" buttons {"Cancel", "OK"} default button "OK"
on error
return
end try
else
set formatRange to selectionRange
end if
set fieldList to fields of formatRange
if (count of fieldList) is 0 then
display dialog "There are no formatted references in this selection" buttons {"OK"} default button "OK"
return
end if
repeat with currentField in reverse of fieldList
set fieldCode to content of field code of currentField
if field type of currentField is field addin and {"cite", "citep", "citet", "citealp", "citealt", "bibliography"} contains word 2 of fieldCode then
if fieldCode contains "bibliography" then set style of result range of currentField to "Normal"
set fieldCode to characters 8 thru -1 of fieldCode as string
select currentField
insert text "\\" & fieldCode at end of text object of selection
delete currentField
end if
end repeat
end tell
-- restore Word to its original position
tell application "Microsoft Word"
try
select selectionRange
on error -- produces error if cursor was at the end of the document
select (create range wordDocument start (selection end of selection) end (selection end of selection))
end try
set status bar to "Finished unformatting references"
end tell
end unformatReferences
---
on fillEmptyReferences()
-- find empty references contained by {}
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
set wordDocument to active document
set selectionRange to (create range wordDocument start (selection start of selection) end (selection end of selection))
set status bar to "Filling empty references..."
-- start from the beginning of the document
select (create range wordDocument start 0 end 0)
-- set up the find system in Word
set findObject to find object of selection
set match wildcards of findObject to true
-- prevent wrapping to enable skip option
set wrap of findObject to find stop
-- find empty references and contents but not cite commands
set content of findObject to "[!\\]]\\{*\\}"
set theCounter to 0
repeat while (execute find findObject)
set status bar to "Searching for empty references... (" & theCounter & ")"
set emptyReferenceText to content of (create range wordDocument start (selection start of selection) + 1 end (selection end of selection))
set emptyReferenceContext to "\"" & characters 1 through -2 of (content of sentences of selection as string) & "\""
try
set {citepList, citetList, citealpList, citeSkip} to {"(Author, YEAR)", "(YEAR)", "(Custom...)", "Skip this instance"}
choose from list {citepList, citetList, citealpList, citeSkip} with title "Fill Empty References {}" with prompt "Please select reference[s] in BibDesk for:
" & emptyReferenceContext & "
" default items citepList
set theResult to result
if theResult does not contain citeSkip then
if theResult contains citepList then
tell application "BibDesk" to set templatedText to templated text front document using text "<$publications><$#=1?>\\citep[][]{<$citeKey/><?$#?>,<$citeKey/></$#?></$publications>}" for selection of front document
else if theResult contains citetList then
tell application "BibDesk" to set templatedText to templated text front document using text "<$publications><$#=1?>\\citet[][]{<$citeKey/><?$#?>,<$citeKey/></$#?></$publications>}" for selection of front document
else if theResult contains citealpList then
set emptyReferenceContext to emptyReferenceContext & "
(Use 'citealp' for Author, YEAR, and 'citealt' for YEAR)"
tell application "BibDesk" to set templatedText to templated text front document using text "<$publications><$#=1?>\\citealp[][]{<$citeKey/>}<?$#?>\\citealp[; ][]{<$citeKey/>}</$#?></$publications>" for selection of front document
else if theResult is false then
exit repeat
end if
display dialog "Please confirm the cite command for:
" & emptyReferenceContext with title "Fill Empty References {}" default answer templatedText default button "OK"
set templatedText to text returned of result
set content of (create range wordDocument start (selection start of selection) + 1 end (selection end of selection)) to (templatedText as string)
set theCounter to theCounter + 1
end if
on error
-- prevent "no empty references" dialog
set theCounter to -1
-- exit repeat instead of return to avoid breaking the find system in Word
exit repeat
end try
-- continue search from end of filled reference onwards
select (create range wordDocument start (selection end of selection) end (selection end of selection))
end repeat
try
select selectionRange
end try
end tell
if theCounter is 0 then
tell application "Microsoft Word"
display dialog "No empty references filled" buttons {"OK"} default button "OK"
end tell
else if theCounter is greater than 0 then
try
tell application "Microsoft Word"
display dialog "Empty references filled, format references now?" buttons {"No", "Yes"} cancel button "No" default button "Yes"
if button returned of result contains "Yes" then menuChoiceFormat()
end tell
end try
end if
tell application "Microsoft Word"
set status bar to "Finished filling empty references"
end tell
return
end fillEmptyReferences
---
on toolsMenu()
-- global setup
tell application "Microsoft Word"
set wordDocument to active document
set selectionRange to create range active document start (selection start of selection) end (selection end of selection)
end tell
-- open tools menu
repeat
tell application "Microsoft Word"
activate
choose from list {"Convert from \\cite to \\citep", "Covert from \\citep to \\cite", "Convert p./pp. to :", "Convert : to p./pp.", "Add Leading Space", "Remove Leading Space"} with title "WordScript Tools" with prompt "You should save your work first!" default items "Convert from \\cite to \\citep" cancel button name {"Exit"} OK button name {"Choose"}
set menuChoice to result
end tell
if menuChoice is false then
exit repeat
end if
if menuChoice contains "Export to Static Group" then
-- rewrite from scratch
else if menuChoice contains "Convert from \\cite to \\citep" then
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
activate
set findObject to find object of text object of wordDocument
set match wildcards of findObject to false
repeat with citeCommand in {"\\cite{", "\\cite["}
set content of findObject to citeCommand
if citeCommand as string is "\\cite{" then
set content of replacement of findObject to "\\citep{"
execute find findObject replace replace all
else if citeCommand as string is "\\cite[" then
set content of replacement of findObject to "\\citep["
execute find findObject replace replace all
end if
end repeat
end tell
return
else if menuChoice contains "Covert from \\citep to \\cite" then
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
activate
set findObject to find object of text object of wordDocument
set match wildcards of findObject to false
repeat with citeCommand in {"\\citep{", "\\citep["}
set content of findObject to citeCommand
if citeCommand as string is "\\citep{" then
set content of replacement of findObject to "\\cite{"
execute find findObject replace replace all
else if citeCommand as string is "\\citep[" then
set content of replacement of findObject to "\\cite["
execute find findObject replace replace all
end if
end repeat
end tell
return
else if menuChoice contains "Convert p./pp. to :" then
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
activate
set findObject to find object of text object of wordDocument
set match wildcards of findObject to false
repeat with citeCommand in {"[, p.", "[, pp."}
set content of findObject to citeCommand
if citeCommand as string is "[, p." then
set content of replacement of findObject to "[: " -- normal colon
execute find findObject replace replace all
else if citeCommand as string is "[, pp." then
set content of replacement of findObject to "[꞉ " -- NBSp colon
execute find findObject replace replace all
end if
end repeat
end tell
return
else if menuChoice contains "Convert : to p./pp." then
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
activate
set findObject to find object of text object of wordDocument
set match wildcards of findObject to false
repeat with citeCommand in {"[: ", "[꞉ "} -- normal colon and modifier letter colon
set content of findObject to citeCommand
if citeCommand as string is "[: " then -- normal colon
set content of replacement of findObject to "[, p."
execute find findObject replace replace all
else if citeCommand as string is "[꞉ " then -- modifier letter colon
set content of replacement of findObject to "[, pp."
execute find findObject replace replace all
end if
end repeat
end tell
return
else if menuChoice contains "Add Leading Space" then
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
activate
set findObject to find object of text object of wordDocument
set match wildcards of findObject to false
repeat with citeCommand in {"\\citep", "\\citet", "\\citealp", "\\citealt"}
set content of findObject to citeCommand
if citeCommand as string is "\\citep" then
set content of replacement of findObject to " \\citep"
execute find findObject replace replace all
else if citeCommand as string is "\\citet" then
set content of replacement of findObject to " \\citet"
execute find findObject replace replace all
else if citeCommand as string is "\\citealp" then
set content of replacement of findObject to " \\citealp"
execute find findObject replace replace all
else if citeCommand as string is "\\citealt" then
set content of replacement of findObject to " \\citealt"
execute find findObject replace replace all
end if
end repeat
end tell
return
else if menuChoice contains "Remove Leading Space" then
set AppleScript's text item delimiters to ""
tell application "Microsoft Word"
activate
set findObject to find object of text object of wordDocument
set match wildcards of findObject to false
repeat with citeCommand in {" \\citep", " \\citet", " \\citealp", " \\citealt"}
set content of findObject to citeCommand
if citeCommand as string is " \\citep" then
set content of replacement of findObject to "\\citep"
execute find findObject replace replace all
else if citeCommand as string is " \\citet" then
set content of replacement of findObject to "\\citet"
execute find findObject replace replace all
else if citeCommand as string is " \\citealp" then
set content of replacement of findObject to "\\citealp"
execute find findObject replace replace all
else if citeCommand as string is " \\citealt" then
set content of replacement of findObject to "\\citealt"
execute find findObject replace replace all
end if
end repeat
end tell
return
end if
-- restore Word to its original position
tell application "Microsoft Word"
try
select selectionRange
on error -- produces error if cursor was at the end of the document
select (create range wordDocument start (selection end of selection) end (selection end of selection))
end try
end tell
end repeat
return
end toolsMenu
---
on settingsMenu(bibliographySettings)
-- global setup
tell application "BibDesk"
set bibDeskDocument to front document
end tell
-- parse bibliography settings
set AppleScript's text item delimiters to ""
set {bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator} to bibliographySettings
-- parse custom lists from the bibliography settings
set AppleScript's text item delimiters to ","
set italicLatin to text items of italicLatin
set italicPublicationTypes to text items of italicPublicationTypes
set AppleScript's text item delimiters to ""
(*
-- check to make sure that the template files exist
try
tell application "Finder"
get exists of (POSIX file (bibliographyTemplatePath as string) as alias)
get exists of (POSIX file (citepTemplatePath as string) as alias)
get exists of (POSIX file (citetTemplatePath as string) as alias)
end tell
on error
tell application "Microsoft Word"
display dialog "Template files not found, please delete the bibliography and try again" buttons {"OK"} default button {"OK"}
end tell
return
end try
*)
repeat
-- parse menu choices
set bibDeskDocumentNameChoice to "BibDesk Document: " & bibDeskDocumentName
set AppleScript's text item delimiters to "/"
set bibliographyTemplatePathChoice to "Bibliography Template: " & (text item -1 of bibliographyTemplatePath)
set citepTemplatePathChoice to "Author-Year Template: " & (text item -1 of citepTemplatePath)
set citetTemplatePathChoice to "Year Only Template: " & (text item -1 of citetTemplatePath)
set AppleScript's text item delimiters to ""
set parenthesisOpenChoice to "Parenthesis Open: " & parenthesisOpen
set parenthesisCloseChoice to "Parenthesis Close: " & parenthesisClose
set AppleScript's text item delimiters to ","
set italicLatinChoice to "Italic Latin: " & italicLatin
set italicPublicationTypesChoice to "Italic Publication Types: " & italicPublicationTypes
set AppleScript's text item delimiters to ""
set bibliographySortByChoice to "Bibliography Sort By: " & bibliographySortBy
set bibliographyStyleChoice to "Bibliography Style: " & bibliographyStyle
set superscriptReferencesChoice to "Superscript references: " & superscriptReferences
set numberedReferencesChoice to "Numbered references: " & numberedReferences
set numberSeperatorChoice to "Number Seperator: " & numberSeperator
set builtInPreset1Choice to "Built-In Quick Settings: Harvard Referencing"
set builtInPreset2Choice to "Built-In Quick Settings: Numbered Endnotes"
tell application "Microsoft Word"
choose from list {bibDeskDocumentNameChoice, bibliographyTemplatePathChoice, citepTemplatePathChoice, citetTemplatePathChoice, parenthesisOpenChoice, parenthesisCloseChoice, italicLatinChoice, italicPublicationTypesChoice, bibliographySortByChoice, bibliographyStyleChoice, superscriptReferencesChoice, numberedReferencesChoice, numberSeperatorChoice, " ", builtInPreset1Choice, builtInPreset2Choice} with title "WordScript Settings" with prompt "Please choose which setting to edit" cancel button name {"Exit"} OK button name {"Choose"}
set menuChoice to result
end tell
-- save and exit
if menuChoice is false then
exit repeat
end if
-- Document Settings
if menuChoice contains bibDeskDocumentNameChoice then
try
tell application "Microsoft Word"
display dialog "Open desired library in BibDesk then click OK"
end tell
tell application "BibDesk"
set bibDeskDocumentName to name of bibDeskDocument
end tell
on error -- do nothing
end try
else if menuChoice contains bibliographyTemplatePathChoice then
tell application "Microsoft Word"
set bibliographyTemplatePath to POSIX path of (choose file with prompt "Please choose bibliography template" of type {"public.rtf", "com.microsoft.word.doc"})
end tell
else if menuChoice contains citepTemplatePathChoice then
tell application "Microsoft Word"
set citepTemplatePath to POSIX path of (choose file with prompt "Please choose author-year template (citep)" of type {"public.plain-text"})
end tell
else if menuChoice contains citetTemplatePathChoice then
tell application "Microsoft Word"
set citetTemplatePath to POSIX path of (choose file with prompt "Please choose year only template (citet)" of type {"public.plain-text"})
end tell
else if menuChoice contains parenthesisOpenChoice then
tell application "Microsoft Word"
display dialog "Set Parenthesis Open
Example: ( or [ or <" buttons {"OK"} default button "OK" default answer parenthesisOpen
set parenthesisOpen to text returned of result
end tell
else if menuChoice contains parenthesisCloseChoice then
tell application "Microsoft Word"
display dialog "Set Parenthesis Close
Example: ) or ] or =" buttons {"OK"} default button "OK" default answer parenthesisClose
set parenthesisClose to text returned of result
end tell
else if menuChoice contains italicLatinChoice then
set AppleScript's text item delimiters to ","
tell application "Microsoft Word"
display dialog "Set phrases to be italisised, separated by commas
Example: et al.,ibid.,cf.,inter alia,circa" buttons {"OK"} default button "OK" default answer italicLatin as string
set italicLatin to text returned of result
set italicLatin to (text items of italicLatin) as list
end tell
set AppleScript's text item delimiters to ""
else if menuChoice contains italicPublicationTypesChoice then
set AppleScript's text item delimiters to ","
tell application "Microsoft Word"
display dialog "Set reference types to be italisised, separated by commas
Example: film,broadcast" buttons {"OK"} default button "OK" default answer italicPublicationTypes as string
set italicPublicationTypes to text returned of result
set italicPublicationTypes to (text items of italicPublicationTypes) as list
end tell
set AppleScript's text item delimiters to ""
else if menuChoice contains bibliographySortByChoice then
tell application "Microsoft Word"
display dialog "Set Sort Bibliography By BibDesk Field
Example: Author or Cite Key
(Leave blank to sort in order of appearance)" buttons {"OK"} default button "OK" default answer bibliographySortBy
set bibliographySortBy to text returned of result
end tell
else if menuChoice contains bibliographyStyleChoice then
tell application "Microsoft Word"
display dialog "Set bibliography style in Microsoft Word
Example: Bibliography or List Number or Normal
(Leave blank to use formatting from template file)" buttons {"OK"} default button "OK" default answer bibliographyStyle
set bibliographyStyle to text returned of result
end tell
else if menuChoice contains superscriptReferencesChoice then
tell application "Microsoft Word"
display dialog "Use superscript references?" buttons {"No", "Yes"} default button superscriptReferences
set superscriptReferences to text items of button returned of result
end tell
else if menuChoice contains numberedReferencesChoice then
tell application "Microsoft Word"
display dialog "Use numbered references instead of Harvard style?
(Overrides reference templates and sorting)" buttons {"No", "Yes"} default button numberedReferences
set numberedReferences to text items of button returned of result
end tell
else if menuChoice contains numberSeperatorChoice then
tell application "Microsoft Word"
display dialog "Set seperator for numbered references
(Only applies to multiple numbers in a single field)
Example: , or ; or space" buttons {"OK"} default button "OK" default answer numberSeperator
set numberSeperator to text returned of result
end tell
else if menuChoice contains builtInPreset1Choice then
set parenthesisOpen to "("
set parenthesisClose to ")"
set bibliographySortBy to "Cite Key"
set bibliographyStyle to "Bibliography"
set italicLatin to {"et al.", "ibid.", "cf.", "inter alia", "circa"}
set italicPublicationTypes to {"film", "broadcast"}
set superscriptReferences to "No"
set numberedReferences to "No"
set numberSeperator to ""
else if menuChoice contains builtInPreset2Choice then
set parenthesisOpen to ""
set parenthesisClose to ""
set bibliographySortBy to ""
set bibliographyStyle to "List Number"
set italicLatin to {}
set italicPublicationTypes to {}
set superscriptReferences to "Yes"
set numberedReferences to "Yes"
set numberSeperator to ","
end if
end repeat
return {bibDeskDocumentName, bibliographyTemplatePath, citepTemplatePath, citetTemplatePath, parenthesisOpen, parenthesisClose, bibliographySortBy, bibliographyStyle, italicLatin, italicPublicationTypes, superscriptReferences, numberedReferences, numberSeperator}
end settingsMenu
|
software/obsolete/new-rom/video_text_mode.asm | Noah1989/loopmicro | 1 | 104203 | public video_text_mode_init
extern font_terminus
include "video_io.inc"
video_text_mode_init:
LD A, -3
OUT (video_scroll_x), A
LD A, -4
OUT (video_scroll_y), A
LD A, %10110011 ; tile row repeat, negative scroll x/y
OUT (video_settings), A
video_text_mode_init_load_palettes:
XOR A, A
OUT (video_address_l), A
OUT (video_address_h), A
LD BC, 2 * 256 * 16 ; two sets of 256 palettes of 16 colors
LD HL, video_text_mode_colors
LD DE, HL
video_text_mode_init_load_palettes_loop:
LD A, (HL)
OUT (video_table_palette_increment), A
DEC BC
LD A, B
CP A, $10
JR NC, video_text_mode_init_load_palettes_do_swap
BIT 0, C
JR NZ, video_text_mode_init_load_palettes_no_swap
video_text_mode_init_load_palettes_do_swap:
EX DE, HL
video_text_mode_init_load_palettes_no_swap:
LD A, $0F
AND A, C
JR NZ, video_text_mode_init_load_palettes_continue
INC DE
OR A, C
JR NZ, video_text_mode_init_load_palettes_continue
LD DE, video_text_mode_colors
INC HL
LD A, B
CP A, $10
JR NZ, video_text_mode_init_load_palettes_continue
LD HL, video_text_mode_colors
video_text_mode_init_load_palettes_continue:
LD A, B
OR A, C
JR NZ, video_text_mode_init_load_palettes_loop
video_text_mode_load_characters:
XOR A, A
OUT (video_address_l), A
OUT (video_address_h), A
LD IX, font_terminus
LD BC, 256 * 32 ; 256 patterns of 32 bytes
video_text_mode_load_characters_loop:
LD A, C
AND A, $07
JR NZ, video_text_mode_load_characters_skip
LD E, (IX+0)
LD L, (IX+1)
LD D, (IX+8)
LD H, (IX+9)
INC IX
INC IX
video_text_mode_load_characters_skip:
SUB A, A
RLC H
RLA
RLC L
RLA
RLA
RLA
RLC D
RLA
RLC E
RLA
OUT (video_table_pattern_increment), A
DEC BC
LD A, C
AND A, $1F
JR NZ, video_text_mode_load_characters_skip2
LD DE, 8
ADD IX, DE
video_text_mode_load_characters_skip2:
LD A, B
OR A, C
JR NZ, video_text_mode_load_characters_loop
video_text_mode_clear_screen:
LD BC, 128 * 64 ; number of characters
video_text_mode_clear_screen_loop:
LD A, ' '
OUT (video_table_name), A
LD A, $07
OUT (video_table_attribute_increment), A
DEC BC
LD A, B
OR A, C
JR NZ, video_text_mode_clear_screen_loop
RET
section constants
video_text_mode_colors:
; 0=black, 1=blue, 2=green, 3=cyan, 4=red, 5=purple, 6=yellow, 7=gray
; tweaked RGBI
defb $00, $0C, $20, $3C
defb $C0, $CC, $E0, $FC
defb $03, $0F, $33, $3F
defb $C3, $CF, $E3, $FF
; gruvbox
;defb $54, $68, $A1, $B8
;defb $C1, $87, $E5, $F8
;defb $A8, $BC, $F5, $66
;defb $D2, $97, $E2, $FA
; tango
;defb $55, $1A, $61, $29
;defb $C1, $47, $E1, $AB
;defb $03, $6D, $63, $2B
;defb $C2, $EC, $F2, $FE
|
oeis/315/A315265.asm | neoneye/loda-programs | 11 | 29958 | ; A315265: Coordination sequence Gal.5.132.3 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.
; Submitted by <NAME>
; 1,6,10,15,20,26,31,36,40,46,52,56,61,66,72,77,82,86,92,98,102,107,112,118,123,128,132,138,144,148,153,158,164,169,174,178,184,190,194,199,204,210,215,220,224,230,236,240,245,250
mov $1,$0
seq $1,310454 ; Coordination sequence Gal.5.140.1 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 $2,$0
mul $0,6
sub $0,1
mod $0,$1
add $0,1
mov $3,$2
mul $3,4
add $0,$3
|
programs/oeis/230/A230540.asm | karttu/loda | 1 | 245603 | ; A230540: a(n) = 2*n*3^(2*n-1).
; 0,6,108,1458,17496,196830,2125764,22320522,229582512,2324522934,23245229340,230127770466,2259436291848,22029503845518,213516729579636,2058911320946490
mov $2,$0
add $0,$2
lpb $0,1
add $1,$2
add $1,$2
sub $0,1
mov $2,$1
lpe
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca_notsx.log_21829_93.asm | ljhsiun2/medusa | 9 | 90142 | <filename>Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca_notsx.log_21829_93.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r15
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0xff9e, %rsi
lea addresses_WC_ht+0x151aa, %rdi
nop
nop
nop
nop
nop
and %rbp, %rbp
mov $12, %rcx
rep movsw
nop
nop
nop
nop
nop
cmp %r15, %r15
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %r15
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r13
push %r9
push %rbp
push %rcx
push %rdi
push %rsi
// REPMOV
lea addresses_A+0x1e9e, %rsi
lea addresses_WT+0x12a9e, %rdi
nop
nop
nop
nop
add %r11, %r11
mov $125, %rcx
rep movsl
sub $37997, %r9
// Store
lea addresses_WT+0x1f29e, %rdi
nop
nop
nop
and $1881, %rbp
movl $0x51525354, (%rdi)
dec %r11
// Store
lea addresses_D+0x19a9e, %r13
nop
nop
nop
nop
nop
lfence
movb $0x51, (%r13)
nop
nop
add $47496, %rsi
// Store
lea addresses_WT+0x591e, %r9
nop
nop
nop
nop
nop
xor %rbp, %rbp
movb $0x51, (%r9)
nop
nop
nop
add %rsi, %rsi
// Faulty Load
lea addresses_WT+0xda9e, %rdi
nop
nop
xor %rsi, %rsi
mov (%rdi), %ebp
lea oracles, %rdi
and $0xff, %rbp
shlq $12, %rbp
mov (%rdi,%rbp,1), %rbp
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %r9
pop %r13
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 0, 'same': False, 'type': 'addresses_WT'}, 'OP': 'LOAD'}
{'src': {'congruent': 10, 'same': False, 'type': 'addresses_A'}, 'dst': {'congruent': 11, 'same': True, 'type': 'addresses_WT'}, 'OP': 'REPM'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 4, 'congruent': 10, 'same': False, 'type': 'addresses_WT'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 11, 'same': False, 'type': 'addresses_D'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 2, 'same': False, 'type': 'addresses_WT'}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 0, 'same': True, 'type': 'addresses_WT'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'congruent': 7, 'same': False, 'type': 'addresses_A_ht'}, 'dst': {'congruent': 0, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'REPM'}
{'39': 21829}
39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39
*/
|
programs/oeis/244/A244953.asm | neoneye/loda | 22 | 1105 | <gh_stars>10-100
; A244953: a(n) = Sum_{i=0..n} (-i mod 4).
; 0,3,5,6,6,9,11,12,12,15,17,18,18,21,23,24,24,27,29,30,30,33,35,36,36,39,41,42,42,45,47,48,48,51,53,54,54,57,59,60,60,63,65,66,66,69,71,72,72,75,77,78,78,81,83,84,84,87,89,90,90,93,95,96,96,99,101,102,102,105,107,108,108,111,113,114,114,117,119,120,120,123,125,126,126,129,131,132,132,135,137,138,138,141,143,144,144,147,149,150
lpb $0
mov $2,$0
sub $0,1
seq $2,158459 ; Period 4: repeat [0, 3, 2, 1].
add $1,$2
lpe
mov $0,$1
|
src/list_image.ads | LionelDraghi/List_Image | 3 | 11187 | <filename>src/list_image.ads
-- -----------------------------------------------------------------------------
-- Copyright 2018 <NAME>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-- -----------------------------------------------------------------------------
-- This file is part of the List_Image project
-- available at https://github.com/LionelDraghi/List_Image
-- -----------------------------------------------------------------------------
package List_Image is
-- --------------------------------------------------------------------------
-- Style
-- --------------------------------------------------------------------------
-- This signature package defines the style of the String returned by the
-- Image function.
--
-- Prefix, Postfix and Separator parameters are self explaining.
-- If Prefix = '(', Postfix = ')', and Separator = ',', Image will be of
-- this kind : (A,B,C,D)
-- If all parameters are set to "", the image will be : ABCD
--
-- Special Prefix and Postfix are possible for null list, and for list with
-- a single element.
-- This is usefull when you want to want "[A,B,C]" as an image, but you don't
-- want "[]" when the list is empty.
--
-- A usefull application of this feature is to have well written comments
-- regarding singular and plural.
-- If you want your image to be "A item found" but "A, B, C items found",
-- just set Postfix to " items found", and Postfix_If_Single to
-- " item found".
-- And by the way, if you want the Image to be "No item found" when the
-- list is emtpy, Prefix_If_Empty and Postfix_If_Empty are here for you.
--
-- Last_Separator allows to have this kind of output :
-- "A, B, C and D"
--
-- Note that Separator may be whatever String. You may want to insert an End
-- of Line sequence to split the list on several line, the EOL String and
-- parameters are provided for that purpose.
-- --------------------------------------------------------------------------
generic
Prefix : String := "";
Postfix : String := "";
Separator : String := "";
Last_Separator : String := Separator;
Prefix_If_Empty : String := Prefix;
Postfix_If_Empty : String := Postfix;
Prefix_If_Single : String := Prefix;
Postfix_If_Single : String := Postfix;
EOL : String := "";
package Image_Style is end Image_Style;
-- --------------------------------------------------------------------------
-- Predefined single line styles
-- --------------------------------------------------------------------------
--
-- Predefined **single line** styles (that are not relying on EOL
-- definition), and are not plateform specific, are proposed here after.
--
-- - Default_Style :
-- > A, B, C
--
-- - English_Style :
-- > A, B and C
--
-- - Bracketed_List_Style :
-- > [A, B, C]
--
-- - Markdown_Table_Style :
-- > | A | B | C |
-- Note : Markdown don't define tables, but it's a common extension,
-- like in Github Flavored Markdown for example.
--
-- --------------------------------------------------------------------------
package Default_Style is new Image_Style (Separator => ", ");
package English_Style is new Image_Style (Separator => ", ",
Last_Separator => " and ");
package Bracketed_List_Style is new Image_Style (Prefix => "[",
Postfix => "]",
Separator => ", ");
package Markdown_Table_Style is new List_Image.Image_Style
(Prefix => "|",
Separator => "|",
Postfix => "|",
Prefix_If_Empty => "",
Postfix_If_Empty => "");
-- --------------------------------------------------------------------------
-- Predefined Multi-Lines styles
-- --------------------------------------------------------------------------
--
-- Predefined (platform dependent) **multi lines** styles
-- are proposed in the following child packages :
-- - List_Image.Unix_Predefined_Styles
-- - List_Image.Windows_Predefined_Styles
--
-- Common line terminator definitions are provided here for convenience,
-- as there is no easy and standard way in Ada to get the right EOL
-- terminator on the current platform (supposing there is one on the
-- targeted platform).
--
-- --------------------------------------------------------------------------
-- Predefined EOL are (terminator explicit) :
LF_EOL : constant String := (1 => ASCII.LF);
CRLF_EOL : constant String := ASCII.CR & ASCII.LF;
-- or (platform explicit) :
Unix_EOL : constant String := LF_EOL;
Windows_EOL : constant String := CRLF_EOL;
-- --------------------------------------------------------------------------
-- Cursors
-- --------------------------------------------------------------------------
generic
type Container (<>) is limited private;
type Cursor is private;
with function First (Self : Container) return Cursor is <>;
with function Has_Element (Pos : Cursor) return Boolean is <>;
with function Next (Pos : Cursor) return Cursor is <>;
package Cursors_Signature is end Cursors_Signature;
-- --------------------------------------------------------------------------
-- The Image function
-- --------------------------------------------------------------------------
generic
with package Cursors is new Cursors_Signature (<>);
with function Image (C : Cursors.Cursor) return String is <>;
with package Style is new Image_Style (<>);
function Image (Cont : in Cursors.Container) return String;
end List_Image;
|
w2.asm | hxlnt/w2 | 1 | 94995 |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; w2 // hxlnt 2019
.include "game/header.asm" ; Import header.
.rsset $0000
.include "lib/variables.asm" ; Import library variables.
.include "game/variables.asm" ; Import game variables.
.rsset $6000
.include "game/wram.asm" ; Import WRAM variables.
.bank 0 ;;;;;;;;;;;;;;;;;;;;;;;;; BANK 0: PROGRAM CODE
.org $8000 ;;;;;;;;;;;;;;;;;;;;;; $8000 - $9FFF
LDA #%00001110 ; Configure banks.
STA bank_config ;
.include "lib/console_init.asm" ; Import and run initial-
.include "game/init.asm" ; ization subroutines.
JSR TurnScreenOff ; Turn screen off.
LDX #HIGH(attract_pal) ; Load attract_pal into
LDY #LOW(attract_pal) ; background palette.
LDA #PALETTE_BG ;
JSR LoadPalette ;
LDX #HIGH(attract_pal) ; Load attract_pal into
LDY #LOW(attract_pal) ; sprite palette.
LDA #PALETTE_SPR ;
JSR LoadPalette ;
LDX #HIGH(attract_bg) ; Load attract_bg in top-
LDY #NMTBL_TOP_LEFT ; left nametable.
JSR LoadBackground_All ;
LDX #HIGH(attract_attr) ; Load attract_attr in top-
LDY #NMTBL_TOP_LEFT ; left nametable.
JSR LoadAttr_All ;
LDX #HIGH(attract_spr) ; Load attract_spr.
LDY #LOW(attract_spr) ;
LDA #ATTRACT_SPR_LEN ;
JSR LoadSpr ;
JSR DrawResetCount ; Draw reset counter.
JSR TurnScreenOn ; Turn screen on.
GameLoop: ; Start game loop.
LDA gamestate ; Execute game loop code
AND #%01111111 ; related to current
TAX ; gamestate. Use
;LDX gamestate ; gamestate as index for
LDA gameloop_table, x ; game loop jump table.
PHA ;
INX ;
LDA gameloop_table, x ;
PHA ;
RTS ;
JMP GameLoop ; End game loop.
.include "lib/counters.asm" ; Import counter and I/O
.include "lib/io.asm" ; subroutines.
.include "lib/lookup_tables.asm"; Import lookup tables.
.include "game/subroutines.asm" ; Import game subroutines.
.include "game/gameengine.asm" ; Import gamestate list.
.bank 1 ;;;;;;;;;;;;;;;;;;;;;;;;; BANK 1: AUDIO
.org $A000 ;;;;;;;;;;;;;;;;;;;;;; $A000 - $BFFF
.bank 2 ;;;;;;;;;;;;;;;;;;;;;;;;; BANK 2: GRAPHICS
.org $C000 ;;;;;;;;;;;;;;;;;;;;;; $C000 - $DFFF
.include "game/graphics.asm" ; Import graphic tables.
.include "lib/graphics.asm" ; Import graphics and
.include "lib/scroll.asm" ; scroll subroutines.
.bank 3 ;;;;;;;;;;;;;;;;;;;;;;;;; BANK 3: NMI AND VECTORS
.org $E000 ;;;;;;;;;;;;;;;;;;;;;; $E000 - $FFFF
NMI: ; Start NMI.
PHA ; Push A, X, and Y to the
TXA ; stack.
PHA ;
TYA ;
PHA ;
JSR Counter ; Increment counters.
LDA gamestate ; Execute NMI code related
AND #%01111111 ; to the current
TAX ; gamestate. Use
LDA nmiloop_table, x ; gamestate as index for
PHA ; NMI loop jump table.
INX ;
LDA nmiloop_table, x ;
PHA ;
RTS ;
NMIDone:
JSR Scroll ; Scroll background.
PLA ; Pop Y, X, and A off the
TAY ; stack.
PLA ;
TAX ;
PLA ;
RTI ; Return from NMI.
.include "lib/mmc1.asm" ; Import MMC1 subroutines.
.org $FFFA ; Set last three bytes as
.dw NMI ; NMI, Reset, and IRQ
.dw Reset ; vectors.
.dw 0 ;
.bank 4 ;;;;;;;;;;;;;;;;;;;;;;;;; BANK 4: CHR-ROM
.org $0000 ;;;;;;;;;;;;;;;;;;;;;; $0000 - $1FFF
.incbin "game/data/graphics.chr"; Import graphics binary. |
Maths/ADDHLDESignBC.asm | ped7g/EliteNext | 0 | 98868 | <gh_stars>0
;; calcs HLB + DEC where B and C are signs
;; result HL with A as sign
;; special handling if result is zero forcign sign bit to be zero
ADDHLDESignBC: ld a,b
and SignOnly8Bit
xor c ;if b sign and c sign were different then bit 7 of a will be 1 which means
JumpIfNegative ADDHLDEsBCOppSGN ;Signs are opposite there fore we can subtract to get difference
ADDHLDEsBCSameSigns: ld a,b
or c
JumpIfNegative ADDHLDEsBCSameNeg ; optimisation so we can just do simple add if both positive
add hl,de ; both positive so a will already be zero
ret
ADDHLDEsBCSameNeg: add hl,de
ld a,b
or c ; now set bit for negative value, we won't bother with overflow for now TODO
ret
ADDHLDEsBCOppSGN: or a
sbc hl,de
jr c,ADDHLDEsBCOppInvert
ADDHLDEsBCOppSGNNoCarry: ld a,b ; we got here so hl > de therefore we can just take hl's previous sign bit
ret
ADDHLDEsBCOppInvert: NegHL ; if result was zero then set sign to zero (which doing h or l will give us for free)
ld a,b
xor SignOnly8Bit ; flip sign bit
ret
|
Task/JSON/Ada/json-1.ada | LaudateCorpus1/RosettaCodeData | 1 | 25645 | with Ada.Text_IO;
with GNATCOLL.JSON;
procedure JSON_Test is
use Ada.Text_IO;
use GNATCOLL.JSON;
JSON_String : constant String := "{""name"":""Pingu"",""born"":1986}";
Penguin : JSON_Value := Create_Object;
Parents : JSON_Array;
begin
Penguin.Set_Field (Field_Name => "name",
Field => "Linux");
Penguin.Set_Field (Field_Name => "born",
Field => 1992);
Append (Parents, Create ("<NAME>"));
Append (Parents, Create ("<NAME>"));
Append (Parents, Create ("<NAME>"));
Penguin.Set_Field (Field_Name => "parents",
Field => Parents);
Put_Line (Penguin.Write);
Penguin := Read (JSON_String, "json.errors");
Penguin.Set_Field (Field_Name => "born",
Field => 1986);
Parents := Empty_Array;
Append (Parents, Create ("<NAME>"));
Append (Parents, Create ("<NAME>"));
Penguin.Set_Field (Field_Name => "parents",
Field => Parents);
Put_Line (Penguin.Write);
end JSON_Test;
|
libsrc/_DEVELOPMENT/input/zx/c/sdcc_iy/in_mouse_amx_wheel_delta.asm | jpoikela/z88dk | 640 | 19159 |
; int16_t in_mouse_amx_wheel_delta(void)
SECTION code_clib
SECTION code_input
PUBLIC _in_mouse_amx_wheel_delta
EXTERN asm_in_mouse_amx_wheel_delta
defc _in_mouse_amx_wheel_delta = asm_in_mouse_amx_wheel_delta
|
sources/ada/processes.adb | reznikmm/jupyter | 4 | 4215 | -- SPDX-FileCopyrightText: 2020 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
----------------------------------------------------------------
with Ada.Streams;
with Ada.Exceptions;
with League.Stream_Element_Vectors;
with League.Text_Codecs;
with Spawn.Environments;
with Spawn.Processes.Monitor_Loop;
with Spawn.Processes;
with Spawn.String_Vectors;
package body Processes is
function "+" (Text : Wide_Wide_String)
return League.Strings.Universal_String
renames League.Strings.To_Universal_String;
---------
-- Run --
---------
procedure Run
(Program : League.Strings.Universal_String;
Arguments : League.String_Vectors.Universal_String_Vector;
Directory : League.Strings.Universal_String;
Env : Environment := No_Env;
Output : out League.Strings.Universal_String;
Errors : out League.Strings.Universal_String;
Status : out Integer)
is
type Listener is new Spawn.Processes.Process_Listener with record
Output : League.Stream_Element_Vectors.Stream_Element_Vector;
Errors : League.Stream_Element_Vectors.Stream_Element_Vector;
Status : Integer := 0;
Done : Boolean := False;
Write : Boolean := True;
end record;
procedure Standard_Output_Available (Self : in out Listener);
procedure Standard_Error_Available (Self : in out Listener);
procedure Finished
(Self : in out Listener;
Exit_Status : Spawn.Processes.Process_Exit_Status;
Exit_Code : Spawn.Processes.Process_Exit_Code);
procedure Error_Occurred
(Self : in out Listener;
Process_Error : Integer);
procedure Exception_Occurred
(Self : in out Listener;
Occurrence : Ada.Exceptions.Exception_Occurrence);
Process : Spawn.Processes.Process;
Codec : constant League.Text_Codecs.Text_Codec :=
League.Text_Codecs.Codec_For_Application_Locale;
-------------------------------
-- Standard_Output_Available --
-------------------------------
procedure Standard_Output_Available (Self : in out Listener) is
use type Ada.Streams.Stream_Element_Count;
Data : Ada.Streams.Stream_Element_Array (1 .. 512);
Last : Ada.Streams.Stream_Element_Count;
begin
loop
Process.Read_Standard_Output (Data, Last);
exit when Last < Data'First;
Self.Output.Append (Data (1 .. Last));
end loop;
end Standard_Output_Available;
------------------------------
-- Standard_Error_Available --
------------------------------
procedure Standard_Error_Available (Self : in out Listener) is
use type Ada.Streams.Stream_Element_Count;
Data : Ada.Streams.Stream_Element_Array (1 .. 512);
Last : Ada.Streams.Stream_Element_Count;
begin
loop
Process.Read_Standard_Error (Data, Last);
exit when Last < Data'First;
Self.Errors.Append (Data (1 .. Last));
end loop;
end Standard_Error_Available;
--------------
-- Finished --
--------------
procedure Finished
(Self : in out Listener;
Exit_Status : Spawn.Processes.Process_Exit_Status;
Exit_Code : Spawn.Processes.Process_Exit_Code) is
pragma Unreferenced (Exit_Status);
begin
Self.Status := Integer (Exit_Code);
Self.Done := True;
end Finished;
--------------------
-- Error_Occurred --
--------------------
procedure Error_Occurred
(Self : in out Listener;
Process_Error : Integer) is
pragma Unreferenced (Self);
begin
Errors.Append (+"Error_Occurred");
Self.Status := Process_Error;
Self.Done := True;
end Error_Occurred;
procedure Exception_Occurred
(Self : in out Listener;
Occurrence : Ada.Exceptions.Exception_Occurrence) is
begin
Errors.Append
(League.Strings.From_UTF_8_String
(Ada.Exceptions.Exception_Information (Occurrence)));
Self.Status := -1;
Self.Done := True;
end Exception_Occurred;
Args : Spawn.String_Vectors.UTF_8_String_Vector;
Feedback : aliased Listener;
begin
Process.Set_Program (Program.To_UTF_8_String);
for J in 1 .. Arguments.Length loop
Args.Append (Arguments (J).To_UTF_8_String);
end loop;
if Env /= No_Env then
declare
Environment : Spawn.Environments.Process_Environment :=
Process.Environment;
begin
for J in 1 .. Env.Names.Length loop
Environment.Insert
(Env.Names (J).To_UTF_8_String,
Env.Values (J).To_UTF_8_String);
end loop;
Process.Set_Environment (Environment);
end;
end if;
Process.Set_Arguments (Args);
Process.Set_Working_Directory (Directory.To_UTF_8_String);
Process.Set_Listener (Feedback'Unchecked_Access);
Process.Start;
while not Feedback.Done loop
Spawn.Processes.Monitor_Loop (Timeout => 50);
end loop;
Output := Codec.Decode (Feedback.Output);
Errors.Append (Codec.Decode (Feedback.Errors));
Status := Feedback.Status;
end Run;
end Processes;
|
cohomology/Sn.agda | danbornside/HoTT-Agda | 0 | 17217 | <gh_stars>0
{-# OPTIONS --without-K #-}
open import HoTT
open import cohomology.Exactness
open import cohomology.Theory
module cohomology.Sn {i} (OT : OrdinaryTheory i) where
open OrdinaryTheory OT
C-Sphere-≠ : (n : ℤ) (m : ℕ) → (n ≠ ℕ-to-ℤ m)
→ C n (⊙Sphere m) == LiftUnit-Group
C-Sphere-≠ n O neq = C-dimension n neq
C-Sphere-≠ n (S m) neq =
ap (λ k → C k (⊙Sphere (S m))) (! (succ-pred n))
∙ C-Susp (pred n) (⊙Sphere m)
∙ C-Sphere-≠ (pred n) m (λ p → neq (pred-injective n (pos m) p))
C-Sphere-diag : (m : ℕ) → C (ℕ-to-ℤ m) (⊙Sphere m) == C O (⊙Sphere O)
C-Sphere-diag O = idp
C-Sphere-diag 1 = C-Susp O (⊙Sphere O)
C-Sphere-diag (S (S m)) =
C-Susp (pos m) (⊙Sphere (S m)) ∙ C-Sphere-diag (S m)
|
Data/Boolean/Stmt/Proofs.agda | Lolirofle/stuff-in-agda | 6 | 11907 | <reponame>Lolirofle/stuff-in-agda<gh_stars>1-10
module Data.Boolean.Stmt.Proofs where
import Lvl
open import Data.Boolean
open import Data.Boolean.Proofs hiding (bivalence ; disjointness)
import Data.Boolean.Operators
open Data.Boolean.Operators.Programming
open import Data.Boolean.Stmt
open import Functional
open import Logic.Propositional as Logic using (⊥ ; _∨_ ; _∧_ ; ¬_ ; _↔_ ; [⊤]-intro ; [↔]-intro ; [⊥]-elim)
open import Relator.Equals
open import Type
-- A boolean operation is either true or false
bivalence : ∀{a} → (IsTrue(a) ∨ IsFalse(a))
bivalence {𝑇} = Logic.[∨]-introₗ [⊤]-intro
bivalence {𝐹} = Logic.[∨]-introᵣ [⊤]-intro
-- A boolean operation is not both true and false at the same time
disjointness : ∀{a} → IsTrue(a) → IsFalse(a) → ⊥
disjointness {𝑇} [⊤]-intro ()
disjointness {𝐹} () [⊤]-intro
module IsTrue where
[𝑇]-intro : IsTrue(𝑇)
[𝑇]-intro = [⊤]-intro
[𝐹]-elim : ¬ IsTrue(𝐹)
[𝐹]-elim ()
[∧]-intro : ∀{a b} → IsTrue(a) → IsTrue(b) → IsTrue(a && b)
[∧]-intro {𝑇} {b} ta tb = tb
[∧]-intro {𝐹} {b} ta tb = ta
[∨]-introₗ : ∀{a b} → IsTrue(a) → IsTrue(a || b)
[∨]-introₗ {_}{𝑇} _ = [⊤]-intro
[∨]-introₗ {_}{𝐹} = id
[∨]-introᵣ : ∀{a b} → IsTrue(b) → IsTrue(a || b)
[∨]-introᵣ {𝑇}{_} _ = [⊤]-intro
[∨]-introᵣ {𝐹}{_} = id
[∧]-elimₗ : ∀{a b} → IsTrue(a && b) → IsTrue(a)
[∧]-elimₗ {𝑇}{𝑇} [⊤]-intro = [⊤]-intro
[∧]-elimₗ {𝑇}{𝐹} ()
[∧]-elimₗ {𝐹}{𝑇} ()
[∧]-elimₗ {𝐹}{𝐹} ()
[∧]-elimᵣ : ∀{a b} → IsTrue(a && b) → IsTrue(b)
[∧]-elimᵣ {𝑇}{𝑇} [⊤]-intro = [⊤]-intro
[∧]-elimᵣ {𝑇}{𝐹} ()
[∧]-elimᵣ {𝐹}{𝑇} ()
[∧]-elimᵣ {𝐹}{𝐹} ()
[∨]-elim : ∀{ℓ₂}{φ : Type{ℓ₂}}{a b} → (IsTrue(a) → φ) → (IsTrue(b) → φ) → IsTrue(a || b) → φ
[∨]-elim {_}{_}{𝑇}{𝑇} f _ [⊤]-intro = f [⊤]-intro
[∨]-elim {_}{_}{𝑇}{𝐹} f _ [⊤]-intro = f [⊤]-intro
[∨]-elim {_}{_}{𝐹}{𝑇} _ f [⊤]-intro = f [⊤]-intro
[∨]-elim {_}{_}{𝐹}{𝐹} _ f ()
[¬]-intro : ∀{a} → IsFalse(a) → IsTrue(! a)
[¬]-intro {𝐹} fa = [⊤]-intro
[¬]-elim : ∀{a} → IsTrue(! a) → IsFalse(a)
[¬]-elim {𝑇} ()
[¬]-elim {𝐹} [⊤]-intro = [⊤]-intro
[→?]-intro : ∀{a b} → (IsTrue a → IsTrue b) → IsTrue (a →? b)
[→?]-intro {𝑇} {𝑇} _ = [⊤]-intro
[→?]-intro {𝑇} {𝐹} tab = tab [⊤]-intro
[→?]-intro {𝐹} {𝑇} _ = [⊤]-intro
[→?]-intro {𝐹} {𝐹} _ = [⊤]-intro
[→?]-elim : ∀{a b} → IsTrue (a →? b) → (IsTrue a → IsTrue b)
[→?]-elim {𝑇} {𝑇} tab ta = [⊤]-intro
[←?]-intro : ∀{a b} → (IsTrue b → IsTrue a) → IsTrue (a ←? b)
[←?]-intro {𝑇} {𝑇} tba = [⊤]-intro
[←?]-intro {𝑇} {𝐹} tba = [⊤]-intro
[←?]-intro {𝐹} {𝑇} tba = tba [⊤]-intro
[←?]-intro {𝐹} {𝐹} tba = [⊤]-intro
[←?]-elim : ∀{a b} → IsTrue (a ←? b) → (IsTrue b → IsTrue a)
[←?]-elim {𝑇} {𝑇} tab tb = [⊤]-intro
[==]-intro : ∀{a b} → (IsTrue b → IsTrue a) → (IsTrue a → IsTrue b) → IsTrue(a == b)
[==]-intro {𝑇} {𝑇} ba ab = [⊤]-intro
[==]-intro {𝑇} {𝐹} ba ab = ab [⊤]-intro
[==]-intro {𝐹} {𝑇} ba ab = ba [⊤]-intro
[==]-intro {𝐹} {𝐹} ba ab = [⊤]-intro
[==]-elimₗ : ∀{a b} → IsTrue(a == b) → (IsTrue b → IsTrue a)
[==]-elimₗ {𝑇} {𝑇} tab tb = [⊤]-intro
[==]-elimᵣ : ∀{a b} → IsTrue(a == b) → (IsTrue a → IsTrue b)
[==]-elimᵣ {𝑇} {𝑇} tab ta = [⊤]-intro
[!]-intro : ∀{a b} → (IsTrue a → IsTrue b) → (IsTrue a → IsTrue(not b)) → IsTrue(not a)
[!]-intro {𝑇} {𝑇} tab tanb = tanb [⊤]-intro
[!]-intro {𝑇} {𝐹} tab tanb = tab [⊤]-intro
[!]-intro {𝐹} {𝑇} tab tanb = [⊤]-intro
[!]-intro {𝐹} {𝐹} tab tanb = [⊤]-intro
[!]-elim : ∀{a b} → IsTrue a → IsTrue(not a) → IsTrue b
[!]-elim {𝑇} {𝑇} ta tnb = [⊤]-intro
[!]-elim {𝑇} {𝐹} ta tnb = tnb
[!]-elim {𝐹} {𝑇} ta tnb = [⊤]-intro
[!]-elim {𝐹} {𝐹} ta tnb = ta
is-𝑇 : ∀{a} → IsTrue(a) ↔ (a ≡ 𝑇)
is-𝑇 {a} = [↔]-intro (l{a}) (r{a}) where
r : ∀ {a} → IsTrue(a) → (a ≡ 𝑇)
r {𝑇} _ = [≡]-intro
r {𝐹} ()
l : ∀ {a} → IsTrue(a) ← (a ≡ 𝑇)
l [≡]-intro = [⊤]-intro
preserves-[&&][∧] : ∀{a b} → IsTrue(a && b) ↔ IsTrue(a) ∧ IsTrue(b)
preserves-[&&][∧] = [↔]-intro
(\{(Logic.[∧]-intro l r) → [∧]-intro l r})
(proof ↦ Logic.[∧]-intro ([∧]-elimₗ proof) ([∧]-elimᵣ proof))
preserves-[||][∨] : ∀{a b} → IsTrue(a || b) ↔ IsTrue(a) ∨ IsTrue(b)
preserves-[||][∨] = [↔]-intro
(Logic.[∨]-elim [∨]-introₗ [∨]-introᵣ)
([∨]-elim Logic.[∨]-introₗ Logic.[∨]-introᵣ)
preserves-[!][¬] : ∀{a} → IsTrue(! a) ↔ (¬ IsTrue(a))
preserves-[!][¬] {a} = [↔]-intro (l{a}) (r{a}) where
l : ∀{a} → IsTrue(! a) ← (¬ IsTrue(a))
l {𝐹} _ = [⊤]-intro
l {𝑇} f = [⊥]-elim (f [⊤]-intro)
r : ∀{a} → IsTrue(! a) → (¬ IsTrue(a))
r {𝑇} () _
r {𝐹} _ ()
module IsFalse where
[∧]-introₗ : ∀{a b} → IsFalse(a) → IsFalse(a && b)
[∧]-introₗ {_}{𝑇} = id
[∧]-introₗ {_}{𝐹} _ = [⊤]-intro
[∧]-introᵣ : ∀{a b} → IsFalse(b) → IsFalse(a && b)
[∧]-introᵣ {𝑇}{_} = id
[∧]-introᵣ {𝐹}{_} _ = [⊤]-intro
[∨]-intro : ∀{a b} → IsFalse(a) → IsFalse(b) → IsFalse(a || b)
[∨]-intro {𝑇} fa fb = fa
[∨]-intro {𝐹} fa fb = fb
[¬]-intro : ∀{a} → IsTrue(a) → IsFalse(! a)
[¬]-intro = id
[¬]-elim : ∀{a} → IsFalse(! a) → IsTrue(a)
[¬]-elim = id
is-𝐹 : ∀{a} → IsFalse(a) ↔ (a ≡ 𝐹)
is-𝐹 {a} = [↔]-intro (l{a}) (r{a}) where
r : ∀{a} → IsFalse(a) → (a ≡ 𝐹)
r {𝑇} ()
r {𝐹} _ = [≡]-intro
l : ∀{a} → IsFalse(a) ← (a ≡ 𝐹)
l [≡]-intro = [⊤]-intro
true-false-opposites : ∀{a} → IsTrue(a) ↔ (¬ IsFalse(a))
true-false-opposites {𝑇} = [↔]-intro (const [⊤]-intro) (const id)
true-false-opposites {𝐹} = [↔]-intro (_$ [⊤]-intro) const
false-true-opposites : ∀{a} → IsFalse(a) ↔ (¬ IsTrue(a))
false-true-opposites {𝑇} = [↔]-intro (_$ [⊤]-intro) const
false-true-opposites {𝐹} = [↔]-intro (const [⊤]-intro) (const id)
|
src/lv-objx-page.ads | Fabien-Chouteau/ada-lvlg | 3 | 15468 | <gh_stars>1-10
with Lv.Style;
with Lv.Area;
with Lv.Objx.Cont;
package Lv.Objx.Page is
subtype Instance is Obj_T;
-- Scrollbar modes: shows when should the scrollbars be visible
type Mode_T is
(Sb_Mode_Off, -- Never show scrollbars
Sb_Mode_On, -- Always show scrollbars
Sb_Mode_Drag, -- Show scrollbars when page is being dragged
Sb_Mode_Auto, -- Show scrollbars when the scrollable container is large enough to be scrolled
Sb_Mode_Hide, -- Hide the scroll bar temporally
Sb_Mode_Unhide); -- Unhide the previously hidden scrollbar. Recover it's type too
type Style_T is (Style_Bg,
Style_Scrl,
Style_Sb);
-- Create a page objects
-- @param par pointer to an object, it will be the parent of the new page
-- @param copy pointer to a page object, if not NULL then the new object will be copied from it
-- @return pointer to the created page
function Create (Par : Obj_T; Copy : Instance) return Instance;
-- Delete all children of the scrl object, without deleting scrl child.
-- @param self pointer to an object
procedure Clean (Self : Instance);
-- Get the press action of the page
-- @param self pointer to a page object
-- @return a function to call when the page is pressed
function Pr_Action (Self : Instance) return Action_Func_T;
-- Get the release action of the page
-- @param self pointer to a page object
-- @return a function to call when the page is released
function Rel_Action (Self : Instance) return Action_Func_T;
-- Get the scrollable object of a page
-- @param self pointer to a page object
-- @return pointer to a container which is the scrollable part of the page
function Scrl (Arg1 : Instance) return Obj_T;
----------------------
-- Setter functions --
----------------------
-- Set a release action for the page
-- @param self pointer to a page object
-- @param rel_action a function to call when the page is released
procedure Set_Rel_Action (Self : Instance; Rel_Action : Action_Func_T);
-- Set a press action for the page
-- @param self pointer to a page object
-- @param pr_action a function to call when the page is pressed
procedure Set_Pr_Action (Self : Instance; Pr_Action : Action_Func_T);
-- Set the scroll bar mode on a page
-- @param self pointer to a page object
-- @param sb_mode the new mode from 'lv_page_sb.mode_t' enum
procedure Set_Sb_Mode (Self : Instance; Sb_Mode : Mode_T);
-- Enable/Disable scrolling with arrows if the page is in group (arrows: LV_GROUP_KEY_LEFT/RIGHT/UP/DOWN)
-- @param self pointer to a page object
-- @param en true: enable scrolling with arrows
procedure Set_Arrow_Scroll (Self : Instance; En : U_Bool);
-- Set the fit attribute of the scrollable part of a page.
-- It means it can set its size automatically to involve all children.
-- (Can be set separately horizontally and vertically)
-- @param self pointer to a page object
-- @param hor_en true: enable horizontal fit
-- @param ver_en true: enable vertical fit
procedure Set_Scrl_Fit (Self : Instance; Hor_En : U_Bool; Ver_En : U_Bool);
-- Set width of the scrollable part of a page
-- @param self pointer to a page object
-- @param w the new width of the scrollable (it ha no effect is horizontal fit is enabled)
procedure Set_Scrl_Width (Self : Instance; W : Lv.Area.Coord_T);
-- Set height of the scrollable part of a page
-- @param self pointer to a page object
-- @param h the new height of the scrollable (it ha no effect is vertical fit is enabled)
procedure Set_Scrl_Height (Self : Instance; H : Lv.Area.Coord_T);
-- Set the layout of the scrollable part of the page
-- @param self pointer to a page object
-- @param layout a layout from 'lv_cont_layout_t'
procedure Set_Scrl_Layout (Self : Instance; Layout : Lv.Objx.Cont.Layout_T);
-- Set a style of a page
-- @param self pointer to a page object
-- @param type which style should be set
-- @param style pointer to a style
procedure Set_Style
(Self : Instance;
Typ : Style_T;
Style : Lv.Style.Style);
----------------------
-- Getter functions --
----------------------
-- Set the scroll bar mode on a page
-- @param self pointer to a page object
-- @return the mode from 'lv_page_sb.mode_t' enum
function Sb_Mode (Self : Instance) return Mode_T;
-- Get the the scrolling with arrows (LV_GROUP_KEY_LEFT/RIGHT/UP/DOWN) is enabled or not
-- @param self pointer to a page object
-- @return true: scrolling with arrows is enabled
function Arrow_Scroll (Self : Instance) return U_Bool;
-- Get that width which can be set to the children to still not cause overflow (show scrollbars)
-- @param self pointer to a page object
-- @return the width which still fits into the page
function Fit_Width (Self : Instance) return Lv.Area.Coord_T;
-- Get that height which can be set to the children to still not cause overflow (show scrollbars)
-- @param self pointer to a page object
-- @return the height which still fits into the page
function Fit_Height (Self : Instance) return Lv.Area.Coord_T;
-- Get width of the scrollable part of a page
-- @param self pointer to a page object
-- @return the width of the scrollable
function Scrl_Width (Self : Instance) return Lv.Area.Coord_T;
-- Get height of the scrollable part of a page
-- @param self pointer to a page object
-- @return the height of the scrollable
function Scrl_Height (Self : Instance) return Lv.Area.Coord_T;
-- Get the layout of the scrollable part of a page
-- @param self pointer to page object
-- @return the layout from 'lv_cont_layout_t'
function Scrl_Layout (Self : Instance) return Lv.Objx.Cont.Layout_T;
-- Get horizontal fit attribute of the scrollable part of a page
-- @param self pointer to a page object
-- @return true: horizontal fit is enabled; false: disabled
function Scrl_Hor_Fit (Self : Instance) return U_Bool;
-- Get vertical fit attribute of the scrollable part of a page
-- @param self pointer to a page object
-- @return true: vertical fit is enabled; false: disabled
function Scrl_Fit_Ver (Self : Instance) return U_Bool;
-- Get a style of a page
-- @param self pointer to page object
-- @param type which style should be get
-- @return style pointer to a style
function Style
(Self : Instance;
Type_P : Style_T) return Lv.Style.Style;
---------------------
-- Other functions --
---------------------
-- Glue the object to the page. After it the page can be moved (dragged) with this object too.
-- @param obj pointer to an object on a page
-- @param glue true: enable glue, false: disable glue
procedure Glue_Obj (Self : Obj_T; Glue : U_Bool);
-- Focus on an object. It ensures that the object will be visible on the page.
-- @param self pointer to a page object
-- @param obj pointer to an object to focus (must be on the page)
-- @param anim_time scroll animation time in milliseconds (0: no animation)
procedure Focus (Self : Instance; Ob : Obj_T; Anim_Time : Uint16_T);
-- Scroll the page horizontally
-- @param self pointer to a page object
-- @param dist the distance to scroll (< 0: scroll left; > 0 scroll right)
procedure Scroll_Hor (Self : Instance; Dist : Lv.Area.Coord_T);
-- Scroll the page vertically
-- @param self pointer to a page object
-- @param dist the distance to scroll (< 0: scroll down; > 0 scroll up)
procedure Scroll_Ver (Self : Instance; Dist : Lv.Area.Coord_T);
-------------
-- Imports --
-------------
pragma Import (C, Create, "lv_page_create");
pragma Import (C, Clean, "lv_page_clean");
pragma Import (C, Pr_Action, "lv_page_get_pr_action");
pragma Import (C, Rel_Action, "lv_page_get_rel_action");
pragma Import (C, Scrl, "lv_page_get_scrl");
pragma Import (C, Set_Rel_Action, "lv_page_set_rel_action");
pragma Import (C, Set_Pr_Action, "lv_page_set_pr_action");
pragma Import (C, Set_Sb_Mode, "lv_page_set_sb_mode");
pragma Import (C, Set_Arrow_Scroll, "lv_page_set_arrow_scroll");
pragma Import (C, Set_Scrl_Fit, "lv_page_set_scrl_fit_inline");
pragma Import (C, Set_Scrl_Width, "lv_page_set_scrl_width_inline");
pragma Import (C, Set_Scrl_Height, "lv_page_set_scrl_height_inline");
pragma Import (C, Set_Scrl_Layout, "lv_page_set_scrl_layout_inline");
pragma Import (C, Set_Style, "lv_page_set_style");
pragma Import (C, Sb_Mode, "lv_page_get_sb_mode");
pragma Import (C, Arrow_Scroll, "lv_page_get_arrow_scroll");
pragma Import (C, Fit_Width, "lv_page_get_fit_width");
pragma Import (C, Fit_Height, "lv_page_get_fit_height");
pragma Import (C, Scrl_Width, "lv_page_get_scrl_width_inline");
pragma Import (C, Scrl_Height, "lv_page_get_scrl_height_inline");
pragma Import (C, Scrl_Layout, "lv_page_get_scrl_layout_inline");
pragma Import (C, Scrl_Hor_Fit, "lv_page_get_scrl_hor_fit_inline");
pragma Import (C, Scrl_Fit_Ver, "lv_page_get_scrl_fit_ver_inline");
pragma Import (C, Style, "lv_page_get_style");
pragma Import (C, Glue_Obj, "lv_page_glue_obj");
pragma Import (C, Focus, "lv_page_focus");
pragma Import (C, Scroll_Hor, "lv_page_scroll_hor");
pragma Import (C, Scroll_Ver, "lv_page_scroll_ver");
for Mode_T'Size use 8;
for Mode_T use
(Sb_Mode_Off => 0,
Sb_Mode_On => 1,
Sb_Mode_Drag => 2,
Sb_Mode_Auto => 3,
Sb_Mode_Hide => 4,
Sb_Mode_Unhide => 5);
for Style_T'Size use 8;
for Style_T use (Style_Bg => 0,
Style_Scrl => 1,
Style_Sb => 2);
end Lv.Objx.Page;
|
tools/ayacc/src/lalr_symbol_info.adb | svn2github/matreshka | 24 | 1041 | <reponame>svn2github/matreshka
-- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- The primary authors of ayacc were <NAME> and <NAME>.
-- Enhancements were made by <NAME>.
--
-- Send requests for ayacc information to <EMAIL>
-- Send bug reports for ayacc to <EMAIL>
--
-- Redistribution and use in source and binary forms are permitted
-- provided that the above copyright notice and this paragraph are
-- duplicated in all such forms and that any documentation,
-- advertising materials, and other materials related to such
-- distribution and use acknowledge that the software was developed
-- by the University of California, Irvine. The name of the
-- University may not be used to endorse or promote products derived
-- from this software without specific prior written permission.
-- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
-- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-- Module : lalr_symbol_info_body.ada
-- Component of : ayacc
-- Version : 1.2
-- Date : 11/21/86 12:30:08
-- SCCS File : disk21~/rschm/hasee/sccs/ayacc/sccs/sxlalr_symbol_info_body.ada
-- $Header: /dc/uc/self/arcadia/ayacc/src/RCS/lalr_symbol_info_body.a,v 1.1 1993/05/24 19:42:25 self Exp self $
-- $Log: lalr_symbol_info_body.a,v $
-- Revision 1.1 1993/05/24 19:42:25 self
-- Initial revision
--
-- Revision 0.1 86/04/01 15:04:40 ada
-- This version fixes some minor bugs with empty grammars
-- and $$ expansion. It also uses vads5.1b enhancements
-- such as pragma inline.
--
--
-- Revision 0.0 86/02/19 18:36:47 ada
--
-- These files comprise the initial version of Ayacc
-- designed and implemented by <NAME> and <NAME>.
-- Ayacc has been compiled and tested under the Verdix Ada compiler
-- version 4.06 on a vax 11/750 running Unix 4.2BSD.
--
package body LALR_Symbol_Info is
SCCS_ID : constant String := "@(#) lalr_symbol_info_body.adadisk21~/rschm/hasee/sccs/ayacc, Version 1.2";
package Relation is
procedure Make_Reads_Relation;
procedure Make_Includes_Relation;
procedure Reads (LHS : Transition; RHS : in out Transition_Set);
procedure Includes(LHS : Transition; RHS : in out Transition_Set);
procedure Free_Includes;
end Relation;
package body Relation is
SCCS_ID : constant String := "@(#) lalr_symbol_info_body.adadisk21~/rschm/hasee/sccs/ayacc, Version 1.2";
package Includes_Relation is
new Ragged(Parse_State, Grammar_Symbol, Transition_Set,
Transition_Set_Pack.Make_Null);
procedure Make_Reads_Relation is
begin
-- Don't need to do anything. Get READS from the LR0 machine
null;
end Make_Reads_Relation;
-- Implements Algorithm D1 in Park's paper
-- "A New Analysis of LALR Formalisms" Park et al.
-- ACM Transactions on Programming Languages and Systems,
-- Vol 7,January 85.
use Includes_Relation, Item_Set_Pack,
Parse_State_Set_Pack, Transition_Set_Pack;
procedure Make_Includes_Relation is
Preds : Parse_State_Set;
Pred_Loop : Parse_State_Iterator;
Temp : Transition;
A , B : Grammar_Symbol;
R : Parse_State;
I : Item;
Items : Item_Set;
Item_Index : Item_Iterator;
begin
Make_Array(First_Parse_State,Last_Parse_State);
for Q in First_Parse_State .. Last_Parse_State loop
-- Loop over all items [B ->B1 . A B2] in state Q
-- Where A is a nonterminal and the string B2 is nullable.
Get_Kernel(Q, Items);
Closure(Items);
Initialize(Item_Index, Items);
while More(Item_Index) loop
Next(Item_Index,I);
-- Is the item of the form [B ->B1 . A B2] ?
if I.Dot_Position = Length_of(I.Rule_ID) then
goto Continue; -- Nothing to the right of dot
elsif I.Dot_Position + 1 < Get_Null_Pos(I.Rule_ID) then
goto Continue; -- B2 is not nullable
end if;
A := Get_RHS(I.Rule_ID, I.Dot_Position + 1);
B := Get_LHS(I.Rule_ID);
if Is_Terminal(A) then
goto Continue; -- A is not a nonterminal
end if;
-- for all states R in PRED(Q,B1) (Q,A) INCLUDES (R,B)
Make_Null(Preds);
Get_Pred_Set(Q,I,Preds);
Initialize(Pred_Loop, Preds);
while More(Pred_Loop) loop
Next(Pred_Loop, R);
Temp.State_ID := R;
Temp.Symbol := B;
Insert(Temp, Into => Includes_Relation.Lval(Q,A).Value);
end loop;
<<Continue>> null;
end loop;
end loop;
-- Free
Make_Null(Preds);
Make_Null(Items);
end Make_Includes_Relation;
procedure Free_Includes is
begin
Includes_Relation.Free_Array;
end Free_Includes;
use Grammar_Symbol_Set_Pack, Transition_Set_Pack;
procedure Reads (LHS : Transition; RHS : in out Transition_Set) is
Temp : Transition;
Gotos : Grammar_Symbol_Set;
Index : Grammar_Symbol_Iterator;
begin
Make_Null(RHS);
Temp.State_ID := Get_Goto(LHS.State_ID, LHS.Symbol);
Get_Transition_Symbols(Temp.State_ID, Nonterminals, Gotos);
Initialize(Index, Gotos);
while More(Index) loop
Next(Index, Temp.Symbol);
if Is_Nullable(Temp.Symbol) then
Insert(Temp, Into => RHS);
end if;
end loop;
-- Free
Make_Null(Gotos);
end Reads;
use Includes_Relation, Transition_Set_Pack;
procedure Includes (LHS : Transition; RHS : in out Transition_Set) is
begin
-- Free
Make_Null(RHS);
-- Could use fassign but dangerous
Assign(RHS, Includes_Relation.Lval(LHS.State_ID,LHS.Symbol).Value);
end Includes;
end Relation;
--------------------------------------------------------------------------
use Relation;
package LALR_Sets_Pack is
procedure Make_Dr_Sets;
procedure Make_Read_Sets;
procedure Make_Follow_Sets;
procedure Follow(
Trans : Transition;
Follow_Set: in out Grammar_Symbol_Set);
procedure Union_Follow_Sets(
Trans : Transition;
Follow_Set : in out Grammar_Symbol_Set);
end LALR_Sets_Pack;
package body LALR_Sets_Pack is
SCCS_ID : constant String := "@(#) lalr_symbol_info_body.adadisk21~/rschm/hasee/sccs/ayacc, Version 1.2";
-- The DR, Read, and Follow sets are all stored in the same data
-- structure in package lalr_sets.
type Relation_Type is (Use_Reads, Use_Includes);
package LALR_Sets is new
Ragged(Parse_State, Grammar_Symbol,
Grammar_Symbol_Set, Grammar_Symbol_Set_Pack.Make_Null);
use LALR_Sets, Grammar_Symbol_Set_Pack, Transition_Set_Pack;
procedure Make_Dr_Sets is
Trans : Transition;
-- gotos : transition_set;
Goto_Index : Nt_Transition_Iterator;
Term_Sym : Grammar_Symbol;
Terms : Grammar_Symbol_Set;
Term_Index : Grammar_Symbol_Iterator;
begin
-- Make storage to hold the DR sets.
LALR_Sets.Make_Array(First_Parse_State, Last_Parse_State);
-- DR(P,Symbol) = { x is a terminal|P -Symbol-> Next_State -x->}
for P in First_Parse_State..Last_Parse_State loop
-- Get all transitions (Symbol,Next_State) out of state P
-- get_transitions(P, nonterminals, gotos);
Initialize(Goto_Index, P);
while More(Goto_Index) loop
Next(Goto_Index, Trans);
Get_Transition_Symbols(Trans.State_ID, Terminals, Terms);
Initialize(Term_Index, Terms);
while More(Term_Index) loop
Next(Term_Index, Term_Sym);
Insert(Term_Sym,
Into => LALR_Sets.Lval(P,Trans.Symbol).Value);
end loop;
end loop;
end loop;
-- make_null(gotos);
Make_Null(Terms);
end Make_Dr_Sets;
procedure Initialize_N(X: in out Integer) is
begin
X := 0;
end Initialize_N;
procedure Digraph(R : Relation_Type) is
package N is new Ragged(Parse_State, Grammar_Symbol, Integer,
Initialize_N);
package Transition_Stack is new Stack_Pack(Transition);
use Transition_Stack, Transition_Set_Pack;
Trans_Stack : Stack;
Symbol : Grammar_Symbol;
Gotos : Grammar_Symbol_Set;
Goto_Index : Grammar_Symbol_Iterator;
Trans : Transition;
procedure Traverse(X: Transition) is
Infinity : constant Integer := Integer'Last;
Depth : Integer;
LALR_Sets_lval_Index : LALR_Sets.Index;
Minimum : Integer;
Y, Top : Transition;
RHS_Set : Transition_Iterator;
Related : Transition_Set;
begin
Push(Trans_Stack,X);
Depth := Depth_of_Stack(Trans_Stack);
N.Lval(X.State_ID,X.Symbol).Value := Depth;
-- Should take a procedure parameter instead of a key
if R = Use_Reads then
Reads(X, Related);
else
Includes(X, Related);
end if;
Initialize(RHS_Set, Related);
while More(RHS_Set) loop
Next(RHS_Set, Y);
if N.Lval(Y.State_ID, Y.Symbol).Value = 0 then
Traverse(Y);
end if;
Minimum := N.Rval(Y.State_ID, Y.Symbol).Value;
if Minimum < N.Rval(X.State_ID, X.Symbol).Value then
N.Lval(X.State_ID, X.Symbol).Value := Minimum;
end if;
Insert(LALR_Sets.Lval(Y.State_ID,Y.Symbol).Value,
Into => LALR_Sets.Lval(X.State_ID,X.Symbol).Value);
end loop;
if N.Rval(X.State_ID, X.Symbol).Value = Depth then
loop
Top := Top_Value(Trans_Stack);
N.Lval(Top.State_ID,Top.Symbol).Value:= Infinity;
LALR_Sets_lval_Index := LALR_Sets.Lval(Top.State_ID, Top.Symbol);
Assign(LALR_Sets_lval_Index.Value,
LALR_Sets.Rval(X.State_ID, X.Symbol).Value);
Pop(Trans_Stack, Top);
exit when Top = X;
end loop;
end if;
-- Free
Make_Null(Related);
exception
when Value_Range_Error =>
Put_Line("Ayacc: Value Range Error in Traverse");
raise;
when Stack_Underflow =>
Put_Line("Ayacc: Stack Underflow in Traverse");
raise;
when others =>
Put_Line("Ayacc: Unexpected Error in Traverse");
raise;
end Traverse;
begin -- digraph
Make_Stack(Trans_Stack);
N.Make_Array(First_Parse_State, Last_Parse_State);
-- Call traverse(X) for all unexamined nonterminal transitions X
for State in First_Parse_State .. Last_Parse_State loop
Get_Transition_Symbols(State, Nonterminals, Gotos);
Initialize(Goto_Index, Gotos);
while More(Goto_Index) loop
Next(Goto_Index, Symbol);
if N.Lval(State, Symbol).Value = 0 then
Trans.State_ID := State;
Trans.Symbol := Symbol;
Traverse(Trans);
end if;
end loop;
end loop;
Free_Stack(Trans_Stack);
N.Free_Array;
-- Free
Make_Null(Gotos);
exception
when Value_Range_Error =>
Put_Line("Ayacc: Value Range Error in Digraph");
raise;
when Stack_Underflow =>
Put_Line("Ayacc: Stack Underflow in Digraph");
raise;
when others =>
Put_Line("Ayacc: Unexpected Error in Digraph");
raise;
end Digraph;
procedure Make_Read_Sets is
begin
Digraph(Use_Reads);
end Make_Read_Sets;
procedure Make_Follow_Sets is
begin
Digraph(Use_Includes);
Free_Includes;
end Make_Follow_Sets;
procedure Follow(
Trans : Transition;
Follow_Set : in out Grammar_Symbol_Set) is
begin
Make_Null(Follow_Set);
Assign(Follow_Set,
LALR_Sets.Lval(Trans.State_ID,Trans.Symbol).Value);
-- used to rval
end Follow;
procedure Union_Follow_Sets(
Trans : Transition;
Follow_Set: in out Grammar_Symbol_Set) is
begin
Insert(LALR_Sets.Rval(Trans.State_ID,Trans.Symbol).Value,
Into => Follow_Set);
end Union_Follow_Sets;
end LALR_Sets_Pack;
--------------------------------------------------------------------------
use Relation, LALR_Sets_Pack;
procedure Make_LALR_Sets is
begin
Make_Dr_Sets;
Make_Reads_Relation;
Make_Read_Sets;
Make_Includes_Relation;
Make_Follow_Sets;
end Make_LALR_Sets;
--------------------------------------------------------------------------
use Grammar_Symbol_Set_Pack, Parse_State_Set_Pack;
procedure Get_LA(State_ID : Parse_State;
Item_ID : Item;
Look_Aheads : in out Grammar_Symbol_Set) is
Predecessors : Parse_State_Set;
Pred_Loop : Parse_State_Iterator;
Temp : Transition;
begin
Make_Null(Look_Aheads);
Temp.Symbol := Get_LHS(Item_ID.Rule_ID);
Make_Null(Predecessors);
Get_Pred_Set(State_ID, Item_ID ,Predecessors);
Initialize(Pred_Loop, Predecessors);
while More(Pred_Loop) loop
Next(Pred_Loop, Temp.State_ID);
Union_Follow_Sets(Temp, Look_Aheads);
end loop;
-- Free
Make_Null(Predecessors);
end Get_LA;
end LALR_Symbol_Info;
|
programs/oeis/110/A110916.asm | jmorken/loda | 1 | 91195 | <gh_stars>1-10
; A110916: Number of squares between 10n and 10n+9 (inclusive).
; 4,1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0
mov $3,$0
mov $5,2
lpb $5
mov $0,$3
sub $5,1
add $0,$5
sub $0,1
mul $0,5
sub $0,1
mov $2,3
lpb $0
sub $0,1
sub $0,$2
add $2,1
lpe
add $2,1
mov $4,$2
mov $6,$5
lpb $6
mov $1,$4
sub $6,1
lpe
lpe
lpb $3
sub $1,$4
mov $3,0
lpe
|
programs/oeis/306/A306472.asm | neoneye/loda | 22 | 240277 | ; A306472: a(n) = 37*27^n.
; 37,999,26973,728271,19663317,530909559,14334558093,387033068511,10449892849797,282147106944519,7617971887502013,205685240962554351,5553501505988967477,149944540661702121879,4048502597865957290733,109309570142380846849791,2951358393844282864944357
mov $1,27
pow $1,$0
mul $1,37
mov $0,$1
|
unittests/32Bit_ASM/X87/D9_FA.asm | cobalt2727/FEX | 628 | 101169 | %ifdef CONFIG
{
"RegData": {
"MM7": ["0x8000000000000000", "0x4001"]
},
"Mode": "32BIT"
}
%endif
lea edx, [data]
fld tword [edx + 8 * 0]
fsqrt
hlt
align 8
data:
dt 16.0
dq 0
|
Ada/src/fakelib/fakedsp-data_streams-files.adb | fintatarta/fakedsp | 0 | 10293 | <reponame>fintatarta/fakedsp
pragma Ada_2012;
with Ada.Strings.Fixed;
with Fakedsp.Data_Streams.Wave;
with Fakedsp.Data_Streams.Text;
with Utilities.Option_Lists;
use Ada;
use Utilities;
with Ada.Text_IO;
with Ada.Directories;
package body Fakedsp.Data_Streams.Files is
subtype Known_Types is
File_Type
range
File_Type'First .. File_Type'Pred (File_Type'Last);
subtype File_Extension is String (1 .. 3);
type Parsed_Filename (N : Positive) is
record
Name : String (1 .. N);
Typ : File_Type;
Options : Option_Lists.Option_List;
end record;
function Parse (Filename : String;
Format : File_Type) return Parsed_Filename
is
use Option_Lists;
Extension_To_Type : constant array (Known_Types) of File_Extension :=
(Wav_File => "wav",
Text_File => "txt");
------------------
-- Name_To_Type --
------------------
function Name_To_Type (Name : String;
Format : File_Type) return File_Type
is
begin
if Format /= Unknown then
return Format;
end if;
if Name = "-" then
if Format = Unknown or Format = Text_File then
return Text_File;
else
raise Text.Unimplemented_Format
with "Standard input only with text format";
end if;
end if;
declare
Ext : constant String := Ada.Directories.Extension (Name);
begin
Ada.Text_IO.Put_Line ("E=(" & Ext & ")(" & Name & ")" );
if Ext'Length /= File_Extension'Length then
return Unknown;
end if;
for T in File_Type loop
if Extension_To_Type (T) = Ext then
return T;
end if;
end loop;
end;
return Unknown;
end Name_To_Type;
Pos : constant Natural := Strings.Fixed.Index (Source => Filename,
Pattern => "::",
Going => Strings.Backward);
Optionless_Name : constant String := (if Pos = 0 then
Filename
else
Filename (Filename'First .. Pos - 1));
Options : constant Option_List := (if Pos = 0 then
Empty_List
else
Parse (Filename (Pos + 2 .. Filename'Last)));
begin
Ada.Text_IO.Put_Line ("F=(" & Optionless_Name & ")");
return Parsed_Filename'(N => Optionless_Name'Length,
Name => Optionless_Name,
Typ => Name_To_Type (Optionless_Name, Format),
Options => Options);
end Parse;
----------
-- Open --
----------
function Open (Filename : String;
Format : File_Type := Unknown)
return Data_Source_Access
is
Parsed : constant Parsed_Filename := Parse (Filename, Format);
begin
if Parsed.Name = "-" then
if Parsed.Typ = Unknown or Parsed.Typ = Text_File then
return Data_Source_Access (Text.Standard_Input (Parsed.Options));
else
raise Text.Unimplemented_Format
with "Standard input only with text format";
end if;
end if;
case Parsed.Typ is
when Wav_File =>
return Data_Source_Access (Wave.Open (Parsed.Name));
when Text_File =>
return Data_Source_Access (Text.Open_Source (Parsed.Name));
when Unknown =>
raise Constraint_Error with "Unknown file type for '" & Filename & "'";
end case;
end Open;
----------
-- Open --
----------
function Open (Filename : String;
Sampling : Frequency_Hz;
Format : File_Type := Unknown;
Last_Channel : Channel_Index := 1)
return Data_Destination_Access
is
Parsed : constant Parsed_Filename := Parse (Filename, Format);
begin
if Parsed.Name = "-" then
if Parsed.Typ = Unknown or Parsed.Typ = Text_File then
return Data_Destination_Access (Text.Standard_Output (Parsed.Options));
else
raise Text.Unimplemented_Format
with "Standard input only with text format";
end if;
end if;
case Parsed.Typ is
when Wav_File =>
return Data_Destination_Access (Wave.Open (Parsed.Name, Sampling, Last_Channel));
when Text_File =>
return Data_Destination_Access (Text.Open_Destination (Filename => Parsed.Name,
Options => Parsed.Options));
when Unknown =>
raise Constraint_Error with "Unknown file type for '" & Filename & "'";
end case;
end Open;
end Fakedsp.Data_Streams.Files;
|
src/main/antlr/com/deflatedpickle/rawky/jasc_pal/JASC_PAL.g4 | DeflatedPickle/Rawky | 25 | 4799 | grammar JASC_PAL;
@header {
package com.deflatedpickle.rawky.jasc_pal;
}
start: header NEWLINE version NEWLINE colour_count (NEWLINE rgb)+;
header: 'JASC-PAL';
version: INT;
colour_count: INT;
rgb: INT SPACE INT SPACE INT;
SPACE: ' ';
NEWLINE: '\r\n' | '\n';
INT: [0-9]+; |
programas/ensamblador/division_con_saltos.asm | AdolfoMX/La-Biblioteca | 0 | 17670 | ; division de un numero haciendo uso de registros de saltos
;------------- Seccion de datos -------------
section .data
; cadena de texto
msg db 0xA,0xD,"no es posible dividir entre cero",0xA,0xD
lonmsg equ $-msg
section .bss
resultado resb 1
;------------- Seccion de texto -------------
section .text
global _start:
_start:
mov eax, 4 ; variable donde almacena un 4 para la division
mov edx, 0
mov ebx, 2 ; variable donde almacena un 2 para la division
cmp ebx, 0 ; compara ebx si es un valor cero
je escero
div ebx ; division de forma implicita
add ebx, 48
mov [resultado], ebx
; impresion de mensaje por pantalla
mov eax, 4
mov ebx, 1
mov ecx, resultado
mov edx, 1
int 0x80
jmp salir
; manda un mensaje si el denominador es un cero
escero:
mov eax, 4
mov ebx, 1
mov ecx, msg
mov edx, lonmsg
int 0x80
; indica a la maquina si el programa se ejecuto de forma exitosa
salir:
mov eax, 1
mov ebx, 0
int 0x80
|
src/Tactic/Reflection/Replace.agda | lclem/agda-prelude | 0 | 11034 | <gh_stars>0
module Tactic.Reflection.Replace where
open import Prelude
open import Container.Traversable
open import Tactic.Reflection
open import Tactic.Reflection.Equality
{-# TERMINATING #-}
_r[_/_] : Term → Term → Term → Term
p r[ r / l ] =
ifYes p == l
then r
else case p of λ
{ (var x args) → var x $ args r₂[ r / l ]
; (con c args) → con c $ args r₂[ r / l ]
; (def f args) → def f $ args r₂[ r / l ]
; (lam v t) → lam v $ t r₁[ weaken 1 r / weaken 1 l ] -- lam v <$> t r₁[ weaken 1 r / weaken 1 l ]
; (pat-lam cs args) →
let w = length args in
pat-lam (replaceClause (weaken w l) (weaken w r) <$> cs) $ args r₂[ r / l ]
; (pi a b) → pi (a r₁[ r / l ]) (b r₁[ weaken 1 r / weaken 1 l ])
; (agda-sort s) → agda-sort $ replaceSort l r s
; (lit l) → lit l
; (meta x args) → meta x $ args r₂[ r / l ]
; unknown → unknown
}
where
replaceClause : Term → Term → Clause → Clause
replaceClause l r (clause pats x) = clause pats $ x r[ r / l ]
replaceClause l r (absurd-clause pats) = absurd-clause pats
replaceSort : Term → Term → Sort → Sort
replaceSort l r (set t) = set $ t r[ r / l ]
replaceSort l r (lit n) = lit n
replaceSort l r unknown = unknown
_r₁[_/_] : {T₀ : Set → Set} {{_ : Traversable T₀}} → T₀ Term → Term → Term → T₀ Term
p r₁[ r / l ] = _r[ r / l ] <$> p
_r₂[_/_] : {T₀ T₁ : Set → Set} {{_ : Traversable T₀}} {{_ : Traversable T₁}} →
T₁ (T₀ Term) → Term → Term → T₁ (T₀ Term)
p r₂[ r / l ] = fmap _r[ r / l ] <$> p
_R[_/_] : List (Arg Type) → Type → Type → List (Arg Type)
Γ R[ L / R ] = go Γ (strengthen 1 L) (strengthen 1 R) where
go : List (Arg Type) → Maybe Term → Maybe Term → List (Arg Type)
go (γ ∷ Γ) (just L) (just R) = (caseF γ of _r[ L / R ]) ∷ go Γ (strengthen 1 L) (strengthen 1 R)
go Γ _ _ = Γ
|
base64.asm | desynilaaa/FPA5 | 0 | 103383 | <reponame>desynilaaa/FPA5
_base64: file format elf32-i386
Disassembly of section .text:
00000000 <main>:
void Encode64(char* data,int lengths);
void Decode64(char* data, int lengths);
char* ToBinary(char* data, int dataLength, int limits);
char* base64_T ="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
int main(int argc, char *argv[]){
0: 8d 4c 24 04 lea 0x4(%esp),%ecx
4: 83 e4 f0 and $0xfffffff0,%esp
7: ff 71 fc pushl -0x4(%ecx)
a: 55 push %ebp
b: 89 e5 mov %esp,%ebp
d: 57 push %edi
e: 56 push %esi
f: 53 push %ebx
10: 51 push %ecx
11: 83 ec 28 sub $0x28,%esp
14: 8b 01 mov (%ecx),%eax
16: 8b 79 04 mov 0x4(%ecx),%edi
19: 89 c2 mov %eax,%edx
1b: 89 45 e0 mov %eax,-0x20(%ebp)
int i, dataLength=0;
char* bufferInput;
if(argv[2][0]!='\"'){
1e: 8b 47 08 mov 0x8(%edi),%eax
21: 80 38 22 cmpb $0x22,(%eax)
24: 0f 85 5d 01 00 00 jne 187 <main+0x187>
printf(1,"Invalid Syntax detected!\nSyntax base64 [--encode/--decode] \"[string to operate]\"\n");
exit();
}
for(i=2;i<(argc);i++){
2a: 31 f6 xor %esi,%esi
2c: 83 fa 02 cmp $0x2,%edx
2f: bb 02 00 00 00 mov $0x2,%ebx
34: 0f 8e 2c 01 00 00 jle 166 <main+0x166>
3a: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
dataLength+= strlen(argv[i])+1;
40: 83 ec 0c sub $0xc,%esp
43: ff 34 9f pushl (%edi,%ebx,4)
char* bufferInput;
if(argv[2][0]!='\"'){
printf(1,"Invalid Syntax detected!\nSyntax base64 [--encode/--decode] \"[string to operate]\"\n");
exit();
}
for(i=2;i<(argc);i++){
46: 83 c3 01 add $0x1,%ebx
dataLength+= strlen(argv[i])+1;
49: e8 22 05 00 00 call 570 <strlen>
char* bufferInput;
if(argv[2][0]!='\"'){
printf(1,"Invalid Syntax detected!\nSyntax base64 [--encode/--decode] \"[string to operate]\"\n");
exit();
}
for(i=2;i<(argc);i++){
4e: 83 c4 10 add $0x10,%esp
51: 39 5d e0 cmp %ebx,-0x20(%ebp)
dataLength+= strlen(argv[i])+1;
54: 8d 74 30 01 lea 0x1(%eax,%esi,1),%esi
char* bufferInput;
if(argv[2][0]!='\"'){
printf(1,"Invalid Syntax detected!\nSyntax base64 [--encode/--decode] \"[string to operate]\"\n");
exit();
}
for(i=2;i<(argc);i++){
58: 75 e6 jne 40 <main+0x40>
dataLength+= strlen(argv[i])+1;
}
dataLength--;
bufferInput = (char*)malloc(sizeof(char)*(dataLength+argc));
5a: 8b 5d e0 mov -0x20(%ebp),%ebx
5d: 83 ec 0c sub $0xc,%esp
60: 8d 44 1e ff lea -0x1(%esi,%ebx,1),%eax
64: 50 push %eax
65: e8 46 0a 00 00 call ab0 <malloc>
6a: 89 45 dc mov %eax,-0x24(%ebp)
6d: 89 d8 mov %ebx,%eax
6f: 83 c4 10 add $0x10,%esp
72: 83 e8 01 sub $0x1,%eax
75: c7 45 e4 00 00 00 00 movl $0x0,-0x1c(%ebp)
7c: bb 02 00 00 00 mov $0x2,%ebx
81: 89 45 d4 mov %eax,-0x2c(%ebp)
84: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
int points=0;
for(i=2;i<(argc);i++){
//sprintf(bufferInput+strlen(bufferInput),"%s",argv[i]);
int j;
int tempLength = strlen(argv[i]);
88: 83 ec 0c sub $0xc,%esp
8b: ff 34 9f pushl (%edi,%ebx,4)
8e: e8 dd 04 00 00 call 570 <strlen>
j=1;
}else{
j=0;
}
for(;j<tempLength;j++){
93: 31 c9 xor %ecx,%ecx
int points=0;
for(i=2;i<(argc);i++){
//sprintf(bufferInput+strlen(bufferInput),"%s",argv[i]);
int j;
int tempLength = strlen(argv[i]);
if(i==2){
95: 83 c4 10 add $0x10,%esp
j=1;
}else{
j=0;
}
for(;j<tempLength;j++){
98: 83 fb 02 cmp $0x2,%ebx
9b: 0f 94 c1 sete %cl
9e: 39 c8 cmp %ecx,%eax
a0: 89 4d d8 mov %ecx,-0x28(%ebp)
a3: 7e 25 jle ca <main+0xca>
bufferInput[points]=argv[i][j];
a5: 8b 75 e4 mov -0x1c(%ebp),%esi
j=1;
}else{
j=0;
}
for(;j<tempLength;j++){
a8: 89 ca mov %ecx,%edx
bufferInput[points]=argv[i][j];
aa: 29 ce sub %ecx,%esi
ac: 03 75 dc add -0x24(%ebp),%esi
af: 90 nop
b0: 8b 0c 9f mov (%edi,%ebx,4),%ecx
b3: 0f b6 0c 11 movzbl (%ecx,%edx,1),%ecx
b7: 88 0c 16 mov %cl,(%esi,%edx,1)
ba: 83 c2 01 add $0x1,%edx
j=1;
}else{
j=0;
}
for(;j<tempLength;j++){
bd: 39 d0 cmp %edx,%eax
bf: 75 ef jne b0 <main+0xb0>
c1: 03 45 e4 add -0x1c(%ebp),%eax
c4: 2b 45 d8 sub -0x28(%ebp),%eax
c7: 89 45 e4 mov %eax,-0x1c(%ebp)
if(argv[i][j]=='\\'){
j++;
}
*/
}
if(i<(argc-1)){
ca: 3b 5d d4 cmp -0x2c(%ebp),%ebx
cd: 0f 8d c7 00 00 00 jge 19a <main+0x19a>
bufferInput[points]=' ';
d3: 8b 45 e4 mov -0x1c(%ebp),%eax
d6: 8b 75 dc mov -0x24(%ebp),%esi
d9: c6 04 06 20 movb $0x20,(%esi,%eax,1)
points++;
dd: 83 c0 01 add $0x1,%eax
e0: 89 45 e4 mov %eax,-0x1c(%ebp)
dataLength+= strlen(argv[i])+1;
}
dataLength--;
bufferInput = (char*)malloc(sizeof(char)*(dataLength+argc));
int points=0;
for(i=2;i<(argc);i++){
e3: 83 c3 01 add $0x1,%ebx
e6: 39 5d e0 cmp %ebx,-0x20(%ebp)
e9: 75 9d jne 88 <main+0x88>
bufferInput[points]='\0';
}
}
//printf(1,"%d %d\n %s\n",points,dataLength,bufferInput);
//printf(1,"%d %s\n",dataLength,bufferInput);
if(strcmp(argv[1],"--encode")==0){
eb: 83 ec 08 sub $0x8,%esp
ee: 68 a5 0b 00 00 push $0xba5
f3: ff 77 04 pushl 0x4(%edi)
f6: e8 25 04 00 00 call 520 <strcmp>
fb: 83 c4 10 add $0x10,%esp
fe: 85 c0 test %eax,%eax
100: 74 52 je 154 <main+0x154>
Encode64(bufferInput,points);
}else if(strcmp(argv[1],"--decode")==0){
102: 51 push %ecx
103: 51 push %ecx
104: 68 ae 0b 00 00 push $0xbae
109: ff 77 04 pushl 0x4(%edi)
10c: e8 0f 04 00 00 call 520 <strcmp>
111: 83 c4 10 add $0x10,%esp
114: 85 c0 test %eax,%eax
116: 74 2a je 142 <main+0x142>
Decode64(bufferInput,points);
}else{
printf(1,"No Valid Command Was Found!\n");
118: 50 push %eax
119: 50 push %eax
11a: 68 b7 0b 00 00 push $0xbb7
11f: 6a 01 push $0x1
121: e8 5a 07 00 00 call 880 <printf>
126: 83 c4 10 add $0x10,%esp
Encode64("fooba");
Encode64("foobar");
Encode64("<NAME>., <NAME>., <NAME>., and <NAME>,");
Decode64("Q2FsbGFzLCBKLiwgRG9ubmVyaGFja2UsIEwuLCBGaW5uZXksIEguLCBhbmQgUi4gVGhheWVyLA==");
*/
free(bufferInput);
129: 83 ec 0c sub $0xc,%esp
12c: ff 75 dc pushl -0x24(%ebp)
12f: e8 ec 08 00 00 call a20 <free>
return 0;
}
134: 8d 65 f0 lea -0x10(%ebp),%esp
137: 31 c0 xor %eax,%eax
139: 59 pop %ecx
13a: 5b pop %ebx
13b: 5e pop %esi
13c: 5f pop %edi
13d: 5d pop %ebp
13e: 8d 61 fc lea -0x4(%ecx),%esp
141: c3 ret
//printf(1,"%d %d\n %s\n",points,dataLength,bufferInput);
//printf(1,"%d %s\n",dataLength,bufferInput);
if(strcmp(argv[1],"--encode")==0){
Encode64(bufferInput,points);
}else if(strcmp(argv[1],"--decode")==0){
Decode64(bufferInput,points);
142: 52 push %edx
143: 52 push %edx
144: ff 75 e4 pushl -0x1c(%ebp)
147: ff 75 dc pushl -0x24(%ebp)
14a: e8 91 02 00 00 call 3e0 <Decode64>
14f: 83 c4 10 add $0x10,%esp
152: eb d5 jmp 129 <main+0x129>
}
}
//printf(1,"%d %d\n %s\n",points,dataLength,bufferInput);
//printf(1,"%d %s\n",dataLength,bufferInput);
if(strcmp(argv[1],"--encode")==0){
Encode64(bufferInput,points);
154: 53 push %ebx
155: 53 push %ebx
156: ff 75 e4 pushl -0x1c(%ebp)
159: ff 75 dc pushl -0x24(%ebp)
15c: e8 7f 01 00 00 call 2e0 <Encode64>
161: 83 c4 10 add $0x10,%esp
164: eb c3 jmp 129 <main+0x129>
}
for(i=2;i<(argc);i++){
dataLength+= strlen(argv[i])+1;
}
dataLength--;
bufferInput = (char*)malloc(sizeof(char)*(dataLength+argc));
166: 8b 45 e0 mov -0x20(%ebp),%eax
169: 83 ec 0c sub $0xc,%esp
16c: 83 e8 01 sub $0x1,%eax
16f: 50 push %eax
170: e8 3b 09 00 00 call ab0 <malloc>
175: 83 c4 10 add $0x10,%esp
178: 89 45 dc mov %eax,-0x24(%ebp)
int points=0;
17b: c7 45 e4 00 00 00 00 movl $0x0,-0x1c(%ebp)
182: e9 64 ff ff ff jmp eb <main+0xeb>
char* base64_T ="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
int main(int argc, char *argv[]){
int i, dataLength=0;
char* bufferInput;
if(argv[2][0]!='\"'){
printf(1,"Invalid Syntax detected!\nSyntax base64 [--encode/--decode] \"[string to operate]\"\n");
187: 56 push %esi
188: 56 push %esi
189: 68 d4 0b 00 00 push $0xbd4
18e: 6a 01 push $0x1
190: e8 eb 06 00 00 call 880 <printf>
exit();
195: e8 98 05 00 00 call 732 <exit>
}
if(i<(argc-1)){
bufferInput[points]=' ';
points++;
}else{
points--;
19a: 83 6d e4 01 subl $0x1,-0x1c(%ebp)
bufferInput[points]='\0';
19e: 8b 75 dc mov -0x24(%ebp),%esi
}
if(i<(argc-1)){
bufferInput[points]=' ';
points++;
}else{
points--;
1a1: 8b 45 e4 mov -0x1c(%ebp),%eax
bufferInput[points]='\0';
1a4: c6 04 06 00 movb $0x0,(%esi,%eax,1)
1a8: e9 36 ff ff ff jmp e3 <main+0xe3>
1ad: 66 90 xchg %ax,%ax
1af: 90 nop
000001b0 <ToBinary>:
}
//printf("Length %d\n",length);
free (binaryBuffer);
printf(1,"\n");
}
char* ToBinary(char* data,int dataLength, int limits){
1b0: 55 push %ebp
1b1: 89 e5 mov %esp,%ebp
1b3: 57 push %edi
1b4: 56 push %esi
1b5: 53 push %ebx
1b6: 81 ec a8 00 00 00 sub $0xa8,%esp
1bc: 8b 5d 0c mov 0xc(%ebp),%ebx
1bf: 8b 75 08 mov 0x8(%ebp),%esi
char* tempBinaryBuffer = (char*)malloc(sizeof(char)*(dataLength+1)*(limits));
1c2: 8d 43 01 lea 0x1(%ebx),%eax
1c5: 0f af 45 10 imul 0x10(%ebp),%eax
1c9: 50 push %eax
1ca: e8 e1 08 00 00 call ab0 <malloc>
int bufferLength = 0,i,temp;
for(i=0,temp=data[i],i++;i<=dataLength;temp = data[i],i++){
1cf: 83 c4 10 add $0x10,%esp
1d2: 85 db test %ebx,%ebx
//printf("Length %d\n",length);
free (binaryBuffer);
printf(1,"\n");
}
char* ToBinary(char* data,int dataLength, int limits){
char* tempBinaryBuffer = (char*)malloc(sizeof(char)*(dataLength+1)*(limits));
1d4: 89 85 6c ff ff ff mov %eax,-0x94(%ebp)
int bufferLength = 0,i,temp;
for(i=0,temp=data[i],i++;i<=dataLength;temp = data[i],i++){
1da: 0f be 06 movsbl (%esi),%eax
1dd: 0f 8e ef 00 00 00 jle 2d2 <ToBinary+0x122>
1e3: 01 f3 add %esi,%ebx
1e5: 89 b5 74 ff ff ff mov %esi,-0x8c(%ebp)
1eb: 8b 75 10 mov 0x10(%ebp),%esi
1ee: 8d 7d 84 lea -0x7c(%ebp),%edi
1f1: 03 7d 10 add 0x10(%ebp),%edi
1f4: 89 9d 68 ff ff ff mov %ebx,-0x98(%ebp)
1fa: c7 85 70 ff ff ff 00 movl $0x0,-0x90(%ebp)
201: 00 00 00
204: 83 ee 01 sub $0x1,%esi
207: 89 b5 64 ff ff ff mov %esi,-0x9c(%ebp)
20d: 8d 75 83 lea -0x7d(%ebp),%esi
210: 31 d2 xor %edx,%edx
212: eb 06 jmp 21a <ToBinary+0x6a>
214: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
} while (temp=temp/2);
*/
while(1){
calc = temp%2;
tempBuffer[tempLoc] = calc;
tempLoc++;
218: 89 da mov %ebx,%edx
tempLoc++;
} while (temp=temp/2);
*/
while(1){
calc = temp%2;
tempBuffer[tempLoc] = calc;
21a: 89 c3 mov %eax,%ebx
21c: c1 eb 1f shr $0x1f,%ebx
21f: 8d 0c 18 lea (%eax,%ebx,1),%ecx
222: 83 e1 01 and $0x1,%ecx
225: 29 d9 sub %ebx,%ecx
tempLoc++;
227: 8d 5a 01 lea 0x1(%edx),%ebx
tempLoc++;
} while (temp=temp/2);
*/
while(1){
calc = temp%2;
tempBuffer[tempLoc] = calc;
22a: 88 4c 15 84 mov %cl,-0x7c(%ebp,%edx,1)
tempLoc++;
if(!(temp = temp/2)){
22e: 89 c1 mov %eax,%ecx
230: c1 e9 1f shr $0x1f,%ecx
233: 01 c8 add %ecx,%eax
235: d1 f8 sar %eax
237: 75 df jne 218 <ToBinary+0x68>
tempBuffer[tempLoc] = calc;
tempLoc++;
break;
}
}
while(tempLoc<limits){
239: 8d 42 02 lea 0x2(%edx),%eax
23c: 39 45 10 cmp %eax,0x10(%ebp)
calc = temp%2;
tempBuffer[tempLoc] = calc;
tempLoc++;
if(!(temp = temp/2)){
calc = temp%2;
tempBuffer[tempLoc] = calc;
23f: c6 44 1d 84 00 movb $0x0,-0x7c(%ebp,%ebx,1)
tempLoc++;
break;
}
}
while(tempLoc<limits){
244: 7e 14 jle 25a <ToBinary+0xaa>
246: 8d 55 84 lea -0x7c(%ebp),%edx
249: 01 d0 add %edx,%eax
24b: 90 nop
24c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
tempBuffer[tempLoc++] = 0;
250: c6 00 00 movb $0x0,(%eax)
253: 83 c0 01 add $0x1,%eax
tempBuffer[tempLoc] = calc;
tempLoc++;
break;
}
}
while(tempLoc<limits){
256: 39 f8 cmp %edi,%eax
258: 75 f6 jne 250 <ToBinary+0xa0>
tempBuffer[tempLoc++] = 0;
}
for(j=limits-1;j>=0;j--){
25a: 8b 45 10 mov 0x10(%ebp),%eax
25d: 85 c0 test %eax,%eax
25f: 7e 38 jle 299 <ToBinary+0xe9>
261: 8d 45 84 lea -0x7c(%ebp),%eax
264: 8b 95 6c ff ff ff mov -0x94(%ebp),%edx
26a: 03 85 64 ff ff ff add -0x9c(%ebp),%eax
270: 03 95 70 ff ff ff add -0x90(%ebp),%edx
276: 8d 76 00 lea 0x0(%esi),%esi
279: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
tempBinaryBuffer[bufferLength] = tempBuffer[j];
280: 0f b6 08 movzbl (%eax),%ecx
283: 83 e8 01 sub $0x1,%eax
286: 83 c2 01 add $0x1,%edx
289: 88 4a ff mov %cl,-0x1(%edx)
}
while(tempLoc<limits){
tempBuffer[tempLoc++] = 0;
}
for(j=limits-1;j>=0;j--){
28c: 39 f0 cmp %esi,%eax
28e: 75 f0 jne 280 <ToBinary+0xd0>
290: 8b 55 10 mov 0x10(%ebp),%edx
293: 01 95 70 ff ff ff add %edx,-0x90(%ebp)
printf(1,"\n");
}
char* ToBinary(char* data,int dataLength, int limits){
char* tempBinaryBuffer = (char*)malloc(sizeof(char)*(dataLength+1)*(limits));
int bufferLength = 0,i,temp;
for(i=0,temp=data[i],i++;i<=dataLength;temp = data[i],i++){
299: 8b 95 74 ff ff ff mov -0x8c(%ebp),%edx
29f: 0f be 42 01 movsbl 0x1(%edx),%eax
2a3: 83 c2 01 add $0x1,%edx
2a6: 3b 95 68 ff ff ff cmp -0x98(%ebp),%edx
2ac: 89 95 74 ff ff ff mov %edx,-0x8c(%ebp)
2b2: 0f 85 58 ff ff ff jne 210 <ToBinary+0x60>
2b8: 8b 85 70 ff ff ff mov -0x90(%ebp),%eax
bufferLength++;
}
//printf(1,"\n");
}
tempBinaryBuffer[bufferLength] = -1;
2be: 8b b5 6c ff ff ff mov -0x94(%ebp),%esi
2c4: c6 04 06 ff movb $0xff,(%esi,%eax,1)
//printf(1,"Buffer Length %d\n",bufferLength);
return tempBinaryBuffer;
}
2c8: 8d 65 f4 lea -0xc(%ebp),%esp
2cb: 89 f0 mov %esi,%eax
2cd: 5b pop %ebx
2ce: 5e pop %esi
2cf: 5f pop %edi
2d0: 5d pop %ebp
2d1: c3 ret
printf(1,"\n");
}
char* ToBinary(char* data,int dataLength, int limits){
char* tempBinaryBuffer = (char*)malloc(sizeof(char)*(dataLength+1)*(limits));
int bufferLength = 0,i,temp;
for(i=0,temp=data[i],i++;i<=dataLength;temp = data[i],i++){
2d2: 31 c0 xor %eax,%eax
2d4: eb e8 jmp 2be <ToBinary+0x10e>
2d6: 8d 76 00 lea 0x0(%esi),%esi
2d9: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
000002e0 <Encode64>:
Decode64("<KEY>);
*/
free(bufferInput);
return 0;
}
void Encode64(char* data, int lengths){
2e0: 55 push %ebp
2e1: 89 e5 mov %esp,%ebp
2e3: 57 push %edi
2e4: 56 push %esi
2e5: 53 push %ebx
char* binaryBuffer = ToBinary(data,lengths,8);
//printf(1,"%d %s\n",strlen(data),data);
int temp = 0,powTwo=32,length=0,i;
2e6: 31 ff xor %edi,%edi
2e8: 31 db xor %ebx,%ebx
Decode64("<KEY>);
*/
free(bufferInput);
return 0;
}
void Encode64(char* data, int lengths){
2ea: 83 ec 10 sub $0x10,%esp
char* binaryBuffer = ToBinary(data,lengths,8);
2ed: 6a 08 push $0x8
2ef: ff 75 0c pushl 0xc(%ebp)
2f2: ff 75 08 pushl 0x8(%ebp)
2f5: e8 b6 fe ff ff call 1b0 <ToBinary>
//printf(1,"%d %s\n",strlen(data),data);
int temp = 0,powTwo=32,length=0,i;
for(i=0;binaryBuffer[i]!=-1;i++){
2fa: 83 c4 10 add $0x10,%esp
*/
free(bufferInput);
return 0;
}
void Encode64(char* data, int lengths){
char* binaryBuffer = ToBinary(data,lengths,8);
2fd: 89 c6 mov %eax,%esi
//printf(1,"%d %s\n",strlen(data),data);
int temp = 0,powTwo=32,length=0,i;
2ff: b9 20 00 00 00 mov $0x20,%ecx
304: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
for(i=0;binaryBuffer[i]!=-1;i++){
308: 0f be 04 1e movsbl (%esi,%ebx,1),%eax
30c: 3c ff cmp $0xff,%al
30e: 74 3a je 34a <Encode64+0x6a>
length++;
temp += powTwo * binaryBuffer[i];
310: 0f af c1 imul %ecx,%eax
void Encode64(char* data, int lengths){
char* binaryBuffer = ToBinary(data,lengths,8);
//printf(1,"%d %s\n",strlen(data),data);
int temp = 0,powTwo=32,length=0,i;
for(i=0;binaryBuffer[i]!=-1;i++){
length++;
313: 83 c3 01 add $0x1,%ebx
temp += powTwo * binaryBuffer[i];
316: 01 c7 add %eax,%edi
powTwo/=2;
//printf(1,"%d",binaryBuffer[i]);
if((i+1)%6==0 || binaryBuffer[i+1]==-1){
318: b8 ab aa aa 2a mov $0x2aaaaaab,%eax
31d: f7 eb imul %ebx
31f: 89 d8 mov %ebx,%eax
321: c1 f8 1f sar $0x1f,%eax
324: 29 c2 sub %eax,%edx
326: 8d 04 52 lea (%edx,%edx,2),%eax
329: 01 c0 add %eax,%eax
32b: 39 c3 cmp %eax,%ebx
32d: 0f 84 7d 00 00 00 je 3b0 <Encode64+0xd0>
333: 80 3c 1e ff cmpb $0xff,(%esi,%ebx,1)
337: 74 77 je 3b0 <Encode64+0xd0>
//printf(1,"%d %s\n",strlen(data),data);
int temp = 0,powTwo=32,length=0,i;
for(i=0;binaryBuffer[i]!=-1;i++){
length++;
temp += powTwo * binaryBuffer[i];
powTwo/=2;
339: 89 c8 mov %ecx,%eax
33b: c1 e8 1f shr $0x1f,%eax
33e: 01 c1 add %eax,%ecx
}
void Encode64(char* data, int lengths){
char* binaryBuffer = ToBinary(data,lengths,8);
//printf(1,"%d %s\n",strlen(data),data);
int temp = 0,powTwo=32,length=0,i;
for(i=0;binaryBuffer[i]!=-1;i++){
340: 0f be 04 1e movsbl (%esi,%ebx,1),%eax
length++;
temp += powTwo * binaryBuffer[i];
powTwo/=2;
344: d1 f9 sar %ecx
}
void Encode64(char* data, int lengths){
char* binaryBuffer = ToBinary(data,lengths,8);
//printf(1,"%d %s\n",strlen(data),data);
int temp = 0,powTwo=32,length=0,i;
for(i=0;binaryBuffer[i]!=-1;i++){
346: 3c ff cmp $0xff,%al
348: 75 c6 jne 310 <Encode64+0x30>
printf(1,"%c",base64_T[temp]);
temp = 0;
}
}
//printf("%d",length%6);
for(int i=(6 - length%6)/2;i>0 && i<3;i--){
34a: 89 d8 mov %ebx,%eax
34c: ba ab aa aa 2a mov $0x2aaaaaab,%edx
351: f7 ea imul %edx
353: 89 d8 mov %ebx,%eax
355: c1 f8 1f sar $0x1f,%eax
358: 29 c2 sub %eax,%edx
35a: 8d 04 52 lea (%edx,%edx,2),%eax
35d: 01 c0 add %eax,%eax
35f: 29 d8 sub %ebx,%eax
361: 8d 58 06 lea 0x6(%eax),%ebx
364: d1 fb sar %ebx
366: 83 eb 01 sub $0x1,%ebx
369: 83 fb 01 cmp $0x1,%ebx
36c: 77 1c ja 38a <Encode64+0xaa>
36e: 66 90 xchg %ax,%ax
printf(1,"=");
370: 83 ec 08 sub $0x8,%esp
373: 83 eb 01 sub $0x1,%ebx
376: 68 a3 0b 00 00 push $0xba3
37b: 6a 01 push $0x1
37d: e8 fe 04 00 00 call 880 <printf>
printf(1,"%c",base64_T[temp]);
temp = 0;
}
}
//printf("%d",length%6);
for(int i=(6 - length%6)/2;i>0 && i<3;i--){
382: 83 c4 10 add $0x10,%esp
385: 83 fb 01 cmp $0x1,%ebx
388: 76 e6 jbe 370 <Encode64+0x90>
printf(1,"=");
}
printf(1,"\n");
38a: 83 ec 08 sub $0x8,%esp
38d: 68 d2 0b 00 00 push $0xbd2
392: 6a 01 push $0x1
394: e8 e7 04 00 00 call 880 <printf>
free(binaryBuffer);
399: 89 75 08 mov %esi,0x8(%ebp)
39c: 83 c4 10 add $0x10,%esp
}
39f: 8d 65 f4 lea -0xc(%ebp),%esp
3a2: 5b pop %ebx
3a3: 5e pop %esi
3a4: 5f pop %edi
3a5: 5d pop %ebp
//printf("%d",length%6);
for(int i=(6 - length%6)/2;i>0 && i<3;i--){
printf(1,"=");
}
printf(1,"\n");
free(binaryBuffer);
3a6: e9 75 06 00 00 jmp a20 <free>
3ab: 90 nop
3ac: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
powTwo/=2;
//printf(1,"%d",binaryBuffer[i]);
if((i+1)%6==0 || binaryBuffer[i+1]==-1){
powTwo = 32;
//printf(1,"<->");
printf(1,"%c",base64_T[temp]);
3b0: a1 c0 0f 00 00 mov 0xfc0,%eax
3b5: 83 ec 04 sub $0x4,%esp
3b8: 0f be 04 38 movsbl (%eax,%edi,1),%eax
temp = 0;
3bc: 31 ff xor %edi,%edi
powTwo/=2;
//printf(1,"%d",binaryBuffer[i]);
if((i+1)%6==0 || binaryBuffer[i+1]==-1){
powTwo = 32;
//printf(1,"<->");
printf(1,"%c",base64_T[temp]);
3be: 50 push %eax
3bf: 68 a0 0b 00 00 push $0xba0
3c4: 6a 01 push $0x1
3c6: e8 b5 04 00 00 call 880 <printf>
3cb: 83 c4 10 add $0x10,%esp
length++;
temp += powTwo * binaryBuffer[i];
powTwo/=2;
//printf(1,"%d",binaryBuffer[i]);
if((i+1)%6==0 || binaryBuffer[i+1]==-1){
powTwo = 32;
3ce: b9 20 00 00 00 mov $0x20,%ecx
3d3: e9 30 ff ff ff jmp 308 <Encode64+0x28>
3d8: 90 nop
3d9: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
000003e0 <Decode64>:
printf(1,"=");
}
printf(1,"\n");
free(binaryBuffer);
}
void Decode64(char* data, int lengths){
3e0: 55 push %ebp
3e1: 89 e5 mov %esp,%ebp
3e3: 57 push %edi
3e4: 56 push %esi
3e5: 53 push %ebx
3e6: 83 ec 18 sub $0x18,%esp
3e9: 8b 5d 08 mov 0x8(%ebp),%ebx
char* T_Data = (char*)malloc(sizeof(char)*(lengths));
3ec: ff 75 0c pushl 0xc(%ebp)
3ef: e8 bc 06 00 00 call ab0 <malloc>
int special=0,dataLength = 0,temp = 0,powTwo=128;
for(int i=0;data[i]!='\0';i++){
3f4: 0f b6 13 movzbl (%ebx),%edx
3f7: 83 c4 10 add $0x10,%esp
printf(1,"\n");
free(binaryBuffer);
}
void Decode64(char* data, int lengths){
char* T_Data = (char*)malloc(sizeof(char)*(lengths));
3fa: 89 c7 mov %eax,%edi
int special=0,dataLength = 0,temp = 0,powTwo=128;
for(int i=0;data[i]!='\0';i++){
3fc: 84 d2 test %dl,%dl
3fe: 0f 84 de 00 00 00 je 4e2 <Decode64+0x102>
404: 8d 4b 01 lea 0x1(%ebx),%ecx
407: 31 db xor %ebx,%ebx
409: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
if(data[i]=='='){
410: 80 fa 3d cmp $0x3d,%dl
413: 74 31 je 446 <Decode64+0x66>
special++;
}else{
int offset = 53;
if(data[i] >= 'a'){
415: 80 fa 60 cmp $0x60,%dl
418: 8d 42 b9 lea -0x47(%edx),%eax
41b: 7f 23 jg 440 <Decode64+0x60>
offset = 26 + data[i]-'a';
}else if(data[i] >= 'A'){
41d: 80 fa 40 cmp $0x40,%dl
420: 8d 42 bf lea -0x41(%edx),%eax
423: 7f 1b jg 440 <Decode64+0x60>
offset = 0 + data[i]-'A';
}else{
if(data[i]=='+'){
425: 80 fa 2b cmp $0x2b,%dl
428: b8 3e 00 00 00 mov $0x3e,%eax
42d: 74 11 je 440 <Decode64+0x60>
42f: 8d 72 04 lea 0x4(%edx),%esi
432: 80 fa 2f cmp $0x2f,%dl
435: b8 3f 00 00 00 mov $0x3f,%eax
43a: 0f 45 c6 cmovne %esi,%eax
43d: 8d 76 00 lea 0x0(%esi),%esi
}else{
offset += data[i] - '1';
}
}
//printf("Offset %d char : %c result %c\n",offset,data[i],base64_T[offset]);
T_Data[dataLength] = offset;
440: 88 04 1f mov %al,(%edi,%ebx,1)
dataLength++;
443: 83 c3 01 add $0x1,%ebx
446: 83 c1 01 add $0x1,%ecx
}
void Decode64(char* data, int lengths){
char* T_Data = (char*)malloc(sizeof(char)*(lengths));
int special=0,dataLength = 0,temp = 0,powTwo=128;
for(int i=0;data[i]!='\0';i++){
449: 0f b6 51 ff movzbl -0x1(%ecx),%edx
44d: 84 d2 test %dl,%dl
44f: 75 bf jne 410 <Decode64+0x30>
T_Data[dataLength] = offset;
dataLength++;
}
}
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
451: 83 ec 04 sub $0x4,%esp
free(binaryBuffer);
}
void Decode64(char* data, int lengths){
char* T_Data = (char*)malloc(sizeof(char)*(lengths));
int special=0,dataLength = 0,temp = 0,powTwo=128;
454: 31 f6 xor %esi,%esi
T_Data[dataLength] = offset;
dataLength++;
}
}
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
456: 6a 06 push $0x6
458: 53 push %ebx
int length = 0;
for(int i=0;binaryBuffer[i]!=-1;i++){
459: 31 db xor %ebx,%ebx
T_Data[dataLength] = offset;
dataLength++;
}
}
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
45b: 57 push %edi
45c: e8 4f fd ff ff call 1b0 <ToBinary>
int length = 0;
for(int i=0;binaryBuffer[i]!=-1;i++){
461: 83 c4 10 add $0x10,%esp
T_Data[dataLength] = offset;
dataLength++;
}
}
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
464: 89 c7 mov %eax,%edi
free(binaryBuffer);
}
void Decode64(char* data, int lengths){
char* T_Data = (char*)malloc(sizeof(char)*(lengths));
int special=0,dataLength = 0,temp = 0,powTwo=128;
466: b9 80 00 00 00 mov $0x80,%ecx
46b: 90 nop
46c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
}
}
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
int length = 0;
for(int i=0;binaryBuffer[i]!=-1;i++){
470: 0f be 14 1f movsbl (%edi,%ebx,1),%edx
474: 80 fa ff cmp $0xff,%dl
477: 74 43 je 4bc <Decode64+0xdc>
length++;
temp += powTwo * binaryBuffer[i];
479: 0f af d1 imul %ecx,%edx
powTwo/=2;
47c: 89 c8 mov %ecx,%eax
//printf("%d",binaryBuffer[i]);
if(((i+1)%8==0 || binaryBuffer[i+1]==-1) && temp != 0){
47e: 83 c3 01 add $0x1,%ebx
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
int length = 0;
for(int i=0;binaryBuffer[i]!=-1;i++){
length++;
temp += powTwo * binaryBuffer[i];
powTwo/=2;
481: c1 e8 1f shr $0x1f,%eax
484: 01 c1 add %eax,%ecx
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
int length = 0;
for(int i=0;binaryBuffer[i]!=-1;i++){
length++;
temp += powTwo * binaryBuffer[i];
486: 01 d6 add %edx,%esi
powTwo/=2;
488: d1 f9 sar %ecx
//printf("%d",binaryBuffer[i]);
if(((i+1)%8==0 || binaryBuffer[i+1]==-1) && temp != 0){
48a: f6 c3 07 test $0x7,%bl
48d: 74 06 je 495 <Decode64+0xb5>
48f: 80 3c 1f ff cmpb $0xff,(%edi,%ebx,1)
493: 75 db jne 470 <Decode64+0x90>
495: 85 f6 test %esi,%esi
497: 74 d7 je 470 <Decode64+0x90>
powTwo = 128;
//printf("<->");
printf(1,"%c",temp);
499: 83 ec 04 sub $0x4,%esp
49c: 56 push %esi
49d: 68 a0 0b 00 00 push $0xba0
temp = 0;
4a2: 31 f6 xor %esi,%esi
powTwo/=2;
//printf("%d",binaryBuffer[i]);
if(((i+1)%8==0 || binaryBuffer[i+1]==-1) && temp != 0){
powTwo = 128;
//printf("<->");
printf(1,"%c",temp);
4a4: 6a 01 push $0x1
4a6: e8 d5 03 00 00 call 880 <printf>
}
}
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
int length = 0;
for(int i=0;binaryBuffer[i]!=-1;i++){
4ab: 0f be 14 1f movsbl (%edi,%ebx,1),%edx
powTwo/=2;
//printf("%d",binaryBuffer[i]);
if(((i+1)%8==0 || binaryBuffer[i+1]==-1) && temp != 0){
powTwo = 128;
//printf("<->");
printf(1,"%c",temp);
4af: 83 c4 10 add $0x10,%esp
length++;
temp += powTwo * binaryBuffer[i];
powTwo/=2;
//printf("%d",binaryBuffer[i]);
if(((i+1)%8==0 || binaryBuffer[i+1]==-1) && temp != 0){
powTwo = 128;
4b2: b9 80 00 00 00 mov $0x80,%ecx
}
}
char* binaryBuffer = ToBinary(T_Data,dataLength,6);
int length = 0;
for(int i=0;binaryBuffer[i]!=-1;i++){
4b7: 80 fa ff cmp $0xff,%dl
4ba: 75 bd jne 479 <Decode64+0x99>
printf(1,"%c",temp);
temp = 0;
}
}
//printf("Length %d\n",length);
free (binaryBuffer);
4bc: 83 ec 0c sub $0xc,%esp
4bf: 57 push %edi
4c0: e8 5b 05 00 00 call a20 <free>
printf(1,"\n");
4c5: c7 45 0c d2 0b 00 00 movl $0xbd2,0xc(%ebp)
4cc: c7 45 08 01 00 00 00 movl $0x1,0x8(%ebp)
4d3: 83 c4 10 add $0x10,%esp
}
4d6: 8d 65 f4 lea -0xc(%ebp),%esp
4d9: 5b pop %ebx
4da: 5e pop %esi
4db: 5f pop %edi
4dc: 5d pop %ebp
temp = 0;
}
}
//printf("Length %d\n",length);
free (binaryBuffer);
printf(1,"\n");
4dd: e9 9e 03 00 00 jmp 880 <printf>
free(binaryBuffer);
}
void Decode64(char* data, int lengths){
char* T_Data = (char*)malloc(sizeof(char)*(lengths));
int special=0,dataLength = 0,temp = 0,powTwo=128;
4e2: 31 db xor %ebx,%ebx
4e4: e9 68 ff ff ff jmp 451 <Decode64+0x71>
4e9: 66 90 xchg %ax,%ax
4eb: 66 90 xchg %ax,%ax
4ed: 66 90 xchg %ax,%ax
4ef: 90 nop
000004f0 <strcpy>:
#include "user.h"
#include "x86.h"
char*
strcpy(char *s, char *t)
{
4f0: 55 push %ebp
4f1: 89 e5 mov %esp,%ebp
4f3: 53 push %ebx
4f4: 8b 45 08 mov 0x8(%ebp),%eax
4f7: 8b 4d 0c mov 0xc(%ebp),%ecx
char *os;
os = s;
while((*s++ = *t++) != 0)
4fa: 89 c2 mov %eax,%edx
4fc: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
500: 83 c1 01 add $0x1,%ecx
503: 0f b6 59 ff movzbl -0x1(%ecx),%ebx
507: 83 c2 01 add $0x1,%edx
50a: 84 db test %bl,%bl
50c: 88 5a ff mov %bl,-0x1(%edx)
50f: 75 ef jne 500 <strcpy+0x10>
;
return os;
}
511: 5b pop %ebx
512: 5d pop %ebp
513: c3 ret
514: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
51a: 8d bf 00 00 00 00 lea 0x0(%edi),%edi
00000520 <strcmp>:
int
strcmp(const char *p, const char *q)
{
520: 55 push %ebp
521: 89 e5 mov %esp,%ebp
523: 56 push %esi
524: 53 push %ebx
525: 8b 55 08 mov 0x8(%ebp),%edx
528: 8b 4d 0c mov 0xc(%ebp),%ecx
while(*p && *p == *q)
52b: 0f b6 02 movzbl (%edx),%eax
52e: 0f b6 19 movzbl (%ecx),%ebx
531: 84 c0 test %al,%al
533: 75 1e jne 553 <strcmp+0x33>
535: eb 29 jmp 560 <strcmp+0x40>
537: 89 f6 mov %esi,%esi
539: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
p++, q++;
540: 83 c2 01 add $0x1,%edx
}
int
strcmp(const char *p, const char *q)
{
while(*p && *p == *q)
543: 0f b6 02 movzbl (%edx),%eax
p++, q++;
546: 8d 71 01 lea 0x1(%ecx),%esi
}
int
strcmp(const char *p, const char *q)
{
while(*p && *p == *q)
549: 0f b6 59 01 movzbl 0x1(%ecx),%ebx
54d: 84 c0 test %al,%al
54f: 74 0f je 560 <strcmp+0x40>
551: 89 f1 mov %esi,%ecx
553: 38 d8 cmp %bl,%al
555: 74 e9 je 540 <strcmp+0x20>
p++, q++;
return (uchar)*p - (uchar)*q;
557: 29 d8 sub %ebx,%eax
}
559: 5b pop %ebx
55a: 5e pop %esi
55b: 5d pop %ebp
55c: c3 ret
55d: 8d 76 00 lea 0x0(%esi),%esi
}
int
strcmp(const char *p, const char *q)
{
while(*p && *p == *q)
560: 31 c0 xor %eax,%eax
p++, q++;
return (uchar)*p - (uchar)*q;
562: 29 d8 sub %ebx,%eax
}
564: 5b pop %ebx
565: 5e pop %esi
566: 5d pop %ebp
567: c3 ret
568: 90 nop
569: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
00000570 <strlen>:
uint
strlen(char *s)
{
570: 55 push %ebp
571: 89 e5 mov %esp,%ebp
573: 8b 4d 08 mov 0x8(%ebp),%ecx
int n;
for(n = 0; s[n]; n++)
576: 80 39 00 cmpb $0x0,(%ecx)
579: 74 12 je 58d <strlen+0x1d>
57b: 31 d2 xor %edx,%edx
57d: 8d 76 00 lea 0x0(%esi),%esi
580: 83 c2 01 add $0x1,%edx
583: 80 3c 11 00 cmpb $0x0,(%ecx,%edx,1)
587: 89 d0 mov %edx,%eax
589: 75 f5 jne 580 <strlen+0x10>
;
return n;
}
58b: 5d pop %ebp
58c: c3 ret
uint
strlen(char *s)
{
int n;
for(n = 0; s[n]; n++)
58d: 31 c0 xor %eax,%eax
;
return n;
}
58f: 5d pop %ebp
590: c3 ret
591: eb 0d jmp 5a0 <memset>
593: 90 nop
594: 90 nop
595: 90 nop
596: 90 nop
597: 90 nop
598: 90 nop
599: 90 nop
59a: 90 nop
59b: 90 nop
59c: 90 nop
59d: 90 nop
59e: 90 nop
59f: 90 nop
000005a0 <memset>:
void*
memset(void *dst, int c, uint n)
{
5a0: 55 push %ebp
5a1: 89 e5 mov %esp,%ebp
5a3: 57 push %edi
5a4: 8b 55 08 mov 0x8(%ebp),%edx
}
static inline void
stosb(void *addr, int data, int cnt)
{
asm volatile("cld; rep stosb" :
5a7: 8b 4d 10 mov 0x10(%ebp),%ecx
5aa: 8b 45 0c mov 0xc(%ebp),%eax
5ad: 89 d7 mov %edx,%edi
5af: fc cld
5b0: f3 aa rep stos %al,%es:(%edi)
stosb(dst, c, n);
return dst;
}
5b2: 89 d0 mov %edx,%eax
5b4: 5f pop %edi
5b5: 5d pop %ebp
5b6: c3 ret
5b7: 89 f6 mov %esi,%esi
5b9: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
000005c0 <strchr>:
char*
strchr(const char *s, char c)
{
5c0: 55 push %ebp
5c1: 89 e5 mov %esp,%ebp
5c3: 53 push %ebx
5c4: 8b 45 08 mov 0x8(%ebp),%eax
5c7: 8b 5d 0c mov 0xc(%ebp),%ebx
for(; *s; s++)
5ca: 0f b6 10 movzbl (%eax),%edx
5cd: 84 d2 test %dl,%dl
5cf: 74 1d je 5ee <strchr+0x2e>
if(*s == c)
5d1: 38 d3 cmp %dl,%bl
5d3: 89 d9 mov %ebx,%ecx
5d5: 75 0d jne 5e4 <strchr+0x24>
5d7: eb 17 jmp 5f0 <strchr+0x30>
5d9: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
5e0: 38 ca cmp %cl,%dl
5e2: 74 0c je 5f0 <strchr+0x30>
}
char*
strchr(const char *s, char c)
{
for(; *s; s++)
5e4: 83 c0 01 add $0x1,%eax
5e7: 0f b6 10 movzbl (%eax),%edx
5ea: 84 d2 test %dl,%dl
5ec: 75 f2 jne 5e0 <strchr+0x20>
if(*s == c)
return (char*)s;
return 0;
5ee: 31 c0 xor %eax,%eax
}
5f0: 5b pop %ebx
5f1: 5d pop %ebp
5f2: c3 ret
5f3: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
5f9: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
00000600 <gets>:
char*
gets(char *buf, int max)
{
600: 55 push %ebp
601: 89 e5 mov %esp,%ebp
603: 57 push %edi
604: 56 push %esi
605: 53 push %ebx
int i, cc;
char c;
for(i=0; i+1 < max; ){
606: 31 f6 xor %esi,%esi
cc = read(0, &c, 1);
608: 8d 7d e7 lea -0x19(%ebp),%edi
return 0;
}
char*
gets(char *buf, int max)
{
60b: 83 ec 1c sub $0x1c,%esp
int i, cc;
char c;
for(i=0; i+1 < max; ){
60e: eb 29 jmp 639 <gets+0x39>
cc = read(0, &c, 1);
610: 83 ec 04 sub $0x4,%esp
613: 6a 01 push $0x1
615: 57 push %edi
616: 6a 00 push $0x0
618: e8 2d 01 00 00 call 74a <read>
if(cc < 1)
61d: 83 c4 10 add $0x10,%esp
620: 85 c0 test %eax,%eax
622: 7e 1d jle 641 <gets+0x41>
break;
buf[i++] = c;
624: 0f b6 45 e7 movzbl -0x19(%ebp),%eax
628: 8b 55 08 mov 0x8(%ebp),%edx
62b: 89 de mov %ebx,%esi
if(c == '\n' || c == '\r')
62d: 3c 0a cmp $0xa,%al
for(i=0; i+1 < max; ){
cc = read(0, &c, 1);
if(cc < 1)
break;
buf[i++] = c;
62f: 88 44 1a ff mov %al,-0x1(%edx,%ebx,1)
if(c == '\n' || c == '\r')
633: 74 1b je 650 <gets+0x50>
635: 3c 0d cmp $0xd,%al
637: 74 17 je 650 <gets+0x50>
gets(char *buf, int max)
{
int i, cc;
char c;
for(i=0; i+1 < max; ){
639: 8d 5e 01 lea 0x1(%esi),%ebx
63c: 3b 5d 0c cmp 0xc(%ebp),%ebx
63f: 7c cf jl 610 <gets+0x10>
break;
buf[i++] = c;
if(c == '\n' || c == '\r')
break;
}
buf[i] = '\0';
641: 8b 45 08 mov 0x8(%ebp),%eax
644: c6 04 30 00 movb $0x0,(%eax,%esi,1)
return buf;
}
648: 8d 65 f4 lea -0xc(%ebp),%esp
64b: 5b pop %ebx
64c: 5e pop %esi
64d: 5f pop %edi
64e: 5d pop %ebp
64f: c3 ret
break;
buf[i++] = c;
if(c == '\n' || c == '\r')
break;
}
buf[i] = '\0';
650: 8b 45 08 mov 0x8(%ebp),%eax
gets(char *buf, int max)
{
int i, cc;
char c;
for(i=0; i+1 < max; ){
653: 89 de mov %ebx,%esi
break;
buf[i++] = c;
if(c == '\n' || c == '\r')
break;
}
buf[i] = '\0';
655: c6 04 30 00 movb $0x0,(%eax,%esi,1)
return buf;
}
659: 8d 65 f4 lea -0xc(%ebp),%esp
65c: 5b pop %ebx
65d: 5e pop %esi
65e: 5f pop %edi
65f: 5d pop %ebp
660: c3 ret
661: eb 0d jmp 670 <stat>
663: 90 nop
664: 90 nop
665: 90 nop
666: 90 nop
667: 90 nop
668: 90 nop
669: 90 nop
66a: 90 nop
66b: 90 nop
66c: 90 nop
66d: 90 nop
66e: 90 nop
66f: 90 nop
00000670 <stat>:
int
stat(char *n, struct stat *st)
{
670: 55 push %ebp
671: 89 e5 mov %esp,%ebp
673: 56 push %esi
674: 53 push %ebx
int fd;
int r;
fd = open(n, O_RDONLY);
675: 83 ec 08 sub $0x8,%esp
678: 6a 00 push $0x0
67a: ff 75 08 pushl 0x8(%ebp)
67d: e8 f0 00 00 00 call 772 <open>
if(fd < 0)
682: 83 c4 10 add $0x10,%esp
685: 85 c0 test %eax,%eax
687: 78 27 js 6b0 <stat+0x40>
return -1;
r = fstat(fd, st);
689: 83 ec 08 sub $0x8,%esp
68c: ff 75 0c pushl 0xc(%ebp)
68f: 89 c3 mov %eax,%ebx
691: 50 push %eax
692: e8 f3 00 00 00 call 78a <fstat>
697: 89 c6 mov %eax,%esi
close(fd);
699: 89 1c 24 mov %ebx,(%esp)
69c: e8 b9 00 00 00 call 75a <close>
return r;
6a1: 83 c4 10 add $0x10,%esp
6a4: 89 f0 mov %esi,%eax
}
6a6: 8d 65 f8 lea -0x8(%ebp),%esp
6a9: 5b pop %ebx
6aa: 5e pop %esi
6ab: 5d pop %ebp
6ac: c3 ret
6ad: 8d 76 00 lea 0x0(%esi),%esi
int fd;
int r;
fd = open(n, O_RDONLY);
if(fd < 0)
return -1;
6b0: b8 ff ff ff ff mov $0xffffffff,%eax
6b5: eb ef jmp 6a6 <stat+0x36>
6b7: 89 f6 mov %esi,%esi
6b9: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
000006c0 <atoi>:
return r;
}
int
atoi(const char *s)
{
6c0: 55 push %ebp
6c1: 89 e5 mov %esp,%ebp
6c3: 53 push %ebx
6c4: 8b 4d 08 mov 0x8(%ebp),%ecx
int n;
n = 0;
while('0' <= *s && *s <= '9')
6c7: 0f be 11 movsbl (%ecx),%edx
6ca: 8d 42 d0 lea -0x30(%edx),%eax
6cd: 3c 09 cmp $0x9,%al
6cf: b8 00 00 00 00 mov $0x0,%eax
6d4: 77 1f ja 6f5 <atoi+0x35>
6d6: 8d 76 00 lea 0x0(%esi),%esi
6d9: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
n = n*10 + *s++ - '0';
6e0: 8d 04 80 lea (%eax,%eax,4),%eax
6e3: 83 c1 01 add $0x1,%ecx
6e6: 8d 44 42 d0 lea -0x30(%edx,%eax,2),%eax
atoi(const char *s)
{
int n;
n = 0;
while('0' <= *s && *s <= '9')
6ea: 0f be 11 movsbl (%ecx),%edx
6ed: 8d 5a d0 lea -0x30(%edx),%ebx
6f0: 80 fb 09 cmp $0x9,%bl
6f3: 76 eb jbe 6e0 <atoi+0x20>
n = n*10 + *s++ - '0';
return n;
}
6f5: 5b pop %ebx
6f6: 5d pop %ebp
6f7: c3 ret
6f8: 90 nop
6f9: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
00000700 <memmove>:
void*
memmove(void *vdst, void *vsrc, int n)
{
700: 55 push %ebp
701: 89 e5 mov %esp,%ebp
703: 56 push %esi
704: 53 push %ebx
705: 8b 5d 10 mov 0x10(%ebp),%ebx
708: 8b 45 08 mov 0x8(%ebp),%eax
70b: 8b 75 0c mov 0xc(%ebp),%esi
char *dst, *src;
dst = vdst;
src = vsrc;
while(n-- > 0)
70e: 85 db test %ebx,%ebx
710: 7e 14 jle 726 <memmove+0x26>
712: 31 d2 xor %edx,%edx
714: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
*dst++ = *src++;
718: 0f b6 0c 16 movzbl (%esi,%edx,1),%ecx
71c: 88 0c 10 mov %cl,(%eax,%edx,1)
71f: 83 c2 01 add $0x1,%edx
{
char *dst, *src;
dst = vdst;
src = vsrc;
while(n-- > 0)
722: 39 da cmp %ebx,%edx
724: 75 f2 jne 718 <memmove+0x18>
*dst++ = *src++;
return vdst;
}
726: 5b pop %ebx
727: 5e pop %esi
728: 5d pop %ebp
729: c3 ret
0000072a <fork>:
name: \
movl $SYS_ ## name, %eax; \
int $T_SYSCALL; \
ret
SYSCALL(fork)
72a: b8 01 00 00 00 mov $0x1,%eax
72f: cd 40 int $0x40
731: c3 ret
00000732 <exit>:
SYSCALL(exit)
732: b8 02 00 00 00 mov $0x2,%eax
737: cd 40 int $0x40
739: c3 ret
0000073a <wait>:
SYSCALL(wait)
73a: b8 03 00 00 00 mov $0x3,%eax
73f: cd 40 int $0x40
741: c3 ret
00000742 <pipe>:
SYSCALL(pipe)
742: b8 04 00 00 00 mov $0x4,%eax
747: cd 40 int $0x40
749: c3 ret
0000074a <read>:
SYSCALL(read)
74a: b8 05 00 00 00 mov $0x5,%eax
74f: cd 40 int $0x40
751: c3 ret
00000752 <write>:
SYSCALL(write)
752: b8 10 00 00 00 mov $0x10,%eax
757: cd 40 int $0x40
759: c3 ret
0000075a <close>:
SYSCALL(close)
75a: b8 15 00 00 00 mov $0x15,%eax
75f: cd 40 int $0x40
761: c3 ret
00000762 <kill>:
SYSCALL(kill)
762: b8 06 00 00 00 mov $0x6,%eax
767: cd 40 int $0x40
769: c3 ret
0000076a <exec>:
SYSCALL(exec)
76a: b8 07 00 00 00 mov $0x7,%eax
76f: cd 40 int $0x40
771: c3 ret
00000772 <open>:
SYSCALL(open)
772: b8 0f 00 00 00 mov $0xf,%eax
777: cd 40 int $0x40
779: c3 ret
0000077a <mknod>:
SYSCALL(mknod)
77a: b8 11 00 00 00 mov $0x11,%eax
77f: cd 40 int $0x40
781: c3 ret
00000782 <unlink>:
SYSCALL(unlink)
782: b8 12 00 00 00 mov $0x12,%eax
787: cd 40 int $0x40
789: c3 ret
0000078a <fstat>:
SYSCALL(fstat)
78a: b8 08 00 00 00 mov $0x8,%eax
78f: cd 40 int $0x40
791: c3 ret
00000792 <link>:
SYSCALL(link)
792: b8 13 00 00 00 mov $0x13,%eax
797: cd 40 int $0x40
799: c3 ret
0000079a <mkdir>:
SYSCALL(mkdir)
79a: b8 14 00 00 00 mov $0x14,%eax
79f: cd 40 int $0x40
7a1: c3 ret
000007a2 <chdir>:
SYSCALL(chdir)
7a2: b8 09 00 00 00 mov $0x9,%eax
7a7: cd 40 int $0x40
7a9: c3 ret
000007aa <dup>:
SYSCALL(dup)
7aa: b8 0a 00 00 00 mov $0xa,%eax
7af: cd 40 int $0x40
7b1: c3 ret
000007b2 <getpid>:
SYSCALL(getpid)
7b2: b8 0b 00 00 00 mov $0xb,%eax
7b7: cd 40 int $0x40
7b9: c3 ret
000007ba <sbrk>:
SYSCALL(sbrk)
7ba: b8 0c 00 00 00 mov $0xc,%eax
7bf: cd 40 int $0x40
7c1: c3 ret
000007c2 <sleep>:
SYSCALL(sleep)
7c2: b8 0d 00 00 00 mov $0xd,%eax
7c7: cd 40 int $0x40
7c9: c3 ret
000007ca <uptime>:
SYSCALL(uptime)
7ca: b8 0e 00 00 00 mov $0xe,%eax
7cf: cd 40 int $0x40
7d1: c3 ret
7d2: 66 90 xchg %ax,%ax
7d4: 66 90 xchg %ax,%ax
7d6: 66 90 xchg %ax,%ax
7d8: 66 90 xchg %ax,%ax
7da: 66 90 xchg %ax,%ax
7dc: 66 90 xchg %ax,%ax
7de: 66 90 xchg %ax,%ax
000007e0 <printint>:
write(fd, &c, 1);
}
static void
printint(int fd, int xx, int base, int sgn)
{
7e0: 55 push %ebp
7e1: 89 e5 mov %esp,%ebp
7e3: 57 push %edi
7e4: 56 push %esi
7e5: 53 push %ebx
7e6: 89 c6 mov %eax,%esi
7e8: 83 ec 3c sub $0x3c,%esp
char buf[16];
int i, neg;
uint x;
neg = 0;
if(sgn && xx < 0){
7eb: 8b 5d 08 mov 0x8(%ebp),%ebx
7ee: 85 db test %ebx,%ebx
7f0: 74 7e je 870 <printint+0x90>
7f2: 89 d0 mov %edx,%eax
7f4: c1 e8 1f shr $0x1f,%eax
7f7: 84 c0 test %al,%al
7f9: 74 75 je 870 <printint+0x90>
neg = 1;
x = -xx;
7fb: 89 d0 mov %edx,%eax
int i, neg;
uint x;
neg = 0;
if(sgn && xx < 0){
neg = 1;
7fd: c7 45 c4 01 00 00 00 movl $0x1,-0x3c(%ebp)
x = -xx;
804: f7 d8 neg %eax
806: 89 75 c0 mov %esi,-0x40(%ebp)
} else {
x = xx;
}
i = 0;
809: 31 ff xor %edi,%edi
80b: 8d 5d d7 lea -0x29(%ebp),%ebx
80e: 89 ce mov %ecx,%esi
810: eb 08 jmp 81a <printint+0x3a>
812: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
do{
buf[i++] = digits[x % base];
818: 89 cf mov %ecx,%edi
81a: 31 d2 xor %edx,%edx
81c: 8d 4f 01 lea 0x1(%edi),%ecx
81f: f7 f6 div %esi
821: 0f b6 92 74 0c 00 00 movzbl 0xc74(%edx),%edx
}while((x /= base) != 0);
828: 85 c0 test %eax,%eax
x = xx;
}
i = 0;
do{
buf[i++] = digits[x % base];
82a: 88 14 0b mov %dl,(%ebx,%ecx,1)
}while((x /= base) != 0);
82d: 75 e9 jne 818 <printint+0x38>
if(neg)
82f: 8b 45 c4 mov -0x3c(%ebp),%eax
832: 8b 75 c0 mov -0x40(%ebp),%esi
835: 85 c0 test %eax,%eax
837: 74 08 je 841 <printint+0x61>
buf[i++] = '-';
839: c6 44 0d d8 2d movb $0x2d,-0x28(%ebp,%ecx,1)
83e: 8d 4f 02 lea 0x2(%edi),%ecx
841: 8d 7c 0d d7 lea -0x29(%ebp,%ecx,1),%edi
845: 8d 76 00 lea 0x0(%esi),%esi
848: 0f b6 07 movzbl (%edi),%eax
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
84b: 83 ec 04 sub $0x4,%esp
84e: 83 ef 01 sub $0x1,%edi
851: 6a 01 push $0x1
853: 53 push %ebx
854: 56 push %esi
855: 88 45 d7 mov %al,-0x29(%ebp)
858: e8 f5 fe ff ff call 752 <write>
buf[i++] = digits[x % base];
}while((x /= base) != 0);
if(neg)
buf[i++] = '-';
while(--i >= 0)
85d: 83 c4 10 add $0x10,%esp
860: 39 df cmp %ebx,%edi
862: 75 e4 jne 848 <printint+0x68>
putc(fd, buf[i]);
}
864: 8d 65 f4 lea -0xc(%ebp),%esp
867: 5b pop %ebx
868: 5e pop %esi
869: 5f pop %edi
86a: 5d pop %ebp
86b: c3 ret
86c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
neg = 0;
if(sgn && xx < 0){
neg = 1;
x = -xx;
} else {
x = xx;
870: 89 d0 mov %edx,%eax
static char digits[] = "0123456789ABCDEF";
char buf[16];
int i, neg;
uint x;
neg = 0;
872: c7 45 c4 00 00 00 00 movl $0x0,-0x3c(%ebp)
879: eb 8b jmp 806 <printint+0x26>
87b: 90 nop
87c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
00000880 <printf>:
}
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
880: 55 push %ebp
881: 89 e5 mov %esp,%ebp
883: 57 push %edi
884: 56 push %esi
885: 53 push %ebx
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
886: 8d 45 10 lea 0x10(%ebp),%eax
}
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
889: 83 ec 2c sub $0x2c,%esp
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
88c: 8b 75 0c mov 0xc(%ebp),%esi
}
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
88f: 8b 7d 08 mov 0x8(%ebp),%edi
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
892: 89 45 d0 mov %eax,-0x30(%ebp)
895: 0f b6 1e movzbl (%esi),%ebx
898: 83 c6 01 add $0x1,%esi
89b: 84 db test %bl,%bl
89d: 0f 84 b0 00 00 00 je 953 <printf+0xd3>
8a3: 31 d2 xor %edx,%edx
8a5: eb 39 jmp 8e0 <printf+0x60>
8a7: 89 f6 mov %esi,%esi
8a9: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
c = fmt[i] & 0xff;
if(state == 0){
if(c == '%'){
8b0: 83 f8 25 cmp $0x25,%eax
8b3: 89 55 d4 mov %edx,-0x2c(%ebp)
state = '%';
8b6: ba 25 00 00 00 mov $0x25,%edx
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
c = fmt[i] & 0xff;
if(state == 0){
if(c == '%'){
8bb: 74 18 je 8d5 <printf+0x55>
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
8bd: 8d 45 e2 lea -0x1e(%ebp),%eax
8c0: 83 ec 04 sub $0x4,%esp
8c3: 88 5d e2 mov %bl,-0x1e(%ebp)
8c6: 6a 01 push $0x1
8c8: 50 push %eax
8c9: 57 push %edi
8ca: e8 83 fe ff ff call 752 <write>
8cf: 8b 55 d4 mov -0x2c(%ebp),%edx
8d2: 83 c4 10 add $0x10,%esp
8d5: 83 c6 01 add $0x1,%esi
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
8d8: 0f b6 5e ff movzbl -0x1(%esi),%ebx
8dc: 84 db test %bl,%bl
8de: 74 73 je 953 <printf+0xd3>
c = fmt[i] & 0xff;
if(state == 0){
8e0: 85 d2 test %edx,%edx
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
c = fmt[i] & 0xff;
8e2: 0f be cb movsbl %bl,%ecx
8e5: 0f b6 c3 movzbl %bl,%eax
if(state == 0){
8e8: 74 c6 je 8b0 <printf+0x30>
if(c == '%'){
state = '%';
} else {
putc(fd, c);
}
} else if(state == '%'){
8ea: 83 fa 25 cmp $0x25,%edx
8ed: 75 e6 jne 8d5 <printf+0x55>
if(c == 'd'){
8ef: 83 f8 64 cmp $0x64,%eax
8f2: 0f 84 f8 00 00 00 je 9f0 <printf+0x170>
printint(fd, *ap, 10, 1);
ap++;
} else if(c == 'x' || c == 'p'){
8f8: 81 e1 f7 00 00 00 and $0xf7,%ecx
8fe: 83 f9 70 cmp $0x70,%ecx
901: 74 5d je 960 <printf+0xe0>
printint(fd, *ap, 16, 0);
ap++;
} else if(c == 's'){
903: 83 f8 73 cmp $0x73,%eax
906: 0f 84 84 00 00 00 je 990 <printf+0x110>
s = "(null)";
while(*s != 0){
putc(fd, *s);
s++;
}
} else if(c == 'c'){
90c: 83 f8 63 cmp $0x63,%eax
90f: 0f 84 ea 00 00 00 je 9ff <printf+0x17f>
putc(fd, *ap);
ap++;
} else if(c == '%'){
915: 83 f8 25 cmp $0x25,%eax
918: 0f 84 c2 00 00 00 je 9e0 <printf+0x160>
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
91e: 8d 45 e7 lea -0x19(%ebp),%eax
921: 83 ec 04 sub $0x4,%esp
924: c6 45 e7 25 movb $0x25,-0x19(%ebp)
928: 6a 01 push $0x1
92a: 50 push %eax
92b: 57 push %edi
92c: e8 21 fe ff ff call 752 <write>
931: 83 c4 0c add $0xc,%esp
934: 8d 45 e6 lea -0x1a(%ebp),%eax
937: 88 5d e6 mov %bl,-0x1a(%ebp)
93a: 6a 01 push $0x1
93c: 50 push %eax
93d: 57 push %edi
93e: 83 c6 01 add $0x1,%esi
941: e8 0c fe ff ff call 752 <write>
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
946: 0f b6 5e ff movzbl -0x1(%esi),%ebx
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
94a: 83 c4 10 add $0x10,%esp
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
94d: 31 d2 xor %edx,%edx
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
94f: 84 db test %bl,%bl
951: 75 8d jne 8e0 <printf+0x60>
putc(fd, c);
}
state = 0;
}
}
}
953: 8d 65 f4 lea -0xc(%ebp),%esp
956: 5b pop %ebx
957: 5e pop %esi
958: 5f pop %edi
959: 5d pop %ebp
95a: c3 ret
95b: 90 nop
95c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
} else if(state == '%'){
if(c == 'd'){
printint(fd, *ap, 10, 1);
ap++;
} else if(c == 'x' || c == 'p'){
printint(fd, *ap, 16, 0);
960: 83 ec 0c sub $0xc,%esp
963: b9 10 00 00 00 mov $0x10,%ecx
968: 6a 00 push $0x0
96a: 8b 5d d0 mov -0x30(%ebp),%ebx
96d: 89 f8 mov %edi,%eax
96f: 8b 13 mov (%ebx),%edx
971: e8 6a fe ff ff call 7e0 <printint>
ap++;
976: 89 d8 mov %ebx,%eax
978: 83 c4 10 add $0x10,%esp
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
97b: 31 d2 xor %edx,%edx
if(c == 'd'){
printint(fd, *ap, 10, 1);
ap++;
} else if(c == 'x' || c == 'p'){
printint(fd, *ap, 16, 0);
ap++;
97d: 83 c0 04 add $0x4,%eax
980: 89 45 d0 mov %eax,-0x30(%ebp)
983: e9 4d ff ff ff jmp 8d5 <printf+0x55>
988: 90 nop
989: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
} else if(c == 's'){
s = (char*)*ap;
990: 8b 45 d0 mov -0x30(%ebp),%eax
993: 8b 18 mov (%eax),%ebx
ap++;
995: 83 c0 04 add $0x4,%eax
998: 89 45 d0 mov %eax,-0x30(%ebp)
if(s == 0)
s = "(null)";
99b: b8 6c 0c 00 00 mov $0xc6c,%eax
9a0: 85 db test %ebx,%ebx
9a2: 0f 44 d8 cmove %eax,%ebx
while(*s != 0){
9a5: 0f b6 03 movzbl (%ebx),%eax
9a8: 84 c0 test %al,%al
9aa: 74 23 je 9cf <printf+0x14f>
9ac: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
9b0: 88 45 e3 mov %al,-0x1d(%ebp)
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
9b3: 8d 45 e3 lea -0x1d(%ebp),%eax
9b6: 83 ec 04 sub $0x4,%esp
9b9: 6a 01 push $0x1
ap++;
if(s == 0)
s = "(null)";
while(*s != 0){
putc(fd, *s);
s++;
9bb: 83 c3 01 add $0x1,%ebx
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
9be: 50 push %eax
9bf: 57 push %edi
9c0: e8 8d fd ff ff call 752 <write>
} else if(c == 's'){
s = (char*)*ap;
ap++;
if(s == 0)
s = "(null)";
while(*s != 0){
9c5: 0f b6 03 movzbl (%ebx),%eax
9c8: 83 c4 10 add $0x10,%esp
9cb: 84 c0 test %al,%al
9cd: 75 e1 jne 9b0 <printf+0x130>
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
9cf: 31 d2 xor %edx,%edx
9d1: e9 ff fe ff ff jmp 8d5 <printf+0x55>
9d6: 8d 76 00 lea 0x0(%esi),%esi
9d9: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
9e0: 83 ec 04 sub $0x4,%esp
9e3: 88 5d e5 mov %bl,-0x1b(%ebp)
9e6: 8d 45 e5 lea -0x1b(%ebp),%eax
9e9: 6a 01 push $0x1
9eb: e9 4c ff ff ff jmp 93c <printf+0xbc>
} else {
putc(fd, c);
}
} else if(state == '%'){
if(c == 'd'){
printint(fd, *ap, 10, 1);
9f0: 83 ec 0c sub $0xc,%esp
9f3: b9 0a 00 00 00 mov $0xa,%ecx
9f8: 6a 01 push $0x1
9fa: e9 6b ff ff ff jmp 96a <printf+0xea>
9ff: 8b 5d d0 mov -0x30(%ebp),%ebx
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
a02: 83 ec 04 sub $0x4,%esp
a05: 8b 03 mov (%ebx),%eax
a07: 6a 01 push $0x1
a09: 88 45 e4 mov %al,-0x1c(%ebp)
a0c: 8d 45 e4 lea -0x1c(%ebp),%eax
a0f: 50 push %eax
a10: 57 push %edi
a11: e8 3c fd ff ff call 752 <write>
a16: e9 5b ff ff ff jmp 976 <printf+0xf6>
a1b: 66 90 xchg %ax,%ax
a1d: 66 90 xchg %ax,%ax
a1f: 90 nop
00000a20 <free>:
static Header base;
static Header *freep;
void
free(void *ap)
{
a20: 55 push %ebp
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
a21: a1 c4 0f 00 00 mov 0xfc4,%eax
static Header base;
static Header *freep;
void
free(void *ap)
{
a26: 89 e5 mov %esp,%ebp
a28: 57 push %edi
a29: 56 push %esi
a2a: 53 push %ebx
a2b: 8b 5d 08 mov 0x8(%ebp),%ebx
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
a2e: 8b 10 mov (%eax),%edx
void
free(void *ap)
{
Header *bp, *p;
bp = (Header*)ap - 1;
a30: 8d 4b f8 lea -0x8(%ebx),%ecx
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
a33: 39 c8 cmp %ecx,%eax
a35: 73 19 jae a50 <free+0x30>
a37: 89 f6 mov %esi,%esi
a39: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
a40: 39 d1 cmp %edx,%ecx
a42: 72 1c jb a60 <free+0x40>
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
a44: 39 d0 cmp %edx,%eax
a46: 73 18 jae a60 <free+0x40>
static Header base;
static Header *freep;
void
free(void *ap)
{
a48: 89 d0 mov %edx,%eax
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
a4a: 39 c8 cmp %ecx,%eax
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
a4c: 8b 10 mov (%eax),%edx
free(void *ap)
{
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
a4e: 72 f0 jb a40 <free+0x20>
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
a50: 39 d0 cmp %edx,%eax
a52: 72 f4 jb a48 <free+0x28>
a54: 39 d1 cmp %edx,%ecx
a56: 73 f0 jae a48 <free+0x28>
a58: 90 nop
a59: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
break;
if(bp + bp->s.size == p->s.ptr){
a60: 8b 73 fc mov -0x4(%ebx),%esi
a63: 8d 3c f1 lea (%ecx,%esi,8),%edi
a66: 39 d7 cmp %edx,%edi
a68: 74 19 je a83 <free+0x63>
bp->s.size += p->s.ptr->s.size;
bp->s.ptr = p->s.ptr->s.ptr;
} else
bp->s.ptr = p->s.ptr;
a6a: 89 53 f8 mov %edx,-0x8(%ebx)
if(p + p->s.size == bp){
a6d: 8b 50 04 mov 0x4(%eax),%edx
a70: 8d 34 d0 lea (%eax,%edx,8),%esi
a73: 39 f1 cmp %esi,%ecx
a75: 74 23 je a9a <free+0x7a>
p->s.size += bp->s.size;
p->s.ptr = bp->s.ptr;
} else
p->s.ptr = bp;
a77: 89 08 mov %ecx,(%eax)
freep = p;
a79: a3 c4 0f 00 00 mov %eax,0xfc4
}
a7e: 5b pop %ebx
a7f: 5e pop %esi
a80: 5f pop %edi
a81: 5d pop %ebp
a82: c3 ret
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
break;
if(bp + bp->s.size == p->s.ptr){
bp->s.size += p->s.ptr->s.size;
a83: 03 72 04 add 0x4(%edx),%esi
a86: 89 73 fc mov %esi,-0x4(%ebx)
bp->s.ptr = p->s.ptr->s.ptr;
a89: 8b 10 mov (%eax),%edx
a8b: 8b 12 mov (%edx),%edx
a8d: 89 53 f8 mov %edx,-0x8(%ebx)
} else
bp->s.ptr = p->s.ptr;
if(p + p->s.size == bp){
a90: 8b 50 04 mov 0x4(%eax),%edx
a93: 8d 34 d0 lea (%eax,%edx,8),%esi
a96: 39 f1 cmp %esi,%ecx
a98: 75 dd jne a77 <free+0x57>
p->s.size += bp->s.size;
a9a: 03 53 fc add -0x4(%ebx),%edx
p->s.ptr = bp->s.ptr;
} else
p->s.ptr = bp;
freep = p;
a9d: a3 c4 0f 00 00 mov %eax,0xfc4
bp->s.size += p->s.ptr->s.size;
bp->s.ptr = p->s.ptr->s.ptr;
} else
bp->s.ptr = p->s.ptr;
if(p + p->s.size == bp){
p->s.size += bp->s.size;
aa2: 89 50 04 mov %edx,0x4(%eax)
p->s.ptr = bp->s.ptr;
aa5: 8b 53 f8 mov -0x8(%ebx),%edx
aa8: 89 10 mov %edx,(%eax)
} else
p->s.ptr = bp;
freep = p;
}
aaa: 5b pop %ebx
aab: 5e pop %esi
aac: 5f pop %edi
aad: 5d pop %ebp
aae: c3 ret
aaf: 90 nop
00000ab0 <malloc>:
return freep;
}
void*
malloc(uint nbytes)
{
ab0: 55 push %ebp
ab1: 89 e5 mov %esp,%ebp
ab3: 57 push %edi
ab4: 56 push %esi
ab5: 53 push %ebx
ab6: 83 ec 0c sub $0xc,%esp
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
ab9: 8b 45 08 mov 0x8(%ebp),%eax
if((prevp = freep) == 0){
abc: 8b 15 c4 0f 00 00 mov 0xfc4,%edx
malloc(uint nbytes)
{
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
ac2: 8d 78 07 lea 0x7(%eax),%edi
ac5: c1 ef 03 shr $0x3,%edi
ac8: 83 c7 01 add $0x1,%edi
if((prevp = freep) == 0){
acb: 85 d2 test %edx,%edx
acd: 0f 84 a3 00 00 00 je b76 <malloc+0xc6>
ad3: 8b 02 mov (%edx),%eax
ad5: 8b 48 04 mov 0x4(%eax),%ecx
base.s.ptr = freep = prevp = &base;
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
if(p->s.size >= nunits){
ad8: 39 cf cmp %ecx,%edi
ada: 76 74 jbe b50 <malloc+0xa0>
adc: 81 ff 00 10 00 00 cmp $0x1000,%edi
ae2: be 00 10 00 00 mov $0x1000,%esi
ae7: 8d 1c fd 00 00 00 00 lea 0x0(,%edi,8),%ebx
aee: 0f 43 f7 cmovae %edi,%esi
af1: ba 00 80 00 00 mov $0x8000,%edx
af6: 81 ff ff 0f 00 00 cmp $0xfff,%edi
afc: 0f 46 da cmovbe %edx,%ebx
aff: eb 10 jmp b11 <malloc+0x61>
b01: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
if((prevp = freep) == 0){
base.s.ptr = freep = prevp = &base;
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
b08: 8b 02 mov (%edx),%eax
if(p->s.size >= nunits){
b0a: 8b 48 04 mov 0x4(%eax),%ecx
b0d: 39 cf cmp %ecx,%edi
b0f: 76 3f jbe b50 <malloc+0xa0>
p->s.size = nunits;
}
freep = prevp;
return (void*)(p + 1);
}
if(p == freep)
b11: 39 05 c4 0f 00 00 cmp %eax,0xfc4
b17: 89 c2 mov %eax,%edx
b19: 75 ed jne b08 <malloc+0x58>
char *p;
Header *hp;
if(nu < 4096)
nu = 4096;
p = sbrk(nu * sizeof(Header));
b1b: 83 ec 0c sub $0xc,%esp
b1e: 53 push %ebx
b1f: e8 96 fc ff ff call 7ba <sbrk>
if(p == (char*)-1)
b24: 83 c4 10 add $0x10,%esp
b27: 83 f8 ff cmp $0xffffffff,%eax
b2a: 74 1c je b48 <malloc+0x98>
return 0;
hp = (Header*)p;
hp->s.size = nu;
b2c: 89 70 04 mov %esi,0x4(%eax)
free((void*)(hp + 1));
b2f: 83 ec 0c sub $0xc,%esp
b32: 83 c0 08 add $0x8,%eax
b35: 50 push %eax
b36: e8 e5 fe ff ff call a20 <free>
return freep;
b3b: 8b 15 c4 0f 00 00 mov 0xfc4,%edx
}
freep = prevp;
return (void*)(p + 1);
}
if(p == freep)
if((p = morecore(nunits)) == 0)
b41: 83 c4 10 add $0x10,%esp
b44: 85 d2 test %edx,%edx
b46: 75 c0 jne b08 <malloc+0x58>
return 0;
b48: 31 c0 xor %eax,%eax
b4a: eb 1c jmp b68 <malloc+0xb8>
b4c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
base.s.ptr = freep = prevp = &base;
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
if(p->s.size >= nunits){
if(p->s.size == nunits)
b50: 39 cf cmp %ecx,%edi
b52: 74 1c je b70 <malloc+0xc0>
prevp->s.ptr = p->s.ptr;
else {
p->s.size -= nunits;
b54: 29 f9 sub %edi,%ecx
b56: 89 48 04 mov %ecx,0x4(%eax)
p += p->s.size;
b59: 8d 04 c8 lea (%eax,%ecx,8),%eax
p->s.size = nunits;
b5c: 89 78 04 mov %edi,0x4(%eax)
}
freep = prevp;
b5f: 89 15 c4 0f 00 00 mov %edx,0xfc4
return (void*)(p + 1);
b65: 83 c0 08 add $0x8,%eax
}
if(p == freep)
if((p = morecore(nunits)) == 0)
return 0;
}
}
b68: 8d 65 f4 lea -0xc(%ebp),%esp
b6b: 5b pop %ebx
b6c: 5e pop %esi
b6d: 5f pop %edi
b6e: 5d pop %ebp
b6f: c3 ret
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
if(p->s.size >= nunits){
if(p->s.size == nunits)
prevp->s.ptr = p->s.ptr;
b70: 8b 08 mov (%eax),%ecx
b72: 89 0a mov %ecx,(%edx)
b74: eb e9 jmp b5f <malloc+0xaf>
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
if((prevp = freep) == 0){
base.s.ptr = freep = prevp = &base;
b76: c7 05 c4 0f 00 00 c8 movl $0xfc8,0xfc4
b7d: 0f 00 00
b80: c7 05 c8 0f 00 00 c8 movl $0xfc8,0xfc8
b87: 0f 00 00
base.s.size = 0;
b8a: b8 c8 0f 00 00 mov $0xfc8,%eax
b8f: c7 05 cc 0f 00 00 00 movl $0x0,0xfcc
b96: 00 00 00
b99: e9 3e ff ff ff jmp adc <malloc+0x2c>
|
out/euler24.adb | Melyodas/metalang | 22 | 9434 |
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C;
use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C;
procedure euler24 is
type stringptr is access all char_array;
procedure PString(s : stringptr) is
begin
String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all));
end;
procedure PInt(i : in Integer) is
begin
String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left));
end;
function fact(n : in Integer) return Integer is
prod : Integer;
begin
prod := 1;
for i in integer range 2..n loop
prod := prod * i;
end loop;
return prod;
end;
type b is Array (Integer range <>) of Integer;
type b_PTR is access b;
type c is Array (Integer range <>) of Boolean;
type c_PTR is access c;
procedure show(lim : in Integer; a : in Integer) is
t : b_PTR;
pris : c_PTR;
nth : Integer;
nchiffre : Integer;
n : Integer;
begin
nth := a;
t := new b (0..lim - 1);
for i in integer range 0..lim - 1 loop
t(i) := i;
end loop;
pris := new c (0..lim - 1);
for j in integer range 0..lim - 1 loop
pris(j) := FALSE;
end loop;
for k in integer range 1..lim - 1 loop
n := fact(lim - k);
nchiffre := nth / n;
nth := nth rem n;
for l in integer range 0..lim - 1 loop
if not pris(l)
then
if nchiffre = 0
then
PInt(l);
pris(l) := TRUE;
end if;
nchiffre := nchiffre - 1;
end if;
end loop;
end loop;
for m in integer range 0..lim - 1 loop
if not pris(m)
then
PInt(m);
end if;
end loop;
PString(new char_array'( To_C("" & Character'Val(10))));
end;
begin
show(10, 999999);
end;
|
Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0xca_notsx.log_21829_705.asm | ljhsiun2/medusa | 9 | 246357 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r14
push %r15
push %r9
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_WT_ht+0x9c1a, %rsi
lea addresses_UC_ht+0x1c0da, %rdi
nop
nop
nop
sub $60580, %r15
mov $33, %rcx
rep movsq
add $3069, %rbp
lea addresses_A_ht+0x91da, %rcx
nop
nop
nop
nop
sub $43895, %r11
mov $0x6162636465666768, %r15
movq %r15, %xmm6
vmovups %ymm6, (%rcx)
nop
nop
nop
dec %r15
lea addresses_WC_ht+0x1a3da, %rsi
lea addresses_D_ht+0xf5a, %rdi
nop
add %r9, %r9
mov $60, %rcx
rep movsw
nop
nop
nop
cmp $48705, %rbp
lea addresses_normal_ht+0x14ec, %rsi
lea addresses_A_ht+0x9dda, %rdi
nop
dec %r14
mov $9, %rcx
rep movsb
dec %r15
lea addresses_A_ht+0x7c7a, %rcx
nop
nop
nop
nop
nop
sub $30725, %r11
vmovups (%rcx), %ymm1
vextracti128 $1, %ymm1, %xmm1
vpextrq $1, %xmm1, %r9
nop
nop
nop
sub $33198, %r15
lea addresses_normal_ht+0x1533a, %r9
nop
nop
nop
nop
lfence
movw $0x6162, (%r9)
nop
nop
nop
nop
nop
and %r11, %r11
lea addresses_D_ht+0xe65a, %rcx
nop
nop
add $41174, %r11
mov (%rcx), %r9w
nop
nop
and $13654, %r14
lea addresses_normal_ht+0x375a, %rbp
nop
cmp %rdi, %rdi
mov $0x6162636465666768, %rcx
movq %rcx, %xmm1
vmovups %ymm1, (%rbp)
nop
nop
nop
nop
nop
xor $37351, %rcx
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %r9
pop %r15
pop %r14
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r13
push %rbx
push %rcx
push %rdi
// Faulty Load
lea addresses_PSE+0x45da, %r13
nop
nop
nop
dec %r10
movb (%r13), %bl
lea oracles, %rcx
and $0xff, %rbx
shlq $12, %rbx
mov (%rcx,%rbx,1), %rbx
pop %rdi
pop %rcx
pop %rbx
pop %r13
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'same': False, 'congruent': 0, 'NT': False, 'type': 'addresses_PSE', 'size': 4, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'same': True, 'congruent': 0, 'NT': False, 'type': 'addresses_PSE', 'size': 1, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_WT_ht', 'congruent': 6, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_UC_ht', 'congruent': 7, 'same': False}}
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 6, 'NT': False, 'type': 'addresses_A_ht', 'size': 32, 'AVXalign': False}}
{'src': {'type': 'addresses_WC_ht', 'congruent': 8, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_D_ht', 'congruent': 4, 'same': True}}
{'src': {'type': 'addresses_normal_ht', 'congruent': 1, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_A_ht', 'congruent': 11, 'same': False}}
{'src': {'same': True, 'congruent': 4, 'NT': False, 'type': 'addresses_A_ht', 'size': 32, 'AVXalign': False}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 1, 'NT': False, 'type': 'addresses_normal_ht', 'size': 2, 'AVXalign': False}}
{'src': {'same': False, 'congruent': 7, 'NT': False, 'type': 'addresses_D_ht', 'size': 2, 'AVXalign': False}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 7, 'NT': False, 'type': 'addresses_normal_ht', 'size': 32, 'AVXalign': False}}
{'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
*/
|
part1/Relations.agda | vyorkin/plfa | 0 | 7014 | module plfa.part1.Relations where
import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl; cong)
open import Data.Nat using (ℕ; zero; suc; _+_)
open import Data.Nat.Properties using (+-comm)
-- z≤n, s≤s - constructor names (with no spaces)
-- zero ≤ n - types (with spaces) indexed by
-- suc m ≤ suc n - 2 naturals: m and n
-- "-----------" - is just a comment (to make it look
-- like math notation for inference rule)
data _≤_ : ℕ → ℕ → Set where
-- base case
z≤n : ∀ {n : ℕ}
-------------
→ zero ≤ n
-- inductive case
s≤s : ∀ {m n : ℕ}
→ m ≤ n
-------------
→ suc m ≤ suc n
-- Base case: for all naturals n, the constructor
-- z≤n produces evidence that zero ≤ n holds.
-- Inductive case: for all naturals m and n,
-- the constructor s≤s takes evidence that m ≤ n
-- holds into evidence that suc m ≤ suc n holds.
_ : 2 ≤ 4
_ = s≤s (s≤s z≤n)
-- z≤n -----
-- 0 ≤ 2
-- s≤s -------
-- 1 ≤ 3
-- s≤s ---------
-- 2 ≤ 4
-- We can provide implicit arguments
-- explicitly by writing them inside curly braces
_ : 2 ≤ 4
_ = s≤s {1} {3} (s≤s {0} {2} (z≤n {2}))
-- 2 ≤ 4
-- suc m ≤ suc n
-- suc 1 ≤ suc 3
-- One may also identify implicit arugments by name
_ : 2 ≤ 4
_ = s≤s {n = 3} (s≤s {n = 2} z≤n)
-- Precedence
infix 4 _≤_
inv-s≤s : ∀ {m n : ℕ}
→ suc m ≤ suc n
--------------
→ m ≤ n
inv-s≤s (s≤s m≤n) = m≤n
inv-z≤n : ∀ {m : ℕ}
→ m ≤ zero
--------
→ m ≡ zero
inv-z≤n z≤n = refl
-- z≤n : zero ≤ n
-- z≤n : zero ≤ (n : ℕ)
-- (zero : ℕ)
-- z≤n : zero ≤ zero
-- refl : m ≡ m
-- refl : zero ≡ zero
|
arch/ARM/STM32/driversL5/stm32-rng.ads | morbos/Ada_Drivers_Library | 2 | 3380 | <filename>arch/ARM/STM32/driversL5/stm32-rng.ads
with System;
with STM32.Device; use STM32.Device;
with STM32_SVD; use STM32_SVD;
with STM32_SVD.RNG; use STM32_SVD.RNG;
package STM32.RNG is
RNG : aliased RNG_Peripheral with Import, Volatile, Address => S_NS_Periph (RNG_Base);
procedure Enable_Rng;
function Random return UInt32;
end STM32.RNG;
|
grammar/TypeQL.g4 | FuzzyCoder/typeql-plugin-vscode | 11 | 3349 | /*
* Copyright (C) 2021 Vaticle
*
* This program is free software: you can redistribute it and/or modify it under the terms of the
* GNU Affero General Public License as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without
* even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License along with this program.
* If not, see <https://www.gnu.org/licenses/>.
*/
grammar TypeQL;
// TypeQL end-of-file (aka. end-of-string) query parser Needed by TypeQL's Parser to ensure that it
// parses till end of string
eof_query: query EOF;
eof_queries: query+ EOF;
eof_pattern: pattern EOF;
eof_patterns: patterns EOF;
eof_definables: definables EOF;
eof_variable: pattern_variable EOF;
eof_label: label EOF;
eof_schema_rule: schema_rule EOF;
// TYPEQL QUERY LANGUAGE ========================================================
query:
query_define
| query_undefine
| query_insert
| query_delete_or_update
| query_match
| query_match_aggregate
| query_match_group
| query_match_group_agg
| query_compute;
query_define: DEFINE definables;
query_undefine: UNDEFINE definables;
query_insert:
MATCH patterns INSERT variable_things
| INSERT variable_things;
query_delete_or_update:
MATCH patterns DELETE variable_things (
INSERT variable_things
)?;
// TODO: The above feels like a hack. Find a clean way to split delete and update
query_match: MATCH patterns ( modifiers);
query_compute: COMPUTE compute_conditions;
// MATCH QUERY ANSWER GROUP AND AGGREGATE FUNCTIONS ============================
query_match_aggregate: query_match match_aggregate;
query_match_group: query_match match_group;
query_match_group_agg: query_match match_group match_aggregate;
// MATCH QUERY MODIFIERS =======================================================
modifiers: ( filter ';')? ( sort ';')? ( offset ';')? ( limit ';')?;
filter: GET VAR_ ( ',' VAR_)*;
sort: SORT VAR_ ORDER_?;
offset: OFFSET LONG_;
limit: LIMIT LONG_;
// GET AGGREGATE QUERY =========================================================
//
// An aggregate function is composed of 2 things: The aggregate method name, followed by the
// variable to apply the function to
match_aggregate:
aggregate_method VAR_? ';'; // method and, optionally, a variable
aggregate_method:
COUNT
| MAX
| MEAN
| MEDIAN // calculate statistical values
| MIN
| STD
| SUM;
// GET GROUP QUERY =============================================================
//
// An group function is composed of 2 things: The 'GROUP' method name, followed by the variable to
// group the results by
match_group: GROUP VAR_ ';';
// SCHEMA QUERY ===============================================================
definables: ( definable ';')+;
definable: variable_type | schema_rule;
// QUERY PATTERNS ==============================================================
patterns: ( pattern ';')+;
pattern:
pattern_variable
| pattern_conjunction
| pattern_disjunction
| pattern_negation;
pattern_conjunction: '{' patterns '}';
pattern_disjunction: '{' patterns '}' ( OR '{' patterns '}')+;
pattern_negation: NOT '{' patterns '}';
// VARIABLE PATTERNS ===========================================================
pattern_variable:
variable_concept
| variable_type
| variable_thing_any;
// CONCEPT VARAIBLES ===========================================================
variable_concept: VAR_ IS VAR_;
// TYPE VARIABLES ==============================================================
variable_type: type_any type_constraint ( ',' type_constraint)*;
type_constraint:
ABSTRACT
| SUB_ type_any
| OWNS type ( AS type)? ( IS_KEY)?
| RELATES type ( AS type)?
| PLAYS type_scoped ( AS type)?
| VALUE value_type
| REGEX STRING_
| WHEN '{' patterns '}'
| THEN '{' variable_things '}'
| TYPE label_any;
// THING VARIABLES =============================================================
variable_things: ( variable_thing_any ';')+;
variable_thing_any:
variable_thing
| variable_relation
| variable_attribute;
variable_thing:
VAR_ ISA_ type (',' attributes)?
| VAR_ IID IID_ ( ',' attributes)?
| VAR_ attributes;
variable_relation:
VAR_? relation ISA_ type (',' attributes)?
| VAR_? relation attributes?;
variable_attribute:
VAR_? predicate ISA_ type (',' attributes)?
| VAR_? predicate attributes?;
// RELATION CONSTRUCT ==========================================================
relation:
'(' role_player (',' role_player)* ')'; // A list of role players in a Relations
role_player:
type ':' player // The Role type and and player variable
| player; // Or just the player variable
player: VAR_; // A player is just a variable
// ATTRIBUTE CONSTRUCT =========================================================
attributes: attribute ( ',' attribute)*;
attribute:
HAS label (
VAR_
| predicate
) // ownership by labeled variable or value
| HAS VAR_; // or just value
// ATTRIBUTE VALUATION CONSTRUCTS ==============================================
predicate:
value
| predicate_equality predicate_value
| predicate_substring STRING_;
predicate_equality: EQ | NEQ | GT | GTE | LT | LTE;
predicate_substring: CONTAINS | LIKE;
predicate_value: value | VAR_;
// SCHEMA CONSTRUCT =============================================================
schema_rule:
RULE label
| RULE label ':' WHEN '{' patterns '}' THEN '{' variable_thing_any ';' '}';
// COMPUTE QUERY ===============================================================
//
// A compute query is composed of 3 things: The "compute" keyword followed by a method and
// optionally a set of input
compute_conditions:
conditions_count ';' // compute the number of concepts
| conditions_value ';' // compute statistical values
| conditions_central ';' // compute density of connected concepts
| conditions_cluster ';' // compute density of connected concepts
| conditions_path ';' ; // compute the paths between concepts
compute_method:
MIN
| MAX
| MEDIAN // statistical value methods
| MEAN
| STD
| SUM;
conditions_count: COUNT input_count?;
conditions_value: compute_method input_value (',' input_value)*;
conditions_central:
CENTRALITY input_central (',' input_central)*;
conditions_cluster: CLUSTER input_cluster (',' input_cluster)*;
conditions_path: PATH input_path (',' input_path)*;
input_count: compute_scope;
input_value: compute_scope | compute_target;
input_central: compute_scope | compute_target | compute_config;
input_cluster: compute_scope | compute_config;
input_path: compute_scope | compute_direction;
compute_direction:
FROM IID_ // an instance to start the compute from
| TO IID_; // an instance to end the compute at
compute_target:
OF labels; // type(s) of instances to apply compute
compute_scope: IN labels; // type(s) to scope compute visibility
compute_config:
USING compute_algorithm // algorithm to determine how to compute
| WHERE compute_args; // additional args for compute method
compute_algorithm:
DEGREE
| K_CORE
| CONNECTED_COMPONENT; // algorithm to determine how to compute
compute_args:
compute_arg
| compute_args_array; // single argument or array of arguments
compute_args_array:
'[' compute_arg (',' compute_arg)* ']'; // an array of arguments
compute_arg:
MIN_K '=' LONG_ // a single argument for min-k=LONG
| K '=' LONG_ // a single argument for k=LONG
| SIZE '=' LONG_ // a single argument for size=LONG
| CONTAINS '=' IID_; // a single argument for contains=ID
// TYPE, LABEL AND IDENTIFIER CONSTRUCTS =======================================
type_any: type_scoped | type | VAR_;
type_scoped: label_scoped | VAR_;
type: label | VAR_; // A type can be a label or variable
label_any: label_scoped | label;
label_scoped: LABEL_SCOPED_;
label: LABEL_ | schema_native | type_native | unreserved;
labels: label | label_array;
label_array: '[' label ( ',' label)* ']';
// LITERAL INPUT VALUES =======================================================
schema_native: RULE;
type_native: THING | ENTITY | ATTRIBUTE | RELATION | ROLE;
value_type: LONG | DOUBLE | STRING | BOOLEAN | DATETIME;
value: STRING_ | LONG_ | DOUBLE_ | BOOLEAN_ | DATE_ | DATETIME_;
regex: STRING_;
// UNRESERVED KEYWORDS ========================================================= Most of TypeQL
// syntax should not be reserved from being used as identifiers
unreserved:
VALUE
| MIN
| MAX
| MEDIAN
| MEAN
| STD
| SUM
| COUNT
| GET
| SORT
| LIMIT
| OFFSET
| GROUP
| PATH
| CLUSTER
| FROM
| TO
| OF
| IN
| DEGREE
| K_CORE
| CONNECTED_COMPONENT
| MIN_K
| K
| CONTAINS
| SIZE
| WHERE;
// TYPEQL SYNTAX KEYWORDS =======================================================
// QUERY COMMAND KEYWORDS
MATCH: 'match';
GET: 'get';
DEFINE: 'define';
UNDEFINE: 'undefine';
INSERT: 'insert';
DELETE: 'delete';
COMPUTE: 'compute';
// NATIVE TYPE KEYWORDS
THING: 'thing';
ENTITY: 'entity';
ATTRIBUTE: 'attribute';
RELATION: 'relation';
ROLE: 'role';
RULE: 'rule';
// DELETE AND GET QUERY MODIFIER KEYWORDS
OFFSET: 'offset';
LIMIT: 'limit';
SORT: 'sort';
ORDER_: ASC | DESC;
ASC: 'asc';
DESC: 'desc';
// TYPE VARIABLE CONSTRAINT KEYWORDS
TYPE: 'type';
ABSTRACT: 'abstract';
SUB_: SUB | SUBX;
SUB: 'sub';
SUBX: 'sub!';
OWNS: 'owns';
IS_KEY: '@key';
REGEX: 'regex';
AS: 'as';
PLAYS: 'plays';
RELATES: 'relates';
WHEN: 'when';
THEN: 'then';
// THING VARIABLE CONSTRAINT KEYWORDS
IID: 'iid';
ISA_: ISA | ISAX;
ISA: 'isa';
ISAX: 'isa!';
HAS: 'has';
VALUE: 'value';
IS: 'is';
// OPERATOR KEYWORDS
OR: 'or';
NOT: 'not';
// PREDICATE KEYWORDS
EQ: '=';
NEQ: '!=';
GT: '>';
GTE: '>=';
LT: '<';
LTE: '<=';
LIKE: 'like';
CONTAINS: 'contains';
// GROUP AND AGGREGATE QUERY KEYWORDS (also used by COMPUTE QUERY)
GROUP: 'group';
COUNT: 'count';
MAX: 'max';
MIN: 'min';
MEAN: 'mean';
MEDIAN: 'median';
STD: 'std';
SUM: 'sum';
// COMPUTE QUERY KEYWORDS
CLUSTER: 'cluster';
CENTRALITY: 'centrality';
PATH: 'path';
DEGREE: 'degree';
K_CORE: 'k-core';
CONNECTED_COMPONENT: 'connected-component';
FROM: 'from';
TO: 'to';
OF: 'of';
IN: 'in';
USING: 'using';
WHERE: 'where';
MIN_K: 'min-k';
K: 'k';
SIZE: 'size';
// VALUE TYPE KEYWORDS
LONG: 'long';
DOUBLE: 'double';
STRING: 'string';
BOOLEAN: 'boolean';
DATETIME: 'datetime';
// LITERAL VALUE KEYWORDS
BOOLEAN_: TRUE | FALSE; // order of lexer declaration matters
TRUE: 'true';
FALSE: 'false';
STRING_:
'"' (~["\\] | ESCAPE_SEQ_)* '"'
| '\'' (~['\\] | ESCAPE_SEQ_)* '\'';
LONG_: ('+' | '-')? [0-9]+;
DOUBLE_: ('+' | '-')? [0-9]+ '.' [0-9]+;
DATE_: DATE_FRAGMENT_;
DATETIME_: DATE_FRAGMENT_ 'T' TIME_;
// TYPEQL INPUT TOKEN PATTERNS All token names must end with an underscore ('_')
VAR_: VAR_ANONYMOUS_ | VAR_NAMED_;
VAR_ANONYMOUS_: '$_';
VAR_NAMED_: '$' [a-zA-Z0-9][a-zA-Z0-9_-]*;
IID_: '0x' [0-9a-f]+;
LABEL_: TYPE_CHAR_H_ TYPE_CHAR_T_*;
LABEL_SCOPED_: LABEL_ ':' LABEL_;
// FRAGMENTS OF KEYWORDS =======================================================
fragment TYPE_CHAR_H_:
'A' ..'Z'
| 'a' ..'z'
| '\u00C0' ..'\u00D6'
| '\u00D8' ..'\u00F6'
| '\u00F8' ..'\u02FF'
| '\u0370' ..'\u037D'
| '\u037F' ..'\u1FFF'
| '\u200C' ..'\u200D'
| '\u2070' ..'\u218F'
| '\u2C00' ..'\u2FEF'
| '\u3001' ..'\uD7FF'
| '\uF900' ..'\uFDCF'
| '\uFDF0' ..'\uFFFD';
fragment TYPE_CHAR_T_:
TYPE_CHAR_H_
| '0' ..'9'
| '_'
| '-'
| '\u00B7'
| '\u0300' ..'\u036F'
| '\u203F' ..'\u2040';
fragment DATE_FRAGMENT_: YEAR_ '-' MONTH_ '-' DAY_;
fragment MONTH_: [0-1][0-9];
fragment DAY_: [0-3][0-9];
fragment YEAR_: [0-9][0-9][0-9][0-9] | ('+' | '-') [0-9]+;
fragment TIME_:
HOUR_ ':' MINUTE_ (':' SECOND_ ('.' SECOND_FRACTION_)?)?;
fragment HOUR_: [0-2][0-9];
fragment MINUTE_: [0-6][0-9];
fragment SECOND_: [0-6][0-9];
fragment SECOND_FRACTION_:
[0-9] ([0-9] ([0-9])?)?; // between 1 and 3 digits
fragment ESCAPE_SEQ_: '\\' .;
COMMENT: '#' .*? '\r'? ('\n' | EOF) -> channel(HIDDEN);
WS: [ \t\r\n]+ -> channel(HIDDEN);
UNRECOGNISED: .; |
test/asset/agda-stdlib-1.0/Data/Nat/Literals.agda | omega12345/agda-mode | 5 | 17414 | <gh_stars>1-10
------------------------------------------------------------------------
-- The Agda standard library
--
-- Natural Literals
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Data.Nat.Literals where
open import Agda.Builtin.FromNat
open import Agda.Builtin.Nat
open import Data.Unit
number : Number Nat
number = record
{ Constraint = λ _ → ⊤
; fromNat = λ n → n
}
|
Tarefa 4/main41.a51 | raphaelmoletta/CSW40 | 0 | 84380 | <gh_stars>0
ORG 0000h
CLR P1.4 ; LED 1
start:
CPL P1.4
MOV R1, #10 ; 1c
delay1:
MOV R2, #200 ; 1c
delay2:
MOV R6, #250 ; 1c
delay3:
DJNZ R6, delay3 ; 2c
DJNZ R2, delay2 ; 2c
DJNZ R1, delay1 ; 2c
CPL P1.4
MOV R1, #30 ; 1c
delay4:
MOV R2, #200 ; 1c
delay5:
MOV R6, #250 ; 1c
delay6:
DJNZ R6, delay6 ; 2c
DJNZ R2, delay5 ; 2c
DJNZ R1, delay4 ; 2c
JMP start
END
|
programs/oeis/262/A262683.asm | karttu/loda | 1 | 95687 | <filename>programs/oeis/262/A262683.asm
; A262683: Characteristic function for A182859.
; 1,1,0,1,0,0,0,0,1,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1,1,0,0,1,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,1,1,0,0,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0,1,1,0,1,0,1,0,1,0,0,0,0,1,1,0,1,0,1,1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,1,0,0,1,0,1,1,0,0,0,0,1,0,1,0,1,0,1,1,0,0,0,1,0,0,1,0,0,0,1,0,1,0,0,0,0,1,1,0,1,0,0,0,0,0,1,0,0,1,1,0,0,0,1,1,1,0,0,0,0,0,0,0,1,0,1,1,0,0,0,1,1,1,1,0,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,1,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,1,1,0,0,0,1,0,1,0,0,0,1,1,1,1,1,0,1,0,1
cal $0,36459 ; Number of iterations required to reach stationary value when repeatedly applying d, the number of divisors function (A000005).
gcd $0,2
mov $1,$0
sub $1,1
|
src/si_units-binary-scaling.ads | HeisenbugLtd/si_units | 6 | 6501 | --------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (<EMAIL>)
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
--------------------------------------------------------------------------------
pragma License (Unrestricted);
--------------------------------------------------------------------------------
-- Binary units scaling support.
--
-- Conversion between differently prefixed raw values, i.e. from GBit to Bit.
--------------------------------------------------------------------------------
package SI_Units.Binary.Scaling is
pragma Warnings (Off, "declaration hides ""Prefixes"""); -- intentional
type Prefixes is new SI_Units.Binary.Prefixes with
Size => Integer'Size;
pragma Warnings (On, "declaration hides ""Prefixes""");
for Prefixes use (None => 0,
kibi => 10,
mebi => 20,
gibi => 30,
tebi => 40,
pebi => 50,
exbi => 60,
zebi => 70,
yobi => 80);
generic
type Item is mod <>;
function Mod_Scale (Value : Item;
From_Prefix : Prefixes;
To_Prefix : Prefixes := None) return Item;
end SI_Units.Binary.Scaling;
|
asm/data.asm | b00lduck/cbmpet-asm | 0 | 244105 | <reponame>b00lduck/cbmpet-asm
data_text: .pc = data_text "Text constants"
hello2:
.text "vintage COMMODORE PET assembly code" .byte 0
hello3:
.text " by <NAME> and Dr.Ergo" .byte 0
hello4:
.text " on a COMMODORE PET" .byte 0
text1:
.text "Elapsed time: 00:00.00" .byte 0
text2:
.text " "
.text "b00lduck proudly presents: pet-a-byte: a short presentation of oldschool technology by <NAME> and dr.ergo. a scroller is in the house. yeeeehaw.... over and out "
!: .pc = !- "Image: b00lduck logo"
image2: :ConvertPicture("../data/b00lduck.png")
!: .pc = !- "Image: verfassungsschutz logo"
image3: :ConvertPicture("../data/demo1.png")
!: .pc = !- "Image: Scroller background"
image4: :ConvertPicture("../data/scroller_bg.png")
!: .pc = !- "Image: Donut car 1"
donutcar1: :ConvertPicture("../data/DonutCar1.png")
!: .pc = !- "Image: Donut car 2"
donutcar2: :ConvertPicture("../data/DonutCar2.png")
!: .pc = !- "Image: Donut car 3"
donutcar3: :ConvertPicture("../data/DonutCar3.png")
!: .pc = !- "Image: Bus"
bus: :ConvertPicture("../data/Bus.png")
!: .pc = !- "Font: 5x6"
font1: :ConvertPicture("../data/font.png")
!: .pc = !- "End of data"
.macro ConvertPicture(FILENAME) {
.var data = LoadPicture(FILENAME)
.for (var y = 0; y < 16; y++)
.for (var x = 0; x < 22; x++) {
.var sx = x * 4
.var sy = y * 2
.var value = 0
.eval value += data.getPixel(sx,sy) & 1 << 7
.eval value += data.getPixel(sx + 1,sy) & 1 << 6
.eval value += data.getPixel(sx,sy + 1) & 1 << 5
.eval value += data.getPixel(sx + 1,sy + 1) & 1 << 4
.eval value += data.getPixel(sx + 2,sy) & 1 << 3
.eval value += data.getPixel(sx + 3,sy) & 1 << 2
.eval value += data.getPixel(sx + 2,sy + 1) & 1 << 1
.eval value += data.getPixel(sx + 3,sy + 1) & 1 << 0
.byte value
}
} |
Mixfix/Acyclic/Lib.agda | nad/parser-combinators | 1 | 5540 | ------------------------------------------------------------------------
-- Small parser combinator library used by Mixfix.Acyclic.Grammar
------------------------------------------------------------------------
-- Note that while Mixfix.Acyclic.Lib and Mixfix.Cyclic.Lib may appear
-- to be very similar, there are some important differences:
--
-- • Mixfix.Cyclic.Lib._⊛∞_ accepts delayed parsers,
-- Mixfix.Acyclic.Lib._⊛_ does not.
--
-- • There is a translation from the parsers in Mixfix.Acyclic.Lib to
-- the /simplified/ parsers in
-- StructurallyRecursiveDescentParsing.Simplified; no such
-- translation is defined for the parsers in Mixfix.Cyclic.Lib. Note
-- that the depth-first backend in
-- StructurallyRecursiveDescentParsing.DepthFirst only handles
-- simplified parsers.
module Mixfix.Acyclic.Lib where
open import Algebra
open import Codata.Musical.Notation
open import Data.Bool using (Bool; true; false)
open import Data.Nat using (ℕ; zero; suc; _+_)
open import Data.List using (List; []; _∷_; _++_)
open import Data.List.NonEmpty using (List⁺; _∷_; [_]; _∷⁺_; _⁺∷ʳ_)
import Data.List.Properties
private module LM {A : Set} = Monoid (Data.List.Properties.++-monoid A)
open import Data.Vec using (Vec; []; _∷_)
open import Data.Product
import Data.String.Properties as String
open import Relation.Binary
open DecSetoid String.≡-decSetoid using (_≟_)
open import Relation.Nullary
open import Relation.Binary.PropositionalEquality
using (_≡_; refl; cong)
import StructurallyRecursiveDescentParsing.Simplified as Simplified
open Simplified hiding (⟦_⟧)
open import StructurallyRecursiveDescentParsing.Simplified.Semantics
as Sem hiding (cast∈; sound; complete)
open import Mixfix.Operator using (NamePart)
------------------------------------------------------------------------
-- Programs
-- Agda's termination checker only accepts corecursive definitions if
-- they are /syntactically/ guarded by constructors. The following
-- small language of "parser programs" reifies a selection of parser
-- combinators as /constructors/. These constructors are then used in
-- Mixfix.Acyclic.Grammar in order to ensure that Agda accepts the
-- grammars defined there.
infix 55 _+
infixl 50 _⊛_ _<$>_
infixl 5 _∣_
infixr 5 _∥_
data ParserProg : Set → Set1 where
fail : ∀ {R} → ParserProg R
_∣_ : ∀ {R}
(p₁ : ParserProg R)
(p₂ : ParserProg R) →
ParserProg R
_⊛_ : ∀ {R₁ R₂}
(p₁ : ParserProg (R₁ → R₂))
(p₂ : ParserProg R₁) →
ParserProg R₂
_<$>_ : ∀ {R₁ R₂} (f : R₁ → R₂)
(p : ParserProg R₁) →
ParserProg R₂
_+ : ∀ {R} (p : ParserProg R) →
ParserProg (List⁺ R)
_between_ : ∀ {R n}
(p : ∞ (ParserProg R)) (toks : Vec NamePart (1 + n)) →
ParserProg (Vec R n)
_∥_ : ∀ {I i} {R : I → Set}
(p₁ : ParserProg (R i))
(p₂ : ParserProg (∃ R)) →
ParserProg (∃ R)
-- Parses a given token.
tok : NamePart → Parser NamePart false NamePart
tok tok = token !>>= λ tok′ → ♯ ok tok′
module TheToken where
okIndex : NamePart → Bool
okIndex tok′ with tok ≟ tok′
... | yes _ = true
... | no _ = false
ok : (tok′ : NamePart) → Parser NamePart (okIndex tok′) NamePart
ok tok′ with tok ≟ tok′
... | yes _ = return tok′
... | no _ = fail
-- Interprets the parser programs as parsers.
private
infix 10 ♯′_
♯′_ : {A : Set₁} → A → ∞ A
♯′ x = ♯ x
⟦_⟧ : ∀ {R} → ParserProg R → Parser NamePart false R
⟦ fail ⟧ = fail
⟦ p₁ ∣ p₂ ⟧ = ⟦ p₁ ⟧ ∣ ⟦ p₂ ⟧
⟦ p₁ ⊛ p₂ ⟧ = ⟦ p₁ ⟧ !>>= λ f → ♯ ⟦ f <$> p₂ ⟧
⟦ f <$> p ⟧ = ⟦ p ⟧ !>>= λ x → ♯′ return (f x)
⟦ p + ⟧ = ⟦ p ⟧ !>>= λ x → ♯
(⟦ _∷⁺_ x <$> p + ⟧ ∣ return [ x ])
⟦ p between (t ∷ []) ⟧ = tok t !>>= λ _ → ♯′ return []
⟦ p between (t ∷ t′ ∷ ts) ⟧ = tok t !>>= λ _ → ♯
⟦ _∷_ <$> ♭ p ⊛ (p between (t′ ∷ ts)) ⟧
⟦ p₁ ∥ p₂ ⟧ = (⟦ p₁ ⟧ !>>= λ x → ♯′ return (-, x)) ∣
⟦ p₂ ⟧
------------------------------------------------------------------------
-- Semantics of the programs
module Semantics where
-- This definition may seem unnecessary: why not simply define
--
-- x ∈⟦ p ⟧· s = x ∈ ⟦ p ⟧ · s?
--
-- One reason is that it is hard for Agda to infer the value of p
-- from ⟦ p ⟧ (note that ⟦_⟧ is a function which evaluates). By
-- using the definition below this problem is avoided. A more
-- important reason may be that the definition below ensures that
-- the details of ⟦_⟧ do not need to be understood.
infix 60 <$>_
infixl 50 _⊛_
infix 4 _∈⟦_⟧·_
data _∈⟦_⟧·_ : ∀ {R} → R → ParserProg R → List NamePart → Set₁ where
∣ˡ : ∀ {R x s}
{p₁ : ParserProg R} {p₂ : ParserProg R}
(x∈p₁ : x ∈⟦ p₁ ⟧· s) → x ∈⟦ p₁ ∣ p₂ ⟧· s
∣ʳ : ∀ {R x s}
{p₁ : ParserProg R} {p₂ : ParserProg R}
(x∈p₂ : x ∈⟦ p₂ ⟧· s) → x ∈⟦ p₁ ∣ p₂ ⟧· s
_⊛_ : ∀ {s₁ s₂ R₁ R₂ f x}
{p₁ : ParserProg (R₁ → R₂)}
{p₂ : ParserProg R₁}
(f∈p₁ : f ∈⟦ p₁ ⟧· s₁)
(x∈p₂ : x ∈⟦ p₂ ⟧· s₂) →
f x ∈⟦ p₁ ⊛ p₂ ⟧· s₁ ++ s₂
<$>_ : ∀ {s R₁ R₂ x} {f : R₁ → R₂} {p : ParserProg R₁}
(x∈p : x ∈⟦ p ⟧· s) → f x ∈⟦ f <$> p ⟧· s
+-[] : ∀ {R x s} {p : ParserProg R}
(x∈p : x ∈⟦ p ⟧· s) → [ x ] ∈⟦ p + ⟧· s
+-∷ : ∀ {R x s₁ s₂ xs} {p : ParserProg R}
(x∈p : x ∈⟦ p ⟧· s₁) (xs∈p : xs ∈⟦ p + ⟧· s₂) →
x ∷⁺ xs ∈⟦ p + ⟧· s₁ ++ s₂
between-[] : ∀ {R t} {p : ∞ (ParserProg R)} →
[] ∈⟦ p between (t ∷ []) ⟧· t ∷ []
between-∷ : ∀ {R n t x xs s₁ s₂}
{p : ∞ (ParserProg R)} {ts : Vec NamePart (suc n)}
(x∈p : x ∈⟦ ♭ p ⟧· s₁)
(xs∈⋯ : xs ∈⟦ p between ts ⟧· s₂) →
x ∷ xs ∈⟦ p between (t ∷ ts) ⟧· t ∷ s₁ ++ s₂
∥ˡ : ∀ {I i} {R : I → Set} {x s}
{p₁ : ParserProg (R i)}
{p₂ : ParserProg (∃ R)}
(x∈p₁ : x ∈⟦ p₁ ⟧· s) → (-, x) ∈⟦ p₁ ∥ p₂ ⟧· s
∥ʳ : ∀ {I i} {R : I → Set} {x s}
{p₁ : ParserProg (R i)}
{p₂ : ParserProg (∃ R)}
(x∈p₂ : x ∈⟦ p₂ ⟧· s) → x ∈⟦ p₁ ∥ p₂ ⟧· s
-- The semantics is correct. (Note that this proof only establishes
-- language equivalence, not parser equivalence; see
-- TotalParserCombinators.Semantics.)
private
drop-[] : ∀ {R s x} {p : Parser NamePart false R} →
x ∈ p · s ++ [] → x ∈ p · s
drop-[] = Sem.cast∈ refl refl (proj₂ LM.identity _)
add-[] : ∀ {R s x} {p : ParserProg R} →
x ∈⟦ p ⟧· s → x ∈⟦ p ⟧· s ++ []
add-[] {s = s} x∈p rewrite proj₂ LM.identity s = x∈p
⊛-complete : ∀ {s₁ s₂ R₁ R₂ f x}
(p₁ : ParserProg (R₁ → R₂)) {p₂ : ParserProg R₁} →
f ∈ ⟦ p₁ ⟧ · s₁ → x ∈ ⟦ p₂ ⟧ · s₂ →
f x ∈ ⟦ p₁ ⊛ p₂ ⟧ · s₁ ++ s₂
⊛-complete _ f∈p₁ x∈p₂ = f∈p₁ !>>= drop-[] (x∈p₂ !>>= return)
tok-sound : ∀ {t t′ s} →
t′ ∈ tok t · s →
t ≡ t′ × s ≡ t′ ∷ []
tok-sound {t} (_!>>=_ {x = t″} token t′∈) with t ≟ t″
tok-sound (token !>>= return) | yes t≈t″ = (t≈t″ , refl)
tok-sound (token !>>= ()) | no t≉t″
tok-complete : ∀ {t} → t ∈ tok t · t ∷ []
tok-complete {t} = token !>>= ok-lemma
where
ok-lemma : t ∈ TheToken.ok t t · []
ok-lemma with t ≟ t
... | yes refl = return
... | no t≢t with t≢t refl
... | ()
sound : ∀ {R x s} {p : ParserProg R} →
x ∈⟦ p ⟧· s → x ∈ ⟦ p ⟧ · s
sound (∣ˡ x∈p₁) = ∣ˡ (sound x∈p₁)
sound (∣ʳ x∈p₂) = ∣ʳ false (sound x∈p₂)
sound (_⊛_ {p₁ = p₁} f∈p₁ x∈p₂) = ⊛-complete p₁ (sound f∈p₁) (sound x∈p₂)
sound (<$> x∈p) = drop-[] (sound x∈p !>>= return)
sound (+-[] x∈p) = drop-[] (sound x∈p !>>= ∣ʳ false return)
sound (+-∷ x∈p xs∈p) = sound x∈p !>>= ∣ˡ (drop-[] (sound xs∈p !>>= return))
sound (∥ˡ x∈p₁) = drop-[] (∣ˡ {x = (-, _)} (sound x∈p₁ !>>= return))
sound (∥ʳ x∈p₂) = ∣ʳ false (sound x∈p₂)
sound between-[] = tok-complete !>>= return
sound (between-∷ {s₁ = s₁} {p = p} {ts = _ ∷ _} x∈p xs∈⋯) =
tok-complete !>>=
⊛-complete (_ <$> ♭ p) (drop-[] {s = s₁} (sound x∈p !>>= return)) (sound xs∈⋯)
complete : ∀ {R x s} (p : ParserProg R) →
x ∈ ⟦ p ⟧ · s → x ∈⟦ p ⟧· s
complete fail ()
complete (p₁ ∣ p₂) (∣ˡ x∈p₁) = ∣ˡ (complete p₁ x∈p₁)
complete (p₁ ∣ p₂) (∣ʳ .false x∈p₂) = ∣ʳ (complete p₂ x∈p₂)
complete (p₁ ⊛ p₂) (f∈p₁ !>>= (y∈p₂ !>>= return)) =
complete p₁ f∈p₁ ⊛ add-[] (complete p₂ y∈p₂)
complete (f <$> p) (x∈p !>>= return) = add-[] (<$> complete p x∈p)
complete (p +) (x∈p !>>= ∣ˡ (xs∈p+ !>>= return)) = +-∷ (complete p x∈p) (add-[] (complete (p +) xs∈p+))
complete (p +) (x∈p !>>= ∣ʳ .false return) = add-[] (+-[] (complete p x∈p))
complete (p between (t ∷ [])) (t∈ !>>= return) with tok-sound t∈
... | (refl , refl) = between-[]
complete (p between (t ∷ t′ ∷ ts))
(t∈ !>>= (x∈p !>>= return !>>= (xs∈ !>>= return))) with tok-sound t∈
... | (refl , refl) =
between-∷ (add-[] (complete (♭ p) x∈p))
(add-[] (complete (p between (t′ ∷ ts)) xs∈))
complete (p₁ ∥ p₂) (∣ˡ (x∈p₁ !>>= return)) = add-[] (∥ˡ (complete p₁ x∈p₁))
complete (p₁ ∥ p₂) (∣ʳ .false x∈p₂) = ∥ʳ (complete p₂ x∈p₂)
------------------------------------------------------------------------
-- A variant of the semantics
-- The alternative semantics defined below may be slightly harder to
-- understand, but it is (language) equivalent to the one above, and
-- it simplifies the proof in Mixfix.Acyclic.Show.
module Semantics-⊕ where
infix 60 <$>_
infixl 50 _⊛_
infix 4 _⊕_∈⟦_⟧·_
data _⊕_∈⟦_⟧·_ : ∀ {R} →
R → List NamePart → ParserProg R → List NamePart → Set1 where
∣ˡ : ∀ {R x s s₁}
{p₁ : ParserProg R} {p₂ : ParserProg R}
(x∈p₁ : x ⊕ s₁ ∈⟦ p₁ ⟧· s) → x ⊕ s₁ ∈⟦ p₁ ∣ p₂ ⟧· s
∣ʳ : ∀ {R x s s₁}
{p₁ : ParserProg R} {p₂ : ParserProg R}
(x∈p₂ : x ⊕ s₁ ∈⟦ p₂ ⟧· s) → x ⊕ s₁ ∈⟦ p₁ ∣ p₂ ⟧· s
_⊛_ : ∀ {s s₁ s₂ R₁ R₂ f x}
{p₁ : ParserProg (R₁ → R₂)} {p₂ : ParserProg R₁}
(f∈p₁ : f ⊕ s₁ ∈⟦ p₁ ⟧· s) (x∈p₂ : x ⊕ s₂ ∈⟦ p₂ ⟧· s₁) →
f x ⊕ s₂ ∈⟦ p₁ ⊛ p₂ ⟧· s
<$>_ : ∀ {s s′ R₁ R₂ x} {f : R₁ → R₂} {p : ParserProg R₁}
(x∈p : x ⊕ s′ ∈⟦ p ⟧· s) → f x ⊕ s′ ∈⟦ f <$> p ⟧· s
+-[] : ∀ {R x s s₁} {p : ParserProg R}
(x∈p : x ⊕ s₁ ∈⟦ p ⟧· s) → [ x ] ⊕ s₁ ∈⟦ p + ⟧· s
+-∷ : ∀ {R x s s₁ s₂ xs} {p : ParserProg R}
(x∈p : x ⊕ s₁ ∈⟦ p ⟧· s) (xs∈p : xs ⊕ s₂ ∈⟦ p + ⟧· s₁) →
x ∷⁺ xs ⊕ s₂ ∈⟦ p + ⟧· s
between-[] : ∀ {R t s} {p : ∞ (ParserProg R)} →
[] ⊕ s ∈⟦ p between (t ∷ []) ⟧· t ∷ s
between-∷ : ∀ {R n t x xs s s₁ s₂}
{p : ∞ (ParserProg R)} {ts : Vec NamePart (suc n)}
(x∈p : x ⊕ s₁ ∈⟦ ♭ p ⟧· s)
(xs∈⋯ : xs ⊕ s₂ ∈⟦ p between ts ⟧· s₁) →
x ∷ xs ⊕ s₂ ∈⟦ p between (t ∷ ts) ⟧· t ∷ s
∥ˡ : ∀ {I i} {R : I → Set} {x s s′}
{p₁ : ParserProg (R i)}
{p₂ : ParserProg (∃ R)}
(x∈p₁ : x ⊕ s′ ∈⟦ p₁ ⟧· s) →
(-, x) ⊕ s′ ∈⟦ p₁ ∥ p₂ ⟧· s
∥ʳ : ∀ {I i} {R : I → Set} {s s′ i′} {x : R i′}
{p₁ : ParserProg (R i)}
{p₂ : ParserProg (∃ R)}
(x∈p₂ : (-, x) ⊕ s′ ∈⟦ p₂ ⟧· s) →
(-, x) ⊕ s′ ∈⟦ p₁ ∥ p₂ ⟧· s
-- The semantics is correct.
⊛-complete : ∀ {s s₁ s₂ R₁ R₂ f x}
(p₁ : ParserProg (R₁ → R₂)) {p₂ : ParserProg R₁} →
f ⊕ s₁ ∈ ⟦ p₁ ⟧ · s → x ⊕ s₂ ∈ ⟦ p₂ ⟧ · s₁ →
f x ⊕ s₂ ∈ ⟦ p₁ ⊛ p₂ ⟧ · s
⊛-complete _ f∈p₁ x∈p₂ = f∈p₁ !>>= (x∈p₂ !>>= return)
tok-sound : ∀ {t t′ s₁ s} →
t′ ⊕ s₁ ∈ tok t · s →
t ≡ t′ × s ≡ t′ ∷ s₁
tok-sound ∈ with Sem.⊕-sound′ ∈
tok-sound ∈ | (s , refl , ∈′) with Semantics.tok-sound ∈′
tok-sound {t} ∈ | (.(t ∷ []) , refl , ∈′) | (refl , refl) = (refl , refl)
tok-complete : ∀ {t s} → t ⊕ s ∈ tok t · t ∷ s
tok-complete = Sem.⊕-complete′ (_ , refl , Semantics.tok-complete)
sound : ∀ {R x s s′} {p : ParserProg R} →
x ⊕ s′ ∈⟦ p ⟧· s → x ⊕ s′ ∈ ⟦ p ⟧ · s
sound (∣ˡ x∈p₁) = ∣ˡ (sound x∈p₁)
sound (∣ʳ x∈p₂) = ∣ʳ false (sound x∈p₂)
sound (_⊛_ {p₁ = p₁} f∈p₁ x∈p₂) = ⊛-complete p₁ (sound f∈p₁) (sound x∈p₂)
sound (<$> x∈p) = sound x∈p !>>= return
sound (+-[] x∈p) = sound x∈p !>>= ∣ʳ false return
sound (+-∷ x∈p xs∈p) = sound x∈p !>>= ∣ˡ (sound xs∈p !>>= return)
sound (∥ˡ x∈p₁) = ∣ˡ (sound x∈p₁ !>>= return)
sound (∥ʳ x∈p₂) = ∣ʳ false (sound x∈p₂)
sound between-[] = tok-complete !>>= return
sound (between-∷ {p = p} {ts = _ ∷ _} x∈p xs∈⋯) =
tok-complete !>>=
⊛-complete (_ <$> ♭ p) (sound x∈p !>>= return) (sound xs∈⋯)
complete : ∀ {R x s s′} (p : ParserProg R) →
x ⊕ s′ ∈ ⟦ p ⟧ · s → x ⊕ s′ ∈⟦ p ⟧· s
complete fail ()
complete (p₁ ∣ p₂) (∣ˡ x∈p₁) = ∣ˡ (complete p₁ x∈p₁)
complete (p₁ ∣ p₂) (∣ʳ .false x∈p₂) = ∣ʳ (complete p₂ x∈p₂)
complete (p₁ ⊛ p₂) (f∈p₁ !>>= (y∈p₂ !>>= return)) =
complete p₁ f∈p₁ ⊛ complete p₂ y∈p₂
complete (f <$> p) (x∈p !>>= return) = <$> complete p x∈p
complete (p +) (x∈p !>>= ∣ˡ (xs∈p+ !>>= return)) = +-∷ (complete p x∈p) (complete (p +) xs∈p+)
complete (p +) (x∈p !>>= ∣ʳ .false return) = +-[] (complete p x∈p)
complete (p between (t ∷ [])) (t∈ !>>= return) with tok-sound t∈
... | (refl , refl) = between-[]
complete (p between (t ∷ t′ ∷ ts))
(t∈ !>>= (x∈p !>>= return !>>= (xs∈ !>>= return))) with tok-sound t∈
... | (refl , refl) =
between-∷ (complete (♭ p) x∈p) (complete (p between (t′ ∷ ts)) xs∈)
complete (p₁ ∥ p₂) (∣ˡ (x∈p₁ !>>= return)) = ∥ˡ (complete p₁ x∈p₁)
complete (p₁ ∥ p₂) (∣ʳ .false x∈p₂) = ∥ʳ (complete p₂ x∈p₂)
-- Some lemmas.
+-∷ʳ : ∀ {R x s s₁ s₂ xs} {p : ParserProg R} →
xs ⊕ s₁ ∈⟦ p + ⟧· s → x ⊕ s₂ ∈⟦ p ⟧· s₁ →
xs ⁺∷ʳ x ⊕ s₂ ∈⟦ p + ⟧· s
+-∷ʳ {xs = _ ∷ ._} (+-[] x∈p) y∈p = +-∷ x∈p (+-[] y∈p)
+-∷ʳ {xs = _ ∷ ._} (+-∷ x∈p xs∈p) y∈p = +-∷ x∈p (+-∷ʳ xs∈p y∈p)
cast∈ : ∀ {R x₁ x₂ s s′} {p : ParserProg R} →
x₁ ≡ x₂ → x₁ ⊕ s′ ∈⟦ p ⟧· s → x₂ ⊕ s′ ∈⟦ p ⟧· s
cast∈ refl x∈p = x∈p
|
grammarFiles/projectExpr.g4 | Anjiang-Wei/Compiler-Project2 | 1 | 7347 | <gh_stars>1-10
grammar projectExpr;
prog : pBegin ;
pBegin : stmt pBeginR ;
pBeginR : stmt pBeginR
|
;
stmt : lhs '=' rhsE ';' ;
lhs : tRef ;
rhsE : rhsI rhsER;
rhsER : '+' rhsE
| '-' rhsE
|
;
rhsI : '(' rhsE ')' rhsIR
| tRef rhsIR
| sRef rhsIR
| conVal rhsIR
;
rhsIR : '*' rhsI
| '/' rhsI
| '%' rhsI
| '//' rhsI
|
;
tRef : ID '<' cList '>' '[' aList ']';
sRef : ID '<' cList '>';
cList : IntV cListR;
cListR : ',' IntV cListR
|
;
aList : idExprE aListR;
aListR : ',' idExprE aListR
|
;
idExprE : idExprI idExprER;
idExprER : '+' idExprE
| '-' idExprE
|
;
idExprI : ID idExprIR
| '(' idExprE ')' idExprIR
| IntV idExprIR
;
idExprIR : '*' idExprI
| '//' idExprI
| '%' idExprI
|
;
conVal : FloatV
| IntV
;
IntV : [0-9]+ ;
FloatV : [0-9]+ '.' [0-9]* ;
WS : [ \t\r\n]+ -> skip ;
ID : [a-zA-Z_] [a-zA-Z0-9_]* ;
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca_notsx.log_21829_1782.asm | ljhsiun2/medusa | 9 | 350 | <filename>Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca_notsx.log_21829_1782.asm<gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r9
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_A_ht+0x2a05, %rsi
lea addresses_WC_ht+0x2285, %rdi
nop
nop
nop
nop
nop
and $10782, %r9
mov $7, %rcx
rep movsq
nop
nop
nop
nop
sub %r11, %r11
lea addresses_WC_ht+0x13c85, %rdx
clflush (%rdx)
xor %r13, %r13
movups (%rdx), %xmm0
vpextrq $1, %xmm0, %r11
dec %r9
lea addresses_normal_ht+0x189dd, %rdx
nop
nop
nop
nop
and %r11, %r11
movups (%rdx), %xmm2
vpextrq $0, %xmm2, %rdi
nop
nop
nop
cmp $59035, %r9
lea addresses_WC_ht+0xe29d, %rdx
dec %rcx
mov $0x6162636465666768, %r11
movq %r11, %xmm5
and $0xffffffffffffffc0, %rdx
vmovaps %ymm5, (%rdx)
nop
sub $5331, %r13
lea addresses_WT_ht+0x1e291, %r9
and $20103, %rdx
movw $0x6162, (%r9)
nop
nop
nop
nop
nop
sub $36970, %rcx
lea addresses_WC_ht+0x1ae05, %r9
clflush (%r9)
nop
nop
and $12388, %rdx
mov $0x6162636465666768, %r13
movq %r13, %xmm3
vmovups %ymm3, (%r9)
xor %rcx, %rcx
lea addresses_D_ht+0x1035d, %r11
nop
nop
nop
nop
nop
and $28964, %rdi
mov $0x6162636465666768, %rdx
movq %rdx, %xmm5
and $0xffffffffffffffc0, %r11
movntdq %xmm5, (%r11)
nop
xor %r13, %r13
lea addresses_A_ht+0x19efd, %r13
nop
xor $26505, %rsi
mov (%r13), %di
sub $2059, %rsi
lea addresses_WT_ht+0x1ca07, %r11
nop
cmp %rsi, %rsi
mov (%r11), %r13d
nop
nop
nop
nop
dec %rcx
lea addresses_WT_ht+0x1685, %rdi
nop
nop
nop
nop
nop
sub %r13, %r13
mov $0x6162636465666768, %r11
movq %r11, %xmm5
and $0xffffffffffffffc0, %rdi
movaps %xmm5, (%rdi)
nop
nop
nop
nop
dec %rdx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %r9
pop %r13
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r14
push %r9
push %rcx
push %rsi
// Faulty Load
lea addresses_PSE+0x1de85, %r10
nop
and %r9, %r9
movb (%r10), %r14b
lea oracles, %rcx
and $0xff, %r14
shlq $12, %r14
mov (%rcx,%r14,1), %r14
pop %rsi
pop %rcx
pop %r9
pop %r14
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 0, 'same': False, 'type': 'addresses_PSE'}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 0, 'same': True, 'type': 'addresses_PSE'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'congruent': 7, 'same': True, 'type': 'addresses_A_ht'}, 'dst': {'congruent': 10, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'REPM'}
{'src': {'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 9, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'LOAD'}
{'src': {'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 3, 'same': True, 'type': 'addresses_normal_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 32, 'congruent': 2, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 2, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 7, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'STOR'}
{'dst': {'NT': True, 'AVXalign': False, 'size': 16, 'congruent': 2, 'same': True, 'type': 'addresses_D_ht'}, 'OP': 'STOR'}
{'src': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 3, 'same': False, 'type': 'addresses_A_ht'}, 'OP': 'LOAD'}
{'src': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 0, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 16, 'congruent': 11, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'STOR'}
{'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
*/
|
Hyper.agda | oisdk/agda-playground | 6 | 11803 | {-# OPTIONS --cubical --safe #-}
module Hyper where
open import Prelude hiding (⊥)
open import Data.Empty.UniversePolymorphic
open import Data.List using (List; _∷_; [])
open import Data.Vec.Iterated
open import Data.Nat using (_*_; _+_)
open import Data.Nat.Properties using (Even; Odd)
private
variable n m : ℕ
infixr 4 _#_↬_
_#_↬_ : ℕ → Type a → Type b → Type (a ℓ⊔ b)
zero # A ↬ B = ⊥
suc n # A ↬ B = n # B ↬ A → B
module _ {a b} {A : Type a} {B : Type b} where
yfld : Vec B n → 1 + (n * 2) # List (A × B) ↬ (A → List (A × B))
yfld =
foldr
(λ n → 1 + (n * 2) # List (A × B) ↬ (A → List (A × B)))
(λ y yk xk x → (x , y) ∷ xk yk)
(λ ())
xfld : Vec A n → (1 + n) * 2 # (A → List (A × B)) ↬ List (A × B)
xfld =
foldr
(λ n → (1 + n) * 2 # (A → List (A × B)) ↬ List (A × B))
(λ x xk yk → yk xk x)
(λ _ → [])
zip : Vec A n → Vec B n → List (A × B)
zip xs ys = xfld xs (yfld ys)
cata : Even n → (((C → A) → B) → C) → n # A ↬ B → C
cata {n = suc (suc n)} e ϕ h = ϕ (λ g → h (g ∘ cata e ϕ))
push : (A → B) → n # A ↬ B → 2 + n # A ↬ B
push {n = suc n} f q k = f (k q)
one : Odd n → n # A ↬ A
one {n = suc zero} o ()
one {n = suc (suc n)} o k = k (one o)
|
Script-Development/Text-Utilities/Extract-Between.applescript | boisy/AppleScripts | 116 | 671 | <reponame>boisy/AppleScripts<filename>Script-Development/Text-Utilities/Extract-Between.applescript<gh_stars>100-1000
-- @description
-- extract text between 2 strings
--
-- @param $SearchText - whole search string
-- @param $startText - string before desired string
-- @param $endText - string after desired string
-- @return - string between startText & endText
--
on extractBetween(SearchText, startText, endText)
set tid to AppleScript's text item delimiters
set AppleScript's text item delimiters to startText
set endItems to text of text item -1 of SearchText
set AppleScript's text item delimiters to endText
set beginningToEnd to text of text item 1 of endItems
return beginningToEnd
set AppleScript's text item delimiters to tid
end extractBetween
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.