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 |
|---|---|---|---|---|
src/test/ref/ternary-2.asm | jbrandwood/kickc | 2 | 179084 | // Tests the ternary operator - when the condition is constant
// Commodore 64 PRG executable file
.file [name="ternary-2.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)
.segment Code
main: {
.label SCREEN = $400
// SCREEN[0] = true?'a':'b'
lda #'a'
sta SCREEN
// SCREEN[1] = false?'a':'b'
lda #'b'
sta SCREEN+1
// }
rts
}
|
libsrc/_DEVELOPMENT/adt/p_forward_list_alt/c/sdcc_iy/p_forward_list_alt_back_fastcall.asm | meesokim/z88dk | 0 | 160448 |
; void *p_forward_list_alt_back_fastcall(p_forward_list_alt_t *list)
SECTION code_adt_p_forward_list_alt
PUBLIC _p_forward_list_alt_back_fastcall
_p_forward_list_alt_back_fastcall:
INCLUDE "adt/p_forward_list_alt/z80/asm_p_forward_list_alt_back.asm"
|
src/natools-indefinite_holders.adb | faelys/natools | 0 | 21321 | ------------------------------------------------------------------------------
-- Copyright (c) 2013, <NAME> --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.Indefinite_Vectors is an implementation of a subset of Ada 2012 --
-- Containers.Indefinite_Holders, compatible with Ada 2005. --
------------------------------------------------------------------------------
package body Natools.Indefinite_Holders is
function "=" (Left, Right : Holder) return Boolean is
begin
if Left.Ref = Right.Ref then
return True;
elsif Left.Ref = null or Right.Ref = null then
return False;
else
return Left.Ref.all = Right.Ref.all;
end if;
end "=";
function To_Holder (New_Item : Element_Type) return Holder is
begin
return Holder'(Ada.Finalization.Controlled with
Ref => new Element_Type'(New_Item));
end To_Holder;
function Is_Empty (Container : Holder) return Boolean is
begin
return Container.Ref = null;
end Is_Empty;
procedure Clear (Container : in out Holder) is
begin
Free (Container.Ref);
end Clear;
function Element (Container : Holder) return Element_Type is
begin
if Container.Ref = null then
raise Constraint_Error with "Element called with an empty holder";
else
return Container.Ref.all;
end if;
end Element;
procedure Replace_Element (Container : in out Holder;
New_Item : in Element_Type) is
begin
Free (Container.Ref);
Container.Ref := new Element_Type'(New_Item);
end Replace_Element;
procedure Query_Element
(Container : in Holder;
Process : not null access procedure (Element : in Element_Type)) is
begin
if Container.Ref = null then
raise Constraint_Error
with "Query_Element called with an empty holder";
else
Process.all (Container.Ref.all);
end if;
end Query_Element;
procedure Update_Element
(Container : in out Holder;
Process : not null access procedure (Element : in out Element_Type)) is
begin
if Container.Ref = null then
raise Constraint_Error
with "Update_Element called with an empty holder";
else
Process.all (Container.Ref.all);
end if;
end Update_Element;
function Reference (Container : Holder) return access Element_Type is
begin
return Container.Ref;
end Reference;
procedure Assign (Target : in out Holder; Source : in Holder) is
begin
Free (Target.Ref);
if Source.Ref /= null then
Target.Ref := new Element_Type'(Source.Ref.all);
end if;
end Assign;
function Copy (Source : Holder) return Holder is
Result : Holder;
begin
if Source.Ref /= null then
Result.Ref := new Element_Type'(Source.Ref.all);
end if;
return Result;
end Copy;
procedure Move (Target : in out Holder; Source : in out Holder) is
begin
Free (Target.Ref);
Target.Ref := Source.Ref;
Source.Ref := null;
end Move;
overriding procedure Adjust (Object : in out Holder) is
New_Ref : Element_Access := null;
begin
if Object.Ref /= null then
New_Ref := new Element_Type'(Object.Ref.all);
Object.Ref := New_Ref;
end if;
end Adjust;
overriding procedure Finalize (Object : in out Holder) is
begin
Free (Object.Ref);
end Finalize;
end Natools.Indefinite_Holders;
|
src/firmware-tests/Platform/Adc/ChannelStubs.asm | pete-restall/Cluck2Sesame-Prototype | 1 | 171553 | <reponame>pete-restall/Cluck2Sesame-Prototype
#include "Platform.inc"
#include "TestDoubles.inc"
radix decimal
AdcRam udata
setAdcChannelResult res 1
ChannelStubs code
global initialiseSetAdcChannelStub
global setAdcChannel
global releaseAdcChannel
initialiseSetAdcChannelStub:
banksel setAdcChannelResult
movwf setAdcChannelResult
return
setAdcChannel:
banksel setAdcChannelResult
movf setAdcChannelResult, W
return
releaseAdcChannel:
return
end
|
Transynther/x86/_processed/AVXALIGN/_st_/i9-9900K_12_0xca_notsx.log_21829_1463.asm | ljhsiun2/medusa | 9 | 94518 | <reponame>ljhsiun2/medusa<gh_stars>1-10
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r14
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_A_ht+0x4cbf, %rdx
nop
nop
nop
inc %r13
mov $0x6162636465666768, %rsi
movq %rsi, (%rdx)
and $44842, %r11
lea addresses_D_ht+0x9329, %rsi
lea addresses_WT_ht+0xd05d, %rdi
nop
nop
add %r14, %r14
mov $107, %rcx
rep movsq
nop
add $33095, %r11
lea addresses_normal_ht+0x4279, %rdx
nop
cmp %r11, %r11
mov (%rdx), %edi
nop
nop
nop
inc %rdx
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %r14
pop %r13
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r13
push %r14
push %rbp
push %rbx
push %rdi
push %rsi
// Store
lea addresses_D+0x1c10d, %rdi
clflush (%rdi)
nop
nop
and $618, %rbp
movb $0x51, (%rdi)
nop
nop
inc %r14
// Faulty Load
lea addresses_RW+0x985d, %rdi
nop
nop
nop
nop
cmp $11838, %rbx
mov (%rdi), %r14w
lea oracles, %rdi
and $0xff, %r14
shlq $12, %r14
mov (%rdi,%r14,1), %r14
pop %rsi
pop %rdi
pop %rbx
pop %rbp
pop %r14
pop %r13
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_RW', 'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_D', 'NT': False, 'AVXalign': False, 'size': 1, 'congruent': 3}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'same': True, 'type': 'addresses_RW', 'NT': False, 'AVXalign': True, 'size': 2, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_A_ht', 'NT': False, 'AVXalign': False, 'size': 8, 'congruent': 1}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 1, 'type': 'addresses_D_ht'}, 'dst': {'same': False, 'congruent': 9, 'type': 'addresses_WT_ht'}}
{'OP': 'LOAD', 'src': {'same': True, 'type': 'addresses_normal_ht', 'NT': True, 'AVXalign': False, 'size': 4, 'congruent': 1}}
{'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
*/
|
Laburi/Lab8/4-5-print-string-len/print-string-len.asm | DanBrezeanu/IOCLA | 2 | 93542 | %include "io.inc"
extern printf
section .data
mystring db "This is my string", 0
printf_format db "String length is %u", 10, 0
store_string times 64 db 0
section .text
global CMAIN
reverse_string:
push ebp
lea ebp, [esp]
mov eax, dword [ebp+8]
mov ecx, dword [ebp+12]
add eax, ecx
dec eax
mov edx, dword [ebp+16]
copy_one_byte:
mov bl, byte [eax]
mov byte [edx], bl
dec eax
inc edx
loopnz copy_one_byte
inc edx
mov byte [edx], 0
leave ; lea esp, [ebp], pop ebp
ret ; pop eip
CMAIN:
push ebp
lea ebp, [esp]
mov eax, mystring
test_one_byte:
mov bl, byte [eax]
test bl, bl
je print
inc eax
jmp test_one_byte
print:
sub eax, mystring
PRINT_DEC 4, eax
NEWLINE
push eax
push printf_format
call printf
add esp, 4 ; de ce nu este scos printf_format de pe stiva?
pop eax
push store_string
push eax
push mystring
call reverse_string
push store_string
call puts
xor eax, eax
leave
ret
|
test/Fail/ErasedMacro4.agda | KDr2/agda | 1 | 4457 | <reponame>KDr2/agda
open import Agda.Builtin.List
open import Agda.Builtin.Reflection
open import Agda.Builtin.Sigma
open import Agda.Builtin.Unit
@0 m : Name → TC ⊤
m F = defineFun F
(clause
(( "A"
, arg (arg-info visible (modality relevant quantity-0))
(agda-sort (lit 0))) ∷
[])
(arg (arg-info visible (modality relevant quantity-0)) (var 0) ∷
[])
(var 0 []) ∷
[])
F : @0 Set → Set
unquoteDef F = m F
|
src/openapi-clients.ads | mgrojo/swagger-ada | 0 | 19627 | <reponame>mgrojo/swagger-ada
-----------------------------------------------------------------------
-- openapi-clients -- Rest client support
-- Copyright (C) 2017, 2018, 2020, 2022 <NAME>
-- Written by <NAME> (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Http.Clients;
private with Util.Streams.Texts;
with OpenAPI.Streams;
with OpenAPI.Credentials;
with Util.Serialize.IO;
-- == REST Client ==
-- The <tt>OpenAPI.Clients</tt> package implements the support used by the code generator
-- to make REST client operations.
package OpenAPI.Clients is
-- Exception raised when an API was not found.
Not_Found : exception;
-- Exception raised when a parameter is invalid.
Parameter_Error : exception;
-- Exception raised when the caller is not authorized.
Authorization_Error : exception;
-- Exception raised when the caller does not have the permission.
Permission_Error : exception;
type Request_Type is tagged limited private;
type Stream_Accessor (Stream : access OpenAPI.Streams.Output_Stream'Class) is private
with Implicit_Dereference => Stream;
function Stream (Req : in Request_Type) return Stream_Accessor;
type Operation_Type is (HEAD, GET, POST, PUT, DELETE, OPTIONS, PATCH);
-- The possible content types that are supported by the OpenAPI Ada client library.
type Content_Type is (APPLICATION_JSON, APPLICATION_XML, APPLICATION_FORM, TEXT_PLAIN);
-- A list of content types for the Set_Accept and Initialize operations.
type Content_Type_Array is array (Positive range <>) of Content_Type;
type URI_Type is tagged private;
-- Set the path to use for the URI.
procedure Set_Path (URI : in out URI_Type;
Path : in String);
-- Set the path parameter.
procedure Set_Path_Param (URI : in out URI_Type;
Name : in String;
Value : in String);
-- Set the path parameter.
procedure Set_Path_Param (URI : in out URI_Type;
Name : in String;
Value : in UString);
-- Add a query parameter.
procedure Add_Param (URI : in out URI_Type;
Name : in String;
Value : in String);
-- Add a query parameter.
procedure Add_Param (URI : in out URI_Type;
Name : in String;
Value : in UString);
procedure Add_Param (URI : in out URI_Type;
Name : in String;
Value : in Nullable_UString);
-- Add a query parameter.
procedure Add_Param (URI : in out URI_Type;
Name : in String;
Value : in Boolean);
procedure Add_Param (URI : in out URI_Type;
Name : in String;
Value : in Nullable_Boolean);
-- Add a query parameter.
procedure Add_Param (URI : in out URI_Type;
Name : in String;
Value : in UString_Vectors.Vector);
procedure Add_Param (URI : in out URI_Type;
Name : in String;
Value : in Nullable_UString_Vectors.Vector);
-- Convert the URI into a string.
function To_String (URI : in URI_Type) return String;
type Client_Type is new Util.Http.Clients.Client with private;
-- Set the server base URI to connect to.
procedure Set_Server (Client : in out Client_Type;
Server : in String);
procedure Set_Server (Client : in out Client_Type;
Server : in UString);
-- Set the credential instance that is responsible for populating the HTTP request
-- before sending the request.
procedure Set_Credentials (Client : in out Client_Type;
Credential : access OpenAPI.Credentials.Credential_Type'Class);
procedure Call (Client : in out Client_Type;
Operation : in Operation_Type;
URI : in URI_Type'Class;
Request : in Request_Type'Class);
procedure Call (Client : in out Client_Type;
Operation : in Operation_Type;
URI : in URI_Type'Class);
procedure Call (Client : in out Client_Type;
Operation : in Operation_Type;
URI : in URI_Type'Class;
Reply : out Value_Type);
procedure Call (Client : in out Client_Type;
Operation : in Operation_Type;
URI : in URI_Type'Class;
Request : in Request_Type'Class;
Reply : out Value_Type);
-- Set the Accept header according to what the operation supports and what is
-- selected by the client.
procedure Set_Accept (Client : in out Client_Type;
List : in Content_Type_Array);
-- Handle an error after an API call. The default implementation raises an exception
-- if the HTTP status code is 400, 401 or 403.
procedure Error (Client : in out Client_Type;
Status : in Natural;
Response : in Util.Http.Clients.Response'Class);
-- Get the HTTP response code status.
function Get_Status (Client : in Client_Type) return Natural;
-- Initialize the request body to prepare for the serialization of data using
-- a supported and configured content type.
procedure Initialize (Client : in out Client_Type;
Request : in out Request_Type'Class;
Types : in Content_Type_Array);
private
type Request_Type is tagged limited record
Buffer : aliased Util.Streams.Texts.Print_Stream;
Data : access Util.Serialize.IO.Output_Stream'Class;
end record;
type Client_Type is new Util.Http.Clients.Client with record
Server : UString;
Credential : access OpenAPI.Credentials.Credential_Type'Class;
Response : Util.Http.Clients.Response;
end record;
type Stream_Accessor (Stream : access OpenAPI.Streams.Output_Stream'Class) is record
N : Natural := 0;
end record;
type URI_Type is tagged record
URI : UString;
Query : UString;
end record;
end OpenAPI.Clients;
|
Cats/Category/Constructions/Product.agda | alessio-b-zak/cats | 0 | 16942 | <filename>Cats/Category/Constructions/Product.agda
module Cats.Category.Constructions.Product where
open import Relation.Binary.PropositionalEquality as PropEq using (_≡_ ; refl)
open import Data.Bool using (Bool ; true ; false ; not; if_then_else_)
open import Relation.Binary.Core using (IsEquivalence)
open import Level
open import Cats.Category.Base
open import Cats.Category.Constructions.Terminal as Terminal using (HasTerminal)
open import Cats.Functor using (Functor)
open import Cats.Util.Conv
open import Cats.Util.Logic.Constructive
import Cats.Category.Constructions.Iso as Iso
import Cats.Category.Constructions.Unique as Unique
Bool-elim : ∀ {a} {A : Bool → Set a} → A true → A false → (i : Bool) → A i
Bool-elim x y true = x
Bool-elim x y false = y
module Build {lo la l≈} (Cat : Category lo la l≈) where
private open module Cat = Category Cat
open Cat.≈-Reasoning
open Iso.Build Cat
open Unique.Build Cat
open Terminal.Build Cat
IsProduct : ∀ {li} {I : Set li} (O : I → Obj) P → (∀ i → P ⇒ O i)
→ Set (lo ⊔ la ⊔ l≈ ⊔ li)
IsProduct O P proj
= ∀ {X} (x : ∀ i → X ⇒ O i) → ∃![ u ] (∀ i → x i ≈ proj i ∘ u)
-- TODO The types of the equalities in IsBinaryProducts are backwards, since
-- we want the RHS to be simpler than the LHS. So, projl ∘ u ≈ xl instead
-- of xl ≈ projl ∘ u.
IsBinaryProduct : ∀ {A B} P → (P ⇒ A) → (P ⇒ B) → Set (lo ⊔ la ⊔ l≈)
IsBinaryProduct {A} {B} P projl projr
= ∀ {X} (xl : X ⇒ A) (xr : X ⇒ B)
→ ∃![ u ] (xl ≈ projl ∘ u ∧ xr ≈ projr ∘ u)
-- BinProduct→id-unique : ∀ {A B P} → {projl : P ⇒ A} → {projr : P ⇒ B}
-- → (y : IsBinaryProduct P projl projr)
-- → id ≈ (Unique.Build.∃!′.arr y)
-- BinProduct→id-unique = ?
-- ≈.trans (≈.sym (unique ((≈.sym id-r) , (≈.sym id-r)) )) {!arr!}
IsBinaryProduct→IsProduct : ∀ {A B P} {pl : P ⇒ A} {pr : P ⇒ B}
→ IsBinaryProduct P pl pr
→ IsProduct (Bool-elim A B) P (Bool-elim pl pr)
IsBinaryProduct→IsProduct isBinProd x = record
{ arr = f ⃗
; prop = Bool-elim (∧-eliml (∃!′.prop f)) (∧-elimr (∃!′.prop f))
; unique = λ eq → ∃!′.unique f (eq true , eq false)
}
where
f = isBinProd (x true) (x false)
record Product {li} {I : Set li} (O : I → Obj) : Set (lo ⊔ la ⊔ l≈ ⊔ li) where
field
prod : Obj
proj : ∀ i → prod ⇒ O i
isProduct : IsProduct O prod proj
open Product using (proj ; isProduct ; prod)
instance
HasObj-Product : ∀ {li} {I : Set li} {O : I → Obj}
→ HasObj (Product O) lo la l≈
HasObj-Product = record { Cat = Cat ; _ᴼ = Product.prod }
BinaryProduct : Obj → Obj → Set (lo ⊔ la ⊔ l≈)
BinaryProduct A B = Product (Bool-elim A B)
mkBinaryProduct : ∀ {A B P} (pl : P ⇒ A) (pr : P ⇒ B)
→ IsBinaryProduct P pl pr
→ BinaryProduct A B
mkBinaryProduct {P = P} pl pr isBinProd = record
{ isProduct = IsBinaryProduct→IsProduct isBinProd }
nullaryProduct-Terminal : (P : Product {I = ⊥} (λ())) → IsTerminal (P ᴼ)
nullaryProduct-Terminal P X with isProduct P {X = X} λ()
... | ∃!-intro arr _ unique = ∃!-intro arr _ (λ _ → unique λ())
module _ {li} {I : Set li} {O : I → Obj} (P : Product O) where
factorizer : ∀ {X} → (∀ i → X ⇒ O i) → X ⇒ P ᴼ
factorizer proj = isProduct P proj ⃗
factorizer-proj : ∀ {X} {x : ∀ i → X ⇒ O i} {i}
→ proj P i ∘ factorizer x ≈ x i
factorizer-proj {x = x} {i} = ≈.sym (∃!′.prop (isProduct P x) i)
factorizer-resp : ∀ {X} {x y : ∀ i → X ⇒ O i}
→ (∀ i → x i ≈ y i)
→ factorizer x ≈ factorizer y
factorizer-resp {x = x} {y} eq
= ∃!′.unique (isProduct P x)
(λ i → ≈.trans (eq i) (≈.sym factorizer-proj))
factorizer-∘ : ∀ {X} {x : ∀ i → X ⇒ O i} {Z} {f : Z ⇒ X}
→ factorizer x ∘ f ≈ factorizer (λ i → x i ∘ f)
factorizer-∘ {x = x} {f = f} = ≈.sym (
∃!′.unique (isProduct P (λ i → x i ∘ f))
(λ i → ≈.sym (≈.trans unassoc (∘-resp-l factorizer-proj)))
)
module _ {li} {I : Set li}
{O : I → Obj} (P : Product O)
{O′ : I → Obj} (P′ : Product O′)
where
times : (∀ i → O i ⇒ O′ i) → P ᴼ ⇒ P′ ᴼ
times x = factorizer P′ (λ i → x i ∘ proj P i)
times-proj : ∀ {x : ∀ i → O i ⇒ O′ i} {i}
→ proj P′ i ∘ times x ≈ x i ∘ proj P i
times-proj = factorizer-proj P′
times-resp : {x y : ∀ i → O i ⇒ O′ i}
→ (∀ i → x i ≈ y i)
→ times x ≈ times y
times-resp {x} {y} eq = factorizer-resp P′ (λ i → ∘-resp-l (eq i))
times-∘ : ∀ {li} {I : Set li}
→ {O O′ O″ : I → Obj}
→ (P : Product O) (P′ : Product O′) (P″ : Product O″)
→ {x : ∀ i → O i ⇒ O′ i} {y : ∀ i → O′ i ⇒ O″ i}
→ times P′ P″ y ∘ times P P′ x ≈ times P P″ (λ i → y i ∘ x i)
times-∘ P P′ P″ {x} {y} =
begin
times P′ P″ y ∘ times P P′ x
≈⟨ factorizer-∘ P″ ⟩
factorizer P″ (λ i → (y i ∘ proj P′ i) ∘ times P P′ x)
≈⟨ factorizer-resp P″ (λ i → assoc) ⟩
factorizer P″ (λ i → y i ∘ proj P′ i ∘ times P P′ x)
≈⟨ factorizer-resp P″ (λ i → ∘-resp-r (times-proj P P′)) ⟩
factorizer P″ (λ i → y i ∘ x i ∘ proj P i)
≈⟨ factorizer-resp P″ (λ i → unassoc) ⟩
times P P″ (λ i → y i ∘ x i)
∎
tim-fac : ∀ {li} {X} {I : Set li}
→ {O O′ : I → Obj}
→ (P : Product O) (P′ : Product O′)
→ {x : ∀ i → X ⇒ O i} {y : ∀ i → O i ⇒ O′ i}
→ times P P′ y ∘ factorizer P x ≈ factorizer P′ (λ i → y i ∘ x i)
tim-fac P P′ {x} {y} =
begin
times P P′ y ∘ factorizer P x
≈⟨ factorizer-∘ P′ ⟩
factorizer P′ (λ i → (y i ∘ proj P i) ∘ factorizer P x)
≈⟨ factorizer-resp P′ (λ i → assoc) ⟩
factorizer P′ (λ i → y i ∘ proj P i ∘ factorizer P x)
≈⟨ factorizer-resp P′ (λ i → (∘-resp-r (factorizer-proj P))) ⟩
factorizer P′ (λ i → y i ∘ x i)
∎
proj-cancel : ∀ {li} {I : Set li} {O : I → Obj} {P proj}
→ IsProduct O P proj
→ ∀ {X} {f g : X ⇒ P}
→ (∀ i → proj i ∘ f ≈ proj i ∘ g)
→ f ≈ g
proj-cancel {proj = proj} prod {f = f} {g} eq with prod (λ i → proj i ∘ g)
... | ∃!-intro u _ u-uniq
= begin
f
≈⟨ ≈.sym (u-uniq (λ i → ≈.sym (eq i))) ⟩
u
≈⟨ u-uniq (λ i → ≈.refl) ⟩
g
∎
record HasProducts {lo la l≈} li (C : Category lo la l≈)
: Set (suc li ⊔ lo ⊔ la ⊔ l≈ )
where
private open module Bld = Build C using (Product)
open Category C
field
Π′ : {I : Set li} (O : I → Obj) → Product O
module _ {I : Set li} where
Π : ∀ (O : I → Obj) → Obj
Π O = Π′ O ᴼ
syntax Π (λ i → O) = Π[ i ] O
proj : ∀ {O : I → Obj} i → Π O ⇒ O i
proj {O} = Bld.Product.proj (Π′ O)
factorizer : ∀ {O : I → Obj} {X} → (∀ i → X ⇒ O i) → X ⇒ Π O
factorizer {O} = Bld.factorizer (Π′ O)
times : ∀ {O O′ : I → Obj} → (∀ i → O i ⇒ O′ i) → Π O ⇒ Π O′
times {O} {O′} = Bld.times (Π′ O) (Π′ O′)
factorizer-proj : ∀ {O : I → Obj} {X} {x : ∀ i → X ⇒ O i} {i}
→ proj i ∘ factorizer x ≈ x i
factorizer-proj {O} = Bld.factorizer-proj (Π′ O)
factorizer-resp : ∀ {O : I → Obj} {X} {x y : ∀ i → X ⇒ O i}
→ (∀ i → x i ≈ y i)
→ factorizer x ≈ factorizer y
factorizer-resp {O} = Bld.factorizer-resp (Π′ O)
factorizer-∘ : ∀ {O : I → Obj} {X} {x : ∀ i → X ⇒ O i} {Z} {f : Z ⇒ X}
→ factorizer x ∘ f ≈ factorizer (λ i → x i ∘ f)
factorizer-∘ {O} = Bld.factorizer-∘ (Π′ O)
times-proj : ∀ {O O′ : I → Obj} {x : ∀ i → O i ⇒ O′ i} {i}
→ proj i ∘ times x ≈ x i ∘ proj i
times-proj {O} {O′} = Bld.times-proj (Π′ O) (Π′ O′)
times-resp : ∀ {O O′ : I → Obj} {x y : ∀ i → O i ⇒ O′ i}
→ (∀ i → x i ≈ y i)
→ times x ≈ times y
times-resp {O} {O′} = Bld.times-resp (Π′ O) (Π′ O′)
times-∘ : ∀ {O O′ O″ : I → Obj} {x : ∀ i → O i ⇒ O′ i} {y : ∀ i → O′ i ⇒ O″ i}
→ times y ∘ times x ≈ times (λ i → y i ∘ x i)
times-∘ {O} {O′} {O″} = Bld.times-∘ (Π′ O) (Π′ O′) (Π′ O″)
HasProducts→HasTerminal : ∀ {lo la l≈} {C : Category lo la l≈}
→ HasProducts zero C
→ HasTerminal C
HasProducts→HasTerminal {C = C} record { Π′ = Π }
= let P = Π {I = ⊥} λ() in
record
{ One = P ᴼ
; isTerminal = Build.nullaryProduct-Terminal C P
}
record HasBinaryProducts {lo la l≈} (C : Category lo la l≈)
: Set (lo ⊔ la ⊔ l≈)
where
private open module Bld = Build C using (BinaryProduct ; Product)
open Category C
open ≈-Reasoning
infixr 2 _×_ _×′_ ⟨_×_⟩ ⟨_,_⟩
field
_×′_ : ∀ A B → BinaryProduct A B
_×_ : Obj → Obj → Obj
A × B = (A ×′ B) ᴼ
projl : ∀ {A B} → A × B ⇒ A
projl {A} {B} = Product.proj (A ×′ B) true
projr : ∀ {A B} → A × B ⇒ B
projr {A} {B} = Product.proj (A ×′ B) false
⟨_,_⟩ : ∀ {A B Z} → Z ⇒ A → Z ⇒ B → Z ⇒ A × B
⟨_,_⟩ {A} {B} f g
= Bld.factorizer (A ×′ B) (Bool-elim f g)
⟨_×_⟩ : ∀ {A B A′ B′} → A ⇒ A′ → B ⇒ B′ → A × B ⇒ A′ × B′
⟨_×_⟩ {A} {B} {A′} {B′} f g
= Bld.times (A ×′ B) (A′ ×′ B′) (Bool-elim f g)
first : ∀ {A A′ B} → A ⇒ A′ → A × B ⇒ A′ × B
first f = ⟨ f × id ⟩
second : ∀ {A B B′} → B ⇒ B′ → A × B ⇒ A × B′
second f = ⟨ id × f ⟩
swap : ∀ {A B} → A × B ⇒ B × A
swap = ⟨ projr , projl ⟩
⟨,⟩-resp : ∀ {A B Z} {f f′ : Z ⇒ A} {g g′ : Z ⇒ B}
→ f ≈ f′
→ g ≈ g′
→ ⟨ f , g ⟩ ≈ ⟨ f′ , g′ ⟩
⟨,⟩-resp {A} {B} f≈f′ g≈g′
= Bld.factorizer-resp (A ×′ B) (Bool-elim f≈f′ g≈g′)
⟨,⟩-projl : ∀ {A B Z} {f : Z ⇒ A} {g : Z ⇒ B} → projl ∘ ⟨ f , g ⟩ ≈ f
⟨,⟩-projl {A} {B} = Bld.factorizer-proj (A ×′ B)
⟨,⟩-projr : ∀ {A B Z} {f : Z ⇒ A} {g : Z ⇒ B} → projr ∘ ⟨ f , g ⟩ ≈ g
⟨,⟩-projr {A} {B} = Bld.factorizer-proj (A ×′ B)
data Singleton {a} {A : Set a} (x : A) : Set a where
_with≡_ : (y : A) → x ≡ y → Singleton x
inspect : ∀ {a} {A : Set a} (x : A) → Singleton x
inspect x = x with≡ refl
⟨projr,projl⟩-id : {A B : Obj} → ⟨ projl , projr ⟩ ≈ id {A × B}
⟨projr,projl⟩-id {A} {B} with inspect (A ×′ B)
... | record { prod = .(Product.prod (A ×′ B)) ; proj = proj ; isProduct = isProduct } with≡ refl with (isProduct proj)
... | Unique.Build.∃!-intro arr prop unique = ≈.trans (≈.sym (unique (Bool-elim (≈.sym ⟨,⟩-projl) (≈.sym ⟨,⟩-projr))) ) (unique λ i → ≈.sym id-r)
--... | p (record { prod = prod' ; proj = proj ; isProduct = isProduct }) with (isProduct proj)
-- ... | Unique.Build.∃!-intro arr prop unique = ≈.trans (≈.sym (unique (Bool-elim {!⟨,⟩-projl {A} {B} {f = projl} {g = projr}!} {!!})) ) (unique λ i → ≈.sym id-r)
⟨,⟩-∘ : ∀ {A B Y Z} {f : Y ⇒ Z} {g : Z ⇒ A} {h : Z ⇒ B}
→ ⟨ g , h ⟩ ∘ f ≈ ⟨ g ∘ f , h ∘ f ⟩
⟨,⟩-∘ {A} {B} {Y} {Z} {f} {g} {h}
= begin
⟨ g , h ⟩ ∘ f
≈⟨ Bld.factorizer-∘ (A ×′ B) ⟩
Bld.factorizer (A ×′ B)
(λ i → Bool-elim {A = λ i → Z ⇒ Bool-elim A B i} g h i ∘ f)
≈⟨ Bld.factorizer-resp (A ×′ B) (Bool-elim ≈.refl ≈.refl) ⟩
⟨ g ∘ f , h ∘ f ⟩
∎
⟨×⟩-resp : ∀ {A A′ B B′} {f f′ : A ⇒ A′} {g g′ : B ⇒ B′}
→ f ≈ f′
→ g ≈ g′
→ ⟨ f × g ⟩ ≈ ⟨ f′ × g′ ⟩
⟨×⟩-resp {A} {A′} {B} {B′} f≈f′ g≈g′
= Bld.times-resp (A ×′ B) (A′ ×′ B′) (Bool-elim f≈f′ g≈g′)
⟨×⟩-projl : ∀ {A A′ B B′} {f : A ⇒ A′} {g : B ⇒ B′}
→ projl ∘ ⟨ f × g ⟩ ≈ f ∘ projl
⟨×⟩-projl {A} {A′} {B} {B′} = Bld.times-proj (A ×′ B) (A′ ×′ B′)
⟨×⟩-projr : ∀ {A A′ B B′} {f : A ⇒ A′} {g : B ⇒ B′}
→ projr ∘ ⟨ f × g ⟩ ≈ g ∘ projr
⟨×⟩-projr {A} {A′} {B} {B′} = Bld.times-proj (A ×′ B) (A′ ×′ B′)
⟨×⟩-∘ : ∀ {A A′ A″ B B′ B″}
→ {f : A′ ⇒ A″} {f′ : A ⇒ A′} {g : B′ ⇒ B″} {g′ : B ⇒ B′}
→ ⟨ f × g ⟩ ∘ ⟨ f′ × g′ ⟩ ≈ ⟨ f ∘ f′ × g ∘ g′ ⟩
⟨×⟩-∘ {A} {A′} {A″} {B} {B′} {B″} {f} {f′} {g} {g′}
= begin
⟨ f × g ⟩ ∘ ⟨ f′ × g′ ⟩
≈⟨ Bld.times-∘ (A ×′ B) (A′ ×′ B′) (A″ ×′ B″) ⟩
Bld.times (A ×′ B) (A″ ×′ B″)
(λ i →
Bool-elim {A = λ i → Bool-elim A′ B′ i ⇒ Bool-elim A″ B″ i} f g i ∘
Bool-elim {A = λ i → Bool-elim A B i ⇒ Bool-elim A′ B′ i} f′ g′ i)
≈⟨ Bld.times-resp (A ×′ B) (A″ ×′ B″) (Bool-elim ≈.refl ≈.refl) ⟩
⟨ f ∘ f′ × g ∘ g′ ⟩
∎
⟨×⟩-∘-⟨,⟩ : ∀ {X A A′ B B′}
→ {u : X ⇒ A}{v : X ⇒ A′}{f : A ⇒ B}{g : A′ ⇒ B′}
→ ⟨ f × g ⟩ ∘ ⟨ u , v ⟩ ≈ ⟨ f ∘ u , g ∘ v ⟩
⟨×⟩-∘-⟨,⟩ {X} {A} {A′} {B} {B′} {u} {v} {f} {g}
= begin
⟨ f × g ⟩ ∘ ⟨ u , v ⟩
≈⟨ Bld.tim-fac (A ×′ A′) (B ×′ B′) ⟩
Bld.factorizer (B ×′ B′) ( λ i →
Bool-elim {A = λ i → Bool-elim A A′ i ⇒ Bool-elim B B′ i} f g i ∘
Bool-elim {A = λ i → X ⇒ Bool-elim A A′ i} u v i)
-- {A = λ i → X ⇒ Bool-elim B B′ i} (f ∘ u) (g ∘ v) i)
≈⟨ Bld.factorizer-resp (B ×′ B′) (Bool-elim ≈.refl ≈.refl) ⟩
⟨ f ∘ u , g ∘ v ⟩
∎
-- The following is conceptually trivial, but we have to dig quite deep to
-- avoid level-related nonsense.
HasProducts→HasBinaryProducts : ∀ {lp lo la l≈} {C : Category lo la l≈}
→ HasProducts lp C
→ HasBinaryProducts C
HasProducts→HasBinaryProducts {lp} {C = C} record { Π′ = Π }
= record { _×′_ = _×_ }
where
open Category C
open Unique.Build C
open Build C
open Product using (proj ; isProduct)
open ∃!′ using (arr ; prop ; unique)
_×_ : ∀ A B → Build.BinaryProduct C A B
A × B = record
{ prod = prod′
; proj = proj′
; isProduct = isProduct′
}
where
O : Lift lp Bool → _
O (lift true) = A
O (lift false) = B
prod′ = Π O ᴼ
proj′ = Bool-elim (proj (Π O) (lift true)) (proj (Π O) (lift false))
isProduct′ : IsProduct (Bool-elim A B) prod′ proj′
isProduct′ {X} x = record
{ arr = arr′ ⃗
; prop = Bool-elim (prop arr′ (lift true)) (prop arr′ (lift false))
; unique = λ eq → unique arr′
(λ { (lift true) → eq true ; (lift false) → eq false})
}
where
arr′ = isProduct (Π O)
λ { (lift true) → x true ; (lift false) → x false}
record HasFiniteProducts {lo la l≈} (Cat : Category lo la l≈)
: Set (lo ⊔ la ⊔ l≈)
where
field
{{hasTerminal}} : HasTerminal Cat
{{hasBinaryProducts}} : HasBinaryProducts Cat
open HasTerminal hasTerminal public
open HasBinaryProducts hasBinaryProducts public
module _ {lo la l≈ lo′ la′ l≈′}
{C : Category lo la l≈}
{D : Category lo′ la′ l≈′}
where
open Category C
open Build using (IsProduct ; IsBinaryProduct)
open Functor
PreservesBinaryProducts : (F : Functor C D) → Set _
PreservesBinaryProducts F
= ∀ {A B A×B} {projl : A×B ⇒ A} {projr : A×B ⇒ B}
→ IsBinaryProduct C A×B projl projr
→ IsBinaryProduct D (fobj F A×B) (fmap F projl) (fmap F projr)
PreservesProducts : ∀ {i} (I : Set i) (F : Functor C D) → Set _
PreservesProducts I F
= ∀ {O : I → Obj} {P} {proj : ∀ i → P ⇒ O i}
→ IsProduct C O P proj
→ IsProduct D (λ i → fobj F (O i)) (fobj F P) (λ i → fmap F (proj i))
|
Transynther/x86/_processed/NONE/_st_un_/i7-7700_9_0x48.log_21829_1150.asm | ljhsiun2/medusa | 9 | 171839 | .global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r15
push %r9
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_UC_ht+0x1d1c8, %r9
nop
dec %r11
mov (%r9), %r13d
nop
nop
nop
add %rcx, %rcx
lea addresses_WT_ht+0x61c8, %rsi
lea addresses_WC_ht+0x18148, %rdi
sub %r15, %r15
mov $33, %rcx
rep movsq
nop
nop
nop
nop
nop
cmp %r15, %r15
lea addresses_WC_ht+0x6858, %r11
nop
nop
inc %r13
movb (%r11), %cl
nop
nop
nop
add %rsi, %rsi
lea addresses_D_ht+0xa0c8, %r9
nop
cmp $3397, %rsi
movb (%r9), %cl
nop
nop
nop
xor $30145, %r15
lea addresses_UC_ht+0x54c8, %rsi
nop
nop
nop
nop
nop
cmp %rdi, %rdi
mov (%rsi), %r13
nop
nop
nop
nop
cmp $59095, %r11
lea addresses_D_ht+0xea68, %rsi
lea addresses_UC_ht+0x11dc8, %rdi
nop
nop
xor %rax, %rax
mov $105, %rcx
rep movsb
nop
nop
nop
nop
sub %r13, %r13
lea addresses_normal_ht+0x1bdc8, %r15
clflush (%r15)
nop
cmp %rdi, %rdi
mov $0x6162636465666768, %r11
movq %r11, %xmm7
vmovups %ymm7, (%r15)
nop
nop
nop
nop
and %rdi, %rdi
lea addresses_WC_ht+0x10168, %rsi
lea addresses_normal_ht+0x15dc8, %rdi
nop
nop
inc %r11
mov $67, %rcx
rep movsl
add %r13, %r13
lea addresses_UC_ht+0x5bc8, %r15
nop
nop
nop
cmp $23356, %rdi
mov $0x6162636465666768, %rsi
movq %rsi, (%r15)
cmp %rcx, %rcx
lea addresses_WT_ht+0x13398, %rsi
lea addresses_D_ht+0x159c8, %rdi
nop
nop
nop
nop
nop
and %r13, %r13
mov $88, %rcx
rep movsq
nop
nop
nop
and %r15, %r15
pop %rsi
pop %rdi
pop %rcx
pop %rax
pop %r9
pop %r15
pop %r13
pop %r11
ret
.global s_faulty_load
s_faulty_load:
push %r13
push %r14
push %r15
push %rbp
push %rbx
push %rcx
push %rdi
// Store
lea addresses_UC+0x29c8, %r14
nop
nop
add $57547, %rbx
movw $0x5152, (%r14)
nop
nop
nop
add $12558, %r13
// Faulty Load
lea addresses_UC+0x139c8, %rdi
nop
nop
inc %r15
mov (%rdi), %rbx
lea oracles, %r15
and $0xff, %rbx
shlq $12, %rbx
mov (%r15,%rbx,1), %rbx
pop %rdi
pop %rcx
pop %rbx
pop %rbp
pop %r15
pop %r14
pop %r13
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'type': 'addresses_UC', 'AVXalign': False, 'congruent': 0, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC', 'AVXalign': False, 'congruent': 10, 'size': 2, 'same': False, 'NT': False}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'type': 'addresses_UC', 'AVXalign': False, 'congruent': 0, 'size': 8, 'same': True, 'NT': False}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'type': 'addresses_UC_ht', 'AVXalign': False, 'congruent': 10, 'size': 4, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WT_ht', 'congruent': 8, 'same': True}, 'dst': {'type': 'addresses_WC_ht', 'congruent': 7, 'same': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_WC_ht', 'AVXalign': False, 'congruent': 2, 'size': 1, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_D_ht', 'AVXalign': False, 'congruent': 6, 'size': 1, 'same': False, 'NT': False}}
{'OP': 'LOAD', 'src': {'type': 'addresses_UC_ht', 'AVXalign': False, 'congruent': 8, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_D_ht', 'congruent': 5, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 10, 'same': False}}
{'OP': 'STOR', 'dst': {'type': 'addresses_normal_ht', 'AVXalign': False, 'congruent': 10, 'size': 32, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WC_ht', 'congruent': 4, 'same': True}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 4, 'same': True}}
{'OP': 'STOR', 'dst': {'type': 'addresses_UC_ht', 'AVXalign': False, 'congruent': 7, 'size': 8, 'same': False, 'NT': False}}
{'OP': 'REPM', 'src': {'type': 'addresses_WT_ht', 'congruent': 2, 'same': False}, 'dst': {'type': 'addresses_D_ht', 'congruent': 9, 'same': False}}
{'52': 21827, 'ff': 2}
52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52 52
*/
|
src/arch/i386/kernel/boot.asm | SydOS/Star | 13 | 14006 | ;
; File: boot.asm
;
; Copyright (c) 2017-2018 <NAME>, <NAME>
;
; Permission is hereby granted, free of charge, to any person obtaining a copy
; of this software and associated documentation files (the "Software"), to deal
; in the Software without restriction, including without limitation the rights
; to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
; copies of the Software, and to permit persons to whom the Software is
; furnished to do so, subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in all
; copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
; AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
; OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
; SOFTWARE.
;
; 32-bit code.
[bits 32]
; Multiboot constants.
MULTIBOOT_PAGE_ALIGN equ 0x00000001
MULTIBOOT_MEMORY_INFO equ 0x00000002
MULTIBOOT_HEADER_MAGIC equ 0x1BADB002
MULTIBOOT_HEADER_FLAGS equ MULTIBOOT_PAGE_ALIGN | MULTIBOOT_MEMORY_INFO
MULTIBOOT_CHECKSUM equ -(MULTIBOOT_HEADER_MAGIC + MULTIBOOT_HEADER_FLAGS)
; Multiboot section.
section .multiboot
align 4
dd MULTIBOOT_HEADER_MAGIC
dd MULTIBOOT_HEADER_FLAGS
dd MULTIBOOT_CHECKSUM
; Allocate stack
section .bss
align 16
stack_bottom:
resb 16384
stack_top:
section .inittables
global MULTIBOOT_MAGIC
MULTIBOOT_MAGIC: dd 0
global MULTIBOOT_INFO
MULTIBOOT_INFO: dd 0
; Start function.
section .init
global _start
_start:
; Disable interrupts.
cli
; Print `SYDOS` to screen corner.
mov dword [0xb8000], 0x2f592f53
mov dword [0xb8004], 0x2f4f2f44
mov word [0xb8008], 0x2f53
; Save Multiboot info for later use.
mov [MULTIBOOT_MAGIC], eax
mov [MULTIBOOT_INFO], ebx
; Push Multiboot info structure and magic number.
push ebx
push eax
; Call the early kernel main function.
; This sets up early boot paging, etc.
extern kernel_main_early
call kernel_main_early
; Pop Multiboot info off.
pop eax
pop ebx
; Jump to higher half.
lea edx, [_start_higherhalf]
jmp edx
; Higher-half of our start function.
section .text
_start_higherhalf:
; Point stack pointer to top.
mov esp, stack_top
mov ebp, stack_top
; Ensure stack is 16-bit aligned.
and esp, -16
; Push Multiboot info structure and magic number.
push ebx
; Call the kernel main function!
extern kernel_main
call kernel_main
; Disable interrupts and loop forever.
cli
.hang: hlt
jmp .hang
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/conv_decimal.adb | best08618/asylo | 7 | 29257 | <filename>gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/conv_decimal.adb
-- PR middle-end/36575
-- reporter: <NAME> <<EMAIL>>
-- { dg-do run }
procedure Conv_Decimal is
type Unsigned_Over_8 is mod 2**8+2;
type Signed_Over_8 is range -200 .. 200;
procedure Assert(Truth: Boolean) is
begin
if not Truth then
raise Program_Error;
end if;
end;
type Decim is delta 0.1 digits 5;
Halfway : Decim := 2.5;
Neg_Half : Decim := -2.5;
Big : Unsigned_Over_8;
Also_Big : Signed_Over_8;
begin
Big := Unsigned_Over_8 (Halfway); -- Rounds up by 4.6(33).
Assert(Big = 3);
Also_Big := Signed_Over_8 (Halfway); -- Rounds up by 4.6(33).
Assert(Also_Big = 3);
Also_Big := Signed_Over_8 (Neg_Half); -- Rounds down by 4.6(33).
Assert(Also_Big = -3);
end;
|
SaveTabs.applescript | hzh-cocong/iTerm2-Workspace | 1 | 161 | -- function: save data to the file
on write_to_file(this_data, target_file, append_data) -- (string, file path as string, boolean)
try
set the target_file to the target_file as text
set the open_target_file to open for access file target_file with write permission
if append_data is false then set eof of the open_target_file to 0
write this_data to the open_target_file starting at eof
close access the open_target_file
return true
on error
try
close access file target_file
end try
return false
end try
end write_to_file
------------------------------------------------
------------------------------------------------
set dirs to {}
-- get the window path
tell application "iTerm"
tell current window
set i to 1
set _tabs to tabs
set len to the length of _tabs
repeat with _tab in tabs
tell current session of _tab
set _path to (variable named "session.path")
if i < len then
set dirs to dirs & { _path }
end if
end tell
set i to i + 1
end repeat
end tell
end tell
-- -- process path
set string_dirs to ""
set i to 1
repeat with dir in dirs
if i = 1 then
set string_dirs to "\"" & dir & "\""
else
set string_dirs to string_dirs & "," & "\"" & dir & "\""
end if
set i to i + 1
end repeat
-- generate code
set code to "
set dirs to { " & string_dirs & " }
tell application \"iTerm\"
set _window to (create window with default profile)
tell _window
set len to the length of dirs
repeat with i from 1 to len
set dir to item i of dirs
tell current session of current tab
write text \"cd \" & \"\\\"\" & dir & \"\\\"\"
end tell
if i < len
create tab with default profile
end if
end repeat
end tell
end tell
"
-- choose file name
set _prompt to "SaveTabs"
choose file name with prompt _prompt default name "" default location file "Macintosh HD:Users:hzh:Downloads"
set _path to the result
set _path to _path & ".iTerm2.applescript"
-- save code to the file
write_to_file(code, _path, false) |
SumoBot_Code_Dev/SumoBot_Maze/asm/src/sumomaze_boardtest.asm | CmdrZin/chips_avr_examples | 5 | 5109 | <gh_stars>1-10
/*
* Sumo Maze Bot Board Test Code
*
* org: 01/24/2015
* rev:
* auth: Nels "Chip" Pearson
*
* Target: Sumo Maze Bot Board, 20MHz, ATmega164P, Sumo Bot base
*
* Dependentcies
*
* Resources
* SRAM
*
* IO
*
*/
.equ SMB_STATUS_LED = PORTD2
.DSEG
smb_led1_toggle: .BYTE 1
.CSEG
/*
* PWM Test..Disable Demo service when using this function.
*/
smb_set_pwm:
lds R16, floor_det_status
andi R16, FLOOR_DET_CENTER ; test center only
brne smbs_skip00
ldi r18, high(PWM_R_MED_R)
ldi r17, low(PWM_R_MED_R)
call pwm_set_right
ret
;
smbs_skip00:
call pwm_stop_right
call pwm_stop_left
ret
/*
* LED control functions.
*/
smb_led1_on:
sbi DDRD, SMB_STATUS_LED
sbi PORTD, SMB_STATUS_LED
ret
smb_led1_off:
cbi PORTD, SMB_STATUS_LED ; D2 OFF
ret
/*
* Timer1 test
*/
smb_timer1_intr:
; Save SREG
push r0
in r0, SREG
push r0
;
push r16
;
lds r16, smb_led1_toggle
tst r16
breq smb_ti_skip00
call smb_led1_on
clr r16
rjmp smb_ti_update
;
smb_ti_skip00:
call smb_led1_off
ldi r16, 1
;
smb_ti_update:
sts smb_led1_toggle, r16
;
pop r16
; Restore SREG
pop r0
out SREG, r0
pop r0
;
reti
|
Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Ada/exceptions-catch-an-exception-thrown-in-a-nested-call.ada | LaudateCorpus1/RosettaCodeData | 1 | 3932 | <filename>Task/Exceptions-Catch-an-exception-thrown-in-a-nested-call/Ada/exceptions-catch-an-exception-thrown-in-a-nested-call.ada<gh_stars>1-10
with Ada.Text_Io; use Ada.Text_Io;
procedure Exceptions_From_Nested_Calls is
U0 : exception;
U1 : exception;
Baz_Count : Natural := 0;
procedure Baz is
begin
Baz_Count := Baz_Count + 1;
if Baz_Count = 1 then
raise U0;
else
raise U1;
end if;
end Baz;
procedure Bar is
begin
Baz;
end Bar;
procedure Foo is
begin
Bar;
exception
when U0 =>
Put_Line("Procedure Foo caught exception U0");
end Foo;
begin
for I in 1..2 loop
Foo;
end loop;
end Exceptions_From_Nested_Calls;
|
programs/oeis/167/A167520.asm | karttu/loda | 0 | 85579 | <gh_stars>0
; A167520: Positions of nonzero digits in this sequence, when all terms are concatenated.
; 1,2,3,4,5,6,7,8,9,10,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,68,69,70,71,72,73,74,75,76
mov $5,$0
add $0,1
mov $4,2
lpb $0,1
sub $0,2
add $0,$4
sub $3,$4
sub $3,$0
trn $3,1
sub $0,$3
add $1,2
mov $2,$0
sub $0,5
trn $0,$1
sub $2,1
mov $3,$1
sub $1,1
add $0,$1
trn $0,4
add $2,1
trn $3,3
add $3,$2
lpe
lpb $5,1
add $1,1
sub $5,1
lpe
|
Task/Exponentiation-operator/Ada/exponentiation-operator-2.ada | LaudateCorpus1/RosettaCodeData | 1 | 24214 | <gh_stars>1-10
with Ada.Float_Text_IO, Ada.Integer_Text_IO, Ada.Text_IO;
with Integer_Exponentiation;
procedure Test_Integer_Exponentiation is
use Ada.Float_Text_IO, Ada.Integer_Text_IO, Ada.Text_IO;
use Integer_Exponentiation;
R : Float;
I : Integer;
begin
Exponentiate (Argument => 2.5, Exponent => 3, Result => R);
Put ("2.5 ^ 3 = ");
Put (R, Fore => 2, Aft => 4, Exp => 0);
New_Line;
Exponentiate (Argument => -12, Exponent => 3, Result => I);
Put ("-12 ^ 3 = ");
Put (I, Width => 7);
New_Line;
end Test_Integer_Exponentiation;
|
Data/Binary/Proofs/Unary.agda | oisdk/agda-binary | 1 | 1791 | <gh_stars>1-10
{-# OPTIONS --without-K --safe #-}
module Data.Binary.Proofs.Unary where
open import Relation.Binary.PropositionalEquality
open import Data.Binary.Operations.Unary
open import Data.Binary.Definitions
open import Data.Binary.Operations.Semantics
open import Data.Nat as ℕ using (ℕ; suc; zero)
open import Relation.Binary.PropositionalEquality.FasterReasoning
import Data.Nat.Properties as ℕ
open import Function
inc⁺⁺-homo : ∀ xs → ⟦ inc⁺⁺ xs ⇓⟧⁺ ≡ suc ⟦ xs ⇓⟧⁺
inc⁺⁺-homo 1ᵇ = refl
inc⁺⁺-homo (O ∷ xs) = refl
inc⁺⁺-homo (I ∷ xs) =
begin
2* ⟦ inc⁺⁺ xs ⇓⟧⁺
≡⟨ cong 2* (inc⁺⁺-homo xs) ⟩
2* (suc ⟦ xs ⇓⟧⁺)
≡⟨⟩
(suc ⟦ xs ⇓⟧⁺) ℕ.+ suc ⟦ xs ⇓⟧⁺
≡⟨ ℕ.+-suc (suc ⟦ xs ⇓⟧⁺) ⟦ xs ⇓⟧⁺ ⟩
suc (suc (2* ⟦ xs ⇓⟧⁺))
∎
inc-homo : ∀ x → ⟦ inc x ⇓⟧ ≡ suc ⟦ x ⇓⟧
inc-homo 0ᵇ = refl
inc-homo (0< xs) = inc⁺⁺-homo xs
open import Data.Product
⟦x⇓⟧⁺≡suc : ∀ x → ∃[ n ] (⟦ x ⇓⟧⁺ ≡ suc n)
⟦x⇓⟧⁺≡suc 1ᵇ = 0 , refl
⟦x⇓⟧⁺≡suc (I ∷ x) = 2* ⟦ x ⇓⟧⁺ , refl
⟦x⇓⟧⁺≡suc (O ∷ x) with ⟦x⇓⟧⁺≡suc x
⟦x⇓⟧⁺≡suc (O ∷ x) | fst , snd = suc (2* fst) , (cong 2* snd ⟨ trans ⟩ (ℕ.+-suc (suc fst) _))
⟦x⇓⟧⁺≢0 : ∀ x → ⟦ x ⇓⟧⁺ ≢ 0
⟦x⇓⟧⁺≢0 x x≡0 with ⟦x⇓⟧⁺≡suc x
⟦x⇓⟧⁺≢0 x x≡0 | _ , prf with sym x≡0 ⟨ trans ⟩ prf
⟦x⇓⟧⁺≢0 x x≡0 | _ , prf | ()
open import Data.Empty
inc-dec⁺⁺ : ∀ x xs → inc⁺⁺ (dec⁺⁺ x xs) ≡ x ∷ xs
inc-dec⁺⁺ I xs = refl
inc-dec⁺⁺ O 1ᵇ = refl
inc-dec⁺⁺ O (x ∷ xs) = cong (O ∷_) (inc-dec⁺⁺ x xs)
inc-dec : ∀ xs → inc⁺ (dec⁺ xs) ≡ xs
inc-dec 1ᵇ = refl
inc-dec (x ∷ xs) = inc-dec⁺⁺ x xs
data IncView : 𝔹 → ℕ → Set where
Izero : IncView 0ᵇ 0
Isuc : ∀ {n xs ys} → inc xs ≡ ys → IncView xs n → IncView ys (suc n)
inc-view : ∀ xs → IncView xs ⟦ xs ⇓⟧
inc-view xs = go _ xs refl
where
go : ∀ n xs → ⟦ xs ⇓⟧ ≡ n → IncView xs n
go .0 0ᵇ refl = Izero
go zero (0< xs) eq = ⊥-elim (⟦x⇓⟧⁺≢0 xs eq)
go (suc n) (0< xs) eq =
Isuc
(cong 0<_ (inc-dec xs))
(go n (dec⁺ xs)
(ℕ.suc-injective (sym (inc-homo (dec⁺ xs)) ⟨ trans ⟩ cong ⟦_⇓⟧⁺ (inc-dec xs) ⟨ trans ⟩ eq)))
|
third_party/heif_decoder/src/main/cpp/libx265/common/x86/sad16-a.asm | vy12021/glide_webp | 14 | 5395 | <reponame>vy12021/glide_webp<filename>third_party/heif_decoder/src/main/cpp/libx265/common/x86/sad16-a.asm
;*****************************************************************************
;* sad16-a.asm: x86 high depth sad functions
;*****************************************************************************
;* Copyright (C) 2003-2013 x264 project
;* Copyright (C) 2013-2017 MulticoreWare, Inc
;*
;* Authors: <NAME> <<EMAIL>>
;* <NAME> <<EMAIL>>
;* <NAME> <<EMAIL>>
;* <NAME> <<EMAIL>>
;*
;* This program is free software; you can redistribute it and/or modify
;* it under the terms of the GNU General Public License as published by
;* the Free Software Foundation; either version 2 of the License, or
;* (at your option) any later version.
;*
;* This program is distributed in the hope that it will be useful,
;* but WITHOUT ANY WARRANTY; without even the implied warranty of
;* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;* GNU General Public License for more details.
;*
;* You should have received a copy of the GNU General Public License
;* along with this program; if not, write to the Free Software
;* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
;*
;* This program is also available under a commercial proprietary license.
;* For more information, contact us at license @ x265.com.
;*****************************************************************************
%include "x86inc.asm"
%include "x86util.asm"
SECTION .text
cextern pw_1
;=============================================================================
; SAD MMX
;=============================================================================
%macro SAD_INC_1x16P_MMX 0
movu m1, [r0+ 0]
movu m2, [r0+ 8]
movu m3, [r0+16]
movu m4, [r0+24]
psubw m1, [r2+ 0]
psubw m2, [r2+ 8]
psubw m3, [r2+16]
psubw m4, [r2+24]
ABSW2 m1, m2, m1, m2, m5, m6
ABSW2 m3, m4, m3, m4, m7, m5
lea r0, [r0+2*r1]
lea r2, [r2+2*r3]
paddw m1, m2
paddw m3, m4
%if BIT_DEPTH <= 10
paddw m0, m1
paddw m0, m3
%else
paddw m1, m3
pmaddwd m1, [pw_1]
paddd m0, m1
%endif
%endmacro
%macro SAD_INC_2x8P_MMX 0
movu m1, [r0+0]
movu m2, [r0+8]
movu m3, [r0+2*r1+0]
movu m4, [r0+2*r1+8]
psubw m1, [r2+0]
psubw m2, [r2+8]
psubw m3, [r2+2*r3+0]
psubw m4, [r2+2*r3+8]
ABSW2 m1, m2, m1, m2, m5, m6
ABSW2 m3, m4, m3, m4, m7, m5
lea r0, [r0+4*r1]
lea r2, [r2+4*r3]
paddw m1, m2
paddw m3, m4
%if BIT_DEPTH <= 10
paddw m0, m1
paddw m0, m3
%else
paddw m1, m3
pmaddwd m1, [pw_1]
paddd m0, m1
%endif
%endmacro
%macro SAD_INC_2x4P_MMX 0
movu m1, [r0]
movu m2, [r0+2*r1]
psubw m1, [r2]
psubw m2, [r2+2*r3]
ABSW2 m1, m2, m1, m2, m3, m4
lea r0, [r0+4*r1]
lea r2, [r2+4*r3]
%if BIT_DEPTH <= 10
paddw m0, m1
paddw m0, m2
%else
paddw m1, m2
pmaddwd m1, [pw_1]
paddd m0, m1
%endif
%endmacro
;-----------------------------------------------------------------------------
; int pixel_sad_NxM( uint16_t *, intptr_t, uint16_t *, intptr_t )
;-----------------------------------------------------------------------------
%macro SAD_MMX 3
cglobal pixel_sad_%1x%2, 4,5-(%2&4/4)
pxor m0, m0
%if %2 == 4
SAD_INC_%3x%1P_MMX
SAD_INC_%3x%1P_MMX
%else
mov r4d, %2/%3
.loop:
SAD_INC_%3x%1P_MMX
dec r4d
jg .loop
%endif
%if %1*%2 == 256
%if BIT_DEPTH <= 10
HADDUW m0, m1
%else
HADDD m0, m1
%endif
%else
%if BIT_DEPTH <= 10
HADDW m0, m1
%else
HADDD m0, m1
%endif
%endif
movd eax, m0
RET
%endmacro
INIT_MMX mmx2
SAD_MMX 16, 16, 1
SAD_MMX 16, 8, 1
SAD_MMX 8, 16, 2
SAD_MMX 8, 8, 2
SAD_MMX 8, 4, 2
SAD_MMX 4, 8, 2
SAD_MMX 4, 4, 2
SAD_MMX 4, 16, 2
INIT_MMX ssse3
SAD_MMX 4, 8, 2
SAD_MMX 4, 4, 2
;=============================================================================
; SAD XMM
;=============================================================================
%macro SAD_1x32 0
movu m1, [r2+ 0]
movu m2, [r2+16]
movu m3, [r2+32]
movu m4, [r2+48]
psubw m1, [r0+0]
psubw m2, [r0+16]
psubw m3, [r0+32]
psubw m4, [r0+48]
ABSW2 m1, m2, m1, m2, m5, m6
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
lea r0, [r0+2*r1]
lea r2, [r2+2*r3]
ABSW2 m3, m4, m3, m4, m7, m5
pmaddwd m3, [pw_1]
pmaddwd m4, [pw_1]
paddd m1, m2
paddd m3, m4
paddd m0, m1
paddd m0, m3
%endmacro
%macro SAD_1x24 0
movu m1, [r2+ 0]
movu m2, [r2+16]
movu m3, [r2+32]
psubw m1, [r0+0]
psubw m2, [r0+16]
psubw m3, [r0+32]
ABSW2 m1, m2, m1, m2, m4, m6
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
lea r0, [r0+2*r1]
lea r2, [r2+2*r3]
pxor m4, m4
psubw m4, m3
pmaxsw m3, m4
pmaddwd m3, [pw_1]
paddd m1, m2
paddd m0, m1
paddd m0, m3
%endmacro
%macro SAD_1x48 0
movu m1, [r2+ 0]
movu m2, [r2+16]
movu m3, [r2+32]
movu m4, [r2+48]
psubw m1, [r0+0]
psubw m2, [r0+16]
psubw m3, [r0+32]
psubw m4, [r0+48]
ABSW2 m1, m2, m1, m2, m5, m6
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
ABSW2 m3, m4, m3, m4, m7, m5
pmaddwd m3, [pw_1]
pmaddwd m4, [pw_1]
paddd m1, m2
paddd m3, m4
paddd m0, m1
paddd m0, m3
movu m1, [r2+64]
movu m2, [r2+80]
psubw m1, [r0+64]
psubw m2, [r0+80]
ABSW2 m1, m2, m1, m2, m3, m4
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
lea r0, [r0+2*r1]
lea r2, [r2+2*r3]
paddd m0, m1
paddd m0, m2
%endmacro
%macro SAD_1x64 0
movu m1, [r2+ 0]
movu m2, [r2+16]
movu m3, [r2+32]
movu m4, [r2+48]
psubw m1, [r0+0]
psubw m2, [r0+16]
psubw m3, [r0+32]
psubw m4, [r0+48]
ABSW2 m1, m2, m1, m2, m5, m6
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
ABSW2 m3, m4, m3, m4, m7, m5
pmaddwd m3, [pw_1]
pmaddwd m4, [pw_1]
paddd m1, m2
paddd m3, m4
paddd m0, m1
paddd m0, m3
movu m1, [r2+64]
movu m2, [r2+80]
movu m3, [r2+96]
movu m4, [r2+112]
psubw m1, [r0+64]
psubw m2, [r0+80]
psubw m3, [r0+96]
psubw m4, [r0+112]
ABSW2 m1, m2, m1, m2, m5, m6
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
ABSW2 m3, m4, m3, m4, m7, m5
pmaddwd m3, [pw_1]
pmaddwd m4, [pw_1]
paddd m1, m2
paddd m3, m4
paddd m0, m1
paddd m0, m3
lea r0, [r0+2*r1]
lea r2, [r2+2*r3]
%endmacro
%macro SAD_1x12 0
movu m1, [r2+0]
movh m2, [r2+16]
psubw m1, [r0+0]
movh m3, [r0+16]
psubw m2, m3
ABSW2 m1, m2, m1, m2, m4, m6
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
lea r0, [r0+2*r1]
lea r2, [r2+2*r3]
paddd m1, m2
paddd m0, m1
%endmacro
%macro SAD_INC_2ROW 1
%if 2*%1 > mmsize
movu m1, [r2+ 0]
movu m2, [r2+16]
movu m3, [r2+2*r3+ 0]
movu m4, [r2+2*r3+16]
psubw m1, [r0+ 0]
psubw m2, [r0+16]
psubw m3, [r0+2*r1+ 0]
psubw m4, [r0+2*r1+16]
ABSW2 m1, m2, m1, m2, m5, m6
lea r0, [r0+4*r1]
lea r2, [r2+4*r3]
ABSW2 m3, m4, m3, m4, m7, m5
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m1, [pw_1]
paddd m0, m1
%else
movu m1, [r2]
movu m2, [r2+2*r3]
psubw m1, [r0]
psubw m2, [r0+2*r1]
ABSW2 m1, m2, m1, m2, m3, m4
lea r0, [r0+4*r1]
lea r2, [r2+4*r3]
paddw m1, m2
pmaddwd m1, [pw_1]
paddd m0, m1
%endif
%endmacro
%macro SAD_INC_2ROW_Nx64 1
%if 2*%1 > mmsize
movu m1, [r2 + 0]
movu m2, [r2 + 16]
movu m3, [r2 + 2 * r3 + 0]
movu m4, [r2 + 2 * r3 + 16]
psubw m1, [r0 + 0]
psubw m2, [r0 + 16]
psubw m3, [r0 + 2 * r1 + 0]
psubw m4, [r0 + 2 * r1 + 16]
ABSW2 m1, m2, m1, m2, m5, m6
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
ABSW2 m3, m4, m3, m4, m7, m5
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m1, [pw_1]
paddd m0, m1
%else
movu m1, [r2]
movu m2, [r2 + 2 * r3]
psubw m1, [r0]
psubw m2, [r0 + 2 * r1]
ABSW2 m1, m2, m1, m2, m3, m4
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
paddw m1, m2
pmaddwd m1, [pw_1]
paddd m0, m1
%endif
%endmacro
; ---------------------------------------------------------------------------- -
; int pixel_sad_NxM(uint16_t *, intptr_t, uint16_t *, intptr_t)
; ---------------------------------------------------------------------------- -
%macro SAD 2
cglobal pixel_sad_%1x%2, 4,5,8
pxor m0, m0
%if %2 == 4
SAD_INC_2ROW %1
SAD_INC_2ROW %1
%else
mov r4d, %2/2
.loop:
SAD_INC_2ROW %1
dec r4d
jg .loop
%endif
HADDD m0, m1
movd eax, xm0
RET
%endmacro
; ---------------------------------------------------------------------------- -
; int pixel_sad_Nx64(uint16_t *, intptr_t, uint16_t *, intptr_t)
; ---------------------------------------------------------------------------- -
%macro SAD_Nx64 1
cglobal pixel_sad_%1x64, 4,5, 8
pxor m0, m0
mov r4d, 64 / 2
.loop:
SAD_INC_2ROW_Nx64 %1
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
%endmacro
INIT_XMM sse2
SAD 16, 4
SAD 16, 8
SAD 16, 12
SAD 16, 16
SAD 16, 32
SAD_Nx64 16
INIT_XMM sse2
SAD 8, 4
SAD 8, 8
SAD 8, 16
SAD 8, 32
INIT_YMM avx2
SAD 16, 4
SAD 16, 8
SAD 16, 12
SAD 16, 16
SAD 16, 32
INIT_YMM avx2
cglobal pixel_sad_16x64, 4,5,5
pxor m0, m0
mov r4d, 16
mova m4, [pw_1]
.loop:
movu m1, [r2]
movu m2, [r2 + r3 * 2]
psubw m1, [r0]
psubw m2, [r0 + r1 * 2]
pabsw m1, m1
pabsw m2, m2
paddw m3, m1, m2
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
movu m1, [r2]
movu m2, [r2 + r3 * 2]
psubw m1, [r0]
psubw m2, [r0 + r1 * 2]
pabsw m1, m1
pabsw m2, m2
paddw m1, m2
pmaddwd m3, m4
paddd m0, m3
pmaddwd m1, m4
paddd m0, m1
lea r0, [r0+4*r1]
lea r2, [r2+4*r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_32x8, 4,7,7
pxor m0, m0
mov r4d, 8/4
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r5d, [r1 * 3]
lea r6d, [r3 * 3]
.loop:
movu m1, [r2]
movu m2, [r2 + 32]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + 32]
psubw m1, [r0]
psubw m2, [r0 + 32]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + 32]
movu m3, [r2 + r6]
movu m4, [r2 + r6 + 32]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + 32]
psubw m3, [r0 + r5]
psubw m4, [r0 + r5 + 32]
pabsw m1, m1
pabsw m2, m2
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_32x16, 4,7,7
pxor m0, m0
mov r4d, 16/8
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r5d, [r1 * 3]
lea r6d, [r3 * 3]
.loop:
movu m1, [r2]
movu m2, [r2 + 32]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + 32]
psubw m1, [r0]
psubw m2, [r0 + 32]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + 32]
movu m3, [r2 + r6]
movu m4, [r2 + r6 + 32]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + 32]
psubw m3, [r0 + r5]
psubw m4, [r0 + r5 + 32]
pabsw m1, m1
pabsw m2, m2
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
movu m1, [r2]
movu m2, [r2 + 32]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + 32]
psubw m1, [r0]
psubw m2, [r0 + 32]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + 32]
movu m3, [r2 + r6]
movu m4, [r2 + r6 + 32]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + 32]
psubw m3, [r0 + r5]
psubw m4, [r0 + r5 + 32]
pabsw m1, m1
pabsw m2, m2
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_32x24, 4,7,7
pxor m0, m0
mov r4d, 24/4
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r5d, [r1 * 3]
lea r6d, [r3 * 3]
.loop:
movu m1, [r2]
movu m2, [r2 + 32]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + 32]
psubw m1, [r0]
psubw m2, [r0 + 32]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + 32]
movu m3, [r2 + r6]
movu m4, [r2 + r6 + 32]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + 32]
psubw m3, [r0 + r5]
psubw m4, [r0 + r5 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_32x32, 4,7,7
pxor m0, m0
mov r4d, 32/4
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r5d, [r1 * 3]
lea r6d, [r3 * 3]
.loop:
movu m1, [r2]
movu m2, [r2 + 32]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + 32]
psubw m1, [r0]
psubw m2, [r0 + 32]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + 32]
movu m3, [r2 + r6]
movu m4, [r2 + r6 + 32]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + 32]
psubw m3, [r0 + r5]
psubw m4, [r0 + r5 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_32x64, 4,7,7
pxor m0, m0
mov r4d, 64 / 4
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r5d, [r1 * 3]
lea r6d, [r3 * 3]
.loop:
movu m1, [r2]
movu m2, [r2 + 32]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + 32]
psubw m1, [r0]
psubw m2, [r0 + 32]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + 32]
movu m3, [r2 + r6]
movu m4, [r2 + r6 + 32]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + 32]
psubw m3, [r0 + r5]
psubw m4, [r0 + r5 + 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_48x64, 4, 5, 7
pxor m0, m0
mov r4d, 64/2
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
.loop:
movu m1, [r2 + 0 * mmsize]
movu m2, [r2 + 1 * mmsize]
movu m3, [r2 + 2 * mmsize]
psubw m1, [r0 + 0 * mmsize]
psubw m2, [r0 + 1 * mmsize]
psubw m3, [r0 + 2 * mmsize]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
paddw m1, m2
paddw m5, m3, m1
movu m1, [r2 + r3 + 0 * mmsize]
movu m2, [r2 + r3 + 1 * mmsize]
movu m3, [r2 + r3 + 2 * mmsize]
psubw m1, [r0 + r1 + 0 * mmsize]
psubw m2, [r0 + r1 + 1 * mmsize]
psubw m3, [r0 + r1 + 2 * mmsize]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
paddw m1, m2
paddw m3, m1
pmaddwd m5, m6
paddd m0, m5
pmaddwd m3, m6
paddd m0, m3
lea r0, [r0 + 2 * r1]
lea r2, [r2 + 2 * r3]
dec r4d
jg .loop
HADDD m0, m3
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_64x16, 4, 5, 7
pxor m0, m0
mov r4d, 16 / 2
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
.loop:
movu m1, [r2 + 0]
movu m2, [r2 + 32]
movu m3, [r2 + 2 * 32]
movu m4, [r2 + 3 * 32]
psubw m1, [r0 + 0]
psubw m2, [r0 + 32]
psubw m3, [r0 + 2 * 32]
psubw m4, [r0 + 3 * 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + r3]
movu m2, [r2 + r3 + 32]
movu m3, [r2 + r3 + 64]
movu m4, [r2 + r3 + 96]
psubw m1, [r0 + r1]
psubw m2, [r0 + r1 + 32]
psubw m3, [r0 + r1 + 64]
psubw m4, [r0 + r1 + 96]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
lea r0, [r0 + 2 * r1]
lea r2, [r2 + 2 * r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_64x32, 4, 5, 7
pxor m0, m0
mov r4d, 32 / 2
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
.loop:
movu m1, [r2 + 0]
movu m2, [r2 + 32]
movu m3, [r2 + 2 * 32]
movu m4, [r2 + 3 * 32]
psubw m1, [r0 + 0]
psubw m2, [r0 + 32]
psubw m3, [r0 + 2 * 32]
psubw m4, [r0 + 3 * 32]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + r3]
movu m2, [r2 + r3 + 32]
movu m3, [r2 + r3 + 64]
movu m4, [r2 + r3 + 96]
psubw m1, [r0 + r1]
psubw m2, [r0 + r1 + 32]
psubw m3, [r0 + r1 + 64]
psubw m4, [r0 + r1 + 96]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
lea r0, [r0 + 2 * r1]
lea r2, [r2 + 2 * r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_64x48, 4, 5, 7
pxor m0, m0
mov r4d, 48 / 2
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
.loop:
movu m1, [r2 + 0]
movu m2, [r2 + 32]
movu m3, [r2 + 64]
movu m4, [r2 + 96]
psubw m1, [r0 + 0]
psubw m2, [r0 + 32]
psubw m3, [r0 + 64]
psubw m4, [r0 + 96]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + r3]
movu m2, [r2 + r3 + 32]
movu m3, [r2 + r3 + 64]
movu m4, [r2 + r3 + 96]
psubw m1, [r0 + r1]
psubw m2, [r0 + r1 + 32]
psubw m3, [r0 + r1 + 64]
psubw m4, [r0 + r1 + 96]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
lea r0, [r0 + 2 * r1]
lea r2, [r2 + 2 * r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
INIT_YMM avx2
cglobal pixel_sad_64x64, 4, 5, 7
pxor m0, m0
mov r4d, 64 / 2
mova m6, [pw_1]
add r3d, r3d
add r1d, r1d
.loop:
movu m1, [r2 + 0]
movu m2, [r2 + 32]
movu m3, [r2 + 64]
movu m4, [r2 + 96]
psubw m1, [r0 + 0]
psubw m2, [r0 + 32]
psubw m3, [r0 + 64]
psubw m4, [r0 + 96]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + r3]
movu m2, [r2 + r3 + 32]
movu m3, [r2 + r3 + 64]
movu m4, [r2 + r3 + 96]
psubw m1, [r0 + r1]
psubw m2, [r0 + r1 + 32]
psubw m3, [r0 + r1 + 64]
psubw m4, [r0 + r1 + 96]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
lea r0, [r0 + 2 * r1]
lea r2, [r2 + 2 * r3]
dec r4d
jg .loop
HADDD m0, m1
movd eax, xm0
RET
;------------------------------------------------------------------
; int pixel_sad_32xN( uint16_t *, intptr_t, uint16_t *, intptr_t )
;------------------------------------------------------------------
%macro SAD_32 2
cglobal pixel_sad_%1x%2, 4,5,8
pxor m0, m0
mov r4d, %2/4
.loop:
SAD_1x32
SAD_1x32
SAD_1x32
SAD_1x32
dec r4d
jnz .loop
HADDD m0, m1
movd eax, xm0
RET
%endmacro
INIT_XMM sse2
SAD_32 32, 8
SAD_32 32, 16
SAD_32 32, 24
SAD_32 32, 32
SAD_32 32, 64
;------------------------------------------------------------------
; int pixel_sad_64xN( uint16_t *, intptr_t, uint16_t *, intptr_t )
;------------------------------------------------------------------
%macro SAD_64 2
cglobal pixel_sad_%1x%2, 4,5,8
pxor m0, m0
mov r4d, %2/4
.loop:
SAD_1x64
SAD_1x64
SAD_1x64
SAD_1x64
dec r4d
jnz .loop
HADDD m0, m1
movd eax, xmm0
RET
%endmacro
INIT_XMM sse2
SAD_64 64, 16
SAD_64 64, 32
SAD_64 64, 48
SAD_64 64, 64
;------------------------------------------------------------------
; int pixel_sad_48xN( uint16_t *, intptr_t, uint16_t *, intptr_t )
;------------------------------------------------------------------
%macro SAD_48 2
cglobal pixel_sad_%1x%2, 4,5,8
pxor m0, m0
mov r4d, %2/4
.loop:
SAD_1x48
SAD_1x48
SAD_1x48
SAD_1x48
dec r4d
jnz .loop
HADDD m0, m1
movd eax, xmm0
RET
%endmacro
INIT_XMM sse2
SAD_48 48, 64
;------------------------------------------------------------------
; int pixel_sad_24xN( uint16_t *, intptr_t, uint16_t *, intptr_t )
;------------------------------------------------------------------
%macro SAD_24 2
cglobal pixel_sad_%1x%2, 4,5,8
pxor m0, m0
mov r4d, %2/4
.loop:
SAD_1x24
SAD_1x24
SAD_1x24
SAD_1x24
dec r4d
jnz .loop
HADDD m0, m1
movd eax, xmm0
RET
%endmacro
INIT_XMM sse2
SAD_24 24, 32
;------------------------------------------------------------------
; int pixel_sad_12xN( uint16_t *, intptr_t, uint16_t *, intptr_t )
;------------------------------------------------------------------
%macro SAD_12 2
cglobal pixel_sad_%1x%2, 4,5,8
pxor m0, m0
mov r4d, %2/4
.loop:
SAD_1x12
SAD_1x12
SAD_1x12
SAD_1x12
dec r4d
jnz .loop
HADDD m0, m1
movd eax, xmm0
RET
%endmacro
INIT_XMM sse2
SAD_12 12, 16
%macro PROCESS_SAD_64x8_AVX512 0
movu m1, [r2]
movu m2, [r2 + mmsize]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + mmsize]
psubw m1, [r0]
psubw m2, [r0 + mmsize]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + mmsize]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + mmsize]
movu m3, [r2 + r5]
movu m4, [r2 + r5 + mmsize]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + mmsize]
psubw m3, [r0 + r4]
psubw m4, [r0 + r4 + mmsize]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
movu m1, [r2]
movu m2, [r2 + mmsize]
movu m3, [r2 + r3]
movu m4, [r2 + r3 + mmsize]
psubw m1, [r0]
psubw m2, [r0 + mmsize]
psubw m3, [r0 + r1]
psubw m4, [r0 + r1 + mmsize]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
movu m1, [r2 + 2 * r3]
movu m2, [r2 + 2 * r3 + mmsize]
movu m3, [r2 + r5]
movu m4, [r2 + r5 + mmsize]
psubw m1, [r0 + 2 * r1]
psubw m2, [r0 + 2 * r1 + mmsize]
psubw m3, [r0 + r4]
psubw m4, [r0 + r4 + mmsize]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
%endmacro
%macro PROCESS_SAD_32x8_AVX512 0
movu m1, [r2]
movu m2, [r2 + r3]
movu m3, [r2 + 2 * r3]
movu m4, [r2 + r5]
psubw m1, [r0]
psubw m2, [r0 + r1]
psubw m3, [r0 + 2 * r1]
psubw m4, [r0 + r4]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m5, m1, m3
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
movu m1, [r2]
movu m2, [r2 + r3]
movu m3, [r2 + 2 * r3]
movu m4, [r2 + r5]
psubw m1, [r0]
psubw m2, [r0 + r1]
psubw m3, [r0 + 2 * r1]
psubw m4, [r0 + r4]
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
pabsw m4, m4
paddw m1, m2
paddw m3, m4
paddw m1, m3
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
%endmacro
%macro PROCESS_SAD_16x8_AVX512 0
movu ym1, [r2]
vinserti64x4 m1, [r2 + r3], 1
movu ym2, [r2 + 2 * r3]
vinserti64x4 m2, [r2 + r5], 1
movu ym3, [r0]
vinserti64x4 m3, [r0 + r1], 1
movu ym4, [r0 + 2 * r1]
vinserti64x4 m4, [r0 + r4], 1
psubw m1, m3
psubw m2, m4
pabsw m1, m1
pabsw m2, m2
paddw m5, m1, m2
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
movu ym1, [r2]
vinserti64x4 m1, [r2 + r3], 1
movu ym2, [r2 + 2 * r3]
vinserti64x4 m2, [r2 + r5], 1
movu ym3, [r0]
vinserti64x4 m3, [r0 + r1], 1
movu ym4, [r0 + 2 * r1]
vinserti64x4 m4, [r0 + r4], 1
psubw m1, m3
psubw m2, m4
pabsw m1, m1
pabsw m2, m2
paddw m1, m2
pmaddwd m5, m6
paddd m0, m5
pmaddwd m1, m6
paddd m0, m1
%endmacro
%macro PROCESS_SAD_AVX512_END 0
vextracti32x8 ym1, m0, 1
paddd ym0, ym1
vextracti64x2 xm1, m0, 1
paddd xm0, xm1
pshufd xm1, xm0, 00001110b
paddd xm0, xm1
pshufd xm1, xm0, 00000001b
paddd xm0, xm1
movd eax, xm0
%endmacro
;-----------------------------------------------------------------------------
; int pixel_sad_64x%1( uint16_t *, intptr_t, uint16_t *, intptr_t )
;-----------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_64x16, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_64x32, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_64x48, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_64x64, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_64x8_AVX512
PROCESS_SAD_AVX512_END
RET
%endif
;-----------------------------------------------------------------------------
; int pixel_sad_32x%1( uint16_t *, intptr_t, uint16_t *, intptr_t )
;-----------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_32x8, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_32x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_32x16, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_32x24, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_32x32, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_32x64, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
PROCESS_SAD_32x8_AVX512
PROCESS_SAD_AVX512_END
RET
%endif
;-----------------------------------------------------------------------------
; int pixel_sad_16x%1( uint16_t *, intptr_t, uint16_t *, intptr_t )
;-----------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_16x32, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
%rep 3
PROCESS_SAD_16x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
%endrep
PROCESS_SAD_16x8_AVX512
PROCESS_SAD_AVX512_END
RET
INIT_ZMM avx512
cglobal pixel_sad_16x64, 4,6,7
pxor m0, m0
vbroadcasti32x8 m6, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
%rep 7
PROCESS_SAD_16x8_AVX512
lea r2, [r2 + 4 * r3]
lea r0, [r0 + 4 * r1]
%endrep
PROCESS_SAD_16x8_AVX512
PROCESS_SAD_AVX512_END
RET
%endif
;-----------------------------------------------------------------------------
; int pixel_sad_48x64( uint16_t *, intptr_t, uint16_t *, intptr_t )
;-----------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_48x64, 4, 7, 9
pxor m0, m0
mov r6d, 64/8
vbroadcasti32x8 m8, [pw_1]
add r3d, r3d
add r1d, r1d
lea r4d, [r1 * 3]
lea r5d, [r3 * 3]
.loop:
movu m1, [r2]
movu m2, [r2 + r3]
movu ym3, [r2 + mmsize]
vinserti32x8 m3, [r2 + r3 + mmsize], 1
movu m4, [r0]
movu m5, [r0 + r1]
movu ym6, [r0 + mmsize]
vinserti32x8 m6, [r0 + r1 + mmsize], 1
psubw m1, m4
psubw m2, m5
psubw m3, m6
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
paddw m1, m2
paddw m7, m3, m1
movu m1, [r2 + 2 * r3]
movu m2, [r2 + r5]
movu ym3, [r2 + 2 * r3 + mmsize]
vinserti32x8 m3, [r2 + r5 + mmsize], 1
movu m4, [r0 + 2 * r1]
movu m5, [r0 + r4]
movu ym6, [r0 + 2 * r1 + mmsize]
vinserti32x8 m6, [r0 + r4 + mmsize], 1
psubw m1, m4
psubw m2, m5
psubw m3, m6
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
paddw m1, m2
paddw m1, m3
pmaddwd m7, m8
paddd m0, m7
pmaddwd m1, m8
paddd m0, m1
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
movu m1, [r2]
movu m2, [r2 + r3]
movu ym3, [r2 + mmsize]
vinserti32x8 m3, [r2 + r3 + mmsize], 1
movu m4, [r0]
movu m5, [r0 + r1]
movu ym6, [r0 + mmsize]
vinserti32x8 m6, [r0 + r1 + mmsize], 1
psubw m1, m4
psubw m2, m5
psubw m3, m6
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
paddw m1, m2
paddw m7, m3, m1
movu m1, [r2 + 2 * r3]
movu m2, [r2 + r5]
movu ym3, [r2 + 2 * r3 + mmsize]
vinserti32x8 m3, [r2 + r5 + mmsize], 1
movu m4, [r0 + 2 * r1]
movu m5, [r0 + r4]
movu ym6, [r0 + 2 * r1 + mmsize]
vinserti32x8 m6, [r0 + r4 + mmsize], 1
psubw m1, m4
psubw m2, m5
psubw m3, m6
pabsw m1, m1
pabsw m2, m2
pabsw m3, m3
paddw m1, m2
paddw m1, m3
pmaddwd m7, m8
paddd m0, m7
pmaddwd m1, m8
paddd m0, m1
lea r0, [r0 + 4 * r1]
lea r2, [r2 + 4 * r3]
dec r6d
jg .loop
PROCESS_SAD_AVX512_END
RET
%endif
;=============================================================================
; SAD x3/x4
;=============================================================================
%macro SAD_X3_INC_P 0
add r0, 4*FENC_STRIDE
lea r1, [r1+4*r4]
lea r2, [r2+4*r4]
lea r3, [r3+4*r4]
%endmacro
%macro SAD_X3_ONE_START 0
mova m3, [r0]
movu m0, [r1]
movu m1, [r2]
movu m2, [r3]
psubw m0, m3
psubw m1, m3
psubw m2, m3
ABSW2 m0, m1, m0, m1, m4, m5
ABSW m2, m2, m6
pmaddwd m0, [pw_1]
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
%endmacro
%macro SAD_X3_ONE 2
mova m6, [r0+%1]
movu m3, [r1+%2]
movu m4, [r2+%2]
movu m5, [r3+%2]
psubw m3, m6
psubw m4, m6
psubw m5, m6
ABSW2 m3, m4, m3, m4, m7, m6
ABSW m5, m5, m6
pmaddwd m3, [pw_1]
pmaddwd m4, [pw_1]
pmaddwd m5, [pw_1]
paddd m0, m3
paddd m1, m4
paddd m2, m5
%endmacro
%macro SAD_X3_END 2
%if mmsize == 8 && %1*%2 == 256
HADDUW m0, m3
HADDUW m1, m4
HADDUW m2, m5
%else
HADDD m0, m3
HADDD m1, m4
HADDD m2, m5
%endif
%if UNIX64
movd [r5+0], xm0
movd [r5+4], xm1
movd [r5+8], xm2
%else
mov r0, r5mp
movd [r0+0], xm0
movd [r0+4], xm1
movd [r0+8], xm2
%endif
RET
%endmacro
%macro SAD_X4_INC_P 0
add r0, 4*FENC_STRIDE
lea r1, [r1+4*r5]
lea r2, [r2+4*r5]
lea r3, [r3+4*r5]
lea r4, [r4+4*r5]
%endmacro
%macro SAD_X4_ONE_START 0
mova m4, [r0]
movu m0, [r1]
movu m1, [r2]
movu m2, [r3]
movu m3, [r4]
psubw m0, m4
psubw m1, m4
psubw m2, m4
psubw m3, m4
ABSW2 m0, m1, m0, m1, m5, m6
ABSW2 m2, m3, m2, m3, m4, m7
pmaddwd m0, [pw_1]
pmaddwd m1, [pw_1]
pmaddwd m2, [pw_1]
pmaddwd m3, [pw_1]
%endmacro
%macro SAD_X4_ONE 2
mova m4, [r0+%1]
movu m5, [r1+%2]
movu m6, [r2+%2]
%if num_mmregs > 8
movu m7, [r3+%2]
movu m8, [r4+%2]
psubw m5, m4
psubw m6, m4
psubw m7, m4
psubw m8, m4
ABSW2 m5, m6, m5, m6, m9, m10
ABSW2 m7, m8, m7, m8, m9, m10
pmaddwd m5, [pw_1]
pmaddwd m6, [pw_1]
pmaddwd m7, [pw_1]
pmaddwd m8, [pw_1]
paddd m0, m5
paddd m1, m6
paddd m2, m7
paddd m3, m8
%elif cpuflag(ssse3)
movu m7, [r3+%2]
psubw m5, m4
psubw m6, m4
psubw m7, m4
movu m4, [r4+%2]
pabsw m5, m5
psubw m4, [r0+%1]
pabsw m6, m6
pabsw m7, m7
pabsw m4, m4
pmaddwd m5, [pw_1]
pmaddwd m6, [pw_1]
pmaddwd m7, [pw_1]
pmaddwd m4, [pw_1]
paddd m0, m5
paddd m1, m6
paddd m2, m7
paddd m3, m4
%else ; num_mmregs == 8 && !ssse3
psubw m5, m4
psubw m6, m4
ABSW m5, m5, m7
ABSW m6, m6, m7
pmaddwd m5, [pw_1]
pmaddwd m6, [pw_1]
paddd m0, m5
paddd m1, m6
movu m5, [r3+%2]
movu m6, [r4+%2]
psubw m5, m4
psubw m6, m4
ABSW2 m5, m6, m5, m6, m7, m4
pmaddwd m5, [pw_1]
pmaddwd m6, [pw_1]
paddd m2, m5
paddd m3, m6
%endif
%endmacro
%macro SAD_X4_END 2
%if mmsize == 8 && %1*%2 == 256
HADDUW m0, m4
HADDUW m1, m5
HADDUW m2, m6
HADDUW m3, m7
%else
HADDD m0, m4
HADDD m1, m5
HADDD m2, m6
HADDD m3, m7
%endif
mov r0, r6mp
movd [r0+ 0], xm0
movd [r0+ 4], xm1
movd [r0+ 8], xm2
movd [r0+12], xm3
RET
%endmacro
%macro SAD_X_2xNP 4
%assign x %3
%rep %4
SAD_X%1_ONE x*mmsize, x*mmsize
SAD_X%1_ONE 2*FENC_STRIDE+x*mmsize, 2*%2+x*mmsize
%assign x x+1
%endrep
%endmacro
%macro PIXEL_VSAD 0
cglobal pixel_vsad, 3,3,8
mova m0, [r0]
mova m1, [r0+16]
mova m2, [r0+2*r1]
mova m3, [r0+2*r1+16]
lea r0, [r0+4*r1]
psubw m0, m2
psubw m1, m3
ABSW2 m0, m1, m0, m1, m4, m5
paddw m0, m1
sub r2d, 2
je .end
.loop:
mova m4, [r0]
mova m5, [r0+16]
mova m6, [r0+2*r1]
mova m7, [r0+2*r1+16]
lea r0, [r0+4*r1]
psubw m2, m4
psubw m3, m5
psubw m4, m6
psubw m5, m7
ABSW m2, m2, m1
ABSW m3, m3, m1
ABSW m4, m4, m1
ABSW m5, m5, m1
paddw m0, m2
paddw m0, m3
paddw m0, m4
paddw m0, m5
mova m2, m6
mova m3, m7
sub r2d, 2
jg .loop
.end:
%if BIT_DEPTH == 9
HADDW m0, m1 ; max sum: 62(pixel diffs)*511(pixel_max)=31682
%else
HADDUW m0, m1 ; max sum: 62(pixel diffs)*1023(pixel_max)=63426
%endif
movd eax, m0
RET
%endmacro
INIT_XMM sse2
PIXEL_VSAD
INIT_XMM ssse3
PIXEL_VSAD
INIT_XMM xop
PIXEL_VSAD
INIT_YMM avx2
cglobal pixel_vsad, 3,3
mova m0, [r0]
mova m1, [r0+2*r1]
lea r0, [r0+4*r1]
psubw m0, m1
pabsw m0, m0
sub r2d, 2
je .end
.loop:
mova m2, [r0]
mova m3, [r0+2*r1]
lea r0, [r0+4*r1]
psubw m1, m2
psubw m2, m3
pabsw m1, m1
pabsw m2, m2
paddw m0, m1
paddw m0, m2
mova m1, m3
sub r2d, 2
jg .loop
.end:
%if BIT_DEPTH == 9
HADDW m0, m1
%else
HADDUW m0, m1
%endif
movd eax, xm0
RET
;-----------------------------------------------------------------------------
; void pixel_sad_xN_WxH( uint16_t *fenc, uint16_t *pix0, uint16_t *pix1,
; uint16_t *pix2, intptr_t i_stride, int scores[3] )
;-----------------------------------------------------------------------------
%macro SAD_X 3
cglobal pixel_sad_x%1_%2x%3, 6,7,XMM_REGS
%assign regnum %1+1
%xdefine STRIDE r %+ regnum
mov r6, %3/2-1
SAD_X%1_ONE_START
SAD_X%1_ONE 2*FENC_STRIDE, 2*STRIDE
SAD_X_2xNP %1, STRIDE, 1, %2/(mmsize/2)-1
.loop:
SAD_X%1_INC_P
SAD_X_2xNP %1, STRIDE, 0, %2/(mmsize/2)
dec r6
jg .loop
%if %1 == 4
mov r6, r6m
%endif
SAD_X%1_END %2, %3
%endmacro
INIT_MMX mmx2
%define XMM_REGS 0
SAD_X 3, 16, 16
SAD_X 3, 16, 8
SAD_X 3, 12, 16
SAD_X 3, 8, 16
SAD_X 3, 8, 8
SAD_X 3, 8, 4
SAD_X 3, 4, 16
SAD_X 3, 4, 8
SAD_X 3, 4, 4
SAD_X 4, 16, 16
SAD_X 4, 16, 8
SAD_X 4, 12, 16
SAD_X 4, 8, 16
SAD_X 4, 8, 8
SAD_X 4, 8, 4
SAD_X 4, 4, 16
SAD_X 4, 4, 8
SAD_X 4, 4, 4
INIT_MMX ssse3
SAD_X 3, 4, 8
SAD_X 3, 4, 4
SAD_X 4, 4, 8
SAD_X 4, 4, 4
INIT_XMM ssse3
%define XMM_REGS 7
SAD_X 3, 16, 16
SAD_X 3, 16, 8
SAD_X 3, 8, 16
SAD_X 3, 8, 8
SAD_X 3, 8, 4
%define XMM_REGS 9
SAD_X 4, 16, 16
SAD_X 4, 16, 8
SAD_X 4, 8, 16
SAD_X 4, 8, 8
SAD_X 4, 8, 4
INIT_XMM sse2
%define XMM_REGS 8
SAD_X 3, 64, 64
SAD_X 3, 64, 48
SAD_X 3, 64, 32
SAD_X 3, 64, 16
SAD_X 3, 48, 64
SAD_X 3, 32, 64
SAD_X 3, 32, 32
SAD_X 3, 32, 24
SAD_X 3, 32, 16
SAD_X 3, 32, 8
SAD_X 3, 24, 32
SAD_X 3, 16, 64
SAD_X 3, 16, 32
SAD_X 3, 16, 16
SAD_X 3, 16, 12
SAD_X 3, 16, 8
SAD_X 3, 16, 4
SAD_X 3, 8, 32
SAD_X 3, 8, 16
SAD_X 3, 8, 8
SAD_X 3, 8, 4
%define XMM_REGS 11
SAD_X 4, 64, 64
SAD_X 4, 64, 48
SAD_X 4, 64, 32
SAD_X 4, 64, 16
SAD_X 4, 48, 64
SAD_X 4, 32, 64
SAD_X 4, 32, 32
SAD_X 4, 32, 24
SAD_X 4, 32, 16
SAD_X 4, 32, 8
SAD_X 4, 24, 32
SAD_X 4, 16, 64
SAD_X 4, 16, 32
SAD_X 4, 16, 16
SAD_X 4, 16, 12
SAD_X 4, 16, 8
SAD_X 4, 16, 4
SAD_X 4, 8, 32
SAD_X 4, 8, 16
SAD_X 4, 8, 8
SAD_X 4, 8, 4
INIT_YMM avx2
%define XMM_REGS 7
SAD_X 3, 16, 4
SAD_X 3, 16, 8
SAD_X 3, 16, 12
SAD_X 3, 16, 16
SAD_X 3, 16, 32
SAD_X 3, 16, 64
SAD_X 3, 32, 8
SAD_X 3, 32, 16
SAD_X 3, 32, 24
SAD_X 3, 32, 32
SAD_X 3, 32, 64
SAD_X 3, 48, 64
SAD_X 3, 64, 16
SAD_X 3, 64, 32
SAD_X 3, 64, 48
SAD_X 3, 64, 64
%define XMM_REGS 9
SAD_X 4, 16, 4
SAD_X 4, 16, 8
SAD_X 4, 16, 12
SAD_X 4, 16, 16
SAD_X 4, 16, 32
SAD_X 4, 16, 64
SAD_X 4, 32, 8
SAD_X 4, 32, 16
SAD_X 4, 32, 24
SAD_X 4, 32, 32
SAD_X 4, 32, 64
SAD_X 4, 48, 64
SAD_X 4, 64, 16
SAD_X 4, 64, 32
SAD_X 4, 64, 48
SAD_X 4, 64, 64
;============================
; SAD x3/x4 avx512 code start
;============================
%macro PROCESS_SAD_X4_16x4_AVX512 0
movu ym8, [r0]
vinserti64x4 m8, [r0 + 2 * FENC_STRIDE], 1
movu ym4, [r1]
vinserti64x4 m4, [r1 + r5], 1
movu ym5, [r2]
vinserti64x4 m5, [r2 + r5], 1
movu ym6, [r3]
vinserti64x4 m6, [r3 + r5], 1
movu ym7, [r4]
vinserti64x4 m7, [r4 + r5], 1
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
movu ym8, [r0 + 4 * FENC_STRIDE]
vinserti64x4 m8, [r0 + 6 * FENC_STRIDE], 1
movu ym4, [r1 + 2 * r5]
vinserti64x4 m4, [r1 + r7], 1
movu ym5, [r2 + 2 * r5]
vinserti64x4 m5, [r2 + r7], 1
movu ym6, [r3 + 2 * r5]
vinserti64x4 m6, [r3 + r7], 1
movu ym7, [r4 + 2 * r5]
vinserti64x4 m7, [r4 + r7], 1
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
%endmacro
%macro PROCESS_SAD_X4_32x4_AVX512 0
movu m8, [r0]
movu m4, [r1]
movu m5, [r2]
movu m6, [r3]
movu m7, [r4]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
movu m8, [r0 + 2 * FENC_STRIDE]
movu m4, [r1 + r5]
movu m5, [r2 + r5]
movu m6, [r3 + r5]
movu m7, [r4 + r5]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
movu m8, [r0 + 4 * FENC_STRIDE]
movu m4, [r1 + 2 * r5]
movu m5, [r2 + 2 * r5]
movu m6, [r3 + 2 * r5]
movu m7, [r4 + 2 * r5]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
movu m8, [r0 + 6 * FENC_STRIDE]
movu m4, [r1 + r7]
movu m5, [r2 + r7]
movu m6, [r3 + r7]
movu m7, [r4 + r7]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
%endmacro
%macro PROCESS_SAD_X4_64x4_AVX512 0
movu m8, [r0]
movu m10, [r0 + mmsize]
movu m4, [r1]
movu m11, [r1 + mmsize]
movu m5, [r2]
movu m12, [r2 + mmsize]
movu m6, [r3]
movu m13, [r3 + mmsize]
movu m7, [r4]
movu m14, [r4 + mmsize]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
psubw m11, m10
psubw m12, m10
psubw m13, m10
psubw m14, m10
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
paddw m4, m11
paddw m5, m12
paddw m6, m13
paddw m7, m14
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
movu m8, [r0 + 2 * FENC_STRIDE]
movu m10, [r0 + 2 * FENC_STRIDE + mmsize]
movu m4, [r1 + r5]
movu m11, [r1 + r5 + mmsize]
movu m5, [r2 + r5]
movu m12, [r2 + r5 + mmsize]
movu m6, [r3 + r5]
movu m13, [r3 + r5 + mmsize]
movu m7, [r4 + r5]
movu m14, [r4 + r5 + mmsize]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
psubw m11, m10
psubw m12, m10
psubw m13, m10
psubw m14, m10
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
paddw m4, m11
paddw m5, m12
paddw m6, m13
paddw m7, m14
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
movu m8, [r0 + 4 * FENC_STRIDE]
movu m10, [r0 + 4 * FENC_STRIDE + mmsize]
movu m4, [r1 + 2 * r5]
movu m11, [r1 + 2 * r5 + mmsize]
movu m5, [r2 + 2 * r5]
movu m12, [r2 + 2 * r5 + mmsize]
movu m6, [r3 + 2 * r5]
movu m13, [r3 + 2 * r5 + mmsize]
movu m7, [r4 + 2 * r5]
movu m14, [r4 + 2 * r5 + mmsize]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
psubw m11, m10
psubw m12, m10
psubw m13, m10
psubw m14, m10
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
paddw m4, m11
paddw m5, m12
paddw m6, m13
paddw m7, m14
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
movu m8, [r0 + 6 * FENC_STRIDE]
movu m10, [r0 + 6 * FENC_STRIDE + mmsize]
movu m4, [r1 + r7]
movu m11, [r1 + r7 + mmsize]
movu m5, [r2 + r7]
movu m12, [r2 + r7 + mmsize]
movu m6, [r3 + r7]
movu m13, [r3 + r7 + mmsize]
movu m7, [r4 + r7]
movu m14, [r4 + r7 + mmsize]
psubw m4, m8
psubw m5, m8
psubw m6, m8
psubw m7, m8
psubw m11, m10
psubw m12, m10
psubw m13, m10
psubw m14, m10
pabsw m4, m4
pabsw m5, m5
pabsw m6, m6
pabsw m7, m7
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
paddw m4, m11
paddw m5, m12
paddw m6, m13
paddw m7, m14
pmaddwd m4, m9
paddd m0, m4
pmaddwd m5, m9
paddd m1, m5
pmaddwd m6, m9
paddd m2, m6
pmaddwd m7, m9
paddd m3, m7
%endmacro
%macro PROCESS_SAD_X4_END_AVX512 0
vextracti32x8 ym4, m0, 1
vextracti32x8 ym5, m1, 1
vextracti32x8 ym6, m2, 1
vextracti32x8 ym7, m3, 1
paddd ym0, ym4
paddd ym1, ym5
paddd ym2, ym6
paddd ym3, ym7
vextracti64x2 xm4, m0, 1
vextracti64x2 xm5, m1, 1
vextracti64x2 xm6, m2, 1
vextracti64x2 xm7, m3, 1
paddd xm0, xm4
paddd xm1, xm5
paddd xm2, xm6
paddd xm3, xm7
pshufd xm4, xm0, 00001110b
pshufd xm5, xm1, 00001110b
pshufd xm6, xm2, 00001110b
pshufd xm7, xm3, 00001110b
paddd xm0, xm4
paddd xm1, xm5
paddd xm2, xm6
paddd xm3, xm7
pshufd xm4, xm0, 00000001b
pshufd xm5, xm1, 00000001b
pshufd xm6, xm2, 00000001b
pshufd xm7, xm3, 00000001b
paddd xm0, xm4
paddd xm1, xm5
paddd xm2, xm6
paddd xm3, xm7
mov r0, r6mp
movd [r0 + 0], xm0
movd [r0 + 4], xm1
movd [r0 + 8], xm2
movd [r0 + 12], xm3
%endmacro
%macro PROCESS_SAD_X3_16x4_AVX512 0
movu ym6, [r0]
vinserti64x4 m6, [r0 + 2 * FENC_STRIDE], 1
movu ym3, [r1]
vinserti64x4 m3, [r1 + r4], 1
movu ym4, [r2]
vinserti64x4 m4, [r2 + r4], 1
movu ym5, [r3]
vinserti64x4 m5, [r3 + r4], 1
psubw m3, m6
psubw m4, m6
psubw m5, m6
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
movu ym6, [r0 + 4 * FENC_STRIDE]
vinserti64x4 m6, [r0 + 6 * FENC_STRIDE], 1
movu ym3, [r1 + 2 * r4]
vinserti64x4 m3, [r1 + r6], 1
movu ym4, [r2 + 2 * r4]
vinserti64x4 m4, [r2 + r6], 1
movu ym5, [r3 + 2 * r4]
vinserti64x4 m5, [r3 + r6], 1
psubw m3, m6
psubw m4, m6
psubw m5, m6
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
%endmacro
%macro PROCESS_SAD_X3_32x4_AVX512 0
movu m6, [r0]
movu m3, [r1]
movu m4, [r2]
movu m5, [r3]
psubw m3, m6
psubw m4, m6
psubw m5, m6
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
movu m6, [r0 + 2 * FENC_STRIDE]
movu m3, [r1 + r4]
movu m4, [r2 + r4]
movu m5, [r3 + r4]
psubw m3, m6
psubw m4, m6
psubw m5, m6
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
movu m6, [r0 + 4 * FENC_STRIDE]
movu m3, [r1 + 2 * r4]
movu m4, [r2 + 2 * r4]
movu m5, [r3 + 2 * r4]
psubw m3, m6
psubw m4, m6
psubw m5, m6
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
movu m6, [r0 + 6 * FENC_STRIDE]
movu m3, [r1 + r6]
movu m4, [r2 + r6]
movu m5, [r3 + r6]
psubw m3, m6
psubw m4, m6
psubw m5, m6
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
%endmacro
%macro PROCESS_SAD_X3_64x4_AVX512 0
movu m6, [r0]
movu m8, [r0 + mmsize]
movu m3, [r1]
movu m9, [r1 + mmsize]
movu m4, [r2]
movu m10, [r2 + mmsize]
movu m5, [r3]
movu m11, [r3 + mmsize]
psubw m3, m6
psubw m9, m8
psubw m4, m6
psubw m10, m8
psubw m5, m6
psubw m11, m8
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
paddw m3, m9
paddw m4, m10
paddw m5, m11
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
movu m6, [r0 + 2 * FENC_STRIDE]
movu m8, [r0 + 2 * FENC_STRIDE + mmsize]
movu m3, [r1 + r4]
movu m9, [r1 + r4 + mmsize]
movu m4, [r2 + r4]
movu m10, [r2 + r4 + mmsize]
movu m5, [r3 + r4]
movu m11, [r3 + r4 + mmsize]
psubw m3, m6
psubw m9, m8
psubw m4, m6
psubw m10, m8
psubw m5, m6
psubw m11, m8
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
paddw m3, m9
paddw m4, m10
paddw m5, m11
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
movu m6, [r0 + 4 * FENC_STRIDE]
movu m8, [r0 + 4 * FENC_STRIDE + mmsize]
movu m3, [r1 + 2 * r4]
movu m9, [r1 + 2 * r4 + mmsize]
movu m4, [r2 + 2 * r4]
movu m10, [r2 + 2 * r4 + mmsize]
movu m5, [r3 + 2 * r4]
movu m11, [r3 + 2 * r4 + mmsize]
psubw m3, m6
psubw m9, m8
psubw m4, m6
psubw m10, m8
psubw m5, m6
psubw m11, m8
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
paddw m3, m9
paddw m4, m10
paddw m5, m11
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
movu m6, [r0 + 6 * FENC_STRIDE]
movu m8, [r0 + 6 * FENC_STRIDE + mmsize]
movu m3, [r1 + r6]
movu m9, [r1 + r6 + mmsize]
movu m4, [r2 + r6]
movu m10, [r2 + r6 + mmsize]
movu m5, [r3 + r6]
movu m11, [r3 + r6 + mmsize]
psubw m3, m6
psubw m9, m8
psubw m4, m6
psubw m10, m8
psubw m5, m6
psubw m11, m8
pabsw m3, m3
pabsw m4, m4
pabsw m5, m5
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
paddw m3, m9
paddw m4, m10
paddw m5, m11
pmaddwd m3, m7
paddd m0, m3
pmaddwd m4, m7
paddd m1, m4
pmaddwd m5, m7
paddd m2, m5
%endmacro
%macro PROCESS_SAD_X3_END_AVX512 0
vextracti32x8 ym3, m0, 1
vextracti32x8 ym4, m1, 1
vextracti32x8 ym5, m2, 1
paddd ym0, ym3
paddd ym1, ym4
paddd ym2, ym5
vextracti64x2 xm3, m0, 1
vextracti64x2 xm4, m1, 1
vextracti64x2 xm5, m2, 1
paddd xm0, xm3
paddd xm1, xm4
paddd xm2, xm5
pshufd xm3, xm0, 00001110b
pshufd xm4, xm1, 00001110b
pshufd xm5, xm2, 00001110b
paddd xm0, xm3
paddd xm1, xm4
paddd xm2, xm5
pshufd xm3, xm0, 00000001b
pshufd xm4, xm1, 00000001b
pshufd xm5, xm2, 00000001b
paddd xm0, xm3
paddd xm1, xm4
paddd xm2, xm5
%if UNIX64
movd [r5 + 0], xm0
movd [r5 + 4], xm1
movd [r5 + 8], xm2
%else
mov r0, r5mp
movd [r0 + 0], xm0
movd [r0 + 4], xm1
movd [r0 + 8], xm2
%endif
%endmacro
;------------------------------------------------------------------------------------------------------------------------------------------
; void pixel_sad_x3_16x%1( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, intptr_t frefstride, int32_t* res )
;------------------------------------------------------------------------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_x3_16x8, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_16x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_16x12, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
%rep 2
PROCESS_SAD_X3_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
%endrep
PROCESS_SAD_X3_16x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_16x16, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
%rep 3
PROCESS_SAD_X3_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
%endrep
PROCESS_SAD_X3_16x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_16x32, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
%rep 7
PROCESS_SAD_X3_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
%endrep
PROCESS_SAD_X3_16x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_16x64, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
%rep 15
PROCESS_SAD_X3_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
%endrep
PROCESS_SAD_X3_16x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
%endif
;------------------------------------------------------------------------------------------------------------------------------------------
; void pixel_sad_x3_32x%1( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, intptr_t frefstride, int32_t* res )
;------------------------------------------------------------------------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_x3_32x8, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_32x16, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_32x24, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_32x32, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_32x64, 6,7,8
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_32x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
;----------------------------------------------------------------------------------------------------------------------------------------
; int pixel_sad_x3_48x64( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, intptr_t frefstride, int32_t* res )
;----------------------------------------------------------------------------------------------------------------------------------------
INIT_ZMM avx512
cglobal pixel_sad_x3_48x64, 4, 8, 17
pxor m0, m0
pxor m1, m1
pxor m2, m2
mov r7d, 64/4
vbroadcasti32x8 m16, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
.loop:
movu m4, [r0]
movu m5, [r0 + 2 * FENC_STRIDE]
movu ym6, [r0 + mmsize]
vinserti32x8 m6, [r0 + 2 * FENC_STRIDE + mmsize], 1
movu m7, [r1]
movu m8, [r1 + r4]
movu ym9, [r1 + mmsize]
vinserti32x8 m9, [r1 + r4 + mmsize], 1
movu m10, [r2]
movu m11, [r2 + r4]
movu ym12, [r2 + mmsize]
vinserti32x8 m12, [r2 + r4 + mmsize], 1
movu m13, [r3]
movu m14, [r3 + r4]
movu ym15, [r3 + mmsize]
vinserti32x8 m15, [r3 + r4 + mmsize], 1
psubw m7, m4
psubw m8, m5
psubw m9, m6
psubw m10, m4
psubw m11, m5
psubw m12, m6
psubw m13, m4
psubw m14, m5
psubw m15, m6
pabsw m7, m7
pabsw m8, m8
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
pabsw m15, m15
paddw m7, m8
paddw m7, m9
paddw m10, m11
paddw m10, m12
paddw m13, m14
paddw m13, m15
pmaddwd m7, m16
paddd m0, m7
pmaddwd m10, m16
paddd m1, m10
pmaddwd m13, m16
paddd m2, m13
movu m4, [r0 + 4 * FENC_STRIDE]
movu m5, [r0 + 6 * FENC_STRIDE]
movu ym6, [r0 + 4 * FENC_STRIDE + mmsize]
vinserti32x8 m6, [r0 + 6 * FENC_STRIDE + mmsize], 1
movu m7, [r1 + 2 * r4]
movu m8, [r1 + r6]
movu ym9, [r1 + 2 * r4 + mmsize]
vinserti32x8 m9, [r1 + r6 + mmsize], 1
movu m10, [r2 + 2 * r4]
movu m11, [r2 + r6]
movu ym12, [r2 + 2 * r4 + mmsize]
vinserti32x8 m12, [r2 + r6 + mmsize], 1
movu m13, [r3 + 2 * r4]
movu m14, [r3 + r6]
movu ym15, [r3 + 2 * r4 + mmsize]
vinserti32x8 m15, [r3 + r6 + mmsize], 1
psubw m7, m4
psubw m8, m5
psubw m9, m6
psubw m10, m4
psubw m11, m5
psubw m12, m6
psubw m13, m4
psubw m14, m5
psubw m15, m6
pabsw m7, m7
pabsw m8, m8
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
pabsw m15, m15
paddw m7, m8
paddw m7, m9
paddw m10, m11
paddw m10, m12
paddw m13, m14
paddw m13, m15
pmaddwd m7, m16
paddd m0, m7
pmaddwd m10, m16
paddd m1, m10
pmaddwd m13, m16
paddd m2, m13
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
dec r7d
jg .loop
PROCESS_SAD_X3_END_AVX512
RET
%endif
;------------------------------------------------------------------------------------------------------------------------------------------
; void pixel_sad_x3_64x%1( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, intptr_t frefstride, int32_t* res )
;------------------------------------------------------------------------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_x3_64x16, 6,7,12
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_64x32, 6,7,12
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_64x48, 6,7,12
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x3_64x64, 6,7,12
pxor m0, m0
pxor m1, m1
pxor m2, m2
vbroadcasti32x8 m7, [pw_1]
add r4d, r4d
lea r6d, [r4 * 3]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r4 * 4]
lea r2, [r2 + r4 * 4]
lea r3, [r3 + r4 * 4]
PROCESS_SAD_X3_64x4_AVX512
PROCESS_SAD_X3_END_AVX512
RET
%endif
;------------------------------------------------------------------------------------------------------------------------------------------------------------
; void pixel_sad_x4_16x%1( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, const pixel* pix5, intptr_t frefstride, int32_t* res )
;------------------------------------------------------------------------------------------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_x4_16x8, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_16x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_16x12, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
%rep 2
PROCESS_SAD_X4_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
%endrep
PROCESS_SAD_X4_16x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_16x16, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
%rep 3
PROCESS_SAD_X4_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
%endrep
PROCESS_SAD_X4_16x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_16x32, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
%rep 7
PROCESS_SAD_X4_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
%endrep
PROCESS_SAD_X4_16x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_16x64, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
%rep 15
PROCESS_SAD_X4_16x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
%endrep
PROCESS_SAD_X4_16x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
%endif
;------------------------------------------------------------------------------------------------------------------------------------------------------------
; void pixel_sad_x4_32x%1( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, const pixel* pix5, intptr_t frefstride, int32_t* res )
;------------------------------------------------------------------------------------------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_x4_32x8, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_32x16, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_32x24, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_32x32, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_32x64, 6,8,10
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_32x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
%endif
;------------------------------------------------------------------------------------------------------------------------------------------------------------
; void pixel_sad_x4_48x64( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, const pixel* pix5, intptr_t frefstride, int32_t* res )
;------------------------------------------------------------------------------------------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_x4_48x64, 4, 9, 20
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
mov r8d, 64/4
vbroadcasti32x8 m19, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
.loop:
movu m4, [r0]
movu m5, [r0 + 2 * FENC_STRIDE]
movu ym6, [r0 + mmsize]
vinserti32x8 m6, [r0 + 2 * FENC_STRIDE + mmsize], 1
movu m7, [r1]
movu m8, [r1 + r5]
movu ym9, [r1 + mmsize]
vinserti32x8 m9, [r1 + r5 + mmsize], 1
movu m10, [r2]
movu m11, [r2 + r5]
movu ym12, [r2 + mmsize]
vinserti32x8 m12, [r2 + r5 + mmsize], 1
movu m13, [r3]
movu m14, [r3 + r5]
movu ym15, [r3 + mmsize]
vinserti32x8 m15, [r3 + r5 + mmsize], 1
movu m16, [r4]
movu m17, [r4 + r5]
movu ym18, [r4 + mmsize]
vinserti32x8 m18, [r4 + r5 + mmsize], 1
psubw m7, m4
psubw m8, m5
psubw m9, m6
psubw m10, m4
psubw m11, m5
psubw m12, m6
psubw m13, m4
psubw m14, m5
psubw m15, m6
psubw m16, m4
psubw m17, m5
psubw m18, m6
pabsw m7, m7
pabsw m8, m8
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
pabsw m15, m15
pabsw m16, m16
pabsw m17, m17
pabsw m18, m18
paddw m7, m8
paddw m7, m9
paddw m10, m11
paddw m10, m12
paddw m13, m14
paddw m13, m15
paddw m16, m17
paddw m16, m18
pmaddwd m7, m19
paddd m0, m7
pmaddwd m10, m19
paddd m1, m10
pmaddwd m13, m19
paddd m2, m13
pmaddwd m16, m19
paddd m3, m16
movu m4, [r0 + 4 * FENC_STRIDE]
movu m5, [r0 + 6 * FENC_STRIDE]
movu ym6, [r0 + 4 * FENC_STRIDE + mmsize]
vinserti32x8 m6, [r0 + 6 * FENC_STRIDE + mmsize], 1
movu m7, [r1 + 2 * r5]
movu m8, [r1 + r7]
movu ym9, [r1 + 2 * r5 + mmsize]
vinserti32x8 m9, [r1 + r7 + mmsize], 1
movu m10, [r2 + 2 * r5]
movu m11, [r2 + r7]
movu ym12, [r2 + 2 * r5 + mmsize]
vinserti32x8 m12, [r2 + r7 + mmsize], 1
movu m13, [r3 + 2 * r5]
movu m14, [r3 + r7]
movu ym15, [r3 + 2 * r5 + mmsize]
vinserti32x8 m15, [r3 + r7 + mmsize], 1
movu m16, [r4 + 2 * r5]
movu m17, [r4 + r7]
movu ym18, [r4 + 2 * r5 + mmsize]
vinserti32x8 m18, [r4 + r7 + mmsize], 1
psubw m7, m4
psubw m8, m5
psubw m9, m6
psubw m10, m4
psubw m11, m5
psubw m12, m6
psubw m13, m4
psubw m14, m5
psubw m15, m6
psubw m16, m4
psubw m17, m5
psubw m18, m6
pabsw m7, m7
pabsw m8, m8
pabsw m9, m9
pabsw m10, m10
pabsw m11, m11
pabsw m12, m12
pabsw m13, m13
pabsw m14, m14
pabsw m15, m15
pabsw m16, m16
pabsw m17, m17
pabsw m18, m18
paddw m7, m8
paddw m7, m9
paddw m10, m11
paddw m10, m12
paddw m13, m14
paddw m13, m15
paddw m16, m17
paddw m16, m18
pmaddwd m7, m19
paddd m0, m7
pmaddwd m10, m19
paddd m1, m10
pmaddwd m13, m19
paddd m2, m13
pmaddwd m16, m19
paddd m3, m16
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
dec r8d
jg .loop
PROCESS_SAD_X4_END_AVX512
RET
%endif
;------------------------------------------------------------------------------------------------------------------------------------------------------------
; void pixel_sad_x4_64x%1( const pixel* pix1, const pixel* pix2, const pixel* pix3, const pixel* pix4, const pixel* pix5, intptr_t frefstride, int32_t* res )
;------------------------------------------------------------------------------------------------------------------------------------------------------------
%if ARCH_X86_64
INIT_ZMM avx512
cglobal pixel_sad_x4_64x16, 6,8,15
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_64x32, 6,8,15
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_64x48, 6,8,15
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
INIT_ZMM avx512
cglobal pixel_sad_x4_64x64, 6,8,15
pxor m0, m0
pxor m1, m1
pxor m2, m2
pxor m3, m3
vbroadcasti32x8 m9, [pw_1]
add r5d, r5d
lea r7d, [r5 * 3]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
add r0, FENC_STRIDE * 8
lea r1, [r1 + r5 * 4]
lea r2, [r2 + r5 * 4]
lea r3, [r3 + r5 * 4]
lea r4, [r4 + r5 * 4]
PROCESS_SAD_X4_64x4_AVX512
PROCESS_SAD_X4_END_AVX512
RET
%endif
|
oeis/210/A210000.asm | neoneye/loda-programs | 11 | 16202 | ; A210000: Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n}.
; Submitted by <NAME>
; 0,6,14,30,46,78,94,142,174,222,254,334,366,462,510,574,638,766,814,958,1022,1118,1198,1374,1438,1598,1694,1838,1934,2158,2222,2462,2590,2750,2878,3070,3166,3454,3598,3790,3918,4238,4334,4670,4830
mov $2,2
lpb $0
sub $0,1
mov $2,$0
mov $0,0
max $2,0
seq $2,137243 ; Number of coprime pairs (a,b) with -n <= a,b <= n.
lpe
mov $0,$2
sub $0,2
|
tools/gen_colls.adb | svn2github/matreshka | 24 | 1222 | <reponame>svn2github/matreshka
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009-2015, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Text_IO;
with Matreshka.Internals.Unicode.Ucd;
with Put_File_Header;
with Uca_Data;
with Utils;
procedure Gen_Colls is
use Matreshka.Internals.Unicode;
use Matreshka.Internals.Unicode.Ucd;
use Uca_Data;
use Utils;
Expansion :
Matreshka.Internals.Unicode.Ucd.Collation_Element_Sequence
(Sequence_Index);
Expansion_Last : Sequence_Count := 0;
Last_Variable : Collation_Weight := 0;
Contraction : Contractor_Array (Sequence_Index)
:= (others => (Code => 0, others => 0));
Contraction_Last : Sequence_Count := 0;
Collation :
array (Code_Point) of Matreshka.Internals.Unicode.Ucd.Collation_Record
:= (others => (0, 0, 0, 0));
procedure Add
(Item : Uca_Data.Collation_Element_Sequence;
First : out Sequence_Count;
Last : out Sequence_Count);
function Collation_Weight_Ada_Image
(Item : Matreshka.Internals.Unicode.Ucd.Collation_Weight)
return String;
-- Returns image of Collation_Weigth in the form useful in Ada code.
---------
-- Add --
---------
procedure Add
(Item : Uca_Data.Collation_Element_Sequence;
First : out Sequence_Count;
Last : out Sequence_Count)
is
function "="
(Left : Matreshka.Internals.Unicode.Ucd.Collation_Element_Sequence;
Right : Uca_Data.Collation_Element_Sequence)
return Boolean;
---------
-- "=" --
---------
function "="
(Left : Matreshka.Internals.Unicode.Ucd.Collation_Element_Sequence;
Right : Uca_Data.Collation_Element_Sequence)
return Boolean
is
L_Index : Sequence_Index := Left'First;
R_Index : Sequence_Index := Right'First;
begin
if Left'Length /= Right'Length then
return False;
end if;
while L_Index <= Left'Last and then R_Index <= Right'Last loop
if Left (L_Index).Primary /= Right (R_Index).Primary
or else Left (L_Index).Secondary /= Right (R_Index).Secondary
or else Left (L_Index).Trinary /= Right (R_Index).Trinary
then
return False;
end if;
L_Index := L_Index + 1;
R_Index := R_Index + 1;
end loop;
return True;
end "=";
begin
if Item'Length = 0 then
First := 1;
Last := 0;
end if;
for J in 1 .. Expansion_Last - Item'Length + 1 loop
if Expansion (J .. J + Item'Length - 1) = Item then
First := J;
Last := J + Item'Length - 1;
return;
end if;
end loop;
First := Expansion_Last + 1;
for J in Item'Range loop
Expansion_Last := Expansion_Last + 1;
Expansion (Expansion_Last).Primary := Item (J).Primary;
Expansion (Expansion_Last).Secondary := Item (J).Secondary;
Expansion (Expansion_Last).Trinary := Item (J).Trinary;
if Item (J).Kind = Variable then
Last_Variable :=
Collation_Weight'Max (Last_Variable, Item (J).Primary);
end if;
end loop;
Last := Expansion_Last;
end Add;
--------------------------------
-- Collation_Weight_Ada_Image --
--------------------------------
function Collation_Weight_Ada_Image
(Item : Matreshka.Internals.Unicode.Ucd.Collation_Weight)
return String
is
To_Hex_Digit : constant
array (Collation_Weight range 0 .. 15) of Character
:= "0123456789ABCDEF";
Result : String (1 .. 8) := "16#XXXX#";
begin
Result (7) := To_Hex_Digit (Item mod 16);
Result (6) := To_Hex_Digit ((Item / 16) mod 16);
Result (5) := To_Hex_Digit ((Item / 256) mod 16);
Result (4) := To_Hex_Digit ((Item / 4096) mod 16);
return Result;
end Collation_Weight_Ada_Image;
---------
-- Put --
---------
procedure Put
(Item : Matreshka.Internals.Unicode.Ucd.Collation_Record) is
begin
Ada.Text_IO.Put
("("
& Sequence_Count_Image (Item.Contractor_First)
& ", "
& Sequence_Count_Image (Item.Contractor_Last)
& ", "
& Sequence_Count_Image (Item.Expansion_First)
& ", "
& Sequence_Count_Image (Item.Expansion_Last)
& ")");
end Put;
type String_Access is access constant String;
Regular_Image : aliased constant String := "Regular";
Variable_Image : aliased constant String := "Variable";
Collation_Element_Kinds_Image : constant
array (Collation_Element_Kinds) of String_Access
:= (Regular => Regular_Image'Access,
Variable => Variable_Image'Access);
Found : Boolean;
Index : Sequence_Count;
type Group_Info is record
Share : First_Stage_Index;
Count : Natural;
end record;
Groups : array (First_Stage_Index) of Group_Info
:= (others => (0, 0));
Generated : array (First_Stage_Index) of Boolean := (others => False);
begin
Ada.Text_IO.Put_Line (Ada.Text_IO.Standard_Error, " ... colls");
-- Compute expansion and contraction data.
for J in Code_Point loop
if Colls (J).Expansion /= null then
Add
(Colls (J).Expansion.all,
Collation (J).Expansion_First,
Collation (J).Expansion_Last);
end if;
if Colls (J).Contraction /= null then
for K in Colls (J).Contraction'Range loop
if Collation (J).Contractor_First = 0 then
Contraction_Last := Contraction_Last + 1;
Contraction (Contraction_Last).Code :=
Colls (J).Contraction (K).Codes (2);
if Colls (J).Contraction (K).Codes'Length = 1
and then Colls (J).Contraction (K).Expansion /= null
then
Add
(Colls (J).Contraction (K).Expansion.all,
Contraction (Contraction_Last).Expansion_First,
Contraction (Contraction_Last).Expansion_Last);
end if;
Collation (J).Contractor_First := Contraction_Last;
Collation (J).Contractor_Last := Contraction_Last;
else
Found := False;
for L in Collation (J).Contractor_First
.. Collation (J).Contractor_Last
loop
if Contraction (L).Code
= Colls (J).Contraction (K).Codes (2)
then
Found := True;
exit;
end if;
end loop;
if not Found then
Contraction_Last := Contraction_Last + 1;
Contraction (Contraction_Last).Code :=
Colls (J).Contraction (K).Codes (2);
if Colls (J).Contraction (K).Codes'Length = 1
and then Colls (J).Contraction (K).Expansion /= null
then
Add
(Colls (J).Contraction (K).Expansion.all,
Contraction (Contraction_Last).Expansion_First,
Contraction (Contraction_Last).Expansion_Last);
end if;
Collation (J).Contractor_Last := Contraction_Last;
end if;
end if;
end loop;
for K in Colls (J).Contraction'Range loop
if Colls (J).Contraction (K).Codes'Length = 2 then
Index := 0;
for L in Collation (J).Contractor_First
.. Collation (J).Contractor_Last
loop
if Contraction (L).Code
= Colls (J).Contraction (K).Codes (2)
then
Index := L;
exit;
end if;
end loop;
Contraction_Last := Contraction_Last + 1;
Contraction (Contraction_Last).Code :=
Colls (J).Contraction (K).Codes (3);
Add
(Colls (J).Contraction (K).Expansion.all,
Contraction (Contraction_Last).Expansion_First,
Contraction (Contraction_Last).Expansion_Last);
if Contraction (Index).Contractor_First = 0 then
Contraction (Index).Contractor_First := Contraction_Last;
end if;
Contraction (Index).Contractor_Last := Contraction_Last;
end if;
end loop;
end if;
end loop;
-- Pack groups: reuse groups with the same values.
for J in Groups'Range loop
for K in 0 .. J loop
if Collation
(Code_Unit_32 (K) * 256 .. Code_Unit_32 (K) * 256 + 255)
= Collation
(Code_Unit_32 (J) * 256 .. Code_Unit_32 (J) * 256 + 255)
then
Groups (J).Share := K;
Groups (K).Count := Groups (K).Count + 1;
exit;
end if;
end loop;
end loop;
-- Generate source code.
Put_File_Header
("Localization, Internationalization, Globalization for Ada",
2009,
2015);
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("pragma Restrictions (No_Elaboration_Code);");
Ada.Text_IO.Put_Line
("-- GNAT: enforce generation of preinitialized data section instead of");
Ada.Text_IO.Put_Line ("-- generation of elaboration code.");
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("package Matreshka.Internals.Unicode.Ucd.Colls is");
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line (" pragma Preelaborate;");
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line
(" Last_Variable : constant Collation_Weight := "
& Collation_Weight_Ada_Image (Last_Variable)
& ';');
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line
(" Expansion_Data : aliased constant Collation_Element_Sequence");
for J in 1 .. Expansion_Last loop
if J = 1 then
Ada.Text_IO.Put (" := (");
else
Ada.Text_IO.Put_Line (",");
Ada.Text_IO.Put (" ");
end if;
Ada.Text_IO.Put
(Sequence_Count_Image (J)
& " => ("
& Collation_Weight_Ada_Image (Expansion (J).Primary)
& ", "
& Collation_Weight_Ada_Image (Expansion (J).Secondary)
& ", "
& Collation_Weight_Ada_Image (Expansion (J).Trinary)
& ')');
end loop;
Ada.Text_IO.Put_Line (");");
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line
(" Contraction_Data : aliased constant Contractor_Array");
for J in 1 .. Contraction_Last loop
if J = 1 then
Ada.Text_IO.Put (" := (");
else
Ada.Text_IO.Put_Line (",");
Ada.Text_IO.Put (" ");
end if;
Ada.Text_IO.Put
(Sequence_Count_Image (J)
& " => ("
& Code_Point_Ada_Image (Contraction (J).Code)
& ", "
& Sequence_Count_Image (Contraction (J).Contractor_First)
& ", "
& Sequence_Count_Image (Contraction (J).Contractor_Last)
& ", "
& Sequence_Count_Image (Contraction (J).Expansion_First)
& ", "
& Sequence_Count_Image (Contraction (J).Expansion_Last)
& ')');
end loop;
Ada.Text_IO.Put_Line (");");
for J in Groups'Range loop
if not Generated (Groups (J).Share) then
declare
Default : Matreshka.Internals.Unicode.Ucd.Collation_Record;
Current : Matreshka.Internals.Unicode.Ucd.Collation_Record;
First : Second_Stage_Index;
Last : Second_Stage_Index;
First_Code : Code_Point;
Last_Code : Code_Point;
begin
-- Looking for most useful set of values, it will be used for
-- others selector for generate more compact code.
declare
type Value_Count_Pair is record
V : Matreshka.Internals.Unicode.Ucd.Collation_Record;
C : Natural;
end record;
Counts : array (Positive range 1 .. 256) of Value_Count_Pair
:= (others => <>);
Last : Natural := 0;
Maximum : Natural := 0;
begin
for K in Second_Stage_Index loop
declare
C : constant Code_Point
:= Code_Unit_32 (J) * 256 + Code_Unit_32 (K);
R : Matreshka.Internals.Unicode.Ucd.Collation_Record
renames Collation (C);
F : Boolean := False;
begin
-- Go throught known values and try to find the same
-- value.
for L in 1 .. Last loop
if Counts (L).V = R then
F := True;
Counts (L).C := Counts (L).C + 1;
if Maximum < Counts (L).C then
Maximum := Counts (L).C;
Default := Counts (L).V;
end if;
exit;
end if;
end loop;
-- If value is not found, then add it to the end of list.
if not F then
Last := Last + 1;
Counts (Last) := (R, 1);
end if;
end;
end loop;
end;
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line
(" Group_"
& First_Stage_Image (Groups (J).Share)
& " : aliased constant Collation_Second_Stage");
Ada.Text_IO.Put (" := (");
for K in Second_Stage_Index loop
declare
Code : constant Code_Point
:= Code_Unit_32 (J) * 256 + Code_Unit_32 (K);
begin
if K = Second_Stage_Index'First then
Current := Collation (Code);
First := K;
Last := First;
First_Code := Code;
Last_Code := Code;
elsif Collation (Code) = Current then
Last := K;
Last_Code := Code;
else
if Current /= Default then
if First /= Last then
Ada.Text_IO.Put_Line
("16#"
& Second_Stage_Image (First)
& "# .. 16#"
& Second_Stage_Image (Last)
& "# => -- "
& Code_Point_Image (First_Code)
& " .. "
& Code_Point_Image (Last_Code));
Ada.Text_IO.Set_Col (11);
Put (Current);
Ada.Text_IO.Put (',');
else
Ada.Text_IO.Put_Line
("16#"
& Second_Stage_Image (First)
& "# => -- "
& Code_Point_Image (First_Code));
Ada.Text_IO.Set_Col (11);
Put (Current);
Ada.Text_IO.Put (',');
end if;
Ada.Text_IO.New_Line;
Ada.Text_IO.Set_Col (10);
end if;
Current := Collation (Code);
First := K;
Last := First;
First_Code := Code;
Last_Code := First_Code;
end if;
end;
end loop;
if Current /= Default then
if First /= Last then
Ada.Text_IO.Put_Line
("16#"
& Second_Stage_Image (First)
& "# .. 16#"
& Second_Stage_Image (Last)
& "# => -- "
& Code_Point_Image (First_Code)
& " .. "
& Code_Point_Image (Last_Code));
Ada.Text_IO.Set_Col (11);
Put (Current);
Ada.Text_IO.Put (',');
else
Ada.Text_IO.Put_Line
("16#"
& Second_Stage_Image (First)
& "# => -- "
& Code_Point_Image (First_Code));
Ada.Text_IO.Set_Col (11);
Put (Current);
Ada.Text_IO.Put (',');
end if;
Ada.Text_IO.New_Line;
Ada.Text_IO.Set_Col (10);
end if;
Ada.Text_IO.Put_Line ("others =>");
Ada.Text_IO.Set_Col (11);
Put (Default);
Ada.Text_IO.Put_Line (");");
Generated (J) := True;
end;
end if;
end loop;
declare
Default : First_Stage_Index := 0;
Maximum : Natural := 0;
N : Natural := 0;
begin
for J in Groups'Range loop
if Maximum < Groups (J).Count then
Maximum := Groups (J).Count;
Default := J;
end if;
end loop;
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line
(" Collation : aliased constant Collation_First_Stage");
Ada.Text_IO.Put (" := (");
for J in Groups'Range loop
if Groups (J).Share /= Default then
Ada.Text_IO.Put
("16#"
& First_Stage_Image (J)
& "# => Group_"
& First_Stage_Image (Groups (J).Share)
& "'Access,");
case N mod 2 is
when 0 =>
Ada.Text_IO.Set_Col (41);
when 1 =>
Ada.Text_IO.New_Line;
Ada.Text_IO.Set_Col (10);
when others =>
raise Program_Error;
end case;
N := N + 1;
end if;
end loop;
Ada.Text_IO.Put_Line
("others => Group_" & First_Stage_Image (Default) & "'Access);");
end;
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("end Matreshka.Internals.Unicode.Ucd.Colls;");
end Gen_Colls;
|
P4/bltzal_test.asm | OliverDu8-24/BUAA-CO-2021 | 1 | 245313 | ori $2, $0, 1
addu $1, $0, $2
bltzal $1, fuck
ori $3, $0, 11
fuck:
ori $2, $0, 12 |
programs/oeis/105/A105734.asm | karttu/loda | 1 | 99791 | <reponame>karttu/loda<filename>programs/oeis/105/A105734.asm
; A105734: For n>2, a(n) > 0 is such that a(n-1)^2+4*a(n-2)*a(n) is a minimal square, with a(1)=1, a(2)=1.
; 1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1,2,3,2,1,1
bin $0,2
pow $0,3
mod $0,5
mov $1,$0
add $1,1
|
kernel/arch/i386/irq_a.asm | Heasummn/DevOS | 8 | 6934 | <reponame>Heasummn/DevOS<filename>kernel/arch/i386/irq_a.asm<gh_stars>1-10
global irq0
global irq1
global irq2
global irq3
global irq4
global irq5
global irq6
global irq7
global irq8
global irq9
global irq10
global irq11
global irq12
global irq13
global irq14
global irq15
%macro IRQ 1
irq%1:
cli
push byte 0
push byte %1 + 32
jmp irq_common_stub
%endmacro
IRQ 0
IRQ 1
IRQ 2
IRQ 3
IRQ 4
IRQ 5
IRQ 6
IRQ 7
IRQ 8
IRQ 9
IRQ 10
IRQ 11
IRQ 12
IRQ 13
IRQ 14
IRQ 15
extern irq_handler
irq_common_stub:
pusha
push ds
push es
push fs
push gs
mov ax, 0x10
mov ds, ax
mov es, ax
mov fs, ax
mov gs, ax
mov eax, esp
push eax
mov eax, irq_handler
call eax
pop eax
pop gs
pop fs
pop es
pop ds
popa
add esp, 8
iret
|
src/main/antlr/BasicLexer.g4 | williamprofit/WACC | 3 | 5948 | lexer grammar BasicLexer;
//operators
PLUS: '+' ;
MINUS: '-' ;
//brackets
OPEN_PARENTHESES: '(' ;
CLOSE_PARENTHESES: ')' ;
//numbers
fragment DIGIT: '0'..'9' ;
INTEGER: DIGIT+ ;
|
callback-um/CvcCl/Dispatcher.asm | Toloi/km-um-communication | 47 | 179086 | <gh_stars>10-100
EXTERN NtCallbackReturn : proc
EXTERN CvcpDispatcher : proc
EXTERN D3DKMTOpenAdapterFromHdc : proc
Cvc struct
Msg dd ?
DataLen dd ?
Data dq ?
pConnection dq ?
Cvc ends
_TEXT SEGMENT
PUBLIC KeUserCallbackDispatcher
KeUserCallbackDispatcher PROC
;int 3
mov ecx, Cvc.Msg[rsp] ;
mov rdx, Cvc.Data[rsp] ;
mov r8d, Cvc.DataLen[rsp] ;
mov r9, Cvc.pConnection[rsp] ;
call CvcpDispatcher
xor rcx, rcx ; Result
xor rdx, rdx ; ResultLength
mov r8d, eax ; Status
call NtCallbackReturn
ret
KeUserCallbackDispatcher ENDP
PUBLIC CvcpProcessConnect
CvcpProcessConnect PROC
sub rsp, 60h ; allocate shadow space
push rbp ; save previous stack base pointer
;
; set stack base pointer. Will be used in kernelmode routine
; to get user argument. rbp will be saved on stack in KiSystemCall64.
;
mov rbp, rsp
mov [rbp+8h], rdx ; save second argument
call D3DKMTOpenAdapterFromHdc
pop rbp ; restore previous stack base pointer
add rsp, 60h ; deallocate
ret
CvcpProcessConnect ENDP
end
|
programs/oeis/179/A179058.asm | karttu/loda | 0 | 9155 | ; A179058: Number of non-attacking placements of 3 rooks on an n X n board.
; 0,0,6,96,600,2400,7350,18816,42336,86400,163350,290400,490776,794976,1242150,1881600,2774400,3995136,5633766,7797600,10613400,14229600,18818646,24579456,31740000,40560000,51333750,64393056,80110296,98901600,121230150,147609600,178607616,214849536,257022150,305877600,362237400,426996576,501127926,585686400,681813600,790742400,913801686,1052421216,1208136600,1382594400,1577557350,1794909696,2036662656,2304960000,2602083750,2930460000,3292664856,3691430496,4129651350,4610390400,5136885600,5712556416,6341010486,7026050400,7771680600,8582114400,9461781126,10415333376,11447654400,12563865600,13769334150,15069680736,16470787416,17978805600,19600164150,21341577600,23210054496,25212905856,27357753750,29652540000,32105535000,34725346656,37520929446,40501593600,43677014400,47057241600,50652708966,54474243936,58533077400,62840853600,67409640150,72251938176,77380692576,82809302400,88551631350,94622018400,101035288536,107806763616,114952273350,122488166400,130431321600,138799159296,147609652806,156881340000,166633335000,176885340000,187657657206,198971200896,210847509600,223308758400,236377771350,250078034016,264433706136,279469634400,295211365350,311685158400,328917998976,346937611776,365772474150,385451829600,406005701400,427464906336,449861068566,473226633600,497594882400,522999945600,549476817846,577061372256,605790375000,635701500000,666833343750,699225440256,732918276096,767953305600,804372966150,842220693600,881540937816,922379178336,964781940150,1008796809600,1054472450400,1101858619776,1151006184726,1201967138400,1254794616600,1309542914400,1366267502886,1425025046016,1485873417600,1548871718400,1614080293350,1681560748896,1751375970456,1823590140000,1898268753750,1975478640000,2055287977056,2137766311296,2222984575350,2311015106400,2401931664600,2495809451616,2592725129286,2692756838400,2795984217600,2902488422400,3012352144326,3125659630176,3242496701400,3362950773600,3487110876150,3615067671936,3746913477216,3882742281600,4022649768150,4166733333600,4315092108696,4467826978656,4625040603750,4786837440000,4953323760000,5124607673856,5300799150246,5482010037600,5668354085400,5859946965600,6056906294166,6259351652736,6467404610400,6681188745600,6900829668150,7126455041376,7358194604376,7596180194400,7840545769350,8091427430400,8348963444736,8613294268416,8884562569350,9162913250400,9448493472600,9741452678496,10041942615606,10350117360000
add $0,1
mov $1,$0
bin $1,3
pow $1,2
mul $1,6
|
programs/oeis/301/A301647.asm | karttu/loda | 1 | 101402 | <gh_stars>1-10
; A301647: a(n) = n^3 - (n mod 2).
; 0,8,26,64,124,216,342,512,728,1000,1330,1728,2196,2744,3374,4096,4912,5832,6858,8000,9260,10648,12166,13824,15624,17576,19682,21952,24388,27000,29790,32768,35936,39304,42874,46656,50652,54872,59318,64000,68920,74088,79506,85184,91124
mov $1,$0
add $1,1
pow $1,3
div $1,2
mul $1,2
|
src/Categories/Category/Discrete.agda | MirceaS/agda-categories | 0 | 6774 | <filename>src/Categories/Category/Discrete.agda
{-# OPTIONS --without-K --safe #-}
module Categories.Category.Discrete where
open import Categories.Category
open import Function
open import Relation.Binary.PropositionalEquality as ≡
Discrete : ∀ {a} (A : Set a) → Category a a a
Discrete A = record
{ Obj = A
; _⇒_ = _≡_
; _≈_ = _≡_
; id = refl
; _∘_ = flip ≡.trans
; assoc = λ {_ _ _ _ g} → sym (trans-assoc g)
; sym-assoc = λ {_ _ _ _ g} → trans-assoc g
; identityˡ = λ {_ _ f} → trans-reflʳ f
; identityʳ = refl
; identity² = refl
; equiv = isEquivalence
; ∘-resp-≈ = λ where
refl refl → refl
}
|
programs/oeis/199/A199411.asm | karttu/loda | 1 | 165500 | <reponame>karttu/loda
; A199411: 8*6^n+1.
; 9,49,289,1729,10369,62209,373249,2239489,13436929,80621569,483729409,2902376449,17414258689,104485552129,626913312769,3761479876609,22568879259649,135413275557889,812479653347329,4874877920083969,29249267520503809
mov $1,6
pow $1,$0
mul $1,8
add $1,1
|
savefile/maps/2174_BikeShop.asm | stranck/fools2018-1 | 35 | 174995 | <reponame>stranck/fools2018-1
SECTION "Map_2174", ROM0[$B800]
Map_2174_Header:
hdr_tileset 21
hdr_dimensions 4, 4
hdr_pointers_a Map_2174_Blocks, Map_2174_TextPointers
hdr_pointers_b Map_2174_Script, Map_2174_Objects
hdr_pointers_c Map_2174_InitScript, Map_2174_RAMScript
hdr_palette $06
hdr_music MUSIC_CITIES1, AUDIO_1
hdr_connection NORTH, $0000, 0, 0
hdr_connection SOUTH, $0000, 0, 0
hdr_connection WEST, $0000, 0, 0
hdr_connection EAST, $0000, 0, 0
Map_2174_Objects:
hdr_border $0e
hdr_warp_count 2
hdr_warp 3, 7, 6, 6, $2125
hdr_warp 2, 7, 6, 6, $2125
hdr_sign_count 0
hdr_object_count 1
hdr_object SPRITE_WAITER, 6, 2, STAY, DOWN, $01
Map_2174_RAMScript:
rs_end
Map_2174_Blocks:
db $04,$05,$02,$03
db $08,$08,$06,$07
db $0b,$0a,$0a,$0a
db $0a,$01,$0a,$09
Map_2174_TextPointers:
dw Map_2174_TX1
Map_2174_InitScript:
ret
Map_2174_Script:
ret
Map_2174_TX1:
TX_ASM
ld b, $2d
call IsItemInBag
jr z, .nope
ld hl, Map_2174_HasVoucher
call PrintTextEnhanced
ld a, $2d
call RemoveItemFromBag
ld bc, $0601
call GiveItem
jp TextScriptEnd
.nope
ld hl, Map_2174_NoVoucher
call PrintTextEnhanced
jp TextScriptEnd
Map_2174_NoVoucher:
text "Welcome to our Bike Shop."
para "For limited time only, you"
next "can get a totally radical"
cont "bike for just $999999.99!"
para "Oh, we're sorry."
next "You can't afford it."
done
Map_2174_HasVoucher:
text "Oh, is that a Bike Voucher?"
next "You're in luck, the voucher"
cont "was to expire tomorrow."
para "Well, here you go!"
next "A gnarly, rad bicycle!"
para "You exhanged the Voucher for"
next "a Bicycle!"
tx_snd SFX_GET_KEY_ITEM
done
|
table-sorting/src/TableSorting.adb | Tim-Tom/scratch | 0 | 5441 | <filename>table-sorting/src/TableSorting.adb
with Ada.Text_IO;
with Ada.Integer_Text_IO;
procedure TableSorting is
package IO renames Ada.Text_IO;
package I_IO renames Ada.Integer_Text_IO;
Num_Elements : constant := 14;
type Extended_Index is new Integer range 1 .. Num_Elements + 1;
subtype Index is Extended_Index range 1 .. Num_Elements;
a : Array(Index'Range) of Integer;
output_width : constant := 3;
count : Natural := 0;
procedure Print_Array is
begin
for i in Index'Range loop
I_IO.put(a(i), Width => output_width);
if i = Index'Last then
IO.New_Line;
else
IO.Put(' ');
end if;
end loop;
end Print_Array;
-- Standard next Lexicographic order permutation function from Knuth modified slightly
-- to ensure all indexes stay in bounds since I'm in Ada and it checks those things.
procedure Permute is
i : Index;
j : Index;
temp : Integer;
begin
-- Output
count := count + 1;
loop
i := Index'Last;
j := Index'Last;
-- Find left pivot (first item that is less than a successor)
while i > Index'First and then a(i - 1) >= a(i) loop
i := i - 1;
end loop;
-- Dropped off the left side, no more pivots.
exit when i = Index'First;
-- Previously i was the head of the ascending suffix, change it to be the pivot.
i := i - 1;
-- Find the rightmost element that exceeds our pivot
while a(j) <= a(i) loop
j := j - 1;
end loop;
-- Swap the pivot and that element
temp := a(i);
a(i) := a(j);
a(j) := temp;
-- Reverse the suffix
i := i + 1;
j := Index'Last;
while i < j loop
temp := a(i);
a(i) := a(j);
a(j) := temp;
i := i + 1;
j := j - 1;
end loop;
-- Output
count := count + 1;
end loop;
end Permute;
procedure Initialize(start : Extended_Index; size : Index) is
next : Extended_Index := start;
begin
if size = 1 then
for i in start .. Index'Last loop
a(i) := 100 + Integer(start);
end loop;
count := 0;
Permute;
for i in Index'First .. Index'Last / 2 loop
declare
j : constant Index := Index'Last - i + 1;
temp : constant Integer := a(i);
begin
a(i) := a(j);
a(j) := temp;
end;
end loop;
IO.Put(Natural'Image(count) & " iterations to solve: ");
Print_Array;
else
Initialize(next, size - 1);
while next + size <= Extended_Index'Last loop
for i in 0 .. size - 1 loop
a(next + i) := Integer(next);
end loop;
next := next + size;
Initialize(next, size - 1);
end loop;
end if;
end Initialize;
begin
Initialize(Index'First, 4);
-- for i in Index'Range loop
-- a(i) := Integer(i);
-- end loop;
-- loop
-- Print_Array;
-- exit when not Next_Permutation;
-- end loop;
end TableSorting;
|
Source/Scroll.asm | hhprg/C64Engine | 4 | 17230 | <reponame>hhprg/C64Engine<filename>Source/Scroll.asm
/******************************************************************
* Copyright (C) 2015-2021 <NAME> <<EMAIL>>
******************************************************************/
.filenamespace Scroll
//
.segment Zeropage "Scroll zeropage data"
zpDstScreenMemLo:
.fill 1, 0
zpDstScreenMemHi:
.fill 1, 0
//
.segment Code "Scroll code"
Init:
{
jsr ClearUnresolvedPositionChange
// Back buffer is already shifted right, no need to shift right away.
ldx #0
stx BackbufferIndex
stx IsShiftRequested
inx
stx IsShiftDone
// Fill initial front buffer.
lda #0
sta TileMapCharOffset
ldx #kScrollOffset
NextColumn: stx ColumnIndex
lda TileMapCharOffset:#0
ldx #0
jsr GetResolveColumn
inc TileMapCharOffset
ldx ColumnIndex:#0
jsr SetBackbufferColumn
ldx ColumnIndex
jsr SetColorColumn
ldx ColumnIndex
inx
cpx #kNumVisibleColumns + kScrollOffset
bne NextColumn
// Make newly filled buffer the front buffer.
jsr FlipBackbuffer
// Prepare back buffer = front buffer shifted one column right.
// This code has to be consistent with a call to StartShiftRight.
jsr ShiftColumnsRight
// Position is now position of left side of back buffer.
jsr CharTileMap.DecreasePosition
// Indicate that back buffer's corresponding decreased position hasn't been used.
dec UnresolvedPositionChange // -1
// Set leftmost back buffer screen column.
GetConstCharTileOffset(0)
jsr GetResolveColumn
ldx #0 + kScrollOffset
jsr SetBackbufferColumn
jmp ColorScroll.Init
}
//
// UnresolvedPositionChange = -1 if back buffer was shifted one column right (i.e. was prepared in
// anticipation of scrolling right). In that case we have to undo its DecreasePosition.
StartShiftLeft:
{
lda UnresolvedPositionChange
beq NoIncrease
jsr CharTileMap.IncreasePosition
inc UnresolvedPositionChange // 0
NoIncrease:
// Keep a copy of leftmost back buffer column which will need to be discarded later.
lda #0 + kScrollOffset
jsr GetBackbufferColumn
// Increase back buffer tile map position.
jsr CharTileMap.IncreasePosition
// Indicate that back buffer's corresponding increased position hasn't been used.
inc UnresolvedPositionChange // 1
// Get new column from tile map, discard back buffer column that was copied above and
// finally resolve new column.
GetConstCharTileOffset(kNumVisibleColumns - 1)
jsr GetDiscardResolveColumn
jsr ShiftColumnsLeft
// Set newly resolved column.
// Last column (39) is never visible when scrolling.
ldx #kNumVisibleColumns - 1 + kScrollOffset
jsr SetBackbufferColumn
jsr ColorScroll.StartShiftLeft
jmp ColorScroll.CopyLeftColumn
}
//
// UnresolvedPositionChange = 1 if back buffer was shifted one column left (i.e. was prepared in
// anticipation of scrolling left). In that case we have to undo its IncreasePosition.
StartShiftRight:
{
lda UnresolvedPositionChange
beq NoDecrease
jsr CharTileMap.DecreasePosition
dec UnresolvedPositionChange // 0
NoDecrease:
// Keep a copy of rightmost back buffer column which will need to be discarded later.
lda #kNumVisibleColumns - 1 + kScrollOffset
jsr GetBackbufferColumn
// Decrease back buffer tile map position.
jsr CharTileMap.DecreasePosition
// Indicate that back buffer's corresponding decreased position hasn't been used.
dec UnresolvedPositionChange // -1
// Get new column from tile map, discard back buffer column that was copied above and
// finally resolve new column.
GetConstCharTileOffset(0)
jsr GetDiscardResolveColumn
jsr ShiftColumnsRight
// Set newly resolved column.
ldx #0 + kScrollOffset
jsr SetBackbufferColumn
jmp ColorScroll.StartShiftRight
}
//
// This is case where we scrolled left and then immediately decided to scroll back right.
// Then we can just flip buffers since back buffer already contains front buffer shifted right.
UndoShiftLeft:
{
AddHighPriorityTask(UndoColorShiftLeftTask)
jsr ClearUnresolvedPositionChange
jsr FlipBackbuffer
jmp CharTileMap.DecreasePosition
}
//
UndoColorShiftLeftTask:
{
// Todo: Macro to end task.
jsr ColorScroll.UndoShiftLeft
ReturnFromTask()
}
//
FinishColorShiftTask:
{
jsr ColorScroll.FinishShift
ReturnFromTask()
}
//
FinishShift:
{
AddHighPriorityTask(FinishColorShiftTask)
// We're about to use back buffer, i.e. its position change will be used.
jsr ClearUnresolvedPositionChange
// Fall through to FlipBackbuffer
}
//
FlipBackbuffer:
{
lda BackbufferIndex
eor #1
sta BackbufferIndex
rts
}
//
ClearUnresolvedPositionChange:
{
lda #0
sta UnresolvedPositionChange
rts
}
//
GetDiscardResolveColumn:
{
jsr CharTileMap.GetColumn
jsr CharTileMap.DiscardColumn
jmp CharTileMap.ResolveColumn
}
//
GetResolveColumn:
{
jsr CharTileMap.GetColumn
jmp CharTileMap.ResolveColumn
}
//
// Get column to discard when screen shifts, row by row from top to bottom.
GetBackbufferColumn:
{
ldx BackbufferIndex
}
// a = index of column to get.
// x = screen index (0 or 1).
GetBufferColumn:
{
sta zpDstScreenMemLo
lda ScreenAdrHi,x
sta zpDstScreenMemHi
clc
ldx #0
ldy #0
NextRow: lda (zpDstScreenMemLo),y
sta DiscardColumnPhysicalChars,x
lda zpDstScreenMemLo
adc #kNumScreenColumns
sta zpDstScreenMemLo
bcc NoHi
inc zpDstScreenMemHi
NoHi: inx
cpx #kNumScreenScrollRows
bcc NextRow
rts
}
// Set new column, row by row from top to bottom.
// x = index of column to set (actually offset of first byte in screen column).
SetBackbufferColumn:
{
ldy BackbufferIndex
lda ScreenAdrHi,y
sta zpDstScreenMemHi
lda #<ColumnPhysicalChars
ldy #>ColumnPhysicalChars
}
SetBufferColumn:
{
sta SrcColumnLo
sty SrcColumnHi
// zpDstScreenMemHi is set when we get here.
stx zpDstScreenMemLo
ldx #0
ldy #0
clc
NextRow:
.label SrcColumnLo = *+1
.label SrcColumnHi = *+2
lda kDefaultAdr,x
sta (zpDstScreenMemLo),y
lda zpDstScreenMemLo
adc #kNumScreenColumns
sta zpDstScreenMemLo
bcc NoHi
inc zpDstScreenMemHi
NoHi: inx
cpx #kNumScreenScrollRows
bcc NextRow
rts
}
//
// x = index of column to set.
SetColorColumn:
{
lda #>kColorMem
sta zpDstScreenMemHi
lda #<ColumnColors
ldy #>ColumnColors
bne SetBufferColumn // bra
}
//
.const kDataSize = kNumScreenScrollRows * kNumScreenColumns
.const kNumBlocks = 4
.const kBlockSize = kDataSize / kNumBlocks
// Shift columns right.
ShiftColumnsRight:
{
ldx #kBlockSize-1
ldy #kBlockSize
lda #DEX
bne ShiftColumns // bra
}
// Shift columns left.
ShiftColumnsLeft:
{
ldx #kBlockSize
ldy #kBlockSize-1
lda #DEY
}
// Shift screen columns one step to the left or right.
ShiftColumns:
{
sta Dec0
sta Dec2
eor #DEX^DEY // Turn dex into dey and vice versa.
sta Dec1
sta Dec3
lda BackbufferIndex
beq ToScreen0
// From screen 0 to screen 1.
ToScreen1:
.for (var i = 0; i < kNumBlocks; i++)
{
lda Screen0Mem + i * kBlockSize + kScrollOffset,x
sta Screen1Mem + i * kBlockSize + kScrollOffset,y
}
Dec0: dey
Dec1: dex
bne ToScreen1
rts
// From screen 1 to screen 0.
ToScreen0:
.for (var i = 0; i < kNumBlocks; i++)
{
lda Screen1Mem + i * kBlockSize + kScrollOffset,x
sta Screen0Mem + i * kBlockSize + kScrollOffset,y
}
Dec2: dey
Dec3: dex
bne ToScreen0
rts
}
//
// a = shift direction
RequestShift:
{
sta ShiftDirection
#if DEBUG
lda IsShiftRequested
eor #1
and IsShiftDone
bne Okay
DebugHang()
Okay:
#endif // DEBUG
ldx #0
stx IsShiftDone
inx
stx IsShiftRequested
TaskInput(ShiftTask)
jmp Task.AddMediumPriority
}
//
ShiftTask:
{
lda #0
sta IsShiftRequested
lda ShiftDirection
bmi Right
Left: jsr StartShiftLeft
jmp Done
Right: jsr StartShiftRight
Done: lda #1
sta IsShiftDone
ReturnFromTask()
}
//
.segment Code "Scroll const data"
ScreenAdrBits:
.byte kScreen0AdrBits, kScreen1AdrBits
ScreenAdrHi:
.byte >Screen0Mem, >Screen1Mem
//
.segment BSS2 "Scroll data"
// 1 = left, 0 = stopped, -1 = right
ShiftDirection:
.fill 1, 0
// Set to 1 when shift is done.
IsShiftDone:
.fill 1, 0
// Set to 1 to request shift to start.
IsShiftRequested:
.fill 1, 0
// -1 if back buffer is front buffer shifted right and its content has never been "resolved", i.e. used as front buffer.
// 1 if back buffer is front buffer shifted left and its content has never been "resolved", i.e. used as front buffer.
// 0 if back buffer content has been used as front buffer
// The value {-1,0,1} is the back buffer's char tile map position offset relative to the front buffer's char tile map position.
UnresolvedPositionChange:
.fill 1, 0
// 0 or 1.
BackbufferIndex:
.fill 1, 0
// Vir chars resolved to physical chars by CharTileMap.
ColumnPhysicalChars:
.fill kNumScreenScrollRows, 0
// Old column with physical chars to be discarded.
DiscardColumnPhysicalChars:
.fill kNumScreenScrollRows, 0
.align 32 // Align to avoid ColumnColors page crossing.
// Colors set by CharTileMap.
ColumnColors:
.fill kNumScreenScrollRows, 0
|
oeis/211/A211995.asm | neoneye/loda-programs | 11 | 17133 | ; A211995: a(n) = floor(7^n / 2^n) mod 2^n.
; Submitted by <NAME>
; 0,1,0,2,6,13,46,33,246,479,398,883,20,6215,9467,16751,42245,115091,140675,492363,674695,1312859,2497856,2451041,4384342,6956591,24348068,118772672,147268896,112787953,394757837,844781520,809251672,2832380853,1323398395,13221828975
mov $1,7
pow $1,$0
mov $2,2
pow $2,$0
div $1,$2
mod $1,$2
mov $0,$1
|
src/console/ConsoleInputHandle.asm | jhm-ciberman/calculator-asm | 2 | 2856 | proc ConsoleInputHandle, input: QWORD
fastcall AppLogOffsetReset
fastcall ParserParseString, rcx
fastcall ConsoleFlushBuffers
ret
endp |
Task/Ackermann-function/Agda/ackermann-function-2.agda | LaudateCorpus1/RosettaCodeData | 1 | 8087 | <filename>Task/Ackermann-function/Agda/ackermann-function-2.agda
agda --compile Ackermann.agda
./Ackermann
|
unittests/ASM/SecondaryModRM/Reg_7_1.asm | fengjixuchui/FEX | 0 | 177070 | <reponame>fengjixuchui/FEX
%ifdef CONFIG
{
}
%endif
; We can't really check the results of this
; Just ensure we execute it
rdtscp
hlt
|
programs/oeis/154/A154560.asm | karttu/loda | 1 | 166589 | <gh_stars>1-10
; A154560: (n+3)^2*n/2 + 1.
; 1,9,26,55,99,161,244,351,485,649,846,1079,1351,1665,2024,2431,2889,3401,3970,4599,5291,6049,6876,7775,8749,9801,10934,12151,13455,14849,16336,17919,19601,21385,23274,25271,27379,29601,31940,34399,36981,39689,42526,45495,48599,51841,55224,58751,62425,66249,70226,74359,78651,83105,87724,92511,97469,102601,107910,113399,119071,124929,130976,137215,143649,150281,157114,164151,171395,178849,186516,194399,202501,210825,219374,228151,237159,246401,255880,265599,275561,285769,296226,306935,317899,329121,340604,352351,364365,376649,389206,402039,415151,428545,442224,456191,470449,485001,499850,514999,530451,546209,562276,578655,595349,612361,629694,647351,665335,683649,702296,721279,740601,760265,780274,800631,821339,842401,863820,885599,907741,930249,953126,976375,999999,1024001,1048384,1073151,1098305,1123849,1149786,1176119,1202851,1229985,1257524,1285471,1313829,1342601,1371790,1401399,1431431,1461889,1492776,1524095,1555849,1588041,1620674,1653751,1687275,1721249,1755676,1790559,1825901,1861705,1897974,1934711,1971919,2009601,2047760,2086399,2125521,2165129,2205226,2245815,2286899,2328481,2370564,2413151,2456245,2499849,2543966,2588599,2633751,2679425,2725624,2772351,2819609,2867401,2915730,2964599,3014011,3063969,3114476,3165535,3217149,3269321,3322054,3375351,3429215,3483649,3538656,3594239,3650401,3707145,3764474,3822391,3880899,3940001,3999700,4059999,4120901,4182409,4244526,4307255,4370599,4434561,4499144,4564351,4630185,4696649,4763746,4831479,4899851,4968865,5038524,5108831,5179789,5251401,5323670,5396599,5470191,5544449,5619376,5694975,5771249,5848201,5925834,6004151,6083155,6162849,6243236,6324319,6406101,6488585,6571774,6655671,6740279,6825601,6911640,6998399,7085881,7174089,7263026,7352695,7443099,7534241,7626124,7718751,7812125,7906249
mov $1,$0
add $0,3
mul $1,$0
mul $1,$0
div $1,2
add $1,1
|
Task/Power-set/AppleScript/power-set-2.applescript | LaudateCorpus1/RosettaCodeData | 1 | 3376 | {{"Set [1,2,3]", {{}, {3}, {2}, {2, 3}, {1}, {1, 3}, {1, 2}, {1, 2, 3}}},
{"Empty set", {{}}},
{"Set containing only empty set", {{}, {{}}}}}
|
src/model/jason-tickets-models.adb | stcarrez/jason | 2 | 19849 | -----------------------------------------------------------------------
-- Jason.Tickets.Models -- Jason.Tickets.Models
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-body.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 2020 Stephane.Carrez
-- Written by Stephane.Carrez (<EMAIL>)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Util.Beans.Objects.Time;
with ASF.Events.Faces.Actions;
package body Jason.Tickets.Models is
use type ADO.Objects.Object_Record_Access;
use type ADO.Objects.Object_Ref;
pragma Warnings (Off, "formal parameter * is not referenced");
function Ticket_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => TICKET_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Ticket_Key;
function Ticket_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => TICKET_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Ticket_Key;
function "=" (Left, Right : Ticket_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Ticket_Ref'Class;
Impl : out Ticket_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Ticket_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Ticket_Ref) is
Impl : Ticket_Access;
begin
Impl := new Ticket_Impl;
Impl.Version := 0;
Impl.Ident := 0;
Impl.Create_Date := ADO.DEFAULT_TIME;
Impl.Priority := 0;
Impl.Status := Jason.Tickets.Models.Status_Type'First;
Impl.Update_Date := ADO.DEFAULT_TIME;
Impl.Ticket_Type := Jason.Tickets.Models.Ticket_Type'First;
Impl.Duration := 0;
Impl.Progress := 0;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Ticket
-- ----------------------------------------
procedure Set_Id (Object : in out Ticket_Ref;
Value : in ADO.Identifier) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value);
end Set_Id;
function Get_Id (Object : in Ticket_Ref)
return ADO.Identifier is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Id;
function Get_Version (Object : in Ticket_Ref)
return Integer is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Version;
end Get_Version;
procedure Set_Summary (Object : in out Ticket_Ref;
Value : in String) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_String (Impl.all, 3, Impl.Summary, Value);
end Set_Summary;
procedure Set_Summary (Object : in out Ticket_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Unbounded_String (Impl.all, 3, Impl.Summary, Value);
end Set_Summary;
function Get_Summary (Object : in Ticket_Ref)
return String is
begin
return Ada.Strings.Unbounded.To_String (Object.Get_Summary);
end Get_Summary;
function Get_Summary (Object : in Ticket_Ref)
return Ada.Strings.Unbounded.Unbounded_String is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Summary;
end Get_Summary;
procedure Set_Ident (Object : in out Ticket_Ref;
Value : in Integer) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 4, Impl.Ident, Value);
end Set_Ident;
function Get_Ident (Object : in Ticket_Ref)
return Integer is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Ident;
end Get_Ident;
procedure Set_Create_Date (Object : in out Ticket_Ref;
Value : in Ada.Calendar.Time) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 5, Impl.Create_Date, Value);
end Set_Create_Date;
function Get_Create_Date (Object : in Ticket_Ref)
return Ada.Calendar.Time is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Create_Date;
end Get_Create_Date;
procedure Set_Priority (Object : in out Ticket_Ref;
Value : in Integer) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 6, Impl.Priority, Value);
end Set_Priority;
function Get_Priority (Object : in Ticket_Ref)
return Integer is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Priority;
end Get_Priority;
procedure Set_Status (Object : in out Ticket_Ref;
Value : in Jason.Tickets.Models.Status_Type) is
procedure Set_Field_Enum is
new ADO.Objects.Set_Field_Operation (Status_Type);
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
Set_Field_Enum (Impl.all, 7, Impl.Status, Value);
end Set_Status;
function Get_Status (Object : in Ticket_Ref)
return Jason.Tickets.Models.Status_Type is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Status;
end Get_Status;
procedure Set_Description (Object : in out Ticket_Ref;
Value : in String) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_String (Impl.all, 8, Impl.Description, Value);
end Set_Description;
procedure Set_Description (Object : in out Ticket_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Unbounded_String (Impl.all, 8, Impl.Description, Value);
end Set_Description;
function Get_Description (Object : in Ticket_Ref)
return String is
begin
return Ada.Strings.Unbounded.To_String (Object.Get_Description);
end Get_Description;
function Get_Description (Object : in Ticket_Ref)
return Ada.Strings.Unbounded.Unbounded_String is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Description;
end Get_Description;
procedure Set_Update_Date (Object : in out Ticket_Ref;
Value : in Ada.Calendar.Time) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Time (Impl.all, 9, Impl.Update_Date, Value);
end Set_Update_Date;
function Get_Update_Date (Object : in Ticket_Ref)
return Ada.Calendar.Time is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Update_Date;
end Get_Update_Date;
procedure Set_Ticket_Type (Object : in out Ticket_Ref;
Value : in Jason.Tickets.Models.Ticket_Type) is
procedure Set_Field_Enum is
new ADO.Objects.Set_Field_Operation (Ticket_Type);
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
Set_Field_Enum (Impl.all, 10, Impl.Ticket_Type, Value);
end Set_Ticket_Type;
function Get_Ticket_Type (Object : in Ticket_Ref)
return Jason.Tickets.Models.Ticket_Type is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Ticket_Type;
end Get_Ticket_Type;
procedure Set_Duration (Object : in out Ticket_Ref;
Value : in Integer) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 11, Impl.Duration, Value);
end Set_Duration;
function Get_Duration (Object : in Ticket_Ref)
return Integer is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Duration;
end Get_Duration;
procedure Set_Progress (Object : in out Ticket_Ref;
Value : in Integer) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Integer (Impl.all, 12, Impl.Progress, Value);
end Set_Progress;
function Get_Progress (Object : in Ticket_Ref)
return Integer is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Progress;
end Get_Progress;
procedure Set_Project (Object : in out Ticket_Ref;
Value : in Jason.Projects.Models.Project_Ref'Class) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 13, Impl.Project, Value);
end Set_Project;
function Get_Project (Object : in Ticket_Ref)
return Jason.Projects.Models.Project_Ref'Class is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Project;
end Get_Project;
procedure Set_Creator (Object : in out Ticket_Ref;
Value : in AWA.Users.Models.User_Ref'Class) is
Impl : Ticket_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 14, Impl.Creator, Value);
end Set_Creator;
function Get_Creator (Object : in Ticket_Ref)
return AWA.Users.Models.User_Ref'Class is
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Creator;
end Get_Creator;
-- Copy of the object.
procedure Copy (Object : in Ticket_Ref;
Into : in out Ticket_Ref) is
Result : Ticket_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Ticket_Access
:= Ticket_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Ticket_Access
:= new Ticket_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Version := Impl.Version;
Copy.Summary := Impl.Summary;
Copy.Ident := Impl.Ident;
Copy.Create_Date := Impl.Create_Date;
Copy.Priority := Impl.Priority;
Copy.Status := Impl.Status;
Copy.Description := Impl.Description;
Copy.Update_Date := Impl.Update_Date;
Copy.Ticket_Type := Impl.Ticket_Type;
Copy.Duration := Impl.Duration;
Copy.Progress := Impl.Progress;
Copy.Project := Impl.Project;
Copy.Creator := Impl.Creator;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Ticket_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Ticket_Access := new Ticket_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Ticket_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Ticket_Access := new Ticket_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Ticket_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Ticket_Access := new Ticket_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Ticket_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Ticket_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Ticket_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Ticket_Impl) is
type Ticket_Impl_Ptr is access all Ticket_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Ticket_Impl, Ticket_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Ticket_Impl_Ptr := Ticket_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Ticket_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, TICKET_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Ticket_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Ticket_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (TICKET_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_1_NAME, -- id
Value => Object.Get_Key);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (3) then
Stmt.Save_Field (Name => COL_2_1_NAME, -- summary
Value => Object.Summary);
Object.Clear_Modified (3);
end if;
if Object.Is_Modified (4) then
Stmt.Save_Field (Name => COL_3_1_NAME, -- ident
Value => Object.Ident);
Object.Clear_Modified (4);
end if;
if Object.Is_Modified (5) then
Stmt.Save_Field (Name => COL_4_1_NAME, -- create_date
Value => Object.Create_Date);
Object.Clear_Modified (5);
end if;
if Object.Is_Modified (6) then
Stmt.Save_Field (Name => COL_5_1_NAME, -- priority
Value => Object.Priority);
Object.Clear_Modified (6);
end if;
if Object.Is_Modified (7) then
Stmt.Save_Field (Name => COL_6_1_NAME, -- status
Value => Integer (Status_Type'Pos (Object.Status)));
Object.Clear_Modified (7);
end if;
if Object.Is_Modified (8) then
Stmt.Save_Field (Name => COL_7_1_NAME, -- description
Value => Object.Description);
Object.Clear_Modified (8);
end if;
if Object.Is_Modified (9) then
Stmt.Save_Field (Name => COL_8_1_NAME, -- update_date
Value => Object.Update_Date);
Object.Clear_Modified (9);
end if;
if Object.Is_Modified (10) then
Stmt.Save_Field (Name => COL_9_1_NAME, -- ticket_type
Value => Integer (Ticket_Type'Pos (Object.Ticket_Type)));
Object.Clear_Modified (10);
end if;
if Object.Is_Modified (11) then
Stmt.Save_Field (Name => COL_10_1_NAME, -- duration
Value => Object.Duration);
Object.Clear_Modified (11);
end if;
if Object.Is_Modified (12) then
Stmt.Save_Field (Name => COL_11_1_NAME, -- progress
Value => Object.Progress);
Object.Clear_Modified (12);
end if;
if Object.Is_Modified (13) then
Stmt.Save_Field (Name => COL_12_1_NAME, -- project_id
Value => Object.Project);
Object.Clear_Modified (13);
end if;
if Object.Is_Modified (14) then
Stmt.Save_Field (Name => COL_13_1_NAME, -- creator_id
Value => Object.Creator);
Object.Clear_Modified (14);
end if;
if Stmt.Has_Save_Fields then
Object.Version := Object.Version + 1;
Stmt.Save_Field (Name => "version",
Value => Object.Version);
Stmt.Set_Filter (Filter => "id = ? and version = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Add_Param (Value => Object.Version - 1);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
else
raise ADO.Objects.LAZY_LOCK;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Ticket_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (TICKET_DEF'Access);
Result : Integer;
begin
Object.Version := 1;
Session.Allocate (Id => Object);
Query.Save_Field (Name => COL_0_1_NAME, -- id
Value => Object.Get_Key);
Query.Save_Field (Name => COL_1_1_NAME, -- version
Value => Object.Version);
Query.Save_Field (Name => COL_2_1_NAME, -- summary
Value => Object.Summary);
Query.Save_Field (Name => COL_3_1_NAME, -- ident
Value => Object.Ident);
Query.Save_Field (Name => COL_4_1_NAME, -- create_date
Value => Object.Create_Date);
Query.Save_Field (Name => COL_5_1_NAME, -- priority
Value => Object.Priority);
Query.Save_Field (Name => COL_6_1_NAME, -- status
Value => Integer (Status_Type'Pos (Object.Status)));
Query.Save_Field (Name => COL_7_1_NAME, -- description
Value => Object.Description);
Query.Save_Field (Name => COL_8_1_NAME, -- update_date
Value => Object.Update_Date);
Query.Save_Field (Name => COL_9_1_NAME, -- ticket_type
Value => Integer (Ticket_Type'Pos (Object.Ticket_Type)));
Query.Save_Field (Name => COL_10_1_NAME, -- duration
Value => Object.Duration);
Query.Save_Field (Name => COL_11_1_NAME, -- progress
Value => Object.Progress);
Query.Save_Field (Name => COL_12_1_NAME, -- project_id
Value => Object.Project);
Query.Save_Field (Name => COL_13_1_NAME, -- creator_id
Value => Object.Creator);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Ticket_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (TICKET_DEF'Access);
begin
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Ticket_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : ADO.Objects.Object_Record_Access;
Impl : access Ticket_Impl;
begin
if From.Is_Null then
return Util.Beans.Objects.Null_Object;
end if;
Obj := From.Get_Load_Object;
Impl := Ticket_Impl (Obj.all)'Access;
if Name = "id" then
return ADO.Objects.To_Object (Impl.Get_Key);
elsif Name = "summary" then
return Util.Beans.Objects.To_Object (Impl.Summary);
elsif Name = "ident" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Ident));
elsif Name = "create_date" then
return Util.Beans.Objects.Time.To_Object (Impl.Create_Date);
elsif Name = "priority" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Priority));
elsif Name = "status" then
return Jason.Tickets.Models.Status_Type_Objects.To_Object (Impl.Status);
elsif Name = "description" then
return Util.Beans.Objects.To_Object (Impl.Description);
elsif Name = "update_date" then
return Util.Beans.Objects.Time.To_Object (Impl.Update_Date);
elsif Name = "ticket_type" then
return Jason.Tickets.Models.Ticket_Type_Objects.To_Object (Impl.Ticket_Type);
elsif Name = "duration" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Duration));
elsif Name = "progress" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Progress));
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
procedure List (Object : in out Ticket_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, TICKET_DEF'Access);
begin
Stmt.Execute;
Ticket_Vectors.Clear (Object);
while Stmt.Has_Elements loop
declare
Item : Ticket_Ref;
Impl : constant Ticket_Access := new Ticket_Impl;
begin
Impl.Load (Stmt, Session);
ADO.Objects.Set_Object (Item, Impl.all'Access);
Object.Append (Item);
end;
Stmt.Next;
end loop;
end List;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Ticket_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
begin
Object.Set_Key_Value (Stmt.Get_Identifier (0));
Object.Summary := Stmt.Get_Unbounded_String (2);
Object.Ident := Stmt.Get_Integer (3);
Object.Create_Date := Stmt.Get_Time (4);
Object.Priority := Stmt.Get_Integer (5);
Object.Status := Status_Type'Val (Stmt.Get_Integer (6));
Object.Description := Stmt.Get_Unbounded_String (7);
Object.Update_Date := Stmt.Get_Time (8);
Object.Ticket_Type := Ticket_Type'Val (Stmt.Get_Integer (9));
Object.Duration := Stmt.Get_Integer (10);
Object.Progress := Stmt.Get_Integer (11);
if not Stmt.Is_Null (12) then
Object.Project.Set_Key_Value (Stmt.Get_Identifier (12), Session);
end if;
if not Stmt.Is_Null (13) then
Object.Creator.Set_Key_Value (Stmt.Get_Identifier (13), Session);
end if;
Object.Version := Stmt.Get_Integer (1);
ADO.Objects.Set_Created (Object);
end Load;
function Attribute_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => ATTRIBUTE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Attribute_Key;
function Attribute_Key (Id : in String) return ADO.Objects.Object_Key is
Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => ATTRIBUTE_DEF'Access);
begin
ADO.Objects.Set_Value (Result, Id);
return Result;
end Attribute_Key;
function "=" (Left, Right : Attribute_Ref'Class) return Boolean is
begin
return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right);
end "=";
procedure Set_Field (Object : in out Attribute_Ref'Class;
Impl : out Attribute_Access) is
Result : ADO.Objects.Object_Record_Access;
begin
Object.Prepare_Modify (Result);
Impl := Attribute_Impl (Result.all)'Access;
end Set_Field;
-- Internal method to allocate the Object_Record instance
procedure Allocate (Object : in out Attribute_Ref) is
Impl : Attribute_Access;
begin
Impl := new Attribute_Impl;
Impl.Version := 0;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Allocate;
-- ----------------------------------------
-- Data object: Attribute
-- ----------------------------------------
procedure Set_Id (Object : in out Attribute_Ref;
Value : in ADO.Identifier) is
Impl : Attribute_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value);
end Set_Id;
function Get_Id (Object : in Attribute_Ref)
return ADO.Identifier is
Impl : constant Attribute_Access
:= Attribute_Impl (Object.Get_Object.all)'Access;
begin
return Impl.Get_Key_Value;
end Get_Id;
procedure Set_Value (Object : in out Attribute_Ref;
Value : in String) is
Impl : Attribute_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_String (Impl.all, 2, Impl.Value, Value);
end Set_Value;
procedure Set_Value (Object : in out Attribute_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String) is
Impl : Attribute_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Unbounded_String (Impl.all, 2, Impl.Value, Value);
end Set_Value;
function Get_Value (Object : in Attribute_Ref)
return String is
begin
return Ada.Strings.Unbounded.To_String (Object.Get_Value);
end Get_Value;
function Get_Value (Object : in Attribute_Ref)
return Ada.Strings.Unbounded.Unbounded_String is
Impl : constant Attribute_Access
:= Attribute_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Value;
end Get_Value;
function Get_Version (Object : in Attribute_Ref)
return Integer is
Impl : constant Attribute_Access
:= Attribute_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Version;
end Get_Version;
procedure Set_Definition (Object : in out Attribute_Ref;
Value : in Jason.Projects.Models.Attribute_Definition_Ref'Class) is
Impl : Attribute_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 4, Impl.Definition, Value);
end Set_Definition;
function Get_Definition (Object : in Attribute_Ref)
return Jason.Projects.Models.Attribute_Definition_Ref'Class is
Impl : constant Attribute_Access
:= Attribute_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Definition;
end Get_Definition;
procedure Set_Ticket (Object : in out Attribute_Ref;
Value : in Jason.Tickets.Models.Ticket_Ref'Class) is
Impl : Attribute_Access;
begin
Set_Field (Object, Impl);
ADO.Objects.Set_Field_Object (Impl.all, 5, Impl.Ticket, Value);
end Set_Ticket;
function Get_Ticket (Object : in Attribute_Ref)
return Jason.Tickets.Models.Ticket_Ref'Class is
Impl : constant Attribute_Access
:= Attribute_Impl (Object.Get_Load_Object.all)'Access;
begin
return Impl.Ticket;
end Get_Ticket;
-- Copy of the object.
procedure Copy (Object : in Attribute_Ref;
Into : in out Attribute_Ref) is
Result : Attribute_Ref;
begin
if not Object.Is_Null then
declare
Impl : constant Attribute_Access
:= Attribute_Impl (Object.Get_Load_Object.all)'Access;
Copy : constant Attribute_Access
:= new Attribute_Impl;
begin
ADO.Objects.Set_Object (Result, Copy.all'Access);
Copy.Copy (Impl.all);
Copy.Value := Impl.Value;
Copy.Version := Impl.Version;
Copy.Definition := Impl.Definition;
Copy.Ticket := Impl.Ticket;
end;
end if;
Into := Result;
end Copy;
procedure Find (Object : in out Attribute_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Impl : constant Attribute_Access := new Attribute_Impl;
begin
Impl.Find (Session, Query, Found);
if Found then
ADO.Objects.Set_Object (Object, Impl.all'Access);
else
ADO.Objects.Set_Object (Object, null);
Destroy (Impl);
end if;
end Find;
procedure Load (Object : in out Attribute_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier) is
Impl : constant Attribute_Access := new Attribute_Impl;
Found : Boolean;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
raise ADO.Objects.NOT_FOUND;
end if;
ADO.Objects.Set_Object (Object, Impl.all'Access);
end Load;
procedure Load (Object : in out Attribute_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean) is
Impl : constant Attribute_Access := new Attribute_Impl;
Query : ADO.SQL.Query;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Impl.Find (Session, Query, Found);
if not Found then
Destroy (Impl);
else
ADO.Objects.Set_Object (Object, Impl.all'Access);
end if;
end Load;
procedure Save (Object : in out Attribute_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl = null then
Impl := new Attribute_Impl;
ADO.Objects.Set_Object (Object, Impl);
end if;
if not ADO.Objects.Is_Created (Impl.all) then
Impl.Create (Session);
else
Impl.Save (Session);
end if;
end Save;
procedure Delete (Object : in out Attribute_Ref;
Session : in out ADO.Sessions.Master_Session'Class) is
Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object;
begin
if Impl /= null then
Impl.Delete (Session);
end if;
end Delete;
-- --------------------
-- Free the object
-- --------------------
procedure Destroy (Object : access Attribute_Impl) is
type Attribute_Impl_Ptr is access all Attribute_Impl;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Attribute_Impl, Attribute_Impl_Ptr);
pragma Warnings (Off, "*redundant conversion*");
Ptr : Attribute_Impl_Ptr := Attribute_Impl (Object.all)'Access;
pragma Warnings (On, "*redundant conversion*");
begin
Unchecked_Free (Ptr);
end Destroy;
procedure Find (Object : in out Attribute_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, ATTRIBUTE_DEF'Access);
begin
Stmt.Execute;
if Stmt.Has_Elements then
Object.Load (Stmt, Session);
Stmt.Next;
Found := not Stmt.Has_Elements;
else
Found := False;
end if;
end Find;
overriding
procedure Load (Object : in out Attribute_Impl;
Session : in out ADO.Sessions.Session'Class) is
Found : Boolean;
Query : ADO.SQL.Query;
Id : constant ADO.Identifier := Object.Get_Key_Value;
begin
Query.Bind_Param (Position => 1, Value => Id);
Query.Set_Filter ("id = ?");
Object.Find (Session, Query, Found);
if not Found then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Save (Object : in out Attribute_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Update_Statement
:= Session.Create_Statement (ATTRIBUTE_DEF'Access);
begin
if Object.Is_Modified (1) then
Stmt.Save_Field (Name => COL_0_2_NAME, -- id
Value => Object.Get_Key);
Object.Clear_Modified (1);
end if;
if Object.Is_Modified (2) then
Stmt.Save_Field (Name => COL_1_2_NAME, -- value
Value => Object.Value);
Object.Clear_Modified (2);
end if;
if Object.Is_Modified (4) then
Stmt.Save_Field (Name => COL_3_2_NAME, -- definition_id
Value => Object.Definition);
Object.Clear_Modified (4);
end if;
if Object.Is_Modified (5) then
Stmt.Save_Field (Name => COL_4_2_NAME, -- ticket_id
Value => Object.Ticket);
Object.Clear_Modified (5);
end if;
if Stmt.Has_Save_Fields then
Object.Version := Object.Version + 1;
Stmt.Save_Field (Name => "version",
Value => Object.Version);
Stmt.Set_Filter (Filter => "id = ? and version = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Add_Param (Value => Object.Version - 1);
declare
Result : Integer;
begin
Stmt.Execute (Result);
if Result /= 1 then
if Result /= 0 then
raise ADO.Objects.UPDATE_ERROR;
else
raise ADO.Objects.LAZY_LOCK;
end if;
end if;
end;
end if;
end Save;
procedure Create (Object : in out Attribute_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Query : ADO.Statements.Insert_Statement
:= Session.Create_Statement (ATTRIBUTE_DEF'Access);
Result : Integer;
begin
Object.Version := 1;
Session.Allocate (Id => Object);
Query.Save_Field (Name => COL_0_2_NAME, -- id
Value => Object.Get_Key);
Query.Save_Field (Name => COL_1_2_NAME, -- value
Value => Object.Value);
Query.Save_Field (Name => COL_2_2_NAME, -- version
Value => Object.Version);
Query.Save_Field (Name => COL_3_2_NAME, -- definition_id
Value => Object.Definition);
Query.Save_Field (Name => COL_4_2_NAME, -- ticket_id
Value => Object.Ticket);
Query.Execute (Result);
if Result /= 1 then
raise ADO.Objects.INSERT_ERROR;
end if;
ADO.Objects.Set_Created (Object);
end Create;
procedure Delete (Object : in out Attribute_Impl;
Session : in out ADO.Sessions.Master_Session'Class) is
Stmt : ADO.Statements.Delete_Statement
:= Session.Create_Statement (ATTRIBUTE_DEF'Access);
begin
Stmt.Set_Filter (Filter => "id = ?");
Stmt.Add_Param (Value => Object.Get_Key);
Stmt.Execute;
end Delete;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Attribute_Ref;
Name : in String) return Util.Beans.Objects.Object is
Obj : ADO.Objects.Object_Record_Access;
Impl : access Attribute_Impl;
begin
if From.Is_Null then
return Util.Beans.Objects.Null_Object;
end if;
Obj := From.Get_Load_Object;
Impl := Attribute_Impl (Obj.all)'Access;
if Name = "id" then
return ADO.Objects.To_Object (Impl.Get_Key);
elsif Name = "value" then
return Util.Beans.Objects.To_Object (Impl.Value);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
procedure List (Object : in out Attribute_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class) is
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Query, ATTRIBUTE_DEF'Access);
begin
Stmt.Execute;
Attribute_Vectors.Clear (Object);
while Stmt.Has_Elements loop
declare
Item : Attribute_Ref;
Impl : constant Attribute_Access := new Attribute_Impl;
begin
Impl.Load (Stmt, Session);
ADO.Objects.Set_Object (Item, Impl.all'Access);
Object.Append (Item);
end;
Stmt.Next;
end loop;
end List;
-- ------------------------------
-- Load the object from current iterator position
-- ------------------------------
procedure Load (Object : in out Attribute_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class) is
begin
Object.Set_Key_Value (Stmt.Get_Identifier (0));
Object.Value := Stmt.Get_Unbounded_String (1);
if not Stmt.Is_Null (3) then
Object.Definition.Set_Key_Value (Stmt.Get_Identifier (3), Session);
end if;
if not Stmt.Is_Null (4) then
Object.Ticket.Set_Key_Value (Stmt.Get_Identifier (4), Session);
end if;
Object.Version := Stmt.Get_Integer (2);
ADO.Objects.Set_Created (Object);
end Load;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in List_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id));
elsif Name = "ident" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Ident));
elsif Name = "summary" then
return Util.Beans.Objects.To_Object (From.Summary);
elsif Name = "priority" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Priority));
elsif Name = "create_date" then
return Util.Beans.Objects.Time.To_Object (From.Create_Date);
elsif Name = "update_date" then
return Util.Beans.Objects.Time.To_Object (From.Update_Date);
elsif Name = "status" then
return Jason.Tickets.Models.Status_Type_Objects.To_Object (From.Status);
elsif Name = "ticket_type" then
return Jason.Tickets.Models.Ticket_Type_Objects.To_Object (From.Ticket_Type);
elsif Name = "duration" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Duration));
elsif Name = "progress" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Progress));
elsif Name = "creator" then
return Util.Beans.Objects.To_Object (From.Creator);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out List_Info;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "id" then
Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value));
elsif Name = "ident" then
Item.Ident := Util.Beans.Objects.To_Integer (Value);
elsif Name = "summary" then
Item.Summary := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "priority" then
Item.Priority := Util.Beans.Objects.To_Integer (Value);
elsif Name = "create_date" then
Item.Create_Date := Util.Beans.Objects.Time.To_Time (Value);
elsif Name = "update_date" then
Item.Update_Date := Util.Beans.Objects.Time.To_Time (Value);
elsif Name = "status" then
Item.Status := Jason.Tickets.Models.Status_Type_Objects.To_Value (Value);
elsif Name = "ticket_type" then
Item.Ticket_Type := Jason.Tickets.Models.Ticket_Type_Objects.To_Value (Value);
elsif Name = "duration" then
Item.Duration := Util.Beans.Objects.To_Integer (Value);
elsif Name = "progress" then
Item.Progress := Util.Beans.Objects.To_Integer (Value);
elsif Name = "creator" then
Item.Creator := Util.Beans.Objects.To_Unbounded_String (Value);
end if;
end Set_Value;
-- --------------------
-- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>.
-- --------------------
procedure List (Object : in out List_Info_List_Bean'Class;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class) is
begin
List (Object.List, Session, Context);
end List;
-- --------------------
-- The list of tickets.
-- --------------------
procedure List (Object : in out List_Info_Vector;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class) is
procedure Read (Into : in out List_Info);
Stmt : ADO.Statements.Query_Statement
:= Session.Create_Statement (Context);
Pos : Positive := 1;
procedure Read (Into : in out List_Info) is
begin
Into.Id := Stmt.Get_Identifier (0);
Into.Ident := Stmt.Get_Integer (1);
Into.Summary := Stmt.Get_Unbounded_String (2);
Into.Priority := Stmt.Get_Integer (3);
Into.Create_Date := Stmt.Get_Time (4);
Into.Update_Date := Stmt.Get_Time (5);
Into.Status := Jason.Tickets.Models.Status_Type'Val (Stmt.Get_Integer (6));
Into.Ticket_Type := Jason.Tickets.Models.Ticket_Type'Val (Stmt.Get_Integer (7));
Into.Duration := Stmt.Get_Integer (8);
Into.Progress := Stmt.Get_Integer (9);
Into.Creator := Stmt.Get_Unbounded_String (10);
end Read;
begin
Stmt.Execute;
List_Info_Vectors.Clear (Object);
while Stmt.Has_Elements loop
Object.Insert_Space (Before => Pos);
Object.Update_Element (Index => Pos, Process => Read'Access);
Pos := Pos + 1;
Stmt.Next;
end loop;
end List;
procedure Op_Load (Bean : in out Ticket_Info;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Load (Bean : in out Ticket_Info;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ticket_Info'Class (Bean).Load (Outcome);
end Op_Load;
package Binding_Ticket_Info_1 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Ticket_Info,
Method => Op_Load,
Name => "load");
Binding_Ticket_Info_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Binding_Ticket_Info_1.Proxy'Access
);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression.
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Ticket_Info)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Ticket_Info_Array'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Ticket_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id));
elsif Name = "ident" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Ident));
elsif Name = "summary" then
return Util.Beans.Objects.To_Object (From.Summary);
elsif Name = "description" then
return Util.Beans.Objects.To_Object (From.Description);
elsif Name = "priority" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Priority));
elsif Name = "create_date" then
return Util.Beans.Objects.Time.To_Object (From.Create_Date);
elsif Name = "update_date" then
return Util.Beans.Objects.Time.To_Object (From.Update_Date);
elsif Name = "status" then
return Jason.Tickets.Models.Status_Type_Objects.To_Object (From.Status);
elsif Name = "project_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Project_Id));
elsif Name = "project_name" then
return Util.Beans.Objects.To_Object (From.Project_Name);
elsif Name = "creator" then
return Util.Beans.Objects.To_Object (From.Creator);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Ticket_Info;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "id" then
Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value));
elsif Name = "ident" then
Item.Ident := Util.Beans.Objects.To_Integer (Value);
elsif Name = "summary" then
Item.Summary := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "description" then
Item.Description := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "priority" then
Item.Priority := Util.Beans.Objects.To_Integer (Value);
elsif Name = "create_date" then
Item.Create_Date := Util.Beans.Objects.Time.To_Time (Value);
elsif Name = "update_date" then
Item.Update_Date := Util.Beans.Objects.Time.To_Time (Value);
elsif Name = "status" then
Item.Status := Jason.Tickets.Models.Status_Type_Objects.To_Value (Value);
elsif Name = "project_id" then
Item.Project_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value));
elsif Name = "project_name" then
Item.Project_Name := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "creator" then
Item.Creator := Util.Beans.Objects.To_Unbounded_String (Value);
end if;
end Set_Value;
-- --------------------
-- Read in the object the data from the query result and prepare to read the next row.
-- If there is no row, raise the ADO.NOT_FOUND exception.
-- --------------------
procedure Read (Into : in out Ticket_Info;
Stmt : in out ADO.Statements.Query_Statement'Class) is
begin
if not Stmt.Has_Elements then
raise ADO.Objects.NOT_FOUND;
end if;
Into.Id := Stmt.Get_Identifier (0);
Into.Ident := Stmt.Get_Integer (1);
Into.Summary := Stmt.Get_Unbounded_String (2);
Into.Description := Stmt.Get_Unbounded_String (3);
Into.Priority := Stmt.Get_Integer (4);
Into.Create_Date := Stmt.Get_Time (5);
Into.Update_Date := Stmt.Get_Time (6);
Into.Status := Jason.Tickets.Models.Status_Type'Val (Stmt.Get_Integer (7));
Into.Project_Id := Stmt.Get_Identifier (8);
Into.Project_Name := Stmt.Get_Unbounded_String (9);
Into.Creator := Stmt.Get_Unbounded_String (10);
Stmt.Next;
end Read;
-- --------------------
-- Run the query controlled by <b>Context</b> and load the result in <b>Object</b>.
-- --------------------
procedure Load (Object : in out Ticket_Info'Class;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class) is
Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Context);
begin
Stmt.Execute;
Read (Object, Stmt);
if Stmt.Has_Elements then
raise ADO.Objects.NOT_FOUND;
end if;
end Load;
procedure Op_Load (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Load (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ticket_Bean'Class (Bean).Load (Outcome);
end Op_Load;
package Binding_Ticket_Bean_1 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Ticket_Bean,
Method => Op_Load,
Name => "load");
procedure Op_Create (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Create (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ticket_Bean'Class (Bean).Create (Outcome);
end Op_Create;
package Binding_Ticket_Bean_2 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Ticket_Bean,
Method => Op_Create,
Name => "create");
procedure Op_Save (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Save (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ticket_Bean'Class (Bean).Save (Outcome);
end Op_Save;
package Binding_Ticket_Bean_3 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Ticket_Bean,
Method => Op_Save,
Name => "save");
procedure Op_Save_Status (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Save_Status (Bean : in out Ticket_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ticket_Bean'Class (Bean).Save_Status (Outcome);
end Op_Save_Status;
package Binding_Ticket_Bean_4 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Ticket_Bean,
Method => Op_Save_Status,
Name => "save_status");
Binding_Ticket_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Binding_Ticket_Bean_1.Proxy'Access,
2 => Binding_Ticket_Bean_2.Proxy'Access,
3 => Binding_Ticket_Bean_3.Proxy'Access,
4 => Binding_Ticket_Bean_4.Proxy'Access
);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression.
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Ticket_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Ticket_Bean_Array'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Ticket_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "comment" then
return Util.Beans.Objects.To_Object (From.Comment);
end if;
return Jason.Tickets.Models.Ticket_Ref (From).Get_Value (Name);
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Ticket_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "comment" then
Item.Comment := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "summary" then
Item.Set_Summary (Util.Beans.Objects.To_String (Value));
elsif Name = "ident" then
Item.Set_Ident (Util.Beans.Objects.To_Integer (Value));
elsif Name = "create_date" then
Item.Set_Create_Date (Util.Beans.Objects.Time.To_Time (Value));
elsif Name = "priority" then
Item.Set_Priority (Util.Beans.Objects.To_Integer (Value));
elsif Name = "status" then
Item.Set_Status (Status_Type_Objects.To_Value (Value));
elsif Name = "description" then
Item.Set_Description (Util.Beans.Objects.To_String (Value));
elsif Name = "update_date" then
Item.Set_Update_Date (Util.Beans.Objects.Time.To_Time (Value));
elsif Name = "ticket_type" then
Item.Set_Ticket_Type (Ticket_Type_Objects.To_Value (Value));
elsif Name = "duration" then
Item.Set_Duration (Util.Beans.Objects.To_Integer (Value));
elsif Name = "progress" then
Item.Set_Progress (Util.Beans.Objects.To_Integer (Value));
end if;
end Set_Value;
procedure Op_Load (Bean : in out Ticket_List_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Load (Bean : in out Ticket_List_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ticket_List_Bean'Class (Bean).Load (Outcome);
end Op_Load;
package Binding_Ticket_List_Bean_1 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Ticket_List_Bean,
Method => Op_Load,
Name => "load");
Binding_Ticket_List_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Binding_Ticket_List_Bean_1.Proxy'Access
);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression.
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Ticket_List_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Ticket_List_Bean_Array'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Ticket_List_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "project_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Project_Id));
elsif Name = "page" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page));
elsif Name = "count" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Count));
elsif Name = "tag" then
return Util.Beans.Objects.To_Object (From.Tag);
elsif Name = "page_size" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page_Size));
elsif Name = "sort" then
return Util.Beans.Objects.To_Object (From.Sort);
elsif Name = "status" then
return Status_Type_Objects.To_Object (From.Status);
elsif Name = "priority" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Priority));
elsif Name = "ticket_kind" then
return Ticket_Type_Objects.To_Object (From.Ticket_Kind);
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Ticket_List_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "project_id" then
Item.Project_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value));
elsif Name = "page" then
Item.Page := Util.Beans.Objects.To_Integer (Value);
elsif Name = "count" then
Item.Count := Util.Beans.Objects.To_Integer (Value);
elsif Name = "tag" then
Item.Tag := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "page_size" then
Item.Page_Size := Util.Beans.Objects.To_Integer (Value);
elsif Name = "sort" then
Item.Sort := Util.Beans.Objects.To_Unbounded_String (Value);
elsif Name = "status" then
Item.Status := Status_Type_Objects.To_Value (Value);
elsif Name = "priority" then
Item.Priority := Util.Beans.Objects.To_Integer (Value);
elsif Name = "ticket_kind" then
Item.Ticket_Kind := Ticket_Type_Objects.To_Value (Value);
end if;
end Set_Value;
procedure Op_Load (Bean : in out Ticket_Info_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Load (Bean : in out Ticket_Info_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Ticket_Info_Bean'Class (Bean).Load (Outcome);
end Op_Load;
package Binding_Ticket_Info_Bean_1 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Ticket_Info_Bean,
Method => Op_Load,
Name => "load");
Binding_Ticket_Info_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Binding_Ticket_Info_Bean_1.Proxy'Access
);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression.
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Ticket_Info_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Ticket_Info_Bean_Array'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Ticket_Info_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "ticket_id" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Ticket_Id));
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Ticket_Info_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "ticket_id" then
Item.Ticket_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value));
end if;
end Set_Value;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Stat_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "kind" then
return Ticket_Type_Objects.To_Object (From.Kind);
elsif Name = "priority" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Priority));
elsif Name = "count" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Count));
elsif Name = "time" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Time));
elsif Name = "remain" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Remain));
elsif Name = "done" then
return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Done));
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Stat_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
if Name = "kind" then
Item.Kind := Ticket_Type_Objects.To_Value (Value);
elsif Name = "priority" then
Item.Priority := Util.Beans.Objects.To_Integer (Value);
elsif Name = "count" then
Item.Count := Util.Beans.Objects.To_Integer (Value);
elsif Name = "time" then
Item.Time := Util.Beans.Objects.To_Integer (Value);
elsif Name = "remain" then
Item.Remain := Util.Beans.Objects.To_Integer (Value);
elsif Name = "done" then
Item.Done := Util.Beans.Objects.To_Integer (Value);
end if;
end Set_Value;
procedure Op_Load (Bean : in out Report_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
procedure Op_Load (Bean : in out Report_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
begin
Report_Bean'Class (Bean).Load (Outcome);
end Op_Load;
package Binding_Report_Bean_1 is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Report_Bean,
Method => Op_Load,
Name => "load");
Binding_Report_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Binding_Report_Bean_1.Proxy'Access
);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression.
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Report_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Report_Bean_Array'Access;
end Get_Method_Bindings;
-- ------------------------------
-- Get the bean attribute identified by the name.
-- ------------------------------
overriding
function Get_Value (From : in Report_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Set the value identified by the name
-- ------------------------------
overriding
procedure Set_Value (Item : in out Report_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
null;
end Set_Value;
end Jason.Tickets.Models;
|
main/cockpit.asm | osgcc/descent-pc | 3 | 104298 | <filename>main/cockpit.asm
;THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
;SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
;END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
;ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
;IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
;SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
;FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
;CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
;AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
;COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
;
; $Source: f:/miner/source/main/rcs/cockpit.asm $
; $Revision: 2.0 $
; $Author: john $
; $Date: 1995/02/27 11:26:51 $
;
; Routine to copy the 3d view to the screen, leaving out
; parts that are in the cockpit.
;
; $Log: cockpit.asm $
; Revision 2.0 1995/02/27 11:26:51 john
; New version 2.0, which has no anonymous unions, builds with
; Watcom 10.0, and doesn't require parsing BITMAPS.TBL.
;
; Revision 1.2 1994/01/24 18:55:36 john
; initial version.
;
; Revision 1.1 1994/01/24 17:58:16 john
; Initial revision
;
;
.386
option oldstructs
.nolist
include types.inc
include psmacros.inc
.list
assume cs:_TEXT, ds:_DATA
_DATA segment dword public USE32 'DATA'
rcsid db "$Id: cockpit.asm 2.0 1995/02/27 11:26:51 john Exp $"
align 4
_DATA ends
_TEXT segment dword public USE32 'CODE'
PUBLIC cockpit_copy_
cockpit_copy_:
; eax = source ptr
; edx = dest ptr
push esi
push edi
push ecx
mov esi, eax
mov edi, edx
include cockpit.inc
pop ecx
pop edi
pop esi
ret
_TEXT ends
end
|
oeis/333/A333562.asm | neoneye/loda-programs | 11 | 5924 | ; A333562: a(n) = Sum_{j = 0..3*n} binomial(n+j-1,j)*2^j.
; Submitted by <NAME>
; 1,15,769,47103,3080193,208470015,14413725697,1011196362751,71695889072129,5124481173422079,368599603785760769,26648859989512290303,1934777421539431153665,140966705275001764839423,10301634747725237826093057,754776795329691207916847103
mov $3,$0
mov $5,$0
mul $5,3
lpb $5
sub $5,1
mov $0,$5
add $0,$3
mov $2,$3
sub $2,1
bin $0,$2
mul $4,2
add $4,$0
lpe
mov $0,$4
mul $0,2
add $0,1
|
data/baseStats_original/dunsparce.asm | adhi-thirumala/EvoYellow | 16 | 99504 | db DEX_DUNSPARCE ; pokedex id
db 100 ; base hp
db 70 ; base attack
db 70 ; base defense
db 45 ; base speed
db 65 ; base special
db NORMAL ; species type 1
db NORMAL ; species type 2
db 190 ; catch rate
db 75 ; base exp yield
INCBIN "pic/ymon/dunsparce.pic",0,1 ; 77, sprite dimensions
dw DunsparcePicFront
dw DunsparcePicBack
; attacks known at lvl 0
db RAGE
db 0
db 0
db 0
db 0 ; growth rate
; learnset
tmlearn 1,5,6,8
tmlearn 9,10,11,12,13,14,15,16
tmlearn 17,18,19,20,22,24
tmlearn 25,26,27,29,31,32
tmlearn 33,34,35,36,38,40
tmlearn 44,46,48
tmlearn 50,53,54
db Bank(DunsparcePicFront) ; padding
|
asm/reverseString.asm | GabrielRavier/Generic-Assembly-Samples | 0 | 9947 | global @ASM_reverseString@4
extern @ASM_strlen@4
%define ASM_strlen @ASM_strlen@4
segment .text align=16
%define string ecx
%define strlenRet eax
%define result eax
@ASM_reverseString@4:
push esi
push ebx
sub esp, 4
mov esi, string
test string, string
je .returnString
cmp byte [string], 0
jne .doReverse
.returnString:
mov result, esi
add esp, 4
pop ebx
pop esi
ret
.doReverse:
call ASM_strlen
lea eax, [strlenRet + esi - 1]
cmp esi, eax
jnb .returnString
mov edx, esi
.loop:
mov cl, byte [edx]
mov bl, byte [eax]
mov byte [edx], bl
mov byte [eax], cl
inc edx
dec eax
cmp edx, eax
jb .loop
mov result, esi
add esp, 4
pop ebx
pop esi
ret
|
Transynther/x86/_processed/NONE/_xt_/i3-7100_9_0x84_notsx.log_21829_336.asm | ljhsiun2/medusa | 9 | 241603 | .global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r14
push %r15
push %r9
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x13e3b, %r14
nop
nop
nop
nop
add %rcx, %rcx
mov (%r14), %r12w
nop
nop
xor $24737, %rcx
lea addresses_WC_ht+0x4d9, %r9
nop
cmp %rsi, %rsi
movl $0x61626364, (%r9)
nop
nop
nop
dec %r9
lea addresses_UC_ht+0x1ac4b, %rsi
lea addresses_normal_ht+0x141ab, %rdi
nop
dec %rdx
mov $56, %rcx
rep movsq
nop
nop
nop
nop
nop
xor %r14, %r14
lea addresses_WC_ht+0x93cb, %rdi
nop
nop
nop
nop
add $41928, %r9
mov (%rdi), %si
nop
nop
sub $35845, %rdi
lea addresses_D_ht+0x139ab, %rsi
lea addresses_A_ht+0x164cb, %rdi
nop
nop
nop
lfence
mov $39, %rcx
rep movsw
nop
nop
nop
nop
nop
and $15328, %rsi
lea addresses_A_ht+0x5fab, %r9
nop
xor %r15, %r15
movb (%r9), %r14b
nop
xor $2183, %r14
lea addresses_WC_ht+0xf7d3, %rsi
lea addresses_UC_ht+0xf3c1, %rdi
clflush (%rsi)
nop
nop
nop
nop
sub %r14, %r14
mov $44, %rcx
rep movsw
xor %r12, %r12
lea addresses_WC_ht+0x191ab, %rsi
lea addresses_D_ht+0x9ab, %rdi
nop
xor $1217, %r15
mov $92, %rcx
rep movsq
nop
nop
nop
nop
and %r12, %r12
pop %rsi
pop %rdx
pop %rdi
pop %rcx
pop %r9
pop %r15
pop %r14
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r14
push %r8
push %r9
push %rax
push %rcx
// Faulty Load
lea addresses_RW+0x189ab, %rcx
nop
and %r9, %r9
vmovups (%rcx), %ymm2
vextracti128 $0, %ymm2, %xmm2
vpextrq $1, %xmm2, %r8
lea oracles, %rax
and $0xff, %r8
shlq $12, %r8
mov (%rax,%r8,1), %r8
pop %rcx
pop %rax
pop %r9
pop %r8
pop %r14
ret
/*
<gen_faulty_load>
[REF]
{'src': {'type': 'addresses_RW', 'same': False, 'size': 4, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
[Faulty Load]
{'src': {'type': 'addresses_RW', 'same': True, 'size': 32, 'congruent': 0, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'type': 'addresses_WC_ht', 'same': False, 'size': 2, 'congruent': 4, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'dst': {'type': 'addresses_WC_ht', 'same': False, 'size': 4, 'congruent': 1, 'NT': False, 'AVXalign': False}, 'OP': 'STOR'}
{'src': {'type': 'addresses_UC_ht', 'congruent': 2, 'same': False}, 'dst': {'type': 'addresses_normal_ht', 'congruent': 11, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_WC_ht', 'same': True, 'size': 2, 'congruent': 5, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_D_ht', 'congruent': 10, 'same': True}, 'dst': {'type': 'addresses_A_ht', 'congruent': 0, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_A_ht', 'same': False, 'size': 1, 'congruent': 9, 'NT': False, 'AVXalign': False}, 'OP': 'LOAD'}
{'src': {'type': 'addresses_WC_ht', 'congruent': 2, 'same': False}, 'dst': {'type': 'addresses_UC_ht', 'congruent': 1, 'same': False}, 'OP': 'REPM'}
{'src': {'type': 'addresses_WC_ht', 'congruent': 11, 'same': False}, 'dst': {'type': 'addresses_D_ht', 'congruent': 11, 'same': False}, 'OP': 'REPM'}
{'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
*/
|
tests/expr_asm_value/11.asm | NullMember/customasm | 414 | 170629 | <reponame>NullMember/customasm<filename>tests/expr_asm_value/11.asm
; inner error
#ruledef
{
emit {x} => x / 0
test {x} => asm { emit x }
}
test 12 ; error: failed / error:_:4: zero |
boards/Unleashed/src/unleashed-leds.adb | rocher/Ada_Drivers_Library | 192 | 21850 | <reponame>rocher/Ada_Drivers_Library
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2019, 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. --
-- --
------------------------------------------------------------------------------
with SiFive.Device; use SiFive.Device;
with SiFive.PWM; use SiFive.PWM;
package body Unleashed.LEDs is
PWM : PWM_Device renames PWM0;
PWM_Scale : constant := 2;
PWM_Period : constant := Compare_Value'Last;
------------
-- Enable --
------------
procedure Enable is
begin
Enable_Continous (PWM);
end Enable;
-------------
-- Disable --
-------------
procedure Disable is
begin
Disable (PWM);
end Disable;
--------------------
-- Set_Brightness --
--------------------
procedure Set_Brightness (Id : LED_Id; Brightness : LED_Brightness) is
begin
Set_Compare (PWM, Comparator_ID (Id),
Compare_Value (Float (PWM_Period) * Float (Brightness)));
end Set_Brightness;
begin
Configure (This => PWM,
Scale => PWM_Scale,
Sticky => False,
Reset_To_Zero => False,
Deglitch => True);
for Id in LED_Id loop
Set_Brightness (Id, LED_Brightness'Last);
end loop;
Set_Count (PWM, 0);
end Unleashed.LEDs;
|
antlr/ConfigReferenceParser.g4 | bechtleav360/Maverick.ConfigService | 0 | 526 | parser grammar ConfigReferenceParser;
options {
tokenVocab = ConfigReferenceLexer;
}
input : (fluff | reference)* EOF;
fluff : (FLUFF | SINGLE_BRACES)+;
reference : REF_OPEN reference_internals+ REF_CLOSE;
reference_internals:
(REF_CMND_NAME REF_CMND_VAL REF_CMND_SEP reference) # FullRecursive
| (REF_CMND_NAME REF_CMND_VAL REF_CMND_SEP?) # FullReference
| (REF_CMND_VAL REF_CMND_SEP reference) # ValueRecursive
| (REF_CMND_VAL REF_CMND_SEP?) # ValueReference
| (REF_CMND_NAME REF_CMND_SEP reference) # CommandRecursive
| (REF_CMND_NAME REF_CMND_SEP?) # CommandReference;
|
org.alloytools.alloy.diff/misc/quantification/q1.als | jringert/alloy-diff | 1 | 4212 | sig A {
next : one A
}
run {some x1, x2 : A | x1.next = x2 }
|
Amazon.KinesisTap.Expression/ObjectDecoration/ObjectDecorationParser.g4 | daryl-mcmillan/kinesis-agent-windows | 35 | 3699 | parser grammar ObjectDecorationParser;
options { tokenVocab=ObjectDecorationLexer; }
objectDecoration
: keyValuePair (';' keyValuePair)*
;
keyValuePair
: key '=' value
;
key
: TEXT
;
value
: (variable | TEXT)*
;
variable
: '{' expression '}'
;
expression
: identifierExpression
| constantExpression
| invocationExpression
;
constantExpression
: STRING
| NUMBER
| 'true'
| 'false'
| 'null'
;
identifierExpression
: IDENTIFIER
| QUOTED_IDENTIFIER
;
invocationExpression
: IDENTIFIER '(' arguments? ')'
;
arguments
: expression (COMMA expression)*
;
|
source/web/tools/wsdl2ada/wsdl-visitors.ads | svn2github/matreshka | 24 | 18149 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, <NAME> <<EMAIL>> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with WSDL.AST.Endpoints;
with WSDL.AST.Services;
with WSDL.AST.Types;
with WSDL.Iterators;
package WSDL.Visitors is
pragma Preelaborate;
type WSDL_Visitor is limited interface;
not overriding procedure Enter_Binding
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Binding_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Binding
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Binding_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Binding_Fault
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Binding_Fault_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Binding_Fault
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Binding_Fault_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Binding_Operation
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Binding_Operation_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Binding_Operation
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Binding_Operation_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Description
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Description_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Description
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Description_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Endpoint
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Endpoints.Endpoint_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Endpoint
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Endpoints.Endpoint_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Interface
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Interface
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Interface_Fault
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Fault_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Interface_Fault
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Fault_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Interface_Fault_Reference
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Fault_Reference_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Interface_Fault_Reference
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Fault_Reference_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Interface_Message
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Message_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Interface_Message
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Message_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Interface_Operation
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Operation_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Interface_Operation
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Interface_Operation_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Service
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Services.Service_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Service
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Services.Service_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Enter_Types
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Types.Types_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
not overriding procedure Leave_Types
(Self : in out WSDL_Visitor;
Node : not null WSDL.AST.Types.Types_Access;
Control : in out WSDL.Iterators.Traverse_Control) is null;
end WSDL.Visitors;
|
tools/parser/css-analysis-parser-lexer.ads | stcarrez/ada-css | 3 | 5340 | <filename>tools/parser/css-analysis-parser-lexer.ads
-- Warning: This lexical scanner is automatically generated by AFLEX.
-- It is useless to modify it. Change the ".Y" & ".L" files instead.
with CSS.Analysis.Parser.Parser_Tokens;
package CSS.Analysis.Parser.Lexer is
use CSS.Analysis.Parser.Parser_Tokens;
function YYLex return Token;
end CSS.Analysis.Parser.Lexer;
|
wc.asm | siddu1995/testing | 0 | 87934 |
_wc: file format elf32-i386
Disassembly of section .text:
00000000 <main>:
printf(1, "%d %d %d %s\n", l, w, c, name);
}
int
main(int argc, char *argv[])
{
0: 55 push %ebp
1: 89 e5 mov %esp,%ebp
3: 57 push %edi
4: 56 push %esi
int fd, i;
if(argc <= 1){
5: be 01 00 00 00 mov $0x1,%esi
printf(1, "%d %d %d %s\n", l, w, c, name);
}
int
main(int argc, char *argv[])
{
a: 53 push %ebx
b: 83 e4 f0 and $0xfffffff0,%esp
e: 83 ec 10 sub $0x10,%esp
11: 8b 45 0c mov 0xc(%ebp),%eax
int fd, i;
if(argc <= 1){
14: 83 7d 08 01 cmpl $0x1,0x8(%ebp)
18: 8d 58 04 lea 0x4(%eax),%ebx
1b: 7e 60 jle 7d <main+0x7d>
1d: 8d 76 00 lea 0x0(%esi),%esi
wc(0, "");
exit();
}
for(i = 1; i < argc; i++){
if((fd = open(argv[i], 0)) < 0){
20: c7 44 24 04 00 00 00 movl $0x0,0x4(%esp)
27: 00
28: 8b 03 mov (%ebx),%eax
2a: 89 04 24 mov %eax,(%esp)
2d: e8 c0 03 00 00 call 3f2 <open>
32: 85 c0 test %eax,%eax
34: 89 c7 mov %eax,%edi
36: 78 26 js 5e <main+0x5e>
printf(1, "wc: cannot open %s\n", argv[i]);
exit();
}
wc(fd, argv[i]);
38: 8b 13 mov (%ebx),%edx
if(argc <= 1){
wc(0, "");
exit();
}
for(i = 1; i < argc; i++){
3a: 83 c6 01 add $0x1,%esi
3d: 83 c3 04 add $0x4,%ebx
if((fd = open(argv[i], 0)) < 0){
printf(1, "wc: cannot open %s\n", argv[i]);
exit();
}
wc(fd, argv[i]);
40: 89 04 24 mov %eax,(%esp)
43: 89 54 24 04 mov %edx,0x4(%esp)
47: e8 54 00 00 00 call a0 <wc>
close(fd);
4c: 89 3c 24 mov %edi,(%esp)
4f: e8 86 03 00 00 call 3da <close>
if(argc <= 1){
wc(0, "");
exit();
}
for(i = 1; i < argc; i++){
54: 3b 75 08 cmp 0x8(%ebp),%esi
57: 75 c7 jne 20 <main+0x20>
exit();
}
wc(fd, argv[i]);
close(fd);
}
exit();
59: e8 54 03 00 00 call 3b2 <exit>
exit();
}
for(i = 1; i < argc; i++){
if((fd = open(argv[i], 0)) < 0){
printf(1, "wc: cannot open %s\n", argv[i]);
5e: 8b 03 mov (%ebx),%eax
60: c7 44 24 04 89 08 00 movl $0x889,0x4(%esp)
67: 00
68: c7 04 24 01 00 00 00 movl $0x1,(%esp)
6f: 89 44 24 08 mov %eax,0x8(%esp)
73: e8 88 04 00 00 call 500 <printf>
exit();
78: e8 35 03 00 00 call 3b2 <exit>
main(int argc, char *argv[])
{
int fd, i;
if(argc <= 1){
wc(0, "");
7d: c7 44 24 04 7b 08 00 movl $0x87b,0x4(%esp)
84: 00
85: c7 04 24 00 00 00 00 movl $0x0,(%esp)
8c: e8 0f 00 00 00 call a0 <wc>
exit();
91: e8 1c 03 00 00 call 3b2 <exit>
96: 66 90 xchg %ax,%ax
98: 66 90 xchg %ax,%ax
9a: 66 90 xchg %ax,%ax
9c: 66 90 xchg %ax,%ax
9e: 66 90 xchg %ax,%ax
000000a0 <wc>:
char buf[512];
void
wc(int fd, char *name)
{
a0: 55 push %ebp
a1: 89 e5 mov %esp,%ebp
a3: 57 push %edi
a4: 56 push %esi
int i, n;
int l, w, c, inword;
l = w = c = 0;
inword = 0;
a5: 31 f6 xor %esi,%esi
char buf[512];
void
wc(int fd, char *name)
{
a7: 53 push %ebx
int i, n;
int l, w, c, inword;
l = w = c = 0;
a8: 31 db xor %ebx,%ebx
char buf[512];
void
wc(int fd, char *name)
{
aa: 83 ec 3c sub $0x3c,%esp
int i, n;
int l, w, c, inword;
l = w = c = 0;
ad: c7 45 dc 00 00 00 00 movl $0x0,-0x24(%ebp)
b4: c7 45 e0 00 00 00 00 movl $0x0,-0x20(%ebp)
bb: 90 nop
bc: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
inword = 0;
while((n = read(fd, buf, sizeof(buf))) > 0){
c0: 8b 45 08 mov 0x8(%ebp),%eax
c3: c7 44 24 08 00 02 00 movl $0x200,0x8(%esp)
ca: 00
cb: c7 44 24 04 80 0b 00 movl $0xb80,0x4(%esp)
d2: 00
d3: 89 04 24 mov %eax,(%esp)
d6: e8 ef 02 00 00 call 3ca <read>
db: 83 f8 00 cmp $0x0,%eax
de: 89 45 e4 mov %eax,-0x1c(%ebp)
e1: 7e 54 jle 137 <wc+0x97>
e3: 31 ff xor %edi,%edi
e5: eb 0b jmp f2 <wc+0x52>
e7: 90 nop
for(i=0; i<n; i++){
c++;
if(buf[i] == '\n')
l++;
if(strchr(" \r\t\n\v", buf[i]))
inword = 0;
e8: 31 f6 xor %esi,%esi
int l, w, c, inword;
l = w = c = 0;
inword = 0;
while((n = read(fd, buf, sizeof(buf))) > 0){
for(i=0; i<n; i++){
ea: 83 c7 01 add $0x1,%edi
ed: 3b 7d e4 cmp -0x1c(%ebp),%edi
f0: 74 38 je 12a <wc+0x8a>
c++;
if(buf[i] == '\n')
f2: 0f be 87 80 0b 00 00 movsbl 0xb80(%edi),%eax
l++;
f9: 31 c9 xor %ecx,%ecx
if(strchr(" \r\t\n\v", buf[i]))
fb: c7 04 24 66 08 00 00 movl $0x866,(%esp)
inword = 0;
while((n = read(fd, buf, sizeof(buf))) > 0){
for(i=0; i<n; i++){
c++;
if(buf[i] == '\n')
l++;
102: 3c 0a cmp $0xa,%al
104: 0f 94 c1 sete %cl
if(strchr(" \r\t\n\v", buf[i]))
107: 89 44 24 04 mov %eax,0x4(%esp)
inword = 0;
while((n = read(fd, buf, sizeof(buf))) > 0){
for(i=0; i<n; i++){
c++;
if(buf[i] == '\n')
l++;
10b: 01 cb add %ecx,%ebx
if(strchr(" \r\t\n\v", buf[i]))
10d: e8 4e 01 00 00 call 260 <strchr>
112: 85 c0 test %eax,%eax
114: 75 d2 jne e8 <wc+0x48>
inword = 0;
else if(!inword){
116: 85 f6 test %esi,%esi
118: 75 16 jne 130 <wc+0x90>
w++;
11a: 83 45 e0 01 addl $0x1,-0x20(%ebp)
int l, w, c, inword;
l = w = c = 0;
inword = 0;
while((n = read(fd, buf, sizeof(buf))) > 0){
for(i=0; i<n; i++){
11e: 83 c7 01 add $0x1,%edi
121: 3b 7d e4 cmp -0x1c(%ebp),%edi
l++;
if(strchr(" \r\t\n\v", buf[i]))
inword = 0;
else if(!inword){
w++;
inword = 1;
124: 66 be 01 00 mov $0x1,%si
int l, w, c, inword;
l = w = c = 0;
inword = 0;
while((n = read(fd, buf, sizeof(buf))) > 0){
for(i=0; i<n; i++){
128: 75 c8 jne f2 <wc+0x52>
12a: 01 7d dc add %edi,-0x24(%ebp)
12d: eb 91 jmp c0 <wc+0x20>
12f: 90 nop
130: be 01 00 00 00 mov $0x1,%esi
135: eb b3 jmp ea <wc+0x4a>
w++;
inword = 1;
}
}
}
if(n < 0){
137: 75 35 jne 16e <wc+0xce>
printf(1, "wc: read error\n");
exit();
}
printf(1, "%d %d %d %s\n", l, w, c, name);
139: 8b 45 0c mov 0xc(%ebp),%eax
13c: 89 5c 24 08 mov %ebx,0x8(%esp)
140: c7 44 24 04 7c 08 00 movl $0x87c,0x4(%esp)
147: 00
148: c7 04 24 01 00 00 00 movl $0x1,(%esp)
14f: 89 44 24 14 mov %eax,0x14(%esp)
153: 8b 45 dc mov -0x24(%ebp),%eax
156: 89 44 24 10 mov %eax,0x10(%esp)
15a: 8b 45 e0 mov -0x20(%ebp),%eax
15d: 89 44 24 0c mov %eax,0xc(%esp)
161: e8 9a 03 00 00 call 500 <printf>
}
166: 83 c4 3c add $0x3c,%esp
169: 5b pop %ebx
16a: 5e pop %esi
16b: 5f pop %edi
16c: 5d pop %ebp
16d: c3 ret
inword = 1;
}
}
}
if(n < 0){
printf(1, "wc: read error\n");
16e: c7 44 24 04 6c 08 00 movl $0x86c,0x4(%esp)
175: 00
176: c7 04 24 01 00 00 00 movl $0x1,(%esp)
17d: e8 7e 03 00 00 call 500 <printf>
exit();
182: e8 2b 02 00 00 call 3b2 <exit>
187: 66 90 xchg %ax,%ax
189: 66 90 xchg %ax,%ax
18b: 66 90 xchg %ax,%ax
18d: 66 90 xchg %ax,%ax
18f: 90 nop
00000190 <strcpy>:
#include "user.h"
#include "x86.h"
char*
strcpy(char *s, char *t)
{
190: 55 push %ebp
191: 89 e5 mov %esp,%ebp
193: 8b 45 08 mov 0x8(%ebp),%eax
196: 8b 4d 0c mov 0xc(%ebp),%ecx
199: 53 push %ebx
char *os;
os = s;
while((*s++ = *t++) != 0)
19a: 89 c2 mov %eax,%edx
19c: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
1a0: 83 c1 01 add $0x1,%ecx
1a3: 0f b6 59 ff movzbl -0x1(%ecx),%ebx
1a7: 83 c2 01 add $0x1,%edx
1aa: 84 db test %bl,%bl
1ac: 88 5a ff mov %bl,-0x1(%edx)
1af: 75 ef jne 1a0 <strcpy+0x10>
;
return os;
}
1b1: 5b pop %ebx
1b2: 5d pop %ebp
1b3: c3 ret
1b4: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
1ba: 8d bf 00 00 00 00 lea 0x0(%edi),%edi
000001c0 <strcmp>:
int
strcmp(const char *p, const char *q)
{
1c0: 55 push %ebp
1c1: 89 e5 mov %esp,%ebp
1c3: 8b 55 08 mov 0x8(%ebp),%edx
1c6: 53 push %ebx
1c7: 8b 4d 0c mov 0xc(%ebp),%ecx
while(*p && *p == *q)
1ca: 0f b6 02 movzbl (%edx),%eax
1cd: 84 c0 test %al,%al
1cf: 74 2d je 1fe <strcmp+0x3e>
1d1: 0f b6 19 movzbl (%ecx),%ebx
1d4: 38 d8 cmp %bl,%al
1d6: 74 0e je 1e6 <strcmp+0x26>
1d8: eb 2b jmp 205 <strcmp+0x45>
1da: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
1e0: 38 c8 cmp %cl,%al
1e2: 75 15 jne 1f9 <strcmp+0x39>
p++, q++;
1e4: 89 d9 mov %ebx,%ecx
1e6: 83 c2 01 add $0x1,%edx
}
int
strcmp(const char *p, const char *q)
{
while(*p && *p == *q)
1e9: 0f b6 02 movzbl (%edx),%eax
p++, q++;
1ec: 8d 59 01 lea 0x1(%ecx),%ebx
}
int
strcmp(const char *p, const char *q)
{
while(*p && *p == *q)
1ef: 0f b6 49 01 movzbl 0x1(%ecx),%ecx
1f3: 84 c0 test %al,%al
1f5: 75 e9 jne 1e0 <strcmp+0x20>
1f7: 31 c0 xor %eax,%eax
p++, q++;
return (uchar)*p - (uchar)*q;
1f9: 29 c8 sub %ecx,%eax
}
1fb: 5b pop %ebx
1fc: 5d pop %ebp
1fd: c3 ret
1fe: 0f b6 09 movzbl (%ecx),%ecx
}
int
strcmp(const char *p, const char *q)
{
while(*p && *p == *q)
201: 31 c0 xor %eax,%eax
203: eb f4 jmp 1f9 <strcmp+0x39>
205: 0f b6 cb movzbl %bl,%ecx
208: eb ef jmp 1f9 <strcmp+0x39>
20a: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
00000210 <strlen>:
return (uchar)*p - (uchar)*q;
}
uint
strlen(char *s)
{
210: 55 push %ebp
211: 89 e5 mov %esp,%ebp
213: 8b 4d 08 mov 0x8(%ebp),%ecx
int n;
for(n = 0; s[n]; n++)
216: 80 39 00 cmpb $0x0,(%ecx)
219: 74 12 je 22d <strlen+0x1d>
21b: 31 d2 xor %edx,%edx
21d: 8d 76 00 lea 0x0(%esi),%esi
220: 83 c2 01 add $0x1,%edx
223: 80 3c 11 00 cmpb $0x0,(%ecx,%edx,1)
227: 89 d0 mov %edx,%eax
229: 75 f5 jne 220 <strlen+0x10>
;
return n;
}
22b: 5d pop %ebp
22c: c3 ret
uint
strlen(char *s)
{
int n;
for(n = 0; s[n]; n++)
22d: 31 c0 xor %eax,%eax
;
return n;
}
22f: 5d pop %ebp
230: c3 ret
231: eb 0d jmp 240 <memset>
233: 90 nop
234: 90 nop
235: 90 nop
236: 90 nop
237: 90 nop
238: 90 nop
239: 90 nop
23a: 90 nop
23b: 90 nop
23c: 90 nop
23d: 90 nop
23e: 90 nop
23f: 90 nop
00000240 <memset>:
void*
memset(void *dst, int c, uint n)
{
240: 55 push %ebp
241: 89 e5 mov %esp,%ebp
243: 8b 55 08 mov 0x8(%ebp),%edx
246: 57 push %edi
}
static inline void
stosb(void *addr, int data, int cnt)
{
asm volatile("cld; rep stosb" :
247: 8b 4d 10 mov 0x10(%ebp),%ecx
24a: 8b 45 0c mov 0xc(%ebp),%eax
24d: 89 d7 mov %edx,%edi
24f: fc cld
250: f3 aa rep stos %al,%es:(%edi)
stosb(dst, c, n);
return dst;
}
252: 89 d0 mov %edx,%eax
254: 5f pop %edi
255: 5d pop %ebp
256: c3 ret
257: 89 f6 mov %esi,%esi
259: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
00000260 <strchr>:
char*
strchr(const char *s, char c)
{
260: 55 push %ebp
261: 89 e5 mov %esp,%ebp
263: 8b 45 08 mov 0x8(%ebp),%eax
266: 53 push %ebx
267: 8b 55 0c mov 0xc(%ebp),%edx
for(; *s; s++)
26a: 0f b6 18 movzbl (%eax),%ebx
26d: 84 db test %bl,%bl
26f: 74 1d je 28e <strchr+0x2e>
if(*s == c)
271: 38 d3 cmp %dl,%bl
273: 89 d1 mov %edx,%ecx
275: 75 0d jne 284 <strchr+0x24>
277: eb 17 jmp 290 <strchr+0x30>
279: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
280: 38 ca cmp %cl,%dl
282: 74 0c je 290 <strchr+0x30>
}
char*
strchr(const char *s, char c)
{
for(; *s; s++)
284: 83 c0 01 add $0x1,%eax
287: 0f b6 10 movzbl (%eax),%edx
28a: 84 d2 test %dl,%dl
28c: 75 f2 jne 280 <strchr+0x20>
if(*s == c)
return (char*)s;
return 0;
28e: 31 c0 xor %eax,%eax
}
290: 5b pop %ebx
291: 5d pop %ebp
292: c3 ret
293: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
299: 8d bc 27 00 00 00 00 lea 0x0(%edi,%eiz,1),%edi
000002a0 <gets>:
char*
gets(char *buf, int max)
{
2a0: 55 push %ebp
2a1: 89 e5 mov %esp,%ebp
2a3: 57 push %edi
2a4: 56 push %esi
int i, cc;
char c;
for(i=0; i+1 < max; ){
2a5: 31 f6 xor %esi,%esi
return 0;
}
char*
gets(char *buf, int max)
{
2a7: 53 push %ebx
2a8: 83 ec 2c sub $0x2c,%esp
int i, cc;
char c;
for(i=0; i+1 < max; ){
cc = read(0, &c, 1);
2ab: 8d 7d e7 lea -0x19(%ebp),%edi
gets(char *buf, int max)
{
int i, cc;
char c;
for(i=0; i+1 < max; ){
2ae: eb 31 jmp 2e1 <gets+0x41>
cc = read(0, &c, 1);
2b0: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
2b7: 00
2b8: 89 7c 24 04 mov %edi,0x4(%esp)
2bc: c7 04 24 00 00 00 00 movl $0x0,(%esp)
2c3: e8 02 01 00 00 call 3ca <read>
if(cc < 1)
2c8: 85 c0 test %eax,%eax
2ca: 7e 1d jle 2e9 <gets+0x49>
break;
buf[i++] = c;
2cc: 0f b6 45 e7 movzbl -0x19(%ebp),%eax
gets(char *buf, int max)
{
int i, cc;
char c;
for(i=0; i+1 < max; ){
2d0: 89 de mov %ebx,%esi
cc = read(0, &c, 1);
if(cc < 1)
break;
buf[i++] = c;
2d2: 8b 55 08 mov 0x8(%ebp),%edx
if(c == '\n' || c == '\r')
2d5: 3c 0d cmp $0xd,%al
for(i=0; i+1 < max; ){
cc = read(0, &c, 1);
if(cc < 1)
break;
buf[i++] = c;
2d7: 88 44 1a ff mov %al,-0x1(%edx,%ebx,1)
if(c == '\n' || c == '\r')
2db: 74 0c je 2e9 <gets+0x49>
2dd: 3c 0a cmp $0xa,%al
2df: 74 08 je 2e9 <gets+0x49>
gets(char *buf, int max)
{
int i, cc;
char c;
for(i=0; i+1 < max; ){
2e1: 8d 5e 01 lea 0x1(%esi),%ebx
2e4: 3b 5d 0c cmp 0xc(%ebp),%ebx
2e7: 7c c7 jl 2b0 <gets+0x10>
break;
buf[i++] = c;
if(c == '\n' || c == '\r')
break;
}
buf[i] = '\0';
2e9: 8b 45 08 mov 0x8(%ebp),%eax
2ec: c6 04 30 00 movb $0x0,(%eax,%esi,1)
return buf;
}
2f0: 83 c4 2c add $0x2c,%esp
2f3: 5b pop %ebx
2f4: 5e pop %esi
2f5: 5f pop %edi
2f6: 5d pop %ebp
2f7: c3 ret
2f8: 90 nop
2f9: 8d b4 26 00 00 00 00 lea 0x0(%esi,%eiz,1),%esi
00000300 <stat>:
int
stat(char *n, struct stat *st)
{
300: 55 push %ebp
301: 89 e5 mov %esp,%ebp
303: 56 push %esi
304: 53 push %ebx
305: 83 ec 10 sub $0x10,%esp
int fd;
int r;
fd = open(n, O_RDONLY);
308: 8b 45 08 mov 0x8(%ebp),%eax
30b: c7 44 24 04 00 00 00 movl $0x0,0x4(%esp)
312: 00
313: 89 04 24 mov %eax,(%esp)
316: e8 d7 00 00 00 call 3f2 <open>
if(fd < 0)
31b: 85 c0 test %eax,%eax
stat(char *n, struct stat *st)
{
int fd;
int r;
fd = open(n, O_RDONLY);
31d: 89 c3 mov %eax,%ebx
if(fd < 0)
31f: 78 27 js 348 <stat+0x48>
return -1;
r = fstat(fd, st);
321: 8b 45 0c mov 0xc(%ebp),%eax
324: 89 1c 24 mov %ebx,(%esp)
327: 89 44 24 04 mov %eax,0x4(%esp)
32b: e8 da 00 00 00 call 40a <fstat>
close(fd);
330: 89 1c 24 mov %ebx,(%esp)
int r;
fd = open(n, O_RDONLY);
if(fd < 0)
return -1;
r = fstat(fd, st);
333: 89 c6 mov %eax,%esi
close(fd);
335: e8 a0 00 00 00 call 3da <close>
return r;
33a: 89 f0 mov %esi,%eax
}
33c: 83 c4 10 add $0x10,%esp
33f: 5b pop %ebx
340: 5e pop %esi
341: 5d pop %ebp
342: c3 ret
343: 90 nop
344: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
int fd;
int r;
fd = open(n, O_RDONLY);
if(fd < 0)
return -1;
348: b8 ff ff ff ff mov $0xffffffff,%eax
34d: eb ed jmp 33c <stat+0x3c>
34f: 90 nop
00000350 <atoi>:
return r;
}
int
atoi(const char *s)
{
350: 55 push %ebp
351: 89 e5 mov %esp,%ebp
353: 8b 4d 08 mov 0x8(%ebp),%ecx
356: 53 push %ebx
int n;
n = 0;
while('0' <= *s && *s <= '9')
357: 0f be 11 movsbl (%ecx),%edx
35a: 8d 42 d0 lea -0x30(%edx),%eax
35d: 3c 09 cmp $0x9,%al
int
atoi(const char *s)
{
int n;
n = 0;
35f: b8 00 00 00 00 mov $0x0,%eax
while('0' <= *s && *s <= '9')
364: 77 17 ja 37d <atoi+0x2d>
366: 66 90 xchg %ax,%ax
n = n*10 + *s++ - '0';
368: 83 c1 01 add $0x1,%ecx
36b: 8d 04 80 lea (%eax,%eax,4),%eax
36e: 8d 44 42 d0 lea -0x30(%edx,%eax,2),%eax
atoi(const char *s)
{
int n;
n = 0;
while('0' <= *s && *s <= '9')
372: 0f be 11 movsbl (%ecx),%edx
375: 8d 5a d0 lea -0x30(%edx),%ebx
378: 80 fb 09 cmp $0x9,%bl
37b: 76 eb jbe 368 <atoi+0x18>
n = n*10 + *s++ - '0';
return n;
}
37d: 5b pop %ebx
37e: 5d pop %ebp
37f: c3 ret
00000380 <memmove>:
void*
memmove(void *vdst, void *vsrc, int n)
{
380: 55 push %ebp
char *dst, *src;
dst = vdst;
src = vsrc;
while(n-- > 0)
381: 31 d2 xor %edx,%edx
return n;
}
void*
memmove(void *vdst, void *vsrc, int n)
{
383: 89 e5 mov %esp,%ebp
385: 56 push %esi
386: 8b 45 08 mov 0x8(%ebp),%eax
389: 53 push %ebx
38a: 8b 5d 10 mov 0x10(%ebp),%ebx
38d: 8b 75 0c mov 0xc(%ebp),%esi
char *dst, *src;
dst = vdst;
src = vsrc;
while(n-- > 0)
390: 85 db test %ebx,%ebx
392: 7e 12 jle 3a6 <memmove+0x26>
394: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
*dst++ = *src++;
398: 0f b6 0c 16 movzbl (%esi,%edx,1),%ecx
39c: 88 0c 10 mov %cl,(%eax,%edx,1)
39f: 83 c2 01 add $0x1,%edx
{
char *dst, *src;
dst = vdst;
src = vsrc;
while(n-- > 0)
3a2: 39 da cmp %ebx,%edx
3a4: 75 f2 jne 398 <memmove+0x18>
*dst++ = *src++;
return vdst;
}
3a6: 5b pop %ebx
3a7: 5e pop %esi
3a8: 5d pop %ebp
3a9: c3 ret
000003aa <fork>:
name: \
movl $SYS_ ## name, %eax; \
int $T_SYSCALL; \
ret
SYSCALL(fork)
3aa: b8 01 00 00 00 mov $0x1,%eax
3af: cd 40 int $0x40
3b1: c3 ret
000003b2 <exit>:
SYSCALL(exit)
3b2: b8 02 00 00 00 mov $0x2,%eax
3b7: cd 40 int $0x40
3b9: c3 ret
000003ba <wait>:
SYSCALL(wait)
3ba: b8 03 00 00 00 mov $0x3,%eax
3bf: cd 40 int $0x40
3c1: c3 ret
000003c2 <pipe>:
SYSCALL(pipe)
3c2: b8 04 00 00 00 mov $0x4,%eax
3c7: cd 40 int $0x40
3c9: c3 ret
000003ca <read>:
SYSCALL(read)
3ca: b8 05 00 00 00 mov $0x5,%eax
3cf: cd 40 int $0x40
3d1: c3 ret
000003d2 <write>:
SYSCALL(write)
3d2: b8 10 00 00 00 mov $0x10,%eax
3d7: cd 40 int $0x40
3d9: c3 ret
000003da <close>:
SYSCALL(close)
3da: b8 15 00 00 00 mov $0x15,%eax
3df: cd 40 int $0x40
3e1: c3 ret
000003e2 <kill>:
SYSCALL(kill)
3e2: b8 06 00 00 00 mov $0x6,%eax
3e7: cd 40 int $0x40
3e9: c3 ret
000003ea <exec>:
SYSCALL(exec)
3ea: b8 07 00 00 00 mov $0x7,%eax
3ef: cd 40 int $0x40
3f1: c3 ret
000003f2 <open>:
SYSCALL(open)
3f2: b8 0f 00 00 00 mov $0xf,%eax
3f7: cd 40 int $0x40
3f9: c3 ret
000003fa <mknod>:
SYSCALL(mknod)
3fa: b8 11 00 00 00 mov $0x11,%eax
3ff: cd 40 int $0x40
401: c3 ret
00000402 <unlink>:
SYSCALL(unlink)
402: b8 12 00 00 00 mov $0x12,%eax
407: cd 40 int $0x40
409: c3 ret
0000040a <fstat>:
SYSCALL(fstat)
40a: b8 08 00 00 00 mov $0x8,%eax
40f: cd 40 int $0x40
411: c3 ret
00000412 <link>:
SYSCALL(link)
412: b8 13 00 00 00 mov $0x13,%eax
417: cd 40 int $0x40
419: c3 ret
0000041a <mkdir>:
SYSCALL(mkdir)
41a: b8 14 00 00 00 mov $0x14,%eax
41f: cd 40 int $0x40
421: c3 ret
00000422 <chdir>:
SYSCALL(chdir)
422: b8 09 00 00 00 mov $0x9,%eax
427: cd 40 int $0x40
429: c3 ret
0000042a <dup>:
SYSCALL(dup)
42a: b8 0a 00 00 00 mov $0xa,%eax
42f: cd 40 int $0x40
431: c3 ret
00000432 <getpid>:
SYSCALL(getpid)
432: b8 0b 00 00 00 mov $0xb,%eax
437: cd 40 int $0x40
439: c3 ret
0000043a <sbrk>:
SYSCALL(sbrk)
43a: b8 0c 00 00 00 mov $0xc,%eax
43f: cd 40 int $0x40
441: c3 ret
00000442 <sleep>:
SYSCALL(sleep)
442: b8 0d 00 00 00 mov $0xd,%eax
447: cd 40 int $0x40
449: c3 ret
0000044a <uptime>:
SYSCALL(uptime)
44a: b8 0e 00 00 00 mov $0xe,%eax
44f: cd 40 int $0x40
451: c3 ret
00000452 <lotto>:
SYSCALL(lotto)
452: b8 16 00 00 00 mov $0x16,%eax
457: cd 40 int $0x40
459: c3 ret
45a: 66 90 xchg %ax,%ax
45c: 66 90 xchg %ax,%ax
45e: 66 90 xchg %ax,%ax
00000460 <printint>:
write(fd, &c, 1);
}
static void
printint(int fd, int xx, int base, int sgn)
{
460: 55 push %ebp
461: 89 e5 mov %esp,%ebp
463: 57 push %edi
464: 56 push %esi
465: 89 c6 mov %eax,%esi
467: 53 push %ebx
468: 83 ec 4c sub $0x4c,%esp
char buf[16];
int i, neg;
uint x;
neg = 0;
if(sgn && xx < 0){
46b: 8b 5d 08 mov 0x8(%ebp),%ebx
46e: 85 db test %ebx,%ebx
470: 74 09 je 47b <printint+0x1b>
472: 89 d0 mov %edx,%eax
474: c1 e8 1f shr $0x1f,%eax
477: 84 c0 test %al,%al
479: 75 75 jne 4f0 <printint+0x90>
neg = 1;
x = -xx;
} else {
x = xx;
47b: 89 d0 mov %edx,%eax
static char digits[] = "0123456789ABCDEF";
char buf[16];
int i, neg;
uint x;
neg = 0;
47d: c7 45 c4 00 00 00 00 movl $0x0,-0x3c(%ebp)
484: 89 75 c0 mov %esi,-0x40(%ebp)
x = -xx;
} else {
x = xx;
}
i = 0;
487: 31 ff xor %edi,%edi
489: 89 ce mov %ecx,%esi
48b: 8d 5d d7 lea -0x29(%ebp),%ebx
48e: eb 02 jmp 492 <printint+0x32>
do{
buf[i++] = digits[x % base];
490: 89 cf mov %ecx,%edi
492: 31 d2 xor %edx,%edx
494: f7 f6 div %esi
496: 8d 4f 01 lea 0x1(%edi),%ecx
499: 0f b6 92 a4 08 00 00 movzbl 0x8a4(%edx),%edx
}while((x /= base) != 0);
4a0: 85 c0 test %eax,%eax
x = xx;
}
i = 0;
do{
buf[i++] = digits[x % base];
4a2: 88 14 0b mov %dl,(%ebx,%ecx,1)
}while((x /= base) != 0);
4a5: 75 e9 jne 490 <printint+0x30>
if(neg)
4a7: 8b 55 c4 mov -0x3c(%ebp),%edx
x = xx;
}
i = 0;
do{
buf[i++] = digits[x % base];
4aa: 89 c8 mov %ecx,%eax
4ac: 8b 75 c0 mov -0x40(%ebp),%esi
}while((x /= base) != 0);
if(neg)
4af: 85 d2 test %edx,%edx
4b1: 74 08 je 4bb <printint+0x5b>
buf[i++] = '-';
4b3: 8d 4f 02 lea 0x2(%edi),%ecx
4b6: c6 44 05 d8 2d movb $0x2d,-0x28(%ebp,%eax,1)
while(--i >= 0)
4bb: 8d 79 ff lea -0x1(%ecx),%edi
4be: 66 90 xchg %ax,%ax
4c0: 0f b6 44 3d d8 movzbl -0x28(%ebp,%edi,1),%eax
4c5: 83 ef 01 sub $0x1,%edi
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
4c8: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
4cf: 00
4d0: 89 5c 24 04 mov %ebx,0x4(%esp)
4d4: 89 34 24 mov %esi,(%esp)
4d7: 88 45 d7 mov %al,-0x29(%ebp)
4da: e8 f3 fe ff ff call 3d2 <write>
buf[i++] = digits[x % base];
}while((x /= base) != 0);
if(neg)
buf[i++] = '-';
while(--i >= 0)
4df: 83 ff ff cmp $0xffffffff,%edi
4e2: 75 dc jne 4c0 <printint+0x60>
putc(fd, buf[i]);
}
4e4: 83 c4 4c add $0x4c,%esp
4e7: 5b pop %ebx
4e8: 5e pop %esi
4e9: 5f pop %edi
4ea: 5d pop %ebp
4eb: c3 ret
4ec: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
uint x;
neg = 0;
if(sgn && xx < 0){
neg = 1;
x = -xx;
4f0: 89 d0 mov %edx,%eax
4f2: f7 d8 neg %eax
int i, neg;
uint x;
neg = 0;
if(sgn && xx < 0){
neg = 1;
4f4: c7 45 c4 01 00 00 00 movl $0x1,-0x3c(%ebp)
4fb: eb 87 jmp 484 <printint+0x24>
4fd: 8d 76 00 lea 0x0(%esi),%esi
00000500 <printf>:
}
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
500: 55 push %ebp
501: 89 e5 mov %esp,%ebp
503: 57 push %edi
char *s;
int c, i, state;
uint *ap;
state = 0;
504: 31 ff xor %edi,%edi
}
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
506: 56 push %esi
507: 53 push %ebx
508: 83 ec 3c sub $0x3c,%esp
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
50b: 8b 5d 0c mov 0xc(%ebp),%ebx
char *s;
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
50e: 8d 45 10 lea 0x10(%ebp),%eax
}
// Print to the given fd. Only understands %d, %x, %p, %s.
void
printf(int fd, char *fmt, ...)
{
511: 8b 75 08 mov 0x8(%ebp),%esi
char *s;
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
514: 89 45 d4 mov %eax,-0x2c(%ebp)
for(i = 0; fmt[i]; i++){
517: 0f b6 13 movzbl (%ebx),%edx
51a: 83 c3 01 add $0x1,%ebx
51d: 84 d2 test %dl,%dl
51f: 75 39 jne 55a <printf+0x5a>
521: e9 c2 00 00 00 jmp 5e8 <printf+0xe8>
526: 66 90 xchg %ax,%ax
c = fmt[i] & 0xff;
if(state == 0){
if(c == '%'){
528: 83 fa 25 cmp $0x25,%edx
52b: 0f 84 bf 00 00 00 je 5f0 <printf+0xf0>
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
531: 8d 45 e2 lea -0x1e(%ebp),%eax
534: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
53b: 00
53c: 89 44 24 04 mov %eax,0x4(%esp)
540: 89 34 24 mov %esi,(%esp)
c = fmt[i] & 0xff;
if(state == 0){
if(c == '%'){
state = '%';
} else {
putc(fd, c);
543: 88 55 e2 mov %dl,-0x1e(%ebp)
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
546: e8 87 fe ff ff call 3d2 <write>
54b: 83 c3 01 add $0x1,%ebx
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
54e: 0f b6 53 ff movzbl -0x1(%ebx),%edx
552: 84 d2 test %dl,%dl
554: 0f 84 8e 00 00 00 je 5e8 <printf+0xe8>
c = fmt[i] & 0xff;
if(state == 0){
55a: 85 ff test %edi,%edi
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
c = fmt[i] & 0xff;
55c: 0f be c2 movsbl %dl,%eax
if(state == 0){
55f: 74 c7 je 528 <printf+0x28>
if(c == '%'){
state = '%';
} else {
putc(fd, c);
}
} else if(state == '%'){
561: 83 ff 25 cmp $0x25,%edi
564: 75 e5 jne 54b <printf+0x4b>
if(c == 'd'){
566: 83 fa 64 cmp $0x64,%edx
569: 0f 84 31 01 00 00 je 6a0 <printf+0x1a0>
printint(fd, *ap, 10, 1);
ap++;
} else if(c == 'x' || c == 'p'){
56f: 25 f7 00 00 00 and $0xf7,%eax
574: 83 f8 70 cmp $0x70,%eax
577: 0f 84 83 00 00 00 je 600 <printf+0x100>
printint(fd, *ap, 16, 0);
ap++;
} else if(c == 's'){
57d: 83 fa 73 cmp $0x73,%edx
580: 0f 84 a2 00 00 00 je 628 <printf+0x128>
s = "(null)";
while(*s != 0){
putc(fd, *s);
s++;
}
} else if(c == 'c'){
586: 83 fa 63 cmp $0x63,%edx
589: 0f 84 35 01 00 00 je 6c4 <printf+0x1c4>
putc(fd, *ap);
ap++;
} else if(c == '%'){
58f: 83 fa 25 cmp $0x25,%edx
592: 0f 84 e0 00 00 00 je 678 <printf+0x178>
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
598: 8d 45 e6 lea -0x1a(%ebp),%eax
59b: 83 c3 01 add $0x1,%ebx
59e: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
5a5: 00
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
5a6: 31 ff xor %edi,%edi
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
5a8: 89 44 24 04 mov %eax,0x4(%esp)
5ac: 89 34 24 mov %esi,(%esp)
5af: 89 55 d0 mov %edx,-0x30(%ebp)
5b2: c6 45 e6 25 movb $0x25,-0x1a(%ebp)
5b6: e8 17 fe ff ff call 3d2 <write>
} else if(c == '%'){
putc(fd, c);
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
5bb: 8b 55 d0 mov -0x30(%ebp),%edx
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
5be: 8d 45 e7 lea -0x19(%ebp),%eax
5c1: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
5c8: 00
5c9: 89 44 24 04 mov %eax,0x4(%esp)
5cd: 89 34 24 mov %esi,(%esp)
} else if(c == '%'){
putc(fd, c);
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
5d0: 88 55 e7 mov %dl,-0x19(%ebp)
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
5d3: e8 fa fd ff ff call 3d2 <write>
int c, i, state;
uint *ap;
state = 0;
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
5d8: 0f b6 53 ff movzbl -0x1(%ebx),%edx
5dc: 84 d2 test %dl,%dl
5de: 0f 85 76 ff ff ff jne 55a <printf+0x5a>
5e4: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
putc(fd, c);
}
state = 0;
}
}
}
5e8: 83 c4 3c add $0x3c,%esp
5eb: 5b pop %ebx
5ec: 5e pop %esi
5ed: 5f pop %edi
5ee: 5d pop %ebp
5ef: c3 ret
ap = (uint*)(void*)&fmt + 1;
for(i = 0; fmt[i]; i++){
c = fmt[i] & 0xff;
if(state == 0){
if(c == '%'){
state = '%';
5f0: bf 25 00 00 00 mov $0x25,%edi
5f5: e9 51 ff ff ff jmp 54b <printf+0x4b>
5fa: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
} else if(state == '%'){
if(c == 'd'){
printint(fd, *ap, 10, 1);
ap++;
} else if(c == 'x' || c == 'p'){
printint(fd, *ap, 16, 0);
600: 8b 45 d4 mov -0x2c(%ebp),%eax
603: b9 10 00 00 00 mov $0x10,%ecx
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
608: 31 ff xor %edi,%edi
} else if(state == '%'){
if(c == 'd'){
printint(fd, *ap, 10, 1);
ap++;
} else if(c == 'x' || c == 'p'){
printint(fd, *ap, 16, 0);
60a: c7 04 24 00 00 00 00 movl $0x0,(%esp)
611: 8b 10 mov (%eax),%edx
613: 89 f0 mov %esi,%eax
615: e8 46 fe ff ff call 460 <printint>
ap++;
61a: 83 45 d4 04 addl $0x4,-0x2c(%ebp)
61e: e9 28 ff ff ff jmp 54b <printf+0x4b>
623: 90 nop
624: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
} else if(c == 's'){
s = (char*)*ap;
628: 8b 45 d4 mov -0x2c(%ebp),%eax
ap++;
62b: 83 45 d4 04 addl $0x4,-0x2c(%ebp)
ap++;
} else if(c == 'x' || c == 'p'){
printint(fd, *ap, 16, 0);
ap++;
} else if(c == 's'){
s = (char*)*ap;
62f: 8b 38 mov (%eax),%edi
ap++;
if(s == 0)
s = "(null)";
631: b8 9d 08 00 00 mov $0x89d,%eax
636: 85 ff test %edi,%edi
638: 0f 44 f8 cmove %eax,%edi
while(*s != 0){
63b: 0f b6 07 movzbl (%edi),%eax
63e: 84 c0 test %al,%al
640: 74 2a je 66c <printf+0x16c>
642: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
648: 88 45 e3 mov %al,-0x1d(%ebp)
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
64b: 8d 45 e3 lea -0x1d(%ebp),%eax
ap++;
if(s == 0)
s = "(null)";
while(*s != 0){
putc(fd, *s);
s++;
64e: 83 c7 01 add $0x1,%edi
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
651: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
658: 00
659: 89 44 24 04 mov %eax,0x4(%esp)
65d: 89 34 24 mov %esi,(%esp)
660: e8 6d fd ff ff call 3d2 <write>
} else if(c == 's'){
s = (char*)*ap;
ap++;
if(s == 0)
s = "(null)";
while(*s != 0){
665: 0f b6 07 movzbl (%edi),%eax
668: 84 c0 test %al,%al
66a: 75 dc jne 648 <printf+0x148>
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
66c: 31 ff xor %edi,%edi
66e: e9 d8 fe ff ff jmp 54b <printf+0x4b>
673: 90 nop
674: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
678: 8d 45 e5 lea -0x1b(%ebp),%eax
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
67b: 31 ff xor %edi,%edi
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
67d: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
684: 00
685: 89 44 24 04 mov %eax,0x4(%esp)
689: 89 34 24 mov %esi,(%esp)
68c: c6 45 e5 25 movb $0x25,-0x1b(%ebp)
690: e8 3d fd ff ff call 3d2 <write>
695: e9 b1 fe ff ff jmp 54b <printf+0x4b>
69a: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
} else {
putc(fd, c);
}
} else if(state == '%'){
if(c == 'd'){
printint(fd, *ap, 10, 1);
6a0: 8b 45 d4 mov -0x2c(%ebp),%eax
6a3: b9 0a 00 00 00 mov $0xa,%ecx
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
6a8: 66 31 ff xor %di,%di
} else {
putc(fd, c);
}
} else if(state == '%'){
if(c == 'd'){
printint(fd, *ap, 10, 1);
6ab: c7 04 24 01 00 00 00 movl $0x1,(%esp)
6b2: 8b 10 mov (%eax),%edx
6b4: 89 f0 mov %esi,%eax
6b6: e8 a5 fd ff ff call 460 <printint>
ap++;
6bb: 83 45 d4 04 addl $0x4,-0x2c(%ebp)
6bf: e9 87 fe ff ff jmp 54b <printf+0x4b>
while(*s != 0){
putc(fd, *s);
s++;
}
} else if(c == 'c'){
putc(fd, *ap);
6c4: 8b 45 d4 mov -0x2c(%ebp),%eax
} else {
// Unknown % sequence. Print it to draw attention.
putc(fd, '%');
putc(fd, c);
}
state = 0;
6c7: 31 ff xor %edi,%edi
while(*s != 0){
putc(fd, *s);
s++;
}
} else if(c == 'c'){
putc(fd, *ap);
6c9: 8b 00 mov (%eax),%eax
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
6cb: c7 44 24 08 01 00 00 movl $0x1,0x8(%esp)
6d2: 00
6d3: 89 34 24 mov %esi,(%esp)
while(*s != 0){
putc(fd, *s);
s++;
}
} else if(c == 'c'){
putc(fd, *ap);
6d6: 88 45 e4 mov %al,-0x1c(%ebp)
#include "user.h"
static void
putc(int fd, char c)
{
write(fd, &c, 1);
6d9: 8d 45 e4 lea -0x1c(%ebp),%eax
6dc: 89 44 24 04 mov %eax,0x4(%esp)
6e0: e8 ed fc ff ff call 3d2 <write>
putc(fd, *s);
s++;
}
} else if(c == 'c'){
putc(fd, *ap);
ap++;
6e5: 83 45 d4 04 addl $0x4,-0x2c(%ebp)
6e9: e9 5d fe ff ff jmp 54b <printf+0x4b>
6ee: 66 90 xchg %ax,%ax
000006f0 <free>:
static Header base;
static Header *freep;
void
free(void *ap)
{
6f0: 55 push %ebp
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
6f1: a1 60 0b 00 00 mov 0xb60,%eax
static Header base;
static Header *freep;
void
free(void *ap)
{
6f6: 89 e5 mov %esp,%ebp
6f8: 57 push %edi
6f9: 56 push %esi
6fa: 53 push %ebx
6fb: 8b 5d 08 mov 0x8(%ebp),%ebx
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
6fe: 8b 08 mov (%eax),%ecx
void
free(void *ap)
{
Header *bp, *p;
bp = (Header*)ap - 1;
700: 8d 53 f8 lea -0x8(%ebx),%edx
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
703: 39 d0 cmp %edx,%eax
705: 72 11 jb 718 <free+0x28>
707: 90 nop
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
708: 39 c8 cmp %ecx,%eax
70a: 72 04 jb 710 <free+0x20>
70c: 39 ca cmp %ecx,%edx
70e: 72 10 jb 720 <free+0x30>
710: 89 c8 mov %ecx,%eax
free(void *ap)
{
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
712: 39 d0 cmp %edx,%eax
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
714: 8b 08 mov (%eax),%ecx
free(void *ap)
{
Header *bp, *p;
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
716: 73 f0 jae 708 <free+0x18>
718: 39 ca cmp %ecx,%edx
71a: 72 04 jb 720 <free+0x30>
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
71c: 39 c8 cmp %ecx,%eax
71e: 72 f0 jb 710 <free+0x20>
break;
if(bp + bp->s.size == p->s.ptr){
720: 8b 73 fc mov -0x4(%ebx),%esi
723: 8d 3c f2 lea (%edx,%esi,8),%edi
726: 39 cf cmp %ecx,%edi
728: 74 1e je 748 <free+0x58>
bp->s.size += p->s.ptr->s.size;
bp->s.ptr = p->s.ptr->s.ptr;
} else
bp->s.ptr = p->s.ptr;
72a: 89 4b f8 mov %ecx,-0x8(%ebx)
if(p + p->s.size == bp){
72d: 8b 48 04 mov 0x4(%eax),%ecx
730: 8d 34 c8 lea (%eax,%ecx,8),%esi
733: 39 f2 cmp %esi,%edx
735: 74 28 je 75f <free+0x6f>
p->s.size += bp->s.size;
p->s.ptr = bp->s.ptr;
} else
p->s.ptr = bp;
737: 89 10 mov %edx,(%eax)
freep = p;
739: a3 60 0b 00 00 mov %eax,0xb60
}
73e: 5b pop %ebx
73f: 5e pop %esi
740: 5f pop %edi
741: 5d pop %ebp
742: c3 ret
743: 90 nop
744: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
bp = (Header*)ap - 1;
for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
break;
if(bp + bp->s.size == p->s.ptr){
bp->s.size += p->s.ptr->s.size;
748: 03 71 04 add 0x4(%ecx),%esi
74b: 89 73 fc mov %esi,-0x4(%ebx)
bp->s.ptr = p->s.ptr->s.ptr;
74e: 8b 08 mov (%eax),%ecx
750: 8b 09 mov (%ecx),%ecx
752: 89 4b f8 mov %ecx,-0x8(%ebx)
} else
bp->s.ptr = p->s.ptr;
if(p + p->s.size == bp){
755: 8b 48 04 mov 0x4(%eax),%ecx
758: 8d 34 c8 lea (%eax,%ecx,8),%esi
75b: 39 f2 cmp %esi,%edx
75d: 75 d8 jne 737 <free+0x47>
p->s.size += bp->s.size;
75f: 03 4b fc add -0x4(%ebx),%ecx
p->s.ptr = bp->s.ptr;
} else
p->s.ptr = bp;
freep = p;
762: a3 60 0b 00 00 mov %eax,0xb60
bp->s.size += p->s.ptr->s.size;
bp->s.ptr = p->s.ptr->s.ptr;
} else
bp->s.ptr = p->s.ptr;
if(p + p->s.size == bp){
p->s.size += bp->s.size;
767: 89 48 04 mov %ecx,0x4(%eax)
p->s.ptr = bp->s.ptr;
76a: 8b 53 f8 mov -0x8(%ebx),%edx
76d: 89 10 mov %edx,(%eax)
} else
p->s.ptr = bp;
freep = p;
}
76f: 5b pop %ebx
770: 5e pop %esi
771: 5f pop %edi
772: 5d pop %ebp
773: c3 ret
774: 8d b6 00 00 00 00 lea 0x0(%esi),%esi
77a: 8d bf 00 00 00 00 lea 0x0(%edi),%edi
00000780 <malloc>:
return freep;
}
void*
malloc(uint nbytes)
{
780: 55 push %ebp
781: 89 e5 mov %esp,%ebp
783: 57 push %edi
784: 56 push %esi
785: 53 push %ebx
786: 83 ec 1c sub $0x1c,%esp
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
789: 8b 45 08 mov 0x8(%ebp),%eax
if((prevp = freep) == 0){
78c: 8b 1d 60 0b 00 00 mov 0xb60,%ebx
malloc(uint nbytes)
{
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
792: 8d 48 07 lea 0x7(%eax),%ecx
795: c1 e9 03 shr $0x3,%ecx
if((prevp = freep) == 0){
798: 85 db test %ebx,%ebx
malloc(uint nbytes)
{
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
79a: 8d 71 01 lea 0x1(%ecx),%esi
if((prevp = freep) == 0){
79d: 0f 84 9b 00 00 00 je 83e <malloc+0xbe>
7a3: 8b 13 mov (%ebx),%edx
7a5: 8b 7a 04 mov 0x4(%edx),%edi
base.s.ptr = freep = prevp = &base;
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
if(p->s.size >= nunits){
7a8: 39 fe cmp %edi,%esi
7aa: 76 64 jbe 810 <malloc+0x90>
7ac: 8d 04 f5 00 00 00 00 lea 0x0(,%esi,8),%eax
morecore(uint nu)
{
char *p;
Header *hp;
if(nu < 4096)
7b3: bb 00 80 00 00 mov $0x8000,%ebx
7b8: 89 45 e4 mov %eax,-0x1c(%ebp)
7bb: eb 0e jmp 7cb <malloc+0x4b>
7bd: 8d 76 00 lea 0x0(%esi),%esi
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
if((prevp = freep) == 0){
base.s.ptr = freep = prevp = &base;
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
7c0: 8b 02 mov (%edx),%eax
if(p->s.size >= nunits){
7c2: 8b 78 04 mov 0x4(%eax),%edi
7c5: 39 fe cmp %edi,%esi
7c7: 76 4f jbe 818 <malloc+0x98>
7c9: 89 c2 mov %eax,%edx
p->s.size = nunits;
}
freep = prevp;
return (void*)(p + 1);
}
if(p == freep)
7cb: 3b 15 60 0b 00 00 cmp 0xb60,%edx
7d1: 75 ed jne 7c0 <malloc+0x40>
morecore(uint nu)
{
char *p;
Header *hp;
if(nu < 4096)
7d3: 8b 45 e4 mov -0x1c(%ebp),%eax
7d6: 81 fe 00 10 00 00 cmp $0x1000,%esi
7dc: bf 00 10 00 00 mov $0x1000,%edi
7e1: 0f 43 fe cmovae %esi,%edi
7e4: 0f 42 c3 cmovb %ebx,%eax
nu = 4096;
p = sbrk(nu * sizeof(Header));
7e7: 89 04 24 mov %eax,(%esp)
7ea: e8 4b fc ff ff call 43a <sbrk>
if(p == (char*)-1)
7ef: 83 f8 ff cmp $0xffffffff,%eax
7f2: 74 18 je 80c <malloc+0x8c>
return 0;
hp = (Header*)p;
hp->s.size = nu;
7f4: 89 78 04 mov %edi,0x4(%eax)
free((void*)(hp + 1));
7f7: 83 c0 08 add $0x8,%eax
7fa: 89 04 24 mov %eax,(%esp)
7fd: e8 ee fe ff ff call 6f0 <free>
return freep;
802: 8b 15 60 0b 00 00 mov 0xb60,%edx
}
freep = prevp;
return (void*)(p + 1);
}
if(p == freep)
if((p = morecore(nunits)) == 0)
808: 85 d2 test %edx,%edx
80a: 75 b4 jne 7c0 <malloc+0x40>
return 0;
80c: 31 c0 xor %eax,%eax
80e: eb 20 jmp 830 <malloc+0xb0>
if((prevp = freep) == 0){
base.s.ptr = freep = prevp = &base;
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
if(p->s.size >= nunits){
810: 89 d0 mov %edx,%eax
812: 89 da mov %ebx,%edx
814: 8d 74 26 00 lea 0x0(%esi,%eiz,1),%esi
if(p->s.size == nunits)
818: 39 fe cmp %edi,%esi
81a: 74 1c je 838 <malloc+0xb8>
prevp->s.ptr = p->s.ptr;
else {
p->s.size -= nunits;
81c: 29 f7 sub %esi,%edi
81e: 89 78 04 mov %edi,0x4(%eax)
p += p->s.size;
821: 8d 04 f8 lea (%eax,%edi,8),%eax
p->s.size = nunits;
824: 89 70 04 mov %esi,0x4(%eax)
}
freep = prevp;
827: 89 15 60 0b 00 00 mov %edx,0xb60
return (void*)(p + 1);
82d: 83 c0 08 add $0x8,%eax
}
if(p == freep)
if((p = morecore(nunits)) == 0)
return 0;
}
}
830: 83 c4 1c add $0x1c,%esp
833: 5b pop %ebx
834: 5e pop %esi
835: 5f pop %edi
836: 5d pop %ebp
837: c3 ret
base.s.size = 0;
}
for(p = prevp->s.ptr; ; prevp = p, p = p->s.ptr){
if(p->s.size >= nunits){
if(p->s.size == nunits)
prevp->s.ptr = p->s.ptr;
838: 8b 08 mov (%eax),%ecx
83a: 89 0a mov %ecx,(%edx)
83c: eb e9 jmp 827 <malloc+0xa7>
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
if((prevp = freep) == 0){
base.s.ptr = freep = prevp = &base;
83e: c7 05 60 0b 00 00 64 movl $0xb64,0xb60
845: 0b 00 00
base.s.size = 0;
848: ba 64 0b 00 00 mov $0xb64,%edx
Header *p, *prevp;
uint nunits;
nunits = (nbytes + sizeof(Header) - 1)/sizeof(Header) + 1;
if((prevp = freep) == 0){
base.s.ptr = freep = prevp = &base;
84d: c7 05 64 0b 00 00 64 movl $0xb64,0xb64
854: 0b 00 00
base.s.size = 0;
857: c7 05 68 0b 00 00 00 movl $0x0,0xb68
85e: 00 00 00
861: e9 46 ff ff ff jmp 7ac <malloc+0x2c>
|
Transynther/x86/_processed/NONE/_xt_/i9-9900K_12_0xca.log_21829_1633.asm | ljhsiun2/medusa | 9 | 93106 | .global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r13
push %r8
push %rax
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0xf665, %rsi
lea addresses_WC_ht+0x17065, %rdi
nop
nop
nop
inc %rax
mov $84, %rcx
rep movsw
nop
nop
nop
nop
nop
sub %r10, %r10
lea addresses_WT_ht+0x194e5, %r8
clflush (%r8)
add $24832, %r13
movb $0x61, (%r8)
nop
nop
nop
xor %rcx, %rcx
lea addresses_WC_ht+0x12ca, %rsi
lea addresses_D_ht+0x3c65, %rdi
nop
nop
nop
nop
add %r8, %r8
mov $3, %rcx
rep movsw
nop
nop
nop
nop
nop
and %rcx, %rcx
lea addresses_WT_ht+0x8965, %rsi
lea addresses_normal_ht+0x15665, %rdi
clflush (%rsi)
nop
nop
nop
nop
inc %rbp
mov $100, %rcx
rep movsq
nop
nop
nop
cmp $3358, %r8
lea addresses_A_ht+0x1c265, %rsi
nop
nop
nop
cmp %r8, %r8
mov (%rsi), %ecx
nop
nop
nop
nop
cmp $13424, %rsi
lea addresses_normal_ht+0x19351, %r13
nop
nop
nop
nop
add %rcx, %rcx
movb $0x61, (%r13)
nop
nop
add %rbp, %rbp
lea addresses_A_ht+0xaf45, %rbp
nop
nop
nop
add $49704, %rdi
mov (%rbp), %r10w
nop
and %r8, %r8
pop %rsi
pop %rdi
pop %rcx
pop %rbp
pop %rax
pop %r8
pop %r13
pop %r10
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r14
push %r15
push %r8
push %rbx
push %rdi
push %rsi
// Store
mov $0x4faa280000000f65, %r15
nop
nop
inc %r14
movl $0x51525354, (%r15)
nop
add $59853, %r15
// Store
lea addresses_UC+0x1739, %r10
nop
nop
nop
nop
nop
dec %rbx
movl $0x51525354, (%r10)
nop
nop
nop
add %rbx, %rbx
// Faulty Load
lea addresses_RW+0x6665, %r10
nop
xor $20918, %rdi
vmovups (%r10), %ymm0
vextracti128 $1, %ymm0, %xmm0
vpextrq $1, %xmm0, %r15
lea oracles, %rdi
and $0xff, %r15
shlq $12, %r15
mov (%rdi,%r15,1), %r15
pop %rsi
pop %rdi
pop %rbx
pop %r8
pop %r15
pop %r14
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'size': 1, 'NT': False, 'type': 'addresses_RW', 'same': False, 'AVXalign': False, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'size': 4, 'NT': True, 'type': 'addresses_NC', 'same': False, 'AVXalign': False, 'congruent': 6}}
{'OP': 'STOR', 'dst': {'size': 4, 'NT': False, 'type': 'addresses_UC', 'same': False, 'AVXalign': False, 'congruent': 1}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'size': 32, 'NT': False, 'type': 'addresses_RW', 'same': True, 'AVXalign': False, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_A_ht', 'congruent': 11}, 'dst': {'same': False, 'type': 'addresses_WC_ht', 'congruent': 9}}
{'OP': 'STOR', 'dst': {'size': 1, 'NT': False, 'type': 'addresses_WT_ht', 'same': False, 'AVXalign': False, 'congruent': 7}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_WC_ht', 'congruent': 0}, 'dst': {'same': False, 'type': 'addresses_D_ht', 'congruent': 9}}
{'OP': 'REPM', 'src': {'same': False, 'type': 'addresses_WT_ht', 'congruent': 7}, 'dst': {'same': False, 'type': 'addresses_normal_ht', 'congruent': 11}}
{'OP': 'LOAD', 'src': {'size': 4, 'NT': False, 'type': 'addresses_A_ht', 'same': False, 'AVXalign': False, 'congruent': 9}}
{'OP': 'STOR', 'dst': {'size': 1, 'NT': False, 'type': 'addresses_normal_ht', 'same': False, 'AVXalign': True, 'congruent': 2}}
{'OP': 'LOAD', 'src': {'size': 2, 'NT': False, 'type': 'addresses_A_ht', 'same': False, 'AVXalign': False, 'congruent': 4}}
{'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
*/
|
examples/ferris/gbasm/main.asm | rukai/ggbasm | 10 | 13071 | start:
di
; TODO: load graphics
call GGBASMAudioInit
; start playing ferris theme
ld hl, GGBASMAudioEnable
ld [hl], 0x01
ld hl, GGBASMAudioBank
ld [hl], 0x00
ld hl, GGBASMAudioPointerHi
ld [hl], MusicFerrisTheme / 0x100
ld hl, GGBASMAudioPointerLo
ld [hl], MusicFerrisTheme % 0x100
ld hl, GGBASMAudioRest
ld [hl], 0x20
; setup interrupts
ei
ld a, 0x1
ld [0xFF00+0xFF], a
mainLoop:
call GGBASMAudioStep
halt
; quick, draw graphics now
; TODO
jp mainLoop
|
test/Succeed/Issue2760.agda | cruhland/agda | 1,989 | 5921 | <reponame>cruhland/agda
record R (X : Set) : Set₁ where
field
P : X → Set
f : ∀ {x : X} → P x → P x
open R {{…}}
test : ∀ {X} {{r : R X}} {x : X} → P x → P x
test p = f p
-- WAS: instance search fails with several candidates left
-- SHOULD: succeed
|
programs/oeis/159/A159035.asm | neoneye/loda | 22 | 3818 | <gh_stars>10-100
; A159035: a(0)=1=a(1), a(2)=2, a(3)=5; thereafter a(n+3)=4*a(n+2)-4*a(n+1)+2*a(n) for n>=1.
; 1,1,2,5,14,40,114,324,920,2612,7416,21056,59784,169744,481952,1368400,3885280,11031424,31321376,88930368,252498816,716916544,2035531648,5779458048,16409538688,46591385856,132286304768,375598753024
mov $1,1
lpb $0
sub $0,1
mul $2,2
trn $2,1
add $2,$3
add $3,$1
add $1,$2
lpe
mov $0,$1
|
src/main/antlr/WACCParser.g4 | williamprofit/WACC | 3 | 3224 | parser grammar WACCParser;
options {
tokenVocab=WACCLexer;
}
prog: WS* BEGIN WS+ func* WS* stat WS* END WS* EOF;
func: type WS+ ID WS* LBRACKET WS* param_list? WS* RBRACKET WS* IS WS* stat WS* END WS*;
stat: SKP #Skip
| type WS+ ID WS* ASSIGN WS* assign_rhs #Declare
| assign_lhs WS* ASSIGN WS* assign_rhs #Assign
| READ WS+ assign_lhs #ReadStat
| FREE WS+ expr #FreeStat
| RETURN WS+ expr #ReturnStat
| EXIT WS+ expr #ExitStat
| PRINT WS* expr #PrintStat
| PRINTLN WS+ expr #PrintlnStat
| IF WS* expr WS* THEN WS* stat WS* ELSE WS* stat WS* FI #IfElse
| WHILE WS* expr WS* DO WS* stat WS* DONE #WhileDo
| FOR WS* stat WS* SEMICOLON WS* expr WS* SEMICOLON WS* stat WS* DO WS* stat WS* DONE #ForDo
| BEGIN WS* stat WS* END #NewScope
| <assoc=right> stat WS* SEMICOLON WS* stat #SemiColon
;
expr:
int_lit #IntLitExpr
| unary_op WS* expr # UnOpExpr
| expr WS* MUL WS* expr #BinOp
| expr WS* DIV WS* expr #BinOp
| expr WS* MOD WS* expr #BinOp
| expr WS* PLUS WS* expr #BinOp
| expr WS* MINUS WS* expr #BinOp
| expr WS* GRT WS* expr #BinOp
| expr WS* GRT_EQ WS* expr #BinOp
| expr WS* LESS WS* expr #BinOp
| expr WS* LESS_EQ WS* expr #BinOp
| expr WS* EQ WS* expr #BinOp
| expr WS* NOT_EQ WS* expr #BinOp
| expr WS* AND WS* expr #BinOp
| expr WS* OR WS* expr #BinOp
| BOOL_LIT #BoolLitExpr
| CHAR_LIT #CharLitExpr
| STRING_LIT #StrLitExpr
| PAIR_LIT #PairLitExpr
| ID #IdentExpr
| array_elem #ArrayElemExpr
| LBRACKET WS* expr WS* RBRACKET #NestedExpr
;
// Assignments
assign_lhs:
ID #LHSIdent
| array_elem #LHSArrayElem
| pair_elem #LHSPairElem
;
assign_rhs:
expr #RHSExpr
| array_lit #RHSArrayLit
| NEWPAIR WS* LBRACKET WS* expr WS* COMMA WS* expr WS* RBRACKET #RHSNewpair
| pair_elem #RHSPairElem
| CALL WS+ ID WS* LBRACKET WS* (arg_list)? WS* RBRACKET #RHSFuncCall
;
// Param & args
param_list: param WS* (COMMA WS* param)*;
param: type WS+ ID;
arg_list: expr WS* (COMMA WS* expr)*;
// Types
type: base_type | array_type | pair_type;
base_type:
INT #IntBaseT
| BOOL #BoolBaseT
| CHAR #CharBaseT
| STRING #StringBaseT
;
array_type:
base_type WS* LSQBRACKET WS* RSQBRACKET #ArrayOfBaseT
| pair_type WS* LSQBRACKET WS* RSQBRACKET #ArrayOfPairs
| array_type WS* LSQBRACKET WS* RSQBRACKET #ArrayOfArrays
;
array_elem: ID WS* (LSQBRACKET WS* expr WS* RSQBRACKET)+;
pair_type: PAIR WS* LBRACKET WS* pair_elem_type WS* COMMA WS* pair_elem_type WS* RBRACKET;
pair_elem_type:
base_type #BaseTPairElem
| array_type #ArrayPairElem
| PAIR #PairPairElem
;
pair_elem: FST WS+ expr | SND WS+ expr;
// Literals
array_lit: LSQBRACKET WS* (expr WS* (COMMA WS* expr WS*)*)? WS* RSQBRACKET;
//int_lit: int_sign? WS* INTEGER;
//
//int_sign: PLUS | MINUS;
int_lit: (PLUS | MINUS)? WS* INTEGER;
unary_op: NOT
| MINUS
| LEN
| ORD
| CHR;
|
Validation/pyFrame3DD-master/gcc-master/gcc/ada/butil.adb | djamal2727/Main-Bearing-Analytical-Model | 0 | 29763 | <reponame>djamal2727/Main-Bearing-Analytical-Model
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- B U T I L --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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;
with Unchecked_Deallocation;
with GNAT; use GNAT;
with System.OS_Lib; use System.OS_Lib;
package body Butil is
-----------------------
-- Local subprograms --
-----------------------
procedure Parse_Next_Unit_Name (Iter : in out Forced_Units_Iterator);
-- Parse the name of the next available unit accessible through iterator
-- Iter and save it in the iterator.
function Read_Forced_Elab_Order_File return String_Ptr;
-- Read the contents of the forced-elaboration-order file supplied to the
-- binder via switch -f and return them as a string. Return null if the
-- file is not available.
--------------
-- Has_Next --
--------------
function Has_Next (Iter : Forced_Units_Iterator) return Boolean is
begin
return Present (Iter.Unit_Name);
end Has_Next;
----------------------
-- Is_Internal_Unit --
----------------------
-- Note: the reason we do not use the Fname package for this function
-- is that it would drag too much junk into the binder.
function Is_Internal_Unit return Boolean is
begin
return Is_Predefined_Unit
or else (Name_Len > 4 and then (Name_Buffer (1 .. 5) = "gnat%"
or else
Name_Buffer (1 .. 5) = "gnat."));
end Is_Internal_Unit;
------------------------
-- Is_Predefined_Unit --
------------------------
-- Note: the reason we do not use the Fname package for this function
-- is that it would drag too much junk into the binder.
function Is_Predefined_Unit return Boolean is
L : Natural renames Name_Len;
B : String renames Name_Buffer;
begin
return (L > 3 and then B (1 .. 4) = "ada.")
or else (L > 6 and then B (1 .. 7) = "system.")
or else (L > 10 and then B (1 .. 11) = "interfaces.")
or else (L > 3 and then B (1 .. 4) = "ada%")
or else (L > 8 and then B (1 .. 9) = "calendar%")
or else (L > 9 and then B (1 .. 10) = "direct_io%")
or else (L > 10 and then B (1 .. 11) = "interfaces%")
or else (L > 13 and then B (1 .. 14) = "io_exceptions%")
or else (L > 12 and then B (1 .. 13) = "machine_code%")
or else (L > 13 and then B (1 .. 14) = "sequential_io%")
or else (L > 6 and then B (1 .. 7) = "system%")
or else (L > 7 and then B (1 .. 8) = "text_io%")
or else (L > 20 and then B (1 .. 21) = "unchecked_conversion%")
or else (L > 22 and then B (1 .. 23) = "unchecked_deallocation%")
or else (L > 4 and then B (1 .. 5) = "gnat%")
or else (L > 4 and then B (1 .. 5) = "gnat.");
end Is_Predefined_Unit;
--------------------------
-- Iterate_Forced_Units --
--------------------------
function Iterate_Forced_Units return Forced_Units_Iterator is
Iter : Forced_Units_Iterator;
begin
Iter.Order := Read_Forced_Elab_Order_File;
Parse_Next_Unit_Name (Iter);
return Iter;
end Iterate_Forced_Units;
----------
-- Next --
----------
procedure Next
(Iter : in out Forced_Units_Iterator;
Unit_Name : out Unit_Name_Type;
Unit_Line : out Logical_Line_Number)
is
begin
if not Has_Next (Iter) then
raise Iterator_Exhausted;
end if;
Unit_Line := Iter.Unit_Line;
Unit_Name := Iter.Unit_Name;
pragma Assert (Present (Unit_Name));
Parse_Next_Unit_Name (Iter);
end Next;
--------------------------
-- Parse_Next_Unit_Name --
--------------------------
procedure Parse_Next_Unit_Name (Iter : in out Forced_Units_Iterator) is
Body_Suffix : constant String := " (body)";
Body_Type : constant String := "%b";
Body_Length : constant Positive := Body_Suffix'Length;
Body_Offset : constant Natural := Body_Length - 1;
Comment_Header : constant String := "--";
Comment_Offset : constant Natural := Comment_Header'Length - 1;
Spec_Suffix : constant String := " (spec)";
Spec_Type : constant String := "%s";
Spec_Length : constant Positive := Spec_Suffix'Length;
Spec_Offset : constant Natural := Spec_Length - 1;
Index : Positive renames Iter.Order_Index;
Line : Logical_Line_Number renames Iter.Order_Line;
Order : String_Ptr renames Iter.Order;
function At_Comment return Boolean;
pragma Inline (At_Comment);
-- Determine whether iterator Iter is positioned over the start of a
-- comment.
function At_Terminator return Boolean;
pragma Inline (At_Terminator);
-- Determine whether iterator Iter is positioned over a line terminator
-- character.
function At_Whitespace return Boolean;
pragma Inline (At_Whitespace);
-- Determine whether iterator Iter is positioned over a whitespace
-- character.
function Is_Terminator (C : Character) return Boolean;
pragma Inline (Is_Terminator);
-- Determine whether character C denotes a line terminator
function Is_Whitespace (C : Character) return Boolean;
pragma Inline (Is_Whitespace);
-- Determine whether character C denotes a whitespace
procedure Parse_Unit_Name;
pragma Inline (Parse_Unit_Name);
-- Find and parse the first available unit name
procedure Skip_Comment;
pragma Inline (Skip_Comment);
-- Skip a comment by reaching a line terminator
procedure Skip_Terminator;
pragma Inline (Skip_Terminator);
-- Skip a line terminator and deal with the logical line numbering
procedure Skip_Whitespace;
pragma Inline (Skip_Whitespace);
-- Skip whitespace
function Within_Order
(Low_Offset : Natural := 0;
High_Offset : Natural := 0) return Boolean;
pragma Inline (Within_Order);
-- Determine whether index of iterator Iter is still within the range of
-- the order string. Low_Offset may be used to inspect the area that is
-- less than the index. High_Offset may be used to inspect the area that
-- is greater than the index.
----------------
-- At_Comment --
----------------
function At_Comment return Boolean is
begin
-- The interator is over a comment when the index is positioned over
-- the start of a comment header.
--
-- unit (spec) -- comment
-- ^
-- Index
return
Within_Order (High_Offset => Comment_Offset)
and then Order (Index .. Index + Comment_Offset) = Comment_Header;
end At_Comment;
-------------------
-- At_Terminator --
-------------------
function At_Terminator return Boolean is
begin
return Within_Order and then Is_Terminator (Order (Index));
end At_Terminator;
-------------------
-- At_Whitespace --
-------------------
function At_Whitespace return Boolean is
begin
return Within_Order and then Is_Whitespace (Order (Index));
end At_Whitespace;
-------------------
-- Is_Terminator --
-------------------
function Is_Terminator (C : Character) return Boolean is
begin
-- Carriage return is treated intentionally as whitespace since it
-- appears only on certain targets, while line feed is consistent on
-- all of them.
return C = ASCII.LF;
end Is_Terminator;
-------------------
-- Is_Whitespace --
-------------------
function Is_Whitespace (C : Character) return Boolean is
begin
return
C = ' '
or else C = ASCII.CR -- carriage return
or else C = ASCII.FF -- form feed
or else C = ASCII.HT -- horizontal tab
or else C = ASCII.VT; -- vertical tab
end Is_Whitespace;
---------------------
-- Parse_Unit_Name --
---------------------
procedure Parse_Unit_Name is
pragma Assert (not At_Comment);
pragma Assert (not At_Terminator);
pragma Assert (not At_Whitespace);
pragma Assert (Within_Order);
procedure Find_End_Index_Of_Unit_Name;
pragma Inline (Find_End_Index_Of_Unit_Name);
-- Position the index of iterator Iter at the last character of the
-- first available unit name.
---------------------------------
-- Find_End_Index_Of_Unit_Name --
---------------------------------
procedure Find_End_Index_Of_Unit_Name is
begin
-- At this point the index points at the start of a unit name. The
-- unit name may be legal, in which case it appears as:
--
-- unit (body)
--
-- However, it may also be illegal:
--
-- unit without suffix
-- unit with multiple prefixes (spec)
--
-- In order to handle both forms, find the construct following the
-- unit name. This is either a comment, a terminator, or the end
-- of the order:
--
-- unit (body) -- comment
-- unit without suffix <terminator>
-- unit with multiple prefixes (spec)<end of order>
--
-- Once the construct is found, truncate the unit name by skipping
-- all white space between the construct and the end of the unit
-- name.
-- Find the construct that follows the unit name
while Within_Order loop
if At_Comment then
exit;
elsif At_Terminator then
exit;
end if;
Index := Index + 1;
end loop;
-- Position the index prior to the construct that follows the unit
-- name.
Index := Index - 1;
-- Truncate towards the end of the unit name
while Within_Order loop
if At_Whitespace then
Index := Index - 1;
else
exit;
end if;
end loop;
end Find_End_Index_Of_Unit_Name;
-- Local variables
Start_Index : constant Positive := Index;
End_Index : Positive;
Is_Body : Boolean := False;
Is_Spec : Boolean := False;
-- Start of processing for Parse_Unit_Name
begin
Find_End_Index_Of_Unit_Name;
End_Index := Index;
pragma Assert (Start_Index <= End_Index);
-- At this point the indices are positioned as follows:
--
-- End_Index
-- Index
-- v
-- unit (spec) -- comment
-- ^
-- Start_Index
-- Rewind the index, skipping over the legal suffixes
--
-- Index End_Index
-- v v
-- unit (spec) -- comment
-- ^
-- Start_Index
if Within_Order (Low_Offset => Body_Offset)
and then Order (Index - Body_Offset .. Index) = Body_Suffix
then
Is_Body := True;
Index := Index - Body_Length;
elsif Within_Order (Low_Offset => Spec_Offset)
and then Order (Index - Spec_Offset .. Index) = Spec_Suffix
then
Is_Spec := True;
Index := Index - Spec_Length;
end if;
-- Capture the line where the unit name is defined
Iter.Unit_Line := Line;
-- Transform the unit name to match the format recognized by the
-- name table.
if Is_Body then
Iter.Unit_Name :=
Name_Find (Order (Start_Index .. Index) & Body_Type);
elsif Is_Spec then
Iter.Unit_Name :=
Name_Find (Order (Start_Index .. Index) & Spec_Type);
-- Otherwise the unit name is illegal, so leave it as is
else
Iter.Unit_Name := Name_Find (Order (Start_Index .. Index));
end if;
-- Advance the index past the unit name
--
-- End_IndexIndex
-- vv
-- unit (spec) -- comment
-- ^
-- Start_Index
Index := End_Index + 1;
end Parse_Unit_Name;
------------------
-- Skip_Comment --
------------------
procedure Skip_Comment is
begin
pragma Assert (At_Comment);
while Within_Order loop
if At_Terminator then
exit;
end if;
Index := Index + 1;
end loop;
end Skip_Comment;
---------------------
-- Skip_Terminator --
---------------------
procedure Skip_Terminator is
begin
pragma Assert (At_Terminator);
Index := Index + 1;
Line := Line + 1;
end Skip_Terminator;
---------------------
-- Skip_Whitespace --
---------------------
procedure Skip_Whitespace is
begin
while Within_Order loop
if At_Whitespace then
Index := Index + 1;
else
exit;
end if;
end loop;
end Skip_Whitespace;
------------------
-- Within_Order --
------------------
function Within_Order
(Low_Offset : Natural := 0;
High_Offset : Natural := 0) return Boolean
is
begin
return
Order /= null
and then Index - Low_Offset >= Order'First
and then Index + High_Offset <= Order'Last;
end Within_Order;
-- Start of processing for Parse_Next_Unit_Name
begin
-- A line in the forced-elaboration-order file has the following
-- grammar:
--
-- LINE ::=
-- [WHITESPACE] UNIT_NAME [WHITESPACE] [COMMENT] TERMINATOR
--
-- WHITESPACE ::=
-- <any whitespace character>
-- | <carriage return>
--
-- UNIT_NAME ::=
-- UNIT_PREFIX [WHITESPACE] UNIT_SUFFIX
--
-- UNIT_PREFIX ::=
-- <any string>
--
-- UNIT_SUFFIX ::=
-- (body)
-- | (spec)
--
-- COMMENT ::=
-- -- <any string>
--
-- TERMINATOR ::=
-- <line feed>
-- <end of file>
--
-- Items in <> brackets are semantic notions
-- Assume that the order has no remaining units
Iter.Unit_Line := No_Line_Number;
Iter.Unit_Name := No_Unit_Name;
-- Try to find the first available unit name from the current position
-- of iteration.
while Within_Order loop
Skip_Whitespace;
if At_Comment then
Skip_Comment;
elsif not Within_Order then
exit;
elsif At_Terminator then
Skip_Terminator;
else
Parse_Unit_Name;
exit;
end if;
end loop;
end Parse_Next_Unit_Name;
---------------------------------
-- Read_Forced_Elab_Order_File --
---------------------------------
function Read_Forced_Elab_Order_File return String_Ptr is
procedure Free is new Unchecked_Deallocation (String, String_Ptr);
Descr : File_Descriptor;
Len : Natural;
Len_Read : Natural;
Result : String_Ptr;
Success : Boolean;
begin
if Force_Elab_Order_File = null then
return null;
end if;
-- Obtain and sanitize a descriptor to the elaboration-order file
Descr := Open_Read (Force_Elab_Order_File.all, Binary);
if Descr = Invalid_FD then
return null;
end if;
-- Determine the size of the file, allocate a result large enough to
-- house its contents, and read it.
Len := Natural (File_Length (Descr));
if Len = 0 then
return null;
end if;
Result := new String (1 .. Len);
Len_Read := Read (Descr, Result (1)'Address, Len);
-- The read failed to acquire the whole content of the file
if Len_Read /= Len then
Free (Result);
return null;
end if;
Close (Descr, Success);
-- The file failed to close
if not Success then
Free (Result);
return null;
end if;
return Result;
end Read_Forced_Elab_Order_File;
----------------
-- Uname_Less --
----------------
function Uname_Less (U1, U2 : Unit_Name_Type) return Boolean is
begin
Get_Name_String (U1);
declare
U1_Name : constant String (1 .. Name_Len) :=
Name_Buffer (1 .. Name_Len);
Min_Length : Natural;
begin
Get_Name_String (U2);
if Name_Len < U1_Name'Last then
Min_Length := Name_Len;
else
Min_Length := U1_Name'Last;
end if;
for J in 1 .. Min_Length loop
if U1_Name (J) > Name_Buffer (J) then
return False;
elsif U1_Name (J) < Name_Buffer (J) then
return True;
end if;
end loop;
return U1_Name'Last < Name_Len;
end;
end Uname_Less;
---------------------
-- Write_Unit_Name --
---------------------
procedure Write_Unit_Name (U : Unit_Name_Type) is
begin
Get_Name_String (U);
Write_Str (Name_Buffer (1 .. Name_Len - 2));
if Name_Buffer (Name_Len) = 's' then
Write_Str (" (spec)");
else
Write_Str (" (body)");
end if;
Name_Len := Name_Len + 5;
end Write_Unit_Name;
end Butil;
|
src/Native/Runtime/amd64/AllocFast.asm | kouvel/corert | 3,223 | 25072 | <reponame>kouvel/corert
;; Licensed to the .NET Foundation under one or more agreements.
;; The .NET Foundation licenses this file to you under the MIT license.
include asmmacros.inc
;; Allocate non-array, non-finalizable object. If the allocation doesn't fit into the current thread's
;; allocation context then automatically fallback to the slow allocation path.
;; RCX == EEType
LEAF_ENTRY RhpNewFast, _TEXT
;; rdx = GetThread(), TRASHES rax
INLINE_GETTHREAD rdx, rax
;;
;; rcx contains EEType pointer
;;
mov r8d, [rcx + OFFSETOF__EEType__m_uBaseSize]
;;
;; eax: base size
;; rcx: EEType pointer
;; rdx: Thread pointer
;;
mov rax, [rdx + OFFSETOF__Thread__m_alloc_context__alloc_ptr]
add r8, rax
cmp r8, [rdx + OFFSETOF__Thread__m_alloc_context__alloc_limit]
ja RhpNewFast_RarePath
;; set the new alloc pointer
mov [rdx + OFFSETOF__Thread__m_alloc_context__alloc_ptr], r8
;; set the new object's EEType pointer
mov [rax], rcx
ret
RhpNewFast_RarePath:
xor edx, edx
jmp RhpNewObject
LEAF_END RhpNewFast, _TEXT
;; Allocate non-array object with finalizer
;; RCX == EEType
LEAF_ENTRY RhpNewFinalizable, _TEXT
mov edx, GC_ALLOC_FINALIZE
jmp RhpNewObject
LEAF_END RhpNewFinalizable, _TEXT
;; Allocate non-array object
;; RCX == EEType
;; EDX == alloc flags
NESTED_ENTRY RhpNewObject, _TEXT
PUSH_COOP_PINVOKE_FRAME r9
END_PROLOGUE
; R9: transition frame
;; Preserve the EEType in RSI
mov rsi, rcx
mov r8d, [rsi + OFFSETOF__EEType__m_uBaseSize] ; cbSize
;; Call the rest of the allocation helper.
;; void* RhpGcAlloc(EEType *pEEType, UInt32 uFlags, UIntNative cbSize, void * pTransitionFrame)
call RhpGcAlloc
;; Set the new object's EEType pointer on success.
test rax, rax
jz NewOutOfMemory
mov [rax + OFFSETOF__Object__m_pEEType], rsi
;; If the object is bigger than RH_LARGE_OBJECT_SIZE, we must publish it to the BGC
mov edx, [rsi + OFFSETOF__EEType__m_uBaseSize]
cmp rdx, RH_LARGE_OBJECT_SIZE
jb New_SkipPublish
mov rcx, rax ;; rcx: object
;; rdx: already contains object size
call RhpPublishObject ;; rax: this function returns the object that was passed-in
New_SkipPublish:
POP_COOP_PINVOKE_FRAME
ret
NewOutOfMemory:
;; This is the OOM failure path. We're going to tail-call to a managed helper that will throw
;; an out of memory exception that the caller of this allocator understands.
mov rcx, rsi ; EEType pointer
xor edx, edx ; Indicate that we should throw OOM.
POP_COOP_PINVOKE_FRAME
jmp RhExceptionHandling_FailedAllocation
NESTED_END RhpNewObject, _TEXT
;; Allocate a string.
;; RCX == EEType
;; EDX == character/element count
LEAF_ENTRY RhNewString, _TEXT
; we want to limit the element count to the non-negative 32-bit int range
cmp rdx, MAX_STRING_LENGTH
ja StringSizeOverflow
; Compute overall allocation size (align(base size + (element size * elements), 8)).
lea rax, [(rdx * STRING_COMPONENT_SIZE) + (STRING_BASE_SIZE + 7)]
and rax, -8
; rax == string size
; rcx == EEType
; rdx == element count
INLINE_GETTHREAD r10, r8
mov r8, rax
add rax, [r10 + OFFSETOF__Thread__m_alloc_context__alloc_ptr]
jc RhpNewArrayRare
; rax == new alloc ptr
; rcx == EEType
; rdx == element count
; r8 == array size
; r10 == thread
cmp rax, [r10 + OFFSETOF__Thread__m_alloc_context__alloc_limit]
ja RhpNewArrayRare
mov [r10 + OFFSETOF__Thread__m_alloc_context__alloc_ptr], rax
; calc the new object pointer
sub rax, r8
mov [rax + OFFSETOF__Object__m_pEEType], rcx
mov [rax + OFFSETOF__String__m_Length], edx
ret
StringSizeOverflow:
; We get here if the size of the final string object can't be represented as an unsigned
; 32-bit value. We're going to tail-call to a managed helper that will throw
; an OOM exception that the caller of this allocator understands.
; rcx holds EEType pointer already
xor edx, edx ; Indicate that we should throw OOM.
jmp RhExceptionHandling_FailedAllocation
LEAF_END RhNewString, _TEXT
;; Allocate one dimensional, zero based array (SZARRAY).
;; RCX == EEType
;; EDX == element count
LEAF_ENTRY RhpNewArray, _TEXT
; we want to limit the element count to the non-negative 32-bit int range
cmp rdx, 07fffffffh
ja ArraySizeOverflow
; save element count
mov r8, rdx
; Compute overall allocation size (align(base size + (element size * elements), 8)).
movzx eax, word ptr [rcx + OFFSETOF__EEType__m_usComponentSize]
mul rdx
mov edx, [rcx + OFFSETOF__EEType__m_uBaseSize]
add rax, rdx
add rax, 7
and rax, -8
mov rdx, r8
; rax == array size
; rcx == EEType
; rdx == element count
INLINE_GETTHREAD r10, r8
mov r8, rax
add rax, [r10 + OFFSETOF__Thread__m_alloc_context__alloc_ptr]
jc RhpNewArrayRare
; rax == new alloc ptr
; rcx == EEType
; rdx == element count
; r8 == array size
; r10 == thread
cmp rax, [r10 + OFFSETOF__Thread__m_alloc_context__alloc_limit]
ja RhpNewArrayRare
mov [r10 + OFFSETOF__Thread__m_alloc_context__alloc_ptr], rax
; calc the new object pointer
sub rax, r8
mov [rax + OFFSETOF__Object__m_pEEType], rcx
mov [rax + OFFSETOF__Array__m_Length], edx
ret
ArraySizeOverflow:
; We get here if the size of the final array object can't be represented as an unsigned
; 32-bit value. We're going to tail-call to a managed helper that will throw
; an overflow exception that the caller of this allocator understands.
; rcx holds EEType pointer already
mov edx, 1 ; Indicate that we should throw OverflowException
jmp RhExceptionHandling_FailedAllocation
LEAF_END RhpNewArray, _TEXT
NESTED_ENTRY RhpNewArrayRare, _TEXT
; rcx == EEType
; rdx == element count
; r8 == array size
PUSH_COOP_PINVOKE_FRAME r9
END_PROLOGUE
; r9: transition frame
; Preserve the EEType in RSI
mov rsi, rcx
; Preserve the element count in RBX
mov rbx, rdx
; Preserve the size in RDI
mov rdi, r8
; passing EEType in rcx
xor rdx, rdx ; uFlags
; pasing size in r8
; pasing pTransitionFrame in r9
; Call the rest of the allocation helper.
; void* RhpGcAlloc(EEType *pEEType, UInt32 uFlags, UIntNative cbSize, void * pTransitionFrame)
call RhpGcAlloc
; Set the new object's EEType pointer and length on success.
test rax, rax
jz ArrayOutOfMemory
mov [rax + OFFSETOF__Object__m_pEEType], rsi
mov [rax + OFFSETOF__Array__m_Length], ebx
;; If the object is bigger than RH_LARGE_OBJECT_SIZE, we must publish it to the BGC
cmp rdi, RH_LARGE_OBJECT_SIZE
jb NewArray_SkipPublish
mov rcx, rax ;; rcx: object
mov rdx, rdi ;; rdx: object size
call RhpPublishObject ;; rax: this function returns the object that was passed-in
NewArray_SkipPublish:
POP_COOP_PINVOKE_FRAME
ret
ArrayOutOfMemory:
;; This is the OOM failure path. We're going to tail-call to a managed helper that will throw
;; an out of memory exception that the caller of this allocator understands.
mov rcx, rsi ; EEType pointer
xor edx, edx ; Indicate that we should throw OOM.
POP_COOP_PINVOKE_FRAME
jmp RhExceptionHandling_FailedAllocation
NESTED_END RhpNewArrayRare, _TEXT
END
|
data/pokemon/base_stats/sinnoh/grotle.asm | Dev727/ancientplatinum | 0 | 171529 | db 0 ; 388 DEX NO
db 75, 89, 85, 36, 55, 65
; hp atk def spd sat sdf
db GRASS, GRASS ; type
db 45 ; catch rate
db 141 ; base exp
db NO_ITEM, NO_ITEM ; items
db GENDER_F12_5 ; gender ratio
db 100 ; unknown 1
db 20 ; step cycles to hatch
db 5 ; unknown 2
INCBIN "gfx/pokemon/sinnoh/grotle/front.dimensions"
db 0, 0, 0, 0 ; padding
db GROWTH_MEDIUM_SLOW ; growth rate
dn EGG_MONSTER, EGG_PLANT ; egg groups
; tm/hm learnset
tmhm
; end
|
lcd/last_ly_ly_change/main.asm | AntonioND/gbc-hw-tests | 6 | 6542 |
INCLUDE "hardware.inc"
INCLUDE "header.inc"
SECTION "var",BSS
repeat_loop: DS 1
sram_ptr: DS 2 ; MSB first
SECTION "Main",HOME
;--------------------------------------------------------------------------
;- Main() -
;--------------------------------------------------------------------------
Main:
ld a,$0A
ld [$0000],a ; enable ram
ld a,$A0
ld [sram_ptr+0],a
ld a,$00
ld [sram_ptr+1],a
ld a,LCDCF_ON
ld [rLCDC],a
ld a,[Init_Reg_A]
cp a,$11
jr nz,.skip1
ld a,0
ld [repeat_loop],a
call CPU_slow
.skip1:
.repeat_all:
; -------------------------------------------------------
VBL_TEST : MACRO
di
ld b,130
call wait_ly
ld a,152
ld [rLYC],a
ld a,STATF_LYC
ld [rSTAT],a
ld a,IEF_LCDC
ld [rIE],a
xor a,a
ld [rIF],a
ld bc,\1
call irq_set_LCD
ei
halt
ENDM
VBL_TEST VBL_INT_HANDLER_0
VBL_TEST VBL_INT_HANDLER_1
VBL_TEST VBL_INT_HANDLER_2
VBL_TEST VBL_INT_HANDLER_3
VBL_TEST VBL_INT_HANDLER_4
VBL_TEST VBL_INT_HANDLER_5
VBL_TEST VBL_INT_HANDLER_6
VBL_TEST VBL_INT_HANDLER_7
VBL_TEST VBL_INT_HANDLER_8
VBL_TEST VBL_INT_HANDLER_9
VBL_TEST VBL_INT_HANDLER_10
VBL_TEST VBL_INT_HANDLER_11
VBL_TEST VBL_INT_HANDLER_12
VBL_TEST VBL_INT_HANDLER_13
VBL_TEST VBL_INT_HANDLER_14
VBL_TEST VBL_INT_HANDLER_15
VBL_TEST VBL_INT_HANDLER_GBC_0
VBL_TEST VBL_INT_HANDLER_GBC_1
VBL_TEST VBL_INT_HANDLER_GBC_2
VBL_TEST VBL_INT_HANDLER_GBC_3
VBL_TEST VBL_INT_HANDLER_GBC_4
VBL_TEST VBL_INT_HANDLER_GBC_5
VBL_TEST VBL_INT_HANDLER_GBC_6
VBL_TEST VBL_INT_HANDLER_GBC_7
VBL_TEST VBL_INT_HANDLER_GBC_8
VBL_TEST VBL_INT_HANDLER_GBC_9
VBL_TEST VBL_INT_HANDLER_GBC_10
VBL_TEST VBL_INT_HANDLER_GBC_11
VBL_TEST VBL_INT_HANDLER_GBC_12
VBL_TEST VBL_INT_HANDLER_GBC_13
VBL_TEST VBL_INT_HANDLER_GBC_14
VBL_TEST VBL_INT_HANDLER_GBC_15
; -------------------------------------------------------
ld a,[sram_ptr+0]
ld h,a
ld a,[sram_ptr+1]
ld l,a
ld [hl],$12
inc hl
ld [hl],$34
inc hl
ld [hl],$56
inc hl
ld [hl],$78
; -------------------------------------------------------
ld a,[Init_Reg_A]
cp a,$11
jr nz,.dontchange
ld a,[repeat_loop]
and a,a
jr nz,.dontchange
; -------------------------------------------------------
call CPU_fast
ld a,1
ld [repeat_loop],a
jp .repeat_all
.dontchange:
; -------------------------------------------------------
ld a,$00
ld [$0000],a ; disable ram
call screen_off
ld a,$80
ld [rNR52],a
ld a,$FF
ld [rNR51],a
ld a,$77
ld [rNR50],a
ld a,$C0
ld [rNR11],a
ld a,$E0
ld [rNR12],a
ld a,$00
ld [rNR13],a
ld a,$87
ld [rNR14],a
.endloop:
halt
jr .endloop
; --------------------------------------------------------------
SECTION "functions",ROMX,BANK[1]
VBL_INT_HANDLER_MACRO : MACRO
REPT 10
push de
pop de
ENDR
REPT \1
nop
ENDR
ld a,[rLY]
ld b,a
ld a,[sram_ptr+0]
ld h,a
ld a,[sram_ptr+1]
ld l,a
ld [hl],b
inc hl
ld a,h
ld [sram_ptr+0],a
ld a,l
ld [sram_ptr+1],a
ret
ENDM
VBL_INT_HANDLER_0:
VBL_INT_HANDLER_MACRO 0
VBL_INT_HANDLER_1:
VBL_INT_HANDLER_MACRO 1
VBL_INT_HANDLER_2:
VBL_INT_HANDLER_MACRO 2
VBL_INT_HANDLER_3:
VBL_INT_HANDLER_MACRO 3
VBL_INT_HANDLER_4:
VBL_INT_HANDLER_MACRO 4
VBL_INT_HANDLER_5:
VBL_INT_HANDLER_MACRO 5
VBL_INT_HANDLER_6:
VBL_INT_HANDLER_MACRO 6
VBL_INT_HANDLER_7:
VBL_INT_HANDLER_MACRO 7
VBL_INT_HANDLER_8:
VBL_INT_HANDLER_MACRO 8
VBL_INT_HANDLER_9:
VBL_INT_HANDLER_MACRO 9
VBL_INT_HANDLER_10:
VBL_INT_HANDLER_MACRO 10
VBL_INT_HANDLER_11:
VBL_INT_HANDLER_MACRO 11
VBL_INT_HANDLER_12:
VBL_INT_HANDLER_MACRO 12
VBL_INT_HANDLER_13:
VBL_INT_HANDLER_MACRO 13
VBL_INT_HANDLER_14:
VBL_INT_HANDLER_MACRO 14
VBL_INT_HANDLER_15:
VBL_INT_HANDLER_MACRO 15
VBL_INT_HANDLER_GBC_MACRO : MACRO
REPT 26
push de
pop de
ENDR
REPT \1
nop
ENDR
ld a,[rLY]
ld b,a
ld a,[sram_ptr+0]
ld h,a
ld a,[sram_ptr+1]
ld l,a
ld [hl],b
inc hl
ld a,h
ld [sram_ptr+0],a
ld a,l
ld [sram_ptr+1],a
ret
ENDM
VBL_INT_HANDLER_GBC_0:
VBL_INT_HANDLER_GBC_MACRO 0
VBL_INT_HANDLER_GBC_1:
VBL_INT_HANDLER_GBC_MACRO 1
VBL_INT_HANDLER_GBC_2:
VBL_INT_HANDLER_GBC_MACRO 2
VBL_INT_HANDLER_GBC_3:
VBL_INT_HANDLER_GBC_MACRO 3
VBL_INT_HANDLER_GBC_4:
VBL_INT_HANDLER_GBC_MACRO 4
VBL_INT_HANDLER_GBC_5:
VBL_INT_HANDLER_GBC_MACRO 5
VBL_INT_HANDLER_GBC_6:
VBL_INT_HANDLER_GBC_MACRO 6
VBL_INT_HANDLER_GBC_7:
VBL_INT_HANDLER_GBC_MACRO 7
VBL_INT_HANDLER_GBC_8:
VBL_INT_HANDLER_GBC_MACRO 8
VBL_INT_HANDLER_GBC_9:
VBL_INT_HANDLER_GBC_MACRO 9
VBL_INT_HANDLER_GBC_10:
VBL_INT_HANDLER_GBC_MACRO 10
VBL_INT_HANDLER_GBC_11:
VBL_INT_HANDLER_GBC_MACRO 11
VBL_INT_HANDLER_GBC_12:
VBL_INT_HANDLER_GBC_MACRO 12
VBL_INT_HANDLER_GBC_13:
VBL_INT_HANDLER_GBC_MACRO 13
VBL_INT_HANDLER_GBC_14:
VBL_INT_HANDLER_GBC_MACRO 14
VBL_INT_HANDLER_GBC_15:
VBL_INT_HANDLER_GBC_MACRO 15
; --------------------------------------------------------------
|
gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/boolean_expr1.adb | best08618/asylo | 7 | 8642 | -- PR middle-end/36554
-- Origin: <NAME> <<EMAIL>>
-- { dg-do compile }
-- { dg-options "-O2" }
package body Boolean_Expr1 is
function Long_Float_Is_Valid (X : in Long_Float) return Boolean is
Is_Nan : constant Boolean := X /= X;
Is_P_Inf : constant Boolean := X > Long_Float'Last;
Is_M_Inf : constant Boolean := X < Long_Float'First;
Is_Invalid : constant Boolean := Is_Nan or Is_P_Inf or Is_M_Inf;
begin
return not Is_Invalid;
end Long_Float_Is_Valid;
function S (V : in Long_Float) return String is
begin
if not Long_Float_Is_Valid (V) then
return "INVALID";
else
return "OK";
end if;
exception
when others =>
return "ERROR";
end S;
end Boolean_Expr1;
|
models/mondex/cop.als | transclosure/Amalgam | 4 | 1482 | module mondex/cop
open mondex/cw as mondexCW
open mondex/c as mondexC
open mondex/common as mondexCOMMON
-- 2006-07-12 DONE
pred COp (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
m_in in s.ether
p in s.conAuthPurse
s'.conAuthPurse = s.conAuthPurse
XiConPurse [s, s', s.conAuthPurse - p]
s'.archive = s.archive
s'.ether in s.ether + m_out
}
pred CIgnore (s, s' : ConWorld, m_out : MESSAGE) {
s'.conAuthPurse = s.conAuthPurse
XiConPurse [s, s', s.conAuthPurse]
s'.archive = s.archive
s'.ether = s.ether
m_out = bottom
}
pred CIncrease (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or {
COp [s, s', p, m_in, m_out]
IncreasePurseOkay [s, s', p, m_out]
}
}
pred CAbort (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or {
COp [s, s', p, m_in, m_out]
AbortPurseOkay [s, s', p]
m_out = bottom
}
}
pred CStartFrom (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or CAbort [s, s', p, m_in, m_out] or {
COp [s, s', p, m_in, m_out]
StartFromPurseOkay [s, s', p, m_in, m_out]
}
}
pred CStartTo (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or CAbort [s, s', p, m_in, m_out] or {
COp [s, s', p, m_in, m_out]
StartToPurseOkay [s, s', p, m_in, m_out]
}
}
pred CReq (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or {
COp [s, s', p, m_in, m_out]
ReqPurseOkay [s, s', p, m_in, m_out]
}
}
pred CVal (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or {
COp [s, s', p, m_in, m_out]
ValPurseOkay [s, s', p, m_in, m_out]
}
}
pred CAck (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or {
COp [s, s', p, m_in, m_out]
AckPurseOkay [s, s', p, m_in, m_out]
}
}
pred CReadExceptionLog (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or CAbort [s, s', p, m_in, m_out] or {
COp [s, s', p, m_in, m_out]
ReadExceptionLogPurseOkay [s, s', p, m_in, m_out]
}
}
pred CClearExceptionLog (s, s' :ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or CAbort [s, s', p, m_in, m_out] or {
COp [s, s', p, m_in, m_out]
ClearExceptionLogPurseOkay [s, s', p, m_in, m_out]
}
}
pred CAuthorizeExLogClearOkay (s, s' : ConWorld, p : ConPurse, m_out : MESSAGE) {
XiConPurse [s, s', p]
m_out in exceptionLogClear
~(m_out <: name).pds in s.archive
m_out.(exceptionLogClear <: name) = p
}
pred CAuthorizeExLogClear (s, s' : ConWorld, p : ConPurse, m_in, m_out : MESSAGE) {
CIgnore [s, s', m_out] or {
COp [s, s', p, m_in, m_out]
CAuthorizeExLogClearOkay [s, s', p, m_out]
}
}
pred CArchive (s, s' : ConWorld, m_out : MESSAGE) {
s'.conAuthPurse = s.conAuthPurse
XiConPurse [s, s', s.conAuthPurse]
s'.ether in s.ether
s.archive in s'.archive
s'.archive in s.archive + ~(s.ether <: name).details
m_out = bottom
}
-- model consistency
-- totality
assert CTotal {
all c : ConWorld, m_in : MESSAGE, p : ConPurse | Concrete [c] implies {
CIgnore [c, c, bottom]
CIncrease [c, c, p, m_in, bottom]
CAbort [c, c, p, m_in, bottom]
CStartFrom [c, c, p, m_in, bottom]
CStartTo [c, c, p, m_in, bottom]
CReq [c, c, p, m_in, bottom]
CVal [c, c, p, m_in, bottom]
CAck [c, c, p, m_in, bottom]
CReadExceptionLog [c, c, p, m_in, bottom]
CClearExceptionLog [c, c, p, m_in, bottom]
CAuthorizeExLogClear [c, c, p, m_in, bottom]
CArchive [c, c, bottom]
}
}
check CTotal for 10 -- 0:57 (minisat)
|
source/action_algorithms.adb | jquorning/CELLE | 0 | 18224 | --
--
--
with Types;
package body Action_Algorithms is
function Compute_Action (Session : Session_Type;
Action : Action_Record)
return Integer
is
use Actions;
use type Types.Symbol_Index;
State_Num : constant Integer := Integer (Action.X.State.Number);
Min_Reduce : constant Integer := Integer (Session.Min_Reduce);
Min_SR : constant Integer := Integer (Session.Min_Shift_Reduce);
Rule_Number : constant Integer := Integer (Action.X.Rule.Number);
begin
case Action.Kind is
when Shift =>
return State_Num;
when Shift_Reduce =>
-- Since a SHIFT is inherient after a prior REDUCE, convert any
-- SHIFTREDUCE action with a nonterminal on the LHS into a simple
-- REDUCE action:
if Action.Symbol.Index >= Session.Num_Terminal then
return Min_Reduce + Rule_Number;
else
return Min_SR + Rule_Number;
end if;
when Reduce => return Min_Reduce + Rule_Number;
when Error => return Integer (Session.Err_Action);
when C_Accept => return Integer (Session.Acc_Action);
when others => return -1;
end case;
end Compute_Action;
end Action_Algorithms;
|
playingMedia.applescript | Deph0/CSP-applescript | 0 | 2872 | -- Main flow
tell application "Finder" to set current_path to container of (path to me) as string
set current_path to POSIX path of current_path
repeat -- repeats until quited (ctrl/cmd+c)
set currentlyPlayingTrack to getCurrentlyPlayingTrack(getPlayingMedia())
do shell script "echo " & quoted form of currentlyPlayingTrack & " > " & current_path & "CurrentSongPlaying.txt"
end repeat
-- Debug/WIP testing;
--set currentlyPlayingTrack to getCurrentlyPlayingTrack(getPlayingMedia())
--do shell script "echo '" & currentlyPlayingTrack & "' > $HOME/Desktop/CurrentSongPlaying.txt"
--display dialog "Currently playing on " & getPlayingMedia() & ": " & currentlyPlayingTrack
--display notification "Currently playing on " & getPlayingMedia() & ": " & currentlyPlayingTrack
-- find out which app is playing music.
-- if multiple is playing at the same time,
-- the last one will be picked in the function.
on getPlayingMedia()
set playing to ""
if getStateOfMedia("iTunes") then set playing to "iTunes"
if getStateOfMedia("Spotify") then set playing to "Spotify"
if playing is equal to "" then
set playing to "Nothing is playing"
end if
return playing
end getPlayingMedia
-- Method to get the currently playing track
on getCurrentlyPlayingTrack(appName)
if appName is equal to "Spotify" then
tell application "Spotify"
set currentArtist to artist of current track as string
set currentTrack to name of current track as string
return currentArtist & " - " & currentTrack
end tell
else if appName is equal to "iTunes" then
tell application "iTunes"
-- check if we're listening to a radiostation otherwise get info from track
set current to current stream title
if current is missing value then
set current to name of current track
end if
return current
end tell
end if
end getCurrentlyPlayingTrack
-- helper function to tell if application is running
on is_running(appName)
tell application "System Events" to (name of processes) contains appName
end is_running
-- check if application is playing music
on getStateOfMedia(appName)
set is_playing to false
if is_running(appName) then
--tell application appName to set mediaState to (player state as text)
-- workaround because 'tell application appName' doesn't work.
set theScript to "tell application \"" & appName & "\" to return player state"
set mediaState to (do shell script "osascript -e " & quoted form of theScript)
-- thanks to red_menace from #applescript @ freenode IRC for this solution.
if mediaState is equal to "playing" then
set is_playing to true
end if
end if
return is_playing
end getStateOfMedia
|
Transynther/x86/_processed/US/_zr_/i9-9900K_12_0xca_notsx.log_10_1771.asm | ljhsiun2/medusa | 9 | 17029 | <filename>Transynther/x86/_processed/US/_zr_/i9-9900K_12_0xca_notsx.log_10_1771.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r13
push %r14
push %r8
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x11bfe, %rbx
nop
nop
nop
nop
add $54691, %rdi
movups (%rbx), %xmm7
vpextrq $1, %xmm7, %r8
nop
nop
nop
nop
cmp $54376, %r12
lea addresses_normal_ht+0x1b5ae, %r13
nop
nop
nop
nop
xor $751, %rdi
mov (%r13), %ecx
nop
nop
nop
nop
add $15078, %r8
lea addresses_WC_ht+0x87ae, %rbx
nop
nop
nop
nop
xor $27495, %rcx
movb (%rbx), %r8b
nop
nop
nop
sub $10189, %rcx
lea addresses_D_ht+0xfbae, %rsi
lea addresses_normal_ht+0x11d0c, %rdi
and %r14, %r14
mov $8, %rcx
rep movsl
nop
cmp %r12, %r12
lea addresses_WT_ht+0x1174e, %rsi
lea addresses_WT_ht+0x131ee, %rdi
clflush (%rdi)
and $29868, %r12
mov $75, %rcx
rep movsw
nop
nop
add %r8, %r8
lea addresses_A_ht+0x86ae, %r13
nop
nop
nop
and %rbx, %rbx
movl $0x61626364, (%r13)
nop
nop
nop
cmp $33356, %r12
lea addresses_WT_ht+0x45be, %r13
nop
nop
nop
nop
cmp %rcx, %rcx
mov (%r13), %r12w
nop
nop
sub $64263, %rsi
lea addresses_A_ht+0xbc37, %rcx
nop
nop
and $64763, %rdi
movl $0x61626364, (%rcx)
nop
nop
nop
nop
nop
and $45535, %r8
lea addresses_UC_ht+0x27ae, %rcx
nop
nop
and %rdi, %rdi
movw $0x6162, (%rcx)
xor %r13, %r13
lea addresses_UC_ht+0x416e, %rdi
nop
nop
cmp $49043, %r8
mov $0x6162636465666768, %r14
movq %r14, %xmm6
and $0xffffffffffffffc0, %rdi
vmovaps %ymm6, (%rdi)
dec %r8
lea addresses_UC_ht+0x11130, %r8
nop
nop
dec %rsi
movb $0x61, (%r8)
nop
nop
nop
nop
nop
add $9126, %r8
lea addresses_WC_ht+0x4bae, %r12
nop
nop
nop
nop
nop
inc %r13
movl $0x61626364, (%r12)
nop
nop
nop
nop
nop
lfence
lea addresses_UC_ht+0xa4ea, %r8
nop
nop
xor $30482, %rdi
movl $0x61626364, (%r8)
nop
nop
nop
cmp $24302, %rsi
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %r8
pop %r14
pop %r13
pop %r12
ret
.global s_faulty_load
s_faulty_load:
push %r11
push %r12
push %r14
push %r9
push %rbx
push %rsi
// Faulty Load
lea addresses_US+0x1ebae, %r14
nop
nop
nop
nop
nop
xor $43263, %rbx
movups (%r14), %xmm3
vpextrq $0, %xmm3, %r9
lea oracles, %rbx
and $0xff, %r9
shlq $12, %r9
mov (%rbx,%r9,1), %r9
pop %rsi
pop %rbx
pop %r9
pop %r14
pop %r12
pop %r11
ret
/*
<gen_faulty_load>
[REF]
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_US', 'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 0}}
[Faulty Load]
{'OP': 'LOAD', 'src': {'same': True, 'type': 'addresses_US', 'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 0}}
<gen_prepare_buffer>
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_A_ht', 'NT': False, 'AVXalign': False, 'size': 16, 'congruent': 1}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_normal_ht', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 8}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_WC_ht', 'NT': False, 'AVXalign': True, 'size': 1, 'congruent': 10}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 8, 'type': 'addresses_D_ht'}, 'dst': {'same': False, 'congruent': 1, 'type': 'addresses_normal_ht'}}
{'OP': 'REPM', 'src': {'same': False, 'congruent': 5, 'type': 'addresses_WT_ht'}, 'dst': {'same': False, 'congruent': 6, 'type': 'addresses_WT_ht'}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_A_ht', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 2}}
{'OP': 'LOAD', 'src': {'same': False, 'type': 'addresses_WT_ht', 'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 2}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_A_ht', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 0}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_UC_ht', 'NT': False, 'AVXalign': False, 'size': 2, 'congruent': 10}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_UC_ht', 'NT': True, 'AVXalign': True, 'size': 32, 'congruent': 6}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_UC_ht', 'NT': False, 'AVXalign': True, 'size': 1, 'congruent': 1}}
{'OP': 'STOR', 'dst': {'same': False, 'type': 'addresses_WC_ht', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 11}}
{'OP': 'STOR', 'dst': {'same': True, 'type': 'addresses_UC_ht', 'NT': False, 'AVXalign': False, 'size': 4, 'congruent': 1}}
{'00': 10}
00 00 00 00 00 00 00 00 00 00
*/
|
Multidimensional/Data/DirNum.agda | wrrnhttn/agda-cubical-multidimensional | 0 | 14071 | {-# OPTIONS --cubical #-}
module Multidimensional.Data.DirNum where
open import Multidimensional.Data.DirNum.Base public
open import Multidimensional.Data.DirNum.Properties public
|
tests/syntax_examples/src/basic_subprogram_calls-p4.adb | TNO/Dependency_Graph_Extractor-Ada | 1 | 24396 | separate(Basic_Subprogram_Calls)
procedure P4 is
begin
P3;
end P4;
|
monalynx/monaload.asm | 42Bastian/lynx_hacking | 12 | 168108 | ***************
* Lynx port of "MONA"
* Loader for LNX
****************
include <includes/hardware.inc>
include <macros/help.mac>
;;; ROM sets this address
screen0 equ $2000
BEGIN_ZP
path_length ds 1
plot_color ds 1
plot_x ds 1
plot_y ds 1
seed ds 4
dir ds 1
ptr ds 2
tmp ds 1
END_ZP
mona equ $231
RUN $200
Start::
//-> ldy #2 // y = 2 from ROM
.pal
lda colors_g,y
sta $fda1,y
lda colors_br,y
sta $fdb1,y
dey
bpl .pal
iny
inx
.load
lda RCART0
.store
sta mona,y
iny
bne .load
inc .store+2
dex
bpl .load
;; Code moved from monalynx.asm to fill up to 49
stz MATHE_E
lda #$7e
sta seed+3
bra mona
colors_g:
dc.b $06
colors_br:
dc.b $0a
dc.b $4e
dc.b $8e
mask: dc.b $b7,$1d,$c1,$04
End::
size set End-Start
free set 49-size
echo "Free %Dfree"
IF free != 0
echo "Size must be == 49!"
ENDIF
dc.b $00 ; end mark!
|
test/Succeed/Issue3400.agda | shlevy/agda | 1,989 | 8467 | module _ where
module M₁ where
record R : Set₂ where
field
_A : Set₁
open R
-- The following code used to be syntactically incorrect, because
-- the left-hand side could be parsed either as the function r
-- applied to a pattern variable, or as the copattern _A applied
-- to r. Now the former interpretation is ruled out.
r : R
r A = Set
module M₂ where
record R : Set₂ where
field
_A : Set₁
open R
data D : Set where
d_A : D
-- Name parts coming from constructors can be used as part of
-- copatterns.
r : R
r A = Set
module M₃ where
data D₂ : Set where
c : D₂
record R₂ : Set₁ where
field
f_c : Set
open R₂
-- Name parts coming from projections can be used as part of
-- constructor patterns.
F : D₂ → Set₁
F c = Set
|
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cc/cc3004a.ada | best08618/asylo | 7 | 10309 | <gh_stars>1-10
-- CC3004A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT ACTUAL PARAMETERS IN A NAMED GENERIC ACTUAL PARAMETER
-- ASSOCIATION MAY BE OUT OF ORDER, AND ARE ASSOCIATED WITH THE
-- CORRECT FORMALS.
-- DAT 9/16/81
-- SPS 10/26/82
WITH REPORT; USE REPORT;
PROCEDURE CC3004A IS
BEGIN
TEST ("CC3004A", "ORDER OF NAMED GENERIC ACTUAL PARAMETERS");
DECLARE
GENERIC
A,B : INTEGER;
C : INTEGER;
D : INTEGER;
PACKAGE P1 IS END P1;
TYPE AI IS ACCESS INTEGER;
GENERIC
TYPE D IS ( <> );
VD : D;
TYPE AD IS ACCESS D;
VA : AD;
PACKAGE P2 IS END P2;
X : AI := NEW INTEGER '(IDENT_INT(23));
Y : AI := NEW INTEGER '(IDENT_INT(77));
PACKAGE BODY P1 IS
BEGIN
IF A /= IDENT_INT(4) OR
B /= IDENT_INT(12) OR
C /= IDENT_INT(11) OR
D /= IDENT_INT(-33)
THEN
FAILED ("WRONG GENERIC PARAMETER ASSOCIATIONS");
END IF;
END P1;
PACKAGE BODY P2 IS
BEGIN
IF VA.ALL /= VD THEN
FAILED ("WRONG GENERIC PARM ASSOCIATIONS 2");
END IF;
END P2;
PACKAGE N1 IS NEW P1 (C => 11, A => 4, D => -33, B => 12);
PACKAGE N2 IS NEW P2 (VA => X, AD => AI, D => INTEGER,
VD => 23);
PACKAGE N3 IS NEW P2 (INTEGER, 77, VA => Y, AD => AI);
BEGIN
NULL;
END;
RESULT;
END CC3004A;
|
src/archive_searcher.ads | egilhh/Futures-in-Ada | 1 | 7810 | <filename>src/archive_searcher.ads
package Archive_Searcher is
type Object is tagged null record;
function Search
(Self : in out Object;
Search_For : in String)
return String;
end Archive_Searcher;
|
source/streams/machine-pc-linux-gnu/s-naiona.adb | ytomino/drake | 33 | 9293 | <filename>source/streams/machine-pc-linux-gnu/s-naiona.adb
with Ada.Exception_Identification.From_Here;
with Ada.Exceptions.Finally;
with System.Address_To_Named_Access_Conversions;
with System.Formatting;
with System.Growth;
with System.Long_Long_Integer_Types;
with System.Zero_Terminated_Strings;
with C.stdlib;
with C.sys.types;
with C.unistd;
package body System.Native_IO.Names is
use Ada.Exception_Identification.From_Here;
use type C.char;
use type C.char_ptr;
use type C.size_t;
use type C.signed_long; -- ssize_t in 64bit Linux
subtype Word_Unsigned is Long_Long_Integer_Types.Word_Unsigned;
package Name_Pointer_Conv is
new Address_To_Named_Access_Conversions (Name_Character, Name_Pointer);
proc_self_fd : constant C.char_array (0 .. 13) := "/proc/self/fd/";
-- implementation
procedure Open_Ordinary (
Method : Open_Method;
Handle : aliased out Handle_Type;
Mode : File_Mode;
Name : String;
Out_Name : aliased out Name_Pointer;
Form : Packed_Form)
is
C_Name : aliased Name_String (
0 .. Name'Length * Zero_Terminated_Strings.Expanding);
begin
Zero_Terminated_Strings.To_C (Name, C_Name (0)'Access);
Open_Ordinary (Method, Handle, Mode, C_Name (0)'Unchecked_Access, Form);
Out_Name := null;
end Open_Ordinary;
procedure Get_Full_Name (
Handle : Handle_Type;
Has_Full_Name : in out Boolean;
Name : in out Name_Pointer;
Is_Standard : Boolean;
Raise_On_Error : Boolean)
is
package Holder is
new Ada.Exceptions.Finally.Scoped_Holder (Name_Pointer, Free);
Link : aliased C.char_array (0 .. 14 + Handle_Type'Width);
New_Name_Capacity : C.sys.types.ssize_t := 1024;
New_Name_Length : C.size_t;
New_Name : aliased Name_Pointer :=
Name_Pointer_Conv.To_Pointer (
Address (C.stdlib.malloc (C.size_t (New_Name_Capacity))));
begin
Holder.Assign (New_Name);
Link (0 .. 13) := proc_self_fd;
declare
Link_As_String : String (1 .. Link'Length);
for Link_As_String'Address use Link'Address;
Last : Natural;
Error : Boolean;
begin
Formatting.Image (
Word_Unsigned (Handle),
Link_As_String (proc_self_fd'Length + 1 .. Link_As_String'Last),
Last,
Error => Error);
Link (C.size_t (Last)) := C.char'Val (0);
end;
loop
declare
S_Length : C.sys.types.ssize_t;
begin
S_Length :=
C.unistd.readlink (
Link (0)'Access,
New_Name,
C.size_t (New_Name_Capacity - 1)); -- reserving for NUL
if S_Length < 0 then
-- Failed, keep Has_Full_Name and Name.
if Raise_On_Error then
Raise_Exception (Use_Error'Identity);
end if;
return; -- error
end if;
if S_Length < New_Name_Capacity then
New_Name_Length := C.size_t (S_Length);
exit; -- success
end if;
end;
-- growth
declare
function Grow is new Growth.Fast_Grow (C.sys.types.ssize_t);
begin
New_Name_Capacity := Grow (New_Name_Capacity);
end;
declare
New_New_Name : constant Name_Pointer :=
Name_Pointer_Conv.To_Pointer (
Address (
C.stdlib.realloc (
C.void_ptr (
Name_Pointer_Conv.To_Address (New_Name)),
C.size_t (New_Name_Capacity))));
begin
if New_New_Name = null then
-- Failed, keep Has_Full_Name and Name.
if Raise_On_Error then
raise Storage_Error;
end if;
return; -- error
end if;
New_Name := New_New_Name;
end;
end loop;
-- Succeeded.
if New_Name.all /= '/' then
-- For example, a pipe's name is like "pipe:[N]".
declare
New_New_Name : constant Name_Pointer :=
Name_Pointer_Conv.To_Pointer (
Address (
C.stdlib.realloc (
C.void_ptr (Name_Pointer_Conv.To_Address (New_Name)),
C.size_t (New_Name_Length + 2)))); -- '*' & NUL
begin
if New_New_Name = null then
-- Failed, keep Has_Full_Name and Name.
if Raise_On_Error then
raise Storage_Error;
end if;
return; -- error
end if;
New_Name := New_New_Name;
end;
New_Name_Length := New_Name_Length + 1; -- '*'
declare
New_Name_All : C.char_array (0 .. New_Name_Length); -- NUL
for New_Name_All'Address use
Name_Pointer_Conv.To_Address (New_Name);
begin
New_Name_All (1 .. New_Name_Length - 1) :=
New_Name_All (0 .. New_Name_Length - 2);
New_Name_All (0) := '*';
end;
end if;
declare -- append NUL
New_Name_All : C.char_array (0 .. New_Name_Length); -- NUL
for New_Name_All'Address use
Name_Pointer_Conv.To_Address (New_Name);
begin
New_Name_All (New_Name_Length) := C.char'Val (0);
end;
if not Is_Standard then
Free (Name); -- External or External_No_Close
end if;
Name := New_Name;
Has_Full_Name := True;
Holder.Clear;
end Get_Full_Name;
end System.Native_IO.Names;
|
notification.scpt | jmmander/Google-Calendar-Conflict-Detector | 0 | 2195 | <filename>notification.scpt<gh_stars>0
on run
display notification "You have a conflict on your calendar tomorrow" with title "Calendar Conflict" sound name "glass"
end run
|
ch14/test14.asm | zzb610/asm-learn | 0 | 164171 | <reponame>zzb610/asm-learn
assume cs:code
code segment
start:
mov si, 0
; year
mov dl, 9
call show_time
mov al, '/'
mov byte ptr es:[160*12 + 40*2 + 4 + si], al
add si, 6
; month
mov dl, 8
call show_time
mov al, '/'
mov byte ptr es:[160*12 + 40*2 + 4 + si], al
add si, 6
; day
mov dl, 7
call show_time
mov al, '/'
mov byte ptr es:[160*12 + 40*2 + 4 + si], al
add si, 8
; hour
mov dx, 4
call show_time
mov al, ':'
mov byte ptr es:[160*12 + 40*2 + 4 + si], al
add si, 6
; minute
mov dx, 2
call show_time
mov al, ':'
mov byte ptr es:[160*12 + 40*2 + 4 + si], al
add si, 6
; second
mov dx, 0
call show_time
mov ax, 4c00H
int 21H
show_time:
; dl time location
; si display location
push ax
push bx
push cx
push dx
mov al, dl
out 70H, al
in al, 71H
mov ah, al
mov cl, 4
shr ah, cl
and al, 00001111b
add ah, 30H
add al, 30H
mov bx, 0b800H
mov es, bx
mov byte ptr es:[160*12 + 40*2 + si], ah
mov byte ptr es:[160*12 + 40*2 + 2 + si], al
pop dx
pop cx
pop ax
pop bx
ret
code ends
end start
|
Definition/Conversion/Weakening.agda | Vtec234/logrel-mltt | 0 | 8234 | {-# OPTIONS --without-K --safe #-}
module Definition.Conversion.Weakening where
open import Definition.Untyped as U hiding (wk)
open import Definition.Untyped.Properties
open import Definition.Typed
open import Definition.Typed.Weakening
open import Definition.Typed.Consequences.Syntactic
open import Definition.Conversion
open import Definition.Conversion.Soundness
import Tools.PropositionalEquality as PE
open import Tools.Product
mutual
-- Weakening of algorithmic equality of neutrals.
wk~↑ : ∀ {ρ t u A Γ Δ} ([ρ] : ρ ∷ Δ ⊆ Γ) → ⊢ Δ
→ Γ ⊢ t ~ u ↑ A
→ Δ ⊢ U.wk ρ t ~ U.wk ρ u ↑ U.wk ρ A
wk~↑ {ρ} [ρ] ⊢Δ (var-refl x₁ x≡y) = var-refl (wkTerm [ρ] ⊢Δ x₁) (PE.cong (wkVar ρ) x≡y)
wk~↑ ρ ⊢Δ (app-cong {G = G} t~u x) =
PE.subst (λ x → _ ⊢ _ ~ _ ↑ x) (PE.sym (wk-β G))
(app-cong (wk~↓ ρ ⊢Δ t~u) (wkConv↑Term ρ ⊢Δ x))
wk~↑ ρ ⊢Δ (fst-cong p~r) =
fst-cong (wk~↓ ρ ⊢Δ p~r)
wk~↑ ρ ⊢Δ (snd-cong {G = G} p~r) =
PE.subst (λ x → _ ⊢ _ ~ _ ↑ x)
(PE.sym (wk-β G))
(snd-cong (wk~↓ ρ ⊢Δ p~r))
wk~↑ {ρ} {Δ = Δ} [ρ] ⊢Δ (natrec-cong {k} {l} {h} {g} {a₀} {b₀} {F} {G} x x₁ x₂ t~u) =
PE.subst (λ x → _ ⊢ U.wk ρ (natrec F a₀ h k) ~ _ ↑ x) (PE.sym (wk-β F))
(natrec-cong (wkConv↑ (lift [ρ]) (⊢Δ ∙ ℕⱼ ⊢Δ) x)
(PE.subst (λ x → _ ⊢ _ [conv↑] _ ∷ x) (wk-β F)
(wkConv↑Term [ρ] ⊢Δ x₁))
(PE.subst (λ x → Δ ⊢ U.wk ρ h [conv↑] U.wk ρ g ∷ x)
(wk-β-natrec _ F) (wkConv↑Term [ρ] ⊢Δ x₂))
(wk~↓ [ρ] ⊢Δ t~u))
wk~↑ {ρ} {Δ = Δ} [ρ] ⊢Δ (Emptyrec-cong {k} {l} {F} {G} x t~u) =
Emptyrec-cong (wkConv↑ [ρ] ⊢Δ x) (wk~↓ [ρ] ⊢Δ t~u)
-- Weakening of algorithmic equality of neutrals in WHNF.
wk~↓ : ∀ {ρ t u A Γ Δ} ([ρ] : ρ ∷ Δ ⊆ Γ) → ⊢ Δ
→ Γ ⊢ t ~ u ↓ A
→ Δ ⊢ U.wk ρ t ~ U.wk ρ u ↓ U.wk ρ A
wk~↓ {ρ} [ρ] ⊢Δ ([~] A₁ D whnfA k~l) =
[~] (U.wk ρ A₁) (wkRed* [ρ] ⊢Δ D) (wkWhnf ρ whnfA) (wk~↑ [ρ] ⊢Δ k~l)
-- Weakening of algorithmic equality of types.
wkConv↑ : ∀ {ρ A B Γ Δ} ([ρ] : ρ ∷ Δ ⊆ Γ) → ⊢ Δ
→ Γ ⊢ A [conv↑] B
→ Δ ⊢ U.wk ρ A [conv↑] U.wk ρ B
wkConv↑ {ρ} [ρ] ⊢Δ ([↑] A′ B′ D D′ whnfA′ whnfB′ A′<>B′) =
[↑] (U.wk ρ A′) (U.wk ρ B′) (wkRed* [ρ] ⊢Δ D) (wkRed* [ρ] ⊢Δ D′)
(wkWhnf ρ whnfA′) (wkWhnf ρ whnfB′) (wkConv↓ [ρ] ⊢Δ A′<>B′)
-- Weakening of algorithmic equality of types in WHNF.
wkConv↓ : ∀ {ρ A B Γ Δ} ([ρ] : ρ ∷ Δ ⊆ Γ) → ⊢ Δ
→ Γ ⊢ A [conv↓] B
→ Δ ⊢ U.wk ρ A [conv↓] U.wk ρ B
wkConv↓ ρ ⊢Δ (U-refl x) = U-refl ⊢Δ
wkConv↓ ρ ⊢Δ (ℕ-refl x) = ℕ-refl ⊢Δ
wkConv↓ ρ ⊢Δ (Empty-refl x) = Empty-refl ⊢Δ
wkConv↓ ρ ⊢Δ (Unit-refl x) = Unit-refl ⊢Δ
wkConv↓ ρ ⊢Δ (ne x) = ne (wk~↓ ρ ⊢Δ x)
wkConv↓ ρ ⊢Δ (Π-cong x A<>B A<>B₁) =
let ⊢ρF = wk ρ ⊢Δ x
in Π-cong ⊢ρF (wkConv↑ ρ ⊢Δ A<>B) (wkConv↑ (lift ρ) (⊢Δ ∙ ⊢ρF) A<>B₁)
wkConv↓ ρ ⊢Δ (Σ-cong x A<>B A<>B₁) =
let ⊢ρF = wk ρ ⊢Δ x
in Σ-cong ⊢ρF (wkConv↑ ρ ⊢Δ A<>B) (wkConv↑ (lift ρ) (⊢Δ ∙ ⊢ρF) A<>B₁)
-- Weakening of algorithmic equality of terms.
wkConv↑Term : ∀ {ρ t u A Γ Δ} ([ρ] : ρ ∷ Δ ⊆ Γ) → ⊢ Δ
→ Γ ⊢ t [conv↑] u ∷ A
→ Δ ⊢ U.wk ρ t [conv↑] U.wk ρ u ∷ U.wk ρ A
wkConv↑Term {ρ} [ρ] ⊢Δ ([↑]ₜ B t′ u′ D d d′ whnfB whnft′ whnfu′ t<>u) =
[↑]ₜ (U.wk ρ B) (U.wk ρ t′) (U.wk ρ u′)
(wkRed* [ρ] ⊢Δ D) (wkRed*Term [ρ] ⊢Δ d) (wkRed*Term [ρ] ⊢Δ d′)
(wkWhnf ρ whnfB) (wkWhnf ρ whnft′) (wkWhnf ρ whnfu′)
(wkConv↓Term [ρ] ⊢Δ t<>u)
-- Weakening of algorithmic equality of terms in WHNF.
wkConv↓Term : ∀ {ρ t u A Γ Δ} ([ρ] : ρ ∷ Δ ⊆ Γ) → ⊢ Δ
→ Γ ⊢ t [conv↓] u ∷ A
→ Δ ⊢ U.wk ρ t [conv↓] U.wk ρ u ∷ U.wk ρ A
wkConv↓Term ρ ⊢Δ (ℕ-ins x) =
ℕ-ins (wk~↓ ρ ⊢Δ x)
wkConv↓Term ρ ⊢Δ (Empty-ins x) =
Empty-ins (wk~↓ ρ ⊢Δ x)
wkConv↓Term ρ ⊢Δ (Unit-ins x) =
Unit-ins (wk~↓ ρ ⊢Δ x)
wkConv↓Term {ρ} [ρ] ⊢Δ (ne-ins t u x x₁) =
ne-ins (wkTerm [ρ] ⊢Δ t) (wkTerm [ρ] ⊢Δ u) (wkNeutral ρ x) (wk~↓ [ρ] ⊢Δ x₁)
wkConv↓Term ρ ⊢Δ (univ x x₁ x₂) =
univ (wkTerm ρ ⊢Δ x) (wkTerm ρ ⊢Δ x₁) (wkConv↓ ρ ⊢Δ x₂)
wkConv↓Term ρ ⊢Δ (zero-refl x) = zero-refl ⊢Δ
wkConv↓Term ρ ⊢Δ (suc-cong t<>u) = suc-cong (wkConv↑Term ρ ⊢Δ t<>u)
wkConv↓Term {ρ} {Δ = Δ} [ρ] ⊢Δ (η-eq {F = F} {G = G} x₁ x₂ y y₁ t<>u) =
let ⊢F , _ = syntacticΠ (syntacticTerm x₁)
⊢ρF = wk [ρ] ⊢Δ ⊢F
in η-eq (wkTerm [ρ] ⊢Δ x₁) (wkTerm [ρ] ⊢Δ x₂)
(wkFunction ρ y) (wkFunction ρ y₁)
(PE.subst₃ (λ x y z → Δ ∙ U.wk ρ F ⊢ x [conv↑] y ∷ z)
(PE.cong₂ _∘_ (PE.sym (wk1-wk≡lift-wk1 _ _)) PE.refl)
(PE.cong₂ _∘_ (PE.sym (wk1-wk≡lift-wk1 _ _)) PE.refl)
PE.refl
(wkConv↑Term (lift [ρ]) (⊢Δ ∙ ⊢ρF) t<>u))
wkConv↓Term {ρ} [ρ] ⊢Δ (Σ-η {G = G} ⊢p ⊢r pProd rProd fstConv sndConv) =
Σ-η (wkTerm [ρ] ⊢Δ ⊢p)
(wkTerm [ρ] ⊢Δ ⊢r)
(wkProduct ρ pProd)
(wkProduct ρ rProd)
(wkConv↑Term [ρ] ⊢Δ fstConv)
(PE.subst (λ x → _ ⊢ _ [conv↑] _ ∷ x)
(wk-β G)
(wkConv↑Term [ρ] ⊢Δ sndConv))
wkConv↓Term {ρ} [ρ] ⊢Δ (η-unit [t] [u] tWhnf uWhnf) =
η-unit (wkTerm [ρ] ⊢Δ [t]) (wkTerm [ρ] ⊢Δ [u])
(wkWhnf ρ tWhnf) (wkWhnf ρ uWhnf)
|
src/rejuvenation-text_rewrites.adb | TNO/Rejuvenation-Ada | 1 | 22110 | <reponame>TNO/Rejuvenation-Ada
with Ada.Assertions; use Ada.Assertions;
with Ada.Strings; use Ada.Strings;
-- Debug includes:
-- with Ada.Strings.Fixed; use Ada.Strings.Fixed;
-- with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
with Rejuvenation.File_Utils; use Rejuvenation.File_Utils;
with Rejuvenation.Navigation; use Rejuvenation.Navigation;
package body Rejuvenation.Text_Rewrites is
-- Public: Collect rewrite operation (node) --------
function Prepend
(TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String;
Before : Node_Location := No_Trivia; Charset : String := "")
return Boolean
is
First : constant Positive := Start_Offset (Node, Before);
WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (Text, Charset);
begin
Assert
(Check => TR.Is_Initialized,
Message => "Text Rewrite used uninitialized");
Assert
(Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Node),
Message =>
"Text Rewrite does not contain provided Node - " &
Langkit_Support.Text.Image (Node.Text));
Assert
(Check => TR.First <= First,
Message => "Text Rewrite - prepend before part");
return Replace (TR, First, First - 1, WText);
end Prepend;
function Append
(TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String;
After : Node_Location := No_Trivia; Charset : String := "")
return Boolean
is
Last : constant Positive := End_Offset (Node, After);
WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (Text, Charset);
begin
Assert
(Check => TR.Is_Initialized,
Message => "Text Rewrite used uninitialized");
Assert
(Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Node),
Message =>
"Text Rewrite Node does not contain provided Node - " &
Langkit_Support.Text.Image (Node.Text));
Assert
(Check => Last <= TR.Last,
Message => "Text Rewrite - append after part");
return Replace (TR, Last + 1, Last, WText);
end Append;
procedure Remove
(TR : in out Text_Rewrite; Node : Ada_Node'Class;
Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia)
is
Dummy : Boolean;
begin
Dummy := TR.Remove (Node, Before, After);
end Remove;
procedure Prepend
(TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String;
Before : Node_Location := No_Trivia; Charset : String := "")
is
Dummy : Boolean;
begin
Dummy := TR.Prepend (Node, Text, Before, Charset);
end Prepend;
procedure Append
(TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String;
After : Node_Location := No_Trivia; Charset : String := "")
is
Dummy : Boolean;
begin
Dummy := TR.Append (Node, Text, After, Charset);
end Append;
procedure Replace
(TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String;
Before, After : Node_Location := No_Trivia; Charset : String := "")
is
Dummy : Boolean;
begin
Dummy := TR.Replace (Node, Text, Before, After, Charset);
end Replace;
procedure Restore (TR : in out Text_Rewrite; Node : Ada_Node'Class) is
Dummy : Boolean;
begin
Dummy := TR.Restore (Node);
end Restore;
procedure ReplaceAround
(TR : in out Text_Rewrite; Node : Ada_Node'Class; Before_Text : String;
Innernode : Ada_Node'Class; After_Text : String;
Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia;
Charset : String := "")
is
NodeStartOffset : constant Positive := Start_Offset (Node, Before);
NodeEndOffset : constant Positive := End_Offset (Node, After);
InnernodeStartOffset : constant Positive :=
Start_Offset (Innernode, Before);
InnernodeEndOffset : constant Positive := End_Offset (Innernode, After);
Before_WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (Before_Text, Charset);
After_WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (After_Text, Charset);
Dummy_Before, Dummy_After : Boolean;
begin
Assert
(Check => TR.Is_Initialized,
Message => "Text Rewrite used uninitialized");
Assert
(Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Node),
Message =>
"Text Rewrite Node does not contain provided Node - " &
Langkit_Support.Text.Image (Node.Text));
Assert
(Check => TR.First <= NodeStartOffset,
Message => "Text Rewrite - start of node outside part");
Assert
(Check => NodeEndOffset <= TR.Last,
Message => "Text Rewrite - end of node outside part");
Assert
(Check => Is_Reflexive_Ancestor (Node, Innernode),
Message => "Innernode should be contained in node");
Log ("ReplaceAround - Before");
Dummy_Before :=
Replace (TR, NodeStartOffset, InnernodeStartOffset - 1, Before_WText);
Log ("ReplaceAround - After");
Dummy_After :=
Replace (TR, InnernodeEndOffset + 1, NodeEndOffset, After_WText);
Assert
(Check => Dummy_Before = Dummy_After,
Message =>
Langkit_Support.Text.Image (Node.Full_Sloc_Image) &
"How to handle only one of the two is accepted?" & ASCII.LF &
"Before = " & Boolean'Image (Dummy_Before) & ASCII.LF & "After = " &
Boolean'Image (Dummy_After));
end ReplaceAround;
-- Collect rewrite operation (nodes) ---------------
function Replace
(TR : in out Text_Rewrite; First_Node, Last_Node : Ada_Node'Class;
Text : String; Before : Node_Location := No_Trivia;
After : Node_Location := No_Trivia; Charset : String := "")
return Boolean
is
First : constant Positive := Start_Offset (First_Node, Before);
Last : constant Positive := End_Offset (Last_Node, After);
WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (Text, Charset);
begin
Assert
(Check => TR.Is_Initialized,
Message => "Text Rewrite used uninitialized");
-- TODO: First and Last node might be the same node
-- How to check it efficiently?
-- Options [at least]
-- * Move Assert upwards (before duplication happens)
-- * add check "First_Node = Last_Node or else .."
Assert
(Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, First_Node),
Message =>
"Text Rewrite Node does not contain provided First Node - " &
Langkit_Support.Text.Image (First_Node.Text));
Assert
(Check => TR.First <= First,
Message => "Text Rewrite - start of first node outside part");
Assert
(Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Last_Node),
Message =>
"Text Rewrite Node does not contain provided Last Node - " &
Langkit_Support.Text.Image (Last_Node.Text));
Assert
(Check => Last <= TR.Last,
Message => "Text Rewrite - end of last node outside part");
return Replace (TR, First, Last, WText);
end Replace;
procedure Remove
(TR : in out Text_Rewrite; First_Node, Last_Node : Ada_Node'Class;
Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia)
is
Dummy : Boolean;
begin
Dummy := Remove (TR, First_Node, Last_Node, Before, After);
end Remove;
procedure Replace
(TR : in out Text_Rewrite; First_Node, Last_Node : Ada_Node'Class;
Text : String; Before : Node_Location := No_Trivia;
After : Node_Location := No_Trivia; Charset : String := "")
is
Dummy : Boolean;
begin
Dummy :=
Replace (TR, First_Node, Last_Node, Text, Before, After, Charset);
end Replace;
-- Public: Collect rewrite operation (token) --------
function Prepend
(TR : in out Text_Rewrite; Token : Token_Reference; Text : String;
Charset : String := "") return Boolean
is
First : constant Integer := Raw_Data (Token).Source_First;
WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (Text, Charset);
begin
return Replace (TR, First, First - 1, WText);
end Prepend;
function Append
(TR : in out Text_Rewrite; Token : Token_Reference; Text : String;
Charset : String := "") return Boolean
is
Last : constant Integer := Raw_Data (Token).Source_Last;
WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (Text, Charset);
begin
return Replace (TR, Last + 1, Last, WText);
end Append;
function Replace
(TR : in out Text_Rewrite; Token : Token_Reference; Text : String;
Charset : String := "") return Boolean
is
First : constant Integer := Raw_Data (Token).Source_First;
Last : constant Integer := Raw_Data (Token).Source_Last;
WText : constant Wide_Wide_String :=
Langkit_Support.Text.Decode (Text, Charset);
begin
return Replace (TR, First, Last, WText);
end Replace;
procedure Remove (TR : in out Text_Rewrite; Token : Token_Reference) is
Dummy : Boolean;
begin
Dummy := TR.Remove (Token);
end Remove;
procedure Prepend
(TR : in out Text_Rewrite; Token : Token_Reference; Text : String;
Charset : String := "")
is
Dummy : Boolean;
begin
Dummy := TR.Prepend (Token, Text, Charset);
end Prepend;
procedure Append
(TR : in out Text_Rewrite; Token : Token_Reference; Text : String;
Charset : String := "")
is
Dummy : Boolean;
begin
Dummy := TR.Append (Token, Text, Charset);
end Append;
procedure Replace
(TR : in out Text_Rewrite; Token : Token_Reference; Text : String;
Charset : String := "")
is
Dummy : Boolean;
begin
Dummy := TR.Replace (Token, Text, Charset);
end Replace;
-- Public: Inspect rewrite operations --------
function HasReplacements (TR : Text_Rewrite) return Boolean is
begin
return not TR.Entries.Is_Empty;
end HasReplacements;
-- Public: Apply rewrite operations --------
function ApplyToString (TR : Text_Rewrite) return String is
use Replacement_List;
Txt : constant Langkit_Support.Text.Text_Type :=
TR.Get_Unit.Text (TR.First .. TR.Last);
Str : Unbounded_Wide_Wide_String := To_Unbounded_Wide_Wide_String (Txt);
Str_First : constant Positive := 1;
-- lower bound of an Unbounded_Wide_Wide_String is 1
C : Cursor := TR.Entries.Last;
begin
Assert
(Check => TR.Is_Initialized,
Message => "Text Rewrite used uninitialized");
Log ("ApplyToString -" & TR.Entries.Length'Image & " Slices");
while Has_Element (C) loop
declare
RE : constant Replacement_Entry := Element (C);
From : constant Positive := RE.First - TR.First + Str_First;
To : constant Natural := RE.Last - TR.First + Str_First;
Replacement : constant Wide_Wide_String :=
To_Wide_Wide_String (RE.Text);
begin
Log
("Slice #" & To_Index (C)'Image & " [" & From'Image & ":" &
To'Image & " ]");
Replace_Slice (Str, From, To, Replacement);
end;
Previous (C);
end loop;
return
Langkit_Support.Text.Encode
(To_Wide_Wide_String (Str), TR.Get_Unit.Get_Charset);
exception
when others =>
Put_Line ("Error in ApplyToString - " & TR.Get_Unit.Get_Filename);
raise;
end ApplyToString;
function Make_Text_Rewrite_Nodes
(First_Node, Last_Node : Ada_Node'Class;
Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia)
return Text_Rewrite
is
First : constant Positive := Start_Offset (First_Node, Before);
Last : constant Positive := End_Offset (Last_Node, After);
begin
Assert
(Check => First <= Last,
Message => "Make_Text_Rewrite_Nodes - not a sequence");
Assert
(Check => "=" (First_Node.Unit, Last_Node.Unit),
Message => "Make_Text_Rewrite_Nodes - not same unit");
return
(Entries => Replacement_List.Empty_Vector, Unit => First_Node.Unit,
First => First, Last => Last);
end Make_Text_Rewrite_Nodes;
function Make_Text_Rewrite_Unit
(Unit : Analysis_Unit) return Text_Rewrite_Unit
is
begin
return
(Entries => Replacement_List.Empty_Vector, Unit => Unit, First => 1,
Last => Length (To_Unbounded_Wide_Wide_String (Unit.Text)));
end Make_Text_Rewrite_Unit;
procedure Apply (TR : Text_Rewrite_Unit) is
begin
if TR.HasReplacements then
Write_String_To_File (TR.ApplyToString, TR.Get_Unit.Get_Filename);
end if;
end Apply;
procedure Apply_And_Reparse (TR : in out Text_Rewrite_Unit) is
begin
if TR.HasReplacements then
declare
Unit : constant Analysis_Unit := TR.Get_Unit;
begin
Write_String_To_File (TR.ApplyToString, Unit.Get_Filename);
Unit.Reparse;
TR := Make_Text_Rewrite_Unit (Unit);
end;
end if;
end Apply_And_Reparse;
-- Private: Collect rewrite operation --------
function Replace_Inner
(TR : in out Text_Rewrite; First, Last : Natural; Text : Wide_Wide_String)
return Boolean;
-- Return value indicates whether replacement is accepted.
function Replace_Inner
(TR : in out Text_Rewrite; First, Last : Natural; Text : Wide_Wide_String)
return Boolean
is
use Replacement_List;
New_Text : Unbounded_Wide_Wide_String :=
To_Unbounded_Wide_Wide_String (Text);
C : Cursor := TR.Entries.First;
begin
while Has_Element (C) loop
declare
RE : Replacement_Entry := Element (C);
begin
if First = RE.First then
if RE.First - RE.Last = 1 then
Log ("Merge insert/replacement with earlier insertion");
New_Text := RE.Text & New_Text;
-- Might cover multiple earlier inserted replacements
if TR.Entries.Last = C then
Delete (TR.Entries, C);
else
declare
Dummy : Cursor := C;
begin
Delete (TR.Entries, Dummy);
end;
end if;
elsif First - Last = 1 then
Log ("Merge insertion with earlier replacement");
RE.Text := New_Text & RE.Text;
Replace_Element (TR.Entries, C, RE);
return True;
elsif Last < RE.Last then
Log ("Replacements at the same offset; keep the earlier");
return False;
elsif RE.Last < Last then
Log ("Replacements at the same offset; keep the current");
-- Might cover multiple earlier inserted replacements
if TR.Entries.Last = C then
Delete (TR.Entries, C);
else
declare
Dummy : Cursor := C;
begin
Delete (TR.Entries, Dummy);
end;
end if;
else
if RE.Text = New_Text then
Log ("Identical replacements");
return True;
-- TODO: Why return False / True?
-- Both the current is accepted and the old is kept
-- (since both are identical)
else
Log
("Conflicting replacements of equal length; " &
"keep the current");
RE.Text := New_Text;
Replace_Element (TR.Entries, C, RE);
return True;
end if;
end if;
elsif First < RE.First then
if RE.Last = Last then
-- length != 0
if RE.First - RE.Last = 1 then
Log ("Merging of operation with insert operation");
RE.First := First;
RE.Text := New_Text & RE.Text;
Replace_Element (TR.Entries, C, RE);
return True;
else
Log
("Replacements at the same end-offset; " &
"keep the current");
RE.First := First;
RE.Text := New_Text;
Replace_Element (TR.Entries, C, RE);
return True;
end if;
elsif RE.Last < Last then
Log
("Earlier replacement is completely covered " &
"by the current");
-- Might cover multiple earlier inserted replacements
if TR.Entries.Last = C then
Delete (TR.Entries, C);
else
declare
Dummy : Cursor := C;
begin
Delete (TR.Entries, Dummy);
end;
end if;
elsif RE.First - 1 < Last then
Log ("Overlapping edit operations (1)");
return False;
else
Log ("Insert current operation before earlier operation");
exit;
end if;
else
-- RE.First < First
if Last = RE.Last then
-- entry.length != 0
if First - Last = 1 then
Log ("Merging of operation with insert operation");
RE.Text := RE.Text & New_Text;
Replace_Element (TR.Entries, C, RE);
return True;
else
Log
("Replacements at the same end-offset; " &
"keep the earlier");
return False;
end if;
elsif Last < RE.Last then
Log
("Current replacement is completely covered " &
"by the earlier");
return False;
elsif First - 1 < RE.Last then
Log ("Overlapping edit operations (2)");
return False;
else
Next (C);
end if;
end if;
end;
end loop;
-- To have "the largest replacement wins" independent of the order
-- we cannot check for trivial replacements
-- since by removing the replacement,
-- a later smaller replacement can unexpectedly win!
declare
RE : Replacement_Entry;
begin
RE.First := First;
RE.Last := Last;
RE.Text := New_Text;
Log ("Add replacement");
Insert (TR.Entries, C, RE);
end;
return True;
end Replace_Inner;
--
-- Debug functionality to check replace
--
-- Max_Length_Text : constant Integer := 30;
--
-- function Image (TR : Text_Rewrite) return String
-- is
-- Return_Value : Unbounded_String;
-- begin
-- for E of TR.Entries loop
-- Return_Value := Return_Value & E.First'Image & "-"
-- & E.Last'Image & ":"
-- & Head (Image (To_Text (E.Text)), Max_Length_Text)
-- & ASCII.CR & ASCII.LF;
-- end loop;
--
-- return To_String (Return_Value);
-- end Image;
--
-- function Is_Internally_Consistent (TR : Text_Rewrite) return Boolean
-- is
-- Last : Integer := -1;
-- begin
-- for E of TR.Entries loop
-- if Last > E.First then
-- return False;
-- else
-- Last := E.Last;
-- end if;
-- end loop;
-- return True;
-- end Is_Internally_Consistent;
--
-- function Replace (TR : in out Text_Rewrite;
-- First, Last : Natural;
-- Text : Wide_Wide_String)
-- return Boolean
-- is
-- Return_Value : Boolean;
-- begin
-- Log ("Replace " & First'Image & "-" & Last'Image & ":" &
-- Head (Image (To_Text (To_Unbounded_Wide_Wide_String (Text))),
-- Max_Length_Text));
-- Return_Value := Replace_Inner (TR, First, Last, Text);
-- Assert (Check => Is_Internally_Consistent (TR),
-- Message => "Text Rewrite no longer internally consistent" &
-- ASCII.CR & ASCII.LF & Image (TR));
-- return Return_Value;
-- end Replace;
function Replace
(TR : in out Text_Rewrite; First, Last : Natural; Text : Wide_Wide_String)
return Boolean is
(Replace_Inner (TR, First, Last, Text));
-- Proxy to allow easy switching to debug variant
-- Private: Debugging utilities --------
procedure Log (Str : String) is
begin
if DEBUG then
Put_Line (Str);
end if;
end Log;
end Rejuvenation.Text_Rewrites;
|
Transynther/x86/_processed/NONE/_zr_/i7-7700_9_0xca.log_4_693.asm | ljhsiun2/medusa | 9 | 23502 | <filename>Transynther/x86/_processed/NONE/_zr_/i7-7700_9_0xca.log_4_693.asm
.global s_prepare_buffers
s_prepare_buffers:
push %r9
push %rcx
push %rdi
push %rsi
lea addresses_WT_ht+0x1107c, %rsi
lea addresses_D_ht+0x13628, %rdi
clflush (%rdi)
nop
nop
nop
and $28583, %r9
mov $60, %rcx
rep movsb
nop
dec %rcx
pop %rsi
pop %rdi
pop %rcx
pop %r9
ret
.global s_faulty_load
s_faulty_load:
push %r10
push %r12
push %r13
push %r14
push %r15
push %rbp
push %rdi
// Load
mov $0x1ee8700000000988, %r12
nop
cmp %r15, %r15
vmovaps (%r12), %ymm3
vextracti128 $1, %ymm3, %xmm3
vpextrq $1, %xmm3, %r13
dec %r14
// Store
lea addresses_US+0x1c877, %r14
cmp %rbp, %rbp
movw $0x5152, (%r14)
nop
nop
nop
nop
inc %r15
// Store
lea addresses_WT+0x131b0, %r10
nop
nop
and %r14, %r14
movw $0x5152, (%r10)
sub $53924, %rbp
// Store
lea addresses_WC+0x7708, %r13
add $397, %r15
mov $0x5152535455565758, %rdi
movq %rdi, (%r13)
nop
nop
nop
nop
nop
dec %r13
// Store
lea addresses_WT+0x14fa8, %r10
nop
nop
nop
nop
sub %r14, %r14
mov $0x5152535455565758, %rdi
movq %rdi, (%r10)
sub $18216, %rbp
// Faulty Load
lea addresses_WC+0x7208, %r10
nop
add $30023, %r12
mov (%r10), %r13w
lea oracles, %rbp
and $0xff, %r13
shlq $12, %r13
mov (%rbp,%r13,1), %r13
pop %rdi
pop %rbp
pop %r15
pop %r14
pop %r13
pop %r12
pop %r10
ret
/*
<gen_faulty_load>
[REF]
{'src': {'congruent': 0, 'AVXalign': True, 'same': False, 'size': 1, 'NT': False, 'type': 'addresses_WC'}, 'OP': 'LOAD'}
{'src': {'congruent': 6, 'AVXalign': True, 'same': False, 'size': 32, 'NT': False, 'type': 'addresses_NC'}, 'OP': 'LOAD'}
{'OP': 'STOR', 'dst': {'congruent': 0, 'AVXalign': False, 'same': False, 'size': 2, 'NT': False, 'type': 'addresses_US'}}
{'OP': 'STOR', 'dst': {'congruent': 0, 'AVXalign': False, 'same': False, 'size': 2, 'NT': False, 'type': 'addresses_WT'}}
{'OP': 'STOR', 'dst': {'congruent': 5, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_WC'}}
{'OP': 'STOR', 'dst': {'congruent': 5, 'AVXalign': False, 'same': False, 'size': 8, 'NT': False, 'type': 'addresses_WT'}}
[Faulty Load]
{'src': {'congruent': 0, 'AVXalign': False, 'same': True, 'size': 2, 'NT': False, 'type': 'addresses_WC'}, 'OP': 'LOAD'}
<gen_prepare_buffer>
{'src': {'congruent': 2, 'same': False, 'type': 'addresses_WT_ht'}, 'OP': 'REPM', 'dst': {'congruent': 5, 'same': False, 'type': 'addresses_D_ht'}}
{'00': 4}
00 00 00 00
*/
|
programs/oeis/209/A209281.asm | neoneye/loda | 22 | 246072 | <gh_stars>10-100
; A209281: Start with first run [0,1] then, for n >= 2, the n-th run has length 2^n and is the concatenation of [a(1),a(2),...,a(2^n/2)] and [n-a(1),n-a(2),...,n-a(2^n/2)].
; 0,1,2,1,3,2,1,2,4,3,2,3,1,2,3,2,5,4,3,4,2,3,4,3,1,2,3,2,4,3,2,3,6,5,4,5,3,4,5,4,2,3,4,3,5,4,3,4,1,2,3,2,4,3,2,3,5,4,3,4,2,3,4,3,7,6,5,6,4,5,6,5,3,4,5,4,6,5,4,5,2,3,4,3,5,4,3
lpb $0
mov $2,$0
div $0,2
seq $2,10060 ; Thue-Morse sequence: let A_k denote the first 2^k terms; then A_0 = 0 and for k >= 0, A_{k+1} = A_k B_k, where B_k is obtained from A_k by interchanging 0's and 1's.
add $1,$2
lpe
mov $0,$1
|
programs/oeis/038/A038364.asm | karttu/loda | 1 | 14180 | ; A038364: Numbers n such that n = (product of digits of n) + (sum of digits of n).
; 0,19,29,39,49,59,69,79,89,99
lpb $0,1
sub $0,1
mov $2,4
add $1,5
mov $3,5
lpe
add $2,$1
add $1,$3
add $1,$2
|
bin/output/boot_ram/boot_ram.asm | HESUPING/JmeshBLE-StaticLib | 0 | 240355 |
========================================================================
** ELF Header Information
File Name: boot_ram.elf
Machine class: ELFCLASS32 (32-bit)
Data encoding: ELFDATA2LSB (Little endian)
Header version: EV_CURRENT (Current version)
Operating System ABI: none
ABI Version: 0
File Type: ET_EXEC (Executable) (2)
Machine: EM_ARM (ARM)
Image Entry point: 0x0012e259
Flags: EF_ARM_HASENTRY + EF_ARM_ABI_FLOAT_SOFT (0x05000202)
ARM ELF revision: 5 (ABI version 2)
Conforms to Soft float procedure-call standard
Built with
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armasm [4d35a5]
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
Header size: 52 bytes (0x34)
Program header entry size: 32 bytes (0x20)
Section header entry size: 40 bytes (0x28)
Program header entries: 1
Section header entries: 15
Program header offset: 325256 (0x0004f688)
Section header offset: 325288 (0x0004f6a8)
Section header string table index: 14
========================================================================
** Program header #0
Type : PT_LOAD (1)
File Offset : 52 (0x34)
Virtual Addr : 0x0012dff0
Physical Addr : 0x0012dff0
Size in file : 2768 bytes (0xad0)
Size in memory: 2768 bytes (0xad0)
Flags : PF_X + PF_W + PF_R + PF_ARM_ENTRY (0x80000007)
Alignment : 4
========================================================================
** Section #1
Name : EXEC_SECTION
Type : SHT_PROGBITS (0x00000001)
Flags : SHF_ALLOC + SHF_EXECINSTR (0x00000006)
Addr : 0x0012dff0
File Offset : 52 (0x34)
Size : 2764 bytes (0xacc)
Link : SHN_UNDEF
Info : 0
Alignment : 4
Entry Size : 0
$d.realdata
boot_header_area
boot_info
0x0012dff0: 34325842 BX24 DCD 875714626
0x0012dff4: 0012e000 .... DCD 1236992
0x0012dff8: ffffffff .... DCD 4294967295
0x0012dffc: 0012e259 Y... DCD 1237593
0x0012e000: ffffffff .... DCD 4294967295
0x0012e004: ffffffff .... DCD 4294967295
0x0012e008: ffffffff .... DCD 4294967295
0x0012e00c: ffffffff .... DCD 4294967295
0x0012e010: 00000000 .... DCD 0
$t
.text
__aeabi_uidiv
__aeabi_uidivmod
0x0012e014: b530 0. PUSH {r4,r5,lr}
0x0012e016: 460b .F MOV r3,r1
0x0012e018: 4601 .F MOV r1,r0
0x0012e01a: 2000 . MOVS r0,#0
0x0012e01c: 2220 " MOVS r2,#0x20
0x0012e01e: 2401 .$ MOVS r4,#1
0x0012e020: e009 .. B 0x12e036 ; __aeabi_uidiv + 34
0x0012e022: 460d .F MOV r5,r1
0x0012e024: 40d5 .@ LSRS r5,r5,r2
0x0012e026: 429d .B CMP r5,r3
0x0012e028: d305 .. BCC 0x12e036 ; __aeabi_uidiv + 34
0x0012e02a: 461d .F MOV r5,r3
0x0012e02c: 4095 .@ LSLS r5,r5,r2
0x0012e02e: 1b49 I. SUBS r1,r1,r5
0x0012e030: 4625 %F MOV r5,r4
0x0012e032: 4095 .@ LSLS r5,r5,r2
0x0012e034: 1940 @. ADDS r0,r0,r5
0x0012e036: 4615 .F MOV r5,r2
0x0012e038: 1e52 R. SUBS r2,r2,#1
0x0012e03a: 2d00 .- CMP r5,#0
0x0012e03c: dcf1 .. BGT 0x12e022 ; __aeabi_uidiv + 14
0x0012e03e: bd30 0. POP {r4,r5,pc}
i.awo_bootram_init
awo_bootram_init
0x0012e040: b570 p. PUSH {r4-r6,lr}
0x0012e042: bf00 .. NOP
0x0012e044: 4822 "H LDR r0,[pc,#136] ; [0x12e0d0] = 0x20201000
0x0012e046: 68c0 .h LDR r0,[r0,#0xc]
0x0012e048: 0580 .. LSLS r0,r0,#22
0x0012e04a: 0fc0 .. LSRS r0,r0,#31
0x0012e04c: 2800 .( CMP r0,#0
0x0012e04e: d000 .. BEQ 0x12e052 ; awo_bootram_init + 18
0x0012e050: bd70 p. POP {r4-r6,pc}
0x0012e052: 2001 . MOVS r0,#1
0x0012e054: 491e .I LDR r1,[pc,#120] ; [0x12e0d0] = 0x20201000
0x0012e056: 68c9 .h LDR r1,[r1,#0xc]
0x0012e058: 0242 B. LSLS r2,r0,#9
0x0012e05a: 4391 .C BICS r1,r1,r2
0x0012e05c: 0242 B. LSLS r2,r0,#9
0x0012e05e: 0243 C. LSLS r3,r0,#9
0x0012e060: 401a .@ ANDS r2,r2,r3
0x0012e062: 4311 .C ORRS r1,r1,r2
0x0012e064: 4a1a .J LDR r2,[pc,#104] ; [0x12e0d0] = 0x20201000
0x0012e066: 60d1 .` STR r1,[r2,#0xc]
0x0012e068: bf00 .. NOP
0x0012e06a: f000fceb .... BL sysc_awo_dr_16m_rcosc_en_setf ; 0x12ea44
0x0012e06e: 2000 . MOVS r0,#0
0x0012e070: f000fcf6 .... BL sysc_awo_reg_16m_rcosc_en_setf ; 0x12ea60
0x0012e074: 2001 . MOVS r0,#1
0x0012e076: f000f831 ..1. BL awo_clk_div_pbus_para_m1 ; 0x12e0dc
0x0012e07a: f000f841 ..A. BL awo_clk_div_pbus_para_up ; 0x12e100
0x0012e07e: 2020 MOVS r0,#0x20
0x0012e080: f000f844 ..D. BL awo_clkgate_en ; 0x12e10c
0x0012e084: 4913 .I LDR r1,[pc,#76] ; [0x12e0d4] = 0xf4240
0x0012e086: 4814 .H LDR r0,[pc,#80] ; [0x12e0d8] = 0x12eabc
0x0012e088: 6800 .h LDR r0,[r0,#0]
0x0012e08a: f7ffffc3 .... BL __aeabi_uidiv ; 0x12e014
0x0012e08e: b2c5 .. UXTB r5,r0
0x0012e090: 4628 (F MOV r0,r5
0x0012e092: f000f86f ..o. BL awo_open_pll ; 0x12e174
0x0012e096: 2400 .$ MOVS r4,#0
0x0012e098: e002 .. B 0x12e0a0 ; awo_bootram_init + 96
0x0012e09a: bf00 .. NOP
0x0012e09c: 1c60 `. ADDS r0,r4,#1
0x0012e09e: b284 .. UXTH r4,r0
0x0012e0a0: 2c05 ., CMP r4,#5
0x0012e0a2: dbfa .. BLT 0x12e09a ; awo_bootram_init + 90
0x0012e0a4: bf00 .. NOP
0x0012e0a6: bf00 .. NOP
0x0012e0a8: 4809 .H LDR r0,[pc,#36] ; [0x12e0d0] = 0x20201000
0x0012e0aa: 3080 .0 ADDS r0,r0,#0x80
0x0012e0ac: 6b00 .k LDR r0,[r0,#0x30]
0x0012e0ae: 2120 ! MOVS r1,#0x20
0x0012e0b0: 4008 .@ ANDS r0,r0,r1
0x0012e0b2: 2800 .( CMP r0,#0
0x0012e0b4: d0f7 .. BEQ 0x12e0a6 ; awo_bootram_init + 102
0x0012e0b6: 2002 . MOVS r0,#2
0x0012e0b8: f000f83e ..>. BL awo_hbus1_clksel ; 0x12e138
0x0012e0bc: 2010 . MOVS r0,#0x10
0x0012e0be: f000f825 ..%. BL awo_clkgate_en ; 0x12e10c
0x0012e0c2: 2002 . MOVS r0,#2
0x0012e0c4: f000f82a ..*. BL awo_hbus0_clksel ; 0x12e11c
0x0012e0c8: f000f8c0 .... BL awo_set_parameter ; 0x12e24c
0x0012e0cc: bf00 .. NOP
0x0012e0ce: e7bf .. B 0x12e050 ; awo_bootram_init + 16
$d
0x0012e0d0: 20201000 .. DCD 538972160
0x0012e0d4: 000f4240 @B.. DCD 1000000
0x0012e0d8: 0012eabc .... DCD 1239740
$t
i.awo_clk_div_pbus_para_m1
awo_clk_div_pbus_para_m1
0x0012e0dc: bf00 .. NOP
0x0012e0de: 4907 .I LDR r1,[pc,#28] ; [0x12e0fc] = 0x20201000
0x0012e0e0: 6809 .h LDR r1,[r1,#0]
0x0012e0e2: 220f ." MOVS r2,#0xf
0x0012e0e4: 0412 .. LSLS r2,r2,#16
0x0012e0e6: 4391 .C BICS r1,r1,r2
0x0012e0e8: 0402 .. LSLS r2,r0,#16
0x0012e0ea: 230f .# MOVS r3,#0xf
0x0012e0ec: 041b .. LSLS r3,r3,#16
0x0012e0ee: 401a .@ ANDS r2,r2,r3
0x0012e0f0: 4311 .C ORRS r1,r1,r2
0x0012e0f2: 4a02 .J LDR r2,[pc,#8] ; [0x12e0fc] = 0x20201000
0x0012e0f4: 6011 .` STR r1,[r2,#0]
0x0012e0f6: bf00 .. NOP
0x0012e0f8: 4770 pG BX lr
$d
0x0012e0fa: 0000 .. DCW 0
0x0012e0fc: 20201000 .. DCD 538972160
$t
i.awo_clk_div_pbus_para_up
awo_clk_div_pbus_para_up
0x0012e100: b510 .. PUSH {r4,lr}
0x0012e102: 2001 . MOVS r0,#1
0x0012e104: f000fc98 .... BL sysc_awo_clkgen_awo_signal_1_set ; 0x12ea38
0x0012e108: bd10 .. POP {r4,pc}
0x0012e10a: 0000 .. MOVS r0,r0
i.awo_clkgate_en
awo_clkgate_en
0x0012e10c: bf00 .. NOP
0x0012e10e: 4902 .I LDR r1,[pc,#8] ; [0x12e118] = 0x20201000
0x0012e110: 6048 H` STR r0,[r1,#4]
0x0012e112: bf00 .. NOP
0x0012e114: 4770 pG BX lr
$d
0x0012e116: 0000 .. DCW 0
0x0012e118: 20201000 .. DCD 538972160
$t
i.awo_hbus0_clksel
awo_hbus0_clksel
0x0012e11c: bf00 .. NOP
0x0012e11e: 4905 .I LDR r1,[pc,#20] ; [0x12e134] = 0x20201000
0x0012e120: 6809 .h LDR r1,[r1,#0]
0x0012e122: 08c9 .. LSRS r1,r1,#3
0x0012e124: 00c9 .. LSLS r1,r1,#3
0x0012e126: 0742 B. LSLS r2,r0,#29
0x0012e128: 0f52 R. LSRS r2,r2,#29
0x0012e12a: 4311 .C ORRS r1,r1,r2
0x0012e12c: 4a01 .J LDR r2,[pc,#4] ; [0x12e134] = 0x20201000
0x0012e12e: 6011 .` STR r1,[r2,#0]
0x0012e130: bf00 .. NOP
0x0012e132: 4770 pG BX lr
$d
0x0012e134: 20201000 .. DCD 538972160
$t
i.awo_hbus1_clksel
awo_hbus1_clksel
0x0012e138: bf00 .. NOP
0x0012e13a: 4906 .I LDR r1,[pc,#24] ; [0x12e154] = 0x20201000
0x0012e13c: 6809 .h LDR r1,[r1,#0]
0x0012e13e: 2218 ." MOVS r2,#0x18
0x0012e140: 4391 .C BICS r1,r1,r2
0x0012e142: 00c2 .. LSLS r2,r0,#3
0x0012e144: 2318 .# MOVS r3,#0x18
0x0012e146: 401a .@ ANDS r2,r2,r3
0x0012e148: 4311 .C ORRS r1,r1,r2
0x0012e14a: 4a02 .J LDR r2,[pc,#8] ; [0x12e154] = 0x20201000
0x0012e14c: 6011 .` STR r1,[r2,#0]
0x0012e14e: bf00 .. NOP
0x0012e150: 4770 pG BX lr
$d
0x0012e152: 0000 .. DCW 0
0x0012e154: 20201000 .. DCD 538972160
$t
i.awo_ldo_setup_time
awo_ldo_setup_time
0x0012e158: bf00 .. NOP
0x0012e15a: 4905 .I LDR r1,[pc,#20] ; [0x12e170] = 0x20201000
0x0012e15c: 6989 .i LDR r1,[r1,#0x18]
0x0012e15e: 0a09 .. LSRS r1,r1,#8
0x0012e160: 0209 .. LSLS r1,r1,#8
0x0012e162: b2c2 .. UXTB r2,r0
0x0012e164: 4311 .C ORRS r1,r1,r2
0x0012e166: 4a02 .J LDR r2,[pc,#8] ; [0x12e170] = 0x20201000
0x0012e168: 6191 .a STR r1,[r2,#0x18]
0x0012e16a: bf00 .. NOP
0x0012e16c: 4770 pG BX lr
$d
0x0012e16e: 0000 .. DCW 0
0x0012e170: 20201000 .. DCD 538972160
$t
i.awo_open_pll
awo_open_pll
0x0012e174: b570 p. PUSH {r4-r6,lr}
0x0012e176: 4604 .F MOV r4,r0
0x0012e178: 2c40 @, CMP r4,#0x40
0x0012e17a: d012 .. BEQ 0x12e1a2 ; awo_open_pll + 46
0x0012e17c: dc06 .. BGT 0x12e18c ; awo_open_pll + 24
0x0012e17e: 2c10 ., CMP r4,#0x10
0x0012e180: d009 .. BEQ 0x12e196 ; awo_open_pll + 34
0x0012e182: 2c20 , CMP r4,#0x20
0x0012e184: d009 .. BEQ 0x12e19a ; awo_open_pll + 38
0x0012e186: 2c30 0, CMP r4,#0x30
0x0012e188: d111 .. BNE 0x12e1ae ; awo_open_pll + 58
0x0012e18a: e008 .. B 0x12e19e ; awo_open_pll + 42
0x0012e18c: 2c50 P, CMP r4,#0x50
0x0012e18e: d00a .. BEQ 0x12e1a6 ; awo_open_pll + 50
0x0012e190: 2c60 `, CMP r4,#0x60
0x0012e192: d10c .. BNE 0x12e1ae ; awo_open_pll + 58
0x0012e194: e009 .. B 0x12e1aa ; awo_open_pll + 54
0x0012e196: 2400 .$ MOVS r4,#0
0x0012e198: e00a .. B 0x12e1b0 ; awo_open_pll + 60
0x0012e19a: 2408 .$ MOVS r4,#8
0x0012e19c: e008 .. B 0x12e1b0 ; awo_open_pll + 60
0x0012e19e: 2413 .$ MOVS r4,#0x13
0x0012e1a0: e006 .. B 0x12e1b0 ; awo_open_pll + 60
0x0012e1a2: 2414 .$ MOVS r4,#0x14
0x0012e1a4: e004 .. B 0x12e1b0 ; awo_open_pll + 60
0x0012e1a6: 2415 .$ MOVS r4,#0x15
0x0012e1a8: e002 .. B 0x12e1b0 ; awo_open_pll + 60
0x0012e1aa: 2416 .$ MOVS r4,#0x16
0x0012e1ac: e000 .. B 0x12e1b0 ; awo_open_pll + 60
0x0012e1ae: bf00 .. NOP
0x0012e1b0: bf00 .. NOP
0x0012e1b2: f000fc65 ..e. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e1b6: 2101 .! MOVS r1,#1
0x0012e1b8: 0449 I. LSLS r1,r1,#17
0x0012e1ba: 4388 .C BICS r0,r0,r1
0x0012e1bc: 4605 .F MOV r5,r0
0x0012e1be: 4628 (F MOV r0,r5
0x0012e1c0: f000fc64 ..d. BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e1c4: f000fc5c ..\. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e1c8: 2101 .! MOVS r1,#1
0x0012e1ca: 0449 I. LSLS r1,r1,#17
0x0012e1cc: 4308 .C ORRS r0,r0,r1
0x0012e1ce: 4605 .F MOV r5,r0
0x0012e1d0: 4628 (F MOV r0,r5
0x0012e1d2: f000fc5b ..[. BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e1d6: f000fc53 ..S. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e1da: 2107 .! MOVS r1,#7
0x0012e1dc: 0389 .. LSLS r1,r1,#14
0x0012e1de: 4388 .C BICS r0,r0,r1
0x0012e1e0: 2105 .! MOVS r1,#5
0x0012e1e2: 0389 .. LSLS r1,r1,#14
0x0012e1e4: 1845 E. ADDS r5,r0,r1
0x0012e1e6: 4628 (F MOV r0,r5
0x0012e1e8: f000fc50 ..P. BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e1ec: f000fc48 ..H. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e1f0: 2107 .! MOVS r1,#7
0x0012e1f2: 02c9 .. LSLS r1,r1,#11
0x0012e1f4: 4388 .C BICS r0,r0,r1
0x0012e1f6: 2101 .! MOVS r1,#1
0x0012e1f8: 0309 .. LSLS r1,r1,#12
0x0012e1fa: 1845 E. ADDS r5,r0,r1
0x0012e1fc: 4628 (F MOV r0,r5
0x0012e1fe: f000fc45 ..E. BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e202: f000fc3d ..=. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e206: 2107 .! MOVS r1,#7
0x0012e208: 0209 .. LSLS r1,r1,#8
0x0012e20a: 4388 .C BICS r0,r0,r1
0x0012e20c: 2101 .! MOVS r1,#1
0x0012e20e: 0289 .. LSLS r1,r1,#10
0x0012e210: 1845 E. ADDS r5,r0,r1
0x0012e212: 4628 (F MOV r0,r5
0x0012e214: f000fc3a ..:. BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e218: f000fc32 ..2. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e21c: 08c0 .. LSRS r0,r0,#3
0x0012e21e: 00c0 .. LSLS r0,r0,#3
0x0012e220: 1cc5 .. ADDS r5,r0,#3
0x0012e222: 4628 (F MOV r0,r5
0x0012e224: f000fc32 ..2. BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e228: f000fc2a ..*. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e22c: 21f8 .! MOVS r1,#0xf8
0x0012e22e: 4388 .C BICS r0,r0,r1
0x0012e230: 00e1 .. LSLS r1,r4,#3
0x0012e232: 4308 .C ORRS r0,r0,r1
0x0012e234: 4606 .F MOV r6,r0
0x0012e236: f000fc29 ..). BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e23a: f000fc21 ..!. BL sysc_awo_rf_reg_0_get ; 0x12ea80
0x0012e23e: 2101 .! MOVS r1,#1
0x0012e240: 0489 .. LSLS r1,r1,#18
0x0012e242: 4308 .C ORRS r0,r0,r1
0x0012e244: 4606 .F MOV r6,r0
0x0012e246: f000fc21 ..!. BL sysc_awo_rf_reg_0_set ; 0x12ea8c
0x0012e24a: bd70 p. POP {r4-r6,pc}
i.awo_set_parameter
awo_set_parameter
0x0012e24c: b500 .. PUSH {lr}
0x0012e24e: 20c0 . MOVS r0,#0xc0
0x0012e250: f7ffff82 .... BL awo_ldo_setup_time ; 0x12e158
0x0012e254: bd00 .. POP {pc}
0x0012e256: 0000 .. MOVS r0,r0
i.boot_ram_entry
boot_ram_entry
0x0012e258: b570 p. PUSH {r4-r6,lr}
0x0012e25a: f7fffef1 .... BL awo_bootram_init ; 0x12e040
0x0012e25e: f000fa27 ..'. BL peri_gate ; 0x12e6b0
0x0012e262: 4823 #H LDR r0,[pc,#140] ; [0x12e2f0] = 0x12dff0
0x0012e264: 69c0 .i LDR r0,[r0,#0x1c]
0x0012e266: 2801 .( CMP r0,#1
0x0012e268: d017 .. BEQ 0x12e29a ; boot_ram_entry + 66
0x0012e26a: 4821 !H LDR r0,[pc,#132] ; [0x12e2f0] = 0x12dff0
0x0012e26c: 6980 .i LDR r0,[r0,#0x18]
0x0012e26e: 2800 .( CMP r0,#0
0x0012e270: d007 .. BEQ 0x12e282 ; boot_ram_entry + 42
0x0012e272: 200f . MOVS r0,#0xf
0x0012e274: f000fc16 .... BL sysc_cpu_qspi_en_setf ; 0x12eaa4
0x0012e278: 491d .I LDR r1,[pc,#116] ; [0x12e2f0] = 0x12dff0
0x0012e27a: 481e .H LDR r0,[pc,#120] ; [0x12e2f4] = 0x12e5d9
0x0012e27c: f000fa02 .... BL image_read ; 0x12e684
0x0012e280: e006 .. B 0x12e290 ; boot_ram_entry + 56
0x0012e282: 2003 . MOVS r0,#3
0x0012e284: f000fc0e .... BL sysc_cpu_qspi_en_setf ; 0x12eaa4
0x0012e288: 4919 .I LDR r1,[pc,#100] ; [0x12e2f0] = 0x12dff0
0x0012e28a: 481b .H LDR r0,[pc,#108] ; [0x12e2f8] = 0x12e631
0x0012e28c: f000f9fa .... BL image_read ; 0x12e684
0x0012e290: 2401 .$ MOVS r4,#1
0x0012e292: 0524 $. LSLS r4,r4,#20
0x0012e294: f000f8b2 .... BL dmac_qspi_gate ; 0x12e3fc
0x0012e298: e016 .. B 0x12e2c8 ; boot_ram_entry + 112
0x0012e29a: 20ff . MOVS r0,#0xff
0x0012e29c: 3001 .0 ADDS r0,#1
0x0012e29e: f000fbfb .... BL sysc_cpu_clkg1_set ; 0x12ea98
0x0012e2a2: 200f . MOVS r0,#0xf
0x0012e2a4: f000fbfe .... BL sysc_cpu_qspi_en_setf ; 0x12eaa4
0x0012e2a8: 4911 .I LDR r1,[pc,#68] ; [0x12e2f0] = 0x12dff0
0x0012e2aa: 6a09 .j LDR r1,[r1,#0x20]
0x0012e2ac: 2900 .) CMP r1,#0
0x0012e2ae: d002 .. BEQ 0x12e2b6 ; boot_ram_entry + 94
0x0012e2b0: 2101 .! MOVS r1,#1
0x0012e2b2: 04c9 .. LSLS r1,r1,#19
0x0012e2b4: e000 .. B 0x12e2b8 ; boot_ram_entry + 96
0x0012e2b6: 2100 .! MOVS r1,#0
0x0012e2b8: 4608 .F MOV r0,r1
0x0012e2ba: f000f905 .... BL flash_cache_init ; 0x12e4c8
0x0012e2be: 480c .H LDR r0,[pc,#48] ; [0x12e2f0] = 0x12dff0
0x0012e2c0: 6900 .i LDR r0,[r0,#0x10]
0x0012e2c2: 2101 .! MOVS r1,#1
0x0012e2c4: 05c9 .. LSLS r1,r1,#23
0x0012e2c6: 1844 D. ADDS r4,r0,r1
0x0012e2c8: 6820 h LDR r0,[r4,#0]
0x0012e2ca: f3808808 .... MSR MSP,r0
0x0012e2ce: bf00 .. NOP
0x0012e2d0: 1d25 %. ADDS r5,r4,#4
0x0012e2d2: 4a07 .J LDR r2,[pc,#28] ; [0x12e2f0] = 0x12dff0
0x0012e2d4: 6911 .i LDR r1,[r2,#0x10]
0x0012e2d6: 6a12 .j LDR r2,[r2,#0x20]
0x0012e2d8: 2a00 .* CMP r2,#0
0x0012e2da: d001 .. BEQ 0x12e2e0 ; boot_ram_entry + 136
0x0012e2dc: 2200 ." MOVS r2,#0
0x0012e2de: e001 .. B 0x12e2e4 ; boot_ram_entry + 140
0x0012e2e0: 2201 ." MOVS r2,#1
0x0012e2e2: 04d2 .. LSLS r2,r2,#19
0x0012e2e4: 4610 .F MOV r0,r2
0x0012e2e6: 4b05 .K LDR r3,[pc,#20] ; [0x12e2fc] = 0x3399
0x0012e2e8: 4a05 .J LDR r2,[pc,#20] ; [0x12e300] = 0xad0
0x0012e2ea: 682e .h LDR r6,[r5,#0]
0x0012e2ec: 47b0 .G BLX r6
0x0012e2ee: bd70 p. POP {r4-r6,pc}
$d
0x0012e2f0: 0012dff0 .... DCD 1236976
0x0012e2f4: 0012e5d9 .... DCD 1238489
0x0012e2f8: 0012e631 1... DCD 1238577
0x0012e2fc: 00003399 .3.. DCD 13209
0x0012e300: 00000ad0 .... DCD 2768
$t
i.cache_reg_cache_en_set
cache_reg_cache_en_set
0x0012e304: 4901 .I LDR r1,[pc,#4] ; [0x12e30c] = 0x20121000
0x0012e306: 6008 .` STR r0,[r1,#0]
0x0012e308: 4770 pG BX lr
$d
0x0012e30a: 0000 .. DCW 0
0x0012e30c: 20121000 ... DCD 538054656
$t
i.cache_reg_flush_en_set
cache_reg_flush_en_set
0x0012e310: 4901 .I LDR r1,[pc,#4] ; [0x12e318] = 0x20121000
0x0012e312: 61c8 .a STR r0,[r1,#0x1c]
0x0012e314: 4770 pG BX lr
$d
0x0012e316: 0000 .. DCW 0
0x0012e318: 20121000 ... DCD 538054656
$t
i.clk_gate_cpu_g1
clk_gate_cpu_g1
0x0012e31c: bf00 .. NOP
0x0012e31e: 490f .I LDR r1,[pc,#60] ; [0x12e35c] = 0x20132000
0x0012e320: 6148 Ha STR r0,[r1,#0x14]
0x0012e322: bf00 .. NOP
0x0012e324: 490e .I LDR r1,[pc,#56] ; [0x12e360] = 0xaaaaaaaa
0x0012e326: 4001 .@ ANDS r1,r1,r0
0x0012e328: 2900 .) CMP r1,#0
0x0012e32a: d007 .. BEQ 0x12e33c ; clk_gate_cpu_g1 + 32
0x0012e32c: bf00 .. NOP
0x0012e32e: bf00 .. NOP
0x0012e330: 490a .I LDR r1,[pc,#40] ; [0x12e35c] = 0x20132000
0x0012e332: 6949 Ii LDR r1,[r1,#0x14]
0x0012e334: 4001 .@ ANDS r1,r1,r0
0x0012e336: 2900 .) CMP r1,#0
0x0012e338: d1f9 .. BNE 0x12e32e ; clk_gate_cpu_g1 + 18
0x0012e33a: e00e .. B 0x12e35a ; clk_gate_cpu_g1 + 62
0x0012e33c: 4908 .I LDR r1,[pc,#32] ; [0x12e360] = 0xaaaaaaaa
0x0012e33e: 43c9 .C MVNS r1,r1
0x0012e340: 4001 .@ ANDS r1,r1,r0
0x0012e342: 2900 .) CMP r1,#0
0x0012e344: d008 .. BEQ 0x12e358 ; clk_gate_cpu_g1 + 60
0x0012e346: bf00 .. NOP
0x0012e348: bf00 .. NOP
0x0012e34a: 4904 .I LDR r1,[pc,#16] ; [0x12e35c] = 0x20132000
0x0012e34c: 6949 Ii LDR r1,[r1,#0x14]
0x0012e34e: 4602 .F MOV r2,r0
0x0012e350: 438a .C BICS r2,r2,r1
0x0012e352: 2a00 .* CMP r2,#0
0x0012e354: d1f8 .. BNE 0x12e348 ; clk_gate_cpu_g1 + 44
0x0012e356: e000 .. B 0x12e35a ; clk_gate_cpu_g1 + 62
0x0012e358: bf00 .. NOP
0x0012e35a: 4770 pG BX lr
$d
0x0012e35c: 20132000 . . DCD 538124288
0x0012e360: aaaaaaaa .... DCD 2863311530
$t
i.clk_gate_dmac_clr
clk_gate_dmac_clr
0x0012e364: b500 .. PUSH {lr}
0x0012e366: bf00 .. NOP
0x0012e368: 4803 .H LDR r0,[pc,#12] ; [0x12e378] = 0x20120380
0x0012e36a: 6a00 .j LDR r0,[r0,#0x20]
0x0012e36c: 2800 .( CMP r0,#0
0x0012e36e: d102 .. BNE 0x12e376 ; clk_gate_dmac_clr + 18
0x0012e370: 2080 . MOVS r0,#0x80
0x0012e372: f7ffffd3 .... BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e376: bd00 .. POP {pc}
$d
0x0012e378: 20120380 ... DCD 538051456
$t
i.clk_gate_dmac_set
clk_gate_dmac_set
0x0012e37c: b500 .. PUSH {lr}
0x0012e37e: 2040 @ MOVS r0,#0x40
0x0012e380: f7ffffcc .... BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e384: bd00 .. POP {pc}
0x0012e386: 0000 .. MOVS r0,r0
i.dmac_ch0_ctrl_h_pack
dmac_ch0_ctrl_h_pack
0x0012e388: 0302 .. LSLS r2,r0,#12
0x0012e38a: 430a .C ORRS r2,r2,r1
0x0012e38c: 4b01 .K LDR r3,[pc,#4] ; [0x12e394] = 0x20120000
0x0012e38e: 61da .a STR r2,[r3,#0x1c]
0x0012e390: 4770 pG BX lr
$d
0x0012e392: 0000 .. DCW 0
0x0012e394: 20120000 ... DCD 538050560
$t
i.dmac_ch0_ctrl_l_pack
dmac_ch0_ctrl_l_pack
0x0012e398: b5f0 .. PUSH {r4-r7,lr}
0x0012e39a: 9d06 .. LDR r5,[sp,#0x18]
0x0012e39c: 9c05 .. LDR r4,[sp,#0x14]
0x0012e39e: 0506 .. LSLS r6,r0,#20
0x0012e3a0: 038f .. LSLS r7,r1,#14
0x0012e3a2: 433e >C ORRS r6,r6,r7
0x0012e3a4: 02d7 .. LSLS r7,r2,#11
0x0012e3a6: 433e >C ORRS r6,r6,r7
0x0012e3a8: 025f _. LSLS r7,r3,#9
0x0012e3aa: 433e >C ORRS r6,r6,r7
0x0012e3ac: 01e7 .. LSLS r7,r4,#7
0x0012e3ae: 433e >C ORRS r6,r6,r7
0x0012e3b0: 012f /. LSLS r7,r5,#4
0x0012e3b2: 433e >C ORRS r6,r6,r7
0x0012e3b4: 9f07 .. LDR r7,[sp,#0x1c]
0x0012e3b6: 007f .. LSLS r7,r7,#1
0x0012e3b8: 433e >C ORRS r6,r6,r7
0x0012e3ba: 9f08 .. LDR r7,[sp,#0x20]
0x0012e3bc: 433e >C ORRS r6,r6,r7
0x0012e3be: 4f01 .O LDR r7,[pc,#4] ; [0x12e3c4] = 0x20120000
0x0012e3c0: 61be .a STR r6,[r7,#0x18]
0x0012e3c2: bdf0 .. POP {r4-r7,pc}
$d
0x0012e3c4: 20120000 ... DCD 538050560
$t
i.dmac_ch0_dar_l_set
dmac_ch0_dar_l_set
0x0012e3c8: 4901 .I LDR r1,[pc,#4] ; [0x12e3d0] = 0x20120000
0x0012e3ca: 6088 .` STR r0,[r1,#8]
0x0012e3cc: 4770 pG BX lr
$d
0x0012e3ce: 0000 .. DCW 0
0x0012e3d0: 20120000 ... DCD 538050560
$t
i.dmac_ch0_sar_l_set
dmac_ch0_sar_l_set
0x0012e3d4: 4901 .I LDR r1,[pc,#4] ; [0x12e3dc] = 0x20120000
0x0012e3d6: 6008 .` STR r0,[r1,#0]
0x0012e3d8: 4770 pG BX lr
$d
0x0012e3da: 0000 .. DCW 0
0x0012e3dc: 20120000 ... DCD 538050560
$t
i.dmac_chenreg_l_pack
dmac_chenreg_l_pack
0x0012e3e0: 0202 .. LSLS r2,r0,#8
0x0012e3e2: 430a .C ORRS r2,r2,r1
0x0012e3e4: 4b01 .K LDR r3,[pc,#4] ; [0x12e3ec] = 0x20120380
0x0012e3e6: 621a .b STR r2,[r3,#0x20]
0x0012e3e8: 4770 pG BX lr
$d
0x0012e3ea: 0000 .. DCW 0
0x0012e3ec: 20120380 ... DCD 538051456
$t
i.dmac_clearblock_l_set
dmac_clearblock_l_set
0x0012e3f0: 4901 .I LDR r1,[pc,#4] ; [0x12e3f8] = 0x20120340
0x0012e3f2: 6008 .` STR r0,[r1,#0]
0x0012e3f4: 4770 pG BX lr
$d
0x0012e3f6: 0000 .. DCW 0
0x0012e3f8: 20120340 @.. DCD 538051392
$t
i.dmac_qspi_gate
dmac_qspi_gate
0x0012e3fc: b510 .. PUSH {r4,lr}
0x0012e3fe: 2011 . MOVS r0,#0x11
0x0012e400: 01c0 .. LSLS r0,r0,#7
0x0012e402: f000fb49 ..I. BL sysc_cpu_clkg1_set ; 0x12ea98
0x0012e406: bd10 .. POP {r4,pc}
i.dmac_transfer_QSPI_RX
dmac_transfer_QSPI_RX
0x0012e408: b57f .. PUSH {r0-r6,lr}
0x0012e40a: 4606 .F MOV r6,r0
0x0012e40c: 460c .F MOV r4,r1
0x0012e40e: 4615 .F MOV r5,r2
0x0012e410: f7ffffb4 .... BL clk_gate_dmac_set ; 0x12e37c
0x0012e414: 4630 0F MOV r0,r6
0x0012e416: f7ffffdd .... BL dmac_ch0_sar_l_set ; 0x12e3d4
0x0012e41a: 4620 F MOV r0,r4
0x0012e41c: f7ffffd4 .... BL dmac_ch0_dar_l_set ; 0x12e3c8
0x0012e420: 2000 . MOVS r0,#0
0x0012e422: 9000 .. STR r0,[sp,#0]
0x0012e424: 9001 .. STR r0,[sp,#4]
0x0012e426: 9002 .. STR r0,[sp,#8]
0x0012e428: 2302 .# MOVS r3,#2
0x0012e42a: 2204 ." MOVS r2,#4
0x0012e42c: 4611 .F MOV r1,r2
0x0012e42e: 9003 .. STR r0,[sp,#0xc]
0x0012e430: 4618 .F MOV r0,r3
0x0012e432: f7ffffb1 .... BL dmac_ch0_ctrl_l_pack ; 0x12e398
0x0012e436: b2a9 .. UXTH r1,r5
0x0012e438: 2000 . MOVS r0,#0
0x0012e43a: f7ffffa5 .... BL dmac_ch0_ctrl_h_pack ; 0x12e388
0x0012e43e: 2101 .! MOVS r1,#1
0x0012e440: 4608 .F MOV r0,r1
0x0012e442: f7ffffcd .... BL dmac_chenreg_l_pack ; 0x12e3e0
0x0012e446: bf00 .. NOP
0x0012e448: bf00 .. NOP
0x0012e44a: 4806 .H LDR r0,[pc,#24] ; [0x12e464] = 0x201202c0
0x0012e44c: 6880 .h LDR r0,[r0,#8]
0x0012e44e: 07c0 .. LSLS r0,r0,#31
0x0012e450: 0fc0 .. LSRS r0,r0,#31
0x0012e452: 2800 .( CMP r0,#0
0x0012e454: d0f8 .. BEQ 0x12e448 ; dmac_transfer_QSPI_RX + 64
0x0012e456: 2001 . MOVS r0,#1
0x0012e458: f7ffffca .... BL dmac_clearblock_l_set ; 0x12e3f0
0x0012e45c: f7ffff82 .... BL clk_gate_dmac_clr ; 0x12e364
0x0012e460: bd7f .. POP {r0-r6,pc}
$d
0x0012e462: 0000 .. DCW 0
0x0012e464: 201202c0 ... DCD 538051264
$t
i.dmac_transfer_QSPI_RX_32Bit
dmac_transfer_QSPI_RX_32Bit
0x0012e468: b57f .. PUSH {r0-r6,lr}
0x0012e46a: 4606 .F MOV r6,r0
0x0012e46c: 460c .F MOV r4,r1
0x0012e46e: 4615 .F MOV r5,r2
0x0012e470: f7ffff84 .... BL clk_gate_dmac_set ; 0x12e37c
0x0012e474: 4630 0F MOV r0,r6
0x0012e476: f7ffffad .... BL dmac_ch0_sar_l_set ; 0x12e3d4
0x0012e47a: 4620 F MOV r0,r4
0x0012e47c: f7ffffa4 .... BL dmac_ch0_dar_l_set ; 0x12e3c8
0x0012e480: 2000 . MOVS r0,#0
0x0012e482: 2102 .! MOVS r1,#2
0x0012e484: 9101 .. STR r1,[sp,#4]
0x0012e486: 9000 .. STR r0,[sp,#0]
0x0012e488: 460b .F MOV r3,r1
0x0012e48a: 2204 ." MOVS r2,#4
0x0012e48c: 9102 .. STR r1,[sp,#8]
0x0012e48e: 9003 .. STR r0,[sp,#0xc]
0x0012e490: 4611 .F MOV r1,r2
0x0012e492: 2002 . MOVS r0,#2
0x0012e494: f7ffff80 .... BL dmac_ch0_ctrl_l_pack ; 0x12e398
0x0012e498: b2a9 .. UXTH r1,r5
0x0012e49a: 2000 . MOVS r0,#0
0x0012e49c: f7ffff74 ..t. BL dmac_ch0_ctrl_h_pack ; 0x12e388
0x0012e4a0: 2101 .! MOVS r1,#1
0x0012e4a2: 4608 .F MOV r0,r1
0x0012e4a4: f7ffff9c .... BL dmac_chenreg_l_pack ; 0x12e3e0
0x0012e4a8: bf00 .. NOP
0x0012e4aa: bf00 .. NOP
0x0012e4ac: 4805 .H LDR r0,[pc,#20] ; [0x12e4c4] = 0x201202c0
0x0012e4ae: 6880 .h LDR r0,[r0,#8]
0x0012e4b0: 07c0 .. LSLS r0,r0,#31
0x0012e4b2: 0fc0 .. LSRS r0,r0,#31
0x0012e4b4: 2800 .( CMP r0,#0
0x0012e4b6: d0f8 .. BEQ 0x12e4aa ; dmac_transfer_QSPI_RX_32Bit + 66
0x0012e4b8: 2001 . MOVS r0,#1
0x0012e4ba: f7ffff99 .... BL dmac_clearblock_l_set ; 0x12e3f0
0x0012e4be: f7ffff51 ..Q. BL clk_gate_dmac_clr ; 0x12e364
0x0012e4c2: bd7f .. POP {r0-r6,pc}
$d
0x0012e4c4: 201202c0 ... DCD 538051264
$t
i.flash_cache_init
flash_cache_init
0x0012e4c8: b5f0 .. PUSH {r4-r7,lr}
0x0012e4ca: b085 .. SUB sp,sp,#0x14
0x0012e4cc: 4604 .F MOV r4,r0
0x0012e4ce: 2001 . MOVS r0,#1
0x0012e4d0: 0280 .. LSLS r0,r0,#10
0x0012e4d2: f7ffff23 ..#. BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e4d6: 2000 . MOVS r0,#0
0x0012e4d8: f000fa94 .... BL qspi_ssi_en_setf ; 0x12ea04
0x0012e4dc: 2002 . MOVS r0,#2
0x0012e4de: 493b ;I LDR r1,[pc,#236] ; [0x12e5cc] = 0x20300000
0x0012e4e0: 6949 Ii LDR r1,[r1,#0x14]
0x0012e4e2: 0c09 .. LSRS r1,r1,#16
0x0012e4e4: 0409 .. LSLS r1,r1,#16
0x0012e4e6: 4301 .C ORRS r1,r1,r0
0x0012e4e8: 4a38 8J LDR r2,[pc,#224] ; [0x12e5cc] = 0x20300000
0x0012e4ea: 6151 Qa STR r1,[r2,#0x14]
0x0012e4ec: bf00 .. NOP
0x0012e4ee: 211f .! MOVS r1,#0x1f
0x0012e4f0: 2200 ." MOVS r2,#0
0x0012e4f2: 4613 .F MOV r3,r2
0x0012e4f4: 4615 .F MOV r5,r2
0x0012e4f6: 9201 .. STR r2,[sp,#4]
0x0012e4f8: 9202 .. STR r2,[sp,#8]
0x0012e4fa: 9203 .. STR r2,[sp,#0xc]
0x0012e4fc: 9000 .. STR r0,[sp,#0]
0x0012e4fe: 0546 F. LSLS r6,r0,#21
0x0012e500: 040f .. LSLS r7,r1,#16
0x0012e502: 433e >C ORRS r6,r6,r7
0x0012e504: 0317 .. LSLS r7,r2,#12
0x0012e506: 433e >C ORRS r6,r6,r7
0x0012e508: 02df .. LSLS r7,r3,#11
0x0012e50a: 433e >C ORRS r6,r6,r7
0x0012e50c: 02af .. LSLS r7,r5,#10
0x0012e50e: 433e >C ORRS r6,r6,r7
0x0012e510: 9f00 .. LDR r7,[sp,#0]
0x0012e512: 023f ?. LSLS r7,r7,#8
0x0012e514: 433e >C ORRS r6,r6,r7
0x0012e516: 9f01 .. LDR r7,[sp,#4]
0x0012e518: 01ff .. LSLS r7,r7,#7
0x0012e51a: 433e >C ORRS r6,r6,r7
0x0012e51c: 9f02 .. LDR r7,[sp,#8]
0x0012e51e: 01bf .. LSLS r7,r7,#6
0x0012e520: 433e >C ORRS r6,r6,r7
0x0012e522: 9f03 .. LDR r7,[sp,#0xc]
0x0012e524: 013f ?. LSLS r7,r7,#4
0x0012e526: 433e >C ORRS r6,r6,r7
0x0012e528: 4f28 (O LDR r7,[pc,#160] ; [0x12e5cc] = 0x20300000
0x0012e52a: 603e >` STR r6,[r7,#0]
0x0012e52c: bf00 .. NOP
0x0012e52e: 2007 . MOVS r0,#7
0x0012e530: 4639 9F MOV r1,r7
0x0012e532: 6048 H` STR r0,[r1,#4]
0x0012e534: bf00 .. NOP
0x0012e536: 2008 . MOVS r0,#8
0x0012e538: 2102 .! MOVS r1,#2
0x0012e53a: 2206 ." MOVS r2,#6
0x0012e53c: 2300 .# MOVS r3,#0
0x0012e53e: 02c5 .. LSLS r5,r0,#11
0x0012e540: 020e .. LSLS r6,r1,#8
0x0012e542: 4335 5C ORRS r5,r5,r6
0x0012e544: 0096 .. LSLS r6,r2,#2
0x0012e546: 4335 5C ORRS r5,r5,r6
0x0012e548: 431d .C ORRS r5,r5,r3
0x0012e54a: 4e20 N LDR r6,[pc,#128] ; [0x12e5cc] = 0x20300000
0x0012e54c: 36c0 .6 ADDS r6,r6,#0xc0
0x0012e54e: 6375 uc STR r5,[r6,#0x34]
0x0012e550: bf00 .. NOP
0x0012e552: 2000 . MOVS r0,#0
0x0012e554: 4639 9F MOV r1,r7
0x0012e556: 62c8 .b STR r0,[r1,#0x2c]
0x0012e558: bf00 .. NOP
0x0012e55a: 2001 . MOVS r0,#1
0x0012e55c: 6108 .a STR r0,[r1,#0x10]
0x0012e55e: bf00 .. NOP
0x0012e560: f000fa50 ..P. BL qspi_ssi_en_setf ; 0x12ea04
0x0012e564: bf00 .. NOP
0x0012e566: 481a .H LDR r0,[pc,#104] ; [0x12e5d0] = 0x20121000
0x0012e568: 6044 D` STR r4,[r0,#4]
0x0012e56a: bf00 .. NOP
0x0012e56c: 4817 .H LDR r0,[pc,#92] ; [0x12e5cc] = 0x20300000
0x0012e56e: 3060 `0 ADDS r0,r0,#0x60
0x0012e570: 4917 .I LDR r1,[pc,#92] ; [0x12e5d0] = 0x20121000
0x0012e572: 6088 .` STR r0,[r1,#8]
0x0012e574: bf00 .. NOP
0x0012e576: 2027 ' MOVS r0,#0x27
0x0012e578: 01c0 .. LSLS r0,r0,#7
0x0012e57a: 2100 .! MOVS r1,#0
0x0012e57c: 460a .F MOV r2,r1
0x0012e57e: 460b .F MOV r3,r1
0x0012e580: 256b k% MOVS r5,#0x6b
0x0012e582: 0406 .. LSLS r6,r0,#16
0x0012e584: 028f .. LSLS r7,r1,#10
0x0012e586: 433e >C ORRS r6,r6,r7
0x0012e588: 0257 W. LSLS r7,r2,#9
0x0012e58a: 433e >C ORRS r6,r6,r7
0x0012e58c: 021f .. LSLS r7,r3,#8
0x0012e58e: 433e >C ORRS r6,r6,r7
0x0012e590: 432e .C ORRS r6,r6,r5
0x0012e592: 4f0f .O LDR r7,[pc,#60] ; [0x12e5d0] = 0x20121000
0x0012e594: 60fe .` STR r6,[r7,#0xc]
0x0012e596: bf00 .. NOP
0x0012e598: 2001 . MOVS r0,#1
0x0012e59a: f7fffeb3 .... BL cache_reg_cache_en_set ; 0x12e304
0x0012e59e: 2001 . MOVS r0,#1
0x0012e5a0: 4639 9F MOV r1,r7
0x0012e5a2: 6188 .a STR r0,[r1,#0x18]
0x0012e5a4: bf00 .. NOP
0x0012e5a6: f7fffeb3 .... BL cache_reg_flush_en_set ; 0x12e310
0x0012e5aa: 2001 . MOVS r0,#1
0x0012e5ac: 4909 .I LDR r1,[pc,#36] ; [0x12e5d4] = 0x20132040
0x0012e5ae: 6809 .h LDR r1,[r1,#0]
0x0012e5b0: 4381 .C BICS r1,r1,r0
0x0012e5b2: 4301 .C ORRS r1,r1,r0
0x0012e5b4: 4a07 .J LDR r2,[pc,#28] ; [0x12e5d4] = 0x20132040
0x0012e5b6: 6011 .` STR r1,[r2,#0]
0x0012e5b8: bf00 .. NOP
0x0012e5ba: bf00 .. NOP
0x0012e5bc: bf00 .. NOP
0x0012e5be: 4804 .H LDR r0,[pc,#16] ; [0x12e5d0] = 0x20121000
0x0012e5c0: 69c0 .i LDR r0,[r0,#0x1c]
0x0012e5c2: 2800 .( CMP r0,#0
0x0012e5c4: d1fa .. BNE 0x12e5bc ; flash_cache_init + 244
0x0012e5c6: b005 .. ADD sp,sp,#0x14
0x0012e5c8: bdf0 .. POP {r4-r7,pc}
$d
0x0012e5ca: 0000 .. DCW 0
0x0012e5cc: 20300000 ..0 DCD 540016640
0x0012e5d0: 20121000 ... DCD 538054656
0x0012e5d4: 20132040 @ . DCD 538124352
$t
i.flash_quad_read
flash_quad_read
0x0012e5d8: b5fe .. PUSH {r1-r7,lr}
0x0012e5da: 4604 .F MOV r4,r0
0x0012e5dc: 460d .F MOV r5,r1
0x0012e5de: 4616 .F MOV r6,r2
0x0012e5e0: 08af .. LSRS r7,r5,#2
0x0012e5e2: 07a8 .. LSLS r0,r5,#30
0x0012e5e4: 0f80 .. LSRS r0,r0,#30
0x0012e5e6: 9001 .. STR r0,[sp,#4]
0x0012e5e8: 2008 . MOVS r0,#8
0x0012e5ea: 4623 #F MOV r3,r4
0x0012e5ec: 226b k" MOVS r2,#0x6b
0x0012e5ee: 4639 9F MOV r1,r7
0x0012e5f0: 9000 .. STR r0,[sp,#0]
0x0012e5f2: 4630 0F MOV r0,r6
0x0012e5f4: f000f8ac .... BL qspi_flash_quad_read_data ; 0x12e750
0x0012e5f8: 00b8 .. LSLS r0,r7,#2
0x0012e5fa: 1836 6. ADDS r6,r6,r0
0x0012e5fc: 00b8 .. LSLS r0,r7,#2
0x0012e5fe: 1904 .. ADDS r4,r0,r4
0x0012e600: 9801 .. LDR r0,[sp,#4]
0x0012e602: 2800 .( CMP r0,#0
0x0012e604: d012 .. BEQ 0x12e62c ; flash_quad_read + 84
0x0012e606: 2103 .! MOVS r1,#3
0x0012e608: 4668 hF MOV r0,sp
0x0012e60a: 7001 .p STRB r1,[r0,#0]
0x0012e60c: 0220 . LSLS r0,r4,#8
0x0012e60e: 0e01 .. LSRS r1,r0,#24
0x0012e610: 4668 hF MOV r0,sp
0x0012e612: 7041 Ap STRB r1,[r0,#1]
0x0012e614: 0420 . LSLS r0,r4,#16
0x0012e616: 0e01 .. LSRS r1,r0,#24
0x0012e618: 4668 hF MOV r0,sp
0x0012e61a: 7081 .p STRB r1,[r0,#2]
0x0012e61c: 70c4 .p STRB r4,[r0,#3]
0x0012e61e: 2304 .# MOVS r3,#4
0x0012e620: 466a jF MOV r2,sp
0x0012e622: 4630 0F MOV r0,r6
0x0012e624: 9901 .. LDR r1,[sp,#4]
0x0012e626: f000f973 ..s. BL qspi_read ; 0x12e910
0x0012e62a: bf00 .. NOP
0x0012e62c: 2000 . MOVS r0,#0
0x0012e62e: bdfe .. POP {r1-r7,pc}
i.flash_read
flash_read
0x0012e630: b5fe .. PUSH {r1-r7,lr}
0x0012e632: 4604 .F MOV r4,r0
0x0012e634: 460d .F MOV r5,r1
0x0012e636: 4616 .F MOV r6,r2
0x0012e638: 08af .. LSRS r7,r5,#2
0x0012e63a: 07a8 .. LSLS r0,r5,#30
0x0012e63c: 0f80 .. LSRS r0,r0,#30
0x0012e63e: 9001 .. STR r0,[sp,#4]
0x0012e640: 4623 #F MOV r3,r4
0x0012e642: 2203 ." MOVS r2,#3
0x0012e644: 4639 9F MOV r1,r7
0x0012e646: 4630 0F MOV r0,r6
0x0012e648: f000f8f8 .... BL qspi_flash_read_data ; 0x12e83c
0x0012e64c: 00b8 .. LSLS r0,r7,#2
0x0012e64e: 1836 6. ADDS r6,r6,r0
0x0012e650: 00b8 .. LSLS r0,r7,#2
0x0012e652: 1904 .. ADDS r4,r0,r4
0x0012e654: 9801 .. LDR r0,[sp,#4]
0x0012e656: 2800 .( CMP r0,#0
0x0012e658: d012 .. BEQ 0x12e680 ; flash_read + 80
0x0012e65a: 2103 .! MOVS r1,#3
0x0012e65c: 4668 hF MOV r0,sp
0x0012e65e: 7001 .p STRB r1,[r0,#0]
0x0012e660: 0220 . LSLS r0,r4,#8
0x0012e662: 0e01 .. LSRS r1,r0,#24
0x0012e664: 4668 hF MOV r0,sp
0x0012e666: 7041 Ap STRB r1,[r0,#1]
0x0012e668: 0420 . LSLS r0,r4,#16
0x0012e66a: 0e01 .. LSRS r1,r0,#24
0x0012e66c: 4668 hF MOV r0,sp
0x0012e66e: 7081 .p STRB r1,[r0,#2]
0x0012e670: 70c4 .p STRB r4,[r0,#3]
0x0012e672: 2304 .# MOVS r3,#4
0x0012e674: 466a jF MOV r2,sp
0x0012e676: 4630 0F MOV r0,r6
0x0012e678: 9901 .. LDR r1,[sp,#4]
0x0012e67a: f000f949 ..I. BL qspi_read ; 0x12e910
0x0012e67e: bf00 .. NOP
0x0012e680: 2000 . MOVS r0,#0
0x0012e682: bdfe .. POP {r1-r7,pc}
i.image_read
image_read
0x0012e684: b5f8 .. PUSH {r3-r7,lr}
0x0012e686: 4605 .F MOV r5,r0
0x0012e688: 460c .F MOV r4,r1
0x0012e68a: 6a20 j LDR r0,[r4,#0x20]
0x0012e68c: 2800 .( CMP r0,#0
0x0012e68e: d002 .. BEQ 0x12e696 ; image_read + 18
0x0012e690: 2001 . MOVS r0,#1
0x0012e692: 04c0 .. LSLS r0,r0,#19
0x0012e694: e000 .. B 0x12e698 ; image_read + 20
0x0012e696: 2000 . MOVS r0,#0
0x0012e698: 9000 .. STR r0,[sp,#0]
0x0012e69a: 6921 !i LDR r1,[r4,#0x10]
0x0012e69c: 9800 .. LDR r0,[sp,#0]
0x0012e69e: 180e .. ADDS r6,r1,r0
0x0012e6a0: 2701 .' MOVS r7,#1
0x0012e6a2: 053f ?. LSLS r7,r7,#20
0x0012e6a4: 463a :F MOV r2,r7
0x0012e6a6: 4630 0F MOV r0,r6
0x0012e6a8: 6961 ai LDR r1,[r4,#0x14]
0x0012e6aa: 47a8 .G BLX r5
0x0012e6ac: bdf8 .. POP {r3-r7,pc}
0x0012e6ae: 0000 .. MOVS r0,r0
i.peri_gate
peri_gate
0x0012e6b0: b510 .. PUSH {r4,lr}
0x0012e6b2: 4807 .H LDR r0,[pc,#28] ; [0x12e6d0] = 0x2aaa
0x0012e6b4: 4907 .I LDR r1,[pc,#28] ; [0x12e6d4] = 0x20149000
0x0012e6b6: 6148 Ha STR r0,[r1,#0x14]
0x0012e6b8: bf00 .. NOP
0x0012e6ba: 4807 .H LDR r0,[pc,#28] ; [0x12e6d8] = 0xaaaaaaa
0x0012e6bc: 6108 .a STR r0,[r1,#0x10]
0x0012e6be: bf00 .. NOP
0x0012e6c0: 2080 . MOVS r0,#0x80
0x0012e6c2: 4906 .I LDR r1,[pc,#24] ; [0x12e6dc] = 0x20132000
0x0012e6c4: 6108 .a STR r0,[r1,#0x10]
0x0012e6c6: bf00 .. NOP
0x0012e6c8: 4805 .H LDR r0,[pc,#20] ; [0x12e6e0] = 0xaa220
0x0012e6ca: f000f9e5 .... BL sysc_cpu_clkg1_set ; 0x12ea98
0x0012e6ce: bd10 .. POP {r4,pc}
$d
0x0012e6d0: 00002aaa .*.. DCD 10922
0x0012e6d4: 20149000 ... DCD 538218496
0x0012e6d8: 0aaaaaaa .... DCD 178956970
0x0012e6dc: 20132000 . . DCD 538124288
0x0012e6e0: 000aa220 ... DCD 696864
$t
i.qspi_ctrlr0_pack
qspi_ctrlr0_pack
0x0012e6e4: b5f0 .. PUSH {r4-r7,lr}
0x0012e6e6: 9d06 .. LDR r5,[sp,#0x18]
0x0012e6e8: 9c05 .. LDR r4,[sp,#0x14]
0x0012e6ea: 0546 F. LSLS r6,r0,#21
0x0012e6ec: 040f .. LSLS r7,r1,#16
0x0012e6ee: 433e >C ORRS r6,r6,r7
0x0012e6f0: 0317 .. LSLS r7,r2,#12
0x0012e6f2: 433e >C ORRS r6,r6,r7
0x0012e6f4: 02df .. LSLS r7,r3,#11
0x0012e6f6: 433e >C ORRS r6,r6,r7
0x0012e6f8: 02a7 .. LSLS r7,r4,#10
0x0012e6fa: 433e >C ORRS r6,r6,r7
0x0012e6fc: 022f /. LSLS r7,r5,#8
0x0012e6fe: 433e >C ORRS r6,r6,r7
0x0012e700: 9f07 .. LDR r7,[sp,#0x1c]
0x0012e702: 01ff .. LSLS r7,r7,#7
0x0012e704: 433e >C ORRS r6,r6,r7
0x0012e706: 9f08 .. LDR r7,[sp,#0x20]
0x0012e708: 01bf .. LSLS r7,r7,#6
0x0012e70a: 433e >C ORRS r6,r6,r7
0x0012e70c: 9f09 .. LDR r7,[sp,#0x24]
0x0012e70e: 013f ?. LSLS r7,r7,#4
0x0012e710: 433e >C ORRS r6,r6,r7
0x0012e712: 4f01 .O LDR r7,[pc,#4] ; [0x12e718] = 0x20300000
0x0012e714: 603e >` STR r6,[r7,#0]
0x0012e716: bdf0 .. POP {r4-r7,pc}
$d
0x0012e718: 20300000 ..0 DCD 540016640
$t
i.qspi_ctrlr1_pack
qspi_ctrlr1_pack
0x0012e71c: 4901 .I LDR r1,[pc,#4] ; [0x12e724] = 0x20300000
0x0012e71e: 6048 H` STR r0,[r1,#4]
0x0012e720: 4770 pG BX lr
$d
0x0012e722: 0000 .. DCW 0
0x0012e724: 20300000 ..0 DCD 540016640
$t
i.qspi_dmacr_pack
qspi_dmacr_pack
0x0012e728: 0042 B. LSLS r2,r0,#1
0x0012e72a: 430a .C ORRS r2,r2,r1
0x0012e72c: 4b01 .K LDR r3,[pc,#4] ; [0x12e734] = 0x20300040
0x0012e72e: 60da .` STR r2,[r3,#0xc]
0x0012e730: 4770 pG BX lr
$d
0x0012e732: 0000 .. DCW 0
0x0012e734: 20300040 @.0 DCD 540016704
$t
i.qspi_dmardlr_set
qspi_dmardlr_set
0x0012e738: 4901 .I LDR r1,[pc,#4] ; [0x12e740] = 0x20300040
0x0012e73a: 6148 Ha STR r0,[r1,#0x14]
0x0012e73c: 4770 pG BX lr
$d
0x0012e73e: 0000 .. DCW 0
0x0012e740: 20300040 @.0 DCD 540016704
$t
i.qspi_dr_set
qspi_dr_set
0x0012e744: 4901 .I LDR r1,[pc,#4] ; [0x12e74c] = 0x20300040
0x0012e746: 6208 .b STR r0,[r1,#0x20]
0x0012e748: 4770 pG BX lr
$d
0x0012e74a: 0000 .. DCW 0
0x0012e74c: 20300040 @.0 DCD 540016704
$t
i.qspi_flash_quad_read_data
qspi_flash_quad_read_data
0x0012e750: b5ff .. PUSH {r0-r7,lr}
0x0012e752: b089 .. SUB sp,sp,#0x24
0x0012e754: 4604 .F MOV r4,r0
0x0012e756: 460d .F MOV r5,r1
0x0012e758: 9e12 .. LDR r6,[sp,#0x48]
0x0012e75a: 2001 . MOVS r0,#1
0x0012e75c: 0280 .. LSLS r0,r0,#10
0x0012e75e: f7fffddd .... BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e762: 4933 3I LDR r1,[pc,#204] ; [0x12e830] = 0xfff
0x0012e764: 4628 (F MOV r0,r5
0x0012e766: f7fffc55 ..U. BL __aeabi_uidiv ; 0x12e014
0x0012e76a: b280 .. UXTH r0,r0
0x0012e76c: 9008 .. STR r0,[sp,#0x20]
0x0012e76e: 4930 0I LDR r1,[pc,#192] ; [0x12e830] = 0xfff
0x0012e770: 4628 (F MOV r0,r5
0x0012e772: f7fffc4f ..O. BL __aeabi_uidiv ; 0x12e014
0x0012e776: 9107 .. STR r1,[sp,#0x1c]
0x0012e778: 2000 . MOVS r0,#0
0x0012e77a: f000f937 ..7. BL qspi_ssi_en_setf ; 0x12e9ec
0x0012e77e: 2000 . MOVS r0,#0
0x0012e780: f000f92e .... BL qspi_ser_set ; 0x12e9e0
0x0012e784: 2000 . MOVS r0,#0
0x0012e786: 2302 .# MOVS r3,#2
0x0012e788: 9002 .. STR r0,[sp,#8]
0x0012e78a: 9003 .. STR r0,[sp,#0xc]
0x0012e78c: 9004 .. STR r0,[sp,#0x10]
0x0012e78e: 9301 .. STR r3,[sp,#4]
0x0012e790: 9000 .. STR r0,[sp,#0]
0x0012e792: 4603 .F MOV r3,r0
0x0012e794: 4602 .F MOV r2,r0
0x0012e796: 211f .! MOVS r1,#0x1f
0x0012e798: 2002 . MOVS r0,#2
0x0012e79a: f7ffffa3 .... BL qspi_ctrlr0_pack ; 0x12e6e4
0x0012e79e: 1e69 i. SUBS r1,r5,#1
0x0012e7a0: b288 .. UXTH r0,r1
0x0012e7a2: f7ffffbb .... BL qspi_ctrlr1_pack ; 0x12e71c
0x0012e7a6: 2002 . MOVS r0,#2
0x0012e7a8: 2106 .! MOVS r1,#6
0x0012e7aa: 2700 .' MOVS r7,#0
0x0012e7ac: 02f2 .. LSLS r2,r6,#11
0x0012e7ae: 0203 .. LSLS r3,r0,#8
0x0012e7b0: 431a .C ORRS r2,r2,r3
0x0012e7b2: 008b .. LSLS r3,r1,#2
0x0012e7b4: 431a .C ORRS r2,r2,r3
0x0012e7b6: 433a :C ORRS r2,r2,r7
0x0012e7b8: 4b1e .K LDR r3,[pc,#120] ; [0x12e834] = 0x203000c0
0x0012e7ba: 635a Zc STR r2,[r3,#0x34]
0x0012e7bc: bf00 .. NOP
0x0012e7be: 201f . MOVS r0,#0x1f
0x0012e7c0: f7ffffba .... BL qspi_dmardlr_set ; 0x12e738
0x0012e7c4: 2100 .! MOVS r1,#0
0x0012e7c6: 4608 .F MOV r0,r1
0x0012e7c8: f7ffffae .... BL qspi_dmacr_pack ; 0x12e728
0x0012e7cc: 2101 .! MOVS r1,#1
0x0012e7ce: 2000 . MOVS r0,#0
0x0012e7d0: f7ffffaa .... BL qspi_dmacr_pack ; 0x12e728
0x0012e7d4: 2001 . MOVS r0,#1
0x0012e7d6: f000f921 ..!. BL qspi_ssienr_set ; 0x12ea1c
0x0012e7da: 980b .. LDR r0,[sp,#0x2c]
0x0012e7dc: f7ffffb2 .... BL qspi_dr_set ; 0x12e744
0x0012e7e0: 980c .. LDR r0,[sp,#0x30]
0x0012e7e2: f7ffffaf .... BL qspi_dr_set ; 0x12e744
0x0012e7e6: 2001 . MOVS r0,#1
0x0012e7e8: f000f8fa .... BL qspi_ser_set ; 0x12e9e0
0x0012e7ec: 2000 . MOVS r0,#0
0x0012e7ee: 9006 .. STR r0,[sp,#0x18]
0x0012e7f0: e00b .. B 0x12e80a ; qspi_flash_quad_read_data + 186
0x0012e7f2: 4810 .H LDR r0,[pc,#64] ; [0x12e834] = 0x203000c0
0x0012e7f4: 302c ,0 ADDS r0,r0,#0x2c
0x0012e7f6: 4a0e .J LDR r2,[pc,#56] ; [0x12e830] = 0xfff
0x0012e7f8: 4621 !F MOV r1,r4
0x0012e7fa: f7fffe35 ..5. BL dmac_transfer_QSPI_RX_32Bit ; 0x12e468
0x0012e7fe: 480e .H LDR r0,[pc,#56] ; [0x12e838] = 0x3ffc
0x0012e800: 1824 $. ADDS r4,r4,r0
0x0012e802: 9806 .. LDR r0,[sp,#0x18]
0x0012e804: 1c40 @. ADDS r0,r0,#1
0x0012e806: b280 .. UXTH r0,r0
0x0012e808: 9006 .. STR r0,[sp,#0x18]
0x0012e80a: 9908 .. LDR r1,[sp,#0x20]
0x0012e80c: 9806 .. LDR r0,[sp,#0x18]
0x0012e80e: 4288 .B CMP r0,r1
0x0012e810: dbef .. BLT 0x12e7f2 ; qspi_flash_quad_read_data + 162
0x0012e812: 4808 .H LDR r0,[pc,#32] ; [0x12e834] = 0x203000c0
0x0012e814: 302c ,0 ADDS r0,r0,#0x2c
0x0012e816: 4621 !F MOV r1,r4
0x0012e818: 9a07 .. LDR r2,[sp,#0x1c]
0x0012e81a: f7fffe25 ..%. BL dmac_transfer_QSPI_RX_32Bit ; 0x12e468
0x0012e81e: 2000 . MOVS r0,#0
0x0012e820: f000f8fc .... BL qspi_ssienr_set ; 0x12ea1c
0x0012e824: 2001 . MOVS r0,#1
0x0012e826: 02c0 .. LSLS r0,r0,#11
0x0012e828: f7fffd78 ..x. BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e82c: b00d .. ADD sp,sp,#0x34
0x0012e82e: bdf0 .. POP {r4-r7,pc}
$d
0x0012e830: 00000fff .... DCD 4095
0x0012e834: 203000c0 ..0 DCD 540016832
0x0012e838: 00003ffc .?.. DCD 16380
$t
i.qspi_flash_read_data
qspi_flash_read_data
0x0012e83c: b5f0 .. PUSH {r4-r7,lr}
0x0012e83e: b089 .. SUB sp,sp,#0x24
0x0012e840: 4604 .F MOV r4,r0
0x0012e842: 460d .F MOV r5,r1
0x0012e844: 4616 .F MOV r6,r2
0x0012e846: 461f .F MOV r7,r3
0x0012e848: 2001 . MOVS r0,#1
0x0012e84a: 0280 .. LSLS r0,r0,#10
0x0012e84c: f7fffd66 ..f. BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e850: 492c ,I LDR r1,[pc,#176] ; [0x12e904] = 0xfff
0x0012e852: 4628 (F MOV r0,r5
0x0012e854: f7fffbde .... BL __aeabi_uidiv ; 0x12e014
0x0012e858: b280 .. UXTH r0,r0
0x0012e85a: 9008 .. STR r0,[sp,#0x20]
0x0012e85c: 4929 )I LDR r1,[pc,#164] ; [0x12e904] = 0xfff
0x0012e85e: 4628 (F MOV r0,r5
0x0012e860: f7fffbd8 .... BL __aeabi_uidiv ; 0x12e014
0x0012e864: 9107 .. STR r1,[sp,#0x1c]
0x0012e866: 2000 . MOVS r0,#0
0x0012e868: f000f8c0 .... BL qspi_ssi_en_setf ; 0x12e9ec
0x0012e86c: 2000 . MOVS r0,#0
0x0012e86e: f000f8b7 .... BL qspi_ser_set ; 0x12e9e0
0x0012e872: 2000 . MOVS r0,#0
0x0012e874: 2303 .# MOVS r3,#3
0x0012e876: 9002 .. STR r0,[sp,#8]
0x0012e878: 9003 .. STR r0,[sp,#0xc]
0x0012e87a: 9004 .. STR r0,[sp,#0x10]
0x0012e87c: 9301 .. STR r3,[sp,#4]
0x0012e87e: 9000 .. STR r0,[sp,#0]
0x0012e880: 4603 .F MOV r3,r0
0x0012e882: 4602 .F MOV r2,r0
0x0012e884: 211f .! MOVS r1,#0x1f
0x0012e886: f7ffff2d ..-. BL qspi_ctrlr0_pack ; 0x12e6e4
0x0012e88a: 1e69 i. SUBS r1,r5,#1
0x0012e88c: b288 .. UXTH r0,r1
0x0012e88e: f7ffff45 ..E. BL qspi_ctrlr1_pack ; 0x12e71c
0x0012e892: 201f . MOVS r0,#0x1f
0x0012e894: f7ffff50 ..P. BL qspi_dmardlr_set ; 0x12e738
0x0012e898: 2100 .! MOVS r1,#0
0x0012e89a: 4608 .F MOV r0,r1
0x0012e89c: f7ffff44 ..D. BL qspi_dmacr_pack ; 0x12e728
0x0012e8a0: 2101 .! MOVS r1,#1
0x0012e8a2: 2000 . MOVS r0,#0
0x0012e8a4: f7ffff40 ..@. BL qspi_dmacr_pack ; 0x12e728
0x0012e8a8: 2001 . MOVS r0,#1
0x0012e8aa: f000f8b7 .... BL qspi_ssienr_set ; 0x12ea1c
0x0012e8ae: 0239 9. LSLS r1,r7,#8
0x0012e8b0: 0a09 .. LSRS r1,r1,#8
0x0012e8b2: 0632 2. LSLS r2,r6,#24
0x0012e8b4: 4311 .C ORRS r1,r1,r2
0x0012e8b6: 4608 .F MOV r0,r1
0x0012e8b8: f7ffff44 ..D. BL qspi_dr_set ; 0x12e744
0x0012e8bc: 2001 . MOVS r0,#1
0x0012e8be: f000f88f .... BL qspi_ser_set ; 0x12e9e0
0x0012e8c2: 2000 . MOVS r0,#0
0x0012e8c4: 9006 .. STR r0,[sp,#0x18]
0x0012e8c6: e00a .. B 0x12e8de ; qspi_flash_read_data + 162
0x0012e8c8: 480f .H LDR r0,[pc,#60] ; [0x12e908] = 0x203000ec
0x0012e8ca: 4a0e .J LDR r2,[pc,#56] ; [0x12e904] = 0xfff
0x0012e8cc: 4621 !F MOV r1,r4
0x0012e8ce: f7fffdcb .... BL dmac_transfer_QSPI_RX_32Bit ; 0x12e468
0x0012e8d2: 480e .H LDR r0,[pc,#56] ; [0x12e90c] = 0x3ffc
0x0012e8d4: 1824 $. ADDS r4,r4,r0
0x0012e8d6: 9806 .. LDR r0,[sp,#0x18]
0x0012e8d8: 1c40 @. ADDS r0,r0,#1
0x0012e8da: b280 .. UXTH r0,r0
0x0012e8dc: 9006 .. STR r0,[sp,#0x18]
0x0012e8de: 9908 .. LDR r1,[sp,#0x20]
0x0012e8e0: 9806 .. LDR r0,[sp,#0x18]
0x0012e8e2: 4288 .B CMP r0,r1
0x0012e8e4: dbf0 .. BLT 0x12e8c8 ; qspi_flash_read_data + 140
0x0012e8e6: 4808 .H LDR r0,[pc,#32] ; [0x12e908] = 0x203000ec
0x0012e8e8: 4621 !F MOV r1,r4
0x0012e8ea: 9a07 .. LDR r2,[sp,#0x1c]
0x0012e8ec: f7fffdbc .... BL dmac_transfer_QSPI_RX_32Bit ; 0x12e468
0x0012e8f0: 2000 . MOVS r0,#0
0x0012e8f2: f000f893 .... BL qspi_ssienr_set ; 0x12ea1c
0x0012e8f6: 2001 . MOVS r0,#1
0x0012e8f8: 02c0 .. LSLS r0,r0,#11
0x0012e8fa: f7fffd0f .... BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e8fe: b009 .. ADD sp,sp,#0x24
0x0012e900: bdf0 .. POP {r4-r7,pc}
$d
0x0012e902: 0000 .. DCW 0
0x0012e904: 00000fff .... DCD 4095
0x0012e908: 203000ec ..0 DCD 540016876
0x0012e90c: 00003ffc .?.. DCD 16380
$t
i.qspi_read
qspi_read
0x0012e910: b5ff .. PUSH {r0-r7,lr}
0x0012e912: b085 .. SUB sp,sp,#0x14
0x0012e914: 4605 .F MOV r5,r0
0x0012e916: 460c .F MOV r4,r1
0x0012e918: 4617 .F MOV r7,r2
0x0012e91a: 2001 . MOVS r0,#1
0x0012e91c: 0280 .. LSLS r0,r0,#10
0x0012e91e: f7fffcfd .... BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e922: 2000 . MOVS r0,#0
0x0012e924: f000f862 ..b. BL qspi_ssi_en_setf ; 0x12e9ec
0x0012e928: 2000 . MOVS r0,#0
0x0012e92a: f000f859 ..Y. BL qspi_ser_set ; 0x12e9e0
0x0012e92e: 2000 . MOVS r0,#0
0x0012e930: 2303 .# MOVS r3,#3
0x0012e932: 9002 .. STR r0,[sp,#8]
0x0012e934: 9003 .. STR r0,[sp,#0xc]
0x0012e936: 9004 .. STR r0,[sp,#0x10]
0x0012e938: 9301 .. STR r3,[sp,#4]
0x0012e93a: 9000 .. STR r0,[sp,#0]
0x0012e93c: 4603 .F MOV r3,r0
0x0012e93e: 4602 .F MOV r2,r0
0x0012e940: 2107 .! MOVS r1,#7
0x0012e942: f7fffecf .... BL qspi_ctrlr0_pack ; 0x12e6e4
0x0012e946: 1e61 a. SUBS r1,r4,#1
0x0012e948: b288 .. UXTH r0,r1
0x0012e94a: f7fffee7 .... BL qspi_ctrlr1_pack ; 0x12e71c
0x0012e94e: 2001 . MOVS r0,#1
0x0012e950: f000f864 ..d. BL qspi_ssienr_set ; 0x12ea1c
0x0012e954: 2600 .& MOVS r6,#0
0x0012e956: e005 .. B 0x12e964 ; qspi_read + 84
0x0012e958: 7838 8x LDRB r0,[r7,#0]
0x0012e95a: 1c7f .. ADDS r7,r7,#1
0x0012e95c: f7fffef2 .... BL qspi_dr_set ; 0x12e744
0x0012e960: 1c70 p. ADDS r0,r6,#1
0x0012e962: b286 .. UXTH r6,r0
0x0012e964: 9808 .. LDR r0,[sp,#0x20]
0x0012e966: 4286 .B CMP r6,r0
0x0012e968: dbf6 .. BLT 0x12e958 ; qspi_read + 72
0x0012e96a: 2001 . MOVS r0,#1
0x0012e96c: f000f838 ..8. BL qspi_ser_set ; 0x12e9e0
0x0012e970: 2c40 @, CMP r4,#0x40
0x0012e972: d819 .. BHI 0x12e9a8 ; qspi_read + 152
0x0012e974: bf00 .. NOP
0x0012e976: f000f857 ..W. BL qspi_tfe_getf ; 0x12ea28
0x0012e97a: 2801 .( CMP r0,#1
0x0012e97c: d1fb .. BNE 0x12e976 ; qspi_read + 102
0x0012e97e: bf00 .. NOP
0x0012e980: bf00 .. NOP
0x0012e982: 4816 .H LDR r0,[pc,#88] ; [0x12e9dc] = 0x20300000
0x0012e984: 6a80 .j LDR r0,[r0,#0x28]
0x0012e986: 07c0 .. LSLS r0,r0,#31
0x0012e988: 0fc0 .. LSRS r0,r0,#31
0x0012e98a: 2800 .( CMP r0,#0
0x0012e98c: d1f8 .. BNE 0x12e980 ; qspi_read + 112
0x0012e98e: 2600 .& MOVS r6,#0
0x0012e990: e007 .. B 0x12e9a2 ; qspi_read + 146
0x0012e992: bf00 .. NOP
0x0012e994: 4811 .H LDR r0,[pc,#68] ; [0x12e9dc] = 0x20300000
0x0012e996: 3040 @0 ADDS r0,r0,#0x40
0x0012e998: 6a00 .j LDR r0,[r0,#0x20]
0x0012e99a: 7028 (p STRB r0,[r5,#0]
0x0012e99c: 1c6d m. ADDS r5,r5,#1
0x0012e99e: 1c70 p. ADDS r0,r6,#1
0x0012e9a0: b286 .. UXTH r6,r0
0x0012e9a2: 42a6 .B CMP r6,r4
0x0012e9a4: d3f5 .. BCC 0x12e992 ; qspi_read + 130
0x0012e9a6: e010 .. B 0x12e9ca ; qspi_read + 186
0x0012e9a8: 201f . MOVS r0,#0x1f
0x0012e9aa: f7fffec5 .... BL qspi_dmardlr_set ; 0x12e738
0x0012e9ae: 2100 .! MOVS r1,#0
0x0012e9b0: 4608 .F MOV r0,r1
0x0012e9b2: f7fffeb9 .... BL qspi_dmacr_pack ; 0x12e728
0x0012e9b6: 2101 .! MOVS r1,#1
0x0012e9b8: 2000 . MOVS r0,#0
0x0012e9ba: f7fffeb5 .... BL qspi_dmacr_pack ; 0x12e728
0x0012e9be: 4807 .H LDR r0,[pc,#28] ; [0x12e9dc] = 0x20300000
0x0012e9c0: 3060 `0 ADDS r0,r0,#0x60
0x0012e9c2: 4622 "F MOV r2,r4
0x0012e9c4: 4629 )F MOV r1,r5
0x0012e9c6: f7fffd1f .... BL dmac_transfer_QSPI_RX ; 0x12e408
0x0012e9ca: 2000 . MOVS r0,#0
0x0012e9cc: f000f826 ..&. BL qspi_ssienr_set ; 0x12ea1c
0x0012e9d0: 2001 . MOVS r0,#1
0x0012e9d2: 02c0 .. LSLS r0,r0,#11
0x0012e9d4: f7fffca2 .... BL clk_gate_cpu_g1 ; 0x12e31c
0x0012e9d8: b009 .. ADD sp,sp,#0x24
0x0012e9da: bdf0 .. POP {r4-r7,pc}
$d
0x0012e9dc: 20300000 ..0 DCD 540016640
$t
i.qspi_ser_set
qspi_ser_set
0x0012e9e0: 4901 .I LDR r1,[pc,#4] ; [0x12e9e8] = 0x20300000
0x0012e9e2: 6108 .a STR r0,[r1,#0x10]
0x0012e9e4: 4770 pG BX lr
$d
0x0012e9e6: 0000 .. DCW 0
0x0012e9e8: 20300000 ..0 DCD 540016640
$t
i.qspi_ssi_en_setf
qspi_ssi_en_setf
0x0012e9ec: 4904 .I LDR r1,[pc,#16] ; [0x12ea00] = 0x20300000
0x0012e9ee: 6889 .h LDR r1,[r1,#8]
0x0012e9f0: 0849 I. LSRS r1,r1,#1
0x0012e9f2: 0049 I. LSLS r1,r1,#1
0x0012e9f4: 07c2 .. LSLS r2,r0,#31
0x0012e9f6: 0fd2 .. LSRS r2,r2,#31
0x0012e9f8: 4311 .C ORRS r1,r1,r2
0x0012e9fa: 4a01 .J LDR r2,[pc,#4] ; [0x12ea00] = 0x20300000
0x0012e9fc: 6091 .` STR r1,[r2,#8]
0x0012e9fe: 4770 pG BX lr
$d
0x0012ea00: 20300000 ..0 DCD 540016640
$t
i.qspi_ssi_en_setf
qspi_ssi_en_setf
0x0012ea04: 4904 .I LDR r1,[pc,#16] ; [0x12ea18] = 0x20300000
0x0012ea06: 6889 .h LDR r1,[r1,#8]
0x0012ea08: 0849 I. LSRS r1,r1,#1
0x0012ea0a: 0049 I. LSLS r1,r1,#1
0x0012ea0c: 07c2 .. LSLS r2,r0,#31
0x0012ea0e: 0fd2 .. LSRS r2,r2,#31
0x0012ea10: 4311 .C ORRS r1,r1,r2
0x0012ea12: 4a01 .J LDR r2,[pc,#4] ; [0x12ea18] = 0x20300000
0x0012ea14: 6091 .` STR r1,[r2,#8]
0x0012ea16: 4770 pG BX lr
$d
0x0012ea18: 20300000 ..0 DCD 540016640
$t
i.qspi_ssienr_set
qspi_ssienr_set
0x0012ea1c: 4901 .I LDR r1,[pc,#4] ; [0x12ea24] = 0x20300000
0x0012ea1e: 6088 .` STR r0,[r1,#8]
0x0012ea20: 4770 pG BX lr
$d
0x0012ea22: 0000 .. DCW 0
0x0012ea24: 20300000 ..0 DCD 540016640
$t
i.qspi_tfe_getf
qspi_tfe_getf
0x0012ea28: 4802 .H LDR r0,[pc,#8] ; [0x12ea34] = 0x20300000
0x0012ea2a: 6a80 .j LDR r0,[r0,#0x28]
0x0012ea2c: 0740 @. LSLS r0,r0,#29
0x0012ea2e: 0fc0 .. LSRS r0,r0,#31
0x0012ea30: 4770 pG BX lr
$d
0x0012ea32: 0000 .. DCW 0
0x0012ea34: 20300000 ..0 DCD 540016640
$t
i.sysc_awo_clkgen_awo_signal_1_set
sysc_awo_clkgen_awo_signal_1_set
0x0012ea38: 4901 .I LDR r1,[pc,#4] ; [0x12ea40] = 0x20201000
0x0012ea3a: 6388 .c STR r0,[r1,#0x38]
0x0012ea3c: 4770 pG BX lr
$d
0x0012ea3e: 0000 .. DCW 0
0x0012ea40: 20201000 .. DCD 538972160
$t
i.sysc_awo_dr_16m_rcosc_en_setf
sysc_awo_dr_16m_rcosc_en_setf
0x0012ea44: 4905 .I LDR r1,[pc,#20] ; [0x12ea5c] = 0x20201000
0x0012ea46: 69c9 .i LDR r1,[r1,#0x1c]
0x0012ea48: 2210 ." MOVS r2,#0x10
0x0012ea4a: 4391 .C BICS r1,r1,r2
0x0012ea4c: 0102 .. LSLS r2,r0,#4
0x0012ea4e: 2310 .# MOVS r3,#0x10
0x0012ea50: 401a .@ ANDS r2,r2,r3
0x0012ea52: 4311 .C ORRS r1,r1,r2
0x0012ea54: 4a01 .J LDR r2,[pc,#4] ; [0x12ea5c] = 0x20201000
0x0012ea56: 61d1 .a STR r1,[r2,#0x1c]
0x0012ea58: 4770 pG BX lr
$d
0x0012ea5a: 0000 .. DCW 0
0x0012ea5c: 20201000 .. DCD 538972160
$t
i.sysc_awo_reg_16m_rcosc_en_setf
sysc_awo_reg_16m_rcosc_en_setf
0x0012ea60: 4906 .I LDR r1,[pc,#24] ; [0x12ea7c] = 0x20201000
0x0012ea62: 69c9 .i LDR r1,[r1,#0x1c]
0x0012ea64: 2201 ." MOVS r2,#1
0x0012ea66: 0312 .. LSLS r2,r2,#12
0x0012ea68: 4391 .C BICS r1,r1,r2
0x0012ea6a: 0302 .. LSLS r2,r0,#12
0x0012ea6c: 2301 .# MOVS r3,#1
0x0012ea6e: 031b .. LSLS r3,r3,#12
0x0012ea70: 401a .@ ANDS r2,r2,r3
0x0012ea72: 4311 .C ORRS r1,r1,r2
0x0012ea74: 4a01 .J LDR r2,[pc,#4] ; [0x12ea7c] = 0x20201000
0x0012ea76: 61d1 .a STR r1,[r2,#0x1c]
0x0012ea78: 4770 pG BX lr
$d
0x0012ea7a: 0000 .. DCW 0
0x0012ea7c: 20201000 .. DCD 538972160
$t
i.sysc_awo_rf_reg_0_get
sysc_awo_rf_reg_0_get
0x0012ea80: 4801 .H LDR r0,[pc,#4] ; [0x12ea88] = 0x20201040
0x0012ea82: 6b00 .k LDR r0,[r0,#0x30]
0x0012ea84: 4770 pG BX lr
$d
0x0012ea86: 0000 .. DCW 0
0x0012ea88: 20201040 @. DCD 538972224
$t
i.sysc_awo_rf_reg_0_set
sysc_awo_rf_reg_0_set
0x0012ea8c: 4901 .I LDR r1,[pc,#4] ; [0x12ea94] = 0x20201040
0x0012ea8e: 6308 .c STR r0,[r1,#0x30]
0x0012ea90: 4770 pG BX lr
$d
0x0012ea92: 0000 .. DCW 0
0x0012ea94: 20201040 @. DCD 538972224
$t
i.sysc_cpu_clkg1_set
sysc_cpu_clkg1_set
0x0012ea98: 4901 .I LDR r1,[pc,#4] ; [0x12eaa0] = 0x20132000
0x0012ea9a: 6148 Ha STR r0,[r1,#0x14]
0x0012ea9c: 4770 pG BX lr
$d
0x0012ea9e: 0000 .. DCW 0
0x0012eaa0: 20132000 . . DCD 538124288
$t
i.sysc_cpu_qspi_en_setf
sysc_cpu_qspi_en_setf
0x0012eaa4: 4904 .I LDR r1,[pc,#16] ; [0x12eab8] = 0x20132000
0x0012eaa6: 6a09 .j LDR r1,[r1,#0x20]
0x0012eaa8: 0909 .. LSRS r1,r1,#4
0x0012eaaa: 0109 .. LSLS r1,r1,#4
0x0012eaac: 0702 .. LSLS r2,r0,#28
0x0012eaae: 0f12 .. LSRS r2,r2,#28
0x0012eab0: 4311 .C ORRS r1,r1,r2
0x0012eab2: 4a01 .J LDR r2,[pc,#4] ; [0x12eab8] = 0x20132000
0x0012eab4: 6211 .b STR r1,[r2,#0x20]
0x0012eab6: 4770 pG BX lr
$d
0x0012eab8: 20132000 . . DCD 538124288
====================================
** Section #2
Name : EXEC_SECTION
Type : SHT_PROGBITS (0x00000001)
Flags : SHF_ALLOC + SHF_WRITE (0x00000003)
Addr : 0x0012eabc
File Offset : 2816 (0xb00)
Size : 4 bytes (0x4)
Link : SHN_UNDEF
Info : 0
Alignment : 4
Entry Size : 0
0x12eabc: 00 d8 b8 05 ....
====================================
** Section #3
Name : .debug_abbrev
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 2820 (0xb04)
Size : 1444 bytes (0x5a4)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #4
Name : .debug_frame
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 4264 (0x10a8)
Size : 1256 bytes (0x4e8)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #5
Name : .debug_info
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 5520 (0x1590)
Size : 235852 bytes (0x3994c)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #6
Name : .debug_line
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 241372 (0x3aedc)
Size : 13076 bytes (0x3314)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #7
Name : .debug_loc
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 254448 (0x3e1f0)
Size : 3972 bytes (0xf84)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #8
Name : .debug_macinfo
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 258420 (0x3f174)
Size : 4040 bytes (0xfc8)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #9
Name : .debug_pubnames
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 262460 (0x4013c)
Size : 1033 bytes (0x409)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #10
Name : .symtab
Type : SHT_SYMTAB (0x00000002)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 263496 (0x40548)
Size : 3376 bytes (0xd30)
Link : Section 11 (.strtab)
Info : Last local symbol no = 181
Alignment : 4
Entry Size : 16
====================================
** Section #11
Name : .strtab
Type : SHT_STRTAB (0x00000003)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 266872 (0x41278)
Size : 3284 bytes (0xcd4)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
** Section #12
Name : .note
Type : SHT_NOTE (0x00000007)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 270156 (0x41f4c)
Size : 24 bytes (0x18)
Link : SHN_UNDEF
Info : 0
Alignment : 4
Entry Size : 0
Section Segment
====================================
1 0
2 0
====================================
** Section #13
Name : .comment
Type : SHT_PROGBITS (0x00000001)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 270180 (0x41f64)
Size : 54928 bytes (0xd690)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
armlink --verbose --library_type=microlib --callgraph --map --symbols --xref --cpu=Cortex-M0+ --datacompressor=off --list=../../../../output/boot_ram/boot_ram.map --output=../../../../output/boot_ram/boot_ram.elf --scatter=E:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/boot_ram_scatter.txt --entry=boot_ram_entry --info=any,architecture,exceptions,inline,inputs,libraries,merge,pltgot,sizes,stack,summarysizes,summarystack,tailreorder,totals,unused,unusedsymbols,veneers,veneercallers,veneerpools,visibility,weakrefs
C:\Keil_v5\ARM\ARMCC\bin\..\lib\armlib\h_p.l
C:\Keil_v5\ARM\ARMCC\bin\..\lib\armlib\m_ps.l
C:\Keil_v5\ARM\ARMCC\bin\..\lib\armlib\mc_p.l
C:\Keil_v5\ARM\ARMCC\bin\..\lib\armlib\mf_p.l
C:\Keil_v5\ARM\ARMCC\bin\..\lib\armlib\vfpsupport.l
Input Comments:
boot_ram.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
armlink --partial --no_add_relocs_to_undefined --no_generate_mapping_symbols --diag_suppress=6642 --cpu=Cortex-M0+ --fpu=SoftVFP --output=CMakeFiles/boot_ram.dir/boot_ram.o --vfemode=force
Input Comments:
p6780-3
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armasm [4d35a5]
armasm --debug --diag_suppress=1602,1073 --cpu=Cortex-M0+ --fpu=SoftVFP --apcs=/interwork --no_divide
boot_ram.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
armcc --c99 --bss_threshold=0 --split_sections --debug -c --cpu=Cortex-M0+ -O0 -Otime -IE:/KeilProject/SVN/Jmesh/trunk/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/.. -IE:/KeilProject/SVN/Jmesh/trunk/modules/ke/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/dbg/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/common/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rwip/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/nvds/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rf/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/ecc_p256/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/h4tl/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/app/api -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/boot/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/compiler/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/ll/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/intc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/led -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/uart -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/reg -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash_cache -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl/awo -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pshare -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/dmac -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/gpio -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pwm -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/wdt -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/timer -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/rtc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/adc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/clk_gen -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/iic -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/patch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/hw_ecc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/qspi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/modem -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/spi_master -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/sleep -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/RTT -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/jmp_table -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/patch_list -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/build/ble-full/reg/fw -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/cmsis_inc -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/include -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/portable/armcc/arm_cm0 -IE:/KeilProject/SVN/Jmesh/trunk/freertos/app -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/oled_iic -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/mems_spi -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/motor -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/temp -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/rgb_led -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/uart_echo -IE:/KeilProject/SVN/Jmesh/trunk/freertos -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llm -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/lld -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/em -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/rwble -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/inc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/basc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/bass/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/disc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/diss/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpbh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpd/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogprh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lanc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lans/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/paspc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/pasps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxm/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxr/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tipc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tips/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota/bxotas/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota -IE:/KeilProject/SVN/Jmesh/trunk/ip/hci/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ahi/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ea/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/em/api -DNDEBUG -D__BOOT_RAM__ -D__MICROLIB
awo_2400.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
armlink --partial --no_add_relocs_to_undefined --no_generate_mapping_symbols --diag_suppress=6642 --cpu=Cortex-M0+ --fpu=SoftVFP --output=CMakeFiles/boot_ram.dir/__/__/src/driver/sysctrl/awo/awo_2400.o --vfemode=force
Input Comments:
p2a08-3
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armasm [4d35a5]
armasm --debug --diag_suppress=1602,1073 --cpu=Cortex-M0+ --fpu=SoftVFP --apcs=/interwork --no_divide
awo_2400.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
armcc --c99 --bss_threshold=0 --split_sections --debug -c --cpu=Cortex-M0+ -O0 -Otime -IE:/KeilProject/SVN/Jmesh/trunk/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/.. -IE:/KeilProject/SVN/Jmesh/trunk/modules/ke/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/dbg/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/common/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rwip/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/nvds/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rf/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/ecc_p256/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/h4tl/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/app/api -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/boot/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/compiler/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/ll/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/intc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/led -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/uart -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/reg -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash_cache -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl/awo -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pshare -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/dmac -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/gpio -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pwm -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/wdt -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/timer -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/rtc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/adc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/clk_gen -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/iic -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/patch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/hw_ecc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/qspi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/modem -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/spi_master -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/sleep -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/RTT -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/jmp_table -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/patch_list -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/build/ble-full/reg/fw -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/cmsis_inc -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/include -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/portable/armcc/arm_cm0 -IE:/KeilProject/SVN/Jmesh/trunk/freertos/app -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/oled_iic -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/mems_spi -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/motor -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/temp -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/rgb_led -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/uart_echo -IE:/KeilProject/SVN/Jmesh/trunk/freertos -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llm -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/lld -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/em -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/rwble -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/inc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/basc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/bass/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/disc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/diss/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpbh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpd/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogprh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lanc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lans/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/paspc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/pasps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxm/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxr/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tipc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tips/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota/bxotas/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota -IE:/KeilProject/SVN/Jmesh/trunk/ip/hci/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ahi/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ea/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/em/api -DNDEBUG -D__BOOT_RAM__ -D__MICROLIB
awo_2401.o
flash.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
armcc --c99 --bss_threshold=0 --split_sections --debug -c --cpu=Cortex-M0+ -O0 -Otime -IE:/KeilProject/SVN/Jmesh/trunk/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/.. -IE:/KeilProject/SVN/Jmesh/trunk/modules/ke/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/dbg/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/common/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rwip/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/nvds/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rf/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/ecc_p256/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/h4tl/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/app/api -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/boot/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/compiler/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/ll/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/intc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/led -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/uart -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/reg -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash_cache -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl/awo -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pshare -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/dmac -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/gpio -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pwm -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/wdt -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/timer -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/rtc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/adc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/clk_gen -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/iic -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/patch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/hw_ecc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/qspi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/modem -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/spi_master -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/sleep -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/RTT -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/jmp_table -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/patch_list -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/build/ble-full/reg/fw -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/cmsis_inc -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/include -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/portable/armcc/arm_cm0 -IE:/KeilProject/SVN/Jmesh/trunk/freertos/app -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/oled_iic -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/mems_spi -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/motor -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/temp -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/rgb_led -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/uart_echo -IE:/KeilProject/SVN/Jmesh/trunk/freertos -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llm -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/lld -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/em -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/rwble -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/inc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/basc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/bass/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/disc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/diss/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpbh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpd/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogprh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lanc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lans/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/paspc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/pasps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxm/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxr/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tipc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tips/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota/bxotas/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota -IE:/KeilProject/SVN/Jmesh/trunk/ip/hci/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ahi/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ea/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/em/api -DNDEBUG -D__BOOT_RAM__ -D__MICROLIB
dma_for_qspi.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
armlink --partial --no_add_relocs_to_undefined --no_generate_mapping_symbols --diag_suppress=6642 --cpu=Cortex-M0+ --fpu=SoftVFP --output=CMakeFiles/boot_ram.dir/__/__/src/driver/dmac/dma_for_qspi.o --vfemode=force
Input Comments:
p2354-3
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armasm [4d35a5]
armasm --debug --diag_suppress=1602,1073 --cpu=Cortex-M0+ --fpu=SoftVFP --apcs=/interwork --no_divide
dma_for_qspi.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
armcc --c99 --bss_threshold=0 --split_sections --debug -c --cpu=Cortex-M0+ -O0 -Otime -IE:/KeilProject/SVN/Jmesh/trunk/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/.. -IE:/KeilProject/SVN/Jmesh/trunk/modules/ke/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/dbg/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/common/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rwip/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/nvds/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rf/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/ecc_p256/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/h4tl/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/app/api -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/boot/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/compiler/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/ll/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/intc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/led -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/uart -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/reg -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash_cache -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl/awo -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pshare -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/dmac -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/gpio -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pwm -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/wdt -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/timer -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/rtc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/adc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/clk_gen -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/iic -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/patch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/hw_ecc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/qspi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/modem -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/spi_master -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/sleep -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/RTT -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/jmp_table -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/patch_list -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/build/ble-full/reg/fw -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/cmsis_inc -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/include -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/portable/armcc/arm_cm0 -IE:/KeilProject/SVN/Jmesh/trunk/freertos/app -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/oled_iic -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/mems_spi -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/motor -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/temp -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/rgb_led -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/uart_echo -IE:/KeilProject/SVN/Jmesh/trunk/freertos -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llm -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/lld -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/em -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/rwble -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/inc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/basc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/bass/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/disc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/diss/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpbh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpd/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogprh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lanc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lans/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/paspc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/pasps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxm/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxr/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tipc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tips/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota/bxotas/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota -IE:/KeilProject/SVN/Jmesh/trunk/ip/hci/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ahi/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ea/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/em/api -DNDEBUG -D__BOOT_RAM__ -D__MICROLIB
qspi.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
armlink --partial --no_add_relocs_to_undefined --no_generate_mapping_symbols --diag_suppress=6642 --cpu=Cortex-M0+ --fpu=SoftVFP --output=CMakeFiles/boot_ram.dir/__/__/src/driver/ssi/qspi/qspi.o --vfemode=force
Input Comments:
p358c-3
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armasm [4d35a5]
armasm --debug --diag_suppress=1602,1073 --cpu=Cortex-M0+ --fpu=SoftVFP --apcs=/interwork --no_divide
qspi.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
armcc --c99 --bss_threshold=0 --split_sections --debug -c --cpu=Cortex-M0+ -O0 -Otime -IE:/KeilProject/SVN/Jmesh/trunk/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/.. -IE:/KeilProject/SVN/Jmesh/trunk/modules/ke/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/dbg/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/common/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rwip/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/nvds/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rf/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/ecc_p256/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/h4tl/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/app/api -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/boot/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/compiler/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/ll/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/intc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/led -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/uart -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/reg -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash_cache -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl/awo -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pshare -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/dmac -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/gpio -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pwm -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/wdt -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/timer -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/rtc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/adc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/clk_gen -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/iic -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/patch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/hw_ecc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/qspi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/modem -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/spi_master -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/sleep -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/RTT -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/jmp_table -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/patch_list -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/build/ble-full/reg/fw -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/cmsis_inc -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/include -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/portable/armcc/arm_cm0 -IE:/KeilProject/SVN/Jmesh/trunk/freertos/app -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/oled_iic -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/mems_spi -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/motor -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/temp -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/rgb_led -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/uart_echo -IE:/KeilProject/SVN/Jmesh/trunk/freertos -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llm -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/lld -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/em -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/rwble -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/inc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/basc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/bass/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/disc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/diss/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpbh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpd/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogprh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lanc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lans/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/paspc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/pasps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxm/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxr/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tipc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tips/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota/bxotas/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota -IE:/KeilProject/SVN/Jmesh/trunk/ip/hci/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ahi/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ea/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/em/api -DNDEBUG -D__BOOT_RAM__ -D__MICROLIB
flash_cache.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
armlink --partial --no_add_relocs_to_undefined --no_generate_mapping_symbols --diag_suppress=6642 --cpu=Cortex-M0+ --fpu=SoftVFP --output=CMakeFiles/boot_ram.dir/__/__/src/driver/flash_cache/flash_cache.o --vfemode=force
Input Comments:
p6644-3
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armasm [4d35a5]
armasm --debug --diag_suppress=1602,1073 --cpu=Cortex-M0+ --fpu=SoftVFP --apcs=/interwork --no_divide
flash_cache.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
armcc --c99 --bss_threshold=0 --split_sections --debug -c --cpu=Cortex-M0+ -O0 -Otime -IE:/KeilProject/SVN/Jmesh/trunk/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/.. -IE:/KeilProject/SVN/Jmesh/trunk/modules/ke/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/dbg/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/common/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rwip/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/nvds/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rf/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/ecc_p256/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/h4tl/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/app/api -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/boot/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/compiler/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/ll/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/intc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/led -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/uart -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/reg -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash_cache -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl/awo -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pshare -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/dmac -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/gpio -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pwm -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/wdt -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/timer -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/rtc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/adc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/clk_gen -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/iic -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/patch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/hw_ecc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/qspi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/modem -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/spi_master -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/sleep -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/RTT -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/jmp_table -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/patch_list -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/build/ble-full/reg/fw -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/cmsis_inc -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/include -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/portable/armcc/arm_cm0 -IE:/KeilProject/SVN/Jmesh/trunk/freertos/app -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/oled_iic -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/mems_spi -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/motor -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/temp -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/rgb_led -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/uart_echo -IE:/KeilProject/SVN/Jmesh/trunk/freertos -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llm -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/lld -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/em -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/rwble -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/inc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/basc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/bass/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/disc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/diss/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpbh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpd/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogprh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lanc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lans/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/paspc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/pasps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxm/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxr/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tipc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tips/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota/bxotas/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota -IE:/KeilProject/SVN/Jmesh/trunk/ip/hci/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ahi/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ea/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/em/api -DNDEBUG -D__BOOT_RAM__ -D__MICROLIB
clk_gate.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armlink [4d35a8]
armlink --partial --no_add_relocs_to_undefined --no_generate_mapping_symbols --diag_suppress=6642 --cpu=Cortex-M0+ --fpu=SoftVFP --output=CMakeFiles/boot_ram.dir/__/__/src/driver/sysctrl/clk_gate.o --vfemode=force
Input Comments:
p4628-3
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armasm [4d35a5]
armasm --debug --diag_suppress=1602,1073 --cpu=Cortex-M0+ --fpu=SoftVFP --apcs=/interwork --no_divide
clk_gate.o
Component: ARM Compiler 5.06 update 1 (build 61) Tool: armcc [4d35ad]
armcc --c99 --bss_threshold=0 --split_sections --debug -c --cpu=Cortex-M0+ -O0 -Otime -IE:/KeilProject/SVN/Jmesh/trunk/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/bootloader/boot_ram/.. -IE:/KeilProject/SVN/Jmesh/trunk/modules/ke/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/dbg/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/common/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rwip/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/nvds/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/rf/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/ecc_p256/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/h4tl/api -IE:/KeilProject/SVN/Jmesh/trunk/modules/app/api -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/boot/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/compiler/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/arch/ll/armcc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/intc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/led -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/uart -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/reg -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash_cache -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/flash -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/sysctrl/awo -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pshare -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/dmac -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/gpio -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/pwm -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/wdt -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/timer -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/rtc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/adc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/clk_gen -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/iic -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/patch -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/hw_ecc -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/qspi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/modem -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/driver/ssi/spi_master -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/sleep -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/. -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/bx_debug/log/RTT -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/jmp_table -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/patch_list -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/build/ble-full/reg/fw -IE:/KeilProject/SVN/Jmesh/trunk/plf/bx2400/src/cmsis_inc -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/include -IE:/KeilProject/SVN/Jmesh/trunk/freertos/src/portable/armcc/arm_cm0 -IE:/KeilProject/SVN/Jmesh/trunk/freertos/app -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/oled_iic -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/mems_spi -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/motor -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/temp -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/rgb_led -IE:/KeilProject/SVN/Jmesh/trunk/freertos/peripheral/uart_echo -IE:/KeilProject/SVN/Jmesh/trunk/freertos -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llm -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/llc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/lld -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/em -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/ll/src/rwble -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/hl/inc -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp/anps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/anp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/basc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas/bass/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bas -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp/blps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/blp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp/cpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp/cscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/cscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/disc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis/diss/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/dis -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findl/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find/findt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/find -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp/glps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/glp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpbh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogpd/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp/hogprh/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hogp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp/hrps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/hrp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp/htpt/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/htp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lanc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan/lans/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/lan -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/paspc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp/pasps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/pasp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxm/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox/proxr/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/prox -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscpc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp/rscps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/rscp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scppc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp/scpps/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/scpp -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tipc/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip/tips/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/tip -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota/bxotas/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ble/profiles/bxota -IE:/KeilProject/SVN/Jmesh/trunk/ip/hci/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ahi/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/ea/api -IE:/KeilProject/SVN/Jmesh/trunk/ip/em/api -DNDEBUG -D__BOOT_RAM__ -D__MICROLIB
====================================
** Section #14
Name : .shstrtab
Type : SHT_STRTAB (0x00000003)
Flags : None (0x00000000)
Addr : 0x00000000
File Offset : 325108 (0x4f5f4)
Size : 148 bytes (0x94)
Link : SHN_UNDEF
Info : 0
Alignment : 1
Entry Size : 0
====================================
address size variable name type
0x0012eabc 0x4 wakeup_pll uint32_t
address size variable name type
0x0012dff0 0x24 boot_info const boot_info_t
0x0012dff0 0x10 boot_info.boot_header boot_header_t
0x0012dff0 0x4 boot_info.boot_header.bx_flag uint32_t
0x0012dff4 0x4 boot_info.boot_header.base_addr pointer to uint8_t
0x0012dff8 0x4 boot_info.boot_header.length uint32_t
0x0012dffc 0x4 boot_info.boot_header.entry_point entry_point_t
0x0012e000 0x4 boot_info.image_offset uint32_t
0x0012e004 0x4 boot_info.image_size uint32_t
0x0012e008 0x4 boot_info.flash_qspi_enabled uint32_t
0x0012e00c 0x4 boot_info.flash_xip uint32_t
0x0012e010 0x4 boot_info.valid_part uint32_t
|
examples/normalize.adb | ytomino/drake | 33 | 29490 | <reponame>ytomino/drake<filename>examples/normalize.adb
with Ada.Characters.Latin_1;
with Ada.Strings.Composites;
with Ada.Strings.Fixed;
with Ada.Strings.Maps.Constants;
with Ada.Strings.Normalization;
procedure normalize is
use type Ada.Strings.Composites.Class;
subtype C is Character;
subtype WWC is Wide_Wide_Character;
subtype WWS is Wide_Wide_String;
begin
-- combining class
pragma Assert (Ada.Strings.Composites.Combining_Class (WWC'First) = 0);
pragma Assert (Ada.Strings.Composites.Combining_Class (WWC'Val (16#0308#)) = 230);
pragma Assert (Ada.Strings.Composites.Combining_Class (WWC'Val (16#0323#)) = 220);
pragma Assert (Ada.Strings.Composites.Combining_Class (WWC'Val (16#3099#)) = 8);
pragma Assert (Ada.Strings.Composites.Combining_Class (WWC'Val (16#e0100#)) = 0); -- VARIATION SELECTOR
pragma Assert (Ada.Strings.Composites.Combining_Class (WWC'Last) = 0);
declare
S : constant Wide_Wide_String :=
"a" & WWC'Val (16#0323#) & WWC'Val (16#0308#)
& WWC'Val (16#304b#) & WWC'Val (16#3099#) -- ka & dakuten
& "e" & WWC'Val (16#0323#) & WWC'Val (16#0304#) & WWC'Val (16#0301#);
Last : Natural;
Is_Illegal_Sequence : Boolean;
begin
Ada.Strings.Composites.Get_Combined (S, Last, Is_Illegal_Sequence);
pragma Assert (Last = 3);
pragma Assert (not Is_Illegal_Sequence);
Ada.Strings.Composites.Get_Combined (S (Last + 1 .. S'Last), Last, Is_Illegal_Sequence);
pragma Assert (Last = 5);
pragma Assert (not Is_Illegal_Sequence);
Ada.Strings.Composites.Get_Combined (S (Last + 1 .. S'Last), Last, Is_Illegal_Sequence);
pragma Assert (Last = 9);
pragma Assert (not Is_Illegal_Sequence);
end;
-- decomposing and composing
pragma Assert (Ada.Strings.Normalization.Decompose (WWS'("")) = "");
pragma Assert (Ada.Strings.Normalization.Decompose (WWS'("A")) = "A");
pragma Assert (Ada.Strings.Normalization.Decompose ((1 => WWC'Val (16#304c#))) = WWC'Val (16#304b#) & WWC'Val (16#3099#));
pragma Assert (Ada.Strings.Normalization.Decompose ((1 => WWC'Val (16#0390#))) = WWC'Val (16#03B9#) & WWC'Val (16#0308#) & WWC'Val (16#0301#));
pragma Assert (Ada.Strings.Normalization.Decompose ((1 => WWC'Val (16#0958#))) = WWC'Val (16#0915#) & WWC'Val (16#093C#));
pragma Assert (Ada.Strings.Normalization.Decompose ((1 => WWC'Val (16#AC00#))) = WWC'Val (16#1100#) & WWC'Val (16#1161#)); -- Hangul LV
pragma Assert (Ada.Strings.Normalization.Decompose ((1 => WWC'Val (16#AC01#))) = WWC'Val (16#1100#) & WWC'Val (16#1161#) & WWC'Val (16#11A8#)); -- Hangul LVT
pragma Assert (Ada.Strings.Normalization.Compose (WWS'("")) = "");
pragma Assert (Ada.Strings.Normalization.Compose (WWS'("A")) = "A");
pragma Assert (Ada.Strings.Normalization.Compose (WWC'Val (16#304b#) & WWC'Val (16#3099#)) = (1 => WWC'Val (16#304c#)));
pragma Assert (Ada.Strings.Normalization.Compose (WWC'Val (16#03B9#) & WWC'Val (16#0308#) & WWC'Val (16#0301#)) = (1 => WWC'Val (16#0390#)));
pragma Assert (Ada.Strings.Normalization.Compose (WWC'Val (16#0915#) & WWC'Val (16#093C#)) = WWC'Val (16#0915#) & WWC'Val (16#093C#)); -- composition exclusion
pragma Assert (Ada.Strings.Normalization.Compose (WWC'Val (16#1100#) & WWC'Val (16#1161#)) = (1 => WWC'Val (16#AC00#))); -- Hangul LV
pragma Assert (Ada.Strings.Normalization.Compose (WWC'Val (16#1100#) & WWC'Val (16#1161#) & WWC'Val (16#11A8#)) = (1 => WWC'Val (16#AC01#))); -- Hangul LVT
pragma Assert (Ada.Strings.Normalization.Decompose (C'Val (16#e3#) & C'Val (16#81#) & C'Val (16#8c#)) = (C'Val (16#e3#) & C'Val (16#81#) & C'Val (16#8b#) & C'Val (16#e3#) & C'Val (16#82#) & C'Val (16#99#))); -- UTF-8
-- equal
pragma Assert (Ada.Strings.Normalization.Equal (WWS'(""), ""));
pragma Assert (not Ada.Strings.Normalization.Equal (WWS'(""), "A"));
pragma Assert (not Ada.Strings.Normalization.Equal (WWS'("A"), ""));
pragma Assert (Ada.Strings.Normalization.Equal (WWS'("A"), "A"));
pragma Assert (not Ada.Strings.Normalization.Equal (WWS'("A"), "AA"));
pragma Assert (not Ada.Strings.Normalization.Equal (WWS'("AA"), "A"));
pragma Assert (not Ada.Strings.Normalization.Equal (WWS'("AA"), "AB"));
pragma Assert (not Ada.Strings.Normalization.Equal (WWS'("AB"), "AA"));
pragma Assert (not Ada.Strings.Normalization.Equal ((1 => WWC'Val (16#00C0#)), 'A' & WWC'Val (16#0301#)));
pragma Assert (Ada.Strings.Normalization.Equal ((1 => WWC'Val (16#00C1#)), 'A' & WWC'Val (16#0301#)));
pragma Assert (Ada.Strings.Normalization.Equal ((1 => WWC'Val (16#304c#)), WWC'Val (16#304b#) & WWC'Val (16#3099#)));
pragma Assert (Ada.Strings.Normalization.Equal (WWC'Val (16#304b#) & WWC'Val (16#3099#), (1 => WWC'Val (16#304c#))));
-- less
pragma Assert (not Ada.Strings.Normalization.Less (WWS'(""), ""));
pragma Assert (Ada.Strings.Normalization.Less (WWS'(""), "A"));
pragma Assert (not Ada.Strings.Normalization.Less (WWS'("A"), ""));
pragma Assert (not Ada.Strings.Normalization.Less (WWS'("A"), "A"));
pragma Assert (Ada.Strings.Normalization.Less (WWS'("A"), "AA"));
pragma Assert (not Ada.Strings.Normalization.Less (WWS'("AA"), "A"));
pragma Assert (Ada.Strings.Normalization.Less (WWS'("AA"), "AB"));
pragma Assert (not Ada.Strings.Normalization.Less (WWS'("AB"), "AA"));
pragma Assert (Ada.Strings.Normalization.Less ((1 => WWC'Val (16#00C0#)), 'A' & WWC'Val (16#0301#)));
pragma Assert (not Ada.Strings.Normalization.Less ((1 => WWC'Val (16#00C1#)), 'A' & WWC'Val (16#0301#)));
pragma Assert (not Ada.Strings.Normalization.Less ((1 => WWC'Val (16#304c#)), WWC'Val (16#304b#) & WWC'Val (16#3099#)));
pragma Assert (not Ada.Strings.Normalization.Less (WWC'Val (16#304b#) & WWC'Val (16#3099#), (1 => WWC'Val (16#304c#))));
-- To_Base
declare
package Latin_1 renames Ada.Characters.Latin_1;
package F renames Ada.Strings.Fixed;
package M renames Ada.Strings.Maps;
begin
pragma Assert (M.Value (M.Constants.Basic_Map, '6') = '6'); -- 16#36#
pragma Assert (M.Value (M.Constants.Basic_Map, 'Y') = 'Y'); -- 16#59#
pragma Assert (M.Value (M.Constants.Basic_Map, Latin_1.LC_R) = 'r'); -- 16#72#
pragma Assert (F.Translate (Latin_1.UC_O_Acute, M.Constants.Basic_Map) = "O"); -- 16#D4#
pragma Assert (F.Translate (Latin_1.UC_O_Tilde, M.Constants.Basic_Map) = "O"); -- 16#D6#
pragma Assert (F.Translate (Latin_1.UC_U_Grave, M.Constants.Basic_Map) = "U"); -- 16#D9#
pragma Assert (F.Translate (Latin_1.UC_U_Acute, M.Constants.Basic_Map) = "U"); -- 16#DA#
pragma Assert (F.Translate (Latin_1.LC_A_Circumflex, M.Constants.Basic_Map) = "a"); -- 16#E2#
pragma Assert (F.Translate (Latin_1.LC_A_Tilde, M.Constants.Basic_Map) = "a"); -- 16#E3#
pragma Assert (F.Translate (Latin_1.LC_E_Grave, M.Constants.Basic_Map) = "e"); -- 16#E8#
pragma Assert (F.Translate (Latin_1.LC_E_Acute, M.Constants.Basic_Map) = "e"); -- 16#E9#
pragma Assert (F.Translate (Latin_1.LC_I_Circumflex, M.Constants.Basic_Map) = "i"); -- 16#EE#
pragma Assert (F.Translate (Latin_1.LC_I_Diaeresis, M.Constants.Basic_Map) = "i"); -- 16#EF#
pragma Assert (F.Translate (Latin_1.LC_Y_Acute, M.Constants.Basic_Map) = "y"); -- 16#FD#
pragma Assert (F.Translate (Latin_1.LC_Y_Diaeresis, M.Constants.Basic_Map) = "y"); -- 16#FF#
end;
pragma Debug (Ada.Debug.Put ("OK"));
end normalize;
|
gtkada_backend/example/engine_control_ui.adb | Fabien-Chouteau/Giza | 7 | 30767 | <filename>gtkada_backend/example/engine_control_ui.adb<gh_stars>1-10
with Giza.Colors; use Giza.Colors;
with Giza.GUI; use Giza.GUI;
with Engine_Control_Events; use Engine_Control_Events;
package body Engine_Control_UI is
Set_PP_Evt : aliased Set_PP_Event;
-------------
-- On_Init --
-------------
procedure On_Init (This : in out Engine_Control_Window) is
begin
This.RPM_Widget := new RPM;
This.RPM_Widget.Set_Background (White);
This.RPM_Widget.Set_Foreground (Black);
This.RPM_Widget.Disable_Frame;
This.RPM_Widget.Set_Size ((This.Get_Size.W - 2, 38));
This.Add_Child (This.RPM_Widget, (1, 1));
This.PP := new PP_Widget;
This.PP.Set_Background (White);
This.PP.Set_Foreground (Red);
This.PP.Disable_Frame;
This.PP.Set_Size ((This.Get_Size.W - 2, 160));
This.Add_Child (This.PP, (1, 41));
This.Tabs := new Gtabs (2);
This.Tabs.Set_Size ((This.Get_Size.W, 116));
This.Manual := new Composite_Widget;
This.Auto := new Composite_Widget;
This.Tabs.Set_Tab (1, "MANUAL", This.Manual);
This.Tabs.Set_Tab (2, "AUTO", This.Auto);
This.Add_Child (This.Tabs, (0, 202));
This.Ignition := new Gnumber_Select;
This.Ignition.Set_Size ((This.Get_Size.W, 42));
This.Ignition.Set_Label ("Ignition");
This.Ignition.Set_Min (0);
This.Ignition.Set_Max (100);
This.Ignition.Set_Step (5);
This.Ignition.Set_Value (25);
This.Duration := new Gnumber_Select;
This.Duration.Set_Size ((This.Get_Size.W, 42));
This.Duration.Set_Label ("Duration");
This.Duration.Set_Min (0);
This.Duration.Set_Max (100);
This.Duration.Set_Step (5);
This.Duration.Set_Value (50);
This.Manual.Add_Child (This.Ignition, (0, 0));
This.Manual.Add_Child (This.Duration, (0, 43));
This.Tabs.Set_Selected (1);
This.Target_RPM := new Gnumber_Select;
This.Target_RPM.Set_Label ("Target RPM");
This.Target_RPM.Set_Size ((This.Get_Size.W, 85));
This.Target_RPM.Set_Min (200);
This.Target_RPM.Set_Max (2500);
This.Target_RPM.Set_Step (100);
This.Target_RPM.Set_Value (1500);
This.Target_RPM.Show_Value;
This.Auto.Add_Child (This.Target_RPM, (0, 0));
This.Background := new Gbackground;
This.Background.Set_Background (Black);
This.Background.Set_Size (This.Get_Size);
This.Add_Child (This.Background, (0, 0));
end On_Init;
------------------
-- On_Displayed --
------------------
procedure On_Displayed (This : in out Engine_Control_Window) is
begin
null;
end On_Displayed;
---------------
-- On_Hidden --
---------------
procedure On_Hidden (This : in out Engine_Control_Window) is
begin
null;
end On_Hidden;
-----------------------
-- On_Position_Event --
-----------------------
function On_Position_Event
(This : in out Engine_Control_Window;
Evt : Position_Event_Ref;
Pos : Point_T) return Boolean
is
begin
if Giza.Widgets.Composite.On_Position_Event
(Giza.Widgets.Composite.Composite_Widget (This), Evt, Pos)
then
Set_PP_Evt := (Ignition => This.Ignition.Value,
Duration => This.Duration.Value);
Giza.GUI.Emit (Set_PP_Evt'Access);
return True;
else
return False;
end if;
end On_Position_Event;
end Engine_Control_UI;
|
gnoga_file_selection.adb | jrcarter/Gnoga_File_Selection | 0 | 27948 | <gh_stars>0
with Ada.Containers.Indefinite_Ordered_Sets;
with Ada.Directories;
with Gnoga.Gui.Base;
with Gnoga.Gui.Modal_Dialog;
with Gnoga.Gui.Element.Common;
with Gnoga.Gui.Element.Form;
with Gnoga.Gui.View;
package body Gnoga_File_Selection is
function Select_File (Window : in out Gnoga.Gui.Window.Window_Type'Class; Initial_Directory : in String := ".")
return Result_Info is
Directory_Tag : constant String := " (directory)";
package Name_Lists is new Ada.Containers.Indefinite_Ordered_Sets (Element_Type => String);
use Ada.Strings.Unbounded;
protected Control is
entry Wait_Until_Changed;
procedure Signal_Changed;
private -- Control
Changed : Boolean := False;
end Control;
procedure Up_Clicked (Object : in out Gnoga.Gui.Base.Base_Type'Class);
-- Change current directory to parent of current directory
procedure File_Selected (Object : in out Gnoga.Gui.Base.Base_Type'Class);
-- User clicked on a file in the file list
procedure Cancel_Clicked (Object : in out Gnoga.Gui.Base.Base_Type'Class);
-- User clicked on Cancel; return nothing picked
procedure OK_Clicked (Object : in out Gnoga.Gui.Base.Base_Type'Class);
-- User clicked on OK; return selected or entered file name
procedure Fill_List (Directory : in String; List : in out Gnoga.Gui.Element.Form.Selection_Type);
-- Clears List, then adds the files in Directory to it, directories first, in alphabetical order
Result_Ready : Boolean := False with Atomic;
Result : Result_Info;
Current_Dir : Unbounded_String := To_Unbounded_String (Ada.Directories.Full_Name (Initial_Directory) );
File_List : Gnoga.Gui.Element.Form.Selection_Type;
File_Input : Gnoga.Gui.Element.Form.Text_Type;
protected body Control is
entry Wait_Until_Changed when Changed is
-- Empty
begin -- Wait_Until_Changed
Changed := False;
end Wait_Until_Changed;
procedure Signal_Changed is
-- Empty
begin -- Signal_Changed
Changed := True;
end Signal_Changed;
end Control;
procedure Up_Clicked (Object : in out Gnoga.Gui.Base.Base_Type'Class) is
-- Empty
begin -- Up_Clicked
Current_Dir := To_Unbounded_String (Ada.Directories.Containing_Directory (To_String (Current_Dir) ) );
Control.Signal_Changed;
exception -- Up_Clicked
when Ada.Directories.Use_Error =>
Gnoga.Log (Message => "Up_Clicked: Use_Error for " & To_String (Current_Dir) );
when others =>
Gnoga.Log (Message => "Up_Clicked: other exception");
end Up_Clicked;
procedure File_Selected (Object : in out Gnoga.Gui.Base.Base_Type'Class) is
Index : constant Natural := File_List.Selected_Index;
begin -- File_Selected
if Index = 0 then
return;
end if;
Get_Name : declare
Name : constant String := File_List.Value (Index);
begin -- Get_Name
if Name'Length <= Directory_Tag'Length or else Name (Name'Last - Directory_Tag'Length + 1 .. Name'Last) /= Directory_Tag
then -- Normal file
File_Input.Value (Value => Name);
else -- Directory
Current_Dir := To_Unbounded_String (Ada.Directories.Compose (To_String (Current_Dir),
Name (Name'First .. Name'Last - Directory_Tag'Length) ) );
File_Input.Value (Value => "");
Control.Signal_Changed;
end if;
end Get_Name;
end File_Selected;
procedure Cancel_Clicked (Object : in out Gnoga.Gui.Base.Base_Type'Class) is
-- Empty
begin -- Cancel_Clicked
Result_Ready := True;
Control.Signal_Changed;
end Cancel_Clicked;
procedure OK_Clicked (Object : in out Gnoga.Gui.Base.Base_Type'Class) is
Name : constant String := File_Input.Value;
begin -- OK_Clicked
if Name /= "" then
Result := (Picked => True, Value => To_Unbounded_String (Ada.Directories.Compose (To_String (Current_Dir), Name) ) );
Result_Ready := True;
Control.Signal_Changed;
end if;
-- else ignore
end OK_Clicked;
procedure Fill_List (Directory : in String; List : in out Gnoga.Gui.Element.Form.Selection_Type) is
procedure Clear (List : in out Gnoga.Gui.Element.Form.Selection_Type);
-- Removes all options from List
procedure Add_Dir (Position : in Name_Lists.Cursor);
-- Adds the Name at Position to List with Directory_Tag added to the end
procedure Add_File (Position : in Name_Lists.Cursor);
-- Adds the name at Position to List
procedure Clear (List : in out Gnoga.Gui.Element.Form.Selection_Type) is
-- Empty
begin -- Clear
All_Options : for I in reverse 1 .. List.Length loop
List.Remove_Option (Index => I);
end loop All_Options;
end Clear;
procedure Add_Dir (Position : in Name_Lists.Cursor) is
Name : constant String := Name_Lists.Element (Position) & Directory_Tag;
begin -- Add_Dir
List.Add_Option (Value => Name, Text => Name);
end Add_Dir;
procedure Add_File (Position : in Name_Lists.Cursor) is
Name : constant String := Name_Lists.Element (Position);
begin -- Add_File
List.Add_Option (Value => Name, Text => Name);
end Add_File;
Search_Info : Ada.Directories.Search_Type;
File_Info : Ada.Directories.Directory_Entry_Type;
Dir_List : Name_Lists.Set;
File_List : Name_Lists.Set;
begin -- Fill_List
Clear (List => List);
Ada.Directories.Start_Search (Search => Search_Info,
Directory => Directory,
Pattern => "*",
Filter => (Ada.Directories.Special_File => False, others => True) );
All_Entries : loop
exit All_Entries when not Ada.Directories.More_Entries (Search_Info);
Ada.Directories.Get_Next_Entry (Search => Search_Info, Directory_Entry => File_Info);
case Ada.Directories.Kind (File_Info) is
when Ada.Directories.Directory =>
Get_Name : declare
Name : constant String := Ada.Directories.Simple_Name (File_Info);
begin -- Get_Name
if Name /= "." and Name /= ".." then
Dir_List.Insert (New_Item => Name);
end if;
end Get_Name;
when Ada.Directories.Ordinary_File =>
File_List.Insert (New_Item => Ada.Directories.Simple_Name (File_Info) );
when Ada.Directories.Special_File =>
null;
end case;
end loop All_Entries;
Dir_List.Iterate (Process => Add_Dir'Access);
File_List.Iterate (Process => Add_File'Access);
end Fill_List;
Dialog : Gnoga.Gui.Modal_Dialog.Dialog_Type;
View : Gnoga.Gui.View.View_Type;
Form : Gnoga.Gui.Element.Form.Form_Type;
Dir_Line : Gnoga.Gui.Element.Form.Text_Type;
Up : Gnoga.Gui.Element.Common.Button_Type;
Cancel : Gnoga.Gui.Element.Common.Button_Type;
OK : Gnoga.Gui.Element.Common.Button_Type;
begin -- Select_File
Dialog.Create (Parent => Window);
Dialog.Create_Main_View (View => View);
Form.Create (Parent => View);
Dir_Line.Create (Form => Form, Size => 100);
Dir_Line.Read_Only;
Up.Create (Parent => Form, Content => "Up");
Up.On_Click_Handler (Handler => Up_Clicked'Unrestricted_Access);
Form.New_Line;
File_List.Create (Form => Form, Visible_Lines => 20);
File_List.On_Click_Handler (Handler => File_Selected'Unrestricted_Access);
Form.New_Line;
File_Input.Create (Form => Form, Size => 50);
Cancel.Create (Parent => Form, Content => "Cancel");
Cancel.On_Click_Handler (Handler => Cancel_Clicked'Unrestricted_Access);
OK.Create (Parent => Form, Content => "OK");
OK.On_Click_Handler (Handler => OK_Clicked'Unrestricted_Access);
Dialog.Show;
All_Dirs : loop
Dir_Line.Value (Value => To_String (Current_Dir) );
File_Input.Value (Value => "");
Fill_List (Directory => To_String (Current_Dir), List => File_List);
Control.Wait_Until_Changed;
if Result_Ready then
Dialog.Remove;
return Result;
end if;
end loop All_Dirs;
end Select_File;
end Gnoga_File_Selection;
|
source/directories/a-defina.adb | ytomino/drake | 33 | 7899 | <filename>source/directories/a-defina.adb
with System.Native_Directories.File_Names;
function Ada.Directories.Equal_File_Names (
FS : Volumes.File_System;
Left, Right : String)
return Boolean is
begin
return System.Native_Directories.File_Names.Equal_File_Names (
FS,
Left,
Right);
end Ada.Directories.Equal_File_Names;
|
programs/oeis/022/A022386.asm | karttu/loda | 0 | 102611 | ; A022386: Fibonacci sequence beginning 4, 26.
; 4,26,30,56,86,142,228,370,598,968,1566,2534,4100,6634,10734,17368,28102,45470,73572,119042,192614,311656,504270,815926,1320196,2136122,3456318,5592440,9048758,14641198,23689956,38331154,62021110,100352264,162373374,262725638,425099012,687824650,1112923662,1800748312,2913671974,4714420286,7628092260,12342512546,19970604806,32313117352,52283722158,84596839510,136880561668,221477401178,358357962846,579835364024,938193326870,1518028690894,2456222017764,3974250708658,6430472726422,10404723435080,16835196161502,27239919596582,44075115758084,71315035354666,115390151112750,186705186467416,302095337580166,488800524047582,790895861627748,1279696385675330,2070592247303078,3350288632978408,5420880880281486,8771169513259894
mov $1,2
mov $3,1
lpb $0,1
sub $0,1
add $1,$3
mov $2,$3
add $2,4
mov $3,$1
mov $1,$2
add $1,8
lpe
add $1,1
mul $1,2
sub $1,2
|
tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/private_enum.ads | ouankou/rose | 488 | 4351 | <gh_stars>100-1000
package Private_Enum is
type Pet is private;
private
type Pet is (cat, dog);
end Private_Enum;
|
libsrc/_DEVELOPMENT/math/float/math32/lm32/c/sdcc/mul2_fastcall.asm | Frodevan/z88dk | 640 | 168202 | <gh_stars>100-1000
SECTION code_fp_math32
PUBLIC _mul2_fastcall
EXTERN m32_fsmul2_fastcall
defc _mul2_fastcall = m32_fsmul2_fastcall
|
test/Fail/Issue3855OccursErasedDefinition.agda | cruhland/agda | 1,989 | 10396 | -- Andreas, 2019-10-01, continuing issue #3855 (erasure modality @0)
-- Test case by Nisse at https://github.com/agda/agda/issues/3855#issuecomment-527164352
-- Occurs check needs to take erasure status of definitions
-- (here: postulates) into account.
postulate
P : Set → Set
p : (A : Set) → P A
@0 A : Set
-- fails : P A
-- fails = p A
test : P A
test = p _
-- Should fail with error like:
--
-- Cannot instantiate the metavariable _2 to solution A
-- since (part of) the solution was created in an erased context
-- when checking that the expression p _ has type P A
|
programs/oeis/176/A176222.asm | karttu/loda | 1 | 19149 | <reponame>karttu/loda<filename>programs/oeis/176/A176222.asm
; A176222: a(n) = (n^2-3*n+1+(-1)^n)/2.
; 0,3,5,10,14,21,27,36,44,55,65,78,90,105,119,136,152,171,189,210,230,253,275,300,324,351,377,406,434,465,495,528,560,595,629,666,702,741,779,820,860,903,945,990,1034,1081,1127,1176,1224,1275,1325,1378,1430
mov $1,$0
mod $0,2
add $1,2
bin $1,2
add $1,$0
sub $1,1
|
4 专业科目/计算机组成/习题/hw/自己动手写CPU/Code/Chapter5_2/AsmTest/LogicInstTest/inst_rom.asm | ladike/912_project | 640 | 12065 |
inst_rom.om: file format elf32-tradbigmips
Disassembly of section .text:
00000000 <_start>:
0: 3c010101 lui at,0x101
4: 34210101 ori at,at,0x101
8: 34221100 ori v0,at,0x1100
c: 00220825 or at,at,v0
10: 302300fe andi v1,at,0xfe
14: 00610824 and at,v1,at
18: 3824ff00 xori a0,at,0xff00
1c: 00810826 xor at,a0,at
20: 00810827 nor at,a0,at
Disassembly of section .reginfo:
00000000 <_ram_end-0x30>:
0: 0000001e 0x1e
...
|
src/main/antlr4/AlogicLexer.g4 | peterderivaz/alogic-1 | 0 | 3081 | ////////////////////////////////////////////////////////////////////////////////
// Argon Design Ltd. Project P8009 Alogic
// Copyright (c) 2017-2018 Argon Design Ltd. All rights reserved.
//
// This file is covered by the BSD (with attribution) license.
// See the LICENSE file for the precise wording of the license.
//
// Module: Alogic Compiler
// Author: <NAME>/<NAME>
//
// DESCRIPTION:
//
// Antlr4 lexer grammar for Alogic
////////////////////////////////////////////////////////////////////////////////
lexer grammar AlogicLexer;
fragment LCMT: '//' ~[\n]* ; // Line comment
fragment BCMT: '/*' .*? '*/'; // Block comment
CMT: (LCMT | BCMT) -> channel(HIDDEN) ; // Any comment
UINTTYPE: 'u' [0-9]+;
INTTYPE: 'i' [0-9]+;
// Literals
STRING: '"' ~["]* '"';
fragment DECIMALDIGIT: [0-9] ;
fragment DECIMALVALUE: DECIMALDIGIT ('_'? DECIMALDIGIT)* ;
fragment HEXDIGIT: [0-9a-fA-F] ;
fragment HEXVALUE: HEXDIGIT ('_'? HEXDIGIT )* ;
UNSIZEDINT
: DECIMALVALUE [us]?
| '0' [bodx] HEXVALUE [us]?
;
SIZEDINT: DECIMALDIGIT+ '\'' 's'? [bdh] HEXVALUE ;
fragment SIMPLEID: [a-zA-Z_][a-zA-Z0-9_$]* ;
ATID : '@' SIMPLEID ;
DOLLARID: '$' SIMPLEID ;
GOESTO: '->';
MUL: '*' ;
DIV: '/' ;
MOD: '%' ;
PLUS: '+' ;
MINUS: '-' ;
NOT: '~' ;
AND: '&' ;
OR: '|' ;
XOR: '^' ;
LSHIFT: '<<' ;
URSHIFT: '>>' ;
SRSHIFT: '>>>' ;
SLSHIFT: '<<<' ;
PLING: '!' ;
ANDAND: '&&' ;
OROR: '||' ;
EQ: '==' ;
NE: '!=' ;
GT: '>' ;
GE: '>=' ;
LE: '<=' ;
LT: '<' ;
TICK: '\'' ;
QUESTIONMARK: '?';
COMMA: ',' ;
SEMICOLON: ';' ;
PLUSPLUS: '++' ;
MINUSMINUS: '--' ;
EQUALS: '=' ;
ASSIGNOP
: '*='
| '/='
| '%='
| '+='
| '-='
| '<<='
| '>>='
| '>>>='
| '<<<='
| '&='
| '|='
| '^='
;
DOT: '.';
LEFTCURLY: '{' ;
RIGHTCURLY: '}' ;
LEFTSQUARE: '[' ;
RIGHTSQUARE: ']' ;
LEFTBRACKET: '(' ;
RIGHTBRACKET: ')' ;
LEFTATTR: '(*' ;
RIGHTATTR: '*)' ;
COLON: ':';
MINUSCOLON: '-:';
PLUSCOLON: '+:';
HASH: '#' ;
// Keywords
FSM : 'fsm';
NETWORK : 'network';
PIPELINE: 'pipeline';
TYPEDEF : 'typedef';
STRUCT : 'struct';
IN : 'in';
OUT : 'out';
CONST : 'const' ;
PARAM : 'param' ;
FENCE : 'fence' ;
TRUE : 'true' ;
FALSE : 'false' ;
VOID : 'void' ;
BOOL : 'bool';
UINT : 'uint' ;
INT : 'int' ;
LOOP : 'loop' ;
WHILE : 'while' ;
DO : 'do' ;
FOR : 'for' ;
IF : 'if' ;
GOTO : 'goto' ;
ELSE : 'else' ;
BREAK : 'break' ;
CONTINUE: 'continue' ;
RETURN : 'return' ;
CASE : 'case' ;
DEFAULT : 'default' ;
NEW : 'new' ;
LET : 'let' ;
ENTITY : 'entity' ;
STATIC : 'static' ;
WAIT : 'wait' ;
COMB : 'comb' ;
STACK : 'stack' ;
SRAM : 'sram' ;
REG : 'reg' ;
SIGNED : 'signed' ;
UNSIGNED: 'unsigned' ;
GEN : 'gen' ;
TYPE : 'type' ;
ASSERT : 'assert' ;
ASSUME : 'assume' ;
IMPORT : 'import' ;
USING : 'using' ;
FROM : 'from' ;
THIS : 'this' ;
AS : 'as' ;
COMPILE : 'compile' ;
SYNC : 'sync';
SYNC_READY : 'sync' (WS|NL|CMT)* 'ready';
WIRE : 'wire';
BUBBLE : 'bubble';
FSLICE : 'fslice';
BSLICE : 'bslice';
VERBATIM: 'verbatim' -> pushMode(VERBATIMENTRY_MODE);
IDENTIFIER: SIMPLEID;
WS: [ \t\r]+ -> channel(HIDDEN);
// This is not hidden here as knowing where newlines are is requried to
// implement the preprocessor directives below. All NL tokens will eventually
// be hidden by AlogicTokenFactory so the parser will not see one ever.
NL: '\n';
// Preprocessor directives. These are implemented by AlogicTokenFactory,
// which subsequently hides these tokens, so the parser will never see them.
HASHLINE : '#' WS* 'line';
// Match anything else. This rule ensures the lexer never causes a syntax
// error and therefore we can handle all errros in the parser for simplicity.
ERRORCHAR : . ;
////////////////////////////////////////////////////////////////////////////////
mode VERBATIMENTRY_MODE;
VERBATIMENTRY_ENTITY: ENTITY -> type(ENTITY), popMode;
VERBATIMENTRY_WS: WS -> type(WS), channel(HIDDEN);
VERBATIMENTRY_NL: NL -> type(NL), channel(HIDDEN);
VERBATIMENTRY_CMT: CMT -> type(CMT), channel(HIDDEN);
VERBATIMENTRY_IDENTIFIER: IDENTIFIER -> type(IDENTIFIER), Mode(VERBATIM_MODE);
VERBATIMENTRY_ERRORCHAR : . -> type(ERRORCHAR);
////////////////////////////////////////////////////////////////////////////////
mode VERBATIM_MODE;
VERBATIM_WS: WS -> type(WS), channel(HIDDEN);
VERBATIM_NL: NL -> type(NL), channel(HIDDEN);
VERBATIM_CMT: CMT -> type(CMT), channel(HIDDEN);
VERBATIM_BODY: '{' ( VERBATIM_BODY | ~[{}] )* '}' -> popMode;
VERBATIM_ERRORCHAR : . -> type(ERRORCHAR);
|
alloy4fun_models/trashltl/models/1/ygZmGag5JWKbGipkc.als | Kaixi26/org.alloytools.alloy | 0 | 1178 | open main
pred idygZmGag5JWKbGipkc_prop2 {
some File releases historically no File
}
pred __repair { idygZmGag5JWKbGipkc_prop2 }
check __repair { idygZmGag5JWKbGipkc_prop2 <=> prop2o } |
sid/languages/matlab/MATLABLexer.g4 | ajpetersons/sid | 0 | 5961 | lexer grammar MATLABLexer;
// Keywords
FUNCTION : 'function' ;
CLASSDEF : 'classdef' ;
PROPERTIES : 'properties' ;
METHODS : 'methods' ;
END : 'end' ;
IF : 'if' ;
ELSEIF : 'elseif' ;
ELSE : 'else' ;
WHILE : 'while' ;
FOR : 'for' ;
SWITCH : 'switch' ;
CASE : 'case' ;
OTHERWISE : 'otherwise' ;
BREAK : 'break' ;
CONTINUE : 'continue' ;
RETURN : 'return' ;
CLEAR : 'clear' ;
// Symbols
EQUALS : '=' ;
EQUALTO : '==' ;
NOTEQUALTO : '~=' ;
GT : '>' ;
LT : '<' ;
GE : '>=' ;
LE : '<=' ;
PLUS : '+' ;
MINUS : '-' ;
DOT : '.' ;
VECAND : '&' ;
VECOR : '|' ;
SCALAND : '&&' ;
SCALOR : '||' ;
LPAREN : '(' ;
RPAREN : ')' ;
LBRACE : '{' ;
// RBRACE : '}' ;
LBRACK : '[' ;
// RBRACK : ']' ;
MTIMES : '*' ;
TIMES : '.*' ;
RDIVIDE : '/' ;
LDIVIDE : '\\' ;
MRDIVIDE : './' ;
MLDIVIDE : '.\\' ;
POW : '.^' ;
MPOW : '^' ;
NOT : '~' ;
COLON : ':' ;
TRANS : '.\'' ;
CTRANS : '\'' ;
FUNC_HANDLE : '@' ;
// General rules
NL : '\r'?'\n' ;
fragment
LINECONTINUE
: '...' ;
COMMENT
: ('%' | LINECONTINUE) .*? NL -> skip ;
fragment
LETTER : [a-zA-Z] ;
fragment
DIGIT : [0-9] ;
fragment
ESC : '\'\'' ;
INT : DIGIT+;
FLOAT : DIGIT+ '.' DIGIT*
| '.' DIGIT+
;
SCI : (INT|FLOAT) 'e' INT ;
ID : LETTER (LETTER|DIGIT|'_')* ;
STRING : '\'' (ESC|.)*? '\'' ;
RBRACK : ']' ;
RBRACE : '}' ;
// HCAT : (COMMA); // | SPACE ) ;
// VCAT : (SEMI | NL ) ;
// ARRAYELSEP : (HCAT| VCAT ) ; // SPACE+ ;
COMMA : ',' ;
SEMI : ';' ;
WS : SPACE+ -> skip ;
fragment
SPACE : [ \t] ;
|
src/main/antlr/ch/leadrian/samp/kamp/cidl/antlr/CIDL.g4 | TheWishWithin/cidl-kotlin | 0 | 4823 | <gh_stars>0
grammar CIDL;
@header {
package ch.leadrian.samp.kamp.cidl.antlr;
}
declarations
: (declaration SEMICOLON)*?
;
declaration
: constantDeclaration
| functionDeclaration
;
constantDeclaration
: CONST typeName constantName EQUALS constantExpression
;
constantName
: IDENT
;
constantExpression
: number
| bool
| character
| string
| constantReference
;
number
: integer
| octal
| hexadecimal
| decimal
;
integer
: INT
;
octal
: OCT
;
hexadecimal
: HEX
;
decimal
: DECIMAL
;
bool
: BOOL
;
character
: pchar
| echar
| achar
| uchar
;
pchar
: PCHAR
;
echar
: ECHAR
;
achar
: ACHAR
;
uchar
: UCHAR
;
string
: STRING
;
constantReference
: IDENT
;
functionDeclaration
: attributes? typeName functionName parameters
;
functionName
: IDENT
;
attributes
: LBRACK attributeList RBRACK
;
attributeList
: attribute (COMMA attribute)*
;
attribute
: attributeName (LPAREN constantExpression RPAREN)?
;
attributeName
: IDENT
;
parameters
: LPAREN parameterList? RPAREN
;
parameterList
: parameter (COMMA parameter)*
;
parameter
: attributes? typeName parameterName (EQUALS constantExpression)?
;
parameterName
: IDENT
;
typeName
: IDENT
;
CONST
: 'const'
;
BOOL
: 'true'
| 'false'
;
DECIMAL
: [+-]?(([0-9]* '.' [0-9]*)([eE][+-]?[0-9]+)?|[0-9]+[eE][+-][0-9]+)
;
HEX
: '0' [xX][0-9a-fA-F]+
;
OCT
: '0' [0-7]+
;
INT
: [+-]?([1-9][0-9]+|[0-9])
;
PCHAR
: '\''[^\b\f\n\r\t]'\''
;
ECHAR
: '\\'[abfnrtv'"\\?]
;
ACHAR
: '\'' '\\x' [0-9a-fA-F]+ '\''
;
UCHAR
: '\'' '\\x' [0-9a-fA-F]+ '\''
;
STRING
: '"' (.|'\n')*? '"'
;
COMMENT
: '/*' .*? '*/' -> skip
;
LINE_COMMENT
: '//' ~[\r\n]* -> skip
;
WS
: [ \t\r\n\u000C]+ -> skip
;
IDENT
: [a-zA-Z_][a-zA-Z_0-9]*
;
LPAREN
: '('
;
RPAREN
: ')'
;
LBRACK
: '['
;
RBRACK
: ']'
;
EQUALS
: '='
;
COMMA
: ','
;
SEMICOLON
: ';'
; |
theorems/homotopy/CoverClassification.agda | cmknapp/HoTT-Agda | 0 | 2118 | <reponame>cmknapp/HoTT-Agda
{-# OPTIONS --without-K #-}
open import HoTT
open import homotopy.RibbonCover
module homotopy.CoverClassification {i} (A∙ : Ptd i)
(A-conn : is-connected 0 (fst A∙)) where
open Cover
private
A : Type i
A = fst A∙
a₁ : A
a₁ = snd A∙
π1A = fundamental-group A∙
-- A covering space constructed from a G-set.
gset-to-cover : ∀ {j} → Gset π1A j → Cover A (lmax i j)
gset-to-cover gs = Ribbon-cover A∙ gs
-- Covering spaces to G-sets.
cover-to-gset-struct : ∀ {j} (cov : Cover A j)
→ GsetStructure π1A (Fiber cov a₁) (Fiber-is-set cov a₁)
cover-to-gset-struct cov = record
{ act = cover-trace cov
; unit-r = cover-trace-idp₀ cov
; assoc = cover-paste cov
}
cover-to-gset : ∀ {j} → Cover A j → Gset π1A j
cover-to-gset cov = record
{ El = Fiber cov a₁
; El-level = Fiber-level cov a₁
; gset-struct = cover-to-gset-struct cov
}
-- This is derivable from connectedness condition.
module _ where
abstract
[base-path] : ∀ {a₂ : A} → Trunc -1 (a₁ == a₂)
[base-path] {a₂} =
–> (Trunc=-equiv [ a₁ ] [ a₂ ]) (contr-has-all-paths A-conn [ a₁ ] [ a₂ ])
-- Part 1: Show that the synthesized cover (ribbon) is fiberwisely
-- equivalent to the original fiber.
private
module _ {j} (cov : Cover A j) where
-- Suppose that we get the path, we can compute the ribbon easily.
fiber+path-to-ribbon : ∀ {a₂} (a↑ : Fiber cov a₂) (p : a₁ == a₂)
→ Ribbon A∙ (cover-to-gset cov) a₂
fiber+path-to-ribbon {a₂} a↑ p =
trace (cover-trace cov a↑ [ ! p ]) [ p ]
abstract
-- Our construction is "constant" with respect to paths.
fiber+path-to-ribbon-is-path-irrelevant :
∀ {a₂} (a↑ : Fiber cov a₂) (p₁ p₂ : a₁ == a₂)
→ fiber+path-to-ribbon a↑ p₁ == fiber+path-to-ribbon a↑ p₂
fiber+path-to-ribbon-is-path-irrelevant a↑ p idp =
trace (cover-trace cov a↑ [ ! p ]) [ p ]
=⟨ paste a↑ [ ! p ] [ p ] ⟩
trace a↑ [ ! p ∙ p ]
=⟨ ap (trace a↑) $ !₀-inv-l [ p ] ⟩
trace a↑ idp₀
∎
open import homotopy.ConstantToSetFactorization
fiber+path₋₁-to-ribbon : ∀ {a₂} (a↑ : Cover.Fiber cov a₂)
→ Trunc -1 (a₁ == a₂) → Ribbon A∙ (cover-to-gset cov) a₂
fiber+path₋₁-to-ribbon a↑ = cst-extend
Ribbon-is-set
(fiber+path-to-ribbon a↑)
(fiber+path-to-ribbon-is-path-irrelevant a↑)
-- So the conversion from fiber to ribbon is done.
fiber-to-ribbon : ∀ {j} (cov : Cover A j)
→ {a₂ : A} (a↑ : Cover.Fiber cov a₂)
→ Ribbon A∙ (cover-to-gset cov) a₂
fiber-to-ribbon cov a↑ = fiber+path₋₁-to-ribbon cov a↑ [base-path]
-- The other direction is easy.
ribbon-to-fiber : ∀ {j} (cov : Cover A j) {a₂}
→ Ribbon A∙ (cover-to-gset cov) a₂ → Cover.Fiber cov a₂
ribbon-to-fiber cov {a₂} r =
Ribbon-rec (Fiber-is-set cov a₂) (cover-trace cov) (cover-paste cov) r
private
-- Some routine computations.
abstract
ribbon-to-fiber-to-ribbon : ∀ {j} (cov : Cover A j) {a₂}
→ (r : Ribbon A∙ (cover-to-gset cov) a₂)
→ fiber-to-ribbon cov (ribbon-to-fiber cov r) == r
ribbon-to-fiber-to-ribbon cov {a₂} = Ribbon-elim
{P = λ r → fiber-to-ribbon cov (ribbon-to-fiber cov r) == r}
(λ _ → =-preserves-set Ribbon-is-set)
(λ a↑ p → Trunc-elim
-- All ugly things will go away when bp = proj bp′
(λ bp → Ribbon-is-set
(fiber+path₋₁-to-ribbon cov (cover-trace cov a↑ p) bp)
(trace a↑ p))
(lemma a↑ p)
[base-path])
(λ _ _ _ → prop-has-all-paths-↓ (Ribbon-is-set _ _))
where
abstract
lemma : ∀ {a₂} (a↑ : Cover.Fiber cov a₁) (p : a₁ =₀ a₂) (bp : a₁ == a₂)
→ trace {A∙ = A∙} {gs = cover-to-gset cov}
(cover-trace cov (cover-trace cov a↑ p) [ ! bp ]) [ bp ]
== trace {A∙ = A∙} {gs = cover-to-gset cov} a↑ p
lemma a↑ p idp =
trace (cover-trace cov a↑ p) idp₀
=⟨ paste a↑ p idp₀ ⟩
trace a↑ (p ∙₀ idp₀)
=⟨ ap (trace a↑) $ ∙₀-unit-r p ⟩
trace a↑ p
∎
fiber-to-ribbon-to-fiber : ∀ {j} (cov : Cover A j) {a₂}
→ (a↑ : Cover.Fiber cov a₂)
→ ribbon-to-fiber cov (fiber-to-ribbon cov {a₂} a↑) == a↑
fiber-to-ribbon-to-fiber cov {a₂} a↑ = Trunc-elim
-- All ugly things will go away when bp = proj bp′
(λ bp → Cover.Fiber-is-set cov a₂
(ribbon-to-fiber cov
(fiber+path₋₁-to-ribbon cov a↑ bp))
a↑)
(lemma a↑)
[base-path]
where
abstract
lemma : ∀ {a₂} (a↑ : Cover.Fiber cov a₂) (bp : a₁ == a₂)
→ cover-trace cov (cover-trace cov a↑ [ ! bp ]) [ bp ]
== a↑
lemma a↑ idp = idp
cover-to-gset-to-cover : ∀ {j} (cov : Cover A (lmax i j))
→ gset-to-cover (cover-to-gset cov) == cov
cover-to-gset-to-cover cov = cover= λ _ →
ribbon-to-fiber cov , is-eq
(ribbon-to-fiber cov)
(fiber-to-ribbon cov)
(fiber-to-ribbon-to-fiber cov)
(ribbon-to-fiber-to-ribbon cov)
-- The second direction : gset -> covering -> gset
-- Part 2.1: The fiber over the point a is the carrier.
ribbon-a₁-to-El : ∀ {j} {gs : Gset π1A j}
→ Ribbon A∙ gs a₁ → Gset.El gs
ribbon-a₁-to-El {j} {gs} = let open Gset gs in
Ribbon-rec El-level act assoc
ribbon-a₁-to-El-equiv : ∀ {j} {gs : Gset π1A j}
→ Ribbon A∙ gs a₁ ≃ Gset.El gs
ribbon-a₁-to-El-equiv {j} {gs} = let open Gset gs in
ribbon-a₁-to-El , is-eq _
(λ r → trace r idp₀)
(λ a↑ → unit-r a↑)
(Ribbon-elim
{P = λ r → trace (ribbon-a₁-to-El r) idp₀ == r}
(λ _ → =-preserves-set Ribbon-is-set)
(λ y p →
trace (act y p) idp₀
=⟨ paste y p idp₀ ⟩
trace y (p ∙₀ idp₀)
=⟨ ap (trace y) $ ∙₀-unit-r p ⟩
trace y p
∎)
(λ _ _ _ → prop-has-all-paths-↓ (Ribbon-is-set _ _)))
gset-to-cover-to-gset : ∀ {j} (gs : Gset π1A (lmax i j))
→ cover-to-gset (gset-to-cover gs) == gs
gset-to-cover-to-gset gs =
gset=
ribbon-a₁-to-El-equiv
(λ {x₁}{x₂} x= → Trunc-elim (λ _ → =-preserves-set $ Gset.El-is-set gs) λ g →
ribbon-a₁-to-El (transport (Ribbon A∙ gs) g x₁)
=⟨ ap (λ x → ribbon-a₁-to-El (transport (Ribbon A∙ gs) g x))
$ ! $ <–-inv-l ribbon-a₁-to-El-equiv x₁ ⟩
ribbon-a₁-to-El (transport (Ribbon A∙ gs) g (trace (ribbon-a₁-to-El x₁) idp₀))
=⟨ ap (λ x → ribbon-a₁-to-El (transport (Ribbon A∙ gs) g (trace x idp₀))) x= ⟩
ribbon-a₁-to-El (transport (Ribbon A∙ gs) g (trace x₂ idp₀))
=⟨ ap ribbon-a₁-to-El $ trans-trace g x₂ idp₀ ⟩
Gset.act gs x₂ [ g ]
∎)
-- Finally...
gset-to-cover-equiv : ∀ {j}
→ Gset π1A (lmax i j) ≃ Cover A (lmax i j)
gset-to-cover-equiv {j} =
gset-to-cover , is-eq
_
(λ c → cover-to-gset c)
(λ c → cover-to-gset-to-cover {lmax i j} c)
(gset-to-cover-to-gset {lmax i j})
|
Linux/execve.asm | EgeBalci/Shellcode | 2 | 99149 | ####Linux/x86 execve /bin/sh shellcode 21 bytes####
#Greetz : Bomberman
#Author : B3mB4m
Disassembly of section .text:
08048060 <.text>:
8048060: 31 c0 xor %eax,%eax
8048062: 50 push %eax
8048063: 68 2f 2f 73 68 push $0x68732f2f
8048068: 68 2f 62 69 6e push $0x6e69622f
804806d: 89 e3 mov %esp,%ebx
804806f: 89 c2 mov %eax,%edx
8048071: b0 0b mov $0xb,%al
8048073: cd 80 int $0x80
#include <stdio.h>
#include <string.h>
char *shellcode = "\x31\xc0\x50\x68\x2f\x2f\x73\x68\x68\x2f\x62\x69\x6e\x89\xe3\x89\xc2\xb0\x0b\xcd\x80";
int main(void){
fprintf(stdout,"Length: %d\n",strlen(shellcode));
(*(void(*)()) shellcode)();}
# Length: 21 PWNED !
|
Samples/Primes.asm | charles-fox/ManchesterBabyPython | 0 | 8917 | --
-- Each time the program is run (pressing the EXEC button) the next prime number in the sequence is generated.
--
00: JMP 24
01: LDN 21
02: STO 21
03: LDN 21
04: SUB 15
05: STO 21
06: LDN 15
07: STO 22
08: LDN 22
09: STO 22
10: LDN 22
11: SUB 15
12: STO 22
13: SUB 21
14: CMP
15: NUM -1
16: LDN 21
17: STO 23
18: LDN 23
19: SUB 22
20: JMP 0
21: NUM 1
24: NUM 7
25: CMP
26: JPR 0
27: STO 23
28: LDN 23
29: SUB 22
30: CMP
31: JMP 20
|
src/elaboration-helpers.agda | xoltar/cedille | 0 | 11475 | <filename>src/elaboration-helpers.agda<gh_stars>0
{-# OPTIONS --allow-unsolved-metas #-}
import cedille-options
module elaboration-helpers (options : cedille-options.options) where
open import lib
open import monad-instances
open import general-util
open import cedille-types
open import syntax-util
open import ctxt
open import conversion
open import constants
open import to-string options
open import subst
open import rename
open import is-free
open import toplevel-state options {id}
open import spans options {id}
uncurry' : ∀ {A B C D : Set} → (A → B → C → D) → (A × B × C) → D
uncurry' f (a , b , c) = f a b c
uncurry'' : ∀ {A B C D E : Set} → (A → B → C → D → E) → (A × B × C × D) → E
uncurry'' f (a , b , c , d) = f a b c d
uncurry''' : ∀ {A B C D E F : Set} → (A → B → C → D → E → F) → (A × B × C × D × E) → F
uncurry''' f (a , b , c , d , e) = f a b c d e
ctxt-term-decl' : posinfo → var → type → ctxt → ctxt
ctxt-term-decl' pi x T (mk-ctxt (fn , mn , ps , q) ss is os d) =
mk-ctxt (fn , mn , ps , trie-insert q x (x , ArgsNil)) ss
(trie-insert is x (term-decl T , fn , pi)) os d
ctxt-type-decl' : posinfo → var → kind → ctxt → ctxt
ctxt-type-decl' pi x k (mk-ctxt (fn , mn , ps , q) ss is os d) =
mk-ctxt (fn , mn , ps , trie-insert q x (x , ArgsNil)) ss
(trie-insert is x (type-decl k , fn , pi)) os d
ctxt-tk-decl' : posinfo → var → tk → ctxt → ctxt
ctxt-tk-decl' pi x (Tkt T) = ctxt-term-decl' pi x T
ctxt-tk-decl' pi x (Tkk k) = ctxt-type-decl' pi x k
ctxt-param-decl : var → var → tk → ctxt → ctxt
ctxt-param-decl x x' atk Γ @ (mk-ctxt (fn , mn , ps , q) ss is os ds) =
let d = case atk of λ {(Tkt T) → term-decl T; (Tkk k) → type-decl k} in
mk-ctxt
(fn , mn , ps , trie-insert q x (x , ArgsNil)) ss
(trie-insert is x' (d , fn , posinfo-gen)) os ds
ctxt-term-def' : var → var → term → type → opacity → ctxt → ctxt
ctxt-term-def' x x' t T op Γ @ (mk-ctxt (fn , mn , ps , q) ss is os d) = mk-ctxt
(fn , mn , ps , qualif-insert-params q (mn # x) x ps) ss
(trie-insert is x' (term-def (just ps) op (hnf Γ unfold-head t tt) T , fn , x)) os d
ctxt-type-def' : var → var → type → kind → opacity → ctxt → ctxt
ctxt-type-def' x x' T k op Γ @ (mk-ctxt (fn , mn , ps , q) ss is os d) = mk-ctxt
(fn , mn , ps , qualif-insert-params q (mn # x) x ps) ss
(trie-insert is x' (type-def (just ps) op (hnf Γ (unfolding-elab unfold-head) T tt) k , fn , x)) os d
ctxt-let-term-def : posinfo → var → term → type → ctxt → ctxt
ctxt-let-term-def pi x t T (mk-ctxt (fn , mn , ps , q) ss is os d) =
mk-ctxt (fn , mn , ps , trie-insert q x (x , ArgsNil)) ss
(trie-insert is x (term-def nothing OpacTrans t T , fn , pi)) os d
ctxt-let-type-def : posinfo → var → type → kind → ctxt → ctxt
ctxt-let-type-def pi x T k (mk-ctxt (fn , mn , ps , q) ss is os d) =
mk-ctxt (fn , mn , ps , trie-insert q x (x , ArgsNil)) ss
(trie-insert is x (type-def nothing OpacTrans T k , fn , pi)) os d
ctxt-kind-def' : var → var → params → kind → ctxt → ctxt
ctxt-kind-def' x x' ps2 k Γ @ (mk-ctxt (fn , mn , ps1 , q) ss is os d) = mk-ctxt
(fn , mn , ps1 , qualif-insert-params q (mn # x) x ps1) ss
(trie-insert is x' (kind-def (append-params ps1 $ qualif-params Γ ps2) k' , fn , posinfo-gen)) os d
where
k' = hnf Γ unfold-head k tt
ctxt-lookup-term-var' : ctxt → var → maybe type
ctxt-lookup-term-var' Γ @ (mk-ctxt (fn , mn , ps , q) ss is os d) x =
env-lookup Γ x ≫=maybe λ where
(term-decl T , _) → just T
(term-def ps _ _ T , _ , x') →
let ps = maybe-else ParamsNil id ps in
just $ abs-expand-type ps T
_ → nothing
-- TODO: Could there be parameter/argument clashes if the same parameter variable is defined multiple times?
-- TODO: Could variables be parameter-expanded multiple times?
ctxt-lookup-type-var' : ctxt → var → maybe kind
ctxt-lookup-type-var' Γ @ (mk-ctxt (fn , mn , ps , q) ss is os d) x =
env-lookup Γ x ≫=maybe λ where
(type-decl k , _) → just k
(type-def ps _ _ k , _ , x') →
let ps = maybe-else ParamsNil id ps in
just $ abs-expand-kind ps k
_ → nothing
subst-qualif : ∀ {ed : exprd} → ctxt → renamectxt → ⟦ ed ⟧ → ⟦ ed ⟧
subst-qualif{TERM} Γ ρ = subst-renamectxt Γ ρ ∘ qualif-term Γ
subst-qualif{TYPE} Γ ρ = subst-renamectxt Γ ρ ∘ qualif-type Γ
subst-qualif{KIND} Γ ρ = subst-renamectxt Γ ρ ∘ qualif-kind Γ
subst-qualif Γ ρ = id
rename-validify : string → string
rename-validify = 𝕃char-to-string ∘ (h ∘ string-to-𝕃char) where
validify-char : char → 𝕃 char
validify-char c with
(c =char 'a') ||
(c =char 'z') ||
(c =char 'A') ||
(c =char 'Z') ||
(c =char '\'') ||
(c =char '-') ||
(c =char '_') ||
is-digit c ||
(('a' <char c) && (c <char 'z')) ||
(('A' <char c) && (c <char 'Z'))
...| tt = [ c ]
...| ff = 'Z' :: string-to-𝕃char (ℕ-to-string (toNat c)) ++ [ 'Z' ]
h : 𝕃 char → 𝕃 char
h [] = []
h (c :: cs) = validify-char c ++ h cs
-- Returns a fresh variable name by adding primes and replacing invalid characters
fresh-var' : string → (string → 𝔹) → renamectxt → string
fresh-var' = fresh-var ∘ rename-validify
rename-new_from_for_ : ∀ {X : Set} → var → ctxt → (var → X) → X
rename-new "_" from Γ for f = f $ fresh-var' "x" (ctxt-binds-var Γ) empty-renamectxt
rename-new x from Γ for f = f $ fresh-var' x (ctxt-binds-var Γ) empty-renamectxt
rename_from_for_ : ∀ {X : Set} → var → ctxt → (var → X) → X
rename "_" from Γ for f = f "_"
rename x from Γ for f = f $ fresh-var' x (ctxt-binds-var Γ) empty-renamectxt
fresh-id-term : ctxt → term
fresh-id-term Γ = rename "x" from Γ for λ x → mlam x $ mvar x
get-renaming : renamectxt → var → var → var × renamectxt
get-renaming ρ xₒ x = let x' = fresh-var' x (renamectxt-in-range ρ) ρ in x' , renamectxt-insert ρ xₒ x'
rename_-_from_for_ : ∀ {X : Set} → var → var → renamectxt → (var → renamectxt → X) → X
rename xₒ - "_" from ρ for f = f "_" ρ
rename xₒ - x from ρ for f = uncurry f $ get-renaming ρ xₒ x
rename_-_lookup_for_ : ∀ {X : Set} → var → var → renamectxt → (var → renamectxt → X) → X
rename xₒ - x lookup ρ for f with renamectxt-lookup ρ xₒ
...| nothing = rename xₒ - x from ρ for f
...| just x' = f x' ρ
qualif-new-var : ctxt → var → var
qualif-new-var Γ x = ctxt-get-current-modname Γ # x
mbeta : term → term → term
mrho : term → var → type → term → term
mtpeq : term → term → type
mbeta t t' = Beta posinfo-gen (SomeTerm t posinfo-gen) (SomeTerm t' posinfo-gen)
mrho t x T t' = Rho posinfo-gen RhoPlain NoNums t (Guide posinfo-gen x T) t'
mtpeq t1 t2 = TpEq posinfo-gen t1 t2 posinfo-gen
subst-args-params : ctxt → args → params → kind → kind
subst-args-params Γ (ArgsCons (TermArg _ t) ys) (ParamsCons (Decl _ _ _ x _ _) ps) k =
subst-args-params Γ ys ps $ subst Γ t x k
subst-args-params Γ (ArgsCons (TypeArg t) ys) (ParamsCons (Decl _ _ _ x _ _) ps) k =
subst-args-params Γ ys ps $ subst Γ t x k
subst-args-params Γ ys ps k = k
data indx : Set where
Index : var → tk → indx
data ctr : Set where
Ctr : var → type → ctr
parameters = 𝕃 decl
indices = 𝕃 indx
constructors = 𝕃 ctr
data datatype : Set where
Data : var → parameters → indices → constructors → datatype
params-to-parameters : params → parameters
params-to-parameters ParamsNil = []
params-to-parameters (ParamsCons p ps) = p :: params-to-parameters ps
{-# TERMINATING #-}
decompose-arrows : ctxt → type → parameters × type
decompose-arrows Γ (Abs pi me pi' x atk T) =
rename-new x from Γ for λ x' →
case decompose-arrows (ctxt-var-decl x' Γ) (rename-var Γ x x' T) of λ where
(ps , T') → Decl posinfo-gen posinfo-gen me x' atk posinfo-gen :: ps , T'
decompose-arrows Γ (TpArrow T me T') =
rename-new "_" from Γ for λ x →
case decompose-arrows (ctxt-var-decl x Γ) T' of λ where
(ps , T'') → Decl posinfo-gen posinfo-gen me x (Tkt T) posinfo-gen :: ps , T''
decompose-arrows Γ (TpParens pi T pi') = decompose-arrows Γ T
decompose-arrows Γ T = [] , T
decompose-ctr-type : ctxt → type → type × parameters × 𝕃 tty
decompose-ctr-type Γ T with decompose-arrows Γ T
...| ps , Tᵣ with decompose-tpapps Tᵣ
...| Tₕ , as = Tₕ , ps , as
{-# TERMINATING #-}
kind-to-indices : ctxt → kind → indices
kind-to-indices Γ (KndArrow k k') =
rename "x" from Γ for λ x' →
Index x' (Tkk k) :: kind-to-indices (ctxt-var-decl x' Γ) k'
kind-to-indices Γ (KndParens pi k pi') = kind-to-indices Γ k
kind-to-indices Γ (KndPi pi pi' x atk k) =
rename x from Γ for λ x' →
Index x' atk :: kind-to-indices (ctxt-var-decl x' Γ) k
kind-to-indices Γ (KndTpArrow T k) =
rename "x" from Γ for λ x' →
Index x' (Tkt T) :: kind-to-indices (ctxt-var-decl x' Γ) k
kind-to-indices Γ (KndVar pi x as) with ctxt-lookup-kind-var-def Γ x
...| nothing = []
...| just (ps , k) = kind-to-indices Γ $ subst-args-params Γ as ps k
kind-to-indices Γ (Star pi) = []
dataConsts-to-ctrs : dataConsts → constructors
dataConsts-to-ctrs DataNull = []
dataConsts-to-ctrs (DataCons (DataConst _ x T) cs) = Ctr x T :: dataConsts-to-ctrs cs
defDatatype-to-datatype : ctxt → defDatatype → datatype
defDatatype-to-datatype Γ (Datatype _ _ x ps k dcs _) =
Data x (params-to-parameters ps) (kind-to-indices Γ k) (dataConsts-to-ctrs dcs)
indices-to-kind : indices → kind → kind
indices-to-kind = flip $ foldr λ {(Index x atk) → KndPi posinfo-gen posinfo-gen x atk}
parameters-to-kind : parameters → kind → kind
parameters-to-kind = flip $ foldr λ {(Decl pi pi' me x atk pi'') → KndPi pi pi' x atk}
indices-to-tplams : indices → (body : type) → type
indices-to-tplams = flip $ foldr λ where
(Index x atk) → TpLambda posinfo-gen posinfo-gen x atk
parameters-to-tplams : parameters → (body : type) → type
parameters-to-tplams = flip $ foldr λ where
(Decl pi pi' me x atk pi'') → TpLambda pi pi' x atk
indices-to-alls : indices → (body : type) → type
indices-to-alls = flip $ foldr λ where
(Index x atk) → Abs posinfo-gen Erased posinfo-gen x atk
parameters-to-alls : parameters → (body : type) → type
parameters-to-alls = flip $ foldr λ where
(Decl pi pi' me x atk pi'') → Abs pi me pi' x atk
indices-to-lams : indices → (body : term) → term
indices-to-lams = flip $ foldr λ where
(Index x atk) → Lam posinfo-gen Erased posinfo-gen x (SomeClass atk)
indices-to-lams' : indices → (body : term) → term
indices-to-lams' = flip $ foldr λ where
(Index x atk) → Lam posinfo-gen Erased posinfo-gen x NoClass
parameters-to-lams : parameters → (body : term) → term
parameters-to-lams = flip $ foldr λ where
(Decl pi pi' me x atk pi'') → Lam pi me pi' x (SomeClass atk)
parameters-to-lams' : parameters → (body : term) → term
parameters-to-lams' = flip $ foldr λ where
(Decl pi pi' me x atk pi'') → Lam pi me pi' x NoClass
indices-to-apps : indices → (body : term) → term
indices-to-apps = flip $ foldl λ where
(Index x (Tkt T)) t → App t Erased (mvar x)
(Index x (Tkk k)) t → AppTp t (mtpvar x)
parameters-to-apps : parameters → (body : term) → term
parameters-to-apps = flip $ foldl λ where
(Decl pi pi' me x (Tkt T) pi'') t → App t me (mvar x)
(Decl pi pi' me x (Tkk k) pi'') t → AppTp t (mtpvar x)
indices-to-tpapps : indices → (body : type) → type
indices-to-tpapps = flip $ foldl λ where
(Index x (Tkt T)) T' → TpAppt T' (mvar x)
(Index x (Tkk k)) T → TpApp T (mtpvar x)
parameters-to-tpapps : parameters → (body : type) → type
parameters-to-tpapps = flip $ foldl λ where
(Decl pi pi' me x (Tkt T) pi'') T' → TpAppt T' (mvar x)
(Decl pi pi' me x (Tkk k) pi'') T → TpApp T (mtpvar x)
constructors-to-lams' : constructors → (body : term) → term
constructors-to-lams' = flip $ foldr λ where
(Ctr x T) → Lam posinfo-gen NotErased posinfo-gen x NoClass
constructors-to-lams : ctxt → var → parameters → constructors → (body : term) → term
constructors-to-lams Γ x ps cs t = foldr
(λ {(Ctr y T) f Γ → Lam posinfo-gen NotErased posinfo-gen y
(SomeClass $ Tkt $ subst Γ (parameters-to-tpapps ps $ mtpvar y) y T)
$ f $ ctxt-var-decl y Γ})
(λ Γ → t) cs Γ
add-indices-to-ctxt : indices → ctxt → ctxt
add-indices-to-ctxt = flip $ foldr λ {(Index x atk) → ctxt-var-decl x}
add-parameters-to-ctxt : parameters → ctxt → ctxt
add-parameters-to-ctxt = flip $ foldr λ {(Decl _ _ _ x'' _ _) → ctxt-var-decl x''}
add-constructors-to-ctxt : constructors → ctxt → ctxt
add-constructors-to-ctxt = flip $ foldr λ where
(Ctr x T) → ctxt-var-decl x
module reindexing (Γ : ctxt) (isₒ : indices) where
reindex-fresh-var : renamectxt → trie indices → var → var
reindex-fresh-var ρ is "_" = "_"
reindex-fresh-var ρ is x =
fresh-var x (λ x' → ctxt-binds-var Γ x' || trie-contains is x') ρ
rename-indices : renamectxt → trie indices → indices
rename-indices ρ is = foldr {B = renamectxt → indices}
(λ {(Index x atk) f ρ →
let x' = reindex-fresh-var ρ is x in
Index x' (substh-tk {TERM} Γ ρ empty-trie atk) :: f (renamectxt-insert ρ x x')})
(λ ρ → []) isₒ ρ
reindex-t : Set → Set
reindex-t X = renamectxt → trie indices → X → X
reindex : ∀ {ed} → reindex-t ⟦ ed ⟧
reindex-term : reindex-t term
reindex-type : reindex-t type
reindex-kind : reindex-t kind
reindex-tk : reindex-t tk
reindex-liftingType : reindex-t liftingType
reindex-optTerm : reindex-t optTerm
reindex-optType : reindex-t optType
reindex-optGuide : reindex-t optGuide
reindex-optClass : reindex-t optClass
reindex-lterms : reindex-t lterms
reindex-args : reindex-t args
reindex-arg : reindex-t arg
reindex-theta : reindex-t theta
reindex-vars : reindex-t (maybe vars)
reindex-defTermOrType : renamectxt → trie indices → defTermOrType → defTermOrType × renamectxt
reindex{TERM} = reindex-term
reindex{TYPE} = reindex-type
reindex{KIND} = reindex-kind
reindex{TK} = reindex-tk
reindex = λ ρ is x → x
rc-is : renamectxt → indices → renamectxt
rc-is = foldr λ {(Index x atk) ρ → renamectxt-insert ρ x x}
index-var = "indices"
index-type-var = "Indices"
is-index-var = isJust ∘ is-pfx index-var
is-index-type-var = isJust ∘ is-pfx index-type-var
reindex-term ρ is (App t me (Var pi x)) with trie-lookup is x
...| nothing = App (reindex-term ρ is t) me (reindex-term ρ is (Var pi x))
...| just is' = indices-to-apps is' $ reindex-term ρ is t
reindex-term ρ is (App t me t') =
App (reindex-term ρ is t) me (reindex-term ρ is t')
reindex-term ρ is (AppTp t T) =
AppTp (reindex-term ρ is t) (reindex-type ρ is T)
reindex-term ρ is (Beta pi ot ot') =
Beta pi (reindex-optTerm ρ is ot) (reindex-optTerm ρ is ot')
reindex-term ρ is (Chi pi oT t) =
Chi pi (reindex-optType ρ is oT) (reindex-term ρ is t)
reindex-term ρ is (Delta pi oT t) =
Delta pi (reindex-optType ρ is oT) (reindex-term ρ is t)
reindex-term ρ is (Epsilon pi lr m t) =
Epsilon pi lr m (reindex-term ρ is t)
reindex-term ρ is (Hole pi) =
Hole pi
reindex-term ρ is (IotaPair pi t t' g pi') =
IotaPair pi (reindex-term ρ is t) (reindex-term ρ is t') (reindex-optGuide ρ is g) pi'
reindex-term ρ is (IotaProj t n pi) =
IotaProj (reindex-term ρ is t) n pi
reindex-term ρ is (Lam pi me pi' x oc t) with is-index-var x
...| ff = let x' = reindex-fresh-var ρ is x in
Lam pi me pi' x' (reindex-optClass ρ is oc) (reindex-term (renamectxt-insert ρ x x') is t)
...| tt with rename-indices ρ is | oc
...| isₙ | NoClass = indices-to-lams' isₙ $ reindex-term (rc-is ρ isₙ) (trie-insert is x isₙ) t
...| isₙ | SomeClass atk = indices-to-lams isₙ $ reindex-term (rc-is ρ isₙ) (trie-insert is x isₙ) t
reindex-term ρ is (Let pi d t) =
elim-pair (reindex-defTermOrType ρ is d) λ d' ρ' → Let pi d' (reindex-term ρ' is t)
reindex-term ρ is (Open pi x t) =
Open pi x (reindex-term ρ is t)
reindex-term ρ is (Parens pi t pi') =
reindex-term ρ is t
reindex-term ρ is (Phi pi t₌ t₁ t₂ pi') =
Phi pi (reindex-term ρ is t₌) (reindex-term ρ is t₁) (reindex-term ρ is t₂) pi'
reindex-term ρ is (Rho pi op on t og t') =
Rho pi op on (reindex-term ρ is t) (reindex-optGuide ρ is og) (reindex-term ρ is t')
reindex-term ρ is (Sigma pi t) =
Sigma pi (reindex-term ρ is t)
reindex-term ρ is (Theta pi θ t ts) =
Theta pi (reindex-theta ρ is θ) (reindex-term ρ is t) (reindex-lterms ρ is ts)
reindex-term ρ is (Var pi x) =
Var pi $ renamectxt-rep ρ x
reindex-term ρ is (Mu pi x t oT pi' cs pi'') = Var posinfo-gen "template-mu-not-allowed"
reindex-term ρ is (Mu' pi t oT pi' cs pi'') = Var posinfo-gen "template-mu-not-allowed"
reindex-type ρ is (Abs pi me pi' x atk T) with is-index-var x
...| ff = let x' = reindex-fresh-var ρ is x in
Abs pi me pi' x' (reindex-tk ρ is atk) (reindex-type (renamectxt-insert ρ x x') is T)
...| tt = let isₙ = rename-indices ρ is in
indices-to-alls isₙ $ reindex-type (rc-is ρ isₙ) (trie-insert is x isₙ) T
reindex-type ρ is (Iota pi pi' x T T') =
let x' = reindex-fresh-var ρ is x in
Iota pi pi' x' (reindex-type ρ is T) (reindex-type (renamectxt-insert ρ x x') is T')
reindex-type ρ is (Lft pi pi' x t lT) =
let x' = reindex-fresh-var ρ is x in
Lft pi pi' x' (reindex-term (renamectxt-insert ρ x x') is t) (reindex-liftingType ρ is lT)
reindex-type ρ is (NoSpans T pi) =
NoSpans (reindex-type ρ is T) pi
reindex-type ρ is (TpLet pi d T) =
elim-pair (reindex-defTermOrType ρ is d) λ d' ρ' → TpLet pi d' (reindex-type ρ' is T)
reindex-type ρ is (TpApp T T') =
TpApp (reindex-type ρ is T) (reindex-type ρ is T')
reindex-type ρ is (TpAppt T (Var pi x)) with trie-lookup is x
...| nothing = TpAppt (reindex-type ρ is T) (reindex-term ρ is (Var pi x))
...| just is' = indices-to-tpapps is' $ reindex-type ρ is T
reindex-type ρ is (TpAppt T t) =
TpAppt (reindex-type ρ is T) (reindex-term ρ is t)
reindex-type ρ is (TpArrow (TpVar pi x) Erased T) with is-index-type-var x
...| ff = TpArrow (reindex-type ρ is (TpVar pi x)) Erased (reindex-type ρ is T)
...| tt = let isₙ = rename-indices ρ is in
indices-to-alls isₙ $ reindex-type (rc-is ρ isₙ) (trie-insert is x isₙ) T
reindex-type ρ is (TpArrow T me T') =
TpArrow (reindex-type ρ is T) me (reindex-type ρ is T')
reindex-type ρ is (TpEq pi t t' pi') =
TpEq pi (reindex-term ρ is t) (reindex-term ρ is t') pi'
reindex-type ρ is (TpHole pi) =
TpHole pi
reindex-type ρ is (TpLambda pi pi' x atk T) with is-index-var x
...| ff = let x' = reindex-fresh-var ρ is x in
TpLambda pi pi' x' (reindex-tk ρ is atk) (reindex-type (renamectxt-insert ρ x x') is T)
...| tt = let isₙ = rename-indices ρ is in
indices-to-tplams isₙ $ reindex-type (rc-is ρ isₙ) (trie-insert is x isₙ) T
reindex-type ρ is (TpParens pi T pi') =
reindex-type ρ is T
reindex-type ρ is (TpVar pi x) =
TpVar pi $ renamectxt-rep ρ x
reindex-kind ρ is (KndParens pi k pi') =
reindex-kind ρ is k
reindex-kind ρ is (KndArrow k k') =
KndArrow (reindex-kind ρ is k) (reindex-kind ρ is k')
reindex-kind ρ is (KndPi pi pi' x atk k) with is-index-var x
...| ff = let x' = reindex-fresh-var ρ is x in
KndPi pi pi' x' (reindex-tk ρ is atk) (reindex-kind (renamectxt-insert ρ x x') is k)
...| tt = let isₙ = rename-indices ρ is in
indices-to-kind isₙ $ reindex-kind (rc-is ρ isₙ) (trie-insert is x isₙ) k
reindex-kind ρ is (KndTpArrow (TpVar pi x) k) with is-index-type-var x
...| ff = KndTpArrow (reindex-type ρ is (TpVar pi x)) (reindex-kind ρ is k)
...| tt = let isₙ = rename-indices ρ is in
indices-to-kind isₙ $ reindex-kind (rc-is ρ isₙ) is k
reindex-kind ρ is (KndTpArrow T k) =
KndTpArrow (reindex-type ρ is T) (reindex-kind ρ is k)
reindex-kind ρ is (KndVar pi x as) =
KndVar pi (renamectxt-rep ρ x) (reindex-args ρ is as)
reindex-kind ρ is (Star pi) =
Star pi
reindex-tk ρ is (Tkt T) = Tkt $ reindex-type ρ is T
reindex-tk ρ is (Tkk k) = Tkk $ reindex-kind ρ is k
-- Can't reindex large indices in a lifting type (LiftPi requires a type, not a tk),
-- so for now we will just ignore reindexing lifting types.
-- Types withing lifting types will still be reindexed, though.
reindex-liftingType ρ is (LiftArrow lT lT') =
LiftArrow (reindex-liftingType ρ is lT) (reindex-liftingType ρ is lT')
reindex-liftingType ρ is (LiftParens pi lT pi') =
reindex-liftingType ρ is lT
reindex-liftingType ρ is (LiftPi pi x T lT) =
let x' = reindex-fresh-var ρ is x in
LiftPi pi x' (reindex-type ρ is T) (reindex-liftingType (renamectxt-insert ρ x x') is lT)
reindex-liftingType ρ is (LiftStar pi) =
LiftStar pi
reindex-liftingType ρ is (LiftTpArrow T lT) =
LiftTpArrow (reindex-type ρ is T) (reindex-liftingType ρ is lT)
reindex-optTerm ρ is NoTerm = NoTerm
reindex-optTerm ρ is (SomeTerm t pi) = SomeTerm (reindex-term ρ is t) pi
reindex-optType ρ is NoType = NoType
reindex-optType ρ is (SomeType T) = SomeType (reindex-type ρ is T)
reindex-optClass ρ is NoClass = NoClass
reindex-optClass ρ is (SomeClass atk) = SomeClass (reindex-tk ρ is atk)
reindex-optGuide ρ is NoGuide = NoGuide
reindex-optGuide ρ is (Guide pi x T) =
let x' = reindex-fresh-var ρ is x in
Guide pi x' (reindex-type (renamectxt-insert ρ x x') is T)
reindex-lterms ρ is (LtermsNil pi) = LtermsNil pi
reindex-lterms ρ is (LtermsCons me t ts) =
LtermsCons me (reindex-term ρ is t) (reindex-lterms ρ is ts)
reindex-theta ρ is (AbstractVars xs) = maybe-else Abstract AbstractVars $ reindex-vars ρ is $ just xs
reindex-theta ρ is θ = θ
reindex-vars''' : vars → vars → vars
reindex-vars''' (VarsNext x xs) xs' = VarsNext x $ reindex-vars''' xs xs'
reindex-vars''' (VarsStart x) xs = VarsNext x xs
reindex-vars'' : vars → maybe vars
reindex-vars'' (VarsNext x (VarsStart x')) = just $ VarsStart x
reindex-vars'' (VarsNext x xs) = maybe-map (VarsNext x) $ reindex-vars'' xs
reindex-vars'' (VarsStart x) = nothing
reindex-vars' : renamectxt → trie indices → var → maybe vars
reindex-vars' ρ is x = maybe-else (just $ VarsStart $ renamectxt-rep ρ x)
(reindex-vars'' ∘ flip foldr (VarsStart "") λ {(Index x atk) → VarsNext x}) (trie-lookup is x)
reindex-vars ρ is (just (VarsStart x)) = reindex-vars' ρ is x
reindex-vars ρ is (just (VarsNext x xs)) = maybe-else (reindex-vars ρ is $ just xs)
(λ xs' → maybe-map (reindex-vars''' xs') $ reindex-vars ρ is $ just xs) $ reindex-vars' ρ is x
reindex-vars ρ is nothing = nothing
reindex-arg ρ is (TermArg me t) = TermArg me (reindex-term ρ is t)
reindex-arg ρ is (TypeArg T) = TypeArg (reindex-type ρ is T)
reindex-args ρ is ArgsNil = ArgsNil
reindex-args ρ is (ArgsCons a as) = ArgsCons (reindex-arg ρ is a) (reindex-args ρ is as)
reindex-defTermOrType ρ is (DefTerm pi x oT t) =
let x' = reindex-fresh-var ρ is x in
DefTerm pi x' (reindex-optType ρ is oT) (reindex-term ρ is t) , renamectxt-insert ρ x x'
reindex-defTermOrType ρ is (DefType pi x k T) =
let x' = reindex-fresh-var ρ is x in
DefType pi x' (reindex-kind ρ is k) (reindex-type ρ is T) , renamectxt-insert ρ x x'
reindex-cmds : renamectxt → trie indices → cmds → cmds × renamectxt
reindex-cmds ρ is CmdsStart = CmdsStart , ρ
reindex-cmds ρ is (CmdsNext (ImportCmd i) cs) =
elim-pair (reindex-cmds ρ is cs) $ _,_ ∘ CmdsNext (ImportCmd i)
reindex-cmds ρ is (CmdsNext (DefTermOrType op d pi) cs) =
elim-pair (reindex-defTermOrType ρ is d) λ d' ρ' →
elim-pair (reindex-cmds ρ' is cs) $ _,_ ∘ CmdsNext (DefTermOrType op d' pi)
reindex-cmds ρ is (CmdsNext (DefKind pi x ps k pi') cs) =
let x' = reindex-fresh-var ρ is x in
elim-pair (reindex-cmds (renamectxt-insert ρ x x') is cs) $ _,_ ∘ CmdsNext
(DefKind pi x' ps (reindex-kind ρ is k) pi')
reindex-cmds ρ is (CmdsNext (DefDatatype dt pi) cs) =
reindex-cmds ρ is cs -- Templates can't use datatypes!
reindex-file : ctxt → indices → start → cmds × renamectxt
reindex-file Γ is (File pi csᵢ pi' pi'' x ps cs pi''') =
reindex-cmds empty-renamectxt empty-trie cs
where open reindexing Γ is
mk-ctr-term : maybeErased → (x X : var) → constructors → parameters → term
mk-ctr-term me x X cs ps =
let t = Mlam X $ constructors-to-lams' cs $ parameters-to-apps ps $ mvar x in
case me of λ where
Erased → Beta posinfo-gen NoTerm $ SomeTerm t posinfo-gen
NotErased → IotaPair posinfo-gen (Beta posinfo-gen NoTerm $ SomeTerm t posinfo-gen)
t NoGuide posinfo-gen
mk-ctr-type : maybeErased → ctxt → ctr → constructors → var → type
mk-ctr-type me Γ (Ctr x T) cs Tₕ with decompose-ctr-type (ctxt-var-decl Tₕ Γ) T
...| Tₓ , ps , is =
parameters-to-alls ps $
TpAppt (curry recompose-tpapps (mtpvar Tₕ) is) $
rename "X" from add-parameters-to-ctxt ps (ctxt-var-decl Tₕ Γ) for λ X →
mk-ctr-term me x X cs ps
record encoded-datatype-names : Set where
constructor mk-encoded-datatype-names
field
data-functor : var
data-fmap : var
data-functor-ind : var
cast : var
fixpoint-type : var
fixpoint-in : var
fixpoint-ind : var
record elab-mus : Set where
field
elab-check-mu : var → type → maybe term
elab-synth-mu : var → maybe (term × type)
elab-check-mu' : type → maybe term
elab-synth-mu' : maybe (term × type)
record encoded-datatype : Set where
constructor mk-encoded-datatype
field
data-def : datatype
names : encoded-datatype-names
elab-mu : datatype → encoded-datatype-names → ctxt → term → optType → cases → elab-mus
elab-check-mu = λ Γ t oT ms → elab-mus.elab-check-mu $ elab-mu data-def names Γ t oT ms
elab-synth-mu = λ Γ t oT ms → elab-mus.elab-synth-mu $ elab-mu data-def names Γ t oT ms
elab-check-mu' = λ Γ t oT ms → elab-mus.elab-check-mu' $ elab-mu data-def names Γ t oT ms
elab-synth-mu' = λ Γ t oT ms → elab-mus.elab-synth-mu' $ elab-mu data-def names Γ t oT ms
record datatype-encoding : Set where
constructor mk-datatype-encoding
field
template : start
functor : var
cast : var
fixpoint-type : var
fixpoint-in : var
fixpoint-ind : var
elab-mu : datatype → encoded-datatype-names → ctxt → term → optType → cases → elab-mus
mk-defs : ctxt → datatype → cmds × encoded-datatype
mk-defs Γ'' (Data x ps is cs) =
append-cmds tcs
(csn functor-cmd $
csn functor-ind-cmd $
csn fmap-cmd $
csn type-cmd $
foldr (csn ∘ ctr-cmd) CmdsStart cs) ,
record {
elab-mu = elab-mu;
data-def = Data x ps is cs;
names = record {
data-functor = data-functorₓ;
data-fmap = data-fmapₓ;
data-functor-ind = data-functor-indₓ;
cast = castₓ;
fixpoint-type = fixpoint-typeₓ;
fixpoint-in = fixpoint-inₓ;
fixpoint-ind = fixpoint-indₓ}}
where
csn = CmdsNext ∘ flip (DefTermOrType OpacTrans) posinfo-gen
k = indices-to-kind is $ Star posinfo-gen
Γ' = add-parameters-to-ctxt ps $ add-constructors-to-ctxt cs $ ctxt-var-decl x Γ''
tcs-ρ = reindex-file Γ' is template
tcs = fst tcs-ρ
ρ = snd tcs-ρ
data-functorₓ = fresh-var (x ^ "F") (ctxt-binds-var Γ') ρ
data-fmapₓ = fresh-var (x ^ "Fmap") (ctxt-binds-var Γ') ρ
data-functor-indₓ = fresh-var (x ^ "IndF") (ctxt-binds-var Γ') ρ
functorₓ = renamectxt-rep ρ functor
castₓ = renamectxt-rep ρ cast
fixpoint-typeₓ = renamectxt-rep ρ fixpoint-type
fixpoint-inₓ = renamectxt-rep ρ fixpoint-in
fixpoint-indₓ = renamectxt-rep ρ fixpoint-ind
Γ = add-indices-to-ctxt is $ ctxt-var-decl data-functorₓ $ ctxt-var-decl data-fmapₓ $ ctxt-var-decl data-functor-indₓ Γ'
new-var : ∀ {ℓ} {X : Set ℓ} → var → (var → X) → X
new-var x f = f $ fresh-var x (ctxt-binds-var Γ) ρ
functor-cmd = DefType posinfo-gen data-functorₓ (parameters-to-kind ps $ KndArrow k k) $
parameters-to-tplams ps $
TpLambda posinfo-gen posinfo-gen x (Tkk $ k) $
indices-to-tplams is $
new-var "x" λ xₓ → new-var "X" λ Xₓ →
Iota posinfo-gen posinfo-gen xₓ (mtpeq id-term id-term) $
Abs posinfo-gen Erased posinfo-gen Xₓ
(Tkk $ indices-to-kind is $ KndTpArrow (mtpeq id-term id-term) star) $
foldr (λ c → flip TpArrow NotErased $ mk-ctr-type Erased Γ c cs Xₓ)
(TpAppt (indices-to-tpapps is $ mtpvar Xₓ) (mvar xₓ)) cs
functor-ind-cmd = DefTerm posinfo-gen data-functor-indₓ NoType $
parameters-to-lams ps $
Lam posinfo-gen Erased posinfo-gen x (SomeClass $ Tkk k) $
indices-to-lams is $
new-var "x" λ xₓ → new-var "y" λ yₓ → new-var "e" λ eₓ → new-var "X" λ Xₓ →
let T = indices-to-tpapps is $ TpApp (parameters-to-tpapps ps $ mtpvar data-functorₓ) (mtpvar x) in
Lam posinfo-gen NotErased posinfo-gen xₓ (SomeClass $ Tkt T) $
Lam posinfo-gen Erased posinfo-gen Xₓ
(SomeClass $ Tkk $ indices-to-kind is $ KndTpArrow T star) $
flip (foldr λ {c @ (Ctr x' _) → Lam posinfo-gen NotErased posinfo-gen x' $ SomeClass $
Tkt $ mk-ctr-type NotErased Γ c cs Xₓ}) cs $
flip mappe (Beta posinfo-gen NoTerm NoTerm) $
flip mappe (mvar xₓ) $
let Γ' = ctxt-var-decl xₓ $ ctxt-var-decl yₓ $ ctxt-var-decl eₓ $ ctxt-var-decl Xₓ Γ in
flip (foldl λ {(Ctr x' T) → flip mapp $
elim-pair (decompose-arrows Γ T) λ ps' Tₕ →
parameters-to-lams' ps' $
Mlam yₓ $ Mlam eₓ $
parameters-to-apps ps' $ mvar x'}) cs $
AppTp (IotaProj (mvar xₓ) "2" posinfo-gen) $
indices-to-tplams is $
TpLambda posinfo-gen posinfo-gen xₓ (Tkt $ mtpeq id-term id-term) $
Abs posinfo-gen Erased posinfo-gen yₓ (Tkt T) $
Abs posinfo-gen Erased posinfo-gen eₓ (Tkt $ mtpeq (mvar yₓ) (mvar xₓ)) $
TpAppt (indices-to-tpapps is $ mtpvar Xₓ) $
Phi posinfo-gen (mvar eₓ) (mvar yₓ) (mvar xₓ) posinfo-gen
fmap-cmd : defTermOrType
fmap-cmd with new-var "A" id | new-var "B" id | new-var "c" id
...| Aₓ | Bₓ | cₓ = DefTerm posinfo-gen data-fmapₓ (SomeType $
parameters-to-alls ps $
TpApp (mtpvar functorₓ) $
parameters-to-tpapps ps $
mtpvar data-functorₓ) $
parameters-to-lams ps $
Mlam Aₓ $ Mlam Bₓ $ Mlam cₓ $
IotaPair posinfo-gen
(indices-to-lams is $
new-var "x" λ xₓ → mlam xₓ $
IotaPair posinfo-gen (IotaProj (mvar xₓ) "1" posinfo-gen)
(new-var "X" λ Xₓ → Mlam Xₓ $
constructors-to-lams' cs $
foldl
(flip mapp ∘ eta-expand-fmap)
(AppTp (IotaProj (mvar xₓ) "2" posinfo-gen) $ mtpvar Xₓ) cs)
NoGuide posinfo-gen)
(Beta posinfo-gen NoTerm NoTerm) NoGuide posinfo-gen
where
eta-expand-fmaph-type : ctxt → var → type → term
eta-expand-fmaph-type Γ x' T with decompose-ctr-type Γ T
...| Tₕ , ps , as with add-parameters-to-ctxt ps Γ
...| Γ' =
parameters-to-lams' ps $
flip mapp (parameters-to-apps ps $ mvar x') $
recompose-apps Erased as $
flip mappe (mvar cₓ) $
flip AppTp (mtpvar Bₓ) $
AppTp (mvar castₓ) (mtpvar Aₓ)
eta-expand-fmap : ctr → term
eta-expand-fmap (Ctr x' T) with
ctxt-var-decl Aₓ $ ctxt-var-decl Bₓ $ ctxt-var-decl cₓ Γ
...| Γ' with decompose-ctr-type Γ' T
...| Tₕ , ps , as with foldr (λ {(Decl _ _ _ x'' _ _) → ctxt-var-decl x''}) Γ' ps
...| Γ'' = parameters-to-lams' ps $ foldl
(λ {(Decl pi pi' me x'' (Tkt T) pi'') t → App t me $
if ~ is-free-in tt x T then mvar x'' else eta-expand-fmaph-type Γ'' x'' T;
(Decl pi pi' me x'' (Tkk k) pi'') t → AppTp t $ mtpvar x''})
(mvar x') $ ps
type-cmd = DefType posinfo-gen x (parameters-to-kind ps $ k) $
parameters-to-tplams ps $ TpAppt
(TpApp (mtpvar fixpoint-typeₓ) $ parameters-to-tpapps ps $ mtpvar data-functorₓ)
(parameters-to-apps ps $ mvar data-fmapₓ)
ctr-cmd : ctr → defTermOrType
ctr-cmd (Ctr x' T) with
decompose-ctr-type Γ (subst Γ (parameters-to-tpapps ps $ mtpvar x) x T)
...| Tₕ , ps' , as' = DefTerm posinfo-gen x' NoType $
parameters-to-lams ps $
parameters-to-lams ps' $
mapp (recompose-apps Erased (take (length as' ∸ length ps) as') $
mappe (AppTp (mvar fixpoint-inₓ) $
parameters-to-tpapps ps $ mtpvar data-functorₓ) $
parameters-to-apps ps $ mvar data-fmapₓ) $
rename "X" from add-parameters-to-ctxt ps' Γ for λ Xₓ →
mk-ctr-term NotErased x' Xₓ cs ps'
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.