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
|
|---|---|---|---|---|
examples/example.asm | azurda/gingerbread | 109 | 28180 |
; This section is for including files that either need to be in the home section, or files where it doesn't matter
SECTION "Includes@home",ROM0
; Prior to importing GingerBread, some options can be specified
; Max 15 characters, should be uppercase ASCII
GAME_NAME EQUS "GBEXAMPLE "
; Include SGB support in GingerBread. This makes the GingerBread library take up a bit more space on ROM0. To remove support, comment out this line (don't set it to 0)
SGB_SUPPORT EQU 1
; Include GBC support in GingerBread. This makes the GingerBread library take up slightly more space on ROM0. To remove support, comment out this line (don't set it to 0)
GBC_SUPPORT EQU 1
; Set the size of the ROM file here. 0 means 32 kB, 1 means 64 kB, 2 means 128 kB and so on.
ROM_SIZE EQU 1
; Set the size of save RAM inside the cartridge.
; If printed to real carts, it needs to be small enough to fit.
; 0 means no RAM, 1 means 2 kB, 2 -> 8 kB, 3 -> 32 kB, 4 -> 128 kB
RAM_SIZE EQU 1
INCLUDE "gingerbread.asm"
; To compile this game without gbt-player, comment out this line (don't set it to 0)
USE_GBT_PLAYER EQU 1
; This section is for including files that need to be in data banks
SECTION "Include@banks",ROMX
INCLUDE "images/title.inc"
INCLUDE "images/pong.inc"
INCLUDE "images/sgb_border.inc"
IF DEF(USE_GBT_PLAYER)
INCLUDE "gbt_player.inc"
ENDC
; Macro for copying a rectangular region into VRAM
; Changes ALL registers
; Arguments:
; 1 - Height (number of rows)
; 2 - Width (number of columns)
; 3 - Source to copy from
; 4 - Destination to copy to
CopyRegionToVRAM: MACRO
I SET 0
REPT \1
ld bc, \2
ld hl, \3+(I*\2)
ld de, \4+(I*32)
call mCopyVRAM
I SET I+1
ENDR
ENDM
SECTION "StartOfGameCode",ROM0
begin: ; GingerBread assumes that the label "begin" is where the game should start
call SetupSGB
call SetupGBC
; Load title image into VRAM
; We need to switch bank to whatever bank contains the tile data
ld a, BANK(title_tile_data)
ld [ROM_BANK_SWITCH], a
ld hl, title_tile_data
ld de, TILEDATA_START
ld bc, title_tile_data_size
call mCopyVRAM
ld a, BANK(title_map_data)
ld [ROM_BANK_SWITCH], a
CopyRegionToVRAM 18, 20, title_map_data, BACKGROUND_MAPDATA_START
call StartLCD
; Everything up to this point is simply an example demo which shows a single image. If you want
; to use this as your starting point, remove all lines below.
call EnableAudio
call SetupHighScore
IF DEF(USE_GBT_PLAYER)
ld de,funkyforest_data
ld bc,BANK(funkyforest_data)
ld a,$05
call gbt_play ; Play song
ENDC
ld a, 1
ld [ROM_BANK_SWITCH], a
jp TitleLoop
; Definition of some RAM variables
SECTION "RAM variables",WRAM0[USER_RAM_START]
BALL_POSITION: DS 2
BALL_DIRECTION: DS 2
LEFT_PADDLE_POSITION: DS 2
RIGHT_PADDLE_POSITION: DS 2
RIGHT_PADDLE_CHECK_TIME: DS 1
RIGHT_PADDLE_DIRECTION: DS 1
LEFT_SCORE: DS 1
RIGHT_SCORE: DS 1
SECTION "SRAM variables",SRAM[SAVEDATA_START]
SRAM_INTEGRITY_CHECK: DS 2 ; Two bytes that should read $1337; if they do not, the save is considered corrupt or unitialized
SRAM_HIGH_SCORE: DS 1
; Definition of some constants
PADDLE_SPEED equ 2 ; pixels per frame
RIGHT_PADDLE_CHECK_FREQUENCY equ 15 ; how many frame should pass between each check if right paddle should move up/down
SECTION "Text definitions",ROM0
; Charmap definition (based on the pong.png image, and looking in the VRAM viewer after loading it in BGB helps finding the values for each character)
CHARMAP "A",$56
CHARMAP "B",$57
CHARMAP "C",$58
CHARMAP "D",$59
CHARMAP "E",$5A
CHARMAP "F",$5B
CHARMAP "G",$5C
CHARMAP "H",$5D
CHARMAP "I",$5E
CHARMAP "J",$5F
CHARMAP "K",$60
CHARMAP "L",$61
CHARMAP "M",$62
CHARMAP "N",$63
CHARMAP "O",$64
CHARMAP "P",$65
CHARMAP "Q",$66
CHARMAP "R",$67
CHARMAP "S",$68
CHARMAP "T",$69
CHARMAP "U",$6A
CHARMAP "V",$6B
CHARMAP "W",$6C
CHARMAP "X",$6D
CHARMAP "Y",$6E
CHARMAP "Z",$6F
CHARMAP "<happy>",$70
CHARMAP "<sad>",$71
CHARMAP "<heart>",$72
CHARMAP " ",$01
CHARMAP "<end>",$0 ; Choose some non-character tile that's easy to remember
; Text definitions
SupportiveText:
DB "WELL DONE <happy> <heart> <end>"
TauntingText:
DB "YOU SUCK LOL <sad><end>"
GameOverText:
DB "GAME OVER LOLOLOLO<end>"
SECTION "Sound effect definitions",ROM0
Sound_ball_bounce:
DW SOUND_CH4_START
DB %00000000 ; Data to be written to SOUND_CH4_START
DB %00000100 ; Data to be written to SOUND_CH4_LENGTH
DB %11110111 ; Data to be written to SOUND_CH4_ENVELOPE
DB %01010101 ; Data to be written to SOUND_CH4_POLY
DB %11000110 ; Data to be written to SOUND_CH4_OPTIONS
SECTION "SGB Palette data",ROMX,BANK[1]
SGBPalettes01: ; Specifies the colors of palettes 0 and 1
DB %00000001 ; PAL01 command (%00000), length one (%001)
DB %11111111 ; Color 0 (for all palettes), %gggrrrrr
DB %01111111 ; Color 0 (for all palettes), %0bbbbbgg
DB %11100001 ; Color 1, Palette 0, %gggrrrrr
DB %01111001 ; Color 1, Palette 0, %0bbbbbgg
DB %01100001 ; Color 2, Palette 0, %gggrrrrr
DB %00110100 ; Color 2, Palette 0, %0bbbbbgg
DB %00000000 ; Color 3, Palette 0, %gggrrrrr
DB %00000000 ; Color 3, Palette 0, %0bbbbbgg
DB %11100111 ; Color 1, Palette 1, %gggrrrrr
DB %01111001 ; Color 1, Palette 1, %0bbbbbgg
DB %11100001 ; Color 2, Palette 1, %gggrrrrr
DB %00011101 ; Color 2, Palette 1, %0bbbbbgg
DB %00000000 ; Color 3, Palette 1, %gggrrrrr
DB %00000000 ; Color 3, Palette 1, %0bbbbbgg
DB 0 ; Not used
SGBPalettes23: ; Specifies the colors of palettes 2 and 3
DB %00001001 ; PAL23 command (%00001), length one (%001)
DB %11111111 ; Color 0 (for all palettes), %gggrrrrr
DB %01111111 ; Color 0 (for all palettes), %0bbbbbgg
DB %10110101 ; Color 1, Palette 2, %gggrrrrr
DB %01010110 ; Color 1, Palette 2, %0bbbbbgg
DB %11100111 ; Color 2, Palette 2, %gggrrrrr
DB %00011100 ; Color 2, Palette 2, %0bbbbbgg
DB %00100001 ; Color 3, Palette 2, %gggrrrrr
DB %00000100 ; Color 3, Palette 2, %0bbbbbgg
DB 0,0,0,0,0,0 ; Colors 1-3, Palette 3 (which isn't used in this example game)
SGBPal2Everywhere: ; Tells the SGB to use Palette 2 everywhere (used for title and game over)
DB %00100001 ; ATTR_BLK (%00100), length one (%001)
DB 1 ; Number of blocks we send
DB %00000100 ; Set the value "outside" the block (doing this with a small block means setting the entire screen)
DB %00101010 ; Which palettes to set inside (%10), on the border (%10) and outside (%10)
DB 0 ; X1 coordinate
DB 0 ; Y1 coordinate
DB 0 ; X2 coordinate
DB 0 ; Y2 coordinate
DB 0,0,0,0,0,0,0,0 ; Zero-padding
SGBPal01Div: ; Tells the SGB to draw the top horizontal line with palette 1, and palette 0 everywhere else
DB %00110001 ; ATTR_DIV command (%00110), length one (%001)
DB %01010100 ; Zero-padding (%0), horizontal split (%1), palette on the line (%01), palette above the line (%01), palette below the line (%00)
DB 0 ; Y-coordinate
DB 0,0,0,0,0,0,0,0,0,0,0,0,0 ; Zero-padding
SECTION "GBC Palette data",ROM0
GBCBackgroundPalettes:
DB %11111111 ; Color 0, palette 0, %gggrrrrr
DB %01111111 ; Color 0, palette 0, %0bbbbbgg
DB %11100011 ; Color 1, palette 0, %gggrrrrr
DB %00011111 ; Color 1, palette 0, %0bbbbbgg
DB %11100001 ; Color 2, palette 0, %gggrrrrr
DB %00001001 ; Color 2, palette 0, %0bbbbbgg
DB %00000000 ; Color 3, palette 0, %gggrrrrr
DB %00000000 ; Color 3, palette 0, %0bbbbbgg
DB %11111111 ; Color 0, palette 1, %gggrrrrr
DB %01111111 ; Color 0, palette 1, %0bbbbbgg
DB %01111111 ; Color 1, palette 1, %gggrrrrr
DB %00001100 ; Color 1, palette 1, %0bbbbbgg
DB %01001111 ; Color 2, palette 1, %gggrrrrr
DB %00000100 ; Color 2, palette 1, %0bbbbbgg
DB %00000011 ; Color 3, palette 1, %gggrrrrr
DB %00000000 ; Color 3, palette 1, %0bbbbbgg
GBCBackgroundPalettesDark:
DB %11100111 ; Color 0, palette 0, %gggrrrrr
DB %00011100 ; Color 0, palette 0, %0bbbbbgg
DB %11100000 ; Color 1, palette 0, %gggrrrrr
DB %00000100 ; Color 1, palette 0, %0bbbbbgg
DB %01100000 ; Color 2, palette 0, %gggrrrrr
DB %00000100 ; Color 2, palette 0, %0bbbbbgg
DB %00000000 ; Color 3, palette 0, %gggrrrrr
DB %00000000 ; Color 3, palette 0, %0bbbbbgg
DB %11100111 ; Color 0, palette 1, %gggrrrrr
DB %00011100 ; Color 0, palette 1, %0bbbbbgg
DB %00000111 ; Color 1, palette 1, %gggrrrrr
DB %00000000 ; Color 1, palette 1, %0bbbbbgg
DB %00000011 ; Color 2, palette 1, %gggrrrrr
DB %00000000 ; Color 2, palette 1, %0bbbbbgg
DB %00000000 ; Color 3, palette 1, %gggrrrrr
DB %00000000 ; Color 3, palette 1, %0bbbbbgg
GBCBackgroundPalettesDarker:
DB %01000010 ; Color 0, palette 0, %gggrrrrr
DB %00001000 ; Color 0, palette 0, %0bbbbbgg
DB %01000000 ; Color 1, palette 0, %gggrrrrr
DB %00000000 ; Color 1, palette 0, %0bbbbbgg
DB %01000000 ; Color 2, palette 0, %gggrrrrr
DB %00000000 ; Color 2, palette 0, %0bbbbbgg
DB %00000000 ; Color 3, palette 0, %gggrrrrr
DB %00000000 ; Color 3, palette 0, %0bbbbbgg
DB %01000010 ; Color 0, palette 1, %gggrrrrr
DB %00001000 ; Color 0, palette 1, %0bbbbbgg
DB %00000010 ; Color 1, palette 1, %gggrrrrr
DB %00000000 ; Color 1, palette 1, %0bbbbbgg
DB %00000000 ; Color 2, palette 1, %gggrrrrr
DB %00000000 ; Color 2, palette 1, %0bbbbbgg
DB %00000000 ; Color 3, palette 1, %gggrrrrr
DB %00000000 ; Color 3, palette 1, %0bbbbbgg
GBCBackgroundPalettesDarkest:
DB %00000000 ; Color 0, palette 0, %gggrrrrr
DB %00000000 ; Color 0, palette 0, %0bbbbbgg
DB %00000000 ; Color 1, palette 0, %gggrrrrr
DB %00000000 ; Color 1, palette 0, %0bbbbbgg
DB %00000000 ; Color 2, palette 0, %gggrrrrr
DB %00000000 ; Color 2, palette 0, %0bbbbbgg
DB %00000000 ; Color 3, palette 0, %gggrrrrr
DB %00000000 ; Color 3, palette 0, %0bbbbbgg
DB %00000000 ; Color 0, palette 1, %gggrrrrr
DB %00000000 ; Color 0, palette 1, %0bbbbbgg
DB %00000000 ; Color 1, palette 1, %gggrrrrr
DB %00000000 ; Color 1, palette 1, %0bbbbbgg
DB %00000000 ; Color 2, palette 1, %gggrrrrr
DB %00000000 ; Color 2, palette 1, %0bbbbbgg
DB %00000000 ; Color 3, palette 1, %gggrrrrr
DB %00000000 ; Color 3, palette 1, %0bbbbbgg
GBCSpritePalettes:
DB %11111111 ; Color 0, palette 0, %gggrrrrr
DB %01111111 ; Color 0, palette 0, %0bbbbbgg
DB %11111111 ; Color 1, palette 0, %gggrrrrr
DB %00011111 ; Color 1, palette 0, %0bbbbbgg
DB %11111111 ; Color 2, palette 0, %gggrrrrr
DB %00001001 ; Color 2, palette 0, %0bbbbbgg
DB %00000000 ; Color 3, palette 0, %gggrrrrr
DB %00000000 ; Color 3, palette 0, %0bbbbbgg
DB %11111000 ; Color 0, palette 1, %gggrrrrr
DB %01111111 ; Color 0, palette 1, %0bbbbbgg
DB %01100000 ; Color 1, palette 1, %gggrrrrr
DB %01111100 ; Color 1, palette 1, %0bbbbbgg
DB %00000000 ; Color 2, palette 1, %gggrrrrr
DB %00011100 ; Color 2, palette 1, %0bbbbbgg
DB %00000000 ; Color 3, palette 1, %gggrrrrr
DB %00001100 ; Color 3, palette 1, %0bbbbbgg
GBCPaletteMap:
DB 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
DB 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
SECTION "Pong game code",ROM0
SetupGBC:
GBCEarlyExit ; Prevents garbage from being written to tile map on non-GBC by the palette map.
ld hl, GBCBackgroundPalettes
xor a ; Start at color 0, palette 0
ld b, 16 ; We have 16 bytes to write
call GBCApplyBackgroundPalettes
ld hl, GBCSpritePalettes
xor a
ld b, 16
call GBCApplySpritePalettes
; Switch to VRAM bank 1 to write the palette map (which palette to use at which tile)
ld a, 1
ld [GBC_VRAM_BANK_SWITCH], a
; Copy the palette map onto VRAM (where the tile data usually is)
CopyRegionToVRAM 18, 20, GBCPaletteMap, BACKGROUND_MAPDATA_START
; Change the VRAM bank back
xor a
ld [GBC_VRAM_BANK_SWITCH], a
ret
SetupSGB:
SGBEarlyExit ; Without this, garbage would be visible on screen briefly when booting on a GB/GBC
call InitSGBPalettes
call SGBFreeze ; To prevent "garbage" from being visible on screen
SGBBorderTransferMacro SGB_VRAM_TILEDATA1, SGB_VRAMTRANS_TILEDATA1, SGB_VRAMTRANS_GBTILEMAP
SGBBorderTransferMacro SGB_VRAM_TILEDATA2, SGB_VRAMTRANS_TILEDATA2, SGB_VRAMTRANS_GBTILEMAP
SGBBorderTransferMacro SGB_VRAM_TILEMAP, SGB_VRAMTRANS_TILEMAP, SGB_VRAMTRANS_GBTILEMAP
call SGBUnfreeze
ret
SetupSGBGameplay:
; Sets up palette usage which should be displayed during gameplay
SGBEarlyExit
ld hl, SGBPal01Div
call SGBSendData
ret
InitSGBPalettes:
ld hl, SGBPalettes01
call SGBSendData
ld hl, SGBPalettes23
call SGBSendData
ld hl, SGBPal2Everywhere
call SGBSendData
ret
SetupHighScore:
; For this game, we only ever use one save data bank, the first one (0)
xor a
call ChooseSaveDataBank
; Activate save data so we can read and write it
call EnableSaveData
; If the integrity check doesn't read $1337, we should initialize a default high score of 0 and then write $1337 to the integrity check position
ld a, [SRAM_INTEGRITY_CHECK]
cp $13
jr nz, .initializeSRAM
ld a, [SRAM_INTEGRITY_CHECK+1]
cp $37
jr nz, .initializeSRAM
; If we get here, no initialization is necessary
jr .print
.initializeSRAM:
; Initialize high score to 0
xor a
ld [SRAM_HIGH_SCORE], a
; Intialize integrity check so that high score will not be overwritten on next boot
ld a, $13
ld [SRAM_INTEGRITY_CHECK], a
ld a, $37
ld [SRAM_INTEGRITY_CHECK+1], a
jr .print
.print:
; Display current high score
ld a, [SRAM_HIGH_SCORE]
ld b, a
call DisableSaveData ; Since we no longer need it. Always disable SRAM as quickly as possible.
ld a, b
ld b, $4F ; tile number of 0 character on the title screen
ld c, 0 ; draw to background
ld d, 8 ; X position
ld e, 14 ; Y position
call RenderTwoDecimalNumbers
ret
; To keep music playing at all times, call this before every halt command
; A - ROM bank to switch to after updating music (GBT Player switches banks when updating the music)
UpdateMusic:
IF DEF(USE_GBT_PLAYER)
push bc
push af
call gbt_update
pop af
pop bc
ENDC
ld [ROM_BANK_SWITCH], a
ret
TitleLoop:
ld a, 1
call UpdateMusic
halt
nop ; Always do a nop after a halt, because of a CPU bug
call ReadKeys
and KEY_A | KEY_START
cp 0
jp nz, TransitionToGame
jr TitleLoop
ShortWait:
ld b, 20
.loop:
ld a, 1
call UpdateMusic
halt
nop
dec b
ld a, b
cp 0
jr nz, .loop
ret
; Modifies everything
DrawScore:
; We use the -ByPosition render calls because this is done every frame, so precomputing the position numbers at compile time
; will make the code run faster
ld a, [LEFT_SCORE]
ld b, $4C ; Tile number of 0
ld c, 0 ; Write to background
ld de, 1 + 32*0 ; Position number (the formula is x + 32*y)
call RenderTwoDecimalNumbersByPosition
ld a, [RIGHT_SCORE]
ld b, $4C ; Tile number of 0
ld c, 0 ; Write to background
ld de, 17 + 32*0 ; Position number (the formula is x + 32*y)
call RenderTwoDecimalNumbersByPosition
ret
; Modifies AF
DrawBall:
; Left part of ball
ld a, [BALL_POSITION+1] ; Y location
ld [SPRITES_START], a
ld a, [BALL_POSITION] ; X location
ld [SPRITES_START+1], a
ld a, $48 ; Tile number
ld [SPRITES_START+2], a
xor a ; Flags (including GBC sprite color palette)
ld [SPRITES_START+3], a
; Right part of ball
ld a, [BALL_POSITION+1] ; Y location
ld [SPRITES_START+4], a
ld a, [BALL_POSITION] ; X location
add 8 ; right part of ball should be 8 pixels to the right
ld [SPRITES_START+5], a
ld a, $4A ; Tile number
ld [SPRITES_START+6], a
xor a ; Flags (including GBC sprite color palette)
ld [SPRITES_START+7], a
ret
; Modifies AF
DrawLeftPaddle:
; Top part of paddle
ld a, [LEFT_PADDLE_POSITION+1] ; Y
ld [SPRITES_START+8], a
ld a, [LEFT_PADDLE_POSITION] ; X
ld [SPRITES_START+9], a
ld a, $44 ; Top and top-middle paddle tiles
ld [SPRITES_START+10], a
ld a, 1 ; Flags (including GBC sprite color palette)
ld [SPRITES_START+11], a
; Bottom of paddle
ld a, [LEFT_PADDLE_POSITION+1] ; Y
add 16
ld [SPRITES_START+12], a
ld a, [LEFT_PADDLE_POSITION] ; X
ld [SPRITES_START+13], a
ld a, $46 ; Bottom-middle and bottom paddle tiles
ld [SPRITES_START+14], a
ld a, 1 ; Flags (including GBC sprite color palette)
ld [SPRITES_START+15], a
ret
; Modifies AF
DrawRightPaddle:
; Top part of paddle
ld a, [RIGHT_PADDLE_POSITION+1] ; Y
ld [SPRITES_START+16], a
ld a, [RIGHT_PADDLE_POSITION] ; X
ld [SPRITES_START+17], a
ld a, $44 ; Top and top-middle paddle tiles
ld [SPRITES_START+18], a
ld a, 1 ; Flags (including GBC sprite color palette)
ld [SPRITES_START+19], a
; Bottom of paddle
ld a, [RIGHT_PADDLE_POSITION+1] ; Y
add 16
ld [SPRITES_START+20], a
ld a, [RIGHT_PADDLE_POSITION] ; X
ld [SPRITES_START+21], a
ld a, $46 ; Bottom-middle and bottom paddle tiles
ld [SPRITES_START+22], a
ld a, 1 ; Flags (including GBC sprite color palette)
ld [SPRITES_START+23], a
ret
TransitionToGame:
ld a, %11111001
ld [BG_PALETTE], a
ld hl, GBCBackgroundPalettesDark
xor a ; Start at color 0, palette 0
ld b, 16 ; We have 16 bytes to write
call GBCApplyBackgroundPalettes
call ShortWait
ld a, %11111110
ld [BG_PALETTE], a
ld hl, GBCBackgroundPalettesDarker
xor a ; Start at color 0, palette 0
ld b, 16 ; We have 16 bytes to write
call GBCApplyBackgroundPalettes
call ShortWait
ld a, %11111111
ld [BG_PALETTE], a
ld hl, GBCBackgroundPalettesDarkest
xor a ; Start at color 0, palette 0
ld b, 16 ; We have 16 bytes to write
call GBCApplyBackgroundPalettes
call ShortWait
; Now that the screen is completely black, load the game graphics
ld a, BANK(pong_tile_data)
ld [ROM_BANK_SWITCH], a
; Load pong tiles into VRAM
ld hl, pong_tile_data
ld de, TILEDATA_START
ld bc, pong_tile_data_size
call mCopyVRAM
; Clear out the background
ld a, 1
ld hl, BACKGROUND_MAPDATA_START
ld bc, 32*32
call mSetVRAM
ld a, BANK(pong_map_data)
ld [ROM_BANK_SWITCH], a
; Draw the pong map tiles
CopyRegionToVRAM 18, 20, pong_map_data, BACKGROUND_MAPDATA_START
ld a, 1
ld [ROM_BANK_SWITCH], a
; On SGB, this is the right time to switch to the gameplay palettes
call SetupSGBGameplay
; Now fade back to normal palette
ld a, %11111110
ld [BG_PALETTE], a
ld hl, GBCBackgroundPalettesDarker
xor a ; Start at color 0, palette 0
ld b, 16 ; We have 16 bytes to write
call GBCApplyBackgroundPalettes
call ShortWait
ld a, %11111001
ld [BG_PALETTE], a
ld hl, GBCBackgroundPalettesDark
xor a ; Start at color 0, palette 0
ld b, 16 ; We have 16 bytes to write
call GBCApplyBackgroundPalettes
call ShortWait
ld a, %11100100
ld [BG_PALETTE], a
ld hl, GBCBackgroundPalettes
xor a ; Start at color 0, palette 0
ld b, 16 ; We have 16 bytes to write
call GBCApplyBackgroundPalettes
call ShortWait
; Let's put the sprites in place
ld a, 100 ; X
ld [BALL_POSITION], a
ld a, 50 ; Y
ld [BALL_POSITION+1], a
call DrawBall
ld a, 12 ; X
ld [LEFT_PADDLE_POSITION], a
ld a, 72 ; Y
ld [LEFT_PADDLE_POSITION+1], a
call DrawLeftPaddle
ld a, 154 ; X
ld [RIGHT_PADDLE_POSITION], a
ld a, 72 ; Y
ld [RIGHT_PADDLE_POSITION+1], a
call DrawRightPaddle
; Set initial ball movement
ld a, 2 ; dx
ld [BALL_DIRECTION], a
ld a, 1 ; dy
ld [BALL_DIRECTION+1], a
; Initialize right paddle check counter and direction
xor a
ld [RIGHT_PADDLE_CHECK_TIME], a
ld [RIGHT_PADDLE_DIRECTION], a
; Initialize score
ld [LEFT_SCORE], a
ld [RIGHT_SCORE], a
jp GameLoop
; Modifies AF
; Moves the left paddle up, making sure not to move it outside the playing field
MoveLeftPaddleUp:
ld a, [LEFT_PADDLE_POSITION+1]
sub PADDLE_SPEED
; Check if too high up
cp 24
ret c
ld [LEFT_PADDLE_POSITION+1], a
ret
; Modifies AF
; Same as MoveLeftPaddleUp, except Down
MoveLeftPaddleDown:
ld a, [LEFT_PADDLE_POSITION+1]
add PADDLE_SPEED
; Check if too far down
cp 130
ret nc
ld [LEFT_PADDLE_POSITION+1], a
ret
; Modifies AF
; Moves the right paddle up, making sure not to move it outside the playing field
MoveRightPaddleUp:
ld a, [RIGHT_PADDLE_POSITION+1]
sub PADDLE_SPEED
; Check if too high up
cp 24
ret c
ld [RIGHT_PADDLE_POSITION+1], a
ret
; Modifies AF
; Same as MoveRightPaddleUp, except Down
MoveRightPaddleDown:
ld a, [RIGHT_PADDLE_POSITION+1]
add PADDLE_SPEED
; Check if too far down
cp 130
ret nc
ld [RIGHT_PADDLE_POSITION+1], a
ret
ReverseBallDY:
; 0 - dy will be a positive integer, but it still works because of overflow
xor a
sub c
ld [BALL_DIRECTION+1], a
ret
ReverseBallDX:
xor a
sub b
ld [BALL_DIRECTION], a
ret
CheckCollisionLeftPaddle:
; First check if the ball is far enough to the left
ld a, [BALL_POSITION]
cp 17
ret nc
; Now check if it's far enough down
ld a, [LEFT_PADDLE_POSITION+1]
ld d, a
ld a, [BALL_POSITION+1]
add 8
cp d
ret c
; Now check if it's not too far down
sub 40
cp d
ret nc
call ReverseBallDX
ld hl, Sound_ball_bounce
call PlaySoundHL
; To prevent ball from getting stuck, make sure dx > 0 and it's a bit to the right
ld a, [BALL_POSITION]
add 2
ld [BALL_POSITION], a
ld a, [BALL_DIRECTION]
cp 128
ret c
; If we get here, it means ball direction was wrong
call ReverseBallDX
ret
CheckCollisionRightPaddle:
; First check if the ball is far enough to the right
ld a, [BALL_POSITION]
cp 142
ret c
; Now check if it's far enough down
ld a, [RIGHT_PADDLE_POSITION+1]
ld d, a
ld a, [BALL_POSITION+1]
add 8
cp d
ret c
; Now check if it's not too far down
sub 40
cp d
ret nc
call ReverseBallDX
ld hl, Sound_ball_bounce
call PlaySoundHL
; To prevent ball from getting stuck, make sure dx < 0 and it's a bit to the left
ld a, [BALL_POSITION]
sub 2
ld [BALL_POSITION], a
ld a, [BALL_DIRECTION]
cp 128
ret nc
; If we get here, it means ball direction was wrong
call ReverseBallDX
ret
CheckBallOut:
ld a, [BALL_POSITION]
; If the x position is larger than 160, the ball is outside the field. This is true regardless of
; if the ball went out to the left or right! 8-bit unsigned numbers, am I right? Or left?
cp 160
ret c
; If we get here, it means the ball was indeed outside
; Now we need to know which side. We can just look at the ball's direction
ld a, [BALL_DIRECTION]
cp 128
jr nc, .leftSide
.rightSide:
; Increase left player's score
ld a, [LEFT_SCORE]
add a, 1 ; Since it's in decimal format, we can't use inc/dec and we need to remember to use daa
daa
ld [LEFT_SCORE], a
; Show some supportive text
ld c, 0
ld b, 0
ld hl, SupportiveText
ld d, 3
ld e, 16
call RenderTextToEnd
jr .end
.leftSide:
; Increase right player's score
ld a, [RIGHT_SCORE]
add 1
daa
ld [RIGHT_SCORE], a
; Show taunting text
ld c, 0
ld b, 0
ld hl, TauntingText
ld d, 3
ld e, 16
call RenderTextToEnd
.end:
; Place ball at initial position
; X
ld a, 80
ld [BALL_POSITION], a
; Y
ld a, 72
ld [BALL_POSITION+1], a
REPT 15
ld a, 1
call UpdateMusic
halt
nop
ENDR
; Check if right player's score is 10. If so, the game is over
ld a, [RIGHT_SCORE]
cp $10
jr z, .gameOver
ret
.gameOver:
call DrawScore
ld hl, GameOverText
ld b, 0 ; End character
ld c, 0 ; Draw to background
ld d, 1 ; X position
ld e, 20 ; Y position
call RenderTextToEnd
; Hide sprites
ld hl, SPRITES_START
ld bc, SPRITES_LENGTH
xor a
call mSetVRAM
; Scroll the screen down a bit
ld c, 100
.scrollDown:
ld a, [SCROLL_Y]
inc a
ld [SCROLL_Y], a
call ShorterWait
dec c
ld a, c
cp 0
jr nz, .scrollDown
; Now remove the first few lines of tiles so that they don't become visible when we scroll too far down
ld a, 1
ld hl, BACKGROUND_MAPDATA_START
ld bc, 32*4
call mSetVRAM
; Scroll down a bit more
ld c, 40
.scrollDown2:
ld a, [SCROLL_Y]
inc a
ld [SCROLL_Y], a
call ShorterWait
dec c
ld a, c
cp 0
jr nz, .scrollDown2
call ShortWait
call ShortWait
call ShortWait
; Compare player's score with high score and save new high score if it's higher
ld a, [LEFT_SCORE]
ld b, a
call EnableSaveData
ld a, [SRAM_HIGH_SCORE]
cp b
call c, .newHighScore
call DisableSaveData
; Resets the game
jp GingerBreadBegin
; Local function for writing high score to SRAM
.newHighScore:
ld a, b
ld [SRAM_HIGH_SCORE], a
ret
ShorterWait:
ld b, 4
.wait:
ld a, 1
call UpdateMusic
halt
nop
dec b
ld a, b
cp 0
jr nz, .wait
ret
; Modifies AF and BC and DE
UpdateBall:
; Store dx in B, and add to ball x
ld a, [BALL_DIRECTION]
ld b, a
ld a, [BALL_POSITION]
add b
ld [BALL_POSITION], a
; Store dy in C, and add to ball y
ld a, [BALL_DIRECTION+1]
ld c, a
ld a, [BALL_POSITION+1]
add c
ld [BALL_POSITION+1], a
; Check if ball collides with ceiling, if so reverse dy
ld a, [BALL_POSITION+1]
cp 24
call c, ReverseBallDY
; Same but for the floor
ld a, [BALL_POSITION+1]
cp 144
call nc, ReverseBallDY
; Check if ball is outside the playing field
call CheckBallOut
; Check collision with paddles
call CheckCollisionRightPaddle
call CheckCollisionLeftPaddle
ret
RightPaddleStartMovingDown:
ld a, 1
ld [RIGHT_PADDLE_DIRECTION], a
ret
RightPaddleStartMovingUp:
xor a
ld [RIGHT_PADDLE_DIRECTION], a
ret
UpdateRightPaddleDirection:
; Reset check counter
xor a
ld [RIGHT_PADDLE_CHECK_TIME], a
; Compare ball's and right paddle's y values and move paddle accordingly
ld a, [BALL_POSITION+1]
sub 8 ; because paddle is taller than ball
ld b, a
ld a, [RIGHT_PADDLE_POSITION+1]
push af
push bc
cp b
call nc, RightPaddleStartMovingUp
pop bc
pop af
cp b
call c, RightPaddleStartMovingDown
ret
UpdateRightPaddle:
ld a, [RIGHT_PADDLE_DIRECTION] ; 0 means up, 1 means down
cp 0
jr z, .moveUp
.moveDown:
call MoveRightPaddleDown
ret
.moveUp:
call MoveRightPaddleUp
ret
GameLoop:
call DrawLeftPaddle
call DrawRightPaddle
call DrawBall
call DrawScore
ld a, 1
call UpdateMusic
halt
nop
call ReadKeys
push af ; Store key status so it can be used twice
and KEY_UP
cp 0
call nz, MoveLeftPaddleUp
pop af
and KEY_DOWN
cp 0
call nz, MoveLeftPaddleDown
call UpdateBall
ld a, [RIGHT_PADDLE_CHECK_TIME]
inc a
ld [RIGHT_PADDLE_CHECK_TIME], a
cp RIGHT_PADDLE_CHECK_FREQUENCY
call z, UpdateRightPaddleDirection
call UpdateRightPaddle
jp GameLoop
|
programs/oeis/008/A008737.asm | neoneye/loda | 22 | 90019 | <reponame>neoneye/loda
; A008737: a(n) = floor(n/6)*ceiling(n/6).
; 0,0,0,0,0,0,1,2,2,2,2,2,4,6,6,6,6,6,9,12,12,12,12,12,16,20,20,20,20,20,25,30,30,30,30,30,36,42,42,42,42,42,49,56,56,56,56,56,64,72,72,72,72,72,81,90,90,90,90,90,100,110,110,110,110,110,121,132,132,132,132,132,144,156,156,156,156,156,169,182,182,182,182,182,196,210,210,210,210,210,225,240,240,240,240,240,256,272,272,272
mov $2,$0
div $2,6
lpb $0
sub $0,1
trn $0,5
add $1,$2
lpe
mov $0,$1
|
examples/network/monotonicity/monotonicity-output.agda | Yiergot/vehicle | 0 | 11119 | -- WARNING: This file was generated automatically by Vehicle
-- and should not be modified manually!
-- Metadata
-- - Agda version: 2.6.2
-- - AISEC version: 0.1.0.1
-- - Time generated: ???
open import AISEC.Utils
open import Data.Real as ℝ using (ℝ)
open import Data.List
module MyTestModule where
f : Tensor ℝ (1 ∷ []) → Tensor ℝ (1 ∷ [])
f = evaluate record
{ databasePath = DATABASE_PATH
; networkUUID = NETWORK_UUID
}
monotonic : ∀ (x1 : Tensor ℝ (1 ∷ [])) → ∀ (x2 : Tensor ℝ (1 ∷ [])) → let y1 = f (x1)
y2 = f (x2) in x1 0 ℝ.≤ x2 0 → y1 0 ℝ.≤ y2 0
monotonic = checkProperty record
{ databasePath = DATABASE_PATH
; propertyUUID = ????
} |
third_party/virtualbox/src/VBox/Runtime/os2/sys0.asm | Fimbure/icebox-1 | 521 | 1993 | <filename>third_party/virtualbox/src/VBox/Runtime/os2/sys0.asm<gh_stars>100-1000
;; @file
; IPRT - crt0/dll0 replacement stub for OS/2 R0/GC modules.
;
;
; Copyright (C) 2006-2017 Oracle Corporation
;
; This file is part of VirtualBox Open Source Edition (OSE), as
; available from http://www.virtualbox.org. This file is free software;
; you can redistribute it and/or modify it under the terms of the GNU
; General Public License (GPL) as published by the Free Software
; Foundation, in version 2 as it comes in the "COPYING" file of the
; VirtualBox OSE distribution. VirtualBox OSE is distributed in the
; hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
;
; The contents of this file may alternatively be used under the terms
; of the Common Development and Distribution License Version 1.0
; (CDDL) only, as it comes in the "COPYING.CDDL" file of the
; VirtualBox OSE distribution, in which case the provisions of the
; CDDL are applicable instead of those of the GPL.
;
; You may elect to license modified versions of this file under the
; terms and conditions of either the GPL or the CDDL or both.
;
;*******************************************************************************
;* Header Files *
;*******************************************************************************
%include "iprt/asmdefs.mac"
BEGINCODE
global __text
__text:
global ___ehInit
___ehInit:
db 0cch
..start:
int3
xor eax,eax
ret
BEGINDATA
global __data
__data:
global __data_start
__data_start:
BEGINBSS
global __bss_start
__bss_start:
|
ffight/lcs/weapon/1E.asm | zengfr/arcade_game_romhacking_sourcecode_top_secret_data | 6 | 105026 | <filename>ffight/lcs/weapon/1E.asm
copyright zengfr site:http://github.com/zengfr/romhack
003A0A movem.l D0-D3, -(A6)
003A0E movem.l D0-D3, -(A6)
009ACA dbra D5, $9ac8
058E3E clr.b ($1e,A6) [weapon+ 4]
058E42 clr.w ($50,A6)
059586 move.b #$2, ($3,A6) [weapon+1E]
0595CA bne $595d2 [weapon+1E]
copyright zengfr site:http://github.com/zengfr/romhack
|
core/src/code_generation/tests/ifelse-2.asm | mari-linhares/GoCompiler | 1 | 94063 | 100: LD SP, #4000
function alwaysBe1
1000: LD R0, #1
1008: BR *0(SP)
function plusPlus
4016: ST c, R1
4024: ST b, R2
4032: ST a, R3
4040: SUB R4, R3, R2
4048: BLEZ R4, #4120
4056: ADD R5, #2, #3
4064: ADD R6, R3, R5
4072: ST a, R6
4080: ADD R7, R2, #5
4088: ST b, R7
4096: LD R0, #1.0
4104: BR *0(SP)
4112: BR #4136
4120: LD R0, #0.0
4128: BR *0(SP)
4136: SUB R8, R6, R7
4144: BLEZ R8, #4168
4152: LD R8, #true
4160: BR #4176
4168: LD R8, #false
4176: ST x, R8
4184: ADD SP, SP, #plusPlussize
4192: ST *SP, #4208
4200: BR #1000
4208: SUB SP, SP, #plusPlussize
4216: SUB R9, #1, R0
4224: BGEZ R9, #4288
4232: LD R10, #10
4240: ST a, R10
4248: MUL R11, R10, #3
4256: ST b, R11
4264: LD R0, #1.0
4272: BR *0(SP)
4280: BR #4304
4288: LD R0, #0.0
4296: BR *0(SP)
function main
|
day21/app.asm | ghosind/HariboteOS | 11 | 12512 | <filename>day21/app.asm
[BITS 32]
GLOBAL start_app
start_app: ; void start_app(int eip, int cs, int esp, int ds, int *tss_esp0);
PUSHAD
MOV EAX, [ESP+36] ; EIP
MOV ECX, [ESP+40] ; CS
MOV EDX, [ESP+44] ; ESP
MOV EBX, [ESP+48] ; DS/SS
MOV EBP, [ESP+52] ; tss.esp0
MOV [EBP], ESP
MOV [EBP+4], SS
MOV ES, BX
MOV DS, BX
MOV FS, BX
MOV GS, BX
OR ECX, 3
OR EBX, 3
PUSH EBX
PUSH EDX
PUSH ECX
PUSH EAX
RETF
|
oeis/005/A005085.asm | neoneye/loda-programs | 11 | 93915 | ; A005085: Sum of 4th powers of primes = 3 mod 4 dividing n.
; Submitted by <NAME>
; 0,0,81,0,0,81,2401,0,81,0,14641,81,0,2401,81,0,0,81,130321,0,2482,14641,279841,81,0,0,81,2401,0,81,923521,0,14722,0,2401,81,0,130321,81,0,0,2482,3418801,14641,81,279841,4879681,81,2401,0,81,0,0,81,14641,2401,130402,0,12117361,81,0,923521,2482,0,0,14722,20151121,0,279922,2401,25411681,81,0,0,81,130321,17042,81,38950081,0,81,0,47458321,2482,0,3418801,81,14641,0,81,2401,279841,923602,4879681,130321,81,0,2401,14722,0
add $0,1
lpb $0
mov $2,3
mov $3,$0
lpb $3
mov $4,$0
mod $4,$2
add $2,4
cmp $4,0
cmp $4,0
sub $3,$4
lpe
lpb $0
dif $0,$2
lpe
pow $2,4
add $5,$2
lpe
mov $0,$5
|
programs/oeis/143/A143839.asm | neoneye/loda | 22 | 20863 | ; A143839: Ulam's spiral (SSE spoke).
; 1,24,79,166,285,436,619,834,1081,1360,1671,2014,2389,2796,3235,3706,4209,4744,5311,5910,6541,7204,7899,8626,9385,10176,10999,11854,12741,13660,14611,15594,16609,17656,18735,19846,20989,22164,23371,24610,25881,27184,28519,29886,31285,32716,34179,35674,37201,38760,40351,41974,43629,45316,47035,48786,50569,52384,54231,56110,58021,59964,61939,63946,65985,68056,70159,72294,74461,76660,78891,81154,83449,85776,88135,90526,92949,95404,97891,100410,102961,105544,108159,110806,113485,116196,118939,121714,124521,127360,130231,133134,136069,139036,142035,145066,148129,151224,154351,157510
mov $1,16
mul $1,$0
add $1,7
mul $1,$0
add $1,1
mov $0,$1
|
source/amf/mof/cmof/amf-internals-cmof_package_imports.adb | svn2github/matreshka | 24 | 8261 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.Helpers;
with AMF.Internals.Tables.CMOF_Attributes;
with AMF.Visitors.CMOF_Iterators;
with AMF.Visitors.CMOF_Visitors;
package body AMF.Internals.CMOF_Package_Imports is
use AMF.Internals.Tables.CMOF_Attributes;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant CMOF_Package_Import_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.CMOF_Visitors.CMOF_Visitor'Class then
AMF.Visitors.CMOF_Visitors.CMOF_Visitor'Class
(Visitor).Enter_Package_Import
(AMF.CMOF.Package_Imports.CMOF_Package_Import_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant CMOF_Package_Import_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.CMOF_Visitors.CMOF_Visitor'Class then
AMF.Visitors.CMOF_Visitors.CMOF_Visitor'Class
(Visitor).Leave_Package_Import
(AMF.CMOF.Package_Imports.CMOF_Package_Import_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant CMOF_Package_Import_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.CMOF_Iterators.CMOF_Iterator'Class then
AMF.Visitors.CMOF_Iterators.CMOF_Iterator'Class
(Iterator).Visit_Package_Import
(Visitor,
AMF.CMOF.Package_Imports.CMOF_Package_Import_Access (Self),
Control);
end if;
end Visit_Element;
--------------------------
-- Get_Imported_Package --
--------------------------
overriding function Get_Imported_Package
(Self : not null access constant CMOF_Package_Import_Proxy)
return AMF.CMOF.Packages.CMOF_Package_Access is
begin
return
AMF.CMOF.Packages.CMOF_Package_Access
(AMF.Internals.Helpers.To_Element
(Internal_Get_Imported_Package (Self.Element)));
end Get_Imported_Package;
-----------------------------
-- Get_Importing_Namespace --
-----------------------------
overriding function Get_Importing_Namespace
(Self : not null access constant CMOF_Package_Import_Proxy)
return AMF.CMOF.Namespaces.CMOF_Namespace_Access is
begin
return
AMF.CMOF.Namespaces.CMOF_Namespace_Access
(AMF.Internals.Helpers.To_Element
(Internal_Get_Importing_Namespace (Self.Element)));
end Get_Importing_Namespace;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant CMOF_Package_Import_Proxy)
return CMOF.CMOF_Visibility_Kind is
begin
return Internal_Get_Visibility (Self.Element);
end Get_Visibility;
------------------------
-- All_Owned_Elements --
------------------------
overriding function All_Owned_Elements
(Self : not null access constant CMOF_Package_Import_Proxy)
return AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owned_Elements unimplemented");
raise Program_Error;
return All_Owned_Elements (Self);
end All_Owned_Elements;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access CMOF_Package_Import_Proxy;
To : CMOF.CMOF_Visibility_Kind)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Set_Visibility unimplemented");
raise Program_Error;
end Set_Visibility;
--------------------------
-- Set_Imported_Package --
--------------------------
overriding procedure Set_Imported_Package
(Self : not null access CMOF_Package_Import_Proxy;
To : AMF.CMOF.Packages.CMOF_Package_Access)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Set_Imported_Package unimplemented");
raise Program_Error;
end Set_Imported_Package;
-----------------------------
-- Set_Importing_Namespace --
-----------------------------
overriding procedure Set_Importing_Namespace
(Self : not null access CMOF_Package_Import_Proxy;
To : AMF.CMOF.Namespaces.CMOF_Namespace_Access)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Set_Importing_Namespace unimplemented");
raise Program_Error;
end Set_Importing_Namespace;
end AMF.Internals.CMOF_Package_Imports;
|
Util/llvm/bindings/ada/llvm/llvm_link_time_optimizer.ads | ianloic/unladen-swallow | 5 | 18474 | <filename>Util/llvm/bindings/ada/llvm/llvm_link_time_optimizer.ads
-- This file is generated by SWIG. Do *not* modify by hand.
--
with Interfaces.C.Extensions;
package LLVM_link_time_Optimizer is
-- lto_symbol_attributes
--
type lto_symbol_attributes is (
LTO_SYMBOL_ALIGNMENT_MASK,
LTO_SYMBOL_PERMISSIONS_RODATA,
LTO_SYMBOL_PERMISSIONS_CODE,
LTO_SYMBOL_PERMISSIONS_DATA,
LTO_SYMBOL_PERMISSIONS_MASK,
LTO_SYMBOL_DEFINITION_REGULAR,
LTO_SYMBOL_DEFINITION_TENTATIVE,
LTO_SYMBOL_DEFINITION_WEAK,
LTO_SYMBOL_DEFINITION_UNDEFINED,
LTO_SYMBOL_DEFINITION_WEAKUNDEF,
LTO_SYMBOL_DEFINITION_MASK,
LTO_SYMBOL_SCOPE_INTERNAL,
LTO_SYMBOL_SCOPE_HIDDEN,
LTO_SYMBOL_SCOPE_DEFAULT,
LTO_SYMBOL_SCOPE_PROTECTED,
LTO_SYMBOL_SCOPE_MASK);
for lto_symbol_attributes use
(LTO_SYMBOL_ALIGNMENT_MASK => 31,
LTO_SYMBOL_PERMISSIONS_RODATA => 128,
LTO_SYMBOL_PERMISSIONS_CODE => 160,
LTO_SYMBOL_PERMISSIONS_DATA => 192,
LTO_SYMBOL_PERMISSIONS_MASK => 224,
LTO_SYMBOL_DEFINITION_REGULAR => 256,
LTO_SYMBOL_DEFINITION_TENTATIVE => 512,
LTO_SYMBOL_DEFINITION_WEAK => 768,
LTO_SYMBOL_DEFINITION_UNDEFINED => 1024,
LTO_SYMBOL_DEFINITION_WEAKUNDEF => 1280,
LTO_SYMBOL_DEFINITION_MASK => 1792,
LTO_SYMBOL_SCOPE_INTERNAL => 2048,
LTO_SYMBOL_SCOPE_HIDDEN => 4096,
LTO_SYMBOL_SCOPE_DEFAULT => 6144,
LTO_SYMBOL_SCOPE_PROTECTED => 8192,
LTO_SYMBOL_SCOPE_MASK => 14336);
pragma Convention (C, lto_symbol_attributes);
type lto_symbol_attributes_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.lto_symbol_attributes;
type lto_symbol_attributes_view is access all
LLVM_link_time_Optimizer.lto_symbol_attributes;
-- lto_debug_model
--
type lto_debug_model is (LTO_DEBUG_MODEL_NONE, LTO_DEBUG_MODEL_DWARF);
for lto_debug_model use
(LTO_DEBUG_MODEL_NONE => 0,
LTO_DEBUG_MODEL_DWARF => 1);
pragma Convention (C, lto_debug_model);
type lto_debug_model_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.lto_debug_model;
type lto_debug_model_view is access all
LLVM_link_time_Optimizer.lto_debug_model;
-- lto_codegen_model
--
type lto_codegen_model is (
LTO_CODEGEN_PIC_MODEL_STATIC,
LTO_CODEGEN_PIC_MODEL_DYNAMIC,
LTO_CODEGEN_PIC_MODEL_DYNAMIC_NO_PIC);
for lto_codegen_model use
(LTO_CODEGEN_PIC_MODEL_STATIC => 0,
LTO_CODEGEN_PIC_MODEL_DYNAMIC => 1,
LTO_CODEGEN_PIC_MODEL_DYNAMIC_NO_PIC => 2);
pragma Convention (C, lto_codegen_model);
type lto_codegen_model_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.lto_codegen_model;
type lto_codegen_model_view is access all
LLVM_link_time_Optimizer.lto_codegen_model;
-- LTOModule
--
type LTOModule is new Interfaces.C.Extensions.opaque_structure_def;
type LTOModule_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.LTOModule;
type LTOModule_view is access all LLVM_link_time_Optimizer.LTOModule;
-- lto_module_t
--
type lto_module_t is access all LLVM_link_time_Optimizer.LTOModule;
type lto_module_t_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.lto_module_t;
type lto_module_t_view is access all LLVM_link_time_Optimizer.lto_module_t;
-- LTOCodeGenerator
--
type LTOCodeGenerator is new Interfaces.C.Extensions.opaque_structure_def;
type LTOCodeGenerator_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.LTOCodeGenerator;
type LTOCodeGenerator_view is access all
LLVM_link_time_Optimizer.LTOCodeGenerator;
-- lto_code_gen_t
--
type lto_code_gen_t is access all LLVM_link_time_Optimizer.LTOCodeGenerator;
type lto_code_gen_t_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.lto_code_gen_t;
type lto_code_gen_t_view is access all
LLVM_link_time_Optimizer.lto_code_gen_t;
-- llvm_lto_status_t
--
type llvm_lto_status_t is (
LLVM_LTO_UNKNOWN,
LLVM_LTO_OPT_SUCCESS,
LLVM_LTO_READ_SUCCESS,
LLVM_LTO_READ_FAILURE,
LLVM_LTO_WRITE_FAILURE,
LLVM_LTO_NO_TARGET,
LLVM_LTO_NO_WORK,
LLVM_LTO_MODULE_MERGE_FAILURE,
LLVM_LTO_ASM_FAILURE,
LLVM_LTO_NULL_OBJECT);
for llvm_lto_status_t use
(LLVM_LTO_UNKNOWN => 0,
LLVM_LTO_OPT_SUCCESS => 1,
LLVM_LTO_READ_SUCCESS => 2,
LLVM_LTO_READ_FAILURE => 3,
LLVM_LTO_WRITE_FAILURE => 4,
LLVM_LTO_NO_TARGET => 5,
LLVM_LTO_NO_WORK => 6,
LLVM_LTO_MODULE_MERGE_FAILURE => 7,
LLVM_LTO_ASM_FAILURE => 8,
LLVM_LTO_NULL_OBJECT => 9);
pragma Convention (C, llvm_lto_status_t);
type llvm_lto_status_t_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.llvm_lto_status_t;
type llvm_lto_status_t_view is access all
LLVM_link_time_Optimizer.llvm_lto_status_t;
-- llvm_lto_t
--
type llvm_lto_t is access all Interfaces.C.Extensions.void;
type llvm_lto_t_array is
array (Interfaces.C.size_t range <>)
of aliased LLVM_link_time_Optimizer.llvm_lto_t;
type llvm_lto_t_view is access all
LLVM_link_time_Optimizer.llvm_lto_t;
end LLVM_link_time_Optimizer;
|
programs/oeis/086/A086575.asm | neoneye/loda | 22 | 246168 | <gh_stars>10-100
; A086575: a(n) = 4*(10^n - 1).
; 0,36,396,3996,39996,399996,3999996,39999996,399999996,3999999996,39999999996,399999999996,3999999999996,39999999999996,399999999999996,3999999999999996,39999999999999996,399999999999999996,3999999999999999996,39999999999999999996,399999999999999999996
add $0,1
mov $1,10
pow $1,$0
mul $1,4
div $1,360
mul $1,36
mov $0,$1
|
extra/extra/TakeDropDec.agda | manikdv/plfa.github.io | 1,003 | 4280 | module TakeDropDec where
import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl; sym; trans; cong; cong₂; _≢_)
open import Data.Empty using (⊥; ⊥-elim)
open import Data.List using (List; []; _∷_)
open import Data.List.All using (All; []; _∷_)
open import Data.Bool using (Bool; true; false; T)
open import Data.Unit using (⊤; tt)
open import Relation.Nullary using (¬_; Dec; yes; no)
open import Relation.Nullary.Decidable using ()
open import Function using (_∘_)
module TakeDrop {A : Set} {P : A → Set} (P? : ∀ (x : A) → Dec (P x)) where
takeWhile : List A → List A
takeWhile [] = []
takeWhile (x ∷ xs) with P? x
... | yes _ = x ∷ takeWhile xs
... | no _ = []
dropWhile : List A → List A
dropWhile [] = []
dropWhile (x ∷ xs) with P? x
... | yes _ = dropWhile xs
... | no _ = x ∷ xs
Head : (A → Set) → List A → Set
Head P [] = ⊥
Head P (x ∷ xs) = P x
takeWhile-lemma : ∀ (xs : List A) → All P (takeWhile xs)
takeWhile-lemma [] = []
takeWhile-lemma (x ∷ xs) with P? x
... | yes px = px ∷ takeWhile-lemma xs
... | no _ = []
dropWhile-lemma : ∀ (xs : List A) → ¬ Head P (dropWhile xs)
dropWhile-lemma [] = λ()
dropWhile-lemma (x ∷ xs) with P? x
... | yes _ = dropWhile-lemma xs
... | no ¬px = ¬px
open TakeDrop
open import Data.Nat using (ℕ; zero; suc; _≟_)
_ : takeWhile (0 ≟_) (0 ∷ 0 ∷ 1 ∷ []) ≡ (0 ∷ 0 ∷ [])
_ = refl
_ : dropWhile (0 ≟_) (0 ∷ 0 ∷ 1 ∷ []) ≡ (1 ∷ [])
_ = refl
|
programs/oeis/130/A130505.asm | neoneye/loda | 22 | 26434 | ; A130505: a(n) = 3*a(n-1) if n is odd, otherwise 6*a(n-1).
; 1,3,18,54,324,972,5832,17496,104976,314928,1889568,5668704,34012224,102036672,612220032,1836660096,11019960576,33059881728,198359290368,595077871104,3570467226624,10711401679872,64268410079232,192805230237696,1156831381426176,3470494144278528,20822964865671168,62468894597013504,374813367582081024,1124440102746243072,6746640616477458432,20239921849432375296,121439531096594251776,364318593289782755328,2185911559738696531968,6557734679216089595904,39346408075296537575424,118039224225889612726272,708235345355337676357632,2124706036066013029072896,12748236216396078174437376,38244708649188234523312128,229468251895129407139872768,688404755685388221419618304,4130428534112329328517709824,12391285602336987985553129472,74347713614021927913318776832,223043140842065783739956330496,1338258845052394702439737982976,4014776535157184107319213948928,24088659210943104643915283693568,72265977632829313931745851080704,433595865796975883590475106484224,1300787597390927650771425319452672,7804725584345565904628551916716032,23414176753036697713885655750148096,140485060518220186283313934500888576,421455181554660558849941803502665728
add $0,1
mov $2,$0
add $0,1
mov $1,3
pow $1,$2
lpb $0
sub $0,2
mul $1,2
lpe
div $1,6
mov $0,$1
|
src/agda/FRP/JS/Float.agda | agda/agda-frp-js | 63 | 4086 | open import FRP.JS.Bool using ( Bool ; true ; false ; not ; _∨_ )
open import FRP.JS.True using ( True )
open import FRP.JS.Maybe using ( Maybe ; just ; nothing )
open import FRP.JS.Primitive using ( ℤ ; String )
module FRP.JS.Float where
infixr 4 _≤_ _<_ _≟_ _≠_
infixl 6 _+_ _-_
infixl 7 _*_ _/_ _/?_
open import FRP.JS.Primitive public using ( ℝ )
primitive
primFloatPlus : ℝ -> ℝ -> ℝ
primFloatMinus : ℝ -> ℝ -> ℝ
primFloatTimes : ℝ -> ℝ -> ℝ
primFloatDiv : ℝ -> ℝ -> ℝ
primFloatLess : ℝ -> ℝ -> Bool
primFloor : ℝ -> ℤ
primCeiling : ℝ -> ℤ
primExp : ℝ -> ℝ
primLog : ℝ -> ℝ
primSin : ℝ -> ℝ
primShowFloat : ℝ -> String
primShowInteger : ℤ → String
primIntegerToFloat : ℤ → ℝ
_+_ = primFloatPlus
_-_ = primFloatMinus
_*_ = primFloatTimes
_<_ = primFloatLess
⌊_⌋ = primFloor
⌈_⌉ = primCeiling
exp = primExp
log = primLog
sin = primSin
{-# COMPILED_JS _+_ function(x) { return function(y) { return x + y; }; } #-}
{-# COMPILED_JS _-_ function(x) { return function(y) { return x - y; }; } #-}
{-# COMPILED_JS _*_ function(x) { return function(y) { return x * y; }; } #-}
{-# COMPILED_JS _<_ function(x) { return function(y) { return x < y; }; } #-}
{-# COMPILED_JS ⌊_⌋ Math.floor #-}
{-# COMPILED_JS ⌈_⌉ Math.ceil #-}
{-# COMPILED_JS exp Math.exp #-}
{-# COMPILED_JS log Math.log #-}
{-# COMPILED_JS sin Math.sin #-}
-_ : ℝ → ℝ
- x = 0.0 - x
_≠_ : ℝ → ℝ → Bool
(x ≠ y) = (x < y) ∨ (y < x)
_≟_ : ℝ → ℝ → Bool
(x ≟ y) = not (x ≠ y)
_≤_ : ℝ → ℝ → Bool
(x ≤ y) = not (y < x)
-- Some hoop-jumping to avoid division by zero, so we don't end up with
-- Infinity, -Infinity or NaN.
_/_ : (x y : ℝ) → {y≠0 : True (y ≠ 0.0)} → ℝ
x / y = primFloatDiv x y
_/?_ : ℝ → ℝ → Maybe ℝ
x /? 0.0 = nothing
x /? y = just (primFloatDiv x y)
show : ℝ → String
show x
with (x ≟ primIntegerToFloat ⌊ x ⌋)
... | true = primShowInteger ⌊ x ⌋
... | false = primShowFloat x
{-# COMPILED_JS -_ function(x) { return -x; } #-}
{-# COMPILED_JS _≠_ function(x) { return function(y) { return x !== y; }; } #-}
{-# COMPILED_JS _≟_ function(x) { return function(y) { return x === y; }; } #-}
{-# COMPILED_JS _≤_ function(x) { return function(y) { return x <= y; }; } #-}
{-# COMPILED_JS _/_ function(x) { return function(y) { return function() { return x / y; }; }; } #-}
{-# COMPILED_JS _/?_ function(x) { return function(y) { if (y === 0) { return null; } else { return x / y; } }; } #-}
{-# COMPILED_JS show function(x) { return x.toString(); } #-}
|
src/Generic/Lib/Reflection/Fold.agda | turion/Generic | 30 | 13134 | module Generic.Lib.Reflection.Fold where
open import Generic.Lib.Intro
open import Generic.Lib.Decidable
open import Generic.Lib.Category
open import Generic.Lib.Data.Nat
open import Generic.Lib.Data.String
open import Generic.Lib.Data.Maybe
open import Generic.Lib.Data.List
open import Generic.Lib.Reflection.Core
foldTypeOf : Data Type -> Type
foldTypeOf (packData d a b cs ns) = appendType iab ∘ pi "π" π ∘ pi "P" P $ cs ʰ→ from ‵→ to where
infixr 5 _ʰ→_
i = countPis a
j = countPis b
ab = appendType a b
iab = implicitize ab
π = implRelArg (quoteTerm Level)
P = explRelArg ∘ appendType (shiftBy (suc j) b) ∘ agda-sort ∘ set $ pureVar j
hyp = mapName (λ p -> appVar p ∘ drop i) d ∘ shiftBy (2 + j)
_ʰ→_ = flip $ foldr (λ c r -> hyp c ‵→ shift r)
from = appDef d (pisToArgVars (2 + i + j) ab)
to = appVar 1 (pisToArgVars (3 + j) b)
foldClausesOf : Name -> Data Type -> List Clause
foldClausesOf f (packData d a b cs ns) = allToList $ mapAllInd (λ {a} n -> clauseOf n a) ns where
k = length cs
clauseOf : ℕ -> Type -> Name -> Clause
clauseOf i c n = clause lhs rhs where
args = explPisToNames c
j = length args
lhs = patVars ("P" ∷ unmap (λ n -> "f" ++ˢ showName n) ns)
∷ʳ explRelArg (patCon n (patVars args))
tryHyp : ℕ -> ℕ -> Type -> Maybe Term
tryHyp m l (explPi r s a b) = explLam s <$> tryHyp (suc m) l b
tryHyp m l (pi s a b) = tryHyp m l b
tryHyp m l (appDef e _) = d == e ?> vis appDef f (pars ∷ʳ rarg) where
pars = map (λ i -> pureVar (m + i)) $ downFromTo (suc k + j) j
rarg = vis appVar (m + l) $ map pureVar (downFrom m)
tryHyp m l b = nothing
hyps : ℕ -> Type -> List Term
hyps (suc l) (explPi r s a b) = fromMaybe (pureVar l) (tryHyp 0 l a) ∷ hyps l b
hyps l (pi s a b) = hyps l b
hyps l b = []
rhs = vis appVar (k + j ∸ suc i) (hyps j c)
-- i = 1: f
-- j = 3: x t r
-- k = 2: g f
-- 5 4 3 2 1 0 3 2 4 3 1 1 0 6 5 2 1 0
-- fold P g f (cons x t r) = f x (fold g f t) (λ y u -> fold g f (r y u))
defineFold : Name -> Data Type -> TC _
defineFold f D =
declareDef (explRelArg f) (foldTypeOf D) >>
defineFun f (foldClausesOf f D)
deriveFold : Name -> Data Type -> TC Name
deriveFold d D =
freshName ("fold" ++ˢ showName d) >>= λ f ->
f <$ defineFold f D
deriveFoldTo : Name -> Name -> TC _
deriveFoldTo f = getData >=> defineFold f
|
programs/oeis/002/A002450.asm | karttu/loda | 1 | 4716 | ; A002450: a(n) = (4^n - 1)/3.
; 0,1,5,21,85,341,1365,5461,21845,87381,349525,1398101,5592405,22369621,89478485,357913941,1431655765,5726623061,22906492245,91625968981,366503875925,1466015503701,5864062014805,23456248059221,93824992236885,375299968947541,1501199875790165,6004799503160661
mov $1,4
pow $1,$0
div $1,3
|
drools-example/src/main/resources/antlr4/SearchParser.g4 | noogel/xyzPlayJava | 0 | 3037 | <reponame>noogel/xyzPlayJava<filename>drools-example/src/main/resources/antlr4/SearchParser.g4<gh_stars>0
// 表明SearchParser.g4文件是语法解析器(parser)定义文件
// 同理，语法分析器的名称一定要和文件名保持一致
parser grammar SearchParser;
options {
// 表示解析token的词法解析器使用SearchLexer
tokenVocab = SearchLexer;
}
// EOF(end of file)表示文件结束符，这个是Antlr中已经定义好的
prog: expression | STAR EOF;
expression:
// 表示表达式可以被括号括起来
// 如果语法后面加上了#{name}，相当于将这个name作为这个语法块的名字，这个#{name}要加都得加上，要不加都不加
// (country:中国)
LPAREN expression RPAREN #lrExpr
// leftExpr是给定义的语法起的别名(alias)，可有可无，但是有会更好点
// 因为antlr解析同一语法块的同一类token时，会将他们放在一个list里面
// 比如下面的语法块，有两个expression，antlr会将他们放在一个列表expressions里
// 获取第一个expression时需要expressions.get(0)，获取第二个expression时需要expressions.get(1)
// 如果给第一个expression起了个别名叫leftExpr，给第二个expression起了个别名叫rightExpr
// 那样在java里面调用时就可以直接调用leftExpr和rightExpr，而不需要指定expressions中的索引(0或1)
// 这样做的好处是：如果之后添加了新的token，比如在下面语法中间添加一个expression的token
// 这时如果不使用别名leftExpr，rightExpr就可能需要修改java代码，因为原来rightExpr对应的expression在expressions中索引变为2了
// 使用别名leftExpr，rightExpr(当然还可以取别的名字)就没有这个问题，使语法文件和生成的java代码更便于维护
// country:中国
| leftExpr = expression operator = (EQ |COLON| NE ) rightExpr = expression #eqExpr
// (country:中国||country:美国)&&city:北京
| leftExpr = expression operator = (BOOLAND|BOOLOR) rightExpr = expression #boolExpr
// country等字面量
| ID #identityExpr
; |
programs/oeis/003/A003511.asm | jmorken/loda | 1 | 99666 | <gh_stars>1-10
; A003511: A Beatty sequence: floor( n * (1 + sqrt(3))/2 ).
; 1,2,4,5,6,8,9,10,12,13,15,16,17,19,20,21,23,24,25,27,28,30,31,32,34,35,36,38,39,40,42,43,45,46,47,49,50,51,53,54,56,57,58,60,61,62,64,65,66,68,69,71,72,73,75,76,77,79,80,81,83,84,86,87,88,90,91,92,94,95,96,98,99,101,102,103,105,106,107,109,110,112,113,114,116,117,118,120,121,122,124,125,127,128,129,131,132,133,135,136,137,139,140,142,143,144,146,147,148,150,151,152,154,155,157,158,159,161,162,163,165,166,168,169,170,172,173,174,176,177,178,180,181,183,184,185,187,188,189,191,192,193,195,196,198,199,200,202,203,204,206,207,209,210,211,213,214,215,217,218,219,221,222,224,225,226,228,229,230,232,233,234,236,237,239,240,241,243,244,245,247,248,249,251,252,254,255,256,258,259,260,262,263,265,266,267,269,270,271,273,274,275,277,278,280,281,282,284,285,286,288,289,290,292,293,295,296,297,299,300,301,303,304,305,307,308,310,311,312,314,315,316,318,319,321,322,323,325,326,327,329,330,331,333,334,336,337,338,340,341
mov $1,1
cal $0,180122 ; First of three "least, sum, least" self-generating sequences.
add $1,$0
div $1,2
|
res/kernel.asm | Pusty/F0i | 0 | 15522 | <gh_stars>0
org 0x7E00
bits 16
cpu 8086
mov cx, [valueLen]
mov ax, cx
mov dx, 0
mov bx, 4
idiv bx
mov [valueLen], ax
mov cx, [valueLen]
printValue:
push cx
mov si, value
mov ax, 4
mov bx, [valueLen]
sub bx, cx
imul bx
mov dx, 0
add si, ax
call printFBin
call newLine
pop cx
loop printValue
mov si, value
call printFloat
jmp $
value dd 15
valueLen dw 4
printFloat:
mov dl, [si+3]
call printSign
ret
;dl = byte with sign at bit 8
printSign:
and dl, 10000000b
mov cl, 1
shl dl, cl
jnc .nomin
mov al, '-'
call printChar
jmp .endmin
.nomin:
mov al, '+'
call printChar
.endmin:
ret
;single precision real in bits
printFBin:
mov ah, 0x0E ;tells bios to print 1 char
mov bh, 0x00 ;page 0
mov bl, 0x07 ;text attribute
add si, 4
mov dh, 0
mov cx, 4
.byte:
sub si, 1
push cx
mov dl, [si]
mov cx, 8 ;loop bit 8 times as a byte has 8 bits
.bit:
add dh, 1
.n0:
cmp dh, 2
jne .n1
mov al, ' '
int 0x10
.n1:
cmp dh, 3
jne .n2
mov al, ' '
int 0x10
.n2:
cmp dh, 1+8+1
jne .n3
mov al, ' '
int 0x10
.n3:
mov ch, cl
mov cl, 1
shl dl, cl ;sets carry flag to the bit that's "outshifted"
jc .one
mov al, '0'
jmp .end
.one:
mov al, '1'
.end:
int 0x10 ;print character
mov cl, ch
mov ch, 0 ;resets cx to the counter
loop .bit
pop cx
loop .byte
ret
%include "include/printInt.asm"
%include "include/printBin.asm"
%include "include/newLine.asm"
%assign WASTED 512*16 - ($-$$)
%assign MAX 512*16
%warning Waste: WASTED / MAX Bytes unused [Kernel]
times 512*16 - ($-$$) db 10
|
src/Categories/Monad/Morphism.agda | Trebor-Huang/agda-categories | 5 | 8678 | <filename>src/Categories/Monad/Morphism.agda
{-# OPTIONS --without-K --safe #-}
open import Level
open import Categories.Category
open import Categories.Monad
module Categories.Monad.Morphism {o ℓ e} {C D : Category o ℓ e} where
open import Categories.NaturalTransformation
open import Categories.Functor
open NaturalTransformation
-- monad morphism in the sense of the nLab
-- https://ncatlab.org/nlab/show/monad#the_bicategory_of_monads
-- between generic monads t : a -> a & s : b -> b
record Monad⇒ (M : Monad C) (N : Monad D) : Set (o ⊔ ℓ ⊔ e) where
private
module M = Monad M
module N = Monad N
open module D = Category D using (_∘_; _≈_)
field
X : Functor C D
α : NaturalTransformation (N.F ∘F X) (X ∘F M.F)
module X = Functor X
module α = NaturalTransformation α
field
unit-comp : ∀ {U} → α.η U ∘ (N.η.η (X.₀ U)) ≈ X.₁ (M.η.η U)
mult-comp : ∀ {U} → α.η U ∘ (N.μ.η (X.₀ U)) ≈ X.₁ (M.μ.η U) ∘ α.η (M.F.₀ U) ∘ N.F.₁ (α.η U)
-- monad morphism in a different sense:
-- monads are on the same category, X is the identity
record Monad⇒-id (M N : Monad C) : Set (o ⊔ ℓ ⊔ e) where
private
module M = Monad M
module N = Monad N
field
α : NaturalTransformation N.F M.F
module α = NaturalTransformation α
open module C = Category C using (_∘_; _≈_)
field
unit-comp : ∀ {U} → α.η U ∘ N.η.η U ≈ M.η.η U
mult-comp : ∀ {U} → α.η U ∘ (N.μ.η U) ≈ M.μ.η U ∘ α.η (M.F.₀ U) ∘ N.F.₁ (α.η U)
-- monad 2-cell in the sense of https://ncatlab.org/nlab/show/monad#the_bicategory_of_monads
record Monad²⇒ {M : Monad C} {N : Monad D} (Γ Δ : Monad⇒ M N) : Set (o ⊔ ℓ ⊔ e) where
private
module M = Monad M
module N = Monad N
module Γ = Monad⇒ Γ
module Δ = Monad⇒ Δ
field
m : NaturalTransformation Γ.X Δ.X
module m = NaturalTransformation m
open module D = Category D using (_∘_; _≈_)
field
comm : ∀ {U} → Δ.α.η U ∘ N.F.₁ (m.η U) ≈ m.η (M.F.₀ U) ∘ Γ.α.η U |
regtests/asf-filters-tests.adb | jquorning/ada-asf | 12 | 14389 | -----------------------------------------------------------------------
-- Filters Tests - Unit tests for ASF.Filters
-- Copyright (C) 2015 <NAME>
-- Written by <NAME> (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body ASF.Filters.Tests is
-- ------------------------------
-- Increment the counter each time Do_Filter is called.
-- ------------------------------
procedure Do_Filter (F : in Test_Filter;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class;
Chain : in out ASF.Servlets.Filter_Chain) is
begin
F.Count.all := F.Count.all + 1;
ASF.Servlets.Do_Filter (Chain => Chain, Request => Request, Response => Response);
end Do_Filter;
-- ------------------------------
-- Initialize the test filter.
-- ------------------------------
overriding
procedure Initialize (Server : in out Test_Filter;
Config : in ASF.Servlets.Filter_Config) is
pragma Unreferenced (Config);
begin
Server.Count := Server.Counter'Unchecked_Access;
end Initialize;
end ASF.Filters.Tests;
|
oeis/054/A054118.asm | neoneye/loda-programs | 11 | 19672 | <filename>oeis/054/A054118.asm<gh_stars>10-100
; A054118: Subdiagonal T(n,n-3), array T as in A054115.
; Submitted by <NAME>(s2)
; 1,24,144,864,5904,46224,409104,4037904,43954704,522956304,6749977104,93928268304,1401602636304,22324392524304,378011820620304,6780385526348304
add $0,1
lpb $0
add $1,$0
add $0,1
add $1,2
mul $1,$0
sub $0,2
lpe
trn $1,7
mov $0,$1
add $0,1
|
tools-src/gnu/gcc/gcc/ada/exp_prag.adb | enfoTek/tomato.linksys.e2000.nvram-mod | 80 | 6500 | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ P R A G --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Casing; use Casing;
with Einfo; use Einfo;
with Errout; use Errout;
with Exp_Ch11; use Exp_Ch11;
with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
with Expander; use Expander;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with Stringt; use Stringt;
with Stand; use Stand;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
package body Exp_Prag is
-----------------------
-- Local Subprograms --
-----------------------
function Arg1 (N : Node_Id) return Node_Id;
function Arg2 (N : Node_Id) return Node_Id;
function Arg3 (N : Node_Id) return Node_Id;
-- Obtain specified Pragma_Argument_Association
procedure Expand_Pragma_Abort_Defer (N : Node_Id);
procedure Expand_Pragma_Assert (N : Node_Id);
procedure Expand_Pragma_Import (N : Node_Id);
procedure Expand_Pragma_Import_Export_Exception (N : Node_Id);
procedure Expand_Pragma_Inspection_Point (N : Node_Id);
procedure Expand_Pragma_Interrupt_Priority (N : Node_Id);
--------------
-- Arg1,2,3 --
--------------
function Arg1 (N : Node_Id) return Node_Id is
begin
return First (Pragma_Argument_Associations (N));
end Arg1;
function Arg2 (N : Node_Id) return Node_Id is
begin
return Next (Arg1 (N));
end Arg2;
function Arg3 (N : Node_Id) return Node_Id is
begin
return Next (Arg2 (N));
end Arg3;
---------------------
-- Expand_N_Pragma --
---------------------
procedure Expand_N_Pragma (N : Node_Id) is
begin
-- Note: we may have a pragma whose chars field is not a
-- recognized pragma, and we must ignore it at this stage.
if Is_Pragma_Name (Chars (N)) then
case Get_Pragma_Id (Chars (N)) is
-- Pragmas requiring special expander action
when Pragma_Abort_Defer =>
Expand_Pragma_Abort_Defer (N);
when Pragma_Assert =>
Expand_Pragma_Assert (N);
when Pragma_Export_Exception =>
Expand_Pragma_Import_Export_Exception (N);
when Pragma_Import =>
Expand_Pragma_Import (N);
when Pragma_Import_Exception =>
Expand_Pragma_Import_Export_Exception (N);
when Pragma_Inspection_Point =>
Expand_Pragma_Inspection_Point (N);
when Pragma_Interrupt_Priority =>
Expand_Pragma_Interrupt_Priority (N);
-- All other pragmas need no expander action
when others => null;
end case;
end if;
end Expand_N_Pragma;
-------------------------------
-- Expand_Pragma_Abort_Defer --
-------------------------------
-- An Abort_Defer pragma appears as the first statement in a handled
-- statement sequence (right after the begin). It defers aborts for
-- the entire statement sequence, but not for any declarations or
-- handlers (if any) associated with this statement sequence.
-- The transformation is to transform
-- pragma Abort_Defer;
-- statements;
-- into
-- begin
-- Abort_Defer.all;
-- statements
-- exception
-- when all others =>
-- Abort_Undefer.all;
-- raise;
-- at end
-- Abort_Undefer_Direct;
-- end;
procedure Expand_Pragma_Abort_Defer (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Stm : Node_Id;
Stms : List_Id;
HSS : Node_Id;
Blk : constant Entity_Id :=
New_Internal_Entity (E_Block, Current_Scope, Sloc (N), 'B');
begin
Stms := New_List (Build_Runtime_Call (Loc, RE_Abort_Defer));
loop
Stm := Remove_Next (N);
exit when No (Stm);
Append (Stm, Stms);
end loop;
HSS :=
Make_Handled_Sequence_Of_Statements (Loc,
Statements => Stms,
At_End_Proc =>
New_Occurrence_Of (RTE (RE_Abort_Undefer_Direct), Loc));
Rewrite (N,
Make_Block_Statement (Loc,
Handled_Statement_Sequence => HSS));
Set_Scope (Blk, Current_Scope);
Set_Etype (Blk, Standard_Void_Type);
Set_Identifier (N, New_Occurrence_Of (Blk, Sloc (N)));
Expand_At_End_Handler (HSS, Blk);
Analyze (N);
end Expand_Pragma_Abort_Defer;
--------------------------
-- Expand_Pragma_Assert --
--------------------------
procedure Expand_Pragma_Assert (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Cond : constant Node_Id := Expression (Arg1 (N));
Msg : String_Id;
begin
-- We already know that assertions are enabled, because otherwise
-- the semantic pass dealt with rewriting the assertion (see Sem_Prag)
pragma Assert (Assertions_Enabled);
-- Since assertions are on, we rewrite the pragma with its
-- corresponding if statement, and then analyze the statement
-- The expansion transforms:
-- pragma Assert (condition [,message]);
-- into
-- if not condition then
-- System.Assertions.Raise_Assert_Failure (Str);
-- end if;
-- where Str is the message if one is present, or the default of
-- file:line if no message is given.
-- First, we need to prepare the character literal
if Present (Arg2 (N)) then
Msg := Strval (Expr_Value_S (Expression (Arg2 (N))));
else
Build_Location_String (Loc);
Msg := String_From_Name_Buffer;
end if;
-- Now generate the if statement. Note that we consider this to be
-- an explicit conditional in the source, not an implicit if, so we
-- do not call Make_Implicit_If_Statement.
Rewrite (N,
Make_If_Statement (Loc,
Condition =>
Make_Op_Not (Loc,
Right_Opnd => Cond),
Then_Statements => New_List (
Make_Procedure_Call_Statement (Loc,
Name =>
New_Reference_To (RTE (RE_Raise_Assert_Failure), Loc),
Parameter_Associations => New_List (
Make_String_Literal (Loc, Msg))))));
Analyze (N);
-- If new condition is always false, give a warning
if Nkind (N) = N_Procedure_Call_Statement
and then Is_RTE (Entity (Name (N)), RE_Raise_Assert_Failure)
then
-- If original condition was a Standard.False, we assume
-- that this is indeed intented to raise assert error
-- and no warning is required.
if Is_Entity_Name (Original_Node (Cond))
and then Entity (Original_Node (Cond)) = Standard_False
then
return;
else
Error_Msg_N ("?assertion will fail at run-time", N);
end if;
end if;
end Expand_Pragma_Assert;
--------------------------
-- Expand_Pragma_Import --
--------------------------
-- When applied to a variable, the default initialization must not be
-- done. As it is already done when the pragma is found, we just get rid
-- of the call the initialization procedure which followed the object
-- declaration.
-- We can't use the freezing mechanism for this purpose, since we
-- have to elaborate the initialization expression when it is first
-- seen (i.e. this elaboration cannot be deferred to the freeze point).
procedure Expand_Pragma_Import (N : Node_Id) is
Def_Id : constant Entity_Id := Entity (Expression (Arg2 (N)));
Typ : Entity_Id;
After_Def : Node_Id;
begin
if Ekind (Def_Id) = E_Variable then
Typ := Etype (Def_Id);
After_Def := Next (Parent (Def_Id));
if Has_Non_Null_Base_Init_Proc (Typ)
and then Nkind (After_Def) = N_Procedure_Call_Statement
and then Is_Entity_Name (Name (After_Def))
and then Entity (Name (After_Def)) = Base_Init_Proc (Typ)
then
Remove (After_Def);
elsif Is_Access_Type (Typ) then
Set_Expression (Parent (Def_Id), Empty);
end if;
end if;
end Expand_Pragma_Import;
-------------------------------------------
-- Expand_Pragma_Import_Export_Exception --
-------------------------------------------
-- For a VMS exception fix up the language field with "VMS"
-- instead of "Ada" (gigi needs this), create a constant that will be the
-- value of the VMS condition code and stuff the Interface_Name field
-- with the unexpanded name of the exception (if not already set).
-- For a Ada exception, just stuff the Interface_Name field
-- with the unexpanded name of the exception (if not already set).
procedure Expand_Pragma_Import_Export_Exception (N : Node_Id) is
Id : constant Entity_Id := Entity (Expression (Arg1 (N)));
Call : constant Node_Id := Register_Exception_Call (Id);
Loc : constant Source_Ptr := Sloc (N);
begin
if Present (Call) then
declare
Excep_Internal : constant Node_Id :=
Make_Defining_Identifier
(Loc, New_Internal_Name ('V'));
Export_Pragma : Node_Id;
Excep_Alias : Node_Id;
Excep_Object : Node_Id;
Excep_Image : String_Id;
Exdata : List_Id;
Lang1 : Node_Id;
Lang2 : Node_Id;
Lang3 : Node_Id;
Code : Node_Id;
begin
if Present (Interface_Name (Id)) then
Excep_Image := Strval (Interface_Name (Id));
else
Get_Name_String (Chars (Id));
Set_All_Upper_Case;
Excep_Image := String_From_Name_Buffer;
end if;
Exdata := Component_Associations (Expression (Parent (Id)));
if Is_VMS_Exception (Id) then
Lang1 := Next (First (Exdata));
Lang2 := Next (Lang1);
Lang3 := Next (Lang2);
Rewrite (Expression (Lang1),
Make_Character_Literal (Loc, Name_uV, Get_Char_Code ('V')));
Analyze (Expression (Lang1));
Rewrite (Expression (Lang2),
Make_Character_Literal (Loc, Name_uM, Get_Char_Code ('M')));
Analyze (Expression (Lang2));
Rewrite (Expression (Lang3),
Make_Character_Literal (Loc, Name_uS, Get_Char_Code ('S')));
Analyze (Expression (Lang3));
if Exception_Code (Id) /= No_Uint then
Code := Make_Integer_Literal (Loc, Exception_Code (Id));
Excep_Object :=
Make_Object_Declaration (Loc,
Defining_Identifier => Excep_Internal,
Object_Definition =>
New_Reference_To (Standard_Integer, Loc));
Insert_Action (N, Excep_Object);
Analyze (Excep_Object);
Start_String;
Store_String_Int (UI_To_Int (Exception_Code (Id)) / 8 * 8);
Excep_Alias :=
Make_Pragma
(Loc,
Name_Linker_Alias,
New_List
(Make_Pragma_Argument_Association
(Sloc => Loc,
Expression =>
New_Reference_To (Excep_Internal, Loc)),
Make_Pragma_Argument_Association
(Sloc => Loc,
Expression =>
Make_String_Literal
(Sloc => Loc,
Strval => End_String))));
Insert_Action (N, Excep_Alias);
Analyze (Excep_Alias);
Export_Pragma :=
Make_Pragma
(Loc,
Name_Export,
New_List
(Make_Pragma_Argument_Association
(Sloc => Loc,
Expression => Make_Identifier (Loc, Name_C)),
Make_Pragma_Argument_Association
(Sloc => Loc,
Expression =>
New_Reference_To (Excep_Internal, Loc)),
Make_Pragma_Argument_Association
(Sloc => Loc,
Expression =>
Make_String_Literal
(Sloc => Loc,
Strval => Excep_Image)),
Make_Pragma_Argument_Association
(Sloc => Loc,
Expression =>
Make_String_Literal
(Sloc => Loc,
Strval => Excep_Image))));
Insert_Action (N, Export_Pragma);
Analyze (Export_Pragma);
else
Code :=
Unchecked_Convert_To (Standard_Integer,
Make_Function_Call (Loc,
Name =>
New_Reference_To (RTE (RE_Import_Value), Loc),
Parameter_Associations => New_List
(Make_String_Literal (Loc,
Strval => Excep_Image))));
end if;
Rewrite (Call,
Make_Procedure_Call_Statement (Loc,
Name => New_Reference_To
(RTE (RE_Register_VMS_Exception), Loc),
Parameter_Associations => New_List (Code)));
Analyze_And_Resolve (Code, Standard_Integer);
Analyze (Call);
end if;
if not Present (Interface_Name (Id)) then
Set_Interface_Name (Id,
Make_String_Literal
(Sloc => Loc,
Strval => Excep_Image));
end if;
end;
end if;
end Expand_Pragma_Import_Export_Exception;
------------------------------------
-- Expand_Pragma_Inspection_Point --
------------------------------------
-- If no argument is given, then we supply a default argument list that
-- includes all objects declared at the source level in all subprograms
-- that enclose the inspection point pragma.
procedure Expand_Pragma_Inspection_Point (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
A : List_Id;
Assoc : Node_Id;
S : Entity_Id;
E : Entity_Id;
begin
if No (Pragma_Argument_Associations (N)) then
A := New_List;
S := Current_Scope;
while S /= Standard_Standard loop
E := First_Entity (S);
while Present (E) loop
if Comes_From_Source (E)
and then Is_Object (E)
and then not Is_Entry_Formal (E)
and then Ekind (E) /= E_Component
and then Ekind (E) /= E_Discriminant
and then Ekind (E) /= E_Generic_In_Parameter
and then Ekind (E) /= E_Generic_In_Out_Parameter
then
Append_To (A,
Make_Pragma_Argument_Association (Loc,
Expression => New_Occurrence_Of (E, Loc)));
end if;
Next_Entity (E);
end loop;
S := Scope (S);
end loop;
Set_Pragma_Argument_Associations (N, A);
end if;
-- Expand the arguments of the pragma. Expanding an entity reference
-- is a noop, except in a protected operation, where a reference may
-- have to be transformed into a reference to the corresponding prival.
-- Are there other pragmas that may require this ???
Assoc := First (Pragma_Argument_Associations (N));
while Present (Assoc) loop
Expand (Expression (Assoc));
Next (Assoc);
end loop;
end Expand_Pragma_Inspection_Point;
--------------------------------------
-- Expand_Pragma_Interrupt_Priority --
--------------------------------------
-- Supply default argument if none exists (System.Interrupt_Priority'Last)
procedure Expand_Pragma_Interrupt_Priority (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
begin
if No (Pragma_Argument_Associations (N)) then
Set_Pragma_Argument_Associations (N, New_List (
Make_Pragma_Argument_Association (Loc,
Expression =>
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (RTE (RE_Interrupt_Priority), Loc),
Attribute_Name => Name_Last))));
end if;
end Expand_Pragma_Interrupt_Priority;
end Exp_Prag;
|
Transynther/x86/_processed/US/_ht_zr_/i9-9900K_12_0xca.log_21829_179.asm | ljhsiun2/medusa | 9 | 247771 | <gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r14
push %r8
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_WT_ht+0x1b5f, %rsi
lea addresses_WT_ht+0x29a2, %rdi
nop
nop
nop
nop
nop
inc %r11
mov $22, %rcx
rep movsb
nop
nop
nop
nop
sub %r13, %r13
lea addresses_UC_ht+0x5549, %r14
nop
nop
nop
nop
nop
cmp $51389, %rax
mov (%r14), %r11d
nop
nop
nop
nop
nop
and %rcx, %rcx
lea addresses_UC_ht+0x2737, %rsi
lea addresses_A_ht+0xdaaf, %rdi
nop
add $24266, %r14
mov $60, %rcx
rep movsq
dec %rax
lea addresses_WT_ht+0xb9c1, %rcx
nop
nop
nop
inc %r13
mov (%rcx), %rsi
nop
nop
nop
sub %r13, %r13
lea addresses_WT_ht+0x69cf, %rsi
lea addresses_WT_ht+0x17f11, %rdi
nop
nop
nop
nop
nop
dec %r8
mov $51, %rcx
rep movsb
nop
nop
nop
nop
and $44687, %rdi
lea addresses_WT_ht+0x150f, %r13
nop
nop
nop
nop
nop
and %rcx, %rcx
mov $0x6162636465666768, %r14
movq %r14, %xmm5
movups %xmm5, (%r13)
nop
sub $55079, %r14
lea addresses_WC_ht+0x10da5, %rax
nop
cmp $57768, %rsi
mov (%rax), %r11
nop
xor $15035, %rcx
lea addresses_normal_ht+0xe5ef, %rsi
lea addresses_normal_ht+0x6caf, %rdi
nop
nop
nop
inc %r14
mov $25, %rcx
rep movsl
nop
sub $49106, %r14
lea addresses_D_ht+0xf3b3, %r11
nop
nop
nop
nop
nop
and %rax, %rax
mov (%r11), %si
nop
nop
inc %rax
lea addresses_UC_ht+0x1b339, %r11
nop
inc %r8
and $0xffffffffffffffc0, %r11
vmovaps (%r11), %ymm7
vextracti128 $0, %ymm7, %xmm7
vpextrq $1, %xmm7, %rax
nop
sub %r13, %r13
lea addresses_UC_ht+0x14b7, %r11
sub %r8, %r8
mov (%r11), %rax
sub $58919, %rsi
lea addresses_A_ht+0xb4af, %rsi
lea addresses_normal_ht+0x12eaf, %rdi
nop
nop
nop
inc %rax
mov $86, %rcx
rep movsl
nop
nop
nop
nop
cmp %r13, %r13
pop %rsi
pop %rdi
pop %rcx
pop %rax
pop %r8
pop %r14
pop %r13
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r15
push %r9
push %rax
push %rbx
push %rcx
push %rsi
// Store
lea addresses_A+0xf62b, %r15
nop
nop
nop
nop
xor $20179, %rsi
mov $0x5152535455565758, %rcx
movq %rcx, (%r15)
nop
sub %rbx, %rbx
// Store
lea addresses_D+0xccdf, %rbx
nop
nop
nop
nop
sub $47190, %r10
mov $0x5152535455565758, %r9
movq %r9, %xmm2
movups %xmm2, (%rbx)
nop
nop
nop
nop
nop
sub $36524, %r9
// Load
lea addresses_normal+0x1e98f, %rbx
clflush (%rbx)
nop
nop
nop
nop
add %rax, %rax
mov (%rbx), %r15
nop
nop
nop
sub %r9, %r9
// Faulty Load
lea addresses_US+0x104af, %rax
and %rbx, %rbx
movups (%rax), %xmm6
vpextrq $1, %xmm6, %r9
lea oracles, %rax
and $0xff, %r9
shlq $12, %r9
mov (%rax,%r9,1), %r9
pop %rsi
pop %rcx
pop %rbx
pop %rax
pop %r9
pop %r15
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'size': 32, 'NT': False, 'type': 'addresses_US', 'same': False, 'AVXalign': False, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'size': 8, 'NT': False, 'type': 'addresses_A', 'same': False, 'AVXalign': False, 'congruent': 2}}
{'OP': 'STOR', 'dst': {'size': 16, 'NT': False, 'type': 'addresses_D', 'same': False, 'AVXalign': False, 'congruent': 4}}
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_normal', 'same': False, 'AVXalign': False, 'congruent': 4}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'size': 16, 'NT': False, 'type': 'addresses_US', 'same': True, 'AVXalign': False, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_WT_ht', 'congruent': 4}, 'dst': {'same': False, 'type': 'addresses_WT_ht', 'congruent': 0}}
{'OP': 'LOAD', 'src': {'size': 4, 'NT': False, 'type': 'addresses_UC_ht', 'same': False, 'AVXalign': False, 'congruent': 1}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_UC_ht', 'congruent': 3}, 'dst': {'same': False, 'type': 'addresses_A_ht', 'congruent': 6}}
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_WT_ht', 'same': False, 'AVXalign': False, 'congruent': 1}}
{'OP': 'REPM', 'src': {'same': True, 'type': 'addresses_WT_ht', 'congruent': 1}, 'dst': {'same': False, 'type': 'addresses_WT_ht', 'congruent': 1}}
{'OP': 'STOR', 'dst': {'size': 16, 'NT': False, 'type': 'addresses_WT_ht', 'same': False, 'AVXalign': False, 'congruent': 3}}
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_WC_ht', 'same': False, 'AVXalign': False, 'congruent': 1}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_normal_ht', 'congruent': 6}, 'dst': {'same': False, 'type': 'addresses_normal_ht', 'congruent': 11}}
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_D_ht', 'same': False, 'AVXalign': False, 'congruent': 2}}
{'OP': 'LOAD', 'src': {'size': 32, 'NT': False, 'type': 'addresses_UC_ht', 'same': False, 'AVXalign': True, 'congruent': 0}}
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_UC_ht', 'same': False, 'AVXalign': False, 'congruent': 3}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_A_ht', 'congruent': 11}, 'dst': {'same': False, 'type': 'addresses_normal_ht', 'congruent': 9}}
{'44': 3766, '45': 9888, '00': 8031, '47': 144}
44 00 00 00 45 45 00 45 00 45 44 45 45 00 44 45 44 45 00 44 45 00 45 45 00 00 45 00 00 00 45 44 00 45 45 45 45 00 45 44 45 00 45 45 00 45 00 44 00 45 44 00 44 45 44 45 00 45 00 45 45 45 45 00 00 45 00 45 00 45 00 45 00 45 00 45 45 45 45 45 00 44 45 00 00 45 44 45 00 45 45 45 45 00 45 00 45 00 45 00 00 00 45 45 00 44 45 45 45 00 00 45 45 00 45 00 44 45 00 44 45 00 00 45 00 45 44 00 44 45 00 44 45 00 45 00 00 45 00 45 00 45 44 45 44 00 44 00 45 44 45 00 45 45 00 45 00 45 45 00 44 00 45 45 44 45 00 44 45 47 00 45 45 00 44 45 00 44 45 00 45 00 44 45 00 00 00 44 45 47 00 45 00 45 00 45 45 00 45 00 44 45 00 45 00 00 45 00 45 44 00 45 44 00 00 00 45 00 45 00 44 45 00 45 00 45 00 44 45 45 44 45 00 45 45 00 45 00 00 00 45 45 00 00 45 00 44 00 00 45 45 00 45 00 45 44 45 45 00 44 45 44 00 00 45 45 00 45 45 44 45 45 00 00 00 00 45 00 45 45 45 44 45 45 44 45 45 44 45 00 44 45 00 45 00 00 45 44 45 00 00 45 45 00 00 45 44 45 45 00 44 45 44 45 44 45 00 45 00 44 45 47 45 45 00 45 00 45 45 00 45 45 00 45 44 45 45 45 00 44 45 00 44 45 44 00 45 45 00 45 00 45 44 45 44 45 00 45 00 45 45 45 00 45 00 45 45 00 44 45 00 44 45 00 45 00 44 00 45 45 00 45 45 00 44 45 00 44 45 45 00 44 45 00 45 00 44 45 00 45 45 00 45 00 45 45 00 44 45 00 45 44 45 45 45 45 45 00 44 45 44 45 00 44 45 45 45 45 45 00 44 45 00 45 45 44 45 00 44 45 00 45 00 44 00 45 00 45 00 45 00 45 45 44 45 00 44 45 00 45 00 45 44 45 44 45 44 45 00 44 45 45 45 45 45 00 44 45 44 45 00 44 45 00 44 00 44 45 00 45 00 44 00 45 00 00 00 00 45 00 00 45 44 00 44 45 00 45 00 45 00 44 45 00 00 45 00 45 00 45 45 00 00 45 00 45 44 45 45 44 45 45 45 44 45 00 45 45 45 00 00 00 45 45 00 45 44 45 00 44 45 45 45 00 00 45 00 44 00 45 45 00 00 45 00 45 44 45 00 45 45 00 45 00 45 45 00 45 00 45 45 45 45 00 44 45 00 45 45 44 45 00 44 00 44 45 00 44 45 45 45 00 00 45 45 00 45 45 45 00 00 45 00 45 45 00 45 45 00 44 45 00 45 45 00 45 44 45 00 44 45 00 00 44 00 45 44 45 45 45 00 44 45 00 44 00 44 45 00 45 00 45 00 45 45 45 45 00 44 45 00 00 44 45 00 44 45 00 45 00 45 45 45 45 00 44 45 00 44 45 00 45 00 00 45 00 00 45 00 00 45 00 00 45 45 00 45 00 45 45 00 44 00 45 45 00 45 00 44 45 00 44 45 44 45 45 00 00 45 00 45 44 45 45 00 45 47 00 00 44 45 00 44 45 00 00 45 00 00 00 44 45 45 00 45 45 45 45 00 44 45 44 45 00 44 00 45 47 00 45 44 45 44 45 00 45 00 00 45 00 44 45 00 44 45 00 45 45 00 44 00 45 00 45 00 00 45 44 45 00 45 00 45 45 45 00 44 45 00 45 00 00 45 00 45 00 00 45 45 00 45 44 00 44 45 00 45 00 45 00 45 45 00 45 00 44 45 00 00 45 00 45 00 45 00 45 44 00 00 45 45 00 45 00 44 00 45 00 45 44 45 45 00 44 45 00 44 00 44 45 00 44 45 00 45 00 45 44 45 45 44 45 45 00 00 00 45 45 00 45 44 45 44 45 00 00 45 44 00 44 45 00 45 00 45 45 45 00 45 00 00 45 00 00 00 45 00 45 44 00 44 00 45 44 45 00 44 45 45 45 00 45 44 45 00 45 44 45 00 44 00 00 45 45 00 00 45 45 00 45 00 45 45 00 45 00 44 00 00 00 45 00 00 00 45 44 45 00 44 45 00 45 45 00 45 45 45 00 44 45 00 44 45 00 45 00 44 00 45 44 45 45 00 00 00 44 45 00 45 00 44 45 44 00 45 00 00 45 44 45
*/
|
Transynther/x86/_processed/NONE/_st_/i7-7700_9_0xca.log_63_1326.asm | ljhsiun2/medusa | 9 | 97283 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r12
push %r13
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x1bce8, %rsi
lea addresses_normal_ht+0x17800, %rdi
cmp %r10, %r10
mov $33, %rcx
rep movsw
nop
nop
nop
nop
nop
dec %rsi
lea addresses_D_ht+0x19718, %r13
nop
nop
nop
and %rsi, %rsi
movl $0x61626364, (%r13)
nop
nop
nop
cmp $41217, %r13
lea addresses_normal_ht+0x1ca00, %rcx
nop
nop
nop
nop
sub %r12, %r12
mov (%rcx), %r10d
xor $15019, %rdi
lea addresses_WC_ht+0xb700, %rcx
clflush (%rcx)
nop
nop
xor %rbx, %rbx
mov (%rcx), %edi
nop
nop
nop
nop
dec %r10
lea addresses_normal_ht+0xb700, %r12
nop
add %rdi, %rdi
mov $0x6162636465666768, %r10
movq %r10, (%r12)
cmp $10089, %rdi
lea addresses_normal_ht+0x20b0, %rsi
lea addresses_UC_ht+0xf450, %rdi
add %r13, %r13
mov $8, %rcx
rep movsw
nop
nop
xor $7340, %rbx
lea addresses_normal_ht+0x700, %r13
and %r10, %r10
mov (%r13), %rbx
nop
add %rbx, %rbx
lea addresses_normal_ht+0x10af0, %rsi
lea addresses_A_ht+0x6c92, %rdi
nop
cmp %r11, %r11
mov $5, %rcx
rep movsw
nop
and %r11, %r11
lea addresses_WT_ht+0x15646, %r13
sub %rsi, %rsi
movw $0x6162, (%r13)
nop
cmp $24563, %rcx
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %r13
pop %r12
pop %r11
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r15
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
// Load
lea addresses_PSE+0x1eb00, %r15
nop
nop
nop
nop
nop
add %rbp, %rbp
movups (%r15), %xmm7
vpextrq $0, %xmm7, %r11
nop
nop
nop
nop
nop
xor %rsi, %rsi
// Store
mov $0x700, %rdi
xor %rbp, %rbp
movb $0x51, (%rdi)
and %rcx, %rcx
// Load
lea addresses_US+0x6f00, %rbp
nop
nop
nop
sub $64172, %rcx
vmovups (%rbp), %ymm3
vextracti128 $1, %ymm3, %xmm3
vpextrq $1, %xmm3, %rdi
sub %rbp, %rbp
// Faulty Load
lea addresses_UC+0xd700, %rbp
nop
nop
nop
nop
xor $50457, %rdx
mov (%rbp), %edi
lea oracles, %r15
and $0xff, %rdi
shlq $12, %rdi
mov (%r15,%rdi,1), %rdi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbp
pop %r15
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'congruent': 0, 'AVXalign': False, 'same': True, 'size': 8, 'NT': False, 'type': 'addresses_UC'}, 'OP': 'LOAD'}
{'src': {'congruent': 10, 'AVXalign': False, 'same': False, 'size': 16, 'NT': False, 'type': 'addresses_PSE'}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'congruent': 10, 'AVXalign': False, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_P'}}
{'src': {'congruent': 9, 'AVXalign': False, 'same': False, 'size': 32, 'NT': False, 'type': 'addresses_US'}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'congruent': 0, 'AVXalign': False, 'same': True, 'size': 4, 'NT': False, 'type': 'addresses_UC'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'congruent': 2, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'REPM', 'dst': {'congruent': 8, 'same': False, 'type': 'addresses_normal_ht'}}
{'OP': 'STOR', 'dst': {'congruent': 3, 'AVXalign': False, 'same': False, 'size': 4, 'NT': False, 'type': 'addresses_D_ht'}}
{'src': {'congruent': 3, 'AVXalign': False, 'same': False, 'size': 4, 'NT': False, 'type': 'addresses_normal_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 9, 'AVXalign': False, 'same': False, 'size': 4, 'NT': False, 'type': 'addresses_WC_ht'}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'congruent': 8, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_normal_ht'}}
{'src': {'congruent': 0, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'REPM', 'dst': {'congruent': 1, 'same': True, 'type': 'addresses_UC_ht'}}
{'src': {'congruent': 9, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_normal_ht'}, 'OP': 'LOAD'}
{'src': {'congruent': 4, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'REPM', 'dst': {'congruent': 1, 'same': False, 'type': 'addresses_A_ht'}}
{'OP': 'STOR', 'dst': {'congruent': 0, 'AVXalign': False, 'same': False, 'size': 2, 'NT': False, 'type': 'addresses_WT_ht'}}
{'51': 63}
51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51
*/
|
oeis/173/A173174.asm | neoneye/loda-programs | 11 | 24911 | ; A173174: a(n) = cosh(2*n*arcsinh(sqrt(n))).
; Submitted by <NAME>
; 1,3,49,1351,51841,2550251,153090001,10850138895,886731088897,82094249361619,8491781781142001,970614726270742103,121485428812828080001,16525390478051500325307,2427469037137019032095121,382956978214541873571486751,64576903826545426454350012417,11591229031806966336496244914595,2206546131691748386970611319790001,444028496673543931668756457170350439,94179198378899858652917080663277136001,20999265592563616514144080484358998857099,4910496753411315649206374729779310445940049
mov $3,$0
mul $3,4
mov $4,1
lpb $0
sub $0,1
add $1,1
add $2,$3
mul $2,$1
add $4,$2
add $1,$4
mov $2,0
lpe
mov $0,$4
div $0,2
add $0,1
|
programs/oeis/025/A025695.asm | jmorken/loda | 1 | 85685 | ; A025695: Index of 2^n within sequence of numbers of form 2^i*10^j.
; 1,2,3,4,6,8,10,13,16,19,23,27,31,35,40,45,50,56,62,68,75,82,89,96,104,112,120,129,138,147,157,167,177,187,198,209,220,232,244,256,269,282,295,308,322,336,350,365,380,395,411,427,443,459,476,493,510,528,546,564,583
mov $2,$0
mov $3,$0
mov $4,$0
lpb $3
mov $0,4
lpb $0
sub $0,1
trn $2,3
add $1,$2
lpe
sub $1,$2
add $2,2
mov $3,$2
lpe
lpb $4
add $1,1
sub $4,1
lpe
add $1,1
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca_notsx.log_21829_1283.asm | ljhsiun2/medusa | 9 | 162907 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r15
push %r8
push %r9
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x19d6e, %rsi
lea addresses_WT_ht+0xaaae, %rdi
clflush (%rdi)
nop
dec %r9
mov $24, %rcx
rep movsl
nop
and $7445, %r12
lea addresses_WC_ht+0x140a, %r15
nop
nop
sub %r8, %r8
movb (%r15), %r9b
nop
nop
dec %rdi
lea addresses_normal_ht+0x2496, %rdi
nop
nop
nop
sub %r15, %r15
movl $0x61626364, (%rdi)
nop
nop
nop
nop
cmp $65146, %rdi
lea addresses_A_ht+0x1aae, %r8
nop
nop
dec %r15
mov (%r8), %cx
add $58299, %rcx
lea addresses_normal_ht+0xdeae, %rdi
nop
sub %r9, %r9
movl $0x61626364, (%rdi)
and %rdi, %rdi
lea addresses_WC_ht+0x5eae, %rsi
nop
nop
cmp %r12, %r12
mov $0x6162636465666768, %rdi
movq %rdi, %xmm3
vmovups %ymm3, (%rsi)
nop
nop
nop
dec %rsi
pop %rsi
pop %rdi
pop %rcx
pop %r9
pop %r8
pop %r15
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r11
push %r12
push %r13
push %rax
// Faulty Load
lea addresses_normal+0x82ae, %r10
nop
and %r13, %r13
movups (%r10), %xmm2
vpextrq $0, %xmm2, %r11
lea oracles, %r10
and $0xff, %r11
shlq $12, %r11
mov (%r10,%r11,1), %r11
pop %rax
pop %r13
pop %r12
pop %r11
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 0, 'same': False, 'type': 'addresses_normal'}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 0, 'same': True, 'type': 'addresses_normal'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'congruent': 4, 'same': False, 'type': 'addresses_A_ht'}, 'dst': {'congruent': 5, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'REPM'}
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 0, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 1, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'STOR'}
{'src': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 10, 'same': False, 'type': 'addresses_A_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 10, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 7, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'STOR'}
{'34': 21829}
34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34
*/
|
agda/BBHeap/Everything.agda | bgbianchi/sorting | 6 | 17518 | open import Relation.Binary.Core
module BBHeap.Everything {A : Set}
(_≤_ : A → A → Set)
(tot≤ : Total _≤_)
(trans≤ : Transitive _≤_) where
open import BBHeap.Complete.Base _≤_
open import BBHeap.Drop _≤_ tot≤ trans≤
open import BBHeap.DropLast _≤_
open import BBHeap.Heap _≤_
open import BBHeap.Height.Convert _≤_ tot≤
open import BBHeap.Height.Log _≤_ tot≤
open import BBHeap.Last
|
src/templates/ada/avtas/lmcp/avtas-lmcp-bytebuffers.adb | joffreyhuguet/LmcpGen | 0 | 15958 | <gh_stars>0
with System.Storage_Elements; use System.Storage_Elements;
with GNAT.Byte_Swapping;
with Ada.Unchecked_Conversion;
package body AVTAS.LMCP.ByteBuffers is
---------------
-- Raw_Bytes --
---------------
function Raw_Bytes (This : ByteBuffer) return Byte_Array is
(This.Content (1 .. This.Length));
---------------
-- Raw_Bytes --
---------------
function Raw_Bytes (This : ByteBuffer) return String is
Result : String (1 .. Positive (This.Length));
begin
for K in 1 .. This.Length loop
Result (Positive (K)) := Character'Val (This.Content (K));
end loop;
return Result;
end Raw_Bytes;
------------
-- Rewind --
------------
procedure Rewind (This : in out ByteBuffer) is
begin
This.Position := 1;
end Rewind;
-----------
-- Clear --
-----------
procedure Clear (This : in out ByteBuffer) is
begin
This.Rewind;
This.Length := 0;
end Clear;
---------------
-- Remaining --
---------------
function Remaining (This : ByteBuffer) return UInt32 is
(This.Capacity - This.Position + 1);
-------------------
-- Has_Remaining --
-------------------
function Has_Remaining (This : ByteBuffer) return Boolean is
(Remaining (This) > 0);
--------------
-- Position --
--------------
function Position (This : ByteBuffer) return UInt32 is
(This.Position);
------------
-- Length --
------------
function Length (This : ByteBuffer) return UInt32 is
(This.Length);
--------------
-- Checksum --
--------------
function Checksum (This : ByteBuffer; From, To : Index) return UInt32 is
Result : UInt32 := 0;
begin
for K in Index range From .. To loop
Result := Result + UInt32 (This.Content (K));
end loop;
return Result;
end Checksum;
-----------------
-- Overlapping --
-----------------
function Overlapping (Destination, Source : Address; Count : Storage_Count) return Boolean is
(for some Location in To_Integer (Destination) .. To_Integer (Destination + Count - 1) =>
Location in To_Integer (Source) .. To_Integer (Source + Count - 1))
with Pre => Source /= Null_Address and
Destination /= Null_Address;
-------------
-- MemCopy --
-------------
function MemCopy (Destination, Source : Address; Count : Storage_Count) return Address with
Import,
Convention => C,
Link_Name => "memcpy",
Pre => Source /= Null_Address and then
Destination /= Null_Address and then
Source /= Destination and then --- covered by Overlapping test but aids comprehension
not Overlapping (Destination, Source, Count),
Post => MemCopy'Result = Destination;
-- Copies Count bytes from the object designated by Source to the object
-- designated by Destination. Note the order of the address parameters is
-- critical so use the named association format for specifying actuals in
-- calls.
generic
type Inserted is private;
procedure Insert_2_Bytes
(Value : Inserted;
Buffer : in out Byte_Array;
Start : Index)
with
Pre => Start in Buffer'Range and then
Start + 2 - 1 in Buffer'Range;
generic
type Inserted is private;
procedure Insert_4_Bytes
(Value : Inserted;
Buffer : in out Byte_Array;
Start : Index)
with
Pre => Start in Buffer'Range and then
Start + 4 - 1 in Buffer'Range;
generic
type Inserted is private;
procedure Insert_8_Bytes
(Value : Inserted;
Buffer : in out Byte_Array;
Start : Index)
with
Pre => Start in Buffer'Range and then
Start + 8 - 1 in Buffer'Range;
generic
type Retrieved is private;
procedure Retrieve_2_Bytes
(Value : out Retrieved;
Buffer : Byte_Array;
Start : Index)
with
Pre => Start in Buffer'Range and then
Start + 2 - 1 in Buffer'Range;
generic
type Retrieved is private;
procedure Retrieve_4_Bytes
(Value : out Retrieved;
Buffer : Byte_Array;
Start : Index)
with
Pre => Start in Buffer'Range and then
Start + 4 - 1 in Buffer'Range;
generic
type Retrieved is private;
procedure Retrieve_8_Bytes
(Value : out Retrieved;
Buffer : Byte_Array;
Start : Index)
with
Pre => Start in Buffer'Range and then
Start + 8 - 1 in Buffer'Range;
--------------------
-- Insert_2_Bytes --
--------------------
procedure Insert_2_Bytes
(Value : Inserted;
Buffer : in out Byte_Array;
Start : Index)
is
subtype Bytes is Byte_Array (1 .. 2);
Buffer_Overlay : Bytes with Address => Buffer (Start)'Address;
function As_Bytes is new Ada.Unchecked_Conversion (Source => Inserted, Target => Bytes);
begin
pragma Compile_Time_Error (Inserted'Object_Size /= 2 * Storage_Unit, "Generic actual param should be 2 bytes");
Buffer_Overlay := As_Bytes (Value);
if Standard'Default_Scalar_Storage_Order /= System.High_Order_First then -- we're not on a Big Endinan machine
GNAT.Byte_Swapping.Swap2 (Buffer (Start)'Address);
end if;
end Insert_2_Bytes;
--------------------
-- Insert_4_Bytes --
--------------------
procedure Insert_4_Bytes
(Value : Inserted;
Buffer : in out Byte_Array;
Start : Index)
is
subtype Bytes is Byte_Array (1 .. 4);
Buffer_Overlay : Bytes with Address => Buffer (Start)'Address;
function As_Bytes is new Ada.Unchecked_Conversion (Source => Inserted, Target => Bytes);
begin
pragma Compile_Time_Error (Inserted'Object_Size /= 4 * Storage_Unit, "Generic actual param should be 4 bytes");
Buffer_Overlay := As_Bytes (Value);
if Standard'Default_Scalar_Storage_Order /= System.High_Order_First then -- we're not on a Big Endinan machine
GNAT.Byte_Swapping.Swap4 (Buffer (Start)'Address);
end if;
end Insert_4_Bytes;
--------------------
-- Insert_8_Bytes --
--------------------
procedure Insert_8_Bytes
(Value : Inserted;
Buffer : in out Byte_Array;
Start : Index)
is
subtype Bytes is Byte_Array (1 .. 8);
Buffer_Overlay : Bytes with Address => Buffer (Start)'Address;
function As_Bytes is new Ada.Unchecked_Conversion (Source => Inserted, Target => Bytes);
begin
pragma Compile_Time_Error (Inserted'Object_Size /= 8 * Storage_Unit, "Generic actual param should be 8 bytes");
Buffer_Overlay := As_Bytes (Value);
if Standard'Default_Scalar_Storage_Order /= System.High_Order_First then -- we're not on a Big Endinan machine
GNAT.Byte_Swapping.Swap8 (Buffer (Start)'Address);
end if;
end Insert_8_Bytes;
----------------------
-- Retrieve_2_Bytes --
----------------------
procedure Retrieve_2_Bytes
(Value : out Retrieved;
Buffer : Byte_Array;
Start : Index)
is
subtype Bytes is Byte_Array (1 .. 2);
Buffer_Overlay : Bytes with Address => Buffer (Start)'Address;
function As_Retrieved is new Ada.Unchecked_Conversion (Source => Bytes, Target => Retrieved);
begin
pragma Compile_Time_Error (Retrieved'Object_Size /= 2 * Storage_Unit, "Generic actual param should be 2 bytes");
Value := As_Retrieved (Buffer_Overlay);
if Standard'Default_Scalar_Storage_Order /= System.High_Order_First then -- we're not on a Big Endinan machine
GNAT.Byte_Swapping.Swap2 (Value'Address);
end if;
end Retrieve_2_Bytes;
----------------------
-- Retrieve_4_Bytes --
----------------------
procedure Retrieve_4_Bytes
(Value : out Retrieved;
Buffer : Byte_Array;
Start : Index)
is
subtype Bytes is Byte_Array (1 .. 4);
Buffer_Overlay : Bytes with Address => Buffer (Start)'Address;
function As_Retrieved is new Ada.Unchecked_Conversion (Source => Bytes, Target => Retrieved);
begin
pragma Compile_Time_Error (Retrieved'Object_Size /= 4 * Storage_Unit, "Generic actual param should be 4 bytes");
Value := As_Retrieved (Buffer_Overlay);
if Standard'Default_Scalar_Storage_Order /= System.High_Order_First then -- we're not on a Big Endinan machine
GNAT.Byte_Swapping.Swap4 (Value'Address);
end if;
end Retrieve_4_Bytes;
----------------------
-- Retrieve_8_Bytes --
----------------------
procedure Retrieve_8_Bytes
(Value : out Retrieved;
Buffer : Byte_Array;
Start : Index)
is
subtype Bytes is Byte_Array (1 .. 8);
Buffer_Overlay : Bytes with Address => Buffer (Start)'Address;
function As_Retrieved is new Ada.Unchecked_Conversion (Source => Bytes, Target => Retrieved);
begin
pragma Compile_Time_Error (Retrieved'Object_Size /= 8 * Storage_Unit, "Generic actual param should be 8 bytes");
Value := As_Retrieved (Buffer_Overlay);
if Standard'Default_Scalar_Storage_Order /= System.High_Order_First then -- we're not on a Big Endinan machine
GNAT.Byte_Swapping.Swap8 (Value'Address);
end if;
end Retrieve_8_Bytes;
-- Instances
procedure Insert_UInt16 is new Insert_2_Bytes (UInt16) with Inline;
procedure Retrieve_UInt16 is new Retrieve_2_Bytes (UInt16) with Inline;
procedure Insert_UInt32 is new Insert_4_Bytes (UInt32) with Inline;
procedure Retrieve_UInt32 is new Retrieve_4_Bytes (UInt32) with Inline;
procedure Insert_UInt64 is new Insert_8_Bytes (UInt64) with Inline;
procedure Retrieve_UInt64 is new Retrieve_8_Bytes (UInt64) with Inline;
procedure Insert_Int16 is new Insert_2_Bytes (Int16) with Inline;
procedure Retrieve_Int16 is new Retrieve_2_Bytes (Int16) with Inline;
procedure Insert_Int32 is new Insert_4_Bytes (Int32) with Inline;
procedure Retrieve_Int32 is new Retrieve_4_Bytes (Int32) with Inline;
procedure Insert_Int64 is new Insert_8_Bytes (Int64) with Inline;
procedure Retrieve_Int64 is new Retrieve_8_Bytes (Int64) with Inline;
procedure Insert_Float is new Insert_4_Bytes (Real32) with Inline;
procedure Retrieve_Float is new Retrieve_4_Bytes (Real32) with Inline;
procedure Insert_Double is new Insert_8_Bytes (Real64) with Inline;
procedure Retrieve_Double is new Retrieve_8_Bytes (Real64) with Inline;
--------------
-- Get_Byte --
--------------
procedure Get_Byte (This : in out ByteBuffer; Value : out Byte) is
begin
Value := This.Content (This.Position);
This.Position := This.Position + 1;
end Get_Byte;
-----------------
-- Get_Boolean --
-----------------
procedure Get_Boolean (This : in out ByteBuffer; Value : out Boolean) is
begin
Value := This.Content (This.Position) /= 0;
This.Position := This.Position + 1;
end Get_Boolean;
---------------
-- Get_Int16 --
---------------
procedure Get_Int16 (This : in out ByteBuffer; Value : out Int16) is
begin
Retrieve_Int16 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 2;
end Get_Int16;
----------------
-- Get_UInt16 --
----------------
procedure Get_UInt16 (This : in out ByteBuffer; Value : out UInt16) is
begin
Retrieve_UInt16 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 2;
end Get_UInt16;
---------------
-- Get_Int32 --
---------------
procedure Get_Int32 (This : in out ByteBuffer; Value : out Int32) is
begin
Retrieve_Int32 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 4;
end Get_Int32;
----------------
-- Get_UInt32 --
----------------
procedure Get_UInt32 (This : in out ByteBuffer; Value : out UInt32) is
begin
Retrieve_UInt32 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 4;
end Get_UInt32;
----------------
-- Get_UInt32 --
----------------
procedure Get_UInt32
(This : in ByteBuffer;
Value : out UInt32;
First : Index)
is
begin
Retrieve_UInt32 (Value, This.Content, Start => First);
-- Position is unchanged
end Get_UInt32;
---------------
-- Get_Int64 --
---------------
procedure Get_Int64 (This : in out ByteBuffer; Value : out Int64) is
begin
Retrieve_Int64 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 8;
end Get_Int64;
----------------
-- Get_UInt64 --
----------------
procedure Get_UInt64 (This : in out ByteBuffer; Value : out UInt64) is
begin
Retrieve_UInt64 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 8;
end Get_UInt64;
---------------
-- Get_Real32 --
---------------
procedure Get_Real32 (This : in out ByteBuffer; Value : out Real32) is
begin
Retrieve_Float (Value, This.Content, Start => This.Position);
This.Position := This.Position + 4;
end Get_Real32;
----------------
-- Get_Real64 --
----------------
procedure Get_Real64 (This : in out ByteBuffer; Value : out Real64) is
begin
Retrieve_Double (Value, This.Content, Start => This.Position);
This.Position := This.Position + 8;
end Get_Real64;
----------------
-- Get_String --
----------------
procedure Get_String
(This : in out ByteBuffer;
Value : out String;
Last : out Natural)
is
Result : System.Address with Unreferenced;
Length : UInt32;
begin
Retrieve_Int16 (Int16 (Length), This.Content, Start => This.Position);
This.Position := This.Position + 2;
if Length > This.Length then
Length := This.Length;
end if;
if Length = 0 then
Last := Value'First - 1;
else
Result := MemCopy (Source => This.Content (This.Position)'Address,
Destination => Value'Address,
Count => Storage_Count (Length));
This.Position := This.Position + Length;
Last := Value'First + Natural (Length) - 1;
end if;
end Get_String;
--------------------------
-- Get_Unbounded_String --
--------------------------
procedure Get_Unbounded_String
(This : in out ByteBuffer;
Value : out Unbounded_String)
is
Result : System.Address with Unreferenced;
Length : UInt16;
begin
Retrieve_UInt16 (Length, This.Content, Start => This.Position);
This.Position := This.Position + 2;
if Length > UInt16 (This.Length) then
Length := UInt16 (This.Length);
end if;
if Length = 0 then
Value := Null_Unbounded_String;
else
declare
S : String (1 .. Integer (Length));
begin
Result := MemCopy (Source => This.Content (This.Position)'Address,
Destination => S'Address,
Count => Storage_Count (Length));
This.Position := This.Position + Index (Length);
Value := To_Unbounded_String (S);
end;
end if;
end Get_Unbounded_String;
--------------
-- Put_Byte --
--------------
procedure Put_Byte (This : in out ByteBuffer; Value : Byte) is
begin
This.Content (This.Position) := Value;
This.Position := This.Position + 1;
This.Length := This.Length + 1;
end Put_Byte;
-----------------
-- Put_Boolean --
-----------------
procedure Put_Boolean (This : in out ByteBuffer; Value : Boolean) is
begin
This.Content (This.Position) := (if Value then 1 else 0);
This.Position := This.Position + 1;
This.Length := This.Length + 1;
end Put_Boolean;
---------------
-- Put_Int16 --
---------------
procedure Put_Int16 (This : in out ByteBuffer; Value : Int16) is
begin
Insert_Int16 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 2;
This.Length := This.Length + 2;
end Put_Int16;
----------------
-- Put_UInt16 --
----------------
procedure Put_UInt16 (This : in out ByteBuffer; Value : UInt16) is
begin
Insert_UInt16 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 2;
This.Length := This.Length + 2;
end Put_UInt16;
---------------
-- Put_Int32 --
---------------
procedure Put_Int32 (This : in out ByteBuffer; Value : Int32) is
begin
Insert_Int32 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 4;
This.Length := This.Length + 4;
end Put_Int32;
----------------
-- Put_UInt32 --
----------------
procedure Put_UInt32 (This : in out ByteBuffer; Value : UInt32) is
begin
Insert_UInt32 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 4;
This.Length := This.Length + 4;
end Put_UInt32;
---------------
-- Put_Int64 --
---------------
procedure Put_Int64 (This : in out ByteBuffer; Value : Int64) is
begin
Insert_Int64 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 8;
This.Length := This.Length + 8;
end Put_Int64;
----------------
-- Put_UInt64 --
----------------
procedure Put_UInt64 (This : in out ByteBuffer; Value : UInt64) is
begin
Insert_UInt64 (Value, This.Content, Start => This.Position);
This.Position := This.Position + 8;
This.Length := This.Length + 8;
end Put_UInt64;
---------------
-- Put_Real32 --
---------------
procedure Put_Real32 (This : in out ByteBuffer; Value : Real32) is
begin
Insert_Float (Value, This.Content, Start => This.Position);
This.Position := This.Position + 4;
This.Length := This.Length + 4;
end Put_Real32;
----------------
-- Put_Real64 --
----------------
procedure Put_Real64 (This : in out ByteBuffer; Value : Real64) is
begin
Insert_Double (Value, This.Content, Start => This.Position);
This.Position := This.Position + 8;
This.Length := This.Length + 8;
end Put_Real64;
----------------
-- Put_String --
----------------
procedure Put_String (This : in out ByteBuffer; Value : String) is
Result : System.Address with Unreferenced;
begin
Insert_Int16 (Value'Length, This.Content, Start => This.Position);
This.Position := This.Position + 2;
Result := MemCopy (Destination => This.Content (This.Position)'Address,
Source => Value'Address,
Count => Storage_Count (Value'Length));
This.Position := This.Position + Value'Length;
This.Length := This.Length + 2 + Value'Length;
end Put_String;
-------------------
-- Put_Raw_Bytes --
-------------------
procedure Put_Raw_Bytes ( This : in out ByteBuffer; Value : String) is
Result : System.Address with Unreferenced;
begin
Result := MemCopy (Destination => This.Content (This.Position)'Address,
Source => Value'Address,
Count => Storage_Count (Value'Length));
This.Position := This.Position + Value'Length;
This.Length := This.Length + Value'Length;
end Put_Raw_Bytes;
--------------------------
-- Put_Unbounded_String --
--------------------------
procedure Put_Unbounded_String (This : in out ByteBuffer; Value : Unbounded_String) is
begin
This.Put_String (To_String (Value));
end Put_Unbounded_String;
end AVTAS.LMCP.ByteBuffers;
|
processor/processor-eclipse_stack_p.adb | SMerrony/dgemua | 2 | 16661 | <filename>processor/processor-eclipse_stack_p.adb
-- MIT License
-- Copyright (c) 2021 <NAME>
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
with Ada.Text_IO; use Ada.Text_IO;
with Debug_Logs; use Debug_Logs;
with Resolver; use Resolver;
package body Processor.Eclipse_Stack_P is
procedure Do_Eclipse_Stack (I : in Decoded_Instr_T; CPU : in out CPU_T) is
Ring : Phys_Addr_T := CPU.PC and 16#7000_0000#;
First, Last, This_Ac : Natural;
Addr : Phys_Addr_T;
begin
case I.Instruction is
when I_POP =>
First := Natural(I.Acs);
Last := Natural(I.Acd);
if Last > First then First := First + 4; end if;
This_Ac := First;
loop
if CPU.Debug_Logging then
Loggers.Debug_Print (Debug_Log, "POP popping AC" & This_AC'Image);
end if;
CPU.AC(AC_Circle(This_AC)) := Dword_T(Narrow_Stack.Pop (Ring));
exit when This_Ac = Last;
This_Ac := This_Ac -1;
end loop;
when I_POPJ =>
Addr := Phys_Addr_T(Narrow_Stack.Pop(Ring));
CPU.PC := (Addr and 16#7fff#) or Ring;
return; -- because PC has been set
when I_PSH =>
First := Natural(I.Acs);
Last := Natural(I.Acd);
if Last < First then Last := Last + 4; end if;
for This_AC in First .. Last loop
if CPU.Debug_Logging then
Loggers.Debug_Print (Debug_Log, "PSH pushing AC" & This_AC'Image);
end if;
Narrow_Stack.Push (Ring, DG_Types.Lower_Word(CPU.AC(AC_Circle(This_AC))));
end loop;
when I_PSHJ =>
Narrow_Stack.Push (Ring, DG_Types.Lower_Word(DWord_T(CPU.PC)) + 2);
Addr := (Resolve_15bit_Disp (CPU, I.Ind, I.Mode, I.Disp_15, I.Disp_Offset) and 16#7fff#) or Ring;
CPU.PC := Addr;
return; -- because PC has been set
when I_RTN => -- complement of I_SAVE below
declare
NFP_Sav, Popped_Wd : Word_T;
begin
NFP_Sav := RAM.Read_Word (NFP_Loc or Ring);
RAM.Write_Word (NSP_Loc or Ring, NFP_Sav);
Popped_Wd := Narrow_Stack.Pop (Ring); -- 5
CPU.Carry := Test_W_Bit (Popped_Wd, 0);
CPU.PC := Phys_Addr_T(Popped_Wd and 16#7fff#) or Ring;
CPU.AC(3) := Dword_T(Narrow_Stack.Pop(Ring)); -- 4
CPU.AC(2) := Dword_T(Narrow_Stack.Pop(Ring)); -- 3
CPU.AC(1) := Dword_T(Narrow_Stack.Pop(Ring)); -- 2
CPU.AC(0) := Dword_T(Narrow_Stack.Pop(Ring)); -- 1
RAM.Write_Word (NFP_Loc or Ring, DG_Types.Lower_Word(CPU.AC(3)));
return; -- because PC has been set
end;
when I_SAVE =>
declare
NFP_Sav, NSP_Sav, Word : Word_T;
begin
NFP_Sav := RAM.Read_Word (NFP_Loc or Ring);
NSP_Sav := RAM.Read_Word (NSP_Loc or Ring);
Narrow_Stack.Push(Ring, DG_Types.Lower_Word(CPU.AC(0))); -- 1
Narrow_Stack.Push(Ring, DG_Types.Lower_Word(CPU.AC(1))); -- 2
Narrow_Stack.Push(Ring, DG_Types.Lower_Word(CPU.AC(2))); -- 3
Narrow_Stack.Push(Ring, NFP_Sav); -- 4
Word := DG_Types.Lower_Word(CPU.AC(3));
if CPU.Carry then
Word := Word or 16#8000#;
else
Word := Word and 16#7fff#;
end if;
Narrow_Stack.Push(Ring, Word); -- 5
RAM.Write_Word (NSP_Loc or Ring, NSP_Sav + 5 + Word_T(I.Imm_U16));
RAM.Write_Word (NFP_Loc or Ring, NSP_Sav + 5);
CPU.AC(3) := Dword_T(NSP_Sav) + 5;
end;
when others =>
Put_Line ("ERROR: Eclipse_Stack instruction " & To_String(I.Mnemonic) &
" not yet implemented");
raise Execution_Failure with "ERROR: Eclipse_Stack instruction " & To_String(I.Mnemonic) &
" not yet implemented";
end case;
CPU.PC := CPU.PC + Phys_Addr_T(I.Instr_Len);
end Do_Eclipse_Stack;
end Processor.Eclipse_Stack_P; |
programs/oeis/120/A120571.asm | neoneye/loda | 22 | 104558 | <reponame>neoneye/loda<gh_stars>10-100
; A120571: 2n^4+6n^2+4 = 2(n^2+1)(n^2+2).
; 12,60,220,612,1404,2812,5100,8580,13612,20604,30012,42340,58140,78012,102604,132612,168780,211900,262812,322404,391612,471420,562860,667012,785004,918012,1067260,1234020,1419612,1625404,1852812,2103300,2378380,2679612,3008604,3367012,3756540,4178940,4636012,5129604,5661612,6233980,6848700,7507812,8213404,8967612,9772620,10630660,11544012,12515004,13546012,14639460,15797820,17023612,18319404,19687812,21131500,22653180,24255612,25941604,27714012,29575740,31529740,33579012,35726604,37975612,40329180,42790500,45362812,48049404,50853612,53778820,56828460,60006012,63315004,66759012,70341660,74066620,77937612,81958404,86132812,90464700,94957980,99616612,104444604,109446012,114624940,119985540,125532012,131268604,137199612,143329380,149662300,156202812,162955404,169924612,177115020,184531260,192178012,200060004
add $0,1
pow $0,2
add $0,2
bin $0,2
mul $0,4
|
src/Optics/Example.agda | LaudateCorpus1/bft-consensus-agda | 0 | 6863 | <reponame>LaudateCorpus1/bft-consensus-agda
{- Byzantine Fault Tolerant Consensus Verification in Agda, version 0.9.
Copyright (c) 2020 Oracle and/or its affiliates.
Licensed under the Universal Permissive License v 1.0 as shown at https://opensource.oracle.com/licenses/upl
-}
open import Data.Nat
open import Data.Maybe
open import Data.Char
open import Data.String
open import Data.List hiding (product)
open import Relation.Binary.PropositionalEquality
import Relation.Binary.PropositionalEquality as PE
using (_≡_; refl)
import Relation.Binary.Definitions as BD
import Relation.Binary as RB
------------------------------------------------------------------------------
open import Function
open import Optics.All
module Optics.Example where
infixl 1 _&_
_&_ = Function._|>_
-- First we declare a record; which must be EXACTLY
-- like the record 'Person' below.
-- that is; must contain a constructor and
-- a number of /simple/ fields (of type Set; no proofs please!)
record Person : Set where
constructor person
field
pName : String
pAge : ℕ
-- Then, we do some template agda:
-- Yes,I know it looks weird; but it says:
-- Put 'pName' and 'pAge' into scope as
-- new identifiers; and run the metacomputation mkLens
-- passing this newly created identifiers; the mkLens
-- will then bind these identifiers to their respective
-- generated lenses for the record Person
--
-- IMPORTANT: Note how I did NOT /open Person/; otherwise, we'd
-- have to give different names to the lenses.
--
-- IMPORTANT: the list of names passed to unquoteDecl must come
-- in the same order as the fields of Person.
unquoteDecl pName pAge = mkLens (quote Person) (pName ∷ pAge ∷ [])
-- Ok; lets do more recors for fun
record Store : Set where
constructor store
field
sId : ℕ
sManager : Person
unquoteDecl sId sManager = mkLens (quote Store) (sId ∷ sManager ∷ [])
record Product : Set where
constructor product
field
pId : ℕ
pTag : String
pStore : Store
unquoteDecl pId pTag pStore = mkLens (quote Product)
(pId ∷ pTag ∷ pStore ∷ [])
-- Let's now do a simple example:
mary : Person
mary = person "Mary" 41
compilers-from-mary : Store
compilers-from-mary = store 0 mary
ghc : Product
ghc = product 13 "v8.0.0" compilers-from-mary
-- Now say mary turns 42 years old;
ghc-from-older-mary : Product
ghc-from-older-mary = ghc & pStore ∙ sManager ∙ pAge ∙~ 42
same-ghc-from-mary : Product
same-ghc-from-mary = ghc & pStore ∙ sManager ∙ pAge %~ suc
all-is-fine : ghc-from-older-mary ≡ same-ghc-from-mary
all-is-fine = refl
mary's-age-was-updated : ghc-from-older-mary ^∙ pStore ∙ sManager ∙ pAge ≡ 42
mary's-age-was-updated = refl
|
testcases/spatial3/spatial3.adb | jrmarino/AdaBase | 30 | 14008 | with AdaBase;
with Connect;
with CommonText;
with Ada.Text_IO;
with AdaBase.Results.Sets;
with Spatial_Data;
procedure Spatial3 is
package CON renames Connect;
package TIO renames Ada.Text_IO;
package ARS renames AdaBase.Results.Sets;
package CT renames CommonText;
package SD renames Spatial_Data;
procedure print_wkt (GM : SD.Geometry; cn, wkt : String);
procedure print_point (point : SD.Geometric_Point; label : String);
procedure print_wkt (GM : SD.Geometry; cn, wkt : String) is
begin
TIO.Put_Line ("");
TIO.Put_Line ("Column Name : " & cn);
TIO.Put_Line ("Geo subtype : " & SD.type_of_collection (GM)'Img);
TIO.Put_Line ("WKT value : " & wkt);
end print_wkt;
procedure print_point (point : SD.Geometric_Point; label : String) is
begin
TIO.Put_Line ("X=" & point.X'Img & " (" & label & ")");
TIO.Put_Line ("Y=" & point.Y'Img);
end print_point;
begin
CON.connect_database;
declare
sql : constant String := "SELECT * FROM spatial_plus";
stmt : CON.Stmt_Type := CON.DR.query (sql);
row : ARS.Datarow := stmt.fetch_next;
PT : constant String := "sp_point";
LN : constant String := "sp_linestring";
PG : constant String := "sp_polygon";
MP : constant String := "sp_multi_point";
ML : constant String := "sp_multi_line_string";
MPG : constant String := "sp_multi_polygon";
GC : constant String := "sp_geo_collection";
begin
TIO.Put_Line ("Demonstrate direct geometry retrieval and manipulation");
-- Point
print_wkt (row.column (PT).as_geometry, PT, row.column (PT).as_string);
print_point (SD.retrieve_point (row.column (PT).as_geometry), PT);
-- Line
print_wkt (row.column (LN).as_geometry, LN, row.column (LN).as_string);
declare
LNS : SD.Geometric_Line_String :=
SD.retrieve_line (row.column (LN).as_geometry);
begin
for component in LNS'Range loop
print_point (LNS (component), LN & component'Img);
end loop;
end;
-- Polygon
print_wkt (row.column (PG).as_geometry, PG, row.column (PG).as_string);
declare
PG1 : SD.Geometric_Polygon :=
SD.retrieve_polygon (row.column (PG).as_geometry);
ring_count : Natural := SD.number_of_rings (PG1);
begin
for Ring_ID in 1 .. ring_count loop
declare
RG : SD.Geometric_Ring := SD.retrieve_ring (PG1, Ring_ID);
SZ : Natural := RG'Length;
begin
TIO.Put_Line ("Ring#" & Ring_ID'Img);
for component in 1 .. SZ loop
print_point (RG (component), "point" & component'Img);
end loop;
end;
end loop;
end;
-- Multi-Point
declare
GM : SD.Geometry := row.column (MP).as_geometry;
SZ : Natural := SD.size_of_collection (GM);
begin
print_wkt (GM, MP, row.column (MP).as_string);
for component in 1 .. SZ loop
print_point (SD.retrieve_point (GM, component),
"Multipoint#" & component'Img);
end loop;
end;
-- Multi-Line
declare
GM : SD.Geometry := row.column (ML).as_geometry;
SZ : Natural := SD.size_of_collection (GM);
begin
print_wkt (GM, ML, row.column (ML).as_string);
for component in 1 .. SZ loop
declare
-- extract line string type
SLS : SD.Geometric_Line_String :=
SD.retrieve_line (GM, component);
-- convert to a simple geometry type
NGM : SD.Geometry := SD.initialize_as_line (SLS);
begin
TIO.Put_Line ("line#" & component'Img & ": " &
SD.Well_Known_Text (NGM));
end;
end loop;
end;
-- Multi-Polygon
declare
GM : SD.Geometry := row.column (MPG).as_geometry;
SZ : Natural := SD.size_of_collection (GM);
begin
print_wkt (GM, MPG, row.column (MPG).as_string);
for component in 1 .. SZ loop
declare
-- extract single polygon
SPG : SD.Geometric_Polygon :=
SD.retrieve_polygon (GM, component);
-- convert to a simple geometry type
NGM : SD.Geometry := SD.initialize_as_polygon (SPG);
num_rings : Natural := SD.number_of_rings (SPG);
begin
TIO.Put_Line ("polygon#" & component'Img & ": " &
SD.Well_Known_Text (NGM));
for ring in 2 .. num_rings loop
declare
IR : SD.Geometric_Ring := SD.retrieve_ring (SPG, ring);
newpoly : SD.Geometric_Polygon := SD.start_polygon (IR);
begin
TIO.Put_Line ("Inner ring" & Integer (ring - 1)'Img &
" of polygon" & component'Img & " : " &
SD.Well_Known_Text
(SD.initialize_as_polygon (newpoly)));
end;
end loop;
end;
end loop;
end;
-- Geometry Collection
declare
GM : SD.Geometry := row.column (GC).as_geometry;
SZ : Natural := SD.size_of_collection (GM);
begin
TIO.Put_Line ("");
TIO.Put_Line ("Column Name : " & GC);
TIO.Put_Line ("Geo subtype : " & SD.type_of_collection (GM)'Img);
TIO.Put_Line ("Number of elements in collection :" & SZ'Img);
for component in 1 .. SZ loop
declare
NGM : SD.Geometry := SD.retrieve_subcollection (GM, component);
SZC : Natural := SD.size_of_collection (NGM);
begin
TIO.Put_Line ("");
TIO.Put_Line ("Element" & component'Img & " type : " &
SD.collection_item_type (GM, component)'Img);
TIO.Put_Line ("Element" & component'Img & " size : " &
CT.int2str (SZC));
TIO.Put_Line ("Element" & component'Img & " wkt : " &
SD.Well_Known_Text (NGM));
end;
end loop;
end;
end;
CON.DR.disconnect;
end Spatial3;
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xca_notsx.log_9_1575.asm | ljhsiun2/medusa | 9 | 102052 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r13
push %r14
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x1d2d5, %rsi
lea addresses_WC_ht+0x194bd, %rdi
clflush (%rsi)
nop
nop
nop
nop
nop
cmp %r14, %r14
mov $25, %rcx
rep movsl
nop
nop
nop
and $24012, %rdx
lea addresses_UC_ht+0x18edd, %rsi
lea addresses_D_ht+0x1b95d, %rdi
nop
nop
nop
nop
xor $42732, %r12
mov $28, %rcx
rep movsl
nop
dec %rcx
lea addresses_WT_ht+0x4d5d, %r12
nop
nop
nop
inc %rdi
movw $0x6162, (%r12)
nop
nop
nop
nop
nop
xor %r12, %r12
lea addresses_normal_ht+0xf95d, %rsi
sub %r10, %r10
movb (%rsi), %dl
nop
nop
nop
nop
nop
dec %r14
lea addresses_WC_ht+0xc15d, %r12
nop
and %r14, %r14
movb $0x61, (%r12)
cmp %rdi, %rdi
lea addresses_D_ht+0xcfdd, %rsi
lea addresses_normal_ht+0x12fed, %rdi
nop
add %r13, %r13
mov $82, %rcx
rep movsb
nop
add %r10, %r10
lea addresses_UC_ht+0x1c1dd, %rsi
lea addresses_WC_ht+0x8585, %rdi
nop
nop
xor %r10, %r10
mov $77, %rcx
rep movsl
nop
nop
nop
nop
nop
cmp $27616, %rcx
lea addresses_WC_ht+0x1155d, %r12
nop
nop
sub %rdi, %rdi
mov $0x6162636465666768, %rdx
movq %rdx, %xmm5
vmovups %ymm5, (%r12)
nop
dec %r14
lea addresses_D_ht+0xb7bd, %rdi
nop
nop
nop
and $39503, %rcx
mov (%rdi), %r12
sub $3235, %rdi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %r14
pop %r13
pop %r12
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r13
push %r9
push %rax
push %rdi
push %rsi
// Store
lea addresses_A+0x1161d, %rdi
nop
nop
nop
nop
and %r9, %r9
mov $0x5152535455565758, %r13
movq %r13, %xmm6
vmovntdq %ymm6, (%rdi)
nop
nop
nop
nop
sub $8316, %rsi
// Store
lea addresses_WT+0x755d, %r13
nop
sub %rax, %rax
movl $0x51525354, (%r13)
nop
nop
nop
xor $52389, %r9
// Load
lea addresses_normal+0x9c95, %rsi
nop
nop
cmp %r12, %r12
mov (%rsi), %r13w
and %rax, %rax
// Faulty Load
lea addresses_PSE+0x415d, %r9
sub %rsi, %rsi
vmovups (%r9), %ymm5
vextracti128 $0, %ymm5, %xmm5
vpextrq $1, %xmm5, %r13
lea oracles, %r9
and $0xff, %r13
shlq $12, %r13
mov (%r9,%r13,1), %r13
pop %rsi
pop %rdi
pop %rax
pop %r9
pop %r13
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_PSE', 'NT': True, 'AVXalign': True, 'size': 8, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_A', 'NT': True, 'AVXalign': False, 'size': 32, 'congruent': 5}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_WT', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 9}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_normal', 'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 3}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'same': True, 'type': 'addresses_PSE', 'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'same': True, 'congruent': 3, 'type': 'addresses_WC_ht'}, 'dst': {'same': False, 'congruent': 2, 'type': 'addresses_WC_ht'}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 7, 'type': 'addresses_UC_ht'}, 'dst': {'same': False, 'congruent': 11, 'type': 'addresses_D_ht'}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_WT_ht', 'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 9}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_normal_ht', 'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 10}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_WC_ht', 'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 8}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 5, 'type': 'addresses_D_ht'}, 'dst': {'same': False, 'congruent': 4, 'type': 'addresses_normal_ht'}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 7, 'type': 'addresses_UC_ht'}, 'dst': {'same': False, 'congruent': 3, 'type': 'addresses_WC_ht'}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_WC_ht', 'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 9}}
{'OP': 'LOAD', 'src': {'same': True, 'type': 'addresses_D_ht', 'NT': False, 'AVXalign': False, 'size': 8, 'congruent': 5}}
{'33': 9}
33 33 33 33 33 33 33 33 33
*/
|
oeis/077/A077317.asm | neoneye/loda-programs | 11 | 179762 | ; A077317: a(n) is the n-th prime == 1 (mod n).
; Submitted by <NAME>
; 2,5,19,29,71,43,211,193,271,191,661,277,937,463,691,769,1531,613,2357,1021,1723,1409,3313,1609,3701,2029,3187,2437,6961,1741,7193,3617,4951,3877,7001,3169,10657,6271,7879,5521,13613,3823,15137,7349,9091,7499,18049,6529,18229,7151,13159,10141,26501,7669,19801,11593,18127,13109,32569,8221,34649,17981,21799,16001,28081,10429,39799,19381,29947,14771,47713,16417,51539,25013,29101,26449,50051,16927,54037,23761,41149,31489,68891,19237,51341,33713,45589,34057,84551,19531,64793,42689,54499,41737,76001
mov $2,$0
add $2,2
pow $2,2
mov $5,$0
mov $6,$0
sub $6,$0
lpb $2
add $6,$5
add $6,1
mov $3,$6
seq $3,10051 ; Characteristic function of primes: 1 if n is prime, else 0.
sub $0,$3
mov $4,$0
max $4,0
cmp $4,$0
mul $2,$4
sub $2,1
max $2,3
lpe
mov $0,$6
add $0,1
|
programs/oeis/047/A047838.asm | neoneye/loda | 22 | 102621 | <gh_stars>10-100
; A047838: a(n) = floor(n^2/2) - 1.
; 1,3,7,11,17,23,31,39,49,59,71,83,97,111,127,143,161,179,199,219,241,263,287,311,337,363,391,419,449,479,511,543,577,611,647,683,721,759,799,839,881,923,967,1011,1057,1103,1151,1199,1249,1299,1351,1403,1457,1511,1567,1623,1681,1739,1799,1859,1921,1983,2047,2111,2177,2243,2311,2379,2449,2519,2591,2663,2737,2811,2887,2963,3041,3119,3199,3279,3361,3443,3527,3611,3697,3783,3871,3959,4049,4139,4231,4323,4417,4511,4607,4703,4801,4899,4999,5099
add $0,2
pow $0,2
sub $0,2
div $0,2
|
Everything.agda | copumpkin/categories | 98 | 3677 | <gh_stars>10-100
module Everything where
-- Categories
import Categories.Category
-- 2-categories
-- XXX need to finish the last 3 laws
import Categories.2-Category
-- The strict 2-category of categories
-- XXX laws not proven yet
-- import Categories.2-Category.Categories
-- Adjunctions between functors
import Categories.Adjunction
-- The Agda Set category
import Categories.Agda
-- The fact that one version of it is cocomplete
import Categories.Agda.ISetoids.Cocomplete
-- The arrow category construction on any category
import Categories.Arrow
-- Bifunctors (functors from a product category)
import Categories.Bifunctor
-- Natural transformations between bifunctors
import Categories.Bifunctor.NaturalTransformation
-- The category of (small) categories
import Categories.Categories
-- Cat has products
import Categories.Categories.Products
-- Closed categories
import Categories.Closed
-- Cocones
import Categories.Cocone
-- The category of cocones under a diagram (functor)
import Categories.Cocones
-- Coends
import Categories.Coend
-- Coequalizers
import Categories.Coequalizer
-- Colimits
import Categories.Colimit
-- Comma categories
import Categories.Comma
-- Comonads, defined directly (not as monads on the opposite category)
import Categories.Comonad
-- The cofree construction that gives a comonad for any functor
import Categories.Comonad.Cofree
-- Cones
import Categories.Cone
-- The category of cones over a diagram (functor)
import Categories.Cones
-- A coherent equivalence relation over the objects of a category
import Categories.Congruence
-- Discrete categories (they only have objects and identity morphisms)
import Categories.Discrete
-- Ends
import Categories.End
-- Enriched categories
import Categories.Enriched
-- Equalizers
import Categories.Equalizer
-- Strong equivalence
import Categories.Equivalence.Strong
-- Fibrations
import Categories.Fibration
-- Free category on a graph
import Categories.Free
-- The free category construction is a functor from Gph to Cat
import Categories.Free.Functor
-- Functors
import Categories.Functor
-- F-algebra (TODO: maybe the module should be renamed)
import Categories.Functor.Algebra
-- The category of F-algebras of a functor
import Categories.Functor.Algebras
-- An F-coalgebra
import Categories.Functor.Coalgebra
-- Constant functor
import Categories.Functor.Constant
-- The category of F-coalgebras of a functor
import Categories.Functor.Coalgebras
-- The diagonal functor (C → C × C, or same thing with an arbitrary indexed product)
import Categories.Functor.Diagonal
-- Strong functor equivalence
-- XXX doesn't seem to work because of the double negative in Full?
-- import Categories.Functor.Equivalence.Strong
-- The hom functor, mapping pairs of objects to the morphisms between them
import Categories.Functor.Hom
-- Monoidal functors (similar to Haskell's Applicative class)
import Categories.Functor.Monoidal
-- Products as functors
import Categories.Functor.Product
-- Properties of general functors
import Categories.Functor.Properties
-- Representable functors
import Categories.Functor.Representable
-- Functor categories (of functors between two categories and natural transformations between them)
import Categories.FunctorCategory
-- The category of graphs and graph homomorphisms (Gph)
import Categories.Graphs
-- The underlying graph of a category (forgetful functor Cat ⇒ Gph)
import Categories.Graphs.Underlying
-- The Grothendieck construction on categories (taking a Sets-valued functor and building a category containing all values)
import Categories.Grothendieck
-- The globe category, used for defining globular sets (with a presheaf on it)
import Categories.Globe
-- Globular sets
import Categories.GlobularSet
-- Left Kan extensions
import Categories.Lan
-- Small categories exist as large categories too
import Categories.Lift
-- Limits
import Categories.Limit
-- Monads, defined as simple triples of a functor and two natural transformations
import Categories.Monad
-- A monad algebra
import Categories.Monad.Algebra
-- The category of all algebras of a monad
import Categories.Monad.Algebras
-- The Eilenberg-Moore category for any monad
import Categories.Monad.EilenbergMoore
-- The Kleisli category for any monad
import Categories.Monad.Kleisli
-- Strong monads
import Categories.Monad.Strong
-- Monoidal categories, with an associative bi(endo)functor and an identity object
import Categories.Monoidal
-- A braided monoidal category (one that gives you a swap operation, but isn't quite commutative)
import Categories.Monoidal.Braided
-- A cartesian monoidal category (monoidal category whose monoid is the product with a terminal object)
import Categories.Monoidal.Cartesian
-- Closed monoidal categories, which are simply monoidal categories that are
-- also closed, such that the laws "fit"
import Categories.Monoidal.Closed
-- Both of the above. Separated into its own module because we can do many
-- interesting things with them.
import Categories.Monoidal.CartesianClosed
-- Simple definitions about morphisms, such as mono, epi, and iso
import Categories.Morphisms
-- Cartesian morphisms (used mostly for fibrations)
import Categories.Morphism.Cartesian
-- Families of morphisms indexed by a set
import Categories.Morphism.Indexed
-- Natural isomorphisms, defined as an isomorphism of natural transformations
import Categories.NaturalIsomorphism
-- Natural transformations
import Categories.NaturalTransformation
import Categories.DinaturalTransformation
-- Properties of the opposite category
import Categories.Opposite
--------------------------------------------------------------------------------
-- Objects
--------------------------------------------------------------------------------
-- The coproduct of two objects
import Categories.Object.Coproduct
-- A category has all binary coproducts
import Categories.Object.BinaryCoproducts
-- A category has all finite coproducts
import Categories.Object.Coproducts
-- An exponential object
import Categories.Object.Exponential
-- A choice of B^A for a given B and any A
import Categories.Object.Exponentiating
-- B^— is adjoint to its opposite
import Categories.Object.Exponentiating.Adjunction
-- B^— as a functor
import Categories.Object.Exponentiating.Functor
-- A family of objects indexed by a set
import Categories.Object.Indexed
-- An initial object
import Categories.Object.Initial
-- The product of two objects
import Categories.Object.Product
-- The usual nice constructions on products, conditionalized on existence
import Categories.Object.Product.Morphisms
-- All binary products
import Categories.Object.BinaryProducts
-- Products of a nonempty list of objects and the ability to reassociate them massively
import Categories.Object.BinaryProducts.N-ary
-- All finite products
import Categories.Object.Products
import Categories.Object.Products.Properties
-- Products of a list of objects and the ability to reassociate them massively
import Categories.Object.Products.N-ary
-- The product of a family of objects
import Categories.Object.IndexedProduct
-- All products of indexed families
import Categories.Object.IndexedProducts
-- Subobject classifiers (for topoi)
import Categories.Object.SubobjectClassifier
-- Terminal object
import Categories.Object.Terminal
-- A^1 and 1^A always exist
import Categories.Object.Terminal.Exponentials
-- A chosen 1^A exists
import Categories.Object.Terminal.Exponentiating
-- A×1 always exists
import Categories.Object.Terminal.Products
-- Zero object (initial and terminal)
import Categories.Object.Zero
-- A category containing n copies of objects/morphisms/equalities of another category
import Categories.Power
-- Demonstrations that Power categories are the same as functors from discrete categories
import Categories.Power.Functorial
-- Natural transformations for functors to/from power categories
import Categories.Power.NaturalTransformation
-- A preorder gives rise to a category
import Categories.Preorder
-- A presheaf (functor from C^op to V)
import Categories.Presheaf
-- The category of presheaves (a specific functor category)
import Categories.Presheaves
-- The product of two categories
import Categories.Product
import Categories.Product.Properties
-- Projection functors from a product category to its factors
import Categories.Product.Projections
-- Profunctors
import Categories.Profunctor
-- Pullbacks in a category
import Categories.Pullback
-- Pushouts in a category
import Categories.Pushout
-- All categories can have a slice category defined on them
import Categories.Slice
-- Utilities for gluing together commutative squares (and triangles)
-- (and other common patterns of equational reasoning)
import Categories.Square
-- The terminal category (a terminal object in the category of small categories)
import Categories.Terminal
-- A topos
import Categories.Topos
-- The Yoneda lemma
import Categories.Yoneda
|
base/mvdm/dos/v86/cmd/command/comequ.asm | npocmaka/Windows-Server-2003 | 17 | 240667 | <reponame>npocmaka/Windows-Server-2003
;/*
; * Microsoft Confidential
; * Copyright (C) Microsoft Corporation 1991
; * All Rights Reserved.
; */
; SCCSID = @(#)comequ.asm 1.1 85/05/14
; SCCSID = @(#)comequ.asm 1.1 85/05/14
;*************************************
; COMMAND EQUs which are not switch dependant
include curdir.inc ; to get DIRSTRLEN
; Note dossym.inc must already have been included!
EMGDEBUG = FALSE
SYM EQU ">"
ifdef JAPAN
LINESPERPAGE EQU 24
else ; if Not JAPAN
LINESPERPAGE EQU 25 ;AC000; default lines per page
endif
NORMPERLIN EQU 1
WIDEPERLIN EQU 5
COMBUFLEN EQU 128 ; Length of commmand buffer
EXECPATHLEN EQU 273 ; MAX_PATH+13 (expanded for ntvdm)
BatLen EQU 32 ; buffer for batch files
YES_ECHO EQU 1 ; echo line
NO_ECHO EQU 0 ; don't echo line
No_Echo_Char EQU "@" ; don't echo line if this is first char
call_in_progress EQU 1 ; indicate we're in the CALL command
length_call EQU 4 ; length of CALL
max_nest EQU 10 ; max # levels of batch nesting allowed
fail_allowed EQU 00001000b ; critical error
retry_allowed EQU 00010000b ; critical error
Ignore_allowed EQU 00100000b ; critical error
nullcommand EQU 1 ; no command on command line
end_of_line EQU -1 ;AN000; end of line return from parser
end_of_line_out EQU 0 ;AN000; end of line for output
end_of_line_in EQU 0dh ;AN000; end of line for input
result_number EQU 1 ;AN000; number returned from parser
result_string EQU 3 ;AN000; string returned from parser
result_filespec EQU 5 ;AN000; filespec returned from parser
result_drive EQU 6 ;AN000; drive returned from parser
result_date EQU 7 ;AN000; date returned from parser
result_time EQU 8 ;AN000; time returned from parser
result_no_error EQU 0 ;AN000; no error returned from parser
no_cont_flag EQU 0 ;AN000; no control flags for message
util_msg_class EQU -1 ;AN000; message class for utility
ext_msg_class EQU 1 ;AN000; message class for extended error
parse_msg_class EQU 2 ;AN000; message class for parse error
crit_msg_class EQU 3 ;AN000; message class for critical error
ext_crlf_class EQU 081h ;AN054; message class for extended error with no CRLF
colon_char EQU ":" ;AN000; colon character
crt_ioctl_ln EQU 14 ;AN000; default length of data for display ioctl
text_mode EQU 1 ;AN000; text mode return from ioctl
get_generic EQU 07Fh ;AN000; generic ioctl - get device info
set_crit_dev EQU 0100H ;AN000; device attribute for critical error on I/0
mult_ansi EQU 01Ah ;AC064; multiplex for ansi.sys
mult_shell_get EQU 01902h ;AC065; multiplex for Shell - get next command
mult_shell_brk EQU 01903h ;AN000; multiplex for Shell - ^C batch check
shell_action equ 0ffh ;AN000; SHELL - return for taking SHELL specific action
bat_not_open EQU -1 ;AN000; batch handle will be set to this if not open
bat_open_handle EQU 19 ;AN000; handle will be in this position in JFN table
Ptr_seg_pos equ 7 ;AN000; Offset from start of message block for subst segment
Ptr_off_pos equ 5 ;AN000; Offset from start of message block for subst offset
Parm_off_pos equ word ptr 2 ;AN000; Offset from start of subst list for subst offset
parm_block_size equ 11 ;AN000; size of message subst block
blank equ " " ;AN000; blank character
no_subst equ 0 ;AN000; no substitutions for messages
one_subst equ 1 ;AN000; one substitution for messages
no_handle_out equ -1 ;AN000; use function 1 thru 12 for message retriever
res_subst equ 2 ;AN000; offset from start of message definition to number of subst
read_open_mode equ 0000000000000000b ;AN024; extended open mode for read
deny_write equ 0000000000100000b ; deny write sharing mode ;M031
deny_none equ 0000000001000000b ; deny none sharing mode ;Myyy
read_open_flag equ 0000000100000001b ;AN000; extended open flags for read
write_open_mode equ 0000000000000001b ;AN024; extended open mode for read
write_open_flag equ 0000000100000001b ;AN000; extended open flags for read
creat_open_flag equ 0000000100010010b ;AN000; extended open flags for read
capital_A equ 'A' ;AC000;
vbar equ '|' ;AC000;
labracket equ '<' ;AC000;
rabracket equ '>' ;AC000;
dollar equ '$' ;AC000;
lparen equ '(' ;AC000;
rparen equ ')' ;AC000;
nullrparen equ 29h ;AC000;
in_word equ 4e49h ;AC000; 'NI' ('IN' backwards)
do_word equ 4f44h ;AC000; 'OD' ('DO' backwards)
star equ '*' ;AC000;
plus_chr equ '+' ;AC000;
small_a equ 'a' ;AC000;
small_z equ 'z' ;AC000;
dot_chr equ '.' ;AC000;
tab_chr equ 9 ;AN032;
equal_chr equ '=' ;AN032;
semicolon equ ';' ;AN049;
dot_qmark equ 2e3fh ;AC000; '.?'
dot_colon equ 2e3ah ;AC000; '.:'
capital_n equ 0 ;AC000; result from Y/N call if N entered
capital_y equ 1 ;AC000; result from Y/N call if Y entered
AppendInstall equ 0B700H ;AN020; append install check
AppendDOS equ 0B702H ;AN020; append DOS version check
AppendGetState equ 0B706H ;AN020; append get current state
AppendSetState equ 0B707H ;AN020; append set current state
AppendTruename equ 0B711H ;AN042; Get file's real location for Batch
search_attr equ attr_read_only+attr_hidden+attr_directory ;AC042;
;*************************************
;* PARSE ERROR MESSAGES
;*************************************
MoreArgs_Ptr equ 1 ;AN000;"Too many parameters" message number
LessArgs_Ptr equ 2 ;AN000;"Required parameter missing" message number
BadSwt_Ptr equ 3 ;AN000;"Invalid switch" message number
BadParm_Ptr equ 10 ;AN000;"Invalid parameter" message number
;*************************************
;* EQUATES FOR MESSAGE RETRIEVER
;*************************************
GET_EXTENDED_MSG EQU 0 ;AN000; get extended message address
SET_EXTENDED_MSG EQU 1 ;AN000; set extended message address
GET_PARSE_MSG EQU 2 ;AN000; get parse message address
SET_PARSE_MSG EQU 3 ;AN000; set parse message address
GET_CRITICAL_MSG EQU 4 ;AN000; get critical message address
SET_CRITICAL_MSG EQU 5 ;AN000; set critical message address
MESSAGE_2F EQU 46 ;AN000; minor code for message retriever
;*********************************
;* EQUATES FOR INT 10H
;*********************************
VIDEO_IO_INT EQU 10H ;AN000; equate for int 10h
SET_VIDEO_MODE EQU 0 ;AN000; set video mode
SET_CURSOR_POSITION EQU 2 ;AN000; set new cursor position
SCROLL_VIDEO_PAGE EQU 6 ;AN000; scroll active page up
VIDEO_ATTRIBUTE EQU 7 ;AN000; attribute to be used on blank line
SET_COLOR_PALETTE EQU 11 ;AN000; set color for video
GET_VIDEO_STATE EQU 15 ;AN000; get current video state
VIDEO_ALPHA EQU 3 ;AN000; alpha video is 3 or below
VIDEO_BW EQU 7 ;AN000; mode for 80X25 black & white
AltPipeChr equ "|" ; alternate pipe character
FCB EQU 5CH
VARSTRUC STRUC
ISDIR DB ?
SIZ DB ?
TTAIL DW ?
INFO DB ?
BUF DB DIRSTRLEN + 20 DUP (?)
VARSTRUC ENDS
;
; Flags for internal command parsing
;
fCheckDrive equ 00000001b ; validate drive letter
fSwitchAllowed equ 00000010b ; switches allowed
fLimitHelp equ 00000100b ; /? must appear alone
;
; Test switches
;
fParse EQU 0001h ; display results of parseline
;
; Batch segment structure
;
; BYTE type of segment
; BYTE echo state of parent on entry to batch file
; WORD segment of last batch file
; WORD segment for FOR command
; BYTE FOR flag state on entry to batch file
; DWORD offset for next line
; 10 WORD pointers to parameters. -1 is empty parameter
; ASCIZ file name (with . and ..)
; BYTES CR-terminated parameters
; BYTE 0 flag to indicate end of parameters
;
BatchType equ 0
BatchSegment struc
BatType DB BatchType ; signature
Batechoflag DB 0 ; G state of echo
BatchEOF DB 0 ;records if EOF reached on file
Batlast DW 0 ; G segment of last batch file
Batforptr DW 0 ; G segment for FOR command
Batforflag DB 0 ; G state of FOR
BatSeek DD ? ; lseek position of next char
BatParm DW 10 dup (?) ; pointers to parameters
BatFile DB ? ; beginning of batch file name
BatchSegment ends
ANULL equ 0 ; terminates an argv string
ARGMAX equ 64 ; max args on a command line
ARGBLEN equ 2*128 ; 1char each plus term NUL
tplen equ 64 ; max size of one argument
arg_cnt_error equ 1 ; number of args > MAXARG
arg_buf_ovflow equ 2 ; overflowed argbuffer
argv_ele STRUC ; elements in the argv array
argpointer DW (?) ; pointer to the argstring
argflags DB (?) ; cparse flags for this argstring
argstartel DW (?) ; the result of cparse's [STARTEL]
arglen DW (?) ; cparse's char count + one (for null)
argsw_word DW (?) ; any switches after this? what kinds?
arg_ocomptr DW (?) ; pointer into original command string
argv_ele ENDS
arg_unit STRUC
argv DB (ARGMAX * SIZE argv_ele) DUP (?)
argvcnt DW (?) ; number of arguments
argswinfo DW (?) ; Switch information for entire line
argbuf DW ARGBLEN DUP (?) ; storage for argv strings
argforcombuf db COMBUFLEN DUP (?) ; Original for loop command string
arg_unit ENDS
parseflags RECORD special_delim:1, unused:4, path_sep:1, wildcard:1, sw_flag:1
SwitchQues EQU 20h
SwitchV EQU 10h
SwitchB EQU 08h
SwitchA EQU 04h
SwitchP EQU 02h
SwitchW EQU 01h
fSwitch EQU 8000h
fBadSwitch EQU 4000h
SwitchDir EQU SwitchP + SwitchW + fSwitch
SwitchCopy EQU SwitchV + SwitchA + SwitchB + fSwitch
break <Trap: Get the attention of MSDOS>
; TRAP snares the operating system for a service call
; AX, as well as any other registers MS-DOS takes a fancy to, will be crunched.
trap MACRO dos_function,dos_info
ifnb <dos_info>
mov AX, (dos_function SHL 8) + dos_info
else
mov AX, (dos_function SHL 8)
endif
int 21h
ENDM
;
; Equates for initialization
;
initInit equ 01h ; initialization in progress
initSpecial equ 02h ; in initialization time/date routine
initCtrlC equ 04h ; already in ^C handler
;M052 BETA3WARN equ 1 ; Yank anything related to this EQU
; out before we ship
|
src/applescript/media/play media.applescript | dnnsmnstrr/HydroTouch | 3 | 1323 | <reponame>dnnsmnstrr/HydroTouch
---
-- This script is made to be run within BetterTouchTool
-- It detects which players are currently active and attempts to intelligently
-- playpause the appropriate one
---
--- store useful states ---
set activeAppName to my getActiveApp()
set currentlyPlaying to my getCurrentlyPlaying()
set spotifyState to my getSpotifyState()
--- debugging stuff ---
--uncomment this to get the bundle identifier of the currently playing app
--return currentlyPlaying
--return spotifyState
--my playpause()
--return
--- quickly pause spotify if it is playing ---
if spotifyState = "playing" then
tell application "Spotify" to playpause
return "Spotify paused"
end if
--- handle foreground app ---
if activeAppName = "Spotify" then
tell application "Spotify"
playpause
return "Spotify in foreground"
end tell
else if activeAppName = "iTunes" then
tell application "iTunes"
playpause
return "iTunes in foreground"
end tell
else if activeAppName = "IINA" then
tell application "System Events"
key code 49 -- space bar
return "IINA in foreground"
end tell
else if activeAppName = "Kodi" then
tell application "System Events"
key code 49 -- space bar
return "Kodi in foreground"
end tell
else if activeAppName = "Amazon Music" then
tell application "System Events"
key code 49 -- space bar
return "Amazon Music in foreground"
end tell
--my playpause
--return "Amazon Music in foreground"
else if application "Safari" is running then
tell application "Safari"
set activeTab to my getActiveSafariTab()
if activeTab is not equal to "error" then
repeat with w in windows
repeat with t in tabs of w
tell t
--Netflix
if URL starts with "https://www.netflix.com/watch" then
do JavaScript "var v = document.querySelector('video');
if (v.paused) {
v.play();
}
else {
v.pause();
}"
--Alternative:
--do JavaScript " document.getElementsByClassName('PlayerControlsNeo__button-control-row')[0].getElementsByTagName('button')[0].click()"
return "Netflix"
--YouTube
else if URL starts with "http://www.youtube.com/watch" or URL starts with "https://www.youtube.com/watch" then
if activeTab = index of t then --YouTube Player is open
if activeAppName = "Safari" then
do JavaScript "document.getElementsByClassName('ytp-play-button ytp-button')[0].click();"
--tell application "System Events"
--key code 49 -- space bar
--end tell
return "YouTube in foreground"
else
do JavaScript "document.getElementsByClassName('ytp-play-button ytp-button')[0].click();"
return "YouTube in background"
end if
end if
end if
end tell
end repeat
end repeat
end if
end tell
end if
--- handle background playing using btt's player status ---
if currentlyPlaying = "com.spotify.client" then
if application "Spotify" is running then
if spotifyState = "stopped" then
my startPlaylist()
else
tell application "Spotify" to playpause
return "Spotify in background"
end if
else
return "Spotify not running"
end if
else if currentlyPlaying = "com.apple.Safari" then
my playpause()
return "Safari in background"
else if currentlyPlaying = "com.colliderli.iina" then
tell application "BetterTouchTool"
trigger_named "pause"
end tell
return "IINA in background"
--add your own media app by replacing bundle.identifier
else if currentlyPlaying = "bundle.identifier" then
--if your app exposes applescript funtions, you can target it directly
my playpause()
return "YourApp in background"
end if
--- apps that don't get recognized by btt ---
if application "Amazon Music" is running then
my playpause()
return "Amazon Music in background"
end if
--- if nothing else got triggered, resume spotify ---
if spotifyState = "paused" then
tell application "Spotify" to playpause
return "playing Spotify in background"
else if spotifyState = "stopped" then
my startPlaylist()
end if
---------------------
return "reached end"
---------------------
---- Functions ----
-- Return the active app as a String
on getActiveApp()
tell application "System Events" to set activeApp to first process where it is frontmost
return name of activeApp
end getActiveApp
-- Return the index of the current tab in Safari's frontmost window
on getActiveSafariTab()
tell application "System Events"
try
tell application "Safari" to return index of current tab of front window
on error
return "Could not get current safari tab"
end try
end tell
end getActiveSafariTab
-- Return the the bundle identifier of the currently playing app, as determined by BTT
on getCurrentlyPlaying()
try
tell application "BetterTouchTool" to return get_string_variable "BTTCurrentlyPlayingApp"
on error
return "Could not get currently playing app"
end try
end getCurrentlyPlaying
-- Return the player state of spotify (playing or paused)
on getSpotifyState()
if application "Spotify" is running then
tell application "Spotify" to return player state as text
end if
return "not running"
end getSpotifyState
on playpause()
try
tell application "BetterTouchTool"
--trigger_action "{\"BTTPredefinedActionType\":23}"
trigger_named "playpause" -- this requires a named trigger with the play/pause action assigned
end tell
return "System playpause"
on error
return "Error on BTT playpause"
end try
end playpause
on startPlaylist()
try
tell application "BetterTouchTool"
trigger_named "play current playlist" -- this requires corresponding named trigger
end tell
return "playing current Spotify playlist"
on error
return "Error starting playlist"
end try
end startPlaylist
on isOtherPlayerRunning()
set currentPlayer to my getCurrentlyPlaying()
end isOtherPlayerRunning
|
programs/oeis/269/A269249.asm | neoneye/loda | 22 | 89444 | <filename>programs/oeis/269/A269249.asm<gh_stars>10-100
; A269249: Number of times the digit 9 appears in the decimal expansion of n^3.
; 0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,1,1,0,1,0,1,0,0,0,0,0,1,1,1,0,2,0,1,1,0,0,0,0,2,0,1,0,1,0,1,1,0,1,1,0,0,0,0,0,0,0,1,1,1,0,1,0,0,0,0,1,0,0,1,0,1,0,1,0,0,1,0,0,2,0,0,0,0,1,0,0,0,0,2,1,0,0,0,0,0,0,1,2,3
pow $0,3
lpb $0
mov $2,$0
div $0,10
mod $2,10
cmp $2,9
add $1,$2
lpe
mov $0,$1
|
programs/oeis/327/A327705.asm | karttu/loda | 0 | 27467 | <filename>programs/oeis/327/A327705.asm
; A327705: The minimal size of a partition lambda of n such that every partition of n with at most 5 parts can be obtained by coalescing the parts of lambda.
; 1,2,3,4,5,5,6,6,7,7,7,8,8,8,9,9,9,9,10,10,10,10,10,11,11,11,11,11,11,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,17,17,17,17,17,17,17
lpb $0,1
mul $0,4
sub $0,1
div $0,5
add $1,1
lpe
add $1,1
|
applescript/right.applescript | jeremy5189/Sensortag-OSX-Remote | 1 | 369 | tell application "System Events"
key code 124
end tell |
programs/oeis/032/A032096.asm | karttu/loda | 0 | 101517 | <filename>programs/oeis/032/A032096.asm
; A032096: "BHK" (reversible, identity, unlabeled) transform of 2,2,2,2,...
; 2,3,8,23,74,227,704,2135,6482,19523,58808,176663,530714,1592867,4780784,14344535,43040162,129127043,387400808,1162222103,3486725354,10460235107,31380882464,94142824535,282429005042,847287546563,2541864234008,7625594296343,22876787671994,68630367798947,205891117745744,617673367586135,1853020145805122,5559060480462083
mov $2,$0
lpb $2,1
mov $3,$1
mul $1,2
add $3,$0
trn $0,2
add $1,$3
sub $1,$0
sub $2,1
lpe
add $1,2
|
3rdparty/detours/samples/disas/arm.asm | wohaaitinciu/zpublic | 50 | 89280 | <filename>3rdparty/detours/samples/disas/arm.asm
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; Detours Test Program (rlo.asm/disas.exe)
;;
;; Microsoft Research Detours Package, Version 3.0.
;;
;; Copyright (c) Microsoft Corporation. All rights reserved.
;;
MACRO
BREAK
DCW 0xdefe
MEND
AREA |.text|,ALIGN=2,CODE,READONLY
AREA |.text|,CODE,READONLY
ALIGN 0x1000
EXPORT |TestCodes|
|TestCodes|
; dcw 0xf8df,0xe00e ; 94 = -16 = -12 ; 94 ; 98 + e = a6
; BREAK ; 98 = -14 = -10 ; 98 ; 9c
; dcw 0xf8df,0xe00a ; 9a = -12 = -8 ; 98 ; 9c + a = a6
; BREAK ; 9e = -8 = -4 ; 9c ; a0
; dcw 0xf8df,0xe002 ; a0 = -6 = -2 ; a0 ; a4 + 2 = a6
; BREAK ; a4 = -2 ; a4 ; a8
; movs r2, r0 ; a6 <===
; movs r3, r0 ;
; BREAK
; BREAK
;
; ldr lr,=0xa98765
; ldr pc,=0xa98765
; ldr pc,=0xa98765
; ldr pc,=0xa98765
; BREAK
; BREAK
BREAK
ldr lr, =0xa98765
BREAK
blx lr
BREAK
pop pc
BREAK
pop {r11,pc}
BREAK
pop {r10,r11,pc}
BREAK
pop {r9,r10,r11,pc}
BREAK
pop {r1,r2,r3,r4,r5,r6,r7,r8,r9,r10,r11,pc}
BREAK
ldr.w r0,=0xa98765
BREAK
nop
ldr.w r0,=0xa98765
BREAK
nop
nop
ldr.w r0,=0xa98765
BREAK
ldr r0,=0xa98765
BREAK
ldr.w r0,=0xa98765
BREAK
ldr.w r0,=0xa98765
BREAK
ldr r0,=0xa98765
BREAK
ldr.w r0,=0xa98765
BREAK
ldr.w r0,=0xa98765
BREAK
ldr r0,=0xa98765
BREAK
ldr.w r0,=0xa98765
BREAK
ldr.w r0,=0xa98765
BREAK
ldr r0,=0xa98765
BREAK
nop
ldr r0,=0xa98765
BREAK
nop
nop
ldr r0,=0xa98765
BREAK
nop
ldr r0,=0xa
BREAK
ldr r0,=0xa9
BREAK
ldr r0,=0xa98
BREAK
ldr r0,=0xa987
BREAK
ldr r0,=0xa9876
BREAK
ldr r0,=0xa98765
BREAK
ldr r0,=0xa987654
BREAK
ldr r0,=0xa9876543
;; Simple instructions.
BREAK
adds r0,r0, #5 ; 1d40
BREAK
movs r2, #0 ; 2200
BREAK
movs r3, #0 ; 2300
BREAK
bx lr ; 4770 [FFFFFFFF]
;; Known 16-bit instructions
BREAK
mov r11, sp ; 46eb
BREAK
movs r2, r0 ; 0002
BREAK
push r0, r1 ; b403
BREAK
str r3,[r7,#0x28] ; 62bb
BREAK
bx r5 ; 4728 [FFFFFFFF]
BREAK
blx r5 ; 47a8
BREAK
DCW 0x4878 ; ldr r0, [PC + 0x1E0] ; 4878
BREAK
str r3,[r7,#0x1C] ; 61fb
BREAK
ldr r3,[r7,#0x38] ; 6bbb
BREAK
add r3,sp,#0xCC ; ab33
BREAK
cbz r2,+0x56 ; b34a [00xx1510]
BREAK
cbnz r2,+0x56 ; bb4a [00xx1514]
BREAK
push {r0,r2,r4,r6,lr} ; b555
BREAK
nop ; bf00
;; Placeholder for IT instruction
BREAK
bne +0x6E ; d135 [00xx1538] -??? d137
BREAK
svc #0x24 ; df24
BREAK
b +0x7FE ; e3fd [00xx1cd0] -??? e3ff
;; 32 bit test codes
BREAK
adds r0,r7,#8 ; f1170008
BREAK
str r3,[r5,#0x677] ; f8c53677
BREAK
ldrsh r10,[r5,#0x5A5] ; f9b5a5a5
BREAK
DCW 0xf89f,0x55a5 ;ldrb r5, [+0x5A5] ; f89f55a5
BREAK
bls.w +0x86; 0xf240; 0x8043; // ; f2408041 [00xx157A]
BREAK
bl +0xFE; 0xf7ff; 0xff80; //
BREAK
bl +0xFFE; 0xf7ff; 0xff80; //
BREAK
bl +0xFFFE; 0xf7ff; 0xff80; //
BREAK
bl +0xFFFFE; 0xf7ff; 0xff80; //
BREAK
bl +0xFFFFFE; 0xf7ff; 0xff80; //
BREAK
bl +0xF0; 0xf7ff; 0xff80; //
BREAK
bl +0xFF0; 0xf7ff; 0xff80; //
BREAK
bl +0xFFF0; 0xf7ff; 0xff80; //
BREAK
bl +0xFFFF0; 0xf7ff; 0xff80; //
BREAK
bl +0xFFFFF0; 0xf7ff; 0xff80; //
BREAK
bl +0xF00; 0xf7ff; 0xff80; //
BREAK
bl +0xFF00; 0xf7ff; 0xff80; //
BREAK
bl +0xFFF00; 0xf7ff; 0xff80; //
BREAK
bl +0xFFFF00; 0xf7ff; 0xff80; //
BREAK
DCW 0xf7ff,0xff80
;bl +0xFFFFFF00; 0xf7ff; 0xff80; //
BREAK
DCW 0xf7ff,0xbe02
; b.w ; 0xf7ff; 0xbe02; // (10053528)
BREAK
push {r7,r11,lr}; 0xe92d; 0x4880; //
;; 32 bit expected results
BREAK
adds r0,r7,#8 ; 0xf1170008
BREAK
str r3,[r5,#0x677] ; 0xf8c53677
BREAK
ldrsh r10,[r5,#0x5A5] ; 0xf9b5a5a5
BREAK
DCW 0xf6af,0xfbd2
; bl (0008ef3c); ResultCode(4, 0xf6af, 0xfbd2, Target(ADDRESS(&g_pTestCodes32[i*2], 0xFFFFFF00))); // 0xf7ff, 0xff80: -> 0xf6affbd2
BREAK
bl (00090300); ResultCode(4, 0xf6af, 0xba54, Target(ADDRESS(&g_pTestCodes32[i*2], 0xFFFFFC04))); // 0xf7ff, 0xff80: -> f6afba54 bl (00090300)
BREAK
push {r7,r11,lr}; ResultCode(4, 0xe92d, 0x4880); // 0xe92d, 0x4880: //
BREAK
BREAK
|TestCodes_end|
END
|
programs/oeis/049/A049766.asm | neoneye/loda | 22 | 4120 | ; A049766: a(n) = Sum_{k=1..n} T(n,k), array T as in A049765.
; 0,1,4,7,14,18,29,36,48,58,77,83,106,122,141,156,187,200,235,251,280,308,351,361,403,437,476,502,557,573,632,663,712,758,813,828,899,951,1010,1038,1117,1145,1228,1274,1329,1393,1484,1502,1590,1645,1724,1780,1883,1923,2014,2060,2149,2231,2346,2356,2475,2563,2646,2709,2818,2870,3001,3077,3186,3250,3389,3408,3551,3657,3756,3842,3975,4039,4194,4246,4366,4484,4647,4673,4818,4942,5081,5163,5338,5372,5531,5637,5786,5922,6085,6119,6310,6431,6570,6651
mov $1,$0
pow $0,2
seq $1,244049 ; Sum of all proper divisors of all positive integers <= n.
sub $0,$1
|
adm/code/src/admbase-evolve.adb | leo-brewin/adm-bssn-numerical | 1 | 4595 | <filename>adm/code/src/admbase-evolve.adb
with Support; use Support;
with Support.Clock; use Support.Clock;
with Support.CmdLine; use Support.CmdLine;
with Support.Strings; use Support.Strings;
with ADMBase.Data_IO; use ADMBase.Data_IO;
with ADMBase.Text_IO; use ADMBase.Text_IO;
with ADMBase.Runge; use ADMBase.Runge;
with ADMBase.Time_Derivs; use ADMBase.Time_Derivs;
with Ada.Exceptions;
with System.Multiprocessors;
package body ADMBase.Evolve is
procedure evolve_data is
looping : Boolean;
task type SlaveTask is
entry resume;
entry pause;
entry release;
entry set_params (slave_params : SlaveParams);
end SlaveTask;
task body SlaveTask is
params : SlaveParams;
begin
-- collect parameters for this task ------------------------
accept set_params (slave_params : SlaveParams) do
params := slave_params;
end;
loop
select
-- start the runge kutta --------------------------------
accept resume; beg_runge_kutta (params); accept pause;
-- 1st step of runge-kutta ------------------------------
accept resume; set_time_derivatives_intr (params); accept pause;
accept resume; set_time_derivatives_bndry_fb (params); accept pause;
accept resume; set_time_derivatives_bndry_ew (params); accept pause;
accept resume; set_time_derivatives_bndry_ns (params); accept pause;
accept resume; rk_step (1.0 / 2.0, 1.0 / 6.0, params); accept pause;
-- 2nd step of runge-kutta ------------------------------
accept resume; set_time_derivatives_intr (params); accept pause;
accept resume; set_time_derivatives_bndry_fb (params); accept pause;
accept resume; set_time_derivatives_bndry_ew (params); accept pause;
accept resume; set_time_derivatives_bndry_ns (params); accept pause;
accept resume; rk_step (1.0 / 2.0, 1.0 / 3.0, params); accept pause;
-- 3rd step of runge-kutta ------------------------------
accept resume; set_time_derivatives_intr (params); accept pause;
accept resume; set_time_derivatives_bndry_fb (params); accept pause;
accept resume; set_time_derivatives_bndry_ew (params); accept pause;
accept resume; set_time_derivatives_bndry_ns (params); accept pause;
accept resume; rk_step (1.0, 1.0 / 3.0, params); accept pause;
-- 4th step of runge-kutta ------------------------------
accept resume; set_time_derivatives_intr (params); accept pause;
accept resume; set_time_derivatives_bndry_fb (params); accept pause;
accept resume; set_time_derivatives_bndry_ew (params); accept pause;
accept resume; set_time_derivatives_bndry_ns (params); accept pause;
accept resume; rk_step (0.0, 1.0 / 6.0, params); accept pause;
-- finish the runge kutta -------------------------------
accept resume; end_runge_kutta (params); accept pause;
or
-- time to release the tasks? ---------------------------
accept release;
exit;
or
terminate; -- a safeguard, just to ensure tasks don't hang
end select;
end loop;
exception
when whoops : others =>
Put_Line ("> Exception raised in task body");
Put_Line (Ada.Exceptions.Exception_Information (whoops));
report_elapsed_cpu (grid_point_num, num_loop);
halt (1);
end SlaveTask;
num_cpus : Integer := Integer (System.Multiprocessors.Number_Of_CPUs);
num_slaves : Integer := read_command_arg ('N',num_cpus);
slave_tasks : array (1..num_slaves) of SlaveTask;
slave_params : array (1..num_slaves) of SlaveParams;
procedure prepare_slaves is
n_point : constant Integer := grid_point_num;
n_intr : constant Integer := interior_num;
n_bndry : constant Integer := boundary_num;
n_north : constant Integer := north_bndry_num;
n_south : constant Integer := south_bndry_num;
n_east : constant Integer := east_bndry_num;
n_west : constant Integer := west_bndry_num;
n_front : constant Integer := front_bndry_num;
n_back : constant Integer := back_bndry_num;
begin
case num_slaves is
when 1 | 2 | 4 | 8 | 16 => null;
when others => Put_Line ("> Error: range error in num_slaves, should be 1,2,4,8 or 16");
Put_Line ("> num_slaves = " & str(num_slaves,0));
halt (1);
end case;
-- here we sub-divide the list of cells across the tasks.
-- it is *essential* that the every cell appears in *exactly* one sub-list.
-- if a cell appears in more than one sub-list then it will be processed by more
-- than one task. doing so wastes time, but far more worrying is that such multiple
-- processing may cause data to be overwritten!
for i in slave_params'range loop
slave_params (i)(1) := i;
end loop;
slave_params (1)( 2) := 1;
slave_params (1)( 4) := 1;
slave_params (1)( 6) := 1;
slave_params (1)( 8) := 1;
slave_params (1)(10) := 1;
slave_params (1)(12) := 1;
slave_params (1)(14) := 1;
slave_params (1)(16) := 1;
slave_params (1)(18) := 1;
for i in 2 .. num_slaves loop
slave_params (i-1)( 3) := (i-1)*n_point/num_slaves;
slave_params (i)(2) := 1 + slave_params (i-1)(3);
slave_params (i-1)( 5) := (i-1)*n_intr/num_slaves;
slave_params (i)(4) := 1 + slave_params (i-1)(5);
slave_params (i-1)( 7) := (i-1)*n_bndry/num_slaves;
slave_params (i)(6) := 1 + slave_params (i-1)(7);
slave_params (i-1)( 9) := (i-1)*n_north/num_slaves;
slave_params (i)(8) := 1 + slave_params (i-1)(9);
slave_params (i-1)(11) := (i-1)*n_south/num_slaves;
slave_params (i)(10) := 1 + slave_params (i-1)(11);
slave_params (i-1)(13) := (i-1)*n_east/num_slaves;
slave_params (i)(12) := 1 + slave_params (i-1)(13);
slave_params (i-1)(15) := (i-1)*n_west/num_slaves;
slave_params (i)(14) := 1 + slave_params (i-1)(15);
slave_params (i-1)(17) := (i-1)*n_front/num_slaves;
slave_params (i)(16) := 1 + slave_params (i-1)(17);
slave_params (i-1)(19) := (i-1)*n_back/num_slaves;
slave_params (i)(18) := 1 + slave_params (i-1)(19);
end loop;
slave_params (num_slaves)( 3) := n_point;
slave_params (num_slaves)( 5) := n_intr;
slave_params (num_slaves)( 7) := n_bndry;
slave_params (num_slaves)( 9) := n_north;
slave_params (num_slaves)(11) := n_south;
slave_params (num_slaves)(13) := n_east;
slave_params (num_slaves)(15) := n_west;
slave_params (num_slaves)(17) := n_front;
slave_params (num_slaves)(19) := n_back;
for i in 1..num_slaves loop
slave_tasks(i).set_params (slave_params(i));
end loop;
-- use this to verify the slave params are set correctly
-- for i in slave_params'Range loop
-- put ("Slave "&str(i,2)&" params: ");
-- for j in slave_params(i)'Range loop
-- put (str(slave_params(i)(j),7)&' ');
-- end loop;
-- new_line;
-- end loop;
-- halt;
end prepare_slaves;
procedure release_slaves is
begin
for i in slave_tasks'Range loop
slave_tasks(i).release;
end loop;
end release_slaves;
procedure advance_slaves is
begin
for i in slave_tasks'Range loop
slave_tasks(i).resume;
end loop;
for i in slave_tasks'Range loop
slave_tasks(i).pause;
end loop;
end advance_slaves;
procedure runge_kutta_step is
begin
advance_slaves; -- set interior time derivatives
advance_slaves; -- set boundary time derivatives on front & back faces
advance_slaves; -- set boundary time derivatives on east & west faces
advance_slaves; -- set boundary time derivatives on north & south faces
-- use this to show that all d/dt are correct
-- for the Kasner initial data, all d/dt should be equal across all grid points
-- note the changes that arise if the order in which the boundaries are set is changed
-- note: use this test on a small grid, e.g., 5x5x5
-- declare
-- i,j,k : Integer;
-- begin
-- for a in 1..grid_point_num loop
-- i := grid_point_list (a).i;
-- j := grid_point_list (a).j;
-- k := grid_point_list (a).k;
-- put_line (str(i)&' '&str(j)&' '&str(k)&' '&
-- str(ADMBase.dot_gab(i,j,k)(1))&' '&
-- str(ADMBase.dot_gab(i,j,k)(4))&' '&
-- str(ADMBase.dot_gab(i,j,k)(6)));
-- end loop;
-- halt;
-- end;
advance_slaves; -- Runge-Kutta step
end runge_kutta_step;
procedure evolve_one_step is
begin
-- 4th order RK ---
advance_slaves; -- prepare for a new Runge-Kutta step
runge_kutta_step; -- the four Runge-Kutta steps
runge_kutta_step;
runge_kutta_step;
runge_kutta_step;
advance_slaves; -- complete the Runge-Kutta step
end evolve_one_step;
begin
prepare_slaves;
num_loop := 0;
looping := (num_loop < max_loop);
print_time := the_time + print_time_step;
set_time_step;
set_time_step_min;
set_finite_diff_factors;
set_time_derivatives;
create_text_io_lists;
write_summary_header;
write_results;
write_summary;
write_history;
reset_elapsed_cpu;
loop
evolve_one_step;
num_loop := num_loop + 1;
looping := (num_loop < max_loop) and (the_time < end_time - 0.5*time_step);
if (print_cycle > 0 and then (num_loop rem print_cycle) = 0)
or (abs (the_time-print_time) < 0.5*time_step)
or (the_time > print_time)
or (not looping)
then
write_results;
write_summary;
write_history;
print_time := print_time + print_time_step;
set_time_step;
if time_step < time_step_min then
raise Constraint_error with "time step too small";
end if;
if print_time_step < time_step then
raise Constraint_Error with "print time step < time step";
end if;
end if;
exit when not looping;
end loop;
release_slaves;
write_summary_trailer;
report_elapsed_cpu (grid_point_num, num_loop);
exception
when whoops : others =>
Put_Line ("> Exception raised in evolve_data");
Put_Line (Ada.Exceptions.Exception_Information (whoops));
report_elapsed_cpu (grid_point_num, num_loop);
halt (1);
end evolve_data;
end ADMBase.Evolve;
|
Transynther/x86/_processed/AVXALIGN/_st_/i9-9900K_12_0xca.log_21829_1295.asm | ljhsiun2/medusa | 9 | 93925 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r15
push %r9
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x12880, %rsi
lea addresses_WT_ht+0x8e5a, %rdi
nop
nop
nop
sub $56657, %r13
mov $119, %rcx
rep movsb
inc %r15
lea addresses_WT_ht+0xf0ba, %rax
nop
nop
cmp %r9, %r9
movb (%rax), %r13b
nop
nop
nop
nop
add %r15, %r15
lea addresses_WC_ht+0x14eba, %rsi
lea addresses_WT_ht+0xb2ba, %rdi
nop
nop
xor %r11, %r11
mov $86, %rcx
rep movsq
nop
nop
nop
nop
nop
sub $52878, %r13
lea addresses_WC_ht+0xacba, %r9
nop
nop
inc %rax
movw $0x6162, (%r9)
sub $46162, %r9
lea addresses_normal_ht+0x1ee9a, %rsi
nop
xor %rax, %rax
mov (%rsi), %cx
nop
nop
nop
cmp $45339, %r9
lea addresses_normal_ht+0x1a83a, %rsi
lea addresses_normal_ht+0xaba, %rdi
nop
add %r15, %r15
mov $77, %rcx
rep movsl
nop
cmp %rsi, %rsi
lea addresses_A_ht+0x1e2ba, %rsi
lea addresses_UC_ht+0x10aba, %rdi
nop
nop
nop
sub %r15, %r15
mov $107, %rcx
rep movsl
nop
sub %r9, %r9
lea addresses_normal_ht+0x853a, %rdi
clflush (%rdi)
nop
add $47134, %r11
mov (%rdi), %si
nop
nop
dec %rsi
pop %rsi
pop %rdi
pop %rcx
pop %rax
pop %r9
pop %r15
pop %r13
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r14
push %r8
push %r9
push %rax
push %rcx
push %rdx
push %rsi
// Store
lea addresses_normal+0xf2ba, %r14
nop
add $28453, %rcx
movw $0x5152, (%r14)
sub $35039, %rcx
// Faulty Load
lea addresses_normal+0xd2ba, %rsi
nop
nop
nop
nop
and $43718, %r9
mov (%rsi), %cx
lea oracles, %rax
and $0xff, %rcx
shlq $12, %rcx
mov (%rax,%rcx,1), %rcx
pop %rsi
pop %rdx
pop %rcx
pop %rax
pop %r9
pop %r8
pop %r14
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_normal', 'same': False, 'AVXalign': False, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'size': 2, 'NT': False, 'type': 'addresses_normal', 'same': False, 'AVXalign': False, 'congruent': 11}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_normal', 'same': True, 'AVXalign': True, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_WC_ht', 'congruent': 1}, 'dst': {'same': False, 'type': 'addresses_WT_ht', 'congruent': 5}}
{'OP': 'LOAD', 'src': {'size': 1, 'NT': False, 'type': 'addresses_WT_ht', 'same': False, 'AVXalign': False, 'congruent': 7}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_WC_ht', 'congruent': 10}, 'dst': {'same': False, 'type': 'addresses_WT_ht', 'congruent': 10}}
{'OP': 'STOR', 'dst': {'size': 2, 'NT': False, 'type': 'addresses_WC_ht', 'same': False, 'AVXalign': False, 'congruent': 8}}
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_normal_ht', 'same': False, 'AVXalign': True, 'congruent': 3}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_normal_ht', 'congruent': 7}, 'dst': {'same': False, 'type': 'addresses_normal_ht', 'congruent': 9}}
{'OP': 'REPM', 'src': {'same': True, 'type': 'addresses_A_ht', 'congruent': 11}, 'dst': {'same': False, 'type': 'addresses_UC_ht', 'congruent': 7}}
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_normal_ht', 'same': False, 'AVXalign': False, 'congruent': 7}}
{'34': 21829}
34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34
*/
|
Transynther/x86/_processed/NONE/_zr_/i3-7100_9_0xca_notsx.log_119_127.asm | ljhsiun2/medusa | 9 | 15487 | .global s_prepare_buffers
s_prepare_buffers:
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r13
push %r14
push %r8
push %rax
push %rbp
// Store
lea addresses_A+0xb9d0, %r11
nop
nop
nop
nop
cmp $28568, %rax
mov $0x5152535455565758, %r13
movq %r13, %xmm1
movups %xmm1, (%r11)
nop
cmp $34146, %r13
// Store
mov $0x2663980000000a70, %rax
nop
nop
nop
nop
nop
cmp $40643, %r14
mov $0x5152535455565758, %r8
movq %r8, (%rax)
nop
nop
nop
nop
dec %r11
// Store
mov $0x998, %r13
nop
nop
nop
cmp %r11, %r11
movb $0x51, (%r13)
// Exception!!!
nop
nop
mov (0), %r14
nop
and %r14, %r14
// Store
lea addresses_US+0x10f98, %r8
nop
nop
and %rbp, %rbp
mov $0x5152535455565758, %r14
movq %r14, %xmm1
movups %xmm1, (%r8)
nop
nop
nop
xor %rbp, %rbp
// Faulty Load
lea addresses_A+0x11798, %r14
nop
xor $31216, %r11
movb (%r14), %r13b
lea oracles, %r11
and $0xff, %r13
shlq $12, %r13
mov (%r11,%r13,1), %r13
pop %rbp
pop %rax
pop %r8
pop %r14
pop %r13
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'same': False, 'congruent': 0, 'NT': False, 'type': 'addresses_A', 'size': 4, 'AVXalign': True}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 2, 'NT': False, 'type': 'addresses_A', 'size': 16, 'AVXalign': False}}
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 3, 'NT': False, 'type': 'addresses_NC', 'size': 8, 'AVXalign': True}}
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 8, 'NT': False, 'type': 'addresses_P', 'size': 1, 'AVXalign': False}}
{'OP': 'STOR', 'dst': {'same': False, 'congruent': 11, 'NT': False, 'type': 'addresses_US', 'size': 16, 'AVXalign': False}}
[Faulty Load]
{'src': {'same': True, 'congruent': 0, 'NT': False, 'type': 'addresses_A', 'size': 1, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'00': 119}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
MIPS/Uppercase.asm | WorkingFen/ExamplesARKO | 1 | 167068 | <reponame>WorkingFen/ExamplesARKO<filename>MIPS/Uppercase.asm
.data #data segment
prompt: .asciiz "Enter string: \n" #string
buf: .space 100 #buffer with 100 bytes
.text #text segment
.globl main #visible outside
main:
li $v0, 4 #print string
la $a0, prompt #from this
syscall
li $v0, 8 #read string
la $a0, buf #to this
li $a1, 100 #max amount
syscall
la $t0, buf #first local -> address of buffer
lb $t1, ($t0) #second local -> first byte from address
beqz $t1, end #check if equals \0 then go to label "exit"
loop:
blt $t1, 'a', next #check if first less than second? then go to label "next" : move to next instruction
bgt $t1, 'z', next #check if first grater than second? then go to label "next" : move to next instruction
subu $t1, $t1, 0x20 #subtract third from second then save to first
sb $t1, ($t0) #store byte from first to second
next:
addi $t0, $t0, 1 #move to next address
lb $t1, ($t0) #load byte from second to first
bnez $t1, loop #check if not equals \0 then go to label "loop"
end:
li $v0, 4 #print string
la $a0, buf #from this
syscall
li $v0, 10 #terminate execution
syscall
|
Task/Read-entire-file/AppleScript/read-entire-file.applescript | LaudateCorpus1/RosettaCodeData | 1 | 3549 | set pathToTextFile to ((path to desktop folder as string) & "testfile.txt")
-- short way: open, read and close in one step
set fileContent to read file pathToTextFile
-- long way: open a file reference, read content and close access
set fileRef to open for access pathToTextFile
set fileContent to read fileRef
close access fileRef
|
global/func.asm | llamaking136/CAC | 7 | 245229 | <gh_stars>1-10
define_global:
push ebp
mov ebp, esp
mov eax, [ebp + 8]
global eax
ret |
arch/x86/asm/runtime.asm | mvdnes/element76 | 30 | 11268 | <reponame>mvdnes/element76
global __morestack
__morestack:
cli
hlt
jmp __morestack
; Allocate a 16KiB stack
section .bootstrap_stack
align 4
stack_bottom:
times 16384 db 0
stack_top:
extern entry
; Entry point
section .text
global start
start:
cli
; Set up the stack
mov esp, stack_top
; Make everything play nice with segmented stacks - see __morestack below
mov [gs:0x30], dword 0
call entry
jmp hang
global abort
abort:
jmp hang
hang:
cli
hlt
jmp hang
|
src/main/java/ca/queensu/cs/antler4AC/AC.g4 | MajidGitHubRepos/MRegTest-ORG | 0 | 4905 | <filename>src/main/java/ca/queensu/cs/antler4AC/AC.g4<gh_stars>0
grammar AC;
parse
: block EOF
;
block
: stat*
;
stat
: assignment
| if_stat
| while_stat
| loop_stat
| log
| send_stat
| sendat_stat
| showContent_stat
| timer_stat
| return_stat
| ignore_stat
// | unknowns
;
done: EOF #processingDone
;
assignment
: ID ASSIGN (INTVAR | DOUBLEVAR | STRINGVAR | BOOLVAR)? expr SCOL #normalAssignment
| op=(INTVAR | DOUBLEVAR | STRINGVAR | BOOLVAR) ID ASSIGN? (INTVAR | DOUBLEVAR | STRINGVAR | BOOLVAR)? expr? SCOL #basicAssignment
| ID MINUSMINUS SCOL #minusminusAssignment
| ID PLUSPLUS SCOL #plusplusAssignment
| STRINGVAR? ID ASSIGN GETNAME SCOL #getNameAssignment
| ID ASSIGN timer_stat #getTimerAssignment
;
ignore_stat
: IGNORELINE #ignoreLine
;
if_stat
: IF condition_block (ELSE IF condition_block)* (ELSE stat_block)?
;
condition_block
: expr stat_block
;
stat_block
: OBRACE block CBRACE
| stat
;
while_stat
: WHILE OPAR expr CPAR stat_block
;
loop_stat
: WHILE '(' expr ')' stat_block #whileLoop
| DO stat_block WHILE '(' expr ')' ';' #doWhileLoop
| FOR '(' op=(INTVAR | DOUBLEVAR)? ID ASSIGN expr ';' expr ';' expr ')' stat_block #forLoop
;
sendat_stat
: ID '.' ID '(' (INTVAR | DOUBLEVAR | STRINGVAR | BOOLVAR)? expr ')' '.' SENDAT '(' (INTVAR | DOUBLEVAR | STRINGVAR | BOOLVAR)? (expr | BACKMSG) ')' SCOL
| ID '.' ID '()' '.' SENDAT '(' (expr | BACKMSG) ')' SCOL
;
send_stat
: ID '.' ID '(' (INTVAR | DOUBLEVAR | STRINGVAR | BOOLVAR)? expr ')' '.' SEND '()' SCOL
| ID '.' ID '(' (INTVAR | DOUBLEVAR | STRINGVAR | BOOLVAR)? GETNAME? ')' '.' SEND '()' SCOL
| ID '.' ID '()' '.' SEND '()' SCOL
;
timer_stat
: ID '.' op=('informIn' | 'cancelTimer' | 'informEvery') .*? SCOL
;
showContent_stat
: SHOWHEAP SCOL #showHeapMem
| SHOWLISTSEND SCOL #showListSendMsg
;
log
: LOG expr SCOL
;
return_stat
: RETURN expr? SCOL
;
expr
: expr POW<assoc=right> expr #powExpr
| expr MINUSMINUS #minusminusExpr
| expr PLUSPLUS #plusplusExpr
| MINUS expr #unaryMinusExpr
| NOT expr #notExpr
| expr op=(MULT | DIV | MOD | MINUSMINUS | PLUSPLUS) expr #multiplicationExpr
| expr op=(PLUS | MINUS) expr #additiveExpr
| expr op=(LTEQ | GTEQ | LT | GT) expr #relationalExpr
| expr op=(EQ | NEQ) expr #equalityExpr
| expr AND expr #andExpr
| expr OR expr #orExpr
| GETNAME #getNameExpr
| BACKMSG #backMsgExpr
| atom #atomExpr
| RANDFUNC #randFuncExpr
| ID DOT 'find' OPAR (ID | STRING) CPAR #findFuncExpr
| (ID | STRING) DOT 'substr' OPAR expr ',' expr CPAR #substrFuncExpr
| (ID | STRING) DOT 'length()' #lengthFuncExpr
| 'strcmp' '(' STRINGVAR? op1=(ID | STRING) ',' STRINGVAR? op2=(ID | STRING) ')' #strcmpFuncExpr
| IGNOREEXPR #ignoreExpr
;
atom
: OPAR expr CPAR #parExpr
| (INT | FLOAT) #numberAtom
| (TRUE | FALSE) #booleanAtom
| ID #idAtom
| STRING #stringAtom
| NIL #nilAtom
;
DOT : '.' ;
INSTREAM : '<<';
OUTSTREAM : '>>';
OR : '||';
AND : '&&';
EQ : '==';
NEQ : '!=';
GT : '>';
LT : '<';
GTEQ : '>=';
LTEQ : '<=';
PLUS : '+';
PLUSPLUS : '++';
MINUS : '-';
MINUSMINUS : '--';
MULT : '*';
DIV : '/';
MOD : '%';
POW : '^';
NOT : '!';
COMMA : ',';
COLON : ':' ;
SCOL : ';';
ASSIGN : '=';
OPAR : '(';
CPAR : ')';
OBRACE : '{';
CBRACE : '}';
LBRACKET : '[' ;
RBRACKET : ']' ;
TRUE : 'true';
FALSE : 'false';
NIL : 'nil';
IF : 'if';
ELSE : 'else';
WHILE : 'while';
LOG : 'log';
FOR : 'for';
DO : 'do' ;
RETURN: 'return';
SEND : 'send';
SENDAT : 'sendAt';
BACKMSG: 'msg->sapIndex0_';
GETNAME: STRINGVAR? SPACE? 'this->getName()';
RANDFUNC: 'rand()';
SHOWHEAP : 'showHeap';
SHOWLISTSEND : 'showListSendMsg';
BOOLVAR : 'bool' ;
INTVAR : 'int';
DOUBLEVAR : 'double';
CHARVAR : 'char';
STRINGVAR
: 'string'
| '('? SPACE? CHARVAR SPACE? MULT SPACE? ')'?
;
ID
: [a-zA-Z_] [a-zA-Z_0-9]*
;
INT
: [0-9]+
;
FLOAT
: [0-9]+ '.' [0-9]*
| '.' [0-9]+
;
STRING
: '"' (~["\r\n] | '""')* '"'
;
COMMENT
: '//' ~[\r\n]* -> skip
;
BLOCKCOMMENT
: '/*' .*? '*/' -> skip
;
SPACE
: (' ' | '\t' | '\n')+ -> skip
;
NEWLINE
: ('\r' '\n'? | '\n') -> skip
;
unknowns : . #unknownsExpr
;
Space
: (' ' | '\t' | '\n')+ {skip();}
;
IGNORELINE : 'std::'? ( 'log.' | 'logfile.flush()' |'logfile<<' | 'logfile>>' | 'cout<<' | 'this_thread' | 'ts.getclock') .*? ';'
;
IGNOREWORD
: ('this->' | 'std::' | '.c_str()') -> skip
;
IGNOREEXPR
: ('logfile' | 'ResponseTimerId' | 'KeepAliveTimerId' | 'KeepAliveTimerId' | 'AnnouncementTimerId' | 'TimerId' | 'AnnouncementServer1Id' | 'AnnouncementServer2Id') DOT .*? '(' .*? ')'
;
//IGNORE
// : ('log.' | 'logfile.flush()' | 'this->hostConfig' | 'RequestTimer.informIn' | 'ts.getclock' | 'std::' |IF .*? 'systemConfig.RunningMode'| IF? .*? 'logfile' | 'TimerId=' | 'KeepAliveTimerId=' | 'AnnouncementTimerId=' | 'ConfigComm.StartUp(this->systemConfig)') .*? ';' -> skip
// ;
//IFIGNORE
// : (IF .*? 'hostConfig.')
// ;
//BLOCKIGNORE
// : (ELSE? .*? IF *.? STRCMP) .*? '}' -> skip
// ;
|
src/simple_webapps-append_servers.ads | faelys/simple-webapps | 1 | 26746 | ------------------------------------------------------------------------------
-- Copyright (c) 2016, <NAME> --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Simple_Webapps.Append_Servers provides an HTTP server that handle POST --
-- request by appending signed data to a given local file. --
------------------------------------------------------------------------------
with AWS.Dispatchers;
with AWS.Response;
with AWS.Status;
with Natools.S_Expressions.Lockable;
private with Ada.Strings.Unbounded;
private with Natools.Constant_Indefinite_Ordered_Maps;
private with Natools.References;
private with Natools.Storage_Pools;
private with Natools.S_Expressions.Atom_Refs;
private with Natools.S_Expressions.Printers.Pretty;
package Simple_Webapps.Append_Servers is
type Handler is new AWS.Dispatchers.Handler with private;
overriding function Dispatch
(Dispatcher : in Handler;
Request : in AWS.Status.Data)
return AWS.Response.Data;
overriding function Clone (Dispatcher : in Handler) return Handler;
not overriding procedure Reset
(Dispatcher : in out Handler;
Config_File : in String);
not overriding procedure Reset
(Dispatcher : in out Handler;
Config : in out Natools.S_Expressions.Lockable.Descriptor'Class;
File_Name : in String);
type Log_Procedure is not null access procedure (Message : in String);
procedure Discard_Log (Message : in String) is null;
Log : Log_Procedure := Discard_Log'Access;
-- Note that unlike its namesake in Simple_Webapps.Upload_Server,
-- this procedure is called from an AWS reponse callback without
-- any protection, so it should be made task-safe.
private
package Sx renames Natools.S_Expressions;
subtype String_Holder is Ada.Strings.Unbounded.Unbounded_String;
function Hold (S : String) return String_Holder
renames Ada.Strings.Unbounded.To_Unbounded_String;
function To_String (H : String_Holder) return String
renames Ada.Strings.Unbounded.To_String;
type Separator_Action is
(No_Separator, -- Received data is appended as-is
Force_Separator, -- Separator data is appended after each post
Separator_If_Needed); -- Separator data is appended when it's not a
-- suffix of the posted data
type Separator_Data (Action : Separator_Action := No_Separator) is record
case Action is
when No_Separator => null;
when Force_Separator | Separator_If_Needed =>
Data : Sx.Atom_Refs.Immutable_Reference;
end case;
end record;
type Endpoint is record
Data_Path : String_Holder;
Invalid_Log : String_Holder;
Key : Sx.Atom_Refs.Immutable_Reference;
Separator : Separator_Data;
Redirect : String_Holder;
Pretty_Printer : Sx.Printers.Pretty.Parameters;
end record;
procedure Append_Data
(Self : in Endpoint;
Data : in Sx.Atom);
procedure Log_Invalid
(Self : in Endpoint;
Data : in Sx.Atom;
Given_Signature : in Sx.Atom;
Expected_Signature : in Sx.Atom);
package Execution_Results is
type Enum is (OK, Invalid_Signature, File_Error);
type Data (State : Enum) is record
case State is
when OK =>
Redirect : String_Holder;
when Invalid_Signature | File_Error =>
null;
end case;
end record;
end Execution_Results;
function Execute
(Self : in Endpoint;
Data : in Sx.Atom;
Signature : in Sx.Atom)
return Execution_Results.Data;
package Endpoint_Maps is new Natools.Constant_Indefinite_Ordered_Maps
(String, Endpoint);
type Server_Data is record
Default_Printer : Sx.Printers.Pretty.Parameters;
Endpoints : Endpoint_Maps.Constant_Map;
Static_Path : String_Holder;
Template : String_Holder;
end record;
package Server_Refs is new Natools.References
(Server_Data,
Natools.Storage_Pools.Access_In_Default_Pool'Storage_Pool,
Natools.Storage_Pools.Access_In_Default_Pool'Storage_Pool);
type Handler is new AWS.Dispatchers.Handler with record
Ref : Server_Refs.Immutable_Reference;
end record;
end Simple_Webapps.Append_Servers;
|
libsrc/_DEVELOPMENT/drivers/character/character_00/input/character_00_input/character_00_input_stdio_msg_seek.asm | jpoikela/z88dk | 640 | 174016 | <gh_stars>100-1000
SECTION code_driver
SECTION code_driver_character_input
PUBLIC character_00_input_stdio_msg_seek
EXTERN STDIO_MSG_GETC, STDIO_SEEK_CUR
EXTERN l_decu_dehl, l_jpix, error_lzc, error_lznc
character_00_input_stdio_msg_seek:
; C = STDIO_SEEK_SET (0), STDIO_SEEK_CUR (1), STDIO_SEEK_END (2)
; DEHL'= file offset
; C'= STDIO_SEEK_SET (0), STDIO_SEEK_CUR (1), STDIO_SEEK_END (2)
;
; return:
;
; DEHL = updated file position
; carry set on error (file position out of range)
;
; note: stdio stages with buffers must flush first when
; this message is received.
exx
ld a,c
cp STDIO_SEEK_CUR
jp nz, error_lznc ; if not seeking forward do nothing
bit 7,d
jp nz, error_lznc ; if negative offset do nothing
seek_loop:
; dehl = number of chars remaining to consume
ld a,d
or e
or h
or l
ret z ; if done
call l_decu_dehl
push de
push hl
ld a,STDIO_MSG_GETC
call l_jpix
pop hl
pop de
jr nc, seek_loop ; if no error
jp error_lzc ; if driver error
|
programs/oeis/173/A173254.asm | jmorken/loda | 1 | 105027 | <reponame>jmorken/loda
; A173254: a(n) = a(n-1) + a(n-2) - [a(n-2)/2] - [a(n-4)/2].
; 1,1,2,3,4,6,7,9,11,13,16,19,22,26,29,33,37,41,46,51,56,62,67,73,79,85,92,99,106,114,121,129,137,145,154,163,172,182,191,201,211,221,232,243,254,266,277,289,301,313,326
add $0,3
mov $1,5
lpb $0
trn $0,4
add $1,$0
trn $0,3
sub $1,2
add $1,$0
trn $0,1
add $1,1
lpe
sub $1,3
|
oeis/047/A047253.asm | neoneye/loda-programs | 11 | 240436 | <reponame>neoneye/loda-programs
; A047253: Numbers that are congruent to {1, 2, 3, 4, 5} mod 6.
; Submitted by <NAME>
; 1,2,3,4,5,7,8,9,10,11,13,14,15,16,17,19,20,21,22,23,25,26,27,28,29,31,32,33,34,35,37,38,39,40,41,43,44,45,46,47,49,50,51,52,53,55,56,57,58,59,61,62,63,64,65,67,68,69,70,71,73,74,75,76,77,79,80,81,82,83,85,86,87,88,89,91,92,93,94,95,97,98,99,100,101,103,104,105,106,107,109,110,111,112,113,115,116,117,118,119
mul $0,36
div $0,30
add $0,1
|
programs/oeis/166/A166356.asm | neoneye/loda | 22 | 92120 | <gh_stars>10-100
; A166356: Expansion of e.g.f. 1 + x*arctanh(x), even powers only.
; 1,2,8,144,5760,403200,43545600,6706022400,1394852659200,376610217984000,128047474114560000,53523844179886080000,26976017466662584320000,16131658445064225423360000
mul $0,2
mov $2,1
lpb $0
mov $2,$0
mov $0,1
seq $2,98557 ; E.g.f. (1/2)*(1+x)*log((1+x)/(1-x)).
lpe
mov $0,$2
|
models/amalgam/paper/unused/resfm.als | transclosure/Amalgam | 4 | 3881 | <reponame>transclosure/Amalgam
/*
Buggy model of resolution (Figure 1)
From _Finding Minimal Unsatisfiable Cores of Declarative Specifications_
<NAME>, <NAME>-<NAME>, and <NAME>
Formal Methods 2008
*/
abstract sig Boolean {}
one sig True, False extends Boolean {}
sig Literal { neg : Literal }
fact { neg = ~neg and no iden & neg }
sig Clause {lits: set Literal}
one sig Conflict extends Clause{} {no lits}
fact {all c: Clause - Conflict | some c.lits}
fact {all c: Clause | no c.lits & c.lits.neg}
pred resolve[c1, c2, r: Clause] {
some x: c1.lits & c2.lits.neg |
r.lits = (c1.lits & c2.lits) - (x + x.neg)
}
sig Refutation {
sources: some Clause - Conflict,
resolvents: set Clause,
edges: (sources + resolvents) -> resolvents
} {
no ^edges & iden
all r: resolvents | some edges.r
Conflict in resolvents
// Buggy version
/* all n1,n2: sources + resolvents |
all r: resolvents |
(n1+n2)->r in edges iff
resolve[n1,n2,r]
*/
// Fixed version
edges = {
n: sources + resolvents, r: resolvents |
one edges.r - n and
resolve[n, edges.r - n, r] }
}
sig Instance {
clauses: some Clause,
assign: Literal->lone Boolean
} {
all lit: clauses.lits |
assign[lit] = Boolean - assign[lit.neg]
all c: clauses | True in assign[c.lits]
}
-----------------------------------------------------
// IMPORTANT: switch to buggy version of sigfact above
assert case1example {
all i: Instance |
no ref: Refutation |
ref.sources = i.clauses
}
//check case1example for 3
-----------------------------------------------------
// case 2 example is case1example with fixed sigfact
-----------------------------------------------------
// case 3: weak assertion
// Run with fixed sigfact
assert case3example {
all i: Instance, cs: set i.clauses |
cs in lits.(i.assign.True)
}
//check case3example for 3
-----------------------------------------------------
// case 4: scope is too small
assert case4example {
all ref: Refutation |
no (ref.edges).(ref.sources)
}
//check case4example for 2
//check case4example for 3
//check case4example for 4
check case4example for 5
|
asm/patches/flexible_item_locations.asm | Crain-32/wwrando | 0 | 167913 |
; This patch modifies places in the game's code that don't work well when the item given by certain item locations is changed in order to allow these locations to be randomized.
; Normally the Great Fairies will give you the next tier max-up upgrade, depending on what you currently have.
; So if you already got the 1000 Rupee Wallet from one Great Fairy, the second one will give you the 5000 Rupee Wallet, regardless of the order you reach them in.
; This patch changes it so they always give a constant item even if you already have it, so that the item can be randomized safely.
.open "files/rels/d_a_bigelf.rel" ; Great Fairy
.org 0x217C
; Check this Great Fairy's index to determine what item to give.
cmpwi r0, 1
blt 0x21B8 ; 0, Northern Fairy Island Great Fairy. Give 1000 Rupee Wallet.
beq 0x21C4 ; 1, Outset Island Great Fairy. Give 5000 Rupee Wallet.
cmpwi r0, 3
blt 0x21E4 ; 2, Eastern Fairy Island Great Fairy. Give 60 Bomb Bomb Bag.
beq 0x21F0 ; 3, Southern Fairy Island Great Fairy. Give 99 Bomb Bomb Bag.
cmpwi r0, 5
blt 0x2210 ; 4, Western Fairy Island Great Fairy. Give 60 Arrow Quiver.
beq 0x221C ; 5, Thorned Fairy Island Great Fairy. Give 99 Arrow Quiver.
b 0x2228 ; Failsafe code in case the index was invalid (give a red rupee instead)
.close
; The event where the player gets the Wind's Requiem actually gives that song to the player twice.
; The first one is hardcoded into Zephos's AI and only gives the song.
; The second is part of the event, and also handles the text, model, animation, etc, of getting the song.
; Getting the same item twice is a problem for some items, such as rupees. So we remove the first one.
.open "files/rels/d_a_npc_hr.rel" ; Zephos
.org 0x1164
; Branch to skip over the line of code where Zephos gives the Wind's Requiem.
b 0x116C
.close
; The 6 Heart Containers that appear after you kill a boss are all created by the function createItemForBoss.
; createItemForBoss hardcodes the item ID 8, and doesn't care which boss was just killed. This makes it hard to randomize boss drops without changing all 6 in sync.
; So we make some changes to createItemForBoss and the places that call it so that each boss can give a different item.
.open "sys/main.dol"
; First we modify the createItemForBoss function itself to not hardcode the item ID as 8 (Heart Container).
; We nop out the two instructions that load 8 into r4. This way it simply passes whatever it got as argument r4 into the next function call to createItem.
.org 0x80026A90 ; In fopAcM_createItemForBoss
nop
.org 0x80026AB0 ; In fopAcM_createItemForBoss
nop
; Second we modify the code for the "disappear" cloud of smoke when the boss dies.
; This cloud of smoke is what spawns the item when Gohma, Kalle Demos, Helmaroc King, and Jalhalla die.
; So we need a way to pass the item ID from the boss's code to the disappear cloud's parameters and store them there.
; We do this by hijacking argument r7 when the boss calls createDisappear.
; Normally argument r7 is a byte, and gets stored to the disappear's params with mask 00FF0000.
; We change it to be a halfword and stored with the mask FFFF0000.
; The lower byte is unchanged from vanilla, it's still whatever argument r7 used to be for.
; But the upper byte, which used to be unused, now has the item ID in it.
.org 0x80027AC4 ; In fopAcM_createDisappear
rlwimi r4, r7, 16, 0, 15
; Then we need to read the item ID parameter when the cloud is about to call createItemForBoss.
.org 0x800E7A1C ; In daDisappear_Execute
lbz r4, 0x00B0(r7)
.close
; Third we change how the boss item ACTR calls createItemForBoss.
; (This is the ACTR that appears if the player skips getting the boss item after killing the boss, and instead comes back and does the whole dungeon again.)
; Normally it sets argument r4 to 1, but createItemForBoss doesn't even use argument r4.
; So we change it to load one of its params (mask: 0000FF00) and use that as argument r4.
; This param was unused and just 00 in the original game, but the randomizer will set it to the item ID it randomizes to that location.
; Then we will be calling createItemForBoss with the item ID to spawn in argument r4. Which due to the above change, will be used correctly now.
.open "files/rels/d_a_boss_item.rel"
.org 0x1C4 ; In daBossItem_Create
lbz r4, 0x00B2(r30)
.close
; The final change necessary is for all 6 bosses' code to be modified so that they pass the item ID to spawn to a function call.
; For Gohdan and Molgera, the call is to createItemForBoss directly, so argument r4 needs to be the item ID.
; For Gohma, <NAME>, <NAME>, and Jalhalla, they instead call createDisappear, so we need to upper byte of argument r7 to have the item ID.
; But the randomizer itself handles all 6 of these changes when randomizing, since these locations are all listed in the "Paths" of each item location. So no need to do anything here.
; The heart container item get function (item_func_utuwa_heart) usually handles setting the flag for having taken the current dungeon's boss item.
; But if the player got a heart container somewhere in a dungeon other than from the boss, this could cause the boss's actual item to disappear.
; We modify the code to remove the calls to set the flag.
.open "sys/main.dol"
.org 0x800C2FAC
nop
.org 0x800C2FC4
nop
.close
; Normally when the player takes a boss item drop, it would not set the flag for having taken the current dungeon's boss item, since in vanilla that was handled by the heart container's item get function.
; That could allow the player to get the item over and over again since the item never disappears.
; So we modify createItemForBoss to pass an item flag to createItem, so that the item properly keeps track of whether it has been taken.
; We use item flag 15 for all boss items, since that flag is not used by any items in any of the dungeons.
; (Note that since we're just setting an item flag, the special flag for the dungeon's boss item being taken is never set. But I don't believe that should cause any issues.)
.open "sys/main.dol"
.org 0x80026A94
li r5, 0x15
.org 0x80026AB4
li r5, 0x15
.close
; The Great Fairy inside the Big Octo is hardcoded to double your max magic meter (and fill up your current magic meter too).
; Since we randomize what item she gives you, we need to remove this code so that she doesn't always give you the increased magic meter.
.open "files/rels/d_a_bigelf.rel" ; Great Fairy
.org 0x7C4
nop ; For max MP
.org 0x7D0
nop ; For current MP
.close
; Also, the magic meter upgrade item itself only increases your max MP.
; In the vanilla game, the Great Fairy would also refill your MP for you.
; Therefore we modify the code of the magic meter upgrade to also refill your MP.
.open "sys/main.dol"
.org 0x800C4D14
; Instead of adding 32 to the player's previous max MP, simply set both the current and max MP to 32.
li r0, 32
sth r0, 0x5B78 (r4)
.close
; When salvage points decide if they should show their ray of light, they originally only checked if you
; have the appropriate Triforce Chart deciphered if the item there is actually a Triforce Shard.
; We don't want the ray of light to show until the chart is deciphered, so we change the salvage point code
; to check the chart index instead of the item ID when determining if it's a Triforce or not.
.open "files/rels/d_a_salvage.rel" ; Salvage point object
.org 0x10C0
; We replace the call to getItemNo, so it instead just adds 0x61 to the chart index.
; 0x61 to 0x68 are the Triforce Shard IDs, and 0 to 8 are the Triforce Chart indexes,
; so by adding 0x61 we simulate whether the item would be a Triforce Shard or not based on the chart index.
addi r3, r19, 0x61
; Then we branch to skip the line of code that originally called getItemNo.
; We can't easily nop the line out, since the REL's relocation would overwrite our nop.
b 0x10CC
.close
; The first instance of Medli, who gives the letter for Komali, can disappear under certain circumstances.
; For example, owning the half-power Master Sword makes her disappear. Deliving the letter to Komali also makes her disappear.
; So in order to avoid the item she gives being missable, we just remove it entirely.
; To do this we modify the chkLetterPassed function to always return true, so she thinks you've delivered the letter.
.open "sys/main.dol"
.org 0x8021BF80
li r3, 1
.close
; Normally whether you can use Hurricane Spin or not is determined by if the event bit for the event where Orca teaches it to you is set or not.
; But we want to separate the ability from the event so they can be randomized.
; To do this we change it to check event bit 6901 (bit 01 of byte 803C5295) instead. This bit was originally unused.
.open "sys/main.dol"
.org 0x80158C08
li r4, 0x6901 ; Unused event bit
; Then change the Hurricane Spin's item get func to our custom function which sets this previously unused bit.
.org 0x80388B70 ; 0x803888C8 + 0xAA*4
.int hurricane_spin_item_func
.close
; Normally Beedle checks if you've bought the Bait Bag by actually checking if you own the Bait Bag item.
; That method is problematic for many items that can get randomized into that shop slot, including progressive items.
; So we change the functions he calls to set the slot as sold out and check if it's sold out to custom functions.
; These custom functions use bit 40 of byte 803C4CBF, which was originally unused, to keep track of this.
.open "files/rels/d_a_npc_bs1.rel" ; Beedle
.org 0x1CE8
; Originally called SoldOutItem
bl set_shop_item_in_bait_bag_slot_sold_out
.org 0x2DC4
; Originally called checkGetItem.
bl check_shop_item_in_bait_bag_slot_sold_out
.close
; Three items are spawned by a call to fastCreateItem:
; * The item buried under black soil that you need the pig to dig up.
; * The item given by the withered trees.
; * The item hidden in a tree on Windfall. (Not modified here since its item is not randomized.)
; This is bad since fastCreateItem doesn't load the field item model in. If the model isn't already loaded the game will crash.
; So we add a new custom function to create an item and load the model, and replace the relevant calls so they call the new function.
; Buried item
.open "sys/main.dol"
.org 0x80056C0C ; In dig_main__13daTagKbItem_cFv
; Replace fastCreateItem call
bl custom_createItem
; Then remove the code that sets bit 0x4000 of the bitfield at item_entity+0x1C4.
; This bit just seems to offset the item or something, but custom_createItem's item action does this anyway.
; Furthermore, it's not possible to set that bit until after the item actor has been created, which doesn't happen until later with custom_createItem unlike fastCreateItem.
nop
nop
nop
nop
nop
.close
; Withered trees
.open "files/rels/d_a_obj_ftree.rel" ; Withered Trees
; In launch_heart_part (for creating the heart piece when the player waters the final tree)
.org 0x25C
bl custom_createItem
.org 0x260
; Change the check on the return value from fastCreateItem being 0 (meaning no item actor was created) to instead check if the return value from custom_createItem is -1 (also meaning no item actor was created).
mr r31, r3
cmpwi r31, -1
beq 0x2B8 ; (We overwrite a single line of code here which was a pointless branch that would never execute.)
; Then change the line of code that read the actor's unique ID from actor+4. Since the unique ID was already returned by custom_createItem directly, we don't need to read it, we can just move it from r31.
mr r0, r31
; (After this, the withered tree will store the actor's unique ID to tree_actor+0x64C as normal.)
.org 0x2A4
; Then remove a line of code where it set the bitfield at the item actor+0x1C4 to 0x00004040.
; Since the actor doesn't exist yet we can't set this yet.
; Bit 0x4000 gets set by custom_createItem's item action, so that doesn't matter anyway.
; Bit 0x40 we will set on the frame that the item actor properly spawns as part of withered_tree_item_try_give_momentum.
nop
; In place_heart_part (for recreating the heart piece if the player watered all the trees and then reloaded the stage)
.org 0x418
; Instead of simply calling custom_createItem, we have to call a wrapper function that both calls custom_createItem and sets our custom flag at withered_tree_entity+0x212 on in order to avoid our custom withered tree code setting the speeds to launch the item into the air.
bl create_item_for_withered_trees_without_setting_speeds
.org 0x41C
; Again, like above we change the check on the return value to check -1 instead of 0.
cmpwi r3, -1
beq 0x45C
nop ; (We overwrite a single line of code here which was a pointless branch that would never execute.)
; And again change the line of code that read the actor's unique ID to just move the register it's in.
mr r0, r3
; (After this, the withered tree will store the actor's unique ID to tree_actor+0x64C as normal.)
; In search_heart_part (for detecting if the player has picked up the heart piece yet)
.org 0x184
; The way this function was originally coded already handled its job of detecting if the item was picked up appropriately, even in cases where the item is delayed spawned and doesn't exist for the first few frames. We don't need to modify anything to fix that.
; However, we do hijack this function in order to set some speed variables for the item on the frame it spawns, since custom_createItem wasn't able to do that like fastCreateItem was.
bl withered_tree_item_try_give_momentum
.close
; Fix the Phantom Ganon from Ganon's Tower so he doesn't disappear from the maze when the player gets Light Arrows, but instead when they open the chest at the end of the maze which originally had Light Arrows.
; We replace where he calls dComIfGs_checkGetItem__FUc with a custom function that checks the appropriate treasure chest open flag.
; We only make this change for Phanton Ganon 2 (in the maze) not Phantom Ganon 3 (when you kill him with Light Arrows).
.open "files/rels/d_a_fganon.rel" ; Phantom Ganon
.org 0x4D4C ; In standby__FP12fganon_class
bl check_ganons_tower_chest_opened
.close
; Then there's an issue where killing Phantom Ganon 3 first and using his sword to destroy the door makes the sword dropped by Phantom Ganon 2 also disappear, which is bad because then the player wouldn't know which way to go in the maze.
.open "files/rels/d_a_boko.rel" ; Weapons lying on the ground
.org 0x2A90 ; In execute__8daBoko_cFv
; Instead of checking if the event flag for having destroyed the door with Phantom Ganon's sword is set, call a custom function.
bl check_phantom_ganons_sword_should_disappear
.close
; Fix some Windfall townspeople not properly keeping track of whether they've given you their quest reward item yet or not.
; Pompie/Vera, Minenco, and Kamo give you treasure charts in the vanilla game, and they check if they've given you their item by calling checkGetItem.
; But that doesn't work for non-unique items, such as progressive items, rupees, etc.
; So we need to change their code to set and check event bits that were originally unused in the base game.
.open "files/rels/d_a_npc_people.rel" ; Various Windfall Island townspeople
; First we need to specify what event bit each townsperson should set.
; They store their item IDs as a word originally, so we can use the upper halfwords of those words to store the event bits.
; The other townspeople besides these 3 we just leave the upper halfword at 0000.
.org 0xC54C ; For Pompie and Vera
.short 0x6904 ; Unused event bit
.org 0xC550 ; For Minenco
.short 0x6908 ; Unused event bit
.org 0xC55C ; For Kamo
.short 0x6910 ; Unused event bit
; Then change the function call to createItemForPresentDemo to call our own custom function instead.
; This custom function will both call createItemForPresentDemo and set one of the event bits specified above, by extracting the item ID and event bit separately from argument r4.
.org 0x4BEC
bl create_item_and_set_event_bit_for_townsperson
; We also need to change the calls to checkGetItem to instead call isEventBit.
.org 0x8D8
bl dComIfGs_isEventBit__FUs
.org 0x14D0
bl dComIfGs_isEventBit__FUs
.org 0x1C38
bl dComIfGs_isEventBit__FUs
.org 0x6174
bl dComIfGs_isEventBit__FUs
.org 0x6C54
bl dComIfGs_isEventBit__FUs
.org 0x6CC8
bl dComIfGs_isEventBit__FUs
.org 0x88A8
bl dComIfGs_isEventBit__FUs
.org 0x8A60
bl dComIfGs_isEventBit__FUs
.org 0x91C4
bl dComIfGs_isEventBit__FUs
; And finally, we change argument r3 passed to isEventBit to be the relevant event bit, as opposed to the item ID that it originally was for checkGetItem.
.org 0x08D4 ; For Pompie and Vera
li r3, 0x6904
.org 0x14CC ; For Kamo
li r3, 0x6910
.org 0x1C34 ; For Kamo
li r3, 0x6910
.org 0x6170 ; For Minenco
li r3, 0x6908
.org 0x6C50 ; For Kamo
li r3, 0x6910
.org 0x6CC4 ; For Kamo
li r3, 0x6910
.org 0x88A4 ; For Kamo
li r3, 0x6910
.org 0x8A5C ; For Kamo
li r3, 0x6910
.org 0x91C0 ; For Pompie and Vera
li r3, 0x6904
.close
; Also, we need to change a couple checks Lenzo does, since he also checks if you got the item from Pompie and Vera.
.open "files/rels/d_a_npc_photo.rel" ; Lenzo
.org 0x9C8
bl dComIfGs_isEventBit__FUs
.org 0x9F8
bl dComIfGs_isEventBit__FUs
.org 0x9C4 ; For Lenzo, checking Pompie and Vera's event bit
li r3, 0x6904
.org 0x9F4 ; For Lenzo, checking Pompie and Vera's event bit
li r3, 0x6904
.close
; Fix Lenzo thinking you've completed his research assistant quest if you own the Deluxe Picto Box.
.open "files/rels/d_a_npc_photo.rel" ; Lenzo
; First we need to change a function Lenzo calls when he gives you the item in the Deluxe Picto Box slot to call a custom function.
; This custom function will set an event bit to keep track of whether you've done this independantly of what the item itself is.
.org 0x3BDC
bl lenzo_set_deluxe_picto_box_event_bit
; Then we change the calls to checkGetItem to see if the player owns the Deluxe Picto Box to instead check the event bit we just set (6920).
; Change the calls to checkGetItem to instead call isEventBit.
.org 0x3BB4
bl dComIfGs_isEventBit__FUs
.org 0x3C6C
bl dComIfGs_isEventBit__FUs
.org 0x4AFC
bl dComIfGs_isEventBit__FUs
; And change argument r3 passed to isEventBit to be the event bit we set (6920), as opposed to the item ID that it originally was for checkGetItem.
.org 0x3BB0
li r3, 0x6920
.org 0x3C68
li r3, 0x6920
.org 0x4AF8
li r3, 0x6920
.close
; Rock Spire Shop Ship Beedle's code checks the item IDs using some unnecessary greater than or equal checks.
; This is a problem when the item IDs are randomized because which ones are greater than which other ones is not the same as vanilla.
; We remove a couple of lines here so that it only checks equality, not greater than or equal.
.open "files/rels/d_a_npc_bs1.rel" ; Beedle
.org 0x1ED8
nop
.org 0x1EE4
nop
.close
; Zunari usually checks if he's given you the item in the Magic Armor item slot by calling checkGetItem.
; That doesn't work well when the item is randomized, so we have to replace the code with code to set and check a custom unused event bit.
.open "files/rels/d_a_npc_rsh1.rel" ; Zunari
.org 0x177C ; Where he checks if you have own the Magic Armor by calling checkItemGet.
; We replace this with a call to isEventBit checking our custom event bit.
li r3, 0x6940
nop
.org 0x1784
bl dComIfGs_isEventBit__FUs
.org 0x32E8
; Change the call to createItemForPresentDemo to instead call our custom function so that it can set the custom event bit if necessary.
bl zunari_give_item_and_set_magic_armor_event_bit
.close
; Salvage Corp usually check if they gave you their item by calling checkGetItem. That doesn't work well when it's randomized.
; We replace the code so that it sets and checks a custom unused event bit.
.open "files/rels/d_a_npc_sv.rel" ; Salvage Corp
.org 0x2C8
li r3, 0x6980
.org 0x2CC
bl dComIfGs_isEventBit__FUs
.org 0x19A8
; Change the call to createItemForPresentDemo to instead call our custom function so that it can set the custom event bit if necessary.
bl salvage_corp_give_item_and_set_event_bit
.close
; Maggie usually checks if she's given you her letter by calling isReserve. That doesn't work well when the item is randomized.
; So we change her to set and check a custom event bit (6A01).
.open "files/rels/d_a_npc_kp1.rel" ; Maggie
; Change how she checks if she's given you her first item yet.
.org 0x1214
li r3, 0x6A01
.org 0x1218
bl dComIfGs_isEventBit__FUs
; Change the function call when she gives you her first item to a custom function that will set the custom event bit.
.org 0x17EC
bl maggie_give_item_and_set_event_bit
; Also, normally if you finished her quest and get her second item, it locks you out from ever getting her first item.
; So we change it so she never acts like the quest is complete (she thinks you still have Moe's Letter in your inventory).
.org 0x11D8
b 0x1210 ; Change conditional branch to unconditional
.close
; The Rito postman in the Windfall cafe usually checks if he's given you Moe's letter by calling isReserve. That doesn't work well when the item is randomized.
; So we change him to set and check a custom event bit (6A02).
.open "files/rels/d_a_npc_bm1.rel" ; Rito postman
; Change how he checks if he's given you his item yet when he's initializing.
.org 0x1020
li r3, 0x6A02
.org 0x1024
bl dComIfGs_isEventBit__FUs
; Change how he checks if he's given you his item yet when you talk to him.
.org 0x3178
li r3, 0x6A02
.org 0x317C
bl dComIfGs_isEventBit__FUs
; Change the function call when he starts the event that gives you his item to instead call a custom function that will set a custom event bit.
.org 0x225C
bl rito_cafe_postman_start_event_and_set_event_bit
.close
; Removes a couple lines of code that initialize the arc name pointers for the field models of Fire & Ice and Light arrow.
; These lines of code would overwrite any changes we made to those pointers and cause the game to crash.
; (Specifically, they modified 0x80386C7C and 0x80386C98, which are both in the list of field item resources.)
.open "sys/main.dol"
.org 0x800C1EF8
nop
nop
.close
; Remove some dialogue the Killer Bees have hinting at where the Picto Box is after you've talked to Lenzo without it.
; Not only is this hint inaccurate in the randomizer, but this dialogue overrides the hide and seek event until you own Picto Box, which would result in a softlock if hide and seek was randomized to give Picto Box for example.
; To do this we simply override the four checks on event flag 1208 (for having talked to Lenzo without the Picto Box).
.open "files/rels/d_a_npc_mk.rel" ; Ivan
.org 0x2C2C ; In visitTalkInit__10daNpc_Mk_cFv
b 0x2C7C
.org 0x2D0C ; In visitSetEvent__10daNpc_Mk_cFv
b 0x2D48
.close
.open "files/rels/d_a_npc_uk.rel" ; The other Killer Bees besides Ivan
.org 0x29B4 ; In visitTalkInit__10daNpc_Uk_cFv
b 0x2A38
.org 0x2AC8 ; In visitSetEvent__10daNpc_Uk_cFv
b 0x2B04
.close
; Fix the wrong item get music playing when you get certain items.
.open "sys/main.dol"
.org 0x8012E3E8 ; In setGetItemSound__9daPy_lk_cFUsi
b check_play_special_item_get_music
.close
; Recode how the statues and brothers on Tingle Island check if you own the Tingle Statues.
; Originally they checked if you opened the dungeon chest that had the Tingle Statue in the vanilla game.
; But that wouldn't work correctly when Tingle Statues are randomized.
; The Tingle Statue item get functions are changed to set certain event bits, so we change the code here to check those same event bits.
.open "files/rels/d_a_obj_vtil.rel" ; Physical Tingle Statues on Tingle Island
.org 0x820
bl check_tingle_statue_owned
.close
.open "files/rels/d_a_npc_tc.rel" ; Tingle and brothers
.org 0x2F8
bl check_tingle_statue_owned
.org 0x308
bl check_tingle_statue_owned
.org 0x318
bl check_tingle_statue_owned
.org 0x328
bl check_tingle_statue_owned
.org 0x338
bl check_tingle_statue_owned
.org 0x1578
bl check_tingle_statue_owned
.org 0x158C
bl check_tingle_statue_owned
.org 0x15A0
bl check_tingle_statue_owned
.org 0x15B4
bl check_tingle_statue_owned
.org 0x15C8
bl check_tingle_statue_owned
.org 0x193C
bl check_tingle_statue_owned
.org 0x1950
bl check_tingle_statue_owned
.org 0x1964
bl check_tingle_statue_owned
.org 0x1978
bl check_tingle_statue_owned
.org 0x198C
bl check_tingle_statue_owned
.org 0x58CC
bl check_tingle_statue_owned
.org 0x58FC
bl check_tingle_statue_owned
.org 0x592C
bl check_tingle_statue_owned
.org 0x595C
bl check_tingle_statue_owned
.org 0x598C
bl check_tingle_statue_owned
.org 0x5A54
bl check_tingle_statue_owned
.org 0x5C50
bl check_tingle_statue_owned
.close
; Allow randomizing the first Green/Blue Potions Doc Bandam makes when you give him 15 jelly separately from the subsequent ones when you give him 5 jelly.
.open "files/rels/d_a_npc_ds1.rel"
.org 0x2940
; Originally called fopAcM_createItemForPresentDemo__FP4cXyziUciiP5csXyzP4cXyz
bl doc_bandam_check_new_potion_and_give_free_item
.org 0x1550 ; When Doc Bandam just made a new potion, this is where it checks if you have an empty bottle
nop ; Remove the branch here that skips giving the item in this case so the player can't miss this item.
.close
; Make the Big Octo Great Fairy always give an item hint.
; In vanilla she hinted about Fire & Ice Arrows, so she didn't give the hint if your current bow was anything but Hero's Bow.
.open "files/rels/d_a_bigelf.rel" ; Great Fairy
.org 0x22A4 ; In getMsg__10daBigelf_cFv
; Remove the conditional branch for if your current bow is not the Hero's Bow and just always show the hint.
nop
.close
; Prevent Mighty Darknuts from respawning after you've beaten them once and the chest added by the randomizer appears.
.open "files/rels/d_a_obj_firewall.rel" ; Fire wall that handles spawning the Mighty Darknuts
.org 0x1240
; Normally this code would check event bit 3520 (MIGHTY_DARKNUTS_SPAWNED) to decide if it should play the long version of the intro event or the short one after you've seen the long one once.
; We change it to check switch 5 (set when the Mighty Darknuts die) to decide if it should play the short version of the intro event, or if it shouldn't play any event at all once you've defeated the Darknuts.
li r4, 5
li r5, 0
.org 0x1248
bl isSwitch__10dSv_info_cFii
.org 0x1250
beq 0x12C4 ; If the Darknuts are defeated, destroy this firewall object so it doesn't play any intro event.
; Otherwise continue on with the normal code to initialize the short intro event.
.close
|
src/unison/test/fast/Mips/speed/gobmk.owl_defendpat.autohelperowl_defendpat421.asm | Patstrom/disUnison | 88 | 82775 | <reponame>Patstrom/disUnison<filename>src/unison/test/fast/Mips/speed/gobmk.owl_defendpat.autohelperowl_defendpat421.asm
.text
.abicalls
.section .mdebug.abi32,"",@progbits
.nan legacy
.file "gobmk.owl_defendpat.autohelperowl_defendpat421.ll"
.text
.hidden autohelperowl_defendpat421
.globl autohelperowl_defendpat421
.align 2
.type autohelperowl_defendpat421,@function
.set nomicromips
.set nomips16
.ent autohelperowl_defendpat421
autohelperowl_defendpat421: # @autohelperowl_defendpat421
.frame $sp,24,$ra
.mask 0x80000000,-4
.fmask 0x00000000,0
.set noreorder
.set nomacro
.set noat
# BB#0:
lui $2, %hi(_gp_disp)
addiu $2, $2, %lo(_gp_disp)
addiu $sp, $sp, -24
sw $ra, 20($sp) # 4-byte Folded Spill
addu $gp, $2, $25
sll $1, $4, 2
lw $2, %got(transformation)($gp)
addu $1, $2, $1
lw $2, 18336($1)
addiu $1, $zero, 3
subu $1, $1, $6
addu $4, $2, $5
lw $25, %call16(safe_move)($gp)
jalr $25
move $5, $1
sltiu $2, $2, 1
lw $ra, 20($sp) # 4-byte Folded Reload
jr $ra
addiu $sp, $sp, 24
.set at
.set macro
.set reorder
.end autohelperowl_defendpat421
$func_end0:
.size autohelperowl_defendpat421, ($func_end0)-autohelperowl_defendpat421
.ident "clang version 3.8.0 (http://llvm.org/git/clang.git 2d49f0a0ae8366964a93e3b7b26e29679bee7160) (http://llvm.org/git/llvm.git 60bc66b44837125843b58ed3e0fd2e6bb948d839)"
.section ".note.GNU-stack","",@progbits
.text
|
programs/oeis/182/A182415.asm | neoneye/loda | 22 | 9190 | ; A182415: a(0) = 1, a(1) = 2; for n>1, a(n) = a(n-1) + a(n-2) + 4.
; 1,2,7,13,24,41,69,114,187,305,496,805,1305,2114,3423,5541,8968,14513,23485,38002,61491,99497,160992,260493,421489,681986,1103479,1785469,2888952,4674425,7563381,12237810,19801195,32039009,51840208,83879221,135719433,219598658,355318095,574916757,930234856,1505151617,2435386477,3940538098,6375924579,10316462681,16692387264,27008849949,43701237217,70710087170,114411324391,185121411565,299532735960,484654147529,784186883493,1268841031026,2053027914523,3321868945553,5374896860080,8696765805637,14071662665721,22768428471362,36840091137087,59608519608453,96448610745544,156057130354001,252505741099549,408562871453554,661068612553107,1069631484006665,1730700096559776,2800331580566445,4531031677126225,7331363257692674,11862394934818903,19193758192511581,31056153127330488,50249911319842073,81306064447172565,131555975767014642,212862040214187211,344418015981201857,557280056195389072,901698072176590933,1458978128371980009,2360676200548570946,3819654328920550959,6180330529469121909,9999984858389672872,16180315387858794785,26180300246248467661,42360615634107262450,68540915880355730115,110901531514462992569,179442447394818722688,290343978909281715261,469786426304100437953,760130405213382153218,1229916831517482591175,1990047236730864744397
add $0,1
mov $1,1
mov $2,4
lpb $0
sub $0,1
mov $3,$2
mov $2,$1
add $1,$3
lpe
sub $1,4
mov $0,$1
|
3-mid/opengl/source/platform/egl/private/opengl-surface_profile-privvy.adb | charlie5/lace | 20 | 5789 | <reponame>charlie5/lace<filename>3-mid/opengl/source/platform/egl/private/opengl-surface_profile-privvy.adb
package body opengl.surface_Profile.privvy
is
function to_eGL (Self : in Item'Class) return egl.EGLConfig
is
begin
return Self.egl_Config;
end to_eGL;
end opengl.surface_Profile.privvy;
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/t13.adb | best08618/asylo | 7 | 6459 | <gh_stars>1-10
-- { dg-do run }
with Init13; use Init13;
with Ada.Numerics; use Ada.Numerics;
with Text_IO; use Text_IO;
with Dump;
procedure T13 is
Local_R1 : R1;
Local_R2 : R2;
begin
Local_R1.F := (My_R1.F.R + 1.0, My_R1.F.I + 1.0);
Put ("Local_R1 :");
Dump (Local_R1'Address, R1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R1 : ee 87 84 40 db 0f 09 c0.*\n" }
Local_R2.F := (My_R2.F.R + 1.0, My_R2.F.I + 1.0);
Put ("Local_R2 :");
Dump (Local_R2'Address, R2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R2 : 40 84 87 ee c0 09 0f db.*\n" }
Local_R1.F := (Pi, -Pi);
Put ("Local_R1 :");
Dump (Local_R1'Address, R1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R1 : db 0f 49 40 db 0f 49 c0.*\n" }
Local_R2.F := (Pi, -Pi);
Put ("Local_R2 :");
Dump (Local_R2'Address, R2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R2 : 40 49 0f db c0 49 0f db.*\n" }
Local_R1.F := (Local_R1.F.R + 1.0, Local_R1.F.I + 1.0);
Put ("Local_R1 :");
Dump (Local_R1'Address, R1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R1 : ee 87 84 40 db 0f 09 c0.*\n" }
Local_R2.F := (Local_R2.F.R + 1.0, Local_R2.F.I + 1.0);
Put ("Local_R2 :");
Dump (Local_R2'Address, R2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R2 : 40 84 87 ee c0 09 0f db.*\n" }
end;
|
programs/oeis/008/A008619.asm | neoneye/loda | 22 | 161077 | <filename>programs/oeis/008/A008619.asm
; A008619: Positive integers repeated.
; 1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13,14,14,15,15,16,16,17,17,18,18,19,19,20,20,21,21,22,22,23,23,24,24,25,25,26,26,27,27,28,28,29,29,30,30,31,31,32,32,33,33,34,34,35,35,36,36,37,37,38,38,39,39,40,40,41,41,42,42,43,43,44,44,45,45,46,46,47,47,48,48,49,49,50,50
div $0,2
add $0,1
|
mc-sema/validator/x86/tests/DIV_ST0Fr.asm | randolphwong/mcsema | 2 | 17865 | <gh_stars>1-10
BITS 32
;TEST_FILE_META_BEGIN
;TEST_TYPE=TEST_F
;TEST_IGNOREFLAGS=FLAG_FPU_PE|FLAG_FPU_C1
;TEST_FILE_META_END
; set up st0 to be 3.141593
FLD1
FLDPI
;TEST_BEGIN_RECORDING
FDIV st0, st1
mov edi, 0
;TEST_END_RECORDING
|
reports/16_dense_array.combine.asm | arnaudroger/re2j-benchmark | 0 | 14514 | <gh_stars>0
# JMH version: 1.19
# VM version: JDK 1.8.0_131, VM 25.131-b11
# VM invoker: /usr/lib/jvm/java-8-oracle/jre/bin/java
# VM options: <none>
# Warmup: 20 iterations, 1 s each
# Measurement: 20 iterations, 1 s each
# Timeout: 10 min per iteration
# Threads: 1 thread, will synchronize iterations
# Benchmark mode: Throughput, ops/time
# Benchmark: com.github.arnaudroger.re2j.Re2jFindRegex.testCombine
# Run progress: 0.00% complete, ETA 00:00:40
# Fork: 1 of 1
# Preparing profilers: LinuxPerfAsmProfiler
# Profilers consume stdout and stderr from target VM, use -v EXTRA to copy to console
# Warmup Iteration 1: 3421.612 ops/s
# Warmup Iteration 2: 9214.636 ops/s
# Warmup Iteration 3: 9266.575 ops/s
# Warmup Iteration 4: 9266.686 ops/s
# Warmup Iteration 5: 9266.488 ops/s
# Warmup Iteration 6: 9265.533 ops/s
# Warmup Iteration 7: 9262.777 ops/s
# Warmup Iteration 8: 9187.816 ops/s
# Warmup Iteration 9: 9233.015 ops/s
# Warmup Iteration 10: 9313.870 ops/s
# Warmup Iteration 11: 9318.363 ops/s
# Warmup Iteration 12: 9008.314 ops/s
# Warmup Iteration 13: 9315.568 ops/s
# Warmup Iteration 14: 9296.202 ops/s
# Warmup Iteration 15: 9295.572 ops/s
# Warmup Iteration 16: 9296.214 ops/s
# Warmup Iteration 17: 9327.534 ops/s
# Warmup Iteration 18: 8761.738 ops/s
# Warmup Iteration 19: 7456.400 ops/s
# Warmup Iteration 20: 9299.653 ops/s
Iteration 1: 9299.630 ops/s
Iteration 2: 9298.574 ops/s
Iteration 3: 9302.378 ops/s
Iteration 4: 9304.161 ops/s
Iteration 5: 9301.039 ops/s
Iteration 6: 9302.907 ops/s
Iteration 7: 9301.188 ops/s
Iteration 8: 9301.096 ops/s
Iteration 9: 9266.368 ops/s
Iteration 10: 9278.805 ops/s
Iteration 11: 8253.764 ops/s
Iteration 12: 9283.972 ops/s
Iteration 13: 9282.390 ops/s
Iteration 14: 9283.751 ops/s
Iteration 15: 9283.293 ops/s
Iteration 16: 9285.805 ops/s
Iteration 17: 9276.439 ops/s
Iteration 18: 9279.542 ops/s
Iteration 19: 9282.784 ops/s
Iteration 20: 9315.554 ops/s
# Processing profiler results: LinuxPerfAsmProfiler
Result "com.github.arnaudroger.re2j.Re2jFindRegex.testCombine":
9239.172 ±(99.9%) 201.694 ops/s [Average]
(min, avg, max) = (8253.764, 9239.172, 9315.554), stdev = 232.271
CI (99.9%): [9037.478, 9440.866] (assumes normal distribution)
Secondary result "com.github.arnaudroger.re2j.Re2jFindRegex.testCombine:·asm":
PrintAssembly processed: 196559 total address lines.
Perf output processed (skipped 23.349 seconds):
Column 1: cycles (20617 events)
Column 2: instructions (20617 events)
Hottest code regions (>10.00% "cycles" events):
....[Hottest Region 1]..............................................................................
C2, level 4, com.google.re2j.Machine::match, version 541 (1534 bytes)
0x00007fc83d244fcb: cmp $0x1,%r8d
0x00007fc83d244fcf: je 0x00007fc83d246651 ;*if_icmpeq
; - com.google.re2j.Machine::match@19 (line 186)
0x00007fc83d244fd5: cmp $0x2,%r8d
0x00007fc83d244fd9: je 0x00007fc83d246679 ;*if_icmpne
; - com.google.re2j.Machine::match@24 (line 186)
0x00007fc83d244fdf: mov %r12b,0x10(%r10) ;*putfield matched
; - com.google.re2j.Machine::match@35 (line 190)
0x00007fc83d244fe3: mov 0x28(%r10),%r14d ;*getfield matchcap
; - com.google.re2j.Machine::match@39 (line 191)
0.01% 0x00007fc83d244fe7: mov 0xc(%r12,%r14,8),%ebp ;*arraylength
; - java.util.Arrays::fill@3 (line 2881)
; - com.google.re2j.Machine::match@43 (line 191)
; implicit exception: dispatches to 0x00007fc83d246ed1
0x00007fc83d244fec: test %ebp,%ebp
0x00007fc83d244fee: jg 0x00007fc83d2466a1 ;*if_icmpge
; - java.util.Arrays::fill@7 (line 2881)
; - com.google.re2j.Machine::match@43 (line 191)
0x00007fc83d244ff4: mov 0x8(%rdx),%r8d ; implicit exception: dispatches to 0x00007fc83d246ee1
0x00007fc83d244ff8: mov 0x20(%r10),%ecx ;*getfield q1
; - com.google.re2j.Machine::match@53 (line 192)
0.00% 0x00007fc83d244ffc: mov 0x1c(%r10),%edi ;*getfield q0
; - com.google.re2j.Machine::match@47 (line 192)
0x00007fc83d245000: cmp $0xf8019b8e,%r8d ; {metadata('com/google/re2j/MachineInput$UTF16Input')}
0x00007fc83d245007: jne 0x00007fc83d246381
0x00007fc83d24500d: mov %rdx,%rbx ;*invokevirtual step
; - com.google.re2j.Machine::match@60 (line 193)
0.00% 0x00007fc83d245010: mov 0xc(%rbx),%edx ;*getfield start
; - com.google.re2j.MachineInput$UTF16Input::step@2 (line 185)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d245013: mov 0x10(%rbx),%eax ;*getfield end
; - com.google.re2j.MachineInput$UTF16Input::step@9 (line 186)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d245016: vmovd %xmm0,%r8d
0x00007fc83d24501b: add %edx,%r8d ;*iadd
; - com.google.re2j.MachineInput$UTF16Input::step@5 (line 185)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d24501e: cmp %eax,%r8d
0x00007fc83d245021: jge 0x00007fc83d2461a5 ;*if_icmpge
; - com.google.re2j.MachineInput$UTF16Input::step@12 (line 186)
; - com.google.re2j.Machine::match@60 (line 193)
0.01% 0x00007fc83d245027: mov 0x14(%rbx),%r13d ;*getfield str
; - com.google.re2j.MachineInput$UTF16Input::step@16 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d24502b: mov 0x8(%r12,%r13,8),%ebp ; implicit exception: dispatches to 0x00007fc83d246ef5
0x00007fc83d245030: cmp $0xf80002da,%ebp ; {metadata('java/lang/String')}
0x00007fc83d245036: jne 0x00007fc83d2463b1
0.00% 0x00007fc83d24503c: lea (%r12,%r13,8),%rbp ;*invokeinterface charAt
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
0.00% 0x00007fc83d245040: test %r8d,%r8d
0x00007fc83d245043: jl 0x00007fc83d24654d ;*iflt
; - java.lang.String::charAt@1 (line 657)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d245049: mov %eax,0x64(%rsp)
0x00007fc83d24504d: mov %edx,0x60(%rsp)
0.00% 0x00007fc83d245051: mov 0xc(%rbp),%edx ;*getfield value
; - java.lang.String::charAt@6 (line 657)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
0.00% 0x00007fc83d245054: mov 0xc(%r12,%rdx,8),%eax ;*arraylength
; - java.lang.String::charAt@9 (line 657)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
; implicit exception: dispatches to 0x00007fc83d246f09
0x00007fc83d245059: cmp %eax,%r8d
0x00007fc83d24505c: jge 0x00007fc83d2466cd ;*if_icmplt
; - java.lang.String::charAt@10 (line 657)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d245062: cmp %eax,%r8d
0x00007fc83d245065: jae 0x00007fc83d246209
0x00007fc83d24506b: mov %eax,0x1c(%rsp)
0.00% 0x00007fc83d24506f: vmovd %edx,%xmm1
0x00007fc83d245073: mov %rbp,%rax
0x00007fc83d245076: mov %rbx,0x48(%rsp)
0x00007fc83d24507b: mov %edi,0x34(%rsp)
0.00% 0.01% 0x00007fc83d24507f: mov %ecx,%edx
0x00007fc83d245081: mov %r9d,0x40(%rsp)
0x00007fc83d245086: mov %r11d,0x3c(%rsp)
0x00007fc83d24508b: mov %r10,%rbx
0.00% 0x00007fc83d24508e: vmovd %xmm1,%r10d
0x00007fc83d245093: lea (%r12,%r10,8),%r9
0x00007fc83d245097: movzwl 0x10(%r9,%r8,2),%r10d ;*caload
; - java.lang.String::charAt@27 (line 660)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
0.00% 0x00007fc83d24509d: cmp $0xd800,%r10d
0x00007fc83d2450a4: jge 0x00007fc83d24670d ;*if_icmplt
; - java.lang.Character::isHighSurrogate@3 (line 4729)
; - java.lang.Character::codePointAt@9 (line 4867)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@60 (line 193)
0.00% 0.01% 0x00007fc83d2450aa: shl $0x3,%r10d ;*ishl
; - com.google.re2j.MachineInput$UTF16Input::step@38 (line 190)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d2450ae: mov %r10d,%r11d
0x00007fc83d2450b1: and $0x7,%r11d
0x00007fc83d2450b5: or $0x1,%r10d
0.01% 0.01% 0x00007fc83d2450b9: mov %r10d,%ebp
0x00007fc83d2450bc: or $0x1,%r11d ;*ior ; - com.google.re2j.MachineInput$UTF16Input::step@41 (line 190)
; - com.google.re2j.Machine::match@60 (line 193)
0x00007fc83d2450c0: mov %r11d,0x28(%rsp)
0.00% 0x00007fc83d2450c5: mov %r10d,%r8d
0.00% 0.01% 0x00007fc83d2450c8: sar $0x3,%r8d ;*ishr
; - com.google.re2j.Machine::match@68 (line 194)
0x00007fc83d2450cc: cmp $0xfffffff8,%r10d
0x00007fc83d2450d0: je 0x00007fc83d2461b4 ;*if_icmpeq
; - com.google.re2j.Machine::match@88 (line 198)
0x00007fc83d2450d6: vmovd %xmm0,%r10d
0x00007fc83d2450db: add %r11d,%r10d
0.00% 0.00% 0x00007fc83d2450de: add 0x60(%rsp),%r10d ;*iadd
; - com.google.re2j.MachineInput$UTF16Input::step@5 (line 185)
; - com.google.re2j.Machine::match@96 (line 199)
0x00007fc83d2450e3: mov %r10d,%edi
0x00007fc83d2450e6: cmp 0x64(%rsp),%r10d
0x00007fc83d2450eb: jge 0x00007fc83d245a63 ;*if_icmpge
; - com.google.re2j.MachineInput$UTF16Input::step@12 (line 186)
; - com.google.re2j.Machine::match@96 (line 199)
0x00007fc83d2450f1: test %r10d,%r10d
0x00007fc83d2450f4: jl 0x00007fc83d2465d1 ;*iflt
; - java.lang.String::charAt@1 (line 657)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@96 (line 199)
0.01% 0x00007fc83d2450fa: cmp 0x1c(%rsp),%r10d
0x00007fc83d2450ff: jge 0x00007fc83d246761 ;*if_icmplt
; - java.lang.String::charAt@10 (line 657)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@96 (line 199)
0x00007fc83d245105: cmp 0x1c(%rsp),%r10d
0x00007fc83d24510a: jae 0x00007fc83d246249
0.00% 0x00007fc83d245110: movzwl 0x10(%r9,%r10,2),%r9d ;*caload
; - java.lang.String::charAt@27 (line 660)
; - java.lang.Character::codePointAt@2 (line 4866)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@96 (line 199)
0x00007fc83d245116: cmp $0xd800,%r9d
0x00007fc83d24511d: jge 0x00007fc83d2467b9 ;*if_icmplt
; - java.lang.Character::isHighSurrogate@3 (line 4729)
; - java.lang.Character::codePointAt@9 (line 4867)
; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
; - com.google.re2j.Machine::match@96 (line 199)
0.01% 0.00% 0x00007fc83d245123: shl $0x3,%r9d ;*ishl
; - com.google.re2j.MachineInput$UTF16Input::step@38 (line 190)
; - com.google.re2j.Machine::match@96 (line 199)
0x00007fc83d245127: mov %r9d,%r10d
0x00007fc83d24512a: or $0x1,%r10d
0x00007fc83d24512e: and $0x7,%r9d
0.00% 0x00007fc83d245132: sar $0x3,%r10d
0.00% 0x00007fc83d245136: or $0x1,%r9d ;*ishr
; - com.google.re2j.Machine::match@104 (line 200)
0x00007fc83d24513a: vmovd %xmm0,%ecx
0x00007fc83d24513e: test %ecx,%ecx
0x00007fc83d245140: jne 0x00007fc83d246589 ;*ifne
; - com.google.re2j.Machine::match@115 (line 204)
0.01% 0x00007fc83d245146: test %r8d,%r8d
0x00007fc83d245149: jl 0x00007fc83d245a4b ;*ifge
; - com.google.re2j.Utils::emptyOpContext@21 (line 179)
; - com.google.re2j.Machine::match@121 (line 205)
0x00007fc83d24514f: mov %r10d,0x2c(%rsp)
0x00007fc83d245154: mov %r9d,0x30(%rsp)
0x00007fc83d245159: mov $0x5,%r9d ;*iload_1
; - com.google.re2j.Utils::emptyOpContext@29 (line 182)
; - com.google.re2j.Machine::match@121 (line 205)
0.01% 0.00% 0x00007fc83d24515f: cmp $0xa,%r8d
0x00007fc83d245163: je 0x00007fc83d245a71 ;*iload_0
; - com.google.re2j.Utils::emptyOpContext@39 (line 185)
; - com.google.re2j.Machine::match@121 (line 205)
0x00007fc83d245169: mov %r8d,%r10d
0x00007fc83d24516c: add $0xffffffbf,%r10d
0x00007fc83d245170: cmp $0x1a,%r10d
╭ 0x00007fc83d245174: jb 0x00007fc83d245187 ;*if_icmple
│ ; - com.google.re2j.Utils::isWordRune@9 (line 149)
│ ; - com.google.re2j.Utils::emptyOpContext@44 (line 185)
│ ; - com.google.re2j.Machine::match@121 (line 205)
0.00% │ 0x00007fc83d245176: mov %r8d,%r11d
│ 0x00007fc83d245179: add $0xffffff9f,%r11d
│ 0x00007fc83d24517d: cmp $0x1a,%r11d
│ 0x00007fc83d245181: jae 0x00007fc83d245a80 ;*iconst_1
│ ; - com.google.re2j.Utils::isWordRune@42 (line 149)
│ ; - com.google.re2j.Utils::emptyOpContext@44 (line 185)
│ ; - com.google.re2j.Machine::match@121 (line 205)
0.00% 0.01% ↘ 0x00007fc83d245187: or $0x10,%r9d ;*ior ; - com.google.re2j.Utils::emptyOpContext@53 (line 186)
; - com.google.re2j.Machine::match@121 (line 205)
0.00% 0x00007fc83d24518b: mov %r9d,0x38(%rsp) ;*iload_2
; - com.google.re2j.Utils::emptyOpContext@63 (line 190)
; - com.google.re2j.Machine::match@121 (line 205)
0x00007fc83d245190: mov 0x3c(%rsp),%r10d
0x00007fc83d245195: test %r10d,%r10d
0x00007fc83d245198: jne 0x00007fc83d2463f1 ;*aload
; - com.google.re2j.Machine::match@136 (line 211)
0.00% 0x00007fc83d24519e: movzbl 0x11(%rbx),%r10d ;*getfield captures
; - com.google.re2j.Machine::match@283 (line 240)
0.00% 0x00007fc83d2451a3: mov 0x40(%rsp),%r9d
0.00% 0x00007fc83d2451a8: and $0x4,%r9d ;*iand
; - com.google.re2j.Machine::match@147 (line 212)
0x00007fc83d2451ac: mov %r9d,0x44(%rsp)
0.00% 0x00007fc83d2451b1: mov %rdx,%r11
0.00% 0x00007fc83d2451b4: shl $0x3,%r11 ;*getfield q1
; - com.google.re2j.Machine::match@53 (line 192)
0x00007fc83d2451b8: mov %r11,0x20(%rsp)
0x00007fc83d2451bd: vmovd %r10d,%xmm4
0.01% 0x00007fc83d2451c2: xor %eax,%eax
0.00% 0.00% 0x00007fc83d2451c4: mov $0x1,%r10d
0x00007fc83d2451ca: xor %r11d,%r11d
0.00% 0x00007fc83d2451cd: mov %r10d,0x14(%rsp)
0x00007fc83d2451d2: mov %r11d,0x5c(%rsp)
0.00% ╭ 0x00007fc83d2451d7: jmpq 0x00007fc83d245423 ;*ifeq
│ ; - com.google.re2j.Machine::match@286 (line 240)
0.01% │ ↗ 0x00007fc83d2451dc: mov %r14,%r8
0.07% 0.00% │ │ 0x00007fc83d2451df: shl $0x3,%r8 ;*getfield matchcap
│ │ ; - com.google.re2j.Machine::match@307 (line 243)
0.25% 0.03% │ │ 0x00007fc83d2451e3: mov %r10,%rsi
0.01% │ │ 0x00007fc83d2451e6: mov 0x18(%rsp),%rdx
0.03% 0.01% │ │ 0x00007fc83d2451eb: mov 0x5c(%rsp),%ecx
0.06% 0.03% │ │ 0x00007fc83d2451ef: mov 0x38(%rsp),%r9d
0.27% 0.06% │ │ 0x00007fc83d2451f4: xor %edi,%edi
0.01% │ │ 0x00007fc83d2451f6: mov 0x50(%rsp),%r10
0.02% │ │ 0x00007fc83d2451fb: mov %r10,(%rsp)
0.08% 0.01% │ │ 0x00007fc83d2451ff: vmovss %xmm4,0x8(%rsp)
0.19% 0.12% │ │ 0x00007fc83d245205: xchg %ax,%ax
0.01% │ │ 0x00007fc83d245207: callq 0x00007fc83d046020 ; OopMap{[24]=Oop [32]=Oop [52]=NarrowOop [72]=Oop [80]=Oop off=652}
│ │ ;*invokevirtual add
│ │ ; - com.google.re2j.Machine::match@318 (line 243)
│ │ ; {optimized virtual_call}
0.21% 0.24% │ │↗ 0x00007fc83d24520c: mov 0x58(%rsp),%ebx
0.08% 0.09% │ ││ 0x00007fc83d245210: test %ebx,%ebx
│╭ ││ 0x00007fc83d245212: jl 0x00007fc83d245583 ;*ifge
││ ││ ; - com.google.re2j.Utils::emptyOpContext@3 (line 173)
││ ││ ; - com.google.re2j.Machine::match@326 (line 245)
0.17% 0.21% ││ ││ 0x00007fc83d245218: xor %r10d,%r10d ;*iload_0
││ ││ ; - com.google.re2j.Utils::emptyOpContext@10 (line 176)
││ ││ ; - com.google.re2j.Machine::match@326 (line 245)
0.27% 0.32% ││ ││↗ 0x00007fc83d24521b: cmp $0xa,%ebx
││ │││ 0x00007fc83d24521e: je 0x00007fc83d245727 ;*iload_1
││ │││ ; - com.google.re2j.Utils::emptyOpContext@20 (line 179)
││ │││ ; - com.google.re2j.Machine::match@326 (line 245)
0.12% 0.12% ││ │││ 0x00007fc83d245224: mov 0x2c(%rsp),%r11d
0.03% 0.05% ││ │││ 0x00007fc83d245229: test %r11d,%r11d
││╭ │││ 0x00007fc83d24522c: jl 0x00007fc83d24558e ;*iload_1
│││ │││ ; - com.google.re2j.Utils::emptyOpContext@29 (line 182)
│││ │││ ; - com.google.re2j.Machine::match@326 (line 245)
0.17% 0.16% │││ │││↗ 0x00007fc83d245232: cmp $0xa,%r11d
│││ ││││ 0x00007fc83d245236: je 0x00007fc83d245730 ;*iload_0
│││ ││││ ; - com.google.re2j.Utils::emptyOpContext@39 (line 185)
│││ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.29% 0.26% │││ ││││ 0x00007fc83d24523c: mov 0x58(%rsp),%r8d
0.13% 0.16% │││ ││││ 0x00007fc83d245241: add $0xffffffbf,%r8d
0.05% 0.04% │││ ││││ 0x00007fc83d245245: cmp $0x1a,%r8d
│││╭ ││││ 0x00007fc83d245249: jb 0x00007fc83d24525e ;*if_icmple
││││ ││││ ; - com.google.re2j.Utils::isWordRune@9 (line 149)
││││ ││││ ; - com.google.re2j.Utils::emptyOpContext@40 (line 185)
││││ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.19% 0.15% ││││ ││││ 0x00007fc83d24524b: mov 0x58(%rsp),%r9d
0.22% 0.39% ││││ ││││ 0x00007fc83d245250: add $0xffffff9f,%r9d
0.11% 0.14% ││││ ││││ 0x00007fc83d245254: cmp $0x1a,%r9d
││││ ││││ 0x00007fc83d245258: jae 0x00007fc83d2459da ;*iconst_1
││││ ││││ ; - com.google.re2j.Utils::isWordRune@42 (line 149)
││││ ││││ ; - com.google.re2j.Utils::emptyOpContext@40 (line 185)
││││ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.10% 0.05% │││↘ ││││ 0x00007fc83d24525e: mov $0x1,%ebp ;*ireturn
│││ ││││ ; - com.google.re2j.Utils::isWordRune@47 (line 149)
│││ ││││ ; - com.google.re2j.Utils::emptyOpContext@40 (line 185)
│││ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.20% 0.21% │││ ││││ 0x00007fc83d245263: mov 0x2c(%rsp),%r8d
0.30% 0.32% │││ ││││ 0x00007fc83d245268: add $0xffffffbf,%r8d
0.09% 0.13% │││ ││││ 0x00007fc83d24526c: cmp $0x1a,%r8d
│││ ╭ ││││ 0x00007fc83d245270: jb 0x00007fc83d245285 ;*if_icmple
│││ │ ││││ ; - com.google.re2j.Utils::isWordRune@9 (line 149)
│││ │ ││││ ; - com.google.re2j.Utils::emptyOpContext@44 (line 185)
│││ │ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.09% 0.06% │││ │ ││││ 0x00007fc83d245272: mov 0x2c(%rsp),%r9d
0.19% 0.16% │││ │ ││││ 0x00007fc83d245277: add $0xffffff9f,%r9d
0.25% 0.26% │││ │ ││││ 0x00007fc83d24527b: cmp $0x1a,%r9d
│││ │ ││││ 0x00007fc83d24527f: jae 0x00007fc83d2459fd ;*iconst_1
│││ │ ││││ ; - com.google.re2j.Utils::isWordRune@42 (line 149)
│││ │ ││││ ; - com.google.re2j.Utils::emptyOpContext@44 (line 185)
│││ │ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.18% 0.19% │││ ↘ ││││ 0x00007fc83d245285: mov $0x1,%r8d ;*ireturn
│││ ││││ ; - com.google.re2j.Utils::isWordRune@47 (line 149)
│││ ││││ ; - com.google.re2j.Utils::emptyOpContext@44 (line 185)
│││ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.14% 0.18% │││ ││││ 0x00007fc83d24528b: cmp %r8d,%ebp
│││ ╭ ││││ 0x00007fc83d24528e: je 0x00007fc83d24529b ;*if_icmpeq
│││ │ ││││ ; - com.google.re2j.Utils::emptyOpContext@47 (line 185)
│││ │ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.13% 0.16% │││ │ ││││ 0x00007fc83d245290: or $0x10,%r10d ;*ior ; - com.google.re2j.Utils::emptyOpContext@53 (line 186)
│││ │ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.02% 0.01% │││ │ ││││ 0x00007fc83d245294: mov %r10d,0x38(%rsp)
0.13% 0.16% │││ │╭ ││││ 0x00007fc83d245299: jmp 0x00007fc83d2452a4
0.16% 0.24% │││ ↘│ ││││ 0x00007fc83d24529b: or $0x20,%r10d ;*ior ; - com.google.re2j.Utils::emptyOpContext@61 (line 188)
│││ │ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.20% 0.27% │││ │ ││││ 0x00007fc83d24529f: mov %r10d,0x38(%rsp) ;*iload_2
│││ │ ││││ ; - com.google.re2j.Utils::emptyOpContext@63 (line 190)
│││ │ ││││ ; - com.google.re2j.Machine::match@326 (line 245)
0.19% 0.23% │││ ↘ ││││ 0x00007fc83d2452a4: mov 0x48(%rsp),%r8
0.08% 0.13% │││ ││││ 0x00007fc83d2452a9: mov 0x10(%r8),%r10d ;*getfield end
│││ ││││ ; - com.google.re2j.MachineInput$UTF16Input::endPos@1 (line 221)
│││ ││││ ; - com.google.re2j.Machine::match@348 (line 246)
0.50% 0.31% │││ ││││ 0x00007fc83d2452ad: mov 0x5c(%rsp),%ecx
0.16% 0.22% │││ ││││ 0x00007fc83d2452b1: cmp %r10d,%ecx
│││ ╭ ││││ 0x00007fc83d2452b4: je 0x00007fc83d245597 ;*if_icmpne
│││ │ ││││ ; - com.google.re2j.Machine::match@351 (line 246)
0.38% 0.32% │││ │ ││││ 0x00007fc83d2452ba: xor %r10d,%r10d ;*invokespecial step
│││ │ ││││ ; - com.google.re2j.Machine::match@359 (line 246)
0.05% 0.06% │││ │ ││││↗ 0x00007fc83d2452bd: mov %rax,-0x8(%rsp)
0.10% 0.15% │││ │ │││││ 0x00007fc83d2452c2: mov 0x5c(%rsp),%eax
0.11% 0.17% │││ │ │││││ 0x00007fc83d2452c6: mov %eax,0x58(%rsp)
0.28% 0.18% │││ │ │││││ 0x00007fc83d2452ca: mov -0x8(%rsp),%rax ;*invokevirtual endPos
│││ │ │││││ ; - com.google.re2j.Machine::match@348 (line 246)
0.42% 0.15% │││ │ │││││ 0x00007fc83d2452cf: add 0x28(%rsp),%ecx ;*iadd
│││ │ │││││ ; - com.google.re2j.Machine::match@340 (line 246)
0.16% 0.10% │││ │ │││││ 0x00007fc83d2452d3: mov %ecx,0x5c(%rsp)
0.18% 0.18% │││ │ │││││ 0x00007fc83d2452d7: mov 0x50(%rsp),%rsi
0.19% 0.21% │││ │ │││││ 0x00007fc83d2452dc: mov 0x18(%rsp),%rdx
0.14% 0.06% │││ │ │││││ 0x00007fc83d2452e1: mov 0x20(%rsp),%rcx
0.10% 0.11% │││ │ │││││ 0x00007fc83d2452e6: mov 0x58(%rsp),%r8d
0.20% 0.18% │││ │ │││││ 0x00007fc83d2452eb: mov 0x5c(%rsp),%r9d
0.46% 0.34% │││ │ │││││ 0x00007fc83d2452f0: mov %ebx,%edi
0.05% 0.03% │││ │ │││││ 0x00007fc83d2452f2: mov 0x38(%rsp),%ebx
0.09% 0.19% │││ │ │││││ 0x00007fc83d2452f6: mov %ebx,(%rsp)
0.14% 0.20% │││ │ │││││ 0x00007fc83d2452f9: xor %ebx,%ebx
0.20% 0.21% │││ │ │││││ 0x00007fc83d2452fb: mov %ebx,0x8(%rsp)
0.07% 0.08% │││ │ │││││ 0x00007fc83d2452ff: mov %r10d,0x10(%rsp)
0.08% 0.09% │││ │ │││││ 0x00007fc83d245304: data16 xchg %ax,%ax
0.16% 0.17% │││ │ │││││ 0x00007fc83d245307: callq 0x00007fc83d046020 ; OopMap{[24]=Oop [32]=Oop [52]=NarrowOop [72]=Oop [80]=Oop off=908}
│││ │ │││││ ;*invokespecial step
│││ │ │││││ ; - com.google.re2j.Machine::match@359 (line 246)
│││ │ │││││ ; {optimized virtual_call}
0.05% 0.08% │││ │ │││││ 0x00007fc83d24530c: mov 0x50(%rsp),%r10
0.55% 0.80% │││ │ │││││ 0x00007fc83d245311: movzbl 0x11(%r10),%ecx ;*getfield captures
│││ │ │││││ ; - com.google.re2j.Machine::match@371 (line 250)
0.05% 0.01% │││ │ │││││ 0x00007fc83d245316: movzbl 0x10(%r10),%eax ;*getfield matched
│││ │ │││││ ; - com.google.re2j.Machine::match@378 (line 250)
0.03% 0.03% │││ │ │││││ 0x00007fc83d24531b: mov 0x28(%rsp),%r8d
0.52% 0.61% │││ │ │││││ 0x00007fc83d245320: test %r8d,%r8d
│││ │╭ │││││ 0x00007fc83d245323: je 0x00007fc83d2455b1 ;*ifne
│││ ││ │││││ ; - com.google.re2j.Machine::match@364 (line 247)
│││ ││ │││││ 0x00007fc83d245329: test %ecx,%ecx
│││ ││ │││││ 0x00007fc83d24532b: jne 0x00007fc83d245c05 ;*ifne
│││ ││ │││││ ; - com.google.re2j.Machine::match@374 (line 250)
0.00% 0.02% │││ ││ │││││ 0x00007fc83d245331: test %eax,%eax
│││ ││ │││││ 0x00007fc83d245333: jne 0x00007fc83d245e3d ;*ifeq
│││ ││ │││││ ; - com.google.re2j.Machine::match@381 (line 250)
0.06% 0.05% │││ ││ │││││ 0x00007fc83d245339: mov %r10,%rbx
0.61% 0.65% │││ ││ │││││ 0x00007fc83d24533c: mov 0x48(%rsp),%r10
0.00% │││ ││ │││││ 0x00007fc83d245341: mov 0x10(%r10),%r11d ;*getfield end
│││ ││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@9 (line 186)
│││ ││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.01% 0.04% │││ ││ │││││ 0x00007fc83d245345: mov 0xc(%r10),%r9d ;*getfield start
│││ ││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@2 (line 185)
│││ ││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.01% 0.04% │││ ││ │││││ 0x00007fc83d245349: mov 0x14(%r10),%r13d ;*getfield str
│││ ││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@16 (line 187)
│││ ││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.62% 0.81% │││ ││ │││││ 0x00007fc83d24534d: mov 0x2c(%rsp),%r8d
│││ ││ │││││ 0x00007fc83d245352: cmp $0xffffffff,%r8d
│││ ││╭ │││││ 0x00007fc83d245356: je 0x00007fc83d2455a2 ;*if_icmpeq
│││ │││ │││││ ; - com.google.re2j.Machine::match@403 (line 258)
0.00% │││ │││ │││││ 0x00007fc83d24535c: mov 0x30(%rsp),%r8d
0.03% 0.08% │││ │││ │││││ 0x00007fc83d245361: add 0x5c(%rsp),%r8d
0.53% 0.76% │││ │││ │││││ 0x00007fc83d245366: add %r9d,%r8d ;*iadd
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@5 (line 185)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
│││ │││ │││││ 0x00007fc83d245369: cmp %r11d,%r8d
│││ │││ │││││ 0x00007fc83d24536c: jge 0x00007fc83d24571a ;*if_icmpge
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@12 (line 186)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.04% │││ │││ │││││ 0x00007fc83d245372: mov 0x8(%r12,%r13,8),%r10d ; implicit exception: dispatches to 0x00007fc83d246e59
0.67% 0.71% │││ │││ │││││ 0x00007fc83d245377: cmp $0xf80002da,%r10d ; {metadata('java/lang/String')}
│││ │││ │││││ 0x00007fc83d24537e: jne 0x00007fc83d245b49
0.54% 0.68% │││ │││ │││││ 0x00007fc83d245384: lea (%r12,%r13,8),%rdx ;*invokeinterface charAt
│││ │││ │││││ ; - java.lang.Character::codePointAt@2 (line 4866)
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
│││ │││ │││││ 0x00007fc83d245388: test %r8d,%r8d
│││ │││ │││││ 0x00007fc83d24538b: jl 0x00007fc83d245c59 ;*iflt
│││ │││ │││││ ; - java.lang.String::charAt@1 (line 657)
│││ │││ │││││ ; - java.lang.Character::codePointAt@2 (line 4866)
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.03% 0.02% │││ │││ │││││ 0x00007fc83d245391: mov 0xc(%rdx),%r10d ;*getfield value
│││ │││ │││││ ; - java.lang.String::charAt@6 (line 657)
│││ │││ │││││ ; - java.lang.Character::codePointAt@2 (line 4866)
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.07% 0.07% │││ │││ │││││ 0x00007fc83d245395: mov 0xc(%r12,%r10,8),%ebp ;*arraylength
│││ │││ │││││ ; - java.lang.String::charAt@9 (line 657)
│││ │││ │││││ ; - java.lang.Character::codePointAt@2 (line 4866)
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
│││ │││ │││││ ; implicit exception: dispatches to 0x00007fc83d246e6d
2.31% 2.68% │││ │││ │││││ 0x00007fc83d24539a: cmp %ebp,%r8d
│││ │││ │││││ 0x00007fc83d24539d: jge 0x00007fc83d245e91 ;*if_icmplt
│││ │││ │││││ ; - java.lang.String::charAt@10 (line 657)
│││ │││ │││││ ; - java.lang.Character::codePointAt@2 (line 4866)
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.55% 0.72% │││ │││ │││││ 0x00007fc83d2453a3: cmp %ebp,%r8d
│││ │││ │││││ 0x00007fc83d2453a6: jae 0x00007fc83d245ad7
0.21% 0.25% │││ │││ │││││ 0x00007fc83d2453ac: shl $0x3,%r10
0.01% │││ │││ │││││ 0x00007fc83d2453b0: movzwl 0x10(%r10,%r8,2),%edi ;*caload
│││ │││ │││││ ; - java.lang.String::charAt@27 (line 660)
│││ │││ │││││ ; - java.lang.Character::codePointAt@2 (line 4866)
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.26% 0.32% │││ │││ │││││ 0x00007fc83d2453b6: cmp $0xd800,%edi
│││ │││ │││││ 0x00007fc83d2453bc: jge 0x00007fc83d245ef1 ;*if_icmplt
│││ │││ │││││ ; - java.lang.Character::isHighSurrogate@3 (line 4729)
│││ │││ │││││ ; - java.lang.Character::codePointAt@9 (line 4867)
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@20 (line 187)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.40% 0.67% │││ │││ │││││ 0x00007fc83d2453c2: shl $0x3,%edi ;*ishl
│││ │││ │││││ ; - com.google.re2j.MachineInput$UTF16Input::step@38 (line 190)
│││ │││ │││││ ; - com.google.re2j.Machine::match@411 (line 259)
0.30% 0.37% │││ │││ │││││ 0x00007fc83d2453c5: mov %edi,%r10d
0.00% 0.00% │││ │││ │││││ 0x00007fc83d2453c8: or $0x1,%r10d
0.51% 0.65% │││ │││ │││││ 0x00007fc83d2453cc: and $0x7,%edi
0.01% 0.02% │││ │││ │││││ 0x00007fc83d2453cf: sar $0x3,%r10d ;*ishr
│││ │││ │││││ ; - com.google.re2j.Machine::match@419 (line 260)
0.56% 0.72% │││ │││ │││││ 0x00007fc83d2453d3: or $0x1,%edi ; OopMap{rbx=Oop r13=NarrowOop [24]=Oop [32]=Oop [72]=Oop off=1110}
│││ │││ │││││ ;*goto
│││ │││ │││││ ; - com.google.re2j.Machine::match@441 (line 266)
0.01% 0.00% │││ │││ │││││↗ 0x00007fc83d2453d6: test %eax,0x18549c24(%rip) # 0x00007fc85578f000
│││ │││ ││││││ ;*goto
│││ │││ ││││││ ; - com.google.re2j.Machine::match@441 (line 266)
│││ │││ ││││││ ; {poll}
0.04% 0.04% │││ │││ ││││││ 0x00007fc83d2453dc: mov 0x28(%rbx),%r14d ;*getfield matchcap
│││ │││ ││││││ ; - com.google.re2j.Machine::match@307 (line 243)
0.01% 0.02% │││ │││ ││││││ 0x00007fc83d2453e0: mov 0x14(%rbx),%esi ;*getfield re2
│││ │││ ││││││ ; - com.google.re2j.Machine::match@169 (line 220)
0.57% 0.74% │││ │││ ││││││ 0x00007fc83d2453e3: mov 0x20(%rsp),%r8
│││ │││ ││││││ 0x00007fc83d2453e8: mov %r8,%rdx
0.02% 0.01% │││ │││ ││││││ 0x00007fc83d2453eb: shr $0x3,%rdx
0.01% 0.01% │││ │││ ││││││ 0x00007fc83d2453ef: mov %edx,0x34(%rsp)
0.67% 0.65% │││ │││ ││││││ 0x00007fc83d2453f3: mov 0x2c(%rsp),%r8d
0.00% │││ │││ ││││││ 0x00007fc83d2453f8: mov %r10d,0x2c(%rsp)
0.01% 0.03% │││ │││ ││││││ 0x00007fc83d2453fd: mov 0x18(%rsp),%r10
0.01% 0.01% │││ │││ ││││││ 0x00007fc83d245402: mov %r10,0x20(%rsp)
0.50% 0.72% │││ │││ ││││││ 0x00007fc83d245407: vmovd %ecx,%xmm4
0.00% │││ │││ ││││││ 0x00007fc83d24540b: mov 0x30(%rsp),%r10d
0.02% 0.02% │││ │││ ││││││ 0x00007fc83d245410: mov %r10d,0x28(%rsp)
0.01% 0.01% │││ │││ ││││││ 0x00007fc83d245415: mov %edi,0x30(%rsp)
0.55% 0.80% │││ │││ ││││││ 0x00007fc83d245419: mov %r9d,0x60(%rsp)
│││ │││ ││││││ 0x00007fc83d24541e: mov %r11d,0x64(%rsp)
0.02% 0.02% ↘││ │││ ││││││ 0x00007fc83d245423: mov 0x34(%rsp),%r11d
0.20% 0.07% ││ │││ ││││││ 0x00007fc83d245428: movzbl 0x18(%r12,%r11,8),%r11d ; implicit exception: dispatches to 0x00007fc83d246e1e
0.59% 0.70% ││ │││ ││││││ 0x00007fc83d24542e: mov 0x34(%rsp),%r10d
0.02% 0.00% ││ │││ ││││││ 0x00007fc83d245433: shl $0x3,%r10 ;*aload
││ │││ ││││││ ; - com.google.re2j.Machine::match@136 (line 211)
0.01% ││ │││ ││││││ 0x00007fc83d245437: mov %r10,0x18(%rsp)
0.01% 0.01% ││ │││ ││││││ 0x00007fc83d24543c: test %r11d,%r11d
││ │││╭ ││││││ 0x00007fc83d24543f: je 0x00007fc83d245483 ;*ifeq
││ ││││ ││││││ ; - com.google.re2j.Machine::match@141 (line 211)
0.21% 0.20% ││ ││││ ││││││ 0x00007fc83d245441: mov 0x44(%rsp),%r11d
0.01% 0.00% ││ ││││ ││││││ 0x00007fc83d245446: test %r11d,%r11d
││ ││││ ││││││ 0x00007fc83d245449: jne 0x00007fc83d246071 ;*ifeq
││ ││││ ││││││ ; - com.google.re2j.Machine::match@148 (line 212)
││ ││││ ││││││ 0x00007fc83d24544f: test %eax,%eax
││ ││││ ││││││ 0x00007fc83d245451: jne 0x00007fc83d2460d1 ;*ifeq
││ ││││ ││││││ ; - com.google.re2j.Machine::match@162 (line 216)
0.01% 0.01% ││ ││││ ││││││ 0x00007fc83d245457: mov 0x24(%r12,%rsi,8),%r10d ;*getfield prefix
││ ││││ ││││││ ; - com.google.re2j.Machine::match@172 (line 220)
││ ││││ ││││││ ; implicit exception: dispatches to 0x00007fc83d246e91
0.19% 0.26% ││ ││││ ││││││ 0x00007fc83d24545c: mov %r10d,%r9d
0.00% ││ ││││ ││││││ 0x00007fc83d24545f: mov 0xc(%r12,%r10,8),%r10d ;*getfield value
││ ││││ ││││││ ; - java.lang.String::isEmpty@1 (line 635)
││ ││││ ││││││ ; - com.google.re2j.Machine::match@175 (line 220)
││ ││││ ││││││ ; implicit exception: dispatches to 0x00007fc83d246ea1
││ ││││ ││││││ 0x00007fc83d245464: vmovd %r10d,%xmm0
0.02% 0.01% ││ ││││ ││││││ 0x00007fc83d245469: mov 0xc(%r12,%r10,8),%r10d ;*arraylength
││ ││││ ││││││ ; - java.lang.String::isEmpty@4 (line 635)
││ ││││ ││││││ ; - com.google.re2j.Machine::match@175 (line 220)
││ ││││ ││││││ ; implicit exception: dispatches to 0x00007fc83d246eb1
0.26% 0.24% ││ ││││ ││││││ 0x00007fc83d24546e: mov %r10d,0x50(%rsp)
0.03% 0.00% ││ ││││ ││││││ 0x00007fc83d245473: test %r10d,%r10d
││ ││││ ││││││ 0x00007fc83d245476: jne 0x00007fc83d2457e4 ;*ifne
││ ││││ ││││││ ; - com.google.re2j.Machine::match@178 (line 220)
││ ││││ ││││││ 0x00007fc83d24547c: mov %r8d,0x58(%rsp)
0.02% 0.00% ││ ││││╭││││││ 0x00007fc83d245481: jmp 0x00007fc83d245488
0.32% 0.38% ││ │││↘│││││││ 0x00007fc83d245483: mov %r8d,0x58(%rsp) ;*iload_3
││ │││ │││││││ ; - com.google.re2j.Machine::match@267 (line 237)
0.31% 0.19% ││ │││ ↘││││││ 0x00007fc83d245488: test %eax,%eax
││ │││ ││││││ 0x00007fc83d24548a: jne 0x00007fc83d245bad ;*ifne
││ │││ ││││││ ; - com.google.re2j.Machine::match@279 (line 237)
0.01% 0.02% ││ │││ ││││││ 0x00007fc83d245490: vmovd %xmm4,%r10d
0.02% 0.00% ││ │││ ││││││ 0x00007fc83d245495: test %r10d,%r10d
││ │││ ││││││ 0x00007fc83d245498: jne 0x00007fc83d245d25 ;*ifeq
││ │││ ││││││ ; - com.google.re2j.Machine::match@286 (line 240)
0.32% 0.30% ││ │││ ││││││ 0x00007fc83d24549e: mov %rbx,%r11
0.23% 0.09% ││ │││ ││││││ 0x00007fc83d2454a1: mov 0x18(%rbx),%r8d ;*getfield prog
││ │││ ││││││ ; - com.google.re2j.Machine::match@297 (line 243)
0.04% 0.01% ││ │││ ││││││ 0x00007fc83d2454a5: mov 0x1c(%r12,%r8,8),%ebp ;*getfield startInst
││ │││ ││││││ ; - com.google.re2j.Machine::match@300 (line 243)
││ │││ ││││││ ; implicit exception: dispatches to 0x00007fc83d246e2d
0.01% ││ │││ ││││││ 0x00007fc83d2454aa: mov %r11,0x50(%rsp)
0.36% 0.31% ││ │││ ││││││ 0x00007fc83d2454af: mov 0x8(%r12,%rbp,8),%r11d ; implicit exception: dispatches to 0x00007fc83d246e3d
0.23% 0.06% ││ │││ ││││││ 0x00007fc83d2454b4: lea (%r12,%rbp,8),%r10
0.01% 0.01% ││ │││ ││││││ 0x00007fc83d2454b8: cmp $0xf8019a09,%r11d ; {metadata('com/google/re2j/Inst$Alt5Inst')}
││ │││ ╰│││││ 0x00007fc83d2454bf: je 0x00007fc83d2451dc
0.00% ││ │││ │││││ 0x00007fc83d2454c5: cmp $0xf8019909,%r11d ; {metadata('com/google/re2j/Inst$MatchInst')}
││ │││ │││││ 0x00007fc83d2454cc: jne 0x00007fc83d245d81 ;*invokevirtual add
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.28% 0.24% ││ │││ │││││ 0x00007fc83d2454d2: mov 0x18(%r10),%ecx ;*getfield pc
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
││ │││ │││││ 0x00007fc83d2454d6: cmp $0x40,%ecx
││ │││ │││││ 0x00007fc83d2454d9: jg 0x00007fc83d245f4d ;*if_icmpgt
││ │││ │││││ ; - com.google.re2j.Machine$Queue::contains@3 (line 41)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.02% 0.01% ││ │││ │││││ 0x00007fc83d2454df: mov %r10,%r9
0.00% 0.00% ││ │││ │││││ 0x00007fc83d2454e2: mov $0x1,%r8d
0.25% 0.23% ││ │││ │││││ 0x00007fc83d2454e8: shl %cl,%r8 ;*lshl
││ │││ │││││ ; - com.google.re2j.Machine$Queue::contains@12 (line 42)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.03% 0.04% ││ │││ │││││ 0x00007fc83d2454eb: mov 0x34(%rsp),%r11d
0.25% 0.16% ││ │││ │││││ 0x00007fc83d2454f0: mov 0x10(%r12,%r11,8),%r10 ;*getfield pcsl
││ │││ │││││ ; - com.google.re2j.Machine$Queue::contains@7 (line 42)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.01% ││ │││ │││││ 0x00007fc83d2454f5: mov %r10,%r11
0.01% ││ │││ │││││ 0x00007fc83d2454f8: and %r8,%r11 ;*land
││ │││ │││││ ; - com.google.re2j.Machine$Queue::contains@13 (line 42)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.01% 0.01% ││ │││ │││││ 0x00007fc83d2454fb: test %r11,%r11
││ │││ │││││ 0x00007fc83d2454fe: jne 0x00007fc83d245fa5 ;*ifeq
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.32% 0.15% ││ │││ │││││ 0x00007fc83d245504: cmp $0x40,%ecx
││ │││ │││││ 0x00007fc83d245507: jge 0x00007fc83d246019 ;*if_icmpge
││ │││ │││││ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.00% ││ │││ │││││ 0x00007fc83d24550d: mov 0x34(%rsp),%r11d
0.01% 0.01% ││ │││ │││││ 0x00007fc83d245512: mov %r12b,0x18(%r12,%r11,8) ;*putfield empty
││ │││ │││││ ; - com.google.re2j.Machine$Queue::add@33 (line 56)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.01% 0.02% ││ │││ │││││ 0x00007fc83d245517: mov 0x20(%r12,%r11,8),%ebx ;*getfield denseThreadsInstructions
││ │││ │││││ ; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.26% 0.19% ││ │││ │││││ 0x00007fc83d24551c: mov 0xc(%r12,%r11,8),%ebp ;*getfield size
││ │││ │││││ ; - com.google.re2j.Machine$Queue::addThread@6 (line 66)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
││ │││ │││││ 0x00007fc83d245521: or %r10,%r8
0.01% 0.01% ││ │││ │││││ 0x00007fc83d245524: mov %r8,0x10(%r12,%r11,8) ;*putfield pcsl
││ │││ │││││ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.00% 0.01% ││ │││ │││││ 0x00007fc83d245529: mov %ebp,%r11d
0.29% 0.25% ││ │││ │││││ 0x00007fc83d24552c: inc %r11d
││ │││ │││││ 0x00007fc83d24552f: mov 0x34(%rsp),%r10d
0.01% 0.02% ││ │││ │││││ 0x00007fc83d245534: mov %r11d,0xc(%r12,%r10,8) ;*putfield size
││ │││ │││││ ; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.02% 0.01% ││ │││ │││││ 0x00007fc83d245539: mov 0xc(%r12,%rbx,8),%r11d ; implicit exception: dispatches to 0x00007fc83d246e7d
0.23% 0.31% ││ │││ │││││ 0x00007fc83d24553e: cmp %r11d,%ebp
││ │││ │││││ 0x00007fc83d245541: jae 0x00007fc83d245cc9
0.09% 0.04% ││ │││ │││││ 0x00007fc83d245547: mov 0x8(%r12,%rbx,8),%r11d
0.01% ││ │││ │││││ 0x00007fc83d24554c: cmp $0xf8019807,%r11d ; {metadata('com/google/re2j/Inst'[])}
││ │││ │││││ 0x00007fc83d245553: jne 0x00007fc83d245de1
0.04% 0.04% ││ │││ │││││ 0x00007fc83d245559: mov %r9,%r11
0.24% 0.15% ││ │││ │││││ 0x00007fc83d24555c: shr $0x3,%r11 ;*aastore
││ │││ │││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.03% 0.01% ││ │││ │││││ 0x00007fc83d245560: lea (%r12,%rbx,8),%r10 ;*getfield denseThreadsInstructions
││ │││ │││││ ; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.00% 0.00% ││ │││ │││││ 0x00007fc83d245564: lea 0x10(%r10,%rbp,4),%r10
0.07% 0.03% ││ │││ │││││ 0x00007fc83d245569: mov %r11d,(%r10)
0.33% 0.27% ││ │││ │││││ 0x00007fc83d24556c: shr $0x9,%r10
0.02% 0.00% ││ │││ │││││ 0x00007fc83d245570: movabs $0x7fc84e197000,%r11
0.00% 0.00% ││ │││ │││││ 0x00007fc83d24557a: mov %r12b,(%r11,%r10,1) ;*aastore
││ │││ │││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││ │││ │││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ │││ │││││ ; - com.google.re2j.Machine::match@318 (line 243)
0.31% 0.33% ││ │││ ╰││││ 0x00007fc83d24557e: jmpq 0x00007fc83d24520c
0.00% ↘│ │││ ││││ 0x00007fc83d245583: mov $0x5,%r10d
│ │││ ╰│││ 0x00007fc83d245589: jmpq 0x00007fc83d24521b
0.01% ↘ │││ │││ 0x00007fc83d24558e: or $0xa,%r10d ;*ior ; - com.google.re2j.Utils::emptyOpContext@27 (line 180)
│││ │││ ; - com.google.re2j.Machine::match@326 (line 245)
│││ ╰││ 0x00007fc83d245592: jmpq 0x00007fc83d245232
0.00% ↘││ ││ 0x00007fc83d245597: mov $0x1,%r10d
││ ╰│ 0x00007fc83d24559d: jmpq 0x00007fc83d2452bd
│↘ │ 0x00007fc83d2455a2: mov 0x30(%rsp),%edi
0.01% 0.00% │ │ 0x00007fc83d2455a6: mov $0xffffffff,%r10d
│ ╰ 0x00007fc83d2455ac: jmpq 0x00007fc83d2453d6
↘ 0x00007fc83d2455b1: test %ecx,%ecx
0x00007fc83d2455b3: jne 0x00007fc83d2468e8 ;*ifeq
; - com.google.re2j.Machine::freeQueue@4 (line 150)
; - com.google.re2j.Machine::freeQueue@3 (line 146)
; - com.google.re2j.Machine::match@447 (line 267)
0.00% 0x00007fc83d2455b9: jmpq 0x00007fc83d2456e3
0x00007fc83d2455be: test %edi,%edi
0x00007fc83d2455c0: jl 0x00007fc83d2456d2 ;*ifge
; - com.google.re2j.MachineInput$UTF16Input::index@22 (line 205)
; - com.google.re2j.Machine::match@206 (line 224)
0x00007fc83d2455c6: mov %edi,%r10d
0x00007fc83d2455c9: sub 0x2c(%rsp),%r10d ;*isub
; - com.google.re2j.MachineInput$UTF16Input::index@31 (line 205)
; - com.google.re2j.Machine::match@206 (line 224)
0x00007fc83d2455ce: test %r10d,%r10d
0x00007fc83d2455d1: jl 0x00007fc83d2456d2 ;*ifge
; - com.google.re2j.Machine::match@213 (line 225)
0.00% 0x00007fc83d2455d7: mov 0x5c(%rsp),%r8d
0x00007fc83d2455dc: add %r10d,%r8d ;*iadd
; - com.google.re2j.Machine::match@222 (line 228)
0x00007fc83d2455df: mov %r8d,%edi
0x00007fc83d2455e2: mov %r8d,%r10d
0.00% 0x00007fc83d2455e5: add 0x60(%rsp),%r10d ;*iadd
; - com.google.re2j.MachineInput$UTF16Input::step@5 (line 185)
; - com.google.re2j.Machine::match@226 (line 229)
0x00007fc83d2455ea: mov %r10d,%r9d
0x00007fc83d2455ed: cmp 0x64(%rsp),%r10d
0x00007fc83d2455f2: jge 0x00007fc83d245aac ;*if_icmpge
; - com.google.re2j.MachineInput$UTF16Input::step@12 (line 186)
; - com.google.re2j.Machine::match@226 (line 229)
0x00007fc83d2455f8: test %r10d,%r10d
0x00007fc83d2455fb: jl 0x00007fc83d246b09 ;*iflt
; - java.lang.String::charAt@1 (line 657)
....................................................................................................
28.59% 29.86% <total for region 1>
....[Hottest Region 2]..............................................................................
C2, level 4, com.google.re2j.Machine::step, version 494 (195 bytes)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@214 (line 317)
; {optimized virtual_call}
0x00007fc83d21fe60: test %rax,%rax
0x00007fc83d21fe63: jne 0x00007fc83d2212fd
0x00007fc83d21fe69: mov 0x48(%rsp),%r11 ;*synchronization entry
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.10% 0.07% 0x00007fc83d21fe6e: mov 0x28(%rsp),%r14
0.05% 0.07% 0x00007fc83d21fe73: mov 0xac(%rsp),%eax
0.16% 0.22% 0x00007fc83d21fe7a: mov 0x30(%rsp),%r13
0.08% 0.16% 0x00007fc83d21fe7f: mov 0xa4(%rsp),%r10d ;*synchronization entry
; - com.google.re2j.Machine::step@-1 (line 280)
0.07% 0.11% 0x00007fc83d21fe87: mov 0xa8(%rsp),%r8d
0.05% 0.07% 0x00007fc83d21fe8f: mov 0xb0(%rsp),%ebx ;*aload
; - com.google.re2j.Machine::step@219 (line 320)
1.39% 1.30% 0x00007fc83d21fe96: inc %r10d ;*iinc
; - com.google.re2j.Machine::step@230 (line 286)
0.18% 0.19% 0x00007fc83d21fe99: cmp %eax,%r10d
0x00007fc83d21fe9c: jge 0x00007fc83d21ff7d
0.97% 1.01% 0x00007fc83d21fea2: mov %r11,%r9
0.10% 0.09% 0x00007fc83d21fea5: mov %r8d,0xa8(%rsp)
1.02% 1.14% 0x00007fc83d21fead: mov %ebx,0xb0(%rsp) ;*iload
; - com.google.re2j.Machine::step@43 (line 289)
0.20% 0.27% 0x00007fc83d21feb4: mov 0x10(%r13,%r10,4),%r8d ;*aaload
; - com.google.re2j.Machine::step@99 (line 299)
1.16% 1.32% 0x00007fc83d21feb9: mov 0xc(%r12,%r8,8),%r11d ;*getfield op
; - com.google.re2j.Machine::step@104 (line 301)
; implicit exception: dispatches to 0x00007fc83d221369
1.72% 1.86% 0x00007fc83d21febe: cmp $0x6,%r11d
0x00007fc83d21fec2: je 0x00007fc83d21ffc5 ;*if_icmpne
; - com.google.re2j.Machine::step@109 (line 301)
1.70% 1.70% 0x00007fc83d21fec8: cmp $0xa,%r11d
0x00007fc83d21fecc: je 0x00007fc83d21f9dd ;*if_icmpne
; - com.google.re2j.Inst::matchRune@6 (line 90)
; - com.google.re2j.Machine::step@191 (line 316)
0.61% 0.66% 0x00007fc83d21fed2: cmp $0xb,%r11d
0x00007fc83d21fed6: je 0x00007fc83d22006a ;*if_icmpne
; - com.google.re2j.Inst::matchRune@17 (line 94)
; - com.google.re2j.Machine::step@191 (line 316)
1.25% 1.15% 0x00007fc83d21fedc: mov 0x1c(%r12,%r8,8),%ecx ;*getfield f0
; - com.google.re2j.Inst::matchRune@42 (line 99)
; - com.google.re2j.Machine::step@191 (line 316)
0.08% 0.07% 0x00007fc83d21fee1: cmp $0x9,%r11d
╭ 0x00007fc83d21fee5: jne 0x00007fc83d21fef9 ;*if_icmpne
│ ; - com.google.re2j.Inst::matchRune@38 (line 98)
│ ; - com.google.re2j.Machine::step@191 (line 316)
0.36% 0.16% │ 0x00007fc83d21fee7: cmp 0x18(%rsp),%ecx
│ 0x00007fc83d21feeb: je 0x00007fc83d21ffba ;*if_icmpne
│ ; - com.google.re2j.Inst::matchRune@46 (line 99)
│ ; - com.google.re2j.Machine::step@191 (line 316)
0.05% 0.04% │ 0x00007fc83d21fef1: xor %r11d,%r11d
0.27% 0.12% │ 0x00007fc83d21fef4: jmpq 0x00007fc83d21f933
0.91% 1.02% ↘ 0x00007fc83d21fef9: cmp $0xc,%r11d
0x00007fc83d21fefd: jne 0x00007fc83d220099 ;*if_icmpne
; - com.google.re2j.Inst::matchRune@61 (line 102)
; - com.google.re2j.Machine::step@191 (line 316)
0.88% 1.02% 0x00007fc83d21ff03: cmp 0x18(%rsp),%ecx
0x00007fc83d21ff07: je 0x00007fc83d21ffaf ;*if_icmpeq
; - com.google.re2j.Inst::matchRune@69 (line 103)
; - com.google.re2j.Machine::step@191 (line 316)
0.94% 0.97% 0x00007fc83d21ff0d: mov 0x20(%r12,%r8,8),%r11d ;*getfield f1
; - com.google.re2j.Inst::matchRune@73 (line 103)
; - com.google.re2j.Machine::step@191 (line 316)
0.03% 0.04% 0x00007fc83d21ff12: cmp 0x18(%rsp),%r11d
0x00007fc83d21ff17: je 0x00007fc83d21ffaf ;*if_icmpeq
; - com.google.re2j.Inst::matchRune@77 (line 103)
; - com.google.re2j.Machine::step@191 (line 316)
1.56% 1.60% 0x00007fc83d21ff1d: mov 0x24(%r12,%r8,8),%ebp ;*getfield f2
; - com.google.re2j.Inst::matchRune@81 (line 103)
; - com.google.re2j.Machine::step@191 (line 316)
0.21% 0.16% 0x00007fc83d21ff22: cmp 0x18(%rsp),%ebp
0x00007fc83d21ff26: je 0x00007fc83d2200c9 ;*if_icmpeq
; - com.google.re2j.Inst::matchRune@85 (line 103)
; - com.google.re2j.Machine::step@191 (line 316)
1.43% 1.47% 0x00007fc83d21ff2c: mov 0x28(%r12,%r8,8),%ebp ;*getfield f3
; - com.google.re2j.Inst::matchRune@89 (line 103)
; - com.google.re2j.Machine::step@191 (line 316)
0.01% 0.05% 0x00007fc83d21ff31: cmp 0x18(%rsp),%ebp
0x00007fc83d21ff35: jne 0x00007fc83d21f930 ;*if_icmpne
; - com.google.re2j.Inst::matchRune@93 (line 103)
; - com.google.re2j.Machine::step@191 (line 316)
0x00007fc83d21ff3b: mov $0xffffff65,%esi
0x00007fc83d21ff40: mov %r10d,0xa4(%rsp)
0x00007fc83d21ff48: mov %r8d,0xac(%rsp)
0x00007fc83d21ff50: mov %r14,0x28(%rsp)
0x00007fc83d21ff55: mov %r9,0x30(%rsp)
....................................................................................................
17.51% 18.10% <total for region 2>
....[Hottest Region 3]..............................................................................
C2, level 4, com.google.re2j.Machine::step, version 494 (1013 bytes)
0x00007fc83d21f9c0: mov %r11d,(%rdx)
0x00007fc83d21f9c3: shr $0x9,%r10
0x00007fc83d21f9c7: movabs $0x7fc84e197000,%r11
0x00007fc83d21f9d1: mov %r12b,(%r11,%r10,1) ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21f9d5: mov %r13,%r11
0x00007fc83d21f9d8: jmpq 0x00007fc83d21fe6e
0.20% 0.15% 0x00007fc83d21f9dd: mov 0x2c(%r12,%r8,8),%r11d ;*getfield outInst
; - com.google.re2j.Machine::step@199 (line 317)
0.23% 0.15% 0x00007fc83d21f9e2: mov 0x8(%r12,%r11,8),%ebx ; implicit exception: dispatches to 0x00007fc83d221379
1.01% 0.74% 0x00007fc83d21f9e7: lea (%r12,%r11,8),%r8
0.01% 0.01% 0x00007fc83d21f9eb: cmp $0xf8019843,%ebx ; {metadata('com/google/re2j/Inst$Alt2Inst')}
╭ 0x00007fc83d21f9f1: je 0x00007fc83d21faa7
0.10% 0.04% │ 0x00007fc83d21f9f7: cmp $0xf8019909,%ebx ; {metadata('com/google/re2j/Inst$MatchInst')}
│ 0x00007fc83d21f9fd: jne 0x00007fc83d2207e9 ;*invokevirtual add
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.04% 0.02% │ 0x00007fc83d21fa03: mov 0x18(%r8),%edx ;*getfield pc
│ ; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
│ 0x00007fc83d21fa07: mov %r9,%r11
│ 0x00007fc83d21fa0a: mov 0x10(%r9),%r9 ;*getfield pcsl
│ ; - com.google.re2j.Machine$Queue::contains@7 (line 42)
│ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
│ ; implicit exception: dispatches to 0x00007fc83d221441
0.03% │ 0x00007fc83d21fa0e: cmp $0x40,%edx
│ 0x00007fc83d21fa11: jg 0x00007fc83d220ec9 ;*if_icmpgt
│ ; - com.google.re2j.Machine$Queue::contains@3 (line 41)
│ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.06% 0.00% │ 0x00007fc83d21fa17: mov $0x1,%ebx
│ 0x00007fc83d21fa1c: mov %edx,%ecx
│ 0x00007fc83d21fa1e: shl %cl,%rbx ;*lshl
│ ; - com.google.re2j.Machine$Queue::contains@12 (line 42)
│ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.14% 0.05% │ 0x00007fc83d21fa21: mov %r9,%rcx
│ 0x00007fc83d21fa24: and %rbx,%rcx ;*land
│ ; - com.google.re2j.Machine$Queue::contains@13 (line 42)
│ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.00% │ 0x00007fc83d21fa27: test %rcx,%rcx
│ 0x00007fc83d21fa2a: jne 0x00007fc83d220047 ;*ifeq
│ ; - com.google.re2j.Machine$Queue::contains@16 (line 42)
│ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.02% 0.03% │ 0x00007fc83d21fa30: xor %ebp,%ebp ;*ireturn
│ ; - com.google.re2j.Machine$Queue::contains@24 (line 42)
│ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.03% 0.01% │ 0x00007fc83d21fa32: test %rcx,%rcx
│ 0x00007fc83d21fa35: jne 0x00007fc83d220f51 ;*ifeq
│ ; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.02% 0.02% │ 0x00007fc83d21fa3b: cmp $0x40,%edx
│ 0x00007fc83d21fa3e: jge 0x00007fc83d220fc1 ;*if_icmpge
│ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
│ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.01% 0.01% │ 0x00007fc83d21fa44: mov %r12b,0x18(%r11) ;*putfield empty
│ ; - com.google.re2j.Machine$Queue::add@33 (line 56)
│ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.00% │ 0x00007fc83d21fa48: or %r9,%rbx
0.04% 0.00% │ 0x00007fc83d21fa4b: mov %rbx,0x10(%r11) ;*putfield pcsl
│ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
│ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.01% 0.03% │ 0x00007fc83d21fa4f: mov 0x20(%r11),%edx ;*getfield denseThreadsInstructions
│ ; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
│ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.01% 0.00% │ 0x00007fc83d21fa53: mov 0xc(%r11),%ebp ;*getfield size
│ ; - com.google.re2j.Machine$Queue::addThread@6 (line 66)
│ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.04% │ 0x00007fc83d21fa57: mov %ebp,%ecx
0.03% 0.00% │ 0x00007fc83d21fa59: inc %ecx
0.09% 0.04% │ 0x00007fc83d21fa5b: mov %ecx,0xc(%r11) ;*putfield size
│ ; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
│ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.05% 0.01% │ 0x00007fc83d21fa5f: mov 0xc(%r12,%rdx,8),%ecx ; implicit exception: dispatches to 0x00007fc83d221455
0.01% 0.01% │ 0x00007fc83d21fa64: cmp %ecx,%ebp
│ 0x00007fc83d21fa66: jae 0x00007fc83d220761
0.02% 0.00% │ 0x00007fc83d21fa6c: mov 0x8(%r12,%rdx,8),%ecx
0.02% 0.02% │ 0x00007fc83d21fa71: cmp $0xf8019807,%ecx ; {metadata('com/google/re2j/Inst'[])}
│ 0x00007fc83d21fa77: jne 0x00007fc83d22085d ;*aastore
│ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
│ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.03% 0.01% │ 0x00007fc83d21fa7d: lea (%r12,%rdx,8),%r9 ;*getfield denseThreadsInstructions
│ ; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
│ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│ ; - com.google.re2j.Machine::step@214 (line 317)
│ 0x00007fc83d21fa81: lea 0x10(%r9,%rbp,4),%r9
0.05% 0.01% │ 0x00007fc83d21fa86: shr $0x3,%r8
0.02% 0.00% │ 0x00007fc83d21fa8a: mov %r8d,(%r9)
0.31% 0.11% │ 0x00007fc83d21fa8d: mov %r9,%r8
│ 0x00007fc83d21fa90: shr $0x9,%r8
│ 0x00007fc83d21fa94: movabs $0x7fc84e197000,%r9
0.01% 0.02% │ 0x00007fc83d21fa9e: mov %r12b,(%r9,%r8,1) ;*aastore
│ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
│ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.13% 0.12% │ 0x00007fc83d21faa2: jmpq 0x00007fc83d21fe87 ;*invokevirtual add
│ ; - com.google.re2j.Machine::step@214 (line 317)
0.20% 0.30% ↘ 0x00007fc83d21faa7: mov 0x18(%r8),%edx ;*getfield pc
; - com.google.re2j.Inst$Alt2Inst::add@2 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.03% 0.04% 0x00007fc83d21faab: mov %r9,%r11
0.02% 0.01% 0x00007fc83d21faae: mov 0x10(%r9),%r9 ;*getfield pcsl
; - com.google.re2j.Machine$Queue::contains@7 (line 42)
; - com.google.re2j.Inst$Alt2Inst::add@5 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
; implicit exception: dispatches to 0x00007fc83d2213ad
0x00007fc83d21fab2: cmp $0x40,%edx
0x00007fc83d21fab5: jg 0x00007fc83d2204e9 ;*if_icmpgt
; - com.google.re2j.Machine$Queue::contains@3 (line 41)
; - com.google.re2j.Inst$Alt2Inst::add@5 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.30% 0.26% 0x00007fc83d21fabb: mov $0x1,%ebx
0.00% 0x00007fc83d21fac0: mov %edx,%ecx
0.01% 0.00% 0x00007fc83d21fac2: shl %cl,%rbx ;*lshl
; - com.google.re2j.Machine$Queue::contains@12 (line 42)
; - com.google.re2j.Inst$Alt2Inst::add@5 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.50% 0.46% 0x00007fc83d21fac5: mov %r9,%rcx
0.00% 0x00007fc83d21fac8: and %rbx,%rcx
0x00007fc83d21facb: test %rcx,%rcx
0x00007fc83d21face: jne 0x00007fc83d21fe87 ;*ifeq
; - com.google.re2j.Machine$Queue::contains@16 (line 42)
; - com.google.re2j.Inst$Alt2Inst::add@5 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.13% 0.08% 0x00007fc83d21fad4: cmp $0x40,%edx
0x00007fc83d21fad7: jge 0x00007fc83d220565 ;*if_icmpge
; - com.google.re2j.Machine$Queue::add@3 (line 51)
; - com.google.re2j.Inst$Alt2Inst::add@19 (line 178)
; - com.google.re2j.Machine::step@-1 (line 280)
0.16% 0.14% 0x00007fc83d21fadd: mov %r12b,0x18(%r11) ;*putfield empty
; - com.google.re2j.Machine$Queue::add@33 (line 56)
; - com.google.re2j.Inst$Alt2Inst::add@19 (line 178)
; - com.google.re2j.Machine::step@-1 (line 280)
0.01% 0.00% 0x00007fc83d21fae1: mov 0x2c(%r8),%ebp ;*getfield outInst
; - com.google.re2j.Inst$Alt2Inst::add@23 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0.00% 0x00007fc83d21fae5: or %r9,%rbx ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
; - com.google.re2j.Inst$Alt2Inst::add@19 (line 178)
; - com.google.re2j.Machine::step@-1 (line 280)
0.11% 0.06% 0x00007fc83d21fae8: mov %rbx,0x10(%r11) ;*putfield pcsl
; - com.google.re2j.Machine$Queue::add@15 (line 52)
; - com.google.re2j.Inst$Alt2Inst::add@19 (line 178)
; - com.google.re2j.Machine::step@-1 (line 280)
0.22% 0.13% 0x00007fc83d21faec: mov 0x8(%r12,%rbp,8),%esi ; implicit exception: dispatches to 0x00007fc83d2213c1
0.38% 0.18% 0x00007fc83d21faf1: cmp $0xf8019909,%esi ; {metadata('com/google/re2j/Inst$MatchInst')}
0x00007fc83d21faf7: jne 0x00007fc83d220175
0.33% 0.18% 0x00007fc83d21fafd: lea (%r12,%rbp,8),%r9 ;*invokevirtual add
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.01% 0x00007fc83d21fb01: mov 0x18(%r9),%ecx ;*getfield pc
; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.14% 0.09% 0x00007fc83d21fb05: cmp $0x40,%ecx
0x00007fc83d21fb08: jg 0x00007fc83d2205e1 ;*if_icmpgt
; - com.google.re2j.Machine$Queue::contains@3 (line 41)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.19% 0.22% 0x00007fc83d21fb0e: mov $0x1,%edi
0.05% 0.05% 0x00007fc83d21fb13: shl %cl,%rdi ;*lshl
; - com.google.re2j.Machine$Queue::contains@12 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.49% 0.42% 0x00007fc83d21fb16: mov %rbx,%rdx
0.01% 0.03% 0x00007fc83d21fb19: and %rdi,%rdx ;*land
; - com.google.re2j.Machine$Queue::contains@13 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fb1c: test %rdx,%rdx
0x00007fc83d21fb1f: jne 0x00007fc83d220017 ;*ifeq
; - com.google.re2j.Machine$Queue::contains@16 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.16% 0.19% 0x00007fc83d21fb25: xor %ebp,%ebp ;*ireturn
; - com.google.re2j.Machine$Queue::contains@24 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.10% 0.07% 0x00007fc83d21fb27: test %rdx,%rdx
0x00007fc83d21fb2a: jne 0x00007fc83d220661 ;*ifeq
; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.22% 0.15% 0x00007fc83d21fb30: cmp $0x40,%ecx
0x00007fc83d21fb33: jge 0x00007fc83d2206e1 ;*if_icmpge
; - com.google.re2j.Machine$Queue::add@3 (line 51)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0x00007fc83d21fb39: or %rdi,%rbx ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.02% 0.01% 0x00007fc83d21fb3c: mov %rbx,0x10(%r11) ;*putfield pcsl
; - com.google.re2j.Machine$Queue::add@15 (line 52)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.07% 0.08% 0x00007fc83d21fb40: mov 0x20(%r11),%edi ;*getfield denseThreadsInstructions
; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.19% 0.16% 0x00007fc83d21fb44: mov 0xc(%r11),%ecx ;*getfield size
; - com.google.re2j.Machine$Queue::addThread@6 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fb48: mov %ecx,%edx
0.01% 0.02% 0x00007fc83d21fb4a: inc %edx ;*iadd
; - com.google.re2j.Machine$Queue::addThread@11 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.11% 0.05% 0x00007fc83d21fb4c: mov %edx,0xc(%r11) ;*putfield size
; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.19% 0.13% 0x00007fc83d21fb50: mov 0xc(%r12,%rdi,8),%esi ; implicit exception: dispatches to 0x00007fc83d2213d5
0.01% 0.01% 0x00007fc83d21fb55: cmp %esi,%ecx
0x00007fc83d21fb57: jae 0x00007fc83d2200f5
0.09% 0.06% 0x00007fc83d21fb5d: vmovd %edx,%xmm2
0.08% 0.06% 0x00007fc83d21fb61: mov %ecx,0xc(%rsp)
0.24% 0.10% 0x00007fc83d21fb65: vmovd %edi,%xmm0
0x00007fc83d21fb69: mov %r10d,0xa4(%rsp)
0.03% 0.07% 0x00007fc83d21fb71: mov %r13,0x30(%rsp)
0.06% 0.04% 0x00007fc83d21fb76: mov %eax,0xac(%rsp)
0.18% 0.13% 0x00007fc83d21fb7d: mov %r11,%r13
0x00007fc83d21fb80: mov %r14,0x28(%rsp)
0.02% 0.06% 0x00007fc83d21fb85: mov 0x8(%r12,%rdi,8),%r11d
0.06% 0.07% 0x00007fc83d21fb8a: cmp $0xf8019807,%r11d ; {metadata('com/google/re2j/Inst'[])}
0x00007fc83d21fb91: jne 0x00007fc83d2201f1 ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.18% 0.16% 0x00007fc83d21fb97: mov 0x34(%r8),%r10d ;*getfield inst2
; - com.google.re2j.Inst$Alt2Inst::add@43 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0x00007fc83d21fb9b: mov %r10d,%ecx
0.05% 0.07% 0x00007fc83d21fb9e: mov %r9,%r10
0.10% 0.05% 0x00007fc83d21fba1: shr $0x3,%r10 ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.22% 0.18% 0x00007fc83d21fba5: lea (%r12,%rdi,8),%r9 ;*getfield denseThreadsInstructions
; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fba9: mov 0xc(%rsp),%r11d
0.03% 0.03% 0x00007fc83d21fbae: lea 0x10(%r9,%r11,4),%r11
0.09% 0.11% 0x00007fc83d21fbb3: mov %r10d,(%r11)
0.16% 0.16% 0x00007fc83d21fbb6: mov %r11,%r10
0x00007fc83d21fbb9: shr $0x9,%r10
0.07% 0.03% 0x00007fc83d21fbbd: movabs $0x7fc84e197000,%r11
0.07% 0.08% 0x00007fc83d21fbc7: mov %r12b,(%r11,%r10,1) ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Machine::step@-1 (line 280)
0.24% 0.10% 0x00007fc83d21fbcb: mov %ecx,%r10d
0.00% 0x00007fc83d21fbce: mov 0x8(%r12,%r10,8),%r8d ;*invokevirtual add
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
; implicit exception: dispatches to 0x00007fc83d2213f1
0.03% 0.03% 0x00007fc83d21fbd3: movslq 0xc(%rsp),%r10
0.08% 0.03% 0x00007fc83d21fbd8: lea (%r9,%r10,4),%rdi ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.21% 0.14% 0x00007fc83d21fbdc: mov %rdi,%rdx
0x00007fc83d21fbdf: add $0x14,%rdx ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
0.08% 0.02% 0x00007fc83d21fbe3: mov %ecx,%r10d
0.11% 0.09% 0x00007fc83d21fbe6: lea (%r12,%r10,8),%rax
0.14% 0.19% 0x00007fc83d21fbea: mov 0xc(%rsp),%r10d
0x00007fc83d21fbef: add $0x2,%r10d ;*iadd
; - com.google.re2j.Machine$Queue::addThread@11 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
0.08% 0.03% 0x00007fc83d21fbf3: cmp $0xf8019885,%r8d ; {metadata('com/google/re2j/Inst$CaptureInst')}
0x00007fc83d21fbfa: jne 0x00007fc83d21f953 ;*invokevirtual add
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
0.06% 0.09% 0x00007fc83d21fc00: mov 0x18(%rax),%r11d ;*getfield pc
; - com.google.re2j.Inst$CaptureInst::add@2 (line 461)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.16% 0.09% 0x00007fc83d21fc04: mov %r11d,%r14d
0x00007fc83d21fc07: cmp $0x40,%r11d
0x00007fc83d21fc0b: jg 0x00007fc83d2209a9 ;*if_icmpgt
; - com.google.re2j.Machine$Queue::contains@3 (line 41)
; - com.google.re2j.Inst$CaptureInst::add@5 (line 461)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.03% 0.03% 0x00007fc83d21fc11: mov $0x1,%r8d
0.05% 0.02% 0x00007fc83d21fc17: mov %r11d,%ecx
0.19% 0.05% 0x00007fc83d21fc1a: shl %cl,%r8 ;*lshl
; - com.google.re2j.Machine$Queue::contains@12 (line 42)
; - com.google.re2j.Inst$CaptureInst::add@5 (line 461)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.14% 0.02% 0x00007fc83d21fc1d: mov %rbx,%r11
0.21% 0.10% 0x00007fc83d21fc20: and %r8,%r11 ;*land
; - com.google.re2j.Machine$Queue::contains@13 (line 42)
; - com.google.re2j.Inst$CaptureInst::add@5 (line 461)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fc23: test %r11,%r11
0x00007fc83d21fc26: jne 0x00007fc83d220021 ;*ifeq
; - com.google.re2j.Machine$Queue::contains@16 (line 42)
; - com.google.re2j.Inst$CaptureInst::add@5 (line 461)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.03% 0.04% 0x00007fc83d21fc2c: xor %ebp,%ebp ;*ireturn
; - com.google.re2j.Machine$Queue::contains@24 (line 42)
; - com.google.re2j.Inst$CaptureInst::add@5 (line 461)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.07% 0.05% 0x00007fc83d21fc2e: test %r11,%r11
0x00007fc83d21fc31: jne 0x00007fc83d220a29 ;*ifeq
; - com.google.re2j.Inst$CaptureInst::add@8 (line 461)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.17% 0.12% 0x00007fc83d21fc37: mov %ecx,%r11d
0x00007fc83d21fc3a: cmp $0x40,%r11d
0x00007fc83d21fc3e: jge 0x00007fc83d220a79 ;*if_icmpge
; - com.google.re2j.Machine$Queue::add@3 (line 51)
; - com.google.re2j.Inst$CaptureInst::add@19 (line 464)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.03% 0.04% 0x00007fc83d21fc44: or %r8,%rbx ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
; - com.google.re2j.Inst$CaptureInst::add@19 (line 464)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.06% 0.06% 0x00007fc83d21fc47: mov %rbx,0x10(%r13) ;*putfield pcsl
; - com.google.re2j.Machine$Queue::add@15 (line 52)
; - com.google.re2j.Inst$CaptureInst::add@19 (line 464)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.15% 0.07% 0x00007fc83d21fc4b: mov 0x2c(%rax),%ebp ;*getfield outInst
; - com.google.re2j.Inst$CaptureInst::add@82 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0x00007fc83d21fc4e: mov 0x8(%r12,%rbp,8),%r8d ; implicit exception: dispatches to 0x00007fc83d221405
0.05% 0.02% 0x00007fc83d21fc53: cmp $0xf8019843,%r8d ; {metadata('com/google/re2j/Inst$Alt2Inst')}
0x00007fc83d21fc5a: jne 0x00007fc83d220435
0.05% 0.00% 0x00007fc83d21fc60: lea (%r12,%rbp,8),%rax ;*invokevirtual add
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.19% 0.16% 0x00007fc83d21fc64: mov 0x18(%rax),%r11d ;*getfield pc
; - com.google.re2j.Inst$Alt2Inst::add@2 (line 175)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fc68: mov %r11d,%ecx
0.05% 0.07% 0x00007fc83d21fc6b: cmp $0x40,%r11d
0x00007fc83d21fc6f: jg 0x00007fc83d220c61 ;*if_icmpgt
; - com.google.re2j.Machine$Queue::contains@3 (line 41)
; - com.google.re2j.Inst$Alt2Inst::add@5 (line 175)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.08% 0.07% 0x00007fc83d21fc75: mov $0x1,%r8d
0.15% 0.19% 0x00007fc83d21fc7b: shl %cl,%r8 ;*lshl
; - com.google.re2j.Machine$Queue::contains@12 (line 42)
; - com.google.re2j.Inst$Alt2Inst::add@5 (line 175)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.13% 0.19% 0x00007fc83d21fc7e: mov %rbx,%r11
0.21% 0.26% 0x00007fc83d21fc81: and %r8,%r11
0x00007fc83d21fc84: test %r11,%r11
0x00007fc83d21fc87: jne 0x00007fc83d220035 ;*ifeq
; - com.google.re2j.Machine$Queue::contains@16 (line 42)
; - com.google.re2j.Inst$Alt2Inst::add@5 (line 175)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.04% 0.04% 0x00007fc83d21fc8d: mov %ecx,%r11d
0.07% 0.09% 0x00007fc83d21fc90: cmp $0x40,%r11d
0x00007fc83d21fc94: jge 0x00007fc83d220ce1 ;*if_icmpge
; - com.google.re2j.Machine$Queue::add@3 (line 51)
; - com.google.re2j.Inst$Alt2Inst::add@19 (line 178)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.17% 0.16% 0x00007fc83d21fc9a: mov 0x2c(%rax),%ebp ;*getfield outInst
; - com.google.re2j.Inst$Alt2Inst::add@23 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0x00007fc83d21fc9d: or %r8,%rbx ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
; - com.google.re2j.Inst$Alt2Inst::add@19 (line 178)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.03% 0.02% 0x00007fc83d21fca0: mov %rbx,0x10(%r13) ;*putfield pcsl
; - com.google.re2j.Machine$Queue::add@15 (line 52)
; - com.google.re2j.Inst$Alt2Inst::add@19 (line 178)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.09% 0.13% 0x00007fc83d21fca4: mov 0x8(%r12,%rbp,8),%r8d ; implicit exception: dispatches to 0x00007fc83d221419
0.19% 0.29% 0x00007fc83d21fca9: cmp $0xf8019909,%r8d ; {metadata('com/google/re2j/Inst$MatchInst')}
0x00007fc83d21fcb0: jne 0x00007fc83d220481
0x00007fc83d21fcb6: lea (%r12,%rbp,8),%r14 ;*invokevirtual add
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.07% 0.03% 0x00007fc83d21fcba: mov 0x18(%r14),%r11d ;*getfield pc
; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.06% 0.06% 0x00007fc83d21fcbe: vmovd %r11d,%xmm1
0.21% 0.16% 0x00007fc83d21fcc3: cmp $0x40,%r11d
0x00007fc83d21fcc7: jg 0x00007fc83d220d61 ;*if_icmpgt
; - com.google.re2j.Machine$Queue::contains@3 (line 41)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fccd: mov $0x1,%r8d
0.03% 0.05% 0x00007fc83d21fcd3: mov %r11d,%ecx
0.08% 0.08% 0x00007fc83d21fcd6: shl %cl,%r8 ;*lshl
; - com.google.re2j.Machine$Queue::contains@12 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.23% 0.32% 0x00007fc83d21fcd9: mov %rbx,%r11
0.07% 0.11% 0x00007fc83d21fcdc: and %r8,%r11 ;*land
; - com.google.re2j.Machine$Queue::contains@13 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.20% 0.25% 0x00007fc83d21fcdf: test %r11,%r11
0x00007fc83d21fce2: jne 0x00007fc83d22003d ;*ifeq
; - com.google.re2j.Machine$Queue::contains@16 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.01% 0x00007fc83d21fce8: xor %ebp,%ebp ;*ireturn
; - com.google.re2j.Machine$Queue::contains@24 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.01% 0.02% 0x00007fc83d21fcea: test %r11,%r11
0x00007fc83d21fced: jne 0x00007fc83d220de9 ;*ifeq
; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.06% 0.05% 0x00007fc83d21fcf3: mov %ecx,%r11d
0.14% 0.18% 0x00007fc83d21fcf6: cmp $0x40,%r11d
0x00007fc83d21fcfa: jge 0x00007fc83d220e45 ;*if_icmpge
; - com.google.re2j.Machine$Queue::add@3 (line 51)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fd00: mov %r10d,0xc(%r13) ;*putfield size
; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.07% 0.06% 0x00007fc83d21fd04: or %r8,%rbx ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.06% 0.06% 0x00007fc83d21fd07: mov %rbx,0x10(%r13) ;*putfield pcsl
; - com.google.re2j.Machine$Queue::add@15 (line 52)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.17% 0.21% 0x00007fc83d21fd0b: cmp %esi,%r10d
0x00007fc83d21fd0e: jae 0x00007fc83d220339 ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21fd14: mov 0x34(%rax),%r10d ;*getfield inst2
; - com.google.re2j.Inst$Alt2Inst::add@43 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.05% 0.02% 0x00007fc83d21fd18: mov %rdx,%r8
0.08% 0.07% 0x00007fc83d21fd1b: mov %r14,%r11
0.25% 0.18% 0x00007fc83d21fd1e: shr $0x3,%r11
0.00% 0x00007fc83d21fd22: mov %r11d,(%rdx)
0.03% 0.05% 0x00007fc83d21fd25: shr $0x9,%r8
0.06% 0.09% 0x00007fc83d21fd29: movabs $0x7fc84e197000,%r11
0.18% 0.22% 0x00007fc83d21fd33: mov %r12b,(%r11,%r8,1) ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@37 (line 180)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0.00% 0x00007fc83d21fd37: mov 0x8(%r12,%r10,8),%r11d ; implicit exception: dispatches to 0x00007fc83d22142d
0.05% 0.08% 0x00007fc83d21fd3c: lea (%r12,%r10,8),%r8
0.04% 0.06% 0x00007fc83d21fd40: cmp $0xf8019885,%r11d ; {metadata('com/google/re2j/Inst$CaptureInst')}
0x00007fc83d21fd47: je 0x00007fc83d21fdd7
0.16% 0.23% 0x00007fc83d21fd4d: cmp $0xf8019909,%r11d ; {metadata('com/google/re2j/Inst$MatchInst')}
0x00007fc83d21fd54: jne 0x00007fc83d2208e5 ;*invokevirtual add
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.04% 0.02% 0x00007fc83d21fd5a: mov 0x18(%r8),%ecx ;*getfield pc
; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.03% 0.07% 0x00007fc83d21fd5e: cmp $0x40,%ecx
0x00007fc83d21fd61: jg 0x00007fc83d221199 ;*if_icmpgt
; - com.google.re2j.Machine$Queue::contains@3 (line 41)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.06% 0.15% 0x00007fc83d21fd67: mov $0x1,%r11d
0.18% 0.23% 0x00007fc83d21fd6d: shl %cl,%r11 ;*lshl
; - com.google.re2j.Machine$Queue::contains@12 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.21% 0.17% 0x00007fc83d21fd70: mov %rbx,%r10
0.15% 0.06% 0x00007fc83d21fd73: and %r11,%r10 ;*land
; - com.google.re2j.Machine$Queue::contains@13 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0.00% 0x00007fc83d21fd76: test %r10,%r10
0x00007fc83d21fd79: jne 0x00007fc83d22005b ;*ifeq
; - com.google.re2j.Machine$Queue::contains@16 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.06% 0.09% 0x00007fc83d21fd7f: mov %ecx,%edx
0.03% 0.08% 0x00007fc83d21fd81: mov %r8,%rcx
0.16% 0.19% 0x00007fc83d21fd84: xor %ebp,%ebp ;*ireturn
; - com.google.re2j.Machine$Queue::contains@24 (line 42)
; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.00% 0.00% 0x00007fc83d21fd86: test %r10,%r10
0x00007fc83d21fd89: jne 0x00007fc83d221211 ;*ifeq
; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.10% 0.14% 0x00007fc83d21fd8f: cmp $0x40,%edx
0x00007fc83d21fd92: jge 0x00007fc83d221285 ;*if_icmpge
; - com.google.re2j.Machine$Queue::add@3 (line 51)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.05% 0.11% 0x00007fc83d21fd98: or %r11,%rbx
0.14% 0.23% 0x00007fc83d21fd9b: mov %r13,%r11
0.01% 0x00007fc83d21fd9e: mov %rbx,0x10(%r11) ;*putfield pcsl
; - com.google.re2j.Machine$Queue::add@15 (line 52)
; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.09% 0.14% 0x00007fc83d21fda2: add $0x18,%rdi
0.03% 0.05% 0x00007fc83d21fda6: mov %rcx,%r10
0.16% 0.19% 0x00007fc83d21fda9: shr $0x3,%r10
0.01% 0x00007fc83d21fdad: mov %r10d,(%rdi) ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.09% 0.13% 0x00007fc83d21fdb0: mov %rdi,%r10
0.04% 0.05% 0x00007fc83d21fdb3: mov 0xc(%rsp),%r8d
0.16% 0.15% 0x00007fc83d21fdb8: add $0x3,%r8d
0.00% 0x00007fc83d21fdbc: mov %r8d,0xc(%r11) ;*putfield size
; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.12% 0.09% 0x00007fc83d21fdc0: shr $0x9,%r10
0.06% 0.07% 0x00007fc83d21fdc4: movabs $0x7fc84e197000,%r8
0.17% 0.06% 0x00007fc83d21fdce: mov %r12b,(%r8,%r10,1) ;*aastore
; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
0.01% 0.03% 0x00007fc83d21fdd2: jmpq 0x00007fc83d21fe6e ;*invokevirtual add
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Inst$CaptureInst::add@96 (line 472)
; - com.google.re2j.Inst$Alt2Inst::add@-1 (line 175)
; - com.google.re2j.Machine::step@-1 (line 280)
....................................................................................................
17.38% 14.97% <total for region 3>
....[Hottest Region 4]..............................................................................
C2, level 4, com.google.re2j.Inst$Alt5Inst::add, version 511 (867 bytes)
# parm5: [sp+0x80] = 'com/google/re2j/Machine' (sp of caller)
# parm6: [sp+0x88] = boolean
0x00007fc83d223cc0: mov 0x8(%rsi),%r10d
0x00007fc83d223cc4: shl $0x3,%r10
0x00007fc83d223cc8: cmp %r10,%rax
0x00007fc83d223ccb: jne 0x00007fc83d045e20 ; {runtime_call}
0x00007fc83d223cd1: data16 xchg %ax,%ax
0x00007fc83d223cd4: nopl 0x0(%rax,%rax,1)
0x00007fc83d223cdc: data16 data16 xchg %ax,%ax
[Verified Entry Point]
0.08% 0.03% 0x00007fc83d223ce0: mov %eax,-0x14000(%rsp)
0.28% 0.22% 0x00007fc83d223ce7: push %rbp
0.02% 0x00007fc83d223ce8: sub $0x70,%rsp ;*synchronization entry
; - com.google.re2j.Inst$Alt5Inst::add@-1 (line 260)
0.29% 0.31% 0x00007fc83d223cec: vmovd %r9d,%xmm4
0.01% 0.02% 0x00007fc83d223cf1: vmovq %r8,%xmm3
0.00% 0.00% 0x00007fc83d223cf6: vmovq %rsi,%xmm2
0.04% 0.06% 0x00007fc83d223cfb: mov %ecx,%r13d
0.23% 0.14% 0x00007fc83d223cfe: mov 0x18(%rsi),%ecx ;*getfield pc
; - com.google.re2j.Inst$Alt5Inst::add@2 (line 260)
0.02% 0.03% 0x00007fc83d223d01: mov 0x10(%rdx),%r11 ;*getfield pcsl
; - com.google.re2j.Machine$Queue::contains@7 (line 42)
; - com.google.re2j.Inst$Alt5Inst::add@5 (line 260)
; implicit exception: dispatches to 0x00007fc83d224605
0.01% 0.01% 0x00007fc83d223d05: cmp $0x40,%ecx
0x00007fc83d223d08: jg 0x00007fc83d224215 ;*if_icmpgt
; - com.google.re2j.Machine$Queue::contains@3 (line 41)
; - com.google.re2j.Inst$Alt5Inst::add@5 (line 260)
0.05% 0.07% 0x00007fc83d223d0e: mov $0x1,%esi
0.24% 0.29% 0x00007fc83d223d13: mov $0x1,%r9d
0.00% 0.01% 0x00007fc83d223d19: shl %cl,%r9 ;*lshl
; - com.google.re2j.Machine$Queue::contains@12 (line 42)
; - com.google.re2j.Inst$Alt5Inst::add@5 (line 260)
0.29% 0.33% 0x00007fc83d223d1c: mov %r11,%r10
0.01% 0.01% 0x00007fc83d223d1f: and %r9,%r10 ;*land
; - com.google.re2j.Machine$Queue::contains@13 (line 42)
; - com.google.re2j.Inst$Alt5Inst::add@5 (line 260)
0.01% 0.01% 0x00007fc83d223d22: test %r10,%r10
╭ 0x00007fc83d223d25: jne 0x00007fc83d224044 ;*ifeq
│ ; - com.google.re2j.Machine$Queue::contains@16 (line 42)
│ ; - com.google.re2j.Inst$Alt5Inst::add@5 (line 260)
0.08% 0.04% │ 0x00007fc83d223d2b: xor %ebp,%ebp ;*ireturn
│ ; - com.google.re2j.Machine$Queue::contains@24 (line 42)
│ ; - com.google.re2j.Inst$Alt5Inst::add@5 (line 260)
0.22% 0.28% │ ↗ 0x00007fc83d223d2d: test %r10,%r10
│ │ 0x00007fc83d223d30: jne 0x00007fc83d224249 ;*ifeq
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@8 (line 260)
0.03% 0.00% │ │ 0x00007fc83d223d36: cmp $0x40,%ecx
│ │ 0x00007fc83d223d39: jge 0x00007fc83d224279 ;*if_icmpge
│ │ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@19 (line 263)
0.01% │ │ 0x00007fc83d223d3f: mov %r12b,0x18(%rdx) ;*putfield empty
│ │ ; - com.google.re2j.Machine$Queue::add@33 (line 56)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@19 (line 263)
0.06% 0.07% │ │ 0x00007fc83d223d43: vmovq %xmm2,%r10
0.22% 0.26% │ │ 0x00007fc83d223d48: mov 0x2c(%r10),%ebp ;*getfield outInst
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@23 (line 265)
0.02% 0.01% │ │ 0x00007fc83d223d4c: or %r11,%r9 ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@19 (line 263)
0.01% 0.01% │ │ 0x00007fc83d223d4f: mov %r9,0x10(%rdx) ;*putfield pcsl
│ │ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@19 (line 263)
0.06% 0.07% │ │ 0x00007fc83d223d53: mov 0x8(%r12,%rbp,8),%r11d ; implicit exception: dispatches to 0x00007fc83d224619
0.23% 0.26% │ │ 0x00007fc83d223d58: cmp $0xf8019909,%r11d ; {metadata('com/google/re2j/Inst$MatchInst')}
│ │ 0x00007fc83d223d5f: jne 0x00007fc83d2240f9
0.02% 0.01% │ │ 0x00007fc83d223d65: lea (%r12,%rbp,8),%r11 ;*invokevirtual add
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.02% │ │ 0x00007fc83d223d69: mov 0x18(%r11),%ecx ;*getfield pc
│ │ ; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.05% 0.10% │ │ 0x00007fc83d223d6d: cmp $0x40,%ecx
│ │ 0x00007fc83d223d70: jg 0x00007fc83d2242ad ;*if_icmpgt
│ │ ; - com.google.re2j.Machine$Queue::contains@3 (line 41)
│ │ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.33% 0.23% │ │ 0x00007fc83d223d76: mov $0x1,%r10d
0.00% │ │ 0x00007fc83d223d7c: shl %cl,%r10 ;*lshl
│ │ ; - com.google.re2j.Machine$Queue::contains@12 (line 42)
│ │ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.32% 0.48% │ │ 0x00007fc83d223d7f: mov %r9,%r8
0.02% 0.02% │ │ 0x00007fc83d223d82: and %r10,%r8 ;*land
│ │ ; - com.google.re2j.Machine$Queue::contains@13 (line 42)
│ │ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│ │ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.02% │ │ 0x00007fc83d223d85: test %r8,%r8
│╭ │ 0x00007fc83d223d88: jne 0x00007fc83d22404e ;*ifeq
││ │ ; - com.google.re2j.Machine$Queue::contains@16 (line 42)
││ │ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ │ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.08% 0.09% ││ │ 0x00007fc83d223d8e: xor %ebp,%ebp ;*ireturn
││ │ ; - com.google.re2j.Machine$Queue::contains@24 (line 42)
││ │ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ │ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.26% 0.19% ││ │↗ 0x00007fc83d223d90: test %r8,%r8
││ ││ 0x00007fc83d223d93: jne 0x00007fc83d2242e9 ;*ifeq
││ ││ ; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.00% 0.00% ││ ││ 0x00007fc83d223d99: cmp $0x40,%ecx
││ ││ 0x00007fc83d223d9c: jge 0x00007fc83d22431d ;*if_icmpge
││ ││ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.01% 0.01% ││ ││ 0x00007fc83d223da2: or %r10,%r9 ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.07% 0.07% ││ ││ 0x00007fc83d223da5: mov %r9,0x10(%rdx) ;*putfield pcsl
││ ││ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.27% 0.37% ││ ││ 0x00007fc83d223da9: mov 0x88(%rsp),%r8d
0.02% 0.01% ││ ││ 0x00007fc83d223db1: test %r8d,%r8d
││ ││ 0x00007fc83d223db4: jne 0x00007fc83d22435d ;*ifeq
││ ││ ; - com.google.re2j.Inst$MatchInst::add@24 (line 149)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.00% 0.03% ││ ││ 0x00007fc83d223dba: mov 0xc(%rdx),%ecx ;*getfield size
││ ││ ; - com.google.re2j.Machine$Queue::addThread@6 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.05% 0.09% ││ ││ 0x00007fc83d223dbd: mov 0x20(%rdx),%ebx ;*getfield denseThreadsInstructions
││ ││ ; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.26% 0.41% ││ ││ 0x00007fc83d223dc0: mov %ecx,%edi
0.03% 0.02% ││ ││ 0x00007fc83d223dc2: inc %edi ;*iadd
││ ││ ; - com.google.re2j.Machine$Queue::addThread@11 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.00% 0.00% ││ ││ 0x00007fc83d223dc4: mov %edi,0xc(%rdx) ;*putfield size
││ ││ ; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.05% 0.06% ││ ││ 0x00007fc83d223dc7: mov 0xc(%r12,%rbx,8),%r10d ; implicit exception: dispatches to 0x00007fc83d224641
0.20% 0.24% ││ ││ 0x00007fc83d223dcc: cmp %r10d,%ecx
││ ││ 0x00007fc83d223dcf: jae 0x00007fc83d22407d
0.02% 0.01% ││ ││ 0x00007fc83d223dd5: vmovd %edi,%xmm0
0.01% 0.01% ││ ││ 0x00007fc83d223dd9: mov %ebx,%edi
0.07% 0.07% ││ ││ 0x00007fc83d223ddb: mov %ecx,%eax
0.18% 0.30% ││ ││ 0x00007fc83d223ddd: mov %r11,%rcx
0.01% 0.01% ││ ││ 0x00007fc83d223de0: mov 0x88(%rsp),%r11d
0.01% 0.01% ││ ││ 0x00007fc83d223de8: mov 0x8(%r12,%rbx,8),%r8d
0.06% 0.04% ││ ││ 0x00007fc83d223ded: cmp $0xf8019807,%r8d ; {metadata('com/google/re2j/Inst'[])}
││ ││ 0x00007fc83d223df4: jne 0x00007fc83d224129 ;*aastore
││ ││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.26% 0.27% ││ ││ 0x00007fc83d223dfa: vmovq %xmm2,%r11
0.00% 0.03% ││ ││ 0x00007fc83d223dff: mov 0x34(%r11),%ebp ;*getfield inst2
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@43 (line 266)
0.00% ││ ││ 0x00007fc83d223e03: shr $0x3,%rcx ;*aastore
││ ││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.08% 0.05% ││ ││ 0x00007fc83d223e07: lea (%r12,%rbx,8),%r11 ;*getfield denseThreadsInstructions
││ ││ ; - com.google.re2j.Machine$Queue::addThread@1 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.19% 0.23% ││ ││ 0x00007fc83d223e0b: lea 0x10(%r11,%rax,4),%r8
0.01% 0.02% ││ ││ 0x00007fc83d223e10: mov %ecx,(%r8)
0.01% 0.01% ││ ││ 0x00007fc83d223e13: mov %r8,%rcx
0.06% 0.06% ││ ││ 0x00007fc83d223e16: shr $0x9,%rcx
0.25% 0.16% ││ ││ 0x00007fc83d223e1a: movabs $0x7fc84e197000,%r8
0.01% 0.01% ││ ││ 0x00007fc83d223e24: mov %r12b,(%r8,%rcx,1) ;*aastore
││ ││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@37 (line 265)
0.05% 0.03% ││ ││ 0x00007fc83d223e28: mov 0x8(%r12,%rbp,8),%ebx ; implicit exception: dispatches to 0x00007fc83d22465d
0.05% 0.04% ││ ││ 0x00007fc83d223e2d: cmp $0xf8019909,%ebx ; {metadata('com/google/re2j/Inst$MatchInst')}
││ ││ 0x00007fc83d223e33: jne 0x00007fc83d224169
0.21% 0.10% ││ ││ 0x00007fc83d223e39: lea (%r12,%rbp,8),%r14 ;*invokevirtual add
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.00% 0.00% ││ ││ 0x00007fc83d223e3d: mov 0x18(%r14),%ecx ;*getfield pc
││ ││ ; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.19% 0.27% ││ ││ 0x00007fc83d223e41: vmovd %ecx,%xmm1
0.15% 0.10% ││ ││ 0x00007fc83d223e45: cmp $0x40,%ecx
││ ││ 0x00007fc83d223e48: jg 0x00007fc83d224399 ;*if_icmpgt
││ ││ ; - com.google.re2j.Machine$Queue::contains@3 (line 41)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.15% 0.19% ││ ││ 0x00007fc83d223e4e: mov $0x1,%ebx
0.01% ││ ││ 0x00007fc83d223e53: shl %cl,%rbx ;*lshl
││ ││ ; - com.google.re2j.Machine$Queue::contains@12 (line 42)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.40% 0.56% ││ ││ 0x00007fc83d223e56: mov %r9,%rcx
0.01% ││ ││ 0x00007fc83d223e59: and %rbx,%rcx ;*land
││ ││ ; - com.google.re2j.Machine$Queue::contains@13 (line 42)
││ ││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.03% 0.02% ││ ││ 0x00007fc83d223e5c: test %rcx,%rcx
││╭ ││ 0x00007fc83d223e5f: jne 0x00007fc83d224058 ;*ifeq
│││ ││ ; - com.google.re2j.Machine$Queue::contains@16 (line 42)
│││ ││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.16% 0.17% │││ ││ 0x00007fc83d223e65: xor %ebp,%ebp ;*ireturn
│││ ││ ; - com.google.re2j.Machine$Queue::contains@24 (line 42)
│││ ││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│││ ││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.11% 0.07% │││ ││↗ 0x00007fc83d223e67: test %rcx,%rcx
│││ │││ 0x00007fc83d223e6a: jne 0x00007fc83d2243d5 ;*ifeq
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.07% 0.10% │││ │││ 0x00007fc83d223e70: vmovd %xmm1,%ecx
0.03% 0.05% │││ │││ 0x00007fc83d223e74: cmp $0x40,%ecx
│││ │││ 0x00007fc83d223e77: jge 0x00007fc83d224409 ;*if_icmpge
│││ │││ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.17% 0.18% │││ │││ 0x00007fc83d223e7d: or %rbx,%r9 ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.11% 0.13% │││ │││ 0x00007fc83d223e80: mov %r9,0x10(%rdx) ;*putfield pcsl
│││ │││ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.03% 0.02% │││ │││ 0x00007fc83d223e84: mov %eax,%ebx
0.01% 0.03% │││ │││ 0x00007fc83d223e86: add $0x2,%ebx
0.17% 0.20% │││ │││ 0x00007fc83d223e89: mov %ebx,0xc(%rdx) ;*putfield size
│││ │││ ; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.14% 0.19% │││ │││ 0x00007fc83d223e8c: mov %eax,%ebx
0.02% 0.03% │││ │││ 0x00007fc83d223e8e: add $0x4,%ebx ;*iadd
│││ │││ ; - com.google.re2j.Machine$Queue::addThread@11 (line 66)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.02% 0.02% │││ │││ 0x00007fc83d223e91: cmp %r10d,%ebx
│││ │││ 0x00007fc83d223e94: jae 0x00007fc83d2240bd ;*aastore
│││ │││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.13% 0.16% │││ │││ 0x00007fc83d223e9a: vmovq %xmm2,%r10
0.10% 0.12% │││ │││ 0x00007fc83d223e9f: mov 0x38(%r10),%ebp ;*getfield inst3
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@63 (line 267)
0.01% 0.01% │││ │││ 0x00007fc83d223ea3: mov %r14,%rcx
0.02% 0.02% │││ │││ 0x00007fc83d223ea6: shr $0x3,%rcx ;*aastore
│││ │││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.16% 0.20% │││ │││ 0x00007fc83d223eaa: movslq %eax,%r10
0.21% 0.15% │││ │││ 0x00007fc83d223ead: lea (%r11,%r10,4),%rdi ;*aastore
│││ │││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.00% 0.03% │││ │││ 0x00007fc83d223eb1: mov %rdi,%r10
0.03% 0.03% │││ │││ 0x00007fc83d223eb4: add $0x14,%r10
0.17% 0.23% │││ │││ 0x00007fc83d223eb8: mov %ecx,(%r10)
0.14% 0.07% │││ │││ 0x00007fc83d223ebb: shr $0x9,%r10
0.02% 0.00% │││ │││ 0x00007fc83d223ebf: mov %r12b,(%r8,%r10,1) ;*aastore
│││ │││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@57 (line 266)
0.02% 0.05% │││ │││ 0x00007fc83d223ec3: mov 0x8(%r12,%rbp,8),%ecx ; implicit exception: dispatches to 0x00007fc83d224685
0.13% 0.17% │││ │││ 0x00007fc83d223ec8: cmp $0xf8019909,%ecx ; {metadata('com/google/re2j/Inst$MatchInst')}
│││ │││ 0x00007fc83d223ece: jne 0x00007fc83d224195
0.11% 0.16% │││ │││ 0x00007fc83d223ed4: lea (%r12,%rbp,8),%r14 ;*invokevirtual add
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.01% 0.02% │││ │││ 0x00007fc83d223ed8: mov 0x18(%r14),%ecx ;*getfield pc
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.02% 0.03% │││ │││ 0x00007fc83d223edc: vmovd %ecx,%xmm1
0.16% 0.21% │││ │││ 0x00007fc83d223ee0: cmp $0x40,%ecx
│││ │││ 0x00007fc83d223ee3: jg 0x00007fc83d224445 ;*if_icmpgt
│││ │││ ; - com.google.re2j.Machine$Queue::contains@3 (line 41)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.13% 0.16% │││ │││ 0x00007fc83d223ee9: mov $0x1,%r10d
0.02% 0.02% │││ │││ 0x00007fc83d223eef: shl %cl,%r10 ;*lshl
│││ │││ ; - com.google.re2j.Machine$Queue::contains@12 (line 42)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.38% 0.38% │││ │││ 0x00007fc83d223ef2: mov %r9,%rcx
0.00% 0.01% │││ │││ 0x00007fc83d223ef5: and %r10,%rcx ;*land
│││ │││ ; - com.google.re2j.Machine$Queue::contains@13 (line 42)
│││ │││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│││ │││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.02% 0.03% │││ │││ 0x00007fc83d223ef8: test %rcx,%rcx
│││╭│││ 0x00007fc83d223efb: jne 0x00007fc83d224062 ;*ifeq
│││││││ ; - com.google.re2j.Machine$Queue::contains@16 (line 42)
│││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.20% 0.17% │││││││ 0x00007fc83d223f01: xor %ebp,%ebp ;*ireturn
│││││││ ; - com.google.re2j.Machine$Queue::contains@24 (line 42)
│││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
│││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.10% 0.13% │││││││↗ 0x00007fc83d223f03: test %rcx,%rcx
││││││││ 0x00007fc83d223f06: jne 0x00007fc83d224481 ;*ifeq
││││││││ ; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.01% 0.03% ││││││││ 0x00007fc83d223f0c: vmovd %xmm1,%ecx
0.03% 0.04% ││││││││ 0x00007fc83d223f10: cmp $0x40,%ecx
││││││││ 0x00007fc83d223f13: jge 0x00007fc83d2244b5 ;*if_icmpge
││││││││ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.16% 0.10% ││││││││ 0x00007fc83d223f19: or %r10,%r9 ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.10% 0.16% ││││││││ 0x00007fc83d223f1c: mov %r9,0x10(%rdx) ;*putfield pcsl
││││││││ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.04% 0.02% ││││││││ 0x00007fc83d223f20: vmovq %xmm2,%r10
0.01% 0.02% ││││││││ 0x00007fc83d223f25: mov 0x3c(%r10),%ebp ;*getfield inst4
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@83 (line 268)
0.16% 0.17% ││││││││ 0x00007fc83d223f29: mov %rdi,%r10
0.10% 0.09% ││││││││ 0x00007fc83d223f2c: add $0x18,%r10
0.02% 0.02% ││││││││ 0x00007fc83d223f30: mov %r14,%rcx
0.02% 0.03% ││││││││ 0x00007fc83d223f33: shr $0x3,%rcx
0.18% 0.12% ││││││││ 0x00007fc83d223f37: mov %ecx,(%r10) ;*aastore
││││││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.11% 0.18% ││││││││ 0x00007fc83d223f3a: mov %eax,%ecx
0.01% 0.01% ││││││││ 0x00007fc83d223f3c: add $0x3,%ecx
0.03% 0.04% ││││││││ 0x00007fc83d223f3f: mov %ecx,0xc(%rdx) ;*putfield size
││││││││ ; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.19% 0.12% ││││││││ 0x00007fc83d223f42: shr $0x9,%r10
0.12% 0.12% ││││││││ 0x00007fc83d223f46: mov %r12b,(%r8,%r10,1) ;*aastore
││││││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@77 (line 267)
0.02% 0.01% ││││││││ 0x00007fc83d223f4a: mov 0x8(%r12,%rbp,8),%ecx ; implicit exception: dispatches to 0x00007fc83d2246ad
0.03% 0.04% ││││││││ 0x00007fc83d223f4f: cmp $0xf8019909,%ecx ; {metadata('com/google/re2j/Inst$MatchInst')}
││││││││ 0x00007fc83d223f55: jne 0x00007fc83d2241c1
0.16% 0.17% ││││││││ 0x00007fc83d223f5b: lea (%r12,%rbp,8),%r14 ;*invokevirtual add
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.08% 0.14% ││││││││ 0x00007fc83d223f5f: mov 0x18(%r14),%ecx ;*getfield pc
││││││││ ; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.01% 0.02% ││││││││ 0x00007fc83d223f63: vmovd %ecx,%xmm0
0.07% 0.05% ││││││││ 0x00007fc83d223f67: cmp $0x40,%ecx
││││││││ 0x00007fc83d223f6a: jg 0x00007fc83d2244f1 ;*if_icmpgt
││││││││ ; - com.google.re2j.Machine$Queue::contains@3 (line 41)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.14% 0.12% ││││││││ 0x00007fc83d223f70: mov $0x1,%r10d
0.13% 0.15% ││││││││ 0x00007fc83d223f76: shl %cl,%r10 ;*lshl
││││││││ ; - com.google.re2j.Machine$Queue::contains@12 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.26% 0.17% ││││││││ 0x00007fc83d223f79: mov %r9,%rcx
0.10% 0.11% ││││││││ 0x00007fc83d223f7c: and %r10,%rcx ;*land
││││││││ ; - com.google.re2j.Machine$Queue::contains@13 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.01% 0.02% ││││││││ 0x00007fc83d223f7f: test %rcx,%rcx
││││││││ 0x00007fc83d223f82: jne 0x00007fc83d22406c ;*ifeq
││││││││ ; - com.google.re2j.Machine$Queue::contains@16 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.03% 0.05% ││││││││ 0x00007fc83d223f88: xor %ebp,%ebp ;*ireturn
││││││││ ; - com.google.re2j.Machine$Queue::contains@24 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.14% 0.11% ││││││││ 0x00007fc83d223f8a: test %rcx,%rcx
││││││││ 0x00007fc83d223f8d: jne 0x00007fc83d22452d ;*ifeq
││││││││ ; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.09% 0.17% ││││││││ 0x00007fc83d223f93: vmovd %xmm0,%ecx
0.02% 0.03% ││││││││ 0x00007fc83d223f97: cmp $0x40,%ecx
││││││││ 0x00007fc83d223f9a: jge 0x00007fc83d224561 ;*if_icmpge
││││││││ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.05% 0.08% ││││││││ 0x00007fc83d223fa0: mov %ebx,0xc(%rdx) ;*putfield size
││││││││ ; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.13% 0.17% ││││││││ 0x00007fc83d223fa3: vmovq %xmm2,%rcx
0.13% 0.23% ││││││││ 0x00007fc83d223fa8: mov 0x40(%rcx),%ebp ;*getfield inst5
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@103 (line 269)
0.02% 0.03% ││││││││ 0x00007fc83d223fab: mov %rdi,%rcx
0.03% 0.05% ││││││││ 0x00007fc83d223fae: add $0x1c,%rcx ;*aastore
││││││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.13% 0.22% ││││││││ 0x00007fc83d223fb2: or %r10,%r9 ;*lor ; - com.google.re2j.Machine$Queue::add@14 (line 52)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.10% 0.16% ││││││││ 0x00007fc83d223fb5: mov %r9,0x10(%rdx) ;*putfield pcsl
││││││││ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.03% 0.03% ││││││││ 0x00007fc83d223fb9: mov %r14,%r10
0.05% 0.05% ││││││││ 0x00007fc83d223fbc: shr $0x3,%r10
0.16% 0.16% ││││││││ 0x00007fc83d223fc0: mov %r10d,(%rcx)
0.13% 0.16% ││││││││ 0x00007fc83d223fc3: mov %rcx,%r10
0.01% 0.04% ││││││││ 0x00007fc83d223fc6: shr $0x9,%r10
0.02% 0.03% ││││││││ 0x00007fc83d223fca: mov %r12b,(%r8,%r10,1) ;*aastore
││││││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@97 (line 268)
0.18% 0.21% ││││││││ 0x00007fc83d223fce: mov 0x8(%r12,%rbp,8),%r10d ; implicit exception: dispatches to 0x00007fc83d2246d5
0.08% 0.17% ││││││││ 0x00007fc83d223fd3: cmp $0xf8019909,%r10d ; {metadata('com/google/re2j/Inst$MatchInst')}
││││││││ 0x00007fc83d223fda: jne 0x00007fc83d2241ed
0.01% 0.01% ││││││││ 0x00007fc83d223fe0: lea (%r12,%rbp,8),%r10 ;*invokevirtual add
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.02% 0.03% ││││││││ 0x00007fc83d223fe4: mov 0x18(%r10),%ecx ;*getfield pc
││││││││ ; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.15% 0.21% ││││││││ 0x00007fc83d223fe8: cmp $0x40,%ecx
││││││││ 0x00007fc83d223feb: jg 0x00007fc83d22459d ;*if_icmpgt
││││││││ ; - com.google.re2j.Machine$Queue::contains@3 (line 41)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.12% 0.16% ││││││││ 0x00007fc83d223ff1: shl %cl,%rsi ;*lshl
││││││││ ; - com.google.re2j.Machine$Queue::contains@12 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.24% 0.29% ││││││││ 0x00007fc83d223ff4: mov %r9,%rbx
0.12% 0.11% ││││││││ 0x00007fc83d223ff7: and %rsi,%rbx ;*land
││││││││ ; - com.google.re2j.Machine$Queue::contains@13 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.02% 0.01% ││││││││ 0x00007fc83d223ffa: test %rbx,%rbx
││││││││ 0x00007fc83d223ffd: jne 0x00007fc83d224076 ;*ifeq
││││││││ ; - com.google.re2j.Machine$Queue::contains@16 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.06% 0.06% ││││││││ 0x00007fc83d223fff: xor %ebp,%ebp ;*ireturn
││││││││ ; - com.google.re2j.Machine$Queue::contains@24 (line 42)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@5 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.16% 0.18% ││││││││ 0x00007fc83d224001: test %rbx,%rbx
││││││││ 0x00007fc83d224004: jne 0x00007fc83d2245c1 ;*ifeq
││││││││ ; - com.google.re2j.Inst$MatchInst::add@8 (line 144)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.12% 0.19% ││││││││ 0x00007fc83d22400a: cmp $0x40,%ecx
││││││││ 0x00007fc83d22400d: jge 0x00007fc83d2245e1 ;*if_icmpge
││││││││ ; - com.google.re2j.Machine$Queue::add@3 (line 51)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.04% 0.02% ││││││││ 0x00007fc83d224013: or %rsi,%r9
0.04% 0.03% ││││││││ 0x00007fc83d224016: mov %r9,0x10(%rdx) ;*putfield pcsl
││││││││ ; - com.google.re2j.Machine$Queue::add@15 (line 52)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@19 (line 147)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.15% 0.13% ││││││││ 0x00007fc83d22401a: add $0x20,%rdi
0.09% 0.14% ││││││││ 0x00007fc83d22401e: shr $0x3,%r10
0.02% 0.01% ││││││││ 0x00007fc83d224022: mov %r10d,(%rdi) ;*aastore
││││││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.04% 0.02% ││││││││ 0x00007fc83d224025: mov %rdi,%r10
0.11% 0.14% ││││││││ 0x00007fc83d224028: add $0x5,%eax
0.18% 0.17% ││││││││ 0x00007fc83d22402b: mov %eax,0xc(%rdx) ;*putfield size
││││││││ ; - com.google.re2j.Machine$Queue::addThread@12 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.01% 0.02% ││││││││ 0x00007fc83d22402e: shr $0x9,%r10
0.03% 0.07% ││││││││ 0x00007fc83d224032: mov %r12b,(%r8,%r10,1) ;*aastore
││││││││ ; - com.google.re2j.Machine$Queue::addThread@16 (line 66)
││││││││ ; - com.google.re2j.Inst$MatchInst::add@72 (line 158)
││││││││ ; - com.google.re2j.Inst$Alt5Inst::add@117 (line 269)
0.14% 0.22% ││││││││ 0x00007fc83d224036: xor %eax,%eax
0.12% 0.18% ││││││││ 0x00007fc83d224038: add $0x70,%rsp
0.02% 0.02% ││││││││ 0x00007fc83d22403c: pop %rbp
0.03% 0.05% ││││││││ 0x00007fc83d22403d: test %eax,0x1856afbd(%rip) # 0x00007fc85578f000
││││││││ ; {poll_return}
0.16% 0.14% ││││││││ 0x00007fc83d224043: retq
↘│││││││ 0x00007fc83d224044: mov $0x1,%ebp
│││╰│││ 0x00007fc83d224049: jmpq 0x00007fc83d223d2d
↘││ │││ 0x00007fc83d22404e: mov $0x1,%ebp
││ ╰││ 0x00007fc83d224053: jmpq 0x00007fc83d223d90
↘│ ││ 0x00007fc83d224058: mov $0x1,%ebp
│ ╰│ 0x00007fc83d22405d: jmpq 0x00007fc83d223e67
↘ │ 0x00007fc83d224062: mov $0x1,%ebp
╰ 0x00007fc83d224067: jmpq 0x00007fc83d223f03
0x00007fc83d22406c: mov $0x1,%ebp
....................................................................................................
16.60% 18.57% <total for region 4>
....[Hottest Region 5]..............................................................................
C2, level 4, com.google.re2j.Machine::step, version 494 (174 bytes)
# parm6: [sp+0xa8] = int
# parm7: [sp+0xb0] = boolean
0x00007fc83d21f880: mov 0x8(%rsi),%r10d
0x00007fc83d21f884: shl $0x3,%r10
0x00007fc83d21f888: cmp %r10,%rax
0x00007fc83d21f88b: jne 0x00007fc83d045e20 ; {runtime_call}
0x00007fc83d21f891: data16 xchg %ax,%ax
0x00007fc83d21f894: nopl 0x0(%rax,%rax,1)
0x00007fc83d21f89c: data16 data16 xchg %ax,%ax
[Verified Entry Point]
0.34% 0.29% 0x00007fc83d21f8a0: mov %eax,-0x14000(%rsp)
0.24% 0.28% 0x00007fc83d21f8a7: push %rbp
0.29% 0.21% 0x00007fc83d21f8a8: sub $0x90,%rsp ;*synchronization entry
; - com.google.re2j.Machine::step@-1 (line 280)
0.21% 0.20% 0x00007fc83d21f8af: mov %edi,0x18(%rsp)
0.23% 0.22% 0x00007fc83d21f8b3: mov %r9d,0x14(%rsp)
0.35% 0.20% 0x00007fc83d21f8b8: mov %r8d,0x10(%rsp)
0.22% 0.16% 0x00007fc83d21f8bd: mov %rcx,%r9
0.07% 0.06% 0x00007fc83d21f8c0: mov %rsi,0x20(%rsp)
0.22% 0.17% 0x00007fc83d21f8c5: mov 0x14(%rsi),%r10d ;*getfield re2
; - com.google.re2j.Machine::step@1 (line 280)
0.10% 0.18% 0x00007fc83d21f8c9: movzbl 0x18(%r12,%r10,8),%r10d ;*getfield longest
; - com.google.re2j.Machine::step@4 (line 280)
; implicit exception: dispatches to 0x00007fc83d22138d
1.39% 1.38% 0x00007fc83d21f8cf: mov %r10d,0x1c(%rsp)
0.29% 0.28% 0x00007fc83d21f8d4: mov %rdx,%r14
0.14% 0.12% 0x00007fc83d21f8d7: mov 0xc(%rdx),%eax ;*getfield size
; - com.google.re2j.Machine::step@10 (line 281)
; implicit exception: dispatches to 0x00007fc83d22139d
0.11% 0.09% 0x00007fc83d21f8da: test %eax,%eax
0x00007fc83d21f8dc: jle 0x00007fc83d21ff7d ;*if_icmpge
; - com.google.re2j.Machine::step@40 (line 286)
0.09% 0.10% 0x00007fc83d21f8e2: mov 0x24(%rdx),%r11d ;*getfield denseThreadsCapture
; - com.google.re2j.Machine::step@28 (line 284)
0.79% 0.81% 0x00007fc83d21f8e6: mov %r11d,0x40(%rsp)
0.24% 0.13% 0x00007fc83d21f8eb: movzbl 0x11(%rsi),%r11d ;*getfield captures
; - com.google.re2j.Machine::step@16 (line 282)
0.08% 0.16% 0x00007fc83d21f8f0: mov 0x20(%rdx),%r10d ;*getfield denseThreadsInstructions
; - com.google.re2j.Machine::step@22 (line 283)
0.16% 0.21% 0x00007fc83d21f8f4: mov %r10d,0x3c(%rsp)
0.27% 0.32% 0x00007fc83d21f8f9: test %r11d,%r11d
0x00007fc83d21f8fc: jne 0x00007fc83d22024d ;*iload
; - com.google.re2j.Machine::step@43 (line 289)
0.11% 0.13% 0x00007fc83d21f902: mov 0xc(%r12,%r10,8),%r8d ;*aaload
; - com.google.re2j.Machine::step@99 (line 299)
; implicit exception: dispatches to 0x00007fc83d22024d
0.62% 0.60% 0x00007fc83d21f907: test %r8d,%r8d
0x00007fc83d21f90a: jbe 0x00007fc83d22024d
0.11% 0.07% 0x00007fc83d21f910: mov %eax,%ecx
0.33% 0.30% 0x00007fc83d21f912: dec %ecx
0.08% 0.14% 0x00007fc83d21f914: cmp %r8d,%ecx
0x00007fc83d21f917: jae 0x00007fc83d22024d ;*iload
; - com.google.re2j.Machine::step@43 (line 289)
0.10% 0.13% 0x00007fc83d21f91d: lea (%r12,%r10,8),%r13 ;*getfield denseThreadsInstructions
; - com.google.re2j.Machine::step@22 (line 283)
0.12% 0.11% 0x00007fc83d21f921: xor %r10d,%r10d
0.27% 0.32% 0x00007fc83d21f924: jmpq 0x00007fc83d21feb4
0x00007fc83d21f929: nopl 0x0(%rax)
1.07% 1.05% 0x00007fc83d21f930: xor %r11d,%r11d
0.19% 0.09% 0x00007fc83d21f933: test %r11d,%r11d
0x00007fc83d21f936: jne 0x00007fc83d21f9dd
1.39% 0.91% 0x00007fc83d21f93c: mov 0xa8(%rsp),%r8d
0.08% 0.08% 0x00007fc83d21f944: mov 0xb0(%rsp),%ebx ;*ifnull
; - com.google.re2j.Machine::step@221 (line 320)
1.02% 1.02% 0x00007fc83d21f94b: mov %r9,%r11
0.05% 0.05% 0x00007fc83d21f94e: jmpq 0x00007fc83d21fe96
0x00007fc83d21f953: cmp $0xf8019909,%r8d ; {metadata('com/google/re2j/Inst$MatchInst')}
0x00007fc83d21f95a: jne 0x00007fc83d2203c1 ;*invokevirtual add
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21f960: mov 0x18(%rax),%r11d ;*getfield pc
; - com.google.re2j.Inst$MatchInst::add@2 (line 144)
; - com.google.re2j.Inst$Alt2Inst::add@57 (line 181)
; - com.google.re2j.Machine::step@-1 (line 280)
0x00007fc83d21f964: cmp $0x40,%r11d
0x00007fc83d21f968: jg 0x00007fc83d220af9 ;*if_icmpgt
....................................................................................................
11.37% 10.57% <total for region 5>
....[Hottest Regions]...............................................................................
28.59% 29.86% C2, level 4 com.google.re2j.Machine::match, version 541 (1534 bytes)
17.51% 18.10% C2, level 4 com.google.re2j.Machine::step, version 494 (195 bytes)
17.38% 14.97% C2, level 4 com.google.re2j.Machine::step, version 494 (1013 bytes)
16.60% 18.57% C2, level 4 com.google.re2j.Inst$Alt5Inst::add, version 511 (867 bytes)
11.37% 10.57% C2, level 4 com.google.re2j.Machine::step, version 494 (174 bytes)
2.77% 2.53% C2, level 4 com.google.re2j.Machine::step, version 494 (61 bytes)
1.54% 1.53% [kernel.kallsyms] [unknown] (6 bytes)
1.39% 1.52% C2, level 4 com.google.re2j.Machine::match, version 541 (163 bytes)
0.15% 0.11% C2, level 4 com.google.re2j.Pattern::find, version 546 (12 bytes)
0.13% 0.07% C2, level 4 com.google.re2j.Pattern::find, version 546 (28 bytes)
0.10% 0.04% C2, level 4 com.google.re2j.Pattern::find, version 546 (8 bytes)
0.10% [kernel.kallsyms] [unknown] (45 bytes)
0.10% 0.00% [kernel.kallsyms] [unknown] (18 bytes)
0.09% 0.04% C2, level 4 com.google.re2j.Pattern::find, version 546 (0 bytes)
0.08% 0.01% [kernel.kallsyms] [unknown] (0 bytes)
0.06% 0.09% C2, level 4 com.google.re2j.Machine::match, version 541 (185 bytes)
0.05% 0.04% C2, level 4 com.google.re2j.Machine::match, version 541 (185 bytes)
0.05% 0.01% C2, level 4 com.google.re2j.Machine::match, version 541 (89 bytes)
0.04% C2, level 4 com.google.re2j.Pattern::find, version 546 (36 bytes)
0.03% 0.08% libjvm.so _ZN13RelocIterator10initializeEP7nmethodPhS2_ (102 bytes)
1.85% 1.84% <...other 413 warm regions...>
....................................................................................................
100.00% 100.00% <totals>
....[Hottest Methods (after inlining)]..............................................................
49.06% 46.18% C2, level 4 com.google.re2j.Machine::step, version 494
30.17% 31.54% C2, level 4 com.google.re2j.Machine::match, version 541
16.60% 18.57% C2, level 4 com.google.re2j.Inst$Alt5Inst::add, version 511
2.59% 2.32% [kernel.kallsyms] [unknown]
0.65% 0.32% C2, level 4 com.google.re2j.Pattern::find, version 546
0.06% 0.01% C2, level 4 com.github.arnaudroger.re2j.generated.Re2jFindRegex_testCombine_jmhTest::testCombine_thrpt_jmhStub, version 620
0.06% 0.05% C2, level 4 java.util.Collections::shuffle, version 567
0.06% 0.02% [vdso] [unknown]
0.04% 0.02% hsdis-amd64.so [unknown]
0.03% 0.08% libjvm.so _ZN13RelocIterator10initializeEP7nmethodPhS2_
0.03% 0.09% libjvm.so _ZN10fileStream5writeEPKcm
0.02% 0.01% libjvm.so _ZN12outputStream15update_positionEPKcm
0.02% 0.06% libc-2.26.so vfprintf
0.02% 0.01% libc-2.26.so __strlen_avx2
0.02% 0.03% libpthread-2.26.so __pthread_enable_asynccancel
0.02% 0.01% libjvm.so _ZN19GenericTaskQueueSetI17OverflowTaskQueueI8StarTaskL10MemoryType1ELj131072EELS2_1EE15steal_best_of_2EjPiRS1_
0.02% 0.01% libc-2.26.so __clock_gettime
0.02% 0.02% libjvm.so _ZN13xmlTextStream5writeEPKcm
0.01% 0.03% libc-2.26.so _IO_default_xsputn
0.01% 0.05% libc-2.26.so _IO_fwrite
0.45% 0.23% <...other 75 warm methods...>
....................................................................................................
100.00% 99.69% <totals>
....[Distribution by Source]........................................................................
96.63% 96.67% C2, level 4
2.59% 2.32% [kernel.kallsyms]
0.39% 0.59% libjvm.so
0.18% 0.29% libc-2.26.so
0.06% 0.02% [vdso]
0.05% 0.03% hsdis-amd64.so
0.05% 0.06% libpthread-2.26.so
0.02% 0.01% interpreter
0.01% C1, level 3
0.00% runtime stub
0.00% libzip.so
....................................................................................................
100.00% 100.00% <totals>
# Run complete. Total time: 00:00:45
Benchmark Mode Cnt Score Error Units
Re2jFindRegex.testCombine thrpt 20 9239.172 ± 201.694 ops/s
Re2jFindRegex.testCombine:·asm thrpt NaN ---
|
cat.asm | danilocapkob/xv6plus | 1 | 175804 | <reponame>danilocapkob/xv6plus<gh_stars>1-10
_cat: file format elf32-i386-freebsd
Disassembly of section .text:
00000000 <cat>:
char buf[512];
void
cat(int fd)
{
0: 55 push %ebp
1: 89 e5 mov %esp,%ebp
3: 83 ec 28 sub $0x28,%esp
int n;
while((n = read(fd, buf, sizeof(buf))) > 0)
6: eb 1b jmp 23 <cat+0x23>
write(1, buf, n);
8: 8b 45 fc mov 0xfffffffc(%ebp),%eax
b: 89 44 24 08 mov %eax,0x8(%esp)
f: c7 44 24 04 e0 11 00 movl $0x11e0,0x4(%esp)
16: 00
17: c7 04 24 01 00 00 00 movl $0x1,(%esp)
1e: e8 c1 03 00 00 call 3e4 <write>
23: c7 44 24 08 00 02 00 movl $0x200,0x8(%esp)
2a: 00
2b: c7 44 24 04 e0 11 00 movl $0x11e0,0x4(%esp)
32: 00
33: 8b 45 08 mov 0x8(%ebp),%eax
36: 89 04 24 mov %eax,(%esp)
39: e8 9e 03 00 00 call 3dc <read>
3e: 89 45 fc mov %eax,0xfffffffc(%ebp)
41: 83 7d fc 00 cmpl $0x0,0xfffffffc(%ebp)
45: 7f c1 jg 8 <cat+0x8>
if(n < 0){
47: 83 7d fc 00 cmpl $0x0,0xfffffffc(%ebp)
4b: 79 19 jns 66 <cat+0x66>
printf(1, "cat: read error\n");
4d: c7 44 24 04 54 11 00 movl $0x1154,0x4(%esp)
54: 00
55: c7 04 24 01 00 00 00 movl $0x1,(%esp)
5c: e8 6f 05 00 00 call 5d0 <printf>
exit();
61: e8 5e 03 00 00 call 3c4 <exit>
}
}
66: c9 leave
67: c3 ret
68: 90 nop
69: 8d b4 26 00 00 00 00 lea 0x0(%esi),%esi
00000070 <main>:
int
main(int argc, char *argv[])
{
70: 8d 4c 24 04 lea 0x4(%esp),%ecx
74: 83 e4 f0 and $0xfffffff0,%esp
77: ff 71 fc pushl 0xfffffffc(%ecx)
7a: 55 push %ebp
7b: 89 e5 mov %esp,%ebp
7d: 51 push %ecx
7e: 83 ec 24 sub $0x24,%esp
81: 89 4d e8 mov %ecx,0xffffffe8(%ebp)
int fd, i;
if(argc <= 1){
84: 8b 45 e8 mov 0xffffffe8(%ebp),%eax
87: 83 38 01 cmpl $0x1,(%eax)
8a: 7f 11 jg 9d <main+0x2d>
cat(0);
8c: c7 04 24 00 00 00 00 movl $0x0,(%esp)
93: e8 68 ff ff ff call 0 <cat>
exit();
98: e8 27 03 00 00 call 3c4 <exit>
}
for(i = 1; i < argc; i++){
9d: c7 45 f8 01 00 00 00 movl $0x1,0xfffffff8(%ebp)
a4: eb 6c jmp 112 <main+0xa2>
if((fd = open(argv[i], 0)) < 0){
a6: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
a9: c1 e0 02 shl $0x2,%eax
ac: 8b 55 e8 mov 0xffffffe8(%ebp),%edx
af: 03 42 04 add 0x4(%edx),%eax
b2: 8b 00 mov (%eax),%eax
b4: c7 44 24 04 00 00 00 movl $0x0,0x4(%esp)
bb: 00
bc: 89 04 24 mov %eax,(%esp)
bf: e8 40 03 00 00 call 404 <open>
c4: 89 45 f4 mov %eax,0xfffffff4(%ebp)
c7: 83 7d f4 00 cmpl $0x0,0xfffffff4(%ebp)
cb: 79 2b jns f8 <main+0x88>
printf(1, "cat: cannot open %s\n", argv[i]);
cd: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
d0: c1 e0 02 shl $0x2,%eax
d3: 8b 55 e8 mov 0xffffffe8(%ebp),%edx
d6: 03 42 04 add 0x4(%edx),%eax
d9: 8b 00 mov (%eax),%eax
db: 89 44 24 08 mov %eax,0x8(%esp)
df: c7 44 24 04 65 11 00 movl $0x1165,0x4(%esp)
e6: 00
e7: c7 04 24 01 00 00 00 movl $0x1,(%esp)
ee: e8 dd 04 00 00 call 5d0 <printf>
exit();
f3: e8 cc 02 00 00 call 3c4 <exit>
}
cat(fd);
f8: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
fb: 89 04 24 mov %eax,(%esp)
fe: e8 fd fe ff ff call 0 <cat>
close(fd);
103: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
106: 89 04 24 mov %eax,(%esp)
109: e8 de 02 00 00 call 3ec <close>
10e: 83 45 f8 01 addl $0x1,0xfffffff8(%ebp)
112: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
115: 8b 55 e8 mov 0xffffffe8(%ebp),%edx
118: 3b 02 cmp (%edx),%eax
11a: 7c 8a jl a6 <main+0x36>
}
exit();
11c: e8 a3 02 00 00 call 3c4 <exit>
121: 90 nop
122: 90 nop
123: 90 nop
124: 90 nop
125: 90 nop
126: 90 nop
127: 90 nop
128: 90 nop
129: 90 nop
12a: 90 nop
12b: 90 nop
12c: 90 nop
12d: 90 nop
12e: 90 nop
12f: 90 nop
00000130 <strcpy>:
#include "user.h"
char*
strcpy(char *s, char *t)
{
130: 55 push %ebp
131: 89 e5 mov %esp,%ebp
133: 83 ec 10 sub $0x10,%esp
char *os;
os = s;
136: 8b 45 08 mov 0x8(%ebp),%eax
139: 89 45 fc mov %eax,0xfffffffc(%ebp)
while((*s++ = *t++) != 0)
13c: 8b 45 0c mov 0xc(%ebp),%eax
13f: 0f b6 10 movzbl (%eax),%edx
142: 8b 45 08 mov 0x8(%ebp),%eax
145: 88 10 mov %dl,(%eax)
147: 8b 45 08 mov 0x8(%ebp),%eax
14a: 0f b6 00 movzbl (%eax),%eax
14d: 84 c0 test %al,%al
14f: 0f 95 c0 setne %al
152: 83 45 08 01 addl $0x1,0x8(%ebp)
156: 83 45 0c 01 addl $0x1,0xc(%ebp)
15a: 84 c0 test %al,%al
15c: 75 de jne 13c <strcpy+0xc>
;
return os;
15e: 8b 45 fc mov 0xfffffffc(%ebp),%eax
}
161: c9 leave
162: c3 ret
163: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
169: 8d bc 27 00 00 00 00 lea 0x0(%edi),%edi
00000170 <strcmp>:
int
strcmp(const char *p, const char *q)
{
170: 55 push %ebp
171: 89 e5 mov %esp,%ebp
while(*p && *p == *q)
173: eb 08 jmp 17d <strcmp+0xd>
p++, q++;
175: 83 45 08 01 addl $0x1,0x8(%ebp)
179: 83 45 0c 01 addl $0x1,0xc(%ebp)
17d: 8b 45 08 mov 0x8(%ebp),%eax
180: 0f b6 00 movzbl (%eax),%eax
183: 84 c0 test %al,%al
185: 74 10 je 197 <strcmp+0x27>
187: 8b 45 08 mov 0x8(%ebp),%eax
18a: 0f b6 10 movzbl (%eax),%edx
18d: 8b 45 0c mov 0xc(%ebp),%eax
190: 0f b6 00 movzbl (%eax),%eax
193: 38 c2 cmp %al,%dl
195: 74 de je 175 <strcmp+0x5>
return (uchar)*p - (uchar)*q;
197: 8b 45 08 mov 0x8(%ebp),%eax
19a: 0f b6 00 movzbl (%eax),%eax
19d: 0f b6 d0 movzbl %al,%edx
1a0: 8b 45 0c mov 0xc(%ebp),%eax
1a3: 0f b6 00 movzbl (%eax),%eax
1a6: 0f b6 c0 movzbl %al,%eax
1a9: 89 d1 mov %edx,%ecx
1ab: 29 c1 sub %eax,%ecx
1ad: 89 c8 mov %ecx,%eax
}
1af: 5d pop %ebp
1b0: c3 ret
1b1: eb 0d jmp 1c0 <strlen>
1b3: 90 nop
1b4: 90 nop
1b5: 90 nop
1b6: 90 nop
1b7: 90 nop
1b8: 90 nop
1b9: 90 nop
1ba: 90 nop
1bb: 90 nop
1bc: 90 nop
1bd: 90 nop
1be: 90 nop
1bf: 90 nop
000001c0 <strlen>:
uint
strlen(char *s)
{
1c0: 55 push %ebp
1c1: 89 e5 mov %esp,%ebp
1c3: 83 ec 10 sub $0x10,%esp
int n;
for(n = 0; s[n]; n++)
1c6: c7 45 fc 00 00 00 00 movl $0x0,0xfffffffc(%ebp)
1cd: eb 04 jmp 1d3 <strlen+0x13>
1cf: 83 45 fc 01 addl $0x1,0xfffffffc(%ebp)
1d3: 8b 45 fc mov 0xfffffffc(%ebp),%eax
1d6: 03 45 08 add 0x8(%ebp),%eax
1d9: 0f b6 00 movzbl (%eax),%eax
1dc: 84 c0 test %al,%al
1de: 75 ef jne 1cf <strlen+0xf>
;
return n;
1e0: 8b 45 fc mov 0xfffffffc(%ebp),%eax
}
1e3: c9 leave
1e4: c3 ret
1e5: 8d 74 26 00 lea 0x0(%esi),%esi
1e9: 8d bc 27 00 00 00 00 lea 0x0(%edi),%edi
000001f0 <memset>:
void*
memset(void *dst, int c, uint n)
{
1f0: 55 push %ebp
1f1: 89 e5 mov %esp,%ebp
1f3: 83 ec 10 sub $0x10,%esp
char *d;
d = dst;
1f6: 8b 45 08 mov 0x8(%ebp),%eax
1f9: 89 45 fc mov %eax,0xfffffffc(%ebp)
while(n-- > 0)
1fc: eb 0e jmp 20c <memset+0x1c>
*d++ = c;
1fe: 8b 45 0c mov 0xc(%ebp),%eax
201: 89 c2 mov %eax,%edx
203: 8b 45 fc mov 0xfffffffc(%ebp),%eax
206: 88 10 mov %dl,(%eax)
208: 83 45 fc 01 addl $0x1,0xfffffffc(%ebp)
20c: 83 6d 10 01 subl $0x1,0x10(%ebp)
210: 83 7d 10 ff cmpl $0xffffffff,0x10(%ebp)
214: 75 e8 jne 1fe <memset+0xe>
return dst;
216: 8b 45 08 mov 0x8(%ebp),%eax
}
219: c9 leave
21a: c3 ret
21b: 90 nop
21c: 8d 74 26 00 lea 0x0(%esi),%esi
00000220 <strchr>:
char*
strchr(const char *s, char c)
{
220: 55 push %ebp
221: 89 e5 mov %esp,%ebp
223: 83 ec 08 sub $0x8,%esp
226: 8b 45 0c mov 0xc(%ebp),%eax
229: 88 45 fc mov %al,0xfffffffc(%ebp)
for(; *s; s++)
22c: eb 17 jmp 245 <strchr+0x25>
if(*s == c)
22e: 8b 45 08 mov 0x8(%ebp),%eax
231: 0f b6 00 movzbl (%eax),%eax
234: 3a 45 fc cmp 0xfffffffc(%ebp),%al
237: 75 08 jne 241 <strchr+0x21>
return (char*) s;
239: 8b 45 08 mov 0x8(%ebp),%eax
23c: 89 45 f8 mov %eax,0xfffffff8(%ebp)
23f: eb 15 jmp 256 <strchr+0x36>
241: 83 45 08 01 addl $0x1,0x8(%ebp)
245: 8b 45 08 mov 0x8(%ebp),%eax
248: 0f b6 00 movzbl (%eax),%eax
24b: 84 c0 test %al,%al
24d: 75 df jne 22e <strchr+0xe>
return 0;
24f: c7 45 f8 00 00 00 00 movl $0x0,0xfffffff8(%ebp)
256: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
}
259: c9 leave
25a: c3 ret
25b: 90 nop
25c: 8d 74 26 00 lea 0x0(%esi),%esi
00000260 <gets>:
char*
gets(char *buf, int max)
{
260: 55 push %ebp
261: 89 e5 mov %esp,%ebp
263: 83 ec 28 sub $0x28,%esp
int i, cc;
char c;
for(i=0; i+1 < max; ){
266: c7 45 f8 00 00 00 00 movl $0x0,0xfffffff8(%ebp)
26d: eb 46 jmp 2b5 <gets+0x55>
cc = read(0, &c, 1);
26f: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
276: 00
277: 8d 45 f7 lea 0xfffffff7(%ebp),%eax
27a: 89 44 24 04 mov %eax,0x4(%esp)
27e: c7 04 24 00 00 00 00 movl $0x0,(%esp)
285: e8 52 01 00 00 call 3dc <read>
28a: 89 45 fc mov %eax,0xfffffffc(%ebp)
if(cc < 1)
28d: 83 7d fc 00 cmpl $0x0,0xfffffffc(%ebp)
291: 7e 2d jle 2c0 <gets+0x60>
break;
buf[i++] = c;
293: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
296: 89 c2 mov %eax,%edx
298: 03 55 08 add 0x8(%ebp),%edx
29b: 0f b6 45 f7 movzbl 0xfffffff7(%ebp),%eax
29f: 88 02 mov %al,(%edx)
2a1: 83 45 f8 01 addl $0x1,0xfffffff8(%ebp)
if(c == '\n' || c == '\r')
2a5: 0f b6 45 f7 movzbl 0xfffffff7(%ebp),%eax
2a9: 3c 0a cmp $0xa,%al
2ab: 74 13 je 2c0 <gets+0x60>
2ad: 0f b6 45 f7 movzbl 0xfffffff7(%ebp),%eax
2b1: 3c 0d cmp $0xd,%al
2b3: 74 0b je 2c0 <gets+0x60>
2b5: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
2b8: 83 c0 01 add $0x1,%eax
2bb: 3b 45 0c cmp 0xc(%ebp),%eax
2be: 7c af jl 26f <gets+0xf>
break;
}
buf[i] = '\0';
2c0: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
2c3: 03 45 08 add 0x8(%ebp),%eax
2c6: c6 00 00 movb $0x0,(%eax)
return buf;
2c9: 8b 45 08 mov 0x8(%ebp),%eax
}
2cc: c9 leave
2cd: c3 ret
2ce: 89 f6 mov %esi,%esi
000002d0 <stat>:
int
stat(char *n, struct stat *st)
{
2d0: 55 push %ebp
2d1: 89 e5 mov %esp,%ebp
2d3: 83 ec 28 sub $0x28,%esp
int fd;
int r;
fd = open(n, O_RDONLY);
2d6: c7 44 24 04 00 00 00 movl $0x0,0x4(%esp)
2dd: 00
2de: 8b 45 08 mov 0x8(%ebp),%eax
2e1: 89 04 24 mov %eax,(%esp)
2e4: e8 1b 01 00 00 call 404 <open>
2e9: 89 45 f8 mov %eax,0xfffffff8(%ebp)
if(fd < 0)
2ec: 83 7d f8 00 cmpl $0x0,0xfffffff8(%ebp)
2f0: 79 09 jns 2fb <stat+0x2b>
return -1;
2f2: c7 45 ec ff ff ff ff movl $0xffffffff,0xffffffec(%ebp)
2f9: eb 26 jmp 321 <stat+0x51>
r = fstat(fd, st);
2fb: 8b 45 0c mov 0xc(%ebp),%eax
2fe: 89 44 24 04 mov %eax,0x4(%esp)
302: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
305: 89 04 24 mov %eax,(%esp)
308: e8 0f 01 00 00 call 41c <fstat>
30d: 89 45 fc mov %eax,0xfffffffc(%ebp)
close(fd);
310: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
313: 89 04 24 mov %eax,(%esp)
316: e8 d1 00 00 00 call 3ec <close>
return r;
31b: 8b 45 fc mov 0xfffffffc(%ebp),%eax
31e: 89 45 ec mov %eax,0xffffffec(%ebp)
321: 8b 45 ec mov 0xffffffec(%ebp),%eax
}
324: c9 leave
325: c3 ret
326: 8d 76 00 lea 0x0(%esi),%esi
329: 8d bc 27 00 00 00 00 lea 0x0(%edi),%edi
00000330 <atoi>:
int
atoi(const char *s)
{
330: 55 push %ebp
331: 89 e5 mov %esp,%ebp
333: 83 ec 10 sub $0x10,%esp
int n;
n = 0;
336: c7 45 fc 00 00 00 00 movl $0x0,0xfffffffc(%ebp)
while('0' <= *s && *s <= '9')
33d: eb 24 jmp 363 <atoi+0x33>
n = n*10 + *s++ - '0';
33f: 8b 55 fc mov 0xfffffffc(%ebp),%edx
342: 89 d0 mov %edx,%eax
344: c1 e0 02 shl $0x2,%eax
347: 01 d0 add %edx,%eax
349: 01 c0 add %eax,%eax
34b: 89 c2 mov %eax,%edx
34d: 8b 45 08 mov 0x8(%ebp),%eax
350: 0f b6 00 movzbl (%eax),%eax
353: 0f be c0 movsbl %al,%eax
356: 8d 04 02 lea (%edx,%eax,1),%eax
359: 83 e8 30 sub $0x30,%eax
35c: 89 45 fc mov %eax,0xfffffffc(%ebp)
35f: 83 45 08 01 addl $0x1,0x8(%ebp)
363: 8b 45 08 mov 0x8(%ebp),%eax
366: 0f b6 00 movzbl (%eax),%eax
369: 3c 2f cmp $0x2f,%al
36b: 7e 0a jle 377 <atoi+0x47>
36d: 8b 45 08 mov 0x8(%ebp),%eax
370: 0f b6 00 movzbl (%eax),%eax
373: 3c 39 cmp $0x39,%al
375: 7e c8 jle 33f <atoi+0xf>
return n;
377: 8b 45 fc mov 0xfffffffc(%ebp),%eax
}
37a: c9 leave
37b: c3 ret
37c: 8d 74 26 00 lea 0x0(%esi),%esi
00000380 <memmove>:
void*
memmove(void *vdst, void *vsrc, int n)
{
380: 55 push %ebp
381: 89 e5 mov %esp,%ebp
383: 83 ec 10 sub $0x10,%esp
char *dst, *src;
dst = vdst;
386: 8b 45 08 mov 0x8(%ebp),%eax
389: 89 45 f8 mov %eax,0xfffffff8(%ebp)
src = vsrc;
38c: 8b 45 0c mov 0xc(%ebp),%eax
38f: 89 45 fc mov %eax,0xfffffffc(%ebp)
while(n-- > 0)
392: eb 13 jmp 3a7 <memmove+0x27>
*dst++ = *src++;
394: 8b 45 fc mov 0xfffffffc(%ebp),%eax
397: 0f b6 10 movzbl (%eax),%edx
39a: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
39d: 88 10 mov %dl,(%eax)
39f: 83 45 f8 01 addl $0x1,0xfffffff8(%ebp)
3a3: 83 45 fc 01 addl $0x1,0xfffffffc(%ebp)
3a7: 83 7d 10 00 cmpl $0x0,0x10(%ebp)
3ab: 0f 9f c0 setg %al
3ae: 83 6d 10 01 subl $0x1,0x10(%ebp)
3b2: 84 c0 test %al,%al
3b4: 75 de jne 394 <memmove+0x14>
return vdst;
3b6: 8b 45 08 mov 0x8(%ebp),%eax
}
3b9: c9 leave
3ba: c3 ret
3bb: 90 nop
000003bc <fork>:
3bc: b8 01 00 00 00 mov $0x1,%eax
3c1: cd 30 int $0x30
3c3: c3 ret
000003c4 <exit>:
3c4: b8 02 00 00 00 mov $0x2,%eax
3c9: cd 30 int $0x30
3cb: c3 ret
000003cc <wait>:
3cc: b8 03 00 00 00 mov $0x3,%eax
3d1: cd 30 int $0x30
3d3: c3 ret
000003d4 <pipe>:
3d4: b8 04 00 00 00 mov $0x4,%eax
3d9: cd 30 int $0x30
3db: c3 ret
000003dc <read>:
3dc: b8 06 00 00 00 mov $0x6,%eax
3e1: cd 30 int $0x30
3e3: c3 ret
000003e4 <write>:
3e4: b8 05 00 00 00 mov $0x5,%eax
3e9: cd 30 int $0x30
3eb: c3 ret
000003ec <close>:
3ec: b8 07 00 00 00 mov $0x7,%eax
3f1: cd 30 int $0x30
3f3: c3 ret
000003f4 <kill>:
3f4: b8 08 00 00 00 mov $0x8,%eax
3f9: cd 30 int $0x30
3fb: c3 ret
000003fc <exec>:
3fc: b8 09 00 00 00 mov $0x9,%eax
401: cd 30 int $0x30
403: c3 ret
00000404 <open>:
404: b8 0a 00 00 00 mov $0xa,%eax
409: cd 30 int $0x30
40b: c3 ret
0000040c <mknod>:
40c: b8 0b 00 00 00 mov $0xb,%eax
411: cd 30 int $0x30
413: c3 ret
00000414 <unlink>:
414: b8 0c 00 00 00 mov $0xc,%eax
419: cd 30 int $0x30
41b: c3 ret
0000041c <fstat>:
41c: b8 0d 00 00 00 mov $0xd,%eax
421: cd 30 int $0x30
423: c3 ret
00000424 <link>:
424: b8 0e 00 00 00 mov $0xe,%eax
429: cd 30 int $0x30
42b: c3 ret
0000042c <mkdir>:
42c: b8 0f 00 00 00 mov $0xf,%eax
431: cd 30 int $0x30
433: c3 ret
00000434 <chdir>:
434: b8 10 00 00 00 mov $0x10,%eax
439: cd 30 int $0x30
43b: c3 ret
0000043c <dup>:
43c: b8 11 00 00 00 mov $0x11,%eax
441: cd 30 int $0x30
443: c3 ret
00000444 <getpid>:
444: b8 12 00 00 00 mov $0x12,%eax
449: cd 30 int $0x30
44b: c3 ret
0000044c <sbrk>:
44c: b8 13 00 00 00 mov $0x13,%eax
451: cd 30 int $0x30
453: c3 ret
00000454 <sleep>:
454: b8 14 00 00 00 mov $0x14,%eax
459: cd 30 int $0x30
45b: c3 ret
0000045c <upmsec>:
45c: b8 15 00 00 00 mov $0x15,%eax
461: cd 30 int $0x30
463: c3 ret
00000464 <socket>:
464: b8 16 00 00 00 mov $0x16,%eax
469: cd 30 int $0x30
46b: c3 ret
0000046c <bind>:
46c: b8 17 00 00 00 mov $0x17,%eax
471: cd 30 int $0x30
473: c3 ret
00000474 <listen>:
474: b8 18 00 00 00 mov $0x18,%eax
479: cd 30 int $0x30
47b: c3 ret
0000047c <accept>:
47c: b8 19 00 00 00 mov $0x19,%eax
481: cd 30 int $0x30
483: c3 ret
00000484 <recv>:
484: b8 1a 00 00 00 mov $0x1a,%eax
489: cd 30 int $0x30
48b: c3 ret
0000048c <recvfrom>:
48c: b8 1b 00 00 00 mov $0x1b,%eax
491: cd 30 int $0x30
493: c3 ret
00000494 <send>:
494: b8 1c 00 00 00 mov $0x1c,%eax
499: cd 30 int $0x30
49b: c3 ret
0000049c <sendto>:
49c: b8 1d 00 00 00 mov $0x1d,%eax
4a1: cd 30 int $0x30
4a3: c3 ret
000004a4 <shutdown>:
4a4: b8 1e 00 00 00 mov $0x1e,%eax
4a9: cd 30 int $0x30
4ab: c3 ret
000004ac <getsockopt>:
4ac: b8 1f 00 00 00 mov $0x1f,%eax
4b1: cd 30 int $0x30
4b3: c3 ret
000004b4 <setsockopt>:
4b4: b8 20 00 00 00 mov $0x20,%eax
4b9: cd 30 int $0x30
4bb: c3 ret
000004bc <sockclose>:
4bc: b8 21 00 00 00 mov $0x21,%eax
4c1: cd 30 int $0x30
4c3: c3 ret
000004c4 <connect>:
4c4: b8 22 00 00 00 mov $0x22,%eax
4c9: cd 30 int $0x30
4cb: c3 ret
000004cc <getpeername>:
4cc: b8 23 00 00 00 mov $0x23,%eax
4d1: cd 30 int $0x30
4d3: c3 ret
000004d4 <getsockname>:
4d4: b8 24 00 00 00 mov $0x24,%eax
4d9: cd 30 int $0x30
4db: c3 ret
4dc: 90 nop
4dd: 90 nop
4de: 90 nop
4df: 90 nop
000004e0 <putc>:
#include "user.h"
void
putc(int fd, char c)
{
4e0: 55 push %ebp
4e1: 89 e5 mov %esp,%ebp
4e3: 83 ec 18 sub $0x18,%esp
4e6: 8b 45 0c mov 0xc(%ebp),%eax
4e9: 88 45 fc mov %al,0xfffffffc(%ebp)
write(fd, &c, 1);
4ec: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
4f3: 00
4f4: 8d 45 fc lea 0xfffffffc(%ebp),%eax
4f7: 89 44 24 04 mov %eax,0x4(%esp)
4fb: 8b 45 08 mov 0x8(%ebp),%eax
4fe: 89 04 24 mov %eax,(%esp)
501: e8 de fe ff ff call 3e4 <write>
}
506: c9 leave
507: c3 ret
508: 90 nop
509: 8d b4 26 00 00 00 00 lea 0x0(%esi),%esi
00000510 <printint>:
static void
printint(int fd, int xx, int base, int sgn)
{
510: 55 push %ebp
511: 89 e5 mov %esp,%ebp
513: 53 push %ebx
514: 83 ec 34 sub $0x34,%esp
static char digits[] = "0123456789ABCDEF";
char buf[16];
int i, neg;
uint x;
neg = 0;
517: c7 45 f4 00 00 00 00 movl $0x0,0xfffffff4(%ebp)
if(sgn && xx < 0){
51e: 83 7d 14 00 cmpl $0x0,0x14(%ebp)
522: 74 17 je 53b <printint+0x2b>
524: 83 7d 0c 00 cmpl $0x0,0xc(%ebp)
528: 79 11 jns 53b <printint+0x2b>
neg = 1;
52a: c7 45 f4 01 00 00 00 movl $0x1,0xfffffff4(%ebp)
x = -xx;
531: 8b 45 0c mov 0xc(%ebp),%eax
534: f7 d8 neg %eax
536: 89 45 f8 mov %eax,0xfffffff8(%ebp)
539: eb 06 jmp 541 <printint+0x31>
} else {
x = xx;
53b: 8b 45 0c mov 0xc(%ebp),%eax
53e: 89 45 f8 mov %eax,0xfffffff8(%ebp)
}
i = 0;
541: c7 45 f0 00 00 00 00 movl $0x0,0xfffffff0(%ebp)
do{
buf[i++] = digits[x % base];
548: 8b 4d f0 mov 0xfffffff0(%ebp),%ecx
54b: 8b 55 10 mov 0x10(%ebp),%edx
54e: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
551: 89 d3 mov %edx,%ebx
553: ba 00 00 00 00 mov $0x0,%edx
558: f7 f3 div %ebx
55a: 89 d0 mov %edx,%eax
55c: 0f b6 80 98 11 00 00 movzbl 0x1198(%eax),%eax
563: 88 44 0d e0 mov %al,0xffffffe0(%ebp,%ecx,1)
567: 83 45 f0 01 addl $0x1,0xfffffff0(%ebp)
}while((x /= base) != 0);
56b: 8b 55 10 mov 0x10(%ebp),%edx
56e: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
571: 89 d1 mov %edx,%ecx
573: ba 00 00 00 00 mov $0x0,%edx
578: f7 f1 div %ecx
57a: 89 45 f8 mov %eax,0xfffffff8(%ebp)
57d: 83 7d f8 00 cmpl $0x0,0xfffffff8(%ebp)
581: 75 c5 jne 548 <printint+0x38>
if(neg)
583: 83 7d f4 00 cmpl $0x0,0xfffffff4(%ebp)
587: 74 28 je 5b1 <printint+0xa1>
buf[i++] = '-';
589: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
58c: c6 44 05 e0 2d movb $0x2d,0xffffffe0(%ebp,%eax,1)
591: 83 45 f0 01 addl $0x1,0xfffffff0(%ebp)
while(--i >= 0)
595: eb 1a jmp 5b1 <printint+0xa1>
putc(fd, buf[i]);
597: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
59a: 0f b6 44 05 e0 movzbl 0xffffffe0(%ebp,%eax,1),%eax
59f: 0f be c0 movsbl %al,%eax
5a2: 89 44 24 04 mov %eax,0x4(%esp)
5a6: 8b 45 08 mov 0x8(%ebp),%eax
5a9: 89 04 24 mov %eax,(%esp)
5ac: e8 2f ff ff ff call 4e0 <putc>
5b1: 83 6d f0 01 subl $0x1,0xfffffff0(%ebp)
5b5: 83 7d f0 00 cmpl $0x0,0xfffffff0(%ebp)
5b9: 79 dc jns 597 <printint+0x87>
}
5bb: 83 c4 34 add $0x34,%esp
5be: 5b pop %ebx
5bf: 5d pop %ebp
5c0: c3 ret
5c1: eb 0d jmp 5d0 <printf>
5c3: 90 nop
5c4: 90 nop
5c5: 90 nop
5c6: 90 nop
5c7: 90 nop
5c8: 90 nop
5c9: 90 nop
5ca: 90 nop
5cb: 90 nop
5cc: 90 nop
5cd: 90 nop
5ce: 90 nop
5cf: 90 nop
000005d0 <printf>:
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
5d0: 55 push %ebp
5d1: 89 e5 mov %esp,%ebp
5d3: 83 ec 38 sub $0x38,%esp
char *s;
int c, i, state;
uint *ap;
state = 0;
5d6: c7 45 f8 00 00 00 00 movl $0x0,0xfffffff8(%ebp)
ap = (uint*)(void*)&fmt + 1;
5dd: 8d 45 0c lea 0xc(%ebp),%eax
5e0: 83 c0 04 add $0x4,%eax
5e3: 89 45 fc mov %eax,0xfffffffc(%ebp)
for(i = 0; fmt[i]; i++){
5e6: c7 45 f4 00 00 00 00 movl $0x0,0xfffffff4(%ebp)
5ed: e9 7b 01 00 00 jmp 76d <printf+0x19d>
c = fmt[i] & 0xff;
5f2: 8b 55 0c mov 0xc(%ebp),%edx
5f5: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
5f8: 8d 04 02 lea (%edx,%eax,1),%eax
5fb: 0f b6 00 movzbl (%eax),%eax
5fe: 0f be c0 movsbl %al,%eax
601: 25 ff 00 00 00 and $0xff,%eax
606: 89 45 f0 mov %eax,0xfffffff0(%ebp)
if(state == 0){
609: 83 7d f8 00 cmpl $0x0,0xfffffff8(%ebp)
60d: 75 2c jne 63b <printf+0x6b>
if(c == '%'){
60f: 83 7d f0 25 cmpl $0x25,0xfffffff0(%ebp)
613: 75 0c jne 621 <printf+0x51>
state = '%';
615: c7 45 f8 25 00 00 00 movl $0x25,0xfffffff8(%ebp)
61c: e9 48 01 00 00 jmp 769 <printf+0x199>
} else {
putc(fd, c);
621: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
624: 0f be c0 movsbl %al,%eax
627: 89 44 24 04 mov %eax,0x4(%esp)
62b: 8b 45 08 mov 0x8(%ebp),%eax
62e: 89 04 24 mov %eax,(%esp)
631: e8 aa fe ff ff call 4e0 <putc>
636: e9 2e 01 00 00 jmp 769 <printf+0x199>
}
} else if(state == '%'){
63b: 83 7d f8 25 cmpl $0x25,0xfffffff8(%ebp)
63f: 0f 85 24 01 00 00 jne 769 <printf+0x199>
if(c == 'd'){
645: 83 7d f0 64 cmpl $0x64,0xfffffff0(%ebp)
649: 75 2d jne 678 <printf+0xa8>
printint(fd, *ap, 10, 1);
64b: 8b 45 fc mov 0xfffffffc(%ebp),%eax
64e: 8b 00 mov (%eax),%eax
650: c7 44 24 0c 01 00 00 movl $0x1,0xc(%esp)
657: 00
658: c7 44 24 08 0a 00 00 movl $0xa,0x8(%esp)
65f: 00
660: 89 44 24 04 mov %eax,0x4(%esp)
664: 8b 45 08 mov 0x8(%ebp),%eax
667: 89 04 24 mov %eax,(%esp)
66a: e8 a1 fe ff ff call 510 <printint>
ap++;
66f: 83 45 fc 04 addl $0x4,0xfffffffc(%ebp)
673: e9 ea 00 00 00 jmp 762 <printf+0x192>
} else if(c == 'x' || c == 'p'){
678: 83 7d f0 78 cmpl $0x78,0xfffffff0(%ebp)
67c: 74 06 je 684 <printf+0xb4>
67e: 83 7d f0 70 cmpl $0x70,0xfffffff0(%ebp)
682: 75 2d jne 6b1 <printf+0xe1>
printint(fd, *ap, 16, 0);
684: 8b 45 fc mov 0xfffffffc(%ebp),%eax
687: 8b 00 mov (%eax),%eax
689: c7 44 24 0c 00 00 00 movl $0x0,0xc(%esp)
690: 00
691: c7 44 24 08 10 00 00 movl $0x10,0x8(%esp)
698: 00
699: 89 44 24 04 mov %eax,0x4(%esp)
69d: 8b 45 08 mov 0x8(%ebp),%eax
6a0: 89 04 24 mov %eax,(%esp)
6a3: e8 68 fe ff ff call 510 <printint>
ap++;
6a8: 83 45 fc 04 addl $0x4,0xfffffffc(%ebp)
6ac: e9 b1 00 00 00 jmp 762 <printf+0x192>
} else if(c == 's'){
6b1: 83 7d f0 73 cmpl $0x73,0xfffffff0(%ebp)
6b5: 75 43 jne 6fa <printf+0x12a>
s = (char*)*ap;
6b7: 8b 45 fc mov 0xfffffffc(%ebp),%eax
6ba: 8b 00 mov (%eax),%eax
6bc: 89 45 ec mov %eax,0xffffffec(%ebp)
ap++;
6bf: 83 45 fc 04 addl $0x4,0xfffffffc(%ebp)
if(s == 0)
6c3: 83 7d ec 00 cmpl $0x0,0xffffffec(%ebp)
6c7: 75 25 jne 6ee <printf+0x11e>
s = "(null)";
6c9: c7 45 ec 7a 11 00 00 movl $0x117a,0xffffffec(%ebp)
while(*s != 0){
6d0: eb 1c jmp 6ee <printf+0x11e>
putc(fd, *s);
6d2: 8b 45 ec mov 0xffffffec(%ebp),%eax
6d5: 0f b6 00 movzbl (%eax),%eax
6d8: 0f be c0 movsbl %al,%eax
6db: 89 44 24 04 mov %eax,0x4(%esp)
6df: 8b 45 08 mov 0x8(%ebp),%eax
6e2: 89 04 24 mov %eax,(%esp)
6e5: e8 f6 fd ff ff call 4e0 <putc>
s++;
6ea: 83 45 ec 01 addl $0x1,0xffffffec(%ebp)
6ee: 8b 45 ec mov 0xffffffec(%ebp),%eax
6f1: 0f b6 00 movzbl (%eax),%eax
6f4: 84 c0 test %al,%al
6f6: 75 da jne 6d2 <printf+0x102>
6f8: eb 68 jmp 762 <printf+0x192>
}
} else if(c == 'c'){
6fa: 83 7d f0 63 cmpl $0x63,0xfffffff0(%ebp)
6fe: 75 1d jne 71d <printf+0x14d>
putc(fd, *ap);
700: 8b 45 fc mov 0xfffffffc(%ebp),%eax
703: 8b 00 mov (%eax),%eax
705: 0f be c0 movsbl %al,%eax
708: 89 44 24 04 mov %eax,0x4(%esp)
70c: 8b 45 08 mov 0x8(%ebp),%eax
70f: 89 04 24 mov %eax,(%esp)
712: e8 c9 fd ff ff call 4e0 <putc>
ap++;
717: 83 45 fc 04 addl $0x4,0xfffffffc(%ebp)
71b: eb 45 jmp 762 <printf+0x192>
} else if(c == '%'){
71d: 83 7d f0 25 cmpl $0x25,0xfffffff0(%ebp)
721: 75 17 jne 73a <printf+0x16a>
putc(fd, c);
723: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
726: 0f be c0 movsbl %al,%eax
729: 89 44 24 04 mov %eax,0x4(%esp)
72d: 8b 45 08 mov 0x8(%ebp),%eax
730: 89 04 24 mov %eax,(%esp)
733: e8 a8 fd ff ff call 4e0 <putc>
738: eb 28 jmp 762 <printf+0x192>
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
73a: c7 44 24 04 25 00 00 movl $0x25,0x4(%esp)
741: 00
742: 8b 45 08 mov 0x8(%ebp),%eax
745: 89 04 24 mov %eax,(%esp)
748: e8 93 fd ff ff call 4e0 <putc>
putc(fd, c);
74d: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
750: 0f be c0 movsbl %al,%eax
753: 89 44 24 04 mov %eax,0x4(%esp)
757: 8b 45 08 mov 0x8(%ebp),%eax
75a: 89 04 24 mov %eax,(%esp)
75d: e8 7e fd ff ff call 4e0 <putc>
}
state = 0;
762: c7 45 f8 00 00 00 00 movl $0x0,0xfffffff8(%ebp)
769: 83 45 f4 01 addl $0x1,0xfffffff4(%ebp)
76d: 8b 55 0c mov 0xc(%ebp),%edx
770: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
773: 8d 04 02 lea (%edx,%eax,1),%eax
776: 0f b6 00 movzbl (%eax),%eax
779: 84 c0 test %al,%al
77b: 0f 85 71 fe ff ff jne 5f2 <printf+0x22>
}
}
}
781: c9 leave
782: c3 ret
783: 90 nop
784: 90 nop
785: 90 nop
786: 90 nop
787: 90 nop
788: 90 nop
789: 90 nop
78a: 90 nop
78b: 90 nop
78c: 90 nop
78d: 90 nop
78e: 90 nop
78f: 90 nop
00000790 <free>:
static Header *freep;
void
free(void *ap)
{
790: 55 push %ebp
791: 89 e5 mov %esp,%ebp
793: 83 ec 10 sub $0x10,%esp
Header *bp, *p;
bp = (Header*) ap - 1;
796: 8b 45 08 mov 0x8(%ebp),%eax
799: 83 e8 08 sub $0x8,%eax
79c: 89 45 f8 mov %eax,0xfffffff8(%ebp)
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
79f: a1 c8 11 00 00 mov 0x11c8,%eax
7a4: 89 45 fc mov %eax,0xfffffffc(%ebp)
7a7: eb 24 jmp 7cd <free+0x3d>
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
7a9: 8b 45 fc mov 0xfffffffc(%ebp),%eax
7ac: 8b 00 mov (%eax),%eax
7ae: 3b 45 fc cmp 0xfffffffc(%ebp),%eax
7b1: 77 12 ja 7c5 <free+0x35>
7b3: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
7b6: 3b 45 fc cmp 0xfffffffc(%ebp),%eax
7b9: 77 24 ja 7df <free+0x4f>
7bb: 8b 45 fc mov 0xfffffffc(%ebp),%eax
7be: 8b 00 mov (%eax),%eax
7c0: 3b 45 f8 cmp 0xfffffff8(%ebp),%eax
7c3: 77 1a ja 7df <free+0x4f>
7c5: 8b 45 fc mov 0xfffffffc(%ebp),%eax
7c8: 8b 00 mov (%eax),%eax
7ca: 89 45 fc mov %eax,0xfffffffc(%ebp)
7cd: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
7d0: 3b 45 fc cmp 0xfffffffc(%ebp),%eax
7d3: 76 d4 jbe 7a9 <free+0x19>
7d5: 8b 45 fc mov 0xfffffffc(%ebp),%eax
7d8: 8b 00 mov (%eax),%eax
7da: 3b 45 f8 cmp 0xfffffff8(%ebp),%eax
7dd: 76 ca jbe 7a9 <free+0x19>
break;
if(bp + bp->s.size == p->s.ptr){
7df: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
7e2: 8b 40 04 mov 0x4(%eax),%eax
7e5: c1 e0 03 shl $0x3,%eax
7e8: 89 c2 mov %eax,%edx
7ea: 03 55 f8 add 0xfffffff8(%ebp),%edx
7ed: 8b 45 fc mov 0xfffffffc(%ebp),%eax
7f0: 8b 00 mov (%eax),%eax
7f2: 39 c2 cmp %eax,%edx
7f4: 75 24 jne 81a <free+0x8a>
bp->s.size += p->s.ptr->s.size;
7f6: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
7f9: 8b 50 04 mov 0x4(%eax),%edx
7fc: 8b 45 fc mov 0xfffffffc(%ebp),%eax
7ff: 8b 00 mov (%eax),%eax
801: 8b 40 04 mov 0x4(%eax),%eax
804: 01 c2 add %eax,%edx
806: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
809: 89 50 04 mov %edx,0x4(%eax)
bp->s.ptr = p->s.ptr->s.ptr;
80c: 8b 45 fc mov 0xfffffffc(%ebp),%eax
80f: 8b 00 mov (%eax),%eax
811: 8b 10 mov (%eax),%edx
813: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
816: 89 10 mov %edx,(%eax)
818: eb 0a jmp 824 <free+0x94>
} else
bp->s.ptr = p->s.ptr;
81a: 8b 45 fc mov 0xfffffffc(%ebp),%eax
81d: 8b 10 mov (%eax),%edx
81f: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
822: 89 10 mov %edx,(%eax)
if(p + p->s.size == bp){
824: 8b 45 fc mov 0xfffffffc(%ebp),%eax
827: 8b 40 04 mov 0x4(%eax),%eax
82a: c1 e0 03 shl $0x3,%eax
82d: 03 45 fc add 0xfffffffc(%ebp),%eax
830: 3b 45 f8 cmp 0xfffffff8(%ebp),%eax
833: 75 20 jne 855 <free+0xc5>
p->s.size += bp->s.size;
835: 8b 45 fc mov 0xfffffffc(%ebp),%eax
838: 8b 50 04 mov 0x4(%eax),%edx
83b: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
83e: 8b 40 04 mov 0x4(%eax),%eax
841: 01 c2 add %eax,%edx
843: 8b 45 fc mov 0xfffffffc(%ebp),%eax
846: 89 50 04 mov %edx,0x4(%eax)
p->s.ptr = bp->s.ptr;
849: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
84c: 8b 10 mov (%eax),%edx
84e: 8b 45 fc mov 0xfffffffc(%ebp),%eax
851: 89 10 mov %edx,(%eax)
853: eb 08 jmp 85d <free+0xcd>
} else
p->s.ptr = bp;
855: 8b 55 fc mov 0xfffffffc(%ebp),%edx
858: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
85b: 89 02 mov %eax,(%edx)
freep = p;
85d: 8b 45 fc mov 0xfffffffc(%ebp),%eax
860: a3 c8 11 00 00 mov %eax,0x11c8
}
865: c9 leave
866: c3 ret
867: 89 f6 mov %esi,%esi
869: 8d bc 27 00 00 00 00 lea 0x0(%edi),%edi
00000870 <morecore>:
static Header*
morecore(uint nu)
{
870: 55 push %ebp
871: 89 e5 mov %esp,%ebp
873: 83 ec 18 sub $0x18,%esp
char *p;
Header *hp;
int size;
#ifdef UMALLOC_DEBUG
printf(1, "morecore: %d\n", nu);
#endif
#ifdef UMALLOC_NOALIGN
if(nu < PAGE)
nu = PAGE;
#else
size = nu * sizeof(Header);
876: 8b 45 08 mov 0x8(%ebp),%eax
879: c1 e0 03 shl $0x3,%eax
87c: 89 45 fc mov %eax,0xfffffffc(%ebp)
size += PAGE - size % PAGE;
87f: 8b 55 fc mov 0xfffffffc(%ebp),%edx
882: 89 d0 mov %edx,%eax
884: c1 f8 1f sar $0x1f,%eax
887: 89 c1 mov %eax,%ecx
889: c1 e9 14 shr $0x14,%ecx
88c: 8d 04 0a lea (%edx,%ecx,1),%eax
88f: 25 ff 0f 00 00 and $0xfff,%eax
894: 29 c8 sub %ecx,%eax
896: 89 c2 mov %eax,%edx
898: b8 00 10 00 00 mov $0x1000,%eax
89d: 29 d0 sub %edx,%eax
89f: 01 45 fc add %eax,0xfffffffc(%ebp)
#endif
#ifdef UMALLOC_DEBUG
printf(1, "size: %d\n", size);
#endif
p = sbrk(size);
8a2: 8b 45 fc mov 0xfffffffc(%ebp),%eax
8a5: 89 04 24 mov %eax,(%esp)
8a8: e8 9f fb ff ff call 44c <sbrk>
8ad: 89 45 f4 mov %eax,0xfffffff4(%ebp)
if(p == (char*) -1)
8b0: 83 7d f4 ff cmpl $0xffffffff,0xfffffff4(%ebp)
8b4: 75 09 jne 8bf <morecore+0x4f>
return 0;
8b6: c7 45 ec 00 00 00 00 movl $0x0,0xffffffec(%ebp)
8bd: eb 2a jmp 8e9 <morecore+0x79>
hp = (Header*)p;
8bf: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
8c2: 89 45 f8 mov %eax,0xfffffff8(%ebp)
#ifdef UMALLOC_NOALIGN
hp->s.size = nu;
#else
hp->s.size = size / sizeof(Header);
8c5: 8b 45 fc mov 0xfffffffc(%ebp),%eax
8c8: 89 c2 mov %eax,%edx
8ca: c1 ea 03 shr $0x3,%edx
8cd: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
8d0: 89 50 04 mov %edx,0x4(%eax)
#endif
free((void*)(hp + 1));
8d3: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
8d6: 83 c0 08 add $0x8,%eax
8d9: 89 04 24 mov %eax,(%esp)
8dc: e8 af fe ff ff call 790 <free>
return freep;
8e1: a1 c8 11 00 00 mov 0x11c8,%eax
8e6: 89 45 ec mov %eax,0xffffffec(%ebp)
8e9: 8b 45 ec mov 0xffffffec(%ebp),%eax
}
8ec: c9 leave
8ed: c3 ret
8ee: 89 f6 mov %esi,%esi
000008f0 <malloc>:
void*
malloc(uint nbytes)
{
8f0: 55 push %ebp
8f1: 89 e5 mov %esp,%ebp
8f3: 83 ec 18 sub $0x18,%esp
Header *p, *prevp;
uint nunits;
#ifdef UMALLOC_DEBUG
printf(1, "malloc: %d bytes\n", nbytes);
printf(1, "size of Header: %d\n", sizeof(Header));
#endif
if (PAGE % sizeof(Header))
printf(2, "Warning! align failed! Need UMALLOC_NOALIGN\n");
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
8f6: 8b 45 08 mov 0x8(%ebp),%eax
8f9: 83 c0 07 add $0x7,%eax
8fc: c1 e8 03 shr $0x3,%eax
8ff: 83 c0 01 add $0x1,%eax
902: 89 45 fc mov %eax,0xfffffffc(%ebp)
if((prevp = freep) == 0){
905: a1 c8 11 00 00 mov 0x11c8,%eax
90a: 89 45 f8 mov %eax,0xfffffff8(%ebp)
90d: 83 7d f8 00 cmpl $0x0,0xfffffff8(%ebp)
911: 75 23 jne 936 <malloc+0x46>
base.s.ptr = freep = prevp = &base;
913: c7 45 f8 c0 11 00 00 movl $0x11c0,0xfffffff8(%ebp)
91a: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
91d: a3 c8 11 00 00 mov %eax,0x11c8
922: a1 c8 11 00 00 mov 0x11c8,%eax
927: a3 c0 11 00 00 mov %eax,0x11c0
base.s.size = 0;
92c: c7 05 c4 11 00 00 00 movl $0x0,0x11c4
933: 00 00 00
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
936: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
939: 8b 00 mov (%eax),%eax
93b: 89 45 f4 mov %eax,0xfffffff4(%ebp)
if(p->s.size >= nunits){
93e: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
941: 8b 40 04 mov 0x4(%eax),%eax
944: 3b 45 fc cmp 0xfffffffc(%ebp),%eax
947: 72 50 jb 999 <malloc+0xa9>
if(p->s.size == nunits)
949: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
94c: 8b 40 04 mov 0x4(%eax),%eax
94f: 3b 45 fc cmp 0xfffffffc(%ebp),%eax
952: 75 0c jne 960 <malloc+0x70>
prevp->s.ptr = p->s.ptr;
954: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
957: 8b 10 mov (%eax),%edx
959: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
95c: 89 10 mov %edx,(%eax)
95e: eb 26 jmp 986 <malloc+0x96>
else {
p->s.size -= nunits;
960: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
963: 8b 40 04 mov 0x4(%eax),%eax
966: 89 c2 mov %eax,%edx
968: 2b 55 fc sub 0xfffffffc(%ebp),%edx
96b: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
96e: 89 50 04 mov %edx,0x4(%eax)
p += p->s.size;
971: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
974: 8b 40 04 mov 0x4(%eax),%eax
977: c1 e0 03 shl $0x3,%eax
97a: 01 45 f4 add %eax,0xfffffff4(%ebp)
p->s.size = nunits;
97d: 8b 55 f4 mov 0xfffffff4(%ebp),%edx
980: 8b 45 fc mov 0xfffffffc(%ebp),%eax
983: 89 42 04 mov %eax,0x4(%edx)
}
freep = prevp;
986: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
989: a3 c8 11 00 00 mov %eax,0x11c8
return (void*) (p + 1);
98e: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
991: 83 c0 08 add $0x8,%eax
994: 89 45 ec mov %eax,0xffffffec(%ebp)
997: eb 3a jmp 9d3 <malloc+0xe3>
}
if(p == freep)
999: a1 c8 11 00 00 mov 0x11c8,%eax
99e: 39 45 f4 cmp %eax,0xfffffff4(%ebp)
9a1: 75 1d jne 9c0 <malloc+0xd0>
if((p = morecore(nunits)) == 0)
9a3: 8b 45 fc mov 0xfffffffc(%ebp),%eax
9a6: 89 04 24 mov %eax,(%esp)
9a9: e8 c2 fe ff ff call 870 <morecore>
9ae: 89 45 f4 mov %eax,0xfffffff4(%ebp)
9b1: 83 7d f4 00 cmpl $0x0,0xfffffff4(%ebp)
9b5: 75 09 jne 9c0 <malloc+0xd0>
return 0;
9b7: c7 45 ec 00 00 00 00 movl $0x0,0xffffffec(%ebp)
9be: eb 13 jmp 9d3 <malloc+0xe3>
9c0: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
9c3: 89 45 f8 mov %eax,0xfffffff8(%ebp)
9c6: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
9c9: 8b 00 mov (%eax),%eax
9cb: 89 45 f4 mov %eax,0xfffffff4(%ebp)
}
9ce: e9 6b ff ff ff jmp 93e <malloc+0x4e>
9d3: 8b 45 ec mov 0xffffffec(%ebp),%eax
}
9d6: c9 leave
9d7: c3 ret
9d8: 90 nop
9d9: 90 nop
9da: 90 nop
9db: 90 nop
9dc: 90 nop
9dd: 90 nop
9de: 90 nop
9df: 90 nop
000009e0 <lwip_chksum>:
static u16_t
lwip_chksum(void *dataptr, int len)
{
9e0: 55 push %ebp
9e1: 89 e5 mov %esp,%ebp
9e3: 83 ec 18 sub $0x18,%esp
u32_t acc;
LWIP_DEBUGF(INET_DEBUG, ("lwip_chksum(%p, %d)\n", (void *)dataptr, len));
for(acc = 0; len > 1; len -= 2) {
9e6: c7 45 fc 00 00 00 00 movl $0x0,0xfffffffc(%ebp)
9ed: eb 19 jmp a08 <lwip_chksum+0x28>
/* acc = acc + *((u16_t *)dataptr)++;*/
acc += *(u16_t *)dataptr;
9ef: 8b 45 08 mov 0x8(%ebp),%eax
9f2: 0f b7 00 movzwl (%eax),%eax
9f5: 0f b7 c0 movzwl %ax,%eax
9f8: 01 45 fc add %eax,0xfffffffc(%ebp)
dataptr = (void *)((u16_t *)dataptr + 1);
9fb: 8b 45 08 mov 0x8(%ebp),%eax
9fe: 83 c0 02 add $0x2,%eax
a01: 89 45 08 mov %eax,0x8(%ebp)
a04: 83 6d 0c 02 subl $0x2,0xc(%ebp)
a08: 83 7d 0c 01 cmpl $0x1,0xc(%ebp)
a0c: 7f e1 jg 9ef <lwip_chksum+0xf>
}
/* add up any odd byte */
if (len == 1) {
a0e: 83 7d 0c 01 cmpl $0x1,0xc(%ebp)
a12: 75 1d jne a31 <lwip_chksum+0x51>
acc += htons((u16_t)((*(u8_t *)dataptr) & 0xff) << 8);
a14: 8b 45 08 mov 0x8(%ebp),%eax
a17: 0f b6 00 movzbl (%eax),%eax
a1a: 0f b6 c0 movzbl %al,%eax
a1d: c1 e0 08 shl $0x8,%eax
a20: 0f b7 c0 movzwl %ax,%eax
a23: 89 04 24 mov %eax,(%esp)
a26: e8 85 06 00 00 call 10b0 <htons>
a2b: 0f b7 c0 movzwl %ax,%eax
a2e: 01 45 fc add %eax,0xfffffffc(%ebp)
LWIP_DEBUGF(INET_DEBUG, ("inet: chksum: odd byte %d\n", (unsigned int)(*(u8_t *)dataptr)));
} else {
LWIP_DEBUGF(INET_DEBUG, ("inet: chksum: no odd byte\n"));
}
acc = (acc >> 16) + (acc & 0xffffUL);
a31: 8b 45 fc mov 0xfffffffc(%ebp),%eax
a34: 89 c2 mov %eax,%edx
a36: c1 ea 10 shr $0x10,%edx
a39: 0f b7 45 fc movzwl 0xfffffffc(%ebp),%eax
a3d: 8d 04 02 lea (%edx,%eax,1),%eax
a40: 89 45 fc mov %eax,0xfffffffc(%ebp)
if ((acc & 0xffff0000) != 0) {
a43: 8b 45 fc mov 0xfffffffc(%ebp),%eax
a46: 66 b8 00 00 mov $0x0,%ax
a4a: 85 c0 test %eax,%eax
a4c: 74 12 je a60 <lwip_chksum+0x80>
acc = (acc >> 16) + (acc & 0xffffUL);
a4e: 8b 45 fc mov 0xfffffffc(%ebp),%eax
a51: 89 c2 mov %eax,%edx
a53: c1 ea 10 shr $0x10,%edx
a56: 0f b7 45 fc movzwl 0xfffffffc(%ebp),%eax
a5a: 8d 04 02 lea (%edx,%eax,1),%eax
a5d: 89 45 fc mov %eax,0xfffffffc(%ebp)
}
return (u16_t)acc;
a60: 8b 45 fc mov 0xfffffffc(%ebp),%eax
a63: 0f b7 c0 movzwl %ax,%eax
}
a66: c9 leave
a67: c3 ret
a68: 90 nop
a69: 8d b4 26 00 00 00 00 lea 0x0(%esi),%esi
00000a70 <inet_chksum_pseudo>:
/* inet_chksum_pseudo:
*
* Calculates the pseudo Internet checksum used by TCP and UDP for a pbuf chain.
*/
u16_t
inet_chksum_pseudo(struct pbuf *p,
struct ip_addr *src, struct ip_addr *dest,
u8_t proto, u16_t proto_len)
{
a70: 55 push %ebp
a71: 89 e5 mov %esp,%ebp
a73: 83 ec 28 sub $0x28,%esp
a76: 8b 45 14 mov 0x14(%ebp),%eax
a79: 8b 55 18 mov 0x18(%ebp),%edx
a7c: 88 45 ec mov %al,0xffffffec(%ebp)
a7f: 66 89 55 e8 mov %dx,0xffffffe8(%ebp)
u32_t acc;
struct pbuf *q;
u8_t swapped;
acc = 0;
a83: c7 45 f4 00 00 00 00 movl $0x0,0xfffffff4(%ebp)
swapped = 0;
a8a: c6 45 ff 00 movb $0x0,0xffffffff(%ebp)
/* iterate through all pbuf in chain */
for(q = p; q != NULL; q = q->next) {
a8e: 8b 45 08 mov 0x8(%ebp),%eax
a91: 89 45 f8 mov %eax,0xfffffff8(%ebp)
a94: eb 7b jmp b11 <inet_chksum_pseudo+0xa1>
LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): checksumming pbuf %p (has next %p) \n",
(void *)q, (void *)q->next));
acc += lwip_chksum(q->payload, q->len);
a96: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
a99: 0f b7 40 0a movzwl 0xa(%eax),%eax
a9d: 0f b7 d0 movzwl %ax,%edx
aa0: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
aa3: 8b 40 04 mov 0x4(%eax),%eax
aa6: 89 54 24 04 mov %edx,0x4(%esp)
aaa: 89 04 24 mov %eax,(%esp)
aad: e8 2e ff ff ff call 9e0 <lwip_chksum>
ab2: 0f b7 c0 movzwl %ax,%eax
ab5: 01 45 f4 add %eax,0xfffffff4(%ebp)
/*LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): unwrapped lwip_chksum()=%lx \n", acc));*/
while (acc >> 16) {
ab8: eb 10 jmp aca <inet_chksum_pseudo+0x5a>
acc = (acc & 0xffffUL) + (acc >> 16);
aba: 0f b7 55 f4 movzwl 0xfffffff4(%ebp),%edx
abe: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
ac1: c1 e8 10 shr $0x10,%eax
ac4: 8d 04 02 lea (%edx,%eax,1),%eax
ac7: 89 45 f4 mov %eax,0xfffffff4(%ebp)
aca: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
acd: c1 e8 10 shr $0x10,%eax
ad0: 85 c0 test %eax,%eax
ad2: 75 e6 jne aba <inet_chksum_pseudo+0x4a>
}
if (q->len % 2 != 0) {
ad4: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
ad7: 0f b7 40 0a movzwl 0xa(%eax),%eax
adb: 0f b7 c0 movzwl %ax,%eax
ade: 83 e0 01 and $0x1,%eax
ae1: 84 c0 test %al,%al
ae3: 74 24 je b09 <inet_chksum_pseudo+0x99>
swapped = 1 - swapped;
ae5: b8 01 00 00 00 mov $0x1,%eax
aea: 2a 45 ff sub 0xffffffff(%ebp),%al
aed: 88 45 ff mov %al,0xffffffff(%ebp)
acc = ((acc & 0xff) << 8) | ((acc & 0xff00UL) >> 8);
af0: 0f b6 45 f4 movzbl 0xfffffff4(%ebp),%eax
af4: 89 c2 mov %eax,%edx
af6: c1 e2 08 shl $0x8,%edx
af9: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
afc: 25 00 ff 00 00 and $0xff00,%eax
b01: c1 e8 08 shr $0x8,%eax
b04: 09 d0 or %edx,%eax
b06: 89 45 f4 mov %eax,0xfffffff4(%ebp)
b09: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
b0c: 8b 00 mov (%eax),%eax
b0e: 89 45 f8 mov %eax,0xfffffff8(%ebp)
b11: 83 7d f8 00 cmpl $0x0,0xfffffff8(%ebp)
b15: 0f 85 7b ff ff ff jne a96 <inet_chksum_pseudo+0x26>
}
/*LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): wrapped lwip_chksum()=%lx \n", acc));*/
}
if (swapped) {
b1b: 80 7d ff 00 cmpb $0x0,0xffffffff(%ebp)
b1f: 74 19 je b3a <inet_chksum_pseudo+0xca>
acc = ((acc & 0xff) << 8) | ((acc & 0xff00UL) >> 8);
b21: 0f b6 45 f4 movzbl 0xfffffff4(%ebp),%eax
b25: 89 c2 mov %eax,%edx
b27: c1 e2 08 shl $0x8,%edx
b2a: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
b2d: 25 00 ff 00 00 and $0xff00,%eax
b32: c1 e8 08 shr $0x8,%eax
b35: 09 d0 or %edx,%eax
b37: 89 45 f4 mov %eax,0xfffffff4(%ebp)
}
acc += (src->addr & 0xffffUL);
b3a: 8b 45 0c mov 0xc(%ebp),%eax
b3d: 8b 00 mov (%eax),%eax
b3f: 25 ff ff 00 00 and $0xffff,%eax
b44: 01 45 f4 add %eax,0xfffffff4(%ebp)
acc += ((src->addr >> 16) & 0xffffUL);
b47: 8b 45 0c mov 0xc(%ebp),%eax
b4a: 8b 00 mov (%eax),%eax
b4c: c1 e8 10 shr $0x10,%eax
b4f: 25 ff ff 00 00 and $0xffff,%eax
b54: 01 45 f4 add %eax,0xfffffff4(%ebp)
acc += (dest->addr & 0xffffUL);
b57: 8b 45 10 mov 0x10(%ebp),%eax
b5a: 8b 00 mov (%eax),%eax
b5c: 25 ff ff 00 00 and $0xffff,%eax
b61: 01 45 f4 add %eax,0xfffffff4(%ebp)
acc += ((dest->addr >> 16) & 0xffffUL);
b64: 8b 45 10 mov 0x10(%ebp),%eax
b67: 8b 00 mov (%eax),%eax
b69: c1 e8 10 shr $0x10,%eax
b6c: 25 ff ff 00 00 and $0xffff,%eax
b71: 01 45 f4 add %eax,0xfffffff4(%ebp)
acc += (u32_t)htons((u16_t)proto);
b74: 0f b6 45 ec movzbl 0xffffffec(%ebp),%eax
b78: 89 04 24 mov %eax,(%esp)
b7b: e8 30 05 00 00 call 10b0 <htons>
b80: 0f b7 c0 movzwl %ax,%eax
b83: 01 45 f4 add %eax,0xfffffff4(%ebp)
acc += (u32_t)htons(proto_len);
b86: 0f b7 45 e8 movzwl 0xffffffe8(%ebp),%eax
b8a: 89 04 24 mov %eax,(%esp)
b8d: e8 1e 05 00 00 call 10b0 <htons>
b92: 0f b7 c0 movzwl %ax,%eax
b95: 01 45 f4 add %eax,0xfffffff4(%ebp)
while (acc >> 16) {
b98: eb 10 jmp baa <inet_chksum_pseudo+0x13a>
acc = (acc & 0xffffUL) + (acc >> 16);
b9a: 0f b7 55 f4 movzwl 0xfffffff4(%ebp),%edx
b9e: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
ba1: c1 e8 10 shr $0x10,%eax
ba4: 8d 04 02 lea (%edx,%eax,1),%eax
ba7: 89 45 f4 mov %eax,0xfffffff4(%ebp)
baa: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
bad: c1 e8 10 shr $0x10,%eax
bb0: 85 c0 test %eax,%eax
bb2: 75 e6 jne b9a <inet_chksum_pseudo+0x12a>
}
LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): pbuf chain lwip_chksum()=%lx\n", acc));
return ~(acc & 0xffffUL);
bb4: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
bb7: f7 d0 not %eax
bb9: 0f b7 c0 movzwl %ax,%eax
}
bbc: c9 leave
bbd: c3 ret
bbe: 89 f6 mov %esi,%esi
00000bc0 <inet_chksum>:
/* inet_chksum:
*
* Calculates the Internet checksum over a portion of memory. Used primarely for IP
* and ICMP.
*/
u16_t
inet_chksum(void *dataptr, u16_t len)
{
bc0: 55 push %ebp
bc1: 89 e5 mov %esp,%ebp
bc3: 83 ec 28 sub $0x28,%esp
bc6: 8b 45 0c mov 0xc(%ebp),%eax
bc9: 66 89 45 ec mov %ax,0xffffffec(%ebp)
u32_t acc;
acc = lwip_chksum(dataptr, len);
bcd: 0f b7 45 ec movzwl 0xffffffec(%ebp),%eax
bd1: 89 44 24 04 mov %eax,0x4(%esp)
bd5: 8b 45 08 mov 0x8(%ebp),%eax
bd8: 89 04 24 mov %eax,(%esp)
bdb: e8 00 fe ff ff call 9e0 <lwip_chksum>
be0: 0f b7 c0 movzwl %ax,%eax
be3: 89 45 fc mov %eax,0xfffffffc(%ebp)
while (acc >> 16) {
be6: eb 10 jmp bf8 <inet_chksum+0x38>
acc = (acc & 0xffff) + (acc >> 16);
be8: 0f b7 55 fc movzwl 0xfffffffc(%ebp),%edx
bec: 8b 45 fc mov 0xfffffffc(%ebp),%eax
bef: c1 e8 10 shr $0x10,%eax
bf2: 8d 04 02 lea (%edx,%eax,1),%eax
bf5: 89 45 fc mov %eax,0xfffffffc(%ebp)
bf8: 8b 45 fc mov 0xfffffffc(%ebp),%eax
bfb: c1 e8 10 shr $0x10,%eax
bfe: 85 c0 test %eax,%eax
c00: 75 e6 jne be8 <inet_chksum+0x28>
}
return ~(acc & 0xffff);
c02: 8b 45 fc mov 0xfffffffc(%ebp),%eax
c05: f7 d0 not %eax
c07: 0f b7 c0 movzwl %ax,%eax
}
c0a: c9 leave
c0b: c3 ret
c0c: 8d 74 26 00 lea 0x0(%esi),%esi
00000c10 <inet_chksum_pbuf>:
u16_t
inet_chksum_pbuf(struct pbuf *p)
{
c10: 55 push %ebp
c11: 89 e5 mov %esp,%ebp
c13: 83 ec 18 sub $0x18,%esp
u32_t acc;
struct pbuf *q;
u8_t swapped;
acc = 0;
c16: c7 45 f4 00 00 00 00 movl $0x0,0xfffffff4(%ebp)
swapped = 0;
c1d: c6 45 ff 00 movb $0x0,0xffffffff(%ebp)
for(q = p; q != NULL; q = q->next) {
c21: 8b 45 08 mov 0x8(%ebp),%eax
c24: 89 45 f8 mov %eax,0xfffffff8(%ebp)
c27: eb 69 jmp c92 <inet_chksum_pbuf+0x82>
acc += lwip_chksum(q->payload, q->len);
c29: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
c2c: 0f b7 40 0a movzwl 0xa(%eax),%eax
c30: 0f b7 d0 movzwl %ax,%edx
c33: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
c36: 8b 40 04 mov 0x4(%eax),%eax
c39: 89 54 24 04 mov %edx,0x4(%esp)
c3d: 89 04 24 mov %eax,(%esp)
c40: e8 9b fd ff ff call 9e0 <lwip_chksum>
c45: 0f b7 c0 movzwl %ax,%eax
c48: 01 45 f4 add %eax,0xfffffff4(%ebp)
while (acc >> 16) {
c4b: eb 10 jmp c5d <inet_chksum_pbuf+0x4d>
acc = (acc & 0xffffUL) + (acc >> 16);
c4d: 0f b7 55 f4 movzwl 0xfffffff4(%ebp),%edx
c51: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
c54: c1 e8 10 shr $0x10,%eax
c57: 8d 04 02 lea (%edx,%eax,1),%eax
c5a: 89 45 f4 mov %eax,0xfffffff4(%ebp)
c5d: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
c60: c1 e8 10 shr $0x10,%eax
c63: 85 c0 test %eax,%eax
c65: 75 e6 jne c4d <inet_chksum_pbuf+0x3d>
}
if (q->len % 2 != 0) {
c67: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
c6a: 0f b7 40 0a movzwl 0xa(%eax),%eax
c6e: 0f b7 c0 movzwl %ax,%eax
c71: 83 e0 01 and $0x1,%eax
c74: 84 c0 test %al,%al
c76: 74 12 je c8a <inet_chksum_pbuf+0x7a>
swapped = 1 - swapped;
c78: b8 01 00 00 00 mov $0x1,%eax
c7d: 2a 45 ff sub 0xffffffff(%ebp),%al
c80: 88 45 ff mov %al,0xffffffff(%ebp)
acc = (acc & 0x00ffUL << 8) | (acc & 0xff00UL >> 8);
c83: 81 65 f4 ff ff 00 00 andl $0xffff,0xfffffff4(%ebp)
c8a: 8b 45 f8 mov 0xfffffff8(%ebp),%eax
c8d: 8b 00 mov (%eax),%eax
c8f: 89 45 f8 mov %eax,0xfffffff8(%ebp)
c92: 83 7d f8 00 cmpl $0x0,0xfffffff8(%ebp)
c96: 75 91 jne c29 <inet_chksum_pbuf+0x19>
}
}
if (swapped) {
c98: 80 7d ff 00 cmpb $0x0,0xffffffff(%ebp)
c9c: 74 19 je cb7 <inet_chksum_pbuf+0xa7>
acc = ((acc & 0x00ffUL) << 8) | ((acc & 0xff00UL) >> 8);
c9e: 0f b6 45 f4 movzbl 0xfffffff4(%ebp),%eax
ca2: 89 c2 mov %eax,%edx
ca4: c1 e2 08 shl $0x8,%edx
ca7: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
caa: 25 00 ff 00 00 and $0xff00,%eax
caf: c1 e8 08 shr $0x8,%eax
cb2: 09 d0 or %edx,%eax
cb4: 89 45 f4 mov %eax,0xfffffff4(%ebp)
}
return ~(acc & 0xffffUL);
cb7: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
cba: f7 d0 not %eax
cbc: 0f b7 c0 movzwl %ax,%eax
}
cbf: c9 leave
cc0: c3 ret
cc1: eb 0d jmp cd0 <inet_addr>
cc3: 90 nop
cc4: 90 nop
cc5: 90 nop
cc6: 90 nop
cc7: 90 nop
cc8: 90 nop
cc9: 90 nop
cca: 90 nop
ccb: 90 nop
ccc: 90 nop
ccd: 90 nop
cce: 90 nop
ccf: 90 nop
00000cd0 <inet_addr>:
/* Here for now until needed in other places in lwIP */
#ifndef isascii
#define in_range(c, lo, up) ((u8_t)c >= lo && (u8_t)c <= up)
#define isascii(c) in_range(c, 0x20, 0x7f)
#define isdigit(c) in_range(c, '0', '9')
#define isxdigit(c) (isdigit(c) || in_range(c, 'a', 'f') || in_range(c, 'A', 'F'))
#define islower(c) in_range(c, 'a', 'z')
#define isspace(c) (c == ' ' || c == '\f' || c == '\n' || c == '\r' || c == '\t' || c == '\v')
#endif
/*
* Ascii internet address interpretation routine.
* The value returned is in network order.
*/
/* */
/* inet_addr */
u32_t inet_addr(const char *cp)
{
cd0: 55 push %ebp
cd1: 89 e5 mov %esp,%ebp
cd3: 83 ec 28 sub $0x28,%esp
struct in_addr val;
if (inet_aton(cp, &val)) {
cd6: 8d 45 fc lea 0xfffffffc(%ebp),%eax
cd9: 89 44 24 04 mov %eax,0x4(%esp)
cdd: 8b 45 08 mov 0x8(%ebp),%eax
ce0: 89 04 24 mov %eax,(%esp)
ce3: e8 18 00 00 00 call d00 <inet_aton>
ce8: 85 c0 test %eax,%eax
cea: 74 08 je cf4 <inet_addr+0x24>
return (val.s_addr);
cec: 8b 45 fc mov 0xfffffffc(%ebp),%eax
cef: 89 45 ec mov %eax,0xffffffec(%ebp)
cf2: eb 07 jmp cfb <inet_addr+0x2b>
}
return (INADDR_NONE);
cf4: c7 45 ec ff ff ff ff movl $0xffffffff,0xffffffec(%ebp)
cfb: 8b 45 ec mov 0xffffffec(%ebp),%eax
}
cfe: c9 leave
cff: c3 ret
00000d00 <inet_aton>:
/*
* Check whether "cp" is a valid ascii representation
* of an Internet address and convert to a binary address.
* Returns 1 if the address is valid, 0 if not.
* This replaces inet_addr, the return value from which
* cannot distinguish between failure and a local broadcast address.
*/
/* */
/* inet_aton */
int inet_aton(const char *cp, struct in_addr *addr)
{
d00: 55 push %ebp
d01: 89 e5 mov %esp,%ebp
d03: 83 ec 48 sub $0x48,%esp
u32_t val;
int base, n;
char c;
u32_t parts[4];
u32_t* pp = parts;
d06: 8d 45 dc lea 0xffffffdc(%ebp),%eax
d09: 89 45 fc mov %eax,0xfffffffc(%ebp)
c = *cp;
d0c: 8b 45 08 mov 0x8(%ebp),%eax
d0f: 0f b6 00 movzbl (%eax),%eax
d12: 88 45 fb mov %al,0xfffffffb(%ebp)
for (;;) {
/*
* Collect number up to ``.''.
* Values are specified as for C:
* 0x=hex, 0=octal, isdigit=decimal.
*/
if (!isdigit(c))
d15: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
d19: 3c 2f cmp $0x2f,%al
d1b: 76 08 jbe d25 <inet_aton+0x25>
d1d: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
d21: 3c 39 cmp $0x39,%al
d23: 76 0c jbe d31 <inet_aton+0x31>
return (0);
d25: c7 45 c0 00 00 00 00 movl $0x0,0xffffffc0(%ebp)
d2c: e9 78 02 00 00 jmp fa9 <inet_aton+0x2a9>
val = 0; base = 10;
d31: c7 45 ec 00 00 00 00 movl $0x0,0xffffffec(%ebp)
d38: c7 45 f0 0a 00 00 00 movl $0xa,0xfffffff0(%ebp)
if (c == '0') {
d3f: 80 7d fb 30 cmpb $0x30,0xfffffffb(%ebp)
d43: 75 36 jne d7b <inet_aton+0x7b>
c = *++cp;
d45: 83 45 08 01 addl $0x1,0x8(%ebp)
d49: 8b 45 08 mov 0x8(%ebp),%eax
d4c: 0f b6 00 movzbl (%eax),%eax
d4f: 88 45 fb mov %al,0xfffffffb(%ebp)
if (c == 'x' || c == 'X')
d52: 80 7d fb 78 cmpb $0x78,0xfffffffb(%ebp)
d56: 74 06 je d5e <inet_aton+0x5e>
d58: 80 7d fb 58 cmpb $0x58,0xfffffffb(%ebp)
d5c: 75 16 jne d74 <inet_aton+0x74>
base = 16, c = *++cp;
d5e: c7 45 f0 10 00 00 00 movl $0x10,0xfffffff0(%ebp)
d65: 83 45 08 01 addl $0x1,0x8(%ebp)
d69: 8b 45 08 mov 0x8(%ebp),%eax
d6c: 0f b6 00 movzbl (%eax),%eax
d6f: 88 45 fb mov %al,0xfffffffb(%ebp)
d72: eb 07 jmp d7b <inet_aton+0x7b>
else
base = 8;
d74: c7 45 f0 08 00 00 00 movl $0x8,0xfffffff0(%ebp)
}
for (;;) {
if (isascii(c) && isdigit(c)) {
d7b: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
d7f: 3c 1f cmp $0x1f,%al
d81: 76 3b jbe dbe <inet_aton+0xbe>
d83: 80 7d fb 00 cmpb $0x0,0xfffffffb(%ebp)
d87: 78 35 js dbe <inet_aton+0xbe>
d89: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
d8d: 3c 2f cmp $0x2f,%al
d8f: 76 2d jbe dbe <inet_aton+0xbe>
d91: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
d95: 3c 39 cmp $0x39,%al
d97: 77 25 ja dbe <inet_aton+0xbe>
val = (val * base) + (c - '0');
d99: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
d9c: 89 c2 mov %eax,%edx
d9e: 0f af 55 ec imul 0xffffffec(%ebp),%edx
da2: 0f be 45 fb movsbl 0xfffffffb(%ebp),%eax
da6: 8d 04 02 lea (%edx,%eax,1),%eax
da9: 83 e8 30 sub $0x30,%eax
dac: 89 45 ec mov %eax,0xffffffec(%ebp)
c = *++cp;
daf: 83 45 08 01 addl $0x1,0x8(%ebp)
db3: 8b 45 08 mov 0x8(%ebp),%eax
db6: 0f b6 00 movzbl (%eax),%eax
db9: 88 45 fb mov %al,0xfffffffb(%ebp)
dbc: eb bd jmp d7b <inet_aton+0x7b>
} else if (base == 16 && isascii(c) && isxdigit(c)) {
dbe: 83 7d f0 10 cmpl $0x10,0xfffffff0(%ebp)
dc2: 0f 85 99 00 00 00 jne e61 <inet_aton+0x161>
dc8: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
dcc: 3c 1f cmp $0x1f,%al
dce: 0f 86 8d 00 00 00 jbe e61 <inet_aton+0x161>
dd4: 80 7d fb 00 cmpb $0x0,0xfffffffb(%ebp)
dd8: 0f 88 83 00 00 00 js e61 <inet_aton+0x161>
dde: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
de2: 3c 2f cmp $0x2f,%al
de4: 76 08 jbe dee <inet_aton+0xee>
de6: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
dea: 3c 39 cmp $0x39,%al
dec: 76 20 jbe e0e <inet_aton+0x10e>
dee: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
df2: 3c 60 cmp $0x60,%al
df4: 76 08 jbe dfe <inet_aton+0xfe>
df6: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
dfa: 3c 66 cmp $0x66,%al
dfc: 76 10 jbe e0e <inet_aton+0x10e>
dfe: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
e02: 3c 40 cmp $0x40,%al
e04: 76 5b jbe e61 <inet_aton+0x161>
e06: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
e0a: 3c 46 cmp $0x46,%al
e0c: 77 53 ja e61 <inet_aton+0x161>
val = (val << 4) |
e0e: 8b 45 ec mov 0xffffffec(%ebp),%eax
e11: 89 c2 mov %eax,%edx
e13: c1 e2 04 shl $0x4,%edx
e16: 89 55 c4 mov %edx,0xffffffc4(%ebp)
e19: 0f be 45 fb movsbl 0xfffffffb(%ebp),%eax
e1d: 83 c0 0a add $0xa,%eax
e20: 89 45 c8 mov %eax,0xffffffc8(%ebp)
e23: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
e27: 3c 60 cmp $0x60,%al
e29: 76 11 jbe e3c <inet_aton+0x13c>
e2b: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
e2f: 3c 7a cmp $0x7a,%al
e31: 77 09 ja e3c <inet_aton+0x13c>
e33: c7 45 cc 61 00 00 00 movl $0x61,0xffffffcc(%ebp)
e3a: eb 07 jmp e43 <inet_aton+0x143>
e3c: c7 45 cc 41 00 00 00 movl $0x41,0xffffffcc(%ebp)
e43: 8b 45 c8 mov 0xffffffc8(%ebp),%eax
e46: 2b 45 cc sub 0xffffffcc(%ebp),%eax
e49: 0b 45 c4 or 0xffffffc4(%ebp),%eax
e4c: 89 45 ec mov %eax,0xffffffec(%ebp)
(c + 10 - (islower(c) ? 'a' : 'A'));
c = *++cp;
e4f: 83 45 08 01 addl $0x1,0x8(%ebp)
e53: 8b 45 08 mov 0x8(%ebp),%eax
e56: 0f b6 00 movzbl (%eax),%eax
e59: 88 45 fb mov %al,0xfffffffb(%ebp)
} else
break;
}
e5c: e9 1a ff ff ff jmp d7b <inet_aton+0x7b>
if (c == '.') {
e61: 80 7d fb 2e cmpb $0x2e,0xfffffffb(%ebp)
e65: 75 35 jne e9c <inet_aton+0x19c>
/*
* Internet format:
* a.b.c.d
* a.b.c (with c treated as 16 bits)
* a.b (with b treated as 24 bits)
*/
if (pp >= parts + 3)
e67: 8d 45 dc lea 0xffffffdc(%ebp),%eax
e6a: 83 c0 0c add $0xc,%eax
e6d: 3b 45 fc cmp 0xfffffffc(%ebp),%eax
e70: 77 0c ja e7e <inet_aton+0x17e>
return (0);
e72: c7 45 c0 00 00 00 00 movl $0x0,0xffffffc0(%ebp)
e79: e9 2b 01 00 00 jmp fa9 <inet_aton+0x2a9>
*pp++ = val;
e7e: 8b 55 fc mov 0xfffffffc(%ebp),%edx
e81: 8b 45 ec mov 0xffffffec(%ebp),%eax
e84: 89 02 mov %eax,(%edx)
e86: 83 45 fc 04 addl $0x4,0xfffffffc(%ebp)
c = *++cp;
e8a: 83 45 08 01 addl $0x1,0x8(%ebp)
e8e: 8b 45 08 mov 0x8(%ebp),%eax
e91: 0f b6 00 movzbl (%eax),%eax
e94: 88 45 fb mov %al,0xfffffffb(%ebp)
} else
break;
}
e97: e9 79 fe ff ff jmp d15 <inet_aton+0x15>
/*
* Check for trailing characters.
*/
if (c != '\0' && (!isascii(c) || !isspace(c)))
e9c: 80 7d fb 00 cmpb $0x0,0xfffffffb(%ebp)
ea0: 74 3e je ee0 <inet_aton+0x1e0>
ea2: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
ea6: 3c 1f cmp $0x1f,%al
ea8: 76 2a jbe ed4 <inet_aton+0x1d4>
eaa: 80 7d fb 00 cmpb $0x0,0xfffffffb(%ebp)
eae: 78 24 js ed4 <inet_aton+0x1d4>
eb0: 80 7d fb 20 cmpb $0x20,0xfffffffb(%ebp)
eb4: 74 2a je ee0 <inet_aton+0x1e0>
eb6: 80 7d fb 0c cmpb $0xc,0xfffffffb(%ebp)
eba: 74 24 je ee0 <inet_aton+0x1e0>
ebc: 80 7d fb 0a cmpb $0xa,0xfffffffb(%ebp)
ec0: 74 1e je ee0 <inet_aton+0x1e0>
ec2: 80 7d fb 0d cmpb $0xd,0xfffffffb(%ebp)
ec6: 74 18 je ee0 <inet_aton+0x1e0>
ec8: 80 7d fb 09 cmpb $0x9,0xfffffffb(%ebp)
ecc: 74 12 je ee0 <inet_aton+0x1e0>
ece: 80 7d fb 0b cmpb $0xb,0xfffffffb(%ebp)
ed2: 74 0c je ee0 <inet_aton+0x1e0>
return (0);
ed4: c7 45 c0 00 00 00 00 movl $0x0,0xffffffc0(%ebp)
edb: e9 c9 00 00 00 jmp fa9 <inet_aton+0x2a9>
/*
* Concoct the address according to
* the number of parts specified.
*/
n = pp - parts + 1;
ee0: 8b 55 fc mov 0xfffffffc(%ebp),%edx
ee3: 8d 45 dc lea 0xffffffdc(%ebp),%eax
ee6: 89 d1 mov %edx,%ecx
ee8: 29 c1 sub %eax,%ecx
eea: 89 c8 mov %ecx,%eax
eec: c1 f8 02 sar $0x2,%eax
eef: 83 c0 01 add $0x1,%eax
ef2: 89 45 f4 mov %eax,0xfffffff4(%ebp)
switch (n) {
ef5: 83 7d f4 04 cmpl $0x4,0xfffffff4(%ebp)
ef9: 0f 87 8b 00 00 00 ja f8a <inet_aton+0x28a>
eff: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
f02: c1 e0 02 shl $0x2,%eax
f05: 8b 80 84 11 00 00 mov 0x1184(%eax),%eax
f0b: ff e0 jmp *%eax
case 0:
return (0); /* initial nondigit */
f0d: c7 45 c0 00 00 00 00 movl $0x0,0xffffffc0(%ebp)
f14: e9 90 00 00 00 jmp fa9 <inet_aton+0x2a9>
case 1: /* a -- 32 bits */
break;
case 2: /* a.b -- 8.24 bits */
if (val > 0xffffff)
f19: 81 7d ec ff ff ff 00 cmpl $0xffffff,0xffffffec(%ebp)
f20: 76 09 jbe f2b <inet_aton+0x22b>
return (0);
f22: c7 45 c0 00 00 00 00 movl $0x0,0xffffffc0(%ebp)
f29: eb 7e jmp fa9 <inet_aton+0x2a9>
val |= parts[0] << 24;
f2b: 8b 45 dc mov 0xffffffdc(%ebp),%eax
f2e: c1 e0 18 shl $0x18,%eax
f31: 09 45 ec or %eax,0xffffffec(%ebp)
break;
f34: eb 54 jmp f8a <inet_aton+0x28a>
case 3: /* a.b.c -- 8.8.16 bits */
if (val > 0xffff)
f36: 81 7d ec ff ff 00 00 cmpl $0xffff,0xffffffec(%ebp)
f3d: 76 09 jbe f48 <inet_aton+0x248>
return (0);
f3f: c7 45 c0 00 00 00 00 movl $0x0,0xffffffc0(%ebp)
f46: eb 61 jmp fa9 <inet_aton+0x2a9>
val |= (parts[0] << 24) | (parts[1] << 16);
f48: 8b 45 dc mov 0xffffffdc(%ebp),%eax
f4b: 89 c2 mov %eax,%edx
f4d: c1 e2 18 shl $0x18,%edx
f50: 8b 45 e0 mov 0xffffffe0(%ebp),%eax
f53: c1 e0 10 shl $0x10,%eax
f56: 09 d0 or %edx,%eax
f58: 09 45 ec or %eax,0xffffffec(%ebp)
break;
f5b: eb 2d jmp f8a <inet_aton+0x28a>
case 4: /* a.b.c.d -- 8.8.8.8 bits */
if (val > 0xff)
f5d: 81 7d ec ff 00 00 00 cmpl $0xff,0xffffffec(%ebp)
f64: 76 09 jbe f6f <inet_aton+0x26f>
return (0);
f66: c7 45 c0 00 00 00 00 movl $0x0,0xffffffc0(%ebp)
f6d: eb 3a jmp fa9 <inet_aton+0x2a9>
val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
f6f: 8b 45 dc mov 0xffffffdc(%ebp),%eax
f72: 89 c2 mov %eax,%edx
f74: c1 e2 18 shl $0x18,%edx
f77: 8b 45 e0 mov 0xffffffe0(%ebp),%eax
f7a: c1 e0 10 shl $0x10,%eax
f7d: 09 c2 or %eax,%edx
f7f: 8b 45 e4 mov 0xffffffe4(%ebp),%eax
f82: c1 e0 08 shl $0x8,%eax
f85: 09 d0 or %edx,%eax
f87: 09 45 ec or %eax,0xffffffec(%ebp)
break;
}
if (addr)
f8a: 83 7d 0c 00 cmpl $0x0,0xc(%ebp)
f8e: 74 12 je fa2 <inet_aton+0x2a2>
addr->s_addr = htonl(val);
f90: 8b 45 ec mov 0xffffffec(%ebp),%eax
f93: 89 04 24 mov %eax,(%esp)
f96: e8 65 01 00 00 call 1100 <htonl>
f9b: 89 c2 mov %eax,%edx
f9d: 8b 45 0c mov 0xc(%ebp),%eax
fa0: 89 10 mov %edx,(%eax)
return (1);
fa2: c7 45 c0 01 00 00 00 movl $0x1,0xffffffc0(%ebp)
fa9: 8b 45 c0 mov 0xffffffc0(%ebp),%eax
}
fac: c9 leave
fad: c3 ret
fae: 89 f6 mov %esi,%esi
00000fb0 <inet_ntoa>:
/* Convert numeric IP address into decimal dotted ASCII representation.
* returns ptr to static buffer; not reentrant!
*/
char *inet_ntoa(struct in_addr addr)
{
fb0: 55 push %ebp
fb1: 89 e5 mov %esp,%ebp
fb3: 53 push %ebx
fb4: 83 ec 24 sub $0x24,%esp
static char str[16];
u32_t s_addr = addr.s_addr;
fb7: 8b 45 08 mov 0x8(%ebp),%eax
fba: 89 45 ec mov %eax,0xffffffec(%ebp)
char inv[3];
char *rp;
char *ap;
u8_t rem;
u8_t n;
u8_t i;
rp = str;
fbd: c7 45 f0 cc 11 00 00 movl $0x11cc,0xfffffff0(%ebp)
ap = (u8_t *)&s_addr;
fc4: 8d 45 ec lea 0xffffffec(%ebp),%eax
fc7: 89 45 f4 mov %eax,0xfffffff4(%ebp)
for(n = 0; n < 4; n++) {
fca: c6 45 fa 00 movb $0x0,0xfffffffa(%ebp)
fce: e9 af 00 00 00 jmp 1082 <inet_ntoa+0xd2>
i = 0;
fd3: c6 45 fb 00 movb $0x0,0xfffffffb(%ebp)
do {
rem = *ap % (u8_t)10;
fd7: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
fda: 0f b6 08 movzbl (%eax),%ecx
fdd: b8 67 00 00 00 mov $0x67,%eax
fe2: f6 e9 imul %cl
fe4: 66 c1 e8 08 shr $0x8,%ax
fe8: 89 c2 mov %eax,%edx
fea: c0 fa 02 sar $0x2,%dl
fed: 89 c8 mov %ecx,%eax
fef: c0 f8 07 sar $0x7,%al
ff2: 89 d3 mov %edx,%ebx
ff4: 28 c3 sub %al,%bl
ff6: 88 5d db mov %bl,0xffffffdb(%ebp)
ff9: 0f b6 45 db movzbl 0xffffffdb(%ebp),%eax
ffd: c1 e0 02 shl $0x2,%eax
1000: 02 45 db add 0xffffffdb(%ebp),%al
1003: 01 c0 add %eax,%eax
1005: 89 ca mov %ecx,%edx
1007: 28 c2 sub %al,%dl
1009: 88 55 db mov %dl,0xffffffdb(%ebp)
100c: 0f b6 5d db movzbl 0xffffffdb(%ebp),%ebx
1010: 88 5d f9 mov %bl,0xfffffff9(%ebp)
*ap /= (u8_t)10;
1013: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
1016: 0f b6 08 movzbl (%eax),%ecx
1019: b8 67 00 00 00 mov $0x67,%eax
101e: f6 e9 imul %cl
1020: 66 c1 e8 08 shr $0x8,%ax
1024: 89 c2 mov %eax,%edx
1026: c0 fa 02 sar $0x2,%dl
1029: 89 c8 mov %ecx,%eax
102b: c0 f8 07 sar $0x7,%al
102e: 28 c2 sub %al,%dl
1030: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
1033: 88 10 mov %dl,(%eax)
inv[i++] = '0' + rem;
1035: 0f b6 55 fb movzbl 0xfffffffb(%ebp),%edx
1039: 0f b6 45 f9 movzbl 0xfffffff9(%ebp),%eax
103d: 83 c0 30 add $0x30,%eax
1040: 88 44 15 e9 mov %al,0xffffffe9(%ebp,%edx,1)
1044: 80 45 fb 01 addb $0x1,0xfffffffb(%ebp)
} while(*ap);
1048: 8b 45 f4 mov 0xfffffff4(%ebp),%eax
104b: 0f b6 00 movzbl (%eax),%eax
104e: 84 c0 test %al,%al
1050: 75 85 jne fd7 <inet_ntoa+0x27>
while(i--)
1052: eb 12 jmp 1066 <inet_ntoa+0xb6>
*rp++ = inv[i];
1054: 0f b6 45 fb movzbl 0xfffffffb(%ebp),%eax
1058: 0f b6 54 05 e9 movzbl 0xffffffe9(%ebp,%eax,1),%edx
105d: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
1060: 88 10 mov %dl,(%eax)
1062: 83 45 f0 01 addl $0x1,0xfffffff0(%ebp)
1066: 80 6d fb 01 subb $0x1,0xfffffffb(%ebp)
106a: 80 7d fb ff cmpb $0xff,0xfffffffb(%ebp)
106e: 75 e4 jne 1054 <inet_ntoa+0xa4>
*rp++ = '.';
1070: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
1073: c6 00 2e movb $0x2e,(%eax)
1076: 83 45 f0 01 addl $0x1,0xfffffff0(%ebp)
ap++;
107a: 83 45 f4 01 addl $0x1,0xfffffff4(%ebp)
107e: 80 45 fa 01 addb $0x1,0xfffffffa(%ebp)
1082: 80 7d fa 03 cmpb $0x3,0xfffffffa(%ebp)
1086: 0f 86 47 ff ff ff jbe fd3 <inet_ntoa+0x23>
}
*--rp = 0;
108c: 83 6d f0 01 subl $0x1,0xfffffff0(%ebp)
1090: 8b 45 f0 mov 0xfffffff0(%ebp),%eax
1093: c6 00 00 movb $0x0,(%eax)
return str;
1096: b8 cc 11 00 00 mov $0x11cc,%eax
}
109b: 83 c4 24 add $0x24,%esp
109e: 5b pop %ebx
109f: 5d pop %ebp
10a0: c3 ret
10a1: eb 0d jmp 10b0 <htons>
10a3: 90 nop
10a4: 90 nop
10a5: 90 nop
10a6: 90 nop
10a7: 90 nop
10a8: 90 nop
10a9: 90 nop
10aa: 90 nop
10ab: 90 nop
10ac: 90 nop
10ad: 90 nop
10ae: 90 nop
10af: 90 nop
000010b0 <htons>:
#ifndef BYTE_ORDER
#error BYTE_ORDER is not defined
#endif
#if BYTE_ORDER == LITTLE_ENDIAN
u16_t
htons(u16_t n)
{
10b0: 55 push %ebp
10b1: 89 e5 mov %esp,%ebp
10b3: 83 ec 04 sub $0x4,%esp
10b6: 8b 45 08 mov 0x8(%ebp),%eax
10b9: 66 89 45 fc mov %ax,0xfffffffc(%ebp)
return ((n & 0xff) << 8) | ((n & 0xff00) >> 8);
10bd: 0f b7 45 fc movzwl 0xfffffffc(%ebp),%eax
10c1: 25 ff 00 00 00 and $0xff,%eax
10c6: c1 e0 08 shl $0x8,%eax
10c9: 89 c2 mov %eax,%edx
10cb: 0f b7 45 fc movzwl 0xfffffffc(%ebp),%eax
10cf: 25 00 ff 00 00 and $0xff00,%eax
10d4: c1 f8 08 sar $0x8,%eax
10d7: 09 d0 or %edx,%eax
10d9: 0f b7 c0 movzwl %ax,%eax
}
10dc: c9 leave
10dd: c3 ret
10de: 89 f6 mov %esi,%esi
000010e0 <ntohs>:
u16_t
ntohs(u16_t n)
{
10e0: 55 push %ebp
10e1: 89 e5 mov %esp,%ebp
10e3: 83 ec 08 sub $0x8,%esp
10e6: 8b 45 08 mov 0x8(%ebp),%eax
10e9: 66 89 45 fc mov %ax,0xfffffffc(%ebp)
return htons(n);
10ed: 0f b7 45 fc movzwl 0xfffffffc(%ebp),%eax
10f1: 89 04 24 mov %eax,(%esp)
10f4: e8 b7 ff ff ff call 10b0 <htons>
10f9: 0f b7 c0 movzwl %ax,%eax
}
10fc: c9 leave
10fd: c3 ret
10fe: 89 f6 mov %esi,%esi
00001100 <htonl>:
u32_t
htonl(u32_t n)
{
1100: 55 push %ebp
1101: 89 e5 mov %esp,%ebp
return ((n & 0xff) << 24) |
1103: 0f b6 45 08 movzbl 0x8(%ebp),%eax
1107: 89 c2 mov %eax,%edx
1109: c1 e2 18 shl $0x18,%edx
110c: 8b 45 08 mov 0x8(%ebp),%eax
110f: 25 00 ff 00 00 and $0xff00,%eax
1114: c1 e0 08 shl $0x8,%eax
1117: 09 c2 or %eax,%edx
1119: 8b 45 08 mov 0x8(%ebp),%eax
111c: 25 00 00 ff 00 and $0xff0000,%eax
1121: c1 e8 08 shr $0x8,%eax
1124: 09 c2 or %eax,%edx
1126: 8b 45 08 mov 0x8(%ebp),%eax
1129: 25 00 00 00 ff and $0xff000000,%eax
112e: c1 e8 18 shr $0x18,%eax
1131: 09 d0 or %edx,%eax
((n & 0xff00) << 8) |
((n & 0xff0000) >> 8) |
((n & 0xff000000) >> 24);
}
1133: 5d pop %ebp
1134: c3 ret
1135: 8d 74 26 00 lea 0x0(%esi),%esi
1139: 8d bc 27 00 00 00 00 lea 0x0(%edi),%edi
00001140 <ntohl>:
u32_t
ntohl(u32_t n)
{
1140: 55 push %ebp
1141: 89 e5 mov %esp,%ebp
1143: 83 ec 04 sub $0x4,%esp
return htonl(n);
1146: 8b 45 08 mov 0x8(%ebp),%eax
1149: 89 04 24 mov %eax,(%esp)
114c: e8 af ff ff ff call 1100 <htonl>
}
1151: c9 leave
1152: c3 ret
|
libsrc/_DEVELOPMENT/arch/zx/display/c/sccz80/zx_cyx2saddr.asm | teknoplop/z88dk | 0 | 161467 | <filename>libsrc/_DEVELOPMENT/arch/zx/display/c/sccz80/zx_cyx2saddr.asm
; void *zx_cyx2saddr(uchar row, uchar col)
SECTION code_clib
SECTION code_arch
PUBLIC zx_cyx2saddr
EXTERN l0_zx_cyx2saddr_callee
zx_cyx2saddr:
pop af
pop hl
pop de
push de
push hl
push af
jp l0_zx_cyx2saddr_callee
|
host/stm32gd-gpio-port.ads | ekoeppen/STM32_Generic_Ada_Drivers | 1 | 15727 | <filename>host/stm32gd-gpio-port.ads<gh_stars>1-10
with STM32_SVD.GPIO;
package STM32GD.GPIO.Port is
pragma Preelaborate;
function GPIO_Port_Representation (Port : STM32_SVD.GPIO.GPIO_Peripheral) return UInt4
with Inline;
end STM32GD.GPIO.Port;
|
data/moves/tmhm_moves.asm | zavytar/pokecolorless | 0 | 103045 | TMHMMoves:
; entries correspond to *_TMNUM enums (see constants/item_constants.asm)
; TMs
db DYNAMICPUNCH ; TM01
db HEADBUTT ; TM02
db CURSE ; TM03
db ROLLOUT ; TM04
db ROAR ; TM05
db TOXIC ; TM06
db ZAP_CANNON ; TM07
db ROCK_SMASH ; TM08
db PSYCH_UP ; TM09
db HIDDEN_POWER ; TM10
db SUNNY_DAY ; TM11
db SWEET_SCENT ; TM12
db ICE_BEAM ; TM13
db BLIZZARD ; TM14
db HYPER_BEAM ; TM15
db ICY_WIND ; TM16
db PROTECT ; TM17
db RAIN_DANCE ; TM18
db GIGA_DRAIN ; TM19
db ENDURE ; TM20
db FRUSTRATION ; TM21
db SOLARBEAM ; TM22
db IRON_TAIL ; TM23
db THUNDERBOLT ; TM24
db THUNDER ; TM25
db EARTHQUAKE ; TM26
db RETURN ; TM27
db DIG ; TM28
db PSYCHIC_M ; TM29
db SHADOW_BALL ; TM30
db MUD_SLAP ; TM31
db DOUBLE_TEAM ; TM32
db ICE_PUNCH ; TM33
db SWAGGER ; TM34
db FLAMETHROWER ; TM35
db SLUDGE_BOMB ; TM36
db SANDSTORM ; TM37
db FIRE_BLAST ; TM38
db SWIFT ; TM39
db DEFENSE_CURL ; TM40
db THUNDERPUNCH ; TM41
db DREAM_EATER ; TM42
db DETECT ; TM43
db REST ; TM44
db ATTRACT ; TM45
db THIEF ; TM46
db STEEL_WING ; TM47
db FIRE_PUNCH ; TM48
db FURY_CUTTER ; TM49
db NIGHTMARE ; TM50
; HMs
db CUT
db FLY
db SURF
db STRENGTH
db FLASH
db WHIRLPOOL
db WATERFALL
; Move tutor
db FLAMETHROWER
db THUNDERBOLT
db ICE_BEAM
db 0 ; end
|
programs/oeis/189/A189480.asm | neoneye/loda | 22 | 98088 | ; A189480: [4rn]-4[rn], where r=sqrt(5) and [ ]=floor.
; 0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,0,1,2,3,0,1,2,3,0,1,2
mul $0,2
add $0,2
mul $0,4
seq $0,60143 ; a(n) = floor(n/tau), where tau = (1 + sqrt(5))/2.
mod $0,4
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/alignment2.ads | best08618/asylo | 7 | 234 | <gh_stars>1-10
-- { dg-do compile }
with Interfaces; use Interfaces;
package Alignment2 is
pragma Warnings (Off, "*size*");
-- warning
type R1 is record
A, B, C, D : Integer_8;
end record;
for R1'Size use 32;
for R1'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- warning
type R2 is record
A, B, C, D : Integer_8;
end record;
for R2'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- OK, big size
type R3 is record
A, B, C, D : Integer_8;
end record;
for R3'Size use 32 * 8;
for R3'Alignment use 32;
-- OK, big size
type R4 is record
A, B, C, D, E, F, G, H : Integer_32;
end record;
for R4'Alignment use 32;
-- warning
type I1 is new Integer_32;
for I1'Size use 32;
for I1'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- warning
type I2 is new Integer_32;
for I2'Alignment use 32; -- { dg-warning "suspiciously large alignment" }
-- OK, big size
type I3 is new Integer_32;
for I3'Size use 32 * 8; -- { dg-warning "unused" }
for I3'Alignment use 32;
end Alignment2;
|
src/ada-pulse/src/pulse-introspect.ads | mstewartgallus/linted | 0 | 7754 | -- Copyright 2016 <NAME>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-- implied. See the License for the specific language governing
-- permissions and limitations under the License.
with System;
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings;
with Libc.Stdint;
with Pulse.Sample;
with Pulse.Channelmap;
with Pulse.Volume;
with Pulse.Def;
with Pulse.Context;
limited with Pulse.Format;
package Pulse.Introspect with
Spark_Mode => Off is
type pa_sink_port_info is record
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:202
description : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:203
priority : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:204
available : aliased int; -- /usr/include/pulse/introspect.h:205
end record;
pragma Convention
(C_Pass_By_Copy,
pa_sink_port_info); -- /usr/include/pulse/introspect.h:201
type pa_sink_info is record
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:212
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:213
description : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:214
sample_spec : aliased Pulse.Sample
.pa_sample_spec; -- /usr/include/pulse/introspect.h:215
channel_map : aliased Pulse.Channelmap
.pa_channel_map; -- /usr/include/pulse/introspect.h:216
owner_module : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:217
volume : aliased Pulse.Volume
.pa_cvolume; -- /usr/include/pulse/introspect.h:218
mute : aliased int; -- /usr/include/pulse/introspect.h:219
monitor_source : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:220
monitor_source_name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:221
latency : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:222
driver : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:223
flags : aliased Pulse.Def
.pa_sink_flags_t; -- /usr/include/pulse/introspect.h:224
proplist : System.Address; -- /usr/include/pulse/introspect.h:225
configured_latency : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:226
base_volume : aliased Pulse.Volume
.pa_volume_t; -- /usr/include/pulse/introspect.h:227
state : aliased Pulse.Def
.pa_sink_state_t; -- /usr/include/pulse/introspect.h:228
n_volume_steps : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:229
card : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:230
n_ports : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:231
ports : System.Address; -- /usr/include/pulse/introspect.h:232
active_port : access pa_sink_port_info; -- /usr/include/pulse/introspect.h:233
n_formats : aliased Libc.Stdint
.uint8_t; -- /usr/include/pulse/introspect.h:234
formats : System.Address; -- /usr/include/pulse/introspect.h:235
end record;
pragma Convention
(C_Pass_By_Copy,
pa_sink_info); -- /usr/include/pulse/introspect.h:211
type pa_sink_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_sink_info_cb_t); -- /usr/include/pulse/introspect.h:239
function pa_context_get_sink_info_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
cb : pa_sink_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:242
pragma Import
(C,
pa_context_get_sink_info_by_name,
"pa_context_get_sink_info_by_name");
function pa_context_get_sink_info_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_sink_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:245
pragma Import
(C,
pa_context_get_sink_info_by_index,
"pa_context_get_sink_info_by_index");
function pa_context_get_sink_info_list
(c : System.Address;
cb : pa_sink_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:248
pragma Import
(C,
pa_context_get_sink_info_list,
"pa_context_get_sink_info_list");
function pa_context_set_sink_volume_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
volume : access constant Pulse.Volume.pa_cvolume;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:251
pragma Import
(C,
pa_context_set_sink_volume_by_index,
"pa_context_set_sink_volume_by_index");
function pa_context_set_sink_volume_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
volume : access constant Pulse.Volume.pa_cvolume;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:254
pragma Import
(C,
pa_context_set_sink_volume_by_name,
"pa_context_set_sink_volume_by_name");
function pa_context_set_sink_mute_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
mute : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:257
pragma Import
(C,
pa_context_set_sink_mute_by_index,
"pa_context_set_sink_mute_by_index");
function pa_context_set_sink_mute_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
mute : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:260
pragma Import
(C,
pa_context_set_sink_mute_by_name,
"pa_context_set_sink_mute_by_name");
function pa_context_suspend_sink_by_name
(c : System.Address;
sink_name : Interfaces.C.Strings.chars_ptr;
suspend : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:263
pragma Import
(C,
pa_context_suspend_sink_by_name,
"pa_context_suspend_sink_by_name");
function pa_context_suspend_sink_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
suspend : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:266
pragma Import
(C,
pa_context_suspend_sink_by_index,
"pa_context_suspend_sink_by_index");
function pa_context_set_sink_port_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
port : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:269
pragma Import
(C,
pa_context_set_sink_port_by_index,
"pa_context_set_sink_port_by_index");
function pa_context_set_sink_port_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
port : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:272
pragma Import
(C,
pa_context_set_sink_port_by_name,
"pa_context_set_sink_port_by_name");
type pa_source_port_info is record
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:282
description : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:283
priority : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:284
available : aliased int; -- /usr/include/pulse/introspect.h:285
end record;
pragma Convention
(C_Pass_By_Copy,
pa_source_port_info); -- /usr/include/pulse/introspect.h:281
type pa_source_info is record
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:292
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:293
description : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:294
sample_spec : aliased Pulse.Sample
.pa_sample_spec; -- /usr/include/pulse/introspect.h:295
channel_map : aliased Pulse.Channelmap
.pa_channel_map; -- /usr/include/pulse/introspect.h:296
owner_module : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:297
volume : aliased Pulse.Volume
.pa_cvolume; -- /usr/include/pulse/introspect.h:298
mute : aliased int; -- /usr/include/pulse/introspect.h:299
monitor_of_sink : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:300
monitor_of_sink_name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:301
latency : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:302
driver : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:303
flags : aliased Pulse.Def
.pa_source_flags_t; -- /usr/include/pulse/introspect.h:304
proplist : System.Address; -- /usr/include/pulse/introspect.h:305
configured_latency : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:306
base_volume : aliased Pulse.Volume
.pa_volume_t; -- /usr/include/pulse/introspect.h:307
state : aliased Pulse.Def
.pa_source_state_t; -- /usr/include/pulse/introspect.h:308
n_volume_steps : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:309
card : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:310
n_ports : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:311
ports : System.Address; -- /usr/include/pulse/introspect.h:312
active_port : access pa_source_port_info; -- /usr/include/pulse/introspect.h:313
n_formats : aliased Libc.Stdint
.uint8_t; -- /usr/include/pulse/introspect.h:314
formats : System.Address; -- /usr/include/pulse/introspect.h:315
end record;
pragma Convention
(C_Pass_By_Copy,
pa_source_info); -- /usr/include/pulse/introspect.h:291
type pa_source_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_source_info_cb_t); -- /usr/include/pulse/introspect.h:319
function pa_context_get_source_info_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
cb : pa_source_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:322
pragma Import
(C,
pa_context_get_source_info_by_name,
"pa_context_get_source_info_by_name");
function pa_context_get_source_info_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_source_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:325
pragma Import
(C,
pa_context_get_source_info_by_index,
"pa_context_get_source_info_by_index");
function pa_context_get_source_info_list
(c : System.Address;
cb : pa_source_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:328
pragma Import
(C,
pa_context_get_source_info_list,
"pa_context_get_source_info_list");
function pa_context_set_source_volume_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
volume : access constant Pulse.Volume.pa_cvolume;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:331
pragma Import
(C,
pa_context_set_source_volume_by_index,
"pa_context_set_source_volume_by_index");
function pa_context_set_source_volume_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
volume : access constant Pulse.Volume.pa_cvolume;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:334
pragma Import
(C,
pa_context_set_source_volume_by_name,
"pa_context_set_source_volume_by_name");
function pa_context_set_source_mute_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
mute : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:337
pragma Import
(C,
pa_context_set_source_mute_by_index,
"pa_context_set_source_mute_by_index");
function pa_context_set_source_mute_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
mute : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:340
pragma Import
(C,
pa_context_set_source_mute_by_name,
"pa_context_set_source_mute_by_name");
function pa_context_suspend_source_by_name
(c : System.Address;
source_name : Interfaces.C.Strings.chars_ptr;
suspend : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:343
pragma Import
(C,
pa_context_suspend_source_by_name,
"pa_context_suspend_source_by_name");
function pa_context_suspend_source_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
suspend : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:346
pragma Import
(C,
pa_context_suspend_source_by_index,
"pa_context_suspend_source_by_index");
function pa_context_set_source_port_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
port : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:349
pragma Import
(C,
pa_context_set_source_port_by_index,
"pa_context_set_source_port_by_index");
function pa_context_set_source_port_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
port : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:352
pragma Import
(C,
pa_context_set_source_port_by_name,
"pa_context_set_source_port_by_name");
type pa_server_info is record
user_name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:362
host_name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:363
server_version : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:364
server_name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:365
sample_spec : aliased Pulse.Sample
.pa_sample_spec; -- /usr/include/pulse/introspect.h:366
default_sink_name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:367
default_source_name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:368
cookie : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:369
channel_map : aliased Pulse.Channelmap
.pa_channel_map; -- /usr/include/pulse/introspect.h:370
end record;
pragma Convention
(C_Pass_By_Copy,
pa_server_info); -- /usr/include/pulse/introspect.h:361
type pa_server_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : System.Address);
pragma Convention
(C,
pa_server_info_cb_t); -- /usr/include/pulse/introspect.h:374
function pa_context_get_server_info
(c : System.Address;
cb : pa_server_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:377
pragma Import (C, pa_context_get_server_info, "pa_context_get_server_info");
type pa_module_info is record
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:387
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:388
argument : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:389
n_used : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:390
auto_unload : aliased int; -- /usr/include/pulse/introspect.h:392
proplist : System.Address; -- /usr/include/pulse/introspect.h:394
end record;
pragma Convention
(C_Pass_By_Copy,
pa_module_info); -- /usr/include/pulse/introspect.h:386
type pa_module_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_module_info_cb_t); -- /usr/include/pulse/introspect.h:398
function pa_context_get_module_info
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_module_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:401
pragma Import (C, pa_context_get_module_info, "pa_context_get_module_info");
function pa_context_get_module_info_list
(c : System.Address;
cb : pa_module_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:404
pragma Import
(C,
pa_context_get_module_info_list,
"pa_context_get_module_info_list");
type pa_context_index_cb_t is access procedure
(arg1 : System.Address;
arg2 : Libc.Stdint.uint32_t;
arg3 : System.Address);
pragma Convention
(C,
pa_context_index_cb_t); -- /usr/include/pulse/introspect.h:407
function pa_context_load_module
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
argument : Interfaces.C.Strings.chars_ptr;
cb : pa_context_index_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:410
pragma Import (C, pa_context_load_module, "pa_context_load_module");
function pa_context_unload_module
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:413
pragma Import (C, pa_context_unload_module, "pa_context_unload_module");
type pa_client_info is record
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:423
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:424
owner_module : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:425
driver : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:426
proplist : System.Address; -- /usr/include/pulse/introspect.h:427
end record;
pragma Convention
(C_Pass_By_Copy,
pa_client_info); -- /usr/include/pulse/introspect.h:422
type pa_client_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_client_info_cb_t); -- /usr/include/pulse/introspect.h:431
function pa_context_get_client_info
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_client_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:434
pragma Import (C, pa_context_get_client_info, "pa_context_get_client_info");
function pa_context_get_client_info_list
(c : System.Address;
cb : pa_client_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:437
pragma Import
(C,
pa_context_get_client_info_list,
"pa_context_get_client_info_list");
function pa_context_kill_client
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:440
pragma Import (C, pa_context_kill_client, "pa_context_kill_client");
type pa_card_profile_info is record
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:450
description : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:451
n_sinks : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:452
n_sources : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:453
priority : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:454
end record;
pragma Convention
(C_Pass_By_Copy,
pa_card_profile_info); -- /usr/include/pulse/introspect.h:449
type pa_card_port_info is record
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:461
description : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:462
priority : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:463
available : aliased int; -- /usr/include/pulse/introspect.h:464
direction : aliased int; -- /usr/include/pulse/introspect.h:465
n_profiles : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:466
profiles : System.Address; -- /usr/include/pulse/introspect.h:467
proplist : System.Address; -- /usr/include/pulse/introspect.h:468
latency_offset : aliased Libc.Stdint
.int64_t; -- /usr/include/pulse/introspect.h:469
end record;
pragma Convention
(C_Pass_By_Copy,
pa_card_port_info); -- /usr/include/pulse/introspect.h:460
type pa_card_info is record
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:476
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:477
owner_module : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:478
driver : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:479
n_profiles : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:480
profiles : access pa_card_profile_info; -- /usr/include/pulse/introspect.h:481
active_profile : access pa_card_profile_info; -- /usr/include/pulse/introspect.h:482
proplist : System.Address; -- /usr/include/pulse/introspect.h:483
n_ports : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:484
ports : System.Address; -- /usr/include/pulse/introspect.h:485
end record;
pragma Convention
(C_Pass_By_Copy,
pa_card_info); -- /usr/include/pulse/introspect.h:475
type pa_card_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_card_info_cb_t); -- /usr/include/pulse/introspect.h:489
function pa_context_get_card_info_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_card_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:492
pragma Import
(C,
pa_context_get_card_info_by_index,
"pa_context_get_card_info_by_index");
function pa_context_get_card_info_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
cb : pa_card_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:495
pragma Import
(C,
pa_context_get_card_info_by_name,
"pa_context_get_card_info_by_name");
function pa_context_get_card_info_list
(c : System.Address;
cb : pa_card_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:498
pragma Import
(C,
pa_context_get_card_info_list,
"pa_context_get_card_info_list");
function pa_context_set_card_profile_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
profile : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:501
pragma Import
(C,
pa_context_set_card_profile_by_index,
"pa_context_set_card_profile_by_index");
function pa_context_set_card_profile_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
profile : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:504
pragma Import
(C,
pa_context_set_card_profile_by_name,
"pa_context_set_card_profile_by_name");
function pa_context_set_port_latency_offset
(c : System.Address;
card_name : Interfaces.C.Strings.chars_ptr;
port_name : Interfaces.C.Strings.chars_ptr;
offset : Libc.Stdint.int64_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:507
pragma Import
(C,
pa_context_set_port_latency_offset,
"pa_context_set_port_latency_offset");
type pa_sink_input_info is record
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:517
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:518
owner_module : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:519
client : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:520
sink : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:521
sample_spec : aliased Pulse.Sample
.pa_sample_spec; -- /usr/include/pulse/introspect.h:522
channel_map : aliased Pulse.Channelmap
.pa_channel_map; -- /usr/include/pulse/introspect.h:523
volume : aliased Pulse.Volume
.pa_cvolume; -- /usr/include/pulse/introspect.h:524
buffer_usec : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:525
sink_usec : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:526
resample_method : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:527
driver : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:528
mute : aliased int; -- /usr/include/pulse/introspect.h:529
proplist : System.Address; -- /usr/include/pulse/introspect.h:530
corked : aliased int; -- /usr/include/pulse/introspect.h:531
has_volume : aliased int; -- /usr/include/pulse/introspect.h:532
volume_writable : aliased int; -- /usr/include/pulse/introspect.h:533
format : access Pulse.Format
.pa_format_info; -- /usr/include/pulse/introspect.h:534
end record;
pragma Convention
(C_Pass_By_Copy,
pa_sink_input_info); -- /usr/include/pulse/introspect.h:516
type pa_sink_input_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_sink_input_info_cb_t); -- /usr/include/pulse/introspect.h:538
function pa_context_get_sink_input_info
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_sink_input_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:541
pragma Import
(C,
pa_context_get_sink_input_info,
"pa_context_get_sink_input_info");
function pa_context_get_sink_input_info_list
(c : System.Address;
cb : pa_sink_input_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:544
pragma Import
(C,
pa_context_get_sink_input_info_list,
"pa_context_get_sink_input_info_list");
function pa_context_move_sink_input_by_name
(c : System.Address;
idx : Libc.Stdint.uint32_t;
sink_name : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:547
pragma Import
(C,
pa_context_move_sink_input_by_name,
"pa_context_move_sink_input_by_name");
function pa_context_move_sink_input_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
sink_idx : Libc.Stdint.uint32_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:550
pragma Import
(C,
pa_context_move_sink_input_by_index,
"pa_context_move_sink_input_by_index");
function pa_context_set_sink_input_volume
(c : System.Address;
idx : Libc.Stdint.uint32_t;
volume : access constant Pulse.Volume.pa_cvolume;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:553
pragma Import
(C,
pa_context_set_sink_input_volume,
"pa_context_set_sink_input_volume");
function pa_context_set_sink_input_mute
(c : System.Address;
idx : Libc.Stdint.uint32_t;
mute : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:556
pragma Import
(C,
pa_context_set_sink_input_mute,
"pa_context_set_sink_input_mute");
function pa_context_kill_sink_input
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:559
pragma Import (C, pa_context_kill_sink_input, "pa_context_kill_sink_input");
type pa_source_output_info is record
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:569
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:570
owner_module : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:571
client : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:572
source : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:573
sample_spec : aliased Pulse.Sample
.pa_sample_spec; -- /usr/include/pulse/introspect.h:574
channel_map : aliased Pulse.Channelmap
.pa_channel_map; -- /usr/include/pulse/introspect.h:575
buffer_usec : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:576
source_usec : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:577
resample_method : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:578
driver : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:579
proplist : System.Address; -- /usr/include/pulse/introspect.h:580
corked : aliased int; -- /usr/include/pulse/introspect.h:581
volume : aliased Pulse.Volume
.pa_cvolume; -- /usr/include/pulse/introspect.h:582
mute : aliased int; -- /usr/include/pulse/introspect.h:583
has_volume : aliased int; -- /usr/include/pulse/introspect.h:584
volume_writable : aliased int; -- /usr/include/pulse/introspect.h:585
format : access Pulse.Format
.pa_format_info; -- /usr/include/pulse/introspect.h:586
end record;
pragma Convention
(C_Pass_By_Copy,
pa_source_output_info); -- /usr/include/pulse/introspect.h:568
type pa_source_output_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_source_output_info_cb_t); -- /usr/include/pulse/introspect.h:590
function pa_context_get_source_output_info
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_source_output_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:593
pragma Import
(C,
pa_context_get_source_output_info,
"pa_context_get_source_output_info");
function pa_context_get_source_output_info_list
(c : System.Address;
cb : pa_source_output_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:596
pragma Import
(C,
pa_context_get_source_output_info_list,
"pa_context_get_source_output_info_list");
function pa_context_move_source_output_by_name
(c : System.Address;
idx : Libc.Stdint.uint32_t;
source_name : Interfaces.C.Strings.chars_ptr;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:599
pragma Import
(C,
pa_context_move_source_output_by_name,
"pa_context_move_source_output_by_name");
function pa_context_move_source_output_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
source_idx : Libc.Stdint.uint32_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:602
pragma Import
(C,
pa_context_move_source_output_by_index,
"pa_context_move_source_output_by_index");
function pa_context_set_source_output_volume
(c : System.Address;
idx : Libc.Stdint.uint32_t;
volume : access constant Pulse.Volume.pa_cvolume;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:605
pragma Import
(C,
pa_context_set_source_output_volume,
"pa_context_set_source_output_volume");
function pa_context_set_source_output_mute
(c : System.Address;
idx : Libc.Stdint.uint32_t;
mute : int;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:608
pragma Import
(C,
pa_context_set_source_output_mute,
"pa_context_set_source_output_mute");
function pa_context_kill_source_output
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:611
pragma Import
(C,
pa_context_kill_source_output,
"pa_context_kill_source_output");
type pa_stat_info is record
memblock_total : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:621
memblock_total_size : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:622
memblock_allocated : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:623
memblock_allocated_size : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:624
scache_size : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:625
end record;
pragma Convention
(C_Pass_By_Copy,
pa_stat_info); -- /usr/include/pulse/introspect.h:620
type pa_stat_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : System.Address);
pragma Convention
(C,
pa_stat_info_cb_t); -- /usr/include/pulse/introspect.h:629
function pa_context_stat
(c : System.Address;
cb : pa_stat_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:632
pragma Import (C, pa_context_stat, "pa_context_stat");
type pa_sample_info is record
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:642
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:643
volume : aliased Pulse.Volume
.pa_cvolume; -- /usr/include/pulse/introspect.h:644
sample_spec : aliased Pulse.Sample
.pa_sample_spec; -- /usr/include/pulse/introspect.h:645
channel_map : aliased Pulse.Channelmap
.pa_channel_map; -- /usr/include/pulse/introspect.h:646
duration : aliased Pulse.Sample
.pa_usec_t; -- /usr/include/pulse/introspect.h:647
bytes : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:648
lazy : aliased int; -- /usr/include/pulse/introspect.h:649
filename : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:650
proplist : System.Address; -- /usr/include/pulse/introspect.h:651
end record;
pragma Convention
(C_Pass_By_Copy,
pa_sample_info); -- /usr/include/pulse/introspect.h:641
type pa_sample_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_sample_info_cb_t); -- /usr/include/pulse/introspect.h:655
function pa_context_get_sample_info_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
cb : pa_sample_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:658
pragma Import
(C,
pa_context_get_sample_info_by_name,
"pa_context_get_sample_info_by_name");
function pa_context_get_sample_info_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_sample_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:661
pragma Import
(C,
pa_context_get_sample_info_by_index,
"pa_context_get_sample_info_by_index");
function pa_context_get_sample_info_list
(c : System.Address;
cb : pa_sample_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:664
pragma Import
(C,
pa_context_get_sample_info_list,
"pa_context_get_sample_info_list");
type pa_autoload_type is (PA_AUTOLOAD_SINK, PA_AUTOLOAD_SOURCE);
pragma Convention
(C,
pa_autoload_type); -- /usr/include/pulse/introspect.h:673
subtype pa_autoload_type_t is pa_autoload_type;
type pa_autoload_info is record
index : aliased Libc.Stdint
.uint32_t; -- /usr/include/pulse/introspect.h:682
name : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:683
c_type : aliased pa_autoload_type_t; -- /usr/include/pulse/introspect.h:684
module : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:685
argument : Interfaces.C.Strings
.chars_ptr; -- /usr/include/pulse/introspect.h:686
end record;
pragma Convention
(C_Pass_By_Copy,
pa_autoload_info); -- /usr/include/pulse/introspect.h:681
type pa_autoload_info_cb_t is access procedure
(arg1 : System.Address;
arg2 : System.Address;
arg3 : int;
arg4 : System.Address);
pragma Convention
(C,
pa_autoload_info_cb_t); -- /usr/include/pulse/introspect.h:690
function pa_context_get_autoload_info_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
c_type : pa_autoload_type_t;
cb : pa_autoload_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:693
pragma Import
(C,
pa_context_get_autoload_info_by_name,
"pa_context_get_autoload_info_by_name");
function pa_context_get_autoload_info_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : pa_autoload_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:696
pragma Import
(C,
pa_context_get_autoload_info_by_index,
"pa_context_get_autoload_info_by_index");
function pa_context_get_autoload_info_list
(c : System.Address;
cb : pa_autoload_info_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:699
pragma Import
(C,
pa_context_get_autoload_info_list,
"pa_context_get_autoload_info_list");
function pa_context_add_autoload
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
c_type : pa_autoload_type_t;
module : Interfaces.C.Strings.chars_ptr;
argument : Interfaces.C.Strings.chars_ptr;
arg6 : pa_context_index_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:702
pragma Import (C, pa_context_add_autoload, "pa_context_add_autoload");
function pa_context_remove_autoload_by_name
(c : System.Address;
name : Interfaces.C.Strings.chars_ptr;
c_type : pa_autoload_type_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:705
pragma Import
(C,
pa_context_remove_autoload_by_name,
"pa_context_remove_autoload_by_name");
function pa_context_remove_autoload_by_index
(c : System.Address;
idx : Libc.Stdint.uint32_t;
cb : Pulse.Context.pa_context_success_cb_t;
userdata : System.Address)
return System.Address; -- /usr/include/pulse/introspect.h:708
pragma Import
(C,
pa_context_remove_autoload_by_index,
"pa_context_remove_autoload_by_index");
end Pulse.Introspect;
|
unittests/ASM/H0F38/66_01.asm | cobalt2727/FEX | 628 | 20265 | %ifdef CONFIG
{
"RegData": {
"XMM0": ["0xA4A6ACAE84868C8E", "0xE4E6ECEEC4C6CCCE"],
"XMM1": ["0xE4E6ECEEC4C6CCCE", "0xA4A6ACAE84868C8E"]
}
}
%endif
mov rdx, 0xe0000000
mov rax, 0x4142434445464748
mov [rdx + 8 * 0], rax
mov rax, 0x5152535455565758
mov [rdx + 8 * 1], rax
mov rax, 0x6162636465666768
mov [rdx + 8 * 2], rax
mov rax, 0x7172737475767778
mov [rdx + 8 * 3], rax
movaps xmm0, [rdx + 8 * 0]
movaps xmm1, [rdx + 8 * 2]
phaddw xmm0, [rdx + 8 * 2]
phaddw xmm1, [rdx + 8 * 0]
hlt
|
Transynther/x86/_processed/NONE/_xt_sm_/i7-7700_9_0x48_notsx.log_21829_1075.asm | ljhsiun2/medusa | 9 | 10932 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %rax
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0xc6fd, %rbx
nop
nop
nop
sub %rax, %rax
movb $0x61, (%rbx)
nop
nop
nop
cmp %rbp, %rbp
lea addresses_A_ht+0x18b59, %rsi
lea addresses_normal_ht+0xce09, %rdi
nop
nop
nop
nop
nop
sub %r11, %r11
mov $42, %rcx
rep movsb
sub %r13, %r13
lea addresses_WC_ht+0xe359, %rsi
lea addresses_D_ht+0x76f6, %rdi
nop
nop
nop
nop
xor %rbp, %rbp
mov $13, %rcx
rep movsl
xor $42633, %rsi
lea addresses_UC_ht+0x1cb59, %rdi
nop
nop
and %rbp, %rbp
mov (%rdi), %r13w
nop
inc %rbp
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %rax
pop %r13
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r8
push %rax
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
// Store
lea addresses_normal+0x1eb59, %rax
nop
nop
sub $2115, %r8
mov $0x5152535455565758, %rsi
movq %rsi, %xmm0
vmovups %ymm0, (%rax)
xor $46162, %rbx
// Store
lea addresses_WT+0xc329, %rdi
nop
nop
nop
inc %rcx
mov $0x5152535455565758, %rbx
movq %rbx, %xmm1
vmovups %ymm1, (%rdi)
nop
cmp $1854, %rax
// Store
lea addresses_WC+0x5b59, %rcx
clflush (%rcx)
nop
nop
nop
sub %r8, %r8
movl $0x51525354, (%rcx)
nop
nop
add %rax, %rax
// Store
lea addresses_RW+0x17179, %rbx
xor $64501, %rbp
movw $0x5152, (%rbx)
nop
nop
nop
nop
cmp $57009, %rdi
// Load
lea addresses_D+0x12ef9, %rax
nop
nop
add %r8, %r8
mov (%rax), %rbp
nop
nop
nop
nop
add %rsi, %rsi
// Faulty Load
lea addresses_normal+0x1eb59, %rdi
xor %r8, %r8
movb (%rdi), %al
lea oracles, %rbx
and $0xff, %rax
shlq $12, %rax
mov (%rbx,%rax,1), %rax
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %rax
pop %r8
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'same': False, 'NT': False, 'AVXalign': False, 'size': 4, 'type': 'addresses_normal', 'congruent': 0}}
{'dst': {'same': True, 'NT': False, 'AVXalign': False, 'size': 32, 'type': 'addresses_normal', 'congruent': 0}, 'OP': 'STOR'}
{'dst': {'same': False, 'NT': False, 'AVXalign': False, 'size': 32, 'type': 'addresses_WT', 'congruent': 4}, 'OP': 'STOR'}
{'dst': {'same': False, 'NT': False, 'AVXalign': False, 'size': 4, 'type': 'addresses_WC', 'congruent': 10}, 'OP': 'STOR'}
{'dst': {'same': False, 'NT': False, 'AVXalign': False, 'size': 2, 'type': 'addresses_RW', 'congruent': 5}, 'OP': 'STOR'}
{'OP': 'LOAD', 'src': {'same': False, 'NT': False, 'AVXalign': False, 'size': 8, 'type': 'addresses_D', 'congruent': 5}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'same': True, 'NT': False, 'AVXalign': False, 'size': 1, 'type': 'addresses_normal', 'congruent': 0}}
<gen_prepare_buffer>
{'dst': {'same': False, 'NT': False, 'AVXalign': False, 'size': 1, 'type': 'addresses_WC_ht', 'congruent': 2}, 'OP': 'STOR'}
{'dst': {'same': True, 'congruent': 2, 'type': 'addresses_normal_ht'}, 'OP': 'REPM', 'src': {'same': True, 'congruent': 11, 'type': 'addresses_A_ht'}}
{'dst': {'same': False, 'congruent': 0, 'type': 'addresses_D_ht'}, 'OP': 'REPM', 'src': {'same': False, 'congruent': 10, 'type': 'addresses_WC_ht'}}
{'OP': 'LOAD', 'src': {'same': False, 'NT': False, 'AVXalign': True, 'size': 2, 'type': 'addresses_UC_ht', 'congruent': 8}}
{'58': 21829}
58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58
*/
|
src/fltk-images-rgb.ads | micahwelf/FLTK-Ada | 1 | 2805 |
package FLTK.Images.RGB is
type RGB_Image is new Image with private;
type RGB_Image_Reference (Data : not null access RGB_Image'Class) is limited null record
with Implicit_Dereference => Data;
function Copy
(This : in RGB_Image;
Width, Height : in Natural)
return RGB_Image'Class;
function Copy
(This : in RGB_Image)
return RGB_Image'Class;
procedure Color_Average
(This : in out RGB_Image;
Col : in Color;
Amount : in Blend);
procedure Desaturate
(This : in out RGB_Image);
procedure Draw
(This : in RGB_Image;
X, Y : in Integer);
procedure Draw
(This : in RGB_Image;
X, Y, W, H : in Integer;
CX, CY : in Integer := 0);
private
type RGB_Image is new Image with null record;
overriding procedure Finalize
(This : in out RGB_Image);
pragma Inline (Copy);
pragma Inline (Color_Average);
pragma Inline (Desaturate);
pragma Inline (Draw);
end FLTK.Images.RGB;
|
oeis/037/A037603.asm | neoneye/loda-programs | 11 | 163238 | ; A037603: Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,3,0.
; Submitted by <NAME>(s2)
; 1,13,130,1301,13013,130130,1301301,13013013,130130130,1301301301,13013013013,130130130130,1301301301301,13013013013013,130130130130130,1301301301301301
mov $2,$0
add $2,1
mov $4,$0
lpb $2
mov $0,$4
sub $2,1
sub $0,$2
add $0,7
mod $0,3
mul $1,10
mov $3,8
sub $3,$0
mul $3,$0
div $3,4
add $1,$3
lpe
mov $0,$1
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/check_elaboration_code.adb | best08618/asylo | 7 | 4335 | <filename>gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/check_elaboration_code.adb
-- { dg-do run }
with Bug_Elaboration_Code; use Bug_Elaboration_Code;
procedure Check_Elaboration_Code is
begin
if I /= J then
raise Program_Error;
end if;
end Check_Elaboration_Code;
|
projects/Kirbys_Dream_Land_2.windfish/configuration/macros/changebank.asm | jverkoey/awaken | 68 | 86847 | <filename>projects/Kirbys_Dream_Land_2.windfish/configuration/macros/changebank.asm
ld a, #1
ld [$2100], a |
oeis/315/A315401.asm | neoneye/loda-programs | 11 | 247536 | ; A315401: Coordination sequence Gal.4.63.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
; Submitted by <NAME>
; 1,6,11,15,19,23,28,34,40,45,49,53,57,62,68,74,79,83,87,91,96,102,108,113,117,121,125,130,136,142,147,151,155,159,164,170,176,181,185,189,193,198,204,210,215,219,223,227,232,238
mov $5,$0
mul $0,2
add $0,6
mov $3,3
mov $4,1
lpb $0
mov $2,$0
sub $2,10
add $3,6
add $4,6
trn $2,$4
add $2,$3
mov $0,$2
lpe
sub $0,6
trn $0,1
lpb $5
add $0,4
sub $5,1
lpe
add $0,1
|
src/coreclr/src/vm/amd64/AsmHelpers.asm | abock/runtime | 6 | 88063 | ; Licensed to the .NET Foundation under one or more agreements.
; The .NET Foundation licenses this file to you under the MIT license.
; See the LICENSE file in the project root for more information.
; ==++==
;
;
; ==--==
;
; FILE: asmhelpers.asm
;
;
; ======================================================================================
include AsmMacros.inc
include asmconstants.inc
extern JIT_InternalThrow:proc
extern NDirectImportWorker:proc
extern ThePreStub:proc
extern ProfileEnter:proc
extern ProfileLeave:proc
extern ProfileTailcall:proc
extern OnHijackWorker:proc
extern JIT_RareDisableHelperWorker:proc
ifdef _DEBUG
extern DebugCheckStubUnwindInfoWorker:proc
endif
GenerateArrayOpStubExceptionCase macro ErrorCaseName, ExceptionName
NESTED_ENTRY ErrorCaseName&_RSIRDI_ScratchArea, _TEXT
; account for scratch area, rsi, rdi already on the stack
.allocstack 38h
END_PROLOGUE
mov rcx, CORINFO_&ExceptionName&_ASM
; begin epilogue
add rsp, 28h ; pop callee scratch area
pop rdi
pop rsi
jmp JIT_InternalThrow
NESTED_END ErrorCaseName&_RSIRDI_ScratchArea, _TEXT
NESTED_ENTRY ErrorCaseName&_ScratchArea, _TEXT
; account for scratch area already on the stack
.allocstack 28h
END_PROLOGUE
mov rcx, CORINFO_&ExceptionName&_ASM
; begin epilogue
add rsp, 28h ; pop callee scratch area
jmp JIT_InternalThrow
NESTED_END ErrorCaseName&_ScratchArea, _TEXT
NESTED_ENTRY ErrorCaseName&_RSIRDI, _TEXT
; account for rsi, rdi already on the stack
.allocstack 10h
END_PROLOGUE
mov rcx, CORINFO_&ExceptionName&_ASM
; begin epilogue
pop rdi
pop rsi
jmp JIT_InternalThrow
NESTED_END ErrorCaseName&_RSIRDI, _TEXT
LEAF_ENTRY ErrorCaseName, _TEXT
mov rcx, CORINFO_&ExceptionName&_ASM
; begin epilogue
jmp JIT_InternalThrow
LEAF_END ErrorCaseName, _TEXT
endm
GenerateArrayOpStubExceptionCase ArrayOpStubNullException, NullReferenceException
GenerateArrayOpStubExceptionCase ArrayOpStubRangeException, IndexOutOfRangeException
GenerateArrayOpStubExceptionCase ArrayOpStubTypeMismatchException, ArrayTypeMismatchException
; EXTERN_C int __fastcall HelperMethodFrameRestoreState(
; INDEBUG_COMMA(HelperMethodFrame *pFrame)
; MachState *pState
; )
LEAF_ENTRY HelperMethodFrameRestoreState, _TEXT
ifdef _DEBUG
mov rcx, rdx
endif
; Check if the MachState is valid
xor eax, eax
cmp qword ptr [rcx + OFFSETOF__MachState___pRetAddr], rax
jne @F
REPRET
@@:
;
; If a preserved register were pushed onto the stack between
; the managed caller and the H_M_F, m_pReg will point to its
; location on the stack and it would have been updated on the
; stack by the GC already and it will be popped back into the
; appropriate register when the appropriate epilog is run.
;
; Otherwise, the register is preserved across all the code
; in this HCALL or FCALL, so we need to update those registers
; here because the GC will have updated our copies in the
; frame.
;
; So, if m_pReg points into the MachState, we need to update
; the register here. That's what this macro does.
;
RestoreReg macro reg, regnum
lea rax, [rcx + OFFSETOF__MachState__m_Capture + 8 * regnum]
mov rdx, [rcx + OFFSETOF__MachState__m_Ptrs + 8 * regnum]
cmp rax, rdx
cmove reg, [rax]
endm
; regnum has to match ENUM_CALLEE_SAVED_REGISTERS macro
RestoreReg Rdi, 0
RestoreReg Rsi, 1
RestoreReg Rbx, 2
RestoreReg Rbp, 3
RestoreReg R12, 4
RestoreReg R13, 5
RestoreReg R14, 6
RestoreReg R15, 7
xor eax, eax
ret
LEAF_END HelperMethodFrameRestoreState, _TEXT
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; NDirectImportThunk
;;
;; In addition to being called by the EE, this function can be called
;; directly from code generated by JIT64 for CRT optimized direct
;; P/Invoke calls. If it is modified, the JIT64 compiler's code
;; generation will need to altered accordingly.
;;
; EXTERN_C VOID __stdcall NDirectImportThunk();
NESTED_ENTRY NDirectImportThunk, _TEXT
;
; Allocate space for XMM parameter registers and callee scratch area.
;
alloc_stack 68h
;
; Save integer parameter registers.
; Make sure to preserve r11 as well as it is used to pass the stack argument size from JIT
;
save_reg_postrsp rcx, 70h
save_reg_postrsp rdx, 78h
save_reg_postrsp r8, 80h
save_reg_postrsp r9, 88h
save_reg_postrsp r11, 60h
save_xmm128_postrsp xmm0, 20h
save_xmm128_postrsp xmm1, 30h
save_xmm128_postrsp xmm2, 40h
save_xmm128_postrsp xmm3, 50h
END_PROLOGUE
;
; Call NDirectImportWorker w/ the NDirectMethodDesc*
;
mov rcx, METHODDESC_REGISTER
call NDirectImportWorker
;
; Restore parameter registers
;
mov rcx, [rsp + 70h]
mov rdx, [rsp + 78h]
mov r8, [rsp + 80h]
mov r9, [rsp + 88h]
mov r11, [rsp + 60h]
movdqa xmm0, [rsp + 20h]
movdqa xmm1, [rsp + 30h]
movdqa xmm2, [rsp + 40h]
movdqa xmm3, [rsp + 50h]
;
; epilogue, rax contains the native target address
;
add rsp, 68h
TAILJMP_RAX
NESTED_END NDirectImportThunk, _TEXT
;------------------------------------------------
; JIT_RareDisableHelper
;
; The JIT expects this helper to preserve all
; registers that can be used for return values
;
NESTED_ENTRY JIT_RareDisableHelper, _TEXT
alloc_stack 38h
END_PROLOGUE
movdqa [rsp+20h], xmm0 ; Save xmm0
mov [rsp+30h], rax ; Save rax
call JIT_RareDisableHelperWorker
movdqa xmm0, [rsp+20h] ; Restore xmm0
mov rax, [rsp+30h] ; Restore rax
add rsp, 38h
ret
NESTED_END JIT_RareDisableHelper, _TEXT
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; PrecodeFixupThunk
;;
;; The call in fixup precode initally points to this function.
;; The pupose of this function is to load the MethodDesc and forward the call the prestub.
;;
; EXTERN_C VOID __stdcall PrecodeFixupThunk();
LEAF_ENTRY PrecodeFixupThunk, _TEXT
pop rax ; Pop the return address. It points right after the call instruction in the precode.
; Inline computation done by FixupPrecode::GetMethodDesc()
movzx r10,byte ptr [rax+2] ; m_PrecodeChunkIndex
movzx r11,byte ptr [rax+1] ; m_MethodDescChunkIndex
mov rax,qword ptr [rax+r10*8+3]
lea METHODDESC_REGISTER,[rax+r11*8]
; Tail call to prestub
jmp ThePreStub
LEAF_END PrecodeFixupThunk, _TEXT
; extern "C" void setFPReturn(int fpSize, INT64 retVal);
LEAF_ENTRY setFPReturn, _TEXT
cmp ecx, 4
je setFPReturn4
cmp ecx, 8
jne setFPReturnNot8
mov [rsp+10h], rdx
movsd xmm0, real8 ptr [rsp+10h]
setFPReturnNot8:
REPRET
setFPReturn4:
mov [rsp+10h], rdx
movss xmm0, real4 ptr [rsp+10h]
ret
LEAF_END setFPReturn, _TEXT
; extern "C" void getFPReturn(int fpSize, INT64 *retval);
LEAF_ENTRY getFPReturn, _TEXT
cmp ecx, 4
je getFPReturn4
cmp ecx, 8
jne getFPReturnNot8
movsd real8 ptr [rdx], xmm0
getFPReturnNot8:
REPRET
getFPReturn4:
movss real4 ptr [rdx], xmm0
ret
LEAF_END getFPReturn, _TEXT
ifdef _DEBUG
NESTED_ENTRY DebugCheckStubUnwindInfo, _TEXT
;
; rax is pushed on the stack before being trashed by the "mov rax,
; target/jmp rax" code generated by X86EmitNearJump. This stack slot
; will be reused later in the epilogue. This slot is left there to
; align rsp.
;
.allocstack 8
mov rax, [rsp]
;
; Create a CONTEXT structure. DebugCheckStubUnwindInfoWorker will
; fill in the flags.
;
alloc_stack 20h + SIZEOF__CONTEXT
mov r10, rbp
set_frame rbp, 20h
mov [rbp + OFFSETOF__CONTEXT__Rbp], r10
.savereg rbp, OFFSETOF__CONTEXT__Rbp
save_reg_frame rbx, rbp, OFFSETOF__CONTEXT__Rbx
save_reg_frame rsi, rbp, OFFSETOF__CONTEXT__Rsi
save_reg_frame rdi, rbp, OFFSETOF__CONTEXT__Rdi
save_reg_frame r12, rbp, OFFSETOF__CONTEXT__R12
save_reg_frame r13, rbp, OFFSETOF__CONTEXT__R13
save_reg_frame r14, rbp, OFFSETOF__CONTEXT__R14
save_reg_frame r15, rbp, OFFSETOF__CONTEXT__R15
save_xmm128_frame xmm6, rbp, OFFSETOF__CONTEXT__Xmm6
save_xmm128_frame xmm7, rbp, OFFSETOF__CONTEXT__Xmm7
save_xmm128_frame xmm8, rbp, OFFSETOF__CONTEXT__Xmm8
save_xmm128_frame xmm9, rbp, OFFSETOF__CONTEXT__Xmm9
save_xmm128_frame xmm10, rbp, OFFSETOF__CONTEXT__Xmm10
save_xmm128_frame xmm11, rbp, OFFSETOF__CONTEXT__Xmm11
save_xmm128_frame xmm12, rbp, OFFSETOF__CONTEXT__Xmm12
save_xmm128_frame xmm13, rbp, OFFSETOF__CONTEXT__Xmm13
save_xmm128_frame xmm14, rbp, OFFSETOF__CONTEXT__Xmm14
save_xmm128_frame xmm15, rbp, OFFSETOF__CONTEXT__Xmm15
END_PROLOGUE
mov [rbp + OFFSETOF__CONTEXT__Rax], rax
mov [rbp + OFFSETOF__CONTEXT__Rcx], rcx
mov [rbp + OFFSETOF__CONTEXT__Rdx], rdx
mov [rbp + OFFSETOF__CONTEXT__R8], r8
mov [rbp + OFFSETOF__CONTEXT__R9], r9
mov [rbp + OFFSETOF__CONTEXT__R10], r10
mov [rbp + OFFSETOF__CONTEXT__R11], r11
movdqa [rbp + OFFSETOF__CONTEXT__Xmm0], xmm0
movdqa [rbp + OFFSETOF__CONTEXT__Xmm1], xmm1
movdqa [rbp + OFFSETOF__CONTEXT__Xmm2], xmm2
movdqa [rbp + OFFSETOF__CONTEXT__Xmm3], xmm3
movdqa [rbp + OFFSETOF__CONTEXT__Xmm4], xmm4
movdqa [rbp + OFFSETOF__CONTEXT__Xmm5], xmm5
mov rax, [rbp+SIZEOF__CONTEXT+8]
mov [rbp+OFFSETOF__CONTEXT__Rip], rax
lea rax, [rbp+SIZEOF__CONTEXT+8+8]
mov [rbp+OFFSETOF__CONTEXT__Rsp], rax
;
; Align rsp
;
and rsp, -16
;
; Verify that unwinding works from the stub's CONTEXT.
;
mov rcx, rbp
call DebugCheckStubUnwindInfoWorker
;
; Restore stub's registers. rbp will be restored using "pop" in the
; epilogue.
;
mov rax, [rbp+OFFSETOF__CONTEXT__Rbp]
mov [rbp+SIZEOF__CONTEXT], rax
mov rax, [rbp+OFFSETOF__CONTEXT__Rax]
mov rbx, [rbp+OFFSETOF__CONTEXT__Rbx]
mov rcx, [rbp+OFFSETOF__CONTEXT__Rcx]
mov rdx, [rbp+OFFSETOF__CONTEXT__Rdx]
mov rsi, [rbp+OFFSETOF__CONTEXT__Rsi]
mov rdi, [rbp+OFFSETOF__CONTEXT__Rdi]
mov r8, [rbp+OFFSETOF__CONTEXT__R8]
mov r9, [rbp+OFFSETOF__CONTEXT__R9]
mov r10, [rbp+OFFSETOF__CONTEXT__R10]
mov r11, [rbp+OFFSETOF__CONTEXT__R11]
mov r12, [rbp+OFFSETOF__CONTEXT__R12]
mov r13, [rbp+OFFSETOF__CONTEXT__R13]
mov r14, [rbp+OFFSETOF__CONTEXT__R14]
mov r15, [rbp+OFFSETOF__CONTEXT__R15]
movdqa xmm0, [rbp+OFFSETOF__CONTEXT__Xmm0]
movdqa xmm1, [rbp+OFFSETOF__CONTEXT__Xmm1]
movdqa xmm2, [rbp+OFFSETOF__CONTEXT__Xmm2]
movdqa xmm3, [rbp+OFFSETOF__CONTEXT__Xmm3]
movdqa xmm4, [rbp+OFFSETOF__CONTEXT__Xmm4]
movdqa xmm5, [rbp+OFFSETOF__CONTEXT__Xmm5]
movdqa xmm6, [rbp+OFFSETOF__CONTEXT__Xmm6]
movdqa xmm7, [rbp+OFFSETOF__CONTEXT__Xmm7]
movdqa xmm8, [rbp+OFFSETOF__CONTEXT__Xmm8]
movdqa xmm9, [rbp+OFFSETOF__CONTEXT__Xmm9]
movdqa xmm10, [rbp+OFFSETOF__CONTEXT__Xmm10]
movdqa xmm11, [rbp+OFFSETOF__CONTEXT__Xmm11]
movdqa xmm12, [rbp+OFFSETOF__CONTEXT__Xmm12]
movdqa xmm13, [rbp+OFFSETOF__CONTEXT__Xmm13]
movdqa xmm14, [rbp+OFFSETOF__CONTEXT__Xmm14]
movdqa xmm15, [rbp+OFFSETOF__CONTEXT__Xmm15]
;
; epilogue
;
lea rsp, [rbp + SIZEOF__CONTEXT]
pop rbp
ret
NESTED_END DebugCheckStubUnwindInfo, _TEXT
endif ; _DEBUG
; A JITted method's return address was hijacked to return to us here.
; VOID OnHijackTripThread()
NESTED_ENTRY OnHijackTripThread, _TEXT
; Don't fiddle with this unless you change HijackFrame::UpdateRegDisplay
; and HijackObjectArgs
push rax ; make room for the real return address (Rip)
PUSH_CALLEE_SAVED_REGISTERS
push_vol_reg rax
mov rcx, rsp
alloc_stack 30h ; make extra room for xmm0
save_xmm128_postrsp xmm0, 20h
END_PROLOGUE
call OnHijackWorker
movdqa xmm0, [rsp + 20h]
add rsp, 30h
pop rax
POP_CALLEE_SAVED_REGISTERS
ret ; return to the correct place, adjusted by our caller
NESTED_END OnHijackTripThread, _TEXT
;
; typedef struct _PROFILE_PLATFORM_SPECIFIC_DATA
; {
; FunctionID *functionId; // function ID comes in the r11 register
; void *rbp;
; void *probersp;
; void *ip;
; void *profiledRsp;
; UINT64 rax;
; LPVOID hiddenArg;
; UINT64 flt0;
; UINT64 flt1;
; UINT64 flt2;
; UINT64 flt3;
; UINT32 flags;
; } PROFILE_PLATFORM_SPECIFIC_DATA, *PPROFILE_PLATFORM_SPECIFIC_DATA;
;
SIZEOF_PROFILE_PLATFORM_SPECIFIC_DATA equ 8h*11 + 4h*2 ; includes fudge to make FP_SPILL right
SIZEOF_OUTGOING_ARGUMENT_HOMES equ 8h*4
SIZEOF_FP_ARG_SPILL equ 10h*1
; Need to be careful to keep the stack 16byte aligned here, since we are pushing 3
; arguments that will align the stack and we just want to keep it aligned with our
; SIZEOF_STACK_FRAME
OFFSETOF_PLATFORM_SPECIFIC_DATA equ SIZEOF_OUTGOING_ARGUMENT_HOMES
; we'll just spill into the PROFILE_PLATFORM_SPECIFIC_DATA structure
OFFSETOF_FP_ARG_SPILL equ SIZEOF_OUTGOING_ARGUMENT_HOMES + \
SIZEOF_PROFILE_PLATFORM_SPECIFIC_DATA
SIZEOF_STACK_FRAME equ SIZEOF_OUTGOING_ARGUMENT_HOMES + \
SIZEOF_PROFILE_PLATFORM_SPECIFIC_DATA + \
SIZEOF_MAX_FP_ARG_SPILL
PROFILE_ENTER equ 1h
PROFILE_LEAVE equ 2h
PROFILE_TAILCALL equ 4h
; ***********************************************************
; NOTE:
;
; Register preservation scheme:
;
; Preserved:
; - all non-volatile registers
; - rax
; - xmm0
;
; Not Preserved:
; - integer argument registers (rcx, rdx, r8, r9)
; - floating point argument registers (xmm1-3)
; - volatile integer registers (r10, r11)
; - volatile floating point registers (xmm4-5)
;
; ***********************************************************
; void JIT_ProfilerEnterLeaveTailcallStub(UINT_PTR ProfilerHandle)
LEAF_ENTRY JIT_ProfilerEnterLeaveTailcallStub, _TEXT
REPRET
LEAF_END JIT_ProfilerEnterLeaveTailcallStub, _TEXT
;EXTERN_C void ProfileEnterNaked(FunctionIDOrClientID functionIDOrClientID, size_t profiledRsp);
NESTED_ENTRY ProfileEnterNaked, _TEXT
push_nonvol_reg rax
; Upon entry :
; rcx = clientInfo
; rdx = profiledRsp
lea rax, [rsp + 10h] ; caller rsp
mov r10, [rax - 8h] ; return address
alloc_stack SIZEOF_STACK_FRAME
; correctness of return value in structure doesn't matter for enter probe
; setup ProfilePlatformSpecificData structure
xor r8, r8;
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 0h], r8 ; r8 is null -- struct functionId field
save_reg_postrsp rbp, OFFSETOF_PLATFORM_SPECIFIC_DATA + 8h ; -- struct rbp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 10h], rax ; caller rsp -- struct probeRsp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 18h], r10 ; return address -- struct ip field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 20h], rdx ; -- struct profiledRsp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 28h], r8 ; r8 is null -- struct rax field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 30h], r8 ; r8 is null -- struct hiddenArg field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 38h], xmm0 ; -- struct flt0 field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 40h], xmm1 ; -- struct flt1 field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 48h], xmm2 ; -- struct flt2 field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 50h], xmm3 ; -- struct flt3 field
mov r10, PROFILE_ENTER
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 58h], r10d ; flags ; -- struct flags field
; we need to be able to restore the fp return register
save_xmm128_postrsp xmm0, OFFSETOF_FP_ARG_SPILL + 0h
END_PROLOGUE
; rcx already contains the clientInfo
lea rdx, [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA]
call ProfileEnter
; restore fp return register
movdqa xmm0, [rsp + OFFSETOF_FP_ARG_SPILL + 0h]
; begin epilogue
add rsp, SIZEOF_STACK_FRAME
pop rax
ret
NESTED_END ProfileEnterNaked, _TEXT
;EXTERN_C void ProfileLeaveNaked(FunctionIDOrClientID functionIDOrClientID, size_t profiledRsp);
NESTED_ENTRY ProfileLeaveNaked, _TEXT
push_nonvol_reg rax
; Upon entry :
; rcx = clientInfo
; rdx = profiledRsp
; need to be careful with rax here because it contains the return value which we want to harvest
lea r10, [rsp + 10h] ; caller rsp
mov r11, [r10 - 8h] ; return address
alloc_stack SIZEOF_STACK_FRAME
; correctness of argument registers in structure doesn't matter for leave probe
; setup ProfilePlatformSpecificData structure
xor r8, r8;
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 0h], r8 ; r8 is null -- struct functionId field
save_reg_postrsp rbp, OFFSETOF_PLATFORM_SPECIFIC_DATA + 8h ; -- struct rbp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 10h], r10 ; caller rsp -- struct probeRsp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 18h], r11 ; return address -- struct ip field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 20h], rdx ; -- struct profiledRsp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 28h], rax ; return value -- struct rax field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 30h], r8 ; r8 is null -- struct hiddenArg field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 38h], xmm0 ; -- struct flt0 field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 40h], xmm1 ; -- struct flt1 field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 48h], xmm2 ; -- struct flt2 field
movsd real8 ptr [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 50h], xmm3 ; -- struct flt3 field
mov r10, PROFILE_LEAVE
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 58h], r10d ; flags -- struct flags field
; we need to be able to restore the fp return register
save_xmm128_postrsp xmm0, OFFSETOF_FP_ARG_SPILL + 0h
END_PROLOGUE
; rcx already contains the clientInfo
lea rdx, [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA]
call ProfileLeave
; restore fp return register
movdqa xmm0, [rsp + OFFSETOF_FP_ARG_SPILL + 0h]
; begin epilogue
add rsp, SIZEOF_STACK_FRAME
pop rax
ret
NESTED_END ProfileLeaveNaked, _TEXT
;EXTERN_C void ProfileTailcallNaked(FunctionIDOrClientID functionIDOrClientID, size_t profiledRsp);
NESTED_ENTRY ProfileTailcallNaked, _TEXT
push_nonvol_reg rax
; Upon entry :
; rcx = clientInfo
; rdx = profiledRsp
lea rax, [rsp + 10h] ; caller rsp
mov r11, [rax - 8h] ; return address
alloc_stack SIZEOF_STACK_FRAME
; correctness of return values and argument registers in structure
; doesn't matter for tailcall probe
; setup ProfilePlatformSpecificData structure
xor r8, r8;
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 0h], r8 ; r8 is null -- struct functionId field
save_reg_postrsp rbp, OFFSETOF_PLATFORM_SPECIFIC_DATA + 8h ; -- struct rbp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 10h], rax ; caller rsp -- struct probeRsp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 18h], r11 ; return address -- struct ip field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 20h], rdx ; -- struct profiledRsp field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 28h], r8 ; r8 is null -- struct rax field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 30h], r8 ; r8 is null -- struct hiddenArg field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 38h], r8 ; r8 is null -- struct flt0 field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 40h], r8 ; r8 is null -- struct flt1 field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 48h], r8 ; r8 is null -- struct flt2 field
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 50h], r8 ; r8 is null -- struct flt3 field
mov r10, PROFILE_TAILCALL
mov [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA + 58h], r10d ; flags -- struct flags field
; we need to be able to restore the fp return register
save_xmm128_postrsp xmm0, OFFSETOF_FP_ARG_SPILL + 0h
END_PROLOGUE
; rcx already contains the clientInfo
lea rdx, [rsp + OFFSETOF_PLATFORM_SPECIFIC_DATA]
call ProfileTailcall
; restore fp return register
movdqa xmm0, [rsp + OFFSETOF_FP_ARG_SPILL + 0h]
; begin epilogue
add rsp, SIZEOF_STACK_FRAME
pop rax
ret
NESTED_END ProfileTailcallNaked, _TEXT
;; extern "C" DWORD __stdcall getcpuid(DWORD arg, unsigned char result[16]);
NESTED_ENTRY getcpuid, _TEXT
push_nonvol_reg rbx
push_nonvol_reg rsi
END_PROLOGUE
mov eax, ecx ; first arg
mov rsi, rdx ; second arg (result)
xor ecx, ecx ; clear ecx - needed for "Structured Extended Feature Flags"
cpuid
mov [rsi+ 0], eax
mov [rsi+ 4], ebx
mov [rsi+ 8], ecx
mov [rsi+12], edx
pop rsi
pop rbx
ret
NESTED_END getcpuid, _TEXT
;; extern "C" DWORD __stdcall xmmYmmStateSupport();
LEAF_ENTRY xmmYmmStateSupport, _TEXT
mov ecx, 0 ; Specify xcr0
xgetbv ; result in EDX:EAX
and eax, 06H
cmp eax, 06H ; check OS has enabled both XMM and YMM state support
jne not_supported
mov eax, 1
jmp done
not_supported:
mov eax, 0
done:
ret
LEAF_END xmmYmmStateSupport, _TEXT
;The following function uses Deterministic Cache Parameter leafs to determine the cache hierarchy information on Prescott & Above platforms.
; This function takes 3 arguments:
; Arg1 is an input to ECX. Used as index to specify which cache level to return information on by CPUID.
; Arg1 is already passed in ECX on call to getextcpuid, so no explicit assignment is required;
; Arg2 is an input to EAX. For deterministic code enumeration, we pass in 4H in arg2.
; Arg3 is a pointer to the return dwbuffer
NESTED_ENTRY getextcpuid, _TEXT
push_nonvol_reg rbx
push_nonvol_reg rsi
END_PROLOGUE
mov eax, edx ; second arg (input to EAX)
mov rsi, r8 ; third arg (pointer to return dwbuffer)
cpuid
mov [rsi+ 0], eax
mov [rsi+ 4], ebx
mov [rsi+ 8], ecx
mov [rsi+12], edx
pop rsi
pop rbx
ret
NESTED_END getextcpuid, _TEXT
; EXTERN_C void moveOWord(LPVOID* src, LPVOID* target);
; <NOTE>
; MOVDQA is not an atomic operation. You need to call this function in a crst.
; </NOTE>
LEAF_ENTRY moveOWord, _TEXT
movdqa xmm0, [rcx]
movdqa [rdx], xmm0
ret
LEAF_END moveOWord, _TEXT
extern JIT_InternalThrowFromHelper:proc
LEAF_ENTRY SinglecastDelegateInvokeStub, _TEXT
test rcx, rcx
jz NullObject
mov rax, [rcx + OFFSETOF__DelegateObject___methodPtr]
mov rcx, [rcx + OFFSETOF__DelegateObject___target] ; replace "this" pointer
jmp rax
NullObject:
mov rcx, CORINFO_NullReferenceException_ASM
jmp JIT_InternalThrow
LEAF_END SinglecastDelegateInvokeStub, _TEXT
end
|
Des_Ada/obj/b__mainp.adb | VMika/Des_Ada | 0 | 14744 | pragma Warnings (Off);
pragma Ada_95;
pragma Source_File_Name (ada_main, Spec_File_Name => "b__mainp.ads");
pragma Source_File_Name (ada_main, Body_File_Name => "b__mainp.adb");
pragma Suppress (Overflow_Check);
with System.Restrictions;
with Ada.Exceptions;
package body ada_main is
E070 : Short_Integer; pragma Import (Ada, E070, "system__os_lib_E");
E013 : Short_Integer; pragma Import (Ada, E013, "system__soft_links_E");
E023 : Short_Integer; pragma Import (Ada, E023, "system__exception_table_E");
E066 : Short_Integer; pragma Import (Ada, E066, "ada__io_exceptions_E");
E050 : Short_Integer; pragma Import (Ada, E050, "ada__strings_E");
E038 : Short_Integer; pragma Import (Ada, E038, "ada__containers_E");
E025 : Short_Integer; pragma Import (Ada, E025, "system__exceptions_E");
E017 : Short_Integer; pragma Import (Ada, E017, "system__secondary_stack_E");
E076 : Short_Integer; pragma Import (Ada, E076, "interfaces__c_E");
E052 : Short_Integer; pragma Import (Ada, E052, "ada__strings__maps_E");
E056 : Short_Integer; pragma Import (Ada, E056, "ada__strings__maps__constants_E");
E078 : Short_Integer; pragma Import (Ada, E078, "system__object_reader_E");
E045 : Short_Integer; pragma Import (Ada, E045, "system__dwarf_lines_E");
E037 : Short_Integer; pragma Import (Ada, E037, "system__traceback__symbolic_E");
E108 : Short_Integer; pragma Import (Ada, E108, "interfaces__c__strings_E");
E201 : Short_Integer; pragma Import (Ada, E201, "interfaces__cobol_E");
E118 : Short_Integer; pragma Import (Ada, E118, "system__task_info_E");
E134 : Short_Integer; pragma Import (Ada, E134, "ada__tags_E");
E153 : Short_Integer; pragma Import (Ada, E153, "ada__streams_E");
E173 : Short_Integer; pragma Import (Ada, E173, "system__file_control_block_E");
E155 : Short_Integer; pragma Import (Ada, E155, "system__finalization_root_E");
E151 : Short_Integer; pragma Import (Ada, E151, "ada__finalization_E");
E172 : Short_Integer; pragma Import (Ada, E172, "system__file_io_E");
E216 : Short_Integer; pragma Import (Ada, E216, "ada__streams__stream_io_E");
E157 : Short_Integer; pragma Import (Ada, E157, "system__storage_pools_E");
E148 : Short_Integer; pragma Import (Ada, E148, "system__finalization_masters_E");
E146 : Short_Integer; pragma Import (Ada, E146, "system__storage_pools__subpools_E");
E130 : Short_Integer; pragma Import (Ada, E130, "ada__strings__unbounded_E");
E006 : Short_Integer; pragma Import (Ada, E006, "ada__calendar_E");
E102 : Short_Integer; pragma Import (Ada, E102, "ada__real_time_E");
E168 : Short_Integer; pragma Import (Ada, E168, "ada__text_io_E");
E203 : Short_Integer; pragma Import (Ada, E203, "system__pool_global_E");
E212 : Short_Integer; pragma Import (Ada, E212, "system__sequential_io_E");
E234 : Short_Integer; pragma Import (Ada, E234, "system__tasking__initialization_E");
E242 : Short_Integer; pragma Import (Ada, E242, "system__tasking__protected_objects_E");
E246 : Short_Integer; pragma Import (Ada, E246, "system__tasking__protected_objects__entries_E");
E250 : Short_Integer; pragma Import (Ada, E250, "system__tasking__queuing_E");
E256 : Short_Integer; pragma Import (Ada, E256, "system__tasking__stages_E");
E177 : Short_Integer; pragma Import (Ada, E177, "p_structuraltypes_E");
E175 : Short_Integer; pragma Import (Ada, E175, "p_stephandler_E");
E207 : Short_Integer; pragma Import (Ada, E207, "p_stephandler__feistelhandler_E");
E209 : Short_Integer; pragma Import (Ada, E209, "p_stephandler__inputhandler_E");
E220 : Short_Integer; pragma Import (Ada, E220, "p_stephandler__iphandler_E");
E222 : Short_Integer; pragma Import (Ada, E222, "p_stephandler__keyhandler_E");
E224 : Short_Integer; pragma Import (Ada, E224, "p_stephandler__outputhandler_E");
E226 : Short_Integer; pragma Import (Ada, E226, "p_stephandler__reverseiphandler_E");
Local_Priority_Specific_Dispatching : constant String := "";
Local_Interrupt_States : constant String := "";
Is_Elaborated : Boolean := False;
procedure finalize_library is
begin
E226 := E226 - 1;
declare
procedure F1;
pragma Import (Ada, F1, "p_stephandler__reverseiphandler__finalize_spec");
begin
F1;
end;
E224 := E224 - 1;
declare
procedure F2;
pragma Import (Ada, F2, "p_stephandler__outputhandler__finalize_spec");
begin
F2;
end;
E222 := E222 - 1;
declare
procedure F3;
pragma Import (Ada, F3, "p_stephandler__keyhandler__finalize_spec");
begin
F3;
end;
E220 := E220 - 1;
declare
procedure F4;
pragma Import (Ada, F4, "p_stephandler__iphandler__finalize_spec");
begin
F4;
end;
E209 := E209 - 1;
declare
procedure F5;
pragma Import (Ada, F5, "p_stephandler__inputhandler__finalize_spec");
begin
F5;
end;
E207 := E207 - 1;
declare
procedure F6;
pragma Import (Ada, F6, "p_stephandler__feistelhandler__finalize_spec");
begin
F6;
end;
E175 := E175 - 1;
declare
procedure F7;
pragma Import (Ada, F7, "p_stephandler__finalize_spec");
begin
F7;
end;
E246 := E246 - 1;
declare
procedure F8;
pragma Import (Ada, F8, "system__tasking__protected_objects__entries__finalize_spec");
begin
F8;
end;
E212 := E212 - 1;
declare
procedure F9;
pragma Import (Ada, F9, "system__sequential_io__finalize_spec");
begin
F9;
end;
E203 := E203 - 1;
declare
procedure F10;
pragma Import (Ada, F10, "system__pool_global__finalize_spec");
begin
F10;
end;
E168 := E168 - 1;
declare
procedure F11;
pragma Import (Ada, F11, "ada__text_io__finalize_spec");
begin
F11;
end;
E130 := E130 - 1;
declare
procedure F12;
pragma Import (Ada, F12, "ada__strings__unbounded__finalize_spec");
begin
F12;
end;
E146 := E146 - 1;
declare
procedure F13;
pragma Import (Ada, F13, "system__storage_pools__subpools__finalize_spec");
begin
F13;
end;
E148 := E148 - 1;
declare
procedure F14;
pragma Import (Ada, F14, "system__finalization_masters__finalize_spec");
begin
F14;
end;
E216 := E216 - 1;
declare
procedure F15;
pragma Import (Ada, F15, "ada__streams__stream_io__finalize_spec");
begin
F15;
end;
declare
procedure F16;
pragma Import (Ada, F16, "system__file_io__finalize_body");
begin
E172 := E172 - 1;
F16;
end;
declare
procedure Reraise_Library_Exception_If_Any;
pragma Import (Ada, Reraise_Library_Exception_If_Any, "__gnat_reraise_library_exception_if_any");
begin
Reraise_Library_Exception_If_Any;
end;
end finalize_library;
procedure adafinal is
procedure s_stalib_adafinal;
pragma Import (C, s_stalib_adafinal, "system__standard_library__adafinal");
procedure Runtime_Finalize;
pragma Import (C, Runtime_Finalize, "__gnat_runtime_finalize");
begin
if not Is_Elaborated then
return;
end if;
Is_Elaborated := False;
Runtime_Finalize;
s_stalib_adafinal;
end adafinal;
type No_Param_Proc is access procedure;
procedure adainit is
Main_Priority : Integer;
pragma Import (C, Main_Priority, "__gl_main_priority");
Time_Slice_Value : Integer;
pragma Import (C, Time_Slice_Value, "__gl_time_slice_val");
WC_Encoding : Character;
pragma Import (C, WC_Encoding, "__gl_wc_encoding");
Locking_Policy : Character;
pragma Import (C, Locking_Policy, "__gl_locking_policy");
Queuing_Policy : Character;
pragma Import (C, Queuing_Policy, "__gl_queuing_policy");
Task_Dispatching_Policy : Character;
pragma Import (C, Task_Dispatching_Policy, "__gl_task_dispatching_policy");
Priority_Specific_Dispatching : System.Address;
pragma Import (C, Priority_Specific_Dispatching, "__gl_priority_specific_dispatching");
Num_Specific_Dispatching : Integer;
pragma Import (C, Num_Specific_Dispatching, "__gl_num_specific_dispatching");
Main_CPU : Integer;
pragma Import (C, Main_CPU, "__gl_main_cpu");
Interrupt_States : System.Address;
pragma Import (C, Interrupt_States, "__gl_interrupt_states");
Num_Interrupt_States : Integer;
pragma Import (C, Num_Interrupt_States, "__gl_num_interrupt_states");
Unreserve_All_Interrupts : Integer;
pragma Import (C, Unreserve_All_Interrupts, "__gl_unreserve_all_interrupts");
Detect_Blocking : Integer;
pragma Import (C, Detect_Blocking, "__gl_detect_blocking");
Default_Stack_Size : Integer;
pragma Import (C, Default_Stack_Size, "__gl_default_stack_size");
Leap_Seconds_Support : Integer;
pragma Import (C, Leap_Seconds_Support, "__gl_leap_seconds_support");
Bind_Env_Addr : System.Address;
pragma Import (C, Bind_Env_Addr, "__gl_bind_env_addr");
procedure Runtime_Initialize (Install_Handler : Integer);
pragma Import (C, Runtime_Initialize, "__gnat_runtime_initialize");
Finalize_Library_Objects : No_Param_Proc;
pragma Import (C, Finalize_Library_Objects, "__gnat_finalize_library_objects");
begin
if Is_Elaborated then
return;
end if;
Is_Elaborated := True;
Main_Priority := -1;
Time_Slice_Value := -1;
WC_Encoding := 'b';
Locking_Policy := ' ';
Queuing_Policy := ' ';
Task_Dispatching_Policy := ' ';
System.Restrictions.Run_Time_Restrictions :=
(Set =>
(False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, True, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False),
Value => (0, 0, 0, 0, 0, 0, 0, 0, 0, 0),
Violated =>
(False, False, False, True, True, False, False, True,
False, False, True, True, True, True, False, False,
False, False, False, True, True, False, True, True,
False, True, True, True, True, False, False, False,
False, False, True, False, False, True, False, True,
False, False, True, False, False, False, True, False,
False, True, True, False, True, True, False, False,
True, False, True, False, True, True, True, False,
False, True, False, True, True, True, False, True,
True, False, True, True, True, True, False, False,
True, False, False, False, False, False, True, True,
False, False, False),
Count => (0, 0, 0, 0, 0, 2, 1, 0, 0, 0),
Unknown => (False, False, False, False, False, False, True, False, False, False));
Priority_Specific_Dispatching :=
Local_Priority_Specific_Dispatching'Address;
Num_Specific_Dispatching := 0;
Main_CPU := -1;
Interrupt_States := Local_Interrupt_States'Address;
Num_Interrupt_States := 0;
Unreserve_All_Interrupts := 0;
Detect_Blocking := 0;
Default_Stack_Size := -1;
Leap_Seconds_Support := 0;
Runtime_Initialize (1);
Finalize_Library_Objects := finalize_library'access;
System.Soft_Links'Elab_Spec;
System.Exception_Table'Elab_Body;
E023 := E023 + 1;
Ada.Io_Exceptions'Elab_Spec;
E066 := E066 + 1;
Ada.Strings'Elab_Spec;
E050 := E050 + 1;
Ada.Containers'Elab_Spec;
E038 := E038 + 1;
System.Exceptions'Elab_Spec;
E025 := E025 + 1;
System.Soft_Links'Elab_Body;
E013 := E013 + 1;
Interfaces.C'Elab_Spec;
System.Os_Lib'Elab_Body;
E070 := E070 + 1;
Ada.Strings.Maps'Elab_Spec;
Ada.Strings.Maps.Constants'Elab_Spec;
E056 := E056 + 1;
System.Secondary_Stack'Elab_Body;
E017 := E017 + 1;
System.Object_Reader'Elab_Spec;
System.Dwarf_Lines'Elab_Spec;
E045 := E045 + 1;
E076 := E076 + 1;
E052 := E052 + 1;
System.Traceback.Symbolic'Elab_Body;
E037 := E037 + 1;
E078 := E078 + 1;
Interfaces.C.Strings'Elab_Spec;
E108 := E108 + 1;
Interfaces.Cobol'Elab_Spec;
E201 := E201 + 1;
System.Task_Info'Elab_Spec;
E118 := E118 + 1;
Ada.Tags'Elab_Spec;
Ada.Tags'Elab_Body;
E134 := E134 + 1;
Ada.Streams'Elab_Spec;
E153 := E153 + 1;
System.File_Control_Block'Elab_Spec;
E173 := E173 + 1;
System.Finalization_Root'Elab_Spec;
E155 := E155 + 1;
Ada.Finalization'Elab_Spec;
E151 := E151 + 1;
System.File_Io'Elab_Body;
E172 := E172 + 1;
Ada.Streams.Stream_Io'Elab_Spec;
E216 := E216 + 1;
System.Storage_Pools'Elab_Spec;
E157 := E157 + 1;
System.Finalization_Masters'Elab_Spec;
System.Finalization_Masters'Elab_Body;
E148 := E148 + 1;
System.Storage_Pools.Subpools'Elab_Spec;
E146 := E146 + 1;
Ada.Strings.Unbounded'Elab_Spec;
E130 := E130 + 1;
Ada.Calendar'Elab_Spec;
Ada.Calendar'Elab_Body;
E006 := E006 + 1;
Ada.Real_Time'Elab_Spec;
Ada.Real_Time'Elab_Body;
E102 := E102 + 1;
Ada.Text_Io'Elab_Spec;
Ada.Text_Io'Elab_Body;
E168 := E168 + 1;
System.Pool_Global'Elab_Spec;
E203 := E203 + 1;
System.Sequential_Io'Elab_Spec;
E212 := E212 + 1;
System.Tasking.Initialization'Elab_Body;
E234 := E234 + 1;
System.Tasking.Protected_Objects'Elab_Body;
E242 := E242 + 1;
System.Tasking.Protected_Objects.Entries'Elab_Spec;
E246 := E246 + 1;
System.Tasking.Queuing'Elab_Body;
E250 := E250 + 1;
System.Tasking.Stages'Elab_Body;
E256 := E256 + 1;
E177 := E177 + 1;
P_Stephandler'Elab_Spec;
P_Stephandler'Elab_Body;
E175 := E175 + 1;
P_Stephandler.Feistelhandler'Elab_Spec;
P_Stephandler.Feistelhandler'Elab_Body;
E207 := E207 + 1;
P_Stephandler.Inputhandler'Elab_Spec;
P_Stephandler.Inputhandler'Elab_Body;
E209 := E209 + 1;
P_Stephandler.Iphandler'Elab_Spec;
P_Stephandler.Iphandler'Elab_Body;
E220 := E220 + 1;
P_Stephandler.Keyhandler'Elab_Spec;
P_Stephandler.Keyhandler'Elab_Body;
E222 := E222 + 1;
P_Stephandler.Outputhandler'Elab_Spec;
P_Stephandler.Outputhandler'Elab_Body;
E224 := E224 + 1;
P_Stephandler.Reverseiphandler'Elab_Spec;
P_Stephandler.Reverseiphandler'Elab_Body;
E226 := E226 + 1;
end adainit;
procedure Ada_Main_Program;
pragma Import (Ada, Ada_Main_Program, "_ada_mainp");
function main
(argc : Integer;
argv : System.Address;
envp : System.Address)
return Integer
is
procedure Initialize (Addr : System.Address);
pragma Import (C, Initialize, "__gnat_initialize");
procedure Finalize;
pragma Import (C, Finalize, "__gnat_finalize");
SEH : aliased array (1 .. 2) of Integer;
Ensure_Reference : aliased System.Address := Ada_Main_Program_Name'Address;
pragma Volatile (Ensure_Reference);
begin
gnat_argc := argc;
gnat_argv := argv;
gnat_envp := envp;
Initialize (SEH'Address);
adainit;
Ada_Main_Program;
adafinal;
Finalize;
return (gnat_exit_status);
end;
-- BEGIN Object file/option list
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_structuraltypes.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_stephandler.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_stephandler-feistelhandler.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_stephandler-inputhandler.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_stephandler-iphandler.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_stephandler-keyhandler.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_stephandler-outputhandler.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\p_stephandler-reverseiphandler.o
-- C:\Users\vadim\des-ada\Des-Ada\obj\mainp.o
-- -LC:\Users\vadim\des-ada\Des-Ada\obj\
-- -LC:\Users\vadim\des-ada\Des-Ada\obj\
-- -LC:/gnat/2017/lib/gcc/i686-pc-mingw32/6.3.1/adalib/
-- -static
-- -lgnarl
-- -lgnat
-- -Xlinker
-- --stack=0x200000,0x1000
-- -mthreads
-- -Wl,--stack=0x2000000
-- END Object file/option list
end ada_main;
|
ACH2034/mips-assembly/integer.asm | vitormrts/si-each-usp | 1 | 247691 | ############### INTEGER
.text
.globl main
main:
ld $a0,$valor # obtem valor da memoria
addi $a0,$a0,20
li $v0,1 # imprime o inteiro $a0
syscall
li $v0,10 # exit
syscall
.data
$valor: .word 45 |
notes/FOT/FOTC/IJK.agda | asr/fotc | 11 | 9720 | <reponame>asr/fotc<filename>notes/FOT/FOTC/IJK.agda
------------------------------------------------------------------------------
-- Conversion functions i, j and k.
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module FOT.FOTC.IJK where
open import FOTC.Base
open import FOTC.Data.Nat.Type
------------------------------------------------------------------------------
data ℕ : Set where
z : ℕ
s : ℕ → ℕ
-- Conversion functions from/to ℕ and N.
i : ℕ → D
i z = zero
i (s n) = succ₁ (i n)
j : (n : ℕ) → N (i n)
j z = nzero
j (s n) = nsucc (j n)
k : {n : D} → N n → ℕ
k nzero = z
k (nsucc Nn) = s (k Nn)
_+_ : ℕ → ℕ → ℕ
z + n = n
s m + n = s (m + n)
|
ESEMPI/MOLTIPLICAZIONE.asm | Porchetta/py-pdp8-tk | 8 | 17242 | ORG 100
CLA
CLE
LDA X
CIL
SZE
BUN POS1
BUN SEC
POS1, CIR
CMA
INC
STA X
LDA UNO
ADD SEGNO
STA SEGNO
SEC, LDA Y
CIL
SZE
BUN POS2
BUN START
POS2, CIR
CMA
INC
STA Y
LDA DUE
ADD SEGNO
STA SEGNO
CLA
CLE
BUN START
START, LDA X
CIR
STA X
SZE
BUN SOMMA
NEXT, LDA X
SPA
BUN FINE
LDA Y
CIL
STA Y
BUN START
FINE, LDA SEGNO
SZA
BUN NEG
HLT
NEG, LDA RIS
CMA
INC
STA RIS
HLT
SOMMA, CLE
CLA
LDA Y
ADD RIS
STA RIS
BUN NEXT
UNO, DEC 1
DUE, DEC -1
X, DEC 5
Y, DEC 2
SEGNO, DEC 0
RIS, DEC 0
END
|
src/z80asm/dev/z80asm_lib/cpir.asm | ahjelm/z88dk | 640 | 19567 | ; Substitute for z80 cpir instruction
; aralbrec 02.2008
; flag-perfect emulation of cpir
SECTION code_l_sccz80
PUBLIC __z80asm__cpir
IF __CPU_GBZ80__
EXTERN __z80asm__ex_sp_hl
ENDIF
__z80asm__cpir:
jr nc, enterloop
call enterloop
; scf clears N and H - must set carry the hard way
push af
IF __CPU_GBZ80__
call __z80asm__ex_sp_hl
ELSE
ex (sp), hl
ENDIF
IF __CPU_INTEL__
ld a, l
or @00000001
ld l, a
ELSE
set 0, l ; set carry
ENDIF
jr retflags
loop:
inc hl
enterloop:
dec bc
cp (hl) ; compare, set flags
jr z, match
inc c
dec c
jr nz, loop
inc b
djnz loop
; .nomatch
cp (hl) ; compare, set flags
inc hl
push af
joinbc0:
IF __CPU_GBZ80__
call __z80asm__ex_sp_hl
ELSE
ex (sp), hl
ENDIF
IF __CPU_INTEL__
ld a, l
and @11111010
ld l, a
ELSE
res 0, l ; clear carry
res 2, l ; clear P/V -> BC == 0
ENDIF
jr retflags
match:
inc hl
push af
ld a, b
or c
jr z, joinbc0
IF __CPU_GBZ80__
call __z80asm__ex_sp_hl
ELSE
ex (sp), hl
ENDIF
IF __CPU_INTEL__
ld a, l
and @11111110
or @00000100
ld l, a
ELSE
res 0, l ; clear carry
set 2, l ; set P/V -> BC != 0
ENDIF
retflags:
IF __CPU_GBZ80__
call __z80asm__ex_sp_hl
ELSE
ex (sp), hl
ENDIF
pop af
ret
|
Rebuild DS_Store.applescript | ppseprus/OS-X-Spotlight-Tools | 0 | 227 | <gh_stars>0
on run {input, parameters}
repeat with i from 1 to number of (items of input)
tell application "Finder"
--After a sudden intterupt, if running the script again, there are already files that are updated
--A Shell Script is slower than checking Finder comments
if comment of (POSIX file (POSIX path of (item i of input)) as alias) is equal to "" then
--The below shell script returns the comments in the following format:
-- kMDItemFinderComment = "all the tags you added"
--With regular expressions, we remove the unwanted strings from around the comment
set strOfCmts to do shell script "mdls -n kMDItemFinderComment " & quoted form of (POSIX path of (item i of input)) & " | sed -e 's/kMDItemFinderComment = //g' | sed -e 's/\"//g'"
--Set Finder comments
set comment of (POSIX file (POSIX path of (item i of input)) as alias) to strOfCmts
end if
end tell
end repeat
return input
end run
|
Cubical/DStructures/Structures/XModule.agda | Schippmunk/cubical | 0 | 4567 | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.DStructures.Structures.XModule where
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.HLevels
open import Cubical.Foundations.Isomorphism
open import Cubical.Foundations.Structure
open import Cubical.Functions.FunExtEquiv
open import Cubical.Homotopy.Base
open import Cubical.Data.Sigma
open import Cubical.Relation.Binary
open import Cubical.Algebra.Group
open import Cubical.Structures.LeftAction
open import Cubical.DStructures.Base
open import Cubical.DStructures.Meta.Properties
open import Cubical.DStructures.Structures.Constant
open import Cubical.DStructures.Structures.Type
open import Cubical.DStructures.Structures.Group
open import Cubical.DStructures.Structures.Action
private
variable
ℓ ℓ' : Level
-------------------------------------------------
-- Definitions and properties of
-- equivariance and peiffer condition
-------------------------------------------------
module _ ((((G₀ , H) , _α_) , isAct) : Action ℓ ℓ') (φ : GroupHom H G₀) where
open GroupNotation₀ G₀
open GroupNotationᴴ H
private
f = GroupHom.fun φ
-- α is equivariant w.r.t φ if φ (g α h) ≡ g + (φ h) - g
isEquivariant : Type (ℓ-max ℓ ℓ')
isEquivariant = (g : ⟨ G₀ ⟩) → (h : ⟨ H ⟩) → f (g α h) ≡ (g +₀ f h) -₀ g
-- G₀ is a set, so isEquivariant is a proposition
isPropIsEquivariant : isProp isEquivariant
isPropIsEquivariant = isPropΠ2 (λ g h → set₀ (f (g α h)) ((g +₀ f h) -₀ g))
-- (α, φ) satisfies the peiffer condition, if
-- (φ h) α h' ≡ h + h' - h
isPeiffer : Type ℓ'
isPeiffer = (h h' : ⟨ H ⟩) → (f h) α h' ≡ (h +ᴴ h') -ᴴ h
-- H is a set, so isPeiffer is a proposition
isPropIsPeiffer : isProp isPeiffer
isPropIsPeiffer = isPropΠ2 (λ h h' → setᴴ ((f h) α h') ((h +ᴴ h') -ᴴ h))
module _ (ℓ ℓ' : Level) where
----------------------
-- Define the types of
-- - Actions α with a morphism φ
-- - Precrossed modules
-- - Crossed modules
-- and add URG structures to them
----------------------
ActionB = Σ[ (((G₀ , H) , _α_) , isAct) ∈ Action ℓ ℓ' ] (GroupHom H G₀)
PreXModule = Σ[ (α , φ) ∈ ActionB ] (isEquivariant α φ)
XModule = Σ[ ((α , φ) , isEqui) ∈ PreXModule ] (isPeiffer α φ)
-- displayed over 𝒮-Action, a morphism back
-- by lifting the morphism back over Grp² twice
𝒮ᴰ-Action\PreXModuleStr : URGStrᴰ (𝒮-Action ℓ ℓ')
(λ (((G , H) , _) , _) → GroupHom H G)
(ℓ-max ℓ ℓ')
𝒮ᴰ-Action\PreXModuleStr = VerticalLift2-𝒮ᴰ (𝒮-group ℓ ×𝒮 𝒮-group ℓ')
(𝒮ᴰ-G²\B ℓ ℓ')
(𝒮ᴰ-G²\Las ℓ ℓ')
(𝒮ᴰ-G²Las\Action ℓ ℓ')
𝒮-PreXModuleStr : URGStr ActionB (ℓ-max ℓ ℓ')
𝒮-PreXModuleStr = ∫⟨ 𝒮-Action ℓ ℓ' ⟩ 𝒮ᴰ-Action\PreXModuleStr
-- add equivariance condition
-- use that equivariance is a proposition
𝒮ᴰ-PreXModule : URGStrᴰ 𝒮-PreXModuleStr
(λ (α , φ) → isEquivariant α φ)
ℓ-zero
𝒮ᴰ-PreXModule = Subtype→Sub-𝒮ᴰ (λ (α , φ) → isEquivariant α φ , isPropIsEquivariant α φ)
𝒮-PreXModuleStr
𝒮-PreXModule : URGStr PreXModule (ℓ-max ℓ ℓ')
𝒮-PreXModule = ∫⟨ 𝒮-PreXModuleStr ⟩ 𝒮ᴰ-PreXModule
-- add the proposition isPeiffer to precrossed modules
𝒮ᴰ-XModule : URGStrᴰ 𝒮-PreXModule
(λ ((α , φ) , isEqui) → isPeiffer α φ)
ℓ-zero
𝒮ᴰ-XModule = Subtype→Sub-𝒮ᴰ (λ ((α , φ) , isEqui) → isPeiffer α φ , isPropIsPeiffer α φ)
𝒮-PreXModule
𝒮-XModule : URGStr XModule (ℓ-max ℓ ℓ')
𝒮-XModule = ∫⟨ 𝒮-PreXModule ⟩ 𝒮ᴰ-XModule
|
tests/tcl-variables-test_data-tests.adb | thindil/tashy2 | 2 | 8076 | -- This package has been generated automatically by GNATtest.
-- You are allowed to add your code to the bodies of test routines.
-- Such changes will be kept during further regeneration of this file.
-- All code placed outside of test routine bodies will be lost. The
-- code intended to set up and tear down the test environment should be
-- placed into Tcl.Variables.Test_Data.
with AUnit.Assertions; use AUnit.Assertions;
with System.Assertions;
-- begin read only
-- id:2.2/00/
--
-- This section can be used to add with clauses if necessary.
--
-- end read only
-- begin read only
-- end read only
package body Tcl.Variables.Test_Data.Tests is
-- begin read only
-- id:2.2/01/
--
-- This section can be used to add global variables and other elements.
--
-- end read only
-- begin read only
-- end read only
-- begin read only
function Wrap_Test_Tcl_Set_Var_2fed84_838ae7
(Var_Name, New_Value: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean is
begin
begin
pragma Assert
(Var_Name'Length > 0 and New_Value'Length > 0 and
Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl-variables.ads:0):Test_Tcl_SetVar test requirement violated");
end;
declare
Test_Tcl_Set_Var_2fed84_838ae7_Result: constant Boolean :=
GNATtest_Generated.GNATtest_Standard.Tcl.Variables.Tcl_Set_Var
(Var_Name, New_Value, Interpreter, Flags);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl-variables.ads:0:):Test_Tcl_SetVar test commitment violated");
end;
return Test_Tcl_Set_Var_2fed84_838ae7_Result;
end;
end Wrap_Test_Tcl_Set_Var_2fed84_838ae7;
-- end read only
-- begin read only
procedure Test_Tcl_Set_Var_test_tcl_setvar(Gnattest_T: in out Test);
procedure Test_Tcl_Set_Var_2fed84_838ae7(Gnattest_T: in out Test) renames
Test_Tcl_Set_Var_test_tcl_setvar;
-- id:2.2/2fed84775431142f/Tcl_Set_Var/1/0/test_tcl_setvar/
procedure Test_Tcl_Set_Var_test_tcl_setvar(Gnattest_T: in out Test) is
function Tcl_Set_Var
(Var_Name, New_Value: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean renames
Wrap_Test_Tcl_Set_Var_2fed84_838ae7;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Tcl_Set_Var("myvar", "2"),
"Failed to set value of Tcl variable 'myvar'");
-- begin read only
end Test_Tcl_Set_Var_test_tcl_setvar;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Set_Var2_cf5c20_939c43
(Array_Name, Index_Name, New_Value: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean is
begin
begin
pragma Assert
(Array_Name'Length > 0 and Index_Name'Length > 0 and
New_Value'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl-variables.ads:0):Test_Tcl_SetVar2 test requirement violated");
end;
declare
Test_Tcl_Set_Var2_cf5c20_939c43_Result: constant Boolean :=
GNATtest_Generated.GNATtest_Standard.Tcl.Variables.Tcl_Set_Var2
(Array_Name, Index_Name, New_Value, Interpreter, Flags);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl-variables.ads:0:):Test_Tcl_SetVar2 test commitment violated");
end;
return Test_Tcl_Set_Var2_cf5c20_939c43_Result;
end;
end Wrap_Test_Tcl_Set_Var2_cf5c20_939c43;
-- end read only
-- begin read only
procedure Test_Tcl_Set_Var2_test_tcl_setvar2(Gnattest_T: in out Test);
procedure Test_Tcl_Set_Var2_cf5c20_939c43(Gnattest_T: in out Test) renames
Test_Tcl_Set_Var2_test_tcl_setvar2;
-- id:2.2/cf5c2010f1889c78/Tcl_Set_Var2/1/0/test_tcl_setvar2/
procedure Test_Tcl_Set_Var2_test_tcl_setvar2(Gnattest_T: in out Test) is
function Tcl_Set_Var2
(Array_Name, Index_Name, New_Value: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean renames
Wrap_Test_Tcl_Set_Var2_cf5c20_939c43;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Tcl_Set_Var2("myarray", "0", "2"),
"Failed to set value of Tcl first element in 'myarray'");
-- begin read only
end Test_Tcl_Set_Var2_test_tcl_setvar2;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Get_Var_ea64a1_45f6e9
(Var_Name: String; Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return String is
begin
begin
pragma Assert
(Var_Name'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl-variables.ads:0):Test_Tcl_GetVar test requirement violated");
end;
declare
Test_Tcl_Get_Var_ea64a1_45f6e9_Result: constant String :=
GNATtest_Generated.GNATtest_Standard.Tcl.Variables.Tcl_Get_Var
(Var_Name, Interpreter, Flags);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl-variables.ads:0:):Test_Tcl_GetVar test commitment violated");
end;
return Test_Tcl_Get_Var_ea64a1_45f6e9_Result;
end;
end Wrap_Test_Tcl_Get_Var_ea64a1_45f6e9;
-- end read only
-- begin read only
procedure Test_Tcl_Get_Var_test_tcl_getvar(Gnattest_T: in out Test);
procedure Test_Tcl_Get_Var_ea64a1_45f6e9(Gnattest_T: in out Test) renames
Test_Tcl_Get_Var_test_tcl_getvar;
-- id:2.2/ea64a1eac88b0f53/Tcl_Get_Var/1/0/test_tcl_getvar/
procedure Test_Tcl_Get_Var_test_tcl_getvar(Gnattest_T: in out Test) is
function Tcl_Get_Var
(Var_Name: String; Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return String renames
Wrap_Test_Tcl_Get_Var_ea64a1_45f6e9;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if Tcl_Set_Var("myvar", "test") then
Assert
(Tcl_Get_Var("myvar") = "test",
"Failed to get value of variable 'myvar'");
end if;
Assert
(Tcl_Get_Var("nonexistingvariable") = "",
"Failed to handle non-existing Tcl variable.");
-- begin read only
end Test_Tcl_Get_Var_test_tcl_getvar;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Get_Var2_430f71_601542
(Var_Name, Index_Name: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return String is
begin
begin
pragma Assert
(Var_Name'Length > 0 and Index_Name'Length > 0 and
Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl-variables.ads:0):Test_Tcl_GetVar2 test requirement violated");
end;
declare
Test_Tcl_Get_Var2_430f71_601542_Result: constant String :=
GNATtest_Generated.GNATtest_Standard.Tcl.Variables.Tcl_Get_Var2
(Var_Name, Index_Name, Interpreter, Flags);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl-variables.ads:0:):Test_Tcl_GetVar2 test commitment violated");
end;
return Test_Tcl_Get_Var2_430f71_601542_Result;
end;
end Wrap_Test_Tcl_Get_Var2_430f71_601542;
-- end read only
-- begin read only
procedure Test_Tcl_Get_Var2_test_tcl_getvar2(Gnattest_T: in out Test);
procedure Test_Tcl_Get_Var2_430f71_601542(Gnattest_T: in out Test) renames
Test_Tcl_Get_Var2_test_tcl_getvar2;
-- id:2.2/430f716d685a4a85/Tcl_Get_Var2/1/0/test_tcl_getvar2/
procedure Test_Tcl_Get_Var2_test_tcl_getvar2(Gnattest_T: in out Test) is
function Tcl_Get_Var2
(Var_Name, Index_Name: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return String renames
Wrap_Test_Tcl_Get_Var2_430f71_601542;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if Tcl_Set_Var2("myarray", "0", "test") then
Assert
(Tcl_Get_Var2("myarray", "0") = "test",
"Failed to get value of the first element of array 'myarray'");
end if;
Assert
(Tcl_Get_Var2("nonexistingarray", "0") = "",
"Failed to handle non-existing Tcl variable.");
-- begin read only
end Test_Tcl_Get_Var2_test_tcl_getvar2;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Unset_Var_8e988e_5d27f9
(Var_Name: String; Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean is
begin
begin
pragma Assert
(Var_Name'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl-variables.ads:0):Test_Tcl_UnsetVar test requirement violated");
end;
declare
Test_Tcl_Unset_Var_8e988e_5d27f9_Result: constant Boolean :=
GNATtest_Generated.GNATtest_Standard.Tcl.Variables.Tcl_Unset_Var
(Var_Name, Interpreter, Flags);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl-variables.ads:0:):Test_Tcl_UnsetVar test commitment violated");
end;
return Test_Tcl_Unset_Var_8e988e_5d27f9_Result;
end;
end Wrap_Test_Tcl_Unset_Var_8e988e_5d27f9;
-- end read only
-- begin read only
procedure Test_Tcl_Unset_Var_test_tcl_unsetvar(Gnattest_T: in out Test);
procedure Test_Tcl_Unset_Var_8e988e_5d27f9(Gnattest_T: in out Test) renames
Test_Tcl_Unset_Var_test_tcl_unsetvar;
-- id:2.2/8e988e1e1f2bb3d6/Tcl_Unset_Var/1/0/test_tcl_unsetvar/
procedure Test_Tcl_Unset_Var_test_tcl_unsetvar(Gnattest_T: in out Test) is
function Tcl_Unset_Var
(Var_Name: String; Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean renames
Wrap_Test_Tcl_Unset_Var_8e988e_5d27f9;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if Tcl_Set_Var("myvar", "2") then
Assert(Tcl_Unset_Var("myvar"), "Failed to remove Tcl variable");
end if;
Assert
(not Tcl_Unset_Var("myvar2"),
"Failed to handle removing non-existing Tcl variable");
-- begin read only
end Test_Tcl_Unset_Var_test_tcl_unsetvar;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Unset_Var2_2a5c63_618eb3
(Var_Name, Index_Name: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean is
begin
begin
pragma Assert
(Var_Name'Length > 0 and Index_Name'Length > 0 and
Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl-variables.ads:0):Test_Tcl_UnsetVar2 test requirement violated");
end;
declare
Test_Tcl_Unset_Var2_2a5c63_618eb3_Result: constant Boolean :=
GNATtest_Generated.GNATtest_Standard.Tcl.Variables.Tcl_Unset_Var2
(Var_Name, Index_Name, Interpreter, Flags);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl-variables.ads:0:):Test_Tcl_UnsetVar2 test commitment violated");
end;
return Test_Tcl_Unset_Var2_2a5c63_618eb3_Result;
end;
end Wrap_Test_Tcl_Unset_Var2_2a5c63_618eb3;
-- end read only
-- begin read only
procedure Test_Tcl_Unset_Var2_test_tcl_unsetvar2(Gnattest_T: in out Test);
procedure Test_Tcl_Unset_Var2_2a5c63_618eb3(Gnattest_T: in out Test) renames
Test_Tcl_Unset_Var2_test_tcl_unsetvar2;
-- id:2.2/2a5c63d5dabeda5a/Tcl_Unset_Var2/1/0/test_tcl_unsetvar2/
procedure Test_Tcl_Unset_Var2_test_tcl_unsetvar2(Gnattest_T: in out Test) is
function Tcl_Unset_Var2
(Var_Name, Index_Name: String;
Interpreter: Tcl_Interpreter := Get_Interpreter;
Flags: Flags_Array := Default_Flags_Array) return Boolean renames
Wrap_Test_Tcl_Unset_Var2_2a5c63_618eb3;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if Tcl_Set_Var2("myarray", "0", "2") then
Assert
(Tcl_Unset_Var2("myarray", "0"),
"Failed to remove the element from the Tcl array");
end if;
Assert
(not Tcl_Unset_Var2("myarray", "0"),
"Failed to handle removing non-existing element from Tcl array");
-- begin read only
end Test_Tcl_Unset_Var2_test_tcl_unsetvar2;
-- end read only
-- begin read only
-- id:2.2/02/
--
-- This section can be used to add elaboration code for the global state.
--
begin
-- end read only
null;
-- begin read only
-- end read only
end Tcl.Variables.Test_Data.Tests;
|
gdb-7.3/gdb/testsuite/gdb.ada/lang_switch/lang_switch.adb | vidkidz/crossbridge | 1 | 24015 | <gh_stars>1-10
-- Copyright 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
procedure Lang_Switch is
pragma Linker_Options ("foo.o");
function C_Procedure (Msg : String) return Integer;
pragma Import(C, C_Procedure, "c_procedure");
procedure Ada_Procedure (Msg : String) is
C_Msg : String (1 .. 1024);
Tmp_Int : Integer;
begin
C_Msg (1 .. Msg'length + 1) := Msg & Ascii.Nul;
Tmp_Int := C_Procedure (Msg => C_Msg);
end Ada_Procedure;
begin
Ada_Procedure ("msg");
end Lang_Switch;
|
software/exampleIO.asm | Arkaeriit/asrm | 1 | 13513 | <filename>software/exampleIO.asm
; This small program is ment to be assembled with reflet-asm
; it asks a character from the user and print it 10 times
; To assemble it, do reflet-asm exampleIO.asm -o exampleIO.bin
; To run it, do reflet-sim exampleIO.rbin
; (As this is a 8 bit program, the default configuration is enought)
label start
set 2 ; preparing the address 2
cpy r1
set 0 ; putting 0 in 0x2 to ask for a char
str r1
set 3 ; retriving char
cpy r1
load r1
push ; preparing the address Ox1
set 1
cpy r1
pop ; putting what was in 0x3 in 0x1
str r1
set 10 ; loop pointer
push
label loop
set 0
str WR ; printing
pop
sub r1 ; Substracting one
eq r2 ; are we equal to 0 ?
push
cmpnot
setlab loop
jif
set 10 ;preparing a new line
str r1
set 0
str WR
|
src/bitmap_graphics.adb | KLOC-Karsten/adaoled | 0 | 12548 |
with Bitmap_Graphics.Icons; use Bitmap_Graphics.Icons;
with Bitmap_Graphics.Font8;
with Bitmap_Graphics.Font12;
with Bitmap_Graphics.Font16;
with Bitmap_Graphics.Font20;
with Bitmap_Graphics.Font24;
package body Bitmap_Graphics is
procedure Get_Icon
(Icon : Bitmap_Icon;
Width : out Natural;
Height: out Natural;
Data : out Byte_Array_Access) is
begin
case Icon is
when Signal =>
Width := 16;
Height := 8;
Data := Bitmap_Graphics.Icons.Signal816'access;
when Message =>
Width := 16; Height :=8;
Data := Bitmap_Graphics.Icons.Msg816'access;
when Battery =>
Width := 16; Height :=8;
Data := Bitmap_Graphics.Icons.Bat816'access;
when Bluetooth =>
Width := 8; Height :=8;
Data := Bitmap_Graphics.Icons.Bluetooth88'access;
when GPRS =>
Width := 8; Height :=8;
Data := Bitmap_Graphics.Icons.GPRS88'access;
when Alarm =>
Width := 8; Height :=8;
Data := Bitmap_Graphics.Icons.Alarm88'access;
end case;
end Get_Icon;
function Get_Font(Size: Positive) return Font_Access is
F : Font_Access;
begin
case Size is
when 8 => F := Bitmap_Graphics.Font8.Font8'access;
when 12 => F := Bitmap_Graphics.Font12.Font12'access;
when 16 => F := Bitmap_Graphics.Font16.Font16'access;
when 20 => F := Bitmap_Graphics.Font20.Font20'access;
when 24 => F := Bitmap_Graphics.Font24.Font24'access;
when others => F := Bitmap_Graphics.Font12.Font12'access;
end case;
return F;
end Get_Font;
end Bitmap_Graphics;
|
gwnum/mult3a.asm | Kasual/GIMPS | 0 | 168972 | <reponame>Kasual/GIMPS
; Copyright 1995-2007 Mersenne Research, Inc. All rights reserved
; Author: <NAME>
; Email: <EMAIL>
;
; This routine implements the 10 level 2nd pass for FFTs.
;
TITLE setup
.686
.XMM
.MODEL FLAT
INCLUDE unravel.mac
INCLUDE extrn.mac
INCLUDE lucas.mac
INCLUDE mult.mac
INCLUDE pass2.mac
INCLUDE memory.mac
_TEXT SEGMENT
flat_distances
;;*****************************************************
;; Macros to do the code common to all pass 2 routines
;;*****************************************************
;; Entry point for real FFTs: do one real and count1 complex blocks, also
;; entry point for all-complex FFTs: do count1 complex blocks
pass2_entry MACRO complex_start
int_prolog 0,0,0
cmp ALL_COMPLEX_FFT, 1 ;; Test if there is a real-data block
je complex_start ;; Jump to process all-complex blocks
ENDM
;; Exit code for pass2 routines
pass2_exit MACRO complex_start
mov esi, DESTARG ;; Restore source pointer
sub ebx, ebx ;; Clear DIST_TO_FFTSRCARG
mov DIST_TO_FFTSRCARG, ebx
int_epilog 0,0,0
ENDM
;; Routines to do the last 8 levels in a two-pass FFT
;; Distance between two pass 2 data blocks. Pass 2 does 8 FFT levels
;; 2^8 complex values = 2^9 doubles = 4KB.
blkdst = (4096+64+64)
;; Do the last 8 levels of a two pass FFT
PROCFP pass2_8_levels
pass2_entry p8cs
pass2_eight_levels_real
p8cs: mov ecx, count1 ; Number of complex iterations
mov edx, pass2_premults ; Address of the group multipliers
p8lp: pass2_eight_levels_complex
dec ecx
jnz p8lp
pass2_exit
ENDPP pass2_8_levels
;; Routines to do the last 10 levels in a two-pass FFT
;; Distance between two pass 2 data blocks. Pass 2 does 10 FFT levels
;; 2^10 complex values = 2^11 doubles = 16KB.
blkdst = (4*(4096+64)+64)
;; Do the last 10 levels of a two pass FFT
PROCFP pass2_10_levels
pass2_entry p10cs
pass2_ten_levels_real
p10cs: mov ecx, count1 ; Number of complex iterations
mov edx, pass2_premults ; Address of the group multipliers
p10lp: pass2_ten_levels_complex
dec ecx
jnz p10lp
pass2_exit
ENDPP pass2_10_levels
;; Routines to do the last 12 levels in a two-pass FFT
;; Distance between two pass 2 data blocks. Pass 2 does 12 FFT levels
;; 2^12 complex values = 2^13 doubles = 64KB.
blkdst = (16*(4096+64)+64)
;; Do the last 12 levels of a two pass FFT
PROCFP pass2_12_levels
pass2_entry p12cs
pass2_twelve_levels_real
p12cs: mov ecx, count1 ; Number of complex iterations
mov edx, pass2_premults ; Address of the group multipliers
p12lp: pass2_twelve_levels_complex
dec ecx
jnz p12lp
pass2_exit
ENDPP pass2_12_levels
_TEXT ENDS
END
|
oeis/064/A064321.asm | neoneye/loda-programs | 11 | 17701 | <filename>oeis/064/A064321.asm<gh_stars>10-100
; A064321: n*(n-1)^3*(n-2)^3*(n-3).
; Submitted by <NAME>
; 0,0,0,0,864,17280,144000,756000,2963520,9483264,26127360,64152000,143748000,298995840,584648064,1085142240,1926288000,3290112000,5433384960,8710395264,13600573920,20741616000,30968784000,45361118880,65295324864,92508134400,129168000000,177957000000,242163885600,325789236864,433663735680,571580604000,746443296000,966429573120,1241173131264,1581963989760,2001968892000,2516473008000,3143144269440,3902321708064,4817329208640,5914816128000,7225126272000,8782696762560,10626488367264,12800448904320
sub $0,1
bin $0,2
mov $1,$0
pow $0,2
bin $1,2
mul $0,$1
div $0,9
mul $0,288
|
libsrc/_DEVELOPMENT/stdlib/c/sdcc_iy/ftoa_callee.asm | meesokim/z88dk | 0 | 167496 | <filename>libsrc/_DEVELOPMENT/stdlib/c/sdcc_iy/ftoa_callee.asm
; size_t ftoa(float x, char *buf, uint16_t prec, uint16_t flag)
SECTION code_stdlib
PUBLIC _ftoa_callee
EXTERN _dtoa_callee
defc _ftoa_callee = _dtoa_callee
|
Cubical/Data/Sum/Properties.agda | Edlyr/cubical | 0 | 14571 | {-# OPTIONS --cubical --no-import-sorts --safe #-}
module Cubical.Data.Sum.Properties where
open import Cubical.Core.Everything
open import Cubical.Foundations.Prelude
open import Cubical.Foundations.HLevels
open import Cubical.Functions.Embedding
open import Cubical.Foundations.Equiv
open import Cubical.Foundations.Isomorphism
open import Cubical.Data.Empty
open import Cubical.Data.Nat
open import Cubical.Data.Sum.Base
open Iso
private
variable
ℓa ℓb ℓc ℓd : Level
A : Type ℓa
B : Type ℓb
C : Type ℓc
D : Type ℓd
-- Path space of sum type
module ⊎Path {ℓ ℓ'} {A : Type ℓ} {B : Type ℓ'} where
Cover : A ⊎ B → A ⊎ B → Type (ℓ-max ℓ ℓ')
Cover (inl a) (inl a') = Lift {j = ℓ-max ℓ ℓ'} (a ≡ a')
Cover (inl _) (inr _) = Lift ⊥
Cover (inr _) (inl _) = Lift ⊥
Cover (inr b) (inr b') = Lift {j = ℓ-max ℓ ℓ'} (b ≡ b')
reflCode : (c : A ⊎ B) → Cover c c
reflCode (inl a) = lift refl
reflCode (inr b) = lift refl
encode : ∀ c c' → c ≡ c' → Cover c c'
encode c _ = J (λ c' _ → Cover c c') (reflCode c)
encodeRefl : ∀ c → encode c c refl ≡ reflCode c
encodeRefl c = JRefl (λ c' _ → Cover c c') (reflCode c)
decode : ∀ c c' → Cover c c' → c ≡ c'
decode (inl a) (inl a') (lift p) = cong inl p
decode (inl a) (inr b') ()
decode (inr b) (inl a') ()
decode (inr b) (inr b') (lift q) = cong inr q
decodeRefl : ∀ c → decode c c (reflCode c) ≡ refl
decodeRefl (inl a) = refl
decodeRefl (inr b) = refl
decodeEncode : ∀ c c' → (p : c ≡ c') → decode c c' (encode c c' p) ≡ p
decodeEncode c _ =
J (λ c' p → decode c c' (encode c c' p) ≡ p)
(cong (decode c c) (encodeRefl c) ∙ decodeRefl c)
encodeDecode : ∀ c c' → (d : Cover c c') → encode c c' (decode c c' d) ≡ d
encodeDecode (inl a) (inl _) (lift d) =
J (λ a' p → encode (inl a) (inl a') (cong inl p) ≡ lift p) (encodeRefl (inl a)) d
encodeDecode (inr a) (inr _) (lift d) =
J (λ a' p → encode (inr a) (inr a') (cong inr p) ≡ lift p) (encodeRefl (inr a)) d
Cover≃Path : ∀ c c' → Cover c c' ≃ (c ≡ c')
Cover≃Path c c' =
isoToEquiv (iso (decode c c') (encode c c') (decodeEncode c c') (encodeDecode c c'))
isOfHLevelCover : (n : HLevel)
→ isOfHLevel (suc (suc n)) A
→ isOfHLevel (suc (suc n)) B
→ ∀ c c' → isOfHLevel (suc n) (Cover c c')
isOfHLevelCover n p q (inl a) (inl a') = isOfHLevelLift (suc n) (p a a')
isOfHLevelCover n p q (inl a) (inr b') =
isOfHLevelLift (suc n) (isProp→isOfHLevelSuc n isProp⊥)
isOfHLevelCover n p q (inr b) (inl a') =
isOfHLevelLift (suc n) (isProp→isOfHLevelSuc n isProp⊥)
isOfHLevelCover n p q (inr b) (inr b') = isOfHLevelLift (suc n) (q b b')
isEmbedding-inl : isEmbedding (inl {A = A} {B = B})
isEmbedding-inl w z = snd (compEquiv LiftEquiv (⊎Path.Cover≃Path (inl w) (inl z)))
isEmbedding-inr : isEmbedding (inr {A = A} {B = B})
isEmbedding-inr w z = snd (compEquiv LiftEquiv (⊎Path.Cover≃Path (inr w) (inr z)))
isOfHLevel⊎ : (n : HLevel)
→ isOfHLevel (suc (suc n)) A
→ isOfHLevel (suc (suc n)) B
→ isOfHLevel (suc (suc n)) (A ⊎ B)
isOfHLevel⊎ n lA lB c c' =
isOfHLevelRetract (suc n)
(⊎Path.encode c c')
(⊎Path.decode c c')
(⊎Path.decodeEncode c c')
(⊎Path.isOfHLevelCover n lA lB c c')
isSet⊎ : isSet A → isSet B → isSet (A ⊎ B)
isSet⊎ = isOfHLevel⊎ 0
isGroupoid⊎ : isGroupoid A → isGroupoid B → isGroupoid (A ⊎ B)
isGroupoid⊎ = isOfHLevel⊎ 1
is2Groupoid⊎ : is2Groupoid A → is2Groupoid B → is2Groupoid (A ⊎ B)
is2Groupoid⊎ = isOfHLevel⊎ 2
⊎Iso : Iso A C → Iso B D → Iso (A ⊎ B) (C ⊎ D)
fun (⊎Iso iac ibd) (inl x) = inl (iac .fun x)
fun (⊎Iso iac ibd) (inr x) = inr (ibd .fun x)
inv (⊎Iso iac ibd) (inl x) = inl (iac .inv x)
inv (⊎Iso iac ibd) (inr x) = inr (ibd .inv x)
rightInv (⊎Iso iac ibd) (inl x) = cong inl (iac .rightInv x)
rightInv (⊎Iso iac ibd) (inr x) = cong inr (ibd .rightInv x)
leftInv (⊎Iso iac ibd) (inl x) = cong inl (iac .leftInv x)
leftInv (⊎Iso iac ibd) (inr x) = cong inr (ibd .leftInv x)
⊎-swap-Iso : Iso (A ⊎ B) (B ⊎ A)
fun ⊎-swap-Iso (inl x) = inr x
fun ⊎-swap-Iso (inr x) = inl x
inv ⊎-swap-Iso (inl x) = inr x
inv ⊎-swap-Iso (inr x) = inl x
rightInv ⊎-swap-Iso (inl _) = refl
rightInv ⊎-swap-Iso (inr _) = refl
leftInv ⊎-swap-Iso (inl _) = refl
leftInv ⊎-swap-Iso (inr _) = refl
⊎-swap-≃ : A ⊎ B ≃ B ⊎ A
⊎-swap-≃ = isoToEquiv ⊎-swap-Iso
⊎-assoc-Iso : Iso ((A ⊎ B) ⊎ C) (A ⊎ (B ⊎ C))
fun ⊎-assoc-Iso (inl (inl x)) = inl x
fun ⊎-assoc-Iso (inl (inr x)) = inr (inl x)
fun ⊎-assoc-Iso (inr x) = inr (inr x)
inv ⊎-assoc-Iso (inl x) = inl (inl x)
inv ⊎-assoc-Iso (inr (inl x)) = inl (inr x)
inv ⊎-assoc-Iso (inr (inr x)) = inr x
rightInv ⊎-assoc-Iso (inl _) = refl
rightInv ⊎-assoc-Iso (inr (inl _)) = refl
rightInv ⊎-assoc-Iso (inr (inr _)) = refl
leftInv ⊎-assoc-Iso (inl (inl _)) = refl
leftInv ⊎-assoc-Iso (inl (inr _)) = refl
leftInv ⊎-assoc-Iso (inr _) = refl
⊎-assoc-≃ : (A ⊎ B) ⊎ C ≃ A ⊎ (B ⊎ C)
⊎-assoc-≃ = isoToEquiv ⊎-assoc-Iso
⊎-⊥-Iso : Iso (A ⊎ ⊥) A
fun ⊎-⊥-Iso (inl x) = x
inv ⊎-⊥-Iso x = inl x
rightInv ⊎-⊥-Iso x = refl
leftInv ⊎-⊥-Iso (inl x) = refl
⊎-⊥-≃ : A ⊎ ⊥ ≃ A
⊎-⊥-≃ = isoToEquiv ⊎-⊥-Iso
|
src/asf-beans-globals.adb | jquorning/ada-asf | 12 | 1390 | <filename>src/asf-beans-globals.adb
-----------------------------------------------------------------------
-- asf-beans-globals -- Bean giving access to the global init parameters
-- Copyright (C) 2012 <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 ASF.Contexts.Faces;
with ASF.Applications.Main;
package body ASF.Beans.Globals is
Bean : aliased Global_Bean;
-- ------------------------------
-- Get the init parameter identified by the given name.
-- Returns Null_Object if the application does not define such parameter.
-- ------------------------------
overriding
function Get_Value (Bean : in Global_Bean;
Name : in String) return Util.Beans.Objects.Object is
pragma Unreferenced (Bean);
use type ASF.Contexts.Faces.Faces_Context_Access;
Ctx : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
if Ctx = null then
return Util.Beans.Objects.Null_Object;
end if;
declare
App : constant ASF.Contexts.Faces.Application_Access := Ctx.Get_Application;
Param : constant String := App.Get_Init_Parameter (Name, "");
begin
if Param = "" then
return Util.Beans.Objects.Null_Object;
else
return Util.Beans.Objects.To_Object (Param);
end if;
end;
end Get_Value;
-- ------------------------------
-- Return the Param_Bean instance.
-- ------------------------------
function Instance return Util.Beans.Objects.Object is
begin
return Util.Beans.Objects.To_Object (Bean'Access, Util.Beans.Objects.STATIC);
end Instance;
end ASF.Beans.Globals;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.