Datasets:
NLTuan
/
starcoderdata

Dataset card Data Studio Files
xet
 Community
1
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
libpal/intel_64bit_systemv_nasm/vmwrite_checked.asm
mars-research/pal
26
84063
bits 64 default rel section .text global pal_execute_vmwrite_checked pal_execute_vmwrite_checked : vmwrite rdi, rsi jbe pal_execute_vmwrite_checked_failure mov rax, 0x1 ret pal_execute_vmwrite_checked_failure : mov rax, 0x0 ret
oeis/153/A153796.asm
neoneye/loda-programs
11
172676
<filename>oeis/153/A153796.asm<gh_stars>10-100 ; A153796: 6 times octagonal numbers: a(n) = 6*n*(3*n-2). ; 0,6,48,126,240,390,576,798,1056,1350,1680,2046,2448,2886,3360,3870,4416,4998,5616,6270,6960,7686,8448,9246,10080,10950,11856,12798,13776,14790,15840,16926,18048,19206,20400,21630,22896,24198,25536,26910,28320,29766,31248,32766,34320,35910,37536,39198,40896,42630,44400,46206,48048,49926,51840,53790,55776,57798,59856,61950,64080,66246,68448,70686,72960,75270,77616,79998,82416,84870,87360,89886,92448,95046,97680,100350,103056,105798,108576,111390,114240,117126,120048,123006,126000,129030,132096 mov $1,$0 mul $1,18 sub $1,12 mul $0,$1
audio/music/sandgemtown.asm
AtmaBuster/pokeplat-gen2-old
2
3186
Music_SandgemTown: channel_count 4 channel 1, Music_SandgemTown_Ch1 channel 2, Music_SandgemTown_Ch2 channel 3, Music_SandgemTown_Ch3 channel 4, Music_SandgemTown_Ch4 Music_SandgemTown_Ch1: volume 10, 10 duty_cycle 2 note_type 12, 10, 6 tempo 82 ;Bar 1 octave 3 volume_envelope 12, 2 note A_, 4 volume_envelope 8, 2 note A_, 4 volume_envelope 12, 2 note F_, 4 volume_envelope 8, 2 note F_, 4 ;Bar 2 volume_envelope 12, 2 note G_, 4 volume_envelope 8, 2 note G_, 4 volume_envelope 12, 2 note F_, 4 volume_envelope 8, 2 note F_, 4 ;Bar 3 volume_envelope 12, 2 note E_, 4 volume_envelope 8, 2 note E_, 4 volume_envelope 12, 2 note C_, 4 volume_envelope 8, 2 note C_, 4 ;Bar 4 volume_envelope 12, 2 note C#, 4 volume_envelope 8, 2 note C#, 4 volume_envelope 12, 2 note D#, 4 volume_envelope 8, 2 note D#, 4 ;Bar 5 .loop octave 3 volume_envelope 15, 1 note B_, 4 volume_envelope 8, 1 note B_, 4 note B_, 4 volume_envelope 15, 1 note G#, 4 ;Bar 6 volume_envelope 8, 1 note G#, 4 note G#, 4 note G#, 4 note G#, 4 ;Bar 7 volume_envelope 15, 1 note G#, 4 volume_envelope 8, 1 note G#, 4 note G#, 4 volume_envelope 15, 1 note G#, 4 ;Bar 8 volume_envelope 8, 1 note G#, 4 volume_envelope 15, 1 note E_, 4 note E_, 4 note G#, 4 ;Bar 9 note A_, 4 volume_envelope 8, 1 note A_, 4 note A_, 4 volume_envelope 15, 1 note F#, 4 ;Bar 10 volume_envelope 8, 1 note F#, 4 note F#, 4 note F#, 4 note F#, 4 ;Bar 11 volume_envelope 12, 4 octave 4 note G#, 4 note F#, 4 note F_, 2 note F#, 2 note C#, 2 octave 3 note A_, 10 ;Bar 12 note A_, 8 ;Bar 13 octave 4 volume_envelope 15, 1 note C#, 4 volume_envelope 8, 1 note C#, 4 note C#, 4 note C#, 4 ;Bar 14 octave 3 volume_envelope 15, 1 note B_, 4 volume_envelope 8, 1 note B_, 4 note B_, 4 note B_, 4 ;Bar 15 volume_envelope 15, 1 note A_, 4 volume_envelope 8, 1 note A_, 4 note A_, 4 note A_, 4 ;Bar 16 volume_envelope 15, 1 note G#, 4 volume_envelope 8, 1 note G#, 4 note G#, 4 note G#, 4 ;Bar 17 volume_envelope 11, 5 note E_, 12 note D_, 12 ;Bar 18 octave 2 note A_, 8 ;Bar 19 note B_, 12 octave 3 note D_, 8 ;Bar 20 octave 2 note B_, 4 octave 3 note G#, 4 note B_, 4 ;Bar 21 volume_envelope 15, 1 note B_, 4 volume_envelope 8, 1 note B_, 4 note B_, 4 volume_envelope 15, 1 note G#, 4 ;Bar 22 volume_envelope 8, 1 note G#, 4 note G#, 4 note G#, 4 note G#, 4 ;Bar 23 volume_envelope 15, 1 note G#, 4 volume_envelope 8, 1 note G#, 4 note G#, 4 volume_envelope 15, 1 note G#, 4 ;Bar 24 volume_envelope 8, 1 note G#, 4 volume_envelope 15, 1 note E_, 4 note E_, 4 note G#, 4 ;Bar 25 note A_, 4 volume_envelope 8, 1 note A_, 4 note A_, 4 volume_envelope 15, 1 note F#, 4 ;Bar 26 volume_envelope 8, 1 note F#, 4 note F#, 4 note F#, 4 note F#, 4 ;Bar 27 volume_envelope 12, 4 octave 4 note G#, 4 note F#, 4 note F_, 2 note F#, 2 note C#, 2 octave 3 note A_, 10 ;Bar 28 note A_, 8 ;Bar 29 octave 4 volume_envelope 15, 1 note C#, 4 volume_envelope 8, 1 note C#, 4 note C#, 4 note C#, 4 ;Bar 30 octave 3 volume_envelope 15, 1 note B_, 4 volume_envelope 8, 1 note B_, 4 note B_, 4 note B_, 4 ;Bar 31 volume_envelope 15, 1 note A_, 4 volume_envelope 8, 1 note A_, 4 note A_, 4 note A_, 4 ;Bar 32 volume_envelope 15, 1 note G#, 4 volume_envelope 8, 1 note G#, 4 note G#, 4 note G#, 4 ;Bar 33 volume_envelope 11, 5 note E_, 12 note D_, 12 ;Bar 34 octave 2 note A_, 8 ;Bar 35 note B_, 12 octave 3 note D_, 8 ;Bar 36 octave 2 note B_, 4 octave 3 note G#, 4 note B_, 4 ;Bar 37 volume_envelope 12, 2 note A_, 4 volume_envelope 10, 2 note A_, 4 volume_envelope 12, 2 note E_, 4 volume_envelope 10, 2 note E_, 4 ;Bar 38 volume_envelope 12, 2 note C_, 4 volume_envelope 10, 2 note C_, 4 octave 4 volume_envelope 12, 2 note C_, 4 volume_envelope 10, 2 note C_, 4 ;Bar 39 octave 3 volume_envelope 12, 2 note B_, 4 volume_envelope 10, 2 note B_, 4 volume_envelope 12, 2 note G#, 4 volume_envelope 10, 2 note G#, 4 ;Bar 40 volume_envelope 12, 2 note D_, 4 volume_envelope 10, 2 note D_, 4 volume_envelope 12, 2 note G#, 4 volume_envelope 10, 2 note G#, 4 ;Bar 41 volume_envelope 12, 2 note E_, 4 volume_envelope 10, 2 note E_, 4 volume_envelope 12, 2 note C#, 4 volume_envelope 10, 2 note C#, 4 ;Bar 42 octave 2 volume_envelope 12, 2 note B_, 4 volume_envelope 10, 2 note B_, 4 octave 4 volume_envelope 12, 2 note D#, 4 volume_envelope 10, 2 note D#, 4 ;Bar 43 octave 3 volume_envelope 12, 2 note B_, 4 volume_envelope 10, 2 note B_, 4 volume_envelope 12, 2 note D#, 4 volume_envelope 10, 2 note D#, 4 ;Bar 44 volume_envelope 12, 2 note B_, 4 volume_envelope 10, 2 note B_, 4 volume_envelope 12, 2 note D_, 4 volume_envelope 10, 2 note D_, 4 ;Bar 45 volume_envelope 12, 2 note A_, 4 volume_envelope 10, 2 note A_, 4 volume_envelope 12, 2 note E_, 4 volume_envelope 10, 2 note E_, 4 ;Bar 46 volume_envelope 12, 2 note C_, 4 volume_envelope 10, 2 note C_, 4 octave 4 volume_envelope 12, 2 note C_, 4 volume_envelope 10, 2 note C_, 4 ;Bar 47 octave 3 volume_envelope 12, 2 note B_, 4 volume_envelope 10, 2 note B_, 4 octave 4 volume_envelope 12, 2 note D_, 4 volume_envelope 10, 2 note D_, 4 ;Bar 48 volume_envelope 12, 2 note C#, 4 volume_envelope 10, 2 note C#, 4 octave 3 volume_envelope 12, 2 note G#, 4 volume_envelope 10, 2 note G#, 4 ;Bar 49 volume_envelope 12, 2 note A_, 4 volume_envelope 10, 2 note A_, 4 volume_envelope 12, 2 note G#, 4 volume_envelope 10, 2 note G#, 4 ;Bar 50 volume_envelope 12, 2 note E_, 4 volume_envelope 10, 2 note E_, 4 volume_envelope 12, 2 note F#, 4 volume_envelope 10, 2 note F#, 4 ;Bar 51 volume_envelope 12, 2 note E_, 4 volume_envelope 10, 2 note E_, 4 volume_envelope 12, 2 note C_, 4 volume_envelope 10, 2 note C_, 4 ;Bar 52 octave 2 volume_envelope 12, 5 note B_, 16 sound_loop 0, .loop Music_SandgemTown_Ch2: volume 7, 7 duty_cycle 2 note_type 12, 10, 7 ;Bar 1 octave 4 volume_envelope 12, 2 note E_, 4 volume_envelope 8, 2 note E_, 4 volume_envelope 12, 2 note C_, 4 volume_envelope 8, 2 note C_, 4 ;Bar 2 volume_envelope 12, 2 note D_, 4 volume_envelope 8, 2 note D_, 4 volume_envelope 12, 2 note C_, 4 volume_envelope 8, 2 note C_, 4 ;Bar 3 octave 3 volume_envelope 12, 2 note B_, 4 volume_envelope 8, 2 note B_, 4 volume_envelope 12, 2 note G_, 4 volume_envelope 8, 2 note G_, 4 ;Bar 4 volume_envelope 12, 2 note A_, 4 volume_envelope 8, 2 note A_, 4 volume_envelope 12, 2 note B_, 4 volume_envelope 8, 2 note B_, 4 ;Bar 5 .loop volume_envelope 13, 5 octave 4 note F_, 1 note F#, 11 note E_, 4 ;Bar 6 note E_, 16 ;Bar 7 note D#, 4 note D#, 8 note E_, 8 ;Bar 8 note C#, 4 note D#, 4 note E_, 4 ;Bar 9 note G#, 12 note A_, 4 ;Bar 10 note C#, 16 ;Bar 11 volume_envelope 12, 4 note B_, 4 note A_, 4 note G#, 2 note A_, 2 note F#, 2 note C#, 10 ;Bar 12 note C#, 8 ;Bar 13 volume_envelope 13, 5 note G_, 1 note G#, 11 note F#, 2 rest 2 ;Bar 14 note F#, 12 note E_, 2 rest 1 note D#, 1 ;Bar 15 note E_, 12 note F#, 2 note E_, 2 ;Bar 16 note D#, 2 rest 2 note C#, 2 rest 2 octave 3 note B_, 2 octave 4 note C#, 6 ;Bar 17 volume_envelope 12, 6 octave 1 note D_, 12 note D_, 8 ;Bar 18 - OCTAVE ERROR START HERE octave 2 note D_, 4 octave 1 note D_, 8 ;Bar 19 octave 1 note B_, 8 octave 1 note B_, 4 note D_, 8 ;Bar 20 octave 2 note D_, 4 octave 1 note D#, 4 octave 2 note D#, 4 ;Bar 21 - OCTAVE ERROR END HERE octave 4 volume_envelope 13, 5 note F_, 1 note F#, 11 note G#, 4 ;Bar 22 note E_, 2 note D#, 2 note E_, 12 ;Bar 23 note D#, 4 note D#, 8 note E_, 8 ;Bar 24 note C#, 4 note D#, 4 note E_, 4 ;Bar 25 note G#, 12 note A_, 4 ;Bar 26 note C#, 16 ;Bar 27 volume_envelope 12, 4 note B_, 4 note A_, 4 note G#, 2 note A_, 2 note F#, 2 note C#, 10 ;Bar 28 note C#, 8 ;Bar 29 volume_envelope 13, 5 note G_, 1 note G#, 11 note B_, 2 rest 2 ;Bar 30 note F#, 12 note E_, 2 rest 1 note D#, 1 ;Bar 31 note E_, 12 note F#, 2 note E_, 2 ;Bar 32 note D#, 2 rest 2 note C#, 2 rest 2 octave 3 note B_, 2 octave 4 note C#, 6 ;Bar 33 volume_envelope 12, 6 octave 1 note D_, 12 note D_, 8 ;Bar 34 octave 2 note D_, 4 octave 1 note D_, 8 ;Bar 35 octave 1 note B_, 8 octave 1 note B_, 4 note D_, 8 ;Bar 36 octave 2 note D_, 4 octave 1 note D#, 4 octave 4 note B_, 2 octave 5 note C_, 2 ;Bar 37 volume_envelope 13, 5 note C#, 6 octave 4 note A_, 2 rest 4 note E_, 16 ;Bar 38 octave 5 note C#, 2 note D#, 2 ;Bar 39 octave 4 note B_, 10 note D#, 2 rest 2 note E_, 2 ;Bar 40 note B_, 12 note A_, 2 note G#, 2 ;Bar 41 note A_, 6 note E_, 2 rest 4 note C#, 4 ;Bar 42 note D#, 6 octave 3 note B_, 2 rest 4 octave 5 note C#, 2 note D#, 2 ;Bar 43 octave 4 note B_, 10 note D#, 2 rest 2 note E_, 2 ;Bar 44 note B_, 12 note A_, 2 note B_, 2 ;Bar 45 octave 5 note C#, 6 octave 4 note A_, 2 rest 2 note E_, 2 octave 5 note E_, 7 ;Bar 46 note F_, 1 note F#, 4 note D#, 4 note C#, 4 ;Bar 47 octave 4 note B_, 6 note G#, 2 rest 4 octave 5 note D_, 4 ;Bar 48 note C#, 8 rest 4 octave 4 note A_, 2 note G#, 2 ;Bar 49 note A_, 6 note E_, 6 note C#, 4 ;Bar 50 octave 3 note B_, 6 octave 4 note F#, 6 note D#, 4 ;Bar 51 volume_envelope 12, 0 note E_, 8 ;Bar 52 volume_envelope 12, 6 note E_, 16 octave 3 note B_, 8 sound_loop 0, .loop Music_SandgemTown_Ch3: note_type 12, 1, 5 ;Bar 1 octave 3 note C_, 8 octave 2 note A_, 8 ;Bar 2 octave 3 note C_, 6 note F_, 6 note D_, 4 ;Bar 3 note C_, 4 octave 2 note C_, 4 octave 3 note C_, 2 note D_, 2 note C_, 4 ;Bar 4 octave 2 note B_, 4 octave 1 note B_, 4 note B_, 4 octave 2 note D#, 4 ;Bar 5 .loop octave 2 note E_, 4 octave 3 note E_, 4 rest 4 octave 2 note E_, 2 note E_, 2 ;Bar 6 note E_, 2 rest 2 note E_, 2 rest 2 octave 3 note E_, 4 octave 2 note B_, 4 ;Bar 7 note E_, 4 octave 3 note E_, 4 rest 4 octave 2 note E_, 2 note E_, 2 ;Bar 8 note E_, 2 rest 2 note E_, 2 rest 2 octave 3 note E_, 4 octave 2 note B_, 4 ;Bar 9 note F#, 4 octave 3 note F#, 4 rest 4 octave 2 note F#, 2 note F#, 2 ;Bar 10 note F#, 2 rest 2 note F#, 2 rest 2 octave 3 note F#, 4 note C#, 4 ;Bar 11 octave 2 note F#, 4 octave 3 note F#, 4 rest 4 octave 2 note F#, 2 note F#, 2 ;Bar 12 note F#, 2 rest 2 note F#, 4 note G#, 4 note A_, 4 ;Bar 13 note B_, 4 octave 3 note B_, 4 rest 4 octave 2 note B_, 2 note B_, 2 ;Bar 14 note B_, 2 rest 2 note B_, 2 rest 2 octave 3 note B_, 4 note F#, 4 ;Bar 15 octave 2 note B_, 4 octave 3 note B_, 4 rest 4 octave 2 note B_, 2 note B_, 2 ;Bar 16 note B_, 2 rest 2 note B_, 2 rest 2 octave 3 note B_, 4 note F#, 4 ;Bar 17 note_type 12, 1, 4 vibrato 12, 2, 3 octave 4 note B_, 12 octave 5 note D_, 8 ;Bar 18 note C_, 4 octave 4 note B_, 4 note A_, 4 ;Bar 19 note G_, 4 note F#, 4 note E_, 4 note F#, 8 ;Bar 20 note A_, 4 rest 8 ;Bar 21 note_type 12, 1, 5 vibrato 0, 0, 0 octave 2 note E_, 4 octave 3 note E_, 4 rest 4 octave 2 note E_, 2 note E_, 2 ;Bar 22 note E_, 2 rest 2 note E_, 2 rest 2 octave 3 note E_, 4 octave 2 note B_, 4 ;Bar 23 note E_, 4 octave 3 note E_, 4 rest 4 octave 2 note E_, 2 note E_, 2 ;Bar 24 note E_, 2 rest 2 note E_, 2 rest 2 octave 3 note E_, 4 octave 2 note B_, 4 ;Bar 25 note F#, 4 octave 3 note F#, 4 rest 4 octave 2 note F#, 2 note F#, 2 ;Bar 26 note F#, 2 rest 2 note F#, 2 rest 2 octave 3 note F#, 4 note C#, 4 ;Bar 27 octave 2 note F#, 4 octave 3 note F#, 4 rest 4 octave 2 note F#, 2 note F#, 2 ;Bar 28 note F#, 2 rest 2 note F#, 4 note G#, 4 note A_, 4 ;Bar 29 note B_, 4 octave 3 note B_, 4 rest 4 octave 2 note B_, 2 note B_, 2 ;Bar 30 note B_, 2 rest 2 note B_, 2 rest 2 octave 3 note B_, 4 note F#, 4 ;Bar 31 octave 2 note B_, 4 octave 3 note B_, 4 rest 4 octave 2 note B_, 2 note B_, 2 ;Bar 32 note B_, 2 rest 2 note B_, 2 rest 2 octave 3 note B_, 4 note F#, 4 ;Bar 33 note_type 12, 1, 4 vibrato 12, 2, 3 octave 4 note B_, 12 octave 5 note D_, 8 ;Bar 34 note C_, 4 octave 4 note B_, 4 note A_, 4 ;Bar 35 note G_, 4 note F#, 4 note E_, 4 note F#, 8 ;Bar 36 note A_, 4 rest 4 note_type 12, 1, 5 vibrato 0, 0, 0 octave 2 note D#, 4 ;Bar 37 note A_, 5 rest 1 note A_, 2 rest 4 note E_, 2 rest 2 ;Bar 38 note A_, 4 rest 2 note A_, 2 rest 4 note B_, 2 octave 3 note C#, 2 ;Bar 39 octave 2 note G#, 5 rest 1 note G#, 2 rest 2 note D#, 4 rest 2 ;Bar 40 note B_, 2 note G#, 2 rest 2 octave 3 note D_, 2 rest 2 octave 2 note B_, 2 note G#, 2 note E_, 2 ;Bar 41 note F#, 4 rest 2 note F#, 2 rest 4 note C#, 4 ;Bar 42 note F#, 4 rest 4 note D#, 2 note F#, 2 note B_, 4 ;Bar 43 note E_, 4 rest 2 note E_, 2 rest 2 octave 3 note E_, 2 rest 4 ;Bar 44 octave 2 note G#, 2 note B_, 2 rest 2 octave 3 note D_, 4 rest 2 note C#, 2 octave 2 note G#, 2 ;Bar 45 note A_, 5 rest 1 note A_, 2 rest 4 note E_, 2 rest 2 ;Bar 46 note A_, 4 rest 2 note A_, 2 rest 4 note B_, 2 octave 3 note C#, 2 ;Bar 47 octave 2 note G#, 4 rest 2 note G#, 2 rest 2 note D#, 4 rest 2 ;Bar 48 note B_, 2 note G#, 2 rest 2 octave 3 note D_, 2 rest 2 octave 2 note B_, 2 note G#, 2 note E_, 2 ;Bar 49 note F#, 4 rest 2 note F#, 2 rest 4 note C#, 4 ;Bar 50 note F#, 4 rest 2 note F#, 2 note A_, 4 note B_, 4 ;Bar 51 note E_, 8 octave 1 note B_, 8 note E_, 8 rest 8 sound_loop 0, .loop Music_SandgemTown_Ch4: toggle_noise 3 drum_speed 12 drum_note x, x rest 16 rest 16 drum_note 5, 8 ; Triangle 2/8/9 are hat - 5 is a triangle - 11 kick2 - 12 open hat drum_note 5, 8 ; Triangle drum_note 5, 8 ; Triangle drum_note 4, 2 ; Kick drum_note 4, 2 ; Kick drum_note 3, 4 ; Snare .loop sound_call .sub1 sound_call .sub1 sound_call .sub1 sound_call .sub2 sound_call .sub1 sound_call .sub1 sound_call .sub1 sound_call .sub2 sound_call .sub1 sound_call .sub1 sound_call .sub1 drum_note 4, 4 ; Kick drum_note 9, 4 ; Hat drum_note 3, 4 ; Snare drum_note 9, 2 ; Hat drum_note 4, 2 ; Kick drum_note 4, 4 ; Kick drum_note 9, 4 ; Hat drum_note 3, 4 ; Snare drum_note 9, 4 ; Hat drum_note 4, 4 ; Kick drum_note 3, 4 ; Snare drum_note 4, 2 ; Kick drum_note 4, 2 ; Kick drum_note 3, 4 ; Snare drum_note 3, 8 ; Snare drum_note 7, 8 ; Open Hat sound_loop 0, .loop .sub1 drum_note 4, 4 ; Kick drum_note 9, 4 ; Hat drum_note 3, 4 ; Snare drum_note 9, 2 ; Hat drum_note 4, 2 ; Kick drum_note 4, 4 ; Kick drum_note 9, 4 ; Hat drum_note 3, 4 ; Snare drum_note 9, 4 ; Hat drum_note 4, 4 ; Kick drum_note 9, 4 ; Hat drum_note 3, 4 ; Snare drum_note 9, 2 ; Hat drum_note 4, 2 ; Kick drum_note 4, 4 ; Kick drum_note 9, 4 ; Hat drum_note 3, 4 ; Snare drum_note 7, 4 ; Open Hat sound_ret .sub2 drum_note 7, 12 ; Open Hat drum_note 7, 8 ; Open Hat drum_note 9, 4 ; Hat drum_note 9, 4 ; Hat drum_note 9, 4 ; Hat drum_note 7, 12 ; Open Hat drum_note 7, 4 ; Open Hat drum_note 3, 2 ; Snare drum_note 3, 2 ; Snare drum_note 4, 4 ; Kick drum_note 3, 4 ; Snare drum_note 4, 4 ; Kick sound_ret
programs/oeis/042/A042965.asm
neoneye/loda
22
242444
; A042965: Nonnegative integers not congruent to 2 mod 4. ; 0,1,3,4,5,7,8,9,11,12,13,15,16,17,19,20,21,23,24,25,27,28,29,31,32,33,35,36,37,39,40,41,43,44,45,47,48,49,51,52,53,55,56,57,59,60,61,63,64,65,67,68,69,71,72,73,75,76,77,79,80,81,83,84,85,87,88,89,91,92,93,95,96,97,99,100,101,103,104,105,107,108,109,111,112,113,115,116,117,119,120,121,123,124,125,127,128,129,131,132 mul $0,4 add $0,1 div $0,3
array/ModifyArray.asm
gmarciani/assimply
1
247698
<filename>array/ModifyArray.asm # @Name: ModifyArray # @Description: The program allocates three arrays A[],B[] and C[]. # It modifies C[], as stated by the following function: # C[i]=A[i]+max(C[i]-B[i],0) # # @Author: <NAME> <<EMAIL>> .data msg_welcome: .asciiz "Il programma alloca in memoria tre array 10-dimensionali A[],B[],C[]. Modifica gli elementi dell'array C, secondo la seguente funzione: C[i]=A[i]+max(C[i]-B[i],0).\n\n" A: .word 1,2,3,4,5,6,7,8,9,10 B: .word 2,4,6,8,10,12,14,16,18,20 C: .word 3,6,9,12,15,18,21,24,27,30 dimensione_array: .word 10 .text .globl main ### MAIN ### main: la $a0,msg_welcome #carica l'indirizzo di msg_welcome. addi $v0,$zero,4 #codice servizio print string. syscall la $a0,dimensione_array #carica l'indirizzo di dimensione_array. lw $s0,0($a0) #$s0=n=10. la $s1,A #$s1=indirizzo di base di A[]. la $s2,B #$s2=indirizzo di base di B[]. la $s3,C #$s3=indirizzo di base di C[]. jal modifica nop exit_program: addi $v0,$zero,10 #codice servizio exit. syscall ### FINE MAIN ### ### FUNZIONE void modifica(int A[], int B[], int C[]): $s1=(A+0), $s2=(B+0), $s3=(C+0). ### modifica: subu $sp,$sp,20 #alloca lo stack frame da 20 byte per modifica((A+0),(B+0),(C+0)): 1 locazione per $ra, 1 locazione per $s1=(A+0), 1 locazione per $s2=(B+0), 1 locazione per $s3=(C+0), 1 locazione per $s0=n. sw $ra,0($sp) #carica l'indirizzo di ritorno nello stack frame. sw $s1,4($sp) #carica $s1=(A+0) nello stack frame. sw $s2,8($sp) #carica $s2=(B+0) nello stack frame. sw $s3,12($sp) #carica $s3=(C+0) nello stack frame. sw $s0,16($sp) #carica $s0=dimensione_array=n nello stack frame. addi $t1,$zero,0 #$t1=i=0. ciclo_for_modifica: slt $t3,$t1,$s0 #$t3=1 iff i<n. beq $t3,$zero,exit_ciclo_for_modifica #salta alla fine del ciclo sse i=>n. sll $t4,$t1,2 #$t4=4*i, cioè $t4=indice scorrimento array. add $t5,$s1,$t4 #$t5=indirizzo A[i]. add $t6,$s2,$t4 #$t6=indirizzo B[i]. add $t7,$s3,$t4 #$t7=indirizzo C[i]. lw $s5,0($t5) #$s5=elemento A[i]. lw $s6,0($t6) #$s6=elemento B[i]. lw $s7,0($t7) #$s7=elemento C[i]. sub $a0,$s7,$s6 #$a0=(C[i]-B[i]), argomento per max((C[i]-B[i]),0). addi $a1,$zero,0 #$a1=0, argomento per max((C[i]-B[i]),0). jal max #chiama max((C[i]-B[i]),0). nop add $t2,$s5,$v0 #$t2=A[i]+funzione_max((C[i]-B[i]),0). sw $t2,0($t7) #C[i]=A[i]+funzione_max((C[i]-B[i]),0). addi $t1,$t1,1 #$t1=$t1+1, cioè i++. j ciclo_for_modifica exit_ciclo_for_modifica: lw $ra,0($sp) #carica l'indirizzo di ritorno. addi $sp,$sp,20 #dealloca lo stack frame per modifica((A+0),(B+0),(C+0)). jr $ra ### FINE FUNZIONE void modifica(int A[], int B[], int C[]) ### ### FUNZIONE int max(int x, int y): $a0=x, $a1=y, $v0=max(x,y). ### max: subu $sp,$sp,4 #alloca uno stack frame da 4 byte. 1 locazione per $ra. sw $ra,0($sp) #carica nello stack frame l'indirizzo di ritorno. slt $t0,$a0,$a1 #$t0=1 iff $a0<$a1, cioè $t0=1 sse x<y. bne $t0,$zero,max_y #salta a max_y sse $t0!=0, cioè sse y>x. max_x: addi $v0,$a0,0 #$v0=max(x,y)=$a0=x, cioè return x. lw $ra,0($sp) #carica l'indirizzo di ritorno alla funzione modifica(A[],B[],C[]). addi $sp,$sp,4 #dealloca lo stack frame di max(x,y). jr $ra max_y: addi $v0,$a1,0 #$v0=max(x,y)=$a1=y, cioè return y. lw $ra,0($sp) #carica l'indirizzo di ritorno alla funzione modifica(A[],B[],C[]). addi $sp,$sp,4 #dealloca lo stack frame di max(x,y). jr $ra ### FINE FUNZIONE int max(int x, int y) ###
alloy4fun_models/trashltl/models/7/ajEi3RXqyWsqkPgv2.als
Kaixi26/org.alloytools.alloy
0
3144
open main pred idajEi3RXqyWsqkPgv2_prop8 { always (all f:File.^link| some f implies eventually f in Trash) } pred __repair { idajEi3RXqyWsqkPgv2_prop8 } check __repair { idajEi3RXqyWsqkPgv2_prop8 <=> prop8o }
simd/i386/jquant-3dn.asm
1camper/libjpeg-turbo
522
179457
; ; jquant.asm - sample data conversion and quantization (3DNow! & MMX) ; ; Copyright 2009 <NAME> <<EMAIL>> for Cendio AB ; Copyright (C) 2016, <NAME>. ; ; Based on the x86 SIMD extension for IJG JPEG library ; Copyright (C) 1999-2006, MIYASAKA Masaru. ; For conditions of distribution and use, see copyright notice in jsimdext.inc ; ; This file should be assembled with NASM (Netwide Assembler), ; can *not* be assembled with Microsoft's MASM or any compatible ; assembler (including Borland's Turbo Assembler). ; NASM is available from http://nasm.sourceforge.net/ or ; http://sourceforge.net/project/showfiles.php?group_id=6208 ; ; [TAB8] %include "jsimdext.inc" %include "jdct.inc" ; -------------------------------------------------------------------------- SECTION SEG_TEXT BITS 32 ; ; Load data into workspace, applying unsigned->signed conversion ; ; GLOBAL(void) ; jsimd_convsamp_float_3dnow(JSAMPARRAY sample_data, JDIMENSION start_col, ; FAST_FLOAT *workspace); ; %define sample_data ebp + 8 ; JSAMPARRAY sample_data %define start_col ebp + 12 ; JDIMENSION start_col %define workspace ebp + 16 ; FAST_FLOAT *workspace align 32 GLOBAL_FUNCTION(jsimd_convsamp_float_3dnow) EXTN(jsimd_convsamp_float_3dnow): push ebp mov ebp, esp push ebx ; push ecx ; need not be preserved ; push edx ; need not be preserved push esi push edi pcmpeqw mm7, mm7 psllw mm7, 7 packsswb mm7, mm7 ; mm7 = PB_CENTERJSAMPLE (0x808080..) mov esi, JSAMPARRAY [sample_data] ; (JSAMPROW *) mov eax, JDIMENSION [start_col] mov edi, POINTER [workspace] ; (DCTELEM *) mov ecx, DCTSIZE/2 alignx 16, 7 .convloop: mov ebx, JSAMPROW [esi+0*SIZEOF_JSAMPROW] ; (JSAMPLE *) mov edx, JSAMPROW [esi+1*SIZEOF_JSAMPROW] ; (JSAMPLE *) movq mm0, MMWORD [ebx+eax*SIZEOF_JSAMPLE] movq mm1, MMWORD [edx+eax*SIZEOF_JSAMPLE] psubb mm0, mm7 ; mm0=(01234567) psubb mm1, mm7 ; mm1=(89ABCDEF) punpcklbw mm2, mm0 ; mm2=(*0*1*2*3) punpckhbw mm0, mm0 ; mm0=(*4*5*6*7) punpcklbw mm3, mm1 ; mm3=(*8*9*A*B) punpckhbw mm1, mm1 ; mm1=(*C*D*E*F) punpcklwd mm4, mm2 ; mm4=(***0***1) punpckhwd mm2, mm2 ; mm2=(***2***3) punpcklwd mm5, mm0 ; mm5=(***4***5) punpckhwd mm0, mm0 ; mm0=(***6***7) psrad mm4, (DWORD_BIT-BYTE_BIT) ; mm4=(01) psrad mm2, (DWORD_BIT-BYTE_BIT) ; mm2=(23) pi2fd mm4, mm4 pi2fd mm2, mm2 psrad mm5, (DWORD_BIT-BYTE_BIT) ; mm5=(45) psrad mm0, (DWORD_BIT-BYTE_BIT) ; mm0=(67) pi2fd mm5, mm5 pi2fd mm0, mm0 movq MMWORD [MMBLOCK(0,0,edi,SIZEOF_FAST_FLOAT)], mm4 movq MMWORD [MMBLOCK(0,1,edi,SIZEOF_FAST_FLOAT)], mm2 movq MMWORD [MMBLOCK(0,2,edi,SIZEOF_FAST_FLOAT)], mm5 movq MMWORD [MMBLOCK(0,3,edi,SIZEOF_FAST_FLOAT)], mm0 punpcklwd mm6, mm3 ; mm6=(***8***9) punpckhwd mm3, mm3 ; mm3=(***A***B) punpcklwd mm4, mm1 ; mm4=(***C***D) punpckhwd mm1, mm1 ; mm1=(***E***F) psrad mm6, (DWORD_BIT-BYTE_BIT) ; mm6=(89) psrad mm3, (DWORD_BIT-BYTE_BIT) ; mm3=(AB) pi2fd mm6, mm6 pi2fd mm3, mm3 psrad mm4, (DWORD_BIT-BYTE_BIT) ; mm4=(CD) psrad mm1, (DWORD_BIT-BYTE_BIT) ; mm1=(EF) pi2fd mm4, mm4 pi2fd mm1, mm1 movq MMWORD [MMBLOCK(1,0,edi,SIZEOF_FAST_FLOAT)], mm6 movq MMWORD [MMBLOCK(1,1,edi,SIZEOF_FAST_FLOAT)], mm3 movq MMWORD [MMBLOCK(1,2,edi,SIZEOF_FAST_FLOAT)], mm4 movq MMWORD [MMBLOCK(1,3,edi,SIZEOF_FAST_FLOAT)], mm1 add esi, byte 2*SIZEOF_JSAMPROW add edi, byte 2*DCTSIZE*SIZEOF_FAST_FLOAT dec ecx jnz near .convloop femms ; empty MMX/3DNow! state pop edi pop esi ; pop edx ; need not be preserved ; pop ecx ; need not be preserved pop ebx pop ebp ret ; -------------------------------------------------------------------------- ; ; Quantize/descale the coefficients, and store into coef_block ; ; GLOBAL(void) ; jsimd_quantize_float_3dnow(JCOEFPTR coef_block, FAST_FLOAT *divisors, ; FAST_FLOAT *workspace); ; %define coef_block ebp + 8 ; JCOEFPTR coef_block %define divisors ebp + 12 ; FAST_FLOAT *divisors %define workspace ebp + 16 ; FAST_FLOAT *workspace align 32 GLOBAL_FUNCTION(jsimd_quantize_float_3dnow) EXTN(jsimd_quantize_float_3dnow): push ebp mov ebp, esp ; push ebx ; unused ; push ecx ; unused ; push edx ; need not be preserved push esi push edi mov eax, 0x4B400000 ; (float)0x00C00000 (rndint_magic) movd mm7, eax punpckldq mm7, mm7 ; mm7={12582912.0F 12582912.0F} mov esi, POINTER [workspace] mov edx, POINTER [divisors] mov edi, JCOEFPTR [coef_block] mov eax, DCTSIZE2/16 alignx 16, 7 .quantloop: movq mm0, MMWORD [MMBLOCK(0,0,esi,SIZEOF_FAST_FLOAT)] movq mm1, MMWORD [MMBLOCK(0,1,esi,SIZEOF_FAST_FLOAT)] pfmul mm0, MMWORD [MMBLOCK(0,0,edx,SIZEOF_FAST_FLOAT)] pfmul mm1, MMWORD [MMBLOCK(0,1,edx,SIZEOF_FAST_FLOAT)] movq mm2, MMWORD [MMBLOCK(0,2,esi,SIZEOF_FAST_FLOAT)] movq mm3, MMWORD [MMBLOCK(0,3,esi,SIZEOF_FAST_FLOAT)] pfmul mm2, MMWORD [MMBLOCK(0,2,edx,SIZEOF_FAST_FLOAT)] pfmul mm3, MMWORD [MMBLOCK(0,3,edx,SIZEOF_FAST_FLOAT)] pfadd mm0, mm7 ; mm0=(00 ** 01 **) pfadd mm1, mm7 ; mm1=(02 ** 03 **) pfadd mm2, mm7 ; mm0=(04 ** 05 **) pfadd mm3, mm7 ; mm1=(06 ** 07 **) movq mm4, mm0 punpcklwd mm0, mm1 ; mm0=(00 02 ** **) punpckhwd mm4, mm1 ; mm4=(01 03 ** **) movq mm5, mm2 punpcklwd mm2, mm3 ; mm2=(04 06 ** **) punpckhwd mm5, mm3 ; mm5=(05 07 ** **) punpcklwd mm0, mm4 ; mm0=(00 01 02 03) punpcklwd mm2, mm5 ; mm2=(04 05 06 07) movq mm6, MMWORD [MMBLOCK(1,0,esi,SIZEOF_FAST_FLOAT)] movq mm1, MMWORD [MMBLOCK(1,1,esi,SIZEOF_FAST_FLOAT)] pfmul mm6, MMWORD [MMBLOCK(1,0,edx,SIZEOF_FAST_FLOAT)] pfmul mm1, MMWORD [MMBLOCK(1,1,edx,SIZEOF_FAST_FLOAT)] movq mm3, MMWORD [MMBLOCK(1,2,esi,SIZEOF_FAST_FLOAT)] movq mm4, MMWORD [MMBLOCK(1,3,esi,SIZEOF_FAST_FLOAT)] pfmul mm3, MMWORD [MMBLOCK(1,2,edx,SIZEOF_FAST_FLOAT)] pfmul mm4, MMWORD [MMBLOCK(1,3,edx,SIZEOF_FAST_FLOAT)] pfadd mm6, mm7 ; mm0=(10 ** 11 **) pfadd mm1, mm7 ; mm4=(12 ** 13 **) pfadd mm3, mm7 ; mm0=(14 ** 15 **) pfadd mm4, mm7 ; mm4=(16 ** 17 **) movq mm5, mm6 punpcklwd mm6, mm1 ; mm6=(10 12 ** **) punpckhwd mm5, mm1 ; mm5=(11 13 ** **) movq mm1, mm3 punpcklwd mm3, mm4 ; mm3=(14 16 ** **) punpckhwd mm1, mm4 ; mm1=(15 17 ** **) punpcklwd mm6, mm5 ; mm6=(10 11 12 13) punpcklwd mm3, mm1 ; mm3=(14 15 16 17) movq MMWORD [MMBLOCK(0,0,edi,SIZEOF_JCOEF)], mm0 movq MMWORD [MMBLOCK(0,1,edi,SIZEOF_JCOEF)], mm2 movq MMWORD [MMBLOCK(1,0,edi,SIZEOF_JCOEF)], mm6 movq MMWORD [MMBLOCK(1,1,edi,SIZEOF_JCOEF)], mm3 add esi, byte 16*SIZEOF_FAST_FLOAT add edx, byte 16*SIZEOF_FAST_FLOAT add edi, byte 16*SIZEOF_JCOEF dec eax jnz near .quantloop femms ; empty MMX/3DNow! state pop edi pop esi ; pop edx ; need not be preserved ; pop ecx ; unused ; pop ebx ; unused pop ebp ret ; For some reason, the OS X linker does not honor the request to align the ; segment unless we do this. align 32
Definition/Conversion/HelperDecidable.agda
CoqHott/logrel-mltt
2
1818
<reponame>CoqHott/logrel-mltt<filename>Definition/Conversion/HelperDecidable.agda {-# OPTIONS --safe #-} module Definition.Conversion.HelperDecidable where open import Definition.Untyped open import Definition.Untyped.Properties open import Definition.Typed open import Definition.Typed.Properties open import Definition.Conversion open import Definition.Conversion.Whnf open import Definition.Conversion.Soundness open import Definition.Conversion.Symmetry open import Definition.Conversion.Stability open import Definition.Conversion.Conversion open import Definition.Conversion.Lift open import Definition.Typed.Consequences.Syntactic open import Definition.Typed.Consequences.Substitution open import Definition.Typed.Consequences.Injectivity open import Definition.Typed.Consequences.Reduction open import Definition.Typed.Consequences.Equality open import Definition.Typed.Consequences.Inequality as IE open import Definition.Typed.Consequences.NeTypeEq open import Definition.Typed.Consequences.SucCong open import Tools.Nat open import Tools.Product open import Tools.Empty open import Tools.Nullary import Tools.PropositionalEquality as PE dec-relevance : ∀ (r r′ : Relevance) → Dec (r PE.≡ r′) dec-relevance ! ! = yes PE.refl dec-relevance ! % = no (λ ()) dec-relevance % ! = no (λ ()) dec-relevance % % = yes PE.refl dec-level : ∀ (l l′ : Level) → Dec (l PE.≡ l′) dec-level ⁰ ⁰ = yes PE.refl dec-level ⁰ ¹ = no (λ ()) dec-level ¹ ⁰ = no (λ ()) dec-level ¹ ¹ = yes PE.refl -- Algorithmic equality of variables infers propositional equality. strongVarEq : ∀ {m n A Γ l} → Γ ⊢ var n ~ var m ↑! A ^ l → n PE.≡ m strongVarEq (var-refl x x≡y) = x≡y -- Helper function for decidability of applications. dec~↑!-app : ∀ {k k₁ l l₁ F F₁ G G₁ rF B Γ Δ lF lG lΠ lK} → ⊢ Γ ≡ Δ → Γ ⊢ k ∷ Π F ^ rF ° lF ▹ G ° lG ° lΠ ^ [ ! , ι lΠ ] → Δ ⊢ k₁ ∷ Π F₁ ^ rF ° lF ▹ G₁ ° lG ° lΠ ^ [ ! , ι lΠ ] → Γ ⊢ k ~ k₁ ↓! B ^ lK → Dec (Γ ⊢ l [genconv↑] l₁ ∷ F ^ [ rF , ι lF ]) → Dec (∃ λ A → ∃ λ lA → Γ ⊢ k ∘ l ^ lΠ ~ k₁ ∘ l₁ ^ lΠ ↑! A ^ lA) dec~↑!-app Γ≡Δ k k₁ k~k₁ (yes p) = let whnfA , neK , neL = ne~↓! k~k₁ ⊢A , ⊢k , ⊢l = syntacticEqTerm (soundness~↓! k~k₁) l≡l , ΠFG₁≡A = neTypeEq neK k ⊢k H , E , A≡ΠHE = Π≡A ΠFG₁≡A whnfA F≡H , rF≡rH , lF≡lH , lG≡lE , G₁≡E = injectivity (PE.subst (λ x → _ ⊢ _ ≡ x ^ _) A≡ΠHE ΠFG₁≡A) in yes (E [ _ ] , _ , app-cong (PE.subst₂ (λ x y → _ ⊢ _ ~ _ ↓! x ^ y) A≡ΠHE (PE.sym l≡l) k~k₁) (convConvTerm%! p F≡H)) dec~↑!-app Γ≡Δ k k₁ k~k₁ (no ¬p) = no (λ { (_ , _ , app-cong k~k₁′ p) → let whnfA , neK , neL = ne~↓! k~k₁′ ⊢A , ⊢k , ⊢l = syntacticEqTerm (soundness~↓! k~k₁′) l≡l , Π≡Π = neTypeEq neK k ⊢k F≡F , rF≡rF , lF≡lF , lG≡lG , G≡G = injectivity Π≡Π in ¬p (convConvTerm%! (PE.subst₂ (λ x y → _ ⊢ _ [genconv↑] _ ∷ _ ^ [ x , ι y ]) (PE.sym rF≡rF) (PE.sym lF≡lF) p) (sym F≡F)) }) nonNeutralℕ : Neutral ℕ → ⊥ nonNeutralℕ () nonNeutralU : ∀ {r l} → Neutral (Univ r l) → ⊥ nonNeutralU () Idℕ-elim : ∀ {Γ l A B t u t' u'} → Neutral A → Γ ⊢ Id A t u ~ Id ℕ t' u' ↑! B ^ l → ⊥ Idℕ-elim neA (Id-cong x x₁ x₂) = let _ , _ , neℕ = ne~↓! x in ⊥-elim (nonNeutralℕ neℕ) Idℕ-elim neA (Id-ℕ x x₁) = ⊥-elim (nonNeutralℕ neA) Idℕ-elim neA (Id-ℕ0 x) = ⊥-elim (nonNeutralℕ neA) Idℕ-elim neA (Id-ℕS x x₁) = ⊥-elim (nonNeutralℕ neA) Idℕ-elim' : ∀ {Γ l A B t u t' u'} → Neutral A → Γ ⊢ Id ℕ t u ~ Id A t' u' ↑! B ^ l → ⊥ Idℕ-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in Idℕ-elim neA e' conv↑-inversion : ∀ {Γ l A t u} → Whnf A → Whnf t → Whnf u → Γ ⊢ t [conv↑] u ∷ A ^ l → Γ ⊢ t [conv↓] u ∷ A ^ l conv↑-inversion whnfA whnft whnfu ([↑]ₜ B t′ u′ D d d′ whnfB whnft′ whnfu′ t<>u) = let et = whnfRed*Term d whnft eu = whnfRed*Term d′ whnfu eA = whnfRed* D whnfA in PE.subst₃ (λ A X Y → _ ⊢ X [conv↓] Y ∷ A ^ _) (PE.sym eA) (PE.sym et) (PE.sym eu) t<>u Idℕ0-elim- : ∀ {Γ l t} → Neutral t → Γ ⊢ t [conv↓] zero ∷ ℕ ^ l → ⊥ Idℕ0-elim- net (ℕ-ins ()) Idℕ0-elim- net (ne-ins x x₁ x₂ ()) Idℕ0-elim- () (zero-refl x) Idℕ0-elim : ∀ {Γ l A t u u'} → Neutral t → Γ ⊢ Id ℕ t u ~ Id ℕ zero u' ↑! A ^ l → ⊥ Idℕ0-elim net (Id-cong x y x₂) = let e = conv↑-inversion ℕₙ (ne net) zeroₙ y in Idℕ0-elim- net e Idℕ0-elim net (Id-ℕ () x₁) Idℕ0-elim () (Id-ℕ0 x) Idℕ0-elim' : ∀ {Γ l A t u u'} → Neutral t → Γ ⊢ Id ℕ zero u ~ Id ℕ t u' ↑! A ^ l → ⊥ Idℕ0-elim' net e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in Idℕ0-elim net e' IdℕS-elim- : ∀ {Γ l t n} → Neutral t → Γ ⊢ t [conv↓] suc n ∷ ℕ ^ l → ⊥ IdℕS-elim- net (ℕ-ins ()) IdℕS-elim- net (ne-ins x x₁ x₂ ()) IdℕS-elim- () (suc-cong x) IdℕS-elim : ∀ {Γ l A t u n u'} → Neutral t → Γ ⊢ Id ℕ t u ~ Id ℕ (suc n) u' ↑! A ^ l → ⊥ IdℕS-elim net (Id-cong x y x₂) = let e = conv↑-inversion ℕₙ (ne net) sucₙ y in IdℕS-elim- net e IdℕS-elim net (Id-ℕ () x₁) IdℕS-elim () (Id-ℕS x _) IdℕS-elim' : ∀ {Γ l A t u n u'} → Neutral t → Γ ⊢ Id ℕ (suc n) u ~ Id ℕ t u' ↑! A ^ l → ⊥ IdℕS-elim' net e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in IdℕS-elim net e' Idℕ0S-elim- : ∀ {Γ l n} → Γ ⊢ zero [conv↓] suc n ∷ ℕ ^ l → ⊥ Idℕ0S-elim- (ℕ-ins ()) Idℕ0S-elim- (ne-ins x x₁ x₂ ()) Idℕ0S-elim : ∀ {Γ l A u u' n} → Γ ⊢ Id ℕ zero u ~ Id ℕ (suc n) u' ↑! A ^ l → ⊥ Idℕ0S-elim (Id-cong x y x₂) = let e = conv↑-inversion ℕₙ zeroₙ sucₙ y in Idℕ0S-elim- e Idℕ0S-elim (Id-ℕ () _) Idℕ0S-elim' : ∀ {Γ l A u u' n} → Γ ⊢ Id ℕ (suc n) u ~ Id ℕ zero u' ↑! A ^ l → ⊥ Idℕ0S-elim' e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in Idℕ0S-elim e' IdU-elim : ∀ {Γ l A B t u t' u' rU lU} → Neutral A → Γ ⊢ Id A t u ~ Id (Univ rU lU) t' u' ↑! B ^ l → ⊥ IdU-elim neA (Id-cong x x₁ x₂) = let _ , _ , neU = ne~↓! x in ⊥-elim (nonNeutralU neU) IdU-elim neA (Id-U x x₁) = ⊥-elim (nonNeutralU neA) IdU-elim neA (Id-Uℕ x) = ⊥-elim (nonNeutralU neA) IdU-elim neA (Id-UΠ x x₁) = ⊥-elim (nonNeutralU neA) IdU-elim' : ∀ {Γ l A B t u t' u' rU lU} → Neutral A → Γ ⊢ Id (Univ rU lU) t u ~ Id A t' u' ↑! B ^ l → ⊥ IdU-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in IdU-elim neA e' IdUℕ-elim : ∀ {Γ l A t u t' u' rU lU} → Γ ⊢ Id (Univ rU lU) t u ~ Id ℕ t' u' ↑! A ^ l → ⊥ IdUℕ-elim (Id-cong () x₁ x₂) IdℕU-elim : ∀ {Γ l A t u t' u' rU lU} → Γ ⊢ Id ℕ t u ~ Id (Univ rU lU) t' u' ↑! A ^ l → ⊥ IdℕU-elim (Id-cong () x₁ x₂) IdUUℕ-elim : ∀ {Γ l A t u u'} → Neutral t → Γ ⊢ Id (U ⁰) t u ~ Id (U ⁰) ℕ u' ↑! A ^ l → ⊥ IdUUℕ-elim () (Id-Uℕ x) IdUUℕ-elim' : ∀ {Γ l A t u u'} → Neutral t → Γ ⊢ Id (U ⁰) ℕ u ~ Id (U ⁰) t u' ↑! A ^ l → ⊥ IdUUℕ-elim' () (Id-Uℕ x) IdUUΠ-elim- : ∀ {Γ l A rA B X t} → Neutral t → Γ ⊢ t [conv↓] Π A ^ rA ° ⁰ ▹ B ° ⁰ ° ⁰ ∷ X ^ l → ⊥ IdUUΠ-elim- net (η-eq x x₁ x₂ x₃ x₄ x₅ (ne ()) x₇) IdUUΠ-elim : ∀ {Γ l A rA B X t u u'} → Neutral t → Γ ⊢ Id (U ⁰) t u ~ Id (U ⁰) (Π A ^ rA ° ⁰ ▹ B ° ⁰ ° ⁰) u' ↑! X ^ l → ⊥ IdUUΠ-elim net (Id-cong x y x₂) = let e = conv↑-inversion Uₙ (ne net) Πₙ y in IdUUΠ-elim- net e IdUUΠ-elim net (Id-U () x₁) IdUUΠ-elim () (Id-UΠ x x₁) IdUUΠ-elim' : ∀ {Γ l A rA B X t u u'} → Neutral t → Γ ⊢ Id (U ⁰) (Π A ^ rA ° ⁰ ▹ B ° ⁰ ° ⁰) u ~ Id (U ⁰) t u' ↑! X ^ l → ⊥ IdUUΠ-elim' net e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in IdUUΠ-elim net e' IdUUΠℕ-elim- : ∀ {Γ l A rA B X} → Γ ⊢ Π A ^ rA ° ⁰ ▹ B ° ⁰ ° ⁰ [conv↓] ℕ ∷ X ^ l → ⊥ IdUUΠℕ-elim- (η-eq x x₁ x₂ x₃ x₄ x₅ (ne ()) x₇) IdUUΠℕ-elim : ∀ {Γ l A rA B X u u'} → Γ ⊢ Id (U ⁰) (Π A ^ rA ° ⁰ ▹ B ° ⁰ ° ⁰) u ~ Id (U ⁰) ℕ u' ↑! X ^ l → ⊥ IdUUΠℕ-elim (Id-cong x y x₂) = let e = conv↑-inversion Uₙ Πₙ ℕₙ y in IdUUΠℕ-elim- e IdUUΠℕ-elim (Id-U () x₁) IdUUΠℕ-elim' : ∀ {Γ l A rA B X u u'} → Γ ⊢ Id (U ⁰) ℕ u ~ Id (U ⁰) (Π A ^ rA ° ⁰ ▹ B ° ⁰ ° ⁰) u' ↑! X ^ l → ⊥ IdUUΠℕ-elim' e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in IdUUΠℕ-elim e' castℕ-elim : ∀ {Γ l A B B' X t e t' e'} → Neutral A → Γ ⊢ cast ⁰ A B e t ~ cast ⁰ ℕ B' e' t' ↑! X ^ l → ⊥ castℕ-elim neA (cast-cong () x₁ x₂ x₃ x₄) castℕ-elim () (cast-ℕ x x₁ x₂ x₃) castℕ-elim () (cast-ℕℕ x x₁ x₂) castℕ-elim () (cast-ℕΠ x x₁ x₂ x₃) castℕ-elim' : ∀ {Γ l A B B' X t e t' e'} → Neutral A → Γ ⊢ cast ⁰ ℕ B e t ~ cast ⁰ A B' e' t' ↑! X ^ l → ⊥ castℕ-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castℕ-elim neA e' castΠ-elim : ∀ {Γ l A B B' X t e t' e' r P Q} → Neutral A → Γ ⊢ cast ⁰ A B e t ~ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) B' e' t' ↑! X ^ l → ⊥ castΠ-elim neA (cast-cong () x₁ x₂ x₃ x₄) castΠ-elim () (cast-Π x x₁ x₂ x₃ x₄) castΠ-elim () (cast-Πℕ x x₁ x₂ x₃) castΠ-elim () (cast-ΠΠ%! x x₁ x₂ x₃ x₄) castΠ-elim () (cast-ΠΠ!% x x₁ x₂ x₃ x₄) castΠ-elim' : ∀ {Γ l A B B' X t e t' e' r P Q} → Neutral A → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) B e t ~ cast ⁰ A B' e' t' ↑! X ^ l → ⊥ castΠ-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castΠ-elim neA e' castℕℕ-elim : ∀ {Γ l A X t e t' e'} → Neutral A → Γ ⊢ cast ⁰ ℕ A e t ~ cast ⁰ ℕ ℕ e' t' ↑! X ^ l → ⊥ castℕℕ-elim neA (cast-cong () x₁ x₂ x₃ x₄) castℕℕ-elim (var n) (cast-ℕ () x₁ x₂ x₃) castℕℕ-elim () (cast-ℕℕ x x₁ x₂) castℕℕ-elim' : ∀ {Γ l A X t e t' e'} → Neutral A → Γ ⊢ cast ⁰ ℕ ℕ e t ~ cast ⁰ ℕ A e' t' ↑! X ^ l → ⊥ castℕℕ-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castℕℕ-elim neA e' castℕΠ-elim : ∀ {Γ l A A' X t e t' e' r P Q} → Γ ⊢ cast ⁰ ℕ A e t ~ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) A' e' t' ↑! X ^ l → ⊥ castℕΠ-elim (cast-cong () x₁ x₂ x₃ x₄) castℕΠ-elim' : ∀ {Γ l A A' X t e t' e' r P Q} → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) A e t ~ cast ⁰ ℕ A' e' t' ↑! X ^ l → ⊥ castℕΠ-elim' (cast-cong () x₁ x₂ x₃ x₄) castℕneΠ-elim : ∀ {Γ l A X t e t' e' r P Q} → Neutral A → Γ ⊢ cast ⁰ ℕ A e t ~ cast ⁰ ℕ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) e' t' ↑! X ^ l → ⊥ castℕneΠ-elim neA (cast-cong () x₁ x₂ x₃ x₄) castℕneΠ-elim neA (cast-ℕ () x₁ x₂ x₃) castℕneΠ-elim () (cast-ℕΠ x x₁ x₂ x₃) castℕneΠ-elim' : ∀ {Γ l A X t e t' e' r P Q} → Neutral A → Γ ⊢ cast ⁰ ℕ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) e t ~ cast ⁰ ℕ A e' t' ↑! X ^ l → ⊥ castℕneΠ-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castℕneΠ-elim neA e' castℕℕΠ-elim : ∀ {Γ l X t e t' e' r P Q} → Γ ⊢ cast ⁰ ℕ ℕ e t ~ cast ⁰ ℕ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) e' t' ↑! X ^ l → ⊥ castℕℕΠ-elim (cast-cong () x₁ x₂ x₃ x₄) castℕℕΠ-elim (cast-ℕ () x₁ x₂ x₃) castℕℕΠ-elim' : ∀ {Γ l X t e t' e' r P Q} → Γ ⊢ cast ⁰ ℕ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) e t ~ cast ⁰ ℕ ℕ e' t' ↑! X ^ l → ⊥ castℕℕΠ-elim' e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castℕℕΠ-elim e' castΠneℕ-elim : ∀ {Γ l A X t e t' e' r P Q r' P' Q'} → Neutral A → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) A e t ~ cast ⁰ (Π P' ^ r' ° ⁰ ▹ Q' ° ⁰ ° ⁰) ℕ e' t' ↑! X ^ l → ⊥ castΠneℕ-elim neA (cast-cong () x₁ x₂ x₃ x₄) castΠneℕ-elim neA (cast-Π x () x₂ x₃ x₄) castΠneℕ-elim () (cast-Πℕ x x₁ x₂ x₃) castΠneℕ-elim' : ∀ {Γ l A X t e t' e' r P Q r' P' Q'} → Neutral A → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) ℕ e t ~ cast ⁰ (Π P' ^ r' ° ⁰ ▹ Q' ° ⁰ ° ⁰) A e' t' ↑! X ^ l → ⊥ castΠneℕ-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castΠneℕ-elim neA e' castΠneΠ-elim : ∀ {Γ l A X t e t' e' r P Q r' P' Q' r'' P'' Q''} → Neutral A → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) A e t ~ cast ⁰ (Π P' ^ r' ° ⁰ ▹ Q' ° ⁰ ° ⁰) (Π P'' ^ r'' ° ⁰ ▹ Q'' ° ⁰ ° ⁰) e' t' ↑! X ^ l → ⊥ castΠneΠ-elim neA (cast-cong () x₁ x₂ x₃ x₄) castΠneΠ-elim neA (cast-Π x () x₂ x₃ x₄) castΠneΠ-elim () (cast-ΠΠ%! x x₁ x₂ x₃ x₄) castΠneΠ-elim () (cast-ΠΠ!% x x₁ x₂ x₃ x₄) castΠneΠ-elim' : ∀ {Γ l A X t e t' e' r P Q r' P' Q' r'' P'' Q''} → Neutral A → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) (Π P'' ^ r'' ° ⁰ ▹ Q'' ° ⁰ ° ⁰) e t ~ cast ⁰ (Π P' ^ r' ° ⁰ ▹ Q' ° ⁰ ° ⁰) A e' t' ↑! X ^ l → ⊥ castΠneΠ-elim' neA e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castΠneΠ-elim neA e' castΠΠℕ-elim : ∀ {Γ l X t e t' e' r P Q r' P' Q' r'' P'' Q''} → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) ℕ e t ~ cast ⁰ (Π P' ^ r' ° ⁰ ▹ Q' ° ⁰ ° ⁰) (Π P'' ^ r'' ° ⁰ ▹ Q'' ° ⁰ ° ⁰) e' t' ↑! X ^ l → ⊥ castΠΠℕ-elim (cast-cong () x₁ x₂ x₃ x₄) castΠΠℕ-elim (cast-Π x () x₂ x₃ x₄) castΠΠℕ-elim' : ∀ {Γ l X t e t' e' r P Q r' P' Q' r'' P'' Q''} → Γ ⊢ cast ⁰ (Π P ^ r ° ⁰ ▹ Q ° ⁰ ° ⁰) (Π P'' ^ r'' ° ⁰ ▹ Q'' ° ⁰ ° ⁰) e t ~ cast ⁰ (Π P' ^ r' ° ⁰ ▹ Q' ° ⁰ ° ⁰) ℕ e' t' ↑! X ^ l → ⊥ castΠΠℕ-elim' e = let _ , _ , e' = sym~↑! (reflConEq (wfEqTerm (soundness~↑! e))) e in castΠΠℕ-elim e' castΠΠ!%-elim : ∀ {Γ l A A' X t e t' e' P Q P' Q'} → Γ ⊢ cast ⁰ (Π P ^ ! ° ⁰ ▹ Q ° ⁰ ° ⁰) A e t ~ cast ⁰ (Π P' ^ % ° ⁰ ▹ Q' ° ⁰ ° ⁰) A' e' t' ↑! X ^ l → ⊥ castΠΠ!%-elim (cast-cong () x₁ x₂ x₃ x₄) castΠΠ%!-elim : ∀ {Γ l A A' X t e t' e' P Q P' Q'} → Γ ⊢ cast ⁰ (Π P ^ % ° ⁰ ▹ Q ° ⁰ ° ⁰) A e t ~ cast ⁰ (Π P' ^ ! ° ⁰ ▹ Q' ° ⁰ ° ⁰) A' e' t' ↑! X ^ l → ⊥ castΠΠ%!-elim (cast-cong () x₁ x₂ x₃ x₄) -- Helper functions for decidability for neutrals decConv↓Term-ℕ-ins : ∀ {t u Γ l} → Γ ⊢ t [conv↓] u ∷ ℕ ^ l → Γ ⊢ t ~ t ↓! ℕ ^ l → Γ ⊢ t ~ u ↓! ℕ ^ l decConv↓Term-ℕ-ins (ℕ-ins x) t~t = x decConv↓Term-ℕ-ins (ne-ins x x₁ () x₃) t~t decConv↓Term-ℕ-ins (zero-refl x) ([~] A D whnfB ()) decConv↓Term-ℕ-ins (suc-cong x) ([~] A D whnfB ()) decConv↓Term-U-ins : ∀ {t u Γ r lU l} → Γ ⊢ t [conv↓] u ∷ Univ r lU ^ l → Γ ⊢ t ~ t ↓! Univ r lU ^ l → Γ ⊢ t ~ u ↓! Univ r lU ^ l decConv↓Term-U-ins (ne x) t~r = x decConv↓Term-ne-ins : ∀ {t u A Γ l} → Neutral A → Γ ⊢ t [conv↓] u ∷ A ^ l → ∃ λ B → ∃ λ lB → Γ ⊢ t ~ u ↓! B ^ lB decConv↓Term-ne-ins neA (ne-ins x x₁ x₂ x₃) = _ , _ , x₃ -- Helper function for decidability for impossibility of terms not being equal -- as neutrals when they are equal as terms and the first is a neutral. decConv↓Term-ℕ : ∀ {t u Γ l} → Γ ⊢ t [conv↓] u ∷ ℕ ^ l → Γ ⊢ t ~ t ↓! ℕ ^ l → ¬ (Γ ⊢ t ~ u ↓! ℕ ^ l) → ⊥ decConv↓Term-ℕ (ℕ-ins x) t~t ¬u~u = ¬u~u x decConv↓Term-ℕ (ne-ins x x₁ () x₃) t~t ¬u~u decConv↓Term-ℕ (zero-refl x) ([~] A D whnfB ()) ¬u~u decConv↓Term-ℕ (suc-cong x) ([~] A D whnfB ()) ¬u~u decConv↓Term-U : ∀ {t u Γ r lU l} → Γ ⊢ t [conv↓] u ∷ Univ r lU ^ l → Γ ⊢ t ~ t ↓! Univ r lU ^ l → ¬ (Γ ⊢ t ~ u ↓! Univ r lU ^ l) → ⊥ decConv↓Term-U (ne x) t~t ¬u~u = ¬u~u x
lab/task7_faculty.asm
knodel/msp430lab
2
26955
;------------------------------------------------------------------------------ ; MIT License ; ; Copyright (c) 2019 <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. ;------------------------------------------------------------------------------ ;------------------------------------------------------------------------------ ; Digital I/O example for the LaunchPad ; Read the status of built in push button - P1.3 ; (Note that P1.3 is "1" when the push button is open and "0" when the button is closed) ; Red light if the button is not pushed - P1.0 ; Green light if the button is pushed - P1.6 ; Erweiterunng: simple Zeitverz�gerung des Anschaltens (mittels Warteschleife) ;;------------------------------------------------------------------------------ .cdecls C,LIST,"msp430g2231.h" ; cdecls tells assembler to allow ; ; the c header file ; .cdecls C,LIST,"msp430g2553.h" ; cdecls tells assembler to allow ; the c header file ;****************************************************************************** ; Main Code ;****************************************************************************** .text ; program start .global _main ; define entry point ;------------------------------------------------------------------------------ ; Definition von Konstanten zwecks besserer Lesbarkeit ; leichterer �nderung des Programms LED_GREEN .set 01000000b LED_RED .set 00000001b LED_BOTH .set LED_GREEN | LED_RED PLED_DIR .set P1DIR PLED_OUT .set P1OUT SWITCH .set 00001000b PSWITCH_DIR .set P1DIR PSWITCH_IN .set P1IN ;******************************************************************************* ; MSP430G2xx1 Demo - Timer_A, Toggle P1.0, CCR0 Cont. Mode ISR, DCO SMCLK ; ; Description: Toggle P1.0 using software and TA_0 ISR. Toggles every ; 50000 SMCLK cycles. SMCLK provides clock source for TACLK. ; During the TA_0 ISR, P1.0 is toggled and 50000 clock cycles are added to ; CCR0. TA_0 ISR is triggered every 50000 cycles. CPU is normally off and ; used only during TA_ISR. ; ACLK = n/a, MCLK = SMCLK = TACLK = default DCO ; ; MSP430G2xx1 ; ----------------- ; /|\| XIN|- ; | | | ; --|RST XOUT|- ; | | ; | P1.0|-->LED ; ; <NAME> ; Texas Instruments Inc. ; October 2010 ; Built with Code Composer Essentials Version: 4.2.0 ;******************************************************************************* ;------------------------------------------------------------------------------ ; Einsprungpunkt: Beginn des eigentlichen Programms ; ; Initialisierung der Hardware ;------------------------------------------------------------------------------ reset mov.w #0280h,SP ; Initialize stackpointer StopWDT mov.w #WDTPW+WDTHOLD,&WDTCTL ; Stop WDT mov.b #382d,R5 clrc mov.w R5,R6 push R6 rlc R6 rlc R6 add.w r5,r6 and.b #0fff1h,r6 mov.b #99h,R7 Push R7 mov.w #027Eh,R5 mov.w @R5,R5 ;Initialisierung der LEDs bic.b #(LED_GREEN | LED_RED),&PLED_DIR ; P1.0 und P1.6 r�cksetzen ;erst definierten Zustand herstellen, dann auf Output schalten! bis.b #(LED_GREEN | LED_RED),&PLED_DIR ; P1.0 und P1.6 Output ; alle anderen sind Inputs als Default ;Initialisierung des Tasters ;bic.b #SWITCH,&PSWITCH_DIR ; P1.3 Input (eigentlich unn�tig ...) bis.b #00001000b,&P1REN ;internen PULL-Up-Widerstand anschalten waitloop bit.b #SWITCH,&PSWITCH_IN ; Taste an P1.3 einlesen jnz waitloop ; Sprung, wenn Taste offen SetupC0 mov.w #CCIE,&CCTL0 ; CCR0 interrupt enabled mov.w #50000d,&TACCR0 ; Timer_A Capture CompaRe SetupTA mov.w #(TASSEL_2 | MC_3 | ID_2 | TAIE ),&TACTL ; SMCLK, continous_mode ; TACTL: Timer_A ConTroL ; TASSEL: Timer_A Source SELect ; TASSEL_2: SMCLK (1MHz) ; MC_0 Halt ; MC_1: up_mode = 1:50000 ; MC_2: continous_mode ; MC_3: up-down_mode = 1:100000 ; ID_2: Vorteiler (Input Divider) = 1:4 ; --> 1:400000 ; leeres Hauptprogramm - alle Aktionen sind Interrupt getrieben ;bis.w #CPUOFF+GIE,SR ; CPU off, interrupts enabled --> sleep mode bis.w #GIE,SR ; CPU on, interrupts enabled Mainloop jmp Mainloop ; Required only for debugger, besser sleep-mode ;------------------------------------------------------------------------------- ; Toggle P1.0 ;------------------------------------------------------------------------------- TA0_ISR nop reti ; ; ;****************************************************************************** ; Main Loop ;****************************************************************************** ;Mainloop bit.b #SWITCH,&PSWITCH_IN ; Taste an P1.3 einlesen jnz Off ; Sprung, wenn Taste offen ;Taste gedr�ckt On bic.b #LED_RED,&PLED_OUT ; rote LED aus call #waitlong bis.b #LED_GREEN,&PLED_OUT ; gr�ne LED an jmp fertig ;Taste offen Off bic.b #LED_GREEN,&PLED_OUT ; gr�ne LED aus call #waitlong bis.b #LED_RED,&PLED_OUT ; rote LED an fertig jmp Mainloop ;****************************************************************************** ; Subroutines ;****************************************************************************** ; Warteschleife waitshort push SR push R15 mov.w #50000d,R15 waitshort_loop dec R15 jnz waitshort_loop pop R15 pop SR ret waitlong: push SR push R15 mov.w #5d,R15 waitlong_loop call #waitshort dec R15 jnz waitlong_loop pop R15 pop SR ret ;****************************************************************************** ; Interrupt Vectors ;****************************************************************************** .sect ".reset" ; MSP430 RESET Vector .short reset .sect ".int09" ; Timer_A0 Vector .short TA0_ISR ; .end
src/open_weather_map-city_ids.ads
Jellix/open_weather_map_api
1
29965
<filename>src/open_weather_map-city_ids.ads -------------------------------------------------------------------------------- -- Copyright (C) 2020 by Heisenbug Ltd. (<EMAIL>) -- -- This work is free. You can redistribute it and/or modify it under the -- terms of the Do What The Fuck You Want To Public License, Version 2, -- as published by Sam Hocevar. See the LICENSE file for more details. -------------------------------------------------------------------------------- pragma License (Unrestricted); -------------------------------------------------------------------------------- --% @summary --% Open_Weather_Map.City_Ids -- --% @description --% Provides the Ada language version of city Ids. -- -- Please note that this list may change, the actual list can be downloaded -- from <http://bulk.openwathermap.org/sample/city.list.json.gz>). -------------------------------------------------------------------------------- package Open_Weather_Map.City_Ids is package Mexico is -- Mexico/Guerrero (B. smithii) Acapulco_de_Juarez : constant City_Id := 3533462; Chacalapa_Acapulco : constant City_Id := 3531263; Coyuca_de_Benitez : constant City_Id := 4012608; Las_Guacamayas : constant City_Id := 4026075; Tierra_Colorada : constant City_Id := 3515643; Xaltianguis : constant City_Id := 3514583; end Mexico; package India is -- India (P. Metallica) Giddalur : constant City_Id := 1271213; Nandyal : constant City_Id := 1261927; end India; end Open_Weather_Map.City_Ids;
programs/oeis/336/A336754.asm
jmorken/loda
1
12674
<filename>programs/oeis/336/A336754.asm ; A336754: Perimeters in increasing order of integer-sided triangles whose sides a < b < c are in arithmetic progression. ; 9,12,15,15,18,18,21,21,21,24,24,24,27,27,27,27,30,30,30,30,33,33,33,33,33,36,36,36,36,36,39,39,39,39,39,39,42,42,42,42,42,42,45,45,45,45,45,45,45,48,48,48,48,48,48,48,51,51,51,51,51,51,51,51 mul $0,2 mov $1,1 lpb $0 add $1,1 sub $0,$1 lpe add $1,2 mul $1,3
Task/Luhn-test-of-credit-card-numbers/Ada/luhn-test-of-credit-card-numbers.ada
mullikine/RosettaCodeData
1
22760
with Ada.Text_IO; use Ada.Text_IO; procedure Luhn is function Luhn_Test (Number: String) return Boolean is Sum : Natural := 0; Odd : Boolean := True; Digit: Natural range 0 .. 9; begin for p in reverse Number'Range loop Digit := Integer'Value (Number (p..p)); if Odd then Sum := Sum + Digit; else Sum := Sum + (Digit*2 mod 10) + (Digit / 5); end if; Odd := not Odd; end loop; return (Sum mod 10) = 0; end Luhn_Test; begin Put_Line (Boolean'Image (Luhn_Test ("49927398716"))); Put_Line (Boolean'Image (Luhn_Test ("49927398717"))); Put_Line (Boolean'Image (Luhn_Test ("1234567812345678"))); Put_Line (Boolean'Image (Luhn_Test ("1234567812345670"))); end Luhn;
Cubical/HITs/Wedge/Base.agda
Schippmunk/cubical
0
2900
{-# OPTIONS --cubical --no-import-sorts --safe #-} module Cubical.HITs.Wedge.Base where open import Cubical.Foundations.Prelude open import Cubical.Foundations.Pointed open import Cubical.HITs.Pushout.Base open import Cubical.Data.Unit _⋁_ : ∀ {ℓ ℓ'} → Pointed ℓ → Pointed ℓ' → Type (ℓ-max ℓ ℓ') _⋁_ (A , ptA) (B , ptB) = Pushout {A = Unit} {B = A} {C = B} (λ _ → ptA) (λ _ → ptB) -- pointed versions _⋁∙ₗ_ : ∀ {ℓ ℓ'} → Pointed ℓ → Pointed ℓ' → Pointed (ℓ-max ℓ ℓ') A ⋁∙ₗ B = (A ⋁ B) , (inl (snd A)) _⋁∙ᵣ_ : ∀ {ℓ ℓ'} → Pointed ℓ → Pointed ℓ' → Pointed (ℓ-max ℓ ℓ') A ⋁∙ᵣ B = (A ⋁ B) , (inr (snd B))
Integer/EucDomain.agda
onestruggler/EucDomain
0
1610
-- Example, ℤ is an Euclidean Domain. Here all the properties needed -- are already proved in Data.Integer.Properties. However, we will -- prove there is another divmod pair such that the rank estimation -- is more precise, see EucDomain2.agda. {-# OPTIONS --without-K --safe #-} module Integer.EucDomain where -- imports from stdlib. open import Relation.Nullary using (¬_) open import Relation.Binary.PropositionalEquality using (refl ; _≡_) open import Data.Nat using (_<_) open import Data.Integer using (_+_ ; _*_ ; -_ ; ℤ ; 0ℤ ; 1ℤ ; ∣_∣ ; +[1+_] ; -[1+_] ; +_) open import Data.Integer.DivMod renaming (_div_ to _divℤ_; _mod_ to _modℤ_ ; n%d<d to euc-rankℤ; a≡a%n+[a/n]*n to euc-eqℤ) open import Data.Integer.Properties using (+-*-isCommutativeRing ; *-cancelˡ-≡) open import Algebra.Definitions (_≡_ {A = ℤ}) using (AlmostLeftCancellative) -- imports from local. import EuclideanDomain open EuclideanDomain.Structures (_≡_ {A = ℤ}) open EuclideanDomain.Bundles -- You will notice the recurring pattern that I have to split on -- the divisor d, and use ¬ d ≡ 0ℤ to exclude the zero divisor -- case. And addtionally, I have to repeat similary codes -- twice. This is the price of the translation from ¬ a ≡ 0ℤ to -- NonZero a. I don't have a good way to avoid this. This become -- even more awkward when dealing with Gaussian integers since we -- have more constructor there (meaning more cases and more -- repeatitions). -- On the other hand, a translation from NonZero predicate to -- non-equaity ¬ d ≡ 0ℤ is quite easy. We will use this to define -- div and mod with instance predicate argument for 𝔾. -- I could use NonZero predicate in the definition of Euclidean -- Domain, but that will make the definition more complicated. Also -- the file "Algebra.Definition" using the same method as here to -- exclude zero, for example the definition of -- "AlmostLeftCancellative", so we also comply this convention. -- div with irrelevant instance argument replaced by non-equality -- argument. div : ∀ (n d : ℤ) -> ¬ d ≡ 0ℤ -> ℤ div n (+ 0) n0 with n0 refl ... | () div n d@(+[1+ n₁ ]) n0 = n divℤ d div n d@(-[1+_] n₁) n0 = n divℤ d -- mod with irrelevant instance argument replaced by non-equality -- argument. mod : ∀ (n d : ℤ) -> ¬ d ≡ 0ℤ -> ℤ mod n (+ 0) n0 with n0 refl ... | () mod n d@(+[1+ n₁ ]) n0 = + (n modℤ d) mod n d@(-[1+_] n₁) n0 = + (n modℤ d) -- Divident = reminder + quotient * divisor. euc-eq : ∀ (n d : ℤ) (n0 : ¬ d ≡ 0ℤ) -> let r = mod n d n0 in let q = div n d n0 in n ≡ r + q * d euc-eq n (+ 0) n0 with n0 refl ... | () euc-eq n d@(+[1+ n₁ ]) n0 = euc-eqℤ n d euc-eq n d@(-[1+_] n₁) n0 = euc-eqℤ n d -- The rank of the reminder is strictly smaller than the rank of the -- divisor. euc-rank : ∀ (n d : ℤ) (n0 : ¬ d ≡ 0ℤ) -> let r = mod n d n0 in let q = div n d n0 in ∣ r ∣ < ∣ d ∣ euc-rank n (+ 0) n0 with n0 refl ... | () euc-rank n d@(+[1+ n₁ ]) n0 = euc-rankℤ n d euc-rank n d@(-[1+_] n₁) n0 = euc-rankℤ n d -- Multiplication is left cancellative. *-alc-ℤ : AlmostLeftCancellative 0ℤ _*_ *-alc-ℤ {+ 0} j k n0 with n0 refl ... | () *-alc-ℤ {i@(+[1+ n ])} j k n0 = *-cancelˡ-≡ i j k *-alc-ℤ { i@(-[1+ n ])} j k n0 = *-cancelˡ-≡ i j k -- ℤ is an Euclidean Domain. +-*-isEuclideanDomain : IsEuclideanDomain _+_ _*_ -_ 0ℤ 1ℤ +-*-isEuclideanDomain = record { isCommutativeRing = +-*-isCommutativeRing ; *-alc = *-alc-ℤ ; div = div ; mod = mod ; rank = ∣_∣ ; euc-eq = euc-eq ; euc-rank = euc-rank } -- Bundle. +-*-euclideanDomain : EuclideanDomainBundle _ _ +-*-euclideanDomain = record { isEuclideanDomain = +-*-isEuclideanDomain }
src/Categories/Functor/Hom/Properties.agda
Trebor-Huang/agda-categories
279
3230
{-# OPTIONS --without-K --safe #-} open import Categories.Category module Categories.Functor.Hom.Properties {o ℓ e} (C : Category o ℓ e) where open import Categories.Functor.Hom.Properties.Covariant C public open import Categories.Functor.Hom.Properties.Contra C public
src/main/ada/2019/aoc-aoc_2019-day01.ads
wooky/aoc.kt
0
14807
<gh_stars>0 package AOC.AOC_2019.Day01 is type Day_01 is new Day.Day with private; overriding procedure Init (D : in out Day_01; Root : String); overriding function Part_1 (D : Day_01) return String; overriding function Part_2 (D : Day_01) return String; private type Mass is new Natural; subtype Fuel is Mass; type Day_01 is new Day.Day with record Total_Fuel : Fuel := 0; Abhorrent_Total_Fuel : Fuel := 0; end record; function Calc_Fuel (M : Mass) return Fuel; function Calc_Abhorrent_Fuel (M : Mass) return Fuel; end AOC.AOC_2019.Day01;
.build/ada/asis-gela-elements-defs-const.ads
faelys/gela-asis
4
24332
<filename>.build/ada/asis-gela-elements-defs-const.ads ------------------------------------------------------------------------------ -- Copyright (c) 2006-2013, <NAME> -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- * Neither the name of the <NAME>, 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 OWNER 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. ------------------------------------------------------------------------------ package Asis.Gela.Elements.Defs.Const is ------------------------------------ -- Range_Attribute_Reference_Node -- ------------------------------------ type Range_Attribute_Reference_Node is new Constraint_Node with private; type Range_Attribute_Reference_Ptr is access all Range_Attribute_Reference_Node; for Range_Attribute_Reference_Ptr'Storage_Pool use Lists.Pool; function New_Range_Attribute_Reference_Node (The_Context : ASIS.Context) return Range_Attribute_Reference_Ptr; function Range_Attribute (Element : Range_Attribute_Reference_Node) return Asis.Expression; procedure Set_Range_Attribute (Element : in out Range_Attribute_Reference_Node; Value : in Asis.Expression); function Constraint_Kind (Element : Range_Attribute_Reference_Node) return Asis.Constraint_Kinds; function Children (Element : access Range_Attribute_Reference_Node) return Traverse_List; function Clone (Element : Range_Attribute_Reference_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Range_Attribute_Reference_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); ---------------------------------- -- Simple_Expression_Range_Node -- ---------------------------------- type Simple_Expression_Range_Node is new Constraint_Node with private; type Simple_Expression_Range_Ptr is access all Simple_Expression_Range_Node; for Simple_Expression_Range_Ptr'Storage_Pool use Lists.Pool; function New_Simple_Expression_Range_Node (The_Context : ASIS.Context) return Simple_Expression_Range_Ptr; function Lower_Bound (Element : Simple_Expression_Range_Node) return Asis.Expression; procedure Set_Lower_Bound (Element : in out Simple_Expression_Range_Node; Value : in Asis.Expression); function Upper_Bound (Element : Simple_Expression_Range_Node) return Asis.Expression; procedure Set_Upper_Bound (Element : in out Simple_Expression_Range_Node; Value : in Asis.Expression); function Constraint_Kind (Element : Simple_Expression_Range_Node) return Asis.Constraint_Kinds; function Children (Element : access Simple_Expression_Range_Node) return Traverse_List; function Clone (Element : Simple_Expression_Range_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Simple_Expression_Range_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); ---------------------------- -- Digits_Constraint_Node -- ---------------------------- type Digits_Constraint_Node is new Constraint_Node with private; type Digits_Constraint_Ptr is access all Digits_Constraint_Node; for Digits_Constraint_Ptr'Storage_Pool use Lists.Pool; function New_Digits_Constraint_Node (The_Context : ASIS.Context) return Digits_Constraint_Ptr; function Digits_Expression (Element : Digits_Constraint_Node) return Asis.Expression; procedure Set_Digits_Expression (Element : in out Digits_Constraint_Node; Value : in Asis.Expression); function Real_Range_Constraint (Element : Digits_Constraint_Node) return Asis.Range_Constraint; procedure Set_Real_Range_Constraint (Element : in out Digits_Constraint_Node; Value : in Asis.Range_Constraint); function Constraint_Kind (Element : Digits_Constraint_Node) return Asis.Constraint_Kinds; function Children (Element : access Digits_Constraint_Node) return Traverse_List; function Clone (Element : Digits_Constraint_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Digits_Constraint_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); --------------------------- -- Delta_Constraint_Node -- --------------------------- type Delta_Constraint_Node is new Constraint_Node with private; type Delta_Constraint_Ptr is access all Delta_Constraint_Node; for Delta_Constraint_Ptr'Storage_Pool use Lists.Pool; function New_Delta_Constraint_Node (The_Context : ASIS.Context) return Delta_Constraint_Ptr; function Delta_Expression (Element : Delta_Constraint_Node) return Asis.Expression; procedure Set_Delta_Expression (Element : in out Delta_Constraint_Node; Value : in Asis.Expression); function Real_Range_Constraint (Element : Delta_Constraint_Node) return Asis.Range_Constraint; procedure Set_Real_Range_Constraint (Element : in out Delta_Constraint_Node; Value : in Asis.Range_Constraint); function Constraint_Kind (Element : Delta_Constraint_Node) return Asis.Constraint_Kinds; function Children (Element : access Delta_Constraint_Node) return Traverse_List; function Clone (Element : Delta_Constraint_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Delta_Constraint_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); --------------------------- -- Index_Constraint_Node -- --------------------------- type Index_Constraint_Node is new Constraint_Node with private; type Index_Constraint_Ptr is access all Index_Constraint_Node; for Index_Constraint_Ptr'Storage_Pool use Lists.Pool; function New_Index_Constraint_Node (The_Context : ASIS.Context) return Index_Constraint_Ptr; function Discrete_Ranges (Element : Index_Constraint_Node; Include_Pragmas : in Boolean := False) return Asis.Element_List; procedure Set_Discrete_Ranges (Element : in out Index_Constraint_Node; Value : in Asis.Element); function Discrete_Ranges_List (Element : Index_Constraint_Node) return Asis.Element; function Constraint_Kind (Element : Index_Constraint_Node) return Asis.Constraint_Kinds; function Children (Element : access Index_Constraint_Node) return Traverse_List; function Clone (Element : Index_Constraint_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Index_Constraint_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); ---------------------------------- -- Discriminant_Constraint_Node -- ---------------------------------- type Discriminant_Constraint_Node is new Constraint_Node with private; type Discriminant_Constraint_Ptr is access all Discriminant_Constraint_Node; for Discriminant_Constraint_Ptr'Storage_Pool use Lists.Pool; function New_Discriminant_Constraint_Node (The_Context : ASIS.Context) return Discriminant_Constraint_Ptr; function Discriminant_Associations (Element : Discriminant_Constraint_Node; Include_Pragmas : in Boolean := False) return Asis.Element_List; procedure Set_Discriminant_Associations (Element : in out Discriminant_Constraint_Node; Value : in Asis.Element); function Discriminant_Associations_List (Element : Discriminant_Constraint_Node) return Asis.Element; function Normalized_Discriminant_Associations (Element : Discriminant_Constraint_Node; Include_Pragmas : in Boolean := False) return Asis.Element_List; procedure Add_To_Normalized_Discriminant_Associations (Element : in out Discriminant_Constraint_Node; Item : in Asis.Element); function Constraint_Kind (Element : Discriminant_Constraint_Node) return Asis.Constraint_Kinds; function Children (Element : access Discriminant_Constraint_Node) return Traverse_List; function Clone (Element : Discriminant_Constraint_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Discriminant_Constraint_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); private type Range_Attribute_Reference_Node is new Constraint_Node with record Range_Attribute : aliased Asis.Expression; end record; type Simple_Expression_Range_Node is new Constraint_Node with record Lower_Bound : aliased Asis.Expression; Upper_Bound : aliased Asis.Expression; end record; type Digits_Constraint_Node is new Constraint_Node with record Digits_Expression : aliased Asis.Expression; Real_Range_Constraint : aliased Asis.Range_Constraint; end record; type Delta_Constraint_Node is new Constraint_Node with record Delta_Expression : aliased Asis.Expression; Real_Range_Constraint : aliased Asis.Range_Constraint; end record; type Index_Constraint_Node is new Constraint_Node with record Discrete_Ranges : aliased Primary_Definition_Lists.List; end record; type Discriminant_Constraint_Node is new Constraint_Node with record Discriminant_Associations : aliased Primary_Association_Lists.List; Normalized_Discriminant_Associations : aliased Secondary_Association_Lists.List_Node; end record; end Asis.Gela.Elements.Defs.Const;
oeis/032/A032343.asm
neoneye/loda-programs
11
244565
; A032343: a(n) = 10*a(n-1)+n^2, a(0)=0. ; Submitted by <NAME>(s3) ; 0,1,14,149,1506,15085,150886,1508909,15089154,150891621,1508916310,15089163221,150891632354,1508916323709,15089163237286,150891632373085,1508916323731106,15089163237311349,150891632373113814,1508916323731138501,15089163237311385410,150891632373113854541,1508916323731138545894,15089163237311385459469,150891632373113854595266,1508916323731138545953285,15089163237311385459533526,150891632373113854595335989,1508916323731138545953360674,15089163237311385459533607581,150891632373113854595336076710 lpb $0 mov $2,$0 sub $0,1 trn $0,$3 seq $2,52262 ; Partial sums of A014824. add $3,$2 lpe mov $0,$3
Cubical/ZCohomology/KcompPrelims.agda
knrafto/cubical
0
324
{-# OPTIONS --cubical --no-import-sorts --safe #-} module Cubical.ZCohomology.KcompPrelims where open import Cubical.ZCohomology.Base open import Cubical.Homotopy.Connected open import Cubical.HITs.Hopf open import Cubical.Homotopy.Freudenthal hiding (encode) open import Cubical.HITs.Sn open import Cubical.HITs.S1 open import Cubical.HITs.Truncation renaming (elim to trElim ; rec to trRec ; map to trMap) open import Cubical.Foundations.Prelude open import Cubical.Foundations.HLevels open import Cubical.Foundations.Isomorphism open import Cubical.Foundations.Equiv open import Cubical.Foundations.Transport open import Cubical.Foundations.Isomorphism open import Cubical.Foundations.GroupoidLaws open import Cubical.Foundations.Univalence open import Cubical.Foundations.Equiv.HalfAdjoint open import Cubical.Data.Int renaming (_+_ to +Int) open import Cubical.Data.Nat open import Cubical.HITs.Susp open import Cubical.HITs.Nullification open import Cubical.Data.Prod.Base open import Cubical.Homotopy.Loopspace open import Cubical.Data.Bool open import Cubical.Data.Sum.Base open import Cubical.Data.Sigma hiding (_×_) open import Cubical.Foundations.Function open import Cubical.Foundations.Pointed open import Cubical.HITs.S3 private variable ℓ ℓ' : Level A : Type ℓ B : Type ℓ' {- We want to prove that Kn≃ΩKn+1. For this we use the map ϕ-} ϕ : (pt a : A) → typ (Ω (Susp A , north)) ϕ pt a = (merid a) ∙ sym (merid pt) {- To define the map for n=0 we use the λ k → loopᵏ map for S₊ 1. The loop is given by ϕ north south -} loop* : Path (S₊ 1) north north loop* = ϕ north south looper : Int → Path (S₊ 1) north north looper (pos zero) = refl looper (pos (suc n)) = looper (pos n) ∙ loop* looper (negsuc zero) = sym loop* looper (negsuc (suc n)) = looper (negsuc n) ∙ sym loop* private {- The map of Kn≃ΩKn+1 is given as follows. -} Kn→ΩKn+1 : (n : ℕ) → coHomK n → typ (Ω (coHomK-ptd (suc n))) Kn→ΩKn+1 zero x = cong ∣_∣ (looper x) Kn→ΩKn+1 (suc n) = trRec (isOfHLevelTrunc (2 + (suc (suc n))) ∣ north ∣ ∣ north ∣) λ a → cong ∣_∣ ((merid a) ∙ (sym (merid north))) {- We show that looper is a composition of intLoop with two other maps, all three being isos -} sndcomp : ΩS¹ → Path (Susp Bool) north north sndcomp = cong S¹→SuspBool thrdcomp : Path (Susp Bool) north north → Path (S₊ 1) north north thrdcomp = cong SuspBool→S1 looper2 : Int → Path (S₊ 1) north north looper2 a = thrdcomp (sndcomp (intLoop a)) looper≡looper2 : (x : Int) → looper x ≡ looper2 x looper≡looper2 (pos zero) = refl looper≡looper2 (pos (suc n)) = looper (pos n) ∙ loop* ≡⟨ (λ i → looper≡looper2 (pos n) i ∙ congFunct SuspBool→S1 (merid false) (sym (merid true)) (~ i)) ⟩ looper2 (pos n) ∙ cong SuspBool→S1 (ϕ true false) ≡⟨ sym (congFunct SuspBool→S1 (sndcomp (intLoop (pos n))) (ϕ true false)) ⟩ cong SuspBool→S1 (sndcomp (intLoop (pos n)) ∙ ϕ true false) ≡⟨ cong thrdcomp (sym (congFunct S¹→SuspBool (intLoop (pos n)) loop)) ⟩ looper2 (pos (suc n)) ∎ looper≡looper2 (negsuc zero) = sym loop* ≡⟨ symDistr (merid south) (sym (merid north)) ⟩ merid north ∙ sym (merid south) ≡⟨ sym (congFunct SuspBool→S1 (merid true) (sym (merid false))) ⟩ cong SuspBool→S1 (merid true ∙ sym (merid false)) ≡⟨ cong thrdcomp (sym (symDistr (merid false) (sym (merid true)))) ⟩ looper2 (negsuc zero) ∎ looper≡looper2 (negsuc (suc n)) = looper (negsuc n) ∙ sym loop* ≡⟨ ((λ i → looper≡looper2 (negsuc n) i ∙ symDistr (merid south) (sym (merid north)) i)) ⟩ looper2 (negsuc n) ∙ merid north ∙ sym (merid south) ≡⟨ cong (λ x → looper2 (negsuc n) ∙ x) (sym (congFunct SuspBool→S1 (merid true) (sym (merid false)))) ⟩ looper2 (negsuc n) ∙ cong SuspBool→S1 (ϕ false true) ≡⟨ cong (λ x → looper2 (negsuc n) ∙ x) (cong thrdcomp (sym (symDistr (merid false) (sym (merid true))))) ⟩ looper2 (negsuc n) ∙ cong SuspBool→S1 (sym (ϕ true false)) ≡⟨ sym (congFunct SuspBool→S1 (sndcomp (intLoop (negsuc n))) (sym (ϕ true false))) ⟩ thrdcomp (cong S¹→SuspBool (intLoop (negsuc n)) ∙ cong S¹→SuspBool (sym loop)) ≡⟨ cong thrdcomp (sym (congFunct S¹→SuspBool (intLoop (negsuc n)) (sym loop))) ⟩ looper2 (negsuc (suc n)) ∎ private isolooper2 : Iso Int (Path (S₊ 1) north north) isolooper2 = compIso (invIso ΩS¹IsoInt) (compIso iso2 iso1) where iso1 : Iso (Path (Susp Bool) north north) (Path (S₊ 1) north north) iso1 = congIso SuspBoolIsoS1 iso2 : Iso ΩS¹ (Path (Susp Bool) north north) iso2 = congIso S¹IsoSuspBool isolooper : Iso Int (Path (S₊ 1) north north) Iso.fun isolooper = looper Iso.inv isolooper = Iso.inv isolooper2 Iso.rightInv isolooper a = (looper≡looper2 (Iso.inv isolooper2 a)) ∙ Iso.rightInv isolooper2 a Iso.leftInv isolooper a = cong (Iso.inv isolooper2) (looper≡looper2 a) ∙ Iso.leftInv isolooper2 a {- We want to show that this map is an equivalence. n ≥ 2 follows from Freudenthal, and -} {- We want to show that the function (looper : Int → S₊ 1) defined by λ k → loopᵏ is an equivalece. We already know that the corresponding function (intLoop : Int → S¹ is) an equivalence, so the idea is to show that when intLoop is transported along a suitable path S₊ 1 ≡ S¹ we get looper. Instead of using S₊ 1 straight away, we begin by showing this for the equivalent Susp Bool. -} ----------------------------------- n = 1 ----------------------------------------------------- {- We begin by stating some useful lemmas -} S³≡SuspSuspS¹ : S³ ≡ Susp (Susp S¹) S³≡SuspSuspS¹ = S³≡SuspS² ∙ λ i → Susp (S²≡SuspS¹ i) S3≡SuspSuspS¹ : S₊ 3 ≡ Susp (Susp S¹) S3≡SuspSuspS¹ = (λ i → Susp (Susp (Susp (ua Bool≃Susp⊥ (~ i))))) ∙ λ i → Susp (Susp (S¹≡SuspBool (~ i))) sphereConnectedSpecCase : isConnected 4 (Susp (Susp S¹)) sphereConnectedSpecCase = transport (λ i → isConnected 4 (S3≡SuspSuspS¹ i)) (sphereConnected 3) {- We give the following map and show that its truncation is an equivalence -} d-map : typ (Ω ((Susp S¹) , north)) → S¹ d-map p = subst HopfSuspS¹ p base d-mapId : (r : S¹) → d-map (ϕ base r) ≡ r d-mapId r = substComposite HopfSuspS¹ (merid r) (sym (merid base)) base ∙ rotLemma r where rotLemma : (r : S¹) → rot r base ≡ r rotLemma base = refl rotLemma (loop i) = refl d-mapComp : fiber d-map base ≡ Path (Susp (Susp S¹)) north north d-mapComp = ΣPathTransport≡PathΣ {B = HopfSuspS¹} _ _ ∙ helper where helper : Path (Σ (Susp S¹) λ x → HopfSuspS¹ x) (north , base) (north , base) ≡ Path (Susp (Susp S¹)) north north helper = (λ i → (Path (S³≡TotalHopf (~ i)) (transp (λ j → S³≡TotalHopf (~ i ∨ ~ j)) (~ i) (north , base)) ((transp (λ j → S³≡TotalHopf (~ i ∨ ~ j)) (~ i) (north , base))))) ∙ (λ i → Path (S³≡SuspSuspS¹ i) (transp (λ j → S³≡SuspSuspS¹ (i ∧ j)) (~ i) base) ((transp (λ j → S³≡SuspSuspS¹ (i ∧ j)) (~ i) base))) is1Connected-dmap : isConnectedFun 3 d-map is1Connected-dmap = toPropElim (λ s → isPropIsOfHLevel 0) (transport (λ j → isContr (∥ d-mapComp (~ j) ∥ 3)) (transport (λ i → isContr (PathΩ {A = Susp (Susp S¹)} {a = north} 3 i)) (refl , isOfHLevelSuc 1 (isOfHLevelSuc 0 sphereConnectedSpecCase) ∣ north ∣ ∣ north ∣ (λ _ → ∣ north ∣)))) d-iso2 : Iso (hLevelTrunc 3 (typ (Ω (Susp S¹ , north)))) (hLevelTrunc 3 S¹) d-iso2 = connectedTruncIso _ d-map is1Connected-dmap {- We show that composing (λ a → ∣ ϕ base a ∣) and (λ x → ∣ d-map x ∣) gives us the identity function. -} d-mapId2 : Iso.fun d-iso2 ∘ trMap (ϕ base) ≡ idfun (hLevelTrunc 3 S¹) d-mapId2 = funExt (trElim (λ _ → isOfHLevelPath 3 (isOfHLevelTrunc 3) _ _) (λ a → cong ∣_∣ (d-mapId a))) {- This means that (λ a → ∣ ϕ base a ∣) is an equivalence -} Iso∣ϕ-base∣ : Iso (hLevelTrunc 3 S¹) (hLevelTrunc 3 (typ (Ω (Susp S¹ , north)))) Iso∣ϕ-base∣ = composesToId→Iso d-iso2 (trMap (ϕ base)) d-mapId2 --------------------------------- -- We cheat when n = 1 and use J to prove the following lemmma. There is an obvious dependent path between ϕ base and ϕ north. Since the first one is an iso, so is the other. -- So far this hasn't been an issue. pointFunIso : ∀ {ℓ ℓ'} {A : Type ℓ} {B : Type ℓ} {C : (A : Type ℓ) (a1 : A) → Type ℓ'} (p : A ≡ B) (a : A) (b : B) → (transport p a ≡ b) → (f : (A : Type ℓ) → (a1 : A) (a2 : hLevelTrunc 3 A) → C A a1) → isIso (f A a) → isIso (f B b) pointFunIso {ℓ = ℓ}{A = A} {B = B} {C = C} = J (λ B p → (a : A) (b : B) → (transport p a ≡ b) → (f : (A : Type ℓ) → (a1 : A) (a2 : hLevelTrunc 3 A) → C A a1) → isIso (f A a) → isIso (f B b)) λ a b trefl f is → transport (λ i → isIso (f A ((sym (transportRefl a) ∙ trefl) i))) is {- By pointFunIso, this gives that λ a → ∣ ϕ north a ∣ is an iso -} isIso∣ϕ∣ : isIso {A = hLevelTrunc 3 (S₊ 1)} {B = hLevelTrunc 3 (typ (Ω (S₊ 2 , north)))} (trMap (ϕ north)) isIso∣ϕ∣ = pointFunIso {A = S¹} (λ i → S¹≡S1 (~ i)) base north refl (λ A a1 → trMap (ϕ a1)) ((Iso.inv Iso∣ϕ-base∣) , ((Iso.rightInv Iso∣ϕ-base∣) , (Iso.leftInv Iso∣ϕ-base∣))) Iso∣ϕ∣ : Iso (hLevelTrunc 3 (S₊ 1)) (hLevelTrunc 3 (typ (Ω (S₊ 2 , north)))) Iso.fun Iso∣ϕ∣ = trMap (ϕ north) Iso.inv Iso∣ϕ∣ = isIso∣ϕ∣ .fst Iso.rightInv Iso∣ϕ∣ = isIso∣ϕ∣ .snd .fst Iso.leftInv Iso∣ϕ∣ = isIso∣ϕ∣ .snd .snd ---------------------------------------------------- Finishing up --------------------------------- -- We need ΩTrunc. It appears to compute better when restated for this particular case -- decode-fun2 : (n : HLevel) → (x : A) → hLevelTrunc n (x ≡ x) → Path (hLevelTrunc (suc n) A) ∣ x ∣ ∣ x ∣ decode-fun2 zero x = trElim (λ _ → isOfHLevelPath 0 (∣ x ∣ , isOfHLevelTrunc 1 ∣ x ∣) ∣ x ∣ ∣ x ∣) (λ p i → ∣ p i ∣) decode-fun2 (suc n) x = trElim (λ _ → isOfHLevelPath' (suc n) (isOfHLevelTrunc (suc (suc n))) ∣ x ∣ ∣ x ∣) (cong ∣_∣) funsAreSame : (n : HLevel) (x : A) (b : hLevelTrunc n (x ≡ x)) → (decode-fun2 n x b) ≡ (ΩTrunc.decode-fun ∣ x ∣ ∣ x ∣ b) funsAreSame zero x = trElim (λ a → isOfHLevelPath 0 (refl , (isOfHLevelSuc 1 (isOfHLevelTrunc 1) ∣ x ∣ ∣ x ∣ refl)) _ _) λ a → refl funsAreSame (suc n) x = trElim (λ a → isOfHLevelPath _ (isOfHLevelPath' (suc n) (isOfHLevelTrunc (suc (suc n))) ∣ x ∣ ∣ x ∣) _ _) λ a → refl decodeIso : (n : HLevel) (x : A) → Iso (hLevelTrunc n (x ≡ x)) (Path (hLevelTrunc (suc n) A) ∣ x ∣ ∣ x ∣) Iso.fun (decodeIso n x) = decode-fun2 n x Iso.inv (decodeIso n x) = ΩTrunc.encode-fun ∣ x ∣ ∣ x ∣ Iso.rightInv (decodeIso n x) b = funsAreSame n x (ΩTrunc.encode-fun ∣ x ∣ ∣ x ∣ b) ∙ ΩTrunc.P-rinv ∣ x ∣ ∣ x ∣ b Iso.leftInv (decodeIso n x) b = cong (ΩTrunc.encode-fun ∣ x ∣ ∣ x ∣) (funsAreSame n x b) ∙ ΩTrunc.P-linv ∣ x ∣ ∣ x ∣ b Iso-Kn-ΩKn+1 : (n : HLevel) → Iso (coHomK n) (typ (Ω (coHomK-ptd (suc n)))) Iso-Kn-ΩKn+1 zero = compIso isolooper (congIso (truncIdempotentIso _ isOfHLevelS1)) Iso-Kn-ΩKn+1 (suc zero) = compIso Iso∣ϕ∣ (decodeIso _ north) Iso-Kn-ΩKn+1 (suc (suc n)) = compIso (connectedTruncIso2 (4 + n) _ (ϕ north) (n , helper) (isConnectedσ (suc n) (sphereConnected _))) (decodeIso _ north) where helper : n + (4 + n) ≡ 2 + (n + (2 + n)) helper = +-suc n (3 + n) ∙ (λ i → suc (+-suc n (2 + n) i)) mapId2 : (n : ℕ) → Kn→ΩKn+1 n ≡ Iso.fun (Iso-Kn-ΩKn+1 n) mapId2 zero = refl mapId2 (suc zero) = funExt (trElim (λ x → isOfHLevelPath 3 (isOfHLevelTrunc 4 ∣ north ∣ ∣ north ∣) _ _) λ a → refl) mapId2 (suc (suc n)) = funExt (trElim (λ x → isOfHLevelPath (4 + n) (isOfHLevelTrunc (5 + n) ∣ north ∣ ∣ north ∣) _ _) λ a → refl) -- Experiments with abstract definitions Iso2-Kn-ΩKn+1 : (n : ℕ) → Iso (coHomK n) (typ (Ω (coHomK-ptd (suc n)))) Iso.fun (Iso2-Kn-ΩKn+1 n) = Kn→ΩKn+1 n Iso.inv (Iso2-Kn-ΩKn+1 n) = Iso.inv (Iso-Kn-ΩKn+1 n) Iso.rightInv (Iso2-Kn-ΩKn+1 n) a = rinv where abstract rinv : Kn→ΩKn+1 n (Iso.inv (Iso-Kn-ΩKn+1 n) a) ≡ a rinv = funExt⁻ (mapId2 n) _ ∙ Iso.rightInv (Iso-Kn-ΩKn+1 n) a Iso.leftInv (Iso2-Kn-ΩKn+1 n) a = linv where abstract linv : Iso.inv (Iso-Kn-ΩKn+1 n) (Kn→ΩKn+1 n a) ≡ a linv = cong (Iso.inv (Iso-Kn-ΩKn+1 n)) (funExt⁻ (mapId2 n) a) ∙ Iso.leftInv (Iso-Kn-ΩKn+1 n) a --- even more abstract abstract absInv' : (n : ℕ) → typ (Ω (coHomK-ptd (2 + n))) → coHomK (1 + n) absInv' n = Iso.inv (Iso-Kn-ΩKn+1 (1 + n)) absSect' : (n : ℕ) (a : typ (Ω (coHomK-ptd (2 + n)))) → Kn→ΩKn+1 (1 + n) (absInv' n a) ≡ a absSect' n a = funExt⁻ (mapId2 (1 + n)) _ ∙ Iso.rightInv (Iso-Kn-ΩKn+1 (1 + n)) a absRetr' : (n : ℕ) (a : coHomK (1 + n)) → absInv' n (Kn→ΩKn+1 (1 + n) a) ≡ a absRetr' n a = cong (Iso.inv (Iso-Kn-ΩKn+1 (1 + n))) (funExt⁻ (mapId2 (1 + n)) a) ∙ Iso.leftInv (Iso-Kn-ΩKn+1 (1 + n)) a absInv : (n : ℕ) → typ (Ω (coHomK-ptd (1 + n))) → coHomK n absInv zero = Iso.inv (Iso-Kn-ΩKn+1 zero) absInv (suc n) = absInv' n absSect : (n : ℕ) → section (Kn→ΩKn+1 n) (absInv n) absSect zero a = funExt⁻ (mapId2 zero) (Iso.inv isolooper2 (Iso.inv (congIso (truncIdempotentIso _ isOfHLevelS1)) a)) ∙ Iso.rightInv (Iso-Kn-ΩKn+1 zero) a absSect (suc n) = absSect' n absRetr : (n : ℕ) → retract (Kn→ΩKn+1 n) (absInv n) absRetr zero a = cong (Iso.inv (Iso-Kn-ΩKn+1 zero)) (funExt⁻ (mapId2 zero) a) ∙ Iso.leftInv (Iso-Kn-ΩKn+1 zero) a absRetr (suc n) = absRetr' n Iso3-Kn-ΩKn+1 : (n : ℕ) → Iso (coHomK n) (typ (Ω (coHomK-ptd (suc n)))) Iso.fun (Iso3-Kn-ΩKn+1 n) = Kn→ΩKn+1 n Iso.inv (Iso3-Kn-ΩKn+1 n) = absInv n Iso.rightInv (Iso3-Kn-ΩKn+1 n) = absSect n Iso.leftInv (Iso3-Kn-ΩKn+1 n) = absRetr n
src/macosx.asm
ronaaron/reva
9
179890
<filename>src/macosx.asm ; vim: ft=nasm %define EOF 4 %define FUNCALIGN align 16 %define ALTSIZE 16000 %define SEEK_SET 0 %define SEEK_CUR 1 %define SEEK_END 2 %define SIG_ERR -1 %define SIG_DFL 0 %define SIG_IGN 1 %define SIG_HOLD 5 %define SIGHUP 1 %define SIGINT 2 %define SIGQUIT 3 %define SIGILL 4 %define SIGTRAP 5 %define SIGABRT 6 %define SIGEMT 7 %define SIGFPE 8 %define SIGKILL 9 %define SIGBUS 10 %define SIGSEGV 11 %define SIGSYS 12 %define SIGPIPE 13 %define SIGALRM 14 %define SIGTERM 15 %define O_RDONLY 0 %define O_WRONLY 1 %define O_RDWR 2 SA_SIGINFO equ 0x0040 ; use sa_sigaction instead of sa_handler SA_RESTART equ 0x0002 ; restart system calls which were interrupted struc sigaction ; sact, m, f { action resd 1 ; sact ; void (*sa_sigaction)(int,siginfo*, void *) mask resd 1 ; m ; sigset_t mask; flags resd 1 ; f ; int flags endstruc struc sigaltstack ss_sp resd 1 ss_size resd 1 ss_flags resd 1 endstruc struc siginfo si_signo resd 1 si_errno resd 1 si_code resd 1 si_pid resd 1 si_uid resd 1 si_status resd 1 si_addr resd 1 ;; fault address ; etc value, band, pad[7] endstruc struc sigcontext sc_pad resd 3 sc_eax resd 1 sc_ebx resd 1 sc_ecx resd 1 sc_edx resd 1 sc_edi resd 1 sc_esi resd 1 sc_ebp resd 1 sc_esp resd 1 sc_ss resd 1 sc_flags resd 1 sc_eip resd 1 sc_cs resd 1 sc_ds resd 1 sc_es resd 1 sc_fs resd 1 sc_gs resd 1 endstruc struc stat_t .dev: resd 1 ; + 0 .inode: resd 1 ; +12 .mode: resd 1 ; +16 .nlink: resd 1 ; +20 .uid: resd 1 ; +24 .gid: resd 1 ; +28 .rdev: resd 2 ; +32 .times: resd 3 ; +40 pad sb_size resd 1 ; +44 .hsize: resd 1 ; +48 .blksize: resd 1 ; +52 .blocks: resd 1 ; +56 .atime: resd 1 ; +60 .mtime: resd 1 ; +64 .ctime: resd 1 ; +68 .shimon: resd 6 ; -- +100 endstruc %define CODESECTION SECTION .text align=16 %define DATASECTION SECTION .text %define BSSSECTION SECTION .bss CODESECTION EXTERN _exit EXTERN _dlopen EXTERN _dlclose EXTERN _dlsym EXTERN _malloc EXTERN _free EXTERN _realloc EXTERN _open EXTERN _close EXTERN _creat EXTERN _read EXTERN _write EXTERN _fstat EXTERN _chmod EXTERN _getpid EXTERN _sigaction EXTERN _mprotect EXTERN _realpath EXTERN __NSGetExecutablePath os_start: ccall _mprotect, os_start, (data_end-os_start), 7 push eax call .me .me: pop eax neg eax mov dword [codeoff], eax pop eax ; upsh 'X' ; call os_emit mov dword [StdOut], 1 mov dword [StdIn], 0 ; save argc, argv mov eax, [esp+4] mov [argc], eax mov eax, [esp+8] mov [argv], eax mov eax, [argc] ; mov eax, [esp+4*eax+12] ; mov [environ], eax ; Now, let's get the pid ccall _getpid ; mov eax, osx_getpid ; int 80h mov [ourpid], eax ; use NSGetExecutablePath to find our name... mov dword [temp_temp], 256 ccall __NSGetExecutablePath , app_file_name, temp_temp xor eax, eax jnz .argv mov eax, dword [temp_temp] lea eax, [eax + app_file_name] mov byte [eax], 0 ; try to resolve a link: ccall _realpath, app_file_name, resolve_link cmp eax, 0 je .readlinkok ; resolve_link, eax is real file name: copy it over call _ztc push eax mov ecx, eax mov edi, app_file_name mov edx, resolve_link call _move.a pop eax lea eax, [eax + app_file_name] mov byte [eax], 0 jmp .readlinkok ; Assume 'argv[0]' has the correct value (woe to us if it doesn't!) .argv: upsh [argv] call _ztc inc eax ; include NUL upsh app_file_name swap call _move .readlinkok: mov ecx, 15 .again: push ecx cmp ecx, SIGINT je .int ccall _sigaction, ecx, new_act, 0 jmp .next .int: ccall _sigaction, ecx, sig_act, 0 .next: pop ecx loop .again ret FUNCALIGN reva_int_handler: pusha push ebp mov ebp, esp sub esp, 8 mov esi, esp sub esp, 40 DEFERCALL ctrlc_handler mov esp, ebp pop ebp popa ret FUNCALIGN reva_sig_handler: push ebp mov ebp, esp pusha mov ebx, [ebp+16] ; ucontext mov ecx, [ebp+8] ; exception mov esi, _s1 lea ebx, [ebx+28] mov ebx, [ebx] ; upsh ebx ; call exception ; call os_bye upsh dword 0 upsh [ebx+sc_edi] ; edi upsh [ebx+sc_esi] ; esi upsh [ebx+sc_ebx] ; ebx upsh [ebx+sc_edx] ; edx upsh [ebx+sc_ecx] ; ecx upsh [ebx+sc_eax] ; eax upsh [ebx+sc_ebp] ; ebp upsh [ebx+sc_esp] ; esp upsh [ebx+sc_eip] ; eip upsh ecx ; exception ;mov [ebx+sc_eax], eax ; exception -> EAX ;mov eax, exception ;mov [ebx+sc_eip], eax ;mov [ebx+sc_esi], esi ; eip ;mov eax, [_rp0] ;mov [ebx+sc_esp], eax ; return stack mov [ebx+sc_eax], eax ; exception -> EAX mov [ebx+sc_esi], esi ; data stack mov eax, [_rp0] mov [ebx+sc_esp], eax ; return stack mov [ebx+sc_eip], dword trampoline ; EIP popa mov esp, ebp pop ebp ret FUNCALIGN os_type: upop ecx ; jecxz .done ccall _write, 1, eax, ecx .done: drop ret FUNCALIGN os_emit: mov [emit_buf], eax ccall _write, 1, emit_buf, 1 .done: drop ret FUNCALIGN os_key: dup mov [emit_buf], dword 0 ccall _read, 0, emit_buf, 1 dec eax mov eax, [emit_buf] jnz .bad ret .bad: mov eax,-1 ret FUNCALIGN os_bye: ccall _exit, eax PROC os_syscall upsh -1 jmp throw ENDP os_syscall ; syscall interface ends here ;--------------------------------------------------------------------- ; ANS FILE ACCESS WORDS ;--------------------------------------------------------------------- PROC openrw ;( a n -- filied ) mov ecx, O_RDWR jmp io_open ENDP openrw PROC openr ; ( a n -- fileid ) mov ecx, O_RDONLY ; fall through ; sys_open(filename, flags, mode) --> handle ; ( c-addr u fam -- fileid ior ) \ s" file.txt" r/o open-file ; upop ecx ; flags O_RDONLY etc. io_open: push ecx call _fzt pop ecx ; mov ebx, eax ; filename ; mov edx, 666o ; xor edx, edx ; mode ; mov eax, osx_open ; macos osx_open, eax, ecx ccall _open, eax, ecx ;call_linux: ; linux osx_return: ; convert value in EAX into 'ior' mov ebx, eax osx_return2: ; convert value in EBX into 'ior' ; ebx<0 --> 1 else 0 test ebx, ebx js .end xor ebx, ebx jmp .end .end: mov dword [__ior], ebx test ebx, ebx ; jnz is error ret ENDP openr ; ( fileid -- ) PROC io_close ; mov ebx, eax ;mov eax, osx_close ;macos osx_close, eax ccall _close, eax ;call_osx2: ; convert value in EAX into 'ior' ; linux upop ebx jmp osx_return2 ENDP io_close ; ( c-addr u -- fileid ior ) \ s" file.txt" r/w create-file PROC io_create call _fzt ; mov ebx, eax ; filename ; mov ecx, 666o ; mov edx, 1000o ; mov eax, osx_creat ; macos osx_creat, eax, 666o, 1000o ccall _creat, eax, 666o, 1000o jmp osx_return ; jmp call_linux ENDP io_create ; ( c-addr u1 fileid -- n ) pad 10 file_desc @ read-file ; sys_read(fd, buf, count) PROC io_read mov edx, eax ; fileid drop mov ecx, eax ; count drop ; mov ebx, eax ; addr ; macos osx_read, edx, ecx, eax ccall _read, edx, eax, ecx jmp osx_return ENDP io_read ; ( c-addr u fileid -- ior ) pad 10 file_desc @ write-file PROC io_write mov edx, eax ;fileid drop mov ecx,eax ; count drop ; mov ebx ,eax ; count ; macos osx_write, edx, ecx, eax ccall _write, edx, eax ,ecx upop ebx ; mov eax, osx_write jmp osx_return2 ENDP io_write ; ( fileid -- ud ) ; fstat64(fd, fstat64) PROC io_size ; dup ; mov ebx, eax ; mov ecx, stat_buf ; mov eax, osx_fstat64 ; macos osx_fstat64, ebx, stat_buf ccall _fstat, eax, stat_buf ; linux mov ebx, stat_buf mov eax, dword [stat_buf + 48] ; mov [esi], eax ; mov eax, dword [stat_buf.hsize] ret ENDP io_size ;--------------------------------------------------------------------- ; ANS MEMORY ALLOCATION WORDS ;--------------------------------------------------------------------- ; For now I will use the libc routines. PROC mem_alloc or eax ,eax jz .0 ; push eax ; call malloc ccall _malloc,eax ; add esp, 4 .0: mov ebx, eax sub ebx, ebx sbb ebx, 0 mov dword [__ior], ebx ;u ;upsh 0 ;cmp ebx, 0 ;jnz .1 ; inc eax ;.1: upop [__ior] ret ENDP mem_alloc ; ( a-addr -- ) PROC mem_free or eax ,eax jz .0 ; push eax ; call free ; add esp, 4 ccall _free,eax xor eax, eax .0: upop dword [__ior] ret ENDP mem_free ; ( a-addr u -- a-addr2 ) PROC mem_realloc mov ebx ,eax drop ccall _realloc, eax, ebx ;push eax ;drop ;push eax ;call realloc ;add esp, 8 jmp mem_alloc.0 ENDP mem_realloc ; ( s n <name> -- ) PROC _loadlib call _fzt ; load the library: ; push 1 | 0x9 ; RTLD_LAZY | RTLD_GLOBAL ; push eax ; library name ; call dlopen ; add esp, 8 ccall _dlopen, eax, (1 | 8) ret ENDP _loadlib PROC _unloadlib test eax, eax jz .done ccall _dlclose, eax ; push eax ; library handle ; call dlclose ; add esp, 4 .done: drop ret ENDP _unloadlib ; ( s n lib -- handle ) PROC _osfunc upop ebx ; EBX is handle lodsd ; drop count, EAX is function name ccall _dlsym, ebx, eax ret ENDP _osfunc _makeexe: ccall _chmod, eax, 0755o drop ret DATASECTION codeoff dd 0 sig_act: istruc sigaction ;reva_sig_handler, 0, SA_SIGINFO at action, dd reva_int_handler at mask, dd 0 at flags, dd SA_SIGINFO ;| SA_RESTART iend new_act: istruc sigaction ;reva_sig_handler, 0, SA_SIGINFO at action, dd reva_sig_handler at mask, dd 0 at flags, dd SA_SIGINFO ;| SA_RESTART ; at restorer, dd 0 iend stat_buf: istruc stat_t iend saltstack: istruc sigaltstack at ss_sp, dd altstack at ss_size, dd ALTSIZE at ss_flags, dd 0 iend BSSSECTION ourpid resd 1 temp_temp resd 1 emit_buf resd 1 saveesp resd 1 altstack resb ALTSIZE resolve_link resb 256 bss_start:
getChildrenTest.asm
via007/learnos-xv6
1
243410
<reponame>via007/learnos-xv6 _getChildrenTest： 文件格式 elf32-i386 Disassembly of section .text: 00000000 <main>: #include "types.h" #include "stat.h" #include "user.h" int main(void) { 0: 8d 4c 24 04 lea 0x4(%esp),%ecx 4: 83 e4 f0 and $0xfffffff0,%esp 7: ff 71 fc pushl -0x4(%ecx) a: 55 push %ebp b: 89 e5 mov %esp,%ebp d: 57 push %edi e: 56 push %esi f: 8d 75 a8 lea -0x58(%ebp),%esi 12: 8d 7d e8 lea -0x18(%ebp),%edi 15: 53 push %ebx int runningProcessPID=getRunningProcessPID();//getRunningProcessPID is a system call which returns the PID of the running process . 16: 89 f3 mov %esi,%ebx { 18: 51 push %ecx 19: 83 ec 58 sub $0x58,%esp int runningProcessPID=getRunningProcessPID();//getRunningProcessPID is a system call which returns the PID of the running process . 1c: e8 90 03 00 00 call 3b1 <getRunningProcessPID> 21: 89 45 a4 mov %eax,-0x5c(%ebp) int PIDs[16]; for(int i=0;(i<16) && getRunningProcessPID()==runningProcessPID;++i) 24: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 28: e8 84 03 00 00 call 3b1 <getRunningProcessPID> 2d: 3b 45 a4 cmp -0x5c(%ebp),%eax 30: 75 0f jne 41 <main+0x41> { PIDs[i]=fork(); 32: e8 c2 02 00 00 call 2f9 <fork> 37: 83 c3 04 add $0x4,%ebx 3a: 89 43 fc mov %eax,-0x4(%ebx) for(int i=0;(i<16) && getRunningProcessPID()==runningProcessPID;++i) 3d: 39 fb cmp %edi,%ebx 3f: 75 e7 jne 28 <main+0x28> } if(getRunningProcessPID()==runningProcessPID) 41: e8 6b 03 00 00 call 3b1 <getRunningProcessPID> 46: 3b 45 a4 cmp -0x5c(%ebp),%eax 49: 74 0e je 59 <main+0x59> } 4b: 8d 65 f0 lea -0x10(%ebp),%esp 4e: 31 c0 xor %eax,%eax 50: 59 pop %ecx 51: 5b pop %ebx 52: 5e pop %esi 53: 5f pop %edi 54: 5d pop %ebp 55: 8d 61 fc lea -0x4(%ecx),%esp 58: c3 ret printf(1,"===============================================================\nThe getChildren function result is:\n"); 59: 52 push %edx 5a: 52 push %edx 5b: 68 08 08 00 00 push $0x808 60: 6a 01 push $0x1 62: e8 39 04 00 00 call 4a0 <printf> getChildren(); 67: e8 3d 03 00 00 call 3a9 <getChildren> printf(1,"The main result is:\n"); 6c: 59 pop %ecx 6d: 5b pop %ebx 6e: 68 b4 08 00 00 push $0x8b4 73: 6a 01 push $0x1 75: e8 26 04 00 00 call 4a0 <printf> 7a: 83 c4 10 add $0x10,%esp 7d: 8d 76 00 lea 0x0(%esi),%esi printf(1,"%d\n",PIDs[i]); 80: 83 ec 04 sub $0x4,%esp 83: ff 36 pushl (%esi) 85: 83 c6 04 add $0x4,%esi 88: 68 c9 08 00 00 push $0x8c9 8d: 6a 01 push $0x1 8f: e8 0c 04 00 00 call 4a0 <printf> for(int i=0;i<16;++i) 94: 83 c4 10 add $0x10,%esp 97: 39 fe cmp %edi,%esi 99: 75 e5 jne 80 <main+0x80> printf(1,"===============================================================\n"); 9b: 50 push %eax 9c: 50 push %eax 9d: 68 70 08 00 00 push $0x870 a2: 6a 01 push $0x1 a4: e8 f7 03 00 00 call 4a0 <printf> a9: 83 c4 10 add $0x10,%esp ac: eb 9d jmp 4b <main+0x4b> ae: 66 90 xchg %ax,%ax 000000b0 <strcpy>: #include "user.h" #include "x86.h" char* strcpy(char *s, const char *t) { b0: 55 push %ebp char *os; os = s; while((*s++ = *t++) != 0) b1: 31 d2 xor %edx,%edx { b3: 89 e5 mov %esp,%ebp b5: 53 push %ebx b6: 8b 45 08 mov 0x8(%ebp),%eax b9: 8b 5d 0c mov 0xc(%ebp),%ebx bc: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi while((*s++ = *t++) != 0) c0: 0f b6 0c 13 movzbl (%ebx,%edx,1),%ecx c4: 88 0c 10 mov %cl,(%eax,%edx,1) c7: 83 c2 01 add $0x1,%edx ca: 84 c9 test %cl,%cl cc: 75 f2 jne c0 <strcpy+0x10> ; return os; } ce: 5b pop %ebx cf: 5d pop %ebp d0: c3 ret d1: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi d8: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi df: 90 nop 000000e0 <strcmp>: int strcmp(const char *p, const char *q) { e0: 55 push %ebp e1: 89 e5 mov %esp,%ebp e3: 56 push %esi e4: 53 push %ebx e5: 8b 5d 08 mov 0x8(%ebp),%ebx e8: 8b 75 0c mov 0xc(%ebp),%esi while(*p && *p == *q) eb: 0f b6 13 movzbl (%ebx),%edx ee: 0f b6 0e movzbl (%esi),%ecx f1: 84 d2 test %dl,%dl f3: 74 1e je 113 <strcmp+0x33> f5: b8 01 00 00 00 mov $0x1,%eax fa: 38 ca cmp %cl,%dl fc: 74 09 je 107 <strcmp+0x27> fe: eb 20 jmp 120 <strcmp+0x40> 100: 83 c0 01 add $0x1,%eax 103: 38 ca cmp %cl,%dl 105: 75 19 jne 120 <strcmp+0x40> 107: 0f b6 14 03 movzbl (%ebx,%eax,1),%edx 10b: 0f b6 0c 06 movzbl (%esi,%eax,1),%ecx 10f: 84 d2 test %dl,%dl 111: 75 ed jne 100 <strcmp+0x20> 113: 31 c0 xor %eax,%eax p++, q++; return (uchar)*p - (uchar)*q; } 115: 5b pop %ebx 116: 5e pop %esi return (uchar)*p - (uchar)*q; 117: 29 c8 sub %ecx,%eax } 119: 5d pop %ebp 11a: c3 ret 11b: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 11f: 90 nop 120: 0f b6 c2 movzbl %dl,%eax 123: 5b pop %ebx 124: 5e pop %esi return (uchar)*p - (uchar)*q; 125: 29 c8 sub %ecx,%eax } 127: 5d pop %ebp 128: c3 ret 129: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 00000130 <strlen>: uint strlen(const char *s) { 130: 55 push %ebp 131: 89 e5 mov %esp,%ebp 133: 8b 4d 08 mov 0x8(%ebp),%ecx int n; for(n = 0; s[n]; n++) 136: 80 39 00 cmpb $0x0,(%ecx) 139: 74 15 je 150 <strlen+0x20> 13b: 31 d2 xor %edx,%edx 13d: 8d 76 00 lea 0x0(%esi),%esi 140: 83 c2 01 add $0x1,%edx 143: 80 3c 11 00 cmpb $0x0,(%ecx,%edx,1) 147: 89 d0 mov %edx,%eax 149: 75 f5 jne 140 <strlen+0x10> ; return n; } 14b: 5d pop %ebp 14c: c3 ret 14d: 8d 76 00 lea 0x0(%esi),%esi for(n = 0; s[n]; n++) 150: 31 c0 xor %eax,%eax } 152: 5d pop %ebp 153: c3 ret 154: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 15b: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 15f: 90 nop 00000160 <memset>: void* memset(void *dst, int c, uint n) { 160: 55 push %ebp 161: 89 e5 mov %esp,%ebp 163: 57 push %edi 164: 8b 55 08 mov 0x8(%ebp),%edx } static inline void stosb(void *addr, int data, int cnt) { asm volatile("cld; rep stosb" : 167: 8b 4d 10 mov 0x10(%ebp),%ecx 16a: 8b 45 0c mov 0xc(%ebp),%eax 16d: 89 d7 mov %edx,%edi 16f: fc cld 170: f3 aa rep stos %al,%es:(%edi) stosb(dst, c, n); return dst; } 172: 89 d0 mov %edx,%eax 174: 5f pop %edi 175: 5d pop %ebp 176: c3 ret 177: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 17e: 66 90 xchg %ax,%ax 00000180 <strchr>: char* strchr(const char *s, char c) { 180: 55 push %ebp 181: 89 e5 mov %esp,%ebp 183: 53 push %ebx 184: 8b 45 08 mov 0x8(%ebp),%eax 187: 8b 55 0c mov 0xc(%ebp),%edx for(; *s; s++) 18a: 0f b6 18 movzbl (%eax),%ebx 18d: 84 db test %bl,%bl 18f: 74 1d je 1ae <strchr+0x2e> 191: 89 d1 mov %edx,%ecx if(*s == c) 193: 38 d3 cmp %dl,%bl 195: 75 0d jne 1a4 <strchr+0x24> 197: eb 17 jmp 1b0 <strchr+0x30> 199: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 1a0: 38 ca cmp %cl,%dl 1a2: 74 0c je 1b0 <strchr+0x30> for(; *s; s++) 1a4: 83 c0 01 add $0x1,%eax 1a7: 0f b6 10 movzbl (%eax),%edx 1aa: 84 d2 test %dl,%dl 1ac: 75 f2 jne 1a0 <strchr+0x20> return (char*)s; return 0; 1ae: 31 c0 xor %eax,%eax } 1b0: 5b pop %ebx 1b1: 5d pop %ebp 1b2: c3 ret 1b3: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 1ba: 8d b6 00 00 00 00 lea 0x0(%esi),%esi 000001c0 <gets>: char* gets(char *buf, int max) { 1c0: 55 push %ebp 1c1: 89 e5 mov %esp,%ebp 1c3: 57 push %edi 1c4: 56 push %esi int i, cc; char c; for(i=0; i+1 < max; ){ 1c5: 31 f6 xor %esi,%esi { 1c7: 53 push %ebx 1c8: 89 f3 mov %esi,%ebx 1ca: 83 ec 1c sub $0x1c,%esp 1cd: 8b 7d 08 mov 0x8(%ebp),%edi for(i=0; i+1 < max; ){ 1d0: eb 2f jmp 201 <gets+0x41> 1d2: 8d b6 00 00 00 00 lea 0x0(%esi),%esi cc = read(0, &c, 1); 1d8: 83 ec 04 sub $0x4,%esp 1db: 8d 45 e7 lea -0x19(%ebp),%eax 1de: 6a 01 push $0x1 1e0: 50 push %eax 1e1: 6a 00 push $0x0 1e3: e8 31 01 00 00 call 319 <read> if(cc < 1) 1e8: 83 c4 10 add $0x10,%esp 1eb: 85 c0 test %eax,%eax 1ed: 7e 1c jle 20b <gets+0x4b> break; buf[i++] = c; 1ef: 0f b6 45 e7 movzbl -0x19(%ebp),%eax 1f3: 83 c7 01 add $0x1,%edi 1f6: 88 47 ff mov %al,-0x1(%edi) if(c == '\n' || c == '\r') 1f9: 3c 0a cmp $0xa,%al 1fb: 74 23 je 220 <gets+0x60> 1fd: 3c 0d cmp $0xd,%al 1ff: 74 1f je 220 <gets+0x60> for(i=0; i+1 < max; ){ 201: 83 c3 01 add $0x1,%ebx 204: 89 fe mov %edi,%esi 206: 3b 5d 0c cmp 0xc(%ebp),%ebx 209: 7c cd jl 1d8 <gets+0x18> 20b: 89 f3 mov %esi,%ebx break; } buf[i] = '\0'; return buf; } 20d: 8b 45 08 mov 0x8(%ebp),%eax buf[i] = '\0'; 210: c6 03 00 movb $0x0,(%ebx) } 213: 8d 65 f4 lea -0xc(%ebp),%esp 216: 5b pop %ebx 217: 5e pop %esi 218: 5f pop %edi 219: 5d pop %ebp 21a: c3 ret 21b: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 21f: 90 nop 220: 8b 75 08 mov 0x8(%ebp),%esi 223: 8b 45 08 mov 0x8(%ebp),%eax 226: 01 de add %ebx,%esi 228: 89 f3 mov %esi,%ebx buf[i] = '\0'; 22a: c6 03 00 movb $0x0,(%ebx) } 22d: 8d 65 f4 lea -0xc(%ebp),%esp 230: 5b pop %ebx 231: 5e pop %esi 232: 5f pop %edi 233: 5d pop %ebp 234: c3 ret 235: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 23c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 00000240 <stat>: int stat(const char *n, struct stat *st) { 240: 55 push %ebp 241: 89 e5 mov %esp,%ebp 243: 56 push %esi 244: 53 push %ebx int fd; int r; fd = open(n, O_RDONLY); 245: 83 ec 08 sub $0x8,%esp 248: 6a 00 push $0x0 24a: ff 75 08 pushl 0x8(%ebp) 24d: e8 ef 00 00 00 call 341 <open> if(fd < 0) 252: 83 c4 10 add $0x10,%esp 255: 85 c0 test %eax,%eax 257: 78 27 js 280 <stat+0x40> return -1; r = fstat(fd, st); 259: 83 ec 08 sub $0x8,%esp 25c: ff 75 0c pushl 0xc(%ebp) 25f: 89 c3 mov %eax,%ebx 261: 50 push %eax 262: e8 f2 00 00 00 call 359 <fstat> close(fd); 267: 89 1c 24 mov %ebx,(%esp) r = fstat(fd, st); 26a: 89 c6 mov %eax,%esi close(fd); 26c: e8 b8 00 00 00 call 329 <close> return r; 271: 83 c4 10 add $0x10,%esp } 274: 8d 65 f8 lea -0x8(%ebp),%esp 277: 89 f0 mov %esi,%eax 279: 5b pop %ebx 27a: 5e pop %esi 27b: 5d pop %ebp 27c: c3 ret 27d: 8d 76 00 lea 0x0(%esi),%esi return -1; 280: be ff ff ff ff mov $0xffffffff,%esi 285: eb ed jmp 274 <stat+0x34> 287: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 28e: 66 90 xchg %ax,%ax 00000290 <atoi>: int atoi(const char *s) { 290: 55 push %ebp 291: 89 e5 mov %esp,%ebp 293: 53 push %ebx 294: 8b 4d 08 mov 0x8(%ebp),%ecx int n; n = 0; while('0' <= *s && *s <= '9') 297: 0f be 11 movsbl (%ecx),%edx 29a: 8d 42 d0 lea -0x30(%edx),%eax 29d: 3c 09 cmp $0x9,%al n = 0; 29f: b8 00 00 00 00 mov $0x0,%eax while('0' <= *s && *s <= '9') 2a4: 77 1f ja 2c5 <atoi+0x35> 2a6: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 2ad: 8d 76 00 lea 0x0(%esi),%esi n = n*10 + *s++ - '0'; 2b0: 83 c1 01 add $0x1,%ecx 2b3: 8d 04 80 lea (%eax,%eax,4),%eax 2b6: 8d 44 42 d0 lea -0x30(%edx,%eax,2),%eax while('0' <= *s && *s <= '9') 2ba: 0f be 11 movsbl (%ecx),%edx 2bd: 8d 5a d0 lea -0x30(%edx),%ebx 2c0: 80 fb 09 cmp $0x9,%bl 2c3: 76 eb jbe 2b0 <atoi+0x20> return n; } 2c5: 5b pop %ebx 2c6: 5d pop %ebp 2c7: c3 ret 2c8: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 2cf: 90 nop 000002d0 <memmove>: void* memmove(void *vdst, const void *vsrc, int n) { 2d0: 55 push %ebp 2d1: 89 e5 mov %esp,%ebp 2d3: 57 push %edi 2d4: 8b 55 10 mov 0x10(%ebp),%edx 2d7: 8b 45 08 mov 0x8(%ebp),%eax 2da: 56 push %esi 2db: 8b 75 0c mov 0xc(%ebp),%esi char *dst; const char *src; dst = vdst; src = vsrc; while(n-- > 0) 2de: 85 d2 test %edx,%edx 2e0: 7e 13 jle 2f5 <memmove+0x25> 2e2: 01 c2 add %eax,%edx dst = vdst; 2e4: 89 c7 mov %eax,%edi 2e6: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 2ed: 8d 76 00 lea 0x0(%esi),%esi *dst++ = *src++; 2f0: a4 movsb %ds:(%esi),%es:(%edi) while(n-- > 0) 2f1: 39 fa cmp %edi,%edx 2f3: 75 fb jne 2f0 <memmove+0x20> return vdst; } 2f5: 5e pop %esi 2f6: 5f pop %edi 2f7: 5d pop %ebp 2f8: c3 ret 000002f9 <fork>: name: \ movl $SYS_ ## name, %eax; \ int $T_SYSCALL; \ ret SYSCALL(fork) 2f9: b8 01 00 00 00 mov $0x1,%eax 2fe: cd 40 int $0x40 300: c3 ret 00000301 <exit>: SYSCALL(exit) 301: b8 02 00 00 00 mov $0x2,%eax 306: cd 40 int $0x40 308: c3 ret 00000309 <wait>: SYSCALL(wait) 309: b8 03 00 00 00 mov $0x3,%eax 30e: cd 40 int $0x40 310: c3 ret 00000311 <pipe>: SYSCALL(pipe) 311: b8 04 00 00 00 mov $0x4,%eax 316: cd 40 int $0x40 318: c3 ret 00000319 <read>: SYSCALL(read) 319: b8 05 00 00 00 mov $0x5,%eax 31e: cd 40 int $0x40 320: c3 ret 00000321 <write>: SYSCALL(write) 321: b8 10 00 00 00 mov $0x10,%eax 326: cd 40 int $0x40 328: c3 ret 00000329 <close>: SYSCALL(close) 329: b8 15 00 00 00 mov $0x15,%eax 32e: cd 40 int $0x40 330: c3 ret 00000331 <kill>: SYSCALL(kill) 331: b8 06 00 00 00 mov $0x6,%eax 336: cd 40 int $0x40 338: c3 ret 00000339 <exec>: SYSCALL(exec) 339: b8 07 00 00 00 mov $0x7,%eax 33e: cd 40 int $0x40 340: c3 ret 00000341 <open>: SYSCALL(open) 341: b8 0f 00 00 00 mov $0xf,%eax 346: cd 40 int $0x40 348: c3 ret 00000349 <mknod>: SYSCALL(mknod) 349: b8 11 00 00 00 mov $0x11,%eax 34e: cd 40 int $0x40 350: c3 ret 00000351 <unlink>: SYSCALL(unlink) 351: b8 12 00 00 00 mov $0x12,%eax 356: cd 40 int $0x40 358: c3 ret 00000359 <fstat>: SYSCALL(fstat) 359: b8 08 00 00 00 mov $0x8,%eax 35e: cd 40 int $0x40 360: c3 ret 00000361 <link>: SYSCALL(link) 361: b8 13 00 00 00 mov $0x13,%eax 366: cd 40 int $0x40 368: c3 ret 00000369 <mkdir>: SYSCALL(mkdir) 369: b8 14 00 00 00 mov $0x14,%eax 36e: cd 40 int $0x40 370: c3 ret 00000371 <chdir>: SYSCALL(chdir) 371: b8 09 00 00 00 mov $0x9,%eax 376: cd 40 int $0x40 378: c3 ret 00000379 <dup>: SYSCALL(dup) 379: b8 0a 00 00 00 mov $0xa,%eax 37e: cd 40 int $0x40 380: c3 ret 00000381 <getpid>: SYSCALL(getpid) 381: b8 0b 00 00 00 mov $0xb,%eax 386: cd 40 int $0x40 388: c3 ret 00000389 <sbrk>: SYSCALL(sbrk) 389: b8 0c 00 00 00 mov $0xc,%eax 38e: cd 40 int $0x40 390: c3 ret 00000391 <sleep>: SYSCALL(sleep) 391: b8 0d 00 00 00 mov $0xd,%eax 396: cd 40 int $0x40 398: c3 ret 00000399 <uptime>: SYSCALL(uptime) 399: b8 0e 00 00 00 mov $0xe,%eax 39e: cd 40 int $0x40 3a0: c3 ret 000003a1 <printingMyFavoriteYear>: SYSCALL(printingMyFavoriteYear) 3a1: b8 16 00 00 00 mov $0x16,%eax 3a6: cd 40 int $0x40 3a8: c3 ret 000003a9 <getChildren>: SYSCALL(getChildren) 3a9: b8 17 00 00 00 mov $0x17,%eax 3ae: cd 40 int $0x40 3b0: c3 ret 000003b1 <getRunningProcessPID>: SYSCALL(getRunningProcessPID) 3b1: b8 18 00 00 00 mov $0x18,%eax 3b6: cd 40 int $0x40 3b8: c3 ret 000003b9 <changePolicy>: SYSCALL(changePolicy) 3b9: b8 19 00 00 00 mov $0x19,%eax 3be: cd 40 int $0x40 3c0: c3 ret 000003c1 <Quantum_Increaser>: SYSCALL(Quantum_Increaser) 3c1: b8 1a 00 00 00 mov $0x1a,%eax 3c6: cd 40 int $0x40 3c8: c3 ret 000003c9 <Quantum_Decreaser>: SYSCALL(Quantum_Decreaser) 3c9: b8 1b 00 00 00 mov $0x1b,%eax 3ce: cd 40 int $0x40 3d0: c3 ret 3d1: 66 90 xchg %ax,%ax 3d3: 66 90 xchg %ax,%ax 3d5: 66 90 xchg %ax,%ax 3d7: 66 90 xchg %ax,%ax 3d9: 66 90 xchg %ax,%ax 3db: 66 90 xchg %ax,%ax 3dd: 66 90 xchg %ax,%ax 3df: 90 nop 000003e0 <printint>: write(fd, &c, 1); } static void printint(int fd, int xx, int base, int sgn) { 3e0: 55 push %ebp 3e1: 89 e5 mov %esp,%ebp 3e3: 57 push %edi 3e4: 56 push %esi 3e5: 53 push %ebx uint x; neg = 0; if(sgn && xx < 0){ neg = 1; x = -xx; 3e6: 89 d3 mov %edx,%ebx { 3e8: 83 ec 3c sub $0x3c,%esp 3eb: 89 45 bc mov %eax,-0x44(%ebp) if(sgn && xx < 0){ 3ee: 85 d2 test %edx,%edx 3f0: 0f 89 92 00 00 00 jns 488 <printint+0xa8> 3f6: f6 45 08 01 testb $0x1,0x8(%ebp) 3fa: 0f 84 88 00 00 00 je 488 <printint+0xa8> neg = 1; 400: c7 45 c0 01 00 00 00 movl $0x1,-0x40(%ebp) x = -xx; 407: f7 db neg %ebx } else { x = xx; } i = 0; 409: c7 45 c4 00 00 00 00 movl $0x0,-0x3c(%ebp) 410: 8d 75 d7 lea -0x29(%ebp),%esi 413: eb 08 jmp 41d <printint+0x3d> 415: 8d 76 00 lea 0x0(%esi),%esi do{ buf[i++] = digits[x % base]; 418: 89 7d c4 mov %edi,-0x3c(%ebp) }while((x /= base) != 0); 41b: 89 c3 mov %eax,%ebx buf[i++] = digits[x % base]; 41d: 89 d8 mov %ebx,%eax 41f: 31 d2 xor %edx,%edx 421: 8b 7d c4 mov -0x3c(%ebp),%edi 424: f7 f1 div %ecx 426: 83 c7 01 add $0x1,%edi 429: 0f b6 92 d4 08 00 00 movzbl 0x8d4(%edx),%edx 430: 88 14 3e mov %dl,(%esi,%edi,1) }while((x /= base) != 0); 433: 39 d9 cmp %ebx,%ecx 435: 76 e1 jbe 418 <printint+0x38> if(neg) 437: 8b 45 c0 mov -0x40(%ebp),%eax 43a: 85 c0 test %eax,%eax 43c: 74 0d je 44b <printint+0x6b> buf[i++] = '-'; 43e: c6 44 3d d8 2d movb $0x2d,-0x28(%ebp,%edi,1) 443: ba 2d 00 00 00 mov $0x2d,%edx buf[i++] = digits[x % base]; 448: 89 7d c4 mov %edi,-0x3c(%ebp) 44b: 8b 45 c4 mov -0x3c(%ebp),%eax 44e: 8b 7d bc mov -0x44(%ebp),%edi 451: 8d 5c 05 d7 lea -0x29(%ebp,%eax,1),%ebx 455: eb 0f jmp 466 <printint+0x86> 457: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 45e: 66 90 xchg %ax,%ax 460: 0f b6 13 movzbl (%ebx),%edx 463: 83 eb 01 sub $0x1,%ebx write(fd, &c, 1); 466: 83 ec 04 sub $0x4,%esp 469: 88 55 d7 mov %dl,-0x29(%ebp) 46c: 6a 01 push $0x1 46e: 56 push %esi 46f: 57 push %edi 470: e8 ac fe ff ff call 321 <write> while(--i >= 0) 475: 83 c4 10 add $0x10,%esp 478: 39 de cmp %ebx,%esi 47a: 75 e4 jne 460 <printint+0x80> putc(fd, buf[i]); } 47c: 8d 65 f4 lea -0xc(%ebp),%esp 47f: 5b pop %ebx 480: 5e pop %esi 481: 5f pop %edi 482: 5d pop %ebp 483: c3 ret 484: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi neg = 0; 488: c7 45 c0 00 00 00 00 movl $0x0,-0x40(%ebp) 48f: e9 75 ff ff ff jmp 409 <printint+0x29> 494: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 49b: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 49f: 90 nop 000004a0 <printf>: // Print to the given fd. Only understands %d, %x, %p, %s. void printf(int fd, const char *fmt, ...) { 4a0: 55 push %ebp 4a1: 89 e5 mov %esp,%ebp 4a3: 57 push %edi 4a4: 56 push %esi 4a5: 53 push %ebx 4a6: 83 ec 2c sub $0x2c,%esp int c, i, state; uint *ap; state = 0; ap = (uint*)(void*)&fmt + 1; for(i = 0; fmt[i]; i++){ 4a9: 8b 75 0c mov 0xc(%ebp),%esi 4ac: 0f b6 1e movzbl (%esi),%ebx 4af: 84 db test %bl,%bl 4b1: 0f 84 b9 00 00 00 je 570 <printf+0xd0> ap = (uint*)(void*)&fmt + 1; 4b7: 8d 45 10 lea 0x10(%ebp),%eax 4ba: 83 c6 01 add $0x1,%esi write(fd, &c, 1); 4bd: 8d 7d e7 lea -0x19(%ebp),%edi state = 0; 4c0: 31 d2 xor %edx,%edx ap = (uint*)(void*)&fmt + 1; 4c2: 89 45 d0 mov %eax,-0x30(%ebp) 4c5: eb 38 jmp 4ff <printf+0x5f> 4c7: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 4ce: 66 90 xchg %ax,%ax 4d0: 89 55 d4 mov %edx,-0x2c(%ebp) c = fmt[i] & 0xff; if(state == 0){ if(c == '%'){ state = '%'; 4d3: ba 25 00 00 00 mov $0x25,%edx if(c == '%'){ 4d8: 83 f8 25 cmp $0x25,%eax 4db: 74 17 je 4f4 <printf+0x54> write(fd, &c, 1); 4dd: 83 ec 04 sub $0x4,%esp 4e0: 88 5d e7 mov %bl,-0x19(%ebp) 4e3: 6a 01 push $0x1 4e5: 57 push %edi 4e6: ff 75 08 pushl 0x8(%ebp) 4e9: e8 33 fe ff ff call 321 <write> 4ee: 8b 55 d4 mov -0x2c(%ebp),%edx } else { putc(fd, c); 4f1: 83 c4 10 add $0x10,%esp 4f4: 83 c6 01 add $0x1,%esi for(i = 0; fmt[i]; i++){ 4f7: 0f b6 5e ff movzbl -0x1(%esi),%ebx 4fb: 84 db test %bl,%bl 4fd: 74 71 je 570 <printf+0xd0> c = fmt[i] & 0xff; 4ff: 0f be cb movsbl %bl,%ecx 502: 0f b6 c3 movzbl %bl,%eax if(state == 0){ 505: 85 d2 test %edx,%edx 507: 74 c7 je 4d0 <printf+0x30> } } else if(state == '%'){ 509: 83 fa 25 cmp $0x25,%edx 50c: 75 e6 jne 4f4 <printf+0x54> if(c == 'd'){ 50e: 83 f8 64 cmp $0x64,%eax 511: 0f 84 99 00 00 00 je 5b0 <printf+0x110> printint(fd, *ap, 10, 1); ap++; } else if(c == 'x' || c == 'p'){ 517: 81 e1 f7 00 00 00 and $0xf7,%ecx 51d: 83 f9 70 cmp $0x70,%ecx 520: 74 5e je 580 <printf+0xe0> printint(fd, *ap, 16, 0); ap++; } else if(c == 's'){ 522: 83 f8 73 cmp $0x73,%eax 525: 0f 84 d5 00 00 00 je 600 <printf+0x160> s = "(null)"; while(*s != 0){ putc(fd, *s); s++; } } else if(c == 'c'){ 52b: 83 f8 63 cmp $0x63,%eax 52e: 0f 84 8c 00 00 00 je 5c0 <printf+0x120> putc(fd, *ap); ap++; } else if(c == '%'){ 534: 83 f8 25 cmp $0x25,%eax 537: 0f 84 b3 00 00 00 je 5f0 <printf+0x150> write(fd, &c, 1); 53d: 83 ec 04 sub $0x4,%esp 540: c6 45 e7 25 movb $0x25,-0x19(%ebp) 544: 6a 01 push $0x1 546: 57 push %edi 547: ff 75 08 pushl 0x8(%ebp) 54a: e8 d2 fd ff ff call 321 <write> putc(fd, c); } else { // Unknown % sequence. Print it to draw attention. putc(fd, '%'); putc(fd, c); 54f: 88 5d e7 mov %bl,-0x19(%ebp) write(fd, &c, 1); 552: 83 c4 0c add $0xc,%esp 555: 6a 01 push $0x1 557: 83 c6 01 add $0x1,%esi 55a: 57 push %edi 55b: ff 75 08 pushl 0x8(%ebp) 55e: e8 be fd ff ff call 321 <write> for(i = 0; fmt[i]; i++){ 563: 0f b6 5e ff movzbl -0x1(%esi),%ebx putc(fd, c); 567: 83 c4 10 add $0x10,%esp } state = 0; 56a: 31 d2 xor %edx,%edx for(i = 0; fmt[i]; i++){ 56c: 84 db test %bl,%bl 56e: 75 8f jne 4ff <printf+0x5f> } } } 570: 8d 65 f4 lea -0xc(%ebp),%esp 573: 5b pop %ebx 574: 5e pop %esi 575: 5f pop %edi 576: 5d pop %ebp 577: c3 ret 578: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 57f: 90 nop printint(fd, *ap, 16, 0); 580: 83 ec 0c sub $0xc,%esp 583: b9 10 00 00 00 mov $0x10,%ecx 588: 6a 00 push $0x0 58a: 8b 5d d0 mov -0x30(%ebp),%ebx 58d: 8b 45 08 mov 0x8(%ebp),%eax 590: 8b 13 mov (%ebx),%edx 592: e8 49 fe ff ff call 3e0 <printint> ap++; 597: 89 d8 mov %ebx,%eax 599: 83 c4 10 add $0x10,%esp state = 0; 59c: 31 d2 xor %edx,%edx ap++; 59e: 83 c0 04 add $0x4,%eax 5a1: 89 45 d0 mov %eax,-0x30(%ebp) 5a4: e9 4b ff ff ff jmp 4f4 <printf+0x54> 5a9: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi printint(fd, *ap, 10, 1); 5b0: 83 ec 0c sub $0xc,%esp 5b3: b9 0a 00 00 00 mov $0xa,%ecx 5b8: 6a 01 push $0x1 5ba: eb ce jmp 58a <printf+0xea> 5bc: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi putc(fd, *ap); 5c0: 8b 5d d0 mov -0x30(%ebp),%ebx write(fd, &c, 1); 5c3: 83 ec 04 sub $0x4,%esp putc(fd, *ap); 5c6: 8b 03 mov (%ebx),%eax write(fd, &c, 1); 5c8: 6a 01 push $0x1 ap++; 5ca: 83 c3 04 add $0x4,%ebx write(fd, &c, 1); 5cd: 57 push %edi 5ce: ff 75 08 pushl 0x8(%ebp) putc(fd, *ap); 5d1: 88 45 e7 mov %al,-0x19(%ebp) write(fd, &c, 1); 5d4: e8 48 fd ff ff call 321 <write> ap++; 5d9: 89 5d d0 mov %ebx,-0x30(%ebp) 5dc: 83 c4 10 add $0x10,%esp state = 0; 5df: 31 d2 xor %edx,%edx 5e1: e9 0e ff ff ff jmp 4f4 <printf+0x54> 5e6: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 5ed: 8d 76 00 lea 0x0(%esi),%esi putc(fd, c); 5f0: 88 5d e7 mov %bl,-0x19(%ebp) write(fd, &c, 1); 5f3: 83 ec 04 sub $0x4,%esp 5f6: e9 5a ff ff ff jmp 555 <printf+0xb5> 5fb: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 5ff: 90 nop s = (char*)*ap; 600: 8b 45 d0 mov -0x30(%ebp),%eax 603: 8b 18 mov (%eax),%ebx ap++; 605: 83 c0 04 add $0x4,%eax 608: 89 45 d0 mov %eax,-0x30(%ebp) if(s == 0) 60b: 85 db test %ebx,%ebx 60d: 74 17 je 626 <printf+0x186> while(*s != 0){ 60f: 0f b6 03 movzbl (%ebx),%eax state = 0; 612: 31 d2 xor %edx,%edx while(*s != 0){ 614: 84 c0 test %al,%al 616: 0f 84 d8 fe ff ff je 4f4 <printf+0x54> 61c: 89 75 d4 mov %esi,-0x2c(%ebp) 61f: 89 de mov %ebx,%esi 621: 8b 5d 08 mov 0x8(%ebp),%ebx 624: eb 1a jmp 640 <printf+0x1a0> s = "(null)"; 626: bb cd 08 00 00 mov $0x8cd,%ebx while(*s != 0){ 62b: 89 75 d4 mov %esi,-0x2c(%ebp) 62e: b8 28 00 00 00 mov $0x28,%eax 633: 89 de mov %ebx,%esi 635: 8b 5d 08 mov 0x8(%ebp),%ebx 638: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 63f: 90 nop write(fd, &c, 1); 640: 83 ec 04 sub $0x4,%esp s++; 643: 83 c6 01 add $0x1,%esi 646: 88 45 e7 mov %al,-0x19(%ebp) write(fd, &c, 1); 649: 6a 01 push $0x1 64b: 57 push %edi 64c: 53 push %ebx 64d: e8 cf fc ff ff call 321 <write> while(*s != 0){ 652: 0f b6 06 movzbl (%esi),%eax 655: 83 c4 10 add $0x10,%esp 658: 84 c0 test %al,%al 65a: 75 e4 jne 640 <printf+0x1a0> 65c: 8b 75 d4 mov -0x2c(%ebp),%esi state = 0; 65f: 31 d2 xor %edx,%edx 661: e9 8e fe ff ff jmp 4f4 <printf+0x54> 666: 66 90 xchg %ax,%ax 668: 66 90 xchg %ax,%ax 66a: 66 90 xchg %ax,%ax 66c: 66 90 xchg %ax,%ax 66e: 66 90 xchg %ax,%ax 00000670 <free>: static Header base; static Header *freep; void free(void *ap) { 670: 55 push %ebp Header *bp, *p; bp = (Header*)ap - 1; for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr) 671: a1 a0 0b 00 00 mov 0xba0,%eax { 676: 89 e5 mov %esp,%ebp 678: 57 push %edi 679: 56 push %esi 67a: 53 push %ebx 67b: 8b 5d 08 mov 0x8(%ebp),%ebx 67e: 8b 10 mov (%eax),%edx bp = (Header*)ap - 1; 680: 8d 4b f8 lea -0x8(%ebx),%ecx for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr) 683: 39 c8 cmp %ecx,%eax 685: 73 19 jae 6a0 <free+0x30> 687: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 68e: 66 90 xchg %ax,%ax 690: 39 d1 cmp %edx,%ecx 692: 72 14 jb 6a8 <free+0x38> if(p >= p->s.ptr && (bp > p || bp < p->s.ptr)) 694: 39 d0 cmp %edx,%eax 696: 73 10 jae 6a8 <free+0x38> { 698: 89 d0 mov %edx,%eax 69a: 8b 10 mov (%eax),%edx for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr) 69c: 39 c8 cmp %ecx,%eax 69e: 72 f0 jb 690 <free+0x20> if(p >= p->s.ptr && (bp > p || bp < p->s.ptr)) 6a0: 39 d0 cmp %edx,%eax 6a2: 72 f4 jb 698 <free+0x28> 6a4: 39 d1 cmp %edx,%ecx 6a6: 73 f0 jae 698 <free+0x28> break; if(bp + bp->s.size == p->s.ptr){ 6a8: 8b 73 fc mov -0x4(%ebx),%esi 6ab: 8d 3c f1 lea (%ecx,%esi,8),%edi 6ae: 39 fa cmp %edi,%edx 6b0: 74 1e je 6d0 <free+0x60> bp->s.size += p->s.ptr->s.size; bp->s.ptr = p->s.ptr->s.ptr; } else bp->s.ptr = p->s.ptr; 6b2: 89 53 f8 mov %edx,-0x8(%ebx) if(p + p->s.size == bp){ 6b5: 8b 50 04 mov 0x4(%eax),%edx 6b8: 8d 34 d0 lea (%eax,%edx,8),%esi 6bb: 39 f1 cmp %esi,%ecx 6bd: 74 28 je 6e7 <free+0x77> p->s.size += bp->s.size; p->s.ptr = bp->s.ptr; } else p->s.ptr = bp; 6bf: 89 08 mov %ecx,(%eax) freep = p; } 6c1: 5b pop %ebx freep = p; 6c2: a3 a0 0b 00 00 mov %eax,0xba0 } 6c7: 5e pop %esi 6c8: 5f pop %edi 6c9: 5d pop %ebp 6ca: c3 ret 6cb: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 6cf: 90 nop bp->s.size += p->s.ptr->s.size; 6d0: 03 72 04 add 0x4(%edx),%esi 6d3: 89 73 fc mov %esi,-0x4(%ebx) bp->s.ptr = p->s.ptr->s.ptr; 6d6: 8b 10 mov (%eax),%edx 6d8: 8b 12 mov (%edx),%edx 6da: 89 53 f8 mov %edx,-0x8(%ebx) if(p + p->s.size == bp){ 6dd: 8b 50 04 mov 0x4(%eax),%edx 6e0: 8d 34 d0 lea (%eax,%edx,8),%esi 6e3: 39 f1 cmp %esi,%ecx 6e5: 75 d8 jne 6bf <free+0x4f> p->s.size += bp->s.size; 6e7: 03 53 fc add -0x4(%ebx),%edx freep = p; 6ea: a3 a0 0b 00 00 mov %eax,0xba0 p->s.size += bp->s.size; 6ef: 89 50 04 mov %edx,0x4(%eax) p->s.ptr = bp->s.ptr; 6f2: 8b 53 f8 mov -0x8(%ebx),%edx 6f5: 89 10 mov %edx,(%eax) } 6f7: 5b pop %ebx 6f8: 5e pop %esi 6f9: 5f pop %edi 6fa: 5d pop %ebp 6fb: c3 ret 6fc: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi 00000700 <malloc>: return freep; } void* malloc(uint nbytes) { 700: 55 push %ebp 701: 89 e5 mov %esp,%ebp 703: 57 push %edi 704: 56 push %esi 705: 53 push %ebx 706: 83 ec 1c sub $0x1c,%esp Header *p, *prevp; uint nunits; nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1; 709: 8b 45 08 mov 0x8(%ebp),%eax if((prevp = freep) == 0){ 70c: 8b 3d a0 0b 00 00 mov 0xba0,%edi nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1; 712: 8d 70 07 lea 0x7(%eax),%esi 715: c1 ee 03 shr $0x3,%esi 718: 83 c6 01 add $0x1,%esi if((prevp = freep) == 0){ 71b: 85 ff test %edi,%edi 71d: 0f 84 ad 00 00 00 je 7d0 <malloc+0xd0> base.s.ptr = freep = prevp = &base; base.s.size = 0; } for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){ 723: 8b 17 mov (%edi),%edx if(p->s.size >= nunits){ 725: 8b 4a 04 mov 0x4(%edx),%ecx 728: 39 f1 cmp %esi,%ecx 72a: 73 72 jae 79e <malloc+0x9e> 72c: 81 fe 00 10 00 00 cmp $0x1000,%esi 732: bb 00 10 00 00 mov $0x1000,%ebx 737: 0f 43 de cmovae %esi,%ebx p = sbrk(nu * sizeof(Header)); 73a: 8d 04 dd 00 00 00 00 lea 0x0(,%ebx,8),%eax 741: 89 45 e4 mov %eax,-0x1c(%ebp) 744: eb 1b jmp 761 <malloc+0x61> 746: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 74d: 8d 76 00 lea 0x0(%esi),%esi for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){ 750: 8b 02 mov (%edx),%eax if(p->s.size >= nunits){ 752: 8b 48 04 mov 0x4(%eax),%ecx 755: 39 f1 cmp %esi,%ecx 757: 73 4f jae 7a8 <malloc+0xa8> 759: 8b 3d a0 0b 00 00 mov 0xba0,%edi 75f: 89 c2 mov %eax,%edx p->s.size = nunits; } freep = prevp; return (void*)(p + 1); } if(p == freep) 761: 39 d7 cmp %edx,%edi 763: 75 eb jne 750 <malloc+0x50> p = sbrk(nu * sizeof(Header)); 765: 83 ec 0c sub $0xc,%esp 768: ff 75 e4 pushl -0x1c(%ebp) 76b: e8 19 fc ff ff call 389 <sbrk> if(p == (char*)-1) 770: 83 c4 10 add $0x10,%esp 773: 83 f8 ff cmp $0xffffffff,%eax 776: 74 1c je 794 <malloc+0x94> hp->s.size = nu; 778: 89 58 04 mov %ebx,0x4(%eax) free((void*)(hp + 1)); 77b: 83 ec 0c sub $0xc,%esp 77e: 83 c0 08 add $0x8,%eax 781: 50 push %eax 782: e8 e9 fe ff ff call 670 <free> return freep; 787: 8b 15 a0 0b 00 00 mov 0xba0,%edx if((p = morecore(nunits)) == 0) 78d: 83 c4 10 add $0x10,%esp 790: 85 d2 test %edx,%edx 792: 75 bc jne 750 <malloc+0x50> return 0; } } 794: 8d 65 f4 lea -0xc(%ebp),%esp return 0; 797: 31 c0 xor %eax,%eax } 799: 5b pop %ebx 79a: 5e pop %esi 79b: 5f pop %edi 79c: 5d pop %ebp 79d: c3 ret if(p->s.size >= nunits){ 79e: 89 d0 mov %edx,%eax 7a0: 89 fa mov %edi,%edx 7a2: 8d b6 00 00 00 00 lea 0x0(%esi),%esi if(p->s.size == nunits) 7a8: 39 ce cmp %ecx,%esi 7aa: 74 54 je 800 <malloc+0x100> p->s.size -= nunits; 7ac: 29 f1 sub %esi,%ecx 7ae: 89 48 04 mov %ecx,0x4(%eax) p += p->s.size; 7b1: 8d 04 c8 lea (%eax,%ecx,8),%eax p->s.size = nunits; 7b4: 89 70 04 mov %esi,0x4(%eax) freep = prevp; 7b7: 89 15 a0 0b 00 00 mov %edx,0xba0 } 7bd: 8d 65 f4 lea -0xc(%ebp),%esp return (void*)(p + 1); 7c0: 83 c0 08 add $0x8,%eax } 7c3: 5b pop %ebx 7c4: 5e pop %esi 7c5: 5f pop %edi 7c6: 5d pop %ebp 7c7: c3 ret 7c8: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi 7cf: 90 nop base.s.ptr = freep = prevp = &base; 7d0: c7 05 a0 0b 00 00 a4 movl $0xba4,0xba0 7d7: 0b 00 00 base.s.size = 0; 7da: bf a4 0b 00 00 mov $0xba4,%edi base.s.ptr = freep = prevp = &base; 7df: c7 05 a4 0b 00 00 a4 movl $0xba4,0xba4 7e6: 0b 00 00 for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){ 7e9: 89 fa mov %edi,%edx base.s.size = 0; 7eb: c7 05 a8 0b 00 00 00 movl $0x0,0xba8 7f2: 00 00 00 if(p->s.size >= nunits){ 7f5: e9 32 ff ff ff jmp 72c <malloc+0x2c> 7fa: 8d b6 00 00 00 00 lea 0x0(%esi),%esi prevp->s.ptr = p->s.ptr; 800: 8b 08 mov (%eax),%ecx 802: 89 0a mov %ecx,(%edx) 804: eb b1 jmp 7b7 <malloc+0xb7>
programs/oeis/301/A301337.asm
neoneye/loda
22
83118
<reponame>neoneye/loda ; A301337: Number of steps required in the worst case for two knights to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle). ; 1,1,2,2,2,3,4,4,6,6,6,7,8,8,10,10,10,11,12,12 lpb $0 sub $0,1 trn $0,3 add $1,4 mov $2,2 trn $2,$0 trn $0,3 add $0,1 add $2,1 lpe sub $1,$2 add $1,1 mov $0,$1
alloy4fun_models/trashltl/models/7/S3KNbWHELhyCeuEY3.als
Kaixi26/org.alloytools.alloy
0
4336
open main pred idS3KNbWHELhyCeuEY3_prop8 { always(eventually link.File in Trash) } pred __repair { idS3KNbWHELhyCeuEY3_prop8 } check __repair { idS3KNbWHELhyCeuEY3_prop8 <=> prop8o }
programs/oeis/085/A085374.asm
neoneye/loda
22
162076
; A085374: a(n) = binomial(2n+1, n+1)*binomial(n+3, 3). ; 1,12,100,700,4410,25872,144144,772200,4011150,20323160,100876776,492156392,2366136500,11232648000,52739956800,245240799120,1130632213590,5172827121000,23504600427000,106141827191400 mov $2,$0 add $0,1 seq $0,119581 ; (2*n+n^2)*(binomial(2*n,n))/2. mov $1,$0 mul $0,2 add $1,$0 mov $0,$1 add $2,2 mul $0,$2 sub $0,18 div $0,18 add $0,1
c64/emu_chrin.asm
alexkazik/disk2easyflash
1
102791
.pc = * "CHRIN" DO_CHRIN: // in: - // used: A // out: A, C // setup exit :mov #$4c ; RETURN_COMMAND :mov16 REAL_CHRIN ; RETURN_ADDR // check active device lda $99 bne !just_rts+ // other device = just the orig. routine !keyboard: lda $d0 bne !just_rts+ sty TEMP1 lda AUTOTYPE_STATUS bne !line1+ !line2: ldy #[autotype_line2 - autotype_line1] .byte $2c !line1: ldy #0 !loop: lda autotype_line1, y beq !new_line+ jsr $e716 // print char inc $c8 iny bne !loop- !new_line: sta $0292 sta $d3 sta $d4 inc $d0 !exit_chrin: ldy TEMP1 dec AUTOTYPE_STATUS bpl !just_rts+ // disable CHRIN :mov16 REAL_CHRIN ; $0324 !just_rts: jmp DISABLE_CRT autotype_line1: .byte $4c, $4f, $41, $44, $22, $2a, $22, $2c, $38, $2c, $31, 0 autotype_line2: .byte $52, $55, $4e, 0
examples/example_adafunctions.ads
jhumphry/aLua
0
24327
<filename>examples/example_adafunctions.ads<gh_stars>0 -- Example_Adafunctions -- A example of using the Ada 2012 interface to Lua for functions / closures etc -- Copyright (c) 2015, <NAME> - see LICENSE for terms with Lua; use Lua; package Example_AdaFunctions is function FooBar (L : Lua_State'Class) return Natural; function Multret (L : Lua_State'Class) return Natural; function Closure (L : Lua_State'Class) return Natural; end Example_AdaFunctions;
libsrc/target/mikro80/input/in_Inkey.asm
Frodevan/z88dk
640
1977
; uint in_Inkey(void) ; Read current state of keyboard SECTION code_clib PUBLIC in_Inkey PUBLIC _in_Inkey EXTERN in_keytranstbl ; exit : carry set and HL = 0 for no keys registered ; else HL = ASCII character code ; uses : AF,BC,DE,HL ; ; TRS80/EACA2000 uses memory mapped keyboard ports .in_Inkey ._in_Inkey ld de,0 ld b,@11111110 loop: ld a,b out ($07),a in a,($06) cpl ;active low keyboard and @01111111 jr nz,gotkey ld a,e add 8 ld e,a ld a,b rlca ;carry is cleared by the add 8 ld b,a jr c,loop nokey: ld hl,0 scf ret gotkey: ; a = key pressed mask ; e = offset ld l,7 hitkey_loop: rrca jr c,doneinc inc e dec l jr nz,hitkey_loop jr nokey doneinc: ; e = offset in a,($05) ;shift/ctrl row cpl ld c,a ld hl,64 and @00000100 ;Shift jr nz,got_modifier ld hl,128 ld a,c and @00000010 ;Ctrl jr nz,got_modifier ld hl,0 got_modifier: add hl,de ld de,in_keytranstbl add hl,de ld a,(hl) cp 255 jr z,nokey ld l,a ld h,0 and a ret
libsrc/_DEVELOPMENT/math/float/math48/lm/z80/asm_fmod.asm
jpoikela/z88dk
640
27688
SECTION code_clib SECTION code_fp_math48 PUBLIC asm_fmod EXTERN am48_fmod defc asm_fmod = am48_fmod
libsrc/_DEVELOPMENT/math/float/am9511/lam32/c/sdcc/___uint2fs_callee.asm
ahjelm/z88dk
640
97882
<reponame>ahjelm/z88dk SECTION code_fp_am9511 PUBLIC ___uint2fs_callee EXTERN cam32_sdcc___uint2fs_callee defc ___uint2fs_callee = cam32_sdcc___uint2fs_callee
other.7z/NEWS.7z/NEWS/テープリストア/NEWS_05/NEWS_05.tar/home/kimura/kart/risc.lzh/risc/join/Coin.asm
prismotizm/gigaleak
0
25986
<gh_stars>0 Name: Coin.asm Type: file Size: 13221 Last-Modified: '1992-11-18T01:48:22Z' SHA-1: CB800FA561994F030B2B63698B85DEA406421656 Description: null
src/latin_utils/latin_utils-inflections_package-stem_type_io.adb
spr93/whitakers-words
204
20581
<filename>src/latin_utils/latin_utils-inflections_package-stem_type_io.adb -- WORDS, a Latin dictionary, by <NAME> (USAF, Retired) -- -- Copyright <NAME> (1936–2010) -- -- This is a free program, which means it is proper to copy it and pass -- it on to your friends. Consider it a developmental item for which -- there is no charge. However, just for form, it is Copyrighted -- (c). Permission is hereby freely given for any and all use of program -- and data. You can sell it as your own, but at least tell me. -- -- This version is distributed without obligation, but the developer -- would appreciate comments and suggestions. -- -- All parts of the WORDS system, source code and data files, are made freely -- available to anyone who wishes to use them, for whatever purpose. separate (Latin_Utils.Inflections_Package) package body Stem_Type_IO is --------------------------------------------------------------------------- procedure Get (File : in File_Type; Item : out Stem_Type) is C : Character := ' '; begin Item := Null_Stem_Type; for K in 1 .. Stem_Type_IO.Default_Width loop Get (File, C); if (C not in 'A' .. 'Z') and (C not in 'a' .. 'z') then exit; else Item (K) := C; end if; end loop; end Get; --------------------------------------------------------------------------- procedure Get (Item : out Stem_Type) is C : Character := ' '; begin Item := Null_Stem_Type; for K in 1 .. Stem_Type_IO.Default_Width loop Ada.Text_IO.Get (C); if (C not in 'A' .. 'Z') and (C not in 'a' .. 'z') then exit; else Item (K) := C; end if; end loop; end Get; --------------------------------------------------------------------------- procedure Put (File : in File_Type; Item : in Stem_Type) is begin Ada.Text_IO.Put (File, Item); end Put; --------------------------------------------------------------------------- procedure Put (Item : in Stem_Type) is begin Ada.Text_IO.Put (Item); end Put; --------------------------------------------------------------------------- procedure Get (Source : in String; Target : out Stem_Type; Last : out Integer ) is C : Character; begin Target := Null_Stem_Type; Last := 0; for K in 1 .. Stem_Type_IO.Default_Width loop C := Source (K); if (C not in 'A' .. 'Z') and (C not in 'a' .. 'z') then exit; else Target (K) := C; Last := K; end if; end loop; end Get; --------------------------------------------------------------------------- procedure Put (Target : out String; Item : in Stem_Type) is begin Target (Target'First .. Target'First + Stem_Type_IO.Default_Width - 1) := Item; end Put; --------------------------------------------------------------------------- end Stem_Type_IO;
programs/oeis/285/A285326.asm
jmorken/loda
1
178765
; A285326: a(0) = 0, for n > 0, a(n) = n + A006519(n). ; 0,2,4,4,8,6,8,8,16,10,12,12,16,14,16,16,32,18,20,20,24,22,24,24,32,26,28,28,32,30,32,32,64,34,36,36,40,38,40,40,48,42,44,44,48,46,48,48,64,50,52,52,56,54,56,56,64,58,60,60,64,62,64,64,128,66,68,68,72,70,72,72,80,74,76,76,80,78,80,80,96,82,84,84,88,86,88,88,96,90,92,92,96,94,96,96,128,98,100,100,104,102,104,104,112,106,108,108,112,110,112,112,128,114,116,116,120,118,120,120,128,122,124,124,128,126,128,128,256,130,132,132,136,134,136,136,144,138,140,140,144,142,144,144,160,146,148,148,152,150,152,152,160,154,156,156,160,158,160,160,192,162,164,164,168,166,168,168,176,170,172,172,176,174,176,176,192,178,180,180,184,182,184,184,192,186,188,188,192,190,192,192,256,194,196,196,200,198,200,200,208,202,204,204,208,206,208,208,224,210,212,212,216,214,216,216,224,218,220,220,224,222,224,224,256,226,228,228,232,230,232,232,240,234,236,236,240,238,240,240,256,242,244,244,248,246,248,248,256,250 mov $1,$0 gcd $0,256 lpb $0 mul $0,$1 lpe add $1,$0
programs/oeis/165/A165829.asm
jmorken/loda
1
29213
<gh_stars>1-10 ; A165829: Totally multiplicative sequence with a(p) = 8. ; 1,8,8,64,8,64,8,512,64,64,8,512,8,64,64,4096,8,512,8,512,64,64,8,4096,64,64,512,512,8,512,8,32768,64,64,64,4096,8,64,64,4096,8,512,8,512,512,64,8,32768,64,512,64,512,8,4096,64,4096,64,64,8,4096,8,64,512,262144,64,512,8,512,64,512,8,32768,8,64,512,512,64,512,8,32768,4096,64,8,4096,64,64,64,4096,8,4096,64,512,64,64,64,262144,8,512,512,4096,8,512,8,4096,512,64,8,32768,8,512,64,32768,8,512,64,512,512,64,64,32768,64,64,64,512,512,4096,8,2097152,64,512,8,4096,64,64,4096,4096,8,512,8,4096,64,64,64,262144,64,64,512,512,8,4096,8,4096,512,512,64,4096,8,64,64,262144,64,32768,8,512,512,64,8,32768,64,512,512,512,8,512,512,32768,64,64,8,32768,8,512,64,4096,64,512,64,512,4096,512,8,2097152,8,64,512,4096,8,4096,8,32768,64,64,64,4096,64,64,512,32768,64,4096,8,512,64,64,64,262144,64,64,64,4096,64,512,8,262144,4096,64,8,4096,8,512,512,4096,8,4096,64,512,64,512,8,262144,8,512,32768,512,512,512,64,4096,64,4096 cal $0,73093 ; Number of prime power divisors of n. cal $0,170114 mov $1,$0 mul $1,2916 div $1,163296 mul $1,7 add $1,1
programs/oeis/174/A174191.asm
jmorken/loda
1
3017
<reponame>jmorken/loda<filename>programs/oeis/174/A174191.asm<gh_stars>1-10 ; A174191: Expansion of (1+x)*(2*x-1)/((1-x)*(x^2+2*x-1)). ; 1,2,3,6,13,30,71,170,409,986,2379,5742,13861,33462,80783,195026,470833,1136690,2744211,6625110,15994429,38613966,93222359,225058682,543339721,1311738122,3166815963,7645370046,18457556053,44560482150,107578520351 add $0,1 mov $3,2 mov $4,1 lpb $0 sub $0,1 mov $5,$3 sub $5,$4 add $2,$5 mov $3,$2 add $2,$5 lpe add $1,$3
AssemblyLanguage/CS/exp2-2.asm
luocr7/NCEPU-CS-COURSES
30
9356
<reponame>luocr7/NCEPU-CS-COURSES<filename>AssemblyLanguage/CS/exp2-2.asm ;x,y,z,v是数据段定义的16位有符号数，试写出计算下面表达式的指令序列。 ;(v-(x*y+z-540))/x DATAS SEGMENT V DW 0001H X DW 0002H Y DW 0003H Z DW 0004H DATAS ENDS STACKS SEGMENT STACKS ENDS CODES SEGMENT ASSUME CS:CODES, DS:DATAS, SS:STACKS START: MOV AX, DATAS MOV DS, AX ;HERE WRITE YOUR OWN CODES MOV AX, X IMUL Y ;有符号数乘法，y是source code，AX中的数是destination code MOV CX, AX ;store product in BX CX MOV BX, DX ; DX是默认扩展位，进位就在dx当中 MOV AX, Z CWD ; 将ax扩展为32位dx.ax ADD CX, AX ADC BX, DX ;两个高位相加，先加进位cf再加dx SUB CX, 540H SBB BX, 0H ;SBB 和 ADC 分别看借位和进位 ;目前x*y+z-540 存储在BX.CX中 MOV AX, V CWD ;扩展 SUB AX, CX ;地位相减 SBB DX, BX ;高位相减以及处理借位 IDIV X ;商在ax中，余数在dx中 ;ABOVE WRITE YOUR OWN CODES MOV AH, 4CH INT 21H CODES ENDS END START
src/algebra/group/morphism.agda
pcapriotti/agda-base
20
57
{-# OPTIONS --without-K #-} module algebra.group.morphism where open import level open import algebra.group.core open import algebra.monoid.morphism module _ {i}{j} {X : Set i}⦃ sX : IsGroup X ⦄ {Y : Set j}⦃ sY : IsGroup Y ⦄ where open IsGroup ⦃ ... ⦄ IsGroupMorphism : (X → Y) → Set (i ⊔ j) IsGroupMorphism f = IsMonoidMorphism f
game-mod/characters/kiki/ai.asm
pompshuffle/super-tilt-bro
2
16566
<reponame>pompshuffle/super-tilt-bro<filename>game-mod/characters/kiki/ai.asm kiki_ai_recover_selector: .( ;tmpfield 1 to 6 can be modified by platform_handler platform_handler_lsb = tmpfield1 platform_handler_msb = tmpfield2 endangered = tmpfield9 lowest_platform_top = tmpfield10 lowest_platform = tmpfield11 grounded = tmpfield12 .( ; Check that the player is offstage - lower than lowest platform lda #0 sta lowest_platform_top sta grounded lda #<platform_handler sta platform_handler_lsb lda #>platform_handler sta platform_handler_msb jsr stage_iterate_all_elements cpy #$ff beq dont_try_to_recover SIGNED_CMP(lowest_platform_top, #0, player_b_y, player_b_y_screen) bmi try_to_recover dont_try_to_recover: jmp end try_to_recover: ; Set action modifier to the platform's direction lda #CONTROLLER_BTN_RIGHT sta ai_current_action_modifier ldy lowest_platform SIGNED_CMP(player_b_x, player_b_x_screen, stage_data+STAGE_PLATFORM_OFFSET_RIGHT COMMA y, #0) bmi direction_set lda #CONTROLLER_BTN_LEFT sta ai_current_action_modifier direction_set: ; Set the idle action if ; - the player is on hitstun ; - or the player is not on falling nor thrown state lda player_b_hitstun bne set_idle_action lda player_b_state cmp PLAYER_STATE_FALLING beq dont_set_idle_action cmp PLAYER_STATE_THROWN bne set_idle_action dont_set_idle_action: ; Air jump if it is possible lda player_b_num_aerial_jumps cmp #MAX_NUM_AERIAL_JUMPS bne set_jump_action ; Create some floor since no other action was found jmp set_special_down_action ; Set an action set_idle_action: lda #<ai_action_idle sta ai_current_action_lsb lda #>ai_action_idle sta ai_current_action_msb jmp begin_action set_jump_action: lda #<ai_action_jump sta ai_current_action_lsb lda #>ai_action_jump sta ai_current_action_msb jmp begin_action set_special_down_action: lda #$00 sta ai_current_action_modifier lda #<ai_action_special_down sta ai_current_action_lsb lda #>ai_action_special_down sta ai_current_action_msb ;jmp begin_action ; useless, fallthrough ; Reset current action to its begining begin_action: lda #0 sta ai_current_action_step sta ai_current_action_counter jsr ai_delay_action end: rts .) platform_handler: .( ; Don't mess with handler vector lda platform_handler_lsb pha lda platform_handler_msb pha ; Ignore unknown platforms lda stage_data, y cmp #STAGE_ELEMENT_PLATFORM beq process_simple_platform cmp #STAGE_ELEMENT_SMOOTH_PLATFORM beq process_simple_platform cmp #STAGE_ELEMENT_OOS_PLATFORM beq process_oos_platform cmp #STAGE_ELEMENT_OOS_SMOOTH_PLATFORM beq process_oos_platform jmp end process_simple_platform: ; If grounded on platform, stop iterating ldx #1 jsr check_simple_platform bne not_grounded ldy #$ff jmp end not_grounded: ; Save the top of lowest platform lda stage_data+STAGE_PLATFORM_OFFSET_TOP, y cmp lowest_platform_top bcc end sta lowest_platform_top sty lowest_platform jmp end process_oos_platform: ; If grounded on platform, stop iterating ldx #1 jsr check_oos_platform bne end ldy #$ff end: ; Don't mess with handler vector pla sta platform_handler_msb pla sta platform_handler_lsb rts .) ; TODO check_*_platform are copy/pasted from game utils - make it generically available, or best, make check_on_platform* routines to take Y register as only pparam check_simple_platform: .( platform_left = tmpfield1 ; Not movable - parameter of check_on_platform platform_right = tmpfield2 ; Not movable - parameter of check_on_platform platform_top = tmpfield3 ; Not movable - parameter of check_on_platform ; Check if player is is grounded on this platform lda stage_data+STAGE_PLATFORM_OFFSET_LEFT, y sta platform_left lda stage_data+STAGE_PLATFORM_OFFSET_RIGHT, y sta platform_right lda stage_data+STAGE_PLATFORM_OFFSET_TOP, y sta platform_top jsr check_on_platform rts .) check_oos_platform: .( platform_left_lsb = tmpfield1 ; Not movable - parameter of check_on_platform_multi_screen platform_right_lsb = tmpfield2 ; Not movable - parameter of check_on_platform_multi_screen platform_top_lsb = tmpfield3 ; Not movable - parameter of check_on_platform_multi_screen platform_left_msb = tmpfield4 ; Not movable - parameter of check_on_platform_multi_screen platform_right_msb = tmpfield5 ; Not movable - parameter of check_on_platform_multi_screen platform_top_msb = tmpfield6 ; Not movable - parameter of check_on_platform_multi_screen ; Check if player is is grounded on this platform lda stage_data+STAGE_OOS_PLATFORM_OFFSET_LEFT_LSB, y sta platform_left_lsb lda stage_data+STAGE_OOS_PLATFORM_OFFSET_RIGHT_LSB, y sta platform_right_lsb lda stage_data+STAGE_OOS_PLATFORM_OFFSET_TOP_LSB, y sta platform_top_lsb lda stage_data+STAGE_OOS_PLATFORM_OFFSET_LEFT_MSB, y sta platform_left_msb lda stage_data+STAGE_OOS_PLATFORM_OFFSET_RIGHT_MSB, y sta platform_right_msb lda stage_data+STAGE_OOS_PLATFORM_OFFSET_TOP_MSB, y sta platform_top_msb jsr check_on_platform_multi_screen rts .) .)
OmniFocusScripts-BrandonPittman/Deprecated Scripts/InboxParser.applescript
SkydiveMike/OmniFocusScripts
1
1416
<filename>OmniFocusScripts-BrandonPittman/Deprecated Scripts/InboxParser.applescript of = Library('OmniFocus') app = Application('OmniFocus') app.includeStandardAdditions = true app.defaultDocument.inboxTasks().forEach(function(task) { if (task.name().match(/@|::|#/)){ of.parse(task.name()) app.delete(task) } })
codec-parser/src/main/antlr/com/quiptiq/steam/codec/KeyValues.g4
taufiqkh/steam-codec
0
5881
<gh_stars>0 /** * Limited subset of the full key values grammar, detailed here: * https://developer.valvesoftware.com/wiki/KeyValues * While it does not strictly conform, it should read most well-formed files. */ grammar KeyValues; keyvalues: entry* ; entry : keypair | COMMENT ; keypair : KVTOKEN KVTOKEN | KVTOKEN '{' entry* '}' ; KVTOKEN : STRING | ALPHANUMERIC+ ; WS: [ \n\r\t] -> channel(HIDDEN); ALPHANUMERIC: [a-zA-Z0-9] ; STRING: '"' (ESC | ~ ["])* '"' ; ESC: '\\' ('n' | 't' | '\\' | '"') ; COMMENT: '//' ~[\n]* ('\n' | EOF) -> channel(HIDDEN) ;
projects/batfish/src/main/antlr4/org/batfish/grammar/cisco_nxos/CiscoNxos_flow.g4
zabrewer/batfish
763
42
parser grammar CiscoNxos_flow; import CiscoNxos_common; options { tokenVocab = CiscoNxosLexer; } s_flow : FLOW ( flow_exporter | flow_monitor | flow_record ) ; flow_exporter : EXPORTER name = fe_name NEWLINE ( fe_null | fe_source )* ; fe_name : WORD ; fe_null : ( DESCRIPTION | DESTINATION | TRANSPORT | VERSION ) null_rest_of_line ; fe_source : SOURCE iface = interface_name NEWLINE ; flow_monitor : MONITOR name = fm_name NEWLINE ( fm_exporter | fm_null | fm_record )* ; fm_exporter : EXPORTER exporter = fe_name NEWLINE ; fm_name : WORD ; fm_null : ( DESCRIPTION ) null_rest_of_line ; fm_record : RECORD record = fr_name NEWLINE ; flow_record : RECORD name = fr_name NEWLINE ( fr_null )* ; fr_name : WORD ; fr_null : ( COLLECT | DESCRIPTION | MATCH ) null_rest_of_line ;
ada/src/afrl/cmasi/afrl-cmasi-operatingregion.adb
joffreyhuguet/LmcpGen
0
30918
package body afrl.cmasi.operatingRegion is function getFullLmcpTypeName(this : OperatingRegion) return String is ("afrl.cmasi.operatingRegion.OperatingRegion"); function getLmcpTypeName(this : OperatingRegion) return String is ("OperatingRegion"); function getLmcpType(this : OperatingRegion) return UInt32_t is (CmasiEnum'Pos(OPERATINGREGION_ENUM)); function getID(this : OperatingRegion'Class) return Int64_t is (this.ID); procedure setID(this : out OperatingRegion'Class; ID : in Int64_t) is begin this.ID := ID; end setID; function getKeepInAreas(this : OperatingRegion'Class) return Vect_Int64_t_Acc is (this.KeepInAreas); function getKeepOutAreas(this : OperatingRegion'Class) return Vect_Int64_t_Acc is (this.KeepOutAreas); end afrl.cmasi.operatingRegion;
oeis/274/A274657.asm
neoneye/loda-programs
11
19092
; A274657: Numerators of the coefficients of z^n/n! for the expansion of hypergeometric([1/2,1/2],[1];z). ; Submitted by <NAME> ; 1,1,9,75,3675,59535,2401245,57972915,13043905875,418854310875,30241281245175,1212400457192925,213786613951685775,10278202593831046875,1070401384414690453125,60013837619516978071875,57673297952355815927071875,3694483615889146090857721875 seq $0,92563 ; Coefficients in asymptotic expansion of I_0(x)sqrt(2*Pi*x)/e^x in powers of 1/(16x). lpb $0 dif $0,2 lpe
oeis/142/A142806.asm
neoneye/loda-programs
11
97180
; A142806: Primes congruent to 8 mod 61. ; Submitted by <NAME>(w1) ; 191,313,557,1289,1777,2143,2753,3119,3607,3851,4217,4339,4583,5437,6047,6779,7877,8243,8609,8731,9341,9463,9829,11171,11903,12269,12391,12757,13001,13367,14221,14831,15319,16417,16661,17027,17393,17881,18979,20443,20809,21419,22273,22639,23371,23981,24103,24469,25933,26177,27031,27397,27763,29837,29959,30203,31667,32887,33619,33863,34351,34961,35083,35327,35449,36791,36913,37889,38011,38377,39719,39841,40939,41183,41549,42281,42403,43013,43867,44111,44843,45697,46307,47161,47527,48259,48869 mov $1,34 mov $2,$0 add $2,2 pow $2,2 lpb $2 sub $2,1 mov $3,$1 mul $3,2 seq $3,10051 ; Characteristic function of primes: 1 if n is prime, else 0. sub $0,$3 add $1,61 mov $4,$0 max $4,0 cmp $4,$0 mul $2,$4 lpe mov $0,$1 mul $0,2 sub $0,121
block-2/pp/block2/cc/antlr/Expression.g4
tcoenraad/compiler-construction
1
647
grammar Expression; @header{package pp.block2.cc.antlr;} expression : LPAR expression RPAR # parenthesis | <assoc=right> expression POWER expression # power | MINUS expression # minus | expression TIMES expression # multiplication | expression PLUS expression # addition | expression MINUS expression # subtraction | NUMBER # number; NUMBER : [0-9]+; POWER : '^'; TIMES : '*'; PLUS : '+'; MINUS : '-'; LPAR : '('; RPAR : ')'; WS : [ \t\n\r] -> skip;
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c37010b.ada
best08618/asylo
7
17262
<reponame>best08618/asylo -- C37010B.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT EXPRESSIONS IN AN INDEX CONSTRAINT OR DISCRIMINANT -- CONSTRAINT ARE EVALUATED WHEN THE COMPONENT DECLARATION IS -- ELABORATED EVEN IF SOME BOUNDS OR DISCRIMINANTS ARE GIVEN BY -- A DISCRIMINANT OF AN ENCLOSING RECORD TYPE. -- R.WILLIAMS 8/22/86 WITH REPORT; USE REPORT; PROCEDURE C37010B IS INIT :INTEGER := IDENT_INT (5); TYPE R (D1, D2 : INTEGER) IS RECORD NULL; END RECORD; TYPE ACCR IS ACCESS R; TYPE ARR IS ARRAY (INTEGER RANGE <> ) OF INTEGER; TYPE ACCA IS ACCESS ARR; FUNCTION RESET (N : INTEGER) RETURN INTEGER IS BEGIN INIT := IDENT_INT (N); RETURN N; END RESET; BEGIN TEST ( "C37010B", "CHECK THAT EXPRESSIONS IN AN INDEX " & "CONSTRAINT OR DISCRIMINANT CONSTRAINT " & "ARE EVALUATED WHEN THE COMPONENT " & "DECLARATION IS ELABORATED EVEN IF SOME " & "BOUNDS OR DISCRIMINANTS ARE GIVEN BY " & "A DISCRIMINANT OF AN ENCLOSING RECORD TYPE" ); DECLARE TYPE REC1 (D : INTEGER) IS RECORD W1 : R (D1 => INIT, D2 => D); X1 : ARR (INIT .. D); Y1 : ACCR (D, INIT); Z1 : ACCA (D .. INIT); END RECORD; INT1 : INTEGER := RESET (10); R1 : REC1 (D => 4); BEGIN IF R1.W1.D1 /= 5 THEN FAILED ( "INCORRECT VALUE FOR R1.W1.D1" ); END IF; IF R1.W1.D2 /= 4 THEN FAILED ( "INCORRECT VALUE FOR R1.W1.D2" ); END IF; IF R1.X1'FIRST /= 5 THEN FAILED ( "INCORRECT VALUE FOR R1.X1'FIRST" ); END IF; IF R1.X1'LAST /= 4 THEN FAILED ( "INCORRECT VALUE FOR R1.X1'LAST" ); END IF; BEGIN R1.Y1 := NEW R (4, 5); EXCEPTION WHEN OTHERS => FAILED ( "INCORRECT VALUE FOR R1.Y1" ); END; BEGIN R1.Z1 := NEW ARR (4 .. 5); EXCEPTION WHEN OTHERS => FAILED ( "INCORRECT VALUE FOR R1.Z1" ); END; END; DECLARE TYPE REC2 (D : INTEGER) IS RECORD CASE D IS WHEN 1 => NULL; WHEN 2 => NULL; WHEN OTHERS => W2 : R (D1 => D, D2 => INIT); X2 : ARR (D .. INIT); Y2 : ACCR (INIT, D); Z2 : ACCA (D .. INIT); END CASE; END RECORD; INT2 : INTEGER := RESET (20); R2 : REC2 (D => 6); BEGIN IF R2.W2.D1 /= 6 THEN FAILED ( "INCORRECT VALUE FOR R2.W2.D1" ); END IF; IF R2.W2.D2 /= 10 THEN FAILED ( "INCORRECT VALUE FOR R2.W2.D2" ); END IF; IF R2.X2'FIRST /= 6 THEN FAILED ( "INCORRECT VALUE FOR R2.X2'FIRST" ); END IF; IF R2.X2'LAST /= 10 THEN FAILED ( "INCORRECT VALUE FOR R2.X2'LAST" ); END IF; BEGIN R2.Y2 := NEW R (10, 6); EXCEPTION WHEN OTHERS => FAILED ( "INCORRECT VALUE FOR R2.Y2" ); END; BEGIN R2.Z2 := NEW ARR (6 .. 10); EXCEPTION WHEN OTHERS => FAILED ( "INCORRECT VALUE FOR R2.Z2" ); END; END; RESULT; END C37010B;
ioq3/build/release-js-js/baseq3/game/ai_cmd.asm
RawTechnique/quake-port
1
84628
export BotGetItemTeamGoal code proc BotGetItemTeamGoal 12 12 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 4 ADDRGP4 qk_strlen CALLU4 ASGNU4 ADDRLP4 4 INDIRU4 CNSTU4 0 NEU4 $55 CNSTI4 0 RETI4 ADDRGP4 $54 JUMPV LABELV $55 ADDRLP4 0 CNSTI4 -1 ASGNI4 LABELV $57 ADDRLP4 0 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 8 ADDRGP4 trap_BotGetLevelItemGoal CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 8 INDIRI4 ASGNI4 ADDRLP4 0 INDIRI4 CNSTI4 0 LEI4 $60 ADDRFP4 4 INDIRP4 CNSTI4 48 ADDP4 INDIRI4 CNSTI4 4 BANDI4 CNSTI4 0 EQI4 $62 ADDRGP4 $58 JUMPV LABELV $62 CNSTI4 1 RETI4 ADDRGP4 $54 JUMPV LABELV $60 LABELV $58 ADDRLP4 0 INDIRI4 CNSTI4 0 GTI4 $57 CNSTI4 0 RETI4 LABELV $54 endproc BotGetItemTeamGoal 12 12 export BotGetMessageTeamGoal proc BotGetMessageTeamGoal 12 12 ADDRFP4 4 INDIRP4 ARGP4 ADDRFP4 8 INDIRP4 ARGP4 ADDRLP4 4 ADDRGP4 BotGetItemTeamGoal CALLI4 ASGNI4 ADDRLP4 4 INDIRI4 CNSTI4 0 EQI4 $65 CNSTI4 1 RETI4 ADDRGP4 $64 JUMPV LABELV $65 ADDRFP4 0 INDIRP4 CNSTI4 8968 ADDP4 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 8 ADDRGP4 BotFindWayPoint CALLP4 ASGNP4 ADDRLP4 0 ADDRLP4 8 INDIRP4 ASGNP4 ADDRLP4 0 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $67 ADDRFP4 8 INDIRP4 ARGP4 ADDRLP4 0 INDIRP4 CNSTI4 36 ADDP4 ARGP4 CNSTU4 56 ARGU4 ADDRGP4 qk_memcpy CALLP4 pop CNSTI4 1 RETI4 ADDRGP4 $64 JUMPV LABELV $67 CNSTI4 0 RETI4 LABELV $64 endproc BotGetMessageTeamGoal 12 12 export BotGetTime proc BotGetTime 600 16 ADDRFP4 0 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 16 BANDI4 CNSTI4 0 EQI4 $70 ADDRFP4 0 INDIRP4 ARGP4 CNSTI4 6 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 256 ARGP4 CNSTU4 8 ARGU4 ADDRLP4 588 ADDRGP4 trap_BotFindMatch CALLI4 ASGNI4 ADDRLP4 588 INDIRI4 CNSTI4 0 EQI4 $72 ADDRLP4 256+256 INDIRI4 CNSTI4 107 NEI4 $74 ADDRLP4 584 CNSTF4 1287568416 ASGNF4 ADDRGP4 $75 JUMPV LABELV $74 ADDRLP4 256+256 INDIRI4 CNSTI4 109 NEI4 $77 ADDRLP4 584 CNSTF4 1142292480 ASGNF4 ADDRGP4 $78 JUMPV LABELV $77 ADDRLP4 256+256 INDIRI4 CNSTI4 108 NEI4 $80 ADDRLP4 584 CNSTF4 1155596288 ASGNF4 ADDRGP4 $81 JUMPV LABELV $80 ADDRLP4 256 ARGP4 CNSTI4 6 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 256+256 INDIRI4 CNSTI4 105 NEI4 $83 ADDRLP4 0 ARGP4 ADDRLP4 592 ADDRGP4 qk_atof CALLF4 ASGNF4 ADDRLP4 584 CNSTF4 1114636288 ADDRLP4 592 INDIRF4 MULF4 ASGNF4 ADDRGP4 $84 JUMPV LABELV $83 ADDRLP4 256+256 INDIRI4 CNSTI4 106 NEI4 $86 ADDRLP4 0 ARGP4 ADDRLP4 596 ADDRGP4 qk_atof CALLF4 ASGNF4 ADDRLP4 584 ADDRLP4 596 INDIRF4 ASGNF4 ADDRGP4 $87 JUMPV LABELV $86 ADDRLP4 584 CNSTF4 0 ASGNF4 LABELV $87 LABELV $84 LABELV $81 LABELV $78 LABELV $75 ADDRLP4 584 INDIRF4 CNSTF4 0 LEF4 $89 ADDRGP4 floattime INDIRF4 ADDRLP4 584 INDIRF4 ADDF4 RETF4 ADDRGP4 $69 JUMPV LABELV $89 LABELV $72 LABELV $70 CNSTF4 0 RETF4 LABELV $69 endproc BotGetTime 600 16 bss align 4 LABELV $92 skip 4 export FindClientByName code proc FindClientByName 1040 12 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRGP4 $92 INDIRI4 CNSTI4 0 NEI4 $93 ADDRGP4 $95 ARGP4 ADDRLP4 1028 ADDRGP4 trap_Cvar_VariableIntegerValue CALLI4 ASGNI4 ADDRGP4 $92 ADDRLP4 1028 INDIRI4 ASGNI4 LABELV $93 ADDRLP4 0 CNSTI4 0 ASGNI4 ADDRGP4 $99 JUMPV LABELV $96 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 1024 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRLP4 4 ARGP4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 1032 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 1032 INDIRI4 CNSTI4 0 NEI4 $100 ADDRLP4 0 INDIRI4 RETI4 ADDRGP4 $91 JUMPV LABELV $100 LABELV $97 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $99 ADDRLP4 0 INDIRI4 ADDRGP4 $92 INDIRI4 GEI4 $102 ADDRLP4 0 INDIRI4 CNSTI4 64 LTI4 $96 LABELV $102 ADDRLP4 0 CNSTI4 0 ASGNI4 ADDRGP4 $106 JUMPV LABELV $103 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 1024 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRLP4 4 ARGP4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 1036 ADDRGP4 stristr CALLP4 ASGNP4 ADDRLP4 1036 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $107 ADDRLP4 0 INDIRI4 RETI4 ADDRGP4 $91 JUMPV LABELV $107 LABELV $104 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $106 ADDRLP4 0 INDIRI4 ADDRGP4 $92 INDIRI4 GEI4 $109 ADDRLP4 0 INDIRI4 CNSTI4 64 LTI4 $103 LABELV $109 CNSTI4 -1 RETI4 LABELV $91 endproc FindClientByName 1040 12 bss align 4 LABELV $111 skip 4 export FindEnemyByName code proc FindEnemyByName 1044 12 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRGP4 $111 INDIRI4 CNSTI4 0 NEI4 $112 ADDRGP4 $95 ARGP4 ADDRLP4 1028 ADDRGP4 trap_Cvar_VariableIntegerValue CALLI4 ASGNI4 ADDRGP4 $111 ADDRLP4 1028 INDIRI4 ASGNI4 LABELV $112 ADDRLP4 0 CNSTI4 0 ASGNI4 ADDRGP4 $117 JUMPV LABELV $114 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 1032 ADDRGP4 BotSameTeam CALLI4 ASGNI4 ADDRLP4 1032 INDIRI4 CNSTI4 0 EQI4 $118 ADDRGP4 $115 JUMPV LABELV $118 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 1024 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRLP4 4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 1036 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 1036 INDIRI4 CNSTI4 0 NEI4 $120 ADDRLP4 0 INDIRI4 RETI4 ADDRGP4 $110 JUMPV LABELV $120 LABELV $115 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $117 ADDRLP4 0 INDIRI4 ADDRGP4 $111 INDIRI4 GEI4 $122 ADDRLP4 0 INDIRI4 CNSTI4 64 LTI4 $114 LABELV $122 ADDRLP4 0 CNSTI4 0 ASGNI4 ADDRGP4 $126 JUMPV LABELV $123 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 1036 ADDRGP4 BotSameTeam CALLI4 ASGNI4 ADDRLP4 1036 INDIRI4 CNSTI4 0 EQI4 $127 ADDRGP4 $124 JUMPV LABELV $127 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 1024 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRLP4 4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 1040 ADDRGP4 stristr CALLP4 ASGNP4 ADDRLP4 1040 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $129 ADDRLP4 0 INDIRI4 RETI4 ADDRGP4 $110 JUMPV LABELV $129 LABELV $124 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $126 ADDRLP4 0 INDIRI4 ADDRGP4 $111 INDIRI4 GEI4 $131 ADDRLP4 0 INDIRI4 CNSTI4 64 LTI4 $123 LABELV $131 CNSTI4 -1 RETI4 LABELV $110 endproc FindEnemyByName 1044 12 bss align 4 LABELV $133 skip 4 export NumPlayersOnSameTeam code proc NumPlayersOnSameTeam 1048 12 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRGP4 $133 INDIRI4 CNSTI4 0 NEI4 $134 ADDRGP4 $95 ARGP4 ADDRLP4 1032 ADDRGP4 trap_Cvar_VariableIntegerValue CALLI4 ASGNI4 ADDRGP4 $133 ADDRLP4 1032 INDIRI4 ASGNI4 LABELV $134 ADDRLP4 1036 CNSTI4 0 ASGNI4 ADDRLP4 1028 ADDRLP4 1036 INDIRI4 ASGNI4 ADDRLP4 0 ADDRLP4 1036 INDIRI4 ASGNI4 ADDRGP4 $139 JUMPV LABELV $136 ADDRLP4 0 INDIRI4 CNSTI4 544 ADDI4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 1024 ARGI4 ADDRGP4 trap_GetConfigstring CALLV pop ADDRLP4 4 ARGP4 ADDRLP4 1040 ADDRGP4 qk_strlen CALLU4 ASGNU4 ADDRLP4 1040 INDIRU4 CNSTU4 0 EQU4 $140 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ARGI4 ADDRLP4 1044 ADDRGP4 BotSameTeam CALLI4 ASGNI4 ADDRLP4 1044 INDIRI4 CNSTI4 0 EQI4 $142 ADDRLP4 1028 ADDRLP4 1028 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $142 LABELV $140 LABELV $137 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $139 ADDRLP4 0 INDIRI4 ADDRGP4 $133 INDIRI4 GEI4 $144 ADDRLP4 0 INDIRI4 CNSTI4 64 LTI4 $136 LABELV $144 ADDRLP4 1028 INDIRI4 RETI4 LABELV $132 endproc NumPlayersOnSameTeam 1048 12 export BotGetPatrolWaypoints proc BotGetPatrolWaypoints 680 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRLP4 592 CNSTP4 0 ASGNP4 ADDRLP4 652 CNSTI4 0 ASGNI4 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 5 ARGI4 ADDRLP4 8 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRGP4 $147 JUMPV LABELV $146 ADDRLP4 8 ARGP4 ADDRLP4 264 ARGP4 CNSTU4 64 ARGU4 ADDRLP4 656 ADDRGP4 trap_BotFindMatch CALLI4 ASGNI4 ADDRLP4 656 INDIRI4 CNSTI4 0 NEI4 $149 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRGP4 $151 ARGP4 ADDRGP4 trap_EA_SayTeam CALLV pop ADDRLP4 592 INDIRP4 ARGP4 ADDRGP4 BotFreeWaypoints CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 8972 ADDP4 CNSTP4 0 ASGNP4 CNSTI4 0 RETI4 ADDRGP4 $145 JUMPV LABELV $149 ADDRLP4 264 ARGP4 CNSTI4 5 ARGI4 ADDRLP4 8 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 8 ARGP4 ADDRLP4 596 ARGP4 ADDRLP4 660 ADDRGP4 BotGetMessageTeamGoal CALLI4 ASGNI4 ADDRLP4 660 INDIRI4 CNSTI4 0 NEI4 $152 ADDRLP4 592 INDIRP4 ARGP4 ADDRGP4 BotFreeWaypoints CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 8972 ADDP4 CNSTP4 0 ASGNP4 CNSTI4 0 RETI4 ADDRGP4 $145 JUMPV LABELV $152 ADDRLP4 8 ARGP4 ADDRLP4 596 ARGP4 ADDRLP4 596+12 INDIRI4 ARGI4 ADDRLP4 664 ADDRGP4 BotCreateWayPoint CALLP4 ASGNP4 ADDRLP4 4 ADDRLP4 664 INDIRP4 ASGNP4 ADDRLP4 4 INDIRP4 CVPU4 4 CNSTU4 0 NEU4 $155 ADDRGP4 $148 JUMPV LABELV $155 ADDRLP4 4 INDIRP4 CNSTI4 92 ADDP4 CNSTP4 0 ASGNP4 ADDRLP4 0 ADDRLP4 592 INDIRP4 ASGNP4 ADDRGP4 $160 JUMPV LABELV $157 LABELV $158 ADDRLP4 0 ADDRLP4 0 INDIRP4 CNSTI4 92 ADDP4 INDIRP4 ASGNP4 LABELV $160 ADDRLP4 672 CNSTU4 0 ASGNU4 ADDRLP4 0 INDIRP4 CVPU4 4 ADDRLP4 672 INDIRU4 EQU4 $161 ADDRLP4 0 INDIRP4 CNSTI4 92 ADDP4 INDIRP4 CVPU4 4 ADDRLP4 672 INDIRU4 NEU4 $157 LABELV $161 ADDRLP4 0 INDIRP4 CVPU4 4 CNSTU4 0 NEU4 $162 ADDRLP4 592 ADDRLP4 4 INDIRP4 ASGNP4 ADDRLP4 4 INDIRP4 CNSTI4 96 ADDP4 CNSTP4 0 ASGNP4 ADDRGP4 $163 JUMPV LABELV $162 ADDRLP4 0 INDIRP4 CNSTI4 92 ADDP4 ADDRLP4 4 INDIRP4 ASGNP4 ADDRLP4 4 INDIRP4 CNSTI4 96 ADDP4 ADDRLP4 0 INDIRP4 ASGNP4 LABELV $163 ADDRLP4 264+260 INDIRI4 CNSTI4 512 BANDI4 CNSTI4 0 EQI4 $164 ADDRLP4 652 CNSTI4 1 ASGNI4 ADDRGP4 $148 JUMPV LABELV $164 ADDRLP4 264+260 INDIRI4 CNSTI4 1024 BANDI4 CNSTI4 0 EQI4 $167 ADDRLP4 652 CNSTI4 2 ASGNI4 ADDRGP4 $148 JUMPV LABELV $167 ADDRLP4 264+260 INDIRI4 CNSTI4 256 BANDI4 CNSTI4 0 EQI4 $148 ADDRLP4 264 ARGP4 CNSTI4 6 ARGI4 ADDRLP4 8 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop LABELV $171 LABELV $147 ADDRGP4 $146 JUMPV LABELV $148 ADDRLP4 660 CNSTU4 0 ASGNU4 ADDRLP4 592 INDIRP4 CVPU4 4 ADDRLP4 660 INDIRU4 EQU4 $175 ADDRLP4 592 INDIRP4 CNSTI4 92 ADDP4 INDIRP4 CVPU4 4 ADDRLP4 660 INDIRU4 NEU4 $173 LABELV $175 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRGP4 $176 ARGP4 ADDRGP4 trap_EA_SayTeam CALLV pop ADDRLP4 592 INDIRP4 ARGP4 ADDRGP4 BotFreeWaypoints CALLV pop ADDRLP4 592 CNSTP4 0 ASGNP4 CNSTI4 0 RETI4 ADDRGP4 $145 JUMPV LABELV $173 ADDRFP4 0 INDIRP4 CNSTI4 8972 ADDP4 INDIRP4 ARGP4 ADDRGP4 BotFreeWaypoints CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 8972 ADDP4 ADDRLP4 592 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 CNSTI4 8976 ADDP4 ADDRFP4 0 INDIRP4 CNSTI4 8972 ADDP4 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 CNSTI4 8980 ADDP4 ADDRLP4 652 INDIRI4 ASGNI4 CNSTI4 1 RETI4 LABELV $145 endproc BotGetPatrolWaypoints 680 16 export BotAddressedToBot proc BotAddressedToBot 1572 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 840 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 840 ARGP4 ADDRLP4 1228 ADDRGP4 ClientOnSameTeamFromName CALLI4 ASGNI4 ADDRLP4 1096 ADDRLP4 1228 INDIRI4 ASGNI4 ADDRLP4 1096 INDIRI4 CNSTI4 0 GEI4 $178 CNSTI4 0 RETI4 ADDRGP4 $177 JUMPV LABELV $178 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 2 BANDI4 CNSTI4 0 EQI4 $180 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 2 ARGI4 ADDRLP4 584 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRLP4 1100 ARGP4 CNSTI4 128 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRGP4 $183 JUMPV LABELV $182 ADDRLP4 0+256 INDIRI4 CNSTI4 101 NEI4 $185 CNSTI4 1 RETI4 ADDRGP4 $177 JUMPV LABELV $185 ADDRLP4 0+256 INDIRI4 CNSTI4 102 NEI4 $188 ADDRLP4 0 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 328 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 328 ARGP4 ADDRLP4 1232 ADDRGP4 qk_strlen CALLU4 ASGNU4 ADDRLP4 1232 INDIRU4 CNSTU4 0 EQU4 $191 ADDRLP4 1100 ARGP4 ADDRLP4 328 ARGP4 ADDRLP4 1236 ADDRGP4 stristr CALLP4 ASGNP4 ADDRLP4 1236 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $193 CNSTI4 1 RETI4 ADDRGP4 $177 JUMPV LABELV $193 ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 ADDRLP4 328 ARGP4 ADDRLP4 1240 ADDRGP4 stristr CALLP4 ASGNP4 ADDRLP4 1240 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $195 CNSTI4 1 RETI4 ADDRGP4 $177 JUMPV LABELV $195 LABELV $191 ADDRLP4 0 ARGP4 CNSTI4 6 ARGI4 ADDRLP4 584 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRGP4 $189 JUMPV LABELV $188 ADDRLP4 0 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 328 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 328 ARGP4 ADDRLP4 1232 ADDRGP4 qk_strlen CALLU4 ASGNU4 ADDRLP4 1232 INDIRU4 CNSTU4 0 EQU4 $184 ADDRLP4 1100 ARGP4 ADDRLP4 328 ARGP4 ADDRLP4 1236 ADDRGP4 stristr CALLP4 ASGNP4 ADDRLP4 1236 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $199 CNSTI4 1 RETI4 ADDRGP4 $177 JUMPV LABELV $199 ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 ADDRLP4 328 ARGP4 ADDRLP4 1240 ADDRGP4 stristr CALLP4 ASGNP4 ADDRLP4 1240 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $184 CNSTI4 1 RETI4 ADDRGP4 $177 JUMPV LABELV $189 LABELV $183 ADDRLP4 584 ARGP4 ADDRLP4 0 ARGP4 CNSTU4 32 ARGU4 ADDRLP4 1232 ADDRGP4 trap_BotFindMatch CALLI4 ASGNI4 ADDRLP4 1232 INDIRI4 CNSTI4 0 NEI4 $182 LABELV $184 CNSTI4 0 RETI4 ADDRGP4 $177 JUMPV LABELV $180 ADDRLP4 1232+256 CNSTI4 0 ASGNI4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 1232 ARGP4 CNSTU4 128 ARGU4 ADDRLP4 1560 ADDRGP4 trap_BotFindMatch CALLI4 ASGNI4 ADDRLP4 1560 INDIRI4 CNSTI4 0 EQI4 $207 ADDRLP4 1232+256 INDIRI4 CNSTI4 202 EQI4 $204 LABELV $207 ADDRLP4 1564 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 1568 ADDRGP4 NumPlayersOnSameTeam CALLI4 ASGNI4 ADDRLP4 1564 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 CNSTF4 1065353216 ADDRLP4 1568 INDIRI4 CNSTI4 1 SUBI4 CVIF4 4 DIVF4 LEF4 $208 CNSTI4 0 RETI4 ADDRGP4 $177 JUMPV LABELV $208 LABELV $204 CNSTI4 1 RETI4 LABELV $177 endproc BotAddressedToBot 1572 16 export BotGPSToPosition proc BotGPSToPosition 24 12 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 0 CNSTI4 0 ASGNI4 ADDRLP4 8 CNSTI4 0 ASGNI4 LABELV $211 ADDRLP4 4 CNSTI4 0 ASGNI4 ADDRGP4 $216 JUMPV LABELV $215 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $216 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 ADDP4 INDIRI1 CVII4 1 CNSTI4 32 EQI4 $215 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 ADDP4 INDIRI1 CVII4 1 CNSTI4 45 NEI4 $218 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 ADDRLP4 12 CNSTI4 -1 ASGNI4 ADDRGP4 $221 JUMPV LABELV $218 ADDRLP4 12 CNSTI4 1 ASGNI4 ADDRGP4 $221 JUMPV LABELV $220 ADDRLP4 16 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 ADDP4 INDIRI1 CVII4 1 ASGNI4 ADDRLP4 16 INDIRI4 CNSTI4 48 LTI4 $223 ADDRLP4 16 INDIRI4 CNSTI4 57 GTI4 $223 ADDRLP4 4 CNSTI4 10 ADDRLP4 4 INDIRI4 MULI4 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 ADDP4 INDIRI1 CVII4 1 ADDI4 CNSTI4 48 SUBI4 ASGNI4 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 ADDRGP4 $224 JUMPV LABELV $223 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 ADDRGP4 $222 JUMPV LABELV $224 LABELV $221 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 ADDP4 INDIRI1 CVII4 1 CNSTI4 0 NEI4 $220 LABELV $222 CNSTI4 1 ARGI4 ADDRGP4 $225 ARGP4 ADDRLP4 12 INDIRI4 ADDRLP4 4 INDIRI4 MULI4 ARGI4 ADDRGP4 BotAI_Print CALLV pop ADDRLP4 8 INDIRI4 CNSTI4 2 LSHI4 ADDRFP4 4 INDIRP4 ADDP4 ADDRLP4 12 INDIRI4 CVIF4 4 ADDRLP4 4 INDIRI4 CVIF4 4 MULF4 ASGNF4 LABELV $212 ADDRLP4 8 ADDRLP4 8 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 ADDRLP4 8 INDIRI4 CNSTI4 3 LTI4 $211 CNSTI4 1 RETI4 LABELV $210 endproc BotGPSToPosition 24 12 export BotMatch_HelpAccompany proc BotMatch_HelpAccompany 1272 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 1248 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 1248 INDIRI4 CNSTI4 0 NEI4 $227 ADDRGP4 $226 JUMPV LABELV $227 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 1252 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 1252 INDIRI4 CNSTI4 0 NEI4 $229 ADDRGP4 $226 JUMPV LABELV $229 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 260 ARGP4 ADDRLP4 656 ARGP4 CNSTU4 16 ARGU4 ADDRLP4 1256 ADDRGP4 trap_BotFindMatch CALLI4 ASGNI4 ADDRLP4 1256 INDIRI4 CNSTI4 0 EQI4 $231 ADDRLP4 656+256 INDIRI4 CNSTI4 100 NEI4 $231 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 4 ARGP4 ADDRLP4 1260 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 1260 INDIRI4 ASGNI4 ADDRLP4 984 CNSTI4 0 ASGNI4 ADDRGP4 $232 JUMPV LABELV $231 ADDRLP4 260 ARGP4 ADDRLP4 1260 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 1260 INDIRI4 ASGNI4 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 NEI4 $234 ADDRLP4 984 CNSTI4 0 ASGNI4 ADDRGP4 $235 JUMPV LABELV $234 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 1264 ADDRGP4 BotSameTeam CALLI4 ASGNI4 ADDRLP4 1264 INDIRI4 CNSTI4 0 NEI4 $236 ADDRGP4 $226 JUMPV LABELV $236 ADDRLP4 984 CNSTI4 1 ASGNI4 LABELV $235 LABELV $232 ADDRLP4 0 INDIRI4 CNSTI4 0 GEI4 $238 ADDRLP4 984 INDIRI4 CNSTI4 0 EQI4 $240 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $242 ARGP4 ADDRLP4 260 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $241 JUMPV LABELV $240 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $242 ARGP4 ADDRLP4 4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop LABELV $241 ADDRLP4 4 ARGP4 ADDRLP4 1260 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 1260 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $226 JUMPV LABELV $238 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 NEI4 $243 ADDRGP4 $226 JUMPV LABELV $243 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 CNSTI4 -1 ASGNI4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 516 ARGP4 ADDRGP4 BotEntityInfo CALLV pop ADDRLP4 516 INDIRI4 CNSTI4 0 EQI4 $245 ADDRLP4 516+24 ARGP4 ADDRLP4 1260 ADDRGP4 BotPointAreaNum CALLI4 ASGNI4 ADDRLP4 988 ADDRLP4 1260 INDIRI4 ASGNI4 ADDRLP4 988 INDIRI4 CNSTI4 0 EQI4 $248 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6632 ADDP4 ADDRLP4 988 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6620 ADDP4 ADDRLP4 516+24 INDIRB ASGNB 12 ADDRFP4 0 INDIRP4 CNSTI4 6636 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6640 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6644 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6648 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6652 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6656 ADDP4 CNSTF4 1090519040 ASGNF4 LABELV $248 LABELV $245 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 INDIRI4 CNSTI4 0 GEI4 $251 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 1 BANDI4 CNSTI4 0 EQI4 $253 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 3 ARGI4 ADDRLP4 992 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 992 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6620 ADDP4 ARGP4 ADDRLP4 1264 ADDRGP4 BotGetMessageTeamGoal CALLI4 ASGNI4 ADDRLP4 1264 INDIRI4 CNSTI4 0 NEI4 $255 ADDRGP4 $226 JUMPV LABELV $255 LABELV $253 LABELV $251 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 INDIRI4 CNSTI4 0 GEI4 $257 ADDRLP4 984 INDIRI4 CNSTI4 0 EQI4 $259 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $261 ARGP4 ADDRLP4 260 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $260 JUMPV LABELV $259 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $262 ARGP4 ADDRLP4 4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop LABELV $260 ADDRLP4 4 ARGP4 ADDRLP4 1260 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 1260 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 INDIRI4 ARGI4 CNSTI4 1 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $226 JUMPV LABELV $257 ADDRFP4 0 INDIRP4 CNSTI4 6600 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 4 ARGP4 ADDRLP4 1260 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 1260 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6744 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 1264 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 1264 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 1268 ADDRGP4 BotGetTime CALLF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRLP4 1268 INDIRF4 ASGNF4 ADDRFP4 4 INDIRP4 CNSTI4 256 ADDP4 INDIRI4 CNSTI4 3 NEI4 $263 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 INDIRF4 CNSTF4 0 NEF4 $264 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1114636288 ADDF4 ASGNF4 ADDRGP4 $264 JUMPV LABELV $263 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 2 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 INDIRF4 CNSTF4 0 NEF4 $267 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1142292480 ADDF4 ASGNF4 LABELV $267 ADDRFP4 0 INDIRP4 CNSTI4 7008 ADDP4 CNSTF4 1121976320 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6172 ADDP4 CNSTF4 0 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotRememberLastOrderedTask CALLV pop LABELV $264 LABELV $226 endproc BotMatch_HelpAccompany 1272 16 export BotMatch_DefendKeyArea proc BotMatch_DefendKeyArea 544 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 516 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 516 INDIRI4 CNSTI4 0 NEI4 $270 ADDRGP4 $269 JUMPV LABELV $270 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 520 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 520 INDIRI4 CNSTI4 0 NEI4 $272 ADDRGP4 $269 JUMPV LABELV $272 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 5 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6620 ADDP4 ARGP4 ADDRLP4 528 ADDRGP4 BotGetMessageTeamGoal CALLI4 ASGNI4 ADDRLP4 528 INDIRI4 CNSTI4 0 NEI4 $274 ADDRGP4 $269 JUMPV LABELV $274 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 256 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 256 ARGP4 ADDRLP4 532 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 512 ADDRLP4 532 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 512 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 536 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 536 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 3 ASGNI4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 540 ADDRGP4 BotGetTime CALLF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRLP4 540 INDIRF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 INDIRF4 CNSTF4 0 NEF4 $276 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1142292480 ADDF4 ASGNF4 LABELV $276 ADDRFP4 0 INDIRP4 CNSTI4 6144 ADDP4 CNSTF4 0 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotRememberLastOrderedTask CALLV pop LABELV $269 endproc BotMatch_DefendKeyArea 544 16 export BotMatch_GetItem proc BotMatch_GetItem 540 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 516 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 516 INDIRI4 CNSTI4 0 NEI4 $279 ADDRGP4 $278 JUMPV LABELV $279 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 520 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 520 INDIRI4 CNSTI4 0 NEI4 $281 ADDRGP4 $278 JUMPV LABELV $281 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 3 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6620 ADDP4 ARGP4 ADDRLP4 528 ADDRGP4 BotGetMessageTeamGoal CALLI4 ASGNI4 ADDRLP4 528 INDIRI4 CNSTI4 0 NEI4 $283 ADDRGP4 $278 JUMPV LABELV $283 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 256 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 256 ARGP4 ADDRLP4 532 ADDRGP4 ClientOnSameTeamFromName CALLI4 ASGNI4 ADDRLP4 512 ADDRLP4 532 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 512 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 536 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 536 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 10 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1114636288 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop LABELV $278 endproc BotMatch_GetItem 540 16 export BotMatch_Camp proc BotMatch_Camp 688 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 660 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 660 INDIRI4 CNSTI4 0 NEI4 $286 ADDRGP4 $285 JUMPV LABELV $286 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 664 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 664 INDIRI4 CNSTI4 0 NEI4 $288 ADDRGP4 $285 JUMPV LABELV $288 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 4 ARGP4 ADDRLP4 668 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 668 INDIRI4 ASGNI4 ADDRLP4 0 INDIRI4 CNSTI4 0 GEI4 $290 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $242 ARGP4 ADDRLP4 4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 CNSTI4 1 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $285 JUMPV LABELV $290 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 5 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 64 BANDI4 CNSTI4 0 EQI4 $292 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 ADDRFP4 0 INDIRP4 CNSTI4 12 ADDP4 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6632 ADDP4 ADDRFP4 0 INDIRP4 CNSTI4 4948 ADDP4 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6620 ADDP4 ADDRFP4 0 INDIRP4 CNSTI4 4908 ADDP4 INDIRB ASGNB 12 ADDRFP4 0 INDIRP4 CNSTI4 6636 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6640 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6644 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6648 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6652 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6656 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRGP4 $293 JUMPV LABELV $292 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 32 BANDI4 CNSTI4 0 EQI4 $294 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 NEI4 $296 ADDRGP4 $285 JUMPV LABELV $296 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 CNSTI4 -1 ASGNI4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 516 ARGP4 ADDRGP4 BotEntityInfo CALLV pop ADDRLP4 516 INDIRI4 CNSTI4 0 EQI4 $298 ADDRLP4 516+24 ARGP4 ADDRLP4 672 ADDRGP4 BotPointAreaNum CALLI4 ASGNI4 ADDRLP4 656 ADDRLP4 672 INDIRI4 ASGNI4 ADDRLP4 656 INDIRI4 CNSTI4 0 EQI4 $301 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6632 ADDP4 ADDRLP4 656 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6620 ADDP4 ADDRLP4 516+24 INDIRB ASGNB 12 ADDRFP4 0 INDIRP4 CNSTI4 6636 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6640 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6644 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6648 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6652 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6656 ADDP4 CNSTF4 1090519040 ASGNF4 LABELV $301 LABELV $298 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 INDIRI4 CNSTI4 0 GEI4 $295 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $262 ARGP4 ADDRLP4 4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRLP4 4 ARGP4 ADDRLP4 672 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 672 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $285 JUMPV LABELV $294 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 260 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6620 ADDP4 ARGP4 ADDRLP4 676 ADDRGP4 BotGetMessageTeamGoal CALLI4 ASGNI4 ADDRLP4 676 INDIRI4 CNSTI4 0 NEI4 $306 ADDRGP4 $285 JUMPV LABELV $306 LABELV $295 LABELV $293 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 680 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 680 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 8 ASGNI4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 684 ADDRGP4 BotGetTime CALLF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRLP4 684 INDIRF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 INDIRF4 CNSTF4 0 NEF4 $308 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1142292480 ADDF4 ASGNF4 LABELV $308 ADDRFP4 0 INDIRP4 CNSTI4 6172 ADDP4 CNSTF4 0 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotRememberLastOrderedTask CALLV pop LABELV $285 endproc BotMatch_Camp 688 16 export BotMatch_Patrol proc BotMatch_Patrol 284 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 260 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $311 ADDRGP4 $310 JUMPV LABELV $311 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 264 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 264 INDIRI4 CNSTI4 0 NEI4 $313 ADDRGP4 $310 JUMPV LABELV $313 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 268 ADDRGP4 BotGetPatrolWaypoints CALLI4 ASGNI4 ADDRLP4 268 INDIRI4 CNSTI4 0 NEI4 $315 ADDRGP4 $310 JUMPV LABELV $315 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 272 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 272 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 256 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 276 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 276 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 9 ASGNI4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 280 ADDRGP4 BotGetTime CALLF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRLP4 280 INDIRF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 INDIRF4 CNSTF4 0 NEF4 $317 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1142292480 ADDF4 ASGNF4 LABELV $317 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotRememberLastOrderedTask CALLV pop LABELV $310 endproc BotMatch_Patrol 284 16 export BotMatch_GetFlag proc BotMatch_GetFlag 276 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRGP4 gametype INDIRI4 CNSTI4 4 NEI4 $319 ADDRLP4 260 CNSTI4 0 ASGNI4 ADDRGP4 ctf_redflag+12 INDIRI4 ADDRLP4 260 INDIRI4 EQI4 $326 ADDRGP4 ctf_blueflag+12 INDIRI4 ADDRLP4 260 INDIRI4 NEI4 $321 LABELV $326 ADDRGP4 $319 JUMPV LABELV $321 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 260 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $327 ADDRGP4 $319 JUMPV LABELV $327 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 264 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 264 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 256 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 268 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 268 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1142292480 ADDF4 ASGNF4 ADDRGP4 gametype INDIRI4 CNSTI4 4 NEI4 $329 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 272 ADDRGP4 BotOppositeTeam CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 272 INDIRI4 ARGI4 ADDRGP4 BotGetAlternateRouteGoal CALLI4 pop LABELV $329 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotRememberLastOrderedTask CALLV pop LABELV $319 endproc BotMatch_GetFlag 276 16 export BotMatch_AttackEnemyBase proc BotMatch_AttackEnemyBase 272 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRGP4 gametype INDIRI4 CNSTI4 4 NEI4 $331 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRGP4 BotMatch_GetFlag CALLV pop LABELV $333 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 260 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $334 ADDRGP4 $331 JUMPV LABELV $334 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 264 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 264 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 256 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 268 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 268 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 13 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1142292480 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6156 ADDP4 CNSTF4 0 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotRememberLastOrderedTask CALLV pop LABELV $331 endproc BotMatch_AttackEnemyBase 272 16 export BotMatch_RushBase proc BotMatch_RushBase 272 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRGP4 gametype INDIRI4 CNSTI4 4 NEI4 $336 ADDRLP4 260 CNSTI4 0 ASGNI4 ADDRGP4 ctf_redflag+12 INDIRI4 ADDRLP4 260 INDIRI4 EQI4 $343 ADDRGP4 ctf_blueflag+12 INDIRI4 ADDRLP4 260 INDIRI4 NEI4 $338 LABELV $343 ADDRGP4 $336 JUMPV LABELV $338 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 260 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $344 ADDRGP4 $336 JUMPV LABELV $344 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 264 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 264 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 256 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 268 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 268 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 5 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1123024896 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6152 ADDP4 CNSTF4 0 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop LABELV $336 endproc BotMatch_RushBase 272 16 export BotMatch_TaskPreference proc BotMatch_TaskPreference 320 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 36 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRLP4 260 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 ARGP4 ADDRLP4 300 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 300 INDIRI4 CNSTI4 0 EQI4 $347 ADDRGP4 $346 JUMPV LABELV $347 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 4 ARGP4 ADDRLP4 304 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 304 INDIRI4 ASGNI4 ADDRLP4 0 INDIRI4 CNSTI4 0 GEI4 $349 ADDRGP4 $346 JUMPV LABELV $349 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 308 ADDRGP4 BotGetTeamMateTaskPreference CALLI4 ASGNI4 ADDRLP4 296 ADDRLP4 308 INDIRI4 ASGNI4 ADDRLP4 312 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 ASGNI4 ADDRLP4 312 INDIRI4 CNSTI4 1 EQI4 $354 ADDRLP4 312 INDIRI4 CNSTI4 2 EQI4 $355 ADDRLP4 312 INDIRI4 CNSTI4 4 EQI4 $356 ADDRGP4 $351 JUMPV LABELV $354 ADDRLP4 296 ADDRLP4 296 INDIRI4 CNSTI4 -3 BANDI4 ASGNI4 ADDRLP4 296 ADDRLP4 296 INDIRI4 CNSTI4 1 BORI4 ASGNI4 ADDRGP4 $352 JUMPV LABELV $355 ADDRLP4 296 ADDRLP4 296 INDIRI4 CNSTI4 -2 BANDI4 ASGNI4 ADDRLP4 296 ADDRLP4 296 INDIRI4 CNSTI4 2 BORI4 ASGNI4 ADDRGP4 $352 JUMPV LABELV $356 ADDRLP4 296 ADDRLP4 296 INDIRI4 CNSTI4 -4 BANDI4 ASGNI4 LABELV $351 LABELV $352 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 296 INDIRI4 ARGI4 ADDRGP4 BotSetTeamMateTaskPreference CALLV pop ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 EasyClientName CALLP4 pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $357 ARGP4 ADDRLP4 4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 ARGI4 ADDRGP4 $358 ARGP4 ADDRGP4 BotVoiceChatOnly CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 CNSTI4 1048576 ARGI4 ADDRGP4 trap_EA_Action CALLV pop LABELV $346 endproc BotMatch_TaskPreference 320 16 export BotMatch_ReturnFlag proc BotMatch_ReturnFlag 272 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRGP4 gametype INDIRI4 CNSTI4 4 EQI4 $360 ADDRGP4 $359 JUMPV LABELV $360 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 260 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $362 ADDRGP4 $359 JUMPV LABELV $362 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 264 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 264 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 256 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6608 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6612 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRLP4 268 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 268 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 6 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1127481344 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6152 ADDP4 CNSTF4 0 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop LABELV $359 endproc BotMatch_ReturnFlag 272 16 export BotMatch_JoinSubteam proc BotMatch_JoinSubteam 528 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 516 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 516 INDIRI4 CNSTI4 0 NEI4 $365 ADDRGP4 $364 JUMPV LABELV $365 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 520 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 520 INDIRI4 CNSTI4 0 NEI4 $367 ADDRGP4 $364 JUMPV LABELV $367 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 ADDRLP4 0 ARGP4 CNSTU4 32 ARGU4 ADDRGP4 qk_strncpy CALLP4 pop ADDRFP4 0 INDIRP4 CNSTI4 7007 ADDP4 CNSTI1 0 ASGNI1 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 256 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $369 ARGP4 ADDRLP4 0 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRLP4 256 ARGP4 ADDRLP4 524 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 512 ADDRLP4 524 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 512 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop LABELV $364 endproc BotMatch_JoinSubteam 528 16 export BotMatch_LeaveSubteam proc BotMatch_LeaveSubteam 280 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRLP4 260 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $371 ADDRGP4 $370 JUMPV LABELV $371 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 264 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 264 INDIRI4 CNSTI4 0 NEI4 $373 ADDRGP4 $370 JUMPV LABELV $373 ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 ADDRLP4 268 ADDRGP4 qk_strlen CALLU4 ASGNU4 ADDRLP4 268 INDIRU4 CNSTU4 0 EQU4 $375 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $377 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 276 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 276 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 256 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop LABELV $375 ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 ADDRGP4 $378 ARGP4 ADDRGP4 qk_strcpy CALLP4 pop LABELV $370 endproc BotMatch_LeaveSubteam 280 16 export BotMatch_WhichTeam proc BotMatch_WhichTeam 16 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRLP4 0 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 0 INDIRI4 CNSTI4 0 NEI4 $380 ADDRGP4 $379 JUMPV LABELV $380 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 4 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 4 INDIRI4 CNSTI4 0 NEI4 $382 ADDRGP4 $379 JUMPV LABELV $382 ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 ADDRLP4 8 ADDRGP4 qk_strlen CALLU4 ASGNU4 ADDRLP4 8 INDIRU4 CNSTU4 0 EQU4 $384 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $386 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6976 ADDP4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $385 JUMPV LABELV $384 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $387 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop LABELV $385 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 CNSTI4 1 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop LABELV $379 endproc BotMatch_WhichTeam 16 16 export BotMatch_CheckPoint proc BotMatch_CheckPoint 572 24 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 536 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 536 INDIRI4 CNSTI4 0 NEI4 $389 ADDRGP4 $388 JUMPV LABELV $389 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 5 ARGI4 ADDRLP4 16 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 540 CNSTF4 0 ASGNF4 ADDRLP4 4+8 ADDRLP4 540 INDIRF4 ASGNF4 ADDRLP4 4+4 ADDRLP4 540 INDIRF4 ASGNF4 ADDRLP4 4 ADDRLP4 540 INDIRF4 ASGNF4 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 276 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 276 ARGP4 ADDRLP4 544 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 532 ADDRLP4 544 INDIRI4 ASGNI4 ADDRLP4 16 ARGP4 ADDRGP4 $393 ARGP4 ADDRLP4 4 ARGP4 ADDRLP4 4+4 ARGP4 ADDRLP4 4+8 ARGP4 ADDRGP4 qk_sscanf CALLI4 pop ADDRLP4 4+8 ADDRLP4 4+8 INDIRF4 CNSTF4 1056964608 ADDF4 ASGNF4 ADDRLP4 4 ARGP4 ADDRLP4 548 ADDRGP4 BotPointAreaNum CALLI4 ASGNI4 ADDRLP4 272 ADDRLP4 548 INDIRI4 ASGNI4 ADDRLP4 272 INDIRI4 CNSTI4 0 NEI4 $397 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 552 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 552 INDIRI4 CNSTI4 0 EQI4 $388 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $401 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 532 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $388 JUMPV LABELV $397 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 6 ARGI4 ADDRLP4 16 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 8968 ADDP4 INDIRP4 ARGP4 ADDRLP4 16 ARGP4 ADDRLP4 552 ADDRGP4 BotFindWayPoint CALLP4 ASGNP4 ADDRLP4 0 ADDRLP4 552 INDIRP4 ASGNP4 ADDRLP4 0 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $402 ADDRLP4 0 INDIRP4 CNSTI4 92 ADDP4 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $404 ADDRLP4 560 CNSTI4 96 ASGNI4 ADDRLP4 0 INDIRP4 CNSTI4 92 ADDP4 INDIRP4 ADDRLP4 560 INDIRI4 ADDP4 ADDRLP4 0 INDIRP4 ADDRLP4 560 INDIRI4 ADDP4 INDIRP4 ASGNP4 LABELV $404 ADDRLP4 0 INDIRP4 CNSTI4 96 ADDP4 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $406 ADDRLP4 568 CNSTI4 92 ASGNI4 ADDRLP4 0 INDIRP4 CNSTI4 96 ADDP4 INDIRP4 ADDRLP4 568 INDIRI4 ADDP4 ADDRLP4 0 INDIRP4 ADDRLP4 568 INDIRI4 ADDP4 INDIRP4 ASGNP4 ADDRGP4 $407 JUMPV LABELV $406 ADDRFP4 0 INDIRP4 CNSTI4 8968 ADDP4 ADDRLP4 0 INDIRP4 CNSTI4 92 ADDP4 INDIRP4 ASGNP4 LABELV $407 ADDRLP4 0 INDIRP4 CNSTI4 0 ASGNI4 LABELV $402 ADDRLP4 16 ARGP4 ADDRLP4 4 ARGP4 ADDRLP4 272 INDIRI4 ARGI4 ADDRLP4 556 ADDRGP4 BotCreateWayPoint CALLP4 ASGNP4 ADDRLP4 0 ADDRLP4 556 INDIRP4 ASGNP4 ADDRLP4 0 INDIRP4 CNSTI4 92 ADDP4 ADDRFP4 0 INDIRP4 CNSTI4 8968 ADDP4 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 CNSTI4 8968 ADDP4 INDIRP4 CVPU4 4 CNSTU4 0 EQU4 $408 ADDRFP4 0 INDIRP4 CNSTI4 8968 ADDP4 INDIRP4 CNSTI4 96 ADDP4 ADDRLP4 0 INDIRP4 ASGNP4 LABELV $408 ADDRFP4 0 INDIRP4 CNSTI4 8968 ADDP4 ADDRLP4 0 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 560 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 560 INDIRI4 CNSTI4 0 EQI4 $410 ADDRLP4 16 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 $412 ARGP4 ADDRLP4 0 INDIRP4 CNSTI4 36 ADDP4 INDIRF4 ARGF4 ADDRLP4 0 INDIRP4 CNSTI4 40 ADDP4 INDIRF4 ARGF4 ADDRLP4 0 INDIRP4 CNSTI4 44 ADDP4 INDIRF4 ARGF4 ADDRGP4 Com_sprintf CALLI4 pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $413 ARGP4 ADDRLP4 0 INDIRP4 CNSTI4 4 ADDP4 ARGP4 ADDRLP4 16 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 532 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop LABELV $410 LABELV $388 endproc BotMatch_CheckPoint 572 24 export BotMatch_FormationSpace proc BotMatch_FormationSpace 280 16 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 260 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $415 ADDRGP4 $414 JUMPV LABELV $415 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 264 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 264 INDIRI4 CNSTI4 0 NEI4 $417 ADDRGP4 $414 JUMPV LABELV $417 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 5 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 8 BANDI4 CNSTI4 0 EQI4 $419 ADDRLP4 4 ARGP4 ADDRLP4 268 ADDRGP4 qk_atof CALLF4 ASGNF4 ADDRLP4 0 CNSTF4 1092357823 ADDRLP4 268 INDIRF4 MULF4 ASGNF4 ADDRGP4 $420 JUMPV LABELV $419 ADDRLP4 4 ARGP4 ADDRLP4 272 ADDRGP4 qk_atof CALLF4 ASGNF4 ADDRLP4 0 CNSTF4 1107296256 ADDRLP4 272 INDIRF4 MULF4 ASGNF4 LABELV $420 ADDRLP4 0 INDIRF4 CNSTF4 1111490560 LTF4 $423 ADDRLP4 0 INDIRF4 CNSTF4 1140457472 LEF4 $421 LABELV $423 ADDRLP4 0 CNSTF4 1120403456 ASGNF4 LABELV $421 ADDRFP4 0 INDIRP4 CNSTI4 7008 ADDP4 ADDRLP4 0 INDIRF4 ASGNF4 LABELV $414 endproc BotMatch_FormationSpace 280 16 export BotMatch_Dismiss proc BotMatch_Dismiss 272 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRLP4 260 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $425 ADDRGP4 $424 JUMPV LABELV $425 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 264 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 264 INDIRI4 CNSTI4 0 NEI4 $427 ADDRGP4 $424 JUMPV LABELV $427 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 268 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 268 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6604 ADDP4 ADDRLP4 256 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 0 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6880 ADDP4 CNSTF4 0 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6756 ADDP4 CNSTI4 0 ASGNI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $429 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 256 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop LABELV $424 endproc BotMatch_Dismiss 272 16 export BotMatch_Suicide proc BotMatch_Suicide 272 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRLP4 260 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $431 ADDRGP4 $430 JUMPV LABELV $431 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 264 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 264 INDIRI4 CNSTI4 0 NEI4 $433 ADDRGP4 $430 JUMPV LABELV $433 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRGP4 $435 ARGP4 ADDRGP4 trap_EA_Command CALLV pop ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 268 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 268 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 256 INDIRI4 ARGI4 ADDRGP4 $436 ARGP4 ADDRGP4 BotVoiceChat CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 CNSTI4 1048576 ARGI4 ADDRGP4 trap_EA_Action CALLV pop LABELV $430 endproc BotMatch_Suicide 272 16 export BotMatch_StartTeamLeaderShip proc BotMatch_StartTeamLeaderShip 268 16 ADDRLP4 260 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $438 ADDRGP4 $437 JUMPV LABELV $438 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 128 BANDI4 CNSTI4 0 EQI4 $440 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 ARGP4 ADDRLP4 0 ARGP4 CNSTU4 32 ARGU4 ADDRGP4 qk_strncpy CALLP4 pop ADDRFP4 0 INDIRP4 CNSTI4 6896 CNSTU4 31 ADDI4 ADDP4 CNSTI1 0 ASGNI1 ADDRGP4 $441 JUMPV LABELV $440 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 264 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 264 INDIRI4 ASGNI4 ADDRLP4 256 INDIRI4 CNSTI4 0 LTI4 $442 ADDRLP4 256 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 ARGP4 CNSTI4 32 ARGI4 ADDRGP4 ClientName CALLP4 pop LABELV $442 LABELV $441 LABELV $437 endproc BotMatch_StartTeamLeaderShip 268 16 export BotMatch_StopTeamLeaderShip proc BotMatch_StopTeamLeaderShip 528 16 ADDRLP4 516 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 516 INDIRI4 CNSTI4 0 NEI4 $445 ADDRGP4 $444 JUMPV LABELV $445 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 128 BANDI4 CNSTI4 0 EQI4 $447 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 260 ARGP4 ADDRLP4 520 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 520 INDIRI4 ASGNI4 ADDRGP4 $448 JUMPV LABELV $447 ADDRLP4 4 ARGP4 ADDRLP4 520 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 520 INDIRI4 ASGNI4 LABELV $448 ADDRLP4 0 INDIRI4 CNSTI4 0 LTI4 $449 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 256 ARGI4 ADDRLP4 520 ADDRGP4 ClientName CALLP4 ASGNP4 ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 ARGP4 ADDRLP4 520 INDIRP4 ARGP4 ADDRLP4 524 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 524 INDIRI4 CNSTI4 0 NEI4 $451 ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 CNSTI1 0 ASGNI1 ADDRLP4 0 INDIRI4 CNSTI4 2 LSHI4 ADDRGP4 notleader ADDP4 CNSTI4 1 ASGNI4 LABELV $451 LABELV $449 LABELV $444 endproc BotMatch_StopTeamLeaderShip 528 16 export BotMatch_WhoIsTeamLeader proc BotMatch_WhoIsTeamLeader 264 12 ADDRLP4 256 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 256 INDIRI4 CNSTI4 0 NEI4 $454 ADDRGP4 $453 JUMPV LABELV $454 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRLP4 0 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 ARGP4 ADDRLP4 260 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 260 INDIRI4 CNSTI4 0 NEI4 $456 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRGP4 $458 ARGP4 ADDRGP4 trap_EA_SayTeam CALLV pop LABELV $456 LABELV $453 endproc BotMatch_WhoIsTeamLeader 264 12 export BotMatch_WhatAreYouDoing proc BotMatch_WhatAreYouDoing 532 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 516 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 516 INDIRI4 CNSTI4 0 NEI4 $460 ADDRGP4 $459 JUMPV LABELV $460 ADDRLP4 520 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 INDIRI4 ASGNI4 ADDRLP4 520 INDIRI4 CNSTI4 1 LTI4 $462 ADDRLP4 520 INDIRI4 CNSTI4 11 GTI4 $462 ADDRLP4 520 INDIRI4 CNSTI4 2 LSHI4 ADDRGP4 $486-4 ADDP4 INDIRP4 JUMPV lit align 4 LABELV $486 address $465 address $467 address $469 address $479 address $481 address $483 address $475 address $475 address $477 address $471 address $473 code LABELV $465 ADDRFP4 0 INDIRP4 CNSTI4 6600 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 EasyClientName CALLP4 pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $466 ARGP4 ADDRLP4 0 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $467 ADDRFP4 0 INDIRP4 CNSTI4 6600 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 EasyClientName CALLP4 pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $468 ARGP4 ADDRLP4 0 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $469 ADDRFP4 0 INDIRP4 CNSTI4 6664 ADDP4 INDIRI4 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotGoalName CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $470 ARGP4 ADDRLP4 260 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $471 ADDRFP4 0 INDIRP4 CNSTI4 6664 ADDP4 INDIRI4 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotGoalName CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $472 ARGP4 ADDRLP4 260 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $473 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $474 ARGP4 ADDRLP4 0 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $475 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $476 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $477 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $478 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $479 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $480 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $481 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $482 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $483 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $484 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $463 JUMPV LABELV $462 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $485 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop LABELV $463 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 528 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 256 ADDRLP4 528 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 256 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop LABELV $459 endproc BotMatch_WhatAreYouDoing 532 16 export BotMatch_WhatIsMyCommand proc BotMatch_WhatIsMyCommand 40 12 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 36 ARGI4 ADDRGP4 ClientName CALLP4 pop ADDRLP4 0 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 ARGP4 ADDRLP4 36 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 36 INDIRI4 CNSTI4 0 EQI4 $489 ADDRGP4 $488 JUMPV LABELV $489 ADDRFP4 0 INDIRP4 CNSTI4 6964 ADDP4 CNSTI4 1 ASGNI4 LABELV $488 endproc BotMatch_WhatIsMyCommand 40 12 export BotNearestVisibleItem proc BotNearestVisibleItem 252 28 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 140 CNSTF4 1232348144 ASGNF4 ADDRLP4 68 CNSTI4 -1 ASGNI4 LABELV $492 ADDRLP4 68 INDIRI4 ARGI4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRLP4 228 ADDRGP4 trap_BotGetLevelItemGoal CALLI4 ASGNI4 ADDRLP4 68 ADDRLP4 228 INDIRI4 ASGNI4 ADDRLP4 0+44 INDIRI4 ARGI4 ADDRLP4 72 ARGP4 CNSTI4 64 ARGI4 ADDRGP4 trap_BotGoalName CALLV pop ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 72 ARGP4 ADDRLP4 232 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 232 INDIRI4 CNSTI4 0 EQI4 $496 ADDRGP4 $493 JUMPV LABELV $496 ADDRLP4 56 ADDRLP4 0 INDIRF4 ADDRFP4 0 INDIRP4 CNSTI4 4908 ADDP4 INDIRF4 SUBF4 ASGNF4 ADDRLP4 56+4 ADDRLP4 0+4 INDIRF4 ADDRFP4 0 INDIRP4 CNSTI4 4912 ADDP4 INDIRF4 SUBF4 ASGNF4 ADDRLP4 56+8 ADDRLP4 0+8 INDIRF4 ADDRFP4 0 INDIRP4 CNSTI4 4916 ADDP4 INDIRF4 SUBF4 ASGNF4 ADDRLP4 56 ARGP4 ADDRLP4 240 ADDRGP4 VectorLength CALLF4 ASGNF4 ADDRLP4 136 ADDRLP4 240 INDIRF4 ASGNF4 ADDRLP4 136 INDIRF4 ADDRLP4 140 INDIRF4 GEF4 $502 ADDRLP4 144 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 4936 ADDP4 ARGP4 ADDRLP4 248 CNSTP4 0 ASGNP4 ADDRLP4 248 INDIRP4 ARGP4 ADDRLP4 248 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 CNSTI4 65537 ARGI4 ADDRGP4 BotAI_Trace CALLV pop ADDRLP4 144+8 INDIRF4 CNSTF4 1065353216 LTF4 $504 ADDRLP4 140 ADDRLP4 136 INDIRF4 ASGNF4 ADDRFP4 8 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 CNSTU4 56 ARGU4 ADDRGP4 qk_memcpy CALLP4 pop LABELV $504 LABELV $502 LABELV $493 ADDRLP4 68 INDIRI4 CNSTI4 0 GTI4 $492 ADDRLP4 140 INDIRF4 RETF4 LABELV $491 endproc BotNearestVisibleItem 252 28 lit align 4 LABELV $508 address $509 address $510 address $511 address $512 address $513 address $514 address $515 address $516 address $517 address $518 address $519 address $520 address $521 address $522 address $523 address $524 address $525 byte 4 0 export BotMatch_WhereAreYou code proc BotMatch_WhereAreYou 444 20 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRLP4 8 ADDRGP4 $508 INDIRB ASGNB 72 ADDRLP4 412 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 412 INDIRI4 CNSTI4 0 NEI4 $526 ADDRGP4 $507 JUMPV LABELV $526 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 416 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 416 INDIRI4 CNSTI4 0 NEI4 $528 ADDRGP4 $507 JUMPV LABELV $528 ADDRLP4 140 CNSTI4 -1 ASGNI4 ADDRLP4 80 CNSTF4 1232348144 ASGNF4 ADDRLP4 0 CNSTI4 0 ASGNI4 ADDRGP4 $533 JUMPV LABELV $530 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 CNSTI4 2 LSHI4 ADDRLP4 8 ADDP4 INDIRP4 ARGP4 ADDRLP4 84 ARGP4 ADDRLP4 420 ADDRGP4 BotNearestVisibleItem CALLF4 ASGNF4 ADDRLP4 4 ADDRLP4 420 INDIRF4 ASGNF4 ADDRLP4 4 INDIRF4 ADDRLP4 80 INDIRF4 GEF4 $534 ADDRLP4 80 ADDRLP4 4 INDIRF4 ASGNF4 ADDRLP4 140 ADDRLP4 0 INDIRI4 ASGNI4 LABELV $534 LABELV $531 ADDRLP4 0 ADDRLP4 0 INDIRI4 CNSTI4 1 ADDI4 ASGNI4 LABELV $533 ADDRLP4 0 INDIRI4 CNSTI4 2 LSHI4 ADDRLP4 8 ADDP4 INDIRP4 CVPU4 4 CNSTU4 0 NEU4 $530 ADDRLP4 140 INDIRI4 CNSTI4 -1 EQI4 $536 ADDRGP4 gametype INDIRI4 CNSTI4 4 NEI4 $538 ADDRFP4 0 INDIRP4 CNSTI4 4948 ADDP4 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 CNSTI4 4908 ADDP4 ARGP4 ADDRGP4 ctf_redflag+12 INDIRI4 ARGI4 CNSTI4 18616254 ARGI4 ADDRLP4 424 ADDRGP4 trap_AAS_AreaTravelTimeToGoalArea CALLI4 ASGNI4 ADDRLP4 404 ADDRLP4 424 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 4948 ADDP4 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 CNSTI4 4908 ADDP4 ARGP4 ADDRGP4 ctf_blueflag+12 INDIRI4 ARGI4 CNSTI4 18616254 ARGI4 ADDRLP4 432 ADDRGP4 trap_AAS_AreaTravelTimeToGoalArea CALLI4 ASGNI4 ADDRLP4 408 ADDRLP4 432 INDIRI4 ASGNI4 ADDRLP4 436 ADDRLP4 404 INDIRI4 ASGNI4 ADDRLP4 436 INDIRI4 CVIF4 4 CNSTF4 1053609165 ADDRLP4 436 INDIRI4 ADDRLP4 408 INDIRI4 ADDI4 CVIF4 4 MULF4 GEF4 $542 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $544 ARGP4 ADDRLP4 140 INDIRI4 CNSTI4 2 LSHI4 ADDRLP4 8 ADDP4 INDIRP4 ARGP4 ADDRGP4 $545 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $539 JUMPV LABELV $542 ADDRLP4 440 ADDRLP4 408 INDIRI4 ASGNI4 ADDRLP4 440 INDIRI4 CVIF4 4 CNSTF4 1053609165 ADDRLP4 404 INDIRI4 ADDRLP4 440 INDIRI4 ADDI4 CVIF4 4 MULF4 GEF4 $546 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $544 ARGP4 ADDRLP4 140 INDIRI4 CNSTI4 2 LSHI4 ADDRLP4 8 ADDP4 INDIRP4 ARGP4 ADDRGP4 $548 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $539 JUMPV LABELV $546 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $549 ARGP4 ADDRLP4 140 INDIRI4 CNSTI4 2 LSHI4 ADDRLP4 8 ADDP4 INDIRP4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $539 JUMPV LABELV $538 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $549 ARGP4 ADDRLP4 140 INDIRI4 CNSTI4 2 LSHI4 ADDRLP4 8 ADDP4 INDIRP4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop LABELV $539 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 144 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 144 ARGP4 ADDRLP4 420 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 400 ADDRLP4 420 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 400 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop LABELV $536 LABELV $507 endproc BotMatch_WhereAreYou 444 20 export BotMatch_LeadTheWay proc BotMatch_LeadTheWay 680 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 ADDRFP4 4 INDIRP4 ASGNP4 ADDRLP4 664 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 664 INDIRI4 CNSTI4 0 NEI4 $551 ADDRGP4 $550 JUMPV LABELV $551 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 668 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 668 INDIRI4 CNSTI4 0 NEI4 $553 ADDRGP4 $550 JUMPV LABELV $553 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 2048 BANDI4 CNSTI4 0 EQI4 $555 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 400 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 400 ARGP4 ADDRLP4 672 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 672 INDIRI4 ASGNI4 ADDRLP4 0 INDIRI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 NEI4 $557 ADDRLP4 656 CNSTI4 0 ASGNI4 ADDRGP4 $556 JUMPV LABELV $557 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 676 ADDRGP4 BotSameTeam CALLI4 ASGNI4 ADDRLP4 676 INDIRI4 CNSTI4 0 NEI4 $559 ADDRGP4 $550 JUMPV LABELV $559 ADDRLP4 656 CNSTI4 1 ASGNI4 ADDRGP4 $556 JUMPV LABELV $555 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 144 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 144 ARGP4 ADDRLP4 672 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 672 INDIRI4 ASGNI4 ADDRLP4 656 CNSTI4 0 ASGNI4 LABELV $556 ADDRLP4 0 INDIRI4 CNSTI4 0 GEI4 $561 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $242 ARGP4 ADDRLP4 144 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 CNSTI4 1 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $550 JUMPV LABELV $561 ADDRFP4 0 INDIRP4 CNSTI4 6864 ADDP4 CNSTI4 -1 ASGNI4 ADDRLP4 0 INDIRI4 ARGI4 ADDRLP4 4 ARGP4 ADDRGP4 BotEntityInfo CALLV pop ADDRLP4 4 INDIRI4 CNSTI4 0 EQI4 $563 ADDRLP4 4+24 ARGP4 ADDRLP4 672 ADDRGP4 BotPointAreaNum CALLI4 ASGNI4 ADDRLP4 660 ADDRLP4 672 INDIRI4 ASGNI4 ADDRLP4 660 INDIRI4 CNSTI4 0 EQI4 $566 ADDRFP4 0 INDIRP4 CNSTI4 6864 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6836 ADDP4 ADDRLP4 660 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6824 ADDP4 ADDRLP4 4+24 INDIRB ASGNB 12 ADDRFP4 0 INDIRP4 CNSTI4 6840 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6844 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6848 ADDP4 CNSTF4 3238002688 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6852 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6856 ADDP4 CNSTF4 1090519040 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6860 ADDP4 CNSTF4 1090519040 ASGNF4 LABELV $566 LABELV $563 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 INDIRI4 CNSTI4 0 GEI4 $569 ADDRLP4 656 INDIRI4 CNSTI4 0 EQI4 $571 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $261 ARGP4 ADDRLP4 400 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRGP4 $572 JUMPV LABELV $571 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $262 ARGP4 ADDRLP4 144 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop LABELV $572 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 CNSTI4 1 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $550 JUMPV LABELV $569 ADDRFP4 0 INDIRP4 CNSTI4 6820 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6880 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1142292480 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6884 ADDP4 CNSTF4 0 ASGNF4 ADDRLP4 672 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6888 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 672 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 NEGF4 ASGNF4 LABELV $550 endproc BotMatch_LeadTheWay 680 16 export BotMatch_Kill proc BotMatch_Kill 532 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRLP4 516 ADDRGP4 TeamPlayIsOn CALLI4 ASGNI4 ADDRLP4 516 INDIRI4 CNSTI4 0 NEI4 $574 ADDRGP4 $573 JUMPV LABELV $574 ADDRFP4 0 INDIRP4 ARGP4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 520 ADDRGP4 BotAddressedToBot CALLI4 ASGNI4 ADDRLP4 520 INDIRI4 CNSTI4 0 NEI4 $576 ADDRGP4 $573 JUMPV LABELV $576 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 4 ARGI4 ADDRLP4 4 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 4 ARGP4 ADDRLP4 524 ADDRGP4 FindEnemyByName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 524 INDIRI4 ASGNI4 ADDRLP4 0 INDIRI4 CNSTI4 0 GEI4 $578 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 $242 ARGP4 ADDRLP4 4 ARGP4 CNSTP4 0 ARGP4 ADDRGP4 BotAI_BotInitialChat CALLV pop ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 260 ARGP4 CNSTI4 256 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 260 ARGP4 ADDRLP4 528 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRLP4 0 ADDRLP4 528 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6528 ADDP4 INDIRI4 ARGI4 ADDRLP4 0 INDIRI4 ARGI4 CNSTI4 2 ARGI4 ADDRGP4 trap_BotEnterChat CALLV pop ADDRGP4 $573 JUMPV LABELV $578 ADDRFP4 0 INDIRP4 CNSTI4 6660 ADDP4 ADDRLP4 0 INDIRI4 ASGNI4 ADDRLP4 528 ADDRGP4 qk_rand CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6736 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1073741824 ADDRLP4 528 INDIRI4 CNSTI4 32767 BANDI4 CVIF4 4 CNSTF4 1191181824 DIVF4 MULF4 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 CNSTI4 6596 ADDP4 CNSTI4 11 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6740 ADDP4 ADDRGP4 floattime INDIRF4 CNSTF4 1127481344 ADDF4 ASGNF4 ADDRFP4 0 INDIRP4 ARGP4 ADDRGP4 BotSetTeamStatus CALLV pop LABELV $573 endproc BotMatch_Kill 532 16 export BotMatch_CTF proc BotMatch_CTF 176 16 ADDRGP4 gametype INDIRI4 CNSTI4 4 NEI4 $581 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 1 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 128 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 4096 BANDI4 CNSTI4 0 EQI4 $583 ADDRLP4 0 ARGP4 ADDRGP4 $545 ARGP4 ADDRLP4 164 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 164 INDIRI4 CNSTI4 0 NEI4 $585 ADDRFP4 0 INDIRP4 CNSTI4 6948 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 168 ADDRGP4 BotTeam CALLI4 ASGNI4 ADDRLP4 168 INDIRI4 CNSTI4 2 NEI4 $586 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 128 ARGP4 CNSTI4 36 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 128 ARGP4 ADDRLP4 172 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6968 ADDP4 ADDRLP4 172 INDIRI4 ASGNI4 ADDRGP4 $586 JUMPV LABELV $585 ADDRFP4 0 INDIRP4 CNSTI4 6952 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 168 ADDRGP4 BotTeam CALLI4 ASGNI4 ADDRLP4 168 INDIRI4 CNSTI4 1 NEI4 $589 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 128 ARGP4 CNSTI4 36 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 128 ARGP4 ADDRLP4 172 ADDRGP4 ClientFromName CALLI4 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6968 ADDP4 ADDRLP4 172 INDIRI4 ASGNI4 LABELV $589 LABELV $586 ADDRFP4 0 INDIRP4 CNSTI4 6960 ADDP4 CNSTI4 1 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6940 ADDP4 ADDRGP4 floattime INDIRF4 ASGNF4 ADDRGP4 $584 JUMPV LABELV $583 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 8192 BANDI4 CNSTI4 0 EQI4 $591 ADDRFP4 0 INDIRP4 CNSTI4 6948 ADDP4 CNSTI4 0 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6952 ADDP4 CNSTI4 0 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6968 ADDP4 CNSTI4 0 ASGNI4 ADDRFP4 0 INDIRP4 CNSTI4 6960 ADDP4 CNSTI4 1 ASGNI4 ADDRGP4 $592 JUMPV LABELV $591 ADDRFP4 4 INDIRP4 CNSTI4 260 ADDP4 INDIRI4 CNSTI4 16384 BANDI4 CNSTI4 0 EQI4 $593 ADDRLP4 0 ARGP4 ADDRGP4 $545 ARGP4 ADDRLP4 164 ADDRGP4 Q_stricmp CALLI4 ASGNI4 ADDRLP4 164 INDIRI4 CNSTI4 0 NEI4 $595 ADDRFP4 0 INDIRP4 CNSTI4 6948 ADDP4 CNSTI4 0 ASGNI4 ADDRGP4 $596 JUMPV LABELV $595 ADDRFP4 0 INDIRP4 CNSTI4 6952 ADDP4 CNSTI4 0 ASGNI4 LABELV $596 ADDRFP4 0 INDIRP4 CNSTI4 6960 ADDP4 CNSTI4 1 ASGNI4 LABELV $593 LABELV $592 LABELV $584 LABELV $581 LABELV $580 endproc BotMatch_CTF 176 16 export BotMatch_EnterGame proc BotMatch_EnterGame 44 16 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 36 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 40 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 36 ADDRLP4 40 INDIRI4 ASGNI4 ADDRLP4 36 INDIRI4 CNSTI4 0 LTI4 $598 ADDRLP4 36 INDIRI4 CNSTI4 2 LSHI4 ADDRGP4 notleader ADDP4 CNSTI4 0 ASGNI4 LABELV $598 LABELV $597 endproc BotMatch_EnterGame 44 16 export BotMatch_NewLeader proc BotMatch_NewLeader 48 16 ADDRFP4 0 ADDRFP4 0 INDIRP4 ASGNP4 ADDRFP4 4 INDIRP4 ARGP4 CNSTI4 0 ARGI4 ADDRLP4 0 ARGP4 CNSTI4 36 ARGI4 ADDRGP4 trap_BotMatchVariable CALLV pop ADDRLP4 0 ARGP4 ADDRLP4 40 ADDRGP4 FindClientByName CALLI4 ASGNI4 ADDRLP4 36 ADDRLP4 40 INDIRI4 ASGNI4 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 36 INDIRI4 ARGI4 ADDRLP4 44 ADDRGP4 BotSameTeam CALLI4 ASGNI4 ADDRLP4 44 INDIRI4 CNSTI4 0 NEI4 $601 ADDRGP4 $600 JUMPV LABELV $601 ADDRFP4 0 INDIRP4 CNSTI4 6896 ADDP4 ARGP4 ADDRLP4 0 ARGP4 CNSTI4 32 ARGI4 ADDRGP4 Q_strncpyz CALLV pop LABELV $600 endproc BotMatch_NewLeader 48 16 export BotMatchMessage proc BotMatchMessage 336 12 ADDRLP4 0+256 CNSTI4 0 ASGNI4 ADDRFP4 4 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 CNSTU4 262 ARGU4 ADDRLP4 328 ADDRGP4 trap_BotFindMatch CALLI4 ASGNI4 ADDRLP4 328 INDIRI4 CNSTI4 0 NEI4 $605 CNSTI4 0 RETI4 ADDRGP4 $603 JUMPV LABELV $605 ADDRLP4 332 ADDRLP4 0+256 INDIRI4 ASGNI4 ADDRLP4 332 INDIRI4 CNSTI4 1 LTI4 $607 ADDRLP4 332 INDIRI4 CNSTI4 33 GTI4 $643 ADDRLP4 332 INDIRI4 CNSTI4 2 LSHI4 ADDRGP4 $644-4 ADDP4 INDIRP4 JUMPV lit align 4 LABELV $644 address $639 address $638 address $610 address $610 address $611 address $615 address $614 address $630 address $631 address $632 address $608 address $633 address $620 address $621 address $624 address $626 address $627 address $608 address $629 address $612 address $623 address $613 address $636 address $619 address $637 address $635 address $616 address $634 address $622 address $617 address $607 address $607 address $641 code LABELV $643 ADDRLP4 0+256 INDIRI4 CNSTI4 300 EQI4 $618 ADDRGP4 $607 JUMPV LABELV $610 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_HelpAccompany CALLV pop ADDRGP4 $608 JUMPV LABELV $611 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_DefendKeyArea CALLV pop ADDRGP4 $608 JUMPV LABELV $612 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_Camp CALLV pop ADDRGP4 $608 JUMPV LABELV $613 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_Patrol CALLV pop ADDRGP4 $608 JUMPV LABELV $614 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_GetFlag CALLV pop ADDRGP4 $608 JUMPV LABELV $615 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_RushBase CALLV pop ADDRGP4 $608 JUMPV LABELV $616 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_ReturnFlag CALLV pop ADDRGP4 $608 JUMPV LABELV $617 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_TaskPreference CALLV pop ADDRGP4 $608 JUMPV LABELV $618 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_CTF CALLV pop ADDRGP4 $608 JUMPV LABELV $619 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_GetItem CALLV pop ADDRGP4 $608 JUMPV LABELV $620 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_JoinSubteam CALLV pop ADDRGP4 $608 JUMPV LABELV $621 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_LeaveSubteam CALLV pop ADDRGP4 $608 JUMPV LABELV $622 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_WhichTeam CALLV pop ADDRGP4 $608 JUMPV LABELV $623 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_CheckPoint CALLV pop ADDRGP4 $608 JUMPV LABELV $624 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRGP4 $625 ARGP4 ADDRGP4 trap_EA_SayTeam CALLV pop ADDRGP4 $608 JUMPV LABELV $626 ADDRFP4 0 INDIRP4 CNSTI4 8 ADDP4 INDIRI4 ARGI4 ADDRGP4 $625 ARGP4 ADDRGP4 trap_EA_SayTeam CALLV pop ADDRGP4 $608 JUMPV LABELV $627 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_FormationSpace CALLV pop ADDRGP4 $608 JUMPV LABELV $629 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_Dismiss CALLV pop ADDRGP4 $608 JUMPV LABELV $630 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_StartTeamLeaderShip CALLV pop ADDRGP4 $608 JUMPV LABELV $631 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_StopTeamLeaderShip CALLV pop ADDRGP4 $608 JUMPV LABELV $632 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_WhoIsTeamLeader CALLV pop ADDRGP4 $608 JUMPV LABELV $633 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_WhatAreYouDoing CALLV pop ADDRGP4 $608 JUMPV LABELV $634 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_WhatIsMyCommand CALLV pop ADDRGP4 $608 JUMPV LABELV $635 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_WhereAreYou CALLV pop ADDRGP4 $608 JUMPV LABELV $636 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_LeadTheWay CALLV pop ADDRGP4 $608 JUMPV LABELV $637 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_Kill CALLV pop ADDRGP4 $608 JUMPV LABELV $638 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_EnterGame CALLV pop ADDRGP4 $608 JUMPV LABELV $639 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_NewLeader CALLV pop ADDRGP4 $608 JUMPV LABELV $641 ADDRFP4 0 INDIRP4 ARGP4 ADDRLP4 0 ARGP4 ADDRGP4 BotMatch_Suicide CALLV pop ADDRGP4 $608 JUMPV LABELV $607 CNSTI4 1 ARGI4 ADDRGP4 $642 ARGP4 ADDRGP4 BotAI_Print CALLV pop LABELV $608 CNSTI4 1 RETI4 LABELV $603 endproc BotMatchMessage 336 12 import BotVoiceChatOnly import BotVoiceChat import BotSetTeamMateTaskPreference import BotGetTeamMateTaskPreference import BotTeamAI import BotDumpNodeSwitches import BotResetNodeSwitches import AINode_Battle_NBG import AINode_Battle_Retreat import AINode_Battle_Chase import AINode_Battle_Fight import AINode_Seek_LTG import AINode_Seek_NBG import AINode_Seek_ActivateEntity import AINode_Stand import AINode_Respawn import AINode_Observer import AINode_Intermission import AIEnter_Battle_NBG import AIEnter_Battle_Retreat import AIEnter_Battle_Chase import AIEnter_Battle_Fight import AIEnter_Seek_Camp import AIEnter_Seek_LTG import AIEnter_Seek_NBG import AIEnter_Seek_ActivateEntity import AIEnter_Stand import AIEnter_Respawn import AIEnter_Observer import AIEnter_Intermission import BotPrintTeamGoal bss export notleader align 4 LABELV notleader skip 256 import BotChatTest import BotValidChatPosition import BotChatTime import BotChat_Random import BotChat_EnemySuicide import BotChat_Kill import BotChat_Death import BotChat_HitNoKill import BotChat_HitNoDeath import BotChat_HitTalking import BotChat_EndLevel import BotChat_StartLevel import BotChat_ExitGame import BotChat_EnterGame import ctf_blueflag import ctf_redflag import bot_challenge import bot_testrchat import bot_nochat import bot_fastchat import bot_rocketjump import bot_grapple import maxclients import gametype import BotMapScripts import BotPointAreaNum import ClientOnSameTeamFromName import ClientFromName import stristr import BotFindWayPoint import BotCreateWayPoint import BotAlternateRoute import BotGetAlternateRouteGoal import BotCTFRetreatGoals import BotCTFSeekGoals import BotRememberLastOrderedTask import BotCTFCarryingFlag import BotOppositeTeam import BotTeam import BotClearActivateGoalStack import BotPopFromActivateGoalStack import BotEnableActivateGoalAreas import BotAIPredictObstacles import BotAIBlocked import BotCheckAttack import BotAimAtEnemy import BotEntityVisible import BotRoamGoal import BotFindEnemy import InFieldOfVision import BotVisibleTeamMatesAndEnemies import BotEnemyFlagCarrierVisible import BotTeamFlagCarrierVisible import BotTeamFlagCarrier import TeamPlayIsOn import BotSameTeam import BotAttackMove import BotWantsToCamp import BotHasPersistantPowerupAndWeapon import BotCanAndWantsToRocketJump import BotWantsToHelp import BotWantsToChase import BotWantsToRetreat import BotFeelingBad import BotAggression import BotTeamGoals import BotSetLastOrderedTask import BotSynonymContext import ClientSkin import EasyClientName import ClientName import BotSetTeamStatus import BotSetUserInfo import EntityIsShooting import EntityIsInvisible import EntityIsDead import BotInLavaOrSlime import BotIntermission import BotIsObserver import BotIsDead import BotBattleUseItems import BotUpdateBattleInventory import BotUpdateInventory import BotSetupForMovement import BotChooseWeapon import BotFreeWaypoints import BotDeathmatchAI import BotShutdownDeathmatchAI import BotSetupDeathmatchAI import BotTeamLeader import BotAI_GetSnapshotEntity import BotAI_GetEntityState import BotAI_GetClientState import BotAI_Trace import BotAI_BotInitialChat import BotAI_Print import floattime import BotEntityInfo import NumBots import BotResetState import BotResetWeaponState import BotFreeWeaponState import BotAllocWeaponState import BotLoadWeaponWeights import BotGetWeaponInfo import BotChooseBestFightWeapon import BotShutdownWeaponAI import BotSetupWeaponAI import BotShutdownMoveAI import BotSetupMoveAI import BotSetBrushModelTypes import BotAddAvoidSpot import BotInitMoveState import BotFreeMoveState import BotAllocMoveState import BotPredictVisiblePosition import BotMovementViewTarget import BotReachabilityArea import BotResetLastAvoidReach import BotResetAvoidReach import BotMoveInDirection import BotMoveToGoal import BotResetMoveState import BotShutdownGoalAI import BotSetupGoalAI import BotFreeGoalState import BotAllocGoalState import BotFreeItemWeights import BotLoadItemWeights import BotMutateGoalFuzzyLogic import BotSaveGoalFuzzyLogic import BotInterbreedGoalFuzzyLogic import BotUpdateEntityItems import BotInitLevelItems import BotSetAvoidGoalTime import BotAvoidGoalTime import BotGetMapLocationGoal import BotGetNextCampSpotGoal import BotGetLevelItemGoal import BotItemGoalInVisButNotVisible import BotTouchingGoal import BotChooseNBGItem import BotChooseLTGItem import BotGetSecondGoal import BotGetTopGoal import BotGoalName import BotDumpGoalStack import BotDumpAvoidGoals import BotEmptyGoalStack import BotPopGoal import BotPushGoal import BotRemoveFromAvoidGoals import BotResetAvoidGoals import BotResetGoalState import GeneticParentsAndChildSelection import BotSetChatName import BotSetChatGender import BotLoadChatFile import BotReplaceSynonyms import UnifyWhiteSpaces import BotMatchVariable import BotFindMatch import StringContains import BotGetChatMessage import BotEnterChat import BotChatLength import BotReplyChat import BotNumInitialChats import BotInitialChat import BotNumConsoleMessages import BotNextConsoleMessage import BotRemoveConsoleMessage import BotQueueConsoleMessage import BotFreeChatState import BotAllocChatState import BotShutdownChatAI import BotSetupChatAI import BotShutdownCharacters import Characteristic_String import Characteristic_BInteger import Characteristic_Integer import Characteristic_BFloat import Characteristic_Float import BotFreeCharacter import BotLoadCharacter import EA_Shutdown import EA_Setup import EA_ResetInput import EA_GetInput import EA_EndRegular import EA_View import EA_Move import EA_DelayedJump import EA_Jump import EA_SelectWeapon import EA_Use import EA_Gesture import EA_Talk import EA_Respawn import EA_Attack import EA_MoveRight import EA_MoveLeft import EA_MoveBack import EA_MoveForward import EA_MoveDown import EA_MoveUp import EA_Walk import EA_Crouch import EA_Action import EA_Command import EA_SayTeam import EA_Say import GetBotLibAPI import trap_SnapVector import trap_GeneticParentsAndChildSelection import trap_BotResetWeaponState import trap_BotFreeWeaponState import trap_BotAllocWeaponState import trap_BotLoadWeaponWeights import trap_BotGetWeaponInfo import trap_BotChooseBestFightWeapon import trap_BotAddAvoidSpot import trap_BotInitMoveState import trap_BotFreeMoveState import trap_BotAllocMoveState import trap_BotPredictVisiblePosition import trap_BotMovementViewTarget import trap_BotReachabilityArea import trap_BotResetLastAvoidReach import trap_BotResetAvoidReach import trap_BotMoveInDirection import trap_BotMoveToGoal import trap_BotResetMoveState import trap_BotFreeGoalState import trap_BotAllocGoalState import trap_BotMutateGoalFuzzyLogic import trap_BotSaveGoalFuzzyLogic import trap_BotInterbreedGoalFuzzyLogic import trap_BotFreeItemWeights import trap_BotLoadItemWeights import trap_BotUpdateEntityItems import trap_BotInitLevelItems import trap_BotSetAvoidGoalTime import trap_BotAvoidGoalTime import trap_BotGetLevelItemGoal import trap_BotGetMapLocationGoal import trap_BotGetNextCampSpotGoal import trap_BotItemGoalInVisButNotVisible import trap_BotTouchingGoal import trap_BotChooseNBGItem import trap_BotChooseLTGItem import trap_BotGetSecondGoal import trap_BotGetTopGoal import trap_BotGoalName import trap_BotDumpGoalStack import trap_BotDumpAvoidGoals import trap_BotEmptyGoalStack import trap_BotPopGoal import trap_BotPushGoal import trap_BotResetAvoidGoals import trap_BotRemoveFromAvoidGoals import trap_BotResetGoalState import trap_BotSetChatName import trap_BotSetChatGender import trap_BotLoadChatFile import trap_BotReplaceSynonyms import trap_UnifyWhiteSpaces import trap_BotMatchVariable import trap_BotFindMatch import trap_StringContains import trap_BotGetChatMessage import trap_BotEnterChat import trap_BotChatLength import trap_BotReplyChat import trap_BotNumInitialChats import trap_BotInitialChat import trap_BotNumConsoleMessages import trap_BotNextConsoleMessage import trap_BotRemoveConsoleMessage import trap_BotQueueConsoleMessage import trap_BotFreeChatState import trap_BotAllocChatState import trap_Characteristic_String import trap_Characteristic_BInteger import trap_Characteristic_Integer import trap_Characteristic_BFloat import trap_Characteristic_Float import trap_BotFreeCharacter import trap_BotLoadCharacter import trap_EA_ResetInput import trap_EA_GetInput import trap_EA_EndRegular import trap_EA_View import trap_EA_Move import trap_EA_DelayedJump import trap_EA_Jump import trap_EA_SelectWeapon import trap_EA_MoveRight import trap_EA_MoveLeft import trap_EA_MoveBack import trap_EA_MoveForward import trap_EA_MoveDown import trap_EA_MoveUp import trap_EA_Crouch import trap_EA_Respawn import trap_EA_Use import trap_EA_Attack import trap_EA_Talk import trap_EA_Gesture import trap_EA_Action import trap_EA_Command import trap_EA_SayTeam import trap_EA_Say import trap_AAS_PredictClientMovement import trap_AAS_Swimming import trap_AAS_AlternativeRouteGoals import trap_AAS_PredictRoute import trap_AAS_EnableRoutingArea import trap_AAS_AreaTravelTimeToGoalArea import trap_AAS_AreaReachability import trap_AAS_IntForBSPEpairKey import trap_AAS_FloatForBSPEpairKey import trap_AAS_VectorForBSPEpairKey import trap_AAS_ValueForBSPEpairKey import trap_AAS_NextBSPEntity import trap_AAS_PointContents import trap_AAS_TraceAreas import trap_AAS_PointReachabilityAreaIndex import trap_AAS_PointAreaNum import trap_AAS_Time import trap_AAS_PresenceTypeBoundingBox import trap_AAS_Initialized import trap_AAS_EntityInfo import trap_AAS_AreaInfo import trap_AAS_BBoxAreas import trap_BotUserCommand import trap_BotGetServerCommand import trap_BotGetSnapshotEntity import trap_BotLibTest import trap_BotLibUpdateEntity import trap_BotLibLoadMap import trap_BotLibStartFrame import trap_BotLibDefine import trap_BotLibVarGet import trap_BotLibVarSet import trap_BotLibShutdown import trap_BotLibSetup import trap_DebugPolygonDelete import trap_DebugPolygonCreate import trap_GetEntityToken import trap_GetUsercmd import trap_BotFreeClient import trap_BotAllocateClient import trap_EntityContact import trap_EntitiesInBox import trap_UnlinkEntity import trap_LinkEntity import trap_AreasConnected import trap_AdjustAreaPortalState import trap_InPVSIgnorePortals import trap_InPVS import trap_PointContents import trap_Trace import trap_SetBrushModel import trap_GetServerinfo import trap_SetUserinfo import trap_GetUserinfo import trap_GetConfigstring import trap_SetConfigstring import trap_SendServerCommand import trap_DropClient import trap_LocateGameData import trap_Cvar_VariableStringBuffer import trap_Cvar_VariableValue import trap_Cvar_VariableIntegerValue import trap_Cvar_Set import trap_Cvar_Update import trap_Cvar_Register import trap_SendConsoleCommand import trap_FS_Seek import trap_FS_GetFileList import trap_FS_FCloseFile import trap_FS_Write import trap_FS_Read import trap_FS_FOpenFile import trap_Args import trap_Argv import trap_Argc import trap_RealTime import trap_Milliseconds import trap_Error import trap_Print import g_proxMineTimeout import g_singlePlayer import g_enableBreath import g_enableDust import g_rankings import pmove_msec import pmove_fixed import g_smoothClients import g_blueteam import g_redteam import g_cubeTimeout import g_obeliskRespawnDelay import g_obeliskRegenAmount import g_obeliskRegenPeriod import g_obeliskHealth import g_filterBan import g_banIPs import g_teamForceBalance import g_teamAutoJoin import g_allowVote import g_blood import g_doWarmup import g_warmup import g_motd import g_synchronousClients import g_weaponTeamRespawn import g_weaponRespawn import g_debugDamage import g_debugAlloc import g_debugMove import g_inactivity import g_forcerespawn import g_quadfactor import g_knockback import g_speed import g_gravity import g_needpass import g_password import g_friendlyFire import g_capturelimit import g_timelimit import g_fraglimit import g_dmflags import g_restarted import g_maxGameClients import g_maxclients import g_cheats import g_dedicated import g_gametype import g_entities import level import Pickup_Team import CheckTeamStatus import TeamplayInfoMessage import Team_GetLocationMsg import Team_GetLocation import SelectCTFSpawnPoint import Team_FreeEntity import Team_ReturnFlag import Team_InitGame import Team_CheckHurtCarrier import Team_FragBonuses import Team_DroppedFlagThink import AddTeamScore import TeamColorString import TeamName import OtherTeam import BotTestAAS import BotAIStartFrame import BotAIShutdownClient import BotAISetupClient import BotAILoadMap import BotAIShutdown import BotAISetup import BotInterbreedEndMatch import Svcmd_BotList_f import Svcmd_AddBot_f import G_BotConnect import G_RemoveQueuedBotBegin import G_CheckBotSpawn import G_GetBotInfoByName import G_GetBotInfoByNumber import G_InitBots import Svcmd_AbortPodium_f import SpawnModelsOnVictoryPads import UpdateTournamentInfo import G_WriteSessionData import G_InitWorldSession import G_InitSessionData import G_ReadSessionData import Svcmd_GameMem_f import G_InitMemory import G_Alloc import CheckObeliskAttack import Team_CheckDroppedItem import OnSameTeam import G_RunClient import ClientEndFrame import ClientThink import ClientCommand import ClientBegin import ClientDisconnect import ClientUserinfoChanged import ClientConnect import G_Error import G_Printf import SendScoreboardMessageToAllClients import G_LogPrintf import AddTournamentQueue import G_RunThink import CheckTeamLeader import SetLeader import FindIntermissionPoint import MoveClientToIntermission import DeathmatchScoreboardMessage import FireWeapon import G_FilterPacket import G_ProcessIPBans import ConsoleCommand import SpotWouldTelefrag import CalculateRanks import AddScore import player_die import ClientSpawn import InitBodyQue import BeginIntermission import ClientRespawn import CopyToBodyQue import SelectSpawnPoint import SetClientViewAngle import PickTeam import TeamLeader import TeamCount import Weapon_HookThink import Weapon_HookFree import CheckGauntletAttack import SnapVectorTowards import CalcMuzzlePoint import LogAccuracyHit import TeleportPlayer import trigger_teleporter_touch import Touch_DoorTrigger import G_RunMover import fire_grapple import fire_bfg import fire_rocket import fire_grenade import fire_plasma import G_RunMissile import TossClientCubes import TossClientItems import body_die import G_InvulnerabilityEffect import G_RadiusDamage import G_Damage import CanDamage import BuildShaderStateConfig import AddRemap import G_SetOrigin import G_AddEvent import G_AddPredictableEvent import vectoyaw import vtos import tv import G_TouchTriggers import G_EntitiesFree import G_FreeEntity import G_Sound import G_TempEntity import G_Spawn import G_InitGentity import G_SetMovedir import G_UseTargets import G_PickTarget import G_Find import G_KillBox import G_TeamCommand import G_SoundIndex import G_ModelIndex import SaveRegisteredItems import RegisterItem import ClearRegisteredItems import Touch_Item import Add_Ammo import ArmorIndex import Think_Weapon import FinishSpawningItem import G_SpawnItem import SetRespawn import LaunchItem import Drop_Item import PrecacheItem import UseHoldableItem import RespawnItem import G_RunItem import G_CheckTeamItems import Cmd_FollowCycle_f import SetTeam import BroadcastTeamChange import StopFollowing import Cmd_Score_f import G_NewString import G_SpawnEntitiesFromString import G_SpawnVector import G_SpawnInt import G_SpawnFloat import G_SpawnString import BG_PlayerTouchesItem import BG_PlayerStateToEntityStateExtraPolate import BG_PlayerStateToEntityState import BG_TouchJumpPad import BG_AddPredictableEventToPlayerstate import BG_EvaluateTrajectoryDelta import BG_EvaluateTrajectory import BG_CanItemBeGrabbed import BG_FindItemForHoldable import BG_FindItemForPowerup import BG_FindItemForWeapon import BG_FindItem import bg_numItems import bg_itemlist import Pmove import PM_UpdateViewAngles import Com_Printf import Com_Error import Info_NextPair import Info_Validate import Info_SetValueForKey_Big import Info_SetValueForKey import Info_RemoveKey_Big import Info_RemoveKey import Info_ValueForKey import Com_TruncateLongString import va import Q_CountChar import Q_CleanStr import Q_PrintStrlen import Q_strcat import Q_strncpyz import Q_stristr import Q_strupr import Q_strlwr import Q_stricmpn import Q_strncmp import Q_stricmp import Q_isintegral import Q_isanumber import Q_isalpha import Q_isupper import Q_islower import Q_isprint import Com_RandomBytes import Com_SkipCharset import Com_SkipTokens import Com_sprintf import Com_HexStrToInt import Parse3DMatrix import Parse2DMatrix import Parse1DMatrix import SkipRestOfLine import SkipBracedSection import COM_MatchToken import COM_ParseWarning import COM_ParseError import COM_Compress import COM_ParseExt import COM_Parse import COM_GetCurrentParseLine import COM_BeginParseSession import COM_DefaultExtension import COM_CompareExtension import COM_StripExtension import COM_GetExtension import COM_SkipPath import Com_Clamp import PerpendicularVector import AngleVectors import MatrixMultiply import MakeNormalVectors import RotateAroundDirection import RotatePointAroundVector import ProjectPointOnPlane import PlaneFromPoints import AngleDelta import AngleNormalize180 import AngleNormalize360 import AnglesSubtract import AngleSubtract import LerpAngle import AngleMod import BoundsIntersectPoint import BoundsIntersectSphere import BoundsIntersect import BoxOnPlaneSide import SetPlaneSignbits import AxisCopy import AxisClear import AnglesToAxis import vectoangles import Q_crandom import Q_random import Q_rand import Q_acos import Q_log2 import VectorRotate import Vector4Scale import VectorNormalize2 import VectorNormalize import CrossProduct import VectorInverse import VectorNormalizeFast import DistanceSquared import Distance import VectorLengthSquared import VectorLength import VectorCompare import AddPointToBounds import ClearBounds import RadiusFromBounds import NormalizeColor import ColorBytes4 import ColorBytes3 import _VectorMA import _VectorScale import _VectorCopy import _VectorAdd import _VectorSubtract import _DotProduct import ByteToDir import DirToByte import ClampShort import ClampChar import Q_rsqrt import Q_fabs import Q_isnan import axisDefault import vec3_origin import g_color_table import colorDkGrey import colorMdGrey import colorLtGrey import colorWhite import colorCyan import colorMagenta import colorYellow import colorBlue import colorGreen import colorRed import colorBlack import bytedirs import Hunk_AllocDebug import FloatSwap import LongSwap import ShortSwap import CopyLongSwap import CopyShortSwap import qk_acos import qk_fabs import qk_abs import qk_tan import qk_atan2 import qk_cos import qk_sin import qk_sqrt import qk_floor import qk_ceil import qk_memcpy import qk_memset import qk_memmove import qk_sscanf import qk_vsnprintf import qk_strtol import qk_atoi import qk_strtod import qk_atof import qk_toupper import qk_tolower import qk_strncpy import qk_strstr import qk_strrchr import qk_strchr import qk_strcmp import qk_strcpy import qk_strcat import qk_strlen import qk_rand import qk_srand import qk_qsort lit align 1 LABELV $642 byte 1 117 byte 1 110 byte 1 107 byte 1 110 byte 1 111 byte 1 119 byte 1 110 byte 1 32 byte 1 109 byte 1 97 byte 1 116 byte 1 99 byte 1 104 byte 1 32 byte 1 116 byte 1 121 byte 1 112 byte 1 101 byte 1 10 byte 1 0 align 1 LABELV $625 byte 1 116 byte 1 104 byte 1 101 byte 1 32 byte 1 112 byte 1 97 byte 1 114 byte 1 116 byte 1 32 byte 1 111 byte 1 102 byte 1 32 byte 1 109 byte 1 121 byte 1 32 byte 1 98 byte 1 114 byte 1 97 byte 1 105 byte 1 110 byte 1 32 byte 1 116 byte 1 111 byte 1 32 byte 1 99 byte 1 114 byte 1 101 byte 1 97 byte 1 116 byte 1 101 byte 1 32 byte 1 102 byte 1 111 byte 1 114 byte 1 109 byte 1 97 byte 1 116 byte 1 105 byte 1 111 byte 1 110 byte 1 115 byte 1 32 byte 1 104 byte 1 97 byte 1 115 byte 1 32 byte 1 98 byte 1 101 byte 1 101 byte 1 110 byte 1 32 byte 1 100 byte 1 97 byte 1 109 byte 1 97 byte 1 103 byte 1 101 byte 1 100 byte 1 0 align 1 LABELV $549 byte 1 108 byte 1 111 byte 1 99 byte 1 97 byte 1 116 byte 1 105 byte 1 111 byte 1 110 byte 1 0 align 1 LABELV $548 byte 1 98 byte 1 108 byte 1 117 byte 1 101 byte 1 0 align 1 LABELV $545 byte 1 114 byte 1 101 byte 1 100 byte 1 0 align 1 LABELV $544 byte 1 116 byte 1 101 byte 1 97 byte 1 109 byte 1 108 byte 1 111 byte 1 99 byte 1 97 byte 1 116 byte 1 105 byte 1 111 byte 1 110 byte 1 0 align 1 LABELV $525 byte 1 66 byte 1 108 byte 1 117 byte 1 101 byte 1 32 byte 1 70 byte 1 108 byte 1 97 byte 1 103 byte 1 0 align 1 LABELV $524 byte 1 82 byte 1 101 byte 1 100 byte 1 32 byte 1 70 byte 1 108 byte 1 97 byte 1 103 byte 1 0 align 1 LABELV $523 byte 1 72 byte 1 101 byte 1 97 byte 1 118 byte 1 121 byte 1 32 byte 1 65 byte 1 114 byte 1 109 byte 1 111 byte 1 114 byte 1 0 align 1 LABELV $522 byte 1 65 byte 1 114 byte 1 109 byte 1 111 byte 1 114 byte 1 0 align 1 LABELV $521 byte 1 70 byte 1 108 byte 1 105 byte 1 103 byte 1 104 byte 1 116 byte 1 0 align 1 LABELV $520 byte 1 73 byte 1 110 byte 1 118 byte 1 105 byte 1 115 byte 1 105 byte 1 98 byte 1 105 byte 1 108 byte 1 105 byte 1 116 byte 1 121 byte 1 0 align 1 LABELV $519 byte 1 83 byte 1 112 byte 1 101 byte 1 101 byte 1 100 byte 1 0 align 1 LABELV $518 byte 1 66 byte 1 97 byte 1 116 byte 1 116 byte 1 108 byte 1 101 byte 1 32 byte 1 83 byte 1 117 byte 1 105 byte 1 116 byte 1 0 align 1 LABELV $517 byte 1 82 byte 1 101 byte 1 103 byte 1 101 byte 1 110 byte 1 101 byte 1 114 byte 1 97 byte 1 116 byte 1 105 byte 1 111 byte 1 110 byte 1 0 align 1 LABELV $516 byte 1 81 byte 1 117 byte 1 97 byte 1 100 byte 1 32 byte 1 68 byte 1 97 byte 1 109 byte 1 97 byte 1 103 byte 1 101 byte 1 0 align 1 LABELV $515 byte 1 66 byte 1 70 byte 1 71 byte 1 49 byte 1 48 byte 1 75 byte 1 0 align 1 LABELV $514 byte 1 76 byte 1 105 byte 1 103 byte 1 104 byte 1 116 byte 1 110 byte 1 105 byte 1 110 byte 1 103 byte 1 32 byte 1 71 byte 1 117 byte 1 110 byte 1 0 align 1 LABELV $513 byte 1 82 byte 1 97 byte 1 105 byte 1 108 byte 1 103 byte 1 117 byte 1 110 byte 1 0 align 1 LABELV $512 byte 1 80 byte 1 108 byte 1 97 byte 1 115 byte 1 109 byte 1 97 byte 1 103 byte 1 117 byte 1 110 byte 1 0 align 1 LABELV $511 byte 1 82 byte 1 111 byte 1 99 byte 1 107 byte 1 101 byte 1 116 byte 1 32 byte 1 76 byte 1 97 byte 1 117 byte 1 110 byte 1 99 byte 1 104 byte 1 101 byte 1 114 byte 1 0 align 1 LABELV $510 byte 1 71 byte 1 114 byte 1 101 byte 1 110 byte 1 97 byte 1 100 byte 1 101 byte 1 32 byte 1 76 byte 1 97 byte 1 117 byte 1 110 byte 1 99 byte 1 104 byte 1 101 byte 1 114 byte 1 0 align 1 LABELV $509 byte 1 83 byte 1 104 byte 1 111 byte 1 116 byte 1 103 byte 1 117 byte 1 110 byte 1 0 align 1 LABELV $485 byte 1 114 byte 1 111 byte 1 97 byte 1 109 byte 1 105 byte 1 110 byte 1 103 byte 1 0 align 1 LABELV $484 byte 1 114 byte 1 101 byte 1 116 byte 1 117 byte 1 114 byte 1 110 byte 1 105 byte 1 110 byte 1 103 byte 1 102 byte 1 108 byte 1 97 byte 1 103 byte 1 0 align 1 LABELV $482 byte 1 114 byte 1 117 byte 1 115 byte 1 104 byte 1 105 byte 1 110 byte 1 103 byte 1 98 byte 1 97 byte 1 115 byte 1 101 byte 1 0 align 1 LABELV $480 byte 1 99 byte 1 97 byte 1 112 byte 1 116 byte 1 117 byte 1 114 byte 1 105 byte 1 110 byte 1 103 byte 1 102 byte 1 108 byte 1 97 byte 1 103 byte 1 0 align 1 LABELV $478 byte 1 112 byte 1 97 byte 1 116 byte 1 114 byte 1 111 byte 1 108 byte 1 108 byte 1 105 byte 1 110 byte 1 103 byte 1 0 align 1 LABELV $476 byte 1 99 byte 1 97 byte 1 109 byte 1 112 byte 1 105 byte 1 110 byte 1 103 byte 1 0 align 1 LABELV $474 byte 1 107 byte 1 105 byte 1 108 byte 1 108 byte 1 105 byte 1 110 byte 1 103 byte 1 0 align 1 LABELV $472 byte 1 103 byte 1 101 byte 1 116 byte 1 116 byte 1 105 byte 1 110 byte 1 103 byte 1 105 byte 1 116 byte 1 101 byte 1 109 byte 1 0 align 1 LABELV $470 byte 1 100 byte 1 101 byte 1 102 byte 1 101 byte 1 110 byte 1 100 byte 1 105 byte 1 110 byte 1 103 byte 1 0 align 1 LABELV $468 byte 1 97 byte 1 99 byte 1 99 byte 1 111 byte 1 109 byte 1 112 byte 1 97 byte 1 110 byte 1 121 byte 1 105 byte 1 110 byte 1 103 byte 1 0 align 1 LABELV $466 byte 1 104 byte 1 101 byte 1 108 byte 1 112 byte 1 105 byte 1 110 byte 1 103 byte 1 0 align 1 LABELV $458 byte 1 73 byte 1 39 byte 1 109 byte 1 32 byte 1 116 byte 1 104 byte 1 101 byte 1 32 byte 1 116 byte 1 101 byte 1 97 byte 1 109 byte 1 32 byte 1 108 byte 1 101 byte 1 97 byte 1 100 byte 1 101 byte 1 114 byte 1 10 byte 1 0 align 1 LABELV $436 byte 1 116 byte 1 97 byte 1 117 byte 1 110 byte 1 116 byte 1 0 align 1 LABELV $435 byte 1 107 byte 1 105 byte 1 108 byte 1 108 byte 1 0 align 1 LABELV $429 byte 1 100 byte 1 105 byte 1 115 byte 1 109 byte 1 105 byte 1 115 byte 1 115 byte 1 101 byte 1 100 byte 1 0 align 1 LABELV $413 byte 1 99 byte 1 104 byte 1 101 byte 1 99 byte 1 107 byte 1 112 byte 1 111 byte 1 105 byte 1 110 byte 1 116 byte 1 95 byte 1 99 byte 1 111 byte 1 110 byte 1 102 byte 1 105 byte 1 114 byte 1 109 byte 1 0 align 1 LABELV $412 byte 1 37 byte 1 49 byte 1 46 byte 1 48 byte 1 102 byte 1 32 byte 1 37 byte 1 49 byte 1 46 byte 1 48 byte 1 102 byte 1 32 byte 1 37 byte 1 49 byte 1 46 byte 1 48 byte 1 102 byte 1 0 align 1 LABELV $401 byte 1 99 byte 1 104 byte 1 101 byte 1 99 byte 1 107 byte 1 112 byte 1 111 byte 1 105 byte 1 110 byte 1 116 byte 1 95 byte 1 105 byte 1 110 byte 1 118 byte 1 97 byte 1 108 byte 1 105 byte 1 100 byte 1 0 align 1 LABELV $393 byte 1 37 byte 1 102 byte 1 32 byte 1 37 byte 1 102 byte 1 32 byte 1 37 byte 1 102 byte 1 0 align 1 LABELV $387 byte 1 110 byte 1 111 byte 1 116 byte 1 101 byte 1 97 byte 1 109 byte 1 0 align 1 LABELV $386 byte 1 105 byte 1 110 byte 1 116 byte 1 101 byte 1 97 byte 1 109 byte 1 0 align 1 LABELV $378 byte 1 0 align 1 LABELV $377 byte 1 108 byte 1 101 byte 1 102 byte 1 116 byte 1 116 byte 1 101 byte 1 97 byte 1 109 byte 1 0 align 1 LABELV $369 byte 1 106 byte 1 111 byte 1 105 byte 1 110 byte 1 101 byte 1 100 byte 1 116 byte 1 101 byte 1 97 byte 1 109 byte 1 0 align 1 LABELV $358 byte 1 121 byte 1 101 byte 1 115 byte 1 0 align 1 LABELV $357 byte 1 107 byte 1 101 byte 1 101 byte 1 112 byte 1 105 byte 1 110 byte 1 109 byte 1 105 byte 1 110 byte 1 100 byte 1 0 align 1 LABELV $262 byte 1 119 byte 1 104 byte 1 101 byte 1 114 byte 1 101 byte 1 97 byte 1 114 byte 1 101 byte 1 121 byte 1 111 byte 1 117 byte 1 0 align 1 LABELV $261 byte 1 119 byte 1 104 byte 1 101 byte 1 114 byte 1 101 byte 1 105 byte 1 115 byte 1 0 align 1 LABELV $242 byte 1 119 byte 1 104 byte 1 111 byte 1 105 byte 1 115 byte 1 0 align 1 LABELV $225 byte 1 37 byte 1 100 byte 1 10 byte 1 0 align 1 LABELV $176 byte 1 73 byte 1 32 byte 1 110 byte 1 101 byte 1 101 byte 1 100 byte 1 32 byte 1 109 byte 1 111 byte 1 114 byte 1 101 byte 1 32 byte 1 107 byte 1 101 byte 1 121 byte 1 32 byte 1 112 byte 1 111 byte 1 105 byte 1 110 byte 1 116 byte 1 115 byte 1 32 byte 1 116 byte 1 111 byte 1 32 byte 1 112 byte 1 97 byte 1 116 byte 1 114 byte 1 111 byte 1 108 byte 1 10 byte 1 0 align 1 LABELV $151 byte 1 119 byte 1 104 byte 1 97 byte 1 116 byte 1 32 byte 1 100 byte 1 111 byte 1 32 byte 1 121 byte 1 111 byte 1 117 byte 1 32 byte 1 115 byte 1 97 byte 1 121 byte 1 63 byte 1 0 align 1 LABELV $95 byte 1 115 byte 1 118 byte 1 95 byte 1 109 byte 1 97 byte 1 120 byte 1 99 byte 1 108 byte 1 105 byte 1 101 byte 1 110 byte 1 116 byte 1 115 byte 1 0
test/Succeed/Issue1944-nested.agda
cruhland/agda
1,989
2884
-- Andreas, AIM XXIII, Issue 1944 -- {-# OPTIONS -v tc.proj.amb:30 #-} -- Non-overloaded record Wrap (A : Set) : Set where field wrapped : A open Wrap -- Overloaded record Sg (A : Set) : Set where field head : A open Sg record Sg' (A : Set) : Set where field head : A open Sg' -- ov/ov works : ∀ {A : Set} (w : Sg (Sg' A)) → Sg A head (works w) = head (head w) -- ov/nov test : ∀ {A : Set} (w : Wrap (Sg' A)) → Sg A head (test w) = head (wrapped w) -- WAS: failed because of a missing `reduce`
src/asm/boot.asm
dmvianna/intermezzOS
0
165314
<reponame>dmvianna/intermezzOS extern kmain global start section .text bits 32 start: ;; Point the first entry of the level 4 page table ;; to the first entry in the p3 table mov eax, p3_table or eax, 0b11 mov dword [p4_table + 0], eax ;; Point the first entry of the level 3 page table ;; to the first entry in the p2 table mov eax, p2_table or eax, 0b11 mov dword [p3_table + 0], eax ;; Point each page table level two entry to a page mov ecx, 0 ; counter variable .map_p2_table: mov eax, 0x200000 ; 2MiB mul ecx or eax, 0b10000011 mov [p2_table + ecx * 8], eax inc ecx ; add 1 cmp ecx, 512 ; compare jne .map_p2_table ; loop if not there yet ;; move page table address to cr3 mov eax, p4_table mov cr3, eax ;; enable PAE mov eax, cr4 or eax, 1 << 5 mov cr4, eax ;; set the long mode bit mov ecx, 0xC0000080 rdmsr or eax, 1 << 8 wrmsr ;; enable paging mov eax, cr0 or eax, 1 << 31 or eax, 1 << 16 mov cr0, eax ;; load the gdt lgdt [gdt64.pointer] ;; update selectors mov ax, gdt64.data mov ss, ax mov ds, ax mov es, ax ;; jump to long mode! jmp gdt64.code: kmain section .bss align 4096 p4_table: resb 4096 p3_table: resb 4096 p2_table: resb 4096 section .rodata gdt64: dq 0 .code: equ $ - gdt64 dq (1<<44) | (1<<47) | (1<<41) | (1<<43) | (1<<53) .data: equ $ - gdt64 dq (1<<44) | (1<<47) | (1<<41) .pointer: dw .pointer - gdt64 - 1 dq gdt64 ;; section .text ;; bits 64 ;; long_mode_start: ;; mov rax, 0x2f592f412f4b2f4f ;; mov qword [0xb8000], rax ;; hlt
alloy4fun_models/trashltl/models/9/Le4rE7zAkHNxnEJsB.als
Kaixi26/org.alloytools.alloy
0
1395
open main pred idLe4rE7zAkHNxnEJsB_prop10 { Protected' = Protected } pred __repair { idLe4rE7zAkHNxnEJsB_prop10 } check __repair { idLe4rE7zAkHNxnEJsB_prop10 <=> prop10o }
firmware/bin/timers.asm
bidhata/phison-2307-BadUSB
14
88864
<gh_stars>10-100 ;-------------------------------------------------------- ; File Created by SDCC : free open source ANSI-C Compiler ; Version 3.7.1 #10443 (MINGW64) ;-------------------------------------------------------- .module timers .optsdcc -mmcs51 --model-small ;-------------------------------------------------------- ; Public variables in this module ;-------------------------------------------------------- .globl _tmr0isr .globl _tmr1isr .globl _RI .globl _TI .globl _RB8 .globl _TB8 .globl _REN .globl _SM2 .globl _SM1 .globl _SM0 .globl _RXD .globl _TXD .globl _INT0 .globl _INT1 .globl _T0 .globl _T1 .globl _WR .globl _RD .globl _PX0 .globl _PT0 .globl _PX1 .globl _PT1 .globl _PS .globl _EX0 .globl _ET0 .globl _EX1 .globl _ET1 .globl _ES .globl _EA .globl _IT0 .globl _IE0 .globl _IT1 .globl _IE1 .globl _TR0 .globl _TF0 .globl _TR1 .globl _TF1 .globl _P .globl _OV .globl _RS0 .globl _RS1 .globl _F0 .globl _AC .globl _CY .globl _SBUF .globl _SCON .globl _IP .globl _IE .globl _TH1 .globl _TH0 .globl _TL1 .globl _TL0 .globl _TMOD .globl _TCON .globl _PCON .globl _DPH .globl _DPL .globl _SP .globl _B .globl _ACC .globl _PSW .globl _P3 .globl _P2 .globl _P1 .globl _P0 .globl _PRAMCTL .globl _BANK2PAH .globl _BANK2PAL .globl _BANK2VA .globl _BANK1PAH .globl _BANK1PAL .globl _BANK1VA .globl _BANK0PAH .globl _BANK0PAL .globl _WARMSTATUS .globl _GPIO0OUT .globl _GPIO0DIR .globl _DMACMD .globl _DMAFILL3 .globl _DMAFILL2 .globl _DMAFILL1 .globl _DMAFILL0 .globl _DMASIZEH .globl _DMASIZEM .globl _DMASIZEL .globl _DMADSTH .globl _DMADSTM .globl _DMADSTL .globl _DMASRCH .globl _DMASRCM .globl _DMASRCL .globl _NANDCSDIR .globl _NANDCSOUT .globl _EP4 .globl _EP3 .globl _EP2 .globl _EP1 .globl _EP0 .globl _SETUPDAT .globl _EP0CS .globl _EPIE .globl _EPIRQ .globl _USBIRQ .globl _USBSTAT .globl _USBCTL .globl _REGBANK .globl _InitTicks .globl _GetTickCount .globl _SetLEDThreshold .globl _InitLED .globl _LEDBlink .globl _LEDOff ;-------------------------------------------------------- ; special function registers ;-------------------------------------------------------- .area RSEG (ABS,DATA) .org 0x0000 _P0 = 0x0080 _P1 = 0x0090 _P2 = 0x00a0 _P3 = 0x00b0 _PSW = 0x00d0 _ACC = 0x00e0 _B = 0x00f0 _SP = 0x0081 _DPL = 0x0082 _DPH = 0x0083 _PCON = 0x0087 _TCON = 0x0088 _TMOD = 0x0089 _TL0 = 0x008a _TL1 = 0x008b _TH0 = 0x008c _TH1 = 0x008d _IE = 0x00a8 _IP = 0x00b8 _SCON = 0x0098 _SBUF = 0x0099 ;-------------------------------------------------------- ; special function bits ;-------------------------------------------------------- .area RSEG (ABS,DATA) .org 0x0000 _CY = 0x00d7 _AC = 0x00d6 _F0 = 0x00d5 _RS1 = 0x00d4 _RS0 = 0x00d3 _OV = 0x00d2 _P = 0x00d0 _TF1 = 0x008f _TR1 = 0x008e _TF0 = 0x008d _TR0 = 0x008c _IE1 = 0x008b _IT1 = 0x008a _IE0 = 0x0089 _IT0 = 0x0088 _EA = 0x00af _ES = 0x00ac _ET1 = 0x00ab _EX1 = 0x00aa _ET0 = 0x00a9 _EX0 = 0x00a8 _PS = 0x00bc _PT1 = 0x00bb _PX1 = 0x00ba _PT0 = 0x00b9 _PX0 = 0x00b8 _RD = 0x00b7 _WR = 0x00b6 _T1 = 0x00b5 _T0 = 0x00b4 _INT1 = 0x00b3 _INT0 = 0x00b2 _TXD = 0x00b1 _RXD = 0x00b0 _SM0 = 0x009f _SM1 = 0x009e _SM2 = 0x009d _REN = 0x009c _TB8 = 0x009b _RB8 = 0x009a _TI = 0x0099 _RI = 0x0098 ;-------------------------------------------------------- ; overlayable register banks ;-------------------------------------------------------- .area REG_BANK_0 (REL,OVR,DATA) .ds 8 ;-------------------------------------------------------- ; internal ram data ;-------------------------------------------------------- .area DSEG (DATA) _tmr0count: .ds 1 _led_ticks: .ds 1 _led_timer: .ds 1 _led_tick_threshold: .ds 1 _tmr1count: .ds 1 _tmr1reload: .ds 2 ;-------------------------------------------------------- ; overlayable items in internal ram ;-------------------------------------------------------- .area OSEG (OVR,DATA) ;-------------------------------------------------------- ; indirectly addressable internal ram data ;-------------------------------------------------------- .area ISEG (DATA) ;-------------------------------------------------------- ; absolute internal ram data ;-------------------------------------------------------- .area IABS (ABS,DATA) .area IABS (ABS,DATA) ;-------------------------------------------------------- ; bit data ;-------------------------------------------------------- .area BSEG (BIT) ;-------------------------------------------------------- ; paged external ram data ;-------------------------------------------------------- .area PSEG (PAG,XDATA) ;-------------------------------------------------------- ; external ram data ;-------------------------------------------------------- .area XSEG (XDATA) _REGBANK = 0xf000 _USBCTL = 0xf008 _USBSTAT = 0xf009 _USBIRQ = 0xf027 _EPIRQ = 0xf020 _EPIE = 0xf030 _EP0CS = 0xf048 _SETUPDAT = 0xf0b8 _EP0 = 0xf1c0 _EP1 = 0xf200 _EP2 = 0xf240 _EP3 = 0xf280 _EP4 = 0xf2c0 _NANDCSOUT = 0xf608 _NANDCSDIR = 0xf618 _DMASRCL = 0xf900 _DMASRCM = 0xf901 _DMASRCH = 0xf902 _DMADSTL = 0xf904 _DMADSTM = 0xf905 _DMADSTH = 0xf906 _DMASIZEL = 0xf908 _DMASIZEM = 0xf909 _DMASIZEH = 0xf90a _DMAFILL0 = 0xf90c _DMAFILL1 = 0xf90d _DMAFILL2 = 0xf90e _DMAFILL3 = 0xf90f _DMACMD = 0xf930 _GPIO0DIR = 0xfa14 _GPIO0OUT = 0xfa15 _WARMSTATUS = 0xfa38 _BANK0PAL = 0xfa40 _BANK0PAH = 0xfa41 _BANK1VA = 0xfa42 _BANK1PAL = 0xfa43 _BANK1PAH = 0xfa44 _BANK2VA = 0xfa45 _BANK2PAL = 0xfa46 _BANK2PAH = 0xfa47 _PRAMCTL = 0xfa48 ;-------------------------------------------------------- ; absolute external ram data ;-------------------------------------------------------- .area XABS (ABS,XDATA) ;-------------------------------------------------------- ; external initialized ram data ;-------------------------------------------------------- .area XISEG (XDATA) .area HOME (CODE) .area GSINIT0 (CODE) .area GSINIT1 (CODE) .area GSINIT2 (CODE) .area GSINIT3 (CODE) .area GSINIT4 (CODE) .area GSINIT5 (CODE) .area GSINIT (CODE) .area GSFINAL (CODE) .area CSEG (CODE) ;-------------------------------------------------------- ; global & static initialisations ;-------------------------------------------------------- .area HOME (CODE) .area GSINIT (CODE) .area GSFINAL (CODE) .area GSINIT (CODE) ;-------------------------------------------------------- ; Home ;-------------------------------------------------------- .area HOME (CODE) .area HOME (CODE) ;-------------------------------------------------------- ; code ;-------------------------------------------------------- .area CSEG (CODE) ;------------------------------------------------------------ ;Allocation info for local variables in function 'tmr1isr' ;------------------------------------------------------------ ; timers.c:8: void tmr1isr(void) __interrupt TMR1_VECT ; ----------------------------------------- ; function tmr1isr ; ----------------------------------------- _tmr1isr: ar7 = 0x07 ar6 = 0x06 ar5 = 0x05 ar4 = 0x04 ar3 = 0x03 ar2 = 0x02 ar1 = 0x01 ar0 = 0x00 ; timers.c:10: TR1 = 0; ; assignBit clr _TR1 ; timers.c:11: TH1 = MSB(tmr1reload); mov _TH1,(_tmr1reload + 1) ; timers.c:12: TL1 = LSB(tmr1reload); mov _TL1,_tmr1reload ; timers.c:13: tmr1count++; inc _tmr1count ; timers.c:14: TR1 = 1; ; assignBit setb _TR1 ; timers.c:15: } reti ; eliminated unneeded mov psw,# (no regs used in bank) ; eliminated unneeded push/pop psw ; eliminated unneeded push/pop dpl ; eliminated unneeded push/pop dph ; eliminated unneeded push/pop b ; eliminated unneeded push/pop acc ;------------------------------------------------------------ ;Allocation info for local variables in function 'InitTicks' ;------------------------------------------------------------ ; timers.c:17: void InitTicks() ; ----------------------------------------- ; function InitTicks ; ----------------------------------------- _InitTicks: ; timers.c:19: if (XVAL(0xFA60) == 0x0F) mov dptr,#0xfa60 movx a,@dptr mov r7,a cjne r7,#0x0f,00102$ ; timers.c:21: tmr1reload = 0xF63C; mov _tmr1reload,#0x3c mov (_tmr1reload + 1),#0xf6 sjmp 00103$ 00102$: ; timers.c:25: tmr1reload = 0-(2500/(XVAL(0xFA60)+2)); mov dptr,#0xfa60 movx a,@dptr mov r7,a mov r6,#0x00 mov a,#0x02 add a,r7 mov __divsint_PARM_2,a clr a addc a,r6 mov (__divsint_PARM_2 + 1),a mov dptr,#0x09c4 lcall __divsint mov r6,dpl mov r7,dph clr c clr a subb a,r6 mov _tmr1reload,a clr a subb a,r7 mov (_tmr1reload + 1),a 00103$: ; timers.c:28: tmr1count = 0; mov _tmr1count,#0x00 ; timers.c:29: TR1 = 0; ; assignBit clr _TR1 ; timers.c:30: ET1 = 1; ; assignBit setb _ET1 ; timers.c:31: TMOD = TMOD & 0x0F | 0x10; mov r6,_TMOD anl ar6,#0x0f orl ar6,#0x10 mov _TMOD,r6 ; timers.c:32: } ret ;------------------------------------------------------------ ;Allocation info for local variables in function 'GetTickCount' ;------------------------------------------------------------ ; timers.c:34: BYTE GetTickCount(void) ; ----------------------------------------- ; function GetTickCount ; ----------------------------------------- _GetTickCount: ; timers.c:36: return tmr1count; mov dpl,_tmr1count ; timers.c:37: } ret ;------------------------------------------------------------ ;Allocation info for local variables in function 'tmr0isr' ;------------------------------------------------------------ ; timers.c:39: void tmr0isr(void) __interrupt TMR0_VECT ; ----------------------------------------- ; function tmr0isr ; ----------------------------------------- _tmr0isr: push acc push dpl push dph push ar7 push ar6 push psw mov psw,#0x00 ; timers.c:42: TR0 = 0; ; assignBit clr _TR0 ; timers.c:43: TL0 = 0xE6; mov _TL0,#0xe6 ; timers.c:44: TH0 = 0x96; mov _TH0,#0x96 ; timers.c:45: TR0 = 1; ; assignBit setb _TR0 ; timers.c:47: if ((GPIO0OUT & 2) == 0) //turned off mov dptr,#_GPIO0OUT movx a,@dptr jb acc.1,00102$ ; timers.c:49: return; sjmp 00114$ 00102$: ; timers.c:52: tmr0count++; inc _tmr0count ; timers.c:53: led_ticks++; inc _led_ticks ; timers.c:54: if (led_ticks < led_tick_threshold) clr c mov a,_led_ticks subb a,_led_tick_threshold jnc 00104$ ; timers.c:56: return; sjmp 00114$ 00104$: ; timers.c:59: led_ticks = 0; mov _led_ticks,#0x00 ; timers.c:60: if (led_timer >= 31) mov a,#0x100 - 0x1f add a,_led_timer jnc 00106$ ; timers.c:62: GPIO0OUT = 1; mov dptr,#_GPIO0OUT mov a,#0x01 movx @dptr,a ; timers.c:63: led_timer = 0; mov _led_timer,#0x00 ; timers.c:64: return; sjmp 00114$ 00106$: ; timers.c:67: if (led_timer >= 10) mov a,#0x100 - 0x0a add a,_led_timer jnc 00108$ ; timers.c:69: GPIO0OUT = ~GPIO0OUT; mov dptr,#_GPIO0OUT movx a,@dptr mov r7,a cpl a movx @dptr,a ; timers.c:70: led_timer++; inc _led_timer ; timers.c:71: return; sjmp 00114$ 00108$: ; timers.c:74: if (led_timer == 0) mov a,_led_timer jnz 00110$ ; timers.c:76: return; sjmp 00114$ 00110$: ; timers.c:79: if (GPIO0OUT & 1) mov dptr,#_GPIO0OUT movx a,@dptr jnb acc.0,00112$ ; timers.c:81: GPIO0OUT &= 0xFE; mov dptr,#_GPIO0OUT movx a,@dptr anl acc,#0xfe movx @dptr,a sjmp 00114$ 00112$: ; timers.c:85: GPIO0OUT |= 1; mov dptr,#_GPIO0OUT movx a,@dptr mov r7,a mov r6,#0x00 orl ar7,#0x01 mov dptr,#_GPIO0OUT mov a,r7 movx @dptr,a 00114$: ; timers.c:87: } pop psw pop ar6 pop ar7 pop dph pop dpl pop acc reti ; eliminated unneeded push/pop b ;------------------------------------------------------------ ;Allocation info for local variables in function 'SetLEDThreshold' ;------------------------------------------------------------ ;threshold Allocated to registers r6 r7 ;------------------------------------------------------------ ; timers.c:89: void SetLEDThreshold(int threshold) ; ----------------------------------------- ; function SetLEDThreshold ; ----------------------------------------- _SetLEDThreshold: mov r6,dpl ; timers.c:91: led_tick_threshold = threshold; mov _led_tick_threshold,r6 ; timers.c:92: } ret ;------------------------------------------------------------ ;Allocation info for local variables in function 'InitLED' ;------------------------------------------------------------ ; timers.c:94: void InitLED(void) ; ----------------------------------------- ; function InitLED ; ----------------------------------------- _InitLED: ; timers.c:96: led_tick_threshold = 100; mov _led_tick_threshold,#0x64 ; timers.c:97: tmr0count = 0; mov _tmr0count,#0x00 ; timers.c:98: GPIO0OUT = 3; mov dptr,#_GPIO0OUT mov a,#0x03 movx @dptr,a ; timers.c:99: led_ticks = 0; mov _led_ticks,#0x00 ; timers.c:100: led_timer = 0; mov _led_timer,#0x00 ; timers.c:101: EA = 1; ; assignBit setb _EA ; timers.c:102: ET0 = 1; ; assignBit setb _ET0 ; timers.c:103: TR0 = 1; ; assignBit setb _TR0 ; timers.c:104: } ret ;------------------------------------------------------------ ;Allocation info for local variables in function 'LEDBlink' ;------------------------------------------------------------ ; timers.c:106: void LEDBlink(void) ; ----------------------------------------- ; function LEDBlink ; ----------------------------------------- _LEDBlink: ; timers.c:108: GPIO0OUT = 2; mov dptr,#_GPIO0OUT mov a,#0x02 movx @dptr,a ; timers.c:109: led_timer = 1; mov _led_timer,#0x01 ; timers.c:110: } ret ;------------------------------------------------------------ ;Allocation info for local variables in function 'LEDOff' ;------------------------------------------------------------ ; timers.c:112: void LEDOff(void) ; ----------------------------------------- ; function LEDOff ; ----------------------------------------- _LEDOff: ; timers.c:114: GPIO0OUT = 3; mov dptr,#_GPIO0OUT mov a,#0x03 movx @dptr,a ; timers.c:115: led_timer = 0; mov _led_timer,#0x00 ; timers.c:116: } ret .area CSEG (CODE) .area CONST (CODE) .area XINIT (CODE) .area CABS (ABS,CODE)
src/lang/stemmer-arabic.adb
stcarrez/ada-stemmer
3
6733
<filename>src/lang/stemmer-arabic.adb -- Generated by Snowball 2.2.0 - https://snowballstem.org/ package body Stemmer.Arabic is pragma Style_Checks ("-mr"); pragma Warnings (Off, "*variable*is never read and never assigned*"); pragma Warnings (Off, "*mode could be*instead of*"); pragma Warnings (Off, "*formal parameter.*is not modified*"); pragma Warnings (Off, "*this line is too long*"); pragma Warnings (Off, "*is not referenced*"); procedure R_Checks1 (Z : in out Context_Type; Result : out Boolean); procedure R_Normalize_pre (Z : in out Context_Type; Result : out Boolean); procedure R_Normalize_post (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Verb_Step2c (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Verb_Step2b (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Verb_Step2a (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Verb_Step1 (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Noun_Step3 (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Noun_Step2c2 (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Noun_Step2c1 (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Noun_Step2b (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Noun_Step2a (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Noun_Step1b (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_Noun_Step1a (Z : in out Context_Type; Result : out Boolean); procedure R_Suffix_All_alef_maqsura (Z : in out Context_Type; Result : out Boolean); procedure R_Prefix_Step4_Verb (Z : in out Context_Type; Result : out Boolean); procedure R_Prefix_Step3_Verb (Z : in out Context_Type; Result : out Boolean); procedure R_Prefix_Step3b_Noun (Z : in out Context_Type; Result : out Boolean); procedure R_Prefix_Step3a_Noun (Z : in out Context_Type; Result : out Boolean); procedure R_Prefix_Step2 (Z : in out Context_Type; Result : out Boolean); procedure R_Prefix_Step1 (Z : in out Context_Type; Result : out Boolean); Among_String : constant String := "ـ" & "ً" & "ٌ" & "ٍ" & "َ" & "ُ" & "ِ" & "ّ" & "ْ" & "٠" & "١" & "٢" & "٣" & "٤" & "٥" & "٦" & "٧" & "٨" & "٩" & "ﺀ" & "ﺁ" & "ﺂ" & "ﺃ" & "ﺄ" & "ﺅ" & "ﺆ" & "ﺇ" & "ﺈ" & "ﺉ" & "ﺊ" & "ﺋ" & "ﺌ" & "ﺍ" & "ﺎ" & "ﺏ" & "ﺐ" & "ﺑ" & "ﺒ" & "ﺓ" & "ﺔ" & "ﺕ" & "ﺖ" & "ﺗ" & "ﺘ" & "ﺙ" & "ﺚ" & "ﺛ" & "ﺜ" & "ﺝ" & "ﺞ" & "ﺟ" & "ﺠ" & "ﺡ" & "ﺢ" & "ﺣ" & "ﺤ" & "ﺥ" & "ﺦ" & "ﺧ" & "ﺨ" & "ﺩ" & "ﺪ" & "ﺫ" & "ﺬ" & "ﺭ" & "ﺮ" & "ﺯ" & "ﺰ" & "ﺱ" & "ﺲ" & "ﺳ" & "ﺴ" & "ﺵ" & "ﺶ" & "ﺷ" & "ﺸ" & "ﺹ" & "ﺺ" & "ﺻ" & "ﺼ" & "ﺽ" & "ﺾ" & "ﺿ" & "ﻀ" & "ﻁ" & "ﻂ" & "ﻃ" & "ﻄ" & "ﻅ" & "ﻆ" & "ﻇ" & "ﻈ" & "ﻉ" & "ﻊ" & "ﻋ" & "ﻌ" & "ﻍ" & "ﻎ" & "ﻏ" & "ﻐ" & "ﻑ" & "ﻒ" & "ﻓ" & "ﻔ" & "ﻕ" & "ﻖ" & "ﻗ" & "ﻘ" & "ﻙ" & "ﻚ" & "ﻛ" & "ﻜ" & "ﻝ" & "ﻞ" & "ﻟ" & "ﻠ" & "ﻡ" & "ﻢ" & "ﻣ" & "ﻤ" & "ﻥ" & "ﻦ" & "ﻧ" & "ﻨ" & "ﻩ" & "ﻪ" & "ﻫ" & "ﻬ" & "ﻭ" & "ﻮ" & "ﻯ" & "ﻰ" & "ﻱ" & "ﻲ" & "ﻳ" & "ﻴ" & "ﻵ" & "ﻶ" & "ﻷ" & "ﻸ" & "ﻹ" & "ﻺ" & "ﻻ" & "ﻼ" & "آ" & "أ" & "ؤ" & "إ" & "ئ" & "آ" & "أ" & "ؤ" & "إ" & "ئ" & "ال" & "بال" & "كال" & "لل" & "أآ" & "أأ" & "أؤ" & "أإ" & "أا" & "ف" & "و" & "ال" & "بال" & "كال" & "لل" & "ب" & "با" & "بب" & "كك" & "سأ" & "ست" & "سن" & "سي" & "تست" & "نست" & "يست" & "ك" & "كم" & "هم" & "هن" & "ه" & "ي" & "كما" & "هما" & "نا" & "ها" & "ن" & "و" & "ي" & "ا" & "ات" & "ت" & "ة" & "ي" & "ك" & "كم" & "هم" & "كن" & "هن" & "ه" & "كمو" & "ني" & "كما" & "هما" & "نا" & "ها" & "ن" & "ون" & "ين" & "ان" & "تن" & "ي" & "ا" & "تما" & "نا" & "تا" & "ت" & "تم" & "وا" & "و" & "تمو" & "ى"; A_0 : constant Among_Array_Type (0 .. 143) := ( (1, 2, -1, 1, 0), (3, 4, -1, 1, 0), (5, 6, -1, 1, 0), (7, 8, -1, 1, 0), (9, 10, -1, 1, 0), (11, 12, -1, 1, 0), (13, 14, -1, 1, 0), (15, 16, -1, 1, 0), (17, 18, -1, 1, 0), (19, 20, -1, 2, 0), (21, 22, -1, 3, 0), (23, 24, -1, 4, 0), (25, 26, -1, 5, 0), (27, 28, -1, 6, 0), (29, 30, -1, 7, 0), (31, 32, -1, 8, 0), (33, 34, -1, 9, 0), (35, 36, -1, 10, 0), (37, 38, -1, 11, 0), (39, 41, -1, 12, 0), (42, 44, -1, 16, 0), (45, 47, -1, 16, 0), (48, 50, -1, 13, 0), (51, 53, -1, 13, 0), (54, 56, -1, 17, 0), (57, 59, -1, 17, 0), (60, 62, -1, 14, 0), (63, 65, -1, 14, 0), (66, 68, -1, 15, 0), (69, 71, -1, 15, 0), (72, 74, -1, 15, 0), (75, 77, -1, 15, 0), (78, 80, -1, 18, 0), (81, 83, -1, 18, 0), (84, 86, -1, 19, 0), (87, 89, -1, 19, 0), (90, 92, -1, 19, 0), (93, 95, -1, 19, 0), (96, 98, -1, 20, 0), (99, 101, -1, 20, 0), (102, 104, -1, 21, 0), (105, 107, -1, 21, 0), (108, 110, -1, 21, 0), (111, 113, -1, 21, 0), (114, 116, -1, 22, 0), (117, 119, -1, 22, 0), (120, 122, -1, 22, 0), (123, 125, -1, 22, 0), (126, 128, -1, 23, 0), (129, 131, -1, 23, 0), (132, 134, -1, 23, 0), (135, 137, -1, 23, 0), (138, 140, -1, 24, 0), (141, 143, -1, 24, 0), (144, 146, -1, 24, 0), (147, 149, -1, 24, 0), (150, 152, -1, 25, 0), (153, 155, -1, 25, 0), (156, 158, -1, 25, 0), (159, 161, -1, 25, 0), (162, 164, -1, 26, 0), (165, 167, -1, 26, 0), (168, 170, -1, 27, 0), (171, 173, -1, 27, 0), (174, 176, -1, 28, 0), (177, 179, -1, 28, 0), (180, 182, -1, 29, 0), (183, 185, -1, 29, 0), (186, 188, -1, 30, 0), (189, 191, -1, 30, 0), (192, 194, -1, 30, 0), (195, 197, -1, 30, 0), (198, 200, -1, 31, 0), (201, 203, -1, 31, 0), (204, 206, -1, 31, 0), (207, 209, -1, 31, 0), (210, 212, -1, 32, 0), (213, 215, -1, 32, 0), (216, 218, -1, 32, 0), (219, 221, -1, 32, 0), (222, 224, -1, 33, 0), (225, 227, -1, 33, 0), (228, 230, -1, 33, 0), (231, 233, -1, 33, 0), (234, 236, -1, 34, 0), (237, 239, -1, 34, 0), (240, 242, -1, 34, 0), (243, 245, -1, 34, 0), (246, 248, -1, 35, 0), (249, 251, -1, 35, 0), (252, 254, -1, 35, 0), (255, 257, -1, 35, 0), (258, 260, -1, 36, 0), (261, 263, -1, 36, 0), (264, 266, -1, 36, 0), (267, 269, -1, 36, 0), (270, 272, -1, 37, 0), (273, 275, -1, 37, 0), (276, 278, -1, 37, 0), (279, 281, -1, 37, 0), (282, 284, -1, 38, 0), (285, 287, -1, 38, 0), (288, 290, -1, 38, 0), (291, 293, -1, 38, 0), (294, 296, -1, 39, 0), (297, 299, -1, 39, 0), (300, 302, -1, 39, 0), (303, 305, -1, 39, 0), (306, 308, -1, 40, 0), (309, 311, -1, 40, 0), (312, 314, -1, 40, 0), (315, 317, -1, 40, 0), (318, 320, -1, 41, 0), (321, 323, -1, 41, 0), (324, 326, -1, 41, 0), (327, 329, -1, 41, 0), (330, 332, -1, 42, 0), (333, 335, -1, 42, 0), (336, 338, -1, 42, 0), (339, 341, -1, 42, 0), (342, 344, -1, 43, 0), (345, 347, -1, 43, 0), (348, 350, -1, 43, 0), (351, 353, -1, 43, 0), (354, 356, -1, 44, 0), (357, 359, -1, 44, 0), (360, 362, -1, 44, 0), (363, 365, -1, 44, 0), (366, 368, -1, 45, 0), (369, 371, -1, 45, 0), (372, 374, -1, 46, 0), (375, 377, -1, 46, 0), (378, 380, -1, 47, 0), (381, 383, -1, 47, 0), (384, 386, -1, 47, 0), (387, 389, -1, 47, 0), (390, 392, -1, 51, 0), (393, 395, -1, 51, 0), (396, 398, -1, 49, 0), (399, 401, -1, 49, 0), (402, 404, -1, 50, 0), (405, 407, -1, 50, 0), (408, 410, -1, 48, 0), (411, 413, -1, 48, 0)); A_1 : constant Among_Array_Type (0 .. 4) := ( (414, 415, -1, 1, 0), (416, 417, -1, 1, 0), (418, 419, -1, 1, 0), (420, 421, -1, 1, 0), (422, 423, -1, 1, 0)); A_2 : constant Among_Array_Type (0 .. 4) := ( (424, 425, -1, 1, 0), (426, 427, -1, 1, 0), (428, 429, -1, 2, 0), (430, 431, -1, 1, 0), (432, 433, -1, 3, 0)); A_3 : constant Among_Array_Type (0 .. 3) := ( (434, 437, -1, 2, 0), (438, 443, -1, 1, 0), (444, 449, -1, 1, 0), (450, 453, -1, 2, 0)); A_4 : constant Among_Array_Type (0 .. 4) := ( (454, 457, -1, 2, 0), (458, 461, -1, 1, 0), (462, 465, -1, 1, 0), (466, 469, -1, 4, 0), (470, 473, -1, 3, 0)); A_5 : constant Among_Array_Type (0 .. 1) := ( (474, 475, -1, 1, 0), (476, 477, -1, 1, 0)); A_6 : constant Among_Array_Type (0 .. 3) := ( (478, 481, -1, 2, 0), (482, 487, -1, 1, 0), (488, 493, -1, 1, 0), (494, 497, -1, 2, 0)); A_7 : constant Among_Array_Type (0 .. 3) := ( (498, 499, -1, 1, 0), (500, 503, 0, -1, 0), (504, 507, 0, 2, 0), (508, 511, -1, 3, 0)); A_8 : constant Among_Array_Type (0 .. 3) := ( (512, 515, -1, 4, 0), (516, 519, -1, 2, 0), (520, 523, -1, 3, 0), (524, 527, -1, 1, 0)); A_9 : constant Among_Array_Type (0 .. 2) := ( (528, 533, -1, 1, 0), (534, 539, -1, 1, 0), (540, 545, -1, 1, 0)); A_10 : constant Among_Array_Type (0 .. 9) := ( (546, 547, -1, 1, 0), (548, 551, -1, 2, 0), (552, 555, -1, 2, 0), (556, 559, -1, 2, 0), (560, 561, -1, 1, 0), (562, 563, -1, 1, 0), (564, 569, -1, 3, 0), (570, 575, -1, 3, 0), (576, 579, -1, 2, 0), (580, 583, -1, 2, 0)); A_11 : constant Among_Array_Type (0 .. 0) := ( others => (584, 585, -1, 1, 0)); A_12 : constant Among_Array_Type (0 .. 2) := ( (586, 587, -1, 1, 0), (588, 589, -1, 1, 0), (590, 591, -1, 1, 0)); A_13 : constant Among_Array_Type (0 .. 0) := ( others => (592, 595, -1, 1, 0)); A_14 : constant Among_Array_Type (0 .. 0) := ( others => (596, 597, -1, 1, 0)); A_15 : constant Among_Array_Type (0 .. 0) := ( others => (598, 599, -1, 1, 0)); A_16 : constant Among_Array_Type (0 .. 0) := ( others => (600, 601, -1, 1, 0)); A_17 : constant Among_Array_Type (0 .. 11) := ( (602, 603, -1, 1, 0), (604, 607, -1, 2, 0), (608, 611, -1, 2, 0), (612, 615, -1, 2, 0), (616, 619, -1, 2, 0), (620, 621, -1, 1, 0), (622, 627, -1, 3, 0), (628, 631, -1, 2, 0), (632, 637, -1, 3, 0), (638, 643, -1, 3, 0), (644, 647, -1, 2, 0), (648, 651, -1, 2, 0)); A_18 : constant Among_Array_Type (0 .. 10) := ( (652, 653, -1, 1, 0), (654, 657, 0, 3, 0), (658, 661, 0, 3, 0), (662, 665, 0, 3, 0), (666, 669, 0, 2, 0), (670, 671, -1, 1, 0), (672, 673, -1, 1, 0), (674, 679, 6, 4, 0), (680, 683, 6, 2, 0), (684, 687, 6, 2, 0), (688, 689, -1, 1, 0)); A_19 : constant Among_Array_Type (0 .. 1) := ( (690, 693, -1, 1, 0), (694, 697, -1, 1, 0)); A_20 : constant Among_Array_Type (0 .. 1) := ( (698, 699, -1, 1, 0), (700, 705, 0, 2, 0)); A_21 : constant Among_Array_Type (0 .. 0) := ( others => (706, 707, -1, 1, 0)); procedure R_Normalize_pre (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; v_2 : Char_Index; v_3 : Char_Index; begin -- do, line 247 v_1 := Z.C; -- repeat, line 247 <<lab1>> loop v_2 := Z.C; -- or, line 311 v_3 := Z.C; -- (, line 248 Z.Bra := Z.C; -- [, line 249 -- substring, line 249 Find_Among (Z, A_0, Among_String, null, A); if A = 0 then goto lab4; end if; Z.Ket := Z.C; -- ], line 249 -- among, line 249 case A is when 1 => -- (, line 250 -- delete, line 250 Slice_Del (Z); when 2 => -- (, line 254 -- <-, line 254 Slice_From (Z, "0"); when 3 => -- (, line 255 -- <-, line 255 Slice_From (Z, "1"); when 4 => -- (, line 256 -- <-, line 256 Slice_From (Z, "2"); when 5 => -- (, line 257 -- <-, line 257 Slice_From (Z, "3"); when 6 => -- (, line 258 -- <-, line 258 Slice_From (Z, "4"); when 7 => -- (, line 259 -- <-, line 259 Slice_From (Z, "5"); when 8 => -- (, line 260 -- <-, line 260 Slice_From (Z, "6"); when 9 => -- (, line 261 -- <-, line 261 Slice_From (Z, "7"); when 10 => -- (, line 262 -- <-, line 262 Slice_From (Z, "8"); when 11 => -- (, line 263 -- <-, line 263 Slice_From (Z, "9"); when 12 => -- (, line 266 -- <-, line 266 Slice_From (Z, "ء"); when 13 => -- (, line 267 -- <-, line 267 Slice_From (Z, "أ"); when 14 => -- (, line 268 -- <-, line 268 Slice_From (Z, "إ"); when 15 => -- (, line 269 -- <-, line 269 Slice_From (Z, "ئ"); when 16 => -- (, line 270 -- <-, line 270 Slice_From (Z, "آ"); when 17 => -- (, line 271 -- <-, line 271 Slice_From (Z, "ؤ"); when 18 => -- (, line 272 -- <-, line 272 Slice_From (Z, "ا"); when 19 => -- (, line 273 -- <-, line 273 Slice_From (Z, "ب"); when 20 => -- (, line 274 -- <-, line 274 Slice_From (Z, "ة"); when 21 => -- (, line 275 -- <-, line 275 Slice_From (Z, "ت"); when 22 => -- (, line 276 -- <-, line 276 Slice_From (Z, "ث"); when 23 => -- (, line 277 -- <-, line 277 Slice_From (Z, "ج"); when 24 => -- (, line 278 -- <-, line 278 Slice_From (Z, "ح"); when 25 => -- (, line 279 -- <-, line 279 Slice_From (Z, "خ"); when 26 => -- (, line 280 -- <-, line 280 Slice_From (Z, "د"); when 27 => -- (, line 281 -- <-, line 281 Slice_From (Z, "ذ"); when 28 => -- (, line 282 -- <-, line 282 Slice_From (Z, "ر"); when 29 => -- (, line 283 -- <-, line 283 Slice_From (Z, "ز"); when 30 => -- (, line 284 -- <-, line 284 Slice_From (Z, "س"); when 31 => -- (, line 285 -- <-, line 285 Slice_From (Z, "ش"); when 32 => -- (, line 286 -- <-, line 286 Slice_From (Z, "ص"); when 33 => -- (, line 287 -- <-, line 287 Slice_From (Z, "ض"); when 34 => -- (, line 288 -- <-, line 288 Slice_From (Z, "ط"); when 35 => -- (, line 289 -- <-, line 289 Slice_From (Z, "ظ"); when 36 => -- (, line 290 -- <-, line 290 Slice_From (Z, "ع"); when 37 => -- (, line 291 -- <-, line 291 Slice_From (Z, "غ"); when 38 => -- (, line 292 -- <-, line 292 Slice_From (Z, "ف"); when 39 => -- (, line 293 -- <-, line 293 Slice_From (Z, "ق"); when 40 => -- (, line 294 -- <-, line 294 Slice_From (Z, "ك"); when 41 => -- (, line 295 -- <-, line 295 Slice_From (Z, "ل"); when 42 => -- (, line 296 -- <-, line 296 Slice_From (Z, "م"); when 43 => -- (, line 297 -- <-, line 297 Slice_From (Z, "ن"); when 44 => -- (, line 298 -- <-, line 298 Slice_From (Z, "ه"); when 45 => -- (, line 299 -- <-, line 299 Slice_From (Z, "و"); when 46 => -- (, line 300 -- <-, line 300 Slice_From (Z, "ى"); when 47 => -- (, line 301 -- <-, line 301 Slice_From (Z, "ي"); when 48 => -- (, line 304 -- <-, line 304 Slice_From (Z, "لا"); when 49 => -- (, line 305 -- <-, line 305 Slice_From (Z, "لأ"); when 50 => -- (, line 306 -- <-, line 306 Slice_From (Z, "لإ"); when 51 => -- (, line 307 -- <-, line 307 Slice_From (Z, "لآ"); when others => null; end case; goto lab3; <<lab4>> Z.C := v_3; -- next, line 312 C := Skip_Utf8 (Z); if C < 0 then goto lab2; end if; Z.C := C; <<lab3>> goto lab1; <<lab2>> Z.C := v_2; exit; end loop; <<lab0>> Z.C := v_1; Result := True; end R_Normalize_pre; procedure R_Normalize_post (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; v_2 : Char_Index; v_3 : Char_Index; v_4 : Char_Index; begin -- (, line 316 -- do, line 318 v_1 := Z.C; Z.Lb := Z.C; Z.C := Z.L; -- backwards, line 320 -- (, line 320 Z.Ket := Z.C; -- [, line 321 -- substring, line 321 if Z.C - 1 <= Z.Lb or else Check_Among (Z, Z.C - 1, 5, 16#7c#) then goto lab0; -- substring, line 321 end if; Find_Among_Backward (Z, A_1, Among_String, null, A); if A = 0 then goto lab0; end if; Z.Bra := Z.C; -- ], line 321 -- (, line 322 -- <-, line 322 Slice_From (Z, "ء"); Z.C := Z.Lb; <<lab0>> Z.C := v_1; -- do, line 329 v_2 := Z.C; -- repeat, line 329 <<lab2>> loop v_3 := Z.C; -- or, line 338 v_4 := Z.C; -- (, line 330 Z.Bra := Z.C; -- [, line 332 -- substring, line 332 if Z.C + 1 >= Z.L or else Check_Among (Z, Z.C + 1, 5, 16#7c#) then goto lab5; -- substring, line 332 end if; Find_Among (Z, A_2, Among_String, null, A); if A = 0 then goto lab5; end if; Z.Ket := Z.C; -- ], line 332 -- among, line 332 case A is when 1 => -- (, line 333 -- <-, line 333 Slice_From (Z, "ا"); when 2 => -- (, line 334 -- <-, line 334 Slice_From (Z, "و"); when 3 => -- (, line 335 -- <-, line 335 Slice_From (Z, "ي"); when others => null; end case; goto lab4; <<lab5>> Z.C := v_4; -- next, line 339 C := Skip_Utf8 (Z); if C < 0 then goto lab3; end if; Z.C := C; <<lab4>> goto lab2; <<lab3>> Z.C := v_3; exit; end loop; <<lab1>> Z.C := v_2; Result := True; end R_Normalize_post; procedure R_Checks1 (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 344 Z.Bra := Z.C; -- [, line 345 -- substring, line 345 if Z.C + 3 >= Z.L or else (Character'Pos (Z.P (Z.C + 3 + 1)) /= 132 and then Character'Pos (Z.P (Z.C + 3 + 1)) /= 167) then Result := False; return; -- substring, line 345 end if; Find_Among (Z, A_3, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Ket := Z.C; -- ], line 345 -- among, line 345 case A is when 1 => -- (, line 346 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- set is_noun, line 346 Z.B_Is_noun := True; -- unset is_verb, line 346 Z.B_Is_verb := False; -- set is_defined, line 346 Z.B_Is_defined := True; when 2 => -- (, line 347 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- set is_noun, line 347 Z.B_Is_noun := True; -- unset is_verb, line 347 Z.B_Is_verb := False; -- set is_defined, line 347 Z.B_Is_defined := True; when others => null; end case; Result := True; end R_Checks1; procedure R_Prefix_Step1 (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 353 Z.Bra := Z.C; -- [, line 354 -- substring, line 354 if Z.C + 3 >= Z.L or else Check_Among (Z, Z.C + 3, 5, 16#bc#) then Result := False; return; -- substring, line 354 end if; Find_Among (Z, A_4, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Ket := Z.C; -- ], line 354 -- among, line 354 case A is when 1 => -- (, line 355 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- <-, line 355 Slice_From (Z, "أ"); when 2 => -- (, line 356 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- <-, line 356 Slice_From (Z, "آ"); when 3 => -- (, line 358 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- <-, line 358 Slice_From (Z, "ا"); when 4 => -- (, line 359 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- <-, line 359 Slice_From (Z, "إ"); when others => null; end case; Result := True; end R_Prefix_Step1; procedure R_Prefix_Step2 (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; begin -- (, line 364 Z.Bra := Z.C; -- [, line 365 -- substring, line 365 if Z.C + 1 >= Z.L or else (Character'Pos (Z.P (Z.C + 1 + 1)) /= 129 and then Character'Pos (Z.P (Z.C + 1 + 1)) /= 136) then Result := False; return; -- substring, line 365 end if; Find_Among (Z, A_5, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Ket := Z.C; -- ], line 365 -- (, line 366 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- not, line 366 v_1 := Z.C; -- literal, line 366 C := Eq_S (Z, "ا"); if C = 0 then goto lab0; end if; Z.C := Z.C + C; Result := False; return; <<lab0>> Z.C := v_1; -- delete, line 366 Slice_Del (Z); Result := True; end R_Prefix_Step2; procedure R_Prefix_Step3a_Noun (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 370 Z.Bra := Z.C; -- [, line 371 -- substring, line 371 if Z.C + 3 >= Z.L or else (Character'Pos (Z.P (Z.C + 3 + 1)) /= 132 and then Character'Pos (Z.P (Z.C + 3 + 1)) /= 167) then Result := False; return; -- substring, line 371 end if; Find_Among (Z, A_6, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Ket := Z.C; -- ], line 371 -- among, line 371 case A is when 1 => -- (, line 372 if not (Length_Utf8 (Z) > 5) then Result := False; return; end if; -- delete, line 372 Slice_Del (Z); when 2 => -- (, line 373 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- delete, line 373 Slice_Del (Z); when others => null; end case; Result := True; end R_Prefix_Step3a_Noun; procedure R_Prefix_Step3b_Noun (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 377 Z.Bra := Z.C; -- [, line 378 -- substring, line 378 if Z.C + 1 >= Z.L or else (Character'Pos (Z.P (Z.C + 1 + 1)) /= 168 and then Character'Pos (Z.P (Z.C + 1 + 1)) /= 131) then Result := False; return; -- substring, line 378 end if; Find_Among (Z, A_7, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Ket := Z.C; -- ], line 378 -- among, line 378 case A is when 1 => -- (, line 380 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- delete, line 380 Slice_Del (Z); when 2 => -- (, line 382 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- <-, line 382 Slice_From (Z, "ب"); when 3 => -- (, line 383 if not (Length_Utf8 (Z) > 3) then Result := False; return; end if; -- <-, line 383 Slice_From (Z, "ك"); when others => null; end case; Result := True; end R_Prefix_Step3b_Noun; procedure R_Prefix_Step3_Verb (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 388 Z.Bra := Z.C; -- [, line 389 -- substring, line 389 Find_Among (Z, A_8, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Ket := Z.C; -- ], line 389 -- among, line 389 case A is when 1 => -- (, line 391 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- <-, line 391 Slice_From (Z, "ي"); when 2 => -- (, line 392 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- <-, line 392 Slice_From (Z, "ت"); when 3 => -- (, line 393 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- <-, line 393 Slice_From (Z, "ن"); when 4 => -- (, line 394 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- <-, line 394 Slice_From (Z, "أ"); when others => null; end case; Result := True; end R_Prefix_Step3_Verb; procedure R_Prefix_Step4_Verb (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 398 Z.Bra := Z.C; -- [, line 399 -- substring, line 399 if Z.C + 5 >= Z.L or else Character'Pos (Z.P (Z.C + 5 + 1)) /= 170 then Result := False; return; -- substring, line 399 end if; Find_Among (Z, A_9, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Ket := Z.C; -- ], line 399 -- (, line 400 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- set is_verb, line 400 Z.B_Is_verb := True; -- unset is_noun, line 400 Z.B_Is_noun := False; -- <-, line 400 Slice_From (Z, "است"); Result := True; end R_Prefix_Step4_Verb; procedure R_Suffix_Noun_Step1a (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 407 Z.Ket := Z.C; -- [, line 408 -- substring, line 408 Find_Among_Backward (Z, A_10, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 408 -- among, line 408 case A is when 1 => -- (, line 409 if not (Length_Utf8 (Z) >= 4) then Result := False; return; end if; -- delete, line 409 Slice_Del (Z); when 2 => -- (, line 410 if not (Length_Utf8 (Z) >= 5) then Result := False; return; end if; -- delete, line 410 Slice_Del (Z); when 3 => -- (, line 411 if not (Length_Utf8 (Z) >= 6) then Result := False; return; end if; -- delete, line 411 Slice_Del (Z); when others => null; end case; Result := True; end R_Suffix_Noun_Step1a; procedure R_Suffix_Noun_Step1b (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 414 Z.Ket := Z.C; -- [, line 415 -- substring, line 415 if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 134 then Result := False; return; -- substring, line 415 end if; Find_Among_Backward (Z, A_11, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 415 -- (, line 416 if not (Length_Utf8 (Z) > 5) then Result := False; return; end if; -- delete, line 416 Slice_Del (Z); Result := True; end R_Suffix_Noun_Step1b; procedure R_Suffix_Noun_Step2a (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 420 Z.Ket := Z.C; -- [, line 421 -- substring, line 421 Find_Among_Backward (Z, A_12, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 421 -- (, line 422 if not (Length_Utf8 (Z) > 4) then Result := False; return; end if; -- delete, line 422 Slice_Del (Z); Result := True; end R_Suffix_Noun_Step2a; procedure R_Suffix_Noun_Step2b (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 426 Z.Ket := Z.C; -- [, line 427 -- substring, line 427 if Z.C - 3 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 170 then Result := False; return; -- substring, line 427 end if; Find_Among_Backward (Z, A_13, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 427 -- (, line 428 if not (Length_Utf8 (Z) >= 5) then Result := False; return; end if; -- delete, line 428 Slice_Del (Z); Result := True; end R_Suffix_Noun_Step2b; procedure R_Suffix_Noun_Step2c1 (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 432 Z.Ket := Z.C; -- [, line 433 -- substring, line 433 if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 170 then Result := False; return; -- substring, line 433 end if; Find_Among_Backward (Z, A_14, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 433 -- (, line 434 if not (Length_Utf8 (Z) >= 4) then Result := False; return; end if; -- delete, line 434 Slice_Del (Z); Result := True; end R_Suffix_Noun_Step2c1; procedure R_Suffix_Noun_Step2c2 (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 437 Z.Ket := Z.C; -- [, line 438 -- substring, line 438 if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 169 then Result := False; return; -- substring, line 438 end if; Find_Among_Backward (Z, A_15, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 438 -- (, line 439 if not (Length_Utf8 (Z) >= 4) then Result := False; return; end if; -- delete, line 439 Slice_Del (Z); Result := True; end R_Suffix_Noun_Step2c2; procedure R_Suffix_Noun_Step3 (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 442 Z.Ket := Z.C; -- [, line 443 -- substring, line 443 if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 138 then Result := False; return; -- substring, line 443 end if; Find_Among_Backward (Z, A_16, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 443 -- (, line 444 if not (Length_Utf8 (Z) >= 3) then Result := False; return; end if; -- delete, line 444 Slice_Del (Z); Result := True; end R_Suffix_Noun_Step3; procedure R_Suffix_Verb_Step1 (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 448 Z.Ket := Z.C; -- [, line 449 -- substring, line 449 Find_Among_Backward (Z, A_17, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 449 -- among, line 449 case A is when 1 => -- (, line 450 if not (Length_Utf8 (Z) >= 4) then Result := False; return; end if; -- delete, line 450 Slice_Del (Z); when 2 => -- (, line 451 if not (Length_Utf8 (Z) >= 5) then Result := False; return; end if; -- delete, line 451 Slice_Del (Z); when 3 => -- (, line 452 if not (Length_Utf8 (Z) >= 6) then Result := False; return; end if; -- delete, line 452 Slice_Del (Z); when others => null; end case; Result := True; end R_Suffix_Verb_Step1; procedure R_Suffix_Verb_Step2a (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 455 Z.Ket := Z.C; -- [, line 456 -- substring, line 456 Find_Among_Backward (Z, A_18, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 456 -- among, line 456 case A is when 1 => -- (, line 457 if not (Length_Utf8 (Z) >= 4) then Result := False; return; end if; -- delete, line 457 Slice_Del (Z); when 2 => -- (, line 459 if not (Length_Utf8 (Z) >= 5) then Result := False; return; end if; -- delete, line 459 Slice_Del (Z); when 3 => -- (, line 460 if not (Length_Utf8 (Z) > 5) then Result := False; return; end if; -- delete, line 460 Slice_Del (Z); when 4 => -- (, line 461 if not (Length_Utf8 (Z) >= 6) then Result := False; return; end if; -- delete, line 461 Slice_Del (Z); when others => null; end case; Result := True; end R_Suffix_Verb_Step2a; procedure R_Suffix_Verb_Step2b (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 465 Z.Ket := Z.C; -- [, line 466 -- substring, line 466 if Z.C - 3 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 133 and then Character'Pos (Z.P (Z.C)) /= 167) then Result := False; return; -- substring, line 466 end if; Find_Among_Backward (Z, A_19, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 466 -- (, line 467 if not (Length_Utf8 (Z) >= 5) then Result := False; return; end if; -- delete, line 467 Slice_Del (Z); Result := True; end R_Suffix_Verb_Step2b; procedure R_Suffix_Verb_Step2c (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 472 Z.Ket := Z.C; -- [, line 473 -- substring, line 473 if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 136 then Result := False; return; -- substring, line 473 end if; Find_Among_Backward (Z, A_20, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 473 -- among, line 473 case A is when 1 => -- (, line 474 if not (Length_Utf8 (Z) >= 4) then Result := False; return; end if; -- delete, line 474 Slice_Del (Z); when 2 => -- (, line 475 if not (Length_Utf8 (Z) >= 6) then Result := False; return; end if; -- delete, line 475 Slice_Del (Z); when others => null; end case; Result := True; end R_Suffix_Verb_Step2c; procedure R_Suffix_All_alef_maqsura (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; begin -- (, line 479 Z.Ket := Z.C; -- [, line 480 -- substring, line 480 if Z.C - 1 <= Z.Lb or else Character'Pos (Z.P (Z.C)) /= 137 then Result := False; return; -- substring, line 480 end if; Find_Among_Backward (Z, A_21, Among_String, null, A); if A = 0 then Result := False; return; end if; Z.Bra := Z.C; -- ], line 480 -- (, line 481 -- <-, line 481 Slice_From (Z, "ي"); Result := True; end R_Suffix_All_alef_maqsura; procedure Stem (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; v_3 : Char_Index; v_4 : Char_Index; v_5 : Char_Index; v_6 : Integer; v_7 : Char_Index; v_8 : Char_Index; v_9 : Char_Index; v_10 : Char_Index; v_12 : Char_Index; v_13 : Char_Index; v_15 : Char_Index; v_16 : Char_Index; v_17 : Char_Index; v_18 : Char_Index; v_19 : Char_Index; begin -- (, line 488 -- set is_noun, line 490 Z.B_Is_noun := True; -- set is_verb, line 491 Z.B_Is_verb := True; -- unset is_defined, line 492 Z.B_Is_defined := False; -- do, line 495 v_1 := Z.C; -- call Checks1, line 495 R_Checks1 (Z, Result); Z.C := v_1; -- do, line 498 -- call Normalize_pre, line 498 R_Normalize_pre (Z, Result); Z.Lb := Z.C; Z.C := Z.L; -- backwards, line 501 -- do, line 503 v_3 := Z.L - Z.C; -- or, line 517 v_4 := Z.L - Z.C; -- (, line 505 -- Boolean test is_verb, line 506 if not Z.B_Is_verb then goto lab2; end if; -- or, line 512 v_5 := Z.L - Z.C; -- (, line 508 -- atleast, line 509 begin v_6 := 1; <<lab5>> loop v_7 := Z.L - Z.C; -- call Suffix_Verb_Step1, line 509 R_Suffix_Verb_Step1 (Z, Result); if not Result then goto lab6; end if; v_6 := v_6 - 1; goto lab5; <<lab6>> Z.C := Z.L - v_7; exit; end loop; if v_6 > 0 then goto lab4; end if; end; -- or, line 510 v_8 := Z.L - Z.C; -- call Suffix_Verb_Step2a, line 510 R_Suffix_Verb_Step2a (Z, Result); if not Result then goto lab8; end if; goto lab7; <<lab8>> Z.C := Z.L - v_8; -- call Suffix_Verb_Step2c, line 510 R_Suffix_Verb_Step2c (Z, Result); if not Result then goto lab9; end if; goto lab7; <<lab9>> Z.C := Z.L - v_8; -- next, line 510 C := Skip_Utf8_Backward (Z); if C < 0 then goto lab4; end if; Z.C := C; <<lab7>> goto lab3; <<lab4>> Z.C := Z.L - v_5; -- call Suffix_Verb_Step2b, line 512 R_Suffix_Verb_Step2b (Z, Result); if not Result then goto lab10; end if; goto lab3; <<lab10>> Z.C := Z.L - v_5; -- call Suffix_Verb_Step2a, line 513 R_Suffix_Verb_Step2a (Z, Result); if not Result then goto lab2; end if; <<lab3>> goto lab1; <<lab2>> Z.C := Z.L - v_4; -- (, line 517 -- Boolean test is_noun, line 518 if not Z.B_Is_noun then goto lab11; end if; -- (, line 519 -- try, line 521 v_9 := Z.L - Z.C; -- or, line 523 v_10 := Z.L - Z.C; -- call Suffix_Noun_Step2c2, line 522 R_Suffix_Noun_Step2c2 (Z, Result); if not Result then goto lab14; end if; goto lab13; <<lab14>> Z.C := Z.L - v_10; -- (, line 523 -- not, line 523 -- Boolean test is_defined, line 523 if not Z.B_Is_defined then goto lab16; end if; goto lab15; <<lab16>> -- call Suffix_Noun_Step1a, line 523 R_Suffix_Noun_Step1a (Z, Result); if not Result then goto lab15; end if; -- or, line 525 v_12 := Z.L - Z.C; -- call Suffix_Noun_Step2a, line 524 R_Suffix_Noun_Step2a (Z, Result); if not Result then goto lab18; end if; goto lab17; <<lab18>> Z.C := Z.L - v_12; -- call Suffix_Noun_Step2b, line 525 R_Suffix_Noun_Step2b (Z, Result); if not Result then goto lab19; end if; goto lab17; <<lab19>> Z.C := Z.L - v_12; -- call Suffix_Noun_Step2c1, line 526 R_Suffix_Noun_Step2c1 (Z, Result); if not Result then goto lab20; end if; goto lab17; <<lab20>> Z.C := Z.L - v_12; -- next, line 527 C := Skip_Utf8_Backward (Z); if C < 0 then goto lab15; end if; Z.C := C; <<lab17>> goto lab13; <<lab15>> Z.C := Z.L - v_10; -- (, line 528 -- call Suffix_Noun_Step1b, line 528 R_Suffix_Noun_Step1b (Z, Result); if not Result then goto lab21; end if; -- or, line 530 v_13 := Z.L - Z.C; -- call Suffix_Noun_Step2a, line 529 R_Suffix_Noun_Step2a (Z, Result); if not Result then goto lab23; end if; goto lab22; <<lab23>> Z.C := Z.L - v_13; -- call Suffix_Noun_Step2b, line 530 R_Suffix_Noun_Step2b (Z, Result); if not Result then goto lab24; end if; goto lab22; <<lab24>> Z.C := Z.L - v_13; -- call Suffix_Noun_Step2c1, line 531 R_Suffix_Noun_Step2c1 (Z, Result); if not Result then goto lab21; end if; <<lab22>> goto lab13; <<lab21>> Z.C := Z.L - v_10; -- (, line 532 -- not, line 532 -- Boolean test is_defined, line 532 if not Z.B_Is_defined then goto lab26; end if; goto lab25; <<lab26>> -- call Suffix_Noun_Step2a, line 532 R_Suffix_Noun_Step2a (Z, Result); if not Result then goto lab25; end if; goto lab13; <<lab25>> Z.C := Z.L - v_10; -- call Suffix_Noun_Step2b, line 533 R_Suffix_Noun_Step2b (Z, Result); if not Result then Z.C := Z.L - v_9; goto lab12; end if; <<lab13>> <<lab12>> -- call Suffix_Noun_Step3, line 535 R_Suffix_Noun_Step3 (Z, Result); if not Result then goto lab11; end if; goto lab1; <<lab11>> Z.C := Z.L - v_4; -- call Suffix_All_alef_maqsura, line 541 R_Suffix_All_alef_maqsura (Z, Result); if not Result then goto lab0; end if; <<lab1>> <<lab0>> Z.C := Z.L - v_3; Z.C := Z.Lb; -- do, line 546 v_15 := Z.C; -- (, line 546 -- try, line 547 v_16 := Z.C; -- call Prefix_Step1, line 547 R_Prefix_Step1 (Z, Result); if not Result then Z.C := v_16; goto lab28; end if; <<lab28>> -- try, line 548 v_17 := Z.C; -- call Prefix_Step2, line 548 R_Prefix_Step2 (Z, Result); if not Result then Z.C := v_17; goto lab29; end if; <<lab29>> -- or, line 550 v_18 := Z.C; -- call Prefix_Step3a_Noun, line 549 R_Prefix_Step3a_Noun (Z, Result); if not Result then goto lab31; end if; goto lab30; <<lab31>> Z.C := v_18; -- (, line 550 -- Boolean test is_noun, line 550 if not Z.B_Is_noun then goto lab32; end if; -- call Prefix_Step3b_Noun, line 550 R_Prefix_Step3b_Noun (Z, Result); if not Result then goto lab32; end if; goto lab30; <<lab32>> Z.C := v_18; -- (, line 551 -- Boolean test is_verb, line 551 if not Z.B_Is_verb then goto lab27; end if; -- try, line 551 v_19 := Z.C; -- call Prefix_Step3_Verb, line 551 R_Prefix_Step3_Verb (Z, Result); if not Result then Z.C := v_19; goto lab33; end if; <<lab33>> -- call Prefix_Step4_Verb, line 551 R_Prefix_Step4_Verb (Z, Result); if not Result then goto lab27; end if; <<lab30>> <<lab27>> Z.C := v_15; -- do, line 556 -- call Normalize_post, line 556 R_Normalize_post (Z, Result); Result := True; end Stem; end Stemmer.Arabic;
programs/oeis/232/A232749.asm
karttu/loda
0
28000
; A232749: Inverse function to Hofstadter's A030124. ; 0,1,0,2,3,4,0,5,6,7,8,0,9,10,11,12,13,0,14,15,16,17,18,19,20,0,21,22,23,24,25,26,27,28,0,29,30,31,32,33,34,35,36,37,0,38,39,40,41,42,43,44,45,46,47,0,48,49,50,51,52,53,54,55,56,57,58,59,0,60 mov $2,$0 mov $6,2 lpb $6,1 mov $0,$2 sub $6,1 add $0,$6 sub $0,1 mov $3,4 cal $0,232748 ; Partial sums of the characteristic function of Hofstadter's A030124. mul $3,$0 mov $4,$0 mul $4,$3 add $3,$4 mov $4,$3 mov $5,$6 lpb $5,1 mov $1,$4 sub $5,1 lpe lpe lpb $2,1 sub $1,$4 mov $2,0 lpe div $1,8
Transynther/x86/_processed/NC/_zr_/i7-7700_9_0x48.log_2_1493.asm
ljhsiun2/medusa
9
25798
<gh_stars>1-10 .global s_prepare_buffers s_prepare_buffers: push %r10 push %r11 push %r14 push %r9 push %rbp push %rdi push %rsi lea addresses_normal_ht+0x646a, %r9 nop nop nop nop nop xor %r10, %r10 movb (%r9), %r11b nop dec %rbp lea addresses_UC_ht+0xdb5a, %rdi nop nop nop xor %r14, %r14 mov $0x6162636465666768, %rsi movq %rsi, %xmm0 movups %xmm0, (%rdi) nop nop nop nop nop cmp %r10, %r10 pop %rsi pop %rdi pop %rbp pop %r9 pop %r14 pop %r11 pop %r10 ret .global s_faulty_load s_faulty_load: push %r12 push %r14 push %r9 push %rbx push %rcx push %rdi push %rsi // REPMOV lea addresses_RW+0x981a, %rsi lea addresses_normal+0x345a, %rdi add %rbx, %rbx mov $81, %rcx rep movsl nop and $27471, %r14 // Store lea addresses_A+0x1b745, %rcx nop nop nop cmp %r9, %r9 mov $0x5152535455565758, %r14 movq %r14, (%rcx) nop inc %r14 // Store lea addresses_UC+0x14f9a, %r14 nop nop sub %r12, %r12 mov $0x5152535455565758, %rsi movq %rsi, (%r14) nop nop nop sub $35377, %r12 // Store lea addresses_A+0x15d9a, %rbx nop nop nop nop nop cmp %rdi, %rdi movb $0x51, (%rbx) nop add %rsi, %rsi // Store lea addresses_RW+0x6da2, %rbx sub $36186, %r9 movl $0x51525354, (%rbx) nop nop nop and %r9, %r9 // Store lea addresses_PSE+0xe19a, %r12 sub $18193, %rbx mov $0x5152535455565758, %rcx movq %rcx, %xmm3 movaps %xmm3, (%r12) nop nop nop inc %rdi // Store mov $0x1b2fe1000000019a, %r14 nop nop nop cmp %r9, %r9 mov $0x5152535455565758, %r12 movq %r12, %xmm2 movups %xmm2, (%r14) nop xor $63523, %r12 // Faulty Load mov $0x502c16000000019a, %rcx nop nop add $45668, %rsi vmovups (%rcx), %ymm5 vextracti128 $1, %ymm5, %xmm5 vpextrq $0, %xmm5, %rbx lea oracles, %r14 and $0xff, %rbx shlq $12, %rbx mov (%r14,%rbx,1), %rbx pop %rsi pop %rdi pop %rcx pop %rbx pop %r9 pop %r14 pop %r12 ret /* <gen_faulty_load> [REF] {'OP': 'LOAD', 'src': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 0, 'size': 32, 'same': False, 'NT': False}} {'OP': 'REPM', 'src': {'type': 'addresses_RW', 'congruent': 7, 'same': False}, 'dst': {'type': 'addresses_normal', 'congruent': 6, 'same': False}} {'OP': 'STOR', 'dst': {'type': 'addresses_A', 'AVXalign': False, 'congruent': 0, 'size': 8, 'same': False, 'NT': True}} {'OP': 'STOR', 'dst': {'type': 'addresses_UC', 'AVXalign': False, 'congruent': 9, 'size': 8, 'same': False, 'NT': False}} {'OP': 'STOR', 'dst': {'type': 'addresses_A', 'AVXalign': False, 'congruent': 6, 'size': 1, 'same': False, 'NT': False}} {'OP': 'STOR', 'dst': {'type': 'addresses_RW', 'AVXalign': False, 'congruent': 2, 'size': 4, 'same': False, 'NT': False}} {'OP': 'STOR', 'dst': {'type': 'addresses_PSE', 'AVXalign': True, 'congruent': 9, 'size': 16, 'same': False, 'NT': False}} {'OP': 'STOR', 'dst': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 11, 'size': 16, 'same': False, 'NT': False}} [Faulty Load] {'OP': 'LOAD', 'src': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 0, 'size': 32, 'same': True, 'NT': False}} <gen_prepare_buffer> {'OP': 'LOAD', 'src': {'type': 'addresses_normal_ht', 'AVXalign': False, 'congruent': 4, 'size': 1, 'same': True, 'NT': False}} {'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'AVXalign': False, 'congruent': 6, 'size': 16, 'same': False, 'NT': False}} {'00': 2} 00 00 */
3-mid/opengl/source/lean/model/opengl-model-capsule.ads
charlie5/lace
20
2967
<filename>3-mid/opengl/source/lean/model/opengl-model-capsule.ads package openGL.Model.capsule -- -- Provides an abstract base class for capsule models. -- is type Item is abstract new openGL.Model.item with null record; end openGL.Model.capsule;
generated-src/win-x86_64/crypto/fipsmodule/sha512-x86_64.asm
jylama99/aws-lc
0
162803
<filename>generated-src/win-x86_64/crypto/fipsmodule/sha512-x86_64.asm ; This file is generated from a similarly-named Perl script in the BoringSSL ; source tree. Do not edit by hand. default rel %define XMMWORD %define YMMWORD %define ZMMWORD %ifdef BORINGSSL_PREFIX %include "boringssl_prefix_symbols_nasm.inc" %endif section .text code align=64 EXTERN OPENSSL_ia32cap_P global sha512_block_data_order ALIGN 16 sha512_block_data_order: mov QWORD[8+rsp],rdi ;WIN64 prologue mov QWORD[16+rsp],rsi mov rax,rsp $L$SEH_begin_sha512_block_data_order: mov rdi,rcx mov rsi,rdx mov rdx,r8 lea r11,[OPENSSL_ia32cap_P] mov r9d,DWORD[r11] mov r10d,DWORD[4+r11] mov r11d,DWORD[8+r11] and r9d,1073741824 and r10d,268435968 or r10d,r9d cmp r10d,1342177792 je NEAR $L$avx_shortcut mov rax,rsp push rbx push rbp push r12 push r13 push r14 push r15 shl rdx,4 sub rsp,16*8+4*8 lea rdx,[rdx*8+rsi] and rsp,-64 mov QWORD[((128+0))+rsp],rdi mov QWORD[((128+8))+rsp],rsi mov QWORD[((128+16))+rsp],rdx mov QWORD[152+rsp],rax $L$prologue: mov rax,QWORD[rdi] mov rbx,QWORD[8+rdi] mov rcx,QWORD[16+rdi] mov rdx,QWORD[24+rdi] mov r8,QWORD[32+rdi] mov r9,QWORD[40+rdi] mov r10,QWORD[48+rdi] mov r11,QWORD[56+rdi] jmp NEAR $L$loop ALIGN 16 $L$loop: mov rdi,rbx lea rbp,[K512] xor rdi,rcx mov r12,QWORD[rsi] mov r13,r8 mov r14,rax bswap r12 ror r13,23 mov r15,r9 xor r13,r8 ror r14,5 xor r15,r10 mov QWORD[rsp],r12 xor r14,rax and r15,r8 ror r13,4 add r12,r11 xor r15,r10 ror r14,6 xor r13,r8 add r12,r15 mov r15,rax add r12,QWORD[rbp] xor r14,rax xor r15,rbx ror r13,14 mov r11,rbx and rdi,r15 ror r14,28 add r12,r13 xor r11,rdi add rdx,r12 add r11,r12 lea rbp,[8+rbp] add r11,r14 mov r12,QWORD[8+rsi] mov r13,rdx mov r14,r11 bswap r12 ror r13,23 mov rdi,r8 xor r13,rdx ror r14,5 xor rdi,r9 mov QWORD[8+rsp],r12 xor r14,r11 and rdi,rdx ror r13,4 add r12,r10 xor rdi,r9 ror r14,6 xor r13,rdx add r12,rdi mov rdi,r11 add r12,QWORD[rbp] xor r14,r11 xor rdi,rax ror r13,14 mov r10,rax and r15,rdi ror r14,28 add r12,r13 xor r10,r15 add rcx,r12 add r10,r12 lea rbp,[24+rbp] add r10,r14 mov r12,QWORD[16+rsi] mov r13,rcx mov r14,r10 bswap r12 ror r13,23 mov r15,rdx xor r13,rcx ror r14,5 xor r15,r8 mov QWORD[16+rsp],r12 xor r14,r10 and r15,rcx ror r13,4 add r12,r9 xor r15,r8 ror r14,6 xor r13,rcx add r12,r15 mov r15,r10 add r12,QWORD[rbp] xor r14,r10 xor r15,r11 ror r13,14 mov r9,r11 and rdi,r15 ror r14,28 add r12,r13 xor r9,rdi add rbx,r12 add r9,r12 lea rbp,[8+rbp] add r9,r14 mov r12,QWORD[24+rsi] mov r13,rbx mov r14,r9 bswap r12 ror r13,23 mov rdi,rcx xor r13,rbx ror r14,5 xor rdi,rdx mov QWORD[24+rsp],r12 xor r14,r9 and rdi,rbx ror r13,4 add r12,r8 xor rdi,rdx ror r14,6 xor r13,rbx add r12,rdi mov rdi,r9 add r12,QWORD[rbp] xor r14,r9 xor rdi,r10 ror r13,14 mov r8,r10 and r15,rdi ror r14,28 add r12,r13 xor r8,r15 add rax,r12 add r8,r12 lea rbp,[24+rbp] add r8,r14 mov r12,QWORD[32+rsi] mov r13,rax mov r14,r8 bswap r12 ror r13,23 mov r15,rbx xor r13,rax ror r14,5 xor r15,rcx mov QWORD[32+rsp],r12 xor r14,r8 and r15,rax ror r13,4 add r12,rdx xor r15,rcx ror r14,6 xor r13,rax add r12,r15 mov r15,r8 add r12,QWORD[rbp] xor r14,r8 xor r15,r9 ror r13,14 mov rdx,r9 and rdi,r15 ror r14,28 add r12,r13 xor rdx,rdi add r11,r12 add rdx,r12 lea rbp,[8+rbp] add rdx,r14 mov r12,QWORD[40+rsi] mov r13,r11 mov r14,rdx bswap r12 ror r13,23 mov rdi,rax xor r13,r11 ror r14,5 xor rdi,rbx mov QWORD[40+rsp],r12 xor r14,rdx and rdi,r11 ror r13,4 add r12,rcx xor rdi,rbx ror r14,6 xor r13,r11 add r12,rdi mov rdi,rdx add r12,QWORD[rbp] xor r14,rdx xor rdi,r8 ror r13,14 mov rcx,r8 and r15,rdi ror r14,28 add r12,r13 xor rcx,r15 add r10,r12 add rcx,r12 lea rbp,[24+rbp] add rcx,r14 mov r12,QWORD[48+rsi] mov r13,r10 mov r14,rcx bswap r12 ror r13,23 mov r15,r11 xor r13,r10 ror r14,5 xor r15,rax mov QWORD[48+rsp],r12 xor r14,rcx and r15,r10 ror r13,4 add r12,rbx xor r15,rax ror r14,6 xor r13,r10 add r12,r15 mov r15,rcx add r12,QWORD[rbp] xor r14,rcx xor r15,rdx ror r13,14 mov rbx,rdx and rdi,r15 ror r14,28 add r12,r13 xor rbx,rdi add r9,r12 add rbx,r12 lea rbp,[8+rbp] add rbx,r14 mov r12,QWORD[56+rsi] mov r13,r9 mov r14,rbx bswap r12 ror r13,23 mov rdi,r10 xor r13,r9 ror r14,5 xor rdi,r11 mov QWORD[56+rsp],r12 xor r14,rbx and rdi,r9 ror r13,4 add r12,rax xor rdi,r11 ror r14,6 xor r13,r9 add r12,rdi mov rdi,rbx add r12,QWORD[rbp] xor r14,rbx xor rdi,rcx ror r13,14 mov rax,rcx and r15,rdi ror r14,28 add r12,r13 xor rax,r15 add r8,r12 add rax,r12 lea rbp,[24+rbp] add rax,r14 mov r12,QWORD[64+rsi] mov r13,r8 mov r14,rax bswap r12 ror r13,23 mov r15,r9 xor r13,r8 ror r14,5 xor r15,r10 mov QWORD[64+rsp],r12 xor r14,rax and r15,r8 ror r13,4 add r12,r11 xor r15,r10 ror r14,6 xor r13,r8 add r12,r15 mov r15,rax add r12,QWORD[rbp] xor r14,rax xor r15,rbx ror r13,14 mov r11,rbx and rdi,r15 ror r14,28 add r12,r13 xor r11,rdi add rdx,r12 add r11,r12 lea rbp,[8+rbp] add r11,r14 mov r12,QWORD[72+rsi] mov r13,rdx mov r14,r11 bswap r12 ror r13,23 mov rdi,r8 xor r13,rdx ror r14,5 xor rdi,r9 mov QWORD[72+rsp],r12 xor r14,r11 and rdi,rdx ror r13,4 add r12,r10 xor rdi,r9 ror r14,6 xor r13,rdx add r12,rdi mov rdi,r11 add r12,QWORD[rbp] xor r14,r11 xor rdi,rax ror r13,14 mov r10,rax and r15,rdi ror r14,28 add r12,r13 xor r10,r15 add rcx,r12 add r10,r12 lea rbp,[24+rbp] add r10,r14 mov r12,QWORD[80+rsi] mov r13,rcx mov r14,r10 bswap r12 ror r13,23 mov r15,rdx xor r13,rcx ror r14,5 xor r15,r8 mov QWORD[80+rsp],r12 xor r14,r10 and r15,rcx ror r13,4 add r12,r9 xor r15,r8 ror r14,6 xor r13,rcx add r12,r15 mov r15,r10 add r12,QWORD[rbp] xor r14,r10 xor r15,r11 ror r13,14 mov r9,r11 and rdi,r15 ror r14,28 add r12,r13 xor r9,rdi add rbx,r12 add r9,r12 lea rbp,[8+rbp] add r9,r14 mov r12,QWORD[88+rsi] mov r13,rbx mov r14,r9 bswap r12 ror r13,23 mov rdi,rcx xor r13,rbx ror r14,5 xor rdi,rdx mov QWORD[88+rsp],r12 xor r14,r9 and rdi,rbx ror r13,4 add r12,r8 xor rdi,rdx ror r14,6 xor r13,rbx add r12,rdi mov rdi,r9 add r12,QWORD[rbp] xor r14,r9 xor rdi,r10 ror r13,14 mov r8,r10 and r15,rdi ror r14,28 add r12,r13 xor r8,r15 add rax,r12 add r8,r12 lea rbp,[24+rbp] add r8,r14 mov r12,QWORD[96+rsi] mov r13,rax mov r14,r8 bswap r12 ror r13,23 mov r15,rbx xor r13,rax ror r14,5 xor r15,rcx mov QWORD[96+rsp],r12 xor r14,r8 and r15,rax ror r13,4 add r12,rdx xor r15,rcx ror r14,6 xor r13,rax add r12,r15 mov r15,r8 add r12,QWORD[rbp] xor r14,r8 xor r15,r9 ror r13,14 mov rdx,r9 and rdi,r15 ror r14,28 add r12,r13 xor rdx,rdi add r11,r12 add rdx,r12 lea rbp,[8+rbp] add rdx,r14 mov r12,QWORD[104+rsi] mov r13,r11 mov r14,rdx bswap r12 ror r13,23 mov rdi,rax xor r13,r11 ror r14,5 xor rdi,rbx mov QWORD[104+rsp],r12 xor r14,rdx and rdi,r11 ror r13,4 add r12,rcx xor rdi,rbx ror r14,6 xor r13,r11 add r12,rdi mov rdi,rdx add r12,QWORD[rbp] xor r14,rdx xor rdi,r8 ror r13,14 mov rcx,r8 and r15,rdi ror r14,28 add r12,r13 xor rcx,r15 add r10,r12 add rcx,r12 lea rbp,[24+rbp] add rcx,r14 mov r12,QWORD[112+rsi] mov r13,r10 mov r14,rcx bswap r12 ror r13,23 mov r15,r11 xor r13,r10 ror r14,5 xor r15,rax mov QWORD[112+rsp],r12 xor r14,rcx and r15,r10 ror r13,4 add r12,rbx xor r15,rax ror r14,6 xor r13,r10 add r12,r15 mov r15,rcx add r12,QWORD[rbp] xor r14,rcx xor r15,rdx ror r13,14 mov rbx,rdx and rdi,r15 ror r14,28 add r12,r13 xor rbx,rdi add r9,r12 add rbx,r12 lea rbp,[8+rbp] add rbx,r14 mov r12,QWORD[120+rsi] mov r13,r9 mov r14,rbx bswap r12 ror r13,23 mov rdi,r10 xor r13,r9 ror r14,5 xor rdi,r11 mov QWORD[120+rsp],r12 xor r14,rbx and rdi,r9 ror r13,4 add r12,rax xor rdi,r11 ror r14,6 xor r13,r9 add r12,rdi mov rdi,rbx add r12,QWORD[rbp] xor r14,rbx xor rdi,rcx ror r13,14 mov rax,rcx and r15,rdi ror r14,28 add r12,r13 xor rax,r15 add r8,r12 add rax,r12 lea rbp,[24+rbp] jmp NEAR $L$rounds_16_xx ALIGN 16 $L$rounds_16_xx: mov r13,QWORD[8+rsp] mov r15,QWORD[112+rsp] mov r12,r13 ror r13,7 add rax,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[72+rsp] add r12,QWORD[rsp] mov r13,r8 add r12,r15 mov r14,rax ror r13,23 mov r15,r9 xor r13,r8 ror r14,5 xor r15,r10 mov QWORD[rsp],r12 xor r14,rax and r15,r8 ror r13,4 add r12,r11 xor r15,r10 ror r14,6 xor r13,r8 add r12,r15 mov r15,rax add r12,QWORD[rbp] xor r14,rax xor r15,rbx ror r13,14 mov r11,rbx and rdi,r15 ror r14,28 add r12,r13 xor r11,rdi add rdx,r12 add r11,r12 lea rbp,[8+rbp] mov r13,QWORD[16+rsp] mov rdi,QWORD[120+rsp] mov r12,r13 ror r13,7 add r11,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[80+rsp] add r12,QWORD[8+rsp] mov r13,rdx add r12,rdi mov r14,r11 ror r13,23 mov rdi,r8 xor r13,rdx ror r14,5 xor rdi,r9 mov QWORD[8+rsp],r12 xor r14,r11 and rdi,rdx ror r13,4 add r12,r10 xor rdi,r9 ror r14,6 xor r13,rdx add r12,rdi mov rdi,r11 add r12,QWORD[rbp] xor r14,r11 xor rdi,rax ror r13,14 mov r10,rax and r15,rdi ror r14,28 add r12,r13 xor r10,r15 add rcx,r12 add r10,r12 lea rbp,[24+rbp] mov r13,QWORD[24+rsp] mov r15,QWORD[rsp] mov r12,r13 ror r13,7 add r10,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[88+rsp] add r12,QWORD[16+rsp] mov r13,rcx add r12,r15 mov r14,r10 ror r13,23 mov r15,rdx xor r13,rcx ror r14,5 xor r15,r8 mov QWORD[16+rsp],r12 xor r14,r10 and r15,rcx ror r13,4 add r12,r9 xor r15,r8 ror r14,6 xor r13,rcx add r12,r15 mov r15,r10 add r12,QWORD[rbp] xor r14,r10 xor r15,r11 ror r13,14 mov r9,r11 and rdi,r15 ror r14,28 add r12,r13 xor r9,rdi add rbx,r12 add r9,r12 lea rbp,[8+rbp] mov r13,QWORD[32+rsp] mov rdi,QWORD[8+rsp] mov r12,r13 ror r13,7 add r9,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[96+rsp] add r12,QWORD[24+rsp] mov r13,rbx add r12,rdi mov r14,r9 ror r13,23 mov rdi,rcx xor r13,rbx ror r14,5 xor rdi,rdx mov QWORD[24+rsp],r12 xor r14,r9 and rdi,rbx ror r13,4 add r12,r8 xor rdi,rdx ror r14,6 xor r13,rbx add r12,rdi mov rdi,r9 add r12,QWORD[rbp] xor r14,r9 xor rdi,r10 ror r13,14 mov r8,r10 and r15,rdi ror r14,28 add r12,r13 xor r8,r15 add rax,r12 add r8,r12 lea rbp,[24+rbp] mov r13,QWORD[40+rsp] mov r15,QWORD[16+rsp] mov r12,r13 ror r13,7 add r8,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[104+rsp] add r12,QWORD[32+rsp] mov r13,rax add r12,r15 mov r14,r8 ror r13,23 mov r15,rbx xor r13,rax ror r14,5 xor r15,rcx mov QWORD[32+rsp],r12 xor r14,r8 and r15,rax ror r13,4 add r12,rdx xor r15,rcx ror r14,6 xor r13,rax add r12,r15 mov r15,r8 add r12,QWORD[rbp] xor r14,r8 xor r15,r9 ror r13,14 mov rdx,r9 and rdi,r15 ror r14,28 add r12,r13 xor rdx,rdi add r11,r12 add rdx,r12 lea rbp,[8+rbp] mov r13,QWORD[48+rsp] mov rdi,QWORD[24+rsp] mov r12,r13 ror r13,7 add rdx,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[112+rsp] add r12,QWORD[40+rsp] mov r13,r11 add r12,rdi mov r14,rdx ror r13,23 mov rdi,rax xor r13,r11 ror r14,5 xor rdi,rbx mov QWORD[40+rsp],r12 xor r14,rdx and rdi,r11 ror r13,4 add r12,rcx xor rdi,rbx ror r14,6 xor r13,r11 add r12,rdi mov rdi,rdx add r12,QWORD[rbp] xor r14,rdx xor rdi,r8 ror r13,14 mov rcx,r8 and r15,rdi ror r14,28 add r12,r13 xor rcx,r15 add r10,r12 add rcx,r12 lea rbp,[24+rbp] mov r13,QWORD[56+rsp] mov r15,QWORD[32+rsp] mov r12,r13 ror r13,7 add rcx,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[120+rsp] add r12,QWORD[48+rsp] mov r13,r10 add r12,r15 mov r14,rcx ror r13,23 mov r15,r11 xor r13,r10 ror r14,5 xor r15,rax mov QWORD[48+rsp],r12 xor r14,rcx and r15,r10 ror r13,4 add r12,rbx xor r15,rax ror r14,6 xor r13,r10 add r12,r15 mov r15,rcx add r12,QWORD[rbp] xor r14,rcx xor r15,rdx ror r13,14 mov rbx,rdx and rdi,r15 ror r14,28 add r12,r13 xor rbx,rdi add r9,r12 add rbx,r12 lea rbp,[8+rbp] mov r13,QWORD[64+rsp] mov rdi,QWORD[40+rsp] mov r12,r13 ror r13,7 add rbx,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[rsp] add r12,QWORD[56+rsp] mov r13,r9 add r12,rdi mov r14,rbx ror r13,23 mov rdi,r10 xor r13,r9 ror r14,5 xor rdi,r11 mov QWORD[56+rsp],r12 xor r14,rbx and rdi,r9 ror r13,4 add r12,rax xor rdi,r11 ror r14,6 xor r13,r9 add r12,rdi mov rdi,rbx add r12,QWORD[rbp] xor r14,rbx xor rdi,rcx ror r13,14 mov rax,rcx and r15,rdi ror r14,28 add r12,r13 xor rax,r15 add r8,r12 add rax,r12 lea rbp,[24+rbp] mov r13,QWORD[72+rsp] mov r15,QWORD[48+rsp] mov r12,r13 ror r13,7 add rax,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[8+rsp] add r12,QWORD[64+rsp] mov r13,r8 add r12,r15 mov r14,rax ror r13,23 mov r15,r9 xor r13,r8 ror r14,5 xor r15,r10 mov QWORD[64+rsp],r12 xor r14,rax and r15,r8 ror r13,4 add r12,r11 xor r15,r10 ror r14,6 xor r13,r8 add r12,r15 mov r15,rax add r12,QWORD[rbp] xor r14,rax xor r15,rbx ror r13,14 mov r11,rbx and rdi,r15 ror r14,28 add r12,r13 xor r11,rdi add rdx,r12 add r11,r12 lea rbp,[8+rbp] mov r13,QWORD[80+rsp] mov rdi,QWORD[56+rsp] mov r12,r13 ror r13,7 add r11,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[16+rsp] add r12,QWORD[72+rsp] mov r13,rdx add r12,rdi mov r14,r11 ror r13,23 mov rdi,r8 xor r13,rdx ror r14,5 xor rdi,r9 mov QWORD[72+rsp],r12 xor r14,r11 and rdi,rdx ror r13,4 add r12,r10 xor rdi,r9 ror r14,6 xor r13,rdx add r12,rdi mov rdi,r11 add r12,QWORD[rbp] xor r14,r11 xor rdi,rax ror r13,14 mov r10,rax and r15,rdi ror r14,28 add r12,r13 xor r10,r15 add rcx,r12 add r10,r12 lea rbp,[24+rbp] mov r13,QWORD[88+rsp] mov r15,QWORD[64+rsp] mov r12,r13 ror r13,7 add r10,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[24+rsp] add r12,QWORD[80+rsp] mov r13,rcx add r12,r15 mov r14,r10 ror r13,23 mov r15,rdx xor r13,rcx ror r14,5 xor r15,r8 mov QWORD[80+rsp],r12 xor r14,r10 and r15,rcx ror r13,4 add r12,r9 xor r15,r8 ror r14,6 xor r13,rcx add r12,r15 mov r15,r10 add r12,QWORD[rbp] xor r14,r10 xor r15,r11 ror r13,14 mov r9,r11 and rdi,r15 ror r14,28 add r12,r13 xor r9,rdi add rbx,r12 add r9,r12 lea rbp,[8+rbp] mov r13,QWORD[96+rsp] mov rdi,QWORD[72+rsp] mov r12,r13 ror r13,7 add r9,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[32+rsp] add r12,QWORD[88+rsp] mov r13,rbx add r12,rdi mov r14,r9 ror r13,23 mov rdi,rcx xor r13,rbx ror r14,5 xor rdi,rdx mov QWORD[88+rsp],r12 xor r14,r9 and rdi,rbx ror r13,4 add r12,r8 xor rdi,rdx ror r14,6 xor r13,rbx add r12,rdi mov rdi,r9 add r12,QWORD[rbp] xor r14,r9 xor rdi,r10 ror r13,14 mov r8,r10 and r15,rdi ror r14,28 add r12,r13 xor r8,r15 add rax,r12 add r8,r12 lea rbp,[24+rbp] mov r13,QWORD[104+rsp] mov r15,QWORD[80+rsp] mov r12,r13 ror r13,7 add r8,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[40+rsp] add r12,QWORD[96+rsp] mov r13,rax add r12,r15 mov r14,r8 ror r13,23 mov r15,rbx xor r13,rax ror r14,5 xor r15,rcx mov QWORD[96+rsp],r12 xor r14,r8 and r15,rax ror r13,4 add r12,rdx xor r15,rcx ror r14,6 xor r13,rax add r12,r15 mov r15,r8 add r12,QWORD[rbp] xor r14,r8 xor r15,r9 ror r13,14 mov rdx,r9 and rdi,r15 ror r14,28 add r12,r13 xor rdx,rdi add r11,r12 add rdx,r12 lea rbp,[8+rbp] mov r13,QWORD[112+rsp] mov rdi,QWORD[88+rsp] mov r12,r13 ror r13,7 add rdx,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[48+rsp] add r12,QWORD[104+rsp] mov r13,r11 add r12,rdi mov r14,rdx ror r13,23 mov rdi,rax xor r13,r11 ror r14,5 xor rdi,rbx mov QWORD[104+rsp],r12 xor r14,rdx and rdi,r11 ror r13,4 add r12,rcx xor rdi,rbx ror r14,6 xor r13,r11 add r12,rdi mov rdi,rdx add r12,QWORD[rbp] xor r14,rdx xor rdi,r8 ror r13,14 mov rcx,r8 and r15,rdi ror r14,28 add r12,r13 xor rcx,r15 add r10,r12 add rcx,r12 lea rbp,[24+rbp] mov r13,QWORD[120+rsp] mov r15,QWORD[96+rsp] mov r12,r13 ror r13,7 add rcx,r14 mov r14,r15 ror r15,42 xor r13,r12 shr r12,7 ror r13,1 xor r15,r14 shr r14,6 ror r15,19 xor r12,r13 xor r15,r14 add r12,QWORD[56+rsp] add r12,QWORD[112+rsp] mov r13,r10 add r12,r15 mov r14,rcx ror r13,23 mov r15,r11 xor r13,r10 ror r14,5 xor r15,rax mov QWORD[112+rsp],r12 xor r14,rcx and r15,r10 ror r13,4 add r12,rbx xor r15,rax ror r14,6 xor r13,r10 add r12,r15 mov r15,rcx add r12,QWORD[rbp] xor r14,rcx xor r15,rdx ror r13,14 mov rbx,rdx and rdi,r15 ror r14,28 add r12,r13 xor rbx,rdi add r9,r12 add rbx,r12 lea rbp,[8+rbp] mov r13,QWORD[rsp] mov rdi,QWORD[104+rsp] mov r12,r13 ror r13,7 add rbx,r14 mov r14,rdi ror rdi,42 xor r13,r12 shr r12,7 ror r13,1 xor rdi,r14 shr r14,6 ror rdi,19 xor r12,r13 xor rdi,r14 add r12,QWORD[64+rsp] add r12,QWORD[120+rsp] mov r13,r9 add r12,rdi mov r14,rbx ror r13,23 mov rdi,r10 xor r13,r9 ror r14,5 xor rdi,r11 mov QWORD[120+rsp],r12 xor r14,rbx and rdi,r9 ror r13,4 add r12,rax xor rdi,r11 ror r14,6 xor r13,r9 add r12,rdi mov rdi,rbx add r12,QWORD[rbp] xor r14,rbx xor rdi,rcx ror r13,14 mov rax,rcx and r15,rdi ror r14,28 add r12,r13 xor rax,r15 add r8,r12 add rax,r12 lea rbp,[24+rbp] cmp BYTE[7+rbp],0 jnz NEAR $L$rounds_16_xx mov rdi,QWORD[((128+0))+rsp] add rax,r14 lea rsi,[128+rsi] add rax,QWORD[rdi] add rbx,QWORD[8+rdi] add rcx,QWORD[16+rdi] add rdx,QWORD[24+rdi] add r8,QWORD[32+rdi] add r9,QWORD[40+rdi] add r10,QWORD[48+rdi] add r11,QWORD[56+rdi] cmp rsi,QWORD[((128+16))+rsp] mov QWORD[rdi],rax mov QWORD[8+rdi],rbx mov QWORD[16+rdi],rcx mov QWORD[24+rdi],rdx mov QWORD[32+rdi],r8 mov QWORD[40+rdi],r9 mov QWORD[48+rdi],r10 mov QWORD[56+rdi],r11 jb NEAR $L$loop mov rsi,QWORD[152+rsp] mov r15,QWORD[((-48))+rsi] mov r14,QWORD[((-40))+rsi] mov r13,QWORD[((-32))+rsi] mov r12,QWORD[((-24))+rsi] mov rbp,QWORD[((-16))+rsi] mov rbx,QWORD[((-8))+rsi] lea rsp,[rsi] $L$epilogue: mov rdi,QWORD[8+rsp] ;WIN64 epilogue mov rsi,QWORD[16+rsp] DB 0F3h,0C3h ;repret $L$SEH_end_sha512_block_data_order: ALIGN 64 K512: DQ 0x428a2f98d728ae22,0x7137449123ef65cd DQ 0x428a2f98d728ae22,0x7137449123ef65cd DQ 0xb5c0fbcfec4d3b2f,0xe9b5dba58189dbbc DQ 0xb5c0fbcfec4d3b2f,0xe9b5dba58189dbbc DQ 0x3956c25bf348b538,0x59f111f1b605d019 DQ 0x3956c25bf348b538,0x59f111f1b605d019 DQ 0x923f82a4af194f9b,0xab1c5ed5da6d8118 DQ 0x923f82a4af194f9b,0xab1c5ed5da6d8118 DQ 0xd807aa98a3030242,0x12835b0145706fbe DQ 0xd807aa98a3030242,0x12835b0145706fbe DQ 0x243185be4ee4b28c,0x550c7dc3d5ffb4e2 DQ 0x243185be4ee4b28c,0x550c7dc3d5ffb4e2 DQ 0x72be5d74f27b896f,0x80deb1fe3b1696b1 DQ 0x72be5d74f27b896f,0x80deb1fe3b1696b1 DQ 0x9bdc06a725c71235,0xc19bf174cf692694 DQ 0x9bdc06a725c71235,0xc19bf174cf692694 DQ 0xe49b69c19ef14ad2,0xefbe4786384f25e3 DQ 0xe49b69c19ef14ad2,0xefbe4786384f25e3 DQ 0x0fc19dc68b8cd5b5,0x240ca1cc77ac9c65 DQ 0x0fc19dc68b8cd5b5,0x240ca1cc77ac9c65 DQ 0x2de92c6f592b0275,0x4a7484aa6ea6e483 DQ 0x2de92c6f592b0275,0x4a7484aa6ea6e483 DQ 0x5cb0a9dcbd41fbd4,0x76f988da831153b5 DQ 0x5cb0a9dcbd41fbd4,0x76f988da831153b5 DQ 0x983e5152ee66dfab,0xa831c66d2db43210 DQ 0x983e5152ee66dfab,0xa831c66d2db43210 DQ 0xb00327c898fb213f,0xbf597fc7beef0ee4 DQ 0xb00327c898fb213f,0xbf597fc7beef0ee4 DQ 0xc6e00bf33da88fc2,0xd5a79147930aa725 DQ 0xc6e00bf33da88fc2,0xd5a79147930aa725 DQ 0x06ca6351e003826f,0x142929670a0e6e70 DQ 0x06ca6351e003826f,0x142929670a0e6e70 DQ 0x27b70a8546d22ffc,0x2e1b21385c26c926 DQ 0x27b70a8546d22ffc,0x2e1b21385c26c926 DQ 0x4d2c6dfc5ac42aed,0x53380d139d95b3df DQ 0x4d2c6dfc5ac42aed,0x53380d139d95b3df DQ 0x650a73548baf63de,0x766a0abb3c77b2a8 DQ 0x650a73548baf63de,0x766a0abb3c77b2a8 DQ 0x81c2c92e47edaee6,0x92722c851482353b DQ 0x81c2c92e47edaee6,0x92722c851482353b DQ 0xa2bfe8a14cf10364,0xa81a664bbc423001 DQ 0xa2bfe8a14cf10364,0xa81a664bbc423001 DQ 0xc24b8b70d0f89791,0xc76c51a30654be30 DQ 0xc24b8b70d0f89791,0xc76c51a30654be30 DQ 0xd192e819d6ef5218,0xd69906245565a910 DQ 0xd192e819d6ef5218,0xd69906245565a910 DQ 0xf40e35855771202a,0x106aa07032bbd1b8 DQ 0xf40e35855771202a,0x106aa07032bbd1b8 DQ 0x19a4c116b8d2d0c8,0x1e376c085141ab53 DQ 0x19a4c116b8d2d0c8,0x1e376c085141ab53 DQ 0x2748774cdf8eeb99,0x34b0bcb5e19b48a8 DQ 0x2748774cdf8eeb99,0x34b0bcb5e19b48a8 DQ 0x391c0cb3c5c95a63,0x4ed8aa4ae3418acb DQ 0x391c0cb3c5c95a63,0x4ed8aa4ae3418acb DQ 0x5b9cca4f7763e373,0x682e6ff3d6b2b8a3 DQ 0x5b9cca4f7763e373,0x682e6ff3d6b2b8a3 DQ 0x748f82ee5defb2fc,0x78a5636f43172f60 DQ 0x748f82ee5defb2fc,0x78a5636f43172f60 DQ 0x84c87814a1f0ab72,0x8cc702081a6439ec DQ 0x84c87814a1f0ab72,0x8cc702081a6439ec DQ 0x90befffa23631e28,0xa4506cebde82bde9 DQ 0x90befffa23631e28,0xa4506cebde82bde9 DQ 0xbef9a3f7b2c67915,0xc67178f2e372532b DQ 0xbef9a3f7b2c67915,0xc67178f2e372532b DQ 0xca273eceea26619c,0xd186b8c721c0c207 DQ 0xca273eceea26619c,0xd186b8c721c0c207 DQ 0xeada7dd6cde0eb1e,0xf57d4f7fee6ed178 DQ 0xeada7dd6cde0eb1e,0xf57d4f7fee6ed178 DQ 0x06f067aa72176fba,0x0a637dc5a2c898a6 DQ 0x06f067aa72176fba,0x0a637dc5a2c898a6 DQ 0x113f9804bef90dae,0x1b710b35131c471b DQ 0x113f9804bef90dae,0x1b710b35131c471b DQ 0x28db77f523047d84,0x32caab7b40c72493 DQ 0x28db77f523047d84,0x32caab7b40c72493 DQ 0x3c9ebe0a15c9bebc,0x431d67c49c100d4c DQ 0x3c9ebe0a15c9bebc,0x431d67c49c100d4c DQ 0x4cc5d4becb3e42b6,0x597f299cfc657e2a DQ 0x4cc5d4becb3e42b6,0x597f299cfc657e2a DQ 0x5fcb6fab3ad6faec,0x6c44198c4a475817 DQ 0x5fcb6fab3ad6faec,0x6c44198c4a475817 DQ 0x0001020304050607,0x08090a0b0c0d0e0f DQ 0x0001020304050607,0x08090a0b0c0d0e0f DB 83,72,65,53,49,50,32,98,108,111,99,107,32,116,114,97 DB 110,115,102,111,114,109,32,102,111,114,32,120,56,54,95,54 DB 52,44,32,67,82,89,80,84,79,71,65,77,83,32,98,121 DB 32,60,97,112,112,114,111,64,111,112,101,110,115,115,108,46 DB 111,114,103,62,0 ALIGN 64 sha512_block_data_order_avx: mov QWORD[8+rsp],rdi ;WIN64 prologue mov QWORD[16+rsp],rsi mov rax,rsp $L$SEH_begin_sha512_block_data_order_avx: mov rdi,rcx mov rsi,rdx mov rdx,r8 $L$avx_shortcut: mov rax,rsp push rbx push rbp push r12 push r13 push r14 push r15 shl rdx,4 sub rsp,256 lea rdx,[rdx*8+rsi] and rsp,-64 mov QWORD[((128+0))+rsp],rdi mov QWORD[((128+8))+rsp],rsi mov QWORD[((128+16))+rsp],rdx mov QWORD[152+rsp],rax movaps XMMWORD[(128+32)+rsp],xmm6 movaps XMMWORD[(128+48)+rsp],xmm7 movaps XMMWORD[(128+64)+rsp],xmm8 movaps XMMWORD[(128+80)+rsp],xmm9 movaps XMMWORD[(128+96)+rsp],xmm10 movaps XMMWORD[(128+112)+rsp],xmm11 $L$prologue_avx: vzeroupper mov rax,QWORD[rdi] mov rbx,QWORD[8+rdi] mov rcx,QWORD[16+rdi] mov rdx,QWORD[24+rdi] mov r8,QWORD[32+rdi] mov r9,QWORD[40+rdi] mov r10,QWORD[48+rdi] mov r11,QWORD[56+rdi] jmp NEAR $L$loop_avx ALIGN 16 $L$loop_avx: vmovdqa xmm11,XMMWORD[((K512+1280))] vmovdqu xmm0,XMMWORD[rsi] lea rbp,[((K512+128))] vmovdqu xmm1,XMMWORD[16+rsi] vmovdqu xmm2,XMMWORD[32+rsi] vpshufb xmm0,xmm0,xmm11 vmovdqu xmm3,XMMWORD[48+rsi] vpshufb xmm1,xmm1,xmm11 vmovdqu xmm4,XMMWORD[64+rsi] vpshufb xmm2,xmm2,xmm11 vmovdqu xmm5,XMMWORD[80+rsi] vpshufb xmm3,xmm3,xmm11 vmovdqu xmm6,XMMWORD[96+rsi] vpshufb xmm4,xmm4,xmm11 vmovdqu xmm7,XMMWORD[112+rsi] vpshufb xmm5,xmm5,xmm11 vpaddq xmm8,xmm0,XMMWORD[((-128))+rbp] vpshufb xmm6,xmm6,xmm11 vpaddq xmm9,xmm1,XMMWORD[((-96))+rbp] vpshufb xmm7,xmm7,xmm11 vpaddq xmm10,xmm2,XMMWORD[((-64))+rbp] vpaddq xmm11,xmm3,XMMWORD[((-32))+rbp] vmovdqa XMMWORD[rsp],xmm8 vpaddq xmm8,xmm4,XMMWORD[rbp] vmovdqa XMMWORD[16+rsp],xmm9 vpaddq xmm9,xmm5,XMMWORD[32+rbp] vmovdqa XMMWORD[32+rsp],xmm10 vpaddq xmm10,xmm6,XMMWORD[64+rbp] vmovdqa XMMWORD[48+rsp],xmm11 vpaddq xmm11,xmm7,XMMWORD[96+rbp] vmovdqa XMMWORD[64+rsp],xmm8 mov r14,rax vmovdqa XMMWORD[80+rsp],xmm9 mov rdi,rbx vmovdqa XMMWORD[96+rsp],xmm10 xor rdi,rcx vmovdqa XMMWORD[112+rsp],xmm11 mov r13,r8 jmp NEAR $L$avx_00_47 ALIGN 16 $L$avx_00_47: add rbp,256 vpalignr xmm8,xmm1,xmm0,8 shrd r13,r13,23 mov rax,r14 vpalignr xmm11,xmm5,xmm4,8 mov r12,r9 shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,r8 xor r12,r10 vpaddq xmm0,xmm0,xmm11 shrd r13,r13,4 xor r14,rax vpsrlq xmm11,xmm8,7 and r12,r8 xor r13,r8 vpsllq xmm9,xmm8,56 add r11,QWORD[rsp] mov r15,rax vpxor xmm8,xmm11,xmm10 xor r12,r10 shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,rbx add r11,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,rax add r11,r13 vpxor xmm8,xmm8,xmm10 xor rdi,rbx shrd r14,r14,28 vpsrlq xmm11,xmm7,6 add rdx,r11 add r11,rdi vpxor xmm8,xmm8,xmm9 mov r13,rdx add r14,r11 vpsllq xmm10,xmm7,3 shrd r13,r13,23 mov r11,r14 vpaddq xmm0,xmm0,xmm8 mov r12,r8 shrd r14,r14,5 vpsrlq xmm9,xmm7,19 xor r13,rdx xor r12,r9 vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,r11 vpsllq xmm10,xmm10,42 and r12,rdx xor r13,rdx vpxor xmm11,xmm11,xmm9 add r10,QWORD[8+rsp] mov rdi,r11 vpsrlq xmm9,xmm9,42 xor r12,r9 shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,rax add r10,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm0,xmm0,xmm11 xor r14,r11 add r10,r13 vpaddq xmm10,xmm0,XMMWORD[((-128))+rbp] xor r15,rax shrd r14,r14,28 add rcx,r10 add r10,r15 mov r13,rcx add r14,r10 vmovdqa XMMWORD[rsp],xmm10 vpalignr xmm8,xmm2,xmm1,8 shrd r13,r13,23 mov r10,r14 vpalignr xmm11,xmm6,xmm5,8 mov r12,rdx shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,rcx xor r12,r8 vpaddq xmm1,xmm1,xmm11 shrd r13,r13,4 xor r14,r10 vpsrlq xmm11,xmm8,7 and r12,rcx xor r13,rcx vpsllq xmm9,xmm8,56 add r9,QWORD[16+rsp] mov r15,r10 vpxor xmm8,xmm11,xmm10 xor r12,r8 shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,r11 add r9,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,r10 add r9,r13 vpxor xmm8,xmm8,xmm10 xor rdi,r11 shrd r14,r14,28 vpsrlq xmm11,xmm0,6 add rbx,r9 add r9,rdi vpxor xmm8,xmm8,xmm9 mov r13,rbx add r14,r9 vpsllq xmm10,xmm0,3 shrd r13,r13,23 mov r9,r14 vpaddq xmm1,xmm1,xmm8 mov r12,rcx shrd r14,r14,5 vpsrlq xmm9,xmm0,19 xor r13,rbx xor r12,rdx vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,r9 vpsllq xmm10,xmm10,42 and r12,rbx xor r13,rbx vpxor xmm11,xmm11,xmm9 add r8,QWORD[24+rsp] mov rdi,r9 vpsrlq xmm9,xmm9,42 xor r12,rdx shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,r10 add r8,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm1,xmm1,xmm11 xor r14,r9 add r8,r13 vpaddq xmm10,xmm1,XMMWORD[((-96))+rbp] xor r15,r10 shrd r14,r14,28 add rax,r8 add r8,r15 mov r13,rax add r14,r8 vmovdqa XMMWORD[16+rsp],xmm10 vpalignr xmm8,xmm3,xmm2,8 shrd r13,r13,23 mov r8,r14 vpalignr xmm11,xmm7,xmm6,8 mov r12,rbx shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,rax xor r12,rcx vpaddq xmm2,xmm2,xmm11 shrd r13,r13,4 xor r14,r8 vpsrlq xmm11,xmm8,7 and r12,rax xor r13,rax vpsllq xmm9,xmm8,56 add rdx,QWORD[32+rsp] mov r15,r8 vpxor xmm8,xmm11,xmm10 xor r12,rcx shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,r9 add rdx,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,r8 add rdx,r13 vpxor xmm8,xmm8,xmm10 xor rdi,r9 shrd r14,r14,28 vpsrlq xmm11,xmm1,6 add r11,rdx add rdx,rdi vpxor xmm8,xmm8,xmm9 mov r13,r11 add r14,rdx vpsllq xmm10,xmm1,3 shrd r13,r13,23 mov rdx,r14 vpaddq xmm2,xmm2,xmm8 mov r12,rax shrd r14,r14,5 vpsrlq xmm9,xmm1,19 xor r13,r11 xor r12,rbx vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,rdx vpsllq xmm10,xmm10,42 and r12,r11 xor r13,r11 vpxor xmm11,xmm11,xmm9 add rcx,QWORD[40+rsp] mov rdi,rdx vpsrlq xmm9,xmm9,42 xor r12,rbx shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,r8 add rcx,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm2,xmm2,xmm11 xor r14,rdx add rcx,r13 vpaddq xmm10,xmm2,XMMWORD[((-64))+rbp] xor r15,r8 shrd r14,r14,28 add r10,rcx add rcx,r15 mov r13,r10 add r14,rcx vmovdqa XMMWORD[32+rsp],xmm10 vpalignr xmm8,xmm4,xmm3,8 shrd r13,r13,23 mov rcx,r14 vpalignr xmm11,xmm0,xmm7,8 mov r12,r11 shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,r10 xor r12,rax vpaddq xmm3,xmm3,xmm11 shrd r13,r13,4 xor r14,rcx vpsrlq xmm11,xmm8,7 and r12,r10 xor r13,r10 vpsllq xmm9,xmm8,56 add rbx,QWORD[48+rsp] mov r15,rcx vpxor xmm8,xmm11,xmm10 xor r12,rax shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,rdx add rbx,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,rcx add rbx,r13 vpxor xmm8,xmm8,xmm10 xor rdi,rdx shrd r14,r14,28 vpsrlq xmm11,xmm2,6 add r9,rbx add rbx,rdi vpxor xmm8,xmm8,xmm9 mov r13,r9 add r14,rbx vpsllq xmm10,xmm2,3 shrd r13,r13,23 mov rbx,r14 vpaddq xmm3,xmm3,xmm8 mov r12,r10 shrd r14,r14,5 vpsrlq xmm9,xmm2,19 xor r13,r9 xor r12,r11 vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,rbx vpsllq xmm10,xmm10,42 and r12,r9 xor r13,r9 vpxor xmm11,xmm11,xmm9 add rax,QWORD[56+rsp] mov rdi,rbx vpsrlq xmm9,xmm9,42 xor r12,r11 shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,rcx add rax,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm3,xmm3,xmm11 xor r14,rbx add rax,r13 vpaddq xmm10,xmm3,XMMWORD[((-32))+rbp] xor r15,rcx shrd r14,r14,28 add r8,rax add rax,r15 mov r13,r8 add r14,rax vmovdqa XMMWORD[48+rsp],xmm10 vpalignr xmm8,xmm5,xmm4,8 shrd r13,r13,23 mov rax,r14 vpalignr xmm11,xmm1,xmm0,8 mov r12,r9 shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,r8 xor r12,r10 vpaddq xmm4,xmm4,xmm11 shrd r13,r13,4 xor r14,rax vpsrlq xmm11,xmm8,7 and r12,r8 xor r13,r8 vpsllq xmm9,xmm8,56 add r11,QWORD[64+rsp] mov r15,rax vpxor xmm8,xmm11,xmm10 xor r12,r10 shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,rbx add r11,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,rax add r11,r13 vpxor xmm8,xmm8,xmm10 xor rdi,rbx shrd r14,r14,28 vpsrlq xmm11,xmm3,6 add rdx,r11 add r11,rdi vpxor xmm8,xmm8,xmm9 mov r13,rdx add r14,r11 vpsllq xmm10,xmm3,3 shrd r13,r13,23 mov r11,r14 vpaddq xmm4,xmm4,xmm8 mov r12,r8 shrd r14,r14,5 vpsrlq xmm9,xmm3,19 xor r13,rdx xor r12,r9 vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,r11 vpsllq xmm10,xmm10,42 and r12,rdx xor r13,rdx vpxor xmm11,xmm11,xmm9 add r10,QWORD[72+rsp] mov rdi,r11 vpsrlq xmm9,xmm9,42 xor r12,r9 shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,rax add r10,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm4,xmm4,xmm11 xor r14,r11 add r10,r13 vpaddq xmm10,xmm4,XMMWORD[rbp] xor r15,rax shrd r14,r14,28 add rcx,r10 add r10,r15 mov r13,rcx add r14,r10 vmovdqa XMMWORD[64+rsp],xmm10 vpalignr xmm8,xmm6,xmm5,8 shrd r13,r13,23 mov r10,r14 vpalignr xmm11,xmm2,xmm1,8 mov r12,rdx shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,rcx xor r12,r8 vpaddq xmm5,xmm5,xmm11 shrd r13,r13,4 xor r14,r10 vpsrlq xmm11,xmm8,7 and r12,rcx xor r13,rcx vpsllq xmm9,xmm8,56 add r9,QWORD[80+rsp] mov r15,r10 vpxor xmm8,xmm11,xmm10 xor r12,r8 shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,r11 add r9,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,r10 add r9,r13 vpxor xmm8,xmm8,xmm10 xor rdi,r11 shrd r14,r14,28 vpsrlq xmm11,xmm4,6 add rbx,r9 add r9,rdi vpxor xmm8,xmm8,xmm9 mov r13,rbx add r14,r9 vpsllq xmm10,xmm4,3 shrd r13,r13,23 mov r9,r14 vpaddq xmm5,xmm5,xmm8 mov r12,rcx shrd r14,r14,5 vpsrlq xmm9,xmm4,19 xor r13,rbx xor r12,rdx vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,r9 vpsllq xmm10,xmm10,42 and r12,rbx xor r13,rbx vpxor xmm11,xmm11,xmm9 add r8,QWORD[88+rsp] mov rdi,r9 vpsrlq xmm9,xmm9,42 xor r12,rdx shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,r10 add r8,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm5,xmm5,xmm11 xor r14,r9 add r8,r13 vpaddq xmm10,xmm5,XMMWORD[32+rbp] xor r15,r10 shrd r14,r14,28 add rax,r8 add r8,r15 mov r13,rax add r14,r8 vmovdqa XMMWORD[80+rsp],xmm10 vpalignr xmm8,xmm7,xmm6,8 shrd r13,r13,23 mov r8,r14 vpalignr xmm11,xmm3,xmm2,8 mov r12,rbx shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,rax xor r12,rcx vpaddq xmm6,xmm6,xmm11 shrd r13,r13,4 xor r14,r8 vpsrlq xmm11,xmm8,7 and r12,rax xor r13,rax vpsllq xmm9,xmm8,56 add rdx,QWORD[96+rsp] mov r15,r8 vpxor xmm8,xmm11,xmm10 xor r12,rcx shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,r9 add rdx,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,r8 add rdx,r13 vpxor xmm8,xmm8,xmm10 xor rdi,r9 shrd r14,r14,28 vpsrlq xmm11,xmm5,6 add r11,rdx add rdx,rdi vpxor xmm8,xmm8,xmm9 mov r13,r11 add r14,rdx vpsllq xmm10,xmm5,3 shrd r13,r13,23 mov rdx,r14 vpaddq xmm6,xmm6,xmm8 mov r12,rax shrd r14,r14,5 vpsrlq xmm9,xmm5,19 xor r13,r11 xor r12,rbx vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,rdx vpsllq xmm10,xmm10,42 and r12,r11 xor r13,r11 vpxor xmm11,xmm11,xmm9 add rcx,QWORD[104+rsp] mov rdi,rdx vpsrlq xmm9,xmm9,42 xor r12,rbx shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,r8 add rcx,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm6,xmm6,xmm11 xor r14,rdx add rcx,r13 vpaddq xmm10,xmm6,XMMWORD[64+rbp] xor r15,r8 shrd r14,r14,28 add r10,rcx add rcx,r15 mov r13,r10 add r14,rcx vmovdqa XMMWORD[96+rsp],xmm10 vpalignr xmm8,xmm0,xmm7,8 shrd r13,r13,23 mov rcx,r14 vpalignr xmm11,xmm4,xmm3,8 mov r12,r11 shrd r14,r14,5 vpsrlq xmm10,xmm8,1 xor r13,r10 xor r12,rax vpaddq xmm7,xmm7,xmm11 shrd r13,r13,4 xor r14,rcx vpsrlq xmm11,xmm8,7 and r12,r10 xor r13,r10 vpsllq xmm9,xmm8,56 add rbx,QWORD[112+rsp] mov r15,rcx vpxor xmm8,xmm11,xmm10 xor r12,rax shrd r14,r14,6 vpsrlq xmm10,xmm10,7 xor r15,rdx add rbx,r12 vpxor xmm8,xmm8,xmm9 shrd r13,r13,14 and rdi,r15 vpsllq xmm9,xmm9,7 xor r14,rcx add rbx,r13 vpxor xmm8,xmm8,xmm10 xor rdi,rdx shrd r14,r14,28 vpsrlq xmm11,xmm6,6 add r9,rbx add rbx,rdi vpxor xmm8,xmm8,xmm9 mov r13,r9 add r14,rbx vpsllq xmm10,xmm6,3 shrd r13,r13,23 mov rbx,r14 vpaddq xmm7,xmm7,xmm8 mov r12,r10 shrd r14,r14,5 vpsrlq xmm9,xmm6,19 xor r13,r9 xor r12,r11 vpxor xmm11,xmm11,xmm10 shrd r13,r13,4 xor r14,rbx vpsllq xmm10,xmm10,42 and r12,r9 xor r13,r9 vpxor xmm11,xmm11,xmm9 add rax,QWORD[120+rsp] mov rdi,rbx vpsrlq xmm9,xmm9,42 xor r12,r11 shrd r14,r14,6 vpxor xmm11,xmm11,xmm10 xor rdi,rcx add rax,r12 vpxor xmm11,xmm11,xmm9 shrd r13,r13,14 and r15,rdi vpaddq xmm7,xmm7,xmm11 xor r14,rbx add rax,r13 vpaddq xmm10,xmm7,XMMWORD[96+rbp] xor r15,rcx shrd r14,r14,28 add r8,rax add rax,r15 mov r13,r8 add r14,rax vmovdqa XMMWORD[112+rsp],xmm10 cmp BYTE[135+rbp],0 jne NEAR $L$avx_00_47 shrd r13,r13,23 mov rax,r14 mov r12,r9 shrd r14,r14,5 xor r13,r8 xor r12,r10 shrd r13,r13,4 xor r14,rax and r12,r8 xor r13,r8 add r11,QWORD[rsp] mov r15,rax xor r12,r10 shrd r14,r14,6 xor r15,rbx add r11,r12 shrd r13,r13,14 and rdi,r15 xor r14,rax add r11,r13 xor rdi,rbx shrd r14,r14,28 add rdx,r11 add r11,rdi mov r13,rdx add r14,r11 shrd r13,r13,23 mov r11,r14 mov r12,r8 shrd r14,r14,5 xor r13,rdx xor r12,r9 shrd r13,r13,4 xor r14,r11 and r12,rdx xor r13,rdx add r10,QWORD[8+rsp] mov rdi,r11 xor r12,r9 shrd r14,r14,6 xor rdi,rax add r10,r12 shrd r13,r13,14 and r15,rdi xor r14,r11 add r10,r13 xor r15,rax shrd r14,r14,28 add rcx,r10 add r10,r15 mov r13,rcx add r14,r10 shrd r13,r13,23 mov r10,r14 mov r12,rdx shrd r14,r14,5 xor r13,rcx xor r12,r8 shrd r13,r13,4 xor r14,r10 and r12,rcx xor r13,rcx add r9,QWORD[16+rsp] mov r15,r10 xor r12,r8 shrd r14,r14,6 xor r15,r11 add r9,r12 shrd r13,r13,14 and rdi,r15 xor r14,r10 add r9,r13 xor rdi,r11 shrd r14,r14,28 add rbx,r9 add r9,rdi mov r13,rbx add r14,r9 shrd r13,r13,23 mov r9,r14 mov r12,rcx shrd r14,r14,5 xor r13,rbx xor r12,rdx shrd r13,r13,4 xor r14,r9 and r12,rbx xor r13,rbx add r8,QWORD[24+rsp] mov rdi,r9 xor r12,rdx shrd r14,r14,6 xor rdi,r10 add r8,r12 shrd r13,r13,14 and r15,rdi xor r14,r9 add r8,r13 xor r15,r10 shrd r14,r14,28 add rax,r8 add r8,r15 mov r13,rax add r14,r8 shrd r13,r13,23 mov r8,r14 mov r12,rbx shrd r14,r14,5 xor r13,rax xor r12,rcx shrd r13,r13,4 xor r14,r8 and r12,rax xor r13,rax add rdx,QWORD[32+rsp] mov r15,r8 xor r12,rcx shrd r14,r14,6 xor r15,r9 add rdx,r12 shrd r13,r13,14 and rdi,r15 xor r14,r8 add rdx,r13 xor rdi,r9 shrd r14,r14,28 add r11,rdx add rdx,rdi mov r13,r11 add r14,rdx shrd r13,r13,23 mov rdx,r14 mov r12,rax shrd r14,r14,5 xor r13,r11 xor r12,rbx shrd r13,r13,4 xor r14,rdx and r12,r11 xor r13,r11 add rcx,QWORD[40+rsp] mov rdi,rdx xor r12,rbx shrd r14,r14,6 xor rdi,r8 add rcx,r12 shrd r13,r13,14 and r15,rdi xor r14,rdx add rcx,r13 xor r15,r8 shrd r14,r14,28 add r10,rcx add rcx,r15 mov r13,r10 add r14,rcx shrd r13,r13,23 mov rcx,r14 mov r12,r11 shrd r14,r14,5 xor r13,r10 xor r12,rax shrd r13,r13,4 xor r14,rcx and r12,r10 xor r13,r10 add rbx,QWORD[48+rsp] mov r15,rcx xor r12,rax shrd r14,r14,6 xor r15,rdx add rbx,r12 shrd r13,r13,14 and rdi,r15 xor r14,rcx add rbx,r13 xor rdi,rdx shrd r14,r14,28 add r9,rbx add rbx,rdi mov r13,r9 add r14,rbx shrd r13,r13,23 mov rbx,r14 mov r12,r10 shrd r14,r14,5 xor r13,r9 xor r12,r11 shrd r13,r13,4 xor r14,rbx and r12,r9 xor r13,r9 add rax,QWORD[56+rsp] mov rdi,rbx xor r12,r11 shrd r14,r14,6 xor rdi,rcx add rax,r12 shrd r13,r13,14 and r15,rdi xor r14,rbx add rax,r13 xor r15,rcx shrd r14,r14,28 add r8,rax add rax,r15 mov r13,r8 add r14,rax shrd r13,r13,23 mov rax,r14 mov r12,r9 shrd r14,r14,5 xor r13,r8 xor r12,r10 shrd r13,r13,4 xor r14,rax and r12,r8 xor r13,r8 add r11,QWORD[64+rsp] mov r15,rax xor r12,r10 shrd r14,r14,6 xor r15,rbx add r11,r12 shrd r13,r13,14 and rdi,r15 xor r14,rax add r11,r13 xor rdi,rbx shrd r14,r14,28 add rdx,r11 add r11,rdi mov r13,rdx add r14,r11 shrd r13,r13,23 mov r11,r14 mov r12,r8 shrd r14,r14,5 xor r13,rdx xor r12,r9 shrd r13,r13,4 xor r14,r11 and r12,rdx xor r13,rdx add r10,QWORD[72+rsp] mov rdi,r11 xor r12,r9 shrd r14,r14,6 xor rdi,rax add r10,r12 shrd r13,r13,14 and r15,rdi xor r14,r11 add r10,r13 xor r15,rax shrd r14,r14,28 add rcx,r10 add r10,r15 mov r13,rcx add r14,r10 shrd r13,r13,23 mov r10,r14 mov r12,rdx shrd r14,r14,5 xor r13,rcx xor r12,r8 shrd r13,r13,4 xor r14,r10 and r12,rcx xor r13,rcx add r9,QWORD[80+rsp] mov r15,r10 xor r12,r8 shrd r14,r14,6 xor r15,r11 add r9,r12 shrd r13,r13,14 and rdi,r15 xor r14,r10 add r9,r13 xor rdi,r11 shrd r14,r14,28 add rbx,r9 add r9,rdi mov r13,rbx add r14,r9 shrd r13,r13,23 mov r9,r14 mov r12,rcx shrd r14,r14,5 xor r13,rbx xor r12,rdx shrd r13,r13,4 xor r14,r9 and r12,rbx xor r13,rbx add r8,QWORD[88+rsp] mov rdi,r9 xor r12,rdx shrd r14,r14,6 xor rdi,r10 add r8,r12 shrd r13,r13,14 and r15,rdi xor r14,r9 add r8,r13 xor r15,r10 shrd r14,r14,28 add rax,r8 add r8,r15 mov r13,rax add r14,r8 shrd r13,r13,23 mov r8,r14 mov r12,rbx shrd r14,r14,5 xor r13,rax xor r12,rcx shrd r13,r13,4 xor r14,r8 and r12,rax xor r13,rax add rdx,QWORD[96+rsp] mov r15,r8 xor r12,rcx shrd r14,r14,6 xor r15,r9 add rdx,r12 shrd r13,r13,14 and rdi,r15 xor r14,r8 add rdx,r13 xor rdi,r9 shrd r14,r14,28 add r11,rdx add rdx,rdi mov r13,r11 add r14,rdx shrd r13,r13,23 mov rdx,r14 mov r12,rax shrd r14,r14,5 xor r13,r11 xor r12,rbx shrd r13,r13,4 xor r14,rdx and r12,r11 xor r13,r11 add rcx,QWORD[104+rsp] mov rdi,rdx xor r12,rbx shrd r14,r14,6 xor rdi,r8 add rcx,r12 shrd r13,r13,14 and r15,rdi xor r14,rdx add rcx,r13 xor r15,r8 shrd r14,r14,28 add r10,rcx add rcx,r15 mov r13,r10 add r14,rcx shrd r13,r13,23 mov rcx,r14 mov r12,r11 shrd r14,r14,5 xor r13,r10 xor r12,rax shrd r13,r13,4 xor r14,rcx and r12,r10 xor r13,r10 add rbx,QWORD[112+rsp] mov r15,rcx xor r12,rax shrd r14,r14,6 xor r15,rdx add rbx,r12 shrd r13,r13,14 and rdi,r15 xor r14,rcx add rbx,r13 xor rdi,rdx shrd r14,r14,28 add r9,rbx add rbx,rdi mov r13,r9 add r14,rbx shrd r13,r13,23 mov rbx,r14 mov r12,r10 shrd r14,r14,5 xor r13,r9 xor r12,r11 shrd r13,r13,4 xor r14,rbx and r12,r9 xor r13,r9 add rax,QWORD[120+rsp] mov rdi,rbx xor r12,r11 shrd r14,r14,6 xor rdi,rcx add rax,r12 shrd r13,r13,14 and r15,rdi xor r14,rbx add rax,r13 xor r15,rcx shrd r14,r14,28 add r8,rax add rax,r15 mov r13,r8 add r14,rax mov rdi,QWORD[((128+0))+rsp] mov rax,r14 add rax,QWORD[rdi] lea rsi,[128+rsi] add rbx,QWORD[8+rdi] add rcx,QWORD[16+rdi] add rdx,QWORD[24+rdi] add r8,QWORD[32+rdi] add r9,QWORD[40+rdi] add r10,QWORD[48+rdi] add r11,QWORD[56+rdi] cmp rsi,QWORD[((128+16))+rsp] mov QWORD[rdi],rax mov QWORD[8+rdi],rbx mov QWORD[16+rdi],rcx mov QWORD[24+rdi],rdx mov QWORD[32+rdi],r8 mov QWORD[40+rdi],r9 mov QWORD[48+rdi],r10 mov QWORD[56+rdi],r11 jb NEAR $L$loop_avx mov rsi,QWORD[152+rsp] vzeroupper movaps xmm6,XMMWORD[((128+32))+rsp] movaps xmm7,XMMWORD[((128+48))+rsp] movaps xmm8,XMMWORD[((128+64))+rsp] movaps xmm9,XMMWORD[((128+80))+rsp] movaps xmm10,XMMWORD[((128+96))+rsp] movaps xmm11,XMMWORD[((128+112))+rsp] mov r15,QWORD[((-48))+rsi] mov r14,QWORD[((-40))+rsi] mov r13,QWORD[((-32))+rsi] mov r12,QWORD[((-24))+rsi] mov rbp,QWORD[((-16))+rsi] mov rbx,QWORD[((-8))+rsi] lea rsp,[rsi] $L$epilogue_avx: mov rdi,QWORD[8+rsp] ;WIN64 epilogue mov rsi,QWORD[16+rsp] DB 0F3h,0C3h ;repret $L$SEH_end_sha512_block_data_order_avx: EXTERN __imp_RtlVirtualUnwind ALIGN 16 se_handler: push rsi push rdi push rbx push rbp push r12 push r13 push r14 push r15 pushfq sub rsp,64 mov rax,QWORD[120+r8] mov rbx,QWORD[248+r8] mov rsi,QWORD[8+r9] mov r11,QWORD[56+r9] mov r10d,DWORD[r11] lea r10,[r10*1+rsi] cmp rbx,r10 jb NEAR $L$in_prologue mov rax,QWORD[152+r8] mov r10d,DWORD[4+r11] lea r10,[r10*1+rsi] cmp rbx,r10 jae NEAR $L$in_prologue mov rsi,rax mov rax,QWORD[((128+24))+rax] mov rbx,QWORD[((-8))+rax] mov rbp,QWORD[((-16))+rax] mov r12,QWORD[((-24))+rax] mov r13,QWORD[((-32))+rax] mov r14,QWORD[((-40))+rax] mov r15,QWORD[((-48))+rax] mov QWORD[144+r8],rbx mov QWORD[160+r8],rbp mov QWORD[216+r8],r12 mov QWORD[224+r8],r13 mov QWORD[232+r8],r14 mov QWORD[240+r8],r15 lea r10,[$L$epilogue] cmp rbx,r10 jb NEAR $L$in_prologue lea rsi,[((128+32))+rsi] lea rdi,[512+r8] mov ecx,12 DD 0xa548f3fc $L$in_prologue: mov rdi,QWORD[8+rax] mov rsi,QWORD[16+rax] mov QWORD[152+r8],rax mov QWORD[168+r8],rsi mov QWORD[176+r8],rdi mov rdi,QWORD[40+r9] mov rsi,r8 mov ecx,154 DD 0xa548f3fc mov rsi,r9 xor rcx,rcx mov rdx,QWORD[8+rsi] mov r8,QWORD[rsi] mov r9,QWORD[16+rsi] mov r10,QWORD[40+rsi] lea r11,[56+rsi] lea r12,[24+rsi] mov QWORD[32+rsp],r10 mov QWORD[40+rsp],r11 mov QWORD[48+rsp],r12 mov QWORD[56+rsp],rcx call QWORD[__imp_RtlVirtualUnwind] mov eax,1 add rsp,64 popfq pop r15 pop r14 pop r13 pop r12 pop rbp pop rbx pop rdi pop rsi DB 0F3h,0C3h ;repret section .pdata rdata align=4 ALIGN 4 DD $L$SEH_begin_sha512_block_data_order wrt ..imagebase DD $L$SEH_end_sha512_block_data_order wrt ..imagebase DD $L$SEH_info_sha512_block_data_order wrt ..imagebase DD $L$SEH_begin_sha512_block_data_order_avx wrt ..imagebase DD $L$SEH_end_sha512_block_data_order_avx wrt ..imagebase DD $L$SEH_info_sha512_block_data_order_avx wrt ..imagebase section .xdata rdata align=8 ALIGN 8 $L$SEH_info_sha512_block_data_order: DB 9,0,0,0 DD se_handler wrt ..imagebase DD $L$prologue wrt ..imagebase,$L$epilogue wrt ..imagebase $L$SEH_info_sha512_block_data_order_avx: DB 9,0,0,0 DD se_handler wrt ..imagebase DD $L$prologue_avx wrt ..imagebase,$L$epilogue_avx wrt ..imagebase
src/levels.adb
thomas070605/shoot-n-loot
0
9915
-- Shoot'n'loot -- Copyright (c) 2020 <NAME> with GESTE_Config; use GESTE_Config; with GESTE.Grid; with GESTE.Tile_Bank; with GESTE.Sprite; with Monsters; with Chests; with Player; with Score_Display; with Sound; with Game_Assets; use Game_Assets; with Game_Assets.Tileset; with Game_Assets.Tileset_Collisions; with Game_Assets.level_0; with Game_Assets.level_1; with Game_Assets.level_2; with Game_Assets.level_3; with Game_Assets.level_4; with Game_Assets.level_5; with Game_Assets.level_6; with Game_Assets.level_7; with Game_Assets.level_8; with Game_Assets.Misc_Objects; use Game_Assets.Misc_Objects; package body Levels is Tile_Bank : aliased GESTE.Tile_Bank.Instance (Tileset.Tiles'Access, Tileset_Collisions.Tiles'Access, Palette'Access); Level_0_Back : aliased GESTE.Grid.Instance (Game_Assets.level_0.Back.Data'Access, Tile_Bank'Access); Level_0_Front : aliased GESTE.Grid.Instance (level_0.Front.Data'Access, Tile_Bank'Access); Level_0_Backcolor : aliased GESTE.Grid.Instance (level_0.Backcolor.Data'Access, Tile_Bank'Access); Level_1_Back : aliased GESTE.Grid.Instance (Game_Assets.level_1.Back.Data'Access, Tile_Bank'Access); Level_1_Front : aliased GESTE.Grid.Instance (level_1.Front.Data'Access, Tile_Bank'Access); Level_1_Backcolor : aliased GESTE.Grid.Instance (level_1.Backcolor.Data'Access, Tile_Bank'Access); Level_2_Back : aliased GESTE.Grid.Instance (level_2.Back.Data'Access, Tile_Bank'Access); Level_2_Front : aliased GESTE.Grid.Instance (level_2.Front.Data'Access, Tile_Bank'Access); Level_2_Backcolor : aliased GESTE.Grid.Instance (level_2.Backcolor.Data'Access, Tile_Bank'Access); Level_3_Back : aliased GESTE.Grid.Instance (level_3.Back.Data'Access, Tile_Bank'Access); Level_3_Front : aliased GESTE.Grid.Instance (level_3.Front.Data'Access, Tile_Bank'Access); Level_3_Backcolor : aliased GESTE.Grid.Instance (level_3.Backcolor.Data'Access, Tile_Bank'Access); Level_4_Back : aliased GESTE.Grid.Instance (level_4.Back.Data'Access, Tile_Bank'Access); Level_4_Front : aliased GESTE.Grid.Instance (level_4.Front.Data'Access, Tile_Bank'Access); Level_4_Backcolor : aliased GESTE.Grid.Instance (level_4.Backcolor.Data'Access, Tile_Bank'Access); Level_5_Back : aliased GESTE.Grid.Instance (level_5.Back.Data'Access, Tile_Bank'Access); Level_5_Front : aliased GESTE.Grid.Instance (level_5.Front.Data'Access, Tile_Bank'Access); Level_5_Backcolor : aliased GESTE.Grid.Instance (level_5.Backcolor.Data'Access, Tile_Bank'Access); Level_6_Back : aliased GESTE.Grid.Instance (level_6.Back.Data'Access, Tile_Bank'Access); Level_6_Front : aliased GESTE.Grid.Instance (level_6.Front.Data'Access, Tile_Bank'Access); Level_6_Backcolor : aliased GESTE.Grid.Instance (level_6.Backcolor.Data'Access, Tile_Bank'Access); Level_7_Back : aliased GESTE.Grid.Instance (level_7.Back.Data'Access, Tile_Bank'Access); Level_7_Front : aliased GESTE.Grid.Instance (level_7.Front.Data'Access, Tile_Bank'Access); Level_7_Backcolor : aliased GESTE.Grid.Instance (level_7.Backcolor.Data'Access, Tile_Bank'Access); Level_8_Back : aliased GESTE.Grid.Instance (level_8.Back.Data'Access, Tile_Bank'Access); Level_8_Front : aliased GESTE.Grid.Instance (level_8.Front.Data'Access, Tile_Bank'Access); Level_8_Backcolor : aliased GESTE.Grid.Instance (level_8.Backcolor.Data'Access, Tile_Bank'Access); Finish_Tile : constant Tile_Index := Item.Exit_Portal.Tile_Id; Finish_Position : GESTE.Pix_Point := (0, 0); Finish_Sprite : aliased GESTE.Sprite.Instance (Tile_Bank'Access, Finish_Tile); procedure Set_Finish (Obj : Object); procedure Move_To_Spawn (Obj : Object); ---------------- -- Set_Finish -- ---------------- procedure Set_Finish (Obj : Object) is begin Finish_Position := (Integer (Obj.X), Integer (Obj.Y) - Tile_Size); Finish_Sprite.Move (Finish_Position); Finish_Sprite.Set_Tile (Obj.Tile_Id); GESTE.Add (Finish_Sprite'Access, 2); Finish_Sprite.Enable_Collisions; end Set_Finish; ------------------- -- Move_To_Spawn -- ------------------- procedure Move_To_Spawn (Obj : Object) is begin Player.Spawn; Player.Move ((Integer (Obj.X) + Tile_Size / 2, Integer (Obj.Y) - Tile_Size / 2)); end Move_To_Spawn; ----------- -- Enter -- ----------- procedure Enter (Id : Level_Id) is begin GESTE.Remove_All; Score_Display.Init ((14 * Tile_Size, 15 * Tile_Size)); case Id is when Lvl_0 => Set_Finish (level_0.Markers.Finish); Move_To_Spawn (level_0.Markers.Spawn); Level_0_Backcolor.Move ((0, 0)); GESTE.Add (Level_0_Backcolor'Access, 0); Level_0_Back.Move ((0, 0)); Level_0_Back.Enable_Collisions; GESTE.Add (Level_0_Back'Access, 1); Level_0_Front.Move ((0, 0)); Level_0_Front.Enable_Collisions; GESTE.Add (Level_0_Front'Access, 3); Chests.Init (Game_Assets.level_0.Chests.Objects); Monsters.Init ((1 .. 0 => <>)); -- No monsters when Lvl_1 => Set_Finish (level_1.Markers.Finish); Move_To_Spawn (level_1.Markers.Spawn); Level_1_Backcolor.Move ((0, 0)); GESTE.Add (Level_1_Backcolor'Access, 0); Level_1_Back.Move ((0, 0)); Level_1_Back.Enable_Collisions; GESTE.Add (Level_1_Back'Access, 1); Level_1_Front.Move ((0, 0)); Level_1_Front.Enable_Collisions; GESTE.Add (Level_1_Front'Access, 3); Chests.Init (Game_Assets.level_1.Chests.Objects); Monsters.Init ((1 .. 0 => <>)); -- No monsters when Lvl_2 => Set_Finish (level_2.Markers.Finish); Move_To_Spawn (level_2.Markers.Spawn); Level_2_Backcolor.Move ((0, 0)); GESTE.Add (Level_2_Backcolor'Access, 0); Level_2_Back.Move ((0, 0)); Level_2_Back.Enable_Collisions; GESTE.Add (Level_2_Back'Access, 1); Level_2_Front.Move ((0, 0)); Level_2_Front.Enable_Collisions; GESTE.Add (Level_2_Front'Access, 3); Chests.Init (Game_Assets.level_2.Chests.Objects); Monsters.Init ((1 .. 0 => <>)); -- No monsters when Lvl_3 => Set_Finish (level_3.Markers.Finish); Move_To_Spawn (level_3.Markers.Spawn); Level_3_Backcolor.Move ((0, 0)); GESTE.Add (Level_3_Backcolor'Access, 0); Level_3_Back.Move ((0, 0)); Level_3_Back.Enable_Collisions; GESTE.Add (Level_3_Back'Access, 1); Level_3_Front.Move ((0, 0)); Level_3_Front.Enable_Collisions; GESTE.Add (Level_3_Front'Access, 3); Monsters.Init (Game_Assets.level_3.Monsters.Objects); Chests.Init (Game_Assets.level_3.Chests.Objects); when Lvl_4 => Set_Finish (level_4.Markers.Finish); Move_To_Spawn (level_4.Markers.Spawn); Level_4_Backcolor.Move ((0, 0)); GESTE.Add (Level_4_Backcolor'Access, 0); Level_4_Back.Move ((0, 0)); Level_4_Back.Enable_Collisions; GESTE.Add (Level_4_Back'Access, 1); Level_4_Front.Move ((0, 0)); Level_4_Front.Enable_Collisions; GESTE.Add (Level_4_Front'Access, 3); Chests.Init ((1 .. 0 => <>)); -- No Chests Monsters.Init (Game_Assets.level_4.Monsters.Objects); when Lvl_5 => Set_Finish (level_5.Markers.Finish); Move_To_Spawn (level_5.Markers.Spawn); Level_5_Backcolor.Move ((0, 0)); GESTE.Add (Level_5_Backcolor'Access, 0); Level_5_Back.Move ((0, 0)); Level_5_Back.Enable_Collisions; GESTE.Add (Level_5_Back'Access, 1); Level_5_Front.Move ((0, 0)); Level_5_Front.Enable_Collisions; GESTE.Add (Level_5_Front'Access, 3); Monsters.Init (Game_Assets.level_5.Monsters.Objects); Chests.Init (Game_Assets.level_5.Chests.Objects); when Lvl_6 => Set_Finish (level_6.Markers.Finish); Move_To_Spawn (level_6.Markers.Spawn); Level_6_Backcolor.Move ((0, 0)); GESTE.Add (Level_6_Backcolor'Access, 0); Level_6_Back.Move ((0, 0)); Level_6_Back.Enable_Collisions; GESTE.Add (Level_6_Back'Access, 1); Level_6_Front.Move ((0, 0)); Level_6_Front.Enable_Collisions; GESTE.Add (Level_6_Front'Access, 3); Monsters.Init (Game_Assets.level_6.Monsters.Objects); Chests.Init (Game_Assets.level_6.Chests.Objects); when Lvl_7 => Set_Finish (level_7.Markers.Finish); Move_To_Spawn (level_7.Markers.Spawn); Level_7_Backcolor.Move ((0, 0)); GESTE.Add (Level_7_Backcolor'Access, 0); Level_7_Back.Move ((0, 0)); Level_7_Back.Enable_Collisions; GESTE.Add (Level_7_Back'Access, 1); Level_7_Front.Move ((0, 0)); Level_7_Front.Enable_Collisions; GESTE.Add (Level_7_Front'Access, 3); Monsters.Init (Game_Assets.level_7.Monsters.Objects); Chests.Init (Game_Assets.level_7.Chests.Objects); when Lvl_8 => Set_Finish (level_8.Markers.Finish); Move_To_Spawn (level_8.Markers.Spawn); Level_8_Backcolor.Move ((0, 0)); GESTE.Add (Level_8_Backcolor'Access, 0); Level_8_Back.Move ((0, 0)); Level_8_Back.Enable_Collisions; GESTE.Add (Level_8_Back'Access, 1); Level_8_Front.Move ((0, 0)); Level_8_Front.Enable_Collisions; GESTE.Add (Level_8_Front'Access, 3); Monsters.Init (Game_Assets.level_8.Monsters.Objects); Chests.Init (Game_Assets.level_8.Chests.Objects); end case; end Enter; --------------- -- Open_Exit -- --------------- procedure Open_Exit is begin Finish_Sprite.Set_Tile (Finish_Tile); Finish_Sprite.Enable_Collisions (False); Sound.Play_Exit_Open; end Open_Exit; --------------- -- Test_Exit -- --------------- function Test_Exit (Pt : GESTE.Pix_Point) return Boolean is (Pt.X in Finish_Position.X .. Finish_Position.X + Tile_Size and then Pt.Y in Finish_Position.Y .. Finish_Position.Y + Tile_Size); end Levels;
programs/oeis/306/A306331.asm
neoneye/loda
22
162164
<gh_stars>10-100 ; A306331: Numbers congruent to 6 or 31 mod 38. ; 6,31,44,69,82,107,120,145,158,183,196,221,234,259,272,297,310,335,348,373,386,411,424,449,462,487,500,525,538,563,576,601,614,639,652,677,690,715,728,753,766,791,804,829,842,867,880,905,918,943,956,981,994,1019,1032,1057,1070,1095,1108,1133,1146,1171,1184,1209,1222,1247,1260,1285,1298,1323,1336,1361,1374,1399,1412,1437,1450,1475,1488,1513,1526,1551,1564,1589,1602,1627,1640,1665,1678,1703,1716,1741,1754,1779,1792,1817,1830,1855,1868,1893 mov $3,$0 mod $0,2 mul $0,6 add $0,6 mov $2,$3 mul $2,19 add $0,$2
src/Bi-invertibility/Erased.agda
nad/equality
3
7767
<filename>src/Bi-invertibility/Erased.agda ------------------------------------------------------------------------ -- Bi-invertibility with erased proofs ------------------------------------------------------------------------ -- The development is based on the presentation of bi-invertibility -- (for types and functions) and related things in the HoTT book, but -- adapted to a setting with erasure. {-# OPTIONS --without-K --safe #-} open import Equality open import Prelude as P hiding (id; _∘_; [_,_]) -- The code is parametrised by something like a "raw" category. module Bi-invertibility.Erased {e⁺} (eq : ∀ {a p} → Equality-with-J a p e⁺) {o h} (Obj : Type o) (Hom : Obj → Obj → Type h) (id : {A : Obj} → Hom A A) (_∘′_ : {A B C : Obj} → Hom B C → Hom A B → Hom A C) where open import Bi-invertibility eq Obj Hom id _∘′_ as Bi using (Has-left-inverse; Has-right-inverse; Is-bi-invertible; Has-quasi-inverse; _≊_; _≅_) open Derived-definitions-and-properties eq open import Equivalence eq as Eq using (_≃_) open import Equivalence.Erased eq as EEq using (_≃ᴱ_) open import Equivalence.Erased.Contractible-preimages eq as ECP using (Contractibleᴱ) open import Erased.Without-box-cong eq open import Function-universe eq as F hiding (id; _∘_) open import Logical-equivalence using (_⇔_) open import H-level eq open import H-level.Closure eq open import Preimage eq open import Surjection eq using (_↠_) private variable A B : Obj f : Hom A B infixr 9 _∘_ _∘_ : {A B C : Obj} → Hom B C → Hom A B → Hom A C _∘_ = _∘′_ -- Has-left-inverseᴱ f means that f has a left inverse. The proof is -- erased. Has-left-inverseᴱ : @0 Hom A B → Type h Has-left-inverseᴱ f = ∃ λ f⁻¹ → Erased (f⁻¹ ∘ f ≡ id) -- Has-right-inverseᴱ f means that f has a right inverse. The proof is -- erased. Has-right-inverseᴱ : @0 Hom A B → Type h Has-right-inverseᴱ f = ∃ λ f⁻¹ → Erased (f ∘ f⁻¹ ≡ id) -- Is-bi-invertibleᴱ f means that f has a left inverse and a (possibly -- distinct) right inverse. The proofs are erased. Is-bi-invertibleᴱ : @0 Hom A B → Type h Is-bi-invertibleᴱ f = Has-left-inverseᴱ f × Has-right-inverseᴱ f -- Has-quasi-inverseᴱ f means that f has a left inverse that is also a -- right inverse. The proofs are erased. Has-quasi-inverseᴱ : @0 Hom A B → Type h Has-quasi-inverseᴱ f = ∃ λ f⁻¹ → Erased (f ∘ f⁻¹ ≡ id × f⁻¹ ∘ f ≡ id) -- Some notions of isomorphism or equivalence. infix 4 _≊ᴱ_ _≅ᴱ_ _≊ᴱ_ : Obj → Obj → Type h A ≊ᴱ B = ∃ λ (f : Hom A B) → Is-bi-invertibleᴱ f _≅ᴱ_ : Obj → Obj → Type h A ≅ᴱ B = ∃ λ (f : Hom A B) → Has-quasi-inverseᴱ f -- Morphisms with quasi-inverses are bi-invertible. Has-quasi-inverseᴱ→Is-bi-invertibleᴱ : (@0 f : Hom A B) → Has-quasi-inverseᴱ f → Is-bi-invertibleᴱ f Has-quasi-inverseᴱ→Is-bi-invertibleᴱ _ (f⁻¹ , [ f∘f⁻¹≡id , f⁻¹∘f≡id ]) = (f⁻¹ , [ f⁻¹∘f≡id ]) , (f⁻¹ , [ f∘f⁻¹≡id ]) ≅ᴱ→≊ᴱ : A ≅ᴱ B → A ≊ᴱ B ≅ᴱ→≊ᴱ = ∃-cong λ f → Has-quasi-inverseᴱ→Is-bi-invertibleᴱ f -- Some conversion functions. Has-left-inverse→Has-left-inverseᴱ : Has-left-inverse f → Has-left-inverseᴱ f Has-left-inverse→Has-left-inverseᴱ = Σ-map P.id [_]→ @0 Has-left-inverse≃Has-left-inverseᴱ : Has-left-inverse f ≃ Has-left-inverseᴱ f Has-left-inverse≃Has-left-inverseᴱ {f = f} = (∃ λ f⁻¹ → f⁻¹ ∘ f ≡ id ) ↔⟨ (∃-cong λ _ → inverse $ erased Erased↔) ⟩□ (∃ λ f⁻¹ → Erased (f⁻¹ ∘ f ≡ id)) □ Has-right-inverse→Has-right-inverseᴱ : Has-right-inverse f → Has-right-inverseᴱ f Has-right-inverse→Has-right-inverseᴱ = Σ-map P.id [_]→ @0 Has-right-inverse≃Has-right-inverseᴱ : Has-right-inverse f ≃ Has-right-inverseᴱ f Has-right-inverse≃Has-right-inverseᴱ {f = f} = (∃ λ f⁻¹ → f ∘ f⁻¹ ≡ id ) ↔⟨ (∃-cong λ _ → inverse $ erased Erased↔) ⟩□ (∃ λ f⁻¹ → Erased (f ∘ f⁻¹ ≡ id)) □ Is-bi-invertible→Is-bi-invertibleᴱ : Is-bi-invertible f → Is-bi-invertibleᴱ f Is-bi-invertible→Is-bi-invertibleᴱ = Σ-map Has-left-inverse→Has-left-inverseᴱ Has-right-inverse→Has-right-inverseᴱ @0 Is-bi-invertible≃Is-bi-invertibleᴱ : Is-bi-invertible f ≃ Is-bi-invertibleᴱ f Is-bi-invertible≃Is-bi-invertibleᴱ {f = f} = Has-left-inverse f × Has-right-inverse f ↝⟨ Has-left-inverse≃Has-left-inverseᴱ ×-cong Has-right-inverse≃Has-right-inverseᴱ ⟩□ Has-left-inverseᴱ f × Has-right-inverseᴱ f □ Has-quasi-inverse→Has-quasi-inverseᴱ : Has-quasi-inverse f → Has-quasi-inverseᴱ f Has-quasi-inverse→Has-quasi-inverseᴱ = Σ-map P.id [_]→ @0 Has-quasi-inverse≃Has-quasi-inverseᴱ : Has-quasi-inverse f ≃ Has-quasi-inverseᴱ f Has-quasi-inverse≃Has-quasi-inverseᴱ {f = f} = (∃ λ f⁻¹ → f ∘ f⁻¹ ≡ id × f⁻¹ ∘ f ≡ id ) ↔⟨ (∃-cong λ _ → inverse $ erased Erased↔) ⟩□ (∃ λ f⁻¹ → Erased (f ∘ f⁻¹ ≡ id × f⁻¹ ∘ f ≡ id)) □ ≊→≊ᴱ : A ≊ B → A ≊ᴱ B ≊→≊ᴱ = Σ-map P.id Is-bi-invertible→Is-bi-invertibleᴱ @0 ≊≃≊ᴱ : (A ≊ B) ≃ (A ≊ᴱ B) ≊≃≊ᴱ {A = A} {B = B} = (∃ λ (f : Hom A B) → Is-bi-invertible f) ↝⟨ (∃-cong λ _ → Is-bi-invertible≃Is-bi-invertibleᴱ) ⟩□ (∃ λ (f : Hom A B) → Is-bi-invertibleᴱ f) □ ≅→≅ᴱ : A ≅ B → A ≅ᴱ B ≅→≅ᴱ = Σ-map P.id Has-quasi-inverse→Has-quasi-inverseᴱ @0 ≅≃≅ᴱ : (A ≅ B) ≃ (A ≅ᴱ B) ≅≃≅ᴱ {A = A} {B = B} = (∃ λ (f : Hom A B) → Has-quasi-inverse f) ↝⟨ (∃-cong λ _ → Has-quasi-inverse≃Has-quasi-inverseᴱ) ⟩□ (∃ λ (f : Hom A B) → Has-quasi-inverseᴱ f) □ -- The remaining code relies on some further assumptions, similar to -- those of a precategory. However, note that Hom A B is not required -- to be a set (some properties require Hom A A to be a set for some -- A). module More (@0 left-identity : {A B : Obj} (f : Hom A B) → id ∘ f ≡ f) (@0 right-identity : {A B : Obj} (f : Hom A B) → f ∘ id ≡ f) (@0 associativity : {A B C D : Obj} (f : Hom C D) (g : Hom B C) (h : Hom A B) → f ∘ (g ∘ h) ≡ (f ∘ g) ∘ h) where -- A workaround for Agda's lack of erased modules. private record Proofs : Type (o ⊔ h) where field lid : {A B : Obj} (f : Hom A B) → id ∘ f ≡ f rid : {A B : Obj} (f : Hom A B) → f ∘ id ≡ f ass : {A B C D : Obj} (f : Hom C D) (g : Hom B C) (h : Hom A B) → f ∘ (g ∘ h) ≡ (f ∘ g) ∘ h @0 proofs : Proofs proofs .Proofs.lid = left-identity proofs .Proofs.rid = right-identity proofs .Proofs.ass = associativity module BiM (p : Proofs) = Bi.More (Proofs.lid p) (Proofs.rid p) (Proofs.ass p) -- Bi-invertible morphisms have quasi-inverses. Is-bi-invertibleᴱ→Has-quasi-inverseᴱ : Is-bi-invertibleᴱ f → Has-quasi-inverseᴱ f Is-bi-invertibleᴱ→Has-quasi-inverseᴱ {f = f} ((f⁻¹₁ , [ f⁻¹₁∘f≡id ]) , (f⁻¹₂ , [ f∘f⁻¹₂≡id ])) = (f⁻¹₁ ∘ f ∘ f⁻¹₂) , [ (f ∘ f⁻¹₁ ∘ f ∘ f⁻¹₂ ≡⟨ cong (f ∘_) $ associativity _ _ _ ⟩ f ∘ (f⁻¹₁ ∘ f) ∘ f⁻¹₂ ≡⟨ cong (λ f′ → f ∘ f′ ∘ f⁻¹₂) f⁻¹₁∘f≡id ⟩ f ∘ id ∘ f⁻¹₂ ≡⟨ cong (f ∘_) $ left-identity _ ⟩ f ∘ f⁻¹₂ ≡⟨ f∘f⁻¹₂≡id ⟩∎ id ∎) , ((f⁻¹₁ ∘ f ∘ f⁻¹₂) ∘ f ≡⟨ cong (λ f′ → (f⁻¹₁ ∘ f′) ∘ f) f∘f⁻¹₂≡id ⟩ (f⁻¹₁ ∘ id) ∘ f ≡⟨ cong (_∘ f) $ right-identity _ ⟩ f⁻¹₁ ∘ f ≡⟨ f⁻¹₁∘f≡id ⟩∎ id ∎) ] -- Has-left-inverseᴱ f is contractible (with an erased proof) if f -- has a quasi-inverse (with erased proofs). Contractibleᴱ-Has-left-inverseᴱ : {@0 f : Hom A B} → Has-quasi-inverseᴱ f → Contractibleᴱ (Has-left-inverseᴱ f) Contractibleᴱ-Has-left-inverseᴱ {f = f} (f⁻¹ , [ f∘f⁻¹≡id , f⁻¹∘f≡id ]) = ECP.Contractibleᴱ-⁻¹ᴱ (_∘ f) (_∘ f⁻¹) (λ g → (g ∘ f⁻¹) ∘ f ≡⟨ sym $ associativity _ _ _ ⟩ g ∘ f⁻¹ ∘ f ≡⟨ cong (g ∘_) f⁻¹∘f≡id ⟩ g ∘ id ≡⟨ right-identity _ ⟩∎ g ∎) (λ g → (g ∘ f) ∘ f⁻¹ ≡⟨ sym $ associativity _ _ _ ⟩ g ∘ f ∘ f⁻¹ ≡⟨ cong (g ∘_) f∘f⁻¹≡id ⟩ g ∘ id ≡⟨ right-identity _ ⟩∎ g ∎) id -- Has-right-inverseᴱ f is contractible (with an erased proof) if f -- has a quasi-inverse (with erased proofs). Contractibleᴱ-Has-right-inverseᴱ : {@0 f : Hom A B} → Has-quasi-inverseᴱ f → Contractibleᴱ (Has-right-inverseᴱ f) Contractibleᴱ-Has-right-inverseᴱ {f = f} (f⁻¹ , [ f∘f⁻¹≡id , f⁻¹∘f≡id ]) = ECP.Contractibleᴱ-⁻¹ᴱ (f ∘_) (f⁻¹ ∘_) (λ g → f ∘ f⁻¹ ∘ g ≡⟨ associativity _ _ _ ⟩ (f ∘ f⁻¹) ∘ g ≡⟨ cong (_∘ g) f∘f⁻¹≡id ⟩ id ∘ g ≡⟨ left-identity _ ⟩∎ g ∎) (λ g → f⁻¹ ∘ f ∘ g ≡⟨ associativity _ _ _ ⟩ (f⁻¹ ∘ f) ∘ g ≡⟨ cong (_∘ g) f⁻¹∘f≡id ⟩ id ∘ g ≡⟨ left-identity _ ⟩∎ g ∎) id -- Is-bi-invertibleᴱ f is a proposition (in erased contexts). @0 Is-bi-invertibleᴱ-propositional : (f : Hom A B) → Is-proposition (Is-bi-invertibleᴱ f) Is-bi-invertibleᴱ-propositional f = $⟨ BiM.Is-bi-invertible-propositional proofs f ⟩ Is-proposition (Is-bi-invertible f) ↝⟨ H-level-cong _ 1 Is-bi-invertible≃Is-bi-invertibleᴱ ⦂ (_ → _) ⟩ Is-proposition (Is-bi-invertibleᴱ f) □ -- If Hom A A is a set, where A is the domain of f, then -- Has-quasi-inverseᴱ f is a proposition (in erased contexts). @0 Has-quasi-inverseᴱ-propositional-domain : {f : Hom A B} → Is-set (Hom A A) → Is-proposition (Has-quasi-inverseᴱ f) Has-quasi-inverseᴱ-propositional-domain {f = f} s = $⟨ BiM.Has-quasi-inverse-propositional-domain proofs s ⟩ Is-proposition (Has-quasi-inverse f) ↝⟨ H-level-cong _ 1 Has-quasi-inverse≃Has-quasi-inverseᴱ ⦂ (_ → _) ⟩□ Is-proposition (Has-quasi-inverseᴱ f) □ -- If Hom B B is a set, where B is the codomain of f, then -- Has-quasi-inverseᴱ f is a proposition (in erased contexts). @0 Has-quasi-inverseᴱ-propositional-codomain : {f : Hom A B} → Is-set (Hom B B) → Is-proposition (Has-quasi-inverseᴱ f) Has-quasi-inverseᴱ-propositional-codomain {f = f} s = $⟨ BiM.Has-quasi-inverse-propositional-codomain proofs s ⟩ Is-proposition (Has-quasi-inverse f) ↝⟨ H-level-cong _ 1 Has-quasi-inverse≃Has-quasi-inverseᴱ ⦂ (_ → _) ⟩□ Is-proposition (Has-quasi-inverseᴱ f) □ -- There is a logical equivalence between Has-quasi-inverseᴱ f and -- Is-bi-invertibleᴱ f. Has-quasi-inverseᴱ⇔Is-bi-invertibleᴱ : Has-quasi-inverseᴱ f ⇔ Is-bi-invertibleᴱ f Has-quasi-inverseᴱ⇔Is-bi-invertibleᴱ = record { to = Has-quasi-inverseᴱ→Is-bi-invertibleᴱ _ ; from = Is-bi-invertibleᴱ→Has-quasi-inverseᴱ } -- There is a logical equivalence between A ≅ᴱ B and A ≊ᴱ B. ≅ᴱ⇔≊ᴱ : (A ≅ᴱ B) ⇔ (A ≊ᴱ B) ≅ᴱ⇔≊ᴱ = ∃-cong λ _ → Has-quasi-inverseᴱ⇔Is-bi-invertibleᴱ -- Is-bi-invertibleᴱ and Has-quasi-inverseᴱ are equivalent (with -- erased proofs) for morphisms with domain A for which Hom A A is a -- set. Is-bi-invertibleᴱ≃ᴱHas-quasi-inverseᴱ-domain : {f : Hom A B} → @0 Is-set (Hom A A) → Is-bi-invertibleᴱ f ≃ᴱ Has-quasi-inverseᴱ f Is-bi-invertibleᴱ≃ᴱHas-quasi-inverseᴱ-domain s = EEq.⇔→≃ᴱ (Is-bi-invertibleᴱ-propositional _) (Has-quasi-inverseᴱ-propositional-domain s) (_⇔_.from Has-quasi-inverseᴱ⇔Is-bi-invertibleᴱ) (_⇔_.to Has-quasi-inverseᴱ⇔Is-bi-invertibleᴱ) -- Is-bi-invertibleᴱ and Has-quasi-inverseᴱ are equivalent (with -- erased proofs) for morphisms with codomain B for which Hom B B is -- a set. Is-bi-invertibleᴱ≃ᴱHas-quasi-inverseᴱ-codomain : {f : Hom A B} → @0 Is-set (Hom B B) → Is-bi-invertibleᴱ f ≃ᴱ Has-quasi-inverseᴱ f Is-bi-invertibleᴱ≃ᴱHas-quasi-inverseᴱ-codomain s = EEq.⇔→≃ᴱ (Is-bi-invertibleᴱ-propositional _) (Has-quasi-inverseᴱ-propositional-codomain s) (_⇔_.from Has-quasi-inverseᴱ⇔Is-bi-invertibleᴱ) (_⇔_.to Has-quasi-inverseᴱ⇔Is-bi-invertibleᴱ) -- A ≊ᴱ B and A ≅ᴱ B are equivalent (with erased proofs) if Hom A A -- is a set. ≊ᴱ≃ᴱ≅ᴱ-domain : @0 Is-set (Hom A A) → (A ≊ᴱ B) ≃ᴱ (A ≅ᴱ B) ≊ᴱ≃ᴱ≅ᴱ-domain s = ∃-cong λ _ → Is-bi-invertibleᴱ≃ᴱHas-quasi-inverseᴱ-domain s -- A ≊ᴱ B and A ≅ᴱ B are equivalent (with erased proofs) if Hom B B -- is a set. ≊ᴱ≃ᴱ≅ᴱ-codomain : @0 Is-set (Hom B B) → (A ≊ᴱ B) ≃ᴱ (A ≅ᴱ B) ≊ᴱ≃ᴱ≅ᴱ-codomain s = ∃-cong λ _ → Is-bi-invertibleᴱ≃ᴱHas-quasi-inverseᴱ-codomain s -- An equality characterisation lemma for _≊ᴱ_. @0 equality-characterisation-≊ᴱ : (f g : A ≊ᴱ B) → (f ≡ g) ≃ (proj₁ f ≡ proj₁ g) equality-characterisation-≊ᴱ f g = f ≡ g ↝⟨ inverse $ Eq.≃-≡ (inverse ≊≃≊ᴱ) ⟩ _≃_.from ≊≃≊ᴱ f ≡ _≃_.from ≊≃≊ᴱ g ↝⟨ BiM.equality-characterisation-≊ proofs _ _ ⟩□ proj₁ f ≡ proj₁ g □ -- Two equality characterisation lemmas for _≅ᴱ_. @0 equality-characterisation-≅ᴱ-domain : Is-set (Hom A A) → (f g : A ≅ᴱ B) → (f ≡ g) ≃ (proj₁ f ≡ proj₁ g) equality-characterisation-≅ᴱ-domain s f g = f ≡ g ↝⟨ inverse $ Eq.≃-≡ (inverse ≅≃≅ᴱ) ⟩ _≃_.from ≅≃≅ᴱ f ≡ _≃_.from ≅≃≅ᴱ g ↝⟨ BiM.equality-characterisation-≅-domain proofs s _ _ ⟩□ proj₁ f ≡ proj₁ g □ @0 equality-characterisation-≅ᴱ-codomain : Is-set (Hom B B) → (f g : A ≅ᴱ B) → (f ≡ g) ≃ (proj₁ f ≡ proj₁ g) equality-characterisation-≅ᴱ-codomain s f g = f ≡ g ↝⟨ inverse $ Eq.≃-≡ (inverse ≅≃≅ᴱ) ⟩ _≃_.from ≅≃≅ᴱ f ≡ _≃_.from ≅≃≅ᴱ g ↝⟨ BiM.equality-characterisation-≅-codomain proofs s _ _ ⟩□ proj₁ f ≡ proj₁ g □ -- If f : Hom A B has a quasi-inverse, then Has-quasi-inverseᴱ f is -- equivalent to id ≡ id (in erased contexts), where id stands for -- either the identity at A or at B. @0 Has-quasi-inverseᴱ≃id≡id-domain : {f : Hom A B} → Has-quasi-inverseᴱ f → Has-quasi-inverseᴱ f ≃ (id ≡ id {A = A}) Has-quasi-inverseᴱ≃id≡id-domain {f = f} q-inv = Has-quasi-inverseᴱ f ↝⟨ inverse Has-quasi-inverse≃Has-quasi-inverseᴱ ⟩ Has-quasi-inverse f ↝⟨ BiM.Has-quasi-inverse≃id≡id-domain proofs (_≃_.from Has-quasi-inverse≃Has-quasi-inverseᴱ q-inv) ⟩□ id ≡ id □ @0 Has-quasi-inverseᴱ≃id≡id-codomain : {f : Hom A B} → Has-quasi-inverseᴱ f → Has-quasi-inverseᴱ f ≃ (id ≡ id {A = B}) Has-quasi-inverseᴱ≃id≡id-codomain {f = f} q-inv = Has-quasi-inverseᴱ f ↝⟨ inverse Has-quasi-inverse≃Has-quasi-inverseᴱ ⟩ Has-quasi-inverse f ↝⟨ BiM.Has-quasi-inverse≃id≡id-codomain proofs (_≃_.from Has-quasi-inverse≃Has-quasi-inverseᴱ q-inv) ⟩□ id ≡ id □
Microprocessor_Interfacing_CSE_2006/Stepper_Motor_Lab_8/rotate.asm
aadhityasw/VIT-Labs
2
850
MOV CX,04H MOV SI,4200 MOV AL,[SI] OUT 0C0H,AL MOV BX,0FFFFH DEC BX JNZ 1010 INC SI LOOP 1008 JMP 1000 HLT
Engine/GameModes/LevelSelect.asm
gbcompo21/ReboundGB
0
88208
section "Level select RAM",wram0 NUM_LEVEL_SELECT_ENTRIES = 49 section "Level select routines",rom0 GM_LevelSelect: call ClearScreen ldfar hl,Pal_DebugScreen xor a call LoadPal ld a,8 ld hl,Pal_DebugScreen call LoadPal call CopyPalettes ldfar hl,Font ld de,$8000 call DecodeWLE ld a,NUM_LEVEL_SELECT_ENTRIES-1 ld [Debug_MenuMax],a xor a ld [Debug_MenuPos],a ld [sys_PauseGame],a farcall DS_Stop ld a,$18 ld [Debug_MenuOffset],a ld a,LCDCF_ON | LCDCF_BG8000 | LCDCF_OBJON | LCDCF_BGON ldh [rLCDC],a ld a,IEF_VBLANK ldh [rIE],a ei call LevelSelect_DrawNames LevelSelectLoop: ld a,[sys_btnPress] bit btnUp,a jr z,.checkdown ld hl,Debug_MenuPos dec [hl] ld a,[hl] cp $ff jr nz,:+ ld a,[Debug_MenuMax] ld [hl],a : call LevelSelect_DrawNames jr .drawcursor .checkdown bit btnDown,a jr z,.checkLeft ld hl,Debug_MenuPos inc [hl] ld b,[hl] ld a,[Debug_MenuMax] inc a cp b jr nz,:+ xor a ld [hl],a : call LevelSelect_DrawNames jr .drawcursor .checkLeft bit btnLeft,a jr z,.checkRight ld a,[Debug_MenuPos] sub 16 jr nc,:+ xor a : ld [Debug_MenuPos],a call LevelSelect_DrawNames jr .drawcursor .checkRight bit btnRight,a jr z,.checkA ld a,[Debug_MenuPos] add 16 cp NUM_LEVEL_SELECT_ENTRIES-1 jr c,:+ ld a,NUM_LEVEL_SELECT_ENTRIES-1 : ld [Debug_MenuPos],a call LevelSelect_DrawNames jr .drawcursor .checkA bit btnA,a jr z,.checkB ; TODO halt xor a ldh [rLCDC],a ld a,PLAYER_LIVES ld [Player_LifeCount],a xor a ld [Player_CoinCount],a ld [Player_CoinCount+1],a ld a,[Debug_MenuPos] jp GM_Level .checkB bit btnB,a jr z,.drawcursor halt xor a ldh [rLCDC],a jp GM_DebugMenu .drawcursor call Debug_DrawCursor halt jp LevelSelectLoop LevelSelect_DrawNames: ld hl,$9800 ld bc,$400 : WaitForVRAM xor a ld [hl+],a dec bc ld a,b or c jr nz,:- ld b,bank(LevelSelect_LevelNames) call _Bankswitch ld a,[Debug_MenuPos] and $f0 ld b,16 ld de,$9822 : push af ld hl,LevelSelect_LevelNames add a add l ld l,a jr nc,:+ inc h : ld a,[hl+] ld h,[hl] ld l,a push de call PrintString pop de ld a,e add 32 ld e,a jr nc,:+ inc d : pop af inc a cp NUM_LEVEL_SELECT_ENTRIES ret z dec b jr nz,:--- ret section "Level names",romx LevelSelect_LevelNames: dw .0 dw .1, .2, .3, .4, .5, .6, .7 dw .8, .9,.10,.11,.12,.13,.14 dw .15,.16,.17,.18,.19,.20,.21 dw .22,.23,.24,.25,.26,.27,.28 dw .29,.30,.31,.32,.33,.34,.35 dw .36,.37,.38,.39,.40,.41,.42 .0 db "TEST MAP",0 .1 db "PLAIN PLAINS 1",0 .2 db "PLAIN PLAINS 2",0 .3 db "PLAIN PLAINS 3",0 .4 db "PLAIN PLAINS 4",0 .5 db "PLAIN PLAINS 5",0 .6 db "PLAIN PLAINS 6",0 .7 db "BOSS 1",0 .8 db "CENTRAL CITY 1",0 .9 db "CENTRAL CITY 2",0 .10 db "CENTRAL CITY 3",0 .11 db "CENTRAL CITY 4",0 .12 db "CENTRAL CITY 5",0 .13 db "CENTRAL CITY 6",0 .14 db "BOSS 2",0 .15 db "FORLORN FOREST 1",0 .16 db "FORLORN FOREST 2",0 .17 db "FORLORN FOREST 3",0 .18 db "FORLORN FOREST 4",0 .19 db "FORLORN FOREST 5",0 .20 db "FORLORN FOREST 6",0 .21 db "BOSS 3",0 .22 db "PYRAMID POWER 1",0 .23 db "PYRAMID POWER 2",0 .24 db "PYRAMID POWER 3",0 .25 db "PYRAMID POWER 4",0 .26 db "PYRAMID POWER 5",0 .27 db "PYRAMID POWER 6",0 .28 db "BOSS 4",0 .29 db "GREAT GROTTO 1",0 .30 db "GREAT GROTTO 2",0 .31 db "GREAT GROTTO 3",0 .32 db "GREAT GROTTO 4",0 .33 db "GREAT GROTTO 5",0 .34 db "GREAT GROTTO 6",0 .35 db "BOSS 5",0 .36 db "TRAP TEMPLE 1",0 .37 db "TRAP TEMPLE 2",0 .38 db "TRAP TEMPLE 3",0 .39 db "TRAP TEMPLE 4",0 .40 db "TRAP TEMPLE 5",0 .41 db "TRAP TEMPLE 6",0 .42 db "FINAL BOSS",0
include/sf-network-http.ads
danva994/ASFML-1.6
1
12286
-- //////////////////////////////////////////////////////////// -- // -- // SFML - Simple and Fast Multimedia Library -- // Copyright (C) 2007-2009 <NAME> (<EMAIL>) -- // -- // This software is provided 'as-is', without any express or implied warranty. -- // In no event will the authors be held liable for any damages arising from the use of this software. -- // -- // Permission is granted to anyone to use this software for any purpose, -- // including commercial applications, and to alter it and redistribute it freely, -- // subject to the following restrictions: -- // -- // 1. The origin of this software must not be misrepresented; -- // you must not claim that you wrote the original software. -- // If you use this software in a product, an acknowledgment -- // in the product documentation would be appreciated but is not required. -- // -- // 2. Altered source versions must be plainly marked as such, -- // and must not be misrepresented as being the original software. -- // -- // 3. This notice may not be removed or altered from any source distribution. -- // -- //////////////////////////////////////////////////////////// -- //////////////////////////////////////////////////////////// -- // Headers -- //////////////////////////////////////////////////////////// with Sf.Config; with Sf.Network.Types; package Sf.Network.Http is use Sf.Config; use Sf.Network.Types; -- //////////////////////////////////////////////////////////// -- /// Enumerate the available HTTP methods for a request -- //////////////////////////////////////////////////////////// type sfHttpMethod is (sfHttpGet, sfHttpPost, sfHttpHead); -- //////////////////////////////////////////////////////////// -- /// Enumerate all the valid status codes returned in -- /// a HTTP response -- //////////////////////////////////////////////////////////// subtype sfHttpStatus is sfUint32; sfHttpOk : constant sfHttpStatus := 200; sfHttpCreated : constant sfHttpStatus := 201; sfHttpAccepted : constant sfHttpStatus := 202; sfHttpNoContent : constant sfHttpStatus := 204; sfHttpMultipleChoices : constant sfHttpStatus := 300; sfHttpMovedPermanently : constant sfHttpStatus := 301; sfHttpMovedTemporarily : constant sfHttpStatus := 302; sfHttpNotModified : constant sfHttpStatus := 304; sfHttpBadRequest : constant sfHttpStatus := 400; sfHttpUnauthorized : constant sfHttpStatus := 401; sfHttpForbidden : constant sfHttpStatus := 403; sfHttpNotFound : constant sfHttpStatus := 404; sfHttpInternalServerError : constant sfHttpStatus := 500; sfHttpNotImplemented : constant sfHttpStatus := 501; sfHttpBadGateway : constant sfHttpStatus := 502; sfHttpServiceNotAvailable : constant sfHttpStatus := 503; sfHttpInvalidResponse : constant sfHttpStatus := 1000; sfHttpConnectionFailed : constant sfHttpStatus := 1001; -- //////////////////////////////////////////////////////////// -- /// Construct a new Http request -- /// -- /// \return Pointer to the new Http request -- /// -- //////////////////////////////////////////////////////////// function sfHttpRequest_Create return sfHttpRequest_Ptr; -- //////////////////////////////////////////////////////////// -- /// Destroy an existing Http request -- /// -- /// \param HttpRequest : Http request to destroy -- /// -- //////////////////////////////////////////////////////////// procedure sfHttpRequest_Destroy (HttpRequest : sfHttpRequest_Ptr); -- //////////////////////////////////////////////////////////// -- /// Set the value of a field; the field is added if it doesn't exist -- /// -- /// \param HttpRequest : Http request to modify -- /// \param Field : Name of the field to set (case-insensitive) -- /// \param Value : Value of the field -- /// -- //////////////////////////////////////////////////////////// procedure sfHttpRequest_SetField (HttpRequest : sfHttpRequest_Ptr; Field : String; Value : String); -- //////////////////////////////////////////////////////////// -- /// Set the request method. -- /// This parameter is sfHttpGet by default -- /// -- /// \param HttpRequest : Http request to modify -- /// \param RequestMethod : Method to use for the request -- /// -- //////////////////////////////////////////////////////////// procedure sfHttpRequest_SetMethod (HttpRequest : sfHttpRequest_Ptr; Method : sfHttpMethod); -- //////////////////////////////////////////////////////////// -- /// Set the target URI of the request. -- /// This parameter is "/" by default -- /// -- /// \param HttpRequest : Http request to modify -- /// \param URI : URI to request, local to the host -- /// -- //////////////////////////////////////////////////////////// procedure sfHttpRequest_SetURI (HttpRequest : sfHttpRequest_Ptr; URI : String); -- //////////////////////////////////////////////////////////// -- /// Set the HTTP version of the request. -- /// This parameter is 1.0 by default -- /// -- /// \param HttpRequest : Http request to modify -- /// \param Major : Major version number -- /// \param Minor : Minor version number -- /// -- //////////////////////////////////////////////////////////// procedure sfHttpRequest_SetHttpVersion (HttpRequest : sfHttpRequest_Ptr; Major : sfUint32; Minor : sfUint32); -- //////////////////////////////////////////////////////////// -- /// Set the body of the request. This parameter is optional and -- /// makes sense only for POST requests. -- /// This parameter is empty by default -- /// -- /// \param HttpRequest : Http request to modify -- /// \param Body : Content of the request body -- /// -- //////////////////////////////////////////////////////////// procedure sfHttpRequest_SetBody (HttpRequest : sfHttpRequest_Ptr; The_Body : String); -- //////////////////////////////////////////////////////////// -- /// Destroy an existing Http response -- /// -- /// \param HttpResponse : Http response to destroy -- /// -- //////////////////////////////////////////////////////////// procedure sfHttpResponse_Destroy (HttpResponse : sfHttpResponse_Ptr); -- //////////////////////////////////////////////////////////// -- /// Get the value of a field; returns NULL if the field doesn't exist -- /// -- /// \param HttpResponse : Http response -- /// \param Field : Field to get -- /// -- /// \return Value of the field (NULL if it doesn't exist) -- /// -- //////////////////////////////////////////////////////////// function sfHttpResponse_GetField (HttpResponse : sfHttpResponse_Ptr; Field : String) return String; -- //////////////////////////////////////////////////////////// -- /// Get the status of a response -- /// -- /// \param HttpResponse : Http response -- /// -- /// \return Status of the response -- /// -- //////////////////////////////////////////////////////////// function sfHttpResponse_GetStatus (HttpResponse : sfHttpResponse_Ptr) return sfHttpStatus; -- //////////////////////////////////////////////////////////// -- /// Get the major HTTP version of a response -- /// -- /// \param HttpResponse : Http response -- /// -- /// \return HTTP major version of the response -- /// -- //////////////////////////////////////////////////////////// function sfHttpResponse_GetMajorVersion (HttpResponse : sfHttpResponse_Ptr) return sfUint32; -- //////////////////////////////////////////////////////////// -- /// Get the minor HTTP version of a response -- /// -- /// \param HttpResponse : Http response -- /// -- /// \return HTTP minor version of the response -- /// -- //////////////////////////////////////////////////////////// function sfHttpResponse_GetMinorVersion (HttpResponse : sfHttpResponse_Ptr) return sfUint32; -- //////////////////////////////////////////////////////////// -- /// Get the body of the response. The body can contain : -- /// - the requested page (for GET requests) -- /// - a response from the server (for POST requests) -- /// - nothing (for HEAD requests) -- /// - an error message (in case of an error) -- /// -- /// \param HttpResponse : Http response -- /// -- /// \return Body of the response (empty string if no body) -- /// -- //////////////////////////////////////////////////////////// function sfHttpResponse_GetBody (HttpResponse : sfHttpResponse_Ptr) return String; -- //////////////////////////////////////////////////////////// -- /// Construct a new Http object -- /// -- /// \return Pointer to the new Http -- /// -- //////////////////////////////////////////////////////////// function sfHttp_Create return sfHttp_Ptr; -- //////////////////////////////////////////////////////////// -- /// Destroy an existing Http object -- /// -- /// \param Http : Http to destroy -- /// -- //////////////////////////////////////////////////////////// procedure sfHttp_Destroy (Http : sfHttp_Ptr); -- //////////////////////////////////////////////////////////// -- /// Set the target host of a Http server -- /// -- /// \param Http : Http object -- /// \param Host : Web server to connect to -- /// \param Port : Port to use for connection (0 to use the standard port of the protocol used) -- /// -- //////////////////////////////////////////////////////////// procedure sfHttp_SetHost (Http : sfHttp_Ptr; Host : String; Port : sfUint16); -- //////////////////////////////////////////////////////////// -- /// Send a HTTP request and return the server's response. -- /// You must be connected to a host before sending requests. -- /// Any missing mandatory header field will be added with an appropriate value. -- /// Warning : this function waits for the server's response and may -- /// not return instantly; use a thread if you don't want to block your -- /// application. -- /// -- /// \param Http : Http object -- /// \param Request : Request to send -- /// \param Timeout : Maximum time to wait (0 to use no timeout) -- /// -- /// \return Server's response, or NULL if request is invalid -- /// -- //////////////////////////////////////////////////////////// function sfHttp_SendRequest (Http : sfHttp_Ptr; Request : sfHttpRequest_Ptr; Timeout : Float) return sfHttpResponse_Ptr; private pragma Convention (C, sfHttpMethod); pragma Import (C, sfHttpRequest_Create, "sfHttpRequest_Create"); pragma Import (C, sfHttpRequest_Destroy, "sfHttpRequest_Destroy"); pragma Import (C, sfHttpRequest_SetMethod, "sfHttpRequest_SetMethod"); pragma Import (C, sfHttpRequest_SetHttpVersion, "sfHttpRequest_SetHttpVersion"); pragma Import (C, sfHttpResponse_Destroy, "sfHttpResponse_Destroy"); pragma Import (C, sfHttpResponse_GetStatus, "sfHttpResponse_GetStatus"); pragma Import (C, sfHttpResponse_GetMajorVersion, "sfHttpResponse_GetMajorVersion"); pragma Import (C, sfHttpResponse_GetMinorVersion, "sfHttpResponse_GetMinorVersion"); pragma Import (C, sfHttp_Create, "sfHttp_Create"); pragma Import (C, sfHttp_Destroy, "sfHttp_Destroy"); pragma Import (C, sfHttp_SendRequest, "sfHttp_SendRequest"); end Sf.Network.Http;
test/Fail/Issue2132.agda
cruhland/agda
1,989
15417
<filename>test/Fail/Issue2132.agda -- Andreas, 2016-08-08, issue #2132 reported by effectfully -- Pattern synonyms in lhss of display form definitions -- {-# OPTIONS -v scope:50 -v tc.decl:10 #-} open import Common.Equality data D : Set where C c : D g : D → D pattern C′ = C {-# DISPLAY C′ = C′ #-} {-# DISPLAY g C′ = c #-} -- Since pattern synonyms are now expanded on lhs of DISPLAY, -- this behaves as -- {-# DISPLAY C = C′ #-} -- {-# DISPLAY g C = c #-} test : C ≡ g C test = refl -- Expected error: -- C′ != c of type D -- when checking that the expression refl has type C′ ≡ c
libsrc/_DEVELOPMENT/adt/p_forward_list/z80/asm_p_forward_list_remove.asm
meesokim/z88dk
0
170228
<reponame>meesokim/z88dk<gh_stars>0 ; =============================================================== ; Jan 2014 ; =============================================================== ; ; void *p_forward_list_remove(p_forward_list_t *list, void *item) ; ; Remove item from the list. O(n). ; ; =============================================================== SECTION code_adt_p_forward_list PUBLIC asm_p_forward_list_remove EXTERN error_zc EXTERN __p_forward_list_locate_item, asm_p_forward_list_remove_after asm_p_forward_list_remove: ; enter : hl = p_forward_list_t *list ; bc = void *item ; ; exit : bc = void *item ; ; success ; ; hl = void *item ; de = void *item_prev (item in list before hl, may be list *) ; z flag set if item was the last in the list ; carry reset ; ; fail if item not member of the list ; ; hl = 0 ; carry set ; ; uses : af, de, hl call __p_forward_list_locate_item jp nc, asm_p_forward_list_remove_after jp error_zc
programs/oeis/292/A292639.asm
karttu/loda
0
22151
<reponame>karttu/loda ; A292639: Rank of (3+r)*n when all the numbers (3-r)*j and (3+r)*k, where r = sqrt(5), j>=1, k>=1, are jointly ranked. ; 7,15,23,31,39,47,54,62,70,78,86,94,102,109,117,125,133,141,149,157,164,172,180,188,196,204,212,219,227,235,243,251,259,267,274,282,290,298,306,314,322,329,337,345,353,361,369,376,384,392,400,408,416,424,431,439,447,455,463,471,479,486,494,502,510,518,526,534,541,549,557,565,573,581,589,596,604,612,620,628,636,644,651,659,667,675,683,691,699,706,714,722,730,738,746,753,761,769,777,785,793,801,808,816,824,832,840,848,856,863,871,879,887,895,903,911,918,926,934,942,950,958,966,973,981,989,997,1005,1013,1021,1028,1036,1044,1052,1060,1068,1076,1083,1091,1099,1107,1115,1123,1130,1138,1146,1154,1162,1170,1178,1185,1193,1201,1209,1217,1225,1233,1240,1248,1256,1264,1272,1280,1288,1295,1303,1311,1319,1327,1335,1343,1350,1358,1366,1374,1382,1390,1398,1405,1413,1421,1429,1437,1445,1453,1460,1468,1476,1484,1492,1500,1507,1515,1523,1531,1539,1547,1555,1562,1570,1578,1586,1594,1602,1610,1617,1625,1633,1641,1649,1657,1665,1672,1680,1688,1696,1704,1712,1720,1727,1735,1743,1751,1759,1767,1775,1782,1790,1798,1806,1814,1822,1830,1837,1845,1853,1861,1869,1877,1884,1892,1900,1908,1916,1924,1932,1939,1947,1955,1963 mov $1,7 add $1,$0 div $1,6 add $1,$0 div $1,8 mov $3,1 sub $3,$1 add $3,6 mov $1,$3 mov $2,$0 mul $2,8 add $1,$2
utils/yangutils/src/main/resources/GeneratedYang.g4
K-OpenNet/ONOS-ApSM
0
6549
/* * Copyright 2016 Open Networking Laboratory * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ /** * This is a YANG grammar for parser based on which ANTLR will generate YANG parser. */ grammar GeneratedYang; import YangLexer; @header { package org.onosproject.yangutils.parser.antlrgencode; } yangfile : moduleStatement | subModuleStatement; /** * module-stmt = optsep module-keyword sep identifier-arg-str * optsep * "{" stmtsep * module-header-stmts * linkage-stmts * meta-stmts * revision-stmts * body-stmts * "}" optsep */ moduleStatement : MODULE_KEYWORD IDENTIFIER LEFT_CURLY_BRACE moduleBody* RIGHT_CURLY_BRACE; moduleBody : moduleHeaderStatement linkageStatements metaStatements revisionStatements bodyStatements; /** * module-header-stmts = ;; these stmts can appear in any order * [yang-version-stmt stmtsep] * namespace-stmt stmtsep * prefix-stmt stmtsep */ moduleHeaderStatement : yangVersionStatement? namespaceStatement prefixStatement | yangVersionStatement? prefixStatement namespaceStatement | namespaceStatement yangVersionStatement? prefixStatement | namespaceStatement prefixStatement yangVersionStatement? | prefixStatement namespaceStatement yangVersionStatement? | prefixStatement yangVersionStatement? namespaceStatement ; /** * linkage-stmts = ;; these stmts can appear in any order * *(import-stmt stmtsep) * *(include-stmt stmtsep) */ linkageStatements : (importStatement | includeStatement)*; /** * meta-stmts = ;; these stmts can appear in any order * [organization-stmt stmtsep] * [contact-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] */ metaStatements : organizationStatement? contactStatement? descriptionStatement? referenceStatement? | organizationStatement? contactStatement? referenceStatement? descriptionStatement? | organizationStatement? descriptionStatement? contactStatement? referenceStatement? | organizationStatement? descriptionStatement? referenceStatement? contactStatement? | organizationStatement? referenceStatement? contactStatement? descriptionStatement? | organizationStatement? referenceStatement? descriptionStatement? contactStatement? | contactStatement? organizationStatement? descriptionStatement? referenceStatement? | contactStatement? organizationStatement? referenceStatement? descriptionStatement? | contactStatement? referenceStatement? organizationStatement? descriptionStatement? | contactStatement? referenceStatement? descriptionStatement? organizationStatement? | contactStatement? descriptionStatement? referenceStatement? organizationStatement? | contactStatement? descriptionStatement? organizationStatement? referenceStatement? | referenceStatement? contactStatement? organizationStatement? descriptionStatement? | referenceStatement? contactStatement? descriptionStatement? organizationStatement? | referenceStatement? organizationStatement? contactStatement? descriptionStatement? | referenceStatement? organizationStatement? descriptionStatement? contactStatement? | referenceStatement? descriptionStatement? organizationStatement? contactStatement? | referenceStatement? descriptionStatement? contactStatement? organizationStatement? | descriptionStatement? referenceStatement? contactStatement? organizationStatement? | descriptionStatement? referenceStatement? organizationStatement? contactStatement? | descriptionStatement? contactStatement? referenceStatement? organizationStatement? | descriptionStatement? contactStatement? organizationStatement? referenceStatement? | descriptionStatement? organizationStatement? contactStatement? referenceStatement? | descriptionStatement? organizationStatement? referenceStatement? contactStatement? ; // revision-stmts = *(revision-stmt stmtsep) revisionStatements : revisionStatement*; /** * body-stmts = *((extension-stmt / * feature-stmt / * identity-stmt / * typedef-stmt / * grouping-stmt / * data-def-stmt / * augment-stmt / * rpc-stmt / * notification-stmt / * deviation-stmt) stmtsep) */ bodyStatements : (extensionStatement | featureStatement | identityStatement | typedefStatement | groupingStatement | dataDefStatement | augmentStatement | rpcStatement | notificationStatement | deviationStatement)* ; /** * yang-version-stmt = yang-version-keyword sep yang-version-arg-str * optsep stmtend */ yangVersionStatement : YANG_VERSION_KEYWORD INTEGER STMTEND; /** * namespace-stmt = namespace-keyword sep uri-str optsep stmtend * For namespace validation TODO in Listener */ namespaceStatement : NAMESPACE_KEYWORD string STMTEND; /** * prefix-stmt = prefix-keyword sep prefix-arg-str * optsep stmtend */ prefixStatement : PREFIX_KEYWORD IDENTIFIER STMTEND; /** * import-stmt = import-keyword sep identifier-arg-str optsep * "{" stmtsep * prefix-stmt stmtsep * [revision-date-stmt stmtsep] * "}" */ importStatement : IMPORT_KEYWORD IDENTIFIER LEFT_CURLY_BRACE importStatementBody RIGHT_CURLY_BRACE; importStatementBody : prefixStatement revisionDateStatement?; // revision-date-stmt = revision-date-keyword sep revision-date stmtend revisionDateStatement : REVISION_DATE_KEYWORD DATE_ARG STMTEND; /** * include-stmt = include-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * [revision-date-stmt stmtsep] * "}") */ includeStatement : INCLUDE_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE revisionDateStatement? RIGHT_CURLY_BRACE); /** * organization-stmt = organization-keyword sep string * optsep stmtend */ organizationStatement : ORGANIZATION_KEYWORD string STMTEND; // contact-stmt = contact-keyword sep string optsep stmtend contactStatement : CONTACT_KEYWORD string STMTEND; // description-stmt = description-keyword sep string optsep stmtend descriptionStatement : DESCRIPTION_KEYWORD string STMTEND; // reference-stmt = reference-keyword sep string optsep stmtend referenceStatement : REFERENCE_KEYWORD string STMTEND; /** * revision-stmt = revision-keyword sep revision-date optsep * (";" / * "{" stmtsep * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ revisionStatement : REVISION_KEYWORD DATE_ARG (STMTEND | LEFT_CURLY_BRACE revisionStatementBody RIGHT_CURLY_BRACE); revisionStatementBody : descriptionStatement? referenceStatement?; /** * submodule-stmt = optsep submodule-keyword sep identifier-arg-str * optsep * "{" stmtsep * submodule-header-stmts * linkage-stmts * meta-stmts * revision-stmts * body-stmts * "}" optsep */ subModuleStatement : SUBMODULE_KEYWORD IDENTIFIER LEFT_CURLY_BRACE submoduleBody* RIGHT_CURLY_BRACE; submoduleBody : submoduleHeaderStatement linkageStatements metaStatements revisionStatements bodyStatements; /** submodule-header-stmts = * ;; these stmts can appear in any order * [yang-version-stmt stmtsep] * belongs-to-stmt stmtsep */ submoduleHeaderStatement : yangVersionStatement? belongstoStatement | belongstoStatement yangVersionStatement? ; /** * belongs-to-stmt = belongs-to-keyword sep identifier-arg-str * optsep * "{" stmtsep * prefix-stmt stmtsep * "}" */ belongstoStatement : BELONGS_TO_KEYWORD IDENTIFIER LEFT_CURLY_BRACE belongstoStatementBody RIGHT_CURLY_BRACE; belongstoStatementBody : prefixStatement; /** * extension-stmt = extension-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [argument-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ extensionStatement : EXTENSION_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE extensionBody RIGHT_CURLY_BRACE); extensionBody : argumentStatement? statusStatement? descriptionStatement? referenceStatement? | argumentStatement? statusStatement? referenceStatement? descriptionStatement? | argumentStatement? descriptionStatement? statusStatement? referenceStatement? | argumentStatement? descriptionStatement? referenceStatement? statusStatement? | argumentStatement? referenceStatement? descriptionStatement? statusStatement? | argumentStatement? referenceStatement? statusStatement? descriptionStatement? | statusStatement? referenceStatement? argumentStatement? descriptionStatement? | statusStatement? referenceStatement? descriptionStatement? argumentStatement? | statusStatement? descriptionStatement? referenceStatement? argumentStatement? | statusStatement? descriptionStatement? argumentStatement? referenceStatement? | statusStatement? argumentStatement? referenceStatement? descriptionStatement? | statusStatement? argumentStatement? descriptionStatement? referenceStatement? | descriptionStatement? argumentStatement? statusStatement? referenceStatement? | descriptionStatement? argumentStatement? referenceStatement? statusStatement? | descriptionStatement? statusStatement? argumentStatement? referenceStatement? | descriptionStatement? statusStatement? referenceStatement? argumentStatement? | descriptionStatement? referenceStatement? statusStatement? argumentStatement? | descriptionStatement? referenceStatement? argumentStatement? statusStatement? | referenceStatement? descriptionStatement? argumentStatement? statusStatement? | referenceStatement? descriptionStatement? statusStatement? argumentStatement? | referenceStatement? statusStatement? argumentStatement? descriptionStatement? | referenceStatement? statusStatement? descriptionStatement? argumentStatement? | referenceStatement? argumentStatement? descriptionStatement? statusStatement? | referenceStatement? argumentStatement? statusStatement? descriptionStatement? ; /** * argument-stmt = argument-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * [yin-element-stmt stmtsep] * "}") */ argumentStatement : ARGUMENT_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE argumentBody RIGHT_CURLY_BRACE); argumentBody : yinElementStatement?; /** * yin-element-stmt = yin-element-keyword sep yin-element-arg-str * stmtend */ yinElementStatement : YIN_ELEMENT_KEYWORD (TRUE_KEYWORD | FALSE_KEYWORD) STMTEND; /** * identity-stmt = identity-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [base-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ identityStatement : IDENTITY_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE identityBody RIGHT_CURLY_BRACE); identityBody : baseStatement? statusStatement? descriptionStatement? referenceStatement? | baseStatement? statusStatement? referenceStatement? descriptionStatement? | baseStatement? descriptionStatement? statusStatement? referenceStatement? | baseStatement? descriptionStatement? referenceStatement? statusStatement? | baseStatement? referenceStatement? descriptionStatement? statusStatement? | baseStatement? referenceStatement? statusStatement? descriptionStatement? | referenceStatement? baseStatement? statusStatement? descriptionStatement? | referenceStatement? baseStatement? descriptionStatement? statusStatement? | referenceStatement? statusStatement? baseStatement? descriptionStatement? | referenceStatement? statusStatement? descriptionStatement? baseStatement? | referenceStatement? descriptionStatement? statusStatement? baseStatement? | referenceStatement? descriptionStatement? baseStatement? statusStatement? | descriptionStatement? referenceStatement? statusStatement? baseStatement? | descriptionStatement? referenceStatement? statusStatement? baseStatement? | descriptionStatement? referenceStatement? baseStatement? statusStatement? | descriptionStatement? statusStatement? baseStatement? referenceStatement? | descriptionStatement? statusStatement? referenceStatement? baseStatement? | descriptionStatement? baseStatement? referenceStatement? statusStatement? | descriptionStatement? baseStatement? statusStatement? referenceStatement? | statusStatement? baseStatement? descriptionStatement? referenceStatement? | statusStatement? baseStatement? referenceStatement? descriptionStatement? | statusStatement? descriptionStatement? baseStatement? referenceStatement? | statusStatement? descriptionStatement? referenceStatement? baseStatement? | statusStatement? referenceStatement? descriptionStatement? baseStatement? | statusStatement? referenceStatement? baseStatement? descriptionStatement? ; /** * base-stmt = base-keyword sep identifier-ref-arg-str * optsep stmtend* * identifier-ref-arg = [prefix ":"] identifier */ baseStatement : BASE_KEYWORD string STMTEND; /** * feature-stmt = feature-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * *(if-feature-stmt stmtsep) * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ featureStatement : FEATURE_KEYWORD string (STMTEND | LEFT_CURLY_BRACE featureBody RIGHT_CURLY_BRACE); featureBody : ifFeatureStatement* statusStatement? descriptionStatement? referenceStatement? | ifFeatureStatement* statusStatement? referenceStatement? descriptionStatement? | ifFeatureStatement* descriptionStatement? statusStatement? referenceStatement? | ifFeatureStatement* descriptionStatement? referenceStatement? statusStatement? | ifFeatureStatement* referenceStatement? statusStatement? descriptionStatement? | ifFeatureStatement* referenceStatement? descriptionStatement? statusStatement? | statusStatement? ifFeatureStatement* descriptionStatement? referenceStatement? | statusStatement? ifFeatureStatement* referenceStatement? descriptionStatement? | statusStatement? descriptionStatement? ifFeatureStatement* referenceStatement? | statusStatement? descriptionStatement? referenceStatement? ifFeatureStatement* | statusStatement? referenceStatement? ifFeatureStatement* descriptionStatement? | statusStatement? referenceStatement? descriptionStatement? ifFeatureStatement* | descriptionStatement? ifFeatureStatement* statusStatement? referenceStatement? | descriptionStatement? ifFeatureStatement* referenceStatement? statusStatement? | descriptionStatement? statusStatement? ifFeatureStatement* referenceStatement? | descriptionStatement? statusStatement? referenceStatement? ifFeatureStatement* | descriptionStatement? referenceStatement* statusStatement? ifFeatureStatement* | descriptionStatement? referenceStatement* ifFeatureStatement? statusStatement? | referenceStatement? ifFeatureStatement* statusStatement? descriptionStatement? | referenceStatement? ifFeatureStatement* descriptionStatement? statusStatement? | referenceStatement? descriptionStatement? statusStatement? ifFeatureStatement* | referenceStatement? descriptionStatement? ifFeatureStatement* statusStatement? | referenceStatement? statusStatement? descriptionStatement? ifFeatureStatement* | referenceStatement? statusStatement? ifFeatureStatement* descriptionStatement? ; /** * data-def-stmt = container-stmt / * leaf-stmt / * leaf-list-stmt / * list-stmt / * choice-stmt / * anyxml-stmt / * uses-stmt */ dataDefStatement : containerStatement | leafStatement | leafListStatement | listStatement | choiceStatement | usesStatement; /** * if-feature-stmt = if-feature-keyword sep identifier-ref-arg-str * optsep stmtend */ ifFeatureStatement : IF_FEATURE_KEYWORD string STMTEND; /** * units-stmt = units-keyword sep string optsep stmtend */ unitsStatement : UNITS_KEYWORD string STMTEND; /** * typedef-stmt = typedef-keyword sep identifier-arg-str optsep * "{" stmtsep * ;; these stmts can appear in any order * type-stmt stmtsep * [units-stmt stmtsep] * [default-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}" * TODO : 0..1 occurance to be validated in listener */ typedefStatement : TYPEDEF_KEYWORD IDENTIFIER LEFT_CURLY_BRACE (typeStatement | unitsStatement | defaultStatement | statusStatement | descriptionStatement | referenceStatement)* RIGHT_CURLY_BRACE; /** * type-stmt = type-keyword sep identifier-ref-arg-str optsep * (";" / * "{" stmtsep * type-body-stmts * "}") */ typeStatement : TYPE_KEYWORD string (STMTEND | LEFT_CURLY_BRACE typeBodyStatements RIGHT_CURLY_BRACE); /** * type-body-stmts = numerical-restrictions / * decimal64-specification / * string-restrictions / * enum-specification / * leafref-specification / * identityref-specification / * instance-identifier-specification / * bits-specification / * union-specification * TODO : decimal64-specification to be added */ typeBodyStatements : numericalRestrictions | stringRestrictions | enumSpecification | leafrefSpecification | identityrefSpecification | instanceIdentifierSpecification | bitsSpecification | unionSpecification; /** * numerical-restrictions = range-stmt stmtsep */ numericalRestrictions : rangeStatement; /** * range-stmt = range-keyword sep range-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [error-message-stmt stmtsep] * [error-app-tag-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ rangeStatement : RANGE_KEYWORD string (STMTEND | LEFT_CURLY_BRACE commonStatements RIGHT_CURLY_BRACE); commonStatements : errorMessageStatement? errorAppTagStatement? descriptionStatement? referenceStatement? | errorMessageStatement? errorAppTagStatement? referenceStatement? descriptionStatement? | errorMessageStatement? descriptionStatement? errorAppTagStatement? referenceStatement? | errorMessageStatement? descriptionStatement? referenceStatement? errorAppTagStatement? | errorMessageStatement? referenceStatement? errorAppTagStatement? descriptionStatement? | errorMessageStatement? referenceStatement? descriptionStatement? errorAppTagStatement? | errorAppTagStatement? errorMessageStatement? descriptionStatement? referenceStatement? | errorAppTagStatement? errorMessageStatement? referenceStatement? descriptionStatement? | errorAppTagStatement? descriptionStatement? descriptionStatement? errorMessageStatement? | errorAppTagStatement? descriptionStatement? errorMessageStatement? descriptionStatement? | errorAppTagStatement? referenceStatement? errorMessageStatement? descriptionStatement? | errorAppTagStatement? referenceStatement? descriptionStatement? errorMessageStatement? | descriptionStatement? errorMessageStatement? errorAppTagStatement? referenceStatement? | descriptionStatement? errorMessageStatement? referenceStatement? errorAppTagStatement? | descriptionStatement? errorAppTagStatement? errorMessageStatement? referenceStatement? | descriptionStatement? errorAppTagStatement? referenceStatement? errorMessageStatement? | descriptionStatement? referenceStatement? errorMessageStatement? errorAppTagStatement? | descriptionStatement? referenceStatement? errorAppTagStatement? errorMessageStatement? | referenceStatement? errorMessageStatement? descriptionStatement? errorAppTagStatement? | referenceStatement? errorMessageStatement? errorAppTagStatement? descriptionStatement? | referenceStatement? errorAppTagStatement? descriptionStatement? errorMessageStatement? | referenceStatement? errorAppTagStatement? errorMessageStatement? descriptionStatement? | referenceStatement? descriptionStatement? errorMessageStatement? errorAppTagStatement? | referenceStatement? descriptionStatement? errorAppTagStatement? errorMessageStatement? ; /** * string-restrictions = ;; these stmts can appear in any order * [length-stmt stmtsep] * *(pattern-stmt stmtsep) */ stringRestrictions : ((lengthStatement)? (patternStatement)*) | ((patternStatement)* (lengthStatement)?); /** * length-stmt = length-keyword sep length-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [error-message-stmt stmtsep] * [error-app-tag-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ lengthStatement : LENGTH_KEYWORD string (STMTEND | LEFT_CURLY_BRACE commonStatements RIGHT_CURLY_BRACE); /** * pattern-stmt = pattern-keyword sep string optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [error-message-stmt stmtsep] * [error-app-tag-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ patternStatement : PATTERN_KEYWORD string (STMTEND | LEFT_CURLY_BRACE commonStatements RIGHT_CURLY_BRACE); /** * default-stmt = default-keyword sep string stmtend */ defaultStatement : DEFAULT_KEYWORD string STMTEND; /** * enum-specification = 1*(enum-stmt stmtsep) */ enumSpecification : enumStatement+; /** * enum-stmt = enum-keyword sep string optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [value-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ enumStatement : ENUM_KEYWORD string (STMTEND | LEFT_CURLY_BRACE enumStatementBody RIGHT_CURLY_BRACE); enumStatementBody : valueStatement? statusStatement? descriptionStatement? referenceStatement? | valueStatement? statusStatement? referenceStatement? descriptionStatement? | valueStatement? descriptionStatement? statusStatement? referenceStatement? | valueStatement? descriptionStatement? referenceStatement? statusStatement? | valueStatement? referenceStatement? statusStatement? descriptionStatement? | valueStatement? referenceStatement? descriptionStatement? statusStatement? | statusStatement? valueStatement? descriptionStatement? referenceStatement? | statusStatement? valueStatement? referenceStatement? descriptionStatement? | statusStatement? descriptionStatement? descriptionStatement? valueStatement? | statusStatement? descriptionStatement? valueStatement? descriptionStatement? | statusStatement? referenceStatement? valueStatement? descriptionStatement? | statusStatement? referenceStatement? descriptionStatement? valueStatement? | descriptionStatement? valueStatement? statusStatement? referenceStatement? | descriptionStatement? valueStatement? referenceStatement? statusStatement? | descriptionStatement? statusStatement? valueStatement? referenceStatement? | descriptionStatement? statusStatement? referenceStatement? valueStatement? | descriptionStatement? referenceStatement? valueStatement? statusStatement? | descriptionStatement? referenceStatement? statusStatement? valueStatement? | referenceStatement? valueStatement? descriptionStatement? statusStatement? | referenceStatement? valueStatement? statusStatement? descriptionStatement? | referenceStatement? statusStatement? descriptionStatement? valueStatement? | referenceStatement? statusStatement? valueStatement? descriptionStatement? | referenceStatement? descriptionStatement? valueStatement? statusStatement? | referenceStatement? descriptionStatement? statusStatement? valueStatement? ; /** * leafref-specification = * ;; these stmts can appear in any order * path-stmt stmtsep * [require-instance-stmt stmtsep] */ leafrefSpecification : (pathStatement (requireInstanceStatement)?) | ((requireInstanceStatement)? pathStatement); /** * path-stmt = path-keyword sep path-arg-str stmtend */ pathStatement : PATH_KEYWORD string STMTEND; /** * require-instance-stmt = require-instance-keyword sep * require-instance-arg-str stmtend * require-instance-arg-str = < a string that matches the rule * require-instance-arg > * require-instance-arg = true-keyword / false-keyword */ requireInstanceStatement : REQUIRE_INSTANCE_KEYWORD (TRUE_KEYWORD | FALSE_KEYWORD) STMTEND; /** * instance-identifier-specification = * [require-instance-stmt stmtsep] */ instanceIdentifierSpecification : requireInstanceStatement?; /** * identityref-specification = * base-stmt stmtsep */ identityrefSpecification : baseStatement; /** * union-specification = 1*(type-stmt stmtsep) */ unionSpecification : typeStatement+; /** * bits-specification = 1*(bit-stmt stmtsep) */ bitsSpecification : bitStatement+; /** * bit-stmt = bit-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [position-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}" * "}") */ bitStatement : BIT_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE bitBodyStatement RIGHT_CURLY_BRACE); bitBodyStatement : positionStatement? statusStatement? descriptionStatement? referenceStatement? | positionStatement? statusStatement? referenceStatement? descriptionStatement? | positionStatement? descriptionStatement? statusStatement? referenceStatement? | positionStatement? descriptionStatement? referenceStatement? statusStatement? | positionStatement? referenceStatement? statusStatement? descriptionStatement? | positionStatement? referenceStatement? descriptionStatement? statusStatement? | statusStatement? positionStatement? descriptionStatement? referenceStatement? | statusStatement? positionStatement? referenceStatement? descriptionStatement? | statusStatement? descriptionStatement? descriptionStatement? positionStatement? | statusStatement? descriptionStatement? positionStatement? descriptionStatement? | statusStatement? referenceStatement? positionStatement? descriptionStatement? | statusStatement? referenceStatement? descriptionStatement? positionStatement? | descriptionStatement? positionStatement? statusStatement? referenceStatement? | descriptionStatement? positionStatement? referenceStatement? statusStatement? | descriptionStatement? statusStatement? positionStatement? referenceStatement? | descriptionStatement? statusStatement? referenceStatement? positionStatement? | descriptionStatement? referenceStatement? positionStatement? statusStatement? | descriptionStatement? referenceStatement? statusStatement? positionStatement? | referenceStatement? positionStatement? descriptionStatement? statusStatement? | referenceStatement? positionStatement? statusStatement? descriptionStatement? | referenceStatement? statusStatement? descriptionStatement? positionStatement? | referenceStatement? statusStatement? positionStatement? descriptionStatement? | referenceStatement? descriptionStatement? positionStatement? statusStatement? | referenceStatement? descriptionStatement? statusStatement? positionStatement? ; /** * position-stmt = position-keyword sep * position-value-arg-str stmtend * position-value-arg-str = < a string that matches the rule * position-value-arg > * position-value-arg = non-negative-integer-value */ positionStatement : POSITION_KEYWORD INTEGER STMTEND; /** * status-stmt = status-keyword sep status-arg-str stmtend * status-arg-str = < a string that matches the rule * status-arg > * status-arg = current-keyword / * obsolete-keyword / * deprecated-keyword */ statusStatement : STATUS_KEYWORD (CURRENT_KEYWORD | OBSOLETE_KEYWORD | DEPRECATED_KEYWORD) STMTEND; /** * config-stmt = config-keyword sep * config-arg-str stmtend * config-arg-str = < a string that matches the rule * config-arg > * config-arg = true-keyword / false-keyword */ configStatement : CONFIG_KEYWORD (TRUE_KEYWORD | FALSE_KEYWORD) STMTEND; /** * mandatory-stmt = mandatory-keyword sep * mandatory-arg-str stmtend * * mandatory-arg-str = < a string that matches the rule * mandatory-arg > * * mandatory-arg = true-keyword / false-keyword */ mandatoryStatement : MANDATORY_KEYWORD (TRUE_KEYWORD | FALSE_KEYWORD) STMTEND; /** * presence-stmt = presence-keyword sep string stmtend */ presenceStatement : PRESENCE_KEYWORD string STMTEND; /** * ordered-by-stmt = ordered-by-keyword sep * ordered-by-arg-str stmtend * * ordered-by-arg-str = < a string that matches the rule * ordered-by-arg > * * ordered-by-arg = user-keyword / system-keyword */ orderedByStatement : ORDERED_BY_KEYWORD (USER_KEYWORD | SYSTEM_KEYWORD) STMTEND; /** * must-stmt = must-keyword sep string optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [error-message-stmt stmtsep] * [error-app-tag-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") */ mustStatement : MUST_KEYWORD string (STMTEND | LEFT_CURLY_BRACE commonStatements RIGHT_CURLY_BRACE); /** * error-message-stmt = error-message-keyword sep string stmtend */ errorMessageStatement : ERROR_MESSAGE_KEYWORD string STMTEND; /** * error-app-tag-stmt = error-app-tag-keyword sep string stmtend */ errorAppTagStatement : ERROR_APP_TAG_KEYWORD string STMTEND; /** * min-elements-stmt = min-elements-keyword sep * min-value-arg-str stmtend * min-value-arg-str = < a string that matches the rule * min-value-arg > * min-value-arg = non-negative-integer-value */ minElementsStatement : MIN_ELEMENTS_KEYWORD INTEGER STMTEND; /** * max-elements-stmt = max-elements-keyword sep * max-value-arg-str stmtend * max-value-arg-str = < a string that matches the rule * max-value-arg > */ maxElementsStatement : MAX_ELEMENTS_KEYWORD maxValueArgument STMTEND; /** * max-value-arg = unbounded-keyword / * positive-integer-value */ maxValueArgument : UNBOUNDED_KEYWORD | INTEGER; /** * value-stmt = value-keyword sep integer-value stmtend */ valueStatement : VALUE_KEYWORD ((MINUS INTEGER) | INTEGER) STMTEND; /** * grouping-stmt = grouping-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *((typedef-stmt / * grouping-stmt) stmtsep) * *(data-def-stmt stmtsep) * "}") * TODO : 0..1 occurance to be checked in listener */ groupingStatement : GROUPING_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE (statusStatement | descriptionStatement | referenceStatement | typedefStatement | groupingStatement | dataDefStatement)* RIGHT_CURLY_BRACE); /** * container-stmt = container-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * *(must-stmt stmtsep) * [presence-stmt stmtsep] * [config-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *((typedef-stmt / * grouping-stmt) stmtsep) * *(data-def-stmt stmtsep) * "}") * TODO : 0..1 occurance to be checked in listener */ containerStatement : CONTAINER_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | mustStatement | presenceStatement | configStatement | statusStatement | descriptionStatement | referenceStatement | typedefStatement | groupingStatement | dataDefStatement)* RIGHT_CURLY_BRACE); /** * leaf-stmt = leaf-keyword sep identifier-arg-str optsep * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * type-stmt stmtsep * [units-stmt stmtsep] * *(must-stmt stmtsep) * [default-stmt stmtsep] * [config-stmt stmtsep] * [mandatory-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}" * TODO : 0..1 occurance to be checked in listener */ leafStatement : LEAF_KEYWORD IDENTIFIER LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | typeStatement | unitsStatement | mustStatement | defaultStatement | configStatement | mandatoryStatement | statusStatement | descriptionStatement | referenceStatement)* RIGHT_CURLY_BRACE; /** * leaf-list-stmt = leaf-list-keyword sep identifier-arg-str optsep * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * type-stmt stmtsep * [units-stmt stmtsep] * *(must-stmt stmtsep) * [config-stmt stmtsep] * [min-elements-stmt stmtsep] * [max-elements-stmt stmtsep] * [ordered-by-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}" * TODO : 0..1 occurance to be checked in listener */ leafListStatement : LEAF_LIST_KEYWORD IDENTIFIER LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | typeStatement | unitsStatement | mustStatement | configStatement | minElementsStatement | maxElementsStatement | orderedByStatement | statusStatement | descriptionStatement | referenceStatement)* RIGHT_CURLY_BRACE; /** * list-stmt = list-keyword sep identifier-arg-str optsep * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * *(must-stmt stmtsep) * [key-stmt stmtsep] * *(unique-stmt stmtsep) * [config-stmt stmtsep] * [min-elements-stmt stmtsep] * [max-elements-stmt stmtsep] * [ordered-by-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *((typedef-stmt / * grouping-stmt) stmtsep) * 1*(data-def-stmt stmtsep) * "}" * TODO : 0..1 occurance to be checked in listener */ listStatement : LIST_KEYWORD IDENTIFIER LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | mustStatement | keyStatement | uniqueStatement | configStatement | minElementsStatement | maxElementsStatement | orderedByStatement | statusStatement | descriptionStatement | referenceStatement | typedefStatement | groupingStatement| dataDefStatement)* RIGHT_CURLY_BRACE; /** * key-stmt = key-keyword sep key-arg-str stmtend */ keyStatement : KEY_KEYWORD string STMTEND; /** * unique-stmt = unique-keyword sep unique-arg-str stmtend */ uniqueStatement: UNIQUE_KEYWORD string STMTEND; /** * choice-stmt = choice-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * [default-stmt stmtsep] * [config-stmt stmtsep] * [mandatory-stmt stmtsep] * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *((short-case-stmt / case-stmt) stmtsep) * "}") * TODO : 0..1 occurance to be checked in listener */ choiceStatement : CHOICE_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | defaultStatement | configStatement | mandatoryStatement | statusStatement | descriptionStatement | referenceStatement | shortCaseStatement | caseStatement)* RIGHT_CURLY_BRACE); /** * short-case-stmt = container-stmt / * leaf-stmt / * leaf-list-stmt / * list-stmt / * anyxml-stmt */ shortCaseStatement : containerStatement | leafStatement | leafListStatement | listStatement; /** * case-stmt = case-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *(data-def-stmt stmtsep) * "}") * TODO : 0..1 occurance to be checked in listener */ caseStatement : CASE_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | statusStatement | descriptionStatement | referenceStatement | dataDefStatement)* RIGHT_CURLY_BRACE); /** * uses-stmt = uses-keyword sep identifier-ref-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *(refine-stmt stmtsep) * *(uses-augment-stmt stmtsep) * "}") * TODO : 0..1 occurance to be checked in listener */ usesStatement : USES_KEYWORD string (STMTEND | LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | statusStatement | descriptionStatement | referenceStatement | refineStatement | usesAugmentStatement)* RIGHT_CURLY_BRACE); /** * refine-stmt = refine-keyword sep refine-arg-str optsep * (";" / * "{" stmtsep * (refine-container-stmts / * refine-leaf-stmts / * refine-leaf-list-stmts / * refine-list-stmts / * refine-choice-stmts / * refine-case-stmts / * refine-anyxml-stmts) * "}") */ refineStatement : REFINE_KEYWORD string (STMTEND | LEFT_CURLY_BRACE (refineContainerStatements | refineLeafStatements | refineLeafListStatements | refineListStatements | refineChoiceStatements | refineCaseStatements) RIGHT_CURLY_BRACE); /** * refine-container-stmts = * ;; these stmts can appear in any order * *(must-stmt stmtsep) * [presence-stmt stmtsep] * [config-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * TODO : 0..1 occurance to be checked in listener */ refineContainerStatements : (mustStatement | presenceStatement | configStatement | descriptionStatement | referenceStatement)* ; /** * refine-leaf-stmts = ;; these stmts can appear in any order * *(must-stmt stmtsep) * [default-stmt stmtsep] * [config-stmt stmtsep] * [mandatory-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * TODO : 0..1 occurance to be checked in listener */ refineLeafStatements : (mustStatement | defaultStatement | configStatement | mandatoryStatement | descriptionStatement | referenceStatement)*; /** * refine-leaf-list-stmts = * ;; these stmts can appear in any order * *(must-stmt stmtsep) * [config-stmt stmtsep] * [min-elements-stmt stmtsep] * [max-elements-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * TODO : 0..1 occurance to be checked in listener */ refineLeafListStatements : (mustStatement | configStatement | minElementsStatement | maxElementsStatement | descriptionStatement | referenceStatement)*; /** * refine-list-stmts = ;; these stmts can appear in any order * *(must-stmt stmtsep) * [config-stmt stmtsep] * [min-elements-stmt stmtsep] * [max-elements-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * TODO : 0..1 occurance to be checked in listener */ refineListStatements : (mustStatement | configStatement | minElementsStatement | maxElementsStatement | descriptionStatement | referenceStatement)*; /** * refine-choice-stmts = ;; these stmts can appear in any order * [default-stmt stmtsep] * [config-stmt stmtsep] * [mandatory-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * TODO : 0..1 occurance to be checked in listener */ refineChoiceStatements : (defaultStatement | configStatement | mandatoryStatement | descriptionStatement | referenceStatement)*; /** * refine-case-stmts = ;; these stmts can appear in any order * [description-stmt stmtsep] * [reference-stmt stmtsep] * */ refineCaseStatements : (descriptionStatement | referenceStatement)? | (referenceStatement | descriptionStatement)?; /** * uses-augment-stmt = augment-keyword sep uses-augment-arg-str optsep * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * 1*((data-def-stmt stmtsep) / * (case-stmt stmtsep)) * "}" * TODO : 0..1 occurance to be checked in listener */ usesAugmentStatement : AUGMENT_KEYWORD string LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | statusStatement | descriptionStatement | referenceStatement | dataDefStatement | caseStatement)* RIGHT_CURLY_BRACE; /** * augment-stmt = augment-keyword sep augment-arg-str optsep * "{" stmtsep * ;; these stmts can appear in any order * [when-stmt stmtsep] * *(if-feature-stmt stmtsep) * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * 1*((data-def-stmt stmtsep) / * (case-stmt stmtsep)) * "}" * TODO : 0..1 occurance to be checked in listener */ augmentStatement : AUGMENT_KEYWORD string LEFT_CURLY_BRACE (whenStatement | ifFeatureStatement | statusStatement | descriptionStatement | referenceStatement | dataDefStatement | caseStatement)* RIGHT_CURLY_BRACE; /** * when-stmt = when-keyword sep string optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * [description-stmt stmtsep] * [reference-stmt stmtsep] * "}") * */ whenStatement : WHEN_KEYWORD string (STMTEND | LEFT_CURLY_BRACE ((descriptionStatement? referenceStatement?) | (referenceStatement? descriptionStatement?)) RIGHT_CURLY_BRACE); /** * rpc-stmt = rpc-keyword sep identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * *(if-feature-stmt stmtsep) * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *((typedef-stmt / * grouping-stmt) stmtsep) * [input-stmt stmtsep] * [output-stmt stmtsep] * "}") * TODO : 0..1 occurance to be checked in listener */ rpcStatement : RPC_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE (ifFeatureStatement | statusStatement | descriptionStatement | referenceStatement | typedefStatement | groupingStatement | inputStatement | outputStatement)* RIGHT_CURLY_BRACE); /** * input-stmt = input-keyword optsep * "{" stmtsep * ;; these stmts can appear in any order * *((typedef-stmt / * grouping-stmt) stmtsep) * 1*(data-def-stmt stmtsep) * "}" */ inputStatement : INPUT_KEYWORD LEFT_CURLY_BRACE ((typedefStatement | groupingStatement)* | dataDefStatement+) | (dataDefStatement+ | (typedefStatement | groupingStatement)*)RIGHT_CURLY_BRACE; /** * output-stmt = output-keyword optsep * "{" stmtsep * ;; these stmts can appear in any order * *((typedef-stmt / * grouping-stmt) stmtsep) * 1*(data-def-stmt stmtsep) * "}" */ outputStatement : OUTPUT_KEYWORD LEFT_CURLY_BRACE ((typedefStatement | groupingStatement)* | dataDefStatement+) | (dataDefStatement+ | (typedefStatement | groupingStatement)*)RIGHT_CURLY_BRACE; /** * notification-stmt = notification-keyword sep * identifier-arg-str optsep * (";" / * "{" stmtsep * ;; these stmts can appear in any order * *(if-feature-stmt stmtsep) * [status-stmt stmtsep] * [description-stmt stmtsep] * [reference-stmt stmtsep] * *((typedef-stmt / * grouping-stmt) stmtsep) * *(data-def-stmt stmtsep) * "}") * TODO : 0..1 occurance to be checked in listener */ notificationStatement : NOTIFICATION_KEYWORD IDENTIFIER (STMTEND | LEFT_CURLY_BRACE (ifFeatureStatement | statusStatement | descriptionStatement | referenceStatement | typedefStatement | groupingStatement | dataDefStatement)* RIGHT_CURLY_BRACE); /** * deviation-stmt = deviation-keyword sep * deviation-arg-str optsep * "{" stmtsep * ;; these stmts can appear in any order * [description-stmt stmtsep] * [reference-stmt stmtsep] * (deviate-not-supported-stmt / * 1*(deviate-add-stmt / * deviate-replace-stmt / * deviate-delete-stmt)) * "}" * TODO : 0..1 occurance to be checked in listener */ deviationStatement: DEVIATION_KEYWORD string LEFT_CURLY_BRACE (descriptionStatement | referenceStatement | deviateNotSupportedStatement | deviateAddStatement | deviateReplaceStatement | deviateDeleteStatement)* RIGHT_CURLY_BRACE; /** * deviate-not-supported-stmt = * deviate-keyword sep * not-supported-keyword optsep * (";" / * "{" stmtsep * "}") */ deviateNotSupportedStatement: DEVIATE_KEYWORD NOT_SUPPORTED_KEYWORD (STMTEND | LEFT_CURLY_BRACE RIGHT_CURLY_BRACE); /** * deviate-add-stmt = deviate-keyword sep add-keyword optsep * (";" / * "{" stmtsep * [units-stmt stmtsep] * *(must-stmt stmtsep) * *(unique-stmt stmtsep) * [default-stmt stmtsep] * [config-stmt stmtsep] * [mandatory-stmt stmtsep] * [min-elements-stmt stmtsep] * [max-elements-stmt stmtsep] * "}") */ deviateAddStatement: DEVIATE_KEYWORD ADD_KEYWORD (STMTEND | (LEFT_CURLY_BRACE unitsStatement? mustStatement* uniqueStatement* defaultStatement? configStatement? mandatoryStatement? minElementsStatement? maxElementsStatement? RIGHT_CURLY_BRACE)); /** * deviate-delete-stmt = deviate-keyword sep delete-keyword optsep * (";" / * "{" stmtsep * [units-stmt stmtsep] * *(must-stmt stmtsep) * *(unique-stmt stmtsep) * [default-stmt stmtsep] * "}") */ deviateDeleteStatement: DEVIATE_KEYWORD DELETE_KEYWORD (STMTEND | (LEFT_CURLY_BRACE unitsStatement? mustStatement* uniqueStatement* defaultStatement? RIGHT_CURLY_BRACE)); /** * deviate-replace-stmt = deviate-keyword sep replace-keyword optsep * (";" / * "{" stmtsep * [type-stmt stmtsep] * [units-stmt stmtsep] * [default-stmt stmtsep] * [config-stmt stmtsep] * [mandatory-stmt stmtsep] * [min-elements-stmt stmtsep] * [max-elements-stmt stmtsep] * "}") */ deviateReplaceStatement: DEVIATE_KEYWORD REPLACE_KEYWORD (STMTEND | (LEFT_CURLY_BRACE typeStatement? unitsStatement? defaultStatement? configStatement? mandatoryStatement? minElementsStatement? maxElementsStatement? RIGHT_CURLY_BRACE)); string : STRING (PLUS STRING)* | IDENTIFIER | INTEGER;
libsrc/z80_crt0s/8080/sccz80/l_cmpbcde.asm
jpoikela/z88dk
38
174200
SECTION code_crt0_sccz80 EXTERN l_cmpbcde ; {BC : DE} l_cmpbcde: ld a,e sub c ld a,d sbc b ret
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xa0.log_21829_1142.asm
ljhsiun2/medusa
9
103640
<reponame>ljhsiun2/medusa .global s_prepare_buffers s_prepare_buffers: push %r11 push %r14 push %r15 push %rax push %rcx push %rdi push %rdx push %rsi lea addresses_UC_ht+0x1ead5, %r15 nop cmp $38914, %rdi vmovups (%r15), %ymm0 vextracti128 $0, %ymm0, %xmm0 vpextrq $0, %xmm0, %rsi cmp $17209, %r14 lea addresses_UC_ht+0xdcb5, %rsi lea addresses_normal_ht+0x17c35, %rdi clflush (%rsi) and $61172, %r14 mov $127, %rcx rep movsw nop nop nop nop nop add %r15, %r15 lea addresses_WC_ht+0x1e935, %rdx nop nop nop nop xor %r11, %r11 mov (%rdx), %r14d nop nop nop nop nop dec %rdi lea addresses_WC_ht+0x235, %rcx nop nop nop sub $9085, %rdx mov $0x6162636465666768, %r15 movq %r15, %xmm6 movups %xmm6, (%rcx) nop nop nop nop nop add $37665, %rcx lea addresses_UC_ht+0xa935, %rcx nop nop nop and %rsi, %rsi movb (%rcx), %r11b nop nop nop nop xor $10952, %rdx lea addresses_WT_ht+0x19735, %rsi lea addresses_UC_ht+0x16635, %rdi nop nop nop nop dec %rax mov $68, %rcx rep movsw nop cmp $51501, %r14 lea addresses_UC_ht+0x4435, %rsi lea addresses_WC_ht+0x1777d, %rdi nop nop and %r15, %r15 mov $69, %rcx rep movsb and $60110, %rdi lea addresses_A_ht+0x1910d, %rsi nop mfence mov $0x6162636465666768, %r15 movq %r15, (%rsi) nop nop nop nop add $9546, %r14 lea addresses_A_ht+0x14835, %rsi lea addresses_D_ht+0xdde1, %rdi nop nop nop xor $14019, %rax mov $28, %rcx rep movsq nop sub $45764, %rdi pop %rsi pop %rdx pop %rdi pop %rcx pop %rax pop %r15 pop %r14 pop %r11 ret .global s_faulty_load s_faulty_load: push %r11 push %r12 push %r13 push %rax push %rbp // Faulty Load lea addresses_normal+0xc435, %r11 nop nop nop nop nop cmp %rax, %rax movups (%r11), %xmm1 vpextrq $1, %xmm1, %r13 lea oracles, %rax and $0xff, %r13 shlq $12, %r13 mov (%rax,%r13,1), %r13 pop %rbp pop %rax pop %r13 pop %r12 pop %r11 ret /* <gen_faulty_load> [REF] {'src': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_normal', 'AVXalign': False, 'size': 16}, 'OP': 'LOAD'} [Faulty Load] {'src': {'NT': False, 'same': True, 'congruent': 0, 'type': 'addresses_normal', 'AVXalign': False, 'size': 16}, 'OP': 'LOAD'} <gen_prepare_buffer> {'src': {'NT': False, 'same': False, 'congruent': 5, 'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 32}, 'OP': 'LOAD'} {'src': {'same': False, 'congruent': 7, 'type': 'addresses_UC_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 11, 'type': 'addresses_normal_ht'}} {'src': {'NT': False, 'same': False, 'congruent': 8, 'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 4}, 'OP': 'LOAD'} {'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 7, 'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 16}} {'src': {'NT': False, 'same': False, 'congruent': 8, 'type': 'addresses_UC_ht', 'AVXalign': True, 'size': 1}, 'OP': 'LOAD'} {'src': {'same': False, 'congruent': 8, 'type': 'addresses_WT_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 7, 'type': 'addresses_UC_ht'}} {'src': {'same': False, 'congruent': 11, 'type': 'addresses_UC_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 3, 'type': 'addresses_WC_ht'}} {'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 3, 'type': 'addresses_A_ht', 'AVXalign': False, 'size': 8}} {'src': {'same': False, 'congruent': 9, 'type': 'addresses_A_ht'}, 'OP': 'REPM', 'dst': {'same': True, 'congruent': 2, 'type': 'addresses_D_ht'}} {'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 */
programs/oeis/240/A240933.asm
karttu/loda
1
95374
<reponame>karttu/loda ; A240933: a(n) = n^10 - n^9. ; 0,0,512,39366,786432,7812500,50388480,242121642,939524096,3099363912,9000000000,23579476910,56757583872,127253992476,268593608192,538207031250,1030792151040,1897406023952,3372107936256,5808378560022,9728000000000,15885600931620,25352653573632 mov $1,$0 pow $0,9 sub $1,1 mul $1,$0
oeis/064/A064491.asm
neoneye/loda-programs
11
13056
<gh_stars>10-100 ; A064491: a(1) = 1, a(n+1) = a(n) + tau(a(n)), where tau(n) (A000005) is the number of divisors of n. ; Submitted by <NAME>(s2) ; 1,2,4,7,9,12,18,24,32,38,42,50,56,64,71,73,75,81,86,90,102,110,118,122,126,138,146,150,162,172,178,182,190,198,210,226,230,238,246,254,258,266,274,278,282,290,298,302,306,318,326,330,346,350,362,366,374,382,386,390,406,414,426,434,442,450,468,486,498,506,514,518,526,530,538,542,546,562,566,570,586,590,598,606,614,618,626,630,654,662,666,678,686,694,698,702,718,722,728,744 lpb $0 sub $0,1 seq $2,62249 ; a(n) = n + d(n), where d(n) = number of divisors of n, cf. A000005. sub $2,1 lpe mov $0,$2 add $0,1
src/wiki-streams-builders.adb
jquorning/ada-wiki
18
8400
----------------------------------------------------------------------- -- wiki-writers-builders -- Wiki writer to a string builder -- Copyright (C) 2011, 2012, 2013, 2015, 2016 <NAME> -- Written by <NAME> (<EMAIL>) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with GNAT.Encode_UTF8_String; package body Wiki.Streams.Builders is -- use Wiki.Strings; package WBS renames Wiki.Strings.Wide_Wide_Builders; -- ------------------------------ -- Write the content to the string builder. -- ------------------------------ overriding procedure Write (Stream : in out Output_Builder_Stream; Content : in Wiki.Strings.WString) is begin WBS.Append (Stream.Content, Content); end Write; -- ------------------------------ -- Write the content to the string builder. -- ------------------------------ overriding procedure Write (Stream : in out Output_Builder_Stream; Content : in Wiki.Strings.WChar) is begin WBS.Append (Stream.Content, Content); end Write; -- Write the string to the string builder. procedure Write_String (Stream : in out Output_Builder_Stream; Content : in String) is begin for I in Content'Range loop WBS.Append (Stream.Content, Wiki.Strings.To_WChar (Content (I))); end loop; end Write_String; -- ------------------------------ -- Iterate over the buffer content calling the <tt>Process</tt> procedure with each -- chunk. -- ------------------------------ procedure Iterate (Source : in Output_Builder_Stream; Process : not null access procedure (Chunk : in Wiki.Strings.WString)) is begin Strings.Wide_Wide_Builders.Iterate (Source.Content, Process); end Iterate; -- ------------------------------ -- Convert what was collected in the writer builder to a string and return it. -- ------------------------------ function To_String (Source : in Output_Builder_Stream) return String is procedure Convert (Chunk : in Wiki.Strings.WString); Pos : Natural := 1; Result : String (1 .. 5 * Strings.Wide_Wide_Builders.Length (Source.Content)); procedure Convert (Chunk : in Wiki.Strings.WString) is begin for I in Chunk'Range loop GNAT.Encode_UTF8_String.Encode_Wide_Wide_Character (Char => Chunk (I), Result => Result, Ptr => Pos); end loop; end Convert; begin Strings.Wide_Wide_Builders.Iterate (Source.Content, Convert'Access); return Result (1 .. Pos - 1); end To_String; end Wiki.Streams.Builders;
test/Compiler/simple/Issue2909-2.agda
alhassy/agda
7
8002
<filename>test/Compiler/simple/Issue2909-2.agda open import Agda.Builtin.Coinduction open import Agda.Builtin.IO open import Agda.Builtin.Unit data D : Set where c : ∞ D → D d : D d = c (♯ d) postulate seq : {A B : Set} → A → B → B return : {A : Set} → A → IO A {-# COMPILE GHC return = \_ -> return #-} {-# COMPILE GHC seq = \_ _ -> seq #-} main : IO ⊤ main = seq d (return tt)
programs/oeis/324/A324466.asm
neoneye/loda
22
85606
; A324466: Exponent of highest power of 2 that divides multinomial(3*n;n,n,n). ; 0,1,1,4,1,2,4,6,1,2,2,7,4,5,6,8,1,2,2,5,2,3,7,9,4,5,5,9,6,7,8,10,1,2,2,5,2,3,5,7,2,3,3,10,7,8,9,11,4,5,5,8,5,6,9,11,6,7,7,11,8,9,10,12,1,2,2,5,2,3,5,7,2,3,3,8,5,6,7,9,2,3,3,6,3,4,10,12,7,8,8,12,9,10,11,13,4,5,5,8 lpb $0 mul $0,3 lpb $0 mov $2,$0 div $0,2 mod $2,3 add $1,$2 lpe lpe mov $0,$1
src/main/antlr4/org/darioaxel/ANTLRPowerScript/basics/Comments.g4
darioaxel/Antlr4-PowerScript
6
4597
/** * Original Author: <NAME> * E-Mail: <EMAIL> */ grammar Comments; comments : ML_COMMENT | SL_COMMENT | STRING | CHAR | SPACE | OTHER ; ML_COMMENT : '/*' .* '*/' ; SL_COMMENT : '//' ~('\r' | '\n')* ; STRING : '"' (STR_ESC | ~('\\' | '"' | '\r' | '\n'))* '"' ; CHAR : '\'' (CH_ESC | ~('\\' | '\'' | '\r' | '\n')) '\'' ; SPACE : (' ' | '\t' | '\r' | '\n')+ ; OTHER : . // fall-through rule: matches any char if none of the above matched ; fragment STR_ESC : '\\' ('\\' | '"' | 't' | 'n' | 'r') // add more: Unicode esapes, ... ; fragment CH_ESC : '\\' ('\\' | '\'' | 't' | 'n' | 'r') // add more: Unicode esapes, Octal, ... ;
Transynther/x86/_processed/NC/_zr_/i3-7100_9_0xca_notsx.log_296_905.asm
ljhsiun2/medusa
9
23857
<gh_stars>1-10 .global s_prepare_buffers s_prepare_buffers: push %r10 push %r13 push %r8 push %rbx push %rcx push %rdi push %rsi lea addresses_A_ht+0x119ab, %rbx xor %r13, %r13 and $0xffffffffffffffc0, %rbx vmovaps (%rbx), %ymm6 vextracti128 $0, %ymm6, %xmm6 vpextrq $1, %xmm6, %rcx nop add %rdi, %rdi lea addresses_D_ht+0x15c8f, %rsi lea addresses_WT_ht+0xd2fd, %rdi nop nop nop nop inc %rbx mov $119, %rcx rep movsq nop lfence lea addresses_WT_ht+0xc67d, %r10 sub %r8, %r8 movl $0x61626364, (%r10) xor $20216, %r10 pop %rsi pop %rdi pop %rcx pop %rbx pop %r8 pop %r13 pop %r10 ret .global s_faulty_load s_faulty_load: push %r12 push %r8 push %rax push %rbp push %rbx push %rcx push %rsi // Store mov $0x13029a00000001db, %r8 nop nop and %rbx, %rbx movw $0x5152, (%r8) // Exception!!! nop nop nop nop nop mov (0), %r12 nop nop add $35096, %rsi // Store lea addresses_US+0x169f, %rsi nop nop nop nop cmp %rax, %rax movw $0x5152, (%rsi) nop nop nop add $57305, %rbx // Store lea addresses_WC+0x9adb, %rbp nop nop add %rcx, %rcx movl $0x51525354, (%rbp) xor $7142, %r12 // Store lea addresses_PSE+0xf7a3, %rsi nop nop xor $42815, %rbx movl $0x51525354, (%rsi) nop nop nop add %r12, %r12 // Faulty Load mov $0x2da4d10000000bdb, %r12 nop nop cmp $45490, %rsi movb (%r12), %al lea oracles, %rbp and $0xff, %rax shlq $12, %rax mov (%rbp,%rax,1), %rax pop %rsi pop %rcx pop %rbx pop %rbp pop %rax pop %r8 pop %r12 ret /* <gen_faulty_load> [REF] {'src': {'same': False, 'congruent': 0, 'NT': False, 'type': 'addresses_NC', 'size': 32, 'AVXalign': False}, 'OP': 'LOAD'} {'OP': 'STOR', 'dst': {'same': False, 'congruent': 7, 'NT': False, 'type': 'addresses_NC', 'size': 2, 'AVXalign': False}} {'OP': 'STOR', 'dst': {'same': False, 'congruent': 2, 'NT': False, 'type': 'addresses_US', 'size': 2, 'AVXalign': False}} {'OP': 'STOR', 'dst': {'same': False, 'congruent': 6, 'NT': False, 'type': 'addresses_WC', 'size': 4, 'AVXalign': False}} {'OP': 'STOR', 'dst': {'same': False, 'congruent': 3, 'NT': False, 'type': 'addresses_PSE', 'size': 4, 'AVXalign': False}} [Faulty Load] {'src': {'same': True, 'congruent': 0, 'NT': False, 'type': 'addresses_NC', 'size': 1, 'AVXalign': False}, 'OP': 'LOAD'} <gen_prepare_buffer> {'src': {'same': False, 'congruent': 3, 'NT': False, 'type': 'addresses_A_ht', 'size': 32, 'AVXalign': True}, 'OP': 'LOAD'} {'src': {'type': 'addresses_D_ht', 'congruent': 2, 'same': False}, 'OP': 'REPM', 'dst': {'type': 'addresses_WT_ht', 'congruent': 0, 'same': True}} {'OP': 'STOR', 'dst': {'same': False, 'congruent': 1, 'NT': False, 'type': 'addresses_WT_ht', 'size': 4, 'AVXalign': False}} {'00': 296} 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 */
programs/oeis/096/A096056.asm
karttu/loda
0
172902
; A096056: Duplicate of A050501. ; 3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,7,8,8,8,8,8,9,9,9,9,10,10,10,10 add $0,2 mov $2,$0 lpb $0,1 add $0,2 add $1,1 trn $2,2 trn $3,$2 sub $0,$3 trn $0,6 sub $2,$1 add $3,2 lpe add $1,2
Task/Multiplication-tables/Ada/multiplication-tables.ada
LaudateCorpus1/RosettaCodeData
1
7625
<filename>Task/Multiplication-tables/Ada/multiplication-tables.ada with Ada.Text_IO; use Ada.Text_IO; with Ada.Strings.Fixed; use Ada.Strings.Fixed; procedure Multiplication_Table is package IO is new Integer_IO (Integer); use IO; begin Put (" | "); for Row in 1..12 loop Put (Row, Width => 4); end loop; New_Line; Put_Line ("--+-" & 12 * 4 * '-'); for Row in 1..12 loop Put (Row, Width => 2); Put ("| "); for Column in 1..12 loop if Column < Row then Put (" "); else Put (Row * Column, Width => 4); end if; end loop; New_Line; end loop; end Multiplication_Table;
Cubical/Relation/Everything.agda
limemloh/cubical
0
7636
<filename>Cubical/Relation/Everything.agda<gh_stars>0 {-# OPTIONS --cubical --safe #-} module Cubical.Relation.Everything where open import Cubical.Relation.Nullary public open import Cubical.Relation.Nullary.DecidableEq public open import Cubical.Relation.Binary public
src/Categories/Category/Cocomplete/Finitely/Properties.agda
Trebor-Huang/agda-categories
279
13518
<reponame>Trebor-Huang/agda-categories {-# OPTIONS --without-K --safe #-} open import Categories.Category open import Categories.Category.Cocomplete.Finitely module Categories.Category.Cocomplete.Finitely.Properties {o ℓ e} {C : Category o ℓ e} (finite : FinitelyCocomplete C) where open import Categories.Category.Duality C private module C = Category C open C open import Categories.Category.Finite.Fin open import Categories.Category.Complete.Finitely C.op open import Categories.Category.Complete.Finitely.Properties (FinitelyCocomplete⇒coFinitelyComplete finite) open import Categories.Diagram.Colimit open import Categories.Diagram.Limit open import Categories.Diagram.Duality C open import Categories.Functor finiteColimit : (shape : FinCatShape) (F : Functor (FinCategory shape) C) → Colimit F finiteColimit shape F = coLimit⇒Colimit (finiteLimit shape.op F.op) where module shape = FinCatShape shape module F = Functor F
mips2.asm
bioelectromecha/assembly_mmn_12
0
98793
<filename>mips2.asm .data number: .space 10 # this is what I used for testing #number: .byte 1, 2, 3, 8, 5, 16, 255, 254, 248, 0 #number: .byte 1, 1,0, 1, 1, 0, 1, 1, 1, 0 #number: .byte 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 # messages to print div_by_x_message: .asciiz "\nthe numbers divisible by x are:\n" sum_message: .asciiz"\nthe sum of the array is:\n" diff_message: .asciiz"\nthe diffs are:\n" is_series_message: .asciiz "\nthe array is a series\nplease select which array element to print (integer from 50-100)\n" is_not_series_message: .asciiz "\nthe array is a not series" bad_input_message: .asciiz "input is not in right range - rerun" series_element_message: .asciiz "\nthe requested series element is:\n" .text main: # this is what I used for tests #la $a0, number #array address #li $a1, 10 # array size #li $a2, 10 # base #jal print_numbers_div_by_8_base_x_signed #jal print_numbers_div_by_4_base_x_unsigned #jal print_sum_of_numbers_signed #jal print_sum_of_numbers_unsigned #jal print_numbers_diff_signed # exit li $v0, 10 syscall # print the numbers divisible by 8 in base x signed # $a0 array address, $a1 array size, $a2 base print_numbers_div_by_8_base_x_signed: #set print parameters li $a3, 1 #signed li $v1, 8 #divisible by #save return address to memory addi $sp, $sp, -4 sw $ra, 0($sp) #print the numbers jal print_numbers_div_by_x #restore return address lw $ra, 0($sp) addi $sp, $sp, 4 jr $ra # print the numbers divisible by 4 in base x unsigned # $a0 array address, $a1 array size, $a2 base print_numbers_div_by_4_base_x_unsigned: li $a3, 0 #unsigned li $v1, 4 #divisible by #save return address to memory addi $sp, $sp, -4 sw $ra, 0($sp) #print the numbers jal print_numbers_div_by_x #restore return address lw $ra, 0($sp) addi $sp, $sp, 4 jr $ra # print sum of numbers signed in base x # $a0 array address, $a1 array size, $a2 base print_sum_of_numbers_signed: li $a3, 1 #signed #save return address to memory addi $sp, $sp, -4 sw $ra, 0($sp) #print the numbers jal print_sum_numbers #restore return address lw $ra, 0($sp) addi $sp, $sp, 4 jr $ra # print sum of numbers unsigned in base x # $a0 array address, $a1 array size, $a2 base print_sum_of_numbers_unsigned: li $a3, 0 #signed #save return address to memory addi $sp, $sp, -4 sw $ra, 0($sp) #print the numbers jal print_sum_numbers #restore return address lw $ra, 0($sp) addi $sp, $sp, 4 jr $ra print_sum_numbers: # print presentation message li $v0, 4 move $s0, $a0 #save la $a0, sum_message syscall move $a0, $s0 #restore #save the return address to the stack addi $sp, $sp, -4 sw $ra, 0($sp) #init counter li $t0, 0 li $s0, 0 loop2: beq $t0, $a1, exit_loop2 #increment the address la $t1, number add $t1, $t1, $t0 #increment the counter addi $t0, $t0, 1 # check if signed or unsigned beq $a3, 1, signed2 lbu $a0, 0($t1) #get the 8 bit unsigned integer addu $s0, $s0, $a0 j after_sign_check2 signed2: lb $a0, 0($t1) #get the 8 bit signed integer add $s0, $s0, $a0 after_sign_check2: j loop2 exit_loop2: # convert to the specified base jal save_my_regs move $a0, $s0 jal convert_to_base jal restore_my_regs move $a0, $v0 # print out the number, a0 already loaded li $v0, 1 syscall #restore return address lw $ra, 0($sp) addi $sp, $sp, 4 jr $ra # print the numbers divisible by x, signed or unsigned # a0 array address, a1 array size, a2 base, a3 signed(1)/unsigned(0), $v1 div by x print_numbers_div_by_x: # print presentation message li $v0, 4 move $s0, $a0 #save la $a0, div_by_x_message syscall move $a0, $s0 #restore #save the return address to the stack addi $sp, $sp, -4 sw $ra, 0($sp) li $t0, 0 loop1: beq $t0, $a1, exit_loop1 #increment the address la $t1, number add $t1, $t1, $t0 #increment the counter addi $t0, $t0, 1 # check if signed or unsigned beq $a3, 1, signed1 lbu $a0, 0($t1) #get the 8 bit unsigned integer j after_sign_check1 signed1: lb $a0, 0($t1) #get the 8 bit signed integer after_sign_check1: # check if divisible by 4 - continue to next number if not rem $t2, $a0, $v1 bne $t2, 0, loop1 # convert to the specified base jal save_my_regs jal convert_to_base jal restore_my_regs move $a0, $v0 # print out the number, a0 already loaded li $v0, 1 syscall #print space li $v0, 11 li $a0, ' ' syscall #loop j loop1 exit_loop1: #restore return address lw $ra, 0($sp) addi $sp, $sp, 4 jr $ra # print the difference between two consecutive numers # a0 array address, a1 array size, a2 base, a3 signed(1)/unsigned(0), $v1 div by x # at end of run $v1 =1 if series, $v1 = 0 o/w print_numbers_diff_signed: # print presentation message li $v0, 4 move $s0, $a0 #save la $a0, diff_message syscall move $a0, $s0 #restore #save the return address to the stack addi $sp, $sp, -4 sw $ra, 0($sp) li $t0, 0 subi $a1, $a1, 1 # there are l-1 diffs in an array of length l li $v1, 1 li $t3, 0 loop4: beq $t0, $a1, exit_loop4 #increment the counter addi $t0, $t0, 1 #increment the address la $t1, number add $t1, $t1, $t0 #get the 8 bit signed integers lb $a0, 0($t1) lb $t2, -1($t1) # get the second integer sub $a0, $a0, $t2 # calc the diff between them #check if series or first run beq $t3, $a0, still_series # check if previous diff equal to current dif beq $t0, 1, still_series # if first iteration, it's ok if not equal li $v1, 0 # it's not a series still_series: move $t3, $a0 # update the series diff # convert to the specified base jal save_my_regs jal convert_to_base jal restore_my_regs move $a0, $v0 # print out the number, a0 already loaded li $v0, 1 syscall #print space li $v0, 11 li $a0, ' ' syscall #loop j loop4 exit_loop4: # check if series or not beq $v1, 1, is_series #print is not series li $v0, 4 la $a0, is_not_series_message syscall j after_series_check # print is series is_series: li $v0, 4 la $a0, is_series_message syscall li $v0, 5 syscall # check input is in right range bgt $v0, 100, bad_input blt $v0, 50, bad_input move $s0, $v0 # save $v0 between prints # print the presentation message li $v0, 4 la $a0, series_element_message syscall # load the requested element addi $s0, $s0, -1 # the request is 1 based, we need to make it 0 based la $t0, number add $t0, $t0, $s0 # offset the address to correct spot lb $a0, 0($t0) # print the requested number li $v0, 1 syscall j after_series_check bad_input: li $v0, 4 la $a0, bad_input_message syscall j after_series_check after_series_check: #restore return address lw $ra, 0($sp) addi $sp, $sp, 4 jr $ra #save a0,a1,a2,t0,t1,t2 to memory save_my_regs: addi $sp, $sp, -24 # allocate stack segment sw $a0, 0($sp) sw $a1, 4($sp) sw $a2, 8($sp) sw $t0, 12($sp) sw $t1, 16($sp) sw $t2, 20($sp) jr $ra # restore a0,a1,a2,t0,t1,t2 from memory restore_my_regs: lw $a0, 0($sp) lw $a1, 4($sp) lw $a2, 8($sp) lw $t0, 12($sp) lw $t1, 16($sp) lw $t2, 20($sp) addi $sp, $sp, 24 # deallocate stack segment jr $ra #convert an integer to required base <=10 # $a0 is the input integer, $a2 required base, $v0 return number convert_to_base: move $t0, $a0 bgez $t0, after_negate1 #don't negate if non-negative xori $t0, $t0, -1 #flip bits add $t0, $t0, 1 # add 1 to to convert 1's complement to 2's complement after_negate1: li $t1, 1 li $v0, 0 loop3: div $t0, $a2 mflo $t0 # division quotient mfhi $t2 # division remainder mul $t2,$t2, $t1 #move the remainder to the right place mul $t1, $t1, 10 #increment the place mover add $v0, $v0, $t2 #add to the output number #quit when quotient equals zero beq $t0, 0, exit_loop3 j loop3 exit_loop3: bgez $a0, after_negate2 # don't negate if non-negative xori $v0, $v0, -1 add $v0, $v0, 1 after_negate2: jr $ra
Cubical/Data/Sum.agda
dan-iel-lee/cubical
0
7024
<reponame>dan-iel-lee/cubical {-# OPTIONS --cubical --no-import-sorts --safe #-} module Cubical.Data.Sum where open import Cubical.Data.Sum.Base public open import Cubical.Data.Sum.Properties public
src/main/resources/Examples/Directives/Data Directives.asm
jimw278/MIPS
3
10987
;these directives store some sort of data or leave space for it word: .word 1352255 ;creates a 32 bit integer in memory wordList: .word 1,0x2,3,0b100,5 ;creates a list of 32 bit integers in memory hword: .hword 0xFF ;creates a 16 bit integer in memory hwordList: .hword 4,3,2,1 ;creates a list of 16 bit integers in memory byte: .byte 0b10100110 ; creates a 8 bit integer in memory byteList: .byte 255,254,2,1 ;creates a list of 8 bit integers in memory space: .space 16 ;allocates N bytes of space in memory string .ascii "Hello World!" ;places the string Hello World! into memory as an array of chars(bytes) .byte 0 ;normally used to terminate a string
ugbc/src/hw/tms9918/cls_text.asm
spotlessmind1975/ugbasic
10
244602
<reponame>spotlessmind1975/ugbasic ; /***************************************************************************** ; * ugBASIC - an isomorphic BASIC language compiler for retrocomputers * ; ***************************************************************************** ; * Copyright 2021-2022 <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. ; *---------------------------------------------------------------------------- ; * Concesso in licenza secondo i termini della Licenza Apache, versione 2.0 ; * (la "Licenza"); è proibito usare questo file se non in conformità alla ; * Licenza. Una copia della Licenza è disponibile all'indirizzo: ; * ; * http://www.apache.org/licenses/LICENSE-2.0 ; * ; * Se non richiesto dalla legislazione vigente o concordato per iscritto, ; * il software distribuito nei termini della Licenza è distribuito ; * "COSì COM'è", SENZA GARANZIE O CONDIZIONI DI ALCUN TIPO, esplicite o ; * implicite. Consultare la Licenza per il testo specifico che regola le ; * autorizzazioni e le limitazioni previste dalla medesima. ; ****************************************************************************/ ;* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ;* * ;* CLEAR SCREEN ROUTINE FOR TMS9918 (text mode) * ;* * ;* by <NAME> * ;* * ;* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ; NAME COLOR PATTERN ; VDPUPDATE0: $0000 ; VDPUPDATE1: $0000 $0480 $0800 ; VDPUPDATE2: $3800 $2000 ; VDPUPDATE3: $3800 $2000 $0000 CLST: LD A, (CURRENTMODE) CP 0 JR Z,CLST0 CP 1 JR Z,CLST1 RET CLST0: LD A, (EMPTYTILE) LD BC, $100 + 40*24 LD DE, $0000 CALL VDPFILL RET CLST1: LD A, (EMPTYTILE) LD BC, $100 + 32*24 LD DE, $0000 CALL VDPFILL LD A, (_PAPER) LD BC, $100 + 32 LD DE, $0480 CALL VDPFILL RET
Data/List/Sorting.agda
Lolirofle/stuff-in-agda
6
929
<reponame>Lolirofle/stuff-in-agda import Lvl open import Data.Boolean open import Type module Data.List.Sorting {ℓ} {T : Type{ℓ}} (_≤?_ : T → T → Bool) where open import Functional using (_∘₂_) open import Data.Boolean.Stmt open import Data.List import Data.List.Relation.Pairwise open import Data.List.Relation.Permutation open import Logic open Data.List.Relation.Pairwise using (empty ; single ; step) public Sorted = Data.List.Relation.Pairwise.AdjacentlyPairwise(IsTrue ∘₂ (_≤?_)) -- A sorting algorithm is a function that given a list, always return a sorted list which is a permutation of the original one. record SortingAlgorithm (f : List(T) → List(T)) : Stmt{Lvl.𝐒(ℓ)} where constructor intro field ⦃ sorts ⦄ : ∀{l} → Sorted(f(l)) ⦃ permutes ⦄ : ∀{l} → (f(l) permutes l)
programs/oeis/089/A089887.asm
jmorken/loda
1
88408
<gh_stars>1-10 ; A089887: Number of subsets of {1,.., n} containing no squares. ; 1,2,4,4,8,16,32,64,64,128,256,512,1024,2048,4096,4096,8192,16384,32768,65536,131072,262144,524288,1048576,1048576,2097152,4194304,8388608,16777216,33554432,67108864,134217728,268435456 mov $1,2 pow $1,$0 lpb $0 sub $0,2 add $2,1 sub $0,$2 sub $0,$2 div $1,2 lpe
P5/P5_TestCode/P5_L1_testcase20/P5_L1_testcase20/mips20.asm
alxzzhou/BUAA_CO_2020
1
80126
<reponame>alxzzhou/BUAA_CO_2020 lui $t0 0xf65b ori $t1 $0 0xabfe ori $t2 $0 0x3000 lui $t3 0x49bf addu $t5 $t1 $t3 addu $t4 $t1 $t3 beq $t5 $t4 end #cal-beq subu $t6 $t2 $t3 ori $1 $0 4 subu $31 $31 $1 end: subu $t6 $t3 $t1 sw $t6 0($0) lw $s0 0($0) end1:lw $s1 0($0) beq $s0 $s1 end1 ori $s0 $s1 0x619f
itunes_stop.scpt
yantze/applescript-player-control
2
1123
<reponame>yantze/applescript-player-control tell application "iTunes" to stop
programs/oeis/162/A162254.asm
neoneye/loda
22
80066
; A162254: a(n) = (2*n^3 + 5*n^2 + n)/2. ; 4,19,51,106,190,309,469,676,936,1255,1639,2094,2626,3241,3945,4744,5644,6651,7771,9010,10374,11869,13501,15276,17200,19279,21519,23926,26506,29265,32209,35344,38676,42211,45955,49914,54094,58501,63141,68020,73144,78519,84151,90046,96210,102649,109369,116376,123676,131275,139179,147394,155926,164781,173965,183484,193344,203551,214111,225030,236314,247969,260001,272416,285220,298419,312019,326026,340446,355285,370549,386244,402376,418951,435975,453454,471394,489801,508681,528040,547884,568219,589051,610386,632230,654589,677469,700876,724816,749295,774319,799894,826026,852721,879985,907824,936244,965251,994851,1025050 mov $3,$0 add $0,1 add $3,4 lpb $0 sub $0,1 add $2,$3 add $1,$2 add $2,$3 sub $2,1 lpe mov $0,$1
source/web/tools/a2js/webapi/html/webapi-html-windows.ads
svn2github/matreshka
24
19220
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Web API Definition -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2014-2017, <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 WebAPI.DOM.Event_Targets; with WebAPI.HTML.Documents; with WebAPI.HTML.Frame_Request_Callbacks; package WebAPI.HTML.Windows is pragma Preelaborate; type Window is limited interface and WebAPI.DOM.Event_Targets.Event_Target; type Window_Access is access all Window'Class with Storage_Size => 0; not overriding function Get_Document (Self : not null access Window) return WebAPI.HTML.Documents.Document_Access is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "document"; -- APIs for creating and navigating browsing contexts by name not overriding function Open (Self : not null access WebAPI.HTML.Windows.Window; URL : WebAPI.DOM_String; Name : WebAPI.DOM_String; Features : WebAPI.DOM_String) return WebAPI.HTML.Windows.Window_Access is abstract with Import => True, Convention => JavaScript_Method, Link_Name => "open"; -- Opens a window to show url (defaults to about:blank), and returns it. -- The target argument gives the name of the new window. If a window -- exists with that name already, it is reused. The features argument -- can be used to influence the rendering of the new window. not overriding function Get_Name (Self : not null access Window) return WebAPI.DOM_String is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "name"; -- Returns the name of the window. Can be set, to change the name. not overriding procedure Set_Name (Self : not null access Window; Value : WebAPI.DOM_String) is abstract with Import => True, Convention => JavaScript_Property_Setter, Link_Name => "name"; not overriding procedure Close (Self : not null access WebAPI.HTML.Windows.Window) is abstract with Import => True, Convention => JavaScript_Method, Link_Name => "close"; -- Closes the window. not overriding function Get_Closed (Self : not null access Window) return WebAPI.DOM_Boolean is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "closed"; -- Returns true if the window has been closed, false otherwise. not overriding procedure Stop (Self : not null access WebAPI.HTML.Windows.Window) is abstract with Import => True, Convention => JavaScript_Method, Link_Name => "stop"; -- Cancels the document load. -- other browsing contexts not overriding function Get_Opener (Self : not null access Window) return WebAPI.HTML.Windows.Window_Access is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "opener"; -- The opener IDL attribute on the Window object, on getting, must return -- the WindowProxy object of the browsing context from which the current -- browsing context was created (its opener browsing context), if there is -- one, if it is still available, and if the current browsing context has -- not disowned its opener; otherwise, it must return null. not overriding procedure Set_Opener (Self : not null access Window; Value : WebAPI.HTML.Windows.Window_Access) is abstract with Import => True, Convention => JavaScript_Property_Setter, Link_Name => "opener"; -- On setting, if the new value is null then the current browsing context -- must disown its opener; function Request_Animation_Frame (Self : not null access Window'Class; Callback : not null access WebAPI.HTML.Frame_Request_Callbacks.Frame_Request_Callback'Class) return WebAPI.DOM_Long with Import => True, Convention => JavaScript_Function, Link_Name => "_ec._requestAnimationFrame"; procedure Request_Animation_Frame (Self : not null access Window'Class; Callback : not null access WebAPI.HTML.Frame_Request_Callbacks.Frame_Request_Callback'Class) with Import => True, Convention => JavaScript_Function, Link_Name => "_ec._requestAnimationFrame"; -- This subprogram is used to signal to the user agent that a script-based -- animation needs to be resampled. not overriding procedure Cancel_Animation_Frame (Self : not null access Window; Handle : WebAPI.DOM_Long) is abstract with Import => True, Convention => JavaScript_Method, Link_Name => "cancelAnimationFrame"; -- This subprogram is used to cancel a previously made request to schedule -- an animation frame update. ---------------------------------- -- CSSOM View Module extensions -- ---------------------------------- -- [NewObject] MediaQueryList matchMedia(DOMString query); -- [SameObject, Replaceable] readonly attribute Screen screen; -- -- // browsing context -- void moveTo(long x, long y); -- void moveBy(long x, long y); -- void resizeTo(long x, long y); -- void resizeBy(long x, long y); not overriding function Get_Inner_Width (Self : not null access Window) return WebAPI.DOM_Long is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "innerWidth"; not overriding function Get_Inner_Height (Self : not null access Window) return WebAPI.DOM_Long is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "innerHeight"; not overriding function Get_Scroll_X (Self : not null access Window) return WebAPI.DOM_Double is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "scrollX"; not overriding function Get_Page_X_Offset (Self : not null access Window) return WebAPI.DOM_Double is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "pageXOffset"; not overriding function Get_Scroll_Y (Self : not null access Window) return WebAPI.DOM_Double is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "scrollY"; not overriding function Get_Page_Y_Offset (Self : not null access Window) return WebAPI.DOM_Double is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "pageYOffset"; -- void scroll(optional ScrollToOptions options); -- void scroll(unrestricted double x, unrestricted double y); -- void scrollTo(optional ScrollToOptions options); -- void scrollTo(unrestricted double x, unrestricted double y); -- void scrollBy(optional ScrollToOptions options); -- void scrollBy(unrestricted double x, unrestricted double y); not overriding function Get_Screen_X (Self : not null access Window) return WebAPI.DOM_Long is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "screenX"; not overriding function Get_Screen_Y (Self : not null access Window) return WebAPI.DOM_Long is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "screenY"; not overriding function Get_Outer_Width (Self : not null access Window) return WebAPI.DOM_Long is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "outerWidth"; not overriding function Get_Outer_Height (Self : not null access Window) return WebAPI.DOM_Long is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "outerHeight"; not overriding function Get_Device_Pixel_Ratio (Self : not null access Window) return WebAPI.DOM_Double is abstract with Import => True, Convention => JavaScript_Property_Getter, Link_Name => "devicePixelRatio"; end WebAPI.HTML.Windows;
oeis/123/A123187.asm
neoneye/loda-programs
11
161913
<filename>oeis/123/A123187.asm ; A123187: Triangle of coefficients in expansion of (1+13x)^n. ; Submitted by <NAME>(s1) ; 1,1,13,1,26,169,1,39,507,2197,1,52,1014,8788,28561,1,65,1690,21970,142805,371293,1,78,2535,43940,428415,2227758,4826809,1,91,3549,76895,999635,7797153,33787663,62748517,1,104,4732,123032,1999270,20792408 lpb $0 add $1,1 sub $0,$1 lpe bin $1,$0 lpb $0 sub $0,1 mul $1,13 lpe mov $0,$1
alloy4fun_models/trashltl/models/9/FES87JgL2is3ogvsk.als
Kaixi26/org.alloytools.alloy
0
3301
<filename>alloy4fun_models/trashltl/models/9/FES87JgL2is3ogvsk.als open main pred idFES87JgL2is3ogvsk_prop10 { always all p:Protected | always p in Protected } pred __repair { idFES87JgL2is3ogvsk_prop10 } check __repair { idFES87JgL2is3ogvsk_prop10 <=> prop10o }
source/web/fastcgi/fastcgi-handlers-responder.ads
svn2github/matreshka
24
20909
<gh_stars>10-100 ------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2013, <NAME> <<EMAIL>> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with Ada.Streams; private with GNAT.Sockets; with FastCGI.Field_Names; with FastCGI.Field_Values; with Matreshka.FastCGI.Descriptors; package FastCGI.Handlers.Responder is type Abstract_Responder is abstract tagged limited private; type Responder_Access is access all Abstract_Responder'Class; -- Request interface not overriding procedure Start_Request (Self : in out Abstract_Responder) is null; not overriding procedure Meta_Variable (Self : in out Abstract_Responder; Name : FastCGI.Field_Names.Field_Name; Value : FastCGI.Field_Values.Field_Value) is null; not overriding procedure End_Meta_Variables (Self : in out Abstract_Responder) is null; not overriding procedure Stdin (Self : in out Abstract_Responder; Data : Ada.Streams.Stream_Element_Array) is null; not overriding procedure End_Stdin (Self : in out Abstract_Responder) is null; not overriding procedure End_Request (Self : in out Abstract_Responder; Status : out Integer) is abstract; -- Response interface procedure Header (Self : in out Abstract_Responder'Class; Name : FastCGI.Field_Names.Field_Name; Value : FastCGI.Field_Values.Field_Value); procedure End_Headers (Self : in out Abstract_Responder'Class); procedure Stdout (Self : in out Abstract_Responder'Class; Data : Ada.Streams.Stream_Element_Array); procedure Stderr (Self : in out Abstract_Responder'Class; Data : Ada.Streams.Stream_Element_Array); -- Supplementary operations -- function Is_Content_Length_Valid -- (Self : Abstract_Handler'Class) return Boolean; function To_Descriptor (Item : Responder_Access) return Matreshka.FastCGI.Descriptors.Descriptor_Access; private type Abstract_Responder is abstract new Matreshka.FastCGI.Descriptors.Abstract_Descriptor with null record; overriding procedure Internal_Begin_Request (Self : in out Abstract_Responder; Socket : GNAT.Sockets.Socket_Type; Request_Id : Matreshka.FastCGI.FCGI_Request_Identifier); overriding procedure Internal_Param (Self : in out Abstract_Responder; Name : FastCGI.Field_Names.Field_Name; Value : FastCGI.Field_Values.Field_Value); overriding procedure Internal_End_Params (Self : in out Abstract_Responder); overriding procedure Internal_Stdin (Self : in out Abstract_Responder; Buffer : Ada.Streams.Stream_Element_Array); end FastCGI.Handlers.Responder;
libsrc/_DEVELOPMENT/math/float/math32/c/sccz80/cm32_sccz80_fssqrt.asm
rjcorrig/z88dk
0
169358
; float __fssqrt (float number) SECTION code_clib SECTION code_math PUBLIC cm32_sccz80_fssqrt EXTERN m32_fssqrt_fastcall ; square root sccz80 float ; ; enter : stack = ret ; DEHL = sccz80_float number ; ; exit : DEHL = sccz80_float(number^0.5) ; ; uses : af, bc, de, hl, af', bc', de', hl' DEFC cm32_sccz80_fssqrt = m32_fssqrt_fastcall ; enter stack = ret ; DEHL = d32_float ; return DEHL = d32_float
wof/lcs/base/2FC.asm
zengfr/arcade_game_romhacking_sourcecode_top_secret_data
6
21418
<filename>wof/lcs/base/2FC.asm copyright zengfr site:http://github.com/zengfr/romhack 0013B8 beq $1442 [base+2FC] 0013C6 subq.w #1, ($2fc,A5) [base+2EA] 0013CA move.w #$8, ($2,A1) [base+2FC] 0014C2 addq.w #1, ($2fc,A5) [base+2EA] 0014C6 move.w #$6, D6 [base+2FC] 01A796 move.w A6, ($2ea,A5) [base+2FC] copyright zengfr site:http://github.com/zengfr/romhack
expr/src/main/antlr4/com/groupon/lex/metrics/timeseries/parser/PathMatcherLexer.g4
groupon/monsoon
32
1426
<reponame>groupon/monsoon<gh_stars>10-100 lexer grammar PathMatcherLexer; import MonsoonExprLexer;
antlr/xylang/xylang/Xy.g4
shawfing/xylang
1
317
<reponame>shawfing/xylang grammar Xy; program : statement+; statement :exportStatement; // 导出命名空间 exportStatement:Export nameSpace BlockLeft (exportSupportStatement)* BlockRight Terminate; // 导出命名空间支持的语句 exportSupportStatement: importStatement |packageStatement |protocolStatement |functionMainStatement ; // 导入命名空间 importStatement:Import BlockLeft (nameSpaceStatement)* BlockRight Terminate; // 主函数 functionMainStatement:Function BlockLeft (functionSupportStatement)* BlockRight Terminate; // 定义包 packageStatement:(annotation)? id (templateDefine)? Define Package Wave parameterClauseIn BlockLeft (packageSupportStatement)* BlockRight Terminate; // 包支持的语句 packageSupportStatement: packageStatement |packageVariableStatement |packageInitStatement |packageExtend |protocolStatement |protocolImplementStatement |packageFunctionStatement ; // 包构造方法 packageInitStatement:PackageSub BlockLeft (functionSupportStatement)* BlockRight Terminate; // 定义变量 packageVariableStatement:(annotation)? expression Define expression Terminate; // 函数 packageFunctionStatement:id (templateDefine)? Define t=(Function|FunctionAsync) parameterClauseIn Wave parameterClauseOut BlockLeft (functionSupportStatement)* BlockRight Terminate; // 定义引入 packageExtend: PackageSub nameSpace Terminate; // 协议 protocolStatement: id (templateDefine)? Define Protocol BlockLeft (protocolSupportStatement)* BlockRight Terminate; // 协议支持的语句 protocolSupportStatement: protocolStatement |protocolVariableStatement |protocolFunctionStatement ; // 定义变量 protocolVariableStatement:expression Define expression Terminate; // 函数 protocolFunctionStatement:id (templateDefine)? Define t=(Function|FunctionAsync) parameterClauseIn Wave parameterClauseOut BlockLeft (functionSupportStatement)* BlockRight Terminate; // 协议实现支持的语句 protocolImplementSupportStatement: implementVariableStatement |implementFunctionStatement ; // 实现协议 protocolImplementStatement:ProtocolSub nameSpace (templateCall)? BlockLeft (protocolImplementSupportStatement)* BlockRight Terminate; // 变量实现 implementVariableStatement:expression Define expression Terminate; // 函数实现 implementFunctionStatement:id (templateDefine)? Define t=(Function|FunctionAsync) parameterClauseIn Wave parameterClauseOut BlockLeft (functionSupportStatement)* BlockRight Terminate; // 函数 functionStatement:id (templateDefine)? Define t=(Function|FunctionAsync) parameterClauseIn Wave parameterClauseOut BlockLeft (functionSupportStatement)* BlockRight Terminate; // 返回 returnStatement: ArrowRight '(' (expressionList)? ')' Terminate; // 入参 parameterClauseIn : '(' parameter? (',' parameter)* ')' ; // 出参 parameterClauseOut : '(' parameter? (',' parameter)* ')' ; // 参数结构 parameter : id ':' type; // 检查 checkStatement: Check BlockLeft (functionSupportStatement)* BlockRight checkErrorStatement Terminate; // 错误处理 checkErrorStatement:Wave id BlockLeft (functionSupportStatement)* BlockRight; // 报告错误 reportStatement: CheckSub (expression)? Terminate; // 函数支持的语句 functionSupportStatement: returnStatement | variableStatement | judgeCaseStatement | judgeStatement | loopStatement | loopEachStatement | loopInfiniteStatement | assignStatement | expressionStatement | checkStatement | reportStatement | functionStatement ; logicStatement: returnStatement | variableStatement | judgeCaseStatement | judgeStatement | loopStatement | loopEachStatement | loopInfiniteStatement | loopJumpStatement | assignStatement | expressionStatement | checkStatement | reportStatement ; // 条件判断 judgeCaseStatement: Judge expression (caseStatement)+ Terminate; // 缺省条件声明 caseDefaultStatement: Wave Discard BlockLeft (logicStatement)* BlockRight; // 条件声明 caseExprStatement: Wave expression BlockLeft (logicStatement)* BlockRight; // 判断条件声明 caseStatement: caseDefaultStatement|caseExprStatement; // 判断 judgeStatement:(judgeBaseStatement)+ (judgeElseStatement)? Terminate; // 判断基础 judgeBaseStatement:Judge expression BlockLeft (logicStatement)* BlockRight; // else 判断 judgeElseStatement:JudgeSub BlockLeft (logicStatement)* BlockRight; // 循环 loopStatement:Loop iteratorStatement Wave id BlockLeft (logicStatement)* BlockRight Terminate; // 集合循环 loopEachStatement:Loop expression Wave id BlockLeft (logicStatement)* BlockRight Terminate; // 无限循环 loopInfiniteStatement:Loop BlockLeft (logicStatement)* BlockRight Terminate; // 跳出循环 loopJumpStatement:LoopSub Terminate; // 迭代器 iteratorStatement:expression '..' expression '..' expression | expression '..' expression; // 命名空间 nameSpaceStatement:nameSpace Terminate; // 定义变量 variableStatement: expression Define expression Terminate; // 赋值 assignStatement: expression assign expression Terminate; expressionStatement: expression Terminate; // 基础表达式 primaryExpression: id | t=Self | t=Discard | dataStatement | '(' expression ')' ; // 表达式 expression: primaryExpression | callFunc // 函数调用 | callPkg // 新建包 | callAwait // 异步调用 | array // 数组 | dictionary // 字典 | lambda // 匿名函数 | variableList // 变量列 | empty // 类型空初始化 | plusMinus // 正负处理 | negate // 取反 | expression as type // 类型转换 | expression is type // 类型判断 | expression readElement // 访问元素 | expression call expression // 链式调用 | expression judge expression // 判断型表达式 | expression add expression // 和型表达式 | expression mul expression // 积型表达式 ; expressionList : expression (',' expression)* ; // 表达式列 annotation: '\\*' expressionList '*\\'; // 注解 tuple : '(' (id ':' expression (',' id ':' expression)* )? ')'; // 元组 variableList : '(' expressionList ')' ; // 变量列 callFunc: id (templateCall)? tuple; // 函数调用 callPkg: type wave tuple; // 新建包 callAwait: FunctionAsync expression; // 异步调用 array : '[' (expression (',' expression)*)? ']'; // 数组 dictionary : '[' (dictionaryElement (',' dictionaryElement)*)? ']'; // 字典 dictionaryElement: expression ':' expression; // 字典元素 readElement : ('[' expression ']')+ ; nameSpace: id ('.' id)* ; templateDefine: '<' id (',' id)* '>'; templateCall: '<' type (',' type)* '>'; lambda : t=(Function|FunctionAsync) lambdaIn Wave lambdaOut; lambdaIn : '(' (id (',' id)* )? ')' ; lambdaOut : '(' (functionSupportStatement)* ')' ; empty : '~<' type '>'; // 类型空初始化 plusMinus : add expression; negate : '~~' expression; // 基础数据 dataStatement: t=Number | t=Text | t=True | t=False | t=Nil ; // 类型 type: typeProtocol | typeTuple | typeArray | typeDictinary | typeBasic | typePackage | typeFunction ; typeProtocol : Protocol nameSpace; typeTuple : '(' type (',' type)+ ')'; typeArray : '[' type ']' ; typeDictinary : '[' type ':' type ']'; typePackage : nameSpace (templateCall)? ; typeFunction : Function typeFunctionParameterClause Wave typeFunctionParameterClause; // 函数类型参数 typeFunctionParameterClause : '(' (id ':' type (',' id ':' type)* )? ')' ; // 基础类型名 typeBasic: t=TypeAny | t=TypeNumber | t=TypeText | t=TypeBool ; // bool值 bool:t=True|t=False; as : op='!:'; is : op='?:'; judge : op=('||' | '&&' | '==' | '!=' | '<' | '>'); assign : op=('=' | '+=' | '-=' | '*=' | '/=' | '%='); add : op=('+' | '-'); mul : op=('*' | '/' | '%'); call : op='.'; wave : op='~'; id: op=(IDPublic|IDPrivate) |typeBasic; Terminate : ';'; BlockLeft : '{'; BlockRight : '}'; Define : '=>'; Redefine: '<='; Import : '<:'; Export : ':>'; SelfSub : '~^'; Self : '^'; ArrowRight : '->'; ArrowLeft : '<-'; JudgeSub : '~?'; Judge : '?'; LoopSub : '~@'; Loop : '@'; CheckSub : '~!'; Check : '!'; FunctionAsync : '.$'; Function : '$'; PackageSub : '~#'; Package : '#'; ProtocolSub : '~&'; Protocol : '&'; Wave : '~'; TypeAny : 'any'; TypeNumber: 'number'; TypeText: 'text'; TypeBool: 'bool'; True: 'true'; False: 'false'; Nil : 'nil'; Number :DIGIT+ ('.' DIGIT+)?; // 数字 fragment DIGIT : [0-9] ; // 单个数字 Text: '"' (~[\\\r\n])*? '"'; // 文本 IDPrivate : '_' [a-zA-Z0-9]+; // 私有标识符 IDPublic : [a-zA-Z] [a-zA-Z0-9]*; // 公有标识符 Discard : '_'; // 匿名变量 Comment : '/*' .*? '*/' -> skip; // 结构注释 CommentLine : '//' .*? '\r'? '\n' -> skip; // 行注释 //WS : ' ' -> skip; WS : [ \t\r\n]+ -> skip; // 空白， 后面的->skip表示antlr4在分析语言的文本时，符合这个规则的词法将被无视
src/Leftovers/Junk.agda
JoeyEremondi/AgdaLeftovers
0
13748
{-# OPTIONS -v 2 #-} module Leftovers.Junk where open import Data.Bool open import Relation.Binary.PropositionalEquality id : ∀ {X : Set} → X → X id x = x the : ∀ X → X → X the X = id {X} badEq : let f = the (Bool -> Bool -> Bool) (λ x → λ {true → false ; false → true}) in f true ≡ f false badEq = {!!} -- refl does not typecheck goodEq : let f = the (Bool -> Bool -> Bool) (λ x → id λ {true → false ; false → true}) in f true ≡ f false goodEq = {!!}
DSPEditor/DSPAudioEffectsASM/AudioReverbEffect.asm
kamcio819/Audio-Editor
0
11838
.data delay_miliseconds dword 0 delay_samples dword 0 decay real8 0.0 sample_rate real8 44.1 temp_value real8 0.0 offset_value sword 0 tab_length dword 0 tab_begin_index dword 0 tab_end_index dword 0 loop_counter dword 0 const_value real8 8.0 .code reverb_init proc mov delay_miliseconds, ecx movsd decay, xmm1 xorps xmm1, xmm1 cvtsi2sd xmm1, ecx mulsd xmm1, sample_rate xor eax, eax cvttsd2si eax, xmm1 mov delay_samples, eax ret reverb_init endp reverb_process proc mov eax, edx mov tab_begin_index, eax mov eax, r8d mov tab_end_index, eax mov eax, tab_end_index sub eax, delay_samples mov tab_length, eax mov eax, tab_begin_index mov loop_counter, eax mov eax, delay_samples cvtsi2sd xmm2, eax xor rax, rax xorps xmm0, xmm0 xorps xmm1, xmm1 @processing_loop: mov eax, loop_counter movsd xmm0, qword ptr [rcx + rax * 8] addsd xmm0, xmm0 movsd qword ptr [rcx + rax * 8], xmm0 mulsd xmm0, decay cvtsi2sd xmm3, rax addsd xmm3, xmm2 mulsd xmm3, const_value cvttsd2si rax, xmm3 movsd xmm1, qword ptr [rcx + rax] addsd xmm1, xmm0 movsd qword ptr [rcx + rax], xmm1 add loop_counter, 1 mov eax, loop_counter cmp eax, tab_length je @end jmp @processing_loop @end: ret reverb_process endp end
oeis/010/A010671.asm
neoneye/loda-programs
11
166784
<gh_stars>10-100 ; A010671: Maximal size of binary code of length n correcting 4 unidirectional errors. ; Submitted by <NAME> ; 1,1,1,1,1,2,2,2,2,2,6,8 add $0,1 mov $3,$0 dif $0,$0 add $3,4 lpb $3 add $2,$3 lpb $2 mov $3,1 lpb $2 seq $0,6005 ; The odd prime numbers together with 1. mod $2,10 lpe bin $2,2 lpe lpe max $0,2 sub $0,1 mod $0,10
programs/oeis/177/A177151.asm
neoneye/loda
22
100409
; A177151: a(n) = least k such that 1 + 1/4 + 1/9 + ... + 1/k^2 exceeds (Pi^2)*(n-1)/(6*n). ; 1,1,2,2,3,4,4,5,5,6,7,7,8,9,9,10,10,11,12,12,13,13,14,15,15,16,16,17,18,18,19,19,20,21,21,22,22,23,24,24,25,26,26,27,27,28,29,29,30,30,31,32,32,33,33,34,35,35,36,36,37,38,38,39,40,40,41,41,42,43,43,44,44,45 mov $2,$0 mov $3,2 lpb $0 mov $0,1 mov $1,2 mov $3,31 mul $3,$2 add $3,5 div $3,51 lpe add $1,$3 sub $1,1 mov $0,$1
programs/oeis/275/A275324.asm
jmorken/loda
1
171345
; A275324: Expansion of (x*(1-4*x^2)^(-3/2) + (1-4*x^2)^(-1/2) + x + 1)/2. ; 1,1,1,3,3,15,10,70,35,315,126,1386,462,6006,1716,25740,6435,109395,24310,461890,92378,1939938,352716,8112468,1352078,33801950,5200300,140408100,20058300,581690700,77558760,2404321560,300540195,9917826435,1166803110,40838108850 mov $1,$0 div $1,2 mul $1,2 mov $2,2 mov $3,$0 bin $0,$1 mul $2,$0 mov $0,1 div $3,2 bin $1,$3 mul $1,$2 mov $4,4 lpb $0 sub $0,$4 add $1,$0 pow $0,$0 lpe div $1,4 add $1,1