text stringlengths 1 1.05M |
|---|
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r8
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x5a79, %rsi
lea addresses_D_ht+0x1b54d, %rdi
nop
nop
inc %r8
mov $20, %rcx
rep movsw
nop
nop
nop
nop
nop
sub %rbp, %rbp
lea addresses_WC_ht+0x1f99, %rsi
lea addresses_UC_ht+0x9... |
/**
* Created by Martin on 12.11.2020.
* me@martinforejt.cz
*
* Author: Martin Forejt
*/
#include "break.h"
#include "codegen.h"
namespace mlang {
llvm::Value *Break::codeGen(CodeGenContext &context) {
llvm::BasicBlock *exitBB = context.getExitBlockFromCurrent();
if (exitBB == nullptr) {
... |
; A101687: a(n) = Sum_{k=1..n} floor(binomial(n,k)/k).
; Submitted by Christian Krause
; 0,1,2,4,8,14,23,41,73,131,232,418,758,1388,2558,4742,8837,16547,31111,58705,111133,210996,401645,766367,1465416,2807595,5388705,10359733,19946714,38459504,74250895,143524561,277742291,538043338,1043333607,2025040417,3933914770
lpb... |
; -----------------------------------------------------------------------------
; Test for array functions under py65mon.
; Martin Heermance <mheermance@gmail.com>
; -----------------------------------------------------------------------------
.word $8000
.org $8000
.outfile "tests/arrayTest.rom"
.alias RamSize $7E... |
; A280577: a(n) = eulerphi(n) + floor(n/2).
; Submitted by Jamie Morken(s2)
; 1,2,3,4,6,5,9,8,10,9,15,10,18,13,15,16,24,15,27,18,22,21,33,20,32,25,31,26,42,23,45,32,36,33,41,30,54,37,43,36,60,33,63,42,46,45,69,40,66,45,57,50,78,45,67,52,64,57,87,46,90,61,67,64,80,53,99,66,78
mov $2,$0
add $0,1
div $0,2
seq $2,10 ; Eul... |
;//###########################################################################
;//
;// FILE: f28004x_codestartbranch.asm
;//
;// TITLE: Branch for redirecting code execution after boot.
;//
;// For these examples, code_start is the first code that is executed after
;// exiting the boot ROM code.
;//
;// The codestart ... |
/*-
* Copyright (c) 2013 David Chisnall
* All rights reserved.
*
* This software was developed by SRI International and the University of
* Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
* ("CTSRD"), as part of the DARPA CRASH research programme.
*
* Redistribution and use in source ... |
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
(c) Copyright Geoworks 1996 -- All Rights Reserved
GEOWORKS CONFIDENTIAL
PROJECT: PC GEOS
MODULE: Calendar\Main
FILE: mainEventsContent.asm
AUTHOR: Jason Ho, Dec 11, 1996
METHODS:
Name Description
---- ---------... |
.global s_prepare_buffers
s_prepare_buffers:
push %r14
push %r15
push %r9
push %rcx
push %rdi
push %rsi
lea addresses_normal_ht+0x16531, %r9
nop
nop
nop
inc %r14
movups (%r9), %xmm1
vpextrq $0, %xmm1, %rcx
nop
nop
nop
nop
and %rdi, %rdi
lea addresses_UC_ht+0x85d5, %rsi
lea addresses_D_ht+0x169d5, %rdi
inc %r14
mov $118... |
/*
* Copyright 2009-2017 Alibaba Cloud 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... |
object_const_def ; object_event constants
const ROUTE30_YOUNGSTER1
const ROUTE30_YOUNGSTER2
const ROUTE30_YOUNGSTER3
const ROUTE30_YOUNGSTER4
const ROUTE30_MONSTER1
const ROUTE30_MONSTER2
const ROUTE30_FRUIT_TREE1
const ROUTE30_FRUIT_TREE2
const ROUTE30_COOLTRAINER_F
const ROUTE30_POKE_BALL
Route30_MapScrip... |
a db 0
B dw A
c dw b
|
ld a, 248
ld hl, basescradr + #0d54
ld (hl), a
inc h
ld (hl), a
inc h
ld (hl), a
ld (basescradr + #04f0), a
ld (basescradr + #06f1), a
ld (basescradr + #0833), a
ld (basescradr + #09b4), a
ld (basescradr + #0ab4), a
ld (basescradr + #0fd3), a
ld a, 3
ld (basescradr + #05ee), a
ld (basesc... |
; vim: ft=c64jasm
!include "somefile.asm"
!use "a-plugin" as plug
!let var_d = 255 ; decimal
!let var_h = $ff ; hex
!let var_b = %0100 ; binary
!let var_f = 0.5 + .5 + 1e-10 ; floats
* = $800
*= $801
label1:
lda #var_d
lda data,x
lda data, y
lda #-1
lda #+3
lda #002 ; leadi... |
;
; $Id: sdk56700.asm,v 1.8 2012/03/02 14:34:03 yaronm Exp $
;
; This license is set out in https://raw.githubusercontent.com/Broadcom-Network-Switching-Software/OpenBCM/master/Legal/LICENSE file.
;
; Copyright 2007-2020 Broadcom Inc. All rights reserved.
;
;
; This is the default program for the (16 port) BCM56700 S... |
%include "include/u7bg-all-includes.asm"
%include "../u7-common/patch-eop-toggleCombat.asm"
|
; char *_memstrcpy_(void *p, char *s, size_t n)
SECTION code_clib
SECTION code_string
PUBLIC _memstrcpy__callee
EXTERN asm__memstrcpy
_memstrcpy__callee:
pop af
pop bc
pop hl
pop de
push af
jp asm__memstrcpy
; SDCC bridge for Classic
IF __CLASSIC
PUBLIC __memstrcpy__callee
defc __memstrcpy_... |
; A071230: a(n) = n*(6*n^2 - 7*n + 3)/2.
; 0,1,13,54,142,295,531,868,1324,1917,2665,3586,4698,6019,7567,9360,11416,13753,16389,19342,22630,26271,30283,34684,39492,44725,50401,56538,63154,70267,77895,86056,94768,104049,113917,124390,135486,147223,159619,172692,186460,200941,216153,232114,248842,266355,284671,303808,3237... |
/* **********************************************************
* Copyright (c) 2018-2020 Ratel Authors. All rights reserved.
* Copyright (c) 2011-2017 Google, Inc. All rights reserved.
* Copyright (c) 2001-2010 VMware, Inc. All rights reserved.
* ********************************************************** */
/*
... |
; ===============================================================
; aralbrec - Nov 2013
; ===============================================================
SECTION code_font_fzx
PUBLIC __fzx_char_struct
__fzx_char_struct:
; enter : a = char
; hl = struct fzx_font *
;
; exit : hl = struct fzx_ch... |
// (C) Copyright Edward Diener 2011,2012,2013
// Use, modification and distribution are subject to 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).
#if !defined(BOOST_TTI_HAS_MEMBER_DATA_HPP)
#define BOOST_TTI_HAS_MEMBER... |
; Test case for device emulation and phase/dephase
org #4000
dw #0102
__sjasmplus_phase_pre_1: org #4010
__sjasmplus_phase_post_1:
dw #0304
__sjasmplus_dephase_1: org __sjasmplus_phase_pre_1 + (__sjasmplus_dephase_1 - __sjasmplus_phase_post_1)
org #4020
dw #0506
org #4030
dw 772 ; this shoul... |
; A260316: n/3 if 3 divides n, else n-1.
; 0,0,1,1,3,4,2,6,7,3,9,10,4,12,13,5,15,16,6,18,19,7,21,22,8,24,25,9,27,28,10,30,31,11,33,34,12,36,37,13,39,40,14,42,43,15,45,46,16,48,49,17,51,52,18,54,55,19,57,58,20,60,61,21,63,64,22,66,67,23,69,70,24,72,73,25,75,76,26,78,79,27,81,82,28,84,85,29,87,88,30,90,91,31,93,94,32,96,... |
; A048728: Differences between A008585 (multiples of 3) and A048724.
; 0,0,0,4,0,0,8,12,0,0,0,4,16,16,24,28,0,0,0,4,0,0,8,12,32,32,32,36,48,48,56,60,0,0,0,4,0,0,8,12,0,0,0,4,16,16,24,28,64,64,64,68,64,64,72,76,96,96,96,100,112,112,120,124,0,0,0,4,0,0,8,12,0,0,0,4,16,16,24,28,0,0,0,4,0,0,8,12,32,32,32,36,48,48,56,60,128... |
; A005429: Apéry numbers: n^3*C(2n,n).
; 0,2,48,540,4480,31500,199584,1177176,6589440,35443980,184756000,938929992,4672781568,22850118200,110079950400,523521630000,2462025277440,11465007358860,52926189069600,242433164404200,1102772230560000,4984806175188840,22404445765690560,100176151662709200,445790873315174400,197516... |
; int vprintf(const char *format, void *arg)
INCLUDE "clib_cfg.asm"
SECTION code_stdio
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
IF __CLIB_OPT_MULTITHREAD & $02
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
PUBLIC vprintf_callee
EXTERN asm_vprintf
vprintf_callee:
pop af
pop bc
pop de
push af
jp asm_vprintf
;;;;;;;;... |
; A138986: a(n) = Frobenius number for 6 successive numbers = F(n+1,n+2,n+3,n+4,n+5,n+6).
; 1,2,3,4,5,13,15,17,19,21,35,38,41,44,47,67,71,75,79,83,109,114,119,124,129,161,167,173,179,185,223,230,237,244,251,295,303,311,319,327,377,386,395,404,413,469,479,489,499,509,571,582,593,604,615,683,695,707
mov $1,$0
div $1,5
a... |
; A204093: Numbers whose set of base 10 digits is {0,6}.
; 0,6,60,66,600,606,660,666,6000,6006,6060,6066,6600,6606,6660,6666,60000,60006,60060,60066,60600,60606,60660,60666,66000,66006,66060,66066,66600,66606,66660,66666,600000,600006,600060,600066,600600,600606,600660,600666,606000,606006,606060,606066,606600,606606,6... |
object_const_def ; object_event constants
const LAKEOFRAGEHIDDENPOWERHOUSE_FISHER
LakeOfRageHiddenPowerHouse_MapScripts:
db 0 ; scene scripts
db 0 ; callbacks
HiddenPowerGuy:
faceplayer
opentext
checkevent EVENT_GOT_TM10_HIDDEN_POWER
iftrue .AlreadyGotItem
writetext HiddenPowerGuyText1
buttonsound
verbose... |
SSZ_Header:
sHeaderInit ; Z80 offset is $E642
sHeaderPatch SSZ_Patches
sHeaderCh $06, $03
sHeaderTempo $01, $15
sHeaderDAC SSZ_DAC
sHeaderFM SSZ_FM1, $0C, $12
sHeaderFM SSZ_FM2, $18, $17
sHeaderFM SSZ_FM3, $0C, $12
sHeaderFM SSZ_FM4, $00, $14
sHeaderFM SSZ_FM5, $00, $14
sHeaderPSG SSZ_PSG1, $00, $06, $0... |
%define BE(a) ( ((((a)>>24)&0xFF) << 0) + ((((a)>>16)&0xFF) << 8) + ((((a)>>8)&0xFF) << 16) + ((((a)>>0)&0xFF) << 24))
ftyp_start:
dd BE(ftyp_end - ftyp_start)
dd "ftyp"
db 0x68, 0x65, 0x69, 0x63 ; "major_brand(32)" ('heic')
db 0x00, 0x00, 0x00, 0x00 ; "minor_version(32)"
db 0x6D, 0x69, 0x66, 0x... |
; A186382: Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f(i)=4i and g(j)=j(j+1)/2 (triangular number). Complement of A186381.
; 1,2,4,6,8,11,13,16,20,23,27,31,35,40,44,49,55,60,66,72,78,85,91,98,106,113,121,129,137,146,154,163,173,182,192,202,212,223,233,244,256,267,279,... |
; A185170: a(n) = floor( (2*n^2 - 6*n + 9) / 5).
; 1,1,1,1,3,5,9,13,17,23,29,37,45,53,63,73,85,97,109,123,137,153,169,185,203,221,241,261,281,303,325,349,373,397,423,449,477,505,533,563,593,625,657,689,723,757,793,829,865,903,941,981,1021,1061,1103,1145,1189,1233,1277,1323,1369,1417,1465,1513,1563,1613,1665,1717,1769,1... |
; Program 10.2
; Debug and System Write Interrupts - NASM (32-bit)
; Copyright (c) 2017 Hall & Slonka
section .data
output: DB "Computer Architecture",0Ah
len: EQU ($ - output)
section .text
global _main
_main: ; Print "Computer Architecture"
;int 3h ; Set breakpoint (remove if desired)
mov ebx, 1 ... |
; A011960: Number of ferrites M_2Y_n that repeat after 6n+10 layers.
; 0,1,1,1,1,2,1,2,2,2,2,3,2,3,3,3,3,4,3,4
mov $1,$0
add $0,1
div $0,2
div $1,3
sub $0,$1
|
__ymm@2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a2a DB '*'
DB '*******************************'
__ymm@0000002a0000002a0000002a0000002a0000002a0000002a0000002a0000002a DB '*'
DB 00H, 00H, 00H, '*', 00H, 00H, 00H, '*', 00H, 00H, 00H, '*', 00H
DB 00H, 00H, '*', 00H... |
////////////////////////////////////////////////////////////////////////////
//
// Copyright 2015 Realm 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/li... |
; A110451: a(n) = n*(4*n^2 + 2*n + 1).
; 0,7,42,129,292,555,942,1477,2184,3087,4210,5577,7212,9139,11382,13965,16912,20247,23994,28177,32820,37947,43582,49749,56472,63775,71682,80217,89404,99267,109830,121117,133152,145959,159562,173985,189252,205387,222414,240357,259240,279087,299922,321769,344652,368595,393622,419757... |
/*
* 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 "src/core/SkGaussFilter.h"
#include <cmath>
#include <tuple>
#include <vector>
#include "tests/Test.h"
// one part in a million
static constexpr double kEpsilon = 0... |
;/*!
; @file
;
; @ingroup fapi
;
; @brief DosDevConfig DOS wrapper
;
; (c) osFree Project 2018, <http://www.osFree.org>
; for licence see licence.txt in root directory, or project website
;
; This is Family API implementation for DOS, used with BIND tools
; to link required API
;
; @author Yuri Prokushe... |
.global s_prepare_buffers
s_prepare_buffers:
push %r8
push %rax
push %rbp
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_normal_ht+0x79d1, %rsi
nop
nop
add $38569, %rax
mov $0x6162636465666768, %rdx
movq %rdx, %xmm2
and $0xffffffffffffffc0, %rsi
vmovntdq %ymm2, (%rsi)
xor $21754, %rbp
lea addresses_A_h... |
; A063117: Dimension of the space of weight 2n cusp forms for Gamma_0( 49 ).
; 1,10,20,28,38,48,56,66,76,84,94,104,112,122,132,140,150,160,168,178,188,196,206,216,224,234,244,252,262,272,280,290,300,308,318,328,336,346,356,364,374,384,392,402,412,420,430,440,448,458
mov $2,7
lpb $0
mov $1,$0
sub $0,$0
mul $1,2
... |
//Language: GNU C++0x
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=100001;
const int INF=0x7FFFFFFF;
const doub... |
lui $1,19434
ori $1,$1,52351
lui $2,30183
ori $2,$2,59896
lui $3,19807
ori $3,$3,4024
lui $4,13766
ori $4,$4,52118
lui $5,8799
ori $5,$5,31074
lui $6,26965
ori $6,$6,11913
mthi $1
mtlo $2
sec0:
nop
nop
nop
subu $5,$6,$2
sec1:
nop
nop
nor $2,$6,$1
subu $3,$6,$2
sec2:
nop
nop
sltiu $2,$4,4681
subu $3,$6,$2
se... |
; A115032: Expansion of (5-14*x+x^2)/((1-x)*(x^2-18*x+1)).
; Submitted by Jamie Morken(s1.)
; 5,81,1445,25921,465125,8346321,149768645,2687489281,48225038405,865363202001,15528312597605,278644263554881,5000068431390245,89722587501469521,1610006506595061125,28890394531209630721,518417095055178291845,93026173164619996224... |
format PE64 console 5.0
entry start
MEM_LARGE_PAGES = 20000000h
include 'win64a.inc'
include 'params.inc'
include 'struct_eh.inc'
include 'macro_eh.asm'
section '.text' code readable executable
start:
mov eax, esp
cmp rax, rsp
jne _Exit
sub esp, 0x108
and esp, -32
frame
call [GetCurrentThread]
mov rcx, rax
mov edx... |
SECTION code_driver
SECTION code_driver_terminal_input
PUBLIC console_01_input_stdio_msg_ictl
PUBLIC console_01_input_stdio_msg_ictl_0
EXTERN asm_vioctl_driver, error_einval_zc
EXTERN l_offset_ix_de, l_setmem_hl
EXTERN console_01_input_stdio_msg_flsh
EXTERN console_01_input_proc_reset
console_01_input_stdio_msg_ict... |
; void in_MouseAMXInit(uchar xvector, uchar yvector)
; CALLER linkage for function pointers
XLIB in_MouseAMXInit
LIB in_MouseAMXInit_callee
XREF ASMDISP_IN_MOUSEAMXINIT_CALLEE
.in_MouseAMXInit
pop hl
pop bc
pop de
push de
push bc
push hl
ld b,e
jp in_MouseAMXInit_callee + ASMDISP_IN_MOUS... |
; A115129: Partial sums of A005587. Fourth column of triangle A115127.
; 14,56,146,311,586,1015,1652,2562,3822,5522,7766,10673,14378,19033,24808,31892,40494,50844,63194,77819,95018,115115,138460,165430,196430,231894,272286,318101,369866,428141,493520,566632,648142,738752,839202,950271,1072778,1207583,1355588,1517738,16... |
/*
This file is part of TON Blockchain Library.
TON Blockchain Library is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later ver... |
; Student ID : SLAE64-1611
; Student Name : Jonathan "Chops" Crosby
; Assignment 1 : Shell Bind TCP (Linux/x86_64) Assembly
; File Name : shell-bind.nasm
global _start
section .text
_start:
jmp real_start
enter_password: db 'Enter the secret password to continue: ', 0xa
real_start:
; SYS_SOCKET ... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r13
push %r14
push %r9
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_D_ht+0x1dfaa, %rax
clflush (%rax)
cmp %r9, %r9
mov $0x6162636465666768, %r14
movq %r14, (%rax)
nop
nop
nop
nop
nop
cmp $54846, %r13
lea addresses_WC_ht+0x36ca, %r... |
// Copyright (c) 2011-2020 The Mantle Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <qt/walletframe.h>
#include <qt/mantlegui.h>
#include <qt/createwalletdialog.h>
#include <qt/overviewpage.h>
#includ... |
;; _ff3-DSfy-DEV.asm
;; creates hacked file with features under development (and sometimes unstable) included
;;
;;=================================================================================================
;;feature flags.
BALANCED_VERSION
EXTRA_MAP
EXPERIMENTAL
;EXPERIMENT_IMPL = 5 ; encount test
EXP... |
; A247608: a(n) = Sum_{k=0..3} binomial(6,k)*binomial(n,k).
; 1,7,28,84,195,381,662,1058,1589,2275,3136,4192,5463,6969,8730,10766,13097,15743,18724,22060,25771,29877,34398,39354,44765,50651,57032,63928,71359,79345,87906,97062,106833,117239,128300,140036,152467,165613,179494,194130,209541,225747,242768,260624,279335,298... |
/*********************************************************************************
*
* Inviwo - Interactive Visualization Workshop
*
* Copyright (c) 2013-2019 Inviwo Foundation
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided th... |
#include "MPC.hpp"
#include <cppad/ipopt/solve.hpp>
#include <iostream>
#include <string>
#include <vector>
#include "Eigen-3.3/Eigen/Core"
#include "Eigen-3.3/Eigen/QR"
#include "Eigen-3.3/Eigen/Householder"
using CppAD::AD;
// This value assumes the model presented in the classroom is used.
//
// It was obtained b... |
// -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2020, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2020, Knut Reinert & MPI für molekulare Genetik
// This file may be used, modified and/or redistributed under the terms of th... |
;
; A simple boot sector program that demonstrates addressing.
;
mov ah, 0x0e ; int 10/ah = 0eh -> scrolling teletype BIOS routine
; First attempt
mov al, the_secret
int 0x10 ; Does this print an X?
; Second attempt
mov al, [the_secret]
int 0x10 ; Does this print an X?
... |
; A202050: Number of (n+2) X 8 binary arrays avoiding patterns 001 and 110 in rows and columns.
; 1392,5216,15760,41088,95984,205792,411696,777760,1400080,2418432,4030832,6511456,10232400,15689792,23534800,34610112,49992496,71042080,99459024,137348288,187293232,252438816,336585200,444292576,580998096,753145792,96833041... |
/**
* This file is part of dvo.
*
* Copyright 2012 Christian Kerl <christian.kerl@in.tum.de> (Technical University of Munich)
* For more information see <http://vision.in.tum.de/data/software/dvo>.
*
* dvo is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public... |
; A124932: Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).
; Submitted by Christian Krause
; 1,2,3,3,9,6,4,18,24,10,5,30,60,50,15,6,45,120,150,90,21,7,63,210,350,315,147,28,8,84,336,700,840,588,224,36,9,108,504,1260,1890,1764,1008,324,45,10,135,720,2100,3780,4410,3360,1620,450,55,11,165,990,3300,... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r14
push %r9
push %rax
push %rbx
push %rcx
push %rsi
lea addresses_WT_ht+0x5456, %rsi
nop
nop
nop
nop
sub $54248, %rcx
mov $0x6162636465666768, %r11
movq %r11, %xmm4
movups %xmm4, (%rsi)
nop
nop
nop
nop
inc %rbx
lea addresses_UC_ht+0x191a6, %r9
nop
nop
nop
cm... |
/*
* Copyright 2009 The Android Open Source Project
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkBitmapProcState.h"
#include "SkColorPriv.h"
#include "SkPaint.h"
#include "SkTypes.h"
#include "SkUtils.h"
#include "SkUtilsArm.h"
#include "... |
; Color Dreams: (32-128)KB PRG-ROM + (16-128)KB CHR-ROM
; http://bootgod.dyndns.org:7777/search.php?keywords=11&kwtype=pcb
;------------------------------------------------------------------------------;
|
; A272263: a(n) = numerator of A000032(n) - 1/2^n.
; 1,1,11,31,111,351,1151,3711,12031,38911,125951,407551,1318911,4268031,13811711,44695551,144637951,468058111,1514668031,4901568511,15861809151,51329892351,166107021311,537533612031,1739495309311,5629125066751,18216231370751,58948963008511,190762851500031,6173215550341... |
; A030191: Scaled Chebyshev U-polynomial evaluated at sqrt(5)/2.
; 1,5,20,75,275,1000,3625,13125,47500,171875,621875,2250000,8140625,29453125,106562500,385546875,1394921875,5046875000,18259765625,66064453125,239023437500,864794921875,3128857421875,11320312500000,40957275390625,148184814453125,536137695312500,1939764404... |
; size_t getline_callee(char **lineptr, size_t *n, FILE *stream)
INCLUDE "clib_cfg.asm"
SECTION code_clib
SECTION code_stdio
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
IF __CLIB_OPT_MULTITHREAD & $02
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
PUBLIC _getline_callee, l0_getline_callee
EXTERN asm_getline
_getline_callee:
pop af
... |
; A042968: Numbers not divisible by 4.
; 1,2,3,5,6,7,9,10,11,13,14,15,17,18,19,21,22,23,25,26,27,29,30,31,33,34,35,37,38,39,41,42,43,45,46,47,49,50,51,53,54,55,57,58,59,61,62,63,65,66,67,69,70,71,73,74,75,77,78,79,81,82,83,85,86,87,89,90,91,93,94,95,97,98,99,101,102,103,105,106,107,109,110,111,113,114,115,117,118,119,1... |
; A190872: a(n) = 11*a(n-1) - 9*a(n-2), a(0)=0, a(1)=1.
; Submitted by Jon Maiga
; 0,1,11,112,1133,11455,115808,1170793,11836451,119663824,1209774005,12230539639,123647969984,1250052813073,12637749213947,127764766035760,1291672683467837,13058516623824367,132018628710857504,1334678266205013241,13493293269857428115,13641... |
// Copyright (c) 2011 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 "net/dns/dns_query.h"
#include "base/bind.h"
#include "net/base/dns_util.h"
#include "net/base/io_buffer.h"
#include "net/dns/dns_protocol.h... |
; A082908: Largest value of gcd(2^n, binomial(n,j)) with j=0..n-1; maximal value of largest power of 2 dividing binomial(n,j) in the n-th row of Pascal's triangle.
; 1,1,2,1,4,2,4,1,8,4,8,2,8,4,8,1,16,8,16,4,16,8,16,2,16,8,16,4,16,8,16,1,32,16,32,8,32,16,32,4,32,16,32,8,32,16,32,2,32,16,32,8,32,16,32,4,32,16,32,8,32,16... |
; A077957: Powers of 2 alternating with zeros.
; 1,0,2,0,4,0,8,0,16,0,32,0,64,0,128,0,256,0,512,0,1024,0,2048,0,4096,0,8192,0,16384,0,32768,0,65536,0,131072,0,262144,0,524288,0,1048576,0,2097152,0,4194304,0,8388608,0,16777216,0,33554432,0,67108864,0,134217728,0,268435456,0,536870912,0,1073741824,0,2147483648,0,42949672... |
; A055796: T(2n+3,n), array T as in A055794.
; 1,5,16,42,98,210,420,792,1419,2431,4004,6370,9828,14756,21624,31008,43605,60249,81928,109802,145222,189750,245180,313560,397215,498771,621180,767746,942152,1148488,1391280,1675520,2006697,2390829,2834496,3344874,3929770,4597658,5357716,6219864,7194803,8294055,9530004,10915... |
#pragma once
#include <iostream>
#include <string>
#include <utility>
#include <vector>
namespace tdc {
/// \cond INTERNAL
namespace pattern {
/*
Representation of an algorithm consisting of only those
options that are relevant for selecting a statically
defined imp... |
; A002383: Primes of form n^2 + n + 1.
; Submitted by Jon Maiga
; 3,7,13,31,43,73,157,211,241,307,421,463,601,757,1123,1483,1723,2551,2971,3307,3541,3907,4423,4831,5113,5701,6007,6163,6481,8011,8191,9901,10303,11131,12211,12433,13807,14281,17293,19183,20023,20593,21757,22651,23563,24181,26083,26407,27061,28057,28393,30... |
; A055989: a(n) is its own 4th difference.
; 1,3,10,36,131,476,1728,6272,22765,82629,299915,1088589,3951206,14341527,52054840,188941273,685792227,2489191330,9034913540,32793647355,119029728628,432037221840,1568147413312,5691839002677,20659429692245,74986666876571,272175964826781,987905702640782,3585759962057263,1301508... |
; Copyright (c) 1997-2000 René Ladan. 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... |
;;#############################################################################
;;
;; FILE: cla_ex2_fir32.asm
;;
;; TITLE: 5-Tap FIR Filter Example
;;
;;#############################################################################
;; $TI Release: F28004x Support Library v1.10.00.00 $
;; $Release Date: Tue May 26 17:... |
; A106269: Expansion of 1/((1 - x^2)*(2 - c(x))), where c(x) is the g.f. of A000108.
; 1,1,4,11,39,137,501,1853,6936,26163,99314,378879,1451392,5579179,21509692,83137939,322049887,1249941049,4859617537,18922572949,73782881947,288051510169,1125832363807,4404766873969,17249634205357,67610070092845,265208900679409,1041079... |
;;
;; Copyright (c) 2020-2021, 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... |
;
; 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... |
#pragma once
template<typename T>
xx::PtrHeader* Ref<T>::GetPtrHeader() const {
return (xx::PtrHeader*)(T*)this - 1;
}
// unsafe
template<typename T>
template<typename U>
xx::Weak<U> Ref<T>::WeakFromThis() const {
auto h = GetPtrHeader();
return *(xx::Weak<U>*) & h;
}
template<typename T>
template<typename U>
xx... |
; A117942: a(n) = a(3n) = -a(3n+1) = -a(3n+2)/2.
; Submitted by Christian Krause
; 1,-1,-2,-1,1,2,-2,2,4,-1,1,2,1,-1,-2,2,-2,-4,-2,2,4,2,-2,-4,4,-4,-8,-1,1,2,1,-1,-2,2,-2,-4,1,-1,-2,-1,1,2,-2,2,4,2,-2,-4,-2,2,4,-4,4,8,-2,2,4,2,-2,-4,4,-4,-8,2,-2,-4,-2,2,4,-4,4,8,4,-4,-8,-4,4,8,-8,8,16,-1,1,2,1,-1,-2,2,-2,-4,1,-1,-2,-1,... |
/*
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
*/
#include <string>
#include <utility>
#include "util/flet.h"
#include "util/thread.h"
#include "util/sexpr/option_declarations.h"
#include "kernel/find_fn.h"... |
/*
* Copyright (c) 2017, Dmytro Iakovliev daemondzk@gmail.com
* 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
* no... |
; A224881: Expansion of 1/(1 - 16*x)^(1/8).
; Submitted by Christian Krause
; 1,2,18,204,2550,33660,460020,6440280,91773990,1325624300,19354114780,285033326760,4227994346940,63094684869720,946420273045800,14259398780556720,215673406555920390,3273161111260438860,49824785804742235980,760483572809223601800,116353986639811... |
Map_2PRetractingSpring_:dc.w word_23F5A-Map_2PRetractingSpring_
dc.w word_23F5C-Map_2PRetractingSpring_
dc.w word_23F64-Map_2PRetractingSpring_
dc.w word_23F64-Map_2PRetractingSpring_
Map_2PRetractingSpring_2:
Map_2PRetractingSpring_2_:dc.w word_23F5A-Map_2PRetractingSpring_2_
dc.w word_23F6C-Map_2PRetractingS... |
; Copyright © 2019-2021, VideoLAN and dav1d authors
; Copyright © 2019, Two Orioles, LLC
; 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... |
; A023568: Number of distinct prime divisors of prime(n)-3.
; 0,0,1,1,1,2,2,1,2,2,2,2,2,2,2,2,2,2,1,2,3,2,2,2,2,2,2,2,2,3,2,1,2,2,2,2,3,2,2,3,2,2,2,3,2,2,2,3,2,2,3,2,3,2,2,3,3,2,2,2,3,3,2,3,3,2,2,2,2,2,3,2,3,3,2,3,2,2,2,3,2,3,2,3,2,3,2,2,2,3,2,3,2,2,2,2,3,3,3,2
seq $0,40 ; The prime numbers.
trn $0,4
seq $0,1221 ; Num... |
OPTION DOTNAME
.text$ SEGMENT ALIGN(256) 'CODE'
EXTERN OPENSSL_ia32cap_P:NEAR
PUBLIC aesni_encrypt
ALIGN 16
aesni_encrypt PROC PUBLIC
movups xmm2,XMMWORD PTR[rcx]
mov eax,DWORD PTR[240+r8]
movups xmm0,XMMWORD PTR[r8]
movups xmm1,XMMWORD PTR[16+r8]
lea r8,QWORD PTR[32+r8]
xorps xmm2,xmm0
$L$oop_enc1_1::
DB 102,15... |
; A017441: a(n) = (11*n + 4)^5.
; 1024,759375,11881376,69343957,254803968,714924299,1680700000,3486784401,6590815232,11592740743,19254145824,30517578125,46525874176,68641485507,98465804768,137858491849,188956800000,254194901951,336323216032,438427732293,563949338624,716703146875,900897818976,1121154893057,1382528109568... |
;/*!
; @file
;
; @ingroup fapi
;
; @brief DosAllocShrSeg DOS wrapper
;
; (c) osFree Project 2018, <http://www.osFree.org>
; for licence see licence.txt in root directory, or project website
;
; This is Family API implementation for DOS, used with BIND tools
; to link required API
;
; @author Yuri Prokus... |
; script
start:
; expression +
; value int 2
set r3 2
; value int 3
set r4 3
add r2 r3 r4
stop |
; A084642: A Jacobsthal ratio.
; 1,3,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1
mov $2,$0
sub $0,1
gcd $0,2
cmp $2,1
add $0,$2
mov $1,$0
|
; Password recovery modules
.data
szFilePoint db '.',0
szFilePPoint db '..',0
CCommonFileMask db '\*.*',0
CCommonFileMaskNoSlash db '*.*',0
.code
ITEMHDR_ID equ 0beef0000h
MODULE_SYSTEMINFO equ 00000000h
MODULE_FAR equ 00000001h
MODULE_WTC equ 00000002h
MODULE_WS_FTP e... |
; A186380: Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f(i)=4i and g(j)=j(j+1)/2 (triangular number). Complement of A186379.
; 1,2,4,6,8,11,14,17,20,23,27,31,35,40,45,50,55,60,66,72,78,85,92,99,106,113,121,129,137,146,155,164,173,182,192,202,212,223,234,245,256,267,279... |
/*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... |
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
#include "nuphar_codegen_ctx.h"
#include "core/codegen/common/common.h"
#include "core/codegen/common/utils.h"
#include "core/codegen/mti/mti_tvm_utils.h" // TODO: remove this after decoupling layout compile and run
#incl... |
///////////////////////////////////////////////////////////////////////////////
///
/// Authors: Andrew Colean
/// Copyright 2015, DigiPen Institute of Technology
///
///////////////////////////////////////////////////////////////////////////////
#pragma once
// Includes
#include "ContainerCommon.hpp"
#inclu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.