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
|
|---|---|---|---|---|
library/encoding/encodeCharForURL.applescript
|
NYHTC/applescript-fm-helper
| 1 |
1720
|
<reponame>NYHTC/applescript-fm-helper<filename>library/encoding/encodeCharForURL.applescript<gh_stars>1-10
-- encodeCharForURL(this_char)
-- <NAME> http://www.danshockley.com
-- Encode a character
(*
HISTORY:
1.0 - created
*)
on run
encodeCharForURL(";")
end run
--------------------
-- START OF CODE
--------------------
on encodeCharForURL(this_char)
-- version 1.0
set the ASCII_num to (the ASCII number this_char)
set the hex_list to {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "A", "B", "C", "D", "E", "F"}
set x to item ((ASCII_num div 16) + 1) of the hex_list
set y to item ((ASCII_num mod 16) + 1) of the hex_list
return ("%" & x & y) as string
end encodeCharForURL
--------------------
-- END OF CODE
--------------------
|
thirdparty/adasdl/thin/adasdl/AdaSDL/binding/sdl-joystick.ads
|
Lucretia/old_nehe_ada95
| 0 |
23407
|
-- ----------------------------------------------------------------- --
-- AdaSDL --
-- Binding to Simple Direct Media Layer --
-- Copyright (C) 2001 A.M.F.Vargas --
-- <NAME> --
-- Ponta Delgada - Azores - Portugal --
-- http://www.adapower.net/~avargas --
-- E-mail: <EMAIL> --
-- ----------------------------------------------------------------- --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public --
-- License as published by the Free Software Foundation; either --
-- version 2 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 --
-- General Public License for more details. --
-- --
-- You should have received a copy of the GNU 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. --
-- --
-- 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. --
-- ----------------------------------------------------------------- --
-- **************************************************************** --
-- This is an Ada binding to SDL ( Simple DirectMedia Layer from --
-- Sam Lantinga - www.libsld.org ) --
-- **************************************************************** --
-- In order to help the Ada programmer, the comments in this file --
-- are, in great extent, a direct copy of the original text in the --
-- SDL header files. --
-- **************************************************************** --
with System;
with Interfaces.C.Strings;
with SDL.Types; use SDL.Types;
package SDL.Joystick is
package C renames Interfaces.C;
-- The pointer to a internal joystick structure used
-- to identify an SDL joystick
type Joystick_ptr is new System.Address;
Null_Joystick_ptr : constant Joystick_ptr :=
Joystick_ptr (System.Null_Address);
-- Function prototypes */
--
-- Count the number of joysticks attached to the system
function NumJoysticks return C.int;
pragma Import (C, NumJoysticks, "SDL_NumJoysticks");
-- Get the implementation dependent name of a joystick.
-- This can be called before any joysticks are opened.
-- If no name can be found, this function returns NULL.
function JoystickName (device_index : C.int) return C.Strings.chars_ptr;
pragma Import (C, JoystickName, "SDL_JoystickName");
-- Open a joystick for use - the index passed as an argument refers to
-- the N'th joystick on the system. This index is the value which will
-- identify this joystick in future joystick events.
-- This function returns a joystick identifier, or
-- NULL if an error occurred.
function JoystickOpen (device_index : C.int) return Joystick_ptr;
pragma Import (C, JoystickOpen, "SDL_JoystickOpen");
-- Returns 1 if the joystick has been opened, or 0 if it has not.
function JoystickOpened (device_index : C.int) return C.int;
pragma Import (C, JoystickOpened, "SDL_JoystickOpened");
-- Get the device index of an opened joystick.
function JoystickIndex (joystick : Joystick_ptr) return C.int;
pragma Import (C, JoystickIndex, "SDL_JoystickIndex");
-- Get the number of general axis controls on a joystick
function JoystickNumAxes (joystick : Joystick_ptr) return C.int;
pragma Import (C, JoystickNumAxes, "SDL_JoystickNumAxes");
-- Get the number of trackballs on a joystick
-- Joystick trackballs have only relative motion events associated
-- with them and their state cannot be polled.
function JoystickNumBalls (joystick : Joystick_ptr) return C.int;
pragma Import (C, JoystickNumBalls, "SDL_JoystickNumBalls");
-- Get the number of POV hats on a joystick
function JoystickNumHats (joystick : Joystick_ptr) return C.int;
pragma Import (C, JoystickNumHats, "SDL_JoystickNumHats");
-- Get the number of buttonYs on a joystick
function JoystickNumButtons (joystick : Joystick_ptr) return C.int;
pragma Import (C, JoystickNumButtons, "SDL_JoystickNumButtons");
-- Update the current state of the open joysticks.
-- This is called automatically by the event loop if any joystick
-- events are enabled.
procedure JoystickUpdate;
pragma Import (C, JoystickUpdate, "SDL_JoystickUpdate");
-- Enable/disable joystick event polling.
-- If joystick events are disabled, you must call JoystickUpdate
-- yourself and check the state of the joystick when you want joystick
-- information.
-- The state can be one of QUERY, ENABLE or IGNORE.
function JoystickEventState (state : C.int) return C.int;
pragma Import (C, JoystickEventState, "SDL_JoystickEventState");
-- Get the current state of an axis control on a joystick
-- The state is a value ranging from -32768 to 32767.
-- The axis indices start at index 0.
function JoystickGetAxis (
joystick : Joystick_ptr;
axis : C.int)
return Sint16;
pragma Import (C, JoystickGetAxis, "SDL_JoystickGetAxis");
-- Get the current state of a POV hat on a joystick
-- The return value is one of the following positions:
-- TO BE REMOVED type HAT_State is mod 2**16;
type HAT_State is mod 2**8;
for HAT_State'Size use 8;
HAT_CENTERED : constant HAT_State := 16#00#;
HAT_UP : constant HAT_State := 16#01#;
HAT_RIGHT : constant HAT_State := 16#02#;
HAT_DOWN : constant HAT_State := 16#04#;
HAT_LEFT : constant HAT_State := 16#08#;
HAT_RIGHTUP : constant HAT_State := (HAT_RIGHT or HAT_UP);
HAT_RIGHTDOWN : constant HAT_State := (HAT_RIGHT or HAT_DOWN);
HAT_LEFTUP : constant HAT_State := (HAT_LEFT or HAT_UP);
HAT_LEFTDOWN : constant HAT_State := (HAT_LEFT or HAT_DOWN);
-- The hat indices start at index 0.
function JoystickGetHat (
joystick : Joystick_ptr;
hat : C.int)
return Uint8;
pragma Import (C, JoystickGetHat, "SDL_JoystickGetHat");
-- Get the ball axis change since the last poll
-- This returns 0, or -1 if you passed it invalid parameters.
-- The ball indices start at index 0.
function JoystickGetBall (
joystick : Joystick_ptr;
ball : C.int;
dx, dy : int_ptr)
return C.int;
pragma Import (C, JoystickGetBall, "SDL_JoystickGetBall");
type Joy_Button_State is mod 2**8;
for Joy_Button_State'Size use 8;
pragma Convention (C, Joy_Button_State);
PRESSED : constant Joy_Button_State :=
Joy_Button_State (SDL_PRESSED);
RELEASED : constant Joy_Button_State :=
Joy_Button_State (SDL_RELEASED);
-- Get the current state of a button on a joystick
-- The button indices start at index 0.
function JoystickGetButton (
joystick : Joystick_ptr;
button : C.int)
return Joy_Button_State;
pragma Import (C, JoystickGetButton, "SDL_JoystickGetButton");
-- Close a joystick previously opened with SDL_JoystickOpen
procedure JoystickClose (joystick : Joystick_ptr);
pragma Import (C, JoystickClose, "SDL_JoystickClose");
end SDL.Joystick;
|
programs/oeis/187/A187334.asm
|
neoneye/loda
| 22 |
29453
|
; A187334: Sum{floor(kn/5), k=1,2,3,4,5}; complement of A187335.
; 0,1,4,7,10,15,16,19,22,25,30,31,34,37,40,45,46,49,52,55,60,61,64,67,70,75,76,79,82,85,90,91,94,97,100,105,106,109,112,115,120,121,124,127,130,135,136,139,142,145,150,151,154,157,160,165,166,169,172,175,180,181,184,187,190,195,196,199,202,205,210,211,214,217,220,225,226,229,232,235,240,241,244,247,250,255,256,259,262,265,270,271,274,277,280,285,286,289,292,295
mul $0,3
mov $1,$0
gcd $0,5
mul $1,2
add $0,$1
sub $0,5
div $0,2
|
source/RASCAL-MessageTrans.ads
|
bracke/Meaning
| 0 |
15363
|
<filename>source/RASCAL-MessageTrans.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 MessageTrans types and methods.
-- $Author$
-- $Date$
-- $Revision$
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with RASCAL.OS; use RASCAL.OS;
package RASCAL.MessageTrans is
Messages_File_Is_Closed : Exception;
--
-- Open messages file.
--
function Open_File (Filename : in String) return Messages_Handle_Type;
--
-- Lookup token in messages file.
--
function Lookup (Token : in String;
MCB : in Messages_Handle_Type;
Parameter1 : in String := "";
Parameter2 : in String := "";
Parameter3 : in String := "";
Parameter4 : in String := "") return String;
--
-- Close messages file.
--
procedure Close_File (MCB : Messages_Handle_Type);
--
-- Looks up the Token and interprets the result as a boolean.
--
procedure Read_Boolean (Token : in String;
Value : in out Boolean;
MCB : in Messages_Handle_Type);
--
-- Looks up the Token and interprets the result as an integer.
--
procedure Read_Integer (Token : in String;
Value : in out Integer;
MCB : in Messages_Handle_Type);
--
-- Looks up the Token and interprets the result as a string.
--
procedure Read_String (Token : in String;
Value : in out Unbounded_String;
MCB : in Messages_Handle_Type);
end RASCAL.MessageTrans;
|
KernelParts/IH.asm
|
Th3Matt/FlameOS-2.0
| 0 |
246560
|
<filename>KernelParts/IH.asm
Exceptions:
.DE:
xchg bx, bx
cli ;ff4
push eax
push ebx
push ecx
push edx
push edi
push esi
add esp, 24 ;fd8
pop ebx
pop ecx
pop edx
mov eax, 0xFFFF
push ecx
push ebx
sub esp, 24+4
push word 'DE'
call .Panic
add esp, 2
pop esi
pop edi
pop edx
pop ecx
pop ebx
pop eax
add esp, 4
push eax
add esp, 4
pop eax
add eax, 3
push eax
sub esp, 4
pop eax
sti
iret
.SS:
xchg bx, bx
xor ebp, ebp
not ebp
cli ;ff4
push eax
push ebx
push ecx
push edx
push edi
push esi
add esp, 24 ;fd8
pop eax
pop ebx
pop ecx
pop edx
push edx
push ecx
push ebx
sub esp, 24+4
push word 'SS'
call .Panic
add esp, 2
pop esi
pop edi
pop edx
pop ecx
pop ebx
pop eax
add esp, 4
push eax
add esp, 4
pop eax
add eax, 3
push eax
sub esp, 4
pop eax
sti
iret
.UD:
xchg bx, bx
cli ;ff4
push eax
push ebx
push ecx
push edx
push edi
push esi
add esp, 24 ;fd8
pop ebx
pop ecx
pop edx
mov eax, 0xFFFF
push ecx
push ebx
sub esp, 24+4
push word 'UD'
call .Panic
add esp, 2
pop esi
pop edi
pop edx
pop ecx
pop ebx
pop eax
add esp, 4
push eax
add esp, 4
pop eax
add eax, 3
push eax
sub esp, 4
pop eax
sti
iret
.DF:
xchg bx, bx
mov esp, 0x1000
cli ;ff4
push eax
push ebx
push ecx
push edx
push edi
push esi
xor edx, edx
xor ecx, ecx
xor ebx, ebx
xor eax, eax
sub esp, 24+4
push word 'DF'
call .Panic
add esp, 2
pop esi
pop edi
pop edx
pop ecx
pop ebx
pop eax
sti
iret
.NP:
xchg bx, bx
cli ;ff4
push eax
push ebx
push ecx
push edx
push edi
push esi
add esp, 24 ;fd8
pop eax
pop ebx
pop ecx
pop edx
push edx
push ecx
push ebx
sub esp, 24+4
push word 'NP'
call .Panic
add esp, 2
pop esi
pop edi
pop edx
pop ecx
pop ebx
pop eax
add esp, 4
push eax
add esp, 4
pop eax
add eax, 3
push eax
sub esp, 4
pop eax
sti
iret
.GP:
xchg bx, bx
cli ;ff4
push eax
push ebx
push ecx
push edx
push edi
push esi
add esp, 24 ;fd8
pop eax ; error code
pop ebx ; EIP
pop ecx ; CS
pop edx ; EFLAGS?
push edx
push ecx
push ebx
sub esp, 24+4
push word 'GP'
call .Panic
add esp, 2
pop esi
pop edi
pop edx
pop ecx
pop ebx
pop eax
add esp, 4
push eax
add esp, 4
pop eax
add eax, 3
push eax
sub esp, 4
pop eax
sti
iret
.Panic:
xchg bx, bx
push edx
push ebx
push eax
push ecx
push ds
mov ebp, esp ; copying the safe stack location for the stack dance
xchg bx, bx
add esp, 20+4
pop cx
sub esp, 20-4+4+2
mov ax, 0x48
mov ds, ax
mov edi, (8*80+14)*2
mov [edi], cl ; setting up exception screen
inc edi
inc edi ; saving bytes as (inc edi inc edi) < (add edi, 2)
mov [edi], ch
add edi, 13*2
xchg bx, bx
pop ecx
pop edx ; pop eax
pop ebx
pop eax ; pop edx
mov esi, 0
xchg ebp, esp ; begining the stack dance (attempting to not overwrite important data on the stack by switching esp to a safe location)
call .HexWrite4 ; ErrCode
xchg ebp, esp
add edi, (80*3-22)*2
add esp, 4+4*6
pop edx
sub esp, 8
xchg ebp, esp
call .HexWrite8 ; eax
xchg ebp, esp
add edi, 9*2
pop edx
sub esp, 8
xchg ebp, esp
call .HexWrite8 ; ebx
xchg ebp, esp
add edi, 9*2
pop edx
sub esp, 8
xchg ebp, esp
call .HexWrite8 ; ecx
xchg ebp, esp
add edi, 9*2
pop edx
sub esp, 8
xchg ebp, esp
call .HexWrite8 ; edx
xchg ebp, esp
add edi, (81-(8*4+8*3))*2
pop edx
sub esp, 8
xchg ebp, esp
call .HexWrite8 ; esi
xchg ebp, esp
add edi, 9*2
pop edx
sub esp, 8
xchg ebp, esp
call .HexWrite8 ; edi
xchg ebp, esp
add edi, (81-8*3)*2
mov edx, ecx
xchg ebp, esp
call .HexWrite4 ; cs
xchg ebp, esp
add edi, (4+5)*2
sub esp, 4*(5+1)
pop edx
push edx
call .HexWrite4
add edi, (80*2+10+6)*2
mov edx, ebx
call .HexWrite8 ; eip
mov ax, 0x18
mov ds, ax
xor ecx, ecx
mov ds:[0x10], ecx
call Display.ReDraw
jmp $
.HexWrite2: ; Write whatever is in dl in hex, reqires esi to point to a HexTable with 0s between entries
push ebx
push dx
shr dl, 4
xor ebx, ebx
mov bl, dl
mov esi, 0
add esi, ebx
shl esi, 1
mov dl, [esi]
shr esi, 1
mov [edi], dl
sub esi, ebx
pop dx
and dl, 0x0F
inc edi
inc edi
xor ebx, ebx
mov bl, dl
add esi, ebx
shl esi, 1
mov dl, [esi]
shr esi, 1
mov [edi], dl
pop ebx
ret
.HexWrite4: ; Write whatever is in dx in hex
push dx
xchg dl, dh
call .HexWrite2
xchg dl, dh
inc edi
inc edi
call .HexWrite2
pop dx
ret
.HexWrite8: ; Write whatever is in edx in hex
push edx
ror edx, 16
call .HexWrite4
inc edi
inc edi
ror edx, 16
call .HexWrite4
pop edx
ret
IRQ:
.Timer:
cli
pusha
xor ecx, ecx ; Screen redraw
int 0x30
mov al, 0x20
out 0x20, al
popa
sti
iret
.PS2:
cli
;xchg bx, bx
;ud2
pusha
push ds
mov ax, 0x18
mov ds, ax
mov dl, [0x20]
mov ebx, [0x23]
test dl, 1
je .PS2.1
mov ax, [0x21]
mov ds, ax
.PS2.1:
in al, 0x60
mov [ds:ebx], al
mov al, 0x20
out 0x20, al
pop ds
popa
sti
iret
|
thirdparty/adasdl/thin/adasdl/AdaGL/GL_x11/adagl.ads
|
Lucretia/old_nehe_ada95
| 0 |
649
|
<filename>thirdparty/adasdl/thin/adasdl/AdaGL/GL_x11/adagl.ads
-- ---------------------------------------------------------------- --
-- This file contains some improvements to the gl Ada binding --
-- in order to allow a better programming style. --
-- The prototypes below follow the Implementation advice from --
-- ARM Annex B (B.3). --
-- ---------------------------------------------------------------- --
-- ----------------------------------------------------------------- --
-- Copyright (C) 2001 A.M.F.Vargas --
-- <NAME> --
-- <NAME> - Azores - Portugal --
-- http://www.adapower.net/~avargas --
-- E-mail: <EMAIL> --
-- ----------------------------------------------------------------- --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public --
-- License as published by the Free Software Foundation; either --
-- version 2 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 --
-- General Public License for more details. --
-- --
-- You should have received a copy of the GNU 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. --
-- --
-- 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. --
-- ----------------------------------------------------------------- --
with gl_h; use gl_h;
package AdaGL is
function glGetString (Chars_Ref : GLenum) return String;
type Three_GLfloat_Vector is array (0 .. 2) of GLfloat;
pragma Convention (C, Three_GLFloat_Vector);
type Four_GLfloat_Vector is array (0 .. 3) of GLfloat;
pragma Convention (C, Four_GLFloat_Vector);
type Three_GLint_Vector is array (0 .. 2) of GLint;
pragma Convention (C, Three_GLint_Vector);
type Four_GLint_Vector is array (0 .. 3) of GLint;
pragma Convention (C, Four_GLint_Vector);
procedure glVertex3fv (v : Three_GLFloat_Vector);
pragma Import (C, glVertex3fv, "glVertex3fv");
procedure glColor3fv (v : Three_GLFloat_Vector);
pragma Import (C, glColor3fv, "glColor3fv");
-- To be used with pname receiving one of:
-- GL_AMBIENT, GL_DIFFUSE, GL_SPECULAR, GL_POSITION
procedure glLightfv (light : GLenum;
pname : GLenum;
params : Three_GLFloat_Vector);
-- To be used with pname receiving GL_SPOT_DIRECTION:
procedure glLightfv (light : GLenum;
pname : GLenum;
params : Four_GLFloat_Vector);
-- To be used with pname receiving:
-- GL_SPOT_EXPONENT, GL_SPOT_CUTOFF, GL_CONSTANT_ATTENUATION,
-- GL_LINEAR_ATTENUATION, GL_QUADRATIC_ATTENUATION
procedure glLightfv (light : GLenum;
pname : GLenum;
params : in out GLFloat); -- pseudo in
pragma Import (C, glLightfv, "glLightfv");
-- To be used with pname receiving one of:
-- GL_AMBIENT, GL_DIFFUSE, GL_SPECULAR, GL_POSITION
procedure glLightiv (light : GLenum;
pname : GLenum;
params : Three_GLint_Vector);
-- To be used with pname receiving GL_SPOT_DIRECTION:
procedure glLightiv (light : GLenum;
pname : GLenum;
params : Four_GLint_Vector);
-- To be used with pname receiving:
-- GL_SPOT_EXPONENT, GL_SPOT_CUTOFF, GL_CONSTANT_ATTENUATION,
-- GL_LINEAR_ATTENUATION, GL_QUADRATIC_ATTENUATION
procedure glLightiv (light : GLenum;
pname : GLenum;
params : in out GLint); -- pseudo in
pragma Import (C, glLightiv, "glLightiv");
-- To be used with pname receiving:
-- GL_AMBIENT, GL_DIFFUSE, GL_SPECULAR, GL_EMISSION
-- GL_AMBIENT_AND_DIFFUSE
procedure glMaterialfv (face : GLenum;
pname : GLenum;
params : Four_GLfloat_Vector);
-- To be used with pname receiving:
-- GL_COLOR_INDEXES
procedure glMaterialfv (face : GLenum;
pname : GLenum;
params : Three_GLfloat_Vector);
-- To be used with pname receiving:
-- GL_SHININESS
procedure glMaterialfv (face : GLenum;
pname : GLenum;
params : in out GLfloat); -- pseudo in
pragma Import (C, glMaterialfv, "glMaterialfv");
-- To be used with pname receiving:
-- GL_AMBIENT, GL_DIFFUSE, GL_SPECULAR, GL_EMISSION
-- GL_AMBIENT_AND_DIFFUSE
procedure glMaterialiv (face : GLenum;
pname : GLenum;
params : Four_GLint_Vector);
-- To be used with pname receiving:
-- GL_COLOR_INDEXES
procedure glMaterialiv (face : GLenum;
pname : GLenum;
params : Three_GLint_Vector);
-- To be used with pname receiving:
-- GL_SHININESS
procedure glMaterialiv (face : GLenum;
pname : GLenum;
params : in out GLint); -- pseudo in
pragma Import (C, glMaterialiv, "glMaterialiv");
type GLubyte_Array is array (Integer range <>) of GLubyte;
-- type_Id = GL_UNSIGNED_BYTE
procedure glTexImage1D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLubyte_Array);
type GLbyte_Array is array (Integer range <>) of GLbyte;
-- type_Id = GL_BYTE
procedure glTexImage1D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLbyte_Array);
type GLushort_Array is array (Integer range <>) of GLushort;
-- type_Id = GL_UNSIGNED_SHORT
procedure glTexImage1D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLushort_Array);
type GLshort_Array is array (Integer range <>) of GLshort;
-- type_Id = GL_SHORT
procedure glTexImage1D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLshort_Array);
type GLuint_Array is array (Integer range <>) of GLuint;
-- type_Id = GL_UNSIGNED_INT
procedure glTexImage1D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLuint_Array);
type GLint_Array is array (Integer range <>) of GLint;
-- type_Id = GL_INT;
procedure glTexImage1D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLint_Array);
type GLfloat_Array is array (Integer range <>) of GLfloat;
-- type_Id = GL_FLOAT
procedure glTexImage1D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLfloat_Array);
pragma Import (C, glTexImage1D, "glTexImage1D");
-- type_Id = GL_UNSIGNED_BYTE
procedure glTexImage2D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLubyte_Array);
-- type_Id = GL_BYTE
procedure glTexImage2D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLbyte_Array);
-- type_Id = GL_UNSIGNED_SHORT
procedure glTexImage2D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLushort_Array);
-- type_Id = GL_SHORT
procedure glTexImage2D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLshort_Array);
-- type_Id = GL_UNSIGNED_INT
procedure glTexImage2D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLuint_Array);
-- type_Id = GL_INT
procedure glTexImage2D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLint_Array);
-- type_Id = GL_FLOAT
procedure glTexImage2D (target : GLenum;
level : GLint;
internalFormat : GLint;
width : GLsizei;
height : GLsizei;
border : GLint;
format : GLenum;
type_Id : GLenum;
pixels : GLfloat_Array);
pragma Import (C, glTexImage2D, "glTexImage2D");
-- type_Id = GL_UNSIGNED_BYTE
procedure glDrawPixels (width : GLsizei;
height : GLsizei;
format : GLenum;
type_Id : GLenum;
pixels : GLubyte_Array);
-- type_Id = GL_BYTE
procedure glDrawPixels (width : GLsizei;
height : GLsizei;
format : GLenum;
type_Id : GLenum;
pixels : GLbyte_Array);
-- type_Id = GL_UNSIGNED_SHORT
procedure glDrawPixels (width : GLsizei;
height : GLsizei;
format : GLenum;
type_Id : GLenum;
pixels : GLushort_Array);
-- type_Id = GL_SHORT
procedure glDrawPixels (width : GLsizei;
height : GLsizei;
format : GLenum;
type_Id : GLenum;
pixels : GLshort_Array);
-- type_Id = GL_UNSIGNED_INT
procedure glDrawPixels (width : GLsizei;
height : GLsizei;
format : GLenum;
type_Id : GLenum;
pixels : GLuint_Array);
-- type_Id = GL_INT
procedure glDrawPixels (width : GLsizei;
height : GLsizei;
format : GLenum;
type_Id : GLenum;
pixels : GLint_Array);
-- type_Id = GL_FLOAT
procedure glDrawPixels (width : GLsizei;
height : GLsizei;
format : GLenum;
type_Id : GLenum;
pixels : GLfloat_Array);
pragma Import (C, glDrawPixels, "glDrawPixels");
end AdaGL;
|
Bubble Sort Graphic/sorthem.asm
|
ChrisV2026/Projects
| 0 |
85773
|
<filename>Bubble Sort Graphic/sorthem.asm<gh_stars>0
%include "asm_io.inc"
SECTION .data
row1: db " o|o",10,0
row2: db " oo|oo",10,0
row3: db " ooo|ooo",10,0
row4: db " oooo|oooo",10,0
row5: db " ooooo|ooooo",10,0
row6: db " oooooo|oooooo",10,0
row7: db " ooooooo|ooooooo",10,0
row8: db " oooooooo|oooooooo",10,0
row9: db " ooooooooo|ooooooooo",10,0
flat: db "XXXXXXXXXXXXXXXXXXXXXXX",10,0
argc: db "Incorrect number of command line arguments",10,0
argv: db "Incorrect command line argument",10,0
x1: dd 4
start: db "Initial Configuration",10,0
ending: db "Final Configuration",10,0
arr: dd 0,0,0,0,0,0,0,0,0
SECTION .bss
num resd 1
change resd 1
SECTION .text
global asm_main
asm_main:
enter 0,0
pusha
mov eax, dword [ebp+8]
cmp eax, dword 2
jne err1
mov ebx, dword [ebp+12]
mov eax, dword [ebx+4]
mov bl, byte [eax]
cmp bl, '1'
jbe err2
cmp bl, '9'
ja err2
sub bl, '0'
mov ecx, 0
mov cl, bl
mov bl, byte [eax+1]
cmp bl, byte 0
jne err2
mov [change], dword 0
mov [num], ecx
push dword [num]
push arr
call rconf
mov eax, start
call print_string
call showp
call sorthem
mov eax, ending
call print_string
call showp
add esp,8
jmp end
sorthem:
enter 0,0
pusha
mov ebx, dword [ebp+8] ;;global name arr
mov ecx, dword [ebp+12] ;;global name num
cmp ecx, 1
je sorthem_end
sub ecx, 1
push ecx
add ecx,1
add ebx, 4
push ebx
sub ebx, 4
call sorthem
pop eax
pop eax
mov eax, 4
mul ecx
mov ecx, eax
mov edx, 0
mov [change], dword 0
loop2:
sub ecx, 4
cmp edx, ecx
je loop_end
add ecx, 4
mov eax, dword [ebx+edx]
cmp eax, dword [ebx+4+edx]
ja loop_end
mov eax, dword [ebx+edx]
push eax
mov eax, dword [ebx+4+edx]
push eax
pop dword [ebx+edx]
pop dword [ebx+4+edx]
mov [change], dword 1
add edx, 4
jmp loop2
loop_end:
cmp dword [change], dword 1
jne sorthem_end
push dword [num]
push arr
call showp
add esp, 8
sorthem_end:
popa
leave
ret
showp:
enter 0,0
pusha
mov ebx, dword [ebp+8] ;;array
mov eax, dword [ebp+12] ;;size
mul dword [x1]
mov ecx, eax
loop:
sub ecx, 4
cmp dword[ebx+ecx], 1
je p1
cmp dword[ebx+ecx], 2
je p2
cmp dword[ebx+ecx], 3
je p3
cmp dword[ebx+ecx], 4
je p4
cmp dword[ebx+ecx], 5
je p5
cmp dword[ebx+ecx], 6
je p6
cmp dword[ebx+ecx], 7
je p7
cmp dword[ebx+ecx], 8
je p8
cmp dword[ebx+ecx], 9
je p9
p1:
mov eax, row1
jmp print
p2:
mov eax, row2
jmp print
p3:
mov eax, row3
jmp print
p4:
mov eax, row4
jmp print
p5:
mov eax, row5
jmp print
p6:
mov eax, row6
jmp print
p7:
mov eax, row7
jmp print
p8:
mov eax, row8
jmp print
p9:
mov eax, row9
jmp print
print:
call print_string
cmp ecx, 0
jne loop
mov eax, flat
call print_string
call read_char
popa
leave
ret
err1:
mov eax, argc
call print_string
jmp end
err2:
mov eax, argv
call print_string
jmp end
end:
popa
leave
ret
|
theorems/cohomology/EMModel.agda
|
timjb/HoTT-Agda
| 0 |
2454
|
{-# OPTIONS --without-K --rewriting #-}
open import HoTT
open import homotopy.EilenbergMacLane
open import groups.ToOmega
open import cohomology.Theory
open import cohomology.SpectrumModel
module cohomology.EMModel where
module _ {i} (G : AbGroup i) where
open EMExplicit G using (⊙EM; EM-level; EM-conn; spectrum)
private
E : (n : ℤ) → Ptd i
E (pos m) = ⊙EM m
E (negsucc m) = ⊙Lift ⊙Unit
E-spectrum : (n : ℤ) → ⊙Ω (E (succ n)) ⊙≃ E n
E-spectrum (pos n) = spectrum n
E-spectrum (negsucc O) = ≃-to-⊙≃ {X = ⊙Ω (E 0)}
(equiv (λ _ → _) (λ _ → idp)
(λ _ → idp) (prop-has-all-paths _))
idp
E-spectrum (negsucc (S n)) = ≃-to-⊙≃ {X = ⊙Ω (E (negsucc n))}
(equiv (λ _ → _) (λ _ → idp)
(λ _ → idp) (prop-has-all-paths {{=-preserves-level ⟨⟩}} _))
idp
EM-Cohomology : CohomologyTheory i
EM-Cohomology = spectrum-cohomology E E-spectrum
open CohomologyTheory EM-Cohomology
EM-dimension : {n : ℤ} → n ≠ 0 → is-trivialᴳ (C n (⊙Lift ⊙S⁰))
EM-dimension {pos O} neq = ⊥-rec (neq idp)
EM-dimension {pos (S n)} _ =
contr-is-trivialᴳ (C (pos (S n)) (⊙Lift ⊙S⁰))
{{connected-at-level-is-contr
{{⟨⟩}}
{{Trunc-preserves-conn $
equiv-preserves-conn
(pre⊙∘-equiv ⊙lower-equiv ∘e ⊙Bool→-equiv-idf _ ⁻¹)
{{path-conn (connected-≤T (⟨⟩-monotone-≤ (≤-ap-S (O≤ n)))
)}}}}}}
EM-dimension {negsucc O} _ =
contr-is-trivialᴳ (C (negsucc O) (⊙Lift ⊙S⁰))
{{Trunc-preserves-level 0 (Σ-level (Π-level λ _ →
inhab-prop-is-contr idp) ⟨⟩)}}
EM-dimension {negsucc (S n)} _ =
contr-is-trivialᴳ (C (negsucc (S n)) (⊙Lift ⊙S⁰))
{{Trunc-preserves-level 0 (Σ-level (Π-level λ _ →
=-preserves-level ⟨⟩) λ _ → =-preserves-level (=-preserves-level ⟨⟩))}}
EM-Ordinary : OrdinaryTheory i
EM-Ordinary = ordinary-theory EM-Cohomology EM-dimension
|
Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0x84_notsx.log_21829_2289.asm
|
ljhsiun2/medusa
| 9 |
240871
|
.global s_prepare_buffers
s_prepare_buffers:
push %r13
push %r15
push %rbp
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WT_ht+0x1d76, %rsi
lea addresses_UC_ht+0xa7f6, %rdi
nop
nop
nop
and $29408, %rbx
mov $62, %rcx
rep movsq
nop
nop
lfence
lea addresses_WT_ht+0xdbc6, %rsi
lea addresses_A_ht+0xcc66, %rdi
nop
nop
nop
nop
nop
and %rdx, %rdx
mov $31, %rcx
rep movsw
nop
nop
nop
nop
sub $27058, %rbx
lea addresses_D_ht+0x120d2, %r15
nop
sub %rdx, %rdx
movb $0x61, (%r15)
nop
nop
nop
nop
add $257, %rdx
lea addresses_WT_ht+0x71e6, %rbx
nop
sub $53034, %rbp
movb $0x61, (%rbx)
nop
nop
nop
nop
nop
xor %rdi, %rdi
lea addresses_WC_ht+0xfc66, %rsi
lea addresses_D_ht+0x7ce6, %rdi
nop
nop
nop
nop
nop
xor $1464, %r13
mov $110, %rcx
rep movsw
nop
nop
nop
nop
nop
cmp %rcx, %rcx
lea addresses_D_ht+0x6466, %rsi
lea addresses_UC_ht+0x1b466, %rdi
nop
nop
nop
add $5682, %r15
mov $101, %rcx
rep movsw
sub %rdi, %rdi
lea addresses_D_ht+0x4966, %rsi
lea addresses_WT_ht+0x10666, %rdi
nop
nop
xor $46469, %rbp
mov $26, %rcx
rep movsl
nop
nop
nop
xor $37205, %r15
lea addresses_UC_ht+0x137, %rbp
nop
nop
and $8626, %r13
mov (%rbp), %di
nop
nop
nop
nop
dec %r15
lea addresses_WT_ht+0x17466, %rsi
nop
nop
and %rbx, %rbx
movl $0x61626364, (%rsi)
nop
nop
nop
nop
add %rdx, %rdx
lea addresses_normal_ht+0xf566, %rsi
lea addresses_UC_ht+0xde2a, %rdi
nop
nop
nop
inc %rbx
mov $50, %rcx
rep movsw
nop
nop
nop
nop
and $32700, %rdi
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %r15
pop %r13
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r13
push %r8
push %r9
push %rax
push %rbx
// Faulty Load
lea addresses_UC+0x18466, %r9
nop
nop
nop
nop
nop
xor %r10, %r10
vmovups (%r9), %ymm1
vextracti128 $0, %ymm1, %xmm1
vpextrq $0, %xmm1, %r13
lea oracles, %r8
and $0xff, %r13
shlq $12, %r13
mov (%r8,%r13,1), %r13
pop %rbx
pop %rax
pop %r9
pop %r8
pop %r13
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_UC', 'same': False, 'size': 2, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'type': 'addresses_UC', 'same': True, 'size': 32, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_WT_ht', 'congruent': 4, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 4, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_WT_ht', 'congruent': 5, 'same': False}, 'dst': {'type': 'addresses_A_ht', 'congruent': 9, 'same': False}, 'OP': 'REPM'}
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 1, 'congruent': 2, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 1, 'congruent': 7, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_WC_ht', 'congruent': 9, 'same': False}, 'dst': {'type': 'addresses_D_ht', 'congruent': 6, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_D_ht', 'congruent': 10, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 9, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_D_ht', 'congruent': 8, 'same': False}, 'dst': {'type': 'addresses_WT_ht', 'congruent': 9, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_UC_ht', 'same': False, 'size': 2, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 4, 'congruent': 11, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_normal_ht', 'congruent': 5, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 1, 'same': False}, 'OP': 'REPM'}
{'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/ada/acats/support/repspec.ada
|
best08618/asylo
| 7 |
23488
|
<reponame>best08618/asylo
-- REPSPEC.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.
--*
--
-- PURPOSE:
-- THIS REPORT PACKAGE PROVIDES THE MECHANISM FOR REPORTING THE
-- PASS/FAIL/NOT-APPLICABLE RESULTS OF EXECUTABLE (CLASSES A, C,
-- D, E, AND L) TESTS.
-- IT ALSO PROVIDES THE MECHANISM FOR GUARANTEEING THAT CERTAIN
-- VALUES BECOME DYNAMIC (NOT KNOWN AT COMPILE-TIME).
-- HISTORY:
-- JRK 12/13/79
-- JRK 06/10/80
-- JRK 08/06/81
-- JRK 10/27/82
-- JRK 06/01/84
-- PWB 07/30/87 ADDED PROCEDURE SPECIAL_ACTION.
-- TBN 08/20/87 ADDED FUNCTION LEGAL_FILE_NAME.
-- BCB 05/17/90 ADDED FUNCTION TIME_STAMP.
-- WMC 01/24/94 INCREASED RANGE OF TYPE FILE_NUM FROM 1..3 TO 1..5.
-- KAS 06/19/95 ADDED FUNCTION IDENT_WIDE_CHAR.
-- KAS 06/19/95 ADDED FUNCTION IDENT_WIDE_STR.
PACKAGE REPORT IS
SUBTYPE FILE_NUM IS INTEGER RANGE 1..5;
-- THE REPORT ROUTINES.
PROCEDURE TEST -- THIS ROUTINE MUST BE INVOKED AT THE
-- START OF A TEST, BEFORE ANY OF THE
-- OTHER REPORT ROUTINES ARE INVOKED.
-- IT SAVES THE TEST NAME AND OUTPUTS THE
-- NAME AND DESCRIPTION.
( NAME : STRING; -- TEST NAME, E.G., "C23001A-AB".
DESCR : STRING -- BRIEF DESCRIPTION OF TEST, E.G.,
-- "UPPER/LOWER CASE EQUIVALENCE IN " &
-- "IDENTIFIERS".
);
PROCEDURE FAILED -- OUTPUT A FAILURE MESSAGE. SHOULD BE
-- INVOKED SEPARATELY TO REPORT THE
-- FAILURE OF EACH SUBTEST WITHIN A TEST.
( DESCR : STRING -- BRIEF DESCRIPTION OF WHAT FAILED.
-- SHOULD BE PHRASED AS:
-- "(FAILED BECAUSE) ...REASON...".
);
PROCEDURE NOT_APPLICABLE -- OUTPUT A NOT-APPLICABLE MESSAGE.
-- SHOULD BE INVOKED SEPARATELY TO REPORT
-- THE NON-APPLICABILITY OF EACH SUBTEST
-- WITHIN A TEST.
( DESCR : STRING -- BRIEF DESCRIPTION OF WHAT IS
-- NOT-APPLICABLE. SHOULD BE PHRASED AS:
-- "(NOT-APPLICABLE BECAUSE)...REASON...".
);
PROCEDURE SPECIAL_ACTION -- OUTPUT A MESSAGE DESCRIBING SPECIAL
-- ACTIONS TO BE TAKEN.
-- SHOULD BE INVOKED SEPARATELY TO GIVE
-- EACH SPECIAL ACTION.
( DESCR : STRING -- BRIEF DESCRIPTION OF ACTION TO BE
-- TAKEN.
);
PROCEDURE COMMENT -- OUTPUT A COMMENT MESSAGE.
( DESCR : STRING -- THE MESSAGE.
);
PROCEDURE RESULT; -- THIS ROUTINE MUST BE INVOKED AT THE
-- END OF A TEST. IT OUTPUTS A MESSAGE
-- INDICATING WHETHER THE TEST AS A
-- WHOLE HAS PASSED, FAILED, IS
-- NOT-APPLICABLE, OR HAS TENTATIVELY
-- PASSED PENDING SPECIAL ACTIONS.
-- THE DYNAMIC VALUE ROUTINES.
-- EVEN WITH STATIC ARGUMENTS, THESE FUNCTIONS WILL HAVE DYNAMIC
-- RESULTS.
FUNCTION IDENT_INT -- AN IDENTITY FUNCTION FOR TYPE INTEGER.
( X : INTEGER -- THE ARGUMENT.
) RETURN INTEGER; -- X.
FUNCTION IDENT_CHAR -- AN IDENTITY FUNCTION FOR TYPE
-- CHARACTER.
( X : CHARACTER -- THE ARGUMENT.
) RETURN CHARACTER; -- X.
FUNCTION IDENT_WIDE_CHAR -- AN IDENTITY FUNCTION FOR TYPE
-- WIDE_CHARACTER.
( X : WIDE_CHARACTER -- THE ARGUMENT.
) RETURN WIDE_CHARACTER; -- X.
FUNCTION IDENT_BOOL -- AN IDENTITY FUNCTION FOR TYPE BOOLEAN.
( X : BOOLEAN -- THE ARGUMENT.
) RETURN BOOLEAN; -- X.
FUNCTION IDENT_STR -- AN IDENTITY FUNCTION FOR TYPE STRING.
( X : STRING -- THE ARGUMENT.
) RETURN STRING; -- X.
FUNCTION IDENT_WIDE_STR -- AN IDENTITY FUNCTION FOR TYPE WIDE_STRING.
( X : WIDE_STRING -- THE ARGUMENT.
) RETURN WIDE_STRING; -- X.
FUNCTION EQUAL -- A RECURSIVE EQUALITY FUNCTION FOR TYPE
-- INTEGER.
( X, Y : INTEGER -- THE ARGUMENTS.
) RETURN BOOLEAN; -- X = Y.
-- OTHER UTILITY ROUTINES.
FUNCTION LEGAL_FILE_NAME -- A FUNCTION TO GENERATE LEGAL EXTERNAL
-- FILE NAMES.
( X : FILE_NUM := 1; -- DETERMINES FIRST CHARACTER OF NAME.
NAM : STRING := "" -- DETERMINES REST OF NAME.
) RETURN STRING; -- THE GENERATED NAME.
FUNCTION TIME_STAMP -- A FUNCTION TO GENERATE THE TIME AND
-- DATE TO PLACE IN THE OUTPUT OF AN ACVC
-- TEST.
RETURN STRING; -- THE TIME AND DATE.
END REPORT;
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xa0.log_21829_1934.asm
|
ljhsiun2/medusa
| 9 |
100142
|
<filename>Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xa0.log_21829_1934.asm<gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r15
push %r8
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_D_ht+0xa7cc, %rsi
lea addresses_UC_ht+0x1bbec, %rdi
add $36922, %rbp
mov $97, %rcx
rep movsq
nop
nop
nop
sub %rdx, %rdx
lea addresses_WT_ht+0x127bc, %r8
sub %rcx, %rcx
movb (%r8), %dl
nop
nop
nop
nop
add $57368, %rdx
lea addresses_A_ht+0x6c90, %rsi
lea addresses_D_ht+0xa2cc, %rdi
clflush (%rsi)
nop
nop
nop
nop
sub %r15, %r15
mov $60, %rcx
rep movsb
nop
nop
lfence
lea addresses_WC_ht+0x6497, %rdx
nop
nop
xor $36212, %r15
mov $0x6162636465666768, %rbp
movq %rbp, (%rdx)
nop
nop
xor %rdx, %rdx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %rbp
pop %r8
pop %r15
ret
.global s_faulty_load
s_faulty_load:
push %r12
push %r13
push %rax
push %rbp
push %rbx
push %rcx
push %rsi
// Store
lea addresses_WT+0x1692c, %rcx
nop
nop
nop
add %rbx, %rbx
movb $0x51, (%rcx)
nop
nop
nop
nop
nop
add $36527, %rcx
// Store
lea addresses_US+0xf30c, %rbx
clflush (%rbx)
nop
nop
nop
nop
nop
cmp $37557, %rcx
movl $0x51525354, (%rbx)
and %rbx, %rbx
// Faulty Load
lea addresses_normal+0x1becc, %rax
nop
nop
nop
nop
sub $32473, %r13
mov (%rax), %r12
lea oracles, %rbp
and $0xff, %r12
shlq $12, %r12
mov (%rbp,%r12,1), %r12
pop %rsi
pop %rcx
pop %rbx
pop %rbp
pop %rax
pop %r13
pop %r12
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_normal', 'AVXalign': False, 'size': 4}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 5, 'type': 'addresses_WT', 'AVXalign': True, 'size': 1}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 5, 'type': 'addresses_US', 'AVXalign': True, 'size': 4}}
[Faulty Load]
{'src': {'NT': False, 'same': True, 'congruent': 0, 'type': 'addresses_normal', 'AVXalign': False, 'size': 8}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'same': False, 'congruent': 8, 'type': 'addresses_D_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 2, 'type': 'addresses_UC_ht'}}
{'src': {'NT': False, 'same': False, 'congruent': 4, 'type': 'addresses_WT_ht', 'AVXalign': False, 'size': 1}, 'OP': 'LOAD'}
{'src': {'same': False, 'congruent': 2, 'type': 'addresses_A_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 8, 'type': 'addresses_D_ht'}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_WC_ht', 'AVXalign': False, 'size': 8}}
{'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
*/
|
Library/Chart/SGroup/sgroupFind.asm
|
steakknife/pcgeos
| 504 |
25765
|
<reponame>steakknife/pcgeos
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) GeoWorks 1992 -- All Rights Reserved
PROJECT: PC GEOS
MODULE:
FILE: sgroupFind.asm
AUTHOR: <NAME>
ROUTINES:
Name Description
---- -----------
REVISION HISTORY:
Name Date Description
---- ---- -----------
cdb 6/ 8/92 Initial version.
DESCRIPTION:
$Id: sgroupFind.asm,v 1.1 97/04/04 17:46:54 newdeal Exp $
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SeriesGroupFindSeriesByNumber
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Get the OD of a series object
CALLED BY:
PASS: cx - series number
*ds:si - SeriesGroup
RETURN: *ds:ax - series object
DESTROYED: nothing
PSEUDO CODE/STRATEGY:
can be called as both a METHOD and a PROCEDURE
KNOWN BUGS/SIDE EFFECTS/IDEAS:
REVISION HISTORY:
Name Date Description
---- ---- -----------
cdb 6/ 2/92 Initial version.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
SeriesGroupFindSeriesByNumber method SeriesGroupClass,
MSG_SERIES_GROUP_FIND_SERIES_BY_NUMBER
uses cx,dx,bp
.enter
mov dx, cx
clr cx
call ChartCompFindChild
ERROR_C ILLEGAL_VALUE
mov_tr ax, cx
.leave
ret
SeriesGroupFindSeriesByNumber endm
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SeriesGroupFindSeriesByOD
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DESCRIPTION: Return the # of a series given its OD
PASS: *ds:si = SeriesGroupClass object
ds:di = SeriesGroupClass instance data
es = segment of SeriesGroupClass
^lcx:dx = child to find
RETURN: ax - series number
DESTROYED: nothing
REGISTER/STACK USAGE:
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/CAVEATS/IDEAS:
REVISION HISTORY:
Name Date Description
---- ---- -----------
cdb 6/ 8/92 Initial version.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
SeriesGroupFindSeriesByOD method dynamic SeriesGroupClass,
MSG_SERIES_GROUP_FIND_SERIES_BY_OD
uses cx, dx, bp
.enter
call ChartCompFindChild
mov_tr ax, bp ; number of child
.leave
ret
SeriesGroupFindSeriesByOD endm
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SeriesGroupFindSeriesGrObj
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
DESCRIPTION: Return the OD of a grobj for the given series
PASS: *ds:si = SeriesGroupClass object
ds:di = SeriesGroupClass instance data
es = segment of SeriesGroupClass
RETURN: ^lcx:dx - OD of grobj
DESTROYED: nothing
REGISTER/STACK USAGE:
PSEUDO CODE/STRATEGY:
KNOWN BUGS/SIDE EFFECTS/CAVEATS/IDEAS:
REVISION HISTORY:
Name Date Description
---- ---- -----------
cdb 6/ 8/92 Initial version.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
SeriesGroupFindSeriesGrObj method dynamic SeriesGroupClass,
MSG_SERIES_GROUP_FIND_SERIES_GROBJ
uses bp
.enter
call SeriesGroupFindSeriesByNumber
mov_tr si, ax ; *ds:si series object
mov ax, MSG_CHART_OBJECT_FIND_GROBJ
call ObjCallInstanceNoLock
.leave
ret
SeriesGroupFindSeriesGrObj endm
|
src/main/antlr/TextTemplateParser.g4
|
mikecargal/texttemplate-editor
| 0 |
4666
|
parser grammar TextTemplateParser;
options {
tokenVocab = TextTemplateLexer;
}
compilationUnit: beginningBullet? templateContents+ EOF;
subtemplateSection: SUBTEMPLATES text* subtemplateSpecs;
subtemplateSpecs: subtemplateSpec*;
subtemplateSpec: templateContextToken text*;
templateContents:
beginningBullet? (
subtemplateSection
| bullet
| templateToken
| templateContextCommaToken
| templateContextToken
| text+
);
bullet: NL BULLET SPACES?;
beginningBullet: BULLET SPACES?;
text: TEXT | NL | SPACES | continuation;
continuation: CONTINUATION;
templateToken: LBRACE bracedOptions RBRACE;
bracedOptions:
bracedArrow # braceArrow
| bracedThinArrow # braceThinArrow
| optionallyInvoked # braced
| predicateExpression # bracedPredicate;
methodInvoked: methodable methodInvocation+;
predicateExpression:
LP predicateExpression RP # nestedPredicate
| relationalOperand RELATIONAL relationalOperand # relationalOperation
| NOT predicateExpression # notPredicate
| predicateExpression (AND | OR) predicateExpression # logicalOperator
| (methodInvoked | namedSubtemplate | identifierCondition) # condition;
relationalOperand:
optionallyInvoked
| quoteOperand
| apostropheOperand
| namedSubtemplate
| identifierOperand
| digits;
digits: MINUS* DIGITS;
quoteOperand: QUOTE TEXT? QUOTE;
apostropheOperand: APOSTROPHE TEXT? APOSTROPHE;
identifierOperand: IDENTIFIER;
identifierCondition: IDENTIFIER (DOT IDENTIFIER)*;
templateContextCommaToken:
LBRACE contextToken COMMA optionallyInvoked RBRACE;
templateContextToken: LBRACE contextToken RBRACE;
contextToken: (
(namedSubtemplate | optionallyInvoked) COLON
| COLON
) (namedSubtemplate | optionallyInvoked);
templateSpec: namedSubtemplate | bracketedTemplateSpec;
bracketedTemplateSpec:
LBRACKET templateContents* subtemplateSection? RBRACKET;
invokedTemplateSpec:
LBRACKET beginningBullet? templateContents* RBRACKETLP;
bracedArrow: predicateExpression ARROW bracedArrowTemplateSpec;
bracedThinArrow:
predicateExpression THINARROW optionallyInvoked;
bracedArrowTemplateSpec:
optionallyInvoked COMMA optionallyInvoked
| optionallyInvoked;
methodable:
QUOTE TEXT? QUOTE # quoteLiteral
| APOSTROPHE TEXT* APOSTROPHE # apostropheLiteral
| templateSpec # methodableTemplateSpec
| (IDENTIFIER | TEXT) (DOT (IDENTIFIER | TEXT))* # identifier;
methodInvocation: (method | DOT invokedTemplateSpec) arguments* RP;
method: METHODNAME;
arguments: argument (COMMA argument)*;
optionallyInvoked: (methodInvoked | methodable);
argument:
REGEX # regex
| optionallyInvoked # optionallyInvokedArgument
| predicateExpression # predicateArgument
| digits # digitsArgument;
namedSubtemplate: POUND IDENTIFIER;
|
gcc-gcc-7_3_0-release/gcc/ada/validsw.adb
|
best08618/asylo
| 7 |
17597
|
<reponame>best08618/asylo<filename>gcc-gcc-7_3_0-release/gcc/ada/validsw.adb<gh_stars>1-10
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- V A L I D S W --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2016, 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. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Opt; use Opt;
with Output; use Output;
package body Validsw is
----------------------------------
-- Reset_Validity_Check_Options --
----------------------------------
procedure Reset_Validity_Check_Options is
begin
Validity_Check_Components := False;
Validity_Check_Copies := False;
Validity_Check_Default := True;
Validity_Check_Floating_Point := False;
Validity_Check_In_Out_Params := False;
Validity_Check_In_Params := False;
Validity_Check_Operands := False;
Validity_Check_Returns := False;
Validity_Check_Subscripts := False;
Validity_Check_Tests := False;
end Reset_Validity_Check_Options;
---------------------------------
-- Save_Validity_Check_Options --
---------------------------------
procedure Save_Validity_Check_Options
(Options : out Validity_Check_Options)
is
P : Natural := 0;
procedure Add (C : Character; S : Boolean);
-- Add given character C to string if switch S is true
procedure Add (C : Character; S : Boolean) is
begin
if S then
P := P + 1;
Options (P) := C;
end if;
end Add;
-- Start of processing for Save_Validity_Check_Options
begin
for K in Options'Range loop
Options (K) := ' ';
end loop;
Add ('n', not Validity_Check_Default);
Add ('c', Validity_Check_Copies);
Add ('e', Validity_Check_Components);
Add ('f', Validity_Check_Floating_Point);
Add ('i', Validity_Check_In_Params);
Add ('m', Validity_Check_In_Out_Params);
Add ('o', Validity_Check_Operands);
Add ('r', Validity_Check_Returns);
Add ('s', Validity_Check_Subscripts);
Add ('t', Validity_Check_Tests);
end Save_Validity_Check_Options;
----------------------------------------
-- Set_Default_Validity_Check_Options --
----------------------------------------
procedure Set_Default_Validity_Check_Options is
begin
Reset_Validity_Check_Options;
Set_Validity_Check_Options ("d");
end Set_Default_Validity_Check_Options;
--------------------------------
-- Set_Validity_Check_Options --
--------------------------------
-- Version used when no error checking is required
procedure Set_Validity_Check_Options (Options : String) is
OK : Boolean;
EC : Natural;
pragma Warnings (Off, OK);
pragma Warnings (Off, EC);
begin
Set_Validity_Check_Options (Options, OK, EC);
end Set_Validity_Check_Options;
-- Normal version with error checking
procedure Set_Validity_Check_Options
(Options : String;
OK : out Boolean;
Err_Col : out Natural)
is
J : Natural;
C : Character;
begin
J := Options'First;
while J <= Options'Last loop
C := Options (J);
J := J + 1;
-- Turn on validity checking (gets turned off by Vn)
Validity_Checks_On := True;
case C is
when 'c' =>
Validity_Check_Copies := True;
when 'd' =>
Validity_Check_Default := True;
when 'e' =>
Validity_Check_Components := True;
when 'f' =>
Validity_Check_Floating_Point := True;
when 'i' =>
Validity_Check_In_Params := True;
when 'm' =>
Validity_Check_In_Out_Params := True;
when 'o' =>
Validity_Check_Operands := True;
when 'p' =>
Validity_Check_Parameters := True;
when 'r' =>
Validity_Check_Returns := True;
when 's' =>
Validity_Check_Subscripts := True;
when 't' =>
Validity_Check_Tests := True;
when 'C' =>
Validity_Check_Copies := False;
when 'D' =>
Validity_Check_Default := False;
when 'E' =>
Validity_Check_Components := False;
when 'F' =>
Validity_Check_Floating_Point := False;
when 'I' =>
Validity_Check_In_Params := False;
when 'M' =>
Validity_Check_In_Out_Params := False;
when 'O' =>
Validity_Check_Operands := False;
when 'P' =>
Validity_Check_Parameters := False;
when 'R' =>
Validity_Check_Returns := False;
when 'S' =>
Validity_Check_Subscripts := False;
when 'T' =>
Validity_Check_Tests := False;
when 'a' =>
Validity_Check_Components := True;
Validity_Check_Copies := True;
Validity_Check_Default := True;
Validity_Check_Floating_Point := True;
Validity_Check_In_Out_Params := True;
Validity_Check_In_Params := True;
Validity_Check_Operands := True;
Validity_Check_Parameters := True;
Validity_Check_Returns := True;
Validity_Check_Subscripts := True;
Validity_Check_Tests := True;
when 'n' =>
Validity_Check_Components := False;
Validity_Check_Copies := False;
Validity_Check_Default := False;
Validity_Check_Floating_Point := False;
Validity_Check_In_Out_Params := False;
Validity_Check_In_Params := False;
Validity_Check_Operands := False;
Validity_Check_Parameters := False;
Validity_Check_Returns := False;
Validity_Check_Subscripts := False;
Validity_Check_Tests := False;
Validity_Checks_On := False;
when ' ' =>
null;
when others =>
if Ignore_Unrecognized_VWY_Switches then
Write_Line ("unrecognized switch -gnatV" & C & " ignored");
else
OK := False;
Err_Col := J - 1;
return;
end if;
end case;
end loop;
OK := True;
Err_Col := Options'Last + 1;
end Set_Validity_Check_Options;
end Validsw;
|
libsrc/stdio_new/error/stdio_error_eacces_mc.asm
|
meesokim/z88dk
| 8 |
83003
|
<filename>libsrc/stdio_new/error/stdio_error_eacces_mc.asm
; stdio_error_eacces_mc
; 06.2008 aralbrec
PUBLIC stdio_error_eacces_mc
EXTERN stdio_errno_mc
INCLUDE "../stdio.def"
.stdio_error_eacces_mc
ld hl,EACCES
jp stdio_errno_mc
|
legend-engine-language-pure-grammar/src/main/antlr4/org/finos/legend/engine/language/pure/grammar/from/antlr4/runtime/RuntimeParserGrammar.g4
|
dave-wathen/legend-engine
| 32 |
1982
|
parser grammar RuntimeParserGrammar;
import CoreParserGrammar;
options
{
tokenVocab = RuntimeLexerGrammar;
}
// -------------------------------------- IDENTIFIER --------------------------------------
identifier: VALID_STRING | STRING
| RUNTIME | IMPORT
| MAPPINGS | CONNECTIONS
;
// -------------------------------------- DEFINITION --------------------------------------
definition: imports
(runtime)*
EOF
;
imports: (importStatement)*
;
importStatement: IMPORT packagePath PATH_SEPARATOR STAR SEMI_COLON
;
runtime: RUNTIME qualifiedName
BRACE_OPEN
(mappings | connections)*
BRACE_CLOSE
;
mappings: MAPPINGS COLON
BRACKET_OPEN
(qualifiedName (COMMA qualifiedName)*)?
BRACKET_CLOSE SEMI_COLON
;
connections: CONNECTIONS COLON
BRACKET_OPEN
(storeConnections (COMMA storeConnections)*)?
BRACKET_CLOSE SEMI_COLON
;
storeConnections: qualifiedName COLON
BRACKET_OPEN
(identifiedConnection (COMMA identifiedConnection)*)?
BRACKET_CLOSE
;
identifiedConnection: identifier COLON (connectionPointer | embeddedConnection)
;
connectionPointer: qualifiedName
;
embeddedConnection: ISLAND_OPEN (embeddedConnectionContent)*
;
embeddedConnectionContent: ISLAND_START | ISLAND_BRACE_OPEN | ISLAND_CONTENT | ISLAND_HASH | ISLAND_BRACE_CLOSE | ISLAND_END
;
// ---------------------------------- EMBEDDED RUNTIME ----------------------------------
embeddedRuntime: (mappings | connections)*
;
|
libsrc/_DEVELOPMENT/compress/zx7/c/sdcc_iy/dzx7_smart_rcs.asm
|
meesokim/z88dk
| 0 |
170085
|
; void dzx7_smart_rcs(void *src, void *dst)
SECTION code_compress_zx7
PUBLIC _dzx7_smart_rcs
EXTERN asm_dzx7_smart_rcs
_dzx7_smart_rcs:
pop af
pop hl
pop de
push de
push hl
push af
jp asm_dzx7_smart_rcs
|
experiments/test-suite/manual/m100/student.als
|
kaiyuanw/AlloyFLCore
| 1 |
4731
|
<gh_stars>1-10
pred test131 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->1 + Node1->2 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test131 for 3 expect 0
pred test163 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-1,3]
}}}}}
}
run test163 for 3 expect 0
pred test57 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test57 for 3 expect 0
pred test176 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1
link = Node0->Node0 + Node1->Node0
elem = Node0->3 + Node1->3
True = True0
False = False0
Boolean = True0 + False0
Count[List0,3,1]
}}}}}
}
run test176 for 3 expect 0
/** all n: Node | one n.link */
pred test11 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test11 for 3 expect 1
pred test197 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,1,True0]
}}}}}
}
run test197 for 3 expect 0
pred test160 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-1,0]
}}}}}
}
run test160 for 3 expect 1
/** Contains: kill student9 */
pred test190 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->1 + Node1->1 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,1,True0]
}}}}}
}
run test190 for 3 expect 1
pred test47 {
some disj List0: List {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
no header
no Node
no link
no elem
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}
}
run test47 for 3 expect 1
pred test95 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0 + Node1
link = Node0->Node1
elem = Node0->-1 + Node1->3
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test95 for 3 expect 1
pred test143 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->0 + Node1->0 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test143 for 3 expect 1
pred test227 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,1,True0]
}}}}}
}
run test227 for 3 expect 0
pred test104 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-3 + Node1->-3 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test104 for 3 expect 1
pred test142 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->-3 + Node1->-4 + Node2->-3
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test142 for 3 expect 1
pred test219 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->-4 + Node2->-3
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,2,True0]
}}}}}
}
run test219 for 3 expect 0
pred test180 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->1 + Node1->-1 + Node2->-2
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-1,2]
}}}}}
}
run test180 for 3 expect 0
pred test161 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->0 + Node2->-1
True = True0
False = False0
Boolean = True0 + False0
Count[List0,2,0]
}}}}}
}
run test161 for 3 expect 1
pred test108 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->1 + Node1->1 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test108 for 3 expect 1
pred test216 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-2 + Node1->-2 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,3,True0]
}}}}}
}
run test216 for 3 expect 0
pred test55 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node2->Node0
elem = Node0->-3 + Node1->-4 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test55 for 3 expect 0
/** Count: kill student18 */
pred test157 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Count[List0,3,3]
}}}}}
}
run test157 for 3 expect 1
pred test175 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-4 + Node1->-4 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-4,1]
}}}}}
}
run test175 for 3 expect 0
pred test52 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test52 for 3 expect 1
pred test221 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,2,True0]
}}}}}
}
run test221 for 3 expect 1
pred test125 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0 + Node1
link = Node0->Node1
elem = Node0->1 + Node1->1
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test125 for 3 expect 1
pred test123 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->1 + Node1->1 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test123 for 3 expect 1
/** Contains: kill student19 */
pred test220 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,2,True0]
}}}}}
}
run test220 for 3 expect 1
pred test193 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->1 + Node1->1 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,3,True0]
}}}}}
}
run test193 for 3 expect 0
pred test141 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-1 + Node1->-1 + Node2->-2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test141 for 3 expect 1
pred test107 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->-4 + Node1->-4 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test107 for 3 expect 1
pred test138 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->-2 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test138 for 3 expect 0
pred test168 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Count[List0,2,1]
}}}}}
}
run test168 for 3 expect 0
pred test153 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-2 + Node1->-2 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-4,0]
}}}}}
}
run test153 for 3 expect 0
pred test225 {
some disj List0: List {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
no header
no Node
no link
no elem
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,2,True0]
}}}}
}
run test225 for 3 expect 0
pred test79 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test79 for 3 expect 0
pred test99 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0 + Node2->Node1
elem = Node0->-2 + Node1->-4 + Node2->-2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test99 for 3 expect 0
pred test102 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->-4 + Node1->-2 + Node2->-3
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test102 for 3 expect 0
pred test9 {
some disj List0: List {some disj Node0: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0
no link
elem = Node0->2
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test9 for 3 expect 1
pred test150 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Count[List0,3,2]
}}}}}
}
run test150 for 3 expect 1
pred test204 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-3 + Node1->-3 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,-4,True0]
}}}}}
}
run test204 for 3 expect 1
pred test149 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Count[List0,1,0]
}}}}}
}
run test149 for 3 expect 1
pred test76 {
some disj List0: List {some disj Node0: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0
no link
elem = Node0->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test76 for 3 expect 0
pred test124 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0 + Node1
link = Node0->Node1
elem = Node0->-4 + Node1->2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test124 for 3 expect 1
pred test53 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->1 + Node1->-2 + Node2->-3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test53 for 3 expect 1
pred test50 {
some disj List0: List {some disj Node0: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0
no link
elem = Node0->-4
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test50 for 3 expect 0
pred test145 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-1 + Node1->-1 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test145 for 3 expect 0
/** Sorted: kill student 0, 2, 4, 5, 6, 10, 14, 15, 17, 19 */
pred test82 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node0 + Node1->Node0 + Node2->Node1
elem = Node0->3 + Node1->1 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test82 for 3 expect 1
pred test12 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test12 for 3 expect 1
pred test31 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0 + Node2->Node2
elem = Node0->-4 + Node0->0 + Node1->-3 + Node1->-2 + Node1->-1 + Node1->1 + Node1->2 + Node1->3 + Node2->-4 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test31 for 3 expect 0
/** Loop: kill student18 */
pred test73 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->-1 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test73 for 3 expect 1
pred test165 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Count[List0,0,3]
}}}}}
}
run test165 for 3 expect 0
pred test201 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,-4,False0]
}}}}}
}
run test201 for 3 expect 1
pred test59 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1
link = Node0->Node1 + Node1->Node0
elem = Node0->-1 + Node1->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test59 for 3 expect 0
pred test182 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,2,True0]
}}}}}
}
run test182 for 3 expect 1
pred test159 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Count[List0,2,3]
}}}}}
}
run test159 for 3 expect 1
pred test178 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-4,2]
}}}}}
}
run test178 for 3 expect 0
pred test54 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node2->Node0
elem = Node0->2 + Node1->-4 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test54 for 3 expect 0
/** Count: kill student16 */
pred test148 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node0 + Node1->Node0 + Node2->Node1
elem = Node0->0 + Node1->-4 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Count[List0,3,0]
}}}}}
}
run test148 for 3 expect 1
pred test188 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1
link = Node0->Node0 + Node1->Node0
elem = Node0->0 + Node1->2
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,-3,False0]
}}}}}
}
run test188 for 3 expect 0
/** Sorted: kill student11 */
pred test112 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node0 + Node1->Node0 + Node2->Node1
elem = Node0->3 + Node1->1 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test112 for 3 expect 1
pred test80 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1
link = Node1->Node0
elem = Node0->2 + Node1->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test80 for 3 expect 0
pred test27 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0 + Node2->Node0
elem = Node0->-1 + Node1->-2
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test27 for 3 expect 0
pred test151 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->0 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Count[List0,2,2]
}}}}}
}
run test151 for 3 expect 0
pred test94 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->3 + Node1->-3 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test94 for 3 expect 1
pred test212 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-1 + Node1->-1 + Node2->-2
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,1,False0]
}}}}}
}
run test212 for 3 expect 1
pred test218 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->-2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,2,True0]
}}}}}
}
run test218 for 3 expect 0
pred test3 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test3 for 3 expect 1
pred test85 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->0 + Node1->-2 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test85 for 3 expect 1
/** Loop: kill student3 */
pred test32 {
some disj List0: List {some disj Node0: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0
link = Node0->Node0
elem = Node0->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test32 for 3 expect 1
pred test67 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->-1 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test67 for 3 expect 1
pred test214 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->0 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,-1,True0]
}}}}}
}
run test214 for 3 expect 0
pred test45 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test45 for 3 expect 1
pred test46 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test46 for 3 expect 1
/** Sorted: kill student12 */
pred test121 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node0 + Node2->Node1
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test121 for 3 expect 1
pred test24 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test24 for 3 expect 1
pred test192 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->0 + Node2->-2
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,0,True0]
}}}}}
}
run test192 for 3 expect 1
pred test137 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node1->Node2 + Node2->Node0
elem = Node0->0 + Node1->-4 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test137 for 3 expect 0
/** Loop: kill student16 */
pred test60 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-3 + Node1->-4 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test60 for 3 expect 1
pred test75 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->-2 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test75 for 3 expect 1
pred test118 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-1 + Node1->-1 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test118 for 3 expect 0
pred test70 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0 + Node2->Node1
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test70 for 3 expect 0
pred test84 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-2 + Node1->-2 + Node2->-4
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test84 for 3 expect 1
pred test38 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test38 for 3 expect 0
pred test200 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-1 + Node1->-1 + Node2->-2
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,0,False0]
}}}}}
}
run test200 for 3 expect 1
/** all n: Node | lone n.elem */
pred test26 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node1->2
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test26 for 3 expect 0
/** Contains: kill student12 */
pred test199 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->0 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,-1,False0]
}}}}}
}
run test199 for 3 expect 1
pred test202 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node0 + Node1->Node0 + Node2->Node1
elem = Node0->3 + Node1->2 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,0,True0]
}}}}}
}
run test202 for 3 expect 1
pred test64 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->-2 + Node1->-3 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test64 for 3 expect 0
/** some n: Node | #{n.link} > 1 */
pred test17 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node0 + Node0->Node2 + Node2->Node0 + Node2->Node1
elem = Node0->3 + Node1->-4 + Node2->-3
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test17 for 3 expect 0
pred test167 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->-1
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-1,2]
}}}}}
}
run test167 for 3 expect 0
pred test71 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->-2 + Node1->-3 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test71 for 3 expect 0
pred test164 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->0 + Node1->0 + Node2->-1
True = True0
False = False0
Boolean = True0 + False0
Count[List0,2,3]
}}}}}
}
run test164 for 3 expect 0
pred test61 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->3 + Node1->3 + Node2->2
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test61 for 3 expect 1
pred test162 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->2 + Node1->2 + Node2->1
True = True0
False = False0
Boolean = True0 + False0
Count[List0,0,0]
}}}}}
}
run test162 for 3 expect 1
pred test217 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node2 + Node2->Node0
elem = Node0->3 + Node1->2 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Contains[List0,-1,False0]
}}}}}
}
run test217 for 3 expect 0
pred test126 {
some disj List0: List {some disj Node0, Node1: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0 + Node1
link = Node0->Node1
elem = Node0->2 + Node1->2
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test126 for 3 expect 1
pred test170 {
some disj List0: List {some disj Node0: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node0
Node = Node0
link = Node0->Node0
elem = Node0->-1
True = True0
False = False0
Boolean = True0 + False0
Count[List0,-1,1]
}}}}}
}
run test170 for 3 expect 1
/** all l: List | no l.header */
pred test1 {
some disj List0: List {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
no header
no Node
no link
no elem
True = True0
False = False0
Boolean = True0 + False0
}}}}
}
run test1 for 3 expect 1
pred test88 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node1->Node1 + Node2->Node0
elem = Node0->-1 + Node1->-1 + Node2->0
True = True0
False = False0
Boolean = True0 + False0
Sorted[List0]
}}}}}
}
run test88 for 3 expect 0
pred test41 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node2
Node = Node0 + Node1 + Node2
link = Node0->Node1 + Node2->Node0
elem = Node0->1 + Node1->0 + Node2->3
True = True0
False = False0
Boolean = True0 + False0
Loop[List0]
}}}}}
}
run test41 for 3 expect 0
pred test28 {
some disj List0: List {some disj Node0, Node1, Node2: Node {some disj True0: True {some disj False0: False {some disj True0, False0: Boolean {
List = List0
header = List0->Node1
Node = Node0 + Node1 + Node2
link = Node0->Node2 + Node1->Node0
elem = Node0->3 + Node1->2
True = True0
False = False0
Boolean = True0 + False0
}}}}}
}
run test28 for 3 expect 0
|
oeis/097/A097252.asm
|
neoneye/loda-programs
| 11 |
6837
|
<filename>oeis/097/A097252.asm<gh_stars>10-100
; A097252: Numbers whose set of base 6 digits is {0,5}.
; Submitted by <NAME>
; 0,5,30,35,180,185,210,215,1080,1085,1110,1115,1260,1265,1290,1295,6480,6485,6510,6515,6660,6665,6690,6695,7560,7565,7590,7595,7740,7745,7770,7775,38880,38885,38910,38915,39060,39065,39090,39095,39960,39965,39990,39995,40140,40145,40170,40175,45360,45365,45390,45395,45540,45545,45570,45575,46440,46445,46470,46475,46620,46625,46650,46655,233280,233285,233310,233315,233460,233465,233490,233495,234360,234365,234390,234395,234540,234545,234570,234575,239760,239765,239790,239795,239940,239945,239970
mov $2,5
lpb $0
mov $3,$0
div $0,2
mod $3,2
mul $3,$2
add $1,$3
mul $2,6
lpe
mov $0,$1
|
Transynther/x86/_processed/AVXALIGN/_st_/i7-7700_9_0x48.log_21829_1602.asm
|
ljhsiun2/medusa
| 9 |
13527
|
<reponame>ljhsiun2/medusa<gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r13
push %r15
push %rax
push %rbx
push %rdx
push %rsi
lea addresses_UC_ht+0x2142, %r15
clflush (%r15)
nop
nop
add %rbx, %rbx
movb $0x61, (%r15)
nop
nop
sub $44005, %rdx
lea addresses_UC_ht+0x726, %rsi
and $10104, %r13
movw $0x6162, (%rsi)
nop
nop
nop
nop
nop
xor %rax, %rax
lea addresses_WC_ht+0x6aa2, %rax
nop
nop
nop
nop
nop
and %r15, %r15
mov $0x6162636465666768, %rsi
movq %rsi, (%rax)
add %rdx, %rdx
lea addresses_UC_ht+0x7b52, %rsi
nop
nop
and $14591, %rax
movb (%rsi), %bl
nop
nop
nop
nop
cmp $26914, %r13
pop %rsi
pop %rdx
pop %rbx
pop %rax
pop %r15
pop %r13
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r13
push %r8
push %rax
push %rbp
push %rcx
push %rdi
// Store
mov $0x5fd7320000000a72, %r13
nop
nop
nop
nop
nop
add %r8, %r8
movw $0x5152, (%r13)
nop
nop
add $5166, %r11
// Faulty Load
lea addresses_RW+0x6672, %rcx
nop
nop
nop
nop
nop
add $15488, %rbp
mov (%rcx), %rdi
lea oracles, %rbp
and $0xff, %rdi
shlq $12, %rdi
mov (%rbp,%rdi,1), %rdi
pop %rdi
pop %rcx
pop %rbp
pop %rax
pop %r8
pop %r13
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_RW', 'AVXalign': False, 'congruent': 0, 'size': 16, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_NC', 'AVXalign': False, 'congruent': 6, 'size': 2, 'same': False, 'NT': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_RW', 'AVXalign': False, 'congruent': 0, 'size': 8, 'same': True, 'NT': True}}
<gen_prepare_buffer>
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'AVXalign': True, 'congruent': 4, 'size': 1, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'AVXalign': False, 'congruent': 2, 'size': 2, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_WC_ht', 'AVXalign': False, 'congruent': 4, 'size': 8, 'same': False, 'NT': True}}
{'OP': 'LOAD', 'src': {'type': 'addresses_UC_ht', 'AVXalign': False, 'congruent': 4, 'size': 1, 'same': False, 'NT': False}}
{'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
*/
|
test-suite/programs/unit/jz_0x12.asm
|
ocus/TinyASM_Haskell
| 0 |
100247
|
<gh_stars>0
MOV [0] 0
MOV [1] 25
JZ 12 [0]
DPRINT 66
HALT
JZ 18 [1]
DPRINT 44
HALT
DPRINT 22
HALT
|
Library/Mailbox/Main/mainLibrary.asm
|
steakknife/pcgeos
| 504 |
166386
|
<filename>Library/Mailbox/Main/mainLibrary.asm
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) GeoWorks 1994 -- All Rights Reserved
PROJECT:
MODULE:
FILE: mainLibrary.asm
AUTHOR: <NAME>, Oct 6, 1994
ROUTINES:
Name Description
---- -----------
REVISION HISTORY:
Name Date Description
---- ---- -----------
Adam 10/ 6/94 Initial revision
DESCRIPTION:
Library-entry routine.
$Id: mainLibrary.asm,v 1.1 97/04/05 01:21:56 newdeal Exp $
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
Resident segment resource
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
MailboxLibraryEntry
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
SYNOPSIS: Entry routine to make sure we're being loaded as an
application and refuse to load otherwise.
CALLED BY: (GLOBAL) kernel
PASS: di = LibraryCallType
if LCT_ATTACH:
^hdx = AppLaunchBlock, if any (0 if none, under 2.2)
RETURN: carry set if unhappy
DESTROYED: nothing
SIDE EFFECTS:
PSEUDO CODE/STRATEGY:
REVISION HISTORY:
Name Date Description
---- ---- -----------
ardeb 10/ 6/94 Initial version
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@
MailboxLibraryEntry proc far
uses ds, ax, bx
.enter
segmov ds, dgroup, ax
cmp di, LCT_ATTACH
jne checkClientThread
tst_clc dx ; any ALB passed?
jnz done ; yes -- happy
WARNING YOU_NEED_TO_ADD_NO_MAILBOX_EQUAL_FALSE_TO_THE_UI_CATEGORY_SO_THE_MAILBOX_LIBRARY_GETS_LOADED_AS_AN_APPLICATION
stc ; no -- refuse to load
done:
.leave
ret
checkClientThread:
;
; When OutboxFix and OutboxFix check the integrity of messages on
; startup, they need to load and unload the data driver for each
; message. Since data driver (running on mailbox:0 in this case)
; uses Mailbox lib, the system calls us with LCT_NEW_CLIENT_THREAD /
; LCT_CLIENT_THREAD_EXIT, which would normally cause us to
; force-queue MSG_MA_HAVE_CLIENTS_AGAIN / MSG_MA_CLIENTS_ALL_GONE to
; the app object (also running on mailbox:0). If there are too many
; messages in outbox / inbox, we will run out of handles because of
; too many events accumulated on mailbox:0.
;
; To avoid such a problem, we ignore LCT_NEW_CLIENT_THREAD /
; LCT_CLIENT_THREAD_EXIT if the current thread is mailbox:0. And
; just for convenience, we ignore all other mailbox threads as well.
; All mailbox threads are handled by the detach sequence, and there's
; no need for the mainClientThreads hack to handle them.
;
call GeodeGetProcessHandle ; bx = thread owner
cmp bx, handle 0
je done_clc
cmp di, LCT_NEW_CLIENT_THREAD
jne checkThreadExit
inc ds:[mainClientThreads]
cmp ds:[mainClientThreads], 1
jne done
mov ax, MSG_MA_HAVE_CLIENTS_AGAIN
jmp tellApp
checkThreadExit:
cmp di, LCT_CLIENT_THREAD_EXIT
jne done_clc
Assert ne, ds:[mainClientThreads], 0
dec ds:[mainClientThreads]
jnz done_clc
mov ax, MSG_MA_CLIENTS_ALL_GONE
tellApp:
clr di
call UtilForceQueueMailboxApp
done_clc:
clc
jmp done
MailboxLibraryEntry endp
public MailboxLibraryEntry
Resident ends
|
cohomology/LongExactSequence.agda
|
UlrikBuchholtz/HoTT-Agda
| 1 |
10444
|
{-# OPTIONS --without-K #-}
open import HoTT
open import cohomology.Exactness
open import cohomology.FunctionOver
open import cohomology.Theory
open import cohomology.CofiberSequence
module cohomology.LongExactSequence {i} (CT : CohomologyTheory i)
{X Y : Ptd i} (n : ℤ) (f : fst (X ⊙→ Y)) where
open CohomologyTheory CT
open import cohomology.Functor CT
open import cohomology.BaseIndependence CT
co∂ : C n X →ᴳ C (succ n) (⊙Cof f)
co∂ = CF-hom (succ n) ⊙ext-glue ∘ᴳ fst ((C-Susp n X)⁻¹ᴳ)
long-cofiber-seq : HomSequence _ _
long-cofiber-seq =
C n Y ⟨ CF-hom n f ⟩→
C n X ⟨ co∂ ⟩→
C (succ n) (⊙Cof f) ⟨ CF-hom (succ n) (⊙cfcod f) ⟩→
C (succ n) Y ⟨ CF-hom (succ n) f ⟩→
C (succ n) X ⊣|
long-cofiber-exact : is-exact-seq long-cofiber-seq
long-cofiber-exact =
{- apply the suspension isomorphism -}
transport
(λ {(r , s) → is-exact-seq s})
(pair= _ $ sequence= _ _ $
group-ua (C-Susp n Y)
∥⟨ C-Susp-↓ n f ⟩∥
group-ua (C-Susp n X)
∥⟨ ↓-over-×-in _→ᴳ_
(domain-over-iso
(λ= (! ∘ ap (GroupHom.f (CF-hom _ ⊙ext-glue))
∘ is-equiv.g-f (snd (C-Susp n X)))
◃ domain-over-equiv _ _))
idp ⟩∥
idp ∥⟨ idp ⟩∥
idp ∥⟨ idp ⟩∥
idp ∥⊣|)
{- fix the function basepoints -}
(transport
(λ {(φ , ψ) → is-exact-seq $
_ ⟨ φ ⟩→ _ ⟨ ψ ⟩→
_ ⟨ CF-hom (succ n) (⊙cfcod f) ⟩→ _ ⟨ CF-hom (succ n) f ⟩→ _ ⊣|})
(pair×= (CF-base-indep (succ n) _ _ _)
(CF-base-indep (succ n) _ _ _))
{- do the CofiberSequence transport -}
(transport {A = Σ _ (λ {((U , V) , g , h) →
(g (cfbase _) == snd U) × (h (snd U) == snd V)})}
(λ {((_ , g , h) , (p , q)) → is-exact-seq $
_ ⟨ CF-hom (succ n) (h , q) ⟩→ _ ⟨ CF-hom (succ n) (g , p) ⟩→
_ ⟨ CF-hom (succ n) (⊙cfcod f) ⟩→ _ ⟨ CF-hom (succ n) f ⟩→ _ ⊣|})
(pair= (cofiber-sequence f)
(↓-×-in (from-transp _ _ idp) (from-transp _ _ idp)))
(exact-build
(_ ⟨ CF-hom (succ n) (⊙cfcod³ f) ⟩→ _ ⟨ CF-hom (succ n) (⊙cfcod² f) ⟩→
_ ⟨ CF-hom (succ n) (⊙cfcod f) ⟩→ _ ⟨ CF-hom (succ n) f ⟩→ _ ⊣|)
(C-exact (succ n) (⊙cfcod² f))
(C-exact (succ n) (⊙cfcod f)) (C-exact (succ n) f))))
|
libsrc/target/gal/stdio/scrollup_MODE1.asm
|
dikdom/z88dk
| 0 |
25714
|
<filename>libsrc/target/gal/stdio/scrollup_MODE1.asm
MODULE scrollup_MODE1
PUBLIC scrollup_MODE1
EXTERN generic_console_printc
EXTERN __console_w
scrollup_MODE1:
ld hl,($2a6a)
ld bc,$20
add hl,bc
ld d,h
ld e,l
ex de,hl
inc h
ld bc,32 * 200
ldir
ld bc,(__console_w)
dec b
ld a,c ;console_w
ld c,0
clear_last_row:
push af
push bc
ld a,32
ld d,a
ld e,0
call generic_console_printc
pop bc
inc c
pop af
dec a
jr nz,clear_last_row
pop bc
pop de
ret
|
source/oasis/program-elements-record_aggregates.ads
|
optikos/oasis
| 0 |
9077
|
<filename>source/oasis/program-elements-record_aggregates.ads
-- Copyright (c) 2019 <NAME> <<EMAIL>>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
with Program.Elements.Record_Component_Associations;
package Program.Elements.Record_Aggregates is
pragma Pure (Program.Elements.Record_Aggregates);
type Record_Aggregate is
limited interface and Program.Elements.Expressions.Expression;
type Record_Aggregate_Access is access all Record_Aggregate'Class
with Storage_Size => 0;
not overriding function Components
(Self : Record_Aggregate)
return Program.Elements.Record_Component_Associations
.Record_Component_Association_Vector_Access is abstract;
type Record_Aggregate_Text is limited interface;
type Record_Aggregate_Text_Access is access all Record_Aggregate_Text'Class
with Storage_Size => 0;
not overriding function To_Record_Aggregate_Text
(Self : aliased in out Record_Aggregate)
return Record_Aggregate_Text_Access is abstract;
not overriding function Left_Bracket_Token
(Self : Record_Aggregate_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Right_Bracket_Token
(Self : Record_Aggregate_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Record_Aggregates;
|
theorems/homotopy/blakersmassey/Pushout.agda
|
timjb/HoTT-Agda
| 294 |
4277
|
{-# OPTIONS --without-K --rewriting #-}
open import HoTT
-- custom pushout for Blakers-Massey
module homotopy.blakersmassey.Pushout {i j k}
{A : Type i} {B : Type j} (Q : A → B → Type k) where
bmspan : Span {i} {j} {lmax i (lmax j k)}
bmspan = span A B (Σ A λ a → Σ B λ b → Q a b) fst (fst ∘ snd)
BMPushout : Type (lmax i (lmax j k))
BMPushout = Pushout bmspan
bmleft : A → BMPushout
bmleft = left
bmright : B → BMPushout
bmright = right
bmglue : ∀ {a b} → Q a b → bmleft a == bmright b
bmglue {a} {b} q = glue (a , b , q)
module BMPushoutElim {l} {P : BMPushout → Type l}
(bmleft* : (a : A) → P (bmleft a)) (bmright* : (b : B) → P (bmright b))
(bmglue* : ∀ {a b} (q : Q a b) → bmleft* a == bmright* b [ P ↓ bmglue q ]) where
private
module P = PushoutElim {d = bmspan} {P = P}
bmleft* bmright* (λ c → bmglue* (snd (snd c)))
f = P.f
glue-β : ∀ {a b} (q : Q a b) → apd f (bmglue q) == bmglue* q
glue-β q = P.glue-β (_ , _ , q)
BMPushout-elim = BMPushoutElim.f
module BMPushoutRec {l} {D : Type l}
(bmleft* : A → D) (bmright* : B → D)
(bmglue* : ∀ {a b} (q : Q a b) → bmleft* a == bmright* b) where
private
module P = PushoutRec {d = bmspan} {D = D}
bmleft* bmright* (λ c → bmglue* (snd (snd c)))
f = P.f
glue-β : ∀ {a b} (q : Q a b) → ap f (bmglue q) == bmglue* q
glue-β q = P.glue-β (_ , _ , q)
|
runtime/linux64/linux64.asm
|
pedroreissantos/compact
| 4 |
15807
|
<reponame>pedroreissantos/compact
section .bss
$buf2 resb 2
section .text
global _prints, _readb, _exit, _start
extern _env, _strlen, _main
_prints:
push qword [rsp+8] ; pushd 'prints' first argument
call _strlen
mov rdx, rax ; strlen
pop rsi ; string
mov edi, 1 ; stdout
mov eax, 1 ; SYS_write
syscall
ret
_readb:
push rdi
push rsi
push rdx
push rcx
mov edx, 1 ; bytes
mov rsi, $buf2 ; buffer
mov edi, 0 ; stdin
mov eax, 0 ; SYS_read
syscall
cmp rax, 1
jne .Lret
xor rax, rax
mov al, [$buf2]
.Lret: pop rcx
pop rdx
pop rsi
pop rdi
ret
_start:
mov [$_env], rsp
mov rdi, [rsp] ; argc
lea rsi, [rsp+8] ; argv
lea rdx, [rsi+rdi*8]; &(argv[argc])
add rdx, 8 ; envp
push qword 0
mov rbp, rsp ; init frame pointer
push qword rdx
push qword rsi
push qword rdi
call _main
mov rdi, rax
push rax
call _exit
_exit: mov rbx, [rsp+8]
.L0: mov eax, 60
syscall
jmp .L0
|
src/libhello.adb
|
alire-project/libhello
| 1 |
12875
|
<gh_stars>1-10
with Ada.Text_IO;
package body libhello is
-----------------
-- Hello_World --
-----------------
procedure Hello_World is
use Ada.Text_IO;
begin
Put_Line ("Hello, world!");
end Hello_World;
end libhello;
|
os/src/entry.asm
|
yuoo655/c
| 2 |
80749
|
.section .text.entry
.globl _start
_start:
# a0: hart id
mv tp, a0
la sp, boot_stack
# li t1, 4096 * 16 # t1 = 4096 * 16 64KB
addi t0, a0, 1 # t0 = a0 + 1 hartid+1
slli t0, t0, 16 # 64K * (hartid + 1)
add sp, sp, t0 # sp = sp + t0
call rust_main
.section .bss.stack
.globl boot_stack
boot_stack:
.space 4096 * 16 * 4
.globl boot_stack_top
boot_stack_top:
|
test/Succeed/NoAbsurdClause.agda
|
shlevy/agda
| 1,989 |
12447
|
<filename>test/Succeed/NoAbsurdClause.agda
open import Agda.Builtin.Nat
data Fin : Nat → Set where
zero : {n : Nat} → Fin (suc n)
suc : {n : Nat} → Fin n → Fin (suc n)
f : Fin 1 → Nat
f zero = 0
|
4/4-1.asm
|
winderica/GoodbyeASM
| 0 |
99645
|
.386
print macro string
push ax
push dx
mov dx, offset string
mov ah, 09h
int 21h
pop dx
pop ax
endm
print_char macro char
push ax
push dx
mov ah, 02h
mov dl, char
int 21h
pop dx
pop ax
endm
print_newline macro
push ax
push dx
mov ah, 02h
mov dl, 13
int 21h
mov ah, 02h
mov dl, 10
int 21h
pop dx
pop ax
endm
stack segment use16 stack
db 500 dup(0)
stack ends
code segment use16
assume cs:code, ss:stack
start:
; address in TD:
; 0008:0070
; 1140:f000
; use the system call
mov ah, 35h
mov al, 01h
int 21h
mov ax, bx
call print_number
mov ax, es
call print_number
mov ah, 35h
mov al, 13h
int 21h
mov ax, bx
call print_number
mov ax, es
call print_number
; read directly
mov eax, fs:[4h]
call print_number
shr eax, 16
call print_number
mov eax, fs:[4ch]
call print_number
shr eax, 16
call print_number
mov ah, 4ch
int 21h
print_number proc
pusha
mov bx, 10
mov cx, 0
loop_divide_number:
mov dx, 0
div bx
add dl, '0'
push dx
inc cx
cmp ax, 0
jne loop_divide_number
loop_print_number:
pop dx
print_char dl
loop loop_print_number
print_newline
popa
ret
print_number endp
code ends
end start
|
src/cli.ads
|
psyomn/ash
| 11 |
24539
|
<filename>src/cli.ads
-- Copyright 2019 <NAME> (psyomn)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Listeners; use Listeners;
package CLI is
CLI_Argument_Exception : exception;
procedure Process_Command_Line_Arguments
(Conf : in out Listener);
private
procedure Apply_Port_Flag
(Conf : in out Listener;
Index : Positive)
with Inline;
procedure Apply_Root_Dir_Flag
(Conf : in out Listener;
Index : Positive)
with Inline;
procedure Apply_Host_Flag
(Conf : in out Listener;
Index : Positive)
with Inline;
end CLI;
|
F0.agda
|
JacquesCarette/pi-dual
| 14 |
15758
|
{-# OPTIONS --without-K #-}
module F0 where
import Level as L
open import Data.Unit
open import Data.Sum
open import Data.Product
open import Function using (id ; _$_ )
infixr 90 _⊗_
infixr 80 _⊕_
infixr 60 _∘_
infix 30 _⟷_
---------------------------------------------------------------------------
-- Our own version of refl that makes 'a' explicit
data _≡_ {u} {A : Set u} : (a b : A) → Set u where
refl : (a : A) → (a ≡ a)
-- if we have no occurrences of reciprocals then we can use plain sets; for
-- consistency with the rest of the story we will explicitly add refl paths
-- pi types with no reciprocals
data B : Set where
ONE : B
PLUS : B → B → B
TIMES : B → B → B
-- discrete groupoids
record 0-type : Set₁ where
constructor G₀
field
∣_∣ : Set
paths : {a : ∣_∣} → (a ≡ a)
paths {a} = refl a
open 0-type public
plus : 0-type → 0-type → 0-type
plus t₁ t₂ = G₀ (∣ t₁ ∣ ⊎ ∣ t₂ ∣)
times : 0-type → 0-type → 0-type
times t₁ t₂ = G₀ (∣ t₁ ∣ × ∣ t₂ ∣)
-- We interpret types as discrete groupoids
⟦_⟧ : B → 0-type
⟦ ONE ⟧ = G₀ ⊤
⟦ PLUS b₁ b₂ ⟧ = plus ⟦ b₁ ⟧ ⟦ b₂ ⟧
⟦ TIMES b₁ b₂ ⟧ = times ⟦ b₁ ⟧ ⟦ b₂ ⟧
-- isos
data _⟷_ : B → B → Set where
-- +
swap₊ : { b₁ b₂ : B } → PLUS b₁ b₂ ⟷ PLUS b₂ b₁
assocl₊ : { b₁ b₂ b₃ : B } → PLUS b₁ (PLUS b₂ b₃) ⟷ PLUS (PLUS b₁ b₂) b₃
assocr₊ : { b₁ b₂ b₃ : B } → PLUS (PLUS b₁ b₂) b₃ ⟷ PLUS b₁ (PLUS b₂ b₃)
-- *
unite⋆ : { b : B } → TIMES ONE b ⟷ b
uniti⋆ : { b : B } → b ⟷ TIMES ONE b
swap⋆ : { b₁ b₂ : B } → TIMES b₁ b₂ ⟷ TIMES b₂ b₁
assocl⋆ : { b₁ b₂ b₃ : B } → TIMES b₁ (TIMES b₂ b₃) ⟷ TIMES (TIMES b₁ b₂) b₃
assocr⋆ : { b₁ b₂ b₃ : B } → TIMES (TIMES b₁ b₂) b₃ ⟷ TIMES b₁ (TIMES b₂ b₃)
-- * distributes over +
dist : { b₁ b₂ b₃ : B } →
TIMES (PLUS b₁ b₂) b₃ ⟷ PLUS (TIMES b₁ b₃) (TIMES b₂ b₃)
factor : { b₁ b₂ b₃ : B } →
PLUS (TIMES b₁ b₃) (TIMES b₂ b₃) ⟷ TIMES (PLUS b₁ b₂) b₃
-- congruence
id⟷ : { b : B } → b ⟷ b
sym : { b₁ b₂ : B } → (b₁ ⟷ b₂) → (b₂ ⟷ b₁)
_∘_ : { b₁ b₂ b₃ : B } → (b₁ ⟷ b₂) → (b₂ ⟷ b₃) → (b₁ ⟷ b₃)
_⊕_ : { b₁ b₂ b₃ b₄ : B } →
(b₁ ⟷ b₃) → (b₂ ⟷ b₄) → (PLUS b₁ b₂ ⟷ PLUS b₃ b₄)
_⊗_ : { b₁ b₂ b₃ b₄ : B } →
(b₁ ⟷ b₃) → (b₂ ⟷ b₄) → (TIMES b₁ b₂ ⟷ TIMES b₃ b₄)
-- interpret isos as functors
record 0-functor (A B : 0-type) : Set where
constructor F₀
field
fobj : ∣ A ∣ → ∣ B ∣
fmor : {a b : ∣ A ∣} → (a ≡ b) → (fobj a ≡ fobj b)
fmor {a} {.a} (refl .a) = refl (fobj a)
open 0-functor public
swap⊎ : {A B : Set} → A ⊎ B → B ⊎ A
swap⊎ (inj₁ a) = inj₂ a
swap⊎ (inj₂ b) = inj₁ b
assocl⊎ : {A B C : Set} → A ⊎ (B ⊎ C) → (A ⊎ B) ⊎ C
assocl⊎ (inj₁ x) = inj₁ (inj₁ x)
assocl⊎ (inj₂ (inj₁ x)) = inj₁ (inj₂ x)
assocl⊎ (inj₂ (inj₂ y)) = inj₂ y
assocr⊎ : {A B C : Set} → (A ⊎ B) ⊎ C → A ⊎ (B ⊎ C)
assocr⊎ (inj₁ (inj₁ x)) = inj₁ x
assocr⊎ (inj₁ (inj₂ x)) = inj₂ (inj₁ x)
assocr⊎ (inj₂ y) = inj₂ (inj₂ y)
unite× : {A : Set} → ⊤ × A → A
unite× (tt , x) = x
uniti× : {A : Set} → A → ⊤ × A
uniti× x = (tt , x)
swap× : {A B : Set} → A × B → B × A
swap× (a , b) = (b , a)
assocl× : {A B C : Set} → A × (B × C) → (A × B) × C
assocl× (x , (y , z)) = (x , y) , z
assocr× : {A B C : Set} → (A × B) × C → A × (B × C)
assocr× ((x , y) , z) = x , (y , z)
dist×⊎ : {A B C : Set} → (A ⊎ B) × C → (A × C) ⊎ (B × C)
dist×⊎ (inj₁ a , c) = inj₁ (a , c)
dist×⊎ (inj₂ b , c) = inj₂ (b , c)
factor⊎× : {A B C : Set} → (A × C) ⊎ (B × C) → (A ⊎ B) × C
factor⊎× (inj₁ (a , c)) = (inj₁ a , c)
factor⊎× (inj₂ (b , c)) = (inj₂ b , c)
ev⊎ : {A B C D : Set} → (A → C) → (B → D) → A ⊎ B → C ⊎ D
ev⊎ f _ (inj₁ a) = inj₁ (f a)
ev⊎ _ g (inj₂ b) = inj₂ (g b)
ev× : {A B C D : Set} → (A → C) → (B → D) → A × B → C × D
ev× f g (a , b) = (f a , g b)
mutual
eval : {b₁ b₂ : B} → (b₁ ⟷ b₂) → 0-functor ⟦ b₁ ⟧ ⟦ b₂ ⟧
eval swap₊ = F₀ swap⊎
eval assocl₊ = F₀ assocl⊎
eval assocr₊ = F₀ assocr⊎
eval unite⋆ = F₀ unite×
eval uniti⋆ = F₀ uniti×
eval swap⋆ = F₀ swap×
eval assocl⋆ = F₀ assocl×
eval assocr⋆ = F₀ assocr×
eval dist = F₀ dist×⊎
eval factor = F₀ factor⊎×
eval id⟷ = F₀ id
eval (sym c) = evalB c
eval (c₁ ∘ c₂) = F₀ (λ x → fobj (eval c₂) (fobj (eval c₁) x))
eval (c₁ ⊕ c₂) = F₀ (ev⊎ (fobj $ eval c₁) (fobj $ eval c₂))
eval (c₁ ⊗ c₂) = F₀ (ev× (fobj $ eval c₁) (fobj $ eval c₂))
evalB : {b₁ b₂ : B} → (b₁ ⟷ b₂) → 0-functor ⟦ b₂ ⟧ ⟦ b₁ ⟧
evalB swap₊ = F₀ swap⊎
evalB assocl₊ = F₀ assocr⊎
evalB assocr₊ = F₀ assocl⊎
evalB unite⋆ = F₀ uniti×
evalB uniti⋆ = F₀ unite×
evalB swap⋆ = F₀ swap×
evalB assocl⋆ = F₀ assocr×
evalB assocr⋆ = F₀ assocl×
evalB dist = F₀ factor⊎×
evalB factor = F₀ dist×⊎
evalB id⟷ = F₀ id
evalB (sym c) = eval c
evalB (c₁ ∘ c₂) = F₀ (λ x → fobj (evalB c₁) (fobj (evalB c₂) x))
evalB (c₁ ⊕ c₂) = F₀ (ev⊎ (fobj $ evalB c₁) (fobj $ evalB c₂))
evalB (c₁ ⊗ c₂) = F₀ (ev× (fobj $ evalB c₁) (fobj $ evalB c₂))
---------------------------------------------------------------------------
|
library/02_functions_batch1/GetRawData4Read.asm
|
SamantazFox/dds140-reverse-engineering
| 1 |
15827
|
10001200: 83 7c 24 04 00 cmp DWORD PTR [esp+0x4],0x0
10001205: b8 10 10 01 10 mov eax,0x10011010
1000120a: 74 05 je 0x10001211
1000120c: b8 10 32 01 10 mov eax,0x10013210
10001211: c2 04 00 ret 0x4
10001214: cc int3
10001215: cc int3
10001216: cc int3
10001217: cc int3
10001218: cc int3
10001219: cc int3
1000121a: cc int3
1000121b: cc int3
1000121c: cc int3
1000121d: cc int3
1000121e: cc int3
1000121f: cc int3
|
SaveChromeTabsToMarkdown.scpt
|
tIsGoud/save-chrome-tabs-to-markdown
| 2 |
2574
|
/************************
Export Google Chrome tabs to a Markdown file
Version 1.0
April 26, 2020
Usage:
Run the script when Google Chrome is open.
Customization:
By default the new file is saved in "Documents".
Change the variable 'directory' to change the location.
Example `pathTo` variables: `desktop`, `documents folder`, `home folder`
Requirements:
- Google Chrome installed
- Destination directory should exist
Changelog:
1.00 by @tisgoud, first public version
************************/
// Declare the global variables
var title = ``
var text = ``
var directory = ``
var file = ``
// Get the Computer Name via the Standard Additions of the current app
currentApp = Application.currentApplication()
currentApp.includeStandardAdditions = true
// Get the variable values
title = shortDate(currentApp.currentDate(), true)+ `-chrome-tabs-` + currentApp.systemInfo().computerName
header = `Chrome tabs on ` + currentApp.systemInfo().computerName
directory = currentApp.pathTo(`documents folder`).toString()
file = `${directory}/${title}.md`
getBookmarks(header)
if (writeTextToFile(text, file, true)) {
currentApp.displayNotification(`All tabs have been saved to ${file}.`, {
withTitle: `ChromeTabsToMarkdown`})
}
function getBookmarks(headerLine) {
var window = {}, tab = {}
var numberOfWindows = 0, numberOfTabs = 0
var totalTabs = 0
var i,j
browser = Application('Google Chrome')
if (browser.running()) {
for (i = 0, numberOfWindows = browser.windows.length; i < numberOfWindows; i++) {
window = browser.windows[i]
for (j = 0, numberOfTabs = window.tabs.length; j < numberOfTabs; j++) {
tab = window.tabs[j]
// Convert title and URL to markdown, empty title is replaced by the URL
text += '\n- [' + (tab.title().length != 0 ? cleanString(tab.title()) : tab.url()) + ']' + '(' + tab.url() + ')'
}
totalTabs += numberOfTabs
// Add a line between the different windows
text += '\n\n---\n'
}
// Add a title and sub-titles with the date and number of windows and tabs.
text = '# ' + headerLine + '\n\n' + shortDate(currentApp.currentDate()) + ', ' + totalTabs + ' tabs in ' + numberOfWindows + ' windows\n' + text
}
else {
text = `no browser running`
}
}
function shortDate(date, yearFirst = false) {
var day = ``
var month = ``
var year = ``
day = date.getDate()
if (day < 10) {
day = `0` + day;
}
month = date.getMonth() + 1
if (month < 10) {
month = `0` + month;
}
year = date.getFullYear()
if (yearFirst) {
return year + `-` + month + `-` + day
}
else {
return day + `-` + month + `-` + year
}
}
function cleanString(input) {
var output = ``;
for (var i = 0; i < input.length; i++) {
if (input.charCodeAt(i) <= 127) {
output += input.charAt(i);
} else {
output += `&#` + input.charCodeAt(i) + `;`;
}
}
return output;
}
function writeTextToFile(text, file, overwriteExistingContent) {
try {
// Convert the file to a string
var fileString = file.toString()
// Open the file for writing
var openedFile = currentApp.openForAccess(Path(fileString), { writePermission: true })
// Clear the file if content should be overwritten
if (overwriteExistingContent) {
currentApp.setEof(openedFile, { to: 0 })
}
// Write the new content to the file
currentApp.write(text, { to: openedFile, startingAt: currentApp.getEof(openedFile) })
// Close the file
currentApp.closeAccess(openedFile)
// Send success notification
currentApp.displayNotification(`All tabs have been saved to ${file}.`, {
withTitle: `ChromeTabsToMarkdown`})
// Return a boolean indicating that writing was successful
return true
}
catch(error) {
try {
// Close the file
currentApp.closeAccess(file)
}
catch(error) {
// Report the error is closing failed
console.log(`Couldn't close file: ${error}`)
// Display an alert to the user with a probable cause
currentApp.displayAlert(`Error in ChromeTabsToMarkdown!`, {
message: `Please check for non-existing directories: \n${file}.`,
as: `critical`,
buttons: [`Oops`],
givingUpAfter: 10
})
}
// Return a boolean indicating that writing was successful
return false
}
}
|
src/autogenerated/textBank8.asm
|
jannone/westen
| 49 |
160632
|
<gh_stars>10-100
; line: 'the pass words. Vampires keep their names'
; size in bytes: 42
line_0:
db #29,#8e,#77,#71,#00,#86,#69,#8c,#8c,#00,#95,#84,#8a,#6f,#8c,#14
db #00,#5a,#69,#7f,#86,#79,#8a,#71,#8c,#00,#7c,#71,#71,#86,#00,#8e
db #77,#71,#79,#8a,#00,#82,#69,#7f,#71,#8c
end_line_0:
; line: 'other notes.'
; size in bytes: 13
line_1:
db #0c,#84,#8e,#77,#71,#8a,#00,#82,#84,#8e,#71,#8c,#14
end_line_1:
; line: 'Dear Ed,'
; size in bytes: 9
line_2:
db #08,#31,#71,#69,#8a,#00,#33,#6f,#10
end_line_2:
; line: 'We regret to inform you of the passing of Jonathan'
; size in bytes: 51
line_3:
db #32,#5d,#71,#00,#8a,#71,#75,#8a,#71,#8e,#00,#8e,#84,#00,#79,#82
db #73,#84,#8a,#7f,#00,#9b,#84,#90,#00,#84,#73,#00,#8e,#77,#71,#00
db #86,#69,#8c,#8c,#79,#82,#75,#00,#84,#73,#00,#3d,#84,#82,#69,#8e
db #77,#69,#82
end_line_3:
; line: 'half of the key you should already have.'
; size in bytes: 41
line_4:
db #28,#77,#69,#7e,#73,#00,#84,#73,#00,#8e,#77,#71,#00,#7c,#71,#9b
db #00,#9b,#84,#90,#00,#8c,#77,#84,#90,#7e,#6f,#00,#69,#7e,#8a,#71
db #69,#6f,#9b,#00,#77,#69,#92,#71,#14
end_line_4:
; line: 'We also inform you that Mrs <NAME> plans'
; size in bytes: 46
line_5:
db #2d,#5d,#71,#00,#69,#7e,#8c,#84,#00,#79,#82,#73,#84,#8a,#7f,#00
db #9b,#84,#90,#00,#8e,#77,#69,#8e,#00,#44,#8a,#8c,#00,#42,#90,#6d
db #9b,#00,#5d,#71,#8c,#8e,#71,#82,#00,#86,#7e,#69,#82,#8c
end_line_5:
; line: ' form her vampire name. Such an honor'
; size in bytes: 39
line_6:
db #26,#00,#00,#73,#84,#8a,#7f,#00,#77,#71,#8a,#00,#92,#69,#7f,#86
db #79,#8a,#71,#00,#82,#69,#7f,#71,#14,#00,#53,#90,#6d,#77,#00,#69
db #82,#00,#77,#84,#82,#84,#8a
end_line_6:
; line: 'Beta testing: <NAME>'
; size in bytes: 27
line_7:
db #1a,#2d,#71,#8e,#69,#00,#8e,#71,#8c,#8e,#79,#82,#75,#2a,#00,#3d
db #84,#8a,#6f,#79,#00,#53,#90,#8a,#71,#6f,#69
end_line_7:
; line: 'Dear Professor <NAME>'
; size in bytes: 29
line_8:
db #1c,#31,#71,#69,#8a,#00,#4c,#8a,#84,#73,#71,#8c,#8c,#84,#8a,#00
db #33,#6f,#95,#69,#8a,#6f,#00,#3f,#71,#7e,#92,#79,#82
end_line_8:
; line: 'Safe: 15-30-10'
; size in bytes: 15
line_9:
db #0e,#53,#69,#73,#71,#2a,#00,#17,#20,#12,#1b,#15,#12,#17,#15
end_line_9:
; line: 'What is this?! Was JW conducting'
; size in bytes: 33
line_10:
db #20,#5d,#77,#69,#8e,#00,#79,#8c,#00,#8e,#77,#79,#8c,#0d,#02,#00
db #5d,#69,#8c,#00,#3d,#5d,#00,#6d,#84,#82,#6f,#90,#6d,#8e,#79,#82
db #75
end_line_10:
; line: '<NAME> finally made me part of her inner'
; size in bytes: 43
line_11:
db #2a,#44,#8a,#8c,#00,#42,#90,#6d,#9b,#00,#73,#79,#82,#69,#7e,#7e
db #9b,#00,#7f,#69,#6f,#71,#00,#7f,#71,#00,#86,#69,#8a,#8e,#00,#84
db #73,#00,#77,#71,#8a,#00,#79,#82,#82,#71,#8a
end_line_11:
; line: 'Professor <NAME>'
; size in bytes: 24
line_12:
db #17,#4c,#8a,#84,#73,#71,#8c,#8c,#84,#8a,#00,#33,#6f,#95,#69,#8a
db #6f,#00,#3f,#71,#7e,#92,#79,#82
end_line_12:
; line: 'This is the diary of Lucy Westenra.'
; size in bytes: 36
line_13:
db #23,#55,#77,#79,#8c,#00,#79,#8c,#00,#8e,#77,#71,#00,#6f,#79,#69
db #8a,#9b,#00,#84,#73,#00,#42,#90,#6d,#9b,#00,#5d,#71,#8c,#8e,#71
db #82,#8a,#69,#14
end_line_13:
; line: 'My beloved finally converted me. This is'
; size in bytes: 41
line_14:
db #28,#44,#9b,#00,#6b,#71,#7e,#84,#92,#71,#6f,#00,#73,#79,#82,#69
db #7e,#7e,#9b,#00,#6d,#84,#82,#92,#71,#8a,#8e,#71,#6f,#00,#7f,#71
db #14,#00,#55,#77,#79,#8c,#00,#79,#8c
end_line_14:
|
oeis/139/A139635.asm
|
neoneye/loda-programs
| 11 |
100535
|
; A139635: Binomial transform of [1, 11, 11, 11,...].
; 1,12,34,78,166,342,694,1398,2806,5622,11254,22518,45046,90102,180214,360438,720886,1441782,2883574,5767158,11534326,23068662,46137334,92274678,184549366,369098742,738197494,1476394998,2952790006,5905580022,11811160054,23622320118,47244640246,94489280502,188978561014,377957122038,755914244086,1511828488182,3023656976374,6047313952758,12094627905526,24189255811062,48378511622134,96757023244278,193514046488566,387028092977142,774056185954294,1548112371908598,3096224743817206,6192449487634422
mov $1,2
pow $1,$0
mul $1,11
sub $1,10
mov $0,$1
|
Transynther/x86/_processed/US/_st_zr_un_/i9-9900K_12_0xa0.log_21829_1526.asm
|
ljhsiun2/medusa
| 9 |
174679
|
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r14
push %r15
push %r8
push %r9
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0xfc8e, %r12
clflush (%r12)
cmp %r15, %r15
mov (%r12), %ecx
nop
nop
nop
sub %r15, %r15
lea addresses_normal_ht+0x1821e, %r14
nop
nop
nop
nop
add %rbp, %rbp
movl $0x61626364, (%r14)
nop
and %r14, %r14
lea addresses_normal_ht+0x1494e, %r15
nop
xor %rbp, %rbp
mov (%r15), %r9w
nop
nop
nop
nop
nop
add %r9, %r9
lea addresses_normal_ht+0x40e, %r15
nop
nop
dec %r12
mov $0x6162636465666768, %r14
movq %r14, (%r15)
nop
nop
nop
nop
add $65217, %r12
lea addresses_D_ht+0xb92e, %r9
sub $50703, %rbp
mov (%r9), %r14d
nop
nop
add %rcx, %rcx
lea addresses_A_ht+0x14e, %r12
nop
sub $26187, %r8
mov $0x6162636465666768, %r14
movq %r14, %xmm7
movups %xmm7, (%r12)
nop
inc %r9
lea addresses_UC_ht+0x1414e, %rsi
lea addresses_WT_ht+0x84c6, %rdi
nop
nop
xor %r8, %r8
mov $19, %rcx
rep movsw
nop
nop
nop
sub %r15, %r15
lea addresses_UC_ht+0x194e, %r9
clflush (%r9)
nop
nop
nop
add $38776, %rcx
vmovups (%r9), %ymm3
vextracti128 $1, %ymm3, %xmm3
vpextrq $1, %xmm3, %r12
add $35533, %r12
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %r9
pop %r8
pop %r15
pop %r14
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r14
push %r15
push %r8
push %rdi
push %rdx
push %rsi
// Store
lea addresses_D+0xde0e, %r14
cmp $58512, %r15
mov $0x5152535455565758, %rdx
movq %rdx, %xmm2
vmovups %ymm2, (%r14)
nop
nop
nop
and %rsi, %rsi
// Store
lea addresses_WC+0x1fade, %r11
and $62022, %rdx
movb $0x51, (%r11)
nop
nop
xor $53817, %r14
// Store
mov $0xb9f, %rdx
nop
nop
nop
nop
add $57269, %rsi
mov $0x5152535455565758, %r14
movq %r14, %xmm1
vmovups %ymm1, (%rdx)
nop
nop
nop
nop
nop
xor $26920, %r15
// Store
lea addresses_US+0x4c7e, %rdi
nop
nop
nop
nop
and $65466, %r8
mov $0x5152535455565758, %rdx
movq %rdx, (%rdi)
nop
nop
nop
nop
cmp %rdx, %rdx
// Store
mov $0x316, %rdx
nop
nop
nop
nop
sub %r15, %r15
mov $0x5152535455565758, %r11
movq %r11, (%rdx)
xor $37221, %r15
// Store
lea addresses_US+0x1214e, %rsi
nop
nop
nop
nop
and $13697, %rdi
movw $0x5152, (%rsi)
nop
nop
nop
nop
nop
and $29431, %rsi
// Faulty Load
lea addresses_US+0x1214e, %r11
sub $33182, %r14
movups (%r11), %xmm1
vpextrq $1, %xmm1, %rdx
lea oracles, %rsi
and $0xff, %rdx
shlq $12, %rdx
mov (%rsi,%rdx,1), %rdx
pop %rsi
pop %rdx
pop %rdi
pop %r8
pop %r15
pop %r14
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'src': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_US', 'AVXalign': True, 'size': 16}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 5, 'type': 'addresses_D', 'AVXalign': False, 'size': 32}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 4, 'type': 'addresses_WC', 'AVXalign': False, 'size': 1}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 0, 'type': 'addresses_P', 'AVXalign': False, 'size': 32}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 3, 'type': 'addresses_US', 'AVXalign': False, 'size': 8}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 3, 'type': 'addresses_P', 'AVXalign': False, 'size': 8}}
{'OP': 'STOR', 'dst': {'NT': False, 'same': True, 'congruent': 0, 'type': 'addresses_US', 'AVXalign': False, 'size': 2}}
[Faulty Load]
{'src': {'NT': False, 'same': True, 'congruent': 0, 'type': 'addresses_US', 'AVXalign': False, 'size': 16}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'NT': False, 'same': True, 'congruent': 6, 'type': 'addresses_A_ht', 'AVXalign': True, 'size': 4}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 4, 'type': 'addresses_normal_ht', 'AVXalign': False, 'size': 4}}
{'src': {'NT': False, 'same': False, 'congruent': 9, 'type': 'addresses_normal_ht', 'AVXalign': False, 'size': 2}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 5, 'type': 'addresses_normal_ht', 'AVXalign': True, 'size': 8}}
{'src': {'NT': False, 'same': False, 'congruent': 5, 'type': 'addresses_D_ht', 'AVXalign': False, 'size': 4}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'NT': False, 'same': False, 'congruent': 11, 'type': 'addresses_A_ht', 'AVXalign': False, 'size': 16}}
{'src': {'same': False, 'congruent': 10, 'type': 'addresses_UC_ht'}, 'OP': 'REPM', 'dst': {'same': False, 'congruent': 3, 'type': 'addresses_WT_ht'}}
{'src': {'NT': False, 'same': False, 'congruent': 11, 'type': 'addresses_UC_ht', 'AVXalign': False, 'size': 32}, 'OP': 'LOAD'}
{'ff': 1, '10': 1, '33': 3, '00': 21824}
00 00 10 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
Transynther/x86/_processed/US/_zr_/i3-7100_9_0x84_notsx.log_55_1288.asm
|
ljhsiun2/medusa
| 9 |
576
|
<filename>Transynther/x86/_processed/US/_zr_/i3-7100_9_0x84_notsx.log_55_1288.asm<gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r15
push %r9
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_D_ht+0xfcd7, %r10
sub $12364, %rax
movl $0x61626364, (%r10)
nop
nop
dec %rcx
lea addresses_WT_ht+0x18a6f, %rbx
nop
nop
nop
nop
nop
add $61510, %r9
mov $0x6162636465666768, %r15
movq %r15, (%rbx)
sub $40865, %rax
lea addresses_D_ht+0x1c16f, %r9
sub %rbx, %rbx
movb (%r9), %cl
nop
nop
dec %rcx
lea addresses_WT_ht+0x14ef, %r15
clflush (%r15)
nop
cmp %rax, %rax
movb $0x61, (%r15)
nop
nop
inc %r9
lea addresses_normal_ht+0x8017, %rsi
lea addresses_A_ht+0x418f, %rdi
nop
nop
and %r10, %r10
mov $18, %rcx
rep movsq
nop
cmp %r10, %r10
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rax
pop %r9
pop %r15
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r13
push %r15
push %r8
push %rbp
push %rdi
push %rdx
// Faulty Load
lea addresses_US+0x153ef, %r15
nop
nop
nop
nop
sub %rbp, %rbp
mov (%r15), %r8d
lea oracles, %rdi
and $0xff, %r8
shlq $12, %r8
mov (%rdi,%r8,1), %r8
pop %rdx
pop %rdi
pop %rbp
pop %r8
pop %r15
pop %r13
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_US', 'same': False, 'size': 1, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'type': 'addresses_US', 'same': True, 'size': 4, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'dst': {'type': 'addresses_D_ht', 'same': False, 'size': 4, 'congruent': 3, 'NT': True, 'AVXalign': False}, 'OP': 'STOR'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 8, 'congruent': 6, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_D_ht', 'same': False, 'size': 1, 'congruent': 7, 'NT': False, 'AVXalign': True}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_WT_ht', 'same': False, 'size': 1, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_normal_ht', 'congruent': 2, 'same': False}, 'dst': {'type': 'addresses_A_ht', 'congruent': 5, 'same': False}, 'OP': 'REPM'}
{'00': 55}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
src/test/ref/condition-integer-3.asm
|
jbrandwood/kickc
| 2 |
169026
|
// Tests using integer conditions in ternary operator
// This should produce '++0++' at the top of the screen
// Commodore 64 PRG executable file
.file [name="condition-integer-3.prg", type="prg", segments="Program"]
.segmentdef Program [segments="Basic, Code, Data"]
.segmentdef Basic [start=$0801]
.segmentdef Code [start=$80d]
.segmentdef Data [startAfter="Code"]
.segment Basic
:BasicUpstart(main)
.label SCREEN = $400
.segment Code
main: {
ldx #0
ldy #-2
__b1:
// i?'+':'0'
cpy #0
bne __b2
lda #'0'
jmp __b3
__b2:
// i?'+':'0'
lda #'+'
__b3:
// SCREEN[idx++] = j
sta SCREEN,x
// SCREEN[idx++] = j;
inx
// for( signed byte i: -2..2)
iny
cpy #3
bne __b1
// }
rts
}
|
other.7z/SFC.7z/SFC/ソースデータ/MarioKart/Sub_sound.asm
|
prismotizm/gigaleak
| 0 |
93598
|
<reponame>prismotizm/gigaleak
Name: Sub_sound.asm
Type: file
Size: 15835
Last-Modified: '1992-07-01T15:00:00Z'
SHA-1: 2CD040F3D9878B731F4A4BF96432D807123934EB
Description: null
|
test/Succeed/fol-theorems/Issue15.agda
|
asr/apia
| 10 |
16308
|
<gh_stars>1-10
{-# OPTIONS --exact-split #-}
{-# OPTIONS --no-sized-types #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS --without-K #-}
module Issue15 where
infix 7 _≡_
infixr 5 _∧_
infix 5 ∃
infixr 4 _∨_
data _∨_ (A B : Set) : Set where
inj₁ : A → A ∨ B
inj₂ : B → A ∨ B
data _∧_ (A B : Set) : Set where
_,_ : A → B → A ∧ B
postulate
D : Set
_·_ : D → D → D
succ : D → D
zero : D
data ∃ (A : D → Set) : Set where
_,_ : (t : D) → A t → ∃ A
syntax ∃ (λ x → e) = ∃[ x ] e
data _≡_ (x : D) : D → Set where
refl : x ≡ x
postulate Conat : D → Set
postulate
Conat-out : ∀ {n} → Conat n → n ≡ zero ∨ (∃[ n' ] n ≡ succ n' ∧ Conat n')
{-# ATP axiom Conat-out #-}
postulate
Conat-coind :
(A : D → Set) →
-- A is post-fixed point of NatF.
(∀ {n} → A n → n ≡ zero ∨ (∃[ n' ] n ≡ succ n' ∧ A n')) →
-- Conat is greater than A.
∀ {n} → A n → Conat n
-- See Issue #81.
A : D → Set
A n = n ≡ zero ∨ (∃[ n' ] n ≡ succ n' ∧ Conat n')
{-# ATP definition A #-}
Conat-in : ∀ {n} →
n ≡ zero ∨ (∃[ n' ] n ≡ succ n' ∧ Conat n') →
Conat n
Conat-in h = Conat-coind A h' h
where
postulate h' : ∀ {n} → A n → n ≡ zero ∨ (∃[ n' ] n ≡ succ n' ∧ A n')
{-# ATP prove h' #-}
|
oeis/285/A285074.asm
|
neoneye/loda-programs
| 11 |
174697
|
; A285074: Positions of 0 in A285073; complement of A285075.
; Submitted by <NAME>
; 1,3,5,7,8,10,12,13,15,17,19,20,22,24,25,27,29,31,32,34,36,37,39,41,42,44,46,48,49,51,53,54,56,58,60,61,63,65,66,68,70,71,73,75,77,78,80,82,83,85,87,89,90,92,94,95,97,99,101,102,104,106,107,109,111,112,114,116,118,119,121,123,124,126,128,130,131,133,135,136,138,140,141,143,145,147,148,150,152,153,155,157,159,160,162,164,165,167,169,171
mov $2,$0
mov $3,$0
lpb $2
mov $0,$3
sub $2,1
sub $0,$2
mov $5,$0
mov $6,0
mov $7,2
lpb $7
mov $0,$5
sub $7,1
add $0,$7
trn $0,1
seq $0,99188 ; a(n) = 2*ceiling(n/sqrt(2)).
mov $8,$7
mul $8,$0
add $6,$8
lpe
min $5,1
mul $5,$0
mov $0,$6
sub $0,$5
div $0,2
add $0,1
add $4,$0
lpe
mov $0,$4
add $0,1
|
BigNum/Mod/Primes/bnRandom.asm
|
FloydZ/Crypto-Hash
| 11 |
171016
|
.686
.model flat,stdcall
option casemap:none
include windows.inc
include wincrypt.inc
include .\bnlib.inc
include .\bignum.inc
.code
bnRandom proc uses edi bn,nbit
LOCAL hProv,Result
xor eax,eax
mov ecx,nbit
mov edi,bn
shr ecx,5
mov Result,eax
.if ecx<=BN_MAX_DWORD
mov [edi].BN.dwSize,ecx
mov [edi].BN.bSigned,eax
invoke CryptGenRandom,BN_HPROV,addr[ecx*4],addr[edi].BN.dwArray
inc Result
.endif
mov eax,Result
ret
bnRandom endp
end
|
test/Succeed/Issue2302.agda
|
alhassy/agda
| 3 |
11596
|
<filename>test/Succeed/Issue2302.agda
{-# OPTIONS --rewriting #-}
open import Agda.Builtin.Equality
postulate
A : Set
x0 : A
f : A → A → A
{-# BUILTIN REWRITE _≡_ #-}
postulate
fxx : (x : A) → (f x x) ≡ x
{-# REWRITE fxx #-}
meta : A
meta-reveal : meta ≡ x0
test : f x0 meta ≡ x0
meta = _
test = refl
meta-reveal = refl
|
PP-Lab1/src/lab1.adb
|
JackShen1/parallel-programming
| 3 |
3326
|
------------------------------------------------------
--| Labwork #1 |
------------------------------------------------------
--| Author | Jack (Yevhenii) Shendrikov |
--| Group | IO-82 |
--| Variant | #25 |
--| Date | 06.09.2020 |
------------------------------------------------------
--| Function 1 | D = SORT(A)+SORT(B)+SORT(C)*(MA*ME) |
--| Function 2 | MF = (MG*MH)*TRANS(MK) |
--| Function 3 | S = (MO*MP)*V+t*MR*(O+P) |
------------------------------------------------------
with Data;
with Ada.Integer_Text_IO, Ada.Text_IO, Ada.Characters.Latin_1;
use Ada.Integer_Text_IO, Ada.Text_IO, Ada.Characters.Latin_1;
with System.Multiprocessors; use System.Multiprocessors;
procedure Lab1 is
N, val: Integer;
-- val -> a variable that determines what kind of input data will be sent for processing in each task for each function (Func1..3), for example, the input data can be random, all-ones or entered from the keyboard, it is selected by the user in the body of the main program .
procedure Tasks is
package My_Data is new Data(N);
use My_Data;
CPU_0: CPU_Range := 0;
CPU_1: CPU_Range := 1;
CPU_2: CPU_Range := 2;
task T1 is
pragma Task_Name("T1");
pragma Priority(4);
pragma Storage_Size(500000000);
pragma CPU (CPU_0);
end T1;
task T2 is
pragma Task_Name("T2");
pragma Priority(3);
pragma Storage_Size(500000000);
pragma CPU (CPU_1);
end T2;
task T3 is
pragma Task_Name("T3");
pragma Priority(7);
pragma Storage_Size(500000000);
pragma CPU (CPU_2);
end T3;
task body T1 is
A,B,C,D: Vector;
MA,ME: Matrix;
begin
Put_Line("Task T1 started");
delay 1.0;
Input_Val_F1(A,B,C,MA,ME,val);
D := Func1(A,B,C,MA,ME);
delay 2.0;
if N <= 10 then
Put("T1 | ");
Vector_Output(D, "D");
New_Line;
end if;
Put_Line("Task T1 finished");
New_Line;
end T1;
task body T2 is
MG,MH,MK,MF: Matrix;
begin
Put_Line("Task T2 started");
delay 4.0;
Input_Val_F2(MG,MH,MK,val);
MF := Func2(MG,MH,MK);
delay 5.0;
if N <= 10 then
Put_Line("T2 | ");
Matrix_Output(MF, "MF");
New_Line;
end if;
Put_Line("Task T2 finished");
New_Line;
end T2;
task body T3 is
t: Integer;
V,O,P,S: Vector;
MO,MP,MR: Matrix;
begin
Put_Line("Task T3 started");
delay(7.0);
Input_Val_F3(t,V,O,P,MO,MP,MR,val);
S := Func3(t,V,O,P,MO,MP,MR);
delay(5.0);
if N <= 10 then
Put("T3 | ");
Vector_Output(S, "S");
New_Line;
end if;
Put_Line("Task T3 finished");
New_Line;
end T3;
begin
Put_Line("Calculations started");
New_Line;
end Tasks;
begin
Put_Line("----------------------------------------------------" & CR & LF
& "| Function 1 | D = SORT(A)+SORT(B)+SORT(C)*(MA*ME) |" & CR & LF
& "| Function 2 | MF = (MG*MH)*TRANS(MK) |" & CR & LF
& "| Function 3 | S = (MO*MP)*V+t*MR*(O+P) |" & CR & LF
& "----------------------------------------------------" & CR & LF);
Put_Line("!!! Note that if the value of N > 10 -> the result will not be displayed !!!" & CR & LF
& "!!! If you enter N <= 0 - execution will be terminated !!!" & CR & LF
& "!!! Also note that the header may also be distorted if exe is running in GNAT Studio !!!" & CR & LF);
Put("Enter N: ");
Get(N);
if N <= 0 then
raise PROGRAM_ERROR with "Restart the program and enter N > 0.";
end if;
New_Line;
Put_Line("Select the method according to which the initial data will be generated:");
Put_Line(" [1] - Create All-Ones Matrices And Vectors.");
Put_Line(" [2] - Create Matrices And Vectors With Random Values.");
Put_Line(" [3] - Enter All Values From The Keyboard (The program works, but due to threads the input can be a little distorted).");
Put("Your choice [1] / [2] / [3]: ");
Get(val);
New_Line;
if N > 10 and val = 3 then
raise PROGRAM_ERROR with "If you want to enter a value from the keyboard - enter N <= 10.";
end if;
Tasks;
end Lab1;
|
programs/oeis/334/A334659.asm
|
neoneye/loda
| 22 |
98257
|
; A334659: Dirichlet g.f.: 1 / zeta(s-3).
; 1,-8,-27,0,-125,216,-343,0,0,1000,-1331,0,-2197,2744,3375,0,-4913,0,-6859,0,9261,10648,-12167,0,0,17576,0,0,-24389,-27000,-29791,0,35937,39304,42875,0,-50653,54872,59319,0,-68921,-74088,-79507,0,0,97336,-103823,0,0,0,132651,0,-148877
mov $1,$0
add $0,1
pow $0,3
seq $1,8683 ; Möbius (or Moebius) function mu(n). mu(1) = 1; mu(n) = (-1)^k if n is the product of k different primes; otherwise mu(n) = 0.
mul $0,$1
|
lib/chibiakumas/SrcALL/V1_HardwareTileArray.asm
|
gilbertfrancois/msx
| 0 |
99102
|
ifdef BuildGMB
include "..\SrcGB\GB_V1_HardwareTileArray.asm"
endif
ifdef BuildGBC
include "..\SrcGB\GB_V1_HardwareTileArray.asm"
endif
ifdef BuildSMS
include "..\SrcSMS\SMS_V1_HardwareTileArray.asm"
endif
ifdef BuildSGG
include "..\SrcSMS\SMS_V1_HardwareTileArray.asm"
endif
ifdef BuildMSX
ifdef BuildMSX_MSX1VDP
include "..\SrcMSX\MSX1VDP_V1_HardwareTileArray.asm"
else
include "..\SrcMSX\MSXVDP_V1_HardwareTileArray.asm"
endif
endif
ifdef BuildCPC
include "..\SrcMSX\MSXVDP_V1_HardwareTileArray.asm"
endif
|
src/Test.agda
|
cspollard/diff
| 0 |
16038
|
<filename>src/Test.agda
module Test where
open import Algebra using (CommutativeRing; IsCommutativeRing)
open import Assume using (assume)
import Data.Nat as ℕ
open ℕ using (ℕ; zero; suc)
import Data.Fin as F
open F using (Fin)
open import Relation.Binary using (Rel; Setoid; _Preserves_⟶_)
open import Function using (Inverse; _on_; _∘_; _|>_; id; flip)
open import Algebra.Module using (Module)
module Mod = Module
open import Data.Product using (_,_; proj₂; _×_)
open import Algebra.Module.Construct.DirectProduct using () renaming (⟨module⟩ to ×-module)
open import Level using (_⊔_; Level; 0ℓ; Lift)
open import Data.Vec.Recursive
open import Algebra.Module.Vec.Recursive
module _
{r ℓ} {CR : CommutativeRing r ℓ}
where
-- D B k is the solution to
-- (A → X) → A ^ suc k → B
-- i.e. D B k ~ A ^ k → B
open Module
D : ∀ {m ℓm} (M : Module CR m ℓm) → ℕ → Set _
D {m = m} M k = ∀ {X : Set m} → X ^ suc k → Carrierᴹ M
const
: ∀ {m ℓm} {{M : Module CR m ℓm}}
→ ∀ {k} → Carrierᴹ M → D M k
const {k = zero} c x = c
const {{M}} {k = suc k} c v = 0ᴹ M
double
: ∀ {m ℓm} {{M : Module CR m ℓm}}
→ ∀ {k} → D M k → D M k
double {{M}} x y = let x' = x y in _+ᴹ_ M x' x'
-- D : Level → ∀ {n ℓn} (N : Module CR n ℓn) → ℕ → Set _
-- D m N k = {M : Set m} → M → M ^ k → Carrierᴹ N
-- compose
-- : ∀ {x} {X : Set x}
-- → ∀ {n ℓn} {N : Module CR n ℓn}
-- → ∀ {o ℓo} {O : Module CR o ℓo}
-- → ∀ {k} → (f : X → D N k) → (g : Carrierᴹ N → D O k)
-- → X → D O k
-- compose = ?
-- _th-derivative_ : ∀ k → (D k → D k) → M.Carrierᴹ → N.Carrierᴹ
-- k th-derivative f = {! !}
-- TODO
-- can we use M → D N k everywhere?!
-- data D : ℕ → Set (m ⊔ n) where
-- z : N.Carrierᴹ → D zero
-- d : ∀ {k} → (fx : N.Carrierᴹ) → (dfx : M.Carrierᴹ → D k) → D (suc k)
-- module _
-- {r ℓ} {CR : CommutativeRing r ℓ}
-- {m ℓm} {M : Module CR m ℓm}
-- {n ℓn} {N : Module CR n ℓn}
-- where
-- private
-- module CR = CommutativeRing CR
-- module M = Module M
-- module N = Module N
-- private
-- module dmod where
-- Carrierᴹ : ∀ {k : ℕ} → Set (m ⊔ n)
-- Carrierᴹ {k} = D M N k
-- _≈ᴹ_ : ∀ {k} → Rel (D M N k) (m ⊔ ℓn)
-- _≈ᴹ_ (z x) (z y) = Lift (m ⊔ ℓn) (x N.≈ᴹ y)
-- _≈ᴹ_ (d fx dfx) (d fy dfy) = (fx N.≈ᴹ fy) × (∀ v → dfx v ≈ᴹ dfy v)
-- _+ᴹ_ : ∀ {k} → (x y : D M N k) → D M N k
-- _+ᴹ_ (z x) (z y) = z (x N.+ᴹ y)
-- _+ᴹ_ (d fx dfx) (d fy dfy) = d (fx N.+ᴹ fy) λ v → dfx v +ᴹ dfy v
-- _*ₗ_ : ∀ {k} → (s : CR.Carrier) (x : D M N k) → D M N k
-- _*ₗ_ s (z x) = z (s N.*ₗ x)
-- _*ₗ_ s (d fx dfx) = d (s N.*ₗ fx) λ v → s *ₗ dfx v
-- _*ᵣ_ : ∀ {k} → (x : D M N k) (s : CR.Carrier) → D M N k
-- _*ᵣ_ = flip _*ₗ_
-- 0ᴹ : ∀ {k} → D M N k
-- 0ᴹ {zero} = z N.0ᴹ
-- 0ᴹ {suc k} = d N.0ᴹ λ v → 0ᴹ
-- -ᴹ_ : ∀ {k} → D M N k → D M N k
-- -ᴹ_ (z x) = z (N.-ᴹ x)
-- -ᴹ_ (d fx dfx) = d (N.-ᴹ fx) λ v → -ᴹ dfx v
-- instance
-- D-module : ∀ {k : ℕ} → Module CR _ _
-- D-module {k} =
-- record
-- { Carrierᴹ = dmod.Carrierᴹ {k}
-- ; isModule = assume
-- ; dmod
-- }
-- private variable k : ℕ
-- run : D M N k → N.Carrierᴹ
-- run (z x) = x
-- run (d x _) = x
-- extract : D M N zero → N.Carrierᴹ
-- extract = run
-- diff : M.Carrierᴹ → D M N (suc k) → D M N k
-- diff v (d _ x) = x v
-- konst _# : ∀ (c : N.Carrierᴹ) → D M N k
-- konst {k = zero} c = z c
-- konst {k = suc k} c = d c (λ v → konst N.0ᴹ)
-- x # = konst x
-- jacobian : (df : D M N 1) (v : M.Carrierᴹ) → N.Carrierᴹ
-- jacobian df v = df |> diff v |> extract
-- hessian : (df : D M N 2) (v v' : M.Carrierᴹ) → N.Carrierᴹ
-- hessian df v v' = df |> diff v |> diff v' |> extract
-- hack : ∀ {l} → D M N (suc l) → D M N l
-- hack {zero} (d fx dfx) = z fx
-- hack {suc l} (d fx dfx) = d fx λ v → hack {l} (dfx v)
module _ where
import Real as ℝ
open ℝ using (ℝ)
open import Data.Vec.Recursive
ℝ-isCommutativeRing : IsCommutativeRing ℝ._≈_ ℝ._+_ ℝ._*_ ℝ.-_ 0.0 1.0
ℝ-isCommutativeRing = assume
instance
ℝ-commutativeRing : CommutativeRing 0ℓ 0ℓ
ℝ-commutativeRing = record { isCommutativeRing = ℝ-isCommutativeRing }
ℝ-cr : CommutativeRing 0ℓ 0ℓ
ℝ-cr = ℝ-commutativeRing
private
ℝ-mod' : Module ℝ-commutativeRing 0ℓ 0ℓ
ℝ-mod' = U.⟨module⟩
where import Algebra.Module.Construct.TensorUnit as U
ℝ^ : ∀ n → Module ℝ-commutativeRing 0ℓ 0ℓ
ℝ^ n = ℝ-mod' ^ᴹ n
ℝ-mod : Module ℝ-commutativeRing 0ℓ 0ℓ
ℝ-mod = ℝ^ 1
exp : ∀ {k} → D ℝ-mod k → D ℝ-mod k
exp {0} f x = ℝ.e^ f x
exp {1} f' xdx = let (fx , f'x) = f xdx in {! (ℝ.e^ fx) ℝ.* f'x !}
exp {k} f y = {! !}
-- -- TODO
-- -- is this really the identity?
-- var : ∀ {rank k} (c : Mod.Carrierᴹ (ℝ^ rank)) → D (ℝ^ rank) (ℝ^ rank) k
-- var {rank} {zero} c = z c
-- var {rank} {suc n} c = d c (λ v → konst (replicate rank 1.0))
-- instance
-- ℝ^n : ∀ {n} → Module ℝ-cr 0ℓ 0ℓ
-- ℝ^n {n} = ℝ^ n
-- infixl 6 _+_ _-_
-- infixl 7 _*_
-- -- linear and bilinear forms
-- _*_
-- : ∀ {m ℓm} {M : Module ℝ-cr m ℓm} {k rank}
-- → (x y : D M (ℝ^ rank) k)
-- → D M (ℝ^ rank) k
-- open Module {{...}}
-- _+_ _-_
-- : ∀ {r ℓ} {CR : CommutativeRing r ℓ} {m ℓm} {{M : Module CR m ℓm}} (x y : Mod.Carrierᴹ M)
-- → Mod.Carrierᴹ M
-- x + y = x +ᴹ y
-- x - y = x +ᴹ (-ᴹ y)
-- _*_ {rank = rank} (z x) (z y) = z (zipWith ℝ._*_ rank x y)
-- _*_ {rank = rank} dfx@(d fx f'x) dgx@(d gx g'x) =
-- d (zipWith ℝ._*_ rank fx gx) (λ v → hack dfx * g'x v + hack dgx * f'x v)
-- -- convenience function
-- _>-<_
-- : ∀ {k}
-- → (f : ℝ → ℝ) (f' : ∀ {l} → D ℝ-mod ℝ-mod l → D ℝ-mod ℝ-mod l)
-- → D ℝ-mod ℝ-mod k → D ℝ-mod ℝ-mod k
-- (f >-< _) (z x) = z (f x)
-- (f >-< f') dfx@(d x dx) = d (f x) λ v → dx v * f' (hack dfx)
-- ε : ∀ {rank} → Fin rank → ℝ ^ rank
-- ε {zero} n = _
-- ε {suc zero} _ = 1.0
-- ε {2+ rank} F.zero = 1.0 , Mod.0ᴹ (ℝ^ (suc rank))
-- ε {2+ rank} (F.suc n) = Mod.0ᴹ ℝ-mod , ε n
-- ∇_ grad : ∀ {rank} → D (ℝ^ rank) (ℝ^ 1) 1 → ℝ ^ rank
-- ∇_ {rank = rank} f = map (jacobian f) rank unitvecs
-- where
-- unitvecs : (ℝ ^ rank) ^ rank
-- unitvecs = map ε rank (tabulate rank id)
-- grad = ∇_
-- infixl 8 _**_
-- infixr 9 -_
-- infixr 9 e^_
-- -_
-- : ∀ {r ℓ} {CR : CommutativeRing r ℓ} {m ℓm} {{M : Module CR m ℓm}} (x : Mod.Carrierᴹ M)
-- → Mod.Carrierᴹ M
-- -_ x = -ᴹ x
-- ℝ-sgn : ℝ → ℝ
-- ℝ-sgn x = if does (0.0 ℝ.≤? x) then 1.0 else ℝ.- 1.0
-- where
-- open import Data.Bool using (if_then_else_)
-- open import Relation.Nullary using (does)
-- ℝ-abs : ℝ → ℝ
-- ℝ-abs x = x ℝ.* ℝ-sgn x
-- -- the first is the zero-order
-- poly : ∀ {rank k} → ℝ ^ suc rank → D ℝ-mod ℝ-mod k → D ℝ-mod ℝ-mod k
-- poly {rank = zero} cs x = konst cs
-- poly {rank = suc rank} (c , cs) x = konst c + x * poly cs x
-- pow : ℕ → ∀ {k} → D ℝ-mod ℝ-mod k → D ℝ-mod ℝ-mod k
-- pow 0 x = konst 1.0
-- pow 1 x = x
-- pow (suc n) dx = dx * pow n dx
-- log e^_ recip abs sgn : ∀ {k} → D ℝ-mod ℝ-mod k → D ℝ-mod ℝ-mod k
-- log = ℝ.log >-< recip ∘ abs
-- recip (z x) = z (1.0 ℝ.÷ x)
-- recip dfx@(d fx f'x) = d (1.0 ℝ.÷ fx) λ x → - (f'x x * tmp * tmp)
-- where
-- tmp = recip (hack dfx)
-- abs = ℝ-abs >-< sgn
-- sgn = ℝ-sgn >-< λ _ → 0ᴹ
-- e^ z x = z (ℝ.e^ x)
-- e^ dfx@(d fx f'x) = d (run tmp) λ v → f'x v * tmp
-- where
-- tmp = e^ hack dfx
-- infixl 7 _÷_
-- _÷_ _**_ : ∀ {k} (x y : D ℝ-mod ℝ-mod k) → D ℝ-mod ℝ-mod k
-- x ÷ y = x * recip x
-- x ** y = e^ y * log x
-- _! : ℕ → ℕ
-- 0 ! = 1
-- 1 ! = 1
-- sucn@(suc n) ! = sucn ℕ.* (n !)
-- sterling : ∀ {k} → ℕ → D ℝ-mod ℝ-mod k
-- sterling {k} m = m' * log m' - m'
-- where
-- m' : D ℝ-mod ℝ-mod k
-- m' = ℝ.fromℕ m #
-- -- without the constant denominator term
-- logPoisson' : ∀ {n} → ℕ → D ℝ-mod ℝ-mod n → D ℝ-mod ℝ-mod n
-- logPoisson' k λ' = k' * log λ' - λ'
-- where k' = ℝ.fromℕ k #
-- logPoisson : ∀ {n} → ℕ → D ℝ-mod ℝ-mod n → D ℝ-mod ℝ-mod n
-- logPoisson k λ' = logPoisson' k λ' - sterling k
-- -- descend : ∀ {rank} (f : D (ℝ^ rank) 1 → D ℝ-mod 1) (steps : ℕ) (start : ℝ ^ rank) → ℝ ^ rank
-- -- descend f zero start = start
-- -- descend f (suc steps) start = {! !}
-- module _ where
-- open import Relation.Binary.PropositionalEquality using (refl)
-- _ : (∇ (var 1.0 * var 1.0)) ℝ.≈ 2.0
-- _ = refl
-- -- -- -- _ : run e^_ 2.0 ℝ.≈ (ℝ.e^ 2.0)
-- -- -- -- _ = refl
-- -- -- -- testpoly : ∀ {n} → D ℝ-mod n → D ℝ-mod n
-- -- -- -- testpoly = poly (1.0 , 2.0 , 3.0)
-- -- -- -- _ : run testpoly 2.0 ℝ.≈ (1.0 + 4.0 + 12.0)
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ testpoly [ 2.0 ] ℝ.≈ (0.0 + 2.0 + 3.0 ℝ.* 2.0 ℝ.* 2.0)
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ testpoly [ 7.0 ] ℝ.≈ (0.0 + 2.0 + 2.0 ℝ.* 3.0 ℝ.* 7.0)
-- -- -- -- _ = refl
-- -- -- -- _ : hessian e^_ 1.0 1.0 0.0 ℝ.≈ (ℝ.e^ 1.0)
-- -- -- -- _ = refl
-- -- -- -- asdf : D ℝ-mod 2
-- -- -- -- asdf = e^ var (2.0 , 1.0 , 0.0)
-- -- -- -- _ : hessian (poly (1.0 , 2.0 , 3.0)) 1.0 1.0 0.0 ℝ.≈ (2.0 ℝ.* 3.0)
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ log [ 1.0 ] ℝ.≈ 1.0
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ log [ -ᴹ 1.0 ] ℝ.≈ 1.0
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ sgn [ 2.0 ] ℝ.≈ 0.0
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ abs [ 2.0 ] ℝ.≈ 1.0
-- -- -- -- _ = refl
-- -- -- -- _ : run abs (- 2.0) ℝ.≈ 2.0
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ abs [ - 1.0 ] ℝ.≈ (- 1.0)
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ recip [ - 2.0 ] ℝ.≈ (- 0.25)
-- -- -- -- _ = refl
-- -- -- -- _ : ∇ log [ 2.0 ] ℝ.≈ 0.5
-- -- -- -- _ = refl
|
programs/oeis/267/A267777.asm
|
neoneye/loda
| 22 |
167693
|
; A267777: Binary representation of the n-th iteration of the "Rule 209" elementary cellular automaton starting with a single ON (black) cell.
; 1,1,11001,1111001,111111001,11111111001,1111111111001,111111111111001,11111111111111001,1111111111111111001,111111111111111111001,11111111111111111111001,1111111111111111111111001,111111111111111111111111001,11111111111111111111111111001,1111111111111111111111111111001,111111111111111111111111111111001,11111111111111111111111111111111001
mov $1,100
pow $1,$0
div $1,100
mul $1,120
div $1,11880
mul $1,11000
add $1,1
mov $0,$1
|
programs/oeis/315/A315311.asm
|
neoneye/loda
| 22 |
88506
|
; A315311: Coordination sequence Gal.3.51.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
; 1,6,10,16,20,26,32,36,42,46,52,58,62,68,72,78,84,88,94,98,104,110,114,120,124,130,136,140,146,150,156,162,166,172,176,182,188,192,198,202,208,214,218,224,228,234,240,244,250,254
mul $0,2
mov $1,$0
add $1,3
mov $2,$0
mul $2,2
trn $2,1
add $0,$2
add $0,3
lpb $1
sub $0,2
trn $1,5
lpe
|
list2/task1/src/main.adb
|
luk9400/nsi
| 0 |
7275
|
<gh_stars>0
with Ada.Text_IO;
with Primes;
procedure Main is
N : Positive := 16;
begin
Ada.Text_IO.Put_Line (Primes.IsPrime (N)'Image);
end Main;
|
work/ff3_battle-specials.asm
|
ypyp-pprn-mnmn/ff3_hack
| 4 |
20844
|
;; encoding: utf-8
;; ff3_poison.asm
;;
;; re-implementation of logics around processing poisonous status
;;
;; version:
;; 0.1.0
;;=================================================================================================
__FF3_BATTLE_SPECIALS_INCLUDED__
.ifdef _FIX_REFLECTION
;--------------------------------------------------------------------------------------------------
;; locating...
;INIT_PATCH_EX battle.specials,$31,$af77,$b15f,$af77 ;;not fully patched.
INIT_PATCH_EX battle.specials,$31,$b0d3,$b15f,$b0d3
;;# $31:af77 battle.specials.execute
;;> 特殊攻撃を実行し、その結果を実行者と対象者に反映する。
;;
;;### notes:
;;battleFunction00 (dispId : 0) (former name: "doSpecialAction")
;;this function has a bug that happens if and only if 'reflection' of some kind of magics.
;;more specifically, when a reflected magic resulted in 0 damage,
;;this function incorrectly skips logics restoring target pointer. see around $b11c for details.
;;
;;### args:
;;+ [in] u16 $6e : actorPtr
;;+ [in] u8 $cc : skipSealedCheck (item=1,although item flag directs to skip too)
;;+ [in] u8 $7e99 : selected targets (actor.+2F)
;;
;;### local variables:
;;+ u8 $62 : Index
;;+ u8 $7e88 : actionId
;;+ u8 $7e9d : actionParam[6]
;;
;;### callers:
;;+ $30:9e58 invokeBattleFunction: dispatchBattleCommand(0)
.if 0 ;;TODO
battle.specials.execute:
lda #$00 ; AF77 A9 00
sta $54 ; AF79 85 54
ldx #$09 ; AF7B A2 09
LAF7D:
sta $7EB8,x ; AF7D 9D B8 7E
dex ; AF80 CA
bpl LAF7D ; AF81 10 FA
lda $CC ; AF83 A5 CC
beq LAF8B ; AF85 F0 04
LAF87:
ldy #$2C ; AF87 A0 2C
bne LAFD6 ; AF89 D0 4B
LAF8B:
jsr getActor2C ; AF8B 20 B5 A2
bmi LAF9A ; AF8E 30 0A
and #$10 ; AF90 29 10
beq LAF9A ; AF92 F0 06
lda $1A ; AF94 A5 1A
cmp #$50 ; AF96 C9 50
bcs LAF87 ; AF98 B0 ED
LAF9A:
ldy #$01 ; AF9A A0 01
lda ($6E),y ; AF9C B1 6E
and #$30 ; AF9E 29 30
beq LAFC8 ; AFA0 F0 26
and #$20 ; AFA2 29 20
beq LAFBB ; AFA4 F0 15
lda $1A ; AFA6 A5 1A
cmp #$F6 ; AFA8 C9 F6
beq LAFC8 ; AFAA F0 1C
lda #$53 ; AFAC A9 53
bne LAFBD ; AFAE D0 0D
jsr getActor2C ; AFB0 20 B5 A2
bpl LAFBB ; AFB3 10 06
lda $1A ; AFB5 A5 1A
cmp #$38 ; AFB7 C9 38
bcs LAFC8 ; AFB9 B0 0D
LAFBB:
lda #$50 ; AFBB A9 50
LAFBD:
sta $78DA ; AFBD 8D DA 78
lda #$18 ; AFC0 A9 18
sta $7EC2 ; AFC2 8D C2 7E
jmp .L_B15E ; AFC5 4C 5E B1
; ----------------------------------------------------------------------------
LAFC8:
jsr getActor2C ; AFC8 20 B5 A2
and #$18 ; AFCB 29 18
bne LAFD6 ; AFCD D0 07
sec ; AFCF 38
lda $1A ; AFD0 A5 1A
sbc #$C8 ; AFD2 E9 C8
sta $1A ; AFD4 85 1A
LAFD6:
lda ($6E),y ; AFD6 B1 6E
and #$E7 ; AFD8 29 E7
sta ($6E),y ; AFDA 91 6E
ldx #$00 ; AFDC A2 00
lda $1A ; AFDE A5 1A
sta $7E88 ; AFE0 8D 88 7E
cmp #$5B ; AFE3 C9 5B
bcc LAFE8 ; AFE5 90 01
inx ; AFE7 E8
LAFE8:
stx $7EC3 ; AFE8 8E C3 7E
lda $1A ; AFEB A5 1A
sta $18 ; AFED 85 18
lda #$08 ; AFEF A9 08
sta $1A ; AFF1 85 1A
lda #$C0 ; AFF3 A9 C0
sta $20 ; AFF5 85 20
lda #$98 ; AFF7 A9 98
sta $21 ; AFF9 85 21
ldx #$00 ; AFFB A2 00
ldy #$18 ; AFFD A0 18
tya ; AFFF 98
jsr loadTo7400Ex; B000 20 A6 FD
lda $7406 ; B003 AD 06 74
sta $7E9D ; B006 8D 9D 7E
ldx #$08 ; B009 A2 08
ldy #$00 ; B00B A0 00
lda $7E99 ; B00D AD 99 7E
LB010:
asl a ; B010 0A
bcc LB014 ; B011 90 01
iny ; B013 C8
LB014:
dex ; B014 CA
bne LB010 ; B015 D0 F9
sty $2A ; B017 84 2A
ldy #$30 ; B019 A0 30
lda ($6E),y ; B01B B1 6E
bmi LB029 ; B01D 30 0A
lda #$75 ; B01F A9 75
sta $70 ; B021 85 70
lda #$75 ; B023 A9 75
sta $71 ; B025 85 71
bne LB031 ; B027 D0 08
LB029:
lda #$75 ; B029 A9 75
sta $70 ; B02B 85 70
lda #$76 ; B02D A9 76
sta $71 ; B02F 85 71
LB031:
jsr cacheStatus ; B031 20 BA A2
ldx #$FF ; B034 A2 FF
stx $78 ; B036 86 78
stx $79 ; B038 86 79
stx $7A ; B03A 86 7A
stx $7B ; B03C 86 7B
inx ; B03E E8
stx $7574 ; B03F 8E 74 75
stx $7573 ; B042 8E 73 75
lda $7E9D ; B045 AD 9D 7E
cmp #$06 ; B048 C9 06
beq LB065 ; B04A F0 19
ldx $62 ; B04C A6 62
lda $F0,x ; B04E B5 F0
and #$C0 ; B050 29 C0
beq LB057 ; B052 F0 03
jmp .L_B15E ; B054 4C 5E B1
; ----------------------------------------------------------------------------
LB057:
ldx $7EC1 ; B057 AE C1 7E
lda $7E99 ; B05A AD 99 7E
jsr maskTargetBit ; B05D 20 38 FD
bne LB065 ; B060 D0 03
jmp LB139 ; B062 4C 39 B1
; ----------------------------------------------------------------------------
LB065:
lda $CC ; B065 A5 CC
bne LB0D3 ; B067 D0 6A
lda $7405 ; B069 AD 05 74
ldy #$10 ; B06C A0 10
and #$10 ; B06E 29 10
beq LB073 ; B070 F0 01
iny ; B072 C8
LB073:
lda ($6E),y ; B073 B1 6E
sta $18 ; B075 85 18
lsr a ; B077 4A
clc ; B078 18
adc $7401 ; B079 6D 01 74
sta $25 ; B07C 85 25
ldx $62 ; B07E A6 62
lda $F0,x ; B080 B5 F0
and #$04 ; B082 29 04
beq LB088 ; B084 F0 02
lsr $25 ; B086 46 25
LB088:
ldy #$0F ; B088 A0 0F
lda ($6E),y ; B08A B1 6E
jsr LFD44 ; B08C 20 44 FD
sta $19 ; B08F 85 19
ldy #$00 ; B091 A0 00
lda ($6E),y ; B093 B1 6E
jsr LFD45 ; B095 20 45 FD
sta $1A ; B098 85 1A
lda $18 ; B09A A5 18
jsr LFD45 ; B09C 20 45 FD
sec ; B09F 38
adc $19 ; B0A0 65 19
adc $1A ; B0A2 65 1A
sta $24 ; B0A4 85 24
sta $38 ; B0A6 85 38
jsr getNumberOfRandomSuccess ; B0A8 20 28 BB
sta $7C ; B0AB 85 7C
ldy #$33 ; B0AD A0 33
lda ($6E),y ; B0AF B1 6E
and #$E0 ; B0B1 29 E0
jsr LFD46 ; B0B3 20 46 FD
and $7400 ; B0B6 2D 00 74
beq LB0D3 ; B0B9 F0 18
lda $30 ; B0BB A5 30
sta $18 ; B0BD 85 18
lda #$05 ; B0BF A9 05
sta $1A ; B0C1 85 1A
lda #$00 ; B0C3 A9 00
sta $19 ; B0C5 85 19
sta $1B ; B0C7 85 1B
jsr div ; B0C9 20 92 FC
lda $1C ; B0CC A5 1C
clc ; B0CE 18
adc $30 ; B0CF 65 30
sta $7C ; B0D1 85 7C
.endif ;;TODO
;--------------------------------------------------------------------------------------------------
;LB0D3:
jsr battle.specials.invoke_handler ; B0D3 20 5F B1
battle.specials.post_execution:
.damage_index = $64
.p_actor = $6e
.p_target = $70
.damage_value = $78
ldx <.damage_index ; B0D6 A6 64
;lda <.damage_value+1 ; B0D8 A5 79
lda battle.reflected ; B0E0 AD 74 75
beq .not_reflected
.reflected:
;ldx <.damage_index ; B0DE A6 64
;lda battle.reflected ; B0E0 AD 74 75
;bne .push_damage_value_as_2nd_phase ; B0E3 D0 0E
;;A = HIGH(damage_value)
lda <.damage_value+1 ; B0D8 A5 79
cmp #HIGH(effect.DAMAGE_NONE) ; B0DA C9 FF
beq .restore_target_ptr
; ----------------------------------------------------------------------------
;LB0F3:
;.push_damage_value_as_2nd_phase:
jsr battle.action_target.get_2c ; B0F3 20 25 BC
and #$07 ; B0F6 29 07
asl a ; B0F8 0A
tax ; B0F9 AA
inx ; B0FA E8
lda effect.damages_to_show_2nd,x ; B0FB BD 5F 7E
cmp #HIGH(effect.DAMAGE_NONE) ; B0FE C9 FF
beq .just_put_value ; B100 F0 16
dex ; B102 CA
clc ; B103 18
lda effect.damages_to_show_2nd,x ; B104 BD 5F 7E
adc <.damage_value ; B107 65 78
sta effect.damages_to_show_2nd,x ; B109 9D 5F 7E
inx ; B10C E8
lda effect.damages_to_show_2nd,x ; B10D BD 5F 7E
adc <.damage_value+1 ; B110 65 79
sta effect.damages_to_show_2nd,x ; B112 9D 5F 7E
jmp .restore_target_ptr ; B115 4C 1C B1
; ----------------------------------------------------------------------------
;LB118:
.just_put_value:
dex ; B118 CA
jsr battle.push_damage_for_2nd_phase; B119 20 1C BB
;LB11C:
.restore_target_ptr:
lda battle.p_reflector ; B11C AD B5 78
sta <.p_target ; B11F 85 70
lda battle.p_reflector+1 ; B121 AD B6 78
sta <.p_target+1 ; B124 85 71
;jmp .finalize_actor_status ; B126 4C 31 B1
bne .finalize_actor_status ;;target pointer always has a non-zero value
.not_reflected:
;;A = HIGH(damage_value)
lda <.damage_value+1 ; B0D8 A5 79
cmp #HIGH(effect.DAMAGE_NONE) ; B0DA C9 FF
beq .finalize_status ; B0DC F0 4B
lda <.damage_value ; B0E5 A5 78
sta effect.damages_to_show_1st,x ; B0E7 9D 4F 7E
inx ; B0EA E8
lda <.damage_value+1 ; B0EB A5 79
sta effect.damages_to_show_1st,x ; B0ED 9D 4F 7E
;jmp .finalize_status ; B0F0 4C 29 B1
; ----------------------------------------------------------------------------
;LB129:
.finalize_status:
jsr battle.set_target_as_affected ; B129 20 BC BD
lda #$00 ; B12C A9 00
jsr battle.update_status_cache ; B12E 20 C5 BD
;LB131:
.finalize_actor_status:
jsr battle.set_actor_as_affected ; B131 20 B3 BD
lda #$01 ; B134 A9 01
jsr battle.update_status_cache ; B136 20 C5 BD
VERIFY_PC $b139
NOP_PAD_TO $b139
;;LB139:
;FIX_ADDRESS_ON_CALLER $b062+1 ;;B062 4C 39 B1
;;
inc effect.target_index ; B139 EE C1 7E
lda effect.target_index ; B13C AD C1 7E
cmp #$08 ; B13F C9 08
beq .done ; B141 F0 1B
cmp #$04 ; B143 C9 04
bne .next_target ; B145 D0 07
lda effect.side_flags ; B147 AD 9A 7E
and #effect.TARGET_ENEMY ; B14A 29 40
beq .done ; B14C F0 10
;LB14E:
.next_target:
clc ; B14E 18
lda <.p_target ; B14F A5 70
adc #$40 ; B151 69 40
sta <.p_target ; B153 85 70
lda <.p_target+1 ; B155 A5 71
adc #$00 ; B157 69 00
sta <.p_target+1 ; B159 85 71
jmp $B031 ; B15B 4C 31 B0
;.L_B15E
.done
rts ; B15E 60
;--------------------------------------------------------------------------------------------------
VERIFY_PC_TO_PATCH_END battle.specials
.endif ;;_FIX_REFLECTION
|
data/jpred4/jp_batch_1613899824__mqcg2Zh/jp_batch_1613899824__mqcg2Zh.als
|
jonriege/predict-protein-structure
| 0 |
5041
|
<filename>data/jpred4/jp_batch_1613899824__mqcg2Zh/jp_batch_1613899824__mqcg2Zh.als
SILENT_MODE
BLOCK_FILE jp_batch_1613899824__mqcg2Zh.concise.blc
MAX_NSEQ 840
MAX_INPUT_LEN 842
OUTPUT_FILE jp_batch_1613899824__mqcg2Zh.concise.ps
PORTRAIT
POINTSIZE 8
IDENT_WIDTH 12
X_OFFSET 2
Y_OFFSET 2
DEFINE_FONT 0 Helvetica DEFAULT
DEFINE_FONT 1 Helvetica REL 0.75
DEFINE_FONT 7 Helvetica REL 0.6
DEFINE_FONT 3 Helvetica-Bold DEFAULT
DEFINE_FONT 4 Times-Bold DEFAULT
DEFINE_FONT 5 Helvetica-BoldOblique DEFAULT
#
DEFINE_COLOUR 3 1 0.62 0.67 # Turquiose
DEFINE_COLOUR 4 1 1 0 # Yellow
DEFINE_COLOUR 5 1 0 0 # Red
DEFINE_COLOUR 7 1 0 1 # Purple
DEFINE_COLOUR 8 0 0 1 # Blue
DEFINE_COLOUR 9 0 1 0 # Green
DEFINE_COLOUR 10 0.41 0.64 1.00 # Pale blue
DEFINE_COLOUR 11 0.41 0.82 0.67 # Pale green
DEFINE_COLOUR 50 0.69 0.18 0.37 # Pink (helix)
DEFINE_COLOUR 51 1.00 0.89 0.00 # Gold (strand)
NUMBER_INT 10
SETUP
#
# Highlight specific residues.
# Avoid highlighting Lupas 'C' predictions by
# limiting the highlighting to the alignments
Scol_CHARS C 1 1 103 829 4
Ccol_CHARS H ALL 5
Ccol_CHARS P ALL 8
SURROUND_CHARS LIV ALL
#
# Replace known structure types with whitespace
SUB_CHARS 1 830 103 839 H SPACE
SUB_CHARS 1 830 103 839 E SPACE
SUB_CHARS 1 830 103 839 - SPACE
STRAND 18 833 18
COLOUR_TEXT_REGION 18 833 18 833 51
STRAND 35 833 35
COLOUR_TEXT_REGION 35 833 35 833 51
HELIX 3 833 13
COLOUR_TEXT_REGION 3 833 13 833 50
HELIX 61 833 69
COLOUR_TEXT_REGION 61 833 69 833 50
HELIX 88 833 101
COLOUR_TEXT_REGION 88 833 101 833 50
STRAND 18 838 20
COLOUR_TEXT_REGION 18 838 20 838 51
HELIX 3 838 13
COLOUR_TEXT_REGION 3 838 13 838 50
HELIX 61 838 69
COLOUR_TEXT_REGION 61 838 69 838 50
HELIX 88 838 101
COLOUR_TEXT_REGION 88 838 101 838 50
STRAND 18 839 18
COLOUR_TEXT_REGION 18 839 18 839 51
STRAND 33 839 37
COLOUR_TEXT_REGION 33 839 37 839 51
HELIX 3 839 13
COLOUR_TEXT_REGION 3 839 13 839 50
HELIX 62 839 69
COLOUR_TEXT_REGION 62 839 69 839 50
HELIX 88 839 101
COLOUR_TEXT_REGION 88 839 101 839 50
|
src/adda-generator.adb
|
alban-linard/adda
| 0 |
11571
|
<gh_stars>0
package body Adda.Generator is
use Successors;
overriding procedure Initialize
(Object : in out Decision_Diagram) is
begin
if Object.Data /= null then
Object.Data.Reference_Counter.all :=
Object.Data.Reference_Counter.all + 1;
end if;
end Initialize;
overriding procedure Adjust
(Object : in out Decision_Diagram) renames Initialize;
overriding procedure Finalize
(Object : in out Decision_Diagram) is
begin
if Object.Data /= null then
Object.Data.Reference_Counter.all :=
Object.Data.Reference_Counter.all - 1;
if Object.Data.Reference_Counter.all = 0 then
null; -- FIXME
end if;
end if;
end Finalize;
function Hash
(Element : in Decision_Diagram)
return Hash_Type is
begin
return Hash_Type (Element.Data.Identifier);
end Hash;
function "="
(Left, Right : in Decision_Diagram)
return Boolean is
begin
return Left.Data
= Right.Data; -- TODO: check that it is a pointer comparison
end "=";
function Hash
(Element : in Structure)
return Hash_Type is
begin
case Element.Of_Type is
when Terminal =>
return Hash_Terminal (Element.Value);
when Non_Terminal =>
declare
Result : Hash_Type := Hash_Variable (Element.Variable);
Current : Successors.Cursor :=
Successors.First (Element.Alpha);
begin
while Successors.Has_Element (Current) loop
Result :=
Result
xor
(Hash_Value (Successors.Key (Current))
xor Hash (Successors.Element (Current)));
Successors.Next (Current);
end loop;
return Result;
end;
end case;
end Hash;
overriding function "="
(Left, Right : in Structure)
return Boolean is
begin
if Left.Of_Type = Right.Of_Type then
case Left.Of_Type is
when Terminal =>
return Left.Value = Right.Value;
when Non_Terminal =>
return Left.Variable = Right.Variable
and then Left.Alpha = Right.Alpha;
end case;
else
return False;
end if;
end "=";
function Make
(Value : in Terminal_Type)
return Decision_Diagram is
To_Insert : constant Structure :=
(Of_Type => Terminal,
Identifier => 0,
Reference_Counter => null,
Value => Value);
Position : Unicity.Cursor;
Inserted : Boolean;
begin
Unicity_Table.Insert
(New_Item => To_Insert,
Position => Position,
Inserted => Inserted);
declare
Subdata : aliased Structure := Unicity.Element (Position);
Data : constant Any_Structure := Subdata'Unchecked_Access;
begin
if Inserted then
Identifier := Identifier + 1;
Subdata.Identifier := Identifier + 1;
Subdata.Reference_Counter := new Natural'(0);
end if;
return (Controlled with Data => Data);
end;
end Make;
function Make
(Variable : in Variable_Type;
Value : in Value_Type;
Successor : in Decision_Diagram)
return Decision_Diagram is
Result : Decision_Diagram;
begin
return Result;
end Make;
begin
null;
end Adda.Generator;
|
mc-sema/validator/x86_64/tests/ADC64rr.asm
|
randolphwong/mcsema
| 2 |
24021
|
BITS 64
;TEST_FILE_META_BEGIN
;TEST_TYPE=TEST_F
;TEST_IGNOREFLAGS=
;TEST_FILE_META_END
; Adc64RR
mov rax, 0xdead1234abcd
mov rdx, 0xdead2345bcde
;TEST_BEGIN_RECORDING
adc rax, rdx
;TEST_END_RECORDING
|
Sept10/5.asm
|
s10singh97/Microprocessor_Lab
| 0 |
94068
|
<gh_stars>0
;Complement the contents of flag
hlt
|
asm/idle.asm
|
mlndz28/selector-623
| 0 |
634
|
<reponame>mlndz28/selector-623
loc
;******************************************************************
;* MODO_LIBRE - standby mode. Load the respective message on the
;* screen for this mode and turn off the 7 segment display.
;*
;* Calling convention:
;* jsr MODO_LIBRE
;*
;* Calls: Cargar_LCD
;* Changes: X, Y, BIN1, BIN2, POSITION
;******************************************************************
MODO_LIBRE:
brset POSITION,$01,return`
movb #$01,POSITION
movb #$01,LEDS
ldx #MSGRM
ldy #MSGML
jsr Cargar_LCD
movb #$BB,BIN1
movb #$BB,BIN2
return`:
rts
|
oeis/350/A350094.asm
|
neoneye/loda-programs
| 11 |
25889
|
<reponame>neoneye/loda-programs<gh_stars>10-100
; A350094: a(n) = Sum_{k=0..n} n CNIMPL k where CNIMPL = NOT(n) AND k is the bitwise logical converse non-implication operator (A102037).
; Submitted by <NAME>
; 0,0,1,0,6,4,3,0,28,24,21,16,18,12,7,0,120,112,105,96,94,84,75,64,84,72,61,48,42,28,15,0,496,480,465,448,438,420,403,384,396,376,357,336,322,300,279,256,360,336,313,288,270,244,219,192,196,168,141,112
mov $2,2
mov $5,3
lpb $0
mov $3,$0
mul $5,2
lpb $3
mov $4,$0
mod $4,$2
cmp $4,0
cmp $4,0
sub $3,$4
lpe
div $0,$2
mov $4,$3
mul $4,$5
add $1,$4
mul $5,$2
lpe
mov $0,$1
div $0,12
|
bucket_34/gnatstudio/patches/patch-kernel_src_gtkada-search__entry.adb
|
jrmarino/ravensource
| 17 |
29963
|
<filename>bucket_34/gnatstudio/patches/patch-kernel_src_gtkada-search__entry.adb
--- kernel/src/gtkada-search_entry.adb.orig 2021-06-18 05:08:58 UTC
+++ kernel/src/gtkada-search_entry.adb
@@ -21,13 +21,13 @@ with Gtk.Style_Context; use Gtk.Style_C
with Gtk.Widget; use Gtk.Widget;
with Gtkada.Handlers; use Gtkada.Handlers;
with GPS.Intl; use GPS.Intl;
+with Gtk.Main;
package body Gtkada.Search_Entry is
procedure On_Clear_Entry
- (Self : access Gtk_Entry_Record'Class;
- Pos : Gtk_Entry_Icon_Position;
- Event : Gdk_Event);
+ (Self : access Gtk_Entry_Record'Class;
+ Pos : Gtk_Entry_Icon_Position);
-- Called when the user presses the "clear" icon
procedure On_Changed (Self : access Gtk_Widget_Record'Class);
@@ -39,14 +39,14 @@ package body Gtkada.Search_Entry is
function Get_Icon_Position
(Self : access Gtkada_Search_Entry_Record'Class;
- Event : Gdk_Event_Button) return Gtk_Entry_Icon_Position
+ Event : Gdk_Event) return Gtk_Entry_Icon_Position
is
Alloc : Gtk_Allocation;
Rect : Gdk_Rectangle;
X, Y : Gint;
begin
Self.Get_Allocation (Alloc);
- Get_Position (Event.Window, X, Y);
+ Get_Position (Get_Window (Event), X, Y);
Self.Get_Icon_Area (Gtk_Entry_Icon_Primary, Rect);
@@ -62,14 +62,13 @@ package body Gtkada.Search_Entry is
--------------------
procedure On_Clear_Entry
- (Self : access Gtk_Entry_Record'Class;
- Pos : Gtk_Entry_Icon_Position;
- Event : Gdk_Event)
+ (Self : access Gtk_Entry_Record'Class;
+ Pos : Gtk_Entry_Icon_Position)
is
pragma Unreferenced (Pos); -- unreliable with gtk+ 3.8
begin
- if Gtkada_Search_Entry (Self).Get_Icon_Position (Event.Button) =
- Gtk_Entry_Icon_Secondary
+ if Gtkada_Search_Entry (Self).Get_Icon_Position (
+ Gtk.Main.Get_Current_Event) = Gtk_Entry_Icon_Secondary
then
Self.Set_Text ("");
|
oeis/021/A021898.asm
|
neoneye/loda-programs
| 11 |
21263
|
; A021898: Decimal expansion of 1/894.
; Submitted by <NAME>(m2)
; 0,0,1,1,1,8,5,6,8,2,3,2,6,6,2,1,9,2,3,9,3,7,3,6,0,1,7,8,9,7,0,9,1,7,2,2,5,9,5,0,7,8,2,9,9,7,7,6,2,8,6,3,5,3,4,6,7,5,6,1,5,2,1,2,5,2,7,9,6,4,2,0,5,8,1,6,5,5,4,8,0,9,8,4,3,4,0,0,4,4,7,4,2,7,2,9,3,0,6
seq $0,83811 ; Numbers n such that 2n+1 is the digit reversal of n+1.
div $0,3576
mod $0,10
|
programs/oeis/229/A229620.asm
|
karttu/loda
| 1 |
98364
|
<reponame>karttu/loda
; A229620: Incorrect version of A045949.
; 0,6,38,116,256,478,798,1236,1808,2534,3430,4516,5808,7326,9086,11108,13408,16006,18918,22164,25760,29726,34078,38836,44016,49638,55718,62276,69328,76894,84990,93636,102848,112646,123046,134068,145728,158046,171038,184724,199120,214246,230118,246756,264176,282398,301438,321316,342048,363654
mov $1,$0
mul $1,3
sub $1,1
mov $3,$0
sub $3,1
mul $1,$3
div $1,2
mov $2,$0
mul $2,$0
mov $4,$2
mul $4,3
add $1,$4
mul $2,$0
mov $4,$2
mul $4,3
add $1,$4
|
alloy4fun_models/trashltl/models/11/iZJEjauSzkhnurdY3.als
|
Kaixi26/org.alloytools.alloy
| 0 |
2935
|
open main
pred idiZJEjauSzkhnurdY3_prop12 {
eventually (always some f:File | (f not in Trash and f not in Protected ) implies f in Trash')
}
pred __repair { idiZJEjauSzkhnurdY3_prop12 }
check __repair { idiZJEjauSzkhnurdY3_prop12 <=> prop12o }
|
src/Categories/Category/Construction/Thin.agda
|
Trebor-Huang/agda-categories
| 279 |
15127
|
<filename>src/Categories/Category/Construction/Thin.agda
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary using (Poset)
-- A thin (or posetal) category is a category with at most one
-- morphism between any pair of objects.
--
-- As explained on nLab:
--
-- "Up to isomorphism, a thin category is the same thing as a
-- proset. Up to equivalence, a thin category is the same thing as a
-- poset. (...) (It is really a question of whether you're working
-- with strict categories, which are classified up to isomorphism,
-- or categories as such, which are classified up to equivalence.)"
--
-- -- https://ncatlab.org/nlab/show/thin+category
--
-- Since
--
-- 1. posets in the standard library are defined up to an underlying
-- equivalence/setoid, but
--
-- 2. categories in this library do not have a notion of equality on
-- objects (i.e. objects are considered up to isomorphism),
--
-- it makes sense to work with the weaker notion of thin categories
-- here, i.e. those generated by posets rather than prosets. This
-- means that the core of a thin category (the groupoid consisting of
-- all its isomorphism) is just the setoid underlying the
-- corresponding poset.
--
-- (See Categories.Adjoint.Instance.PosetCore for more details.)
module Categories.Category.Construction.Thin {o ℓ₁ ℓ₂} e (P : Poset o ℓ₁ ℓ₂) where
open import Level
open import Data.Unit using (⊤)
open import Function using (flip)
open import Categories.Category
import Categories.Morphism as Morphism
open Poset P
Thin : Category o ℓ₂ e
Thin = record
{ Obj = Carrier
; _⇒_ = _≤_
; _≈_ = λ _ _ → Lift e ⊤
; id = refl
; _∘_ = flip trans
; assoc = _
; identityˡ = _
; identityʳ = _
; equiv = _
; ∘-resp-≈ = _
}
module EqIsIso where
open Category Thin hiding (_≈_)
open Morphism Thin using (_≅_)
open _≅_
-- Equivalent elements of |P| are isomorphic objects of |Thin P|.
≈⇒≅ : ∀ {x y : Obj} → x ≈ y → x ≅ y
≈⇒≅ x≈y = record
{ from = reflexive x≈y
; to = reflexive (Eq.sym x≈y)
}
≅⇒≈ : ∀ {x y : Obj} → x ≅ y → x ≈ y
≅⇒≈ x≅y = antisym (from x≅y) (to x≅y)
|
src/SizedIO/Console.agda
|
stephanadls/state-dependent-gui
| 2 |
10085
|
module SizedIO.Console where
open import Level using () renaming (zero to lzero)
open import Size
open import NativeIO
open import SizedIO.Base
data ConsoleCommand : Set where
putStrLn : String → ConsoleCommand
getLine : ConsoleCommand
ConsoleResponse : ConsoleCommand → Set
ConsoleResponse (putStrLn s) = Unit
ConsoleResponse getLine = String
consoleI : IOInterface
Command consoleI = ConsoleCommand
Response consoleI = ConsoleResponse
IOConsole : Size → Set → Set
IOConsole i = IO consoleI i
IOConsole+ : Size → Set → Set
IOConsole+ i = IO+ consoleI i
translateIOConsoleLocal : (c : ConsoleCommand) → NativeIO (ConsoleResponse c)
translateIOConsoleLocal (putStrLn s) = nativePutStrLn s
translateIOConsoleLocal getLine = nativeGetLine
translateIOConsole : {A : Set} → IOConsole ∞ A → NativeIO A
translateIOConsole = translateIO translateIOConsoleLocal
main : NativeIO Unit
main = nativePutStrLn "Console"
|
ubb/asc/lab11/RusuCosmin_11_1.asm
|
AlexanderChristian/private_courses
| 0 |
84082
|
;Read from the keyboard a string s of characters and a byte n. Divide the string s
;in n sub-strings (the last sub-string can have less than n characters). Print on
;the screen each sub-string and its position in the string.
;Example:
;Input: s = '1234567890abcdefg', n = 4
;Output:
;1: '1234'
;2: '5678'
;3: '90ab'
;4: 'cdef'
;5: 'g'
assume cs:code, ds:data
data segment public
msg1 db 'Please insert the string s: $'
s db 200, ?, 200 dup(?)
msg2 db 'Plase insert the number n: $'
n_str db 4, ?, 3 dup(?)
n db ?
newLine db 10
ten db 10
data ends
code segment public
extrn tipar: proc
start:
mov ax, data
mov ds, ax
;print msg1
mov ah, 09h
mov dx, offset msg1
int 21h
;read s
mov ah, 0ah
mov dx, offset s
int 21h
;print newline
mov ah, 02h
mov dl, newLine
int 21h
;print msg2
mov ah, 09h
mov dx, offset msg2
int 21h
;read n
mov ah, 0ah
mov dx, offset n_str
int 21h
;print newline
mov ah, 02h
mov dl, newLine
int 21h
;now convert the number from string to an integer
mov cl, n_str[1]
mov ch, 0
mov si, offset n_str + 2
CLD
mov ax, 0
loopDigits:
;store ax
push ax
lodsb
;ax = ax * 10 + s[i] - '0'
mov bl, al
sub bl, '0'
mov bh, 0
;retrieve ax
pop ax
mul ten
add ax, bx
loop loopDigits
mov n, al
mov cl, s[1]
mov ch, 0
mov si, 0
mov di, 1
mov ax, di
call tipar
loopString:
cmp si, 0
je not_zero
mov ax, si
div n
cmp ah, 0
jne not_zero
;if it is zero, print new line
mov ah, 02h
mov dl, newline
int 21h
;then, print the number of lines
inc di
mov ax, di
call tipar
not_zero:
mov ah, 02h
mov dl, s[si][2]
int 21h
inc si
loop loopString
mov ax, 4c00h
int 21h
code ends
end start
|
programs/oeis/129/A129565.asm
|
jmorken/loda
| 1 |
5159
|
; A129565: A115359 * A000012 as infinite lower triangular matrices.
; 1,0,1,1,1,1,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1
mov $1,1
mov $2,$0
lpb $2
mul $2,2
add $6,$2
mov $2,$1
lpb $6
add $1,2
add $3,$1
add $4,$0
mov $0,$1
mov $1,1
mov $5,$4
sub $5,1
mov $6,$3
lpe
mov $4,$0
lpb $5
add $1,2
add $1,$4
mov $2,$1
add $3,4
add $4,4
add $5,1
trn $5,$3
lpe
sub $3,$0
trn $3,6
mov $1,$3
sub $2,1
mov $4,0
lpe
|
oeis/020/A020968.asm
|
neoneye/loda-programs
| 11 |
244414
|
<reponame>neoneye/loda-programs<filename>oeis/020/A020968.asm
; A020968: Expansion of 1/((1-7*x)*(1-8*x)*(1-11*x)).
; Submitted by <NAME>(s2)
; 1,26,455,6700,89661,1130766,13712035,161844800,1874156921,21406992706,242089527615,2717862993300,30349359729781,337562780465846,3743627395703195,41428143398876200,457728746687336241,5051402198472270186,55698140476085454775,613752674475249237500,6759944245400513104301,74429263854651899365726,819284829464189517758355,9016663909357573774141200,99219740866176604712361961,1091709993502508661375352466,12011162067804460999198149935,132141665572426360318013971300,1453709843895844822852789237221
add $0,1
mov $3,1
lpb $0
sub $0,1
add $2,$3
add $1,$2
mul $1,8
mul $2,11
mul $3,7
lpe
mov $0,$1
div $0,8
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt29.adb
|
best08618/asylo
| 0 |
19467
|
-- { dg-do compile }
-- { dg-options "-O" }
package body Opt29 is
procedure Proc (T : Rec) is
begin
if Derived2 (T.F2.all).Id = T.F1.Id then
raise Program_Error;
end if;
end;
end Opt29;
|
programs/oeis/114/A114948.asm
|
neoneye/loda
| 22 |
28435
|
; A114948: a(n) = n^2 + 10.
; 11,14,19,26,35,46,59,74,91,110,131,154,179,206,235,266,299,334,371,410,451,494,539,586,635,686,739,794,851,910,971,1034,1099,1166,1235,1306,1379,1454,1531,1610,1691,1774,1859,1946,2035,2126,2219,2314,2411,2510
add $0,1
pow $0,2
add $0,10
|
src/L/Base/Id/Properties.agda
|
borszag/smallib
| 0 |
1936
|
module L.Base.Id.Properties where
open import L.Base.Id.Core
sym : ∀{a} {A : Set a} {x y : A} → x ≡ y → y ≡ x
sym {x = x}{y = y} = λ p → J (λ a b _ → b ≡ a) (λ _ → refl) x y p
tran : ∀{a} {A : Set a} {x y z : A} → x ≡ y → y ≡ z → x ≡ z
tran {x = x}{y = y}{z = z} =
λ p → J (λ a b p → b ≡ z → a ≡ z) (λ a q → q) x y p
ap : ∀{a b} {A : Set a} {B : Set b} {x y : A}
→ (f : A → B) → x ≡ y → (f x) ≡ (f y)
ap {x = x}{y = y} =
λ f p → J (λ a b p → (f a) ≡ (f b)) (λ u → refl) x y p
transport : ∀{a b} {A : Set a} {x y : A}
→ (B : (x : A) → Set b) → x ≡ y → B x → B y
transport {x = x}{y = y} =
λ B p → J (λ a b p → B a → B b) (λ a q → q) x y p
|
programs/oeis/052/A052534.asm
|
karttu/loda
| 0 |
179843
|
<filename>programs/oeis/052/A052534.asm
; A052534: Expansion of (1-x)*(1+x)/(1-2*x-x^2+x^3).
; 1,2,4,9,20,45,101,227,510,1146,2575,5786,13001,29213,65641,147494,331416,744685,1673292,3759853,8448313,18983187,42654834,95844542,215360731,483911170,1087338529,2443227497,5489882353,12335653674
mov $1,1
mov $4,1
lpb $0,1
sub $0,1
add $2,$4
add $3,$1
mov $1,1
add $1,$2
mov $2,$3
add $4,$3
lpe
|
libsrc/_DEVELOPMENT/math/float/am9511/c/sdcc/cam32_sdcc_asinh.asm
|
dikdom/z88dk
| 1 |
172023
|
SECTION code_fp_am9511
PUBLIC cam32_sdcc_asinh
EXTERN asm_sdcc_read1, _am9511_asinh
.cam32_sdcc_asinh
call asm_sdcc_read1
jp _am9511_asinh
|
source/asis/asis-elements.adb
|
faelys/gela-asis
| 4 |
10876
|
<reponame>faelys/gela-asis<filename>source/asis/asis-elements.adb
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
-- Purpose:
-- Procedural wrapper over Object-Oriented ASIS implementation
with XASIS.Utils;
package body Asis.Elements is
----------------------------
-- Access_Definition_Kind --
----------------------------
function Access_Definition_Kind
(Definition : Asis.Definition)
return Asis.Access_Definition_Kinds
is
begin
if Assigned (Definition) then
return Access_Definition_Kind (Definition.all);
else
return Not_An_Access_Definition;
end if;
end Access_Definition_Kind;
----------------------
-- Access_Type_Kind --
----------------------
function Access_Type_Kind
(Definition : in Asis.Access_Type_Definition)
return Asis.Access_Type_Kinds
is
begin
if Assigned (Definition) then
return Access_Type_Kind (Definition.all);
else
return Not_An_Access_Type_Definition;
end if;
end Access_Type_Kind;
----------------------
-- Association_Kind --
----------------------
function Association_Kind
(Association : in Asis.Association)
return Asis.Association_Kinds
is
begin
if Assigned (Association) then
return Association_Kind (Association.all);
else
return Not_An_Association;
end if;
end Association_Kind;
--------------------
-- Attribute_Kind --
--------------------
function Attribute_Kind
(Expression : in Asis.Expression)
return Asis.Attribute_Kinds
is
begin
if Assigned (Expression) then
return Attribute_Kind (Expression.all);
else
return Not_An_Attribute;
end if;
end Attribute_Kind;
-----------------
-- Clause_Kind --
-----------------
function Clause_Kind
(Clause : in Asis.Clause)
return Asis.Clause_Kinds
is
begin
if Assigned (Clause) then
return Clause_Kind (Clause.all);
else
return Not_A_Clause;
end if;
end Clause_Kind;
-------------------------
-- Compilation_Pragmas --
-------------------------
function Compilation_Pragmas
(Compilation_Unit : in Asis.Compilation_Unit)
return Asis.Pragma_Element_List
is
begin
Check_Nil_Unit (Compilation_Unit, "Compilation_Pragmas");
return Compilation_Pragmas (Compilation_Unit.all, True);
end Compilation_Pragmas;
---------------------------
-- Configuration_Pragmas --
---------------------------
function Configuration_Pragmas
(The_Context : in Asis.Context)
return Asis.Pragma_Element_List
is
begin
Check_Context (The_Context);
return Configuration_Pragmas (The_Context.all);
end Configuration_Pragmas;
---------------------
-- Constraint_Kind --
---------------------
function Constraint_Kind
(Definition : in Asis.Constraint)
return Asis.Constraint_Kinds
is
begin
if Assigned (Definition) then
return Constraint_Kind (Definition.all);
else
return Not_A_Constraint;
end if;
end Constraint_Kind;
-----------------------------
-- Context_Clause_Elements --
-----------------------------
function Context_Clause_Elements
(Compilation_Unit : in Asis.Compilation_Unit;
Include_Pragmas : in Boolean := False)
return Asis.Context_Clause_List
is
begin
Check_Nil_Unit (Compilation_Unit, "Context_Clause_Elements");
return Context_Clause_Elements (Compilation_Unit.all, Include_Pragmas);
end Context_Clause_Elements;
---------------------------
-- Corresponding_Pragmas --
---------------------------
function Corresponding_Pragmas
(Element : in Asis.Element)
return Asis.Pragma_Element_List
is
begin
Check_Nil_Element (Element, "Corresponding_Pragmas");
return Corresponding_Pragmas (Element.all, True);
end Corresponding_Pragmas;
-----------------
-- Debug_Image --
-----------------
function Debug_Image (Element : in Asis.Element) return Wide_String
renames XASIS.Utils.Debug_Image;
----------------------
-- Declaration_Kind --
----------------------
function Declaration_Kind
(Declaration : in Asis.Declaration)
return Asis.Declaration_Kinds
is
begin
if Assigned (Declaration) then
return Declaration_Kind (Declaration.all);
else
return Not_A_Declaration;
end if;
end Declaration_Kind;
------------------------
-- Declaration_Origin --
------------------------
function Declaration_Origin
(Declaration : in Asis.Declaration)
return Asis.Declaration_Origins
is
begin
if Assigned (Declaration) then
return Declaration_Origin (Declaration.all);
else
return Not_A_Declaration_Origin;
end if;
end Declaration_Origin;
------------------
-- Default_Kind --
------------------
function Default_Kind
(Declaration : in Asis.Generic_Formal_Parameter)
return Asis.Subprogram_Default_Kinds
is
begin
if Assigned (Declaration) then
return Default_Kind (Declaration.all);
else
return Not_A_Default;
end if;
end Default_Kind;
------------------------
-- Defining_Name_Kind --
------------------------
function Defining_Name_Kind
(Defining_Name : in Asis.Defining_Name)
return Asis.Defining_Name_Kinds
is
begin
if Assigned (Defining_Name) then
return Defining_Name_Kind (Defining_Name.all);
else
return Not_A_Defining_Name;
end if;
end Defining_Name_Kind;
---------------------
-- Definition_Kind --
---------------------
function Definition_Kind
(Definition : in Asis.Definition)
return Asis.Definition_Kinds
is
begin
if Assigned (Definition) then
return Definition_Kind (Definition.all);
else
return Not_A_Definition;
end if;
end Definition_Kind;
-------------------------
-- Discrete_Range_Kind --
-------------------------
function Discrete_Range_Kind
(Definition : in Asis.Discrete_Range)
return Asis.Discrete_Range_Kinds
is
begin
if Assigned (Definition) then
return Discrete_Range_Kind (Definition.all);
else
return Not_A_Discrete_Range;
end if;
end Discrete_Range_Kind;
------------------
-- Element_Kind --
------------------
function Element_Kind
(Element : in Asis.Element)
return Asis.Element_Kinds
is
begin
if Assigned (Element) then
return Element_Kind (Element.all);
else
return Not_An_Element;
end if;
end Element_Kind;
--------------------------------
-- Enclosing_Compilation_Unit --
--------------------------------
function Enclosing_Compilation_Unit
(Element : in Asis.Element)
return Asis.Compilation_Unit
is
begin
Check_Nil_Element (Element, "Enclosing_Compilation_Unit");
return Enclosing_Compilation_Unit (Element.all);
end Enclosing_Compilation_Unit;
-----------------------
-- Enclosing_Element --
-----------------------
function Enclosing_Element
(Element : in Asis.Element)
return Asis.Element
is
begin
Check_Nil_Element (Element, "Enclosing_Element");
return Enclosing_Element (Element.all);
end Enclosing_Element;
-----------------------
-- Enclosing_Element --
-----------------------
function Enclosing_Element
(Element : in Asis.Element;
Expected_Enclosing_Element : in Asis.Element)
return Asis.Element
is
begin
Check_Nil_Element (Element, "Enclosing_Element");
return Enclosing_Element (Element.all);
end Enclosing_Element;
---------------------
-- Expression_Kind --
---------------------
function Expression_Kind
(Expression : in Asis.Expression)
return Asis.Expression_Kinds
is
begin
if Assigned (Expression) then
return Expression_Kind (Expression.all);
else
return Not_An_Expression;
end if;
end Expression_Kind;
----------------------
-- Formal_Type_Kind --
----------------------
function Formal_Type_Kind
(Definition : in Asis.Formal_Type_Definition)
return Asis.Formal_Type_Kinds
is
begin
if Assigned (Definition) then
return Formal_Type_Definition_Kind (Definition.all);
else
return Not_A_Formal_Type_Definition;
end if;
end Formal_Type_Kind;
-----------------
-- Has_Limited --
-----------------
function Has_Limited (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Limited (Element.all);
else
return False;
end if;
end Has_Limited;
-----------------
-- Has_Private --
-----------------
function Has_Private (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Private (Element.all);
else
return False;
end if;
end Has_Private;
------------------
-- Has_Abstract --
------------------
function Has_Abstract (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Abstract (Element.all);
else
return False;
end if;
end Has_Abstract;
-----------------
-- Has_Reverse --
-----------------
function Has_Reverse (Element : in Asis.Element) return Boolean is
begin
return Trait_Kind (Element) = A_Reverse_Trait;
end Has_Reverse;
-----------------
-- Has_Aliased --
-----------------
function Has_Aliased (Element : in Asis.Element) return Boolean is
begin
return Trait_Kind (Element) = An_Aliased_Trait;
end Has_Aliased;
----------------------
-- Has_Synchronized --
----------------------
function Has_Synchronized (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Synchronized (Element.all);
else
return False;
end if;
end Has_Synchronized;
-------------------
-- Has_Protected --
-------------------
function Has_Protected (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Protected (Element.all);
else
return False;
end if;
end Has_Protected;
----------------
-- Has_Tagged --
----------------
function Has_Tagged (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Tagged (Element.all);
else
return False;
end if;
end Has_Tagged;
--------------
-- Has_Task --
--------------
function Has_Task (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Task (Element.all);
else
return False;
end if;
end Has_Task;
------------------------
-- Has_Null_Exclusion --
------------------------
function Has_Null_Exclusion (Element : Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Has_Null_Exclusion (Element.all);
else
return False;
end if;
end Has_Null_Exclusion;
----------
-- Hash --
----------
function Hash (Element : in Asis.Element) return Asis.ASIS_Integer is
begin
if Assigned (Element) then
return Hash (Element.all);
else
return 0;
end if;
end Hash;
--------------------
-- Interface_Kind --
--------------------
function Interface_Kind
(Definition : Asis.Definition)
return Asis.Interface_Kinds is
begin
if Assigned (Definition) then
if Type_Kind (Definition) = An_Interface_Type_Definition or
Formal_Type_Kind (Definition) =
A_Formal_Interface_Type_Definition
then
if Has_Task (Definition.all) then
return A_Task_Interface;
elsif Has_Limited (Definition.all) then
return A_Limited_Interface;
elsif Has_Protected (Definition.all) then
return A_Protected_Interface;
elsif Has_Synchronized (Definition.all) then
return A_Synchronized_Interface;
else
return An_Ordinary_Interface;
end if;
end if;
end if;
return Not_An_Interface;
end Interface_Kind;
----------------------------
-- Is_Abstract_Subprogram --
----------------------------
function Is_Abstract_Subprogram
(Element : in Asis.Element)
return Boolean
is
begin
case Declaration_Kind (Element) is
when A_Procedure_Declaration |
A_Function_Declaration |
A_Formal_Procedure_Declaration |
A_Formal_Function_Declaration =>
return Has_Abstract (Element.all);
when others =>
return False;
end case;
end Is_Abstract_Subprogram;
--------------
-- Is_Equal --
--------------
function Is_Equal
(Left : in Asis.Element;
Right : in Asis.Element)
return Boolean
renames Asis.Is_Equal;
------------------
-- Is_Identical --
------------------
function Is_Identical
(Left : in Asis.Element;
Right : in Asis.Element)
return Boolean
renames Asis.Is_Equal;
------------
-- Is_Nil --
------------
function Is_Nil (Right : in Asis.Element) return Boolean is
begin
return not Assigned (Right);
end Is_Nil;
------------
-- Is_Nil --
------------
function Is_Nil (Right : in Asis.Element_List) return Boolean is
begin
return Right'Length = 0;
end Is_Nil;
-----------------------
-- Is_Null_Procedure --
-----------------------
function Is_Null_Procedure (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
if Declaration_Kind (Element) = A_Formal_Procedure_Declaration then
return Expression_Kind (Formal_Subprogram_Default (Element.all))
= A_Null_Literal;
else
return Is_Null_Procedure (Element.all);
end if;
else
return False;
end if;
end Is_Null_Procedure;
-------------------------
-- Is_Part_Of_Implicit --
-------------------------
function Is_Part_Of_Implicit (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Is_Part_Of_Implicit (Element.all);
else
return False;
end if;
end Is_Part_Of_Implicit;
--------------------------
-- Is_Part_Of_Inherited --
--------------------------
function Is_Part_Of_Inherited
(Element : in Asis.Element)
return Boolean
is
begin
if Assigned (Element) then
return Is_Part_Of_Inherited (Element.all);
else
return False;
end if;
end Is_Part_Of_Inherited;
-------------------------
-- Is_Part_Of_Instance --
-------------------------
function Is_Part_Of_Instance (Element : in Asis.Element) return Boolean is
begin
if Assigned (Element) then
return Is_Part_Of_Instance (Element.all);
else
return False;
end if;
end Is_Part_Of_Instance;
---------------
-- Mode_Kind --
---------------
function Mode_Kind
(Declaration : in Asis.Declaration)
return Asis.Mode_Kinds
is
begin
if Assigned (Declaration) then
return Mode_Kind (Declaration.all);
else
return Not_A_Mode;
end if;
end Mode_Kind;
-------------------
-- Operator_Kind --
-------------------
function Operator_Kind
(Element : in Asis.Element)
return Asis.Operator_Kinds
is
begin
if Assigned (Element) then
return Operator_Kind (Element.all);
else
return Not_An_Operator;
end if;
end Operator_Kind;
---------------
-- Path_Kind --
---------------
function Path_Kind (Path : in Asis.Path) return Asis.Path_Kinds is
begin
if Assigned (Path) then
return Path_Kind (Path.all);
else
return Not_A_Path;
end if;
end Path_Kind;
----------------------------------
-- Pragma_Argument_Associations --
----------------------------------
function Pragma_Argument_Associations
(Pragma_Element : in Asis.Pragma_Element)
return Asis.Association_List
is
begin
Check_Nil_Element (Pragma_Element, "Pragma_Argument_Associations");
return Pragma_Argument_Associations (Pragma_Element.all);
end Pragma_Argument_Associations;
-----------------
-- Pragma_Kind --
-----------------
function Pragma_Kind
(Pragma_Element : in Asis.Pragma_Element)
return Asis.Pragma_Kinds
is
begin
if Assigned (Pragma_Element) then
return Pragma_Kind (Pragma_Element.all);
else
return Not_A_Pragma;
end if;
end Pragma_Kind;
-----------------------
-- Pragma_Name_Image --
-----------------------
function Pragma_Name_Image
(Pragma_Element : in Asis.Pragma_Element)
return Program_Text
is
begin
Check_Nil_Element (Pragma_Element, "Pragma_Name_Image");
return Pragma_Name_Image (Pragma_Element.all);
end Pragma_Name_Image;
-------------
-- Pragmas --
-------------
function Pragmas
(The_Element : in Asis.Element)
return Asis.Pragma_Element_List
is
begin
Check_Nil_Element (The_Element, "Pragmas");
return Pragmas (The_Element.all);
end Pragmas;
--------------------------------
-- Representation_Clause_Kind --
--------------------------------
function Representation_Clause_Kind
(Clause : in Asis.Representation_Clause)
return Asis.Representation_Clause_Kinds
is
begin
if Assigned (Clause) then
return Representation_Clause_Kind (Clause.all);
else
return Not_A_Representation_Clause;
end if;
end Representation_Clause_Kind;
--------------------
-- Root_Type_Kind --
--------------------
function Root_Type_Kind
(Definition : in Asis.Root_Type_Definition)
return Asis.Root_Type_Kinds
is
begin
if Assigned (Definition) then
return Root_Type_Kind (Definition.all);
else
return Not_A_Root_Type_Definition;
end if;
end Root_Type_Kind;
--------------------
-- Statement_Kind --
--------------------
function Statement_Kind
(Statement : in Asis.Statement)
return Asis.Statement_Kinds
is
begin
if Assigned (Statement) then
return Statement_Kind (Statement.all);
else
return Not_A_Statement;
end if;
end Statement_Kind;
----------------
-- Trait_Kind --
----------------
function Trait_Kind
(Element : in Asis.Element)
return Asis.Trait_Kinds
is
begin
if Assigned (Element) then
return Trait_Kind (Element.all);
else
return Not_A_Trait;
end if;
end Trait_Kind;
---------------
-- Type_Kind --
---------------
function Type_Kind
(Definition : in Asis.Type_Definition)
return Asis.Type_Kinds
is
begin
if Assigned (Definition) then
return Type_Definition_Kind (Definition.all);
else
return Not_A_Type_Definition;
end if;
end Type_Kind;
----------------------
-- Unit_Declaration --
----------------------
function Unit_Declaration
(Compilation_Unit : in Asis.Compilation_Unit)
return Asis.Declaration
is
begin
Check_Nil_Unit (Compilation_Unit, "Unit_Declaration");
return Unit_Declaration (Compilation_Unit.all);
end Unit_Declaration;
end Asis.Elements;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, <NAME>
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the <NAME>, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
src/main/antlr/br/com/dillmann/restdb/core/filterDsl/FilterDsl.g4
|
lucasdillmann/restdb
| 2 |
2143
|
<reponame>lucasdillmann/restdb
grammar FilterDsl;
@header {
package br.com.dillmann.restdb.core.filterDsl;
}
root: group (logicalOperator group)* EOF;
group: expressions | '(' group (logicalOperator group)* ')';
expressions: expression (logicalOperator expression)*;
expression: columnName '.' operation ('[' parameters ']')?;
columnName: SQL_COLUMN_NAME;
operation
: 'equals'
| 'notEquals'
| 'lessThan'
| 'lessOrEquals'
| 'biggerThan'
| 'biggerOrEquals'
| 'between'
| 'notBetween'
| 'in'
| 'notIn'
| 'like'
| 'notLike'
| 'isNull'
| 'isNotNull'
| 'isEmpty'
| 'isNotEmpty';
parameters: parameter (',' parameter)*;
parameter: (parameterNumericValue | parameterStringValue);
parameterStringValue: PARAMETER_STRING_VALUE;
parameterNumericValue: PARAMETER_NUMERIC_VALUE;
logicalOperator: '&&' | '||';
PARAMETER_NUMERIC_VALUE: ('-')?[0-9]+('.'[0-9]+)*;
PARAMETER_STRING_VALUE: '"' (~('"' | '\\' | '\r' | '\n') | '\\' ('"' | '\\'))+ '"';
SQL_COLUMN_NAME: [A-Za-z0-9_]+;
WS: [ \t\r\n]+ -> skip;
|
src/scanners.ads
|
aeszter/lox-spark
| 6 |
1484
|
<reponame>aeszter/lox-spark
with Ada.Characters.Latin_1;
with SPARK.Text_IO;
with Error_Reporter;
with Tokens;
package Scanners with SPARK_Mode is
procedure Scan_Tokens (Source : String; Token_List : in out Tokens.List) with
Global => (in_out => (Error_Reporter.State, SPARK.Text_IO.Standard_Error)),
Pre => Source'First >= 1 and then Source'Last < Integer'Last;
LF : constant Character := Ada.Characters.Latin_1.LF;
NUL : constant Character := Ada.Characters.Latin_1.NUL;
CR : constant Character := Ada.Characters.Latin_1.CR;
HT : constant Character := Ada.Characters.Latin_1.HT;
function Is_Alphanumeric (C : Character) return Boolean with
Global => null,
Post => (if Is_Alphanumeric'Result then C /= NUL);
function Is_Decimal_Digit (C : Character) return Boolean with
Global => null,
Post => (if Is_Decimal_Digit'Result then C /= NUL);
function Is_Letter (C : Character) return Boolean with
Global => null,
Post => (if Is_Letter'Result then C /= NUL);
end Scanners;
|
data/jpred4/jp_batch_1613899824__LNZWxg8/jp_batch_1613899824__LNZWxg8.als
|
jonriege/predict-protein-structure
| 0 |
1829
|
SILENT_MODE
BLOCK_FILE jp_batch_1613899824__LNZWxg8.concise.blc
MAX_NSEQ 841
MAX_INPUT_LEN 843
OUTPUT_FILE jp_batch_1613899824__LNZWxg8.concise.ps
PORTRAIT
POINTSIZE 8
IDENT_WIDTH 12
X_OFFSET 2
Y_OFFSET 2
DEFINE_FONT 0 Helvetica DEFAULT
DEFINE_FONT 1 Helvetica REL 0.75
DEFINE_FONT 7 Helvetica REL 0.6
DEFINE_FONT 3 Helvetica-Bold DEFAULT
DEFINE_FONT 4 Times-Bold DEFAULT
DEFINE_FONT 5 Helvetica-BoldOblique DEFAULT
#
DEFINE_COLOUR 3 1 0.62 0.67 # Turquiose
DEFINE_COLOUR 4 1 1 0 # Yellow
DEFINE_COLOUR 5 1 0 0 # Red
DEFINE_COLOUR 7 1 0 1 # Purple
DEFINE_COLOUR 8 0 0 1 # Blue
DEFINE_COLOUR 9 0 1 0 # Green
DEFINE_COLOUR 10 0.41 0.64 1.00 # Pale blue
DEFINE_COLOUR 11 0.41 0.82 0.67 # Pale green
DEFINE_COLOUR 50 0.69 0.18 0.37 # Pink (helix)
DEFINE_COLOUR 51 1.00 0.89 0.00 # Gold (strand)
NUMBER_INT 10
SETUP
#
# Highlight specific residues.
# Avoid highlighting Lupas 'C' predictions by
# limiting the highlighting to the alignments
Scol_CHARS C 1 1 152 830 4
Ccol_CHARS H ALL 5
Ccol_CHARS P ALL 8
SURROUND_CHARS LIV ALL
#
# Replace known structure types with whitespace
SUB_CHARS 1 831 152 840 H SPACE
SUB_CHARS 1 831 152 840 E SPACE
SUB_CHARS 1 831 152 840 - SPACE
STRAND 10 834 15
COLOUR_TEXT_REGION 10 834 15 834 51
STRAND 25 834 29
COLOUR_TEXT_REGION 25 834 29 834 51
STRAND 41 834 49
COLOUR_TEXT_REGION 41 834 49 834 51
STRAND 62 834 70
COLOUR_TEXT_REGION 62 834 70 834 51
STRAND 111 834 120
COLOUR_TEXT_REGION 111 834 120 834 51
STRAND 133 834 136
COLOUR_TEXT_REGION 133 834 136 834 51
HELIX 142 834 148
COLOUR_TEXT_REGION 142 834 148 834 50
STRAND 9 839 15
COLOUR_TEXT_REGION 9 839 15 839 51
STRAND 25 839 29
COLOUR_TEXT_REGION 25 839 29 839 51
STRAND 41 839 50
COLOUR_TEXT_REGION 41 839 50 839 51
STRAND 62 839 69
COLOUR_TEXT_REGION 62 839 69 839 51
STRAND 88 839 90
COLOUR_TEXT_REGION 88 839 90 839 51
STRAND 112 839 120
COLOUR_TEXT_REGION 112 839 120 839 51
STRAND 133 839 136
COLOUR_TEXT_REGION 133 839 136 839 51
HELIX 142 839 148
COLOUR_TEXT_REGION 142 839 148 839 50
STRAND 10 840 15
COLOUR_TEXT_REGION 10 840 15 840 51
STRAND 25 840 29
COLOUR_TEXT_REGION 25 840 29 840 51
STRAND 41 840 45
COLOUR_TEXT_REGION 41 840 45 840 51
STRAND 62 840 70
COLOUR_TEXT_REGION 62 840 70 840 51
STRAND 107 840 120
COLOUR_TEXT_REGION 107 840 120 840 51
STRAND 132 840 136
COLOUR_TEXT_REGION 132 840 136 840 51
HELIX 141 840 148
COLOUR_TEXT_REGION 141 840 148 840 50
|
change_calculator.adb
|
kylelk/ada-examples
| 1 |
16815
|
with Ada.Text_IO;
with Ada.Float_Text_IO;
with Ada.IO_Exceptions;
with Ada.Integer_Text_IO;
use Ada;
procedure Change_Calculator is
type Money is delta 0.01 digits 10;
Input_Amount : Money := 0.0;
package Money_IO is new Text_IO.Decimal_IO(Money);
type Currency_Denomination is record
Name : String(1..10);
Value : Money;
end record;
Currency_Names : array (1..10) of Currency_Denomination;
Currency_Counts : array (1..10) of Integer := (others=>0);
Currency_Index : Integer range 1..10;
procedure Get_Money_Prompt(Amount: out Money) is
Response : String(1..20);
Last : Natural;
begin
loop
declare
begin
Text_IO.Put("amount: ");
Text_IO.Flush;
Text_IO.Get_Line(Response, Last);
-- try to convert string input to money type
Amount := Money'Value(Response(1 .. Last));
-- quit the loop if the money converted
exit;
exception
when Constraint_Error =>
Text_IO.Put_Line("ERROR: bad money format");
end;
end loop;
end Get_Money_Prompt;
begin
Currency_Names := (("Penny ", 0.01),
("Nickle ", 0.05),
("Dime ", 0.10),
("Quarter ", 0.25),
("Dollar ", 1.00),
("5 Dollar ", 5.00),
("10 Dollar ", 10.00),
("20 Dollar ", 20.00),
("50 Dollar ", 50.00),
("100 Dollar", 100.00));
loop
-- read money amount from the user
Get_Money_Prompt(Input_Amount);
-- calculate needed currency
for I in Currency_Names'Range loop
-- calculate inverse of index to count backwords
Currency_Index := (Currency_Names'Length-I)+1;
while Input_Amount >= Currency_Names(Currency_Index).Value loop
Input_Amount := Input_Amount - Currency_Names(Currency_Index).Value;
-- increment currency useage in array
Currency_Counts(I) := Currency_Counts(I) + 1;
end loop;
end loop;
-- display needed currency
for I in Currency_Counts'Range loop
Currency_Index := (Currency_Names'Length-I)+1;
-- do not display unused currency
if Currency_Counts(Currency_Index) /= 0 then
Text_IO.Put(Currency_Names(I).Name & " ");
Integer_Text_IO.Put(Currency_Counts(Currency_Index));
Text_IO.New_Line;
end if;
end loop;
end loop;
end Change_Calculator;
|
other.7z/SFC.7z/SFC/ソースデータ/ヨッシーアイランド/ツール/tool/cos2/chip/ys_msge0.asm
|
prismotizm/gigaleak
| 0 |
244114
|
<gh_stars>0
Name: ys_msge0.asm
Type: file
Size: 151156
Last-Modified: '2016-05-13T04:52:56Z'
SHA-1: 90C3DB48333DC0C943D7FABAC9CD0CF5D69F5B63
Description: null
|
reloadActiveFirefoxTab.applescript
|
dragdropsite/BrowserAutoRefresh
| 6 |
1503
|
tell application "Firefox"
activate
end tell
tell application "System Events"
tell process "Firefox"
keystroke "r" using {command down}
end tell
end tell
#tell application "Sublime Text 2"
# activate
#end tell
|
bluemag/src/main/antlr4/BluemagAntlr.g4
|
stivenramireza/compiler-languages
| 1 |
7098
|
grammar BluemagAntlr;
@header{
package co.edu.eafit.dis.st0270.s2017.bluemag.parser;
}
gramManRec:manRec EOF
;
manRec:declaraciones instrucciones
;
declaraciones:('clase' ID ENTERO ';')+
;
instrucciones: instruccion*
;
instruccion:'solicitar' ID restInstruccion
|bloque
|asignacion
|condicional
|ciclo
;
restInstruccion:'cuando' exprAnd bloque
| bloque
;
bloque: '{' restBloque
;
restBloque:declVars instrucciones '}'
| instrucciones '}'
;
asignacion: VARID '<-' exprAnd ';'
;
condicional: 'si' exprAnd 'ent' instruccion restCondicional
;
restCondicional:'sino' instruccion 'finsi'
|'finsi'
;
ciclo: 'mientras' exprAnd 'hacer' instruccion
;
declVars:'|' VARID+ '|'
;
/*AND='y'*/
exprAnd:exprMenIgual restExprAndPR
;
restExprAnd:'y' exprMenIgual restExprAndPR
;
restExprAndPR:restExprAnd
|
;
/*MenIgual='<='*/
exprMenIgual:exprIgual restExprMenIgualPR
;
restExprMenIgual:'<=' exprIgual restExprMenIgualPR
;
restExprMenIgualPR:restExprMenIgual
|
;
/*Igual='='*/
exprIgual:exprSum restExprIgualPR
;
restExprIgual: '=' exprSum restExprIgualPR
;
restExprIgualPR: restExprIgual
|
;
/*sum='+'*/
exprSum:exprMul restExprSumPR
;
restExprSum:'+' exprMul restExprSumPR
;
restExprSumPR:restExprSum
|
;
/*mult='*' */
exprMul: negation restExprMulPR
;
restExprMul:'*' negation restExprMulPR
;
restExprMulPR: restExprMul
|
;
/*Negation:'no'*/
negation: 'no' factor
| factor
;
factor:VARID
|ENTERO
|BOOLEANO
|'('exprAnd')'
;
VARID: ('a'..'z')(('a'..'z') | ('A'..'Z') | ('0'..'9'))*
;
ID:('A'..'Z')(('a'..'z') | ('A'..'Z') | ('0'..'9'))*
;
BOOLEANO: 'verdad'
| 'falso'
;
ENTERO: (('1'..'9')('0'..'9')* | '0')
;
WS: ( ' ' | '\t' | '\n' | '\r' ) + {skip(); }
;
|
pre/mips/matrix_transform.asm
|
t0ush1/ComputerOrganization
| 2 |
27811
|
<gh_stars>1-10
.data
array: .space 30000 #int array[2500][3]
space: .asciiz " "
line: .asciiz "\n"
.macro readInt(%x) #i nput int -> $x
li $v0, 5
syscall
move %x, $v0
.end_macro
.macro writeInt(%x) #output int $x
move $a0, %x
li $v0, 1
syscall
.end_macro
.macro writeString(%s) #output string $s
la $a0, %s
li $v0, 4
syscall
.end_macro
.macro getOffset(%i, %off) #%off = %i * sizeof(array[0])
li %off 12
mult %i, %off
mflo %off
.end_macro
.text
readInt($t0) #input n -> $t0
readInt($t1) #input m -> $t1
li $t2, 0 #cnt = 0 -> $t2
#for (int i = 0; i < n; i ++)
li $t3, 0 #i = 0 -> $t3
for_1_begin:
bge $t3, $t0, for_1_end #i < n
#for (int j = 0; j < m; j ++)
li $t4, 0 #j = 0 -> $t4
for_2_begin:
bge $t4, $t1, for_2_end #j < m
readInt($t5) #input a -> $t5
beq $t5, $zero, if_1_end #if (a != 0)
getOffset($t2, $t6) #array[cnt][0] = i + 1
addi $t7, $t3, 1
sw $t7, array($t6)
addi $t6, $t6, 4 #array[cnt][1] = j + 1
addi $t7, $t4, 1
sw $t7, array($t6)
addi $t6, $t6, 4 #array[cnt][2] = a
sw $t5, array($t6)
addi $t2, $t2, 1 #cnt ++
if_1_end:
addi $t4, $t4, 1 #j ++
j for_2_begin
for_2_end:
addi $t3, $t3, 1 #i ++
j for_1_begin
for_1_end:
while_1_begin: #while (cnt > 0)
ble $t2, $zero, while_1_end
subi $t2, $t2, 1 #cnt --
getOffset($t2, $t0) #output array[cnt][0]
lw $t1, array($t0)
writeInt($t1)
writeString(space)
addi $t0, $t0, 4 #output array[cnt][1]
lw $t1, array($t0)
writeInt($t1)
writeString(space)
addi $t0, $t0, 4 #output array[cnt][2]
lw $t1, array($t0)
writeInt($t1)
writeString(line)
j while_1_begin
while_1_end:
li $v0, 10 #end
syscall
|
test/ir/regSpill.asm
|
shivansh/gogo
| 24 |
102767
|
# Test to demonstrate register spilling via next-use heuristic.
.data
v1: .word 0
v2: .word 0
v3: .word 0
v4: .word 0
v5: .word 0
v6: .word 0
v7: .word 0
.text
runtime:
addi $sp, $sp, -4
sw $ra, 0($sp)
lw $ra, 0($sp)
addi $sp, $sp, 4
jr $ra
.end runtime
.globl main
.ent main
main:
li $3, -1 # v1 -> $3
sw $3, v1 # spilled v1, freed $3
li $3, 2 # v2 -> $3
sw $3, v2 # spilled v2, freed $3
li $3, -12 # v1 -> $3
sw $3, v1 # spilled v1, freed $3
li $3, 3 # v3 -> $3
li $5, 4 # v4 -> $5
li $6, 5 # v5 -> $6
move $6, $5 # v5 -> $6
add $6, $5, $3
sw $6, v5 # spilled v5, freed $6
li $6, 5 # v6 -> $6
sw $6, v6 # spilled v6, freed $6
li $6, 5 # v7 -> $6
sw $3, v3
sw $5, v4
sw $6, v7
jal temp
lw $3, v3
lw $5, v4
lw $6, v7
# Store dirty variables back into memory
li $2, 10
syscall
.end main
temp:
addi $sp, $sp, -4
sw $ra, 0($sp)
li $3, 1 # v1 -> $3
# Store dirty variables back into memory
sw $3, v1
unsat:
li $3, 4 # v4 -> $3
lw $2, v1
# Store dirty variables back into memory
sw $3, v4
lw $ra, 0($sp)
addi $sp, $sp, 4
jr $ra
.end temp
|
programs/oeis/239/A239443.asm
|
jmorken/loda
| 1 |
26560
|
; A239443: a(n) = phi(n^9), where phi = A000010.
; 1,256,13122,131072,1562500,3359232,34588806,67108864,258280326,400000000,2143588810,1719926784,9788768652,8854734336,20503125000,34359738368,111612119056,66119763456,305704134738,204800000000,453874312332,548758735360,1722841676182,880602513408,3051757812500,2505924774912,5083731656658,4533623980032,14006899562908,5248800000000,25586731123230,17592186044416,28128172364820,28572702478336,54045009375000,33853318889472,126449260341156,78260258492928,128448222251544,104857600000000,319397009164840,116191823956992,490904411659242,280964472504320,403563009375000,441047469102592,1095319186441006,450868486864896,1395783083923242,781250000000000,1464574226252832,1283033484754944,3237503901390772,1301435304104448,3349357515625000,2321215477776384,4011449656032036,3585766288104448,8516165381050618,2687385600000000
mov $3,$0
add $3,1
sub $2,$3
mul $2,2
pow $2,4
cal $0,10 ; Euler totient function phi(n): count numbers <= n and prime to n.
add $1,$0
mul $1,$2
mul $1,$2
div $1,64
sub $1,3
div $1,4
add $1,1
|
Transynther/x86/_processed/NONE/_zr_/i9-9900K_12_0xca.log_21829_720.asm
|
ljhsiun2/medusa
| 9 |
98406
|
<gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r14
push %r8
push %r9
lea addresses_WC_ht+0x15cbf, %r11
clflush (%r11)
nop
nop
nop
nop
nop
add $53350, %r8
movb (%r11), %r14b
nop
nop
nop
sub %r11, %r11
lea addresses_D_ht+0xfa3f, %r10
nop
nop
nop
xor $35394, %r14
movw $0x6162, (%r10)
sub %r14, %r14
lea addresses_WT_ht+0x1e239, %r8
clflush (%r8)
cmp $12018, %r11
movw $0x6162, (%r8)
nop
nop
nop
add %r8, %r8
lea addresses_WT_ht+0x134b7, %r9
nop
nop
nop
nop
cmp $45582, %r14
movl $0x61626364, (%r9)
dec %r9
pop %r9
pop %r8
pop %r14
pop %r11
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r13
push %r15
push %rbp
push %rdx
push %rsi
// Store
lea addresses_WT+0xaea5, %r15
nop
nop
nop
add %rbp, %rbp
mov $0x5152535455565758, %r11
movq %r11, %xmm3
movups %xmm3, (%r15)
nop
nop
nop
nop
add $804, %r13
// Store
lea addresses_WT+0x1743f, %r11
nop
nop
nop
nop
dec %rsi
mov $0x5152535455565758, %rdx
movq %rdx, (%r11)
nop
nop
nop
nop
nop
cmp $3722, %r12
// Store
lea addresses_US+0xf8bf, %rbp
nop
add %r11, %r11
movw $0x5152, (%rbp)
nop
nop
nop
cmp $35933, %rdx
// Store
lea addresses_UC+0xc8bf, %r13
clflush (%r13)
nop
nop
nop
cmp %rsi, %rsi
mov $0x5152535455565758, %rbp
movq %rbp, (%r13)
nop
nop
nop
nop
nop
xor %rsi, %rsi
// Load
lea addresses_RW+0xeb17, %rbp
nop
nop
nop
nop
cmp %r15, %r15
mov (%rbp), %rdx
nop
add %r11, %r11
// Faulty Load
lea addresses_WT+0x54bf, %rbp
nop
nop
nop
sub %r15, %r15
mov (%rbp), %r11
lea oracles, %r13
and $0xff, %r11
shlq $12, %r11
mov (%r13,%r11,1), %r11
pop %rsi
pop %rdx
pop %rbp
pop %r15
pop %r13
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_WT', 'same': False, 'AVXalign': True, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'size': 16, 'NT': False, 'type': 'addresses_WT', 'same': False, 'AVXalign': False, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'size': 8, 'NT': False, 'type': 'addresses_WT', 'same': False, 'AVXalign': False, 'congruent': 3}}
{'OP': 'STOR', 'dst': {'size': 2, 'NT': False, 'type': 'addresses_US', 'same': False, 'AVXalign': False, 'congruent': 10}}
{'OP': 'STOR', 'dst': {'size': 8, 'NT': False, 'type': 'addresses_UC', 'same': False, 'AVXalign': True, 'congruent': 10}}
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_RW', 'same': False, 'AVXalign': False, 'congruent': 3}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'size': 8, 'NT': False, 'type': 'addresses_WT', 'same': True, 'AVXalign': False, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'size': 1, 'NT': False, 'type': 'addresses_WC_ht', 'same': False, 'AVXalign': False, 'congruent': 11}}
{'OP': 'STOR', 'dst': {'size': 2, 'NT': False, 'type': 'addresses_D_ht', 'same': False, 'AVXalign': False, 'congruent': 7}}
{'OP': 'STOR', 'dst': {'size': 2, 'NT': False, 'type': 'addresses_WT_ht', 'same': False, 'AVXalign': False, 'congruent': 1}}
{'OP': 'STOR', 'dst': {'size': 4, 'NT': False, 'type': 'addresses_WT_ht', 'same': False, 'AVXalign': False, 'congruent': 3}}
{'00': 21829}
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
*/
|
programs/oeis/060/A060577.asm
|
neoneye/loda
| 22 |
3537
|
<gh_stars>10-100
; A060577: Number of homeomorphically irreducible general graphs on 2 labeled nodes and with n edges.
; 1,1,4,6,11,17,24,32,41,51,62,74,87,101,116,132,149,167,186,206,227,249,272,296,321,347,374,402,431,461,492,524,557,591,626,662,699,737,776,816,857,899,942,986,1031,1077,1124,1172,1221,1271,1322,1374,1427
add $0,2
mov $1,4
div $1,$0
bin $0,2
mul $1,2
add $0,$1
sub $0,4
|
source/adam-any.adb
|
charlie5/aIDE
| 3 |
23107
|
with
ada.Containers.Vectors;
package body AdaM.Any
is
package view_resolver_Vectors is new ada.Containers.Vectors (Positive, view_Resolver);
all_Resolvers : view_resolver_Vectors.Vector;
procedure register_view_Resolver (the_Resolver : in view_Resolver)
is
begin
all_Resolvers.append (the_resolver);
end register_view_Resolver;
procedure resolve_all_Views
is
use view_resolver_Vectors;
Cursor : view_resolver_Vectors.Cursor := all_Resolvers.First;
begin
while has_Element (Cursor)
loop
Element (Cursor).all;
next (Cursor);
end loop;
end resolve_all_Views;
end AdaM.Any;
|
dsl-parser/src/main/antlr4/com/mattunderscore/specky/parser/SpeckyLexer.g4
|
mattunderscorechampion/specky
| 0 |
5322
|
/* Copyright © 2016 <NAME>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of mattunderscore.com 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 MATTHEW CHAMPION 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. */
lexer grammar SpeckyLexer;
fragment
UpperCaseLetter
: [A-Z]
;
fragment
Letter
: [a-zA-Z$_]
| ~[\u0000-\u007F\uD800-\uDBFF]
{Character.isJavaIdentifierStart(_input.LA(-1))}?
| [\uD800-\uDBFF] [\uDC00-\uDFFF]
{Character.isJavaIdentifierStart(Character.toCodePoint((char)_input.LA(-2), (char)_input.LA(-1)))}?
;
fragment
LetterOrDigit
: [a-zA-Z0-9$_] // these are the "java letters or digits" below 0x7F
| ~[\u0000-\u007F\uD800-\uDBFF]
{Character.isJavaIdentifierPart(_input.LA(-1))}?
| [\uD800-\uDBFF] [\uDC00-\uDFFF]
{Character.isJavaIdentifierPart(Character.toCodePoint((char)_input.LA(-2), (char)_input.LA(-1)))}?
;
SECTION
: 'section'
;
LICENCE
: 'licence'
;
VALUE
: 'value'
;
BEAN
: 'bean'
;
TYPE
: 'type'
;
CONSTRUCTOR
: 'constructor'
;
MUTABLE_BUILDER
: 'builder'
;
IMMUTABLE_BUILDER
: 'immutable builder'
;
FROM_DEFAULTS
: 'from defaults'
;
WITH_MODIFICATION
: 'with modification'
;
OPTIONAL
: 'optional'
;
OPEN_TYPE_PARAMETERS
: '<'
;
CLOSE_TYPE_PARAMETERS
: '>'
;
PACKAGE
: 'package'
;
PACKAGE_SEPARATOR
: '.'
;
DEFAULT
: 'default' -> pushMode(LITERAL)
;
OPTIONS
: 'options'
;
EXTENDS
: ':'
;
IMPORT
: 'imports'
;
PROPERTIES
: 'properties'
;
AUTHOR
: 'author'
;
COPYRIGHT_HOLDER
: 'copyright holder'
;
NOTE
: 'note'
;
INLINE_WS
: [ ]+ -> channel(HIDDEN)
;
LINE_BREAK
: ('\n' | '\r\n') -> channel(HIDDEN)
;
LINE_COMMENT
: '//' ~[\r\n]* -> skip
;
QUALIFIED_NAME
: Letter LetterOrDigit* (PACKAGE_SEPARATOR LetterOrDigit+)+
;
Identifier
: Letter LetterOrDigit*
;
INLINE_EXPRESSION
: '[' -> more, pushMode(EXPRESSION_MODE)
;
STRING_START
: '"' -> more, pushMode(STR)
;
MULTILINE_STRING_START
: '"""' -> more, pushMode(ML_STR)
;
mode EXPRESSION_MODE;
CONSTRAINT_EXPRESSION
: 'constraint' -> mode(CONSTRAINT_MODE)
;
DEFAULT_EXPRESSION
: 'default' -> mode(VALUE_MODE)
;
mode STR;
STR_ESCAPED_TEXT
: '\\[\\"]' -> more
;
STRING_LITERAL
: '"' -> popMode
;
STR_TEXT
: ~[\r\n] -> more
;
mode ML_STR;
ML_STR_ESCAPED_TEXT
: '\\[\\"]' -> more
;
MULTILINE_STRING_LITERAL
: '"""' -> popMode
;
ML_STR_TEXT
: . -> more
;
mode LITERAL;
LITERAL_INLINE_WS
: [ ]+ -> channel(HIDDEN)
;
ANYTHING
: ~[ \t\r\n\u000C]+ -> popMode
;
mode VALUE_MODE;
VALUE_IDENTIFIER
: Letter LetterOrDigit*
;
VALUE_REAL_LITERAL
: ('+'|'-')? [0-9]* '.' [0-9]+
;
VALUE_INTEGER_LITERAL
: ('+'|'-')? [0-9]+
;
VALUE_STRING_START
: '"' -> more, pushMode(STR)
;
VALUE_OPEN_PARAMETER
: '('
;
VALUE_PARAMETER_SEPARATOR
: ','
;
VALUE_CLOSE_PARAMETER
: ')'
;
VALUE_MEMBER_ACCESSOR
: '.'
;
VALUE_END
: ']' -> popMode
;
VALUE_INLINE_WS
: [ ]+ -> channel(HIDDEN)
;
mode CONSTRAINT_MODE;
CONSTRAINT_INLINE_WS
: [ ]+ -> channel(HIDDEN)
;
GREATER_THAN_OR_EQUAL
: '>='
;
LESS_THAN_OR_EQUAL
: '<='
;
GREATER_THAN
: '>'
;
LESS_THAN
: '<'
;
CONJUNCTION
: '&'
;
DISJUNCTION
: '|'
;
SIZE_OF
: '#'
;
HAS_SOME
: 'e'
;
REAL_LITERAL
: ('+'|'-')? [0-9]* '.' [0-9]+
;
INTEGER_LITERAL
: ('+'|'-')? [0-9]+
;
PROPERTY
: '.'
;
CONSTRAINT_STRING_START
: '"' -> more, pushMode(STR)
;
NEGATION
: '!'
;
OPEN_PARENTHESIS
: '('
;
CLOSE_PARENTHESIS
: ')'
;
EQUAL_TO
: '='
;
CONSTRAINT_IDENTIFIER
: Letter LetterOrDigit*
;
CONSTRAINT_END
: ']' -> popMode
;
|
iictl.adb
|
byllgrim/iictl
| 0 |
2100
|
<reponame>byllgrim/iictl
-- See LICENSE file for cc0 license details
with Ada.Command_Line;
with Ada.Directories;
with Ada.Exceptions; use Ada.Exceptions; -- TODO remove
with Ada.Strings.Unbounded;
with Ada.Text_Io;
with Ch_Conn;
with Posix.Io;
with Posix.Process_Identification;
with Posix.User_Database;
with Srv_Conn;
with Srv_Quit;
with Util;
-- TODO check unused withs
package body Iictl is
package ACL renames Ada.Command_Line;
package ASU renames Ada.Strings.Unbounded;
package ATIO renames Ada.Text_Io;
package PIO renames Posix.Io;
package PPI renames Posix.Process_Identification;
package PUD renames Posix.User_Database;
-- TODO remove unused renames
Irc_Dir : ASU.Unbounded_String;
-- TODO different directories for different servers?
Nick : ASU.Unbounded_String;
-- TODO package globals in .ads?
procedure Iictl is
begin
Parse_Options;
-- TODO set file offset to end of channel outs?
if ASU.Length (Nick) = 0 then
ATIO.Put_Line ("No nick given");
-- TODO Print_Usage;
return;
end if;
Util.Verbose_Print ("Iictl: started");
Util.Verbose_Print ("Nick = " & ASU.To_String (Nick));
Util.Verbose_Print ("Irc_Dir = " & ASU.To_String (Irc_Dir));
loop
Srv_Conn.Reconnect_Servers (ASU.To_String (Irc_Dir),
ASU.To_String (Nick));
-- TODO rename Server_Reconnection, Connection_Ctrl, ...
Ch_Conn.Rejoin_Channels (ASU.To_String (Irc_Dir));
-- TODO rename Rejoin_Ctl or something
Srv_Quit.Detect_Quits (ASU.To_String (Irc_Dir));
-- TODO make Irc_Dir accessible from e.g. Iictl?
-- TODO Ch_Conn.Detect_Parts;
Delay 1.0; -- TODO remove? speed up? ravenclaw!
end loop;
end Iictl;
procedure Parse_Options is
I : Integer := 1;
begin
Irc_Dir := Default_Irc_Dir;
-- TODO same opts as ii?
-- [-i <irc dir>] [-s <host>] [-p <port>]
-- [-n <nick>] [-k <password>] [-f <fullname>]
-- TODO move to Util
-- TODO refactor to separate subprogram TODO move to Main
-- TODO initialize I more locally
while I <= ACL.Argument_Count loop
begin
if ACL.Argument (I) = "-n" then
I := I + 1;
Nick := ASU.To_Unbounded_String (ACL.Argument (I));
elsif ACL.Argument (I) = "-v" then -- TODO use case
Util.Verbose := True;
Util.Verbose_Print ("Iictl: Verbose printing on");
elsif ACL.Argument (I) = "-i" then
I := I + 1;
Irc_Dir := ASU.To_Unbounded_String (ACL.Argument (I));
else
raise CONSTRAINT_ERROR; -- TODO different exception
end if;
I := I + 1;
exception
when CONSTRAINT_ERROR =>
ATIO.Put_Line ("usage: " & ACL.Command_Name
& " [-v]" & " <-n nick>");
return;
end;
end loop;
end Parse_Options;
function Default_Irc_Dir return ASU.Unbounded_String is
use type Ada.Strings.Unbounded.Unbounded_String;
Uid : PPI.User_Id;
Db_Item : PUD.User_Database_Item;
-- TODO Home_Dir : Posix.Posix_String
Home_Dir : ASU.Unbounded_String;
begin
Uid := PPI.Get_Effective_User_ID;
Db_Item := PUD.Get_User_Database_Item (Uid);
--Home_Dir := PUD.Initial_Directory_Of (Db_Item);
Home_Dir := ASU.To_Unbounded_String (
Posix.To_String (
PUD.Initial_Directory_Of (Db_Item)));
--return ASU.To_Unbounded_String (Posix.To_String (Home_Dir) & "/irc");
return Home_Dir & ASU.To_Unbounded_String ("/irc");
end Default_Irc_Dir;
end Iictl;
|
programs/oeis/045/A045674.asm
|
neoneye/loda
| 22 |
170060
|
<filename>programs/oeis/045/A045674.asm
; A045674: Number of 2n-bead balanced binary necklaces which are equivalent to their reverse, complement and reversed complement.
; 1,1,2,2,4,4,6,8,12,16,20,32,38,64,72,128,140,256,272,512,532,1024,1056,2048,2086,4096,4160,8192,8264,16384,16512,32768,32908,65536,65792,131072,131344,262144,262656,524288,524820,1048576,1049600,2097152,2098208,4194304,4196352,8388608,8390694,16777216,16781312,33554432,33558592,67108864,67117056,134217728,134225992,268435456,268451840,536870912,536887424,1073741824,1073774592,2147483648,2147516556,4294967296,4295032832,8589934592,8590000384,17179869184,17180000256,34359738368,34359869712,68719476736,68719738880,137438953472,137439216128,274877906944,274878431232,549755813888,549756338708,1099511627776,1099512676352,2199023255552,2199024305152,4398046511104,4398048608256,8796093022208,8796095120416,17592186044416,17592190238720,35184372088832,35184376285184,70368744177664,70368752566272,140737488355328,140737496746022,281474976710656,281474993487872,562949953421312
mov $4,$0
mov $14,$0
lpb $4
mov $0,$14
sub $4,1
sub $0,$4
mov $10,$0
mov $11,0
mov $12,2
lpb $12
mov $0,$10
mov $7,0
sub $12,1
add $0,$12
sub $0,1
mov $6,$0
mov $8,2
lpb $8
mov $0,$6
mov $3,0
sub $8,1
add $0,$8
sub $0,1
lpb $0
mov $2,$0
div $0,2
max $2,0
seq $2,61776 ; Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives number of triangles in n-th generation.
add $3,$2
lpe
mov $0,$3
add $0,3
mov $5,$0
mov $9,$8
mul $9,$0
add $7,$9
lpe
min $6,1
mul $6,$5
mov $5,$7
sub $5,$6
mov $13,$12
mul $13,$5
add $11,$13
lpe
min $10,1
mul $10,$5
mov $5,$11
sub $5,$10
add $1,$5
lpe
div $1,3
add $1,1
mov $0,$1
|
test/asset/agda-stdlib-1.0/Relation/Binary/Construct/Flip.agda
|
omega12345/agda-mode
| 5 |
11787
|
------------------------------------------------------------------------
-- The Agda standard library
--
-- Many properties which hold for `∼` also hold for `flip ∼`. Unlike
-- the module `Relation.Binary.Construct.Converse` this module flips
-- both the relation and the underlying equality.
------------------------------------------------------------------------
{-# OPTIONS --without-K --safe #-}
open import Relation.Binary
module Relation.Binary.Construct.Flip where
open import Function
open import Data.Product
------------------------------------------------------------------------
-- Properties
module _ {a ℓ} {A : Set a} (∼ : Rel A ℓ) where
reflexive : Reflexive ∼ → Reflexive (flip ∼)
reflexive refl = refl
symmetric : Symmetric ∼ → Symmetric (flip ∼)
symmetric sym = sym
transitive : Transitive ∼ → Transitive (flip ∼)
transitive trans = flip trans
asymmetric : Asymmetric ∼ → Asymmetric (flip ∼)
asymmetric asym = asym
total : Total ∼ → Total (flip ∼)
total total x y = total y x
respects : ∀ {p} (P : A → Set p) → Symmetric ∼ →
P Respects ∼ → P Respects flip ∼
respects _ sym resp ∼ = resp (sym ∼)
max : ∀ {⊥} → Minimum ∼ ⊥ → Maximum (flip ∼) ⊥
max min = min
min : ∀ {⊤} → Maximum ∼ ⊤ → Minimum (flip ∼) ⊤
min max = max
module _ {a b ℓ₁ ℓ₂} {A : Set a} {B : Set b}
(≈ : REL A B ℓ₁) (∼ : REL A B ℓ₂) where
implies : ≈ ⇒ ∼ → flip ≈ ⇒ flip ∼
implies impl = impl
irreflexive : Irreflexive ≈ ∼ → Irreflexive (flip ≈) (flip ∼)
irreflexive irrefl = irrefl
module _ {a ℓ₁ ℓ₂} {A : Set a} (≈ : Rel A ℓ₁) (∼ : Rel A ℓ₂) where
antisymmetric : Antisymmetric ≈ ∼ → Antisymmetric (flip ≈) (flip ∼)
antisymmetric antisym = antisym
trichotomous : Trichotomous ≈ ∼ → Trichotomous (flip ≈) (flip ∼)
trichotomous compare x y = compare y x
module _ {a ℓ₁ ℓ₂} {A : Set a} (∼₁ : Rel A ℓ₁) (∼₂ : Rel A ℓ₂) where
respects₂ : Symmetric ∼₂ → ∼₁ Respects₂ ∼₂ → flip ∼₁ Respects₂ flip ∼₂
respects₂ sym (resp₁ , resp₂) = (resp₂ ∘ sym , resp₁ ∘ sym)
module _ {a b ℓ} {A : Set a} {B : Set b} (∼ : REL A B ℓ) where
decidable : Decidable ∼ → Decidable (flip ∼)
decidable dec x y = dec y x
module _ {a ℓ} {A : Set a} {≈ : Rel A ℓ} where
isEquivalence : IsEquivalence ≈ → IsEquivalence (flip ≈)
isEquivalence eq = record
{ refl = reflexive ≈ Eq.refl
; sym = symmetric ≈ Eq.sym
; trans = transitive ≈ Eq.trans
}
where module Eq = IsEquivalence eq
isDecEquivalence : IsDecEquivalence ≈ → IsDecEquivalence (flip ≈)
isDecEquivalence dec = record
{ isEquivalence = isEquivalence Dec.isEquivalence
; _≟_ = decidable ≈ Dec._≟_
}
where module Dec = IsDecEquivalence dec
------------------------------------------------------------------------
-- Structures
module _ {a ℓ₁ ℓ₂} {A : Set a} {≈ : Rel A ℓ₁} {∼ : Rel A ℓ₂} where
isPreorder : IsPreorder ≈ ∼ → IsPreorder (flip ≈) (flip ∼)
isPreorder O = record
{ isEquivalence = isEquivalence O.isEquivalence
; reflexive = implies ≈ ∼ O.reflexive
; trans = transitive ∼ O.trans
}
where module O = IsPreorder O
isPartialOrder : IsPartialOrder ≈ ∼ → IsPartialOrder (flip ≈) (flip ∼)
isPartialOrder O = record
{ isPreorder = isPreorder O.isPreorder
; antisym = antisymmetric ≈ ∼ O.antisym
}
where module O = IsPartialOrder O
isTotalOrder : IsTotalOrder ≈ ∼ → IsTotalOrder (flip ≈) (flip ∼)
isTotalOrder O = record
{ isPartialOrder = isPartialOrder O.isPartialOrder
; total = total ∼ O.total
}
where module O = IsTotalOrder O
isDecTotalOrder : IsDecTotalOrder ≈ ∼ → IsDecTotalOrder (flip ≈) (flip ∼)
isDecTotalOrder O = record
{ isTotalOrder = isTotalOrder O.isTotalOrder
; _≟_ = decidable ≈ O._≟_
; _≤?_ = decidable ∼ O._≤?_
}
where module O = IsDecTotalOrder O
isStrictPartialOrder : IsStrictPartialOrder ≈ ∼ →
IsStrictPartialOrder (flip ≈) (flip ∼)
isStrictPartialOrder O = record
{ isEquivalence = isEquivalence O.isEquivalence
; irrefl = irreflexive ≈ ∼ O.irrefl
; trans = transitive ∼ O.trans
; <-resp-≈ = respects₂ ∼ ≈ O.Eq.sym O.<-resp-≈
}
where module O = IsStrictPartialOrder O
isStrictTotalOrder : IsStrictTotalOrder ≈ ∼ →
IsStrictTotalOrder (flip ≈) (flip ∼)
isStrictTotalOrder O = record
{ isEquivalence = isEquivalence O.isEquivalence
; trans = transitive ∼ O.trans
; compare = trichotomous ≈ ∼ O.compare
} where module O = IsStrictTotalOrder O
module _ {a ℓ} where
setoid : Setoid a ℓ → Setoid a ℓ
setoid S = record
{ _≈_ = flip S._≈_
; isEquivalence = isEquivalence S.isEquivalence
}
where module S = Setoid S
decSetoid : DecSetoid a ℓ → DecSetoid a ℓ
decSetoid S = record
{ _≈_ = flip S._≈_
; isDecEquivalence = isDecEquivalence S.isDecEquivalence
}
where module S = DecSetoid S
module _ {a ℓ₁ ℓ₂} where
preorder : Preorder a ℓ₁ ℓ₂ → Preorder a ℓ₁ ℓ₂
preorder O = record
{ isPreorder = isPreorder O.isPreorder
}
where module O = Preorder O
poset : Poset a ℓ₁ ℓ₂ → Poset a ℓ₁ ℓ₂
poset O = record
{ isPartialOrder = isPartialOrder O.isPartialOrder
}
where module O = Poset O
totalOrder : TotalOrder a ℓ₁ ℓ₂ → TotalOrder a ℓ₁ ℓ₂
totalOrder O = record
{ isTotalOrder = isTotalOrder O.isTotalOrder
}
where module O = TotalOrder O
decTotalOrder : DecTotalOrder a ℓ₁ ℓ₂ → DecTotalOrder a ℓ₁ ℓ₂
decTotalOrder O = record
{ isDecTotalOrder = isDecTotalOrder O.isDecTotalOrder
}
where module O = DecTotalOrder O
strictPartialOrder : StrictPartialOrder a ℓ₁ ℓ₂ →
StrictPartialOrder a ℓ₁ ℓ₂
strictPartialOrder O = record
{ isStrictPartialOrder = isStrictPartialOrder O.isStrictPartialOrder
}
where module O = StrictPartialOrder O
strictTotalOrder : StrictTotalOrder a ℓ₁ ℓ₂ →
StrictTotalOrder a ℓ₁ ℓ₂
strictTotalOrder O = record
{ isStrictTotalOrder = isStrictTotalOrder O.isStrictTotalOrder
}
where module O = StrictTotalOrder O
|
oeis/178/A178632.asm
|
neoneye/loda-programs
| 11 |
168587
|
; A178632: a(n) = 45 * ((10^n - 1)/9)^2.
; 45,5445,554445,55544445,5555444445,555554444445,55555544444445,5555555444444445,555555554444444445,55555555544444444445,5555555555444444444445,555555555554444444444445,55555555555544444444444445,5555555555555444444444444445,555555555555554444444444444445,55555555555555544444444444444445,5555555555555555444444444444444445,555555555555555554444444444444444445,55555555555555555544444444444444444445,5555555555555555555444444444444444444445,555555555555555555554444444444444444444445
seq $0,161770 ; n 1's followed by three 0's.
pow $0,2
div $0,1000000
mul $0,45
|
tests/syntax/bad/testfile-return-1.adb
|
xuedong/mini-ada
| 0 |
15384
|
<reponame>xuedong/mini-ada<filename>tests/syntax/bad/testfile-return-1.adb
with Ada.Text_IO; use Ada.Text_IO;
procedure Test is
function F return character is begin return 'a' end F;
begin Put(F); end;
|
examples/shared/hello_world_blinky/src/blinky.adb
|
morbos/Ada_Drivers_Library
| 2 |
10737
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. 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. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- A simple example that blinks all the LEDs simultaneously, w/o tasking.
-- It does not use the various convenience functions defined elsewhere, but
-- instead works directly with the GPIO driver to configure and control the
-- LEDs.
-- Note that this code is independent of the specific MCU device and board
-- in use because we use names and constants that are common across all of
-- them. For example, "All_LEDs" refers to different GPIO pins on different
-- boards, and indeed defines a different number of LEDs on different boards.
-- The gpr file determines which board is actually used.
with Last_Chance_Handler; pragma Unreferenced (Last_Chance_Handler);
-- The "last chance handler" is the user-defined routine that is called when
-- an exception is propagated. We need it in the executable, therefore it
-- must be somewhere in the closure of the context clauses.
with STM32.Device; use STM32.Device;
with STM32.Board; use STM32.Board;
with STM32.GPIO; use STM32.GPIO;
with Ada.Real_Time; use Ada.Real_Time;
procedure Blinky is
Period : constant Time_Span := Milliseconds (200); -- arbitrary
Next_Release : Time := Clock;
procedure Initialize_LEDs;
-- Enables the clock and configures the GPIO pins and port connected to the
-- LEDs on the target board so that we can drive them via GPIO commands.
-- Note that the STM32.Board package provides a procedure (with the same
-- name) to do this directly, for convenience, but we do not use it here
-- for the sake of illustration.
procedure Initialize_LEDs is
Configuration : GPIO_Port_Configuration;
begin
Enable_Clock (All_LEDs);
Configuration.Mode := Mode_Out;
Configuration.Output_Type := Push_Pull;
Configuration.Speed := Speed_100MHz;
Configuration.Resistors := Floating;
Configure_IO (All_LEDs, Configuration);
end Initialize_LEDs;
begin
Initialize_LEDs;
loop
Toggle (All_LEDs);
Next_Release := Next_Release + Period;
delay until Next_Release;
end loop;
end Blinky;
|
src/Categories/Category/Helper.agda
|
laMudri/agda-categories
| 0 |
13546
|
{-# OPTIONS --without-K --safe #-}
module Categories.Category.Helper where
open import Level
open import Relation.Binary using (Rel; IsEquivalence)
open import Categories.Category.Core using (Category)
-- Since we add extra proofs in the definition of `Category` (i.e. `sym-assoc` and
-- `identity²`), we might still want to construct a `Category` in its originally
-- easier manner. Thus, this redundant definition is here to ease the construction.
record CategoryHelper (o ℓ e : Level) : Set (suc (o ⊔ ℓ ⊔ e)) where
infix 4 _≈_ _⇒_
infixr 9 _∘_
field
Obj : Set o
_⇒_ : Rel Obj ℓ
_≈_ : ∀ {A B} → Rel (A ⇒ B) e
id : ∀ {A} → (A ⇒ A)
_∘_ : ∀ {A B C} → (B ⇒ C) → (A ⇒ B) → (A ⇒ C)
field
assoc : ∀ {A B C D} {f : A ⇒ B} {g : B ⇒ C} {h : C ⇒ D} → (h ∘ g) ∘ f ≈ h ∘ (g ∘ f)
identityˡ : ∀ {A B} {f : A ⇒ B} → id ∘ f ≈ f
identityʳ : ∀ {A B} {f : A ⇒ B} → f ∘ id ≈ f
equiv : ∀ {A B} → IsEquivalence (_≈_ {A} {B})
∘-resp-≈ : ∀ {A B C} {f h : B ⇒ C} {g i : A ⇒ B} → f ≈ h → g ≈ i → f ∘ g ≈ h ∘ i
categoryHelper : ∀ {o ℓ e} → CategoryHelper o ℓ e → Category o ℓ e
categoryHelper C = record
{ Obj = Obj
; _⇒_ = _⇒_
; _≈_ = _≈_
; id = id
; _∘_ = _∘_
; assoc = assoc
; sym-assoc = sym assoc
; identityˡ = identityˡ
; identityʳ = identityʳ
; identity² = identityˡ
; equiv = equiv
; ∘-resp-≈ = ∘-resp-≈
}
where open CategoryHelper C
module _ {A B} where
open IsEquivalence (equiv {A} {B}) public
|
src/tools/fixord.adb
|
spr93/whitakers-words
| 204 |
24462
|
-- WORDS, a Latin dictionary, by <NAME> (USAF, Retired)
--
-- Copyright <NAME> (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
with Text_IO;
with Latin_Utils.Strings_Package; use Latin_Utils.Strings_Package;
-- with Latin_Utils.Latin_File_Names; use Latin_Utils.Latin_File_Names;
-- with Latin_Utils.Inflections_Package; use Latin_Utils.Inflections_Package;
-- with Latin_Utils.Dictionary_Package; use Latin_Utils.Dictionary_Package;
-- with line_stuff; use line_stuff;
procedure Fixord is
use Text_IO;
Input, Output : Text_IO.File_Type;
Blank_Line : constant String (1 .. 400) := (others => ' ');
S : String (1 .. 400) := (others => ' ');
Last : Integer := 0;
begin
Put_Line ("FIXORD.IN -> FIXORD.OUT");
Put_Line ("Makes a clean (no #) 3 line ED format from LISTORD output");
Create (Output, Out_File, "FIXORD.OUT");
Open (Input, In_File, "FIXORD.IN");
Over_Lines :
while not End_Of_File (Input) loop
S := Blank_Line;
Get_Line (Input, S, Last);
if Trim (S (1 .. Last)) /= "" then -- Rejecting blank lines
if S (1) /= '#' then
Put_Line (Output, S (1 .. Last));
end if;
end if; -- Rejecting blank lines
end loop Over_Lines;
Close (Output);
exception
when Text_IO.Data_Error =>
Close (Output);
end Fixord;
|
programs/oeis/171/A171369.asm
|
neoneye/loda
| 22 |
175835
|
<filename>programs/oeis/171/A171369.asm<gh_stars>10-100
; A171369: Triangle read by rows, replace 2's with 3's in A169695.
; 1,3,3,1,3,3,3,3,1,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,3,3
lpb $0
sub $0,1
add $2,2
sub $0,$2
lpe
min $0,1
mul $0,2
add $0,1
|
programs/oeis/080/A080663.asm
|
neoneye/loda
| 22 |
93223
|
<reponame>neoneye/loda
; A080663: a(n) = 3*n^2 - 1.
; 2,11,26,47,74,107,146,191,242,299,362,431,506,587,674,767,866,971,1082,1199,1322,1451,1586,1727,1874,2027,2186,2351,2522,2699,2882,3071,3266,3467,3674,3887,4106,4331,4562,4799,5042,5291,5546,5807,6074,6347,6626,6911,7202,7499,7802,8111,8426,8747,9074,9407,9746,10091,10442,10799,11162,11531,11906,12287,12674,13067,13466,13871,14282,14699,15122,15551,15986,16427,16874,17327,17786,18251,18722,19199,19682,20171,20666,21167,21674,22187,22706,23231,23762,24299,24842,25391,25946,26507,27074,27647,28226,28811,29402,29999
mov $1,2
add $1,$0
mul $1,$0
mul $1,3
add $1,2
mov $0,$1
|
oeis/269/A269538.asm
|
neoneye/loda-programs
| 11 |
80748
|
<reponame>neoneye/loda-programs<filename>oeis/269/A269538.asm
; A269538: Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than one.
; 10,64,222,568,1210,2280,3934,6352,9738,14320,20350,28104,37882,50008,64830,82720,104074,129312,158878,193240,232890,278344,330142,388848,455050,529360,612414,704872,807418,920760,1045630,1182784,1333002,1497088,1675870,1870200,2080954,2309032,2555358,2820880,3106570,3413424,3742462,4094728,4471290,4873240,5301694,5757792,6242698,6757600,7303710,7882264,8494522,9141768,9825310,10546480,11306634,12107152,12949438,13834920,14765050,15741304,16765182,17838208,18961930,20137920,21367774,22653112
sub $2,$0
add $0,2
mul $2,$0
pow $0,2
bin $0,2
add $0,$2
sub $0,1
mul $0,2
|
codes/reversing a byte.asm
|
rupak10987/ASSEMBLY_language_practice
| 0 |
178499
|
<reponame>rupak10987/ASSEMBLY_language_practice<filename>codes/reversing a byte.asm
.model small
.stack 100h
.data
.code
main proc
XOR ax,ax
mov bx,0ABh
mov cx,8
reverse:
shl bx,1
rcr ax,1
loop reverse
main endp
end main
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.