text stringlengths 1 1.05M |
|---|
; A069129: Centered 16-gonal numbers.
; 1,17,49,97,161,241,337,449,577,721,881,1057,1249,1457,1681,1921,2177,2449,2737,3041,3361,3697,4049,4417,4801,5201,5617,6049,6497,6961,7441,7937,8449,8977,9521,10081,10657,11249,11857,12481,13121,13777,14449,15137,15841,16561,17297,18049,18817,19601,20401,21217,22049,22897,23761,2... |
#include <stdio.h>
#include <stdlib.h>
#include <io/pad.h>
#include <Mini2D/Mini.hpp>
#include <Mini2D/Font.hpp>
#include <Mini2D/Sound.hpp>
#include "comfortaa_regular_ttf.h"
#include "sbfsc_adhdj_mp3.h"
#include "snare_ogg.h"
//
using namespace Mini2D;
// callbacks
int drawUpdate(float deltaTime, unsigned long f... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r8
push %r9
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x18871, %rsi
lea addresses_WC_ht+0x3971, %rdi
nop
nop
and %r8, %r8
mov $34, %rcx
rep movsl
nop
nop
nop
nop
nop
sub %r11, %r11
lea addresses_WC_ht+0xf371, %rsi
lea addresses_WC_... |
; A268147: A double binomial sum involving absolute values.
; 0,16,512,12288,262144,5242880,100663296,1879048192,34359738368,618475290624,10995116277760,193514046488576,3377699720527872,58546795155816448,1008806316530991104,17293822569102704640,295147905179352825856,5017514388048998039552,85002596691653613846528,143559... |
#include <iostream>
#include <queue>
using namespace std;
struct Node{
//This is the structure of the binary tree.
int data;
Node *left;
Node *right;
};
void levelOrderTraversal(Node *root)
{
queue<Node *> q;
q.push(root);
while(!q.empty()){
root = q.front();
... |
; A140099: A Beatty sequence: a(n) = [n*(1+t)], where t = tribonacci constant (A058265); complement of A140098.
; 2,5,8,11,14,17,19,22,25,28,31,34,36,39,42,45,48,51,53,56,59,62,65,68,70,73,76,79,82,85,88,90,93,96,99,102,105,107,110,113,116,119,122,124,127,130,133,136,139,141,144,147,150,153,156,159,161,164,167,170,173,... |
// Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "gpu/command_buffer/service/async_pixel_transfer_manager_sync.h"
#include "gpu/command_buffer/service/async_pixel_transfer_delegate.h"
namespac... |
; A024118: a(n) = 10^n - n^4.
; 1,9,84,919,9744,99375,998704,9997599,99995904,999993439,9999990000,99999985359,999999979264,9999999971439,99999999961584,999999999949375,9999999999934464,99999999999916479,999999999999895024,9999999999999869679,99999999999999840000,999999999999999805519,9999999999999999765744,99999999999... |
/*---------------------------------------------------------------------
DbgString.cpp - Sample to test existence of DBWinMutex.
Software Debugging by Raymond Zhang, All rights reserved.
---------------------------------------------------------------------*/
#include "stdafx.h"
#include <windows.h>
int main(int argc... |
// r_c_shortest_paths.hpp header file
// Copyright Michael Drexl 2005, 2006.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://boost.org/LICENSE_1_0.txt)
#ifndef BOOST_GRAPH_R_C_SHORTEST_PATHS_HPP
#define BOOST_GRAPH_R_C_SHORTEST_PATHS_HPP
#... |
.global s_prepare_buffers
s_prepare_buffers:
push %r13
push %rcx
push %rdi
push %rsi
lea addresses_WC_ht+0x1ced8, %rsi
lea addresses_D_ht+0x13e58, %rdi
nop
nop
xor %r13, %r13
mov $113, %rcx
rep movsq
nop
cmp %rcx, %rcx
pop %rsi
pop %rdi
pop %rcx
pop %r13
ret
.global s_faulty_load
s_faulty_load:
push %r12
push %r13... |
#load exception handler
lc r40, 0x8000002c
leh r40
#enable exceptions
cle
#load junk tlb entry for memory tests
lc r44, 2 #load into TLB entry 2
lc r42, 0x3fffe000 #denotes VPN 0x3ffff
lc r43, 0x3fffe01f #map VPN 0x3fffe to page 0xffffe
#and is readable, wr... |
;
; Otrona Attachè graphics routines
; direct video HW access
;
; Stefano Bodrato 2018
;
;
; XOR pixel at (x,y) coordinate.
;
;
; $Id: w_xorpixl.asm $
;
INCLUDE "graphics/grafix.inc"
SECTION smc_clib
PUBLIC w_xorpixel
EXTERN l_cmp
EXTERN plot_setup
.w_xorpixel
... |
// Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/safe_browsing/chrome_cleaner/settings_resetter_win.h"
#include <memory>
#include "base/bind.h"
#include "base/run_loop.h"
#incl... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r8
push %r9
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x3e77, %rsi
lea addresses_A_ht+0x428d, %rdi
nop
nop
nop
nop
xor %r10, %r10
mov $14, %rcx
rep movsl
nop
nop
and %r9, %r9
lea addresses_WT_ht+0xc07, %r12
nop
nop
nop
nop
sub %r8,... |
#pragma once
enum struct SelectCreatureType
{
SELECT_CREATURE_PREVIOUS = 0,
SELECT_CREATURE_NEXT = 1
};
|
// Copyright (c) 2014-2016 The Dash developers
// Copyright (c) 2016-2017 The PIVX developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "spork.h"
#include "base58.h"
#include "consensus/validation.h"
#include ... |
<?hh
function foo($x, ...$y) {
return $y[$x];
}
|
;------------------------------------------------------------------------------
;
; Copyright (c) 2006 - 2013, Intel Corporation. All rights reserved.<BR>
; This program and the accompanying materials
; are licensed and made available under the terms and conditions of the BSD License
; which accompanies this distr... |
// Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef WIN32
// for posix_fallocate
#ifdef __linux__
#define _POSIX_C_SOURCE 2001... |
; A184113: n + floor(4*sqrt(n+1)).
; 6,8,11,12,14,16,18,20,21,23,24,26,27,29,31,32,33,35,36,38,39,41,42,44,45,46,48,49,50,52,53,54,56,57,59,60,61,62,64,65,66,68,69,70,72,73,74,76,77,78,79,81,82,83,84,86,87,88,89,91,92,93,95,96,97,98,99,101,102,103,104,106,107,108,109,111,112,113,114,116,117,118,119,120,122,123,124,125,... |
SFX_Battle_21_Ch7:
unknownnoise0x20 2, 241, 51
unknownnoise0x20 2, 193, 50
unknownnoise0x20 2, 161, 49
unknownnoise0x20 15, 130, 50
unknownnoise0x20 8, 241, 52
endchannel
|
; A132458: Let df(n,k) = Product_{i=0..k-1} (n-i) be the descending factorial and let P(m,n) = df(n-1,m-1)^2*(2*n-m)/((m-1)!*m!). Sequence gives P(4,n).
; 0,0,0,1,24,200,1000,3675,10976,28224,64800,136125,266200,490776,861224,1449175,2352000,3699200,5659776,8450649,12346200,17689000,24901800,34500851,47110624,63480000,... |
_forktest: file format elf32-i386
Disassembly of section .text:
00000000 <main>:
printf(1, "fork test OK\n");
}
int
main(void)
{
0: 8d 4c 24 04 lea 0x4(%esp),%ecx
4: 83 e4 f0 and $0xfffffff0,%esp
7: ff 71 fc pushl -0x4(%ecx)
a: 55 push... |
//
// Generated by Microsoft (R) HLSL Shader Compiler 9.30.9200.20714
//
//
///
// Buffer Definitions:
//
// cbuffer cbMain
// {
//
// float4x4 g_mWorld; // Offset: 0 Size: 64
// float4x4 g_mView; // Offset: 64 Size: 64 [unused]
// float4x4 g_mProjection; //... |
; A249032: First differences of A075326.
; 3,6,4,5,5,6,4,6,4,6,4,5,5,6,4,5,5,6,4,5,5,6,4,6,4,6,4,5,5,6,4,6,4,6,4,5,5,6,4,6,4,6,4,5,5,6,4,5,5,6,4,5,5,6,4,6,4,6,4,5,5,6,4,5,5,6,4,5,5,6,4,6,4,6,4,5,5,6,4,5,5,6,4,5,5,6,4,6,4,6,4,5,5,6,4,6,4,6,4,5
mov $3,2
mov $5,$0
lpb $3
mov $0,$5
sub $3,1
add $0,$3
trn $0,1
se... |
push ebp
mov ebp,esp
push ecx
call dword ptr ds:[0EBD1BCh]
shl eax,0Ch
or eax,dword ptr [dev]
mov ecx,dword ptr [dev]
and eax,3F000h
and ecx,0FFFC0FFFh
or eax,ecx
mov dword ptr [dev],eax
m... |
; ---------------------------------------------------------------------------
; Object 75 - Eggman (SYZ)
; ---------------------------------------------------------------------------
BossSpringYard:
moveq #0,d0
move.b obRoutine(a0),d0
move.w Obj75_Index(pc,d0.w),d1
jmp Obj75_Index(pc,d1.w)
; ==================... |
; A000537: Sum of first n cubes; or n-th triangular number squared.
; 0,1,9,36,100,225,441,784,1296,2025,3025,4356,6084,8281,11025,14400,18496,23409,29241,36100,44100,53361,64009,76176,90000,105625,123201,142884,164836,189225,216225,246016,278784,314721,354025,396900,443556,494209,549081,608400,672400,741321,815409,894... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r15
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_A_ht+0x81b8, %rsi
lea addresses_D_ht+0x16668, %rdi
clflush (%rdi)
nop
nop
nop
nop
nop
inc %r15
mov $39, %rcx
rep movsq
nop
nop
nop
nop
xor %rsi, %rsi
lea addresses_A_ht+0xd9b8, %r13
nop
nop
n... |
// Copyright (c) 2017-2018 The Bitcoin Core developers
// Copyright (c) 2018-2021 The EMRALS Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <consensus/tx_verify.h>
#include <consensus/consensus.h>
#inc... |
; A134632: 5*n^5 + 3*n^3 - 2*n^2. Coefficients and exponents are the prime numbers in decreasing order.
; 0,6,176,1278,5280,15950,39456,84966,165248,297270,502800,809006,1249056,1862718,2696960,3806550,5254656,7113446,9464688,12400350,16023200,20447406,25799136,32217158,39853440,48873750,59458256,71802126,86116128,1026... |
/*
Copyright Oliver Kowalke 2009.
Copyright Thomas Sailer 2013.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt)
*/
/***********************************************************... |
/*
Copyright 2013-present Barefoot Networks, Inc.
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 w... |
bits 64
%include "hldr64.inc"
;-----------------------------------------------------------------------------
;here begins HLDR64
;-----------------------------------------------------------------------------
hldr64_begin:
push rbx
push rsi
push rdi
push r12
push ... |
; A343607: Minimal number of colors required for an edge-coloring of the complete graph K_n with no monochromatic triangle.
; 0,0,1,2,2,2,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4
lpb $0
mul $0,2
add $0,9
div $0,7
add $1,2
lpe
div $1,2
mov $0,$1
|
Name: mn_hp_sminit.asm
Type: file
Size: 81911
Last-Modified: '1993-08-25T07:34:46Z'
SHA-1: F71FB10549BFE189125C864447523F04A5334B1C
Description: null
|
; A070356: a(n) = 3^n mod 23.
; 1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,... |
%include "defs.asm"
; ----------------------------- MOTHER64.ASM -----------------------------
; Author: Agner Fog
; Date created: 1998
; Last modified: 2013-09-11
; Source URL: www.agner.org/optimize
; Project: asmlib.zip
; Language: assembly, NASM/YASM syntax, 64 bit
; ... |
; A040475: Continued fraction for sqrt(498).
; 22,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6,22,6,3,44,3,6
seq $0,10144 ; Continued fraction for sqrt(59).
seq $0,198265 ; Ceiling(n*sqrt(10))... |
; A093968: Inverse binomial transform of n*Pell(n).
; 0,1,2,6,8,20,24,56,64,144,160,352,384,832,896,1920,2048,4352,4608,9728,10240,21504,22528,47104,49152,102400,106496,221184,229376,475136,491520,1015808,1048576,2162688,2228224,4587520,4718592,9699328,9961472
mov $1,$0
sub $1,2
lpb $1
mul $0,2
trn $1,2
lpe
|
#include "atk/pose.h"
using namespace glm;
namespace atk {
Pose::Pose() {}
Pose::~Pose() {}
Pose::Pose(const glm::vec3& p) : rootPos(p)
{
}
Pose::Pose(const glm::quat& q)
{
jointRots.push_back(q);
}
Pose::Pose(const glm::vec3& pos, const glm::quat& rot) : rootPos(pos)
{
jointRots.push_back(rot);
}
Pose::Pose(... |
// Copyright (c) 2020 Graphcore Ltd. All rights reserved.
//
// 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 app... |
_stressfs: file format elf32-i386
Disassembly of section .text:
00001000 <main>:
#include "fs.h"
#include "fcntl.h"
int
main(int argc, char *argv[])
{
1000: f3 0f 1e fb endbr32
1004: 8d 4c 24 04 lea 0x4(%esp),%ecx
1008: 83 e4 f0 and $0xfffffff0,%esp
int fd,... |
;------------------------------------------------------------------------------
;
; Copyright (c) 2006, Intel Corporation. All rights reserved.<BR>
; This program and the accompanying materials
; are licensed and made available under the terms and conditions of the BSD License
; which accompanies this distribution. Th... |
; Multiplication: d * e
; Result in bc
org 100h
start: mvi d, 05h
mvi e, 05h
call mp88
hlt
mp88: lxi b, 0000h
mvi l, 08h
nxtbit: mov a, d
rar
mov d, a
jnc noadd
mov a, b
add e
mov b, a
noadd: mov a, b
rar
mov b, a
mov a, c
rar
mov c, a
dcr l
jnz nxtbit
ret
|
;
; Print a character at ansi_ROW, ansi_COLUMNUMN
; Enter with char in a
;
; djm 6/6/2000
;
; This ain't pretty..we do far too many calls to oz for my liking..
;
;
; $Id: f_ansi_char.asm,v 1.7 2016/07/02 10:24:35 dom Exp $
;
SECTION code_clib
PUBLIC ansi_CHAR
INCLUDE "stdio.def"
EXTERN ansi_ROW
EXTERN ansi... |
if 0
lua allpass
if 1 then
end
endlua
endif
|
; A110450: a(n) = n*(n+1)*(n^2+n+1)/2.
; 0,3,21,78,210,465,903,1596,2628,4095,6105,8778,12246,16653,22155,28920,37128,46971,58653,72390,88410,106953,128271,152628,180300,211575,246753,286146,330078,378885,432915,492528,558096,630003,708645,794430,887778,989121,1098903,1217580,1345620,1483503,1631721,1790778,1961190,214... |
; A190055: a(n) = n + [n*r/t] + [n*s/t]; r=2, s=sin(Pi/3), t=csc(Pi/3).
; 2,6,10,13,16,20,24,27,30,34,38,41,44,48,51,55,58,62,65,69,72,76,79,83,86,90,93,97,100,103,107,111,114,117,121,125,128,131,135,139,142,145,149,153,155,159,163,167,169,173,177,181,183,187,191,194,197,201,205,208,211,215,219,222,225,229,233,236,239... |
;
; ZX Spectrum specific routines
; by Stefano Bodrato, 22/06/2006
;
; int zx_issue3();
;
; The result is:
; - 0 (false) if the spectrum is issue 1 or 2.
; - 1 (true) if the spectrum is an "issue 3" or more
;
; $Id: zx_issue3.asm,v 1.3 2006/06/28 22:21:26 stefano Exp $
;
XLIB zx_issue3
zx_issue3:
l... |
; assembler http://skilldrick.github.io/easy6502
; 0 - black
; 1 - white
LDA #$01 ; load color
LDX #$02 ; load display base address
; loop to fill screen
loop_external:
STX $01
loop_internal:
STA ($00), Y
INY
CPY #$00
BNE loop_internal
INX
CPX #$06
BNE loop_external
BRK
|
#include <TMB.hpp>
#include <iostream>
#define see(object) std::cout << #object ":\n" << object << "\n";
template<class Type>
Type dbetabinom(Type x, Type n, Type p, Type phi, int do_log)
{
Type ll = lgamma(n + 1.0) - lgamma(x + 1.0) - lgamma(n - x + 1.0) +
lgamma(x + p*phi) + lgamma(n - x +(1-p)*phi) - lgamma... |
TITLE Segment Example (main module, Seg2.asm)
EXTRN var2:WORD, subroutine_1:PROC
cseg SEGMENT BYTE PUBLIC 'CODE'
ASSUME cs:cseg,ds:dseg, ss:sseg
main PROC
mov ax,dseg ; initialize DS
mov ds,ax
mov ax,var1 ; local variable
mov bx,var2 ; external variable
call s... |
// bfs + stack
#include <vector>
#include <stack>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> r... |
; DO NOT MODIFY THIS FILE DIRECTLY!
; author: @TinySecEx
; shadowssdt asm stub for 10.0.16299-sp0-windows-10-rs3-1709 amd64
option casemap:none
option prologue:none
option epilogue:none
.code
; ULONG64 __stdcall NtUserGetOwnerTransformedMonitorRect( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 , ... |
/* boost random/geometric_distribution.hpp header file
*
* Copyright Jens Maurer 2000-2001
* Copyright Steven Watanabe 2011
* Distributed under the Boost Software License, Version 1.0. (See
* accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
* See http://www.boost.org for mo... |
; ************************************************************************************************************
; ************************************************************************************************************
;
; Maze Creator
;
; Uses RB,RC,RD,RF.
; **********************************************... |
; A038715: a(n) = floor(n/4)*ceiling((n+2)/4).
; 0,0,0,0,2,2,2,3,6,6,6,8,12,12,12,15,20,20,20,24,30,30,30,35,42,42,42,48,56,56,56,63,72,72,72,80,90,90,90,99,110,110,110,120,132,132,132,143,156,156,156,168,182,182,182,195,210,210,210,224,240
mov $1,5
add $1,$0
div $1,4
mov $2,$0
div $2,4
mul $1,$2
|
; A275937: The number of distinct patterns of the smallest number of unit squares required to enclose n units of area, where corner contact is allowed.
; 1,1,2,1,3,1,1,4,2,4,1
mov $2,5
lpb $0
mov $1,$0
dif $0,2
add $2,1
mod $1,$2
sub $0,$1
lpe
div $0,2
add $0,1
|
#include <hxcpp.h>
#ifndef INCLUDED_lime_graphics_opengl_ext_OES_mapbuffer
#include <lime/graphics/opengl/ext/OES_mapbuffer.h>
#endif
HX_DEFINE_STACK_FRAME(_hx_pos_c25d4af8f239f11a_4_new,"lime.graphics.opengl.ext.OES_mapbuffer","new",0x321fb62a,"lime.graphics.opengl.ext.OES_mapbuffer.new","lime/graphics/opengl/ext/OE... |
GLOBAL load_idt
GLOBAL isr1
extern _idt
idt_desc:
dw 4095
dq _idt
%macro PUSHALL 0
push dx
push ax
push cx
push di
push si
push r15
push r14
push r13
push r12
push r11
push r10
push r9
push r8
%endmacro
%macro POPALL 0
pop r8
pop r9
pop r10
pop r11
pop r12
pop r13
pop r14
pop r15
pop si
pop di
pop cx
pop ax
pop dx
%... |
/******************************************************************************
*
* Copyright (C) 2006, The Gentee Group. All rights reserved.
* This file is part of the Gentee open source project <http://www.gentee.com>.
*
* THIS FILE IS PROVIDED UNDER THE TERMS OF THE GENTEE LICENSE ("AGREEMENT").
* ANY USE, REPR... |
; A082562: a(n) = number of values of m such that m can be expressed as the sum of distinct odd numbers with largest odd number in the sum = 2n+1.
; 1,2,4,8,15,24,35,48,63,80,99,120,143,168,195,224,255,288,323,360,399,440,483,528,575,624,675,728,783,840,899,960,1023,1088,1155,1224,1295,1368,1443,1520,1599,1680,1763,184... |
; ----------------
; Phantoon hijacks
; ----------------
{
; Intro
if !FEATURE_PAL
org $A7D4DD
else
org $A7D4A9
endif
JSL hook_phantoon_init
NOP
BNE $3D
; 1st pattern
if !FEATURE_PAL
org $A7D5DA
else
org $A7D5A6
endif
JSL hook_phantoon_1st_rng
BRA $10
; 2nd pattern
if !FEATURE_PAL
org ... |
/*
* Copyright (c) 2017, Intel Corporation
*
* 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, publi... |
.size 8000
.text@48
ei
jp lstatint
.text@100
jp lbegin
.data@143
80
.text@150
lbegin:
ld c, 44
ld b, 90
lbegin_waitvblank:
ldff a, (c)
cmp a, b
jrnz lbegin_waitvblank
xor a, a
ldff(40), a
ld hl, 9f00
ld b, 20
lbegin_clearvram:
dec l
ld(hl), a
jrnz lbegin_clearvram
dec h
dec b
jrnz lbegin_clearvra... |
def main(a0:i8, a1:i8, a2:i8, b0:i8, b1:i8, b2:i8, c:i8, en:bool) -> (y:i8) {
y:i8 = dmuladdrega_i8i8(a2, b2, t11, en, en, en, en) @dsp(??, ??);
t11:i8 = dmuladdrega_i8i8(a1, b1, t5, en, en, en, en) @dsp(??, ??);
t5:i8 = dmuladdrega_i8i8(a0, b0, c, en, en, en, en) @dsp(??, ??);
} |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r9
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WT_ht+0x1991a, %r9
nop
nop
inc %r11
movw $0x6162, (%r9)
nop
nop
nop
nop
nop
xor $7782, %rcx
lea addresses_UC_ht+0xde6e, %rsi
lea addresses_UC_ht+0x180da, %rdi
nop
inc %rdx
mov $69, %... |
; rst vectors
section "rst $00", rom0 [$00]
section "rst $08", rom0 [$08]
section "rst $10", rom0 [$10]
section "rst $18", rom0 [$18]
section "rst $20", rom0 [$20]
section "rst $28", rom0 [$28]
section "rst $30", rom0 [Bankswitch]
jp _Bankswitch
section "rst $38", rom0 [$38]
; Hardware interrupts. None used at the mo... |
; Program 10.5
; SYSENTER - Linux (NASM 32-bit)
; Copyright (c) 2017 Hall & Slonka
section .data
output: DB "Computer Architecture",0Ah
len: EQU ($ - output)
section .text
global _main
_main:
mov ebx, 1
mov ecx, output
mov edx, len
mov eax, 4
push sysenter_ret
push ecx
push edx
push ebp
mov ... |
// Copyright (C) 2020 Jérôme Leclercq
// This file is part of the "Burgwar" project
// For conditions of distribution and use, see copyright notice in LICENSE
#include <ClientLib/Scripting/ClientScriptingLibrary.hpp>
#include <CoreLib/Utils.hpp>
#include <CoreLib/Components/EntityOwnerComponent.hpp>
#include <CoreLib/... |
; A036246: CONTINUANT transform of squares 1, 4, 9, ...
; Submitted by Jon Maiga
; 1,5,46,741,18571,669297,32814124,2100773233,170195445997,17021645372933,2059789285570890,296626678767581093,50131968501006775607,9826162452876095600065,2210936683865622516790232,566009617232052240393899457,163578990316746963096353733305,... |
;
; Copyright (c) 2010 The WebM project authors. All Rights Reserved.
;
; Use of this source code is governed by a BSD-style license
; that can be found in the LICENSE file in the root of the source
; tree. An additional intellectual property rights grant can be found
; in the file PATENTS. All contributing proje... |
; A070821: Integer part of n/(lpf(n)*gpf(n)), where lpf = A020639 is the least prime factor and gpf = A006530 the greatest prime factor.
; Submitted by Jamie Morken(s1)
; 1,0,0,1,0,1,0,2,1,1,0,2,0,1,1,4,0,3,0,2,1,1,0,4,1,1,3,2,0,3,0,8,1,1,1,6,0,1,1,4,0,3,0,2,3,1,0,8,1,5,1,2,0,9,1,4,1,1,0,6,0,1,3,16,1,3,0,2,1,5,0,12,0,1... |
; uint16_t esx_f_read(unsigned char handle, void *dst, size_t nbytes)
SECTION code_esxdos
PUBLIC esx_f_read
EXTERN asm_esx_f_read
esx_f_read:
pop af
pop bc
pop hl
pop de
push de
push hl
push bc
push af
ld a,e
jp asm_esx_f_read
|
// -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2019, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2019, Knut Reinert & MPI für molekulare Genetik
// This file may be used, modified and/or redistributed under the terms of th... |
; Generated by PSoC Designer 5.2.2401
;
;@Id: boot.tpl#903 @
;=============================================================================
; FILENAME: boot.asm
; Version: 1.30
;
; DESCRIPTION:
; M8C Boot Code for CY8C28xxx microcontroller devices.
;
; Copyright (c) Cypress Semiconductor 2011. All Rights Res... |
; A301787: Number of nX5 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
; 8,14,25,45,82,150,275,505,928,1706,3137,5769,10610,19514,35891,66013,121416,223318,410745,755477,1389538,2555758,4700771,8646065,15902592,29249426,53798081,98950097,1... |
.ASSUME ADL=1
#include "src/inc/vm83plus.inc" ;For VM.
.ORG rom1_base_adr
#include "src/sub/r1_init.asm" ;System memory initialization
#include "src/sub/r1_err.asm" ;Error handler
#include "src/sub/r1_kbd.asm" ;keyboard routines
#include "src/sub/r1_text.asm" ;Text rendering routines
;-----------... |
/*
* Copyright 2019 akashche at redhat.com
*
* 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 agr... |
; A047438: Numbers that are congruent to {1, 5, 6} mod 8.
; 1,5,6,9,13,14,17,21,22,25,29,30,33,37,38,41,45,46,49,53,54,57,61,62,65,69,70,73,77,78,81,85,86,89,93,94,97,101,102,105,109,110,113,117,118,121,125,126,129,133,134,137,141,142,145,149,150,153,157,158
mov $2,$0
sub $0,1
mul $0,2
mul $2,8
sub $2,2
gcd $0,$2
add ... |
; A132122: a(n) = n * (n+1)^2 * (3*n^2 + 4*n + 2) / 12.
; 0,3,33,164,550,1455,3283,6608,12204,21075,34485,53988,81458,119119,169575,235840,321368,430083,566409,735300,942270,1193423,1495483,1855824,2282500,2784275,3370653,4051908,4839114,5744175,6779855
mov $3,$0
mov $4,$0
lpb $0
sub $0,1
add $1,4
mov $2,$3
ad... |
//------------------------------------------------------------------------------
//
// Copyright (c) 2016, Linaro Limited. All rights reserved.
//
// This program and the accompanying materials
// are licensed and made available under the terms and conditions of the BSD License
// which accompanies this distribut... |
load 30,a
load 50,b
add b
out
halt
|
; CRT0 stub for the Jupiter ACE
;
; Stefano Bodrato - Feb 2001
;
; $Id: ace_crt0.asm,v 1.26 2016-07-15 21:03:25 dom Exp $
;
MODULE ace_crt0
;
; Initially include the zcc_opt.def file to find out lots of lovely
; information about what we should do..
;
defc crt0 = 1
... |
li $zero, 100
add $zero, $zero, -1000
li $at, 0xffff
lui $at, 0xffff
move $a0, $at
move $a1, $at
move $a2, $at
move $a3, $at
add $a0, $a0, $a0
addu $a1, $a1, $a1
addi $a2, $a2, 233
addiu $a2, $a2, 233
li $t0, 100
lui $t0, 233
li $t1, 233
lui $t1, 0xffff
or $t2, $t0, $t1
ori $t3, $t0, 0xfffe
and $t4, $t0, $t1
andi $t5, ... |
; getk() for use in ROMS, historical name
SECTION code_clib
PUBLIC getk
PUBLIC _getk
EXTERN getk_inkey
defc getk = getk_inkey
defc _getk = getk
|
; Test case:
EXTERNAL: equ #0000
org #4000
ld a,(value)
cp 1 ; should be optimized to "dec a"
ld b,1 ; should be optimized
call z,function1
ld a,2
ld (value),a
ld b,3 ; since we don't know what "EXTERNAL" does, we cannot optimize this
call EXTERNAL
end:
jp end
function1:
ld a,1 ; should be NOT o... |
/***************************************************************************
*
* 25.replace.cpp - test exercising 25.2.4 [lib.alg.replace]
*
* $Id$
*
***************************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor... |
; A052774: a(n) = (4*n+1)^(n-1).
; 1,1,9,169,4913,194481,9765625,594823321,42618442977,3512479453921,327381934393961,34050628916015625,3909821048582988049,491258904256726154641,67046038752496061076057,9876832533361318095112441,1562069488955406402587890625,263988769565513973843201106881,47477585226700098686074966922953,... |
lui $1,11573
ori $1,$1,35041
lui $2,12864
ori $2,$2,52999
lui $3,19314
ori $3,$3,14237
lui $4,58223
ori $4,$4,4903
lui $5,32087
ori $5,$5,58988
lui $6,27797
ori $6,$6,23831
mthi $1
mtlo $2
sec0:
nop
nop
nop
subu $0,$6,$6
sec1:
nop
nop
subu $6,$0,$3
subu $2,$6,$6
sec2:
nop
nop
xori $6,$6,39443
subu $5,$6,$6
... |
/*
* Copyright 2013 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "include/effects/SkPerlinNoiseShader.h"
#include "include/core/SkColorFilter.h"
#include "include/core/SkShader.h"
#include "include/core/SkString.h"
#include "inclu... |
#include <string>
#include <vector>
#include <iostream>
#include <exception>
#include <cassert>
#include "propertyfileext.hpp"
using namespace std;
int main(void){
cerr << "Testing: PropertyFileExt" << endl;
cerr << "Testing: constructor" << endl;
{
PropertyFileExt propFileExt1("*");
PropertyFileExt p... |
/*
* Copyright 2011 Nikhil Marathe <nsm.nikhil@gmail.com>
*
* 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,... |
# Calculates the factorial of a N integer number
#####Important Registers#####
#$s0: Number (N)
#$s1: Result
main: li $s0, 6 # Loads N = 6
move $a0, $s0 # Sets N as parameter
jal factorial # factorial (N)
move $s1, $v0 # Copy the result to $s1
j exit
factorial:
subi $sp, $sp, 8 ... |
;
; Sharp OZ family functions
;
; ported from the OZ-7xx SDK by by Alexander R. Pruss
; by Stefano Bodrato - Oct. 2003
;
; Serial libraries
;
;
; ------
; $Id: ozserintoff.asm,v 1.3 2015/01/19 01:33:04 pauloscustodio Exp $
;
PUBLIC ozserintoff
EXTERN ozcustomisr
EXTERN serial_hook
EXTERN rxxoff_hook
EXTERN ozin... |
; /*****************************************************************************
; * ugBASIC - an isomorphic BASIC language compiler for retrocomputers *
; *****************************************************************************
; * Copyright 2021-2022 Marco Spedaletti (asimov@mclink.it)
; *
; * Licens... |
; A317952: Trajectory of 1 under repeated application of the morphism 1->121, 2->232, 3->343, 4->414.
; 1,2,1,2,3,2,1,2,1,2,3,2,3,4,3,2,3,2,1,2,1,2,3,2,1,2,1,2,3,2,3,4,3,2,3,2,3,4,3,4,1,4,3,4,3,2,3,2,3,4,3,2,3,2,1,2,1,2,3,2,1,2,1,2,3,2,3,4,3,2,3,2,1,2,1,2,3,2,1,2,1,2,3,2,3,4,3,2,3,2,3,4,3,4,1,4,3,4,3,2
seq $0,62756 ; ... |
; A270006: Number of active (ON,black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 5", based on the 5-celled von Neumann neighborhood.
; 1,8,0,49,0,121,0,225,0,361,0,529,0,729,0,961,0,1225,0,1521,0,1849,0,2209,0,2601,0,3025,0,3481,0,3969,0,4489,0,5041,0,5625,0,6241,0,6889,0,7569... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.