file
stringlengths 18
26
| data
stringlengths 2
1.05M
|
|---|---|
the_stack_data/97011820.c | /**
* Print the number of millis since the Epoch (Jan 1 1970)
* Compile: cc millis.cc -o millis
* Put in your path: mv millis /usr/local/bin
*
* Gist: https://gist.github.com/fatso83/86e94e91926d1311f3fa
*/
#include <stdio.h>
#include <sys/time.h>
int main(void)
{
struct timeval time_now;
gettimeofday(&time_now,NULL);
printf ("%ld%03d\n",time_now.tv_sec, (int) time_now.tv_usec/1000);
return 0;
}
|
the_stack_data/332202.c | /***
* This code is a part of EvoApproxLib library (ehw.fit.vutbr.cz/approxlib) distributed under The MIT License.
* When used, please cite the following article(s): PRABAKARAN B. S., MRAZEK V., VASICEK Z., SEKANINA L., SHAFIQUE M. ApproxFPGAs: Embracing ASIC-based Approximate Arithmetic Components for FPGA-Based Systems. DAC 2020.
***/
// MAE% = 0.16 %
// MAE = 6782976
// WCE% = 0.63 %
// WCE = 27131905
// WCRE% = 100.00 %
// EP% = 100.00 %
// MRE% = 3.06 %
// MSE = 55158.891e9
// FPGA_POWER = 1.1
// FPGA_DELAY = 12
// FPGA_LUT = 66
#include <stdint.h>
#include <stdlib.h>
uint32_t mul16u_H6P(uint16_t A, uint16_t B)
{
uint32_t P, P_;
uint16_t tmp, C_10_11,C_10_12,C_10_13,C_10_14,C_11_10,C_11_11,C_11_12,C_11_13,C_11_14,C_12_10,C_12_11,C_12_12,C_12_13,C_12_14,C_12_9,C_13_10,C_13_11,C_13_12,C_13_13,C_13_14,C_13_8,C_13_9,C_14_10,C_14_11,C_14_12,C_14_13,C_14_14,C_14_7,C_14_8,C_14_9,C_15_10,C_15_11,C_15_12,C_15_13,C_15_14,C_15_6,C_15_7,C_15_8,C_15_9,C_8_13,C_8_14,C_9_12,C_9_13,C_9_14,S_10_11,S_10_12,S_10_13,S_10_14,S_10_15,S_11_10,S_11_11,S_11_12,S_11_13,S_11_14,S_11_15,S_12_10,S_12_11,S_12_12,S_12_13,S_12_14,S_12_15,S_12_9,S_13_10,S_13_11,S_13_12,S_13_13,S_13_14,S_13_15,S_13_8,S_13_9,S_14_10,S_14_11,S_14_12,S_14_13,S_14_14,S_14_15,S_14_7,S_14_8,S_14_9,S_15_10,S_15_11,S_15_12,S_15_13,S_15_14,S_15_15,S_15_6,S_15_7,S_15_8,S_15_9,S_16_10,S_16_11,S_16_12,S_16_13,S_16_14,S_16_15,S_16_5,S_16_6,S_16_7,S_16_8,S_16_9,S_7_14,S_7_15,S_8_13,S_8_14,S_8_15,S_9_12,S_9_13,S_9_14,S_9_15;
S_7_14 = (((A>>7)&1) & ((B>>14)&1));
S_7_15 = (((A>>7)&1) & ((B>>15)&1));
S_8_13 = S_7_14^(((A>>8)&1) & ((B>>13)&1));
C_8_13 = S_7_14&(((A>>8)&1) & ((B>>13)&1));
S_8_14 = S_7_15^(((A>>8)&1) & ((B>>14)&1));
C_8_14 = S_7_15&(((A>>8)&1) & ((B>>14)&1));
S_8_15 = (((A>>8)&1) & ((B>>15)&1));
S_9_12 = S_8_13^(((A>>9)&1) & ((B>>12)&1));
C_9_12 = S_8_13&(((A>>9)&1) & ((B>>12)&1));
tmp = S_8_14^C_8_13;
S_9_13 = tmp^(((A>>9)&1) & ((B>>13)&1));
C_9_13 = (tmp&(((A>>9)&1) & ((B>>13)&1)))|(S_8_14&C_8_13);
tmp = S_8_15^C_8_14;
S_9_14 = tmp^(((A>>9)&1) & ((B>>14)&1));
C_9_14 = (tmp&(((A>>9)&1) & ((B>>14)&1)))|(S_8_15&C_8_14);
S_9_15 = (((A>>9)&1) & ((B>>15)&1));
S_10_11 = S_9_12^(((A>>10)&1) & ((B>>11)&1));
C_10_11 = S_9_12&(((A>>10)&1) & ((B>>11)&1));
tmp = S_9_13^C_9_12;
S_10_12 = tmp^(((A>>10)&1) & ((B>>12)&1));
C_10_12 = (tmp&(((A>>10)&1) & ((B>>12)&1)))|(S_9_13&C_9_12);
tmp = S_9_14^C_9_13;
S_10_13 = tmp^(((A>>10)&1) & ((B>>13)&1));
C_10_13 = (tmp&(((A>>10)&1) & ((B>>13)&1)))|(S_9_14&C_9_13);
tmp = S_9_15^C_9_14;
S_10_14 = tmp^(((A>>10)&1) & ((B>>14)&1));
C_10_14 = (tmp&(((A>>10)&1) & ((B>>14)&1)))|(S_9_15&C_9_14);
S_10_15 = (((A>>10)&1) & ((B>>15)&1));
S_11_10 = S_10_11^(((A>>11)&1) & ((B>>10)&1));
C_11_10 = S_10_11&(((A>>11)&1) & ((B>>10)&1));
tmp = S_10_12^C_10_11;
S_11_11 = tmp^(((A>>11)&1) & ((B>>11)&1));
C_11_11 = (tmp&(((A>>11)&1) & ((B>>11)&1)))|(S_10_12&C_10_11);
tmp = S_10_13^C_10_12;
S_11_12 = tmp^(((A>>11)&1) & ((B>>12)&1));
C_11_12 = (tmp&(((A>>11)&1) & ((B>>12)&1)))|(S_10_13&C_10_12);
tmp = S_10_14^C_10_13;
S_11_13 = tmp^(((A>>11)&1) & ((B>>13)&1));
C_11_13 = (tmp&(((A>>11)&1) & ((B>>13)&1)))|(S_10_14&C_10_13);
tmp = S_10_15^C_10_14;
S_11_14 = tmp^(((A>>11)&1) & ((B>>14)&1));
C_11_14 = (tmp&(((A>>11)&1) & ((B>>14)&1)))|(S_10_15&C_10_14);
S_11_15 = (((A>>11)&1) & ((B>>15)&1));
S_12_9 = S_11_10^(((A>>12)&1) & ((B>>9)&1));
C_12_9 = S_11_10&(((A>>12)&1) & ((B>>9)&1));
tmp = S_11_11^C_11_10;
S_12_10 = tmp^(((A>>12)&1) & ((B>>10)&1));
C_12_10 = (tmp&(((A>>12)&1) & ((B>>10)&1)))|(S_11_11&C_11_10);
tmp = S_11_12^C_11_11;
S_12_11 = tmp^(((A>>12)&1) & ((B>>11)&1));
C_12_11 = (tmp&(((A>>12)&1) & ((B>>11)&1)))|(S_11_12&C_11_11);
tmp = S_11_13^C_11_12;
S_12_12 = tmp^(((A>>12)&1) & ((B>>12)&1));
C_12_12 = (tmp&(((A>>12)&1) & ((B>>12)&1)))|(S_11_13&C_11_12);
tmp = S_11_14^C_11_13;
S_12_13 = tmp^(((A>>12)&1) & ((B>>13)&1));
C_12_13 = (tmp&(((A>>12)&1) & ((B>>13)&1)))|(S_11_14&C_11_13);
tmp = S_11_15^C_11_14;
S_12_14 = tmp^(((A>>12)&1) & ((B>>14)&1));
C_12_14 = (tmp&(((A>>12)&1) & ((B>>14)&1)))|(S_11_15&C_11_14);
S_12_15 = (((A>>12)&1) & ((B>>15)&1));
S_13_8 = S_12_9^(((A>>13)&1) & ((B>>8)&1));
C_13_8 = S_12_9&(((A>>13)&1) & ((B>>8)&1));
tmp = S_12_10^C_12_9;
S_13_9 = tmp^(((A>>13)&1) & ((B>>9)&1));
C_13_9 = (tmp&(((A>>13)&1) & ((B>>9)&1)))|(S_12_10&C_12_9);
tmp = S_12_11^C_12_10;
S_13_10 = tmp^(((A>>13)&1) & ((B>>10)&1));
C_13_10 = (tmp&(((A>>13)&1) & ((B>>10)&1)))|(S_12_11&C_12_10);
tmp = S_12_12^C_12_11;
S_13_11 = tmp^(((A>>13)&1) & ((B>>11)&1));
C_13_11 = (tmp&(((A>>13)&1) & ((B>>11)&1)))|(S_12_12&C_12_11);
tmp = S_12_13^C_12_12;
S_13_12 = tmp^(((A>>13)&1) & ((B>>12)&1));
C_13_12 = (tmp&(((A>>13)&1) & ((B>>12)&1)))|(S_12_13&C_12_12);
tmp = S_12_14^C_12_13;
S_13_13 = tmp^(((A>>13)&1) & ((B>>13)&1));
C_13_13 = (tmp&(((A>>13)&1) & ((B>>13)&1)))|(S_12_14&C_12_13);
tmp = S_12_15^C_12_14;
S_13_14 = tmp^(((A>>13)&1) & ((B>>14)&1));
C_13_14 = (tmp&(((A>>13)&1) & ((B>>14)&1)))|(S_12_15&C_12_14);
S_13_15 = (((A>>13)&1) & ((B>>15)&1));
S_14_7 = S_13_8^(((A>>14)&1) & ((B>>7)&1));
C_14_7 = S_13_8&(((A>>14)&1) & ((B>>7)&1));
tmp = S_13_9^C_13_8;
S_14_8 = tmp^(((A>>14)&1) & ((B>>8)&1));
C_14_8 = (tmp&(((A>>14)&1) & ((B>>8)&1)))|(S_13_9&C_13_8);
tmp = S_13_10^C_13_9;
S_14_9 = tmp^(((A>>14)&1) & ((B>>9)&1));
C_14_9 = (tmp&(((A>>14)&1) & ((B>>9)&1)))|(S_13_10&C_13_9);
tmp = S_13_11^C_13_10;
S_14_10 = tmp^(((A>>14)&1) & ((B>>10)&1));
C_14_10 = (tmp&(((A>>14)&1) & ((B>>10)&1)))|(S_13_11&C_13_10);
tmp = S_13_12^C_13_11;
S_14_11 = tmp^(((A>>14)&1) & ((B>>11)&1));
C_14_11 = (tmp&(((A>>14)&1) & ((B>>11)&1)))|(S_13_12&C_13_11);
tmp = S_13_13^C_13_12;
S_14_12 = tmp^(((A>>14)&1) & ((B>>12)&1));
C_14_12 = (tmp&(((A>>14)&1) & ((B>>12)&1)))|(S_13_13&C_13_12);
tmp = S_13_14^C_13_13;
S_14_13 = tmp^(((A>>14)&1) & ((B>>13)&1));
C_14_13 = (tmp&(((A>>14)&1) & ((B>>13)&1)))|(S_13_14&C_13_13);
tmp = S_13_15^C_13_14;
S_14_14 = tmp^(((A>>14)&1) & ((B>>14)&1));
C_14_14 = (tmp&(((A>>14)&1) & ((B>>14)&1)))|(S_13_15&C_13_14);
S_14_15 = (((A>>14)&1) & ((B>>15)&1));
S_15_6 = S_14_7^(((A>>15)&1) & ((B>>6)&1));
C_15_6 = S_14_7&(((A>>15)&1) & ((B>>6)&1));
tmp = S_14_8^C_14_7;
S_15_7 = tmp^(((A>>15)&1) & ((B>>7)&1));
C_15_7 = (tmp&(((A>>15)&1) & ((B>>7)&1)))|(S_14_8&C_14_7);
tmp = S_14_9^C_14_8;
S_15_8 = tmp^(((A>>15)&1) & ((B>>8)&1));
C_15_8 = (tmp&(((A>>15)&1) & ((B>>8)&1)))|(S_14_9&C_14_8);
tmp = S_14_10^C_14_9;
S_15_9 = tmp^(((A>>15)&1) & ((B>>9)&1));
C_15_9 = (tmp&(((A>>15)&1) & ((B>>9)&1)))|(S_14_10&C_14_9);
tmp = S_14_11^C_14_10;
S_15_10 = tmp^(((A>>15)&1) & ((B>>10)&1));
C_15_10 = (tmp&(((A>>15)&1) & ((B>>10)&1)))|(S_14_11&C_14_10);
tmp = S_14_12^C_14_11;
S_15_11 = tmp^(((A>>15)&1) & ((B>>11)&1));
C_15_11 = (tmp&(((A>>15)&1) & ((B>>11)&1)))|(S_14_12&C_14_11);
tmp = S_14_13^C_14_12;
S_15_12 = tmp^(((A>>15)&1) & ((B>>12)&1));
C_15_12 = (tmp&(((A>>15)&1) & ((B>>12)&1)))|(S_14_13&C_14_12);
tmp = S_14_14^C_14_13;
S_15_13 = tmp^(((A>>15)&1) & ((B>>13)&1));
C_15_13 = (tmp&(((A>>15)&1) & ((B>>13)&1)))|(S_14_14&C_14_13);
tmp = S_14_15^C_14_14;
S_15_14 = tmp^(((A>>15)&1) & ((B>>14)&1));
C_15_14 = (tmp&(((A>>15)&1) & ((B>>14)&1)))|(S_14_15&C_14_14);
S_15_15 = (((A>>15)&1) & ((B>>15)&1));
P_ = (((C_15_6 & 1)<<1)|((C_15_7 & 1)<<2)|((C_15_8 & 1)<<3)|((C_15_9 & 1)<<4)|((C_15_10 & 1)<<5)|((C_15_11 & 1)<<6)|((C_15_12 & 1)<<7)|((C_15_13 & 1)<<8)|((C_15_14 & 1)<<9)) + (((S_15_6 & 1)<<0)|((S_15_7 & 1)<<1)|((S_15_8 & 1)<<2)|((S_15_9 & 1)<<3)|((S_15_10 & 1)<<4)|((S_15_11 & 1)<<5)|((S_15_12 & 1)<<6)|((S_15_13 & 1)<<7)|((S_15_14 & 1)<<8)|((S_15_15 & 1)<<9));
S_16_5 = (P_ >> 0) & 1;
S_16_6 = (P_ >> 1) & 1;
S_16_7 = (P_ >> 2) & 1;
S_16_8 = (P_ >> 3) & 1;
S_16_9 = (P_ >> 4) & 1;
S_16_10 = (P_ >> 5) & 1;
S_16_11 = (P_ >> 6) & 1;
S_16_12 = (P_ >> 7) & 1;
S_16_13 = (P_ >> 8) & 1;
S_16_14 = (P_ >> 9) & 1;
S_16_15 = (P_ >> 10) & 1;
P = 0;
P |= (S_16_5 & 1) << 21;
P |= (S_16_6 & 1) << 22;
P |= (S_16_7 & 1) << 23;
P |= (S_16_8 & 1) << 24;
P |= (S_16_9 & 1) << 25;
P |= (S_16_10 & 1) << 26;
P |= (S_16_11 & 1) << 27;
P |= (S_16_12 & 1) << 28;
P |= (S_16_13 & 1) << 29;
P |= (S_16_14 & 1) << 30;
P |= (S_16_15 & 1) << 31;
return P;
}
|
the_stack_data/51699691.c | #include <stdio.h>
#define N 20000
void bubble_sort(double t[], int n);
double media_acima_media(double media, double t[], int n);
void popular_aux(int aux[20], double t[], int n);
double histograma(int aux[20], double t[], int n);
void histograma_vertical(double max_aux, int aux[20]);
int main() {
int n = 0;
double t[N], med, min = 100, max = -100, soma = 0;;
while(n < N && scanf("%lf", &t[n]) > 0) {
if(t[n] > max)
max = t[n];
else if(t[n] < min)
min = t[n];
soma += t[n++];
}
med = soma / n;
printf("med = %.3lf, min = %.3lf, max = %.3lf\n", med, min, max);
bubble_sort(t, n);
printf("Média das temperaturas acima da média: %.3lf\n", media_acima_media(med, t, n));
int aux[20];
popular_aux(aux, t, n);
double max_aux = histograma(aux, t, n);
histograma_vertical(max_aux, aux);
/* escreva a maior parte de seu código aqui */
return 0;
}
void bubble_sort(double t[], int n){
double aux = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (t[j] > t[j + 1]) {
aux = t[j];
t[j] = t[j + 1];
t[j + 1] = aux;
}
}
}
}
double media_acima_media(double med, double t[], int n){
double soma = 0;
int c = 0;
for(int i = 0; i < n; i++){
if(t[i] > med){
soma += t[i];
c++;
}
}
return soma / c;
}
void popular_aux(int aux[20], double t[], int n){
double passo = (t[n - 1] - t[0]) / 20, min = t[0];
int j = 0;
for(int i = 0; i < 20; i++){
double max = min + passo * (i + 1);
while(t[j] < max){
aux[i]++;
j++;
}
printf("aux[%d] = %d\n", i, aux[i]);
}
}
double histograma(int aux[20], double t[], int n){
double passo = (t[n - 1] - t[0]) / 20, min = t[0], max_aux = 0;
for(int j = 0; j < 20; j++){
double ast = aux[j] / 122.0;
double max = min + passo;
if(ast > max_aux)
max_aux = ast;
printf("Temperaturas entre %06.3lf e %06.3lf: ", min, max);
while(ast-- > 0)
printf("*");
printf("\n");
min = max;
}
return max_aux;
}
void histograma_vertical(double max_aux, int aux[20]){
printf("Histograma na vertical:\n");
for(double j = max_aux; j > 0; j--){
for(int i = 0; i < 20; i++){
printf(j <= (aux[i] + 121) / 122 ? "*" : " ");
}
printf("\n");
}
}
|
the_stack_data/192516.c | // Copyright (c) 2017 Intel Corporation
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#if defined(LINUX32)
#include "vm_strings.h"
int32_t vm_string_vprintf(const vm_char *format, va_list argptr)
{
int32_t sts = 0;
va_list copy;
va_copy(copy, argptr);
sts = vprintf(format, copy);
va_end(argptr);
return sts;
}
#else
#pragma warning( disable: 4206 )
#endif /* #if defined(LINUX32) || (__APPLE__) */
|
the_stack_data/4028.c | /* { dg-do compile } */
/* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
void foo (int * __restrict__ ia,
int * __restrict__ ib,
int * __restrict__ oxa,
int * __restrict__ oxb,
int * __restrict__ oya,
int * __restrict__ oyb)
{
int i;
long int mya[52];
long int myb[52];
for (i=0; i < 52; i++)
{
mya[i] = ia[i] * oxa[i] + ib[i] * oxb[i];
myb[i] = -ia[i] * oxb[i] + ib[i] * oxa[i];
oya[i] = mya[i] >> 10;
oyb[i] = myb[i] >> 10;
}
/* This loop was distributed, but it is not anymore due to the cost
model changes: the result of a distribution would look like this:
| for (i=0; i < 52; i++)
| oya[i] = ia[i] * oxa[i] + ib[i] * oxb[i] >> 10;
|
| for (i=0; i < 52; i++)
| oyb[i] = -ia[i] * oxb[i] + ib[i] * oxa[i] >> 10;
and in this the array IA is read in both tasks. For maximizing
the cache reuse, ldist does not distributes this loop anymore.
*/
}
/* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" } } */
|
the_stack_data/165767580.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define true 1
#define false 0
/*
PUC Minas - Ciencia da Computacao Nome: Array
Autor: Axell Brendow Batista Moreira Matricula: 631822
Versao: 1.0 Data: 11/09/2018
*/
// ----------------------- INICIO DA CLASSE ARRAY
void setAllElementsTo(void *element);
void freeArray();
// ----------------------- ATRIBUTOS DA CLASSE
void **array;
int arrayLength;
int sizeOfElements;
// ----------------------- CONSTRUTORES DA CLASSE
void StartArray()
{
array = NULL;
arrayLength = -1;
sizeOfElements = -1;
StartError();
}
void StartArrayWithSizeOfElements(int _sizeOfElements)
{
StartArray();
int errorCode = 1;
if (_sizeOfElements < 0)
{
//printf("[Array]: Tamanho dos elementos do arranjo < 0. (_sizeOfElements = %d) - StartArrayWithSizeOfElements(int)\n", _sizeOfElements);
addError(errorCode);
}
else
{
sizeOfElements = _sizeOfElements;
removeError(errorCode);
}
}
void StartArrayWithLength(int length, int _sizeOfElements)
{
StartArrayWithSizeOfElements(_sizeOfElements);
if (!hasError())
{
int errorCode = 2;
if (length < 0)
{
//printf("[Array]: Tamanho do arranjo < 0. (length = %d) - StartArrayWithLength(int, int)\n", length);
addError(errorCode);
}
else
{
freeArray(); // se o arranjo ja' existir, libera o endereco de todos elementos
// cria um novo arranjo com o tamanho especificado
void **newArray = (void **) malloc( sizeof(void *) * length );
// passa o endereco do arranjo como o endereco do arranjo da classe
array = newArray;
arrayLength = length; // atualiza o tamanho do arranjo da classe
setAllElementsTo(NULL); // coloca NULL em todos os elementos do arranjo
removeError(errorCode);
}
}
}
void StartArrayWithArray(void **_array, int length, int _sizeOfElements)
{
StartArrayWithLength(length, _sizeOfElements);
if (!hasError())
{
int errorCode = 3;
if (_array == NULL)
{
//printf("[Array]: Arranjo nulo. - ArrayClass(void **, int, int)\n");
addError(errorCode);
}
else
{
array = _array;
removeError(errorCode);
}
}
}
// ----------------------- FUNCOES DA CLASSE
/**
* Obtem quantos bytes cada elemento do arranjo gasta
*
* @return quantidade de bytes que cada elemento do arranjo gasta
*/
int getSizeOfElements()
{
return sizeOfElements;
}
/**
* Define quantos bytes cada elemento do arranjo gasta
*
* @param _sizeOfElements bytes que cada elemento do arranjo gasta
*/
void setSizeOfElements(int _sizeOfElements)
{
int errorCode = 1;
if (_sizeOfElements < 1)
{
//printf("[Array]: Tamanho dos elementos < 1. (_sizeOfElements = %d) - funcao setSizeOfElements(int)\n", _sizeOfElements);
addError(errorCode);
}
else
{
sizeOfElements = _sizeOfElements;
removeError(errorCode);
}
}
/**
* Obtem o tamanho do arranjo da classe
*
* @return tamanho do arranjo da classe
*/
int length()
{
return arrayLength;
}
/**
* Define o tamanho do arranjo da classe
*/
void setArrayLength(int _length)
{
int errorCode = 2;
if (_length < 1)
{
//printf("[Array]: Tamanho do arranjo < 1. (_length = %d) - funcao setArrayLength(int)\n", _length);
addError(errorCode);
}
else
{
arrayLength = _length;
removeError(errorCode);
}
}
/**
* Obtem o arranjo da classe
*
* @return arranjo da classe
*/
void **getArray()
{
return array;
}
/**
* Define o arranjo da classe
*/
void setArray(void **_array)
{
int errorCode = 3;
if (_array == NULL)
{
//printf("[Array]: Arranjo nulo. - funcao setArray(void **)\n");
addError(errorCode);
}
else
{
array = _array;
removeError(errorCode);
}
}
/**
* Dado o tamanho de um conjunto de elementos, checa se, a partir de um
* indice inicial, e' impossivel acessar certa quantidade deles.
*
* @param start indice inicial
* @param numberOfElements quantidade de elementos
* @param setSize tamanho do conjunto
*
* @return se for possivel acessar, retorna 0, se nao for, retorna enquanto o limite
* do conjunto sera' estourado.
*
* Obs.: Caso a quantidade de elementos informada for menor que 1, a funcao
* retornara 1.
*/
int limitOverflow(int start, int numberOfElements, int setSize)
{
int limitOverflow;
if (start < 0)
{
//printf("[Array]: Indice inicial < 0. (start = %d) - funcao limitOverflow(int, int, int)\n", start);
limitOverflow = start;
}
else if (numberOfElements < 1)
{
//printf("[Array]: Parametro numberOfElements < 1. (numberOfElements = %d) - funcao limitOverflow(int, int, int)\n", numberOfElements);
limitOverflow = 1; // 1 = true
}
else if (start + numberOfElements > setSize)
{
//printf("[Array]: Indice inicial e a quantidade de elementos transbordam o limite. (start = %d | numberOfElements = %d) - funcao limitOverflow(int, int, int)\n", start, numberOfElements);
limitOverflow = (start + numberOfElements) - setSize;
}
else
{
limitOverflow = 0; // 0 = false
}
return limitOverflow;
}
/**
* Dado o tamanho de um conjunto de elementos, checa se, a partir de um
* indice inicial, e' impossivel acessar certa quantidade deles. Caso o
* parametro backward seja true, a checagem se da no sentido contrario ao
* do conjunto, ou seja, para tras.
*
* @param start indice inicial
* @param numberOfElements quantidade de elementos
* @param setSize tamanho do conjunto
* @param backward tamanho do conjunto
*
* @return se for possivel acessar, retorna 0, se nao for, retorna enquanto o limite
* do conjunto sera' estourado.
*
* Obs.: Caso a quantidade de elementos informada for menor que 1, a funcao
* retornara 1.
*/
int backwardLimitOverflow(int start, int numberOfElements, int setSize, int backward)
{
int currentLimitOverflow;
if (backward)
{
if (start < 0)
{
//printf("[Array]: Indice inicial < 0. (start = %d) - funcao backwardLimitOverflow(int, int, int, int)\n", start);
currentLimitOverflow = start;
}
else if (start > setSize - 1)
{
//printf("[Array]: Parametro start > setSize - 1. (start = %d | setSize = %d) - funcao backwardLimitOverflow(int, int, int, int)\n", start, setSize);
currentLimitOverflow = start - (setSize - 1);
}
else // se nao,
{
// corto e jogo fora a parte posterior ao indice inicial do conjunto,
// pego o que sobrou e rotaciono 180 graus no sentido horario finjindo ser
// um novo arranjo em que o o indice inicial e' na verdade o indice 0
currentLimitOverflow = -limitOverflow(0, numberOfElements, start + 1);
}
}
else
{
currentLimitOverflow = limitOverflow(start, numberOfElements, setSize);
}
return currentLimitOverflow;
}
/**
* Dado o tamanho de um conjunto de elementos, checa se e' impossivel acessar
* um indice do conjunto.
*
* @param index indice
* @param setSize tamanho do conjunto
*
* @return se for possivel acessar, retorna 0, se nao for, retorna enquanto o limite
* do conjunto sera' estourado.
*/
int limitOverflowOnIndex(int start, int setSize)
{
return limitOverflow(start, 1, setSize);
}
/**
* Tenta acessar um elemento do arranjo da classe. Em caso de sucesso,
* retorna o elemento. Em outro caso, retorna NULL.
*
* @param index indice do elemento no arranjo
*
* @return elemento no indice informado ou NULL se o elemento nao existir
*/
void *arrayGet(int index)
{
void *result;
if (limitOverflowOnIndex(index, length()) != 0)
{
//printf("[Array]: Parametro index invalido. (index = %d) - funcao arrayGet(int)\n", index);
result = NULL;
}
else
{
result = array[index];
}
return result;
}
/**
* Tenta acessar um indice do arranjo e colocar um objeto nesse lugar.
*
* @param element elemento a ser colocado no indice especificado
* @param index indice da posicao onde deseja-se colocar o elemento
*/
void arraySet(void *element, int index)
{
if (limitOverflowOnIndex(index, length()) != 0)
{
//printf("[Array]: Parametro index invalido. (index = %d) - funcao arraySet(void *, int)\n", index);
}
else
{
array[index] = element;
}
}
/**
* Recebe dois indices de dois elementos e coloca um elemento no indice do outro.
*
* @param firstIndex indice do primeiro elemento
* @param secondIndex indice do segundo elemento
*/
void swap(int firstIndex, int secondIndex)
{
void *copy = arrayGet(firstIndex);
arraySet(arrayGet(secondIndex), firstIndex);
arraySet(copy, secondIndex);
}
/**
* A partir de um indice inicial do arranjo, move certa quantidade dos elementos
* para a esquerda deslocando-os uma certa quantidade de posicoes.
*
* @param initialIndex indice inicial
* @param numberOfElements quantidade de elementos a serem deslocados
* @param offset quantas posicoes os elementos devem ser deslocados
*/
void moveElementsToLeftFrom(int initialIndex, int numberOfElements, int offset)
{
int arrLength = length();
if (backwardLimitOverflow(initialIndex - 1, offset, arrLength, true) != 0)
{
//printf("[Array]: Parametros initialIndex e offset invalidos. (initialIndex = %d | offset = %d) - funcao moveElementsToLeftFrom(int, int, int)\n", initialIndex, offset);
}
else if (limitOverflow(initialIndex, numberOfElements, arrLength) != 0)
{
//printf("[Array]: Parametros initialIndex e numberOfElements invalidos. (initialIndex = %d | numberOfElements = %d) - funcao moveElementsToLeftFrom(int, int, int)\n", initialIndex, numberOfElements);
}
else
{
int i;
for (i = initialIndex; (i - initialIndex) < numberOfElements && i < arrLength; i++)
{
arraySet(arrayGet(i), i - offset); // coloca o elemento da posicao "i", "offset" posicoes para tras
}
}
}
/**
* A partir de um indice inicial do arranjo, move certa quantidade de elementos
* para a esquerda deslocando-os uma posicao.
*
* @param initialIndex indice inicial
* @param numberOfElements quantidade de elementos a serem deslocados
*/
void moveElements1TimeToLeftFrom(int initialIndex, int numberOfElements)
{
moveElementsToLeftFrom(initialIndex, numberOfElements, 1);
}
/**
* A partir de um indice inicial do arranjo, move todos os elementos
* para a esquerda deslocando-os uma posicao.
*
* @param initialIndex indice inicial
*/
void moveAllElementsToLeftFrom(int initialIndex)
{
moveElements1TimeToLeftFrom(initialIndex, length() - initialIndex);
}
/**
* A partir de um indice inicial do arranjo, percorrendo-o para tras, move
* certa quantidade dos elementos para a direita deslocando-os uma certa
* quantidade de posicoes.
*
* @param initialIndex indice inicial
* @param numberOfElements quantidade de elementos a serem deslocados
* @param offset quantas posicoes os elementos devem ser deslocados
*/
void moveElementsToRightFrom(int initialIndex, int numberOfElements, int offset)
{
int arrLength = length();
if (limitOverflow(initialIndex + 1, offset, arrLength) != 0)
{
//printf("[Array]: Parametros initialIndex e offset invalidos. (initialIndex = %d | offset = %d) - funcao moveElementsToRightFrom(int, int, int)\n", initialIndex, offset);
}
else if (backwardLimitOverflow(initialIndex, numberOfElements, arrLength, true) != 0)
{
//printf("[Array]: Parametros initialIndex e numberOfElements invalidos. (initialIndex = %d | numberOfElements = %d) - funcao moveElementsToRightFrom(int, int, int)\n", initialIndex, numberOfElements);
}
else
{
int i;
for (i = initialIndex; (initialIndex - i) < numberOfElements && i >= 0; i--)
{
arraySet(arrayGet(i), i + offset); // coloca o elemento da posicao "i", "offset" posicoes para frente
}
}
}
/**
* A partir de um indice inicial do arranjo, percorrendo-o para tras, move
* certa quantidade dos elementos para a direita deslocando-os uma posicao.
*
* @param initialIndex indice inicial
* @param numberOfElements quantidade de elementos a serem deslocados
*/
void moveElements1TimeToRightFrom(int initialIndex, int numberOfElements)
{
moveElementsToRightFrom(initialIndex, numberOfElements, 1);
}
/**
* A partir de um indice inicial do arranjo, percorrendo-o para tras, move
* certa quantidade dos elementos para a direita deslocando-os uma posicao.
*
* @param initialIndex indice inicial
*/
void moveAllElementsToRightFrom(int initialIndex)
{
moveElements1TimeToRightFrom(initialIndex, initialIndex + 1);
}
/**
* Procurado o indice do elemento informado
*
* @param element elemento a ser procurado
*
* @return o indice do elemento se ele existe, caso contrario, -1
*/
int indexOf(void *element)
{
int index = -1, arrLength = length();
int found = false;
int i;
for (i = 0; i < arrLength && !found; i++)
{
found = element == arrayGet(i);
}
return index;
}
/**
* Percorre o arranjo colocando o objeto especificado em todas as posicoes
*
* @param element elemento com o qual se deseja preencher o arranjo
*/
void setAllElementsTo(void *element)
{
int arrLength = length();
int i;
for (i = 0; i < arrLength; i++)
{
arraySet(element, i);
}
}
/**
* Limpar o arranjo da classe igualando todos os elementos a NULL
*/
void clearArray()
{
setAllElementsTo(NULL);
}
/**
* Copia todos os elementos de um arranjo e os coloca
* no arranjo da classe a partir de um indice inicial
*
* @param start indice de comeco da gravacao
* @param elements arranjo com os elementos a serem copiados
*
* @return true se os parametros anteriores nao levarem
* a um erro, caso contrario, false.
*/
int copyToArray(int start, void **elements, int numberOfElements)
{
// cuida de todos os possiveis casos de dados incorretos.
if (elements == NULL || limitOverflow(start, numberOfElements, length()) != 0)
{
//printf("[List]: Nao foi possivel copiar os elementos para o arranjo da classe. - funcao copyToArray(int, void **)\n");
return false;
}
int i;
for (i = 0; i < numberOfElements; i++) // percorre a quantidade de elementos
{
// associa cada objeto de "elements" 'a "array" a partir da posicao "start"
arraySet(elements[i], start + i);
}
return true;
}
/**
* Copia certa quantidade de elementos do arranjo a partir
* de um indice inicial
*
* @param start indice inicial
* @param numberOfElements quantidade de elementos
*
* @return um ponteiro para um novo arranjo que tem copias
* dos elementos do arranjo
*/
void **copyArrayPiece(int start, int numberOfElements)
{
if (limitOverflow(start, numberOfElements, length()) != 0) return NULL;
void **arrayCopy = (void **) malloc( sizeof(void *) * numberOfElements);
int i;
for (i = 0; i < numberOfElements; i++)
{
arrayCopy[i] = arrayGet(start + i);
}
return arrayCopy;
}
/**
* Copia todos os elementos do arranjo a partir do indice informado.
*
* @param start indice inicial
*
* @return um ponteiro para um novo arranjo que tem copias
* dos elementos do arranjo
*/
void **copyArrayFrom(int start)
{
return copyArrayPiece(start, length() - start);
}
/**
* Cria uma copia do arranjo da classe
*
* @return copia do arranjo da classe
*/
void **copyArray()
{
return copyArrayFrom(0);
}
void freeMyArray(void **myArray, int numberOfElements)
{
int i;
for (i = 0; i < numberOfElements; i++)
{
free( myArray[i] );
}
free(myArray);
}
void freeArray()
{
if (getArray() != NULL)
{
int arrLength = length(), i;
for (i = 0; i < arrLength; i++)
{
free(arrayGet(i));
}
free(getArray());
}
freeErrors();
}
// ----------------------- FIM DA CLASSE ARRAY |
the_stack_data/84263.c |
#include <stdio.h>
void scilab_rt_plot3d_i2d2i2_(int in00, int in01, int matrixin0[in00][in01],
int in10, int in11, double matrixin1[in10][in11],
int in20, int in21, int matrixin2[in20][in21])
{
int i;
int j;
int val0 = 0;
double val1 = 0;
int val2 = 0;
for (i = 0; i < in00; ++i) {
for (j = 0; j < in01; ++j) {
val0 += matrixin0[i][j];
}
}
printf("%d", val0);
for (i = 0; i < in10; ++i) {
for (j = 0; j < in11; ++j) {
val1 += matrixin1[i][j];
}
}
printf("%f", val1);
for (i = 0; i < in20; ++i) {
for (j = 0; j < in21; ++j) {
val2 += matrixin2[i][j];
}
}
printf("%d", val2);
}
|
the_stack_data/107954192.c | #include <stdio.h>
int main()
{
double counter;
for (counter = 0; getchar() != EOF; ++counter)
;
printf("%.0f\n", counter);
return 0;
} |
the_stack_data/165766608.c | #include <stdlib.h>
#include <assert.h>
#include <stdio.h>
typedef short int16_t;
struct this_t {
int16_t test;
int16_t hello;
};
static struct this_t * x;
void func1(struct this_t * this)
{
this->test = 10;
this->hello = 20;
}
int main(void) {
x = malloc(sizeof(*x));
assert(x != NULL);
func1(x);
printf("%d\n", x->test);
free(x);
return 0;
}
|
the_stack_data/90765906.c | // RUN: %clang_cc1 -analyze -analyzer-checker=core,experimental.core,experimental.unix,experimental.security.ArrayBound -analyzer-store=region -verify %s
//===----------------------------------------------------------------------===//
// This file tests cases where we should not flag out-of-bounds warnings.
//===----------------------------------------------------------------------===//
void f() {
long x = 0;
char *y = (char*) &x;
char c = y[0] + y[1] + y[2]; // no-warning
short *z = (short*) &x;
short s = z[0] + z[1]; // no-warning
}
void g() {
int a[2];
char *b = (char*)a;
b[3] = 'c'; // no-warning
}
typedef typeof(sizeof(int)) size_t;
void *malloc(size_t);
void free(void *);
void field() {
struct vec { size_t len; int data[0]; };
// FIXME: Not warn for this.
struct vec *a = malloc(sizeof(struct vec) + 10); // expected-warning {{Cast a region whose size is not a multiple of the destination type size}}
a->len = 10;
a->data[1] = 5; // no-warning
free(a);
}
|
the_stack_data/64725.c | /*
* Copyright (c) 2005-2006, Kohsuke Ohtani
* 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 author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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/stat.h>
#include <errno.h>
#include <err.h>
#include <string.h>
#include <stdio.h>
#include <limits.h>
#include <stdlib.h>
#ifdef CMDBOX
#define main(argc, argv) mv_main(argc, argv)
#endif
int main(int argc, char* argv[])
{
char path[PATH_MAX];
char *src, *dest, *p;
struct stat st1, st2;
int rc;
if (argc != 3) {
fprintf(stderr, "usage: mv src dest\n");
exit(1);
}
src = argv[1];
dest = argv[2];
/* Check if source exists and it's regular file. */
if (stat(src, &st1) < 0)
err(1, "mv");
if (!S_ISREG(st1.st_mode)) {
fprintf(stderr, "mv: invalid file type\n");
exit(1);
}
/* Check if target is a directory. */
rc = stat(dest, &st2);
if (!rc && S_ISDIR(st2.st_mode)) {
p = strrchr(src, '/');
p = p ? p + 1 : src;
strlcpy(path, dest, sizeof(path));
if (strcmp(dest, "/"))
strlcat(path, "/", sizeof(path));
strlcat(path, p, sizeof(path));
dest = path;
}
if (rename(src, dest) < 0)
err(1, "rename");
return 0;
}
|
the_stack_data/43063.c | // This file is part of CPAchecker,
// a tool for configurable software verification:
// https://cpachecker.sosy-lab.org
//
// SPDX-FileCopyrightText: 2007-2020 Dirk Beyer <https://www.sosy-lab.org>
//
// SPDX-License-Identifier: Apache-2.0
int isDivisible(int number, int divisor) {
while(!(number < 0)) { // FIX: while(number > 0) or while(!(number <= 0))
number -= divisor;
}
return 0 == number;
}
int gcd0(int min, int max){
for(int i = min; i >= 2; i--) {
if(isDivisible(max, i)) {
if(isDivisible(min, i)) {
return i;
}
}
}
return 1;
}
int gcd(int number1, int number2){
if(number1 <= 0 || number2 <= 0)
return -1;
if(number2 > number1) {
return gcd0(number1, number2);
}
return gcd0(number2, number1);
}
/**
* Calculate the GCD (greatest common divisor) of two positive whole numbers (0 excluded)
*/
int main(){
// Test input: GCD of 12 and 8 (= 4)
int number1 = 12;
int number2 = 8;
// "tmp" variables are a weakness of FL
// because setting result to the correct value will always work.
int result = gcd(number1, number2);
// There is no positive whole number solution for negative values or 0
if(result == -1)
goto EXIT;
// POST-CONDITION check if gcd(12,8) equals 4
if(result != 4)
goto ERROR;
EXIT: return 0;
ERROR: return 1;
}
|
the_stack_data/67324220.c | /*
* $Xorg: Flush.c,v 1.4 2001/02/09 02:03:48 xorgcvs Exp $
*
*
Copyright 1989, 1998 The Open Group
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of The Open Group shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from The Open Group.
* *
* Author: Keith Packard, MIT X Consortium
*/
/* $XFree86: xc/lib/Xdmcp/Flush.c,v 3.7 2001/07/23 13:15:42 dawes Exp $ */
#ifdef WIN32
#define _WILLWINSOCK_
#endif
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <X11/Xos.h>
#include <X11/X.h>
#include <X11/Xmd.h>
#include <X11/Xdmcp.h>
#ifdef STREAMSCONN
#include <tiuser.h>
#else
#ifdef WIN32
#include <X11/Xwinsock.h>
#else
#ifndef Lynx
#include <sys/socket.h>
#else
#include <socket.h>
#endif /* !Lynx */
#endif
#endif
int
XdmcpFlush (fd, buffer, to, tolen)
int fd;
XdmcpBufferPtr buffer;
XdmcpNetaddr to;
int tolen;
{
int result;
#ifdef STREAMSCONN
struct t_unitdata dataunit;
dataunit.addr.buf = to;
dataunit.addr.len = tolen;
dataunit.opt.len = 0; /* default options */
dataunit.udata.buf = (char *)buffer->data;
dataunit.udata.len = buffer->pointer;
result = t_sndudata(fd, &dataunit);
if (result < 0)
return FALSE;
#else
result = sendto (fd, (char *)buffer->data, buffer->pointer, 0,
(struct sockaddr *)to, tolen);
if (result != buffer->pointer)
return FALSE;
#endif
return TRUE;
}
|
the_stack_data/117329329.c |
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#define MAX_N 100
int map[MAX_N][MAX_N];
int dist[MAX_N][MAX_N];
int qu[MAX_N][MAX_N][2];
int ql[MAX_N];
int qu_off = 0;
int qu_ind = 0;
int qu_siz = 0;
void quPop(int* x, int* y) {
while (ql[qu_ind] == 0) {
qu_ind = (qu_ind + 1) % MAX_N;
qu_off++;
}
*x = qu[qu_ind][ql[qu_ind] - 1][0];
*y = qu[qu_ind][ql[qu_ind] - 1][1];
ql[qu_ind]--;
qu_siz--;
}
void quPush(int x, int y) {
int i = (qu_ind + dist[x][y] - qu_off) % MAX_N;
qu[i][ql[i]][0] = x;
qu[i][ql[i]][1] = y;
ql[i]++;
qu_siz++;
}
int main() {
int n = 0, m = 0;
char c;
while ((c = getc(stdin)) != EOF) {
m = 0;
do {
map[n][m] = c - '0';
m++;
} while ((c = getc(stdin)) != '\n');
n++;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
dist[i][j] = INT_MAX;
}
}
dist[0][0] = 0;
qu[qu_ind][0][0] = 0;
qu[qu_ind][0][1] = 0;
ql[qu_ind] = 1;
qu_siz++;
while (qu_siz != 0) {
int x, y;
quPop(&x, &y);
if (x == n - 1 && y == m - 1) {
break;
} else {
if (x != 0 && dist[x][y] + map[x - 1][y] < dist[x - 1][y]) {
dist[x - 1][y] = dist[x][y] + map[x - 1][y];
quPush(x - 1, y);
}
if (y != 0 && dist[x][y] + map[x][y - 1] < dist[x][y - 1]) {
dist[x][y - 1] = dist[x][y] + map[x][y - 1];
quPush(x, y - 1);
}
if (x != n - 1 && dist[x][y] + map[x + 1][y] < dist[x + 1][y]) {
dist[x + 1][y] = dist[x][y] + map[x + 1][y];
quPush(x + 1, y);
}
if (y != m - 1 && dist[x][y] + map[x][y + 1] < dist[x][y + 1]) {
dist[x][y + 1] = dist[x][y] + map[x][y + 1];
quPush(x, y + 1);
}
}
}
fprintf(stdout, "Result: %i\n", dist[n - 1][m - 1]);
}
|
the_stack_data/178265812.c | #include <stdio.h>
int main(){
int n = 50;
printf("n: %i\n", n);
// UN PUNTERO SIMPLEMENTE ES UNA DIRECCIÓN
int* p = &n;
printf("La dirección de n es: %p\n", p);
} |
the_stack_data/165768596.c | #ifndef __pdp11__
#define printhex(a) printf ("%04x", (unsigned short) a)
#endif
void test (a, b, msg)
long a, b;
char *msg;
{
long c;
c = a / b;
printhex ((int) (a >> 16)); printhex ((int) a);
puts (" / ");
printhex ((int) (b >> 16)); printhex ((int) b);
puts (" = ");
printhex ((int) (c >> 16)); printhex ((int) c);
puts (" -- expected ");
puts (msg);
puts ("\n");
}
int main ()
{
int a, b, c;
puts ("Testing signed long division.\n");
test (1234567L, 56789L, "00000015");
test (-1234567L, 56789L, "ffffffeb");
test (1234567L, -56789L, "ffffffeb");
test (-1234567L, -56789L, "00000015");
test (1234567L, 56L, "0000561d");
test (1234L, 56L, "00000016");
puts ("Done.\n");
return 0;
}
|
the_stack_data/61076233.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]/df(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)
*/
/* > \brief \b DLATM3 */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* Definition: */
/* =========== */
/* DOUBLE PRECISION FUNCTION DLATM3( M, N, I, J, ISUB, JSUB, KL, KU, */
/* IDIST, ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, */
/* SPARSE ) */
/* INTEGER I, IDIST, IGRADE, IPVTNG, ISUB, J, JSUB, KL, */
/* $ KU, M, N */
/* DOUBLE PRECISION SPARSE */
/* INTEGER ISEED( 4 ), IWORK( * ) */
/* DOUBLE PRECISION D( * ), DL( * ), DR( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > DLATM3 returns the (ISUB,JSUB) entry of a random matrix of */
/* > dimension (M, N) described by the other parameters. (ISUB,JSUB) */
/* > is the final position of the (I,J) entry after pivoting */
/* > according to IPVTNG and IWORK. DLATM3 is called by the */
/* > DLATMR routine in order to build random test matrices. No error */
/* > checking on parameters is done, because this routine is called in */
/* > a tight loop by DLATMR which has already checked the parameters. */
/* > */
/* > Use of DLATM3 differs from SLATM2 in the order in which the random */
/* > number generator is called to fill in random matrix entries. */
/* > With DLATM2, the generator is called to fill in the pivoted matrix */
/* > columnwise. With DLATM3, the generator is called to fill in the */
/* > matrix columnwise, after which it is pivoted. Thus, DLATM3 can */
/* > be used to construct random matrices which differ only in their */
/* > order of rows and/or columns. DLATM2 is used to construct band */
/* > matrices while avoiding calling the random number generator for */
/* > entries outside the band (and therefore generating random numbers */
/* > in different orders for different pivot orders). */
/* > */
/* > The matrix whose (ISUB,JSUB) entry is returned is constructed as */
/* > follows (this routine only computes one entry): */
/* > */
/* > If ISUB is outside (1..M) or JSUB is outside (1..N), return zero */
/* > (this is convenient for generating matrices in band format). */
/* > */
/* > Generate a matrix A with random entries of distribution IDIST. */
/* > */
/* > Set the diagonal to D. */
/* > */
/* > Grade the matrix, if desired, from the left (by DL) and/or */
/* > from the right (by DR or DL) as specified by IGRADE. */
/* > */
/* > Permute, if desired, the rows and/or columns as specified by */
/* > IPVTNG and IWORK. */
/* > */
/* > Band the matrix to have lower bandwidth KL and upper */
/* > bandwidth KU. */
/* > */
/* > Set random entries to zero as specified by SPARSE. */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] M */
/* > \verbatim */
/* > M is INTEGER */
/* > Number of rows of matrix. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > Number of columns of matrix. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] I */
/* > \verbatim */
/* > I is INTEGER */
/* > Row of unpivoted entry to be returned. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] J */
/* > \verbatim */
/* > J is INTEGER */
/* > Column of unpivoted entry to be returned. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in,out] ISUB */
/* > \verbatim */
/* > ISUB is INTEGER */
/* > Row of pivoted entry to be returned. Changed on exit. */
/* > \endverbatim */
/* > */
/* > \param[in,out] JSUB */
/* > \verbatim */
/* > JSUB is INTEGER */
/* > Column of pivoted entry to be returned. Changed on exit. */
/* > \endverbatim */
/* > */
/* > \param[in] KL */
/* > \verbatim */
/* > KL is INTEGER */
/* > Lower bandwidth. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] KU */
/* > \verbatim */
/* > KU is INTEGER */
/* > Upper bandwidth. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] IDIST */
/* > \verbatim */
/* > IDIST is INTEGER */
/* > On entry, IDIST specifies the type of distribution to be */
/* > used to generate a random matrix . */
/* > 1 => UNIFORM( 0, 1 ) */
/* > 2 => UNIFORM( -1, 1 ) */
/* > 3 => NORMAL( 0, 1 ) */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in,out] ISEED */
/* > \verbatim */
/* > ISEED is INTEGER array of dimension ( 4 ) */
/* > Seed for random number generator. */
/* > Changed on exit. */
/* > \endverbatim */
/* > */
/* > \param[in] D */
/* > \verbatim */
/* > D is DOUBLE PRECISION array of dimension ( MIN( I , J ) ) */
/* > Diagonal entries of matrix. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] IGRADE */
/* > \verbatim */
/* > IGRADE is INTEGER */
/* > Specifies grading of matrix as follows: */
/* > 0 => no grading */
/* > 1 => matrix premultiplied by diag( DL ) */
/* > 2 => matrix postmultiplied by diag( DR ) */
/* > 3 => matrix premultiplied by diag( DL ) and */
/* > postmultiplied by diag( DR ) */
/* > 4 => matrix premultiplied by diag( DL ) and */
/* > postmultiplied by inv( diag( DL ) ) */
/* > 5 => matrix premultiplied by diag( DL ) and */
/* > postmultiplied by diag( DL ) */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] DL */
/* > \verbatim */
/* > DL is DOUBLE PRECISION array ( I or J, as appropriate ) */
/* > Left scale factors for grading matrix. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] DR */
/* > \verbatim */
/* > DR is DOUBLE PRECISION array ( I or J, as appropriate ) */
/* > Right scale factors for grading matrix. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] IPVTNG */
/* > \verbatim */
/* > IPVTNG is INTEGER */
/* > On entry specifies pivoting permutations as follows: */
/* > 0 => none. */
/* > 1 => row pivoting. */
/* > 2 => column pivoting. */
/* > 3 => full pivoting, i.e., on both sides. */
/* > Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] IWORK */
/* > \verbatim */
/* > IWORK is INTEGER array ( I or J, as appropriate ) */
/* > This array specifies the permutation used. The */
/* > row (or column) originally in position K is in */
/* > position IWORK( K ) after pivoting. */
/* > This differs from IWORK for DLATM2. Not modified. */
/* > \endverbatim */
/* > */
/* > \param[in] SPARSE */
/* > \verbatim */
/* > SPARSE is DOUBLE PRECISION between 0. and 1. */
/* > On entry specifies the sparsity of the matrix */
/* > if sparse matrix is to be generated. */
/* > SPARSE should lie between 0 and 1. */
/* > A uniform ( 0, 1 ) random number x is generated and */
/* > compared to SPARSE; if x is larger the matrix entry */
/* > is unchanged and if x is smaller the entry is set */
/* > to zero. Thus on the average a fraction SPARSE of the */
/* > entries will be set to zero. */
/* > Not modified. */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date June 2016 */
/* > \ingroup double_matgen */
/* ===================================================================== */
doublereal dlatm3_(integer *m, integer *n, integer *i__, integer *j, integer *
isub, integer *jsub, integer *kl, integer *ku, integer *idist,
integer *iseed, doublereal *d__, integer *igrade, doublereal *dl,
doublereal *dr, integer *ipvtng, integer *iwork, doublereal *sparse)
{
/* System generated locals */
doublereal ret_val;
/* Local variables */
doublereal temp;
extern doublereal dlaran_(integer *), dlarnd_(integer *, integer *);
/* -- LAPACK auxiliary 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 */
/* ===================================================================== */
/* ----------------------------------------------------------------------- */
/* Check for I and J in range */
/* Parameter adjustments */
--iwork;
--dr;
--dl;
--d__;
--iseed;
/* Function Body */
if (*i__ < 1 || *i__ > *m || *j < 1 || *j > *n) {
*isub = *i__;
*jsub = *j;
ret_val = 0.;
return ret_val;
}
/* Compute subscripts depending on IPVTNG */
if (*ipvtng == 0) {
*isub = *i__;
*jsub = *j;
} else if (*ipvtng == 1) {
*isub = iwork[*i__];
*jsub = *j;
} else if (*ipvtng == 2) {
*isub = *i__;
*jsub = iwork[*j];
} else if (*ipvtng == 3) {
*isub = iwork[*i__];
*jsub = iwork[*j];
}
/* Check for banding */
if (*jsub > *isub + *ku || *jsub < *isub - *kl) {
ret_val = 0.;
return ret_val;
}
/* Check for sparsity */
if (*sparse > 0.) {
if (dlaran_(&iseed[1]) < *sparse) {
ret_val = 0.;
return ret_val;
}
}
/* Compute entry and grade it according to IGRADE */
if (*i__ == *j) {
temp = d__[*i__];
} else {
temp = dlarnd_(idist, &iseed[1]);
}
if (*igrade == 1) {
temp *= dl[*i__];
} else if (*igrade == 2) {
temp *= dr[*j];
} else if (*igrade == 3) {
temp = temp * dl[*i__] * dr[*j];
} else if (*igrade == 4 && *i__ != *j) {
temp = temp * dl[*i__] / dl[*j];
} else if (*igrade == 5) {
temp = temp * dl[*i__] * dl[*j];
}
ret_val = temp;
return ret_val;
/* End of DLATM3 */
} /* dlatm3_ */
|
the_stack_data/43886610.c | /*
* Autor: Juliano Cesar Petini & Michel Gomes de Souza
* Data de criação: 25/07/2021
* Descrição:
* Faça um Jogo da Velha que possibilite dois clientes se conectarem ao servidor usando sockets. No
* servidor, para cada cliente será criado um processo filho. Os processos filhos devem se comunicar via
* pipe para trocarem os lances dos jogadores. Ao final do jogo, os processos filhos devem ser finalizados.
*/
#include <sys/socket.h>
#include <arpa/inet.h>
#include <netinet/in.h>
#include <sys/types.h>
#include <netdb.h>
#include <unistd.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int contador;
char velha[3][3];
/* Inicia o jogo.
* Descrição:
* Reseta o jogo da velha e seta os parametros.
*/
void inicio_velha () {
memset(&velha,' ',sizeof(velha));
contador = 0;
}
/* Desenha o jogo.
* Descrição:
* Toda vez que é chamada, é redesenhado o jogo da velha na tela.
* E atualiza todas as posições já preenchidas.
*/
void desenha_velha () {
printf ("-------------\n");
printf ("| %c | %c | %c |\n", velha[0][0], velha[0][1], velha[0][2]);
printf ("-------------\n");
printf ("| %c | %c | %c |\n", velha[1][0], velha[1][1], velha[1][2]);
printf ("-------------\n");
printf ("| %c | %c | %c |\n", velha[2][0], velha[2][1], velha[2][2]);
printf ("-------------\n");
}
/* Verifica se existe um ganhador.
* Descrição:
* Toda vez que é chamada, faz a verificação se o jogador ganhou o jogo.
*/
char verifica_ganhador () {
/* contabiliza o numero de lances */
contador++;
int i;
for (i=0; i<3; i++) {
if ((velha[i][0] == velha[i][1]) && (velha[i][1] == velha[i][2])) return velha[i][1];
if ((velha[0][i] == velha[1][i]) && (velha[1][i] == velha[2][i])) return velha[1][i];
} //for
/* verifica diagonais */
if ((velha[0][0] == velha[1][1]) && (velha[1][1] == velha[2][2])) return velha[1][1];
if ((velha[0][2] == velha[1][1]) && (velha[1][1] == velha[2][0])) return velha[1][1];
/* retorna 0 para empate */
if (contador == 9) return 0;
/* retorna 32 (espa�o) para jogo indefinido */
return ' ';
}
/* Marca a jogada no tabuleiro.
* Descrição:
* Assim que o jogador faz uma jogada é marcado no tabuleiro.
*/
int marca_velha (int l, int c, char sinal) {
if (velha[l][c] != ' ') return -1;
velha[l][c] = sinal;
return 1;
}
/* Main.
* Descrição:
* - Cria a estrutura para acessar o socket.
* - Acessa via socket o servidor.
* - Inicia o jogo desenhando o tabuleiro.
* - Recebe o movimento do jogador e realiza a jogada e manda para o servidor.
*/
int main(){
int fd, first_conection = 1, line, col;
char message[100], turn = 'X', check;
fd = socket(AF_INET, SOCK_STREAM, 0);
//Configura o Socket.
struct sockaddr_in serv;
memset(&serv, '\0', sizeof(serv));
serv.sin_family = AF_INET;
serv.sin_port = htons(8096);
//Certifica de estar limpa os espaços de memória.
memset(message, '\0',sizeof(message));
//Se conecta com o servidor.
inet_pton(AF_INET, "127.0.0.1", &serv.sin_addr);
connect(fd, (struct sockaddr *)&serv, sizeof(serv));
printf("Aguardando outro cliente se conectar ao jogo.\n");
//Chama as funções para inicia e desenhar o tabuleiro.
inicio_velha();
desenha_velha();
//Fica em loop enquanto não existir um ganhador.
while(1) {
//Faz o controle de qual jogador entrou primeiro.
if (first_conection == 1){//Verifica se é o primeiro ou segundo jogador.
recv(fd, message, 4, 0);
if ((strcmp(message, "Yes") == 0)){//Aguarda outro jogador se conectar.
recv(fd, message, 4, 0);
printf("Jogador encontrado, e ele sera o primeiro a jogar, aguarde.\n");
if ((strcmp(message, "Con") == 0)){//Recebe a primeira jogada do oponente.
first_conection = -1;
recv(fd, message, 4, 0);
printf("\nPrimeira jogado do oponente: %s \n", message);
line = atoi(&message[0]); col = atoi(&message[2]); turn = 'O';
if (marca_velha(line, col, turn) != 1){ printf("Jogada do oponente foi um movimento invalido, perdeu a vez."); }
else{ printf("\nJogada do oponente feita com sucesso.\n"); desenha_velha(); }
memset(message, '\0',sizeof(message));
fflush(stdout);
}
}
else{
first_conection = -1;
printf("Já existe um oponente esperando, e você é o primeiro a jogar.\n");
}
}
//Captura o movimento do player e faz a marcação no tabuleiro.
printf("\nFaça uma jogada: ");
fgets(message, 100, stdin);
line = atoi(&message[0]); col = atoi(&message[2]); turn = 'X';
if (marca_velha(line, col, turn) != 1){ printf("Movimento invalido, perdeu a vez.");}
else{ printf("\nJogada feita com sucesso.\n"); desenha_velha(); }
send(fd, message, 4, 0);//Manda para o servidor a jogada realizada.
//Limpa a variavel e o stdin.
memset(message, '\0',sizeof(message));
fflush(stdin);
//Verifica se a jogada feita resulta em uma vitoria ou empate.
if ((check = verifica_ganhador()) != ' ') {
if ((check = verifica_ganhador()) == 0) printf("\n-> Os Jogadores empataram. <-\n");
else printf("\n->Ganhador é o %c <-\n", check);
exit(1);
}
//Fica esperando o movimento do oponente.
recv(fd, message, 4, 0);
printf("\nJogada do oponente: %s", message);
line = atoi(&message[0]); col = atoi(&message[2]); turn = 'O';
if (marca_velha(line, col, turn) != 1){ printf("Jogada do oponente foi um movimento invalido, perdeu a vez."); }
else{ printf("\nJogada do oponente feita com sucesso.\n"); desenha_velha(); }
//Limpa a variavel e o stdout.
memset(message, '\0',sizeof(message));
fflush(stdout);
//Verifica se a jogada feita pelo oponente resulta em uma vitoria ou empate.
if ((check = verifica_ganhador()) != ' ') {
if ((check = verifica_ganhador()) == 0) printf("\n-> Os Jogadores empataram. <-\n");
else printf("\n->Ganhador é o %c <-\n", check);
exit(1);
}
}
close(fd);
return 0;
}
|
the_stack_data/220455690.c | /* -*- c-basic-offset: 2 -*- */
/* Copyright(C) 2010 Brazil
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License version 2.1 as published by the Free Software Foundation.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335 USA
*/
#include <stdio.h>
#include <getopt.h>
#include <unistd.h>
#include <string.h>
#include <unicode/utf.h>
#include <unicode/uchar.h>
#include <unicode/unorm.h>
#include <unicode/ustring.h>
#define MAX_UNICODE 0x110000
#define BUF_SIZE 0x100
static int
ucs2utf(unsigned int i, unsigned char *buf)
{
unsigned char *p = buf;
if (i < 0x80) {
*p++ = i;
} else {
if (i < 0x800) {
*p++ = (i >> 6) | 0xc0;
} else {
if (i < 0x00010000) {
*p++ = (i >> 12) | 0xe0;
} else {
if (i < 0x00200000) {
*p++ = (i >> 18) | 0xf0;
} else {
if (i < 0x04000000) {
*p++ = (i >> 24) | 0xf8;
} else if (i < 0x80000000) {
*p++ = (i >> 30) | 0xfc;
*p++ = ((i >> 24) & 0x3f) | 0x80;
}
*p++ = ((i >> 18) & 0x3f) | 0x80;
}
*p++ = ((i >> 12) & 0x3f) | 0x80;
}
*p++ = ((i >> 6) & 0x3f) | 0x80;
}
*p++ = (0x3f & i) | 0x80;
}
*p = '\0';
return (p - buf);
}
void
blockcode(void)
{
UChar32 ch;
unsigned char *p, src[7];
UBlockCode code, lc = -1;
for (ch = 1; ch < MAX_UNICODE; ch++) {
if (!U_IS_UNICODE_CHAR(ch)) { continue; }
code = ublock_getCode(ch);
if (code != lc) {
ucs2utf(ch, src);
for (p = src; *p; p++) {
printf("%x:", *p);
}
printf("\t%04x\t%d\n", ch, code);
}
lc = code;
}
}
int
normalize(const char *str, char *res, UNormalizationMode mode)
{
UErrorCode rc;
int32_t ulen, nlen;
UChar ubuf[BUF_SIZE], nbuf[BUF_SIZE];
rc = U_ZERO_ERROR;
u_strFromUTF8(ubuf, BUF_SIZE, &ulen, str, -1, &rc);
if (rc != U_ZERO_ERROR /*&& rc != U_STRING_NOT_TERMINATED_WARNING*/) {
return -1;
}
rc = U_ZERO_ERROR;
nlen = unorm_normalize(ubuf, ulen, mode, 0, nbuf, BUF_SIZE, &rc);
if (rc != U_ZERO_ERROR /*&& rc != U_STRING_NOT_TERMINATED_WARNING*/) {
return -1;
}
rc = U_ZERO_ERROR;
u_strToUTF8(res, BUF_SIZE, NULL, nbuf, nlen, &rc);
if (rc != U_ZERO_ERROR /*&& rc != U_BUFFER_OVERFLOW_ERROR*/) {
return -1;
}
return 0;
}
void
dump(UNormalizationMode mode)
{
UChar32 ch;
char str[7], norm[BUF_SIZE];
for (ch = 1; ch < MAX_UNICODE; ch++) {
if (!U_IS_UNICODE_CHAR(ch)) { continue; }
ucs2utf(ch, (unsigned char *)str);
if (normalize(str, norm, mode)) {
printf("ch=%04x error occure\n", ch);
continue;
}
if (strcmp(norm, str)) {
printf("%04x\t%s\t%s\n", ch, str, norm);
}
}
}
void
ccdump(void)
{
UChar32 ch;
char str[7], nfd[BUF_SIZE], nfc[BUF_SIZE];
for (ch = 1; ch < MAX_UNICODE; ch++) {
if (!U_IS_UNICODE_CHAR(ch)) { continue; }
ucs2utf(ch, (unsigned char *)str);
if (normalize(str, nfd, UNORM_NFD)) {
printf("ch=%04x error occure\n", ch);
continue;
}
if (normalize(str, nfc, UNORM_NFC)) {
printf("ch=%04x error occure\n", ch);
continue;
}
if (strcmp(nfd, nfc)) {
printf("%04x\t%s\t%s\n", ch, nfd, nfc);
}
}
}
enum {
ctype_null = 0,
ctype_alpha,
ctype_digit,
ctype_symbol,
ctype_hiragana,
ctype_katakana,
ctype_kanji,
ctype_others
};
static const char *ctypes[] = {
"GRN_CHAR_NULL",
"GRN_CHAR_ALPHA",
"GRN_CHAR_DIGIT",
"GRN_CHAR_SYMBOL",
"GRN_CHAR_HIRAGANA",
"GRN_CHAR_KATAKANA",
"GRN_CHAR_KANJI",
"GRN_CHAR_OTHERS"
};
void
gcdump(void)
{
UChar32 ch;
unsigned char *p, src[7];
int ctype, lc = -1;
for (ch = 1; ch < MAX_UNICODE; ch++) {
UCharCategory cat;
UBlockCode code;
if (!U_IS_UNICODE_CHAR(ch)) { continue; }
code = ublock_getCode(ch);
switch (code) {
case UBLOCK_CJK_RADICALS_SUPPLEMENT: /* cjk radicals */
case UBLOCK_KANGXI_RADICALS: /* kanji radicals */
case UBLOCK_BOPOMOFO: /* bopomofo letter */
case UBLOCK_HANGUL_COMPATIBILITY_JAMO: /* hangul letter */
case UBLOCK_KANBUN: /* kaeri ten used in kanbun ex. re-ten */
case UBLOCK_BOPOMOFO_EXTENDED: /* bopomofo extended letter */
case UBLOCK_CJK_UNIFIED_IDEOGRAPHS_EXTENSION_A: /* cjk letter */
case UBLOCK_CJK_UNIFIED_IDEOGRAPHS: /* cjk letter */
case UBLOCK_YI_SYLLABLES: /* Yi syllables */
case UBLOCK_YI_RADICALS: /* Yi radicals */
case UBLOCK_HANGUL_SYLLABLES: /* hangul syllables */
case UBLOCK_CJK_COMPATIBILITY_IDEOGRAPHS: /* cjk letter */
case UBLOCK_CJK_UNIFIED_IDEOGRAPHS_EXTENSION_B: /* cjk letter */
case UBLOCK_CJK_COMPATIBILITY_IDEOGRAPHS_SUPPLEMENT: /* cjk letter */
case UBLOCK_CJK_STROKES: /* kakijun*/
ctype = ctype_kanji;
break;
case UBLOCK_CJK_SYMBOLS_AND_PUNCTUATION: /* symbols ex. JIS mark */
case UBLOCK_ENCLOSED_CJK_LETTERS_AND_MONTHS: /* ex. (kabu) */
case UBLOCK_CJK_COMPATIBILITY: /* symbols ex. ton doll */
case UBLOCK_CJK_COMPATIBILITY_FORMS: /* symbols ex. tategaki kagi-kakko */
ctype = ctype_symbol;
break;
case UBLOCK_HIRAGANA:
ctype = ctype_hiragana;
break;
case UBLOCK_KATAKANA:
case UBLOCK_KATAKANA_PHONETIC_EXTENSIONS:
ctype = ctype_katakana;
break;
default:
cat = u_charType(ch);
switch (cat) {
case U_UPPERCASE_LETTER:
case U_LOWERCASE_LETTER:
case U_TITLECASE_LETTER:
case U_MODIFIER_LETTER:
case U_OTHER_LETTER:
ctype = ctype_alpha;
break;
case U_DECIMAL_DIGIT_NUMBER:
case U_LETTER_NUMBER:
case U_OTHER_NUMBER:
ctype = ctype_digit;
break;
case U_DASH_PUNCTUATION:
case U_START_PUNCTUATION:
case U_END_PUNCTUATION:
case U_CONNECTOR_PUNCTUATION:
case U_OTHER_PUNCTUATION:
case U_MATH_SYMBOL:
case U_CURRENCY_SYMBOL:
case U_MODIFIER_SYMBOL:
case U_OTHER_SYMBOL:
ctype = ctype_symbol;
break;
default:
ctype = ctype_others;
break;
}
break;
}
if (ctype != lc) {
ucs2utf(ch, src);
for (p = src; *p; p++) {
printf("%x:", *p);
}
printf("\t%04x\t%s\n", ch, ctypes[ctype]);
}
lc = ctype;
}
}
struct option options[] = {
{"bc", 0, NULL, 'b'},
{"nfd", 0, NULL, 'd'},
{"nfkd", 0, NULL, 'D'},
{"nfc", 0, NULL, 'c'},
{"nfkc", 0, NULL, 'C'},
{"cc", 0, NULL, 'o'},
{"gc", 0, NULL, 'g'},
{"version", 0, NULL, 'v'},
};
int
main(int argc, char **argv)
{
switch (getopt_long(argc, argv, "bdDcCogv", options, NULL)) {
case 'b' :
blockcode();
break;
case 'd' :
dump(UNORM_NFD);
break;
case 'D' :
dump(UNORM_NFKD);
break;
case 'c' :
dump(UNORM_NFC);
break;
case 'C' :
dump(UNORM_NFKC);
break;
case 'o' :
ccdump();
break;
case 'g' :
gcdump();
break;
case 'v' :
printf("%s\n", U_UNICODE_VERSION);
break;
default :
fputs("usage: icudump --[bc|nfd|nfkd|nfc|nfkc|cc|gc|version]\n", stderr);
break;
}
return 0;
}
|
the_stack_data/53139.c | #include <stdio.h>
#include <stdint.h>
typedef struct Point2D
{
int32_t x;
int32_t y;
} Point2D;
typedef struct Point3D
{
int32_t x;
int32_t y;
int32_t z;
} Point3D;
void printPoint(Point2D p)
{
printf("Point2D[x=%d,y=%d]\n", p.x, p.y);
}
int main(int argc, char const *argv[])
{
Point3D p1 = {.x = 1, .y = 2, .z = 3};
printPoint(*(Point2D *)&p1);
return 0;
}
|
the_stack_data/960367.c | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
struct {
int a;
int b;
} s[5000];
main()
{
int ii,i,X1,X2;
int R[40000];
struct timespec ini,fin;
double transcurrido;
clock_gettime(CLOCK_REALTIME,&ini);
for (ii=0; ii<=40000;ii++) {
for(i=0; i<5000;i++) X1=2*s[i].a+ii;
for(i=0; i<5000;i++) X2=3*s[i].b-ii;
if (X1<X2) R[ii]=X1;
else R[ii]=X2;
}
clock_gettime(CLOCK_REALTIME,&fin);
transcurrido=(double) (fin.tv_sec-ini.tv_sec)+(double) ((fin.tv_nsec-ini.tv_nsec)/(1.e+9));
printf("Tiempo(seg): %f\nR[0]=%d, R[39999]=%d \n",transcurrido,R[0],R[39999]);
}
|
the_stack_data/64200890.c | int gas;
int memory[];
int localmem[];
int test(int addr0, int addr1, int call_dsize, int call_v, int calldata0, int calldata36, int calldata4) {
gas = 0;
int r10, r12, r13, r14, r15, r3, r30, r4, r5, r6, r7;
r10 = r12 = r13 = r14 = r15 = r3 = r30 = r4 = r5 = r6 = r7 = 0;
label1:
gas = gas + (30);
// UseMemory operations currently ignored
localmem[64] = 96;
r7 = call_dsize < 4 ? 1 : 0;
if (r7 != 0) {
goto label2;
} else {
goto label3;
}
label2:
gas = gas + (7);
return 0;
label3:
gas = gas + (45);
r5 = calldata0;
r10 = r5 / addr0;
r12 = (addr1 & r10);
r15 = 332507694 == r12 ? 1 : 0;
if (r15 != 0) {
goto label4;
} else {
goto label13;
}
label4:
gas = gas + (19);
r5 = call_v == 0 ? 1 : 0;
if (r5 != 0) {
goto label5;
} else {
goto label12;
}
label5:
gas = gas + (99);
r14 = calldata4;
r30 = calldata36;
r3 = r14;
r4 = r30;
r6 = 0;
r7 = 0;
goto label6;
label6:
gas = gas + (26);
r12 = r6 < r3 ? 1 : 0;
r13 = r12 == 0 ? 1 : 0;
if (r13 != 0) {
goto label7;
} else {
goto label11;
}
label7:
gas = gas + (1);
goto label8;
label8:
gas = gas + (26);
r12 = r7 < r4 ? 1 : 0;
r13 = r12 == 0 ? 1 : 0;
if (r13 != 0) {
goto label9;
} else {
goto label10;
}
label9:
gas = gas + (87);
r12 = r6 + r7;
// UseMemory operations currently ignored
localmem[96] = r12;
return 0;
label10:
gas = gas + (25);
r12 = 1 + r7;
r7 = r12;
goto label8;
label11:
gas = gas + (25);
r12 = 1 + r6;
r6 = r12;
goto label6;
label12:
gas = gas + (6);
return 0;
label13:
gas = gas + (7);
return 0;
}
void main(int addr0, int addr1, int call_dsize, int call_v, int calldata0, int calldata36, int calldata4) {
test(addr0, addr1, call_dsize, call_v, calldata0, calldata36, calldata4);
__VERIFIER_print_hull(gas);
return;
}
|
the_stack_data/156393133.c | // Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
// Copyright (c) 2014-2018, The Monero Project
// Copyright (c) 2014-2018, The Aeon Project
// Copyright (c) 2018, The MONCoin Developers
//
// Please see the included LICENSE file for more information.
/* This file contains the ARM versions of the CryptoNight slow-hash routines */
#if !defined NO_AES && (defined(__arm__) || defined(__aarch64__))
#pragma message("info: Using slow-hash-arm.c")
#include "slow-hash-common.h"
void slow_hash_allocate_state(void)
{
// Do nothing, this is just to maintain compatibility with the upgraded slow-hash.c
return;
}
void slow_hash_free_state(void)
{
// As above
return;
}
#if defined(__GNUC__)
#define RDATA_ALIGN16 __attribute__((aligned(16)))
#define STATIC static
#define INLINE inline
#else /* defined(__GNUC__) */
#define RDATA_ALIGN16
#define STATIC static
#define INLINE
#endif /* defined(__GNUC__) */
#define U64(x) ((uint64_t *)(x))
STATIC INLINE void xor64(uint64_t *a, const uint64_t b)
{
*a ^= b;
}
#if defined(__aarch64__) && defined(__ARM_FEATURE_CRYPTO)
/* ARMv8-A optimized with NEON and AES instructions.
* Copied from the x86-64 AES-NI implementation. It has much the same
* characteristics as x86-64: there's no 64x64=128 multiplier for vectors,
* and moving between vector and regular registers stalls the pipeline.
*/
#include <arm_neon.h>
#define state_index(x, div) (((*((uint64_t *)x) >> 4) & (TOTALBLOCKS / (div)-1)) << 4)
#define __mul() \
__asm__("mul %0, %1, %2\n\t" : "=r"(lo) : "r"(c[0]), "r"(b[0])); \
__asm__("umulh %0, %1, %2\n\t" : "=r"(hi) : "r"(c[0]), "r"(b[0]));
#define pre_aes() \
j = state_index(a, lightFlag); \
_c = vld1q_u8(&hp_state[j]); \
_a = vld1q_u8((const uint8_t *)a);
#define post_aes() \
VARIANT2_SHUFFLE_ADD_NEON(hp_state, j); \
vst1q_u8((uint8_t *)c, _c); \
vst1q_u8(&hp_state[j], veorq_u8(_b, _c)); \
VARIANT1_1(&hp_state[j]); \
j = state_index(c, lightFlag); \
p = U64(&hp_state[j]); \
b[0] = p[0]; \
b[1] = p[1]; \
VARIANT2_PORTABLE_INTEGER_MATH(b, c); \
__mul(); \
VARIANT2_2(); \
VARIANT2_SHUFFLE_ADD_NEON(hp_state, j); \
a[0] += hi; \
a[1] += lo; \
p = U64(&hp_state[j]); \
p[0] = a[0]; \
p[1] = a[1]; \
a[0] ^= b[0]; \
a[1] ^= b[1]; \
VARIANT1_2(p + 1); \
_b1 = _b; \
_b = _c;
/* Note: this was based on a standard 256bit key schedule but
* it's been shortened since Cryptonight doesn't use the full
* key schedule. Don't try to use this for vanilla AES.
*/
static void aes_expand_key(const uint8_t *key, uint8_t *expandedKey)
{
static const int rcon[] = {0x01,
0x01,
0x01,
0x01,
0x0c0f0e0d,
0x0c0f0e0d,
0x0c0f0e0d,
0x0c0f0e0d, // rotate-n-splat
0x1b,
0x1b,
0x1b,
0x1b};
__asm__(" eor v0.16b,v0.16b,v0.16b\n"
" ld1 {v3.16b},[%0],#16\n"
" ld1 {v1.4s,v2.4s},[%2],#32\n"
" ld1 {v4.16b},[%0]\n"
" mov w2,#5\n"
" st1 {v3.4s},[%1],#16\n"
"\n"
"1:\n"
" tbl v6.16b,{v4.16b},v2.16b\n"
" ext v5.16b,v0.16b,v3.16b,#12\n"
" st1 {v4.4s},[%1],#16\n"
" aese v6.16b,v0.16b\n"
" subs w2,w2,#1\n"
"\n"
" eor v3.16b,v3.16b,v5.16b\n"
" ext v5.16b,v0.16b,v5.16b,#12\n"
" eor v3.16b,v3.16b,v5.16b\n"
" ext v5.16b,v0.16b,v5.16b,#12\n"
" eor v6.16b,v6.16b,v1.16b\n"
" eor v3.16b,v3.16b,v5.16b\n"
" shl v1.16b,v1.16b,#1\n"
" eor v3.16b,v3.16b,v6.16b\n"
" st1 {v3.4s},[%1],#16\n"
" b.eq 2f\n"
"\n"
" dup v6.4s,v3.s[3] // just splat\n"
" ext v5.16b,v0.16b,v4.16b,#12\n"
" aese v6.16b,v0.16b\n"
"\n"
" eor v4.16b,v4.16b,v5.16b\n"
" ext v5.16b,v0.16b,v5.16b,#12\n"
" eor v4.16b,v4.16b,v5.16b\n"
" ext v5.16b,v0.16b,v5.16b,#12\n"
" eor v4.16b,v4.16b,v5.16b\n"
"\n"
" eor v4.16b,v4.16b,v6.16b\n"
" b 1b\n"
"\n"
"2:\n"
:
: "r"(key), "r"(expandedKey), "r"(rcon));
}
/* An ordinary AES round is a sequence of SubBytes, ShiftRows, MixColumns, AddRoundKey. There
* is also an InitialRound which consists solely of AddRoundKey. The ARM instructions slice
* this sequence differently; the aese instruction performs AddRoundKey, SubBytes, ShiftRows.
* The aesmc instruction does the MixColumns. Since the aese instruction moves the AddRoundKey
* up front, and Cryptonight's hash skips the InitialRound step, we have to kludge it here by
* feeding in a vector of zeros for our first step. Also we have to do our own Xor explicitly
* at the last step, to provide the AddRoundKey that the ARM instructions omit.
*/
STATIC INLINE void aes_pseudo_round(const uint8_t *in, uint8_t *out, const uint8_t *expandedKey, int nblocks)
{
const uint8x16_t *k = (const uint8x16_t *)expandedKey, zero = {0};
uint8x16_t tmp;
int i;
for (i = 0; i < nblocks; i++)
{
uint8x16_t tmp = vld1q_u8(in + i * AES_BLOCK_SIZE);
tmp = vaeseq_u8(tmp, zero);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[0]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[1]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[2]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[3]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[4]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[5]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[6]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[7]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[8]);
tmp = vaesmcq_u8(tmp);
tmp = veorq_u8(tmp, k[9]);
vst1q_u8(out + i * AES_BLOCK_SIZE, tmp);
}
}
STATIC INLINE void
aes_pseudo_round_xor(const uint8_t *in, uint8_t *out, const uint8_t *expandedKey, const uint8_t * xor, int nblocks)
{
const uint8x16_t *k = (const uint8x16_t *)expandedKey;
const uint8x16_t *x = (const uint8x16_t *)xor;
uint8x16_t tmp;
int i;
for (i = 0; i < nblocks; i++)
{
uint8x16_t tmp = vld1q_u8(in + i * AES_BLOCK_SIZE);
tmp = vaeseq_u8(tmp, x[i]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[0]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[1]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[2]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[3]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[4]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[5]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[6]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[7]);
tmp = vaesmcq_u8(tmp);
tmp = vaeseq_u8(tmp, k[8]);
tmp = vaesmcq_u8(tmp);
tmp = veorq_u8(tmp, k[9]);
vst1q_u8(out + i * AES_BLOCK_SIZE, tmp);
}
}
#ifdef FORCE_USE_HEAP
STATIC INLINE void *aligned_malloc(size_t size, size_t align)
{
void *result;
#ifdef _MSC_VER
result = _aligned_malloc(size, align);
#else /* _MSC_VER */
if (posix_memalign(&result, align, size))
{
result = NULL;
}
#endif /* _MSC_VER */
return result;
}
STATIC INLINE void aligned_free(void *ptr)
{
#ifdef _MSC_VER
_aligned_free(ptr);
#else /*_MSC_VER */
free(ptr);
#endif /* _MSC_VER */
}
#endif /* FORCE_USE_HEAP */
void cn_slow_hash(
const void *data,
size_t length,
char *hash,
int light,
int variant,
int prehashed,
uint64_t page_size,
uint64_t scratchpad,
uint64_t iterations)
{
uint64_t TOTALBLOCKS = (page_size / AES_BLOCK_SIZE);
uint64_t init_rounds = (scratchpad / INIT_SIZE_BYTE);
uint64_t aes_rounds = (iterations / 2);
size_t lightFlag = (light ? 2 : 1);
RDATA_ALIGN16 uint8_t expandedKey[240];
#ifndef FORCE_USE_HEAP
RDATA_ALIGN16 uint8_t hp_state[page_size];
#else /* FORCE_USE_HEAP */
#pragma message("warning: ACTIVATING FORCE_USE_HEAP IN aarch64 + crypto in slow-hash-arm.c")
uint8_t *hp_state = (uint8_t *)aligned_malloc(page_size, 16);
#endif /* FORCE_USE_HEAP */
uint8_t text[INIT_SIZE_BYTE];
RDATA_ALIGN16 uint64_t a[2];
RDATA_ALIGN16 uint64_t b[4];
RDATA_ALIGN16 uint64_t c[2];
union cn_slow_hash_state state;
uint8x16_t _a, _b, _b1, _c, zero = {0};
uint64_t hi, lo;
size_t i, j;
uint64_t *p = NULL;
static void (*const extra_hashes[4])(const void *, size_t, char *) = {
hash_extra_blake, hash_extra_groestl, hash_extra_jh, hash_extra_skein};
/* CryptoNight Step 1: Use Keccak1600 to initialize the 'state' (and 'text') buffers from the data. */
if (prehashed)
{
memcpy(&state.hs, data, length);
}
else
{
hash_process(&state.hs, data, length);
}
memcpy(text, state.init, INIT_SIZE_BYTE);
VARIANT1_INIT64();
VARIANT2_INIT64();
/* CryptoNight Step 2: Iteratively encrypt the results from Keccak to fill
* the 2MB large random access buffer.
*/
aes_expand_key(state.hs.b, expandedKey);
for (i = 0; i < init_rounds; i++)
{
aes_pseudo_round(text, text, expandedKey, INIT_SIZE_BLK);
memcpy(&hp_state[i * INIT_SIZE_BYTE], text, INIT_SIZE_BYTE);
}
U64(a)[0] = U64(&state.k[0])[0] ^ U64(&state.k[32])[0];
U64(a)[1] = U64(&state.k[0])[1] ^ U64(&state.k[32])[1];
U64(b)[0] = U64(&state.k[16])[0] ^ U64(&state.k[48])[0];
U64(b)[1] = U64(&state.k[16])[1] ^ U64(&state.k[48])[1];
/* CryptoNight Step 3: Bounce randomly 1,048,576 times (1<<20) through the mixing buffer,
* using 524,288 iterations of the following mixing function. Each execution
* performs two reads and writes from the mixing buffer.
*/
_b = vld1q_u8((const uint8_t *)b);
_b1 = vld1q_u8(((const uint8_t *)b) + AES_BLOCK_SIZE);
for (i = 0; i < aes_rounds; i++)
{
pre_aes();
_c = vaeseq_u8(_c, zero);
_c = vaesmcq_u8(_c);
_c = veorq_u8(_c, _a);
post_aes();
}
/* CryptoNight Step 4: Sequentially pass through the mixing buffer and use 10 rounds
* of AES encryption to mix the random data back into the 'text' buffer. 'text'
* was originally created with the output of Keccak1600. */
memcpy(text, state.init, INIT_SIZE_BYTE);
aes_expand_key(&state.hs.b[32], expandedKey);
for (i = 0; i < init_rounds; i++)
{
// add the xor to the pseudo round
aes_pseudo_round_xor(text, text, expandedKey, &hp_state[i * INIT_SIZE_BYTE], INIT_SIZE_BLK);
}
/* CryptoNight Step 5: Apply Keccak to the state again, and then
* use the resulting data to select which of four finalizer
* hash functions to apply to the data (Blake, Groestl, JH, or Skein).
* Use this hash to squeeze the state array down
* to the final 256 bit hash output.
*/
memcpy(state.init, text, INIT_SIZE_BYTE);
hash_permutation(&state.hs);
extra_hashes[state.hs.b[0] & 3](&state, 200, hash);
#ifdef FORCE_USE_HEAP
aligned_free(hp_state);
#endif /*FORCE_USE_HEAP */
}
#else /* defined(__aarch64__) && defined(__ARM_FEATURE_CRYPTO) */
// ND: Some minor optimizations for ARMv7 (raspberrry pi 2), effect seems to be ~40-50% faster.
// Needs more work.
#ifdef NO_OPTIMIZED_MULTIPLY_ON_ARM
/* The asm corresponds to this C code */
#define SHORT uint32_t
#define LONG uint64_t
void mul(const uint8_t *ca, const uint8_t *cb, uint8_t *cres)
{
const SHORT *aa = (SHORT *)ca;
const SHORT *bb = (SHORT *)cb;
SHORT *res = (SHORT *)cres;
union {
SHORT tmp[8];
LONG ltmp[4];
} t;
LONG A = aa[1];
LONG a = aa[0];
LONG B = bb[1];
LONG b = bb[0];
// Aa * Bb = ab + aB_ + Ab_ + AB__
t.ltmp[0] = a * b;
t.ltmp[1] = a * B;
t.ltmp[2] = A * b;
t.ltmp[3] = A * B;
res[2] = t.tmp[0];
t.ltmp[1] += t.tmp[1];
t.ltmp[1] += t.tmp[4];
t.ltmp[3] += t.tmp[3];
t.ltmp[3] += t.tmp[5];
res[3] = t.tmp[2];
res[0] = t.tmp[6];
res[1] = t.tmp[7];
}
#else // !NO_OPTIMIZED_MULTIPLY_ON_ARM
#ifdef __aarch64__ /* ARM64, no crypto */
#define mul(a, b, c) cn_mul128((const uint64_t *)a, (const uint64_t *)b, (uint64_t *)c)
STATIC void cn_mul128(const uint64_t *a, const uint64_t *b, uint64_t *r)
{
uint64_t lo, hi;
__asm__("mul %0, %1, %2\n\t" : "=r"(lo) : "r"(a[0]), "r"(b[0]));
__asm__("umulh %0, %1, %2\n\t" : "=r"(hi) : "r"(a[0]), "r"(b[0]));
r[0] = hi;
r[1] = lo;
}
#else /* ARM32 */
#define mul(a, b, c) cn_mul128((const uint32_t *)a, (const uint32_t *)b, (uint32_t *)c)
STATIC void cn_mul128(const uint32_t *aa, const uint32_t *bb, uint32_t *r)
{
uint32_t t0, t1, t2 = 0, t3 = 0;
__asm__ __volatile__("umull %[t0], %[t1], %[a], %[b]\n\t"
"str %[t0], %[ll]\n\t"
// accumulating with 0 can never overflow/carry
"eor %[t0], %[t0]\n\t"
"umlal %[t1], %[t0], %[a], %[B]\n\t"
"umlal %[t1], %[t2], %[A], %[b]\n\t"
"str %[t1], %[lh]\n\t"
"umlal %[t0], %[t3], %[A], %[B]\n\t"
// final add may have a carry
"adds %[t0], %[t0], %[t2]\n\t"
"adc %[t1], %[t3], #0\n\t"
"str %[t0], %[hl]\n\t"
"str %[t1], %[hh]\n\t"
: [t0] "=&r"(t0),
[t1] "=&r"(t1),
[t2] "+r"(t2),
[t3] "+r"(t3),
[hl] "=m"(r[0]),
[hh] "=m"(r[1]),
[ll] "=m"(r[2]),
[lh] "=m"(r[3])
: [A] "r"(aa[1]), [a] "r"(aa[0]), [B] "r"(bb[1]), [b] "r"(bb[0])
: "cc");
}
#endif /* !aarch64 */
#endif // NO_OPTIMIZED_MULTIPLY_ON_ARM
STATIC INLINE void copy_block(uint8_t *dst, const uint8_t *src)
{
memcpy(dst, src, AES_BLOCK_SIZE);
}
STATIC INLINE void sum_half_blocks(uint8_t *a, const uint8_t *b)
{
uint64_t a0, a1, b0, b1;
a0 = U64(a)[0];
a1 = U64(a)[1];
b0 = U64(b)[0];
b1 = U64(b)[1];
a0 += b0;
a1 += b1;
U64(a)[0] = a0;
U64(a)[1] = a1;
}
STATIC INLINE void swap_blocks(uint8_t *a, uint8_t *b)
{
uint64_t t[2];
U64(t)[0] = U64(a)[0];
U64(t)[1] = U64(a)[1];
U64(a)[0] = U64(b)[0];
U64(a)[1] = U64(b)[1];
U64(b)[0] = U64(t)[0];
U64(b)[1] = U64(t)[1];
}
STATIC INLINE void xor_blocks(uint8_t *a, const uint8_t *b)
{
U64(a)[0] ^= U64(b)[0];
U64(a)[1] ^= U64(b)[1];
}
void cn_slow_hash(
const void *data,
size_t length,
char *hash,
int light,
int variant,
int prehashed,
uint64_t page_size,
uint64_t scratchpad,
uint64_t iterations)
{
uint64_t init_rounds = (scratchpad / INIT_SIZE_BYTE);
uint64_t aes_rounds = (iterations / 2);
size_t lightFlag = (light ? 2 : 1);
uint8_t text[INIT_SIZE_BYTE];
uint8_t a[AES_BLOCK_SIZE];
uint8_t b[AES_BLOCK_SIZE * 2];
uint8_t c[AES_BLOCK_SIZE];
uint8_t c1[AES_BLOCK_SIZE];
uint8_t d[AES_BLOCK_SIZE];
uint8_t aes_key[AES_KEY_SIZE];
RDATA_ALIGN16 uint8_t expandedKey[256];
union cn_slow_hash_state state;
size_t i, j;
uint8_t *p = NULL;
oaes_ctx *aes_ctx;
static void (*const extra_hashes[4])(const void *, size_t, char *) = {
hash_extra_blake, hash_extra_groestl, hash_extra_jh, hash_extra_skein};
#ifndef FORCE_USE_HEAP
uint8_t long_state[page_size];
#else /* FORCE_USE_HEAP */
#pragma message("warning: ACTIVATING FORCE_USE_HEAP IN aarch64 && !crypto in slow-hash.c")
uint8_t *long_state = (uint8_t *)malloc(page_size);
#endif /* FORCE_USE_HEAP */
if (prehashed)
{
memcpy(&state.hs, data, length);
}
else
{
hash_process(&state.hs, data, length);
}
memcpy(text, state.init, INIT_SIZE_BYTE);
aes_ctx = (oaes_ctx *)oaes_alloc();
oaes_key_import_data(aes_ctx, state.hs.b, AES_KEY_SIZE);
VARIANT1_INIT64();
VARIANT2_INIT64();
// use aligned data
memcpy(expandedKey, aes_ctx->key->exp_data, aes_ctx->key->exp_data_len);
for (i = 0; i < init_rounds; i++)
{
for (j = 0; j < INIT_SIZE_BLK; j++)
aesb_pseudo_round(&text[AES_BLOCK_SIZE * j], &text[AES_BLOCK_SIZE * j], expandedKey);
memcpy(&long_state[i * INIT_SIZE_BYTE], text, INIT_SIZE_BYTE);
}
U64(a)[0] = U64(&state.k[0])[0] ^ U64(&state.k[32])[0];
U64(a)[1] = U64(&state.k[0])[1] ^ U64(&state.k[32])[1];
U64(b)[0] = U64(&state.k[16])[0] ^ U64(&state.k[48])[0];
U64(b)[1] = U64(&state.k[16])[1] ^ U64(&state.k[48])[1];
for (i = 0; i < aes_rounds; i++)
{
#define MASK(div) ((uint32_t)(((page_size / AES_BLOCK_SIZE) / (div)-1) << 4))
#define state_index(x, div) ((*(uint32_t *)x) & MASK(div))
// Iteration 1
j = state_index(a, lightFlag);
p = &long_state[j];
aesb_single_round(p, p, a);
copy_block(c1, p);
VARIANT2_PORTABLE_SHUFFLE_ADD(long_state, j);
xor_blocks(p, b);
VARIANT1_1(p);
// Iteration 2
j = state_index(c1, lightFlag);
p = &long_state[j];
copy_block(c, p);
VARIANT2_PORTABLE_INTEGER_MATH(c, c1);
mul(c1, c, d);
VARIANT2_2_PORTABLE();
VARIANT2_PORTABLE_SHUFFLE_ADD(long_state, j);
sum_half_blocks(a, d);
swap_blocks(a, c);
xor_blocks(a, c);
VARIANT1_2(U64(c) + 1);
copy_block(p, c);
if (variant >= 2)
{
copy_block(b + AES_BLOCK_SIZE, b);
}
copy_block(b, c1);
}
memcpy(text, state.init, INIT_SIZE_BYTE);
oaes_key_import_data(aes_ctx, &state.hs.b[32], AES_KEY_SIZE);
memcpy(expandedKey, aes_ctx->key->exp_data, aes_ctx->key->exp_data_len);
for (i = 0; i < init_rounds; i++)
{
for (j = 0; j < INIT_SIZE_BLK; j++)
{
xor_blocks(&text[j * AES_BLOCK_SIZE], &long_state[i * INIT_SIZE_BYTE + j * AES_BLOCK_SIZE]);
aesb_pseudo_round(&text[AES_BLOCK_SIZE * j], &text[AES_BLOCK_SIZE * j], expandedKey);
}
}
oaes_free((OAES_CTX **)&aes_ctx);
memcpy(state.init, text, INIT_SIZE_BYTE);
hash_permutation(&state.hs);
extra_hashes[state.hs.b[0] & 3](&state, 200, hash);
#ifdef FORCE_USE_HEAP
free(long_state);
#endif /* FORCE_USE_HEAP */
}
#endif /* defined(__aarch64__) && defined(__ARM_FEATURE_CRYPTO) */
#endif
|
the_stack_data/234261.c | #include <stdlib.h>
#include <stdio.h>
#include <stdbool.h>
typedef struct _link_list_stack {
int data;
struct _link_list_stack *next;
}linkListStack;
#define link_list_stack_is_empty(stack) (stack->next == NULL)
linkListStack *link_list_stack_create() {
linkListStack *stack = NULL;
stack = (linkListStack *)malloc(sizeof(linkListStack));
if (stack == NULL) {
return NULL;
}
stack->next = NULL;
return stack;
}
void link_list_stack_destory(linkListStack *stack) {
linkListStack *tmpStack = NULL;
while (!link_list_stack_is_empty(stack)) {
tmpStack = stack->next;
stack->next = stack->next->next;
free(tmpStack);
}
free(stack);
return;
}
bool link_list_stack_push(linkListStack *stack, int data) {
linkListStack *linkListData = (linkListStack *)malloc(sizeof(linkListStack));
if (linkListData == NULL) {
return false;
}
linkListData->data = data;
linkListData->next = stack->next;
stack->next = linkListData;
return true;
}
int link_list_stack_pop(linkListStack *stack) {
if (link_list_stack_is_empty(stack)) {
return -1;
}
int data = -1;
linkListStack *linkListNext = stack->next;
data = linkListNext->data;
stack->next = linkListNext->next;
free(linkListNext);
return data;
}
void link_list_dump(linkListStack *stack) {
if (link_list_stack_is_empty(stack)) {
printf("stack is empty\n");
return;
}
linkListStack *next = stack->next;
while (next != NULL) {
printf("stack data = %d\n", next->data);
next = next->next;
}
return;
}
int main(int argc, const char * argv[]) {
// insert code here...
printf("Hello, World!\n");
linkListStack *stack = link_list_stack_create();
link_list_stack_push(stack, 2);
link_list_dump(stack);
printf("\n");
link_list_stack_push(stack, 3);
link_list_dump(stack);
printf("\n");
int a = link_list_stack_pop(stack);
printf("pop %d\n", a);
link_list_dump(stack);
printf("\n");
int b = link_list_stack_pop(stack);
printf("pop %d\n", b);
link_list_dump(stack);
printf("\n");
int c = link_list_stack_pop(stack);
printf("pop %d\n", c);
link_list_dump(stack);
printf("\n");
return 0;
}
|
the_stack_data/693183.c | #include <stdio.h>
#include <stdlib.h>
int main(){
char nome[30];
int idade;
printf("\nDigite seu nome: ");
scanf("%s", &nome);
printf("Digite sua idade: ");
scanf("%d", &idade);
printf("\nNome: %s", nome);
printf("\nIdade: %d", idade);
if (idade <= 18){
printf("\nO valor do plano e: R$50.00");
}else{
if ((idade >= 19) && (idade <= 29)){
printf("\nO valor do plano e: R$70.00");
}else{
if ((idade >= 30) && (idade <= 45)){
printf("\nO valor do plano e: R$90.00");
}else{
if ((idade >= 46) && (idade <= 65)){
printf("\nO valor do plano e: R$130.00");
}else{
if (idade > 65){
printf("\nO valor do plano e: R$170.00");
}
}
}
}
}
return(0);
} |
the_stack_data/94339.c | /*
* 'ajduk' specific functionality, examples for low memory techniques
*/
#ifdef DUK_CMDLINE_AJSHEAP
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "ajs.h"
#include "ajs_heap.h"
extern uint8_t dbgHEAPDUMP;
/*
* Helpers
*/
static void safe_print_chars(const char *p, duk_size_t len, int until_nul) {
duk_size_t i;
printf("\"");
for (i = 0; i < len; i++) {
unsigned char x = (unsigned char) p[i];
if (until_nul && x == 0U) {
break;
}
if (x < 0x20 || x >= 0x7e || x == '"' || x == '\'' || x == '\\') {
printf("\\x%02x", (int) x);
} else {
printf("%c", (char) x);
}
}
printf("\"");
}
/*
* Heap initialization when using AllJoyn.js pool allocator (without any
* other AllJoyn.js integration). This serves as an example of how to
* integrate Duktape with a pool allocator and is useful for low memory
* testing.
*
* The pool sizes are not optimized here. The sizes are chosen so that
* you can look at the high water mark (hwm) and use counts (use) and see
* how much allocations are needed for each pool size. To optimize pool
* sizes more accurately, you can use --alloc-logging and inspect the memory
* allocation log which provides exact byte counts etc.
*
* https://git.allseenalliance.org/cgit/core/alljoyn-js.git
* https://git.allseenalliance.org/cgit/core/alljoyn-js.git/tree/ajs.c
*/
static const AJS_HeapConfig ajsheap_config[] = {
{ 8, 10, AJS_POOL_BORROW, 0 },
{ 12, 10, AJS_POOL_BORROW, 0 },
{ 16, 200, AJS_POOL_BORROW, 0 },
{ 20, 400, AJS_POOL_BORROW, 0 },
{ 24, 400, AJS_POOL_BORROW, 0 },
{ 28, 200, AJS_POOL_BORROW, 0 },
{ 32, 200, AJS_POOL_BORROW, 0 },
{ 40, 200, AJS_POOL_BORROW, 0 },
{ 48, 50, AJS_POOL_BORROW, 0 },
{ 52, 50, AJS_POOL_BORROW, 0 },
{ 56, 50, AJS_POOL_BORROW, 0 },
{ 60, 50, AJS_POOL_BORROW, 0 },
{ 64, 50, AJS_POOL_BORROW, 0 },
{ 128, 80, AJS_POOL_BORROW, 0 },
{ 256, 16, AJS_POOL_BORROW, 0 },
{ 512, 16, AJS_POOL_BORROW, 0 },
{ 1024, 6, AJS_POOL_BORROW, 0 },
{ 1352, 1, AJS_POOL_BORROW, 0 }, /* duk_heap, with heap ptr compression */
{ 2048, 5, AJS_POOL_BORROW, 0 },
{ 4096, 3, 0, 0 },
{ 8192, 3, 0, 0 },
{ 16384, 1, 0, 0 },
{ 32768, 1, 0, 0 }
};
uint8_t *ajsheap_ram = NULL;
void ajsheap_init(void) {
size_t heap_sz[1];
uint8_t *heap_array[1];
uint8_t num_pools, i;
AJ_Status ret;
num_pools = (uint8_t) (sizeof(ajsheap_config) / sizeof(AJS_HeapConfig));
heap_sz[0] = AJS_HeapRequired(ajsheap_config, /* heapConfig */
num_pools, /* numPools */
0); /* heapNum */
ajsheap_ram = (uint8_t *) malloc(heap_sz[0]);
if (ajsheap_ram == NULL) {
fprintf(stderr, "Failed to allocate AJS heap\n");
fflush(stderr);
exit(1);
}
heap_array[0] = ajsheap_ram;
fprintf(stderr, "Allocated AJS heap of %ld bytes, pools:", (long) heap_sz[0]);
for (i = 0; i < num_pools; i++) {
fprintf(stderr, " (sz:%ld,num:%ld,brw:%ld,idx:%ld)",
(long) ajsheap_config[i].size, (long) ajsheap_config[i].entries,
(long) ajsheap_config[i].borrow, (long) ajsheap_config[i].heapIndex);
}
fprintf(stderr, "\n");
fflush(stderr);
ret = AJS_HeapInit((void **) heap_array, /* heap */
(size_t *) heap_sz, /* heapSz */
ajsheap_config, /* heapConfig */
num_pools, /* numPools */
1); /* numHeaps */
fprintf(stderr, "AJS_HeapInit() -> %ld\n", (long) ret);
fflush(stderr);
/* Enable heap dumps */
dbgHEAPDUMP = 1;
}
/* AjsHeap.dump(), allows Ecmascript code to dump heap status at suitable
* points.
*/
duk_ret_t ajsheap_dump_binding(duk_context *ctx) {
AJS_HeapDump();
fflush(stdout);
return 0;
}
void ajsheap_dump(void) {
AJS_HeapDump();
fflush(stdout);
}
void ajsheap_register(duk_context *ctx) {
duk_push_object(ctx);
duk_push_c_function(ctx, ajsheap_dump_binding, 0);
duk_put_prop_string(ctx, -2, "dump");
duk_put_global_string(ctx, "AjsHeap");
}
/*
* Example pointer compression functions.
*
* 'base' is chosen so that no non-NULL pointer results in a zero result
* which is reserved for NULL pointers.
*/
duk_uint16_t ajsheap_enc16(void *ud, void *p) {
duk_uint32_t ret;
char *base = (char *) ajsheap_ram - 4;
/* Userdata is not needed in this case but would be useful if heap
* pointer compression were used for multiple heaps. The userdata
* allows the callback to distinguish between heaps and their base
* pointers.
*
* If not needed, the userdata can be left out during compilation
* by simply ignoring the userdata argument of the pointer encode
* and decode macros. It is kept here so that any bugs in actually
* providing the value inside Duktape are revealed during compilation.
*/
(void) ud;
#if 1
/* Ensure that we always get the heap_udata given in heap creation.
* (Useful for Duktape development, not needed for user programs.)
*/
if (ud != (void *) 0xdeadbeef) {
fprintf(stderr, "invalid udata for ajsheap_enc16: %p\n", ud);
fflush(stderr);
}
#endif
if (p == NULL) {
ret = 0;
} else {
ret = (duk_uint32_t) (((char *) p - base) >> 2);
}
#if 0
printf("ajsheap_enc16: %p -> %u\n", p, (unsigned int) ret);
#endif
if (ret > 0xffffUL) {
fprintf(stderr, "Failed to compress pointer\n");
fflush(stderr);
abort();
}
return (duk_uint16_t) ret;
}
void *ajsheap_dec16(void *ud, duk_uint16_t x) {
void *ret;
char *base = (char *) ajsheap_ram - 4;
/* See userdata discussion in ajsheap_enc16(). */
(void) ud;
#if 1
/* Ensure that we always get the heap_udata given in heap creation. */
if (ud != (void *) 0xdeadbeef) {
fprintf(stderr, "invalid udata for ajsheap_dec16: %p\n", ud);
fflush(stderr);
}
#endif
if (x == 0) {
ret = NULL;
} else {
ret = (void *) (base + (((duk_uint32_t) x) << 2));
}
#if 0
printf("ajsheap_dec16: %u -> %p\n", (unsigned int) x, ret);
#endif
return ret;
}
/*
* Simplified example of an external strings strategy where incoming strings
* are written sequentially into a fixed, memory mapped flash area.
*
* The example first scans if the string is already in the flash (which may
* happen if the same string is interned multiple times), then adds it to
* flash if there is space.
*
* This example is too slow to be used in a real world application: there
* should be e.g. a hash table to quickly check for strings that are already
* present in the string data (similarly to how string interning works in
* Duktape itself).
*/
static uint8_t ajsheap_strdata[65536];
static size_t ajsheap_strdata_used = 0;
const void *ajsheap_extstr_check_1(const void *ptr, duk_size_t len) {
uint8_t *p, *p_end;
uint8_t initial;
uint8_t *ret;
size_t left;
(void) safe_print_chars; /* potentially unused */
if (len <= 3) {
/* It's not worth it to make very small strings external, as
* they would take the same space anyway. Also avoids zero
* length degenerate case.
*/
return NULL;
}
/*
* Check if we already have the string. Be careful to compare for
* NUL terminator too, it is NOT present in 'ptr'. This algorithm
* is too simplistic and way too slow for actual use.
*/
initial = ((const uint8_t *) ptr)[0];
for (p = ajsheap_strdata, p_end = p + ajsheap_strdata_used; p != p_end; p++) {
if (*p != initial) {
continue;
}
left = (size_t) (p_end - p);
if (left >= len + 1 &&
memcmp(p, ptr, len) == 0 &&
p[len] == 0) {
ret = p;
#if 0
printf("ajsheap_extstr_check_1: ptr=%p, len=%ld ",
(void *) ptr, (long) len);
safe_print_chars((const char *) ptr, len, 0 /*until_nul*/);
printf(" -> existing %p (used=%ld)\n",
(void *) ret, (long) ajsheap_strdata_used);
#endif
return ret;
}
}
/*
* Not present yet, check if we have space. Again, be careful to
* ensure there is space for a NUL following the input data.
*/
if (ajsheap_strdata_used + len + 1 > sizeof(ajsheap_strdata)) {
#if 0
printf("ajsheap_extstr_check_1: ptr=%p, len=%ld ", (void *) ptr, (long) len);
safe_print_chars((const char *) ptr, len, 0 /*until_nul*/);
printf(" -> no space (used=%ld)\n", (long) ajsheap_strdata_used);
#endif
return NULL;
}
/*
* There is space, add the string to our collection, being careful
* to append the NUL.
*/
ret = ajsheap_strdata + ajsheap_strdata_used;
memcpy(ret, ptr, len);
ret[len] = (uint8_t) 0;
ajsheap_strdata_used += len + 1;
#if 0
printf("ajsheap_extstr_check_1: ptr=%p, len=%ld -> ", (void *) ptr, (long) len);
safe_print_chars((const char *) ptr, len, 0 /*until_nul*/);
printf(" -> %p (used=%ld)\n", (void *) ret, (long) ajsheap_strdata_used);
#endif
return (const void *) ret;
}
void ajsheap_extstr_free_1(const void *ptr) {
(void) ptr;
#if 0
printf("ajsheap_extstr_free_1: freeing extstr %p -> ", ptr);
safe_print_chars((const char *) ptr, DUK_SIZE_MAX, 1 /*until_nul*/);
printf("\n");
#endif
}
/*
* Simplified example of an external strings strategy where a set of strings
* is gathered during application compile time and baked into the application
* binary.
*
* Duktape built-in strings are available from duk_build_meta.json, see
* util/duk_meta_to_strarray.py. There may also be a lot of application
* specific strings, e.g. those used by application specific APIs. These
* must be gathered through some other means, see e.g. util/scan_strings.py.
*/
static const char *strdata_duk_builtin_strings[] = {
/*
* These strings are from util/duk_meta_to_strarray.py
*/
"Logger",
"Thread",
"Pointer",
"Buffer",
"DecEnv",
"ObjEnv",
"",
"global",
"Arguments",
"JSON",
"Math",
"Error",
"RegExp",
"Date",
"Number",
"Boolean",
"String",
"Array",
"Function",
"Object",
"Null",
"Undefined",
"{_func:true}",
"{\x22" "_func\x22" ":true}",
"{\x22" "_ninf\x22" ":true}",
"{\x22" "_inf\x22" ":true}",
"{\x22" "_nan\x22" ":true}",
"{\x22" "_undef\x22" ":true}",
"toLogString",
"clog",
"l",
"n",
"fatal",
"error",
"warn",
"debug",
"trace",
"raw",
"fmt",
"current",
"resume",
"compact",
"jc",
"jx",
"base64",
"hex",
"dec",
"enc",
"fin",
"gc",
"act",
"info",
"version",
"env",
"modLoaded",
"modSearch",
"errThrow",
"errCreate",
"compile",
"\xff" "Regbase",
"\xff" "Thread",
"\xff" "Handler",
"\xff" "Finalizer",
"\xff" "Callee",
"\xff" "Map",
"\xff" "Args",
"\xff" "This",
"\xff" "Pc2line",
"\xff" "Source",
"\xff" "Varenv",
"\xff" "Lexenv",
"\xff" "Varmap",
"\xff" "Formals",
"\xff" "Bytecode",
"\xff" "Next",
"\xff" "Target",
"\xff" "Value",
"pointer",
"buffer",
"\xff" "Tracedata",
"lineNumber",
"fileName",
"pc",
"stack",
"ThrowTypeError",
"Duktape",
"id",
"require",
"__proto__",
"setPrototypeOf",
"ownKeys",
"enumerate",
"deleteProperty",
"has",
"Proxy",
"callee",
"Invalid Date",
"[...]",
"\x0a" "\x09",
" ",
",",
"-0",
"+0",
"0",
"-Infinity",
"+Infinity",
"Infinity",
"object",
"string",
"number",
"boolean",
"undefined",
"stringify",
"tan",
"sqrt",
"sin",
"round",
"random",
"pow",
"min",
"max",
"log",
"floor",
"exp",
"cos",
"ceil",
"atan2",
"atan",
"asin",
"acos",
"abs",
"SQRT2",
"SQRT1_2",
"PI",
"LOG10E",
"LOG2E",
"LN2",
"LN10",
"E",
"message",
"name",
"input",
"index",
"(?:)",
"lastIndex",
"multiline",
"ignoreCase",
"source",
"test",
"exec",
"toGMTString",
"setYear",
"getYear",
"toJSON",
"toISOString",
"toUTCString",
"setUTCFullYear",
"setFullYear",
"setUTCMonth",
"setMonth",
"setUTCDate",
"setDate",
"setUTCHours",
"setHours",
"setUTCMinutes",
"setMinutes",
"setUTCSeconds",
"setSeconds",
"setUTCMilliseconds",
"setMilliseconds",
"setTime",
"getTimezoneOffset",
"getUTCMilliseconds",
"getMilliseconds",
"getUTCSeconds",
"getSeconds",
"getUTCMinutes",
"getMinutes",
"getUTCHours",
"getHours",
"getUTCDay",
"getDay",
"getUTCDate",
"getDate",
"getUTCMonth",
"getMonth",
"getUTCFullYear",
"getFullYear",
"getTime",
"toLocaleTimeString",
"toLocaleDateString",
"toTimeString",
"toDateString",
"now",
"UTC",
"parse",
"toPrecision",
"toExponential",
"toFixed",
"POSITIVE_INFINITY",
"NEGATIVE_INFINITY",
"NaN",
"MIN_VALUE",
"MAX_VALUE",
"substr",
"trim",
"toLocaleUpperCase",
"toUpperCase",
"toLocaleLowerCase",
"toLowerCase",
"substring",
"split",
"search",
"replace",
"match",
"localeCompare",
"charCodeAt",
"charAt",
"fromCharCode",
"reduceRight",
"reduce",
"filter",
"map",
"forEach",
"some",
"every",
"lastIndexOf",
"indexOf",
"unshift",
"splice",
"sort",
"slice",
"shift",
"reverse",
"push",
"pop",
"join",
"concat",
"isArray",
"arguments",
"caller",
"bind",
"call",
"apply",
"propertyIsEnumerable",
"isPrototypeOf",
"hasOwnProperty",
"valueOf",
"toLocaleString",
"toString",
"constructor",
"set",
"get",
"enumerable",
"configurable",
"writable",
"value",
"keys",
"isExtensible",
"isFrozen",
"isSealed",
"preventExtensions",
"freeze",
"seal",
"defineProperties",
"defineProperty",
"create",
"getOwnPropertyNames",
"getOwnPropertyDescriptor",
"getPrototypeOf",
"prototype",
"length",
"alert",
"print",
"unescape",
"escape",
"encodeURIComponent",
"encodeURI",
"decodeURIComponent",
"decodeURI",
"isFinite",
"isNaN",
"parseFloat",
"parseInt",
"eval",
"URIError",
"TypeError",
"SyntaxError",
"ReferenceError",
"RangeError",
"EvalError",
"break",
"case",
"catch",
"continue",
"debugger",
"default",
"delete",
"do",
"else",
"finally",
"for",
"function",
"if",
"in",
"instanceof",
"new",
"return",
"switch",
"this",
"throw",
"try",
"typeof",
"var",
"void",
"while",
"with",
"class",
"const",
"enum",
"export",
"extends",
"import",
"super",
"null",
"true",
"false",
"implements",
"interface",
"let",
"package",
"private",
"protected",
"public",
"static",
"yield",
/*
* These strings are manually added, and would be gathered in some
* application specific manner.
*/
"foo",
"bar",
"quux",
"enableFrob",
"disableFrob"
/* ... */
};
const void *ajsheap_extstr_check_2(const void *ptr, duk_size_t len) {
int i, n;
(void) safe_print_chars; /* potentially unused */
/* Linear scan. An actual implementation would need some acceleration
* structure, e.g. select a sublist based on first character.
*
* NOTE: input string (behind 'ptr' with 'len' bytes) DOES NOT have a
* trailing NUL character. Any strings returned from this function
* MUST have a trailing NUL character.
*/
n = (int) (sizeof(strdata_duk_builtin_strings) / sizeof(const char *));
for (i = 0; i < n; i++) {
const char *str;
str = strdata_duk_builtin_strings[i];
if (strlen(str) == len && memcmp(ptr, (const void *) str, len) == 0) {
#if 0
printf("ajsheap_extstr_check_2: ptr=%p, len=%ld ",
(void *) ptr, (long) len);
safe_print_chars((const char *) ptr, len, 0 /*until_nul*/);
printf(" -> constant string index %ld\n", (long) i);
#endif
return (void *) strdata_duk_builtin_strings[i];
}
}
#if 0
printf("ajsheap_extstr_check_2: ptr=%p, len=%ld ",
(void *) ptr, (long) len);
safe_print_chars((const char *) ptr, len, 0 /*until_nul*/);
printf(" -> not found\n");
#endif
return NULL;
}
void ajsheap_extstr_free_2(const void *ptr) {
(void) ptr;
#if 0
printf("ajsheap_extstr_free_2: freeing extstr %p -> ", ptr);
safe_print_chars((const char *) ptr, DUK_SIZE_MAX, 1 /*until_nul*/);
printf("\n");
#endif
}
/*
* External strings strategy intended for valgrind testing: external strings
* are allocated using malloc()/free() so that valgrind can be used to ensure
* that strings are e.g. freed exactly once.
*/
const void *ajsheap_extstr_check_3(const void *ptr, duk_size_t len) {
duk_uint8_t *ret;
(void) safe_print_chars; /* potentially unused */
ret = malloc((size_t) len + 1);
if (ret == NULL) {
#if 0
printf("ajsheap_extstr_check_3: ptr=%p, len=%ld ",
(void *) ptr, (long) len);
safe_print_chars((const char *) ptr, len, 0 /*until_nul*/);
printf(" -> malloc failed, return NULL\n");
#endif
return (const void *) NULL;
}
if (len > 0) {
memcpy((void *) ret, ptr, (size_t) len);
}
ret[len] = (duk_uint8_t) 0;
#if 0
printf("ajsheap_extstr_check_3: ptr=%p, len=%ld ",
(void *) ptr, (long) len);
safe_print_chars((const char *) ptr, len, 0 /*until_nul*/);
printf(" -> %p\n", (void *) ret);
#endif
return (const void *) ret;
}
void ajsheap_extstr_free_3(const void *ptr) {
(void) ptr;
#if 0
printf("ajsheap_extstr_free_3: freeing extstr %p -> ", ptr);
safe_print_chars((const char *) ptr, DUK_SIZE_MAX, 1 /*until_nul*/);
printf("\n");
#endif
free((void *) ptr);
}
#else /* DUK_CMDLINE_AJSHEAP */
int ajs_dummy = 0; /* to avoid empty source file */
#endif /* DUK_CMDLINE_AJSHEAP */
|
the_stack_data/220454518.c | int i, a;
void main()
{
for (i = 0; i < 10; i++)
a = 1;
for (i = 0; i < 11; )
a = 2;
for (i = 0; ; i++)
a = 3;
for ( ; i < 10; i++)
a = 4;
for ( ; ; )
a = 5;
} |
the_stack_data/43887598.c | #include "term.h"
#include <stdlib.h>
#include <termios.h>
#include <unistd.h>
#include <sys/ioctl.h>
void get_term_dimensions(struct winsize *ws)
{
char *s = getenv("LINES");
if (s != NULL) {
ws->ws_row = atoi(s);
s = getenv("COLUMNS");
if (s != NULL) {
ws->ws_col = atoi(s);
if (ws->ws_row && ws->ws_col)
return;
}
}
#ifdef TIOCGWINSZ
if (ioctl(1, TIOCGWINSZ, ws) == 0 &&
ws->ws_row && ws->ws_col)
return;
#endif
ws->ws_row = 25;
ws->ws_col = 80;
}
void set_term_quiet_input(struct termios *old)
{
struct termios tc;
tcgetattr(0, old);
tc = *old;
tc.c_lflag &= ~(ICANON | ECHO);
tc.c_cc[VMIN] = 0;
tc.c_cc[VTIME] = 0;
tcsetattr(0, TCSANOW, &tc);
}
|
the_stack_data/117757.c | /* Demonstration of block I-O routines fread() and fwrite().
Program writes an array of ten integers to a file and
reads them back again. */
#include <stdio.h>
#include <stdlib.h>
#define SIZE 10
main()
{
FILE *fp ;
int count, i ;
int array[SIZE] = { 0,1,2,3,4,5,6,7,8,9 } ;
/* Open the output file. */
if ( (fp = fopen("array.dat", "wb")) == NULL )
{
puts( "Error on opening output file array.dat" ) ;
exit( 1 ) ;
}
/* Write the array to the file. */
count = fwrite( array, sizeof(int), SIZE, fp ) ;
if ( count != SIZE )
{
puts( "Error on writing array.dat" ) ;
exit( EXIT_FAILURE ) ;
}
fclose( fp ) ;
/* Open the file for input. */
if ( (fp = fopen("array.dat", "rb")) == NULL )
{
puts( "Error on opening input file array.dat" ) ;
exit( EXIT_FAILURE ) ;
}
/* Read the array from the file */
count = fread( array, sizeof(int), SIZE, fp ) ;
if ( count != SIZE )
{
puts( "Error on reading array.dat" ) ;
exit( EXIT_FAILURE ) ;
}
fclose(fp) ;
puts( "The array values are :\n" ) ;
for ( i = 0 ; i < SIZE ; i++)
printf( "%d\n", array [i] ) ;
}
|
the_stack_data/130011.c | #include <stdio.h>
int main(int argc, char *argv[]) {
int a;
int i;
int *q;
int *r;
int **p;
r = &a;
a = argc;
if (a > 3) {
q = &i;
p = &q;
} else {
q = &a;
p = &r;
}
return **p;
}
|
the_stack_data/212642305.c | #include <stdio.h>
#define MAXSIZE 100
void fetch_n(char *, int n);
int main(int argc, char *argv[])
{
int n;
n = atoi(argv[1]);
if (argc < 2 || n < 1)
printf("Usage %s positive numbrer\n", argv[0]);
else
{
char words[MAXSIZE];
char *ptr = words;
fetch_n(ptr, n);
printf("Words: [%s]\nChars to read:[%d]\n"
, words, n);
}
return 0;
}
void fetch_n(char *str, int n)
{
char ch;
int i = 0;
while ((ch = getchar()) != EOF)
{
if (i < n)
{
str[i] = ch;
}
i++;
}
str[i] = 0;
}
|
the_stack_data/40762568.c | #include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <string.h>
int restoCPF(int x);
void limpaBuffer();
int validar(char *s);
int pegaN();
void novoCPF(char *cpf);
int main(int argc, char **argv) {
FILE *f;
char cpf[11];
int n = 1;
srand(time(NULL));
if(argc == 2) {
f = fopen(argv[1], "r+");
if(f != NULL) {
if(validar(argv[1]) == 1) {
fclose(f);
fopen(argv[1], "w");
} else {
fopen(argv[1], "r+");
}
} else {
f = fopen(argv[1], "w");
}
n = pegaN();
fseek(f, 0, SEEK_SET);
for(int i = 0; i < n; i++) {
novoCPF(cpf);
fprintf(f, "%s\n", cpf);
}
if(fclose(f) != 0) {
printf("Arquivo %s nao conseguiu ser salvo", argv[1]);
}
}
else if(argc > 2) {
printf("Uso geracpf [nome do arquivo] (Nome do arquivo e opcional\n");
return 0;
}
else {
novoCPF(cpf);
printf("%s\n", cpf);
}
return 0;
}
int restoCPF(int x) {
x = x * 10 % 11;
return (x == 10) ? 0 : x;
}
void novoCPF(char *cpf) {
int priDig = 0, segDig = 0, multiplicador = 10, erro = 0;
char cpfInvalidos[10][11] = { "00000000000", "11111111111", "22222222222",
"33333333333", "44444444444", "55555555555", "66666666666",
"77777777777", "88888888888", "99999999999"};
do{
for(int i = 0; i < 10; i++) {
cpf[i] = (rand() % 10) + '0';
}
for(int i = 0; i < 10; ++i) {
if(strcmp(cpf, cpfInvalidos[i]) == 0) {
erro = 1;
}
}
} while(erro);
erro = 0;
// acha primeiro digito
for(int i = 0; i <= 8; i++) {
priDig += ((cpf[i] - '0') * multiplicador);
--multiplicador;
}
cpf[9] = (restoCPF(priDig) + '0');
// acha segundo digito
multiplicador = 11;
for(int i = 0; i <= 9; i++) {
segDig += ((cpf[i] - '0') * multiplicador);
--multiplicador;
}
cpf[10] = (restoCPF(segDig) + '0');
}
void limpaBuffer() {
char c;
do {
scanf("%c", &c);
} while(c != '\n');
}
int validar(char *s) {
int erro = 0, resp;
do {
if(erro) {
printf("Resposta Invalida. ");
}
printf("Arquivo %s existe. Deseja:\n\n", s);
printf("\t1 - Para sobrescreve-lo\n");
printf("\t2 - Acrescentar ao final do arquivo\n\n");
printf("Sua escolha: ");
scanf("%d", &resp);
limpaBuffer();
erro = 1;
} while (resp < 1 && resp > 2);
return resp;
}
int pegaN() {
int resp, erro = 0;
do {
if(erro) {
printf("Numero precisa ser maior que zero ");
}
printf("Digite o numero de CPFs desejado: ");
scanf("%d", &resp);
limpaBuffer();
erro = 1;
} while(resp <= 0);
return resp;
} |
the_stack_data/154826870.c | //
// Created by zhangrongxiang on 2017/9/12.
//
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <string.h>
#include <arpa/inet.h>
#define MAXBUF 256
int main() {
struct sockaddr_in server;
char *addr = "127.0.0.1";
int port = 1995;
int socketfd = 0;
char buf[MAXBUF] = {0};
bzero(&server, sizeof(server));
server.sin_family = PF_INET;
server.sin_addr.s_addr = inet_addr(addr);
server.sin_port = htons(port);
socketfd = socket(AF_INET, SOCK_DGRAM, 0);
if (socketfd < 0) {
printf("create socket error ... ");
return -1;
}
while (1) {
memset(buf, 0, MAXBUF);
fgets(buf, MAXBUF, stdin);
int send = sendto(socketfd, buf, strlen(buf), 0,
(struct sockaddr *) &server,
sizeof(struct sockaddr)
);
if (send < 0) {
perror("sendto error ....");
break;
} else {
printf("send to %s(port=%d) len %d:%s\n",
addr, port, send, buf);
}
}
} |
the_stack_data/150142302.c | int memcmp(char *p1, char *p2, int count)
{
int result = 0;
for (int i = 0; ; i++)
{
if (i == count) {
break;
}
if (p1[i] < p2[i]) {
result = -1; break;
}
if (p1[i] > p2[i]) {
result = 1; break;
}
}
return result;
} |
the_stack_data/170453807.c | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/msg.h>
#define MSG_KEY 7777
struct MSG {
long type;
char msg[1024];
};
int main() {
int msg_id = msgget(MSG_KEY, IPC_EXCL);
if (msg_id < 0)
{
msg_id = msgget(MSG_KEY, IPC_CREAT | 0666);
}
if (msg_id < 0)
{
printf("get msg queue failed!");
return -1;
}
printf("msq key %d id %d\n", MSG_KEY, msg_id);
while(1)
{
struct MSG msg;
printf("msg type: ");
scanf("%ld", &msg.type);
printf("msg info: ");
scanf("%s", &msg.msg);
int snd_id = msgsnd(msg_id, &msg, sizeof(msg.msg), IPC_NOWAIT);
if (snd_id < 0)
{
printf("send msg failed with errno=%d[%s]\n", errno, strerror(errno));
msgctl(msg_id, IPC_RMID, 0);
return -1;
}
}
}
|
the_stack_data/62637899.c | #include <stdlib.h>
#include <stdio.h>
int main(int arch, char * argv[]) {
fprintf(stderr, "Calling system(\"echo hello world\")\n");
int ret = system("echo hello world");
fprintf(stderr, "Done. Returned %d.\n", ret);
}
|
the_stack_data/131399.c | #include<stdio.h>
#define PI 3.1416
int main ()
{
float radius,volume;
printf("Enter the radius of sphere :");
scanf("%f",&radius);
volume=4/3*3.1416*radius*radius*radius;
printf("the volume of =%.2f",volume);
return 0;
}
|
the_stack_data/39628.c | /* Test diagnostic for extra semicolon outside a function. Test with
-pedantic-errors. */
/* Origin: Joseph Myers <[email protected]> */
/* { dg-do compile } */
/* { dg-options "-pedantic-errors" } */
; /* { dg-error "error: ISO C does not allow extra ';' outside of a function" } */
|
the_stack_data/539839.c | #include <stdio.h>
int main() {
while (1);
}
|
the_stack_data/59511449.c | #include <math.h>
#include <stdlib.h>
#include <stdint.h>
long powd(int a, int b);
int intToStr(int x, char str[], int d);
void ftoa(float n, char *res, int afterpoint);
void reverse(char *str, int len);
//float pow(float base, float ex);
// reverses a string 'str' of length 'len'
void reverse(char *str, int len)
{
int i=0, j=len-1, temp;
while (i<j)
{
temp = str[i];
str[i] = str[j];
str[j] = temp;
i++; j--;
}
}
// Converts a given integer x to string str[]. d is the number
// of digits required in output. If d is more than the number
// of digits in x, then 0s are added at the beginning.
int intToStr(int x, char str[], int d)
{
int i = 0;
while (x)
{
str[i++] = (x%10) + '0';
x = x/10;
}
// If number of digits required is more, then
// add 0s at the beginning
while (i < d)
str[i++] = '0';
reverse(str, i);
str[i] = '\0';
return i;
}
/*
ftoa(n, res, afterpoint)
n --> Input Number
res[] --> Array where output string to be stored
afterpoint --> Number of digits to be considered after point.
For example ftoa(1.555, str, 2) should store "1.55" in res and
ftoa(1.555, str, 0) should store "1" in res.
*
* http://www.geeksforgeeks.org/convert-floating-point-number-string/
*/
// Converts a floating point number to string.
void ftoa(float n, char *res, int afterpoint)
{
// Extract integer part
int ipart = (int)n;
// Extract floating part
float fpart = n - (float)ipart;
// convert integer part to string
int i = intToStr(ipart, res, 0);
// check for display option after point
if (afterpoint != 0)
{
res[i] = '.'; // add dot
// Get the value of fraction part upto given no.
// of points after dot. The third parameter is needed
// to handle cases like 233.007
fpart = fpart * powd(10, afterpoint);
intToStr((int)fpart, res + i + 1, afterpoint);
}
}
long powd(int a, int b)
{
long x;
unsigned char i;
x = a;
for (i=0;i<b-1;i++)
{
x = x*a;
}
return x;
}
|
the_stack_data/23575222.c | #include <assert.h>
enum E
{
A = 1,
B = 16
};
int main()
{
enum E e = A;
e <<= 4;
assert(e == B);
e >>= 4;
assert(e == A);
e |= B;
e ^= A;
assert(e == B);
e -= 15;
assert(e == A);
return 0;
}
|
the_stack_data/31386616.c | // Test compile-time and run-time multiplication
// var*const multiplication - converted to shift/add
char * const SCREEN = (char*)0x0400;
void main() {
char i=0;
for(char c1=0;c1<5;c1++) {
// const*const
char c2 = 3*2+1;
// var*const
char c3 = c1*c2;
SCREEN[i++] = c3;
}
} |
the_stack_data/620656.c | char * strrchr(const char *cp, int ch)
{
char *save;
char c;
for (save = (char *) 0; (c = *cp); cp++) {
if (c == ch)
save = (char *) cp;
}
return save;
}
|
the_stack_data/25137476.c | #include "stdio.h"
typedef unsigned char UINT8;
typedef unsigned int UINTN;
typedef unsigned int UINT32;
typedef unsigned long long UINT64;
UINT64 MultU64x64 (UINT64 Value1, UINT64 Value2, UINT64 *ResultHigh);
UINT64 DivU64x64 (UINT64 Dividend, UINT64 Divisor, UINT64 *Remainder, UINT32 *Error);
UINT64 DivU64x64C (UINT64 Dividend, UINT64 Divisor, UINT64 *Remainder, UINT32 *Error)
{
*Error = 0;
if (Divisor == 0) {
*Error = 1;
if (Remainder) {
*Remainder = 0x80000000;
}
return 0x80000000;
}
return 0;
}
int main()
{
UINT64 V1;
UINT64 V2;
UINT64 Hi;
UINT64 RetVal;
UINT32 Error;
V1 = 0xffffffff;
V1 = (V1 << 32) + 0xffffffff;
V2 = 0x0;
V2 = (V2 << 32) + 0x2;
//RetVal= MultU64x64 (V1, V2, &Hi);
//RetVal= DivU64x64 (V1, V2, &Hi, &Error);
RetVal= DivU64x64 (V1, V2, &Hi, &Error);
printf("V1 = 0x%08x", (UINT32)(V1 >> 32));
printf("%08x\n", (UINT32)V1);
printf("V2 = 0x%08x", (UINT32)(V2 >> 32));
printf("%08x\n", (UINT32)V2);
printf("rt = 0x%08x", (UINT32)(RetVal >> 32));
printf("%08x\n", (UINT32)RetVal);
printf("Hi = 0x%08x", (UINT32)(Hi >> 32));
printf("%08x\n", (UINT32)Hi);
printf("Er = 0x%08x\n", Error);
return RetVal;
}
|
the_stack_data/348449.c | #include <stdio.h>
int main(){
int n, cont=1, resultado;
scanf("%d", &n);
do{
resultado = cont*n;
printf("%d x %d = %d\n", cont, n, resultado);
cont++;
}
while(cont<11);
return 0;
}
|
the_stack_data/146897.c | /*
class MapEditorMenu
{
protected Widget layoutRoot;
protected EntityAI m_SelectedObject;
protected float m_Distance = 200.0;
protected ref MapEditorModule m_Module;
protected bool m_MouseButtonPressed;
protected int m_PreviousTime;
void MapEditorMenu( ref MapEditorModule module )
{
m_Module = module;
m_MouseButtonPressed = false;
}
void ~MapEditorMenu()
{
Hide();
}
bool IsVisible()
{
return layoutRoot.IsVisible();
}
Widget Init()
{
layoutRoot = GetGame().GetWorkspace().CreateWidgets( "JM\\COT\\gui\\layouts\\Map\\MapMenu.layout" );
layoutRoot.Show( false );
ref Widget objectInfoWrapper = layoutRoot.FindAnyWidget( "object_info_wrapper" );
ref Widget objectInfoGrid = UIActionManager.CreateGridSpacer( objectInfoWrapper, 1, 2 );
UIActionManager.CreateEditableVector( objectInfoGrid, "Position: " );
UIActionManager.CreateEditableVector( objectInfoGrid, "Rotation: " );
ref Widget objectControlsWrapper = layoutRoot.FindAnyWidget( "object_controls" );
ref Widget objectControlsGrid = UIActionManager.CreateGridSpacer( objectControlsWrapper, 1, 2 );
UIActionManager.CreateText( objectControlsGrid, "Select: ", "Left Mouse" );
UIActionManager.CreateText( objectControlsGrid, "Delete: ", "Delete" );
return layoutRoot;
}
void Show()
{
if ( GetGame().IsServer() && GetGame().IsMultiplayer() ) return;
layoutRoot.Show( true );
m_PreviousTime = GetGame().GetTime();
GetGame().GetUpdateQueue(CALL_CATEGORY_GUI).Insert( this.Update );
OnShow();
}
void Hide()
{
if ( GetGame().IsServer() && GetGame().IsMultiplayer() ) return;
layoutRoot.Show( false );
GetGame().GetUpdateQueue(CALL_CATEGORY_GUI).Remove( this.Update );
OnHide();
}
void Update()
{
int currentTime = GetGame().GetTime();
OnUpdate( ( m_PreviousTime - currentTime ) / 1000.0);
m_PreviousTime = currentTime;
}
void OnShow()
{
}
void OnHide()
{
}
void CheckForSelection()
{
}
void OnUpdate( float timeslice )
{
Input input = GetGame().GetInput();
if ( GetWidgetUnderCursor().GetName() != "Windows" && GetWidgetUnderCursor().GetName() != "map_editor_menu" )
{
return;
}
if ( input.GetActionUp( UADefaultAction, false ) )
{
GetRPCManager().SendRPC( "COT_MapEditor", "SetPosition", new Param1<vector>( m_SelectedObject.GetPosition() ), false, NULL, m_SelectedObject );
m_SelectedObject = NULL;
CameraTool.SetTarget( NULL );
}
if ( input.GetActionDown( UADefaultAction, false ) )
{
m_SelectedObject = GetPointerObject( m_Distance );
CameraTool.SetTarget( m_SelectedObject );
}
if ( m_SelectedObject )
{
vector position = m_SelectedObject.GetPosition();
float forward = input.GetAction( UAMoveForward ) - input.GetAction( UAMoveBack );
float strafe = input.GetAction( UATurnRight ) - input.GetAction( UATurnLeft );
float altitude = input.GetAction( UALeanLeft ) - input.GetAction( UALeanRight );
position[0] = position[0] + strafe;
position[1] = position[1] + altitude;
position[2] = position[2] + forward;
m_SelectedObject.SetPosition( position );
}
}
}
*/ |
the_stack_data/569471.c | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <errno.h>
#include <malloc.h>
#ifdef HAVE_STDINT_H
# include <stdint.h> /* uintptr_t */
#else
# define uintptr_t size_t
#endif
#define NELEM(a) (sizeof(a) / sizeof(a[0]))
static int
is_aligned (void *p, size_t alignment, size_t offset)
{
return !((((uintptr_t) p) + offset) & (alignment - 1));
}
#define MAX_SIZE (1 << sizeof(unsigned char))
#define NP 1000
#define NTST 100000U
#define ERRMSG fprintf(stderr, "Iteration %u, align = %u, offset = %u, size = %u (oldsize = %u), errno = %d (%s)\n", i, align[j % NELEM(align)], offset[j % NELEM(offset)], size[j], oldsize, errno, strerror(errno))
int
main (void)
{
unsigned char *p[NP];
size_t size[NP];
size_t align[] = { 2, 4, 8, 16, 32, 64 };
size_t offset[20];
unsigned i;
srand (time (NULL));
for (i = 0; i < NELEM (p); ++i)
{
p[i] = 0;
size[i] = 0;
}
for (i = 0; i < NELEM (offset); ++i)
offset[i] = rand () % 512;
for (i = 0; i < NTST; ++i)
{
size_t oldsize;
unsigned j, k;
j = rand () % NELEM (p);
oldsize = size[j];
p[j] = __mingw_aligned_offset_realloc (p[j],
size[j] = rand () % MAX_SIZE,
align[j % NELEM (align)],
offset[j % NELEM (offset)]);
if (size[j] && !p[j])
{
fprintf (stderr, "Returned NULL!\n");
ERRMSG;
return EXIT_FAILURE;
}
if (size[j] && !is_aligned (p[j],
align[j % NELEM (align)],
offset[j % NELEM (offset)]))
{
fprintf (stderr, "Misaligned block!\n");
ERRMSG;
return EXIT_FAILURE;
}
if (oldsize > size[j])
oldsize = size[j];
for (k = 0; k < oldsize; ++k)
if (p[j][k] != k)
{
fprintf (stderr, "Miscopied block!\n");
ERRMSG;
return EXIT_FAILURE;
}
for (k = 0; k < size[j]; ++k)
p[j][k] = k;
}
for (i = 0; i < NELEM (p); ++i)
__mingw_aligned_free (p[i]);
return EXIT_SUCCESS;
}
|
the_stack_data/1059171.c | /*
* Copyright (c) 2018 lalawue
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the MIT license. See LICENSE for details.
*/
#ifdef M_FOUNDATION_TEST_TIMER
#include <stdio.h>
#include <unistd.h>
#include "m_mem.h"
#include "m_timer.h"
static void
_test_tmr_callback(tmr_timer_t *tm, void *opaque) {
printf("cb %d<%p>, ", *((int*)opaque), tm);
}
int main(int argc, char *argv[]) {
int value[4] = {0, 1, 2, 3};
tmr_timer_t *tm[3];
tmr_t *tmr = tmr_create_lst();
for (int i=0; i<21; i++) {
if (i <= 2) {
tm[i] = tmr_add(tmr, i, 1+i, 1, &value[i], _test_tmr_callback);
if (i == 2) {
int j = i + 1;
tm[j] = tmr_add(tmr, i, 2*(j+1), 1, &value[j], _test_tmr_callback);
}
}
usleep(500000);
printf("%02d ", i);
tmr_update_lst(tmr, i);
if (i == 10) {
tmr_invalidate(tmr, tm[0]);
}
else if (i == 16) {
tmr_fire(tmr, tm[1], i, 1);
}
printf("\n");
}
tmr_destroy_lst(tmr);
mm_report(2);
return 0;
}
#endif
|
the_stack_data/248580393.c | /* Test for restrict: in C99 only. */
/* Origin: Joseph Myers <[email protected]> */
/* { dg-do compile } */
/* { dg-options "-std=iso9899:1990 -pedantic-errors" } */
char *restrict foo; /* { dg-bogus "warning" "warning in place of error" } */
/* { dg-error "parse error|syntax error|expected|no type" "restrict not in C90" { target *-*-* } 6 } */
|
the_stack_data/109593.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: atrouill <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/08/02 13:23:13 by atrouill #+# #+# */
/* Updated: 2019/08/02 14:52:12 by atrouill ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdio.h>
char *ft_strlowcase(char *str);
int main(void)
{
char str[] = "MesCouidlls au b0rd de l0$%^";
printf("%s\n", ft_strlowcase(str));
//printf("%s\n", ft_strlowcase("ajsfoiajSHSHFUDFUcjzojdfijsd15568s4df?"));
//printf("%s\n", ft_strlowcase("JNDVDHVDUFIVDUFVIODVNXZNVNDB"));
//printf("%s\n", ft_strlowcase("5116468615168135132100"));
//printf("%s\n", ft_strlowcase("%^*&*()%$#$%^&*(*(&*(&^%*&$^%$%)))"));
}
|
the_stack_data/26764.c | //
// code for doing exponentials and logarithms
// Copyright 2020 Total Spectrum Software Inc.
// MIT licensed
//
#define CONST_E 2.71828182846f
#define LOG2_10 3.32192809489f
#define LOG2_E 1.4426950409f
#define LOGE_2 0.69314718056f
// utilities
typedef union ForU {
float f;
unsigned u;
} ForU;
static inline unsigned __asuint(float f) { ForU u; u.f = f; return u.u; }
static inline float __asfloat(unsigned d) { ForU u; u.u = d; return u.f; }
#ifdef __P2__
// calculate log2(mant) as a 5.27 fixed point number
unsigned __builtin_qlog(unsigned mant)
{
unsigned r;
__asm {
qlog mant
getqx r
};
return r;
}
// calculate 2^mant, where mant is a 5.27 fixed point number
unsigned __builtin_qexp(unsigned mant)
{
unsigned r;
__asm {
qexp mant
getqx r
};
return r;
}
#else
// calculate log base 2 of an unsigned num as a 5.27 fixed point number
// uses the lookup table in ROM
// algorithm comes from Propeller manual
unsigned __builtin_qlog(unsigned num)
{
unsigned exp;
unsigned r;
unsigned r2;
unsigned frac;
exp = __builtin_clz(num);
num = num << exp; // left justify
// we will look up based on 11 bits, so the bottom 16 bits are the fraction
frac = num & 0xffff;
num = (num >> (30-11)) & 0xffe; // 30 because we will multiply by 2 for word access
r = *((unsigned short *)(0xC000 + num));
r2 = *((unsigned short *)(0xC002 + num));
r = r + (((r2-r)*frac) >> 16);
exp = exp ^ 0x1f;
r = r | (exp << 16);
r = r << (27-16);
return r;
}
// calculate 2^num, where "num" is a 5.27 fixed point num
// uses the lookup table in ROM
// algorithm comes from Propeller manual
unsigned __builtin_qexp(unsigned orig_num)
{
unsigned exp;
unsigned r, r2;
unsigned frac;
unsigned num = orig_num;
exp = (num >> 27);
// the original value is 5.27
// we will look up based on 11 bits, so the bottom 16 bits are the fraction
frac = num & 0xffff;
num = (num >> (26-11)) & 0x0ffe;
//__builtin_printf("...num=0x%08x lookup=%08x exp=%d\n", orig_num, num, exp);
r = *((unsigned short *)(0xD000 + num));
r2 = *((unsigned short *)(0xD002 + num));
//__builtin_printf("...r1=0x%08x r2=%08x frac=%04x\n", r, r2, frac);
r = r + ((frac * (r2-r)) >> 16);
r = r << 15; // shift into 30..15
r |= 0x80000000;
//printf("...r=0x%08x\n", r);
exp ^= 0x1f;
r = r >> exp;
return r;
}
#endif
//
// floating point: calculate log base 2 of a float number
//
float _log2f(float x)
{
unsigned u = __asuint(x);
int exp;
unsigned mant;
unsigned r;
int rexp;
float n;
if (u == 0 || u == 0x80000000) {
return -__builtin_inf();
}
if ((int)u < 0) {
return __builtin_nan("");
}
// some special cases
if (x == 10.0) {
return LOG2_10;
}
if (x == CONST_E) {
return LOG2_E;
}
#ifdef __fixedreal__
// construct mant as a 1.23 fixed point number, and exp as an
// exponent, such that x = 2^exp * mant
{
unsigned one = 0x800000;
exp = 0;
//printf("original: u=%08x\n", u);
if (u > one) {
do {
u = u>>1;
++exp;
} while (u > one);
} else if (u < one) {
do {
u = u<<1;
--exp;
} while (u < one);
}
mant = u;
exp += (23-16);
}
#else
exp = (u >> 23) & 0xff;
mant = u & 0x7fffff;
if (exp == 0xff) {
return mant ? __builtin_inf() : __builtin_nan("");
}
if (exp != 0) {
mant |= 0x800000;
exp -= 0x7f;
} else {
if (mant == 0) {
return -__builtin_inf();
}
exp = -126;
while (0 == (mant & 0x800000)) {
mant = mant<<1;
exp++;
}
}
#endif
r = __builtin_qlog(mant);
// at this point r is a 5.27 fixed point number giving log2(mant)
// note that mant was 1.23 by construction, so the upper 5 bits
// is "24", i.e. we have 0xbnnnnnn
//printf("... mant=0x%08x r=0x%08x exp=%d\n", mant, r, exp);
#ifdef __fixedreal__
r = (r>>(27-16)-1) & 0x1ffff;
r = (r+1)>>1; // round
r += exp<<16;
return __asfloat(r);
#else
// convert back to float
r &= 0x7ffffff;
r = (r+8)>>4;
r += ((127)<<23);
--exp;
//printf("... r=%f exp=%f\n", __asfloat(r), (float)exp);
// x = 2^exp * mant
// so log(x) = exp + log(mant)
return __asfloat(r) + (float)exp;
#endif
}
// calculate 2^x
#ifdef __fixedreal__
float _exp2f(float x)
{
int n;
unsigned u, r;
float y;
n = (int)x;
if (n < -16) {
return 0;
}
if (n >= 16) {
return __asfloat(0x7fffffff);
}
y = x - (float)n;
if (y < 0) {
y += 1.0f;
--n;
}
u = __asuint(y); // 16.16
//printf("... u=%08x\n", u);
u = u<<11; // 5.27
u |= (16<<27);
r = __builtin_qexp(u); // as a 16.16 number
//printf("... r=%08x\n", r);
if (n >= 0) {
r <<= n;
} else {
r >>= -n;
}
return __asfloat(r);
}
#else
float _exp2f(float x)
{
int n;
float y;
unsigned u;
unsigned r;
unsigned nf;
if (x >= 127.0) {
return __builtin_inf();
}
if (x < -127.0) {
return 0.0;
}
n = (int)x;
y = x - (float)n;
if (y < 0) {
y += 1.0;
--n;
}
nf = (n+0x7f) << 23;
//printf(" ... x=%f = y (%f) + n (%d)\n", x, y, n);
//printf(" ... 2^n = %f\n", __asfloat(nf));
// OK, 0 <= y < 1 and x = n + y
// so 2^x = 2^{n+y} = 2^n * 2^y
u = (unsigned)(y*(1<<27));
if (u == 0) {
float x = __asfloat(nf);
//printf(" ... returning %f\n", x);
return x;
}
u |= (24<<27);
//printf("..u=%x (input) ", u);
r = __builtin_qexp(u);
//printf("..u=%x r=%x\n", u, r);
// round:
r = (r+1)>>1;
r += (0x7e)<<23;
//printf("..nf=%f (0x%08x), r=%f (0x%08x)\n", __asfloat(nf), nf, __asfloat(r), r);
return __asfloat(nf)*__asfloat(r);
}
#endif
//
// calculate x^y
//
float __builtin_powf(float x, float y)
{
int n;
float a, b;
n = (int)y;
if ((float)n == y) {
// x^y is just x^n
return _float_pow_n(1.0, x, n);
}
if (x < 0) {
return __builtin_nan("");
}
if (x == 0) {
return 0;
}
// calculate x^y as 2^(log_2(x)*y)
a = _log2f(x) * y;
return _exp2f(a);
}
//
// calculate log base b of x
//
float __builtin_logbase(float b, float x)
{
float xx = _log2f(x);
float bb = _log2f(b);
return xx / bb;
}
//
// various standard functions
//
float __builtin_expf(float x)
{
return __builtin_powf(CONST_E, x);
}
float __builtin_logf(float x)
{
return __builtin_logbase(CONST_E, x);
}
float __builtin_log10f(float x)
{
return __builtin_logbase(10.0, x);
}
|
the_stack_data/526975.c | #include "stdio.h"
#include "stdlib.h"
#define true 1
#define false 0
struct BST
{
int data;
struct BST *left;
struct BST *right;
};
struct BST* GetNewNode(int data)
{
struct BST* rootNode=(struct BST*)malloc(sizeof(struct BST));
rootNode->data=data;
rootNode->left=rootNode->right=NULL;
return rootNode;
}
struct BST* InsertNode(struct BST* root,int data)
{
if(root==NULL)
{
root=GetNewNode(data);
}
else if(data<=root->data)
{
root->left=InsertNode(root->left,data);
}
else
{
root->right=InsertNode(root->right,data);
}
return root;
}
int Search(struct BST* root,int data)
{
if(root==NULL) return false;
else if(data==root->data) return true;
else if(data<=root->data) return Search(root->left,data);
else return Search(root->right,data);
}
int FindMin(struct BST* root)
{
if(root==NULL)
{
printf("tree is NULL\n");
return -1;
}
else if(root->left==NULL)
{
return root->data;
}
return FindMin(root->left); // use recursive function
}
int FindMax(struct BST* root)
{
if(root==NULL)
{
printf("tree is empty\n");
return -1;
}
else if(root->right==NULL)
{
return root->data;
}
return FindMax(root->right); // use recursive function
}
int main(int argc, char const *argv[])
{
printf("hello manohar\n\n");
struct BST *root=NULL;
root=InsertNode(root,20);
root=InsertNode(root,15);
root=InsertNode(root,25);
root=InsertNode(root,10);
root=InsertNode(root,17);
root=InsertNode(root,22);
root=InsertNode(root,27);
int ele;
printf("%s\n","Enter the elements to Search" );
scanf("%d",&ele);
if(Search(root,ele)== true) printf("%s%d\n","elements found " , ele);
else
printf("Not found\n" );
int min=FindMin(root);
printf("Min=%d\n",min);
int max=FindMax(root);
printf("Max=%d\n",max);
return 0;
} |
the_stack_data/589137.c | /*******************************************************
Copyright (C) 1995 Greg Landrum
All rights reserved
This file is part of yaehmop.
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
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.
********************************************************************/
/*******
mem_debug.c:
This contains a set of replacements for the standard
memory allocation functions malloc, calloc, realloc, and free
in order to allow the tracking down of core leaks and various
other bad memory allocation problems.
Here's how I use it:
1) somewhere in a header file included by everything else,
add the following definitions:
#ifndef MEM_DEBUG
#define D_MALLOC(_a_) malloc(_a_)
#define D_CALLOC(_a_,_b_) calloc(_a_,_b_)
#define D_REALLOC(_a_,_b_) realloc(_a_,_b_)
#define D_FREE(_a_) free(_a_)
#else
#define D_MALLOC(_a_) d_malloc(_a_,__FILE__,__LINE__)
#define D_CALLOC(_a_,_b_) d_calloc(_a_,_b_,__FILE__,__LINE__)
#define D_REALLOC(_a_,_b_) d_realloc(_a_,_b_,__FILE__,__LINE__)
#define D_FREE(_a_) d_free(_a_,__FILE__,__LINE__)
#endif
2) replace all memory allocation calls with the corresponding D_ call.
3) recompile everything with -DMEM_DEBUG
4) add a call to d_check_core() at the end of the program
5) if a given leak/problem is really difficult to find, try
recompiling mem_debug.c with -DGAG_ME_WITH_VERBOSITY
this will print out a short record of every transaction.
*********/
#include <stdio.h>
#include <signal.h>
#ifdef MEM_DEBUG
/****
this is the structure used to maintain the list of
allocated memory chunks.
****/
typedef struct malloc_record_type_def malloc_record_type;
struct malloc_record_type_def{
char *address; /* the pointer itself */
int size; /* the amount of memory associated with this pointer */
char loc_file[240]; /* which file was the allocation done in */
int loc_line; /* which line of that file */
malloc_record_type *prev,*next; /* do a doubly-linked list */
};
malloc_record_type *records=0;
int num_allocated = 0;
/*****
here's the malloc replacement
*****/
char *d_malloc(int size,char *filename,int linenum){
char *temp_ptr;
malloc_record_type *new_record;
/* start with the memory */
temp_ptr = (char *)malloc(size);
num_allocated++;
if( temp_ptr ){
/***
allocate space for the malloc record, fill in the
requisite information and slap it at the head of
the list.
***/
new_record = (malloc_record_type *)malloc(sizeof(malloc_record_type));
if(!new_record) fatal("can't allocate a malloc_record.");
new_record->prev = 0;
new_record->next = 0;
new_record->address = temp_ptr;
new_record->size = size;
new_record->loc_line = linenum;
strncpy(new_record->loc_file,filename,240);
new_record->next = records;
if( records ) records->prev = new_record;
records = new_record;
#ifdef GAG_ME_WITH_VERBOSITY
printf("\tmalloc from line\t %d of file\t %s of\t %d bytes ok.\t(%0xd)\n",
linenum,filename,size,temp_ptr);
#endif
}
return(temp_ptr);
}
/*****
here's the calloc replacement, it's the same as d_malloc
*****/
char *d_calloc(int num,int size,char *filename,int linenum){
char *temp_ptr;
malloc_record_type *new_record;
temp_ptr = (char *)calloc(num,size);
num_allocated++;
if( temp_ptr ){
new_record = (malloc_record_type *)malloc(sizeof(malloc_record_type));
if(!new_record) fatal("can't allocate a malloc_record.");
new_record->prev = 0;
new_record->next = 0;
new_record->address = temp_ptr;
new_record->size = size*num;
new_record->loc_line = linenum;
strncpy(new_record->loc_file,filename,240);
new_record->next = records;
if( records ) records->prev = new_record;
records = new_record;
#ifdef GAG_ME_WITH_VERBOSITY
printf("\tcalloc from line\t %d of file\t %s of\t %d bytes ok.\t(%0xd)\n",
linenum,filename,size*num,temp_ptr);
#endif
}
return(temp_ptr);
}
/*******
print out the information for each allocated record
this is mainly useful for debugging purposes.
*******/
void d_crawl()
{
malloc_record_type *record;
record = records;
while(record){
printf("\t%0xd: line %d, file %s, size %d\n",record->address,
record->loc_line,record->loc_file,record->size);
record = record->next;
}
}
/*****
here's the free replacement
*****/
void d_free(char *address,char *filename,int linenum){
malloc_record_type *record;
record = records;
/* find the relevant record in the list */
while( record && record->address != address ) record = record->next;
if( !record ){
fprintf(stderr,"free called on a pointer which was not allocated, (%0xd).\n",address);
fprintf(stderr,"\tfrom line %d of file %s\n",linenum,filename);
kill(getpid(),SIGSEGV);
}
/* pull it back out of the list */
if(record==records){
records = record->next;
if(records) records->prev = 0;
}
if(record->prev) record->prev->next = record->next;
if(record->next) record->next->prev = record->prev;
/* free the memory */
free(record->address);
#ifdef GAG_ME_WITH_VERBOSITY
printf("\tfree from line\t %d of file\t %s of\t %d bytes ok.\t(%0xd)\n",
record->loc_line,record->loc_file,record->size,address);
#endif
free(record);
num_allocated--;
}
/******
replacement for realloc
*******/
char *d_realloc(char *address,int size,char *filename,int linenum){
char *temp_ptr;
malloc_record_type *record;
record = records;
while( record && record->address != address ) record = record->next;
if( !record ){
fprintf(stderr,"realloc called on a pointer which was not allocated.\n");
fprintf(stderr,"\tfrom line %d of file %s\n",linenum,filename);
kill(getpid(),SIGSEGV);
}
temp_ptr = (char *)realloc(address,size);
if( temp_ptr ){
record->address = temp_ptr;
record->size = size;
record->loc_line = linenum;
strncpy(record->loc_file,filename,240);
#ifdef GAG_ME_WITH_VERBOSITY
printf("\trealloc from line\t %d of file\t %s of\t %d bytes ok.\t(%0xd)\n",
linenum,filename,size,temp_ptr);
#endif
}
return(temp_ptr);
}
/******
check for and display any leaks
*******/
void d_check_core(){
int num_leaks;
malloc_record_type *record;
record = records;
num_leaks = 0;
if( record ){
printf("\td_check_core: %d leaks present. Argh!\n",num_allocated);
while(record){
printf("\t\t%d) Line %d of file %s. Size: %d\n",num_leaks+1,
record->loc_line,record->loc_file,record->size);
num_leaks++;
record = record->next;
}
}else{
printf("\td_check_core: We're clean!\n");
}
}
#endif
|
the_stack_data/61076378.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strdel.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: avolgin <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2017/11/02 19:58:42 by avolgin #+# #+# */
/* Updated: 2017/11/11 17:06:44 by avolgin ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdlib.h>
void ft_strdel(char **as)
{
if (as && *as)
{
free(*as);
*as = NULL;
}
}
|
the_stack_data/162041.c | // program to convert the number to octal
#include<stdio.h>
void main()
{
int a;
printf("Enter a number\n");
scanf("%d",&a);
printf("The number in octal is %o \t The number is %x \n " ,a,a);
}
|
the_stack_data/26701499.c | /* Sort the given array */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define N 5
int main(void)
{
/* char (*str)[10] = malloc(N * 10 * sizeof(char));//多维数组空间的动态分配？
char *temp = malloc(10 * sizeof(char));
printf("Enter %d string: ", N);
for (int i = 0; i < N; i++)
scanf("%s", str[i]);
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (strlen(str[i]) > strlen(str[j])) {
*temp = *str[i];
*str[i] = *str[j];
*str[j] = *temp;
}
}
} */
char *str[N] = {"ho", "shanea", "you", "arent", "seen"};
char *temp, spec[N + 1];
/* spec = malloc((N + 1) * sizeof(char)); */
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++)
if (strlen(str[i]) > strlen(str[j])) {
temp = str[i];
str[i] = str[j];
str[j] = temp;
}
printf("Sorted array: ");
for (int i = 0; i < N; i++)
printf("%s ", str[i]);
putchar('\n');
for (int i = 0; i < N; i++)
//good taste code here
spec[i] = (strlen(str[i]) > 2) ? *(str[i] + 2) : ' ';
//necessary '\0' here
spec[strlen(spec)] = '\0';
puts(spec);
return 0;
} |
the_stack_data/145707.c | #include <stdio.h>
int main(void) {
char *foo = NULL;
foo = strdup("bar");
if (!foo) {
fprintf(stderr, "bad things\n");
exit(1);
}
}
|
the_stack_data/225144031.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* gol_atou.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: jodufour <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/04/19 23:51:11 by jodufour #+# #+# */
/* Updated: 2021/04/20 14:18:47 by jodufour ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdint.h>
static int gol_isspace(char const c)
{
return (c == '\f'
|| c == '\t'
|| c == '\n'
|| c == '\r'
|| c == '\v'
|| c == ' ');
}
static int gol_isdigit(char const c)
{
return (c >= '0' && c <= '9');
}
int gol_atou(char const *s)
{
uint32_t output;
output = 0;
while (gol_isspace(*s))
++s;
if (*s == '+')
++s;
while (gol_isdigit(*s))
{
output *= 10;
output += *s - '0';
++s;
}
return (output);
}
|
the_stack_data/178265959.c | #include<stdio.h>
int main()
{
int num1;
int num2;
printf("Digite o primeiro número: ");
scanf("%d", &num1);
printf("Digite o segundo número: ");
scanf("%d", &num2);
if (num1 > num2)
{
printf("O primeiro número %d é maior que o segundo %d", num1,num2);
}
else
{
printf("O segundo número %d é maior que o primeiro %d", num2, num1);
}
return 0;
} |
the_stack_data/26700711.c | #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<stdbool.h>
struct BuddyNode{//create a buddy tree node
int size;//size of the node(memory size)
int RIsallocated;//Right child allocation status
int LIsallocated;//left child allocation status
int processId;//process id of the stored process
int processSize;//size of the process which is stored
struct BuddyNode *left,*right;//pointer to the right and left child
};
struct BuddyNode* new_node(int val){//for any node instead of creating a node and assigning values each time use this function
//this will create a node and intialize the values to it
struct BuddyNode* new_node=(struct BuddyNode*)malloc(sizeof(struct BuddyNode));
new_node->right=NULL;
new_node->left=NULL;
new_node->size=val;
new_node->processSize=0;
new_node->processId=0;
new_node->RIsallocated=0;
new_node->LIsallocated=0;
}
int delete(struct BuddyNode** roo,int processID){
//for deleteing any process from the buddy tree
int res;
struct BuddyNode* root=*roo;//maintain a pointer to the root
if(root->left==NULL&&root->right==NULL){//process should be in leaf nodes only
if(root->processId==processID){
printf("found\n");
root->RIsallocated=0;//reset all the values as intail values of a node
root->LIsallocated=0;
root->processSize=0;
root->processId=0;
return 1;//return 1 that is for successfully deleted
}
else{
return 0;
}
}
res=delete(&root->left,processID);//otherwise find at the left part of the tree
if(res==1){//if found then check if the buddy means nearest same level node is also free if free then delete those nodes
// root->left=NULL;
if(root->right->LIsallocated==0&&root->right->RIsallocated==0&&root->right->left==NULL&&root->right->right==NULL){
root->LIsallocated=0;
root->RIsallocated=0;
root->right=NULL;
root->left=NULL;
return 1;//return 1 for successful deletion
}
}
res=delete(&root->right,processID);//if not found in the left part find in right part
if(res==1){//if found then check if its brother node (buddy node ) is free or not if free then delete both
// root->right=NULL;
if(root->left->LIsallocated==0&&root->left->RIsallocated==0&&root->left->left==NULL&&root->left->right==NULL){
root->LIsallocated=0;
root->RIsallocated=0;
root->right=NULL;
root->left=NULL;
return 1;
}
}
return 0;
}
int BuddyAllocation(struct BuddyNode** root,int process,int processId,int actualSize){
struct BuddyNode* temp=*root;//assign temp to root of the buddy tree
int flag;
struct BuddyNode* new=NULL;//new node to null
//actaul size is nearest power of two of the process size
if(temp->size<actualSize){// if the available space is less than the required one then error
printf("Insufficient space Sorry!!!\n");
return 0;
}
else if(temp->size==actualSize){
if((temp->left==NULL)&&(temp->right==NULL)){//the processess are only allocted at the leafs of the buddy tree
temp->size=actualSize;
temp->processId=processId;
temp->processSize=process;
temp->RIsallocated=1;
temp->LIsallocated=1;
return 1;//return 1 for successfull insertion
}
else{
return 0;
}
}
else{//if not leaf size
if(temp->LIsallocated==0){//if left child is not allocated
if(temp->left==NULL){//if left child is not there
temp->left=new_node((int)(temp->size/2));//create left and right nodes of size parentsize/2
temp->right=new_node((int)(temp->size/2));
flag=BuddyAllocation(&temp->left,process,processId,actualSize);//and make a recursive call on left part of the newly created part
if(temp->left->LIsallocated==1 && temp->left->RIsallocated==1){//if left part's left and right child is allocated then left child allocation status is also one
temp->LIsallocated=1;
}
if(flag==1){
return 1;
}
}
else{//if left part is there
flag=BuddyAllocation(&temp->left,process,processId,actualSize);//insert in left part of tree
if(temp->left->LIsallocated==1&&temp->left->RIsallocated==1){
temp->LIsallocated=1;
}
if(flag==1){
return 1;
}
}
}
if(temp->RIsallocated==0){//if right part is not allocated
flag=BuddyAllocation(&temp->right,process,processId,actualSize);//insert at the right of the tree
if(temp->right->LIsallocated==1 && temp->right->RIsallocated==1){
temp->RIsallocated=1;
}
if(flag==1){
return 1;
}
}
return 0;
}
}
void printtree(struct BuddyNode *root){
if(root->left==NULL&&root->right==NULL){
printf("%d\t%d\t\t%d\t\t%d\t%d\n",root->size,root->processSize,root->processId,root->LIsallocated,root->RIsallocated);
}
else{
printtree(root->left);
printtree(root->right);
}
}
int main(){
int memorysize;
printf("enter the size of the main memory(in power of two )\n");
scanf("%d",&memorysize);
int flag1=0;
//int processId=0;
struct BuddyNode *root=new_node(memorysize);
int choice=0;
while(choice!=4){
printf("Enter your choice\n1.Add process\n2.Delete process\n3.print processess\n4.exit\n\n");
scanf("%d",&choice);
printf("####################################################\n");
switch (choice) {
case 1:{
int processSize;
int processId;
printf("Enter process Size\n");
scanf("%d",&processSize);
printf("Enter process ID\n");
scanf("%d",&processId);
int actualSize;
int x=1;
int nearestpower=0;
while(x<processSize){
x=x*2;
nearestpower+=1;
}
actualSize=x;
printf("the actual size is %d\n",actualSize);
flag1=BuddyAllocation(&root,processSize,processId,actualSize);
if(flag1==1){
processId+=1;
printf("SIZE\tProcessSIZE\tPROCESSID\tLEFT\tRIGHT\t\n");
printtree(root);
}
else{
printf("Insufficent space\n");
}
break;
}
case 2:{
printf("Enter process Id to delete the process\n");
int pid;
scanf("%d",&pid);
delete(&root,pid);
break;
}
case 3:{
printf("printing the tree with buddy\n");
printtree(root);
break;
}
case 4:{
printf("Exiting ............\n");
exit(0);
break;
}
default:{
printf("Error Invalid choice\n");
//exit(0);
break;
}
}
}
return 0;
}
|
the_stack_data/182507.c | #include<stdio.h>
#include<stdlib.h>
typedef struct
{
int top ;
int items[100] ;
}STACK ;
/// THIS METHOD IS NOT THE CONVENTIONAL PREFERED METHOD OF DOING THIS REVERSING . USE RECURSION TO GET A PERFECT SOLUTUION.
STACK reverse(STACK s)
{
if(s.top==-1)
return ;
int bot = 0 ;
int top = s.top ;
int temp ;
for(; bot<top ; bot++ , top--)
{
temp = s.items[bot] ;
s.items[bot] = s.items[top] ;
s.items[top] = temp ;
}
return s ;
}
STACK reverse_using_another_stack(STACK s)
{
if(s.top==-1) return ;
STACK rev = {-1} ;
int top = s.top ;
for(int i=0 ; i<=top ; i++)
rev.items[++rev.top] = s.items[s.top--] ;
return rev ;
}
void display(STACK s)
{
if(s.top==-1)
return ;
int i =0 ;
for(i =0 ; i<=s.top ; i++)
printf("%d -> " , s.items[i]) ;
}
int main(void)
{
STACK s={-1 , 0 } ;
s.items[++s.top] = 1 ;
s.items[++s.top] = 2 ;
s.items[++s.top] = 3 ;
s.items[++s.top] = 4 ;
s.items[++s.top] = 5 ;
s.items[++s.top] = 6 ;
printf("Before reversing : ") ;
display(s) ;
s = reverse_using_another_stack(s) ;
printf("\n\nAfter reversing : ") ;
display(s) ;
}
|
the_stack_data/117329262.c | /* { dg-do run } */
/* { dg-options "-O2 -mgeneral-regs-only" } */
extern void abort ();
int
dec (int a, int b)
{
return a + b;
}
int
cal (int a, int b)
{
int sum1 = a * b;
int sum2 = a / b;
int sum = dec (sum1, sum2);
return a + b + sum + sum1 + sum2;
}
int
main (int argc, char **argv)
{
int ret = cal (2, 1);
if (ret != 11)
abort ();
return 0;
}
|
the_stack_data/415312.c | int sum(int *base, int n)
{
int *p = base;
int *end = base + n;
int s = 0;
while (p < end)
s += *p++;
return s;
}
void run(void)
{
int arr[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
sum(arr, sizeof arr / sizeof *arr);
}
|
the_stack_data/94272.c | #include <stdlib.h>
#include <stdio.h>
// isto kot funkcija razsiri v razsiri.c, razlika
// je le v tem, da je tu funkcija razsiri void (ne
// vraca razultata), saj neposredno spremeni kar
// podani kazalec p (v ta namen je p podan kot
// kazalec na kazalec)
void razsiri( int **p, int n) //dobimo pointer na pointer
{
int *nov = (int *) malloc((n + 1)*sizeof(int));
for(int i = 0; i < n; i++){
nov[i] = (*p)[i];
}
free(*p);
*p = nov;
}
int main(void) {
int n = 5; //velikost tabele
int *tab = (int *) malloc(n * sizeof(int));
tab[0] = 0;
tab[1] = 1;
tab[2] = 2;
tab[3] = 3;
tab[4] = 4;
printf("Tabela tab je na naslovu %p\n", tab);
razsiri(&tab, n++);
printf("Tabela tab je na naslovu %p\n", tab);
for(int i = 0; i < n; i++){
printf("%d\n", tab[i]);
}
return 0;
}
|
the_stack_data/1125612.c | #include <stdlib.h>
#include <stdio.h>
#include <omp.h>
#include <sys/utsname.h>
int main(int argc, char **argv)
{
int num_threads;
// Serial code
printf("This is the serial section\n");
if (argc < 2){
fprintf(stderr, "Usage: ./hello_world [NUM_THREADS]\n");
exit(1);
}
num_threads = strtol(argv[1], NULL, 10);
omp_set_dynamic(0);
if (omp_get_dynamic()) {printf("Warning: dynamic adjustment of threads has been set\n");}
omp_set_num_threads(num_threads);
#pragma omp parallel
{
int thread_num = omp_get_thread_num();
struct utsname ugnm;
num_threads = omp_get_num_threads();
uname(&ugnm);
printf("Hello World from thread %d of %d, running on %s.\n", thread_num, num_threads, ugnm.nodename);
gtmp_barrier();
printf("Hello World from thread %d of %d, running on %s.\n", thread_num, num_threads, ugnm.nodename);
} // implied barrier
gtmp_finalize();
// Resume serial code
printf("Back in the serial section again\n");
return 0;
}
|
the_stack_data/220454453.c | /////////////////////////////////////////////////////////////////////////////////
/* CE1007/CZ1007 Data Structures
Purpose: Implementing the required functions for Question 1 */
//////////////////////////////////////////////////////////////////////////////////
#include <stdio.h>
#include <stdlib.h>
//////////////////////////////////////////////////////////////////////////////////
typedef struct _listnode
{
int item;
struct _listnode *next;
} ListNode; // You should not change the definition of ListNode
typedef struct _linkedlist
{
int size;
ListNode *head;
} LinkedList; // You should not change the definition of LinkedList
typedef struct _queue
{
LinkedList ll;
} Queue; // You should not change the definition of Queue
///////////////////////// function prototypes ////////////////////////////////////
// You should not change the prototypes of these functions
void createQueueFromLinkedList(LinkedList *ll, Queue *q);
void removeOddValues(Queue *q);
void enqueue(Queue *q, int item);
int dequeue(Queue *q);
int isEmptyQueue(Queue *q);
void removeAllItemsFromQueue(Queue *q);
// You may use the following functions or you may write your own
void printList(LinkedList *ll);
void removeAllItems(LinkedList *ll);
ListNode * findNode(LinkedList *ll, int index);
int insertNode(LinkedList *ll, int index, int value);
int removeNode(LinkedList *ll, int index);
//////////////////////////// main() //////////////////////////////////////////////
int main()
{
int c, i;
LinkedList ll;
Queue q;
c = 1;
// Initialize the linked list as an empty linked list
ll.head = NULL;
ll.size = 0;
// Initialize the Queue as an empty queue
q.ll.head = NULL;
q.ll.size = 0;
printf("1: Insert an integer into the linked list:\n");
printf("2: Create the queue from the linked list:\n");
printf("3: Remove odd numbers from the queue:\n");
printf("0: Quit:\n");
while (c != 0)
{
printf("Please input your choice(1/2/3/0): ");
scanf("%d", &c);
switch (c)
{
case 1:
printf("Input an integer that you want insert into the List: ");
scanf("%d", &i);
insertNode(&ll, ll.size, i);
printf("The resulting linked list is: ");
printList(&ll);
break;
case 2:
createQueueFromLinkedList(&ll, &q); // You need to code this function
printf("The resulting queue is: ");
printList(&(q.ll));
break;
case 3:
removeOddValues(&q); // You need to code this function
printf("The resulting queue after removing odd integers is: ");
printList(&(q.ll));
removeAllItemsFromQueue(&q);
removeAllItems(&ll);
break;
case 0:
removeAllItemsFromQueue(&q);
removeAllItems(&ll);
break;
default:
printf("Choice unknown;\n");
break;
}
}
return 0;
}
//////////////////////////////////////////////////////////////////////////////////
void createQueueFromLinkedList(LinkedList *ll, Queue *q)
{
/* add your code here */
removeAllItemsFromQueue(q);
while (ll->size != 0){
enqueue(q, ll->head->item);
removeNode(ll, 0);
}
}
void removeOddValues(Queue *q)
{
/* add your code here */
int loopCnt = (q->ll).size;
while (loopCnt != 0){
if (q->ll.head->item % 2 == 0)
enqueue(q, q->ll.head->item);
dequeue(q);
loopCnt--;
}
}
//////////////////////////////////////////////////////////////////////////////////
void enqueue(Queue *q, int item) {
insertNode(&(q->ll), q->ll.size, item);
}
int dequeue(Queue *q) {
int item;
if (!isEmptyQueue(q)) {
item = ((q->ll).head)->item;
removeNode(&(q->ll), 0);
return item;
}
return -1;
}
int isEmptyQueue(Queue *q) {
if ((q->ll).size == 0)
return 1;
return 0;
}
void removeAllItemsFromQueue(Queue *q)
{
int count, i;
if (q == NULL)
return;
count = q->ll.size;
for (i = 0; i < count; i++)
dequeue(q);
}
void printList(LinkedList *ll){
ListNode *cur;
if (ll == NULL)
return;
cur = ll->head;
if (cur == NULL)
printf("Empty");
while (cur != NULL)
{
printf("%d ", cur->item);
cur = cur->next;
}
printf("\n");
}
void removeAllItems(LinkedList *ll)
{
ListNode *cur = ll->head;
ListNode *tmp;
while (cur != NULL){
tmp = cur->next;
free(cur);
cur = tmp;
}
ll->head = NULL;
ll->size = 0;
}
ListNode * findNode(LinkedList *ll, int index){
ListNode *temp;
if (ll == NULL || index < 0 || index >= ll->size)
return NULL;
temp = ll->head;
if (temp == NULL || index < 0)
return NULL;
while (index > 0){
temp = temp->next;
if (temp == NULL)
return NULL;
index--;
}
return temp;
}
int insertNode(LinkedList *ll, int index, int value){
ListNode *pre, *cur;
if (ll == NULL || index < 0 || index > ll->size + 1)
return -1;
// If empty list or inserting first node, need to update head pointer
if (ll->head == NULL || index == 0){
cur = ll->head;
ll->head = malloc(sizeof(ListNode));
if (ll->head == NULL)
{
exit(0);
}
ll->head->item = value;
ll->head->next = cur;
ll->size++;
return 0;
}
// Find the nodes before and at the target position
// Create a new node and reconnect the links
if ((pre = findNode(ll, index - 1)) != NULL){
cur = pre->next;
pre->next = malloc(sizeof(ListNode));
if (pre->next == NULL)
{
exit(0);
}
pre->next->item = value;
pre->next->next = cur;
ll->size++;
return 0;
}
return -1;
}
int removeNode(LinkedList *ll, int index){
ListNode *pre, *cur;
// Highest index we can remove is size-1
if (ll == NULL || index < 0 || index >= ll->size)
return -1;
// If removing first node, need to update head pointer
if (index == 0){
cur = ll->head->next;
free(ll->head);
ll->head = cur;
ll->size--;
return 0;
}
// Find the nodes before and after the target position
// Free the target node and reconnect the links
if ((pre = findNode(ll, index - 1)) != NULL){
if (pre->next == NULL)
return -1;
cur = pre->next;
pre->next = cur->next;
free(cur);
ll->size--;
return 0;
}
return -1;
}
|
the_stack_data/161081630.c | /* Calculates a definite integral by using a quadrature rule.
* Doesn't use worksharing directives, but shares loop iterations manually. */
/* For the default values of a, b, and n, sequential time on my i3-540 is 0.15 s,
* and parallel time is 0.08 s (Release x86, /O2 /Ot /Oi). */
# include <stdlib.h>
# include <stdio.h>
# include <math.h>
# include <time.h>
# include <omp.h>
#define MAX_NUM_THREADS 8
#define MAX 1024
#define ACCURACY 0.01
typedef struct Results Results;
struct Results {
double val;
double time;
};
// The function whose integral we calculate
inline double f(const double x) {
register const double pi = 3.141592653589793;
double value;
value = 50.0 / (pi * (2500.0 * x * x + 1.0));
return value;
}
/************************/
/* SEQUENTIAL ALGORITHM */
/************************/
void seqQuad(const unsigned n, const double a, const double b, double *total, double *execTime) {
unsigned i;
double total_q = 0.0;
double wtime;
double x;
wtime = omp_get_wtime();
for (i = 0; i < n; i++) {
x = ((double)(n - i - 1)*a + (double)(i)*b) / (double)(n - 1);
total_q = total_q + f(x);
}
wtime = omp_get_wtime() - wtime;
total_q = (b - a) * total_q / (double)n;
*total = total_q;
*execTime = (double)wtime;
}
Results sequential(const unsigned n, const double a, const double b) {
Results results;
seqQuad(n, a, b, &results.val, &results.time);
return results;
}
/**********************/
/* PARALLEL ALGORITHM */
/**********************/
void parQuad(const unsigned n, const double a, const double b, double *total, double *execTime) {
unsigned i;
unsigned start, end, chunk;
unsigned myId, numThreads;
double total_q = 0.0;
double wtime;
double x;
wtime = omp_get_wtime();
#pragma omp parallel default(none) \
private(i, x, myId, start, end, chunk) \
shared(/*n, a, b,*/ numThreads) \
reduction(+:total_q)
{
myId = omp_get_thread_num();
numThreads = omp_get_num_threads();
//chunk = (unsigned)ceil((double)n / (double)numThreads);
chunk = (n + numThreads - 1) / numThreads;
start = myId*chunk;
end = start + chunk < n ? start + chunk : n;
for (i = start; i < end; i++) {
x = ((double)(n - i - 1)*a + (double)(i)*b) / (double)(n - 1);
total_q = total_q + f(x);
}
} // omp parallel
wtime = omp_get_wtime() - wtime;
total_q = (b - a) * total_q / (double)n;
*total = total_q;
*execTime = (double)wtime;
}
Results parallel(const unsigned n, const double a, const double b) {
Results results;
parQuad(n, a, b, &results.val, &results.time);
return results;
}
void compareAndPrint(const unsigned n, const double a, const double b) {
Results seq, par;
seq = sequential(n, a, b);
par = parallel(n, a, b);
printf(" Sequential estimate quadratic rule = %24.16f\n", seq.val);
printf(" Parallel estimate quadratic rule = %24.16f\n", par.val);
printf("Sequential time quadratic rule = %f s\n", seq.time);
printf("Parallel time quadratic rule = %f s\n", par.time);
if (fabs(seq.val - par.val) < ACCURACY)
printf("\tTest PASSED!\n");
else
printf("\a\tTest FAILED!!!\n");
printf("\n");
}
int main(int argc, char *argv[]) {
unsigned n;
double a;
double b;
const double exact = 0.49936338107645674464;
if (argc != 4) {
n = 10000000;
a = 0.0;
b = 10.0;
}
else {
n = (unsigned)atoi(argv[1]);
a = atof(argv[2]);
b = atof(argv[3]);
}
printf("\n");
printf("QUAD:\n");
printf(" Estimate the integral of f(x) from A to B.\n");
printf(" f(x) = 50 / ( pi * ( 2500 * x * x + 1 ) ).\n");
printf("\n");
printf(" A = %f\n", a);
printf(" B = %f\n", b);
printf(" N = %u\n", n);
//printf(" Exact = %24.16f\n", exact);
printf("\n");
compareAndPrint(n, a, b);
printf(" Normal end of execution.\n");
printf("\n");
getchar();
return 0;
} |
the_stack_data/156393078.c | #include <stdio.h>
int main() {
printf("hello world\n");
int num;
scanf("%i", &num);
printf("%i\n", num / 2);
return 0;
}
void hello() {
return;
}
|
the_stack_data/59513851.c | /*
* Copyright (C) 2018 Intel Corporation. All rights reserved.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#ifdef CONFIG_DMAR_PARSE_ENABLED
#include <hypervisor.h>
#include "vtd.h"
#include "acpi.h"
#define PCI_CONFIG_ADDRESS 0xcf8
#define PCI_CONFIG_DATA 0xcfc
#define PCI_CONFIG_ACCESS_EN 0x80000000
enum acpi_dmar_type {
ACPI_DMAR_TYPE_HARDWARE_UNIT = 0,
ACPI_DMAR_TYPE_RESERVED_MEMORY = 1,
ACPI_DMAR_TYPE_ROOT_ATS = 2,
ACPI_DMAR_TYPE_HARDWARE_AFFINITY = 3,
ACPI_DMAR_TYPE_NAMESPACE = 4,
ACPI_DMAR_TYPE_RESERVED = 5
};
/* Values for entry_type in ACPI_DMAR_DEVICE_SCOPE - device types */
enum acpi_dmar_scope_type {
ACPI_DMAR_SCOPE_TYPE_NOT_USED = 0,
ACPI_DMAR_SCOPE_TYPE_ENDPOINT = 1,
ACPI_DMAR_SCOPE_TYPE_BRIDGE = 2,
ACPI_DMAR_SCOPE_TYPE_IOAPIC = 3,
ACPI_DMAR_SCOPE_TYPE_HPET = 4,
ACPI_DMAR_SCOPE_TYPE_NAMESPACE = 5,
ACPI_DMAR_SCOPE_TYPE_RESERVED = 6 /* 6 and greater are reserved */
};
struct acpi_table_dmar {
/* Common ACPI table header */
struct acpi_table_header header;
/* Host address Width */
uint8_t width;
uint8_t flags;
uint8_t reserved[10];
};
/* DMAR subtable header */
struct acpi_dmar_header {
uint16_t type;
uint16_t length;
};
struct acpi_dmar_hardware_unit {
struct acpi_dmar_header header;
uint8_t flags;
uint8_t reserved;
uint16_t segment;
/* register base address */
uint64_t address;
};
struct find_iter_args {
int i;
struct acpi_dmar_hardware_unit *res;
};
struct acpi_dmar_pci_path {
uint8_t device;
uint8_t function;
};
struct acpi_dmar_device_scope {
uint8_t entry_type;
uint8_t length;
uint16_t reserved;
uint8_t enumeration_id;
uint8_t bus;
};
typedef int (*dmar_iter_t)(struct acpi_dmar_header*, void*);
static struct dmar_info dmar_info_parsed;
static int dmar_unit_cnt;
static void
dmar_iterate_tbl(dmar_iter_t iter, void *arg)
{
struct acpi_table_dmar *dmar_tbl;
struct acpi_dmar_header *dmar_header;
char *ptr, *ptr_end;
dmar_tbl = (struct acpi_table_dmar *)get_dmar_table();
ASSERT(dmar_tbl != NULL, "");
ptr = (char *)dmar_tbl + sizeof(*dmar_tbl);
ptr_end = (char *)dmar_tbl + dmar_tbl->header.length;
for (;;) {
if (ptr >= ptr_end)
break;
dmar_header = (struct acpi_dmar_header *)ptr;
if (dmar_header->length <= 0) {
pr_err("drhd: corrupted DMAR table, l %d\n",
dmar_header->length);
break;
}
ptr += dmar_header->length;
if (!iter(dmar_header, arg))
break;
}
}
static int
drhd_count_iter(struct acpi_dmar_header *dmar_header, __unused void *arg)
{
if (dmar_header->type == ACPI_DMAR_TYPE_HARDWARE_UNIT)
dmar_unit_cnt++;
return 1;
}
static int
drhd_find_iter(struct acpi_dmar_header *dmar_header, void *arg)
{
struct find_iter_args *args;
if (dmar_header->type != ACPI_DMAR_TYPE_HARDWARE_UNIT)
return 1;
args = arg;
if (args->i == 0) {
args->res = (struct acpi_dmar_hardware_unit *)dmar_header;
return 0;
}
args->i--;
return 1;
}
static struct acpi_dmar_hardware_unit *
drhd_find_by_index(int idx)
{
struct find_iter_args args;
args.i = idx;
args.res = NULL;
dmar_iterate_tbl(drhd_find_iter, &args);
return args.res;
}
static uint8_t get_secondary_bus(uint8_t bus, uint8_t dev, uint8_t func)
{
uint32_t data;
io_write_long(PCI_CONFIG_ACCESS_EN | (bus << 16) | (dev << 11) |
(func << 8) | 0x18, PCI_CONFIG_ADDRESS);
data = io_read_long(PCI_CONFIG_DATA);
return (data >> 8) & 0xff;
}
static uint16_t
dmar_path_bdf(int path_len, int busno,
const struct acpi_dmar_pci_path *path)
{
int i;
uint8_t bus;
uint8_t dev;
uint8_t fun;
bus = (uint8_t)busno;
dev = path->device;
fun = path->function;
for (i = 1; i < path_len; i++) {
bus = get_secondary_bus(bus, dev, fun);
dev = path[i].device;
fun = path[i].function;
}
return (bus << 8 | DEVFUN(dev, fun));
}
static int
handle_dmar_devscope(struct dmar_dev_scope *dev_scope,
void *addr, int remaining)
{
int path_len;
uint16_t bdf;
struct acpi_dmar_pci_path *path;
struct acpi_dmar_device_scope *apci_devscope = addr;
if (remaining < (int)sizeof(struct acpi_dmar_device_scope))
return -1;
if (remaining < apci_devscope->length)
return -1;
path = (struct acpi_dmar_pci_path *)(apci_devscope + 1);
path_len = (apci_devscope->length -
sizeof(struct acpi_dmar_device_scope)) /
sizeof(struct acpi_dmar_pci_path);
bdf = dmar_path_bdf(path_len, apci_devscope->bus, path);
dev_scope->bus = (bdf >> 8) & 0xff;
dev_scope->devfun = bdf & 0xff;
return apci_devscope->length;
}
static uint32_t
get_drhd_dev_scope_cnt(struct acpi_dmar_hardware_unit *drhd)
{
struct acpi_dmar_device_scope *scope;
char *start;
char *end;
uint32_t count = 0;
start = (char *)drhd + sizeof(struct acpi_dmar_hardware_unit);
end = (char *)drhd + drhd->header.length;
while (start < end) {
scope = (struct acpi_dmar_device_scope *)start;
if (scope->entry_type == ACPI_DMAR_SCOPE_TYPE_ENDPOINT ||
scope->entry_type == ACPI_DMAR_SCOPE_TYPE_BRIDGE ||
scope->entry_type == ACPI_DMAR_SCOPE_TYPE_NAMESPACE)
count++;
start += scope->length;
}
return count;
}
static int
handle_one_drhd(struct acpi_dmar_hardware_unit *acpi_drhd,
struct dmar_drhd *drhd)
{
struct dmar_dev_scope *dev_scope;
struct acpi_dmar_device_scope *ads;
int remaining, consumed;
char *cp;
uint32_t dev_count;
drhd->segment = acpi_drhd->segment;
drhd->flags = acpi_drhd->flags;
drhd->reg_base_addr = acpi_drhd->address;
if (drhd->flags & DRHD_FLAG_INCLUDE_PCI_ALL_MASK) {
drhd->dev_cnt = 0;
drhd->devices = NULL;
return 0;
}
dev_count = get_drhd_dev_scope_cnt(acpi_drhd);
drhd->dev_cnt = dev_count;
if (dev_count) {
drhd->devices =
calloc(dev_count, sizeof(struct dmar_dev_scope));
ASSERT(drhd->devices, "");
} else {
drhd->devices = NULL;
return 0;
}
remaining = acpi_drhd->header.length -
sizeof(struct acpi_dmar_hardware_unit);
dev_scope = drhd->devices;
while (remaining > 0) {
cp = (char *)acpi_drhd + acpi_drhd->header.length - remaining;
consumed = handle_dmar_devscope(dev_scope, cp, remaining);
if (consumed <= 0)
break;
remaining -= consumed;
/* skip IOAPIC & HPET */
ads = (struct acpi_dmar_device_scope *)cp;
if (ads->entry_type != ACPI_DMAR_SCOPE_TYPE_IOAPIC &&
ads->entry_type != ACPI_DMAR_SCOPE_TYPE_HPET)
dev_scope++;
else
pr_dbg("drhd: skip dev_scope type %d",
ads->entry_type);
}
return 0;
}
int parse_dmar_table(void)
{
int i;
struct acpi_dmar_hardware_unit *acpi_drhd;
/* find out how many dmar units */
dmar_iterate_tbl(drhd_count_iter, NULL);
/* alloc memory for dmar uint */
dmar_info_parsed.drhd_units =
calloc(dmar_unit_cnt, sizeof(struct dmar_drhd));
ASSERT(dmar_info_parsed.drhd_units, "");
dmar_info_parsed.drhd_count = dmar_unit_cnt;
for (i = 0; i < dmar_unit_cnt; i++) {
acpi_drhd = drhd_find_by_index(i);
if (acpi_drhd == NULL)
continue;
if (acpi_drhd->flags & DRHD_FLAG_INCLUDE_PCI_ALL_MASK)
ASSERT((i+1) == dmar_unit_cnt,
"drhd with flags set should be the last one");
handle_one_drhd(acpi_drhd, &dmar_info_parsed.drhd_units[i]);
}
return 0;
}
struct dmar_info *get_dmar_info(void)
{
parse_dmar_table();
return &dmar_info_parsed;
}
#endif
|
the_stack_data/179830671.c | #include <assert.h>
#include <stdarg.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
size_t my_add(size_t num, ...)
{
va_list argp;
va_start(argp, num);
size_t accum = 0;
for (size_t i = 0; i < num; ++i) {
size_t next = va_arg(argp, size_t);
accum += next;
}
va_end(argp);
return accum;
}
int my_add2(size_t num, ...)
{
va_list argp;
va_start(argp, num);
int accum = 0;
for (int i = 0; i < num; ++i) {
int next = va_arg(argp, int);
accum += next;
}
va_end(argp);
return accum;
}
struct Foo {
unsigned int i;
unsigned char c;
}; // __attribute__((packed));
struct Foo2 {
uint32_t i;
uint8_t c;
uint32_t i2;
}; // __attribute__((packed));
uint32_t S = 12;
void update_static() { S++; }
uint32_t takes_int(uint32_t i) { return i + 2; }
uint32_t takes_ptr(uint32_t *p) { return *p + 2; }
uint32_t takes_ptr_option(uint32_t *p)
{
if (p) {
return *p - 1;
} else {
return 0;
}
}
void mutates_ptr(uint32_t *p) { *p -= 1; }
uint32_t name_in_c(uint32_t i) { return i + 2; }
uint32_t takes_struct(struct Foo f) { return f.i + f.c; }
uint32_t takes_struct_ptr(struct Foo *f) { return f->i + f->c; }
uint32_t takes_struct2(struct Foo2 f)
{
assert(sizeof(unsigned int) == sizeof(uint32_t));
return f.i + f.i2;
}
uint32_t takes_struct_ptr2(struct Foo2 *f) { return f->i + f->c; }
|
the_stack_data/74734.c | void red() {
printf("\x1b[31m");
}
void blue() {
printf("\x1b[34m");
}
void green() {
printf("\x1b[32m");
}
void magenta() {
printf("\x1b[35m");
}
void cyan() {
printf("\x1b[36m");
}
void yellow() {
printf("\x1b[33m");
}
void reset() {
printf("\x1b[0m");
}
|
the_stack_data/53072.c | #include <stdio.h>
int main(){
short a;
long b;
long long c;
long double d;
printf("size of short = %ld bytes\n", sizeof(a));
printf("size of long = %ld bytes\n", sizeof(b));
printf("size of long long = %ld bytes\n", sizeof(c));
printf("size of long double = %ld bytes\n", sizeof(d));
return 0;
}
|
the_stack_data/59511502.c | #include<stdio.h>
#include<stdlib.h>
void swap(int *x,int *y)
{
int c=*x;
*x=*y;
*y=c;
}
int partition(int a[],int low, int high)
{
//int mid=(low+high)/2;
int pivot=a[low];
int start=low;
int end=high;
while(start<end)
{
while(a[start]<=pivot)
start++;
while(a[end]>pivot)
end--;
if(start<end)
swap(&a[start],&a[end]);
}
swap(&a[end],&a[low]);
return end;
}
void quickSort(int a[],int low,int high)
{
if(low<high)
{
int pos=partition(a,low,high);
quickSort(a,low,pos-1);
quickSort(a,pos+1,high);
}
}
int main()
{
int n,i;
printf("Enter size of array: ");
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
a[i]=rand()/100;
quickSort(a,0,n-1);
/*printf("The sorted array is:\n");
for(i=0;i<n;i++)
printf("%d ",a[i]);*/
return 0;
}
|
the_stack_data/23575369.c | #include <stdlib.h>
#include <stdio.h>
#include <math.h>
#define VWrap(v, t) \
if (v.t >= 0.5 * Box.t) v.t -= Box.t; \
else if (v.t < -0.5 * Box.t) v.t += Box.t
#define VWrapAll(v) \
{VWrap (v, x); \
VWrap (v, y);\
VWrap (v, z);}
typedef struct {
double x,y,z;
} VecR ;
typedef struct{
int x,y,z;
} VecI;
#define PBC1_New(v,v0,t) ( (v).t = (v).t - Box.t *lround( ( (v).t - (v0).t ) / Box.t ) )
#define PBC1_halb(v,t) \
if ( (v).t > 0.5*Box.t ) { (v).t -= (int)( 2*(v).t /Box.t )*Box.t;} \
else if ( (v).t < -0.5*Box.t ) { (v).t += (int)( 2*(v).t /Box.t )*Box.t;}
// PBC (0..Box)
#define PBC1_BOX(v,t) \
if ( (v).t > Box.t) {(v).t -= (int)( (v).t /Box.t )*Box.t; } \
else if ( (v).t < 0.0 ) {(v).t += (1-(int)( (v).t /Box.t ))*Box.t;}
// PBC (-Box/2.0 ... Box/2.0)
#define PBC1(v,t) ( (v).t = (v).t - lround(((v).t)/Box.t)*(Box.t) )
#define PBCAll(v) \
{ PBC1(v,x); \
PBC1(v,y); \
PBC1(v,z); }
VecI Box;
static void DendPBCunwrap(VecR* pos, const VecR *refpos);
int main(){
Box.x =20;
Box.y=20;
Box.z=20;
VecR test;
VecR ref={3.0,3.0,3.0};
fprintf(stdout,"Box size: %d, %d, %d\n",Box.x, Box.y, Box.z);
for (;;){
fprintf(stdout,"Give vector x y z\n");
scanf("%lf %lf %lf",&test.x,&test.y,&test.z);
fprintf(stdout,"test vector : %lf %lf %lf\n",test.x, test.y, test.z);
fprintf(stdout,"Wrapping\n");
//PBCAll(test);
PBCAll(test);
fprintf(stdout,"new test vector : %lf %lf %lf\n",test.x, test.y, test.z);
}
return 0;
}
static void DendPBCunwrap(VecR* pos, const VecR *refpos){
//pos->x -= lround( ( pos->x - refpos->x ) / Box.x )*(Box.x);
//pos->y -= lround( ( pos->y - refpos->y ) / Box.y )*(Box.y);
//pos->z -= lround( ( pos->z - refpos->z ) / Box.z )*(Box.z);
pos->x -= lround( ( pos->x - refpos->x ) / Box.x )*(Box.x);
pos->y -= lround( ( pos->y - refpos->y ) / Box.y )*(Box.y);
pos->z -= lround( ( pos->z - refpos->z ) / Box.z )*(Box.z);
printf("lround values: %lf, %ld, %lf, %ld, %lf, %ld\n"
,pos->x - refpos->x,lround(pos->x - refpos->x)
,pos->y - refpos->y,lround(pos->y - refpos->y)
,pos->z - refpos->z,lround(pos->z - refpos->z)
);
}
/*
#define PBC1(v,t) ( (v).t = (v).t - lround(((v).t)/Box.t)*(Box.t) )
double P_Cd_x (double x){
double x1;
x1=x;
if (x>XBOX) x1=x-(int)(x/XBOX)*XBOX;
if (x<0) x1=x+(1-(int)(x/XBOX))*XBOX;
return (x1);
}
double P_Cd_y (double y){
double y1;
y1=y;
if (y>YBOX) y1=y-(int)(y/YBOX)*YBOX;
if (y<0) y1=y+(1-(int)(y/YBOX))*YBOX;
return (y1);
}
double P_Cd_z (double z){
double z1;
z1=z;
if (z>ZBOX) z1=z-(int)(z/ZBOX)*ZBOX;
if (z<0) z1=z+(1-(int)(z/ZBOX))*ZBOX;
return (z1);
}
*/
|
the_stack_data/220456900.c | #ifdef INTERFACE
CLASS(InputContainer) EXTENDS(Container)
METHOD(InputContainer, keyDown, float(entity, float, float, float))
METHOD(InputContainer, mouseMove, float(entity, vector))
METHOD(InputContainer, mousePress, float(entity, vector))
METHOD(InputContainer, mouseRelease, float(entity, vector))
METHOD(InputContainer, mouseDrag, float(entity, vector))
METHOD(InputContainer, focusLeave, void(entity))
METHOD(InputContainer, resizeNotify, void(entity, vector, vector, vector, vector))
METHOD(InputContainer, _changeFocusXY, float(entity, vector))
ATTRIB(InputContainer, mouseFocusedChild, entity, NULL)
ATTRIB(InputContainer, isTabRoot, float, 0)
ENDCLASS(InputContainer)
#endif
#ifdef IMPLEMENTATION
void resizeNotifyInputContainer(entity me, vector relOrigin, vector relSize, vector absOrigin, vector absSize)
{
resizeNotifyContainer(me, relOrigin, relSize, absOrigin, absSize);
/*
if(me.parent.instanceOfInputContainer)
me.isTabRoot = 0;
else
me.isTabRoot = 1;
*/
}
void focusLeaveInputContainer(entity me)
{
focusLeaveContainer(me);
me.mouseFocusedChild = NULL;
}
float keyDownInputContainer(entity me, float scan, float ascii, float shift)
{
entity f, ff;
if(keyDownContainer(me, scan, ascii, shift))
return 1;
if(scan == K_ESCAPE)
{
f = me.focusedChild;
if(f)
{
me.setFocus(me, NULL);
return 1;
}
return 0;
}
if(scan == K_TAB)
{
f = me.focusedChild;
if(shift & S_SHIFT)
{
if(f)
{
for(ff = f.prevSibling; ff; ff = ff.prevSibling)
{
if not(ff.focusable)
continue;
me.setFocus(me, ff);
return 1;
}
}
if(!f || me.isTabRoot)
{
for(ff = me.lastChild; ff; ff = ff.prevSibling)
{
if not(ff.focusable)
continue;
me.setFocus(me, ff);
return 1;
}
return 0; // AIIIIEEEEE!
}
}
else
{
if(f)
{
for(ff = f.nextSibling; ff; ff = ff.nextSibling)
{
if not(ff.focusable)
continue;
me.setFocus(me, ff);
return 1;
}
}
if(!f || me.isTabRoot)
{
for(ff = me.firstChild; ff; ff = ff.nextSibling)
{
if not(ff.focusable)
continue;
me.setFocus(me, ff);
return 1;
}
return 0; // AIIIIEEEEE!
}
}
}
return 0;
}
float _changeFocusXYInputContainer(entity me, vector pos)
{
entity e, ne;
e = me.mouseFocusedChild;
ne = me.itemFromPoint(me, pos);
if(ne)
if not(ne.focusable)
ne = NULL;
me.mouseFocusedChild = ne;
if(ne)
if(ne != e)
{
me.setFocus(me, ne);
if(ne.instanceOfInputContainer)
{
ne.focusedChild = NULL;
ne._changeFocusXY(e, globalToBox(pos, ne.Container_origin, ne.Container_size));
}
}
return (ne != NULL);
}
float mouseDragInputContainer(entity me, vector pos)
{
if(mouseDragContainer(me, pos))
return 1;
if(pos_x >= 0 && pos_y >= 0 && pos_x < 1 && pos_y < 1)
return 1;
return 0;
}
float mouseMoveInputContainer(entity me, vector pos)
{
if(me._changeFocusXY(me, pos))
if(mouseMoveContainer(me, pos))
return 1;
if(pos_x >= 0 && pos_y >= 0 && pos_x < 1 && pos_y < 1)
return 1;
return 0;
}
float mousePressInputContainer(entity me, vector pos)
{
me.mouseFocusedChild = NULL; // force focusing
if(me._changeFocusXY(me, pos))
if(mousePressContainer(me, pos))
return 1;
if(pos_x >= 0 && pos_y >= 0 && pos_x < 1 && pos_y < 1)
return 1;
return 0;
}
float mouseReleaseInputContainer(entity me, vector pos)
{
float r;
r = mouseReleaseContainer(me, pos);
if(me.focused) // am I still eligible for this? (UGLY HACK, but a mouse event could have changed focus away)
if(me._changeFocusXY(me, pos))
return 1;
if(pos_x >= 0 && pos_y >= 0 && pos_x < 1 && pos_y < 1)
return 1;
return 0;
}
#endif
|
the_stack_data/39763.c | #include <stdio.h>
int main()
{
int a[]={1,2,3,4,5,6,7},i;
int n=sizeof(a)/sizeof(int);
int* p=a;
int * pend=&a[n-1];
for(i=0;i<=n-1;i++)
{
printf("%d,",a[i]);
}
printf("\n");
for(i=0;i<=n-1;i++)
{
printf("%d,",*(p+i));
}
printf("\n");
for(i=0;i<=n-1;i++)
{
printf("%d,",*(p++));
}
printf("\n");
for(p=a;p<=pend;p++)
{
printf("%d,",*(p));
}
printf("\n");
p=a;
for(pend=&a[n-1];pend>=p;pend--)
{
printf("%d,",*pend);
}
printf("\n");
p=a;
pend=&a[n-1];
printf("%d,",pend-p+1);
}
|
the_stack_data/116594.c | /*
Copyright (c) 2020 Fabian Mink
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 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.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
//usage: "hexconv <infile> <outfile>"
//Purpose: convert file into c hex array
//similar to "xxd -i <infile> <outfile>"
int main(int argc, char* argv[]) {
FILE *fp,*fpout;
int ch;
char* filename = argv[1];
char* fileout = argv[2];
int len = strlen(filename);
char filename_conv[len+1];
for(int i=0; i<len; i++){
char curChar = filename[i];
if(isalpha(curChar)||isdigit(curChar)){
filename_conv[i] = curChar;
}
else{
filename_conv[i] = '_';
}
}
filename_conv[len] = 0x00; //terminating 0
//printf("Reading from : %s\n", filename);
//printf("Converted to : %s\n", filename_conv);
fp = fopen(filename, "rb");
fpout = fopen(fileout, "w");
fprintf(fpout, "unsigned char %s[] = {\n", filename_conv);
int countchar = 0;
if (fp == NULL || fpout == NULL)
{
printf("File not found\n");
}
else
{
while ((ch = fgetc(fp)) != EOF){
//ch = fgetc(fp);
//if(ch == EOF) {
// printf("EOF!! cnt: %i, char: %i\n",countchar,ch);
// break;
//}
//printf("cnt: %i, char: %i\n",countchar,ch);
if(countchar) {
fprintf(fpout, ","); //not for first char
if(!(countchar%10)) {
fprintf(fpout, "\n"); //not for first char
}
}
countchar++;
fprintf(fpout, "0x%02x", (unsigned char)ch);
}
}
fprintf(fpout, "\n};\n");
fprintf(fpout, "unsigned int %s_len = %d", filename_conv, countchar);
fprintf(fpout, ";\n");
fclose(fp);
fclose(fpout);
return 0;
}
|
the_stack_data/150142249.c | #include<stdio.h>
int main()
{
int a[10][10],i,j,det=0;
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
for(i=0;i<3;i++)
{
det=det+(a[0][i]*(a[1][(i+1)%3]*a[2][(i+2)%3]-a[1][(i+2)%3]*a[2][(i+1)%3]));
}
printf("%d",det);
} |
the_stack_data/40762423.c | #include<stdio.h>
#include<stdlib.h>
#include<time.h>
int ** create(int n)
{
int **arr = (int **)malloc(n * sizeof(int *));
for (int i=0; i<n; i++)
arr[i] = (int *)malloc(n * sizeof(int));
return arr;
}
void add(int n, int ** a, int ** b, int ** c)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
c[i][j] = a[i][j] + b[i][j];
}
}
}
void copy(int temp, int temp2, int n, int ** a, int ** r)
{
for (int i = 0; i < n/2; i++)
{
for (int j = 0; j < n/2; j++)
{
r[i][j] = a[temp + i][temp2 + j];
}
}
}
void scan(int n, int ** a)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
scanf("%d", &a[i][j]);
}
}
}
void print(int N, int ** a)
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
printf(" %d ", a[i][j]);
}
printf("%s", "\n");
}
}
void matrix_mul(int N, int ** a, int ** b, int ** c)
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
c[i][j] = 0;
for (int k = 0; k < N; k++)
{
c[i][j] += a[i][k] * b[k][j];
}
}
}
}
void matrix_mul_dc(int n, int **a, int **b, int **c)
{
if (n/2 == 1)
{
matrix_mul(n/2, a, b, c);
return;
}
int ** A11 = create(n/2);
int ** A12 = create(n/2);
int ** A21 = create(n/2);
int ** A22 = create(n/2);
int ** B11 = create(n/2);
int ** B12 = create(n/2);
int ** B21 = create(n/2);
int ** B22 = create(n/2);
int ** R11 = create(n/2);
int ** R12 = create(n/2);
int ** R21 = create(n/2);
int ** R22 = create(n/2);
copy(0, 0, n, a, A11);
copy(0, n/2, n, a, A12);
copy(n/2, 0, n, a, A21);
copy(n/2, n/2, n, a, A22);
copy(0, 0, n, b, B11);
copy(0, n/2, n, b, B12);
copy(n/2, 0, n, b, B21);
copy(n/2, n/2, n, b, B22);
int ** temp = create(n/2);
int ** temp_2 = create(n/2);
matrix_mul_dc(n/2, A11, B11, temp);
matrix_mul_dc(n/2, A12, B21, temp_2);
add(n/2, temp, temp_2, R11);
matrix_mul_dc(n/2, A11, B12, temp);
matrix_mul_dc(n/2, A12, B22, temp_2);
add(n/2, temp, temp_2, R12);
matrix_mul_dc(n/2, A21, B11, temp);
matrix_mul_dc(n/2, A22, B21, temp_2);
add(n/2, temp, temp_2, R21);
matrix_mul_dc(n/2, A21, B12, temp);
matrix_mul_dc(n/2, A22, B22, temp_2);
add(n/2, temp, temp_2, R22);
int ** R = create(n);
copy(0, 0, n, a, R);
copy(0, n/2, n, a, R);
copy(n/2, 0, n, a, R);
copy(n/2, n/2, n, a, R);
}
int main()
{
int m;
scanf("%d", &m);
int ** a = create(m);
int ** b = create(m);
scan(m, a);
scan(m, b);
int ** c = create(m);
matrix_mul(m, a, b, c);
print(m, c);
matrix_mul_dc(m, a, b, c);
print(m, c);
}
|
the_stack_data/618117.c | #include <stdio.h>
/*
add code here if needed
*/
int add (int a, int b) {
printf("addition of: ");
return a + b;
}
int sub (int a, int b) {
printf("subtraction of: ");
return a - b;
}
int mul (int a, int b) {
printf("multiplication of: ");
return a * b;
}
int div (int a, int b) {
printf("division of: ");
return a / b;
}
int calculator(int a, int b, int(*op)(int, int)) {
int res = op(a, b);
printf("%d and %d is %d\n", a, b, res);
return res;
}
int main(){
int a, b, operation;
typedef int (*calcPtr) (int, int);
calcPtr ptr;
printf("Enter int a: \n");
scanf("%d", &a);
printf("Enter int b: \n");
scanf("%d", &b);
printf("Choose:\n 1 for addition\n 2 for subtraction\n 3 for multiplication\n 4 for division\n");
scanf("%d", &operation);
switch (operation)
{
case 1:
/*
add code here if needed
*/
ptr = add;
calculator(a, b, ptr);
break;
case 2:
/*
add code here if needed
*/
ptr = sub;
calculator(a, b, ptr);
break;
case 3:
/*
add code here if needed
*/
ptr = mul;
calculator(a, b, ptr);
break;
case 4:
/*
add code here if needed
*/
ptr = div;
calculator(a, b, ptr);
break;
default:
printf("no such option\n");
break;
}
return 0;
}
/*
add code here if needed
*/
|
the_stack_data/7949016.c | #include <stdio.h>
#include <string.h>
struct test {
char a;
int b;
long c;
char d;
char e[3];
};
int main() {
struct test t;
memset(&t, 0, sizeof t);
printf("%d %d %ld %d %d %d %d\n", t.a, t.b, t.c, t.d, t.e[0], t.e[1], t.e[2]);
}
|
the_stack_data/1168645.c | //a program in c to print ASCII value of a character
//testcase1,2: input:A input:a
// output:65 output:97
#include<stdio.h>
int main()
{
char c;
scanf(" %c ", &c);
printf(" %d ", c);
return 0;
}
|
the_stack_data/153268427.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <getopt.h>
float arc_length(float, float);
double get_radians(float);
float get_area(float);
void print_usage(void);
float area_of_square_from_arc(float, float);
float area_of_square(float);
float line_to_square_side(float);
int main(int argc, char** argv) {
int option;
float angle, radius;
if (argc != 5) {
print_usage();
}
while ((option = getopt(argc, argv, "a:r:")) != -1) {
switch (option) {
case 'a':
angle = atof(optarg);
break;
case 'r':
radius = atof(optarg);
break;
default:
print_usage();
}
}
// printf("got radius = %.2f, angle = %.2f degrees",radius,angle);
float area = area_of_square_from_arc(angle, radius);
printf(
"Area of square formed from an arc of radius %.2f and angle %.2f degrees "
"is %.3f",
radius, angle, area);
return 0;
}
float area_of_square_from_arc(float arc_angle, float arc_radius) {
float arc_len = arc_length(arc_angle, arc_radius);
float side_len = line_to_square_side(arc_len);
return area_of_square(side_len);
}
float area_of_square(float side_length) { return side_length * side_length; }
float line_to_square_side(float length) {
float square_side_length = length / 4;
return square_side_length;
}
float arc_length(float angle, float radius) {
double radians = get_radians(angle);
return radians * radius;
}
double get_radians(float degrees) { return (M_PI / 180) * degrees; }
void print_usage() {
printf("Usage: a.exe -r <radius> -a <angle in degrees>\n");
exit(2);
} |
the_stack_data/248581150.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_str_is_numeric.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: anajmi <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/07/01 09:08:23 by anajmi #+# #+# */
/* Updated: 2021/07/02 13:17:56 by anajmi ### ########.fr */
/* */
/* ************************************************************************** */
void check_digit(char str, int *is_digit_ptr)
{
if (!('0' <= str && str <= '9'))
{
*is_digit_ptr = 0;
}
}
int ft_str_is_numeric(char *str)
{
int i;
int is_digit;
int *ptr;
i = 0;
ptr = &is_digit;
is_digit = 1;
while (str[i] != '\0')
{
check_digit(str[i], ptr);
i++;
}
return (is_digit);
}
|
the_stack_data/1176481.c | #include <stdio.h>
#include <stdlib.h>
#include <sys/sem.h>
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/msg.h>
#include <sys/types.h>
#include <sys/ipc.h>
int main() {
int msgid = msgget(IPC_PRIVATE, 0660);
struct msgbuf {
long mtype;
char mtext[1];
};
switch(fork()) {
case 0:
{
int sum1 = 0;
int number1_from_pipe = 1;
int finished = 0;
while(!finished) {
struct msgbuf msg_son1;
msg_son1.mtype = 1;
msg_son1.mtext[1] = number1_from_pipe;
if( msgrcv(msgid,&msg_son1,(sizeof(struct msgbuf) - sizeof(long)), 1,0) == -1) {
perror("Failed to receive message son 1");
}
printf("%d\n", msg_son1.mtext[1]);
sum1 = sum1 + msg_son1.mtext[1];
if(msg_son1.mtext[1] == 0) {
struct msgbuf msg_sum1;
msg_sum1.mtype = 1;
msg_sum1.mtext[1]=sum1;
if( msgsnd(msgid,&msg_sum1,(sizeof(struct msgbuf) - sizeof(long)), 0) == -1 ) {
perror("Failed to send sum 1");
}
finished = 1;
}
}
break;
}
case -1:
{
printf("ERROR WITH FORK");
return -1;
break;
}
default:
{
switch(fork()) {
case 0:
{
int sum2 = 0;
int number2_from_pipe = 1;
int finished = 0;
while(!finished) {
struct msgbuf msg_son2;
msg_son2.mtype = 2;
msg_son2.mtext[1]=number2_from_pipe;
if( msgrcv(msgid,&msg_son2,(sizeof(struct msgbuf) - sizeof(long)), 2,0) == -1) {
perror("Failed to receive son 2");
}
sum2 = sum2 + msg_son2.mtext[1];
if(msg_son2.mtext[1] == 0) {
struct msgbuf msg_sum2;
msg_sum2.mtype = 2;
msg_sum2.mtext[1]=sum2;
msgsnd(msgid,&msg_sum2,(sizeof(struct msgbuf) - sizeof(long)), 0);
finished = 1;
}
}
break;
}
case -1:
{
printf("ERROR WITH FORK");
return -1;
break;
}
default:
{
int temp = 1;
int negative_entered = 0;
int positive_entered = 0;
do {
printf("\nInput an integer (0 triggers the computation)\n");
scanf ("%d",&temp);
getchar(); //Pour éviter de re-rentrer dans la boucle avec le charactère de enter
//Si temp est + on l'envoie dans le tube et on permet au fils 1 de lire le tube en incr la sem
if(temp > 0) {
positive_entered = 1;
struct msgbuf msg_pos;
msg_pos.mtype = 1;
msg_pos.mtext[1]=temp;
msgsnd(msgid, &msg_pos,(sizeof(struct msgbuf) - sizeof(long)), 0);
}
if(temp < 0) {
negative_entered = 1;
struct msgbuf msg_neg;
msg_neg.mtype = 2;
msg_neg.mtext[1]=temp;
msgsnd(msgid,&msg_neg,(sizeof(struct msgbuf) - sizeof(long)), 0);
}
if(temp == 0) {
printf("FINI\n");
struct msgbuf msg_zero1;
msg_zero1.mtype = 1;
msg_zero1.mtext[1]=temp;
msgsnd(msgid,&msg_zero1,(sizeof(struct msgbuf) - sizeof(long)), 0);
struct msgbuf msg_zero2;
msg_zero2.mtype = 2;
msg_zero2.mtext[1]=temp;
msgsnd(msgid,&msg_zero2,(sizeof(struct msgbuf) - sizeof(long)), 0);
}
}
while(temp != 0);
if(!positive_entered) {
}
if(!negative_entered) {
}
int res1;
int res2;
struct msgbuf msg_res1;
msg_res1.mtype = 0;
msg_res1.mtext[1]=res1;
msgrcv(msgid,&msg_res1,(sizeof(struct msgbuf) - sizeof(long)), 1,0);
struct msgbuf msg_res2;
msg_res2.mtype = 0;
msg_res2.mtext[1]=res2;
msgrcv(msgid,&msg_res2,(sizeof(struct msgbuf) - sizeof(long)), 2,0);
printf("\nSUM 1 = %d\n", msg_res1.mtext[1]);
printf("SUM 2 = %d\n", msg_res2.mtext[1]);
wait(NULL);
wait(NULL);
}
}
}
}
} |
the_stack_data/178266782.c | /* mattr.c CCMATH mathematics library source code.
*
* Copyright (C) 2000 Daniel A. Atkinson All rights reserved.
* This code may be redistributed under the terms of the GNU library
* public license (LGPL). ( See the lgpl.license file for details.)
* ------------------------------------------------------------------------
*/
void mattr(double *a,double *b,int m,int n)
{ double *p; int i,j;
for(i=0; i<n ;++i,++b)
for(j=0,p=b; j<m ;++j,p+=n) *a++ = *p;
}
|
the_stack_data/266231.c | #include <stdio.h>
//#define min_conf 37
typedef struct frequent_item_set{
int k;
int *frequentItem;
int supportCount;
}frequent_item_set_t;
int find_support_den(int *subset_item,int numberOfItems,frequent_item_set_t *frequentItem_data)
{
//assuming that the frequentItem_data can be accessed by this function too
int counter=0;
int i=0;int flag=0; //flag to check whether that subset exists
while(frequentItem_data[i].k!=numberOfItems)
{i++;}
while(frequentItem_data[i].k==numberOfItems)
{
int temp[numberOfItems];
int j=0;
for(j=0;j<numberOfItems;j++)
temp[j]=frequentItem_data[i].frequentItem[j];
if(memcmp(subset_item,temp,sizeof(subset_item))==0)
{flag=1;break;} //element found
i++;
}
if(flag==1)
return frequentItem_data[i].supportCount;
else
return -1; //in case not found .. conf val would be negative then
}
void conf_cal(int *arr,int *subset_item,int support_num,int numberOfItems,frequent_item_set_t *frequentItem_data)
{
int mul=sizeof(arr)-sizeof(subset_item);
int rem_item[mul];
double min_conf;
printf("Enter the min_conf:");
scanf("%lf",&min_conf);
int support_den=find_support_den(subset_item,numberOfItems,frequentItem_data);
double conf=((double)support_num/(double)support_den)*100;
int m=0,n=0; //to find arr - subset_item
int count=0;
while(m<(sizeof(arr)) && count<mul)
{
if(arr[m]==subset_item[n])
{
m++;
rem_item[count]=subset_item[n];
n++;
}
else if(arr[m]<subset_item[n])
{
rem_item[count++]=arr[m];
m++;
}
else if(arr[m]>subset_item[n])
break;
}
printf("hi");
if(conf>min_conf)
{
int i;
for(i=0;i<sizeof(subset_item);i++)
printf("%d ",subset_item[i]);
printf("->");
for(i=0;i<sizeof(rem_item);i++)
printf("%d ",rem_item[i]);
}
}
/* Function to generate subset */
void subset(int arr[], int subset_item[], int start, int end, int index, int r,int support_num,frequent_item_set_t *frequentItem_data)
{
int j, i;
if (index == r) {
printf("SUBSET IS : \n");
for(i=0;i<r;i++)
printf("%d ",subset_item[i]);
conf_cal(arr,subset_item,support_num,r,frequentItem_data);
return;
}
for (i = start; i <= end && end - i + 1 >= r - index; i++)
{
subset_item[index] = arr[i];
subset(arr, subset_item, i+1, end, index+1, r,support_num,frequentItem_data);
}
}
void printsubset(int arr[], int n, int r,int support_num,frequent_item_set_t *frequentItem_data)
{
int subset_item[r];
subset(arr, subset_item, 0, n - 1, 0, r,support_num,frequentItem_data);
}
subset_gen_function(int *arr,int k,int support_num,frequent_item_set_t *frequentItem_data)
{
//printf("hi hi ");
int i,number_of_items_in_subset;
for(number_of_items_in_subset=1;number_of_items_in_subset<k;number_of_items_in_subset++)
printsubset(arr, k, number_of_items_in_subset,support_num,frequentItem_data);
return 0;
}
|
the_stack_data/86075727.c | #include <stdio.h>
int abs(int value)
{
if(value < 0) return -value;
else return value;
}
int sum(int number)
{
int answer = 0;
for(int i=0;i<=number;i++)
{
answer += i;
}
return answer;
}
int main(void)
{
FILE *file = fopen("d7.txt","r");
int counter = 0;
int temp = 0;
while (!feof(file))
{
fscanf(file,"%d,",&temp);
counter++;
}
int data[counter];
counter = 0;
rewind(file);
while (!feof(file))
{
fscanf(file,"%d,",&data[counter]);
counter++;
}
int answer = 999999999;
temp=0;
for(int x=0;x<2000;x++)
{
temp =0;
for(int j=0;j<counter;j++)
{
temp += abs( (data[j] - x) );
}
if(answer>temp) answer = temp;
}
printf("%d",answer);
} |
the_stack_data/108750.c | /* Talisker: Personality Kit Runtime Start-up (x86_64-linux)
*/
/* Copyright (c) 2017 Mo McRoberts.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
int
main(int argc, char **argv, char **envp)
{
(void) argc;
(void) argv;
(void) envp;
return 123;
}
|
the_stack_data/107746.c | #include <stdio.h>
#include <stdlib.h>
typedef enum {
ZERO = 1,
CROSS = 2,
NONE = 0,
} Field;
typedef struct {
Field array[3][3];
} CrossZeroes;
int isFull(const CrossZeroes* cz) {
for (unsigned i = 0; i < 3; ++i) {
for (unsigned j = 0; j < 3; ++j) {
if (cz->array[i][j] == NONE) {
return 0;
}
}
}
return 1;
}
Field isWin(const CrossZeroes* cz) {
for (unsigned i = 0; i < 3; ++i) {
if ((cz->array[0][i] == cz->array[1][i]) && (cz->array[2][i] == cz->array[1][i]) && cz->array[2][i] != NONE)
return cz->array[0][i];
if ((cz->array[i][0] == cz->array[i][1]) && (cz->array[i][2] == cz->array[i][1]) && cz->array[i][2] != NONE)
return cz->array[i][0];
}
if ((cz->array[0][0] == cz->array[1][1]) && (cz->array[2][2] == cz->array[1][1]) ||
(cz->array[2][0] == cz->array[1][1]) && (cz->array[0][2] == cz->array[1][1]))
return cz->array[1][1];
return NONE;
}
unsigned good(const CrossZeroes* cz, unsigned steps, Field last) {
if (isWin(cz) == ZERO) {
return (1 << (steps << 1));
}
unsigned goodness = 0;
Field curr = (last == CROSS) ? ZERO : CROSS;
unsigned k = 0;
for (unsigned i = 0; i < 3; ++i) {
for (unsigned j = 0; j < 3; ++j) {
if (cz->array[i][j] == NONE) {
CrossZeroes temp = *cz;
temp.array[i][j] = curr;
if (isWin(&temp) != NONE) {
return isWin(&temp) == CROSS ? 0 : (1 << ((steps - 1) << 1));
}
goodness += isFull(&temp) ? 1 : good(&temp, steps - 1, curr);
}
}
}
return goodness;
}
void dump(const CrossZeroes* cz) {
printf("--\n");
for (unsigned i = 0; i < 3; ++i) {
for (unsigned j = 0; j < 3; ++j) {
printf("%c", cz->array[j][i] == NONE ? ' ' : cz->array[j][i] == ZERO ? 'O' : 'X');
}
printf("\n");
}
printf("--\n");
}
CrossZeroes moveAI(CrossZeroes *cz, unsigned steps) {
unsigned k = 0;
signed max = -1;
CrossZeroes best;
for (unsigned i = 0; i < 3; ++i) {
for (unsigned j = 0; j < 3; ++j) {
if (cz->array[i][j] == NONE) {
CrossZeroes temp = *cz;
temp.array[i][j] = ZERO;
signed goodness = good(&temp, steps - 1, ZERO);
if (goodness > max) {
best = temp;
max = goodness;
}
k++;
}
}
}
if (k != steps) {
printf("internal error\n");
}
return best;
}
void moveUser(CrossZeroes *cz) {
srand(rand());
unsigned x, y;
do {
x = rand() / (RAND_MAX / 3);
y = rand() / (RAND_MAX / 3);
// scanf("%d %d", &x, &y);
} while (cz->array[x][y] != NONE);
cz->array[x][y] = CROSS;
}
int main() {
Field result;
do {
CrossZeroes cz;
for (unsigned i = 0; i < 3; ++i) {
for (unsigned j = 0; j < 3; ++j) {
cz.array[i][j] = NONE;
}
}
unsigned steps = 9;
while (!isFull(&cz) && (isWin(&cz) == NONE)) {
moveUser(&cz);
dump(&cz);
--steps;
if (isFull(&cz) || (isWin(&cz) != NONE))
break;
printf("thinking\n");
cz = moveAI(&cz, steps);
dump(&cz);
--steps;
}
result = isWin(&cz);
switch (result) {
case CROSS:
printf("Cross Wins\n");
break;
case ZERO:
printf("Zeroes Wins\n");
break;
case NONE:
printf("Draw\n");
break;
}
}
while (result != CROSS);
return 0;
}
|
the_stack_data/95449008.c | #include <limits.h>
#include <assert.h>
#if __INT_MAX__ > 2147483647L
# if __INT_MAX__ >= 9223372036854775807L
# define BITSIZEOF_INT 64
# else
# define BITSIZEOF_INT 32
# endif
#else
# if __INT_MAX__ >= 2147483647L
# define BITSIZEOF_INT 32
# else
# define BITSIZEOF_INT 16
# endif
#endif
#if __LONG_MAX__ > 2147483647L
# if __LONG_MAX__ >= 9223372036854775807L
# define BITSIZEOF_LONG 64
# else
# define BITSIZEOF_LONG 32
# endif
#else
# define BITSIZEOF_LONG 32
#endif
#if __LONG_LONG_MAX__ > 2147483647L
# if __LONG_LONG_MAX__ >= 9223372036854775807L
# define BITSIZEOF_LONG_LONG 64
# else
# define BITSIZEOF_LONG_LONG 32
# endif
#else
# define BITSIZEOF_LONG_LONG 32
#endif
#define MAKE_FUNS(suffix, type) \
int my_ffs##suffix(type x) { \
int i; \
if (x == 0) \
return 0; \
for (i = 0; i < CHAR_BIT * sizeof (type); i++) \
if (x & ((type) 1 << i)) \
break; \
return i + 1; \
} \
\
int my_ctz##suffix(type x) { \
int i; \
for (i = 0; i < CHAR_BIT * sizeof (type); i++) \
if (x & ((type) 1 << i)) \
break; \
return i; \
} \
\
int my_clz##suffix(type x) { \
int i; \
for (i = 0; i < CHAR_BIT * sizeof (type); i++) \
if (x & ((type) 1 << ((CHAR_BIT * sizeof (type)) - i - 1))) \
break; \
return i; \
} \
\
int my_clrsb##suffix(type x) { \
int i; \
int leading = (x >> CHAR_BIT * sizeof (type) - 1) & 1; \
for (i = 1; i < CHAR_BIT * sizeof (type); i++) \
if (((x >> ((CHAR_BIT * sizeof (type)) - i - 1)) & 1) \
!= leading) \
break; \
return i - 1; \
} \
\
int my_popcount##suffix(type x) { \
int i; \
int count = 0; \
for (i = 0; i < CHAR_BIT * sizeof (type); i++) \
if (x & ((type) 1 << i)) \
count++; \
return count; \
} \
\
int my_parity##suffix(type x) { \
int i; \
int count = 0; \
for (i = 0; i < CHAR_BIT * sizeof (type); i++) \
if (x & ((type) 1 << i)) \
count++; \
return count & 1; \
}
MAKE_FUNS (, unsigned);
MAKE_FUNS (l, unsigned long);
MAKE_FUNS (ll, unsigned long long);
extern void abort (void);
extern void exit (int);
#define NUMS16 \
{ \
0x0000U, \
0x0001U, \
0x8000U, \
0x0002U, \
0x4000U, \
0x0100U, \
0x0080U, \
0xa5a5U, \
0x5a5aU, \
0xcafeU, \
0xffffU \
}
#define NUMS32 \
{ \
0x00000000UL, \
0x00000001UL, \
0x80000000UL, \
0x00000002UL, \
0x40000000UL, \
0x00010000UL, \
0x00008000UL, \
0xa5a5a5a5UL, \
0x5a5a5a5aUL, \
0xcafe0000UL, \
0x00cafe00UL, \
0x0000cafeUL, \
0xffffffffUL \
}
#define NUMS64 \
{ \
0x0000000000000000ULL, \
0x0000000000000001ULL, \
0x8000000000000000ULL, \
0x0000000000000002ULL, \
0x4000000000000000ULL, \
0x0000000100000000ULL, \
0x0000000080000000ULL, \
0xa5a5a5a5a5a5a5a5ULL, \
0x5a5a5a5a5a5a5a5aULL, \
0xcafecafe00000000ULL, \
0x0000cafecafe0000ULL, \
0x00000000cafecafeULL, \
0xffffffffffffffffULL \
}
unsigned int ints[] =
#if BITSIZEOF_INT == 64
NUMS64;
#elif BITSIZEOF_INT == 32
NUMS32;
#else
NUMS16;
#endif
unsigned long longs[] =
#if BITSIZEOF_LONG == 64
NUMS64;
#else
NUMS32;
#endif
unsigned long long longlongs[] =
#if BITSIZEOF_LONG_LONG == 64
NUMS64;
#else
NUMS32;
#endif
#define N(table) (sizeof (table) / sizeof (table[0]))
int
main (void)
{
int i;
for (i = 0; i < N(ints); i++)
{
if (__builtin_ffs (ints[i]) != my_ffs (ints[i]))
abort ();
if (ints[i] != 0
&& __builtin_clz (ints[i]) != my_clz (ints[i]))
abort ();
if (ints[i] != 0
&& __builtin_ctz (ints[i]) != my_ctz (ints[i]))
abort ();
if (__builtin_clrsb (ints[i]) != my_clrsb (ints[i]))
abort ();
if (__builtin_popcount (ints[i]) != my_popcount (ints[i]))
abort ();
if (__builtin_parity (ints[i]) != my_parity (ints[i]))
abort ();
}
for (i = 0; i < N(longs); i++)
{
if (__builtin_ffsl (longs[i]) != my_ffsl (longs[i]))
abort ();
if (longs[i] != 0
&& __builtin_clzl (longs[i]) != my_clzl (longs[i]))
abort ();
if (longs[i] != 0
&& __builtin_ctzl (longs[i]) != my_ctzl (longs[i]))
abort ();
if (__builtin_clrsbl (longs[i]) != my_clrsbl (longs[i]))
abort ();
if (__builtin_popcountl (longs[i]) != my_popcountl (longs[i]))
abort ();
if (__builtin_parityl (longs[i]) != my_parityl (longs[i]))
abort ();
}
for (i = 0; i < N(longlongs); i++)
{
if (__builtin_ffsll (longlongs[i]) != my_ffsll (longlongs[i]))
abort ();
if (longlongs[i] != 0
&& __builtin_clzll (longlongs[i]) != my_clzll (longlongs[i]))
abort ();
if (longlongs[i] != 0
&& __builtin_ctzll (longlongs[i]) != my_ctzll (longlongs[i]))
abort ();
if (__builtin_clrsbll (longlongs[i]) != my_clrsbll (longlongs[i]))
abort ();
if (__builtin_popcountll (longlongs[i]) != my_popcountll (longlongs[i]))
abort ();
if (__builtin_parityll (longlongs[i]) != my_parityll (longlongs[i]))
abort ();
}
/* Test constant folding. */
#define TEST(x, suffix) \
if (__builtin_ffs##suffix (x) != my_ffs##suffix (x)) \
abort (); \
if (x != 0 && __builtin_clz##suffix (x) != my_clz##suffix (x)) \
abort (); \
if (x != 0 && __builtin_ctz##suffix (x) != my_ctz##suffix (x)) \
abort (); \
if (__builtin_clrsb##suffix (x) != my_clrsb##suffix (x)) \
abort (); \
if (__builtin_popcount##suffix (x) != my_popcount##suffix (x)) \
abort (); \
if (__builtin_parity##suffix (x) != my_parity##suffix (x)) \
abort ();
#if BITSIZEOF_INT == 32
TEST(0x00000000UL,);
TEST(0x00000001UL,);
TEST(0x80000000UL,);
TEST(0x40000000UL,);
TEST(0x00010000UL,);
TEST(0x00008000UL,);
TEST(0xa5a5a5a5UL,);
TEST(0x5a5a5a5aUL,);
TEST(0xcafe0000UL,);
TEST(0x00cafe00UL,);
TEST(0x0000cafeUL,);
TEST(0xffffffffUL,);
#endif
#if BITSIZEOF_LONG_LONG == 64
TEST(0x0000000000000000ULL, ll);
TEST(0x0000000000000001ULL, ll);
TEST(0x8000000000000000ULL, ll);
TEST(0x0000000000000002ULL, ll);
TEST(0x4000000000000000ULL, ll);
TEST(0x0000000100000000ULL, ll);
TEST(0x0000000080000000ULL, ll);
TEST(0xa5a5a5a5a5a5a5a5ULL, ll);
TEST(0x5a5a5a5a5a5a5a5aULL, ll);
TEST(0xcafecafe00000000ULL, ll);
TEST(0x0000cafecafe0000ULL, ll);
TEST(0x00000000cafecafeULL, ll);
TEST(0xffffffffffffffffULL, ll);
#endif
exit (0);
}
|
the_stack_data/120000.c | /**
******************************************************************************
* @file stm32g0xx_ll_lpuart.c
* @author MCD Application Team
* @brief LPUART LL module driver.
******************************************************************************
* @attention
*
* <h2><center>© Copyright (c) 2018 STMicroelectronics.
* All rights reserved.</center></h2>
*
* This software component is licensed by ST under BSD 3-Clause license,
* the "License"; You may not use this file except in compliance with the
* License. You may obtain a copy of the License at:
* opensource.org/licenses/BSD-3-Clause
*
******************************************************************************
*/
#if defined(USE_FULL_LL_DRIVER)
/* Includes ------------------------------------------------------------------*/
#include "stm32g0xx_ll_lpuart.h"
#include "stm32g0xx_ll_rcc.h"
#include "stm32g0xx_ll_bus.h"
#ifdef USE_FULL_ASSERT
#include "stm32_assert.h"
#else
#define assert_param(expr) ((void)0U)
#endif /* USE_FULL_ASSERT */
/** @addtogroup STM32G0xx_LL_Driver
* @{
*/
#if defined (LPUART1) || defined (LPUART2)
/** @addtogroup LPUART_LL
* @{
*/
/* Private types -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
/* Private constants ---------------------------------------------------------*/
/** @addtogroup LPUART_LL_Private_Constants
* @{
*/
/**
* @}
*/
/* Private macros ------------------------------------------------------------*/
/** @addtogroup LPUART_LL_Private_Macros
* @{
*/
/* Check of parameters for configuration of LPUART registers */
#define IS_LL_LPUART_PRESCALER(__VALUE__) (((__VALUE__) == LL_LPUART_PRESCALER_DIV1) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV2) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV4) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV6) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV8) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV10) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV12) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV16) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV32) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV64) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV128) \
|| ((__VALUE__) == LL_LPUART_PRESCALER_DIV256))
/* __BAUDRATE__ Depending on constraints applicable for LPUART BRR register */
/* value : */
/* - fck must be in the range [3 x baudrate, 4096 x baudrate] */
/* - LPUART_BRR register value should be >= 0x300 */
/* - LPUART_BRR register value should be <= 0xFFFFF (20 bits) */
/* Baudrate specified by the user should belong to [8, 21300000].*/
#define IS_LL_LPUART_BAUDRATE(__BAUDRATE__) (((__BAUDRATE__) <= 21300000U) && ((__BAUDRATE__) >= 8U))
/* __VALUE__ BRR content must be greater than or equal to 0x300. */
#define IS_LL_LPUART_BRR_MIN(__VALUE__) ((__VALUE__) >= 0x300U)
/* __VALUE__ BRR content must be lower than or equal to 0xFFFFF. */
#define IS_LL_LPUART_BRR_MAX(__VALUE__) ((__VALUE__) <= 0x000FFFFFU)
#define IS_LL_LPUART_DIRECTION(__VALUE__) (((__VALUE__) == LL_LPUART_DIRECTION_NONE) \
|| ((__VALUE__) == LL_LPUART_DIRECTION_RX) \
|| ((__VALUE__) == LL_LPUART_DIRECTION_TX) \
|| ((__VALUE__) == LL_LPUART_DIRECTION_TX_RX))
#define IS_LL_LPUART_PARITY(__VALUE__) (((__VALUE__) == LL_LPUART_PARITY_NONE) \
|| ((__VALUE__) == LL_LPUART_PARITY_EVEN) \
|| ((__VALUE__) == LL_LPUART_PARITY_ODD))
#define IS_LL_LPUART_DATAWIDTH(__VALUE__) (((__VALUE__) == LL_LPUART_DATAWIDTH_7B) \
|| ((__VALUE__) == LL_LPUART_DATAWIDTH_8B) \
|| ((__VALUE__) == LL_LPUART_DATAWIDTH_9B))
#define IS_LL_LPUART_STOPBITS(__VALUE__) (((__VALUE__) == LL_LPUART_STOPBITS_1) \
|| ((__VALUE__) == LL_LPUART_STOPBITS_2))
#define IS_LL_LPUART_HWCONTROL(__VALUE__) (((__VALUE__) == LL_LPUART_HWCONTROL_NONE) \
|| ((__VALUE__) == LL_LPUART_HWCONTROL_RTS) \
|| ((__VALUE__) == LL_LPUART_HWCONTROL_CTS) \
|| ((__VALUE__) == LL_LPUART_HWCONTROL_RTS_CTS))
/**
* @}
*/
/* Private function prototypes -----------------------------------------------*/
/* Exported functions --------------------------------------------------------*/
/** @addtogroup LPUART_LL_Exported_Functions
* @{
*/
/** @addtogroup LPUART_LL_EF_Init
* @{
*/
/**
* @brief De-initialize LPUART registers (Registers restored to their default values).
* @param LPUARTx LPUART Instance
* @retval An ErrorStatus enumeration value:
* - SUCCESS: LPUART registers are de-initialized
* - ERROR: not applicable
*/
ErrorStatus LL_LPUART_DeInit(USART_TypeDef *LPUARTx)
{
ErrorStatus status = SUCCESS;
/* Check the parameters */
assert_param(IS_LPUART_INSTANCE(LPUARTx));
if (LPUARTx == LPUART1)
{
/* Force reset of LPUART peripheral */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_LPUART1);
/* Release reset of LPUART peripheral */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_LPUART1);
}
#if defined(LPUART2)
else if (LPUARTx == LPUART2)
{
/* Force reset of LPUART peripheral */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_LPUART2);
/* Release reset of LPUART peripheral */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_LPUART2);
}
#endif
else
{
status = ERROR;
}
return (status);
}
/**
* @brief Initialize LPUART registers according to the specified
* parameters in LPUART_InitStruct.
* @note As some bits in LPUART configuration registers can only be written when
* the LPUART is disabled (USART_CR1_UE bit =0),
* LPUART Peripheral should be in disabled state prior calling this function.
* Otherwise, ERROR result will be returned.
* @note Baud rate value stored in LPUART_InitStruct BaudRate field, should be valid (different from 0).
* @param LPUARTx LPUART Instance
* @param LPUART_InitStruct pointer to a @ref LL_LPUART_InitTypeDef structure
* that contains the configuration information for the specified LPUART peripheral.
* @retval An ErrorStatus enumeration value:
* - SUCCESS: LPUART registers are initialized according to LPUART_InitStruct content
* - ERROR: Problem occurred during LPUART Registers initialization
*/
ErrorStatus LL_LPUART_Init(USART_TypeDef *LPUARTx, LL_LPUART_InitTypeDef *LPUART_InitStruct)
{
ErrorStatus status = ERROR;
#if defined(LPUART2)
uint32_t periphclk = LL_RCC_PERIPH_FREQUENCY_NO;
#else
uint32_t periphclk;
#endif
/* Check the parameters */
assert_param(IS_LPUART_INSTANCE(LPUARTx));
assert_param(IS_LL_LPUART_PRESCALER(LPUART_InitStruct->PrescalerValue));
assert_param(IS_LL_LPUART_BAUDRATE(LPUART_InitStruct->BaudRate));
assert_param(IS_LL_LPUART_DATAWIDTH(LPUART_InitStruct->DataWidth));
assert_param(IS_LL_LPUART_STOPBITS(LPUART_InitStruct->StopBits));
assert_param(IS_LL_LPUART_PARITY(LPUART_InitStruct->Parity));
assert_param(IS_LL_LPUART_DIRECTION(LPUART_InitStruct->TransferDirection));
assert_param(IS_LL_LPUART_HWCONTROL(LPUART_InitStruct->HardwareFlowControl));
/* LPUART needs to be in disabled state, in order to be able to configure some bits in
CRx registers. Otherwise (LPUART not in Disabled state) => return ERROR */
if (LL_LPUART_IsEnabled(LPUARTx) == 0U)
{
/*---------------------------- LPUART CR1 Configuration -----------------------
* Configure LPUARTx CR1 (LPUART Word Length, Parity and Transfer Direction bits) with parameters:
* - DataWidth: USART_CR1_M bits according to LPUART_InitStruct->DataWidth value
* - Parity: USART_CR1_PCE, USART_CR1_PS bits according to LPUART_InitStruct->Parity value
* - TransferDirection: USART_CR1_TE, USART_CR1_RE bits according to LPUART_InitStruct->TransferDirection value
*/
MODIFY_REG(LPUARTx->CR1,
(USART_CR1_M | USART_CR1_PCE | USART_CR1_PS | USART_CR1_TE | USART_CR1_RE),
(LPUART_InitStruct->DataWidth | LPUART_InitStruct->Parity | LPUART_InitStruct->TransferDirection));
/*---------------------------- LPUART CR2 Configuration -----------------------
* Configure LPUARTx CR2 (Stop bits) with parameters:
* - Stop Bits: USART_CR2_STOP bits according to LPUART_InitStruct->StopBits value.
*/
LL_LPUART_SetStopBitsLength(LPUARTx, LPUART_InitStruct->StopBits);
/*---------------------------- LPUART CR3 Configuration -----------------------
* Configure LPUARTx CR3 (Hardware Flow Control) with parameters:
* - HardwareFlowControl: USART_CR3_RTSE, USART_CR3_CTSE bits according
* to LPUART_InitStruct->HardwareFlowControl value.
*/
LL_LPUART_SetHWFlowCtrl(LPUARTx, LPUART_InitStruct->HardwareFlowControl);
/*---------------------------- LPUART BRR Configuration -----------------------
* Retrieve Clock frequency used for LPUART Peripheral
*/
#if defined(LPUART2)
if (LPUARTx == LPUART1)
{
periphclk = LL_RCC_GetLPUARTClockFreq(LL_RCC_LPUART1_CLKSOURCE);
}
else if (LPUARTx == LPUART2)
{
periphclk = LL_RCC_GetLPUARTClockFreq(LL_RCC_LPUART2_CLKSOURCE);
}
else
{
/* Nothing to do, as error code is already assigned to ERROR value */
}
#else
periphclk = LL_RCC_GetLPUARTClockFreq(LL_RCC_LPUART1_CLKSOURCE);
#endif
/* Configure the LPUART Baud Rate :
- prescaler value is required
- valid baud rate value (different from 0) is required
- Peripheral clock as returned by RCC service, should be valid (different from 0).
*/
if ((periphclk != LL_RCC_PERIPH_FREQUENCY_NO)
&& (LPUART_InitStruct->BaudRate != 0U))
{
status = SUCCESS;
LL_LPUART_SetBaudRate(LPUARTx,
periphclk,
LPUART_InitStruct->PrescalerValue,
LPUART_InitStruct->BaudRate);
/* Check BRR is greater than or equal to 0x300 */
assert_param(IS_LL_LPUART_BRR_MIN(LPUARTx->BRR));
/* Check BRR is lower than or equal to 0xFFFFF */
assert_param(IS_LL_LPUART_BRR_MAX(LPUARTx->BRR));
}
/*---------------------------- LPUART PRESC Configuration -----------------------
* Configure LPUARTx PRESC (Prescaler) with parameters:
* - PrescalerValue: LPUART_PRESC_PRESCALER bits according to LPUART_InitStruct->PrescalerValue value.
*/
LL_LPUART_SetPrescaler(LPUARTx, LPUART_InitStruct->PrescalerValue);
}
return (status);
}
/**
* @brief Set each @ref LL_LPUART_InitTypeDef field to default value.
* @param LPUART_InitStruct pointer to a @ref LL_LPUART_InitTypeDef structure
* whose fields will be set to default values.
* @retval None
*/
void LL_LPUART_StructInit(LL_LPUART_InitTypeDef *LPUART_InitStruct)
{
/* Set LPUART_InitStruct fields to default values */
LPUART_InitStruct->PrescalerValue = LL_LPUART_PRESCALER_DIV1;
LPUART_InitStruct->BaudRate = 9600U;
LPUART_InitStruct->DataWidth = LL_LPUART_DATAWIDTH_8B;
LPUART_InitStruct->StopBits = LL_LPUART_STOPBITS_1;
LPUART_InitStruct->Parity = LL_LPUART_PARITY_NONE ;
LPUART_InitStruct->TransferDirection = LL_LPUART_DIRECTION_TX_RX;
LPUART_InitStruct->HardwareFlowControl = LL_LPUART_HWCONTROL_NONE;
}
/**
* @}
*/
/**
* @}
*/
/**
* @}
*/
#endif /* LPUART1 || LPUART2 */
/**
* @}
*/
#endif /* USE_FULL_LL_DRIVER */
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
|
the_stack_data/82951147.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int argc, char *argv[]){
short uid;
uid = atoi(argv[1]);
printf("%d\n",uid);
if (uid == 0){
printf("You are admin!\n");
}else{
printf("You are a user!\n");
}
}
|
the_stack_data/165765998.c | /*
* This file is part of the OpenMV project.
*
* Copyright (c) 2013-2021 Ibrahim Abdelkader <[email protected]>
* Copyright (c) 2013-2021 Kwabena W. Agyeman <[email protected]>
*
* This work is licensed under the MIT license, see the file LICENSE for details.
*
* This file contains image sensor driver utility functions and some default (weak)
* implementations of common functions that can be replaced by port-specific drivers.
*/
#if MICROPY_PY_SENSOR
#include <string.h>
#include <stdint.h>
#include <stdbool.h>
#include "py/mphal.h"
#include "cambus.h"
#include "sensor.h"
#include "ov2640.h"
#include "ov5640.h"
#include "ov7725.h"
#include "ov7670.h"
#include "ov7690.h"
#include "ov9650.h"
#include "mt9v034.h"
#include "mt9m114.h"
#include "lepton.h"
#include "hm01b0.h"
#include "paj6100.h"
#include "gc2145.h"
#include "framebuffer.h"
#include "omv_boardconfig.h"
#if (OMV_ENABLE_PAJ6100 == 1)
#define OMV_ENABLE_NONI2CIS
#endif
#ifndef __weak
#define __weak __attribute__((weak))
#endif
// Sensor frame size/resolution table.
const int resolution[][2] = {
{0, 0 },
// C/SIF Resolutions
{88, 72 }, /* QQCIF */
{176, 144 }, /* QCIF */
{352, 288 }, /* CIF */
{88, 60 }, /* QQSIF */
{176, 120 }, /* QSIF */
{352, 240 }, /* SIF */
// VGA Resolutions
{40, 30 }, /* QQQQVGA */
{80, 60 }, /* QQQVGA */
{160, 120 }, /* QQVGA */
{320, 240 }, /* QVGA */
{640, 480 }, /* VGA */
{30, 20 }, /* HQQQQVGA */
{60, 40 }, /* HQQQVGA */
{120, 80 }, /* HQQVGA */
{240, 160 }, /* HQVGA */
{480, 320 }, /* HVGA */
// FFT Resolutions
{64, 32 }, /* 64x32 */
{64, 64 }, /* 64x64 */
{128, 64 }, /* 128x64 */
{128, 128 }, /* 128x128 */
// Himax Resolutions
{160, 160 }, /* 160x160 */
{320, 320 }, /* 320x320 */
// Other
{128, 160 }, /* LCD */
{128, 160 }, /* QQVGA2 */
{720, 480 }, /* WVGA */
{752, 480 }, /* WVGA2 */
{800, 600 }, /* SVGA */
{1024, 768 }, /* XGA */
{1280, 768 }, /* WXGA */
{1280, 1024}, /* SXGA */
{1280, 960 }, /* SXGAM */
{1600, 1200}, /* UXGA */
{1280, 720 }, /* HD */
{1920, 1080}, /* FHD */
{2560, 1440}, /* QHD */
{2048, 1536}, /* QXGA */
{2560, 1600}, /* WQXGA */
{2592, 1944}, /* WQXGA2 */
};
__weak void sensor_init0()
{
// Reset the sesnor state
memset(&sensor, 0, sizeof(sensor_t));
}
__weak int sensor_init()
{
// Reset the sesnor state
memset(&sensor, 0, sizeof(sensor_t));
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
__weak int sensor_abort()
{
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
__weak int sensor_reset()
{
// Disable any ongoing frame capture.
sensor_abort();
// Reset the sensor state
sensor.sde = 0;
sensor.pixformat = 0;
sensor.framesize = 0;
sensor.framerate = 0;
sensor.last_frame_ms = 0;
sensor.last_frame_ms_valid = false;
sensor.gainceiling = 0;
sensor.hmirror = false;
sensor.vflip = false;
sensor.transpose = false;
#if MICROPY_PY_IMU
sensor.auto_rotation = (sensor.chip_id == OV7690_ID);
#else
sensor.auto_rotation = false;
#endif // MICROPY_PY_IMU
sensor.vsync_callback = NULL;
sensor.frame_callback = NULL;
// Reset default color palette.
sensor.color_palette = rainbow_table;
sensor.disable_full_flush = false;
// Restore shutdown state on reset.
sensor_shutdown(false);
// Disable the bus before reset.
cambus_enable(&sensor.bus, false);
// Hard-reset the sensor
if (sensor.reset_pol == ACTIVE_HIGH) {
DCMI_RESET_HIGH();
mp_hal_delay_ms(10);
DCMI_RESET_LOW();
} else {
DCMI_RESET_LOW();
mp_hal_delay_ms(10);
DCMI_RESET_HIGH();
}
mp_hal_delay_ms(20);
// Re-enable the bus.
cambus_enable(&sensor.bus, true);
// Check if the control is supported.
if (sensor.reset == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call sensor-specific reset function
if (sensor.reset(&sensor) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
// Reset framebuffers
framebuffer_reset_buffers();
return 0;
}
int sensor_probe_init(uint32_t bus_id, uint32_t bus_speed)
{
int init_ret = 0;
// Do a power cycle
DCMI_PWDN_HIGH();
mp_hal_delay_ms(10);
DCMI_PWDN_LOW();
mp_hal_delay_ms(10);
/* Some sensors have different reset polarities, and we can't know which sensor
is connected before initializing cambus and probing the sensor, which in turn
requires pulling the sensor out of the reset state. So we try to probe the
sensor with both polarities to determine line state. */
sensor.pwdn_pol = ACTIVE_HIGH;
sensor.reset_pol = ACTIVE_HIGH;
// Reset the sensor
DCMI_RESET_HIGH();
mp_hal_delay_ms(10);
DCMI_RESET_LOW();
mp_hal_delay_ms(10);
// Initialize the camera bus.
cambus_init(&sensor.bus, bus_id, bus_speed);
mp_hal_delay_ms(10);
// Probe the sensor
sensor.slv_addr = cambus_scan(&sensor.bus);
if (sensor.slv_addr == 0) {
/* Sensor has been held in reset,
so the reset line is active low */
sensor.reset_pol = ACTIVE_LOW;
// Pull the sensor out of the reset state.
DCMI_RESET_HIGH();
mp_hal_delay_ms(10);
// Probe again to set the slave addr.
sensor.slv_addr = cambus_scan(&sensor.bus);
if (sensor.slv_addr == 0) {
sensor.pwdn_pol = ACTIVE_LOW;
DCMI_PWDN_HIGH();
mp_hal_delay_ms(10);
sensor.slv_addr = cambus_scan(&sensor.bus);
if (sensor.slv_addr == 0) {
sensor.reset_pol = ACTIVE_HIGH;
DCMI_RESET_LOW();
mp_hal_delay_ms(10);
sensor.slv_addr = cambus_scan(&sensor.bus);
#ifndef OMV_ENABLE_NONI2CIS
if (sensor.slv_addr == 0) {
return SENSOR_ERROR_ISC_UNDETECTED;
}
#endif
}
}
}
switch (sensor.slv_addr) {
#if (OMV_ENABLE_OV2640 == 1)
case OV2640_SLV_ADDR: // Or OV9650.
cambus_readb(&sensor.bus, sensor.slv_addr, OV_CHIP_ID, &sensor.chip_id);
break;
#endif // (OMV_ENABLE_OV2640 == 1)
#if (OMV_ENABLE_OV5640 == 1)
case OV5640_SLV_ADDR:
cambus_readb2(&sensor.bus, sensor.slv_addr, OV5640_CHIP_ID, &sensor.chip_id);
break;
#endif // (OMV_ENABLE_OV5640 == 1)
#if (OMV_ENABLE_OV7725 == 1) || (OMV_ENABLE_OV7670 == 1) || (OMV_ENABLE_OV7690 == 1)
case OV7725_SLV_ADDR: // Or OV7690 or OV7670.
cambus_readb(&sensor.bus, sensor.slv_addr, OV_CHIP_ID, &sensor.chip_id);
break;
#endif //(OMV_ENABLE_OV7725 == 1) || (OMV_ENABLE_OV7670 == 1) || (OMV_ENABLE_OV7690 == 1)
#if (OMV_ENABLE_MT9V034 == 1)
case MT9V034_SLV_ADDR:
cambus_readb(&sensor.bus, sensor.slv_addr, ON_CHIP_ID, &sensor.chip_id);
break;
#endif //(OMV_ENABLE_MT9V034 == 1)
#if (OMV_ENABLE_MT9M114 == 1)
case MT9M114_SLV_ADDR:
cambus_readw2(&sensor.bus, sensor.slv_addr, ON_CHIP_ID, &sensor.chip_id_w);
break;
#endif // (OMV_ENABLE_MT9M114 == 1)
#if (OMV_ENABLE_LEPTON == 1)
case LEPTON_SLV_ADDR:
sensor.chip_id = LEPTON_ID;
break;
#endif // (OMV_ENABLE_LEPTON == 1)
#if (OMV_ENABLE_HM01B0 == 1)
case HM01B0_SLV_ADDR:
cambus_readb2(&sensor.bus, sensor.slv_addr, HIMAX_CHIP_ID, &sensor.chip_id);
break;
#endif //(OMV_ENABLE_HM01B0 == 1)
#if (OMV_ENABLE_GC2145 == 1)
case GC2145_SLV_ADDR:
cambus_readb(&sensor.bus, sensor.slv_addr, GC_CHIP_ID, &sensor.chip_id);
break;
#endif //(OMV_ENABLE_GC2145 == 1)
#if (OMV_ENABLE_PAJ6100 == 1)
case 0:
if (paj6100_detect(&sensor)) {
// Found PixArt PAJ6100
sensor.chip_id_w = PAJ6100_ID;
sensor.pwdn_pol = ACTIVE_LOW;
sensor.reset_pol = ACTIVE_LOW;
break;
}
return SENSOR_ERROR_ISC_UNDETECTED;
#endif
default:
return SENSOR_ERROR_ISC_UNSUPPORTED;
break;
}
switch (sensor.chip_id_w) {
#if (OMV_ENABLE_OV2640 == 1)
case OV2640_ID:
if (sensor_set_xclk_frequency(OV2640_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = ov2640_init(&sensor);
break;
#endif // (OMV_ENABLE_OV2640 == 1)
#if (OMV_ENABLE_OV5640 == 1)
case OV5640_ID:
if (sensor_set_xclk_frequency(OV5640_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = ov5640_init(&sensor);
break;
#endif // (OMV_ENABLE_OV5640 == 1)
#if (OMV_ENABLE_OV7670 == 1)
case OV7670_ID:
if (sensor_set_xclk_frequency(OV7670_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = ov7670_init(&sensor);
break;
#endif // (OMV_ENABLE_OV7670 == 1)
#if (OMV_ENABLE_OV7690 == 1)
case OV7690_ID:
if (sensor_set_xclk_frequency(OV7690_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = ov7690_init(&sensor);
break;
#endif // (OMV_ENABLE_OV7690 == 1)
#if (OMV_ENABLE_OV7725 == 1)
case OV7725_ID:
init_ret = ov7725_init(&sensor);
break;
#endif // (OMV_ENABLE_OV7725 == 1)
#if (OMV_ENABLE_OV9650 == 1)
case OV9650_ID:
init_ret = ov9650_init(&sensor);
break;
#endif // (OMV_ENABLE_OV9650 == 1)
#if (OMV_ENABLE_MT9V034 == 1)
case MT9V034_ID:
if (sensor_set_xclk_frequency(MT9V034_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = mt9v034_init(&sensor);
break;
#endif //(OMV_ENABLE_MT9V034 == 1)
#if (OMV_ENABLE_MT9M114 == 1)
case MT9M114_ID:
if (sensor_set_xclk_frequency(MT9M114_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = mt9m114_init(&sensor);
break;
#endif //(OMV_ENABLE_MT9M114 == 1)
#if (OMV_ENABLE_LEPTON == 1)
case LEPTON_ID:
if (sensor_set_xclk_frequency(LEPTON_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = lepton_init(&sensor);
break;
#endif // (OMV_ENABLE_LEPTON == 1)
#if (OMV_ENABLE_HM01B0 == 1)
case HM01B0_ID:
init_ret = hm01b0_init(&sensor);
break;
#endif //(OMV_ENABLE_HM01B0 == 1)
#if (OMV_ENABLE_GC2145 == 1)
case GC2145_ID:
if (sensor_set_xclk_frequency(GC2145_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = gc2145_init(&sensor);
break;
#endif //(OMV_ENABLE_GC2145 == 1)
#if (OMV_ENABLE_PAJ6100 == 1)
case PAJ6100_ID:
if (sensor_set_xclk_frequency(PAJ6100_XCLK_FREQ) != 0) {
return SENSOR_ERROR_TIM_INIT_FAILED;
}
init_ret = paj6100_init(&sensor);
break;
#endif // (OMV_ENABLE_PAJ6100 == 1)
default:
return SENSOR_ERROR_ISC_UNSUPPORTED;
break;
}
if (init_ret != 0 ) {
// Sensor init failed.
return SENSOR_ERROR_ISC_INIT_FAILED;
}
return 0;
}
__weak int sensor_get_id()
{
return sensor.chip_id_w;
}
__weak uint32_t sensor_get_xclk_frequency()
{
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
__weak int sensor_set_xclk_frequency(uint32_t frequency)
{
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
__weak bool sensor_is_detected()
{
return sensor.detected;
}
__weak int sensor_sleep(int enable)
{
// Disable any ongoing frame capture.
sensor_abort();
// Check if the control is supported.
if (sensor.sleep == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.sleep(&sensor, enable) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_shutdown(int enable)
{
int ret = 0;
// Disable any ongoing frame capture.
sensor_abort();
if (enable) {
if (sensor.pwdn_pol == ACTIVE_HIGH) {
DCMI_PWDN_HIGH();
} else {
DCMI_PWDN_LOW();
}
} else {
if (sensor.pwdn_pol == ACTIVE_HIGH) {
DCMI_PWDN_LOW();
} else {
DCMI_PWDN_HIGH();
}
}
mp_hal_delay_ms(10);
return ret;
}
__weak int sensor_read_reg(uint16_t reg_addr)
{
int ret;
// Check if the control is supported.
if (sensor.read_reg == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if ((ret = sensor.read_reg(&sensor, reg_addr)) == -1) {
return SENSOR_ERROR_IO_ERROR;
}
return ret;
}
__weak int sensor_write_reg(uint16_t reg_addr, uint16_t reg_data)
{
// Check if the control is supported.
if (sensor.write_reg == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.write_reg(&sensor, reg_addr, reg_data) == -1) {
return SENSOR_ERROR_IO_ERROR;
}
return 0;
}
__weak int sensor_set_pixformat(pixformat_t pixformat)
{
// Check if the value has changed.
if (sensor.pixformat == pixformat) {
return 0;
}
// Some sensor drivers automatically switch to BAYER to reduce the frame size if it does not fit in RAM.
// If the current format is BAYER (1BPP), and the target format is RGB-565 (2BPP) and the frame does not
// fit in RAM it will just be switched back again to BAYER, so we keep the current format unchanged.
uint32_t size = framebuffer_get_buffer_size();
if ((sensor.pixformat == PIXFORMAT_BAYER)
&& (pixformat == PIXFORMAT_RGB565)
&& (MAIN_FB()->u * MAIN_FB()->v * 2 > size)
&& (MAIN_FB()->u * MAIN_FB()->v * 1 <= size)) {
return 0;
}
// Cropping and transposing (and thus auto rotation) don't work in JPEG mode.
if ((pixformat == PIXFORMAT_JPEG)
&& (sensor_get_cropped() || sensor.transpose || sensor.auto_rotation)) {
return SENSOR_ERROR_PIXFORMAT_UNSUPPORTED;
}
// Disable any ongoing frame capture.
sensor_abort();
// Flush previous frame.
framebuffer_update_jpeg_buffer();
// Check if the control is supported.
if (sensor.set_pixformat == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_pixformat(&sensor, pixformat) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
mp_hal_delay_ms(100); // wait for the camera to settle
// Set pixel format
sensor.pixformat = pixformat;
// Skip the first frame.
MAIN_FB()->bpp = -1;
// Pickout a good buffer count for the user.
framebuffer_auto_adjust_buffers();
// Reconfigure the DCMI if needed.
return sensor_dcmi_config(pixformat);
}
__weak int sensor_set_framesize(framesize_t framesize)
{
if (sensor.framesize == framesize) {
// No change
return 0;
}
// Disable any ongoing frame capture.
sensor_abort();
// Flush previous frame.
framebuffer_update_jpeg_buffer();
// Call the sensor specific function
if (sensor.set_framesize == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
if (sensor.set_framesize(&sensor, framesize) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
mp_hal_delay_ms(100); // wait for the camera to settle
// Set framebuffer size
sensor.framesize = framesize;
// Skip the first frame.
MAIN_FB()->bpp = -1;
// Set MAIN FB x offset, y offset, width, height, backup width, and backup height.
MAIN_FB()->x = 0;
MAIN_FB()->y = 0;
MAIN_FB()->w = MAIN_FB()->u = resolution[framesize][0];
MAIN_FB()->h = MAIN_FB()->v = resolution[framesize][1];
// Pickout a good buffer count for the user.
framebuffer_auto_adjust_buffers();
return 0;
}
__weak int sensor_set_framerate(int framerate)
{
if (sensor.framerate == framerate) {
// No change
return 0;
}
if (framerate < 0) {
return SENSOR_ERROR_INVALID_ARGUMENT;
}
// Call the sensor specific function (does not fail if function is not set)
if (sensor.set_framerate != NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
if (sensor.set_framerate(&sensor, framerate) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
// Set framerate
sensor.framerate = framerate;
return 0;
}
__weak bool sensor_get_cropped()
{
if (sensor.framesize != FRAMESIZE_INVALID) {
return (MAIN_FB()->x != 0) // should be zero if not cropped.
|| (MAIN_FB()->y != 0) // should be zero if not cropped.
|| (MAIN_FB()->u != resolution[sensor.framesize][0]) // should be equal to the resolution if not cropped.
|| (MAIN_FB()->v != resolution[sensor.framesize][1]); // should be equal to the resolution if not cropped.
}
return false;
}
__weak uint32_t sensor_get_src_bpp()
{
switch (sensor.pixformat) {
case PIXFORMAT_GRAYSCALE:
return sensor.gs_bpp;
case PIXFORMAT_RGB565:
case PIXFORMAT_YUV422:
return 2;
case PIXFORMAT_BAYER:
case PIXFORMAT_JPEG:
return 1;
default:
return 0;
}
}
__weak uint32_t sensor_get_dst_bpp()
{
switch (sensor.pixformat) {
case PIXFORMAT_GRAYSCALE:
case PIXFORMAT_BAYER:
return 1;
case PIXFORMAT_RGB565:
case PIXFORMAT_YUV422:
return 2;
default:
return 0;
}
}
__weak int sensor_set_windowing(int x, int y, int w, int h)
{
// Check if the value has changed.
if ((MAIN_FB()->x == x) && (MAIN_FB()->y == y) &&
(MAIN_FB()->u == w) && (MAIN_FB()->v == h)) {
return 0;
}
if (sensor.pixformat == PIXFORMAT_JPEG) {
return SENSOR_ERROR_PIXFORMAT_UNSUPPORTED;
}
// Disable any ongoing frame capture.
sensor_abort();
// Flush previous frame.
framebuffer_update_jpeg_buffer();
// Skip the first frame.
MAIN_FB()->bpp = -1;
MAIN_FB()->x = x;
MAIN_FB()->y = y;
MAIN_FB()->w = MAIN_FB()->u = w;
MAIN_FB()->h = MAIN_FB()->v = h;
// Pickout a good buffer count for the user.
framebuffer_auto_adjust_buffers();
return 0;
}
__weak int sensor_set_contrast(int level)
{
// Check if the control is supported.
if (sensor.set_contrast == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_contrast(&sensor, level) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_brightness(int level)
{
// Check if the control is supported.
if (sensor.set_brightness == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_brightness(&sensor, level) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_saturation(int level)
{
// Check if the control is supported.
if (sensor.set_saturation == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_saturation(&sensor, level) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_gainceiling(gainceiling_t gainceiling)
{
// Check if the value has changed.
if (sensor.gainceiling == gainceiling) {
return 0;
}
// Check if the control is supported.
if (sensor.set_gainceiling == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_gainceiling(&sensor, gainceiling) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
// Set the new control value.
sensor.gainceiling = gainceiling;
return 0;
}
__weak int sensor_set_quality(int qs)
{
// Check if the control is supported.
if (sensor.set_quality == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_quality(&sensor, qs) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_colorbar(int enable)
{
// Check if the control is supported.
if (sensor.set_colorbar == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_colorbar(&sensor, enable) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_auto_gain(int enable, float gain_db, float gain_db_ceiling)
{
// Check if the control is supported.
if (sensor.set_auto_gain == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_auto_gain(&sensor, enable, gain_db, gain_db_ceiling) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_get_gain_db(float *gain_db)
{
// Check if the control is supported.
if (sensor.get_gain_db == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.get_gain_db(&sensor, gain_db) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_auto_exposure(int enable, int exposure_us)
{
// Check if the control is supported.
if (sensor.set_auto_exposure == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_auto_exposure(&sensor, enable, exposure_us) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_get_exposure_us(int *exposure_us)
{
// Check if the control is supported.
if (sensor.get_exposure_us == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.get_exposure_us(&sensor, exposure_us) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_auto_whitebal(int enable, float r_gain_db, float g_gain_db, float b_gain_db)
{
// Check if the control is supported.
if (sensor.set_auto_whitebal == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_auto_whitebal(&sensor, enable, r_gain_db, g_gain_db, b_gain_db) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_get_rgb_gain_db(float *r_gain_db, float *g_gain_db, float *b_gain_db)
{
// Check if the control is supported.
if (sensor.get_rgb_gain_db == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.get_rgb_gain_db(&sensor, r_gain_db, g_gain_db, b_gain_db) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_set_hmirror(int enable)
{
// Check if the value has changed.
if (sensor.hmirror == ((bool) enable)) {
return 0;
}
// Disable any ongoing frame capture.
sensor_abort();
// Check if the control is supported.
if (sensor.set_hmirror == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_hmirror(&sensor, enable) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
// Set the new control value.
sensor.hmirror = enable;
// Wait for the camera to settle
mp_hal_delay_ms(100);
return 0;
}
__weak bool sensor_get_hmirror()
{
return sensor.hmirror;
}
__weak int sensor_set_vflip(int enable)
{
// Check if the value has changed.
if (sensor.vflip == ((bool) enable)) {
return 0;
}
// Disable any ongoing frame capture.
sensor_abort();
// Check if the control is supported.
if (sensor.set_vflip == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_vflip(&sensor, enable) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
// Set the new control value.
sensor.vflip = enable;
// Wait for the camera to settle
mp_hal_delay_ms(100);
return 0;
}
__weak bool sensor_get_vflip()
{
return sensor.vflip;
}
__weak int sensor_set_transpose(bool enable)
{
// Check if the value has changed.
if (sensor.transpose == enable) {
return 0;
}
// Disable any ongoing frame capture.
sensor_abort();
if (sensor.pixformat == PIXFORMAT_JPEG) {
return SENSOR_ERROR_PIXFORMAT_UNSUPPORTED;
}
// Set the new control value.
sensor.transpose = enable;
return 0;
}
__weak bool sensor_get_transpose()
{
return sensor.transpose;
}
__weak int sensor_set_auto_rotation(bool enable)
{
// Check if the value has changed.
if (sensor.auto_rotation == enable) {
return 0;
}
// Disable any ongoing frame capture.
sensor_abort();
// Operation not supported on JPEG images.
if (sensor.pixformat == PIXFORMAT_JPEG) {
return SENSOR_ERROR_PIXFORMAT_UNSUPPORTED;
}
// Set the new control value.
sensor.auto_rotation = enable;
return 0;
}
__weak bool sensor_get_auto_rotation()
{
return sensor.auto_rotation;
}
__weak int sensor_set_framebuffers(int count)
{
// Disable any ongoing frame capture.
sensor_abort();
// Flush previous frame.
framebuffer_update_jpeg_buffer();
return framebuffer_set_buffers(count);
}
__weak int sensor_set_special_effect(sde_t sde)
{
// Check if the value has changed.
if (sensor.sde == sde) {
return 0;
}
// Check if the control is supported.
if (sensor.set_special_effect == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_special_effect(&sensor, sde) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
// Set the new control value.
sensor.sde = sde;
return 0;
}
__weak int sensor_set_lens_correction(int enable, int radi, int coef)
{
// Check if the control is supported.
if (sensor.set_lens_correction == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
// Call the sensor specific function.
if (sensor.set_lens_correction(&sensor, enable, radi, coef) != 0) {
return SENSOR_ERROR_CTL_FAILED;
}
return 0;
}
__weak int sensor_ioctl(int request, ... /* arg */)
{
// Disable any ongoing frame capture.
sensor_abort();
// Check if the control is supported.
if (sensor.ioctl == NULL) {
return SENSOR_ERROR_CTL_UNSUPPORTED;
}
va_list ap;
va_start(ap, request);
// Call the sensor specific function.
int ret = sensor.ioctl(&sensor, request, ap);
va_end(ap);
return ((ret != 0) ? SENSOR_ERROR_CTL_FAILED : 0);
}
__weak int sensor_set_vsync_callback(vsync_cb_t vsync_cb)
{
sensor.vsync_callback = vsync_cb;
return 0;
}
__weak int sensor_set_frame_callback(frame_cb_t vsync_cb)
{
sensor.frame_callback = vsync_cb;
return 0;
}
__weak int sensor_set_color_palette(const uint16_t *color_palette)
{
sensor.color_palette = color_palette;
return 0;
}
__weak const uint16_t *sensor_get_color_palette()
{
return sensor.color_palette;
}
__weak int sensor_check_framebuffer_size()
{
uint32_t bpp = sensor_get_dst_bpp();
uint32_t size = framebuffer_get_buffer_size();
return (((MAIN_FB()->u * MAIN_FB()->v * bpp) <= size) ? 0 : -1);
}
__weak int sensor_auto_crop_framebuffer()
{
uint32_t bpp = sensor_get_dst_bpp();
uint32_t size = framebuffer_get_buffer_size();
// If the pixformat is NULL/JPEG there we can't do anything to check if it fits before hand.
if (!bpp) {
return 0;
}
// MAIN_FB() fits, we are done.
if ((MAIN_FB()->u * MAIN_FB()->v * bpp) <= size) {
return 0;
}
if (sensor.pixformat == PIXFORMAT_RGB565) {
// Switch to bayer for the quick 2x savings.
sensor_set_pixformat(PIXFORMAT_BAYER);
bpp = 1;
// MAIN_FB() fits, we are done (bpp is 1).
if ((MAIN_FB()->u * MAIN_FB()->v) <= size) {
return 0;
}
}
int window_w = MAIN_FB()->u;
int window_h = MAIN_FB()->v;
// We need to shrink the frame buffer. We can do this by cropping. So, we will subtract columns
// and rows from the frame buffer until it fits within the frame buffer.
int max = IM_MAX(window_w, window_h);
int min = IM_MIN(window_w, window_h);
float aspect_ratio = max / ((float) min);
float r = aspect_ratio, best_r = r;
int c = 1, best_c = c;
float best_err = FLT_MAX;
// Find the width/height ratio that's within 1% of the aspect ratio with a loop limit.
for (int i = 100; i; i--) {
float err = fast_fabsf(r - fast_roundf(r));
if (err <= best_err) {
best_err = err;
best_r = r;
best_c = c;
}
if (best_err <= 0.01f) {
break;
}
r += aspect_ratio;
c += 1;
}
// Select the larger geometry to map the aspect ratio to.
int u_sub, v_sub;
if (window_w > window_h) {
u_sub = fast_roundf(best_r);
v_sub = best_c;
} else {
u_sub = best_c;
v_sub = fast_roundf(best_r);
}
// Crop the frame buffer while keeping the aspect ratio and keeping the width/height even.
while (((MAIN_FB()->u * MAIN_FB()->v * bpp) > size) || (MAIN_FB()->u % 2) || (MAIN_FB()->v % 2)) {
MAIN_FB()->u -= u_sub;
MAIN_FB()->v -= v_sub;
}
// Center the new window using the previous offset and keep the offset even.
MAIN_FB()->x += (window_w - MAIN_FB()->u) / 2;
MAIN_FB()->y += (window_h - MAIN_FB()->v) / 2;
if (MAIN_FB()->x % 2) {
MAIN_FB()->x -= 1;
}
if (MAIN_FB()->y % 2) {
MAIN_FB()->y -= 1;
}
// Pickout a good buffer count for the user.
framebuffer_auto_adjust_buffers();
return 0;
}
mp_rom_error_text_t sensor_strerror(int error)
{
static mp_rom_error_text_t sensor_errors[] = {
MP_ERROR_TEXT("No error."),
MP_ERROR_TEXT("Sensor control failed."),
MP_ERROR_TEXT("The requested operation is not supported by the image sensor."),
MP_ERROR_TEXT("Failed to detect the image sensor or image sensor is detached."),
MP_ERROR_TEXT("The detected image sensor is not supported."),
MP_ERROR_TEXT("Failed to initialize the image sensor."),
MP_ERROR_TEXT("Failed to initialize the image sensor clock."),
MP_ERROR_TEXT("Failed to initialize the image sensor DMA."),
MP_ERROR_TEXT("Failed to initialize the image sensor DCMI."),
MP_ERROR_TEXT("An low level I/O error has occurred."),
MP_ERROR_TEXT("Frame capture has failed."),
MP_ERROR_TEXT("Frame capture has timed out."),
MP_ERROR_TEXT("Frame size is not supported or is not set."),
MP_ERROR_TEXT("Pixel format is not supported or is not set."),
MP_ERROR_TEXT("Window is not supported or is not set."),
MP_ERROR_TEXT("An invalid argument is used."),
MP_ERROR_TEXT("The requested operation is not supported on the current pixel format."),
MP_ERROR_TEXT("Frame buffer error."),
MP_ERROR_TEXT("Frame buffer overflow, try reducing the frame size."),
MP_ERROR_TEXT("JPEG frame buffer overflow."),
};
// Sensor errors are negative.
error = ((error < 0) ? (error * -1) : error);
if (error > (sizeof(sensor_errors) / sizeof(sensor_errors[0]))) {
return "Unknown error.";
} else {
return sensor_errors[error];
}
}
__weak int sensor_snapshot(sensor_t *sensor, image_t *image, uint32_t flags)
{
return -1;
}
#endif //MICROPY_PY_SENSOR
|
the_stack_data/153267431.c | /*
* Program to print information about a FAT file system.
*/
/*
* Main function.
*/
int main(int argc, char *argv[])
{
}
|
the_stack_data/121388.c | #include <stdio.h>
#include <math.h>
float f(float x)
{
return x+1;
}
float g(float x)
{
return 2*x + 3;
}
float h(float x)
{
return x*x + 1;
}
float i(float x)
{
return 5*x*x + 3*x + 1;
}
float j(float x)
{
return 3*pow(x, 3) + 5*x*x + 3*x + 4;
}
float k(float x)
{
return pow(x, 10) - pow(x, 3) + 3;
}
float l(float x)
{
return 3*pow(x, 10) + 4*x*x + 5;
}
float m(float x)
{
return 10*pow(x, 100) + 3*x + 1;
}
int a(float x)
{
return x+3;
}
int b(float x)
{
return x*x - 2;
}
float n(float x)
{
return a(x) + b(x);
}
float c(float x)
{
return x+1;
}
float d(float x)
{
return x*x*x;
}
float o(float x)
{
return c(d(x));
}
float p1(float x)
{
return 3*x*x*x + 2;
}
float p2(float x)
{
return 20*x*x + 1;
}
float p(float x)
{
return p1(x)/p2(x);
}
void main()
{
printf("%f \n", f(0));
printf("%f \n", g(1));
printf("%f \n", h(2));
printf("%f \n", i(1));
printf("%f \n", j(1));
printf("%f \n", k(1));
printf("%f \n", l(1));
printf("%f \n", m(1));
printf("%f \n", n(1));
printf("%f \n", o(1));
printf("%f \n", p(1));
}
|
the_stack_data/9513947.c | #include "stdio.h"
#include "stdlib.h"
#include "math.h"
double mykurtosis(double *data,int n) {
int i;
double mean,mean4,std,std4;
mean=0;
for (i=0;i<n;i++) {
mean+=data[i];
}
mean/=n;
std=0;
mean4=0;
for (i=0;i<n;i++) {
std+=((data[i]-mean)*(data[i]-mean));
mean4+=(pow((data[i]-mean),4));
}
std4=std*std;
mean4*=n;
return(mean4/std4);
}
int main(int argc,char *argv[]) {
double x[5]={1.165, 0.6268, 0.0751, 0.3516, -0.6965};
printf("Kurtosis of x[1.165, 0.6268, 0.0751, 0.3516, -0.6965] is %f\n",mykurtosis(x,5));
}
|
the_stack_data/48576595.c | /* PR c++/54988 */
/* { dg-do compile } */
/* { dg-options "-O2" } */
/* { dg-additional-options "-msse2" { target { i?86-*-* x86_64-*-* } } } */
#if defined(__i386__) || defined(__x86_64__)
#pragma GCC target "fpmath=sse"
#endif
static inline __attribute__ ((always_inline)) int
foo (int x)
{
return x;
}
int
bar (int x)
{
return foo (x);
}
|
the_stack_data/29639.c | /*
* Copyright (C) 2012-2019 Free Software Foundation, Inc.
*
* This file is part of GNU lightning.
*
* GNU lightning is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation; either version 3, or (at your option)
* any later version.
*
* GNU lightning is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
* License for more details.
*
* Authors:
* Paulo Cesar Pereira de Andrade
*/
#if PROTO
# define stxi(i0,r0,r1) stxi_i(i0,r0,r1)
# define ldxi(r0,r1,i0) ldxi_i(r0,r1,i0)
# define ldr(r0,r1) ldr_i(r0,r1)
# define _s20P(d) ((d) >= -(int)0x80000 && d <= 0x7ffff)
# define _s24P(d) ((d) >= -(int)0x800000 && d <= 0x7fffff)
# define _u3(v) ((v) & 0x7)
# define _u4(v) ((v) & 0xf)
# define _u5(v) ((v) & 0x1f)
# define _u8(v) ((v) & 0xff)
# define _u12(v) ((v) & 0xfff)
# define _u13(v) ((v) & 0x1fff)
# define _u16(v) ((v) & 0xffff)
# define _u24(v) ((v) & 0xffffff)
# define jit_thumb_p() jit_cpu.thumb
# define jit_no_set_flags() _jitc->no_set_flags
# define jit_armv5_p() (jit_cpu.version >= 5)
# define jit_armv5e_p() (jit_cpu.version > 5 || (jit_cpu.version == 5 && jit_cpu.extend))
# define jit_armv6_p() (jit_cpu.version >= 6)
# define jit_armv7r_p() 0
# define stack_framesize 48
extern int __aeabi_idivmod(int, int);
extern unsigned __aeabi_uidivmod(unsigned, unsigned);
# define _R0_REGNO 0x00
# define _R1_REGNO 0x01
# define _R2_REGNO 0x02
# define _R3_REGNO 0x03
# define _R4_REGNO 0x04
# define _R5_REGNO 0x05
# define _R6_REGNO 0x06
# define _R7_REGNO 0x07
# define _R8_REGNO 0x08
# define _R9_REGNO 0x09
# define _R10_REGNO 0x0a
# define _R11_REGNO 0x0b
# define _R12_REGNO 0x0c
# define _R13_REGNO 0x0d
# define _R14_REGNO 0x0e
# define _R15_REGNO 0x0f
# define _FP_REGNO _R11_REGNO
# define _SP_REGNO _R13_REGNO
# define _LR_REGNO _R14_REGNO
# define _PC_REGNO _R15_REGNO
# define ARM_CC_EQ 0x00000000 /* Z=1 */
# define ARM_CC_NE 0x10000000 /* Z=0 */
# define ARM_CC_HS 0x20000000 /* C=1 */
# define ARM_CC_CS ARM_CC_HS
# define ARM_CC_LO 0x30000000 /* C=0 */
# define ARM_CC_CC ARM_CC_LO
# define ARM_CC_MI 0x40000000 /* N=1 */
# define ARM_CC_PL 0x50000000 /* N=0 */
# define ARM_CC_VS 0x60000000 /* V=1 */
# define ARM_CC_VC 0x70000000 /* V=0 */
# define ARM_CC_HI 0x80000000 /* C=1 && Z=0 */
# define ARM_CC_LS 0x90000000 /* C=0 || Z=1 */
# define ARM_CC_GE 0xa0000000 /* N=V */
# define ARM_CC_LT 0xb0000000 /* N!=V */
# define ARM_CC_GT 0xc0000000 /* Z=0 && N=V */
# define ARM_CC_LE 0xd0000000 /* Z=1 || N!=V */
# define ARM_CC_AL 0xe0000000 /* always */
# define ARM_CC_NV 0xf0000000 /* reserved */
# define THUMB2_IT 0
# define THUMB2_ITT 1
# define THUMB2_ITE 2
# define THUMB2_ITTT 3
# define THUMB2_ITET 4
# define THUMB2_ITTE 5
# define THUMB2_ITEE 6
# define THUMB2_ITTTT 7
# define THUMB2_ITETT 8
# define THUMB2_ITTET 9
# define THUMB2_ITEET 10
# define THUMB2_ITTTE 11
# define THUMB2_ITETE 12
# define THUMB2_ITTEE 13
# define THUMB2_ITEEE 14
# define ARM_MOV 0x01a00000
# define THUMB_MOV 0x4600
# define ARM_MOVWI 0x03000000 /* v6t2, v7 */
# define THUMB_MOVI 0x2000
# define THUMB2_MOVI 0xf0400000
# define THUMB2_MOVWI 0xf2400000
# define ARM_MOVTI 0x03400000
# define THUMB2_MOVTI 0xf2c00000
# define ARM_MVN 0x01e00000
# define THUMB_MVN 0x43c0
# define THUMB2_MVN 0xea600000
# define THUMB2_MVNI 0xf0600000
# define ARM_I 0x02000000 /* immediate */
# define ARM_S 0x00100000 /* set flags */
# define ARM_ADD 0x00800000
# define THUMB_ADD 0x1800
# define THUMB_ADDX 0x4400
# define THUMB2_ADD 0xeb000000
# define THUMB_ADDI3 0x1c00
# define THUMB_ADDI8 0x3000
# define THUMB2_ADDI 0xf1000000
# define THUMB2_ADDWI 0xf2000000
# define ARM_ADC 0x00a00000
# define THUMB_ADC 0x4140
# define THUMB2_ADC 0xeb400000
# define THUMB2_ADCI 0xf1400000
# define ARM_SUB 0x00400000
# define THUMB_SUB 0x1a00
# define THUMB2_SUB 0xeba00000
# define THUMB_SUBI3 0x1e00
# define THUMB_SUBI8 0x3800
# define THUMB2_SUBI 0xf1a00000
# define THUMB2_SUBWI 0xf2a00000
# define ARM_SBC 0x00c00000
# define THUMB_SBC 0x4180
# define THUMB2_SBC 0xeb600000
# define THUMB2_SBCI 0xf1600000
# define ARM_RSB 0x00600000
# define THUMB_RSBI 0x4240
# define THUMB2_RSBI 0xf1c00000
# define ARM_MUL 0x00000090
# define THUMB_MUL 0x4340
# define THUMB2_MUL 0xfb00f000
# define ARM_UMULL 0x00800090
# define THUMB2_UMULL 0xfba00000
# define ARM_SMULL 0x00c00090
# define THUMB2_SMULL 0xfb800000
# define THUMB2_SDIV 0xfb90f0f0
# define THUMB2_UDIV 0xfbb0f0f0
# define ARM_AND 0x00000000
# define THUMB_AND 0x4000
# define THUMB2_AND 0xea000000
# define THUMB2_ANDI 0xf0000000
# define ARM_BIC 0x01c00000
# define THUMB2_BIC 0xea200000
# define THUMB2_BICI 0xf0200000
# define ARM_ORR 0x01800000
# define THUMB_ORR 0x4300
# define THUMB2_ORR 0xea400000
# define THUMB2_ORRI 0xf0400000
# define ARM_EOR 0x00200000
# define THUMB_EOR 0x4040
# define THUMB2_EOR 0xea800000
# define THUMB2_EORI 0xf0800000
/* >> ARMv6* */
# define ARM_REV 0x06bf0f30
# define THUMB_REV 0xba00
# define THUMB2_REV 0xfa90f080
# define ARM_REV16 0x06bf0fb0
# define THUMB_REV16 0xba40
# define THUMB2_REV16 0xfa90f090
# define ARM_SXTB 0x06af0070
# define THUMB_SXTB 0xb240
# define THUMB2_SXTB 0xfa40f080
# define ARM_UXTB 0x06ef0070
# define THUMB_UXTB 0xb2c0
# define THUMB2_UXTB 0xfa50f080
# define ARM_SXTH 0x06bf0070
# define THUMB_SXTH 0xb200
# define THUMB2_SXTH 0xfa00f080
# define ARM_UXTH 0x06ff0070
# define THUMB_UXTH 0xb280
# define THUMB2_UXTH 0xfa10f080
# define ARM_XTR8 0x00000400 /* ?xt? rotate 8 bits */
# define ARM_XTR16 0x00000800 /* ?xt? rotate 16 bits */
# define ARM_XTR24 0x00000c00 /* ?xt? rotate 24 bits */
/* << ARMv6* */
# define ARM_SHIFT 0x01a00000
# define ARM_R 0x00000010 /* register shift */
# define ARM_LSL 0x00000000
# define THUMB_LSL 0x4080
# define THUMB2_LSL 0xfa00f000
# define THUMB_LSLI 0x0000
# define THUMB2_LSLI 0xea4f0000
# define ARM_LSR 0x00000020
# define THUMB_LSR 0x40c0
# define THUMB2_LSR 0xfa20f000
# define THUMB_LSRI 0x0800
# define THUMB2_LSRI 0xea4f0010
# define ARM_ASR 0x00000040
# define THUMB_ASR 0x4100
# define THUMB2_ASR 0xfa40f000
# define THUMB_ASRI 0x1000
# define THUMB2_ASRI 0xea4f0020
# define ARM_ROR 0x00000060
# define ARM_CMP 0x01500000
# define THUMB_CMP 0x4280
# define THUMB_CMPX 0x4500
# define THUMB2_CMP 0xebb00000
# define THUMB_CMPI 0x2800
# define THUMB2_CMPI 0xf1b00000
# define ARM_CMN 0x01700000
# define THUMB_CMN 0x42c0
# define THUMB2_CMN 0xeb100000
# define THUMB2_CMNI 0xf1100000
# define ARM_TST 0x01100000
# define THUMB_TST 0x4200
# define THUMB2_TST 0xea100000
# define THUMB2_TSTI 0xf0100000
# define ARM_TEQ 0x01300000
/* branch */
# define ARM_BX 0x012fff10
# define ARM_BLX 0x012fff30
# define THUMB_BLX 0x4780
# define ARM_BLXI 0xfa000000
# define THUMB2_BLXI 0xf000c000
# define ARM_B 0x0a000000
# define THUMB_CC_B 0xd000
# define THUMB_B 0xe000
# define THUMB2_CC_B 0xf0008000
# define THUMB2_B 0xf0009000
# define ARM_BLI 0x0b000000
# define THUMB2_BLI 0xf000d000
/* ldr/str */
# define ARM_P 0x00800000 /* positive offset */
# define THUMB2_P 0x00000400
# define THUMB2_U 0x00000200
# define THUMB2_W 0x00000100
# define ARM_LDRSB 0x011000d0
# define THUMB_LDRSB 0x5600
# define THUMB2_LDRSB 0xf9100000
# define ARM_LDRSBI 0x015000d0
# define THUMB2_LDRSBI 0xf9100c00
# define THUMB2_LDRSBWI 0xf9900000
# define ARM_LDRB 0x07500000
# define THUMB_LDRB 0x5c00
# define THUMB2_LDRB 0xf8100000
# define ARM_LDRBI 0x05500000
# define THUMB_LDRBI 0x7800
# define THUMB2_LDRBI 0xf8100c00
# define THUMB2_LDRBWI 0xf8900000
# define ARM_LDRSH 0x011000f0
# define THUMB_LDRSH 0x5e00
# define THUMB2_LDRSH 0xf9300000
# define ARM_LDRSHI 0x015000f0
# define THUMB2_LDRSHI 0xf9300c00
# define THUMB2_LDRSHWI 0xf9b00000
# define ARM_LDRH 0x011000b0
# define THUMB_LDRH 0x5a00
# define THUMB2_LDRH 0xf8300000
# define ARM_LDRHI 0x015000b0
# define THUMB_LDRHI 0x8800
# define THUMB2_LDRHI 0xf8300c00
# define THUMB2_LDRHWI 0xf8b00000
# define ARM_LDR 0x07100000
# define THUMB_LDR 0x5800
# define THUMB2_LDR 0xf8500000
# define ARM_LDRI 0x05100000
# define THUMB_LDRI 0x6800
# define THUMB_LDRISP 0x9800
# define THUMB2_LDRI 0xf8500c00
# define THUMB2_LDRWI 0xf8d00000
# define ARM_LDRD 0x010000d0
# define ARM_LDRDI 0x014000d0
# define THUMB2_LDRDI 0xe8500000
# define ARM_STRB 0x07400000
# define THUMB_STRB 0x5400
# define THUMB2_STRB 0xf8000000
# define ARM_STRBI 0x05400000
# define THUMB_STRBI 0x7000
# define THUMB2_STRBI 0xf8000c00
# define THUMB2_STRBWI 0xf8800000
# define ARM_STRH 0x010000b0
# define THUMB_STRH 0x5200
# define THUMB2_STRH 0xf8200000
# define ARM_STRHI 0x014000b0
# define THUMB_STRHI 0x8000
# define THUMB2_STRHI 0xf8200c00
# define THUMB2_STRHWI 0xf8a00000
# define ARM_STR 0x07000000
# define THUMB_STR 0x5000
# define THUMB2_STR 0xf8400000
# define ARM_STRI 0x05000000
# define THUMB_STRI 0x6000
# define THUMB2_STRWI 0xf8c00000
# define THUMB_STRISP 0x9000
# define THUMB2_STRI 0xf8400c00
# define ARM_STRD 0x010000f0
# define ARM_STRDI 0x014000f0
# define THUMB2_STRDI 0xe8400000
/* ldm/stm */
# define ARM_M 0x08000000
# define ARM_M_L 0x00100000 /* load; store if not set */
# define ARM_M_I 0x00800000 /* inc; dec if not set */
# define ARM_M_B 0x01000000 /* before; after if not set */
# define ARM_M_U 0x00200000 /* update Rn */
# define THUMB2_LDM_W 0x00200000
# define THUMB2_LDM_P 0x00008000
# define THUMB2_LDM_M 0x00004000
# define THUMB_LDMIA 0xc800
# define THUMB2_LDMIA 0xe8900000
# define THUMB2_LDMB 0xe9100000
# define THUMB_PUSH 0xb400
# define THUMB2_PUSH 0xe92d0000
# define THUMB_POP 0xbc00
# define THUMB2_POP 0xe8bd0000
# define ii(i) *_jit->pc.ui++ = i
# define is(i) *_jit->pc.us++ = i
# if __BYTE_ORDER == __LITTLE_ENDIAN
# define iss(i, j) do { is(j); is(i); } while (0)
# define code2thumb(t0, t1, c0, c1) do { t1 = c0; t0 = c1; } while (0)
# define thumb2code(t0, t1, c0, c1) do { c0 = t1; c1 = t0; } while (0)
# else
# define iss(i, j) do { is(i); is(j); } while (0)
# define code2thumb(t0, t1, c0, c1) do { t0 = c0; t1 = c1; } while (0)
# define thumb2code(t0, t1, c0, c1) do { c0 = t0; c1 = t1; } while (0)
# endif
static int encode_arm_immediate(unsigned int v);
static int encode_thumb_immediate(unsigned int v);
static int encode_thumb_word_immediate(unsigned int v);
static int encode_thumb_jump(int v);
static int encode_thumb_cc_jump(int v);
static int encode_thumb_shift(int v, int type) maybe_unused;
# define corrr(cc,o,rn,rd,rm) _corrr(_jit,cc,o,rn,rd,rm)
static void _corrr(jit_state_t*,int,int,int,int,int);
# define corri(cc,o,rn,rd,im) _corri(_jit,cc,o,rn,rd,im)
static void _corri(jit_state_t*,int,int,int,int,int);
#define corri8(cc,o,rn,rt,im) _corri8(_jit,cc,o,rn,rt,im)
static void _corri8(jit_state_t*,int,int,int,int,int);
# define torrr(o,rn,rd,rm) _torrr(_jit,o,rn,rd,rm)
static void _torrr(jit_state_t*,int,int,int,int);
# define torrrs(o,rn,rd,rm,im) _torrrs(_jit,o,rn,rd,rm,im)
static void _torrrs(jit_state_t*,int,int,int,int,int) maybe_unused;
# define torxr(o,rn,rt,rm) _torxr(_jit,o,rn,rt,rm)
static void _torxr(jit_state_t*,int,int,int,int);
# define torrrr(o,rn,rl,rh,rm) _torrrr(_jit,o,rn,rl,rh,rm)
static void _torrrr(jit_state_t*,int,int,int,int,int) maybe_unused;
# define torrri8(o,rn,rt,rt2,im) _torrri8(_jit,o,rn,rt,rt2,im)
static void _torrri8(jit_state_t*,int,int,int,int,int) maybe_unused;
# define coriw(cc,o,rd,im) _coriw(_jit,cc,o,rd,im)
static void _coriw(jit_state_t*,int,int,int,int);
# define torri(o,rd,rn,im) _torri(_jit,o,rd,rn,im)
static void _torri(jit_state_t*,int,int,int,int);
# define torri8(o,rn,rt,im) _torri8(_jit,o,rn,rt,im)
static void _torri8(jit_state_t*,int,int,int,int);
# define torri12(o,rn,rt,im) _torri12(_jit,o,rn,rt,im)
static void _torri12(jit_state_t*,int,int,int,int);
# define tshift(o,rd,rm,im) _tshift(_jit,o,rd,rm,im)
static void _tshift(jit_state_t*,int,int,int,int);
# define toriw(o,rd,im) _toriw(_jit,o,rd,im)
static void _toriw(jit_state_t*,int,int,int);
# define tc8(cc,im) _tc8(_jit,cc,im)
static void _tc8(jit_state_t*,int,int) maybe_unused;
# define t11(im) _t11(_jit,im)
static void _t11(jit_state_t*,int);
# define tcb(cc,im) _tcb(_jit,cc,im)
static void _tcb(jit_state_t*,int,int);
# define blxi(im) _blxi(_jit,im)
static void _blxi(jit_state_t*,int) maybe_unused;
# define tb(o,im) _tb(_jit,o,im)
static void _tb(jit_state_t*,int,int);
# define corrrr(cc,o,rh,rl,rm,rn) _corrrr(_jit,cc,o,rh,rl,rm,rn)
static void _corrrr(jit_state_t*,int,int,int,int,int,int);
# define corrrs(cc,o,rn,rd,rm,im) _corrrs(_jit,cc,o,rn,rd,rm,im)
static void _corrrs(jit_state_t*,int,int,int,int,int,int);
# define cshift(cc,o,rd,rm,rn,im) _cshift(_jit,cc,o,rd,rm,rn,im)
static void _cshift(jit_state_t*,int,int,int,int,int,int);
# define cb(cc,o,im) _cb(_jit,cc,o,im)
static void _cb(jit_state_t*,int,int,int);
# define cbx(cc,o,rm) _cbx(_jit,cc,o,rm)
static void _cbx(jit_state_t*,int,int,int);
# define corl(cc,o,r0,i0) _corl(_jit,cc,o,r0,i0)
static void _corl(jit_state_t*,int,int,int,int);
# define c6orr(cc,o,r0,r1) _c6orr(_jit,cc,o,r0,r1)
static void _c6orr(jit_state_t*,int,int,int,int);
# define tcit(cc,it) _tcit(_jit,cc,it)
static void _tcit(jit_state_t*,unsigned int,int);
# define IT(cc) tcit(cc,THUMB2_IT)
# define ITT(cc) tcit(cc,THUMB2_ITT)
# define ITE(cc) tcit(cc,THUMB2_ITE)
# define ITTT(cc) tcit(cc,THUMB2_ITTT)
# define ITTE(cc) tcit(cc,THUMB2_ITTE)
# define ITET(cc) tcit(cc,THUMB2_ITET)
# define ITEE(cc) tcit(cc,THUMB2_ITEE)
# define ITTTT(cc) tcit(cc,THUMB2_ITTTT)
# define ITETT(cc) tcit(cc,THUMB2_ITETT)
# define ITTET(cc) tcit(cc,THUMB2_ITTET)
# define ITEET(cc) tcit(cc,THUMB2_ITEET)
# define ITTTE(cc) tcit(cc,THUMB2_ITTTE)
# define ITETE(cc) tcit(cc,THUMB2_ITETE)
# define ITTEE(cc) tcit(cc,THUMB2_ITTEE)
# define ITEEE(cc) tcit(cc,THUMB2_ITEEE)
# define tpp(o,im) _tpp(_jit,o,im)
static void _tpp(jit_state_t*,int,int);
# define torl(o,rn,im) _torl(_jit,o,rn,im)
static void _torl(jit_state_t*,int,int,int) maybe_unused;
# define CC_MOV(cc,rd,rm) corrr(cc,ARM_MOV,0,rd,rm)
# define MOV(rd,rm) CC_MOV(ARM_CC_AL,rd,rm)
# define T1_MOV(rd,rm) is(THUMB_MOV|((_u4(rd)&8)<<4)|(_u4(rm)<<3)|(rd&7))
# define T2_MOV(rd,rm) T2_ORR(rd,_R15_REGNO,rm)
# define CC_MOVI(cc,rd,im) corri(cc,ARM_MOV|ARM_I,0,rd,im)
# define MOVI(rd,im) CC_MOVI(ARM_CC_AL,rd,im)
# define CC_MOVWI(cc,rd,im) coriw(cc,ARM_MOVWI,rd,im)
# define MOVWI(rd,im) CC_MOVWI(ARM_CC_AL,rd,im)
# define T1_MOVI(rd,im) is(THUMB_MOVI|(_u3(rd)<<8)|_u8(im))
# define T2_MOVI(rd,im) torri(THUMB2_MOVI,_R15_REGNO,rd,im)
# define T2_MOVWI(rd,im) toriw(THUMB2_MOVWI,rd,im)
# define CC_MOVTI(cc,rd,im) coriw(cc,ARM_MOVTI,rd,im)
# define MOVTI(rd,im) CC_MOVTI(ARM_CC_AL,rd,im)
# define T2_MOVTI(rd,im) toriw(THUMB2_MOVTI,rd,im)
# define CC_MVN(cc,rd,rm) corrr(cc,ARM_MVN,0,rd,rm)
# define MVN(rd,rm) CC_MVN(ARM_CC_AL,rd,rm)
# define T1_MVN(rd,rm) is(THUMB_MVN|(_u3(rm)<<3)|_u3(rd))
# define T2_MVN(rd,rm) torrr(THUMB2_MVN,_R15_REGNO,rd,rm)
# define CC_MVNI(cc,rd,im) corri(cc,ARM_MVN|ARM_I,0,rd,im)
# define MVNI(rd,im) CC_MVNI(ARM_CC_AL,rd,im)
# define T2_MVNI(rd,im) torri(THUMB2_MVNI,_R15_REGNO,rd,im)
# define CC_NOT(cc,rd,rm) CC_MVN(cc,rd,rm)
# define NOT(rd,rm) CC_NOT(ARM_CC_AL,rd,rm)
# define T1_NOT(rd,rm) T1_MVN(rd,rm)
# define T2_NOT(rd,rm) T2_MVN(rd,rm)
# define NOP() MOV(_R0_REGNO, _R0_REGNO)
# define T1_NOP() is(0xbf00)
# define CC_ADD(cc,rd,rn,rm) corrr(cc,ARM_ADD,rn,rd,rm)
# define ADD(rd,rn,rm) CC_ADD(ARM_CC_AL,rd,rn,rm)
# define T1_ADD(rd,rn,rm) is(THUMB_ADD|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rd))
# define T1_ADDX(rdn,rm) is(THUMB_ADDX|((_u4(rdn)&8)<<4)|(_u4(rm)<<3)|(rdn&7))
# define T2_ADD(rd,rn,rm) torrr(THUMB2_ADD,rn,rd,rm)
# define CC_ADDI(cc,rd,rn,im) corri(cc,ARM_ADD|ARM_I,rn,rd,im)
# define ADDI(rd,rn,im) CC_ADDI(ARM_CC_AL,rd,rn,im)
# define T1_ADDI3(rd,rn,im) is(THUMB_ADDI3|(_u3(im)<<6)|(_u3(rn)<<3)|_u3(rd))
# define T1_ADDI8(rdn,im) is(THUMB_ADDI8|(_u3(rdn)<<8)|_u8(im))
# define T2_ADDI(rd,rn,im) torri(THUMB2_ADDI,rn,rd,im)
# define T2_ADDWI(rd,rn,im) torri(THUMB2_ADDWI,rn,rd,im)
# define CC_ADDS(cc,rd,rn,rm) corrr(cc,ARM_ADD|ARM_S,rn,rd,rm)
# define ADDS(rd,rn,rm) CC_ADDS(ARM_CC_AL,rd,rn,rm)
# define T2_ADDS(rd,rn,rm) torrr(THUMB2_ADD|ARM_S,rn,rd,rm)
# define ADDSI(rd,rn,im) corri(ARM_CC_AL,ARM_ADD|ARM_S|ARM_I,rn,rd,im)
# define T2_ADDSI(rd,rn,im) torri(THUMB2_ADDI|ARM_S,rn,rd,im)
# define CC_ADC(cc,rd,rn,rm) corrr(cc,ARM_ADC,rn,rd,rm)
# define ADC(rd,rn,rm) CC_ADC(ARM_CC_AL,rd,rn,rm)
# define T1_ADC(rdn,rm) is(THUMB_ADC|(_u3(rm)<<3)|_u3(rdn))
# define T2_ADC(rd,rn,rm) torrr(THUMB2_ADC,rn,rd,rm)
# define CC_ADCI(cc,rd,rn,im) corri(cc,ARM_ADC|ARM_I,rn,rd,im)
# define ADCI(rd,rn,im) CC_ADCI(ARM_CC_AL,rd,rn,im)
# define T2_ADCI(rd,rn,im) torri(THUMB2_ADCI,rn,rd,im)
# define CC_ADCS(cc,rd,rn,rm) corrr(cc,ARM_ADC|ARM_S,rn,rd,rm)
# define ADCS(rd,rn,rm) CC_ADCS(ARM_CC_AL,rd,rn,rm)
# define T2_ADCS(rd,rn,rm) torrr(THUMB2_ADC|ARM_S,rn,rd,rm)
# define CC_ADCSI(cc,rd,rn,im) corri(cc,ARM_ADC|ARM_S|ARM_I,rn,rd,im)
# define ADCSI(rd,rn,im) CC_ADCSI(ARM_CC_AL,rd,rn,im)
# define T2_ADCSI(rd,rn,im) torri(THUMB2_ADCI|ARM_S,rn,rd,im)
# define CC_SUB(cc,rd,rn,rm) corrr(cc,ARM_SUB,rn,rd,rm)
# define SUB(rd,rn,rm) CC_SUB(ARM_CC_AL,rd,rn,rm)
# define T1_SUB(rd,rn,rm) is(THUMB_SUB|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rd))
# define T2_SUB(rd,rn,rm) torrr(THUMB2_SUB,rn,rd,rm)
# define CC_SUBI(cc,rd,rn,im) corri(cc,ARM_SUB|ARM_I,rn,rd,im)
# define SUBI(rd,rn,im) CC_SUBI(ARM_CC_AL,rd,rn,im)
# define T1_SUBI3(rd,rn,im) is(THUMB_SUBI3|(_u3(im)<<6)|(_u3(rn)<<3)|_u3(rd))
# define T1_SUBI8(rdn,im) is(THUMB_SUBI8|(_u3(rdn)<<8)|_u8(im))
# define T2_SUBI(rd,rn,im) torri(THUMB2_SUBI,rn,rd,im)
# define T2_SUBWI(rd,rn,im) torri(THUMB2_SUBWI,rn,rd,im)
# define CC_SUBS(cc,rd,rn,rm) corrr(cc,ARM_SUB|ARM_S,rn,rd,rm)
# define SUBS(rd,rn,rm) CC_SUBS(ARM_CC_AL,rd,rn,rm)
# define T2_SUBS(rd,rn,rm) torrr(THUMB2_SUB|ARM_S,rn,rd,rm)
# define CC_SUBSI(cc,rd,rn,im) corri(cc,ARM_SUB|ARM_S|ARM_I,rn,rd,im)
# define SUBSI(rd,rn,im) CC_SUBSI(ARM_CC_AL,rd,rn,im)
# define T2_SUBSI(rd,rn,im) torri(THUMB2_SUBI|ARM_S,rn,rd,im)
# define CC_SBC(cc,rd,rn,rm) corrr(cc,ARM_SBC,rn,rd,rm)
# define SBC(rd,rn,rm) CC_SBC(ARM_CC_AL,rd,rn,rm)
# define T1_SBC(rdn,rm) is(THUMB_SBC|(_u3(rm)<<3)|_u3(rdn))
# define T2_SBC(rd,rn,rm) torrr(THUMB2_SBC,rn,rd,rm)
# define CC_SBCI(cc,rd,rn,im) corri(cc,ARM_SBC|ARM_I,rn,rd,im)
# define SBCI(rd,rn,im) CC_SBCI(ARM_CC_AL,rd,rn,im)
# define T2_SBCI(rd,rn,im) torri(THUMB2_SBCI,rn,rd,im)
# define CC_SBCS(cc,rd,rn,rm) corrr(cc,ARM_SBC|ARM_S,rn,rd,rm)
# define SBCS(rd,rn,rm) CC_SBCS(ARM_CC_AL,rd,rn,rm)
# define T2_SBCS(rd,rn,rm) torrr(THUMB2_SBC|ARM_S,rn,rd,rm)
# define CC_SBCSI(cc,rd,rn,im) corri(cc,ARM_SBC|ARM_S|ARM_I,rn,rd,im)
# define SBCSI(rd,rn,im) CC_SBCSI(ARM_CC_AL,rd,rn,im)
# define T2_SBCSI(rd,rn,im) torri(THUMB2_SBCI|ARM_S,rn,rd,im)
# define CC_RSB(cc,rd,rn,rm) corrr(cc,ARM_RSB,rn,rd,rm)
# define RSB(rd,rn,rm) CC_RSB(ARM_CC_AL,rd,rn,rm)
# define T2_RSB(rd,rn,rm) torrr(THUMB2_RSB,rn,rd,rm)
# define CC_RSBI(cc,rd,rn,im) corri(cc,ARM_RSB|ARM_I,rn,rd,im)
# define RSBI(rd,rn,im) CC_RSBI(ARM_CC_AL,rd,rn,im)
# define T1_RSBI(rd,rn) is(THUMB_RSBI|(_u3(rn)<<3)|_u3(rd))
# define T2_RSBI(rd,rn,im) torri(THUMB2_RSBI,rn,rd,im)
# define CC_MUL(cc,rl,rn,rm) corrrr(cc,ARM_MUL,rl,0,rm,rn)
# define MUL(rl,rn,rm) CC_MUL(ARM_CC_AL,rl,rn,rm)
# define T1_MUL(rdm,rn) is(THUMB_MUL|(_u3(rn)<<3)|_u3(rdm))
# define T2_MUL(rd,rn,rm) torrr(THUMB2_MUL,rn,rd,rm)
# define CC_SMULL(cc,rl,rh,rn,rm) corrrr(cc,ARM_SMULL,rh,rl,rm,rn)
# define SMULL(rl,rh,rn,rm) CC_SMULL(ARM_CC_AL,rl,rh,rn,rm)
# define T2_SMULL(rl,rh,rn,rm) torrrr(THUMB2_SMULL,rn,rl,rh,rm)
# define CC_UMULL(cc,rl,rh,rn,rm) corrrr(cc,ARM_UMULL,rh,rl,rm,rn)
# define UMULL(rl,rh,rn,rm) CC_UMULL(ARM_CC_AL,rl,rh,rn,rm)
# define T2_UMULL(rl,rh,rn,rm) torrrr(THUMB2_UMULL,rn,rl,rh,rm)
# define T2_SDIV(rd,rn,rm) torrr(THUMB2_SDIV,rn,rd,rm)
# define T2_UDIV(rd,rn,rm) torrr(THUMB2_UDIV,rn,rd,rm)
# define CC_AND(cc,rd,rn,rm) corrr(cc,ARM_AND,rn,rd,rm)
# define AND(rd,rn,rm) CC_AND(ARM_CC_AL,rd,rn,rm)
# define T1_AND(rdn,rm) is(THUMB_AND|(_u3(rm)<<3)|_u3(rdn))
# define T2_AND(rd,rn,rm) torrr(THUMB2_AND,rn,rd,rm)
# define CC_ANDI(cc,rd,rn,im) corri(cc,ARM_AND|ARM_I,rn,rd,im)
# define ANDI(rd,rn,im) CC_ANDI(ARM_CC_AL,rd,rn,im)
# define T2_ANDI(rd,rn,im) torri(THUMB2_ANDI,rn,rd,im)
# define CC_ANDS(cc,rd,rn,rm) corrr(cc,ARM_AND|ARM_S,rn,rd,rm)
# define ANDS(rd,rn,rm) CC_ANDS(ARM_CC_AL,rd,rn,rm)
# define T2_ANDS(rd,rn,rm) torrr(THUMB2_AND|ARM_S,rn,rd,rm)
# define CC_ANDSI(cc,rd,rn,im) corri(cc,ARM_AND|ARM_S|ARM_I,rn,rd,im)
# define ANDSI(rd,rn,im) CC_ANDSI(ARM_CC_AL,rd,rn,im)
# define T2_ANDSI(rd,rn,im) torri(ARM_CC_AL,THUMB2_ANDI|ARM_S,rn,rd,im)
# define CC_BIC(cc,rd,rn,rm) corrr(cc,ARM_BIC,rn,rd,rm)
# define BIC(rd,rn,rm) CC_BIC(ARM_CC_AL,rd,rn,rm)
# define T2_BIC(rd,rn,rm) torrr(THUMB2_BIC,rn,rd,rm)
# define CC_BICI(cc,rd,rn,im) corri(cc,ARM_BIC|ARM_I,rn,rd,im)
# define BICI(rd,rn,im) CC_BICI(ARM_CC_AL,rd,rn,im)
# define T2_BICI(rd,rn,im) torri(THUMB2_BICI,rn,rd,im)
# define CC_BICS(cc,rd,rn,rm) corrr(cc,ARM_BIC|ARM_S,rn,rd,rm)
# define BICS(rd,rn,rm) CC_BICS(ARM_CC_AL,rd,rn,rm)
# define T2_BICS(rd,rn,rm) torrr(THUMB2_BIC|ARM_S,rn,rd,rm)
# define CC_BICSI(cc,rd,rn,im) corri(cc,ARM_BIC|ARM_S|ARM_I,rn,rd,im)
# define BICSI(rd,rn,im) CC_BICSI(ARM_CC_AL,rd,rn,im)
# define T2_BICSI(rd,rn,im) torri(ARM_CC_AL,THUMB2_BICI|ARM_S,rn,rd,im)
# define CC_ORR(cc,rd,rn,rm) corrr(cc,ARM_ORR,rn,rd,rm)
# define ORR(rd,rn,rm) CC_ORR(ARM_CC_AL,rd,rn,rm)
# define T1_ORR(rdn,rm) is(THUMB_ORR|(_u3(rm)<<3)|_u3(rdn))
# define T2_ORR(rd,rn,rm) torrr(THUMB2_ORR,rn,rd,rm)
# define CC_ORR_SI(cc,rd,rn,rt,sh,im) corrrs(cc,ARM_ORR|sh,rn,rd,rm,im)
# define ORR_SI(r0,r1,r2,sh,im) CC_ORR_SI(ARM_CC_AL,r0,r1,r2,sh,im)
# define CC_ORRI(cc,rd,rn,im) corri(cc,ARM_ORR|ARM_I,rn,rd,im)
# define ORRI(rd,rn,im) CC_ORRI(ARM_CC_AL,rd,rn,im)
# define T2_ORRI(rd,rn,im) torri(THUMB2_ORRI,rn,rd,im)
# define CC_EOR(cc,rd,rn,rm) corrr(cc,ARM_EOR,rn,rd,rm)
# define EOR(rd,rn,rm) CC_EOR(ARM_CC_AL,rd,rn,rm)
# define T1_EOR(rdn,rm) is(THUMB_EOR|(_u3(rm)<<3)|_u3(rdn))
# define T2_EOR(rd,rn,rm) torrr(THUMB2_EOR,rn,rd,rm)
# define CC_EOR_SI(cc,rd,rn,rm,sh,im) corrrs(cc,ARM_EOR|sh,rn,rd,rm,im)
# define EOR_SI(r0,r1,r2,sh,im) CC_EOR_SI(ARM_CC_AL,r0,r1,r2,sh,im)
# define CC_EORI(cc,rd,rn,im) corri(cc,ARM_EOR|ARM_I,rn,rd,im)
# define EORI(rd,rn,im) CC_EORI(ARM_CC_AL,rd,rn,im)
# define T2_EORI(rd,rn,im) torri(THUMB2_EORI,rn,rd,im)
# define CC_REV(cc,rd,rm) c6orr(cc,ARM_REV,rd,rm)
# define REV(rd,rm) CC_REV(ARM_CC_AL,rd,rm)
# define T1_REV(rd,rm) is(THUMB_REV|(_u3(rm)<<3)|_u3(rd))
# define T2_REV(rd,rm) torrr(THUMB2_REV,rm,rd,rm)
# define CC_REV16(cc,rd,rm) c6orr(cc,ARM_REV16,rd,rm)
# define REV16(rd,rm) CC_REV16(ARM_CC_AL,rd,rm)
# define T1_REV16(rd,rm) is(THUMB_REV16|(_u3(rm)<<3)|_u3(rd))
# define T2_REV16(rd,rm) torrr(THUMB2_REV16,rm,rd,rm)
# define CC_SXTB(cc,rd,rm) c6orr(cc,ARM_SXTB,rd,rm)
# define SXTB(rd,rm) CC_SXTB(ARM_CC_AL,rd,rm)
# define T1_SXTB(rd,rm) is(THUMB_SXTB|(_u3(rm)<<3)|_u3(rd))
# define T2_SXTB(rd,rm) torrr(THUMB2_SXTB,_R15_REGNO,rd,rm)
# define CC_UXTB(cc,rd,rm) c6orr(cc,ARM_UXTB,rd,rm)
# define UXTB(rd,rm) CC_UXTB(ARM_CC_AL,rd,rm)
# define T1_UXTB(rd,rm) is(THUMB_UXTB|(_u3(rm)<<3)|_u3(rd))
# define T2_UXTB(rd,rm) torrr(THUMB2_UXTB,_R15_REGNO,rd,rm)
# define CC_SXTH(cc,rd,rm) c6orr(cc,ARM_SXTH,rd,rm)
# define SXTH(rd,rm) CC_SXTH(ARM_CC_AL,rd,rm)
# define T1_SXTH(rd,rm) is(THUMB_SXTH|(_u3(rm)<<3)|_u3(rd))
# define T2_SXTH(rd,rm) torrr(THUMB2_SXTH,_R15_REGNO,rd,rm)
# define CC_UXTH(cc,rd,rm) c6orr(cc,ARM_UXTH,rd,rm)
# define UXTH(rd,rm) CC_UXTH(ARM_CC_AL,rd,rm)
# define T1_UXTH(rd,rm) is(THUMB_UXTH|(_u3(rm)<<3)|_u3(rd))
# define T2_UXTH(rd,rm) torrr(THUMB2_UXTH,_R15_REGNO,rd,rm)
# define CC_SHIFT(cc,o,rd,rm,rn,im) cshift(cc,o,rd,rm,rn,im)
# define CC_LSL(cc,rd,rn,rm) CC_SHIFT(cc,ARM_LSL|ARM_R,rd,rm,rn,0)
# define LSL(rd,rn,rm) CC_LSL(ARM_CC_AL,rd,rn,rm)
# define T1_LSL(rdn,rm) is(THUMB_LSL|(_u3(rm)<<3)|_u3(rdn))
# define T2_LSL(rd,rn,rm) torrr(THUMB2_LSL,rn,rd,rm)
# define CC_LSLI(cc,rd,rn,im) CC_SHIFT(cc,ARM_LSL,rd,0,rn,im)
# define LSLI(rd,rn,im) CC_LSLI(ARM_CC_AL,rd,rn,im)
# define T1_LSLI(rd,rm,im) is(THUMB_LSLI|(_u5(im)<<6)|(_u3(rm)<<3)|_u3(rd))
# define T2_LSLI(rd,rm,im) tshift(THUMB2_LSLI,rd,rm,im)
# define CC_LSR(cc,rd,rn,rm) CC_SHIFT(cc,ARM_LSR|ARM_R,rd,rm,rn,0)
# define LSR(rd,rn,rm) CC_LSR(ARM_CC_AL,rd,rn,rm)
# define T1_LSR(rdn,rm) is(THUMB_LSR|(_u3(rm)<<3)|_u3(rdn))
# define T2_LSR(rd,rn,rm) torrr(THUMB2_LSR,rn,rd,rm)
# define CC_LSRI(cc,rd,rn,im) CC_SHIFT(cc,ARM_LSR,rd,0,rn,im)
# define LSRI(rd,rn,im) CC_LSRI(ARM_CC_AL,rd,rn,im)
# define T1_LSRI(rd,rm,im) is(THUMB_LSRI|(_u5(im)<<6)|(_u3(rm)<<3)|_u3(rd))
# define T2_LSRI(rd,rm,im) tshift(THUMB2_LSRI,rd,rm,im)
# define CC_ASR(cc,rd,rn,rm) CC_SHIFT(cc,ARM_ASR|ARM_R,rd,rm,rn,0)
# define ASR(rd,rn,rm) CC_ASR(ARM_CC_AL,rd,rn,rm)
# define T1_ASR(rdn,rm) is(THUMB_ASR|(_u3(rm)<<3)|_u3(rdn))
# define T2_ASR(rd,rn,rm) torrr(THUMB2_ASR,rn,rd,rm)
# define CC_ASRI(cc,rd,rn,im) CC_SHIFT(cc,ARM_ASR,rd,0,rn,im)
# define ASRI(rd,rn,im) CC_ASRI(ARM_CC_AL,rd,rn,im)
# define T1_ASRI(rd,rm,im) is(THUMB_ASRI|(_u5(im)<<6)|(_u3(rm)<<3)|_u3(rd))
# define T2_ASRI(rd,rm,im) tshift(THUMB2_ASRI,rd,rm,im)
# define CC_CMP(cc,rn,rm) corrr(cc,ARM_CMP,rn,0,rm)
# define CMP(rn,rm) CC_CMP(ARM_CC_AL,rn,rm)
# define T1_CMP(rn,rm) is(THUMB_CMP|(_u3(rm)<<3)|_u3(rn))
# define T1_CMPX(rn,rm) is(THUMB_CMPX|((_u4(rn)&8)<<4)|(_u4(rm)<<3)|(rn&7))
# define T2_CMP(rn,rm) torrr(THUMB2_CMP,rn,_R15_REGNO,rm)
# define CC_CMPI(cc,rn,im) corri(cc,ARM_CMP|ARM_I,rn,0,im)
# define CMPI(rn,im) CC_CMPI(ARM_CC_AL,rn,im)
# define T1_CMPI(rn,im) is(THUMB_CMPI|(_u3(rn)<<8)|_u8(im))
# define T2_CMPI(rn,im) torri(THUMB2_CMPI,rn,_R15_REGNO,im)
# define CC_CMN(cc,rn,rm) corrr(cc,ARM_CMN,rn,0,rm)
# define CMN(rn,rm) CC_CMN(ARM_CC_AL,rn,rm)
# define T1_CMN(rn,rm) is(THUMB_CMN|(_u3(rm)<<3)|_u3(rm))
# define T2_CMN(rn,rm) torrr(THUMB2_CMN,rn,_R15_REGNO,rm)
# define CC_CMNI(cc,rn,im) corri(cc,ARM_CMN|ARM_I,rn,0,im)
# define CMNI(rn,im) CC_CMNI(ARM_CC_AL,rn,im)
# define T2_CMNI(rn,im) torri(THUMB2_CMNI,rn,_R15_REGNO,im)
# define CC_TST(cc,rn,rm) corrr(cc,ARM_TST,rn,r0,rm)
# define TST(rn,rm) CC_TST(ARM_CC_AL,rn,rm)
# define T1_TST(rn,rm) is(THUMB_TST|(_u3(rm)<<3)|_u3(rn))
# define T2_TST(rn,rm) torrr(THUMB2_TST,rn,_R15_REGNO,rm)
# define CC_TSTI(cc,rn,im) corri(cc,ARM_TST|ARM_I,rn,0,im)
# define TSTI(rn,im) CC_TSTI(ARM_CC_AL,rn,im)
# define T2_TSTI(rn,im) torri(THUMB2_TSTI,rn,_R15_REGNO,im)
# define CC_TEQ(cc,rn,rm) corrr(cc,ARM_TEQ,rn,0,rm)
# define TEQ(rn,rm) CC_TEQ(ARM_CC_AL,rn,rm)
# define CC_TEQI(cc,rm,im) corri(cc,ARM_TEQ|ARM_I,rn,0,im)
# define TEQI(rn,im) CC_TEQI(ARM_CC_AL,rn,im)
# define CC_BX(cc,rm) cbx(cc,ARM_BX,rm)
# define BX(rm) CC_BX(ARM_CC_AL,rm)
# define T1_BX(rm) is(0x4700|(_u4(rm)<<3))
# define CC_BLX(cc,rm) cbx(cc,ARM_BLX,rm)
# define BLX(rm) CC_BLX(ARM_CC_AL,rm)
# define T1_BLX(rm) is(THUMB_BLX|(_u4(rm)<<3))
# define BLXI(im) blxi(im)
# define T2_BLXI(im) tb(THUMB2_BLXI,im)
# define CC_B(cc,im) cb(cc,ARM_B,im)
# define B(im) CC_B(ARM_CC_AL,im)
# define T1_CC_B(cc,im) tc8(cc,im)
# define T1_B(im) t11(im)
# define T2_CC_B(cc,im) tcb(cc,im)
# define T2_B(im) tb(THUMB2_B,im)
# define CC_BLI(cc,im) cb(cc,ARM_BLI,im)
# define BLI(im) CC_BLI(ARM_CC_AL,im)
# define T2_BLI(im) tb(THUMB2_BLI,im)
# define CC_LDRSB(cc,rt,rn,rm) corrr(cc,ARM_LDRSB|ARM_P,rn,rt,rm)
# define LDRSB(rt,rn,rm) CC_LDRSB(ARM_CC_AL,rt,rn,rm)
# define T1_LDRSB(rt,rn,rm) is(THUMB_LDRSB|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_LDRSB(rt,rn,rm) torxr(THUMB2_LDRSB,rn,rt,rm)
# define CC_LDRSBN(cc,rt,rn,rm) corrr(cc,ARM_LDRSB,rn,rt,rm)
# define LDRSBN(rt,rn,rm) CC_LDRSBN(ARM_CC_AL,rt,rn,rm)
# define CC_LDRSBI(cc,rt,rn,im) corri8(cc,ARM_LDRSBI|ARM_P,rn,rt,im)
# define LDRSBI(rt,rn,im) CC_LDRSBI(ARM_CC_AL,rt,rn,im)
# define T2_LDRSBI(rt,rn,im) torri8(THUMB2_LDRSBI|THUMB2_U,rn,rt,im)
# define T2_LDRSBWI(rt,rn,im) torri12(THUMB2_LDRSBWI,rn,rt,im)
# define CC_LDRSBIN(cc,rt,rn,im) corri8(cc,ARM_LDRSBI,rn,rt,im)
# define LDRSBIN(rt,rn,im) CC_LDRSBIN(ARM_CC_AL,rt,rn,im)
# define T2_LDRSBIN(rt,rn,im) torri8(THUMB2_LDRSBI,rn,rt,im)
# define CC_LDRB(cc,rt,rn,rm) corrr(cc,ARM_LDRB|ARM_P,rn,rt,rm)
# define LDRB(rt,rn,rm) CC_LDRB(ARM_CC_AL,rt,rn,rm)
# define T1_LDRB(rt,rn,rm) is(THUMB_LDRB|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_LDRB(rt,rn,rm) torxr(THUMB2_LDRB,rn,rt,rm)
# define CC_LDRBN(cc,rt,rn,rm) corrr(cc,ARM_LDRB,rn,rt,rm)
# define LDRBN(rt,rn,rm) CC_LDRBN(ARM_CC_AL,rt,rn,rm)
# define CC_LDRBI(cc,rt,rn,im) corri(cc,ARM_LDRBI|ARM_P,rn,rt,im)
# define LDRBI(rt,rn,im) CC_LDRBI(ARM_CC_AL,rt,rn,im)
# define T1_LDRBI(rt,rn,im) is(THUMB_LDRBI|(_u5(im)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_LDRBI(rt,rn,im) torri8(THUMB2_LDRBI|THUMB2_U,rn,rt,im)
# define T2_LDRBWI(rt,rn,im) torri12(THUMB2_LDRBWI,rn,rt,im)
# define CC_LDRBIN(cc,rt,rn,im) corri(cc,ARM_LDRBI,rn,rt,im)
# define LDRBIN(rt,rn,im) CC_LDRBIN(ARM_CC_AL,rt,rn,im)
# define T2_LDRBIN(rt,rn,im) torri8(THUMB2_LDRBI,rn,rt,im)
# define CC_LDRSH(cc,rt,rn,rm) corrr(cc,ARM_LDRSH|ARM_P,rn,rt,rm)
# define LDRSH(rt,rn,rm) CC_LDRSH(ARM_CC_AL,rt,rn,rm)
# define T1_LDRSH(rt,rn,rm) is(THUMB_LDRSH|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_LDRSH(rt,rn,rm) torxr(THUMB2_LDRSH,rn,rt,rm)
# define CC_LDRSHN(cc,rt,rn,rm) corrr(cc,ARM_LDRSH,rn,rt,rm)
# define LDRSHN(rt,rn,rm) CC_LDRSHN(ARM_CC_AL,rt,rn,rm)
# define CC_LDRSHI(cc,rt,rn,im) corri8(cc,ARM_LDRSHI|ARM_P,rn,rt,im)
# define LDRSHI(rt,rn,im) CC_LDRSHI(ARM_CC_AL,rt,rn,im)
# define T2_LDRSHI(rt,rn,im) torri8(THUMB2_LDRSHI|THUMB2_U,rn,rt,im)
# define T2_LDRSHWI(rt,rn,im) torri12(THUMB2_LDRSHWI,rn,rt,im)
# define CC_LDRSHIN(cc,rt,rn,im) corri8(cc,ARM_LDRSHI,rn,rt,im)
# define LDRSHIN(rt,rn,im) CC_LDRSHIN(ARM_CC_AL,rt,rn,im)
# define T2_LDRSHIN(rt,rn,im) torri8(THUMB2_LDRSHI,rn,rt,im)
# define CC_LDRH(cc,rt,rn,rm) corrr(cc,ARM_LDRH|ARM_P,rn,rt,rm)
# define LDRH(rt,rn,rm) CC_LDRH(ARM_CC_AL,rt,rn,rm)
# define T1_LDRH(rt,rn,rm) is(THUMB_LDRH|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_LDRH(rt,rn,rm) torxr(THUMB2_LDRH,rn,rt,rm)
# define CC_LDRHN(cc,rt,rn,rm) corrr(cc,ARM_LDRH,rn,rt,rm)
# define LDRHN(rt,rn,rm) CC_LDRHN(ARM_CC_AL,rt,rn,rm)
# define CC_LDRHI(cc,rt,rn,im) corri8(cc,ARM_LDRHI|ARM_P,rn,rt,im)
# define LDRHI(rt,rn,im) CC_LDRHI(ARM_CC_AL,rt,rn,im)
# define T1_LDRHI(rt,rn,im) is(THUMB_LDRHI|(_u5(im)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_LDRHI(rt,rn,im) torri8(THUMB2_LDRHI|THUMB2_U,rn,rt,im)
# define T2_LDRHWI(rt,rn,im) torri12(THUMB2_LDRHWI,rn,rt,im)
# define CC_LDRHIN(cc,rt,rn,im) corri8(cc,ARM_LDRHI,rn,rt,im)
# define LDRHIN(rt,rn,im) CC_LDRHIN(ARM_CC_AL,rt,rn,im)
# define T2_LDRHIN(rt,rn,im) torri8(THUMB2_LDRHI,rn,rt,im)
# define CC_LDR(cc,rt,rn,rm) corrr(cc,ARM_LDR|ARM_P,rn,rt,rm)
# define LDR(rt,rn,rm) CC_LDR(ARM_CC_AL,rt,rn,rm)
# define T1_LDR(rt,rn,rm) is(THUMB_LDR|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_LDR(rt,rn,rm) torxr(THUMB2_LDR,rn,rt,rm)
# define CC_LDRN(cc,rt,rn,rm) corrr(cc,ARM_LDR,rn,rt,rm)
# define LDRN(rt,rn,rm) CC_LDRN(ARM_CC_AL,rt,rn,rm)
# define CC_LDRI(cc,rt,rn,im) corri(cc,ARM_LDRI|ARM_P,rn,rt,im)
# define LDRI(rt,rn,im) CC_LDRI(ARM_CC_AL,rt,rn,im)
# define T1_LDRI(rt,rn,im) is(THUMB_LDRI|(_u5(im)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T1_LDRISP(rt,im) is(THUMB_LDRISP|(_u3(rt)<<8)|_u8(im))
# define T2_LDRI(rt,rn,im) torri8(THUMB2_LDRI|THUMB2_U,rn,rt,im)
# define T2_LDRWI(rt,rn,im) torri12(THUMB2_LDRWI,rn,rt,im)
# define CC_LDRIN(cc,rt,rn,im) corri(cc,ARM_LDRI,rn,rt,im)
# define LDRIN(rt,rn,im) CC_LDRIN(ARM_CC_AL,rt,rn,im)
# define T2_LDRIN(rt,rn,im) torri8(THUMB2_LDRI,rn,rt,im)
# define CC_LDRD(cc,rt,rn,rm) corrr(cc,ARM_LDRD|ARM_P,rn,rt,rm)
# define LDRD(rt,rn,rm) CC_LDRD(ARM_CC_AL,rt,rn,rm)
# define T2_LDRDI(rt,rt2,rn,im) torrri8(THUMB2_LDRDI|ARM_P,rn,rt,rt2,im)
# define CC_LDRDN(cc,rt,rn,rm) corrr(cc,ARM_LDRD,rn,rt,rm)
# define LDRDN(rd,rn,rm) CC_LDRDN(ARM_CC_AL,rt,rn,rm)
# define CC_LDRDI(cc,rt,rn,im) corri8(cc,ARM_LDRDI|ARM_P,rn,rt,im)
# define LDRDI(rt,rn,im) CC_LDRDI(ARM_CC_AL,rt,rn,im)
# define CC_LDRDIN(cc,rt,rn,im) corri8(cc,ARM_LDRDI,rn,rt,im)
# define LDRDIN(rt,rn,im) CC_LDRDIN(ARM_CC_AL,rt,rn,im)
# define T2_LDRDIN(rt,rt2,rn,im) torrri8(THUMB2_LDRDI,rn,rt,rt2,im)
# define CC_STRB(cc,rt,rn,rm) corrr(cc,ARM_STRB|ARM_P,rn,rt,rm)
# define STRB(rt,rn,rm) CC_STRB(ARM_CC_AL,rt,rn,rm)
# define T1_STRB(rt,rn,rm) is(THUMB_STRB|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_STRB(rt,rn,rm) torxr(THUMB2_STRB,rn,rt,rm)
# define CC_STRBN(cc,rt,rn,rm) corrr(cc,ARM_STRB,rn,rt,rm)
# define STRBN(rt,rn,rm) CC_STRBN(ARM_CC_AL,rt,rn,rm)
# define CC_STRBI(cc,rt,rn,im) corri(cc,ARM_STRBI|ARM_P,rn,rt,im)
# define STRBI(rt,rn,im) CC_STRBI(ARM_CC_AL,rt,rn,im)
# define T1_STRBI(rt,rn,im) is(THUMB_STRBI|(_u5(im)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_STRBI(rt,rn,im) torri8(THUMB2_STRBI|THUMB2_U,rn,rt,im)
# define T2_STRBWI(rt,rn,im) torri12(THUMB2_STRBWI,rn,rt,im)
# define CC_STRBIN(cc,rt,rn,im) corri(cc,ARM_STRBI,rn,rt,im)
# define STRBIN(rt,rn,im) CC_STRBIN(ARM_CC_AL,rt,rn,im)
# define T2_STRBIN(rt,rn,im) torri8(THUMB2_STRBI,rn,rt,im)
# define CC_STRH(cc,rt,rn,rm) corrr(cc,ARM_STRH|ARM_P,rn,rt,rm)
# define STRH(rt,rn,rm) CC_STRH(ARM_CC_AL,rt,rn,rm)
# define T1_STRH(rt,rn,rm) is(THUMB_STRH|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_STRH(rt,rn,rm) torxr(THUMB2_STRH,rn,rt,rm)
# define CC_STRHN(cc,rt,rn,rm) corrr(cc,ARM_STRH,rn,rt,rm)
# define STRHN(rt,rn,rm) CC_STRHN(ARM_CC_AL,rt,rn,rm)
# define CC_STRHI(cc,rt,rn,im) corri8(cc,ARM_STRHI|ARM_P,rn,rt,im)
# define STRHI(rt,rn,im) CC_STRHI(ARM_CC_AL,rt,rn,im)
# define T1_STRHI(rt,rn,im) is(THUMB_STRHI|(_u5(im)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_STRHI(rt,rn,im) torri8(THUMB2_STRHI|THUMB2_U,rn,rt,im)
# define T2_STRHWI(rt,rn,im) torri12(THUMB2_STRHWI,rn,rt,im)
# define CC_STRHIN(cc,rt,rn,im) corri8(cc,ARM_STRHI,rn,rt,im)
# define STRHIN(rt,rn,im) CC_STRHIN(ARM_CC_AL,rt,rn,im)
# define T2_STRHIN(rt,rn,im) torri8(THUMB2_STRHI,rn,rt,im)
# define CC_STR(cc,rt,rn,rm) corrr(cc,ARM_STR|ARM_P,rn,rt,rm)
# define STR(rt,rn,rm) CC_STR(ARM_CC_AL,rt,rn,rm)
# define T1_STR(rt,rn,rm) is(THUMB_STR|(_u3(rm)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T2_STR(rt,rn,rm) torxr(THUMB2_STR,rn,rt,rm)
# define CC_STRN(cc,rt,rn,rm) corrr(cc,ARM_STR,rn,rt,rm)
# define STRN(rt,rn,rm) CC_STRN(ARM_CC_AL,rt,rn,rm)
# define CC_STRI(cc,rt,rn,im) corri(cc,ARM_STRI|ARM_P,rn,rt,im)
# define STRI(rt,rn,im) CC_STRI(ARM_CC_AL,rt,rn,im)
# define T1_STRI(rt,rn,im) is(THUMB_STRI|(_u5(im)<<6)|(_u3(rn)<<3)|_u3(rt))
# define T1_STRISP(rt,im) is(THUMB_STRISP|(_u3(rt)<<8)|(_u8(im)))
# define T2_STRI(rt,rn,im) torri8(THUMB2_STRI|THUMB2_U,rn,rt,im)
# define T2_STRWI(rt,rn,im) torri12(THUMB2_STRWI,rn,rt,im)
# define CC_STRIN(cc,rt,rn,im) corri(cc,ARM_STRI,rn,rt,im)
# define STRIN(rt,rn,im) CC_STRIN(ARM_CC_AL,rt,rn,im)
# define T2_STRIN(rt,rn,im) torri8(THUMB2_STRI,rn,rt,im)
# define CC_STRD(cc,rt,rn,rm) corrr(cc,ARM_STRD|ARM_P,rn,rt,rm)
# define STRD(rt,rn,rm) CC_STRD(ARM_CC_AL,rt,rn,rm)
# define CC_STRDN(cc,rt,rn,rm) corrr(cc,ARM_STRD,rn,rt,rm)
# define STRDN(rt,rn,rm) CC_STRDN(ARM_CC_AL,rt,rn,rm)
# define CC_STRDI(cc,rt,rn,im) corri8(cc,ARM_STRDI|ARM_P,rn,rt,im)
# define STRDI(rt,rn,im) CC_STRDI(ARM_CC_AL,rt,rn,im)
# define T2_STRDI(rt,rt2,rn,im) torrri8(THUMB2_STRDI|ARM_P,rn,rt,rt2,im)
# define CC_STRDIN(cc,rt,rn,im) corri8(cc,ARM_STRDI,rn,rt,im)
# define STRDIN(rt,rn,im) CC_STRDIN(ARM_CC_AL,rt,rn,im)
# define T2_STRDIN(rt,rt2,rn,im) torrri8(THUMB2_STRDI,rn,rt,rt2,im)
# define CC_LDMIA(cc,rn,im) corl(cc,ARM_M|ARM_M_L|ARM_M_I,rn,im)
# define LDMIA(rn,im) CC_LDMIA(ARM_CC_AL,rn,im)
# define CC_LDM(cc,rn,im) CC_LDMIA(cc,rn,im)
# define LDM(rn,im) LDMIA(rn,im)
# define T1_LDMIA(rn,im) is(THUMB_LDMIA|(_u3(rn)<<8)|im)
# define T2_LDMIA(rn,im) torl(THUMB2_LDMIA,rn,im)
# define CC_LDMIA_U(cc,rn,im) corl(cc,ARM_M|ARM_M_L|ARM_M_I|ARM_M_U,rn,im)
# define LDMIA_U(rn,im) CC_LDMIA_U(ARM_CC_AL,rn,im)
# define LDM_U(r0,i0) LDMIA_U(r0,i0)
# define CC_LDMIB(cc,rn,im) corl(cc,ARM_M|ARM_M_L|ARM_M_I|ARM_M_B,rn,im)
# define LDMIB(rn,im) CC_LDMIB(ARM_CC_AL,rn,im)
# define CC_LDMIB_U(cc,rn,im) corl(cc,ARM_M|ARM_M_L|ARM_M_I|ARM_M_B|ARM_M_U,rn,im)
# define LDMIB_U(rn,im) CC_LDMIB_U(ARM_CC_AL,rn,im)
# define CC_LDMDA(cc,rn,im) corl(cc,ARM_M|ARM_M_L,rn,im)
# define LDMDA(rn,im) CC_LDMDA(ARM_CC_AL,rn,im)
# define CC_LDMDA_U(cc,rn,im) corl(cc,ARM_M|ARM_M_L|ARM_M_U,rn,im)
# define LDMDA_U(rn,im) CC_LDMDA_U(ARM_CC_AL,rn,im)
# define CC_LDMDB(cc,rn,im) corl(cc,ARM_M|ARM_M_L|ARM_M_B,rn,im)
# define LDMDB(rn,im) CC_LDMDB(ARM_CC_AL,rn,im)
# define T2_LDMDB(rn,im) torl(THUMB2_LDMDB,rn,im)
# define CC_LDMDB_U(cc,rn,im) corl(cc,ARM_M|ARM_M_L|ARM_M_B|ARM_M_U,rn,im)
# define LDMDB_U(rn,im) CC_LDMDB_U(ARM_CC_AL,rn,im)
# define CC_STMIA(cc,rn,im) corl(cc,ARM_M|ARM_M_I,rn,im)
# define STMIA(rn,im) CC_STMIA(ARM_CC_AL,rn,im)
# define CC_STM(cc,rn,im) CC_STMIA(cc,rn,im)
# define STM(rn,im) STMIA(rn,im)
# define CC_STMIA_U(cc,rn,im) corl(cc,ARM_M|ARM_M_I|ARM_M_U,rn,im)
# define STMIA_U(rn,im) CC_STMIA_U(ARM_CC_AL,rn,im)
# define CC_STM_U(cc,rn,im) CC_STMIA_U(cc,rn,im)
# define STM_U(rn,im) STMIA_U(rn,im)
# define CC_STMIB(cc,rn,im) corl(cc,ARM_M|ARM_M_I|ARM_M_B,rn,im)
# define STMIB(rn,im) CC_STMIB(ARM_CC_AL,rn,im)
# define CC_STMIB_U(cc,rn,im) corl(cc,ARM_M|ARM_M_I|ARM_M_B|ARM_M_U,rn,im)
# define STMIB_U(rn,im) CC_STMIB_U(ARM_CC_AL,rn,im)
# define CC_STMDA(cc,rn,im) corl(cc,ARM_M,rn,im)
# define STMDA(rn,im) CC_STMDA(ARM_CC_AL,rn,im)
# define CC_STMDA_U(cc,rn,im) corl(cc,ARM_M|ARM_M_U,rn,im)
# define STMDA_U(rn,im) CC_STMDA_U(ARM_CC_AL,rn,im)
# define CC_STMDB(cc,rn,im) corl(cc,ARM_M|ARM_M_B,rn,im)
# define STMDB(rn,im) CC_STMDB(ARM_CC_AL,rn,im)
# define CC_STMDB_U(cc,rn,im) corl(cc,ARM_M|ARM_M_B|ARM_M_U,rn,im)
# define STMDB_U(rn,im) CC_STMDB_U(ARM_CC_AL,rn,im)
# define CC_PUSH(cc,im) CC_STMDB_U(cc,_SP_REGNO,im)
# define PUSH(im) STMDB_U(_SP_REGNO,im)
# define T1_PUSH(im) is(THUMB_PUSH|((im&0x4000)>>6)|(im&0xff))
# define T2_PUSH(im) tpp(THUMB2_PUSH,im)
# define CC_POP(cc,im) LDMIA_U(cc,_SP_REGNO,im)
# define POP(im) LDMIA_U(_SP_REGNO,im)
# define T1_POP(im) is(THUMB_POP|((im&0x8000)>>7)|(im&0xff))
# define T2_POP(im) tpp(THUMB2_POP,im)
# define jit_get_reg_args() \
do { \
(void)jit_get_reg(_R0|jit_class_named|jit_class_gpr); \
(void)jit_get_reg(_R1|jit_class_named|jit_class_gpr); \
(void)jit_get_reg(_R2|jit_class_named|jit_class_gpr); \
(void)jit_get_reg(_R3|jit_class_named|jit_class_gpr); \
} while (0)
# define jit_unget_reg_args() \
do { \
jit_unget_reg(_R3); \
jit_unget_reg(_R2); \
jit_unget_reg(_R1); \
jit_unget_reg(_R0); \
} while (0)
# define nop(i0) _nop(_jit,i0)
static void _nop(jit_state_t*,jit_int32_t);
# define movr(r0,r1) _movr(_jit,r0,r1)
static void _movr(jit_state_t*,jit_int32_t,jit_int32_t);
# define movi(r0,i0) _movi(_jit,r0,i0)
static void _movi(jit_state_t*,jit_int32_t,jit_word_t);
# define movi_p(r0,i0) _movi_p(_jit,r0,i0)
static jit_word_t _movi_p(jit_state_t*,jit_int32_t,jit_word_t);
# define comr(r0,r1) _comr(_jit,r0,r1)
static void _comr(jit_state_t*,jit_int32_t,jit_int32_t);
# define negr(r0,r1) _negr(_jit,r0,r1)
static void _negr(jit_state_t*,jit_int32_t,jit_int32_t);
# define addr(r0,r1,r2) _addr(_jit,r0,r1,r2)
static void _addr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define addi(r0,r1,i0) _addi(_jit,r0,r1,i0)
static void _addi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define addcr(r0,r1,r2) _addcr(_jit,r0,r1,r2)
static void _addcr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define addci(r0,r1,i0) _addci(_jit,r0,r1,i0)
static void _addci(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define addxr(r0,r1,r2) _addxr(_jit,r0,r1,r2)
static void _addxr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define addxi(r0,r1,i0) _addxi(_jit,r0,r1,i0)
static void _addxi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define subr(r0,r1,r2) _subr(_jit,r0,r1,r2)
static void _subr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define subi(r0,r1,i0) _subi(_jit,r0,r1,i0)
static void _subi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define subcr(r0,r1,r2) _subcr(_jit,r0,r1,r2)
static void _subcr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define subci(r0,r1,i0) _subci(_jit,r0,r1,i0)
static void _subci(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define subxr(r0,r1,r2) _subxr(_jit,r0,r1,r2)
static void _subxr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define subxi(r0,r1,i0) _subxi(_jit,r0,r1,i0)
static void _subxi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define rsbi(r0, r1, i0) _rsbi(_jit, r0, r1, i0)
static void _rsbi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define mulr(r0,r1,r2) _mulr(_jit,r0,r1,r2)
static void _mulr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define muli(r0,r1,i0) _muli(_jit,r0,r1,i0)
static void _muli(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define qmulr(r0,r1,r2,r3) iqmulr(r0,r1,r2,r3,1)
# define qmulr_u(r0,r1,r2,r3) iqmulr(r0,r1,r2,r3,0)
# define iqmulr(r0,r1,r2,r3,cc) _iqmulr(_jit,r0,r1,r2,r3,cc)
static void _iqmulr(jit_state_t*,jit_int32_t,jit_int32_t,
jit_int32_t,jit_int32_t,jit_bool_t);
# define qmuli(r0,r1,r2,i0) iqmuli(r0,r1,r2,i0,1)
# define qmuli_u(r0,r1,r2,i0) iqmuli(r0,r1,r2,i0,0)
# define iqmuli(r0,r1,r2,i0,cc) _iqmuli(_jit,r0,r1,r2,i0,cc)
static void _iqmuli(jit_state_t*,jit_int32_t,jit_int32_t,
jit_int32_t,jit_word_t,jit_bool_t);
# define divrem(d,s,r0,r1,r2) _divrem(_jit,d,s,r0,r1,r2)
static void _divrem(jit_state_t*,int,int,jit_int32_t,jit_int32_t,jit_int32_t);
# define divr(r0,r1,r2) _divr(_jit,r0,r1,r2)
static void _divr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define divi(r0,r1,i0) _divi(_jit,r0,r1,i0)
static void _divi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define divr_u(r0,r1,r2) _divr_u(_jit,r0,r1,r2)
static void _divr_u(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define divi_u(r0,r1,i0) _divi_u(_jit,r0,r1,i0)
static void _divi_u(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define qdivr(r0,r1,r2,r3) iqdivr(r0,r1,r2,r3,1)
# define qdivr_u(r0,r1,r2,r3) iqdivr(r0,r1,r2,r3,0)
# define iqdivr(r0,r1,r2,r3,cc) _iqdivr(_jit,r0,r1,r2,r3,cc)
static void _iqdivr(jit_state_t*,jit_int32_t,jit_int32_t,
jit_int32_t,jit_int32_t,jit_bool_t);
# define qdivi(r0,r1,r2,i0) iqdivi(r0,r1,r2,i0,1)
# define qdivi_u(r0,r1,r2,i0) iqdivi(r0,r1,r2,i0,0)
# define iqdivi(r0,r1,r2,i0,cc) _iqdivi(_jit,r0,r1,r2,i0,cc)
static void _iqdivi(jit_state_t*,jit_int32_t,jit_int32_t,
jit_int32_t,jit_word_t,jit_bool_t);
# define remr(r0,r1,r2) _remr(_jit,r0,r1,r2)
static void _remr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define remi(r0,r1,i0) _remi(_jit,r0,r1,i0)
static void _remi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define remr_u(r0,r1,r2) _remr_u(_jit,r0,r1,r2)
static void _remr_u(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define remi_u(r0,r1,i0) _remi_u(_jit,r0,r1,i0)
static void _remi_u(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define andr(r0,r1,r2) _andr(_jit,r0,r1,r2)
static void _andr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define andi(r0,r1,i0) _andi(_jit,r0,r1,i0)
static void _andi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define orr(r0,r1,r2) _orr(_jit,r0,r1,r2)
static void _orr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define ori(r0,r1,i0) _ori(_jit,r0,r1,i0)
static void _ori(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define xorr(r0,r1,r2) _xorr(_jit,r0,r1,r2)
static void _xorr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define xori(r0,r1,i0) _xori(_jit,r0,r1,i0)
static void _xori(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define lshr(r0,r1,r2) _lshr(_jit,r0,r1,r2)
static void _lshr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define lshi(r0,r1,i0) _lshi(_jit,r0,r1,i0)
static void _lshi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define rshr(r0,r1,r2) _rshr(_jit,r0,r1,r2)
static void _rshr(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define rshi(r0,r1,i0) _rshi(_jit,r0,r1,i0)
static void _rshi(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define rshr_u(r0,r1,r2) _rshr_u(_jit,r0,r1,r2)
static void _rshr_u(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define rshi_u(r0,r1,i0) _rshi_u(_jit,r0,r1,i0)
static void _rshi_u(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define ccr(ct,cf,r0,r1,r2) _ccr(_jit,ct,cf,r0,r1,r2)
static void _ccr(jit_state_t*,int,int,jit_int32_t,jit_int32_t,jit_int32_t);
# define cci(ct,cf,r0,r1,i0) _cci(_jit,ct,cf,r0,r1,i0)
static void _cci(jit_state_t*,int,int,jit_int32_t,jit_int32_t,jit_word_t);
# define ltr(r0, r1, r2) ccr(ARM_CC_LT,ARM_CC_GE,r0,r1,r2)
# define lti(r0, r1, i0) cci(ARM_CC_LT,ARM_CC_GE,r0,r1,i0)
# define ltr_u(r0, r1, r2) ccr(ARM_CC_LO,ARM_CC_HS,r0,r1,r2)
# define lti_u(r0, r1, i0) cci(ARM_CC_LO,ARM_CC_HS,r0,r1,i0)
# define ler(r0, r1, r2) ccr(ARM_CC_LE,ARM_CC_GT,r0,r1,r2)
# define lei(r0, r1, i0) cci(ARM_CC_LE,ARM_CC_GT,r0,r1,i0)
# define ler_u(r0, r1, r2) ccr(ARM_CC_LS,ARM_CC_HI,r0,r1,r2)
# define lei_u(r0, r1, i0) cci(ARM_CC_LS,ARM_CC_HI,r0,r1,i0)
# define eqr(r0, r1, r2) ccr(ARM_CC_EQ,ARM_CC_NE,r0,r1,r2)
# define eqi(r0, r1, i0) cci(ARM_CC_EQ,ARM_CC_NE,r0,r1,i0)
# define ger(r0, r1, r2) ccr(ARM_CC_GE,ARM_CC_LT,r0,r1,r2)
# define gei(r0, r1, i0) cci(ARM_CC_GE,ARM_CC_LT,r0,r1,i0)
# define ger_u(r0, r1, r2) ccr(ARM_CC_HS,ARM_CC_LO,r0,r1,r2)
# define gei_u(r0, r1, i0) cci(ARM_CC_HS,ARM_CC_LO,r0,r1,i0)
# define gtr(r0, r1, r2) ccr(ARM_CC_GT,ARM_CC_LE,r0,r1,r2)
# define gti(r0, r1, i0) cci(ARM_CC_GT,ARM_CC_LE,r0,r1,i0)
# define gtr_u(r0, r1, r2) ccr(ARM_CC_HI,ARM_CC_LS,r0,r1,r2)
# define gti_u(r0, r1, i0) cci(ARM_CC_HI,ARM_CC_LS,r0,r1,i0)
# define ner(r0,r1,r2) _ner(_jit,r0,r1,r2)
static void _ner(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define nei(r0,r1,i0) _nei(_jit,r0,r1,i0)
static void _nei(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define jmpr(r0) _jmpr(_jit,r0)
static void _jmpr(jit_state_t*,jit_int32_t);
# define jmpi(i0) _jmpi(_jit,i0)
static void _jmpi(jit_state_t*,jit_word_t);
# define jmpi_p(i0, i1) _jmpi_p(_jit,i0, i1)
static jit_word_t _jmpi_p(jit_state_t*,jit_word_t,jit_bool_t);
# define bccr(cc,i0,r0,r1) _bccr(_jit,cc,i0,r0,r1)
static jit_word_t _bccr(jit_state_t*,int,jit_word_t,jit_int32_t,jit_int32_t);
# define bcci(cc,i0,r0,i1) _bcci(_jit,cc,i0,r0,i1)
static jit_word_t _bcci(jit_state_t*,int,jit_word_t,jit_int32_t,jit_word_t);
# define bltr(i0, r0, r1) bccr(ARM_CC_LT,i0,r0,r1)
# define blti(i0, r0, i1) bcci(ARM_CC_LT,i0,r0,i1)
# define bltr_u(i0, r0, r1) bccr(ARM_CC_LO,i0,r0,r1)
# define blti_u(i0, r0, i1) bcci(ARM_CC_LO,i0,r0,i1)
# define bler(i0, r0, r1) bccr(ARM_CC_LE,i0,r0,r1)
# define blei(i0, r0, i1) bcci(ARM_CC_LE,i0,r0,i1)
# define bler_u(i0, r0, r1) bccr(ARM_CC_LS,i0,r0,r1)
# define blei_u(i0, r0, i1) bcci(ARM_CC_LS,i0,r0,i1)
# define beqr(i0, r0, r1) bccr(ARM_CC_EQ,i0,r0,r1)
# define beqi(i0, r0, i1) bcci(ARM_CC_EQ,i0,r0,i1)
# define bger(i0, r0, r1) bccr(ARM_CC_GE,i0,r0,r1)
# define bgei(i0, r0, i1) bcci(ARM_CC_GE,i0,r0,i1)
# define bger_u(i0, r0, r1) bccr(ARM_CC_HS,i0,r0,r1)
# define bgei_u(i0, r0, i1) bcci(ARM_CC_HS,i0,r0,i1)
# define bgtr(i0, r0, r1) bccr(ARM_CC_GT,i0,r0,r1)
# define bgti(i0, r0, i1) bcci(ARM_CC_GT,i0,r0,i1)
# define bgtr_u(i0, r0, r1) bccr(ARM_CC_HI,i0,r0,r1)
# define bgti_u(i0, r0, i1) bcci(ARM_CC_HI,i0,r0,i1)
# define bner(i0, r0, r1) bccr(ARM_CC_NE,i0,r0,r1)
# define bnei(i0, r0, i1) bcci(ARM_CC_NE,i0,r0,i1)
# define baddr(cc,i0,r0,r1) _baddr(_jit,cc,i0,r0,r1)
static jit_word_t _baddr(jit_state_t*,int,jit_word_t,jit_int32_t,jit_int32_t);
# define baddi(cc,i0,r0,r1) _baddi(_jit,cc,i0,r0,r1)
static jit_word_t _baddi(jit_state_t*,int,jit_word_t,jit_int32_t,jit_word_t);
# define boaddr(i0,r0,r1) baddr(ARM_CC_VS,i0,r0,r1)
# define boaddi(i0,r0,i1) baddi(ARM_CC_VS,i0,r0,i1)
# define boaddr_u(i0,r0,r1) baddr(ARM_CC_HS,i0,r0,r1)
# define boaddi_u(i0,r0,i1) baddi(ARM_CC_HS,i0,r0,i1)
# define bxaddr(i0,r0,r1) baddr(ARM_CC_VC,i0,r0,r1)
# define bxaddi(i0,r0,i1) baddi(ARM_CC_VC,i0,r0,i1)
# define bxaddr_u(i0,r0,r1) baddr(ARM_CC_LO,i0,r0,r1)
# define bxaddi_u(i0,r0,i1) baddi(ARM_CC_LO,i0,r0,i1)
# define bsubr(cc,i0,r0,r1) _bsubr(_jit,cc,i0,r0,r1)
static jit_word_t _bsubr(jit_state_t*,int,jit_word_t,jit_int32_t,jit_int32_t);
# define bsubi(cc,i0,r0,r1) _bsubi(_jit,cc,i0,r0,r1)
static jit_word_t _bsubi(jit_state_t*,int,jit_word_t,jit_int32_t,jit_word_t);
# define bosubr(i0,r0,r1) bsubr(ARM_CC_VS,i0,r0,r1)
# define bosubi(i0,r0,i1) bsubi(ARM_CC_VS,i0,r0,i1)
# define bosubr_u(i0,r0,r1) bsubr(ARM_CC_LO,i0,r0,r1)
# define bosubi_u(i0,r0,i1) bsubi(ARM_CC_LO,i0,r0,i1)
# define bxsubr(i0,r0,r1) bsubr(ARM_CC_VC,i0,r0,r1)
# define bxsubi(i0,r0,i1) bsubi(ARM_CC_VC,i0,r0,i1)
# define bxsubr_u(i0,r0,r1) bsubr(ARM_CC_HS,i0,r0,r1)
# define bxsubi_u(i0,r0,i1) bsubi(ARM_CC_HS,i0,r0,i1)
# define bmxr(cc,i0,r0,r1) _bmxr(_jit,cc,i0,r0,r1)
static jit_word_t _bmxr(jit_state_t*,int,jit_word_t,jit_int32_t,jit_int32_t);
# define bmxi(cc,i0,r0,r1) _bmxi(_jit,cc,i0,r0,r1)
static jit_word_t _bmxi(jit_state_t*,int,jit_word_t,jit_int32_t,jit_word_t);
# define bmsr(i0,r0,r1) bmxr(ARM_CC_NE,i0,r0,r1)
# define bmsi(i0,r0,i1) bmxi(ARM_CC_NE,i0,r0,i1)
# define bmcr(i0,r0,r1) bmxr(ARM_CC_EQ,i0,r0,r1)
# define bmci(i0,r0,i1) bmxi(ARM_CC_EQ,i0,r0,i1)
# define ldr_c(r0,r1) _ldr_c(_jit,r0,r1)
static void _ldr_c(jit_state_t*,jit_int32_t,jit_int32_t);
# define ldi_c(r0,i0) _ldi_c(_jit,r0,i0)
static void _ldi_c(jit_state_t*,jit_int32_t,jit_word_t);
# define ldxr_c(r0,r1,r2) _ldxr_c(_jit,r0,r1,r2)
static void _ldxr_c(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define ldxi_c(r0,r1,i0) _ldxi_c(_jit,r0,r1,i0)
static void _ldxi_c(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define ldr_uc(r0,r1) _ldr_uc(_jit,r0,r1)
static void _ldr_uc(jit_state_t*,jit_int32_t,jit_int32_t);
# define ldi_uc(r0,i0) _ldi_uc(_jit,r0,i0)
static void _ldi_uc(jit_state_t*,jit_int32_t,jit_word_t);
# define ldxr_uc(r0,r1,r2) _ldxr_uc(_jit,r0,r1,r2)
static void _ldxr_uc(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define ldxi_uc(r0,r1,i0) _ldxi_uc(_jit,r0,r1,i0)
static void _ldxi_uc(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define ldr_s(r0,r1) _ldr_s(_jit,r0,r1)
static void _ldr_s(jit_state_t*,jit_int32_t,jit_int32_t);
# define ldi_s(r0,i0) _ldi_s(_jit,r0,i0)
static void _ldi_s(jit_state_t*,jit_int32_t,jit_word_t);
# define ldxr_s(r0,r1,r2) _ldxr_s(_jit,r0,r1,r2)
static void _ldxr_s(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define ldxi_s(r0,r1,i0) _ldxi_s(_jit,r0,r1,i0)
static void _ldxi_s(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define ldr_us(r0,r1) _ldr_us(_jit,r0,r1)
static void _ldr_us(jit_state_t*,jit_int32_t,jit_int32_t);
# define ldi_us(r0,i0) _ldi_us(_jit,r0,i0)
static void _ldi_us(jit_state_t*,jit_int32_t,jit_word_t);
# define ldxr_us(r0,r1,r2) _ldxr_us(_jit,r0,r1,r2)
static void _ldxr_us(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define ldxi_us(r0,r1,i0) _ldxi_us(_jit,r0,r1,i0)
static void _ldxi_us(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define ldr_i(r0,r1) _ldr_i(_jit,r0,r1)
static void _ldr_i(jit_state_t*,jit_int32_t,jit_int32_t);
# define ldi_i(r0,i0) _ldi_i(_jit,r0,i0)
static void _ldi_i(jit_state_t*,jit_int32_t,jit_word_t);
# define ldxr_i(r0,r1,r2) _ldxr_i(_jit,r0,r1,r2)
static void _ldxr_i(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define ldxi_i(r0,r1,i0) _ldxi_i(_jit,r0,r1,i0)
static void _ldxi_i(jit_state_t*,jit_int32_t,jit_int32_t,jit_word_t);
# define str_c(r0,r1) _str_c(_jit,r0,r1)
static void _str_c(jit_state_t*,jit_int32_t,jit_int32_t);
# define sti_c(i0,r0) _sti_c(_jit,i0,r0)
static void _sti_c(jit_state_t*,jit_word_t,jit_int32_t);
# define stxr_c(r0,r1,r2) _stxr_c(_jit,r0,r1,r2)
static void _stxr_c(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define stxi_c(r0,r1,i0) _stxi_c(_jit,r0,r1,i0)
static void _stxi_c(jit_state_t*,jit_word_t,jit_int32_t,jit_int32_t);
# define str_s(r0,r1) _str_s(_jit,r0,r1)
static void _str_s(jit_state_t*,jit_int32_t,jit_int32_t);
# define sti_s(i0,r0) _sti_s(_jit,i0,r0)
static void _sti_s(jit_state_t*,jit_word_t,jit_int32_t);
# define stxr_s(r0,r1,r2) _stxr_s(_jit,r0,r1,r2)
static void _stxr_s(jit_state_t*,jit_int32_t,jit_int32_t,jit_int32_t);
# define stxi_s(r0,r1,i0) _stxi_s(_jit,r0,r1,i0)
static void _stxi_s(jit_state_t*,jit_word_t,jit_int32_t,jit_int32_t);
# define str_i(r0,r1) _str_i(_jit,r0,r1)
static void _str_i(jit_state_t*,jit_int32_t,jit_int32_t);
# define sti_i(i0,r0) _sti_i(_jit,i0,r0)
static void _sti_i(jit_state_t*,jit_word_t,jit_int32_t);
# define stxr_i(r0,r1,r2) _stxr_i(_jit,r0,r1,r2)
static void _stxr_i(jit_state_t*,jit_word_t,jit_int32_t,jit_int32_t);
# define stxi_i(r0,r1,i0) _stxi_i(_jit,r0,r1,i0)
static void _stxi_i(jit_state_t*,jit_word_t,jit_int32_t,jit_int32_t);
# if __BYTE_ORDER == __LITTLE_ENDIAN
# define htonr_us(r0,r1) _htonr_us(_jit,r0,r1)
static void _htonr_us(jit_state_t*,jit_int32_t,jit_int32_t);
# define htonr_ui(r0,r1) _htonr_ui(_jit,r0,r1)
static void _htonr_ui(jit_state_t*,jit_int32_t,jit_int32_t);
# else
# define htonr_us(r0,r1) extr_us(r0,r1)
# define htonr(r0,r1) movr(r0,r1)
# endif
# define extr_c(r0,r1) _extr_c(_jit,r0,r1)
static void _extr_c(jit_state_t*,jit_int32_t,jit_int32_t);
# define extr_uc(r0,r1) _extr_uc(_jit,r0,r1)
static void _extr_uc(jit_state_t*,jit_int32_t,jit_int32_t);
# define extr_s(r0,r1) _extr_s(_jit,r0,r1)
static void _extr_s(jit_state_t*,jit_int32_t,jit_int32_t);
# define extr_us(r0,r1) _extr_us(_jit,r0,r1)
static void _extr_us(jit_state_t*,jit_int32_t,jit_int32_t);
# define prolog(i0) _prolog(_jit,i0)
static void _prolog(jit_state_t*,jit_node_t*);
# define epilog(i0) _epilog(_jit,i0)
static void _epilog(jit_state_t*,jit_node_t*);
# define callr(r0) _callr(_jit,r0)
static void _callr(jit_state_t*,jit_int32_t);
# define calli(i0) _calli(_jit,i0)
static void _calli(jit_state_t*,jit_word_t);
# define calli_p(i0) _calli_p(_jit,i0)
static jit_word_t _calli_p(jit_state_t*,jit_word_t);
# define vastart(r0) _vastart(_jit, r0)
static void _vastart(jit_state_t*, jit_int32_t);
# define vaarg(r0, r1) _vaarg(_jit, r0, r1)
static void _vaarg(jit_state_t*, jit_int32_t, jit_int32_t);
# define patch_at(kind,jump,label) _patch_at(_jit,kind,jump,label)
static void _patch_at(jit_state_t*,jit_int32_t,jit_word_t,jit_word_t);
#endif
#if CODE
/* from binutils */
# define rotate_left(v, n) (v << n | v >> (32 - n))
static int
encode_arm_immediate(unsigned int v)
{
unsigned int a, i;
for (i = 0; i < 32; i += 2)
if ((a = rotate_left(v, i)) <= 0xff)
return (a | (i << 7));
return (-1);
}
static int
encode_thumb_immediate(unsigned int v)
{
int i;
unsigned int m;
unsigned int n;
/* 00000000 00000000 00000000 abcdefgh */
if ((v & 0xff) == v)
return (v);
/* 00000000 abcdefgh 00000000 abcdefgh */
if ((v & 0xff00ff) == v && ((v & 0xff0000) >> 16) == (v & 0xff))
return ((v & 0xff) | (1 << 12));
/* abcdefgh 00000000 abcdefgh 00000000 */
if (((v & 0xffff0000) >> 16) == (v & 0xffff) && (v & 0xff) == 0)
return ((v & 0x000000ff) | (2 << 12));
/* abcdefgh abcdefgh abcdefgh abcdefgh */
if ( (v & 0xff) == ((v & 0xff00) >> 8) &&
((v & 0xff00) >> 8) == ((v & 0xff0000) >> 16) &&
((v & 0xff0000) << 8) == (v & 0xff000000))
return ((v & 0xff) | (3 << 12));
/* 1bcdefgh << 24 ... 1bcdefgh << 1 */
for (i = 8, m = 0xff000000, n = 0x80000000;
i < 23; i++, m >>= 1, n >>= 1) {
if ((v & m) == v && (v & n)) {
v >>= 32 - i;
if (!(i & 1))
v &= 0x7f;
i >>= 1;
return (((i & 7) << 12) | ((i & 8) << 23) | v);
}
}
return (-1);
}
static int
encode_thumb_word_immediate(unsigned int v)
{
if ((v & 0xfffff000) == 0)
return (((v & 0x800) << 15) | ((v & 0x700) << 4) | (v & 0xff));
return (-1);
}
static int
encode_thumb_jump(int v)
{
int s, i1, i2, j1, j2;
if (v >= (int)-0x800000 && v <= 0x7fffff) {
s = !!(v & 0x800000);
i1 = !!(v & 0x400000);
i2 = !!(v & 0x200000);
j1 = s ? i1 : !i1;
j2 = s ? i2 : !i2;
return ((s<<26)|((v&0x1ff800)<<5)|(j1<<13)|(j2<<11)|(v&0x7ff));
}
return (-1);
}
static int
encode_thumb_cc_jump(int v)
{
int s, j1, j2;
if (v >= (int)-0x80000 && v <= 0x7ffff) {
s = !!(v & 0x80000);
j1 = !!(v & 0x20000);
j2 = !!(v & 0x40000);
return ((s<<26)|((v&0x1f800)<<5)|(j1<<13)|(j2<<11)|(v&0x7ff));
}
return (-1);
}
static int
encode_thumb_shift(int v, int type)
{
switch (type) {
case ARM_ASR:
case ARM_LSL:
case ARM_LSR: type >>= 1; break;
default: assert(!"handled shift");
}
assert(v >= 0 && v <= 31);
return (((v & 0x1c) << 10) | ((v & 3) << 6) | type);
}
static void
_tcit(jit_state_t *_jit, unsigned int tc, int it)
{
int c;
int m;
c = (tc >> 28) & 1;
assert(!(tc & 0xfffffff) && tc != ARM_CC_NV);
switch (it) {
case THUMB2_IT: m = 1<<3; break;
case THUMB2_ITT: m = (c<<3)| (1<<2); break;
case THUMB2_ITE: m = (!c<<3)| (1<<2); break;
case THUMB2_ITTT: m = (c<<3)| (c<<2)| (1<<1); break;
case THUMB2_ITET: m = (!c<<3)| (c<<2)| (1<<1); break;
case THUMB2_ITTE: m = (c<<3)|(!c<<2)| (1<<1); break;
case THUMB2_ITEE: m = (!c<<3)|(!c<<2)| (1<<1); break;
case THUMB2_ITTTT: m = (c<<3)| (c<<2)| (c<<1)|1; break;
case THUMB2_ITETT: m = (!c<<3)| (c<<2)| (c<<1)|1; break;
case THUMB2_ITTET: m = (c<<3)|(!c<<2)| (c<<1)|1; break;
case THUMB2_ITEET: m = (!c<<3)|(!c<<2)| (c<<1)|1; break;
case THUMB2_ITTTE: m = (c<<3)| (c<<2)|(!c<<1)|1; break;
case THUMB2_ITETE: m = (!c<<3)| (c<<2)|(!c<<1)|1; break;
case THUMB2_ITTEE: m = (c<<3)|(!c<<2)|(!c<<1)|1; break;
case THUMB2_ITEEE: m = (!c<<3)|(!c<<2)|(!c<<1)|1; break;
default: abort();
}
assert(m && (tc != ARM_CC_AL || !(m & (m - 1))));
is(0xbf00 | (tc >> 24) | m);
}
static void
_corrr(jit_state_t *_jit, int cc, int o, int rn, int rd, int rm)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf00fff0f));
ii(cc|o|(_u4(rn)<<16)|(_u4(rd)<<12)|_u4(rm));
}
static void
_corri(jit_state_t *_jit, int cc, int o, int rn, int rd, int im)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf00fffff));
assert(!(im & 0xfffff000));
ii(cc|o|(_u4(rn)<<16)|(_u4(rd)<<12)|_u12(im));
}
static void
_corri8(jit_state_t *_jit, int cc, int o, int rn, int rt, int im)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf00fff0f));
assert(!(im & 0xffffff00));
ii(cc|o|(_u4(rn)<<16)|(_u4(rt)<<12)|((im&0xf0)<<4)|(im&0x0f));
}
static void
_coriw(jit_state_t *_jit, int cc, int o, int rd, int im)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf00fffff));
assert(!(im & 0xffff0000));
ii(cc|o|((im&0xf000)<<4)|(_u4(rd)<<12)|(im&0xfff));
}
static void
_torrr(jit_state_t *_jit, int o, int rn, int rd, int rm)
{
jit_thumb_t thumb;
assert(!(o & 0xf0f0f));
thumb.i = o|(_u4(rn)<<16)|(_u4(rd)<<8)|_u4(rm);
iss(thumb.s[0], thumb.s[1]);
}
static void
_torrrs(jit_state_t *_jit, int o, int rn, int rd, int rm, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x000f0f0f));
assert(!(im & 0xffff8f0f));
thumb.i = o|(_u4(rn)<<16)|(_u4(rd)<<8)|im|_u4(rm);
iss(thumb.s[0], thumb.s[1]);
}
static void
_torxr(jit_state_t *_jit, int o, int rn, int rt, int rm)
{
jit_thumb_t thumb;
assert(!(o & 0xf0f0f));
thumb.i = o|(_u4(rn)<<16)|(_u4(rt)<<12)|_u4(rm);
iss(thumb.s[0], thumb.s[1]);
}
static void
_torrrr(jit_state_t *_jit, int o, int rn, int rl, int rh, int rm)
{
jit_thumb_t thumb;
assert(!(o & 0x000fff0f));
thumb.i = o|(_u4(rn)<<16)|(_u4(rl)<<12)|(_u4(rh)<<8)|_u4(rm);
iss(thumb.s[0], thumb.s[1]);
}
static void
_torrri8(jit_state_t *_jit, int o, int rn, int rt, int rt2, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x000fffff));
assert(!(im & 0xffffff00));
thumb.i = o|(_u4(rn)<<16)|(_u4(rt)<<12)|(_u4(rt2)<<8)|im;
iss(thumb.s[0], thumb.s[1]);
}
static void
_torri(jit_state_t *_jit, int o, int rn, int rd, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x0c0f7fff));
assert(!(im & 0xfbff8f00));
thumb.i = o|(_u4(rn)<<16)|(_u4(rd)<<8)|im;
iss(thumb.s[0], thumb.s[1]);
}
static void
_torri8(jit_state_t *_jit, int o, int rn, int rt, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x000ff0ff));
assert(!(im & 0xffffff00));
thumb.i = o|(_u4(rn)<<16)|(_u4(rt)<<12)|im;
iss(thumb.s[0], thumb.s[1]);
}
static void
_torri12(jit_state_t *_jit, int o, int rn, int rt, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x000fffff));
assert(!(im & 0xfffff000));
thumb.i = o|(_u4(rn)<<16)|(_u4(rt)<<12)|im;
iss(thumb.s[0], thumb.s[1]);
}
static void
_tshift(jit_state_t *_jit, int o, int rd, int rm, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x7fcf));
assert(im >= 0 && im < 32);
thumb.i = o|((im&0x1c)<<10)|(_u4(rd)<<8)|((im&3)<<6)|_u4(rm);
iss(thumb.s[0], thumb.s[1]);
}
static void
_toriw(jit_state_t *_jit, int o, int rd, int im)
{
jit_thumb_t thumb;
assert(!(im & 0xffff0000));
thumb.i = o|((im&0xf000)<<4)|((im&0x800)<<15)|((im&0x700)<<4)|(_u4(rd)<<8)|(im&0xff);
iss(thumb.s[0], thumb.s[1]);
}
static void
_tc8(jit_state_t *_jit, int cc, int im)
{
assert(!(cc & 0x0fffffff));
assert(cc != ARM_CC_AL && cc != ARM_CC_NV);
assert(im >= -128 && im <= 127);
is(THUMB_CC_B|(cc>>20)|(im&0xff));
}
static void
_t11(jit_state_t *_jit, int im)
{
assert(!(im & 0xfffff800));
is(THUMB_B|im);
}
static void
_tcb(jit_state_t *_jit, int cc, int im)
{
jit_thumb_t thumb;
assert(!(cc & 0xfffffff));
assert(cc != ARM_CC_AL && cc != ARM_CC_NV);
cc = ((jit_uint32_t)cc) >> 6;
assert(!(im & (THUMB2_CC_B|cc)));
thumb.i = THUMB2_CC_B|cc|im;
iss(thumb.s[0], thumb.s[1]);
}
static void
_blxi(jit_state_t *_jit, int im)
{
assert(!(im & 0xfe000000));
ii(ARM_BLXI|im);
}
static void
_tb(jit_state_t *_jit, int o, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x07ff2fff));
assert(!(o & im));
thumb.i = o|im;
iss(thumb.s[0], thumb.s[1]);
}
static void
_corrrr(jit_state_t *_jit, int cc, int o, int rh, int rl, int rm, int rn)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf00fff0f));
ii(cc|o|(_u4(rh)<<16)|(_u4(rl)<<12)|(_u4(rm)<<8)|_u4(rn));
}
static void
_corrrs(jit_state_t *_jit, int cc, int o, int rn, int rd, int rm, int im)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf000ff8f));
ii(cc|o|(_u4(rd)<<12)|(_u4(rn)<<16)|(im<<7)|_u4(rm));
}
static void
_cshift(jit_state_t *_jit, int cc, int o, int rd, int rm, int rn, int im)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xffe0ff8f));
assert(((_u4(rm)<<8)&(im<<7)) == 0);
ii(cc|ARM_SHIFT|o|(_u4(rd)<<12)|(_u4(rm)<<8)|(im<<7)|_u4(rn));
}
static void
_cb(jit_state_t *_jit, int cc, int o, int im)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf0ffffff));
ii(cc|o|_u24(im));
}
static void
_cbx(jit_state_t *_jit, int cc, int o, int rm)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf000000f));
ii(cc|o|_u4(rm));
}
static void
_corl(jit_state_t *_jit, int cc, int o, int r0, int i0)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf00fffff));
ii(cc|o|(_u4(r0)<<16)|_u16(i0));
}
static void
_c6orr(jit_state_t *_jit, int cc, int o, int rd, int rm)
{
assert(!(cc & 0x0fffffff));
assert(!(o & 0xf000f00f));
ii(cc|o|(_u4(rd)<<12)|_u4(rm));
}
static void
_tpp(jit_state_t *_jit, int o, int im)
{
jit_thumb_t thumb;
assert(!(o & 0x0000ffff));
if (o == THUMB2_PUSH)
assert(!(im & 0x8000));
assert(__builtin_popcount(im & 0x1fff) > 1);
thumb.i = o|im;
iss(thumb.s[0], thumb.s[1]);
}
static void
_torl(jit_state_t *_jit, int o, int rn, int im)
{
jit_thumb_t thumb;
assert(!(o & 0xf1fff));
assert(rn != _R15 || !im || ((o & 0xc000) == 0xc000));
assert(!(o & THUMB2_LDM_W) || !(im & (1 << rn)));
thumb.i = o | (_u4(rn)<<16)|_u13(im);
iss(thumb.s[0], thumb.s[1]);
}
static void
_nop(jit_state_t *_jit, jit_int32_t i0)
{
if (jit_thumb_p()) {
for (; i0 > 0; i0 -= 2)
T1_NOP();
}
else {
for (; i0 > 0; i0 -= 4)
NOP();
}
assert(i0 == 0);
}
static void
_movr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (r0 != r1) {
if (jit_thumb_p())
T1_MOV(r0, r1);
else
MOV(r0, r1);
}
}
static void
_movi(jit_state_t *_jit, jit_int32_t r0, jit_word_t i0)
{
int i;
if (jit_thumb_p()) {
if (!jit_no_set_flags() && r0 < 8 && !(i0 & 0xffffff80))
T1_MOVI(r0, i0);
else if ((i = encode_thumb_immediate(i0)) != -1)
T2_MOVI(r0, i);
else if ((i = encode_thumb_immediate(~i0)) != -1)
T2_MVNI(r0, i);
else {
T2_MOVWI(r0, (jit_uint16_t)i0);
if (i0 & 0xffff0000)
T2_MOVTI(r0, (jit_uint16_t)((unsigned)i0 >> 16));
}
}
else {
if (jit_armv6_p() && !(i0 & 0xffff0000))
MOVWI(r0, i0);
else if ((i = encode_arm_immediate(i0)) != -1)
MOVI(r0, i);
else if ((i = encode_arm_immediate(~i0)) != -1)
MVNI(r0, i);
else if (jit_armv6_p()) {
MOVWI(r0, (jit_uint16_t)(i0));
if ((i0 & 0xffff0000))
MOVTI(r0, (jit_uint16_t)((unsigned)i0 >> 16));
}
else
load_const(0, r0, i0);
}
}
static jit_word_t
_movi_p(jit_state_t *_jit, jit_int32_t r0, jit_word_t i0)
{
jit_word_t w;
w = _jit->pc.w;
if (jit_thumb_p()) {
T2_MOVWI(r0, (jit_uint16_t)(i0));
T2_MOVTI(r0, (jit_uint16_t)((unsigned)i0 >> 16));
}
else
load_const(1, r0, 0);
return (w);
}
static void
_comr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1) < 8)
T1_NOT(r0, r1);
else
T2_NOT(r0, r1);
}
else
NOT(r0, r1);
}
static void
_negr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1) < 8)
T1_RSBI(r0, r1);
else
T2_RSBI(r0, r1, 0);
}
else
RSBI(r0, r1, 0);
}
static void
_addr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8)
T1_ADD(r0, r1, r2);
else if (r0 == r1 || r0 == r2)
T1_ADDX(r0, r0 == r1 ? r2 : r1);
else
T2_ADD(r0, r1, r2);
}
else
ADD(r0, r1, r2);
}
static void
_addi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1) < 8 && !(i0 & ~7))
T1_ADDI3(r0, r1, i0);
else if (!jit_no_set_flags() && (r0|r1) < 8 && !(-i0 & ~7))
T1_SUBI3(r0, r1, -i0);
else if (!jit_no_set_flags() && r0 < 8 && r0 == r1 && !(i0 & ~0xff))
T1_ADDI8(r0, i0);
else if (!jit_no_set_flags() && r0 < 8 && r0 == r1 && !(-i0 & ~0xff))
T1_SUBI8(r0, -i0);
else if ((i = encode_thumb_immediate(i0)) != -1)
T2_ADDI(r0, r1, i);
else if ((i = encode_thumb_immediate(-i0)) != -1)
T2_SUBI(r0, r1, i);
else if ((i = encode_thumb_word_immediate(i0)) != -1)
T2_ADDWI(r0, r1, i);
else if ((i = encode_thumb_word_immediate(-i0)) != -1)
T2_SUBWI(r0, r1, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_ADD(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
ADDI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
SUBI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
ADD(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
ADD(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_addcr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
/* thumb auto set carry if not inside IT block */
if ((r0|r1|r2) < 8)
T1_ADD(r0, r1, r2);
else
T2_ADDS(r0, r1, r2);
}
else
ADDS(r0, r1, r2);
}
static void
_addci(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && !(i0 & ~7))
T1_ADDI3(r0, r1, i0);
else if ((r0|r1) < 8 && !(-i0 & ~7))
T1_SUBI3(r0, r1, -i0);
else if (r0 < 8 && r0 == r1 && !(i0 & ~0xff))
T1_ADDI8(r0, i0);
else if (r0 < 8 && r0 == r1 && !(-i0 & ~0xff))
T1_SUBI8(r0, -i0);
else if ((i = encode_thumb_immediate(i0)) != -1)
T2_ADDSI(r0, r1, i);
else if ((i = encode_thumb_immediate(-i0)) != -1)
T2_SUBSI(r0, r1, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_ADDS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
ADDSI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
SUBSI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
ADDS(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
ADDS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_addxr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
/* keep setting carry because don't know last ADC */
if (jit_thumb_p()) {
/* thumb auto set carry if not inside IT block */
if ((r0|r1|r2) < 8 && (r0 == r1 || r0 == r2))
T1_ADC(r0, r0 == r1 ? r2 : r1);
else
T2_ADCS(r0, r1, r2);
}
else
ADCS(r0, r1, r2);
}
static void
_addxi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
int no_set_flags;
if (jit_thumb_p()) {
no_set_flags = jit_no_set_flags();
jit_no_set_flags() = 1;
if ((i = encode_thumb_immediate(i0)) != -1)
T2_ADCSI(r0, r1, i);
else if ((i = encode_thumb_immediate(-i0)) != -1)
T2_SBCSI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
T2_ADCS(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_ADCS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
jit_no_set_flags() = no_set_flags;
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
ADCSI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
SBCSI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
ADCS(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
ADCS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_subr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8)
T1_SUB(r0, r1, r2);
else
T2_SUB(r0, r1, r2);
}
else
SUB(r0, r1, r2);
}
static void
_subi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1) < 8 && !(i0 & ~7))
T1_SUBI3(r0, r1, i0);
else if (!jit_no_set_flags() && (r0|r1) < 8 && !(-i0 & ~7))
T1_ADDI3(r0, r1, -i0);
else if (!jit_no_set_flags() && r0 < 8 && r0 == r1 && !(i0 & ~0xff))
T1_SUBI8(r0, i0);
else if (!jit_no_set_flags() && r0 < 8 && r0 == r1 && !(-i0 & ~0xff))
T1_ADDI8(r0, -i0);
else if ((i = encode_thumb_immediate(i0)) != -1)
T2_SUBI(r0, r1, i);
else if ((i = encode_thumb_immediate(-i0)) != -1)
T2_ADDI(r0, r1, i);
else if ((i = encode_thumb_word_immediate(i0)) != -1)
T2_SUBWI(r0, r1, i);
else if ((i = encode_thumb_word_immediate(-i0)) != -1)
T2_ADDWI(r0, r1, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_SUB(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
SUBI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
ADDI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
SUB(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
SUB(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_subcr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
/* thumb auto set carry if not inside IT block */
if ((r0|r1|r2) < 8)
T1_SUB(r0, r1, r2);
else
T2_SUBS(r0, r1, r2);
}
else
SUBS(r0, r1, r2);
}
static void
_subci(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && !(i0 & ~7))
T1_SUBI3(r0, r1, i0);
else if ((r0|r1) < 8 && !(-i0 & ~7))
T1_ADDI3(r0, r1, -i0);
else if (r0 < 8 && r0 == r1 && !(i0 & ~0xff))
T1_SUBI8(r0, i0);
else if (r0 < 8 && r0 == r1 && !(-i0 & ~0xff))
T1_ADDI8(r0, -i0);
else if ((i = encode_thumb_immediate(i0)) != -1)
T2_SUBSI(r0, r1, i);
else if ((i = encode_thumb_immediate(-i0)) != -1)
T2_ADDSI(r0, r1, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_SUBS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
SUBSI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
ADDSI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
SUBS(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
SUBS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_subxr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
/* keep setting carry because don't know last SBC */
if (jit_thumb_p()) {
/* thumb auto set carry if not inside IT block */
if ((r0|r1|r2) < 8 && r0 == r1)
T1_SBC(r0, r2);
else
T2_SBCS(r0, r1, r2);
}
else
SBCS(r0, r1, r2);
}
static void
_subxi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
int no_set_flags;
if (jit_thumb_p()) {
no_set_flags = jit_no_set_flags();
jit_no_set_flags() = 1;
if ((i = encode_arm_immediate(i0)) != -1)
T2_SBCSI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
T2_ADCSI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
T2_SBCS(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
SBCS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
jit_no_set_flags() = no_set_flags;
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
SBCSI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
ADCSI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
SBCS(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
SBCS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_rsbi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
subi(r0, r1, i0);
negr(r0, r0);
}
static void
_mulr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if (!jit_no_set_flags() && r0 == r2 && (r0|r1) < 8)
T1_MUL(r0, r1);
else if (!jit_no_set_flags() && r0 == r1 && (r0|r2) < 8)
T1_MUL(r0, r2);
else
T2_MUL(r0, r1, r2);
}
else {
if (r0 == r1 && !jit_armv6_p()) {
if (r0 != r2)
MUL(r0, r2, r1);
else {
reg = jit_get_reg(jit_class_gpr);
MOV(rn(reg), r1);
MUL(r0, rn(reg), r2);
jit_unget_reg(reg);
}
}
else
MUL(r0, r1, r2);
}
}
static void
_muli(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
mulr(r0, r1, rn(reg));
jit_unget_reg(reg);
}
static void
_iqmulr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1,
jit_int32_t r2, jit_int32_t r3, jit_bool_t sign)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if (r2 == r3) {
reg = jit_get_reg(jit_class_gpr);
movr(rn(reg), r2);
if (sign)
T2_SMULL(r0, r1, rn(reg), r2);
else
T2_UMULL(r0, r1, rn(reg), r2);
jit_unget_reg(reg);
}
else if (r0 != r2 && r1 != r2) {
if (sign)
T2_SMULL(r0, r1, r2, r3);
else
T2_UMULL(r0, r1, r2, r3);
}
else {
if (sign)
T2_SMULL(r0, r1, r3, r2);
else
T2_UMULL(r0, r1, r3, r2);
}
}
else {
if (r2 == r3) {
reg = jit_get_reg(jit_class_gpr);
movr(rn(reg), r2);
if (sign)
SMULL(r0, r1, rn(reg), r2);
else
UMULL(r0, r1, rn(reg), r2);
jit_unget_reg(reg);
}
else if (r0 != r2 && r1 != r2) {
if (sign)
SMULL(r0, r1, r2, r3);
else
UMULL(r0, r1, r2, r3);
}
else {
if (sign)
SMULL(r0, r1, r3, r2);
else
UMULL(r0, r1, r3, r2);
}
}
}
static void
_iqmuli(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1,
jit_int32_t r2, jit_word_t i0, jit_bool_t sign)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
iqmulr(r0, r1, r2, rn(reg), sign);
jit_unget_reg(reg);
}
static void
_divrem(jit_state_t *_jit, int div, int sign,
jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
jit_word_t d;
jit_word_t w;
jit_get_reg_args();
movr(_R0_REGNO, r1);
movr(_R1_REGNO, r2);
if (sign) w = (jit_word_t)__aeabi_idivmod;
else w = (jit_word_t)__aeabi_uidivmod;
if (!jit_exchange_p()) {
if (jit_thumb_p()) d = ((w - _jit->pc.w) >> 1) - 2;
else d = ((w - _jit->pc.w) >> 2) - 2;
if (_s24P(d)) {
if (jit_thumb_p()) T2_BLI(encode_thumb_jump(d));
else BLI(d & 0x00ffffff);
}
else goto fallback;
}
else {
fallback:
movi(_R2_REGNO, w);
if (jit_thumb_p()) T1_BLX(_R2_REGNO);
else BLX(_R2_REGNO);
}
if (div) movr(r0, _R0_REGNO);
else movr(r0, _R1_REGNO);
jit_unget_reg_args();
}
static void
_divr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_armv7r_p() && jit_thumb_p())
T2_SDIV(r0, r1, r2);
else
divrem(1, 1, r0, r1, r2);
}
static void
_divi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
divr(r0, r1, rn(reg));
jit_unget_reg(reg);
}
static void
_divr_u(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_armv7r_p() && jit_thumb_p())
T2_UDIV(r0, r1, r2);
else
divrem(1, 0, r0, r1, r2);
}
static void
_divi_u(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
divr_u(r0, r1, rn(reg));
jit_unget_reg(reg);
}
static void
_iqdivr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1,
jit_int32_t r2, jit_int32_t r3, jit_bool_t sign)
{
jit_word_t d;
jit_word_t w;
jit_get_reg_args();
movr(_R0_REGNO, r2);
movr(_R1_REGNO, r3);
if (sign) w = (jit_word_t)__aeabi_idivmod;
else w = (jit_word_t)__aeabi_uidivmod;
if (!jit_exchange_p()) {
if (jit_thumb_p()) d = ((w - _jit->pc.w) >> 1) - 2;
else d = ((w - _jit->pc.w) >> 2) - 2;
if (_s24P(d)) {
if (jit_thumb_p()) T2_BLI(encode_thumb_jump(d));
else BLI(d & 0x00ffffff);
}
else goto fallback;
}
else {
fallback:
movi(_R2_REGNO, w);
if (jit_thumb_p()) T1_BLX(_R2_REGNO);
else BLX(_R2_REGNO);
}
movr(r0, _R0_REGNO);
movr(r1, _R1_REGNO);
jit_unget_reg_args();
}
static void
_iqdivi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1,
jit_int32_t r2, jit_word_t i0, jit_bool_t sign)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
iqdivr(r0, r1, r2, rn(reg), sign);
jit_unget_reg(reg);
}
static void
_remr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
divrem(0, 1, r0, r1, r2);
}
static void
_remi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
remr(r0, r1, rn(reg));
jit_unget_reg(reg);
}
static void
_remr_u(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
divrem(0, 0, r0, r1, r2);
}
static void
_remi_u(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
remr_u(r0, r1,rn(reg));
jit_unget_reg(reg);
}
static void
_andr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8 && (r0 == r1 || r0 == r2))
T1_AND(r0, r0 == r1 ? r2 : r1);
else
T2_AND(r0, r1, r2);
}
else
AND(r0, r1, r2);
}
static void
_andi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if ((i = encode_thumb_immediate(i0)) != -1)
T2_ANDI(r0, r1, i);
else if ((i = encode_thumb_immediate(~i0)) != -1)
T2_BICI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
T2_AND(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_AND(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
ANDI(r0, r1, i);
else if ((i = encode_arm_immediate(~i0)) != -1)
BICI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
AND(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
AND(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_orr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8 && (r0 == r1 || r0 == r2))
T1_ORR(r0, r0 == r1 ? r2 : r1);
else
T2_ORR(r0, r1, r2);
}
else
ORR(r0, r1, r2);
}
static void
_ori(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if ((i = encode_thumb_immediate(i0)) != -1)
T2_ORRI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
T2_ORR(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_ORR(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
ORRI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
ORR(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
ORR(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_xorr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8 && (r0 == r1 || r0 == r2))
T1_EOR(r0, r0 == r1 ? r2 : r1);
else
T2_EOR(r0, r1, r2);
}
else
EOR(r0, r1, r2);
}
static void
_xori(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if ((i = encode_thumb_immediate(i0)) != -1)
T2_EORI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
T2_EOR(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
T2_EOR(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
EORI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
EOR(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
EOR(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_lshr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8 && r0 == r1)
T1_LSL(r0, r2);
else
T2_LSL(r0, r1, r2);
}
else
LSL(r0, r1, r2);
}
static void
_lshi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
assert(i0 >= 0 && i0 <= 31);
if (i0 == 0)
movr(r0, r1);
else if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1) < 8)
T1_LSLI(r0, r1, i0);
else
T2_LSLI(r0, r1, i0);
}
else
LSLI(r0, r1, i0);
}
static void
_rshr(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8 && r0 == r1)
T1_ASR(r0, r2);
else
T2_ASR(r0, r1, r2);
}
else
ASR(r0, r1, r2);
}
static void
_rshi(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
assert(i0 >= 0 && i0 <= 31);
if (i0 == 0)
movr(r0, r1);
else if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1) < 8)
T1_ASRI(r0, r1, i0);
else
T2_ASRI(r0, r1, i0);
}
else
ASRI(r0, r1, i0);
}
static void
_rshr_u(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1|r2) < 8 && r0 == r1)
T1_LSR(r0, r2);
else
T2_LSR(r0, r1, r2);
}
else
LSR(r0, r1, r2);
}
static void
_rshi_u(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
assert(i0 >= 0 && i0 <= 31);
if (i0 == 0)
movr(r0, r1);
else if (jit_thumb_p()) {
if (!jit_no_set_flags() && (r0|r1) < 8)
T1_LSRI(r0, r1, i0);
else
T2_LSRI(r0, r1, i0);
}
else
LSRI(r0, r1, i0);
}
static void
_ccr(jit_state_t *_jit, int ct, int cf,
jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
assert((ct ^ cf) >> 28 == 1);
if ((r1|r2) < 8)
T1_CMP(r1, r2);
else if ((r1&r2) & 8)
T1_CMPX(r1, r2);
else
T2_CMP(r1, r2);
ITE(ct);
if (r0 < 8) {
T1_MOVI(r0, 1);
T1_MOVI(r0, 0);
}
else {
T2_MOVI(r0, 1);
T2_MOVI(r0, 0);
}
}
else {
CMP(r1, r2);
CC_MOVI(ct, r0, 1);
CC_MOVI(cf, r0, 0);
}
}
static void
_cci(jit_state_t *_jit, int ct, int cf,
jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if (r1 < 7 && !(i0 & 0xffffff00))
T1_CMPI(r1, i0);
else if ((i = encode_thumb_immediate(i0)) != -1)
T2_CMPI(r1, i);
else if ((i = encode_thumb_immediate(-i0)) != -1)
T2_CMNI(r1, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
ccr(ct, cf, r0, r1, rn(reg));
jit_unget_reg(reg);
return;
}
ITE(ct);
if (r0 < 8) {
T1_MOVI(r0, 1);
T1_MOVI(r0, 0);
}
else {
T2_MOVI(r0, 1);
T2_MOVI(r0, 0);
}
}
else {
if ((i = encode_arm_immediate(i0)) != -1)
CMPI(r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
CMNI(r1, i);
else if (r0 != r1) {
movi(r0, i0);
CMP(r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
CMP(r1, rn(reg));
jit_unget_reg(reg);
}
CC_MOVI(ct, r0, 1);
CC_MOVI(cf, r0, 0);
}
}
static void
_ner(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p())
ccr(ARM_CC_NE, ARM_CC_EQ, r0, r1, r2);
else {
SUBS(r0, r1, r2);
CC_MOVI(ARM_CC_NE, r0, 1);
}
}
static void
_nei(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
int i;
jit_int32_t reg;
if (jit_thumb_p())
cci(ARM_CC_NE, ARM_CC_EQ, r0, r1, i0);
else {
if ((i = encode_arm_immediate(i0)) != -1)
SUBSI(r0, r1, i);
else if ((i = encode_arm_immediate(-i0)) != -1)
ADDSI(r0, r1, i);
else if (r0 != r1) {
movi(r0, i0);
SUBS(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
SUBS(r0, r1, rn(reg));
jit_unget_reg(reg);
}
CC_MOVI(ARM_CC_NE, r0, 1);
}
}
static void
_jmpr(jit_state_t *_jit, jit_int32_t r0)
{
if (jit_thumb_p())
T1_MOV(_R15_REGNO, r0);
else
MOV(_R15_REGNO, r0);
}
static void
_jmpi(jit_state_t *_jit, jit_word_t i0)
{
jit_word_t w;
jit_word_t d;
jit_int32_t reg;
w = _jit->pc.w;
/* if thumb and in thumb mode */
if (jit_thumb_p() && _jitc->thumb) {
d = ((i0 - w) >> 1) - 2;
if (d >= -1024 && d <= 1023)
T1_B(d & 0x7ff);
else if (_s24P(d))
T2_B(encode_thumb_jump(d));
else {
reg = jit_get_reg(jit_class_gpr|jit_class_nospill);
movi(rn(reg), i0);
jmpr(rn(reg));
jit_unget_reg(reg);
}
}
else {
d = ((i0 - w) >> 2) - 2;
if (_s24P(d))
B(d & 0x00ffffff);
else {
reg = jit_get_reg(jit_class_gpr|jit_class_nospill);
movi(rn(reg), i0);
jmpr(rn(reg));
jit_unget_reg(reg);
}
}
}
static jit_word_t
_jmpi_p(jit_state_t *_jit, jit_word_t i0, jit_bool_t i1)
{
jit_word_t w;
jit_word_t d;
jit_int32_t reg;
if (i1) {
/* Assume jump is not longer than 23 bits if inside jit */
w = _jit->pc.w;
/* if thumb and in thumb mode */
if (jit_thumb_p() && _jitc->thumb) {
d = ((i0 - w) >> 1) - 2;
assert(_s24P(d));
T2_B(encode_thumb_jump(d));
}
else {
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
B(d & 0x00ffffff);
}
}
else {
reg = jit_get_reg(jit_class_gpr|jit_class_nospill);
w = movi_p(rn(reg), i0);
jmpr(rn(reg));
jit_unget_reg(reg);
}
return (w);
}
static jit_word_t
_bccr(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, jit_int32_t r1)
{
jit_word_t w;
jit_word_t d;
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_CMP(r0, r1);
else if ((r0&r1) & 8)
T1_CMPX(r0, r1);
else
T2_CMP(r0, r1);
/* use only thumb2 conditional as does not know if will be patched */
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
CMP(r0, r1);
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static jit_word_t
_bcci(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, jit_word_t i1)
{
jit_word_t w;
jit_word_t d;
int i;
jit_int32_t reg;
if (jit_thumb_p()) {
if (r0 < 7 && !(i1 & 0xffffff00))
T1_CMPI(r0, i1);
else if ((i = encode_thumb_immediate(i1)) != -1)
T2_CMPI(r0, i);
else if ((i = encode_thumb_immediate(-i1)) != -1)
T2_CMNI(r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
T2_CMP(r0, rn(reg));
jit_unget_reg(reg);
}
/* use only thumb2 conditional as does not know if will be patched */
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
if ((i = encode_arm_immediate(i1)) != -1)
CMPI(r0, i);
else if ((i = encode_arm_immediate(-i1)) != -1)
CMNI(r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
CMP(r0, rn(reg));
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static jit_word_t
_baddr(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, jit_int32_t r1)
{
jit_word_t w;
jit_word_t d;
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_ADD(r0, r0, r1);
else
T2_ADDS(r0, r0, r1);
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
ADDS(r0, r0, r1);
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static jit_word_t
_baddi(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, int i1)
{
int i;
jit_word_t w;
jit_word_t d;
jit_int32_t reg;
if (jit_thumb_p()) {
if (r0 < 8 && !(i1 & ~7))
T1_ADDI3(r0, r0, i1);
else if (r0 < 8 && !(-i1 & ~7))
T1_SUBI3(r0, r0, -i1);
else if (r0 < 8 && !(i1 & ~0xff))
T1_ADDI8(r0, i1);
else if (r0 < 8 && !(-i1 & ~0xff))
T1_SUBI8(r0, -i1);
else if ((i = encode_thumb_immediate(i1)) != -1)
T2_ADDSI(r0, r0, i);
else if ((i = encode_thumb_immediate(-i1)) != -1)
T2_SUBSI(r0, r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
T2_ADDS(r0, r0, rn(reg));
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
if ((i = encode_arm_immediate(i1)) != -1)
ADDSI(r0, r0, i);
else if ((i = encode_arm_immediate(-i1)) != -1)
SUBSI(r0, r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
ADDS(r0, r0, rn(reg));
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static jit_word_t
_bsubr(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, jit_int32_t r1)
{
jit_word_t w;
jit_word_t d;
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_SUB(r0, r0, r1);
else
T2_SUBS(r0, r0, r1);
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
SUBS(r0, r0, r1);
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static jit_word_t
_bsubi(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, int i1)
{
int i;
jit_word_t w;
jit_word_t d;
jit_int32_t reg;
if (jit_thumb_p()) {
if (r0 < 8 && !(i1 & ~7))
T1_SUBI3(r0, r0, i1);
else if (r0 < 8 && !(-i1 & ~7))
T1_ADDI3(r0, r0, -i1);
else if (r0 < 8 && !(i1 & ~0xff))
T1_SUBI8(r0, i1);
else if (r0 < 8 && !(-i1 & ~0xff))
T1_ADDI8(r0, -i1);
else if ((i = encode_thumb_immediate(i1)) != -1)
T2_SUBSI(r0, r0, i);
else if ((i = encode_thumb_immediate(-i1)) != -1)
T2_SUBSI(r0, r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
T2_SUBS(r0, r0, rn(reg));
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
if ((i = encode_arm_immediate(i1)) != -1)
SUBSI(r0, r0, i);
else if ((i = encode_arm_immediate(-i1)) != -1)
ADDSI(r0, r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
SUBS(r0, r0, rn(reg));
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static jit_word_t
_bmxr(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, jit_int32_t r1)
{
jit_word_t w;
jit_word_t d;
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_TST(r0, r1);
else
T2_TST(r0, r1);
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
if (jit_armv5_p())
TST(r0, r1);
else {
reg = jit_get_reg(jit_class_gpr);
ANDS(rn(reg), r0, r1);
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static jit_word_t
_bmxi(jit_state_t *_jit, int cc, jit_word_t i0, jit_int32_t r0, jit_word_t i1)
{
int i;
jit_word_t w;
jit_word_t d;
jit_int32_t reg;
if (jit_thumb_p()) {
if ((i = encode_thumb_immediate(i1)) != -1)
T2_TSTI(r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
T2_TST(r0, rn(reg));
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 1) - 2;
assert(_s20P(d));
T2_CC_B(cc, encode_thumb_cc_jump(d));
}
else {
if (jit_armv5_p()) {
if ((i = encode_arm_immediate(i1)) != -1)
TSTI(r0, i);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i1);
TST(r0, rn(reg));
jit_unget_reg(reg);
}
}
else {
reg = jit_get_reg(jit_class_gpr);
if ((i = encode_arm_immediate(i1)) != -1)
ANDSI(rn(reg), r0, i);
else if ((i = encode_arm_immediate(~i1)) != -1)
BICSI(rn(reg), r0, i);
else {
movi(rn(reg), i1);
ANDS(rn(reg), r0, rn(reg));
}
jit_unget_reg(reg);
}
w = _jit->pc.w;
d = ((i0 - w) >> 2) - 2;
assert(_s24P(d));
CC_B(cc, d & 0x00ffffff);
}
return (w);
}
static void
_ldr_c(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_LDRSBI(r0, r1, 0);
else
LDRSBI(r0, r1, 0);
}
static void
_ldi_c(jit_state_t *_jit, jit_int32_t r0, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_LDRSBI(r0, rn(reg), 0);
else
LDRSBI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_ldxr_c(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_LDRSB(r0, r1, r2);
else
T2_LDRSB(r0, r1, r2);
}
else
LDRSB(r0, r1, r2);
}
static void
_ldxi_c(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_LDRSBI(r0, r1, i0);
else if (i0 < 0 && i0 >= -255)
T2_LDRSBIN(r0, r1, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_LDRSBWI(r0, r1, i0);
else if (r0 != r1) {
movi(r0, i0);
if ((r0|r1) < 8)
T1_LDRSB(r0, r1, r0);
else
T2_LDRSB(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_LDRSB(r0, r1, rn(reg));
else
T2_LDRSB(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 255)
LDRSBI(r0, r1, i0);
else if (i0 < 0 && i0 >= -255)
LDRSBIN(r0, r1, -i0);
else if (r0 != r1) {
movi(r0, i0);
LDRSB(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
LDRSB(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_ldr_uc(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_LDRBI(r0, r1, 0);
else
LDRBI(r0, r1, 0);
}
static void
_ldi_uc(jit_state_t *_jit, jit_int32_t r0, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_LDRBI(r0, rn(reg), 0);
else
LDRBI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_ldxr_uc(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_LDRB(r0, r1, r2);
else
T2_LDRB(r0, r1, r2);
}
else
LDRB(r0, r1, r2);
}
static void
_ldxi_uc(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && i0 >= 0 && i0 < 0x20)
T1_LDRBI(r0, r1, i0);
else if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_LDRBI(r0, r1, i0);
else if (i0 < 0 && i0 >= -255)
T2_LDRBIN(r0, r1, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_LDRBWI(r0, r1, i0);
else if (r0 != r1) {
movi(r0, i0);
if ((r0|r1) < 8)
T1_LDRB(r0, r1, r0);
else
T2_LDRB(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_LDRB(r0, r1, rn(reg));
else
T2_LDRB(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 4095)
LDRBI(r0, r1, i0);
else if (i0 < 0 && i0 >= -4095)
LDRBIN(r0, r1, -i0);
else if (r0 != r1) {
movi(r0, i0);
LDRB(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
LDRB(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_ldr_s(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_LDRSHI(r0, r1, 0);
else
LDRSHI(r0, r1, 0);
}
static void
_ldi_s(jit_state_t *_jit, jit_int32_t r0, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_LDRSHI(r0, rn(reg), 0);
else
LDRSHI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_ldxr_s(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_LDRSH(r0, r1, r2);
else
T2_LDRSH(r0, r1, r2);
}
else
LDRSH(r0, r1, r2);
}
static void
_ldxi_s(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_LDRSHI(r0, r1, i0);
else if (i0 < 0 && i0 >= -255)
T2_LDRSHIN(r0, r1, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_LDRSHWI(r0, r1, i0);
else if (r0 != r1) {
movi(r0, i0);
if ((r0|r1) < 8)
T1_LDRSH(r0, r1, r0);
else
T2_LDRSH(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_LDRSH(r0, r1, rn(reg));
else
T2_LDRSH(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 255)
LDRSHI(r0, r1, i0);
else if (i0 < 0 && i0 >= -255)
LDRSHIN(r0, r1, -i0);
else if (r0 != r1) {
movi(r0, i0);
LDRSH(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
LDRSH(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_ldr_us(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_LDRHI(r0, r1, 0);
else
LDRHI(r0, r1, 0);
}
static void
_ldi_us(jit_state_t *_jit, jit_int32_t r0, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_LDRHI(r0, rn(reg), 0);
else
LDRHI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_ldxr_us(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_LDRH(r0, r1, r2);
else
T2_LDRH(r0, r1, r2);
}
else
LDRH(r0, r1, r2);
}
static void
_ldxi_us(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && i0 >= 0 && !(i0 & 1) && (i0 >> 1) < 0x20)
T1_LDRHI(r0, r1, i0 >> 1);
else if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_LDRHI(r0, r1, i0);
else if (i0 < 0 && i0 >= -255)
T2_LDRHIN(r0, r1, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_LDRHWI(r0, r1, i0);
else if (r0 != r1) {
movi(r0, i0);
if ((r0|r1) < 8)
T1_LDRH(r0, r1, r0);
else
T2_LDRH(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_LDRH(r0, r1, rn(reg));
else
T2_LDRH(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 255)
LDRHI(r0, r1, i0);
else if (i0 < 0 && i0 >= -255)
LDRHIN(r0, r1, -i0);
else if (r0 != r1) {
movi(r0, i0);
LDRH(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
LDRH(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_ldr_i(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_LDRI(r0, r1, 0);
else
LDRI(r0, r1, 0);
}
static void
_ldi_i(jit_state_t *_jit, jit_int32_t r0, jit_word_t i0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_LDRI(r0, rn(reg), 0);
else
LDRI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_ldxr_i(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_LDR(r0, r1, r2);
else
T2_LDR(r0, r1, r2);
}
else
LDR(r0, r1, r2);
}
static void
_ldxi_i(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_word_t i0)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && i0 >= 0 && !(i0 & 3) && (i0 >> 2) < 0x20)
T1_LDRI(r0, r1, i0 >> 2);
else if (r1 == _R13_REGNO && r0 < 8 &&
i0 >= 0 && !(i0 & 3) && (i0 >> 2) <= 255)
T1_LDRISP(r0, i0 >> 2);
else if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_LDRI(r0, r1, i0);
else if (i0 < 0 && i0 > -255)
T2_LDRIN(r0, r1, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_LDRWI(r0, r1, i0);
else if (r0 != r1) {
movi(r0, i0);
if ((r0|r1) < 8)
T1_LDR(r0, r1, r0);
else
T2_LDR(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_LDR(r0, r1, rn(reg));
else
T2_LDR(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 4095)
LDRI(r0, r1, i0);
else if (i0 < 0 && i0 >= -4095)
LDRIN(r0, r1, -i0);
else if (r0 != r1) {
movi(r0, i0);
LDR(r0, r1, r0);
}
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
LDR(r0, r1, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_str_c(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_STRBI(r1, r0, 0);
else
STRBI(r1, r0, 0);
}
static void
_sti_c(jit_state_t *_jit, jit_word_t i0, jit_int32_t r0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_STRBI(r0, rn(reg), 0);
else
STRBI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_stxr_c(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_STRB(r2, r1, r0);
else
T2_STRB(r2, r1, r0);
}
else
STRB(r2, r1, r0);
}
static void
_stxi_c(jit_state_t *_jit, jit_word_t i0, jit_int32_t r0, jit_int32_t r1)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && i0 >= 0 && i0 < 0x20)
T1_STRBI(r1, r0, i0);
else if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_STRBI(r1, r0, i0);
else if (i0 < 0 && i0 >= -255)
T2_STRBIN(r1, r0, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_STRBWI(r1, r0, i0);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_STRB(r1, r0, rn(reg));
else
T2_STRB(r1, r0, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 4095)
STRBI(r1, r0, i0);
else if (i0 < 0 && i0 >= -4095)
STRBIN(r1, r0, -i0);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
STRB(r1, r0, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_str_s(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_STRHI(r1, r0, 0);
else
STRHI(r1, r0, 0);
}
static void
_sti_s(jit_state_t *_jit, jit_word_t i0, jit_int32_t r0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_STRHI(r0, rn(reg), 0);
else
STRHI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_stxr_s(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_STRH(r2, r1, r0);
else
T2_STRH(r2, r1, r0);
}
else
STRH(r2, r1, r0);
}
static void
_stxi_s(jit_state_t *_jit, jit_word_t i0, jit_int32_t r0, jit_int32_t r1)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && i0 >= 0 && !(i0 & 1) && (i0 >> 1) < 0x20)
T1_STRHI(r1, r0, i0 >> 1);
else if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_STRHI(r1, r0, i0);
else if (i0 < 0 && i0 >= -255)
T2_STRHIN(r1, r0, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_STRHWI(r1, r0, i0);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_STRH(r1, r0, rn(reg));
else
T2_STRH(r1, r0, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 255)
STRHI(r1, r0, i0);
else if (i0 < 0 && i0 >= -255)
STRHIN(r1, r0, -i0);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
STRH(r1, r0, rn(reg));
jit_unget_reg(reg);
}
}
}
static void
_str_i(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p())
T2_STRI(r1, r0, 0);
else
STRI(r1, r0, 0);
}
static void
_sti_i(jit_state_t *_jit, jit_word_t i0, jit_int32_t r0)
{
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T2_STRI(r0, rn(reg), 0);
else
STRI(r0, rn(reg), 0);
jit_unget_reg(reg);
}
static void
_stxr_i(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1, jit_int32_t r2)
{
if (jit_thumb_p()) {
if ((r0|r1|r2) < 8)
T1_STR(r2, r1, r0);
else
T2_STR(r2, r1, r0);
}
else
STR(r2, r1, r0);
}
static void
_stxi_i(jit_state_t *_jit, jit_word_t i0, jit_int32_t r0, jit_int32_t r1)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8 && i0 >= 0 && !(i0 & 3) && (i0 >> 2) < 0x20)
T1_STRI(r1, r0, i0 >> 2);
else if (r0 == _R13_REGNO && r1 < 8 &&
i0 >= 0 && !(i0 & 3) && (i0 >> 2) <= 255)
T1_STRISP(r1, i0 >> 2);
else if (jit_ldrt_strt_p() && i0 >= 0 && i0 <= 255)
T2_STRI(r1, r0, i0);
else if (i0 < 0 && i0 >= -255)
T2_STRIN(r1, r0, -i0);
else if (i0 >= 0 && i0 <= 4095)
T2_STRWI(r1, r0, i0);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if ((r0|r1|rn(reg)) < 8)
T1_STR(r1, r0, rn(reg));
else
T2_STR(r1, r0, rn(reg));
jit_unget_reg(reg);
}
}
else {
if (i0 >= 0 && i0 <= 4095)
STRI(r1, r0, i0);
else if (i0 < 0 && i0 >= -4095)
STRIN(r1, r0, -i0);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
STR(r1, r0, rn(reg));
jit_unget_reg(reg);
}
}
}
# if __BYTE_ORDER == __LITTLE_ENDIAN
static void
_htonr_us(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
jit_int32_t t0;
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_REV(r0, r1);
else
T2_REV(r0, r1);
rshi_u(r0, r0, 16);
}
else {
if (jit_armv6_p()) {
REV(r0, r1);
rshi_u(r0, r0, 16);
}
else {
t0 = jit_get_reg(jit_class_gpr);
rshi(rn(t0), r1, 8);
andi(r0, r1, 0xff);
andi(rn(t0), rn(t0), 0xff);
lshi(r0, r0, 8);
orr(r0, r0, rn(t0));
jit_unget_reg(t0);
}
}
}
/* inline glibc htonl (without register clobber) */
static void
_htonr_ui(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
jit_int32_t reg;
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_REV(r0, r1);
else
T2_REV(r0, r1);
}
else {
if (jit_armv6_p())
REV(r0, r1);
else {
reg = jit_get_reg(jit_class_gpr);
EOR_SI(rn(reg), r1, r1, ARM_ROR, 16);
LSRI(rn(reg), rn(reg), 8);
BICI(rn(reg), rn(reg), encode_arm_immediate(0xff00));
EOR_SI(r0, rn(reg), r1, ARM_ROR, 8);
jit_unget_reg(reg);
}
}
}
#endif
static void
_extr_c(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_SXTB(r0, r1);
else
T2_SXTB(r0, r1);
}
else {
if (jit_armv6_p())
SXTB(r0, r1);
else {
LSLI(r0, r1, 24);
ASRI(r0, r0, 24);
}
}
}
static void
_extr_uc(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_UXTB(r0, r1);
else
T2_UXTB(r0, r1);
}
else {
if (jit_armv6_p())
UXTB(r0, r1);
else
ANDI(r0, r1, 0xff);
}
}
static void
_extr_s(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_SXTH(r0, r1);
else
T2_SXTH(r0, r1);
}
else {
if (jit_armv6_p())
SXTH(r0, r1);
else {
LSLI(r0, r1, 16);
ASRI(r0, r0, 16);
}
}
}
static void
_extr_us(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
if (jit_thumb_p()) {
if ((r0|r1) < 8)
T1_UXTH(r0, r1);
else
T2_UXTH(r0, r1);
}
else {
if (jit_armv6_p())
UXTH(r0, r1);
else {
LSLI(r0, r1, 16);
LSRI(r0, r0, 16);
}
}
}
static void
_callr(jit_state_t *_jit, jit_int32_t r0)
{
if (jit_thumb_p())
T1_BLX(r0);
else
BLX(r0);
}
static void
_calli(jit_state_t *_jit, jit_word_t i0)
{
jit_word_t d;
jit_int32_t reg;
d = ((i0 - _jit->pc.w) >> 2) - 2;
if (!jit_exchange_p() && !jit_thumb_p() && _s24P(d))
BLI(d & 0x00ffffff);
else {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), i0);
if (jit_thumb_p())
T1_BLX(rn(reg));
else
BLX(rn(reg));
jit_unget_reg(reg);
}
}
static jit_word_t
_calli_p(jit_state_t *_jit, jit_word_t i0)
{
jit_word_t w;
jit_int32_t reg;
reg = jit_get_reg(jit_class_gpr);
w = _jit->pc.w;
movi_p(rn(reg), i0);
if (jit_thumb_p())
T1_BLX(rn(reg));
else
BLX(rn(reg));
jit_unget_reg(reg);
return (w);
}
static void
_prolog(jit_state_t *_jit, jit_node_t *node)
{
jit_int32_t reg;
if (_jitc->function->define_frame || _jitc->function->assume_frame) {
jit_int32_t frame = -_jitc->function->frame;
assert(_jitc->function->self.aoff >= frame);
if (_jitc->function->assume_frame) {
if (jit_thumb_p() && !_jitc->thumb)
_jitc->thumb = _jit->pc.w;
return;
}
_jitc->function->self.aoff = frame;
}
if (_jitc->function->allocar)
_jitc->function->self.aoff &= -8;
_jitc->function->stack = ((_jitc->function->self.alen -
/* align stack at 8 bytes */
_jitc->function->self.aoff) + 7) & -8;
if (jit_thumb_p()) {
/* switch to thumb mode (better approach would be to
* ORR 1 address being called, but no clear distinction
* of what is a pointer to a jit function, or if patching
* a pointer to a jit function) */
ADDI(_R12_REGNO, _R15_REGNO, 1);
BX(_R12_REGNO);
if (!_jitc->thumb)
_jitc->thumb = _jit->pc.w;
if (jit_cpu.abi) {
T2_PUSH(0xf);
T2_PUSH(0x3f0|(1<<_FP_REGNO)|(1<<_LR_REGNO));
VPUSH_F64(_D8_REGNO, 8);
}
else {
T2_PUSH(0xf);
T2_PUSH(0x3f0|(1<<_FP_REGNO)|(1<<_LR_REGNO));
}
}
else {
if (jit_cpu.abi) {
PUSH(0xf);
PUSH(0x3f0|(1<<_FP_REGNO)|(1<<_LR_REGNO));
VPUSH_F64(_D8_REGNO, 8);
}
else {
PUSH(0xf);
PUSH(0x3f0|(1<<_FP_REGNO)|(1<<_LR_REGNO));
}
}
movr(_FP_REGNO, _SP_REGNO);
if (_jitc->function->stack)
subi(_SP_REGNO, _SP_REGNO, _jitc->function->stack);
if (_jitc->function->allocar) {
reg = jit_get_reg(jit_class_gpr);
movi(rn(reg), _jitc->function->self.aoff);
stxi_i(_jitc->function->aoffoff, _FP_REGNO, rn(reg));
jit_unget_reg(reg);
}
}
static void
_epilog(jit_state_t *_jit, jit_node_t *node)
{
if (_jitc->function->assume_frame)
return;
movr(_SP_REGNO, _FP_REGNO);
if (jit_cpu.abi)
VPOP_F64(_D8_REGNO, 8);
if (jit_thumb_p())
T2_POP(0x3f0|(1<<_FP_REGNO)|(1<<_LR_REGNO));
else
POP(0x3f0|(1<<_FP_REGNO)|(1<<_LR_REGNO));
addi(_SP_REGNO, _SP_REGNO, 16);
if (jit_thumb_p())
T1_BX(_LR_REGNO);
else
BX(_LR_REGNO);
if (jit_thumb_p() && (_jit->pc.w & 2))
T1_NOP();
}
static void
_vastart(jit_state_t *_jit, jit_int32_t r0)
{
assert(_jitc->function->self.call & jit_call_varargs);
/* Initialize stack pointer to the first stack argument.
* The -16 is to account for the 4 argument registers
* always saved, and _jitc->function->vagp is to account
* for declared arguments. */
addi(r0, _FP_REGNO, _jitc->function->self.size -
16 + _jitc->function->vagp);
}
static void
_vaarg(jit_state_t *_jit, jit_int32_t r0, jit_int32_t r1)
{
assert(_jitc->function->self.call & jit_call_varargs);
/* Load argument. */
ldr(r0, r1);
/* Update stack pointer. */
addi(r1, r1, sizeof(jit_word_t));
}
static void
_patch_at(jit_state_t *_jit,
jit_int32_t kind, jit_word_t instr, jit_word_t label)
{
jit_word_t d;
jit_thumb_t thumb;
union {
jit_int16_t *s;
jit_int32_t *i;
jit_word_t w;
} u;
u.w = instr;
if (kind == arm_patch_jump) {
if (jit_thumb_p() && (jit_uword_t)instr >= _jitc->thumb) {
code2thumb(thumb.s[0], thumb.s[1], u.s[0], u.s[1]);
if ((thumb.i & THUMB2_B) == THUMB2_B) {
d = ((label - instr) >> 1) - 2;
assert(_s24P(d));
thumb.i = THUMB2_B | encode_thumb_jump(d);
thumb2code(thumb.s[0], thumb.s[1], u.s[0], u.s[1]);
}
else if ((thumb.i & THUMB2_B) == THUMB2_CC_B) {
d = ((label - instr) >> 1) - 2;
assert(_s20P(d));
thumb.i = THUMB2_CC_B | (thumb.i & 0x3c00000) |
encode_thumb_cc_jump(d);
thumb2code(thumb.s[0], thumb.s[1], u.s[0], u.s[1]);
}
else {
/* for the sake of simplicity in case choose to
* movw+movt+[bx|blx], e.g. if changing to instead
* of asserting target is reachable, load constant
* and do indirect jump if not reachable */
if ((thumb.i & 0xfbf00000) == THUMB2_MOVWI)
goto indirect_jump;
assert(!"handled branch opcode");
}
}
else {
thumb.i = u.i[0];
/* 0x0e000000 because 0x01000000 is (branch&) link modifier */
assert((thumb.i & 0x0e000000) == ARM_B);
d = ((label - instr) >> 2) - 2;
assert(_s24P(d));
u.i[0] = (thumb.i & 0xff000000) | (d & 0x00ffffff);
}
}
else if (kind == arm_patch_load) {
/* offset may be negative for a forward patch because it
* is relative to pc + 8, for example:
* ldr r0, [pc, #-4]
* bx r0 ;; [pc, #-8]
* .data ... ;; [pc, #-4]
* ... ;; [pc]
*/
assert(!jit_thumb_p());
thumb.i = u.i[0];
assert((thumb.i & 0x0f700000) == ARM_LDRI);
d = label - (instr + 8);
if (d < 0) {
thumb.i &= ~ARM_P;
d = -d;
}
else
thumb.i |= ARM_P;
assert(!(d & 0xfffff000));
u.i[0] = (thumb.i & 0xfffff000) | d;
}
else if (kind == arm_patch_word) {
if (jit_thumb_p()) {
code2thumb(thumb.s[0], thumb.s[1], u.s[0], u.s[1]);
assert((thumb.i & 0xfbf00000) == THUMB2_MOVWI);
indirect_jump:
thumb.i = ((thumb.i & 0xfbf00f00) |
( (label & 0x0000f000) << 4) |
( (label & 0x00000800) << 15) |
( (label & 0x00000700) << 4) |
( label & 0x000000ff));
thumb2code(thumb.s[0], thumb.s[1], u.s[0], u.s[1]);
label >>= 16;
code2thumb(thumb.s[0], thumb.s[1], u.s[2], u.s[3]);
assert((thumb.i & 0xfbf00000) == THUMB2_MOVTI);
thumb.i = ((thumb.i & 0xfbf00f00) |
( (label & 0x0000f000) << 4) |
( (label & 0x00000800) << 15) |
( (label & 0x00000700) << 4) |
( label & 0x000000ff));
thumb2code(thumb.s[0], thumb.s[1], u.s[2], u.s[3]);
}
else
u.i[0] = label;
}
else
assert(!"handled patch");
}
#endif
|
the_stack_data/90766696.c | #include <stdio.h>
int main(int argc, char const *argv[]) {
float acres, meters;
printf("Insert an area in square acres: ");
scanf("%f", &acres);
meters = acres * 4048.58;
printf("%.2f acres is %.2f meters", acres, meters);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.