file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/7949412.c | #include <stdio.h>
/*This program is to demonstrate:
a. fgets(): safer way to take input string (including white-spaces)
b. fputs(): allows printing to console(stdout) or file
*/
int main()
{
char name[20];
//gets(name);
fgets(name, 18, stdin);
printf("%s", name);
//puts(name);
fputs(name,stdout);
return 0;
} |
the_stack_data/117218.c | #include <stdio.h>
#include <stdlib.h>
#define MAX 10
int l[MAX], ini = 0, fim = 0;
int indiceNaFila (int indice);
void enqueue(int elemento);
int dequeue();
int tamanho();
void imprimir();
void apagar();
int main(void) {
printf("\n");
enqueue(1);
enqueue(2);
enqueue(3);
enqueue(4);
enqueue(5);
enqueue(6);
enqueue(7);
enqueue(8);
enqueue(9);
printf("Indice 11 contem elemento ? -> %d\n", indiceNaFila(11));
printf("Indice 9 contem elemento ? -> %d\n", indiceNaFila(9));
printf("Indice 8 contem elemento ? -> %d\n", indiceNaFila(8));
printf("Indice 3 contem elemento ? -> %d\n", indiceNaFila(3));
printf("Indice 0 contem elemento ? -> %d\n", indiceNaFila(0));
imprimir();
printf("\n");
return 0;
}
int indiceNaFila (int indice) {
if (l[indice]) {return 1;
} else return 0;
}
void enqueue(int elemento){
if ((fim + 1) != ini && !(fim + 1 == MAX && !ini) ){
l[fim] = elemento;
//fim = (fim + 1) % MAX;
fim++;
if (fim == MAX) fim = 0;
}
else
printf("Não foi possível inserir %d. Fila cheia.\n",elemento);
}
int dequeue(){
if (ini != fim) {
int dado = l[ini];
//ini = (ini + 1) % MAX;
ini++;
if (ini == MAX) ini = 0;
return dado;
}
else {
printf("Não há elementos. Fila vazia.\n");
exit(1);
}
}
int tamanho(){
if (ini <= fim)
return fim - ini;
else
return MAX - (ini - fim);
}
void imprimir(){
printf("F[ ");
for (int i = ini ; ; i++) {
if (i == MAX) i = 0;
if (i == fim) break;
printf("%d ",l[i]);
}
printf("]\n");
}
void apagar(){
ini = fim = 0;
} |
the_stack_data/9822.c | #include <stddef.h>
// extern void * malloc(unsigned int);
extern void *mallocN (int n);
int strcspn_kmp(const char * s1, const char * s2, int n1, int n2)
{
int i, j;
int * next = (int *) mallocN (n2 * sizeof (int));
i = 0;
j = -1;
next [0] = -1;
while (i < n2)
{
if (s2[i + 1] == s2[j + 1])
{
i ++;
j ++;
next[i] = j;
}
else
if (j == -1)
{
i ++;
next[i] = -1;
}
else
j = next [j];
}
i = -1;
j = -1;
while (i < n1)
{
if (s1[i + 1] == s2[j + 1])
{
i ++;
j ++;
if (j == n2 - 1)
return i - n2 + 1;
}
else
if (j == -1)
i ++;
else
j = next[j];
}
return -1;
}
|
the_stack_data/40762027.c | // main.c
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
// -----------------------------------------------------------------------------
#ifdef __APPLE__
#include <mach/mach_time.h>
#include <dlfcn.h>
#endif
#if defined(__linux__)
#include <dlfcn.h>
#endif
#if defined(_WIN32)
#define WIN32_LEAN_AND_MEAN
#define NOMINMAX
#include <Windows.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#define REPL_MAIN _TF10repl_swift9repl_mainFT_Si
#if !defined(__has_attribute)
#define __has_attribute(attribute) 0
#endif
#if __has_attribute(__optnone__)
#define SWIFT_REPL_NOOPT __attribute__((__optnone__))
#else
#define SWIFT_REPL_NOOPT
#endif
SWIFT_REPL_NOOPT
int
#if defined(_WIN32)
__declspec(dllexport)
#endif
REPL_MAIN() {
return 0;
}
SWIFT_REPL_NOOPT
#if defined(_WIN32)
int WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nShowCmd) {
#else
int main() {
#endif
#ifdef __APPLE__
// Force loading of libswiftCore.dylib, which is not linked at build time.
// We load the system's libswiftCore, but this is overriden on tests to
// use the just built one by setting DYLD_LIBRARY_PATH.
dlopen("/usr/lib/swift/libswiftCore.dylib", RTLD_LAZY);
#elif defined(__linux__)
dlopen("libswiftCore.so", RTLD_LAZY);
#elif defined(_WIN32)
HMODULE hModule = LoadLibraryW(L"swiftCore.dll");
if (hModule == NULL)
return EXIT_FAILURE;
#endif
#ifdef __APPLE__
// This code will be run when running the REPL. A breakpoint will be set at
// "repl_main" and we will hit that breakpoint and then allow REPL statements
// to be evaluated. Since LLDB allows process control, the user can accidentally
// continue the target:
//
// 1> :c
//
// So to safeguard against this we hit the breakpoint over and over. If the user
// detaches:
//
// 1> :process detach
//
// we want this program to exit without consuming 100% CPU, so we detect any loops
// that take less than 100us and if we get three of them in a row, we exit.
struct mach_timebase_info TimebaseInfo;
mach_timebase_info(&TimebaseInfo);
int SubsequentShort = 0;
while (SubsequentShort < 3) {
const uint64_t Start = mach_absolute_time();
REPL_MAIN();
const uint64_t End = mach_absolute_time();
const uint64_t ElapsedTicks = End - Start;
const uint64_t ElapsedNano = (ElapsedTicks * (uint64_t)(TimebaseInfo.numer)) / (uint64_t)(TimebaseInfo.denom);
if (ElapsedNano < 100000) {
SubsequentShort += 1;
} else {
SubsequentShort = 0;
}
}
#else
return REPL_MAIN();
#endif
}
|
the_stack_data/1221066.c | // TODO: Add copyright
#include <stdio.h>
int main() {
// TODO: Add proper line ending
printf("Hello World!");
putc(10, stdout); // hack
return 1; // FIXME: Change this to return success
}
|
the_stack_data/39367.c | #include <stdio.h>
#include <stdlib.h>
int main (void)
{
// var declration
int num1, i;
// user interface
// get signed value
printf("Input N: ");
scanf("%d", &num1);
for (i = 1; i <= num1;i++)
{
printf("%d",i);
if (i<num1)
{
printf(",");
}
}
// wait for any input
getch();
return 0;
} |
the_stack_data/116190.c | /*Program : Challenge1
* Deskripsi : Challenge1
* Nama : Muhammad Azhar Alauddin
* tanggal/ versi : 12 Januari 2020
*/
#include <stdio.h>
int main(){
//kamus data
char sandi[255];
int i,batas;
//algoritma
scanf("%[^\n]s",sandi);
for(batas=0;sandi[batas];batas++);
for(i=0;i<batas;i++){
if(sandi[i] == 'a' || sandi[i] == 'A'){
if(sandi[i-1] == 'b' || sandi[i-1] == 'B' || sandi[i-1] == 'c' || sandi[i-1] == 'C'){
printf("-1 ");
}
if(i==batas-1){
printf("1");
}
else {
printf("1 ");
}
}
else if(sandi[i] == 'b' || sandi[i] == 'B'){
if(sandi[i-1] == 'a' || sandi[i-1] == 'A' || sandi[i-1] == 'c' || sandi[i-1] == 'C'){
printf("-1 ");
}
if(i==batas-1){
printf("1 1");
}
else {
printf("1 1 ");
}
}
else if(sandi[i] == 'c' || sandi[i] == 'C'){
if(sandi[i-1] == 'b' || sandi[i-1] == 'B' || sandi[i-1] == 'a' || sandi[i-1] == 'A'){
printf("-1 ");
}
if(i==batas-1){
printf("1 1 1");
}
else {
printf("1 1 1 ");
}
}
else if(sandi[i] == 'd' || sandi[i] == 'D'){
if(sandi[i-1] == 'e' || sandi[i-1] == 'E' || sandi[i-1] == 'f' || sandi[i-1] == 'F'){
printf("-1 ");
}
if(i==batas-1){
printf("2");
}
else {
printf("2 ");
}
}
else if(sandi[i] == 'e' || sandi[i] == 'E'){
if(sandi[i-1] == 'd' || sandi[i-1] == 'D' || sandi[i-1] == 'f' || sandi[i-1] == 'F'){
printf("-1 ");
}
if(i==batas-1){
printf("2 2");
}
else {
printf("2 2 ");
}
}
else if(sandi[i] == 'f' || sandi[i] == 'F'){
if(sandi[i-1] == 'e' || sandi[i-1] == 'F' || sandi[i-1] == 'd' || sandi[i-1] == 'D'){
printf("-1 ");
}
if(i==batas-1){
printf("2 2 2");
}
else {
printf("2 2 2 ");
}
}
else if(sandi[i] == 'g' || sandi[i] == 'G'){
if(sandi[i-1] == 'h' || sandi[i-1] == 'H' || sandi[i-1] == 'i' || sandi[i-1] == 'I'){
printf("-1 ");
}
if(i==batas-1){
printf("3");
}
else {
printf("3 ");
}
}
else if(sandi[i] == 'h' || sandi[i] == 'H'){
if(sandi[i-1] == 'g' || sandi[i-1] == 'G' || sandi[i-1] == 'i' || sandi[i-1] == 'I'){
printf("-1 ");
}
if(i==batas-1){
printf("3 3");
}
else {
printf("3 3 ");
}
}
else if(sandi[i] == 'i' || sandi[i] == 'I'){
if(sandi[i-1] == 'g' || sandi[i-1] == 'G' || sandi[i-1] == 'h' || sandi[i-1] == 'H'){
printf("-1 ");
}
if(i==batas-1){
printf("3 3 3");
}
else {
printf("3 3 3 ");
}
}
else if(sandi[i] == 'j' || sandi[i] == 'J'){
if(sandi[i-1] == 'k' || sandi[i-1] == 'K' || sandi[i-1] == 'l' || sandi[i-1] == 'L'){
printf("-1 ");
}
if(i==batas-1){
printf("4");
}
else {
printf("4 ");
}
}
else if(sandi[i] == 'k' || sandi[i] == 'K'){
if(sandi[i-1] == 'j' || sandi[i-1] == 'J' || sandi[i-1] == 'l' || sandi[i-1] == 'L'){
printf("-1 ");
}
if(i==batas-1){
printf("4 4");
}
else {
printf("4 4 ");
}
}
else if(sandi[i] == 'l' || sandi[i] == 'L'){
if(sandi[i-1] == 'j' || sandi[i-1] == 'J' || sandi[i-1] == 'k' || sandi[i-1] == 'K'){
printf("-1 ");
}
if(i==batas-1){
printf("4 4 4");
}
else {
printf("4 4 4 ");
}
}
else if(sandi[i] == 'm' || sandi[i] == 'M'){
if(sandi[i-1] == 'n' || sandi[i-1] == 'N' || sandi[i-1] == 'o' || sandi[i-1] == 'O'){
printf("-1 ");
}
if(i==batas-1){
printf("5");
}
else {
printf("5 ");
}
}
else if(sandi[i] == 'n' || sandi[i] == 'N'){
if(sandi[i-1] == 'm' || sandi[i-1] == 'M' || sandi[i-1] == 'o' || sandi[i-1] == 'O'){
printf("-1 ");
}
if(i==batas-1){
printf("5 5");
}
else {
printf("5 5 ");
}
}
else if(sandi[i] == 'o' || sandi[i] == 'O'){
if(sandi[i-1] == 'm' || sandi[i-1] == 'M' || sandi[i-1] == 'n' || sandi[i-1] == 'N'){
printf("-1 ");
}
if(i==batas-1){
printf("5 5 5");
}
else {
printf("5 5 5 ");
}
}
else if(sandi[i] == 'p' || sandi[i] == 'P'){
if(sandi[i-1] == 'q' || sandi[i-1] == 'Q' || sandi[i-1] == 'r' || sandi[i-1] == 'R'){
printf("-1 ");
}
if(i==batas-1){
printf("6");
}
else {
printf("6 ");
}
}
else if(sandi[i] == 'q' || sandi[i] == 'Q'){
if(sandi[i-1] == 'p' || sandi[i-1] == 'P' || sandi[i-1] == 'r' || sandi[i-1] == 'R'){
printf("-1 ");
}
if(i==batas-1){
printf("6 6");
}
else {
printf("6 6 ");
}
}
else if(sandi[i] == 'r' || sandi[i] == 'R'){
if(sandi[i-1] == 'p' || sandi[i-1] == 'P' || sandi[i-1] == 'q' || sandi[i-1] == 'Q'){
printf("-1 ");
}
if(i==batas-1){
printf("6 6 6");
}
else {
printf("6 6 6 ");
}
}
else if(sandi[i] == 's' || sandi[i] == 'S'){
if(sandi[i-1] == 't' || sandi[i-1] == 'T' || sandi[i-1] == 'u' || sandi[i-1] == 'U'){
printf("-1 ");
}
if(i==batas-1){
printf("7");
}
else {
printf("7 ");
}
}
else if(sandi[i] == 't' || sandi[i] == 'T'){
if(sandi[i-1] == 's' || sandi[i-1] == 'S' || sandi[i-1] == 'u' || sandi[i-1] == 'U'){
printf("-1 ");
}
if(i==batas-1){
printf("7 7");
}
else {
printf("7 7 ");
}
}
else if(sandi[i] == 'u' || sandi[i] == 'U'){
if(sandi[i-1] == 's' || sandi[i-1] == 'S' || sandi[i-1] == 't' || sandi[i-1] == 'T'){
printf("-1 ");
}
if(i==batas-1){
printf("7 7 7");
}
else {
printf("7 7 7 ");
}
}
else if(sandi[i] == 'v' || sandi[i] == 'V'){
if(sandi[i-1] == 'w' || sandi[i-1] == 'W' || sandi[i-1] == 'x' || sandi[i-1] == 'X'){
printf("-1 ");
}
if(i==batas-1){
printf("8");
}
else {
printf("8 ");
}
}
else if(sandi[i] == 'w' || sandi[i] == 'W'){
if(sandi[i-1] == 'x' || sandi[i-1] == 'X' || sandi[i-1] == 'v' || sandi[i-1] == 'V'){
printf("-1 ");
}
if(i==batas-1){
printf("8 8");
}
else {
printf("8 8 ");
}
}
else if(sandi[i] == 'x' || sandi[i] == 'X'){
if(sandi[i-1] == 'v' || sandi[i-1] == 'V' || sandi[i-1] == 'w' || sandi[i-1] == 'W'){
printf("-1 ");
}
if(i==batas-1){
printf("8 8 8");
}
else {
printf("8 8 8 ");
}
}
else if(sandi[i] == 'y' || sandi[i] == 'Y'){
if(sandi[i-1] == 'z' || sandi[i-1] == 'Z'){
printf("-1 ");
}
if(i==batas-1){
printf("9");
}
else {
printf("9 ");
}
}
else if(sandi[i] == 'z' || sandi[i] == 'Z'){
if(sandi[i-1] == 'y' || sandi[i-1] == 'Y'){
printf("-1 ");
}
if(i==batas-1){
printf("9 9");
}
else {
printf("9 9 ");
}
}
else if(sandi[i] == ' '){
if(i==batas-1){
printf("0");
}
else {
printf("0 ");
}
}
}
return 0;
}
|
the_stack_data/596534.c | /*************************************************************************
> File Name: sv.c
> Author:
> Mail:
> Created Time: Sun 16 Jan 2022 06:17:16 AM PST
************************************************************************/
#include <stdio.h>
#include <sys/types.h>
#include <sys/dir.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <unistd.h>
#include <strings.h>
#include <stdlib.h>
char *progname;
// save file in dir
void sv(char *file, char *dir) {
struct stat sti, sto;
int fin, fout, n;
char target[BUFSIZ], buf[BUFSIZ], *index();
sprintf(target, "%s/%s", dir, file);
if (index(file, '/') != NULL) {
printf("won't handle in %s", file);
exit(1);
}
if (stat(file, &sti) == -1) {
printf("can't stat %s", file);
exit(1);
}
if (stat(target, &sto) == -1) {
sto.st_mtime = 0;
}
if (sti.st_mtime < sto.st_mtime) {
printf("stderr %s: %s not copied\n", progname, file);
exit(1);
}
else if ((fin = open(file, 0)) == -1) {
printf("can't open file %s", file);
exit(1);
}
else if ((fout = creat(target, sti.st_mode)) == -1) {
printf("can't create %s", target);
// printf("target is %s, st_mode is %o", target, sti.st_mode);
exit(1);
}
else {
while ((n = read(fin, buf, sizeof(buf))) > 0) {
if (write(fout, buf, n) != n) {
printf("printf writing %s", target);
}
}
}
close(fin);
close(fout);
}
int main(int argc, char** argv){
struct stat stbuf;
char* dir = argv[argc-1];
char* progname = argv[0];
if (argc <= 2) {
printf("Usage: %s files...dir", progname);
}
if (stat(dir, &stbuf) == -1) {
printf("can't access directory %s", dir);
}
if ((stbuf.st_mode & S_IFMT) != S_IFDIR) {
printf("%s is not a directory", dir);
}
for (int i=1; i < argc-1; i++) {
sv(argv[i], dir);
}
return 0;
}
|
the_stack_data/25137139.c | int main(int argc, char *argv[])
{
unsigned char input[16] = {0};
unsigned char data[16] = {0};
klee_make_symbolic(input, 16, "input");
data[3] = input[0];
input[0] = input[13];
input[13] = data[3];
data[3] = input[1];
input[1] = input[7];
input[7] = data[3];
data[3] = input[2];
input[2] = input[10];
input[10] = data[3];
data[3] = input[5];
input[5] = input[10];
input[10] = data[3];
data[3] = input[6];
input[6] = input[14];
input[14] = data[3];
data[3] = input[7];
input[7] = input[15];
input[15] = data[3];
data[3] = input[9];
input[9] = input[14];
input[14] = data[3];
data[3] = input[10];
input[10] = input[15];
input[15] = data[3];
data[3] = input[12];
input[12] = input[14];
input[14] = data[3];
data[3] = input[13];
input[13] = input[15];
input[15] = data[3];
data[3] = input[14];
input[14] = input[15];
input[15] = data[3];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 110;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 115;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 95;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 144;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 92;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 206;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 205;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 111;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 233;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 166;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 41;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 60;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 20;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 223;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 247;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
data[2] = 0;
data[3] = 0;
data[8] = input[0];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[1];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[2];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[3];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[4];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[5];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[6];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[7];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[9];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[10];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[11];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[12];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[13];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[14];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[3] = 0;
data[8] = input[15];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[8] = data[8] + data[8];
data[3] = data[3] + data[8];
data[8] = data[8] + data[8];
data[2] = data[2] + data[3];
data[0] = data[2] + 80;
data[4] = (data[0] != 0);;
data[15] = data[15] + data[4];
klee_assert(data[15]);
return 0;
}
|
the_stack_data/108354.c | #include <stdio.h>
int isLeapYear(int year)
{
int leap;
if ((year%4==0 && year%100!=0) || year%400==0) {
leap=1;
}
else{
leap=0;
}
return leap;
}
void main()
{
int inyear,inmonth,out=0,leap;
printf("--How Many Days In a Particular Month of Year--\n\n");
printf("Please input - year/month: ");
scanf("%d/%d",&inyear,&inmonth);
switch (isLeapYear(inyear)) {
case 0:
leap=0;
break;
case 1:
leap=1;
break;
}
switch (inmonth) {
case 4:
case 6:
case 9:
case 11: out=30; break;
case 2:
if(leap==1){
out=29;
} else {
out=28;
} break;
default: out=31; break;
}
printf("\n\n\nThe month (of year) you entered have %d days.\n\nThank you for using this program\n\n",out);
}
|
the_stack_data/86075323.c | #include <pthread.h>
#include <stdio.h>
#include <unistd.h>
void* runner(void*);
int res = 0;
#ifdef __CLASSIC_C__
int main()
{
int ac;
char* av[];
#else
int main(int ac, char* av[])
{
#endif
pthread_t tid[2];
pthread_create(&tid[0], 0, runner, (void*)1);
pthread_create(&tid[1], 0, runner, (void*)2);
#if defined(__BEOS__) && !defined(__ZETA__) /* (no usleep on BeOS 5.) */
usleep(1); /* for strange behavior on single-processor sun */
#endif
pthread_join(tid[0], 0);
pthread_join(tid[1], 0);
if (ac > 1000) {
return *av[0];
}
return res;
}
void* runner(void* args)
{
int cc;
for (cc = 0; cc < 10; cc++) {
printf("%p CC: %d\n", args, cc);
}
res++;
return 0;
}
|
the_stack_data/178266386.c | #include <stdio.h>
#include <string.h>
int main()
{
int c;
int count = 1;
int largest = 0;
int smallest = 0;
int res;
while( ( res = scanf("%d", &c) ) != EOF)
{
//check if it is a int or not
if (res != 1){
printf("corrupt input\n");
break;
}
//update largest/smallest if len = 1
else if (count == 1){
smallest = c;
largest = c;
count++;
}
//update largest
else if (largest < c){
largest = c;
count++;
}
//update smallest
else if (smallest > c){
smallest = c;
count++;
}
}
printf("%d %d are smallest and largest \n", smallest, largest);
return 0;
}
|
the_stack_data/248581554.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
int n, a,b;
scanf("%d", &n);
while(n!=0)
{
scanf("%d %d", &a, &b);
printf("%d cm2\n", (a*b)/2);
n--;
}
return 0;
}
|
the_stack_data/153268023.c |
int symbol_from_bar() {
return 0;
}
|
the_stack_data/165769351.c | #include <math.h>
#include <stdio.h>
int main(void) {
double x = -12345.1234567;
double rez1 = fabsf(x);
double rez2 = fabs(x);
printf("%14.7lf\n", rez1);
printf("%14.7lf\n", rez2);
return 0;
} |
the_stack_data/876711.c | #include <stdio.h>
int main(){
printf("%d\n", EOF);
return 0;
}
|
the_stack_data/182103.c | #include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
extern int h_errno;
int main(int argc, char **argv)
{
char *ptr, **pptr;
char str[INET_ADDRSTRLEN];
struct hostent *hptr;
while (--argc> 0)
{
ptr = *++argv;
if ( (hptr = gethostbyname (ptr) ) == NULL)
{
printf("gethostbyname error for host: %s: %s",ptr, hstrerror (h_errno) );
continue;
}
printf ("official hostname: %s\n", hptr->h_name);
for (pptr=hptr->h_aliases; *pptr!= NULL; pptr++)
printf ("\talias: %s\n", *pptr);
switch (hptr->h_addrtype)
{
case AF_INET:
pptr = hptr->h_addr_list;
for ( ; *pptr != NULL; pptr++)
printf ("\taddress: %s\n",inet_ntop (hptr->h_addrtype, *pptr, str, sizeof (str)));
break;
default:
printf("unknown address type");
break;
}
}
exit(0);
}
|
the_stack_data/26700315.c | /* nostt.c - Copyright (c) 2018, Sijmen J. Mulder (see LICENSE.md) */
#include <sys/stat.h> /* mkfifo */
#include <stdio.h>
#include <unistd.h>
#include <fcntl.h>
#include <err.h>
#define NAME "popen"
#define VERSION "1.0-alpha"
const char usage[] =
"usage: " NAME " [-V] command [argument ...]\n";
int
main(int argc, char **argv) {
int opt;
char *path;
int fd;
while ((opt = getopt(argc, argv, "V")) != -1) {
switch (opt) {
case 'V':
puts(NAME " " VERSION);
return 0;
default:
return 1;
}
}
if (argc == optind) {
fputs(usage, stderr);
return 1;
}
if (!(path = tmpnam(NULL)))
err(1, NULL);
puts(path);
fclose(stdout); /* unblock the shell */
switch (fork()) {
case -1:
err(1, NULL);
case 0:
if (mkfifo(path, 0600) == -1)
err(1, NULL);
if ((fd = open(path, O_WRONLY)) == -1)
err(1, NULL);
if (dup2(fd, STDOUT_FILENO) == -1)
err(1, NULL);
execvp(argv[optind], &argv[optind]);
err(1, NULL);
default:
return 0;
}
}
|
the_stack_data/225144435.c | /*
* Задание 2. Вариант 1.
* Дана последовательность, заканчивающаяся 0.
* Определить числа, являющиеся числами Фибоначчи.
* Вывести максимальное.
*/
#include <stdio.h>
#define N 5000
#define SUCCESS 0
#define INPUT_ERROR -1
int fib(int a)
{
int x1 = 1, x2 = 1;
while (x1 < a)
{
int temp = x1;
x1 = x1 + x2;
x2 = temp;
}
return a == x1;
}
int main(void)
{
int a = 1;
int arr[N];
int n = 0;
printf("Введите последовательность, заканчивающююся 0: ");
while (1)
{
if (scanf("%d", &a) != 1)
{
printf("Некорректный ввод!");
return INPUT_ERROR;
}
if (a == 0)
break;
arr[n] = a;
n++;
}
int num_fib[N];
int n_fib = 0;
for (int i =0; i < n; i++)
if (fib(arr[i]))
{
num_fib[n_fib] = arr[i];
n_fib++;
}
int max_fib = 0;
for (int i = 0; i < n_fib; i++)
{
if (max_fib < num_fib[i])
max_fib = num_fib[i];
}
printf("\n");
for (int i = 0; i < n_fib; i++)
printf("%d ", num_fib[i]);
printf("\n%d", max_fib);
return SUCCESS;
}
|
the_stack_data/145303.c | #include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <limits.h>
char *__progname;
void usage(void);
int
main(int argc, char *argv[])
{
int ch;
char domainname[HOST_NAME_MAX+1];
while ((ch = getopt(argc, argv, "")) != -1)
switch (ch) {
default:
usage();
}
argc -= optind;
argv += optind;
if (argc > 1)
usage();
if (*argv) {
if (setdomainname(*argv, strlen(*argv)))
err(1, "setdomainname");
} else {
if (getdomainname(domainname, sizeof(domainname)))
err(1, "getdomainname");
(void)printf("%s\n", domainname);
}
return(0);
}
void usage(void)
{
(void)fprintf(stderr, "usage: %s [name-of-domain]\n", __progname);
exit(1);
}
|
the_stack_data/162445.c | /**************************************************************************************************
* *
* This file is part of BLASFEO. *
* *
* BLASFEO -- BLAS For Embedded Optimization. *
* Copyright (C) 2019 by Gianluca Frison. *
* Developed at IMTEK (University of Freiburg) under the supervision of Moritz Diehl. *
* All rights reserved. *
* *
* The 2-Clause BSD License *
* *
* Redistribution and use in source and binary forms, with or without *
* modification, are permitted provided that the following conditions are met: *
* *
* 1. Redistributions of source code must retain the above copyright notice, this *
* list of conditions and the following disclaimer. *
* 2. Redistributions in binary form must reproduce the above copyright notice, *
* this list of conditions and the following disclaimer in the documentation *
* and/or other materials provided with the distribution. *
* *
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND *
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED *
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE *
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR *
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES *
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; *
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND *
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT *
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
* *
* Author: Gianluca Frison, gianluca.frison (at) imtek.uni-freiburg.de *
* *
**************************************************************************************************/
#if defined(LA_HIGH_PERFORMANCE)
// create a matrix structure for a matrix of size m*n by dynamically allocating the memory
void ALLOCATE_STRMAT(int m, int n, struct STRMAT *sA)
{
const int ps = PS;
int nc = D_NC;
int al = ps*nc;
sA->m = m;
sA->n = n;
int pm = (m+ps-1)/ps*ps;
int cn = (n+nc-1)/nc*nc;
sA->pm = pm;
sA->cn = cn;
ZEROS_ALIGN(&(sA->pA), sA->pm, sA->cn);
int tmp = m<n ? (m+al-1)/al*al : (n+al-1)/al*al; // al(min(m,n)) // XXX max ???
ZEROS_ALIGN(&(sA->dA), tmp, 1);
sA->use_dA = 0;
sA->memsize = (pm*cn+tmp)*sizeof(REAL);
return;
}
// free memory of a matrix structure
void FREE_STRMAT(struct STRMAT *sA)
{
// invalidate stored inverse diagonal
sA->use_dA = 0;
FREE_ALIGN(sA->pA);
FREE_ALIGN(sA->dA);
return;
}
// create a vector structure for a vector of size m by dynamically allocating the memory
void ALLOCATE_STRVEC(int m, struct STRVEC *sa)
{
const int ps = PS;
// int nc = D_NC;
// int al = ps*nc;
sa->m = m;
int pm = (m+ps-1)/ps*ps;
sa->pm = pm;
ZEROS_ALIGN(&(sa->pa), sa->pm, 1);
sa->memsize = pm*sizeof(REAL);
return;
}
// free memory of a matrix structure
void FREE_STRVEC(struct STRVEC *sa)
{
FREE_ALIGN(sa->pa);
return;
}
// print a matrix structure
void PRINT_STRMAT(int m, int n, struct STRMAT *sA, int ai, int aj)
{
const int ps = PS;
int sda = sA->cn;
REAL *pA = sA->pA + aj*ps + ai/ps*ps*sda + ai%ps;
int ii, i, j, tmp;
ii = 0;
if(ai%ps>0)
{
tmp = ps-ai%ps;
tmp = m<tmp ? m : tmp;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
printf("%9.5f ", pA[i+ps*j]);
}
printf("\n");
}
pA += tmp + ps*(sda-1);
m -= tmp;
}
for( ; ii<m-(ps-1); ii+=ps)
{
for(i=0; i<ps; i++)
{
for(j=0; j<n; j++)
{
printf("%9.5f ", pA[i+ps*j+sda*ii]);
}
printf("\n");
}
}
if(ii<m)
{
tmp = m-ii;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
printf("%9.5f ", pA[i+ps*j+sda*ii]);
}
printf("\n");
}
}
printf("\n");
return;
}
// print the transposed of a matrix structure
void PRINT_TRAN_STRMAT(int m, int n, struct STRMAT *sA, int ai, int aj)
{
const int ps = PS;
int sda = sA->cn;
REAL *pA = sA->pA + aj*ps + ai/ps*ps*sda + ai%ps;
int ii, i, j, tmp;
REAL *pA_bkp = pA;
int m_bkp = m;
ii = 0;
for(j=0; j<n; j++)
{
if(ai%ps>0)
{
pA = pA_bkp;
m = m_bkp;
tmp = ps-ai%ps;
tmp = m<tmp ? m : tmp;
for(i=0; i<tmp; i++)
{
printf("%9.5f ", pA[i+ps*j]);
}
pA += tmp + ps*(sda-1);
m -= tmp;
}
for( ; ii<m-(ps-1); ii+=ps)
{
for(i=0; i<ps; i++)
{
printf("%9.5f ", pA[i+ps*j+sda*ii]);
}
}
if(ii<m)
{
tmp = m-ii;
for(i=0; i<tmp; i++)
{
printf("%9.5f ", pA[i+ps*j+sda*ii]);
}
}
printf("\n");
}
printf("\n");
return;
}
// print a vector structure
void PRINT_STRVEC(int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_MAT(m, 1, pa, m);
return;
}
// print the transposed of a vector structure
void PRINT_TRAN_STRVEC(int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_MAT(1, m, pa, 1);
return;
}
// print a matrix structure
void PRINT_TO_FILE_STRMAT(FILE * file, int m, int n, struct STRMAT *sA, int ai, int aj)
{
const int ps = PS;
int sda = sA->cn;
REAL *pA = sA->pA + aj*ps + ai/ps*ps*sda + ai%ps;
int ii, i, j, tmp;
ii = 0;
if(ai%ps>0)
{
tmp = ps-ai%ps;
tmp = m<tmp ? m : tmp;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
fprintf(file, "%9.5f ", pA[i+ps*j]);
}
fprintf(file, "\n");
}
pA += tmp + ps*(sda-1);
m -= tmp;
}
for( ; ii<m-(ps-1); ii+=ps)
{
for(i=0; i<ps; i++)
{
for(j=0; j<n; j++)
{
fprintf(file, "%9.5f ", pA[i+ps*j+sda*ii]);
}
fprintf(file, "\n");
}
}
if(ii<m)
{
tmp = m-ii;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
fprintf(file, "%9.5f ", pA[i+ps*j+sda*ii]);
}
fprintf(file, "\n");
}
}
fprintf(file, "\n");
return;
}
// print a matrix structure
void PRINT_TO_FILE_EXP_STRMAT(FILE * file, int m, int n, struct STRMAT *sA, int ai, int aj)
{
const int ps = PS;
int sda = sA->cn;
REAL *pA = sA->pA + aj*ps + ai/ps*ps*sda + ai%ps;
int ii, i, j, tmp;
ii = 0;
if(ai%ps>0)
{
tmp = ps-ai%ps;
tmp = m<tmp ? m : tmp;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
fprintf(file, "%9.5e ", pA[i+ps*j]);
}
fprintf(file, "\n");
}
pA += tmp + ps*(sda-1);
m -= tmp;
}
for( ; ii<m-(ps-1); ii+=ps)
{
for(i=0; i<ps; i++)
{
for(j=0; j<n; j++)
{
fprintf(file, "%9.5e ", pA[i+ps*j+sda*ii]);
}
fprintf(file, "\n");
}
}
if(ii<m)
{
tmp = m-ii;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
fprintf(file, "%9.5e ", pA[i+ps*j+sda*ii]);
}
fprintf(file, "\n");
}
}
fprintf(file, "\n");
return;
}
// print a matrix structure
void PRINT_TO_STRING_STRMAT(char **buf_out, int m, int n, struct STRMAT *sA, int ai, int aj)
{
const int ps = PS;
int sda = sA->cn;
REAL *pA = sA->pA + aj*ps + ai/ps*ps*sda + ai%ps;
int ii, i, j, tmp;
ii = 0;
if(ai%ps>0)
{
tmp = ps-ai%ps;
tmp = m<tmp ? m : tmp;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
*buf_out += sprintf(*buf_out, "%9.5f ", pA[i+ps*j]);
}
*buf_out += sprintf(*buf_out, "\n");
}
pA += tmp + ps*(sda-1);
m -= tmp;
}
for( ; ii<m-(ps-1); ii+=ps)
{
for(i=0; i<ps; i++)
{
for(j=0; j<n; j++)
{
*buf_out += sprintf(*buf_out, "%9.5f ", pA[i+ps*j+sda*ii]);
}
*buf_out += sprintf(*buf_out, "\n");
}
}
if(ii<m)
{
tmp = m-ii;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
*buf_out += sprintf(*buf_out, "%9.5f ", pA[i+ps*j+sda*ii]);
}
*buf_out += sprintf(*buf_out, "\n");
}
}
*buf_out += sprintf(*buf_out, "\n");
return;
}
// print a vector structure
void PRINT_TO_FILE_STRVEC(FILE * file, int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_TO_FILE_MAT(file, m, 1, pa, m);
return;
}
// print a vector structure
void PRINT_TO_STRING_STRVEC(char **buf_out, int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_TO_STRING_MAT(buf_out, m, 1, pa, m);
return;
}
// print the transposed of a vector structure
void PRINT_TO_FILE_TRAN_STRVEC(FILE * file, int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_TO_FILE_MAT(file, 1, m, pa, 1);
return;
}
// print the transposed of a vector structure
void PRINT_TO_STRING_TRAN_STRVEC(char **buf_out, int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_TO_STRING_MAT(buf_out, 1, m, pa, 1);
return;
}
// print a matrix structure
void PRINT_EXP_STRMAT(int m, int n, struct STRMAT *sA, int ai, int aj)
{
const int ps = PS;
int sda = sA->cn;
REAL *pA = sA->pA + aj*ps + ai/ps*ps*sda + ai%ps;
int ii, i, j, tmp;
ii = 0;
if(ai%ps>0)
{
tmp = ps-ai%ps;
tmp = m<tmp ? m : tmp;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
printf("%e\t", pA[i+ps*j]);
}
printf("\n");
}
pA += tmp + ps*(sda-1);
m -= tmp;
}
for( ; ii<m-(ps-1); ii+=ps)
{
for(i=0; i<ps; i++)
{
for(j=0; j<n; j++)
{
printf("%e\t", pA[i+ps*j+sda*ii]);
}
printf("\n");
}
}
if(ii<m)
{
tmp = m-ii;
for(i=0; i<tmp; i++)
{
for(j=0; j<n; j++)
{
printf("%e\t", pA[i+ps*j+sda*ii]);
}
printf("\n");
}
}
printf("\n");
return;
}
// print a vector structure
void PRINT_EXP_STRVEC(int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_EXP_MAT(m, 1, pa, m);
return;
}
// print the transposed of a vector structure
void PRINT_EXP_TRAN_STRVEC(int m, struct STRVEC *sa, int ai)
{
REAL *pa = sa->pa + ai;
PRINT_EXP_MAT(1, m, pa, 1);
return;
}
#endif
|
the_stack_data/322617.c | /* This file was automatically generated by CasADi.
The CasADi copyright holders make no ownership claim of its contents. */
#ifdef __cplusplus
extern "C" {
#endif
/* How to prefix internal symbols */
#ifdef CODEGEN_PREFIX
#define NAMESPACE_CONCAT(NS, ID) _NAMESPACE_CONCAT(NS, ID)
#define _NAMESPACE_CONCAT(NS, ID) NS ## ID
#define CASADI_PREFIX(ID) NAMESPACE_CONCAT(CODEGEN_PREFIX, ID)
#else
#define CASADI_PREFIX(ID) pendulum_dae_dyn_gnsf_get_matrices_fun_ ## ID
#endif
#include <math.h>
#ifndef casadi_real
#define casadi_real double
#endif
#ifndef casadi_int
#define casadi_int int
#endif
/* Add prefix to internal symbols */
#define casadi_f0 CASADI_PREFIX(f0)
#define casadi_s0 CASADI_PREFIX(s0)
#define casadi_s1 CASADI_PREFIX(s1)
#define casadi_s2 CASADI_PREFIX(s2)
#define casadi_s3 CASADI_PREFIX(s3)
#define casadi_s4 CASADI_PREFIX(s4)
#define casadi_s5 CASADI_PREFIX(s5)
#define casadi_s6 CASADI_PREFIX(s6)
#define casadi_s7 CASADI_PREFIX(s7)
#define casadi_s8 CASADI_PREFIX(s8)
/* Symbol visibility in DLLs */
#ifndef CASADI_SYMBOL_EXPORT
#if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
#if defined(STATIC_LINKED)
#define CASADI_SYMBOL_EXPORT
#else
#define CASADI_SYMBOL_EXPORT __declspec(dllexport)
#endif
#elif defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
#define CASADI_SYMBOL_EXPORT __attribute__ ((visibility ("default")))
#else
#define CASADI_SYMBOL_EXPORT
#endif
#endif
static const casadi_int casadi_s0[5] = {1, 1, 0, 1, 0};
static const casadi_int casadi_s1[58] = {10, 5, 0, 10, 20, 30, 40, 50, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s2[14] = {10, 1, 0, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s3[36] = {10, 3, 0, 10, 20, 30, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s4[113] = {10, 10, 0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s5[48] = {8, 5, 0, 8, 16, 24, 32, 40, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7};
static const casadi_int casadi_s6[4] = {0, 1, 0, 0};
static const casadi_int casadi_s7[15] = {1, 6, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 0, 0, 0};
static const casadi_int casadi_s8[13] = {1, 5, 0, 1, 2, 3, 4, 5, 0, 0, 0, 0, 0};
/* pendulum_dae_dyn_gnsf_get_matrices_fun:(i0)->(o0[10x5],o1[10],o2[10x3],o3[10x10],o4[8x5],o5[8x5],o6[8x5],o7[0],o8,o9[10],o10,o11,o12,o13,o14[1x6],o15[1x5],o16) */
static int casadi_f0(const casadi_real** arg, casadi_real** res, casadi_int* iw, casadi_real* w, void* mem) {
casadi_real a0, a1, a2, a3, a4;
a0=0.;
if (res[0]!=0) res[0][0]=a0;
if (res[0]!=0) res[0][1]=a0;
if (res[0]!=0) res[0][2]=a0;
if (res[0]!=0) res[0][3]=a0;
if (res[0]!=0) res[0][4]=a0;
if (res[0]!=0) res[0][5]=a0;
if (res[0]!=0) res[0][6]=a0;
if (res[0]!=0) res[0][7]=a0;
if (res[0]!=0) res[0][8]=a0;
if (res[0]!=0) res[0][9]=a0;
if (res[0]!=0) res[0][10]=a0;
if (res[0]!=0) res[0][11]=a0;
if (res[0]!=0) res[0][12]=a0;
if (res[0]!=0) res[0][13]=a0;
if (res[0]!=0) res[0][14]=a0;
if (res[0]!=0) res[0][15]=a0;
if (res[0]!=0) res[0][16]=a0;
if (res[0]!=0) res[0][17]=a0;
if (res[0]!=0) res[0][18]=a0;
if (res[0]!=0) res[0][19]=a0;
a1=-1.;
if (res[0]!=0) res[0][20]=a1;
if (res[0]!=0) res[0][21]=a0;
if (res[0]!=0) res[0][22]=a0;
if (res[0]!=0) res[0][23]=a0;
if (res[0]!=0) res[0][24]=a0;
if (res[0]!=0) res[0][25]=a0;
if (res[0]!=0) res[0][26]=a0;
if (res[0]!=0) res[0][27]=a0;
if (res[0]!=0) res[0][28]=a0;
if (res[0]!=0) res[0][29]=a0;
if (res[0]!=0) res[0][30]=a0;
if (res[0]!=0) res[0][31]=a1;
if (res[0]!=0) res[0][32]=a0;
if (res[0]!=0) res[0][33]=a0;
if (res[0]!=0) res[0][34]=a0;
if (res[0]!=0) res[0][35]=a0;
if (res[0]!=0) res[0][36]=a0;
if (res[0]!=0) res[0][37]=a0;
if (res[0]!=0) res[0][38]=a0;
if (res[0]!=0) res[0][39]=a0;
if (res[0]!=0) res[0][40]=a0;
if (res[0]!=0) res[0][41]=a0;
if (res[0]!=0) res[0][42]=a0;
if (res[0]!=0) res[0][43]=a0;
if (res[0]!=0) res[0][44]=a0;
if (res[0]!=0) res[0][45]=a0;
if (res[0]!=0) res[0][46]=a0;
if (res[0]!=0) res[0][47]=a0;
if (res[0]!=0) res[0][48]=a0;
if (res[0]!=0) res[0][49]=a0;
if (res[1]!=0) res[1][0]=a0;
if (res[1]!=0) res[1][1]=a0;
if (res[1]!=0) res[1][2]=a0;
if (res[1]!=0) res[1][3]=a0;
if (res[1]!=0) res[1][4]=a0;
if (res[1]!=0) res[1][5]=a0;
if (res[1]!=0) res[1][6]=a0;
if (res[1]!=0) res[1][7]=a1;
if (res[1]!=0) res[1][8]=a0;
if (res[1]!=0) res[1][9]=a0;
if (res[2]!=0) res[2][0]=a0;
if (res[2]!=0) res[2][1]=a0;
if (res[2]!=0) res[2][2]=a0;
if (res[2]!=0) res[2][3]=a0;
if (res[2]!=0) res[2][4]=a0;
if (res[2]!=0) res[2][5]=a0;
if (res[2]!=0) res[2][6]=a0;
a2=1.;
if (res[2]!=0) res[2][7]=a2;
if (res[2]!=0) res[2][8]=a0;
if (res[2]!=0) res[2][9]=a0;
if (res[2]!=0) res[2][10]=a0;
if (res[2]!=0) res[2][11]=a0;
if (res[2]!=0) res[2][12]=a0;
if (res[2]!=0) res[2][13]=a0;
if (res[2]!=0) res[2][14]=a0;
if (res[2]!=0) res[2][15]=a2;
if (res[2]!=0) res[2][16]=a0;
if (res[2]!=0) res[2][17]=a0;
if (res[2]!=0) res[2][18]=a0;
if (res[2]!=0) res[2][19]=a0;
if (res[2]!=0) res[2][20]=a0;
if (res[2]!=0) res[2][21]=a0;
if (res[2]!=0) res[2][22]=a0;
if (res[2]!=0) res[2][23]=a0;
if (res[2]!=0) res[2][24]=a0;
if (res[2]!=0) res[2][25]=a0;
if (res[2]!=0) res[2][26]=a2;
if (res[2]!=0) res[2][27]=a0;
if (res[2]!=0) res[2][28]=a0;
if (res[2]!=0) res[2][29]=a0;
if (res[3]!=0) res[3][0]=a1;
if (res[3]!=0) res[3][1]=a0;
if (res[3]!=0) res[3][2]=a0;
if (res[3]!=0) res[3][3]=a0;
if (res[3]!=0) res[3][4]=a0;
if (res[3]!=0) res[3][5]=a0;
if (res[3]!=0) res[3][6]=a0;
if (res[3]!=0) res[3][7]=a0;
if (res[3]!=0) res[3][8]=a0;
if (res[3]!=0) res[3][9]=a0;
if (res[3]!=0) res[3][10]=a0;
if (res[3]!=0) res[3][11]=a1;
if (res[3]!=0) res[3][12]=a0;
if (res[3]!=0) res[3][13]=a0;
if (res[3]!=0) res[3][14]=a0;
if (res[3]!=0) res[3][15]=a0;
if (res[3]!=0) res[3][16]=a0;
if (res[3]!=0) res[3][17]=a0;
if (res[3]!=0) res[3][18]=a0;
if (res[3]!=0) res[3][19]=a0;
if (res[3]!=0) res[3][20]=a0;
if (res[3]!=0) res[3][21]=a0;
if (res[3]!=0) res[3][22]=a1;
if (res[3]!=0) res[3][23]=a0;
if (res[3]!=0) res[3][24]=a0;
if (res[3]!=0) res[3][25]=a0;
if (res[3]!=0) res[3][26]=a0;
if (res[3]!=0) res[3][27]=a0;
if (res[3]!=0) res[3][28]=a0;
if (res[3]!=0) res[3][29]=a0;
if (res[3]!=0) res[3][30]=a0;
if (res[3]!=0) res[3][31]=a0;
if (res[3]!=0) res[3][32]=a0;
if (res[3]!=0) res[3][33]=a1;
if (res[3]!=0) res[3][34]=a0;
if (res[3]!=0) res[3][35]=a0;
if (res[3]!=0) res[3][36]=a0;
if (res[3]!=0) res[3][37]=a0;
if (res[3]!=0) res[3][38]=a0;
if (res[3]!=0) res[3][39]=a0;
if (res[3]!=0) res[3][40]=a0;
if (res[3]!=0) res[3][41]=a0;
if (res[3]!=0) res[3][42]=a0;
if (res[3]!=0) res[3][43]=a0;
if (res[3]!=0) res[3][44]=a1;
if (res[3]!=0) res[3][45]=a0;
if (res[3]!=0) res[3][46]=a0;
if (res[3]!=0) res[3][47]=a0;
if (res[3]!=0) res[3][48]=a0;
if (res[3]!=0) res[3][49]=a0;
if (res[3]!=0) res[3][50]=a0;
if (res[3]!=0) res[3][51]=a0;
if (res[3]!=0) res[3][52]=a2;
if (res[3]!=0) res[3][53]=a0;
if (res[3]!=0) res[3][54]=a0;
if (res[3]!=0) res[3][55]=a1;
if (res[3]!=0) res[3][56]=a0;
if (res[3]!=0) res[3][57]=a0;
a3=-2.;
if (res[3]!=0) res[3][58]=a3;
if (res[3]!=0) res[3][59]=a0;
if (res[3]!=0) res[3][60]=a0;
if (res[3]!=0) res[3][61]=a0;
if (res[3]!=0) res[3][62]=a0;
if (res[3]!=0) res[3][63]=a2;
if (res[3]!=0) res[3][64]=a0;
if (res[3]!=0) res[3][65]=a0;
if (res[3]!=0) res[3][66]=a1;
if (res[3]!=0) res[3][67]=a0;
if (res[3]!=0) res[3][68]=a0;
if (res[3]!=0) res[3][69]=a3;
if (res[3]!=0) res[3][70]=a0;
if (res[3]!=0) res[3][71]=a0;
if (res[3]!=0) res[3][72]=a0;
if (res[3]!=0) res[3][73]=a0;
if (res[3]!=0) res[3][74]=a2;
if (res[3]!=0) res[3][75]=a0;
if (res[3]!=0) res[3][76]=a0;
a3=-1.0000000000000001e-01;
if (res[3]!=0) res[3][77]=a3;
if (res[3]!=0) res[3][78]=a0;
if (res[3]!=0) res[3][79]=a0;
if (res[3]!=0) res[3][80]=a0;
if (res[3]!=0) res[3][81]=a0;
if (res[3]!=0) res[3][82]=a0;
if (res[3]!=0) res[3][83]=a0;
if (res[3]!=0) res[3][84]=a0;
if (res[3]!=0) res[3][85]=a0;
if (res[3]!=0) res[3][86]=a0;
if (res[3]!=0) res[3][87]=a0;
if (res[3]!=0) res[3][88]=a2;
if (res[3]!=0) res[3][89]=a0;
if (res[3]!=0) res[3][90]=a0;
if (res[3]!=0) res[3][91]=a0;
if (res[3]!=0) res[3][92]=a0;
if (res[3]!=0) res[3][93]=a0;
if (res[3]!=0) res[3][94]=a0;
if (res[3]!=0) res[3][95]=a0;
if (res[3]!=0) res[3][96]=a0;
if (res[3]!=0) res[3][97]=a0;
if (res[3]!=0) res[3][98]=a0;
if (res[3]!=0) res[3][99]=a2;
if (res[4]!=0) res[4][0]=a2;
if (res[4]!=0) res[4][1]=a0;
if (res[4]!=0) res[4][2]=a0;
if (res[4]!=0) res[4][3]=a0;
if (res[4]!=0) res[4][4]=a0;
if (res[4]!=0) res[4][5]=a0;
if (res[4]!=0) res[4][6]=a0;
if (res[4]!=0) res[4][7]=a0;
if (res[4]!=0) res[4][8]=a0;
if (res[4]!=0) res[4][9]=a2;
if (res[4]!=0) res[4][10]=a0;
if (res[4]!=0) res[4][11]=a0;
if (res[4]!=0) res[4][12]=a0;
if (res[4]!=0) res[4][13]=a0;
if (res[4]!=0) res[4][14]=a0;
if (res[4]!=0) res[4][15]=a0;
if (res[4]!=0) res[4][16]=a0;
if (res[4]!=0) res[4][17]=a0;
if (res[4]!=0) res[4][18]=a2;
if (res[4]!=0) res[4][19]=a0;
if (res[4]!=0) res[4][20]=a0;
if (res[4]!=0) res[4][21]=a0;
if (res[4]!=0) res[4][22]=a0;
if (res[4]!=0) res[4][23]=a0;
if (res[4]!=0) res[4][24]=a0;
if (res[4]!=0) res[4][25]=a0;
if (res[4]!=0) res[4][26]=a0;
if (res[4]!=0) res[4][27]=a2;
if (res[4]!=0) res[4][28]=a0;
if (res[4]!=0) res[4][29]=a0;
if (res[4]!=0) res[4][30]=a0;
if (res[4]!=0) res[4][31]=a0;
if (res[4]!=0) res[4][32]=a0;
if (res[4]!=0) res[4][33]=a0;
if (res[4]!=0) res[4][34]=a0;
if (res[4]!=0) res[4][35]=a0;
if (res[4]!=0) res[4][36]=a2;
if (res[4]!=0) res[4][37]=a0;
if (res[4]!=0) res[4][38]=a0;
if (res[4]!=0) res[4][39]=a0;
if (res[5]!=0) res[5][0]=a0;
if (res[5]!=0) res[5][1]=a0;
if (res[5]!=0) res[5][2]=a0;
if (res[5]!=0) res[5][3]=a0;
if (res[5]!=0) res[5][4]=a0;
if (res[5]!=0) res[5][5]=a0;
if (res[5]!=0) res[5][6]=a0;
if (res[5]!=0) res[5][7]=a0;
if (res[5]!=0) res[5][8]=a0;
if (res[5]!=0) res[5][9]=a0;
if (res[5]!=0) res[5][10]=a0;
if (res[5]!=0) res[5][11]=a0;
if (res[5]!=0) res[5][12]=a0;
if (res[5]!=0) res[5][13]=a0;
if (res[5]!=0) res[5][14]=a0;
if (res[5]!=0) res[5][15]=a0;
if (res[5]!=0) res[5][16]=a0;
if (res[5]!=0) res[5][17]=a0;
if (res[5]!=0) res[5][18]=a0;
if (res[5]!=0) res[5][19]=a0;
if (res[5]!=0) res[5][20]=a0;
if (res[5]!=0) res[5][21]=a0;
if (res[5]!=0) res[5][22]=a0;
if (res[5]!=0) res[5][23]=a0;
if (res[5]!=0) res[5][24]=a0;
if (res[5]!=0) res[5][25]=a0;
if (res[5]!=0) res[5][26]=a0;
if (res[5]!=0) res[5][27]=a0;
if (res[5]!=0) res[5][28]=a0;
if (res[5]!=0) res[5][29]=a0;
if (res[5]!=0) res[5][30]=a0;
if (res[5]!=0) res[5][31]=a0;
if (res[5]!=0) res[5][32]=a0;
if (res[5]!=0) res[5][33]=a0;
if (res[5]!=0) res[5][34]=a0;
if (res[5]!=0) res[5][35]=a0;
if (res[5]!=0) res[5][36]=a0;
if (res[5]!=0) res[5][37]=a0;
if (res[5]!=0) res[5][38]=a0;
if (res[5]!=0) res[5][39]=a0;
if (res[6]!=0) res[6][0]=a0;
if (res[6]!=0) res[6][1]=a0;
if (res[6]!=0) res[6][2]=a0;
if (res[6]!=0) res[6][3]=a0;
if (res[6]!=0) res[6][4]=a0;
if (res[6]!=0) res[6][5]=a0;
if (res[6]!=0) res[6][6]=a0;
if (res[6]!=0) res[6][7]=a0;
if (res[6]!=0) res[6][8]=a0;
if (res[6]!=0) res[6][9]=a0;
if (res[6]!=0) res[6][10]=a0;
if (res[6]!=0) res[6][11]=a0;
if (res[6]!=0) res[6][12]=a0;
if (res[6]!=0) res[6][13]=a0;
if (res[6]!=0) res[6][14]=a0;
if (res[6]!=0) res[6][15]=a0;
if (res[6]!=0) res[6][16]=a0;
if (res[6]!=0) res[6][17]=a0;
if (res[6]!=0) res[6][18]=a0;
if (res[6]!=0) res[6][19]=a0;
if (res[6]!=0) res[6][20]=a0;
if (res[6]!=0) res[6][21]=a2;
if (res[6]!=0) res[6][22]=a0;
if (res[6]!=0) res[6][23]=a0;
if (res[6]!=0) res[6][24]=a0;
if (res[6]!=0) res[6][25]=a0;
if (res[6]!=0) res[6][26]=a0;
if (res[6]!=0) res[6][27]=a0;
if (res[6]!=0) res[6][28]=a0;
if (res[6]!=0) res[6][29]=a0;
if (res[6]!=0) res[6][30]=a2;
if (res[6]!=0) res[6][31]=a0;
if (res[6]!=0) res[6][32]=a0;
if (res[6]!=0) res[6][33]=a0;
if (res[6]!=0) res[6][34]=a0;
if (res[6]!=0) res[6][35]=a0;
if (res[6]!=0) res[6][36]=a0;
if (res[6]!=0) res[6][37]=a0;
if (res[6]!=0) res[6][38]=a0;
if (res[6]!=0) res[6][39]=a2;
if (res[8]!=0) res[8][0]=a0;
if (res[9]!=0) res[9][0]=a0;
if (res[9]!=0) res[9][1]=a0;
if (res[9]!=0) res[9][2]=a0;
if (res[9]!=0) res[9][3]=a0;
if (res[9]!=0) res[9][4]=a0;
if (res[9]!=0) res[9][5]=a0;
if (res[9]!=0) res[9][6]=a0;
if (res[9]!=0) res[9][7]=a0;
if (res[9]!=0) res[9][8]=a0;
a3=1.9620000000000001e+01;
if (res[9]!=0) res[9][9]=a3;
if (res[10]!=0) res[10][0]=a1;
if (res[11]!=0) res[11][0]=a0;
if (res[12]!=0) res[12][0]=a2;
if (res[13]!=0) res[13][0]=a0;
if (res[14]!=0) res[14][0]=a0;
if (res[14]!=0) res[14][1]=a2;
a1=3.;
if (res[14]!=0) res[14][2]=a1;
a3=4.;
if (res[14]!=0) res[14][3]=a3;
a4=5.;
if (res[14]!=0) res[14][4]=a4;
if (res[14]!=0) res[14][5]=a4;
if (res[15]!=0) res[15][0]=a0;
if (res[15]!=0) res[15][1]=a2;
a2=2.;
if (res[15]!=0) res[15][2]=a2;
if (res[15]!=0) res[15][3]=a1;
if (res[15]!=0) res[15][4]=a3;
if (res[16]!=0) res[16][0]=a0;
return 0;
}
CASADI_SYMBOL_EXPORT int pendulum_dae_dyn_gnsf_get_matrices_fun(const casadi_real** arg, casadi_real** res, casadi_int* iw, casadi_real* w, void* mem){
return casadi_f0(arg, res, iw, w, mem);
}
CASADI_SYMBOL_EXPORT void pendulum_dae_dyn_gnsf_get_matrices_fun_incref(void) {
}
CASADI_SYMBOL_EXPORT void pendulum_dae_dyn_gnsf_get_matrices_fun_decref(void) {
}
CASADI_SYMBOL_EXPORT casadi_int pendulum_dae_dyn_gnsf_get_matrices_fun_n_in(void) { return 1;}
CASADI_SYMBOL_EXPORT casadi_int pendulum_dae_dyn_gnsf_get_matrices_fun_n_out(void) { return 17;}
CASADI_SYMBOL_EXPORT const char* pendulum_dae_dyn_gnsf_get_matrices_fun_name_in(casadi_int i){
switch (i) {
case 0: return "i0";
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const char* pendulum_dae_dyn_gnsf_get_matrices_fun_name_out(casadi_int i){
switch (i) {
case 0: return "o0";
case 1: return "o1";
case 2: return "o2";
case 3: return "o3";
case 4: return "o4";
case 5: return "o5";
case 6: return "o6";
case 7: return "o7";
case 8: return "o8";
case 9: return "o9";
case 10: return "o10";
case 11: return "o11";
case 12: return "o12";
case 13: return "o13";
case 14: return "o14";
case 15: return "o15";
case 16: return "o16";
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const casadi_int* pendulum_dae_dyn_gnsf_get_matrices_fun_sparsity_in(casadi_int i) {
switch (i) {
case 0: return casadi_s0;
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const casadi_int* pendulum_dae_dyn_gnsf_get_matrices_fun_sparsity_out(casadi_int i) {
switch (i) {
case 0: return casadi_s1;
case 1: return casadi_s2;
case 2: return casadi_s3;
case 3: return casadi_s4;
case 4: return casadi_s5;
case 5: return casadi_s5;
case 6: return casadi_s5;
case 7: return casadi_s6;
case 8: return casadi_s0;
case 9: return casadi_s2;
case 10: return casadi_s0;
case 11: return casadi_s0;
case 12: return casadi_s0;
case 13: return casadi_s0;
case 14: return casadi_s7;
case 15: return casadi_s8;
case 16: return casadi_s0;
default: return 0;
}
}
CASADI_SYMBOL_EXPORT int pendulum_dae_dyn_gnsf_get_matrices_fun_work(casadi_int *sz_arg, casadi_int* sz_res, casadi_int *sz_iw, casadi_int *sz_w) {
if (sz_arg) *sz_arg = 1;
if (sz_res) *sz_res = 17;
if (sz_iw) *sz_iw = 0;
if (sz_w) *sz_w = 0;
return 0;
}
#ifdef __cplusplus
} /* extern "C" */
#endif
|
the_stack_data/53476.c | #include <stdio.h>
#include <stdlib.h>
struct skyline
{
int x;
int h;
struct skyline *next;
};
struct skyline* new(int x, int h, struct skyline *next)
{
struct skyline *ptr = malloc(sizeof(struct skyline));
ptr->x = x;
ptr->h = h;
ptr->next = next;
return ptr;
}
void delete_next(struct skyline *head)
{
struct skyline *ptr = head->next;
head->next = ptr->next;
free(ptr);
}
int main(void)
{
int L, H, R, old_h;
struct skyline *ptr, *tmp, *head = new(0, 0, NULL);
scanf("%d %d %d", &L, &H, &R);
head->next = new(L, H, NULL);
head->next->next = new(R, 0, NULL);
while (scanf("%d %d %d", &L, &H, &R) != EOF)
{
for (ptr = head; ptr->next && ptr->next->x < L; ptr = ptr->next);
if (ptr->next)
{
old_h = -1;
if (ptr->next->x > L && ptr->h < H)
{
old_h = ptr->h;
ptr->next = new(L, H, ptr->next);
ptr = ptr->next;
}
while (ptr->next && ptr->next->x < R)
{
old_h = ptr->next->h;
if (ptr->next->h <= H)
{
if (ptr->h == H)
delete_next(ptr);
else
{
ptr->next->h = H;
ptr = ptr->next;
}
}
else
ptr = ptr->next;
}
if (ptr->next)
{
if (ptr->next->x == R)
{
if (ptr->h == H && ptr->next->h == H)
delete_next(ptr);
}
else
{
if (old_h != -1 && old_h < H)
ptr->next = new(R, old_h, ptr->next);
}
}
else
{
if (ptr->x == R)
ptr->h = 0;
else
ptr->next = new(R, 0, NULL);
}
}
else
{
ptr->next = new(L, H, NULL);
ptr->next->next = new(R, 0, NULL);
}
}
for (ptr = head->next; ptr->next; ptr = ptr->next)
printf("%d %d ", ptr->x, ptr->h);
printf("%d %d\n", ptr->x, ptr->h);
while (head->next)
{
ptr = head->next;
head->next = ptr->next;
free(ptr);
}
free(head);
return 0;
}
|
the_stack_data/179830275.c | #include <stdio.h>
#include <string.h>
int main() {
int numberOfCases;
scanf("%d", &numberOfCases);
char string1[200];
char string2[200];
for(int i = 0; i < numberOfCases; i++){
scanf("%s %s", string1, string2);
int size1 = strlen(string1);
int size2 = strlen(string2);
if(size1 >= size2){
for(int j = 0; j < size2; j++){
printf("%c", string1[j]);
printf("%c", string2[j]);
}
printf("\n");
}
else if(size2 > size1){
for(int j = 0; j < size1; j++){
printf("%c", string1[j]);
printf("%c", string2[j]);
}
printf("\n");
}
}
return 0;
}
|
the_stack_data/112639204.c | /*
* Stack-less Just-In-Time compiler
*
* Copyright 2013-2013 Tilera Corporation([email protected]). All rights reserved.
* Copyright 2009-2012 Zoltan Herczeg ([email protected]). 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 the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list
* of conditions and the following disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
* SHALL THE COPYRIGHT HOLDER(S) OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* This code is owned by Tilera Corporation, and distributed as part
of multiple projects. In sljit, the code is under BSD licence. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define BFD_RELOC(x) R_##x
/* Special registers. */
#define TREG_LR 55
#define TREG_SN 56
#define TREG_ZERO 63
/* Canonical name of each register. */
const char *const tilegx_register_names[] =
{
"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7",
"r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15",
"r16", "r17", "r18", "r19", "r20", "r21", "r22", "r23",
"r24", "r25", "r26", "r27", "r28", "r29", "r30", "r31",
"r32", "r33", "r34", "r35", "r36", "r37", "r38", "r39",
"r40", "r41", "r42", "r43", "r44", "r45", "r46", "r47",
"r48", "r49", "r50", "r51", "r52", "tp", "sp", "lr",
"sn", "idn0", "idn1", "udn0", "udn1", "udn2", "udn3", "zero"
};
enum
{
R_NONE = 0,
R_TILEGX_NONE = 0,
R_TILEGX_64 = 1,
R_TILEGX_32 = 2,
R_TILEGX_16 = 3,
R_TILEGX_8 = 4,
R_TILEGX_64_PCREL = 5,
R_TILEGX_32_PCREL = 6,
R_TILEGX_16_PCREL = 7,
R_TILEGX_8_PCREL = 8,
R_TILEGX_HW0 = 9,
R_TILEGX_HW1 = 10,
R_TILEGX_HW2 = 11,
R_TILEGX_HW3 = 12,
R_TILEGX_HW0_LAST = 13,
R_TILEGX_HW1_LAST = 14,
R_TILEGX_HW2_LAST = 15,
R_TILEGX_COPY = 16,
R_TILEGX_GLOB_DAT = 17,
R_TILEGX_JMP_SLOT = 18,
R_TILEGX_RELATIVE = 19,
R_TILEGX_BROFF_X1 = 20,
R_TILEGX_JUMPOFF_X1 = 21,
R_TILEGX_JUMPOFF_X1_PLT = 22,
R_TILEGX_IMM8_X0 = 23,
R_TILEGX_IMM8_Y0 = 24,
R_TILEGX_IMM8_X1 = 25,
R_TILEGX_IMM8_Y1 = 26,
R_TILEGX_DEST_IMM8_X1 = 27,
R_TILEGX_MT_IMM14_X1 = 28,
R_TILEGX_MF_IMM14_X1 = 29,
R_TILEGX_MMSTART_X0 = 30,
R_TILEGX_MMEND_X0 = 31,
R_TILEGX_SHAMT_X0 = 32,
R_TILEGX_SHAMT_X1 = 33,
R_TILEGX_SHAMT_Y0 = 34,
R_TILEGX_SHAMT_Y1 = 35,
R_TILEGX_IMM16_X0_HW0 = 36,
R_TILEGX_IMM16_X1_HW0 = 37,
R_TILEGX_IMM16_X0_HW1 = 38,
R_TILEGX_IMM16_X1_HW1 = 39,
R_TILEGX_IMM16_X0_HW2 = 40,
R_TILEGX_IMM16_X1_HW2 = 41,
R_TILEGX_IMM16_X0_HW3 = 42,
R_TILEGX_IMM16_X1_HW3 = 43,
R_TILEGX_IMM16_X0_HW0_LAST = 44,
R_TILEGX_IMM16_X1_HW0_LAST = 45,
R_TILEGX_IMM16_X0_HW1_LAST = 46,
R_TILEGX_IMM16_X1_HW1_LAST = 47,
R_TILEGX_IMM16_X0_HW2_LAST = 48,
R_TILEGX_IMM16_X1_HW2_LAST = 49,
R_TILEGX_IMM16_X0_HW0_PCREL = 50,
R_TILEGX_IMM16_X1_HW0_PCREL = 51,
R_TILEGX_IMM16_X0_HW1_PCREL = 52,
R_TILEGX_IMM16_X1_HW1_PCREL = 53,
R_TILEGX_IMM16_X0_HW2_PCREL = 54,
R_TILEGX_IMM16_X1_HW2_PCREL = 55,
R_TILEGX_IMM16_X0_HW3_PCREL = 56,
R_TILEGX_IMM16_X1_HW3_PCREL = 57,
R_TILEGX_IMM16_X0_HW0_LAST_PCREL = 58,
R_TILEGX_IMM16_X1_HW0_LAST_PCREL = 59,
R_TILEGX_IMM16_X0_HW1_LAST_PCREL = 60,
R_TILEGX_IMM16_X1_HW1_LAST_PCREL = 61,
R_TILEGX_IMM16_X0_HW2_LAST_PCREL = 62,
R_TILEGX_IMM16_X1_HW2_LAST_PCREL = 63,
R_TILEGX_IMM16_X0_HW0_GOT = 64,
R_TILEGX_IMM16_X1_HW0_GOT = 65,
R_TILEGX_IMM16_X0_HW0_PLT_PCREL = 66,
R_TILEGX_IMM16_X1_HW0_PLT_PCREL = 67,
R_TILEGX_IMM16_X0_HW1_PLT_PCREL = 68,
R_TILEGX_IMM16_X1_HW1_PLT_PCREL = 69,
R_TILEGX_IMM16_X0_HW2_PLT_PCREL = 70,
R_TILEGX_IMM16_X1_HW2_PLT_PCREL = 71,
R_TILEGX_IMM16_X0_HW0_LAST_GOT = 72,
R_TILEGX_IMM16_X1_HW0_LAST_GOT = 73,
R_TILEGX_IMM16_X0_HW1_LAST_GOT = 74,
R_TILEGX_IMM16_X1_HW1_LAST_GOT = 75,
R_TILEGX_IMM16_X0_HW0_TLS_GD = 78,
R_TILEGX_IMM16_X1_HW0_TLS_GD = 79,
R_TILEGX_IMM16_X0_HW0_TLS_LE = 80,
R_TILEGX_IMM16_X1_HW0_TLS_LE = 81,
R_TILEGX_IMM16_X0_HW0_LAST_TLS_LE = 82,
R_TILEGX_IMM16_X1_HW0_LAST_TLS_LE = 83,
R_TILEGX_IMM16_X0_HW1_LAST_TLS_LE = 84,
R_TILEGX_IMM16_X1_HW1_LAST_TLS_LE = 85,
R_TILEGX_IMM16_X0_HW0_LAST_TLS_GD = 86,
R_TILEGX_IMM16_X1_HW0_LAST_TLS_GD = 87,
R_TILEGX_IMM16_X0_HW1_LAST_TLS_GD = 88,
R_TILEGX_IMM16_X1_HW1_LAST_TLS_GD = 89,
R_TILEGX_IMM16_X0_HW0_TLS_IE = 92,
R_TILEGX_IMM16_X1_HW0_TLS_IE = 93,
R_TILEGX_IMM16_X0_HW0_LAST_PLT_PCREL = 94,
R_TILEGX_IMM16_X1_HW0_LAST_PLT_PCREL = 95,
R_TILEGX_IMM16_X0_HW1_LAST_PLT_PCREL = 96,
R_TILEGX_IMM16_X1_HW1_LAST_PLT_PCREL = 97,
R_TILEGX_IMM16_X0_HW2_LAST_PLT_PCREL = 98,
R_TILEGX_IMM16_X1_HW2_LAST_PLT_PCREL = 99,
R_TILEGX_IMM16_X0_HW0_LAST_TLS_IE = 100,
R_TILEGX_IMM16_X1_HW0_LAST_TLS_IE = 101,
R_TILEGX_IMM16_X0_HW1_LAST_TLS_IE = 102,
R_TILEGX_IMM16_X1_HW1_LAST_TLS_IE = 103,
R_TILEGX_TLS_DTPMOD64 = 106,
R_TILEGX_TLS_DTPOFF64 = 107,
R_TILEGX_TLS_TPOFF64 = 108,
R_TILEGX_TLS_DTPMOD32 = 109,
R_TILEGX_TLS_DTPOFF32 = 110,
R_TILEGX_TLS_TPOFF32 = 111,
R_TILEGX_TLS_GD_CALL = 112,
R_TILEGX_IMM8_X0_TLS_GD_ADD = 113,
R_TILEGX_IMM8_X1_TLS_GD_ADD = 114,
R_TILEGX_IMM8_Y0_TLS_GD_ADD = 115,
R_TILEGX_IMM8_Y1_TLS_GD_ADD = 116,
R_TILEGX_TLS_IE_LOAD = 117,
R_TILEGX_IMM8_X0_TLS_ADD = 118,
R_TILEGX_IMM8_X1_TLS_ADD = 119,
R_TILEGX_IMM8_Y0_TLS_ADD = 120,
R_TILEGX_IMM8_Y1_TLS_ADD = 121,
R_TILEGX_GNU_VTINHERIT = 128,
R_TILEGX_GNU_VTENTRY = 129,
R_TILEGX_IRELATIVE = 130,
R_TILEGX_NUM = 131
};
typedef enum
{
TILEGX_PIPELINE_X0,
TILEGX_PIPELINE_X1,
TILEGX_PIPELINE_Y0,
TILEGX_PIPELINE_Y1,
TILEGX_PIPELINE_Y2,
} tilegx_pipeline;
typedef unsigned long long tilegx_bundle_bits;
/* These are the bits that determine if a bundle is in the X encoding. */
#define TILEGX_BUNDLE_MODE_MASK ((tilegx_bundle_bits)3 << 62)
enum
{
/* Maximum number of instructions in a bundle (2 for X, 3 for Y). */
TILEGX_MAX_INSTRUCTIONS_PER_BUNDLE = 3,
/* How many different pipeline encodings are there? X0, X1, Y0, Y1, Y2. */
TILEGX_NUM_PIPELINE_ENCODINGS = 5,
/* Log base 2 of TILEGX_BUNDLE_SIZE_IN_BYTES. */
TILEGX_LOG2_BUNDLE_SIZE_IN_BYTES = 3,
/* Instructions take this many bytes. */
TILEGX_BUNDLE_SIZE_IN_BYTES = 1 << TILEGX_LOG2_BUNDLE_SIZE_IN_BYTES,
/* Log base 2 of TILEGX_BUNDLE_ALIGNMENT_IN_BYTES. */
TILEGX_LOG2_BUNDLE_ALIGNMENT_IN_BYTES = 3,
/* Bundles should be aligned modulo this number of bytes. */
TILEGX_BUNDLE_ALIGNMENT_IN_BYTES =
(1 << TILEGX_LOG2_BUNDLE_ALIGNMENT_IN_BYTES),
/* Number of registers (some are magic, such as network I/O). */
TILEGX_NUM_REGISTERS = 64,
};
/* Make a few "tile_" variables to simplify common code between
architectures. */
typedef tilegx_bundle_bits tile_bundle_bits;
#define TILE_BUNDLE_SIZE_IN_BYTES TILEGX_BUNDLE_SIZE_IN_BYTES
#define TILE_BUNDLE_ALIGNMENT_IN_BYTES TILEGX_BUNDLE_ALIGNMENT_IN_BYTES
#define TILE_LOG2_BUNDLE_ALIGNMENT_IN_BYTES \
TILEGX_LOG2_BUNDLE_ALIGNMENT_IN_BYTES
/* 64-bit pattern for a { bpt ; nop } bundle. */
#define TILEGX_BPT_BUNDLE 0x286a44ae51485000ULL
typedef enum
{
TILEGX_OP_TYPE_REGISTER,
TILEGX_OP_TYPE_IMMEDIATE,
TILEGX_OP_TYPE_ADDRESS,
TILEGX_OP_TYPE_SPR
} tilegx_operand_type;
struct tilegx_operand
{
/* Is this operand a register, immediate or address? */
tilegx_operand_type type;
/* The default relocation type for this operand. */
signed int default_reloc : 16;
/* How many bits is this value? (used for range checking) */
unsigned int num_bits : 5;
/* Is the value signed? (used for range checking) */
unsigned int is_signed : 1;
/* Is this operand a source register? */
unsigned int is_src_reg : 1;
/* Is this operand written? (i.e. is it a destination register) */
unsigned int is_dest_reg : 1;
/* Is this operand PC-relative? */
unsigned int is_pc_relative : 1;
/* By how many bits do we right shift the value before inserting? */
unsigned int rightshift : 2;
/* Return the bits for this operand to be ORed into an existing bundle. */
tilegx_bundle_bits (*insert) (int op);
/* Extract this operand and return it. */
unsigned int (*extract) (tilegx_bundle_bits bundle);
};
typedef enum
{
TILEGX_OPC_BPT,
TILEGX_OPC_INFO,
TILEGX_OPC_INFOL,
TILEGX_OPC_LD4S_TLS,
TILEGX_OPC_LD_TLS,
TILEGX_OPC_MOVE,
TILEGX_OPC_MOVEI,
TILEGX_OPC_MOVELI,
TILEGX_OPC_PREFETCH,
TILEGX_OPC_PREFETCH_ADD_L1,
TILEGX_OPC_PREFETCH_ADD_L1_FAULT,
TILEGX_OPC_PREFETCH_ADD_L2,
TILEGX_OPC_PREFETCH_ADD_L2_FAULT,
TILEGX_OPC_PREFETCH_ADD_L3,
TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
TILEGX_OPC_PREFETCH_L1,
TILEGX_OPC_PREFETCH_L1_FAULT,
TILEGX_OPC_PREFETCH_L2,
TILEGX_OPC_PREFETCH_L2_FAULT,
TILEGX_OPC_PREFETCH_L3,
TILEGX_OPC_PREFETCH_L3_FAULT,
TILEGX_OPC_RAISE,
TILEGX_OPC_ADD,
TILEGX_OPC_ADDI,
TILEGX_OPC_ADDLI,
TILEGX_OPC_ADDX,
TILEGX_OPC_ADDXI,
TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXSC,
TILEGX_OPC_AND,
TILEGX_OPC_ANDI,
TILEGX_OPC_BEQZ,
TILEGX_OPC_BEQZT,
TILEGX_OPC_BFEXTS,
TILEGX_OPC_BFEXTU,
TILEGX_OPC_BFINS,
TILEGX_OPC_BGEZ,
TILEGX_OPC_BGEZT,
TILEGX_OPC_BGTZ,
TILEGX_OPC_BGTZT,
TILEGX_OPC_BLBC,
TILEGX_OPC_BLBCT,
TILEGX_OPC_BLBS,
TILEGX_OPC_BLBST,
TILEGX_OPC_BLEZ,
TILEGX_OPC_BLEZT,
TILEGX_OPC_BLTZ,
TILEGX_OPC_BLTZT,
TILEGX_OPC_BNEZ,
TILEGX_OPC_BNEZT,
TILEGX_OPC_CLZ,
TILEGX_OPC_CMOVEQZ,
TILEGX_OPC_CMOVNEZ,
TILEGX_OPC_CMPEQ,
TILEGX_OPC_CMPEQI,
TILEGX_OPC_CMPEXCH,
TILEGX_OPC_CMPEXCH4,
TILEGX_OPC_CMPLES,
TILEGX_OPC_CMPLEU,
TILEGX_OPC_CMPLTS,
TILEGX_OPC_CMPLTSI,
TILEGX_OPC_CMPLTU,
TILEGX_OPC_CMPLTUI,
TILEGX_OPC_CMPNE,
TILEGX_OPC_CMUL,
TILEGX_OPC_CMULA,
TILEGX_OPC_CMULAF,
TILEGX_OPC_CMULF,
TILEGX_OPC_CMULFR,
TILEGX_OPC_CMULH,
TILEGX_OPC_CMULHR,
TILEGX_OPC_CRC32_32,
TILEGX_OPC_CRC32_8,
TILEGX_OPC_CTZ,
TILEGX_OPC_DBLALIGN,
TILEGX_OPC_DBLALIGN2,
TILEGX_OPC_DBLALIGN4,
TILEGX_OPC_DBLALIGN6,
TILEGX_OPC_DRAIN,
TILEGX_OPC_DTLBPR,
TILEGX_OPC_EXCH,
TILEGX_OPC_EXCH4,
TILEGX_OPC_FDOUBLE_ADD_FLAGS,
TILEGX_OPC_FDOUBLE_ADDSUB,
TILEGX_OPC_FDOUBLE_MUL_FLAGS,
TILEGX_OPC_FDOUBLE_PACK1,
TILEGX_OPC_FDOUBLE_PACK2,
TILEGX_OPC_FDOUBLE_SUB_FLAGS,
TILEGX_OPC_FDOUBLE_UNPACK_MAX,
TILEGX_OPC_FDOUBLE_UNPACK_MIN,
TILEGX_OPC_FETCHADD,
TILEGX_OPC_FETCHADD4,
TILEGX_OPC_FETCHADDGEZ,
TILEGX_OPC_FETCHADDGEZ4,
TILEGX_OPC_FETCHAND,
TILEGX_OPC_FETCHAND4,
TILEGX_OPC_FETCHOR,
TILEGX_OPC_FETCHOR4,
TILEGX_OPC_FINV,
TILEGX_OPC_FLUSH,
TILEGX_OPC_FLUSHWB,
TILEGX_OPC_FNOP,
TILEGX_OPC_FSINGLE_ADD1,
TILEGX_OPC_FSINGLE_ADDSUB2,
TILEGX_OPC_FSINGLE_MUL1,
TILEGX_OPC_FSINGLE_MUL2,
TILEGX_OPC_FSINGLE_PACK1,
TILEGX_OPC_FSINGLE_PACK2,
TILEGX_OPC_FSINGLE_SUB1,
TILEGX_OPC_ICOH,
TILEGX_OPC_ILL,
TILEGX_OPC_INV,
TILEGX_OPC_IRET,
TILEGX_OPC_J,
TILEGX_OPC_JAL,
TILEGX_OPC_JALR,
TILEGX_OPC_JALRP,
TILEGX_OPC_JR,
TILEGX_OPC_JRP,
TILEGX_OPC_LD,
TILEGX_OPC_LD1S,
TILEGX_OPC_LD1S_ADD,
TILEGX_OPC_LD1U,
TILEGX_OPC_LD1U_ADD,
TILEGX_OPC_LD2S,
TILEGX_OPC_LD2S_ADD,
TILEGX_OPC_LD2U,
TILEGX_OPC_LD2U_ADD,
TILEGX_OPC_LD4S,
TILEGX_OPC_LD4S_ADD,
TILEGX_OPC_LD4U,
TILEGX_OPC_LD4U_ADD,
TILEGX_OPC_LD_ADD,
TILEGX_OPC_LDNA,
TILEGX_OPC_LDNA_ADD,
TILEGX_OPC_LDNT,
TILEGX_OPC_LDNT1S,
TILEGX_OPC_LDNT1S_ADD,
TILEGX_OPC_LDNT1U,
TILEGX_OPC_LDNT1U_ADD,
TILEGX_OPC_LDNT2S,
TILEGX_OPC_LDNT2S_ADD,
TILEGX_OPC_LDNT2U,
TILEGX_OPC_LDNT2U_ADD,
TILEGX_OPC_LDNT4S,
TILEGX_OPC_LDNT4S_ADD,
TILEGX_OPC_LDNT4U,
TILEGX_OPC_LDNT4U_ADD,
TILEGX_OPC_LDNT_ADD,
TILEGX_OPC_LNK,
TILEGX_OPC_MF,
TILEGX_OPC_MFSPR,
TILEGX_OPC_MM,
TILEGX_OPC_MNZ,
TILEGX_OPC_MTSPR,
TILEGX_OPC_MUL_HS_HS,
TILEGX_OPC_MUL_HS_HU,
TILEGX_OPC_MUL_HS_LS,
TILEGX_OPC_MUL_HS_LU,
TILEGX_OPC_MUL_HU_HU,
TILEGX_OPC_MUL_HU_LS,
TILEGX_OPC_MUL_HU_LU,
TILEGX_OPC_MUL_LS_LS,
TILEGX_OPC_MUL_LS_LU,
TILEGX_OPC_MUL_LU_LU,
TILEGX_OPC_MULA_HS_HS,
TILEGX_OPC_MULA_HS_HU,
TILEGX_OPC_MULA_HS_LS,
TILEGX_OPC_MULA_HS_LU,
TILEGX_OPC_MULA_HU_HU,
TILEGX_OPC_MULA_HU_LS,
TILEGX_OPC_MULA_HU_LU,
TILEGX_OPC_MULA_LS_LS,
TILEGX_OPC_MULA_LS_LU,
TILEGX_OPC_MULA_LU_LU,
TILEGX_OPC_MULAX,
TILEGX_OPC_MULX,
TILEGX_OPC_MZ,
TILEGX_OPC_NAP,
TILEGX_OPC_NOP,
TILEGX_OPC_NOR,
TILEGX_OPC_OR,
TILEGX_OPC_ORI,
TILEGX_OPC_PCNT,
TILEGX_OPC_REVBITS,
TILEGX_OPC_REVBYTES,
TILEGX_OPC_ROTL,
TILEGX_OPC_ROTLI,
TILEGX_OPC_SHL,
TILEGX_OPC_SHL16INSLI,
TILEGX_OPC_SHL1ADD,
TILEGX_OPC_SHL1ADDX,
TILEGX_OPC_SHL2ADD,
TILEGX_OPC_SHL2ADDX,
TILEGX_OPC_SHL3ADD,
TILEGX_OPC_SHL3ADDX,
TILEGX_OPC_SHLI,
TILEGX_OPC_SHLX,
TILEGX_OPC_SHLXI,
TILEGX_OPC_SHRS,
TILEGX_OPC_SHRSI,
TILEGX_OPC_SHRU,
TILEGX_OPC_SHRUI,
TILEGX_OPC_SHRUX,
TILEGX_OPC_SHRUXI,
TILEGX_OPC_SHUFFLEBYTES,
TILEGX_OPC_ST,
TILEGX_OPC_ST1,
TILEGX_OPC_ST1_ADD,
TILEGX_OPC_ST2,
TILEGX_OPC_ST2_ADD,
TILEGX_OPC_ST4,
TILEGX_OPC_ST4_ADD,
TILEGX_OPC_ST_ADD,
TILEGX_OPC_STNT,
TILEGX_OPC_STNT1,
TILEGX_OPC_STNT1_ADD,
TILEGX_OPC_STNT2,
TILEGX_OPC_STNT2_ADD,
TILEGX_OPC_STNT4,
TILEGX_OPC_STNT4_ADD,
TILEGX_OPC_STNT_ADD,
TILEGX_OPC_SUB,
TILEGX_OPC_SUBX,
TILEGX_OPC_SUBXSC,
TILEGX_OPC_SWINT0,
TILEGX_OPC_SWINT1,
TILEGX_OPC_SWINT2,
TILEGX_OPC_SWINT3,
TILEGX_OPC_TBLIDXB0,
TILEGX_OPC_TBLIDXB1,
TILEGX_OPC_TBLIDXB2,
TILEGX_OPC_TBLIDXB3,
TILEGX_OPC_V1ADD,
TILEGX_OPC_V1ADDI,
TILEGX_OPC_V1ADDUC,
TILEGX_OPC_V1ADIFFU,
TILEGX_OPC_V1AVGU,
TILEGX_OPC_V1CMPEQ,
TILEGX_OPC_V1CMPEQI,
TILEGX_OPC_V1CMPLES,
TILEGX_OPC_V1CMPLEU,
TILEGX_OPC_V1CMPLTS,
TILEGX_OPC_V1CMPLTSI,
TILEGX_OPC_V1CMPLTU,
TILEGX_OPC_V1CMPLTUI,
TILEGX_OPC_V1CMPNE,
TILEGX_OPC_V1DDOTPU,
TILEGX_OPC_V1DDOTPUA,
TILEGX_OPC_V1DDOTPUS,
TILEGX_OPC_V1DDOTPUSA,
TILEGX_OPC_V1DOTP,
TILEGX_OPC_V1DOTPA,
TILEGX_OPC_V1DOTPU,
TILEGX_OPC_V1DOTPUA,
TILEGX_OPC_V1DOTPUS,
TILEGX_OPC_V1DOTPUSA,
TILEGX_OPC_V1INT_H,
TILEGX_OPC_V1INT_L,
TILEGX_OPC_V1MAXU,
TILEGX_OPC_V1MAXUI,
TILEGX_OPC_V1MINU,
TILEGX_OPC_V1MINUI,
TILEGX_OPC_V1MNZ,
TILEGX_OPC_V1MULTU,
TILEGX_OPC_V1MULU,
TILEGX_OPC_V1MULUS,
TILEGX_OPC_V1MZ,
TILEGX_OPC_V1SADAU,
TILEGX_OPC_V1SADU,
TILEGX_OPC_V1SHL,
TILEGX_OPC_V1SHLI,
TILEGX_OPC_V1SHRS,
TILEGX_OPC_V1SHRSI,
TILEGX_OPC_V1SHRU,
TILEGX_OPC_V1SHRUI,
TILEGX_OPC_V1SUB,
TILEGX_OPC_V1SUBUC,
TILEGX_OPC_V2ADD,
TILEGX_OPC_V2ADDI,
TILEGX_OPC_V2ADDSC,
TILEGX_OPC_V2ADIFFS,
TILEGX_OPC_V2AVGS,
TILEGX_OPC_V2CMPEQ,
TILEGX_OPC_V2CMPEQI,
TILEGX_OPC_V2CMPLES,
TILEGX_OPC_V2CMPLEU,
TILEGX_OPC_V2CMPLTS,
TILEGX_OPC_V2CMPLTSI,
TILEGX_OPC_V2CMPLTU,
TILEGX_OPC_V2CMPLTUI,
TILEGX_OPC_V2CMPNE,
TILEGX_OPC_V2DOTP,
TILEGX_OPC_V2DOTPA,
TILEGX_OPC_V2INT_H,
TILEGX_OPC_V2INT_L,
TILEGX_OPC_V2MAXS,
TILEGX_OPC_V2MAXSI,
TILEGX_OPC_V2MINS,
TILEGX_OPC_V2MINSI,
TILEGX_OPC_V2MNZ,
TILEGX_OPC_V2MULFSC,
TILEGX_OPC_V2MULS,
TILEGX_OPC_V2MULTS,
TILEGX_OPC_V2MZ,
TILEGX_OPC_V2PACKH,
TILEGX_OPC_V2PACKL,
TILEGX_OPC_V2PACKUC,
TILEGX_OPC_V2SADAS,
TILEGX_OPC_V2SADAU,
TILEGX_OPC_V2SADS,
TILEGX_OPC_V2SADU,
TILEGX_OPC_V2SHL,
TILEGX_OPC_V2SHLI,
TILEGX_OPC_V2SHLSC,
TILEGX_OPC_V2SHRS,
TILEGX_OPC_V2SHRSI,
TILEGX_OPC_V2SHRU,
TILEGX_OPC_V2SHRUI,
TILEGX_OPC_V2SUB,
TILEGX_OPC_V2SUBSC,
TILEGX_OPC_V4ADD,
TILEGX_OPC_V4ADDSC,
TILEGX_OPC_V4INT_H,
TILEGX_OPC_V4INT_L,
TILEGX_OPC_V4PACKSC,
TILEGX_OPC_V4SHL,
TILEGX_OPC_V4SHLSC,
TILEGX_OPC_V4SHRS,
TILEGX_OPC_V4SHRU,
TILEGX_OPC_V4SUB,
TILEGX_OPC_V4SUBSC,
TILEGX_OPC_WH64,
TILEGX_OPC_XOR,
TILEGX_OPC_XORI,
TILEGX_OPC_NONE
} tilegx_mnemonic;
enum
{
TILEGX_MAX_OPERANDS = 4 /* bfexts */
};
struct tilegx_opcode
{
/* The opcode mnemonic, e.g. "add" */
const char *name;
/* The enum value for this mnemonic. */
tilegx_mnemonic mnemonic;
/* A bit mask of which of the five pipes this instruction
is compatible with:
X0 0x01
X1 0x02
Y0 0x04
Y1 0x08
Y2 0x10 */
unsigned char pipes;
/* How many operands are there? */
unsigned char num_operands;
/* Which register does this write implicitly, or TREG_ZERO if none? */
unsigned char implicitly_written_register;
/* Can this be bundled with other instructions (almost always true). */
unsigned char can_bundle;
/* The description of the operands. Each of these is an
* index into the tilegx_operands[] table. */
unsigned char operands[TILEGX_NUM_PIPELINE_ENCODINGS][TILEGX_MAX_OPERANDS];
/* A mask of which bits have predefined values for each pipeline.
* This is useful for disassembly. */
tilegx_bundle_bits fixed_bit_masks[TILEGX_NUM_PIPELINE_ENCODINGS];
/* For each bit set in fixed_bit_masks, what the value is for this
* instruction. */
tilegx_bundle_bits fixed_bit_values[TILEGX_NUM_PIPELINE_ENCODINGS];
};
/* Used for non-textual disassembly into structs. */
struct tilegx_decoded_instruction
{
const struct tilegx_opcode *opcode;
const struct tilegx_operand *operands[TILEGX_MAX_OPERANDS];
long long operand_values[TILEGX_MAX_OPERANDS];
};
enum
{
ADDI_IMM8_OPCODE_X0 = 1,
ADDI_IMM8_OPCODE_X1 = 1,
ADDI_OPCODE_Y0 = 0,
ADDI_OPCODE_Y1 = 1,
ADDLI_OPCODE_X0 = 1,
ADDLI_OPCODE_X1 = 0,
ADDXI_IMM8_OPCODE_X0 = 2,
ADDXI_IMM8_OPCODE_X1 = 2,
ADDXI_OPCODE_Y0 = 1,
ADDXI_OPCODE_Y1 = 2,
ADDXLI_OPCODE_X0 = 2,
ADDXLI_OPCODE_X1 = 1,
ADDXSC_RRR_0_OPCODE_X0 = 1,
ADDXSC_RRR_0_OPCODE_X1 = 1,
ADDX_RRR_0_OPCODE_X0 = 2,
ADDX_RRR_0_OPCODE_X1 = 2,
ADDX_RRR_0_OPCODE_Y0 = 0,
ADDX_SPECIAL_0_OPCODE_Y1 = 0,
ADD_RRR_0_OPCODE_X0 = 3,
ADD_RRR_0_OPCODE_X1 = 3,
ADD_RRR_0_OPCODE_Y0 = 1,
ADD_SPECIAL_0_OPCODE_Y1 = 1,
ANDI_IMM8_OPCODE_X0 = 3,
ANDI_IMM8_OPCODE_X1 = 3,
ANDI_OPCODE_Y0 = 2,
ANDI_OPCODE_Y1 = 3,
AND_RRR_0_OPCODE_X0 = 4,
AND_RRR_0_OPCODE_X1 = 4,
AND_RRR_5_OPCODE_Y0 = 0,
AND_RRR_5_OPCODE_Y1 = 0,
BEQZT_BRANCH_OPCODE_X1 = 16,
BEQZ_BRANCH_OPCODE_X1 = 17,
BFEXTS_BF_OPCODE_X0 = 4,
BFEXTU_BF_OPCODE_X0 = 5,
BFINS_BF_OPCODE_X0 = 6,
BF_OPCODE_X0 = 3,
BGEZT_BRANCH_OPCODE_X1 = 18,
BGEZ_BRANCH_OPCODE_X1 = 19,
BGTZT_BRANCH_OPCODE_X1 = 20,
BGTZ_BRANCH_OPCODE_X1 = 21,
BLBCT_BRANCH_OPCODE_X1 = 22,
BLBC_BRANCH_OPCODE_X1 = 23,
BLBST_BRANCH_OPCODE_X1 = 24,
BLBS_BRANCH_OPCODE_X1 = 25,
BLEZT_BRANCH_OPCODE_X1 = 26,
BLEZ_BRANCH_OPCODE_X1 = 27,
BLTZT_BRANCH_OPCODE_X1 = 28,
BLTZ_BRANCH_OPCODE_X1 = 29,
BNEZT_BRANCH_OPCODE_X1 = 30,
BNEZ_BRANCH_OPCODE_X1 = 31,
BRANCH_OPCODE_X1 = 2,
CMOVEQZ_RRR_0_OPCODE_X0 = 5,
CMOVEQZ_RRR_4_OPCODE_Y0 = 0,
CMOVNEZ_RRR_0_OPCODE_X0 = 6,
CMOVNEZ_RRR_4_OPCODE_Y0 = 1,
CMPEQI_IMM8_OPCODE_X0 = 4,
CMPEQI_IMM8_OPCODE_X1 = 4,
CMPEQI_OPCODE_Y0 = 3,
CMPEQI_OPCODE_Y1 = 4,
CMPEQ_RRR_0_OPCODE_X0 = 7,
CMPEQ_RRR_0_OPCODE_X1 = 5,
CMPEQ_RRR_3_OPCODE_Y0 = 0,
CMPEQ_RRR_3_OPCODE_Y1 = 2,
CMPEXCH4_RRR_0_OPCODE_X1 = 6,
CMPEXCH_RRR_0_OPCODE_X1 = 7,
CMPLES_RRR_0_OPCODE_X0 = 8,
CMPLES_RRR_0_OPCODE_X1 = 8,
CMPLES_RRR_2_OPCODE_Y0 = 0,
CMPLES_RRR_2_OPCODE_Y1 = 0,
CMPLEU_RRR_0_OPCODE_X0 = 9,
CMPLEU_RRR_0_OPCODE_X1 = 9,
CMPLEU_RRR_2_OPCODE_Y0 = 1,
CMPLEU_RRR_2_OPCODE_Y1 = 1,
CMPLTSI_IMM8_OPCODE_X0 = 5,
CMPLTSI_IMM8_OPCODE_X1 = 5,
CMPLTSI_OPCODE_Y0 = 4,
CMPLTSI_OPCODE_Y1 = 5,
CMPLTS_RRR_0_OPCODE_X0 = 10,
CMPLTS_RRR_0_OPCODE_X1 = 10,
CMPLTS_RRR_2_OPCODE_Y0 = 2,
CMPLTS_RRR_2_OPCODE_Y1 = 2,
CMPLTUI_IMM8_OPCODE_X0 = 6,
CMPLTUI_IMM8_OPCODE_X1 = 6,
CMPLTU_RRR_0_OPCODE_X0 = 11,
CMPLTU_RRR_0_OPCODE_X1 = 11,
CMPLTU_RRR_2_OPCODE_Y0 = 3,
CMPLTU_RRR_2_OPCODE_Y1 = 3,
CMPNE_RRR_0_OPCODE_X0 = 12,
CMPNE_RRR_0_OPCODE_X1 = 12,
CMPNE_RRR_3_OPCODE_Y0 = 1,
CMPNE_RRR_3_OPCODE_Y1 = 3,
CMULAF_RRR_0_OPCODE_X0 = 13,
CMULA_RRR_0_OPCODE_X0 = 14,
CMULFR_RRR_0_OPCODE_X0 = 15,
CMULF_RRR_0_OPCODE_X0 = 16,
CMULHR_RRR_0_OPCODE_X0 = 17,
CMULH_RRR_0_OPCODE_X0 = 18,
CMUL_RRR_0_OPCODE_X0 = 19,
CNTLZ_UNARY_OPCODE_X0 = 1,
CNTLZ_UNARY_OPCODE_Y0 = 1,
CNTTZ_UNARY_OPCODE_X0 = 2,
CNTTZ_UNARY_OPCODE_Y0 = 2,
CRC32_32_RRR_0_OPCODE_X0 = 20,
CRC32_8_RRR_0_OPCODE_X0 = 21,
DBLALIGN2_RRR_0_OPCODE_X0 = 22,
DBLALIGN2_RRR_0_OPCODE_X1 = 13,
DBLALIGN4_RRR_0_OPCODE_X0 = 23,
DBLALIGN4_RRR_0_OPCODE_X1 = 14,
DBLALIGN6_RRR_0_OPCODE_X0 = 24,
DBLALIGN6_RRR_0_OPCODE_X1 = 15,
DBLALIGN_RRR_0_OPCODE_X0 = 25,
DRAIN_UNARY_OPCODE_X1 = 1,
DTLBPR_UNARY_OPCODE_X1 = 2,
EXCH4_RRR_0_OPCODE_X1 = 16,
EXCH_RRR_0_OPCODE_X1 = 17,
FDOUBLE_ADDSUB_RRR_0_OPCODE_X0 = 26,
FDOUBLE_ADD_FLAGS_RRR_0_OPCODE_X0 = 27,
FDOUBLE_MUL_FLAGS_RRR_0_OPCODE_X0 = 28,
FDOUBLE_PACK1_RRR_0_OPCODE_X0 = 29,
FDOUBLE_PACK2_RRR_0_OPCODE_X0 = 30,
FDOUBLE_SUB_FLAGS_RRR_0_OPCODE_X0 = 31,
FDOUBLE_UNPACK_MAX_RRR_0_OPCODE_X0 = 32,
FDOUBLE_UNPACK_MIN_RRR_0_OPCODE_X0 = 33,
FETCHADD4_RRR_0_OPCODE_X1 = 18,
FETCHADDGEZ4_RRR_0_OPCODE_X1 = 19,
FETCHADDGEZ_RRR_0_OPCODE_X1 = 20,
FETCHADD_RRR_0_OPCODE_X1 = 21,
FETCHAND4_RRR_0_OPCODE_X1 = 22,
FETCHAND_RRR_0_OPCODE_X1 = 23,
FETCHOR4_RRR_0_OPCODE_X1 = 24,
FETCHOR_RRR_0_OPCODE_X1 = 25,
FINV_UNARY_OPCODE_X1 = 3,
FLUSHWB_UNARY_OPCODE_X1 = 4,
FLUSH_UNARY_OPCODE_X1 = 5,
FNOP_UNARY_OPCODE_X0 = 3,
FNOP_UNARY_OPCODE_X1 = 6,
FNOP_UNARY_OPCODE_Y0 = 3,
FNOP_UNARY_OPCODE_Y1 = 8,
FSINGLE_ADD1_RRR_0_OPCODE_X0 = 34,
FSINGLE_ADDSUB2_RRR_0_OPCODE_X0 = 35,
FSINGLE_MUL1_RRR_0_OPCODE_X0 = 36,
FSINGLE_MUL2_RRR_0_OPCODE_X0 = 37,
FSINGLE_PACK1_UNARY_OPCODE_X0 = 4,
FSINGLE_PACK1_UNARY_OPCODE_Y0 = 4,
FSINGLE_PACK2_RRR_0_OPCODE_X0 = 38,
FSINGLE_SUB1_RRR_0_OPCODE_X0 = 39,
ICOH_UNARY_OPCODE_X1 = 7,
ILL_UNARY_OPCODE_X1 = 8,
ILL_UNARY_OPCODE_Y1 = 9,
IMM8_OPCODE_X0 = 4,
IMM8_OPCODE_X1 = 3,
INV_UNARY_OPCODE_X1 = 9,
IRET_UNARY_OPCODE_X1 = 10,
JALRP_UNARY_OPCODE_X1 = 11,
JALRP_UNARY_OPCODE_Y1 = 10,
JALR_UNARY_OPCODE_X1 = 12,
JALR_UNARY_OPCODE_Y1 = 11,
JAL_JUMP_OPCODE_X1 = 0,
JRP_UNARY_OPCODE_X1 = 13,
JRP_UNARY_OPCODE_Y1 = 12,
JR_UNARY_OPCODE_X1 = 14,
JR_UNARY_OPCODE_Y1 = 13,
JUMP_OPCODE_X1 = 4,
J_JUMP_OPCODE_X1 = 1,
LD1S_ADD_IMM8_OPCODE_X1 = 7,
LD1S_OPCODE_Y2 = 0,
LD1S_UNARY_OPCODE_X1 = 15,
LD1U_ADD_IMM8_OPCODE_X1 = 8,
LD1U_OPCODE_Y2 = 1,
LD1U_UNARY_OPCODE_X1 = 16,
LD2S_ADD_IMM8_OPCODE_X1 = 9,
LD2S_OPCODE_Y2 = 2,
LD2S_UNARY_OPCODE_X1 = 17,
LD2U_ADD_IMM8_OPCODE_X1 = 10,
LD2U_OPCODE_Y2 = 3,
LD2U_UNARY_OPCODE_X1 = 18,
LD4S_ADD_IMM8_OPCODE_X1 = 11,
LD4S_OPCODE_Y2 = 1,
LD4S_UNARY_OPCODE_X1 = 19,
LD4U_ADD_IMM8_OPCODE_X1 = 12,
LD4U_OPCODE_Y2 = 2,
LD4U_UNARY_OPCODE_X1 = 20,
LDNA_UNARY_OPCODE_X1 = 21,
LDNT1S_ADD_IMM8_OPCODE_X1 = 13,
LDNT1S_UNARY_OPCODE_X1 = 22,
LDNT1U_ADD_IMM8_OPCODE_X1 = 14,
LDNT1U_UNARY_OPCODE_X1 = 23,
LDNT2S_ADD_IMM8_OPCODE_X1 = 15,
LDNT2S_UNARY_OPCODE_X1 = 24,
LDNT2U_ADD_IMM8_OPCODE_X1 = 16,
LDNT2U_UNARY_OPCODE_X1 = 25,
LDNT4S_ADD_IMM8_OPCODE_X1 = 17,
LDNT4S_UNARY_OPCODE_X1 = 26,
LDNT4U_ADD_IMM8_OPCODE_X1 = 18,
LDNT4U_UNARY_OPCODE_X1 = 27,
LDNT_ADD_IMM8_OPCODE_X1 = 19,
LDNT_UNARY_OPCODE_X1 = 28,
LD_ADD_IMM8_OPCODE_X1 = 20,
LD_OPCODE_Y2 = 3,
LD_UNARY_OPCODE_X1 = 29,
LNK_UNARY_OPCODE_X1 = 30,
LNK_UNARY_OPCODE_Y1 = 14,
LWNA_ADD_IMM8_OPCODE_X1 = 21,
MFSPR_IMM8_OPCODE_X1 = 22,
MF_UNARY_OPCODE_X1 = 31,
MM_BF_OPCODE_X0 = 7,
MNZ_RRR_0_OPCODE_X0 = 40,
MNZ_RRR_0_OPCODE_X1 = 26,
MNZ_RRR_4_OPCODE_Y0 = 2,
MNZ_RRR_4_OPCODE_Y1 = 2,
MODE_OPCODE_YA2 = 1,
MODE_OPCODE_YB2 = 2,
MODE_OPCODE_YC2 = 3,
MTSPR_IMM8_OPCODE_X1 = 23,
MULAX_RRR_0_OPCODE_X0 = 41,
MULAX_RRR_3_OPCODE_Y0 = 2,
MULA_HS_HS_RRR_0_OPCODE_X0 = 42,
MULA_HS_HS_RRR_9_OPCODE_Y0 = 0,
MULA_HS_HU_RRR_0_OPCODE_X0 = 43,
MULA_HS_LS_RRR_0_OPCODE_X0 = 44,
MULA_HS_LU_RRR_0_OPCODE_X0 = 45,
MULA_HU_HU_RRR_0_OPCODE_X0 = 46,
MULA_HU_HU_RRR_9_OPCODE_Y0 = 1,
MULA_HU_LS_RRR_0_OPCODE_X0 = 47,
MULA_HU_LU_RRR_0_OPCODE_X0 = 48,
MULA_LS_LS_RRR_0_OPCODE_X0 = 49,
MULA_LS_LS_RRR_9_OPCODE_Y0 = 2,
MULA_LS_LU_RRR_0_OPCODE_X0 = 50,
MULA_LU_LU_RRR_0_OPCODE_X0 = 51,
MULA_LU_LU_RRR_9_OPCODE_Y0 = 3,
MULX_RRR_0_OPCODE_X0 = 52,
MULX_RRR_3_OPCODE_Y0 = 3,
MUL_HS_HS_RRR_0_OPCODE_X0 = 53,
MUL_HS_HS_RRR_8_OPCODE_Y0 = 0,
MUL_HS_HU_RRR_0_OPCODE_X0 = 54,
MUL_HS_LS_RRR_0_OPCODE_X0 = 55,
MUL_HS_LU_RRR_0_OPCODE_X0 = 56,
MUL_HU_HU_RRR_0_OPCODE_X0 = 57,
MUL_HU_HU_RRR_8_OPCODE_Y0 = 1,
MUL_HU_LS_RRR_0_OPCODE_X0 = 58,
MUL_HU_LU_RRR_0_OPCODE_X0 = 59,
MUL_LS_LS_RRR_0_OPCODE_X0 = 60,
MUL_LS_LS_RRR_8_OPCODE_Y0 = 2,
MUL_LS_LU_RRR_0_OPCODE_X0 = 61,
MUL_LU_LU_RRR_0_OPCODE_X0 = 62,
MUL_LU_LU_RRR_8_OPCODE_Y0 = 3,
MZ_RRR_0_OPCODE_X0 = 63,
MZ_RRR_0_OPCODE_X1 = 27,
MZ_RRR_4_OPCODE_Y0 = 3,
MZ_RRR_4_OPCODE_Y1 = 3,
NAP_UNARY_OPCODE_X1 = 32,
NOP_UNARY_OPCODE_X0 = 5,
NOP_UNARY_OPCODE_X1 = 33,
NOP_UNARY_OPCODE_Y0 = 5,
NOP_UNARY_OPCODE_Y1 = 15,
NOR_RRR_0_OPCODE_X0 = 64,
NOR_RRR_0_OPCODE_X1 = 28,
NOR_RRR_5_OPCODE_Y0 = 1,
NOR_RRR_5_OPCODE_Y1 = 1,
ORI_IMM8_OPCODE_X0 = 7,
ORI_IMM8_OPCODE_X1 = 24,
OR_RRR_0_OPCODE_X0 = 65,
OR_RRR_0_OPCODE_X1 = 29,
OR_RRR_5_OPCODE_Y0 = 2,
OR_RRR_5_OPCODE_Y1 = 2,
PCNT_UNARY_OPCODE_X0 = 6,
PCNT_UNARY_OPCODE_Y0 = 6,
REVBITS_UNARY_OPCODE_X0 = 7,
REVBITS_UNARY_OPCODE_Y0 = 7,
REVBYTES_UNARY_OPCODE_X0 = 8,
REVBYTES_UNARY_OPCODE_Y0 = 8,
ROTLI_SHIFT_OPCODE_X0 = 1,
ROTLI_SHIFT_OPCODE_X1 = 1,
ROTLI_SHIFT_OPCODE_Y0 = 0,
ROTLI_SHIFT_OPCODE_Y1 = 0,
ROTL_RRR_0_OPCODE_X0 = 66,
ROTL_RRR_0_OPCODE_X1 = 30,
ROTL_RRR_6_OPCODE_Y0 = 0,
ROTL_RRR_6_OPCODE_Y1 = 0,
RRR_0_OPCODE_X0 = 5,
RRR_0_OPCODE_X1 = 5,
RRR_0_OPCODE_Y0 = 5,
RRR_0_OPCODE_Y1 = 6,
RRR_1_OPCODE_Y0 = 6,
RRR_1_OPCODE_Y1 = 7,
RRR_2_OPCODE_Y0 = 7,
RRR_2_OPCODE_Y1 = 8,
RRR_3_OPCODE_Y0 = 8,
RRR_3_OPCODE_Y1 = 9,
RRR_4_OPCODE_Y0 = 9,
RRR_4_OPCODE_Y1 = 10,
RRR_5_OPCODE_Y0 = 10,
RRR_5_OPCODE_Y1 = 11,
RRR_6_OPCODE_Y0 = 11,
RRR_6_OPCODE_Y1 = 12,
RRR_7_OPCODE_Y0 = 12,
RRR_7_OPCODE_Y1 = 13,
RRR_8_OPCODE_Y0 = 13,
RRR_9_OPCODE_Y0 = 14,
SHIFT_OPCODE_X0 = 6,
SHIFT_OPCODE_X1 = 6,
SHIFT_OPCODE_Y0 = 15,
SHIFT_OPCODE_Y1 = 14,
SHL16INSLI_OPCODE_X0 = 7,
SHL16INSLI_OPCODE_X1 = 7,
SHL1ADDX_RRR_0_OPCODE_X0 = 67,
SHL1ADDX_RRR_0_OPCODE_X1 = 31,
SHL1ADDX_RRR_7_OPCODE_Y0 = 1,
SHL1ADDX_RRR_7_OPCODE_Y1 = 1,
SHL1ADD_RRR_0_OPCODE_X0 = 68,
SHL1ADD_RRR_0_OPCODE_X1 = 32,
SHL1ADD_RRR_1_OPCODE_Y0 = 0,
SHL1ADD_RRR_1_OPCODE_Y1 = 0,
SHL2ADDX_RRR_0_OPCODE_X0 = 69,
SHL2ADDX_RRR_0_OPCODE_X1 = 33,
SHL2ADDX_RRR_7_OPCODE_Y0 = 2,
SHL2ADDX_RRR_7_OPCODE_Y1 = 2,
SHL2ADD_RRR_0_OPCODE_X0 = 70,
SHL2ADD_RRR_0_OPCODE_X1 = 34,
SHL2ADD_RRR_1_OPCODE_Y0 = 1,
SHL2ADD_RRR_1_OPCODE_Y1 = 1,
SHL3ADDX_RRR_0_OPCODE_X0 = 71,
SHL3ADDX_RRR_0_OPCODE_X1 = 35,
SHL3ADDX_RRR_7_OPCODE_Y0 = 3,
SHL3ADDX_RRR_7_OPCODE_Y1 = 3,
SHL3ADD_RRR_0_OPCODE_X0 = 72,
SHL3ADD_RRR_0_OPCODE_X1 = 36,
SHL3ADD_RRR_1_OPCODE_Y0 = 2,
SHL3ADD_RRR_1_OPCODE_Y1 = 2,
SHLI_SHIFT_OPCODE_X0 = 2,
SHLI_SHIFT_OPCODE_X1 = 2,
SHLI_SHIFT_OPCODE_Y0 = 1,
SHLI_SHIFT_OPCODE_Y1 = 1,
SHLXI_SHIFT_OPCODE_X0 = 3,
SHLXI_SHIFT_OPCODE_X1 = 3,
SHLX_RRR_0_OPCODE_X0 = 73,
SHLX_RRR_0_OPCODE_X1 = 37,
SHL_RRR_0_OPCODE_X0 = 74,
SHL_RRR_0_OPCODE_X1 = 38,
SHL_RRR_6_OPCODE_Y0 = 1,
SHL_RRR_6_OPCODE_Y1 = 1,
SHRSI_SHIFT_OPCODE_X0 = 4,
SHRSI_SHIFT_OPCODE_X1 = 4,
SHRSI_SHIFT_OPCODE_Y0 = 2,
SHRSI_SHIFT_OPCODE_Y1 = 2,
SHRS_RRR_0_OPCODE_X0 = 75,
SHRS_RRR_0_OPCODE_X1 = 39,
SHRS_RRR_6_OPCODE_Y0 = 2,
SHRS_RRR_6_OPCODE_Y1 = 2,
SHRUI_SHIFT_OPCODE_X0 = 5,
SHRUI_SHIFT_OPCODE_X1 = 5,
SHRUI_SHIFT_OPCODE_Y0 = 3,
SHRUI_SHIFT_OPCODE_Y1 = 3,
SHRUXI_SHIFT_OPCODE_X0 = 6,
SHRUXI_SHIFT_OPCODE_X1 = 6,
SHRUX_RRR_0_OPCODE_X0 = 76,
SHRUX_RRR_0_OPCODE_X1 = 40,
SHRU_RRR_0_OPCODE_X0 = 77,
SHRU_RRR_0_OPCODE_X1 = 41,
SHRU_RRR_6_OPCODE_Y0 = 3,
SHRU_RRR_6_OPCODE_Y1 = 3,
SHUFFLEBYTES_RRR_0_OPCODE_X0 = 78,
ST1_ADD_IMM8_OPCODE_X1 = 25,
ST1_OPCODE_Y2 = 0,
ST1_RRR_0_OPCODE_X1 = 42,
ST2_ADD_IMM8_OPCODE_X1 = 26,
ST2_OPCODE_Y2 = 1,
ST2_RRR_0_OPCODE_X1 = 43,
ST4_ADD_IMM8_OPCODE_X1 = 27,
ST4_OPCODE_Y2 = 2,
ST4_RRR_0_OPCODE_X1 = 44,
STNT1_ADD_IMM8_OPCODE_X1 = 28,
STNT1_RRR_0_OPCODE_X1 = 45,
STNT2_ADD_IMM8_OPCODE_X1 = 29,
STNT2_RRR_0_OPCODE_X1 = 46,
STNT4_ADD_IMM8_OPCODE_X1 = 30,
STNT4_RRR_0_OPCODE_X1 = 47,
STNT_ADD_IMM8_OPCODE_X1 = 31,
STNT_RRR_0_OPCODE_X1 = 48,
ST_ADD_IMM8_OPCODE_X1 = 32,
ST_OPCODE_Y2 = 3,
ST_RRR_0_OPCODE_X1 = 49,
SUBXSC_RRR_0_OPCODE_X0 = 79,
SUBXSC_RRR_0_OPCODE_X1 = 50,
SUBX_RRR_0_OPCODE_X0 = 80,
SUBX_RRR_0_OPCODE_X1 = 51,
SUBX_RRR_0_OPCODE_Y0 = 2,
SUBX_RRR_0_OPCODE_Y1 = 2,
SUB_RRR_0_OPCODE_X0 = 81,
SUB_RRR_0_OPCODE_X1 = 52,
SUB_RRR_0_OPCODE_Y0 = 3,
SUB_RRR_0_OPCODE_Y1 = 3,
SWINT0_UNARY_OPCODE_X1 = 34,
SWINT1_UNARY_OPCODE_X1 = 35,
SWINT2_UNARY_OPCODE_X1 = 36,
SWINT3_UNARY_OPCODE_X1 = 37,
TBLIDXB0_UNARY_OPCODE_X0 = 9,
TBLIDXB0_UNARY_OPCODE_Y0 = 9,
TBLIDXB1_UNARY_OPCODE_X0 = 10,
TBLIDXB1_UNARY_OPCODE_Y0 = 10,
TBLIDXB2_UNARY_OPCODE_X0 = 11,
TBLIDXB2_UNARY_OPCODE_Y0 = 11,
TBLIDXB3_UNARY_OPCODE_X0 = 12,
TBLIDXB3_UNARY_OPCODE_Y0 = 12,
UNARY_RRR_0_OPCODE_X0 = 82,
UNARY_RRR_0_OPCODE_X1 = 53,
UNARY_RRR_1_OPCODE_Y0 = 3,
UNARY_RRR_1_OPCODE_Y1 = 3,
V1ADDI_IMM8_OPCODE_X0 = 8,
V1ADDI_IMM8_OPCODE_X1 = 33,
V1ADDUC_RRR_0_OPCODE_X0 = 83,
V1ADDUC_RRR_0_OPCODE_X1 = 54,
V1ADD_RRR_0_OPCODE_X0 = 84,
V1ADD_RRR_0_OPCODE_X1 = 55,
V1ADIFFU_RRR_0_OPCODE_X0 = 85,
V1AVGU_RRR_0_OPCODE_X0 = 86,
V1CMPEQI_IMM8_OPCODE_X0 = 9,
V1CMPEQI_IMM8_OPCODE_X1 = 34,
V1CMPEQ_RRR_0_OPCODE_X0 = 87,
V1CMPEQ_RRR_0_OPCODE_X1 = 56,
V1CMPLES_RRR_0_OPCODE_X0 = 88,
V1CMPLES_RRR_0_OPCODE_X1 = 57,
V1CMPLEU_RRR_0_OPCODE_X0 = 89,
V1CMPLEU_RRR_0_OPCODE_X1 = 58,
V1CMPLTSI_IMM8_OPCODE_X0 = 10,
V1CMPLTSI_IMM8_OPCODE_X1 = 35,
V1CMPLTS_RRR_0_OPCODE_X0 = 90,
V1CMPLTS_RRR_0_OPCODE_X1 = 59,
V1CMPLTUI_IMM8_OPCODE_X0 = 11,
V1CMPLTUI_IMM8_OPCODE_X1 = 36,
V1CMPLTU_RRR_0_OPCODE_X0 = 91,
V1CMPLTU_RRR_0_OPCODE_X1 = 60,
V1CMPNE_RRR_0_OPCODE_X0 = 92,
V1CMPNE_RRR_0_OPCODE_X1 = 61,
V1DDOTPUA_RRR_0_OPCODE_X0 = 161,
V1DDOTPUSA_RRR_0_OPCODE_X0 = 93,
V1DDOTPUS_RRR_0_OPCODE_X0 = 94,
V1DDOTPU_RRR_0_OPCODE_X0 = 162,
V1DOTPA_RRR_0_OPCODE_X0 = 95,
V1DOTPUA_RRR_0_OPCODE_X0 = 163,
V1DOTPUSA_RRR_0_OPCODE_X0 = 96,
V1DOTPUS_RRR_0_OPCODE_X0 = 97,
V1DOTPU_RRR_0_OPCODE_X0 = 164,
V1DOTP_RRR_0_OPCODE_X0 = 98,
V1INT_H_RRR_0_OPCODE_X0 = 99,
V1INT_H_RRR_0_OPCODE_X1 = 62,
V1INT_L_RRR_0_OPCODE_X0 = 100,
V1INT_L_RRR_0_OPCODE_X1 = 63,
V1MAXUI_IMM8_OPCODE_X0 = 12,
V1MAXUI_IMM8_OPCODE_X1 = 37,
V1MAXU_RRR_0_OPCODE_X0 = 101,
V1MAXU_RRR_0_OPCODE_X1 = 64,
V1MINUI_IMM8_OPCODE_X0 = 13,
V1MINUI_IMM8_OPCODE_X1 = 38,
V1MINU_RRR_0_OPCODE_X0 = 102,
V1MINU_RRR_0_OPCODE_X1 = 65,
V1MNZ_RRR_0_OPCODE_X0 = 103,
V1MNZ_RRR_0_OPCODE_X1 = 66,
V1MULTU_RRR_0_OPCODE_X0 = 104,
V1MULUS_RRR_0_OPCODE_X0 = 105,
V1MULU_RRR_0_OPCODE_X0 = 106,
V1MZ_RRR_0_OPCODE_X0 = 107,
V1MZ_RRR_0_OPCODE_X1 = 67,
V1SADAU_RRR_0_OPCODE_X0 = 108,
V1SADU_RRR_0_OPCODE_X0 = 109,
V1SHLI_SHIFT_OPCODE_X0 = 7,
V1SHLI_SHIFT_OPCODE_X1 = 7,
V1SHL_RRR_0_OPCODE_X0 = 110,
V1SHL_RRR_0_OPCODE_X1 = 68,
V1SHRSI_SHIFT_OPCODE_X0 = 8,
V1SHRSI_SHIFT_OPCODE_X1 = 8,
V1SHRS_RRR_0_OPCODE_X0 = 111,
V1SHRS_RRR_0_OPCODE_X1 = 69,
V1SHRUI_SHIFT_OPCODE_X0 = 9,
V1SHRUI_SHIFT_OPCODE_X1 = 9,
V1SHRU_RRR_0_OPCODE_X0 = 112,
V1SHRU_RRR_0_OPCODE_X1 = 70,
V1SUBUC_RRR_0_OPCODE_X0 = 113,
V1SUBUC_RRR_0_OPCODE_X1 = 71,
V1SUB_RRR_0_OPCODE_X0 = 114,
V1SUB_RRR_0_OPCODE_X1 = 72,
V2ADDI_IMM8_OPCODE_X0 = 14,
V2ADDI_IMM8_OPCODE_X1 = 39,
V2ADDSC_RRR_0_OPCODE_X0 = 115,
V2ADDSC_RRR_0_OPCODE_X1 = 73,
V2ADD_RRR_0_OPCODE_X0 = 116,
V2ADD_RRR_0_OPCODE_X1 = 74,
V2ADIFFS_RRR_0_OPCODE_X0 = 117,
V2AVGS_RRR_0_OPCODE_X0 = 118,
V2CMPEQI_IMM8_OPCODE_X0 = 15,
V2CMPEQI_IMM8_OPCODE_X1 = 40,
V2CMPEQ_RRR_0_OPCODE_X0 = 119,
V2CMPEQ_RRR_0_OPCODE_X1 = 75,
V2CMPLES_RRR_0_OPCODE_X0 = 120,
V2CMPLES_RRR_0_OPCODE_X1 = 76,
V2CMPLEU_RRR_0_OPCODE_X0 = 121,
V2CMPLEU_RRR_0_OPCODE_X1 = 77,
V2CMPLTSI_IMM8_OPCODE_X0 = 16,
V2CMPLTSI_IMM8_OPCODE_X1 = 41,
V2CMPLTS_RRR_0_OPCODE_X0 = 122,
V2CMPLTS_RRR_0_OPCODE_X1 = 78,
V2CMPLTUI_IMM8_OPCODE_X0 = 17,
V2CMPLTUI_IMM8_OPCODE_X1 = 42,
V2CMPLTU_RRR_0_OPCODE_X0 = 123,
V2CMPLTU_RRR_0_OPCODE_X1 = 79,
V2CMPNE_RRR_0_OPCODE_X0 = 124,
V2CMPNE_RRR_0_OPCODE_X1 = 80,
V2DOTPA_RRR_0_OPCODE_X0 = 125,
V2DOTP_RRR_0_OPCODE_X0 = 126,
V2INT_H_RRR_0_OPCODE_X0 = 127,
V2INT_H_RRR_0_OPCODE_X1 = 81,
V2INT_L_RRR_0_OPCODE_X0 = 128,
V2INT_L_RRR_0_OPCODE_X1 = 82,
V2MAXSI_IMM8_OPCODE_X0 = 18,
V2MAXSI_IMM8_OPCODE_X1 = 43,
V2MAXS_RRR_0_OPCODE_X0 = 129,
V2MAXS_RRR_0_OPCODE_X1 = 83,
V2MINSI_IMM8_OPCODE_X0 = 19,
V2MINSI_IMM8_OPCODE_X1 = 44,
V2MINS_RRR_0_OPCODE_X0 = 130,
V2MINS_RRR_0_OPCODE_X1 = 84,
V2MNZ_RRR_0_OPCODE_X0 = 131,
V2MNZ_RRR_0_OPCODE_X1 = 85,
V2MULFSC_RRR_0_OPCODE_X0 = 132,
V2MULS_RRR_0_OPCODE_X0 = 133,
V2MULTS_RRR_0_OPCODE_X0 = 134,
V2MZ_RRR_0_OPCODE_X0 = 135,
V2MZ_RRR_0_OPCODE_X1 = 86,
V2PACKH_RRR_0_OPCODE_X0 = 136,
V2PACKH_RRR_0_OPCODE_X1 = 87,
V2PACKL_RRR_0_OPCODE_X0 = 137,
V2PACKL_RRR_0_OPCODE_X1 = 88,
V2PACKUC_RRR_0_OPCODE_X0 = 138,
V2PACKUC_RRR_0_OPCODE_X1 = 89,
V2SADAS_RRR_0_OPCODE_X0 = 139,
V2SADAU_RRR_0_OPCODE_X0 = 140,
V2SADS_RRR_0_OPCODE_X0 = 141,
V2SADU_RRR_0_OPCODE_X0 = 142,
V2SHLI_SHIFT_OPCODE_X0 = 10,
V2SHLI_SHIFT_OPCODE_X1 = 10,
V2SHLSC_RRR_0_OPCODE_X0 = 143,
V2SHLSC_RRR_0_OPCODE_X1 = 90,
V2SHL_RRR_0_OPCODE_X0 = 144,
V2SHL_RRR_0_OPCODE_X1 = 91,
V2SHRSI_SHIFT_OPCODE_X0 = 11,
V2SHRSI_SHIFT_OPCODE_X1 = 11,
V2SHRS_RRR_0_OPCODE_X0 = 145,
V2SHRS_RRR_0_OPCODE_X1 = 92,
V2SHRUI_SHIFT_OPCODE_X0 = 12,
V2SHRUI_SHIFT_OPCODE_X1 = 12,
V2SHRU_RRR_0_OPCODE_X0 = 146,
V2SHRU_RRR_0_OPCODE_X1 = 93,
V2SUBSC_RRR_0_OPCODE_X0 = 147,
V2SUBSC_RRR_0_OPCODE_X1 = 94,
V2SUB_RRR_0_OPCODE_X0 = 148,
V2SUB_RRR_0_OPCODE_X1 = 95,
V4ADDSC_RRR_0_OPCODE_X0 = 149,
V4ADDSC_RRR_0_OPCODE_X1 = 96,
V4ADD_RRR_0_OPCODE_X0 = 150,
V4ADD_RRR_0_OPCODE_X1 = 97,
V4INT_H_RRR_0_OPCODE_X0 = 151,
V4INT_H_RRR_0_OPCODE_X1 = 98,
V4INT_L_RRR_0_OPCODE_X0 = 152,
V4INT_L_RRR_0_OPCODE_X1 = 99,
V4PACKSC_RRR_0_OPCODE_X0 = 153,
V4PACKSC_RRR_0_OPCODE_X1 = 100,
V4SHLSC_RRR_0_OPCODE_X0 = 154,
V4SHLSC_RRR_0_OPCODE_X1 = 101,
V4SHL_RRR_0_OPCODE_X0 = 155,
V4SHL_RRR_0_OPCODE_X1 = 102,
V4SHRS_RRR_0_OPCODE_X0 = 156,
V4SHRS_RRR_0_OPCODE_X1 = 103,
V4SHRU_RRR_0_OPCODE_X0 = 157,
V4SHRU_RRR_0_OPCODE_X1 = 104,
V4SUBSC_RRR_0_OPCODE_X0 = 158,
V4SUBSC_RRR_0_OPCODE_X1 = 105,
V4SUB_RRR_0_OPCODE_X0 = 159,
V4SUB_RRR_0_OPCODE_X1 = 106,
WH64_UNARY_OPCODE_X1 = 38,
XORI_IMM8_OPCODE_X0 = 20,
XORI_IMM8_OPCODE_X1 = 45,
XOR_RRR_0_OPCODE_X0 = 160,
XOR_RRR_0_OPCODE_X1 = 107,
XOR_RRR_5_OPCODE_Y0 = 3,
XOR_RRR_5_OPCODE_Y1 = 3
};
static __inline unsigned int
get_BFEnd_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0x3f);
}
static __inline unsigned int
get_BFOpcodeExtension_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 24)) & 0xf);
}
static __inline unsigned int
get_BFStart_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 18)) & 0x3f);
}
static __inline unsigned int
get_BrOff_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 31)) & 0x0000003f) |
(((unsigned int)(n >> 37)) & 0x0001ffc0);
}
static __inline unsigned int
get_BrType_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 54)) & 0x1f);
}
static __inline unsigned int
get_Dest_Imm8_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 31)) & 0x0000003f) |
(((unsigned int)(n >> 43)) & 0x000000c0);
}
static __inline unsigned int
get_Dest_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 0)) & 0x3f);
}
static __inline unsigned int
get_Dest_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 31)) & 0x3f);
}
static __inline unsigned int
get_Dest_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 0)) & 0x3f);
}
static __inline unsigned int
get_Dest_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 31)) & 0x3f);
}
static __inline unsigned int
get_Imm16_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0xffff);
}
static __inline unsigned int
get_Imm16_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0xffff);
}
static __inline unsigned int
get_Imm8OpcodeExtension_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 20)) & 0xff);
}
static __inline unsigned int
get_Imm8OpcodeExtension_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 51)) & 0xff);
}
static __inline unsigned int
get_Imm8_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0xff);
}
static __inline unsigned int
get_Imm8_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0xff);
}
static __inline unsigned int
get_Imm8_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0xff);
}
static __inline unsigned int
get_Imm8_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0xff);
}
static __inline unsigned int
get_JumpOff_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 31)) & 0x7ffffff);
}
static __inline unsigned int
get_JumpOpcodeExtension_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 58)) & 0x1);
}
static __inline unsigned int
get_MF_Imm14_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 37)) & 0x3fff);
}
static __inline unsigned int
get_MT_Imm14_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 31)) & 0x0000003f) |
(((unsigned int)(n >> 37)) & 0x00003fc0);
}
static __inline unsigned int
get_Mode(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 62)) & 0x3);
}
static __inline unsigned int
get_Opcode_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 28)) & 0x7);
}
static __inline unsigned int
get_Opcode_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 59)) & 0x7);
}
static __inline unsigned int
get_Opcode_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 27)) & 0xf);
}
static __inline unsigned int
get_Opcode_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 58)) & 0xf);
}
static __inline unsigned int
get_Opcode_Y2(tilegx_bundle_bits n)
{
return (((n >> 26)) & 0x00000001) |
(((unsigned int)(n >> 56)) & 0x00000002);
}
static __inline unsigned int
get_RRROpcodeExtension_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 18)) & 0x3ff);
}
static __inline unsigned int
get_RRROpcodeExtension_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 49)) & 0x3ff);
}
static __inline unsigned int
get_RRROpcodeExtension_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 18)) & 0x3);
}
static __inline unsigned int
get_RRROpcodeExtension_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 49)) & 0x3);
}
static __inline unsigned int
get_ShAmt_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0x3f);
}
static __inline unsigned int
get_ShAmt_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0x3f);
}
static __inline unsigned int
get_ShAmt_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0x3f);
}
static __inline unsigned int
get_ShAmt_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0x3f);
}
static __inline unsigned int
get_ShiftOpcodeExtension_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 18)) & 0x3ff);
}
static __inline unsigned int
get_ShiftOpcodeExtension_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 49)) & 0x3ff);
}
static __inline unsigned int
get_ShiftOpcodeExtension_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 18)) & 0x3);
}
static __inline unsigned int
get_ShiftOpcodeExtension_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 49)) & 0x3);
}
static __inline unsigned int
get_SrcA_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 6)) & 0x3f);
}
static __inline unsigned int
get_SrcA_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 37)) & 0x3f);
}
static __inline unsigned int
get_SrcA_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 6)) & 0x3f);
}
static __inline unsigned int
get_SrcA_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 37)) & 0x3f);
}
static __inline unsigned int
get_SrcA_Y2(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 20)) & 0x3f);
}
static __inline unsigned int
get_SrcBDest_Y2(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 51)) & 0x3f);
}
static __inline unsigned int
get_SrcB_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0x3f);
}
static __inline unsigned int
get_SrcB_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0x3f);
}
static __inline unsigned int
get_SrcB_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0x3f);
}
static __inline unsigned int
get_SrcB_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0x3f);
}
static __inline unsigned int
get_UnaryOpcodeExtension_X0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0x3f);
}
static __inline unsigned int
get_UnaryOpcodeExtension_X1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0x3f);
}
static __inline unsigned int
get_UnaryOpcodeExtension_Y0(tilegx_bundle_bits num)
{
const unsigned int n = (unsigned int)num;
return (((n >> 12)) & 0x3f);
}
static __inline unsigned int
get_UnaryOpcodeExtension_Y1(tilegx_bundle_bits n)
{
return (((unsigned int)(n >> 43)) & 0x3f);
}
static __inline int
sign_extend(int n, int num_bits)
{
int shift = (int)(sizeof(int) * 8 - num_bits);
return (n << shift) >> shift;
}
static __inline tilegx_bundle_bits
create_BFEnd_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 12);
}
static __inline tilegx_bundle_bits
create_BFOpcodeExtension_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0xf) << 24);
}
static __inline tilegx_bundle_bits
create_BFStart_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 18);
}
static __inline tilegx_bundle_bits
create_BrOff_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x0000003f)) << 31) |
(((tilegx_bundle_bits)(n & 0x0001ffc0)) << 37);
}
static __inline tilegx_bundle_bits
create_BrType_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x1f)) << 54);
}
static __inline tilegx_bundle_bits
create_Dest_Imm8_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x0000003f)) << 31) |
(((tilegx_bundle_bits)(n & 0x000000c0)) << 43);
}
static __inline tilegx_bundle_bits
create_Dest_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 0);
}
static __inline tilegx_bundle_bits
create_Dest_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 31);
}
static __inline tilegx_bundle_bits
create_Dest_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 0);
}
static __inline tilegx_bundle_bits
create_Dest_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 31);
}
static __inline tilegx_bundle_bits
create_Imm16_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0xffff) << 12);
}
static __inline tilegx_bundle_bits
create_Imm16_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0xffff)) << 43);
}
static __inline tilegx_bundle_bits
create_Imm8OpcodeExtension_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0xff) << 20);
}
static __inline tilegx_bundle_bits
create_Imm8OpcodeExtension_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0xff)) << 51);
}
static __inline tilegx_bundle_bits
create_Imm8_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0xff) << 12);
}
static __inline tilegx_bundle_bits
create_Imm8_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0xff)) << 43);
}
static __inline tilegx_bundle_bits
create_Imm8_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0xff) << 12);
}
static __inline tilegx_bundle_bits
create_Imm8_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0xff)) << 43);
}
static __inline tilegx_bundle_bits
create_JumpOff_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x7ffffff)) << 31);
}
static __inline tilegx_bundle_bits
create_JumpOpcodeExtension_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x1)) << 58);
}
static __inline tilegx_bundle_bits
create_MF_Imm14_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3fff)) << 37);
}
static __inline tilegx_bundle_bits
create_MT_Imm14_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x0000003f)) << 31) |
(((tilegx_bundle_bits)(n & 0x00003fc0)) << 37);
}
static __inline tilegx_bundle_bits
create_Mode(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3)) << 62);
}
static __inline tilegx_bundle_bits
create_Opcode_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x7) << 28);
}
static __inline tilegx_bundle_bits
create_Opcode_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x7)) << 59);
}
static __inline tilegx_bundle_bits
create_Opcode_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0xf) << 27);
}
static __inline tilegx_bundle_bits
create_Opcode_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0xf)) << 58);
}
static __inline tilegx_bundle_bits
create_Opcode_Y2(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x00000001) << 26) |
(((tilegx_bundle_bits)(n & 0x00000002)) << 56);
}
static __inline tilegx_bundle_bits
create_RRROpcodeExtension_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3ff) << 18);
}
static __inline tilegx_bundle_bits
create_RRROpcodeExtension_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3ff)) << 49);
}
static __inline tilegx_bundle_bits
create_RRROpcodeExtension_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3) << 18);
}
static __inline tilegx_bundle_bits
create_RRROpcodeExtension_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3)) << 49);
}
static __inline tilegx_bundle_bits
create_ShAmt_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 12);
}
static __inline tilegx_bundle_bits
create_ShAmt_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
}
static __inline tilegx_bundle_bits
create_ShAmt_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 12);
}
static __inline tilegx_bundle_bits
create_ShAmt_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
}
static __inline tilegx_bundle_bits
create_ShiftOpcodeExtension_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3ff) << 18);
}
static __inline tilegx_bundle_bits
create_ShiftOpcodeExtension_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3ff)) << 49);
}
static __inline tilegx_bundle_bits
create_ShiftOpcodeExtension_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3) << 18);
}
static __inline tilegx_bundle_bits
create_ShiftOpcodeExtension_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3)) << 49);
}
static __inline tilegx_bundle_bits
create_SrcA_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 6);
}
static __inline tilegx_bundle_bits
create_SrcA_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 37);
}
static __inline tilegx_bundle_bits
create_SrcA_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 6);
}
static __inline tilegx_bundle_bits
create_SrcA_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 37);
}
static __inline tilegx_bundle_bits
create_SrcA_Y2(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 20);
}
static __inline tilegx_bundle_bits
create_SrcBDest_Y2(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 51);
}
static __inline tilegx_bundle_bits
create_SrcB_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 12);
}
static __inline tilegx_bundle_bits
create_SrcB_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
}
static __inline tilegx_bundle_bits
create_SrcB_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 12);
}
static __inline tilegx_bundle_bits
create_SrcB_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
}
static __inline tilegx_bundle_bits
create_UnaryOpcodeExtension_X0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 12);
}
static __inline tilegx_bundle_bits
create_UnaryOpcodeExtension_X1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
}
static __inline tilegx_bundle_bits
create_UnaryOpcodeExtension_Y0(int num)
{
const unsigned int n = (unsigned int)num;
return ((n & 0x3f) << 12);
}
static __inline tilegx_bundle_bits
create_UnaryOpcodeExtension_Y1(int num)
{
const unsigned int n = (unsigned int)num;
return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
}
const struct tilegx_opcode tilegx_opcodes[336] =
{
{ "bpt", TILEGX_OPC_BPT, 0x2, 0, TREG_ZERO, 0,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffffffff80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a44ae00000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "info", TILEGX_OPC_INFO, 0xf, 1, TREG_ZERO, 1,
{ { 0 }, { 1 }, { 2 }, { 3 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00fffULL,
0xfff807ff80000000ULL,
0x0000000078000fffULL,
0x3c0007ff80000000ULL,
0ULL
},
{
0x0000000040300fffULL,
0x181807ff80000000ULL,
0x0000000010000fffULL,
0x0c0007ff80000000ULL,
-1ULL
}
#endif
},
{ "infol", TILEGX_OPC_INFOL, 0x3, 1, TREG_ZERO, 1,
{ { 4 }, { 5 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc000000070000fffULL,
0xf80007ff80000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000070000fffULL,
0x380007ff80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld4s_tls", TILEGX_OPC_LD4S_TLS, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1858000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld_tls", TILEGX_OPC_LD_TLS, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18a0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "move", TILEGX_OPC_MOVE, 0xf, 2, TREG_ZERO, 1,
{ { 8, 9 }, { 6, 7 }, { 10, 11 }, { 12, 13 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0xfffff80000000000ULL,
0x00000000780ff000ULL,
0x3c07f80000000000ULL,
0ULL
},
{
0x000000005107f000ULL,
0x283bf80000000000ULL,
0x00000000500bf000ULL,
0x2c05f80000000000ULL,
-1ULL
}
#endif
},
{ "movei", TILEGX_OPC_MOVEI, 0xf, 2, TREG_ZERO, 1,
{ { 8, 0 }, { 6, 1 }, { 10, 2 }, { 12, 3 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00fc0ULL,
0xfff807e000000000ULL,
0x0000000078000fc0ULL,
0x3c0007e000000000ULL,
0ULL
},
{
0x0000000040100fc0ULL,
0x180807e000000000ULL,
0x0000000000000fc0ULL,
0x040007e000000000ULL,
-1ULL
}
#endif
},
{ "moveli", TILEGX_OPC_MOVELI, 0x3, 2, TREG_ZERO, 1,
{ { 8, 4 }, { 6, 5 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc000000070000fc0ULL,
0xf80007e000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000010000fc0ULL,
0x000007e000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "prefetch", TILEGX_OPC_PREFETCH, 0x12, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff81f80000000ULL,
0ULL,
0ULL,
0xc3f8000004000000ULL
},
{
-1ULL,
0x286a801f80000000ULL,
-1ULL,
-1ULL,
0x41f8000004000000ULL
}
#endif
},
{ "prefetch_add_l1", TILEGX_OPC_PREFETCH_ADD_L1, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8001f80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1840001f80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "prefetch_add_l1_fault", TILEGX_OPC_PREFETCH_ADD_L1_FAULT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8001f80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1838001f80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "prefetch_add_l2", TILEGX_OPC_PREFETCH_ADD_L2, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8001f80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1850001f80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "prefetch_add_l2_fault", TILEGX_OPC_PREFETCH_ADD_L2_FAULT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8001f80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1848001f80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "prefetch_add_l3", TILEGX_OPC_PREFETCH_ADD_L3, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8001f80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1860001f80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "prefetch_add_l3_fault", TILEGX_OPC_PREFETCH_ADD_L3_FAULT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8001f80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1858001f80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "prefetch_l1", TILEGX_OPC_PREFETCH_L1, 0x12, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff81f80000000ULL,
0ULL,
0ULL,
0xc3f8000004000000ULL
},
{
-1ULL,
0x286a801f80000000ULL,
-1ULL,
-1ULL,
0x41f8000004000000ULL
}
#endif
},
{ "prefetch_l1_fault", TILEGX_OPC_PREFETCH_L1_FAULT, 0x12, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff81f80000000ULL,
0ULL,
0ULL,
0xc3f8000004000000ULL
},
{
-1ULL,
0x286a781f80000000ULL,
-1ULL,
-1ULL,
0x41f8000000000000ULL
}
#endif
},
{ "prefetch_l2", TILEGX_OPC_PREFETCH_L2, 0x12, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff81f80000000ULL,
0ULL,
0ULL,
0xc3f8000004000000ULL
},
{
-1ULL,
0x286a901f80000000ULL,
-1ULL,
-1ULL,
0x43f8000004000000ULL
}
#endif
},
{ "prefetch_l2_fault", TILEGX_OPC_PREFETCH_L2_FAULT, 0x12, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff81f80000000ULL,
0ULL,
0ULL,
0xc3f8000004000000ULL
},
{
-1ULL,
0x286a881f80000000ULL,
-1ULL,
-1ULL,
0x43f8000000000000ULL
}
#endif
},
{ "prefetch_l3", TILEGX_OPC_PREFETCH_L3, 0x12, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff81f80000000ULL,
0ULL,
0ULL,
0xc3f8000004000000ULL
},
{
-1ULL,
0x286aa01f80000000ULL,
-1ULL,
-1ULL,
0x83f8000000000000ULL
}
#endif
},
{ "prefetch_l3_fault", TILEGX_OPC_PREFETCH_L3_FAULT, 0x12, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff81f80000000ULL,
0ULL,
0ULL,
0xc3f8000004000000ULL
},
{
-1ULL,
0x286a981f80000000ULL,
-1ULL,
-1ULL,
0x81f8000004000000ULL
}
#endif
},
{ "raise", TILEGX_OPC_RAISE, 0x2, 0, TREG_ZERO, 1,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffffffff80000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a44ae80000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "add", TILEGX_OPC_ADD, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x00000000500c0000ULL,
0x2806000000000000ULL,
0x0000000028040000ULL,
0x1802000000000000ULL,
-1ULL
}
#endif
},
{ "addi", TILEGX_OPC_ADDI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 10, 11, 2 }, { 12, 13, 3 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0x0000000078000000ULL,
0x3c00000000000000ULL,
0ULL
},
{
0x0000000040100000ULL,
0x1808000000000000ULL,
0ULL,
0x0400000000000000ULL,
-1ULL
}
#endif
},
{ "addli", TILEGX_OPC_ADDLI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 4 }, { 6, 7, 5 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc000000070000000ULL,
0xf800000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000010000000ULL,
0ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "addx", TILEGX_OPC_ADDX, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050080000ULL,
0x2804000000000000ULL,
0x0000000028000000ULL,
0x1800000000000000ULL,
-1ULL
}
#endif
},
{ "addxi", TILEGX_OPC_ADDXI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 10, 11, 2 }, { 12, 13, 3 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0x0000000078000000ULL,
0x3c00000000000000ULL,
0ULL
},
{
0x0000000040200000ULL,
0x1810000000000000ULL,
0x0000000008000000ULL,
0x0800000000000000ULL,
-1ULL
}
#endif
},
{ "addxli", TILEGX_OPC_ADDXLI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 4 }, { 6, 7, 5 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc000000070000000ULL,
0xf800000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000020000000ULL,
0x0800000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "addxsc", TILEGX_OPC_ADDXSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050040000ULL,
0x2802000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "and", TILEGX_OPC_AND, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050100000ULL,
0x2808000000000000ULL,
0x0000000050000000ULL,
0x2c00000000000000ULL,
-1ULL
}
#endif
},
{ "andi", TILEGX_OPC_ANDI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 10, 11, 2 }, { 12, 13, 3 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0x0000000078000000ULL,
0x3c00000000000000ULL,
0ULL
},
{
0x0000000040300000ULL,
0x1818000000000000ULL,
0x0000000010000000ULL,
0x0c00000000000000ULL,
-1ULL
}
#endif
},
{ "beqz", TILEGX_OPC_BEQZ, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1440000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "beqzt", TILEGX_OPC_BEQZT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1400000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bfexts", TILEGX_OPC_BFEXTS, 0x1, 4, TREG_ZERO, 1,
{ { 8, 9, 21, 22 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007f000000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000034000000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bfextu", TILEGX_OPC_BFEXTU, 0x1, 4, TREG_ZERO, 1,
{ { 8, 9, 21, 22 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007f000000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000035000000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bfins", TILEGX_OPC_BFINS, 0x1, 4, TREG_ZERO, 1,
{ { 23, 9, 21, 22 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007f000000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000036000000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bgez", TILEGX_OPC_BGEZ, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x14c0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bgezt", TILEGX_OPC_BGEZT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1480000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bgtz", TILEGX_OPC_BGTZ, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1540000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bgtzt", TILEGX_OPC_BGTZT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1500000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "blbc", TILEGX_OPC_BLBC, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x15c0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "blbct", TILEGX_OPC_BLBCT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1580000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "blbs", TILEGX_OPC_BLBS, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1640000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "blbst", TILEGX_OPC_BLBST, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1600000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "blez", TILEGX_OPC_BLEZ, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x16c0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "blezt", TILEGX_OPC_BLEZT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1680000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bltz", TILEGX_OPC_BLTZ, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1740000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bltzt", TILEGX_OPC_BLTZT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1700000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bnez", TILEGX_OPC_BNEZ, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x17c0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "bnezt", TILEGX_OPC_BNEZT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 20 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xffc0000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1780000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "clz", TILEGX_OPC_CLZ, 0x5, 2, TREG_ZERO, 1,
{ { 8, 9 }, { 0, }, { 10, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x0000000051481000ULL,
-1ULL,
0x00000000300c1000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmoveqz", TILEGX_OPC_CMOVEQZ, 0x5, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 24, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050140000ULL,
-1ULL,
0x0000000048000000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmovnez", TILEGX_OPC_CMOVNEZ, 0x5, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 24, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050180000ULL,
-1ULL,
0x0000000048040000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmpeq", TILEGX_OPC_CMPEQ, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x00000000501c0000ULL,
0x280a000000000000ULL,
0x0000000040000000ULL,
0x2404000000000000ULL,
-1ULL
}
#endif
},
{ "cmpeqi", TILEGX_OPC_CMPEQI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 10, 11, 2 }, { 12, 13, 3 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0x0000000078000000ULL,
0x3c00000000000000ULL,
0ULL
},
{
0x0000000040400000ULL,
0x1820000000000000ULL,
0x0000000018000000ULL,
0x1000000000000000ULL,
-1ULL
}
#endif
},
{ "cmpexch", TILEGX_OPC_CMPEXCH, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x280e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmpexch4", TILEGX_OPC_CMPEXCH4, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x280c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmples", TILEGX_OPC_CMPLES, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050200000ULL,
0x2810000000000000ULL,
0x0000000038000000ULL,
0x2000000000000000ULL,
-1ULL
}
#endif
},
{ "cmpleu", TILEGX_OPC_CMPLEU, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050240000ULL,
0x2812000000000000ULL,
0x0000000038040000ULL,
0x2002000000000000ULL,
-1ULL
}
#endif
},
{ "cmplts", TILEGX_OPC_CMPLTS, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050280000ULL,
0x2814000000000000ULL,
0x0000000038080000ULL,
0x2004000000000000ULL,
-1ULL
}
#endif
},
{ "cmpltsi", TILEGX_OPC_CMPLTSI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 10, 11, 2 }, { 12, 13, 3 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0x0000000078000000ULL,
0x3c00000000000000ULL,
0ULL
},
{
0x0000000040500000ULL,
0x1828000000000000ULL,
0x0000000020000000ULL,
0x1400000000000000ULL,
-1ULL
}
#endif
},
{ "cmpltu", TILEGX_OPC_CMPLTU, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x00000000502c0000ULL,
0x2816000000000000ULL,
0x00000000380c0000ULL,
0x2006000000000000ULL,
-1ULL
}
#endif
},
{ "cmpltui", TILEGX_OPC_CMPLTUI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040600000ULL,
0x1830000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmpne", TILEGX_OPC_CMPNE, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050300000ULL,
0x2818000000000000ULL,
0x0000000040040000ULL,
0x2406000000000000ULL,
-1ULL
}
#endif
},
{ "cmul", TILEGX_OPC_CMUL, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000504c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmula", TILEGX_OPC_CMULA, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050380000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmulaf", TILEGX_OPC_CMULAF, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050340000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmulf", TILEGX_OPC_CMULF, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050400000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmulfr", TILEGX_OPC_CMULFR, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000503c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmulh", TILEGX_OPC_CMULH, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050480000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "cmulhr", TILEGX_OPC_CMULHR, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050440000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "crc32_32", TILEGX_OPC_CRC32_32, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050500000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "crc32_8", TILEGX_OPC_CRC32_8, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050540000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ctz", TILEGX_OPC_CTZ, 0x5, 2, TREG_ZERO, 1,
{ { 8, 9 }, { 0, }, { 10, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x0000000051482000ULL,
-1ULL,
0x00000000300c2000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "dblalign", TILEGX_OPC_DBLALIGN, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050640000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "dblalign2", TILEGX_OPC_DBLALIGN2, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050580000ULL,
0x281a000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "dblalign4", TILEGX_OPC_DBLALIGN4, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000505c0000ULL,
0x281c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "dblalign6", TILEGX_OPC_DBLALIGN6, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050600000ULL,
0x281e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "drain", TILEGX_OPC_DRAIN, 0x2, 0, TREG_ZERO, 0,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a080000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "dtlbpr", TILEGX_OPC_DTLBPR, 0x2, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a100000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "exch", TILEGX_OPC_EXCH, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2822000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "exch4", TILEGX_OPC_EXCH4, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2820000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_add_flags", TILEGX_OPC_FDOUBLE_ADD_FLAGS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000506c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_addsub", TILEGX_OPC_FDOUBLE_ADDSUB, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050680000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_mul_flags", TILEGX_OPC_FDOUBLE_MUL_FLAGS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050700000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_pack1", TILEGX_OPC_FDOUBLE_PACK1, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050740000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_pack2", TILEGX_OPC_FDOUBLE_PACK2, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050780000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_sub_flags", TILEGX_OPC_FDOUBLE_SUB_FLAGS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000507c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_unpack_max", TILEGX_OPC_FDOUBLE_UNPACK_MAX, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050800000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fdouble_unpack_min", TILEGX_OPC_FDOUBLE_UNPACK_MIN, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050840000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchadd", TILEGX_OPC_FETCHADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x282a000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchadd4", TILEGX_OPC_FETCHADD4, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2824000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchaddgez", TILEGX_OPC_FETCHADDGEZ, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2828000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchaddgez4", TILEGX_OPC_FETCHADDGEZ4, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2826000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchand", TILEGX_OPC_FETCHAND, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x282e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchand4", TILEGX_OPC_FETCHAND4, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x282c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchor", TILEGX_OPC_FETCHOR, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2832000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fetchor4", TILEGX_OPC_FETCHOR4, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2830000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "finv", TILEGX_OPC_FINV, 0x2, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a180000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "flush", TILEGX_OPC_FLUSH, 0x2, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a280000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "flushwb", TILEGX_OPC_FLUSHWB, 0x2, 0, TREG_ZERO, 1,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a200000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fnop", TILEGX_OPC_FNOP, 0xf, 0, TREG_ZERO, 1,
{ { }, { }, { }, { }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0xfffff80000000000ULL,
0x00000000780ff000ULL,
0x3c07f80000000000ULL,
0ULL
},
{
0x0000000051483000ULL,
0x286a300000000000ULL,
0x00000000300c3000ULL,
0x1c06400000000000ULL,
-1ULL
}
#endif
},
{ "fsingle_add1", TILEGX_OPC_FSINGLE_ADD1, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050880000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fsingle_addsub2", TILEGX_OPC_FSINGLE_ADDSUB2, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000508c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fsingle_mul1", TILEGX_OPC_FSINGLE_MUL1, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050900000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fsingle_mul2", TILEGX_OPC_FSINGLE_MUL2, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050940000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fsingle_pack1", TILEGX_OPC_FSINGLE_PACK1, 0x5, 2, TREG_ZERO, 1,
{ { 8, 9 }, { 0, }, { 10, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x0000000051484000ULL,
-1ULL,
0x00000000300c4000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fsingle_pack2", TILEGX_OPC_FSINGLE_PACK2, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050980000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "fsingle_sub1", TILEGX_OPC_FSINGLE_SUB1, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000509c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "icoh", TILEGX_OPC_ICOH, 0x2, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a380000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ill", TILEGX_OPC_ILL, 0xa, 0, TREG_ZERO, 1,
{ { 0, }, { }, { 0, }, { }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0x3c07f80000000000ULL,
0ULL
},
{
-1ULL,
0x286a400000000000ULL,
-1ULL,
0x1c06480000000000ULL,
-1ULL
}
#endif
},
{ "inv", TILEGX_OPC_INV, 0x2, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a480000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "iret", TILEGX_OPC_IRET, 0x2, 0, TREG_ZERO, 1,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286a500000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "j", TILEGX_OPC_J, 0x2, 1, TREG_ZERO, 1,
{ { 0, }, { 25 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfc00000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2400000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "jal", TILEGX_OPC_JAL, 0x2, 1, TREG_LR, 1,
{ { 0, }, { 25 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfc00000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2000000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "jalr", TILEGX_OPC_JALR, 0xa, 1, TREG_LR, 1,
{ { 0, }, { 7 }, { 0, }, { 13 }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0x3c07f80000000000ULL,
0ULL
},
{
-1ULL,
0x286a600000000000ULL,
-1ULL,
0x1c06580000000000ULL,
-1ULL
}
#endif
},
{ "jalrp", TILEGX_OPC_JALRP, 0xa, 1, TREG_LR, 1,
{ { 0, }, { 7 }, { 0, }, { 13 }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0x3c07f80000000000ULL,
0ULL
},
{
-1ULL,
0x286a580000000000ULL,
-1ULL,
0x1c06500000000000ULL,
-1ULL
}
#endif
},
{ "jr", TILEGX_OPC_JR, 0xa, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 13 }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0x3c07f80000000000ULL,
0ULL
},
{
-1ULL,
0x286a700000000000ULL,
-1ULL,
0x1c06680000000000ULL,
-1ULL
}
#endif
},
{ "jrp", TILEGX_OPC_JRP, 0xa, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 13 }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0x3c07f80000000000ULL,
0ULL
},
{
-1ULL,
0x286a680000000000ULL,
-1ULL,
0x1c06600000000000ULL,
-1ULL
}
#endif
},
{ "ld", TILEGX_OPC_LD, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 26, 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x286ae80000000000ULL,
-1ULL,
-1ULL,
0x8200000004000000ULL
}
#endif
},
{ "ld1s", TILEGX_OPC_LD1S, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 26, 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x286a780000000000ULL,
-1ULL,
-1ULL,
0x4000000000000000ULL
}
#endif
},
{ "ld1s_add", TILEGX_OPC_LD1S_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1838000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld1u", TILEGX_OPC_LD1U, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 26, 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x286a800000000000ULL,
-1ULL,
-1ULL,
0x4000000004000000ULL
}
#endif
},
{ "ld1u_add", TILEGX_OPC_LD1U_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1840000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld2s", TILEGX_OPC_LD2S, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 26, 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x286a880000000000ULL,
-1ULL,
-1ULL,
0x4200000000000000ULL
}
#endif
},
{ "ld2s_add", TILEGX_OPC_LD2S_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1848000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld2u", TILEGX_OPC_LD2U, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 26, 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x286a900000000000ULL,
-1ULL,
-1ULL,
0x4200000004000000ULL
}
#endif
},
{ "ld2u_add", TILEGX_OPC_LD2U_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1850000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld4s", TILEGX_OPC_LD4S, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 26, 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x286a980000000000ULL,
-1ULL,
-1ULL,
0x8000000004000000ULL
}
#endif
},
{ "ld4s_add", TILEGX_OPC_LD4S_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1858000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld4u", TILEGX_OPC_LD4U, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 26, 14 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x286aa00000000000ULL,
-1ULL,
-1ULL,
0x8200000000000000ULL
}
#endif
},
{ "ld4u_add", TILEGX_OPC_LD4U_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1860000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ld_add", TILEGX_OPC_LD_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18a0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldna", TILEGX_OPC_LDNA, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286aa80000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldna_add", TILEGX_OPC_LDNA_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18a8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt", TILEGX_OPC_LDNT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286ae00000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt1s", TILEGX_OPC_LDNT1S, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286ab00000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt1s_add", TILEGX_OPC_LDNT1S_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1868000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt1u", TILEGX_OPC_LDNT1U, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286ab80000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt1u_add", TILEGX_OPC_LDNT1U_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1870000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt2s", TILEGX_OPC_LDNT2S, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286ac00000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt2s_add", TILEGX_OPC_LDNT2S_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1878000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt2u", TILEGX_OPC_LDNT2U, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286ac80000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt2u_add", TILEGX_OPC_LDNT2U_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1880000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt4s", TILEGX_OPC_LDNT4S, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286ad00000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt4s_add", TILEGX_OPC_LDNT4S_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1888000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt4u", TILEGX_OPC_LDNT4U, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286ad80000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt4u_add", TILEGX_OPC_LDNT4U_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1890000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "ldnt_add", TILEGX_OPC_LDNT_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 6, 15, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1898000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "lnk", TILEGX_OPC_LNK, 0xa, 1, TREG_ZERO, 1,
{ { 0, }, { 6 }, { 0, }, { 12 }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0x3c07f80000000000ULL,
0ULL
},
{
-1ULL,
0x286af00000000000ULL,
-1ULL,
0x1c06700000000000ULL,
-1ULL
}
#endif
},
{ "mf", TILEGX_OPC_MF, 0x2, 0, TREG_ZERO, 1,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286af80000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mfspr", TILEGX_OPC_MFSPR, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 6, 27 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18b0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mm", TILEGX_OPC_MM, 0x1, 4, TREG_ZERO, 1,
{ { 23, 9, 21, 22 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007f000000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000037000000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mnz", TILEGX_OPC_MNZ, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050a00000ULL,
0x2834000000000000ULL,
0x0000000048080000ULL,
0x2804000000000000ULL,
-1ULL
}
#endif
},
{ "mtspr", TILEGX_OPC_MTSPR, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 28, 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18b8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_hs_hs", TILEGX_OPC_MUL_HS_HS, 0x5, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 10, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050d40000ULL,
-1ULL,
0x0000000068000000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_hs_hu", TILEGX_OPC_MUL_HS_HU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050d80000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_hs_ls", TILEGX_OPC_MUL_HS_LS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050dc0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_hs_lu", TILEGX_OPC_MUL_HS_LU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050e00000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_hu_hu", TILEGX_OPC_MUL_HU_HU, 0x5, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 10, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050e40000ULL,
-1ULL,
0x0000000068040000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_hu_ls", TILEGX_OPC_MUL_HU_LS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050e80000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_hu_lu", TILEGX_OPC_MUL_HU_LU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050ec0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_ls_ls", TILEGX_OPC_MUL_LS_LS, 0x5, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 10, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050f00000ULL,
-1ULL,
0x0000000068080000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_ls_lu", TILEGX_OPC_MUL_LS_LU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050f40000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mul_lu_lu", TILEGX_OPC_MUL_LU_LU, 0x5, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 10, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050f80000ULL,
-1ULL,
0x00000000680c0000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_hs_hs", TILEGX_OPC_MULA_HS_HS, 0x5, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 24, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050a80000ULL,
-1ULL,
0x0000000070000000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_hs_hu", TILEGX_OPC_MULA_HS_HU, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050ac0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_hs_ls", TILEGX_OPC_MULA_HS_LS, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050b00000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_hs_lu", TILEGX_OPC_MULA_HS_LU, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050b40000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_hu_hu", TILEGX_OPC_MULA_HU_HU, 0x5, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 24, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050b80000ULL,
-1ULL,
0x0000000070040000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_hu_ls", TILEGX_OPC_MULA_HU_LS, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050bc0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_hu_lu", TILEGX_OPC_MULA_HU_LU, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050c00000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_ls_ls", TILEGX_OPC_MULA_LS_LS, 0x5, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 24, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050c40000ULL,
-1ULL,
0x0000000070080000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_ls_lu", TILEGX_OPC_MULA_LS_LU, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000050c80000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mula_lu_lu", TILEGX_OPC_MULA_LU_LU, 0x5, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 24, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050cc0000ULL,
-1ULL,
0x00000000700c0000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mulax", TILEGX_OPC_MULAX, 0x5, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 24, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050a40000ULL,
-1ULL,
0x0000000040080000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mulx", TILEGX_OPC_MULX, 0x5, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 10, 11, 18 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0x00000000780c0000ULL,
0ULL,
0ULL
},
{
0x0000000050d00000ULL,
-1ULL,
0x00000000400c0000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "mz", TILEGX_OPC_MZ, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000050fc0000ULL,
0x2836000000000000ULL,
0x00000000480c0000ULL,
0x2806000000000000ULL,
-1ULL
}
#endif
},
{ "nap", TILEGX_OPC_NAP, 0x2, 0, TREG_ZERO, 0,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286b000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "nop", TILEGX_OPC_NOP, 0xf, 0, TREG_ZERO, 1,
{ { }, { }, { }, { }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0xfffff80000000000ULL,
0x00000000780ff000ULL,
0x3c07f80000000000ULL,
0ULL
},
{
0x0000000051485000ULL,
0x286b080000000000ULL,
0x00000000300c5000ULL,
0x1c06780000000000ULL,
-1ULL
}
#endif
},
{ "nor", TILEGX_OPC_NOR, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051000000ULL,
0x2838000000000000ULL,
0x0000000050040000ULL,
0x2c02000000000000ULL,
-1ULL
}
#endif
},
{ "or", TILEGX_OPC_OR, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051040000ULL,
0x283a000000000000ULL,
0x0000000050080000ULL,
0x2c04000000000000ULL,
-1ULL
}
#endif
},
{ "ori", TILEGX_OPC_ORI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040700000ULL,
0x18c0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "pcnt", TILEGX_OPC_PCNT, 0x5, 2, TREG_ZERO, 1,
{ { 8, 9 }, { 0, }, { 10, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x0000000051486000ULL,
-1ULL,
0x00000000300c6000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "revbits", TILEGX_OPC_REVBITS, 0x5, 2, TREG_ZERO, 1,
{ { 8, 9 }, { 0, }, { 10, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x0000000051487000ULL,
-1ULL,
0x00000000300c7000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "revbytes", TILEGX_OPC_REVBYTES, 0x5, 2, TREG_ZERO, 1,
{ { 8, 9 }, { 0, }, { 10, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x0000000051488000ULL,
-1ULL,
0x00000000300c8000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "rotl", TILEGX_OPC_ROTL, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051080000ULL,
0x283c000000000000ULL,
0x0000000058000000ULL,
0x3000000000000000ULL,
-1ULL
}
#endif
},
{ "rotli", TILEGX_OPC_ROTLI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 10, 11, 31 }, { 12, 13, 32 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000060040000ULL,
0x3002000000000000ULL,
0x0000000078000000ULL,
0x3800000000000000ULL,
-1ULL
}
#endif
},
{ "shl", TILEGX_OPC_SHL, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051280000ULL,
0x284c000000000000ULL,
0x0000000058040000ULL,
0x3002000000000000ULL,
-1ULL
}
#endif
},
{ "shl16insli", TILEGX_OPC_SHL16INSLI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 4 }, { 6, 7, 5 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc000000070000000ULL,
0xf800000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000070000000ULL,
0x3800000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "shl1add", TILEGX_OPC_SHL1ADD, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051100000ULL,
0x2840000000000000ULL,
0x0000000030000000ULL,
0x1c00000000000000ULL,
-1ULL
}
#endif
},
{ "shl1addx", TILEGX_OPC_SHL1ADDX, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x00000000510c0000ULL,
0x283e000000000000ULL,
0x0000000060040000ULL,
0x3402000000000000ULL,
-1ULL
}
#endif
},
{ "shl2add", TILEGX_OPC_SHL2ADD, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051180000ULL,
0x2844000000000000ULL,
0x0000000030040000ULL,
0x1c02000000000000ULL,
-1ULL
}
#endif
},
{ "shl2addx", TILEGX_OPC_SHL2ADDX, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051140000ULL,
0x2842000000000000ULL,
0x0000000060080000ULL,
0x3404000000000000ULL,
-1ULL
}
#endif
},
{ "shl3add", TILEGX_OPC_SHL3ADD, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051200000ULL,
0x2848000000000000ULL,
0x0000000030080000ULL,
0x1c04000000000000ULL,
-1ULL
}
#endif
},
{ "shl3addx", TILEGX_OPC_SHL3ADDX, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x00000000511c0000ULL,
0x2846000000000000ULL,
0x00000000600c0000ULL,
0x3406000000000000ULL,
-1ULL
}
#endif
},
{ "shli", TILEGX_OPC_SHLI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 10, 11, 31 }, { 12, 13, 32 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000060080000ULL,
0x3004000000000000ULL,
0x0000000078040000ULL,
0x3802000000000000ULL,
-1ULL
}
#endif
},
{ "shlx", TILEGX_OPC_SHLX, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051240000ULL,
0x284a000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "shlxi", TILEGX_OPC_SHLXI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000600c0000ULL,
0x3006000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "shrs", TILEGX_OPC_SHRS, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x00000000512c0000ULL,
0x284e000000000000ULL,
0x0000000058080000ULL,
0x3004000000000000ULL,
-1ULL
}
#endif
},
{ "shrsi", TILEGX_OPC_SHRSI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 10, 11, 31 }, { 12, 13, 32 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000060100000ULL,
0x3008000000000000ULL,
0x0000000078080000ULL,
0x3804000000000000ULL,
-1ULL
}
#endif
},
{ "shru", TILEGX_OPC_SHRU, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051340000ULL,
0x2852000000000000ULL,
0x00000000580c0000ULL,
0x3006000000000000ULL,
-1ULL
}
#endif
},
{ "shrui", TILEGX_OPC_SHRUI, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 10, 11, 31 }, { 12, 13, 32 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000060140000ULL,
0x300a000000000000ULL,
0x00000000780c0000ULL,
0x3806000000000000ULL,
-1ULL
}
#endif
},
{ "shrux", TILEGX_OPC_SHRUX, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051300000ULL,
0x2850000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "shruxi", TILEGX_OPC_SHRUXI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000060180000ULL,
0x300c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "shufflebytes", TILEGX_OPC_SHUFFLEBYTES, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051380000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "st", TILEGX_OPC_ST, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 14, 33 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x2862000000000000ULL,
-1ULL,
-1ULL,
0xc200000004000000ULL
}
#endif
},
{ "st1", TILEGX_OPC_ST1, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 14, 33 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x2854000000000000ULL,
-1ULL,
-1ULL,
0xc000000000000000ULL
}
#endif
},
{ "st1_add", TILEGX_OPC_ST1_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18c8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "st2", TILEGX_OPC_ST2, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 14, 33 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x2856000000000000ULL,
-1ULL,
-1ULL,
0xc000000004000000ULL
}
#endif
},
{ "st2_add", TILEGX_OPC_ST2_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18d0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "st4", TILEGX_OPC_ST4, 0x12, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 14, 33 } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0xc200000004000000ULL
},
{
-1ULL,
0x2858000000000000ULL,
-1ULL,
-1ULL,
0xc200000000000000ULL
}
#endif
},
{ "st4_add", TILEGX_OPC_ST4_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18d8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "st_add", TILEGX_OPC_ST_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x1900000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt", TILEGX_OPC_STNT, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x2860000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt1", TILEGX_OPC_STNT1, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x285a000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt1_add", TILEGX_OPC_STNT1_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18e0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt2", TILEGX_OPC_STNT2, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x285c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt2_add", TILEGX_OPC_STNT2_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18e8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt4", TILEGX_OPC_STNT4, 0x2, 2, TREG_ZERO, 1,
{ { 0, }, { 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x285e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt4_add", TILEGX_OPC_STNT4_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18f0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "stnt_add", TILEGX_OPC_STNT_ADD, 0x2, 3, TREG_ZERO, 1,
{ { 0, }, { 15, 17, 34 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x18f8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "sub", TILEGX_OPC_SUB, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051440000ULL,
0x2868000000000000ULL,
0x00000000280c0000ULL,
0x1806000000000000ULL,
-1ULL
}
#endif
},
{ "subx", TILEGX_OPC_SUBX, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000051400000ULL,
0x2866000000000000ULL,
0x0000000028080000ULL,
0x1804000000000000ULL,
-1ULL
}
#endif
},
{ "subxsc", TILEGX_OPC_SUBXSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000513c0000ULL,
0x2864000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "swint0", TILEGX_OPC_SWINT0, 0x2, 0, TREG_ZERO, 0,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286b100000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "swint1", TILEGX_OPC_SWINT1, 0x2, 0, TREG_ZERO, 0,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286b180000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "swint2", TILEGX_OPC_SWINT2, 0x2, 0, TREG_ZERO, 0,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286b200000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "swint3", TILEGX_OPC_SWINT3, 0x2, 0, TREG_ZERO, 0,
{ { 0, }, { }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286b280000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "tblidxb0", TILEGX_OPC_TBLIDXB0, 0x5, 2, TREG_ZERO, 1,
{ { 23, 9 }, { 0, }, { 24, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x0000000051489000ULL,
-1ULL,
0x00000000300c9000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "tblidxb1", TILEGX_OPC_TBLIDXB1, 0x5, 2, TREG_ZERO, 1,
{ { 23, 9 }, { 0, }, { 24, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x000000005148a000ULL,
-1ULL,
0x00000000300ca000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "tblidxb2", TILEGX_OPC_TBLIDXB2, 0x5, 2, TREG_ZERO, 1,
{ { 23, 9 }, { 0, }, { 24, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x000000005148b000ULL,
-1ULL,
0x00000000300cb000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "tblidxb3", TILEGX_OPC_TBLIDXB3, 0x5, 2, TREG_ZERO, 1,
{ { 23, 9 }, { 0, }, { 24, 11 }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffff000ULL,
0ULL,
0x00000000780ff000ULL,
0ULL,
0ULL
},
{
0x000000005148c000ULL,
-1ULL,
0x00000000300cc000ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1add", TILEGX_OPC_V1ADD, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051500000ULL,
0x286e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1addi", TILEGX_OPC_V1ADDI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040800000ULL,
0x1908000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1adduc", TILEGX_OPC_V1ADDUC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000514c0000ULL,
0x286c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1adiffu", TILEGX_OPC_V1ADIFFU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051540000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1avgu", TILEGX_OPC_V1AVGU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051580000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmpeq", TILEGX_OPC_V1CMPEQ, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000515c0000ULL,
0x2870000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmpeqi", TILEGX_OPC_V1CMPEQI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040900000ULL,
0x1910000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmples", TILEGX_OPC_V1CMPLES, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051600000ULL,
0x2872000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmpleu", TILEGX_OPC_V1CMPLEU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051640000ULL,
0x2874000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmplts", TILEGX_OPC_V1CMPLTS, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051680000ULL,
0x2876000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmpltsi", TILEGX_OPC_V1CMPLTSI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040a00000ULL,
0x1918000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmpltu", TILEGX_OPC_V1CMPLTU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000516c0000ULL,
0x2878000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmpltui", TILEGX_OPC_V1CMPLTUI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040b00000ULL,
0x1920000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1cmpne", TILEGX_OPC_V1CMPNE, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051700000ULL,
0x287a000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1ddotpu", TILEGX_OPC_V1DDOTPU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052880000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1ddotpua", TILEGX_OPC_V1DDOTPUA, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052840000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1ddotpus", TILEGX_OPC_V1DDOTPUS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051780000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1ddotpusa", TILEGX_OPC_V1DDOTPUSA, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051740000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1dotp", TILEGX_OPC_V1DOTP, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051880000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1dotpa", TILEGX_OPC_V1DOTPA, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000517c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1dotpu", TILEGX_OPC_V1DOTPU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052900000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1dotpua", TILEGX_OPC_V1DOTPUA, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000528c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1dotpus", TILEGX_OPC_V1DOTPUS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051840000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1dotpusa", TILEGX_OPC_V1DOTPUSA, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051800000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1int_h", TILEGX_OPC_V1INT_H, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000518c0000ULL,
0x287c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1int_l", TILEGX_OPC_V1INT_L, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051900000ULL,
0x287e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1maxu", TILEGX_OPC_V1MAXU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051940000ULL,
0x2880000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1maxui", TILEGX_OPC_V1MAXUI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040c00000ULL,
0x1928000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1minu", TILEGX_OPC_V1MINU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051980000ULL,
0x2882000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1minui", TILEGX_OPC_V1MINUI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040d00000ULL,
0x1930000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1mnz", TILEGX_OPC_V1MNZ, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000519c0000ULL,
0x2884000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1multu", TILEGX_OPC_V1MULTU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051a00000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1mulu", TILEGX_OPC_V1MULU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051a80000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1mulus", TILEGX_OPC_V1MULUS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051a40000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1mz", TILEGX_OPC_V1MZ, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051ac0000ULL,
0x2886000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1sadau", TILEGX_OPC_V1SADAU, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051b00000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1sadu", TILEGX_OPC_V1SADU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051b40000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1shl", TILEGX_OPC_V1SHL, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051b80000ULL,
0x2888000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1shli", TILEGX_OPC_V1SHLI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000601c0000ULL,
0x300e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1shrs", TILEGX_OPC_V1SHRS, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051bc0000ULL,
0x288a000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1shrsi", TILEGX_OPC_V1SHRSI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000060200000ULL,
0x3010000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1shru", TILEGX_OPC_V1SHRU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051c00000ULL,
0x288c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1shrui", TILEGX_OPC_V1SHRUI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000060240000ULL,
0x3012000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1sub", TILEGX_OPC_V1SUB, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051c80000ULL,
0x2890000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v1subuc", TILEGX_OPC_V1SUBUC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051c40000ULL,
0x288e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2add", TILEGX_OPC_V2ADD, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051d00000ULL,
0x2894000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2addi", TILEGX_OPC_V2ADDI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040e00000ULL,
0x1938000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2addsc", TILEGX_OPC_V2ADDSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051cc0000ULL,
0x2892000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2adiffs", TILEGX_OPC_V2ADIFFS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051d40000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2avgs", TILEGX_OPC_V2AVGS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051d80000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmpeq", TILEGX_OPC_V2CMPEQ, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051dc0000ULL,
0x2896000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmpeqi", TILEGX_OPC_V2CMPEQI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000040f00000ULL,
0x1940000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmples", TILEGX_OPC_V2CMPLES, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051e00000ULL,
0x2898000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmpleu", TILEGX_OPC_V2CMPLEU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051e40000ULL,
0x289a000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmplts", TILEGX_OPC_V2CMPLTS, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051e80000ULL,
0x289c000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmpltsi", TILEGX_OPC_V2CMPLTSI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000041000000ULL,
0x1948000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmpltu", TILEGX_OPC_V2CMPLTU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051ec0000ULL,
0x289e000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmpltui", TILEGX_OPC_V2CMPLTUI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000041100000ULL,
0x1950000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2cmpne", TILEGX_OPC_V2CMPNE, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051f00000ULL,
0x28a0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2dotp", TILEGX_OPC_V2DOTP, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051f80000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2dotpa", TILEGX_OPC_V2DOTPA, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051f40000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2int_h", TILEGX_OPC_V2INT_H, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000051fc0000ULL,
0x28a2000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2int_l", TILEGX_OPC_V2INT_L, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052000000ULL,
0x28a4000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2maxs", TILEGX_OPC_V2MAXS, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052040000ULL,
0x28a6000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2maxsi", TILEGX_OPC_V2MAXSI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000041200000ULL,
0x1958000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2mins", TILEGX_OPC_V2MINS, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052080000ULL,
0x28a8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2minsi", TILEGX_OPC_V2MINSI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000041300000ULL,
0x1960000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2mnz", TILEGX_OPC_V2MNZ, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000520c0000ULL,
0x28aa000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2mulfsc", TILEGX_OPC_V2MULFSC, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052100000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2muls", TILEGX_OPC_V2MULS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052140000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2mults", TILEGX_OPC_V2MULTS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052180000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2mz", TILEGX_OPC_V2MZ, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000521c0000ULL,
0x28ac000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2packh", TILEGX_OPC_V2PACKH, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052200000ULL,
0x28ae000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2packl", TILEGX_OPC_V2PACKL, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052240000ULL,
0x28b0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2packuc", TILEGX_OPC_V2PACKUC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052280000ULL,
0x28b2000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2sadas", TILEGX_OPC_V2SADAS, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000522c0000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2sadau", TILEGX_OPC_V2SADAU, 0x1, 3, TREG_ZERO, 1,
{ { 23, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052300000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2sads", TILEGX_OPC_V2SADS, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052340000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2sadu", TILEGX_OPC_V2SADU, 0x1, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 0, }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052380000ULL,
-1ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2shl", TILEGX_OPC_V2SHL, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052400000ULL,
0x28b6000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2shli", TILEGX_OPC_V2SHLI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000060280000ULL,
0x3014000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2shlsc", TILEGX_OPC_V2SHLSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000523c0000ULL,
0x28b4000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2shrs", TILEGX_OPC_V2SHRS, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052440000ULL,
0x28b8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2shrsi", TILEGX_OPC_V2SHRSI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000602c0000ULL,
0x3016000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2shru", TILEGX_OPC_V2SHRU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052480000ULL,
0x28ba000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2shrui", TILEGX_OPC_V2SHRUI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 29 }, { 6, 7, 30 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000060300000ULL,
0x3018000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2sub", TILEGX_OPC_V2SUB, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052500000ULL,
0x28be000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v2subsc", TILEGX_OPC_V2SUBSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000524c0000ULL,
0x28bc000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4add", TILEGX_OPC_V4ADD, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052580000ULL,
0x28c2000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4addsc", TILEGX_OPC_V4ADDSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052540000ULL,
0x28c0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4int_h", TILEGX_OPC_V4INT_H, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000525c0000ULL,
0x28c4000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4int_l", TILEGX_OPC_V4INT_L, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052600000ULL,
0x28c6000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4packsc", TILEGX_OPC_V4PACKSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052640000ULL,
0x28c8000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4shl", TILEGX_OPC_V4SHL, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000526c0000ULL,
0x28cc000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4shlsc", TILEGX_OPC_V4SHLSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052680000ULL,
0x28ca000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4shrs", TILEGX_OPC_V4SHRS, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052700000ULL,
0x28ce000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4shru", TILEGX_OPC_V4SHRU, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052740000ULL,
0x28d0000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4sub", TILEGX_OPC_V4SUB, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x00000000527c0000ULL,
0x28d4000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "v4subsc", TILEGX_OPC_V4SUBSC, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000052780000ULL,
0x28d2000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "wh64", TILEGX_OPC_WH64, 0x2, 1, TREG_ZERO, 1,
{ { 0, }, { 7 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0ULL,
0xfffff80000000000ULL,
0ULL,
0ULL,
0ULL
},
{
-1ULL,
0x286b300000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ "xor", TILEGX_OPC_XOR, 0xf, 3, TREG_ZERO, 1,
{ { 8, 9, 16 }, { 6, 7, 17 }, { 10, 11, 18 }, { 12, 13, 19 }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ffc0000ULL,
0xfffe000000000000ULL,
0x00000000780c0000ULL,
0x3c06000000000000ULL,
0ULL
},
{
0x0000000052800000ULL,
0x28d6000000000000ULL,
0x00000000500c0000ULL,
0x2c06000000000000ULL,
-1ULL
}
#endif
},
{ "xori", TILEGX_OPC_XORI, 0x3, 3, TREG_ZERO, 1,
{ { 8, 9, 0 }, { 6, 7, 1 }, { 0, }, { 0, }, { 0, } },
#ifndef DISASM_ONLY
{
0xc00000007ff00000ULL,
0xfff8000000000000ULL,
0ULL,
0ULL,
0ULL
},
{
0x0000000041400000ULL,
0x1968000000000000ULL,
-1ULL,
-1ULL,
-1ULL
}
#endif
},
{ NULL, TILEGX_OPC_NONE, 0, 0, TREG_ZERO, 0, { { 0, } },
#ifndef DISASM_ONLY
{ 0, }, { 0, }
#endif
}
};
#define BITFIELD(start, size) ((start) | (((1 << (size)) - 1) << 6))
#define CHILD(array_index) (TILEGX_OPC_NONE + (array_index))
static const unsigned short decode_X0_fsm[936] =
{
BITFIELD(22, 9) /* index 0 */,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_BFEXTS,
TILEGX_OPC_BFEXTS, TILEGX_OPC_BFEXTS, TILEGX_OPC_BFEXTS, TILEGX_OPC_BFEXTU,
TILEGX_OPC_BFEXTU, TILEGX_OPC_BFEXTU, TILEGX_OPC_BFEXTU, TILEGX_OPC_BFINS,
TILEGX_OPC_BFINS, TILEGX_OPC_BFINS, TILEGX_OPC_BFINS, TILEGX_OPC_MM,
TILEGX_OPC_MM, TILEGX_OPC_MM, TILEGX_OPC_MM, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, CHILD(528), CHILD(578),
CHILD(583), CHILD(588), CHILD(593), CHILD(598), TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, CHILD(603), CHILD(620), CHILD(637), CHILD(654), CHILD(671),
CHILD(703), CHILD(797), CHILD(814), CHILD(831), CHILD(848), CHILD(865),
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, CHILD(889), TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
CHILD(906), CHILD(906), CHILD(906), CHILD(906), CHILD(906),
BITFIELD(6, 2) /* index 513 */,
TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, CHILD(518),
BITFIELD(8, 2) /* index 518 */,
TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, CHILD(523),
BITFIELD(10, 2) /* index 523 */,
TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_MOVELI,
BITFIELD(20, 2) /* index 528 */,
TILEGX_OPC_NONE, CHILD(533), TILEGX_OPC_ADDXI, CHILD(548),
BITFIELD(6, 2) /* index 533 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(538),
BITFIELD(8, 2) /* index 538 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(543),
BITFIELD(10, 2) /* index 543 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_MOVEI,
BITFIELD(0, 2) /* index 548 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(553),
BITFIELD(2, 2) /* index 553 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(558),
BITFIELD(4, 2) /* index 558 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(563),
BITFIELD(6, 2) /* index 563 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(568),
BITFIELD(8, 2) /* index 568 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(573),
BITFIELD(10, 2) /* index 573 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_INFO,
BITFIELD(20, 2) /* index 578 */,
TILEGX_OPC_CMPEQI, TILEGX_OPC_CMPLTSI, TILEGX_OPC_CMPLTUI, TILEGX_OPC_ORI,
BITFIELD(20, 2) /* index 583 */,
TILEGX_OPC_V1ADDI, TILEGX_OPC_V1CMPEQI, TILEGX_OPC_V1CMPLTSI,
TILEGX_OPC_V1CMPLTUI,
BITFIELD(20, 2) /* index 588 */,
TILEGX_OPC_V1MAXUI, TILEGX_OPC_V1MINUI, TILEGX_OPC_V2ADDI,
TILEGX_OPC_V2CMPEQI,
BITFIELD(20, 2) /* index 593 */,
TILEGX_OPC_V2CMPLTSI, TILEGX_OPC_V2CMPLTUI, TILEGX_OPC_V2MAXSI,
TILEGX_OPC_V2MINSI,
BITFIELD(20, 2) /* index 598 */,
TILEGX_OPC_XORI, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(18, 4) /* index 603 */,
TILEGX_OPC_NONE, TILEGX_OPC_ADDXSC, TILEGX_OPC_ADDX, TILEGX_OPC_ADD,
TILEGX_OPC_AND, TILEGX_OPC_CMOVEQZ, TILEGX_OPC_CMOVNEZ, TILEGX_OPC_CMPEQ,
TILEGX_OPC_CMPLES, TILEGX_OPC_CMPLEU, TILEGX_OPC_CMPLTS, TILEGX_OPC_CMPLTU,
TILEGX_OPC_CMPNE, TILEGX_OPC_CMULAF, TILEGX_OPC_CMULA, TILEGX_OPC_CMULFR,
BITFIELD(18, 4) /* index 620 */,
TILEGX_OPC_CMULF, TILEGX_OPC_CMULHR, TILEGX_OPC_CMULH, TILEGX_OPC_CMUL,
TILEGX_OPC_CRC32_32, TILEGX_OPC_CRC32_8, TILEGX_OPC_DBLALIGN2,
TILEGX_OPC_DBLALIGN4, TILEGX_OPC_DBLALIGN6, TILEGX_OPC_DBLALIGN,
TILEGX_OPC_FDOUBLE_ADDSUB, TILEGX_OPC_FDOUBLE_ADD_FLAGS,
TILEGX_OPC_FDOUBLE_MUL_FLAGS, TILEGX_OPC_FDOUBLE_PACK1,
TILEGX_OPC_FDOUBLE_PACK2, TILEGX_OPC_FDOUBLE_SUB_FLAGS,
BITFIELD(18, 4) /* index 637 */,
TILEGX_OPC_FDOUBLE_UNPACK_MAX, TILEGX_OPC_FDOUBLE_UNPACK_MIN,
TILEGX_OPC_FSINGLE_ADD1, TILEGX_OPC_FSINGLE_ADDSUB2,
TILEGX_OPC_FSINGLE_MUL1, TILEGX_OPC_FSINGLE_MUL2, TILEGX_OPC_FSINGLE_PACK2,
TILEGX_OPC_FSINGLE_SUB1, TILEGX_OPC_MNZ, TILEGX_OPC_MULAX,
TILEGX_OPC_MULA_HS_HS, TILEGX_OPC_MULA_HS_HU, TILEGX_OPC_MULA_HS_LS,
TILEGX_OPC_MULA_HS_LU, TILEGX_OPC_MULA_HU_HU, TILEGX_OPC_MULA_HU_LS,
BITFIELD(18, 4) /* index 654 */,
TILEGX_OPC_MULA_HU_LU, TILEGX_OPC_MULA_LS_LS, TILEGX_OPC_MULA_LS_LU,
TILEGX_OPC_MULA_LU_LU, TILEGX_OPC_MULX, TILEGX_OPC_MUL_HS_HS,
TILEGX_OPC_MUL_HS_HU, TILEGX_OPC_MUL_HS_LS, TILEGX_OPC_MUL_HS_LU,
TILEGX_OPC_MUL_HU_HU, TILEGX_OPC_MUL_HU_LS, TILEGX_OPC_MUL_HU_LU,
TILEGX_OPC_MUL_LS_LS, TILEGX_OPC_MUL_LS_LU, TILEGX_OPC_MUL_LU_LU,
TILEGX_OPC_MZ,
BITFIELD(18, 4) /* index 671 */,
TILEGX_OPC_NOR, CHILD(688), TILEGX_OPC_ROTL, TILEGX_OPC_SHL1ADDX,
TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL2ADDX, TILEGX_OPC_SHL2ADD,
TILEGX_OPC_SHL3ADDX, TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHLX, TILEGX_OPC_SHL,
TILEGX_OPC_SHRS, TILEGX_OPC_SHRUX, TILEGX_OPC_SHRU, TILEGX_OPC_SHUFFLEBYTES,
TILEGX_OPC_SUBXSC,
BITFIELD(12, 2) /* index 688 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(693),
BITFIELD(14, 2) /* index 693 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(698),
BITFIELD(16, 2) /* index 698 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_MOVE,
BITFIELD(18, 4) /* index 703 */,
TILEGX_OPC_SUBX, TILEGX_OPC_SUB, CHILD(720), TILEGX_OPC_V1ADDUC,
TILEGX_OPC_V1ADD, TILEGX_OPC_V1ADIFFU, TILEGX_OPC_V1AVGU,
TILEGX_OPC_V1CMPEQ, TILEGX_OPC_V1CMPLES, TILEGX_OPC_V1CMPLEU,
TILEGX_OPC_V1CMPLTS, TILEGX_OPC_V1CMPLTU, TILEGX_OPC_V1CMPNE,
TILEGX_OPC_V1DDOTPUSA, TILEGX_OPC_V1DDOTPUS, TILEGX_OPC_V1DOTPA,
BITFIELD(12, 4) /* index 720 */,
TILEGX_OPC_NONE, CHILD(737), CHILD(742), CHILD(747), CHILD(752), CHILD(757),
CHILD(762), CHILD(767), CHILD(772), CHILD(777), CHILD(782), CHILD(787),
CHILD(792), TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 737 */,
TILEGX_OPC_CLZ, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 742 */,
TILEGX_OPC_CTZ, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 747 */,
TILEGX_OPC_FNOP, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 752 */,
TILEGX_OPC_FSINGLE_PACK1, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 757 */,
TILEGX_OPC_NOP, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 762 */,
TILEGX_OPC_PCNT, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 767 */,
TILEGX_OPC_REVBITS, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 772 */,
TILEGX_OPC_REVBYTES, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 777 */,
TILEGX_OPC_TBLIDXB0, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 782 */,
TILEGX_OPC_TBLIDXB1, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 787 */,
TILEGX_OPC_TBLIDXB2, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(16, 2) /* index 792 */,
TILEGX_OPC_TBLIDXB3, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(18, 4) /* index 797 */,
TILEGX_OPC_V1DOTPUSA, TILEGX_OPC_V1DOTPUS, TILEGX_OPC_V1DOTP,
TILEGX_OPC_V1INT_H, TILEGX_OPC_V1INT_L, TILEGX_OPC_V1MAXU,
TILEGX_OPC_V1MINU, TILEGX_OPC_V1MNZ, TILEGX_OPC_V1MULTU, TILEGX_OPC_V1MULUS,
TILEGX_OPC_V1MULU, TILEGX_OPC_V1MZ, TILEGX_OPC_V1SADAU, TILEGX_OPC_V1SADU,
TILEGX_OPC_V1SHL, TILEGX_OPC_V1SHRS,
BITFIELD(18, 4) /* index 814 */,
TILEGX_OPC_V1SHRU, TILEGX_OPC_V1SUBUC, TILEGX_OPC_V1SUB, TILEGX_OPC_V2ADDSC,
TILEGX_OPC_V2ADD, TILEGX_OPC_V2ADIFFS, TILEGX_OPC_V2AVGS,
TILEGX_OPC_V2CMPEQ, TILEGX_OPC_V2CMPLES, TILEGX_OPC_V2CMPLEU,
TILEGX_OPC_V2CMPLTS, TILEGX_OPC_V2CMPLTU, TILEGX_OPC_V2CMPNE,
TILEGX_OPC_V2DOTPA, TILEGX_OPC_V2DOTP, TILEGX_OPC_V2INT_H,
BITFIELD(18, 4) /* index 831 */,
TILEGX_OPC_V2INT_L, TILEGX_OPC_V2MAXS, TILEGX_OPC_V2MINS, TILEGX_OPC_V2MNZ,
TILEGX_OPC_V2MULFSC, TILEGX_OPC_V2MULS, TILEGX_OPC_V2MULTS, TILEGX_OPC_V2MZ,
TILEGX_OPC_V2PACKH, TILEGX_OPC_V2PACKL, TILEGX_OPC_V2PACKUC,
TILEGX_OPC_V2SADAS, TILEGX_OPC_V2SADAU, TILEGX_OPC_V2SADS,
TILEGX_OPC_V2SADU, TILEGX_OPC_V2SHLSC,
BITFIELD(18, 4) /* index 848 */,
TILEGX_OPC_V2SHL, TILEGX_OPC_V2SHRS, TILEGX_OPC_V2SHRU, TILEGX_OPC_V2SUBSC,
TILEGX_OPC_V2SUB, TILEGX_OPC_V4ADDSC, TILEGX_OPC_V4ADD, TILEGX_OPC_V4INT_H,
TILEGX_OPC_V4INT_L, TILEGX_OPC_V4PACKSC, TILEGX_OPC_V4SHLSC,
TILEGX_OPC_V4SHL, TILEGX_OPC_V4SHRS, TILEGX_OPC_V4SHRU, TILEGX_OPC_V4SUBSC,
TILEGX_OPC_V4SUB,
BITFIELD(18, 3) /* index 865 */,
CHILD(874), CHILD(877), CHILD(880), CHILD(883), CHILD(886), TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(21, 1) /* index 874 */,
TILEGX_OPC_XOR, TILEGX_OPC_NONE,
BITFIELD(21, 1) /* index 877 */,
TILEGX_OPC_V1DDOTPUA, TILEGX_OPC_NONE,
BITFIELD(21, 1) /* index 880 */,
TILEGX_OPC_V1DDOTPU, TILEGX_OPC_NONE,
BITFIELD(21, 1) /* index 883 */,
TILEGX_OPC_V1DOTPUA, TILEGX_OPC_NONE,
BITFIELD(21, 1) /* index 886 */,
TILEGX_OPC_V1DOTPU, TILEGX_OPC_NONE,
BITFIELD(18, 4) /* index 889 */,
TILEGX_OPC_NONE, TILEGX_OPC_ROTLI, TILEGX_OPC_SHLI, TILEGX_OPC_SHLXI,
TILEGX_OPC_SHRSI, TILEGX_OPC_SHRUI, TILEGX_OPC_SHRUXI, TILEGX_OPC_V1SHLI,
TILEGX_OPC_V1SHRSI, TILEGX_OPC_V1SHRUI, TILEGX_OPC_V2SHLI,
TILEGX_OPC_V2SHRSI, TILEGX_OPC_V2SHRUI, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE,
BITFIELD(0, 2) /* index 906 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(911),
BITFIELD(2, 2) /* index 911 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(916),
BITFIELD(4, 2) /* index 916 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(921),
BITFIELD(6, 2) /* index 921 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(926),
BITFIELD(8, 2) /* index 926 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(931),
BITFIELD(10, 2) /* index 931 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
TILEGX_OPC_INFOL,
};
static const unsigned short decode_X1_fsm[1266] =
{
BITFIELD(53, 9) /* index 0 */,
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513), CHILD(513),
CHILD(513), CHILD(513), CHILD(513), CHILD(513), TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI,
TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_ADDXLI, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_BEQZT,
TILEGX_OPC_BEQZT, TILEGX_OPC_BEQZ, TILEGX_OPC_BEQZ, TILEGX_OPC_BGEZT,
TILEGX_OPC_BGEZT, TILEGX_OPC_BGEZ, TILEGX_OPC_BGEZ, TILEGX_OPC_BGTZT,
TILEGX_OPC_BGTZT, TILEGX_OPC_BGTZ, TILEGX_OPC_BGTZ, TILEGX_OPC_BLBCT,
TILEGX_OPC_BLBCT, TILEGX_OPC_BLBC, TILEGX_OPC_BLBC, TILEGX_OPC_BLBST,
TILEGX_OPC_BLBST, TILEGX_OPC_BLBS, TILEGX_OPC_BLBS, TILEGX_OPC_BLEZT,
TILEGX_OPC_BLEZT, TILEGX_OPC_BLEZ, TILEGX_OPC_BLEZ, TILEGX_OPC_BLTZT,
TILEGX_OPC_BLTZT, TILEGX_OPC_BLTZ, TILEGX_OPC_BLTZ, TILEGX_OPC_BNEZT,
TILEGX_OPC_BNEZT, TILEGX_OPC_BNEZ, TILEGX_OPC_BNEZ, CHILD(528), CHILD(578),
CHILD(598), CHILD(703), CHILD(723), CHILD(728), CHILD(753), CHILD(758),
CHILD(763), CHILD(768), CHILD(773), CHILD(778), TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL,
TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_JAL, TILEGX_OPC_J, TILEGX_OPC_J,
TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J,
TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J,
TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J,
TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J,
TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J,
TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J, TILEGX_OPC_J,
CHILD(783), CHILD(800), CHILD(832), CHILD(849), CHILD(1168), CHILD(1185),
CHILD(1202), TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, CHILD(1219), TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236), CHILD(1236),
CHILD(1236),
BITFIELD(37, 2) /* index 513 */,
TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, CHILD(518),
BITFIELD(39, 2) /* index 518 */,
TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, CHILD(523),
BITFIELD(41, 2) /* index 523 */,
TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_ADDLI, TILEGX_OPC_MOVELI,
BITFIELD(51, 2) /* index 528 */,
TILEGX_OPC_NONE, CHILD(533), TILEGX_OPC_ADDXI, CHILD(548),
BITFIELD(37, 2) /* index 533 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(538),
BITFIELD(39, 2) /* index 538 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(543),
BITFIELD(41, 2) /* index 543 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_MOVEI,
BITFIELD(31, 2) /* index 548 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(553),
BITFIELD(33, 2) /* index 553 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(558),
BITFIELD(35, 2) /* index 558 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(563),
BITFIELD(37, 2) /* index 563 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(568),
BITFIELD(39, 2) /* index 568 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(573),
BITFIELD(41, 2) /* index 573 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_INFO,
BITFIELD(51, 2) /* index 578 */,
TILEGX_OPC_CMPEQI, TILEGX_OPC_CMPLTSI, TILEGX_OPC_CMPLTUI, CHILD(583),
BITFIELD(31, 2) /* index 583 */,
TILEGX_OPC_LD1S_ADD, TILEGX_OPC_LD1S_ADD, TILEGX_OPC_LD1S_ADD, CHILD(588),
BITFIELD(33, 2) /* index 588 */,
TILEGX_OPC_LD1S_ADD, TILEGX_OPC_LD1S_ADD, TILEGX_OPC_LD1S_ADD, CHILD(593),
BITFIELD(35, 2) /* index 593 */,
TILEGX_OPC_LD1S_ADD, TILEGX_OPC_LD1S_ADD, TILEGX_OPC_LD1S_ADD,
TILEGX_OPC_PREFETCH_ADD_L1_FAULT,
BITFIELD(51, 2) /* index 598 */,
CHILD(603), CHILD(618), CHILD(633), CHILD(648),
BITFIELD(31, 2) /* index 603 */,
TILEGX_OPC_LD1U_ADD, TILEGX_OPC_LD1U_ADD, TILEGX_OPC_LD1U_ADD, CHILD(608),
BITFIELD(33, 2) /* index 608 */,
TILEGX_OPC_LD1U_ADD, TILEGX_OPC_LD1U_ADD, TILEGX_OPC_LD1U_ADD, CHILD(613),
BITFIELD(35, 2) /* index 613 */,
TILEGX_OPC_LD1U_ADD, TILEGX_OPC_LD1U_ADD, TILEGX_OPC_LD1U_ADD,
TILEGX_OPC_PREFETCH_ADD_L1,
BITFIELD(31, 2) /* index 618 */,
TILEGX_OPC_LD2S_ADD, TILEGX_OPC_LD2S_ADD, TILEGX_OPC_LD2S_ADD, CHILD(623),
BITFIELD(33, 2) /* index 623 */,
TILEGX_OPC_LD2S_ADD, TILEGX_OPC_LD2S_ADD, TILEGX_OPC_LD2S_ADD, CHILD(628),
BITFIELD(35, 2) /* index 628 */,
TILEGX_OPC_LD2S_ADD, TILEGX_OPC_LD2S_ADD, TILEGX_OPC_LD2S_ADD,
TILEGX_OPC_PREFETCH_ADD_L2_FAULT,
BITFIELD(31, 2) /* index 633 */,
TILEGX_OPC_LD2U_ADD, TILEGX_OPC_LD2U_ADD, TILEGX_OPC_LD2U_ADD, CHILD(638),
BITFIELD(33, 2) /* index 638 */,
TILEGX_OPC_LD2U_ADD, TILEGX_OPC_LD2U_ADD, TILEGX_OPC_LD2U_ADD, CHILD(643),
BITFIELD(35, 2) /* index 643 */,
TILEGX_OPC_LD2U_ADD, TILEGX_OPC_LD2U_ADD, TILEGX_OPC_LD2U_ADD,
TILEGX_OPC_PREFETCH_ADD_L2,
BITFIELD(31, 2) /* index 648 */,
CHILD(653), CHILD(653), CHILD(653), CHILD(673),
BITFIELD(43, 2) /* index 653 */,
CHILD(658), TILEGX_OPC_LD4S_ADD, TILEGX_OPC_LD4S_ADD, TILEGX_OPC_LD4S_ADD,
BITFIELD(45, 2) /* index 658 */,
CHILD(663), TILEGX_OPC_LD4S_ADD, TILEGX_OPC_LD4S_ADD, TILEGX_OPC_LD4S_ADD,
BITFIELD(47, 2) /* index 663 */,
CHILD(668), TILEGX_OPC_LD4S_ADD, TILEGX_OPC_LD4S_ADD, TILEGX_OPC_LD4S_ADD,
BITFIELD(49, 2) /* index 668 */,
TILEGX_OPC_LD4S_TLS, TILEGX_OPC_LD4S_ADD, TILEGX_OPC_LD4S_ADD,
TILEGX_OPC_LD4S_ADD,
BITFIELD(33, 2) /* index 673 */,
CHILD(653), CHILD(653), CHILD(653), CHILD(678),
BITFIELD(35, 2) /* index 678 */,
CHILD(653), CHILD(653), CHILD(653), CHILD(683),
BITFIELD(43, 2) /* index 683 */,
CHILD(688), TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
TILEGX_OPC_PREFETCH_ADD_L3_FAULT, TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
BITFIELD(45, 2) /* index 688 */,
CHILD(693), TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
TILEGX_OPC_PREFETCH_ADD_L3_FAULT, TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
BITFIELD(47, 2) /* index 693 */,
CHILD(698), TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
TILEGX_OPC_PREFETCH_ADD_L3_FAULT, TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
BITFIELD(49, 2) /* index 698 */,
TILEGX_OPC_LD4S_TLS, TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
TILEGX_OPC_PREFETCH_ADD_L3_FAULT, TILEGX_OPC_PREFETCH_ADD_L3_FAULT,
BITFIELD(51, 2) /* index 703 */,
CHILD(708), TILEGX_OPC_LDNT1S_ADD, TILEGX_OPC_LDNT1U_ADD,
TILEGX_OPC_LDNT2S_ADD,
BITFIELD(31, 2) /* index 708 */,
TILEGX_OPC_LD4U_ADD, TILEGX_OPC_LD4U_ADD, TILEGX_OPC_LD4U_ADD, CHILD(713),
BITFIELD(33, 2) /* index 713 */,
TILEGX_OPC_LD4U_ADD, TILEGX_OPC_LD4U_ADD, TILEGX_OPC_LD4U_ADD, CHILD(718),
BITFIELD(35, 2) /* index 718 */,
TILEGX_OPC_LD4U_ADD, TILEGX_OPC_LD4U_ADD, TILEGX_OPC_LD4U_ADD,
TILEGX_OPC_PREFETCH_ADD_L3,
BITFIELD(51, 2) /* index 723 */,
TILEGX_OPC_LDNT2U_ADD, TILEGX_OPC_LDNT4S_ADD, TILEGX_OPC_LDNT4U_ADD,
TILEGX_OPC_LDNT_ADD,
BITFIELD(51, 2) /* index 728 */,
CHILD(733), TILEGX_OPC_LDNA_ADD, TILEGX_OPC_MFSPR, TILEGX_OPC_MTSPR,
BITFIELD(43, 2) /* index 733 */,
CHILD(738), TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD,
BITFIELD(45, 2) /* index 738 */,
CHILD(743), TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD,
BITFIELD(47, 2) /* index 743 */,
CHILD(748), TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD,
BITFIELD(49, 2) /* index 748 */,
TILEGX_OPC_LD_TLS, TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD, TILEGX_OPC_LD_ADD,
BITFIELD(51, 2) /* index 753 */,
TILEGX_OPC_ORI, TILEGX_OPC_ST1_ADD, TILEGX_OPC_ST2_ADD, TILEGX_OPC_ST4_ADD,
BITFIELD(51, 2) /* index 758 */,
TILEGX_OPC_STNT1_ADD, TILEGX_OPC_STNT2_ADD, TILEGX_OPC_STNT4_ADD,
TILEGX_OPC_STNT_ADD,
BITFIELD(51, 2) /* index 763 */,
TILEGX_OPC_ST_ADD, TILEGX_OPC_V1ADDI, TILEGX_OPC_V1CMPEQI,
TILEGX_OPC_V1CMPLTSI,
BITFIELD(51, 2) /* index 768 */,
TILEGX_OPC_V1CMPLTUI, TILEGX_OPC_V1MAXUI, TILEGX_OPC_V1MINUI,
TILEGX_OPC_V2ADDI,
BITFIELD(51, 2) /* index 773 */,
TILEGX_OPC_V2CMPEQI, TILEGX_OPC_V2CMPLTSI, TILEGX_OPC_V2CMPLTUI,
TILEGX_OPC_V2MAXSI,
BITFIELD(51, 2) /* index 778 */,
TILEGX_OPC_V2MINSI, TILEGX_OPC_XORI, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(49, 4) /* index 783 */,
TILEGX_OPC_NONE, TILEGX_OPC_ADDXSC, TILEGX_OPC_ADDX, TILEGX_OPC_ADD,
TILEGX_OPC_AND, TILEGX_OPC_CMPEQ, TILEGX_OPC_CMPEXCH4, TILEGX_OPC_CMPEXCH,
TILEGX_OPC_CMPLES, TILEGX_OPC_CMPLEU, TILEGX_OPC_CMPLTS, TILEGX_OPC_CMPLTU,
TILEGX_OPC_CMPNE, TILEGX_OPC_DBLALIGN2, TILEGX_OPC_DBLALIGN4,
TILEGX_OPC_DBLALIGN6,
BITFIELD(49, 4) /* index 800 */,
TILEGX_OPC_EXCH4, TILEGX_OPC_EXCH, TILEGX_OPC_FETCHADD4,
TILEGX_OPC_FETCHADDGEZ4, TILEGX_OPC_FETCHADDGEZ, TILEGX_OPC_FETCHADD,
TILEGX_OPC_FETCHAND4, TILEGX_OPC_FETCHAND, TILEGX_OPC_FETCHOR4,
TILEGX_OPC_FETCHOR, TILEGX_OPC_MNZ, TILEGX_OPC_MZ, TILEGX_OPC_NOR,
CHILD(817), TILEGX_OPC_ROTL, TILEGX_OPC_SHL1ADDX,
BITFIELD(43, 2) /* index 817 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(822),
BITFIELD(45, 2) /* index 822 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(827),
BITFIELD(47, 2) /* index 827 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_MOVE,
BITFIELD(49, 4) /* index 832 */,
TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL2ADDX, TILEGX_OPC_SHL2ADD,
TILEGX_OPC_SHL3ADDX, TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHLX, TILEGX_OPC_SHL,
TILEGX_OPC_SHRS, TILEGX_OPC_SHRUX, TILEGX_OPC_SHRU, TILEGX_OPC_ST1,
TILEGX_OPC_ST2, TILEGX_OPC_ST4, TILEGX_OPC_STNT1, TILEGX_OPC_STNT2,
TILEGX_OPC_STNT4,
BITFIELD(46, 7) /* index 849 */,
TILEGX_OPC_STNT, TILEGX_OPC_STNT, TILEGX_OPC_STNT, TILEGX_OPC_STNT,
TILEGX_OPC_STNT, TILEGX_OPC_STNT, TILEGX_OPC_STNT, TILEGX_OPC_STNT,
TILEGX_OPC_ST, TILEGX_OPC_ST, TILEGX_OPC_ST, TILEGX_OPC_ST, TILEGX_OPC_ST,
TILEGX_OPC_ST, TILEGX_OPC_ST, TILEGX_OPC_ST, TILEGX_OPC_SUBXSC,
TILEGX_OPC_SUBXSC, TILEGX_OPC_SUBXSC, TILEGX_OPC_SUBXSC, TILEGX_OPC_SUBXSC,
TILEGX_OPC_SUBXSC, TILEGX_OPC_SUBXSC, TILEGX_OPC_SUBXSC, TILEGX_OPC_SUBX,
TILEGX_OPC_SUBX, TILEGX_OPC_SUBX, TILEGX_OPC_SUBX, TILEGX_OPC_SUBX,
TILEGX_OPC_SUBX, TILEGX_OPC_SUBX, TILEGX_OPC_SUBX, TILEGX_OPC_SUB,
TILEGX_OPC_SUB, TILEGX_OPC_SUB, TILEGX_OPC_SUB, TILEGX_OPC_SUB,
TILEGX_OPC_SUB, TILEGX_OPC_SUB, TILEGX_OPC_SUB, CHILD(978), CHILD(987),
CHILD(1066), CHILD(1150), CHILD(1159), TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_V1ADDUC, TILEGX_OPC_V1ADDUC, TILEGX_OPC_V1ADDUC,
TILEGX_OPC_V1ADDUC, TILEGX_OPC_V1ADDUC, TILEGX_OPC_V1ADDUC,
TILEGX_OPC_V1ADDUC, TILEGX_OPC_V1ADDUC, TILEGX_OPC_V1ADD, TILEGX_OPC_V1ADD,
TILEGX_OPC_V1ADD, TILEGX_OPC_V1ADD, TILEGX_OPC_V1ADD, TILEGX_OPC_V1ADD,
TILEGX_OPC_V1ADD, TILEGX_OPC_V1ADD, TILEGX_OPC_V1CMPEQ, TILEGX_OPC_V1CMPEQ,
TILEGX_OPC_V1CMPEQ, TILEGX_OPC_V1CMPEQ, TILEGX_OPC_V1CMPEQ,
TILEGX_OPC_V1CMPEQ, TILEGX_OPC_V1CMPEQ, TILEGX_OPC_V1CMPEQ,
TILEGX_OPC_V1CMPLES, TILEGX_OPC_V1CMPLES, TILEGX_OPC_V1CMPLES,
TILEGX_OPC_V1CMPLES, TILEGX_OPC_V1CMPLES, TILEGX_OPC_V1CMPLES,
TILEGX_OPC_V1CMPLES, TILEGX_OPC_V1CMPLES, TILEGX_OPC_V1CMPLEU,
TILEGX_OPC_V1CMPLEU, TILEGX_OPC_V1CMPLEU, TILEGX_OPC_V1CMPLEU,
TILEGX_OPC_V1CMPLEU, TILEGX_OPC_V1CMPLEU, TILEGX_OPC_V1CMPLEU,
TILEGX_OPC_V1CMPLEU, TILEGX_OPC_V1CMPLTS, TILEGX_OPC_V1CMPLTS,
TILEGX_OPC_V1CMPLTS, TILEGX_OPC_V1CMPLTS, TILEGX_OPC_V1CMPLTS,
TILEGX_OPC_V1CMPLTS, TILEGX_OPC_V1CMPLTS, TILEGX_OPC_V1CMPLTS,
TILEGX_OPC_V1CMPLTU, TILEGX_OPC_V1CMPLTU, TILEGX_OPC_V1CMPLTU,
TILEGX_OPC_V1CMPLTU, TILEGX_OPC_V1CMPLTU, TILEGX_OPC_V1CMPLTU,
TILEGX_OPC_V1CMPLTU, TILEGX_OPC_V1CMPLTU, TILEGX_OPC_V1CMPNE,
TILEGX_OPC_V1CMPNE, TILEGX_OPC_V1CMPNE, TILEGX_OPC_V1CMPNE,
TILEGX_OPC_V1CMPNE, TILEGX_OPC_V1CMPNE, TILEGX_OPC_V1CMPNE,
TILEGX_OPC_V1CMPNE, TILEGX_OPC_V1INT_H, TILEGX_OPC_V1INT_H,
TILEGX_OPC_V1INT_H, TILEGX_OPC_V1INT_H, TILEGX_OPC_V1INT_H,
TILEGX_OPC_V1INT_H, TILEGX_OPC_V1INT_H, TILEGX_OPC_V1INT_H,
TILEGX_OPC_V1INT_L, TILEGX_OPC_V1INT_L, TILEGX_OPC_V1INT_L,
TILEGX_OPC_V1INT_L, TILEGX_OPC_V1INT_L, TILEGX_OPC_V1INT_L,
TILEGX_OPC_V1INT_L, TILEGX_OPC_V1INT_L,
BITFIELD(43, 3) /* index 978 */,
TILEGX_OPC_NONE, TILEGX_OPC_DRAIN, TILEGX_OPC_DTLBPR, TILEGX_OPC_FINV,
TILEGX_OPC_FLUSHWB, TILEGX_OPC_FLUSH, TILEGX_OPC_FNOP, TILEGX_OPC_ICOH,
BITFIELD(43, 3) /* index 987 */,
CHILD(996), TILEGX_OPC_INV, TILEGX_OPC_IRET, TILEGX_OPC_JALRP,
TILEGX_OPC_JALR, TILEGX_OPC_JRP, TILEGX_OPC_JR, CHILD(1051),
BITFIELD(31, 2) /* index 996 */,
CHILD(1001), CHILD(1026), TILEGX_OPC_ILL, TILEGX_OPC_ILL,
BITFIELD(33, 2) /* index 1001 */,
TILEGX_OPC_ILL, TILEGX_OPC_ILL, TILEGX_OPC_ILL, CHILD(1006),
BITFIELD(35, 2) /* index 1006 */,
TILEGX_OPC_ILL, CHILD(1011), TILEGX_OPC_ILL, TILEGX_OPC_ILL,
BITFIELD(37, 2) /* index 1011 */,
TILEGX_OPC_ILL, CHILD(1016), TILEGX_OPC_ILL, TILEGX_OPC_ILL,
BITFIELD(39, 2) /* index 1016 */,
TILEGX_OPC_ILL, CHILD(1021), TILEGX_OPC_ILL, TILEGX_OPC_ILL,
BITFIELD(41, 2) /* index 1021 */,
TILEGX_OPC_ILL, TILEGX_OPC_ILL, TILEGX_OPC_BPT, TILEGX_OPC_ILL,
BITFIELD(33, 2) /* index 1026 */,
TILEGX_OPC_ILL, TILEGX_OPC_ILL, TILEGX_OPC_ILL, CHILD(1031),
BITFIELD(35, 2) /* index 1031 */,
TILEGX_OPC_ILL, CHILD(1036), TILEGX_OPC_ILL, TILEGX_OPC_ILL,
BITFIELD(37, 2) /* index 1036 */,
TILEGX_OPC_ILL, CHILD(1041), TILEGX_OPC_ILL, TILEGX_OPC_ILL,
BITFIELD(39, 2) /* index 1041 */,
TILEGX_OPC_ILL, CHILD(1046), TILEGX_OPC_ILL, TILEGX_OPC_ILL,
BITFIELD(41, 2) /* index 1046 */,
TILEGX_OPC_ILL, TILEGX_OPC_ILL, TILEGX_OPC_RAISE, TILEGX_OPC_ILL,
BITFIELD(31, 2) /* index 1051 */,
TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, CHILD(1056),
BITFIELD(33, 2) /* index 1056 */,
TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, CHILD(1061),
BITFIELD(35, 2) /* index 1061 */,
TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, TILEGX_OPC_LD1S,
TILEGX_OPC_PREFETCH_L1_FAULT,
BITFIELD(43, 3) /* index 1066 */,
CHILD(1075), CHILD(1090), CHILD(1105), CHILD(1120), CHILD(1135),
TILEGX_OPC_LDNA, TILEGX_OPC_LDNT1S, TILEGX_OPC_LDNT1U,
BITFIELD(31, 2) /* index 1075 */,
TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, CHILD(1080),
BITFIELD(33, 2) /* index 1080 */,
TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, CHILD(1085),
BITFIELD(35, 2) /* index 1085 */,
TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, TILEGX_OPC_PREFETCH,
BITFIELD(31, 2) /* index 1090 */,
TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, CHILD(1095),
BITFIELD(33, 2) /* index 1095 */,
TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, CHILD(1100),
BITFIELD(35, 2) /* index 1100 */,
TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, TILEGX_OPC_LD2S,
TILEGX_OPC_PREFETCH_L2_FAULT,
BITFIELD(31, 2) /* index 1105 */,
TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, CHILD(1110),
BITFIELD(33, 2) /* index 1110 */,
TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, CHILD(1115),
BITFIELD(35, 2) /* index 1115 */,
TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, TILEGX_OPC_PREFETCH_L2,
BITFIELD(31, 2) /* index 1120 */,
TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, CHILD(1125),
BITFIELD(33, 2) /* index 1125 */,
TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, CHILD(1130),
BITFIELD(35, 2) /* index 1130 */,
TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, TILEGX_OPC_LD4S,
TILEGX_OPC_PREFETCH_L3_FAULT,
BITFIELD(31, 2) /* index 1135 */,
TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, CHILD(1140),
BITFIELD(33, 2) /* index 1140 */,
TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, CHILD(1145),
BITFIELD(35, 2) /* index 1145 */,
TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, TILEGX_OPC_PREFETCH_L3,
BITFIELD(43, 3) /* index 1150 */,
TILEGX_OPC_LDNT2S, TILEGX_OPC_LDNT2U, TILEGX_OPC_LDNT4S, TILEGX_OPC_LDNT4U,
TILEGX_OPC_LDNT, TILEGX_OPC_LD, TILEGX_OPC_LNK, TILEGX_OPC_MF,
BITFIELD(43, 3) /* index 1159 */,
TILEGX_OPC_NAP, TILEGX_OPC_NOP, TILEGX_OPC_SWINT0, TILEGX_OPC_SWINT1,
TILEGX_OPC_SWINT2, TILEGX_OPC_SWINT3, TILEGX_OPC_WH64, TILEGX_OPC_NONE,
BITFIELD(49, 4) /* index 1168 */,
TILEGX_OPC_V1MAXU, TILEGX_OPC_V1MINU, TILEGX_OPC_V1MNZ, TILEGX_OPC_V1MZ,
TILEGX_OPC_V1SHL, TILEGX_OPC_V1SHRS, TILEGX_OPC_V1SHRU, TILEGX_OPC_V1SUBUC,
TILEGX_OPC_V1SUB, TILEGX_OPC_V2ADDSC, TILEGX_OPC_V2ADD, TILEGX_OPC_V2CMPEQ,
TILEGX_OPC_V2CMPLES, TILEGX_OPC_V2CMPLEU, TILEGX_OPC_V2CMPLTS,
TILEGX_OPC_V2CMPLTU,
BITFIELD(49, 4) /* index 1185 */,
TILEGX_OPC_V2CMPNE, TILEGX_OPC_V2INT_H, TILEGX_OPC_V2INT_L,
TILEGX_OPC_V2MAXS, TILEGX_OPC_V2MINS, TILEGX_OPC_V2MNZ, TILEGX_OPC_V2MZ,
TILEGX_OPC_V2PACKH, TILEGX_OPC_V2PACKL, TILEGX_OPC_V2PACKUC,
TILEGX_OPC_V2SHLSC, TILEGX_OPC_V2SHL, TILEGX_OPC_V2SHRS, TILEGX_OPC_V2SHRU,
TILEGX_OPC_V2SUBSC, TILEGX_OPC_V2SUB,
BITFIELD(49, 4) /* index 1202 */,
TILEGX_OPC_V4ADDSC, TILEGX_OPC_V4ADD, TILEGX_OPC_V4INT_H,
TILEGX_OPC_V4INT_L, TILEGX_OPC_V4PACKSC, TILEGX_OPC_V4SHLSC,
TILEGX_OPC_V4SHL, TILEGX_OPC_V4SHRS, TILEGX_OPC_V4SHRU, TILEGX_OPC_V4SUBSC,
TILEGX_OPC_V4SUB, TILEGX_OPC_XOR, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(49, 4) /* index 1219 */,
TILEGX_OPC_NONE, TILEGX_OPC_ROTLI, TILEGX_OPC_SHLI, TILEGX_OPC_SHLXI,
TILEGX_OPC_SHRSI, TILEGX_OPC_SHRUI, TILEGX_OPC_SHRUXI, TILEGX_OPC_V1SHLI,
TILEGX_OPC_V1SHRSI, TILEGX_OPC_V1SHRUI, TILEGX_OPC_V2SHLI,
TILEGX_OPC_V2SHRSI, TILEGX_OPC_V2SHRUI, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE,
BITFIELD(31, 2) /* index 1236 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(1241),
BITFIELD(33, 2) /* index 1241 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(1246),
BITFIELD(35, 2) /* index 1246 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(1251),
BITFIELD(37, 2) /* index 1251 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(1256),
BITFIELD(39, 2) /* index 1256 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
CHILD(1261),
BITFIELD(41, 2) /* index 1261 */,
TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI, TILEGX_OPC_SHL16INSLI,
TILEGX_OPC_INFOL,
};
static const unsigned short decode_Y0_fsm[178] =
{
BITFIELD(27, 4) /* index 0 */,
CHILD(17), TILEGX_OPC_ADDXI, CHILD(32), TILEGX_OPC_CMPEQI,
TILEGX_OPC_CMPLTSI, CHILD(62), CHILD(67), CHILD(118), CHILD(123),
CHILD(128), CHILD(133), CHILD(153), CHILD(158), CHILD(163), CHILD(168),
CHILD(173),
BITFIELD(6, 2) /* index 17 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(22),
BITFIELD(8, 2) /* index 22 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(27),
BITFIELD(10, 2) /* index 27 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_MOVEI,
BITFIELD(0, 2) /* index 32 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(37),
BITFIELD(2, 2) /* index 37 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(42),
BITFIELD(4, 2) /* index 42 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(47),
BITFIELD(6, 2) /* index 47 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(52),
BITFIELD(8, 2) /* index 52 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(57),
BITFIELD(10, 2) /* index 57 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_INFO,
BITFIELD(18, 2) /* index 62 */,
TILEGX_OPC_ADDX, TILEGX_OPC_ADD, TILEGX_OPC_SUBX, TILEGX_OPC_SUB,
BITFIELD(15, 5) /* index 67 */,
TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL1ADD,
TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL1ADD,
TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL2ADD,
TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL2ADD,
TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL2ADD,
TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHL3ADD,
TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHL3ADD,
TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHL3ADD, CHILD(100),
CHILD(109), TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(12, 3) /* index 100 */,
TILEGX_OPC_NONE, TILEGX_OPC_CLZ, TILEGX_OPC_CTZ, TILEGX_OPC_FNOP,
TILEGX_OPC_FSINGLE_PACK1, TILEGX_OPC_NOP, TILEGX_OPC_PCNT,
TILEGX_OPC_REVBITS,
BITFIELD(12, 3) /* index 109 */,
TILEGX_OPC_REVBYTES, TILEGX_OPC_TBLIDXB0, TILEGX_OPC_TBLIDXB1,
TILEGX_OPC_TBLIDXB2, TILEGX_OPC_TBLIDXB3, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
TILEGX_OPC_NONE,
BITFIELD(18, 2) /* index 118 */,
TILEGX_OPC_CMPLES, TILEGX_OPC_CMPLEU, TILEGX_OPC_CMPLTS, TILEGX_OPC_CMPLTU,
BITFIELD(18, 2) /* index 123 */,
TILEGX_OPC_CMPEQ, TILEGX_OPC_CMPNE, TILEGX_OPC_MULAX, TILEGX_OPC_MULX,
BITFIELD(18, 2) /* index 128 */,
TILEGX_OPC_CMOVEQZ, TILEGX_OPC_CMOVNEZ, TILEGX_OPC_MNZ, TILEGX_OPC_MZ,
BITFIELD(18, 2) /* index 133 */,
TILEGX_OPC_AND, TILEGX_OPC_NOR, CHILD(138), TILEGX_OPC_XOR,
BITFIELD(12, 2) /* index 138 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(143),
BITFIELD(14, 2) /* index 143 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(148),
BITFIELD(16, 2) /* index 148 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_MOVE,
BITFIELD(18, 2) /* index 153 */,
TILEGX_OPC_ROTL, TILEGX_OPC_SHL, TILEGX_OPC_SHRS, TILEGX_OPC_SHRU,
BITFIELD(18, 2) /* index 158 */,
TILEGX_OPC_NONE, TILEGX_OPC_SHL1ADDX, TILEGX_OPC_SHL2ADDX,
TILEGX_OPC_SHL3ADDX,
BITFIELD(18, 2) /* index 163 */,
TILEGX_OPC_MUL_HS_HS, TILEGX_OPC_MUL_HU_HU, TILEGX_OPC_MUL_LS_LS,
TILEGX_OPC_MUL_LU_LU,
BITFIELD(18, 2) /* index 168 */,
TILEGX_OPC_MULA_HS_HS, TILEGX_OPC_MULA_HU_HU, TILEGX_OPC_MULA_LS_LS,
TILEGX_OPC_MULA_LU_LU,
BITFIELD(18, 2) /* index 173 */,
TILEGX_OPC_ROTLI, TILEGX_OPC_SHLI, TILEGX_OPC_SHRSI, TILEGX_OPC_SHRUI,
};
static const unsigned short decode_Y1_fsm[167] =
{
BITFIELD(58, 4) /* index 0 */,
TILEGX_OPC_NONE, CHILD(17), TILEGX_OPC_ADDXI, CHILD(32), TILEGX_OPC_CMPEQI,
TILEGX_OPC_CMPLTSI, CHILD(62), CHILD(67), CHILD(117), CHILD(122),
CHILD(127), CHILD(132), CHILD(152), CHILD(157), CHILD(162), TILEGX_OPC_NONE,
BITFIELD(37, 2) /* index 17 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(22),
BITFIELD(39, 2) /* index 22 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, CHILD(27),
BITFIELD(41, 2) /* index 27 */,
TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_ADDI, TILEGX_OPC_MOVEI,
BITFIELD(31, 2) /* index 32 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(37),
BITFIELD(33, 2) /* index 37 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(42),
BITFIELD(35, 2) /* index 42 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(47),
BITFIELD(37, 2) /* index 47 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(52),
BITFIELD(39, 2) /* index 52 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, CHILD(57),
BITFIELD(41, 2) /* index 57 */,
TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_ANDI, TILEGX_OPC_INFO,
BITFIELD(49, 2) /* index 62 */,
TILEGX_OPC_ADDX, TILEGX_OPC_ADD, TILEGX_OPC_SUBX, TILEGX_OPC_SUB,
BITFIELD(47, 4) /* index 67 */,
TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL1ADD,
TILEGX_OPC_SHL1ADD, TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL2ADD,
TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL2ADD, TILEGX_OPC_SHL3ADD,
TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHL3ADD, TILEGX_OPC_SHL3ADD, CHILD(84),
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_NONE,
BITFIELD(43, 3) /* index 84 */,
CHILD(93), CHILD(96), CHILD(99), CHILD(102), CHILD(105), CHILD(108),
CHILD(111), CHILD(114),
BITFIELD(46, 1) /* index 93 */,
TILEGX_OPC_NONE, TILEGX_OPC_FNOP,
BITFIELD(46, 1) /* index 96 */,
TILEGX_OPC_NONE, TILEGX_OPC_ILL,
BITFIELD(46, 1) /* index 99 */,
TILEGX_OPC_NONE, TILEGX_OPC_JALRP,
BITFIELD(46, 1) /* index 102 */,
TILEGX_OPC_NONE, TILEGX_OPC_JALR,
BITFIELD(46, 1) /* index 105 */,
TILEGX_OPC_NONE, TILEGX_OPC_JRP,
BITFIELD(46, 1) /* index 108 */,
TILEGX_OPC_NONE, TILEGX_OPC_JR,
BITFIELD(46, 1) /* index 111 */,
TILEGX_OPC_NONE, TILEGX_OPC_LNK,
BITFIELD(46, 1) /* index 114 */,
TILEGX_OPC_NONE, TILEGX_OPC_NOP,
BITFIELD(49, 2) /* index 117 */,
TILEGX_OPC_CMPLES, TILEGX_OPC_CMPLEU, TILEGX_OPC_CMPLTS, TILEGX_OPC_CMPLTU,
BITFIELD(49, 2) /* index 122 */,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_CMPEQ, TILEGX_OPC_CMPNE,
BITFIELD(49, 2) /* index 127 */,
TILEGX_OPC_NONE, TILEGX_OPC_NONE, TILEGX_OPC_MNZ, TILEGX_OPC_MZ,
BITFIELD(49, 2) /* index 132 */,
TILEGX_OPC_AND, TILEGX_OPC_NOR, CHILD(137), TILEGX_OPC_XOR,
BITFIELD(43, 2) /* index 137 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(142),
BITFIELD(45, 2) /* index 142 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, CHILD(147),
BITFIELD(47, 2) /* index 147 */,
TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_OR, TILEGX_OPC_MOVE,
BITFIELD(49, 2) /* index 152 */,
TILEGX_OPC_ROTL, TILEGX_OPC_SHL, TILEGX_OPC_SHRS, TILEGX_OPC_SHRU,
BITFIELD(49, 2) /* index 157 */,
TILEGX_OPC_NONE, TILEGX_OPC_SHL1ADDX, TILEGX_OPC_SHL2ADDX,
TILEGX_OPC_SHL3ADDX,
BITFIELD(49, 2) /* index 162 */,
TILEGX_OPC_ROTLI, TILEGX_OPC_SHLI, TILEGX_OPC_SHRSI, TILEGX_OPC_SHRUI,
};
static const unsigned short decode_Y2_fsm[118] =
{
BITFIELD(62, 2) /* index 0 */,
TILEGX_OPC_NONE, CHILD(5), CHILD(66), CHILD(109),
BITFIELD(55, 3) /* index 5 */,
CHILD(14), CHILD(14), CHILD(14), CHILD(17), CHILD(40), CHILD(40), CHILD(40),
CHILD(43),
BITFIELD(26, 1) /* index 14 */,
TILEGX_OPC_LD1S, TILEGX_OPC_LD1U,
BITFIELD(26, 1) /* index 17 */,
CHILD(20), CHILD(30),
BITFIELD(51, 2) /* index 20 */,
TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, CHILD(25),
BITFIELD(53, 2) /* index 25 */,
TILEGX_OPC_LD1S, TILEGX_OPC_LD1S, TILEGX_OPC_LD1S,
TILEGX_OPC_PREFETCH_L1_FAULT,
BITFIELD(51, 2) /* index 30 */,
TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, CHILD(35),
BITFIELD(53, 2) /* index 35 */,
TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, TILEGX_OPC_LD1U, TILEGX_OPC_PREFETCH,
BITFIELD(26, 1) /* index 40 */,
TILEGX_OPC_LD2S, TILEGX_OPC_LD2U,
BITFIELD(26, 1) /* index 43 */,
CHILD(46), CHILD(56),
BITFIELD(51, 2) /* index 46 */,
TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, CHILD(51),
BITFIELD(53, 2) /* index 51 */,
TILEGX_OPC_LD2S, TILEGX_OPC_LD2S, TILEGX_OPC_LD2S,
TILEGX_OPC_PREFETCH_L2_FAULT,
BITFIELD(51, 2) /* index 56 */,
TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, CHILD(61),
BITFIELD(53, 2) /* index 61 */,
TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, TILEGX_OPC_LD2U, TILEGX_OPC_PREFETCH_L2,
BITFIELD(56, 2) /* index 66 */,
CHILD(71), CHILD(74), CHILD(90), CHILD(93),
BITFIELD(26, 1) /* index 71 */,
TILEGX_OPC_NONE, TILEGX_OPC_LD4S,
BITFIELD(26, 1) /* index 74 */,
TILEGX_OPC_NONE, CHILD(77),
BITFIELD(51, 2) /* index 77 */,
TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, CHILD(82),
BITFIELD(53, 2) /* index 82 */,
TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, TILEGX_OPC_LD4S, CHILD(87),
BITFIELD(55, 1) /* index 87 */,
TILEGX_OPC_LD4S, TILEGX_OPC_PREFETCH_L3_FAULT,
BITFIELD(26, 1) /* index 90 */,
TILEGX_OPC_LD4U, TILEGX_OPC_LD,
BITFIELD(26, 1) /* index 93 */,
CHILD(96), TILEGX_OPC_LD,
BITFIELD(51, 2) /* index 96 */,
TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, CHILD(101),
BITFIELD(53, 2) /* index 101 */,
TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, TILEGX_OPC_LD4U, CHILD(106),
BITFIELD(55, 1) /* index 106 */,
TILEGX_OPC_LD4U, TILEGX_OPC_PREFETCH_L3,
BITFIELD(26, 1) /* index 109 */,
CHILD(112), CHILD(115),
BITFIELD(57, 1) /* index 112 */,
TILEGX_OPC_ST1, TILEGX_OPC_ST4,
BITFIELD(57, 1) /* index 115 */,
TILEGX_OPC_ST2, TILEGX_OPC_ST,
};
#undef BITFIELD
#undef CHILD
const unsigned short * const
tilegx_bundle_decoder_fsms[TILEGX_NUM_PIPELINE_ENCODINGS] =
{
decode_X0_fsm,
decode_X1_fsm,
decode_Y0_fsm,
decode_Y1_fsm,
decode_Y2_fsm
};
const struct tilegx_operand tilegx_operands[35] =
{
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_IMM8_X0),
8, 1, 0, 0, 0, 0,
create_Imm8_X0, get_Imm8_X0
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_IMM8_X1),
8, 1, 0, 0, 0, 0,
create_Imm8_X1, get_Imm8_X1
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_IMM8_Y0),
8, 1, 0, 0, 0, 0,
create_Imm8_Y0, get_Imm8_Y0
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_IMM8_Y1),
8, 1, 0, 0, 0, 0,
create_Imm8_Y1, get_Imm8_Y1
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_IMM16_X0_HW0_LAST),
16, 1, 0, 0, 0, 0,
create_Imm16_X0, get_Imm16_X0
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_IMM16_X1_HW0_LAST),
16, 1, 0, 0, 0, 0,
create_Imm16_X1, get_Imm16_X1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 0, 1, 0, 0,
create_Dest_X1, get_Dest_X1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcA_X1, get_SrcA_X1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 0, 1, 0, 0,
create_Dest_X0, get_Dest_X0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcA_X0, get_SrcA_X0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 0, 1, 0, 0,
create_Dest_Y0, get_Dest_Y0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcA_Y0, get_SrcA_Y0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 0, 1, 0, 0,
create_Dest_Y1, get_Dest_Y1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcA_Y1, get_SrcA_Y1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcA_Y2, get_SrcA_Y2
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 1, 0, 0,
create_SrcA_X1, get_SrcA_X1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcB_X0, get_SrcB_X0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcB_X1, get_SrcB_X1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcB_Y0, get_SrcB_Y0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcB_Y1, get_SrcB_Y1
},
{
TILEGX_OP_TYPE_ADDRESS, BFD_RELOC(TILEGX_BROFF_X1),
17, 1, 0, 0, 1, TILEGX_LOG2_BUNDLE_ALIGNMENT_IN_BYTES,
create_BrOff_X1, get_BrOff_X1
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_MMSTART_X0),
6, 0, 0, 0, 0, 0,
create_BFStart_X0, get_BFStart_X0
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_MMEND_X0),
6, 0, 0, 0, 0, 0,
create_BFEnd_X0, get_BFEnd_X0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 1, 0, 0,
create_Dest_X0, get_Dest_X0
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 1, 0, 0,
create_Dest_Y0, get_Dest_Y0
},
{
TILEGX_OP_TYPE_ADDRESS, BFD_RELOC(TILEGX_JUMPOFF_X1),
27, 1, 0, 0, 1, TILEGX_LOG2_BUNDLE_ALIGNMENT_IN_BYTES,
create_JumpOff_X1, get_JumpOff_X1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 0, 1, 0, 0,
create_SrcBDest_Y2, get_SrcBDest_Y2
},
{
TILEGX_OP_TYPE_SPR, BFD_RELOC(TILEGX_MF_IMM14_X1),
14, 0, 0, 0, 0, 0,
create_MF_Imm14_X1, get_MF_Imm14_X1
},
{
TILEGX_OP_TYPE_SPR, BFD_RELOC(TILEGX_MT_IMM14_X1),
14, 0, 0, 0, 0, 0,
create_MT_Imm14_X1, get_MT_Imm14_X1
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_SHAMT_X0),
6, 0, 0, 0, 0, 0,
create_ShAmt_X0, get_ShAmt_X0
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_SHAMT_X1),
6, 0, 0, 0, 0, 0,
create_ShAmt_X1, get_ShAmt_X1
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_SHAMT_Y0),
6, 0, 0, 0, 0, 0,
create_ShAmt_Y0, get_ShAmt_Y0
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_SHAMT_Y1),
6, 0, 0, 0, 0, 0,
create_ShAmt_Y1, get_ShAmt_Y1
},
{
TILEGX_OP_TYPE_REGISTER, BFD_RELOC(NONE),
6, 0, 1, 0, 0, 0,
create_SrcBDest_Y2, get_SrcBDest_Y2
},
{
TILEGX_OP_TYPE_IMMEDIATE, BFD_RELOC(TILEGX_DEST_IMM8_X1),
8, 1, 0, 0, 0, 0,
create_Dest_Imm8_X1, get_Dest_Imm8_X1
}
};
/* Given a set of bundle bits and a specific pipe, returns which
* instruction the bundle contains in that pipe.
*/
const struct tilegx_opcode *
find_opcode(tilegx_bundle_bits bits, tilegx_pipeline pipe)
{
const unsigned short *table = tilegx_bundle_decoder_fsms[pipe];
int index = 0;
while (1)
{
unsigned short bitspec = table[index];
unsigned int bitfield =
((unsigned int)(bits >> (bitspec & 63))) & (bitspec >> 6);
unsigned short next = table[index + 1 + bitfield];
if (next <= TILEGX_OPC_NONE)
return &tilegx_opcodes[next];
index = next - TILEGX_OPC_NONE;
}
}
int
parse_insn_tilegx(tilegx_bundle_bits bits,
unsigned long long pc,
struct tilegx_decoded_instruction
decoded[TILEGX_MAX_INSTRUCTIONS_PER_BUNDLE])
{
int num_instructions = 0;
int pipe;
int min_pipe, max_pipe;
if ((bits & TILEGX_BUNDLE_MODE_MASK) == 0)
{
min_pipe = TILEGX_PIPELINE_X0;
max_pipe = TILEGX_PIPELINE_X1;
}
else
{
min_pipe = TILEGX_PIPELINE_Y0;
max_pipe = TILEGX_PIPELINE_Y2;
}
/* For each pipe, find an instruction that fits. */
for (pipe = min_pipe; pipe <= max_pipe; pipe++)
{
const struct tilegx_opcode *opc;
struct tilegx_decoded_instruction *d;
int i;
d = &decoded[num_instructions++];
opc = find_opcode (bits, (tilegx_pipeline)pipe);
d->opcode = opc;
/* Decode each operand, sign extending, etc. as appropriate. */
for (i = 0; i < opc->num_operands; i++)
{
const struct tilegx_operand *op =
&tilegx_operands[opc->operands[pipe][i]];
int raw_opval = op->extract (bits);
long long opval;
if (op->is_signed)
{
/* Sign-extend the operand. */
int shift = (int)((sizeof(int) * 8) - op->num_bits);
raw_opval = (raw_opval << shift) >> shift;
}
/* Adjust PC-relative scaled branch offsets. */
if (op->type == TILEGX_OP_TYPE_ADDRESS)
opval = (raw_opval * TILEGX_BUNDLE_SIZE_IN_BYTES) + pc;
else
opval = raw_opval;
/* Record the final value. */
d->operands[i] = op;
d->operand_values[i] = opval;
}
}
return num_instructions;
}
struct tilegx_spr
{
/* The number */
int number;
/* The name */
const char *name;
};
static int
tilegx_spr_compare (const void *a_ptr, const void *b_ptr)
{
const struct tilegx_spr *a = (const struct tilegx_spr *) a_ptr;
const struct tilegx_spr *b = (const struct tilegx_spr *) b_ptr;
return (a->number - b->number);
}
const struct tilegx_spr tilegx_sprs[] = {
{ 0, "MPL_MEM_ERROR_SET_0" },
{ 1, "MPL_MEM_ERROR_SET_1" },
{ 2, "MPL_MEM_ERROR_SET_2" },
{ 3, "MPL_MEM_ERROR_SET_3" },
{ 4, "MPL_MEM_ERROR" },
{ 5, "MEM_ERROR_CBOX_ADDR" },
{ 6, "MEM_ERROR_CBOX_STATUS" },
{ 7, "MEM_ERROR_ENABLE" },
{ 8, "MEM_ERROR_MBOX_ADDR" },
{ 9, "MEM_ERROR_MBOX_STATUS" },
{ 10, "SBOX_ERROR" },
{ 11, "XDN_DEMUX_ERROR" },
{ 256, "MPL_SINGLE_STEP_3_SET_0" },
{ 257, "MPL_SINGLE_STEP_3_SET_1" },
{ 258, "MPL_SINGLE_STEP_3_SET_2" },
{ 259, "MPL_SINGLE_STEP_3_SET_3" },
{ 260, "MPL_SINGLE_STEP_3" },
{ 261, "SINGLE_STEP_CONTROL_3" },
{ 512, "MPL_SINGLE_STEP_2_SET_0" },
{ 513, "MPL_SINGLE_STEP_2_SET_1" },
{ 514, "MPL_SINGLE_STEP_2_SET_2" },
{ 515, "MPL_SINGLE_STEP_2_SET_3" },
{ 516, "MPL_SINGLE_STEP_2" },
{ 517, "SINGLE_STEP_CONTROL_2" },
{ 768, "MPL_SINGLE_STEP_1_SET_0" },
{ 769, "MPL_SINGLE_STEP_1_SET_1" },
{ 770, "MPL_SINGLE_STEP_1_SET_2" },
{ 771, "MPL_SINGLE_STEP_1_SET_3" },
{ 772, "MPL_SINGLE_STEP_1" },
{ 773, "SINGLE_STEP_CONTROL_1" },
{ 1024, "MPL_SINGLE_STEP_0_SET_0" },
{ 1025, "MPL_SINGLE_STEP_0_SET_1" },
{ 1026, "MPL_SINGLE_STEP_0_SET_2" },
{ 1027, "MPL_SINGLE_STEP_0_SET_3" },
{ 1028, "MPL_SINGLE_STEP_0" },
{ 1029, "SINGLE_STEP_CONTROL_0" },
{ 1280, "MPL_IDN_COMPLETE_SET_0" },
{ 1281, "MPL_IDN_COMPLETE_SET_1" },
{ 1282, "MPL_IDN_COMPLETE_SET_2" },
{ 1283, "MPL_IDN_COMPLETE_SET_3" },
{ 1284, "MPL_IDN_COMPLETE" },
{ 1285, "IDN_COMPLETE_PENDING" },
{ 1536, "MPL_UDN_COMPLETE_SET_0" },
{ 1537, "MPL_UDN_COMPLETE_SET_1" },
{ 1538, "MPL_UDN_COMPLETE_SET_2" },
{ 1539, "MPL_UDN_COMPLETE_SET_3" },
{ 1540, "MPL_UDN_COMPLETE" },
{ 1541, "UDN_COMPLETE_PENDING" },
{ 1792, "MPL_ITLB_MISS_SET_0" },
{ 1793, "MPL_ITLB_MISS_SET_1" },
{ 1794, "MPL_ITLB_MISS_SET_2" },
{ 1795, "MPL_ITLB_MISS_SET_3" },
{ 1796, "MPL_ITLB_MISS" },
{ 1797, "ITLB_TSB_BASE_ADDR_0" },
{ 1798, "ITLB_TSB_BASE_ADDR_1" },
{ 1920, "ITLB_CURRENT_ATTR" },
{ 1921, "ITLB_CURRENT_PA" },
{ 1922, "ITLB_CURRENT_VA" },
{ 1923, "ITLB_INDEX" },
{ 1924, "ITLB_MATCH_0" },
{ 1925, "ITLB_PERF" },
{ 1926, "ITLB_PR" },
{ 1927, "ITLB_TSB_ADDR_0" },
{ 1928, "ITLB_TSB_ADDR_1" },
{ 1929, "ITLB_TSB_FILL_CURRENT_ATTR" },
{ 1930, "ITLB_TSB_FILL_MATCH" },
{ 1931, "NUMBER_ITLB" },
{ 1932, "REPLACEMENT_ITLB" },
{ 1933, "WIRED_ITLB" },
{ 2048, "MPL_ILL_SET_0" },
{ 2049, "MPL_ILL_SET_1" },
{ 2050, "MPL_ILL_SET_2" },
{ 2051, "MPL_ILL_SET_3" },
{ 2052, "MPL_ILL" },
{ 2304, "MPL_GPV_SET_0" },
{ 2305, "MPL_GPV_SET_1" },
{ 2306, "MPL_GPV_SET_2" },
{ 2307, "MPL_GPV_SET_3" },
{ 2308, "MPL_GPV" },
{ 2309, "GPV_REASON" },
{ 2560, "MPL_IDN_ACCESS_SET_0" },
{ 2561, "MPL_IDN_ACCESS_SET_1" },
{ 2562, "MPL_IDN_ACCESS_SET_2" },
{ 2563, "MPL_IDN_ACCESS_SET_3" },
{ 2564, "MPL_IDN_ACCESS" },
{ 2565, "IDN_DEMUX_COUNT_0" },
{ 2566, "IDN_DEMUX_COUNT_1" },
{ 2567, "IDN_FLUSH_EGRESS" },
{ 2568, "IDN_PENDING" },
{ 2569, "IDN_ROUTE_ORDER" },
{ 2570, "IDN_SP_FIFO_CNT" },
{ 2688, "IDN_DATA_AVAIL" },
{ 2816, "MPL_UDN_ACCESS_SET_0" },
{ 2817, "MPL_UDN_ACCESS_SET_1" },
{ 2818, "MPL_UDN_ACCESS_SET_2" },
{ 2819, "MPL_UDN_ACCESS_SET_3" },
{ 2820, "MPL_UDN_ACCESS" },
{ 2821, "UDN_DEMUX_COUNT_0" },
{ 2822, "UDN_DEMUX_COUNT_1" },
{ 2823, "UDN_DEMUX_COUNT_2" },
{ 2824, "UDN_DEMUX_COUNT_3" },
{ 2825, "UDN_FLUSH_EGRESS" },
{ 2826, "UDN_PENDING" },
{ 2827, "UDN_ROUTE_ORDER" },
{ 2828, "UDN_SP_FIFO_CNT" },
{ 2944, "UDN_DATA_AVAIL" },
{ 3072, "MPL_SWINT_3_SET_0" },
{ 3073, "MPL_SWINT_3_SET_1" },
{ 3074, "MPL_SWINT_3_SET_2" },
{ 3075, "MPL_SWINT_3_SET_3" },
{ 3076, "MPL_SWINT_3" },
{ 3328, "MPL_SWINT_2_SET_0" },
{ 3329, "MPL_SWINT_2_SET_1" },
{ 3330, "MPL_SWINT_2_SET_2" },
{ 3331, "MPL_SWINT_2_SET_3" },
{ 3332, "MPL_SWINT_2" },
{ 3584, "MPL_SWINT_1_SET_0" },
{ 3585, "MPL_SWINT_1_SET_1" },
{ 3586, "MPL_SWINT_1_SET_2" },
{ 3587, "MPL_SWINT_1_SET_3" },
{ 3588, "MPL_SWINT_1" },
{ 3840, "MPL_SWINT_0_SET_0" },
{ 3841, "MPL_SWINT_0_SET_1" },
{ 3842, "MPL_SWINT_0_SET_2" },
{ 3843, "MPL_SWINT_0_SET_3" },
{ 3844, "MPL_SWINT_0" },
{ 4096, "MPL_ILL_TRANS_SET_0" },
{ 4097, "MPL_ILL_TRANS_SET_1" },
{ 4098, "MPL_ILL_TRANS_SET_2" },
{ 4099, "MPL_ILL_TRANS_SET_3" },
{ 4100, "MPL_ILL_TRANS" },
{ 4101, "ILL_TRANS_REASON" },
{ 4102, "ILL_VA_PC" },
{ 4352, "MPL_UNALIGN_DATA_SET_0" },
{ 4353, "MPL_UNALIGN_DATA_SET_1" },
{ 4354, "MPL_UNALIGN_DATA_SET_2" },
{ 4355, "MPL_UNALIGN_DATA_SET_3" },
{ 4356, "MPL_UNALIGN_DATA" },
{ 4608, "MPL_DTLB_MISS_SET_0" },
{ 4609, "MPL_DTLB_MISS_SET_1" },
{ 4610, "MPL_DTLB_MISS_SET_2" },
{ 4611, "MPL_DTLB_MISS_SET_3" },
{ 4612, "MPL_DTLB_MISS" },
{ 4613, "DTLB_TSB_BASE_ADDR_0" },
{ 4614, "DTLB_TSB_BASE_ADDR_1" },
{ 4736, "AAR" },
{ 4737, "CACHE_PINNED_WAYS" },
{ 4738, "DTLB_BAD_ADDR" },
{ 4739, "DTLB_BAD_ADDR_REASON" },
{ 4740, "DTLB_CURRENT_ATTR" },
{ 4741, "DTLB_CURRENT_PA" },
{ 4742, "DTLB_CURRENT_VA" },
{ 4743, "DTLB_INDEX" },
{ 4744, "DTLB_MATCH_0" },
{ 4745, "DTLB_PERF" },
{ 4746, "DTLB_TSB_ADDR_0" },
{ 4747, "DTLB_TSB_ADDR_1" },
{ 4748, "DTLB_TSB_FILL_CURRENT_ATTR" },
{ 4749, "DTLB_TSB_FILL_MATCH" },
{ 4750, "NUMBER_DTLB" },
{ 4751, "REPLACEMENT_DTLB" },
{ 4752, "WIRED_DTLB" },
{ 4864, "MPL_DTLB_ACCESS_SET_0" },
{ 4865, "MPL_DTLB_ACCESS_SET_1" },
{ 4866, "MPL_DTLB_ACCESS_SET_2" },
{ 4867, "MPL_DTLB_ACCESS_SET_3" },
{ 4868, "MPL_DTLB_ACCESS" },
{ 5120, "MPL_IDN_FIREWALL_SET_0" },
{ 5121, "MPL_IDN_FIREWALL_SET_1" },
{ 5122, "MPL_IDN_FIREWALL_SET_2" },
{ 5123, "MPL_IDN_FIREWALL_SET_3" },
{ 5124, "MPL_IDN_FIREWALL" },
{ 5125, "IDN_DIRECTION_PROTECT" },
{ 5376, "MPL_UDN_FIREWALL_SET_0" },
{ 5377, "MPL_UDN_FIREWALL_SET_1" },
{ 5378, "MPL_UDN_FIREWALL_SET_2" },
{ 5379, "MPL_UDN_FIREWALL_SET_3" },
{ 5380, "MPL_UDN_FIREWALL" },
{ 5381, "UDN_DIRECTION_PROTECT" },
{ 5632, "MPL_TILE_TIMER_SET_0" },
{ 5633, "MPL_TILE_TIMER_SET_1" },
{ 5634, "MPL_TILE_TIMER_SET_2" },
{ 5635, "MPL_TILE_TIMER_SET_3" },
{ 5636, "MPL_TILE_TIMER" },
{ 5637, "TILE_TIMER_CONTROL" },
{ 5888, "MPL_AUX_TILE_TIMER_SET_0" },
{ 5889, "MPL_AUX_TILE_TIMER_SET_1" },
{ 5890, "MPL_AUX_TILE_TIMER_SET_2" },
{ 5891, "MPL_AUX_TILE_TIMER_SET_3" },
{ 5892, "MPL_AUX_TILE_TIMER" },
{ 5893, "AUX_TILE_TIMER_CONTROL" },
{ 6144, "MPL_IDN_TIMER_SET_0" },
{ 6145, "MPL_IDN_TIMER_SET_1" },
{ 6146, "MPL_IDN_TIMER_SET_2" },
{ 6147, "MPL_IDN_TIMER_SET_3" },
{ 6148, "MPL_IDN_TIMER" },
{ 6149, "IDN_DEADLOCK_COUNT" },
{ 6150, "IDN_DEADLOCK_TIMEOUT" },
{ 6400, "MPL_UDN_TIMER_SET_0" },
{ 6401, "MPL_UDN_TIMER_SET_1" },
{ 6402, "MPL_UDN_TIMER_SET_2" },
{ 6403, "MPL_UDN_TIMER_SET_3" },
{ 6404, "MPL_UDN_TIMER" },
{ 6405, "UDN_DEADLOCK_COUNT" },
{ 6406, "UDN_DEADLOCK_TIMEOUT" },
{ 6656, "MPL_IDN_AVAIL_SET_0" },
{ 6657, "MPL_IDN_AVAIL_SET_1" },
{ 6658, "MPL_IDN_AVAIL_SET_2" },
{ 6659, "MPL_IDN_AVAIL_SET_3" },
{ 6660, "MPL_IDN_AVAIL" },
{ 6661, "IDN_AVAIL_EN" },
{ 6912, "MPL_UDN_AVAIL_SET_0" },
{ 6913, "MPL_UDN_AVAIL_SET_1" },
{ 6914, "MPL_UDN_AVAIL_SET_2" },
{ 6915, "MPL_UDN_AVAIL_SET_3" },
{ 6916, "MPL_UDN_AVAIL" },
{ 6917, "UDN_AVAIL_EN" },
{ 7168, "MPL_IPI_3_SET_0" },
{ 7169, "MPL_IPI_3_SET_1" },
{ 7170, "MPL_IPI_3_SET_2" },
{ 7171, "MPL_IPI_3_SET_3" },
{ 7172, "MPL_IPI_3" },
{ 7173, "IPI_EVENT_3" },
{ 7174, "IPI_EVENT_RESET_3" },
{ 7175, "IPI_EVENT_SET_3" },
{ 7176, "IPI_MASK_3" },
{ 7177, "IPI_MASK_RESET_3" },
{ 7178, "IPI_MASK_SET_3" },
{ 7424, "MPL_IPI_2_SET_0" },
{ 7425, "MPL_IPI_2_SET_1" },
{ 7426, "MPL_IPI_2_SET_2" },
{ 7427, "MPL_IPI_2_SET_3" },
{ 7428, "MPL_IPI_2" },
{ 7429, "IPI_EVENT_2" },
{ 7430, "IPI_EVENT_RESET_2" },
{ 7431, "IPI_EVENT_SET_2" },
{ 7432, "IPI_MASK_2" },
{ 7433, "IPI_MASK_RESET_2" },
{ 7434, "IPI_MASK_SET_2" },
{ 7680, "MPL_IPI_1_SET_0" },
{ 7681, "MPL_IPI_1_SET_1" },
{ 7682, "MPL_IPI_1_SET_2" },
{ 7683, "MPL_IPI_1_SET_3" },
{ 7684, "MPL_IPI_1" },
{ 7685, "IPI_EVENT_1" },
{ 7686, "IPI_EVENT_RESET_1" },
{ 7687, "IPI_EVENT_SET_1" },
{ 7688, "IPI_MASK_1" },
{ 7689, "IPI_MASK_RESET_1" },
{ 7690, "IPI_MASK_SET_1" },
{ 7936, "MPL_IPI_0_SET_0" },
{ 7937, "MPL_IPI_0_SET_1" },
{ 7938, "MPL_IPI_0_SET_2" },
{ 7939, "MPL_IPI_0_SET_3" },
{ 7940, "MPL_IPI_0" },
{ 7941, "IPI_EVENT_0" },
{ 7942, "IPI_EVENT_RESET_0" },
{ 7943, "IPI_EVENT_SET_0" },
{ 7944, "IPI_MASK_0" },
{ 7945, "IPI_MASK_RESET_0" },
{ 7946, "IPI_MASK_SET_0" },
{ 8192, "MPL_PERF_COUNT_SET_0" },
{ 8193, "MPL_PERF_COUNT_SET_1" },
{ 8194, "MPL_PERF_COUNT_SET_2" },
{ 8195, "MPL_PERF_COUNT_SET_3" },
{ 8196, "MPL_PERF_COUNT" },
{ 8197, "PERF_COUNT_0" },
{ 8198, "PERF_COUNT_1" },
{ 8199, "PERF_COUNT_CTL" },
{ 8200, "PERF_COUNT_DN_CTL" },
{ 8201, "PERF_COUNT_STS" },
{ 8202, "WATCH_MASK" },
{ 8203, "WATCH_VAL" },
{ 8448, "MPL_AUX_PERF_COUNT_SET_0" },
{ 8449, "MPL_AUX_PERF_COUNT_SET_1" },
{ 8450, "MPL_AUX_PERF_COUNT_SET_2" },
{ 8451, "MPL_AUX_PERF_COUNT_SET_3" },
{ 8452, "MPL_AUX_PERF_COUNT" },
{ 8453, "AUX_PERF_COUNT_0" },
{ 8454, "AUX_PERF_COUNT_1" },
{ 8455, "AUX_PERF_COUNT_CTL" },
{ 8456, "AUX_PERF_COUNT_STS" },
{ 8704, "MPL_INTCTRL_3_SET_0" },
{ 8705, "MPL_INTCTRL_3_SET_1" },
{ 8706, "MPL_INTCTRL_3_SET_2" },
{ 8707, "MPL_INTCTRL_3_SET_3" },
{ 8708, "MPL_INTCTRL_3" },
{ 8709, "INTCTRL_3_STATUS" },
{ 8710, "INTERRUPT_MASK_3" },
{ 8711, "INTERRUPT_MASK_RESET_3" },
{ 8712, "INTERRUPT_MASK_SET_3" },
{ 8713, "INTERRUPT_VECTOR_BASE_3" },
{ 8714, "SINGLE_STEP_EN_0_3" },
{ 8715, "SINGLE_STEP_EN_1_3" },
{ 8716, "SINGLE_STEP_EN_2_3" },
{ 8717, "SINGLE_STEP_EN_3_3" },
{ 8832, "EX_CONTEXT_3_0" },
{ 8833, "EX_CONTEXT_3_1" },
{ 8834, "SYSTEM_SAVE_3_0" },
{ 8835, "SYSTEM_SAVE_3_1" },
{ 8836, "SYSTEM_SAVE_3_2" },
{ 8837, "SYSTEM_SAVE_3_3" },
{ 8960, "MPL_INTCTRL_2_SET_0" },
{ 8961, "MPL_INTCTRL_2_SET_1" },
{ 8962, "MPL_INTCTRL_2_SET_2" },
{ 8963, "MPL_INTCTRL_2_SET_3" },
{ 8964, "MPL_INTCTRL_2" },
{ 8965, "INTCTRL_2_STATUS" },
{ 8966, "INTERRUPT_MASK_2" },
{ 8967, "INTERRUPT_MASK_RESET_2" },
{ 8968, "INTERRUPT_MASK_SET_2" },
{ 8969, "INTERRUPT_VECTOR_BASE_2" },
{ 8970, "SINGLE_STEP_EN_0_2" },
{ 8971, "SINGLE_STEP_EN_1_2" },
{ 8972, "SINGLE_STEP_EN_2_2" },
{ 8973, "SINGLE_STEP_EN_3_2" },
{ 9088, "EX_CONTEXT_2_0" },
{ 9089, "EX_CONTEXT_2_1" },
{ 9090, "SYSTEM_SAVE_2_0" },
{ 9091, "SYSTEM_SAVE_2_1" },
{ 9092, "SYSTEM_SAVE_2_2" },
{ 9093, "SYSTEM_SAVE_2_3" },
{ 9216, "MPL_INTCTRL_1_SET_0" },
{ 9217, "MPL_INTCTRL_1_SET_1" },
{ 9218, "MPL_INTCTRL_1_SET_2" },
{ 9219, "MPL_INTCTRL_1_SET_3" },
{ 9220, "MPL_INTCTRL_1" },
{ 9221, "INTCTRL_1_STATUS" },
{ 9222, "INTERRUPT_MASK_1" },
{ 9223, "INTERRUPT_MASK_RESET_1" },
{ 9224, "INTERRUPT_MASK_SET_1" },
{ 9225, "INTERRUPT_VECTOR_BASE_1" },
{ 9226, "SINGLE_STEP_EN_0_1" },
{ 9227, "SINGLE_STEP_EN_1_1" },
{ 9228, "SINGLE_STEP_EN_2_1" },
{ 9229, "SINGLE_STEP_EN_3_1" },
{ 9344, "EX_CONTEXT_1_0" },
{ 9345, "EX_CONTEXT_1_1" },
{ 9346, "SYSTEM_SAVE_1_0" },
{ 9347, "SYSTEM_SAVE_1_1" },
{ 9348, "SYSTEM_SAVE_1_2" },
{ 9349, "SYSTEM_SAVE_1_3" },
{ 9472, "MPL_INTCTRL_0_SET_0" },
{ 9473, "MPL_INTCTRL_0_SET_1" },
{ 9474, "MPL_INTCTRL_0_SET_2" },
{ 9475, "MPL_INTCTRL_0_SET_3" },
{ 9476, "MPL_INTCTRL_0" },
{ 9477, "INTCTRL_0_STATUS" },
{ 9478, "INTERRUPT_MASK_0" },
{ 9479, "INTERRUPT_MASK_RESET_0" },
{ 9480, "INTERRUPT_MASK_SET_0" },
{ 9481, "INTERRUPT_VECTOR_BASE_0" },
{ 9482, "SINGLE_STEP_EN_0_0" },
{ 9483, "SINGLE_STEP_EN_1_0" },
{ 9484, "SINGLE_STEP_EN_2_0" },
{ 9485, "SINGLE_STEP_EN_3_0" },
{ 9600, "EX_CONTEXT_0_0" },
{ 9601, "EX_CONTEXT_0_1" },
{ 9602, "SYSTEM_SAVE_0_0" },
{ 9603, "SYSTEM_SAVE_0_1" },
{ 9604, "SYSTEM_SAVE_0_2" },
{ 9605, "SYSTEM_SAVE_0_3" },
{ 9728, "MPL_BOOT_ACCESS_SET_0" },
{ 9729, "MPL_BOOT_ACCESS_SET_1" },
{ 9730, "MPL_BOOT_ACCESS_SET_2" },
{ 9731, "MPL_BOOT_ACCESS_SET_3" },
{ 9732, "MPL_BOOT_ACCESS" },
{ 9733, "BIG_ENDIAN_CONFIG" },
{ 9734, "CACHE_INVALIDATION_COMPRESSION_MODE" },
{ 9735, "CACHE_INVALIDATION_MASK_0" },
{ 9736, "CACHE_INVALIDATION_MASK_1" },
{ 9737, "CACHE_INVALIDATION_MASK_2" },
{ 9738, "CBOX_CACHEASRAM_CONFIG" },
{ 9739, "CBOX_CACHE_CONFIG" },
{ 9740, "CBOX_HOME_MAP_ADDR" },
{ 9741, "CBOX_HOME_MAP_DATA" },
{ 9742, "CBOX_MMAP_0" },
{ 9743, "CBOX_MMAP_1" },
{ 9744, "CBOX_MMAP_2" },
{ 9745, "CBOX_MMAP_3" },
{ 9746, "CBOX_MSR" },
{ 9747, "DIAG_BCST_CTL" },
{ 9748, "DIAG_BCST_MASK" },
{ 9749, "DIAG_BCST_TRIGGER" },
{ 9750, "DIAG_MUX_CTL" },
{ 9751, "DIAG_TRACE_CTL" },
{ 9752, "DIAG_TRACE_DATA" },
{ 9753, "DIAG_TRACE_STS" },
{ 9754, "IDN_DEMUX_BUF_THRESH" },
{ 9755, "L1_I_PIN_WAY_0" },
{ 9756, "MEM_ROUTE_ORDER" },
{ 9757, "MEM_STRIPE_CONFIG" },
{ 9758, "PERF_COUNT_PLS" },
{ 9759, "PSEUDO_RANDOM_NUMBER_MODIFY" },
{ 9760, "QUIESCE_CTL" },
{ 9761, "RSHIM_COORD" },
{ 9762, "SBOX_CONFIG" },
{ 9763, "UDN_DEMUX_BUF_THRESH" },
{ 9764, "XDN_CORE_STARVATION_COUNT" },
{ 9765, "XDN_ROUND_ROBIN_ARB_CTL" },
{ 9856, "CYCLE_MODIFY" },
{ 9857, "I_AAR" },
{ 9984, "MPL_WORLD_ACCESS_SET_0" },
{ 9985, "MPL_WORLD_ACCESS_SET_1" },
{ 9986, "MPL_WORLD_ACCESS_SET_2" },
{ 9987, "MPL_WORLD_ACCESS_SET_3" },
{ 9988, "MPL_WORLD_ACCESS" },
{ 9989, "DONE" },
{ 9990, "DSTREAM_PF" },
{ 9991, "FAIL" },
{ 9992, "INTERRUPT_CRITICAL_SECTION" },
{ 9993, "PASS" },
{ 9994, "PSEUDO_RANDOM_NUMBER" },
{ 9995, "TILE_COORD" },
{ 9996, "TILE_RTF_HWM" },
{ 10112, "CMPEXCH_VALUE" },
{ 10113, "CYCLE" },
{ 10114, "EVENT_BEGIN" },
{ 10115, "EVENT_END" },
{ 10116, "PROC_STATUS" },
{ 10117, "SIM_CONTROL" },
{ 10118, "SIM_SOCKET" },
{ 10119, "STATUS_SATURATE" },
{ 10240, "MPL_I_ASID_SET_0" },
{ 10241, "MPL_I_ASID_SET_1" },
{ 10242, "MPL_I_ASID_SET_2" },
{ 10243, "MPL_I_ASID_SET_3" },
{ 10244, "MPL_I_ASID" },
{ 10245, "I_ASID" },
{ 10496, "MPL_D_ASID_SET_0" },
{ 10497, "MPL_D_ASID_SET_1" },
{ 10498, "MPL_D_ASID_SET_2" },
{ 10499, "MPL_D_ASID_SET_3" },
{ 10500, "MPL_D_ASID" },
{ 10501, "D_ASID" },
{ 10752, "MPL_DOUBLE_FAULT_SET_0" },
{ 10753, "MPL_DOUBLE_FAULT_SET_1" },
{ 10754, "MPL_DOUBLE_FAULT_SET_2" },
{ 10755, "MPL_DOUBLE_FAULT_SET_3" },
{ 10756, "MPL_DOUBLE_FAULT" },
{ 10757, "LAST_INTERRUPT_REASON" },
};
const int tilegx_num_sprs = 441;
const char *
get_tilegx_spr_name (int num)
{
void *result;
struct tilegx_spr key;
key.number = num;
result = bsearch((const void *) &key, (const void *) tilegx_sprs,
tilegx_num_sprs, sizeof (struct tilegx_spr),
tilegx_spr_compare);
if (result == NULL)
{
return (NULL);
}
else
{
struct tilegx_spr *result_ptr = (struct tilegx_spr *) result;
return (result_ptr->name);
}
}
int
print_insn_tilegx (unsigned char * memaddr)
{
struct tilegx_decoded_instruction
decoded[TILEGX_MAX_INSTRUCTIONS_PER_BUNDLE];
unsigned char opbuf[TILEGX_BUNDLE_SIZE_IN_BYTES];
int i, num_instructions, num_printed;
tilegx_mnemonic padding_mnemonic;
memcpy((void *)opbuf, (void *)memaddr, TILEGX_BUNDLE_SIZE_IN_BYTES);
/* Parse the instructions in the bundle. */
num_instructions =
parse_insn_tilegx (*(unsigned long long *)opbuf, (unsigned long long)memaddr, decoded);
/* Print the instructions in the bundle. */
printf("{ ");
num_printed = 0;
/* Determine which nop opcode is used for padding and should be skipped. */
padding_mnemonic = TILEGX_OPC_FNOP;
for (i = 0; i < num_instructions; i++)
{
if (!decoded[i].opcode->can_bundle)
{
/* Instructions that cannot be bundled are padded out with nops,
rather than fnops. Displaying them is always clutter. */
padding_mnemonic = TILEGX_OPC_NOP;
break;
}
}
for (i = 0; i < num_instructions; i++)
{
const struct tilegx_opcode *opcode = decoded[i].opcode;
const char *name;
int j;
/* Do not print out fnops, unless everything is an fnop, in
which case we will print out just the last one. */
if (opcode->mnemonic == padding_mnemonic
&& (num_printed > 0 || i + 1 < num_instructions))
continue;
if (num_printed > 0)
printf(" ; ");
++num_printed;
name = opcode->name;
if (name == NULL)
name = "<invalid>";
printf("%s", name);
for (j = 0; j < opcode->num_operands; j++)
{
unsigned long long num;
const struct tilegx_operand *op;
const char *spr_name;
if (j > 0)
printf (",");
printf (" ");
num = decoded[i].operand_values[j];
op = decoded[i].operands[j];
switch (op->type)
{
case TILEGX_OP_TYPE_REGISTER:
printf ("%s", tilegx_register_names[(int)num]);
break;
case TILEGX_OP_TYPE_SPR:
spr_name = get_tilegx_spr_name(num);
if (spr_name != NULL)
printf ("%s", spr_name);
else
printf ("%d", (int)num);
break;
case TILEGX_OP_TYPE_IMMEDIATE:
printf ("%d", (int)num);
break;
case TILEGX_OP_TYPE_ADDRESS:
printf ("0x%016llx", num);
break;
default:
abort ();
}
}
}
printf (" }\n");
return TILEGX_BUNDLE_SIZE_IN_BYTES;
}
|
the_stack_data/74330.c | /* PR debug/29609 */
/* Verify that breakpoint on the break is hit. */
/* { dg-do compile } */
/* { dg-options "-O0 -gdwarf -dA" } */
void abort (void);
int
foo (void)
{
int a, i;
for (i = 1; i <= 10; i++)
{
if (i < 3)
a = 1;
else
break;
a = 5;
}
return a;
}
int
main (void)
{
if (foo () != 5)
abort ();
return 0;
}
/* { dg-final { scan-assembler "pr29609-1.c:18" } } */
|
the_stack_data/594867.c | #include <stdlib.h>
#include <stdio.h>
#include <omp.h>
#define ARRAY_LENGTH 1024
int main(int argc, char const *argv[])
{
puts("Welcome!");
puts("Filling array...");
unsigned long int arr[ARRAY_LENGTH] = {0};
for(unsigned long int i = 0; i < ARRAY_LENGTH; ++i) arr[i] = i;
puts("Array filled!");
puts("Coping array...");
unsigned long int newArray[ARRAY_LENGTH] = {0};
omp_set_num_threads(4);
#pragma omp parallel for
for(unsigned long int i = 0; i < ARRAY_LENGTH; ++i) newArray[i] = arr[i];
puts("array copied!");
puts("Displaing array...");
for(unsigned long int i = 0; i<ARRAY_LENGTH; ++i) printf("arr[%li] = %li -> newArray[%li] = %li\n",i,arr[i],i,newArray[i]);
puts("Program finished!");
return 0;
}
|
the_stack_data/150141896.c | /*
* Copyright (c) 2002, Intel Corporation. All rights reserved.
* Created by: rolla.n.selbak REMOVE-THIS AT intel DOT com
* This file is licensed under the GPL license. For the full content
* of this license, see the COPYING file at the top level of this
* source tree.
Test pthread_barrier_t
BAR
*/
#include <pthread.h>
pthread_barrier_t dummy;
|
the_stack_data/212641891.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
char t[30] = "achfdyaotzuyaewqnvfpaurijsgdhb";
char p[];
int forcaBruta (char *t, char *p, int n, int m);
int main (int argc, char** argv) {
int retorno, tamanho;
printf("\nSua biblioteca de pesquisa: ");
printf("%s", t);
printf("\nDigite a busca que dejesa fazer nessa biblioteca: ");
scanf("%s", &p);
tamanho = strlen(p);
retorno = forcaBruta(t, p, 30, tamanho);
if (retorno == -1)
printf("\nRegistro nao encontrado!\n");
else{
printf("\nRegistro encontrado comecando na posicao: %d \n", retorno);
}
return (EXIT_SUCCESS);
}
int forcaBruta (char *t, char *p, int n, int m){
int i, j;
for (i = 0; i <= n-m; i++){
j = 0;
while((j < m) && (t[i+j] == p[j])){
j = j + 1;
if (j == m){
return i;
}
}
}
return -1;
}
|
the_stack_data/161081234.c | /* Copyright (c) 2011 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 project authors may */
/* be found in the AUTHORS file in the root of the source tree. */
static const char* const cfg = "--target=x86-win32-vs12";
const char *vpx_codec_build_config(void) {return cfg;}
|
the_stack_data/1125216.c | /* PR tree-optimization/48739 */
/* { dg-do compile } */
/* { dg-require-effective-target pthread } */
/* { dg-options "-O1 -ftree-parallelize-loops=2 -fno-tree-dominator-opts" } */
extern int g, v[10];
extern void bar (void);
int
foo (int x)
{
int a, b, *c = (int *) 0;
for (a = 0; a < 10; ++a)
{
bar ();
for (b = 0; b < 5; ++b)
{
x = 0;
c = &x;
g = 1;
}
}
*c = x;
for (x = 0; x != 10; x++)
v[x] = x;
return g;
}
|
the_stack_data/1102550.c | /* { dg-do compile { target powerpc*-*-* ia64-*-* i?86-*-* x86_64-*-* } } */
/* { dg-options "-Os -fselective-scheduling2 -fsel-sched-pipelining -fprofile-generate -fno-early-inlining" } */
static void bmp_iter_next (int *bi)
{
*bi >>= 1;
}
int bmp_iter_set (int *, int);
void bitmap_clear (void);
void bitmap_initialize_stat (void);
void df_md_alloc (int bi, int bb_index, int bb_info)
{
for (; bmp_iter_set (&bi, bb_index); bmp_iter_next (&bi))
if (bb_info)
bitmap_clear ();
else
bitmap_initialize_stat ();
}
|
the_stack_data/94676.c | #include<stdio.h>
int main(void){
int value;
scanf("%d",&value);
switch(value){
case 61:
printf("Brasilia\n");
break;
case 71:
printf("Salvador\n");
break;
case 11:
printf("Sao Paulo\n");
break;
case 21:
printf("Rio de Janeiro\n");
break;
case 32:
printf("Juiz de Fora\n");
break;
case 19:
printf("Campinas\n");
break;
case 27:
printf("Vitoria\n");
break;
case 31:
printf("Belo Horizonte\n");
break;
default:
printf("DDD nao cadastrado\n");
break;
}
return 0;
}
|
the_stack_data/13964.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strlen.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: odursun <42istanbul.com.tr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/11/05 18:53:26 by odursun #+# #+# */
/* Updated: 2021/11/05 18:54:23 by odursun ### ########.tr */
/* */
/* ************************************************************************** */
int ft_strlen(char *str)
{
int i;
i = 0;
while (str[i] != '\0')
i++;
return (i);
}
|
the_stack_data/492804.c | int ft_is_prime(int nb);
int ft_find_next_prime(int nb)
{
int aux;
aux = nb;
if (ft_is_prime(nb) == 1)
{
return (nb);
}
if (nb <= 2)
{
return (2);
}
while (aux < nb * 2)
{
if (ft_is_prime(aux) == 1)
{
return (aux);
}
aux++;
}
return (0);
}
int ft_is_prime(int nb)
{
int i;
i = 2;
if (nb == 0 || nb == 1 || nb < 0)
{
return (0);
}
while (i <= nb / 2)
{
if (nb % i == 0)
{
return (0);
}
i++;
}
return (1);
}
|
the_stack_data/155259.c | #include <stdio.h>
#include <math.h>
int main(int argc, char const *argv[])
{
int i, N, count = 0, num = 2, letest = 0, flag;
printf("Enter Nth Number : ");
scanf("%d", &N);
while (count != N)
{
flag = 0;
for (i = 2; i <= num / 2; i++)
{
if (num % i == 0)
{
flag = 1;
break;
}
}
if (flag == 0)
{
count++;
letest = num;
}
num++;
}
printf("%dth prime number is %d ", N, letest);
return 0;
} |
the_stack_data/72013433.c | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
#include <unistd.h>
int main()
{
int n_threads, i;
/*
Schedule allows you to create the scheme with which
the threads distribute the work of an iteration of a cycle.
"static": means that iterations blocks are mapped statically to the
execution threads in a round-robin fashion. The nice thing with static scheduling is that
OpenMP run-time guarantees that if you have two separate loops with the same number
of iterations and execute them with the same number of threads using static scheduling,
*/
#pragma omp parallel for private(i) schedule(static) num_threads(4)
for(i=0; i<16; i++)
{
//wait i second
sleep(i);
printf("The thread %d has completed the iteration %d\n", omp_get_thread_num(), i);
}
printf("All threads have ended!\n");
return 0;
}
|
the_stack_data/6386837.c | #include <stdio.h>
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
char **unique_ids;
int unique_ids_size;
int unique_ids_maxsize;
int cmp(const void *p1, const void *p2)
{
return strcmp(*(char * const *)p1, *(char * const *)p2);
}
/* return 1 if s was not already known, 0 if it was */
int new_unique_id(char *s, char *input_file)
{
if (unique_ids_size)
if (bsearch(&s, unique_ids, unique_ids_size, sizeof(char *), cmp) != NULL) {
printf("error: ID %s is not unique in %s\n", s, input_file);
return 0;
}
if (unique_ids_size == unique_ids_maxsize) {
unique_ids_maxsize += 256;
unique_ids = realloc(unique_ids, unique_ids_maxsize * sizeof(char *));
if (unique_ids == NULL) { printf("erorr: out of memory\n"); abort(); }
}
unique_ids[unique_ids_size] = strdup(s);
if (unique_ids[unique_ids_size] == NULL)
{ printf("erorr: out of memory\n"); abort(); }
unique_ids_size++;
qsort(unique_ids, unique_ids_size, sizeof(char *), cmp);
return 1;
}
char *bufname;
int bufname_size;
int bufname_maxsize;
void putname(int c)
{
if (bufname_size == bufname_maxsize) {
bufname_maxsize += 256;
bufname = realloc(bufname, bufname_maxsize);
if (bufname == NULL)
{ printf("erorr: memory allocation error\n"); exit(1); }
}
bufname[bufname_size] = c;
bufname_size++;
}
char *bufvalue;
int bufvalue_size;
int bufvalue_maxsize;
void putvalue(int c)
{
if (bufvalue_size == bufvalue_maxsize) {
bufvalue_maxsize += 256;
bufvalue = realloc(bufvalue, bufvalue_maxsize);
if (bufvalue == NULL)
{ printf("error: memory allocation error\n"); exit(1); }
}
bufvalue[bufvalue_size] = c;
bufvalue_size++;
}
void smash_spaces(FILE *f)
{
int c;
while (1) {
c = fgetc(f);
if (isspace(c)) continue;
if (c == ' ') continue;
if (c == '\t') continue;
if (c == '\n') continue;
if (c == 10 || c == 13) continue;
if (c == '#') {
while (1) {
c = fgetc(f);
if (c == '\n' || c == EOF) break;
}
continue;
}
break;
}
if (c != EOF) ungetc(c, f);
}
void get_line(FILE *f, char **name, char **value)
{
int c;
bufname_size = 0;
bufvalue_size = 0;
*name = NULL;
*value = NULL;
smash_spaces(f);
c = fgetc(f);
while (!(c == '=' || isspace(c) || c == EOF)) { putname(c); c = fgetc(f); }
if (c == EOF) return;
putname(0);
while (!(c == EOF || c == '=')) c = fgetc(f);
if (c == EOF) return;
smash_spaces(f);
c = fgetc(f);
while (!(c == 10 || c == 13 || c == EOF)) { putvalue(c); c = fgetc(f); }
putvalue(0);
if (bufname_size <= 1) return;
if (bufvalue_size <= 1) return;
*name = bufname;
*value = bufvalue;
}
int main(int n, char **v)
{
FILE *in;
FILE *out;
char *name;
char *value;
char *in_name;
char *out_name;
if (n != 3) { printf("error: gimme <source> <dest>\n"); exit(1); }
n = 0;
in_name = v[1];
out_name = v[2];
in = fopen(in_name, "r"); if (in == NULL) { perror(in_name); exit(1); }
out = fopen(out_name, "w"); if (out == NULL) { perror(out_name); exit(1); }
fprintf(out, "/* generated file, do not edit by hand */\n\n");
while (1) {
get_line(in, &name, &value);
if (name == NULL) break;
if (isspace(value[strlen(value)-1])) {
printf("error: bad value '%s' (no space at the end please!)\n", value);
unlink(out_name);
exit(1);
}
if (!strcmp(name, "ID")) {
if (!new_unique_id(value, in_name)) { unlink(out_name); exit(1); }
fprintf(out, "#define T_%s T_ID(%d)\n", value, n);
n++;
}
}
fprintf(out, "#define T_NUMBER_OF_IDS %d\n", n);
fclose(in);
fclose(out);
return 0;
}
|
the_stack_data/4567.c | #include <stdio.h>
int main()
{
int n;
scanf("%d", &n);
int ors = 1, oct = 0, osp = 0;
int nrs, nct, nsp;
while (n--)
{
int k;
scanf("%d", &k);
int min = ors;
if ((k & 1) && min > oct) min = oct;
if ((k & 2) && min > osp) min = osp;
nrs = min+1;
min = ors;
if ((k & 2) && min > osp) min = osp;
nct = min;
min = ors;
if ((k & 1) && min > oct) min = oct;
nsp = min;
ors ^= nrs; nrs ^= ors; ors ^= nrs;
oct ^= nct; nct ^= oct; oct ^= nct;
osp ^= nsp; nsp ^= osp; osp ^= nsp;
}
int min = ors;
if (min > oct) min = oct;
if (min > osp) min = osp;
printf("%d\n", min);
}
|
the_stack_data/899241.c | #include <stdio.h>
int main() {
char* chPt = "hgfedcba"; // char chPt[3] = {'c','b','a'};
long chPt2Int = (int) chPt; //convertion loss
int lett = (int) *chPt;
int x = (int) *((int*)chPt);
int y = (int) *((int*)chPt + 1);
printf("chPt = %p \n",chPt);
printf("chPt2Int = %p \n",chPt2Int);
printf("lett = %p ('%c') \n",lett,lett);
printf("x = %p \n", x);
printf("y = %p \n\n", y);
printf("size of a char: %ld bytes \n",sizeof(char));
printf("size of an int: %ld bytes \n",sizeof(int));
printf("size of a double: %ld bytes \n\n",sizeof(double));
printf("size of a char*: %ld bytes \n",sizeof(char*));
printf("size of an int*: %ld bytes \n",sizeof(int*));
printf("size of a double*: %ld bytes \n",sizeof(double*));
return 0;
}
|
the_stack_data/203132.c | void
out( char c ) {
*((char*) 0x20000) = c;
}
//#include <stdio.h>
//#define out( c ) putchar( c )
void
print( char* s ) {
while (*s)
out( *s++ );
}
void
println() {
out( '\n' );
}
char*
bin2str( long n, int radix, char* buf ) {
char digits[] = "0123456789ABCDEF";
char* p = &buf[33];
long quo = n;
if (n < 0)
quo = -quo;
*p-- = 0;
while (quo >= radix) {
*p-- = digits[(quo%radix)];
quo /= radix;
}
*p = digits[quo];
if (n < 0)
*--p = '-';
return p;
}
void
printn( long n ) {
char buf[34];
char* s = bin2str( n, 16, buf );
print( s );
}
long
abs( long x ) {
const long bit31 = x >> 63;
return (x ^ bit31) - bit31;
}
long
modifyBit( long x, unsigned char position, long newState ) {
long mask = 1l << position;
long state = newState;
return (x & ~mask) | (-state & mask);
}
long
flipBit( long x, unsigned char position ) {
long mask = 1l << position;
return x ^ mask;
}
long
isNegative( long n ) {
return (long)((unsigned long) n >> 63);
}
int
bit( long x, int n ) {
return (x >> n)&1;
}
void
main() {
printn( abs(5) );
print( ", " );
printn( abs(0) );
print( ", " );
printn( abs(-5) );
println();
printn( modifyBit(0, 5, 0) );//0
print( ", " );
printn( modifyBit(0, 5, 1) );//0x20
print( ", " );
printn( modifyBit(0x77, 5, 0) );//0x57
print( ", " );
printn( modifyBit(0x77, 5, 1) );//0x77
println();
printn( flipBit(0, 5) );//20
print( ", " );
printn( flipBit(0x77, 5) );//57
println();
printn( isNegative(0) );
print( ", " );
printn( isNegative(-5) );
println();
printn( bit(5, 2) );
print( ", " );
printn( bit(5, 1) );
println();
} |
the_stack_data/879707.c | #include <stdio.h>
int main(void);
int main(void) {
/* regular int varliable with initial value */
int value = 0x1000;
/* int pointer variable, pointing to value */
int *pointer = &value;
printf("value: 0x%x at address %p\n", value, &value);
printf("pointer: %p at address %p\n", pointer, &pointer);
printf("*pointer: 0x%x at address %p\n", *pointer, pointer);
return 0;
}
|
the_stack_data/165766347.c | int f(int);
int f(int);
int f(int x) { return 0; }
int g;
int g;
int g = 1;
|
the_stack_data/57949504.c | //file: _insn_test_mul_hs_ls_X0.c
//op=157
#include <stdio.h>
#include <stdlib.h>
void func_exit(void) {
printf("%s\n", __func__);
exit(0);
}
void func_call(void) {
printf("%s\n", __func__);
exit(0);
}
unsigned long mem[2] = { 0xc2cac20f9054ab64, 0xc57bfb2ed874d267 };
int main(void) {
unsigned long a[4] = { 0, 0 };
asm __volatile__ (
"moveli r22, 30145\n"
"shl16insli r22, r22, 20983\n"
"shl16insli r22, r22, 7997\n"
"shl16insli r22, r22, -21347\n"
"moveli r0, 3083\n"
"shl16insli r0, r0, -6125\n"
"shl16insli r0, r0, -10642\n"
"shl16insli r0, r0, 872\n"
"moveli r19, -14850\n"
"shl16insli r19, r19, -32360\n"
"shl16insli r19, r19, 12889\n"
"shl16insli r19, r19, 3288\n"
"{ mul_hs_ls r22, r0, r19 ; fnop }\n"
"move %0, r22\n"
"move %1, r0\n"
"move %2, r19\n"
:"=r"(a[0]),"=r"(a[1]),"=r"(a[2]));
printf("%016lx\n", a[0]);
printf("%016lx\n", a[1]);
printf("%016lx\n", a[2]);
return 0;
}
|
the_stack_data/70449003.c | /*-------------------------------------------------------------
stm.c - System and miscellaneous hardware control functions
Copyright (C) 2008
Michael Wiedenbauer (shagkur)
Dave Murphy (WinterMute)
Hector Martin (marcan)
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any
damages arising from the use of this software.
Permission is granted to anyone to use this software for any
purpose, including commercial applications, and to alter it and
redistribute it freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you
must not claim that you wrote the original software. If you use
this software in a product, an acknowledgment in the product
documentation would be appreciated but is not required.
2. Altered source versions must be plainly marked as such, and
must not be misrepresented as being the original software.
3. This notice may not be removed or altered from any source
distribution.
-------------------------------------------------------------*/
#if defined(HW_RVL)
#include <stdio.h>
#include "ipc.h"
#include "system.h"
#include "asm.h"
#include "processor.h"
#include "stm.h"
//#define DEBUG_STM
#define IOCTL_STM_EVENTHOOK 0x1000
#define IOCTL_STM_GET_IDLEMODE 0x3001
#define IOCTL_STM_RELEASE_EH 0x3002
#define IOCTL_STM_HOTRESET 0x2001
#define IOCTL_STM_HOTRESET_FOR_PD 0x2002
#define IOCTL_STM_SHUTDOWN 0x2003
#define IOCTL_STM_IDLE 0x2004
#define IOCTL_STM_WAKEUP 0x2005
#define IOCTL_STM_VIDIMMING 0x5001
#define IOCTL_STM_LEDFLASH 0x6001
#define IOCTL_STM_LEDMODE 0x6002
#define IOCTL_STM_READVER 0x7001
#define IOCTL_STM_READDDRREG 0x4001
#define IOCTL_STM_READDDRREG2 0x4002
static s32 __stm_eh_fd = -1;
static s32 __stm_imm_fd = -1;
static u32 __stm_vdinuse = 0;
static u32 __stm_initialized= 0;
static u32 __stm_ehregistered= 0;
static u32 __stm_ehclear= 0;
static u32 __stm_ehbufin[0x08] ATTRIBUTE_ALIGN(32) = {0,0,0,0,0,0,0,0};
static u32 __stm_ehbufout[0x08] ATTRIBUTE_ALIGN(32) = {0,0,0,0,0,0,0,0};
static u32 __stm_immbufin[0x08] ATTRIBUTE_ALIGN(32) = {0,0,0,0,0,0,0,0};
static u32 __stm_immbufout[0x08] ATTRIBUTE_ALIGN(32) = {0,0,0,0,0,0,0,0};
static char __stm_eh_fs[] ATTRIBUTE_ALIGN(32) = "/dev/stm/eventhook";
static char __stm_imm_fs[] ATTRIBUTE_ALIGN(32) = "/dev/stm/immediate";
s32 __STM_SetEventHook();
s32 __STM_ReleaseEventHook();
static s32 __STMEventHandler(s32 result,void *usrdata);
stmcallback __stm_eventcb = NULL;
static vu16* const _viReg = (u16*)0xCC002000;
s32 __STM_Init()
{
if(__stm_initialized==1) return 1;
#ifdef DEBUG_STM
printf("STM Init\n");
#endif
__stm_vdinuse = 0;
__stm_imm_fd = IOS_Open(__stm_imm_fs,0);
if(__stm_imm_fd<0) return 0;
__stm_eh_fd = IOS_Open(__stm_eh_fs,0);
if(__stm_eh_fd<0) return 0;
#ifdef DEBUG_STM
printf("STM FDs: %d, %d\n",__stm_imm_fd, __stm_eh_fd);
#endif
__stm_initialized = 1;
__STM_SetEventHook();
return 1;
}
s32 __STM_Close()
{
s32 res;
s32 ret = 0;
__STM_ReleaseEventHook();
if(__stm_imm_fd >= 0) {
res = IOS_Close(__stm_imm_fd);
if(res < 0) ret = res;
__stm_imm_fd = -1;
}
if(__stm_eh_fd >= 0) {
res = IOS_Close(__stm_eh_fd);
if(res < 0) ret = res;
__stm_eh_fd = -1;
}
__stm_initialized = 0;
return ret;
}
s32 __STM_SetEventHook()
{
s32 ret;
u32 level;
if(__stm_initialized==0) return STM_ENOTINIT;
__stm_ehclear = 0;
_CPU_ISR_Disable(level);
ret = IOS_IoctlAsync(__stm_eh_fd,IOCTL_STM_EVENTHOOK,__stm_ehbufin,0x20,__stm_ehbufout,0x20,__STMEventHandler,NULL);
if(ret<0) __stm_ehregistered = 0;
else __stm_ehregistered = 1;
_CPU_ISR_Restore(level);
return ret;
}
s32 __STM_ReleaseEventHook()
{
s32 ret;
if(__stm_initialized==0) return STM_ENOTINIT;
if(__stm_ehregistered==0) return STM_ENOHANDLER;
__stm_ehclear = 1;
ret = IOS_Ioctl(__stm_imm_fd,IOCTL_STM_RELEASE_EH,__stm_immbufin,0x20,__stm_immbufout,0x20);
if(ret>=0) __stm_ehregistered = 0;
return ret;
}
static s32 __STMEventHandler(s32 result,void *usrdata)
{
__stm_ehregistered = 0;
if(result < 0) { // shouldn't happen
return result;
}
#ifdef DEBUG_STM
printf("STM Event: %08x\n",__stm_ehbufout[0]);
#endif
if(__stm_ehclear) { //release
return 0;
}
if(__stm_eventcb) {
__stm_eventcb(__stm_ehbufout[0]);
}
__STM_SetEventHook();
return 0;
}
stmcallback STM_RegisterEventHandler(stmcallback newhandler)
{
stmcallback old;
old = __stm_eventcb;
__stm_eventcb = newhandler;
return old;
}
s32 STM_ShutdownToStandby()
{
int res;
_viReg[1] = 0;
if(__stm_initialized==0) {
#ifdef DEBUG_STM
printf("STM notinited\n");
#endif
return STM_ENOTINIT;
}
__stm_immbufin[0] = 0;
res= IOS_Ioctl(__stm_imm_fd,IOCTL_STM_SHUTDOWN,__stm_immbufin,0x20,__stm_immbufout,0x20);
if(res<0) {
#ifdef DEBUG_STM
printf("STM STBY failed: %d\n",res);
#endif
}
return res;
}
s32 STM_ShutdownToIdle()
{
int res;
_viReg[1] = 0;
if(__stm_initialized==0) {
#ifdef DEBUG_STM
printf("STM notinited\n");
#endif
return STM_ENOTINIT;
}
switch(SYS_GetHollywoodRevision()) {
case 0:
case 1:
case 2:
__stm_immbufin[0] = 0xFCA08280;
default:
__stm_immbufin[0] = 0xFCE082C0;
}
res= IOS_Ioctl(__stm_imm_fd,IOCTL_STM_IDLE,__stm_immbufin,0x20,__stm_immbufout,0x20);
if(res<0) {
#ifdef DEBUG_STM
printf("STM IDLE failed: %d\n",res);
#endif
}
return res;
}
s32 STM_SetLedMode(u32 mode)
{
int res;
if(__stm_initialized==0) {
#ifdef DEBUG_STM
printf("STM notinited\n");
#endif
return STM_ENOTINIT;
}
__stm_immbufin[0] = mode;
res= IOS_Ioctl(__stm_imm_fd,IOCTL_STM_LEDMODE,__stm_immbufin,0x20,__stm_immbufout,0x20);
if(res<0) {
#ifdef DEBUG_STM
printf("STM LEDMODE failed: %d\n",res);
#endif
}
return res;
}
s32 STM_RebootSystem()
{
int res;
_viReg[1] = 0;
if(__stm_initialized==0) {
#ifdef DEBUG_STM
printf("STM notinited\n");
#endif
return STM_ENOTINIT;
}
__stm_immbufin[0] = 0;
res= IOS_Ioctl(__stm_imm_fd,IOCTL_STM_HOTRESET,__stm_immbufin,0x20,__stm_immbufout,0x20);
if(res<0) {
#ifdef DEBUG_STM
printf("STM HRST failed: %d\n",res);
#endif
}
return res;
}
#endif /* defined(HW_RVL) */
|
the_stack_data/122957.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <locale.h>
//1
int main(){
setlocale(LC_ALL,"");
char string[100];
gets(string);
printf("Gets: %s",string);
return 0;
}
|
the_stack_data/173579466.c |
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <dirent.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
// 打包
// ./tar dir dstfile
// 解包
// ./tar dstfile
//
// /home/xueguoliang/aaa
// /home/xueguoliang/aaa/bbb/ccc.c
void tarfile(const char* root, const char* filepath, FILE* fp)
{
// 将文件名写入，将文件的尺寸写入
fprintf(fp, "%s\n", filepath+strlen(root));
// 将文件尺寸写入
struct stat stat_buf;
stat(filepath, &stat_buf);
fprintf(fp, "%d\n", (int)stat_buf.st_size);
// 将文件内容写入
FILE* f = fopen(filepath, "r");
char buf[4096];
while(1)
{
int ret = fread(buf, 1, sizeof(buf), f);
if(ret <= 0) break;
fwrite(buf, ret, 1, fp);
}
}
void tardir(const char* root, const char* dirpath, FILE* fp)
{
DIR* dir = opendir(dirpath);
struct dirent* entry = NULL;
while(1)
{
entry = readdir(dir);
if(entry == NULL)
return;
if(strcmp(entry->d_name, ".") == 0 ||
strcmp(entry->d_name, "..") == 0)
continue;
char path[1024];
sprintf(path, "%s/%s", dirpath, entry->d_name);
if(entry->d_type == DT_DIR)
{
tardir(root, path, fp);
}
else if(entry->d_type == DT_REG)
{
tarfile(root, path, fp);
}
}
closedir(dir);
}
// ./a.out ./test aaa
void tar(const char* dir, const char* dst)
{
// 打包前的准备工作：将目标路径转成FILE*
FILE* fp = fopen(dst, "w");
if(fp == NULL)
{
printf("open dst file error\n");
return;
}
// 将根目录的名字写入打包文件
const char* name = rindex(dir, '/');
if(name == NULL) name = dir;
fprintf(fp, "%s\n", name);
// 打包目录
tardir(dir, dir, fp);
fclose(fp);
}
void untar(const char* file)
{
// 获取第一行，创建目录
}
int main(int argc, char* argv[])
{
if(argc == 3) // 打包
{
tar(argv[1], argv[2]);
}
else if(argc == 2) // 解包
{
untar(argv[1]);
}
else
{
printf("argument error\n");
}
return 0;
}
|
the_stack_data/90766292.c | #include <stdio.h>
int main()
{
/********************整数********************
* 基本整型：int【10位整数，-2147483648 ~ 2147483648（-2^31 ~ 2^31），4字节】 * 无符号基本整型【（0 ~ 2^32 - 1），4字节】
* 短整型：short int【5位整数，-32768 ~ 32768（-2^15 ~ 2^15），2字节】（数字后加l或L）
* 长整型：long int【10位整数，-2147483648 ~ 2147483648（-2^31 ~ 2^31），4字节】（数字后加l或L）
* 十进制：一般数字写法
* 八进制：数字前加0
* 十六进制：数字前加x（或者X、0x、0X）
********************************************/
int i = 88; //初始化整型变量i为十进制数88；
int j = 0130; //初始化整型变量j为八进制数130；
unsigned int ui = - 9; //无符号基本整型
int iu = - 9U;
short int s = 12345; //短整型
long int l = 123456789; //长整型
printf("基本整型 i = %d（十进制） = %o（八进制） = %x（十六进制）,\n八进制整型 j = %o = %d = %0x\n", i, i, i, j, j, j);
printf("ui = %d, iu = %d\n", ui, iu);
printf("s = %d, l = %ld\n", s, l);
/********************实数********************
* 单精度浮点型:：float【保证6位有效数字（3.4 x 10^-38 ~ 3.4 x 10^38），4字节】（数字后加f或F）
* 双精度浮点型：double【保证15位有效数字（1.7 x 10^-308 ~ 1.7 x 10^308），8字节】
********************************************/
float f = 2.123456; //初始化单精度浮点型变量f
double d = 2.123456789; //初始化双精度浮点型变量d
float x = 3.14159e5; //科学计数法表示浮点数
printf("f = %.6f\nd = %.10f\n", f, d); //输出f和d小数点后9位的值
printf("x = %f\n", x);
/********************字符********************
* ASCII码（ASCII字符集）规定了字符和整数值的对应关系，它规定具体某字符用哪个整数值表示
* 【1字节】
********************************************/
char ch = 'A'; //字符型
//单个字符型数据要用单引号括起来
int zs = 66;
printf("%c, %d\n", ch, ch); //分别以字符格式和整数格式输出变量ch的值
printf("%d, %c\n", zs, zs); //分别以整数格式和字符格式输出变量zs的值
return 0;
}
/********************************
* 格式控制符
%d 十进制整型格式
%ld 十进制长整型格式
%o 八进制整型格式
%x, %0x, %0X, %#x, %#X 十六进制整型格式
%f 浮点型格式
%.9f 保留小数点后9位浮点型格式
%c 字符型格式
%s 字符串
* 存储空间大小
位：bit
字节：Byte
1Byte = 2^3bit = 8bit
1K = 2^10Byte = 1024Byte
1M = 2^10K = 1024K
1G = 2^10M = 1024M
1T = 2^10G = 1024G
********************************/
|
the_stack_data/48576191.c | int main() {
// variable declarations
int i;
int n;
int sn;
int v1;
int v2;
int v3;
// pre-conditions
(sn = 0);
(i = 1);
assume(n >= 1);
// loop body
while ((i <= n)) {
{
(i = (i + 1));
(sn = (sn + 1));
}
}
// post-condition
if ( (sn != n) )
assert( (sn == 0) );
}
|
the_stack_data/153267035.c | int ft_is_prime(int nb)
{
long int div;
if (nb <= 1)
return (0);
if (nb % 2 == 0 && nb != 2)
return (0);
div = 3;
while (div * div <= nb)
{
if (nb % div == 0)
return (0);
div += 2;
}
return (1);
}
|
the_stack_data/82951543.c | //
// Sample Code:
//
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//#define DEBUG_CORRECTNESS
void pre_Initializing_Input_Tensors();
void post_Correctness();
//
//# abcdef-gdac-efgb
//t3 [a,16,b,16,c,16,d,16,e,16,f,16] += sum(g,16) * t2 [g,d,a,c] * v2 [e,f,g,b];
//
int main(int argc, char** argv)
{
// for sd2
float *host_C, *host_C_chk;
float *host_A;
float *host_B;
int size_idx_a, size_idx_b, size_idx_c, size_idx_d, size_idx_e, size_idx_f, size_idx_g;
// Problem Size
size_idx_a = 16;
size_idx_b = 16;
size_idx_c = 16;
size_idx_d = 16;
size_idx_e = 16;
size_idx_f = 16;
size_idx_g = 16;
//
if (argc == 8)
{
size_idx_a = atoi(argv[1]);
size_idx_b = atoi(argv[2]);
size_idx_c = atoi(argv[3]);
size_idx_d = atoi(argv[4]);
size_idx_e = atoi(argv[5]);
size_idx_f = atoi(argv[6]);
size_idx_g = atoi(argv[7]);
}
int size_C;
int size_A;
int size_B;
int size_internal;
//# abcdef-gdac-efgb
//t3 [a,16,b,16,c,16,d,16,e,16,f,16] += sum(g,16) * t2 [g,d,a,c] * v2 [e,f,g,b];
size_internal = size_idx_g;
size_C = size_idx_a * size_idx_b * size_idx_c * size_idx_d * size_idx_e * size_idx_f;
size_A = size_idx_g * size_idx_d * size_idx_a * size_idx_c;
size_B = size_idx_e * size_idx_f * size_idx_g * size_idx_b;
//
host_C = (float*)malloc(sizeof(float) * size_C);
host_C_chk = (float*)malloc(sizeof(float) * size_C);
host_A = (float*)malloc(sizeof(float) * size_A);
host_B = (float*)malloc(sizeof(float) * size_B);
printf ("==========================================================================================================\n");
printf (">>> abcdef-gdac-efgb\n");
printf (">>> t3 [a,16,b,16,c,16,d,16,e,16,f,16] += sum(g,16) * t2 [g,d,a,c] * v2 [e,f,g,b];\n");
printf (">>> Problem Size (a,b,c,d,e,f) and (g): (%2d,%2d,%2d,%2d,%2d,%2d) and (%2d)\n", size_idx_a, size_idx_b, size_idx_c, size_idx_d, size_idx_e, size_idx_f, size_idx_g);
printf ("==========================================================================================================\n");
//
// Initialze "1" Output and "2 x 9" Inputs
pre_Initializing_Input_Tensors(host_C, host_C_chk, size_C, host_A, size_A, host_B, size_B);
// Run the Kernels
sd_t_d2_fusion_(size_idx_a, size_idx_b, size_idx_c, size_idx_d, size_idx_e, size_idx_f, size_idx_g, host_C, host_A, host_B, 1, -1);
#ifdef DEBUG_CORRECTNESS
// Correctness-Check
post_Correctness(host_C, host_C_chk, host_A, host_B, size_idx_a, size_idx_b, size_idx_c, size_idx_d, size_idx_e, size_idx_f, size_idx_g);
#endif
// Free
free(host_C); free(host_C_chk);
free(host_A);
free(host_B);
return 0;
}
// Initialize t3 (t3_temp), 9 t2 and 9 v2.
void pre_Initializing_Input_Tensors(float* h_C, float* h_C_chk, int size_C, float* h_A, int size_A, float* h_B, int size_B)
{
// t3
int i, j;
for (i = 0; i < size_C; i++)
{
h_C[i] = 0.0;
h_C_chk[i] = 0.0;
}
for (j = 0; j < size_A; j++)
{
h_A[j] = ((float)rand() / RAND_MAX);
}
for (j = 0; j < size_B; j++)
{
h_B[j] = ((float)rand() / RAND_MAX);
}
}
//
void post_Correctness(float* h_C, float* h_C_chk, float* h_A, float* h_B, int size_idx_a, int size_idx_b, int size_idx_c, int size_idx_d, int size_idx_e, int size_idx_f, int size_idx_g)
{
//# abcdef-gdac-efgb
//t3 [a,16,b,16,c,16,d,16,e,16,f,16] += sum(g,16) * t2 [g,d,a,c] * v2 [e,f,g,b];
int size_C = size_idx_a * size_idx_b * size_idx_c * size_idx_d * size_idx_e * size_idx_f;
long long int tmp_ops = 0;
int ops = 0;
int idx_a, idx_b, idx_c, idx_d, idx_e, idx_f, idx_g;
for (idx_a = 0; idx_a < size_idx_a; idx_a++)
for (idx_b = 0; idx_b < size_idx_b; idx_b++)
for (idx_c = 0; idx_c < size_idx_c; idx_c++)
for (idx_d = 0; idx_d < size_idx_d; idx_d++)
for (idx_e = 0; idx_e < size_idx_e; idx_e++)
for (idx_f = 0; idx_f < size_idx_f; idx_f++)
{
ops = 0;
for (idx_g = 0; idx_g < size_idx_g; idx_g++)
{
int tmp_r_idx = idx_a + (idx_b + (idx_c + (idx_d + (idx_e + (idx_f) * size_idx_e) * size_idx_d) * size_idx_c) * size_idx_b) * size_idx_a;
h_C_chk[tmp_r_idx] += h_A[idx_g + (idx_d + (idx_a + (idx_c) * size_idx_a) * size_idx_d) * size_idx_g] *
h_B[idx_e + (idx_f + (idx_g + (idx_b) * size_idx_g) * size_idx_f) * size_idx_e];
ops++;
}
tmp_ops = tmp_ops + ops;
}
printf ("======================================= Correctness Check ==========================================\n");
float epsilon = 0.00001;
int diff = 0;
int same = 0;
int i;
for (i = 0; i < size_C; i++)
{
float check = h_C_chk[i] - h_C[i];
if (check < 0) check *= -1;
if (check > epsilon)
{
diff++;
if (diff < 8)
printf ("Index: %5d, (Host) %8.4f, (Dev.) %8.4f >> (Diff.) %8.4f\n", i, h_C_chk[i], h_C[i], check);
}
else
{
same++;
}
}
printf (" >>> PASSED: %'10d among %'10d in t3\n", same, size_C);
printf (" >>> ERROR : %'10d among %'10d in t3\n", diff, size_C);
printf (" >>> Total Operations: %'lld\n", tmp_ops);
printf ("====================================================================================================\n");
}
|
the_stack_data/120404.c | int main() {
return 2000;
} |
the_stack_data/184519038.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct Bnode{ //二叉树的节点
char data0[15];
struct Bnode *Lchild,*Rchild;
}BTnode,*BTptr;
typedef struct node{ //栈的节点
BTptr bt;
struct node *next;
}snode,*slink;
BTptr Insert(BTptr BT,BTptr S)
{
BTptr q,p;
p=BT;
q=NULL;
while(p)
{
q=p;
if(strcmp(S->data0,p->data0)==0)
{
free(S);
return(BT); //承接
}
if(strcmp(S->data0,p->data0)<0)
p=p->Lchild;
else
p=p->Rchild;
}
if(strcmp(S->data0,q->data0)<0)
q->Lchild=S;
else
q->Rchild=S;
return(BT);
}
BTptr Create(){
char ch[15];
BTptr p,BT;
gets(ch);
BT = (BTptr)malloc(sizeof(BTnode));
strcpy(BT->data0,ch);
BT->Lchild=BT->Rchild=NULL;
gets(ch);
while(ch[0]!='#')
{
p=(BTptr)malloc(sizeof(BTnode));
strcpy(p->data0,ch);
p->Lchild=p->Rchild=NULL;
BT=Insert(BT,p);
gets(ch);
}
return BT;
}
int EmptyStack(slink S)//这里用S无需改动S中的值，下面需用引用赋值；
{
if(S==NULL)return(1);
else return(0);
}
BTptr Pop(slink*top)
{
BTptr e;
slink p;
e=(*top)->bt;
p=*top;*top=(*top)->next;
free(p);return(e);
}
void Push(slink*top,BTptr e)
{
slink p;
p=(slink)malloc(sizeof(snode));
p->bt=e;
p->next=*top;
*top=p;
}
void shuchu(BTptr BT)
{
slink S=NULL;
BTptr p;
p=BT;
while(1)
{
while(p)
{
Push(&S,p);
p=p->Lchild;
}
if(EmptyStack(S))break;
p=Pop(&S);
printf("%s\t",p->data0);
p=p->Rchild;
}
}
int main()
{
int y;
do
{
BTptr BT;
BT=Create();
shuchu(BT);
printf("\n测试下一个语句请按1,退出程序请按0\n");
scanf("%d",&y);
}while(y==1);
return 0;
}
|
the_stack_data/107342.c | // send ARP request or UDP message using raw socket
#include <stddef.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <sys/types.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <sys/stat.h>
#include <unistd.h>
#include <errno.h>
#include <fcntl.h>
#include <linux/if.h>
#include <linux/if_packet.h>
#include <linux/if_arp.h>
#include <linux/if_tun.h>
#include <linux/sockios.h>
#include <linux/ethtool.h>
#include <net/ethernet.h>
#include <arpa/inet.h>
#include <sys/time.h>
#include <netdb.h>
int open_ethif(const char *ifname)
{
struct ifreq ifr;
struct sockaddr_ll sll;
struct packet_mreq mreq;
int flags;
int sock;
int ifindex;
if((sock = socket(AF_PACKET, SOCK_RAW, htons(ETH_P_ALL))) < 0) {
perror("socket");
goto fail;
}
memset(&ifr, 0, sizeof ifr);
snprintf(ifr.ifr_name, sizeof ifr.ifr_name, "%s", ifname);
if (ioctl(sock, SIOCGIFINDEX, &ifr) < 0) {
perror("ioctl(SIOCGIFINDEX)");
goto fail;
}
ifindex = ifr.ifr_ifindex;
if (ioctl(sock, SIOCGIFHWADDR, &ifr) < 0) {
perror("ioctl(SIOCGIFHWADDR)");
goto fail;
}
if (ifr.ifr_hwaddr.sa_family != ARPHRD_ETHER &&
ifr.ifr_hwaddr.sa_family != ARPHRD_LOOPBACK) {
printf("%s: not an ethernet interface", ifname);
goto fail;
}
if (IFHWADDRLEN != 6) {
printf("%s: bad hardware address length", ifname);
goto fail;
}
if (ioctl(sock, SIOCGIFMTU, &ifr) < 0) {
perror("ioctl(SIOCGIFMTU)");
goto fail;
}
memset(&sll, 0, sizeof sll);
sll.sll_family = AF_PACKET;
sll.sll_ifindex = ifindex;
if (bind(sock, (void *)&sll, sizeof sll) < 0) {
perror("bind");
goto fail;
}
/* enable promiscuous reception */
memset(&mreq, 0, sizeof mreq);
mreq.mr_ifindex = ifindex;
mreq.mr_type = PACKET_MR_PROMISC;
if (setsockopt(sock, SOL_PACKET, PACKET_ADD_MEMBERSHIP, &mreq, sizeof mreq) < 0) {
perror("setsockopt");
goto fail;
}
return sock;
fail:
close(sock);
return -1;
}
void usage()
{
printf("Usage:\n");
printf(" raw iface ip -a send ARP request\n");
printf(" raw iface ip -u send UDP message\n");
exit(1);
}
int getmac(const char *ifn,uint8_t *mac,uint8_t *ip)
{
uint8_t six0[6] = {0};
uint8_t loip[4] = {0x7f,0,0,1};
struct ifreq s;
int fd = socket(PF_INET, SOCK_DGRAM, IPPROTO_IP);
strcpy(s.ifr_name, ifn);
if (ioctl(fd, SIOCGIFHWADDR, &s)) {
return -1;
}
memcpy(mac, s.ifr_addr.sa_data, 6);
memcpy(ip, &((struct sockaddr_in *)&s.ifr_addr)->sin_addr, 4);
if(memcmp(mac,six0,6) == 0) {
memcpy(ip,loip,4);
}
return 0;
}
int build_arp(uint8_t *arp,uint8_t *ip,uint8_t *mac,uint8_t *trg_ip)
{
memset(arp,0xff,6);
memcpy(arp+6,mac,6);
arp[12] = 8; arp[13] = 6;
arp[14] = 0; arp[15] = 1;
arp[16] = 8; arp[17] = 0;
arp[18] = 6; arp[19] = 4;
arp[20] = 0; arp[21] = 1;
memcpy(arp+22,mac,6);
memcpy(arp+28,ip,4);
memset(arp+32,0,6);
memcpy(arp+38,trg_ip,4);
return 42;
}
uint16_t calc_cs(uint8_t *buf)
{
uint32_t cs = 0;
for(int i=0; i < 10; i++) {
uint16_t v = (buf[2*i] << 8) + buf[2*i+1];
cs += v;
}
uint16_t ov = (cs >> 16) & 0xffff;
cs += ov;
return ~cs & 0xffff;
}
void check_cs(uint8_t *buf)
{
uint32_t cs = 0;
for(int i=0; i < 10; i++) {
uint16_t v = (buf[2*i] << 8) + buf[2*i+1];
cs += v;
}
uint16_t ov = (cs >> 16) & 0xffff;
cs += ov;
cs = ~cs & 0xffff;
printf("cs = %04x\n",cs);
}
void build_ip(uint8_t *buf,uint8_t *ip,uint8_t *trg_ip,int len)
{
uint16_t cs = 0;
uint16_t id = 0x8397;
len += 20;
buf[0] = 0x45;
buf[1] = 0;
buf[2] = (len >> 8) & 0xff;
buf[3] = len;
buf[4] = (id >> 8) & 0xff;
buf[5] = id & 0xff;
buf[6] = 0x40;
buf[7] = 0; //flags
buf[8] = 0x40; // ttl
buf[9] = 0x11; // udp
buf[10] = (cs >> 8) & 0xff;
buf[11] = cs & 0xff;
memcpy(buf+12,ip,4);
memcpy(buf+16,trg_ip,4);
cs = calc_cs(buf);
buf[10] = (cs >> 8) & 0xff;
buf[11] = cs & 0xff;
check_cs(buf);
}
uint16_t udp_checksum(const void *buff,size_t len)
{
const uint16_t *buf=buff;
uint16_t *ip_src=(uint16_t *)(buf-4), *ip_dst=(uint16_t *)(buf-2);
uint32_t sum;
size_t length=len;
// Calculate the sum
sum = 0;
while (len > 1) {
sum += *buf++;
if (sum & 0x80000000)
sum = (sum & 0xFFFF) + (sum >> 16);
len -= 2;
}
if ( len & 1 ) // Add the padding if the packet lenght is odd
sum += *((uint8_t *)buf);
// Add the pseudo-header
sum += *(ip_src++);
sum += *ip_src;
sum += *(ip_dst++);
sum += *ip_dst;
sum += htons(IPPROTO_UDP);
sum += htons(length);
while (sum >> 16)
sum = (sum & 0xFFFF) + (sum >> 16);
return (uint16_t)(~sum);
}
#define SRC_PORT 43966
#define DST_PORT 8080
char udata[] = "Hello Network!";
int build_udp(uint8_t *buf,uint8_t *ip,uint8_t *mac,uint8_t *trg_ip)
{
int dlen = strlen(udata)+1;
int ulen = dlen+8;
int cs = 0;
// memset(buf,0xff,6);
memset(buf,0,6);
memcpy(buf+6,mac,6);
// memset(buf+6,0,6);
buf[12] = 8;
buf[13] = 0;
build_ip(buf+14,ip,trg_ip,ulen);
uint8_t *p = buf+14+20;
p[0] = (SRC_PORT >> 8) & 0xff; p[1] = SRC_PORT & 0xff;
p[2] = (DST_PORT >> 8) & 0xff; p[3] = DST_PORT & 0xff;
p[4] = (ulen >> 8) & 0xff; p[5] = ulen & 0xff;
p[6] = (cs >> 8) & 0xff; p[7] = cs & 0xff;
memcpy(p+8,udata,dlen);
cs = udp_checksum(p,ulen);
p[7] = (cs >> 8) & 0xff;
p[6] = cs & 0xff;
return 34+ulen;
}
int main(int argc,char **argv)
{
int sock;
int i,len = 0;
char buffer[1024];
uint8_t ip[4];
uint8_t mac[6];
uint8_t arp[64];
uint8_t trg_ip[4];
in_addr_t tmp;
if(argc != 4) usage();
sock = open_ethif(argv[1]);
if(sock < 0) {
perror("Open interface");
exit(1);
}
if(getmac(argv[1],mac,ip) != 0) {
perror("Get ip/mac");
exit(1);
}
printf("my IP: %d.%d.%d.%d\n",ip[0],ip[1],ip[2],ip[3]);
printf("my MAC: %02x.%02x.%02x.%02x.%02x.%02x\n",mac[0],mac[1],mac[2],mac[3],mac[4],mac[5]);
tmp = inet_addr(argv[2]);
memcpy(trg_ip,&tmp,4);
printf("trg IP: %d.%d.%d.%d\n",trg_ip[0],trg_ip[1],trg_ip[2],trg_ip[3]);
if(strcmp(argv[3],"-a") == 0) {
len = build_arp(buffer,ip,mac,trg_ip);
} else if(strcmp(argv[3],"-u") == 0) {
len = build_udp(buffer,ip,mac,trg_ip);
} else {
printf("unrecognized option %s\n",argv[3]);
usage();
}
printf("Sending %d bytes to device %s \n", len, argv[2]);
for(i=0; i < len; i++) {
printf("%02x ",buffer[i] & 0xff);
if((i & 0x0f) == 0x0f) printf("\n");
}
printf("\n");
int nwrite = send(sock,buffer,len,0);
if(nwrite < 0) {
perror("Writing to interface");
exit(1);
}
int nread = recv(sock,buffer,sizeof(buffer),0);
if(nread < 0) {
perror("Reading from interface");
exit(1);
}
printf("Read %d bytes from device %s \n", nread, argv[2]);
for(i=0; i < nread; i++) {
printf("%02x ",buffer[i] & 0xff);
if((i & 0x0f) == 0x0f) printf("\n");
}
printf("\n");
printf("trg MAC: %02x.%02x.%02x.%02x.%02x.%02x\n",buffer[6] & 0xff,buffer[7] & 0xff,buffer[8] & 0xff,buffer[9] & 0xff,buffer[10] & 0xff,buffer[11] & 0xff);
close(sock);
return 0;
}
|
the_stack_data/471399.c | #ifdef COMPILE_FOR_TEST
#include <assert.h>
#define assume(cond) assert(cond)
#endif
void main(int argc, char* argv[]) {
int x_0_0;//sh_buf.outcnt
int x_0_1;//sh_buf.outcnt
int x_0_2;//sh_buf.outcnt
int x_0_3;//sh_buf.outcnt
int x_0_4;//sh_buf.outcnt
int x_0_5;//sh_buf.outcnt
int x_1_0;//sh_buf.outbuf[0]
int x_1_1;//sh_buf.outbuf[0]
int x_2_0;//sh_buf.outbuf[1]
int x_2_1;//sh_buf.outbuf[1]
int x_3_0;//sh_buf.outbuf[2]
int x_3_1;//sh_buf.outbuf[2]
int x_4_0;//sh_buf.outbuf[3]
int x_4_1;//sh_buf.outbuf[3]
int x_5_0;//sh_buf.outbuf[4]
int x_5_1;//sh_buf.outbuf[4]
int x_6_0;//sh_buf.outbuf[5]
int x_7_0;//sh_buf.outbuf[6]
int x_8_0;//sh_buf.outbuf[7]
int x_9_0;//sh_buf.outbuf[8]
int x_10_0;//sh_buf.outbuf[9]
int x_11_0;//LOG_BUFSIZE
int x_11_1;//LOG_BUFSIZE
int x_12_0;//CREST_scheduler::lock_0
int x_13_0;//t3 T0
int x_14_0;//t2 T0
int x_15_0;//arg T0
int x_16_0;//functioncall::param T0
int x_16_1;//functioncall::param T0
int x_17_0;//buffered T0
int x_18_0;//functioncall::param T0
int x_18_1;//functioncall::param T0
int x_19_0;//functioncall::param T0
int x_19_1;//functioncall::param T0
int x_20_0;//functioncall::param T0
int x_20_1;//functioncall::param T0
int x_21_0;//functioncall::param T0
int x_21_1;//functioncall::param T0
int x_22_0;//direction T0
int x_23_0;//functioncall::param T0
int x_23_1;//functioncall::param T0
int x_24_0;//functioncall::param T0
int x_24_1;//functioncall::param T0
int x_25_0;//functioncall::param T0
int x_25_1;//functioncall::param T0
int x_26_0;//functioncall::param T0
int x_26_1;//functioncall::param T0
int x_27_0;//functioncall::param T0
int x_27_1;//functioncall::param T0
int x_28_0;//functioncall::param T0
int x_28_1;//functioncall::param T0
int x_29_0;//functioncall::param T0
int x_29_1;//functioncall::param T0
int x_30_0;//functioncall::param T0
int x_30_1;//functioncall::param T0
int x_31_0;//functioncall::param T0
int x_31_1;//functioncall::param T0
int x_32_0;//functioncall::param T0
int x_32_1;//functioncall::param T0
int x_33_0;//functioncall::param T0
int x_33_1;//functioncall::param T0
int x_34_0;//functioncall::param T0
int x_34_1;//functioncall::param T0
int x_35_0;//functioncall::param T1
int x_35_1;//functioncall::param T1
int x_36_0;//functioncall::param T1
int x_36_1;//functioncall::param T1
int x_37_0;//i T1
int x_37_1;//i T1
int x_37_2;//i T1
int x_38_0;//rv T1
int x_39_0;//functioncall::param T1
int x_39_1;//functioncall::param T1
int x_40_0;//functioncall::param T1
int x_40_1;//functioncall::param T1
int x_41_0;//functioncall::param T1
int x_41_1;//functioncall::param T1
int x_42_0;//functioncall::param T1
int x_42_1;//functioncall::param T1
int x_43_0;//functioncall::param T1
int x_43_1;//functioncall::param T1
int x_44_0;//functioncall::param T1
int x_44_1;//functioncall::param T1
int x_45_0;//functioncall::param T2
int x_45_1;//functioncall::param T2
int x_46_0;//functioncall::param T2
int x_46_1;//functioncall::param T2
int x_47_0;//i T2
int x_47_1;//i T2
int x_47_2;//i T2
int x_47_3;//i T2
int x_48_0;//rv T2
int x_49_0;//rv T2
int x_49_1;//rv T2
int x_50_0;//functioncall::param T2
int x_50_1;//functioncall::param T2
int x_51_0;//functioncall::param T2
int x_51_1;//functioncall::param T2
int x_52_0;//functioncall::param T2
int x_52_1;//functioncall::param T2
int x_53_0;//functioncall::param T2
int x_53_1;//functioncall::param T2
int x_54_0;//functioncall::param T2
int x_54_1;//functioncall::param T2
int x_55_0;//functioncall::param T2
int x_55_1;//functioncall::param T2
int x_55_2;//functioncall::param T2
int x_56_0;//functioncall::param T2
int x_56_1;//functioncall::param T2
T_0_0_0: x_0_0 = 0;
T_0_1_0: x_1_0 = 0;
T_0_2_0: x_2_0 = 0;
T_0_3_0: x_3_0 = 0;
T_0_4_0: x_4_0 = 0;
T_0_5_0: x_5_0 = 0;
T_0_6_0: x_6_0 = 0;
T_0_7_0: x_7_0 = 0;
T_0_8_0: x_8_0 = 0;
T_0_9_0: x_9_0 = 0;
T_0_10_0: x_10_0 = 0;
T_0_11_0: x_11_0 = 0;
T_0_12_0: x_13_0 = 723750832;
T_0_13_0: x_14_0 = 2968420960;
T_0_14_0: x_15_0 = 0;
T_0_15_0: x_16_0 = 2034412142;
T_0_16_0: x_16_1 = -1;
T_0_17_0: x_17_0 = 0;
T_0_18_0: x_18_0 = 142892338;
T_0_19_0: x_18_1 = x_17_0;
T_0_20_0: x_19_0 = 234969537;
T_0_21_0: x_19_1 = 97;
T_0_22_0: x_20_0 = 1995399150;
T_0_23_0: x_20_1 = 0;
T_0_24_0: x_21_0 = 1354821663;
T_0_25_0: x_21_1 = 0;
T_0_26_0: x_22_0 = -1326550976;
T_0_27_0: x_23_0 = 756188798;
T_0_28_0: x_23_1 = x_22_0;
T_0_29_0: x_24_0 = 202619357;
T_0_30_0: x_24_1 = 0;
T_0_31_0: x_12_0 = -1;
T_0_32_0: x_0_1 = 5;
T_0_33_0: x_1_1 = 72;
T_0_34_0: x_2_1 = 69;
T_0_35_0: x_3_1 = 76;
T_0_36_0: x_4_1 = 76;
T_0_37_0: x_5_1 = 79;
T_0_38_0: x_25_0 = 824920925;
T_0_39_0: x_25_1 = 83;
T_0_40_0: x_26_0 = 1499317775;
T_0_41_0: x_26_1 = 1;
T_0_42_0: x_27_0 = 1625154215;
T_0_43_0: x_27_1 = 1;
T_0_44_0: x_28_0 = 1051478417;
T_0_45_0: x_28_1 = 1;
T_0_46_0: x_29_0 = 692684369;
T_0_47_0: x_29_1 = 82;
T_0_48_0: x_30_0 = 1195072425;
T_0_49_0: x_30_1 = 90;
T_0_50_0: x_31_0 = 1103132188;
T_0_51_0: x_31_1 = 1;
T_0_52_0: x_32_0 = 565169940;
T_0_53_0: x_32_1 = 1;
T_0_54_0: x_33_0 = 1242182272;
T_0_55_0: x_33_1 = 2;
T_0_56_0: x_34_0 = 1801556925;
T_0_57_0: x_34_1 = 2;
T_0_58_0: x_11_1 = 6;
T_2_59_2: x_45_0 = 1849613578;
T_2_60_2: x_45_1 = x_33_1;
T_2_61_2: x_46_0 = 1726056356;
T_2_62_2: x_46_1 = x_34_1;
T_2_63_2: x_47_0 = 0;
T_2_64_2: x_48_0 = 1275888129;
T_1_65_1: x_35_0 = 1127212203;
T_1_66_1: x_35_1 = x_27_1;
T_1_67_1: x_36_0 = 322129642;
T_1_68_1: x_36_1 = x_28_1;
T_1_69_1: x_37_0 = 0;
T_1_70_1: x_38_0 = 1277989377;
T_2_71_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0) x_49_0 = -1319483472;
T_2_72_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0 && x_18_1 == 0 && x_18_1 == 0) x_50_0 = 1242944632;
T_2_73_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0 && x_18_1 == 0 && x_18_1 == 0) x_50_1 = -1;
T_2_74_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0 && x_18_1 == 0 && x_18_1 == 0) x_49_1 = x_50_1;
T_2_75_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0 && x_18_1 == 0 && x_49_1 + 1 == 0) x_0_2 = 0;
T_1_76_1: if (x_36_1 < x_11_1) x_39_0 = 1377392546;
T_1_77_1: if (x_36_1 < x_11_1) x_39_1 = 47943441938176;
T_1_78_1: if (x_36_1 < x_11_1) x_40_0 = 1317511953;
T_1_79_1: if (x_36_1 < x_11_1) x_40_1 = x_0_2 + x_36_1;
T_1_80_1: if (x_36_1 < x_11_1) x_37_1 = 0;
T_1_81_1: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_41_0 = 393048405;
T_1_82_1: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_41_1 = 47943441938176;
T_1_83_1: if (x_36_1 < x_11_1) x_37_2 = 1 + x_37_1;
T_1_84_1: if (x_36_1 < x_11_1) x_42_0 = 1108644447;
T_1_85_1: if (x_36_1 < x_11_1) x_42_1 = 47943441938176;
T_1_86_1: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0) x_51_0 = 2094351796;
T_1_87_1: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0) x_51_1 = 9;
T_2_88_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0) x_52_0 = 1929002610;
T_2_89_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0) x_52_1 = x_51_1;
T_2_90_2: if (x_0_1 + x_46_1 > x_11_1 && x_0_1 != 0) x_0_3 = 0;
T_2_91_2: if (x_36_1 < x_11_1) x_0_4 = x_0_2 + x_36_1;
T_1_92_1: if (x_46_1 < x_11_1) x_53_0 = 1776106186;
T_2_93_2: if (x_46_1 < x_11_1) x_53_1 = 47943444039424;
T_2_94_2: if (x_36_1 < x_11_1) x_43_0 = 1919163028;
T_2_95_2: if (x_36_1 < x_11_1) x_43_1 = 47943441938176;
T_1_96_1: if (x_46_1 < x_11_1) x_54_0 = 1253959182;
T_1_97_1: if (x_46_1 < x_11_1) x_54_1 = x_0_4 + x_46_1;
T_2_98_2: if (x_46_1 < x_11_1) x_47_1 = 0;
T_2_99_2: if (x_46_1 < x_11_1 && x_47_1 < x_45_1) x_55_0 = 1663034680;
T_2_100_2: if (x_46_1 < x_11_1 && x_47_1 < x_45_1) x_55_1 = 47943444039424;
T_2_101_2: if (x_46_1 < x_11_1) x_47_2 = 1 + x_47_1;
T_2_102_2: if (x_46_1 < x_11_1 && x_47_2 < x_45_1) x_55_2 = 47943444039424;
T_2_103_2: if (x_46_1 < x_11_1) x_47_3 = 1 + x_47_2;
T_2_104_2: if (x_46_1 < x_11_1) x_56_0 = 2062055366;
T_2_105_2: if (x_46_1 < x_11_1) x_56_1 = 47943444039424;
T_2_106_2: if (x_46_1 < x_11_1) x_0_5 = x_0_4 + x_46_1;
T_2_107_2: if (x_36_1 < x_11_1) x_44_0 = 1488928719;
T_2_108_2: if (x_36_1 < x_11_1) x_44_1 = 47943441938176;
T_1_109_1: if (x_36_1 < x_11_1) assert(x_0_5 == x_40_1);
}
|
the_stack_data/242331750.c | /* $OpenBSD: from.c,v 1.14 2009/10/27 23:59:38 deraadt Exp $ */
/* $NetBSD: from.c,v 1.6 1995/09/01 01:39:10 jtc Exp $ */
/*
* Copyright (c) 1980, 1988, 1993
* The Regents of the University of California. 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 the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/types.h>
#include <ctype.h>
#include <pwd.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <paths.h>
#include <string.h>
#include <err.h>
int match(char *, char *);
int
main(int argc, char *argv[])
{
struct passwd *pwd;
int ch, newline;
char *file, *sender, *p;
#if MAXPATHLEN > BUFSIZ
char buf[MAXPATHLEN];
#else
char buf[BUFSIZ];
#endif
file = sender = NULL;
while ((ch = getopt(argc, argv, "f:s:")) != -1)
switch((char)ch) {
case 'f':
file = optarg;
break;
case 's':
sender = optarg;
for (p = sender; *p; ++p)
if (isupper(*p))
*p = tolower(*p);
break;
case '?':
default:
fprintf(stderr,
"usage: from [-f file] [-s sender] [user]\n");
exit(1);
}
argv += optind;
/*
* We find the mailbox by:
* 1 -f flag
* 2 user
* 2 MAIL environment variable
* 3 _PATH_MAILDIR/file
*/
if (!file) {
if (!(file = *argv)) {
if (!(file = getenv("MAIL"))) {
if (!(pwd = getpwuid(getuid())))
errx(1, "no password file entry for you");
if ((file = getenv("USER"))) {
(void)snprintf(buf, sizeof(buf),
"%s/%s", _PATH_MAILDIR, file);
file = buf;
} else
(void)snprintf(file = buf, sizeof(buf),
"%s/%s", _PATH_MAILDIR,
pwd->pw_name);
}
} else {
(void)snprintf(buf, sizeof(buf), "%s/%s",
_PATH_MAILDIR, file);
file = buf;
}
}
if (!freopen(file, "r", stdin))
err(1, "%s", file);
for (newline = 1; fgets(buf, sizeof(buf), stdin);) {
if (*buf == '\n') {
newline = 1;
continue;
}
if (newline && !strncmp(buf, "From ", 5) &&
(!sender || match(buf + 5, sender)))
printf("%s", buf);
newline = 0;
}
exit(0);
}
int
match(char *line, char *sender)
{
char ch, pch, first, *p, *t;
for (first = *sender++;;) {
if (isspace(ch = *line))
return(0);
++line;
if (isupper(ch))
ch = tolower(ch);
if (ch != first)
continue;
for (p = sender, t = line;;) {
if (!(pch = *p++))
return(1);
if (isupper(ch = *t++))
ch = tolower(ch);
if (ch != pch)
break;
}
}
/* NOTREACHED */
}
|
the_stack_data/72011960.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <locale.h>
int mdc(int a, int b) {
if (a % b == 0) {
return b;
}
return mdc(b, a % b);
}
struct fracao {
int numerador1;
int denominador1;
int numerador2;
int denominador2;
};
int main(int argc, char *argv[]){
struct fracao F;
FILE* f = fopen("arq.txt","r");
fscanf(f," %d",&F.numerador1);
fscanf(f," %d",&F.denominador1);
fscanf(f," %d",&F.numerador2);
fscanf(f," %d",&F.denominador2);
FILE* f1 = fopen("arq1.txt","w");
int mmc = (F.denominador1*F.denominador2)/mdc(F.denominador1, F.denominador2);
fprintf(f1, "A soma obtida e\n");
fprintf(f1, "%d/%d\n", ((F.numerador1 * mmc)/F.denominador1) + (F.numerador2 * mmc)/F.denominador2 , mmc);
fprintf(f1,"=======================\n");
fprintf(f1,"O Produto obtido e\n");
fprintf(f1,"%d/%d", F.numerador1*F.numerador2,F.denominador1*F.denominador2);
fclose(f);
fclose(f1);
return 0;
}
|
the_stack_data/119186.c | struct A {};
struct A foo()
{
return foo();
}
void bar()
{
foo();
}
|
the_stack_data/36371.c | #include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
#ifdef _MSC_VER
static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
#else
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#endif
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef _MSC_VER
#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/Cd(b)._Val[1]);}
#else
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimagf(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle_() continue;
#define myceiling_(w) {ceil(w)}
#define myhuge_(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc_(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#ifdef _MSC_VER
static _Fcomplex cpow_ui(complex x, integer n) {
complex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
for(u = n; ; ) {
if(u & 01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
else break;
}
}
_Fcomplex p={pow.r, pow.i};
return p;
}
#else
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
#ifdef _MSC_VER
static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
_Dcomplex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u = n; ; ) {
if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
else break;
}
}
_Dcomplex p = {pow._Val[0], pow._Val[1]};
return p;
}
#else
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Table of constant values */
static integer c__1 = 1;
/* > \brief \b ZSYCON */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download ZSYCON + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zsycon.
f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zsycon.
f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zsycon.
f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE ZSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK, */
/* INFO ) */
/* CHARACTER UPLO */
/* INTEGER INFO, LDA, N */
/* DOUBLE PRECISION ANORM, RCOND */
/* INTEGER IPIV( * ) */
/* COMPLEX*16 A( LDA, * ), WORK( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > ZSYCON estimates the reciprocal of the condition number (in the */
/* > 1-norm) of a complex symmetric matrix A using the factorization */
/* > A = U*D*U**T or A = L*D*L**T computed by ZSYTRF. */
/* > */
/* > An estimate is obtained for norm(inv(A)), and the reciprocal of the */
/* > condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] UPLO */
/* > \verbatim */
/* > UPLO is CHARACTER*1 */
/* > Specifies whether the details of the factorization are stored */
/* > as an upper or lower triangular matrix. */
/* > = 'U': Upper triangular, form is A = U*D*U**T; */
/* > = 'L': Lower triangular, form is A = L*D*L**T. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The order of the matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] A */
/* > \verbatim */
/* > A is COMPLEX*16 array, dimension (LDA,N) */
/* > The block diagonal matrix D and the multipliers used to */
/* > obtain the factor U or L as computed by ZSYTRF. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
/* > \endverbatim */
/* > */
/* > \param[in] IPIV */
/* > \verbatim */
/* > IPIV is INTEGER array, dimension (N) */
/* > Details of the interchanges and the block structure of D */
/* > as determined by ZSYTRF. */
/* > \endverbatim */
/* > */
/* > \param[in] ANORM */
/* > \verbatim */
/* > ANORM is DOUBLE PRECISION */
/* > The 1-norm of the original matrix A. */
/* > \endverbatim */
/* > */
/* > \param[out] RCOND */
/* > \verbatim */
/* > RCOND is DOUBLE PRECISION */
/* > The reciprocal of the condition number of the matrix A, */
/* > computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an */
/* > estimate of the 1-norm of inv(A) computed in this routine. */
/* > \endverbatim */
/* > */
/* > \param[out] WORK */
/* > \verbatim */
/* > WORK is COMPLEX*16 array, dimension (2*N) */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date December 2016 */
/* > \ingroup complex16SYcomputational */
/* ===================================================================== */
/* Subroutine */ int zsycon_(char *uplo, integer *n, doublecomplex *a,
integer *lda, integer *ipiv, doublereal *anorm, doublereal *rcond,
doublecomplex *work, integer *info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2;
/* Local variables */
integer kase, i__;
extern logical lsame_(char *, char *);
integer isave[3];
logical upper;
extern /* Subroutine */ int zlacn2_(integer *, doublecomplex *,
doublecomplex *, doublereal *, integer *, integer *), xerbla_(
char *, integer *, ftnlen);
doublereal ainvnm;
extern /* Subroutine */ int zsytrs_(char *, integer *, integer *,
doublecomplex *, integer *, integer *, doublecomplex *, integer *,
integer *);
/* -- LAPACK computational routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* December 2016 */
/* ===================================================================== */
/* Test the input parameters. */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 1;
a -= a_offset;
--ipiv;
--work;
/* Function Body */
*info = 0;
upper = lsame_(uplo, "U");
if (! upper && ! lsame_(uplo, "L")) {
*info = -1;
} else if (*n < 0) {
*info = -2;
} else if (*lda < f2cmax(1,*n)) {
*info = -4;
} else if (*anorm < 0.) {
*info = -6;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("ZSYCON", &i__1, (ftnlen)6);
return 0;
}
/* Quick return if possible */
*rcond = 0.;
if (*n == 0) {
*rcond = 1.;
return 0;
} else if (*anorm <= 0.) {
return 0;
}
/* Check that the diagonal matrix D is nonsingular. */
if (upper) {
/* Upper triangular storage: examine D from bottom to top */
for (i__ = *n; i__ >= 1; --i__) {
i__1 = i__ + i__ * a_dim1;
if (ipiv[i__] > 0 && (a[i__1].r == 0. && a[i__1].i == 0.)) {
return 0;
}
/* L10: */
}
} else {
/* Lower triangular storage: examine D from top to bottom. */
i__1 = *n;
for (i__ = 1; i__ <= i__1; ++i__) {
i__2 = i__ + i__ * a_dim1;
if (ipiv[i__] > 0 && (a[i__2].r == 0. && a[i__2].i == 0.)) {
return 0;
}
/* L20: */
}
}
/* Estimate the 1-norm of the inverse. */
kase = 0;
L30:
zlacn2_(n, &work[*n + 1], &work[1], &ainvnm, &kase, isave);
if (kase != 0) {
/* Multiply by inv(L*D*L**T) or inv(U*D*U**T). */
zsytrs_(uplo, n, &c__1, &a[a_offset], lda, &ipiv[1], &work[1], n,
info);
goto L30;
}
/* Compute the estimate of the reciprocal condition number. */
if (ainvnm != 0.) {
*rcond = 1. / ainvnm / *anorm;
}
return 0;
/* End of ZSYCON */
} /* zsycon_ */
|
the_stack_data/11437.c | #include <openssl/evp.h>
#include <openssl/rand.h>
#include <string.h> // memset
#include <unistd.h> // write
#include <fcntl.h> // open
#define ROUNDS 200000
#define SALTLEN 16
int get_salt ( const char* filename, int len, unsigned char* salt )
{
// read a file containing a random salt, or create one if it doesn't exist
int fd, count;
if ( access ( filename, F_OK ) == 0 ) {
if ( ( fd = open ( filename, O_RDONLY ) ) == -1 )
return -1;
count = read ( fd, salt, len );
} else {
RAND_pseudo_bytes ( salt, len );
if ( ( fd = open ( filename, O_CREAT|O_WRONLY, 0644 ) ) == -1 )
return -1;
count = write ( fd, salt, len );
}
close ( fd );
return ( count == len ) ? 0 : -1;
}
int derive_key ( const char* salt_filename, const char* pass, int passlen, unsigned char* key, int keylen )
{
unsigned char salt[SALTLEN];
if ( get_salt ( salt_filename, SALTLEN, salt ) == -1 )
return -1;
PKCS5_PBKDF2_HMAC_SHA1 ( pass, passlen, salt, SALTLEN, ROUNDS, keylen, key );
return 0;
}
|
the_stack_data/140765173.c | #define _CRT_SECURE_NO_WARNINGS
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
int *Prefix(char *s)
{
int i,l=strlen(s),*pi=(int*)malloc(l*sizeof(int)),t=0;
pi[0]=t;
for(i=1;i<l;i++)
{
for(;t>0 && s[t]!=s[i];t=pi[t-1]);
if(s[t]==s[i]) t++;
pi[i]=t;
}
return pi;
}
int Rec(int ***ps, int n, int m, int c)
{
int i,j,r=0,b;
if(m==n) return r;
for(i=0;i<n;i++) ps[i][c][1]++;
for(i=0;i<n;i++)
{
if(ps[c][i][1]==0)
{
for(j=0;j<n;j++) ps[c][j][1]++;
b=Rec(ps,n,m+1,i)+ps[c][i][0];
if(b>r) r=b;
for(j=0;j<n;j++) ps[c][j][1]--;
}
}
for(i=0;i<n;i++) ps[i][c][1]--;
return r;
}
int Max(int ***ps, int n)
{
int i,r=0,b;
for(i=0;i<n;i++)
{
b=Rec(ps,n,1,i);
if(b>r) r=b;
}
return r;
}
int main()
{
int n,i,j,***ps,*pi,l=0;
char **s,*b=(char*)malloc(1024*sizeof(char));
scanf("%d%*c",&n);
ps=(int***)malloc(n*sizeof(int**));
s=(char**)malloc(n*sizeof(char*));
for(i=0;i<n;i++)
{
s[i]=(char*)malloc(512*sizeof(char));
ps[i]=(int**)malloc(n*sizeof(int*));
for(j=0;j<n;j++) ps[i][j]=(int*)calloc(2,sizeof(int));
gets(s[i]);
l+=strlen(s[i]);
}
//////////////м. пер.////////////////////
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
strcpy(b,s[i]);
strcat(b,s[j]);
pi=Prefix(b);
ps[j][i][0]=pi[strlen(b)-1];
free(pi);
strcpy(b,s[j]);
strcat(b,s[i]);
pi=Prefix(b);
ps[i][j][0]=pi[strlen(b)-1];
free(pi);
}
}
//////////////////собсно пересчёт////////
printf("%d",l-Max(ps,n));
/////////////////////////////////////////
for(i=0;i<n;i++)
{
for(j=0;j<n;j++) free(ps[i][j]);
free(ps[i]);
free(s[i]);
}
free(ps);
free(b);
free(s);
return 0;
} |
the_stack_data/331996.c | /*
* Copyright (c) 2014 Jonas 'Sortie' Termansen.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* wchar/wcscasecmp.c
* Compares two strings ignoring case.
*/
#include <stdbool.h>
#include <wchar.h>
#include <wctype.h>
int wcscasecmp(const wchar_t* a, const wchar_t* b)
{
for ( size_t i = 0; true; i++ )
{
wint_t ac = towlower((wint_t) a[i]);
wint_t bc = towlower((wint_t) b[i]);
if ( ac == L'\0' && bc == L'\0' )
return 0;
if ( ac < bc )
return -1;
if ( ac > bc )
return 1;
}
}
|
the_stack_data/6834.c | #include <stdio.h>
int main()
{
int A = 0, C, G=0,H=0,I=0,J=0;
for (C = 1; C <= 5; C++)
{
scanf("%d", &A);
if (A%2 == 0)
{
G++;
}
if(A%2 != 0){
H++;
}
if(A > 0 ){
I++;
}
if(A < 0 ){
J++;
}
}
printf("%d valor(es) par(es)\n", G);
printf("%d valor(es) impar(es)\n", H);
printf("%d valor(es) positivo(s)\n", I);
printf("%d valor(es) negativo(s)\n", J);
return 0;
} |
the_stack_data/470011.c | // usage: gcc shell_flo.c -o shell_flo && ./shell_flo
#include <stdio.h>
#include <unistd.h>
#include <sys/types.h>
#include <stdlib.h> /* exit */
#include <string.h> /* strcmp */
#include <fcntl.h> /* O_APPEND */
#include <errno.h> /* for pipe */
#define MAX_LINE 80 /* The maximum length command */
char *args[MAX_LINE/2 + 1]; /* command line arguments */
int i = 0;
int reInput = 0;
int reOutput = 0;
void exe();
int main(void)
{
int should_run = 1; /* flag to determine when to exit program */
while (should_run) {
fflush(stdout);
printf("flo>");
char ch[MAX_LINE];
int ampersand = 0;
char end;
int flag = 1;
char fileName[MAX_LINE];
do {
scanf("%s%c",ch,&end);
if (flag){
if (!strcmp(ch,"exit")){
return 0;
}
if (!strcmp(ch,"!!")){
if (i == 0){
printf("No commands in history\n");
}
break;
}
while(i >= 0){
free(args[i]);
i-=1;
}
i = 0;
reInput = 0;
reOutput = 0;
ampersand = 0;
flag = 0;
}
if (!strcmp(ch,"&")) {
ampersand = 1;
break;
}
if (!strcmp(ch,"<")) {
reInput = 1;
scanf("%s%c",fileName,&end);
break;
}
if (!strcmp(ch,">")) {
reOutput = 1;
scanf("%s%c",fileName,&end);
break;
}
args[i] = (char*)malloc(sizeof(char) * (strlen(ch) + 1));
strcpy(args[i],ch);
i+=1;
}while(end != '\n');
args[i] = NULL;
pid_t pid;
pid = fork();
if (pid < 0) {
printf("fork error!\n");
return 0;
}
else if (pid == 0){ /* child */
if (reInput){
int i_fd = open(fileName, O_CREAT|O_APPEND|O_RDWR, 0666);
if(i_fd < 0){
printf("open error!\n");
return 0;
}
int i_dup2_fd = dup2(i_fd, STDIN_FILENO);
if(i_dup2_fd != STDIN_FILENO){
printf("dup2 error!\n");
return 0;
}
exe();
close(i_fd);
close(i_dup2_fd);
}
else if (reOutput){
int o_fd = open(fileName, O_CREAT|O_APPEND|O_RDWR, 0666);
if(o_fd < 0){
printf("open error!\n");
return 0;
}
int o_dup2_fd = dup2(o_fd, STDOUT_FILENO);
if(o_dup2_fd != STDOUT_FILENO){
printf("dup2 error!\n");
return 0;
}
exe();
close(o_fd);
close(o_dup2_fd);
}
else{
exe();
}
exit(0);
}
else{ /* parent */
if (!ampersand){
wait(pid);
}
}
}
return 0;
}
void exe(){
int pipe_pos = 0;
int t = 0;
while(t<i){
if (!strcmp(args[t],"|")){
pipe_pos = t;
}
t+=1;
}
if (!pipe_pos) execvp(args[0], args);
else{
char *tmp1[MAX_LINE/2 + 1];
char *tmp2[MAX_LINE/2 + 1];
t = 0;
while(t < pipe_pos){
tmp1[t] = (char*)malloc(sizeof(char) * (strlen(args[t]) + 1));
strcpy(tmp1[t],args[t]);
t+=1;
}
tmp1[t] = NULL;
t = pipe_pos + 1;
while(t < i){
tmp2[t - pipe_pos - 1] = (char*)malloc(sizeof(char) * (strlen(args[t]) + 1));
strcpy(tmp2[t - pipe_pos - 1],args[t]);
t+=1;
}
tmp2[t - pipe_pos - 1] = NULL;
int fd[2];
int ret = pipe(fd);
if (ret == -1){
printf("pipe error!\n");
return;
}
pid_t pid;
pid = fork();
if (pid < 0) {
printf("fork error!\n");
return;
}
else if (pid == 0){ /* child */
close(fd[0]);
int o_dup2_fd = dup2(fd[1],STDOUT_FILENO);
execvp(tmp1[0], tmp1);
}
else{
close(fd[1]);
wait(pid);
int i_dup2_fd = dup2(fd[0],STDIN_FILENO);
execvp(tmp2[0], tmp2);
fflush(stdout);
}
//ls -l | less
}
} |
the_stack_data/579064.c | #include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
__int128 zero = 0;
__int128 one = 1;
__int128 few = 128;
__int128 much = ((__int128)1 << 64) + ((__int128)1 << 63);
__int128 res[4];
__int128 zlo = few;
res[0] = __sync_val_compare_and_swap_16(&zlo, one, much);
res[1] = zlo;
res[2] = __sync_val_compare_and_swap_16(&zlo, few, much);
res[3] = zlo;
for (unsigned char i = 0; i < 4; i++)
printf("%lu\n", res[i]);
int rv = 0;
rv |= (res[0] != few ) && (1 << 0);
rv |= (res[1] != few ) && (1 << 1);
rv |= (res[2] != few ) && (1 << 2);
rv |= (res[3] != much) && (1 << 3);
return rv;
}
|
the_stack_data/159516052.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
char line[255];
char line2[255];
FILE * DAt = fopen("main.txt", "r");
fgets(line, 255, DAt); /* first line in the */
fgets(line2, 255, DAt); /* second line in the */
printf("%s", line);
printf("%s", line2);
fclose(DAt);
return 0;
}
/*
membaca file
parameternya r
*/ |
the_stack_data/1233161.c | #include <stdio.h>
#include <unistd.h>
#include <sys/ioctl.h>
int main(int argc, char *argv[])
{
int i, n, w;
struct winsize size;
ioctl(STDOUT_FILENO, TIOCGWINSZ, &size);
w = size.ws_col;
for (n = 0;;) {
for (i = 1; i < argc; i++) {
if (n++ >= w)
return 0;
if (fputs(argv[i], stdout) == EOF)
return 1;
}
}
return 0;
}
|
the_stack_data/122459.c | #include <stdio.h>
#include <string.h>
int main (int argc, char* argv[]) {
char haystack[256];
char needle[256];
if(argc != 3){
printf("ERROR: Please type in two strings");
return 1;
}
strcpy(haystack, argv[1]);
strcpy(needle, argv[2]);
if(strlen(haystack) < strlen(needle)){
printf("ERROR: Your \" substring \" is longer than the original string to be compared");
}
char *ret;
ret = strstr(haystack, needle);
printf("The substring is: %s\n", ret);
return(0);
}
|
the_stack_data/48575244.c | #include <stdio.h>
int main(void)
{
int num, i;
printf("Enter the number to test: ");
scanf("%d", &num);
for (i=2; i<(num/2)+1; i=i+1)
if ((num%i) == 0) printf("%d ", i);
return 0;
} |
the_stack_data/162644459.c | // primitive types
typedef unsigned int u32;
// mmio addresses
#define MMIO_BASE_ADDRESS (0x3F000000)
#define GPIO_BASE_ADDRESS (MMIO_BASE_ADDRESS + 0x00200000)
// gpio mmio addresses
#define GPIO_GPFSEL0 (GPIO_BASE_ADDRESS + 0x00000000)
#define GPIO_GPFSEL1 (GPIO_BASE_ADDRESS + 0x00000004)
#define GPIO_GPFSEL2 (GPIO_BASE_ADDRESS + 0x00000008)
#define GPIO_GPFSEL3 (GPIO_BASE_ADDRESS + 0x0000000C)
#define GPIO_GPFSEL4 (GPIO_BASE_ADDRESS + 0x00000010)
#define GPIO_GPFSEL5 (GPIO_BASE_ADDRESS + 0x00000014)
#define GPIO_GPSET0 (GPIO_BASE_ADDRESS + 0x0000001C)
#define GPIO_GPSET1 (GPIO_BASE_ADDRESS + 0x00000020)
#define GPIO_GPCLR0 (GPIO_BASE_ADDRESS + 0x00000028)
#define GPIO_GPCLR1 (GPIO_BASE_ADDRESS + 0x0000002C)
// main entry point
void main(void) {
volatile u32 time;
*(u32*)GPIO_GPFSEL2 |= (1 << 27);
while (1) {
for (time = 0; time < 500000; ++time);
*(u32*)GPIO_GPCLR0 = (1 << 29);
for (time = 0; time < 500000; ++time);
*(u32*)GPIO_GPSET0 = (1 << 29);
}
}
|
the_stack_data/90765147.c | #include <wchar.h>
#include <wctype.h>
#include <ctype.h>
/* Our definition of whitespace is the Unicode White_Space property,
* minus non-breaking spaces (U+00A0, U+2007, and U+202F) and script-
* specific characters with non-blank glyphs (U+1680 and U+180E). */
int iswspace(wint_t wc)
{
static const wchar_t spaces[] = {
' ', '\t', '\n', '\r', 11, 12, 0x0085,
0x2000, 0x2001, 0x2002, 0x2003, 0x2004, 0x2005,
0x2006, 0x2008, 0x2009, 0x200a,
0x2028, 0x2029, 0x205f, 0x3000, 0
};
if (wcschr(spaces, wc)) return 1;
return 0;
}
|
the_stack_data/43822.c | /**
* @brief test program used to test unresolved helper handling
*/
typedef unsigned char uint8_t;
typedef unsigned long int uint64_t;
extern void log(const char*);
extern void log_64(uint64_t, uint64_t, uint64_t, uint64_t, uint64_t);
extern uint64_t entrypoint(const uint8_t *input) {
log("message");
log_64(1, 2, 3, 4, 5);
return 0;
}
|
the_stack_data/231393287.c | #include <stdlib.h>
#include <stdio.h>
#define _GNU_SOURCE
#include <pthread.h>
#include <sys/stat.h>
#include <string.h>
#include <unistd.h>
#include <stdbool.h>
#define MAX_BUFF 1024
#define MAX_INDEXES 10240
#define MAX_SIZE 20
#define MAX_THREADS 64
#define MAX_SEQS 3000000
#define MAX_QUERIES 100000
#define PAM_RIGHT 0x1ull << 63
#define TRUE 1
#define FALSE 0
#define FLIP(x) x = (x == '+' ? '-' : '+');
typedef enum side_e { LEFT = 0, RIGHT = 1 } side_e;
#define NPAMS 20
typedef enum pam_e
{
NGG = 0,
NGCG = 1,
NGAG = 2,
NGAN = 3,
NNGRRT = 4,
NNGRRN = 5,
NNAGAAW = 6,
NNNNGHTT = 7,
NGA = 8,
NAG = 9,
NGNG = 10,
NNGRRW = 11,
NGGRRT = 12,
NNNNGATT = 13,
NNNNGMTT = 14,
/* These left-end PAMs are indexed as NAA and NAAA, and the results flipped strand on output */
TTN = 15,
TTTN = 16,
NG = 17,
YG = 18,
NNG = 19
} pam_e;
int pam_sizes[NPAMS] = { 3, 4, 4, 4, 6, 6, 7, 8, 3, 3, 4, 6, 6, 8, 8, 3, 4, 2, 2, 3 };
int pam_distance_to_cut[NPAMS] = { 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 22, 22, 3, 3, 3 };
side_e pam_sides[NPAMS] = { RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, RIGHT, LEFT, LEFT, RIGHT, RIGHT, RIGHT };
#define EXON 0x1
#define CDS 0x2
#define UTR5 0x4
#define UTR3 0x8
#define INTRON 0x10
#define FLANK5 0x20
#define FLANK3 0x40
#define ENHANCER 0x80
#define PROMOTER 0x100
#define TSS 0x200
#define TTS 0x400
#define SPLICE 0x800
#define FIRST_EXON 0x1000
#define LAST_EXON 0x2000
#define CONSTITUTIVE_EXON 0x4000
typedef enum format_e { NO_FORMAT, GFF_FORMAT, TABLE_FORMAT, ANNOTATED_FORMAT, STATS_FORMAT, SHORT_ANNOTATED_FORMAT, EXACT_ANNOTATED_FORMAT } format_e;
typedef enum cut_region_e { NONCODING = 0, CODING = 1 } cut_region_e;
/* Priors from "Lei S. Qi Cell 2013"
* Results for a crRNA of 20 !!! The values are the activities of repression still remaining despite
* one mismatch in a specific position.
* The last position is the one which is the closest from the PAM motif (reverse in the figure of the article).
*/
double priors[MAX_SIZE] = {0.79, 0.415, 0.45, 0.64, 0.66, 0.695, 0.67, 0.64, 0.3, 0.26,
0.25, 0.3, 0.245, 0.01, 0.12, 0.11, 0.07, 0.06, 0.09, 0.065};
typedef unsigned long int uint64_t;
typedef unsigned int uint32_t;
typedef unsigned short int uint16_t;
typedef unsigned char uint8_t;
typedef struct entry_t
{
uint32_t pos;
uint64_t seq;
} entry_t;
typedef struct feature_entry_t
{
char gene[30];
uint16_t type;
uint8_t strand;
uint32_t start, end, ntx;
} feature_entry_t;
typedef struct gene_entry_t
{
char gene[30];
char name[40];
char type[40];
uint8_t strand;
uint32_t start, end, ntx;
} gene_entry_t;
typedef struct info_t
{
feature_entry_t features[1000000];
int nfeatures;
gene_entry_t genes[1000000];
int ngenes;
} info_t;
char *prog;
bool count_only = FALSE;
format_e format = NO_FORMAT;
uint8_t cmap[256];
uint64_t ERROR_STR = -1;
entry_t seqs[MAX_SEQS];
typedef struct search_data_t
{
bool is_free;
int thread_no;
int index_no;
/*
int query_no;
uint64_t query;
int query_size;
int max_mismatches;
*/
char *name;
int nseqs;
entry_t seqs[MAX_SEQS];
int max_size;
pam_e pam;
info_t *info;
int mismatches[MAX_SIZE+1];
int off_targets;
} search_data_t;
pthread_t threads[MAX_THREADS];
search_data_t search_data[MAX_THREADS];
int nqueries = 0;
int query_sizes[MAX_QUERIES];
uint64_t queries[MAX_QUERIES];
int max_mismatches[MAX_SIZE+1];
uint32_t query_mismatches[MAX_QUERIES][MAX_SIZE+1];
double query_prob[MAX_QUERIES][2];
int query_count[MAX_QUERIES][2];
int query_exact[MAX_QUERIES];
int seed_length = 12;
int max_seed_mismatches = 2;
int bad_seed[MAX_QUERIES];
info_t *read_gene_info(FILE *fp, info_t *info)
{
char *line, buffer[MAX_BUFF];
info->ngenes = 0;
while ((line = fgets(buffer, MAX_BUFF, fp)))
{
size_t len = strlen(line);
line[--len] = '\0';
char *gene = strtok(line, "\t");
char *chr = strtok(NULL, "\t");
int start = atoi(strtok(NULL, "\t"));
int end = atoi(strtok(NULL, "\t"));
char *strand = strtok(NULL, "\t");
int ntx = atoi(strtok(NULL, "\t"));
char *name = strtok(NULL, "\t");
char *type = strtok(NULL, "\t");
gene_entry_t *inf = &info->genes[info->ngenes++];
strcpy(inf->gene, gene);
strcpy(inf->name, name);
strcpy(inf->type, type);
inf->start = start;
inf->end = end;
inf->strand = *strand;
inf->ntx = ntx;
}
return (info);
}
info_t *read_feature_info(FILE *fp)
{
info_t *info = (info_t *) malloc(sizeof(info_t));
char *line, buffer[MAX_BUFF];
info->nfeatures = 0;
while ((line = fgets(buffer, MAX_BUFF, fp)))
{
size_t len = strlen(line);
line[--len] = '\0';
char *gene = strtok(line, "\t");
int type = atoi(strtok(NULL, "\t"));
int start = atoi(strtok(NULL, "\t"));
int end = atoi(strtok(NULL, "\t"));
char *strand = strtok(NULL, "\t");
int ntx = atoi(strtok(NULL, "\t"));
feature_entry_t *inf = &info->features[info->nfeatures++];
strcpy(inf->gene, gene);
inf->type = type;
inf->start = start;
inf->end = end;
inf->strand = *strand;
inf->ntx = ntx;
}
return (info);
}
gene_entry_t *find_gene(info_t *info, char *gene_id)
{
int j;
gene_entry_t *inf;
for(j = 0; j < info->ngenes; j++)
{
inf = &info->genes[j];
if (strcmp(inf->gene, gene_id) == 0)
{
return (inf);
}
}
return (NULL);
}
cut_region_e find_features(int query_no, char *query_seq, char *name,
uint32_t hit_start, uint32_t hit_end, char hit_strand, char *hit_seq,
int hit_mm, int seed_mm, double p_ot,
info_t *info, uint32_t pos)
{
int i, j;
feature_entry_t hits[100];
int nhits = 0;
feature_entry_t *inf;
if (info)
{
for(j = 0; j < info->nfeatures; j++)
{
inf = &info->features[j];
if (pos < inf->start)
{
break;
}
if (inf->start <= pos && pos <= inf->end)
{
int hit = -1;
for(i = 0; i < nhits; i++)
{
if (strcmp(hits[i].gene, inf->gene) == 0)
{
hit = i;
break;
}
}
if (hit == -1)
{
hit = nhits++;
strcpy(hits[i].gene, inf->gene);
hits[i].type = 0;
hits[i].ntx = 0;
hits[i].strand = inf->strand;
}
hits[hit].type |= inf->type;
if ((inf->type & INTRON) && (pos <= inf->start+2 || inf->end-2 <= pos))
{
hits[hit].type |= SPLICE;
}
hits[hit].ntx += inf->ntx;
}
}
}
if (format == ANNOTATED_FORMAT || format == SHORT_ANNOTATED_FORMAT || format == EXACT_ANNOTATED_FORMAT)
{
if (nhits == 0)
{
if (format == ANNOTATED_FORMAT || (format == EXACT_ANNOTATED_FORMAT && hit_mm == 0))
{
printf("%d\t%s\t%s\t%u\t%u\t%c\t%s\t%d\t%d\t%f\t-\t-\t-\n", query_no, query_seq,name, hit_start, hit_end, hit_strand, hit_seq, hit_mm, seed_mm, p_ot);
}
else if (format == SHORT_ANNOTATED_FORMAT)
{
printf("%s\t%u\t%u\t%c\t%s\t-\t-\t-\n", name, hit_start, hit_end, hit_strand, hit_seq);
}
return (NONCODING);
}
else
{
uint16_t type = 0;
for(i = 0; i < nhits; i++)
{
inf = &hits[i];
if (inf->type == FLANK5) continue;
if (inf->type == FLANK3) continue;
gene_entry_t *gene = find_gene(info, inf->gene);
char regions[MAX_BUFF];
regions[0] = '\0';
regions[1] = '\0';
if (inf->type & EXON) strcat(regions, ",exon");
if (inf->type & CDS) strcat(regions, ",cds");
if (inf->type & UTR5) strcat(regions, ",5'utr");
if (inf->type & UTR3) strcat(regions, ",3'utr");
if (inf->type & INTRON) strcat(regions, ",intron");
if (inf->type & SPLICE) strcat(regions, ",splice");
if (inf->type & FLANK5) strcat(regions, ",5'flank");
if (inf->type & FLANK3) strcat(regions, ",3'flank");
if (inf->type & ENHANCER) strcat(regions, ",enhancer");
if (inf->type & PROMOTER) strcat(regions, ",promoter");
if (inf->type & TSS) strcat(regions, ",tss");
if (inf->type & TTS) strcat(regions, ",tts");
if (inf->type & FIRST_EXON) strcat(regions, ",first_exon");
if (inf->type & LAST_EXON) strcat(regions, ",last_exon");
if (inf->type & CONSTITUTIVE_EXON) strcat(regions, ",constitutive_exon");
if (format == ANNOTATED_FORMAT || (format == EXACT_ANNOTATED_FORMAT && hit_mm == 0))
{
printf("%d\t%s\t%s\t%u\t%u\t%c\t%s\t%d\t%d\t%f\t%s\t%s\t%s\n",
query_no, query_seq,
name, hit_start, hit_end, hit_strand, hit_seq, hit_mm, seed_mm, p_ot,
inf->gene, gene->name, regions+1);
}
else if (format == SHORT_ANNOTATED_FORMAT)
{
printf("%s\t%u\t%u\t%c\t%s\t%s\t%s\t%s\n",
name, hit_start, hit_end, hit_strand, hit_seq,
inf->gene, gene->name, regions+1);
}
type |= inf->type;
}
if (type == 0) /* must be all flanking */
{
if (format == ANNOTATED_FORMAT || (format == EXACT_ANNOTATED_FORMAT && hit_mm == 0))
{
printf("%d\t%s\t%s\t%u\t%u\t%c\t%s\t%d\t%d\t%f\t-\t-\t-\n", query_no, query_seq,name, hit_start, hit_end, hit_strand, hit_seq, hit_mm, seed_mm, p_ot);
}
else if (format == SHORT_ANNOTATED_FORMAT)
{
printf("%s\t%u\t%u\t%c\t%s\t-\t-\t-\n", name, hit_start, hit_end, hit_strand, hit_seq);
}
}
return ((type == 0 || type == INTRON) ? NONCODING : CODING);
}
}
else
{
if (nhits == 0)
{
return (NONCODING);
}
else
{
uint16_t type = 0;
for(i = 0; i < nhits; i++)
{
inf = &hits[i];
if (inf->type & FLANK5) continue;
if (inf->type & FLANK3) continue;
type |= inf->type;
}
return ((type == 0 || type == INTRON) ? NONCODING : CODING);
}
}
}
void populate_cmap()
{
/* create an array for all possible char values, with 4 as the default value */
int i;
for(i = 0; i < 256; i++)
{
cmap[i] = 4;
}
/* fill in the 8 entries we're actually interested in with their two bit values */
cmap['a'] = cmap['A'] = 0; /* 00 */
cmap['c'] = cmap['C'] = 1; /* 01 */
cmap['g'] = cmap['G'] = 2; /* 10 */
cmap['t'] = cmap['T'] = 3; /* 11 */
}
char *bits_to_string(uint64_t text, uint64_t match, int size, char *s)
{
/* have to & 0x3 to turn off all bits but what we actually want. */
int shift = 2*(size-1); /* there are twice as many bits as there are characters */
int i;
/* fill with N if its an error string (all bits set to 1) */
if (text == ERROR_STR)
{
for(i = 0; i < size; i++)
{
s[i] = 'N';
}
s[i] = '\0';
}
/* extract each character from the text */
for (i = 0; i < size; i++, shift -= 2)
{
/* put the character we're interested in at the very end */
/* of the integer, and switch all remaining bits to 0 with & 0x3 */
uint8_t character = (text >> shift) & 0x3;
uint8_t m = (match >> shift) & 0x3;
switch ( character )
{
case 0: s[i] = m ? 'a' : 'A'; break;
case 1: s[i] = m ? 'c' : 'C'; break;
case 2: s[i] = m ? 'g' : 'G'; break;
case 3: s[i] = m ? 't' : 'T'; break;
default: break;
}
}
s[i] = '\0';
return s;
}
uint64_t string_to_bits(const char *seq, int len, int base)
{
/* loop through each character */
/* optionally allow the user to prepend the sequence with a short */
uint64_t bits = base;
int j;
for(j = 0; j < len; j++)
{
uint8_t const c = seq[j]; /* get char */
if ( cmap[c] == 4 )
{
bits = ERROR_STR; /* set to all 1s */
break;
}
else
{
bits <<= 2; /* shift left to make room for new char */
bits |= cmap[c]; /* add our new char to the end */
}
}
return bits;
}
uint64_t rev(uint64_t text, int size)
{
uint64_t reversed = 0;
int shift = 0;
/* now reverse the sequence, 2 bits at a time */
/* could just do shift = 0; shift < size*2; shift += 2 */
int i;
for (i = 0; i < size; i++, shift += 2)
{
reversed <<= 2;
reversed |= ( text >> shift ) & 0x3;
}
return reversed;
}
uint64_t revcom(uint64_t text, int size)
{
/* for a size of 23 we & with 23 1s to undo the complement on the part of */
/* the integer we aren't interested in, for consistency */
/* i.e. set the unused bits back to 0. */
/* assumes size is smaller than sizeof(text)... */
unsigned int num_bits = sizeof(text) * 8;
/* we have to -1 from here to account for the pam_right bit which we DO want flipped */
uint64_t mask = 0xFFFFFFFFFFFFFFFFull >> ( (num_bits - (size * 2)) - 1 );
/* bit complement here maps A -> T, G -> C etc. */
text = ~text & mask;
uint64_t reversed = 0;
int shift = 0;
/* now reverse the sequence, 2 bits at a time */
/* could just do shift = 0; shift < size*2; shift += 2 */
int i;
for (i = 0; i < size; i++, shift += 2)
{
reversed <<= 2;
reversed |= ( text >> shift ) & 0x3;
}
return reversed;
}
int pop_count(uint64_t x)
{
/* as everything is two bit we must convert them all to one bit, */
/* to do this we must turn off all MSBs, but before we can do that */
/* we need to ensure that when an MSB is set to 1, the LSB is also set. */
/* the 4 will change pam_right to 0 so it doesnt get counted. */
/* 5 is 0101, 4 is 0100 */
/* x = (x | (x >> 1)) & (0x5555545555555555ull); */
x = (x | (x >> 1)) & (0x5555555555555555ull);
x = x-( (x>>1) & 0x5555555555555555ull);
x = (x & 0x3333333333333333ull) + ((x >> 2) & 0x3333333333333333ull);
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0full;
return (0x0101010101010101ull*x >> 56);
}
double pam_to_prob(uint64_t u, pam_e pam)
{
int pam_size = pam_sizes[pam];
switch (pam)
{
case NGG:
/* xNN = 00 1111 = 0xF */
u &= 0xFull;
/* xRG = 00 xx10 */
/* xGG = 00 1010 = 0xA */
/* xAG = 00 0010 = 0x2 */
return (u == 0xAull ? 1.0 : 0.2); /* GG = 1.0, AG = 0.2 */
case NGGRRT:
/* xNNNNN = 0011 1111 1111 = 0x3FF */
u &= 0x3FFull;
/* xGG R R T = 0010 10xx xx11 */
/* xGG G G T = 0010 1010 1011 = 0x2AB */
/* xGG A G T = 0010 1000 1011 = 0x28B */
/* xGG G A T = 0010 1010 0011 = 0x2A3 */
/* xGG A A T = 0010 1000 0011 = 0x283 */
/* return (u == 0x2ABull || u == 0x28Bull || u == 0x2A3ull || u == 0x283ull); */
return (1.0);
case NG:
case YG:
case NNG:
case NGCG:
case NGAG:
case NGA:
case NGNG:
case NNGRRT:
case NNGRRW:
case NNNNGATT:
case NNNNGMTT:
case NNAGAAW:
case NGAN:
case NNGRRN:
case NNNNGHTT:
case TTN:
case TTTN:
return (1.0);
case NAG:
return (0.2);
default:
fprintf(stderr, "# Unimplemented PAM: %d\n", pam);
exit(1);
}
}
double match_to_prob(uint64_t match, int size, uint64_t seq, pam_e pam)
{
if (size > 20) size = 20;
int i, shift = 2*(size-1);
double p = 1.0, *ps = &priors[20-size];
for (i = 0; i < size; i++, shift -= 2)
{
uint8_t m = (match >> shift) & 0x3;
if (m)
{
p *= ps[i];
}
}
p *= pam_to_prob(seq, pam);
return (p);
}
void record_match_prob(int query_no, cut_region_e cut_region, double p)
{
/* If this is the first exact match (p=1.0) then do not include p=1.0 - assume this is the intended target */
if (p == 1.0 && !query_exact[query_no])
{
query_exact[query_no] = 1;
return;
}
query_prob[query_no][cut_region] *= 1.0-p;
query_count[query_no][cut_region]++;
/* printf("%d %d %d %f %f\n", query_no, cut_region, query_mismatches[query_no][0], p, query_prob[query_no][cut_region]); */
}
int search(int query_no, uint64_t query, int query_size,
char *name, int num_seqs, entry_t *seqs, int max_size, pam_e pam,
info_t *info,
int max_mismatches, int *mismatches)
{
int off_targets = 0;
int j;
int delta = max_size-query_size;
uint64_t mask = 0xFFFFFFFFFFull >> (2*delta);
uint64_t seed_mask = 0xFFFFFFFFFFull >> (2*(max_size-seed_length));
char query_buff[MAX_BUFF];
char buff[MAX_BUFF];
int pam_size = pam_sizes[pam];
int distPAMcut = pam_distance_to_cut[pam];
side_e pam_side = pam_sides[pam];
char *query_seq = bits_to_string(query, 0ull, query_size, query_buff);
for(j = 0; j < num_seqs; j++)
{
uint64_t s = seqs[j].seq;
/* xor the two bit strings */
if (s & PAM_RIGHT)
{
char strand = (pam_side == LEFT ? '-' : '+');
s >>= 2*pam_size;
s &= mask;
uint64_t match = query ^ s;
int mm = pop_count(match);
if (mm <= max_mismatches)
{
uint64_t seed = match & seed_mask;
int seed_mm = pop_count(seed);
if (!count_only)
{
s = seqs[j].seq;
char *hit_seq;
if (pam_side == RIGHT)
{
hit_seq = bits_to_string(s, match << (2*pam_size), query_size+pam_size, buff);
}
else
{
uint64_t match_rev = rev(match, query_size);
uint64_t seq_rev = revcom(s, query_size+pam_size);
hit_seq = bits_to_string(seq_rev, match_rev, query_size+pam_size, buff);
}
uint32_t hit_start = seqs[j].pos+delta;
uint32_t hit_end = seqs[j].pos+max_size+pam_size-1;
uint32_t cut_pos = seqs[j].pos+max_size-distPAMcut;
if (format == TABLE_FORMAT)
{
printf("%s\t%u\t%u\t+\t%s\t%d\t%d\n", name, hit_start, hit_end, hit_seq, mm, seed_mm);
}
else if (format == ANNOTATED_FORMAT || format == EXACT_ANNOTATED_FORMAT || format == STATS_FORMAT)
{
double p = match_to_prob(match, query_size, seqs[j].seq, pam);
cut_region_e cut_region = find_features(query_no+1, query_seq, name, hit_start, hit_end, strand, hit_seq, mm, seed_mm, p, info, cut_pos);
record_match_prob(query_no, cut_region, p);
}
else
{
printf("%d\t%s\t%u\t+\t%d\t%s\n", query_no, name, hit_start, mm, hit_seq);
}
fflush(stdout);
}
mismatches[mm]++;
query_mismatches[query_no][mm]++;
if (seed_mm <= max_seed_mismatches) bad_seed[query_no]++;
off_targets++;
}
}
else
{
char strand = (pam_side == LEFT ? '+' : '-');
uint64_t query_rev = revcom(query, query_size);
s >>= 2*delta;
s &= mask;
uint64_t match = query_rev ^ s;
int mm = pop_count(match);
if (mm <= max_mismatches)
{
uint64_t match_rev = rev(match, query_size);
uint64_t seed = match_rev & seed_mask;
int seed_mm = pop_count(seed);
if (!count_only)
{
s = seqs[j].seq >> (2*delta);
uint64_t seq_rev = revcom(s, query_size+pam_size);
char *hit_seq;
if (pam_side == RIGHT)
{
hit_seq = bits_to_string(seq_rev, match_rev << (2*pam_size), query_size+pam_size, buff);
}
else
{
hit_seq = bits_to_string(s, match, query_size+pam_size, buff);
}
uint32_t hit_start = seqs[j].pos;
uint32_t hit_end = seqs[j].pos+max_size+pam_size-delta-1;
uint32_t cut_pos = seqs[j].pos+pam_size+distPAMcut;
if (format == TABLE_FORMAT)
{
printf("%s\t%u\t%u\t-\t%s\t%d\t%d\n", name, hit_start, hit_end, hit_seq, mm, seed_mm);
}
else if (format == ANNOTATED_FORMAT || format == EXACT_ANNOTATED_FORMAT || format == STATS_FORMAT)
{
double p = match_to_prob(match_rev, query_size, seq_rev, pam);
cut_region_e cut_region = find_features(query_no+1, query_seq, name, hit_start, hit_end, strand, hit_seq, mm, seed_mm, p, info, cut_pos);
record_match_prob(query_no, cut_region, p);
}
else
{
printf("%d\t%s\t%u\t-\t%d\t%s\n", query_no, name, hit_start, mm, hit_seq);
}
fflush(stdout);
}
mismatches[mm]++;
query_mismatches[query_no][mm]++;
if (seed_mm <= max_seed_mismatches) bad_seed[query_no]++;
off_targets++;
}
}
}
return (off_targets);
}
void *search_thread(void *p)
{
search_data_t *d = (search_data_t *) p;
int query_no;
d->off_targets = 0;
bzero(d->mismatches, sizeof(d->mismatches));
for(query_no = 0; query_no < nqueries; query_no++)
{
d->off_targets += search(query_no, queries[query_no], query_sizes[query_no],
d->name, d->nseqs, d->seqs, d->max_size, d->pam, d->info,
max_mismatches[query_sizes[query_no]], d->mismatches);
}
/*
d->off_targets = search(d->query_no, d->query, d->query_size,
d->name, d->nseqs, d->seqs, d->max_size, d->pam,
d->max_mismatches, d->mismatches);
*/
}
void init_threads()
{
int i;
for(i = 0; i < MAX_THREADS; i++)
{
search_data[i].is_free = TRUE;
}
}
void join_data(int thread_no, int *off_targets, int *mismatches)
{
int index_no = search_data[thread_no].index_no;
off_targets[index_no] += search_data[thread_no].off_targets;
int k;
for(k = 0; k < MAX_SIZE; k++)
{
mismatches[k] += search_data[thread_no].mismatches[k];
}
search_data[thread_no].is_free = TRUE;
}
void join_threads(int nthreads, uint32_t *off_targets, int *mismatches)
{
int thread_no;
for(thread_no = 0; thread_no < nthreads; thread_no++)
{
if (search_data[thread_no].is_free)
{
continue;
}
if (pthread_join(threads[thread_no], NULL) == 0)
{
join_data(thread_no, off_targets, mismatches);
}
}
}
int find_thread(int nthreads, uint32_t *off_targets, int *mismatches)
{
int thread_no = nthreads+1;
while (thread_no >= nthreads)
{
for(thread_no = 0; thread_no < nthreads; thread_no++)
{
if (search_data[thread_no].is_free)
{
return (thread_no);;
}
}
for(thread_no = 0; thread_no < nthreads; thread_no++)
{
if (pthread_tryjoin_np(threads[thread_no], NULL) == 0)
{
join_data(thread_no, off_targets, mismatches);
}
}
}
return (thread_no);
}
void create_thread(int thread_no, search_data_t *d)
{
if (pthread_create(&threads[thread_no], NULL, search_thread, d) != 0)
{
fprintf(stderr, "# Failed to create thread %d\n", thread_no);
exit(1);
}
}
void search_index(int index_no, FILE *fp, char *chr,
int *mismatches, uint32_t *index_off_targets,
int nthreads, pam_e pam,
info_t *info)
{
int nread;
if (nthreads > 1)
{
/* Find free slot */
int thread_no = find_thread(nthreads, index_off_targets, mismatches);
search_data_t *d = &search_data[thread_no];
while ((d->nseqs = fread(d->seqs, sizeof(entry_t), MAX_SEQS, fp)) > 0)
{
d->is_free = FALSE;
d->thread_no = thread_no;
d->index_no = index_no;
d->name = chr;
d->max_size = MAX_SIZE;
d->pam = pam;
d->info = info;
create_thread(thread_no, d);
thread_no = find_thread(nthreads, index_off_targets, mismatches);
d = &search_data[thread_no];
}
}
else
{
while ((nread = fread(seqs, sizeof(entry_t), MAX_SEQS, fp)) > 0)
{
int query_no;
for(query_no = 0; query_no < nqueries; query_no++)
{
index_off_targets[index_no] +=
search(query_no, queries[query_no], query_sizes[query_no],
chr, nread, seqs, MAX_SIZE, pam, info,
max_mismatches[query_sizes[query_no]], mismatches);
}
}
}
}
bool pam_left(uint64_t u, pam_e pam)
{
switch (pam)
{
case NG:
/* Nx = 1100 = 0xC */
u &= 0xCull;
/* Cx = 0100 = 0x4 */
return (u == 0x4ull);
case YG:
/* NN = 1111 = 0xF */
u &= 0xFull;
/* CG = 0110 = 0x6 */
/* CA = 0100 = 0x4 */
return (u == 0x6ull || u == 0x4ull);
case NNG:
/* Nxx = 11 0000 = 0x30 */
u &= 0x30ull;
/* Cxx = 01 0000 = 0x10 */
return (u == 0x10ull);
case NGG:
/* NNx = 11 1100 = 0x3C */
u &= 0x3Cull;
/* CCx = 01 0100 = 0x14 */
/* CTx = 01 1100 = 0x1C */
return (u == 0x14ull || u == 0x1Cull);
case NGGRRT:
/* NNNNNNx = 1111 1111 1100 = 0xFFC */
u &= 0xFFCull;
/* AYYCCx = 00xx xx01 0100 */
/* ACCCCx = 0001 0101 0100 = 0x154 */
/* ACTCCx = 0001 1101 0100 = 0x1D4 */
/* ATCCCx = 0011 0101 0100 = 0x354 */
/* ATTCCx = 0011 1101 0100 = 0x3D4 */
return (u == 0x154ull || u == 0x1D4ull || u == 0x354ull || u == 0x3D4ull);
case NGCG:
/* NNNx = 1111 1100 = 0xFC */
u &= 0xFCull;
/* CGCx = 0110 0100 = 0x64 */
return (u == 0x64ull);
case NGAG:
/* NNNx = 1111 1100 = 0xFC */
u &= 0xFCull;
/* CTCx = 0111 0100 = 0x74 */
return (u == 0x74ull);
case NGA:
/* NNx = 11 1100 = 0x3C */
u &= 0x3Cull;
/* TCx = 11 0100 = 0x34 */
return (u == 0x34ull);
case NGNG:
/* NxNx = 1100 1100 = 0xCC */
u &= 0xCCull;
/* CxCx = 0100 0100 = 0x44 */
return (u == 0x44ull);
case NNGRRT:
/* NNNNxx = 1111 1111 0000 = 0xFF0 */
u &= 0xFF0ull;
/* AYYCxx = 00xx xx01 0000 */
/* ACCCxx = 0001 0101 0000 = 0x150 */
/* ACTCxx = 0001 1101 0000 = 0x1D0 */
/* ATCCxx = 0011 0101 0000 = 0x350 */
/* ATTCxx = 0011 1101 0000 = 0x3D0 */
return (u == 0x150ull || u == 0x1D0ull || u == 0x350ull || u == 0x3D0ull);
case NNGRRW:
/* NNNNxx = 1111 1111 0000 = 0xFF0 */
u &= 0xFF0ull;
/* WYYCxx = 00xx xx01 0000 */
/* ACCCxx = 0001 0101 0000 = 0x150 */
/* ACTCxx = 0001 1101 0000 = 0x1D0 */
/* ATCCxx = 0011 0101 0000 = 0x350 */
/* ATTCxx = 0011 1101 0000 = 0x3D0 */
/* TCCCxx = 1101 0101 0000 = 0xD50 */
/* TCTCxx = 1101 1101 0000 = 0xDD0 */
/* TTCCxx = 1111 0101 0000 = 0xF50 */
/* TTTCxx = 1111 1101 0000 = 0xFD0 */
return (u == 0x150ull || u == 0x1D0ull || u == 0x350ull || u == 0x3D0ull ||
u == 0xD50ull || u == 0xDD0ull || u == 0xF50ull || u == 0xFD0ull);
case NNNNGATT:
/* NNNNxxxx = 1111 1111 0000 0000 = 0xFF00 */
u &= 0xFF00ull;
/* AATCxxxx = 0000 1101 0000 0000 = 0xD00 */
return (u == 0xD00ull);
case NNNNGMTT:
/* NNNNxxxx = FFFF FFFF 0000 0000 = 0xFF00 */
u &= 0xFF00ull;
/* AAKCxxxx = 0000 1101 0000 0000 = 0xD00 */
/* AATCxxxx = 0000 1101 0000 0000 = 0xD00 */
/* AAGCxxxx = 0000 1001 0000 0000 = 0x900 */
return (u == 0xD00ull || u == 0x900ull);
case NNAGAAW:
/* NNNNNxx = 11 1111 1111 0000 = 0x3FF0 */
u &= 0x3FF0ull;
/* WTTCTxx = xx 1111 0111 0000 */
/* ATTCTxx = 00 1111 0111 0000 = 0xF70 */
/* TTTCTxx = 11 1111 0111 0000 = 0x3F70 */
return (u == 0xF70ull || u == 0x3F70ull);
case NAG:
/* NNx = 11 1100 = 0x3C */
u &= 0x3Cull;
/* CTx = 01 1100 = 0x1C */
return (u == 0x1Cull);
case NNNNGHTT:
/* NNNNxxxx = FFFF FFFF 0000 0000 = 0xFF00 */
u &= 0xFF00ull;
/* AADCxxxx = 0000 xx01 0000 0000 = 0xD00 */
/* AATCxxxx = 0000 1101 0000 0000 = 0xD00 */
/* AAGCxxxx = 0000 1001 0000 0000 = 0x900 */
/* AAACxxxx = 0000 0001 0000 0000 = 0x100 */
return (u == 0xD00ull || u == 0x900ull || u == 0x100ull);
case NGAN:
/* xNNx = 0011 1100 = 0x3C */
u &= 0x3Cull;
/* xTCx = 0011 0100 = 0x34 */
return (u == 0x34ull);
case NNGRRN:
/* xNNNxx = 0011 1111 0000 = 0x3F0 */
u &= 0x3F0ull;
/* xYYCxx = 00xx xx01 0000 */
/* xCCCxx = 0001 0101 0000 = 0x150 */
/* xCTCxx = 0001 1101 0000 = 0x1D0 */
/* xTCCxx = 0011 0101 0000 = 0x350 */
/* xTTCxx = 0011 1101 0000 = 0x3D0 */
return (u == 0x150ull || u == 0x1D0ull || u == 0x350ull || u == 0x3D0ull);
case TTN:
/* NNx = 11 1100 = 3C */
u &= 0x3Cull;
/* TTx = 11 1100 = 0x3C */
return (u == 0x3Cull);
case TTTN:
/* NNNx = 1111 1100 = FC */
u &= 0xFCull;
/* TTTx = 1111 1100 = 0xFC */
return (u == 0xFCull);
default:
fprintf(stderr, "# Unimplemented PAM: %d\n", pam);
exit(1);
}
}
bool pam_right(uint64_t u, pam_e pam)
{
switch (pam)
{
case NG:
/* xN = 0011 = 0x3 */
u &= 0x3ull;
/* xG = 00 10 = 0x2 */
return (u == 0x2ull);
case YG:
/* NN = 1111 = 0xF */
u &= 0xFull;
/* CG = 01 10 = 0x6 */
/* TG = 11 10 = 0xE */
return (u == 0x6ull || u == 0xEull);
case NNG:
/* xxN = 00 0011 = 0x3 */
u &= 0x3ull;
/* xxG = 00 0010 = 0x2 */
return (u == 0x2ull);
case NGG:
/* xNN = 00 1111 = 0xF */
u &= 0xFull;
/* xRG = 00 xx10 */
/* xGG = 00 1010 = 0xA */
/* xAG = 00 0010 = 0x2 */
return (u == 0xAull || u == 0x2ull);
case NGGRRT:
/* xNNNNN = 0011 1111 1111 = 0x3FF */
u &= 0x3FFull;
/* xGG R R T = 0010 10xx xx11 */
/* xGG G G T = 0010 1010 1011 = 0x2AB */
/* xGG A G T = 0010 1000 1011 = 0x28B */
/* xGG G A T = 0010 1010 0011 = 0x2A3 */
/* xGG A A T = 0010 1000 0011 = 0x283 */
return (u == 0x2ABull || u == 0x28Bull || u == 0x2A3ull || u == 0x283ull);
case NGCG:
/* xNNN = 0011 1111 = 0x3F */
u &= 0x3Full;
/* xGCG = 0010 0110 = 0x26 */
return (u == 0x26ull);
case NGAG:
/* xNNN = 0011 1111 = 0x3F */
u &= 0x3Full;
/* xGAG = 0010 0010 = 0x22 */
return (u == 0x22ull);
case NGA:
/* xNN = 00 1111 = 0xF */
u &= 0xFull;
/* xGA = 00 1000 = 0x8 */
return (u == 0x8ull);
case NGNG:
/* xNxN = 0011 0011 = 0x33 */
u &= 0x33ull;
/* xGxG = 0010 0010 = 0x22 */
return (u == 0x22ull);
case NNGRRT:
/* xxNNNN = 0000 1111 1111 = 0xFF */
u &= 0xFFull;
/* xxG R R T = 0000 10xx xx11 */
/* xxG G G T = 0000 1010 1011 = 0xAB */
/* xxG A G T = 0000 1000 1011 = 0x8B */
/* xxG G A T = 0000 1010 0011 = 0xA3 */
/* xxG A A T = 0000 1000 0011 = 0x83 */
return (u == 0xABull || u == 0x8Bull || u == 0xA3ull || u == 0x83ull);
case NNGRRW:
/* xxNNNN = 0000 1111 1111 = 0xFF */
u &= 0xFFull;
/* xxG R R W = 0000 10xx xxxx */
/* xxG G G A = 0000 1010 1000 = 0xA8 */
/* xxG A G A = 0000 1000 1000 = 0x88 */
/* xxG G A A = 0000 1010 0000 = 0xA0 */
/* xxG A A A = 0000 1000 0000 = 0x80 */
/* xxG G G T = 0000 1010 1011 = 0xAB */
/* xxG A G T = 0000 1000 1011 = 0x8B */
/* xxG G A T = 0000 1010 0011 = 0xA3 */
/* xxG A A T = 0000 1000 0011 = 0x83 */
return (u == 0xA8ull || u == 0x88ull || u == 0xA0ull || u == 0x80ull ||
u == 0xABull || u == 0x8Bull || u == 0xA3ull || u == 0x83ull);
case NNNNGATT:
/* xxxxNNNN = 0000 0000 1111 1111 = 0xFF */
u &= 0xFFull;
/* xxxxGATT = 0000 0000 1000 1111 = 0x8F */
return (u == 0x8Full);
case NNNNGMTT:
/* xxxxNNNN = 0000 0000 1111 1111 = 0xFF */
u &= 0xFFull;
/* xxxx G M T T = 0000 0000 10xx 1111 = 0x8F */
/* xxxx G A T T = 0000 0000 1000 1111 = 0x8F */
/* xxxx G C T T = 0000 0000 1001 1111 = 0x9F */
return (u == 0x8Full || u == 0x9Full);
case NNAGAAW:
/* xxNNNNN = 00 0011 1111 1111 = 0x3FF */
u &= 0x3FFull;
/* xxA G A A W = 00 0000 1000 00xx */
/* xxA G A A A = 00 0000 1000 0000 = 0x80 */
/* xxA G A A T = 00 0000 1000 0011 = 0x83 */
return (u == 0x80ull || u == 0x83ull);
case NAG:
/* xNN = 00 1111 = 0xF */
u &= 0xFull;
/* xAG = 00 0010 = 0x2 */
return (u == 0x2ull);
case NGAN:
/* xNNx = 0011 1100 = 0x3C */
u &= 0x3Cull;
/* xGAx = 0010 0000 = 0x20 */
return (u == 0x20ull);
case NNGRRN:
/* xxNNNx = 0000 1111 1100 = 0xFC */
u &= 0xFCull;
/* xxG R R x = 0000 10xx xx00 */
/* xxG G G x = 0000 1010 1000 = 0xA8 */
/* xxG A G x = 0000 1000 1000 = 0x88 */
/* xxG G A x = 0000 1010 0000 = 0xA0 */
/* xxG A A x = 0000 1000 0000 = 0x80 */
return (u == 0xA8ull || u == 0x88ull || u == 0xA0ull || u == 0x80ull);
case NNNNGHTT:
/* xxxxNNNN = 0000 0000 1111 1111 = 0xFF */
u &= 0xFFull;
/* xxxx G H T T = 0000 0000 10xx 1111 = 0x8F */
/* xxxx G A T T = 0000 0000 1000 1111 = 0x8F */
/* xxxx G C T T = 0000 0000 1001 1111 = 0x9F */
/* xxxx G T T T = 0000 0000 1011 1111 = 0xBF */
return (u == 0x8Full || u == 0x9Full || u == 0xBFull );
case TTN:
/* xNN = 00 1111 = 0xF */
u &= 0xFull;
/* xAA = 00 0000 = 0x0 */
return (u == 0x0ull);
case TTTN:
/* xNNN = 0011 1111 = 0x3F */
u &= 0x3Full;
/* xAAA = 0000 0000 = 0x0 */
return (u == 0x0ull);
default:
fprintf(stderr, "# Unimplemented PAM: %d\n", pam);
exit(1);
}
}
pam_e string_to_pam(char *s)
{
if (strcasecmp(s, "NGG") == 0) { return (NGG); }
else if (strcasecmp(s, "NGCG") == 0) { return (NGCG); }
else if (strcasecmp(s, "NGAG") == 0) { return (NGAG); }
else if (strcasecmp(s, "NGAN") == 0) { return (NGAN); }
else if (strcasecmp(s, "NNGRRT") == 0) { return (NNGRRT); }
else if (strcasecmp(s, "NNGRRN") == 0) { return (NNGRRN); }
else if (strcasecmp(s, "NNAGAAW") == 0) { return (NNAGAAW); }
else if (strcasecmp(s, "NNNNGHTT") == 0) { return (NNNNGHTT); }
else if (strcasecmp(s, "NAG") == 0) { return (NAG); }
else if (strcasecmp(s, "NGA") == 0) { return (NGA); }
else if (strcasecmp(s, "NGNG") == 0) { return (NGNG); }
else if (strcasecmp(s, "NGGRRT") == 0) { return (NGGRRT); }
else if (strcasecmp(s, "NNGRRW") == 0) { return (NNGRRW); }
else if (strcasecmp(s, "NNNNGATT") == 0) { return (NNNNGATT); }
else if (strcasecmp(s, "NNNNGMTT") == 0) { return (NNNNGMTT); }
else if (strcasecmp(s, "TTN") == 0) { return (TTN); }
else if (strcasecmp(s, "TTTN") == 0) { return (TTTN); }
else if (strcasecmp(s, "NG") == 0) { return (NG); }
else if (strcasecmp(s, "YG") == 0) { return (YG); }
else if (strcasecmp(s, "NNG") == 0) { return (NNG); }
else
{
fprintf(stderr, "# %s: unimplemented PAM\n", prog, s);
exit(1);
}
}
char *pam_to_string(pam_e pam)
{
switch (pam)
{
case NGG: return ("NGG");
case NGGRRT: return ("NGGRRT");
case NGCG: return ("NGCG");
case NGAG: return ("NGAG");
case NGA: return ("NGA");
case NGNG: return ("NGNG");
case NNGRRT: return ("NNGRRT");
case NNGRRW: return ("NNGRRW");
case NNNNGATT: return ("NNNNGATT");
case NNNNGMTT: return ("NNNNGMTT");
case NNAGAAW: return ("NNAGAAW");
case NAG: return ("NAG");
case NGAN: return ("NGAN");
case NNGRRN: return ("NNGRRN");
case NNNNGHTT: return ("NNNNGHTT");
case TTN: return ("TTN");
case TTTN: return ("TTTN");
case NG: return ("NG");
case YG: return ("YG");
case NNG: return ("NNG");
default:
fprintf(stderr, "# Unimplemented PAM: %d\n", pam);
exit(1);
}
}
void index_file(FILE *fp, char *out_dir, int max_size, pam_e pam)
{
FILE *out_fp = NULL;
char *line;
char buffer[MAX_BUFF];
char name[MAX_BUFF];
char filename[MAX_BUFF];
int n = 0;
uint32_t pos = 0;
uint64_t u = 0;
int nu = 0;
int nseqs = 0;
int tot_seqs = 0;
int pam_size = pam_sizes[pam];
uint64_t all_mask = 0xFFFFFFFFFFFFFFFFull >> (64 - 2*(max_size+pam_size-1));
name[0] = '\0';
while (line = fgets(buffer, MAX_BUFF, fp))
{
size_t len = strlen(line);
line[--len] = '\0';
if (line[0] == '>')
{
if (out_fp)
{
if (nseqs > 0)
{
fwrite(&seqs, sizeof(entry_t), nseqs, out_fp);
}
fclose(out_fp);
fprintf(stderr, "%d bases, %d sequences\n", n, tot_seqs);
}
strcpy(name, line+1);
char *p = strchr(name, ' ');
if (p) { *p = '\0'; }
p = strchr(name, '\t');
if (p) { *p = '\0'; }
if (strncmp(name, "chr", 3) == 0)
{
sprintf(filename, "%s/%s.inx", out_dir, name);
}
else
{
sprintf(filename, "%s/chr%s.inx", out_dir, name);
}
out_fp = fopen(filename, "w");
if (!out_fp)
{
fprintf(stderr, "can't open index file %s for output\n", filename);
exit(1);
}
tot_seqs = 0;
nseqs = 0;
pos = 0;
n = 0;
fprintf(stderr, "%s ... ", name);
/* Header */
fwrite(&pam, sizeof(pam_e), 1, out_fp);
}
else
{
int i;
for(i = 0; i < len; i++)
{
char c = line[i];
if (cmap[c] == 4)
{
u = 0;
nu = 0;
}
else
{
u <<= 2;
u |= cmap[c];
nu++;
}
if (nu == max_size + pam_size)
{
/*
fprintf(stderr, "%d %20.20s %ld\n", pos+i+1, bits_to_string(u, max_size), u);
*/
if (pam_left(u >> (2*max_size), pam))
{
/* fprintf(stderr, "L %d %26.26s %ld\n", pos+i-max_size-pam_size+2, bits_to_string(u, max_size+2*pam_size), u); */
seqs[nseqs].pos = pos+i-max_size-pam_size+2;
seqs[nseqs].seq = u;
nseqs++;
tot_seqs++;
if (nseqs == MAX_SEQS)
{
fwrite(&seqs, sizeof(entry_t), MAX_SEQS, out_fp);
nseqs = 0;
}
}
if (pam_right(u, pam))
{
/* fprintf(stderr, "R %d %26.26s %ld\n", pos+i-max_size-pam_size+2, bits_to_string(u, max_size+2*pam_size), u); */
seqs[nseqs].pos = pos+i-max_size-pam_size+2;
seqs[nseqs].seq = u | PAM_RIGHT;
nseqs++;
tot_seqs++;
if (nseqs == MAX_SEQS)
{
fwrite(&seqs, sizeof(entry_t), MAX_SEQS, out_fp);
nseqs = 0;
}
}
u &= all_mask;
nu--;
}
}
pos += len;
n += len;
}
}
if (nseqs > 0)
{
fwrite(&seqs, sizeof(entry_t), nseqs, out_fp);
}
fclose(out_fp);
fprintf(stderr, "%d bases, %d sequences\n", n, tot_seqs);
}
void usage()
{
fprintf(stderr,
"Usage: %s command [options]\n\
\n\
%s index [-out D] F.fa\n\
-out D\n\
Output directory for .inx files. Default current directory.\n\
-pam (NGG|NGGRRT|...)\n\
PAM sequence to index.\n\
\n\
%s query [options] F.inx ...\n\
-seq Q\n\
Query sequence - max 20bp - without PAM.\n\
-list F\n\
File of query sequences - one per line.\n\
-count_only\n\
Only count numbers of hits per query sequence.\n\
-mismatch L N\n\
Allow N mismatches for queries of length L.\n\
May be repeated for different lengths. Default 0 mismatches.\n\
-seed L N\n\
Count hits with <= N mismatches in the seed region of length L as \"bad\".\n\
May be repeated for different lengths. Default 8 and 2.\n\
-n N\n\
Use N cores to do the search. Default 1.\n\
-format (table|gff|annotated|stats)\n\
Output format. Default gff.\n\
-info D\n\
Direcory containing .info and .genes files.\n\
-quiet\n\
Don't output progress.\n\
\n\
%s region -chr C -start N -end N -index D [-info D]\n\
-index D\n\
Direcory containing .inx files.\n\
-info D\n\
Direcory containing .info and .genes files.\n\
-chr C\n\
Chromosome.\n\
-start N\n\
Start position.\n\
-end N\n\
End position.\n\
-format (table|gff|annotated)\n\
Output format. Default gff.\n\
", prog, prog, prog, prog);
exit(1);
}
int index_main(int argc, char *argv[])
{
char *out_dir = ".";
int i, j;
int nindexes = 0;
pam_e pam = NGG;
for(i = 2; i < argc; i++)
{
char *arg = argv[i];
if (strcmp(arg, "-out") == 0 && i+1 < argc)
{
struct stat sb;
out_dir = argv[++i];
if (stat(out_dir, &sb) == 0 && S_ISDIR(sb.st_mode))
{
/* exists already */
}
else if (mkdir(out_dir, 0755))
{
fprintf(stderr, "%s: %s can't be created\n", prog, out_dir);
perror(out_dir);
exit(1);
}
if (access(out_dir, W_OK) != 0)
{
fprintf(stderr, "%s: %s is not writable\n", prog, out_dir);
exit(1);
}
}
else if (strcmp(arg, "-pam") == 0 && i+1 < argc)
{
pam = string_to_pam(argv[++i]);
}
else if (arg[0] == '-')
{
fprintf(stderr, "%s: bad index argument %s\n", prog, arg);
usage();
}
else
{
FILE *fp = fopen(arg, "r");
if (fp)
{
index_file(fp, out_dir, MAX_SIZE, pam);
fclose(fp);
nindexes++;
}
else
{
fprintf(stderr, "%s: can't open fasta file: %s\n", prog, arg);
exit(1);
}
}
}
if (nindexes == 0)
{
usage();
}
}
info_t *read_info(char *info_dir, char *index_file, char *chr)
{
char info_file[MAX_BUFF];
if (strncmp(chr, "chr", 3) == 0)
{
chr += 3;
}
if (info_dir)
{
sprintf(info_file, "%s/chr%s.info", info_dir, chr);
}
else
{
strcpy(info_file, index_file);
strcpy(&info_file[strlen(info_file)-1], "fo");
}
info_t *info = NULL;
FILE *info_fp = fopen(info_file, "r");
if (info_fp)
{
info = read_feature_info(info_fp);
fclose(info_fp);
if (info_dir)
{
sprintf(info_file, "%s/chr%s.genes", info_dir, chr);
}
else
{
strcpy(info_file, index_file);
strcpy(&info_file[strlen(info_file)-3], "genes");
}
info_fp = fopen(info_file, "r");
if (info_fp)
{
read_gene_info(info_fp, info);
fclose(info_fp);
}
}
return (info);
}
int query_main(int argc, char *argv[])
{
int i, j;
char *info_dir = NULL;
int quiet = FALSE, header_printed = FALSE;
uint32_t mismatches[MAX_SIZE+1];
int nthreads = 1;
int nindexes = 0;
char *indexes[MAX_INDEXES];
uint32_t index_off_targets[MAX_INDEXES];
for(i = 0; i <= MAX_SIZE; i++)
{
mismatches[i] = 0;
max_mismatches[i] = 0;
}
bzero(query_mismatches, sizeof(query_mismatches));
bzero(query_exact, sizeof(query_exact));
bzero(bad_seed, sizeof(bad_seed));
init_threads();
for(i = 2; i < argc; i++)
{
char *arg = argv[i];
if (strcmp(arg, "-count_only") == 0)
{
count_only = TRUE;
}
else if (strcmp(arg, "-quiet") == 0)
{
quiet = TRUE;
}
else if (strcmp(arg, "-n") == 0 && i+1 < argc)
{
int n = atoi(argv[++i]);
if (n > 0 && n <= MAX_THREADS)
{
nthreads = n;
}
}
else if (strcmp(arg, "-seed") == 0 && i+2 < argc)
{
int n = atoi(argv[++i]);
int m = atoi(argv[++i]);
if (n >= 0 && n <= MAX_SIZE)
{
if (m >= 0 && m <= n)
{
seed_length = n;
max_seed_mismatches = m;
}
else
{
fprintf(stderr, "# %s: bad seed mismatches (%s), option ignored\n", prog, argv[i]);
}
}
else
{
fprintf(stderr, "# %s: bad seed length (%s), option ignored\n", prog, argv[i-1]);
}
}
else if (strcmp(arg, "-mismatch") == 0 && i+2 < argc)
{
int n = atoi(argv[++i]);
int m = atoi(argv[++i]);
if (n >= 0 && n <= MAX_SIZE && m >= 0 && m < MAX_SIZE)
{
if (n == 0)
{
int k;
for(k = 1; k <= MAX_SIZE; k++)
{
max_mismatches[k] = m;
}
}
else
{
max_mismatches[n] = m;
}
}
else if (n > MAX_SIZE && m >=0 && m < n)
{
max_mismatches[MAX_SIZE] = m;
}
}
else if (strcmp(arg, "-format") == 0 && i+1 < argc)
{
arg = argv[++i];
if (strcmp(arg, "gff") == 0)
{
format = GFF_FORMAT;
}
else if (strcmp(arg, "table") == 0)
{
format = TABLE_FORMAT;
}
else if (strcmp(arg, "annotated") == 0)
{
format = ANNOTATED_FORMAT;
}
else if (strcmp(arg, "exact_annotated") == 0)
{
format = EXACT_ANNOTATED_FORMAT;
}
else if (strcmp(arg, "stats") == 0)
{
format = STATS_FORMAT;
}
else
{
fprintf(stderr, "# %s: %s is not a valid format\n", prog, arg);
exit(1);
}
}
else if (strcmp(arg, "-list") == 0 && i+1 < argc)
{
char *query_file = argv[++i];
FILE *fp = fopen(query_file, "r");
if (fp)
{
char *line;
char buffer[MAX_BUFF];
while (nqueries < MAX_QUERIES && (line = fgets(buffer, MAX_BUFF, fp)))
{
size_t len = strlen(line);
line[--len] = '\0';
if (len > MAX_SIZE)
{
line += len-MAX_SIZE;
len = MAX_SIZE;
}
query_sizes[nqueries] = len;
query_prob[nqueries][NONCODING] = 1.0;
query_prob[nqueries][CODING] = 1.0;
query_count[nqueries][NONCODING] = 0;
query_count[nqueries][CODING] = 0;
queries[nqueries++] = string_to_bits(line, len, 0);
}
fclose(fp);
if (nqueries == MAX_QUERIES)
{
fprintf(stderr, "# %s: warning: maximum number of queries (%d) reached\n", prog, MAX_QUERIES);
}
}
else
{
fprintf(stderr, "# %s: can't open query file: %s\n", prog, query_file);
exit(1);
}
}
else if (strcmp(arg, "-seq") == 0 && i+1 < argc)
{
char *query_seq = argv[++i];
int len = strlen(query_seq);
if (len > MAX_SIZE)
{
query_seq += len-MAX_SIZE;
len = MAX_SIZE;
}
if (nqueries < MAX_QUERIES)
{
query_sizes[nqueries] = len;
query_prob[nqueries][NONCODING] = 1.0;
query_prob[nqueries][CODING] = 1.0;
query_count[nqueries][NONCODING] = 0;
query_count[nqueries][CODING] = 0;
queries[nqueries++] = string_to_bits(query_seq, len, 0);
}
}
else if (strcmp(arg, "-info") == 0 && i+1 < argc)
{
struct stat sb;
info_dir = argv[++i];
if (stat(info_dir, &sb) == 0 && S_ISDIR(sb.st_mode))
{
/* exists already */
}
else
{
fprintf(stderr, "# %s: %s doesn't exist or is not a directory\n", prog, info_dir);
exit(1);
}
if (access(info_dir, R_OK) != 0)
{
fprintf(stderr, "# %s: %s is not readable\n", prog, info_dir);
exit(1);
}
}
else if (strcmp(&arg[ strlen(arg)-4], ".inx") == 0)
{
if (nqueries == 0)
{
fprintf(stderr, "# %s: no queries: %s skipped\n", prog, arg);
continue;
}
if (nindexes >= MAX_INDEXES)
{
fprintf(stderr, "# %s: too many indexes: %s skipped\n", prog, arg);
continue;
}
if ((format == ANNOTATED_FORMAT || format == EXACT_ANNOTATED_FORMAT) && !info_dir)
{
fprintf(stderr, "# %s: warning annotated format specified but no -info\n", prog);
}
if (!header_printed && !count_only)
{
if (format == TABLE_FORMAT)
{
printf("Chr\tStart\tEnd\tStrand\tHitSeq\tHitMismatches\tSeedMismatches\n");
fflush(stdout);
}
else if (format == ANNOTATED_FORMAT || format == EXACT_ANNOTATED_FORMAT)
{
printf("QueryNo\tQuerySeq\tChr\tStart\tEnd\tStrand\tHitSeq\tHitMismatches\tSeedMismatches\tpOffTarget\tGeneID\tGeneSymbol\tGeneRegion\n");
fflush(stdout);
}
header_printed = TRUE;
}
char *s, chr[MAX_BUFF];
if (s = strrchr(arg, '/'))
{
strcpy(chr, s+1);
}
else
{
strcpy(chr, arg);
}
chr[ strlen(chr)-4 ] = '\0';
int index_no = nindexes++;
/* s = (strncmp(chr, "chr", 3) == 0 ? &chr[3] : chr);
indexes[index_no] = strdup(s); */
indexes[index_no] = strdup(chr);
index_off_targets[index_no] = 0;
FILE *fp = fopen(arg, "r");
if (fp)
{
/* Header */
pam_e pam;
fread(&pam, sizeof(pam_e), 1, fp);
if (!quiet)
{
fprintf(stderr, "# Searching %s (%s, PAM %s) ...\n", arg, indexes[index_no], pam_to_string(pam));
}
info_t *info = read_info(info_dir, arg, chr);
search_index(index_no, fp, indexes[index_no],
mismatches, index_off_targets,
nthreads, pam, info);
}
else
{
fprintf(stderr, "# %s: can't open index file: %s\n", prog, arg);
exit(1);
}
}
else
{
fprintf(stderr, "# %s: bad query argument %s\n", prog, arg);
exit(1);
}
}
/*if (nqueries > 0)*/
{
if (nthreads > 1)
{
join_threads(nthreads, index_off_targets, mismatches);
}
FILE *out_fp = (count_only ? stdout : stderr);
uint32_t tot_off_targets = 0;
for(i = 0; i < nindexes; i++)
{
if (index_off_targets[i] > 0)
{
if (!quiet)
{
fprintf(out_fp, "# %s: %u off targets\n", indexes[i], index_off_targets[i]);
}
tot_off_targets += index_off_targets[i];
}
}
int max_mm = 0;
uint32_t tot_mismatches[MAX_SIZE+1];
char buff[MAX_BUFF];
for(j = 0; j <= MAX_SIZE; j++)
{
if (max_mismatches[j] > max_mm) max_mm = max_mismatches[j];
tot_mismatches[j] = 0;
}
if (!quiet)
{
fprintf(out_fp, "# Total: %u off targets\n", tot_off_targets);
}
fprintf(out_fp, "QueryNo\tQuery\tQuerySize\tpCoding\tnCoding\tpNonCoding\tnNonCoding\tnBadSeed");
for(j = 0; j <= max_mm; j++)
{
fprintf(out_fp, "\t%u", j);
}
fprintf(out_fp, "\n");
for(i = 0; i < nqueries; i++)
{
fprintf(out_fp, "%d\t%s\t%d\t%g\t%d\t%g\t%d\t%d", i+1,
bits_to_string(queries[i], 0ull, query_sizes[i], buff),
query_sizes[i],
1-query_prob[i][CODING],
query_count[i][CODING],
1-query_prob[i][NONCODING],
query_count[i][NONCODING],
bad_seed[i]);
for(j = 0; j <= max_mm; j++)
{
fprintf(out_fp, "\t%u", query_mismatches[i][j]);
tot_mismatches[j] += query_mismatches[i][j];
}
fprintf(out_fp, "\n");
}
if (!quiet)
{
fprintf(out_fp, "\tTotal\t\t\t\t\t\t");
for(i = 0; i <= max_mm; i++)
{
fprintf(out_fp, "\t%u", mismatches[i]);
if (mismatches[i] != tot_mismatches[i])
{
fprintf(out_fp, "/%u", tot_mismatches[i]);
}
}
fprintf(out_fp, "\n");
}
}
/*
else
{
usage(prog);
}
*/
}
int region_main(int argc, char *argv[])
{
int i, j;
int nindexes = 0;
char *indexes[MAX_INDEXES];
int index_off_targets[MAX_INDEXES];
char *chr = NULL;
uint32_t start = 1, end = 1000000000;
char *index_dir = NULL, *info_dir = NULL;
format = GFF_FORMAT;
for(i = 2; i < argc; i++)
{
char *arg = argv[i];
if (strcmp(arg, "-index") == 0 && i+1 < argc)
{
struct stat sb;
index_dir = argv[++i];
if (stat(index_dir, &sb) == 0 && S_ISDIR(sb.st_mode))
{
/* exists already */
}
else
{
fprintf(stderr, "%s: %s doesn't exist or is not a directory\n", prog, index_dir);
exit(1);
}
if (access(index_dir, R_OK) != 0)
{
fprintf(stderr, "%s: %s is not readable\n", prog, index_dir);
exit(1);
}
}
else if (strcmp(arg, "-info") == 0 && i+1 < argc)
{
struct stat sb;
info_dir = argv[++i];
if (stat(info_dir, &sb) == 0 && S_ISDIR(sb.st_mode))
{
/* exists already */
}
else
{
fprintf(stderr, "%s: %s doesn't exist or is not a directory\n", prog, info_dir);
exit(1);
}
if (access(info_dir, R_OK) != 0)
{
fprintf(stderr, "%s: %s is not readable\n", prog, info_dir);
exit(1);
}
}
else if (strcmp(arg, "-format") == 0 && i+1 < argc)
{
arg = argv[++i];
if (strcmp(arg, "gff") == 0)
{
format = GFF_FORMAT;
}
else if (strcmp(arg, "table") == 0)
{
format = TABLE_FORMAT;
printf("Chr\tStart\tEnd\tStrand\tHitSeq\n");
fflush(stdout);
}
else if (strcmp(arg, "annotated") == 0)
{
format = SHORT_ANNOTATED_FORMAT;
printf("Chr\tStart\tEnd\tStrand\tHitSeq\tGeneID\tGeneSymbol\tGeneRegion\n");
fflush(stdout);
}
else
{
fprintf(stderr, "%s: %s is not a valid format\n", prog, arg);
exit(1);
}
}
else if (strcmp(arg, "-chr") == 0 && i+1 < argc)
{
chr = argv[++i];
if (strncmp(chr, "chr", 3) == 0)
{
chr += 3;
}
}
else if (strcmp(arg, "-start") == 0 && i+1 < argc)
{
start = atoi(argv[++i]);
}
else if (strcmp(arg, "-end") == 0 && i+1 < argc)
{
end = atoi(argv[++i]);
}
}
if (chr && start > 0 && end > start && index_dir)
{
if (format == SHORT_ANNOTATED_FORMAT && !info_dir)
{
fprintf(stderr, "# %s: warning annotated format specified but no -info\n", prog);
}
char index_file[MAX_BUFF];
sprintf(index_file, "%s/chr%s.inx", index_dir, chr);
FILE *fp = fopen(index_file, "r");
if (fp)
{
info_t *info = read_info(info_dir, index_file, chr);
pam_e pam;
fread(&pam, sizeof(pam_e), 1, fp);
int pam_size = pam_sizes[pam];
side_e pam_side = pam_sides[pam];
int nseqs = 0;
while ((nseqs = fread(seqs, sizeof(entry_t), MAX_SEQS, fp)) > 0)
{
int first_pos = seqs[0].pos;
int last_pos = seqs[nseqs-1].pos;
if (start < last_pos && end > first_pos)
{
int j;
for(j = 0; j < nseqs; j++)
{
uint32_t pos = seqs[j].pos;
uint64_t seq = seqs[j].seq;
char buff[MAX_BUFF];
if (start <= pos+MAX_SIZE+pam_size && pos <= end)
{
char strand = (seq & PAM_RIGHT) ? '+' : '-';
int cr_start = pos, cr_end = cr_start+MAX_SIZE+pam_size-1;
if (format == GFF_FORMAT)
{
int pam_start, pam_end, c_start, c_end;
if (strand == '+')
{
pam_start = cr_end-pam_size+1;
pam_end = cr_end;
c_start = cr_start;
c_end = cr_end-pam_size;
}
else if (strand == '-')
{
pam_start = cr_start;
pam_end = cr_start+pam_size-1;
c_start = cr_start+pam_size;
c_end = cr_end;
}
if (pam_side == LEFT)
{
FLIP(strand);
}
if (strand == '-')
{
seq = revcom(seq, MAX_SIZE+pam_size);
}
char *s = bits_to_string(seq, 0, MAX_SIZE+pam_size, buff);
printf("chr%s\tWGE\tCrispr\t%d\t%d\t.\t%c\t.\tID=C%d;Name=%d;PAM=%s;Seq=%s;OT_Summary={}\n",
chr, cr_start, cr_end, strand, j, j, pam_to_string(pam), s);
printf("chr%s\tWGE\tCDS\t%d\t%d\t.\t%c\t.\tID=Cr%d;Parent=C%d;Name=%d;color=#45A825\n",
chr, c_start, c_end, strand, j, j, j);
printf("chr%s\tWGE\tCDS\t%d\t%d\t.\t%c\t.\tID=PAM%d;Parent=C%d;Name=%d;color=#1A8599\n",
chr, pam_start, pam_end, strand, j, j, j);
}
else if (format == TABLE_FORMAT)
{
if ((strand == '-' && pam_side == RIGHT) ||
(strand == '+' && pam_side == LEFT))
{
/* Flip so the PAM is always forward */
seq = revcom(seq, MAX_SIZE+pam_size);
}
if (pam_side == LEFT)
{
FLIP(strand);
}
printf("chr%s\t%d\t%d\t%c\t%s\n",
chr, cr_start, cr_end, strand,
bits_to_string(seq, 0, MAX_SIZE+pam_size, buff));
fflush(stdout);
}
else if (format == SHORT_ANNOTATED_FORMAT)
{
uint32_t distPAMcut = pam_distance_to_cut[pam];
uint32_t cut_pos = cr_start+MAX_SIZE-distPAMcut;
if ((strand == '-' && pam_side == RIGHT) ||
(strand == '+' && pam_side == LEFT))
{
/* Flip so the PAM is always forward */
seq = revcom(seq, MAX_SIZE+pam_size);
cut_pos = cr_start+pam_size+distPAMcut;
}
if (pam_side == LEFT)
{
FLIP(strand);
}
char *hit_seq = bits_to_string(seq, 0, MAX_SIZE+pam_size, buff);
find_features(-1, "", chr, cr_start, cr_end, strand, hit_seq, -1, -1, -1.0, info, cut_pos);
fflush(stdout);
}
}
}
}
else if (first_pos > end)
{
/* printf("break %d %d - %d\n", nseqs, first_pos, last_pos); */
break;
}
}
fclose(fp);
}
}
else
{
usage();
}
}
int main(int argc, char *argv[])
{
int i, j;
prog = argv[0];
populate_cmap();
if (argc < 2)
{
usage();
}
else if (strcmp(argv[1], "index") == 0)
{
index_main(argc, argv);
}
else if (strcmp(argv[1], "query") == 0)
{
query_main(argc, argv);
}
else if (strcmp(argv[1], "region") == 0)
{
region_main(argc, argv);
}
else
{
fprintf(stderr, "# %s: unknown command: %s\n", prog, argv[1]);
usage();
}
exit(0);
}
|
the_stack_data/1112904.c | #include <stdio.h>
int main() {
int A, B, C, MaiorAB;
scanf("%d %d %d", &A, &B, &C);
MaiorAB = (A+B+abs(A-B))/2;
MaiorAB = (C+MaiorAB+abs(MaiorAB-C))/2;
printf("%d eh o maior\n",MaiorAB);
return 0;
}
|
the_stack_data/104097.c | #include<stdio.h>
main(){
printf("%s","hello,world\c");
return 0;
}
|
the_stack_data/4869.c | //<math.h>
//example shows the usage of acos() function.
#include <stdio.h>
#include <math.h>
#define PI 3.14159265
int main () {
double x, ret, val;
x = 0.9;
val = 180.0 / PI;
ret = acos(x) * val;
printf("The arc cosine of %lf is %lf degrees", x, ret);
return(0);
}
|
the_stack_data/6386539.c | // no output from test machine
// https://syzkaller.appspot.com/bug?id=28bc35dd6f026b2878e30804670f6f0c39932f16
// status:open
// autogenerated by syzkaller (http://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <fcntl.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <string.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <unistd.h>
static uintptr_t syz_open_dev(uintptr_t a0, uintptr_t a1, uintptr_t a2)
{
if (a0 == 0xc || a0 == 0xb) {
char buf[128];
sprintf(buf, "/dev/%s/%d:%d", a0 == 0xc ? "char" : "block", (uint8_t)a1,
(uint8_t)a2);
return open(buf, O_RDWR, 0);
} else {
char buf[1024];
char* hash;
strncpy(buf, (char*)a0, sizeof(buf) - 1);
buf[sizeof(buf) - 1] = 0;
while ((hash = strchr(buf, '#'))) {
*hash = '0' + (char)(a1 % 10);
a1 /= 10;
}
return open(buf, a2, 0);
}
}
static uintptr_t syz_open_procfs(uintptr_t a0, uintptr_t a1)
{
char buf[128];
memset(buf, 0, sizeof(buf));
if (a0 == 0) {
snprintf(buf, sizeof(buf), "/proc/self/%s", (char*)a1);
} else if (a0 == (uintptr_t)-1) {
snprintf(buf, sizeof(buf), "/proc/thread-self/%s", (char*)a1);
} else {
snprintf(buf, sizeof(buf), "/proc/self/task/%d/%s", (int)a0, (char*)a1);
}
int fd = open(buf, O_RDWR);
if (fd == -1)
fd = open(buf, O_RDONLY);
return fd;
}
uint64_t r[4] = {0xffffffffffffffff, 0xffffffffffffffff, 0xffffffffffffffff,
0xffffffffffffffff};
void loop()
{
long res = 0;
memcpy((void*)0x200000c0, "/dev/loop#", 11);
res = syz_open_dev(0x200000c0, 4, 0);
if (res != -1)
r[0] = res;
memcpy((void*)0x20000100, "/dev/loop#", 11);
res = syz_open_dev(0x20000100, 0, 0);
if (res != -1)
r[1] = res;
memcpy((void*)0x20000140, "/dev/loop#", 11);
res = syz_open_dev(0x20000140, 4, 2);
if (res != -1)
r[2] = res;
memcpy((void*)0x20000280, "net/raw", 8);
res = syz_open_procfs(0, 0x20000280);
if (res != -1)
r[3] = res;
syscall(__NR_ioctl, r[0], 0x4c00, r[3]);
syscall(__NR_ioctl, r[0], 0x4c06, r[2]);
syscall(__NR_ioctl, r[1], 0x4c00, r[0]);
}
int main()
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
loop();
return 0;
}
|
the_stack_data/159515387.c | //Librerias Utilizadas
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <string.h>
//Definici�n de varibles globales
#define true 1
#define false 0
typedef char bool;
//Firmas de las funciones utilizadas.
bool esPrimo(int n);
void insercion(int *vec, int cont);
void unir(char*nameFile,int nprocesos);
//Programa Principal.
int main(int argc, char *argv[]){
//Varibles Locales
int status,nprocesos,N,cuantos,rango;
pid_t childpid;
char str[12];
//Comando de ayuda
if(argc==2 && strcmp(argv[1],"-h")==0){
printf("El programa calcula los primos usando procesos concurrentes.\nModo de uso: L�mite_Superior_Primos N�mero_Procesos archivo_salida \n" );
exit(0);
}
//Control de Errores de los argumentos de entrada.
if(argc<4) {
perror("Error");
printf("Invocaci�n err�nea, faltan los argumentos. \n");
exit(0);
}
if(argc>4) {
perror("Error");
printf("Invocaci�n err�nea, sobran argumentos. \n");
exit(0);
}
N=atoi(argv[1]);
nprocesos = atoi(argv[2]);
cuantos= N/nprocesos;
//Control de errores cuando cantidad de procesos sea mayor a cantidad de primos.
if(cuantos==0){
perror("Error");
printf("El n�mero de procesos es mayor al n�mero de primos a calcular.\n");
exit(0);
}
//Revisa que los archivos de salida para cada proceso no existen para evitar sobreescribir.
for(int i=0;i<nprocesos;i++){
char buffer[80]={0};
sprintf(buffer, "p%02d.txt", i);
FILE*file2=fopen(buffer,"r");
if(file2!=NULL){
remove(buffer);
}
}
//Creaci�n de Procesos
for (int i = 0; i < nprocesos; ++i) {
//Calculo de rango para cada hijo.
int min=i*cuantos+1;
int max=min+cuantos;
//Control de errores cuando se creen hijos.
if ((childpid = fork()) < 0) {
perror("fork:");
exit(1);
}
if(childpid==0){
//C�digo primos para cada hijo
while(min>0 && min<max){
if(esPrimo(min)){
char buffer[80]={0};
sprintf(buffer, "p%02d.txt", i);//Crea el nombre del archivo para el proceso.
FILE*file2=fopen(buffer,"a+");//Guarda el primo en el archivo respectivo.
fprintf(file2,"%d\n",min);
fclose(file2);
}
min++;
}
exit(0);
}
}
//El padre espera que sus hijos terminen de ejecutarse.
while ((childpid = wait(&status)) != -1);
//Llama la funci�n para unir los archivos en uno solo.
unir(argv[3],nprocesos);
printf ("El programa busca e imprime en el archivo %s los primos que se encuentran entre 1 y %s. Debe dividir el dominio de b�squeda entre %s procesos.\n", argv[3], argv[1], argv[2]);
}
//Une los archivos que cada proceso creo, en un solo archivo de salida.
//Recibe por par�metro el nombre del archivo final y la cantidad de procesos creados.
void unir(char*nameFile,int nprocesos){
FILE*filefin=fopen(nameFile,"w");
int j=0;
for(int i=0;i<nprocesos;i++){
char buffer[80]={0};
sprintf(buffer, "p%02d.txt", i);
FILE*file2=fopen(buffer,"r");
if(file2!=NULL){
while(!feof(file2)){
char cadena[256];
while(fgets(cadena,256,file2)!=NULL){
fprintf(filefin, "%s",cadena);
j++;
}
}
}
remove(buffer);
}
//Se cierra el archivo.
fclose(filefin);
printf("%d\n",j );
}
//M�todo para comprobar que un n�mero sea primo.
//Recibe un Entero como par�metro.
bool esPrimo(int n){
int i;
if(n == 2)
return true;
if(n%2 == 0 || n==1 )
return false;
for(i=2; i<=n/2; i++){
if(n%i == 0)
return false;
}
return true;
}
|
the_stack_data/172811.c | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
struct node {
int data;
struct node *left;
struct node *right;
};
struct node* insert( struct node* root, int data ) {
if(root == NULL) {
struct node* node = (struct node*)malloc(sizeof(struct node));
node->data = data;
node->left = NULL;
node->right = NULL;
return node;
} else {
struct node* cur;
if(data <= root->data) {
cur = insert(root->left, data);
root->left = cur;
} else {
cur = insert(root->right, data);
root->right = cur;
}
return root;
}
}
/* you only have to complete the function given below.
node is defined as
struct node {
int data;
struct node *left;
struct node *right;
};
*/
void postOrder( struct node *root) {
if(root!=NULL)
{
postOrder(root->left);
postOrder(root->right);
printf("%d ",root->data);
}
}
int main() {
struct node* root = NULL;
int t;
int data;
scanf("%d", &t);
while(t-- > 0) {
scanf("%d", &data);
root = insert(root, data);
}
postOrder(root);
return 0;
}
|
the_stack_data/243892109.c | /* This code uses nvptx inline assembly guarded with acc_on_device, which is
not optimized away at -O0, and then confuses the target assembler.
{ dg-skip-if "" { *-*-* } { "-O0" } { "" } } */
#include <stdio.h>
#define N (32*32*32+17)
int main ()
{
int ix;
int ondev = 0;
int t = 0, h = 0;
#pragma acc parallel vector_length(32) copy(ondev)
{
#pragma acc loop vector reduction (+:t)
for (unsigned ix = 0; ix < N; ix++)
{
int val = ix;
if (__builtin_acc_on_device (5))
{
int g = 0, w = 0, v = 0;
__asm__ volatile ("mov.u32 %0,%%ctaid.x;" : "=r" (g));
__asm__ volatile ("mov.u32 %0,%%tid.y;" : "=r" (w));
__asm__ volatile ("mov.u32 %0,%%tid.x;" : "=r" (v));
val = (g << 16) | (w << 8) | v;
ondev = 1;
}
t += val;
}
}
for (ix = 0; ix < N; ix++)
{
int val = ix;
if (ondev)
{
int g = 0;
int w = 0;
int v = ix % 32;
val = (g << 16) | (w << 8) | v;
}
h += val;
}
if (t != h)
{
printf ("t=%x expected %x\n", t, h);
return 1;
}
return 0;
}
|
the_stack_data/154829027.c | #include <stdio.h>
int main() {
float fahr, celsius;
int lower, upper, step;
lower = 0;
upper = 300;
step = 20;
fahr = upper;
while (fahr >= lower) {
celsius = (5.0/9.0) * (fahr-32.0);
printf("%3.0f\t%.1f\n", fahr, celsius);
fahr = fahr - step;
}
}
|
the_stack_data/11939.c | #include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define NUM_THREADS 2
volatile int count = 0;
int thread_ids[2] = { 0, 1};
pthread_mutex_t count_mutex;
pthread_cond_t count_threshold_cv;
void *
inc_count (void* arg)
{
pthread_mutex_lock (&count_mutex);
printf("signaling\n");
pthread_cond_signal (&count_threshold_cv);
printf("signaled\n");
pthread_mutex_unlock (&count_mutex);
return 0;
}
void *
watch_count (void *idp)
{
pthread_mutex_lock (&count_mutex);
printf("sleeping\n");
pthread_cond_wait (&count_threshold_cv, &count_mutex);
printf ("woke up\n");
pthread_mutex_unlock (&count_mutex);
return 0;
}
int
main (int argc, char *argv[])
{
int i;
pthread_t threads[2];
/* Initialize mutex and condition variable objects */
pthread_mutex_init (&count_mutex, NULL);
pthread_cond_init (&count_threshold_cv, NULL);
pthread_create (&threads[1], 0, watch_count, 0);
pthread_create (&threads[0], 0, inc_count, 0);
/* Wait for all threads to complete */
for (i = 0; i < NUM_THREADS; i++)
{
pthread_join (threads[i], NULL);
}
printf("main exited\n");
pthread_mutex_destroy (&count_mutex);
return 0;
}
|
the_stack_data/243893281.c | struct a {
int c
};
struct d {
struct a *e
};
struct b {
int f;
int g
};
h, i, k;
l() {
struct b *a = l;
struct d *m;
struct a n;
int j;
while (h) {
if (i)
a->g = k;
if (a->g & k)
a->g = k;
n = m->e[j];
o(n);
m = p();
}
}
|
the_stack_data/66237.c | /* f2c.h -- Standard Fortran to C header file */
/** barf [ba:rf] 2. "He suggested using FORTRAN, and everybody barfed."
- From The Shogakukan DICTIONARY OF NEW ENGLISH (Second edition) */
#ifndef F2C_INCLUDE
#define F2C_INCLUDE
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conj(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimag(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Table of constant values */
static doublecomplex c_b1 = {1.,0.};
static integer c__1 = 1;
/* > \brief \b ZGEQRT3 recursively computes a QR factorization of a general real or complex matrix using the c
ompact WY representation of Q. */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download ZGEQRT3 + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqrt3
.f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqrt3
.f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqrt3
.f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE ZGEQRT3( M, N, A, LDA, T, LDT, INFO ) */
/* INTEGER INFO, LDA, M, N, LDT */
/* COMPLEX*16 A( LDA, * ), T( LDT, * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > ZGEQRT3 recursively computes a QR factorization of a complex M-by-N */
/* > matrix A, using the compact WY representation of Q. */
/* > */
/* > Based on the algorithm of Elmroth and Gustavson, */
/* > IBM J. Res. Develop. Vol 44 No. 4 July 2000. */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] M */
/* > \verbatim */
/* > M is INTEGER */
/* > The number of rows of the matrix A. M >= N. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The number of columns of the matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is COMPLEX*16 array, dimension (LDA,N) */
/* > On entry, the complex M-by-N matrix A. On exit, the elements on */
/* > and above the diagonal contain the N-by-N upper triangular matrix R; */
/* > the elements below the diagonal are the columns of V. See below for */
/* > further details. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
/* > \endverbatim */
/* > */
/* > \param[out] T */
/* > \verbatim */
/* > T is COMPLEX*16 array, dimension (LDT,N) */
/* > The N-by-N upper triangular factor of the block reflector. */
/* > The elements on and above the diagonal contain the block */
/* > reflector T; the elements below the diagonal are not used. */
/* > See below for further details. */
/* > \endverbatim */
/* > */
/* > \param[in] LDT */
/* > \verbatim */
/* > LDT is INTEGER */
/* > The leading dimension of the array T. LDT >= f2cmax(1,N). */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date June 2016 */
/* > \ingroup complex16GEcomputational */
/* > \par Further Details: */
/* ===================== */
/* > */
/* > \verbatim */
/* > */
/* > The matrix V stores the elementary reflectors H(i) in the i-th column */
/* > below the diagonal. For example, if M=5 and N=3, the matrix V is */
/* > */
/* > V = ( 1 ) */
/* > ( v1 1 ) */
/* > ( v1 v2 1 ) */
/* > ( v1 v2 v3 ) */
/* > ( v1 v2 v3 ) */
/* > */
/* > where the vi's represent the vectors which define H(i), which are returned */
/* > in the matrix A. The 1's along the diagonal of V are not stored in A. The */
/* > block reflector H is then given by */
/* > */
/* > H = I - V * T * V**H */
/* > */
/* > where V**H is the conjugate transpose of V. */
/* > */
/* > For details of the algorithm, see Elmroth and Gustavson (cited above). */
/* > \endverbatim */
/* > */
/* ===================================================================== */
/* Subroutine */ int zgeqrt3_(integer *m, integer *n, doublecomplex *a,
integer *lda, doublecomplex *t, integer *ldt, integer *info)
{
/* System generated locals */
integer a_dim1, a_offset, t_dim1, t_offset, i__1, i__2, i__3, i__4, i__5;
doublecomplex z__1;
/* Local variables */
integer i__, j, iinfo;
extern /* Subroutine */ int zgemm_(char *, char *, integer *, integer *,
integer *, doublecomplex *, doublecomplex *, integer *,
doublecomplex *, integer *, doublecomplex *, doublecomplex *,
integer *);
integer i1, j1, n1, n2;
extern /* Subroutine */ int ztrmm_(char *, char *, char *, char *,
integer *, integer *, doublecomplex *, doublecomplex *, integer *,
doublecomplex *, integer *),
xerbla_(char *, integer *, ftnlen), zlarfg_(integer *,
doublecomplex *, doublecomplex *, integer *, doublecomplex *);
/* -- LAPACK computational routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* June 2016 */
/* ===================================================================== */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 1;
a -= a_offset;
t_dim1 = *ldt;
t_offset = 1 + t_dim1 * 1;
t -= t_offset;
/* Function Body */
*info = 0;
if (*n < 0) {
*info = -2;
} else if (*m < *n) {
*info = -1;
} else if (*lda < f2cmax(1,*m)) {
*info = -4;
} else if (*ldt < f2cmax(1,*n)) {
*info = -6;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("ZGEQRT3", &i__1, (ftnlen)7);
return 0;
}
if (*n == 1) {
/* Compute Householder transform when N=1 */
zlarfg_(m, &a[a_dim1 + 1], &a[f2cmin(2,*m) + a_dim1], &c__1, &t[t_dim1 +
1]);
} else {
/* Otherwise, split A into blocks... */
n1 = *n / 2;
n2 = *n - n1;
/* Computing MIN */
i__1 = n1 + 1;
j1 = f2cmin(i__1,*n);
/* Computing MIN */
i__1 = *n + 1;
i1 = f2cmin(i__1,*m);
/* Compute A(1:M,1:N1) <- (Y1,R1,T1), where Q1 = I - Y1 T1 Y1^H */
zgeqrt3_(m, &n1, &a[a_offset], lda, &t[t_offset], ldt, &iinfo);
/* Compute A(1:M,J1:N) = Q1^H A(1:M,J1:N) [workspace: T(1:N1,J1:N)] */
i__1 = n2;
for (j = 1; j <= i__1; ++j) {
i__2 = n1;
for (i__ = 1; i__ <= i__2; ++i__) {
i__3 = i__ + (j + n1) * t_dim1;
i__4 = i__ + (j + n1) * a_dim1;
t[i__3].r = a[i__4].r, t[i__3].i = a[i__4].i;
}
}
ztrmm_("L", "L", "C", "U", &n1, &n2, &c_b1, &a[a_offset], lda, &t[j1 *
t_dim1 + 1], ldt)
;
i__1 = *m - n1;
zgemm_("C", "N", &n1, &n2, &i__1, &c_b1, &a[j1 + a_dim1], lda, &a[j1
+ j1 * a_dim1], lda, &c_b1, &t[j1 * t_dim1 + 1], ldt);
ztrmm_("L", "U", "C", "N", &n1, &n2, &c_b1, &t[t_offset], ldt, &t[j1 *
t_dim1 + 1], ldt)
;
i__1 = *m - n1;
z__1.r = -1., z__1.i = 0.;
zgemm_("N", "N", &i__1, &n2, &n1, &z__1, &a[j1 + a_dim1], lda, &t[j1 *
t_dim1 + 1], ldt, &c_b1, &a[j1 + j1 * a_dim1], lda);
ztrmm_("L", "L", "N", "U", &n1, &n2, &c_b1, &a[a_offset], lda, &t[j1 *
t_dim1 + 1], ldt)
;
i__1 = n2;
for (j = 1; j <= i__1; ++j) {
i__2 = n1;
for (i__ = 1; i__ <= i__2; ++i__) {
i__3 = i__ + (j + n1) * a_dim1;
i__4 = i__ + (j + n1) * a_dim1;
i__5 = i__ + (j + n1) * t_dim1;
z__1.r = a[i__4].r - t[i__5].r, z__1.i = a[i__4].i - t[i__5]
.i;
a[i__3].r = z__1.r, a[i__3].i = z__1.i;
}
}
/* Compute A(J1:M,J1:N) <- (Y2,R2,T2) where Q2 = I - Y2 T2 Y2^H */
i__1 = *m - n1;
zgeqrt3_(&i__1, &n2, &a[j1 + j1 * a_dim1], lda, &t[j1 + j1 * t_dim1],
ldt, &iinfo);
/* Compute T3 = T(1:N1,J1:N) = -T1 Y1^H Y2 T2 */
i__1 = n1;
for (i__ = 1; i__ <= i__1; ++i__) {
i__2 = n2;
for (j = 1; j <= i__2; ++j) {
i__3 = i__ + (j + n1) * t_dim1;
d_cnjg(&z__1, &a[j + n1 + i__ * a_dim1]);
t[i__3].r = z__1.r, t[i__3].i = z__1.i;
}
}
ztrmm_("R", "L", "N", "U", &n1, &n2, &c_b1, &a[j1 + j1 * a_dim1], lda,
&t[j1 * t_dim1 + 1], ldt);
i__1 = *m - *n;
zgemm_("C", "N", &n1, &n2, &i__1, &c_b1, &a[i1 + a_dim1], lda, &a[i1
+ j1 * a_dim1], lda, &c_b1, &t[j1 * t_dim1 + 1], ldt);
z__1.r = -1., z__1.i = 0.;
ztrmm_("L", "U", "N", "N", &n1, &n2, &z__1, &t[t_offset], ldt, &t[j1 *
t_dim1 + 1], ldt)
;
ztrmm_("R", "U", "N", "N", &n1, &n2, &c_b1, &t[j1 + j1 * t_dim1], ldt,
&t[j1 * t_dim1 + 1], ldt);
/* Y = (Y1,Y2); R = [ R1 A(1:N1,J1:N) ]; T = [T1 T3] */
/* [ 0 R2 ] [ 0 T2] */
}
return 0;
/* End of ZGEQRT3 */
} /* zgeqrt3_ */
|
the_stack_data/41571.c | // RUN: %crabllvm --turn-undef-nondet --lower-unsigned-icmp --inline --devirt-functions --externalize-addr-taken-functions --crab-narrowing-iterations=2 --crab-widening-delay=2 --crab-widening-jump-set=0 --crab-check=assert --crab-stats --crab-dom=boxes --crab-track=arr --crab-singleton-aliases --do-not-print-invariants "%s" 2>&1 | OutputCheck -l debug %s
// CHECK: ^1 Number of total safe checks$
// CHECK: ^0 Number of total error checks$
// CHECK: ^0 Number of total warning checks$
extern void __VERIFIER_error() __attribute__ ((__noreturn__));
extern char __VERIFIER_nondet_char(void);
extern int __VERIFIER_nondet_int(void);
extern long __VERIFIER_nondet_long(void);
extern void *__VERIFIER_nondet_pointer(void);
int DiskPerfDispatchPnp(int DeviceObject , int Irp );
int DiskPerfIrpCompletion(int DeviceObject , int Irp , int Context );
int DiskPerfStartDevice(int DeviceObject , int Irp );
int DiskPerfRemoveDevice(int DeviceObject , int Irp );
int DiskPerfSendToNextDriver(int DeviceObject , int Irp );
int DiskPerfDispatchPower(int DeviceObject , int Irp );
int DiskPerfForwardIrpSynchronous(int DeviceObject , int Irp );
int DiskPerfCreate(int DeviceObject , int Irp );
int DiskPerfIoCompletion(int DeviceObject , int Irp , int Context );
int DiskPerfDeviceControl(int DeviceObject , int Irp );
int DiskPerfShutdownFlush(int DeviceObject , int Irp );
int DiskPerfRegisterDevice(int DeviceObject );
int IoBuildDeviceIoControlRequest(int IoControlCode , int DeviceObject , int InputBuffer ,
int InputBufferLength , int OutputBuffer , int OutputBufferLength ,
int InternalDeviceIoControl , int Event , int IoStatusBlock );
int IofCallDriver(int DeviceObject , int Irp );
int KeSetEvent(int Event , int Increment , int Wait );
int KeWaitForSingleObject(int Object , int WaitReason , int WaitMode , int Alertable ,
int Timeout );
int PoCallDriver(int DeviceObject , int Irp );
void IofCompleteRequest(int Irp , int PriorityBoost );
int __VERIFIER_nondet_int() ;
int s ;
int UNLOADED ;
int NP ;
int DC ;
int SKIP1 ;
int SKIP2 ;
int MPR1 ;
int MPR3 ;
int IPC ;
int pended ;
int compFptr ;
int compRegistered ;
int lowerDriverReturn ;
int setEventCalled ;
int customIrp ;
int myStatus ;
int routine ;
int pirp ;
int Executive ;
int KernelMode ;
void errorFn(void)
{
{
ERROR: __VERIFIER_error();
return;
}
}
void _BLAST_init(void)
{
{
UNLOADED = 0;
NP = 1;
DC = 2;
SKIP1 = 3;
SKIP2 = 4;
MPR1 = 5;
MPR3 = 6;
IPC = 7;
s = UNLOADED;
pended = 0;
compFptr = 0;
compRegistered = 0;
lowerDriverReturn = 0;
setEventCalled = 0;
customIrp = 0;
return;
}
}
void DiskPerfSyncFilterWithTarget(int FilterDevice , int TargetDevice )
{ int FilterDevice__Flags ;
int TargetDevice__Characteristics ;
int FilterDevice__Characteristics ;
int propFlags ;
{
//propFlags = 0;
//FilterDevice__Flags |= propFlags;
//propFlags = TargetDevice__Characteristics & 7;
//FilterDevice__Characteristics |= propFlags;
return;
}
}
int DiskPerfDispatchPnp(int DeviceObject , int Irp )
{ int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ;
int irpSp__MinorFunction = __VERIFIER_nondet_int() ;
int irpSp ;
int status ;
int tmp ;
{
irpSp = Irp__Tail__Overlay__CurrentStackLocation;
if (irpSp__MinorFunction == 0) {
goto switch_0_0;
} else {
if (irpSp__MinorFunction == 2) {
goto switch_0_2;
} else {
goto switch_0_default;
if (0) {
switch_0_0:
{
status = DiskPerfStartDevice(DeviceObject, Irp);
}
goto switch_0_break;
switch_0_2:
{
status = DiskPerfRemoveDevice(DeviceObject, Irp);
}
goto switch_0_break;
switch_0_default:
{
tmp = DiskPerfSendToNextDriver(DeviceObject, Irp);
}
return (tmp);
} else {
switch_0_break: ;
}
}
}
return (status);
}
}
int DiskPerfIrpCompletion(int DeviceObject , int Irp , int Context )
{ int Event ;
{
{
Event = Context;
KeSetEvent(Event, 0, 0);
}
return (-1073741802);
}
}
int DiskPerfStartDevice(int DeviceObject , int Irp )
{ int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ;
int Irp__IoStatus__Status ;
int deviceExtension ;
int status ;
{
{
deviceExtension = DeviceObject__DeviceExtension;
status = DiskPerfForwardIrpSynchronous(DeviceObject, Irp);
DiskPerfSyncFilterWithTarget(DeviceObject, deviceExtension__TargetDeviceObject);
DiskPerfRegisterDevice(DeviceObject);
Irp__IoStatus__Status = status;
myStatus = status;
IofCompleteRequest(Irp, 0);
}
return (status);
}
}
int DiskPerfRemoveDevice(int DeviceObject , int Irp )
{ int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int deviceExtension__WmilibContext = __VERIFIER_nondet_int() ;
int Irp__IoStatus__Status ;
int status ;
int deviceExtension ;
int wmilibContext ;
{
{
deviceExtension = DeviceObject__DeviceExtension;
wmilibContext = deviceExtension__WmilibContext;
status = DiskPerfForwardIrpSynchronous(DeviceObject, Irp);
Irp__IoStatus__Status = status;
myStatus = status;
IofCompleteRequest(Irp, 0);
}
return (status);
}
}
int DiskPerfSendToNextDriver(int DeviceObject , int Irp )
{ int Irp__CurrentLocation = __VERIFIER_nondet_int() ;
int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ;
int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ;
int deviceExtension ;
int tmp ;
{
if (s == NP) {
s = SKIP1;
} else {
{
errorFn();
}
}
{
Irp__CurrentLocation ++;
Irp__Tail__Overlay__CurrentStackLocation ++;
deviceExtension = DeviceObject__DeviceExtension;
tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp);
}
return (tmp);
}
}
int DiskPerfDispatchPower(int DeviceObject , int Irp )
{ int Irp__CurrentLocation = __VERIFIER_nondet_int() ;
int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ;
int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ;
int deviceExtension ;
int tmp ;
{
if (s == NP) {
s = SKIP1;
} else {
{
errorFn();
}
}
{
Irp__CurrentLocation ++;
Irp__Tail__Overlay__CurrentStackLocation ++;
deviceExtension = DeviceObject__DeviceExtension;
tmp = PoCallDriver(deviceExtension__TargetDeviceObject, Irp);
}
return (tmp);
}
}
int DiskPerfForwardIrpSynchronous(int DeviceObject , int Irp )
{ int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ;
int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ;
int deviceExtension ;
int event = __VERIFIER_nondet_int() ;
int status ;
int nextIrpSp__Control ;
int irpSp ;
int nextIrpSp ;
int irpSp__Context ;
int irpSp__Control ;
int irpSp___0 ;
long __cil_tmp15 ;
{
deviceExtension = DeviceObject__DeviceExtension;
irpSp = Irp__Tail__Overlay__CurrentStackLocation;
nextIrpSp = Irp__Tail__Overlay__CurrentStackLocation - 1;
nextIrpSp__Control = 0;
if (s != NP) {
{
errorFn();
}
} else {
if (compRegistered != 0) {
{
errorFn();
}
} else {
compRegistered = 1;
routine = 0;
}
}
{
irpSp___0 = Irp__Tail__Overlay__CurrentStackLocation - 1;
irpSp__Context = event;
irpSp__Control = 224;
status = IofCallDriver(deviceExtension__TargetDeviceObject, Irp);
}
{
__cil_tmp15 = (long )status;
if (__cil_tmp15 == 259L) {
{
KeWaitForSingleObject(event, Executive, KernelMode, 0, 0);
status = myStatus;
}
}
}
return (status);
}
}
int DiskPerfCreate(int DeviceObject , int Irp )
{
{
{
myStatus = 0;
IofCompleteRequest(Irp, 0);
}
return (0);
}
}
int DiskPerfIoCompletion(int DeviceObject , int Irp , int Context )
{ int irpStack__MajorFunction = __VERIFIER_nondet_int() ;
int partitionCounters__BytesRead__QuadPart = __VERIFIER_nondet_int() ;
int Irp__IoStatus__Information = __VERIFIER_nondet_int() ;
int partitionCounters__ReadCount = __VERIFIER_nondet_int() ;
int partitionCounters__ReadTime__QuadPart = __VERIFIER_nondet_int() ;
int difference__QuadPart = __VERIFIER_nondet_int() ;
int partitionCounters__BytesWritten__QuadPart = __VERIFIER_nondet_int() ;
int partitionCounters__WriteCount = __VERIFIER_nondet_int() ;
int partitionCounters__WriteTime__QuadPart = __VERIFIER_nondet_int() ;
int Irp__Flags = __VERIFIER_nondet_int() ;
int partitionCounters__SplitCount = __VERIFIER_nondet_int() ;
int Irp__PendingReturned = __VERIFIER_nondet_int() ;
int Irp__Tail__Overlay__CurrentStackLocation__Control ;
int partitionCounters = __VERIFIER_nondet_int() ;
int queueLen = __VERIFIER_nondet_int() ;
{
if (partitionCounters == 0) {
return (0);
}
if (queueLen < 0) {
}
if (queueLen == 0) {
}
if (irpStack__MajorFunction == 3) {
partitionCounters__BytesRead__QuadPart += Irp__IoStatus__Information;
partitionCounters__ReadCount ++;
partitionCounters__ReadTime__QuadPart += difference__QuadPart;
} else {
partitionCounters__BytesWritten__QuadPart += Irp__IoStatus__Information;
partitionCounters__WriteCount ++;
partitionCounters__WriteTime__QuadPart += difference__QuadPart;
}
if (Irp__Flags != 8) {
partitionCounters__SplitCount ++;
}
else {
}
if (Irp__PendingReturned) {
if (pended == 0) {
pended = 1;
} else {
{
errorFn();
}
}
//Irp__Tail__Overlay__CurrentStackLocation__Control |= 1;
}
return (0);
}
}
int DiskPerfDeviceControl(int DeviceObject , int Irp )
{ int Irp__CurrentLocation = __VERIFIER_nondet_int() ;
int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ;
int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ;
int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ;
int currentIrpStack__Parameters__DeviceIoControl__OutputBufferLength = __VERIFIER_nondet_int() ;
int sizeof__DISK_PERFORMANCE = __VERIFIER_nondet_int() ;
int Irp__IoStatus__Information ;
int deviceExtension__DiskCounters = __VERIFIER_nondet_int() ;
int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ;
int deviceExtension__Processors = __VERIFIER_nondet_int() ;
int totalCounters__QueueDepth ;
int deviceExtension__QueueDepth = __VERIFIER_nondet_int() ;
int Irp__IoStatus__Status ;
int deviceExtension ;
int currentIrpStack ;
int status ;
int i ;
int totalCounters ;
int diskCounters ;
int tmp ;
int __cil_tmp24 ;
int __cil_tmp25 ;
int __cil_tmp26 ;
{
deviceExtension = DeviceObject__DeviceExtension;
currentIrpStack = Irp__Tail__Overlay__CurrentStackLocation;
{
__cil_tmp24 = 32;
__cil_tmp25 = 458752;
__cil_tmp26 = 458784;
if (currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp26) {
if (currentIrpStack__Parameters__DeviceIoControl__OutputBufferLength < sizeof__DISK_PERFORMANCE) {
status = -1073741789;
Irp__IoStatus__Information = 0;
} else {
diskCounters = deviceExtension__DiskCounters;
if (diskCounters == 0) {
{
Irp__IoStatus__Status = -1073741823;
myStatus = -1073741823;
IofCompleteRequest(Irp, 0);
}
return (-1073741823);
}
totalCounters = Irp__AssociatedIrp__SystemBuffer;
i = 0;
{
while (1) {
while_0_continue: /* CIL Label */ ;
if (i >= deviceExtension__Processors) {
goto while_1_break;
}
i ++;
}
while_0_break: /* CIL Label */ ;
}
while_1_break:
totalCounters__QueueDepth = deviceExtension__QueueDepth;
status = 0;
Irp__IoStatus__Information = sizeof__DISK_PERFORMANCE;
}
{
Irp__IoStatus__Status = status;
myStatus = status;
IofCompleteRequest(Irp, 0);
}
return (status);
} else {
{
Irp__CurrentLocation ++;
Irp__Tail__Overlay__CurrentStackLocation ++;
tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp);
}
return (tmp);
}
}
}
}
int DiskPerfShutdownFlush(int DeviceObject , int Irp )
{ int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int Irp__CurrentLocation = __VERIFIER_nondet_int() ;
int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ;
int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ;
int deviceExtension ;
int tmp ;
{
{
deviceExtension = DeviceObject__DeviceExtension;
Irp__CurrentLocation ++;
Irp__Tail__Overlay__CurrentStackLocation ++;
tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp);
}
return (tmp);
}
}
void DiskPerfUnload(int DriverObject )
{
{
return;
}
}
int DiskPerfRegisterDevice(int DeviceObject )
{ int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ;
int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ;
int sizeof__number = __VERIFIER_nondet_int() ;
int ioStatus__Status = __VERIFIER_nondet_int() ;
int sizeof__VOLUME_NUMBER = __VERIFIER_nondet_int() ;
int volumeNumber__VolumeManagerName__0 = __VERIFIER_nondet_int() ;
int status ;
int ioStatus = __VERIFIER_nondet_int() ;
int event = __VERIFIER_nondet_int() ;
int deviceExtension ;
int irp ;
int number = __VERIFIER_nondet_int() ;
int registrationFlag ;
int sizeof__MOUNTDEV_NAME = __VERIFIER_nondet_int() ;
int output__NameLength = __VERIFIER_nondet_int() ;
int outputSize ;
int output = __VERIFIER_nondet_int() ;
int volumeNumber = __VERIFIER_nondet_int() ;
int __cil_tmp20 ;
int __cil_tmp21 ;
int __cil_tmp22 ;
long __cil_tmp23 ;
int __cil_tmp24 ;
int __cil_tmp25 ;
int __cil_tmp26 ;
long __cil_tmp27 ;
unsigned long __cil_tmp28 ;
int __cil_tmp29 ;
int __cil_tmp30 ;
int __cil_tmp31 ;
long __cil_tmp32 ;
int __cil_tmp33 ;
int __cil_tmp34 ;
int __cil_tmp35 ;
int __cil_tmp36 ;
long __cil_tmp37 ;
int __cil_tmp38 ;
int __cil_tmp39 ;
{
{
registrationFlag = 0;
deviceExtension = DeviceObject__DeviceExtension;
__cil_tmp20 = 4224;
__cil_tmp21 = 2949120;
__cil_tmp22 = 2953344;
irp = IoBuildDeviceIoControlRequest(__cil_tmp22, deviceExtension__TargetDeviceObject,
0, 0, number, sizeof__number, 0, event, ioStatus);
}
if (! irp) {
return (-1073741670);
}
{
status = IofCallDriver(deviceExtension__TargetDeviceObject, irp);
}
{
__cil_tmp23 = (long )status;
if (__cil_tmp23 == 259L) {
{
KeWaitForSingleObject(event, Executive, KernelMode, 0, 0);
status = ioStatus__Status;
}
}
}
if (status < 0) {
outputSize = sizeof__MOUNTDEV_NAME;
if (! output) {
return (-1073741670);
}
{
__cil_tmp24 = 8;
__cil_tmp25 = 5046272;
__cil_tmp26 = 5046280;
irp = IoBuildDeviceIoControlRequest(__cil_tmp26, deviceExtension__TargetDeviceObject,
0, 0, output, outputSize, 0, event, ioStatus);
}
if (! irp) {
return (-1073741670);
}
{
status = IofCallDriver(deviceExtension__TargetDeviceObject, irp);
}
{
__cil_tmp27 = (long )status;
if (__cil_tmp27 == 259L) {
{
KeWaitForSingleObject(event, Executive, KernelMode, 0, 0);
status = ioStatus__Status;
}
}
}
{
__cil_tmp28 = (unsigned long )status;
if (__cil_tmp28 == -2147483643) {
outputSize = sizeof__MOUNTDEV_NAME + output__NameLength;
if (! output) {
return (-1073741670);
}
{
__cil_tmp29 = 8;
__cil_tmp30 = 5046272;
__cil_tmp31 = 5046280;
irp = IoBuildDeviceIoControlRequest(__cil_tmp31, deviceExtension__TargetDeviceObject,
0, 0, output, outputSize, 0, event, ioStatus);
}
if (! irp) {
return (-1073741670);
}
{
status = IofCallDriver(deviceExtension__TargetDeviceObject, irp);
}
{
__cil_tmp32 = (long )status;
if (__cil_tmp32 == 259L) {
{
KeWaitForSingleObject(event, Executive, KernelMode, 0, 0);
status = ioStatus__Status;
}
}
}
}
}
{
if (status < 0) {
return (status);
}
}
{
__cil_tmp34 = 28;
__cil_tmp35 = 5636096;
__cil_tmp36 = 5636124;
irp = IoBuildDeviceIoControlRequest(__cil_tmp36, deviceExtension__TargetDeviceObject,
0, 0, volumeNumber, sizeof__VOLUME_NUMBER,
0, event, ioStatus);
}
if (! irp) {
return (-1073741670);
}
{
status = IofCallDriver(deviceExtension__TargetDeviceObject, irp);
}
{
__cil_tmp37 = (long )status;
if (__cil_tmp37 == 259L) {
{
KeWaitForSingleObject(event, Executive, KernelMode, 0, 0);
status = ioStatus__Status;
}
}
}
{
if (status < 0) {
goto _L;
} else {
if (volumeNumber__VolumeManagerName__0 == 0) {
_L:
if (status >= 0) {
}
}
}
}
}
{
if (status < 0) {
}
}
return (status);
}
}
void stub_driver_init(void)
{
{
s = NP;
customIrp = 0;
setEventCalled = customIrp;
lowerDriverReturn = setEventCalled;
compRegistered = lowerDriverReturn;
compFptr = compRegistered;
pended = compFptr;
return;
}
}
int main(void)
{ int d = __VERIFIER_nondet_int() ;
int status = __VERIFIER_nondet_int() ;
int we_should_unload = __VERIFIER_nondet_int() ;
int irp = __VERIFIER_nondet_int() ;
int pirp__IoStatus__Status ;
int irp_choice = __VERIFIER_nondet_int() ;
int devobj = __VERIFIER_nondet_int() ;
int __cil_tmp9 ;
s = 0;
UNLOADED = 0;
NP = 0;
DC = 0;
SKIP1 = 0;
SKIP2 = 0;
MPR1 = 0;
MPR3 = 0;
IPC = 0;
pended = 0;
compFptr = 0;
compRegistered = 0;
lowerDriverReturn = 0;
setEventCalled = 0;
customIrp = 0;
myStatus = 0;
routine = 0;
pirp = 0;
Executive = 0;
KernelMode = 0;
{
{
pirp = irp;
_BLAST_init();
}
if (status >= 0) {
s = NP;
customIrp = 0;
setEventCalled = customIrp;
lowerDriverReturn = setEventCalled;
compRegistered = lowerDriverReturn;
compFptr = compRegistered;
pended = compFptr;
pirp__IoStatus__Status = 0;
myStatus = 0;
if (irp_choice == 0) {
pirp__IoStatus__Status = -1073741637;
myStatus = -1073741637;
}
{
stub_driver_init();
}
{
if (status < 0) {
return (-1);
}
}
int tmp_ndt_1;
tmp_ndt_1 = __VERIFIER_nondet_int();
if (tmp_ndt_1 == 0) {
goto switch_2_0;
} else {
int tmp_ndt_2;
tmp_ndt_2 = __VERIFIER_nondet_int();
if (tmp_ndt_2 == 2) {
goto switch_2_2;
} else {
int tmp_ndt_3;
tmp_ndt_3 = __VERIFIER_nondet_int();
if (tmp_ndt_3 == 3) {
goto switch_2_3;
} else {
int tmp_ndt_4;
tmp_ndt_4 = __VERIFIER_nondet_int();
if (tmp_ndt_4 == 4) {
goto switch_2_4;
} else {
int tmp_ndt_5;
tmp_ndt_5 = __VERIFIER_nondet_int();
if (tmp_ndt_5 == 12) {
goto switch_2_12;
} else {
goto switch_2_default;
if (0) {
switch_2_0:
{
status = DiskPerfCreate(devobj, pirp);
}
goto switch_2_break;
switch_2_2:
{
status = DiskPerfDeviceControl(devobj, pirp);
}
goto switch_2_break;
switch_2_3:
{
status = DiskPerfDispatchPnp(devobj, pirp);
}
goto switch_2_break;
switch_2_4:
{
status = DiskPerfDispatchPower(devobj, pirp);
}
goto switch_2_break;
switch_2_12:
{
status = DiskPerfShutdownFlush(devobj, pirp);
}
goto switch_2_break;
switch_2_default: ;
return (-1);
} else {
switch_2_break: ;
}
}
}
}
}
}
if (we_should_unload) {
{
DiskPerfUnload(d);
}
}
}
if (pended == 1) {
if (s == NP) {
s = NP;
} else {
goto _L___2;
}
} else {
_L___2:
if (pended == 1) {
if (s == MPR3) {
s = MPR3;
} else {
goto _L___1;
}
} else {
_L___1:
if (s != UNLOADED) {
if (status != -1) {
if (s != SKIP2) {
if (s != IPC) {
if (s != DC) {
{
errorFn();
}
} else {
goto _L___0;
}
} else {
goto _L___0;
}
} else {
_L___0:
if (pended == 1) {
if (status != 259) {
{
errorFn();
}
}
} else {
if (s == DC) {
if (status == 259) {
{
errorFn();
}
}
} else {
if (status != lowerDriverReturn) {
{
errorFn();
}
}
}
}
}
}
}
}
}
return (status);
}
}
int IoBuildDeviceIoControlRequest(int IoControlCode , int DeviceObject , int InputBuffer ,
int InputBufferLength , int OutputBuffer , int OutputBufferLength ,
int InternalDeviceIoControl , int Event , int IoStatusBlock )
{
int malloc_ret = __VERIFIER_nondet_int() ;
{
customIrp = 1;
int tmp_ndt_7;
tmp_ndt_7 = __VERIFIER_nondet_int();
if (tmp_ndt_7 == 0) {
goto switch_3_0;
} else {
goto switch_3_default;
if (0) {
switch_3_0: ;
return (malloc_ret);
switch_3_default: ;
return (0);
} else {
}
}
}
}
void stubMoreProcessingRequired(void)
{
{
if (s == NP) {
s = MPR1;
} else {
{
errorFn();
}
}
return;
}
}
int IofCallDriver(int DeviceObject , int Irp )
{
int returnVal2 ;
int compRetStatus ;
int lcontext = __VERIFIER_nondet_int() ;
unsigned long __cil_tmp7 ;
{
if (compRegistered) {
if (routine == 0) {
{
compRetStatus = DiskPerfIrpCompletion(DeviceObject, Irp, lcontext);
}
} else {
{
compRetStatus = DiskPerfIoCompletion(DeviceObject, Irp, lcontext);
}
}
{
__cil_tmp7 = (unsigned long )compRetStatus;
if (__cil_tmp7 == -1073741802) {
{
stubMoreProcessingRequired();
}
}
}
}
int tmp_ndt_8;
tmp_ndt_8 = __VERIFIER_nondet_int();
if (tmp_ndt_8 == 0) {
goto switch_4_0;
} else {
int tmp_ndt_9;
tmp_ndt_9 = __VERIFIER_nondet_int();
if (tmp_ndt_9 == 1) {
goto switch_4_1;
} else {
goto switch_4_default;
if (0) {
switch_4_0:
returnVal2 = 0;
goto switch_4_break;
switch_4_1:
returnVal2 = -1073741823;
goto switch_4_break;
switch_4_default:
returnVal2 = 259;
goto switch_4_break;
} else {
switch_4_break: ;
}
}
}
if (s == NP) {
s = IPC;
lowerDriverReturn = returnVal2;
} else {
if (s == MPR1) {
if (returnVal2 == 259) {
s = MPR3;
lowerDriverReturn = returnVal2;
} else {
s = NP;
lowerDriverReturn = returnVal2;
}
} else {
if (s == SKIP1) {
s = SKIP2;
lowerDriverReturn = returnVal2;
} else {
{
errorFn();
}
}
}
}
return (returnVal2);
}
}
void IofCompleteRequest(int Irp , int PriorityBoost )
{
{
if (s == NP) {
s = DC;
} else {
{
errorFn();
}
}
return;
}
}
int KeSetEvent(int Event , int Increment , int Wait )
{ int l = __VERIFIER_nondet_int() ;
{
setEventCalled = 1;
return (l);
}
}
int KeWaitForSingleObject(int Object , int WaitReason , int WaitMode , int Alertable ,
int Timeout )
{
{
if (s == MPR3) {
if (setEventCalled == 1) {
s = NP;
setEventCalled = 0;
} else {
goto _L;
}
} else {
_L:
if (customIrp == 1) {
s = NP;
customIrp = 0;
} else {
if (s == MPR3) {
{
errorFn();
}
}
}
}
int tmp_ndt_10;
tmp_ndt_10 = __VERIFIER_nondet_int();
if (tmp_ndt_10 == 0) {
goto switch_5_0;
} else {
goto switch_5_default;
if (0) {
switch_5_0: ;
return (0);
switch_5_default: ;
return (-1073741823);
} else {
}
}
}
}
int PoCallDriver(int DeviceObject , int Irp )
{
int compRetStatus ;
int returnVal ;
int lcontext = __VERIFIER_nondet_int() ;
unsigned long __cil_tmp7 ;
long __cil_tmp8 ;
{
if (compRegistered) {
if (routine == 0) {
{
compRetStatus = DiskPerfIrpCompletion(DeviceObject, Irp, lcontext);
}
} else {
if (routine == 1) {
{
compRetStatus = DiskPerfIoCompletion(DeviceObject, Irp, lcontext);
}
}
}
{
__cil_tmp7 = (unsigned long )compRetStatus;
if (__cil_tmp7 == -1073741802) {
{
stubMoreProcessingRequired();
}
}
}
}
int tmp_ndt_11;
tmp_ndt_11 = __VERIFIER_nondet_int();
if (tmp_ndt_11 == 0) {
goto switch_6_0;
} else {
int tmp_ndt_12;
tmp_ndt_12 = __VERIFIER_nondet_int();
if (tmp_ndt_12 == 1) {
goto switch_6_1;
} else {
goto switch_6_default;
if (0) {
switch_6_0:
returnVal = 0;
goto switch_6_break;
switch_6_1:
returnVal = -1073741823;
goto switch_6_break;
switch_6_default:
returnVal = 259;
goto switch_6_break;
} else {
switch_6_break: ;
}
}
}
if (s == NP) {
s = IPC;
lowerDriverReturn = returnVal;
} else {
if (s == MPR1) {
{
__cil_tmp8 = (long )returnVal;
if (__cil_tmp8 == 259L) {
s = MPR3;
lowerDriverReturn = returnVal;
} else {
s = NP;
lowerDriverReturn = returnVal;
}
}
} else {
if (s == SKIP1) {
s = SKIP2;
lowerDriverReturn = returnVal;
} else {
{
errorFn();
}
}
}
}
return (returnVal);
}
}
|
the_stack_data/955069.c | #include <stdio.h>
char* test[] = {"Hello", "World", "This", "Is", "A", "Test"};
int main()
{
printf("%s\n%s\n%s\n%s\n", test[0], test[1], test[2], test[3]);
}
|
the_stack_data/126704194.c | #include <stdio.h>
#include <stdlib.h>
int main(void) {
setbuf(stdout, NULL); //Ausgabebuffer ausschalten
short int *p; //deklariert einen Zeiger-Variable auf short int
short int m,n=10; //Variablen vom Typ short int
p=&n; //Die Speicheradresse von n wird in p gespeichert, Damit zeigt p auf n
m=*p; //Der Inhalt der Variable, auf die p zeigt, wir m zugewiesen => m=10
printf("m= %d beginnt bei %d, n=%d beginnt bei %d, p=%d", m,&m, n,&n,p);
int *p1;
p1=NULL; //Zeiger die auf keine Variable zeigen, sind mit NULL (0) zu initialisieren
if(p1!=NULL)
{
*p1=17;
printf("\np1 = %d - Adresse: %d", *p1, p1);
}
int *izeiger;
char *ichar;
struct person *angaben;
int *iptr1, i,j;
int *iptr2 = &j;
char *cptr = "Hallo";
iptr1= &i;
iptr2=iptr1;
*iptr1 = *iptr2;
*iptr1=10;
*iptr1=100;
printf("\nWert: %d", *iptr2);
printf("\niptr1: %d iptr2: %d", iptr1, iptr2);
return EXIT_SUCCESS;
}
|
the_stack_data/187644056.c | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main(){
int n;
scanf("%d",&n);
if(n%2==0)
{
if(n>=2)
{if(n<=5)
{
printf("Not Weird");
}
if(n>20)
{
printf("Not Weird");
}
}
if(n>=6)
{
if(n<=20)
{{printf("Weird");}}
}
}
else
{printf("Weird");}
return 0;
}
|
the_stack_data/95449902.c | #include <stdio.h>
int main() {
int numA, numB, numC, valor, divisiveis, conta, i, contagem;
for(i = 0; i > -1; i++){
printf("Informe o numero a: ");
scanf("%d", &numA);
printf("Informe o numero b: ");
scanf("%d", &numB);
printf("Informe o numero c: ");
scanf("%d", &numC);
if(numA > 1 && numB < numC) break;
}
contagem = numC - numB - 1;
for(i = 0; i < contagem; i++){
numB++;
conta = numB % numA;
if(conta == 0){
divisiveis++;
}
}
printf("Entre b e c existem %d numeros divisiveis por %d", divisiveis, numA);
}
|
the_stack_data/168893337.c | #define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <unistd.h>
#include <fcntl.h>
#include <search.h>
static void *root = NULL;
int fd;
struct item {
off_t lba;
int seq;
};
static int compare(const void *pa, const void *pb)
{
if (*(off_t *) pa < *(off_t *) pb)
return -1;
if (*(off_t *) pa > *(off_t *) pb)
return 1;
return 0;
}
char *page;
int failed;
static void check(struct item *p)
{
lseek(fd, p->lba*512, SEEK_SET);
if (read(fd, page, 4096) != 4096)
perror("read check error"), exit(1);
off_t lba;
int seq;
if (sscanf(page, "%ld %d", &lba, &seq) != 2 || lba != p->lba || seq != p->seq) {
printf("ERROR: lba %ld %d: %02x %02x %02x %02x\n", p->lba, p->seq, page[0], page[1], page[2], page[3]);
failed = 1;
}
}
static void test_action(const void *nodep, const VISIT which, const int depth)
{
switch (which) {
case preorder:
break;
case postorder:
check(*(struct item **) nodep);
break;
case endorder:
break;
case leaf:
check(*(struct item **) nodep);
break;
}
}
static void print(struct item *p)
{
printf("%ld %d\n", p->lba, p->seq);
}
static void print_action(const void *nodep, const VISIT which, const int depth)
{
switch (which) {
case preorder:
break;
case postorder:
print(*(struct item **) nodep);
break;
case endorder:
break;
case leaf:
print(*(struct item **) nodep);
break;
}
}
int main(int argc, char **argv)
{
char buf[128];
off_t lba;
int i, len, x = 0, n = 1000;
if (argv[1][0] == '-') {
n = atoi(argv[1]+1);
argv++; argc--;
}
FILE *fp = fopen(argv[1], "r");
page = valloc(512*2048);
fd = open(argv[2], O_RDWR | O_DIRECT);
while (fgets(buf, sizeof(buf), fp)) {
if (2 != sscanf(buf, "%ld %d", &lba, &len))
printf("bad line: %s\n", buf), exit(1);
for (i = 0; i < len/8; i++) {
struct item *ptr = malloc(sizeof(*ptr));
ptr->lba = lba + i*8;
ptr->seq = 0;
struct item *val = tsearch(ptr, &root, compare);
if (val->lba == ptr->lba) {
val->seq++;
free(ptr);
ptr = val;
}
sprintf(page+i*4096, "%ld %d", ptr->lba, ptr->seq);
}
lseek(fd, lba * 512, SEEK_SET);
if (write(fd, page, len*512) < 0)
perror("write"), exit(1);
if ((++x) % n == 0) {
printf("testing ... %d ...\n", x);
sync();
twalk(root, test_action);
if (failed) {
//printf("table:\n");
//twalk(root, print_action);
exit(1);
}
printf("done.\n");
}
}
sync();
twalk(root, test_action);
return 0;
}
|
the_stack_data/86771.c | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main(){
int a[1000],n,sum=0,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
printf("%d",sum);
return 0;
}
|
the_stack_data/148348.c | /* Taxonomy Classification: 0000300607130000000110 */
/*
* WRITE/READ 0 write
* WHICH BOUND 0 upper
* DATA TYPE 0 char
* MEMORY LOCATION 0 stack
* SCOPE 3 inter-file/inter-proc
* CONTAINER 0 no
* POINTER 0 no
* INDEX COMPLEXITY 6 N/A
* ADDRESS COMPLEXITY 0 constant
* LENGTH COMPLEXITY 7 array contents
* ADDRESS ALIAS 1 yes, one level
* INDEX ALIAS 3 N/A
* LOCAL CONTROL FLOW 0 none
* SECONDARY CONTROL FLOW 0 none
* LOOP STRUCTURE 0 no
* LOOP COMPLEXITY 0 N/A
* ASYNCHRONY 0 no
* TAINT 0 no
* RUNTIME ENV. DEPENDENCE 0 no
* MAGNITUDE 1 1 byte
* CONTINUOUS/DISCRETE 1 continuous
* SIGNEDNESS 0 no
*/
/*
Copyright 2005 Massachusetts Institute of Technology
All rights reserved.
Redistribution and use of software 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 set of conditions and the disclaimer below.
- Redistributions in binary form must reproduce the copyright notice, this
set of conditions, and the disclaimer below in the documentation and/or
other materials provided with the distribution.
- Neither the name of the Massachusetts Institute of Technology nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS".
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <string.h>
int main(int argc, char *argv[])
{
int index_array[5];
char src[11];
char buf[10];
memset(src, 'A', 11);
src[11 - 1] = '\0';
index_array[0] = 11;
/* BAD */
strncpy(buf, src, index_array[0]);
return 0;
}
|
the_stack_data/165765092.c | #ifndef IN_GENERATED_CCODE
#define IN_GENERATED_CCODE
#define U_DISABLE_RENAMING 1
#include "unicode/umachine.h"
#endif
U_CDECL_BEGIN
const struct {
double bogus;
uint8_t bytes[2720];
} icudt57l_ibm_1149_P100_1997_cnv={ 0.0, {
128,0,218,39,20,0,0,0,0,0,2,0,99,110,118,116,
6,2,0,0,57,1,0,0,32,67,111,112,121,114,105,103,
104,116,32,40,67,41,32,50,48,49,54,44,32,73,110,116,
101,114,110,97,116,105,111,110,97,108,32,66,117,115,105,110,
101,115,115,32,77,97,99,104,105,110,101,115,32,67,111,114,
112,111,114,97,116,105,111,110,32,97,110,100,32,111,116,104,
101,114,115,46,32,65,108,108,32,82,105,103,104,116,115,32,
82,101,115,101,114,118,101,100,46,32,0,0,0,0,0,0,
100,0,0,0,105,98,109,45,49,49,52,57,95,80,49,48,
48,45,49,57,57,55,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,
125,4,0,0,0,2,1,1,63,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,4,4,31,0,1,0,0,0,0,0,0,0,
32,4,0,0,32,4,0,0,58,6,0,0,0,0,0,0,
124,3,0,0,0,0,0,128,1,0,0,128,2,0,0,128,
3,0,0,128,156,0,0,128,9,0,0,128,134,0,0,128,
127,0,0,128,151,0,0,128,141,0,0,128,142,0,0,128,
11,0,0,128,12,0,0,128,13,0,0,128,14,0,0,128,
15,0,0,128,16,0,0,128,17,0,0,128,18,0,0,128,
19,0,0,128,157,0,0,128,133,0,0,128,8,0,0,128,
135,0,0,128,24,0,0,128,25,0,0,128,146,0,0,128,
143,0,0,128,28,0,0,128,29,0,0,128,30,0,0,128,
31,0,0,128,128,0,0,128,129,0,0,128,130,0,0,128,
131,0,0,128,132,0,0,128,10,0,0,128,23,0,0,128,
27,0,0,128,136,0,0,128,137,0,0,128,138,0,0,128,
139,0,0,128,140,0,0,128,5,0,0,128,6,0,0,128,
7,0,0,128,144,0,0,128,145,0,0,128,22,0,0,128,
147,0,0,128,148,0,0,128,149,0,0,128,150,0,0,128,
4,0,0,128,152,0,0,128,153,0,0,128,154,0,0,128,
155,0,0,128,20,0,0,128,21,0,0,128,158,0,0,128,
26,0,0,128,32,0,0,128,160,0,0,128,226,0,0,128,
228,0,0,128,224,0,0,128,225,0,0,128,227,0,0,128,
229,0,0,128,231,0,0,128,241,0,0,128,222,0,0,128,
46,0,0,128,60,0,0,128,40,0,0,128,43,0,0,128,
33,0,0,128,38,0,0,128,233,0,0,128,234,0,0,128,
235,0,0,128,232,0,0,128,237,0,0,128,238,0,0,128,
239,0,0,128,236,0,0,128,223,0,0,128,198,0,0,128,
36,0,0,128,42,0,0,128,41,0,0,128,59,0,0,128,
214,0,0,128,45,0,0,128,47,0,0,128,194,0,0,128,
196,0,0,128,192,0,0,128,193,0,0,128,195,0,0,128,
197,0,0,128,199,0,0,128,209,0,0,128,166,0,0,128,
44,0,0,128,37,0,0,128,95,0,0,128,62,0,0,128,
63,0,0,128,248,0,0,128,201,0,0,128,202,0,0,128,
203,0,0,128,200,0,0,128,205,0,0,128,206,0,0,128,
207,0,0,128,204,0,0,128,240,0,0,128,58,0,0,128,
35,0,0,128,208,0,0,128,39,0,0,128,61,0,0,128,
34,0,0,128,216,0,0,128,97,0,0,128,98,0,0,128,
99,0,0,128,100,0,0,128,101,0,0,128,102,0,0,128,
103,0,0,128,104,0,0,128,105,0,0,128,171,0,0,128,
187,0,0,128,96,0,0,128,253,0,0,128,123,0,0,128,
177,0,0,128,176,0,0,128,106,0,0,128,107,0,0,128,
108,0,0,128,109,0,0,128,110,0,0,128,111,0,0,128,
112,0,0,128,113,0,0,128,114,0,0,128,170,0,0,128,
186,0,0,128,125,0,0,128,184,0,0,128,93,0,0,128,
172,32,0,128,181,0,0,128,246,0,0,128,115,0,0,128,
116,0,0,128,117,0,0,128,118,0,0,128,119,0,0,128,
120,0,0,128,121,0,0,128,122,0,0,128,161,0,0,128,
191,0,0,128,64,0,0,128,221,0,0,128,91,0,0,128,
174,0,0,128,162,0,0,128,163,0,0,128,165,0,0,128,
183,0,0,128,169,0,0,128,167,0,0,128,182,0,0,128,
188,0,0,128,189,0,0,128,190,0,0,128,172,0,0,128,
124,0,0,128,175,0,0,128,168,0,0,128,92,0,0,128,
215,0,0,128,254,0,0,128,65,0,0,128,66,0,0,128,
67,0,0,128,68,0,0,128,69,0,0,128,70,0,0,128,
71,0,0,128,72,0,0,128,73,0,0,128,173,0,0,128,
244,0,0,128,126,0,0,128,242,0,0,128,243,0,0,128,
245,0,0,128,230,0,0,128,74,0,0,128,75,0,0,128,
76,0,0,128,77,0,0,128,78,0,0,128,79,0,0,128,
80,0,0,128,81,0,0,128,82,0,0,128,185,0,0,128,
251,0,0,128,252,0,0,128,249,0,0,128,250,0,0,128,
255,0,0,128,180,0,0,128,247,0,0,128,83,0,0,128,
84,0,0,128,85,0,0,128,86,0,0,128,87,0,0,128,
88,0,0,128,89,0,0,128,90,0,0,128,178,0,0,128,
212,0,0,128,94,0,0,128,210,0,0,128,211,0,0,128,
213,0,0,128,48,0,0,128,49,0,0,128,50,0,0,128,
51,0,0,128,52,0,0,128,53,0,0,128,54,0,0,128,
55,0,0,128,56,0,0,128,57,0,0,128,179,0,0,128,
219,0,0,128,220,0,0,128,217,0,0,128,218,0,0,128,
159,0,0,128,128,0,64,0,64,0,64,0,64,0,64,0,
64,0,64,0,189,0,64,0,64,0,64,0,64,0,64,0,
64,0,64,0,64,0,64,0,64,0,64,0,64,0,64,0,
64,0,64,0,64,0,64,0,64,0,64,0,64,0,64,0,
64,0,64,0,64,0,64,0,64,0,64,0,64,0,64,0,
64,0,64,0,64,0,64,0,64,0,64,0,64,0,64,0,
64,0,64,0,64,0,64,0,64,0,64,0,64,0,64,0,
64,0,64,0,64,0,64,0,64,0,64,0,64,0,64,0,
64,0,205,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,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,64,0,80,0,96,0,112,0,128,0,144,0,
160,0,176,0,192,0,208,0,224,0,240,0,0,1,16,1,
32,1,48,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,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,64,1,0,0,0,0,0,0,0,0,0,0,
0,0,79,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,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,94,1,
110,1,126,1,142,1,158,1,174,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,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,15,
1,15,2,15,3,15,55,15,45,15,46,15,47,15,22,15,
5,15,37,15,11,15,12,15,13,15,14,15,15,15,16,15,
17,15,18,15,19,15,60,15,61,15,50,15,38,15,24,15,
25,15,63,15,39,15,28,15,29,15,30,15,31,15,64,15,
79,15,127,15,123,15,91,15,108,15,80,15,125,15,77,15,
93,15,92,15,78,15,107,15,96,15,75,15,97,15,240,15,
241,15,242,15,243,15,244,15,245,15,246,15,247,15,248,15,
249,15,122,15,94,15,76,15,126,15,110,15,111,15,172,15,
193,15,194,15,195,15,196,15,197,15,198,15,199,15,200,15,
201,15,209,15,210,15,211,15,212,15,213,15,214,15,215,15,
216,15,217,15,226,15,227,15,228,15,229,15,230,15,231,15,
232,15,233,15,174,15,190,15,158,15,236,15,109,15,140,15,
129,15,130,15,131,15,132,15,133,15,134,15,135,15,136,15,
137,15,145,15,146,15,147,15,148,15,149,15,150,15,151,15,
152,15,153,15,162,15,163,15,164,15,165,15,166,15,167,15,
168,15,169,15,142,15,187,15,156,15,204,15,7,15,32,15,
33,15,34,15,35,15,36,15,21,15,6,15,23,15,40,15,
41,15,42,15,43,15,44,15,9,15,10,15,27,15,48,15,
49,15,26,15,51,15,52,15,53,15,54,15,8,15,56,15,
57,15,58,15,59,15,4,15,20,15,62,15,255,15,65,15,
170,15,176,15,177,15,0,0,178,15,106,15,181,15,189,15,
180,15,154,15,138,15,186,15,202,15,175,15,188,15,144,15,
143,15,234,15,250,15,224,15,160,15,182,15,179,15,157,15,
218,15,155,15,139,15,183,15,184,15,185,15,171,15,100,15,
101,15,98,15,102,15,99,15,103,15,90,15,104,15,116,15,
113,15,114,15,115,15,120,15,117,15,118,15,119,15,124,15,
105,15,237,15,238,15,235,15,239,15,95,15,191,15,128,15,
253,15,254,15,251,15,252,15,173,15,74,15,89,15,68,15,
69,15,66,15,70,15,67,15,71,15,208,15,72,15,84,15,
81,15,82,15,83,15,88,15,85,15,86,15,87,15,121,15,
73,15,205,15,206,15,203,15,207,15,161,15,225,15,112,15,
221,15,222,15,219,15,220,15,141,15,192,15,223,15,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,188,8,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,159,15,0,0,0,0,0,0,79,8,127,8,
123,8,91,8,108,8,80,8,125,8,77,8,93,8,92,8,
78,8,107,8,96,8,75,8,97,8,240,8,241,8,242,8,
243,8,244,8,245,8,246,8,247,8,248,8,249,8,122,8,
94,8,76,8,126,8,110,8,111,8,172,8,193,8,194,8,
195,8,196,8,197,8,198,8,199,8,200,8,201,8,209,8,
210,8,211,8,212,8,213,8,214,8,215,8,216,8,217,8,
226,8,227,8,228,8,229,8,230,8,231,8,232,8,233,8,
174,8,190,8,158,8,236,8,109,8,140,8,129,8,130,8,
131,8,132,8,133,8,134,8,135,8,136,8,137,8,145,8,
146,8,147,8,148,8,149,8,150,8,151,8,152,8,153,8,
162,8,163,8,164,8,165,8,166,8,167,8,168,8,169,8,
142,8,187,8,156,8,204,8,0,0,170,170,170,170,170,170
}
};
U_CDECL_END
|
the_stack_data/586960.c | #include <stdio.h>
// Definition des Datentyps fuer eine komplexe Zahl
typedef struct {
float real;
float imag;
}complex;
// Funktion zum Addieren komplexer Zahlen
void addComplex(complex z1, complex z2, complex* erg) {
erg->real = z1.real + z2.real;
// Alternativ: (*erg).real = z1.real + z2.real;
erg->imag = z1.imag + z2.imag;
}
// Funktion zum Subtrahieren komplexer Zahlen
void subtrComplex(complex z1, complex z2, complex* erg) {
erg->real = z1.real - z2.real;
erg->imag = z1.imag - z2.imag;
}
int main() {
complex z1, z2, resSum, resSubtr;
// Initialisierung der komplexen Zahlen
z1.real = 1.5; z1.imag = 2.2;
z2.real = 0.7; z2.imag = 1.1;
addComplex(z1, z2, &resSum);
subtrComplex(z1, z2, &resSubtr);
// Testausgaben
printf("(%.1f + j%.1f) + (%.1f + j%.1f) = %.1f + j%.1f\n", z1.real, z1.imag, z2.real, z2.imag, resSum.real, resSum.imag);
printf("(%.1f + j%.1f) - (%.1f + j%.1f) = %.1f + j%.1f\n", z1.real, z1.imag, z2.real, z2.imag, resSubtr.real, resSubtr.imag);
return 0;
} |
the_stack_data/89767.c | /*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2014, The University of Texas at Austin
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name(s) of the copyright holder(s) nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// Guard the function definitions so that they are only compiled when
// #included from files that define the object API macros.
#ifdef BLIS_ENABLE_OAPI
//
// Define object-based interfaces.
//
#undef GENFRONT
#define GENFRONT( opname ) \
\
void PASTEMAC(opname,EX_SUF) \
( \
const obj_t* alphax, \
const obj_t* alphay, \
const obj_t* x, \
const obj_t* y, \
const obj_t* z \
BLIS_OAPI_EX_PARAMS \
) \
{ \
bli_init_once(); \
\
BLIS_OAPI_EX_DECLS \
\
num_t dt = bli_obj_dt( x ); \
\
conj_t conjx = bli_obj_conj_status( x ); \
conj_t conjy = bli_obj_conj_status( y ); \
dim_t n = bli_obj_vector_dim( x ); \
void* buf_x = bli_obj_buffer_at_off( x ); \
inc_t inc_x = bli_obj_vector_inc( x ); \
void* buf_y = bli_obj_buffer_at_off( y ); \
inc_t inc_y = bli_obj_vector_inc( y ); \
void* buf_z = bli_obj_buffer_at_off( z ); \
inc_t inc_z = bli_obj_vector_inc( z ); \
\
void* buf_alphax; \
void* buf_alphay; \
\
obj_t alphax_local; \
obj_t alphay_local; \
\
if ( bli_error_checking_is_enabled() ) \
PASTEMAC(opname,_check)( alphax, alphay, x, y, z ); \
\
/* Create local copy-casts of scalars (and apply internal conjugation
as needed). */ \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
alphax, &alphax_local ); \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
alphay, &alphay_local ); \
buf_alphax = bli_obj_buffer_for_1x1( dt, &alphax_local ); \
buf_alphay = bli_obj_buffer_for_1x1( dt, &alphay_local ); \
\
/* Query a type-specific function pointer, except one that uses
void* for function arguments instead of typed pointers. */ \
PASTECH2(opname,BLIS_TAPI_EX_SUF,_vft) f = \
PASTEMAC2(opname,BLIS_TAPI_EX_SUF,_qfp)( dt ); \
\
f \
( \
conjx, \
conjy, \
n, \
buf_alphax, \
buf_alphay, \
buf_x, inc_x, \
buf_y, inc_y, \
buf_z, inc_z, \
cntx, \
rntm \
); \
}
GENFRONT( axpy2v )
#undef GENFRONT
#define GENFRONT( opname ) \
\
void PASTEMAC(opname,EX_SUF) \
( \
const obj_t* alpha, \
const obj_t* a, \
const obj_t* x, \
const obj_t* y \
BLIS_OAPI_EX_PARAMS \
) \
{ \
bli_init_once(); \
\
BLIS_OAPI_EX_DECLS \
\
num_t dt = bli_obj_dt( x ); \
\
conj_t conja = bli_obj_conj_status( a ); \
conj_t conjx = bli_obj_conj_status( x ); \
dim_t m = bli_obj_vector_dim( y ); \
dim_t b_n = bli_obj_vector_dim( x ); \
void* buf_a = bli_obj_buffer_at_off( a ); \
inc_t rs_a = bli_obj_row_stride( a ); \
inc_t cs_a = bli_obj_col_stride( a ); \
void* buf_x = bli_obj_buffer_at_off( x ); \
inc_t inc_x = bli_obj_vector_inc( x ); \
void* buf_y = bli_obj_buffer_at_off( y ); \
inc_t inc_y = bli_obj_vector_inc( y ); \
\
void* buf_alpha; \
\
obj_t alpha_local; \
\
if ( bli_error_checking_is_enabled() ) \
PASTEMAC(opname,_check)( alpha, a, x, y ); \
\
/* Create local copy-casts of scalars (and apply internal conjugation
as needed). */ \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
alpha, &alpha_local ); \
buf_alpha = bli_obj_buffer_for_1x1( dt, &alpha_local ); \
\
/* Support cases where matrix A requires a transposition. */ \
if ( bli_obj_has_trans( a ) ) { bli_swap_incs( &rs_a, &cs_a ); } \
\
/* Query a type-specific function pointer, except one that uses
void* for function arguments instead of typed pointers. */ \
PASTECH2(opname,BLIS_TAPI_EX_SUF,_vft) f = \
PASTEMAC2(opname,BLIS_TAPI_EX_SUF,_qfp)( dt ); \
\
f \
( \
conja, \
conjx, \
m, \
b_n, \
buf_alpha, \
buf_a, rs_a, cs_a, \
buf_x, inc_x, \
buf_y, inc_y, \
cntx, \
rntm \
); \
}
GENFRONT( axpyf )
#undef GENFRONT
#define GENFRONT( opname ) \
\
void PASTEMAC(opname,EX_SUF) \
( \
const obj_t* alpha, \
const obj_t* xt, \
const obj_t* x, \
const obj_t* y, \
const obj_t* rho, \
const obj_t* z \
BLIS_OAPI_EX_PARAMS \
) \
{ \
bli_init_once(); \
\
BLIS_OAPI_EX_DECLS \
\
num_t dt = bli_obj_dt( x ); \
\
conj_t conjxt = bli_obj_conj_status( xt ); \
conj_t conjx = bli_obj_conj_status( x ); \
conj_t conjy = bli_obj_conj_status( y ); \
dim_t n = bli_obj_vector_dim( x ); \
void* buf_x = bli_obj_buffer_at_off( x ); \
inc_t inc_x = bli_obj_vector_inc( x ); \
void* buf_y = bli_obj_buffer_at_off( y ); \
inc_t inc_y = bli_obj_vector_inc( y ); \
void* buf_z = bli_obj_buffer_at_off( z ); \
inc_t inc_z = bli_obj_vector_inc( z ); \
void* buf_rho = bli_obj_buffer_at_off( rho ); \
\
void* buf_alpha; \
\
obj_t alpha_local; \
\
if ( bli_error_checking_is_enabled() ) \
PASTEMAC(opname,_check)( alpha, xt, x, y, rho, z ); \
\
/* Create local copy-casts of scalars (and apply internal conjugation
as needed). */ \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
alpha, &alpha_local ); \
buf_alpha = bli_obj_buffer_for_1x1( dt, &alpha_local ); \
\
/* Query a type-specific function pointer, except one that uses
void* for function arguments instead of typed pointers. */ \
PASTECH2(opname,BLIS_TAPI_EX_SUF,_vft) f = \
PASTEMAC2(opname,BLIS_TAPI_EX_SUF,_qfp)( dt ); \
\
f \
( \
conjxt, \
conjx, \
conjy, \
n, \
buf_alpha, \
buf_x, inc_x, \
buf_y, inc_y, \
buf_rho, \
buf_z, inc_z, \
cntx, \
rntm \
); \
}
GENFRONT( dotaxpyv )
#undef GENFRONT
#define GENFRONT( opname ) \
\
void PASTEMAC(opname,EX_SUF) \
( \
const obj_t* alpha, \
const obj_t* at, \
const obj_t* a, \
const obj_t* w, \
const obj_t* x, \
const obj_t* beta, \
const obj_t* y, \
const obj_t* z \
BLIS_OAPI_EX_PARAMS \
) \
{ \
bli_init_once(); \
\
BLIS_OAPI_EX_DECLS \
\
num_t dt = bli_obj_dt( x ); \
\
conj_t conjat = bli_obj_conj_status( at ); \
conj_t conja = bli_obj_conj_status( a ); \
conj_t conjw = bli_obj_conj_status( w ); \
conj_t conjx = bli_obj_conj_status( x ); \
dim_t m = bli_obj_vector_dim( z ); \
dim_t b_n = bli_obj_vector_dim( y ); \
void* buf_a = bli_obj_buffer_at_off( a ); \
inc_t rs_a = bli_obj_row_stride( a ); \
inc_t cs_a = bli_obj_col_stride( a ); \
void* buf_w = bli_obj_buffer_at_off( w ); \
inc_t inc_w = bli_obj_vector_inc( w ); \
void* buf_x = bli_obj_buffer_at_off( x ); \
inc_t inc_x = bli_obj_vector_inc( x ); \
void* buf_y = bli_obj_buffer_at_off( y ); \
inc_t inc_y = bli_obj_vector_inc( y ); \
void* buf_z = bli_obj_buffer_at_off( z ); \
inc_t inc_z = bli_obj_vector_inc( z ); \
\
void* buf_alpha; \
void* buf_beta; \
\
obj_t alpha_local; \
obj_t beta_local; \
\
if ( bli_error_checking_is_enabled() ) \
PASTEMAC(opname,_check)( alpha, at, a, w, x, beta, y, z ); \
\
/* Create local copy-casts of scalars (and apply internal conjugation
as needed). */ \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
alpha, &alpha_local ); \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
beta, &beta_local ); \
buf_alpha = bli_obj_buffer_for_1x1( dt, &alpha_local ); \
buf_beta = bli_obj_buffer_for_1x1( dt, &beta_local ); \
\
/* Support cases where matrix A requires a transposition. */ \
if ( bli_obj_has_trans( a ) ) { bli_swap_incs( &rs_a, &cs_a ); } \
\
/* Query a type-specific function pointer, except one that uses
void* for function arguments instead of typed pointers. */ \
PASTECH2(opname,BLIS_TAPI_EX_SUF,_vft) f = \
PASTEMAC2(opname,BLIS_TAPI_EX_SUF,_qfp)( dt ); \
\
f \
( \
conjat, \
conja, \
conjw, \
conjx, \
m, \
b_n, \
buf_alpha, \
buf_a, rs_a, cs_a, \
buf_w, inc_w, \
buf_x, inc_x, \
buf_beta, \
buf_y, inc_y, \
buf_z, inc_z, \
cntx, \
rntm \
); \
}
GENFRONT( dotxaxpyf )
#undef GENFRONT
#define GENFRONT( opname ) \
\
void PASTEMAC(opname,EX_SUF) \
( \
const obj_t* alpha, \
const obj_t* a, \
const obj_t* x, \
const obj_t* beta, \
const obj_t* y \
BLIS_OAPI_EX_PARAMS \
) \
{ \
bli_init_once(); \
\
BLIS_OAPI_EX_DECLS \
\
num_t dt = bli_obj_dt( x ); \
\
conj_t conjat = bli_obj_conj_status( a ); \
conj_t conjx = bli_obj_conj_status( x ); \
dim_t m = bli_obj_vector_dim( x ); \
dim_t b_n = bli_obj_vector_dim( y ); \
void* buf_a = bli_obj_buffer_at_off( a ); \
inc_t rs_a = bli_obj_row_stride( a ); \
inc_t cs_a = bli_obj_col_stride( a ); \
void* buf_x = bli_obj_buffer_at_off( x ); \
inc_t inc_x = bli_obj_vector_inc( x ); \
void* buf_y = bli_obj_buffer_at_off( y ); \
inc_t inc_y = bli_obj_vector_inc( y ); \
\
void* buf_alpha; \
void* buf_beta; \
\
obj_t alpha_local; \
obj_t beta_local; \
\
if ( bli_error_checking_is_enabled() ) \
PASTEMAC(opname,_check)( alpha, a, x, beta, y ); \
\
/* Create local copy-casts of scalars (and apply internal conjugation
as needed). */ \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
alpha, &alpha_local ); \
bli_obj_scalar_init_detached_copy_of( dt, BLIS_NO_CONJUGATE, \
beta, &beta_local ); \
buf_alpha = bli_obj_buffer_for_1x1( dt, &alpha_local ); \
buf_beta = bli_obj_buffer_for_1x1( dt, &beta_local ); \
\
/* Support cases where matrix A requires a transposition. */ \
if ( bli_obj_has_trans( a ) ) { bli_swap_incs( &rs_a, &cs_a ); } \
\
/* Query a type-specific function pointer, except one that uses
void* for function arguments instead of typed pointers. */ \
PASTECH2(opname,BLIS_TAPI_EX_SUF,_vft) f = \
PASTEMAC2(opname,BLIS_TAPI_EX_SUF,_qfp)( dt ); \
\
f \
( \
conjat, \
conjx, \
m, \
b_n, \
buf_alpha, \
buf_a, rs_a, cs_a, \
buf_x, inc_x, \
buf_beta, \
buf_y, inc_y, \
cntx, \
rntm \
); \
}
GENFRONT( dotxf )
#endif
|
the_stack_data/61074721.c | #include <stdio.h>
int main(void)
{
int n, two_to_the_n;
printf("TABLE OF POWERS OF TWO\n\n n 2 to the n\n--- ------------\n");
two_to_the_n = 1;
for (n = 0; n <= 10; ++n)
{
printf("%2i %i\n",n, two_to_the_n);
two_to_the_n *= 2;
}
return 0;
}
|
the_stack_data/237643423.c | #include <stdio.h>
#include <limits.h>
#include <stdlib.h>
/*
Dynamic Programming : using Kadane’s Algorithm
*/
int max_sub_array_sum(int *arr, int size)
{
int max_sum = INT_MIN;
for (int i = 1; i < size; i++)
{
// calculating max possible sub array sum upto index i.
arr[i] = (arr[i] < (arr[i] + arr[i - 1]) ? (arr[i] + arr[i - 1]) : arr[i]);
// keeping track of max sum.
if (max_sum < arr[i])
max_sum = arr[i];
}
return max_sum;
}
void main()
{
int arr[] = {-2, -3, 4, -1, -2, 1, 5, -3}; // 7
// int arr[] = {-2, 1, -3, 4,-1, 2, 1, -5, 4}; // 6
int size = sizeof(arr) / sizeof(int);
printf("MAX SUM: %d", max_sub_array_sum(arr, size));
printf("\n");
} |
the_stack_data/175143424.c | /* getbits: get n bits from the position p */
#include<stdio.h>
unsigned getbits(unsigned x,int p,int n);
int main(void)
{
printf("%u",getbits((unsigned)8,3,1));
}
unsigned getbits(unsigned x,int p,int n)
{
return (x >> (p+1-n)) & ~(~0 << n);
}
|
the_stack_data/766366.c | /*
* 遍历每个元素，判断是不是满足条件。时间复杂度是 O(n)，空间复杂度是 O(1)。
*/
int findPeakElement(int* nums, int numsSize){
if(numsSize <= 1){
return 0;
}
for(int i = 0; i < numsSize - 1; i ++){
if(nums[i] > nums[i+1]){
return i;
}
}
return numsSize - 1;
}
|
the_stack_data/69221.c | #include <stdio.h>
void f1 (void) { printf("%i\n", 1); }
void f2 (void) { printf("%i\n", 2); }
void f3 (void) { printf("%i\n", 3); }
void f4 (void) { printf("%i\n", 4); }
void f5 (void) { printf("%i\n", 5); }
void f6 (void) { printf("%i\n", 6); }
void f7 (void) { printf("%i\n", 7); }
void f8 (void) { printf("%i\n", 8); }
void f9 (void) { printf("%i\n", 9); }
typedef void(*void_fp)(void);
// There is a basic check that excludes all functions that aren't used anywhere
// This ensures that check can't work in this example
const void_fp fp_all[] = {f1, f2 ,f3, f4, f5 ,f6, f7, f8, f9};
typedef struct fp_container
{
const void_fp fp_tbl[3];
} fp_container;
void func()
{
const fp_container container = { .fp_tbl = {f2 ,f3, f4} };
const fp_container container2 = { .fp_tbl = {f5 ,f6, f7} };
// Illegal:
//container = container2;
const void_fp fp = container.fp_tbl[1];
fp();
}
int main()
{
func();
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.