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 |
|---|---|---|---|---|
org.kuse.payloadbuilder.core/src/main/resources/antlr4/org/kuse/payloadbuilder/core/parser/PayloadBuilderQuery.g4 | kuseman/payloadbuilder | 8 | 2033 | grammar PayloadBuilderQuery;
@lexer::header {
//CSOFF
//@formatter:off
}
@parser::header {
//CSOFF
//@formatter:off
}
query
: statements
EOF
;
statements
: (stms+=statement ';'?)+
;
statement
: miscStatement
| controlFlowStatement
| dmlStatement
| ddlStatement
;
miscStatement
: setStatement
| useStatement
| describeStatement
| analyzeStatement
| showStatement
| cacheFlushStatement
;
setStatement
: SET AT? qname EQUALS expression
;
useStatement
: USE qname (EQUALS expression)?
;
analyzeStatement
: ANALYZE selectStatement
;
describeStatement
: DESCRIBE
(
tableName
| selectStatement
)
;
showStatement
: SHOW
(
VARIABLES
| (catalog=identifier '#')? TABLES
| (catalog=identifier '#')? FUNCTIONS
| CACHES
)
;
cacheFlushStatement
: CACHE FLUSH type=identifier '/' (name=cacheName | all='*') key=expression? #cacheFlush
| CACHE REMOVE type=identifier '/' (name=cacheName | all='*') #cacheRemove
;
// Cannot use qname above, that causes some mismatched input in antlr
// don't know how to resolve
cacheName
: parts+=identifier ('.' parts+=identifier)*
;
controlFlowStatement
: ifStatement
| printStatement
;
ifStatement
: IF condition=expression THEN
stms=statements
(ELSE elseStatements=statements)?
END IF
;
printStatement
: PRINT expression
;
dmlStatement
: selectStatement
;
ddlStatement
: dropTableStatement
;
topSelect
: selectStatement EOF
;
selectStatement
: SELECT (TOP topCount)? selectItem (',' selectItem)*
(INTO into=tableName intoOptions=tableSourceOptions?)?
(FROM tableSourceJoined)?
(WHERE where=expression)?
(GROUPBY groupBy+=expression (',' groupBy+=expression)*)?
(ORDERBY sortItem (',' sortItem)*)?
(forClause)?
;
forClause
: FOR output=(OBJECT | ARRAY | OBJECT_ARRAY)
;
dropTableStatement
: DROP TABLE (IF EXISTS)? tableName
;
topCount
: NUMERIC_LITERAL
| '(' expression ')'
;
selectItem
:
(alias=identifier '.')? ASTERISK
| (variable EQUALS)? expression (AS? identifier)?
;
tableSourceJoined
: tableSource joinPart*
;
tableSource
: tableName identifier? tableSourceOptions?
| functionCall identifier? tableSourceOptions?
| PARENO selectStatement PARENC identifier? tableSourceOptions?
;
tableSourceOptions
: WITH '(' options+=tableSourceOption (',' options+=tableSourceOption)* ')'
;
tableSourceOption
: qname EQUALS expression
;
tableName
: (catalog=identifier '#')? qname
| tempHash='#' qname
;
joinPart
: (INNER | LEFT) JOIN tableSource ON expression
| (CROSS | OUTER) APPLY tableSource
;
sortItem
: expression order=(ASC | DESC)?
(NULLS nullOrder=(FIRST | LAST))?
;
// Expressions
topExpression
: expression EOF
;
expression
: primary #primaryExpression
//
| op=(MINUS | PLUS) expression #arithmeticUnary
| left=expression
op=(ASTERISK | SLASH | PERCENT | PLUS | MINUS)
right=expression #arithmeticBinary
| left=expression
op=(EQUALS | NOTEQUALS| LESSTHAN | LESSTHANEQUAL | GREATERTHAN| GREATERTHANEQUAL)
right=expression #comparisonExpression
//
| left=expression
NOT? IN
'(' expression (',' expression)* ')' #inExpression
| left=expression
// Have to use primary here to solve ambiguity when ie. nesting AND's
NOT? LIKE right=primary
(ESCAPE escape=expression)? #likeExpression
| expression IS NOT? NULL #nullPredicate
//
| NOT expression #logicalNot
| left=expression
op=(AND | OR)
right=expression #logicalBinary
;
primary
: literal #literalExpression
| left=primary '.' (identifier | functionCall) #dereference
| qname #columnReference
| functionCall #functionCallExpression
| identifier '->' expression #lambdaExpression
| '(' identifier (',' identifier)+ ')' '->' expression #lambdaExpression
| value=primary '[' subscript=expression ']' #subscript
| variable #variableExpression
| bracket_expression #bracketExpression
| CASE when+ (ELSE elseExpr=expression)? END #caseExpression
;
bracket_expression
: '(' expression ')'
| '(' selectStatement ')'
;
when
: WHEN condition=expression THEN result=expression
;
functionCall
: functionName '(' ( arguments+=functionArgument (',' arguments+=functionArgument)*)? ')'
;
functionArgument
: (name=identifier ':')? arguments+=expression
;
functionName
: (catalog=identifier '#')? function=identifier
;
literal
: NULL
| booleanLiteral
| numericLiteral
| decimalLiteral
| stringLiteral
;
variable
: '@' (system='@')? qname
;
compareOperator
: EQUALS
| NOTEQUALS
| LESSTHAN
| LESSTHANEQUAL
| GREATERTHAN
| GREATERTHANEQUAL
;
qname
: parts+=identifier ('.' parts+=identifier)*
;
identifier
: IDENTIFIER
| QUOTED_IDENTIFIER
| nonReserved
;
numericLiteral
: NUMERIC_LITERAL
;
decimalLiteral
: DECIMAL_LITERAL
;
stringLiteral
: STRING
;
booleanLiteral
: TRUE | FALSE
;
nonReserved
: FROM
| FIRST
| TABLE
| TABLES
| LIKE
| OBJECT
| ARRAY
| OBJECT_ARRAY
| FOR
| ALL
| CACHE
| FLUSH
| REMOVE
;
// Tokens
ALL : A L L;
AND : A N D;
ANALYZE : A N A L Y Z E;
ARRAY : A R R A Y;
AS : A S;
ASC : A S C;
APPLY : A P P L Y;
CACHE : C A C H E;
CACHES : C A C H E S;
CASE : C A S E;
CROSS : C R O S S;
DESC : D E S C;
DESCRIBE : D E S C R I B E;
DROP : D R O P;
ELSE : E L S E;
FLUSH : F L U S H;
END : E N D;
ESCAPE : E S C A P E;
EXISTS : E X I S T S;
FALSE : F A L S E;
FIRST : F I R S T;
FOR : F O R;
FROM : F R O M;
FUNCTIONS : F U N C T I O N S;
GROUPBY : G R O U P ' ' B Y;
HAVING : H A V I N G;
IF : I F;
IN : I N;
INNER : I N N E R;
INSERT : I N S E R T;
INTO : I N T O;
IS : I S;
JOIN : J O I N;
LAST : L A S T;
LEFT : L E F T;
LIKE : L I K E;
NOT : N O T;
NULL : N U L L;
NULLS : N U L L S;
OBJECT : O B J E C T;
OBJECT_ARRAY : O B J E C T '_' A R R A Y;
ON : O N;
OR : O R;
ORDERBY : O R D E R ' ' B Y;
OUTER : O U T E R;
PARAMETERS : P A R A M E T E R S;
PRINT : P R I N T;
REMOVE : R E M O V E;
SELECT : S E L E C T;
SESSION : S E S S I O N;
SET : S E T;
SHOW : S H O W;
TABLE : T A B L E;
TABLES : T A B L E S;
THEN : T H E N;
TOP : T O P;
TRUE : T R U E;
USE : U S E;
VARIABLES : V A R I A B L E S;
WHEN : W H E N;
WITH : W I T H;
WHERE : W H E R E;
ASTERISK : '*';
AT : '@';
COLON : ':';
EQUALS : '=';
EXCLAMATION : '!';
GREATERTHAN : '>';
GREATERTHANEQUAL : '>=';
LESSTHAN : '<';
LESSTHANEQUAL : '<=';
MINUS : '-';
NOTEQUALS : '!=';
PARENO : '(';
PARENC : ')';
PERCENT : '%';
PLUS : '+';
SLASH : '/';
// From java-grammar
NUMERIC_LITERAL
: ('0' | [1-9] (DIGITS? | '_'+ DIGITS)) [lL]?
;
// From java-grammar
DECIMAL_LITERAL
: (DIGITS '.' DIGITS? | '.' DIGITS) EXPONENTPART? [fFdD]?
| DIGITS (EXPONENTPART [fFdD]? | [fFdD])
;
STRING
: '\'' ( ~'\'' | '\'\'' )* '\''
;
IDENTIFIER
: (LETTER | '_') (LETTER | DIGIT | '_')*
;
QUOTED_IDENTIFIER
: '"' ( ~'"' | '""' )* '"'
;
LINE_COMMENT
: '--' ~[\r\n]* '\r'? '\n'? -> skip
;
BLOCK_COMMENT
: ( '//' ~[\r\n]* | '/*' .*? '*/' ) -> skip
;
SPACE
: [ \t\r\n\u000C] -> skip
;
fragment LETTER
: [A-Za-z]
;
fragment DIGIT
: [0-9]
;
fragment DIGITS
: [0-9] ([0-9_]* [0-9])?
;
fragment EXPONENTPART
: [eE] [+-]? DIGITS
;
fragment A : [aA];
fragment B : [bB];
fragment C : [cC];
fragment D : [dD];
fragment E : [eE];
fragment F : [fF];
fragment G : [gG];
fragment H : [hH];
fragment I : [iI];
fragment J : [jJ];
fragment K : [kK];
fragment L : [lL];
fragment M : [mM];
fragment N : [nN];
fragment O : [oO];
fragment P : [pP];
fragment Q : [qQ];
fragment R : [rR];
fragment S : [sS];
fragment T : [tT];
fragment U : [uU];
fragment V : [vV];
fragment W : [wW];
fragment X : [xX];
fragment Y : [yY];
fragment Z : [zZ];
|
oeis/342/A342629.asm | neoneye/loda-programs | 11 | 81632 | ; A342629: a(n) = Sum_{d|n} (n/d)^(n-d).
; Submitted by <NAME>
; 1,3,10,69,626,7866,117650,2101265,43047451,1000390658,25937424602,743069105634,23298085122482,793728614541474,29192926269590300,1152925902670135553,48661191875666868482,2185913413229070900339,104127350297911241532842,5242881000000153661633474,278218429448579962239889820,15519449643850883905134862322,907846434775996175406740561330,55572324587499171126078869661506,3552713678800500929450988769531251,236773830550768359251165677710072930,16423203268260737912674544673606539140
add $0,1
mov $2,$0
lpb $0
mov $3,$2
mov $5,$0
cmp $5,1
add $0,$5
dif $3,$0
mov $4,$3
cmp $3,$2
cmp $3,0
mul $3,$0
sub $0,1
pow $3,$4
pow $3,$0
add $1,$3
lpe
mov $0,$1
add $0,1
|
boards/stm32l151_Heltec/src/stm32-board.adb | morbos/Ada_Drivers_Library | 2 | 6656 | <reponame>morbos/Ada_Drivers_Library<gh_stars>1-10
with STM32.Setup;
with STM32_SVD.RCC; use STM32_SVD.RCC;
with STM32_SVD.DBGMCU; use STM32_SVD.DBGMCU;
package body STM32.Board is
---------------------
-- Initialize_LEDs --
---------------------
procedure Initialize_LEDs is
Configuration : GPIO_Port_Configuration;
begin
Enable_Clock (LED1);
Configuration.Mode := Mode_Out;
Configuration.Output_Type := Push_Pull;
Configuration.Speed := Speed_2MHz;
Configuration.Resistors := Floating;
Configure_IO (LED1,
Config => Configuration);
end Initialize_LEDs;
procedure Initialize_Board is
begin
-- Two steps here to enable the debugger in WFI
-- 1) Enable the DBGMCU regs.
-- RCC_Periph.APB2ENR.DBGEN := True;
-- 2) Allow debug in these 3 states
-- w/o this setting, a WFI is goodbye to your gdb session.
DBGMCU_Periph.CR :=
(DBG_SLEEP => True,
DBG_STOP => True,
DBG_STANDBY => True,
others => <>);
Initialize_LEDs;
end Initialize_Board;
end STM32.Board;
|
test/Succeed/Issue906WithoutK.agda | KDr2/agda | 0 | 17105 | <filename>test/Succeed/Issue906WithoutK.agda
{-# OPTIONS --cubical-compatible #-}
-- Andreas, 2020-02-07, instances of #906 needing --cubical-compatible to throw
-- off the termination checker.
module Issue906WithoutK where
module Issue3081 where
postulate
X : Set
P : (x : X) → Set
any : {X : Set} → X
record W : Set where
field
x : X
p : P x
record Category : Set₁ where
field
z : W
s : W → W
{- Termination checking failed for the following functions:
functor
Problematic calls:
W.x (functor .Category.s u)
W.x (functor .Category.z)
-}
functor : Category
functor .Category.z .W.x = any
functor .Category.z .W.p = any
functor .Category.s u .W.x = any
functor .Category.s u .W.p = any
module Issue3081Ulf where
open import Agda.Builtin.Nat
record R : Set where
field
a : Nat
b : Nat
record S : Set where
field
r : R -- works if we give r and h the same number of arguments
h : Nat → R
open R
open S
f : S
f .r .a = 0
f .r .b = f .r .a
f .h n .a = n
f .h n .b = f .h n .a
-- Should all pass the termination checker.
|
gfx/pokemon/lanturn/anim.asm | Dev727/ancientplatinum | 28 | 83811 | <reponame>Dev727/ancientplatinum
frame 1, 12
frame 2, 12
frame 3, 12
setrepeat 2
frame 0, 05
frame 4, 05
dorepeat 4
endanim
|
test/Succeed/Issue376-2.agda | shlevy/agda | 1,989 | 77 | <filename>test/Succeed/Issue376-2.agda
-- <NAME>, 2013-12-31
-- Testing eta-expansion of bound record metavars, as implemented by Andreas.
module Issue376-2 where
{- A simple example. -}
module example-0 {A B : Set} where
record Prod : Set where
constructor _,_
field
fst : A
snd : B
module _ (F : (Prod → Set) → Set) where
q : (∀ f → F f) → (∀ f → F f)
q h _ = h (λ {(a , b) → _})
{- A more complex, real-life-based example: the dependent
generalization of (A × B) × (C × D) ≃ (A × C) × (B × D). -}
module example-1 where
record Σ (A : Set) (B : A → Set) : Set where
constructor _,_
field
fst : A
snd : B fst
postulate
_≃_ : (A B : Set) → Set
Σ-interchange-Type =
(A : Set) (B C : A → Set) (D : (a : A) → B a → C a → Set)
→ Σ (Σ A B) (λ {(a , b) → Σ (C a) (λ c → D a b c)})
≃ Σ (Σ A C) (λ {(a , c) → Σ (B a) (λ b → D a b c)})
postulate
Σ-interchange : Σ-interchange-Type
{- Can the implicit arguments to Σ-interchange
be inferred from the global type? -}
Σ-interchange' : Σ-interchange-Type
Σ-interchange' A B C D = Σ-interchange _ _ _ _
|
assets/kernels/asm/interrupt.asm | Mati365/ts-c99-compiler-toolkit | 66 | 11974 | %macro mount_interrupt 2
; %1 - code
; %2 - handler
mov ax, %1
mov bx, 4
imul bx
mov bx, ax
xor cx, cx
mov es, cx
mov word [es:bx], %2
mov word [es:bx + 0x2], cs
%endmacro
; MAIN
jmp 0x7C0:main
main:
sti
mount_interrupt 0x0, div_by_zero_handler
mov ax, 6
mov bx, 0
idiv bx
hlt
div_by_zero_handler:
xchg bx, bx
iret
; At the end we need the boot sector signature.
times 510-($-$$) db 0
db 0x55
db 0xaa
|
learn-lex-yacc-antlr4/src/main/antlr4/io/github/learnlexyacc/antlr4/classic/ClassicCalc.g4 | mpuening/learn-lex-yacc | 2 | 4368 | <filename>learn-lex-yacc-antlr4/src/main/antlr4/io/github/learnlexyacc/antlr4/classic/ClassicCalc.g4
grammar ClassicCalc;
statement
: (variable ASSIGNMENT expression SEMI)+
;
variable
: VARIABLE
;
expression
: product (addOperation product)*
;
addOperation
: ADD
| SUBTRACT
;
product
: term (productOperation term)*
;
productOperation
: MULTIPLY
| DIVIDE
;
term
: NUMBER
| VARIABLE
| LPAREN expression RPAREN
;
SEMI
: ';'
;
LPAREN
: '('
;
RPAREN
: ')'
;
ADD
: '+'
;
SUBTRACT
: '-'
;
MULTIPLY
: '*'
;
DIVIDE
: '/'
;
ASSIGNMENT
: '='
;
NUMBER
: ('0' .. '9') + ('.' ('0' .. '9') +)?
;
VARIABLE
: ('a' .. 'z')+
;
WS
: [ \r\n\t] + -> skip
; |
libsrc/_DEVELOPMENT/adt/ba_priority_queue/c/sccz80/ba_priority_queue_pop.asm | jpoikela/z88dk | 640 | 92574 | <reponame>jpoikela/z88dk
; int ba_priority_queue_pop(ba_priority_queue_t *q)
SECTION code_clib
SECTION code_adt_ba_priority_queue
PUBLIC ba_priority_queue_pop
EXTERN asm_ba_priority_queue_pop
defc ba_priority_queue_pop = asm_ba_priority_queue_pop
; SDCC bridge for Classic
IF __CLASSIC
PUBLIC _ba_priority_queue_pop
defc _ba_priority_queue_pop = ba_priority_queue_pop
ENDIF
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xca_notsx.log_1207_858.asm | ljhsiun2/medusa | 9 | 179753 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r13
push %r8
push %rax
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_normal_ht+0xe81f, %rcx
nop
nop
nop
nop
cmp %rbp, %rbp
vmovups (%rcx), %ymm0
vextracti128 $1, %ymm0, %xmm0
vpextrq $0, %xmm0, %rbx
nop
nop
nop
nop
nop
add %rsi, %rsi
lea addresses_WT_ht+0x1601f, %rsi
lea addresses_WT_ht+0x189f, %rdi
clflush (%rsi)
nop
nop
nop
nop
nop
sub %rax, %rax
mov $39, %rcx
rep movsb
nop
nop
and %rbx, %rbx
lea addresses_WC_ht+0x7543, %rbx
nop
nop
nop
nop
nop
inc %r8
mov $0x6162636465666768, %rax
movq %rax, %xmm4
movups %xmm4, (%rbx)
nop
xor %rax, %rax
lea addresses_D_ht+0x511f, %rsi
lea addresses_WC_ht+0x1e1f, %rdi
clflush (%rdi)
nop
nop
nop
sub %r13, %r13
mov $28, %rcx
rep movsl
nop
nop
nop
nop
nop
sub %r13, %r13
lea addresses_UC_ht+0x1765f, %rsi
nop
nop
nop
xor $51411, %rbx
mov (%rsi), %di
nop
nop
nop
nop
cmp %r13, %r13
lea addresses_A_ht+0x1661f, %rsi
nop
nop
nop
nop
nop
and $58780, %rbx
movb $0x61, (%rsi)
nop
nop
nop
nop
nop
xor $31459, %rbx
lea addresses_D_ht+0x1739f, %rbp
nop
nop
nop
nop
inc %r8
mov $0x6162636465666768, %rdi
movq %rdi, (%rbp)
nop
nop
inc %rdi
lea addresses_A_ht+0x1787f, %rsi
and %r8, %r8
mov (%rsi), %r13w
nop
nop
nop
cmp $13166, %rcx
lea addresses_WC_ht+0x2eff, %rsi
lea addresses_WC_ht+0xa357, %rdi
clflush (%rdi)
nop
nop
dec %rbx
mov $9, %rcx
rep movsl
nop
nop
nop
nop
nop
cmp $30930, %rcx
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %rax
pop %r8
pop %r13
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r13
push %r14
push %r8
push %rbp
push %rdi
push %rsi
// Store
mov $0x7b2a8e0000000e2f, %rdi
nop
nop
nop
xor $541, %r14
movl $0x51525354, (%rdi)
nop
nop
nop
nop
add %r10, %r10
// Store
lea addresses_D+0x572f, %rdi
nop
nop
cmp $64615, %rsi
movl $0x51525354, (%rdi)
nop
nop
nop
nop
cmp $42038, %r10
// Faulty Load
lea addresses_PSE+0x1461f, %r13
nop
add $21529, %r8
movb (%r13), %r10b
lea oracles, %rsi
and $0xff, %r10
shlq $12, %r10
mov (%rsi,%r10,1), %r10
pop %rsi
pop %rdi
pop %rbp
pop %r8
pop %r14
pop %r13
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_PSE', 'NT': False, 'AVXalign': False, 'size': 8, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_NC', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 3}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_D', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 4}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'same': True, 'type': 'addresses_PSE', 'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_normal_ht', 'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 8}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 5, 'type': 'addresses_WT_ht'}, 'dst': {'same': True, 'congruent': 7, 'type': 'addresses_WT_ht'}}
{'OP': 'STOR', 'dst': {'same': True, 'type': 'addresses_WC_ht', 'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 2}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 7, 'type': 'addresses_D_ht'}, 'dst': {'same': False, 'congruent': 8, 'type': 'addresses_WC_ht'}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_UC_ht', 'NT': False, 'AVXalign': True, 'size': 2, 'congruent': 6}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_A_ht', 'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 11}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_D_ht', 'NT': False, 'AVXalign': True, 'size': 8, 'congruent': 6}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_A_ht', 'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 5}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 5, 'type': 'addresses_WC_ht'}, 'dst': {'same': False, 'congruent': 2, 'type': 'addresses_WC_ht'}}
{'33': 1207}
33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33 33
*/
|
programs/oeis/192/A192974.asm | neoneye/loda | 22 | 2728 | <gh_stars>10-100
; A192974: Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.
; 0,1,4,14,37,84,172,329,600,1058,1821,3080,5144,8513,13996,22902,37349,60764,98692,160105,259520,420426,680829,1102224,1784112,2887489,4672852,7561694,12236005,19799268,32036956,51838025,83876904,135716978,219596061,355315352,574913864,930231809,1505148412,2435383110,3940534565,6375920876,10316458804,16692383209,27008845712,43701232794,70710082557,114411319584,185121406560,299532730753,484654142116,784186877870,1268841025189,2053027908468,3321868939276,5374896853577,8696765798904,14071662658754,22768428464157,36840091129640,59608519600760,96448610737601,156057130345804,252505741091094,408562871444837,661068612544124,1069631483997412,1730700096550249,2800331580556640,4531031677116138,7331363257682301,11862394934808240,19193758192500624,31056153127319233,50249911319830516,81306064447160702,131555975767002469,212862040214174724,344418015981189052,557280056195375945,901698072176577480,1458978128371966226,2360676200548556829,3819654328920536504,6180330529469107112,9999984858389657729,16180315387858779292,26180300246248451814,42360615634107246245,68540915880355713548,110901531514462975636,179442447394818705385,290343978909281697584,469786426304100419898,760130405213382134781,1229916831517482572352,1990047236730864725184,3219964068248347315969,5210011304979212059972,8429975373227559395150
lpb $0
sub $0,1
seq $2,192973 ; Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.
add $1,$2
mov $2,$0
lpe
mov $0,$1
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/a/a95001c.ada | best08618/asylo | 7 | 6223 | -- A95001C.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 IF THE BOUNDS OF THE DISCRETE RANGE OF AN ENTRY FAMILY
-- ARE INTEGER LITERALS, NAMED NUMBERS, OR ATTRIBUTES HAVING TYPE
-- UNIVERSAL_INTEGER, BUT NOT EXPRESSIONS OF TYPE UNIVERSAL_INTEGER,
-- THE INDEX (IN AN ENTRY NAME OR ACCEPT STATEMENT) IS OF THE
-- PREDEFINED TYPE INTEGER.
-- WEI 3/4/82
-- RJK 2/1/84 ADDED TO ACVC
-- TBN 1/7/86 RENAMED FROM B950DHA-B.ADA. ADDED NAMED CONSTANTS
-- AND ATTRIBUTES AS KINDS OF BOUNDS, AND MADE TEST
-- EXECUTABLE.
-- RJW 4/11/86 RENAMED FROM C95001C-B.ADA.
WITH REPORT; USE REPORT;
PROCEDURE A95001C IS
SUBTYPE T IS INTEGER RANGE 1 .. 10;
I : INTEGER := 1;
NAMED_INT1 : CONSTANT := 1;
NAMED_INT2 : CONSTANT := 2;
TASK T1 IS
ENTRY E1 (1 .. 2);
ENTRY E2 (NAMED_INT1 .. NAMED_INT2);
ENTRY E3 (T'POS(1) .. T'POS(2));
END T1;
TASK BODY T1 IS
I_INT : INTEGER := 1;
I_POS : INTEGER := 2;
BEGIN
ACCEPT E1 (I_INT);
ACCEPT E2 (I_POS);
ACCEPT E3 (T'SUCC(1));
END T1;
BEGIN
TEST ("A95001C", "CHECK THAT IF THE BOUNDS OF THE DISCRETE " &
"RANGE OF AN ENTRY FAMILY ARE INTEGER " &
"LITERALS, NAMED NUMBERS, OR " &
"(UNIVERSAL_INTEGER) ATTRIBUTES, THE INDEX " &
"IS OF THE PREDEFINED TYPE INTEGER");
T1.E1 (I);
T1.E2 (NAMED_INT2);
T1.E3 (T'SUCC(I));
RESULT;
END A95001C;
|
programs/oeis/282/A282023.asm | neoneye/loda | 22 | 26615 | ; A282023: Start with 1; multiply alternately by 4 and 3.
; 1,4,12,48,144,576,1728,6912,20736,82944,248832,995328,2985984,11943936,35831808,143327232,429981696,1719926784,5159780352,20639121408,61917364224,247669456896,743008370688,2972033482752,8916100448256,35664401793024,106993205379072,427972821516288,1283918464548864,5135673858195456,15407021574586368,61628086298345472,184884258895036416,739537035580145664,2218611106740436992,8874444426961747968,26623333280885243904,106493333123540975616,319479999370622926848,1277919997482491707392,3833759992447475122176,15335039969789900488704,46005119909369701466112,184020479637478805864448,552061438912436417593344,2208245755649745670373376,6624737266949237011120128,26498949067796948044480512,79496847203390844133441536,317987388813563376533766144,953962166440690129601298432,3815848665762760518405193728,11447545997288281555215581184,45790183989153126220862324736,137370551967459378662586974208,549482207869837514650347896832,1648446623609512543951043690496,6593786494438050175804174761984,19781359483314150527412524285952,79125437933256602109650097143808,237376313799769806328950291431424,949505255199079225315801165725696,2848515765597237675947403497177088,11394063062388950703789613988708352,34182189187166852111368841966125056,136728756748667408445475367864500224,410186270246002225336426103593500672
mov $1,8
lpb $0
sub $0,1
gcd $2,2
add $2,2
mul $1,$2
sub $2,3
lpe
div $1,8
mov $0,$1
|
programs/oeis/301/A301718.asm | neoneye/loda | 22 | 177242 | <gh_stars>10-100
; A301718: Coordination sequence for node of type V2 in "kre" 2-D tiling (or net).
; 1,5,11,17,23,28,33,39,45,51,56,61,67,73,79,84,89,95,101,107,112,117,123,129,135,140,145,151,157,163,168,173,179,185,191,196,201,207,213,219,224,229,235,241,247,252,257,263,269,275,280,285,291,297,303,308,313,319,325,331,336,341,347,353,359,364,369,375,381,387,392,397,403,409,415,420,425,431,437,443,448,453,459,465,471,476,481,487,493,499,504,509,515,521,527,532,537,543,549,555
mov $3,2
mov $5,$0
lpb $3
mov $0,$5
sub $3,1
add $0,$3
trn $0,1
seq $0,301719 ; Partial sums of A301718.
mov $2,$3
mul $2,$0
add $1,$2
mov $4,$0
lpe
min $5,1
mul $5,$4
sub $1,$5
mov $0,$1
|
ada/euler6.adb | procrastiraptor/euler | 1 | 25822 | with Ada.Integer_Text_IO;
procedure Euler6 is
Sum_Of_Squares, Sum_Of_Ints: Integer := 0;
begin
for I in Integer range 1 .. 100 loop
Sum_Of_Squares := Sum_Of_Squares + I * I;
Sum_Of_Ints := Sum_Of_Ints + I;
end loop;
Ada.Integer_Text_IO.Put(Sum_Of_Ints * Sum_Of_Ints - Sum_Of_Squares);
end Euler6;
|
src/Hardware.asm | luca1337/Snake_ASM | 0 | 27109 | <reponame>luca1337/Snake_ASM<filename>src/Hardware.asm<gh_stars>0
;*
;* GBHW.INC - Gameboy Hardware definitions
;*
; Modified for GBC by <NAME> http://ladecadence.net
; If all of these are already defined, don't do it again.
IF !DEF(HARDWARE_INC)
HARDWARE_INC SET 1
rev_Check_hardware_inc: MACRO
;NOTE: REVISION NUMBER CHANGES MUST BE ADDED
;TO SECOND PARAMETER IN FOLLOWING LINE.
IF \1 > 1.1 ;PUT REVISION NUMBER HERE
WARN "Version \1 or later of 'gbhw.inc' is required."
ENDC
ENDM
_HW EQU $FF00
_VRAM EQU $8000 ; $8000->$A000
_SCRN0 EQU $9800 ; $9800->$9BFF
_SCRN1 EQU $9C00 ; $9C00->$9FFF
_SCRNMAX EQU $9FFF ; $9FFF->$8000
_RAM EQU $C000 ; $C000->$DFFF
_RAM_BNK1 EQU $D000 ; $D000->$DFFF (GBC)
_HRAM EQU $F800 ; $F800->$FFFE
_OAMRAM EQU $FE00 ; $FE00->$FE9F
_AUD3WAVERAM EQU $FF30 ; $FF30->$FF3F
; --
; -- OAM flags
; --
OAMF_PRI EQU %10000000 ; Priority
OAMF_YFLIP EQU %01000000 ; Y flip
OAMF_XFLIP EQU %00100000 ; X flip
OAMF_PAL0 EQU %00000000 ; Palette number; 0,1
OAMF_PAL1 EQU %00010000 ; Palette number; 0,1
;***************************************************************************
;*
;* Custom registers
;*
;***************************************************************************
; --
; -- P1 ($FF00)
; -- Register for reading joy pad info. (R/W)
; --
rP1 EQU $FF00
P1F_5 EQU %00100000 ; P15 out port
P1F_4 EQU %00010000 ; P14 out port
P1F_3 EQU %00001000 ; P13 in port
P1F_2 EQU %00000100 ; P12 in port
P1F_1 EQU %00000010 ; P11 in port
P1F_0 EQU %00000001 ; P10 in port
; --
; -- LCDC ($FF40)
; -- LCD Control (R/W)
; --
rLCDC EQU $FF40
LCDCF_OFF EQU %00000000 ; LCD Control Operation
LCDCF_ON EQU %10000000 ; LCD Control Operation
LCDCF_WIN9800 EQU %00000000 ; Window Tile Map Display Select
LCDCF_WIN9C00 EQU %01000000 ; Window Tile Map Display Select
LCDCF_WINOFF EQU %00000000 ; Window Display
LCDCF_WINON EQU %00100000 ; Window Display
LCDCF_BG8800 EQU %00000000 ; BG & Window Tile Data Select
LCDCF_BG8000 EQU %00010000 ; BG & Window Tile Data Select
LCDCF_BG9800 EQU %00000000 ; BG Tile Map Display Select
LCDCF_BG9C00 EQU %00001000 ; BG Tile Map Display Select
LCDCF_OBJ8 EQU %00000000 ; OBJ Construction
LCDCF_OBJ16 EQU %00000100 ; OBJ Construction
LCDCF_OBJOFF EQU %00000000 ; OBJ Display
LCDCF_OBJON EQU %00000010 ; OBJ Display
LCDCF_BGOFF EQU %00000000 ; BG Display
LCDCF_BGON EQU %00000001 ; BG Display
; "Window Character Data Select" follows BG
; --
; -- STAT ($FF41)
; -- LCDC Status (R/W)
; --
rSTAT EQU $FF41
STATF_LYC EQU %01000000 ; LYCEQULY Coincidence (Selectable)
STATF_MODE10 EQU %00100000 ; Mode 10
STATF_MODE01 EQU %00010000 ; Mode 01 (V-Blank)
STATF_MODE00 EQU %00001000 ; Mode 00 (H-Blank)
STATF_LYCF EQU %00000100 ; Coincidence Flag
STATF_HB EQU %00000000 ; H-Blank
STATF_VB EQU %00000001 ; V-Blank
STATF_OAM EQU %00000010 ; OAM-RAM is used by system
STATF_LCD EQU %00000011 ; Both OAM and VRAM used by system
STATF_BUSY EQU %00000010 ; When set, VRAM access is unsafe
; --
; -- SCY ($FF42)
; -- Scroll Y (R/W)
; --
rSCY EQU $FF42
; --
; -- SCY ($FF43)
; -- Scroll X (R/W)
; --
rSCX EQU $FF43
; --
; -- LY ($FF44)
; -- LCDC Y-Coordinate (R)
; --
; -- Values range from 0->153. 144->153 is the VBlank period.
; --
rLY EQU $FF44
; --
; -- LYC ($FF45)
; -- LY Compare (R/W)
; --
; -- When LYEQUEQULYC, STATF_LYCF will be set in STAT
; --
rLYC EQU $FF45
; --
; -- DMA ($FF46)
; -- DMA Transfer and Start Address (W)
; --
rDMA EQU $FF46
; --
; -- BGP ($FF47)
; -- BG Palette Data (W)
; --
; -- Bit 7-6 - Intensity for %11
; -- Bit 5-4 - Intensity for %10
; -- Bit 3-2 - Intensity for %01
; -- Bit 1-0 - Intensity for %00
; --
rBGP EQU $FF47
; --
; -- OBP0 ($FF48)
; -- Object Palette 0 Data (W)
; --
; -- See BGP for info
; --
rOBP0 EQU $FF48
; --
; -- OBP1 ($FF49)
; -- Object Palette 1 Data (W)
; --
; -- See BGP for info
; --
rOBP1 EQU $FF49
; --
; -- SB ($FF01)
; -- Serial Transfer Data (R/W)
; --
rSB EQU $FF01
; --
; -- SC ($FF02)
; -- Serial I/O Control (R/W)
; --
rSC EQU $FF02
; --
; -- DIV ($FF04)
; -- Divider register (R/W)
; --
rDIV EQU $FF04
; --
; -- TIMA ($FF05)
; -- Timer counter (R/W)
; --
rTIMA EQU $FF05
; --
; -- TMA ($FF06)
; -- Timer modulo (R/W)
; --
rTMA EQU $FF06
; --
; -- TAC ($FF07)
; -- Timer control (R/W)
; --
rTAC EQU $FF07
TACF_START EQU %00000100
TACF_STOP EQU %00000000
TACF_4KHZ EQU %00000000
TACF_16KHZ EQU %00000011
TACF_65KHZ EQU %00000010
TACF_262KHZ EQU %00000001
; --
; -- IF ($FF0F)
; -- Interrupt Flag (R/W)
; --
; -- IE ($FFFF)
; -- Interrupt Enable (R/W)
; --
rIF EQU $FF0F
rIE EQU $FFFF
IEF_HILO EQU %00010000 ; Transition from High to Low of Pin number P10-P13
IEF_SERIAL EQU %00001000 ; Serial I/O transfer end
IEF_TIMER EQU %00000100 ; Timer Overflow
IEF_LCDC EQU %00000010 ; LCDC (see STAT)
IEF_VBLANK EQU %00000001 ; V-Blank
; --
; -- WY ($FF4A)
; -- Window Y Position (R/W)
; --
; -- 0 <EQU WY <EQU 143
; --
rWY EQU $FF4A
; --
; -- WX ($FF4B)
; -- Window X Position (R/W)
; --
; -- 7 <EQU WX <EQU 166
; --
rWX EQU $FF4B
;***************************************************************************
;*
;* Sound control registers
;*
;***************************************************************************
; --
; -- AUDVOL/NR50 ($FF24)
; -- Channel control / ON-OFF / Volume (R/W)
; --
; -- Bit 7 - Vin->SO2 ON/OFF (Vin??)
; -- Bit 6-4 - SO2 output level (volume) (# 0-7)
; -- Bit 3 - Vin->SO1 ON/OFF (Vin??)
; -- Bit 2-0 - SO1 output level (volume) (# 0-7)
; --
rNR50 EQU $FF24
rAUDVOL EQU rNR50
; --
; -- AUDTERM/NR51 ($FF25)
; -- Selection of Sound output terminal (R/W)
; --
; -- Bit 7 - Output sound 4 to SO2 terminal
; -- Bit 6 - Output sound 3 to SO2 terminal
; -- Bit 5 - Output sound 2 to SO2 terminal
; -- Bit 4 - Output sound 1 to SO2 terminal
; -- Bit 3 - Output sound 4 to SO1 terminal
; -- Bit 2 - Output sound 3 to SO1 terminal
; -- Bit 1 - Output sound 2 to SO1 terminal
; -- Bit 0 - Output sound 0 to SO1 terminal
; --
rNR51 EQU $FF25
rAUDTERM EQU rNR51
; --
; -- AUDENA/NR52 ($FF26)
; -- Sound on/off (R/W)
; --
; -- Bit 7 - All sound on/off (sets all audio regs to 0!)
; -- Bit 3 - Sound 4 ON flag (doesn't work!)
; -- Bit 2 - Sound 3 ON flag (doesn't work!)
; -- Bit 1 - Sound 2 ON flag (doesn't work!)
; -- Bit 0 - Sound 1 ON flag (doesn't work!)
; --
rNR52 EQU $FF26
rAUDENA EQU rNR52
;***************************************************************************
;*
;* SoundChannel #1 registers
;*
;***************************************************************************
; --
; -- AUD1SWEEP/NR10 ($FF10)
; -- Sweep register (R/W)
; --
; -- Bit 6-4 - Sweep Time
; -- Bit 3 - Sweep Increase/Decrease
; -- 0: Addition (frequency increases???)
; -- 1: Subtraction (frequency increases???)
; -- Bit 2-0 - Number of sweep shift (# 0-7)
; -- Sweep Time: (n*7.8ms)
; --
rNR10 EQU $FF10
rAUD1SWEEP EQU rNR10
; --
; -- AUD1LEN/NR11 ($FF11)
; -- Sound length/Wave pattern duty (R/W)
; --
; -- Bit 7-6 - Wave Pattern Duty (00:12.5% 01:25% 10:50% 11:75%)
; -- Bit 5-0 - Sound length data (# 0-63)
; --
rNR11 EQU $FF11
rAUD1LEN EQU rNR11
; --
; -- AUD1ENV/NR12 ($FF12)
; -- Envelope (R/W)
; --
; -- Bit 7-4 - Initial value of envelope
; -- Bit 3 - Envelope UP/DOWN
; -- 0: Decrease
; -- 1: Range of increase
; -- Bit 2-0 - Number of envelope sweep (# 0-7)
; --
rNR12 EQU $FF12
rAUD1ENV EQU rNR12
; --
; -- AUD1LOW/NR13 ($FF13)
; -- Frequency lo (W)
; --
rNR13 EQU $FF13
rAUD1LOW EQU rNR13
; --
; -- AUD1HIGH/NR14 ($FF14)
; -- Frequency hi (W)
; --
; -- Bit 7 - Initial (when set, sound restarts)
; -- Bit 6 - Counter/consecutive selection
; -- Bit 2-0 - Frequency's higher 3 bits
; --
rNR14 EQU $FF14
rAUD1HIGH EQU rNR14
;***************************************************************************
;*
;* SoundChannel #2 registers
;*
;***************************************************************************
; --
; -- AUD2LEN/NR21 ($FF16)
; -- Sound Length; Wave Pattern Duty (R/W)
; --
; -- see AUD1LEN for info
; --
rNR21 EQU $FF16
rAUD2LEN EQU rNR21
; --
; -- AUD2ENV/NR22 ($FF17)
; -- Envelope (R/W)
; --
; -- see AUD1ENV for info
; --
rNR22 EQU $FF17
rAUD2ENV EQU rNR22
; --
; -- AUD2LOW/NR23 ($FF18)
; -- Frequency lo (W)
; --
rNR23 EQU $FF18
rAUD2LOW EQU rNR23
; --
; -- AUD2HIGH/NR24 ($FF19)
; -- Frequency hi (W)
; --
; -- see AUD1HIGH for info
; --
rNR24 EQU $FF19
rAUD2HIGH EQU rNR24
;***************************************************************************
;*
;* SoundChannel #3 registers
;*
;***************************************************************************
; --
; -- AUD3ENA/NR30 ($FF1A)
; -- Sound on/off (R/W)
; --
; -- Bit 7 - Sound ON/OFF (1EQUON,0EQUOFF)
; --
rNR30 EQU $FF1A
rAUD3ENA EQU rNR30
; --
; -- AUD3LEN/NR31 ($FF1B)
; -- Sound length (R/W)
; --
; -- Bit 7-0 - Sound length
; --
rNR31 EQU $FF1B
rAUD3LEN EQU rNR31
; --
; -- AUD3LEVEL/NR32 ($FF1C)
; -- Select output level
; --
; -- Bit 6-5 - Select output level
; -- 00: 0/1 (mute)
; -- 01: 1/1
; -- 10: 1/2
; -- 11: 1/4
; --
rNR32 EQU $FF1C
rAUD3LEVEL EQU rNR32
; --
; -- AUD3LOW/NR33 ($FF1D)
; -- Frequency lo (W)
; --
; -- see AUD1LOW for info
; --
rNR33 EQU $FF1D
rAUD3LOW EQU rNR33
; --
; -- AUD3HIGH/NR34 ($FF1E)
; -- Frequency hi (W)
; --
; -- see AUD1HIGH for info
; --
rNR34 EQU $FF1E
rAUD3HIGH EQU rNR34
; --
; -- AUD4LEN/NR41 ($FF20)
; -- Sound length (R/W)
; --
; -- Bit 5-0 - Sound length data (# 0-63)
; --
rNR41 EQU $FF20
rAUD4LEN EQU rNR41
; --
; -- AUD4ENV/NR42 ($FF21)
; -- Envelope (R/W)
; --
; -- see AUD1ENV for info
; --
rNR42 EQU $FF21
rAUD4ENV EQU rNR42
; --
; -- AUD4POLY/NR42 ($FF22)
; -- Polynomial counter (R/W)
; --
; -- Bit 7-4 - Selection of the shift clock frequency of the (scf)
; -- polynomial counter (0000-1101)
; -- freqEQUdrf*1/2^scf (not sure)
; -- Bit 3 - Selection of the polynomial counter's step
; -- 0: 15 steps
; -- 1: 7 steps
; -- Bit 2-0 - Selection of the dividing ratio of frequencies (drf)
; -- 000: f/4 001: f/8 010: f/16 011: f/24
; -- 100: f/32 101: f/40 110: f/48 111: f/56 (fEQU4.194304 Mhz)
; --
rNR42_2 EQU $FF22
rAUD4POLY EQU rNR42_2
; --
; -- AUD4GO/NR43 ($FF23)
; -- (has wrong name and value (ff30) in Dr.Pan's doc!)
; --
; -- Bit 7 - Inital
; -- Bit 6 - Counter/consecutive selection
; --
rNR43 EQU $FF23
rAUD4GO EQU rNR43 ; silly name!
;***************************************************************************
;*
;* Cart related
;*
;***************************************************************************
ROM_NOMBC EQU 0
ROM_MBC1 EQU 1
ROM_MBC1_RAM EQU 2
ROM_MBC1_RAM_BAT EQU 3
ROM_MBC2 EQU 5
ROM_MBC2_BAT EQU 6
ROM_NOMBC_RAM EQU 8
ROM_NOMBC_RAM_BAT EQU 9
ROM_SIZE_256KBIT EQU 0
ROM_SIZE_512KBIT EQU 1
ROM_SIZE_1M EQU 2
ROM_SIZE_2M EQU 3
ROM_SIZE_4M EQU 4
ROM_SIZE_8M EQU 5
ROM_SIZE_16M EQU 6
ROM_SIZE_32KBYTE EQU 0
ROM_SIZE_64KBYTE EQU 1
ROM_SIZE_128KBYTE EQU 2
ROM_SIZE_256KBYTE EQU 3
ROM_SIZE_512KBYTE EQU 4
ROM_SIZE_1MBYTE EQU 5
ROM_SIZE_2MBYTE EQU 6
RAM_SIZE_0KBIT EQU 0
RAM_SIZE_16KBIT EQU 1
RAM_SIZE_64KBIT EQU 2
RAM_SIZE_256KBIT EQU 3
RAM_SIZE_1MBIT EQU 4
RAM_SIZE_0KBYTE EQU 0
RAM_SIZE_2KBYTE EQU 1
RAM_SIZE_8KBYTE EQU 2
RAM_SIZE_32KBYTE EQU 3
RAM_SIZE_128KBYTE EQU 4
;***************************************************************************
;*
;* Keypad related
;*
;***************************************************************************
PADF_DOWN EQU $80
PADF_UP EQU $40
PADF_LEFT EQU $20
PADF_RIGHT EQU $10
PADF_START EQU $08
PADF_SELECT EQU $04
PADF_B EQU $02
PADF_A EQU $01
PADB_DOWN EQU $7
PADB_UP EQU $6
PADB_LEFT EQU $5
PADB_RIGHT EQU $4
PADB_START EQU $3
PADB_SELECT EQU $2
PADB_B EQU $1
PADB_A EQU $0
;***************************************************************************
;*
;* Screen related
;*
;***************************************************************************
SCRN_X EQU 160 ; Width of screen in pixels
SCRN_Y EQU 144 ; Height of screen in pixels
SCRN_X_B EQU 20 ; Width of screen in bytes
SCRN_Y_B EQU 18 ; Height of screen in bytes
SCRN_VX EQU 256 ; Virtual width of screen in pixels
SCRN_VY EQU 256 ; Virtual height of screen in pixels
SCRN_VX_B EQU 32 ; Virtual width of screen in bytes
SCRN_VY_B EQU 32 ; Virtual height of screen in bytes
;***************************************************************************
;*
;* GameBoy Color registers
;*
;***************************************************************************
; GB Color detection
; Read A register after boot, a == $11 = GBC
; B register, bit 0 == 0, GBC, bit 0 == 1, GBA
REGA_GBC EQU $11
REGB_GBA EQU %00000001
; Gameboy Clock Speed
; Bit 7: Current Speed (0=Normal, 1=Double) (Read Only)
; Bit 0: Prepare Speed Switch (0=No, 1=Prepare) (Read/Write)
;
; IF KEY1_BIT7 <> DESIRED_SPEED THEN
; IE=00H ;(FFFF)=00h
; JOYP=30H ;(FF00)=30h
; KEY1=01H ;(FF4D)=01h
; STOP ;STOP
; ENDIF
rKEY1 EQU $FF4D ; Gameboy Clock Switch
GBC_IS_NORMAL_CLK EQU %00000000 ; Normal Clock ?
GBC_IS_DOUBLE_CLK EQU %10000000 ; Double Clock ?
GBC_CHANGE_CLK EQU %00000001 ; Prepare clock change
; RAM Banks
rSVBK EQU $FF70 ; Set work ram bank
rOCPD EQU $FF6B ; object color palette data (R/W)
WRAM_BANK0 EQU %00000000 ; Bank 0
WRAM_BANK1 EQU %00000001 ; Bank 1
WRAM_BANK2 EQU %00000010 ; Bank 2
WRAM_BANK3 EQU %00000011 ; Bank 3
WRAM_BANK4 EQU %00000100 ; Bank 4
WRAM_BANK5 EQU %00000101 ; Bank 5
WRAM_BANK6 EQU %00000110 ; Bank 6
WRAM_BANK7 EQU %00000111 ; Bank 7
; Palettes
rBGPI EQU $FF68 ; Background Palette Index
rBGPD EQU $FF69 ; Backgorund Palette Data
rOBPI EQU $FF6A ; Sprite Palette Index
rOBPD EQU $FF6B ; Sprite Palette Data
; VRAM Banks
rVRBS EQU $FF4F ; VRAM Bank Select
VRB0 EQU $00 ; VRAM Bank 0
VRB1 EQU $01 ; VRAM Bank 1
; GB Color Map attributes (VRAM Bank 1)
;
; Bit 0-2 Background Palette number (BGP0-7)
; Bit 3 Tile VRAM Bank number (0=Bank 0, 1=Bank 1)
; Bit 4 Not used
; Bit 5 Horizontal Flip (0=Normal, 1=Mirror horizontally)
; Bit 6 Vertical Flip (0=Normal, 1=Mirror vertically)
; Bit 7 BG-to-OAM Priority (0=Use OAM priority bit, 1=BG Priority)
GBCMA_PAL0 EQU %00000000 ; Pallete 0
GBCMA_PAL1 EQU %00000001 ; Pallete 1
GBCMA_PAL2 EQU %00000010 ; Pallete 2
GBCMA_PAL3 EQU %00000011 ; Pallete 3
GBCMA_PAL4 EQU %00000100 ; Pallete 4
GBCMA_PAL5 EQU %00000101 ; Pallete 5
GBCMA_PAL6 EQU %00000110 ; Pallete 6
GBCMA_PAL7 EQU %00000111 ; Pallete 7
GBCMA_BNK0 EQU %00000000 ; Bank 0
GBCMA_BNK1 EQU %00001000 ; Bank 1
GBCMA_FLPH EQU %00100000 ; Flip Horizontally
GBCMA_FLPV EQU %01000000 ; Flip Vertically
GBCMA_BKGP EQU %10000000 ; Background Priority
; VRAM DMA
rDMA1 EQU $FF51 ; DMA Source High
rDMA2 EQU $FF52 ; DMA Source Low
rDMA3 EQU $FF53 ; DMA Destination High
rDMA4 EQU $FF54 ; DMA Destination Low
rDMA5 EQU $FF55 ; DMA Length-Mode-Start
GPDMA EQU %00000000 ; rDMA5 General Purpose DMA
HBDMA EQU %10000000 ; rDMA5 HBlank DMA
DMAAT EQU %00000000 ; DMA Active (rDMA5 bit 7 = 0)
; IR Port
; Bit 0: Write Data (0=LED Off, 1=LED On) (Read/Write)
; Bit 1: Read Data (0=Receiving IR Signal, 1=Normal) (Read Only)
; Bit 6-7: Data Read Enable (0=Disable, 3=Enable) (Read/Write)
rRP EQU $FF56 ; IR Port control
;; ROM HEADERS
NINTENDO_LOGO: MACRO
;*
;* Nintendo scrolling logo
;* (Code won't work on a real GameBoy)
;* (if next six lines are altered.)
DB $CE,$ED,$66,$66,$CC,$0D,$00,$0B,$03,$73,$00,$83,$00,$0C,$00,$0D
DB $00,$08,$11,$1F,$88,$89,$00,$0E,$DC,$CC,$6E,$E6,$DD,$DD,$D9,$99
DB $BB,$BB,$67,$63,$6E,$0E,$EC,$CC,$DD,$DC,$99,$9F,$BB,$B9,$33,$3E
ENDM
ROM_HEADER: MACRO
;*
;* Nintendo scrolling logo
;* (Code won't work on a real GameBoy)
;* (if next six lines are altered.)
; 0123456789ABCDEF
DB $CE,$ED,$66,$66,$CC,$0D,$00,$0B,$03,$73,$00,$83,$00,$0C,$00,$0D
DB $00,$08,$11,$1F,$88,$89,$00,$0E,$DC,$CC,$6E,$E6,$DD,$DD,$D9,$99
DB $BB,$BB,$67,$63,$6E,$0E,$EC,$CC,$DD,$DC,$99,$9F,$BB,$B9,$33,$3E
DB "EXAMPLE",0,0,0,0,0,0,0,0 ; Cart name - 15bytes
DB 0 ; $143
DB 0,0 ; $144 - Licensee code (not important)
DB 0 ; $146 - SGB Support indicator
DB \1 ; $147 - Cart type
DB \2 ; $148 - ROM Size
DB \3 ; $149 - RAM Size
DB 1 ; $14a - Destination code
DB $33 ; $14b - Old licensee code
DB 0 ; $14c - Mask ROM version
DB 0 ; $14d - Complement check (important)
DW 0 ; $14e - Checksum (not important)
ENDM
ROM_HEADER_COLOR: MACRO
;*
;* Nintendo scrolling logo
;* (Code won't work on a real GameBoy)
;* (if next six lines are altered.)
; 0123456789ABCDEF
DB $CE,$ED,$66,$66,$CC,$0D,$00,$0B,$03,$73,$00,$83,$00,$0C,$00,$0D
DB $00,$08,$11,$1F,$88,$89,$00,$0E,$DC,$CC,$6E,$E6,$DD,$DD,$D9,$99
DB $BB,$BB,$67,$63,$6E,$0E,$EC,$CC,$DD,$DC,$99,$9F,$BB,$B9,$33,$3E
DB "EXAMPLE",0,0,0,0,0,0,0,0 ; Cart name - 15bytes
DB $80 ; $143 - GB Color support
DB 0,0 ; $144 - Licensee code (not important)
DB 0 ; $146 - SGB Support indicator
DB \1 ; $147 - Cart type
DB \2 ; $148 - ROM Size
DB \3 ; $149 - RAM Size
DB 1 ; $14a - Destination code
DB $33 ; $14b - Old licensee code
DB 0 ; $14c - Mask ROM version
DB 0 ; $14d - Complement check (important)
DW 0 ; $14e - Checksum (not important)
ENDM
ENDC ;HARDWARE_INC
|
src/brackelib-queues.adb | bracke/brackelib | 1 | 14110 | package body Brackelib.Queues is
procedure Enqueue (Self : in out Queue; Item : T) is
begin
Self.Container.Append (Item);
end Enqueue;
function Dequeue (Self : in out Queue) return T is
Result: T;
begin
if Is_Empty (Self) then
raise Queue_Empty;
end if;
Result := Last_Element (Self.Container);
Delete_Last (Self.Container);
return Result;
end Dequeue;
function Size (Self : Queue) return Integer is
begin
return Natural (Length (Self.Container));
end Size;
function Is_Empty (Self : Queue) return Boolean is
begin
return Size(Self) = 0;
end Is_Empty;
procedure Clear (Self : in out Queue) is
begin
Self.Container.Clear;
end Clear;
end Brackelib.Queues; |
programs/oeis/235/A235537.asm | neoneye/loda | 22 | 161735 | <reponame>neoneye/loda<filename>programs/oeis/235/A235537.asm
; A235537: Expansion of (6 + 13*x - 8*x^2 - 8*x^3 + 6*x^4)/((1 + x)^2*(1 - x)^3).
; 6,19,23,41,49,72,84,112,128,161,181,219,243,286,314,362,394,447,483,541,581,644,688,756,804,877,929,1007,1063,1146,1206,1294,1358,1451,1519,1617,1689,1792,1868,1976,2056,2169,2253,2371,2459,2582,2674,2802,2898,3031,3131,3269,3373,3516,3624,3772,3884,4037,4153,4311,4431,4594,4718,4886,5014,5187,5319,5497,5633,5816,5956,6144,6288,6481,6629,6827,6979,7182,7338,7546,7706,7919,8083,8301,8469,8692,8864,9092,9268,9501,9681,9919,10103,10346,10534,10782,10974,11227,11423,11681
mul $0,2
mov $1,1
mov $2,$0
add $2,5
lpb $0
add $1,$0
sub $0,1
trn $0,3
add $1,$2
add $1,4
sub $2,3
lpe
add $1,5
mov $0,$1
|
oeis/270/A270230.asm | neoneye/loda-programs | 11 | 162211 | ; A270230: Decimal expansion of 3/(4*Pi).
; Submitted by <NAME>(w1)
; 2,3,8,7,3,2,4,1,4,6,3,7,8,4,3,0,0,3,6,5,3,3,2,5,6,4,5,0,5,8,7,7,1,5,4,3,0,5,1,6,8,9,4,6,8,6,1,0,6,8,4,6,7,3,1,2,1,5,0,1,0,1,6,0,8,8,3,4,5,1,9,6,4,5,1,3,3,9,8,0,2,6,3,5,1,7,0,7,0,4,1,4,9,3,7,9,6,2,8,9
add $0,1
mov $3,$0
mul $3,4
lpb $3
mul $1,$3
mul $2,2
sub $2,1
mov $5,$3
mul $5,2
add $5,1
mul $2,$5
add $1,$2
div $1,$0
mul $1,2
div $2,$0
sub $3,1
lpe
mul $1,4
mul $2,$5
sub $1,$2
add $2,$1
mov $4,10
pow $4,$0
div $2,$4
div $1,$2
sub $4,$1
mov $0,$4
sub $0,1
mod $0,10
|
Agda/Ag13.agda | Brethland/LEARNING-STUFF | 2 | 3897 | <gh_stars>1-10
module Ag13 where
import Relation.Binary.PropositionalEquality as Eq
open Eq using (_≡_; refl)
open Eq.≡-Reasoning
open import Data.Nat using (ℕ; zero; suc)
open import Data.Product using (_×_) renaming (_,_ to ⟨_,_⟩)
open import Data.Sum using (_⊎_; inj₁; inj₂)
open import Relation.Nullary using (¬_)
open import Relation.Nullary.Negation using ()
renaming (contradiction to ¬¬-intro)
open import Data.Unit using (⊤; tt)
open import Data.Empty using (⊥; ⊥-elim)
open import Ag09 using (_⇔_)
data Bool : Set where
true : Bool
false : Bool
T : Bool → Set
T true = ⊤
T false = ⊥
T→≡ : ∀ (b : Bool) → T b → b ≡ true
T→≡ true tt = refl
T→≡ false ()
≡→T : ∀ {b : Bool} → b ≡ true → T b
≡→T refl = tt
data Dec (A : Set) : Set where
yes : A → Dec A
no : ¬ A → Dec A
infix 4 _≤_
data _≤_ : ℕ → ℕ → Set where
z≤n : ∀ {n : ℕ}
--------
→ zero ≤ n
s≤s : ∀ {m n : ℕ}
→ m ≤ n
-------------
→ suc m ≤ suc n
¬s≤z : ∀ {m : ℕ} → ¬ (suc m ≤ zero)
¬s≤z ()
¬s≤s : ∀ {m n : ℕ} → ¬ (m ≤ n) → ¬ (suc m ≤ suc n)
¬s≤s ¬m≤n (s≤s m≤n) = ¬m≤n m≤n
_≤?_ : ∀ (m n : ℕ) → Dec (m ≤ n)
zero ≤? n = yes z≤n
suc m ≤? zero = no ¬s≤z
suc m ≤? suc n with m ≤? n
... | yes m≤n = yes (s≤s m≤n)
... | no ¬m≤n = no (¬s≤s ¬m≤n)
|
plugin/idea/transformer/res/Args.g4 | d-kozak/ingrid | 3 | 449 | grammar Args;
statements : statement+ ;
statement
: functionCall
| idList
;
functionCall : ID '(' args? ')' ;
args : arg (',' arg)* ;
arg : ID;
idList : ID (',' ID)* ;
ID : [a-zA-Z_]+;
WS : [ \r\n\t] -> skip; |
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0x48_notsx.log_21829_348.asm | ljhsiun2/medusa | 9 | 95285 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r13
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x1d258, %rsi
lea addresses_WC_ht+0x1b258, %rdi
clflush (%rdi)
inc %r11
mov $127, %rcx
rep movsb
nop
nop
nop
nop
nop
sub %rdi, %rdi
lea addresses_WT_ht+0x18818, %rsi
lea addresses_WT_ht+0xe458, %rdi
nop
nop
nop
cmp $59475, %rbp
mov $99, %rcx
rep movsb
nop
nop
nop
add %rdi, %rdi
lea addresses_A_ht+0xbec6, %rsi
clflush (%rsi)
nop
nop
add $42364, %r13
movl $0x61626364, (%rsi)
nop
nop
nop
nop
add $45082, %r13
lea addresses_normal_ht+0x11358, %r13
clflush (%r13)
nop
and %r12, %r12
mov $0x6162636465666768, %rsi
movq %rsi, %xmm6
vmovups %ymm6, (%r13)
nop
nop
dec %rbp
lea addresses_A_ht+0x1ded8, %rdi
nop
add %r12, %r12
mov (%rdi), %ecx
nop
nop
inc %rsi
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %r13
pop %r12
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r9
push %rax
push %rbp
push %rbx
push %rdi
// Store
mov $0xdd8, %rbp
inc %r11
movw $0x5152, (%rbp)
nop
nop
nop
cmp %r9, %r9
// Store
lea addresses_WC+0xdf58, %r12
nop
inc %rdi
mov $0x5152535455565758, %rax
movq %rax, (%r12)
nop
nop
nop
nop
nop
dec %rbx
// Load
lea addresses_A+0x1ffd8, %rax
nop
nop
nop
and %rbx, %rbx
mov (%rax), %r11d
nop
sub %rdi, %rdi
// Load
lea addresses_A+0x198a8, %rbx
clflush (%rbx)
nop
nop
nop
nop
sub %rax, %rax
mov (%rbx), %di
and $57297, %r11
// Store
lea addresses_PSE+0x172ac, %rdi
nop
nop
cmp $22025, %r12
movw $0x5152, (%rdi)
nop
nop
nop
nop
and %rbp, %rbp
// Store
lea addresses_WT+0x1aa58, %r9
nop
nop
nop
nop
nop
sub %r11, %r11
mov $0x5152535455565758, %rbp
movq %rbp, (%r9)
nop
add $13704, %rbp
// Faulty Load
lea addresses_RW+0x11258, %rbp
nop
nop
cmp %rdi, %rdi
mov (%rbp), %r11
lea oracles, %r12
and $0xff, %r11
shlq $12, %r11
mov (%r12,%r11,1), %r11
pop %rdi
pop %rbx
pop %rbp
pop %rax
pop %r9
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'same': False, 'NT': False, 'AVXalign': False, 'size': 8, 'type': 'addresses_RW', 'congruent': 0}}
{'dst': {'same': False, 'NT': False, 'AVXalign': False, 'size': 2, 'type': 'addresses_P', 'congruent': 5}, 'OP': 'STOR'}
{'dst': {'same': False, 'NT': True, 'AVXalign': False, 'size': 8, 'type': 'addresses_WC', 'congruent': 3}, 'OP': 'STOR'}
{'OP': 'LOAD', 'src': {'same': False, 'NT': False, 'AVXalign': True, 'size': 4, 'type': 'addresses_A', 'congruent': 7}}
{'OP': 'LOAD', 'src': {'same': False, 'NT': True, 'AVXalign': False, 'size': 2, 'type': 'addresses_A', 'congruent': 4}}
{'dst': {'same': False, 'NT': False, 'AVXalign': False, 'size': 2, 'type': 'addresses_PSE', 'congruent': 2}, 'OP': 'STOR'}
{'dst': {'same': False, 'NT': True, 'AVXalign': False, 'size': 8, 'type': 'addresses_WT', 'congruent': 7}, 'OP': 'STOR'}
[Faulty Load]
{'OP': 'LOAD', 'src': {'same': True, 'NT': False, 'AVXalign': False, 'size': 8, 'type': 'addresses_RW', 'congruent': 0}}
<gen_prepare_buffer>
{'dst': {'same': False, 'congruent': 11, 'type': 'addresses_WC_ht'}, 'OP': 'REPM', 'src': {'same': False, 'congruent': 9, 'type': 'addresses_A_ht'}}
{'dst': {'same': False, 'congruent': 9, 'type': 'addresses_WT_ht'}, 'OP': 'REPM', 'src': {'same': False, 'congruent': 0, 'type': 'addresses_WT_ht'}}
{'dst': {'same': True, 'NT': False, 'AVXalign': False, 'size': 4, 'type': 'addresses_A_ht', 'congruent': 0}, 'OP': 'STOR'}
{'dst': {'same': True, 'NT': False, 'AVXalign': False, 'size': 32, 'type': 'addresses_normal_ht', 'congruent': 7}, 'OP': 'STOR'}
{'OP': 'LOAD', 'src': {'same': False, 'NT': False, 'AVXalign': False, 'size': 4, 'type': 'addresses_A_ht', 'congruent': 7}}
{'32': 21829}
32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32
*/
|
src/main/fragment/mos6502-common/vwum1=pwuz2_derefidx_vbuyy_minus_vwuc1.asm | jbrandwood/kickc | 2 | 240721 | lda ({z2}),y
sec
sbc #<{c1}
sta {m1}
iny
lda ({z2}),y
sbc #>{c1}
sta {m1}+1
|
Scripts/data/vic.asm | 1888games/golf | 1 | 247682 | VIC: {
.label COLOR_ADDRESS = ZP.ColourAddress
.label SCREEN_ADDRESS = ZP.ScreenAddress
MSB_On: .byte %00000001, %00000010, %00000100,%00001000,%00010000,%00100000,%01000000,%10000000
MSB_Off: .byte %11111110, %11111101, %11111011,%11110111,%11101111,%11011111,%10111111,%01111111
ScreenRowLSB:
.fill 25, <[i * $28]
ScreenRowMSB:
.fill 25, >[i * $28]
.label SPRITE_0_X = $d000
.label SPRITE_0_Y = $d001
.label SPRITE_1_X = $d002
.label SPRITE_1_Y = $d003
.label SPRITE_2_X = $d004
.label SPRITE_2_Y = $d005
.label SPRITE_3_X = $d006
.label SPRITE_3_Y = $d007
.label SPRITE_4_X = $d008
.label SPRITE_4_Y = $d009
.label SPRITE_5_X = $d00a
.label SPRITE_5_Y = $d00b
.label SPRITE_6_X = $d00c
.label SPRITE_6_Y = $d00d
.label SPRITE_7_X = $d00e
.label SPRITE_7_Y = $d00f
.label SPRITE_MSB = $d010
.label RASTER_Y = $d012
.label SPRITE_ENABLE = $d015
.label SCREEN_CONTROL_2 = $d016
.label BANK_SELECT = $dd00
.label SCREEN_CONTROL = $d011
.label MEMORY_SETUP = $d018
.label INTERRUPT_CONTROL = $d01a
.label INTERRUPT_STATUS = $d019
.label SPRITE_MULTICOLOR = $d01c
.label BORDER_COLOR = $d020
.label BACKGROUND_COLOR = $d021
.label EXTENDED_BG_COLOR_1 = $d022
.label EXTENDED_BG_COLOR_2 = $d023
.label SPRITE_MULTICOLOR_1 = $d025
.label SPRITE_MULTICOLOR_2 = $d026
.label SPRITE_COLOR_0 = $d027
.label SPRITE_COLOR_1 = $d028
.label SPRITE_COLOR_2 = $d029
.label SPRITE_COLOR_3 = $d02a
.label SPRITE_COLOR_4 = $d02b
.label SPRITE_COLOR_5 = $d02c
.label SPRITE_COLOR_6 = $d02d
.label SPRITE_COLOR_7 = $d02e
.label SPRITE_PRIORITY = $d01b
.label SPRITE_BG_COLLISION = $d01f
.label COLOR_RAM = $d800
} |
programs/oeis/026/A026492.asm | jmorken/loda | 1 | 89362 | ; A026492: a(n) = t(3n), where t = A001285 (Thue-Morse sequence).
; 1,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,2,2,2,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,2,2,2,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,2,2,2,1,2,1,1,1,1,1,1,1,2,1,1,1,2,2,2,1,2,2,2,2,2,2,2,1,2,1,1,1,2,2,2,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,2,2,2,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,2,2,2,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,2,2,2,1,1,1,2,1,2,2,2,2,2,2,2,1,2,2,2,1,1,1,2,1,1,1,1,1,1,1,2,1,2,2
mul $0,24
mov $1,1
lpb $0
div $0,2
gcd $1,2
add $1,$0
lpe
|
SVD2ada/svd/stm32_svd-spdifrx.ads | JCGobbi/Nucleo-STM32H743ZI | 0 | 16568 | <gh_stars>0
pragma Style_Checks (Off);
-- This spec has been automatically generated from STM32H743x.svd
pragma Restrictions (No_Elaboration_Code);
with HAL;
with System;
package STM32_SVD.SPDIFRX is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_SPDIFRXEN_Field is HAL.UInt2;
subtype CR_DRFMT_Field is HAL.UInt2;
subtype CR_NBTR_Field is HAL.UInt2;
subtype CR_INSEL_Field is HAL.UInt3;
-- Control register
type CR_Register is record
-- Peripheral Block Enable
SPDIFRXEN : CR_SPDIFRXEN_Field := 16#0#;
-- Receiver DMA ENable for data flow
RXDMAEN : Boolean := False;
-- STerEO Mode
RXSTEO : Boolean := False;
-- RX Data format
DRFMT : CR_DRFMT_Field := 16#0#;
-- Mask Parity error bit
PMSK : Boolean := False;
-- Mask of Validity bit
VMSK : Boolean := False;
-- Mask of channel status and user bits
CUMSK : Boolean := False;
-- Mask of Preamble Type bits
PTMSK : Boolean := False;
-- Control Buffer DMA ENable for control flow
CBDMAEN : Boolean := False;
-- Channel Selection
CHSEL : Boolean := False;
-- Maximum allowed re-tries during synchronization phase
NBTR : CR_NBTR_Field := 16#0#;
-- Wait For Activity
WFA : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- input selection
INSEL : CR_INSEL_Field := 16#0#;
-- unspecified
Reserved_19_19 : HAL.Bit := 16#0#;
-- Symbol Clock Enable
CKSEN : Boolean := False;
-- Backup Symbol Clock Enable
CKSBKPEN : Boolean := False;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
SPDIFRXEN at 0 range 0 .. 1;
RXDMAEN at 0 range 2 .. 2;
RXSTEO at 0 range 3 .. 3;
DRFMT at 0 range 4 .. 5;
PMSK at 0 range 6 .. 6;
VMSK at 0 range 7 .. 7;
CUMSK at 0 range 8 .. 8;
PTMSK at 0 range 9 .. 9;
CBDMAEN at 0 range 10 .. 10;
CHSEL at 0 range 11 .. 11;
NBTR at 0 range 12 .. 13;
WFA at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
INSEL at 0 range 16 .. 18;
Reserved_19_19 at 0 range 19 .. 19;
CKSEN at 0 range 20 .. 20;
CKSBKPEN at 0 range 21 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
-- Interrupt mask register
type IMR_Register is record
-- RXNE interrupt enable
RXNEIE : Boolean := False;
-- Control Buffer Ready Interrupt Enable
CSRNEIE : Boolean := False;
-- Parity error interrupt enable
PERRIE : Boolean := False;
-- Overrun error Interrupt Enable
OVRIE : Boolean := False;
-- Synchronization Block Detected Interrupt Enable
SBLKIE : Boolean := False;
-- Synchronization Done
SYNCDIE : Boolean := False;
-- Serial Interface Error Interrupt Enable
IFEIE : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for IMR_Register use record
RXNEIE at 0 range 0 .. 0;
CSRNEIE at 0 range 1 .. 1;
PERRIE at 0 range 2 .. 2;
OVRIE at 0 range 3 .. 3;
SBLKIE at 0 range 4 .. 4;
SYNCDIE at 0 range 5 .. 5;
IFEIE at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype SR_WIDTH5_Field is HAL.UInt15;
-- Status register
type SR_Register is record
-- Read-only. Read data register not empty
RXNE : Boolean;
-- Read-only. Control Buffer register is not empty
CSRNE : Boolean;
-- Read-only. Parity error
PERR : Boolean;
-- Read-only. Overrun error
OVR : Boolean;
-- Read-only. Synchronization Block Detected
SBD : Boolean;
-- Read-only. Synchronization Done
SYNCD : Boolean;
-- Read-only. Framing error
FERR : Boolean;
-- Read-only. Synchronization error
SERR : Boolean;
-- Read-only. Time-out error
TERR : Boolean;
-- unspecified
Reserved_9_15 : HAL.UInt7;
-- Read-only. Duration of 5 symbols counted with SPDIF_CLK
WIDTH5 : SR_WIDTH5_Field;
-- unspecified
Reserved_31_31 : HAL.Bit;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
RXNE at 0 range 0 .. 0;
CSRNE at 0 range 1 .. 1;
PERR at 0 range 2 .. 2;
OVR at 0 range 3 .. 3;
SBD at 0 range 4 .. 4;
SYNCD at 0 range 5 .. 5;
FERR at 0 range 6 .. 6;
SERR at 0 range 7 .. 7;
TERR at 0 range 8 .. 8;
Reserved_9_15 at 0 range 9 .. 15;
WIDTH5 at 0 range 16 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
-- Interrupt Flag Clear register
type IFCR_Register is record
-- unspecified
Reserved_0_1 : HAL.UInt2 := 16#0#;
-- Write-only. Clears the Parity error flag
PERRCF : Boolean := False;
-- Write-only. Clears the Overrun error flag
OVRCF : Boolean := False;
-- Write-only. Clears the Synchronization Block Detected flag
SBDCF : Boolean := False;
-- Write-only. Clears the Synchronization Done flag
SYNCDCF : Boolean := False;
-- unspecified
Reserved_6_31 : HAL.UInt26 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for IFCR_Register use record
Reserved_0_1 at 0 range 0 .. 1;
PERRCF at 0 range 2 .. 2;
OVRCF at 0 range 3 .. 3;
SBDCF at 0 range 4 .. 4;
SYNCDCF at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
subtype DR_00_DR_Field is HAL.UInt24;
subtype DR_00_PT_Field is HAL.UInt2;
-- Data input register
type DR_00_Register is record
-- Read-only. Parity Error bit
DR : DR_00_DR_Field;
-- Read-only. Parity Error bit
PE : Boolean;
-- Read-only. Validity bit
V : Boolean;
-- Read-only. User bit
U : Boolean;
-- Read-only. Channel Status bit
C : Boolean;
-- Read-only. Preamble Type
PT : DR_00_PT_Field;
-- unspecified
Reserved_30_31 : HAL.UInt2;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DR_00_Register use record
DR at 0 range 0 .. 23;
PE at 0 range 24 .. 24;
V at 0 range 25 .. 25;
U at 0 range 26 .. 26;
C at 0 range 27 .. 27;
PT at 0 range 28 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
subtype DR_01_PT_Field is HAL.UInt2;
subtype DR_01_DR_Field is HAL.UInt24;
-- Data input register
type DR_01_Register is record
-- Read-only. Parity Error bit
PE : Boolean;
-- Read-only. Validity bit
V : Boolean;
-- Read-only. User bit
U : Boolean;
-- Read-only. Channel Status bit
C : Boolean;
-- Read-only. Preamble Type
PT : DR_01_PT_Field;
-- unspecified
Reserved_6_7 : HAL.UInt2;
-- Read-only. Data value
DR : DR_01_DR_Field;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DR_01_Register use record
PE at 0 range 0 .. 0;
V at 0 range 1 .. 1;
U at 0 range 2 .. 2;
C at 0 range 3 .. 3;
PT at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
DR at 0 range 8 .. 31;
end record;
-- DR_10_DRNL array element
subtype DR_10_DRNL_Element is HAL.UInt16;
-- DR_10_DRNL array
type DR_10_DRNL_Field_Array is array (1 .. 2) of DR_10_DRNL_Element
with Component_Size => 16, Size => 32;
-- Data input register
type DR_10_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- DRNL as a value
Val : HAL.UInt32;
when True =>
-- DRNL as an array
Arr : DR_10_DRNL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DR_10_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
subtype CSR_USR_Field is HAL.UInt16;
subtype CSR_CS_Field is HAL.UInt8;
-- Channel Status register
type CSR_Register is record
-- Read-only. User data information
USR : CSR_USR_Field;
-- Read-only. Channel A status information
CS : CSR_CS_Field;
-- Read-only. Start Of Block
SOB : Boolean;
-- unspecified
Reserved_25_31 : HAL.UInt7;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CSR_Register use record
USR at 0 range 0 .. 15;
CS at 0 range 16 .. 23;
SOB at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype DIR_THI_Field is HAL.UInt13;
subtype DIR_TLO_Field is HAL.UInt13;
-- Debug Information register
type DIR_Register is record
-- Read-only. Threshold HIGH
THI : DIR_THI_Field;
-- unspecified
Reserved_13_15 : HAL.UInt3;
-- Read-only. Threshold LOW
TLO : DIR_TLO_Field;
-- unspecified
Reserved_29_31 : HAL.UInt3;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIR_Register use record
THI at 0 range 0 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
TLO at 0 range 16 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
subtype VERR_MINREV_Field is HAL.UInt4;
subtype VERR_MAJREV_Field is HAL.UInt4;
-- SPDIFRX version register
type VERR_Register is record
-- Read-only. Minor revision
MINREV : VERR_MINREV_Field;
-- Read-only. Major revision
MAJREV : VERR_MAJREV_Field;
-- unspecified
Reserved_8_31 : HAL.UInt24;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for VERR_Register use record
MINREV at 0 range 0 .. 3;
MAJREV at 0 range 4 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type SPDIFRX_Disc is
(Val_00,
Val_01,
Val_10);
-- Receiver Interface
type SPDIFRX_Peripheral
(Discriminent : SPDIFRX_Disc := Val_00)
is record
-- Control register
CR : aliased CR_Register;
-- Interrupt mask register
IMR : aliased IMR_Register;
-- Status register
SR : aliased SR_Register;
-- Interrupt Flag Clear register
IFCR : aliased IFCR_Register;
-- Channel Status register
CSR : aliased CSR_Register;
-- Debug Information register
DIR : aliased DIR_Register;
-- SPDIFRX version register
VERR : aliased VERR_Register;
-- SPDIFRX identification register
IDR : aliased HAL.UInt32;
-- SPDIFRX size identification register
SIDR : aliased HAL.UInt32;
case Discriminent is
when Val_00 =>
-- Data input register
DR_00 : aliased DR_00_Register;
when Val_01 =>
-- Data input register
DR_01 : aliased DR_01_Register;
when Val_10 =>
-- Data input register
DR_10 : aliased DR_10_Register;
end case;
end record
with Unchecked_Union, Volatile;
for SPDIFRX_Peripheral use record
CR at 16#0# range 0 .. 31;
IMR at 16#4# range 0 .. 31;
SR at 16#8# range 0 .. 31;
IFCR at 16#C# range 0 .. 31;
CSR at 16#14# range 0 .. 31;
DIR at 16#18# range 0 .. 31;
VERR at 16#3F4# range 0 .. 31;
IDR at 16#3F8# range 0 .. 31;
SIDR at 16#3FC# range 0 .. 31;
DR_00 at 16#10# range 0 .. 31;
DR_01 at 16#10# range 0 .. 31;
DR_10 at 16#10# range 0 .. 31;
end record;
-- Receiver Interface
SPDIFRX_Periph : aliased SPDIFRX_Peripheral
with Import, Address => SPDIFRX_Base;
end STM32_SVD.SPDIFRX;
|
smsq/q40/cachemode_init.asm | olifink/smsqe | 0 | 243035 | <filename>smsq/q40/cachemode_init.asm<gh_stars>0
; Q60 cachemodes 1.00 (wl)
; 2005-01-21 1.01 pre-configure to serialized & use config info really (wl)
section init
include 'dev8_keys_qdos_sms'
include 'dev8_keys_qdos_ioa'
include 'dev8_keys_sys'
include 'dev8_keys_qlv'
include 'dev8_mac_config02'
include 'dev8_mac_proc'
xref copyback
xref serialized
xref writethrough
xref smsq_end
section header
qx0c_vers equ '1.01'
header_base
dc.l qx0c_base-header_base ; length of header
dc.l 0 ; module length unknown
dc.l smsq_end-qx0c_base ; loaded length
dc.l 0 ; checksum
dc.l 0 ; always select
dc.b 0 ; main level
dc.b 0
dc.w smsq_name-*
smsq_name
dc.w smsq_name2-*-2,'Initialise Q40/Q60 Cache modes '
smsq_name2
dc.l qx0c_vers
dc.w $200a
xref.l smsq_vers
mkcfhead {Cache Mode},{smsq_vers}
mkcfitem 'OS60',code,'I',qx0c_cf,,,\
{Initial Cache mode}\
1,S,{Serialized = Cache OFF},2,W,{Writethrough},3,C,{Copyback}
mkcfend
ds.w 0
section base
qx0c_base
lea procs,a1 ; procedures
move.w sb.inipr,a2
jsr (a2) ; link them in
lea qx0c_cf(pc),a2
move.b (a2),d0 ; preconfigured cache mode
subq.b #1,d0 ; is it serialized?
bne.s qx0c_ns ; no ->...
lea serialized(pc),a2
bra.s qx0c_end
qx0c_ns subq.b #1,d0 ; is it writethrough?
bne.s qx0c_nw ; no->...
lea writethrough(pc),a2
bra.s qx0c_end
qx0c_nw lea copyback(pc),a2 ; copyback is default
qx0c_end
movem.l a3/a5,-(a7)
move.l a3,a5
jsr (a2) ; set cache mode now
movem.l (a7)+,a3/a5
moveq #0,d0 ; always return w/o error
rts
qx0c_cf dc.b 1,1
procs
proc_stt
proc_def COPYBACK
proc_def WRITETHROUGH
proc_def SERIALIZED
proc_end
proc_stt
proc_end
end
|
oeis/340/A340395.asm | neoneye/loda-programs | 11 | 94836 | ; A340395: a(n) = A340131(A001006(n)).
; 5,15,50,150,455,1365,4100,12300,36905,110715,332150,996450,2989355,8968065,26904200,80712600,242137805,726413415,2179240250,6537720750,19613162255,58839486765,176518460300,529555380900,1588666142705,4765998428115,14297995284350,42893985853050,128681957559155,386045872677465,1158137618032400,3474412854097200,10423238562291605,31269715686874815,93809147060624450,281427441181873350,844282323545620055,2532846970636860165,7598540911910580500,22795622735731741500,68386868207195224505
seq $0,33113 ; Base-3 digits are, in order, the first n terms of the periodic sequence with initial period 1,0.
mul $0,5
|
dino/lcs/base/6AFE.asm | zengfr/arcade_game_romhacking_sourcecode_top_secret_data | 6 | 84993 | copyright zengfr site:http://github.com/zengfr/romhack
00042A move.l D1, (A0)+
00042C dbra D0, $42a
004B70 move.w A0, ($6afe,A5)
004B74 moveq #$17, D0 [base+6AFE]
004B88 movea.w ($6afe,A5), A4
004B8C move.w A6, -(A4) [base+6AFE]
004B8E move.w A4, ($6afe,A5) [base+6B22, base+6B24, base+6B26, base+6B28, base+6B2A, base+6B2C, base+6B2E]
004B92 addq.w #1, ($6afc,A5) [base+6AFE]
010652 move.w A0, ($6afe,A5)
010656 move.w D0, ($6b30,A5) [base+6AFE]
011FA2 movea.w ($6afe,A5), A1
011FA6 movea.w (A1)+, A3 [base+6AFE]
012040 movea.w ($6afe,A5), A1
012044 movea.w (A1)+, A3 [base+6AFE]
0120F8 movea.w ($6afe,A5), A1
0120FC movea.w (A1)+, A3 [base+6AFE]
0AAACA move.l (A0), D2
0AAACC move.w D0, (A0) [123p+11A, 123p+11C, 123p+11E, 123p+120, 123p+122, 123p+124, 123p+126, 123p+128, 123p+12A, base+6FFE, enemy+BC, enemy+C0, enemy+C2, enemy+C4, enemy+CC, enemy+CE, enemy+D0, enemy+D2, enemy+D4, enemy+D6, enemy+D8, enemy+DA, item+86, item+88, item+8A, item+98, item+9A, item+9C, item+9E, item+A0, item+A2, item+A4, item+A6, scr1]
0AAACE move.w D0, ($2,A0)
0AAAD2 cmp.l (A0), D0
0AAAD4 bne $aaafc
0AAAD8 move.l D2, (A0)+
0AAADA cmpa.l A0, A1 [123p+11A, 123p+11C, 123p+11E, 123p+120, 123p+122, 123p+124, 123p+126, 123p+128, 123p+12A, base+6FFE, enemy+BC, enemy+C0, enemy+C2, enemy+C4, enemy+CC, enemy+CE, enemy+D0, enemy+D2, enemy+D4, enemy+D6, enemy+D8, enemy+DA, item+86, item+88, item+8A, item+98, item+9A, item+9C, item+9E, item+A0, item+A2, item+A4, item+A6, scr1]
0AAAE6 move.l (A0), D2
0AAAE8 move.w D0, (A0) [123p+11A, 123p+11C, 123p+11E, 123p+120, 123p+122, 123p+124, 123p+126, 123p+128, 123p+12A, base+6FFE, enemy+BC, enemy+C0, enemy+C2, enemy+C4, enemy+CC, enemy+CE, enemy+D0, enemy+D2, enemy+D4, enemy+D6, enemy+D8, enemy+DA, item+86, item+88, item+8A, item+98, item+9A, item+9C, item+9E, item+A0, item+A2, item+A4, item+A6, scr1]
0AAAF4 move.l D2, (A0)+
0AAAF6 cmpa.l A0, A1 [123p+11A, 123p+11C, 123p+11E, 123p+120, 123p+122, 123p+124, 123p+126, 123p+128, 123p+12A, base+6FFE, enemy+BC, enemy+C0, enemy+C2, enemy+C4, enemy+CC, enemy+CE, enemy+D0, enemy+D2, enemy+D4, enemy+D6, enemy+D8, enemy+DA, item+86, item+88, item+8A, item+98, item+9A, item+9C, item+9E, item+A0, item+A2, item+A4, item+A6, scr1]
copyright zengfr site:http://github.com/zengfr/romhack
|
_build/dispatcher/jmp_ippsGFpECInitStd192r1_ffc1d72c.asm | zyktrcn/ippcp | 1 | 19091 | extern m7_ippsGFpECInitStd192r1:function
extern n8_ippsGFpECInitStd192r1:function
extern y8_ippsGFpECInitStd192r1:function
extern e9_ippsGFpECInitStd192r1:function
extern l9_ippsGFpECInitStd192r1:function
extern n0_ippsGFpECInitStd192r1:function
extern k0_ippsGFpECInitStd192r1:function
extern ippcpJumpIndexForMergedLibs
extern ippcpSafeInit:function
segment .data
align 8
dq .Lin_ippsGFpECInitStd192r1
.Larraddr_ippsGFpECInitStd192r1:
dq m7_ippsGFpECInitStd192r1
dq n8_ippsGFpECInitStd192r1
dq y8_ippsGFpECInitStd192r1
dq e9_ippsGFpECInitStd192r1
dq l9_ippsGFpECInitStd192r1
dq n0_ippsGFpECInitStd192r1
dq k0_ippsGFpECInitStd192r1
segment .text
global ippsGFpECInitStd192r1:function (ippsGFpECInitStd192r1.LEndippsGFpECInitStd192r1 - ippsGFpECInitStd192r1)
.Lin_ippsGFpECInitStd192r1:
db 0xf3, 0x0f, 0x1e, 0xfa
call ippcpSafeInit wrt ..plt
align 16
ippsGFpECInitStd192r1:
db 0xf3, 0x0f, 0x1e, 0xfa
mov rax, qword [rel ippcpJumpIndexForMergedLibs wrt ..gotpc]
movsxd rax, dword [rax]
lea r11, [rel .Larraddr_ippsGFpECInitStd192r1]
mov r11, qword [r11+rax*8]
jmp r11
.LEndippsGFpECInitStd192r1:
|
oeis/075/A075671.asm | neoneye/loda-programs | 11 | 20830 | ; A075671: Sum of next n 10th powers.
; Submitted by <NAME>
; 1,60073,71280377,14843001474,1091618326275,39736919990851,870012241054523,12967387960026452,143075291905145949,1240006139651007925,8817026830146599701,53151169903167142598,278615540073819826527,1295610629596485350799,5430916505417064431575,20790115223785980795176,73466003799923713987673,241794561669161348698977,746807393861156840349649,2178475618554012627483850,6034771326984668573354651,15951045352725240784008123,40394729070626303104313427,98362631602753953847536124,231036040251364633996395125
add $0,1
mov $2,10
mov $5,$0
bin $5,2
lpb $0
mov $4,$0
sub $0,1
add $4,$5
pow $4,$2
add $3,$4
lpe
mov $0,$3
|
programs/oeis/332/A332148.asm | neoneye/loda | 22 | 28959 | <reponame>neoneye/loda
; A332148: a(n) = 4*(10^(2*n+1)-1)/9 + 4*10^n.
; 8,484,44844,4448444,444484444,44444844444,4444448444444,444444484444444,44444444844444444,4444444448444444444,444444444484444444444,44444444444844444444444,4444444444448444444444444,444444444444484444444444444,44444444444444844444444444444,4444444444444448444444444444444
mov $1,10
pow $1,$0
mul $1,10
add $1,5
bin $1,2
sub $1,105
div $1,45
mul $1,4
add $1,8
mov $0,$1
|
libsrc/_DEVELOPMENT/input/zx/c/sccz80/in_mouse_amx_wheel.asm | meesokim/z88dk | 0 | 177810 | <reponame>meesokim/z88dk
; uint16_t in_mouse_amx_wheel(void)
SECTION code_input
PUBLIC in_mouse_amx_wheel
EXTERN asm_in_mouse_amx_wheel
defc in_mouse_amx_wheel = asm_in_mouse_amx_wheel
|
mkdir.asm | chintu3536/xv6 | 0 | 100432 |
_mkdir: file format elf32-i386
Disassembly of section .text:
00000000 <main>:
#include "stat.h"
#include "user.h"
int
main(int argc, char *argv[])
{
0: 8d 4c 24 04 lea 0x4(%esp),%ecx
4: 83 e4 f0 and $0xfffffff0,%esp
7: ff 71 fc pushl -0x4(%ecx)
a: 55 push %ebp
b: 89 e5 mov %esp,%ebp
d: 53 push %ebx
e: 51 push %ecx
f: 83 ec 10 sub $0x10,%esp
12: 89 cb mov %ecx,%ebx
int i;
if(argc < 2){
14: 83 3b 01 cmpl $0x1,(%ebx)
17: 7f 17 jg 30 <main+0x30>
printf(2, "Usage: mkdir files...\n");
19: 83 ec 08 sub $0x8,%esp
1c: 68 24 08 00 00 push $0x824
21: 6a 02 push $0x2
23: e8 46 04 00 00 call 46e <printf>
28: 83 c4 10 add $0x10,%esp
exit();
2b: e8 b7 02 00 00 call 2e7 <exit>
}
for(i = 1; i < argc; i++){
30: c7 45 f4 01 00 00 00 movl $0x1,-0xc(%ebp)
37: eb 4b jmp 84 <main+0x84>
if(mkdir(argv[i]) < 0){
39: 8b 45 f4 mov -0xc(%ebp),%eax
3c: 8d 14 85 00 00 00 00 lea 0x0(,%eax,4),%edx
43: 8b 43 04 mov 0x4(%ebx),%eax
46: 01 d0 add %edx,%eax
48: 8b 00 mov (%eax),%eax
4a: 83 ec 0c sub $0xc,%esp
4d: 50 push %eax
4e: e8 fc 02 00 00 call 34f <mkdir>
53: 83 c4 10 add $0x10,%esp
56: 85 c0 test %eax,%eax
58: 79 26 jns 80 <main+0x80>
printf(2, "mkdir: %s failed to create\n", argv[i]);
5a: 8b 45 f4 mov -0xc(%ebp),%eax
5d: 8d 14 85 00 00 00 00 lea 0x0(,%eax,4),%edx
64: 8b 43 04 mov 0x4(%ebx),%eax
67: 01 d0 add %edx,%eax
69: 8b 00 mov (%eax),%eax
6b: 83 ec 04 sub $0x4,%esp
6e: 50 push %eax
6f: 68 3b 08 00 00 push $0x83b
74: 6a 02 push $0x2
76: e8 f3 03 00 00 call 46e <printf>
7b: 83 c4 10 add $0x10,%esp
break;
7e: eb 0b jmp 8b <main+0x8b>
if(argc < 2){
printf(2, "Usage: mkdir files...\n");
exit();
}
for(i = 1; i < argc; i++){
80: 83 45 f4 01 addl $0x1,-0xc(%ebp)
84: 8b 45 f4 mov -0xc(%ebp),%eax
87: 3b 03 cmp (%ebx),%eax
89: 7c ae jl 39 <main+0x39>
printf(2, "mkdir: %s failed to create\n", argv[i]);
break;
}
}
exit();
8b: e8 57 02 00 00 call 2e7 <exit>
00000090 <stosb>:
"cc");
}
static inline void
stosb(void *addr, int data, int cnt)
{
90: 55 push %ebp
91: 89 e5 mov %esp,%ebp
93: 57 push %edi
94: 53 push %ebx
asm volatile("cld; rep stosb" :
95: 8b 4d 08 mov 0x8(%ebp),%ecx
98: 8b 55 10 mov 0x10(%ebp),%edx
9b: 8b 45 0c mov 0xc(%ebp),%eax
9e: 89 cb mov %ecx,%ebx
a0: 89 df mov %ebx,%edi
a2: 89 d1 mov %edx,%ecx
a4: fc cld
a5: f3 aa rep stos %al,%es:(%edi)
a7: 89 ca mov %ecx,%edx
a9: 89 fb mov %edi,%ebx
ab: 89 5d 08 mov %ebx,0x8(%ebp)
ae: 89 55 10 mov %edx,0x10(%ebp)
"=D" (addr), "=c" (cnt) :
"0" (addr), "1" (cnt), "a" (data) :
"memory", "cc");
}
b1: 90 nop
b2: 5b pop %ebx
b3: 5f pop %edi
b4: 5d pop %ebp
b5: c3 ret
000000b6 <strcpy>:
#include "user.h"
#include "x86.h"
char*
strcpy(char *s, char *t)
{
b6: 55 push %ebp
b7: 89 e5 mov %esp,%ebp
b9: 83 ec 10 sub $0x10,%esp
char *os;
os = s;
bc: 8b 45 08 mov 0x8(%ebp),%eax
bf: 89 45 fc mov %eax,-0x4(%ebp)
while((*s++ = *t++) != 0)
c2: 90 nop
c3: 8b 45 08 mov 0x8(%ebp),%eax
c6: 8d 50 01 lea 0x1(%eax),%edx
c9: 89 55 08 mov %edx,0x8(%ebp)
cc: 8b 55 0c mov 0xc(%ebp),%edx
cf: 8d 4a 01 lea 0x1(%edx),%ecx
d2: 89 4d 0c mov %ecx,0xc(%ebp)
d5: 0f b6 12 movzbl (%edx),%edx
d8: 88 10 mov %dl,(%eax)
da: 0f b6 00 movzbl (%eax),%eax
dd: 84 c0 test %al,%al
df: 75 e2 jne c3 <strcpy+0xd>
;
return os;
e1: 8b 45 fc mov -0x4(%ebp),%eax
}
e4: c9 leave
e5: c3 ret
000000e6 <strcmp>:
int
strcmp(const char *p, const char *q)
{
e6: 55 push %ebp
e7: 89 e5 mov %esp,%ebp
while(*p && *p == *q)
e9: eb 08 jmp f3 <strcmp+0xd>
p++, q++;
eb: 83 45 08 01 addl $0x1,0x8(%ebp)
ef: 83 45 0c 01 addl $0x1,0xc(%ebp)
}
int
strcmp(const char *p, const char *q)
{
while(*p && *p == *q)
f3: 8b 45 08 mov 0x8(%ebp),%eax
f6: 0f b6 00 movzbl (%eax),%eax
f9: 84 c0 test %al,%al
fb: 74 10 je 10d <strcmp+0x27>
fd: 8b 45 08 mov 0x8(%ebp),%eax
100: 0f b6 10 movzbl (%eax),%edx
103: 8b 45 0c mov 0xc(%ebp),%eax
106: 0f b6 00 movzbl (%eax),%eax
109: 38 c2 cmp %al,%dl
10b: 74 de je eb <strcmp+0x5>
p++, q++;
return (uchar)*p - (uchar)*q;
10d: 8b 45 08 mov 0x8(%ebp),%eax
110: 0f b6 00 movzbl (%eax),%eax
113: 0f b6 d0 movzbl %al,%edx
116: 8b 45 0c mov 0xc(%ebp),%eax
119: 0f b6 00 movzbl (%eax),%eax
11c: 0f b6 c0 movzbl %al,%eax
11f: 29 c2 sub %eax,%edx
121: 89 d0 mov %edx,%eax
}
123: 5d pop %ebp
124: c3 ret
00000125 <strlen>:
uint
strlen(char *s)
{
125: 55 push %ebp
126: 89 e5 mov %esp,%ebp
128: 83 ec 10 sub $0x10,%esp
int n;
for(n = 0; s[n]; n++)
12b: c7 45 fc 00 00 00 00 movl $0x0,-0x4(%ebp)
132: eb 04 jmp 138 <strlen+0x13>
134: 83 45 fc 01 addl $0x1,-0x4(%ebp)
138: 8b 55 fc mov -0x4(%ebp),%edx
13b: 8b 45 08 mov 0x8(%ebp),%eax
13e: 01 d0 add %edx,%eax
140: 0f b6 00 movzbl (%eax),%eax
143: 84 c0 test %al,%al
145: 75 ed jne 134 <strlen+0xf>
;
return n;
147: 8b 45 fc mov -0x4(%ebp),%eax
}
14a: c9 leave
14b: c3 ret
0000014c <memset>:
void*
memset(void *dst, int c, uint n)
{
14c: 55 push %ebp
14d: 89 e5 mov %esp,%ebp
stosb(dst, c, n);
14f: 8b 45 10 mov 0x10(%ebp),%eax
152: 50 push %eax
153: ff 75 0c pushl 0xc(%ebp)
156: ff 75 08 pushl 0x8(%ebp)
159: e8 32 ff ff ff call 90 <stosb>
15e: 83 c4 0c add $0xc,%esp
return dst;
161: 8b 45 08 mov 0x8(%ebp),%eax
}
164: c9 leave
165: c3 ret
00000166 <strchr>:
char*
strchr(const char *s, char c)
{
166: 55 push %ebp
167: 89 e5 mov %esp,%ebp
169: 83 ec 04 sub $0x4,%esp
16c: 8b 45 0c mov 0xc(%ebp),%eax
16f: 88 45 fc mov %al,-0x4(%ebp)
for(; *s; s++)
172: eb 14 jmp 188 <strchr+0x22>
if(*s == c)
174: 8b 45 08 mov 0x8(%ebp),%eax
177: 0f b6 00 movzbl (%eax),%eax
17a: 3a 45 fc cmp -0x4(%ebp),%al
17d: 75 05 jne 184 <strchr+0x1e>
return (char*)s;
17f: 8b 45 08 mov 0x8(%ebp),%eax
182: eb 13 jmp 197 <strchr+0x31>
}
char*
strchr(const char *s, char c)
{
for(; *s; s++)
184: 83 45 08 01 addl $0x1,0x8(%ebp)
188: 8b 45 08 mov 0x8(%ebp),%eax
18b: 0f b6 00 movzbl (%eax),%eax
18e: 84 c0 test %al,%al
190: 75 e2 jne 174 <strchr+0xe>
if(*s == c)
return (char*)s;
return 0;
192: b8 00 00 00 00 mov $0x0,%eax
}
197: c9 leave
198: c3 ret
00000199 <gets>:
char*
gets(char *buf, int max)
{
199: 55 push %ebp
19a: 89 e5 mov %esp,%ebp
19c: 83 ec 18 sub $0x18,%esp
int i, cc;
char c;
for(i=0; i+1 < max; ){
19f: c7 45 f4 00 00 00 00 movl $0x0,-0xc(%ebp)
1a6: eb 42 jmp 1ea <gets+0x51>
cc = read(0, &c, 1);
1a8: 83 ec 04 sub $0x4,%esp
1ab: 6a 01 push $0x1
1ad: 8d 45 ef lea -0x11(%ebp),%eax
1b0: 50 push %eax
1b1: 6a 00 push $0x0
1b3: e8 47 01 00 00 call 2ff <read>
1b8: 83 c4 10 add $0x10,%esp
1bb: 89 45 f0 mov %eax,-0x10(%ebp)
if(cc < 1)
1be: 83 7d f0 00 cmpl $0x0,-0x10(%ebp)
1c2: 7e 33 jle 1f7 <gets+0x5e>
break;
buf[i++] = c;
1c4: 8b 45 f4 mov -0xc(%ebp),%eax
1c7: 8d 50 01 lea 0x1(%eax),%edx
1ca: 89 55 f4 mov %edx,-0xc(%ebp)
1cd: 89 c2 mov %eax,%edx
1cf: 8b 45 08 mov 0x8(%ebp),%eax
1d2: 01 c2 add %eax,%edx
1d4: 0f b6 45 ef movzbl -0x11(%ebp),%eax
1d8: 88 02 mov %al,(%edx)
if(c == '\n' || c == '\r')
1da: 0f b6 45 ef movzbl -0x11(%ebp),%eax
1de: 3c 0a cmp $0xa,%al
1e0: 74 16 je 1f8 <gets+0x5f>
1e2: 0f b6 45 ef movzbl -0x11(%ebp),%eax
1e6: 3c 0d cmp $0xd,%al
1e8: 74 0e je 1f8 <gets+0x5f>
gets(char *buf, int max)
{
int i, cc;
char c;
for(i=0; i+1 < max; ){
1ea: 8b 45 f4 mov -0xc(%ebp),%eax
1ed: 83 c0 01 add $0x1,%eax
1f0: 3b 45 0c cmp 0xc(%ebp),%eax
1f3: 7c b3 jl 1a8 <gets+0xf>
1f5: eb 01 jmp 1f8 <gets+0x5f>
cc = read(0, &c, 1);
if(cc < 1)
break;
1f7: 90 nop
buf[i++] = c;
if(c == '\n' || c == '\r')
break;
}
buf[i] = '\0';
1f8: 8b 55 f4 mov -0xc(%ebp),%edx
1fb: 8b 45 08 mov 0x8(%ebp),%eax
1fe: 01 d0 add %edx,%eax
200: c6 00 00 movb $0x0,(%eax)
return buf;
203: 8b 45 08 mov 0x8(%ebp),%eax
}
206: c9 leave
207: c3 ret
00000208 <stat>:
int
stat(char *n, struct stat *st)
{
208: 55 push %ebp
209: 89 e5 mov %esp,%ebp
20b: 83 ec 18 sub $0x18,%esp
int fd;
int r;
fd = open(n, O_RDONLY);
20e: 83 ec 08 sub $0x8,%esp
211: 6a 00 push $0x0
213: ff 75 08 pushl 0x8(%ebp)
216: e8 0c 01 00 00 call 327 <open>
21b: 83 c4 10 add $0x10,%esp
21e: 89 45 f4 mov %eax,-0xc(%ebp)
if(fd < 0)
221: 83 7d f4 00 cmpl $0x0,-0xc(%ebp)
225: 79 07 jns 22e <stat+0x26>
return -1;
227: b8 ff ff ff ff mov $0xffffffff,%eax
22c: eb 25 jmp 253 <stat+0x4b>
r = fstat(fd, st);
22e: 83 ec 08 sub $0x8,%esp
231: ff 75 0c pushl 0xc(%ebp)
234: ff 75 f4 pushl -0xc(%ebp)
237: e8 03 01 00 00 call 33f <fstat>
23c: 83 c4 10 add $0x10,%esp
23f: 89 45 f0 mov %eax,-0x10(%ebp)
close(fd);
242: 83 ec 0c sub $0xc,%esp
245: ff 75 f4 pushl -0xc(%ebp)
248: e8 c2 00 00 00 call 30f <close>
24d: 83 c4 10 add $0x10,%esp
return r;
250: 8b 45 f0 mov -0x10(%ebp),%eax
}
253: c9 leave
254: c3 ret
00000255 <atoi>:
int
atoi(const char *s)
{
255: 55 push %ebp
256: 89 e5 mov %esp,%ebp
258: 83 ec 10 sub $0x10,%esp
int n;
n = 0;
25b: c7 45 fc 00 00 00 00 movl $0x0,-0x4(%ebp)
while('0' <= *s && *s <= '9')
262: eb 25 jmp 289 <atoi+0x34>
n = n*10 + *s++ - '0';
264: 8b 55 fc mov -0x4(%ebp),%edx
267: 89 d0 mov %edx,%eax
269: c1 e0 02 shl $0x2,%eax
26c: 01 d0 add %edx,%eax
26e: 01 c0 add %eax,%eax
270: 89 c1 mov %eax,%ecx
272: 8b 45 08 mov 0x8(%ebp),%eax
275: 8d 50 01 lea 0x1(%eax),%edx
278: 89 55 08 mov %edx,0x8(%ebp)
27b: 0f b6 00 movzbl (%eax),%eax
27e: 0f be c0 movsbl %al,%eax
281: 01 c8 add %ecx,%eax
283: 83 e8 30 sub $0x30,%eax
286: 89 45 fc mov %eax,-0x4(%ebp)
atoi(const char *s)
{
int n;
n = 0;
while('0' <= *s && *s <= '9')
289: 8b 45 08 mov 0x8(%ebp),%eax
28c: 0f b6 00 movzbl (%eax),%eax
28f: 3c 2f cmp $0x2f,%al
291: 7e 0a jle 29d <atoi+0x48>
293: 8b 45 08 mov 0x8(%ebp),%eax
296: 0f b6 00 movzbl (%eax),%eax
299: 3c 39 cmp $0x39,%al
29b: 7e c7 jle 264 <atoi+0xf>
n = n*10 + *s++ - '0';
return n;
29d: 8b 45 fc mov -0x4(%ebp),%eax
}
2a0: c9 leave
2a1: c3 ret
000002a2 <memmove>:
void*
memmove(void *vdst, void *vsrc, int n)
{
2a2: 55 push %ebp
2a3: 89 e5 mov %esp,%ebp
2a5: 83 ec 10 sub $0x10,%esp
char *dst, *src;
dst = vdst;
2a8: 8b 45 08 mov 0x8(%ebp),%eax
2ab: 89 45 fc mov %eax,-0x4(%ebp)
src = vsrc;
2ae: 8b 45 0c mov 0xc(%ebp),%eax
2b1: 89 45 f8 mov %eax,-0x8(%ebp)
while(n-- > 0)
2b4: eb 17 jmp 2cd <memmove+0x2b>
*dst++ = *src++;
2b6: 8b 45 fc mov -0x4(%ebp),%eax
2b9: 8d 50 01 lea 0x1(%eax),%edx
2bc: 89 55 fc mov %edx,-0x4(%ebp)
2bf: 8b 55 f8 mov -0x8(%ebp),%edx
2c2: 8d 4a 01 lea 0x1(%edx),%ecx
2c5: 89 4d f8 mov %ecx,-0x8(%ebp)
2c8: 0f b6 12 movzbl (%edx),%edx
2cb: 88 10 mov %dl,(%eax)
{
char *dst, *src;
dst = vdst;
src = vsrc;
while(n-- > 0)
2cd: 8b 45 10 mov 0x10(%ebp),%eax
2d0: 8d 50 ff lea -0x1(%eax),%edx
2d3: 89 55 10 mov %edx,0x10(%ebp)
2d6: 85 c0 test %eax,%eax
2d8: 7f dc jg 2b6 <memmove+0x14>
*dst++ = *src++;
return vdst;
2da: 8b 45 08 mov 0x8(%ebp),%eax
}
2dd: c9 leave
2de: c3 ret
000002df <fork>:
name: \
movl $SYS_ ## name, %eax; \
int $T_SYSCALL; \
ret
SYSCALL(fork)
2df: b8 01 00 00 00 mov $0x1,%eax
2e4: cd 40 int $0x40
2e6: c3 ret
000002e7 <exit>:
SYSCALL(exit)
2e7: b8 02 00 00 00 mov $0x2,%eax
2ec: cd 40 int $0x40
2ee: c3 ret
000002ef <wait>:
SYSCALL(wait)
2ef: b8 03 00 00 00 mov $0x3,%eax
2f4: cd 40 int $0x40
2f6: c3 ret
000002f7 <pipe>:
SYSCALL(pipe)
2f7: b8 04 00 00 00 mov $0x4,%eax
2fc: cd 40 int $0x40
2fe: c3 ret
000002ff <read>:
SYSCALL(read)
2ff: b8 05 00 00 00 mov $0x5,%eax
304: cd 40 int $0x40
306: c3 ret
00000307 <write>:
SYSCALL(write)
307: b8 10 00 00 00 mov $0x10,%eax
30c: cd 40 int $0x40
30e: c3 ret
0000030f <close>:
SYSCALL(close)
30f: b8 15 00 00 00 mov $0x15,%eax
314: cd 40 int $0x40
316: c3 ret
00000317 <kill>:
SYSCALL(kill)
317: b8 06 00 00 00 mov $0x6,%eax
31c: cd 40 int $0x40
31e: c3 ret
0000031f <exec>:
SYSCALL(exec)
31f: b8 07 00 00 00 mov $0x7,%eax
324: cd 40 int $0x40
326: c3 ret
00000327 <open>:
SYSCALL(open)
327: b8 0f 00 00 00 mov $0xf,%eax
32c: cd 40 int $0x40
32e: c3 ret
0000032f <mknod>:
SYSCALL(mknod)
32f: b8 11 00 00 00 mov $0x11,%eax
334: cd 40 int $0x40
336: c3 ret
00000337 <unlink>:
SYSCALL(unlink)
337: b8 12 00 00 00 mov $0x12,%eax
33c: cd 40 int $0x40
33e: c3 ret
0000033f <fstat>:
SYSCALL(fstat)
33f: b8 08 00 00 00 mov $0x8,%eax
344: cd 40 int $0x40
346: c3 ret
00000347 <link>:
SYSCALL(link)
347: b8 13 00 00 00 mov $0x13,%eax
34c: cd 40 int $0x40
34e: c3 ret
0000034f <mkdir>:
SYSCALL(mkdir)
34f: b8 14 00 00 00 mov $0x14,%eax
354: cd 40 int $0x40
356: c3 ret
00000357 <chdir>:
SYSCALL(chdir)
357: b8 09 00 00 00 mov $0x9,%eax
35c: cd 40 int $0x40
35e: c3 ret
0000035f <dup>:
SYSCALL(dup)
35f: b8 0a 00 00 00 mov $0xa,%eax
364: cd 40 int $0x40
366: c3 ret
00000367 <getpid>:
SYSCALL(getpid)
367: b8 0b 00 00 00 mov $0xb,%eax
36c: cd 40 int $0x40
36e: c3 ret
0000036f <sbrk>:
SYSCALL(sbrk)
36f: b8 0c 00 00 00 mov $0xc,%eax
374: cd 40 int $0x40
376: c3 ret
00000377 <sleep>:
SYSCALL(sleep)
377: b8 0d 00 00 00 mov $0xd,%eax
37c: cd 40 int $0x40
37e: c3 ret
0000037f <uptime>:
SYSCALL(uptime)
37f: b8 0e 00 00 00 mov $0xe,%eax
384: cd 40 int $0x40
386: c3 ret
00000387 <setprio>:
SYSCALL(setprio)
387: b8 16 00 00 00 mov $0x16,%eax
38c: cd 40 int $0x40
38e: c3 ret
0000038f <getprio>:
SYSCALL(getprio)
38f: b8 17 00 00 00 mov $0x17,%eax
394: cd 40 int $0x40
396: c3 ret
00000397 <putc>:
#include "stat.h"
#include "user.h"
static void
putc(int fd, char c)
{
397: 55 push %ebp
398: 89 e5 mov %esp,%ebp
39a: 83 ec 18 sub $0x18,%esp
39d: 8b 45 0c mov 0xc(%ebp),%eax
3a0: 88 45 f4 mov %al,-0xc(%ebp)
write(fd, &c, 1);
3a3: 83 ec 04 sub $0x4,%esp
3a6: 6a 01 push $0x1
3a8: 8d 45 f4 lea -0xc(%ebp),%eax
3ab: 50 push %eax
3ac: ff 75 08 pushl 0x8(%ebp)
3af: e8 53 ff ff ff call 307 <write>
3b4: 83 c4 10 add $0x10,%esp
}
3b7: 90 nop
3b8: c9 leave
3b9: c3 ret
000003ba <printint>:
static void
printint(int fd, int xx, int base, int sgn)
{
3ba: 55 push %ebp
3bb: 89 e5 mov %esp,%ebp
3bd: 53 push %ebx
3be: 83 ec 24 sub $0x24,%esp
static char digits[] = "0123456789ABCDEF";
char buf[16];
int i, neg;
uint x;
neg = 0;
3c1: c7 45 f0 00 00 00 00 movl $0x0,-0x10(%ebp)
if(sgn && xx < 0){
3c8: 83 7d 14 00 cmpl $0x0,0x14(%ebp)
3cc: 74 17 je 3e5 <printint+0x2b>
3ce: 83 7d 0c 00 cmpl $0x0,0xc(%ebp)
3d2: 79 11 jns 3e5 <printint+0x2b>
neg = 1;
3d4: c7 45 f0 01 00 00 00 movl $0x1,-0x10(%ebp)
x = -xx;
3db: 8b 45 0c mov 0xc(%ebp),%eax
3de: f7 d8 neg %eax
3e0: 89 45 ec mov %eax,-0x14(%ebp)
3e3: eb 06 jmp 3eb <printint+0x31>
} else {
x = xx;
3e5: 8b 45 0c mov 0xc(%ebp),%eax
3e8: 89 45 ec mov %eax,-0x14(%ebp)
}
i = 0;
3eb: c7 45 f4 00 00 00 00 movl $0x0,-0xc(%ebp)
do{
buf[i++] = digits[x % base];
3f2: 8b 4d f4 mov -0xc(%ebp),%ecx
3f5: 8d 41 01 lea 0x1(%ecx),%eax
3f8: 89 45 f4 mov %eax,-0xc(%ebp)
3fb: 8b 5d 10 mov 0x10(%ebp),%ebx
3fe: 8b 45 ec mov -0x14(%ebp),%eax
401: ba 00 00 00 00 mov $0x0,%edx
406: f7 f3 div %ebx
408: 89 d0 mov %edx,%eax
40a: 0f b6 80 ac 0a 00 00 movzbl 0xaac(%eax),%eax
411: 88 44 0d dc mov %al,-0x24(%ebp,%ecx,1)
}while((x /= base) != 0);
415: 8b 5d 10 mov 0x10(%ebp),%ebx
418: 8b 45 ec mov -0x14(%ebp),%eax
41b: ba 00 00 00 00 mov $0x0,%edx
420: f7 f3 div %ebx
422: 89 45 ec mov %eax,-0x14(%ebp)
425: 83 7d ec 00 cmpl $0x0,-0x14(%ebp)
429: 75 c7 jne 3f2 <printint+0x38>
if(neg)
42b: 83 7d f0 00 cmpl $0x0,-0x10(%ebp)
42f: 74 2d je 45e <printint+0xa4>
buf[i++] = '-';
431: 8b 45 f4 mov -0xc(%ebp),%eax
434: 8d 50 01 lea 0x1(%eax),%edx
437: 89 55 f4 mov %edx,-0xc(%ebp)
43a: c6 44 05 dc 2d movb $0x2d,-0x24(%ebp,%eax,1)
while(--i >= 0)
43f: eb 1d jmp 45e <printint+0xa4>
putc(fd, buf[i]);
441: 8d 55 dc lea -0x24(%ebp),%edx
444: 8b 45 f4 mov -0xc(%ebp),%eax
447: 01 d0 add %edx,%eax
449: 0f b6 00 movzbl (%eax),%eax
44c: 0f be c0 movsbl %al,%eax
44f: 83 ec 08 sub $0x8,%esp
452: 50 push %eax
453: ff 75 08 pushl 0x8(%ebp)
456: e8 3c ff ff ff call 397 <putc>
45b: 83 c4 10 add $0x10,%esp
buf[i++] = digits[x % base];
}while((x /= base) != 0);
if(neg)
buf[i++] = '-';
while(--i >= 0)
45e: 83 6d f4 01 subl $0x1,-0xc(%ebp)
462: 83 7d f4 00 cmpl $0x0,-0xc(%ebp)
466: 79 d9 jns 441 <printint+0x87>
putc(fd, buf[i]);
}
468: 90 nop
469: 8b 5d fc mov -0x4(%ebp),%ebx
46c: c9 leave
46d: c3 ret
0000046e <printf>:
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
46e: 55 push %ebp
46f: 89 e5 mov %esp,%ebp
471: 83 ec 28 sub $0x28,%esp
char *s;
int c, i, state;
uint *ap;
state = 0;
474: c7 45 ec 00 00 00 00 movl $0x0,-0x14(%ebp)
ap = (uint*)(void*)&fmt + 1;
47b: 8d 45 0c lea 0xc(%ebp),%eax
47e: 83 c0 04 add $0x4,%eax
481: 89 45 e8 mov %eax,-0x18(%ebp)
for(i = 0; fmt[i]; i++){
484: c7 45 f0 00 00 00 00 movl $0x0,-0x10(%ebp)
48b: e9 59 01 00 00 jmp 5e9 <printf+0x17b>
c = fmt[i] & 0xff;
490: 8b 55 0c mov 0xc(%ebp),%edx
493: 8b 45 f0 mov -0x10(%ebp),%eax
496: 01 d0 add %edx,%eax
498: 0f b6 00 movzbl (%eax),%eax
49b: 0f be c0 movsbl %al,%eax
49e: 25 ff 00 00 00 and $0xff,%eax
4a3: 89 45 e4 mov %eax,-0x1c(%ebp)
if(state == 0){
4a6: 83 7d ec 00 cmpl $0x0,-0x14(%ebp)
4aa: 75 2c jne 4d8 <printf+0x6a>
if(c == '%'){
4ac: 83 7d e4 25 cmpl $0x25,-0x1c(%ebp)
4b0: 75 0c jne 4be <printf+0x50>
state = '%';
4b2: c7 45 ec 25 00 00 00 movl $0x25,-0x14(%ebp)
4b9: e9 27 01 00 00 jmp 5e5 <printf+0x177>
} else {
putc(fd, c);
4be: 8b 45 e4 mov -0x1c(%ebp),%eax
4c1: 0f be c0 movsbl %al,%eax
4c4: 83 ec 08 sub $0x8,%esp
4c7: 50 push %eax
4c8: ff 75 08 pushl 0x8(%ebp)
4cb: e8 c7 fe ff ff call 397 <putc>
4d0: 83 c4 10 add $0x10,%esp
4d3: e9 0d 01 00 00 jmp 5e5 <printf+0x177>
}
} else if(state == '%'){
4d8: 83 7d ec 25 cmpl $0x25,-0x14(%ebp)
4dc: 0f 85 03 01 00 00 jne 5e5 <printf+0x177>
if(c == 'd'){
4e2: 83 7d e4 64 cmpl $0x64,-0x1c(%ebp)
4e6: 75 1e jne 506 <printf+0x98>
printint(fd, *ap, 10, 1);
4e8: 8b 45 e8 mov -0x18(%ebp),%eax
4eb: 8b 00 mov (%eax),%eax
4ed: 6a 01 push $0x1
4ef: 6a 0a push $0xa
4f1: 50 push %eax
4f2: ff 75 08 pushl 0x8(%ebp)
4f5: e8 c0 fe ff ff call 3ba <printint>
4fa: 83 c4 10 add $0x10,%esp
ap++;
4fd: 83 45 e8 04 addl $0x4,-0x18(%ebp)
501: e9 d8 00 00 00 jmp 5de <printf+0x170>
} else if(c == 'x' || c == 'p'){
506: 83 7d e4 78 cmpl $0x78,-0x1c(%ebp)
50a: 74 06 je 512 <printf+0xa4>
50c: 83 7d e4 70 cmpl $0x70,-0x1c(%ebp)
510: 75 1e jne 530 <printf+0xc2>
printint(fd, *ap, 16, 0);
512: 8b 45 e8 mov -0x18(%ebp),%eax
515: 8b 00 mov (%eax),%eax
517: 6a 00 push $0x0
519: 6a 10 push $0x10
51b: 50 push %eax
51c: ff 75 08 pushl 0x8(%ebp)
51f: e8 96 fe ff ff call 3ba <printint>
524: 83 c4 10 add $0x10,%esp
ap++;
527: 83 45 e8 04 addl $0x4,-0x18(%ebp)
52b: e9 ae 00 00 00 jmp 5de <printf+0x170>
} else if(c == 's'){
530: 83 7d e4 73 cmpl $0x73,-0x1c(%ebp)
534: 75 43 jne 579 <printf+0x10b>
s = (char*)*ap;
536: 8b 45 e8 mov -0x18(%ebp),%eax
539: 8b 00 mov (%eax),%eax
53b: 89 45 f4 mov %eax,-0xc(%ebp)
ap++;
53e: 83 45 e8 04 addl $0x4,-0x18(%ebp)
if(s == 0)
542: 83 7d f4 00 cmpl $0x0,-0xc(%ebp)
546: 75 25 jne 56d <printf+0xff>
s = "(null)";
548: c7 45 f4 57 08 00 00 movl $0x857,-0xc(%ebp)
while(*s != 0){
54f: eb 1c jmp 56d <printf+0xff>
putc(fd, *s);
551: 8b 45 f4 mov -0xc(%ebp),%eax
554: 0f b6 00 movzbl (%eax),%eax
557: 0f be c0 movsbl %al,%eax
55a: 83 ec 08 sub $0x8,%esp
55d: 50 push %eax
55e: ff 75 08 pushl 0x8(%ebp)
561: e8 31 fe ff ff call 397 <putc>
566: 83 c4 10 add $0x10,%esp
s++;
569: 83 45 f4 01 addl $0x1,-0xc(%ebp)
} else if(c == 's'){
s = (char*)*ap;
ap++;
if(s == 0)
s = "(null)";
while(*s != 0){
56d: 8b 45 f4 mov -0xc(%ebp),%eax
570: 0f b6 00 movzbl (%eax),%eax
573: 84 c0 test %al,%al
575: 75 da jne 551 <printf+0xe3>
577: eb 65 jmp 5de <printf+0x170>
putc(fd, *s);
s++;
}
} else if(c == 'c'){
579: 83 7d e4 63 cmpl $0x63,-0x1c(%ebp)
57d: 75 1d jne 59c <printf+0x12e>
putc(fd, *ap);
57f: 8b 45 e8 mov -0x18(%ebp),%eax
582: 8b 00 mov (%eax),%eax
584: 0f be c0 movsbl %al,%eax
587: 83 ec 08 sub $0x8,%esp
58a: 50 push %eax
58b: ff 75 08 pushl 0x8(%ebp)
58e: e8 04 fe ff ff call 397 <putc>
593: 83 c4 10 add $0x10,%esp
ap++;
596: 83 45 e8 04 addl $0x4,-0x18(%ebp)
59a: eb 42 jmp 5de <printf+0x170>
} else if(c == '%'){
59c: 83 7d e4 25 cmpl $0x25,-0x1c(%ebp)
5a0: 75 17 jne 5b9 <printf+0x14b>
putc(fd, c);
5a2: 8b 45 e4 mov -0x1c(%ebp),%eax
5a5: 0f be c0 movsbl %al,%eax
5a8: 83 ec 08 sub $0x8,%esp
5ab: 50 push %eax
5ac: ff 75 08 pushl 0x8(%ebp)
5af: e8 e3 fd ff ff call 397 <putc>
5b4: 83 c4 10 add $0x10,%esp
5b7: eb 25 jmp 5de <printf+0x170>
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
5b9: 83 ec 08 sub $0x8,%esp
5bc: 6a 25 push $0x25
5be: ff 75 08 pushl 0x8(%ebp)
5c1: e8 d1 fd ff ff call 397 <putc>
5c6: 83 c4 10 add $0x10,%esp
putc(fd, c);
5c9: 8b 45 e4 mov -0x1c(%ebp),%eax
5cc: 0f be c0 movsbl %al,%eax
5cf: 83 ec 08 sub $0x8,%esp
5d2: 50 push %eax
5d3: ff 75 08 pushl 0x8(%ebp)
5d6: e8 bc fd ff ff call 397 <putc>
5db: 83 c4 10 add $0x10,%esp
}
state = 0;
5de: c7 45 ec 00 00 00 00 movl $0x0,-0x14(%ebp)
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
5e5: 83 45 f0 01 addl $0x1,-0x10(%ebp)
5e9: 8b 55 0c mov 0xc(%ebp),%edx
5ec: 8b 45 f0 mov -0x10(%ebp),%eax
5ef: 01 d0 add %edx,%eax
5f1: 0f b6 00 movzbl (%eax),%eax
5f4: 84 c0 test %al,%al
5f6: 0f 85 94 fe ff ff jne 490 <printf+0x22>
putc(fd, c);
}
state = 0;
}
}
}
5fc: 90 nop
5fd: c9 leave
5fe: c3 ret
000005ff <free>:
static Header base;
static Header *freep;
void
free(void *ap)
{
5ff: 55 push %ebp
600: 89 e5 mov %esp,%ebp
602: 83 ec 10 sub $0x10,%esp
Header *bp, *p;
bp = (Header*)ap - 1;
605: 8b 45 08 mov 0x8(%ebp),%eax
608: 83 e8 08 sub $0x8,%eax
60b: 89 45 f8 mov %eax,-0x8(%ebp)
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
60e: a1 c8 0a 00 00 mov 0xac8,%eax
613: 89 45 fc mov %eax,-0x4(%ebp)
616: eb 24 jmp 63c <free+0x3d>
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
618: 8b 45 fc mov -0x4(%ebp),%eax
61b: 8b 00 mov (%eax),%eax
61d: 3b 45 fc cmp -0x4(%ebp),%eax
620: 77 12 ja 634 <free+0x35>
622: 8b 45 f8 mov -0x8(%ebp),%eax
625: 3b 45 fc cmp -0x4(%ebp),%eax
628: 77 24 ja 64e <free+0x4f>
62a: 8b 45 fc mov -0x4(%ebp),%eax
62d: 8b 00 mov (%eax),%eax
62f: 3b 45 f8 cmp -0x8(%ebp),%eax
632: 77 1a ja 64e <free+0x4f>
free(void *ap)
{
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
634: 8b 45 fc mov -0x4(%ebp),%eax
637: 8b 00 mov (%eax),%eax
639: 89 45 fc mov %eax,-0x4(%ebp)
63c: 8b 45 f8 mov -0x8(%ebp),%eax
63f: 3b 45 fc cmp -0x4(%ebp),%eax
642: 76 d4 jbe 618 <free+0x19>
644: 8b 45 fc mov -0x4(%ebp),%eax
647: 8b 00 mov (%eax),%eax
649: 3b 45 f8 cmp -0x8(%ebp),%eax
64c: 76 ca jbe 618 <free+0x19>
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
break;
if(bp + bp->s.size == p->s.ptr){
64e: 8b 45 f8 mov -0x8(%ebp),%eax
651: 8b 40 04 mov 0x4(%eax),%eax
654: 8d 14 c5 00 00 00 00 lea 0x0(,%eax,8),%edx
65b: 8b 45 f8 mov -0x8(%ebp),%eax
65e: 01 c2 add %eax,%edx
660: 8b 45 fc mov -0x4(%ebp),%eax
663: 8b 00 mov (%eax),%eax
665: 39 c2 cmp %eax,%edx
667: 75 24 jne 68d <free+0x8e>
bp->s.size += p->s.ptr->s.size;
669: 8b 45 f8 mov -0x8(%ebp),%eax
66c: 8b 50 04 mov 0x4(%eax),%edx
66f: 8b 45 fc mov -0x4(%ebp),%eax
672: 8b 00 mov (%eax),%eax
674: 8b 40 04 mov 0x4(%eax),%eax
677: 01 c2 add %eax,%edx
679: 8b 45 f8 mov -0x8(%ebp),%eax
67c: 89 50 04 mov %edx,0x4(%eax)
bp->s.ptr = p->s.ptr->s.ptr;
67f: 8b 45 fc mov -0x4(%ebp),%eax
682: 8b 00 mov (%eax),%eax
684: 8b 10 mov (%eax),%edx
686: 8b 45 f8 mov -0x8(%ebp),%eax
689: 89 10 mov %edx,(%eax)
68b: eb 0a jmp 697 <free+0x98>
} else
bp->s.ptr = p->s.ptr;
68d: 8b 45 fc mov -0x4(%ebp),%eax
690: 8b 10 mov (%eax),%edx
692: 8b 45 f8 mov -0x8(%ebp),%eax
695: 89 10 mov %edx,(%eax)
if(p + p->s.size == bp){
697: 8b 45 fc mov -0x4(%ebp),%eax
69a: 8b 40 04 mov 0x4(%eax),%eax
69d: 8d 14 c5 00 00 00 00 lea 0x0(,%eax,8),%edx
6a4: 8b 45 fc mov -0x4(%ebp),%eax
6a7: 01 d0 add %edx,%eax
6a9: 3b 45 f8 cmp -0x8(%ebp),%eax
6ac: 75 20 jne 6ce <free+0xcf>
p->s.size += bp->s.size;
6ae: 8b 45 fc mov -0x4(%ebp),%eax
6b1: 8b 50 04 mov 0x4(%eax),%edx
6b4: 8b 45 f8 mov -0x8(%ebp),%eax
6b7: 8b 40 04 mov 0x4(%eax),%eax
6ba: 01 c2 add %eax,%edx
6bc: 8b 45 fc mov -0x4(%ebp),%eax
6bf: 89 50 04 mov %edx,0x4(%eax)
p->s.ptr = bp->s.ptr;
6c2: 8b 45 f8 mov -0x8(%ebp),%eax
6c5: 8b 10 mov (%eax),%edx
6c7: 8b 45 fc mov -0x4(%ebp),%eax
6ca: 89 10 mov %edx,(%eax)
6cc: eb 08 jmp 6d6 <free+0xd7>
} else
p->s.ptr = bp;
6ce: 8b 45 fc mov -0x4(%ebp),%eax
6d1: 8b 55 f8 mov -0x8(%ebp),%edx
6d4: 89 10 mov %edx,(%eax)
freep = p;
6d6: 8b 45 fc mov -0x4(%ebp),%eax
6d9: a3 c8 0a 00 00 mov %eax,0xac8
}
6de: 90 nop
6df: c9 leave
6e0: c3 ret
000006e1 <morecore>:
static Header*
morecore(uint nu)
{
6e1: 55 push %ebp
6e2: 89 e5 mov %esp,%ebp
6e4: 83 ec 18 sub $0x18,%esp
char *p;
Header *hp;
if(nu < 4096)
6e7: 81 7d 08 ff 0f 00 00 cmpl $0xfff,0x8(%ebp)
6ee: 77 07 ja 6f7 <morecore+0x16>
nu = 4096;
6f0: c7 45 08 00 10 00 00 movl $0x1000,0x8(%ebp)
p = sbrk(nu * sizeof(Header));
6f7: 8b 45 08 mov 0x8(%ebp),%eax
6fa: c1 e0 03 shl $0x3,%eax
6fd: 83 ec 0c sub $0xc,%esp
700: 50 push %eax
701: e8 69 fc ff ff call 36f <sbrk>
706: 83 c4 10 add $0x10,%esp
709: 89 45 f4 mov %eax,-0xc(%ebp)
if(p == (char*)-1)
70c: 83 7d f4 ff cmpl $0xffffffff,-0xc(%ebp)
710: 75 07 jne 719 <morecore+0x38>
return 0;
712: b8 00 00 00 00 mov $0x0,%eax
717: eb 26 jmp 73f <morecore+0x5e>
hp = (Header*)p;
719: 8b 45 f4 mov -0xc(%ebp),%eax
71c: 89 45 f0 mov %eax,-0x10(%ebp)
hp->s.size = nu;
71f: 8b 45 f0 mov -0x10(%ebp),%eax
722: 8b 55 08 mov 0x8(%ebp),%edx
725: 89 50 04 mov %edx,0x4(%eax)
free((void*)(hp + 1));
728: 8b 45 f0 mov -0x10(%ebp),%eax
72b: 83 c0 08 add $0x8,%eax
72e: 83 ec 0c sub $0xc,%esp
731: 50 push %eax
732: e8 c8 fe ff ff call 5ff <free>
737: 83 c4 10 add $0x10,%esp
return freep;
73a: a1 c8 0a 00 00 mov 0xac8,%eax
}
73f: c9 leave
740: c3 ret
00000741 <malloc>:
void*
malloc(uint nbytes)
{
741: 55 push %ebp
742: 89 e5 mov %esp,%ebp
744: 83 ec 18 sub $0x18,%esp
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
747: 8b 45 08 mov 0x8(%ebp),%eax
74a: 83 c0 07 add $0x7,%eax
74d: c1 e8 03 shr $0x3,%eax
750: 83 c0 01 add $0x1,%eax
753: 89 45 ec mov %eax,-0x14(%ebp)
if((prevp = freep) == 0){
756: a1 c8 0a 00 00 mov 0xac8,%eax
75b: 89 45 f0 mov %eax,-0x10(%ebp)
75e: 83 7d f0 00 cmpl $0x0,-0x10(%ebp)
762: 75 23 jne 787 <malloc+0x46>
base.s.ptr = freep = prevp = &base;
764: c7 45 f0 c0 0a 00 00 movl $0xac0,-0x10(%ebp)
76b: 8b 45 f0 mov -0x10(%ebp),%eax
76e: a3 c8 0a 00 00 mov %eax,0xac8
773: a1 c8 0a 00 00 mov 0xac8,%eax
778: a3 c0 0a 00 00 mov %eax,0xac0
base.s.size = 0;
77d: c7 05 c4 0a 00 00 00 movl $0x0,0xac4
784: 00 00 00
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
787: 8b 45 f0 mov -0x10(%ebp),%eax
78a: 8b 00 mov (%eax),%eax
78c: 89 45 f4 mov %eax,-0xc(%ebp)
if(p->s.size >= nunits){
78f: 8b 45 f4 mov -0xc(%ebp),%eax
792: 8b 40 04 mov 0x4(%eax),%eax
795: 3b 45 ec cmp -0x14(%ebp),%eax
798: 72 4d jb 7e7 <malloc+0xa6>
if(p->s.size == nunits)
79a: 8b 45 f4 mov -0xc(%ebp),%eax
79d: 8b 40 04 mov 0x4(%eax),%eax
7a0: 3b 45 ec cmp -0x14(%ebp),%eax
7a3: 75 0c jne 7b1 <malloc+0x70>
prevp->s.ptr = p->s.ptr;
7a5: 8b 45 f4 mov -0xc(%ebp),%eax
7a8: 8b 10 mov (%eax),%edx
7aa: 8b 45 f0 mov -0x10(%ebp),%eax
7ad: 89 10 mov %edx,(%eax)
7af: eb 26 jmp 7d7 <malloc+0x96>
else {
p->s.size -= nunits;
7b1: 8b 45 f4 mov -0xc(%ebp),%eax
7b4: 8b 40 04 mov 0x4(%eax),%eax
7b7: 2b 45 ec sub -0x14(%ebp),%eax
7ba: 89 c2 mov %eax,%edx
7bc: 8b 45 f4 mov -0xc(%ebp),%eax
7bf: 89 50 04 mov %edx,0x4(%eax)
p += p->s.size;
7c2: 8b 45 f4 mov -0xc(%ebp),%eax
7c5: 8b 40 04 mov 0x4(%eax),%eax
7c8: c1 e0 03 shl $0x3,%eax
7cb: 01 45 f4 add %eax,-0xc(%ebp)
p->s.size = nunits;
7ce: 8b 45 f4 mov -0xc(%ebp),%eax
7d1: 8b 55 ec mov -0x14(%ebp),%edx
7d4: 89 50 04 mov %edx,0x4(%eax)
}
freep = prevp;
7d7: 8b 45 f0 mov -0x10(%ebp),%eax
7da: a3 c8 0a 00 00 mov %eax,0xac8
return (void*)(p + 1);
7df: 8b 45 f4 mov -0xc(%ebp),%eax
7e2: 83 c0 08 add $0x8,%eax
7e5: eb 3b jmp 822 <malloc+0xe1>
}
if(p == freep)
7e7: a1 c8 0a 00 00 mov 0xac8,%eax
7ec: 39 45 f4 cmp %eax,-0xc(%ebp)
7ef: 75 1e jne 80f <malloc+0xce>
if((p = morecore(nunits)) == 0)
7f1: 83 ec 0c sub $0xc,%esp
7f4: ff 75 ec pushl -0x14(%ebp)
7f7: e8 e5 fe ff ff call 6e1 <morecore>
7fc: 83 c4 10 add $0x10,%esp
7ff: 89 45 f4 mov %eax,-0xc(%ebp)
802: 83 7d f4 00 cmpl $0x0,-0xc(%ebp)
806: 75 07 jne 80f <malloc+0xce>
return 0;
808: b8 00 00 00 00 mov $0x0,%eax
80d: eb 13 jmp 822 <malloc+0xe1>
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
if((prevp = freep) == 0){
base.s.ptr = freep = prevp = &base;
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
80f: 8b 45 f4 mov -0xc(%ebp),%eax
812: 89 45 f0 mov %eax,-0x10(%ebp)
815: 8b 45 f4 mov -0xc(%ebp),%eax
818: 8b 00 mov (%eax),%eax
81a: 89 45 f4 mov %eax,-0xc(%ebp)
return (void*)(p + 1);
}
if(p == freep)
if((p = morecore(nunits)) == 0)
return 0;
}
81d: e9 6d ff ff ff jmp 78f <malloc+0x4e>
}
822: c9 leave
823: c3 ret
|
src/firmware-tests/Platform/Smps/EnableDisable/EnableDisableSmpsShiftOutTest.asm | pete-restall/Cluck2Sesame-Prototype | 1 | 19325 | #include "Platform.inc"
#include "FarCalls.inc"
#include "Smps.inc"
radix decimal
EnableDisableSmpsShiftOutTest code
global doEnableCall
global doDisableCall
doEnableCall:
fcall enableSmps
return
doDisableCall:
fcall enableSmps
return
end
|
Application Support/BBEdit/Packages/dStyle.bbpackage/Contents/Scripts/Editor action/Move line down.applescript | bhdicaire/bbeditSetup | 0 | 3155 | <filename>Application Support/BBEdit/Packages/dStyle.bbpackage/Contents/Scripts/Editor action/Move line down.applescript
tell application "BBEdit"
local x, myline
set x to startLine of selection
tell text 1 of window 1
if x = (count of lines) then return
set myline to contents of line x
delete line x
if length of line x = 0 then
make line at line x with data "
"
make line at line (x + 1) with data myline
else
make line at line x with data myline
end if
select insertion point before line (x + 1)
end tell
end tell |
tools-src/gnu/gcc/gcc/ada/5vtaprop.adb | enfoTek/tomato.linksys.e2000.nvram-mod | 80 | 10735 | ------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K _ P R I M I T I V E S . O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1991-2001, Florida State University --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This is a OpenVMS/Alpha version of this package
-- This package contains all the GNULL primitives that interface directly
-- with the underlying OS.
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during
-- tasking operations. It causes infinite loops and other problems.
with System.Tasking.Debug;
-- used for Known_Tasks
with Interfaces.C;
-- used for int
-- size_t
with System.Parameters;
-- used for Size_Type
with System.Tasking;
-- used for Ada_Task_Control_Block
-- Task_ID
with System.Soft_Links;
-- used for Defer/Undefer_Abort
-- Set_Exc_Stack_Addr
-- Note that we do not use System.Tasking.Initialization directly since
-- this is a higher level package that we shouldn't depend on. For example
-- when using the restricted run time, it is replaced by
-- System.Tasking.Restricted.Initialization
with System.OS_Primitives;
-- used for Delay_Modes
with Unchecked_Conversion;
with Unchecked_Deallocation;
package body System.Task_Primitives.Operations is
use System.Tasking.Debug;
use System.Tasking;
use Interfaces.C;
use System.OS_Interface;
use System.Parameters;
use System.OS_Primitives;
use type System.OS_Primitives.OS_Time;
package SSL renames System.Soft_Links;
------------------
-- Local Data --
------------------
-- The followings are logically constants, but need to be initialized
-- at run time.
ATCB_Key : aliased pthread_key_t;
-- Key used to find the Ada Task_ID associated with a thread
All_Tasks_L : aliased System.Task_Primitives.RTS_Lock;
-- See comments on locking rules in System.Tasking (spec).
Environment_Task_ID : Task_ID;
-- A variable to hold Task_ID for the environment task.
Time_Slice_Val : Integer;
pragma Import (C, Time_Slice_Val, "__gl_time_slice_val");
Dispatching_Policy : Character;
pragma Import (C, Dispatching_Policy, "__gl_task_dispatching_policy");
FIFO_Within_Priorities : constant Boolean := Dispatching_Policy = 'F';
-- Indicates whether FIFO_Within_Priorities is set.
-----------------------
-- Local Subprograms --
-----------------------
function To_Task_ID is new Unchecked_Conversion (System.Address, Task_ID);
function To_Address is new Unchecked_Conversion (Task_ID, System.Address);
procedure Timer_Sleep_AST (ID : Address);
-- Signal the condition variable when AST fires.
procedure Timer_Sleep_AST (ID : Address) is
Result : Interfaces.C.int;
Self_ID : Task_ID := To_Task_ID (ID);
begin
Self_ID.Common.LL.AST_Pending := False;
Result := pthread_cond_signal_int_np (Self_ID.Common.LL.CV'Access);
end Timer_Sleep_AST;
-------------------
-- Stack_Guard --
-------------------
-- The underlying thread system sets a guard page at the
-- bottom of a thread stack, so nothing is needed.
-- ??? Check the comment above
procedure Stack_Guard (T : ST.Task_ID; On : Boolean) is
begin
null;
end Stack_Guard;
--------------------
-- Get_Thread_Id --
--------------------
function Get_Thread_Id (T : ST.Task_ID) return OSI.Thread_Id is
begin
return T.Common.LL.Thread;
end Get_Thread_Id;
----------
-- Self --
----------
function Self return Task_ID is
Result : System.Address;
begin
Result := pthread_getspecific (ATCB_Key);
pragma Assert (Result /= System.Null_Address);
return To_Task_ID (Result);
end Self;
---------------------
-- Initialize_Lock --
---------------------
-- Note: mutexes and cond_variables needed per-task basis are
-- initialized in Initialize_TCB and the Storage_Error is
-- handled. Other mutexes (such as All_Tasks_Lock, Memory_Lock...)
-- used in RTS is initialized before any status change of RTS.
-- Therefore rasing Storage_Error in the following routines
-- should be able to be handled safely.
procedure Initialize_Lock (Prio : System.Any_Priority; L : access Lock) is
Attributes : aliased pthread_mutexattr_t;
Result : Interfaces.C.int;
begin
Result := pthread_mutexattr_init (Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
raise Storage_Error;
end if;
L.Prio_Save := 0;
L.Prio := Interfaces.C.int (Prio);
Result := pthread_mutex_init (L.L'Access, Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
raise Storage_Error;
end if;
Result := pthread_mutexattr_destroy (Attributes'Access);
pragma Assert (Result = 0);
end Initialize_Lock;
procedure Initialize_Lock (L : access RTS_Lock; Level : Lock_Level) is
Attributes : aliased pthread_mutexattr_t;
Result : Interfaces.C.int;
begin
Result := pthread_mutexattr_init (Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
raise Storage_Error;
end if;
-- Don't use, see comment in s-osinte.ads about ERRORCHECK mutexes.
-- Result := pthread_mutexattr_settype_np
-- (Attributes'Access, PTHREAD_MUTEX_ERRORCHECK_NP);
-- pragma Assert (Result = 0);
-- Result := pthread_mutexattr_setprotocol
-- (Attributes'Access, PTHREAD_PRIO_PROTECT);
-- pragma Assert (Result = 0);
-- Result := pthread_mutexattr_setprioceiling
-- (Attributes'Access, Interfaces.C.int (System.Any_Priority'Last));
-- pragma Assert (Result = 0);
Result := pthread_mutex_init (L, Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
raise Storage_Error;
end if;
Result := pthread_mutexattr_destroy (Attributes'Access);
pragma Assert (Result = 0);
end Initialize_Lock;
-------------------
-- Finalize_Lock --
-------------------
procedure Finalize_Lock (L : access Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_destroy (L.L'Access);
pragma Assert (Result = 0);
end Finalize_Lock;
procedure Finalize_Lock (L : access RTS_Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_destroy (L);
pragma Assert (Result = 0);
end Finalize_Lock;
----------------
-- Write_Lock --
----------------
procedure Write_Lock (L : access Lock; Ceiling_Violation : out Boolean) is
Self_ID : constant Task_ID := Self;
All_Tasks_Link : constant Task_ID := Self.Common.All_Tasks_Link;
Current_Prio : System.Any_Priority;
Result : Interfaces.C.int;
begin
Current_Prio := Get_Priority (Self_ID);
-- If there is no other tasks, no need to check priorities.
if All_Tasks_Link /= Null_Task
and then L.Prio < Interfaces.C.int (Current_Prio)
then
Ceiling_Violation := True;
return;
end if;
Result := pthread_mutex_lock (L.L'Access);
pragma Assert (Result = 0);
Ceiling_Violation := False;
-- Why is this commented out ???
-- L.Prio_Save := Interfaces.C.int (Current_Prio);
-- Set_Priority (Self_ID, System.Any_Priority (L.Prio));
end Write_Lock;
procedure Write_Lock (L : access RTS_Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_lock (L);
pragma Assert (Result = 0);
end Write_Lock;
procedure Write_Lock (T : Task_ID) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_lock (T.Common.LL.L'Access);
pragma Assert (Result = 0);
end Write_Lock;
---------------
-- Read_Lock --
---------------
procedure Read_Lock (L : access Lock; Ceiling_Violation : out Boolean) is
begin
Write_Lock (L, Ceiling_Violation);
end Read_Lock;
------------
-- Unlock --
------------
procedure Unlock (L : access Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_unlock (L.L'Access);
pragma Assert (Result = 0);
end Unlock;
procedure Unlock (L : access RTS_Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_unlock (L);
pragma Assert (Result = 0);
end Unlock;
procedure Unlock (T : Task_ID) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_unlock (T.Common.LL.L'Access);
pragma Assert (Result = 0);
end Unlock;
-------------
-- Sleep --
-------------
procedure Sleep (Self_ID : Task_ID;
Reason : System.Tasking.Task_States) is
Result : Interfaces.C.int;
begin
pragma Assert (Self_ID = Self);
Result := pthread_cond_wait (Self_ID.Common.LL.CV'Access,
Self_ID.Common.LL.L'Access);
-- EINTR is not considered a failure.
pragma Assert (Result = 0 or else Result = EINTR);
if Self_ID.Deferral_Level = 0
and then Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level
then
Unlock (Self_ID);
raise Standard'Abort_Signal;
end if;
end Sleep;
-----------------
-- Timed_Sleep --
-----------------
-- This is for use within the run-time system, so abort is
-- assumed to be already deferred, and the caller should be
-- holding its own ATCB lock.
procedure Timed_Sleep
(Self_ID : Task_ID;
Time : Duration;
Mode : ST.Delay_Modes;
Reason : System.Tasking.Task_States;
Timedout : out Boolean;
Yielded : out Boolean)
is
Sleep_Time : OS_Time;
Result : Interfaces.C.int;
Status : Cond_Value_Type;
begin
Timedout := False;
Yielded := False;
Sleep_Time := To_OS_Time (Time, Mode);
if Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level
or else Self_ID.Pending_Priority_Change
then
return;
end if;
Self_ID.Common.LL.AST_Pending := True;
Sys_Setimr
(Status, 0, Sleep_Time,
Timer_Sleep_AST'Access, To_Address (Self_ID), 0);
if (Status and 1) /= 1 then
raise Storage_Error;
end if;
Result := pthread_cond_wait (Self_ID.Common.LL.CV'Access,
Self_ID.Common.LL.L'Access);
if not Self_ID.Common.LL.AST_Pending then
Timedout := True;
else
Sys_Cantim (Status, To_Address (Self_ID), 0);
pragma Assert ((Status and 1) = 1);
end if;
end Timed_Sleep;
-----------------
-- Timed_Delay --
-----------------
-- This is for use in implementing delay statements, so
-- we assume the caller is abort-deferred but is holding
-- no locks.
procedure Timed_Delay
(Self_ID : Task_ID;
Time : Duration;
Mode : ST.Delay_Modes)
is
Sleep_Time : OS_Time;
Result : Interfaces.C.int;
Status : Cond_Value_Type;
begin
-- Only the little window between deferring abort and
-- locking Self_ID is the reason we need to
-- check for pending abort and priority change below! :(
SSL.Abort_Defer.all;
Write_Lock (Self_ID);
if not (Time = 0.0 and then Mode = Relative) then
Sleep_Time := To_OS_Time (Time, Mode);
if Mode = Relative or else OS_Clock < Sleep_Time then
Self_ID.Common.State := Delay_Sleep;
Self_ID.Common.LL.AST_Pending := True;
Sys_Setimr
(Status, 0, Sleep_Time,
Timer_Sleep_AST'Access, To_Address (Self_ID), 0);
if (Status and 1) /= 1 then
raise Storage_Error;
end if;
loop
if Self_ID.Pending_Priority_Change then
Self_ID.Pending_Priority_Change := False;
Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority;
Set_Priority (Self_ID, Self_ID.Common.Base_Priority);
end if;
if Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level then
Sys_Cantim (Status, To_Address (Self_ID), 0);
pragma Assert ((Status and 1) = 1);
exit;
end if;
Result := pthread_cond_wait (Self_ID.Common.LL.CV'Access,
Self_ID.Common.LL.L'Access);
exit when not Self_ID.Common.LL.AST_Pending;
end loop;
Self_ID.Common.State := Runnable;
end if;
end if;
Unlock (Self_ID);
Result := sched_yield;
SSL.Abort_Undefer.all;
end Timed_Delay;
---------------------
-- Monotonic_Clock --
---------------------
function Monotonic_Clock return Duration
renames System.OS_Primitives.Monotonic_Clock;
-------------------
-- RT_Resolution --
-------------------
function RT_Resolution return Duration is
begin
return 10#1.0#E-3;
end RT_Resolution;
------------
-- Wakeup --
------------
procedure Wakeup (T : Task_ID; Reason : System.Tasking.Task_States) is
Result : Interfaces.C.int;
begin
Result := pthread_cond_signal (T.Common.LL.CV'Access);
pragma Assert (Result = 0);
end Wakeup;
-----------
-- Yield --
-----------
procedure Yield (Do_Yield : Boolean := True) is
Result : Interfaces.C.int;
begin
if Do_Yield then
Result := sched_yield;
end if;
end Yield;
------------------
-- Set_Priority --
------------------
procedure Set_Priority
(T : Task_ID;
Prio : System.Any_Priority;
Loss_Of_Inheritance : Boolean := False)
is
Result : Interfaces.C.int;
Param : aliased struct_sched_param;
begin
T.Common.Current_Priority := Prio;
Param.sched_priority := Interfaces.C.int (Underlying_Priorities (Prio));
if Time_Slice_Val > 0 then
Result := pthread_setschedparam
(T.Common.LL.Thread, SCHED_RR, Param'Access);
elsif FIFO_Within_Priorities or else Time_Slice_Val = 0 then
Result := pthread_setschedparam
(T.Common.LL.Thread, SCHED_FIFO, Param'Access);
else
Result := pthread_setschedparam
(T.Common.LL.Thread, SCHED_OTHER, Param'Access);
end if;
pragma Assert (Result = 0);
end Set_Priority;
------------------
-- Get_Priority --
------------------
function Get_Priority (T : Task_ID) return System.Any_Priority is
begin
return T.Common.Current_Priority;
end Get_Priority;
----------------
-- Enter_Task --
----------------
procedure Enter_Task (Self_ID : Task_ID) is
Result : Interfaces.C.int;
begin
Self_ID.Common.LL.Thread := pthread_self;
-- It is not safe for the new task accept signals until it
-- has bound its TCB pointer to the thread with pthread_setspecific (),
-- since the handler wrappers use the TCB pointer
-- to restore the stack limit.
Result := pthread_setspecific (ATCB_Key, To_Address (Self_ID));
pragma Assert (Result = 0);
Lock_All_Tasks_List;
for I in Known_Tasks'Range loop
if Known_Tasks (I) = null then
Known_Tasks (I) := Self_ID;
Self_ID.Known_Tasks_Index := I;
exit;
end if;
end loop;
Unlock_All_Tasks_List;
end Enter_Task;
--------------
-- New_ATCB --
--------------
function New_ATCB (Entry_Num : Task_Entry_Index) return Task_ID is
begin
return new Ada_Task_Control_Block (Entry_Num);
end New_ATCB;
----------------------
-- Initialize_TCB --
----------------------
procedure Initialize_TCB (Self_ID : Task_ID; Succeeded : out Boolean) is
Mutex_Attr : aliased pthread_mutexattr_t;
Result : Interfaces.C.int;
Cond_Attr : aliased pthread_condattr_t;
begin
Result := pthread_mutexattr_init (Mutex_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result /= 0 then
Succeeded := False;
return;
end if;
-- Don't use, see comment in s-osinte.ads about ERRORCHECK mutexes.
-- Result := pthread_mutexattr_settype_np
-- (Mutex_Attr'Access, PTHREAD_MUTEX_ERRORCHECK_NP);
-- pragma Assert (Result = 0);
-- Result := pthread_mutexattr_setprotocol
-- (Mutex_Attr'Access, PTHREAD_PRIO_PROTECT);
-- pragma Assert (Result = 0);
-- Result := pthread_mutexattr_setprioceiling
-- (Mutex_Attr'Access, Interfaces.C.int (System.Any_Priority'Last));
-- pragma Assert (Result = 0);
Result := pthread_mutex_init (Self_ID.Common.LL.L'Access,
Mutex_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result /= 0 then
Succeeded := False;
return;
end if;
Result := pthread_mutexattr_destroy (Mutex_Attr'Access);
pragma Assert (Result = 0);
Result := pthread_condattr_init (Cond_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result /= 0 then
Result := pthread_mutex_destroy (Self_ID.Common.LL.L'Access);
pragma Assert (Result = 0);
Succeeded := False;
return;
end if;
Result := pthread_cond_init (Self_ID.Common.LL.CV'Access,
Cond_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = 0 then
Succeeded := True;
Self_ID.Common.LL.Exc_Stack_Ptr := new Exc_Stack_T;
SSL.Set_Exc_Stack_Addr
(To_Address (Self_ID),
Self_ID.Common.LL.Exc_Stack_Ptr (Exc_Stack_T'Last)'Address);
else
Result := pthread_mutex_destroy (Self_ID.Common.LL.L'Access);
pragma Assert (Result = 0);
Succeeded := False;
end if;
Result := pthread_condattr_destroy (Cond_Attr'Access);
pragma Assert (Result = 0);
end Initialize_TCB;
-----------------
-- Create_Task --
-----------------
procedure Create_Task
(T : Task_ID;
Wrapper : System.Address;
Stack_Size : System.Parameters.Size_Type;
Priority : System.Any_Priority;
Succeeded : out Boolean)
is
Attributes : aliased pthread_attr_t;
Adjusted_Stack_Size : Interfaces.C.size_t;
Result : Interfaces.C.int;
function Thread_Body_Access is new
Unchecked_Conversion (System.Address, Thread_Body);
begin
if Stack_Size = Unspecified_Size then
Adjusted_Stack_Size := Interfaces.C.size_t (Default_Stack_Size);
elsif Stack_Size < Minimum_Stack_Size then
Adjusted_Stack_Size := Interfaces.C.size_t (Minimum_Stack_Size);
else
Adjusted_Stack_Size := Interfaces.C.size_t (Stack_Size);
end if;
-- Since the initial signal mask of a thread is inherited from the
-- creator, we need to set our local signal mask mask all signals
-- during the creation operation, to make sure the new thread is
-- not disturbed by signals before it has set its own Task_ID.
Result := pthread_attr_init (Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result /= 0 then
Succeeded := False;
return;
end if;
Result := pthread_attr_setdetachstate
(Attributes'Access, PTHREAD_CREATE_DETACHED);
pragma Assert (Result = 0);
Result := pthread_attr_setstacksize
(Attributes'Access, Adjusted_Stack_Size);
pragma Assert (Result = 0);
-- This call may be unnecessary, not sure. ???
Result := pthread_attr_setinheritsched
(Attributes'Access, PTHREAD_EXPLICIT_SCHED);
pragma Assert (Result = 0);
Result := pthread_create
(T.Common.LL.Thread'Access,
Attributes'Access,
Thread_Body_Access (Wrapper),
To_Address (T));
-- ENOMEM is a valid run-time error. Don't shut down.
pragma Assert (Result = 0
or else Result = EAGAIN or else Result = ENOMEM);
Succeeded := Result = 0;
Result := pthread_attr_destroy (Attributes'Access);
pragma Assert (Result = 0);
if Succeeded then
Set_Priority (T, Priority);
end if;
end Create_Task;
------------------
-- Finalize_TCB --
------------------
procedure Finalize_TCB (T : Task_ID) is
Result : Interfaces.C.int;
Tmp : Task_ID := T;
procedure Free is new
Unchecked_Deallocation (Ada_Task_Control_Block, Task_ID);
procedure Free is new Unchecked_Deallocation
(Exc_Stack_T, Exc_Stack_Ptr_T);
begin
Result := pthread_mutex_destroy (T.Common.LL.L'Access);
pragma Assert (Result = 0);
Result := pthread_cond_destroy (T.Common.LL.CV'Access);
pragma Assert (Result = 0);
if T.Known_Tasks_Index /= -1 then
Known_Tasks (T.Known_Tasks_Index) := null;
end if;
Free (T.Common.LL.Exc_Stack_Ptr);
Free (Tmp);
end Finalize_TCB;
---------------
-- Exit_Task --
---------------
procedure Exit_Task is
begin
pthread_exit (System.Null_Address);
end Exit_Task;
----------------
-- Abort_Task --
----------------
procedure Abort_Task (T : Task_ID) is
begin
-- Why is this commented out ???
-- if T = Self and then T.Deferral_Level = 0
-- and then T.Pending_ATC_Level < T.ATC_Nesting_Level
-- then
-- raise Standard'Abort_Signal;
-- end if;
--
-- Interrupt Server_Tasks may be waiting on an event flag
--
if T.Common.State = Interrupt_Server_Blocked_On_Event_Flag then
Wakeup (T, Interrupt_Server_Blocked_On_Event_Flag);
end if;
end Abort_Task;
----------------
-- Check_Exit --
----------------
-- Dummy versions. The only currently working versions is for solaris
-- (native).
function Check_Exit (Self_ID : ST.Task_ID) return Boolean is
begin
return True;
end Check_Exit;
--------------------
-- Check_No_Locks --
--------------------
function Check_No_Locks (Self_ID : ST.Task_ID) return Boolean is
begin
return True;
end Check_No_Locks;
----------------------
-- Environment_Task --
----------------------
function Environment_Task return Task_ID is
begin
return Environment_Task_ID;
end Environment_Task;
-------------------------
-- Lock_All_Tasks_List --
-------------------------
procedure Lock_All_Tasks_List is
begin
Write_Lock (All_Tasks_L'Access);
end Lock_All_Tasks_List;
---------------------------
-- Unlock_All_Tasks_List --
---------------------------
procedure Unlock_All_Tasks_List is
begin
Unlock (All_Tasks_L'Access);
end Unlock_All_Tasks_List;
------------------
-- Suspend_Task --
------------------
function Suspend_Task
(T : ST.Task_ID;
Thread_Self : Thread_Id) return Boolean is
begin
return False;
end Suspend_Task;
-----------------
-- Resume_Task --
-----------------
function Resume_Task
(T : ST.Task_ID;
Thread_Self : Thread_Id) return Boolean is
begin
return False;
end Resume_Task;
----------------
-- Initialize --
----------------
procedure Initialize (Environment_Task : Task_ID) is
begin
Environment_Task_ID := Environment_Task;
Initialize_Lock (All_Tasks_L'Access, All_Tasks_Level);
-- Initialize the lock used to synchronize chain of all ATCBs.
Enter_Task (Environment_Task);
end Initialize;
begin
declare
Result : Interfaces.C.int;
begin
Result := pthread_key_create (ATCB_Key'Access, null);
pragma Assert (Result = 0);
end;
end System.Task_Primitives.Operations;
|
programs/oeis/101/A101328.asm | neoneye/loda | 22 | 17828 | ; A101328: Recurring numbers in the count of consecutive composite numbers between balanced primes and their lower or upper prime neighbors.
; 1,5,11,17,23,29,35,41,47,53,59,65,71,77,83,89,95,101,107,113,119,125,131,137,143,149,155,161,167,173,179,185,191,197,203,209,215,221,227,233,239,245,251,257,263,269,275,281,287,293,299,305,311,317,323,329
mul $0,6
trn $0,2
add $0,1
|
app/src/main/antlr/CTL.g4 | iahmedbacha/ctl-model-checker | 1 | 1200 | grammar CTL;
formula: TRUE # True
| FALSE # False
| PROPOSITION # Proposition
| '(!' formula ')' # Negation
| '(' formula '&' formula ')' # And
| '(' formula '|' formula ')' # Or
| '(' formula '=>' formula ')' # implication
| '(' formula '<=>' formula ')' # equivalence
| 'AX' formula # AX
| 'EX' formula # EX
| 'AF' formula # AF
| 'EF' formula # EF
| 'AG' formula # AG
| 'EG' formula # EG
| 'A[' formula 'U' formula ']' # AU
| 'E[' formula 'U' formula ']' # EU
;
PROPOSITION: [a-z0-9]+ ; // match lowercase letters and digits
TRUE: [+] ; // match boolean true
FALSE: [-] ; // match boolean false
WS : [ \t\r\n]+ -> skip ; // toss out spaces, tabs and newlines
|
test/Succeed/Issue2321.agda | pthariensflame/agda | 3 | 3802 | <reponame>pthariensflame/agda
open import Agda.Builtin.Coinduction
open import Agda.Builtin.Equality
open import Agda.Builtin.List
open import Agda.Builtin.Nat
infixr 5 _∷_
data Stream (A : Set) : Set where
_∷_ : (x : A) (xs : ∞ (Stream A)) → Stream A
head : ∀ {A} → Stream A → A
head (x ∷ xs) = x
tail : ∀ {A} → Stream A → Stream A
tail (x ∷ xs) = ♭ xs
take : ∀ {A} n → Stream A → List A
take zero xs = []
take (suc n) (x ∷ xs) = x ∷ take n (♭ xs)
accepted : ∀ {A} {n} (xs : Stream A) →
take (suc n) xs ≡ take (suc n) (head xs ∷ ♯ tail xs)
accepted (x ∷ xs) = refl
private
rejected : ∀ {A} {n} (xs : Stream A) →
take (suc n) xs ≡ take (suc n) (head xs ∷ ♯ tail xs)
rejected (x ∷ xs) = refl
|
source/RASCAL-Time.ads | bracke/Meaning | 1 | 21599 | <filename>source/RASCAL-Time.ads
--------------------------------------------------------------------------------
-- --
-- Copyright (C) 2004, RISC OS Ada Library (RASCAL) developers. --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU Lesser General Public --
-- License as published by the Free Software Foundation; either --
-- version 2.1 of the License, or (at your option) any later version. --
-- --
-- This library is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Lesser General Public License for more details. --
-- --
-- You should have received a copy of the GNU Lesser General Public --
-- License along with this library; if not, write to the Free Software --
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA --
-- --
--------------------------------------------------------------------------------
-- @brief Time related types and methods.
-- $Author$
-- $Date$
-- $Revision$
with RASCAL.OS; use RASCAL.OS;
with System.Unsigned_Types; use System.Unsigned_Types;
package RASCAL.Time is
type UTC_Time_Type is
record
Word : Unsigned;
Last_Byte : Byte;
end record;
type UTC_Pointer is access UTC_Time_Type;
pragma Convention (C, UTC_Time_Type);
--
-- Returns the time either with or without centiseconds.
-- {fcode}Hour:Minutes:Seconds:Centiseconds{f}
--
function Get_Time (Centi : in boolean := false) return string;
--
-- Returns the date in a format specified by 'Format'.
--
function Get_Date (Format : in string := "%ce%yr-%mn-%dy") return string;
--
-- Returns monotonic time : Number of centiceconds since last hard reset.
--
function Read_MonotonicTime return Integer;
end RASCAL.Time;
|
CSE3030: Assembly Programming/Lecture Notes and Codes From Text/Ch3 - Assembly Language Fundamentals/3.1.1-02_AddTwo_02.asm | yoonBot/Sogang-CSE | 1 | 17002 | .data ; this is the data area
sum DWORD 0 ; create a variable named sum
.code ; this is the code area
main PROC
mov eax, 5 ; move 5 to the eax register
add eax, 6 ; add 6 to the eax register
mov sum, eax ; mov eax register to variable sum
INVOKE ExitProcess ; end the program
main ENDP |
ubb/asc/lab06/loop_example.asm | AlexanderChristian/private_courses | 0 | 84447 | assume cs:code, ds:data
data segment
s db `a`, `v`, `x`, `a`, `c`
;the following declaration has the same meaning:
; s db `avxac`
;the effect of the two instructions is the allocation of one byte for each character of the string, in the same order in which they appear
l EQU $-s
;$ represents the current value of the offset (the number of bytes that were generated by the assembler until this moment within the data segment; in this moment $=5 because there were 5 bytes generated until now, for the characters `a`,`v`,`x`,`a`,`c`)
;by substracting the offset of s from the current offset we obtain the number of bytes of the string s, which represents the number of characters
;we store the obtained number in the constant l
;the following declaration could have also been used:
; l db $-s
;considering that the length of the string could be represented on a byte; the advantage of using EQU will be seen a bit later
d db l dup (?)
;we allocate the space for the resulting string d, which will have the same length as s
;the operator DUP is used for reserving a memory block of length l
;the presence of the character `?` in this declaration has as effect only the reservation of the memory space, without initialization.
;if we would have wanted to initialize the bytes in this memory space with the value 0, we would have used the following declaration:
; d db l dup (0)
;the reason why we can use the value of l in this declaration is the fact that the assignment of the value to the constant l is done during the assembly phase, while if we would have used the following declaration for obtaining the length of the string:
; l db $-s
;then l could not have appeared in the declaration:
; d db l dup (?)
;because the value of l would not have been known during the assembly phase and the following error message would appear at assembly time: `Expecting scalar type`
;another difference between the two variants is the fact that EQU directive does not generate bytes in memmory, therefore no space is allocated for l within the data segment; if we use the db directive for l, a byte is generated.
data ends
code segment
start:
mov ax, data
mov ds, ax
mov cx, l ;we prepare in CX the length of string s, because we will use the loop instruction for repeatedly executing a set of instructions
mov si, 0 ;the register SI will be used as index for the two strings
jcxz Sfarsit ;we will use loop instruction, which executes a set of instructions CX times. We first check if CX is not 0 before entering the loop, if CX is 0 then the loop would be executed 65535 times (because it first decrements 0-1 = -1 = 65535 and the test is done only after that)
Repeta:
mov al, byte ptr s[si] ;we copy in AL the byte found in the data segment at offset s plus SI bytes; we thus obtain the byte of rank SI within the string, where the first byte has the rank 0
;in this moment in AL we have the ASCII code of a small cap letter from source string s
;because of the byte type of s, we couls also use:
; mov al, s[si]
;if we would have had a string of words declared as follows:
; sw dw `a`, `v`, `x`, `a`, `c`
;then the instruction:
; mov al, s[si]
;would have represented a syntax error, generating the error message `Operand types do not match`, because AL is byte and s is word
;in this case we should have used:
; mov al, byte ptr s[si]
;which would have as effect loading AL with the low byte of the word starting at the offset s+SI
;we recall in this context the formula of computing the offset of an operand, which reflects 3 memory addressing modes:
; direct, when only the constant appears;
; based, if BX or BP appears in the formula;
; indexed, if SI or DI appears in the formula;
;offset = [ BX | BP ] + [ DI | SI ] + [ constant ]
sub al, `a`-`A` ;for obtaining the corresponding uppercase letter of the small cap letter whose ASCII code is in AL, we will substract from the ASCII code of the small cap letter the ASCII code of the uppercase letter `a`-`A`, this value represents the difference between any small cap letter and its corresponding uppercase letter
mov byte ptr d[si], al ;we put in d the uppercase letter thus obtained on the same position SI on which the small cap letter is found within the source string s
;we could have also used:
; mov d[si], al
;for the same reason explained above
inc si ;we go to the next byte within the string
loop Repeta
Sfarsit: ;end of program
mov ax, 4C00h
int 21h
code ends
end start
|
src/Dodo/Unary/Unique.agda | sourcedennis/agda-dodo | 0 | 11859 | <filename>src/Dodo/Unary/Unique.agda
{-# OPTIONS --without-K --safe #-}
module Dodo.Unary.Unique where
-- Stdlib imports
open import Level using (Level)
open import Relation.Unary using (Pred)
open import Relation.Binary using (Rel)
-- Local imports
open import Dodo.Nullary.Unique
-- # Definitions #
-- | At most one element satisfies the predicate
Unique₁ : ∀ {a ℓ₁ ℓ₂ : Level} {A : Set a}
→ Rel A ℓ₁ → Pred A ℓ₂ → Set _
Unique₁ _≈_ P = ∀ {x y} → P x → P y → x ≈ y
-- | For every `x`, there exists at most one inhabitant of `P x`.
UniquePred : ∀ {a ℓ : Level} {A : Set a}
→ Pred A ℓ → Set _
UniquePred P = ∀ x → Unique (P x)
|
alloy4fun_models/trashltl/models/3/5bPBiiAbs9NaSNp3u.als | Kaixi26/org.alloytools.alloy | 0 | 3061 | open main
pred id5bPBiiAbs9NaSNp3u_prop4 {
some f: File | eventually always f in Trash
}
pred __repair { id5bPBiiAbs9NaSNp3u_prop4 }
check __repair { id5bPBiiAbs9NaSNp3u_prop4 <=> prop4o } |
agda/MorePropAlgebra/Properties/AlmostPartiallyOrderedField.agda | mchristianl/synthetic-reals | 3 | 15061 | <filename>agda/MorePropAlgebra/Properties/AlmostPartiallyOrderedField.agda
{-# OPTIONS --cubical --no-import-sorts #-}
open import Cubical.Foundations.Everything renaming (_⁻¹ to _⁻¹ᵖ; assoc to ∙-assoc)
open import Function.Base using (_∋_; _$_)
open import Cubical.Data.Sigma renaming (_×_ to infixr 4 _×_)
open import Cubical.Data.Empty renaming (elim to ⊥-elim; ⊥ to ⊥⊥) -- `⊥` and `elim`
open import Cubical.HITs.PropositionalTruncation.Base -- ∣_∣
import Cubical.HITs.PropositionalTruncation.Properties as PTrunc
open import Cubical.Foundations.Logic renaming
( inl to inlᵖ
; inr to inrᵖ
; _⇒_ to infixr 0 _⇒_ -- shifting by -6
; _⇔_ to infixr -2 _⇔_ --
; ∃[]-syntax to infix -4 ∃[]-syntax --
; ∃[∶]-syntax to infix -4 ∃[∶]-syntax --
; ∀[∶]-syntax to infix -4 ∀[∶]-syntax --
; ∀[]-syntax to infix -4 ∀[]-syntax --
)
open import Utils
open import MoreLogic.Reasoning
open import MoreLogic.Definitions renaming
( _ᵗ⇒_ to infixr 0 _ᵗ⇒_
; ∀ᵖ[∶]-syntax to infix -4 ∀ᵖ[∶]-syntax
; ∀ᵖ〚∶〛-syntax to infix -4 ∀ᵖ〚∶〛-syntax
; ∀ᵖ!〚∶〛-syntax to infix -4 ∀ᵖ!〚∶〛-syntax
; ∀〚∶〛-syntax to infix -4 ∀〚∶〛-syntax
; Σᵖ[]-syntax to infix -4 Σᵖ[]-syntax
; Σᵖ[∶]-syntax to infix -4 Σᵖ[∶]-syntax
) hiding (≡ˢ-syntax)
open import MoreLogic.Properties
open import MorePropAlgebra.Definitions hiding (_≤''_)
open import MorePropAlgebra.Consequences
open import MorePropAlgebra.Bundles
module MorePropAlgebra.Properties.AlmostPartiallyOrderedField {ℓ} {ℓ'} (assumptions : AlmostPartiallyOrderedField {ℓ} {ℓ'})
(let F = AlmostPartiallyOrderedField.Carrier assumptions
_≡ˢ_ = λ(x y : F) → MoreLogic.Definitions.≡ˢ-syntax x y {AlmostPartiallyOrderedField.is-set assumptions}
infixl 4 _≡ˢ_
) where
import MorePropAlgebra.Properties.Group
module Group'Properties = MorePropAlgebra.Properties.Group record { AlmostPartiallyOrderedField assumptions ; is-Group = AlmostPartiallyOrderedField.+-Group assumptions }
module Group' = Group record { AlmostPartiallyOrderedField assumptions ; is-Group = AlmostPartiallyOrderedField.+-Group assumptions }
( Group') = Group ∋ record { AlmostPartiallyOrderedField assumptions ; is-Group = AlmostPartiallyOrderedField.+-Group assumptions }
module GroupLemmas' = Group'Properties.GroupLemmas'
import MorePropAlgebra.Properties.Ring
module Ring'Properties = MorePropAlgebra.Properties.Ring record { AlmostPartiallyOrderedField assumptions }
module Ring' = Ring record { AlmostPartiallyOrderedField assumptions }
( Ring') = Ring ∋ record { AlmostPartiallyOrderedField assumptions }
module RingTheory' = Ring'Properties.RingTheory'
open AlmostPartiallyOrderedField assumptions -- renaming (Carrier to F; _-_ to _-_)
-- Bridges' definition of _≤__
_≤''_ : hPropRel F F (ℓ-max ℓ ℓ')
x ≤'' y = ∀[ ε ] (y < ε) ⇒ (x < ε)
infixl 4 _≤''_
private
-- infixl 4 _≡ˢ_
-- _≡ˢ_ = λ(x y : F) → MoreLogic.Definitions.≡ˢ-syntax x y {is-set} -- [ is-set ] x ≡ˢ y
≡ˢ-sym : ∀ a b → [ (a ≡ˢ b) ⇔ (b ≡ˢ a) ]
≡ˢ-sym a b .fst a≡b = sym a≡b
≡ˢ-sym a b .snd b≡a = sym b≡a
≡ˢ-symᵗ : ∀ a b → (a ≡ˢ b) ≡ (b ≡ˢ a)
≡ˢ-symᵗ a b = let (p , q) = ≡ˢ-sym a b in ⇔toPath p q
abstract
-dist' : ∀ a b → -(a + b) ≡ (- b) + (- a)
-dist : ∀ a b → -(a + b) ≡ (- a) + (- b)
·-inv#0 : ∀ x y → x · y ≡ 1f → [ (x # 0f) ⊓ (y # 0f) ]
·-reflects-≡ : (a b c : F) → [ c # 0f ⇒ (a · c ≡ˢ b · c) ⇒ (a ≡ˢ b) ]; _ : [ operation _·_ reflects _≡ˢ_ when (λ c → c # 0f) ]; _ = ·-reflects-≡
·-rinv-unique'' : (x y z : F) → [ x · y ≡ˢ 1f ] → [ x · z ≡ˢ 1f ] → [ y ≡ˢ z ]
_⁻¹'' : ∀ x → {{[ x # 0f ]}} → Σ[ y ∈ F ] x · y ≡ 1f
_⁻¹ : ∀ x → {{[ x # 0f ]}} → F
infix 9 _⁻¹
·-rinv : ∀ x → (p : [ x # 0f ]) → [ x · (x ⁻¹) {{p}} ≡ˢ 1f ]
·-linv : ∀ x → (p : [ x # 0f ]) → [ (x ⁻¹) {{p}} · x ≡ˢ 1f ]
·-linv-unique : (x y : F) → x · y ≡ 1f → (p : [ y # 0f ]) → x ≡ (y ⁻¹) {{p}}
<-≤-trans : ∀ x y z → [ x < y ⇒ y ≤ z ⇒ x < z ]
≤-<-trans : ∀ x y z → [ x ≤ y ⇒ y < z ⇒ x < z ]
≤-⇔-≤'' : ∀ x y → [ (x ≤ y) ⇔ (x ≤'' y) ]
≤-reflects-≡ : ∀ x y → [ (∀[ z ] z ≤ x ⇔ z ≤ y) ⇔ x ≡ˢ y ]
-dist' a b = GroupLemmas'.invDistr a b
-dist a b = -dist' a b ∙ +-comm _ _
·-inv#0 x y x·y≡1 .fst = ·-inv'' x .fst ∣ (y , x·y≡1) ∣
·-inv#0 x y x·y≡1 .snd = ·-inv'' y .fst ∣ (x , ·-comm y x ∙ x·y≡1) ∣
·-reflects-≡ a b c p = PTrunc.rec (isProp[] ((a · c ≡ˢ b · c) ⇒ (a ≡ˢ b) )) γ (·-inv'' c .snd p) where
γ : Σ[ c⁻¹ ∈ F ] [ c · c⁻¹ ≡ˢ 1f ] → [ (a · c ≡ˢ b · c) ⇒ a ≡ˢ b ]
γ (c⁻¹ , c·c⁻¹≡1) a·c≡b·c =
a ≡⟨ sym (fst (·-identity a)) ∙ cong (a ·_) (sym c·c⁻¹≡1) ∙ ·-assoc _ _ _ ⟩
(a · c) · (c⁻¹) ≡⟨ cong (_· c⁻¹) a·c≡b·c ⟩
(b · c) · (c⁻¹) ≡⟨ sym (·-assoc _ _ _) ∙ cong (b ·_) c·c⁻¹≡1 ∙ fst (·-identity b) ⟩
b ∎
-- uniqueness of inverses from `·-assoc` + `·-comm` + `·-lid` + `·-rid`
·-rinv-unique'' x y z x·y≡1 x·z≡1 =
( x · y ≡ˢ 1f ⇒ᵖ⟨ (λ x·y≡1 i → z · x·y≡1 i) ⟩
z · (x · y) ≡ˢ z · 1f ⇒ᵖ⟨ pathTo⇒ (λ i → ·-assoc z x y i ≡ˢ ·-rid z i) ⟩
(z · x) · y ≡ˢ z ⇒ᵖ⟨ pathTo⇒ (λ i → (·-comm z x i) · y ≡ˢ z) ⟩
(x · z) · y ≡ˢ z ⇒ᵖ⟨ pathTo⇒ (λ i → x·z≡1 i · y ≡ˢ z) ⟩
1f · y ≡ˢ z ⇒ᵖ⟨ pathTo⇒ (λ i → ·-lid y i ≡ˢ z) ⟩
y ≡ˢ z ◼ᵖ) .snd x·y≡1
-- inverse function from `·-rinv-unique''` and `∀[ x ] (∃[ y ] x · y ≡ˢ 1f) ⇔ x # 0f`
(x ⁻¹'') {{x#0f}} = PTrunc.rec γ (λ p → p) (·-inv'' x .snd x#0f) where
γ : isProp (Σ[ y ∈ F ] x · y ≡ 1f)
γ (a , x·a≡1) (b , x·b≡1) = let a≡b = ·-rinv-unique'' x a b x·a≡1 x·b≡1
in Σ≡Prop (λ c → isProp[] (x · c ≡ˢ 1f)) a≡b
(x ⁻¹) {{p}} = (x ⁻¹'') .fst
·-rinv x p = (x ⁻¹'') {{p}} .snd
·-linv x p = ·-comm _ _ ∙ ·-rinv x p
·-linv-unique x y x·y≡1 p = sym $ ·-rinv-unique'' y ((y ⁻¹) {{p}}) x (·-rinv y p) (·-comm _ _ ∙ x·y≡1)
<-≤-trans x y z x<y y≤z = ⊔-elim (x < z) (z < y) (λ _ → x < z) (λ x<z → x<z) (λ z<y → ⊥-elim (y≤z z<y)) (<-cotrans _ _ x<y z)
≤-<-trans x y z x≤y y<z = ⊔-elim (y < x) (x < z) (λ _ → x < z) (λ y<x → ⊥-elim (x≤y y<x)) (λ x<z → x<z) (<-cotrans y z y<z x)
-- Booij's _≤_ ⇔ Brigdes' _≤''_
≤-⇔-≤'' x y .fst x≤y ε y<ε = ≤-<-trans x y ε x≤y y<ε
≤-⇔-≤'' x y .snd x≤''y y<x = <-irrefl x (x≤''y x y<x)
≤-reflects-≡ x y .fst z≤x⇔z≤y = ≤-antisym x y (z≤x⇔z≤y x .fst (≤-refl x)) (z≤x⇔z≤y y .snd (≤-refl y))
≤-reflects-≡ x y .snd x≡y z .fst = subst (λ p → [ z ≤ p ]) x≡y
≤-reflects-≡ x y .snd x≡y z .snd = subst (λ p → [ z ≤ p ]) (sym x≡y)
|
x86-64/programs/fizzbuzz.asm | ShineyDev/assembly | 1 | 87741 | <reponame>ShineyDev/assembly
; ---------------------------------------------------------------------
; /x86-64/programs/fizzbuzz.asm
;
; An x86-64 assembly which writes FizzBuzz, up too 100, to STDOUT.
;
; Requires:
; math
; write
; ---------------------------------------------------------------------
global _start
extern modulo
extern write
extern write_integer
section .text
_start:
mov r12, 1
_start_write_loop:
mov rdi, r12
mov rsi, 15
call modulo
test rax, rax ; r12 % 15 == 0
jz _start_write_loop_15
mov rdi, r12
mov rsi, 5
call modulo
test rax, rax ; r12 % 5 == 0
jz _start_write_loop_5
mov rdi, r12
mov rsi, 3
call modulo
test rax, rax ; r12 % 3 == 0
jz _start_write_loop_3
mov rdi, 1
mov rsi, r12
call write_integer
jmp _start_write_loop_sep
_start_write_loop_3:
mov rdi, 1
mov rsi, fizz
mov rdx, 4
call write
jmp _start_write_loop_sep
_start_write_loop_5:
mov rdi, 1
mov rsi, buzz
mov rdx, 4
call write
jmp _start_write_loop_sep
_start_write_loop_15:
mov rdi, 1
mov rsi, fizz
mov rdx, 8
call write
_start_write_loop_sep:
mov rdi, 1
mov rsi, sp_
mov rdx, 1
call write
inc r12
cmp r12, 101
jne _start_write_loop
mov rdi, 1
mov rsi, lf_
mov rdx, 1
call write
mov rax, 60
xor rdi, rdi
syscall
section .data
fizz: db "fizz"
buzz: db "buzz"
sp_: db 0x20
lf_: db 0x0A
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3106a.ada | best08618/asylo | 7 | 21578 | -- CE3106A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT CLOSING A FILE HAS THE FOLLOWING EFFECT:
-- 1) IF THERE IS NO LINE TERMINATOR, A LINE TERMINATOR, PAGE
-- TERMINATOR, AND FILE TERMINATOR ARE WRITTEN AT THE END
-- OF THE FILE.
-- 2) IF THERE IS A LINE TERMINATOR BUT NO PAGE TERMINATOR, A
-- PAGE TERMINATOR AND A FILE TERMINATOR ARE WRITTEN.
-- 3) IF THERE IS A PAGE TERMINATOR, A FILE TERMINATOR IS
-- WRITTEN.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- TEXT FILES.
-- HISTORY:
-- JLH 07/08/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
WITH TEXT_IO; USE TEXT_IO;
PROCEDURE CE3106A IS
INCOMPLETE : EXCEPTION;
FILE1, FILE2, FILE3 : FILE_TYPE;
ITEM : CHARACTER;
BEGIN
TEST ("CE3106A", "CHECK THAT CLOSING A FILE HAS THE CORRECT " &
"EFFECT ON THE FILE CONCERNING LINE, PAGE, " &
"AND FILE TERMINATORS");
BEGIN
BEGIN
CREATE (FILE1, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON CREATE " &
"WITH MODE OUT_FILE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED ON CREATE" &
"WITH MODE OUT_FILE");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED ON CREATE");
RAISE INCOMPLETE;
END;
PUT (FILE1, 'A');
NEW_LINE (FILE1);
PUT (FILE1, 'B');
CLOSE (FILE1);
BEGIN
OPEN (FILE1, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON TEXT OPEN " &
"WITH MODE IN_FILE");
RAISE INCOMPLETE;
END;
GET (FILE1, ITEM);
IF LINE (FILE1) /= 1 THEN
FAILED ("INCORRECT LINE NUMBER - 1");
END IF;
GET (FILE1, ITEM);
IF ITEM /= 'B' THEN
FAILED ("INCORRECT VALUE READ - 1");
END IF;
IF LINE (FILE1) /= 2 THEN
FAILED ("INCORRECT LINE NUMBER - 2");
END IF;
IF NOT END_OF_LINE (FILE1) THEN
FAILED ("LINE TERMINATOR NOT WRITTEN WHEN FILE " &
"IS CLOSED");
END IF;
IF NOT END_OF_PAGE (FILE1) THEN
FAILED ("PAGE TERMINATOR NOT WRITTEN WHEN FILE " &
"IS CLOSED");
END IF;
IF NOT END_OF_FILE (FILE1) THEN
FAILED ("FILE TERMINATOR NOT WRITTEN WHEN FILE " &
"IS CLOSED");
END IF;
BEGIN
DELETE (FILE1);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
CREATE (FILE2, OUT_FILE, LEGAL_FILE_NAME(2));
PUT (FILE2, 'A');
NEW_LINE (FILE2);
PUT (FILE2, 'B');
NEW_PAGE (FILE2);
PUT (FILE2, 'C');
NEW_LINE (FILE2);
CLOSE (FILE2);
OPEN (FILE2, IN_FILE, LEGAL_FILE_NAME(2));
GET (FILE2, ITEM);
GET (FILE2, ITEM);
IF ITEM /= 'B' THEN
FAILED ("INCORRECT VALUE READ - 2");
END IF;
IF LINE (FILE2) /= 2 THEN
FAILED ("INCORRECT LINE NUMBER - 3");
END IF;
GET (FILE2, ITEM);
IF LINE (FILE2) /= 1 THEN
FAILED ("INCORRECT LINE NUMBER - 4");
END IF;
IF PAGE (FILE2) /= 2 THEN
FAILED ("INCORRECT PAGE NUMBER - 1");
END IF;
IF NOT END_OF_PAGE (FILE2) THEN
FAILED ("PAGE TERMINATOR NOT WRITTEN WHEN FILE " &
"IS CLOSED - 2");
END IF;
IF NOT END_OF_FILE (FILE2) THEN
FAILED ("FILE TERMINATOR NOT WRITTEN WHEN FILE " &
"IS CLOSED - 2");
END IF;
BEGIN
DELETE (FILE2);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
CREATE (FILE3, OUT_FILE, LEGAL_FILE_NAME(3));
PUT (FILE3, 'A');
NEW_PAGE (FILE3);
PUT (FILE3, 'B');
NEW_PAGE (FILE3);
NEW_LINE (FILE3);
PUT (FILE3, 'C');
NEW_PAGE (FILE3);
CLOSE (FILE3);
OPEN (FILE3, IN_FILE, LEGAL_FILE_NAME(3));
GET (FILE3, ITEM);
GET (FILE3, ITEM);
IF ITEM /= 'B' THEN
FAILED ("INCORRECT VALUE READ - 3");
END IF;
GET (FILE3, ITEM);
IF LINE (FILE3) /= 2 THEN
FAILED ("INCORRECT LINE NUMBER - 5");
END IF;
IF PAGE (FILE3) /= 3 THEN
FAILED ("INCORRECT PAGE NUMBER - 2");
END IF;
IF NOT END_OF_FILE (FILE3) THEN
FAILED ("FILE TERMINATOR NOT WRITTEN WHEN FILE " &
"IS CLOSED - 3");
END IF;
BEGIN
DELETE (FILE3);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
EXCEPTION
WHEN INCOMPLETE =>
NULL;
END;
RESULT;
END CE3106A;
|
Browser Scripting.applescript | wezm/Password-Composer | 2 | 3110 | <reponame>wezm/Password-Composer<filename>Browser Scripting.applescript
-- http://daringfireball.net/2009/01/applescripts_targetting_safari_or_webkit
on getCurrentSafariUrl(_browser)
using terms from application "Safari"
tell application _browser
return URL of the first document as Unicode text
end tell
end using terms from
end getCurrentSafariUrl
on getCurrentFirefoxUrl()
-- Does not support necessary AppleScript
end getCurrentFirefoxUrl
on getCurrentChromeUrl()
-- Does not support necessary AppleScript
end getCurrentChromeUrl
on getCurrentOperaUrl()
-- Does not support necessary AppleScript
end getCurrentOperaUrl
on getCurrentCaminoUrl(_browser)
using terms from application "Camino"
tell application _browser
return the URL of the current tab of the first browser window
end tell
end using terms from
end getCurrentCaminoUrl |
libsrc/fcntl/dummy/rename.asm | meesokim/z88dk | 0 | 99356 | ; Dummy file libs
;
PUBLIC rename
.rename
ld hl,-1 ;error
ret
|
test/Succeed/fol-theorems/Existential.agda | asr/apia | 10 | 16965 | ------------------------------------------------------------------------------
-- Testing the existential quantifier
------------------------------------------------------------------------------
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module Existential where
postulate
D : Set
A : D → Set
∃ : (A : D → Set) → Set
postulate foo : (∃ λ x → A x) → (∃ λ x → A x)
{-# ATP prove foo #-}
|
Plugins/System/GrowlAction/main.applescript | nochkin/growl | 121 | 3506 | -- main.applescript
-- GrowlAction
-- IMPORTANT: Remember to save the compiled script to main.scpt before committing!
on run {input_items, parameters}
set the output_items to input_items
set the notification_title to (|notificationTitle| of parameters) as string
set the notification_description to ""
set testParams to parameters & {|notificationDescription|:"ZOMG SUPER SEKRIT TESTING STRING"}
if (|notificationDescription| of testParams is not "ZOMG SUPER SEKRIT TESTING STRING") then
set the notification_description to (|notificationDescription| of parameters) as string
end if
if the notification_description is ""
set notification_description to (input_items) as string
end if
set the notification_priority to (priority of parameters) as integer
set the notification_sticky to (sticky of parameters) as boolean
tell application "GrowlHelperApp"
register as application "Automator" all notifications {"Automator notification"} default notifications {"Automator notification"} icon of application "Automator"
notify with name "Automator notification" title notification_title description notification_description application name "Automator" sticky notification_sticky priority notification_priority
end tell
return input_items
end run
|
oeis/056/A056170.asm | neoneye/loda-programs | 11 | 27312 | ; A056170: Number of non-unitary prime divisors of n.
; Submitted by <NAME>
; 0,0,0,1,0,0,0,1,1,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1,1,0,1,1,0,0,0,1,0,0,0,2,0,0,0,1,0,0,0,1,1,0,0,1,1,1,0,1,0,1,0,1,0,0,0,1,0,0,1,1,0,0,0,1,0,0,0,2,0,0,1,1,0,0,0,1,1,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,1,2
seq $0,57918 ; Number of pairs of numbers (a,b) each less than n where (a,b,n) is in geometric progression.
seq $0,1221 ; Number of distinct primes dividing n (also called omega(n)).
|
source/sql/sql-queries-holders.adb | svn2github/matreshka | 24 | 23078 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016, <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$
------------------------------------------------------------------------------
package body SQL.Queries.Holders is
function First_Column
(Self : aliased SQL_Query)
return League.Holders.Iterable_Holder_Cursors.Cursor'Class;
package Column_Holders is new League.Holders.Generic_Iterable_Holders
(Element_Type => SQL_Query,
First => First_Column);
-----------------------------------
-- Query_Iterable_Holder_Cursors --
-----------------------------------
package Query_Iterable_Holder_Cursors is
type Cursor is new League.Holders.Iterable_Holder_Cursors.Cursor
with record
Data : SQL_Query;
end record;
overriding function Next (Self : in out Cursor) return Boolean;
overriding function Element (Self : Cursor) return League.Holders.Holder;
end Query_Iterable_Holder_Cursors;
package body Query_Iterable_Holder_Cursors is
-------------
-- Element --
-------------
overriding function Element
(Self : Cursor) return League.Holders.Holder is
begin
return Column_Holders.To_Holder (Self.Data);
end Element;
----------
-- Next --
----------
overriding function Next (Self : in out Cursor) return Boolean is
begin
return Self.Data.Next;
end Next;
end Query_Iterable_Holder_Cursors;
------------------------------------
-- Column_Iterable_Holder_Cursors --
------------------------------------
package Column_Iterable_Holder_Cursors is
type Cursor is new League.Holders.Iterable_Holder_Cursors.Cursor
with record
Data : SQL_Query;
Index : Natural := 0;
end record;
overriding function Next (Self : in out Cursor) return Boolean;
overriding function Element (Self : Cursor) return League.Holders.Holder;
end Column_Iterable_Holder_Cursors;
package body Column_Iterable_Holder_Cursors is
-------------
-- Element --
-------------
overriding function Element
(Self : Cursor) return League.Holders.Holder is
begin
return Self.Data.Value (Self.Index);
end Element;
----------
-- Next --
----------
overriding function Next (Self : in out Cursor) return Boolean is
begin
Self.Index := Self.Index + 1;
return Self.Index < 3; -- FIXME
end Next;
end Column_Iterable_Holder_Cursors;
-----------
-- First --
-----------
function First
(Self : aliased SQL_Query)
return League.Holders.Iterable_Holder_Cursors.Cursor'Class is
begin
return Query_Iterable_Holder_Cursors.Cursor'(Data => Self);
end First;
------------------
-- First_Column --
------------------
function First_Column
(Self : aliased SQL_Query)
return League.Holders.Iterable_Holder_Cursors.Cursor'Class is
begin
return Column_Iterable_Holder_Cursors.Cursor'(Self, 0);
end First_Column;
-------------
-- Element --
-------------
function Element (Self : League.Holders.Holder) return SQL_Query
renames Holders.Element;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Self : in out League.Holders.Holder; To : SQL_Query)
renames Holders.Replace_Element;
---------------
-- To_Holder --
---------------
function To_Holder (Item : SQL_Query) return League.Holders.Holder
renames Holders.To_Holder;
end SQL.Queries.Holders;
|
test/asset/agda-stdlib-1.0/Algebra/FunctionProperties/Consequences/Core.agda | omega12345/agda-mode | 0 | 4119 | <filename>test/asset/agda-stdlib-1.0/Algebra/FunctionProperties/Consequences/Core.agda
------------------------------------------------------------------------
-- The Agda standard library
--
-- Relations between properties of functions, such as associativity and
-- commutativity (only those that don't require any sort of setoid)
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
module Algebra.FunctionProperties.Consequences.Core
{a} {A : Set a} where
open import Algebra.FunctionProperties
open import Data.Sum
open import Relation.Binary
sel⇒idem : ∀ {ℓ} {_•_ : Op₂ A} (_≈_ : Rel A ℓ) →
Selective _≈_ _•_ → Idempotent _≈_ _•_
sel⇒idem _ sel x with sel x x
... | inj₁ x•x≈x = x•x≈x
... | inj₂ x•x≈x = x•x≈x
|
test/03-nested-alternations.g4 | nsumner/antlr2cnf | 3 | 2899 | <filename>test/03-nested-alternations.g4
grammar test04;
entry: a;
a: b (c|d);
b: '0';
c: '1';
d: '2';
|
Transynther/x86/_processed/AVXALIGN/_st_sm_/i7-8650U_0xd2_notsx.log_573_1260.asm | ljhsiun2/medusa | 9 | 103171 | .global s_prepare_buffers
s_prepare_buffers:
ret
.global s_faulty_load
s_faulty_load:
push %r12
push %r13
push %r8
push %r9
push %rcx
push %rdi
push %rsi
// REPMOV
lea addresses_normal+0x16ee7, %rsi
lea addresses_UC+0x18200, %rdi
sub %r13, %r13
mov $4, %rcx
rep movsb
nop
nop
nop
nop
and %r13, %r13
// Store
lea addresses_D+0x1fae7, %rcx
add $50769, %r13
movw $0x5152, (%rcx)
nop
nop
nop
nop
nop
add $51982, %rcx
// Store
lea addresses_A+0x18b67, %r8
inc %r13
movl $0x51525354, (%r8)
nop
nop
nop
nop
nop
add %r13, %r13
// Faulty Load
lea addresses_D+0x1fae7, %rsi
nop
nop
sub %r13, %r13
movb (%rsi), %r8b
lea oracles, %rdi
and $0xff, %r8
shlq $12, %r8
mov (%rdi,%r8,1), %r8
pop %rsi
pop %rdi
pop %rcx
pop %r9
pop %r8
pop %r13
pop %r12
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_D', 'size': 32, 'AVXalign': True, 'NT': False, 'congruent': 0, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_normal', 'congruent': 9, 'same': False}, 'dst': {'type': 'addresses_UC', 'congruent': 0, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_D', 'size': 2, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
{'OP': 'STOR', 'dst': {'type': 'addresses_A', 'size': 4, 'AVXalign': False, 'NT': False, 'congruent': 5, 'same': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_D', 'size': 1, 'AVXalign': True, 'NT': False, 'congruent': 0, 'same': True}}
<gen_prepare_buffer>
{'52': 573}
52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52
*/
|
oeis/183/A183690.asm | neoneye/loda-programs | 11 | 2567 | <reponame>neoneye/loda-programs<filename>oeis/183/A183690.asm<gh_stars>10-100
; A183690: Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock nonsingular.
; Submitted by <NAME>(s4)
; 50,314,1970,12362,77570,486746,3054290,19165418,120261410,754630394,4735243250,29713259402,186448243010,1169947290266,7341322395410,46066190299178,289061530659170,1813837175689274,11381678123719730,71419088024112842,448148865110322050,2812097029744512986,17645676069605141330,110725156585981810538,694791191486750183330,4359757210121605400954,27357115582502028471410,171663635593482985564682,1077175102627431155594690,6759184597885019662490906,42413323810444547557212050,266140095835302895085987498
mov $1,1
lpb $0
sub $0,1
mov $2,$1
mul $2,2
add $3,2
mov $1,$3
mul $1,4
add $2,$3
mov $3,$2
sub $3,1
add $3,$1
lpe
mov $0,$3
mul $0,24
add $0,50
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xca_notsx.log_21829_1784.asm | ljhsiun2/medusa | 9 | 170883 | .global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r9
push %rax
push %rcx
push %rdi
lea addresses_normal_ht+0x1cd46, %rdi
sub %r9, %r9
mov (%rdi), %r12
nop
nop
nop
cmp $53815, %rcx
lea addresses_A_ht+0x6b2e, %r12
add %rax, %rax
movups (%r12), %xmm1
vpextrq $1, %xmm1, %rdi
nop
nop
nop
nop
and $59253, %r12
pop %rdi
pop %rcx
pop %rax
pop %r9
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r9
push %rbp
push %rdi
push %rsi
// Faulty Load
lea addresses_WC+0x19a4e, %rsi
nop
nop
nop
dec %r10
mov (%rsi), %bp
lea oracles, %r9
and $0xff, %rbp
shlq $12, %rbp
mov (%r9,%rbp,1), %rbp
pop %rsi
pop %rdi
pop %rbp
pop %r9
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_WC', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 0}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'same': True, 'type': 'addresses_WC', 'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_normal_ht', 'NT': False, 'AVXalign': False, 'size': 8, 'congruent': 2}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_A_ht', 'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 3}}
{'38': 21829}
38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38 38
*/
|
subprojects/cfa/src/main/antlr/CfaDsl.g4 | radl97/theta | 0 | 1896 | /*
* Copyright 2017 Budapest University of Technology and Economics
*
* 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.
*/
grammar CfaDsl;
// S P E C I F I C A T I O N
spec: (varDecls+=varDecl | procDecls+=procDecl)*
;
varDecl
: VAR ddecl=decl
;
procDecl
: (main=MAIN)? PROCESS id=ID (LPAREN (paramDecls=declList)? RPAREN)? LBRAC
(varDecls+=varDecl | locs+=loc | edges+=edge)*
RBRAC
;
loc : (init=INIT | finall=FINAL | error=ERROR)? LOC id=ID
;
edge: source=ID RARROW target=ID (LBRAC
(stmts+=stmt)*
RBRAC)?
;
VAR : 'var'
;
MAIN: 'main'
;
PROCESS
: 'process'
;
INIT: 'init'
;
FINAL
: 'final'
;
ERROR
: 'error'
;
LOC : 'loc'
;
// D E C L A R A T I O N S
decl: name=ID COLON ttype=type
;
declList
: (decls+=decl)(COMMA decls+=decl)*
;
// T Y P E S
type: boolType
| intType
| ratType
| funcType
| arrayType
;
typeList
: (types+=type)(COMMA types+=type)*
;
boolType
: BOOLTYPE
;
intType
: INTTYPE
;
ratType
: RATTYPE
;
funcType
: LPAREN paramTypes=typeList RPAREN RARROW returnType=type
;
arrayType
: LBRACK indexType=type RBRACK RARROW elemType=type
;
BOOLTYPE
: 'bool'
;
INTTYPE
: 'int'
;
RATTYPE
: 'rat'
;
// E X P R E S S I O N S
expr: funcLitExpr
;
exprList
: (exprs+=expr)(COMMA exprs+=expr)*
;
funcLitExpr
: iteExpr
| LPAREN (paramDecls=declList)? RPAREN RARROW result=funcLitExpr
;
iteExpr
: iffExpr
| IF cond=expr THEN then=expr ELSE elze=iteExpr
;
iffExpr
: leftOp=implyExpr (IFF rightOp=iffExpr)?
;
implyExpr
: leftOp=quantifiedExpr (IMPLY rightOp=implyExpr)?
;
quantifiedExpr
: orExpr
| forallExpr
| existsExpr
;
forallExpr
: FORALL LPAREN paramDecls=declList RPAREN op=quantifiedExpr
;
existsExpr
: EXISTS LPAREN paramDecls=declList RPAREN op=quantifiedExpr
;
orExpr
: ops+=andExpr (OR ops+=andExpr)*
;
andExpr
: ops+=notExpr (AND ops+=notExpr)*
;
notExpr
: equalityExpr
| NOT op=equalityExpr
;
equalityExpr
: leftOp=relationExpr (oper=(EQ | NEQ) rightOp=relationExpr)?
;
relationExpr
: leftOp=additiveExpr (oper=(LT | LEQ | GT | GEQ) rightOp=additiveExpr)?
;
additiveExpr
: ops+=multiplicativeExpr (opers+=(PLUS | MINUS) ops+=multiplicativeExpr)*
;
multiplicativeExpr
: ops+=negExpr (opers+=(MUL | DIV | MOD | REM) ops+=negExpr)*
;
negExpr
: accessorExpr
| MINUS op=negExpr
;
accessorExpr
: op=primaryExpr (accesses+=access)*
;
access
: params=funcAccess
| readIndex=arrayReadAccess
| writeIndex=arrayWriteAccess
| prime=primeAccess
;
funcAccess
: LPAREN (params=exprList)? RPAREN
;
arrayReadAccess
: LBRACK index=expr RBRACK
;
arrayWriteAccess
: LBRACK index=expr LARROW elem=expr RBRACK
;
primeAccess
: QUOT
;
primaryExpr
: trueExpr
| falseExpr
| intLitExpr
| ratLitExpr
| idExpr
| parenExpr
;
trueExpr
: TRUE
;
falseExpr
: FALSE
;
intLitExpr
: value=INT
;
ratLitExpr
: num=INT PERCENT denom=INT
;
idExpr
: id=ID
;
parenExpr
: LPAREN op=expr RPAREN
;
////
IF : 'if'
;
THEN: 'then'
;
ELSE: 'else'
;
IFF : 'iff'
;
IMPLY
: 'imply'
;
FORALL
: 'forall'
;
EXISTS
: 'exists'
;
OR : 'or'
;
AND : 'and'
;
NOT : 'not'
;
EQ : '='
;
NEQ : '/='
;
LT : '<'
;
LEQ : '<='
;
GT : '>'
;
GEQ : '>='
;
PLUS: '+'
;
MINUS
: '-'
;
MUL : '*'
;
DIV : '/'
;
MOD : 'mod'
;
REM : 'rem'
;
PERCENT
: '%'
;
TRUE: 'true'
;
FALSE
: 'false'
;
// S T A T E M E N T S
stmt: assignStmt
| havocStmt
| assumeStmt
| returnStmt
;
stmtList
: (stmts+=stmt)(SEMICOLON stmts+=stmt)
;
assignStmt
: lhs=ID ASSIGN value=expr
;
havocStmt
: HAVOC lhs=ID
;
assumeStmt
: ASSUME cond=expr
;
returnStmt
: RETURN value=expr
;
//
ASSIGN
: ':='
;
HAVOC
: 'havoc'
;
ASSUME
: 'assume'
;
RETURN
: 'return'
;
// B A S I C T O K E N S
INT : SIGN? NAT
;
NAT : DIGIT+
;
SIGN: PLUS | MINUS
;
DOT : '.'
;
ID : (LETTER | UNDERSCORE) (LETTER | UNDERSCORE | DIGIT)*
;
UNDERSCORE
: '_'
;
DIGIT
: [0-9]
;
LETTER
: [a-zA-Z]
;
LPAREN
: '('
;
RPAREN
: ')'
;
LBRACK
: '['
;
RBRACK
: ']'
;
LBRAC
: '{'
;
RBRAC
: '}'
;
COMMA
: ','
;
COLON
: ':'
;
SEMICOLON
: ';'
;
QUOT: '\''
;
LARROW
: '<-'
;
RARROW
: '->'
;
// Whitespace and comments
WS : [ \t\r\n\u000C]+ -> skip
;
COMMENT
: '/*' .*? '*/' -> skip
;
LINE_COMMENT
: '//' ~[\r\n]* -> skip
;
|
src/dnscatcher/network/udp/dnscatcher-network-udp-sender.ads | DNSCatcher/DNSCatcher | 4 | 26684 | -- Copyright 2019 <NAME> <<EMAIL>>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to
-- deal in the Software without restriction, including without limitation the
-- rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-- sell copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
with DNSCatcher.Network;
with DNSCatcher.Datasets; use DNSCatcher.Datasets;
-- @summary
-- Implements the Sender interface queue for UDP messages
--
-- @description
-- The outbound packet queue is used to handle all requests either being sent
-- to a client, or sending requests to upstream servers for results
--
package DNSCatcher.Network.UDP.Sender is
-- Send queue management task
task type Send_Packet_Task is
-- Initializes the sender queue
--
-- @value Socket
-- GNAT.Sockets Socket_Type
--
-- @value Packet_Queue
-- Raw package queue to use with the sender module
entry Initialize
(Socket : Socket_Type;
Packet_Queue : DNS_Raw_Packet_Queue_Ptr);
-- Starts the sender task
entry Start;
-- Stops the sender task
entry Stop;
end Send_Packet_Task;
type Send_Packet_Task_Ptr is access Send_Packet_Task;
-- UDP Sender interface used to queue outbound packets
--
-- @value Config
-- Configuration Pointer
--
-- @value Sender_Socket
-- Socket for the UDP port
--
-- @value Sender_Task
-- Internal pointer to the Sender task
--
-- @value Packet_Queue
-- Internal queue for packets to be sent
--
type UDP_Sender_Interface is new DNSCatcher.Network.Sender_Interface with
record
Sender_Socket : Socket_Type;
Sender_Task : Send_Packet_Task_Ptr;
Packet_Queue : DNS_Raw_Packet_Queue_Ptr;
end record;
type IPv4_UDP_Receiver_Interface_Ptr is access UDP_Sender_Interface;
-- Initializes the sender class interface
--
-- @value This
-- Class object
--
-- @value Config
-- Pointer to the configuration object
--
-- @value Socket
-- GNAT.Socket to use for UDP connections
procedure Initialize
(This : in out UDP_Sender_Interface;
Socket : Socket_Type);
-- Starts the interface
--
-- @value This
-- Class Object
procedure Start (This : in out UDP_Sender_Interface);
-- Cleanly shuts down the interface
--
-- @value This
-- Class Object
procedure Shutdown (This : in out UDP_Sender_Interface);
-- Returns the internal packet queue for this interface
--
-- @value This
-- Clas object
--
-- @returns
-- Pointer to the packet queue
--
function Get_Packet_Queue_Ptr
(This : in out UDP_Sender_Interface)
return DNS_Raw_Packet_Queue_Ptr;
end DNSCatcher.Network.UDP.Sender;
|
BUCLE.asm | Craziertexas/INTEL-5180---ASSEMBLER | 0 | 5498 | MAIN: MOV R1,#0FH
REST: DEC R1
MOV A,R1
JNZ REST
CPL P1.0
JZ MAIN
|
zfp-gba/gnat/s-stalib.ads | 98devin/ada-gba-dev | 7 | 25056 | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S T A N D A R D _ L I B R A R Y --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- SweetAda SFP cutted-down version --
------------------------------------------------------------------------------
-- This package is included in all programs. It contains declarations that
-- are required to be part of every Ada program. A special mechanism is
-- required to ensure that these are loaded, since it may be the case in
-- some programs that the only references to these required packages are
-- from C code or from code generated directly by Gigi, and in both cases
-- the binder is not aware of such references.
-- System.Standard_Library also includes data that must be present in every
-- program, in particular data for all the standard exceptions, and also some
-- subprograms that must be present in every program.
-- The binder unconditionally includes s-stalib.ali, which ensures that this
-- package and the packages it references are included in all Ada programs,
-- together with the included data.
pragma Compiler_Unit_Warning;
-- with Ada.Unchecked_Conversion;
package System.Standard_Library is
-- Historical note: pragma Preelaborate was surrounded by a pair of pragma
-- Warnings (Off/On) to circumvent a bootstrap issue.
pragma Preelaborate;
-------------------------------------
-- Exception Declarations and Data --
-------------------------------------
type Raise_Action is access procedure;
pragma Favor_Top_Level (Raise_Action);
-- A pointer to a procedure used in the Raise_Hook field
type Exception_Data;
type Exception_Data_Ptr is access all Exception_Data;
-- An equivalent of Exception_Id that is public
-- The following record defines the underlying representation of exceptions
-- WARNING: Any changes to this may need to be reflected in the following
-- locations in the compiler and runtime code:
-- 1. The Internal_Exception routine in s-exctab.adb
-- 2. The processing in gigi that tests Not_Handled_By_Others
-- 3. Expand_N_Exception_Declaration in Exp_Ch11
-- 4. The construction of the exception type in Cstand
type Exception_Data is record
Not_Handled_By_Others : Boolean;
-- Normally set False, indicating that the exception is handled in the
-- usual way by others (i.e. an others handler handles the exception).
-- Set True to indicate that this exception is not caught by others
-- handlers, but must be explicitly named in a handler. This latter
-- setting is currently used by the Abort_Signal.
Lang : Character;
-- A character indicating the language raising the exception.
-- Set to "A" for exceptions defined by an Ada program.
-- Set to "C" for imported C++ exceptions.
Name_Length : Natural;
-- Length of fully expanded name of exception
Full_Name : System.Address;
-- Fully expanded name of exception, null terminated
-- You can use To_Ptr to convert this to a string.
HTable_Ptr : Exception_Data_Ptr;
-- Hash table pointer used to link entries together in the hash table
-- built (by Register_Exception in s-exctab.adb) for converting between
-- identities and names.
Foreign_Data : Address;
-- Data for imported exceptions. Not used in the Ada case. This
-- represents the address of the RTTI for the C++ case.
Raise_Hook : Raise_Action;
-- This field can be used to place a "hook" on an exception. If the
-- value is non-null, then it points to a procedure which is called
-- whenever the exception is raised. This call occurs immediately,
-- before any other actions taken by the raise (and in particular
-- before any unwinding of the stack occurs).
end record;
-- Definitions for standard predefined exceptions defined in Standard,
-- Why are the NULs necessary here, seems like they should not be
-- required, since Gigi is supposed to add a Nul to each name ???
Constraint_Error_Name : constant String := "CONSTRAINT_ERROR" & ASCII.NUL;
Program_Error_Name : constant String := "PROGRAM_ERROR" & ASCII.NUL;
Storage_Error_Name : constant String := "STORAGE_ERROR" & ASCII.NUL;
Tasking_Error_Name : constant String := "TASKING_ERROR" & ASCII.NUL;
Abort_Signal_Name : constant String := "_ABORT_SIGNAL" & ASCII.NUL;
Numeric_Error_Name : constant String := "NUMERIC_ERROR" & ASCII.NUL;
-- This is used only in the Ada 83 case, but it is not worth having a
-- separate version of s-stalib.ads for use in Ada 83 mode.
Constraint_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Constraint_Error_Name'Length,
Full_Name => Constraint_Error_Name'Address,
HTable_Ptr => null,
Foreign_Data => Null_Address,
Raise_Hook => null);
Numeric_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Numeric_Error_Name'Length,
Full_Name => Numeric_Error_Name'Address,
HTable_Ptr => null,
Foreign_Data => Null_Address,
Raise_Hook => null);
Program_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Program_Error_Name'Length,
Full_Name => Program_Error_Name'Address,
HTable_Ptr => null,
Foreign_Data => Null_Address,
Raise_Hook => null);
Storage_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Storage_Error_Name'Length,
Full_Name => Storage_Error_Name'Address,
HTable_Ptr => null,
Foreign_Data => Null_Address,
Raise_Hook => null);
Tasking_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Tasking_Error_Name'Length,
Full_Name => Tasking_Error_Name'Address,
HTable_Ptr => null,
Foreign_Data => Null_Address,
Raise_Hook => null);
Abort_Signal_Def : aliased Exception_Data :=
(Not_Handled_By_Others => True,
Lang => 'A',
Name_Length => Abort_Signal_Name'Length,
Full_Name => Abort_Signal_Name'Address,
HTable_Ptr => null,
Foreign_Data => Null_Address,
Raise_Hook => null);
pragma Export (C, Constraint_Error_Def, "constraint_error");
pragma Export (C, Numeric_Error_Def, "numeric_error");
pragma Export (C, Program_Error_Def, "program_error");
pragma Export (C, Storage_Error_Def, "storage_error");
pragma Export (C, Tasking_Error_Def, "tasking_error");
pragma Export (C, Abort_Signal_Def, "_abort_signal");
-- Binder variables
main_priority : Integer
with Export, External_Name => "__gl_main_priority";
time_slice_val : Integer
with Export, External_Name => "__gl_time_slice_val";
wc_encoding : Integer
with Export, External_Name => "__gl_wc_encoding";
locking_policy : Integer
with Export, External_Name => "__gl_locking_policy";
queuing_policy : Integer
with Export, External_Name => "__gl_queuing_policy";
task_dispatching_policy : Integer
with Export, External_Name => "__gl_task_dispatching_policy";
priority_specific_dispatching : Integer
with Export, External_Name => "__gl_priority_specific_dispatching";
num_specific_dispatching : Integer
with Export, External_Name => "__gl_num_specific_dispatching";
main_cpu : Integer
with Export, External_Name => "__gl_main_cpu";
interrupt_states : Integer
with Export, External_Name => "__gl_interrupt_states";
num_interrupt_states : Integer
with Export, External_Name => "__gl_num_interrupt_states";
unreserve_all_interrupts : Integer
with Export, External_Name => "__gl_unreserve_all_interrupts";
detect_blocking : Integer
with Export, External_Name => "__gl_detect_blocking";
default_stack_size : Integer
with Export, External_Name => "__gl_default_stack_size";
procedure GNAT_Initialize is null
with Export, External_Name => "__gnat_initialize";
procedure GNAT_Finalize is null
with Export, External_Name => "__gnat_finalize";
procedure GNAT_Runtime_Initialize is null
with Export, External_Name => "__gnat_runtime_initialize";
procedure GNAT_Runtime_Finalize is null
with Export, External_Name => "__gnat_runtime_finalize";
procedure Adafinal is null;
end System.Standard_Library;
|
valid.asm | igenext/8051-Valid-BCD-Check | 0 | 169506 | mov r2,#0 //No. of Valid BCDs
mov r3,#0 //No. of Invalid BCDs
mov r0,#0ah //total numbers
mov r1,#20h //starting RAM memory location
l1:mov a,@r1
mov b,a
add a,#06h
jnb ac,l2
inc r3
sjmp l5
l2:mov a,b
swap a
add a,#06h
jnb ac,l4
inc r3
sjmp l5
l4:
inc r2
l5:
inc r1
djnz r0,l1
end |
agda/Text/Greek/SBLGNT/2Thess.agda | scott-fleischman/GreekGrammar | 44 | 8461 | <reponame>scott-fleischman/GreekGrammar
module Text.Greek.SBLGNT.2Thess where
open import Data.List
open import Text.Greek.Bible
open import Text.Greek.Script
open import Text.Greek.Script.Unicode
ΠΡΟΣ-ΘΕΣΣΑΛΟΝΙΚΕΙΣ-Β : List (Word)
ΠΡΟΣ-ΘΕΣΣΑΛΟΝΙΚΕΙΣ-Β =
word (Π ∷ α ∷ ῦ ∷ ∙λ ∷ ο ∷ ς ∷ []) "2Thess.1.1"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.1"
∷ word (Σ ∷ ι ∷ ∙λ ∷ ο ∷ υ ∷ α ∷ ν ∷ ὸ ∷ ς ∷ []) "2Thess.1.1"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.1"
∷ word (Τ ∷ ι ∷ μ ∷ ό ∷ θ ∷ ε ∷ ο ∷ ς ∷ []) "2Thess.1.1"
∷ word (τ ∷ ῇ ∷ []) "2Thess.1.1"
∷ word (ἐ ∷ κ ∷ κ ∷ ∙λ ∷ η ∷ σ ∷ ί ∷ ᾳ ∷ []) "2Thess.1.1"
∷ word (Θ ∷ ε ∷ σ ∷ σ ∷ α ∷ ∙λ ∷ ο ∷ ν ∷ ι ∷ κ ∷ έ ∷ ω ∷ ν ∷ []) "2Thess.1.1"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.1"
∷ word (θ ∷ ε ∷ ῷ ∷ []) "2Thess.1.1"
∷ word (π ∷ α ∷ τ ∷ ρ ∷ ὶ ∷ []) "2Thess.1.1"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.1"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.1"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ῳ ∷ []) "2Thess.1.1"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.1.1"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ῷ ∷ []) "2Thess.1.1"
∷ word (χ ∷ ά ∷ ρ ∷ ι ∷ ς ∷ []) "2Thess.1.2"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.1.2"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.2"
∷ word (ε ∷ ἰ ∷ ρ ∷ ή ∷ ν ∷ η ∷ []) "2Thess.1.2"
∷ word (ἀ ∷ π ∷ ὸ ∷ []) "2Thess.1.2"
∷ word (θ ∷ ε ∷ ο ∷ ῦ ∷ []) "2Thess.1.2"
∷ word (π ∷ α ∷ τ ∷ ρ ∷ ὸ ∷ ς ∷ []) "2Thess.1.2"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.2"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.1.2"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.1.2"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.2"
∷ word (Ε ∷ ὐ ∷ χ ∷ α ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ε ∷ ῖ ∷ ν ∷ []) "2Thess.1.3"
∷ word (ὀ ∷ φ ∷ ε ∷ ί ∷ ∙λ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.1.3"
∷ word (τ ∷ ῷ ∷ []) "2Thess.1.3"
∷ word (θ ∷ ε ∷ ῷ ∷ []) "2Thess.1.3"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ο ∷ τ ∷ ε ∷ []) "2Thess.1.3"
∷ word (π ∷ ε ∷ ρ ∷ ὶ ∷ []) "2Thess.1.3"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.3"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ί ∷ []) "2Thess.1.3"
∷ word (κ ∷ α ∷ θ ∷ ὼ ∷ ς ∷ []) "2Thess.1.3"
∷ word (ἄ ∷ ξ ∷ ι ∷ ό ∷ ν ∷ []) "2Thess.1.3"
∷ word (ἐ ∷ σ ∷ τ ∷ ι ∷ ν ∷ []) "2Thess.1.3"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.1.3"
∷ word (ὑ ∷ π ∷ ε ∷ ρ ∷ α ∷ υ ∷ ξ ∷ ά ∷ ν ∷ ε ∷ ι ∷ []) "2Thess.1.3"
∷ word (ἡ ∷ []) "2Thess.1.3"
∷ word (π ∷ ί ∷ σ ∷ τ ∷ ι ∷ ς ∷ []) "2Thess.1.3"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.3"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.3"
∷ word (π ∷ ∙λ ∷ ε ∷ ο ∷ ν ∷ ά ∷ ζ ∷ ε ∷ ι ∷ []) "2Thess.1.3"
∷ word (ἡ ∷ []) "2Thess.1.3"
∷ word (ἀ ∷ γ ∷ ά ∷ π ∷ η ∷ []) "2Thess.1.3"
∷ word (ἑ ∷ ν ∷ ὸ ∷ ς ∷ []) "2Thess.1.3"
∷ word (ἑ ∷ κ ∷ ά ∷ σ ∷ τ ∷ ο ∷ υ ∷ []) "2Thess.1.3"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ω ∷ ν ∷ []) "2Thess.1.3"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.3"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.1.3"
∷ word (ἀ ∷ ∙λ ∷ ∙λ ∷ ή ∷ ∙λ ∷ ο ∷ υ ∷ ς ∷ []) "2Thess.1.3"
∷ word (ὥ ∷ σ ∷ τ ∷ ε ∷ []) "2Thess.1.4"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ὺ ∷ ς ∷ []) "2Thess.1.4"
∷ word (ἡ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.1.4"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.4"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.1.4"
∷ word (ἐ ∷ γ ∷ κ ∷ α ∷ υ ∷ χ ∷ ᾶ ∷ σ ∷ θ ∷ α ∷ ι ∷ []) "2Thess.1.4"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.4"
∷ word (τ ∷ α ∷ ῖ ∷ ς ∷ []) "2Thess.1.4"
∷ word (ἐ ∷ κ ∷ κ ∷ ∙λ ∷ η ∷ σ ∷ ί ∷ α ∷ ι ∷ ς ∷ []) "2Thess.1.4"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.4"
∷ word (θ ∷ ε ∷ ο ∷ ῦ ∷ []) "2Thess.1.4"
∷ word (ὑ ∷ π ∷ ὲ ∷ ρ ∷ []) "2Thess.1.4"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.1.4"
∷ word (ὑ ∷ π ∷ ο ∷ μ ∷ ο ∷ ν ∷ ῆ ∷ ς ∷ []) "2Thess.1.4"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.4"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.4"
∷ word (π ∷ ί ∷ σ ∷ τ ∷ ε ∷ ω ∷ ς ∷ []) "2Thess.1.4"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.4"
∷ word (π ∷ ᾶ ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.4"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.4"
∷ word (δ ∷ ι ∷ ω ∷ γ ∷ μ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.4"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.4"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.4"
∷ word (τ ∷ α ∷ ῖ ∷ ς ∷ []) "2Thess.1.4"
∷ word (θ ∷ ∙λ ∷ ί ∷ ψ ∷ ε ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.4"
∷ word (α ∷ ἷ ∷ ς ∷ []) "2Thess.1.4"
∷ word (ἀ ∷ ν ∷ έ ∷ χ ∷ ε ∷ σ ∷ θ ∷ ε ∷ []) "2Thess.1.4"
∷ word (ἔ ∷ ν ∷ δ ∷ ε ∷ ι ∷ γ ∷ μ ∷ α ∷ []) "2Thess.1.5"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.1.5"
∷ word (δ ∷ ι ∷ κ ∷ α ∷ ί ∷ α ∷ ς ∷ []) "2Thess.1.5"
∷ word (κ ∷ ρ ∷ ί ∷ σ ∷ ε ∷ ω ∷ ς ∷ []) "2Thess.1.5"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.5"
∷ word (θ ∷ ε ∷ ο ∷ ῦ ∷ []) "2Thess.1.5"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.1.5"
∷ word (τ ∷ ὸ ∷ []) "2Thess.1.5"
∷ word (κ ∷ α ∷ τ ∷ α ∷ ξ ∷ ι ∷ ω ∷ θ ∷ ῆ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.1.5"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.1.5"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.1.5"
∷ word (β ∷ α ∷ σ ∷ ι ∷ ∙λ ∷ ε ∷ ί ∷ α ∷ ς ∷ []) "2Thess.1.5"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.5"
∷ word (θ ∷ ε ∷ ο ∷ ῦ ∷ []) "2Thess.1.5"
∷ word (ὑ ∷ π ∷ ὲ ∷ ρ ∷ []) "2Thess.1.5"
∷ word (ἧ ∷ ς ∷ []) "2Thess.1.5"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.5"
∷ word (π ∷ ά ∷ σ ∷ χ ∷ ε ∷ τ ∷ ε ∷ []) "2Thess.1.5"
∷ word (ε ∷ ἴ ∷ π ∷ ε ∷ ρ ∷ []) "2Thess.1.6"
∷ word (δ ∷ ί ∷ κ ∷ α ∷ ι ∷ ο ∷ ν ∷ []) "2Thess.1.6"
∷ word (π ∷ α ∷ ρ ∷ ὰ ∷ []) "2Thess.1.6"
∷ word (θ ∷ ε ∷ ῷ ∷ []) "2Thess.1.6"
∷ word (ἀ ∷ ν ∷ τ ∷ α ∷ π ∷ ο ∷ δ ∷ ο ∷ ῦ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.1.6"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.6"
∷ word (θ ∷ ∙λ ∷ ί ∷ β ∷ ο ∷ υ ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.6"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.1.6"
∷ word (θ ∷ ∙λ ∷ ῖ ∷ ψ ∷ ι ∷ ν ∷ []) "2Thess.1.6"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.7"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.1.7"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.7"
∷ word (θ ∷ ∙λ ∷ ι ∷ β ∷ ο ∷ μ ∷ έ ∷ ν ∷ ο ∷ ι ∷ ς ∷ []) "2Thess.1.7"
∷ word (ἄ ∷ ν ∷ ε ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.7"
∷ word (μ ∷ ε ∷ θ ∷ []) "2Thess.1.7"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.7"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.7"
∷ word (τ ∷ ῇ ∷ []) "2Thess.1.7"
∷ word (ἀ ∷ π ∷ ο ∷ κ ∷ α ∷ ∙λ ∷ ύ ∷ ψ ∷ ε ∷ ι ∷ []) "2Thess.1.7"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.7"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.1.7"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.1.7"
∷ word (ἀ ∷ π ∷ []) "2Thess.1.7"
∷ word (ο ∷ ὐ ∷ ρ ∷ α ∷ ν ∷ ο ∷ ῦ ∷ []) "2Thess.1.7"
∷ word (μ ∷ ε ∷ τ ∷ []) "2Thess.1.7"
∷ word (ἀ ∷ γ ∷ γ ∷ έ ∷ ∙λ ∷ ω ∷ ν ∷ []) "2Thess.1.7"
∷ word (δ ∷ υ ∷ ν ∷ ά ∷ μ ∷ ε ∷ ω ∷ ς ∷ []) "2Thess.1.7"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.7"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.8"
∷ word (φ ∷ ∙λ ∷ ο ∷ γ ∷ ὶ ∷ []) "2Thess.1.8"
∷ word (π ∷ υ ∷ ρ ∷ ό ∷ ς ∷ []) "2Thess.1.8"
∷ word (δ ∷ ι ∷ δ ∷ ό ∷ ν ∷ τ ∷ ο ∷ ς ∷ []) "2Thess.1.8"
∷ word (ἐ ∷ κ ∷ δ ∷ ί ∷ κ ∷ η ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.8"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.8"
∷ word (μ ∷ ὴ ∷ []) "2Thess.1.8"
∷ word (ε ∷ ἰ ∷ δ ∷ ό ∷ σ ∷ ι ∷ []) "2Thess.1.8"
∷ word (θ ∷ ε ∷ ὸ ∷ ν ∷ []) "2Thess.1.8"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.8"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.8"
∷ word (μ ∷ ὴ ∷ []) "2Thess.1.8"
∷ word (ὑ ∷ π ∷ α ∷ κ ∷ ο ∷ ύ ∷ ο ∷ υ ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.8"
∷ word (τ ∷ ῷ ∷ []) "2Thess.1.8"
∷ word (ε ∷ ὐ ∷ α ∷ γ ∷ γ ∷ ε ∷ ∙λ ∷ ί ∷ ῳ ∷ []) "2Thess.1.8"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.8"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.1.8"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.8"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.1.8"
∷ word (ο ∷ ἵ ∷ τ ∷ ι ∷ ν ∷ ε ∷ ς ∷ []) "2Thess.1.9"
∷ word (δ ∷ ί ∷ κ ∷ η ∷ ν ∷ []) "2Thess.1.9"
∷ word (τ ∷ ί ∷ σ ∷ ο ∷ υ ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.9"
∷ word (ὄ ∷ ∙λ ∷ ε ∷ θ ∷ ρ ∷ ο ∷ ν ∷ []) "2Thess.1.9"
∷ word (α ∷ ἰ ∷ ώ ∷ ν ∷ ι ∷ ο ∷ ν ∷ []) "2Thess.1.9"
∷ word (ἀ ∷ π ∷ ὸ ∷ []) "2Thess.1.9"
∷ word (π ∷ ρ ∷ ο ∷ σ ∷ ώ ∷ π ∷ ο ∷ υ ∷ []) "2Thess.1.9"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.9"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.1.9"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.9"
∷ word (ἀ ∷ π ∷ ὸ ∷ []) "2Thess.1.9"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.1.9"
∷ word (δ ∷ ό ∷ ξ ∷ η ∷ ς ∷ []) "2Thess.1.9"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.1.9"
∷ word (ἰ ∷ σ ∷ χ ∷ ύ ∷ ο ∷ ς ∷ []) "2Thess.1.9"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.9"
∷ word (ὅ ∷ τ ∷ α ∷ ν ∷ []) "2Thess.1.10"
∷ word (ἔ ∷ ∙λ ∷ θ ∷ ῃ ∷ []) "2Thess.1.10"
∷ word (ἐ ∷ ν ∷ δ ∷ ο ∷ ξ ∷ α ∷ σ ∷ θ ∷ ῆ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.1.10"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.10"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.10"
∷ word (ἁ ∷ γ ∷ ί ∷ ο ∷ ι ∷ ς ∷ []) "2Thess.1.10"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.10"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.10"
∷ word (θ ∷ α ∷ υ ∷ μ ∷ α ∷ σ ∷ θ ∷ ῆ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.1.10"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.10"
∷ word (π ∷ ᾶ ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.10"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.1.10"
∷ word (π ∷ ι ∷ σ ∷ τ ∷ ε ∷ ύ ∷ σ ∷ α ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.1.10"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.1.10"
∷ word (ἐ ∷ π ∷ ι ∷ σ ∷ τ ∷ ε ∷ ύ ∷ θ ∷ η ∷ []) "2Thess.1.10"
∷ word (τ ∷ ὸ ∷ []) "2Thess.1.10"
∷ word (μ ∷ α ∷ ρ ∷ τ ∷ ύ ∷ ρ ∷ ι ∷ ο ∷ ν ∷ []) "2Thess.1.10"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.10"
∷ word (ἐ ∷ φ ∷ []) "2Thess.1.10"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.1.10"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.10"
∷ word (τ ∷ ῇ ∷ []) "2Thess.1.10"
∷ word (ἡ ∷ μ ∷ έ ∷ ρ ∷ ᾳ ∷ []) "2Thess.1.10"
∷ word (ἐ ∷ κ ∷ ε ∷ ί ∷ ν ∷ ῃ ∷ []) "2Thess.1.10"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.1.11"
∷ word (ὃ ∷ []) "2Thess.1.11"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.11"
∷ word (π ∷ ρ ∷ ο ∷ σ ∷ ε ∷ υ ∷ χ ∷ ό ∷ μ ∷ ε ∷ θ ∷ α ∷ []) "2Thess.1.11"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ο ∷ τ ∷ ε ∷ []) "2Thess.1.11"
∷ word (π ∷ ε ∷ ρ ∷ ὶ ∷ []) "2Thess.1.11"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.11"
∷ word (ἵ ∷ ν ∷ α ∷ []) "2Thess.1.11"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.1.11"
∷ word (ἀ ∷ ξ ∷ ι ∷ ώ ∷ σ ∷ ῃ ∷ []) "2Thess.1.11"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.1.11"
∷ word (κ ∷ ∙λ ∷ ή ∷ σ ∷ ε ∷ ω ∷ ς ∷ []) "2Thess.1.11"
∷ word (ὁ ∷ []) "2Thess.1.11"
∷ word (θ ∷ ε ∷ ὸ ∷ ς ∷ []) "2Thess.1.11"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.11"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.11"
∷ word (π ∷ ∙λ ∷ η ∷ ρ ∷ ώ ∷ σ ∷ ῃ ∷ []) "2Thess.1.11"
∷ word (π ∷ ᾶ ∷ σ ∷ α ∷ ν ∷ []) "2Thess.1.11"
∷ word (ε ∷ ὐ ∷ δ ∷ ο ∷ κ ∷ ί ∷ α ∷ ν ∷ []) "2Thess.1.11"
∷ word (ἀ ∷ γ ∷ α ∷ θ ∷ ω ∷ σ ∷ ύ ∷ ν ∷ η ∷ ς ∷ []) "2Thess.1.11"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.11"
∷ word (ἔ ∷ ρ ∷ γ ∷ ο ∷ ν ∷ []) "2Thess.1.11"
∷ word (π ∷ ί ∷ σ ∷ τ ∷ ε ∷ ω ∷ ς ∷ []) "2Thess.1.11"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.11"
∷ word (δ ∷ υ ∷ ν ∷ ά ∷ μ ∷ ε ∷ ι ∷ []) "2Thess.1.11"
∷ word (ὅ ∷ π ∷ ω ∷ ς ∷ []) "2Thess.1.12"
∷ word (ἐ ∷ ν ∷ δ ∷ ο ∷ ξ ∷ α ∷ σ ∷ θ ∷ ῇ ∷ []) "2Thess.1.12"
∷ word (τ ∷ ὸ ∷ []) "2Thess.1.12"
∷ word (ὄ ∷ ν ∷ ο ∷ μ ∷ α ∷ []) "2Thess.1.12"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.12"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.1.12"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.12"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.1.12"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.12"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.1.12"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.12"
∷ word (ὑ ∷ μ ∷ ε ∷ ῖ ∷ ς ∷ []) "2Thess.1.12"
∷ word (ἐ ∷ ν ∷ []) "2Thess.1.12"
∷ word (α ∷ ὐ ∷ τ ∷ ῷ ∷ []) "2Thess.1.12"
∷ word (κ ∷ α ∷ τ ∷ ὰ ∷ []) "2Thess.1.12"
∷ word (τ ∷ ὴ ∷ ν ∷ []) "2Thess.1.12"
∷ word (χ ∷ ά ∷ ρ ∷ ι ∷ ν ∷ []) "2Thess.1.12"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.12"
∷ word (θ ∷ ε ∷ ο ∷ ῦ ∷ []) "2Thess.1.12"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.1.12"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.1.12"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.1.12"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.1.12"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.1.12"
∷ word (Ἐ ∷ ρ ∷ ω ∷ τ ∷ ῶ ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.2.1"
∷ word (δ ∷ ὲ ∷ []) "2Thess.2.1"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.2.1"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ί ∷ []) "2Thess.2.1"
∷ word (ὑ ∷ π ∷ ὲ ∷ ρ ∷ []) "2Thess.2.1"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.2.1"
∷ word (π ∷ α ∷ ρ ∷ ο ∷ υ ∷ σ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.1"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.1"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.2.1"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.1"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.2.1"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.1"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.1"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.1"
∷ word (ἐ ∷ π ∷ ι ∷ σ ∷ υ ∷ ν ∷ α ∷ γ ∷ ω ∷ γ ∷ ῆ ∷ ς ∷ []) "2Thess.2.1"
∷ word (ἐ ∷ π ∷ []) "2Thess.2.1"
∷ word (α ∷ ὐ ∷ τ ∷ ό ∷ ν ∷ []) "2Thess.2.1"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.2"
∷ word (τ ∷ ὸ ∷ []) "2Thess.2.2"
∷ word (μ ∷ ὴ ∷ []) "2Thess.2.2"
∷ word (τ ∷ α ∷ χ ∷ έ ∷ ω ∷ ς ∷ []) "2Thess.2.2"
∷ word (σ ∷ α ∷ ∙λ ∷ ε ∷ υ ∷ θ ∷ ῆ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.2.2"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.2.2"
∷ word (ἀ ∷ π ∷ ὸ ∷ []) "2Thess.2.2"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.2"
∷ word (ν ∷ ο ∷ ὸ ∷ ς ∷ []) "2Thess.2.2"
∷ word (μ ∷ η ∷ δ ∷ ὲ ∷ []) "2Thess.2.2"
∷ word (θ ∷ ρ ∷ ο ∷ ε ∷ ῖ ∷ σ ∷ θ ∷ α ∷ ι ∷ []) "2Thess.2.2"
∷ word (μ ∷ ή ∷ τ ∷ ε ∷ []) "2Thess.2.2"
∷ word (δ ∷ ι ∷ ὰ ∷ []) "2Thess.2.2"
∷ word (π ∷ ν ∷ ε ∷ ύ ∷ μ ∷ α ∷ τ ∷ ο ∷ ς ∷ []) "2Thess.2.2"
∷ word (μ ∷ ή ∷ τ ∷ ε ∷ []) "2Thess.2.2"
∷ word (δ ∷ ι ∷ ὰ ∷ []) "2Thess.2.2"
∷ word (∙λ ∷ ό ∷ γ ∷ ο ∷ υ ∷ []) "2Thess.2.2"
∷ word (μ ∷ ή ∷ τ ∷ ε ∷ []) "2Thess.2.2"
∷ word (δ ∷ ι ∷ []) "2Thess.2.2"
∷ word (ἐ ∷ π ∷ ι ∷ σ ∷ τ ∷ ο ∷ ∙λ ∷ ῆ ∷ ς ∷ []) "2Thess.2.2"
∷ word (ὡ ∷ ς ∷ []) "2Thess.2.2"
∷ word (δ ∷ ι ∷ []) "2Thess.2.2"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.2"
∷ word (ὡ ∷ ς ∷ []) "2Thess.2.2"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.2.2"
∷ word (ἐ ∷ ν ∷ έ ∷ σ ∷ τ ∷ η ∷ κ ∷ ε ∷ ν ∷ []) "2Thess.2.2"
∷ word (ἡ ∷ []) "2Thess.2.2"
∷ word (ἡ ∷ μ ∷ έ ∷ ρ ∷ α ∷ []) "2Thess.2.2"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.2"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.2.2"
∷ word (μ ∷ ή ∷ []) "2Thess.2.3"
∷ word (τ ∷ ι ∷ ς ∷ []) "2Thess.2.3"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.2.3"
∷ word (ἐ ∷ ξ ∷ α ∷ π ∷ α ∷ τ ∷ ή ∷ σ ∷ ῃ ∷ []) "2Thess.2.3"
∷ word (κ ∷ α ∷ τ ∷ ὰ ∷ []) "2Thess.2.3"
∷ word (μ ∷ η ∷ δ ∷ έ ∷ ν ∷ α ∷ []) "2Thess.2.3"
∷ word (τ ∷ ρ ∷ ό ∷ π ∷ ο ∷ ν ∷ []) "2Thess.2.3"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.2.3"
∷ word (ἐ ∷ ὰ ∷ ν ∷ []) "2Thess.2.3"
∷ word (μ ∷ ὴ ∷ []) "2Thess.2.3"
∷ word (ἔ ∷ ∙λ ∷ θ ∷ ῃ ∷ []) "2Thess.2.3"
∷ word (ἡ ∷ []) "2Thess.2.3"
∷ word (ἀ ∷ π ∷ ο ∷ σ ∷ τ ∷ α ∷ σ ∷ ί ∷ α ∷ []) "2Thess.2.3"
∷ word (π ∷ ρ ∷ ῶ ∷ τ ∷ ο ∷ ν ∷ []) "2Thess.2.3"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.3"
∷ word (ἀ ∷ π ∷ ο ∷ κ ∷ α ∷ ∙λ ∷ υ ∷ φ ∷ θ ∷ ῇ ∷ []) "2Thess.2.3"
∷ word (ὁ ∷ []) "2Thess.2.3"
∷ word (ἄ ∷ ν ∷ θ ∷ ρ ∷ ω ∷ π ∷ ο ∷ ς ∷ []) "2Thess.2.3"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.2.3"
∷ word (ἀ ∷ ν ∷ ο ∷ μ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.3"
∷ word (ὁ ∷ []) "2Thess.2.3"
∷ word (υ ∷ ἱ ∷ ὸ ∷ ς ∷ []) "2Thess.2.3"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.2.3"
∷ word (ἀ ∷ π ∷ ω ∷ ∙λ ∷ ε ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.3"
∷ word (ὁ ∷ []) "2Thess.2.4"
∷ word (ἀ ∷ ν ∷ τ ∷ ι ∷ κ ∷ ε ∷ ί ∷ μ ∷ ε ∷ ν ∷ ο ∷ ς ∷ []) "2Thess.2.4"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.4"
∷ word (ὑ ∷ π ∷ ε ∷ ρ ∷ α ∷ ι ∷ ρ ∷ ό ∷ μ ∷ ε ∷ ν ∷ ο ∷ ς ∷ []) "2Thess.2.4"
∷ word (ἐ ∷ π ∷ ὶ ∷ []) "2Thess.2.4"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ α ∷ []) "2Thess.2.4"
∷ word (∙λ ∷ ε ∷ γ ∷ ό ∷ μ ∷ ε ∷ ν ∷ ο ∷ ν ∷ []) "2Thess.2.4"
∷ word (θ ∷ ε ∷ ὸ ∷ ν ∷ []) "2Thess.2.4"
∷ word (ἢ ∷ []) "2Thess.2.4"
∷ word (σ ∷ έ ∷ β ∷ α ∷ σ ∷ μ ∷ α ∷ []) "2Thess.2.4"
∷ word (ὥ ∷ σ ∷ τ ∷ ε ∷ []) "2Thess.2.4"
∷ word (α ∷ ὐ ∷ τ ∷ ὸ ∷ ν ∷ []) "2Thess.2.4"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.4"
∷ word (τ ∷ ὸ ∷ ν ∷ []) "2Thess.2.4"
∷ word (ν ∷ α ∷ ὸ ∷ ν ∷ []) "2Thess.2.4"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.4"
∷ word (θ ∷ ε ∷ ο ∷ ῦ ∷ []) "2Thess.2.4"
∷ word (κ ∷ α ∷ θ ∷ ί ∷ σ ∷ α ∷ ι ∷ []) "2Thess.2.4"
∷ word (ἀ ∷ π ∷ ο ∷ δ ∷ ε ∷ ι ∷ κ ∷ ν ∷ ύ ∷ ν ∷ τ ∷ α ∷ []) "2Thess.2.4"
∷ word (ἑ ∷ α ∷ υ ∷ τ ∷ ὸ ∷ ν ∷ []) "2Thess.2.4"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.2.4"
∷ word (ἔ ∷ σ ∷ τ ∷ ι ∷ ν ∷ []) "2Thess.2.4"
∷ word (θ ∷ ε ∷ ό ∷ ς ∷ []) "2Thess.2.4"
∷ word (ο ∷ ὐ ∷ []) "2Thess.2.5"
∷ word (μ ∷ ν ∷ η ∷ μ ∷ ο ∷ ν ∷ ε ∷ ύ ∷ ε ∷ τ ∷ ε ∷ []) "2Thess.2.5"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.2.5"
∷ word (ἔ ∷ τ ∷ ι ∷ []) "2Thess.2.5"
∷ word (ὢ ∷ ν ∷ []) "2Thess.2.5"
∷ word (π ∷ ρ ∷ ὸ ∷ ς ∷ []) "2Thess.2.5"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.2.5"
∷ word (τ ∷ α ∷ ῦ ∷ τ ∷ α ∷ []) "2Thess.2.5"
∷ word (ἔ ∷ ∙λ ∷ ε ∷ γ ∷ ο ∷ ν ∷ []) "2Thess.2.5"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.2.5"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.6"
∷ word (ν ∷ ῦ ∷ ν ∷ []) "2Thess.2.6"
∷ word (τ ∷ ὸ ∷ []) "2Thess.2.6"
∷ word (κ ∷ α ∷ τ ∷ έ ∷ χ ∷ ο ∷ ν ∷ []) "2Thess.2.6"
∷ word (ο ∷ ἴ ∷ δ ∷ α ∷ τ ∷ ε ∷ []) "2Thess.2.6"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.6"
∷ word (τ ∷ ὸ ∷ []) "2Thess.2.6"
∷ word (ἀ ∷ π ∷ ο ∷ κ ∷ α ∷ ∙λ ∷ υ ∷ φ ∷ θ ∷ ῆ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.2.6"
∷ word (α ∷ ὐ ∷ τ ∷ ὸ ∷ ν ∷ []) "2Thess.2.6"
∷ word (ἐ ∷ ν ∷ []) "2Thess.2.6"
∷ word (τ ∷ ῷ ∷ []) "2Thess.2.6"
∷ word (ἑ ∷ α ∷ υ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.6"
∷ word (κ ∷ α ∷ ι ∷ ρ ∷ ῷ ∷ []) "2Thess.2.6"
∷ word (τ ∷ ὸ ∷ []) "2Thess.2.7"
∷ word (γ ∷ ὰ ∷ ρ ∷ []) "2Thess.2.7"
∷ word (μ ∷ υ ∷ σ ∷ τ ∷ ή ∷ ρ ∷ ι ∷ ο ∷ ν ∷ []) "2Thess.2.7"
∷ word (ἤ ∷ δ ∷ η ∷ []) "2Thess.2.7"
∷ word (ἐ ∷ ν ∷ ε ∷ ρ ∷ γ ∷ ε ∷ ῖ ∷ τ ∷ α ∷ ι ∷ []) "2Thess.2.7"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.2.7"
∷ word (ἀ ∷ ν ∷ ο ∷ μ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.7"
∷ word (μ ∷ ό ∷ ν ∷ ο ∷ ν ∷ []) "2Thess.2.7"
∷ word (ὁ ∷ []) "2Thess.2.7"
∷ word (κ ∷ α ∷ τ ∷ έ ∷ χ ∷ ω ∷ ν ∷ []) "2Thess.2.7"
∷ word (ἄ ∷ ρ ∷ τ ∷ ι ∷ []) "2Thess.2.7"
∷ word (ἕ ∷ ω ∷ ς ∷ []) "2Thess.2.7"
∷ word (ἐ ∷ κ ∷ []) "2Thess.2.7"
∷ word (μ ∷ έ ∷ σ ∷ ο ∷ υ ∷ []) "2Thess.2.7"
∷ word (γ ∷ έ ∷ ν ∷ η ∷ τ ∷ α ∷ ι ∷ []) "2Thess.2.7"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.8"
∷ word (τ ∷ ό ∷ τ ∷ ε ∷ []) "2Thess.2.8"
∷ word (ἀ ∷ π ∷ ο ∷ κ ∷ α ∷ ∙λ ∷ υ ∷ φ ∷ θ ∷ ή ∷ σ ∷ ε ∷ τ ∷ α ∷ ι ∷ []) "2Thess.2.8"
∷ word (ὁ ∷ []) "2Thess.2.8"
∷ word (ἄ ∷ ν ∷ ο ∷ μ ∷ ο ∷ ς ∷ []) "2Thess.2.8"
∷ word (ὃ ∷ ν ∷ []) "2Thess.2.8"
∷ word (ὁ ∷ []) "2Thess.2.8"
∷ word (κ ∷ ύ ∷ ρ ∷ ι ∷ ο ∷ ς ∷ []) "2Thess.2.8"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ ς ∷ []) "2Thess.2.8"
∷ word (ἀ ∷ ν ∷ ε ∷ ∙λ ∷ ε ∷ ῖ ∷ []) "2Thess.2.8"
∷ word (τ ∷ ῷ ∷ []) "2Thess.2.8"
∷ word (π ∷ ν ∷ ε ∷ ύ ∷ μ ∷ α ∷ τ ∷ ι ∷ []) "2Thess.2.8"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.8"
∷ word (σ ∷ τ ∷ ό ∷ μ ∷ α ∷ τ ∷ ο ∷ ς ∷ []) "2Thess.2.8"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.8"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.8"
∷ word (κ ∷ α ∷ τ ∷ α ∷ ρ ∷ γ ∷ ή ∷ σ ∷ ε ∷ ι ∷ []) "2Thess.2.8"
∷ word (τ ∷ ῇ ∷ []) "2Thess.2.8"
∷ word (ἐ ∷ π ∷ ι ∷ φ ∷ α ∷ ν ∷ ε ∷ ί ∷ ᾳ ∷ []) "2Thess.2.8"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.2.8"
∷ word (π ∷ α ∷ ρ ∷ ο ∷ υ ∷ σ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.8"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.8"
∷ word (ο ∷ ὗ ∷ []) "2Thess.2.9"
∷ word (ἐ ∷ σ ∷ τ ∷ ι ∷ ν ∷ []) "2Thess.2.9"
∷ word (ἡ ∷ []) "2Thess.2.9"
∷ word (π ∷ α ∷ ρ ∷ ο ∷ υ ∷ σ ∷ ί ∷ α ∷ []) "2Thess.2.9"
∷ word (κ ∷ α ∷ τ ∷ []) "2Thess.2.9"
∷ word (ἐ ∷ ν ∷ έ ∷ ρ ∷ γ ∷ ε ∷ ι ∷ α ∷ ν ∷ []) "2Thess.2.9"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.9"
∷ word (Σ ∷ α ∷ τ ∷ α ∷ ν ∷ ᾶ ∷ []) "2Thess.2.9"
∷ word (ἐ ∷ ν ∷ []) "2Thess.2.9"
∷ word (π ∷ ά ∷ σ ∷ ῃ ∷ []) "2Thess.2.9"
∷ word (δ ∷ υ ∷ ν ∷ ά ∷ μ ∷ ε ∷ ι ∷ []) "2Thess.2.9"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.9"
∷ word (σ ∷ η ∷ μ ∷ ε ∷ ί ∷ ο ∷ ι ∷ ς ∷ []) "2Thess.2.9"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.9"
∷ word (τ ∷ έ ∷ ρ ∷ α ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.2.9"
∷ word (ψ ∷ ε ∷ ύ ∷ δ ∷ ο ∷ υ ∷ ς ∷ []) "2Thess.2.9"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.10"
∷ word (ἐ ∷ ν ∷ []) "2Thess.2.10"
∷ word (π ∷ ά ∷ σ ∷ ῃ ∷ []) "2Thess.2.10"
∷ word (ἀ ∷ π ∷ ά ∷ τ ∷ ῃ ∷ []) "2Thess.2.10"
∷ word (ἀ ∷ δ ∷ ι ∷ κ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.10"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.2.10"
∷ word (ἀ ∷ π ∷ ο ∷ ∙λ ∷ ∙λ ∷ υ ∷ μ ∷ έ ∷ ν ∷ ο ∷ ι ∷ ς ∷ []) "2Thess.2.10"
∷ word (ἀ ∷ ν ∷ θ ∷ []) "2Thess.2.10"
∷ word (ὧ ∷ ν ∷ []) "2Thess.2.10"
∷ word (τ ∷ ὴ ∷ ν ∷ []) "2Thess.2.10"
∷ word (ἀ ∷ γ ∷ ά ∷ π ∷ η ∷ ν ∷ []) "2Thess.2.10"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.2.10"
∷ word (ἀ ∷ ∙λ ∷ η ∷ θ ∷ ε ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.10"
∷ word (ο ∷ ὐ ∷ κ ∷ []) "2Thess.2.10"
∷ word (ἐ ∷ δ ∷ έ ∷ ξ ∷ α ∷ ν ∷ τ ∷ ο ∷ []) "2Thess.2.10"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.10"
∷ word (τ ∷ ὸ ∷ []) "2Thess.2.10"
∷ word (σ ∷ ω ∷ θ ∷ ῆ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.2.10"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ύ ∷ ς ∷ []) "2Thess.2.10"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.11"
∷ word (δ ∷ ι ∷ ὰ ∷ []) "2Thess.2.11"
∷ word (τ ∷ ο ∷ ῦ ∷ τ ∷ ο ∷ []) "2Thess.2.11"
∷ word (π ∷ έ ∷ μ ∷ π ∷ ε ∷ ι ∷ []) "2Thess.2.11"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.2.11"
∷ word (ὁ ∷ []) "2Thess.2.11"
∷ word (θ ∷ ε ∷ ὸ ∷ ς ∷ []) "2Thess.2.11"
∷ word (ἐ ∷ ν ∷ έ ∷ ρ ∷ γ ∷ ε ∷ ι ∷ α ∷ ν ∷ []) "2Thess.2.11"
∷ word (π ∷ ∙λ ∷ ά ∷ ν ∷ η ∷ ς ∷ []) "2Thess.2.11"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.11"
∷ word (τ ∷ ὸ ∷ []) "2Thess.2.11"
∷ word (π ∷ ι ∷ σ ∷ τ ∷ ε ∷ ῦ ∷ σ ∷ α ∷ ι ∷ []) "2Thess.2.11"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ὺ ∷ ς ∷ []) "2Thess.2.11"
∷ word (τ ∷ ῷ ∷ []) "2Thess.2.11"
∷ word (ψ ∷ ε ∷ ύ ∷ δ ∷ ε ∷ ι ∷ []) "2Thess.2.11"
∷ word (ἵ ∷ ν ∷ α ∷ []) "2Thess.2.12"
∷ word (κ ∷ ρ ∷ ι ∷ θ ∷ ῶ ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.2.12"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ε ∷ ς ∷ []) "2Thess.2.12"
∷ word (ο ∷ ἱ ∷ []) "2Thess.2.12"
∷ word (μ ∷ ὴ ∷ []) "2Thess.2.12"
∷ word (π ∷ ι ∷ σ ∷ τ ∷ ε ∷ ύ ∷ σ ∷ α ∷ ν ∷ τ ∷ ε ∷ ς ∷ []) "2Thess.2.12"
∷ word (τ ∷ ῇ ∷ []) "2Thess.2.12"
∷ word (ἀ ∷ ∙λ ∷ η ∷ θ ∷ ε ∷ ί ∷ ᾳ ∷ []) "2Thess.2.12"
∷ word (ἀ ∷ ∙λ ∷ ∙λ ∷ ὰ ∷ []) "2Thess.2.12"
∷ word (ε ∷ ὐ ∷ δ ∷ ο ∷ κ ∷ ή ∷ σ ∷ α ∷ ν ∷ τ ∷ ε ∷ ς ∷ []) "2Thess.2.12"
∷ word (τ ∷ ῇ ∷ []) "2Thess.2.12"
∷ word (ἀ ∷ δ ∷ ι ∷ κ ∷ ί ∷ ᾳ ∷ []) "2Thess.2.12"
∷ word (Ἡ ∷ μ ∷ ε ∷ ῖ ∷ ς ∷ []) "2Thess.2.13"
∷ word (δ ∷ ὲ ∷ []) "2Thess.2.13"
∷ word (ὀ ∷ φ ∷ ε ∷ ί ∷ ∙λ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.2.13"
∷ word (ε ∷ ὐ ∷ χ ∷ α ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ε ∷ ῖ ∷ ν ∷ []) "2Thess.2.13"
∷ word (τ ∷ ῷ ∷ []) "2Thess.2.13"
∷ word (θ ∷ ε ∷ ῷ ∷ []) "2Thess.2.13"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ο ∷ τ ∷ ε ∷ []) "2Thess.2.13"
∷ word (π ∷ ε ∷ ρ ∷ ὶ ∷ []) "2Thess.2.13"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.13"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ὶ ∷ []) "2Thess.2.13"
∷ word (ἠ ∷ γ ∷ α ∷ π ∷ η ∷ μ ∷ έ ∷ ν ∷ ο ∷ ι ∷ []) "2Thess.2.13"
∷ word (ὑ ∷ π ∷ ὸ ∷ []) "2Thess.2.13"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.2.13"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.2.13"
∷ word (ε ∷ ἵ ∷ ∙λ ∷ α ∷ τ ∷ ο ∷ []) "2Thess.2.13"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.2.13"
∷ word (ὁ ∷ []) "2Thess.2.13"
∷ word (θ ∷ ε ∷ ὸ ∷ ς ∷ []) "2Thess.2.13"
∷ word (ἀ ∷ π ∷ α ∷ ρ ∷ χ ∷ ὴ ∷ ν ∷ []) "2Thess.2.13"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.13"
∷ word (σ ∷ ω ∷ τ ∷ η ∷ ρ ∷ ί ∷ α ∷ ν ∷ []) "2Thess.2.13"
∷ word (ἐ ∷ ν ∷ []) "2Thess.2.13"
∷ word (ἁ ∷ γ ∷ ι ∷ α ∷ σ ∷ μ ∷ ῷ ∷ []) "2Thess.2.13"
∷ word (π ∷ ν ∷ ε ∷ ύ ∷ μ ∷ α ∷ τ ∷ ο ∷ ς ∷ []) "2Thess.2.13"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.13"
∷ word (π ∷ ί ∷ σ ∷ τ ∷ ε ∷ ι ∷ []) "2Thess.2.13"
∷ word (ἀ ∷ ∙λ ∷ η ∷ θ ∷ ε ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.13"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.14"
∷ word (ὃ ∷ []) "2Thess.2.14"
∷ word (ἐ ∷ κ ∷ ά ∷ ∙λ ∷ ε ∷ σ ∷ ε ∷ ν ∷ []) "2Thess.2.14"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.2.14"
∷ word (δ ∷ ι ∷ ὰ ∷ []) "2Thess.2.14"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.14"
∷ word (ε ∷ ὐ ∷ α ∷ γ ∷ γ ∷ ε ∷ ∙λ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.2.14"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.14"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.2.14"
∷ word (π ∷ ε ∷ ρ ∷ ι ∷ π ∷ ο ∷ ί ∷ η ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.2.14"
∷ word (δ ∷ ό ∷ ξ ∷ η ∷ ς ∷ []) "2Thess.2.14"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.14"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.2.14"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.14"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.2.14"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.2.14"
∷ word (ἄ ∷ ρ ∷ α ∷ []) "2Thess.2.15"
∷ word (ο ∷ ὖ ∷ ν ∷ []) "2Thess.2.15"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ί ∷ []) "2Thess.2.15"
∷ word (σ ∷ τ ∷ ή ∷ κ ∷ ε ∷ τ ∷ ε ∷ []) "2Thess.2.15"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.15"
∷ word (κ ∷ ρ ∷ α ∷ τ ∷ ε ∷ ῖ ∷ τ ∷ ε ∷ []) "2Thess.2.15"
∷ word (τ ∷ ὰ ∷ ς ∷ []) "2Thess.2.15"
∷ word (π ∷ α ∷ ρ ∷ α ∷ δ ∷ ό ∷ σ ∷ ε ∷ ι ∷ ς ∷ []) "2Thess.2.15"
∷ word (ἃ ∷ ς ∷ []) "2Thess.2.15"
∷ word (ἐ ∷ δ ∷ ι ∷ δ ∷ ά ∷ χ ∷ θ ∷ η ∷ τ ∷ ε ∷ []) "2Thess.2.15"
∷ word (ε ∷ ἴ ∷ τ ∷ ε ∷ []) "2Thess.2.15"
∷ word (δ ∷ ι ∷ ὰ ∷ []) "2Thess.2.15"
∷ word (∙λ ∷ ό ∷ γ ∷ ο ∷ υ ∷ []) "2Thess.2.15"
∷ word (ε ∷ ἴ ∷ τ ∷ ε ∷ []) "2Thess.2.15"
∷ word (δ ∷ ι ∷ []) "2Thess.2.15"
∷ word (ἐ ∷ π ∷ ι ∷ σ ∷ τ ∷ ο ∷ ∙λ ∷ ῆ ∷ ς ∷ []) "2Thess.2.15"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.15"
∷ word (Α ∷ ὐ ∷ τ ∷ ὸ ∷ ς ∷ []) "2Thess.2.16"
∷ word (δ ∷ ὲ ∷ []) "2Thess.2.16"
∷ word (ὁ ∷ []) "2Thess.2.16"
∷ word (κ ∷ ύ ∷ ρ ∷ ι ∷ ο ∷ ς ∷ []) "2Thess.2.16"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.16"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ ς ∷ []) "2Thess.2.16"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ὸ ∷ ς ∷ []) "2Thess.2.16"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.16"
∷ word (θ ∷ ε ∷ ὸ ∷ ς ∷ []) "2Thess.2.16"
∷ word (ὁ ∷ []) "2Thess.2.16"
∷ word (π ∷ α ∷ τ ∷ ὴ ∷ ρ ∷ []) "2Thess.2.16"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.16"
∷ word (ὁ ∷ []) "2Thess.2.16"
∷ word (ἀ ∷ γ ∷ α ∷ π ∷ ή ∷ σ ∷ α ∷ ς ∷ []) "2Thess.2.16"
∷ word (ἡ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.2.16"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.16"
∷ word (δ ∷ ο ∷ ὺ ∷ ς ∷ []) "2Thess.2.16"
∷ word (π ∷ α ∷ ρ ∷ ά ∷ κ ∷ ∙λ ∷ η ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.2.16"
∷ word (α ∷ ἰ ∷ ω ∷ ν ∷ ί ∷ α ∷ ν ∷ []) "2Thess.2.16"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.16"
∷ word (ἐ ∷ ∙λ ∷ π ∷ ί ∷ δ ∷ α ∷ []) "2Thess.2.16"
∷ word (ἀ ∷ γ ∷ α ∷ θ ∷ ὴ ∷ ν ∷ []) "2Thess.2.16"
∷ word (ἐ ∷ ν ∷ []) "2Thess.2.16"
∷ word (χ ∷ ά ∷ ρ ∷ ι ∷ τ ∷ ι ∷ []) "2Thess.2.16"
∷ word (π ∷ α ∷ ρ ∷ α ∷ κ ∷ α ∷ ∙λ ∷ έ ∷ σ ∷ α ∷ ι ∷ []) "2Thess.2.17"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.2.17"
∷ word (τ ∷ ὰ ∷ ς ∷ []) "2Thess.2.17"
∷ word (κ ∷ α ∷ ρ ∷ δ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.2.17"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.17"
∷ word (σ ∷ τ ∷ η ∷ ρ ∷ ί ∷ ξ ∷ α ∷ ι ∷ []) "2Thess.2.17"
∷ word (ἐ ∷ ν ∷ []) "2Thess.2.17"
∷ word (π ∷ α ∷ ν ∷ τ ∷ ὶ ∷ []) "2Thess.2.17"
∷ word (ἔ ∷ ρ ∷ γ ∷ ῳ ∷ []) "2Thess.2.17"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.2.17"
∷ word (∙λ ∷ ό ∷ γ ∷ ῳ ∷ []) "2Thess.2.17"
∷ word (ἀ ∷ γ ∷ α ∷ θ ∷ ῷ ∷ []) "2Thess.2.17"
∷ word (Τ ∷ ὸ ∷ []) "2Thess.3.1"
∷ word (∙λ ∷ ο ∷ ι ∷ π ∷ ὸ ∷ ν ∷ []) "2Thess.3.1"
∷ word (π ∷ ρ ∷ ο ∷ σ ∷ ε ∷ ύ ∷ χ ∷ ε ∷ σ ∷ θ ∷ ε ∷ []) "2Thess.3.1"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ί ∷ []) "2Thess.3.1"
∷ word (π ∷ ε ∷ ρ ∷ ὶ ∷ []) "2Thess.3.1"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.1"
∷ word (ἵ ∷ ν ∷ α ∷ []) "2Thess.3.1"
∷ word (ὁ ∷ []) "2Thess.3.1"
∷ word (∙λ ∷ ό ∷ γ ∷ ο ∷ ς ∷ []) "2Thess.3.1"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.1"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.3.1"
∷ word (τ ∷ ρ ∷ έ ∷ χ ∷ ῃ ∷ []) "2Thess.3.1"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.1"
∷ word (δ ∷ ο ∷ ξ ∷ ά ∷ ζ ∷ η ∷ τ ∷ α ∷ ι ∷ []) "2Thess.3.1"
∷ word (κ ∷ α ∷ θ ∷ ὼ ∷ ς ∷ []) "2Thess.3.1"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.1"
∷ word (π ∷ ρ ∷ ὸ ∷ ς ∷ []) "2Thess.3.1"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.3.1"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.2"
∷ word (ἵ ∷ ν ∷ α ∷ []) "2Thess.3.2"
∷ word (ῥ ∷ υ ∷ σ ∷ θ ∷ ῶ ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.2"
∷ word (ἀ ∷ π ∷ ὸ ∷ []) "2Thess.3.2"
∷ word (τ ∷ ῶ ∷ ν ∷ []) "2Thess.3.2"
∷ word (ἀ ∷ τ ∷ ό ∷ π ∷ ω ∷ ν ∷ []) "2Thess.3.2"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.2"
∷ word (π ∷ ο ∷ ν ∷ η ∷ ρ ∷ ῶ ∷ ν ∷ []) "2Thess.3.2"
∷ word (ἀ ∷ ν ∷ θ ∷ ρ ∷ ώ ∷ π ∷ ω ∷ ν ∷ []) "2Thess.3.2"
∷ word (ο ∷ ὐ ∷ []) "2Thess.3.2"
∷ word (γ ∷ ὰ ∷ ρ ∷ []) "2Thess.3.2"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ω ∷ ν ∷ []) "2Thess.3.2"
∷ word (ἡ ∷ []) "2Thess.3.2"
∷ word (π ∷ ί ∷ σ ∷ τ ∷ ι ∷ ς ∷ []) "2Thess.3.2"
∷ word (π ∷ ι ∷ σ ∷ τ ∷ ὸ ∷ ς ∷ []) "2Thess.3.3"
∷ word (δ ∷ έ ∷ []) "2Thess.3.3"
∷ word (ἐ ∷ σ ∷ τ ∷ ι ∷ ν ∷ []) "2Thess.3.3"
∷ word (ὁ ∷ []) "2Thess.3.3"
∷ word (κ ∷ ύ ∷ ρ ∷ ι ∷ ο ∷ ς ∷ []) "2Thess.3.3"
∷ word (ὃ ∷ ς ∷ []) "2Thess.3.3"
∷ word (σ ∷ τ ∷ η ∷ ρ ∷ ί ∷ ξ ∷ ε ∷ ι ∷ []) "2Thess.3.3"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.3.3"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.3"
∷ word (φ ∷ υ ∷ ∙λ ∷ ά ∷ ξ ∷ ε ∷ ι ∷ []) "2Thess.3.3"
∷ word (ἀ ∷ π ∷ ὸ ∷ []) "2Thess.3.3"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.3"
∷ word (π ∷ ο ∷ ν ∷ η ∷ ρ ∷ ο ∷ ῦ ∷ []) "2Thess.3.3"
∷ word (π ∷ ε ∷ π ∷ ο ∷ ί ∷ θ ∷ α ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.4"
∷ word (δ ∷ ὲ ∷ []) "2Thess.3.4"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.4"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ῳ ∷ []) "2Thess.3.4"
∷ word (ἐ ∷ φ ∷ []) "2Thess.3.4"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.3.4"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.3.4"
∷ word (ἃ ∷ []) "2Thess.3.4"
∷ word (π ∷ α ∷ ρ ∷ α ∷ γ ∷ γ ∷ έ ∷ ∙λ ∷ ∙λ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.4"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.4"
∷ word (π ∷ ο ∷ ι ∷ ε ∷ ῖ ∷ τ ∷ ε ∷ []) "2Thess.3.4"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.4"
∷ word (π ∷ ο ∷ ι ∷ ή ∷ σ ∷ ε ∷ τ ∷ ε ∷ []) "2Thess.3.4"
∷ word (ὁ ∷ []) "2Thess.3.5"
∷ word (δ ∷ ὲ ∷ []) "2Thess.3.5"
∷ word (κ ∷ ύ ∷ ρ ∷ ι ∷ ο ∷ ς ∷ []) "2Thess.3.5"
∷ word (κ ∷ α ∷ τ ∷ ε ∷ υ ∷ θ ∷ ύ ∷ ν ∷ α ∷ ι ∷ []) "2Thess.3.5"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.5"
∷ word (τ ∷ ὰ ∷ ς ∷ []) "2Thess.3.5"
∷ word (κ ∷ α ∷ ρ ∷ δ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.3.5"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.3.5"
∷ word (τ ∷ ὴ ∷ ν ∷ []) "2Thess.3.5"
∷ word (ἀ ∷ γ ∷ ά ∷ π ∷ η ∷ ν ∷ []) "2Thess.3.5"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.5"
∷ word (θ ∷ ε ∷ ο ∷ ῦ ∷ []) "2Thess.3.5"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.5"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.3.5"
∷ word (τ ∷ ὴ ∷ ν ∷ []) "2Thess.3.5"
∷ word (ὑ ∷ π ∷ ο ∷ μ ∷ ο ∷ ν ∷ ὴ ∷ ν ∷ []) "2Thess.3.5"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.5"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.5"
∷ word (Π ∷ α ∷ ρ ∷ α ∷ γ ∷ γ ∷ έ ∷ ∙λ ∷ ∙λ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.6"
∷ word (δ ∷ ὲ ∷ []) "2Thess.3.6"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.3.6"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ί ∷ []) "2Thess.3.6"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.6"
∷ word (ὀ ∷ ν ∷ ό ∷ μ ∷ α ∷ τ ∷ ι ∷ []) "2Thess.3.6"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.6"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.3.6"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.6"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.3.6"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.6"
∷ word (σ ∷ τ ∷ έ ∷ ∙λ ∷ ∙λ ∷ ε ∷ σ ∷ θ ∷ α ∷ ι ∷ []) "2Thess.3.6"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.3.6"
∷ word (ἀ ∷ π ∷ ὸ ∷ []) "2Thess.3.6"
∷ word (π ∷ α ∷ ν ∷ τ ∷ ὸ ∷ ς ∷ []) "2Thess.3.6"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ῦ ∷ []) "2Thess.3.6"
∷ word (ἀ ∷ τ ∷ ά ∷ κ ∷ τ ∷ ω ∷ ς ∷ []) "2Thess.3.6"
∷ word (π ∷ ε ∷ ρ ∷ ι ∷ π ∷ α ∷ τ ∷ ο ∷ ῦ ∷ ν ∷ τ ∷ ο ∷ ς ∷ []) "2Thess.3.6"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.6"
∷ word (μ ∷ ὴ ∷ []) "2Thess.3.6"
∷ word (κ ∷ α ∷ τ ∷ ὰ ∷ []) "2Thess.3.6"
∷ word (τ ∷ ὴ ∷ ν ∷ []) "2Thess.3.6"
∷ word (π ∷ α ∷ ρ ∷ ά ∷ δ ∷ ο ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.3.6"
∷ word (ἣ ∷ ν ∷ []) "2Thess.3.6"
∷ word (π ∷ α ∷ ρ ∷ ε ∷ ∙λ ∷ ά ∷ β ∷ ο ∷ σ ∷ α ∷ ν ∷ []) "2Thess.3.6"
∷ word (π ∷ α ∷ ρ ∷ []) "2Thess.3.6"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.6"
∷ word (α ∷ ὐ ∷ τ ∷ ο ∷ ὶ ∷ []) "2Thess.3.7"
∷ word (γ ∷ ὰ ∷ ρ ∷ []) "2Thess.3.7"
∷ word (ο ∷ ἴ ∷ δ ∷ α ∷ τ ∷ ε ∷ []) "2Thess.3.7"
∷ word (π ∷ ῶ ∷ ς ∷ []) "2Thess.3.7"
∷ word (δ ∷ ε ∷ ῖ ∷ []) "2Thess.3.7"
∷ word (μ ∷ ι ∷ μ ∷ ε ∷ ῖ ∷ σ ∷ θ ∷ α ∷ ι ∷ []) "2Thess.3.7"
∷ word (ἡ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.3.7"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.3.7"
∷ word (ο ∷ ὐ ∷ κ ∷ []) "2Thess.3.7"
∷ word (ἠ ∷ τ ∷ α ∷ κ ∷ τ ∷ ή ∷ σ ∷ α ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.7"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.7"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.3.7"
∷ word (ο ∷ ὐ ∷ δ ∷ ὲ ∷ []) "2Thess.3.8"
∷ word (δ ∷ ω ∷ ρ ∷ ε ∷ ὰ ∷ ν ∷ []) "2Thess.3.8"
∷ word (ἄ ∷ ρ ∷ τ ∷ ο ∷ ν ∷ []) "2Thess.3.8"
∷ word (ἐ ∷ φ ∷ ά ∷ γ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.8"
∷ word (π ∷ α ∷ ρ ∷ ά ∷ []) "2Thess.3.8"
∷ word (τ ∷ ι ∷ ν ∷ ο ∷ ς ∷ []) "2Thess.3.8"
∷ word (ἀ ∷ ∙λ ∷ ∙λ ∷ []) "2Thess.3.8"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.8"
∷ word (κ ∷ ό ∷ π ∷ ῳ ∷ []) "2Thess.3.8"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.8"
∷ word (μ ∷ ό ∷ χ ∷ θ ∷ ῳ ∷ []) "2Thess.3.8"
∷ word (ν ∷ υ ∷ κ ∷ τ ∷ ὸ ∷ ς ∷ []) "2Thess.3.8"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.8"
∷ word (ἡ ∷ μ ∷ έ ∷ ρ ∷ α ∷ ς ∷ []) "2Thess.3.8"
∷ word (ἐ ∷ ρ ∷ γ ∷ α ∷ ζ ∷ ό ∷ μ ∷ ε ∷ ν ∷ ο ∷ ι ∷ []) "2Thess.3.8"
∷ word (π ∷ ρ ∷ ὸ ∷ ς ∷ []) "2Thess.3.8"
∷ word (τ ∷ ὸ ∷ []) "2Thess.3.8"
∷ word (μ ∷ ὴ ∷ []) "2Thess.3.8"
∷ word (ἐ ∷ π ∷ ι ∷ β ∷ α ∷ ρ ∷ ῆ ∷ σ ∷ α ∷ ί ∷ []) "2Thess.3.8"
∷ word (τ ∷ ι ∷ ν ∷ α ∷ []) "2Thess.3.8"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.8"
∷ word (ο ∷ ὐ ∷ χ ∷ []) "2Thess.3.9"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.3.9"
∷ word (ο ∷ ὐ ∷ κ ∷ []) "2Thess.3.9"
∷ word (ἔ ∷ χ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.9"
∷ word (ἐ ∷ ξ ∷ ο ∷ υ ∷ σ ∷ ί ∷ α ∷ ν ∷ []) "2Thess.3.9"
∷ word (ἀ ∷ ∙λ ∷ ∙λ ∷ []) "2Thess.3.9"
∷ word (ἵ ∷ ν ∷ α ∷ []) "2Thess.3.9"
∷ word (ἑ ∷ α ∷ υ ∷ τ ∷ ο ∷ ὺ ∷ ς ∷ []) "2Thess.3.9"
∷ word (τ ∷ ύ ∷ π ∷ ο ∷ ν ∷ []) "2Thess.3.9"
∷ word (δ ∷ ῶ ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.9"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.3.9"
∷ word (ε ∷ ἰ ∷ ς ∷ []) "2Thess.3.9"
∷ word (τ ∷ ὸ ∷ []) "2Thess.3.9"
∷ word (μ ∷ ι ∷ μ ∷ ε ∷ ῖ ∷ σ ∷ θ ∷ α ∷ ι ∷ []) "2Thess.3.9"
∷ word (ἡ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.3.9"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.10"
∷ word (γ ∷ ὰ ∷ ρ ∷ []) "2Thess.3.10"
∷ word (ὅ ∷ τ ∷ ε ∷ []) "2Thess.3.10"
∷ word (ἦ ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.10"
∷ word (π ∷ ρ ∷ ὸ ∷ ς ∷ []) "2Thess.3.10"
∷ word (ὑ ∷ μ ∷ ᾶ ∷ ς ∷ []) "2Thess.3.10"
∷ word (τ ∷ ο ∷ ῦ ∷ τ ∷ ο ∷ []) "2Thess.3.10"
∷ word (π ∷ α ∷ ρ ∷ η ∷ γ ∷ γ ∷ έ ∷ ∙λ ∷ ∙λ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.10"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.3.10"
∷ word (ὅ ∷ τ ∷ ι ∷ []) "2Thess.3.10"
∷ word (ε ∷ ἴ ∷ []) "2Thess.3.10"
∷ word (τ ∷ ι ∷ ς ∷ []) "2Thess.3.10"
∷ word (ο ∷ ὐ ∷ []) "2Thess.3.10"
∷ word (θ ∷ έ ∷ ∙λ ∷ ε ∷ ι ∷ []) "2Thess.3.10"
∷ word (ἐ ∷ ρ ∷ γ ∷ ά ∷ ζ ∷ ε ∷ σ ∷ θ ∷ α ∷ ι ∷ []) "2Thess.3.10"
∷ word (μ ∷ η ∷ δ ∷ ὲ ∷ []) "2Thess.3.10"
∷ word (ἐ ∷ σ ∷ θ ∷ ι ∷ έ ∷ τ ∷ ω ∷ []) "2Thess.3.10"
∷ word (ἀ ∷ κ ∷ ο ∷ ύ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.11"
∷ word (γ ∷ ά ∷ ρ ∷ []) "2Thess.3.11"
∷ word (τ ∷ ι ∷ ν ∷ α ∷ ς ∷ []) "2Thess.3.11"
∷ word (π ∷ ε ∷ ρ ∷ ι ∷ π ∷ α ∷ τ ∷ ο ∷ ῦ ∷ ν ∷ τ ∷ α ∷ ς ∷ []) "2Thess.3.11"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.11"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.3.11"
∷ word (ἀ ∷ τ ∷ ά ∷ κ ∷ τ ∷ ω ∷ ς ∷ []) "2Thess.3.11"
∷ word (μ ∷ η ∷ δ ∷ ὲ ∷ ν ∷ []) "2Thess.3.11"
∷ word (ἐ ∷ ρ ∷ γ ∷ α ∷ ζ ∷ ο ∷ μ ∷ έ ∷ ν ∷ ο ∷ υ ∷ ς ∷ []) "2Thess.3.11"
∷ word (ἀ ∷ ∙λ ∷ ∙λ ∷ ὰ ∷ []) "2Thess.3.11"
∷ word (π ∷ ε ∷ ρ ∷ ι ∷ ε ∷ ρ ∷ γ ∷ α ∷ ζ ∷ ο ∷ μ ∷ έ ∷ ν ∷ ο ∷ υ ∷ ς ∷ []) "2Thess.3.11"
∷ word (τ ∷ ο ∷ ῖ ∷ ς ∷ []) "2Thess.3.12"
∷ word (δ ∷ ὲ ∷ []) "2Thess.3.12"
∷ word (τ ∷ ο ∷ ι ∷ ο ∷ ύ ∷ τ ∷ ο ∷ ι ∷ ς ∷ []) "2Thess.3.12"
∷ word (π ∷ α ∷ ρ ∷ α ∷ γ ∷ γ ∷ έ ∷ ∙λ ∷ ∙λ ∷ ο ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.12"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.12"
∷ word (π ∷ α ∷ ρ ∷ α ∷ κ ∷ α ∷ ∙λ ∷ ο ∷ ῦ ∷ μ ∷ ε ∷ ν ∷ []) "2Thess.3.12"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.12"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ῳ ∷ []) "2Thess.3.12"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.3.12"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ῷ ∷ []) "2Thess.3.12"
∷ word (ἵ ∷ ν ∷ α ∷ []) "2Thess.3.12"
∷ word (μ ∷ ε ∷ τ ∷ ὰ ∷ []) "2Thess.3.12"
∷ word (ἡ ∷ σ ∷ υ ∷ χ ∷ ί ∷ α ∷ ς ∷ []) "2Thess.3.12"
∷ word (ἐ ∷ ρ ∷ γ ∷ α ∷ ζ ∷ ό ∷ μ ∷ ε ∷ ν ∷ ο ∷ ι ∷ []) "2Thess.3.12"
∷ word (τ ∷ ὸ ∷ ν ∷ []) "2Thess.3.12"
∷ word (ἑ ∷ α ∷ υ ∷ τ ∷ ῶ ∷ ν ∷ []) "2Thess.3.12"
∷ word (ἄ ∷ ρ ∷ τ ∷ ο ∷ ν ∷ []) "2Thess.3.12"
∷ word (ἐ ∷ σ ∷ θ ∷ ί ∷ ω ∷ σ ∷ ι ∷ ν ∷ []) "2Thess.3.12"
∷ word (ὑ ∷ μ ∷ ε ∷ ῖ ∷ ς ∷ []) "2Thess.3.13"
∷ word (δ ∷ έ ∷ []) "2Thess.3.13"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ο ∷ ί ∷ []) "2Thess.3.13"
∷ word (μ ∷ ὴ ∷ []) "2Thess.3.13"
∷ word (ἐ ∷ γ ∷ κ ∷ α ∷ κ ∷ ή ∷ σ ∷ η ∷ τ ∷ ε ∷ []) "2Thess.3.13"
∷ word (κ ∷ α ∷ ∙λ ∷ ο ∷ π ∷ ο ∷ ι ∷ ο ∷ ῦ ∷ ν ∷ τ ∷ ε ∷ ς ∷ []) "2Thess.3.13"
∷ word (Ε ∷ ἰ ∷ []) "2Thess.3.14"
∷ word (δ ∷ έ ∷ []) "2Thess.3.14"
∷ word (τ ∷ ι ∷ ς ∷ []) "2Thess.3.14"
∷ word (ο ∷ ὐ ∷ χ ∷ []) "2Thess.3.14"
∷ word (ὑ ∷ π ∷ α ∷ κ ∷ ο ∷ ύ ∷ ε ∷ ι ∷ []) "2Thess.3.14"
∷ word (τ ∷ ῷ ∷ []) "2Thess.3.14"
∷ word (∙λ ∷ ό ∷ γ ∷ ῳ ∷ []) "2Thess.3.14"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.14"
∷ word (δ ∷ ι ∷ ὰ ∷ []) "2Thess.3.14"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.3.14"
∷ word (ἐ ∷ π ∷ ι ∷ σ ∷ τ ∷ ο ∷ ∙λ ∷ ῆ ∷ ς ∷ []) "2Thess.3.14"
∷ word (τ ∷ ο ∷ ῦ ∷ τ ∷ ο ∷ ν ∷ []) "2Thess.3.14"
∷ word (σ ∷ η ∷ μ ∷ ε ∷ ι ∷ ο ∷ ῦ ∷ σ ∷ θ ∷ ε ∷ []) "2Thess.3.14"
∷ word (μ ∷ ὴ ∷ []) "2Thess.3.14"
∷ word (σ ∷ υ ∷ ν ∷ α ∷ ν ∷ α ∷ μ ∷ ί ∷ γ ∷ ν ∷ υ ∷ σ ∷ θ ∷ α ∷ ι ∷ []) "2Thess.3.14"
∷ word (α ∷ ὐ ∷ τ ∷ ῷ ∷ []) "2Thess.3.14"
∷ word (ἵ ∷ ν ∷ α ∷ []) "2Thess.3.14"
∷ word (ἐ ∷ ν ∷ τ ∷ ρ ∷ α ∷ π ∷ ῇ ∷ []) "2Thess.3.14"
∷ word (κ ∷ α ∷ ὶ ∷ []) "2Thess.3.15"
∷ word (μ ∷ ὴ ∷ []) "2Thess.3.15"
∷ word (ὡ ∷ ς ∷ []) "2Thess.3.15"
∷ word (ἐ ∷ χ ∷ θ ∷ ρ ∷ ὸ ∷ ν ∷ []) "2Thess.3.15"
∷ word (ἡ ∷ γ ∷ ε ∷ ῖ ∷ σ ∷ θ ∷ ε ∷ []) "2Thess.3.15"
∷ word (ἀ ∷ ∙λ ∷ ∙λ ∷ ὰ ∷ []) "2Thess.3.15"
∷ word (ν ∷ ο ∷ υ ∷ θ ∷ ε ∷ τ ∷ ε ∷ ῖ ∷ τ ∷ ε ∷ []) "2Thess.3.15"
∷ word (ὡ ∷ ς ∷ []) "2Thess.3.15"
∷ word (ἀ ∷ δ ∷ ε ∷ ∙λ ∷ φ ∷ ό ∷ ν ∷ []) "2Thess.3.15"
∷ word (Α ∷ ὐ ∷ τ ∷ ὸ ∷ ς ∷ []) "2Thess.3.16"
∷ word (δ ∷ ὲ ∷ []) "2Thess.3.16"
∷ word (ὁ ∷ []) "2Thess.3.16"
∷ word (κ ∷ ύ ∷ ρ ∷ ι ∷ ο ∷ ς ∷ []) "2Thess.3.16"
∷ word (τ ∷ ῆ ∷ ς ∷ []) "2Thess.3.16"
∷ word (ε ∷ ἰ ∷ ρ ∷ ή ∷ ν ∷ η ∷ ς ∷ []) "2Thess.3.16"
∷ word (δ ∷ ῴ ∷ η ∷ []) "2Thess.3.16"
∷ word (ὑ ∷ μ ∷ ῖ ∷ ν ∷ []) "2Thess.3.16"
∷ word (τ ∷ ὴ ∷ ν ∷ []) "2Thess.3.16"
∷ word (ε ∷ ἰ ∷ ρ ∷ ή ∷ ν ∷ η ∷ ν ∷ []) "2Thess.3.16"
∷ word (δ ∷ ι ∷ ὰ ∷ []) "2Thess.3.16"
∷ word (π ∷ α ∷ ν ∷ τ ∷ ὸ ∷ ς ∷ []) "2Thess.3.16"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.16"
∷ word (π ∷ α ∷ ν ∷ τ ∷ ὶ ∷ []) "2Thess.3.16"
∷ word (τ ∷ ρ ∷ ό ∷ π ∷ ῳ ∷ []) "2Thess.3.16"
∷ word (ὁ ∷ []) "2Thess.3.16"
∷ word (κ ∷ ύ ∷ ρ ∷ ι ∷ ο ∷ ς ∷ []) "2Thess.3.16"
∷ word (μ ∷ ε ∷ τ ∷ ὰ ∷ []) "2Thess.3.16"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ω ∷ ν ∷ []) "2Thess.3.16"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.16"
∷ word (Ὁ ∷ []) "2Thess.3.17"
∷ word (ἀ ∷ σ ∷ π ∷ α ∷ σ ∷ μ ∷ ὸ ∷ ς ∷ []) "2Thess.3.17"
∷ word (τ ∷ ῇ ∷ []) "2Thess.3.17"
∷ word (ἐ ∷ μ ∷ ῇ ∷ []) "2Thess.3.17"
∷ word (χ ∷ ε ∷ ι ∷ ρ ∷ ὶ ∷ []) "2Thess.3.17"
∷ word (Π ∷ α ∷ ύ ∷ ∙λ ∷ ο ∷ υ ∷ []) "2Thess.3.17"
∷ word (ὅ ∷ []) "2Thess.3.17"
∷ word (ἐ ∷ σ ∷ τ ∷ ι ∷ ν ∷ []) "2Thess.3.17"
∷ word (σ ∷ η ∷ μ ∷ ε ∷ ῖ ∷ ο ∷ ν ∷ []) "2Thess.3.17"
∷ word (ἐ ∷ ν ∷ []) "2Thess.3.17"
∷ word (π ∷ ά ∷ σ ∷ ῃ ∷ []) "2Thess.3.17"
∷ word (ἐ ∷ π ∷ ι ∷ σ ∷ τ ∷ ο ∷ ∙λ ∷ ῇ ∷ []) "2Thess.3.17"
∷ word (ο ∷ ὕ ∷ τ ∷ ω ∷ ς ∷ []) "2Thess.3.17"
∷ word (γ ∷ ρ ∷ ά ∷ φ ∷ ω ∷ []) "2Thess.3.17"
∷ word (ἡ ∷ []) "2Thess.3.18"
∷ word (χ ∷ ά ∷ ρ ∷ ι ∷ ς ∷ []) "2Thess.3.18"
∷ word (τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.18"
∷ word (κ ∷ υ ∷ ρ ∷ ί ∷ ο ∷ υ ∷ []) "2Thess.3.18"
∷ word (ἡ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.18"
∷ word (Ἰ ∷ η ∷ σ ∷ ο ∷ ῦ ∷ []) "2Thess.3.18"
∷ word (Χ ∷ ρ ∷ ι ∷ σ ∷ τ ∷ ο ∷ ῦ ∷ []) "2Thess.3.18"
∷ word (μ ∷ ε ∷ τ ∷ ὰ ∷ []) "2Thess.3.18"
∷ word (π ∷ ά ∷ ν ∷ τ ∷ ω ∷ ν ∷ []) "2Thess.3.18"
∷ word (ὑ ∷ μ ∷ ῶ ∷ ν ∷ []) "2Thess.3.18"
∷ []
|
SVM.g4 | NarcAle/FOOL | 0 | 1854 | grammar SVM;
@header {
import java.util.HashMap;
}
@lexer::members {
int lexicalErrors=0;
}
@parser::members {
int[] code = new int[ExecuteVM.CODESIZE];
private int i = 0;
private HashMap<String,Integer> labelAdd = new HashMap<String,Integer>();
private HashMap<Integer,String> labelRef = new HashMap<Integer,String>();
}
/*------------------------------------------------------------------
* PARSER RULES
*------------------------------------------------------------------*/
assembly:
( PUSH n=NUMBER {code[i++] = PUSH;
code[i++] = Integer.parseInt($n.text);}
| PUSH l=LABEL {code[i++] = PUSH; //
labelRef.put(i++,$l.text);}
| POP {code[i++] = POP;}
| ADD {code[i++] = ADD;}
| SUB {code[i++] = SUB;}
| MULT {code[i++] = MULT;}
| DIV {code[i++] = DIV;}
| STOREW {code[i++] = STOREW;} //
| LOADW {code[i++] = LOADW;} //
| l=LABEL COL {labelAdd.put($l.text,i);}
| BRANCH l=LABEL {code[i++] = BRANCH;
labelRef.put(i++,$l.text);}
| BRANCHEQ l=LABEL {code[i++] = BRANCHEQ; //
labelRef.put(i++,$l.text);}
| BRANCHLESSEQ l=LABEL {code[i++] = BRANCHLESSEQ;
labelRef.put(i++,$l.text);}
| JS {code[i++] = JS;} //
| LOADRA {code[i++] = LOADRA;} //
| STORERA {code[i++] = STORERA;} //
| LOADRV {code[i++] = LOADRV;} //
| STORERV {code[i++] = STORERV;} //
| LOADFP {code[i++] = LOADFP;} //
| STOREFP {code[i++] = STOREFP;} //
| COPYFP {code[i++] = COPYFP;} //
| LOADHP {code[i++] = LOADHP;} //
| STOREHP {code[i++] = STOREHP;} //
| PRINT {code[i++] = PRINT;}
| HALT {code[i++] = HALT;}
)* { for (Integer refAdd: labelRef.keySet()) {
code[refAdd]=labelAdd.get(labelRef.get(refAdd));
}
} ;
/*------------------------------------------------------------------
* LEXER RULES
*------------------------------------------------------------------*/
PUSH : 'push' ;
POP : 'pop' ;
ADD : 'add' ;
SUB : 'sub' ;
MULT : 'mult' ;
DIV : 'div' ;
STOREW : 'sw' ;
LOADW : 'lw' ;
BRANCH : 'b' ;
BRANCHEQ : 'beq' ;
BRANCHLESSEQ:'bleq' ;
JS : 'js' ;
LOADRA : 'lra' ;
STORERA : 'sra' ;
LOADRV : 'lrv' ;
STORERV : 'srv' ;
LOADFP : 'lfp' ;
STOREFP : 'sfp' ;
COPYFP : 'cfp' ;
LOADHP : 'lhp' ;
STOREHP : 'shp' ;
PRINT : 'print' ;
HALT : 'halt' ;
COL : ':' ;
LABEL : ('a'..'z'|'A'..'Z')('a'..'z' | 'A'..'Z' | '0'..'9')* ;
NUMBER : '0' | ('-')?(('1'..'9')('0'..'9')*) ;
WHITESP : (' '|'\t'|'\n'|'\r')+ -> channel(HIDDEN) ;
ERR : . { System.out.println("Invalid char: "+ getText()); lexicalErrors++; } -> channel(HIDDEN);
|
alloy4fun_models/trashltl/models/1/He8jAbQ9DLWZWg2CG.als | Kaixi26/org.alloytools.alloy | 0 | 3219 | <gh_stars>0
open main
pred idHe8jAbQ9DLWZWg2CG_prop2 {
historically no File
eventually some File
}
pred __repair { idHe8jAbQ9DLWZWg2CG_prop2 }
check __repair { idHe8jAbQ9DLWZWg2CG_prop2 <=> prop2o } |
oeis/345/A345980.asm | neoneye/loda-programs | 11 | 27217 | <reponame>neoneye/loda-programs<filename>oeis/345/A345980.asm
; A345980: a(n) = spum of a path P_n.
; Submitted by <NAME>
; 5,7,9,12,15,19,22,23,26,27,30
lpb $0
sub $0,1
mov $1,10
sub $1,$4
add $3,$2
add $1,$3
sub $3,$2
add $1,$3
mod $1,3
mov $2,$3
add $4,1
mov $5,$4
add $4,$1
div $5,3
add $5,$4
mov $3,$5
lpe
mov $0,$3
add $0,5
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xa0_notsx.log_21829_352.asm | ljhsiun2/medusa | 9 | 4039 | .global s_prepare_buffers
s_prepare_buffers:
push %r14
push %r8
push %rbp
push %rcx
lea addresses_D_ht+0x66e9, %rbp
nop
nop
and %r8, %r8
vmovups (%rbp), %ymm7
vextracti128 $0, %ymm7, %xmm7
vpextrq $1, %xmm7, %rcx
nop
nop
xor %r14, %r14
pop %rcx
pop %rbp
pop %r8
pop %r14
ret
.global s_faulty_load
s_faulty_load:
push %r15
push %r8
push %rbp
push %rbx
push %rcx
push %rdx
push %rsi
// Store
lea addresses_UC+0x2911, %r8
nop
nop
nop
sub %rcx, %rcx
mov $0x5152535455565758, %r15
movq %r15, %xmm4
movups %xmm4, (%r8)
nop
and $8480, %r15
// Store
lea addresses_WT+0x133ad, %rbx
nop
nop
add $40299, %r8
mov $0x5152535455565758, %rdx
movq %rdx, %xmm5
movups %xmm5, (%rbx)
nop
add %rcx, %rcx
// Store
lea addresses_PSE+0x158d1, %r8
nop
nop
nop
nop
xor %rsi, %rsi
mov $0x5152535455565758, %rdx
movq %rdx, %xmm4
movups %xmm4, (%r8)
nop
nop
xor %r15, %r15
// Faulty Load
lea addresses_UC+0xf611, %r15
and %rdx, %rdx
mov (%r15), %ebx
lea oracles, %rdx
and $0xff, %rbx
shlq $12, %rbx
mov (%rdx,%rbx,1), %rbx
pop %rsi
pop %rdx
pop %rcx
pop %rbx
pop %rbp
pop %r8
pop %r15
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_UC', 'AVXalign': False, 'size': 32, 'NT': True, 'same': False, 'congruent': 0}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC', 'AVXalign': False, 'size': 16, 'NT': False, 'same': False, 'congruent': 8}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WT', 'AVXalign': False, 'size': 16, 'NT': False, 'same': False, 'congruent': 2}}
{'OP': 'STOR', 'dst': {'type': 'addresses_PSE', 'AVXalign': False, 'size': 16, 'NT': False, 'same': False, 'congruent': 5}}
[Faulty Load]
{'src': {'type': 'addresses_UC', 'AVXalign': False, 'size': 4, 'NT': False, 'same': True, 'congruent': 0}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'size': 32, 'NT': False, 'same': False, 'congruent': 3}, 'OP': 'LOAD'}
{'37': 21829}
37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37 37
*/
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/vect9.adb | best08618/asylo | 7 | 27177 | <reponame>best08618/asylo
-- { dg-do compile }
-- { dg-options "-O -w" }
package body Vect9 is
function Cmove
(X : in Unit;
Y : in Unit;
If_True : in Unit;
If_False : in Unit)
return Unit
is
Res : Unit;
begin
for P in Unit'Range loop
if X (P) >= Y (P) then
Res (P) := If_True (P);
else
Res (P) := If_False (P);
end if;
end loop;
return Res;
end;
pragma Inline_Always (Cmove);
procedure Proc
(This : in Rec;
CV : in Unit_Vector;
Data : in out Unit_Vector)
is
begin
for Index in Data'Range loop
Data (Index) := Mul (Zero_Unit, Zero_Unit);
declare
Addend : constant Unit
:= Cmove (CV (Index), Zero_Unit, Zero_Unit, Zero_Unit) ;
begin
Data (Index) := Data(Index) + Addend;
end;
This.Data (Index) := Data (Index);
end loop;
end;
end Vect9;
|
libsrc/z80_crt0s/z80/sccz80/l_bcneg.asm | jpoikela/z88dk | 38 | 96751 | ; Z88 Small C+ Run time Library
; Moved functions over to proper libdefs
; To make startup code smaller and neater!
;
; 6/9/98 djm
SECTION code_crt0_sccz80
PUBLIC l_bcneg
; {BC = -BC}
.l_bcneg
ld a,b
cpl
ld b,a
ld a,c
cpl
ld c,a
inc bc
ret
|
bcm-secimage/gmp-6.0.0/mpn/gcd_1.asm | hixio-mh/citadel_sdk_2.1.1 | 0 | 4333 | <reponame>hixio-mh/citadel_sdk_2.1.1
dnl x86 mpn_gcd_1 optimised for processors with fast BSF.
dnl Based on the K7 gcd_1.asm, by <NAME>. Rehacked by <NAME>.
dnl Copyright 2000-2002, 2005, 2009, 2011, 2012 Free Software Foundation, Inc.
dnl This file is part of the GNU MP Library.
dnl
dnl The GNU MP Library is free software; you can redistribute it and/or modify
dnl it under the terms of either:
dnl
dnl * the GNU Lesser General Public License as published by the Free
dnl Software Foundation; either version 3 of the License, or (at your
dnl option) any later version.
dnl
dnl or
dnl
dnl * the GNU General Public License as published by the Free Software
dnl Foundation; either version 2 of the License, or (at your option) any
dnl later version.
dnl
dnl or both in parallel, as here.
dnl
dnl The GNU MP Library is distributed in the hope that it will be useful, but
dnl WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
dnl or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
dnl for more details.
dnl
dnl You should have received copies of the GNU General Public License and the
dnl GNU Lesser General Public License along with the GNU MP Library. If not,
dnl see https://www.gnu.org/licenses/.
include(`../config.m4')
C cycles/bit (approx)
C AMD K7 7.80
C AMD K8,K9 7.79
C AMD K10 4.08
C AMD bd1 ?
C AMD bobcat 7.82
C Intel P4-2 14.9
C Intel P4-3/4 14.0
C Intel P6/13 5.09
C Intel core2 4.22
C Intel NHM 5.00
C Intel SBR 5.00
C Intel atom 17.1
C VIA nano ?
C Numbers measured with: speed -CD -s16-32 -t16 mpn_gcd_1
C Threshold of when to call bmod when U is one limb. Should be about
C (time_in_cycles(bmod_1,1) + call_overhead) / (cycles/bit).
define(`BMOD_THRES_LOG2', 6)
define(`up', `%edi')
define(`n', `%esi')
define(`v0', `%edx')
ASM_START()
TEXT
ALIGN(16)
PROLOGUE(mpn_gcd_1)
push %edi
push %esi
mov 12(%esp), up
mov 16(%esp), n
mov 20(%esp), v0
mov (up), %eax C U low limb
or v0, %eax
bsf %eax, %eax C min(ctz(u0),ctz(v0))
bsf v0, %ecx
shr %cl, v0
push %eax C preserve common twos over call
push v0 C preserve v0 argument over call
cmp $1, n
jnz L(reduce_nby1)
C Both U and V are single limbs, reduce with bmod if u0 >> v0.
mov (up), %ecx
mov %ecx, %eax
shr $BMOD_THRES_LOG2, %ecx
cmp %ecx, v0
ja L(reduced)
jmp L(bmod)
L(reduce_nby1):
cmp $BMOD_1_TO_MOD_1_THRESHOLD, n
jl L(bmod)
ifdef(`PIC_WITH_EBX',`
push %ebx
call L(movl_eip_to_ebx)
add $_GLOBAL_OFFSET_TABLE_, %ebx
')
push v0 C param 3
push n C param 2
push up C param 1
CALL( mpn_mod_1)
jmp L(called)
L(bmod):
ifdef(`PIC_WITH_EBX',`dnl
push %ebx
call L(movl_eip_to_ebx)
add $_GLOBAL_OFFSET_TABLE_, %ebx
')
push v0 C param 3
push n C param 2
push up C param 1
CALL( mpn_modexact_1_odd)
L(called):
add $12, %esp C deallocate params
ifdef(`PIC_WITH_EBX',`dnl
pop %ebx
')
L(reduced):
pop %edx
bsf %eax, %ecx
C test %eax, %eax C FIXME: does this lower latency?
jnz L(mid)
jmp L(end)
ALIGN(16) C K10 BD C2 NHM SBR
L(top): cmovc( %esi, %eax) C if x-y < 0 0,3 0,3 0,6 0,5 0,5
cmovc( %edi, %edx) C use x,y-x 0,3 0,3 2,8 1,7 1,7
L(mid): shr %cl, %eax C 1,7 1,6 2,8 2,8 2,8
mov %edx, %esi C 1 1 4 3 3
sub %eax, %esi C 2 2 5 4 4
bsf %esi, %ecx C 3 3 6 5 5
mov %eax, %edi C 2 2 3 3 4
sub %edx, %eax C 2 2 4 3 4
jnz L(top) C
L(end): pop %ecx
mov %edx, %eax
shl %cl, %eax
pop %esi
pop %edi
ret
ifdef(`PIC_WITH_EBX',`dnl
L(movl_eip_to_ebx):
mov (%esp), %ebx
ret
')
EPILOGUE()
|
programs/oeis/093/A093935.asm | neoneye/loda | 22 | 91233 | ; A093935: a(1) = 1, a(n+1) = a(n) + n*(a(1) + a(2) + ... + a(n)).
; 1,2,8,41,249,1754,14084,127057,1272625,14015014,168323364,2189619553,30670104577,460235322854,7366138539416,125257398648401,2255126454472401,42855262052316218,857238357862313360
mov $1,$0
mov $0,0
lpb $1
add $2,$1
mov $3,$0
mul $3,$1
sub $1,1
add $2,$3
add $0,$2
lpe
add $0,1
|
Transynther/x86/_processed/NONE/_xt_sm_/i7-8650U_0xd2.log_807_478.asm | ljhsiun2/medusa | 9 | 88108 | <filename>Transynther/x86/_processed/NONE/_xt_sm_/i7-8650U_0xd2.log_807_478.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r8
push %r9
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_normal_ht+0x3aaf, %rsi
lea addresses_WC_ht+0x19af, %rdi
nop
nop
nop
nop
sub %r8, %r8
mov $47, %rcx
rep movsq
nop
nop
nop
nop
dec %rsi
lea addresses_D_ht+0x17baf, %rsi
lea addresses_WT_ht+0xe9ec, %rdi
nop
nop
nop
nop
nop
inc %r9
mov $112, %rcx
rep movsq
nop
nop
nop
nop
sub $57240, %r9
lea addresses_D_ht+0xb6ef, %rdx
nop
nop
nop
nop
nop
inc %rdi
movw $0x6162, (%rdx)
nop
nop
nop
sub %rcx, %rcx
lea addresses_D_ht+0xf72f, %rsi
lea addresses_WC_ht+0x47df, %rdi
clflush (%rsi)
nop
cmp %r8, %r8
mov $69, %rcx
rep movsq
nop
nop
nop
nop
nop
cmp %r8, %r8
lea addresses_D_ht+0xe8af, %rcx
add %r12, %r12
mov (%rcx), %esi
nop
nop
and $33036, %r8
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %r9
pop %r8
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r11
push %r13
push %r14
push %rbp
push %rbx
push %rcx
// Load
mov $0x5af, %rbx
nop
nop
inc %r10
mov (%rbx), %cx
nop
nop
xor %r10, %r10
// Store
lea addresses_A+0xb4af, %r14
and $6308, %rbp
mov $0x5152535455565758, %r11
movq %r11, %xmm2
movups %xmm2, (%r14)
nop
nop
nop
xor %r10, %r10
// Store
lea addresses_PSE+0x1ccaf, %r11
clflush (%r11)
nop
and $17951, %rcx
mov $0x5152535455565758, %r13
movq %r13, (%r11)
nop
nop
cmp $8825, %r13
// Faulty Load
lea addresses_PSE+0x1ccaf, %rbp
clflush (%rbp)
nop
nop
nop
nop
nop
xor %r11, %r11
movb (%rbp), %bl
lea oracles, %rcx
and $0xff, %rbx
shlq $12, %rbx
mov (%rcx,%rbx,1), %rbx
pop %rcx
pop %rbx
pop %rbp
pop %r14
pop %r13
pop %r11
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_PSE', 'size': 1, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_P', 'size': 2, 'AVXalign': False, 'NT': False, 'congruent': 5, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_A', 'size': 16, 'AVXalign': False, 'NT': False, 'congruent': 11, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_PSE', 'size': 8, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_PSE', 'size': 1, 'AVXalign': False, 'NT': False, 'congruent': 0, 'same': True}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'type': 'addresses_normal_ht', 'congruent': 7, 'same': False}, 'dst': {'type': 'addresses_WC_ht', 'congruent': 5, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_D_ht', 'congruent': 6, 'same': False}, 'dst': {'type': 'addresses_WT_ht', 'congruent': 0, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_D_ht', 'size': 2, 'AVXalign': True, 'NT': False, 'congruent': 5, 'same': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_D_ht', 'congruent': 7, 'same': False}, 'dst': {'type': 'addresses_WC_ht', 'congruent': 0, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'size': 4, 'AVXalign': False, 'NT': False, 'congruent': 8, 'same': False}}
{'58': 807}
58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58 58
*/
|
src/libhello.ads | alire-project/libhello | 1 | 4867 | <filename>src/libhello.ads
package libhello is
procedure Hello_World;
end libhello;
|
programs/oeis/138/A138182.asm | neoneye/loda | 22 | 97847 | <reponame>neoneye/loda<filename>programs/oeis/138/A138182.asm<gh_stars>10-100
; A138182: Smallest summand in the Zeckendorf representation of the n-th prime.
; 2,3,5,2,3,13,1,1,2,8,2,3,2,1,13,1,1,1,1,3,5,3,2,89,8,1,1,5,2,3,1,8,1,3,5,2,13,1,2,8,1,3,13,2,1,55,1,3,2,1,233,1,8,5,3,1,2,1,2,1,3,5,1,2,1,8,1,2,1,1,2,3,3,1,2,1,1,2,3,3,8,2,2,1,2,3,1,1,8,2,1,13,21,1,1,3,1,144,2,2
seq $0,40 ; The prime numbers.
lpb $0
mov $1,$0
mov $2,$0
seq $2,66628 ; a(n) = n - the largest Fibonacci number <= n.
mov $0,$2
lpe
mov $0,$1
|
programs/oeis/184/A184632.asm | karttu/loda | 1 | 7712 | <gh_stars>1-10
; A184632: Floor(1/{(8+n^4)^(1/4)}), where {}=fractional part.
; 1,4,13,32,62,108,171,256,364,500,665,864,1098,1372,1687,2048,2456,2916,3429,4000,4630,5324,6083,6912,7812,8788,9841,10976,12194,13500,14895,16384,17968,19652,21437,23328,25326,27436,29659,32000,34460,37044,39753,42592,45562,48668,51911,55296,58824,62500,66325,70304,74438,78732,83187,87808,92596,97556,102689,108000
mov $1,$0
add $1,1
pow $1,3
div $1,2
trn $1,1
add $1,1
|
04/mult/tests/mult.asm | yairfine/nand-to-tetris | 1 | 97622 | // This file is part of www.nand2tetris.org
// and the book "The Elements of Computing Systems"
// by <NAME> Schocken, MIT Press.
// File name: projects/04/Mult.asm
// Multiplies R0 and R1 and stores the result in R2.
// (R0, R1, R2 refer to RAM[0], RAM[1], and RAM[2], respectively.)
// Initialize variables
@mask
M=1
@R0
D=M
@shifted
M=D
@R2
M=0
// Start multiplication loop
(LOOP)
@R1
D=M
@mask
D=D&M
@AFTER_ADD
D; JEQ
@shifted
D=M
@R2
M=M+D
(AFTER_ADD)
@shifted
M=M<<
@mask
M=M<<
D=M
@LOOP
D; JNE
|
Library/Hash/hIndex.asm | steakknife/pcgeos | 504 | 86499 | COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) Geoworks 1994 -- All Rights Reserved
PROJECT: Legos
MODULE: Hash Library
FILE: hIndex.asm
AUTHOR: <NAME>, Nov 21, 1994
ROUTINES:
Name Description
---- -----------
GLB HashTableResize Expand and rehash a hash table
GLB HashTableCreate Create a hash table in an LMem heap
GLB HashTableLookup Look up an entry in the hash table
GLB HashTableRemove Remove an element from the hash table
EXT HT_LookupLow Look up an entry in the hash table
INT HT_SlowCheck Check to see if a chunklet really matches by
calling the comparison callback routine
GLB HashTableAdd Add an entry
INT HT_CheckChain Check a chain to see if it contains an element
INT HT_HashData Call the hash function and return the full hash
value and the corresponding hash chain.
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/21/94 Initial revision
DESCRIPTION:
Routines that manage the index chunk.
These are also the user-level hash table routines.
$Id: hindex.asm,v 1.1 97/05/30 06:48:55 newdeal Exp $
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
MainCode segment resource
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HashTableResize
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Expand and rehash a hash table
CALLED BY: GLOBAL
PASS: *ds:si - hash table
cx - new # buckets
RETURN: carry - set on error
DESTROYED: nothing
SIDE EFFECTS:
Hash table integrity is checked before and afterwards.
PSEUDO CODE/STRATEGY:
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 1/30/95 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HashTableResize proc far
uses ax,bx,cx,dx, es,di,si,bp
.enter
; Resize index chunk. OK to punt if this fails, we haven't
; messed up any data structures (yet :)
;
EC < call ECCheckHashTable >
tst cx
LONG_EC jz errorDone
mov bx, cx ; save for later
shl cx ; each bucket is 2 bytes
mov di, ds:[si]
add cx, ds:[di].HTH_headerSize
mov ax, si
call LMemReAlloc
jc done
; Null out list heads in preparation for re-hashing everything
; Also, update HTH_headerSize
;
mov di, ds:[si] ; ds:di <- hash table
mov ds:[di].HTH_tableSize, bx
segmov es, ds, ax
add di, es:[di].HTH_headerSize
mov cx, bx
mov ax, MH_NULL_ELEMENT
rep stosw
; Mark free miniheap elements so we don't try to hash them
;
mov si, ds:[si]
mov di, si ; ds:di <- hash table
mov si, ds:[si].HTH_heap
call MHMarkFree
; Finally... re-create hash bucket lists
;
mov si, ds:[si] ; ds:si <- mini heap
mov cx, ds:[si].MHH_size
mov bp, offset MHH_data
jcxz done ; don't need to call MHRestoreFree
; because there aren't any elts.
addLoop:
; ds:di - hash table
; ds:si - mini heap
; ds:si+bp - current chunklet
cmp ds:[si+bp].HTE_link, MH_FREE_ELEMENT
je al_next
push cx
movdw cxdx, ({dword}ds:[si+bp].HTE_data)
call HT_HashData ; ax <- hash, bx <- entry #
EC < cmp ah, ds:[si+bp].HTE_keyBits >
EC < ERROR_NE HASH_TABLE_INTERNAL_ERROR >
pop cx
; Point ds:[di+bx] at list head, push current elt onto list
;
shl bx ; heads are a word apiece
add bx, ds:[di].HTH_headerSize
mov dx, ds:[di+bx] ; dx <- old list head
mov ds:[di+bx], bp ; current chunklet is now head
mov ds:[si+bp].HTE_link, dx
al_next:
add bp, ds:[si].MHH_entrySize
loop addLoop
mov si, ds:[di].HTH_heap
call MHRestoreFree
clc
done:
.leave
EC < call ECCheckHashTable >
ret
errorDone:
stc
jmp done
HashTableResize endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HashTableCreate
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Create a hash table in an LMem heap
CALLED BY: GLOBAL
PASS:
ds - block for new table
al - ObjChunkFlags to pass to LMemAlloc
bx - HashTableFlags
cx - size for HashTableHeader (this allows for reserving extra
space) 0 = default. Extra space is initialized to zeros.
dx - initial # of list heads/buckets
stack - vfptr to comparison function (pushed first),
vfptr to hash function
RETURN:
args not popped off stack
carry set if couldn't allocate chunk and LMF_RETURN_ERRORS set
carry clear if array allocated:
*ds:ax - table (block possibly moved)
DESTROYED: nothing
SIDE EFFECTS:
WARNING: This routine MAY resize the LMem block, moving it on the
heap and invalidating stored segment pointers and current
register or stored offsets to it.
PSEUDO CODE/STRATEGY:
Rounds header size up to nearest word
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/ 7/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HashTableCreate proc far hashFn: vfptr,
compFn: vfptr
uses cx,si,di,es
objChunkFlags local word push ax
tableChunk local lptr
.enter
if ERROR_CHECK
Assert lmem, ds:[LMBH_handle]
push bx
and bx, mask HTF_ENTRY_SIZE
tst bx
ERROR_Z HASH_TABLE_BAD_ENTRY_SIZE
cmp bx, 4
ERROR_A HASH_TABLE_BAD_ENTRY_SIZE
pop bx
tst dx
ERROR_Z HASH_TABLE_BAD_TABLE_SIZE
endif
tst cx
jnz notZero
mov cx, size HashTableHeader
notZero:
EC < cmp cx, size HashTableHeader >
EC < ERROR_B HASH_TABLE_HEADER_TOO_SMALL >
inc cx ; round up to nearest word
and cx, 0xfffe
mov si, cx ; si <- header size
add cx, dx
add cx, dx ; allocate one word per entry
call LMemAlloc ; ax <- new chunk
jc done
; Initialize the header
mov ss:[tableChunk], ax
mov_tr di, ax
mov di, ds:[di]
mov ds:[di].HTH_flags, bx
mov ds:[di].HTH_tableSize, dx
movdw ds:[di].HTH_hashFunction, hashFn, ax
movdw ds:[di].HTH_compFunction, compFn, ax
mov ds:[di].HTH_headerSize, si
; Initialize the rest of the chunk
segmov es, ds, ax
add di, size HashTableHeader
; Zero out the rest of the header, if there is any
mov_tr cx, si ; cx <- header size
sub cx, size HashTableHeader
jz initHeads
shr cx ; convert to words
clr ax
rep stosw
; Set all the list heads to MH_NULL_ELEMENT
; es:di points just past the header and is word aligned
initHeads:
mov ax, MH_NULL_ELEMENT
mov cx, dx ; cx <- # list heads (word apiece)
rep stosw
; allocate the "heap" chunk
allocHeap::
CheckHack <offset HTF_ENTRY_SIZE eq 0>
CheckHack <width HTF_ENTRY_SIZE le 8>
mov ax, ss:[objChunkFlags]
mov cx, bx ; cx <- flags
and cx, mask HTF_ENTRY_SIZE
add cx, size HashTableEntry
call MiniHeapCreate
jc cleanUp
mov_tr cx, ax ; cx <- new chunk
mov si, ss:[tableChunk]
mov ax, si ; ax <- index chunk
mov si, ds:[si]
mov ds:[si].HTH_heap, cx
if ERROR_CHECK
push si
mov si, ax ; *ds:si <- table
call ECCheckHashTable
pop si
endif
clc
done:
.leave
ret
; need to return with error after cleaning up chunks...
cleanUp:
mov ax, ss:[tableChunk]
call LMemFree
stc
jmp done
HashTableCreate endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HashTableLookup
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Look up an entry in the hash table
CALLED BY: GLOBAL
PASS: *ds:si - Hash table
ax - hash value of the item you're looking up
cxdx - passed to callback routine
RETURN: carry - set if not found
cxdx - data from the entry
DESTROYED: nothing
SIDE EFFECTS:
PSEUDO CODE/STRATEGY:
C stub HASHTABLELOOKUP directly calls HT_LookupLow, so don't
mess with this routine.
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/17/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HashTableLookup proc far
push bx
clr bx ; don't delete, just look up
call HT_LookupLow
pop bx
ret
HashTableLookup endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HashTableRemove
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Remove an element from the hash table
CALLED BY: GLOBAL
PASS: *ds:si - hash table
ax - hash value of the item you're removing
cxdx - passed to callback routine
RETURN: carry - set if not found
cxdx - data from the entry
DESTROYED: nothing
SIDE EFFECTS:
PSEUDO CODE/STRATEGY:
C stub HASHTABLEREMOVE directly calls HT_LookupLow, so don't
mess with this routine.
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/18/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HashTableRemove proc far
push bx
mov bx, 1 ; lookup and delete
call HT_LookupLow
pop bx
ret
HashTableRemove endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HT_LookupLow
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Look up an entry in the hash table
CALLED BY: EXTERNAL
HashTableLookup, HashTableRemove, HASHTABLELOOKUP,
HASHTABLEREMOVE
PASS: *ds:si - Hash table
ax - hash value of the item you're looking up
bx - non zero to delete the item found
cxdx - passed to callback routine
RETURN: carry - set if not found
cxdx - data from the entry
DESTROYED: bx
SIDE EFFECTS:
PSEUDO CODE/STRATEGY:
Take ax % <table size> as the chain to search.
Look through the chain for a match. The high byte of the
hash value is compared with the stored byte in each element,
to reduce the number of calls to the callback comparison routine.
(note that the high byte was picked because it is less likely to
be related to ax % <table size>)
Handle deletions by keeping a pointer to the previous "link" field
around -- this conveniently handles both the case where we are
deleting the first element in a chain (in which case the pointer
will be somewhere in the index chunk) and otherwise (pointer will
point to a HTE_link field in some chunklet).
When we delete, we just massage the data on the other end of that
pointer.
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/18/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HT_LookupLow proc far
remove local word push bx
index local nptr.HashTableHeader
uses ax,si,di
.enter
EC < call ECCheckHashTable >
mov si, ds:[si] ; ds:si <- index
mov ss:[index], si
mov bx, ds:[si].HTH_tableSize
; get the chain # into bx
;
push dx, ax
clr dx
EC < tst bx >
EC < ERROR_Z -1 >
div bx ; dx <- chain #
mov bx, dx
pop dx, ax
; Get the first chunklet in the chain into bx
; We can bail out quick here if it turns out the chain is empty
; Keep a pointer to the previous link field around, in case we
; need to perform a delete.
;
shl bx
add bx, ds:[si].HTH_headerSize
lea di, ds:[si+bx]
mov bx, ds:[di]
cmp bx, MH_NULL_ELEMENT
je fail
; Loop over elements in the chain
; ds:[si+bx] - chunklet
; ds:di - prev link field
; ax - hash value
; cxdx - callback data
;
mov si, ds:[si].HTH_heap
mov si, ds:[si] ; ds:si <- mini heap
EC < call ECCheckMiniHeap >
compLoop:
EC < call ECCheckUsedChunklet >
cmp ds:[si+bx].HTE_keyBits, ah
je cl_slowCheck
cl_next:
lea di, ds:[si+bx].HTE_link
mov bx, ds:[di]
cmp bx, MH_NULL_ELEMENT
jne compLoop
jmp fail
cl_slowCheck:
call HT_SlowCheck
jnc success
jmp cl_next
; It is OK if we read garbage bytes (ie, the table is storing
; < 4 bytes/entry) since the value of the unused portions of cxdx
; is undefined. It's also more time/effort/space efficient to do
; this than to make yet another jump table...
success:
PrintMessage <Note: read checking turned off here>
.norcheck
mov dx, {word}ds:[si+bx].HTE_data
mov cx, {word}ds:[si+bx].HTE_data[2]
tst ss:[remove]
jnz removeIt
noRemove:
clc
done:
.leave
ret
removeIt:
; Fix up previous link field to point to chunklet after this one,
; then set the chunklet free
;
memmov ds:[di], ds:[si+bx].HTE_link, ax
mov si, ss:[index]
mov si, ds:[si].HTH_heap
call MHFree
jmp noRemove
fail:
stc
jmp done
HT_LookupLow endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HT_SlowCheck
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Check to see if a chunklet really matches by calling the
comparison callback routine
CALLED BY: INTERNAL
HT_LookupLow
PASS: ds:si - mini heap
bx - chunklet
cxdx - data to pass to callback
stack - inherited frame
RETURN: carry - set if not equal
DESTROYED: nothing
SIDE EFFECTS:
PSEUDO CODE/STRATEGY:
Deal with callbacks written in C and assembly. This relies
on the HTF_C_API_CALLBACKS flag in the hash table header.
Assembly callback:
Pass: axbx - data from hash table entry
cxdx - data from caller
Return: carry - set if not equal
C callback:
Boolean cb(dword callbackData, dword elementData)
Returns true if equal
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/17/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HT_SlowCheck proc near
uses ax,bx,cx,dx,di
.enter inherit HT_LookupLow
mov di, ss:[index] ; ds:di <- index chunk
test ds:[di].HTH_flags, mask HTF_C_API_CALLBACKS
jnz pascalCall
; see comment by HT_LookupLow::success for an explanation
PrintMessage <Note: read checking turned off here>
.norcheck
memmov ss:[TPD_dataBX], {word}ds:[si+bx].HTE_data, ax
memmov ss:[TPD_dataAX], {word}ds:[si+bx].HTE_data[2], ax
movdw bxax, ds:[di].HTH_compFunction
call ProcCallFixedOrMovable
done:
.leave
ret
pascalCall:
; luser's callbacks written in C, use PROCCALLFIXEDORMOVABLE_PASCAL
;
push ds
; arg 1: callbackData
pushdw cxdx
; arg 2: elementData
pushdw ({dword}ds:[si+bx].HTE_data)
; arg 3: void *header
pushdw dsdi
; arg n: routine to call
;; pushdw ds:[di].HTH_compFunction
push ds:[di].HTH_compFunction.segment
push ds:[di].HTH_compFunction.offset
call PROCCALLFIXEDORMOVABLE_PASCAL
pop ds ; in case it called GEODELOADDGROUP
;; rcr ax ; but what if low bit isn't set?
tst_clc ax
jnz done
stc
jmp done
HT_SlowCheck endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HashTableAdd
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Add an entry
CALLED BY: GLOBAL
PASS: *ds:si - Hash table
bx - ds from C stub, undefined otherwise
cxdx - data to copy (see notes below)
RETURN: *ds:si - Hash table (block possibly moved)
carry - set on error
DESTROYED: nothing
SIDE EFFECTS:
LMem block might be resized.
PSEUDO CODE/STRATEGY:
Use a jump table to copy the right # of bytes.
Bytes are written little-endian style, which means that the least
significant bytes of cxdx are used first. If only two bytes are
being stored in each entry, cx is ignored. If three bytes, ch
is ignored.
Hash function should be:
Pass: cxdx - data
Return: ax - 16 bits of hash
May Destroy cx, dx
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/10/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HashTableAdd proc far
dataCX local word push cx
dataDX local word push dx
table local lptr push si
uses ax, bx, di
.enter
EC < call ECCheckHashTable >
mov di, ds:[si]
; Check to see whether it already exists in the chain
; Do this in EC even if HTF_NO_REPEAT_INSERT is set, so
; we can fatal error if assumtion isn't met.
;
call HT_HashData ; bx <- entry #, ax <- hash
mov cx, ss:[dataCX]
mov dx, ss:[dataDX]
if ERROR_CHECK
call HT_CheckChain
jc addIt
test ds:[di].HTH_flags, mask HTF_NO_REPEAT_INSERT
ERROR_NZ HASH_TABLE_DUPLICATE_ENTRY
stc
jmp done
else
test ds:[di].HTH_flags, mask HTF_NO_REPEAT_INSERT
jz addIt
call HT_CheckChain
cmc ; invert sense -- stc means found
jc done ; already exists, so punt
endif
CheckHack <offset HTF_ENTRY_SIZE eq 0>
addIt:
shl bx
add bx, ds:[di].HTH_headerSize
mov_tr cx, bx ; ds:[di+cx] <- offset to chain head
; Alloc chunklet and fill in
mov si, ds:[di].HTH_heap
mov di, ds:[di].HTH_flags
call MHAlloc ; can shuffle heap
mov dx, bx ; dx <- chunklet
add bx, ds:[si] ; ds:bx <- chunklet (pointer)
and di, mask HTF_ENTRY_SIZE
shl di ; cs:[copyTable][di] <- function to use
mov ds:[bx].HTE_keyBits, ah
call cs:[copyTable][di]
; Stick it on the head of the chain
mov si, ss:[table]
mov di, ds:[si]
add di, cx ; ds:di <- head of chain
memmov ds:[bx].HTE_link, ds:[di], ax
mov ds:[di], dx ; store new chunklet offset
done:
mov cx, ss:[dataCX]
mov dx, ss:[dataDX]
.leave
ret
copyTable nptr 0, copy1, copy2, copy3, copy4
copy1:
memmov {byte}ds:[bx].HTE_data[0], dataDX.low, al
retn
copy3:
memmov {byte}ds:[bx].HTE_data[2], dataCX.low, al
memmov {word}ds:[bx].HTE_data[0], dataDX, ax
retn
copy4:
memmov {word}ds:[bx].HTE_data[2], dataCX, ax
copy2:
memmov {word}ds:[bx].HTE_data[0], dataDX, ax
retn
HashTableAdd endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HT_CheckChain
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Check a chain to see if it contains an element
CALLED BY: INTERNAL
HashTableAdd
PASS: ds:di - Hash Table
bx - chain #
cxdx - data (or cl, cx, cxdl)
RETURN: carry - set on failure (not found)
DESTROYED: nothing
SIDE EFFECTS:
PSEUDO CODE/STRATEGY:
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/14/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HT_CheckChain proc near
uses bx, si, di
.enter
; get chain head into bx
;; XXX new
shl bx
add bx, ds:[di].HTH_headerSize
mov bx, ds:[di+bx]
mov si, ds:[di].HTH_heap
mov si, ds:[si] ; ds:si <- mini heap
mov di, ds:[di].HTH_flags
and di, mask HTF_ENTRY_SIZE
shl di
mov di, cs:[cmpTable][di] ; di <- "function" to use
cmp bx, MH_NULL_ELEMENT
je notFound
checkLoop:
jmp di
afterCmp:
je found
mov bx, ds:[si+bx].HTE_link
cmp bx, MH_NULL_ELEMENT
jne checkLoop
notFound:
stc
done:
.leave
ret
cmpTable nptr 0, cmp1, cmp2, cmp3, cmp4
found:
clc
jmp done
cmp1:
cmp {byte} ds:[si+bx].HTE_data, dl
jmp afterCmp
cmp3:
cmp {word} ds:[si+bx].HTE_data, dx
jne afterCmp
cmp {byte} ds:[si+bx].HTE_data[2], cl
jmp afterCmp
cmp4:
cmp {word} ds:[si+bx].HTE_data[2], cx
jne afterCmp
cmp2:
cmp {word} ds:[si+bx].HTE_data, dx
jmp afterCmp
HT_CheckChain endp
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
HT_HashData
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Call the hash function and return the full hash value and
the corresponding hash chain.
CALLED BY: INTERNAL
HashTableAdd
PASS: ds:di - Hash table
cxdx - data
RETURN: ax - 16-bit hash value
bx - entry # of chain
DESTROYED: cx, dx
SIDE EFFECTS:
PSEUDO CODE/STRATEGY:
NOTE: assumes hash function doesn't shuffle chunks.
For now, assumes that it is C function's responsibility to
load dgroup
REVISION HISTORY:
Name Date Description
---- ---- -----------
dubois 11/14/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
HT_HashData proc near
test ds:[di].HTH_flags, mask HTF_C_API_CALLBACKS
jnz pascalCall
movdw bxax, ds:[di].HTH_hashFunction
call ProcCallFixedOrMovable ;ax <- hash (destroy bxcxdx)
afterCall:
Destroy cx, dx
push ax ; save hash value
clr dx
mov bx, ds:[di].HTH_tableSize
EC < tst bx >
EC < ERROR_Z -1 >
div bx ; dx <- remainder
mov bx, dx ; bx <- remainder
pop ax ; restore hash value
ret
pascalCall:
push ds
; arg 1: elementData
pushdw cxdx
; arg 2: void *header
pushdw dsdi
; arg n: routine to call
pushdw ds:[di].HTH_hashFunction
call PROCCALLFIXEDORMOVABLE_PASCAL
pop ds
jmp afterCall
HT_HashData endp
MainCode ends
|
libsrc/_DEVELOPMENT/arch/zx/display/z80/asm_zx_saddr2aaddr.asm | teknoplop/z88dk | 8 | 9125 |
; ===============================================================
; Jun 2007
; ===============================================================
;
; void *zx_saddr2aaddr(void *saddr)
;
; Attribute address corresponding to screen address.
;
; ===============================================================
SECTION code_clib
SECTION code_arch
PUBLIC asm_zx_saddr2aaddr
asm_zx_saddr2aaddr:
ld a,h
rra
rra
rra
and $03
or $58
ld h,a
ret
|
programs/oeis/026/A026065.asm | neoneye/loda | 22 | 80365 | <reponame>neoneye/loda
; A026065: a(n) = (d(n)-r(n))/5, where d = A026063 and r is the periodic sequence with fundamental period (1,4,0,0,0).
; 14,23,36,51,69,90,114,143,175,211,251,295,345,399,458,522,591,667,748,835,928,1027,1134,1247,1367,1494,1628,1771,1921,2079,2245,2419,2603,2795,2996,3206,3425,3655,3894,4143,4402,4671,4952,5243,5545,5858,6182,6519,6867,7227,7599,7983,8381
seq $0,26063 ; dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).
div $0,5
|
experiments/test-suite/mutation-based/10/1/arr.als | kaiyuanw/AlloyFLCore | 1 | 1286 | <filename>experiments/test-suite/mutation-based/10/1/arr.als
pred test23 {
some disj Element0: Element {some disj Array0: Array {
Element = Element0
Array = Array0
i2e = Array0->0->Element0 + Array0->1->Element0 + Array0->2->Element0 + Array0->3->Element0
length = Array0->3
}}
}
run test23 for 3 expect 0
pred test11 {
some disj Element0: Element {some disj Array0: Array {
Element = Element0
Array = Array0
i2e = Array0->1->Element0
length = Array0->5
NoConflict[]
}}
}
run test11 for 3 expect 1
pred test15 {
some disj Element0: Element {some disj Array0: Array {
Element = Element0
Array = Array0
i2e = Array0->-8->Element0 + Array0->-7->Element0 + Array0->-6->Element0 + Array0->-5->Element0 + Array0->-4->Element0 + Array0->-3->Element0 + Array0->-2->Element0 + Array0->-1->Element0 + Array0->0->Element0 + Array0->1->Element0 + Array0->2->Element0 + Array0->3->Element0 + Array0->4->Element0 + Array0->5->Element0 + Array0->6->Element0 + Array0->7->Element0
length = Array0->-8
}}
}
run test15 for 3 expect 0
|
3-mid/impact/source/3d/collision/shapes/impact-d3-shape-concave-static_plane.ads | charlie5/lace | 20 | 17324 | with impact.d3.Shape.concave,
impact.d3.triangle_Callback;
package impact.d3.Shape.concave.static_plane
--
-- Simulates an infinite non-moving (static) collision plane.
--
is
type Item is new impact.d3.Shape.concave.Item with private;
--- Forge
--
function to_static_plane_Shape (planeNormal : in math.Vector_3;
planeConstant : in math.Real ) return Item;
overriding procedure destruct (Self : in out Item);
--- Attributes
--
-- function localGetSupportingVertex (Self : in Item; vec : in Vector_3) return Vector_3;
-- function localGetSupportingVertexWithoutMargin (Self : in Item; vec : in Vector_3) return Vector_3;
-- procedure batchedUnitVectorGetSupportingVertexWithoutMargin (Self : in Item; vectors : in Vector_3_array;
-- supportVerticesOut : out Vector_3_array;
-- numVectors : in Integer );
overriding procedure getAabb (Self : in Item; t : in Transform_3d;
aabbMin, aabbMax : out Vector_3) ;
--
-- 'getAabb's default implementation is brute force, expected derived classes to implement a fast dedicated version
-- procedure setMargin (Self : in out Item; margin : in Scalar) ;
-- function getMargin (Self : in Item) return Scalar ;
overriding procedure calculateLocalInertia (Self : in Item; mass : in math.Real;
inertia : out math.Vector_3);
overriding function getName (Self : in Item) return String ;
-- function getRadius (Self : in Item) return math.Real;
overriding procedure setLocalScaling (Self : in out Item; scaling : in math.Vector_3);
overriding function getLocalScaling (Self : in Item) return math.Vector_3;
function getPlaneNormal (Self : in Item) return math.Vector_3;
function getPlaneConstant (Self : in Item) return math.Real;
overriding procedure processAllTriangles (Self : in Item; callback : access impact.d3.triangle_Callback.Item'Class;
aabbMin, aabbMax : in math.Vector_3);
private
type Item is new impact.d3.Shape.concave.Item with
record
m_localAabbMin,
m_localAabbMax : math.Vector_3;
m_planeNormal : math.Vector_3;
m_planeConstant : math.Real;
m_localScaling : math.Vector_3;
end record;
end impact.d3.Shape.concave.static_plane;
-- ATTRIBUTE_ALIGNED16(class) impact.d3.Shape.concave.static_plane : public impact.d3.Shape.concave
-- {
-- public:
--
--
-- const impact.d3.Vector& getPlaneNormal() const
-- {
-- return m_planeNormal;
-- }
--
-- const impact.d3.Scalar& getPlaneConstant() const
-- {
-- return m_planeConstant;
-- }
--
-- //debugging
-- virtual const char* getName()const {return "STATICPLANE";}
--
-- };
|
src/JVM/Syntax/Values.agda | ajrouvoet/jvm.agda | 6 | 638 | <gh_stars>1-10
{-# OPTIONS --safe #-}
module JVM.Syntax.Values where
open import Data.Bool
open import Data.Integer.Base
open import Relation.Unary
open import Relation.Ternary.Core
open import Relation.Ternary.Structures
open import Relation.Ternary.Structures.Syntax
open import JVM.Types
data Const : Ty → Set where
null : ∀ {c} → Const (ref c)
num : ℤ → Const int
bool : Bool → Const boolean
|
Transynther/x86/_processed/NONE/_xt_/i7-7700_9_0xca_notsx.log_21829_633.asm | ljhsiun2/medusa | 9 | 10838 | <reponame>ljhsiun2/medusa
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r13
push %r14
push %r15
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0xbeeb, %rdi
nop
nop
sub %r15, %r15
mov $0x6162636465666768, %r13
movq %r13, %xmm6
vmovups %ymm6, (%rdi)
nop
nop
nop
nop
inc %rcx
lea addresses_UC_ht+0xe46b, %r15
nop
nop
nop
nop
nop
and %rcx, %rcx
vmovups (%r15), %ymm2
vextracti128 $0, %ymm2, %xmm2
vpextrq $0, %xmm2, %r12
nop
inc %r12
lea addresses_UC_ht+0x41db, %r11
nop
nop
nop
and %r14, %r14
movl $0x61626364, (%r11)
nop
and $46372, %r15
lea addresses_WC_ht+0x158eb, %rsi
lea addresses_normal_ht+0xaeb, %rdi
and $63129, %r15
mov $74, %rcx
rep movsb
nop
nop
nop
cmp %r15, %r15
lea addresses_D_ht+0x32eb, %rcx
nop
nop
nop
sub $20921, %rsi
mov (%rcx), %di
nop
nop
nop
dec %rcx
lea addresses_WT_ht+0x120eb, %r14
nop
nop
nop
nop
and %rsi, %rsi
mov $0x6162636465666768, %r13
movq %r13, %xmm1
movups %xmm1, (%r14)
nop
nop
nop
nop
nop
sub %rcx, %rcx
pop %rsi
pop %rdi
pop %rcx
pop %r15
pop %r14
pop %r13
pop %r12
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r12
push %r14
push %r9
push %rbp
push %rcx
push %rdi
push %rsi
// Load
lea addresses_WC+0x150eb, %rcx
nop
nop
nop
dec %r14
movb (%rcx), %r9b
nop
nop
nop
nop
nop
and %r10, %r10
// Store
lea addresses_UC+0x56ab, %r9
nop
nop
nop
nop
add %r10, %r10
mov $0x5152535455565758, %rbp
movq %rbp, %xmm1
movups %xmm1, (%r9)
nop
nop
nop
cmp $22532, %r14
// REPMOV
lea addresses_D+0xd3cb, %rsi
lea addresses_normal+0x107eb, %rdi
nop
xor %r10, %r10
mov $108, %rcx
rep movsw
nop
nop
nop
nop
and $37062, %r10
// Load
mov $0xf3b, %r14
and %rbp, %rbp
mov (%r14), %si
nop
nop
nop
nop
nop
and $60982, %r10
// Load
lea addresses_RW+0x4fb, %rdi
nop
nop
add %r14, %r14
mov (%rdi), %rbp
nop
nop
nop
nop
nop
xor $30916, %rbp
// Store
lea addresses_D+0x1c2a3, %rdi
nop
nop
nop
inc %rcx
movl $0x51525354, (%rdi)
nop
nop
xor $3021, %rcx
// Store
mov $0x5a059000000004eb, %rbp
nop
nop
nop
and %r9, %r9
mov $0x5152535455565758, %r14
movq %r14, %xmm3
movaps %xmm3, (%rbp)
nop
nop
nop
nop
nop
cmp %r12, %r12
// Faulty Load
lea addresses_normal+0x150eb, %rdi
nop
nop
cmp %rcx, %rcx
movups (%rdi), %xmm3
vpextrq $0, %xmm3, %rbp
lea oracles, %rdi
and $0xff, %rbp
shlq $12, %rbp
mov (%rdi,%rbp,1), %rbp
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %r9
pop %r14
pop %r12
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': True, 'AVXalign': False, 'size': 8, 'congruent': 0, 'same': False, 'type': 'addresses_normal'}, 'OP': 'LOAD'}
{'src': {'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 11, 'same': False, 'type': 'addresses_WC'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 5, 'same': False, 'type': 'addresses_UC'}, 'OP': 'STOR'}
{'src': {'congruent': 5, 'same': False, 'type': 'addresses_D'}, 'dst': {'congruent': 7, 'same': False, 'type': 'addresses_normal'}, 'OP': 'REPM'}
{'src': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 3, 'same': False, 'type': 'addresses_P'}, 'OP': 'LOAD'}
{'src': {'NT': True, 'AVXalign': False, 'size': 8, 'congruent': 2, 'same': False, 'type': 'addresses_RW'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 1, 'same': False, 'type': 'addresses_D'}, 'OP': 'STOR'}
{'dst': {'NT': False, 'AVXalign': True, 'size': 16, 'congruent': 6, 'same': False, 'type': 'addresses_NC'}, 'OP': 'STOR'}
[Faulty Load]
{'src': {'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 0, 'same': True, 'type': 'addresses_normal'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'dst': {'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 9, 'same': False, 'type': 'addresses_WC_ht'}, 'OP': 'STOR'}
{'src': {'NT': False, 'AVXalign': False, 'size': 32, 'congruent': 6, 'same': False, 'type': 'addresses_UC_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 2, 'same': True, 'type': 'addresses_UC_ht'}, 'OP': 'STOR'}
{'src': {'congruent': 11, 'same': False, 'type': 'addresses_WC_ht'}, 'dst': {'congruent': 8, 'same': False, 'type': 'addresses_normal_ht'}, 'OP': 'REPM'}
{'src': {'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 8, 'same': False, 'type': 'addresses_D_ht'}, 'OP': 'LOAD'}
{'dst': {'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 9, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'STOR'}
{'34': 21829}
34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34 34
*/
|
oeis/164/A164466.asm | neoneye/loda-programs | 11 | 103170 | <filename>oeis/164/A164466.asm
; A164466: Number of binary strings of length n with no substrings equal to 0001, 0100, or 1011.
; Submitted by <NAME>
; 1,2,4,8,13,20,30,44,63,89,125,175,244,339,470,651,901,1246,1722,2379,3286,4538,6266,8651,11943,16487,22759,31416,43365,59858,82623,114045,157416,217280,299909,413960,571382,788668,1088583,1502549,2073937,2862611,3951200,5453755,7527698,10390315,14341521,19795282,27322986,37713307,52054834,71850122,99173114,136886427,188941267,260791395,359964515,496850948,685792221,946583622,1306548143,1803399097,2489191324,3435774952,4742323101,6545722204,9034913534,12470688492,17213011599,23758733809
add $$0,$0
max $0,1
add $1,$0
seq $0,145131 ; Expansion of x/((1 - x - x^4)*(1 - x)^2).
add $0,62697602
add $0,$1
sub $0,62697603
|
programs/oeis/051/A051878.asm | neoneye/loda | 22 | 5644 | ; A051878: Partial sums of A051797.
; 1,13,63,203,518,1134,2226,4026,6831,11011,17017,25389,36764,51884,71604,96900,128877,168777,217987,278047,350658,437690,541190,663390,806715,973791,1167453,1390753,1646968,1939608,2272424,2649416,3074841,3553221,4089351,4688307,5355454,6096454
mov $1,1
lpb $0
mov $2,$0
sub $0,1
seq $2,51797 ; Partial sums of A007585.
add $1,$2
lpe
mov $0,$1
|
src/Categories/Category/Cocartesian/Bundle.agda | Trebor-Huang/agda-categories | 279 | 4279 | <reponame>Trebor-Huang/agda-categories
{-# OPTIONS --without-K --safe #-}
-- Bundled version of a Cocartesian Category
module Categories.Category.Cocartesian.Bundle where
open import Level
open import Categories.Category.Core using (Category)
open import Categories.Category.Cocartesian using (Cocartesian)
record CocartesianCategory o ℓ e : Set (suc (o ⊔ ℓ ⊔ e)) where
field
U : Category o ℓ e -- U for underlying
cocartesian : Cocartesian U
open Category U public
open Cocartesian cocartesian public
|
agda/Cardinality/Finite/SplitEnumerable/Isomorphism.agda | oisdk/combinatorics-paper | 4 | 11790 | {-# OPTIONS --cubical --safe #-}
module Cardinality.Finite.SplitEnumerable.Isomorphism where
open import Prelude
open import Container
open import Container.List
open import Data.Fin
open import Container.Membership (ℕ , Fin)
open import Path.Reasoning
open import Data.Sigma.Properties
open import Function.Surjective.Properties
open import Data.Fin.Properties
import Data.List.Membership as 𝕃
open import Container.List.Isomorphism
open import Data.Nat.Properties
open import Data.List using (_∷_; []; List)
import Cardinality.Finite.SplitEnumerable.Container as ℒ
import Cardinality.Finite.SplitEnumerable.Inductive as 𝕃
∈ℒ⇒∈𝕃 : ∀ (x : A) (xs : ⟦ ℕ , Fin ⟧ A) → x ∈ xs → x 𝕃.∈ ℒ→𝕃 xs
∈ℒ⇒∈𝕃 x (suc l , xs) (f0 , p) = f0 , p
∈ℒ⇒∈𝕃 x (suc l , xs) (fs n , p) = 𝕃.push (∈ℒ⇒∈𝕃 x (l , xs ∘ fs) (n , p))
𝕃⇔ℒ⟨ℰ!⟩ : 𝕃.ℰ! A ⇔ ℒ.ℰ! A
𝕃⇔ℒ⟨ℰ!⟩ .fun (sup , cov) = 𝕃→ℒ sup , cov
𝕃⇔ℒ⟨ℰ!⟩ .inv (sup , cov) = ℒ→𝕃 sup , λ x → ∈ℒ⇒∈𝕃 x sup (cov x)
𝕃⇔ℒ⟨ℰ!⟩ .rightInv (sup , cov) i .fst = 𝕃⇔ℒ .rightInv sup i
𝕃⇔ℒ⟨ℰ!⟩ .rightInv (sup , cov) i .snd x = ∈ℒ⇒∈𝕃-rightInv sup (cov x) i
where
∈ℒ⇒∈𝕃-rightInv : ∀ xs x∈xs →
PathP (λ i → x ∈ 𝕃⇔ℒ .rightInv xs i)
(∈ℒ⇒∈𝕃 x xs x∈xs) x∈xs
∈ℒ⇒∈𝕃-rightInv (suc l , xs) (f0 , x∈xs) i = f0 , x∈xs
∈ℒ⇒∈𝕃-rightInv (suc l , xs) (fs n , x∈xs) i =
let m , q = ∈ℒ⇒∈𝕃-rightInv (l , xs ∘ fs) (n , x∈xs) i
in fs m , q
𝕃⇔ℒ⟨ℰ!⟩ .leftInv (sup , cov) i .fst = 𝕃⇔ℒ .leftInv sup i
𝕃⇔ℒ⟨ℰ!⟩ .leftInv (sup , cov) i .snd x = ∈ℒ⇒∈𝕃-leftInv sup (cov x) i
where
∈ℒ⇒∈𝕃-leftInv : ∀ xs x∈xs →
PathP (λ i → x 𝕃.∈ 𝕃→ℒ→𝕃 xs i)
(∈ℒ⇒∈𝕃 x (𝕃→ℒ xs) x∈xs) x∈xs
∈ℒ⇒∈𝕃-leftInv (_ ∷ xs) (f0 , x∈xs) i = f0 , x∈xs
∈ℒ⇒∈𝕃-leftInv (_ ∷ xs) (fs n , x∈xs) i =
let m , p = ∈ℒ⇒∈𝕃-leftInv xs (n , x∈xs) i
in fs m , p
|
oeis/237/A237353.asm | neoneye/loda-programs | 11 | 243720 | ; A237353: For n=g+h, a(n) is the minimum value of omega(g)+omega(h).
; Submitted by <NAME>
; 0,1,1,1,1,2,1,1,1,2,1,2,1,2,2,1,1,2,1,2,2,2,1,2,1,2,1,2,1,2,1,1,2,2,2,2,1,2,2,2,1,2,1,2,2,2,1,2,1,2,2,2,1,2,2,2,2,2,1,2,1,2,2,1,2,2,1,2,2,2,1,2,1,2,2,2,2,2,1,2,1,2,1,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2
lpb $0
mov $2,$0
mov $0,0
mov $3,$2
cmp $3,0
add $2,$3
seq $2,230799 ; The number of distinct nonzero coefficients in the n-th cyclotomic polynomial.
lpe
mov $0,$2
|
programs/oeis/022/A022371.asm | karttu/loda | 0 | 480 | ; A022371: Fibonacci sequence beginning 2, 18.
; 2,18,20,38,58,96,154,250,404,654,1058,1712,2770,4482,7252,11734,18986,30720,49706,80426,130132,210558,340690,551248,891938,1443186,2335124,3778310,6113434,9891744,16005178,25896922,41902100,67799022,109701122,177500144,287201266,464701410,751902676,1216604086,1968506762,3185110848,5153617610,8338728458,13492346068,21831074526,35323420594,57154495120,92477915714,149632410834,242110326548,391742737382,633853063930,1025595801312,1659448865242,2685044666554,4344493531796,7029538198350,11374031730146,18403569928496,29777601658642,48181171587138,77958773245780,126139944832918,204098718078698,330238662911616,534337380990314,864576043901930,1398913424892244,2263489468794174,3662402893686418,5925892362480592
mov $1,4
mov $3,36
lpb $0,1
sub $0,1
mov $2,$1
mov $1,$3
add $3,$2
lpe
div $1,2
|
test/succeed/Issue209.agda | asr/agda-kanso | 1 | 7571 | <reponame>asr/agda-kanso
{-# OPTIONS --universe-polymorphism --allow-unsolved-metas #-}
module Issue209 where
postulate
Level : Set
zero : Level
suc : Level → Level
_⊔_ : Level -> Level -> Level
{-# BUILTIN LEVEL Level #-}
{-# BUILTIN LEVELZERO zero #-}
{-# BUILTIN LEVELSUC suc #-}
{-# BUILTIN LEVELMAX _⊔_ #-}
data _≡_ {a} {A : Set a} (x : A) : A → Set where
refl : x ≡ x
data _≅_ {a} {A : Set a} (x : A) : ∀ {b} {B : Set b} → B → Set where
refl : x ≅ x
subst : ∀ {a p} {A : Set a} (P : A → Set p) {x y} → x ≡ y → P x → P y
subst P refl p = p
lemma : ∀ {A} (P : A → Set) {x y} (eq : x ≡ y) z →
subst P eq z ≅ z
lemma P refl z = refl
-- An internal error has occurred. Please report this as a bug.
-- Location of the error: src/full/Agda/TypeChecking/Telescope.hs:51
-- The problematic call to reorderTel is
-- reorderTel tel3
-- in Agda.TypeChecking.Rules.LHS.Instantiate. |
programs/oeis/109/A109534.asm | neoneye/loda | 22 | 97468 | ; A109534: a(0)=1, a(n)=n+a(n-1) if n mod 2=0, a(n)=3n-a(n-1) if n mod 2 = 1.
; 1,2,4,5,9,6,12,9,17,10,20,13,25,14,28,17,33,18,36,21,41,22,44,25,49,26,52,29,57,30,60,33,65,34,68,37,73,38,76,41,81,42,84,45,89,46,92,49,97,50,100,53,105,54,108,57,113,58,116,61,121,62,124,65,129,66,132,69,137
mov $1,$0
sub $1,1
mov $2,$1
mod $1,2
mov $3,$0
mul $0,$1
trn $0,1
add $0,2
add $2,3
sub $2,$1
div $2,2
gcd $2,2
add $0,$2
sub $0,2
add $0,$3
|
programs/oeis/081/A081076.asm | karttu/loda | 0 | 15541 | <filename>programs/oeis/081/A081076.asm
; A081076: a(n) = Lucas(4n) + 3, or 5*Fibonacci(2n-1)*Fibonacci(2n+1).
; 5,10,50,325,2210,15130,103685,710650,4870850,33385285,228826130,1568397610,10749957125,73681302250,505019158610,3461452808005,23725150497410,162614600673850,1114577054219525,7639424778862810
mul $0,2
mov $2,1
mov $3,2
lpb $0,1
sub $0,1
add $3,$2
add $2,$3
lpe
add $3,3
add $1,$3
|
alloy4fun_models/trashltl/models/10/kqcBYFQDTT32oAMbK.als | Kaixi26/org.alloytools.alloy | 0 | 2251 | <reponame>Kaixi26/org.alloytools.alloy
open main
pred idkqcBYFQDTT32oAMbK_prop11 {
always after ((File - Protected) in Protected)
}
pred __repair { idkqcBYFQDTT32oAMbK_prop11 }
check __repair { idkqcBYFQDTT32oAMbK_prop11 <=> prop11o } |
data/sprites/sprite_mons.asm | Dev727/ancientplatinum | 6 | 172313 | <gh_stars>1-10
SpriteMons:
; entries correspond to SPRITE_* constants past SPRITE_POKEMON
dw UNOWN
dw GEODUDE
dw GROWLITHE
dw WEEDLE
dw SHELLDER
dw ODDISH
dw GENGAR
dw ZUBAT
dw MAGIKARP
dw SQUIRTLE
dw TOGEPI
dw BUTTERFREE
dw DIGLETT
dw POLIWAG
dw PIKACHU
dw CLEFAIRY
dw CHARMANDER
dw JYNX
dw STARMIE
dw BULBASAUR
dw JIGGLYPUFF
dw GRIMER
dw EKANS
dw PARAS
dw TENTACOOL
dw TAUROS
dw MACHOP
dw VOLTORB
dw LAPRAS
dw RHYDON
dw MOLTRES
dw SNORLAX
dw GYARADOS
dw LUGIA
dw HO_OH
|
oeis/022/A022389.asm | neoneye/loda-programs | 11 | 82282 | ; A022389: Fibonacci sequence beginning 7, 15.
; 7,15,22,37,59,96,155,251,406,657,1063,1720,2783,4503,7286,11789,19075,30864,49939,80803,130742,211545,342287,553832,896119,1449951,2346070,3796021,6142091,9938112,16080203,26018315,42098518,68116833,110215351,178332184,288547535,466879719,755427254,1222306973,1977734227,3200041200,5177775427,8377816627,13555592054,21933408681,35489000735,57422409416,92911410151,150333819567,243245229718,393579049285,636824279003,1030403328288,1667227607291,2697630935579,4364858542870,7062489478449
mov $1,8
mov $2,7
lpb $0
sub $0,2
add $1,$2
add $2,$1
lpe
lpb $0
sub $0,1
add $2,$1
lpe
mov $0,$2
|
libsrc/fcntl/spectrum/plus3/fdtell.asm | andydansby/z88dk-mk2 | 1 | 84399 | <reponame>andydansby/z88dk-mk2<gh_stars>1-10
;
; long fdtell(int fd)
;
; Return position in file
;
; Not written as yet!
;
; $Id: fdtell.asm,v 1.4 2009/06/22 21:44:16 dom Exp $
XLIB fdtell
INCLUDE "p3dos.def"
XREF dodos
.fdtell
pop hl ;ret address
pop bc ;lower 8 is file handle
push bc
push hl
ld b,c
ld iy,DOS_GET_POSITION
call dodos
ld d,0
ret c
ld hl,-1
ld d,h
ld e,l
ret
|
oeis/144/A144085.asm | neoneye/loda-programs | 11 | 95227 | <reponame>neoneye/loda-programs
; A144085: a(n) is the number of partial bijections (or subpermutations) of an n-element set without fixed points (also called partial derangements).
; Submitted by Christian Krause
; 1,1,4,18,108,780,6600,63840,693840,8361360,110557440,1590351840,24713156160,412393101120,7352537512320,139443752448000,2802408959750400,59479486120454400,1329239028813696000,31194214921732262400,766888191387539020800,19707387644116280908800,528327710066244459571200,14749194045148794053222400,428057898012074408388710400,12895625650796515809262080000,402694100406590245016924160000,13017679281744408755464780800000,435101113514634912066037155840000,15019456213316878188552962795520000
mov $3,1
lpb $0
sub $0,1
add $1,1
mov $2,$0
bin $2,$1
mul $3,$1
add $3,$2
lpe
mov $0,$3
|
benchmark/cwf/Setoid.agda | larrytheliquid/agda | 0 | 14485 | <gh_stars>0
{-# OPTIONS --no-positivity-check
--no-termination-check
#-}
-- A universe setoids
module Setoid where
import Chain
record True : Set where
data False : Set where
Rel : Set -> Set1
Rel A = A -> A -> Set
Pred : Set -> Set1
Pred A = A -> Set
Resp : {A : Set} -> Rel A -> {B : Set} -> Rel B -> Pred (A -> B)
Resp _R_ _S_ f = forall x y -> x R y -> f x S f y
mutual
infix 40 _=El=_ _=S=_ _=Fam=_
infix 60 _!_
data Setoid : Set where
nat : Setoid
Π : (A : Setoid)(F : Fam A) -> Setoid
Σ : (A : Setoid)(F : Fam A) -> Setoid
data Fam (A : Setoid) : Set where
fam : (F : El A -> Setoid) ->
Resp _=El=_ _=S=_ F -> Fam A
data El : Setoid -> Set where
zero : El nat
suc : El nat -> El nat
ƛ : {A : Setoid}{F : Fam A}
(f : (x : El A) -> El (F ! x)) ->
((x y : El A) -> x =El= y -> f x =El= f y) -> El (Π A F)
_,_ : {A : Setoid}{F : Fam A}(x : El A) -> El (F ! x) -> El (Σ A F)
data _=S=_ : (A B : Setoid) -> Set where
eqNat : nat =S= nat
eqΠ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂} ->
A₂ =S= A₁ -> F₁ =Fam= F₂ -> Π A₁ F₁ =S= Π A₂ F₂
eqΣ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂} ->
A₁ =S= A₂ -> F₁ =Fam= F₂ -> Σ A₁ F₁ =S= Σ A₂ F₂
data _=El=_ : {A B : Setoid} -> El A -> El B -> Set where
eqInNat : {n : El nat} -> n =El= n
eqInΠ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂}
{f₁ : (x : El A₁) -> El (F₁ ! x)}
{pf₁ : (x y : El A₁) -> x =El= y -> f₁ x =El= f₁ y}
{f₂ : (x : El A₂) -> El (F₂ ! x)} ->
{pf₂ : (x y : El A₂) -> x =El= y -> f₂ x =El= f₂ y} ->
A₂ =S= A₁ ->
((x : El A₁)(y : El A₂) -> x =El= y -> f₁ x =El= f₂ y) ->
ƛ f₁ pf₁ =El= ƛ f₂ pf₂
eqInΣ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂}
{x₁ : El A₁}{y₁ : El (F₁ ! x₁)}
{x₂ : El A₂}{y₂ : El (F₂ ! x₂)} ->
F₁ =Fam= F₂ -> x₁ =El= x₂ -> y₁ =El= y₂ -> (x₁ , y₁) =El= (x₂ , y₂)
data _=Fam=_ {A B : Setoid}(F : Fam A)(G : Fam B) : Set where
eqFam : B =S= A -> (forall x y -> x =El= y -> F ! x =S= G ! y) -> F =Fam= G
_!_ : {A : Setoid} -> Fam A -> El A -> Setoid
fam F _ ! x = F x
-- Inversions
famEqDom : {A B : Setoid}{F : Fam A}{G : Fam B} -> F =Fam= G -> B =S= A
famEqDom (eqFam p _) = p
famEqCodom : {A B : Setoid}{F : Fam A}{G : Fam B} -> F =Fam= G ->
(x : El A)(y : El B) -> x =El= y -> F ! x =S= G ! y
famEqCodom (eqFam _ p) = p
eqΠ-inv₁ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂} ->
Π A₁ F₁ =S= Π A₂ F₂ -> A₂ =S= A₁
eqΠ-inv₁ (eqΠ p _) = p
eqΠ-inv₂ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂} ->
Π A₁ F₁ =S= Π A₂ F₂ -> F₁ =Fam= F₂
eqΠ-inv₂ (eqΠ _ p) = p
eqΣ-inv₁ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂} ->
Σ A₁ F₁ =S= Σ A₂ F₂ -> A₁ =S= A₂
eqΣ-inv₁ (eqΣ p _) = p
eqΣ-inv₂ : {A₁ A₂ : Setoid}{F₁ : Fam A₁}{F₂ : Fam A₂} ->
Σ A₁ F₁ =S= Σ A₂ F₂ -> F₁ =Fam= F₂
eqΣ-inv₂ (eqΣ _ p) = p
-- Equivalence proofs and casts
mutual
-- _=Fam=_ is an equivalence
=Fam=-refl : {A : Setoid}{F : Fam A} -> F =Fam= F
=Fam=-refl {F = fam _ p} = eqFam =S=-refl p
=Fam=-sym : {A B : Setoid}{F : Fam A}{G : Fam B} -> F =Fam= G -> G =Fam= F
=Fam=-sym (eqFam B=A F=G) = eqFam (=S=-sym B=A) \x y x=y -> =S=-sym (F=G _ _ (=El=-sym x=y))
=Fam=-trans : {A B C : Setoid}{F : Fam A}{G : Fam B}{H : Fam C} ->
F =Fam= G -> G =Fam= H -> F =Fam= H
=Fam=-trans (eqFam B=A F=G) (eqFam C=B G=H) =
eqFam (=S=-trans C=B B=A) \x y x=y ->
=S=-trans (F=G x (B=A << x) (cast-id _))
(G=H _ y (=El=-trans (=El=-sym (cast-id _)) x=y))
-- _=S=_ is an equivalence
=S=-refl : {A : Setoid} -> A =S= A
=S=-refl {nat} = eqNat
=S=-refl {Π A F} = eqΠ =S=-refl =Fam=-refl
=S=-refl {Σ A F} = eqΣ =S=-refl =Fam=-refl
=S=-sym : {A B : Setoid} -> A =S= B -> B =S= A
=S=-sym eqNat = eqNat
=S=-sym (eqΠ pA pF) = eqΠ (=S=-sym pA) (=Fam=-sym pF)
=S=-sym (eqΣ pA pF) = eqΣ (=S=-sym pA) (=Fam=-sym pF)
=S=-trans : {A B C : Setoid} -> A =S= B -> B =S= C -> A =S= C
=S=-trans eqNat eqNat = eqNat
=S=-trans (eqΠ B=A F=G) (eqΠ C=B G=H) = eqΠ (=S=-trans C=B B=A) (=Fam=-trans F=G G=H)
=S=-trans (eqΣ A=B F=G) (eqΣ B=C G=H) = eqΣ (=S=-trans A=B B=C) (=Fam=-trans F=G G=H)
-- _=El=_ is an equivalence
=El=-refl : {A : Setoid}{x : El A} -> x =El= x
=El=-refl {nat} = eqInNat
=El=-refl {Π A F}{ƛ f pf} = eqInΠ =S=-refl pf
=El=-refl {Σ A F}{x , y} = eqInΣ =Fam=-refl =El=-refl =El=-refl
=El=-sym : {A B : Setoid}{x : El A}{y : El B} -> x =El= y -> y =El= x
=El=-sym eqInNat = eqInNat
=El=-sym (eqInΠ B=A p) = eqInΠ (=S=-sym B=A) \x y x=y -> =El=-sym (p y x (=El=-sym x=y))
=El=-sym (eqInΣ pF px py) = eqInΣ (=Fam=-sym pF) (=El=-sym px) (=El=-sym py)
=El=-trans : {A B C : Setoid}{x : El A}{y : El B}{z : El C} ->
x =El= y -> y =El= z -> x =El= z
=El=-trans eqInNat eqInNat = eqInNat
=El=-trans (eqInΠ B=A f=g) (eqInΠ C=B g=h) =
eqInΠ (=S=-trans C=B B=A) \x y x=y ->
=El=-trans (f=g x (B=A << x) (cast-id _))
(g=h _ y (=El=-trans (=El=-sym (cast-id _)) x=y))
=El=-trans (eqInΣ F₁=F₂ x₁=x₂ y₁=y₂) (eqInΣ F₂=F₃ x₂=x₃ y₂=y₃) =
eqInΣ (=Fam=-trans F₁=F₂ F₂=F₃) (=El=-trans x₁=x₂ x₂=x₃) (=El=-trans y₁=y₂ y₂=y₃)
-- Casting. Important: don't look at the proof!
infix 50 _<<_ _>>_
_<<_ : {A B : Setoid} -> A =S= B -> El B -> El A
_<<_ {nat}{Π _ _} () _
_<<_ {nat}{Σ _ _} () _
_<<_ {Π _ _}{nat} () _
_<<_ {Π _ _}{Σ _ _} () _
_<<_ {Σ _ _}{nat} () _
_<<_ {Σ _ _}{Π _ _} () _
_<<_ {nat}{nat} p x = x
_<<_ {Π A₁ F₁}{Π A₂ F₂} p (ƛ f pf) = ƛ g pg
where
g : (x : El A₁) -> El (F₁ ! x)
g x = let A₂=A₁ = eqΠ-inv₁ p
F₁=F₂ = famEqCodom (eqΠ-inv₂ p) x _ (cast-id _)
in F₁=F₂ << f (A₂=A₁ << x)
pg : (x y : El A₁) -> x =El= y -> g x =El= g y
pg x y x=y = cast-irr _ _ (pf _ _ (cast-irr _ _ x=y))
_<<_ {Σ A₁ F₁}{Σ A₂ F₂} p (x , y) = eqΣ-inv₁ p << x , F₁=F₂ << y
where
F₁=F₂ : F₁ ! (eqΣ-inv₁ p << x) =S= F₂ ! x
F₁=F₂ = famEqCodom (eqΣ-inv₂ p) _ _ (=El=-sym (cast-id _))
_>>_ : {A B : Setoid} -> Fam A -> A =S= B -> Fam B
fam F pF >> A=B = fam G pG
where
G : El _ -> Setoid
G y = F (A=B << y)
pG : forall x y -> x =El= y -> G x =S= G y
pG x y x=y = pF _ _ (cast-irr _ _ x=y)
cast-id : {A B : Setoid}{x : El A}(p : B =S= A) -> x =El= p << x
cast-id eqNat = eqInNat
cast-id {x = x , y } (eqΣ A=B F=G) = eqInΣ (=Fam=-sym F=G) (cast-id _) (cast-id _)
cast-id {x = ƛ f pf} (eqΠ B=A F=G) =
eqInΠ (=S=-sym B=A) \x y x=y ->
proof f x
≡ f (_ << y) by pf _ _ (=El=-trans x=y (cast-id _))
≡ _ << f (_ << y) by cast-id _
qed
where
open Chain El _=El=_ (\x -> =El=-refl) (\x y z -> =El=-trans)
cast-irr : {A₁ A₂ B₁ B₂ : Setoid}{x : El A₁}{y : El A₂}
(p₁ : B₁ =S= A₁)(p₂ : B₂ =S= A₂) -> x =El= y -> p₁ << x =El= p₂ << y
cast-irr {x = x}{y = y} p q x=y =
proof p << x
≡ x by =El=-sym (cast-id _)
≡ y by x=y
≡ q << y by cast-id _
qed
where
open Chain El _=El=_ (\x -> =El=-refl) (\x y z -> =El=-trans)
-- Let's do some overloading
data EqFam : Set -> Set where
el : EqFam Setoid
setoid : EqFam True
fam : EqFam Setoid
[_] : {I : Set} -> EqFam I -> I -> Set
[ el ] A = El A
[ setoid ] _ = Setoid
[ fam ] A = Fam A
_==_ : {I : Set}{eqf : EqFam I}{i j : I} -> [ eqf ] i -> [ eqf ] j -> Set
_==_ {eqf = el } x y = x =El= y
_==_ {eqf = setoid} A B = A =S= B
_==_ {eqf = fam } F G = F =Fam= G
refl : {I : Set}{eqf : EqFam I}{i : I}{x : [ eqf ] i} -> x == x
refl {eqf = el} = =El=-refl
refl {eqf = setoid} = =S=-refl
refl {eqf = fam} = =Fam=-refl
sym : {I : Set}{eqf : EqFam I}{i j : I}{x : [ eqf ] i}{y : [ eqf ] j} -> x == y -> y == x
sym {eqf = el} = =El=-sym
sym {eqf = setoid} = =S=-sym
sym {eqf = fam} = =Fam=-sym
trans : {I : Set}{eqf : EqFam I}{i j k : I}{x : [ eqf ] i}{y : [ eqf ] j}{z : [ eqf ] k} ->
x == y -> y == z -> x == z
trans {eqf = el} = =El=-trans
trans {eqf = setoid} = =S=-trans
trans {eqf = fam} = =Fam=-trans
open module EqChain {I : Set}{eqf : EqFam I} =
Chain ([ eqf ]) _==_ (\x -> refl) (\x y z -> trans)
homo : {A B : Setoid}{x : El A}{y : El B} -> x == y -> A == B
homo eqInNat = eqNat
homo (eqInΠ B=A p) = eqΠ B=A (eqFam B=A \x y x=y -> homo (p x y x=y))
homo (eqInΣ F=G p q) = eqΣ (homo p) F=G
cast-id' : {A B C : Setoid}{x : El A}{y : El B}(p : C == B) -> x == y -> x == p << y
cast-id' C=B x=y = trans x=y (cast-id _)
-- Some helper stuff
K : {A : Setoid} -> Setoid -> Fam A
K B = fam (\_ -> B) (\_ _ _ -> refl)
infixr 20 _==>_
infixl 70 _·_ _∘_ _○_
infixl 90 _#_
!-cong : {A B : Setoid}(F : Fam A)(G : Fam B){x : El A}{y : El B} ->
F == G -> x == y -> F ! x == G ! y
!-cong F G (eqFam B=A F=G) x=y = F=G _ _ x=y
!-cong-R : {A : Setoid}(F : Fam A){x y : El A} ->
x == y -> F ! x == F ! y
!-cong-R F x=y = !-cong F F refl x=y
_==>_ : Setoid -> Setoid -> Setoid
A ==> B = Π A (K B)
_#_ : {A : Setoid}{F : Fam A} -> El (Π A F) -> (x : El A) -> El (F ! x)
ƛ f _ # x = f x
#-cong : {A B : Setoid}{F : Fam A}{G : Fam B}
(f : El (Π A F))(g : El (Π B G)){x : El A}{y : El B} ->
f == g -> x == y -> f # x == g # y
#-cong ._ ._ (eqInΠ _ f=g) x=y = f=g _ _ x=y
#-cong-R : {A : Setoid}{F : Fam A}(f : El (Π A F)){x y : El A} ->
x == y -> f # x == f # y
#-cong-R f p = #-cong f f refl p
id : {A : Setoid} -> El (A ==> A)
id = ƛ (\x -> x) (\_ _ p -> p)
-- Family composition
_○_ : {A B : Setoid} -> Fam A -> El (B ==> A) -> Fam B
F ○ f = fam (\x -> F ! (f # x)) (\x y x=y -> !-cong-R F (#-cong-R f x=y))
lem-○-id : {A : Setoid}{F : Fam A} -> F ○ id == F
lem-○-id {F = F} = eqFam refl \x y x=y -> !-cong-R F x=y
_∘_ : {A B : Setoid}{F : Fam B} -> El (Π B F) -> (g : El (A ==> B)) -> El (Π A (F ○ g))
f ∘ g = ƛ (\x -> f # (g # x)) \x y x=y -> #-cong-R f (#-cong-R g x=y)
lem-∘-id : {A : Setoid}{F : Fam A}(f : El (Π A F)) -> f ∘ id == f
lem-∘-id (ƛ f pf) = eqInΠ refl pf
lem-id-∘ : {A B : Setoid}(f : El (A ==> B)) -> id ∘ f == f
lem-id-∘ (ƛ f pf) = eqInΠ refl pf
-- Simply type composition (not quite a special case of ∘ because of proof relevance)
_·_ : {A B C : Setoid} -> El (B ==> C) -> El (A ==> B) -> El (A ==> C)
f · g = eqΠ refl (eqFam refl \_ _ _ -> refl) << f ∘ g
fst : {A : Setoid}{F : Fam A} -> El (Σ A F) -> El A
fst (x , y) = x
snd : {A : Setoid}{F : Fam A}(p : El (Σ A F)) -> El (F ! fst p)
snd (x , y) = y
fst-eq : {A B : Setoid}{F : Fam A}{G : Fam B}
{x : El (Σ A F)}{y : El (Σ B G)} -> x == y -> fst x == fst y
fst-eq (eqInΣ _ x₁=x₂ _) = x₁=x₂
snd-eq : {A B : Setoid}{F : Fam A}{G : Fam B}
{x : El (Σ A F)}{y : El (Σ B G)} -> x == y -> snd x == snd y
snd-eq (eqInΣ _ _ y₁=y₂) = y₁=y₂
η : {A : Setoid}{F : Fam A}(f : El (Π A F)){pf : (x y : El A) -> x == y -> f # x == f # y} ->
f == ƛ {F = F} (_#_ f) pf
η (ƛ f pf) = eqInΠ refl pf
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.