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 |
|---|---|---|---|---|
test/Succeed/fol-theorems/Record.agda | asr/apia | 10 | 2386 | ------------------------------------------------------------------------------
-- Testing records
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module Record where
postulate
D : Set
P₁ : D → Set
P₂ : D → D → Set
record P (a b : D) : Set where
constructor is
field
property₁ : P₁ a
property₂ : P₂ a b
{-# ATP axiom is #-}
postulate
p₁ : ∀ a → P₁ a
p₂ : ∀ a b → P₂ a b
{-# ATP axiom p₁ #-}
{-# ATP axiom p₂ #-}
thm₁ : ∀ a b → P a b
thm₁ a b = is (p₁ a) (p₂ a b)
postulate thm₂ : ∀ a b → P a b
{-# ATP prove thm₂ #-}
|
CloverEFI/BootSector/start.nasm | harperse/CloverBootloader | 0 | 247709 |
;
; Parameters
; X64 - 64 bit target
; LEGACY_A20 - use slow A20 Gate
; CHARACTER_TO_SHOW - character to display
; FORCE_TEXT_MODE - switch to 80x25 mono mode
; USB_LOW_EBDA - low-ebda mode
; GENPAGE - genpage mode
;
%ifdef LEGACY_A20
DELAY_PORT: equ 0xed ; Port to use for 1uS delay
KBD_CONTROL_PORT: equ 0x60 ; 8042 control port
KBD_STATUS_PORT: equ 0x64 ; 8042 status port
WRITE_DATA_PORT_CMD: equ 0xd1 ; 8042 command to write the data port
ENABLE_A20_CMD: equ 0xdf ; 8042 command to enable A20
%else
FAST_ENABLE_A20_PORT: equ 0x92
FAST_ENABLE_A20_MASK: equ 2
%endif
BASE_ADR_16: equ 0x0200
SIZE_TO_STACK_16: equ 0x0fe0 - BASE_ADR_16
IA32_EFER: equ 0xC0000080
%ifndef CHARACTER_TO_SHOW
%ifdef X64
%define CHARACTER_TO_SHOW '7'
%else
%define CHARACTER_TO_SHOW '3'
%endif
%endif
%assign GDT_DESC_SIZE 8
%macro GDT_DESC 2
dw 0xFFFF, 0
db 0, %1, %2, 0
%endmacro
%ifdef X64
%assign IDT_DESC_SIZE 16
%macro IDT_DESC 0
dw 0, SYS_CODE64_SEL
db 0, 0x8e
dw 0
dd 0, 0
%endmacro
%else
%assign IDT_DESC_SIZE 8
%macro IDT_DESC 0
dw 0, SYS_CODE_SEL
db 0, 0x8e
dw 0
%endmacro
%endif
%ifdef X64
%ifndef GENPAGE
section .pagezero start=0
times BASE_ADR_16 db 0
%endif
%else
%undef GENPAGE
%endif
bits 16
section .text start=BASE_ADR_16
global _start
_start:
jmp .SkipLabel
%ifdef X64
db 'CLOVERX64 ' ; Bootloader Label
%else
db 'CLOVERIA32 ' ; Bootloader Label
%endif
.SkipLabel:
mov ax, cs
mov ds, ax
mov es, ax
mov ss, ax
mov sp, MyStack
;
; Retrieve Bios Memory Map
;
xor ebx, ebx
lea edi, [MemoryMap]
.MemMapLoop:
mov eax, 0xe820
mov ecx, 20
mov edx, 0x534d4150 ; SMAP
int 0x15
jc .MemMapDone
add di, 20
test ebx, ebx
jnz .MemMapLoop
.MemMapDone:
sub di, MemoryMap ; Get the address of the memory map
mov [MemoryMapSize], edi ; Save the size of the memory map
;
; Rebase Self
;
xor ebx, ebx
mov bx, cs
shl ebx, 4
add [gdtr + 2], ebx
add [idtr + 2], ebx
add [.JumpTo32BitProtectedMode], ebx
%ifdef X64
add [.JumpToLongMode], ebx
%endif
;
; Enable A20 Gate
;
mov ax, 0x2401
int 0x15
jnc .A20GateEnabled
;
; If INT 15 Function 2401 is not supported, then attempt to Enable A20 manually.
;
%ifdef LEGACY_A20
;
; Legacy A20gate
;
call Empty8042InputBuffer ; Empty the Input Buffer on the 8042 controller
jnz .Timeout8042 ; Jump if the 8042 timed out
out DELAY_PORT, ax ; Delay 1 uS
mov al, WRITE_DATA_PORT_CMD ; 8042 cmd to write output port
out KBD_STATUS_PORT, al ; Send command to the 8042
call Empty8042InputBuffer ; Empty the Input Buffer on the 8042 controller
jnz .Timeout8042 ; Jump if the 8042 timed out
mov al, ENABLE_A20_CMD ; gate address bit 20 on
out KBD_CONTROL_PORT,al ; Send command to thre 8042
call Empty8042InputBuffer ; Empty the Input Buffer on the 8042 controller
mov cx, 25 ; Delay 25 uS for the command to complete on the 8042
.Delay25uS:
out DELAY_PORT, ax ; Delay 1 uS
loop .Delay25uS
.Timeout8042:
%else
;
; WIKI - fast A20gate
;
in al, FAST_ENABLE_A20_PORT
or al, FAST_ENABLE_A20_MASK
out FAST_ENABLE_A20_PORT, al
%endif
.A20GateEnabled:
%ifdef GENPAGE
;
; Create Page Table
;
call CreatePageTable
%endif
%ifdef FORCE_TEXT_MODE
;
; Switch to 80x25 mono text mode (2)
;
mov ax, 2
int 0x10
%endif
;
; Display CHARACTER_TO_SHOW
;
mov bx, 0x000F
mov ax, 0x0E00 | (CHARACTER_TO_SHOW & 255)
int 0x10
%ifndef X64
mov bx, LINEAR_SEL ; Flat data descriptor
%endif
;
; DISABLE INTERRUPTS - Entering Protected Mode
;
cli
%ifdef GENPAGE
;
; Ready Address of Page Table in EDX
;
movzx edx, word [PageTableSegment]
shl edx, 4
%endif
;
; load GDT
;
lgdt [gdtr]
%ifndef X64
;
; load IDT
;
lidt [idtr]
%endif
;
; Enable Protected Mode (set CR0.PE=1)
;
mov eax, cr0
or al, 1
mov cr0, eax
.JumpTo32BitProtectedMode: equ $ + 2
%ifndef X64
jmp dword LINEAR_CODE_SEL:(BlockSignature + 2)
%else
jmp dword LINEAR_CODE_SEL:.In32BitProtectedMode
.In32BitProtectedMode:
bits 32
;
; Entering Long Mode
;
mov ax, LINEAR_SEL
mov ds, eax
mov es, eax
mov ss, eax
; WARNING: esp invalid here
;
; Enable the 64-bit page-translation-table entries by
; setting CR4.PAE=1 (this is _required_ before activating
; long mode). Paging is not enabled until after long mode
; is enabled.
;
mov eax, cr4
or al, 0x20
mov cr4, eax
;
; This is the Trapolean Page Tables that are guarenteed
; under 4GB.
;
; Address Map:
; 10000 ~ 12000 - efildr (loaded)
; 20000 ~ 21000 - start64.com
; 21000 ~ 22000 - efi64.com
; 22000 ~ 90000 - efildr
; 90000 ~ 96000 - 4G pagetable (will be reload later)
;
%ifdef GENPAGE
mov cr3, edx
%elifdef USE_LOW_EBDA
mov eax, 0x88000
mov cr3, eax
%else
mov eax, 0x90000
mov cr3, eax
%endif
;
; Enable long mode (set EFER.LME=1).
;
mov ecx, IA32_EFER
rdmsr
or ax, 0x100
wrmsr
;
; Enable Paging to activate long mode (set CR0.PG=1)
;
mov eax, cr0
bts eax, 31
mov cr0, eax
.JumpToLongMode: equ $ + 1
jmp SYS_CODE64_SEL:.InLongMode
.InLongMode:
bits 64
mov ax, SYS_DATA_SEL
mov ds, eax
mov es, eax
mov ss, eax
lea rsp, [REL MyStack]
;
; load IDT
;
lidt [REL idtr]
jmp BlockSignature + 2
%endif
bits 16
%ifdef LEGACY_A20
Empty8042InputBuffer:
xor cx, cx
.Empty8042Loop:
out DELAY_PORT, ax ; Delay 1us
in al, KBD_STATUS_PORT ; Read the 8042 Status Port
and al, 2 ; Check the Input Buffer Full Flag
loopnz .Empty8042Loop ; Loop until the input buffer is empty or a timout of 65536 uS
ret
%endif
%ifdef GENPAGE
;
; Find place for page table and create it
;
EFILDR_BASE: equ 0x2000 ; Offset to start of EFILDR block
EFILDR_FILE_LENGTH equ 8 ; Dword in EFILDR_HEADER holding size of block
EBDA_SEG: equ 0x40 ; Segment:Offset for finding the EBDA
EBDA_OFFSET: equ 0xE
CreatePageTable:
mov edx, [EFILDR_BASE + EFILDR_FILE_LENGTH] ; Size of EFILDR block -> EDX
add edx, EFILDR_BASE + 15 ; Add base
shr edx, 4 ; And round up to multiple of 16
mov ax, ds
add dx, ax ; Add in linear base
add dx, 255
xor dl, dl ; And round up to page size
; DX holds 16-bit segment of page table
mov cx, ds ; Save DS
mov ax, EBDA_SEG
add dh, 6 ; Need 6 pages for table
mov ds, ax
mov ax, [EBDA_OFFSET] ; EBDA 16-bit segment now in AX
mov ds, cx ; Restore DS
cmp ax, dx ; Does page table fit under EBDA?
jae .continue ; Yes, continue
jmp PageTableError ; No, abort
.continue:
sub dh, 6 ; Restore DX to start segment of page table
mov [PageTableSegment], dx ; Stash it for client
push es
push di ; Save ES:DI used to build page table
mov es, dx
xor di, di ; ES:DI points to start of page table
inc dh ; Bump DX to next page
;
; Set up page table root page (only 1 entry)
;
xor eax, eax
mov ax, dx
inc dh ; Bump DX to next page
shl eax, 4
or al, 3
stosd
xor eax, eax
mov cx, 2046
rep stosw ; Wipe rest of 1st page
;
; Set up page table 2nd page (depth 1 - 4 entries)
;
mov cx, 4
.loop1:
mov ax, dx
inc dh ; Bump DX to next page
shl eax, 4
or al, 3
stosd
xor eax, eax
stosd
loop .loop1
mov cx, 2032 ; Wipe rest of 2nd page
rep stosw
;
; Set up pages 3 - 6 (depth 2 - 2048 entries)
;
xor edx, edx ; Start at base of memory
mov dl, 0x83 ; Flags at leaf nodes mark large pages (2MB each)
mov cx, 2048
.loop2:
mov eax, edx
add edx, 0x200000 ; Bump EDX to next large page
stosd
xor eax, eax
stosd
loop .loop2
;
; Done - restore ES:DI and return
;
pop di
pop es
ret
;
; Get here if not enough space between boot file
; and bottom of the EBDA - print error and halt
;
PageTableError:
add sp, 2 ; Clear return address of CreatePageTable
mov bx, 15
mov si, PageErrorMsg
.loop:
lodsb
test al, al
jz .halt
mov ah, 14
int 16
jmp .loop
.halt:
hlt
jmp .halt
align 2, db 0
PageTableSegment: dw 0
PageErrorMsg: db 'Unable to Allocate Memory for Page Table', 0
%endif
;
; Data
;
align 2, db 0
gdtr:
dw GDT_END - GDT_BASE - 1
dd GDT_BASE
;
; global descriptor table (GDT)
;
align GDT_DESC_SIZE, db 0
GDT_BASE:
NULL_SEL: equ $ - GDT_BASE
times GDT_DESC_SIZE db 0
LINEAR_SEL: equ $ - GDT_BASE
GDT_DESC 0x92, 0xCF
LINEAR_CODE_SEL: equ $ - GDT_BASE
GDT_DESC 0x9A, 0xCF
SYS_DATA_SEL: equ $ - GDT_BASE
GDT_DESC 0x92, 0xCF
SYS_CODE_SEL: equ $ - GDT_BASE
GDT_DESC 0x9A, 0xCF
times GDT_DESC_SIZE db 0
%ifdef X64
SYS_DATA64_SEL: equ $ - GDT_BASE
GDT_DESC 0x92, 0xCF
SYS_CODE64_SEL: equ $ - GDT_BASE
GDT_DESC 0x9A, 0xAF
%else
times GDT_DESC_SIZE db 0
%endif
times GDT_DESC_SIZE db 0
GDT_END:
align 2, db 0
idtr:
dw IDT_END - IDT_BASE - 1
dd IDT_BASE
%ifdef X64
dd 0
%endif
;
; interrupt descriptor table (IDT)
;
;
; Note: The hardware IRQ's specified in this table are the normal PC/AT IRQ
; mappings. This implementation only uses the system timer and all other
; IRQs will remain masked.
;
align IDT_DESC_SIZE, db 0
IDT_BASE:
%rep 20 ; Exceptions 0 - 19
IDT_DESC
%endrep
times 84 * IDT_DESC_SIZE db 0
%rep 16 ; Interrupts IRQ0 - IRQ15 mapped to vectors 0x68 - 0x77
IDT_DESC
%endrep
times IDT_DESC_SIZE db 0 ; padding
IDT_END:
align 4, db 0
MemoryMapSize:
dd 0
MemoryMap:
times SIZE_TO_STACK_16 - $ + $$ db 0
MyStack:
; below is the pieces of the IVT that is used to redirect INT 68h - 6fh
; back to INT 08h - 0fh when in real mode... It is 'org'ed to a
; known low address (20f00) so it can be set up by PlMapIrqToVect in
; 8259.c
%assign i 8
%rep 8
int i
iret
%assign i i+1
%endrep
times 0x1e - $ + MyStack db 0
BlockSignature:
dw 0xaa55
|
Driver/Video/Dumb/VidMem/Clr8/clr8Tables.asm | steakknife/pcgeos | 504 | 173369 |
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) GeoWorks 1991 -- All Rights Reserved
PROJECT: PC GEOS
MODULE: Video driver
FILE: clr8Tables.asm
AUTHOR: <NAME>
REVISION HISTORY:
Name Date Description
---- ---- -----------
jad 12/91 initial version
DESCRIPTION:
$Id: clr8Tables.asm,v 1.1 97/04/18 11:42:59 newdeal Exp $
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
;----------------------------------------------------------------------------
; Driver jump table (used by DriverStrategy)
;----------------------------------------------------------------------------
driverJumpTable label word
dw 0 ; intiialization
dw 0 ; last gasp
dw 0 ; suspend
dw 0 ; unsuspend
dw 0 ; test for device existance
dw 0 ; set device type
dw 0 ; get ptr to info block
dw 0 ; get exclusive
dw 0 ; start exclusive
dw 0 ; end exclusive
dw offset Clr8:VidGetPixel ; get a pixel color
dw offset Clr8:Clr8CallMod ; GetBits in another module
dw 0 ; set the ptr pic
dw 0 ; hide the cursor
dw 0 ; show the cursor
dw 0 ; move the cursor
dw 0 ; set save under area
dw 0 ; restore save under area
dw 0 ; nuke save under area
dw 0 ; request save under
dw 0 ; check save under
dw 0 ; get save under info
dw 0 ; check s.u. collision
dw 0 ; set xor region
dw 0 ; clear xor region
dw offset Clr8:VidDrawRect ; rectangle
dw offset Clr8:VidPutString ; char string
dw offset Clr8:Clr8CallMod ; BitBlt in another module
dw offset Clr8:Clr8CallMod ; PutBits in another module
dw offset Clr8:Clr8CallMod ; DrawLine in another module
dw offset Clr8:VidDrawRegion ; draws a region
dw offset Clr8:Clr8CallMod ; PutLine in another module
dw offset Clr8:Clr8CallMod ; Polygon in another module
dw 0 ; ScreenOn in another module
dw 0 ; ScreenOff in another module
dw offset Clr8:Clr8CallMod ; Polyline in another module
dw offset Clr8:Clr8CallMod ; DashLine in another module
dw offset Clr8:Clr8CallMod ; DashFill in another module
dw 0 ; SetPalette
dw 0 ; GetPalette
.assert ($-driverJumpTable) eq VidFunction
; this table holds offsets to the routines in different modules
moduleTable label fptr
fptr 0 ; intiialization
fptr 0 ; last gasp
fptr 0 ; suspend
fptr 0 ; unsuspend
fptr 0 ; test for device existance
fptr 0 ; set device type
fptr 0 ; get ptr to info block
fptr 0 ; get exclusive
fptr 0 ; start exclusive
fptr 0 ; end exclusive
fptr 0 ; get a pixel color
fptr Clr8Misc:VidGetBits ; GetBits in another module
fptr 0 ; set the ptr pic
fptr 0 ; hide the cursor
fptr 0 ; show the cursor
fptr 0 ; move the cursor
fptr 0 ; set save under area
fptr 0 ; restore save under area
fptr 0 ; nuke save under area
fptr 0 ; request save under
fptr 0 ; check save under
fptr 0 ; get save under info
fptr 0 ; check s.u. collision
fptr 0 ; set xor region
fptr 0 ; clear xor region
fptr 0 ; rectangle
fptr 0 ; char string
fptr Clr8Blt:VidBitBlt ; BitBlt in another module
fptr Clr8Bitmap:VidPutBits ; PutBits in another module
fptr Clr8Line:VidDrawLine ; DrawLine in another module
fptr 0 ; draws a region
fptr Clr8PutLine:VidPutLine ; PutLine in another module
fptr Clr8Line:VidPolygon ; Polygon in another module
fptr 0 ; ScreenOn in another module
fptr 0 ; ScreenOff in another module
fptr Clr8Line:VidPolyline ; Polyline in another module
fptr Clr8Line:VidDashLine ; DashLine in another module
fptr Clr8Line:VidDashFill ; DashFill in another module
fptr 0 ; SetPalette in another module
fptr 0 ; SetPalette in another module
.assert ($-moduleTable) eq (VidFunction*2)
;----------------------------------------------------------------------------
; Video Semaphores
;----------------------------------------------------------------------------
videoSem Semaphore <1,0>
;------------------------------------------------------------------------------
; Table of character drawing routines
;------------------------------------------------------------------------------
FCC_table label word
dw offset Clr8:Char1In1Out ;load 1, draw 1
dw offset Clr8:Char2In2Out ;load 2, draw 2
dw offset Clr8:Char3In3Out ;load 3, draw 3
dw offset Clr8:Char4In4Out ;load 4, draw 4
;------------------------------------------------------------------------------
; Table of draw mode routines
;------------------------------------------------------------------------------
drawModeTable label word
nptr ModeCLEAR
nptr ModeCOPY
nptr ModeNOP
nptr ModeAND
nptr ModeINVERT
nptr ModeXOR
nptr ModeSET
nptr ModeOR
VidSegment Bitmap
; this is a table of routines to put a single bitmap scan
; line. The B_type field passed in PutBitsArgs is used to
; index into the table (the lower 5 bits). The low three
; bits are the bitmap format, the next bit (BMT_COMPLEX) is
; used by the kernel bitmap code to signal that it is a
; monochrome bitmap that should be filled with the current
; area color. The fifth bit is set if there is a mask storeed
; with the bitmap.
putbitsTable label nptr ; FORMAT mask? fill?
nptr offset PutBWScan ; BMF_MONO no no
nptr offset PutColorScan ; BMF_CLR4 no no
nptr offset PutColor8Scan ; BMF_CLR8 no no
nptr offset NullBMScan ; BMF_CLR24 no no
nptr offset NullBMScan ; BMF_CMYK no no
nptr offset NullBMScan ; UNUSED no no
nptr offset NullBMScan ; UNUSED no no
nptr offset NullBMScan ; UNUSED no no
nptr offset FillBWScan ; BMF_MONO no yes
nptr offset PutColorScan ; BMF_CLR4 no yes
nptr offset PutColor8Scan ; BMF_CLR8 no yes
nptr offset NullBMScan ; BMF_CLR24 no yes
nptr offset NullBMScan ; BMF_CMYK no yes
nptr offset NullBMScan ; UNUSED no yes
nptr offset NullBMScan ; UNUSED no yes
nptr offset NullBMScan ; UNUSED no yes
nptr offset PutBWScanMask ; BMF_MONO yes no
nptr offset PutColorScanMask ; BMF_CLR4 yes no
nptr offset PutColor8ScanMask ; BMF_CLR8 yes no
nptr offset NullBMScan ; BMF_CLR24 yes no
nptr offset NullBMScan ; BMF_CMYK yes no
nptr offset NullBMScan ; UNUSED yes no
nptr offset NullBMScan ; UNUSED yes no
nptr offset NullBMScan ; UNUSED yes no
nptr offset FillBWScan ; BMF_MONO yes yes
nptr offset FillBWScan ; BMF_CLR4 yes yes
nptr offset FillBWScan ; BMF_CLR8 yes yes
nptr offset FillBWScan ; BMF_CLR24 yes yes
nptr offset FillBWScan ; BMF_CMYK yes yes
VidEnds Bitmap
VidSegment PutLine
; this is a table of routines to put a single bitmap scan
; line. The B_type field passed in PutBitsArgs is used to
; index into the table (the lower 5 bits). The low three
; bits are the bitmap format, the next bit (BMT_COMPLEX) is
; used by the kernel bitmap code to signal that it is a
; monochrome bitmap that should be filled with the current
; area color. The fifth bit is set if there is a mask storeed
; with the bitmap.
putlineTable label nptr ; FORMAT mask? fill?
nptr offset PutBWScan ; BMF_MONO no no
nptr offset PutColorScan ; BMF_CLR4 no no
nptr offset PutColor8Scan ; BMF_CLR8 no no
nptr offset NullBMScan ; BMF_CLR24 no no
nptr offset NullBMScan ; BMF_CMYK no no
nptr offset NullBMScan ; UNUSED no no
nptr offset NullBMScan ; UNUSED no no
nptr offset NullBMScan ; UNUSED no no
nptr offset FillBWScan ; BMF_MONO no yes
nptr offset PutColorScan ; BMF_CLR4 no yes
nptr offset PutColor8Scan ; BMF_CLR8 no yes
nptr offset NullBMScan ; BMF_CLR24 no yes
nptr offset NullBMScan ; BMF_CMYK no yes
nptr offset NullBMScan ; UNUSED no yes
nptr offset NullBMScan ; UNUSED no yes
nptr offset NullBMScan ; UNUSED no yes
nptr offset PutBWScanMask ; BMF_MONO yes no
nptr offset PutColorScanMask ; BMF_CLR4 yes no
nptr offset PutColor8ScanMask ; BMF_CLR8 yes no
nptr offset NullBMScan ; BMF_CLR24 yes no
nptr offset NullBMScan ; BMF_CMYK yes no
nptr offset NullBMScan ; UNUSED yes no
nptr offset NullBMScan ; UNUSED yes no
nptr offset NullBMScan ; UNUSED yes no
nptr offset FillBWScan ; BMF_MONO yes yes
nptr offset FillBWScan ; BMF_CLR4 yes yes
nptr offset FillBWScan ; BMF_CLR8 yes yes
nptr offset FillBWScan ; BMF_CLR24 yes yes
nptr offset FillBWScan ; BMF_CMYK yes yes
; these are offsets to the byte mode routines in the
; bitmap module
PLByteModeRout label nptr
nptr ByteCLEAR
nptr ByteCOPY
nptr ByteNOP
nptr ByteAND
nptr ByteINV
nptr ByteXOR
nptr ByteSET
nptr ByteOR
VidEnds PutLine
|
buildTools/win32-x64/gbdk/libc/strncmp.asm | asiekierka/gb-studio | 6,433 | 89878 | <filename>buildTools/win32-x64/gbdk/libc/strncmp.asm
;--------------------------------------------------------
; File Created by SDCC : FreeWare ANSI-C Compiler
; Version 2.3.1 Wed Sep 04 21:56:20 2019
;--------------------------------------------------------
.module strncmp
;--------------------------------------------------------
; Public variables in this module
;--------------------------------------------------------
.globl _strncmp
;--------------------------------------------------------
; special function registers
;--------------------------------------------------------
;--------------------------------------------------------
; special function bits
;--------------------------------------------------------
;--------------------------------------------------------
; internal ram data
;--------------------------------------------------------
.area _DATA
;--------------------------------------------------------
; overlayable items in internal ram
;--------------------------------------------------------
.area _OVERLAY
;--------------------------------------------------------
; indirectly addressable internal ram data
;--------------------------------------------------------
.area _ISEG
;--------------------------------------------------------
; bit data
;--------------------------------------------------------
.area _BSEG
;--------------------------------------------------------
; external ram data
;--------------------------------------------------------
.area _XSEG
;--------------------------------------------------------
; global & static initialisations
;--------------------------------------------------------
.area _GSINIT
.area _GSFINAL
.area _GSINIT
;--------------------------------------------------------
; Home
;--------------------------------------------------------
.area _HOME
; strncmp.c 10
; genLabel
; genFunction
; ---------------------------------
; Function strncmp
; ---------------------------------
___strncmp_start:
_strncmp:
lda sp,-4(sp)
; strncmp.c 12
; genAssign
; (operands are equal 3)
; genAssign
; (operands are equal 3)
; genAssign
; (operands are equal 3)
; genLabel
00104$:
; genCmpGt
; AOP_STK for
ld e,#0x80
lda hl,11(sp)
ld a,(hl)
xor a,#0x80
ld d,a
ld a,#0x00
dec hl
sub a,(hl)
ld a,e
sbc a,d
jp nc,00106$
; genPointerGet
; AOP_STK for
lda hl,6(sp)
ld e,(hl)
inc hl
ld d,(hl)
ld a,(de)
ld c,a
; genPointerGet
; AOP_STK for
inc hl
ld e,(hl)
inc hl
ld d,(hl)
ld a,(de)
ld b,a
; genPlus
; AOP_STK for
; genPlusIncr
dec hl
inc (hl)
jr nz,00116$
inc hl
inc (hl)
00116$:
; genAssign
; (operands are equal 4)
; genCmpEq
; genCmpEq: left 1, right 1, result 0
ld a,c
cp b
jp nz,00106$
jr 00118$
00117$:
jp 00106$
00118$:
; strncmp.c 13
; genPlus
; AOP_STK for
; genPlusIncr
lda hl,6(sp)
inc (hl)
jr nz,00119$
inc hl
inc (hl)
00119$:
; genAssign
; (operands are equal 4)
; genCmpEq
; genCmpEq: left 1, right 1, result 0
ld a,c
or a,a
jp nz,00102$
jr 00121$
00120$:
jp 00102$
00121$:
; strncmp.c 14
; genRet
ld de,#0x0000
jp 00107$
; genLabel
00102$:
; strncmp.c 15
; genMinus
; AOP_STK for
lda hl,10(sp)
ld e,(hl)
inc hl
ld d,(hl)
dec de
dec hl
ld (hl),e
inc hl
ld (hl),d
; genAssign
; (operands are equal 4)
; genGoto
jp 00104$
; genLabel
00106$:
; strncmp.c 17
; genCmpEq
; AOP_STK for
; genCmpEq: left 2, right 2, result 0
lda hl,10(sp)
ld a,(hl+)
or a,(hl)
jp nz,00109$
jr 00123$
00122$:
jp 00109$
00123$:
; genAssign
; AOP_STK for _strncmp_sloc2_1_0
lda hl,0(sp)
ld (hl),#0x00
; genGoto
jp 00110$
; genLabel
00109$:
; genAssign
; AOP_STK for
; AOP_STK for _strncmp_sloc0_1_0
lda hl,6(sp)
ld a,(hl+)
ld e,(hl)
lda hl,2(sp)
ld (hl+),a
ld (hl),e
; genPointerGet
; AOP_STK for _strncmp_sloc0_1_0
; AOP_STK for _strncmp_sloc1_1_0
dec hl
ld e,(hl)
inc hl
ld d,(hl)
ld a,(de)
dec hl
dec hl
ld (hl),a
; genMinus
; AOP_STK for
lda hl,8(sp)
ld e,(hl)
inc hl
ld d,(hl)
ld hl,#0x0001
ld a,e
sub a,l
ld e,a
ld a,d
sbc a,h
ld c,a
ld b,e
; genPointerGet
ld e,b
ld d,c
ld a,(de)
ld b,a
; genMinus
; AOP_STK for _strncmp_sloc1_1_0
; AOP_STK for _strncmp_sloc2_1_0
lda hl,1(sp)
ld a,(hl)
sub a,b
dec hl
ld (hl),a
; genLabel
00110$:
; genCast
; AOP_STK for _strncmp_sloc2_1_0
lda hl,0(sp)
ld c,(hl)
ld a,(hl)
rla
sbc a,a
ld b,a
; genRet
ld e,c
ld d,b
; genLabel
00107$:
; genEndFunction
lda sp,4(sp)
ret
___strncmp_end:
.area _CODE
;--------------------------------------------------------
; code
;--------------------------------------------------------
.area _CODE
.area _CODE
|
audio/music/routes3.asm | opiter09/ASM-Machina | 1 | 85616 | <reponame>opiter09/ASM-Machina<gh_stars>1-10
Music_Routes3_Ch1::
tempo 148
volume 7, 7
duty_cycle 3
vibrato 6, 3, 4
toggle_perfect_pitch
note_type 12, 11, 5
octave 3
note E_, 1
note F#, 1
note G_, 6
note F_, 1
note G_, 1
note E_, 1
rest 16
rest 15
Music_Routes3_branch_9fc3::
note_type 12, 11, 5
note E_, 6
note D_, 1
note E_, 1
note C_, 4
note E_, 4
note C_, 6
note D_, 1
note E_, 1
note F_, 2
note G_, 2
note G_, 2
note A_, 2
note_type 12, 10, 7
note A#, 8
note F_, 8
note D_, 8
note F_, 8
note_type 12, 11, 5
note E_, 6
note D_, 1
note E_, 1
note C_, 4
note E_, 4
note C_, 6
note D_, 1
note E_, 1
note F_, 2
note G_, 2
note G_, 2
note A_, 2
note_type 12, 10, 7
note A#, 8
note A#, 8
note D_, 8
note F_, 8
note_type 12, 11, 5
note E_, 4
note E_, 2
note F_, 2
note G_, 4
note F_, 2
note E_, 2
note B_, 2
octave 2
note G_, 4
octave 3
note B_, 8
note A_, 2
note_type 8, 12, 3
note A_, 4
note F_, 4
note A_, 4
note_type 8, 4, -7
note A_, 12
note_type 8, 9, 0
note F_, 12
note G_, 12
sound_loop 0, Music_Routes3_branch_9fc3
Music_Routes3_Ch2::
vibrato 8, 2, 3
duty_cycle 2
note_type 12, 12, 7
octave 3
note G_, 1
note A#, 1
note B_, 6
note A_, 1
note B_, 1
octave 4
note C_, 1
rest 15
rest 16
Music_Routes3_branch_a01a::
note_type 12, 12, 7
duty_cycle 2
octave 4
note C_, 6
octave 3
note G_, 1
octave 4
note C_, 1
note E_, 10
octave 3
note G_, 2
octave 4
note C_, 2
note G_, 2
note F_, 2
note E_, 2
note D_, 2
note C_, 2
note D_, 8
note F_, 8
note_type 12, 12, 5
duty_cycle 3
octave 3
note A#, 8
note A_, 8
note_type 12, 12, 7
duty_cycle 2
octave 4
note C_, 6
octave 3
note G_, 1
octave 4
note C_, 1
note E_, 10
octave 3
note G_, 2
octave 4
note C_, 2
note G_, 2
note F_, 2
note E_, 2
note D_, 2
note C_, 2
note D_, 8
note F_, 8
note_type 12, 12, 5
duty_cycle 3
octave 3
note A#, 8
octave 4
note D_, 6
note_type 12, 12, 7
duty_cycle 2
note C_, 1
note D_, 1
note E_, 2
note D_, 2
note E_, 2
note C_, 8
octave 3
note B_, 1
octave 4
note C_, 1
note D_, 2
octave 3
note G_, 4
octave 4
note G_, 8
note F_, 1
note E_, 1
note_type 8, 13, 3
note F_, 4
note E_, 4
note_type 8, 12, 4
note C_, 4
note_type 8, 12, 5
note C_, 12
note_type 12, 10, 0
duty_cycle 3
octave 3
note A_, 8
note B_, 8
sound_loop 0, Music_Routes3_branch_a01a
Music_Routes3_Ch3::
vibrato 4, 1, 0
note_type 6, 1, 2
octave 4
note G_, 2
note A#, 2
note B_, 8
note A_, 8
note G_, 2
rest 2
note G_, 7
rest 1
note G_, 1
rest 1
note G_, 1
rest 1
note G_, 2
rest 2
note G_, 2
rest 2
note G_, 8
note G_, 2
rest 2
note G_, 7
rest 1
note G_, 1
rest 1
note G_, 1
rest 1
note G_, 2
rest 2
note G_, 2
rest 2
note G_, 8
Music_Routes3_branch_a0a3::
note_type 12, 1, 2
note E_, 1
rest 1
note G_, 4
note E_, 1
note E_, 1
note E_, 1
rest 1
note E_, 1
rest 1
note G_, 4
note E_, 1
rest 1
note G_, 4
note E_, 1
note E_, 1
note E_, 1
rest 1
note E_, 1
rest 1
note G_, 2
note A_, 2
note F_, 1
rest 1
note A#, 4
note F_, 1
note F_, 1
note F_, 1
rest 1
note F_, 1
rest 1
note A#, 4
note F_, 1
rest 1
note A#, 4
note F_, 1
note F_, 1
note F_, 1
rest 1
note F_, 1
rest 1
note A#, 2
note F_, 2
note E_, 1
rest 1
note G_, 4
note E_, 1
note E_, 1
note E_, 1
rest 1
note E_, 1
rest 1
note G_, 4
note E_, 1
rest 1
note G_, 4
note E_, 1
note E_, 1
note E_, 1
rest 1
note E_, 1
rest 1
note G_, 2
note A_, 2
note F_, 1
rest 1
note A#, 4
note F_, 1
note F_, 1
note F_, 1
rest 1
note F_, 1
rest 1
note A#, 4
note F_, 1
rest 1
note A#, 4
note F_, 1
note F_, 1
note F_, 1
rest 1
note F_, 1
rest 1
note A#, 2
note A_, 2
note G_, 1
rest 1
octave 5
note C_, 4
octave 4
note G_, 1
note G_, 1
note G_, 1
rest 1
note G_, 1
rest 1
octave 5
note C_, 4
octave 4
note G_, 1
rest 1
octave 5
note D_, 4
octave 4
note G_, 1
note G_, 1
note G_, 1
rest 1
note G_, 1
rest 1
octave 5
note D_, 4
octave 4
note F_, 1
rest 1
octave 5
note C_, 4
octave 4
note F_, 1
note F_, 1
note F_, 1
rest 1
note F_, 1
rest 1
octave 5
note C_, 4
octave 4
note F_, 1
rest 1
note A_, 4
note F_, 1
note F_, 1
note F_, 1
rest 1
note F_, 1
rest 1
note A_, 4
sound_loop 0, Music_Routes3_branch_a0a3
Music_Routes3_Ch4::
drum_speed 6
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 8
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 18, 2
drum_note 17, 4
drum_note 17, 4
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 18, 2
drum_note 17, 4
drum_note 18, 4
drum_note 17, 4
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
Music_Routes3_branch_a17a::
drum_note 17, 12
drum_note 17, 2
drum_note 18, 2
drum_note 17, 4
drum_note 17, 4
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 8
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 18, 2
drum_note 17, 4
drum_note 17, 10
drum_note 19, 1
drum_note 19, 1
drum_note 17, 12
drum_note 17, 2
drum_note 19, 2
drum_note 17, 4
drum_note 17, 4
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 8
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 10
drum_note 19, 1
drum_note 19, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 8
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 4
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 10
drum_note 19, 1
drum_note 19, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 8
drum_note 18, 1
drum_note 19, 1
drum_note 18, 1
drum_note 19, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 8
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 17, 12
drum_note 17, 2
drum_note 17, 2
drum_note 17, 4
drum_note 17, 4
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 19, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
drum_note 18, 1
sound_loop 0, Music_Routes3_branch_a17a
|
polynomial_evaluation.asm | EdTheBass/asm_tutorial | 97 | 172077 | <gh_stars>10-100
default rel
bits 64
segment .data
format_result db 'polynomial is %lf', 0xa, 0
coefficients dq 4.4, 5.5, 6.6
x dq 4.0
degree dd 2
segment .text
extern printf
extern _CRT_INIT
extern ExitProcess
global calculate_polynomial
global main
; p(x) = p0 + p1x + p2x^2 + p3x^3 + ... + pnx^n
;
; Can use Horner's Rule for a more efficient method with doing less work
; bn = pn
; b (n-1) = p (n-1) + b (n) x
; b (n-2) = p (n-2) + b (n-1) x
; ...
; b (0) = p (0) + b1x
; Then p(x) = b0.
; calculate_polynomial(double *coefficients, double x, int degree)
calculate_polynomial:
; TODO: need to verify the result
push rbp
mov rbp, rsp
sub rsp, 32
movsd xmm0, [rcx + r8 * 8] ; xmm0 = b_k
cmp r8d, 0 ; Check if the degree is 0
jz .done
.more:
dec r8d
mulsd xmm0, xmm1 ; b_k * x
addsd xmm0, [rcx + r8 * 8] ; adding p_k
jnz .more
.done:
leave
ret
main:
push rbp
mov rbp, rsp
sub rsp, 32
call _CRT_INIT ; Needed since our entry point is not _DllMainCRTStartup. See https://msdn.microsoft.com/en-us/library/708by912.aspx
lea rcx, [coefficients]
movsd xmm1, [x]
mov r8d, [degree]
call calculate_polynomial
lea rcx, [format_result]
movq rdx, xmm0
call printf
xor eax, eax ; return 0
call ExitProcess
|
alloy4fun_models/trainstlt/models/5/EoGzFEMtaQ8W8f7zm.als | Kaixi26/org.alloytools.alloy | 0 | 1706 | open main
pred idEoGzFEMtaQ8W8f7zm_prop6 {
always (Green = Signal and no Green' or no Green and Green' = Signal)
}
pred __repair { idEoGzFEMtaQ8W8f7zm_prop6 }
check __repair { idEoGzFEMtaQ8W8f7zm_prop6 <=> prop6o } |
source/cvsweb-html2xml.adb | reznikmm/cvsweb2git | 0 | 2460 | -- BSD 3-Clause License
--
-- Copyright (c) 2017, <NAME>
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright notice,
-- this list of conditions and the following disclaimer in the documentation
-- and/or other materials provided with the distribution.
--
-- * Neither the name of the copyright holder nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
-- THE POSSIBILITY OF SUCH DAMAGE.
with Interfaces.C.Strings;
with Ada.Streams;
with System;
package body CvsWeb.Html2Xml is
use Interfaces;
type Doc_Ptr is access all C.int;
procedure xmlDocDumpMemory
(Doc : Doc_Ptr;
Buffer : out C.Strings.chars_ptr;
Size : out C.int);
pragma Import (C, xmlDocDumpMemory, "xmlDocDumpMemory");
function htmlReadMemory
(Buffer : System.Address;
Size : C.int;
URL : C.Strings.chars_ptr;
Encoding : C.Strings.chars_ptr;
Options : C.int) return Doc_Ptr;
pragma Import (C, htmlReadMemory, "htmlReadMemory");
HTML_PARSE_RECOVER : constant := 1; -- Relaxed parsing
-- HTML_PARSE_NODEFDTD : constant := 4;
-- -- do not default a doctype if not found
HTML_PARSE_NOERROR : constant := 32; -- suppress error reports
HTML_PARSE_NOWARNING : constant := 64; -- suppress warning reports
-- HTML_PARSE_PEDANTIC : constant := 128; -- pedantic error reporting
-- HTML_PARSE_NOBLANKS : constant := 256; -- remove blank nodes
-- HTML_PARSE_NONET : constant := 2048; -- Forbid network access
-- HTML_PARSE_NOIMPLIED : constant := 8192;
-- -- Do not add implied html/body... elements
-- HTML_PARSE_COMPACT : constant := 65536; -- compact small text nodes
-- HTML_PARSE_IGNORE_ENC : constant := 2097152;
-- -- ignore internal document encoding hint
procedure free (Address : C.Strings.chars_ptr);
pragma Import (C, free, "free");
procedure xmlFreeDoc (Cur : Doc_Ptr);
pragma Import (C, xmlFreeDoc, "xmlFreeDoc");
pragma Linker_Options ("-lxml2");
-------------
-- Convert --
-------------
function Convert
(Data : League.Stream_Element_Vectors.Stream_Element_Vector;
URL : League.Strings.Universal_String)
return League.Strings.Universal_String
is
use type C.int;
Doc : Doc_Ptr;
C_URL : C.Strings.chars_ptr :=
C.Strings.New_String (URL.To_UTF_8_String);
Buffer : aliased Ada.Streams.Stream_Element_Array :=
Data.To_Stream_Element_Array;
Result : C.Strings.chars_ptr;
Size : C.int;
begin
Doc := htmlReadMemory
(Buffer => Buffer (Buffer'First)'Address,
Size => Buffer'Length,
URL => C_URL,
Encoding => C.Strings.Null_Ptr,
Options => HTML_PARSE_RECOVER
+ HTML_PARSE_NOERROR
+ HTML_PARSE_NOWARNING);
xmlDocDumpMemory (Doc, Result, Size);
return Value : constant League.Strings.Universal_String :=
League.Strings.From_UTF_8_String
(C.Strings.Value (Result, C.size_t (Size)))
do
free (Result);
xmlFreeDoc (Doc);
C.Strings.Free (C_URL);
end return;
end Convert;
end CvsWeb.Html2Xml;
|
Transynther/x86/_processed/NONE/_zr_/i9-9900K_12_0xa0.log_21829_1397.asm | ljhsiun2/medusa | 9 | 160951 | .global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r12
push %r15
push %r8
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_UC_ht+0xa670, %r11
clflush (%r11)
nop
nop
nop
add %r8, %r8
movb (%r11), %r10b
nop
nop
nop
nop
xor $5895, %rbx
lea addresses_UC_ht+0x65b0, %r12
xor $23177, %r15
movups (%r12), %xmm2
vpextrq $0, %xmm2, %rbx
nop
nop
nop
nop
nop
and $7453, %r11
lea addresses_WC_ht+0x630, %rsi
lea addresses_D_ht+0xa204, %rdi
nop
nop
nop
xor %r12, %r12
mov $85, %rcx
rep movsq
nop
nop
nop
nop
add $46857, %r11
lea addresses_WC_ht+0x19486, %r11
nop
nop
nop
nop
add $14597, %rdi
movups (%r11), %xmm6
vpextrq $0, %xmm6, %rsi
nop
nop
nop
nop
nop
and %rcx, %rcx
lea addresses_D_ht+0x4b28, %r12
nop
nop
sub %rdi, %rdi
mov $0x6162636465666768, %rsi
movq %rsi, (%r12)
nop
nop
nop
nop
nop
and %r12, %r12
lea addresses_normal_ht+0xdb8, %rdi
nop
nop
nop
sub %rsi, %rsi
vmovups (%rdi), %ymm3
vextracti128 $1, %ymm3, %xmm3
vpextrq $0, %xmm3, %r11
nop
nop
nop
sub $44380, %r12
lea addresses_UC_ht+0x1c580, %rsi
lea addresses_WC_ht+0x10e80, %rdi
nop
nop
sub $16592, %r11
mov $117, %rcx
rep movsq
nop
nop
sub %rsi, %rsi
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %r8
pop %r15
pop %r12
pop %r11
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r12
push %rax
push %rbp
push %rdx
// Faulty Load
lea addresses_UC+0x2980, %r10
nop
nop
xor $59620, %rbp
movb (%r10), %al
lea oracles, %rdx
and $0xff, %rax
shlq $12, %rax
mov (%rdx,%rax,1), %rax
pop %rdx
pop %rbp
pop %rax
pop %r12
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_UC', 'AVXalign': False, 'size': 32}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'NT': False, 'same': True, 'congruent': 0, 'type': 'addresses_UC', 'AVXalign': False, 'size': 1}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 1}, 'OP': 'LOAD'}
{'src': {'NT': False, 'same': False, 'congruent': 1, 'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 16}, 'OP': 'LOAD'}
{'src': {'same': False, 'congruent': 4, 'type': 'addresses_WC_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 1, 'type': 'addresses_D_ht'}}
{'src': {'NT': False, 'same': False, 'congruent': 1, 'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 16}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 1, 'type': 'addresses_D_ht', 'AVXalign': False, 'size': 8}}
{'src': {'NT': False, 'same': False, 'congruent': 2, 'type': 'addresses_normal_ht', 'AVXalign': False, 'size': 32}, 'OP': 'LOAD'}
{'src': {'same': False, 'congruent': 8, 'type': 'addresses_UC_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 7, 'type': 'addresses_WC_ht'}}
{'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
*/
|
programs/oeis/033/A033115.asm | karttu/loda | 1 | 102092 | ; A033115: Base-5 digits are, in order, the first n terms of the periodic sequence with initial period 1,0.
; 1,5,26,130,651,3255,16276,81380,406901,2034505,10172526,50862630,254313151,1271565755,6357828776,31789143880,158945719401,794728597005,3973642985026,19868214925130,99341074625651,496705373128255,2483526865641276
mov $1,25
mov $2,5
pow $2,$0
mul $1,$2
div $1,24
|
theorems/homotopy/EM1HSpace.agda | AntoineAllioux/HoTT-Agda | 294 | 16253 | {-# OPTIONS --without-K --rewriting #-}
open import HoTT
open import homotopy.HSpace
open import homotopy.EilenbergMacLane1 using (EM₁-level₁)
module homotopy.EM1HSpace where
module EM₁HSpace {i} (G : AbGroup i) where
private
module G = AbGroup G
emloop-commutes : (g g' : G.El) → emloop g ∙ emloop g' == emloop g' ∙ emloop g
emloop-commutes g g' =
emloop g ∙ emloop g'
=⟨ ! (emloop-comp' G.grp g g') ⟩
emloop (G.comp g g')
=⟨ ap (emloop' G.grp) (G.comm g g') ⟩
emloop (G.comp g' g)
=⟨ emloop-comp' G.grp g' g ⟩
emloop g' ∙ emloop g =∎
mult-loop : G.El → (x : EM₁ G.grp) → x == x
mult-loop g = EM₁-set-elim
{P = λ x → x == x}
{{λ x → has-level-apply (EM₁-level₁ G.grp) x x}}
(emloop g)
(λ g' → ↓-idf=idf-in' (emloop-commutes g g' ∙ ∙=∙' (emloop g') (emloop g)))
private
EM₁-endo-Ω-group : Group i
EM₁-endo-Ω-group = Ω^S-group 0 ⊙[ (EM₁ G.grp → EM₁ G.grp) , (λ x → x) ]
mult-hom : GroupHom G.grp EM₁-endo-Ω-group
mult-hom = record {f = λ= ∘ mult-loop; pres-comp = pres-comp}
where
abstract
pres-comp' : (g₁ g₂ : G.El) (x : EM₁ G.grp) →
mult-loop (G.comp g₁ g₂) x == mult-loop g₁ x ∙ mult-loop g₂ x
pres-comp' g₁ g₂ =
EM₁-prop-elim
{P = λ x → mult-loop (G.comp g₁ g₂) x == mult-loop g₁ x ∙ mult-loop g₂ x}
{{λ x → has-level-apply (has-level-apply (EM₁-level₁ G.grp) _ _) _ _}}
(emloop-comp g₁ g₂)
pres-comp : (g₁ g₂ : G.El)
→ λ= (mult-loop (G.comp g₁ g₂)) ==
Group.comp EM₁-endo-Ω-group (λ= (mult-loop g₁)) (λ= (mult-loop g₂))
pres-comp g₁ g₂ =
ap λ= (λ= (pres-comp' g₁ g₂)) ∙
=ₛ-out (λ=-∙ (mult-loop g₁) (mult-loop g₂))
module MultRec = EM₁Level₁Rec {G = G.grp} {C = EM₁ G.grp → EM₁ G.grp} (λ x → x) mult-hom
abstract
mult : EM₁ G.grp → EM₁ G.grp → EM₁ G.grp
mult = MultRec.f
mult-embase-β : mult embase ↦ (λ x → x)
mult-embase-β = MultRec.embase-β
{-# REWRITE mult-embase-β #-}
mult-emloop-β : ∀ g y → ap (λ x → mult x y) (emloop g) == mult-loop g y
mult-emloop-β g y =
ap (λ x → mult x y) (emloop g)
=⟨ ap-∘ (λ f → f y) mult (emloop g) ⟩
app= (ap mult (emloop g)) y
=⟨ ap (λ w → app= w y) (MultRec.emloop-β g) ⟩
app= (λ= (mult-loop g)) y
=⟨ app=-β (mult-loop g) y ⟩
mult-loop g y =∎
H-⊙EM₁ : HSpaceStructure (⊙EM₁ G.grp)
H-⊙EM₁ = from-alt-h-space $ record { μ = mult; unit-l = unit-l; unit-r = unit-r; coh = coh }
where
unit-l : (x : EM₁ G.grp) → mult embase x == x
unit-l x = idp
unit-r : (x : EM₁ G.grp) → mult x embase == x
unit-r = EM₁-set-elim
{P = λ x → mult x embase == x}
{{λ x → has-level-apply (EM₁-level₁ G.grp) (mult x embase) x}}
idp
(λ g → ↓-app=idf-in $
idp ∙' emloop g
=⟨ ∙'-unit-l (emloop g) ⟩
emloop g
=⟨ ! (mult-emloop-β g embase) ⟩
ap (λ z → mult z embase) (emloop g)
=⟨ ! (∙-unit-r (ap (λ z → mult z embase) (emloop g))) ⟩
ap (λ z → mult z embase) (emloop g) ∙ idp ∎)
coh : unit-l embase == unit-r embase
coh = idp
open HSpaceStructure H-⊙EM₁
|
libsrc/stdio_new/dev/general/stdio_dispatchmsg.asm | meesokim/z88dk | 8 | 80737 | ; stdio_dispatchmsg
; 08.2009 aralbrec
PUBLIC stdio_dispatchmsg
; Structure of a typical device driver message dispatcher:
;
; // enter : a = STDIO_MSG_*
; // bc, de, hl = possibly contain message parameters
; // MUST NOT ALTER IX, EXX
; // on stack : ret, file structure
;
; .device_msginterpretter
;
; ex (sp),ix // ix = device driver file structure
;
; // optional direct jumps for specific messages to speed some things up
;
; cp STDIO_MSG_GETC
; jp z, device_getc
;
; cp STDIO_MSG_PUTC
; jp z, device_putc
;
; cp STDIO_MSG_FERR
; jp z, device_ferr
;
; // optional return error for messages ignored by device driver
; // this may be something like socket messages to a disk device
; // catching them here can mean a shorter message jump table
;
; cp STDIO_MSG_SOCKET
; jp nc, dev_error_ensup_mc // select to set errno appropriately
;
; // now call this subroutine (stdio_dispatch_msg) to jump to the
; // correct message function handler
;
; push hl // save possible message parameter
; ld hl,device_msgfunctbl // table of message function addresses for this driver
; jp stdio_dispatchmsg
;
; All device driver message functions must terminate with "pop ix; ret"
.stdio_dispatchmsg
add a,a ; a = STDIO_MSG_* times two
add a,l
ld l,a
jp nc, noinc
inc h
.noinc ; hl = address of message function
ld a,(hl)
inc hl
ld h,(hl)
ld l,a ; hl = function address
ex (sp),hl ; hl = message parameter
ret ; jump to function address
|
Legacy/Spotijack 0.1.applescript | alexjohnj/spotijack | 28 | 1985 | set delay_time to 0.1
set myspace to " "
set myspace2 to myspace & myspace
set myspace3 to myspace & myspace & myspace
set old_track_id to ""
set old_state to ""
tell application "Audio Hijack Pro"
set theSession to first session whose name is "Spotify"
start hijacking theSession relaunch yes
start recording theSession
end tell
set smallDelay to 0.3
delay smallDelay
tell application "Spotify" to play current track
repeat
try
set boolStarted to false
set boolPaused to false
--main crap
tell application "Spotify" to set track_id to id of current track
tell application "Spotify" to set theState to player state as string
if ((old_state is "stopped") or (old_state is "paused")) and theState is "playing" then set boolStarted to true
if (old_state is "playing") and theState is "paused" then set boolPaused to true
set old_state to theState
if (old_track_id is not track_id) then
tell application "Spotify" to pause current track
tell application "Audio Hijack Pro" to split recording theSession
--set timeDelay to 1
--delay delay_time
tell application "Spotify" to play current track
end if
set old_track_id to track_id
end try
delay delay_time
end repeat
|
programs/oeis/274/A274140.asm | neoneye/loda | 22 | 92840 | ; A274140: Sum of primes dividing n-th triangular number, counted with multiplicity.
; 0,3,5,7,8,10,11,10,11,16,16,18,20,15,14,23,23,25,26,17,21,34,30,17,23,22,18,38,37,39,39,22,31,29,20,45,56,35,25,50,51,53,56,24,34,70,56,23,24,30,35,68,62,25,27,33,51,88,69,71,92,44,23,28,32,81,86,45,38,83,81,83,110,50,34,39,34,95,90
seq $0,28387 ; a(n) = n + (n+1)^2.
seq $0,1414 ; Integer log of n: sum of primes dividing n (with repetition). Also called sopfr(n).
sub $0,2
|
parser.ads | Feqzz/film-parser | 0 | 12982 | with Ada.Strings.Unbounded;
with Ada.Strings.Fixed;
with Ada.Text_IO;
package Parser is
function GetImdbMovieId (Var : Ada.Strings.Unbounded.Unbounded_String) return Ada.Strings.Unbounded.Unbounded_String;
function GetRating (Var : Ada.Strings.Unbounded.Unbounded_String) return Integer;
end Parser;
|
libsrc/msx/msx_lpt.asm | RC2014Z80/z88dk | 8 | 98967 | ;
; MSX specific routines
; by <NAME>, December 2007
;
; int msx_lpt();
;
; Check if the line printer is ready (1=ready, 0 if not)
;
; $Id: msx_lpt.asm,v 1.4 2016-06-16 19:30:25 dom Exp $
;
SECTION code_clib
PUBLIC msx_lpt
PUBLIC _msx_lpt
EXTERN msxbios
INCLUDE "msxbios.def"
msx_lpt:
_msx_lpt:
push ix
ld ix,LPTSTT
call msxbios
pop ix
ld hl,0
ret z
inc l
ret
|
Projetos/I-VM/bin/nasm/PointerTest.nasm | juanjorgegarcia/Z01 | 2 | 19433 | ; 0 - PUSH constant 3030
leaw $3030,%A
movw %A,%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 1 - POP pointer 0
leaw $SP,%A
movw (%A),%D
decw %D
movw %D,(%A)
movw (%A),%A
movw (%A),%D
leaw $THIS,%A
movw %D,(%A)
; 2 - PUSH constant 3040
leaw $3040,%A
movw %A,%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 3 - POP pointer 1
leaw $SP,%A
movw (%A),%D
decw %D
movw %D,(%A)
movw (%A),%A
movw (%A),%D
leaw $THAT,%A
movw %D,(%A)
; 4 - PUSH constant 32
leaw $32,%A
movw %A,%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 5 - POP this 2
leaw $SP,%A
movw (%A),%D
decw %D
movw %D,(%A)
leaw $2,%A
movw %A,%D
leaw $THIS,%A
addw (%A),%D,%D
leaw $R15,%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%A
movw (%A),%D
leaw $R15,%A
movw (%A),%A
movw %D,(%A)
; 6 - PUSH constant 46
leaw $46,%A
movw %A,%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 7 - POP that 6
leaw $SP,%A
movw (%A),%D
decw %D
movw %D,(%A)
leaw $6,%A
movw %A,%D
leaw $THAT,%A
addw (%A),%D,%D
leaw $R15,%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%A
movw (%A),%D
leaw $R15,%A
movw (%A),%A
movw %D,(%A)
; 8 - PUSH pointer 0
leaw $THIS,%A
movw (%A),%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 9 - PUSH pointer 1
leaw $THAT,%A
movw (%A),%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 10 - ADD
leaw $SP,%A
movw (%A),%D
decw %D
movw %D,(%A)
movw (%A),%A
movw (%A),%D
leaw $SP,%A
subw (%A),$1,%A
addw (%A),%D,%D
movw %D,(%A)
; 11 - PUSH this 2
leaw $2,%A
movw %A,%D
leaw $THIS,%A
addw (%A),%D,%A
movw (%A),%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 12 - SUB
leaw $SP,%A
movw (%A),%D
decw %D
movw %D,(%A)
movw (%A),%A
movw (%A),%D
leaw $SP,%A
subw (%A),$1,%A
subw (%A),%D,%D
movw %D,(%A)
; 13 - PUSH that 6
leaw $6,%A
movw %A,%D
leaw $THAT,%A
addw (%A),%D,%A
movw (%A),%D
leaw $SP,%A
movw (%A),%A
movw %D,(%A)
leaw $SP,%A
movw (%A),%D
incw %D
movw %D,(%A)
; 14 - ADD
leaw $SP,%A
movw (%A),%D
decw %D
movw %D,(%A)
movw (%A),%A
movw (%A),%D
leaw $SP,%A
subw (%A),$1,%A
addw (%A),%D,%D
movw %D,(%A)
; End
|
util/menus/dsel.asm | olifink/smsqe | 0 | 96386 | <reponame>olifink/smsqe
; Select file via DSEL-Select V001
include dev8_keys_thg
include dev8_keys_menu
include dev8_mac_xref
section utility
xdef mu_dsel
;+++
; This routine use directory-select
; Entry Exit
; D0.l error, 0 or +1 for ESC
; D1.l origin or -1 preserved
; D2.l sub-colour.w | colour.w
; A0 menu title preserved
; A4 string buffer preserved
;---
stk.frm equ $40
dselreg reg d1-d4/a0-a6
mu_dsel
movem.l dselreg,-(sp)
sub.l #stk.frm,sp
move.l sp,a6 ; prepare stack
movem.l d1-d3,-(sp)
move.l #'DSEL',d2 ; we want a DIRECTORY SELECT
xbsr ut_usmen ; use MENU thing
movem.l (sp)+,d1-d3
bne.s dsel_rts ; failed, so return error
move.l #(thp.call+thp.str)<<16,ds_mennm-4(a6)
move.l a0,ds_mennm(a6) ; menu name
move.l #0,ds_lines(a6) ; number of lines
swap d1
move.l d1,ds_xpos(a6) ; x-position
swap d1
move.l d1,ds_ypos(a6)
and.l #$00ff00ff,d2 ; only byte
move.l d2,ds_mainc(a6) ; main colourway
swap d2
move.l d2,ds_ddirc(a6) ; directory colourway
move.l #(thp.ret+thp.str)<<16,ds_fname-4(a6) ; return param is a string
move.l a4,ds_fname(a6) ; pointer to return parameter
move.l a1,a4 ; address of Thing
move.l a6,a1
jsr thh_code(a4) ; call the Menu
tst.l d0
bmi.s dsel_cont ; error
bne.s save_esc ; esc or no directory selected ??
move.l ds_fname(a6),a0
move.w (a0),d0 ; no file selected ?
beq.s save_esc ; save ESC
moveq #0,d0 ; clear d0
bra.s dsel_cont
save_esc
moveq #1,d0 ; say it's ESC!!
dsel_cont
xbsr ut_frmen ; and free Menu Extension
dsel_rts
add.l #stk.frm,sp ; adjust stack
movem.l (sp)+,dselreg
tst.l d0
rts
end
|
programs/oeis/270/A270545.asm | karttu/loda | 1 | 6218 | <reponame>karttu/loda
; A270545: Number of equilateral triangle units forming perimeter of equilateral triangle.
; 1,4,9,15,21,27,33,39,45,51,57,63,69,75,81,87,93,99,105,111,117,123,129,135,141,147,153,159,165,171,177,183,189,195,201,207,213,219,225,231,237,243,249,255,261,267,273,279,285,291,297,303,309,315,321,327,333,339,345,351,357,363,369,375,381,387,393,399,405,411,417,423,429,435,441,447,453,459,465,471,477,483,489,495,501,507,513,519,525,531,537,543,549,555,561,567,573,579,585,591,597,603,609,615,621,627,633,639,645,651,657,663,669,675,681,687,693,699,705,711,717,723,729,735,741,747,753,759,765,771,777,783,789,795,801,807,813,819,825,831,837,843,849,855,861,867,873,879,885,891,897,903,909,915,921,927,933,939,945,951,957,963,969,975,981,987,993,999,1005,1011,1017,1023,1029,1035,1041,1047,1053,1059,1065,1071,1077,1083,1089,1095,1101,1107,1113,1119,1125,1131,1137,1143,1149,1155,1161,1167,1173,1179,1185,1191,1197,1203,1209,1215,1221,1227,1233,1239,1245,1251,1257,1263,1269,1275,1281,1287,1293,1299,1305,1311,1317,1323,1329,1335,1341,1347,1353,1359,1365,1371,1377,1383,1389,1395,1401,1407,1413,1419,1425,1431,1437,1443,1449,1455,1461,1467,1473,1479,1485,1491
mul $0,3
mov $1,$0
trn $1,4
add $1,$0
add $1,1
|
kernel/firmware/pit.asm | leonardoruilova/xos | 1 | 170258 |
;; xOS32
;; Copyright (C) 2016-2017 by <NAME>.
use32
TIMER_FREQUENCY = 100 ; 100 Hz is way more than enough
MAXIMUM_TASK_TIME = TIMER_FREQUENCY / 10
align 8
timer_ticks dd 0
task_time dd 0
; pit_init:
; Initialize the PIT
align 64
pit_init:
mov esi, .msg
call kprint
; install IRQ handler
mov al, IRQ_BASE+0x00 ; irq0
mov ebp, pit_irq
call install_isr
; set frequency and mode
mov al, 0x36
out 0x43, al
call iowait
mov eax, 1193182/TIMER_FREQUENCY
out 0x40, al
call iowait
mov al, ah
out 0x40, al
call iowait
; unmask IRQ
mov al, 0
call irq_unmask
ret
.msg db "Setting PIT frequency...",10,0
; pit_irq:
; PIT IRQ Handler
align 64
pit_irq:
push eax
inc [timer_ticks]
cmp [current_task], 0
je .idle
.non_idle:
inc [nonidle_time]
jmp .done
.idle:
inc [idle_time]
.done:
mov al, 0x20
out 0x20, al
pop eax
iret
; pit_sleep:
; Sleeps using the PIT
; In\ EAX = 1/100 seconds to wait
; Out\ Nothing
pit_sleep:
add eax, [timer_ticks]
.loop:
cmp [timer_ticks], eax
jge .done
sti
hlt
jmp .loop
.done:
ret
|
src/gravity.asm | Gegel85/BTTGB | 1 | 602 | ; Initialize the gravity timer.
; Params:
; None
; Return:
; None
; Registers:
; af -> Not preserved
; bc -> Not preserved
; de -> Not preserved
; hl -> Not preserved
initGravity::
ld hl, GRAVITY_TIMER
ld [hl], GRAVITY_CONSTANT
ld hl, GRAVITY_LIMITER
ld [hl], 0
ret
; Update the gravity.
; Params:
; None
; Return:
; None
; Registers:
; af -> Not preserved
; bc -> Not preserved
; de -> Not preserved
; hl -> Not preserved
updateGravity::
ld a, 0
ld hl, GRAVITY_TIMER
cp a, [hl]
jr nz, .isFalling
ld [hl], GRAVITY_CONSTANT
ld a, [hl]
ld hl, GRAVITY_LIMITER
sub [hl]
ld [hl], a
ld hl, PLAYER_STRUCT + BASIC_OBJECT_STRUCT_Y_SPEED_OFF
ld a, 7 ; Max speed
cp [hl]
jr z, .overflow
inc [hl]
ld a, 0
cp [hl]
jr nz, .skipZero
inc [hl]
.skipZero
ld hl, GRAVITY_LIMITER
inc [hl]
ret
.isFalling:
dec [hl]
ret
.capGravity:
ld [hl], 1
ret
.overflow:
ret
|
oeis/163/A163472.asm | neoneye/loda-programs | 11 | 247823 | <gh_stars>10-100
; A163472: a(n) = 12*a(n-1) - 33*a(n-2) for n > 1; a(0) = 3, a(1) = 21.
; Submitted by <NAME>(s1)
; 3,21,153,1143,8667,66285,509409,3925503,30295539,234004869,1808305641,13977507015,108055998027,835414244829,6459123003057,49940805957327,386138612387043,2985616752052725,23084826815860281,178492568972583447,1380111542747612091,10671083736876091341,82509323931841897089,637966123865191750815,4932785796631518405843,38140547472026893093221,294904638375482609725833,2280217593928903844633703,17630758060755920014651947,136321916129417213302911165,1054047977548061199151419729
mov $1,1
mov $3,1
lpb $0
sub $0,1
mul $1,3
mov $2,$3
mul $3,6
add $3,$1
mul $1,2
add $1,$2
lpe
mov $0,$1
mul $0,3
|
src/runner.asm | eljay26/smsspec | 2 | 86455 | .ramsection "smsspec.runner.current_test_info" slot 2
smsspec.runner.current_describe_message_addr: dw
smsspec.runner.current_test_message_addr: dw
.ends
.section "smsspec.runner.expectationFailed" free
smsspec.runner.expectationFailed:
; Set console text color to red
ld a, %00000011
call smsspec.console.setTextColor ; set to a
ld hl, (smsspec.runner.current_describe_message_addr)
call smsspec.console.out
call smsspec.console.newline
call smsspec.console.newline
ld hl, (smsspec.runner.current_test_message_addr)
call smsspec.console.out
; Stop program
-: jp -
.ends
.macro "smsspec.runner.expectationFailed" args message, actual
jp smsspec.runner.expectationFailed
.endm
.section "smsspec.runner.clearSystemState" free
smsspec.runner.clearSystemState:
; Clear mocks to defaults
ld hl, smsspec.mocks.start + 1
ld b, (smsspec.mocks.end - smsspec.mocks.start - 1) / _sizeof_smsspec.mock ; number of mocks
call smsspec.mock.initAll
; Clear registers
xor a
ld b, a
ld c, a
ld d, a
ld e, a
ld h, a
ld l, a
ld ix, 0
ld iy, 0
; do same for shadow flags
; reset fps counter
ret
.ends
/**
* Can be used to describe the unit being tested
* Stores a pointer to the description test which is used to
* identify the test to the user if it fails
*/
.macro "describe" args unitName
smsspec.runner.storeText unitName, smsspec.runner.current_describe_message_addr
.endm
/**
* Initialises a new test.
* Resets the Z80 registers and stores the test description in case the test fails
*/
.macro "it" args message
smsspec.runner.storeText message, smsspec.runner.current_test_message_addr
; Clear system state
call smsspec.runner.clearSystemState
.endm
/**
* Stores text in the ROM and adds a pointer to it at the given
* RAM location
*/
.macro "smsspec.runner.storeText" args text, ram_pointer
jr +
_text\@:
.asc text
.db $ff ; terminator byte
+:
ld hl, ram_pointer
ld (hl), <_text\@
inc hl
ld (hl), >_text\@
.endm
|
source/Torque3D.g4 | Ragora/TribalScript | 0 | 5488 | <gh_stars>0
/**
* Copyright 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.
*/
grammar Torque3D;
import Tribes2;
// T3D's datablock declaration is slightly different
datablock_declaration : DATABLOCK LABEL '(' LABEL (':' LABEL)? ')' '{' field_assign+ '}' ;
// T3D supports block comments
BlockComment : '/*' .*? '*/' -> skip ;
|
stdlib-exts/Data/Tree/Instance.agda | WhatisRT/meta-cedille | 35 | 14892 | module Data.Tree.Instance where
open import Class.Functor
open import Class.Monad
open import Class.Monoid
open import Class.Show
open import Class.Traversable
open import Data.List
open import Data.List.Instance
open import Data.String using (String)
open import Data.String.Instance
open import Data.Tree.Base
instance
{-# TERMINATING #-}
Tree-Functor : Functor Tree
Tree-Functor = record { _<$>_ = helper }
where
helper : ∀ {A B} -> (A -> B) -> Tree A -> Tree B
helper f (Node x x₁) = Node (f x) (map (helper f) x₁)
{-# TERMINATING #-}
Tree-Show : ∀ {A} {{_ : Show A}} -> Show (Tree A)
Tree-Show = record { show = helper show }
where
helper : ∀ {A} -> (A -> String) -> Tree A -> String
helper f (Node x x₁) = "Node (" + f x + ") " + show (map (helper f) x₁)
{-# TERMINATING #-}
Tree-Traversable : Traversable Tree
Tree-Traversable = record { sequence = helper }
where
helper : {M : Set → Set} {{_ : Monad M}} {A : Set} → Tree (M A) → M (Tree A)
helper (Node x y) = do
x' <- x
y' <- sequence (map helper y)
return (Node x' y')
|
src/kvflyweights/kvflyweights-protected_hashtables.ads | jhumphry/auto_counters | 5 | 19941 | -- kvflyweights-basic_hashtables.ads
-- A package of non-task-safe hash tables for the KVFlyweights packages
-- Copyright (c) 2016, <NAME>
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-- AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-- LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
-- OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-- PERFORMANCE OF THIS SOFTWARE.
pragma Profile (No_Implementation_Extensions);
with Ada.Containers;
with KVFlyweights_Lists_Spec;
with KVFlyweights_Hashtables_Spec;
generic
type Key(<>) is private;
type Key_Access is access Key;
type Value(<>) is limited private;
type Value_Access is access Value;
with function Hash (K : Key) return Ada.Containers.Hash_Type;
with package KVLists_Spec is
new KVFlyweights_Lists_Spec(Key => Key,
Key_Access => Key_Access,
Value_Access => Value_Access,
others => <>);
Capacity : Ada.Containers.Hash_Type := 256;
package KVFlyweights.Protected_Hashtables is
use type Ada.Containers.Hash_Type;
type List_Array is array (Ada.Containers.Hash_Type range <>) of KVLists_Spec.List;
protected type KVFlyweight is
procedure Insert (Bucket : out Ada.Containers.Hash_Type;
K : in Key;
Key_Ptr : out Key_Access;
Value_Ptr : out Value_Access);
procedure Increment (Bucket : in Ada.Containers.Hash_Type;
Key_Ptr : in Key_Access);
procedure Remove (Bucket : in Ada.Containers.Hash_Type;
Key_Ptr : in Key_Access);
private
Lists : List_Array (0..(Capacity-1))
:= (others => KVLists_Spec.Empty_List);
end KVFlyweight;
procedure Insert (F : aliased in out KVFlyweight;
Bucket : out Ada.Containers.Hash_Type;
K : in Key;
Key_Ptr : out Key_Access;
Value_Ptr : out Value_Access)
with Inline;
procedure Increment (F : aliased in out KVFlyweight;
Bucket : in Ada.Containers.Hash_Type;
Key_Ptr : in Key_Access)
with Inline;
procedure Remove (F : in out KVFlyweight;
Bucket : in Ada.Containers.Hash_Type;
Key_Ptr : in Key_Access)
with Inline;
package Hashtables_Spec is
new KVFlyweights_Hashtables_Spec(Key => Key,
Key_Access => Key_Access,
Value_Access => Value_Access,
KVFlyweight => KVFlyweight,
Insert => Insert,
Increment => Increment,
Remove => Remove);
end KVFlyweights.Protected_Hashtables;
|
savefile/maps/202F_DeliriaPond.asm | stranck/fools2018-1 | 35 | 174032 | <filename>savefile/maps/202F_DeliriaPond.asm<gh_stars>10-100
SECTION "Map_202F", ROM0[$B800]
Map_202F_Header:
hdr_tileset 0
hdr_dimensions 10, 10
hdr_pointers_a Map_202F_Blocks, Map_202F_TextPointers
hdr_pointers_b Map_202F_Script, Map_202F_Objects
hdr_pointers_c Map_202F_InitScript, Map_202F_RAMScript
hdr_palette $06
hdr_music MUSIC_PALLET_TOWN, AUDIO_1
hdr_connection NORTH, $0000, 0, 0
hdr_connection SOUTH, $0000, 0, 0
hdr_connection WEST, $1F3A, 18, 16
hdr_connection EAST, $0000, 0, 0
Map_202F_Objects:
hdr_border $0b
hdr_warp_count 0
hdr_sign_count 2
hdr_signpost 17, 15, $06
hdr_signpost 3, 11, $07
hdr_object_count 5
hdr_object SPRITE_BLACK_HAIR_BOY_2, 13, 2, STAY, NONE, $01
hdr_object SPRITE_MART_GUY, 3, 12, STAY, UP, $02
hdr_object SPRITE_BIKE_SHOP_GUY, 12, 16, STAY, NONE, $03
hdr_object SPRITE_SWIMMER, 14, 6, STAY, NONE, $04
hdr_object SPRITE_FOULARD_WOMAN, 8, 9, STAY, NONE, $05
Map_202F_RAMScript:
rs_fill_byte $6c
rs_fill_3 $c778
rs_fill_byte $7a
rs_fill_3 $c788
rs_fill_byte $6f
rs_fill_3 $c798
rs_end
Map_202F_Blocks:
db $62,$51,$51,$51,$51,$51,$51,$51,$51,$63
db $4e,$1d,$1f,$1e,$6f,$6f,$6f,$6f,$6f,$4d
db $4e,$65,$43,$2d,$1f,$1f,$1f,$1f,$1e,$4d
db $4e,$65,$43,$43,$43,$43,$43,$43,$64,$4d
db $4e,$65,$43,$43,$54,$43,$43,$43,$64,$4d
db $4e,$79,$65,$43,$78,$43,$43,$43,$64,$4d
db $6c,$0a,$6c,$65,$43,$43,$64,$6c,$6c,$4d
db $7a,$7a,$7a,$6c,$6c,$6c,$6c,$7a,$79,$4d
db $6f,$0a,$7a,$7a,$7a,$7a,$7a,$7a,$0a,$4d
db $50,$52,$52,$52,$52,$52,$52,$52,$52,$4f
Map_202F_TextPointers:
dw Map_202F_TX1
dw Map_202F_TX2
dw Map_202F_TX3
dw Map_202F_TX4
dw Map_202F_TX5
dw Map_202F_TX6
dw Map_202F_TX7
Map_202F_InitScript:
Map_202F_Script:
xor a
ld [$c04e], a
ld [$c04f], a
ld [$c06e], a
ld [$c06f], a
dec a
ld [$c056], a
ld [$c057], a
ret
Map_202F_TX1:
TX_ASM
jp EnhancedTextOnly
tx_deliria
text "heyaya !"
next "you are new here !"
para "can i be ur"
next "friend ???"
cont "please !!"
done
Map_202F_TX2:
TX_ASM
jp EnhancedTextOnly
tx_deliria
text "i watch after"
next "my pokeman !!!"
para "its right in"
next "front of me !"
done
Map_202F_TX3:
TX_ASM
jp EnhancedTextOnly
tx_deliria
text "i feel very"
next "weird .."
para "oh nos .."
next "am i gregnant?"
done
Map_202F_TX4:
TX_ASM
jp EnhancedTextOnly
tx_deliria
text "please help !!!"
para "how to return"
next "to land ??"
done
Map_202F_TX5:
TX_ASM
jp EnhancedTextOnly
tx_deliria
text "please help !!!"
next "how do i swim?"
para "i swim here,"
next "then i forget"
cont "how to swim .."
done
Map_202F_TX6:
TX_ASM
jp EnhancedTextOnly
text "An empty sign."
para "Literally nothing's"
next "written on it."
done
Map_202F_TX7:
TX_ASM
jp EnhancedTextOnly
text "A signpost."
para "The person in front keeps"
next "hugging it, so it's"
cont "impossible to read..."
done
|
projects/batfish/src/main/antlr4/org/batfish/grammar/palo_alto/PaloAlto_device_group.g4 | jeffkala/batfish | 0 | 6545 | <filename>projects/batfish/src/main/antlr4/org/batfish/grammar/palo_alto/PaloAlto_device_group.g4<gh_stars>0
parser grammar PaloAlto_device_group;
import PaloAlto_common;
options {
tokenVocab = PaloAltoLexer;
}
sdg_description
:
DESCRIPTION description = value
;
sdg_devices
:
DEVICES device = variable sdgd_vsys?
;
sdg_parent_dg
:
PARENT_DG name = variable
;
sdg_profile_group
:
PROFILE_GROUP null_rest_of_line
;
sdgd_vsys
:
VSYS name = variable
;
|
programs/oeis/271/A271208.asm | karttu/loda | 1 | 179345 | ; A271208: a(n) = n^5 + n - 1.
; -1,1,33,245,1027,3129,7781,16813,32775,59057,100009,161061,248843,371305,537837,759389,1048591,1419873,1889585,2476117,3200019,4084121,5153653,6436365,7962647,9765649,11881401,14348933,17210395,20511177,24300029,28629181,33554463
mov $1,$0
sub $0,1
pow $1,5
add $1,$0
|
_anim/SBZ Vanishing Platforms.asm | kodishmediacenter/msu-md-sonic | 9 | 164882 | <reponame>kodishmediacenter/msu-md-sonic
; ---------------------------------------------------------------------------
; Animation script - vanishing platforms (SBZ)
; ---------------------------------------------------------------------------
Ani_Van: dc.w @vanish-Ani_Van
dc.w @appear-Ani_Van
@vanish: dc.b 7, 0, 1, 2, 3, afBack, 1
even
@appear: dc.b 7, 3, 2, 1, 0, afBack, 1
even |
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c45282a.ada | best08618/asylo | 7 | 4854 | -- C45282A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT IN AND NOT IN ARE EVALUATED CORRECTLY FOR :
-- A) ACCESS TO SCALAR TYPES;
-- B) ACCESS TO ARRAY TYPES (CONSTRAINED AND UNCONSTRAINED);
-- C) ACCESS TO RECORD, PRIVATE, AND LIMITED PRIVATE TYPES WITHOUT
-- DISCRIMINANTS;
-- TBN 8/8/86
WITH REPORT; USE REPORT;
PROCEDURE C45282A IS
PACKAGE P IS
TYPE KEY IS PRIVATE;
FUNCTION INIT_KEY (X : NATURAL) RETURN KEY;
TYPE NEWKEY IS LIMITED PRIVATE;
TYPE ACC_NKEY IS ACCESS NEWKEY;
PROCEDURE ASSIGN_NEWKEY (Y : IN OUT ACC_NKEY);
PRIVATE
TYPE KEY IS NEW NATURAL;
TYPE NEWKEY IS NEW KEY;
END P;
USE P;
SUBTYPE I IS INTEGER;
TYPE ACC_INT IS ACCESS I;
P_INT : ACC_INT;
SUBTYPE INT IS INTEGER RANGE 1 .. 5;
TYPE ARRAY_TYPE1 IS ARRAY (INT RANGE <>) OF INTEGER;
TYPE ACC_ARA_1 IS ACCESS ARRAY_TYPE1;
SUBTYPE ACC_ARA_2 IS ACC_ARA_1 (1 .. 2);
SUBTYPE ACC_ARA_3 IS ACC_ARA_1 (1 .. 3);
ARA1 : ACC_ARA_1;
ARA2 : ACC_ARA_2;
ARA3 : ACC_ARA_3;
TYPE GREET IS
RECORD
NAME : STRING (1 .. 2);
END RECORD;
TYPE ACC_GREET IS ACCESS GREET;
INTRO : ACC_GREET;
TYPE ACC_KEY IS ACCESS KEY;
KEY1 : ACC_KEY;
KEY2 : ACC_NKEY;
PACKAGE BODY P IS
FUNCTION INIT_KEY (X : NATURAL) RETURN KEY IS
BEGIN
RETURN (KEY(X));
END INIT_KEY;
PROCEDURE ASSIGN_NEWKEY (Y : IN OUT ACC_NKEY) IS
BEGIN
Y.ALL := NEWKEY (1);
END ASSIGN_NEWKEY;
END P;
BEGIN
TEST ("C45282A", "CHECK THAT IN AND NOT IN ARE EVALUATED FOR " &
"ACCESS TYPES TO SCALAR TYPES, ARRAY TYPES, " &
"RECORD TYPES, PRIVATE TYPES, AND LIMITED " &
"PRIVATE TYPES WITHOUT DISCRIMINANTS");
-- CASE A
IF P_INT NOT IN ACC_INT THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 1");
END IF;
P_INT := NEW INT'(5);
IF P_INT IN ACC_INT THEN
NULL;
ELSE
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 2");
END IF;
-- CASE B
IF ARA1 NOT IN ACC_ARA_1 THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 3");
END IF;
IF ARA1 NOT IN ACC_ARA_2 THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 4");
END IF;
IF ARA1 IN ACC_ARA_3 THEN
NULL;
ELSE
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 5");
END IF;
IF ARA2 IN ACC_ARA_1 THEN
NULL;
ELSE
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 6");
END IF;
IF ARA3 NOT IN ACC_ARA_1 THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 7");
END IF;
ARA1 := NEW ARRAY_TYPE1'(1, 2, 3);
IF ARA1 IN ACC_ARA_1 THEN
NULL;
ELSE
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 8");
END IF;
IF ARA1 IN ACC_ARA_2 THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 9");
END IF;
IF ARA1 NOT IN ACC_ARA_3 THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 10");
END IF;
ARA2 := NEW ARRAY_TYPE1'(1, 2);
IF ARA2 NOT IN ACC_ARA_1 THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 11");
END IF;
IF ARA2 NOT IN ACC_ARA_2 THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 12");
END IF;
-- CASE C
IF INTRO NOT IN ACC_GREET THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 13");
END IF;
INTRO := NEW GREET'(NAME => "HI");
IF INTRO IN ACC_GREET THEN
NULL;
ELSE
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 14");
END IF;
IF KEY1 NOT IN ACC_KEY THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 15");
END IF;
KEY1 := NEW KEY'(INIT_KEY (1));
IF KEY1 IN ACC_KEY THEN
NULL;
ELSE
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 16");
END IF;
IF KEY2 NOT IN ACC_NKEY THEN
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 17");
END IF;
KEY2 := NEW NEWKEY;
ASSIGN_NEWKEY (KEY2);
IF KEY2 IN ACC_NKEY THEN
NULL;
ELSE
FAILED ("INCORRECT RESULTS FOR ACCESS TYPES - 18");
END IF;
RESULT;
END C45282A;
|
libsrc/input/generic/in_GetKeyReset.asm | jpoikela/z88dk | 8 | 3042 | ; void in_GetKeyReset(void)
; 09.2005 aralbrec
SECTION code_clib
PUBLIC in_GetKeyReset
PUBLIC _in_GetKeyReset
EXTERN _in_KeyDebounce, _in_KbdState
.in_GetKeyReset
._in_GetKeyReset
ld a,(_in_KeyDebounce)
ld e,a
ld d,0
ld (_in_KbdState),de
ret
|
Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0x84_notsx.log_21829_3150.asm | ljhsiun2/medusa | 9 | 18342 | <filename>Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0x84_notsx.log_21829_3150.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r13
push %r15
push %r9
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_UC_ht+0x183c5, %rbp
nop
nop
inc %r13
movb (%rbp), %r12b
nop
nop
nop
nop
nop
cmp $6012, %rdx
lea addresses_normal_ht+0xd245, %r10
nop
dec %r15
mov (%r10), %r9d
nop
nop
nop
nop
nop
sub $25035, %r9
lea addresses_WC_ht+0x1ae45, %rsi
lea addresses_D_ht+0x13645, %rdi
nop
xor $50748, %r13
mov $37, %rcx
rep movsw
nop
nop
nop
cmp %r9, %r9
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbp
pop %r9
pop %r15
pop %r13
pop %r12
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r13
push %r14
push %r9
push %rax
push %rbx
// Faulty Load
lea addresses_PSE+0x10e45, %rax
nop
nop
nop
sub $21489, %r13
mov (%rax), %r14w
lea oracles, %r13
and $0xff, %r14
shlq $12, %r14
mov (%r13,%r14,1), %r14
pop %rbx
pop %rax
pop %r9
pop %r14
pop %r13
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_PSE', 'same': False, 'size': 32, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'type': 'addresses_PSE', 'same': True, 'size': 2, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 1, 'congruent': 7, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_normal_ht', 'same': False, 'size': 4, 'congruent': 8, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WC_ht', 'congruent': 11, 'same': True}, 'dst': {'type': 'addresses_D_ht', 'congruent': 11, 'same': False}, 'OP': 'REPM'}
{'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
*/
|
libsrc/_DEVELOPMENT/adt/w_vector/c/sdcc_iy/w_vector_resize.asm | meesokim/z88dk | 0 | 18948 |
; int w_vector_resize(w_vector_t *v, size_t n)
SECTION code_adt_w_vector
PUBLIC _w_vector_resize
EXTERN asm_w_vector_resize
_w_vector_resize:
pop af
pop hl
pop de
push de
push hl
push af
jp asm_w_vector_resize
|
src/norx.ads | jhumphry/SPARK_NORX | 9 | 15824 | <filename>src/norx.ads
-- NORX
-- an Ada implementation of the NORX Authenticated Encryption Algorithm
-- created by <NAME>, <NAME> and <NAME>
-- Copyright (c) 2016-2018, <NAME> - see LICENSE file for details
pragma Restrictions(No_Implementation_Attributes,
No_Implementation_Units,
No_Obsolescent_Features);
with System.Storage_Elements;
use type System.Storage_Elements.Storage_Offset;
with NORX_Definitions;
use NORX_Definitions;
generic
w : Word_Size; -- Word size w ∈ { 8, 16, 32, 64 } bits
type Word is mod <>; -- Word'Modulus must equal w**2
with function Storage_Array_To_Word
(S : in System.Storage_Elements.Storage_Array) return Word;
with function Word_To_Storage_Array
(W : in Word) return System.Storage_Elements.Storage_Array;
with function Rotate_Right
(Value : Word;
Amount : Natural) return Word is <>;
with function Shift_Left
(Value : Word;
Amount : Natural) return Word is <>;
l : Round_Count; -- Rounds of the permutation to perform 1 ≤ l ≤ 63
k : Positive; -- Key size in bits
Key_Position : Key_Material_Position := 4; -- Position in the NORX state at
-- which the key is added
t : Positive; -- Tag size in bits (t ≤ 4w for NORX32 and NORX64)
n : Positive; -- Nonce size in bits
rot : Rotation_Offsets; -- Rotation offsets for permutation function
r : Positive; -- Rate in bits
c : Positive; -- Capacity in bits
package NORX is
use System.Storage_Elements;
subtype Key_Type is Storage_Array(0..Storage_Offset(k/8)-1);
-- A Storage_Array subtype containing key material.
subtype Nonce_Type is Storage_Array(0..Storage_Offset(n/8)-1);
-- A Storage_Array subtype containing the nonce material. This must be unique
-- per-message.
subtype Tag_Type is Storage_Array(0..Storage_Offset(t/8)-1);
-- A Storage_Array subtype containing an authentication tag.
Null_Storage_Array : constant Storage_Array(1..0) := (others => 0);
-- A null Storage_Array that can be passed to AEADEnc and AEADDec if one
-- of the header, message or trailer parameters is not required.
-- High-level API for NORX
procedure AEADEnc(K : in Key_Type;
N : in Nonce_Type;
A : in Storage_Array;
M : in Storage_Array;
Z : in Storage_Array;
C : out Storage_Array;
T : out Tag_Type)
with Pre => ( (Valid_Storage_Array_Parameter(A) and
Valid_Storage_Array_Parameter(M) and
Valid_Storage_Array_Parameter(Z) and
Valid_Storage_Array_Parameter(C'First, C'Last))
and then C'Length = M'Length
);
-- AEADEnc carries out an authenticated encryption
-- K : key data
-- N : nonce
-- A : optional (unencrypted) header
-- M : optional message to be encrypted
-- Z : optional (unencrypted) trailer
-- C : encrypted version of M
-- T : authentication tag for (A,M,Z)
procedure AEADDec(K : in Key_Type;
N : in Nonce_Type;
A : in Storage_Array;
C : in Storage_Array;
Z : in Storage_Array;
T : in Tag_Type;
M : out Storage_Array;
Valid : out Boolean)
with Pre => ( (Valid_Storage_Array_Parameter(A) and
Valid_Storage_Array_Parameter(C) and
Valid_Storage_Array_Parameter(Z) and
Valid_Storage_Array_Parameter(M'First, M'Last))
and then M'Length = C'Length
),
Post => (Valid or (for all I in M'Range => M(I) = 0));
-- AEADEnc carries out an authenticated decryption
-- K : key data
-- N : nonce
-- A : optional (unencrypted) header
-- C : optional ciphertext to be decrypted
-- Z : optional (unencrypted) trailer
-- T : authentication tag
-- M : contains the decrypted C or zero if the input does not authenticate
-- Valid : indicates if the input authenticates correctly
type State is private;
-- This type declaration makes the NORX.Access_Internals package easier to
-- write. It is not intended for normal use.
function Valid_Storage_Array_Parameter(X : in Storage_Array)
return Boolean
with Ghost;
-- This ghost function simplifies the preconditions
function Valid_Storage_Array_Parameter(First : in Storage_Offset;
Last : in Storage_Offset)
return Boolean
with Ghost;
-- This ghost function simplifies the preconditions
private
function Valid_Storage_Array_Parameter(X : in Storage_Array)
return Boolean is
(
if X'First <= 0 then
((Long_Long_Integer (X'Last) < Long_Long_Integer'Last +
Long_Long_Integer (X'First))
and then
X'Last < Storage_Offset'Last - Storage_Offset(r/8))
else
X'Last < Storage_Offset'Last - Storage_Offset(r/8)
);
function Valid_Storage_Array_Parameter(First : in Storage_Offset;
Last : in Storage_Offset)
return Boolean is
(
if First <= 0 then
((Long_Long_Integer (Last) < Long_Long_Integer'Last +
Long_Long_Integer (First))
and then
Last < Storage_Offset'Last - Storage_Offset(r/8))
else
Last < Storage_Offset'Last - Storage_Offset(r/8)
);
type State is array (Integer range 0..15) of Word;
-- Low-level API for NORX. These routines can be accessed by instantiating
-- the NORX.Access_Internals child package
function Make_State return State;
function Get_Initialisation_Constants return State;
function Initialise (Key : in Key_Type; Nonce : in Nonce_Type) return State;
procedure Absorb (S : in out State; X : in Storage_Array; v : in Word)
with Pre=> (Valid_Storage_Array_Parameter(X));
procedure Encrypt (S : in out State;
M : in Storage_Array;
C : out Storage_Array;
v : in Word)
with Pre => ( (Valid_Storage_Array_Parameter(M) and
Valid_Storage_Array_Parameter(C'First, C'Last)) and then
C'Length = M'Length);
procedure Decrypt (S : in out State;
C : in Storage_Array;
M : out Storage_Array;
v : in Word)
with Pre => ( (Valid_Storage_Array_Parameter(C) and
Valid_Storage_Array_Parameter(M'First, M'Last)) and then
C'Length = M'Length);
procedure Finalise (S : in out State;
Key : in Key_Type;
Tag : out Tag_Type;
v : in Word);
-- These compile-time checks test requirements that cannot be expressed
-- in the generic formal parameters. Currently compile-time checks are
-- not supported in GNATprove so the related warnings are suppressed.
pragma Warnings (GNATprove, Off, "Compile_Time_Error");
pragma Compile_Time_Error (2**w /= Word'Modulus,
"The specified type Word must have the same " &
"'Modulus as the word width parameter w**2");
pragma Compile_Time_Error (k mod w /= 0,
"The specified key size k is not a multiple of " &
"w, the word size");
pragma Compile_Time_Error (k > 12*w,
"The specified nonce size n is greater than " &
"12*w, the word size");
pragma Compile_Time_Error (t mod w /= 0,
"The specified tag size t is not a multiple of " &
"w, the word size");
pragma Compile_Time_Error (t > 16*w,
"The specified tag size t is greater than " &
"16*w, the word size");
pragma Compile_Time_Error (n mod w /= 0,
"The specified nonce size n is not a multiple " &
"of w, the word size");
pragma Compile_Time_Error (n > 4*w,
"The specified nonce size n is greater than " &
"4*w, the word size");
pragma Compile_Time_Error (r + c /= 16 * w,
"The total of the rate (r) and capacity (c) do " &
"not equal 16*w, the word size");
pragma Compile_Time_Error (r mod w /= 0 or c mod w /= 0,
"The rate r and capacity c are not " &
"multiples of the word size");
pragma Compile_Time_Error (System.Storage_Elements.Storage_Element'Size /= 8,
"This implementation of NORX cannot work " &
"with Storage_Element'Size /= 8");
pragma Warnings (GNATprove, On, "Compile_Time_Error");
end NORX;
|
Groups/Abelian/DirectSum.agda | Smaug123/agdaproofs | 4 | 3495 | {-# OPTIONS --safe --warning=error --without-K #-}
open import Setoids.Setoids
open import Groups.Definition
open import Groups.Abelian.Definition
module Groups.Abelian.DirectSum {a b c d : _} {A : Set a} {B : Set b} {S : Setoid {a} {c} A} {T : Setoid {b} {d} B} {_+1_ : A → A → A} {_+2_ : B → B → B} {G1' : Group S _+1_} {G2' : Group T _+2_} (G1 : AbelianGroup G1') (G2 : AbelianGroup G2') where
open import Groups.DirectSum.Definition G1' G2'
open import Setoids.Product S T
directSumAbGroup : AbelianGroup directSumGroup
AbelianGroup.commutative directSumAbGroup = productLift (AbelianGroup.commutative G1) (AbelianGroup.commutative G2)
|
oeis/002/A002328.asm | neoneye/loda-programs | 11 | 14703 | ; A002328: Numbers n such that n^2 - n - 1 is prime.
; Submitted by <NAME>
; 3,4,5,6,7,9,10,11,12,14,16,17,20,21,22,25,27,29,31,32,36,39,40,42,45,46,47,49,51,54,55,56,57,60,61,65,66,67,69,71,77,84,86,87,90,94,95,97,101,102,104,115,116,121,126,127,131,132,135,139,141,142,145,146,149,150,154,155,156,159,160,161,164,165,170,172,175,177,181,182,185,187,189,192,194,196,197,200,204,207,210,216,219,220,221,226,231,232,234,237
mov $2,$0
add $2,2
pow $2,2
mov $5,2
lpb $2
mov $3,$1
seq $3,10051 ; Characteristic function of primes: 1 if n is prime, else 0.
sub $0,$3
add $5,2
add $1,$5
mov $4,$0
max $4,0
cmp $4,$0
mul $2,$4
sub $2,1
lpe
mov $0,$5
add $0,2
div $0,2
|
Categories/DinaturalTransformation.agda | copumpkin/categories | 98 | 12332 | {-# OPTIONS --universe-polymorphism #-}
module Categories.DinaturalTransformation where
open import Level
open import Data.Product
open import Categories.Category
import Categories.NaturalTransformation
private module NT = Categories.NaturalTransformation
open import Categories.Functor using (Functor) renaming (_∘_ to _∘F_)
open import Categories.Bifunctor using (Bifunctor; module Functor)
open import Categories.Product
open import Categories.Square
record DinaturalTransformation {o ℓ e o′ ℓ′ e′}
{C : Category o ℓ e}
{D : Category o′ ℓ′ e′}
(F G : Bifunctor (Category.op C) C D) : Set (o ⊔ ℓ ⊔ e ⊔ o′ ⊔ ℓ′ ⊔ e′) where
private
module C = Category C
module D = Category D
open Functor F renaming (op to Fop)
open Functor G renaming (F₀ to G₀; F₁ to G₁; op to Gop)
open D hiding (op)
field
α : (c : C.Obj) → D [ F₀ (c , c) , G₀ (c , c) ]
.commute : ∀ {c c′} (f : C [ c , c′ ]) → G₁ (f , C.id) ∘ α c′ ∘ F₁ ( C.id , f ) ≡ G₁ ( C.id , f ) ∘ α c ∘ F₁ ( f , C.id )
op : DinaturalTransformation {C = C.op} {D = D.op} Gop Fop
op = record { α = α; commute = λ f → D.Equiv.trans assoc (D.Equiv.trans (D.Equiv.sym (commute f)) (D.Equiv.sym assoc)) }
_<∘_ : ∀ {o ℓ e o′ ℓ′ e′} {C : Category o ℓ e} {D : Category o′ ℓ′ e′} {F G H : Bifunctor (Category.op C) C D}
→ NT.NaturalTransformation G H → DinaturalTransformation {C = C} F G → DinaturalTransformation {C = C} F H
_<∘_ {C = C} {D} {F} {G} {H} eta alpha = record { α = λ c → η (c , c) ∘ α c; commute = λ {c} {c′} f →
begin
H.F₁ (f , C.id) ∘ ((η (c′ , c′) ∘ α c′) ∘ F.F₁ (C.id , f))
↓⟨ ∘-resp-≡ʳ assoc ⟩
H.F₁ (f , C.id) ∘ (η (c′ , c′) ∘ (α c′ ∘ F.F₁ (C.id , f)))
↑⟨ assoc ⟩
(H.F₁ (f , C.id) ∘ η (c′ , c′)) ∘ (α c′ ∘ F.F₁ (C.id , f))
↑⟨ ∘-resp-≡ˡ (eta.commute (f , C.id)) ⟩
(η (c , c′) ∘ G.F₁ (f , C.id)) ∘ (α c′ ∘ F.F₁ (C.id , f))
↓⟨ pullʳ (commute f) ⟩
η (c , c′) ∘ G.F₁ (C.id , f) ∘ (α c ∘ F.F₁ (f , C.id))
↓⟨ pullˡ (eta.commute (C.id , f)) ⟩
(H.F₁ (C.id , f) ∘ η (c , c)) ∘ (α c ∘ F.F₁ (f , C.id))
↓⟨ assoc ⟩
H.F₁ (C.id , f) ∘ (η (c , c) ∘ (α c ∘ F.F₁ (f , C.id)))
↑⟨ ∘-resp-≡ʳ assoc ⟩
H.F₁ (C.id , f) ∘ ((η (c , c) ∘ α c) ∘ F.F₁ (f , C.id))
∎
{- This uses 'associative-unital reasoning, which is now broken. Above uses
direct reasoning, which is heavier, but works. JC.
begin
H.F₁ (f , C.id) ∙ ((η (c′ , c′) ∙ α c′) ∙ F.F₁ (C.id , f))
↑⟨ refl ⟩
(H.F₁ (f , C.id) ∙ η (c′ , c′)) ∙ (α c′ ∙ F.F₁ (C.id , f))
↑≡⟨ ∘-resp-≡ˡ (eta.commute (f , C.id)) ⟩
(η (c , c′) ∙ G.F₁ (f , C.id)) ∙ (α c′ ∙ F.F₁ (C.id , f))
↓≡⟨ pullʳ (commute f) ⟩
η (c , c′) ∙ G.F₁ (C.id , f) ∙ α c ∙ F.F₁ (f , C.id)
↓≡⟨ pullˡ (eta.commute (C.id , f)) ⟩
(H.F₁ (C.id , f) ∙ η (c , c)) ∙ α c ∙ F.F₁ (f , C.id)
↓⟨ refl ⟩
H.F₁ (C.id , f) ∙ (η (c , c) ∙ α c) ∙ F.F₁ (f , C.id)
∎ -} }
where
module C = Category C
module D = Category D
open D
open D.Equiv
module F = Functor F
module G = Functor G
module H = Functor H
module eta = NT.NaturalTransformation eta
open eta using (η)
open DinaturalTransformation alpha
-- open AUReasoning D
open HomReasoning
open GlueSquares D
_∘>_ : ∀ {o ℓ e o′ ℓ′ e′} {C : Category o ℓ e} {D : Category o′ ℓ′ e′} {F G H : Bifunctor (Category.op C) C D}
→ DinaturalTransformation {C = C} G H → NT.NaturalTransformation F G → DinaturalTransformation {C = C} F H
alpha ∘> eta = DinaturalTransformation.op (eta.op <∘ alpha.op)
where
module eta = NT.NaturalTransformation eta
module alpha = DinaturalTransformation alpha
_∘ʳ_ : ∀ {o₀ ℓ₀ e₀ o₁ ℓ₁ e₁ o₂ ℓ₂ e₂}
→ {C : Category o₀ ℓ₀ e₀} {D : Category o₁ ℓ₁ e₁} {E : Category o₂ ℓ₂ e₂}
→ {F G : Bifunctor (Category.op C) C D}
→ (η : DinaturalTransformation {C = C} F G) → (K : Functor E C) → DinaturalTransformation {C = E} (F ∘F ((Functor.op K) ⁂ K)) (G ∘F ((Functor.op K) ⁂ K))
_∘ʳ_ {C = C} {D = D} {E} {F} {G} η K = record
{ α = λ c → DinaturalTransformation.α η (K.F₀ c)
; commute = λ {c} {c′} f → begin
G.F₁ (K.F₁ f , K.F₁ E.id) D.∘ η.α (K.F₀ c′) D.∘ F.F₁ (K.F₁ E.id , K.F₁ f)
↓⟨ G.F-resp-≡ (C.Equiv.refl , K.identity) ⟩∘⟨ D.Equiv.refl ⟩∘⟨ F.F-resp-≡ (K.identity , C.Equiv.refl) ⟩
G.F₁ (K.F₁ f , C.id) D.∘ η.α (K.F₀ c′) D.∘ F.F₁ (C.id , K.F₁ f)
↓⟨ DinaturalTransformation.commute η (K.F₁ f) ⟩
G.F₁ (C.id , K.F₁ f) D.∘ η.α (K.F₀ c) D.∘ F.F₁ (K.F₁ f , C.id)
↑⟨ G.F-resp-≡ (K.identity , C.Equiv.refl) ⟩∘⟨ D.Equiv.refl ⟩∘⟨ F.F-resp-≡ (C.Equiv.refl , K.identity) ⟩
G.F₁ (K.F₁ E.id , K.F₁ f) D.∘ η.α (K.F₀ c) D.∘ F.F₁ (K.F₁ f , K.F₁ E.id)
∎
}
where
module K = Functor K
module C = Category C
module D = Category D
module E = Category E
module F = Functor F
module G = Functor G
module η = DinaturalTransformation η
open D.HomReasoning
|
oeis/122/A122595.asm | neoneye/loda-programs | 11 | 29311 | <reponame>neoneye/loda-programs<gh_stars>10-100
; A122595: Expansion of x/(1 - 3*x + x^2 + x^3 - x^4).
; Submitted by <NAME>
; 1,3,8,20,50,125,313,784,1964,4920,12325,30875,77344,193752,485362,1215865,3045825,7630000,19113672,47881056,119945321,300471235,752701000,1885567500,4723475586,11832629493,29641546393,74254101600,186011604500,465971795000,1167291225293,2924144377979,7325181718144,18350081346160,45968209167650,115153508816625,288467417654209,722630616324512,1810239131670352,4534772869848960,11359916279206225,28457367452423875,71287652339886792,178580446157879236,447356234960533266,1120657973836257645
add $0,3
mov $2,1
lpb $0
sub $0,1
sub $3,$4
add $1,$3
mov $3,$4
mov $4,$2
mov $2,$3
add $2,$1
add $5,$4
add $2,$5
mov $3,$5
lpe
mov $0,$1
|
src/FRP/LTL/RSet/Globally.agda | agda/agda-frp-ltl | 21 | 909 | open import FRP.LTL.RSet.Core using ( RSet ; ⟦_⟧ )
open import FRP.LTL.RSet.Stateless using ( _⇒_ )
open import FRP.LTL.Time using ( _≤_ ; ≤-refl ; _≤-trans_ )
module FRP.LTL.RSet.Globally where
-- □ A is "A holds globally in the future"
□ : RSet → RSet
□ A t = ∀ {u} → (t ≤ u) → A u
-- Comonad structure of □
extend : ∀ {A B} → ⟦ A ⇒ B ⟧ → ⟦ □ A ⇒ □ B ⟧
extend f a s≤t = f (a s≤t)
extract : ∀ {A} → ⟦ □ A ⇒ A ⟧
extract a = a ≤-refl
duplicate : ∀ {A} → ⟦ □ A ⇒ □ (□ A) ⟧
duplicate a s≤t t≤u = a (s≤t ≤-trans t≤u)
-- Applicative structure of □
[_] : ∀ {A} → ⟦ A ⟧ → ⟦ □ A ⟧
[ a ] s≤t = a
_⟨*⟩_ : ∀ {A B} → ⟦ □ (A ⇒ B) ⇒ □ A ⇒ □ B ⟧
(f ⟨*⟩ a) s≤t = f s≤t (a s≤t) |
Transynther/x86/_processed/AVXALIGN/_zr_/i3-7100_9_0xca_notsx.log_21829_726.asm | ljhsiun2/medusa | 9 | 6312 | .global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r14
push %r15
push %rcx
lea addresses_D_ht+0x7a42, %rcx
nop
nop
nop
nop
cmp $19382, %r12
mov $0x6162636465666768, %r15
movq %r15, (%rcx)
nop
add %r14, %r14
pop %rcx
pop %r15
pop %r14
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r8
push %rdi
push %rdx
push %rsi
// Faulty Load
lea addresses_WT+0xd142, %r8
clflush (%r8)
nop
nop
inc %r11
movaps (%r8), %xmm3
vpextrq $1, %xmm3, %r12
lea oracles, %r11
and $0xff, %r12
shlq $12, %r12
mov (%r11,%r12,1), %r12
pop %rsi
pop %rdx
pop %rdi
pop %r8
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'same': False, 'congruent': 0, 'NT': False, 'type': 'addresses_WT', 'size': 32, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'same': True, 'congruent': 0, 'NT': True, 'type': 'addresses_WT', 'size': 16, 'AVXalign': True}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 8, 'NT': False, 'type': 'addresses_D_ht', 'size': 8, 'AVXalign': 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
*/
|
src/meta-cedille.agda | WhatisRT/meta-cedille | 35 | 3741 | <filename>src/meta-cedille.agda
{-# OPTIONS --type-in-type #-}
module meta-cedille where
open import Data.String using (toList)
open import IO using (Main; run)
open import Monads.Except
open import Monads.ExceptT
open import Prelude
open import Prelude.Strings
open import Parse.Generate
open import Parse.TreeConvert
open import Bootstrap.InitEnv
open import CoreTheory
open import Execution
record EvalFlags : Set where
field
printAnything : Bool
printInfo : Bool -- print the results generated by a top level command
initFlagsDefault : EvalFlags
initFlagsDefault = record
{ printAnything = false
; printInfo = false
}
runtimeFlagsDefault : EvalFlags
runtimeFlagsDefault = record
{ printAnything = true
; printInfo = true
}
eval : MetaContext → String → EvalFlags → IO (MetaContext × Bool)
eval Γ "" _ = return (Γ , true)
eval Γ input flags = let open EvalFlags flags in do
(s , (inj₂ (out , _))) ← execute (parseAndExecute input) Γ
where (_ , (inj₁ err)) → putStrErr err >> return (Γ , false)
if printAnything ∧ printInfo
then putStr $ unlines out
else return tt
return (contextFromState s , true)
rep : MetaContext → IO MetaContext
rep Γ = do
putStr "\nλ> "
flushStdout
input ← getLine
proj₁ <$> eval Γ input runtimeFlagsDefault
{-# NON_TERMINATING #-}
loop : ∀ {a} {A : Set a} → A → (A → IO A) → IO ⊤
loop start f = do
res ← f start
loop res f
repl : MetaContext → IO ⊤
repl start = loop start rep
record Options : Set where
field
startRepl : Bool
importFiles : List String
verbose : Bool
showHelp : Bool
defaultOptions : Options
defaultOptions = record
{ startRepl = true
; importFiles = []
; verbose = false
; showHelp = false }
{-# TERMINATING #-}
readOptions : ExceptT IO String Options
readOptions = do
args ← getArgs
return $ readArgs args defaultOptions
where
argumentDec : Decidable _
argumentDec s = false ≟ isInit "--" (toList s)
readArgs : List String → Options → Except String Options
readArgs [] current = return current
readArgs ("--no-repl" ∷ input) current = readArgs input record current { startRepl = false }
readArgs ("--verbose" ∷ input) current = readArgs input record current { verbose = true }
readArgs ("--help" ∷ input) current = readArgs input record current { showHelp = true }
readArgs ("--load" ∷ input) current with span argumentDec input
... | (files , rest) = readArgs rest record current { importFiles = files }
readArgs (x ∷ input) current = inj₁ ("Unknown option: " + x)
helpString : String
helpString = "Usage: meta-cedille [OPTIONS...]\n" +
concat ((λ { (fst , snd) → " --" + padRight ' ' padLength fst + snd + "\n" }) <$> helpTable)
where
helpTable : List (String × String)
helpTable =
("help" , "Show this help") ∷
("load [FILES]" , "Loads a list of files before starting the REPL") ∷
("verbose" , "Print supressed output before starting the REPL") ∷
("no-repl" , "Exits the program when the REPL would start") ∷ []
padLength : ℕ
padLength = 4 + maximum (Data.String.length ∘ proj₁ <$> helpTable)
initGrammar : Grammar
initGrammar = from-inj₂ $ preCoreGrammar {{Except-Monad}} {{Except-MonadExcept}}
bootstrapMetaContext : MetaContext
bootstrapMetaContext =
emptyGlobalContext , record { grammar = initGrammar ; namespace = "" ; evaluator = Sort-A □ }
loadFiles : MetaContext → EvalFlags → List String → IO (MetaContext × Bool)
loadFiles context flags [] = return (context , true)
loadFiles context flags files =
eval context (concat $ map (λ file → "import " + file + ".") files) flags
main : Main
main = run $ do
(inj₂ o) ← readOptions
where (inj₁ x) → putStr x
let open Options o in
if showHelp then putStr helpString else do
(init , successInit) ← eval bootstrapMetaContext initEnv initFlagsDefault
let initFlags = if verbose then runtimeFlagsDefault else initFlagsDefault
(postLoad , successLoad) ← loadFiles init initFlags importFiles
if startRepl
then repl postLoad
else if successInit ∧ successLoad
then exitSuccess
else exitFailure
|
snake.asm | careyes17/snake-atari-2600 | 0 | 165439 | <reponame>careyes17/snake-atari-2600
PROCESSOR 6502
include "lib/vcs.h"
include "lib/macro.h"
;---------------------------------------------------
;
; General Documentation
;
;---------------------------------------------------
; Playfield "coordinates" (10 x 8)
;
; 1 2 3 4 5 6 7 8
; | | | | | | | |
; 1 -- 00 01 02 03 04 05 06 07
; 2 -- 08 09 0a 0b 0c 0d 0e 0f
; 3 -- 10 11 12 13 14 15 16 17
; 4 -- 18 19 1a 1b 1c 2d 2e 2f
; 5 -- 20 21 22 23 24 25 26 27 -- middle
; 6 -- 28 29 2a 2b 2c 2d 2e 2f -- middle
; 7 -- 30 31 32 33 34 35 36 37
; 8 -- 38 39 3a 3b 3c 3d 3e 3f
; 9 -- 40 41 42 43 44 45 46 47
; 10 -- 48 49 4a 4b 4c 4d 4e 4f
; | |
; | middle
; middle
;---------------------------------------------------
;
; Constants
;
;---------------------------------------------------
SNAKECOLORNORMAL = #$c4
SNAKECOLORSLOW = #$94
SNAKECOLORFAST = #$42
SPEEDSLOW = #22
SPEEDNORMAL = #16
SPEEDFAST = #11
SIZEOFMAP = #$50
;---------------------------------------------------
;
; RAM Variable Declarations
;
;---------------------------------------------------
; variables here do not end up in ROM
SEG.U VARS
ORG $80 ; RAM starts at $80
ROWS ds 10 ; each byte = a row, bits 0-7 = columns 1 through 8
RANDOM ds 1 ; random number taken from RIOT chip timer
SNAKELENGTH ds 1 ; length of snake
SCORE ds 1 ; score: number of apples collected
; playfield location is determined by wrapping from
; left to right, up to down: #$00 (0 dec) to #$4f (79 dec)
SNAKEHEADLOCATION ds 1 ; where in the 10 x 8 playfield the snake's head is located
SNAKEOLDTAILPOINTER ds 1 ; where int the 10 x 8 playfield the snake's head is located
APPLELOCATION ds 1 ; where in the 10 x 8 playfield the apple is located
HEADDIRECTION ds 1 ; direction we want the snake to move in next turn
STOREDDIRECTION ds 1 ; direction that was last used
; points to where the head currently is in memory
HEADHISTORYPOINTER ds 1 ; pointer for where in the HEADHISTORY the current head is in
GAMEMODE ds 1 ; 0 = game playing, 1 = game over, 2 = game selection
LOOPROW ds 1 ; used to help draw the 10 rows in the playfield
ROWNUMBER ds 1 ; used in gamefield positioning calculation
COLUMNMASK ds 1 ; used in gamefield positioning calculation
COLUMNMASKINVERTED ds 1 ; inverted version of the COLUMNMASK
RENDERCOUNTER ds 1 ; a counter for determining if snake collision logic should be executed in the current frame
SELECTEDGAMETYPE ds 1 ; 0 = normal, 1 = slow, 2 = fast
DEBOUNCE ds 1 ; 0 = can select another option, 1 = user needs to release select lever
LEFTDIGITOFFSET ds 1 ; the scanline offset for the left digit of the score
RIGHTDIGITOFFSET ds 1 ; the scanline offset for the right digit of the score
LEVELOFFSET ds 1 ; the scanline offset for the selection menu level "L" character
SELECTEDGAMETYPEOFFSET ds 1 ; the scanline offset for the selection menu level (0, 1, 2) number
HEADERITERATIONSTORE ds 1 ; a helper storage variable for header rendering
RENDERSPEED ds 1 ; how fast the "game speed" is
SOUNDITERATOR ds 1 ; a variable containing the number of frames left for the sound to play
ORG $a8 ; last 80 spots in ram, tracking snake head history
HEADHISTORY ds 80 ; a "history" of where the snake head has been in the 10 x 8 playfield
;---------------------------------------------------
;
; ROM Code
;
;---------------------------------------------------
SEG CODE
ORG $F800 ; 2k ROM
;---------------------------------------------------
;
; Initialize Console and Ram Variables
;
;---------------------------------------------------
InitSystem:
; set RAM, TIA registers and CPU registers to 0
CLEAN_START
; seed the random number generator
lda INTIM ; random value
sta RANDOM ; use as seed
; init rows of the 10 x 8 playfield
ldx #10; 10 rows
initrows:
dex
lda #%11111111 ; bits 0-7 all enabled
sta ROWS,x
cpx #0
bne initrows
; add player 1 support
lda #%11110000
sta SWCHA
; init score
lda #0
sta SCORE
; setting render counter to 0
lda #0
sta RENDERCOUNTER
; setting game mode to difficulty selection
lda #2
sta GAMEMODE
; setting default game type (normal mode/green)
lda #0
sta SELECTEDGAMETYPE
lda #5
sta SELECTEDGAMETYPEOFFSET
; setting sound iterator to "not playing sound"
lda #0
sta SOUNDITERATOR
; clearing registers
lda #0
ldx #0
ldy #0
;---------------------------------------------------
;
; Game Loop
;
;---------------------------------------------------
Main:
jsr VerticalSync
jsr VerticalBlank
jsr Kernel
jsr OverScan
jmp Main
VerticalSync:
lda #2
ldx #49
sta WSYNC
sta VSYNC
stx TIM64T ; set timer to go off in 41 scanlines (49 * 64) / 76
sta WSYNC ; Wait for Sync - halts CPU until end of 1st scanline of VSYNC
sta WSYNC
lda #0
sta WSYNC
sta VSYNC
rts
; game logic can resides here
VerticalBlank:
; reseting loop row
lda #0
sta LOOPROW
; reseting render offset for
lda #0
sta LEVELOFFSET
; checking if game is over
lda GAMEMODE
cmp #1
beq lostgame
; checking is game mode is in "level selection" mode
cmp #2
beq choosegamemode
jsr SetDirection ; poll user input
jsr GenerateRandom ; generate random number
; checking if collision should be checked this frame or not
lda RENDERCOUNTER
cmp RENDERSPEED
bne dontrender
jsr GenerateRandom ; generate random number
jsr CheckCollision
; reseting render counter after collision is checked for this frame
lda #0
sta RENDERCOUNTER
jmp lostgame
dontrender:
inc RENDERCOUNTER ; increment render counter until it meets the RENDERSPEED threshold
choosegamemode:
jsr ProcessSwitches
lostgame:
rts
Kernel:
sta WSYNC
lda INTIM ; check the timer
bne Kernel ; branch if timer is not equal to 0
; turn on the display
sta VBLANK ; Accumulator D1=0, turns off Vertical Blank signal (image output on)
; draw the screen
; 192 scanlines for the game (NTSC)
KernelLoop:
; set background color
lda #0
sta COLUBK
; set playfield color
lda #$0a
sta COLUPF
; checking is game mode is in "level selection" mode
lda #2
cmp GAMEMODE
bne top20init
; iterates 20 times, a header for the screen containing the level selected
; this block of code is executed if the gamemode is 2
ldx #20 ; 20 iterations
ldy #0
top20title:
lda #0
sta PF2
sta WSYNC
lda #0
sta PF0
sty HEADERITERATIONSTORE
ldy LEVELOFFSET
lda levelletter,y
sta PF2
ldy SELECTEDGAMETYPEOFFSET
lda digits,y
sta PF0
ldy HEADERITERATIONSTORE
iny
cpy #4
bne continuetop20title
inc LEVELOFFSET
inc SELECTEDGAMETYPEOFFSET
ldy #0
continuetop20title:
dex
bne top20title
jmp clearPF
; iterates 20 times, a header for the screen containing the score
; this block of code is executed if the gamemode is either 0 or 1
top20init:
ldx #20 ; 20 iterations
ldy #0
top20:
lda #0
sta PF2
sta WSYNC
lda #0
sta PF0
sty HEADERITERATIONSTORE
; left digit
ldy LEFTDIGITOFFSET
lda digits,y
sta PF2
; right digit
ldy RIGHTDIGITOFFSET
lda digits,y
sta PF0
ldy HEADERITERATIONSTORE
iny
cpy #4
bne continuetop20
inc LEFTDIGITOFFSET
inc RIGHTDIGITOFFSET
ldy #0
continuetop20:
dex
bne top20
clearPF:
; clearing playfield from score display section
lda #0
sta PF2
sta PF1
sta PF0
; sets the appropriate playfield color according to the gametype selected
; and also waits 4 scanlines + one extra scanline outside of the main loop
ldx #4
top4plus1:
sta WSYNC
; set playfield color
ldy SELECTEDGAMETYPE
lda snakecolors,y
sta COLUPF
dex
bne top4plus1
; set background color
lda #0
sta COLUBK
sta WSYNC ; just once
; iterates over 160 scanlines, displaying the entire playfield
; also wastes two scanlines at the end
middle160plus3:
loop10: ; loops 10 times, representing each of the 10 rows of the playfield
ldx #16 ; loop 16 times per "playfield row", making square-ish "pixels"
ldy LOOPROW
middlerow:
sta WSYNC ; performed 160 times total
; draw snake playfield
; columns 1-4
lda ROWS,y
and #%11110000
tay
lda leftPF2,y
sta PF2
ldy LOOPROW
; columns 5-6
lda ROWS,y
and #%00001100
tay
lda rightPF0,y
sta PF0
ldy LOOPROW
; columns 7-8
lda ROWS,y
and #%00000011
tay
lda rightPF1,y
sta PF1
; reseting PF2
lda #0
sta PF2
sta PF0
sta PF1
ldy LOOPROW
dex
bne middlerow
; loop back to the top after the 16 pixels of a row have been displayed
inc LOOPROW
cpy #$09
bne loop10
; draw snake playfield ended
finalizedraw:
sta WSYNC ; wasting 1
; clearing the playfield
lda #0
sta PF0
sta PF1
sta PF2
lda #0
sta COLUBK
; wasting 2
sta WSYNC
sta WSYNC
; setting background color for bottom56
lda #$0a
sta COLUBK
; iterates 4 times, displaying a bottom bar for the playfield
ldx #4
bottom4:
sta WSYNC
dex
bne bottom4
rts
; drawing 192 scanlines completed
OverScan:
sta WSYNC
lda #2
sta VBLANK
lda #32 ; set timer for 27 scanlines, 32 = ((27 * 76) / 64)
sta TIM64T ; set timer to go off in 27 scanlines
; game logic can go here
jsr ProcessSwitches
jsr PlaceAppleInPlayfield
jsr PrepScore
jsr PrepSelectedGame
jsr ProcessSound
jsr GenerateRandom
OSwait:
sta WSYNC ; Wait for SYNC (halts CPU until end of scanline)
lda INTIM ; Check the timer
bne OSwait ; loop back if the timer has not elapsed all of the waiting time
rts
;---------------------------------------------------
;
; Sound Subroutines
;
;---------------------------------------------------
EatAppleSound:
lda #1
sta AUDC0 ; channel
lda #8
sta AUDF0 ; frequency
lda #3
sta AUDV0 ; volume
lda #5
sta SOUNDITERATOR
rts
SelectGameSound:
lda #1
sta AUDC0 ; channel
lda #15
sta AUDF0 ; frequency
lda #3
sta AUDV0 ; volume
lda #5
sta SOUNDITERATOR
rts
ProcessSound:
lda SOUNDITERATOR
beq turnsoundoff
dec SOUNDITERATOR
rts
turnsoundoff:
lda #0
sta AUDV0
rts
;---------------------------------------------------
;
; General Purpose Subroutines
;
;---------------------------------------------------
; called when the user presses the reset switch on the console
UserReset:
; init rows of the 10 x 8 playfield
ldx #10; 10 rows
initrowsreset:
dex
lda #%11111111 ; bits 0-7 all enabled
sta ROWS,x
cpx #0
bne initrowsreset
; setting up starting position of snake
; NOTE: 0 = snake in this square
; using row 6 of the playfield
lda #%11100111
sta ROWS + 5
; init snake length
lda #2
sta SNAKELENGTH
; set game speed
ldx SELECTEDGAMETYPE
lda snakespeed,x
sta RENDERSPEED
; init score
lda #0
sta SCORE
; init snake head location
lda #$2c
sta SNAKEHEADLOCATION
; init snake tail location
lda #$a8
sta SNAKEOLDTAILPOINTER
; init apple location
lda #$ff
sta APPLELOCATION
; generate new random number
jsr GenerateRandom
; init snake head direction
lda #%01111111 ; right
sta HEADDIRECTION
; init head history
lda #$2a
sta HEADHISTORY
lda #$2b
sta HEADHISTORY + 1
lda #$2c
sta HEADHISTORY + 2
; init head history pointer
lda #$aa ; a8 being the start of the history + 2 (assuming the snake is 2 long at the start)
sta HEADHISTORYPOINTER
; setting render counter
lda #0
sta RENDERCOUNTER
; setting score color
lda #$0a
sta COLUPF
; setting display table offsets to 0
lda #0
sta LEFTDIGITOFFSET
sta RIGHTDIGITOFFSET
sta LEVELOFFSET
sta SELECTEDGAMETYPEOFFSET
rts
ProcessSwitches:
lda SWCHB ; load in the state of the switches
lsr ; D0 is now in C
bcs notreset ; if D0 was on, the RESET switch was not held
jsr UserReset ; prep for new game
lda #0
sta GAMEMODE
rts
notreset:
lsr ; carry flag
bcs NotSelect
; selection mode engaged
; set game mode to SELECT mode (#2)
lda #2
sta GAMEMODE
; checking if user is allowed to make a selection
; this is done so the selection won't fall through and
; refresh selection at 60Hz
lda #0
cmp DEBOUNCE
bne selected
; reset game type selection if the next game type is out of bounds
lda #2
cmp SELECTEDGAMETYPE
beq resetselectedgametype
; setting debounce to prevent fall through
lda #1
sta DEBOUNCE
jsr SelectGameSound
inc SELECTEDGAMETYPE
jmp selected
resetselectedgametype:
; resetting selected gametype to 0
lda #0
sta SELECTEDGAMETYPE
jsr SelectGameSound
; setting debounce to prevent fall through
lda #1
sta DEBOUNCE
jmp selected
NotSelect:
; if the user has let go of the select lever
; they are allowed to select again
lda #0
sta DEBOUNCE
selected:
rts
; generate random number
GenerateRandom:
lda RANDOM
lsr
bcc noeor
eor #$8e
noeor:
sta RANDOM
rts
SetDirection:
ldx SWCHA
cpx #%11111111 ; no direction selected
beq nodirection
cpx #%11101111
beq normaldirection
cpx #%11011111
beq normaldirection
cpx #%10111111
beq normaldirection
cpx #%01111111
beq normaldirection
jmp nodirection
normaldirection:
; check if direction is not opposite to current direction
lda STOREDDIRECTION
cmp #%11101111 ; up
beq isdown
cmp #%01111111 ; right
beq isleft
cmp #%11011111 ; down
beq isup
cmp #%10111111 ; left
beq isright
jmp nodirection
isdown:
cpx #%11011111 ; down
beq nodirection
jmp storedirection
isleft:
cpx #%10111111 ; left
beq nodirection
jmp storedirection
isright:
cpx #%01111111 ; right
beq nodirection
jmp storedirection
isup:
cpx #%11101111 ; up
beq nodirection
jmp storedirection
storedirection:
stx HEADDIRECTION
nodirection:
rts
CheckCollision:
ldx HEADDIRECTION
cpx #%11101111 ; up
bne checkcollisioncontinue1
jmp up
checkcollisioncontinue1:
cpx #%01111111 ; right
bne checkcollisioncontinue2
jmp right
checkcollisioncontinue2:
cpx #%11011111 ; down
bne checkcollisioncontinue3
jmp down
checkcollisioncontinue3:
; left is the only option left
jmp left
up:
lda SNAKEHEADLOCATION
sec
sbc #$08
clc
bpl applecollisionup
jmp BadCollision ; if value of subtraction is negative
applecollisionup:
; is collision with an apple?
lda SNAKEHEADLOCATION
sec
sbc APPLELOCATION
sec
sbc #$08
bne collisionresumeup
clc
; increment score
sed
lda SCORE
clc
adc $01
sta SCORE
cld
; increment snake length
inc SNAKELENGTH
; setting value of apple location to $ff to know that we need to put apple in new location
clc ; clears carry
lda #$ff
sta APPLELOCATION
jsr GetRowAndColumnForHead
jsr MoveHeadHistoryPointerForward
jsr MoveSnakeUp
jsr EatAppleSound
rts
collisionresumeup:
clc ; clears carry
; get row and column of the snake head
; check if the square above (up) the snake head is its body (bit = 0)
jsr GetRowAndColumnForHead
ldx ROWNUMBER
dex
lda ROWS,x
and COLUMNMASK
cmp #0
bne rowsupreturn
jmp BadCollision
rowsupreturn:
jsr MoveHeadHistoryPointerForward
jsr IncrementOldSnakeTailPointer
jsr MoveSnakeUp
jsr GetRowAndColumnForTail
jsr removeoldsnaketail
rts
right:
lda #$07
checkright:
cmp SNAKEHEADLOCATION
bne checkrightcontinue
jmp BadCollision
checkrightcontinue:
clc
adc #$08
cmp #$57
bne checkright
; is collision with an apple?
lda SNAKEHEADLOCATION
clc
adc #$01
cmp APPLELOCATION
bne collisionresumeright
; increment score
sed
lda SCORE
clc
adc $01
sta SCORE
cld
; increment snake length
inc SNAKELENGTH
; setting value of apple location to $ff to know that we need to put apple in new location
lda #$ff
sta APPLELOCATION
jsr GetRowAndColumnForHead
jsr MoveHeadHistoryPointerForward
jsr MoveSnakeRight
jsr EatAppleSound
rts
collisionresumeright:
; get row and column of the snake head
; check if the square right of the snake head is its body (bit = 0)
jsr GetRowAndColumnForHead
ldx ROWNUMBER
lda ROWS,x
asl
and COLUMNMASK
cmp #0
bne rowsrightreturn
jmp BadCollision
rowsrightreturn:
jsr MoveHeadHistoryPointerForward
jsr IncrementOldSnakeTailPointer
jsr MoveSnakeRight
jsr GetRowAndColumnForTail
jsr removeoldsnaketail
rts
down:
lda SNAKEHEADLOCATION
clc
adc #$08
cmp #$50
bcc applecollisiondown
jmp BadCollision ; if $50 is greater than the a register
applecollisiondown:
; is collision with an apple?
lda APPLELOCATION
sec
sbc SNAKEHEADLOCATION
sec
sbc #$08
bne collisionresumedown
clc
; increment score
sed
lda SCORE
clc
adc $01
sta SCORE
cld
; increment snake length
inc SNAKELENGTH
; setting value of apple location to $ff to know that we need to put apple in new location
clc ; clear carry
lda #$ff
sta APPLELOCATION
jsr GetRowAndColumnForHead
jsr MoveHeadHistoryPointerForward
jsr MoveSnakeDown
jsr EatAppleSound
rts
collisionresumedown:
clc ; clear carry
; get row and column of the snake head
; check if the square below (down) the snake head is its body (bit = 0)
jsr GetRowAndColumnForHead
ldx ROWNUMBER
inx
lda ROWS,x
and COLUMNMASK
cmp #0
bne rowsdownreturn
jmp BadCollision
rowsdownreturn:
jsr MoveHeadHistoryPointerForward
jsr IncrementOldSnakeTailPointer
jsr MoveSnakeDown
jsr GetRowAndColumnForTail
jsr removeoldsnaketail
rts
left:
lda #$00
checkleft:
cmp SNAKEHEADLOCATION
bne checkleftcontinue
jmp BadCollision
checkleftcontinue:
clc
adc #$08
cmp #$50
bne checkleft
; is collision with an apple?
lda SNAKEHEADLOCATION
sec
sbc #$01
clc
cmp APPLELOCATION
bne collisionresumeleft
; increment score
sed
lda SCORE
clc
adc $01
sta SCORE
cld
; increment snake length
inc SNAKELENGTH
; setting value of apple location to $ff to know that we need to put apple in new location
lda #$ff
sta APPLELOCATION
jsr GetRowAndColumnForHead
jsr MoveHeadHistoryPointerForward
jsr MoveSnakeLeft
jsr EatAppleSound
rts
collisionresumeleft:
; get row and column of the snake head
; check if the square right of the snake head is its body (bit = 0)
jsr GetRowAndColumnForHead
ldx ROWNUMBER
lda ROWS,x
lsr
and COLUMNMASK
cmp #0
bne rowsleftreturn
jmp BadCollision
rowsleftreturn:
jsr MoveHeadHistoryPointerForward
jsr IncrementOldSnakeTailPointer
jsr MoveSnakeLeft
jsr GetRowAndColumnForTail
jsr removeoldsnaketail
rts
BadCollision:
; set gamemode to #1, meaning game over
lda #$01
sta GAMEMODE
clc
rts
GetRowAndColumnForHead:
ldx #0
lda SNAKEHEADLOCATION
sec
rowloop:
sbc #$08
bmi columnloop
inx
jmp rowloop
columnloop:
storerow:
stx ROWNUMBER
sec
lda endofrownumber,x ; rownumber already in x register
sbc SNAKEHEADLOCATION
clc
tax
lda columnmasklist,x
sta COLUMNMASK
lda removetailmasklist,x
sta COLUMNMASKINVERTED
rowvarusedstored:
clc
rts
MoveHeadHistoryPointerForward:
; update snake on playfield
lda HEADHISTORYPOINTER
cmp #$f7
beq moveforwardheadreset
; increment head
lda HEADHISTORYPOINTER
clc
adc #$01
sta HEADHISTORYPOINTER
rts
moveforwardheadreset:
; reset head history pointer
lda #$a8
sta HEADHISTORYPOINTER
rts
MoveSnakeDown:
; load history pointer
ldx HEADHISTORYPOINTER
; snake head location is pushed up
lda SNAKEHEADLOCATION
clc
adc #$08
sta SNAKEHEADLOCATION
; storing snake head location in the head history pointer
sta #0,x
; alter the playfield to reflect the new snake head location
ldx ROWNUMBER
inx
lda ROWS,x ; loading row that needs to be altered
and COLUMNMASKINVERTED ; turning off bit in row to reflect new position
sta ROWS,x ; storing row
; store direction
lda HEADDIRECTION
sta STOREDDIRECTION
rts
MoveSnakeUp:
; load history pointer
ldx HEADHISTORYPOINTER
; snake head location is pushed up
lda SNAKEHEADLOCATION
sec
sbc #$08
clc
sta SNAKEHEADLOCATION
; storing snake head location in the head history pointer
sta #0,x
; alter the playfield to reflect the new snake head location
ldx ROWNUMBER
dex
lda ROWS,x ; loading row that needs to be altered
and COLUMNMASKINVERTED ; turning off bit in row to reflect new position
sta ROWS,x ; storing row
; store direction
lda HEADDIRECTION
sta STOREDDIRECTION
rts
MoveSnakeRight:
; load history pointer
ldx HEADHISTORYPOINTER
; snake head location is pushed right
lda SNAKEHEADLOCATION
clc
adc #$01
sta SNAKEHEADLOCATION
; storing snake head location in the head history pointer
sta #0,x
; alter the playfield to reflect the new snake head location
lda COLUMNMASKINVERTED
lsr
ora #%10000000
sta COLUMNMASKINVERTED
ldx ROWNUMBER
lda ROWS,x ; loading row that needs to be altered
and COLUMNMASKINVERTED ; turning off bit in row to reflect new position
sta ROWS,x ; storing row
; store direction
lda HEADDIRECTION
sta STOREDDIRECTION
rts
MoveSnakeLeft:
; load history pointer
ldx HEADHISTORYPOINTER
; snake head location is pushed left
lda SNAKEHEADLOCATION
sec
sbc #$01
clc
sta SNAKEHEADLOCATION
; storing snake head location in the head history pointer
sta #0,x
; alter the playfield to reflect the new snake head location
lda COLUMNMASKINVERTED
asl
ora #%00000001
sta COLUMNMASKINVERTED
ldx ROWNUMBER
lda ROWS,x ; loading row that needs to be altered
and COLUMNMASKINVERTED ; turning off bit in row to reflect new position
sta ROWS,x ; storing row
; store direction
lda HEADDIRECTION
sta STOREDDIRECTION
rts
IncrementOldSnakeTailPointer:
lda #$f7
cmp SNAKEOLDTAILPOINTER
beq resetoldsnaketailpointer
inc SNAKEOLDTAILPOINTER
rts
resetoldsnaketailpointer:
lda #$a8
sta SNAKEOLDTAILPOINTER
rts
removeoldsnaketail:
ldx ROWNUMBER
lda ROWS,x
ora COLUMNMASKINVERTED
sta ROWS,x
rts
GetRowAndColumnForTail:
ldx SNAKEOLDTAILPOINTER
lda #0,x ; loading tail playfield value
ldx #0
rowlooptail:
sec
sbc #$08
bmi columnlooptail
inx
jmp rowlooptail
columnlooptail:
clc
storerowtail:
stx ROWNUMBER
lda endofrownumber,x
ldx SNAKEOLDTAILPOINTER
sec
sbc #0,x ; loading tail playfield value
clc
tax
lda removetailmasklist,x
sta COLUMNMASK
lda columnmasklist,x
sta COLUMNMASKINVERTED
rowvarusedstoredtail:
clc
rts
PlaceAppleInPlayfield:
lda #$ff
cmp APPLELOCATION
beq processapple
jmp noprocessingneeded
processapple:
; use one of two random algorithms
; this accounts for random number generation's pseudo-random value
; thus improving apparent randomness
lda RANDOM
and #1
cmp #1
beq randomalgo2
randomalgo1:
; random number 1st variation
; get space available
sec
lda #SIZEOFMAP
sbc SNAKELENGTH
clc
; restrict random number to space available
and RANDOM
lsr
tay
jmp randomcontinue
randomalgo2:
; random number 2st variation
; get space available
sec
lda #SIZEOFMAP
sbc SNAKELENGTH
clc
; restrict random number to space available
and RANDOM
tay
randomcontinue:
; set y to 1 if y = 0, this prevents a register overflow
cpy #0
bne initrowloopapple
ldy #1
; loop through 10 columns of rows
; this is not very DRY code due to the need to keep this within cycle count restrictions
initrowloopapple:
ldx #0
rowloopapple:
lda ROWS,x
cmp #0
bne rowcol8
jmp rowloopcontinue
rowcol8:
ror
bcc rowcol7
dey
cpy #0
bne rowcol7
lda ROWS,x
and #%11111110
sta ROWS,x
lda #$07
jmp storeapplelocationloop
rowcol7:
ror
bcc rowcol6
dey
cpy #0
bne rowcol6
lda ROWS,x
and #%11111101
sta ROWS,x
lda #$06
jmp storeapplelocationloop
rowcol6:
ror
bcc rowcol5
dey
cpy #0
bne rowcol5
lda ROWS,x
and #%11111011
sta ROWS,x
lda #$05
jmp storeapplelocationloop
rowcol5:
ror
bcc rowcol4
dey
cpy #0
bne rowcol4
lda ROWS,x
and #%11110111
sta ROWS,x
lda #$04
jmp storeapplelocationloop
rowcol4:
ror
bcc rowcol3
dey
cpy #0
bne rowcol3
lda ROWS,x
and #%11101111
sta ROWS,x
lda #$03
jmp storeapplelocationloop
rowcol3:
ror
bcc rowcol2
dey
cpy #0
bne rowcol2
lda ROWS,x
and #%11011111
sta ROWS,x
lda #$02
jmp storeapplelocationloop
rowcol2:
ror
bcc rowcol1
dey
cpy #0
bne rowcol1
lda ROWS,x
and #%10111111
sta ROWS,x
lda #$01
jmp storeapplelocationloop
rowcol1:
ror
bcc rowloopcontinue
dey
cpy #0
bne rowloopcontinue
lda ROWS,x
and #%01111111
sta ROWS,x
lda #$00
jmp storeapplelocationloop
rowloopcontinue:
cpx #9
beq storeapplelocationloop
inx
jmp rowloopapple
storeapplelocationloop:
dex
cpx #$ff
beq finishappleplacement
clc
adc #$08
jmp storeapplelocationloop
finishappleplacement:
sta APPLELOCATION
noprocessingneeded:
rts
PrepSelectedGame:
lda SELECTEDGAMETYPE
cmp #0
beq prepselected0
cmp #1
beq prepselected1
cmp #2
beq prepselected2
jmp returnprepselectedgame
prepselected0:
lda #5
sta SELECTEDGAMETYPEOFFSET
jmp returnprepselectedgame
prepselected1:
lda #0
sta SELECTEDGAMETYPEOFFSET
jmp returnprepselectedgame
prepselected2:
lda #10
sta SELECTEDGAMETYPEOFFSET
returnprepselectedgame:
rts
PrepScore:
; left digit
lda SCORE
and #%11110000
lsr
lsr
lsr
lsr
; get offset of left digit
tax
lda #0
leftdigitloop:
cpx #0
beq storeleftdigitoffset
clc
adc #5
dex
jmp leftdigitloop
storeleftdigitoffset:
sta LEFTDIGITOFFSET
; right digit
lda SCORE
and #%00001111
; get offset of right digit
tax
lda #0
rightdigitloop:
cpx #0
beq storerightdigitoffset
clc
adc #5
dex
jmp rightdigitloop
storerightdigitoffset:
sta RIGHTDIGITOFFSET
rts
;---------------------------------------------------
;
; Data Tables
;
;---------------------------------------------------
digits:
; left and right digits are represented in each byte (4 bits per digit)
; zero
.byte %11100000
.byte %10100000
.byte %10100000
.byte %10100000
.byte %11100000
; one
.byte %10000000
.byte %10000000
.byte %10000000
.byte %10000000
.byte %10000000
; two
.byte %11100000
.byte %10000000
.byte %11100000
.byte %00100000
.byte %11100000
; three
.byte %11100000
.byte %10000000
.byte %11000000
.byte %10000000
.byte %11100000
; four
.byte %10100000
.byte %10100000
.byte %11100000
.byte %10000000
.byte %10000000
; five
.byte %11100000
.byte %00100000
.byte %11100000
.byte %10000000
.byte %11100000
; six
.byte %11100000
.byte %00100000
.byte %11100000
.byte %10100000
.byte %11100000
; seven
.byte %11100000
.byte %10000000
.byte %10000000
.byte %10000000
.byte %10000000
; eight
.byte %11100000
.byte %10100000
.byte %11100000
.byte %10100000
.byte %11100000
; nine
.byte %11100000
.byte %10100000
.byte %11100000
.byte %10000000
.byte %11100000
levelletter:
.byte #%00010000
.byte #%00010000
.byte #%00010000
.byte #%00010000
.byte #%11110000
leftPF2:
; Left PF2 (mirrored)
.byte %00000000
ds 15
.byte %11000000 ; %00010000
ds 15
.byte %00110000 ; %00100000
ds 15
.byte %11110000 ; %00110000
ds 15
.byte %00001100 ; %01000000
ds 15
.byte %11001100 ; %01010000
ds 15
.byte %00111100 ; %01100000
ds 15
.byte %11111100 ; %01110000
ds 15
.byte %00000011 ; %10000000
ds 15
.byte %11000011 ; %10010000
ds 15
.byte %00110011 ; %10100000
ds 15
.byte %11110011 ; %10110000
ds 15
.byte %00001111 ; %11000000
ds 15
.byte %11001111 ; %11010000
ds 15
.byte %00111111 ; %11100000
ds 15
.byte %11111111 ; %11110000
rightPF0:
; Right PF0
.byte %00000000
ds 3
.byte %11000000
ds 3
.byte %00110000
ds 3
.byte %11110000
rightPF1:
; Right PF1
.byte %00000000
.byte %00110000
.byte %11000000
.byte %11110000
endofrownumber:
.byte #$07
.byte #$0f
.byte #$17
.byte #$1f
.byte #$27
.byte #$2f
.byte #$37
.byte #$3f
.byte #$47
.byte #$4f
columnmasklist:
.byte #%00000001
.byte #%00000010
.byte #%00000100
.byte #%00001000
.byte #%00010000
.byte #%00100000
.byte #%01000000
.byte #%10000000
removetailmasklist:
.byte #%11111110
.byte #%11111101
.byte #%11111011
.byte #%11110111
.byte #%11101111
.byte #%11011111
.byte #%10111111
.byte #%01111111
snakecolors:
.byte #SNAKECOLORNORMAL
.byte #SNAKECOLORSLOW
.byte #SNAKECOLORFAST
snakespeed:
.byte #SPEEDNORMAL
.byte #SPEEDSLOW
.byte #SPEEDFAST
;---------------------------------------------------
;
; Setting Interrupt Vectors
;
;---------------------------------------------------
ORG $FFFA ; set address to 6507 Interrupt Vectors
.WORD InitSystem ; NMI
.WORD InitSystem ; RESET
.WORD InitSystem ; IRQ
|
oeis/139/A139217.asm | neoneye/loda-programs | 11 | 17443 | <filename>oeis/139/A139217.asm
; A139217: Smallest positive integer of the form 3k+1 such that all subsets of {a(1),...,a(n)} have a different sum.
; Submitted by <NAME>
; 1,4,7,13,22,49,97,190,385,769,1534,3073,6145,12286
sub $0,1
mov $1,$0
pow $0,2
mod $0,3
mov $2,$1
cmp $2,0
add $1,$2
mov $3,2
pow $3,$1
add $0,$3
mul $0,3
sub $0,2
|
Cubical/HITs/Ints/HAEquivInt/Base.agda | limemloh/cubical | 0 | 3784 | <gh_stars>0
{-# OPTIONS --cubical --safe #-}
module Cubical.HITs.Ints.HAEquivInt.Base where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HAEquiv
data HAEquivInt : Type₀ where
zero : HAEquivInt
suc : HAEquivInt -> HAEquivInt
-- suc is a HAEquiv:
pred : HAEquivInt -> HAEquivInt
suc-pred : ∀ z -> suc (pred z) ≡ z
pred-suc : ∀ z -> pred (suc z) ≡ z
coh : ∀ z → (λ i → suc (pred-suc z i)) ≡ suc-pred (suc z)
suc-haequiv : HAEquiv HAEquivInt HAEquivInt
suc-haequiv = suc , record { g = pred ; sec = pred-suc ; ret = suc-pred ; com = coh }
-- OPEN: prove HAEquivInt ≃ Int! See Experiments/HInt.agda
|
test/Succeed/Issue4044.agda | shlevy/agda | 1,989 | 11455 | <gh_stars>1000+
{-# OPTIONS --show-implicit #-}
open import Agda.Builtin.Nat
open import Agda.Builtin.Equality
open import Agda.Builtin.Unit
postulate
A B C D : Set
F : (A → A) → (A → A → A) → A
a : A
data Tree : Set where
leaf : Tree
node : (f : (x : A) → Tree) → Tree
tree1 : Nat → Tree
tree1 zero = leaf
tree1 (suc n) = node (λ x → tree1 n)
tree2 : Nat → Tree
tree2 zero = leaf
tree2 (suc n) = node (λ x → tree2 n)
-- In Agda 2.6.0.1, this takes >50 sec and >5GB to typecheck.
test : tree1 5000 ≡ tree2 5000
test = refl
|
AppleScript Database/DeleteDatabase.scpt | staypufd/AppleScripts | 0 | 2926 | tell application "Database Events"
launch
delete database "Super Heroes"
end tell
|
main.asm | vadixidav/minebos | 2 | 24324 | !src "header.asm"
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.init ;Init sequence; it is not a FORTH word
sei ;Disable interrupts while initializing
clc
xce
rep #$30
!al
!rl
;Enter short accumulator and long index register mode
rep #$10
sep #$20
!as
!rl
;Find end of memory and set the backstack pointer
;Start searching from the end of this code
;If memory ends before this code does then there are bigger problems
ldx #.codeEnd
-
;Branch to end if we reached address zero (it still works with 0)
beq + ;Zero flag set by inx and ldx before this instruction
lda 0,X ;Load byte to memory
inc ;Increment the value in A to get a unique value
sta 0,X ;Store it back
cmp 0,X ;See if the value changed when we stored it
bne + ;If they are not equal then this is not valid memory (which is the end)
dec ;Decrement the value in A to restore it
sta 0,X ;Restore old value
inx ;Increment X to go to the next spot
bra -
+
;Now X is equal to the first non-existent memory address
ldy #.systemBackStackEnd ;Load Y with the address after the system backstack
;Copy all of the bytes starting from the end of the backstack
-
;Move index registers back a byte
dey
dex
;Move the byte
lda 0,Y
sta 0,X
;Did we copy the last byte?
cpy #.systemBackStack
bne - ;If not, then go back
;Now that we are done, X is equal to the beginning of the backstack
stx ZP_BACKSTACK ;Store it to the ZP
rep #$30
!al
!rl
ldx #FORTH_LAST_KERNEL_WORD ;Get address of the last forth word
stx ZP_LASTWORD ;Store it to the ZP
;Link every system buffer into the new backstack
;Compute the difference from the beginning of each stack
lda ZP_BACKSTACK
sec
sbc #.systemBackStack
tay ;Transfer the difference to Y
;Add the amount to each name pointer
-
tya ;Transfer the difference back to A
clc
adc FORTH_WORDOFFSET_NAME,X ;Add the difference to the offset
sta FORTH_WORDOFFSET_NAME,X ;Store the new address back
;Since we cannot use X addressing modes when loading X, use A
lda FORTH_WORDOFFSET_LINK,X
tax
cpx #0
bne - ;So long as we arent at the last link continue
;Link in the input buffer
lda #.inputbuffer_off ;Load A with offset of input buffer
clc
adc ZP_BACKSTACK ;Add backstack pointer to offset
sta ZP_FORTH_TIB ;Store to ZP
;Link in the parse buffer
lda #.parsebuffer_off ;Load A with offset of parse buffer
clc
adc ZP_BACKSTACK ;Add backstack pointer to offset
sta ZP_FORTH_PARSEBUFFER ;Store to ZP
;Initialize POR
lda #.cold_def
mmu #MMU_POR_SETADDRESS
cli ;Allow interrupts because now POR works fine
;bra .cold ;Branch to the definition of cold (to skip header)
bra .test
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.cold ;COLD word - runs on power-on-reset
!16 0 ;Since this is the first word, it has the null-terminator in the linked list
!16 .cold_name
!16 (.cold_end - .cold_def)
.cold_def
rep #$30 ;If there is a power-on-reset then we need to ensure the mode
!al
!rl
;DEBUG: Initialize the redbus to use IOX on addr 3
lda #3
sta ZP_REDBUS_ID ;Store ID in use to ZP
mmu #MMU_REDBUS_SETID
lda #REDBUS_PAGE
mmu #MMU_REDBUS_SETPAGE
mmu #MMU_REDBUS_ENABLE
;Set IOX output to 9
lda #9
sta IOX_OUT
;Disable compile mode
lda #0
sta ZP_MODE_COMPILE
stp
.cold_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.begin ;begin a loop (:) - pushes address of the end of the dictionary onto rstack
!16 .cold
!16 .begin_name
!16 (.begin_end - .begin_def) | FORTH_WORDFLAG_IMMEDIATE
.begin_def
ldx ZP_FORTH_HERE ;Get HERE
rhx ;Push HERE to rstack
nxt
.begin_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.again ;end a loop (:) - compiles address from rstack into word definition
!16 .begin
!16 .again_name
!16 (.again_end - .again_def) | FORTH_WORDFLAG_IMMEDIATE
.again_def
ldx ZP_FORTH_HERE ;Get HERE
ldy #.again_does ;Load loop does
sty 0,X ;Add loop does to thread (POSTPONE)
inx
inx
rly ;Pull address from rstack
sty 0,X ;Place address HERE
inx
inx
stx ZP_FORTH_HERE ;Store new HERE back
nxt
.again_end
.again_does
tix ;Transfer pointer to loop thread beginning into X
ldy 0,X ;Load Y with thread beginning pointer
tyx ;Transfer thread beginning to X
txi ;Transfer thread beginning to I
nxt
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.bsalloc ;backstack allocate (num : addr) - allocates num bytes onto backstack and
;returns address to memory
!16 .again
!16 .bsalloc_name
!16 (.bsalloc_end - .bsalloc_def)
.bsalloc_def
pha ;Push A back to stack (it contained the amount of bytes)
lda ZP_BACKSTACK ;Load backstack pointer into A from ZP
sec
sbc 0,S ;Subtract amount of bytes from backstack pointer
sta ZP_BACKSTACK ;Store new backstack pointer to ZP
plx ;Remove amount of bytes from stack
;A (top of stack) now contains the address of the beginning of this memory
nxt
.bsalloc_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.bsfree ;backstack free (num :) - frees num bytes from backstack
!16 .bsalloc
!16 .bsfree_name
!16 (.bsfree_end - .bsfree_def)
.bsfree_def
clc
adc ZP_BACKSTACK ;Add backstack pointer to amount of bytes
sta ZP_BACKSTACK ;Store new backstack pointer
nxt
.bsfree_end
.test
stp;###################################################
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.parse ;parse string (delim "ccc<delim>" -- addr bytes) - parse characters from input
;until the delimiter is reached
!16 .bsfree
!16 .parse_name
!16 (.parse_end - .parse_def)
.parse_def
;Enter 8-bit accumulator mode
sep #$20
!as
;Copy string to buffer and stop at delim or max size; count kept in Y
ldy #0
-
cmp (ZP_FORTH_PARSELOC),Y ;Compare delim in A to character in buffer
beq + ;Branch to end if we reached the delimiter
cpy #FORTH_PARSE_SIZE ;Compare Y to the size of the parse area
beq + ;Branch to end if we reached buffer size limit as a precaution
tad ;Move A to D temporarily
lda (ZP_FORTH_PARSELOC),Y ;Load character from buffer
sta (ZP_FORTH_PARSEBUFFER),Y ;Store character into parse buffer
tda ;Move D back to A
iny ;Move to next character
bra - ;Do it again
+
;Exit 8-bit accumulator mode
rep #$20
!al
lda ZP_FORTH_PARSELOC ;Place parse location address into A
pha ;Push it onto stack
tya ;Y contains the amount of bytes so it should be moved to A
iny ;Move Y forward one byte to skip delim
sty ZP_FORTH_PARSELOC ;Store this location to the parse location
nxt
.parse_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.next ;next word () - moves to next FORTH word in a thread and leaves calling word
!16 .parse
!16 .next_name
!16 (.next_end - .next_def)
.next_def
rli ;Get I from rstack (before enter was called)
nxt ;Go to next word on the outside
.next_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.doconst ;push contant (: const) - loads an immediate constant onto stack
!16 .next
!16 .doconst_name
!16 (.doconst_end - .doconst_def)
.doconst_def
pha ;Push old A to stack
nxa ;Get constant
nxt
.doconst_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.fetch ;load variable (addr : data) - loads data at address addr and puts it on stack
!16 .doconst
!16 .fetch_name
!16 (.fetch_end - .fetch_def)
.fetch_def
tax
lda 0,X
nxt
.fetch_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.store ;store variable (data addr :) - stores data to address addr
!16 .fetch
!16 .store_name
!16 (.store_end - .store_def)
.store_def
tax
pla
sta 0,X
pla ;Get next thing off stack
nxt
.store_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.count ;count characters (addr1 : addr2 num) - retrieves string address (addr2) and
;number of characters (num) from counted string addr1
!16 .store
!16 .count_name
!16 (.count_end - .count_def)
.count_def
tax ;Move address into X
;Switch into 8-bit accum mode
sep #$20
!as
lda 0,X ;Get num into A
;Switch back to 16-bit accum mode
rep #$20
!al
inx ;Move X forward to point to string
phx ;Address is now on stack
nxt
.count_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.strcmp ;compare strings (addr1 n1 addr2 n2 : same?) - compares strings from addr1
;and addr2 using n1 and n2 as their respective lengths
!16 .count
!16 .strcmp_name
!16 (.strcmp_end - .strcmp_def)
.strcmp_def
;A already contains n2, the only amount we will use
plx ;Pull addr2 into X
;We must find the smaller of the two strings
cmp 0,S ;Compare A (n2) to n1 on stack
beq + ;Move to + if they are the same length
;Here the strings are not the same
pld ;Discard n1 from stack
pld ;Discard addr1 from stack
lda #0 ;Put false into A because they are not the same
nxt ;Go to the next word
+
pld ;Discard n1 from stack (it is the same as n2)
ply ;Pull addr1 into Y
;Begin string comparison
;Switch to 8-bit accumulator (for characters)
sep #$20
!as
;It is important to consider that A has changed to 8 bits
-
cmp #0
beq + ;If A is 0, there are no characters left to compare
tad ;Back up count into D
lda 0,X ;Load A with character from addr2
cmp 0,Y ;Compare A with character from addr1
beq ++ ;Branch to ++ to continue if the character is the same
;Switch to 16-bit before moving to next word
rep #$20
!al
lda #0 ;Character is not the same so return false
nxt ;Go to next word
++
!as ;At this location we are still in short mode, so inform the assembler
;Update all counters and addresses
inx
iny
dec A
bra - ;Do it again!
+
;Switch to 16-bit before returning
rep #$20
!al
lda #-1 ;Put all 1 into A to indicate success
nxt
.strcmp_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.find ;find word (delim : nameaddr 0 | token 1 | token -1)
!16 .strcmp
!16 .find_name
!16 (.find_end - .find_def)
.find_def
pha
lda #' ' ;Load space character as the delimiter
ent
!16 .parse
!16 + ;Place address after this as next word
+
rli ;Pull I from enter
nxt
.find_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.create ;create a new word definition
!16 .find
!16 .create_name
!16 (.create_end - .create_def)
.create_def
nxt
.create_end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
.tmpend ;marks end of system dictionary - only for testing purposes!
!16 .create
!16 .tmpend_name
!16 (.tmpend_end - .tmpend_def)
.tmpend_def
;You can call this, but you will be disappointed because it does nothing
nxt
.tmpend_end
.systemBackStack
.tmpend_name !raw 6, "TMPEND"
.create_name !raw 6, "CREATE"
.find_name !raw 4, "FIND"
.strcmp_name !raw 6, "STRCMP"
.count_name !raw 5, "COUNT"
.store_name !raw 1, "!"
.fetch_name !raw 1, "@"
.doconst_name !raw 7, "DOCONST"
.next_name !raw 4, "NEXT"
.inputbuffer_off !fill FORTH_INPUTBUFFER_SIZE
.parsebuffer_off !fill FORTH_PARSE_SIZE
.parse_name !raw 5, "PARSE"
.bsfree_name !raw 6, "BSFREE"
.bsalloc_name !raw 7, "BSALLOC"
.again_name !raw 5, "AGAIN"
.begin_name !raw 5, "BEGIN"
.cold_name !raw 4, "COLD"
.systemBackStackEnd
!src "footer.asm" |
arch/ARM/STM32/svd/stm32wl5x_cm4/stm32_svd-rng.ads | morbos/Ada_Drivers_Library | 2 | 23229 | <reponame>morbos/Ada_Drivers_Library<gh_stars>1-10
-- This spec has been automatically generated from STM32WL5x_CM4.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.RNG is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_RNG_CONFIG3_Field is HAL.UInt4;
subtype CR_RNG_CONFIG2_Field is HAL.UInt3;
subtype CR_CLKDIV_Field is HAL.UInt4;
subtype CR_RNG_CONFIG1_Field is HAL.UInt6;
-- control register
type CR_Register is record
-- unspecified
Reserved_0_1 : HAL.UInt2 := 16#0#;
-- True random number generator enable
RNGEN : Boolean := False;
-- Interrupt Enable
IE : Boolean := False;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Interrupt Enable
CED : Boolean := False;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- RNG_CONFIG3
RNG_CONFIG3 : CR_RNG_CONFIG3_Field := 16#0#;
-- NISTC
NISTC : Boolean := False;
-- RNG_CONFIG2
RNG_CONFIG2 : CR_RNG_CONFIG2_Field := 16#0#;
-- CLKDIV
CLKDIV : CR_CLKDIV_Field := 16#0#;
-- RNG_CONFIG1
RNG_CONFIG1 : CR_RNG_CONFIG1_Field := 16#8#;
-- unspecified
Reserved_26_29 : HAL.UInt4 := 16#0#;
-- Conditioning soft reset
CONDRST : Boolean := False;
-- CONFIGLOCK
CONFIGLOCK : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
Reserved_0_1 at 0 range 0 .. 1;
RNGEN at 0 range 2 .. 2;
IE at 0 range 3 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
CED at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
RNG_CONFIG3 at 0 range 8 .. 11;
NISTC at 0 range 12 .. 12;
RNG_CONFIG2 at 0 range 13 .. 15;
CLKDIV at 0 range 16 .. 19;
RNG_CONFIG1 at 0 range 20 .. 25;
Reserved_26_29 at 0 range 26 .. 29;
CONDRST at 0 range 30 .. 30;
CONFIGLOCK at 0 range 31 .. 31;
end record;
-- status register
type SR_Register is record
-- Read-only. Data Ready
DRDY : Boolean := False;
-- Read-only. Clock error current status
CECS : Boolean := False;
-- Read-only. Seed error current status
SECS : Boolean := False;
-- unspecified
Reserved_3_4 : HAL.UInt2 := 16#0#;
-- Clock error interrupt status
CEIS : Boolean := False;
-- Seed error interrupt status
SEIS : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
DRDY at 0 range 0 .. 0;
CECS at 0 range 1 .. 1;
SECS at 0 range 2 .. 2;
Reserved_3_4 at 0 range 3 .. 4;
CEIS at 0 range 5 .. 5;
SEIS at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- True random number generator
type RNG_Peripheral is record
-- control register
CR : aliased CR_Register;
-- status register
SR : aliased SR_Register;
-- data register
DR : aliased HAL.UInt32;
-- health test control register
HTCR : aliased HAL.UInt32;
end record
with Volatile;
for RNG_Peripheral use record
CR at 16#0# range 0 .. 31;
SR at 16#4# range 0 .. 31;
DR at 16#8# range 0 .. 31;
HTCR at 16#10# range 0 .. 31;
end record;
-- True random number generator
RNG_Periph : aliased RNG_Peripheral
with Import, Address => RNG_Base;
end STM32_SVD.RNG;
|
testsuite/tests/NA17-007__Ada_units/gnat95_config/pck.ads | AdaCore/style_checker | 2 | 19717 | <gh_stars>1-10
--
-- Intentionally not providing a Copyright header to verify that
-- having -copyright in the config for our module does indeed turn
-- this check off.
--
package Pck is
end Pck;
|
alloy4fun_models/trashltl/models/9/sDTGqACYWMcwiBASJ.als | Kaixi26/org.alloytools.alloy | 0 | 1732 | <filename>alloy4fun_models/trashltl/models/9/sDTGqACYWMcwiBASJ.als
open main
pred idsDTGqACYWMcwiBASJ_prop10 {
always all p: File | once p in Protected implies always p in Protected
}
pred __repair { idsDTGqACYWMcwiBASJ_prop10 }
check __repair { idsDTGqACYWMcwiBASJ_prop10 <=> prop10o } |
Transynther/x86/_processed/NONE/_xt_/i7-8650U_0xd2_notsx.log_21829_240.asm | ljhsiun2/medusa | 9 | 176314 | <gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r13
push %r15
push %r9
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x88c3, %rsi
lea addresses_WC_ht+0x170c3, %rdi
cmp %rbx, %rbx
mov $61, %rcx
rep movsq
nop
nop
nop
nop
nop
and %r13, %r13
lea addresses_WT_ht+0x50c3, %r9
cmp $42926, %rax
mov $0x6162636465666768, %rdi
movq %rdi, %xmm2
movups %xmm2, (%r9)
nop
nop
nop
nop
nop
cmp %r13, %r13
lea addresses_normal_ht+0xd0c3, %rdi
dec %r13
and $0xffffffffffffffc0, %rdi
movntdqa (%rdi), %xmm0
vpextrq $0, %xmm0, %rsi
nop
add $18432, %rbx
lea addresses_normal_ht+0x18ec3, %rcx
nop
nop
nop
and %rbx, %rbx
movb (%rcx), %r9b
nop
sub %r9, %r9
lea addresses_WT_ht+0x18fc3, %rdi
nop
nop
nop
nop
xor %rcx, %rcx
mov $0x6162636465666768, %r9
movq %r9, (%rdi)
nop
nop
and %rsi, %rsi
lea addresses_WT_ht+0xb04b, %rdi
nop
nop
sub $50277, %rbx
vmovups (%rdi), %ymm5
vextracti128 $0, %ymm5, %xmm5
vpextrq $0, %xmm5, %rax
nop
nop
nop
cmp $48647, %r9
lea addresses_WT_ht+0x10cc3, %rsi
lea addresses_UC_ht+0x419b, %rdi
inc %r15
mov $49, %rcx
rep movsw
nop
nop
nop
nop
nop
cmp $33417, %rsi
lea addresses_D_ht+0x1c543, %rsi
lea addresses_A_ht+0x6883, %rdi
clflush (%rdi)
nop
nop
nop
nop
nop
xor $12617, %rbx
mov $101, %rcx
rep movsb
sub %rax, %rax
lea addresses_A_ht+0xbcc3, %r15
inc %rax
movups (%r15), %xmm4
vpextrq $1, %xmm4, %rbx
nop
nop
nop
nop
sub $48395, %r13
lea addresses_normal_ht+0x1ece2, %r15
nop
nop
nop
xor $17618, %r9
mov $0x6162636465666768, %rcx
movq %rcx, (%r15)
nop
nop
nop
nop
nop
sub %rcx, %rcx
lea addresses_WC_ht+0x1e0c3, %rbx
nop
nop
cmp %r9, %r9
mov $0x6162636465666768, %rdi
movq %rdi, %xmm0
and $0xffffffffffffffc0, %rbx
vmovaps %ymm0, (%rbx)
nop
sub $62643, %rbx
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rax
pop %r9
pop %r15
pop %r13
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r15
push %r8
push %rbp
push %rdi
push %rsi
// Faulty Load
lea addresses_A+0x40c3, %rdi
nop
nop
nop
and $31094, %rsi
vmovups (%rdi), %ymm4
vextracti128 $1, %ymm4, %xmm4
vpextrq $1, %xmm4, %r8
lea oracles, %rbp
and $0xff, %r8
shlq $12, %r8
mov (%rbp,%r8,1), %r8
pop %rsi
pop %rdi
pop %rbp
pop %r8
pop %r15
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_A', 'size': 2, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_A', 'size': 32, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'type': 'addresses_A_ht', 'congruent': 8, 'same': False}, 'dst': {'type': 'addresses_WC_ht', 'congruent': 8, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WT_ht', 'size': 16, 'AVXalign': False, 'NT': False, 'congruent': 10, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_normal_ht', 'size': 16, 'AVXalign': False, 'NT': True, 'congruent': 11, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_normal_ht', 'size': 1, 'AVXalign': False, 'NT': False, 'congruent': 9, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WT_ht', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 6, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WT_ht', 'size': 32, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WT_ht', 'congruent': 10, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 2, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_D_ht', 'congruent': 7, 'same': False}, 'dst': {'type': 'addresses_A_ht', 'congruent': 6, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_A_ht', 'size': 16, 'AVXalign': False, 'NT': False, 'congruent': 10, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_normal_ht', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WC_ht', 'size': 32, 'AVXalign': True, 'NT': False, 'congruent': 10, 'same': False}}
{'35': 21829}
35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35 35
*/
|
src/log_filter_main.adb | Lyaaaaaaaaaaaaaaa/Lyaaaaa-s-Log-Filters | 1 | 10895 | <filename>src/log_filter_main.adb
----------------------------------------------------------
-- Copyright (c), The MIT License (MIT)
-- Author: Lyaaaaaaaaaaaaaaa
--
-- Revision History:
-- 18/09/2019 Lyaaaaaaaaaaaaaaa
-- - Added file header
----------------------------------------------------------
with Log_Filter_Handlers;
procedure Log_Filter_Main is
begin
Log_Filter_Handlers.Init; -- Start Gtkada and create objects.
Log_Filter_Handlers.Connect_Interface; -- Load interface and links objects.
Log_Filter_Handlers.Register_Handlers; -- Links signals and handlers.
Log_Filter_Handlers.Start_Interface; -- Display the main window.
null;
end Log_Filter_Main;
|
oeis/333/A333937.asm | neoneye/loda-programs | 11 | 168418 | <reponame>neoneye/loda-programs<gh_stars>10-100
; A333937: Triangle read by rows: T(n, k) = (k-1)*n - binomial(n, 2) + floor((n-k)/2) + 1, transposed.
; Submitted by <NAME>
; 1,1,2,2,3,4,2,5,6,7,3,6,9,10,11,3,8,11,14,15,16,4,9,14,17,20,21,22,4,11,16,21,24,27,28,29,5,12,19,24,29,32,35,36,37,5,14,21,28,33,38,41,44,45,46,6,15,24,31,38,43,48,51,54,55,56,6,17,26,35,42,49,54,59,62,65,66,67
mov $3,1
lpb $0
mov $2,$3
add $3,1
add $2,$3
sub $2,$0
add $2,1
mul $2,$0
trn $0,$3
sub $2,$3
lpe
mov $0,$2
div $0,2
add $0,1
|
target/analysis/Func0040289C.asm | katahiromz/DecodersTatami | 3 | 82362 | <filename>target/analysis/Func0040289C.asm
proc imp.msvcrt.dll!malloc Label_0040289C
attrs [[jumponly]]
# call_from : 004014C0
Label_0040289C:
0040289C: FF 25 EC 61 40 00 : jmp dword [0x4061ec]
end proc
|
programs/oeis/165/A165828.asm | neoneye/loda | 22 | 91253 | <reponame>neoneye/loda
; A165828: Totally multiplicative sequence with a(p) = 7.
; 1,7,7,49,7,49,7,343,49,49,7,343,7,49,49,2401,7,343,7,343,49,49,7,2401,49,49,343,343,7,343,7,16807,49,49,49,2401,7,49,49,2401,7,343,7,343,343,49,7,16807,49,343,49,343,7,2401,49,2401,49,49,7,2401,7,49,343,117649,49,343,7,343,49,343,7,16807,7,49,343,343,49,343,7,16807,2401,49,7,2401,49,49,49,2401,7,2401,49,343,49,49,49,117649,7,343,343,2401
seq $0,1222 ; Number of prime divisors of n counted with multiplicity (also called bigomega(n) or Omega(n)).
mov $1,7
pow $1,$0
mov $0,$1
|
alloy4fun_models/trashltl/models/4/C76BoKczxhwFPgpkj.als | Kaixi26/org.alloytools.alloy | 0 | 2706 | <gh_stars>0
open main
pred idC76BoKczxhwFPgpkj_prop5 {
some File eventually some Trash
}
pred __repair { idC76BoKczxhwFPgpkj_prop5 }
check __repair { idC76BoKczxhwFPgpkj_prop5 <=> prop5o } |
platforms/m3/prc_v12/software/PRCv12_FLSv1L_simple_wakeup_sleep/PRCv12_FLSv1L_simple_wakeup_sleep.asm | lab11/M-ulator | 19 | 161615 | <gh_stars>10-100
PRCv12_FLSv1L_simple_wakeup_sleep/PRCv12_FLSv1L_simple_wakeup_sleep.elf: file format elf32-littlearm
Disassembly of section .text:
00000000 <hang-0x80>:
0: 00002000 .word 0x00002000
4: 00000091 .word 0x00000091
...
1c: 00000080 .word 0x00000080
20: 00000080 .word 0x00000080
24: 00000080 .word 0x00000080
28: 00000080 .word 0x00000080
...
34: 00000080 .word 0x00000080
...
40: 00000189 .word 0x00000189
44: 00000195 .word 0x00000195
48: 000001a1 .word 0x000001a1
4c: 000001ad .word 0x000001ad
50: 000001b9 .word 0x000001b9
54: 000001c5 .word 0x000001c5
58: 000001d1 .word 0x000001d1
5c: 000001dd .word 0x000001dd
60: 000001e9 .word 0x000001e9
64: 000001f9 .word 0x000001f9
68: 00000209 .word 0x00000209
6c: 00000219 .word 0x00000219
70: 00000229 .word 0x00000229
74: 00000239 .word 0x00000239
78: 00000249 .word 0x00000249
7c: 00000000 .word 0x00000000
00000080 <hang>:
80: e7fe b.n 80 <hang>
...
00000090 <_start>:
90: f000 f906 bl 2a0 <main>
94: e7fc b.n 90 <_start>
Disassembly of section .text.delay:
00000096 <delay>:
96: b500 push {lr}
98: 2300 movs r3, #0
9a: e001 b.n a0 <delay+0xa>
9c: 46c0 nop ; (mov r8, r8)
9e: 3301 adds r3, #1
a0: 4283 cmp r3, r0
a2: d1fb bne.n 9c <delay+0x6>
a4: bd00 pop {pc}
Disassembly of section .text.write_regfile:
000000a8 <write_regfile>:
a8: 0880 lsrs r0, r0, #2
aa: 0209 lsls r1, r1, #8
ac: b508 push {r3, lr}
ae: 0a09 lsrs r1, r1, #8
b0: 4b05 ldr r3, [pc, #20] ; (c8 <write_regfile+0x20>)
b2: 0600 lsls r0, r0, #24
b4: 4308 orrs r0, r1
b6: 6018 str r0, [r3, #0]
b8: 4b04 ldr r3, [pc, #16] ; (cc <write_regfile+0x24>)
ba: 2210 movs r2, #16
bc: 601a str r2, [r3, #0]
be: 200a movs r0, #10
c0: f7ff ffe9 bl 96 <delay>
c4: bd08 pop {r3, pc}
c6: 46c0 nop ; (mov r8, r8)
c8: a0002000 .word 0xa0002000
cc: a000200c .word 0xa000200c
Disassembly of section .text.set_wakeup_timer:
000000d0 <set_wakeup_timer>:
d0: b510 push {r4, lr}
d2: 1c14 adds r4, r2, #0
d4: 2900 cmp r1, #0
d6: d003 beq.n e0 <set_wakeup_timer+0x10>
d8: 2180 movs r1, #128 ; 0x80
da: 0209 lsls r1, r1, #8
dc: 4301 orrs r1, r0
de: e001 b.n e4 <set_wakeup_timer+0x14>
e0: 0440 lsls r0, r0, #17
e2: 0c41 lsrs r1, r0, #17
e4: 4804 ldr r0, [pc, #16] ; (f8 <set_wakeup_timer+0x28>)
e6: f7ff ffdf bl a8 <write_regfile>
ea: 2c00 cmp r4, #0
ec: d002 beq.n f4 <set_wakeup_timer+0x24>
ee: 4b03 ldr r3, [pc, #12] ; (fc <set_wakeup_timer+0x2c>)
f0: 2201 movs r2, #1
f2: 601a str r2, [r3, #0]
f4: bd10 pop {r4, pc}
f6: 46c0 nop ; (mov r8, r8)
f8: a0000034 .word 0xa0000034
fc: a0001300 .word 0xa0001300
Disassembly of section .text.set_halt_until_mbus_rx:
00000100 <set_halt_until_mbus_rx>:
100: 4805 ldr r0, [pc, #20] ; (118 <set_halt_until_mbus_rx+0x18>)
102: b508 push {r3, lr}
104: 6801 ldr r1, [r0, #0]
106: 4b05 ldr r3, [pc, #20] ; (11c <set_halt_until_mbus_rx+0x1c>)
108: 4019 ands r1, r3
10a: 2390 movs r3, #144 ; 0x90
10c: 021b lsls r3, r3, #8
10e: 4319 orrs r1, r3
110: f7ff ffca bl a8 <write_regfile>
114: bd08 pop {r3, pc}
116: 46c0 nop ; (mov r8, r8)
118: a0000028 .word 0xa0000028
11c: ffff0fff .word 0xffff0fff
Disassembly of section .text.set_halt_until_mbus_tx:
00000120 <set_halt_until_mbus_tx>:
120: 4805 ldr r0, [pc, #20] ; (138 <set_halt_until_mbus_tx+0x18>)
122: b508 push {r3, lr}
124: 6801 ldr r1, [r0, #0]
126: 4b05 ldr r3, [pc, #20] ; (13c <set_halt_until_mbus_tx+0x1c>)
128: 4019 ands r1, r3
12a: 23a0 movs r3, #160 ; 0xa0
12c: 021b lsls r3, r3, #8
12e: 4319 orrs r1, r3
130: f7ff ffba bl a8 <write_regfile>
134: bd08 pop {r3, pc}
136: 46c0 nop ; (mov r8, r8)
138: a0000028 .word 0xa0000028
13c: ffff0fff .word 0xffff0fff
Disassembly of section .text.mbus_write_message32:
00000140 <mbus_write_message32>:
140: 4b02 ldr r3, [pc, #8] ; (14c <mbus_write_message32+0xc>)
142: 0100 lsls r0, r0, #4
144: 4318 orrs r0, r3
146: 6001 str r1, [r0, #0]
148: 2001 movs r0, #1
14a: 4770 bx lr
14c: a0003000 .word 0xa0003000
Disassembly of section .text.mbus_enumerate:
00000150 <mbus_enumerate>:
150: 0603 lsls r3, r0, #24
152: 2080 movs r0, #128 ; 0x80
154: 0580 lsls r0, r0, #22
156: 4318 orrs r0, r3
158: 4b01 ldr r3, [pc, #4] ; (160 <mbus_enumerate+0x10>)
15a: 6018 str r0, [r3, #0]
15c: 4770 bx lr
15e: 46c0 nop ; (mov r8, r8)
160: a0003000 .word 0xa0003000
Disassembly of section .text.mbus_sleep_all:
00000164 <mbus_sleep_all>:
164: 4b01 ldr r3, [pc, #4] ; (16c <mbus_sleep_all+0x8>)
166: 2200 movs r2, #0
168: 601a str r2, [r3, #0]
16a: 4770 bx lr
16c: a0003010 .word 0xa0003010
Disassembly of section .text.init_interrupt:
00000170 <init_interrupt>:
170: 4b02 ldr r3, [pc, #8] ; (17c <init_interrupt+0xc>)
172: 4a03 ldr r2, [pc, #12] ; (180 <init_interrupt+0x10>)
174: 6013 str r3, [r2, #0]
176: 4a03 ldr r2, [pc, #12] ; (184 <init_interrupt+0x14>)
178: 6013 str r3, [r2, #0]
17a: 4770 bx lr
17c: 00007fff .word 0x00007fff
180: e000e280 .word 0xe000e280
184: e000e100 .word 0xe000e100
Disassembly of section .text.handler_ext_int_0:
00000188 <handler_ext_int_0>:
188: 4b01 ldr r3, [pc, #4] ; (190 <handler_ext_int_0+0x8>)
18a: 2201 movs r2, #1
18c: 601a str r2, [r3, #0]
18e: 4770 bx lr
190: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_1:
00000194 <handler_ext_int_1>:
194: 4b01 ldr r3, [pc, #4] ; (19c <handler_ext_int_1+0x8>)
196: 2202 movs r2, #2
198: 601a str r2, [r3, #0]
19a: 4770 bx lr
19c: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_2:
000001a0 <handler_ext_int_2>:
1a0: 4b01 ldr r3, [pc, #4] ; (1a8 <handler_ext_int_2+0x8>)
1a2: 2204 movs r2, #4
1a4: 601a str r2, [r3, #0]
1a6: 4770 bx lr
1a8: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_3:
000001ac <handler_ext_int_3>:
1ac: 4b01 ldr r3, [pc, #4] ; (1b4 <handler_ext_int_3+0x8>)
1ae: 2208 movs r2, #8
1b0: 601a str r2, [r3, #0]
1b2: 4770 bx lr
1b4: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_4:
000001b8 <handler_ext_int_4>:
1b8: 4b01 ldr r3, [pc, #4] ; (1c0 <handler_ext_int_4+0x8>)
1ba: 2210 movs r2, #16
1bc: 601a str r2, [r3, #0]
1be: 4770 bx lr
1c0: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_5:
000001c4 <handler_ext_int_5>:
1c4: 4b01 ldr r3, [pc, #4] ; (1cc <handler_ext_int_5+0x8>)
1c6: 2220 movs r2, #32
1c8: 601a str r2, [r3, #0]
1ca: 4770 bx lr
1cc: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_6:
000001d0 <handler_ext_int_6>:
1d0: 4b01 ldr r3, [pc, #4] ; (1d8 <handler_ext_int_6+0x8>)
1d2: 2240 movs r2, #64 ; 0x40
1d4: 601a str r2, [r3, #0]
1d6: 4770 bx lr
1d8: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_7:
000001dc <handler_ext_int_7>:
1dc: 4b01 ldr r3, [pc, #4] ; (1e4 <handler_ext_int_7+0x8>)
1de: 2280 movs r2, #128 ; 0x80
1e0: 601a str r2, [r3, #0]
1e2: 4770 bx lr
1e4: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_8:
000001e8 <handler_ext_int_8>:
1e8: 4b02 ldr r3, [pc, #8] ; (1f4 <handler_ext_int_8+0xc>)
1ea: 2280 movs r2, #128 ; 0x80
1ec: 0052 lsls r2, r2, #1
1ee: 601a str r2, [r3, #0]
1f0: 4770 bx lr
1f2: 46c0 nop ; (mov r8, r8)
1f4: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_9:
000001f8 <handler_ext_int_9>:
1f8: 4b02 ldr r3, [pc, #8] ; (204 <handler_ext_int_9+0xc>)
1fa: 2280 movs r2, #128 ; 0x80
1fc: 0092 lsls r2, r2, #2
1fe: 601a str r2, [r3, #0]
200: 4770 bx lr
202: 46c0 nop ; (mov r8, r8)
204: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_10:
00000208 <handler_ext_int_10>:
208: 4b02 ldr r3, [pc, #8] ; (214 <handler_ext_int_10+0xc>)
20a: 2280 movs r2, #128 ; 0x80
20c: 00d2 lsls r2, r2, #3
20e: 601a str r2, [r3, #0]
210: 4770 bx lr
212: 46c0 nop ; (mov r8, r8)
214: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_11:
00000218 <handler_ext_int_11>:
218: 4b02 ldr r3, [pc, #8] ; (224 <handler_ext_int_11+0xc>)
21a: 2280 movs r2, #128 ; 0x80
21c: 0112 lsls r2, r2, #4
21e: 601a str r2, [r3, #0]
220: 4770 bx lr
222: 46c0 nop ; (mov r8, r8)
224: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_12:
00000228 <handler_ext_int_12>:
228: 4b02 ldr r3, [pc, #8] ; (234 <handler_ext_int_12+0xc>)
22a: 2280 movs r2, #128 ; 0x80
22c: 0152 lsls r2, r2, #5
22e: 601a str r2, [r3, #0]
230: 4770 bx lr
232: 46c0 nop ; (mov r8, r8)
234: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_13:
00000238 <handler_ext_int_13>:
238: 4b02 ldr r3, [pc, #8] ; (244 <handler_ext_int_13+0xc>)
23a: 2280 movs r2, #128 ; 0x80
23c: 0192 lsls r2, r2, #6
23e: 601a str r2, [r3, #0]
240: 4770 bx lr
242: 46c0 nop ; (mov r8, r8)
244: e000e280 .word 0xe000e280
Disassembly of section .text.handler_ext_int_14:
00000248 <handler_ext_int_14>:
248: 4b02 ldr r3, [pc, #8] ; (254 <handler_ext_int_14+0xc>)
24a: 2280 movs r2, #128 ; 0x80
24c: 01d2 lsls r2, r2, #7
24e: 601a str r2, [r3, #0]
250: 4770 bx lr
252: 46c0 nop ; (mov r8, r8)
254: e000e280 .word 0xe000e280
Disassembly of section .text.initialization:
00000258 <initialization>:
258: b508 push {r3, lr}
25a: 4a0b ldr r2, [pc, #44] ; (288 <initialization+0x30>)
25c: 4b0b ldr r3, [pc, #44] ; (28c <initialization+0x34>)
25e: 480c ldr r0, [pc, #48] ; (290 <initialization+0x38>)
260: 601a str r2, [r3, #0]
262: 4b0c ldr r3, [pc, #48] ; (294 <initialization+0x3c>)
264: 2200 movs r2, #0
266: 490c ldr r1, [pc, #48] ; (298 <initialization+0x40>)
268: 601a str r2, [r3, #0]
26a: f7ff ff1d bl a8 <write_regfile>
26e: 490b ldr r1, [pc, #44] ; (29c <initialization+0x44>)
270: 20aa movs r0, #170 ; 0xaa
272: f7ff ff65 bl 140 <mbus_write_message32>
276: f7ff ff43 bl 100 <set_halt_until_mbus_rx>
27a: 2004 movs r0, #4
27c: f7ff ff68 bl 150 <mbus_enumerate>
280: f7ff ff4e bl 120 <set_halt_until_mbus_tx>
284: bd08 pop {r3, pc}
286: 46c0 nop ; (mov r8, r8)
288: deadbeef .word 0xdeadbeef
28c: 00000324 .word 0x00000324
290: a0000020 .word 0xa0000020
294: 00000328 .word 0x00000328
298: 0000dead .word 0x0000dead
29c: aaaaaaaa .word 0xaaaaaaaa
Disassembly of section .text.startup.main:
000002a0 <main>:
2a0: b510 push {r4, lr}
2a2: f7ff ff65 bl 170 <init_interrupt>
2a6: 20a0 movs r0, #160 ; 0xa0
2a8: 0600 lsls r0, r0, #24
2aa: 6802 ldr r2, [r0, #0]
2ac: 4b18 ldr r3, [pc, #96] ; (310 <main+0x70>)
2ae: 429a cmp r2, r3
2b0: d108 bne.n 2c4 <main+0x24>
2b2: 2100 movs r1, #0
2b4: f7ff fef8 bl a8 <write_regfile>
2b8: 2101 movs r1, #1
2ba: 2005 movs r0, #5
2bc: 1c0a adds r2, r1, #0
2be: f7ff ff07 bl d0 <set_wakeup_timer>
2c2: e7fe b.n 2c2 <main+0x22>
2c4: 4b13 ldr r3, [pc, #76] ; (314 <main+0x74>)
2c6: 681a ldr r2, [r3, #0]
2c8: 4b13 ldr r3, [pc, #76] ; (318 <main+0x78>)
2ca: 429a cmp r2, r3
2cc: d001 beq.n 2d2 <main+0x32>
2ce: f7ff ffc3 bl 258 <initialization>
2d2: 4c12 ldr r4, [pc, #72] ; (31c <main+0x7c>)
2d4: 20cc movs r0, #204 ; 0xcc
2d6: 6821 ldr r1, [r4, #0]
2d8: f7ff ff32 bl 140 <mbus_write_message32>
2dc: 6823 ldr r3, [r4, #0]
2de: 2b0a cmp r3, #10
2e0: d10b bne.n 2fa <main+0x5a>
2e2: 490f ldr r1, [pc, #60] ; (320 <main+0x80>)
2e4: 20cc movs r0, #204 ; 0xcc
2e6: f7ff ff2b bl 140 <mbus_write_message32>
2ea: 2000 movs r0, #0
2ec: 1c01 adds r1, r0, #0
2ee: 2201 movs r2, #1
2f0: f7ff feee bl d0 <set_wakeup_timer>
2f4: f7ff ff36 bl 164 <mbus_sleep_all>
2f8: e7fe b.n 2f8 <main+0x58>
2fa: 6823 ldr r3, [r4, #0]
2fc: 2101 movs r1, #1
2fe: 3301 adds r3, #1
300: 2005 movs r0, #5
302: 1c0a adds r2, r1, #0
304: 6023 str r3, [r4, #0]
306: f7ff fee3 bl d0 <set_wakeup_timer>
30a: f7ff ff2b bl 164 <mbus_sleep_all>
30e: e7fe b.n 30e <main+0x6e>
310: 00b0c3cb .word 0x00b0c3cb
314: 00000324 .word 0x00000324
318: deadbeef .word 0xdeadbeef
31c: 00000328 .word 0x00000328
320: 0ea7f00d .word 0x0ea7f00d
|
programs/oeis/255/A255743.asm | karttu/loda | 0 | 85970 | ; A255743: a(1) = 1; for n > 1, a(n) = 9*8^{A000120(n-1)-1}.
; 1,9,9,72,9,72,72,576,9,72,72,576,72,576,576,4608,9,72,72,576,72,576,576,4608,72,576,576,4608,576,4608,4608,36864,9,72,72,576,72,576,576,4608,72,576,576,4608,576,4608,4608,36864,72,576,576,4608,576,4608,4608,36864,576,4608,4608,36864,4608,36864,36864,294912,9,72,72,576,72,576,576,4608,72,576,576,4608,576,4608,4608,36864,72,576,576,4608,576,4608,4608,36864,576,4608,4608,36864,4608,36864,36864,294912,72,576,576,4608,576,4608,4608,36864,576,4608,4608,36864,4608,36864,36864,294912,576,4608,4608,36864,4608,36864,36864,294912,4608,36864,36864,294912,36864,294912,294912,2359296,9,72,72,576,72,576,576,4608,72,576,576,4608,576,4608,4608,36864,72,576,576,4608,576,4608,4608,36864,576,4608,4608,36864,4608,36864,36864,294912,72,576,576,4608,576,4608,4608,36864,576,4608,4608,36864,4608,36864,36864,294912,576,4608,4608,36864,4608,36864,36864,294912,4608,36864,36864,294912,36864,294912,294912,2359296,72,576,576,4608,576,4608,4608,36864,576,4608,4608,36864,4608,36864,36864,294912,576,4608,4608,36864,4608,36864,36864,294912,4608,36864,36864,294912,36864,294912,294912,2359296,576,4608,4608,36864,4608,36864,36864,294912,4608,36864,36864,294912,36864,294912,294912,2359296,4608,36864,36864,294912,36864,294912,294912,2359296,36864,294912
mov $8,$0
mov $10,2
lpb $10,1
clr $0,8
mov $0,$8
sub $10,1
add $0,$10
sub $0,1
mov $5,$0
mov $7,$0
lpb $7,1
mov $0,$5
sub $7,1
sub $0,$7
mul $0,2
mov $3,$0
lpb $0,1
div $3,2
sub $0,$3
mov $4,8
lpe
pow $4,$0
add $6,$4
lpe
mov $1,$6
div $1,8
mul $1,9
add $1,1
mov $11,$10
lpb $11,1
mov $9,$1
sub $11,1
lpe
lpe
lpb $8,1
mov $8,0
sub $9,$1
lpe
mov $1,$9
|
source/amf/uml/amf-visitors-generic_uml_containment.adb | svn2github/matreshka | 24 | 22363 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.UML.Elements.Collections;
package body AMF.Visitors.Generic_UML_Containment is
procedure Visit_Owned_Elements
(Self : in out UML_Containment_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null access AMF.UML.Elements.UML_Element'Class;
Control : in out Traverse_Control);
-- Visit members of ownedElement of the element.
-----------------------
-- Visit_Abstraction --
-----------------------
overriding procedure Visit_Abstraction
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Abstractions.UML_Abstraction_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Abstraction;
------------------------------
-- Visit_Accept_Call_Action --
------------------------------
overriding procedure Visit_Accept_Call_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Accept_Call_Actions.UML_Accept_Call_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Accept_Call_Action;
-------------------------------
-- Visit_Accept_Event_Action --
-------------------------------
overriding procedure Visit_Accept_Event_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Accept_Event_Actions.UML_Accept_Event_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Accept_Event_Action;
------------------------------------------
-- Visit_Action_Execution_Specification --
------------------------------------------
overriding procedure Visit_Action_Execution_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Action_Execution_Specifications.UML_Action_Execution_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Action_Execution_Specification;
----------------------------
-- Visit_Action_Input_Pin --
----------------------------
overriding procedure Visit_Action_Input_Pin
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Action_Input_Pins.UML_Action_Input_Pin_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Action_Input_Pin;
--------------------
-- Visit_Activity --
--------------------
overriding procedure Visit_Activity
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Activities.UML_Activity_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Activity;
-------------------------------
-- Visit_Activity_Final_Node --
-------------------------------
overriding procedure Visit_Activity_Final_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Activity_Final_Nodes.UML_Activity_Final_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Activity_Final_Node;
-----------------------------------
-- Visit_Activity_Parameter_Node --
-----------------------------------
overriding procedure Visit_Activity_Parameter_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Activity_Parameter_Nodes.UML_Activity_Parameter_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Activity_Parameter_Node;
------------------------------
-- Visit_Activity_Partition --
------------------------------
overriding procedure Visit_Activity_Partition
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Activity_Partitions.UML_Activity_Partition_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Activity_Partition;
-----------------
-- Visit_Actor --
-----------------
overriding procedure Visit_Actor
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Actors.UML_Actor_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Actor;
-----------------------------------------------
-- Visit_Add_Structural_Feature_Value_Action --
-----------------------------------------------
overriding procedure Visit_Add_Structural_Feature_Value_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Add_Structural_Feature_Value_Actions.UML_Add_Structural_Feature_Value_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Add_Structural_Feature_Value_Action;
-------------------------------------
-- Visit_Add_Variable_Value_Action --
-------------------------------------
overriding procedure Visit_Add_Variable_Value_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Add_Variable_Value_Actions.UML_Add_Variable_Value_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Add_Variable_Value_Action;
-----------------------------
-- Visit_Any_Receive_Event --
-----------------------------
overriding procedure Visit_Any_Receive_Event
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Any_Receive_Events.UML_Any_Receive_Event_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Any_Receive_Event;
--------------------
-- Visit_Artifact --
--------------------
overriding procedure Visit_Artifact
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Artifacts.UML_Artifact_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Artifact;
-----------------------
-- Visit_Association --
-----------------------
overriding procedure Visit_Association
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Associations.UML_Association_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Association;
-----------------------------
-- Visit_Association_Class --
-----------------------------
overriding procedure Visit_Association_Class
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Association_Classes.UML_Association_Class_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Association_Class;
--------------------------------------------
-- Visit_Behavior_Execution_Specification --
--------------------------------------------
overriding procedure Visit_Behavior_Execution_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Behavior_Execution_Specifications.UML_Behavior_Execution_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Behavior_Execution_Specification;
-----------------------------------
-- Visit_Broadcast_Signal_Action --
-----------------------------------
overriding procedure Visit_Broadcast_Signal_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Broadcast_Signal_Actions.UML_Broadcast_Signal_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Broadcast_Signal_Action;
--------------------------------
-- Visit_Call_Behavior_Action --
--------------------------------
overriding procedure Visit_Call_Behavior_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Call_Behavior_Actions.UML_Call_Behavior_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Call_Behavior_Action;
----------------------
-- Visit_Call_Event --
----------------------
overriding procedure Visit_Call_Event
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Call_Events.UML_Call_Event_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Call_Event;
---------------------------------
-- Visit_Call_Operation_Action --
---------------------------------
overriding procedure Visit_Call_Operation_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Call_Operation_Actions.UML_Call_Operation_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Call_Operation_Action;
-------------------------------
-- Visit_Central_Buffer_Node --
-------------------------------
overriding procedure Visit_Central_Buffer_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Central_Buffer_Nodes.UML_Central_Buffer_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Central_Buffer_Node;
------------------------
-- Visit_Change_Event --
------------------------
overriding procedure Visit_Change_Event
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Change_Events.UML_Change_Event_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Change_Event;
-----------------
-- Visit_Class --
-----------------
overriding procedure Visit_Class
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Classes.UML_Class_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Class;
-----------------------------------------
-- Visit_Classifier_Template_Parameter --
-----------------------------------------
overriding procedure Visit_Classifier_Template_Parameter
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Classifier_Template_Parameter;
------------------
-- Visit_Clause --
------------------
overriding procedure Visit_Clause
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Clauses.UML_Clause_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Clause;
------------------------------------
-- Visit_Clear_Association_Action --
------------------------------------
overriding procedure Visit_Clear_Association_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Clear_Association_Actions.UML_Clear_Association_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Clear_Association_Action;
-------------------------------------------
-- Visit_Clear_Structural_Feature_Action --
-------------------------------------------
overriding procedure Visit_Clear_Structural_Feature_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Clear_Structural_Feature_Actions.UML_Clear_Structural_Feature_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Clear_Structural_Feature_Action;
---------------------------------
-- Visit_Clear_Variable_Action --
---------------------------------
overriding procedure Visit_Clear_Variable_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Clear_Variable_Actions.UML_Clear_Variable_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Clear_Variable_Action;
-------------------------
-- Visit_Collaboration --
-------------------------
overriding procedure Visit_Collaboration
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Collaborations.UML_Collaboration_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Collaboration;
-----------------------------
-- Visit_Collaboration_Use --
-----------------------------
overriding procedure Visit_Collaboration_Use
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Collaboration_Use;
-----------------------------
-- Visit_Combined_Fragment --
-----------------------------
overriding procedure Visit_Combined_Fragment
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Combined_Fragments.UML_Combined_Fragment_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Combined_Fragment;
-------------------
-- Visit_Comment --
-------------------
overriding procedure Visit_Comment
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Comments.UML_Comment_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Comment;
------------------------------
-- Visit_Communication_Path --
------------------------------
overriding procedure Visit_Communication_Path
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Communication_Paths.UML_Communication_Path_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Communication_Path;
---------------------
-- Visit_Component --
---------------------
overriding procedure Visit_Component
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Components.UML_Component_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Component;
---------------------------------
-- Visit_Component_Realization --
---------------------------------
overriding procedure Visit_Component_Realization
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Component_Realizations.UML_Component_Realization_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Component_Realization;
----------------------------
-- Visit_Conditional_Node --
----------------------------
overriding procedure Visit_Conditional_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Conditional_Nodes.UML_Conditional_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Conditional_Node;
--------------------------------------------------
-- Visit_Connectable_Element_Template_Parameter --
--------------------------------------------------
overriding procedure Visit_Connectable_Element_Template_Parameter
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Connectable_Element_Template_Parameters.UML_Connectable_Element_Template_Parameter_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Connectable_Element_Template_Parameter;
--------------------------------------
-- Visit_Connection_Point_Reference --
--------------------------------------
overriding procedure Visit_Connection_Point_Reference
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Connection_Point_References.UML_Connection_Point_Reference_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Connection_Point_Reference;
---------------------
-- Visit_Connector --
---------------------
overriding procedure Visit_Connector
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Connectors.UML_Connector_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Connector;
-------------------------
-- Visit_Connector_End --
-------------------------
overriding procedure Visit_Connector_End
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Connector_Ends.UML_Connector_End_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Connector_End;
------------------------------------
-- Visit_Consider_Ignore_Fragment --
------------------------------------
overriding procedure Visit_Consider_Ignore_Fragment
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Consider_Ignore_Fragments.UML_Consider_Ignore_Fragment_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Consider_Ignore_Fragment;
----------------------
-- Visit_Constraint --
----------------------
overriding procedure Visit_Constraint
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Constraints.UML_Constraint_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Constraint;
------------------------
-- Visit_Continuation --
------------------------
overriding procedure Visit_Continuation
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Continuations.UML_Continuation_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Continuation;
------------------------
-- Visit_Control_Flow --
------------------------
overriding procedure Visit_Control_Flow
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Control_Flows.UML_Control_Flow_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Control_Flow;
------------------------------
-- Visit_Create_Link_Action --
------------------------------
overriding procedure Visit_Create_Link_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Create_Link_Actions.UML_Create_Link_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Create_Link_Action;
-------------------------------------
-- Visit_Create_Link_Object_Action --
-------------------------------------
overriding procedure Visit_Create_Link_Object_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Create_Link_Object_Actions.UML_Create_Link_Object_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Create_Link_Object_Action;
--------------------------------
-- Visit_Create_Object_Action --
--------------------------------
overriding procedure Visit_Create_Object_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Create_Object_Actions.UML_Create_Object_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Create_Object_Action;
---------------------------
-- Visit_Data_Store_Node --
---------------------------
overriding procedure Visit_Data_Store_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Data_Store_Nodes.UML_Data_Store_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Data_Store_Node;
---------------------
-- Visit_Data_Type --
---------------------
overriding procedure Visit_Data_Type
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Data_Types.UML_Data_Type_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Data_Type;
-------------------------
-- Visit_Decision_Node --
-------------------------
overriding procedure Visit_Decision_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Decision_Nodes.UML_Decision_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Decision_Node;
----------------------
-- Visit_Dependency --
----------------------
overriding procedure Visit_Dependency
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Dependencies.UML_Dependency_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Dependency;
----------------------
-- Visit_Deployment --
----------------------
overriding procedure Visit_Deployment
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Deployments.UML_Deployment_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Deployment;
------------------------------------
-- Visit_Deployment_Specification --
------------------------------------
overriding procedure Visit_Deployment_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Deployment_Specifications.UML_Deployment_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Deployment_Specification;
-------------------------------
-- Visit_Destroy_Link_Action --
-------------------------------
overriding procedure Visit_Destroy_Link_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Destroy_Link_Actions.UML_Destroy_Link_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Destroy_Link_Action;
---------------------------------
-- Visit_Destroy_Object_Action --
---------------------------------
overriding procedure Visit_Destroy_Object_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Destroy_Object_Actions.UML_Destroy_Object_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Destroy_Object_Action;
------------------------------------------------
-- Visit_Destruction_Occurrence_Specification --
------------------------------------------------
overriding procedure Visit_Destruction_Occurrence_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Destruction_Occurrence_Specifications.UML_Destruction_Occurrence_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Destruction_Occurrence_Specification;
------------------
-- Visit_Device --
------------------
overriding procedure Visit_Device
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Devices.UML_Device_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Device;
--------------------
-- Visit_Duration --
--------------------
overriding procedure Visit_Duration
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Durations.UML_Duration_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Duration;
-------------------------------
-- Visit_Duration_Constraint --
-------------------------------
overriding procedure Visit_Duration_Constraint
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Duration_Constraints.UML_Duration_Constraint_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Duration_Constraint;
-----------------------------
-- Visit_Duration_Interval --
-----------------------------
overriding procedure Visit_Duration_Interval
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Duration_Intervals.UML_Duration_Interval_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Duration_Interval;
--------------------------------
-- Visit_Duration_Observation --
--------------------------------
overriding procedure Visit_Duration_Observation
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Duration_Observations.UML_Duration_Observation_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Duration_Observation;
--------------------------
-- Visit_Element_Import --
--------------------------
overriding procedure Visit_Element_Import
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Element_Imports.UML_Element_Import_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Element_Import;
-----------------------
-- Visit_Enumeration --
-----------------------
overriding procedure Visit_Enumeration
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Enumerations.UML_Enumeration_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Enumeration;
-------------------------------
-- Visit_Enumeration_Literal --
-------------------------------
overriding procedure Visit_Enumeration_Literal
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Enumeration_Literals.UML_Enumeration_Literal_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Enumeration_Literal;
-----------------------------
-- Visit_Exception_Handler --
-----------------------------
overriding procedure Visit_Exception_Handler
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Exception_Handlers.UML_Exception_Handler_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Exception_Handler;
---------------------------------
-- Visit_Execution_Environment --
---------------------------------
overriding procedure Visit_Execution_Environment
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Execution_Environments.UML_Execution_Environment_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Execution_Environment;
----------------------------------------------
-- Visit_Execution_Occurrence_Specification --
----------------------------------------------
overriding procedure Visit_Execution_Occurrence_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Execution_Occurrence_Specifications.UML_Execution_Occurrence_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Execution_Occurrence_Specification;
--------------------------
-- Visit_Expansion_Node --
--------------------------
overriding procedure Visit_Expansion_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Expansion_Nodes.UML_Expansion_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Expansion_Node;
----------------------------
-- Visit_Expansion_Region --
----------------------------
overriding procedure Visit_Expansion_Region
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Expansion_Regions.UML_Expansion_Region_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Expansion_Region;
----------------------
-- Visit_Expression --
----------------------
overriding procedure Visit_Expression
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Expressions.UML_Expression_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Expression;
------------------
-- Visit_Extend --
------------------
overriding procedure Visit_Extend
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Extends.UML_Extend_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Extend;
---------------------
-- Visit_Extension --
---------------------
overriding procedure Visit_Extension
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Extensions.UML_Extension_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Extension;
-------------------------
-- Visit_Extension_End --
-------------------------
overriding procedure Visit_Extension_End
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Extension_Ends.UML_Extension_End_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Extension_End;
---------------------------
-- Visit_Extension_Point --
---------------------------
overriding procedure Visit_Extension_Point
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Extension_Points.UML_Extension_Point_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Extension_Point;
-----------------------
-- Visit_Final_State --
-----------------------
overriding procedure Visit_Final_State
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Final_States.UML_Final_State_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Final_State;
---------------------------
-- Visit_Flow_Final_Node --
---------------------------
overriding procedure Visit_Flow_Final_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Flow_Final_Nodes.UML_Flow_Final_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Flow_Final_Node;
---------------------
-- Visit_Fork_Node --
---------------------
overriding procedure Visit_Fork_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Fork_Nodes.UML_Fork_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Fork_Node;
-----------------------------
-- Visit_Function_Behavior --
-----------------------------
overriding procedure Visit_Function_Behavior
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Function_Behaviors.UML_Function_Behavior_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Function_Behavior;
----------------
-- Visit_Gate --
----------------
overriding procedure Visit_Gate
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Gates.UML_Gate_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Gate;
----------------------------
-- Visit_General_Ordering --
----------------------------
overriding procedure Visit_General_Ordering
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.General_Orderings.UML_General_Ordering_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_General_Ordering;
--------------------------
-- Visit_Generalization --
--------------------------
overriding procedure Visit_Generalization
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Generalizations.UML_Generalization_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Generalization;
------------------------------
-- Visit_Generalization_Set --
------------------------------
overriding procedure Visit_Generalization_Set
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Generalization_Sets.UML_Generalization_Set_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Generalization_Set;
-----------------
-- Visit_Image --
-----------------
overriding procedure Visit_Image
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Images.UML_Image_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Image;
-------------------
-- Visit_Include --
-------------------
overriding procedure Visit_Include
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Includes.UML_Include_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Include;
----------------------------
-- Visit_Information_Flow --
----------------------------
overriding procedure Visit_Information_Flow
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Information_Flows.UML_Information_Flow_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Information_Flow;
----------------------------
-- Visit_Information_Item --
----------------------------
overriding procedure Visit_Information_Item
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Information_Items.UML_Information_Item_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Information_Item;
------------------------
-- Visit_Initial_Node --
------------------------
overriding procedure Visit_Initial_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Initial_Nodes.UML_Initial_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Initial_Node;
---------------------
-- Visit_Input_Pin --
---------------------
overriding procedure Visit_Input_Pin
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Input_Pins.UML_Input_Pin_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Input_Pin;
----------------------------------
-- Visit_Instance_Specification --
----------------------------------
overriding procedure Visit_Instance_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Instance_Specifications.UML_Instance_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Instance_Specification;
--------------------------
-- Visit_Instance_Value --
--------------------------
overriding procedure Visit_Instance_Value
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Instance_Values.UML_Instance_Value_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Instance_Value;
-----------------------
-- Visit_Interaction --
-----------------------
overriding procedure Visit_Interaction
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interactions.UML_Interaction_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interaction;
----------------------------------
-- Visit_Interaction_Constraint --
----------------------------------
overriding procedure Visit_Interaction_Constraint
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interaction_Constraints.UML_Interaction_Constraint_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interaction_Constraint;
-------------------------------
-- Visit_Interaction_Operand --
-------------------------------
overriding procedure Visit_Interaction_Operand
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interaction_Operand;
---------------------------
-- Visit_Interaction_Use --
---------------------------
overriding procedure Visit_Interaction_Use
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interaction_Uses.UML_Interaction_Use_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interaction_Use;
---------------------
-- Visit_Interface --
---------------------
overriding procedure Visit_Interface
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interfaces.UML_Interface_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interface;
---------------------------------
-- Visit_Interface_Realization --
---------------------------------
overriding procedure Visit_Interface_Realization
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interface_Realizations.UML_Interface_Realization_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interface_Realization;
-----------------------------------------
-- Visit_Interruptible_Activity_Region --
-----------------------------------------
overriding procedure Visit_Interruptible_Activity_Region
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interruptible_Activity_Regions.UML_Interruptible_Activity_Region_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interruptible_Activity_Region;
--------------------
-- Visit_Interval --
--------------------
overriding procedure Visit_Interval
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Intervals.UML_Interval_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interval;
-------------------------------
-- Visit_Interval_Constraint --
-------------------------------
overriding procedure Visit_Interval_Constraint
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Interval_Constraints.UML_Interval_Constraint_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Interval_Constraint;
---------------------
-- Visit_Join_Node --
---------------------
overriding procedure Visit_Join_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Join_Nodes.UML_Join_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Join_Node;
--------------------
-- Visit_Lifeline --
--------------------
overriding procedure Visit_Lifeline
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Lifelines.UML_Lifeline_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Lifeline;
----------------------------------
-- Visit_Link_End_Creation_Data --
----------------------------------
overriding procedure Visit_Link_End_Creation_Data
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Link_End_Creation_Datas.UML_Link_End_Creation_Data_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Link_End_Creation_Data;
-------------------------
-- Visit_Link_End_Data --
-------------------------
overriding procedure Visit_Link_End_Data
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Link_End_Datas.UML_Link_End_Data_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Link_End_Data;
-------------------------------------
-- Visit_Link_End_Destruction_Data --
-------------------------------------
overriding procedure Visit_Link_End_Destruction_Data
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Link_End_Destruction_Datas.UML_Link_End_Destruction_Data_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Link_End_Destruction_Data;
---------------------------
-- Visit_Literal_Boolean --
---------------------------
overriding procedure Visit_Literal_Boolean
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Literal_Booleans.UML_Literal_Boolean_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Literal_Boolean;
---------------------------
-- Visit_Literal_Integer --
---------------------------
overriding procedure Visit_Literal_Integer
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Literal_Integers.UML_Literal_Integer_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Literal_Integer;
------------------------
-- Visit_Literal_Null --
------------------------
overriding procedure Visit_Literal_Null
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Literal_Nulls.UML_Literal_Null_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Literal_Null;
------------------------
-- Visit_Literal_Real --
------------------------
overriding procedure Visit_Literal_Real
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Literal_Reals.UML_Literal_Real_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Literal_Real;
--------------------------
-- Visit_Literal_String --
--------------------------
overriding procedure Visit_Literal_String
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Literal_Strings.UML_Literal_String_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Literal_String;
-------------------------------------
-- Visit_Literal_Unlimited_Natural --
-------------------------------------
overriding procedure Visit_Literal_Unlimited_Natural
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Literal_Unlimited_Naturals.UML_Literal_Unlimited_Natural_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Literal_Unlimited_Natural;
---------------------
-- Visit_Loop_Node --
---------------------
overriding procedure Visit_Loop_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Loop_Nodes.UML_Loop_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Loop_Node;
-------------------------
-- Visit_Manifestation --
-------------------------
overriding procedure Visit_Manifestation
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Manifestations.UML_Manifestation_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Manifestation;
----------------------
-- Visit_Merge_Node --
----------------------
overriding procedure Visit_Merge_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Merge_Nodes.UML_Merge_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Merge_Node;
-------------------
-- Visit_Message --
-------------------
overriding procedure Visit_Message
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Messages.UML_Message_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Message;
--------------------------------------------
-- Visit_Message_Occurrence_Specification --
--------------------------------------------
overriding procedure Visit_Message_Occurrence_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Message_Occurrence_Specifications.UML_Message_Occurrence_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Message_Occurrence_Specification;
-----------------
-- Visit_Model --
-----------------
overriding procedure Visit_Model
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Models.UML_Model_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Package
(Visitor,
AMF.UML.Packages.UML_Package_Access (Element),
Control);
end Visit_Model;
----------------
-- Visit_Node --
----------------
overriding procedure Visit_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Nodes.UML_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Node;
-----------------------
-- Visit_Object_Flow --
-----------------------
overriding procedure Visit_Object_Flow
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Object_Flows.UML_Object_Flow_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Object_Flow;
------------------------------------
-- Visit_Occurrence_Specification --
------------------------------------
overriding procedure Visit_Occurrence_Specification
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Occurrence_Specifications.UML_Occurrence_Specification_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Occurrence_Specification;
-------------------------
-- Visit_Opaque_Action --
-------------------------
overriding procedure Visit_Opaque_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Opaque_Actions.UML_Opaque_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Opaque_Action;
---------------------------
-- Visit_Opaque_Behavior --
---------------------------
overriding procedure Visit_Opaque_Behavior
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Opaque_Behaviors.UML_Opaque_Behavior_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Opaque_Behavior;
-----------------------------
-- Visit_Opaque_Expression --
-----------------------------
overriding procedure Visit_Opaque_Expression
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Opaque_Expressions.UML_Opaque_Expression_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Opaque_Expression;
---------------------
-- Visit_Operation --
---------------------
overriding procedure Visit_Operation
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Operations.UML_Operation_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Operation;
----------------------------------------
-- Visit_Operation_Template_Parameter --
----------------------------------------
overriding procedure Visit_Operation_Template_Parameter
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Operation_Template_Parameters.UML_Operation_Template_Parameter_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Operation_Template_Parameter;
----------------------
-- Visit_Output_Pin --
----------------------
overriding procedure Visit_Output_Pin
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Output_Pins.UML_Output_Pin_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Output_Pin;
--------------------------
-- Visit_Owned_Elements --
--------------------------
procedure Visit_Owned_Elements
(Self : in out UML_Containment_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null access AMF.UML.Elements.UML_Element'Class;
Control : in out Traverse_Control)
is
Owned_Element : constant AMF.UML.Elements.Collections.Set_Of_UML_Element
:= Element.Get_Owned_Element;
begin
for J in 1 .. Owned_Element.Length loop
AMF.Visitors.Visit
(Self,
Visitor,
AMF.Elements.Element_Access (Owned_Element.Element (J)),
Control);
case Control is
when Continue =>
null;
when Abandon_Children =>
Control := Continue;
when Abandon_Sibling =>
Control := Continue;
exit;
when Terminate_Immediately =>
exit;
end case;
end loop;
end Visit_Owned_Elements;
-------------------
-- Visit_Package --
-------------------
overriding procedure Visit_Package
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Packages.UML_Package_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Package;
--------------------------
-- Visit_Package_Import --
--------------------------
overriding procedure Visit_Package_Import
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Package_Imports.UML_Package_Import_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Package_Import;
-------------------------
-- Visit_Package_Merge --
-------------------------
overriding procedure Visit_Package_Merge
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Package_Merges.UML_Package_Merge_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Package_Merge;
---------------------
-- Visit_Parameter --
---------------------
overriding procedure Visit_Parameter
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Parameters.UML_Parameter_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Parameter;
-------------------------
-- Visit_Parameter_Set --
-------------------------
overriding procedure Visit_Parameter_Set
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Parameter_Sets.UML_Parameter_Set_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Parameter_Set;
------------------------------
-- Visit_Part_Decomposition --
------------------------------
overriding procedure Visit_Part_Decomposition
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Part_Decompositions.UML_Part_Decomposition_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Part_Decomposition;
----------------
-- Visit_Port --
----------------
overriding procedure Visit_Port
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Ports.UML_Port_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Port;
--------------------------
-- Visit_Primitive_Type --
--------------------------
overriding procedure Visit_Primitive_Type
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Primitive_Types.UML_Primitive_Type_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Primitive_Type;
-------------------
-- Visit_Profile --
-------------------
overriding procedure Visit_Profile
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Profiles.UML_Profile_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Profile;
-------------------------------
-- Visit_Profile_Application --
-------------------------------
overriding procedure Visit_Profile_Application
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Profile_Applications.UML_Profile_Application_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Profile_Application;
--------------------
-- Visit_Property --
--------------------
overriding procedure Visit_Property
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Properties.UML_Property_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Property;
--------------------------------
-- Visit_Protocol_Conformance --
--------------------------------
overriding procedure Visit_Protocol_Conformance
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Protocol_Conformances.UML_Protocol_Conformance_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Protocol_Conformance;
----------------------------------
-- Visit_Protocol_State_Machine --
----------------------------------
overriding procedure Visit_Protocol_State_Machine
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Protocol_State_Machines.UML_Protocol_State_Machine_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Protocol_State_Machine;
-------------------------------
-- Visit_Protocol_Transition --
-------------------------------
overriding procedure Visit_Protocol_Transition
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Protocol_Transitions.UML_Protocol_Transition_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Protocol_Transition;
-----------------------
-- Visit_Pseudostate --
-----------------------
overriding procedure Visit_Pseudostate
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Pseudostates.UML_Pseudostate_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Pseudostate;
---------------------------
-- Visit_Qualifier_Value --
---------------------------
overriding procedure Visit_Qualifier_Value
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Qualifier_Values.UML_Qualifier_Value_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Qualifier_Value;
----------------------------------
-- Visit_Raise_Exception_Action --
----------------------------------
overriding procedure Visit_Raise_Exception_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Raise_Exception_Actions.UML_Raise_Exception_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Raise_Exception_Action;
------------------------------
-- Visit_Read_Extent_Action --
------------------------------
overriding procedure Visit_Read_Extent_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Extent_Actions.UML_Read_Extent_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Extent_Action;
--------------------------------------------
-- Visit_Read_Is_Classified_Object_Action --
--------------------------------------------
overriding procedure Visit_Read_Is_Classified_Object_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Is_Classified_Object_Actions.UML_Read_Is_Classified_Object_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Is_Classified_Object_Action;
----------------------------
-- Visit_Read_Link_Action --
----------------------------
overriding procedure Visit_Read_Link_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Link_Actions.UML_Read_Link_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Link_Action;
---------------------------------------
-- Visit_Read_Link_Object_End_Action --
---------------------------------------
overriding procedure Visit_Read_Link_Object_End_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Link_Object_End_Actions.UML_Read_Link_Object_End_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Link_Object_End_Action;
-------------------------------------------------
-- Visit_Read_Link_Object_End_Qualifier_Action --
-------------------------------------------------
overriding procedure Visit_Read_Link_Object_End_Qualifier_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Link_Object_End_Qualifier_Actions.UML_Read_Link_Object_End_Qualifier_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Link_Object_End_Qualifier_Action;
----------------------------
-- Visit_Read_Self_Action --
----------------------------
overriding procedure Visit_Read_Self_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Self_Actions.UML_Read_Self_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Self_Action;
------------------------------------------
-- Visit_Read_Structural_Feature_Action --
------------------------------------------
overriding procedure Visit_Read_Structural_Feature_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Structural_Feature_Action;
--------------------------------
-- Visit_Read_Variable_Action --
--------------------------------
overriding procedure Visit_Read_Variable_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Read_Variable_Actions.UML_Read_Variable_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Read_Variable_Action;
-----------------------
-- Visit_Realization --
-----------------------
overriding procedure Visit_Realization
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Realizations.UML_Realization_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Realization;
---------------------
-- Visit_Reception --
---------------------
overriding procedure Visit_Reception
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Receptions.UML_Reception_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Reception;
------------------------------------
-- Visit_Reclassify_Object_Action --
------------------------------------
overriding procedure Visit_Reclassify_Object_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Reclassify_Object_Actions.UML_Reclassify_Object_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Reclassify_Object_Action;
------------------------------------------
-- Visit_Redefinable_Template_Signature --
------------------------------------------
overriding procedure Visit_Redefinable_Template_Signature
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Redefinable_Template_Signature;
-------------------------
-- Visit_Reduce_Action --
-------------------------
overriding procedure Visit_Reduce_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Reduce_Actions.UML_Reduce_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Reduce_Action;
------------------
-- Visit_Region --
------------------
overriding procedure Visit_Region
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Regions.UML_Region_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Region;
--------------------------------------------------
-- Visit_Remove_Structural_Feature_Value_Action --
--------------------------------------------------
overriding procedure Visit_Remove_Structural_Feature_Value_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Remove_Structural_Feature_Value_Actions.UML_Remove_Structural_Feature_Value_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Remove_Structural_Feature_Value_Action;
----------------------------------------
-- Visit_Remove_Variable_Value_Action --
----------------------------------------
overriding procedure Visit_Remove_Variable_Value_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Remove_Variable_Value_Actions.UML_Remove_Variable_Value_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Remove_Variable_Value_Action;
------------------------
-- Visit_Reply_Action --
------------------------
overriding procedure Visit_Reply_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Reply_Actions.UML_Reply_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Reply_Action;
------------------------------
-- Visit_Send_Object_Action --
------------------------------
overriding procedure Visit_Send_Object_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Send_Object_Actions.UML_Send_Object_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Send_Object_Action;
------------------------------
-- Visit_Send_Signal_Action --
------------------------------
overriding procedure Visit_Send_Signal_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Send_Signal_Actions.UML_Send_Signal_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Send_Signal_Action;
-------------------------
-- Visit_Sequence_Node --
-------------------------
overriding procedure Visit_Sequence_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Sequence_Nodes.UML_Sequence_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Sequence_Node;
------------------
-- Visit_Signal --
------------------
overriding procedure Visit_Signal
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Signals.UML_Signal_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Signal;
------------------------
-- Visit_Signal_Event --
------------------------
overriding procedure Visit_Signal_Event
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Signal_Events.UML_Signal_Event_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Signal_Event;
----------------
-- Visit_Slot --
----------------
overriding procedure Visit_Slot
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Slots.UML_Slot_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Slot;
--------------------------------------------
-- Visit_Start_Classifier_Behavior_Action --
--------------------------------------------
overriding procedure Visit_Start_Classifier_Behavior_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Start_Classifier_Behavior_Actions.UML_Start_Classifier_Behavior_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Start_Classifier_Behavior_Action;
----------------------------------------
-- Visit_Start_Object_Behavior_Action --
----------------------------------------
overriding procedure Visit_Start_Object_Behavior_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Start_Object_Behavior_Actions.UML_Start_Object_Behavior_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Start_Object_Behavior_Action;
-----------------
-- Visit_State --
-----------------
overriding procedure Visit_State
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.States.UML_State_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_State;
---------------------------
-- Visit_State_Invariant --
---------------------------
overriding procedure Visit_State_Invariant
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.State_Invariants.UML_State_Invariant_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_State_Invariant;
-------------------------
-- Visit_State_Machine --
-------------------------
overriding procedure Visit_State_Machine
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.State_Machines.UML_State_Machine_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_State_Machine;
----------------------
-- Visit_Stereotype --
----------------------
overriding procedure Visit_Stereotype
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Stereotypes.UML_Stereotype_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Stereotype;
-----------------------------
-- Visit_String_Expression --
-----------------------------
overriding procedure Visit_String_Expression
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.String_Expressions.UML_String_Expression_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_String_Expression;
------------------------------------
-- Visit_Structured_Activity_Node --
------------------------------------
overriding procedure Visit_Structured_Activity_Node
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Structured_Activity_Node;
------------------------
-- Visit_Substitution --
------------------------
overriding procedure Visit_Substitution
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Substitutions.UML_Substitution_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Substitution;
----------------------------
-- Visit_Template_Binding --
----------------------------
overriding procedure Visit_Template_Binding
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Template_Bindings.UML_Template_Binding_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Template_Binding;
------------------------------
-- Visit_Template_Parameter --
------------------------------
overriding procedure Visit_Template_Parameter
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Template_Parameter;
-------------------------------------------
-- Visit_Template_Parameter_Substitution --
-------------------------------------------
overriding procedure Visit_Template_Parameter_Substitution
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Template_Parameter_Substitutions.UML_Template_Parameter_Substitution_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Template_Parameter_Substitution;
------------------------------
-- Visit_Template_Signature --
------------------------------
overriding procedure Visit_Template_Signature
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Template_Signatures.UML_Template_Signature_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Template_Signature;
--------------------------------
-- Visit_Test_Identity_Action --
--------------------------------
overriding procedure Visit_Test_Identity_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Test_Identity_Actions.UML_Test_Identity_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Test_Identity_Action;
---------------------------
-- Visit_Time_Constraint --
---------------------------
overriding procedure Visit_Time_Constraint
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Time_Constraints.UML_Time_Constraint_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Time_Constraint;
----------------------
-- Visit_Time_Event --
----------------------
overriding procedure Visit_Time_Event
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Time_Events.UML_Time_Event_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Time_Event;
---------------------------
-- Visit_Time_Expression --
---------------------------
overriding procedure Visit_Time_Expression
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Time_Expressions.UML_Time_Expression_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Time_Expression;
-------------------------
-- Visit_Time_Interval --
-------------------------
overriding procedure Visit_Time_Interval
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Time_Intervals.UML_Time_Interval_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Time_Interval;
----------------------------
-- Visit_Time_Observation --
----------------------------
overriding procedure Visit_Time_Observation
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Time_Observations.UML_Time_Observation_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Time_Observation;
----------------------
-- Visit_Transition --
----------------------
overriding procedure Visit_Transition
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Transitions.UML_Transition_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Transition;
-------------------
-- Visit_Trigger --
-------------------
overriding procedure Visit_Trigger
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Triggers.UML_Trigger_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Trigger;
-----------------------------
-- Visit_Unmarshall_Action --
-----------------------------
overriding procedure Visit_Unmarshall_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Unmarshall_Actions.UML_Unmarshall_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Unmarshall_Action;
-----------------
-- Visit_Usage --
-----------------
overriding procedure Visit_Usage
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Usages.UML_Usage_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Usage;
--------------------
-- Visit_Use_Case --
--------------------
overriding procedure Visit_Use_Case
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Use_Cases.UML_Use_Case_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Use_Case;
---------------------
-- Visit_Value_Pin --
---------------------
overriding procedure Visit_Value_Pin
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Value_Pins.UML_Value_Pin_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Value_Pin;
--------------------------------------
-- Visit_Value_Specification_Action --
--------------------------------------
overriding procedure Visit_Value_Specification_Action
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Value_Specification_Actions.UML_Value_Specification_Action_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Value_Specification_Action;
--------------------
-- Visit_Variable --
--------------------
overriding procedure Visit_Variable
(Self : in out UML_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.UML.Variables.UML_Variable_Access;
Control : in out Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Variable;
end AMF.Visitors.Generic_UML_Containment;
|
pkgs/tools/yasm/src/modules/objfmts/bin/tests/shr.asm | manggoguy/parsec-modified | 2,151 | 167998 | x: mov al, x>>8
times 256 db 0
y: mov ah, y>>8
|
testsuite/tests/codeGen/should_gen_asm/memset-unroll.asm | ocharles/ghc | 51 | 245094 | .text
.align 8
.globl callMemset
.type callMemset, @object
callMemset:
.Lc5:
movl $16843009,0(%rbx)
movl $16843009,4(%rbx)
movl $16843009,8(%rbx)
movl $16843009,12(%rbx)
jmp *(%rbp)
.size callMemset, .-callMemset
.section .note.GNU-stack,"",@progbits
.ident "GHC 7.9.20140311"
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca.log_21829_101.asm | ljhsiun2/medusa | 9 | 246728 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r14
push %r8
push %r9
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_UC_ht+0x8b1a, %rsi
nop
nop
add $53835, %r11
movb $0x61, (%rsi)
nop
nop
cmp $18844, %rax
lea addresses_UC_ht+0xb1da, %r13
nop
nop
inc %r8
mov $0x6162636465666768, %r9
movq %r9, (%r13)
nop
nop
add %r8, %r8
lea addresses_normal_ht+0x42b4, %rsi
lea addresses_UC_ht+0x159ba, %rdi
nop
nop
mfence
mov $18, %rcx
rep movsb
nop
nop
xor %r14, %r14
lea addresses_WT_ht+0x8bfa, %rsi
lea addresses_UC_ht+0xfdee, %rdi
xor %r13, %r13
mov $114, %rcx
rep movsq
nop
nop
inc %r14
lea addresses_D_ht+0xe032, %r13
sub %rsi, %rsi
movb $0x61, (%r13)
sub %rcx, %rcx
lea addresses_normal_ht+0x15eba, %rsi
inc %rcx
movb (%rsi), %r8b
add $13801, %rax
lea addresses_D_ht+0x141ba, %r11
nop
nop
nop
nop
nop
cmp %r14, %r14
mov $0x6162636465666768, %rcx
movq %rcx, (%r11)
nop
nop
nop
nop
and $62964, %r14
lea addresses_WT_ht+0x5e2, %rsi
lea addresses_normal_ht+0xe4a, %rdi
nop
dec %r9
mov $2, %rcx
rep movsq
sub %r14, %r14
lea addresses_WC_ht+0x16c12, %rsi
lea addresses_A_ht+0x1d8c6, %rdi
nop
sub %r13, %r13
mov $99, %rcx
rep movsq
add %rsi, %rsi
pop %rsi
pop %rdi
pop %rcx
pop %rax
pop %r9
pop %r8
pop %r14
pop %r13
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r12
push %r13
push %r8
push %rbp
push %rbx
push %rdi
push %rsi
// Store
lea addresses_A+0x6472, %rbx
nop
nop
nop
nop
nop
inc %rdi
mov $0x5152535455565758, %r13
movq %r13, %xmm1
movups %xmm1, (%rbx)
nop
nop
nop
nop
nop
xor $20637, %rbx
// Faulty Load
lea addresses_D+0x29ba, %rsi
nop
nop
add $31262, %r12
mov (%rsi), %ebp
lea oracles, %rsi
and $0xff, %rbp
shlq $12, %rbp
mov (%rsi,%rbp,1), %rbp
pop %rsi
pop %rdi
pop %rbx
pop %rbp
pop %r8
pop %r13
pop %r12
ret
/*
<gen_faulty_load>
[REF]
{'src': {'congruent': 0, 'AVXalign': False, 'same': True, 'size': 16, 'NT': False, 'type': 'addresses_D'}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'congruent': 0, 'AVXalign': False, 'same': False, 'size': 16, 'NT': False, 'type': 'addresses_A'}}
[Faulty Load]
{'src': {'congruent': 0, 'AVXalign': False, 'same': True, 'size': 4, 'NT': False, 'type': 'addresses_D'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'OP': 'STOR', 'dst': {'congruent': 4, 'AVXalign': False, 'same': False, 'size': 1, 'NT': True, 'type': 'addresses_UC_ht'}}
{'OP': 'STOR', 'dst': {'congruent': 5, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_UC_ht'}}
{'src': {'congruent': 1, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'REPM', 'dst': {'congruent': 11, 'same': False, 'type': 'addresses_UC_ht'}}
{'src': {'congruent': 6, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'REPM', 'dst': {'congruent': 2, 'same': False, 'type': 'addresses_UC_ht'}}
{'OP': 'STOR', 'dst': {'congruent': 2, 'AVXalign': False, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_D_ht'}}
{'src': {'congruent': 8, 'AVXalign': False, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_normal_ht'}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'congruent': 10, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_D_ht'}}
{'src': {'congruent': 3, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'REPM', 'dst': {'congruent': 4, 'same': False, 'type': 'addresses_normal_ht'}}
{'src': {'congruent': 3, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'REPM', 'dst': {'congruent': 2, 'same': False, 'type': 'addresses_A_ht'}}
{'36': 21829}
36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36
*/
|
programs/oeis/172/A172075.asm | neoneye/loda | 22 | 172150 | ; A172075: a(n) = n*(n+1)*(9*n^2 - n - 5)/6.
; 0,1,29,146,450,1075,2191,4004,6756,10725,16225,23606,33254,45591,61075,80200,103496,131529,164901,204250,250250,303611,365079,435436,515500,606125,708201,822654,950446,1092575,1250075,1424016,1615504,1825681,2055725,2306850,2580306,2877379,3199391,3547700,3923700,4328821,4764529,5232326,5733750,6270375,6843811,7455704,8107736,8801625,9539125,10322026,11152154,12031371,12961575,13944700,14982716,16077629,17231481,18446350,19724350,21067631,22478379,23958816,25511200,27137825,28841021,30623154,32486626,34433875,36467375,38589636,40803204,43110661,45514625,48017750,50622726,53332279,56149171,59076200,62116200,65272041,68546629,71942906,75463850,79112475,82891831,86805004,90855116,95045325,99378825,103858846,108488654,113271551,118210875,123310000,128572336,134001329,139600461,145373250
lpb $0
mov $2,$0
sub $0,1
seq $2,51866 ; 14-gonal (or tetradecagonal) numbers: a(n) = n*(6*n-5).
add $3,$2
add $1,$3
lpe
mov $0,$1
|
Transynther/x86/_processed/AVXALIGN/_zr_/i7-7700_9_0x48.log_11_1069.asm | ljhsiun2/medusa | 9 | 96390 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r14
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_D_ht+0x11d42, %rsi
add %rax, %rax
mov (%rsi), %r14
nop
nop
nop
add %rsi, %rsi
lea addresses_WT_ht+0xd20f, %rsi
lea addresses_UC_ht+0xf912, %rdi
clflush (%rsi)
nop
nop
nop
cmp $17149, %r11
mov $16, %rcx
rep movsw
nop
nop
xor $25527, %rcx
pop %rsi
pop %rdi
pop %rcx
pop %rax
pop %r14
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r14
push %r9
push %rax
push %rbp
push %rdx
push %rsi
// Load
mov $0xe92, %rsi
nop
nop
nop
nop
nop
xor $52691, %rax
mov (%rsi), %r9w
nop
nop
nop
nop
nop
cmp $36410, %r10
// Store
lea addresses_WT+0x138c2, %rdx
nop
sub %rsi, %rsi
mov $0x5152535455565758, %r14
movq %r14, %xmm5
movups %xmm5, (%rdx)
nop
nop
nop
nop
add $14145, %rbp
// Store
mov $0x992, %rax
nop
nop
nop
add %rsi, %rsi
movl $0x51525354, (%rax)
nop
cmp %r14, %r14
// Store
lea addresses_WT+0xa490, %r9
clflush (%r9)
nop
sub %r10, %r10
mov $0x5152535455565758, %rax
movq %rax, (%r9)
nop
add %rsi, %rsi
// Load
mov $0x10eb860000000592, %r10
nop
nop
nop
inc %rbp
vmovups (%r10), %ymm7
vextracti128 $1, %ymm7, %xmm7
vpextrq $1, %xmm7, %rax
sub $12291, %r10
// Store
lea addresses_UC+0xbdd2, %rsi
nop
inc %r9
movw $0x5152, (%rsi)
and $18495, %r14
// Load
lea addresses_US+0xb26a, %rsi
nop
sub %r10, %r10
mov (%rsi), %bp
// Exception!!!
nop
nop
mov (0), %rbp
nop
nop
and $35160, %rdx
// Faulty Load
lea addresses_US+0x1c912, %rsi
clflush (%rsi)
nop
nop
nop
cmp $20252, %r14
mov (%rsi), %ebp
lea oracles, %r9
and $0xff, %rbp
shlq $12, %rbp
mov (%r9,%rbp,1), %rbp
pop %rsi
pop %rdx
pop %rbp
pop %rax
pop %r9
pop %r14
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_US', 'AVXalign': False, 'congruent': 0, 'size': 1, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_P', 'AVXalign': False, 'congruent': 7, 'size': 2, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WT', 'AVXalign': False, 'congruent': 4, 'size': 16, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_P', 'AVXalign': False, 'congruent': 7, 'size': 4, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WT', 'AVXalign': False, 'congruent': 1, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 7, 'size': 32, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC', 'AVXalign': False, 'congruent': 6, 'size': 2, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_US', 'AVXalign': False, 'congruent': 3, 'size': 2, 'same': False, 'NT': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_US', 'AVXalign': False, 'congruent': 0, 'size': 4, 'same': True, 'NT': True}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'congruent': 2, 'size': 8, 'same': True, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WT_ht', 'congruent': 0, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 7, 'same': False}}
{'00': 11}
00 00 00 00 00 00 00 00 00 00 00
*/
|
test/Fail/MetaCannotDependOn.agda | cruhland/agda | 1,989 | 4100 |
module MetaCannotDependOn where
data Nat : Set where
zero : Nat
suc : Nat -> Nat
postulate
Vec : Nat -> Set -> Set
f : (A : Set) -> ((n : Nat) -> A -> Vec n Nat) -> Nat
err : Nat
err = f _ (\ n xs -> xs)
|
programs/oeis/066/A066606.asm | neoneye/loda | 22 | 3055 | ; A066606: a(n) = 2^n mod n^2.
; 0,0,8,0,7,28,30,0,26,24,112,64,80,116,143,0,155,28,116,176,197,444,255,64,57,316,80,128,60,424,374,0,602,616,18,784,76,460,944,576,207,1324,303,1600,782,1016,1929,1792,2382,124,1844,2512,1009,568,1693,704,1376,236,946,3376,673,1492,1079,0,357,856,1342,288,1457,324,286,2944,2849,300,818,3664,3791,2872,3004,5376,4616,824,1081,3088,2157,1208,5750,4480,1070,4024,765,8112,4472,7712,2293,4096,1651,7564,215,5376
add $0,1
mov $1,2
pow $1,$0
pow $0,2
mod $1,$0
mov $0,$1
|
string/s001.asm | czfshine/assembly-exercise | 1 | 7051 | ; 8086 assembly file
; by:czfshine
; date: 2018/03/31 15:46:49
;逆序输出字符串“BASED ADDRESSING”。
; The Main Data segment
DATA SEGMENT
string DB 'BASED ADDRESSING';
len equ $-string
DATA ENDS
;entry code segment
CODE SEGMENT
ASSUME CS:CODE ,DS:DATA
START: ;entry point
MOV AX,DATA
MOV DS,AX
MOV CX,len
L1:
MOV SI,CX
DEC SI ;;位置
LEA BX,string
MOV DL,[BX+SI]
MOV AH,02H
INT 21H
LOOP L1
MOV AH,4CH ;return
INT 21H
CODE ENDS
END START |
p7/MIPSMicroSystem/my_files/test/test.asm | t0ush1/ComputerOrganization | 2 | 166966 | <gh_stars>1-10
# AdEL_Instr
ori $1, $0, 0x300e
ori $2, $0, 0x2fff
ori $3, $0, 0x6ffd
jr $1
nop
jr $2
nop
jr $3
nop
jalr $31, $1
nop
jalr $31, $2
nop
jalr $31, $3
nop |
programs/oeis/077/A077966.asm | jmorken/loda | 1 | 161610 | <reponame>jmorken/loda<gh_stars>1-10
; A077966: Expansion of 1/(1+2*x^2).
; 1,0,-2,0,4,0,-8,0,16,0,-32,0,64,0,-128,0,256,0,-512,0,1024,0,-2048,0,4096,0,-8192,0,16384,0,-32768,0,65536,0,-131072,0,262144,0,-524288,0,1048576,0,-2097152,0,4194304,0,-8388608,0,16777216,0,-33554432,0,67108864,0,-134217728,0,268435456,0,-536870912,0,1073741824,0,-2147483648,0,4294967296,0,-8589934592,0,17179869184,0,-34359738368,0,68719476736,0,-137438953472,0,274877906944,0,-549755813888,0,1099511627776,0,-2199023255552,0,4398046511104,0,-8796093022208,0,17592186044416,0,-35184372088832,0,70368744177664,0,-140737488355328,0,281474976710656,0,-562949953421312,0,1125899906842624,0,-2251799813685248,0,4503599627370496,0,-9007199254740992,0
mov $1,1
sub $1,$0
gcd $1,2
add $1,1
mul $1,2
mov $3,1
mov $4,$0
add $4,6
mul $4,2
mov $2,$4
div $2,$1
sub $1,6
add $3,$2
pow $1,$3
div $1,16
|
programs/oeis/269/A269245.asm | neoneye/loda | 22 | 241756 | ; A269245: Number of times the digit 5 appears in the decimal expansion of n^3.
; 0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,1,1,0,0,0,0,0,2,1,0,1,0,0,0,0,1,0,1,1,2,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,0,1,1,1,1,1,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,1,1,0,2,2,0,1,1,2,1,1,1,1,2,0,0,0,2,0,1,1,2
pow $0,3
lpb $0
mov $2,$0
div $0,10
mod $2,10
cmp $2,5
add $1,$2
lpe
mov $0,$1
|
P6/data_P6_2/cal_R_same_test52.asm | alxzzhou/BUAA_CO_2020 | 1 | 175900 | <reponame>alxzzhou/BUAA_CO_2020<filename>P6/data_P6_2/cal_R_same_test52.asm
lui $1,45774
ori $1,$1,61653
lui $2,32348
ori $2,$2,4891
lui $3,26874
ori $3,$3,36813
lui $4,23499
ori $4,$4,10265
lui $5,30431
ori $5,$5,35883
lui $6,48842
ori $6,$6,50444
mthi $1
mtlo $2
sec0:
nop
nop
nop
and $4,$6,$6
sec1:
nop
nop
slt $6,$3,$3
and $1,$6,$6
sec2:
nop
nop
ori $6,$0,37808
and $2,$6,$6
sec3:
nop
nop
mfhi $6
and $5,$6,$6
sec4:
nop
nop
lh $6,12($0)
and $3,$6,$6
sec5:
nop
nor $6,$1,$3
nop
and $3,$6,$6
sec6:
nop
subu $6,$0,$3
slt $6,$2,$5
and $6,$6,$6
sec7:
nop
subu $6,$3,$2
xori $6,$5,46029
and $5,$6,$6
sec8:
nop
sltu $6,$2,$2
mfhi $6
and $1,$6,$6
sec9:
nop
nor $6,$1,$2
lb $6,8($0)
and $2,$6,$6
sec10:
nop
slti $6,$5,-24075
nop
and $2,$6,$6
sec11:
nop
xori $6,$2,53040
subu $6,$2,$2
and $1,$6,$6
sec12:
nop
andi $6,$3,39299
slti $6,$5,20453
and $2,$6,$6
sec13:
nop
addiu $6,$3,-22242
mfhi $6
and $2,$6,$6
sec14:
nop
addiu $6,$2,29588
lw $6,4($0)
and $3,$6,$6
sec15:
nop
mflo $6
nop
and $1,$6,$6
sec16:
nop
mfhi $6
sltu $6,$5,$3
and $5,$6,$6
sec17:
nop
mflo $6
slti $6,$4,-4201
and $6,$6,$6
sec18:
nop
mfhi $6
mfhi $6
and $3,$6,$6
sec19:
nop
mfhi $6
lbu $6,11($0)
and $2,$6,$6
sec20:
nop
lh $6,2($0)
nop
and $2,$6,$6
sec21:
nop
lhu $6,0($0)
or $6,$3,$6
and $3,$6,$6
sec22:
nop
lb $6,11($0)
sltiu $6,$1,-22740
and $2,$6,$6
sec23:
nop
lb $6,6($0)
mfhi $6
and $1,$6,$6
sec24:
nop
lw $6,12($0)
lbu $6,8($0)
and $1,$6,$6
sec25:
slt $6,$3,$6
nop
nop
and $4,$6,$6
sec26:
or $6,$5,$4
nop
and $6,$2,$0
and $4,$6,$6
sec27:
and $6,$0,$4
nop
addiu $6,$0,32585
and $5,$6,$6
sec28:
xor $6,$1,$1
nop
mfhi $6
and $3,$6,$6
sec29:
xor $6,$3,$3
nop
lbu $6,1($0)
and $4,$6,$6
sec30:
or $6,$0,$4
xor $6,$3,$2
nop
and $2,$6,$6
sec31:
sltu $6,$3,$3
nor $6,$4,$5
addu $6,$3,$2
and $4,$6,$6
sec32:
xor $6,$3,$1
xor $6,$1,$5
lui $6,63848
and $4,$6,$6
sec33:
slt $6,$5,$1
addu $6,$3,$1
mflo $6
and $3,$6,$6
sec34:
subu $6,$4,$3
or $6,$2,$2
lh $6,12($0)
and $1,$6,$6
sec35:
addu $6,$4,$3
lui $6,33570
nop
and $2,$6,$6
sec36:
addu $6,$2,$3
xori $6,$4,41349
xor $6,$3,$6
and $2,$6,$6
sec37:
nor $6,$4,$6
sltiu $6,$1,-32359
sltiu $6,$4,-10737
and $3,$6,$6
sec38:
or $6,$2,$2
sltiu $6,$5,-7305
mflo $6
and $6,$6,$6
sec39:
nor $6,$1,$5
andi $6,$4,7784
lbu $6,7($0)
and $3,$6,$6
sec40:
xor $6,$2,$5
mflo $6
nop
and $2,$6,$6
sec41:
and $6,$3,$5
mfhi $6
slt $6,$1,$4
and $3,$6,$6
sec42:
sltu $6,$1,$3
mfhi $6
slti $6,$2,-15062
and $2,$6,$6
sec43:
nor $6,$4,$4
mfhi $6
mfhi $6
and $5,$6,$6
sec44:
nor $6,$2,$2
mflo $6
lh $6,2($0)
and $5,$6,$6
sec45:
xor $6,$3,$4
lh $6,16($0)
nop
and $5,$6,$6
sec46:
nor $6,$3,$3
lh $6,6($0)
xor $6,$1,$2
and $3,$6,$6
sec47:
or $6,$3,$1
lhu $6,2($0)
xori $6,$3,45808
and $2,$6,$6
sec48:
and $6,$4,$6
lhu $6,2($0)
mflo $6
and $3,$6,$6
sec49:
sltu $6,$0,$5
lbu $6,12($0)
lhu $6,8($0)
and $3,$6,$6
sec50:
andi $6,$3,26032
nop
nop
and $6,$6,$6
sec51:
ori $6,$4,41349
nop
subu $6,$2,$3
and $4,$6,$6
sec52:
xori $6,$5,56743
nop
andi $6,$5,10819
and $1,$6,$6
sec53:
andi $6,$3,30230
nop
mfhi $6
and $4,$6,$6
sec54:
lui $6,5323
nop
lb $6,9($0)
and $4,$6,$6
sec55:
xori $6,$0,26623
subu $6,$4,$3
nop
and $3,$6,$6
sec56:
xori $6,$3,52218
slt $6,$1,$3
xor $6,$3,$4
and $6,$6,$6
sec57:
addiu $6,$0,-31227
sltu $6,$3,$4
xori $6,$2,10715
and $2,$6,$6
sec58:
sltiu $6,$5,24531
sltu $6,$4,$1
mfhi $6
and $2,$6,$6
sec59:
slti $6,$1,-30034
addu $6,$5,$4
lb $6,7($0)
and $3,$6,$6
sec60:
ori $6,$3,41644
addiu $6,$1,-1192
nop
and $0,$6,$6
sec61:
addiu $6,$3,-26871
ori $6,$2,4019
and $6,$2,$2
and $0,$6,$6
sec62:
sltiu $6,$6,9107
ori $6,$3,28253
andi $6,$1,36121
and $0,$6,$6
sec63:
addiu $6,$2,-32599
sltiu $6,$5,1830
mflo $6
and $1,$6,$6
sec64:
addiu $6,$1,15208
xori $6,$1,31194
lw $6,16($0)
and $3,$6,$6
sec65:
ori $6,$1,61264
mfhi $6
nop
and $3,$6,$6
sec66:
addiu $6,$4,-2403
mfhi $6
addu $6,$6,$3
and $6,$6,$6
sec67:
ori $6,$4,48805
mfhi $6
lui $6,52312
and $3,$6,$6
sec68:
sltiu $6,$2,-8364
mfhi $6
mfhi $6
and $2,$6,$6
sec69:
xori $6,$6,13532
mflo $6
lw $6,0($0)
and $3,$6,$6
sec70:
xori $6,$3,24760
lhu $6,2($0)
nop
and $3,$6,$6
sec71:
xori $6,$4,27893
lw $6,12($0)
and $6,$4,$3
and $3,$6,$6
sec72:
xori $6,$3,31813
lb $6,5($0)
addiu $6,$2,-1833
and $5,$6,$6
sec73:
lui $6,11845
lw $6,12($0)
mfhi $6
and $0,$6,$6
sec74:
sltiu $6,$2,-26238
lb $6,10($0)
lb $6,0($0)
and $5,$6,$6
sec75:
mflo $6
nop
nop
and $5,$6,$6
sec76:
mfhi $6
nop
subu $6,$4,$4
and $2,$6,$6
sec77:
mflo $6
nop
addiu $6,$3,1936
and $3,$6,$6
sec78:
mflo $6
nop
mfhi $6
and $4,$6,$6
sec79:
mflo $6
nop
lb $6,7($0)
and $5,$6,$6
sec80:
mfhi $6
xor $6,$3,$4
nop
and $0,$6,$6
sec81:
mfhi $6
sltu $6,$6,$4
addu $6,$6,$2
and $5,$6,$6
sec82:
mfhi $6
subu $6,$5,$2
xori $6,$0,10209
and $5,$6,$6
sec83:
mfhi $6
or $6,$2,$2
mfhi $6
and $3,$6,$6
sec84:
mfhi $6
nor $6,$6,$4
lhu $6,16($0)
and $1,$6,$6
sec85:
mfhi $6
addiu $6,$2,17880
nop
and $4,$6,$6
sec86:
mflo $6
slti $6,$1,18160
slt $6,$0,$4
and $4,$6,$6
sec87:
mflo $6
sltiu $6,$4,26795
lui $6,45190
and $2,$6,$6
sec88:
mflo $6
ori $6,$5,53409
mflo $6
and $5,$6,$6
sec89:
mflo $6
ori $6,$4,62240
lhu $6,16($0)
and $5,$6,$6
sec90:
mfhi $6
mflo $6
nop
and $3,$6,$6
sec91:
mfhi $6
mfhi $6
slt $6,$5,$2
and $3,$6,$6
sec92:
mfhi $6
mfhi $6
slti $6,$5,12020
and $3,$6,$6
sec93:
mflo $6
mflo $6
mfhi $6
and $4,$6,$6
sec94:
mfhi $6
mfhi $6
lb $6,0($0)
and $3,$6,$6
sec95:
mflo $6
lw $6,8($0)
nop
and $3,$6,$6
sec96:
mflo $6
lh $6,10($0)
sltu $6,$4,$5
and $6,$6,$6
sec97:
mfhi $6
lb $6,10($0)
addiu $6,$5,14049
and $2,$6,$6
sec98:
mfhi $6
lh $6,16($0)
mflo $6
and $1,$6,$6
sec99:
mflo $6
lh $6,2($0)
lhu $6,4($0)
and $5,$6,$6
sec100:
lw $6,16($0)
nop
nop
and $1,$6,$6
sec101:
lhu $6,10($0)
nop
subu $6,$4,$2
and $2,$6,$6
sec102:
lw $6,8($0)
nop
slti $6,$2,32301
and $4,$6,$6
sec103:
lhu $6,0($0)
nop
mflo $6
and $4,$6,$6
sec104:
lw $6,4($0)
nop
lhu $6,2($0)
and $5,$6,$6
sec105:
lbu $6,11($0)
or $6,$6,$3
nop
and $3,$6,$6
sec106:
lb $6,12($0)
addu $6,$0,$4
xor $6,$5,$3
and $0,$6,$6
sec107:
lb $6,1($0)
nor $6,$1,$5
addiu $6,$4,27903
and $6,$6,$6
sec108:
lhu $6,8($0)
slt $6,$2,$2
mfhi $6
and $5,$6,$6
sec109:
lw $6,12($0)
xor $6,$1,$3
lh $6,10($0)
and $1,$6,$6
sec110:
lhu $6,10($0)
sltiu $6,$3,10355
nop
and $6,$6,$6
sec111:
lbu $6,11($0)
lui $6,37901
sltu $6,$2,$2
and $2,$6,$6
sec112:
lb $6,1($0)
ori $6,$3,63476
addiu $6,$4,-20410
and $2,$6,$6
sec113:
lbu $6,0($0)
xori $6,$2,19783
mfhi $6
and $2,$6,$6
sec114:
lb $6,8($0)
slti $6,$2,26502
lbu $6,7($0)
and $4,$6,$6
sec115:
lb $6,1($0)
mfhi $6
nop
and $2,$6,$6
sec116:
lw $6,4($0)
mflo $6
subu $6,$3,$4
and $3,$6,$6
sec117:
lw $6,12($0)
mflo $6
lui $6,27982
and $3,$6,$6
sec118:
lhu $6,4($0)
mfhi $6
mflo $6
and $0,$6,$6
sec119:
lb $6,11($0)
mflo $6
lw $6,4($0)
and $4,$6,$6
sec120:
lbu $6,3($0)
lb $6,8($0)
nop
and $2,$6,$6
sec121:
lhu $6,4($0)
lbu $6,12($0)
addu $6,$3,$2
and $1,$6,$6
sec122:
lb $6,6($0)
lhu $6,10($0)
sltiu $6,$5,7326
and $4,$6,$6
sec123:
lb $6,4($0)
lb $6,6($0)
mfhi $6
and $3,$6,$6
sec124:
lbu $6,12($0)
lhu $6,12($0)
lbu $6,9($0)
and $1,$6,$6
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xa0_notsx.log_21829_350.asm | ljhsiun2/medusa | 9 | 92206 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r14
push %r15
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x1dbdd, %rsi
lea addresses_normal_ht+0x22dd, %rdi
xor $59949, %rbp
mov $37, %rcx
rep movsl
nop
nop
xor $32834, %rbx
lea addresses_normal_ht+0x1d7dd, %r14
nop
nop
nop
nop
and %r10, %r10
mov $0x6162636465666768, %rsi
movq %rsi, (%r14)
nop
nop
and $8462, %r10
lea addresses_WC_ht+0x9fdd, %rsi
lea addresses_D_ht+0x45d, %rdi
and %r15, %r15
mov $59, %rcx
rep movsq
nop
nop
nop
nop
inc %rbx
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %r15
pop %r14
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r13
push %r15
push %r8
push %rax
push %rbx
push %rdi
push %rsi
// Store
lea addresses_UC+0x3dd, %rax
nop
nop
and %r13, %r13
movl $0x51525354, (%rax)
xor %rbx, %rbx
// Faulty Load
lea addresses_UC+0x3dd, %r15
clflush (%r15)
nop
nop
nop
xor $15551, %rdi
vmovups (%r15), %ymm3
vextracti128 $0, %ymm3, %xmm3
vpextrq $1, %xmm3, %rax
lea oracles, %r8
and $0xff, %rax
shlq $12, %rax
mov (%r8,%rax,1), %rax
pop %rsi
pop %rdi
pop %rbx
pop %rax
pop %r8
pop %r15
pop %r13
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_UC', 'AVXalign': False, 'size': 8, 'NT': False, 'same': False, 'congruent': 0}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC', 'AVXalign': False, 'size': 4, 'NT': False, 'same': True, 'congruent': 0}}
[Faulty Load]
{'src': {'type': 'addresses_UC', 'AVXalign': False, 'size': 32, 'NT': False, 'same': True, 'congruent': 0}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_A_ht', 'congruent': 10, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_normal_ht', 'congruent': 7, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_normal_ht', 'AVXalign': False, 'size': 8, 'NT': False, 'same': False, 'congruent': 10}}
{'src': {'type': 'addresses_WC_ht', 'congruent': 10, 'same': True}, 'OP': 'REPM', 'dst': {'type': 'addresses_D_ht', 'congruent': 6, 'same': False}}
{'37': 21829}
37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37
*/
|
Practice/Assignments assembly class/8.asm | WardunIslam/CSE331L_Section_7_Summer_2020_NSU | 0 | 173639 | org 100h
L1: NOP
L2: MOV AX, 0000H
MOV DS, AX
MOV BX, 0000H
MOV AL, BYTE PTR DS:[BX]
L3: MOV CX, 0000H
MOV DS, CX
MOV BX, 0001H
MOV AH, BYTE PTR DS:[BX]
L4: CMP AL, AH
L5: JA L7
L6: MOV AL, AH
OUT 00H, AL
JMP L8
L7: OUT 00H, AL
L8: HLT
ret |
source/amf/mof/cmof/amf-visitors-generic_cmof_containment.adb | svn2github/matreshka | 24 | 28882 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.CMOF.Elements.Collections;
package body AMF.Visitors.Generic_CMOF_Containment is
procedure Visit_Owned_Elements
(Self : in out CMOF_Containment_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null access AMF.CMOF.Elements.CMOF_Element'Class;
Control : in out Traverse_Control);
-- Visit members of ownedElement of the element.
-----------------------
-- Visit_Association --
-----------------------
overriding procedure Visit_Association
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Associations.CMOF_Association_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Association;
-----------------
-- Visit_Class --
-----------------
overriding procedure Visit_Class
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Classes.CMOF_Class_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Class;
-------------------
-- Visit_Comment --
-------------------
overriding procedure Visit_Comment
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Comments.CMOF_Comment_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Comment;
----------------------
-- Visit_Constraint --
----------------------
overriding procedure Visit_Constraint
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Constraints.CMOF_Constraint_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Constraint;
---------------------
-- Visit_Data_Type --
---------------------
overriding procedure Visit_Data_Type
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Data_Types.CMOF_Data_Type_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Data_Type;
--------------------------
-- Visit_Element_Import --
--------------------------
overriding procedure Visit_Element_Import
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Element_Imports.CMOF_Element_Import_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Element_Import;
-----------------------
-- Visit_Enumeration --
-----------------------
overriding procedure Visit_Enumeration
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Enumerations.CMOF_Enumeration_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Enumeration;
-------------------------------
-- Visit_Enumeration_Literal --
-------------------------------
overriding procedure Visit_Enumeration_Literal
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Enumeration_Literals.CMOF_Enumeration_Literal_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Enumeration_Literal;
----------------------
-- Visit_Expression --
----------------------
overriding procedure Visit_Expression
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Expressions.CMOF_Expression_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Expression;
-----------------------------
-- Visit_Opaque_Expression --
-----------------------------
overriding procedure Visit_Opaque_Expression
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Opaque_Expressions.CMOF_Opaque_Expression_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Opaque_Expression;
---------------------
-- Visit_Operation --
---------------------
overriding procedure Visit_Operation
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Operations.CMOF_Operation_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Operation;
--------------------------
-- Visit_Owned_Elements --
--------------------------
procedure Visit_Owned_Elements
(Self : in out CMOF_Containment_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null access AMF.CMOF.Elements.CMOF_Element'Class;
Control : in out Traverse_Control)
is
Owned_Element : constant
AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element
:= Element.Get_Owned_Element;
begin
for J in 1 .. Owned_Element.Length loop
AMF.Visitors.Visit
(Self,
Visitor,
AMF.Elements.Element_Access (Owned_Element.Element (J)),
Control);
case Control is
when Continue =>
null;
when Abandon_Children =>
Control := Continue;
when Abandon_Sibling =>
Control := Continue;
exit;
when Terminate_Immediately =>
exit;
end case;
end loop;
end Visit_Owned_Elements;
-------------------
-- Visit_Package --
-------------------
overriding procedure Visit_Package
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Packages.CMOF_Package_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Package;
--------------------------
-- Visit_Package_Import --
--------------------------
overriding procedure Visit_Package_Import
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Package_Imports.CMOF_Package_Import_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Package_Import;
-------------------------
-- Visit_Package_Merge --
-------------------------
overriding procedure Visit_Package_Merge
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Package_Merges.CMOF_Package_Merge_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Package_Merge;
---------------------
-- Visit_Parameter --
---------------------
overriding procedure Visit_Parameter
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Parameters.CMOF_Parameter_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Parameter;
--------------------------
-- Visit_Primitive_Type --
--------------------------
overriding procedure Visit_Primitive_Type
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Primitive_Types.CMOF_Primitive_Type_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Primitive_Type;
--------------------
-- Visit_Property --
--------------------
overriding procedure Visit_Property
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Properties.CMOF_Property_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Property;
---------------
-- Visit_Tag --
---------------
overriding procedure Visit_Tag
(Self : in out CMOF_Containment_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.CMOF.Tags.CMOF_Tag_Access;
Control : in out AMF.Visitors.Traverse_Control) is
begin
Self.Visit_Owned_Elements (Visitor, Element, Control);
end Visit_Tag;
end AMF.Visitors.Generic_CMOF_Containment;
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/tail_call_p.adb | best08618/asylo | 7 | 25709 | <filename>gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/tail_call_p.adb<gh_stars>1-10
package body Tail_Call_P is
function Start_Side (Element : T) return Index is
begin
if Element = 1 then
raise Program_Error;
end if;
if Element = 0 then
return Second;
else
return First;
end if;
end;
function Segment (Element : T) return T is
begin
if Element /= 0 then
raise Program_Error;
end if;
return 1;
end;
procedure Really_Insert (Into : T; Element : T; Value : T) is
begin
if Into /= 0 then
raise Program_Error;
end if;
end;
procedure Insert (Into : A; Element : T; Value : T) is
begin
Really_Insert (Into (Start_Side (Element)), Segment (Element), Value);
end Insert;
end Tail_Call_P;
|
examples/testing.asm | antoshre/hack_asm_lifter | 0 | 5324 | @R0
D=M // D = first number
@R1
D=D-M // 85-50 = 30 > 0
@DGREATER
D;JGT
//DLESSER
@R1
D=M
@R2
M=D
@EXIT
0;JMP
(DGREATER)
@R0
D=M
@R2
M=D
@EXIT
0;JMP
(EXIT)
@EXIT
0;JMP |
DecompressionRoutines.asm | DevEd2/ScootTheBurbs | 5 | 103493 | <filename>DecompressionRoutines.asm
; ===============================
; RLE decompression routines
; INPUT: hl = source address
; de = destination address
; ===============================
Decompress_RLE:
ld a,[hl+]
ld b,a
.readLoop
ld a,[hl+]
ld c,a
ld a,[hl+]
.writeloop
ld [de],a
inc de
dec c
jr nz,.writeloop
dec b
jr nz,.readLoop
ret
;---------------------------------------------------------
; PRO-PACK Unpack Source Code - Nintendo Gameboy, Method 2
;
; Copyright [c] 1992 <NAME>
;
; File: RNC_2.S
;
; Date: 23.03.92
;
; V1.0 - Original
; V1.1 - Optimized by <NAME>, 99-Jul-25
; Unpacking is now ~7% faster.
;---------------------------------------------------------
HDLEN EQU 18
;---------------------------------------------------------
; PRO-PACK Unpack Routine - Gameboy, Method 2
;
; On entry,
; HL points to PACKED data in ROM
; DE points to RAM area for the UNPACKED data
; On exit,
; all general purpose registers are undefined - A,B,C,D,E,H,L.
; ROM bank not preserved
;---------------------------------------------------------
RNC_Unpack:
LD BC,HDLEN
ADD HL,BC
SCF
LD A,[HL+] ; NOTE: This data fetch requires that the data
ADC A,A ; pointed to by HL is in one ROM bank and that the
ADD A,A ; fetch will not cross ROM boundaries.
JP .XLOOP
;---------------------------------------------------------
.FETCH3:
LD A,[hl+]
ADC A,A
jr .BACK3
.FETCH4:
LD A,[hl+]
ADC A,A
jr .BACK4
.FETCH5:
LD A,[hl+]
ADC A,A
Jr .BACK5
.FETCH6:
LD A,[hl+]
ADC A,A
Jr .BACK6
.FETCH7:
LD A,[hl+]
ADC A,A
jr .BACK7
.RAW:
LD C,4
.X4BITS:
ADD A,A
JR Z,.FETCH7
.BACK7:
RL B
DEC C
JR NZ,.X4BITS
PUSH AF
LD A,3
ADD A,B
ADD A,A
LD C,A
.RAWLPB:
LD A,[hl+]
LD [DE],A
INC DE
LD A,[hl+]
LD [DE],A
INC DE
DEC C
JR NZ,.RAWLPB
POP AF
Jr .XLOOP
;---------------------------------------------------------
.FETCH0:
LD A,[hl+]
ADC A,A
JR C,.SMALLS
.GETLEN:
ADD A,A
JR Z,.FETCH3
.BACK3:
RL C
ADD A,A
JR Z,.FETCH4
.BACK4:
JR NC,.COPY
ADD A,A
JR Z,.FETCH5
.BACK5:
DEC C
PUSH HL
LD H,A
LD A,C
ADC A,A
LD C,A
CP 9
LD A,H
POP HL
JR Z,.RAW
;---------------------------------------------------------
.COPY:
ADD A,A
JR Z,.FETCH6
.BACK6:
JR NC,.BYTEDISP
ADD A,A
JR NZ,.SKIP0
LD A,[hl+]
ADC A,A
.SKIP0:
RL B
ADD A,A
JR NZ,.SKIP1
LD A,[hl+]
ADC A,A
.SKIP1:
JR C,.BIGDISP
INC B
DEC B
JR NZ,.BYTEDISP
INC B
.ANOTHER:
ADD A,A
JR NZ,.DISPX
LD A,[hl+]
ADC A,A
.DISPX:
RL B
.BYTEDISP:
PUSH AF
LD A,E
SUB [HL]
PUSH HL
LD L,A
LD A,D
SBC A,B
LD H,A
DEC HL
.BYTELP:
LD A,[hl+]
LD [DE],A
INC DE
DEC C
JR NZ,.BYTELP
POP HL
INC HL
POP AF
JR .XLOOP
;---------------------------------------------------------
.GETBITS:
LD A,[hl+]
ADC A,A
JR C,.STRING
.XBYTE:
ld b,a ; Took out 'push af' - JF, 99-Jul-25
LD A,[hl+]
LD [DE],A
INC DE
ld a,b ; Took out 'pop af' - JF, 99-Jul-25
.XLOOP:
ADD A,A
JR C,.CHKZ
ld b,a ; Took out 'push af' - JF, 99-Jul-25
LD A,[hl+]
LD [DE],A
INC DE
ld a,b ; Took out 'pop af' - JF, 99-Jul-25
ADD A,A
JR NC,.XBYTE
.CHKZ:
JR Z,.GETBITS
;---------------------------------------------------------
.STRING:
LD BC,2
ADD A,A
JR Z,.FETCH0
JR NC,.GETLEN
.SMALLS:
ADD A,A
JR Z,.FETCH1
.BACK1:
JR NC,.BYTEDISP
INC C
ADD A,A
JR Z,.FETCH2
.BACK2:
JR NC,.COPY
LD C,[HL]
INC HL
INC C
DEC C
JR Z,.OVERNOUT
PUSH AF
LD A,C
ADD A,8
LD C,A
POP AF
Jr .COPY
;---------------------------------------------------------
.BIGDISP:
ADD A,A
JR NZ,.SKIP2
LD A,[hl+]
ADC A,A
.SKIP2:
RL B
SET 2,B
ADD A,A
JR NZ,.SKIP3
LD A,[hl+]
ADC A,A
.SKIP3:
JR C,.BYTEDISP
Jr .ANOTHER
.FETCH1:
LD A,[hl+]
ADC A,A
jr .BACK1
.FETCH2:
LD A,[hl+]
ADC A,A
jr .BACK2
.OVERNOUT:
ADD A,A
JR NZ,.CHECK4END
LD A,[hl+]
ADC A,A
.CHECK4END:
JR C,.XLOOP
RET |
source/main.asm | svkampen/mangela_c64_demo | 0 | 22106 | main:
lda #5
sta ctr
jsr init_intr
jsr init_screen
jsr init_text
jsr sid_init
jsr sprite_init
jmp *
init_intr: ; set up the raster interrupt to fire at rasterline 0
sei
ldy #$7f
sty $dc0d
sty $dd0d
lda $dc0d
lda $dd0d
lda #$01
sta $d01a
lda #<irq
ldx #>irq
sta $314
stx $315
lda #$00
sta $d012
lda $d011
and #$7f
sta $d011
cli
rts
init_screen:
ldx #$00 ; set X to black
stx $d021 ; set background color
stx $d020 ; set border color
clear:
lda #$20 ; Spacebar
sta $0400,x
sta $0500,x
sta $0600,x
sta $06e8,x
lda #$00
sta $d800,x
sta $d900,x
sta $da00,x
sta $dae8,x
inx
bne clear
rts
init_text:
ldx #$00
loop_text:
lda line,x
sta $0540,x
lda line2,x
sta $0590,x
lda line3,x
sta $05e0,x
lda line4,x
sta $0630,x
inx
cpx #$28
bne loop_text
rts
irq:
lda #<irq2
sta $314
lda #>irq2
sta $315
lda #200
sta $d012
ldx #0
stx $d021
stx $d020
asl $d019
dec ctr
bne irq_end
lda #5
sta ctr
jsr colwash
jsr sprite_frame
; inc clr
; ldx clr
; cpx #13
; bne irq_end
;
; ldx #0
; stx clr
irq_end:
jmp irq_common_end
irq2:
ldx clr
wait_line:
lda $d012
cmp $d012
beq wait_line
stx $d020
stx $d021
irq2_end:
lda #<irq
sta $314
lda #>irq
sta $315
lda #0
sta $d012
asl $d019
jmp $ea81
irq_common_end: ; plays music, then ends interrupt handler
jsr sid_play
jmp $ea81
!source "source/data_colorwash.asm"
!source "source/sub_colorwash.asm"
line: !scr " marnix en angola zijn plopkoeken "
line2: !scr " jurriaan is een toffe peer "
line3: !scr " 't is hun verjaardag die we vieren "
line4: !scr " wanneer was die ook alweer? "
|
generated/natools-static_maps-web-tags-commands.ads | faelys/natools-web | 1 | 23006 | package Natools.Static_Maps.Web.Tags.Commands is
pragma Pure;
function Hash (S : String) return Natural;
end Natools.Static_Maps.Web.Tags.Commands;
|
awa/plugins/awa-storages/src/awa-storages-services.adb | fuzzysloth/ada-awa | 0 | 25657 | <filename>awa/plugins/awa-storages/src/awa-storages-services.adb
-----------------------------------------------------------------------
-- awa-storages-services -- Storage service
-- Copyright (C) 2012, 2013, 2016 <NAME>
-- Written by <NAME> (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Log.Loggers;
with Util.Strings;
with ADO.Objects;
with ADO.Queries;
with ADO.SQL;
with ADO.Statements;
with ADO.Sessions.Entities;
with AWA.Services.Contexts;
with AWA.Workspaces.Models;
with AWA.Workspaces.Modules;
with AWA.Permissions;
with AWA.Storages.Stores.Files;
package body AWA.Storages.Services is
use AWA.Services;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Storages.Services");
-- ------------------------------
-- Get the persistent store that manages the data store identified by <tt>Kind</tt>.
-- ------------------------------
function Get_Store (Service : in Storage_Service;
Kind : in AWA.Storages.Models.Storage_Type)
return AWA.Storages.Stores.Store_Access is
begin
return Service.Stores (Kind);
end Get_Store;
-- ------------------------------
-- Initializes the storage service.
-- ------------------------------
overriding
procedure Initialize (Service : in out Storage_Service;
Module : in AWA.Modules.Module'Class) is
Root : constant String := Module.Get_Config (Stores.Files.Root_Directory_Parameter.P);
Tmp : constant String := Module.Get_Config (Stores.Files.Tmp_Directory_Parameter.P);
begin
AWA.Modules.Module_Manager (Service).Initialize (Module);
Service.Stores (Storages.Models.DATABASE) := Service.Database_Store'Unchecked_Access;
Service.Stores (Storages.Models.FILE) := AWA.Storages.Stores.Files.Create_File_Store (Root);
Service.Stores (Storages.Models.TMP) := AWA.Storages.Stores.Files.Create_File_Store (Tmp);
Service.Database_Store.Tmp := Service.Stores (Storages.Models.TMP);
end Initialize;
-- ------------------------------
-- Create or save the folder.
-- ------------------------------
procedure Save_Folder (Service : in Storage_Service;
Folder : in out AWA.Storages.Models.Storage_Folder_Ref'Class) is
pragma Unreferenced (Service);
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
Workspace : AWA.Workspaces.Models.Workspace_Ref;
begin
if not Folder.Is_Null then
Workspace := AWA.Workspaces.Models.Workspace_Ref (Folder.Get_Workspace);
end if;
if Workspace.Is_Null then
AWA.Workspaces.Modules.Get_Workspace (DB, Ctx, Workspace);
Folder.Set_Workspace (Workspace);
end if;
-- Check that the user has the create folder permission on the given workspace.
AWA.Permissions.Check (Permission => ACL_Create_Folder.Permission,
Entity => Workspace);
Ctx.Start;
if not Folder.Is_Inserted then
Folder.Set_Create_Date (Ada.Calendar.Clock);
Folder.Set_Owner (Ctx.Get_User);
end if;
Folder.Save (DB);
Ctx.Commit;
end Save_Folder;
-- ------------------------------
-- Load the folder instance identified by the given identifier.
-- ------------------------------
procedure Load_Folder (Service : in Storage_Service;
Folder : in out AWA.Storages.Models.Storage_Folder_Ref'Class;
Id : in ADO.Identifier) is
pragma Unreferenced (Service);
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
begin
Folder.Load (Session => DB, Id => Id);
end Load_Folder;
-- ------------------------------
-- Load the storage instance identified by the given identifier.
-- ------------------------------
procedure Load_Storage (Service : in Storage_Service;
Storage : in out AWA.Storages.Models.Storage_Ref'Class;
Id : in ADO.Identifier) is
pragma Unreferenced (Service);
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Session := AWA.Services.Contexts.Get_Session (Ctx);
begin
Storage.Load (Session => DB, Id => Id);
end Load_Storage;
-- ------------------------------
-- Load the storage instance stored in a folder and identified by a name.
-- ------------------------------
procedure Load_Storage (Service : in Storage_Service;
Storage : in out AWA.Storages.Models.Storage_Ref'Class;
Folder : in ADO.Identifier;
Name : in String;
Found : out Boolean) is
pragma Unreferenced (Service);
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Session := AWA.Services.Contexts.Get_Session (Ctx);
Query : ADO.SQL.Query;
begin
Query.Bind_Param ("folder_id", Folder);
Query.Bind_Param ("name", Name);
Query.Set_Filter ("folder_id = :folder_id AND name = :name AND original_id IS NULL");
Storage.Find (Session => DB,
Query => Query,
Found => Found);
if not Found then
Log.Warn ("Storage file {0} not found in folder {1}",
Name, ADO.Identifier'Image (Folder));
end if;
end Load_Storage;
-- ------------------------------
-- Save the data object contained in the <b>Data</b> part element into the
-- target storage represented by <b>Into</b>.
-- ------------------------------
procedure Save (Service : in Storage_Service;
Into : in out AWA.Storages.Models.Storage_Ref'Class;
Data : in ASF.Parts.Part'Class;
Storage : in AWA.Storages.Models.Storage_Type) is
begin
Storage_Service'Class (Service).Save (Into, Data.Get_Local_Filename, Storage);
end Save;
-- ------------------------------
-- Save the file described <b>File</b> in the storage
-- object represented by <b>Into</b> and managed by the storage service.
-- ------------------------------
procedure Save (Service : in Storage_Service;
Into : in out AWA.Storages.Models.Storage_Ref'Class;
File : in AWA.Storages.Storage_File;
Storage : in AWA.Storages.Models.Storage_Type) is
begin
Storage_Service'Class (Service).Save (Into, AWA.Storages.Get_Path (File), Storage);
end Save;
-- ------------------------------
-- Save the file pointed to by the <b>Path</b> string in the storage
-- object represented by <b>Into</b> and managed by the storage service.
-- ------------------------------
procedure Save (Service : in Storage_Service;
Into : in out AWA.Storages.Models.Storage_Ref'Class;
Path : in String;
Storage : in AWA.Storages.Models.Storage_Type) is
use type AWA.Storages.Models.Storage_Type;
use type Stores.Store_Access;
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
Workspace : AWA.Workspaces.Models.Workspace_Ref;
Store : Stores.Store_Access;
Created : Boolean;
begin
Log.Info ("Save {0} in storage space", Path);
Into.Set_Storage (Storage);
Store := Storage_Service'Class (Service).Get_Store (Into.Get_Storage);
if Store = null then
Log.Error ("There is no store for storage {0}", Models.Storage_Type'Image (Storage));
end if;
if not Into.Is_Null then
Workspace := AWA.Workspaces.Models.Workspace_Ref (Into.Get_Workspace);
end if;
if Workspace.Is_Null then
AWA.Workspaces.Modules.Get_Workspace (DB, Ctx, Workspace);
Into.Set_Workspace (Workspace);
end if;
-- Check that the user has the create storage permission on the given workspace.
AWA.Permissions.Check (Permission => ACL_Create_Storage.Permission,
Entity => Workspace);
Ctx.Start;
Created := not Into.Is_Inserted;
if Created then
Into.Set_Create_Date (Ada.Calendar.Clock);
Into.Set_Owner (Ctx.Get_User);
end if;
Into.Save (DB);
Store.Save (DB, Into, Path);
Into.Save (DB);
-- Notify the listeners.
if Created then
Storage_Lifecycle.Notify_Create (Service, Into);
else
Storage_Lifecycle.Notify_Update (Service, Into);
end if;
Ctx.Commit;
end Save;
-- ------------------------------
-- Load the storage content identified by <b>From</b> into the blob descriptor <b>Into</b>.
-- Raises the <b>NOT_FOUND</b> exception if there is no such storage.
-- ------------------------------
procedure Load (Service : in Storage_Service;
From : in ADO.Identifier;
Name : out Ada.Strings.Unbounded.Unbounded_String;
Mime : out Ada.Strings.Unbounded.Unbounded_String;
Date : out Ada.Calendar.Time;
Into : out ADO.Blob_Ref) is
use type AWA.Storages.Models.Storage_Type;
use type AWA.Storages.Stores.Store_Access;
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
User : constant ADO.Identifier := Ctx.Get_User_Identifier;
DB : ADO.Sessions.Session := AWA.Services.Contexts.Get_Session (Ctx);
Query : ADO.Statements.Query_Statement
:= DB.Create_Statement (Models.Query_Storage_Get_Data);
Kind : AWA.Storages.Models.Storage_Type;
begin
Query.Bind_Param ("store_id", From);
Query.Bind_Param ("user_id", User);
ADO.Sessions.Entities.Bind_Param (Query, "table",
AWA.Workspaces.Models.WORKSPACE_TABLE, DB);
Query.Execute;
if not Query.Has_Elements then
Log.Warn ("Storage entity {0} not found", ADO.Identifier'Image (From));
raise ADO.Objects.NOT_FOUND;
end if;
Mime := Query.Get_Unbounded_String (0);
Date := Query.Get_Time (1);
Name := Query.Get_Unbounded_String (2);
Kind := AWA.Storages.Models.Storage_Type'Val (Query.Get_Integer (4));
if Kind = AWA.Storages.Models.DATABASE then
Into := Query.Get_Blob (5);
else
declare
Store : Stores.Store_Access;
Storage : AWA.Storages.Models.Storage_Ref;
File : AWA.Storages.Storage_File (TMP);
Found : Boolean;
begin
Store := Storage_Service'Class (Service).Get_Store (Kind);
if Store = null then
Log.Error ("There is no store for storage {0}", Models.Storage_Type'Image (Kind));
end if;
Storage.Load (DB, From, Found);
if not Found then
Log.Warn ("Storage entity {0} not found", ADO.Identifier'Image (From));
raise ADO.Objects.NOT_FOUND;
end if;
Store.Load (DB, Storage, File);
Into := ADO.Create_Blob (AWA.Storages.Get_Path (File));
end;
end if;
end Load;
-- Load the storage content into a file. If the data is not stored in a file, a temporary
-- file is created with the data content fetched from the store (ex: the database).
-- The `Mode` parameter indicates whether the file will be read or written.
-- The `Expire` parameter allows to control the expiration of the temporary file.
procedure Get_Local_File (Service : in Storage_Service;
From : in ADO.Identifier;
Mode : in Read_Mode := READ;
Into : in out Storage_File) is
use type Stores.Store_Access;
use type Models.Storage_Type;
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
User : constant ADO.Identifier := Ctx.Get_User_Identifier;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
Query : ADO.Queries.Context;
Found : Boolean;
Storage : AWA.Storages.Models.Storage_Ref;
Local : AWA.Storages.Models.Store_Local_Ref;
Store : Stores.Store_Access;
begin
if Into.Storage = AWA.Storages.DATABASE then
Log.Error ("'DATABASE' is not a valid storage type for local file");
return;
end if;
if Mode = READ then
Query.Set_Query (AWA.Storages.Models.Query_Storage_Get_Local);
Query.Bind_Param ("store_id", From);
Query.Bind_Param ("user_id", User);
ADO.Sessions.Entities.Bind_Param (Query, "table",
AWA.Workspaces.Models.WORKSPACE_TABLE, DB);
Local.Find (DB, Query, Found);
if Found then
Into.Path := Local.Get_Path;
Log.Info ("Load local file {0} path {1}", ADO.Identifier'Image (From),
Ada.Strings.Unbounded.To_String (Into.Path));
return;
end if;
end if;
Query.Set_Query (AWA.Storages.Models.Query_Storage_Get_Storage);
Query.Bind_Param ("store_id", From);
Query.Bind_Param ("user_id", User);
ADO.Sessions.Entities.Bind_Param (Query, "table",
AWA.Workspaces.Models.WORKSPACE_TABLE, DB);
Storage.Find (DB, Query, Found);
if not Found then
Log.Info ("File Id {0} not found", ADO.Identifier'Image (From));
raise ADO.Objects.NOT_FOUND;
end if;
Ctx.Start;
Store := Storage_Service'Class (Service).Get_Store (Storage.Get_Storage);
Store.Load (Session => DB,
From => Storage,
Into => Into);
Ctx.Commit;
Log.Info ("Load local file {0} path {1}", ADO.Identifier'Image (From),
Ada.Strings.Unbounded.To_String (Into.Path));
end Get_Local_File;
procedure Create_Local_File (Service : in out Storage_Service;
Into : in out AWA.Storages.Storage_File) is
use Ada.Strings.Unbounded;
Tmp : constant String := Service.Get_Config (Stores.Files.Tmp_Directory_Parameter.P);
Value : Integer;
begin
Util.Concurrent.Counters.Increment (Service.Temp_Id, Value);
Into.Path := To_Unbounded_String (Tmp & "/tmp-" & Util.Strings.Image (Value));
end Create_Local_File;
-- ------------------------------
-- Create a temporary file path.
-- ------------------------------
procedure Create (Service : in out Storage_Service;
Into : out AWA.Storages.Storage_File;
Storage : in AWA.Storages.Models.Storage_Type) is
use type Stores.Store_Access;
Store : Stores.Store_Access;
begin
Store := Storage_Service'Class (Service).Get_Store (Storage);
if Store = null then
Log.Error ("There is no store for storage {0}", Models.Storage_Type'Image (Storage));
end if;
end Create;
-- ------------------------------
-- Deletes the storage instance.
-- ------------------------------
procedure Delete (Service : in Storage_Service;
Storage : in out AWA.Storages.Models.Storage_Ref'Class) is
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
Id : constant ADO.Identifier := ADO.Objects.Get_Value (Storage.Get_Key);
begin
Log.Info ("Delete storage {0}", ADO.Identifier'Image (Id));
-- Check that the user has the delete storage permission on the given workspace.
AWA.Permissions.Check (Permission => ACL_Delete_Storage.Permission,
Entity => Storage);
Ctx.Start;
Storage_Lifecycle.Notify_Delete (Service, Storage);
Storage.Delete (DB);
Ctx.Commit;
end Delete;
-- ------------------------------
-- Deletes the storage instance.
-- ------------------------------
procedure Delete (Service : in Storage_Service;
Storage : in ADO.Identifier) is
use type Stores.Store_Access;
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
S : AWA.Storages.Models.Storage_Ref;
Query : ADO.Statements.Query_Statement
:= DB.Create_Statement (AWA.Storages.Models.Query_Storage_Delete_Local);
Store : Stores.Store_Access;
begin
Log.Info ("Delete storage {0}", ADO.Identifier'Image (Storage));
-- Check that the user has the delete storage permission on the given workspace.
AWA.Permissions.Check (Permission => ACL_Delete_Storage.Permission,
Entity => Storage);
Ctx.Start;
S.Load (Id => Storage, Session => DB);
Store := Storage_Service'Class (Service).Get_Store (S.Get_Storage);
if Store = null then
Log.Error ("There is no store associated with storage item {0}",
ADO.Identifier'Image (Storage));
else
Store.Delete (DB, S);
end if;
Storage_Lifecycle.Notify_Delete (Service, S);
-- Delete the storage instance and all storage that refer to it.
declare
Stmt : ADO.Statements.Delete_Statement
:= DB.Create_Statement (AWA.Storages.Models.STORAGE_TABLE);
begin
Stmt.Set_Filter (Filter => "id = ? OR original_id = ?");
Stmt.Add_Param (Value => Storage);
Stmt.Add_Param (Value => Storage);
Stmt.Execute;
end;
-- Delete the local storage instances.
Query.Bind_Param ("store_id", Storage);
Query.Execute;
S.Delete (DB);
Ctx.Commit;
end Delete;
-- ------------------------------
-- Publish or not the storage instance.
-- ------------------------------
procedure Publish (Service : in Storage_Service;
Id : in ADO.Identifier;
State : in Boolean;
File : in out AWA.Storages.Models.Storage_Ref'Class) is
pragma Unreferenced (Service);
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
DB : ADO.Sessions.Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
begin
Ctx.Start;
-- Check that the user has the permission to publish for the given comment.
AWA.Permissions.Check (Permission => ACL_Delete_Storage.Permission,
Entity => Id);
File.Load (DB, Id);
File.Set_Is_Public (State);
File.Save (DB);
declare
Update : ADO.Statements.Update_Statement
:= DB.Create_Statement (AWA.Storages.Models.STORAGE_TABLE);
begin
Update.Set_Filter (Filter => "original_id = ?");
Update.Save_Field ("is_public", State);
Update.Add_Param (Id);
Update.Execute;
end;
Ctx.Commit;
end Publish;
end AWA.Storages.Services;
|
applescripts/getTaskData.applescript | CassieKoelsch/asana-omnifocus-sync | 9 | 2394 | <filename>applescripts/getTaskData.applescript<gh_stars>1-10
use application "OmniFocus"
use O : script "omnifocus"
use json : script "json"
on run argv
set taskId to (item 1 of argv)
tell O
set foundContext to 0
try
set theContext to findContext("Asana")
set foundContext to 1
end try
if (foundContext is 0) then
set pendingTasks to allTasks()
else
set pendingTasks to every task of theContext whose completed is false
end if
repeat with theTask in pendingTasks
if (id of theTask = taskId) then
set json_dict to json's createDictWith({{"id", (id of theTask)}, {"name", (name of theTask)}, {"completed", (completed of theTask)}, {"due_on", (due date of theTask as string)}, {"notes", (note of theTask)}, {"created", (creation date of theTask as string)}, {"modified", (modification date of theTask as string)}})
return json's encode(json_dict)
exit repeat
end if
end repeat
-- may have been completed recently
if (foundContext is 0) then
set completedTasks to every flattened task of default document whose completed is true
else
set completedTasks to every task of theContext whose completed is true
end if
repeat with theTask in completedTasks
if (id of theTask = taskId) then
set json_dict to json's createDictWith({{"id", (id of theTask)}, {"name", (name of theTask)}, {"completed", (completed of theTask)}, {"due_on", (due date of theTask as string)}, {"notes", (note of theTask)}, {"created", (creation date of theTask as string)}, {"modified", (modification date of theTask as string)}})
return json's encode(json_dict)
exit repeat
end if
end repeat
end tell
end run |
projects/batfish/src/main/antlr4/org/batfish/grammar/flatjuniper/FlatJuniper_security.g4 | loftwah/batfish | 0 | 4609 | parser grammar FlatJuniper_security;
import FlatJuniper_common;
options {
tokenVocab = FlatJuniperLexer;
}
address_specifier
:
ANY
| ANY_IPV4
| ANY_IPV6
| name = variable
;
dh_group
:
GROUP1
| GROUP14
| GROUP15
| GROUP16
| GROUP19
| GROUP2
| GROUP20
| GROUP24
| GROUP5
;
encryption_algorithm
:
AES_128_CBC
| AES_128_GCM
| AES_192_CBC
| AES_192_GCM
| AES_256_CBC
| AES_256_GCM
| DES_CBC
| THREEDES_CBC
;
hib_protocol
:
ALL
| BFD
| BGP
| DVMRP
| IGMP
| LDP
| MSDP
| NHRP
| OSPF
| OSPF3
| PGM
| PIM
| RIP
| RIPNG
| ROUTER_DISCOVERY
| RSVP
| SAP
| VRRP
;
hib_system_service
:
ALL
| ANY_SERVICE
| DHCP
| DNS
| FINGER
| FTP
| HTTP
| HTTPS
| IDENT_RESET
| IKE
| LSPING
| NETCONF
| NTP
| PING
| R2CP
| REVERSE_SSH
| REVERSE_TELNET
| RLOGIN
| RPM
| RSH
| SIP
| SNMP
| SNMP_TRAP
| SSH
| TELNET
| TFTP
| TRACEROUTE
| XNM_CLEAR_TEXT
| XNM_SSL
;
ike_authentication_algorithm
:
MD5
| SHA_256
| SHA_384
| SHA1
;
ike_authentication_method
:
DSA_SIGNATURES
| PRE_SHARED_KEYS
| RSA_SIGNATURES
;
ipsec_authentication_algorithm
:
HMAC_MD5_96
| HMAC_SHA1_96
;
ipsec_protocol
:
AH
| BUNDLE
| ESP
;
nat_interface
:
INTERFACE
(
nati_port_overloading
| nati_port_overloading_factor
)
;
nat_pool
:
POOL name = variable
(
natp_address
| natp_description
| natp_port
| natp_routing_instance
)
;
nat_pool_utilization_alarm
:
POOL_UTILIZATION_ALARM null_filler
;
nat_pool_default_port_range
:
POOL_DEFAULT_PORT_RANGE low = DEC (TO high = DEC)?
;
nat_port_randomization
:
PORT_RANDOMIZATION DISABLE
;
nat_rule_set
:
RULE_SET name = variable
(
rs_packet_location
| rs_rule
)
;
nati_port_overloading
:
PORT_OVERLOADING OFF
;
nati_port_overloading_factor
:
PORT_OVERLOADING_FACTOR factor = DEC
;
natp_address
:
ADDRESS
(
prefix = IP_PREFIX
|
(
from = IP_ADDRESS TO to = IP_ADDRESS
)
|
(
from = IP_PREFIX TO to = IP_PREFIX
)
|
(
ip_address = IP_ADDRESS PORT port_num = DEC
)
)
;
natp_port
:
PORT
(
NO_TRANSLATION
| RANGE from = DEC (TO to = DEC)?
)
;
natp_description
:
DESCRIPTION null_filler
;
natp_routing_instance
:
ROUTING_INSTANCE name = variable
;
proposal_set_type
:
BASIC
| COMPATIBLE
| STANDARD
;
rs_interface
:
INTERFACE name = interface_id
;
rs_packet_location
:
(
FROM
| TO
)
(
rs_interface
| rs_routing_instance
| rs_zone
)
;
rs_routing_instance
:
ROUTING_INSTANCE name = variable
;
rs_rule
:
RULE name = variable
(
rsr_description
| rsr_match
| rsr_then
)
;
rs_zone
:
ZONE name = variable
;
rsr_description
:
DESCRIPTION null_filler
;
rsr_match
:
MATCH
(
rsrm_destination_address
| rsrm_destination_address_name
| rsrm_destination_port
| rsrm_source_address
| rsrm_source_address_name
| rsrm_source_port
)
;
rsr_then
:
THEN
(
rsrt_destination_nat
| rsrt_source_nat
| rsrt_static_nat
)
;
rsrm_destination_address
:
DESTINATION_ADDRESS IP_PREFIX
;
rsrm_destination_address_name
:
DESTINATION_ADDRESS_NAME name = variable
;
rsrm_destination_port
:
DESTINATION_PORT from = DEC
(
TO to = DEC
)?
;
rsrm_source_address
:
SOURCE_ADDRESS IP_PREFIX
;
rsrm_source_address_name
:
SOURCE_ADDRESS_NAME name = variable
;
rsrm_source_port
:
SOURCE_PORT from = DEC
(
TO to = DEC
)?
;
rsrt_destination_nat
:
DESTINATION_NAT
(
rsrt_nat_off
| rsrt_nat_pool
)
;
rsrt_nat_interface
:
INTERFACE
;
rsrt_nat_off
:
OFF
;
rsrt_nat_pool
:
POOL name = variable
(
rsrtnp_persistent_nat
)?
;
rsrt_source_nat
:
SOURCE_NAT
(
rsrt_nat_interface
| rsrt_nat_off
| rsrt_nat_pool
)
;
rsrt_static_nat
:
STATIC_NAT
(
rsrtst_prefix
| rsrtst_prefix_name
)
;
rsrtnp_persistent_nat
:
PERSISTENT_NAT
(
apply
| rsrtnpp_inactivity_timeout
| rsrtnpp_max_session_number
| rsrtnpp_permit
)
;
rsrtnpp_inactivity_timeout
:
INACTIVITY_TIMEOUT seconds = DEC
;
rsrtnpp_max_session_number
:
MAX_SESSION_NUMBER max = DEC
;
rsrtnpp_permit
:
PERMIT
(
ANY_REMOTE_HOST
| TARGET_HOST
| TARGET_HOST_PORT
)
;
rsrtst_prefix
:
PREFIX
(
rsrtstp_mapped_port
| rsrtstp_prefix
)
;
rsrtst_prefix_name
:
PREFIX_NAME
(
rsrtstp_prefix_name
| rsrtstp_routing_instance
)
;
rsrtstp_mapped_port
:
MAPPED_PORT low = DEC
(
TO high = DEC
)?
;
rsrtstp_prefix
:
IP_PREFIX
;
rsrtstp_prefix_name
:
name = variable
;
rsrtstp_routing_instance
:
ROUTING_INSTANCE name = variable
;
s_security
:
SECURITY
(
se_address_book
| se_authentication_key_chain
| se_certificates
| se_ike
| se_ipsec
| se_nat
| se_null
| se_policies
| se_screen
| se_zones
)
;
se_address_book
:
ADDRESS_BOOK name = variable
(
apply
| sead_address
| sead_address_set
| sead_attach
)
;
se_authentication_key_chain
:
AUTHENTICATION_KEY_CHAINS KEY_CHAIN name = string
(
sea_key
| sea_description
| sea_tolerance
)
;
se_certificates
:
CERTIFICATES
(
sec_local
)
;
se_ike
:
IKE
(
seik_gateway
| seik_policy
| seik_proposal
)
;
se_ipsec
:
IPSEC
(
seip_policy
| seip_proposal
| seip_vpn
)
;
se_nat
:
NAT
(
sen_destination
| sen_proxy_arp
| sen_source
| sen_static
)
;
se_null
:
(
ALG
| APPLICATION_TRACKING
| FLOW
| LOG
) null_filler
;
se_policies
:
POLICIES
(
sep_default_policy
| sep_from_zone
| sep_global
)
;
se_screen
:
SCREEN
(
ses_ids_option
| ses_null
)
;
se_zones
:
ZONES
(
apply
| sez_security_zone
)
;
sea_description
:
description
;
sea_key
:
KEY name = string
(
seak_algorithm
| seak_options
| seak_secret
| seak_start_time
)
;
sea_tolerance
:
TOLERANCE DEC
;
sead_address
:
ADDRESS name = variable
(
apply
| DESCRIPTION null_filler
| address = IP_ADDRESS
| prefix = IP_PREFIX
| WILDCARD_ADDRESS wildcard_address
)
;
sead_address_set
:
ADDRESS_SET name = variable
(
apply
| seada_address
| seada_address_set
| seada_description
)
;
sead_attach
:
ATTACH ZONE name = variable
;
seada_address
:
ADDRESS name = variable
;
seada_address_set
:
ADDRESS_SET name = variable
;
seada_description
:
DESCRIPTION null_filler
;
sec_local
:
LOCAL name = variable cert = DOUBLE_QUOTED_STRING
;
seak_algorithm
:
ALGORITHM
(
HMAC_SHA1
| MD5
)
;
seak_options
:
OPTIONS
(
BASIC
| ISIS_ENHANCED
)
;
seak_secret
:
SECRET key = string
;
seak_start_time
:
START_TIME time = variable_permissive
;
seik_gateway
:
GATEWAY name = variable
(
seikg_address
| seikg_dead_peer_detection
| seikg_dynamic
| seikg_external_interface
| seikg_ike_policy
| seikg_local_address
| seikg_local_identity
| seikg_no_nat_traversal
| seikg_version
| seikg_xauth
)
;
seik_policy
:
POLICY name = variable
(
seikp_description
| seikp_mode
| seikp_pre_shared_key
| seikp_proposal_set
| seikp_proposals
)
;
seik_proposal
:
PROPOSAL name = variable
(
seikpr_authentication_algorithm
| seikpr_authentication_method
| seikpr_description
| seikpr_dh_group
| seikpr_encryption_algorithm
| seikpr_lifetime_seconds
)
;
seikg_address
:
ADDRESS IP_ADDRESS
;
seikg_dead_peer_detection
:
DEAD_PEER_DETECTION ALWAYS_SEND?
;
seikg_dynamic
:
DYNAMIC
(
apply
| seikgd_connections_limit
| seikgd_hostname
| seikgd_ike_user_type
)
;
seikg_external_interface
:
EXTERNAL_INTERFACE interface_id
;
seikg_ike_policy
:
IKE_POLICY name = variable
;
seikg_local_address
:
LOCAL_ADDRESS IP_ADDRESS
;
seikg_local_identity
:
LOCAL_IDENTITY
(
seikgl_inet
)
;
seikg_no_nat_traversal
:
NO_NAT_TRAVERSAL
;
seikg_version
:
VERSION V1_ONLY
;
seikg_xauth
:
XAUTH ACCESS_PROFILE name = variable
;
seikgd_connections_limit
:
CONNECTIONS_LIMIT limit = DEC
;
seikgd_hostname
:
HOSTNAME name = variable
;
seikgd_ike_user_type
:
IKE_USER_TYPE
(
GROUP_IKE_ID
| SHARED_IKE_ID
)
;
seikgl_inet
:
INET name = variable
;
seikp_description
:
DESCRIPTION null_filler
;
seikp_mode
:
MODE
(
AGGRESSIVE
| MAIN
)
;
seikp_pre_shared_key
:
PRE_SHARED_KEY ASCII_TEXT key = DOUBLE_QUOTED_STRING
;
seikp_proposal_set
:
PROPOSAL_SET proposal_set_type
;
seikp_proposals
:
PROPOSALS OPEN_BRACKET
(
proposals += variable
)+
CLOSE_BRACKET
;
seikpr_authentication_algorithm
:
AUTHENTICATION_ALGORITHM ike_authentication_algorithm
;
seikpr_authentication_method
:
AUTHENTICATION_METHOD ike_authentication_method
;
seikpr_description
:
DESCRIPTION null_filler
;
seikpr_dh_group
:
DH_GROUP dh_group
;
seikpr_encryption_algorithm
:
ENCRYPTION_ALGORITHM encryption_algorithm
;
seikpr_lifetime_seconds
:
LIFETIME_SECONDS seconds = DEC
;
seip_policy
:
POLICY name = variable
(
seipp_perfect_forward_secrecy
| seipp_proposal_set
| seipp_proposals
)
;
seip_proposal
:
PROPOSAL name = variable
(
apply
| seippr_authentication_algorithm
| seippr_description
| seippr_encryption_algorithm
| seippr_lifetime_kilobytes
| seippr_lifetime_seconds
| seippr_protocol
)
;
seip_vpn
:
VPN name = variable
(
seipv_bind_interface
| seipv_df_bit
| seipv_establish_tunnels
| seipv_ike
| seipv_vpn_monitor
)
;
seipp_perfect_forward_secrecy
:
PERFECT_FORWARD_SECRECY KEYS dh_group
;
seipp_proposal_set
:
PROPOSAL_SET proposal_set_type
;
seipp_proposals
:
PROPOSALS OPEN_BRACKET
(
proposals += variable
)+
CLOSE_BRACKET
;
seippr_authentication_algorithm
:
AUTHENTICATION_ALGORITHM ipsec_authentication_algorithm
;
seippr_description
:
DESCRIPTION null_filler
;
seippr_encryption_algorithm
:
ENCRYPTION_ALGORITHM encryption_algorithm
;
seippr_lifetime_kilobytes
:
LIFETIME_KILOBYTES kilobytes = DEC
;
seippr_lifetime_seconds
:
LIFETIME_SECONDS seconds = DEC
;
seippr_protocol
:
PROTOCOL ipsec_protocol
;
seipv_bind_interface
:
BIND_INTERFACE interface_id
;
seipv_df_bit
:
DF_BIT CLEAR
;
seipv_establish_tunnels
:
ESTABLISH_TUNNELS IMMEDIATELY
;
seipv_ike
:
IKE
(
seipvi_gateway
| seipvi_ipsec_policy
| seipvi_null
| seipvi_proxy_identity
)
;
seipv_vpn_monitor
:
VPN_MONITOR
(
apply
| seipvv_destination_ip
| seipvv_source_interface
)
;
seipvi_gateway
:
GATEWAY name = variable
;
seipvi_ipsec_policy
:
IPSEC_POLICY name = variable
;
seipvi_null
:
(
NO_ANTI_REPLAY
) null_filler
;
seipvi_proxy_identity
:
PROXY_IDENTITY
(
seipvip_local
| seipvip_remote
| seipvip_service
)
;
seipvip_local
:
LOCAL IP_PREFIX
;
seipvip_remote
:
REMOTE IP_PREFIX
;
seipvip_service
:
SERVICE
(
ANY
| name = variable
)
;
seipvv_destination_ip
:
DESTINATION_IP IP_ADDRESS
;
seipvv_source_interface
:
SOURCE_INTERFACE interface_id
;
sen_destination
:
DESTINATION
(
nat_rule_set
| nat_interface
| nat_pool
| nat_pool_utilization_alarm
| nat_port_randomization
)
;
sen_proxy_arp
:
PROXY_ARP
(
apply
| senp_interface
)
;
sen_source
:
SOURCE
(
nat_rule_set
| nat_interface
| nat_pool
| nat_pool_utilization_alarm
| nat_port_randomization
| nat_pool_default_port_range
)
;
sen_static
:
STATIC nat_rule_set
;
senp_interface
:
INTERFACE interface_id
(
apply
| senpi_address
)
;
senpi_address
:
ADDRESS
(
from = IP_ADDRESS
| from = IP_PREFIX
)
(
TO
(
to = IP_ADDRESS
| to = IP_PREFIX
)
)?
;
sep_default_policy
:
DEFAULT_POLICY
(
apply
| DENY_ALL
| PERMIT_ALL
)
;
sep_from_zone
:
FROM_ZONE from = zone TO_ZONE to = zone
(
apply
| sepctx_policy
)
;
sep_global
:
GLOBAL
(
apply
| sepctx_policy
)
;
sepctx_policy
:
POLICY name = variable_policy
(
apply
| sepctxp_description
| sepctxp_match
| sepctxp_then
)
;
sepctxp_description
:
DESCRIPTION null_filler
;
sepctxp_match
:
MATCH
(
sepctxpm_application
| sepctxpm_destination_address
| sepctxpm_destination_address_excluded
| sepctxpm_source_address
| sepctxpm_source_identity
)
;
sepctxp_then
:
THEN
(
sepctxpt_count
| sepctxpt_deny
| sepctxpt_log
| sepctxpt_permit
| sepctxpt_trace
)
;
sepctxpm_application
:
APPLICATION
(
junos_application
| junos_application_set
| name = variable
)
;
sepctxpm_destination_address
:
DESTINATION_ADDRESS address_specifier
;
sepctxpm_destination_address_excluded
:
DESTINATION_ADDRESS_EXCLUDED
;
sepctxpm_source_address
:
SOURCE_ADDRESS address_specifier
;
sepctxpm_source_identity
:
SOURCE_IDENTITY
(
ANY
| name = variable
)
;
sepctxpt_count
:
COUNT
;
sepctxpt_deny
:
DENY
| REJECT
;
sepctxpt_log
:
LOG null_filler
;
sepctxpt_permit
:
PERMIT
(
apply
| sepctxptp_tunnel
)
;
sepctxpt_trace
:
TRACE
;
sepctxptp_tunnel
:
TUNNEL
(
apply
| sepctxptpt_ipsec_vpn
)
;
sepctxptpt_ipsec_vpn
:
IPSEC_VPN name = variable
;
ses_ids_option
:
IDS_OPTION name = variable
(
seso_alarm
| seso_description
| seso_icmp
| seso_ip
| seso_tcp
| seso_udp
| seso_limit_session
)+
;
ses_null
:
( TRACEOPTIONS | TRAP ) null_filler
;
seso_alarm
:
ALARM_WITHOUT_DROP
;
seso_description
:
DESCRIPTION string
;
seso_icmp
:
ICMP
(
sesoi_flood
| sesoi_fragment
| sesoi_icmpv6_malformed
| sesoi_ip_sweep
| sesoi_large
| sesoi_ping_death
)
;
seso_ip
:
IP
(
sesop_bad_option
| sesop_block_frag
| sesop_ipv6_extension_header
| sesop_ipv6_extension_header_limit
| sesop_ipv6_malformed_header
| sesop_loose_source_route_option
| sesop_record_route_option
| sesop_security_option
| sesop_source_route_option
| sesop_spoofing
| sesop_stream_option
| sesop_strict_source_route_option
| sesop_tear_drop
| sesop_timestamp_option
| sesop_unknown_protocol
| sesop_tunnel
)
;
seso_limit_session
:
LIMIT_SESSION
(
DESTINATION_IP_BASED DEC
| SOURCE_IP_BASED DEC
)
;
seso_tcp
:
TCP
(
sesot_fin_no_ack
| sesot_land
| sesot_port_scan
| sesot_syn_ack_ack_proxy
| sesot_syn_fin
| sesot_syn_flood
| sesot_syn_frag
| sesot_tcp_no_flag
| sesot_tcp_sweep
| sesot_winnuke
)
;
seso_udp
:
UDP
(
sesou_flood
| sesou_port_scan
| sesou_udp_sweep
)
;
sesoi_flood
:
FLOOD threshold
;
sesoi_fragment
:
FRAGMENT
;
sesoi_icmpv6_malformed
:
ICMPV6_MALFORMED
;
sesoi_ip_sweep
:
IP_SWEEP threshold
;
sesoi_large
:
LARGE
;
sesoi_ping_death
:
PING_DEATH
;
sesop_bad_option
:
BAD_OPTION
;
sesop_block_frag
:
BLOCK_FRAG
;
sesop_ipv6_extension_header
:
IPV6_EXTENSION_HEADER
(
AH_HEADER
| ESP_HEADER
| HIP_HEADER
| sesop6_dst_header
| FRAGMENT_HEADER
| sesop6_hop_header
| MOBILITY_HEADER
| NO_NEXT_HEADER
| ROUTING_HEADER
| SHIM6_HEADER
| sesop6_user_option
)
;
sesop_ipv6_extension_header_limit
:
IPV6_EXTENSION_HEADER_LIMIT limit=DEC
;
sesop_ipv6_malformed_header
:
IPV6_MALFORMED_HEADER
;
sesop_loose_source_route_option
:
LOOSE_SOURCE_ROUTE_OPTION
;
sesop_record_route_option
:
RECORD_ROUTE_OPTION
;
sesop_security_option
:
SECURITY_OPTION
;
sesop_source_route_option
:
SOURCE_ROUTE_OPTION
;
sesop_spoofing
:
SPOOFING
;
sesop_stream_option
:
STREAM_OPTION
;
sesop_strict_source_route_option
:
STRICT_SOURCE_ROUTE_OPTION
;
sesop_tear_drop
:
TEAR_DROP
;
sesop_timestamp_option
:
TIMESTAMP_OPTION
;
sesop_tunnel
:
TUNNEL
(
sesopt_gre
| sesopt_ip_in_udp
| sesopt_ipip
| BAD_INNER_HEADER
)
;
sesop_unknown_protocol
:
UNKNOWN_PROTOCOL
;
sesop6_dst_header
:
DESTINATION_HEADER
(
ILNP_NONCE_OPTION
| HOME_ADDRESS_OPTION
| LINE_IDENTIFICATION_OPTION
| TUNNEL_ENCAPSULATION_LIMIT_OPTION
| sesop6_user_option
)
;
sesop6_hop_header
:
HOP_BY_HOP_HEADER
(
CALIPSO_OPTION
| RPL_OPTION
| SFM_DPD_OPTION
| JUMBO_PAYLOAD_OPTION
| QUICK_START_OPTION
| ROUTER_ALERT_OPTION
| sesop6_user_option
)
;
sesop6_user_option
:
USER_DEFINED_OPTION_TYPE type_low=DEC (TO type_high=DEC)?
;
sesot_fin_no_ack
:
FIN_NO_ACK
;
sesot_land
:
LAND
;
sesot_port_scan
:
PORT_SCAN threshold
;
sesot_syn_ack_ack_proxy
:
SYN_ACK_ACK_PROXY threshold
;
sesot_syn_fin
:
SYN_FIN
;
sesot_syn_flood
:
SYN_FLOOD
(
sesots_alarm_thred
| sesots_attack_thred
| sesots_dst_thred
| sesots_src_thred
| sesots_timeout
| sesots_whitelist
)
;
sesot_syn_frag
:
SYN_FRAG
;
sesot_tcp_no_flag
:
TCP_NO_FLAG
;
sesot_tcp_sweep
:
TCP_SWEEP threshold
;
sesot_winnuke
:
WINNUKE
;
sesots_alarm_thred
:
ALARM_THRESHOLD number=DEC
;
sesots_attack_thred
:
ATTACK_THRESHOLD number=DEC
;
sesots_dst_thred
:
DESTINATION_THRESHOLD number=DEC
;
sesots_src_thred
:
SOURCE_THRESHOLD number=DEC
;
sesots_timeout
:
TIMEOUT seconds=DEC
;
sesots_whitelist
:
WHITE_LIST name=variable
(
sesotsw_dst
| sesotsw_src
)*
;
sesotsw_dst
:
DESTINATION_ADDRESS address=IP_ADDRESS
;
sesotsw_src
:
SOURCE_ADDRESS address=IP_ADDRESS
;
sesou_flood
:
FLOOD threshold
;
sesou_port_scan
:
PORT_SCAN threshold
;
sesou_udp_sweep
:
UDP_SWEEP threshold
;
sesopt_gre
:
GRE
(
GRE_4IN4
| GRE_4IN6
| GRE_6IN4
| GRE_6IN6
)
;
sesopt_ip_in_udp
:
IP_IN_UDP TEREDO
;
sesopt_ipip
:
IPIP
(
IPIP_4IN4
| IPIP_4IN6
| IPIP_6IN4
| IPIP_6IN6
| IPIP_6OVER4
| IPIP_6TO4RELAY
| ISATAP
| DSLITE
)
;
sez_security_zone
:
SECURITY_ZONE zone
(
apply
| sezs_address_book
| sezs_application_tracking
| sezs_host_inbound_traffic
| sezs_interfaces
| sezs_screen
| sezs_tcp_rst
)
;
sezs_address_book
:
ADDRESS_BOOK
(
apply
| sezsa_address
| sezsa_address_set
)
;
sezs_application_tracking
:
APPLICATION_TRACKING
;
sezs_host_inbound_traffic
:
HOST_INBOUND_TRAFFIC
(
apply
| sezsh_protocols
| sezsh_system_services
)
;
sezs_interfaces
:
INTERFACES interface_id
(
apply
| sezs_host_inbound_traffic
)
;
sezs_screen
:
SCREEN
(
UNTRUST_SCREEN
| name = variable
)
;
sezs_tcp_rst
:
TCP_RST
;
sezsa_address
:
ADDRESS name = variable
(
apply
| address = IP_ADDRESS
| prefix = IP_PREFIX
| WILDCARD_ADDRESS wildcard_address
)
;
sezsa_address_set
:
ADDRESS_SET name = variable
(
apply
| sezsaad_address
| sezsaad_address_set
)
;
sezsaad_address
:
ADDRESS name = variable
;
sezsaad_address_set
:
ADDRESS_SET name = variable
;
sezsh_protocols
:
PROTOCOLS hib_protocol
;
sezsh_system_services
:
SYSTEM_SERVICES hib_system_service
;
zone
:
JUNOS_HOST
| TRUST
| UNTRUST
| name = variable
;
|
memsim-master/src/memory-join.adb | strenkml/EE368 | 0 | 13017 |
with Ada.Assertions; use Ada.Assertions;
with Memory.Container; use Memory.Container;
package body Memory.Join is
function Create_Join(parent : access Wrapper_Type'Class;
index : Natural) return Join_Pointer is
result : constant Join_Pointer := new Join_Type;
begin
result.parent := parent;
result.index := index;
return result;
end Create_Join;
function Clone(mem : Join_Type) return Memory_Pointer is
result : constant Join_Pointer := new Join_Type'(mem);
begin
return Memory_Pointer(result);
end Clone;
procedure Read(mem : in out Join_Type;
address : in Address_Type;
size : in Positive) is
begin
Forward_Read(mem.parent.all, mem.index, address, size);
end Read;
procedure Write(mem : in out Join_Type;
address : in Address_Type;
size : in Positive) is
begin
Forward_Write(mem.parent.all, mem.index, address, size);
end Write;
function Get_Writes(mem : Join_Type) return Long_Integer is
begin
Assert(False, "Memory.Join.Get_Writes not implemented");
return 0;
end Get_Writes;
function To_String(mem : Join_Type) return Unbounded_String is
begin
return To_Unbounded_String("(join)");
end To_String;
function Get_Cost(mem : Join_Type) return Cost_Type is
begin
return 0;
end Get_Cost;
function Get_Word_Size(mem : Join_Type) return Positive is
begin
return Get_Word_Size(mem.parent.all);
end Get_Word_Size;
function Get_Ports(mem : Join_Type) return Port_Vector_Type is
result : Port_Vector_Type;
begin
Assert(False, "Memory.Join.Get_Ports should not be called");
return result;
end Get_Ports;
procedure Generate(mem : in Join_Type;
sigs : in out Unbounded_String;
code : in out Unbounded_String) is
name : constant String := "m" & To_String(Get_ID(mem));
word_bits : constant Natural := 8 * Get_Word_Size(mem);
begin
Declare_Signals(sigs, name, word_bits);
end Generate;
function Get_Path_Length(mem : Join_Type) return Natural is
next : constant Memory_Pointer := Get_Memory(mem.parent.all);
jl : constant Natural := Get_Join_Length(mem.parent.all);
begin
return jl + Get_Path_Length(next.all);
end Get_Path_Length;
procedure Adjust(mem : in out Join_Type) is
begin
Adjust(Memory_Type(mem));
mem.parent := null;
end Adjust;
procedure Set_Parent(mem : in out Join_Type;
parent : access Wrapper_Type'Class) is
begin
mem.parent := parent;
end Set_Parent;
function Find_Join(mem : Memory_Pointer) return Join_Pointer is
begin
if mem.all in Join_Type'Class then
return Join_Pointer(mem);
else
declare
cp : constant Container_Pointer := Container_Pointer(mem);
begin
return Find_Join(Get_Memory(cp.all));
end;
end if;
end Find_Join;
end Memory.Join;
|
libsrc/graphics/cpc/putsprite3.asm | dex4er/deb-z88dk | 1 | 179138 | <reponame>dex4er/deb-z88dk
;
; Sprite Rendering Routine - Amstrad CPC version
; original code by <NAME> (TI 85)
; modified by <NAME> - Jul 2004
;
; Sept 2003 - Stefano: Fixed bug for sprites wider than 8.
;
; Much More Generic version
; Uses plotpixel, respixel and xorpixel
;
; This is a variant, even slower, of putsprite3.
; It is based on the BIOS calls, so it should be more flexible and compact.
; The XOR mode is totally untested.
;
;
; $Id: putsprite3.asm,v 1.2 2007/07/21 21:28:22 dom Exp $
;
XLIB putsprite
INCLUDE "#cpcfirm.def"
INCLUDE "graphics/grafix.inc"
; coords: h,l (vert-horz)
; sprite: (ix)
.putsprite
ld hl,2
add hl,sp
ld e,(hl)
inc hl
ld d,(hl) ;sprite address
push de
pop ix
inc hl
ld e,(hl)
inc hl
inc hl
ld d,(hl) ; x and y coords
inc hl
inc hl
ld a,(hl) ; and/or/xor mode
; 166 - and
; 182 - or
; 174 - xor
cp 166 ; and(hl) opcode
jr nz,noand
push de
ld a,bcolor
call firmware
defw gra_set_pen
pop de
jr modeset
.noand
cp 174 ; xor(hl) opcode
jr nz,modeset ; Probably we have an "OR"
push de
ld a,1 ; XOR
call firmware
defw scr_access
pop de
.modeset
ld h,d
ld l,e
ld a,(ix+0) ; Width
ld b,(ix+1) ; Height
.oloopx push bc ;Save # of rows
push af
;ld b,a ;Load width
ld b,0 ; Better, start from zero !!
ld c,(ix+2) ;Load one line of image
.iloopx sla c ;Test leftmost pixel
jr nc,noplotx ;See if a plot is needed
pop af
push af
push hl
push bc
push de
ld a,h
add a,b
ld h,a
ld a,maxy
sub l
ld e,h
ld h,0
ld d,h
ld l,a
;ld h,0
;ld d,h
;ld e,a
and a ; double size (?)
rl l
rl h
and a
rl e
rl d
call firmware
defw gra_plot_absolute
pop de
pop bc
pop hl
.noplotx
inc b ; witdh counter
pop af
push af
cp b ; end of row ?
jr nz,noblkx
inc ix
ld c,(ix+2) ;Load next byte of image
jr noblockx
.noblkx
ld a,b ; next byte in row ?
;dec a
and a
jr z,iloopx
and 7
jr nz,iloopx
.blockx
inc ix
ld c,(ix+2) ;Load next byte of image
jr iloopx
.noblockx
inc l
pop af
pop bc ;Restore data
djnz oloopx
ld a,fcolor ;Restore fore color
call firmware
defw gra_set_pen
ld a,0 ; FORCE mode (OR)
call firmware
defw scr_access
ret
|
alloy4fun_models/trainstlt/models/2/Ss4mYa6Db6NMhAwQB.als | Kaixi26/org.alloytools.alloy | 0 | 3744 | open main
pred idSs4mYa6Db6NMhAwQB_prop3 {
no pos
}
pred __repair { idSs4mYa6Db6NMhAwQB_prop3 }
check __repair { idSs4mYa6Db6NMhAwQB_prop3 <=> prop3o } |
Applescript/Cue_List_Toggle.applescript | dustindmiller/QTableTop | 1 | 238 | <filename>Applescript/Cue_List_Toggle.applescript
tell application id "com.figure53.QLab.4" to tell front workspace
if q name of current cue list is "QTableTop - List" or q name of current cue list is "QTableTop - Cart" then
set current cue list to first cue list whose q name is "Adventure Content"
set q name of cue "Cue List Toggle" to "Adventure Content"
return
end if
if q name of current cue list is "Adventure Content" then
set current cue list to first cue list whose q name is "QTableTop - List"
set q name of cue "Cue List Toggle" to "QTableTop - List"
return
end if
return
end tell |
programs/oeis/280/A280097.asm | neoneye/loda | 22 | 172901 | <gh_stars>10-100
; A280097: Sum of the divisors of 24*n - 1.
; 24,48,72,120,144,168,168,192,264,240,264,336,312,408,360,384,456,432,672,480,504,576,600,744,600,720,648,744,840,720,744,840,912,984,840,864,888,912,1296,1104,984,1080,1032,1272,1176,1104,1368,1152,1488,1320,1224,1320,1344,1824,1320
mul $0,2
add $0,1
mul $0,2
add $0,1
mul $0,6
add $0,4
seq $0,203 ; a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).
|
firmware/coreboot/src/drivers/intel/gma/gma.ads | fabiojna02/OpenCellular | 1 | 24531 | <filename>firmware/coreboot/src/drivers/intel/gma/gma.ads
with Interfaces.C;
with HW;
use HW;
package GMA
is
procedure gfxinit (lightup_ok : out Interfaces.C.int);
pragma Export (C, gfxinit, "gma_gfxinit");
----------------------------------------------------------------------------
type lb_framebuffer is record
tag : word32;
size : word32;
physical_address : word64;
x_resolution : word32;
y_resolution : word32;
bytes_per_line : word32;
bits_per_pixel : word8;
red_mask_pos : word8;
red_mask_size : word8;
green_mask_pos : word8;
green_mask_size : word8;
blue_mask_pos : word8;
blue_mask_size : word8;
reserved_mask_pos : word8;
reserved_mask_size : word8;
end record;
function fill_lb_framebuffer
(framebuffer : in out lb_framebuffer)
return Interfaces.C.int;
pragma Export (C, fill_lb_framebuffer, "fill_lb_framebuffer");
end GMA;
|
vp8/encoder/x86/quantize_sse2.asm | CM-Archive/android_external_libvpx | 0 | 179270 | <gh_stars>0
;
; Copyright (c) 2010 The WebM project authors. All Rights Reserved.
;
; Use of this source code is governed by a BSD-style license and patent
; grant that can be found in the LICENSE file in the root of the source
; tree. All contributing project authors may be found in the AUTHORS
; file in the root of the source tree.
;
%include "vpx_ports/x86_abi_support.asm"
;int vp8_regular_quantize_b_impl_sse2(short *coeff_ptr, short *zbin_ptr,
; short *qcoeff_ptr,short *dequant_ptr,
; const int *default_zig_zag, short *round_ptr,
; short *quant_ptr, short *dqcoeff_ptr,
; unsigned short zbin_oq_value,
; short *zbin_boost_ptr);
;
global sym(vp8_regular_quantize_b_impl_sse2)
sym(vp8_regular_quantize_b_impl_sse2):
push rbp
mov rbp, rsp
SHADOW_ARGS_TO_STACK 10
push rsi
push rdi
push rbx
; end prolog
ALIGN_STACK 16, rax
%define abs_minus_zbin_lo 0
%define abs_minus_zbin_hi 16
%define temp_qcoeff_lo 32
%define temp_qcoeff_hi 48
%define save_xmm6 64
%define save_xmm7 80
%define eob 96
%define vp8_regularquantizeb_stack_size eob + 16
sub rsp, vp8_regularquantizeb_stack_size
movdqa OWORD PTR[rsp + save_xmm6], xmm6
movdqa OWORD PTR[rsp + save_xmm7], xmm7
mov rdx, arg(0) ;coeff_ptr
mov eax, arg(8) ;zbin_oq_value
mov rcx, arg(1) ;zbin_ptr
movd xmm7, eax
movdqa xmm0, OWORD PTR[rdx]
movdqa xmm4, OWORD PTR[rdx + 16]
movdqa xmm1, xmm0
movdqa xmm5, xmm4
psraw xmm0, 15 ;sign of z (aka sz)
psraw xmm4, 15 ;sign of z (aka sz)
pxor xmm1, xmm0
pxor xmm5, xmm4
movdqa xmm2, OWORD PTR[rcx] ;load zbin_ptr
movdqa xmm3, OWORD PTR[rcx + 16] ;load zbin_ptr
pshuflw xmm7, xmm7, 0
psubw xmm1, xmm0 ;x = abs(z)
punpcklwd xmm7, xmm7 ;duplicated zbin_oq_value
psubw xmm5, xmm4 ;x = abs(z)
paddw xmm2, xmm7
paddw xmm3, xmm7
psubw xmm1, xmm2 ;sub (zbin_ptr + zbin_oq_value)
psubw xmm5, xmm3 ;sub (zbin_ptr + zbin_oq_value)
mov rdi, arg(5) ;round_ptr
mov rsi, arg(6) ;quant_ptr
movdqa OWORD PTR[rsp + abs_minus_zbin_lo], xmm1
movdqa OWORD PTR[rsp + abs_minus_zbin_hi], xmm5
paddw xmm1, xmm2 ;add (zbin_ptr + zbin_oq_value) back
paddw xmm5, xmm3 ;add (zbin_ptr + zbin_oq_value) back
movdqa xmm2, OWORD PTR[rdi]
movdqa xmm3, OWORD PTR[rsi]
movdqa xmm6, OWORD PTR[rdi + 16]
movdqa xmm7, OWORD PTR[rsi + 16]
paddw xmm1, xmm2
paddw xmm5, xmm6
pmulhw xmm1, xmm3
pmulhw xmm5, xmm7
mov rsi, arg(2) ;qcoeff_ptr
pxor xmm6, xmm6
pxor xmm1, xmm0
pxor xmm5, xmm4
psubw xmm1, xmm0
psubw xmm5, xmm4
movdqa OWORD PTR[rsp + temp_qcoeff_lo], xmm1
movdqa OWORD PTR[rsp + temp_qcoeff_hi], xmm5
movdqa OWORD PTR[rsi], xmm6 ;zero qcoeff
movdqa OWORD PTR[rsi + 16], xmm6 ;zero qcoeff
xor rax, rax
mov rcx, -1
mov [rsp + eob], rcx
mov rsi, arg(9) ;zbin_boost_ptr
mov rbx, arg(4) ;default_zig_zag
rq_zigzag_loop:
movsxd rcx, DWORD PTR[rbx + rax*4] ;now we have rc
movsx edi, WORD PTR [rsi] ;*zbin_boost_ptr aka zbin
lea rsi, [rsi + 2] ;zbin_boost_ptr++
movsx edx, WORD PTR[rsp + abs_minus_zbin_lo + rcx *2]
sub edx, edi ;x - zbin
jl rq_zigzag_1
mov rdi, arg(2) ;qcoeff_ptr
movsx edx, WORD PTR[rsp + temp_qcoeff_lo + rcx *2]
cmp edx, 0
je rq_zigzag_1
mov WORD PTR[rdi + rcx * 2], dx ;qcoeff_ptr[rc] = temp_qcoeff[rc]
mov rsi, arg(9) ;zbin_boost_ptr
mov [rsp + eob], rax ;eob = i
rq_zigzag_1:
movsxd rcx, DWORD PTR[rbx + rax*4 + 4]
movsx edi, WORD PTR [rsi] ;*zbin_boost_ptr aka zbin
lea rsi, [rsi + 2] ;zbin_boost_ptr++
movsx edx, WORD PTR[rsp + abs_minus_zbin_lo + rcx *2]
lea rax, [rax + 1]
sub edx, edi ;x - zbin
jl rq_zigzag_1a
mov rdi, arg(2) ;qcoeff_ptr
movsx edx, WORD PTR[rsp + temp_qcoeff_lo + rcx *2]
cmp edx, 0
je rq_zigzag_1a
mov WORD PTR[rdi + rcx * 2], dx ;qcoeff_ptr[rc] = temp_qcoeff[rc]
mov rsi, arg(9) ;zbin_boost_ptr
mov [rsp + eob], rax ;eob = i
rq_zigzag_1a:
movsxd rcx, DWORD PTR[rbx + rax*4 + 4]
movsx edi, WORD PTR [rsi] ;*zbin_boost_ptr aka zbin
lea rsi, [rsi + 2] ;zbin_boost_ptr++
movsx edx, WORD PTR[rsp + abs_minus_zbin_lo + rcx *2]
lea rax, [rax + 1]
sub edx, edi ;x - zbin
jl rq_zigzag_1b
mov rdi, arg(2) ;qcoeff_ptr
movsx edx, WORD PTR[rsp + temp_qcoeff_lo + rcx *2]
cmp edx, 0
je rq_zigzag_1b
mov WORD PTR[rdi + rcx * 2], dx ;qcoeff_ptr[rc] = temp_qcoeff[rc]
mov rsi, arg(9) ;zbin_boost_ptr
mov [rsp + eob], rax ;eob = i
rq_zigzag_1b:
movsxd rcx, DWORD PTR[rbx + rax*4 + 4]
movsx edi, WORD PTR [rsi] ;*zbin_boost_ptr aka zbin
lea rsi, [rsi + 2] ;zbin_boost_ptr++
movsx edx, WORD PTR[rsp + abs_minus_zbin_lo + rcx *2]
lea rax, [rax + 1]
sub edx, edi ;x - zbin
jl rq_zigzag_1c
mov rdi, arg(2) ;qcoeff_ptr
movsx edx, WORD PTR[rsp + temp_qcoeff_lo + rcx *2]
cmp edx, 0
je rq_zigzag_1c
mov WORD PTR[rdi + rcx * 2], dx ;qcoeff_ptr[rc] = temp_qcoeff[rc]
mov rsi, arg(9) ;zbin_boost_ptr
mov [rsp + eob], rax ;eob = i
rq_zigzag_1c:
lea rax, [rax + 1]
cmp rax, 16
jl rq_zigzag_loop
mov rdi, arg(2) ;qcoeff_ptr
mov rcx, arg(3) ;dequant_ptr
mov rsi, arg(7) ;dqcoeff_ptr
movdqa xmm2, OWORD PTR[rdi]
movdqa xmm3, OWORD PTR[rdi + 16]
movdqa xmm0, OWORD PTR[rcx]
movdqa xmm1, OWORD PTR[rcx + 16]
pmullw xmm0, xmm2
pmullw xmm1, xmm3
movdqa OWORD PTR[rsi], xmm0 ;store dqcoeff
movdqa OWORD PTR[rsi + 16], xmm1 ;store dqcoeff
mov rax, [rsp + eob]
movdqa xmm6, OWORD PTR[rsp + save_xmm6]
movdqa xmm7, OWORD PTR[rsp + save_xmm7]
add rax, 1
add rsp, vp8_regularquantizeb_stack_size
pop rsp
; begin epilog
pop rbx
pop rdi
pop rsi
UNSHADOW_ARGS
pop rbp
ret
;int vp8_fast_quantize_b_impl_sse2(short *coeff_ptr,
; short *qcoeff_ptr,short *dequant_ptr,
; short *scan_mask, short *round_ptr,
; short *quant_ptr, short *dqcoeff_ptr);
global sym(vp8_fast_quantize_b_impl_sse2)
sym(vp8_fast_quantize_b_impl_sse2):
push rbp
mov rbp, rsp
SHADOW_ARGS_TO_STACK 7
push rsi
push rdi
push rbx
; end prolog
ALIGN_STACK 16, rax
%define save_xmm6 0
%define save_xmm7 16
%define vp8_fastquantizeb_stack_size save_xmm7 + 16
sub rsp, vp8_fastquantizeb_stack_size
movdqa XMMWORD PTR[rsp + save_xmm6], xmm6
movdqa XMMWORD PTR[rsp + save_xmm7], xmm7
mov rdx, arg(0) ;coeff_ptr
mov rcx, arg(2) ;dequant_ptr
mov rax, arg(3) ;scan_mask
mov rdi, arg(4) ;round_ptr
mov rsi, arg(5) ;quant_ptr
movdqa xmm0, XMMWORD PTR[rdx]
movdqa xmm4, XMMWORD PTR[rdx + 16]
movdqa xmm6, XMMWORD PTR[rdi] ;round lo
movdqa xmm7, XMMWORD PTR[rdi + 16] ;round hi
movdqa xmm1, xmm0
movdqa xmm5, xmm4
psraw xmm0, 15 ;sign of z (aka sz)
psraw xmm4, 15 ;sign of z (aka sz)
pxor xmm1, xmm0
pxor xmm5, xmm4
psubw xmm1, xmm0 ;x = abs(z)
psubw xmm5, xmm4 ;x = abs(z)
paddw xmm1, xmm6
paddw xmm5, xmm7
pmulhw xmm1, XMMWORD PTR[rsi]
pmulhw xmm5, XMMWORD PTR[rsi + 16]
mov rdi, arg(1) ;qcoeff_ptr
mov rsi, arg(6) ;dqcoeff_ptr
movdqa xmm6, XMMWORD PTR[rcx]
movdqa xmm7, XMMWORD PTR[rcx + 16]
pxor xmm1, xmm0
pxor xmm5, xmm4
psubw xmm1, xmm0
psubw xmm5, xmm4
movdqa XMMWORD PTR[rdi], xmm1
movdqa XMMWORD PTR[rdi + 16], xmm5
pmullw xmm6, xmm1
pmullw xmm7, xmm5
movdqa xmm2, XMMWORD PTR[rax]
movdqa xmm3, XMMWORD PTR[rax+16];
pxor xmm4, xmm4 ;clear all bits
pcmpeqw xmm1, xmm4
pcmpeqw xmm5, xmm4
pcmpeqw xmm4, xmm4 ;set all bits
pxor xmm1, xmm4
pxor xmm5, xmm4
psrlw xmm1, 15
psrlw xmm5, 15
pmaddwd xmm1, xmm2
pmaddwd xmm5, xmm3
movq xmm2, xmm1
movq xmm3, xmm5
psrldq xmm1, 8
psrldq xmm5, 8
paddd xmm1, xmm5
paddd xmm2, xmm3
paddd xmm1, xmm2
movq xmm5, xmm1
psrldq xmm1, 4
paddd xmm5, xmm1
movq rcx, xmm5
and rcx, 0xffff
xor rdx, rdx
sub rdx, rcx
bsr rax, rcx
inc rax
sar rdx, 31
and rax, rdx
movdqa XMMWORD PTR[rsi], xmm6 ;store dqcoeff
movdqa XMMWORD PTR[rsi + 16], xmm7 ;store dqcoeff
movdqa xmm6, XMMWORD PTR[rsp + save_xmm6]
movdqa xmm7, XMMWORD PTR[rsp + save_xmm7]
add rsp, vp8_fastquantizeb_stack_size
pop rsp
; begin epilog
pop rbx
pop rdi
pop rsi
UNSHADOW_ARGS
pop rbp
ret
|
programs/oeis/060/A060264.asm | jmorken/loda | 1 | 33 | <reponame>jmorken/loda
; A060264: First prime after 2n.
; 2,3,5,7,11,11,13,17,17,19,23,23,29,29,29,31,37,37,37,41,41,43,47,47,53,53,53,59,59,59,61,67,67,67,71,71,73,79,79,79,83,83,89,89,89,97,97,97,97,101,101,103,107,107,109,113,113,127,127,127,127,127,127,127,131,131,137,137,137,139,149,149,149,149,149,151,157,157,157,163,163,163,167,167,173,173,173,179,179,179,181,191,191,191,191,191,193,197,197,199,211,211,211,211,211,211,223,223,223,223,223,223,227,227,229,233,233,239,239,239,241,251,251,251,251,251,257,257,257,263,263,263,269,269,269,271,277,277,277,281,281,283,293,293,293,293,293,307,307,307,307,307,307,307,311,311,313,317,317,331,331,331,331,331,331,331,337,337,337,347,347,347,347,347,349,353,353,359,359,359,367,367,367,367,373,373,373,379,379,379,383,383,389,389,389,397,397,397,397,401,401,409,409,409,409,419,419,419,419,419,421,431,431,431,431,431,433,439,439,439,443,443,449,449,449,457,457,457,457,461,461,463,467,467,479,479,479,479,479,479,487,487,487,487,491,491,499,499,499,499
mul $0,2
cal $0,151800 ; Least prime > n (version 2 of the "next prime" function).
mov $1,$0
|
library/fmGUI_Database/fmGUI_Relogin.applescript | NYHTC/applescript-fm-helper | 1 | 2824 | <reponame>NYHTC/applescript-fm-helper
-- fmGUI_relogin({accountName:null, pwd:null})
-- <NAME>, NYHTC
-- re-login with specified credentials. must be triggered elsewhere - this handler only deals with the re-login window.
(*
REQUIRES:
fmGUI_AppFrontMost
fmGUI_ObjectClick_OkButton
fmGUI_TextFieldSet
windowWaitUntil
HISTORY:
1.1 - 2017-10-19 ( eshagdar ): moved logic to fmGUI_AuthenticateDialog - this handler is now just a wrapper.
1.0 - 2017-10-07 ( eshagdar ): created
*)
on run
fmGUI_relogin({accountName:"admin", pwd:""})
end run
--------------------
-- START OF CODE
--------------------
on fmGUI_relogin(prefs)
-- version 1.1
set defaultPrefs to {accountName:null, pwd:null}
set prefs to prefs & defaultPrefs
try
return fmGUI_AuthenticateDialog(prefs & {windowname:"Open"})
on error errMsg number errNum
error "Unable to fmGUI_relogin - " & errMsg number errNum
end try
end fmGUI_relogin
--------------------
-- END OF CODE
--------------------
on fmGUI_AuthenticateDialog(prefs)
tell application "htcLib" to fmGUI_AuthenticateDialog(prefs)
end fmGUI_AuthenticateDialog
|
programs/oeis/033/A033684.asm | neoneye/loda | 22 | 102383 | <reponame>neoneye/loda<filename>programs/oeis/033/A033684.asm
; A033684: 1 iff n is a square not divisible by 3.
; 0,1,0,0,1,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,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,0,0,0,0
mov $1,1
lpb $1
lpb $0,7
add $1,$0
mod $0,3
add $3,2
sub $1,$3
lpe
lpe
add $1,1
mod $1,2
mov $0,$1
|
Trash/test/AParser.g4 | studentmain/AntlrVSIX | 67 | 1104 | <filename>Trash/test/AParser.g4<gh_stars>10-100
parser grammar AParser;
options { tokenVocab=ALexer; }
s : e ;
e : e '*' e | INT ;
|
test/fail/CopatternCheckingNYI.agda | np/agda-git-experiment | 1 | 14601 | <gh_stars>1-10
{-# OPTIONS --copatterns #-}
module CopatternCheckingNYI where
record Stream (A : Set) : Set where
coinductive
field
head : A
tail : Stream A
open Stream
data Nat : Set where
zero : Nat
suc : Nat -> Nat
alternate : Stream Nat
( (head alternate)) = zero
(head (tail alternate)) = suc zero
(tail (tail alternate)) = tail alternate
-- does not yet termination-check
|
programs/oeis/188/A188554.asm | karttu/loda | 0 | 4779 | ; A188554: Number of 3Xn binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally
; 4,7,12,20,32,49,72,102,140,187,244,312,392,485,592,714,852,1007,1180,1372,1584,1817,2072,2350,2652,2979,3332,3712,4120,4557,5024,5522,6052,6615,7212,7844,8512,9217,9960,10742,11564,12427,13332,14280,15272,16309,17392,18522,19700,20927,22204,23532,24912,26345,27832,29374,30972,32627,34340,36112,37944,39837,41792,43810,45892,48039,50252,52532,54880,57297,59784,62342,64972,67675,70452,73304,76232,79237,82320,85482,88724,92047,95452,98940,102512,106169,109912,113742,117660,121667,125764,129952,134232,138605,143072,147634,152292,157047,161900,166852,171904,177057,182312,187670,193132,198699,204372,210152,216040,222037,228144,234362,240692,247135,253692,260364,267152,274057,281080,288222,295484,302867,310372,318000,325752,333629,341632,349762,358020,366407,374924,383572,392352,401265,410312,419494,428812,438267,447860,457592,467464,477477,487632,497930,508372,518959,529692,540572,551600,562777,574104,585582,597212,608995,620932,633024,645272,657677,670240,682962,695844,708887,722092,735460,748992,762689,776552,790582,804780,819147,833684,848392,863272,878325,893552,908954,924532,940287,956220,972332,988624,1005097,1021752,1038590,1055612,1072819,1090212,1107792,1125560,1143517,1161664,1180002,1198532,1217255,1236172,1255284,1274592,1294097,1313800,1333702
add $0,2
mov $1,$0
bin $1,3
add $1,$0
add $1,$0
|
.config/alfred/Alfred.alfredpreferences/workflows/user.workflow.D27B6AD4-C1F8-4105-8C0B-0E52489E70FE/app_OmniFocus.applescript | kuanger/dotfiles | 1 | 778 | on getTitle()
tell application "OmniFocus" -- v1 & v2
using terms from application "OmniFocus"
tell content of first document window of front document
--Get selection
set validSelectedItemsList to value of (selected trees where class of its value is not item and class of its value is not folder)
return name of first item of validSelectedItemsList
end tell
end using terms from
end tell
end getTitle
on getBody()
tell application "OmniFocus" -- v1 & v2
using terms from application "OmniFocus"
tell content of first document window of front document
--Get selection
set validSelectedItemsList to value of (selected trees where class of its value is not item and class of its value is not folder)
return "omnifocus:///task/" & id of first item of validSelectedItemsList
--return selection
end tell
end using terms from
end tell
end getBody |
oeis/080/A080303.asm | neoneye/loda-programs | 11 | 168417 | ; A080303: Rewrite 0->100 in the binary expansion of n.
; Submitted by <NAME>
; 4,1,12,3,100,25,28,7,804,201,204,51,228,57,60,15,6436,1609,1612,403,1636,409,412,103,1828,457,460,115,484,121,124,31,51492,12873,12876,3219,12900,3225,3228,807,13092,3273,3276,819,3300,825,828,207,14628,3657,3660,915,3684,921,924,231,3876,969,972,243,996,249,252,63,411940,102985,102988,25747,103012,25753,25756,6439,103204,25801,25804,6451,25828,6457,6460,1615,104740,26185,26188,6547,26212,6553,6556,1639,26404,6601,6604,1651,6628,1657,1660,415,117028,29257,29260,7315
mov $1,$0
max $1,1
mov $2,1
lpb $1
mov $4,$0
div $0,2
div $1,2
add $4,1
mod $4,2
mul $4,4
max $4,1
mul $2,$4
mov $4,$2
mul $2,2
add $3,$4
lpe
mov $0,$3
|
oeis/099/A099429.asm | neoneye/loda-programs | 11 | 26747 | ; A099429: A Jacobsthal-Lucas convolution.
; 0,0,2,3,12,25,66,147,344,765,1710,3751,8196,17745,38234,81915,174768,371365,786438,1660239,3495260,7340025,15379122,32156323,67108872,139810125,290805086,603979767,1252698804,2594876065,5368709130,11095332171,22906492256,47244640245,97352592054,200431807135,412316860428,847540213065,1740893410658,3573412790259,7330077518520,15026658912925,30786325577742,63038666659143,129009364325732,263882790666225,539493705362106,1102443658783387,2251799813685264,4597424619607365,9382499223688550
mov $2,$0
lpb $2
mov $1,$3
mov $3,$0
mul $0,2
sub $2,1
sub $3,$1
lpe
mov $0,$1
|
programs/oeis/195/A195617.asm | neoneye/loda | 22 | 11349 | ; A195617: Numerators b(n) of Pythagorean approximations b(n)/a(n) to 3.
; 35,1333,50615,1922041,72986939,2771581645,105247115567,3996618809905,151766267660819,5763121552301221,218846852719785575,8310417281799550633,315577009855663138475,11983615957233399711421,455061829365013525895519,17280365899913280584318305,656198842367339648678200067,24918275644058993369187284245,946238275631874408380438601239,35932136198367168525087479562841,1364474937262320529544943784786715,51814115479769812954182776342332333
mul $0,2
add $0,3
seq $0,5667 ; Numerators of continued fraction convergents to sqrt(10).
sub $0,117
div $0,6
mul $0,9
add $0,172
div $0,2
sub $0,85
div $0,5
mul $0,2
add $0,35
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.