text stringlengths 1 1.05M |
|---|
// Copyright 2011 the V8 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.
#include "src/parsing/func-name-inferrer.h"
#include "src/ast/ast.h"
#include "src/ast/ast-value-factory.h"
#include "src/list-inl.h"
namespace v8 {
n... |
// 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 und... |
/*
Copyright (c) Facebook, Inc. and its affiliates.
This source code is licensed under the MIT license found in the
LICENSE file in the root directory of this source tree.
*/
#include "compile.h"
#include "ir.h"
#include <chrono>
#include <iostream>
#include <random>
void rand(float *data, int N) {
std::random_dev... |
@256
D=A
@SP
M=D
@133
0;JMP
@R15
M=D
@SP
AM=M-1
D=M
A=A-1
D=M-D
M=0
@END_EQ
D;JNE
@SP
A=M-1
M=-1
(END_EQ)
@R15
A=M
0;JMP
@R15
M=D
@SP
AM=M-1
D=M
A=A-1
D=M-D
M=0
@END_GT
D;JLE
@SP
A=M-1
M=-1
(END_GT)
@R15
A=M
0;JMP
@R15
M=D
@SP
AM=M-1
D=M
A=A-1
D=M-D
M=0
@END_LT
D;JGE
@SP
A=M-1
M=-1
(END_LT)
@R15
A=M
0;JMP
@5
D=A
@LCL
A... |
; A153257: a(n) = n^3-(n+1)^2.
; -1,-3,-1,11,39,89,167,279,431,629,879,1187,1559,2001,2519,3119,3807,4589,5471,6459,7559,8777,10119,11591,13199,14949,16847,18899,21111,23489,26039,28767,31679,34781,38079,41579,45287,49209,53351,57719
mov $1,$0
pow $0,2
sub $0,2
sub $1,1
mul $0,$1
sub $0,3
|
.constant_pool
.const 0 string [start]
.const 1 string [constructor]
.const 2 string [e]
.const 3 string [elemento]
.const 4 string [oi]
.const 5 string [x]
.const 6 string [msg]
.const 7 string [msg=]
.const 8 int [2]
.const 9 string [io.writeln]
.end
.entity start
... |
; A070399: a(n) = 6^n mod 31.
; 1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6,5,30,25,26,1,6... |
; A050509: House numbers (version 2): a(n) = (n+1)^3 + (n+1)*Sum_{i=0..n} i.
; 1,10,36,88,175,306,490,736,1053,1450,1936,2520,3211,4018,4950,6016,7225,8586,10108,11800,13671,15730,17986,20448,23125,26026,29160,32536,36163,40050,44206,48640,53361,58378,63700,69336,75295,81586,88218,95200,102541,110250,118336,126808,1356... |
; A256020: a(n) = Sum_{i=1..n-1} (i^4 * a(i)), a(1)=1.
; 1,1,17,1394,358258,224269508,290877551876,698687879606152,2862524242746404744,18783884080901907930128,187857624693099981209210128,2750611340756369924865254694176,57039427373264843131930786593127712,1629160124635190449534207126672913710144
seq $0,255434 ; Product... |
; A044807: Numbers n such that string 9,4 occurs in the base 10 representation of n but not of n+1.
; Submitted by Christian Krause
; 94,194,294,394,494,594,694,794,894,949,994,1094,1194,1294,1394,1494,1594,1694,1794,1894,1949,1994,2094,2194,2294,2394,2494,2594,2694,2794,2894,2949,2994,3094,3194,3294,3394,3494,3594
ad... |
; A113935: a(n) = prime(n) + 3.
; 5,6,8,10,14,16,20,22,26,32,34,40,44,46,50,56,62,64,70,74,76,82,86,92,100,104,106,110,112,116,130,134,140,142,152,154,160,166,170,176,182,184,194,196,200,202,214,226,230,232,236,242,244,254,260,266,272,274,280,284,286,296,310,314,316,320,334,340,350,352,356,362,370,376,382,386,392,400,4... |
; A156066: Numbers n with property that n^2 is a square arising in A154138.
; Submitted by Christian Krause
; 2,3,9,16,52,93,303,542,1766,3159,10293,18412,59992,107313,349659,625466,2037962,3645483,11878113,21247432,69230716,123839109,403506183,721787222,2351806382,4206884223,13707332109,24519518116,79892186272,1429102... |
.global s_prepare_buffers
s_prepare_buffers:
push %r14
push %r15
push %r9
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x3070, %r9
cmp $51939, %rbx
mov (%r9), %r15d
nop
nop
xor $44216, %rdx
lea addresses_normal_ht+0xd45a, %r9
nop
nop
inc %r14
vmovups (%r9), %ymm6
vextracti128 $1, %ymm6, %xmm6
v... |
; Listing generated by Microsoft (R) Optimizing Compiler Version 19.00.23506.0
TITLE D:\Projects\TaintAnalysis\AntiTaint\Epilog\src\func-alloca.c
.686P
.XMM
include listing.inc
.model flat
INCLUDELIB MSVCRT
INCLUDELIB OLDNAMES
PUBLIC ___local_stdio_printf_options
PUBLIC ___local_stdio_scanf_options... |
// Copyright (c) 2018-2019 The PIVX developers
// Copyright (c) 2019-2020 The TERRACREDIT developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "zcreditchain.h"
#include "zcredit/zcreditmodule.h"
#include "invalid.... |
// Copyright (c) 2014 GitHub, Inc.
// Use of this source code is governed by the MIT license that can be
// found in the LICENSE file.
#include "shell/browser/ui/views/menu_bar.h"
#include <memory>
#include <set>
#include <sstream>
#include "shell/browser/ui/views/submenu_button.h"
#include "shell/common/keyboard_ut... |
;
; $Id: tuc24_ref.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 5650 reference boar... |
; A246306: Numbers k such that cos(k) > cos(k+1) < cos(k+2) < cos(k+3) > cos(k+4).
; 0,6,13,19,25,32,38,44,50,57,63,69,76,82,88,94,101,107,113,120,126,132,138,145,151,157,164,170,176,182,189,195,201,207,214,220,226,233,239,245,251,258,264,270,277,283,289,295,302,308,314,321,327,333,339,346,352,358,365,371,377,383,390,3... |
/*
//@HEADER
// ************************************************************************
//
// KokkosKernels 0.9: Linear Algebra and Graph Kernels
// Copyright 2017 Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retain... |
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
/*
* MIT License
*
* Parametric Cubic Spline Library
* Copyright (c) 2021-, Michael Heidingsfeld
*
* 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 with... |
; A142014: Primes congruent to 10 mod 31.
; Submitted by Christian Krause
; 41,103,227,599,661,971,1033,1777,1901,2087,2273,2459,2521,2707,3079,3203,3389,3637,3761,3823,3947,4133,4567,4691,4877,5683,5807,5869,6427,6551,6737,7109,7481,7853,8039,8101,8287,8597,8783,8969,9341,9403,10271,10333,10457,10891,11821,12007,12379... |
; ===============================================================
; Jun 2007
; ===============================================================
;
; uint zx_saddr2cx(void *saddr)
;
; Character x coordinate corresponding to screen address.
;
; ===============================================================
SECTION code_... |
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) Berkeley Softworks 1993 -- All Rights Reserved
PROJECT: PC GEOS
MODULE: PostScript driver
FILE: adobeLJ2cartfTC1Info.asm
AUTHOR: Dave Durran 13 April 1993
REVISION HISTORY:
Name Date Description
---- --... |
/*
* Copyright (c) 2018 Andrew Kelley
*
* This file is part of zig, which is MIT licensed.
* See http://opensource.org/licenses/MIT
*/
#ifndef ZIG_COMPILER_HPP
#define ZIG_COMPILER_HPP
#include "buffer.hpp"
#include "error.hpp"
Buf *get_stage1_cache_path();
Error get_compiler_id(Buf **result);
Buf *get_zig_lib... |
; A157855: 103680000n^2 - 46108800n + 5126401.
; 62697601,327628801,799920001,1479571201,2366582401,3460953601,4762684801,6271776001,7988227201,9912038401,12043209601,14381740801,16927632001,19680883201,22641494401,25809465601,29184796801,32767488001,36557539201,40554950401,44759721601,49171852801,53791344001,586181952... |
/****************************************************************************
Copyright (c) 2013 Zynga Inc.
Copyright (c) 2013-2014 Chukong Technologies Inc.
http://www.cocos2d-x.org
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation f... |
// @file keypattern.cpp
/**
* Copyright (C) 2012 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that... |
; Aufgabe Nr.: Speichermodul fuer uP- Praktikum II
; Autor: Joerg Vollandt
; erstellt am : 21.05.1994
; letzte Aenderung am : 01.08.1994
; Bemerkung : Makros
;
; Dateiname : makro1.asm
;
;---------------------------------------------------------------------
; Funktion : Direkter Bitmove- Befehl
; Aufrufparameter :... |
include include1.asm
init: ld a, 0
mac1
ld a, 2
end init
|
#include <cstdarg>
#include <sstream>
#include <string>
#include "StringFormatter.hpp"
using std::string;
using std::stringstream;
string StringFormatter::format(const char *format, va_list args) {
const char *p;
char *sval;
char cval;
int ival;
double dval;
stringstream sstream;
for (p = format; *p; ... |
; A064216: Replace each p^e with prevprime(p)^e in the prime factorization of odd numbers; inverse of sequence A048673 considered as a permutation of the natural numbers.
; 1,2,3,5,4,7,11,6,13,17,10,19,9,8,23,29,14,15,31,22,37,41,12,43,25,26,47,21,34,53,59,20,33,61,38,67,71,18,35,73,16,79,39,46,83,55,58,51,89,28,97,101... |
/*=============================================================================
Copyright (c) 2015,2018 Kohei Takahashi
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)
========================================... |
; A095340: Total number of nodes in all labeled graphs on n nodes.
; 1,4,24,256,5120,196608,14680064,2147483648,618475290624,351843720888320,396316767208603648,885443715538058477568,3929008913747544817795072,34662321099990647697175478272,608472288109550112718417538580480,21267647932558653966460912964485513216,148090886... |
/*
* File : context.asm
* This file is part of RT-Thread RTOS
* COPYRIGHT (C) 2009, RT-Thread Development Team
*
* The license and distribution terms for this file may be
* found in the file LICENSE in this distribution or at
* http://www.rt-thread.org/license/LICENSE
*
* Change Logs:
* Date Au... |
; A001444: Bending a piece of wire of length n+1 (configurations that can only be brought into coincidence by turning the figure over are counted as different).
; 1,2,6,15,45,126,378,1107,3321,9882,29646,88695,266085,797526,2392578,7175547,21526641,64573362,193720086,581140575,1743421725,5230206126,15690618378,47071677... |
// Copyright 2018 The Fuchsia 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 "src/developer/debug/zxdb/symbols/dwarf_symbol_factory.h"
#include "gtest/gtest.h"
#include "src/developer/debug/zxdb/common/string_util.h"
#inclu... |
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2019 The Bitstock developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "netbase.h"
#include "masternodeconfig.h"
#include "util.h"
#include ... |
; A010815: From Euler's Pentagonal Theorem: coefficient of q^n in Product_{m>=1} (1 - q^m).
; Submitted by Jon Maiga
; 1,-1,-1,0,0,1,0,1,0,0,0,0,-1,0,0,-1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,-1,0,0,0,0,-1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0... |
// This file is part of www.nand2tetris.org
// and the book "The Elements of Computing Systems"
// by Nisan and Schocken, MIT Press.
// File name: projects/04/Fill.asm
// Runs an infinite loop that listens to the keyboard input.
// When a key is pressed (any key), the program blackens the screen,
// i.e. writes... |
;----------------------------------------------------------------------------------
; Tiny Basic port to MKHBC-8-R1 6502 computer
; by Marek Karcz 2012.
;
; Based on the work by:
;
; ================= ORIGINAL HEADER ======================================
;
; OMS-02 Firmware
;
; Bill O'Neill - Last update: 2008/12/06
;... |
; A085441: a(n) = Sum_{i=1..n} binomial(i+1,2)^6.
; 1,730,47386,1047386,12438011,98204132,580094436,2756876772,11060642397,38741283022,121395233038,346594833742,914464085783,2254559726408,5240543726408,11568062614344,24395756421273,49397866465794,96443747465794,182209868465794,334149783550675,596404391103404,1038437187... |
; A202638: y-values in the solution to x^2 - 7*y^2 = -3.
; Submitted by Christian Krause
; 1,2,14,31,223,494,3554,7873,56641,125474,902702,1999711,14386591,31869902,229282754,507918721,3654137473,8094829634,58236916814,129009355423,928136531551,2056054857134,14791947588002,32767868358721,235743024876481,522229838882402... |
// Copyright (c) 2016 Tin Project. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <time.h>
#include "base/basictypes.h"
#include "base/time/time.h"
namespace tin {
/* Available from 2.6.32 onwards. */
#ifndef CLOCK_MONOTONIC_COARS... |
/*=========================================================================
Program: Visualization Toolkit
Module: vtkExtractEdges.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This ... |
%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 0x6D, 0x69, 0x66, 0x31 ; brand(32) ('mif1')
db 0x00, 0x00, 0x00, 0x00 ; version(32)
db 0x6D, 0x69, 0x66, 0x31 ; compatible_... |
; A111199: Numbers n such that 4k + 9 is prime.
; 1,2,5,7,8,11,13,16,20,22,23,25,26,32,35,37,41,43,46,47,55,56,58,62,65,67,68,71,76,77,82,85,86,91,95,97,98,100,103,106,110,112,113,125,128,133,137,140,142,146,148,151,152,158,161,163,166,167,173,175,181,187,188,190,191,197,200,203,205,211,212,217,218,230,232,233,236,242,... |
; ******************************************************
; Prob 9_10.1.........Study the LCD Interface and Write a code for LCD using AVR Micro controller . for AVR
; ******************************************************
.include "C:\VMLAB\include\m8def.inc"
; Define here Reset and interrupt vectors, i... |
; int isspace(int c)
SECTION code_ctype
PUBLIC isspace
EXTERN asm_isspace, error_zc
isspace:
inc h
dec h
jp nz, error_zc
ld a,l
call asm_isspace
ld l,h
ret c
inc l
ret
|
/**
* \file QryWdbeUntRef1NError.cpp
* API code for job QryWdbeUntRef1NError (implementation)
* \copyright (C) 2016-2020 MPSI Technologies GmbH
* \author Alexander Wirthmueller (auto-generation)
* \date created: 5 Dec 2020
*/
// IP header --- ABOVE
#include "QryWdbeUntRef1NError.h"
using namespace std;
using na... |
; A189154: Number of n X 2 binary arrays without the pattern 0 0 1 1 diagonally, vertically or horizontally
; 4,16,64,225,784,2704,9216,31329,106276,360000,1218816,4124961,13957696,47224384,159769600,540516001,1828588644,6186137104,20927672896,70798034241,239508444816,810252019600,2741064339456,9272956793409,3137019282... |
/*
21days
特定类型异常
*/
#include <iostream>
#include <exception>
using namespace std;
int main() {
cout << "Enter number of integers you wish to reserve" << endl;
try {
int input = 0;
cin >> input;
// Request memory space and then return it
int* pReservedInts = new int[input]; /... |
/*! \file */
/* ************************************************************************
* Copyright (c) 2020 Advanced Micro Devices, Inc.
*
* 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 Softwa... |
#include <Core/ServerUUID.h>
#include <IO/ReadBufferFromFile.h>
#include <IO/WriteBufferFromFile.h>
#include <IO/ReadHelpers.h>
#include <IO/WriteHelpers.h>
#include <base/logger_useful.h>
namespace DB
{
namespace ErrorCodes
{
extern const int CANNOT_CREATE_FILE;
}
void ServerUUID::load(const fs::path & server_u... |
// Copyright 2019 Google LLC
//
// 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 ... |
; A058207: Three steps forward, two steps back.
; 0,1,2,3,2,1,2,3,4,3,2,3,4,5,4,3,4,5,6,5,4,5,6,7,6,5,6,7,8,7,6,7,8,9,8,7,8,9,10,9,8,9,10,11,10,9,10,11,12,11,10,11,12,13,12,11,12,13,14,13,12,13,14,15,14,13,14,15,16,15,14,15,16,17,16,15,16,17,18,17,16,17,18,19,18,17,18,19,20,19,18,19,20,21,20,19,20,21,22,21
sub $2,$0
l... |
; A198770: 11*5^n-1.
; 10,54,274,1374,6874,34374,171874,859374,4296874,21484374,107421874,537109374,2685546874,13427734374,67138671874,335693359374,1678466796874,8392333984374,41961669921874,209808349609374,1049041748046874,5245208740234374,26226043701171874,131130218505859374,655651092529296874,3278255462646484374,163... |
; A055955: a(n) = n - reversal of base 7 digits of n (written in base 10).
; 0,0,0,0,0,0,0,6,0,-6,-12,-18,-24,-30,12,6,0,-6,-12,-18,-24,18,12,6,0,-6,-12,-18,24,18,12,6,0,-6,-12,30,24,18,12,6,0,-6,36,30,24,18,12,6,0,48,0,-48,-96,-144,-192,-240,48,0,-48,-96,-144,-192,-240,48,0,-48,-96,-144,-192,-240,48,0,-48,-96,-144,-19... |
; A349071: a(n) = T(n, 2*n), where T(n, x) is the Chebyshev polynomial of the first kind.
; Submitted by Christian Krause
; 1,2,31,846,32257,1580050,94558751,6686381534,545471324161,50428155189474,5210183616019999,594949288292777902,74404881332329766401,10114032809617941274226,1484781814660796486716447,2341145714384985... |
<%
from pwnlib.shellcraft.i386.linux import syscall
%>
<%page args="n, groups"/>
<%docstring>
Invokes the syscall setgroups. See 'man 2 setgroups' for more information.
Arguments:
n(size_t): n
groups(gid_t): groups
</%docstring>
${syscall('SYS_setgroups', n, groups)}
|
## binsearch
.data
array: .word 1 4 7 10 15
arraySize: .word 5
msg: .asciiz "Enter the number that you want to search for:\n"
.text
main:
li $v0,4
la $a0,msg
syscall
li $v0,5
syscall
move $t5, $v0
la $s0, array
xor $a0, $a0, $a0
lw $a1, arraySize
jal search
##retval in $a0
li $v0,1
syscall
li $v0,10
syscall
searc... |
; A032832: Numbers whose set of base-8 digits is {3,4}.
; Submitted by Jon Maiga
; 3,4,27,28,35,36,219,220,227,228,283,284,291,292,1755,1756,1763,1764,1819,1820,1827,1828,2267,2268,2275,2276,2331,2332,2339,2340,14043,14044,14051,14052,14107,14108,14115,14116,14555,14556,14563,14564,14619,14620,14627,14628,18139,18140,1... |
#include "Platform.inc"
#include "FarCalls.inc"
#include "TestFixture.inc"
#include "../ResetMocks.inc"
radix decimal
extern main
BrownOutResetTest code
global testArrange
global testAssert
testArrange:
fcall initialiseResetMocks
testAct:
fcall main
testAssert:
banksel calledInitialiseAfterBrownOutRese... |
MAIN: PUSH BYTE 2
PUSH BYTE 144
DIV BYTE
OUT
EXIT
|
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %rbp
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x1d2f8, %rdi
and $10031, %rdx
movw $0x6162, (%rdi)
nop
nop
nop
nop
xor $21638, %rbp
lea addresses_normal_ht+0xf2f8, %rsi
lea addresses_A_ht+0x17338, %rdi
nop
nop
nop
nop
nop
... |
; int wa_stack_push(wa_stack_t *s, void *item)
SECTION code_clib
SECTION code_adt_wa_stack
PUBLIC _wa_stack_push
EXTERN _w_array_append
defc _wa_stack_push = _w_array_append
|
; A131765: Series reversion of x*(1-5x)/(1-x) .
; Submitted by Jon Maiga
; 1,4,36,404,5076,68324,963396,14046964,210062196,3204118724,49656709476,779690085204,12376867734036,198301332087204,3202580085625476,52080967814444724,852103170531254196,14016301507253656964,231657964424021151396,3845191251378786562324,6407106123... |
#include <eosio/chain/generated_transaction_object.hpp>
#include <eosio/chain/resource_limits.hpp>
#include <eosio/testing/tester.hpp>
#include <eosio/testing/tester_network.hpp>
#include <fc/variant_object.hpp>
#include <boost/test/unit_test.hpp>
#include <contracts.hpp>
#ifdef NON_VALIDATING_TEST
#define TESTER t... |
.intel_syntax noprefix
AND rax, 0b111111000000 # keep the mem. access within the sandbox
MFENCE
ADD rsp, 8 # ensure that the CALL and RET use the first cache set
CALL f1
unreachable:
// LFENCE # if you uncomment this line, the speculation will stop
MOV rax, [r14 + rax] # speculative access
JMP f2
LFENCE
f1:
LEA... |
// Copyright (C) 2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include <ngraph/ngraph.hpp>
//! [op:header]
namespace TemplateExtension {
class Operation : public ngraph::op::Op {
public:
static constexpr ngraph::NodeTypeInfo type_info{"Template", 0};
const ngraph::NodeTypeIn... |
; ----------------------------------------------------------------
; Z88DK INTERFACE LIBRARY FOR THE BIFROST* ENGINE - RELEASE 1.2/L
;
; See "bifrost_h.h" for further details
; ----------------------------------------------------------------
; unsigned char BIFROSTH_getTile(unsigned int px,unsigned int py)
SECTION co... |
# JMH version: 1.19
# VM version: JDK 1.8.0_131, VM 25.131-b11
# VM invoker: /usr/lib/jvm/java-8-oracle/jre/bin/java
# VM options: <none>
# Warmup: 20 iterations, 1 s each
# Measurement: 20 iterations, 1 s each
# Timeout: 10 min per iteration
# Threads: 1 thread, will synchronize iterations
# Benchmark mode: Average ti... |
; vasmm68k_mot[_<HOST>] -Fbin -o icon_36_279/def_kick.info def_kick-icon_36_279.asm
;
; Default "ENV:def_kick.info" data included in "icon 36.279 (20.4.90)".
;
include deficon.inc
ifne DEFICON_MEM
align 1
endif
defIconKick:
dc.w $E310 ; do_Magic = WB_DISKMAGIC
dc.w $0001 ; ... |
#include <iostream>
#include <vector>
using namespace std;
//precondition: v.size() > 0 && 1 <= k && k <=v.size()
int kth_selection(const vector<int>& v, size_t k) {
vector<int> left, mid, right;
if(k == 1)
return v[0];
for(size_t i = 1; i <= k; i++){
if(v[i] < v[0])
left.... |
#include "RecoTauTag/RecoTau/interface/AntiElectronDeadECAL.h"
#include "FWCore/Framework/interface/ESHandle.h"
#include "CondFormats/DataRecord/interface/EcalChannelStatusRcd.h"
#include "CondFormats/EcalObjects/interface/EcalChannelStatus.h"
#include "Geometry/Records/interface/CaloGeometryRecord.h"
#include "Geomet... |
// Copyright 2019 Daniel Parker
// Distributed under the Boost license, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
// See https://github.com/danielaparker/jsoncons for latest version
#ifndef JSONCONS_JSON_TRAITS_MACROS_HPP
#define JSONCONS_JSON_TRAITS_MACRO... |
; A215144: a(n) = 19*n + 1.
; 1,20,39,58,77,96,115,134,153,172,191,210,229,248,267,286,305,324,343,362,381,400,419,438,457,476,495,514,533,552,571,590,609,628,647,666,685,704,723,742,761,780,799,818,837,856,875,894,913,932,951,970,989,1008,1027,1046,1065,1084,1103,1122,1141,1160,1179,1198,1217,1236,1255,1274,1293,1312,... |
; A078007: Expansion of (1-x)/(1-x-2*x^2-x^3).
; 1,0,2,3,7,15,32,69,148,318,683,1467,3151,6768,14537,31224,67066,144051,309407,664575,1427440,3065997,6585452,14144886,30381787,65257011,140165471,301061280,646649233,1388937264,2983297010,6407820771,13763352055,29562290607,63496815488,136384748757,292940670340,6292069833... |
#ifndef _LEMONATOR_DUMMY_H
#define _LEMONATOR_DUMMY_H
#include "lemonator_interface.hpp"
// generalisation of a sensor
class sensor_dummy :
// this is not good programming practice...
public hwlib::sensor_temperature,
public hwlib::sensor_distance,
public hwlib::sensor_rgb,
public hwlib::istream,
... |
; A190333: n + [n*r/s] + [n*t/s]; r=1, s=sqrt(3), t=1/s.
; Submitted by Simon Strandgaard
; 1,3,5,7,8,11,13,14,17,18,20,22,24,26,28,30,31,34,35,37,40,41,43,45,47,49,51,53,54,57,58,60,63,64,66,68,70,71,74,76,77,80,81,83,85,87,89,91,93,94,97,99,100,103,104,106,108,110,112,114,116,117,120,121,123,126,127,129,131,133,134,... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r15
push %r8
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_UC_ht+0xd7a9, %rdi
nop
nop
nop
nop
nop
sub %r8, %r8
mov $0x6162636465666768, %rdx
movq %rdx, %xmm4
and $0xffffffffffffffc0, %rdi
vmovaps %ymm4, (%rdi)
sub $63537, %r11
lea addresses_... |
/*
* 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 2021 Google LLC
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
https ://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distri... |
; A112440: Next term is the sum of the last 10 digits in the sequence, beginning with a(10) = 9.
; 0,0,0,0,0,0,0,0,0,9,9,18,27,36,45,54,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45
sub $0,1
pow $0,2
div $0,28
mov $2,2
lpb $0,1
mov $3,$2
mov $2,1
mov $4,$3
add $4,5
mov $0,$4
lpe
trn $0... |
; A101990: a(1) = a(2) = 1, a(3) = 9; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).
; Submitted by Jon Maiga
; 1,1,9,33,81,225,729,2241,6561,19521,59049,177633,531441,1592865,4782969,14353281,43046721,129127041,387420489,1162300833,3486784401,10460235105,31381059609,94143533121,282429536481,847287546561,25418658283... |
lui $1,35117
ori $1,$1,33896
lui $2,64975
ori $2,$2,47349
lui $3,39921
ori $3,$3,13256
lui $4,30093
ori $4,$4,7286
lui $5,60867
ori $5,$5,53937
lui $6,63760
ori $6,$6,27844
mthi $1
mtlo $2
sec0:
nop
nop
nop
slt $5,$6,$2
sec1:
nop
nop
sltu $6,$1,$1
slt $5,$6,$2
sec2:
nop
nop
lui $6,20852
slt $0,$6,$2
sec3:
... |
; A091704: Number of Barker codes (or Barker sequences) of length n up to reversals and negations.
; Submitted by Christian Krause
; 2,1,2,1,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... |
; A001610: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.
; 0,2,3,6,10,17,28,46,75,122,198,321,520,842,1363,2206,3570,5777,9348,15126,24475,39602,64078,103681,167760,271442,439203,710646,1149850,1860497,3010348,4870846,7881195,12752042,20633238,33385281,54018520,87403802,141422323,228826126,370248450,599074577... |
; A265609: Array read by ascending antidiagonals: A(n,k) the rising factorial, also known as Pochhammer symbol, for n >= 0 and k >= 0.
; Submitted by Christian Krause
; 1,1,0,1,1,0,1,2,2,0,1,3,6,6,0,1,4,12,24,24,0,1,5,20,60,120,120,0,1,6,30,120,360,720,720,0,1,7,42,210,840,2520,5040,5040,0,1,8,56,336,1680,6720,20160,40... |
;GEN-ASM
; ===========================================================================
; ---------------------------------------------------------------------------
; AMPS - SMPS2ASM macro & equate file
; ---------------------------------------------------------------------------
%ifasm% AS
; Note Equates
; -----------... |
ADI,D1,8
ADI,D2,4
ADD,D1,D2 // this is a comment
ADD,D5,D1
SUB,D1,D2
MUL,D5,D1
|
#include <algorithm>
#include <sstream>
#include <ctime>
#include <cstring>
#include <minizip/zlib.h>
#include <zipper.hpp>
namespace ziputils
{
const unsigned int BUFSIZE = 2048;
// Default constructor
zipper::zipper() :
zipFile_(nullptr),
entryOpen_(false)
{
}
// Default... |
#include "game/data/stages/stages-index.asm"
#include "game/data/characters/characters-index.asm"
#include "game/data/characters/characters-common-logic.asm"
#include "game/data/characters/characters-common-animations/characters-common-animations.asm"
|
SECTION code_clib
SECTION code_l_sdcc
PUBLIC ____sdcc_load_debc_deix
____sdcc_load_debc_deix:
IFDEF __SDCC_IX
push ix
ELSE
push iy
ENDIF
ex (sp),hl
add hl,de
ld c,(hl)
inc hl
ld b,(hl)
inc hl
ld e,(hl)
inc hl
ld d,(hl)
pop hl
ret
|
.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+0x185d1, %rbx
nop
nop
nop
nop
nop
xor $26262, %r13
mov $0x6162636465666768, %r14
movq %r14, (%rbx)
nop
nop
nop
add %r8, %r8
lea addresses_A_ht+0x33d1, %rsi
nop
nop
nop
inc %rbx
... |
;
; FILENAME : f64_ldexp.asm
;
; DESCRIPTION :
; double ldexpd(double v, int n)
; double scalbnd(double v, int n)
;
; assembly module written for MASM/NASM
;
; AUTHOR : Rainer Erdmann
;
; Copyright 2016-2019 Rainer Erdmann
;
; License: see accompanying file license.txt
;
; CHANGES ... |
; SMSQmulator WIN Driver initialisation V1.03 (c) W.Lenerz 2012-2020
; This handles linking in the driver into the OS.
;
; copyright (C) w. Lenerz 2012-2020 published under the SMSQE licence
; v. 1.03 added WIN_REMV
; v. 1.02 data/prog defaults are set
; v. 1.01 implement win_drive & win_drive$
; v. 1.00 device is ca... |
; BeepFX sound effect by shiru
; http://shiru.untergrund.net
SECTION rodata_clib
SECTION rodata_sound_bit
PUBLIC _bfx_40
_bfx_40:
; Select_1
defb 1 ;tone
defw 1,2000,400,0,128
defb 1 ;tone
defw 1,2000,400,0,16
defb 1 ;tone
defw 1,2000,600,0,128
defb 1 ;tone
defw 1,2000,600,0,16
defb ... |
.include "defaults_mod.asm"
table_file_jp equ "exe5-utf8.tbl"
table_file_en equ "bn5-utf8.tbl"
game_code_len equ 3
game_code equ 0x4252424A // BRBJ
game_code_2 equ 0x42524245 // BRBE
game_code_3 equ 0x42524250 // BRBP
card_type equ 1
card_id equ 89
card_no equ "089"
card_sub equ "Mod Card 089"
card_sub_x ... |
ViridianForestEntranceScript:
call EnableAutoTextBoxDrawing
ret
ViridianForestEntranceTextPointers:
dw ViridianForestEntranceText1
dw ViridianForestEntranceText2
ViridianForestEntranceText1:
TX_FAR _ViridianForestEntranceText1
db "@"
ViridianForestEntranceText2:
TX_FAR _ViridianForestEntranceText2
db "@"
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.